1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
|
/*
* Copyright (C) 2009 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include "Parser.h"
#include "ParserArena.h"
#include "Nodes.h"
namespace JSC {
ParserArena::ParserArena()
: m_freeableMemory(0)
, m_freeablePoolEnd(0)
, m_identifierArena(new IdentifierArena)
{
}
inline void* ParserArena::freeablePool()
{
ASSERT(m_freeablePoolEnd);
return m_freeablePoolEnd - freeablePoolSize;
}
inline void ParserArena::deallocateObjects()
{
if (m_freeablePoolEnd)
fastFree(freeablePool());
size_t size = m_freeablePools.size();
for (size_t i = 0; i < size; ++i)
fastFree(m_freeablePools[i]);
size = m_deletableObjects.size();
for (size_t i = 0; i < size; ++i) {
ParserArenaDeletable* object = m_deletableObjects[i];
object->~ParserArenaDeletable();
fastFree(object);
}
}
ParserArena::~ParserArena()
{
deallocateObjects();
}
bool ParserArena::contains(ParserArenaRefCounted* object) const
{
return m_refCountedObjects.find(object) != notFound;
}
ParserArenaRefCounted* ParserArena::last() const
{
return m_refCountedObjects.last().get();
}
void ParserArena::removeLast()
{
m_refCountedObjects.removeLast();
}
void ParserArena::reset()
{
// Since this code path is used only when parsing fails, it's not bothering to reuse
// any of the memory the arena allocated. We could improve that later if we want to
// efficiently reuse the same arena.
deallocateObjects();
m_freeableMemory = 0;
m_freeablePoolEnd = 0;
m_identifierArena->clear();
m_freeablePools.clear();
m_deletableObjects.clear();
m_refCountedObjects.clear();
}
void ParserArena::allocateFreeablePool()
{
if (m_freeablePoolEnd)
m_freeablePools.append(freeablePool());
char* pool = static_cast<char*>(fastMalloc(freeablePoolSize));
m_freeableMemory = pool;
m_freeablePoolEnd = pool + freeablePoolSize;
ASSERT(freeablePool() == pool);
}
bool ParserArena::isEmpty() const
{
return !m_freeablePoolEnd
&& m_identifierArena->isEmpty()
&& m_freeablePools.isEmpty()
&& m_deletableObjects.isEmpty()
&& m_refCountedObjects.isEmpty();
}
void ParserArena::derefWithArena(PassRefPtr<ParserArenaRefCounted> object)
{
m_refCountedObjects.append(object);
}
void* ParserArenaFreeable::operator new(size_t size, JSGlobalData* globalData)
{
return globalData->parser->arena().allocateFreeable(size);
}
void* ParserArenaDeletable::operator new(size_t size, JSGlobalData* globalData)
{
return globalData->parser->arena().allocateDeletable(size);
}
}
|
