]>
Commit | Line | Data |
---|---|---|
ba379fdc | 1 | /* |
14957cd0 | 2 | * Copyright (C) 2009, 2010 Apple Inc. All rights reserved. |
ba379fdc A |
3 | * |
4 | * Redistribution and use in source and binary forms, with or without | |
5 | * modification, are permitted provided that the following conditions | |
6 | * are met: | |
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. | |
12 | * | |
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. | |
24 | */ | |
25 | ||
26 | #include "config.h" | |
27 | #include "ParserArena.h" | |
28 | ||
29 | #include "Nodes.h" | |
14957cd0 | 30 | #include <wtf/PassOwnPtr.h> |
ba379fdc A |
31 | |
32 | namespace JSC { | |
33 | ||
f9bf01c6 A |
34 | ParserArena::ParserArena() |
35 | : m_freeableMemory(0) | |
36 | , m_freeablePoolEnd(0) | |
f9bf01c6 A |
37 | { |
38 | } | |
39 | ||
40 | inline void* ParserArena::freeablePool() | |
41 | { | |
42 | ASSERT(m_freeablePoolEnd); | |
43 | return m_freeablePoolEnd - freeablePoolSize; | |
44 | } | |
45 | ||
46 | inline void ParserArena::deallocateObjects() | |
47 | { | |
6fe7ccc8 A |
48 | size_t size = m_deletableObjects.size(); |
49 | for (size_t i = 0; i < size; ++i) | |
50 | m_deletableObjects[i]->~ParserArenaDeletable(); | |
51 | ||
f9bf01c6 A |
52 | if (m_freeablePoolEnd) |
53 | fastFree(freeablePool()); | |
54 | ||
6fe7ccc8 | 55 | size = m_freeablePools.size(); |
f9bf01c6 A |
56 | for (size_t i = 0; i < size; ++i) |
57 | fastFree(m_freeablePools[i]); | |
f9bf01c6 A |
58 | } |
59 | ||
ba379fdc A |
60 | ParserArena::~ParserArena() |
61 | { | |
f9bf01c6 | 62 | deallocateObjects(); |
ba379fdc A |
63 | } |
64 | ||
65 | bool ParserArena::contains(ParserArenaRefCounted* object) const | |
66 | { | |
67 | return m_refCountedObjects.find(object) != notFound; | |
68 | } | |
69 | ||
70 | ParserArenaRefCounted* ParserArena::last() const | |
71 | { | |
72 | return m_refCountedObjects.last().get(); | |
73 | } | |
74 | ||
75 | void ParserArena::removeLast() | |
76 | { | |
77 | m_refCountedObjects.removeLast(); | |
78 | } | |
79 | ||
80 | void ParserArena::reset() | |
81 | { | |
f9bf01c6 A |
82 | // Since this code path is used only when parsing fails, it's not bothering to reuse |
83 | // any of the memory the arena allocated. We could improve that later if we want to | |
84 | // efficiently reuse the same arena. | |
85 | ||
86 | deallocateObjects(); | |
87 | ||
88 | m_freeableMemory = 0; | |
89 | m_freeablePoolEnd = 0; | |
6fe7ccc8 A |
90 | if (m_identifierArena) |
91 | m_identifierArena->clear(); | |
f9bf01c6 A |
92 | m_freeablePools.clear(); |
93 | m_deletableObjects.clear(); | |
94 | m_refCountedObjects.clear(); | |
95 | } | |
96 | ||
97 | void ParserArena::allocateFreeablePool() | |
98 | { | |
99 | if (m_freeablePoolEnd) | |
100 | m_freeablePools.append(freeablePool()); | |
101 | ||
102 | char* pool = static_cast<char*>(fastMalloc(freeablePoolSize)); | |
103 | m_freeableMemory = pool; | |
104 | m_freeablePoolEnd = pool + freeablePoolSize; | |
105 | ASSERT(freeablePool() == pool); | |
106 | } | |
107 | ||
108 | bool ParserArena::isEmpty() const | |
109 | { | |
110 | return !m_freeablePoolEnd | |
6fe7ccc8 | 111 | && (!m_identifierArena || m_identifierArena->isEmpty()) |
f9bf01c6 A |
112 | && m_freeablePools.isEmpty() |
113 | && m_deletableObjects.isEmpty() | |
114 | && m_refCountedObjects.isEmpty(); | |
115 | } | |
116 | ||
117 | void ParserArena::derefWithArena(PassRefPtr<ParserArenaRefCounted> object) | |
118 | { | |
119 | m_refCountedObjects.append(object); | |
ba379fdc A |
120 | } |
121 | ||
122 | } |