2
* Copyright (C) 2009 Apple Inc. All rights reserved.
4
* Redistribution and use in source and binary forms, with or without
5
* modification, are permitted provided that the following conditions
7
* 1. Redistributions of source code must retain the above copyright
8
* notice, this list of conditions and the following disclaimer.
9
* 2. Redistributions in binary form must reproduce the above copyright
10
* notice, this list of conditions and the following disclaimer in the
11
* documentation and/or other materials provided with the distribution.
13
* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
14
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
15
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
16
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
17
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
18
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
19
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
20
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
21
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
22
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
23
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29
#include "Identifier.h"
30
#include "SegmentedVector.h"
34
class ParserArenaDeletable;
35
class ParserArenaRefCounted;
37
typedef SegmentedVector<Identifier, 64> IdentifierArena;
39
class ParserArena : Noncopyable {
44
void swap(ParserArena& otherArena)
46
std::swap(m_freeableMemory, otherArena.m_freeableMemory);
47
std::swap(m_freeablePoolEnd, otherArena.m_freeablePoolEnd);
48
m_identifierArena.swap(otherArena.m_identifierArena);
49
m_freeablePools.swap(otherArena.m_freeablePools);
50
m_deletableObjects.swap(otherArena.m_deletableObjects);
51
m_refCountedObjects.swap(otherArena.m_refCountedObjects);
54
void* allocateFreeable(size_t size)
57
ASSERT(size <= freeablePoolSize);
58
size_t alignedSize = alignSize(size);
59
ASSERT(alignedSize <= freeablePoolSize);
60
if (UNLIKELY(static_cast<size_t>(m_freeablePoolEnd - m_freeableMemory) < alignedSize))
61
allocateFreeablePool();
62
void* block = m_freeableMemory;
63
m_freeableMemory += alignedSize;
67
void* allocateDeletable(size_t size)
69
ParserArenaDeletable* deletable = static_cast<ParserArenaDeletable*>(fastMalloc(size));
70
m_deletableObjects.append(deletable);
74
void derefWithArena(PassRefPtr<ParserArenaRefCounted> object) { m_refCountedObjects.append(object); }
75
bool contains(ParserArenaRefCounted*) const;
76
ParserArenaRefCounted* last() const;
82
const Identifier& makeIdentifier(JSGlobalData*, const UChar* character, size_t length);
83
const Identifier& makeNumericIdentifier(JSGlobalData*, double number);
85
IdentifierArena& identifierArena() { return *m_identifierArena; }
88
static const size_t freeablePoolSize = 8000;
90
static size_t alignSize(size_t size)
92
return (size + sizeof(WTF::AllocAlignmentInteger) - 1) & ~(sizeof(WTF::AllocAlignmentInteger) - 1);
96
void allocateFreeablePool();
97
void deallocateObjects();
99
char* m_freeableMemory;
100
char* m_freeablePoolEnd;
102
OwnPtr<IdentifierArena> m_identifierArena;
103
Vector<void*> m_freeablePools;
104
Vector<ParserArenaDeletable*> m_deletableObjects;
105
Vector<RefPtr<ParserArenaRefCounted> > m_refCountedObjects;
108
ALWAYS_INLINE const Identifier& makeIdentifier(IdentifierArena& arena, JSGlobalData* globalData, const UChar* characters, size_t length)
110
arena.append(Identifier(globalData, characters, length));
114
ALWAYS_INLINE const Identifier& ParserArena::makeIdentifier(JSGlobalData* globalData, const UChar* characters, size_t length)
116
return JSC::makeIdentifier(*m_identifierArena, globalData, characters, length);