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
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
|
/*
* Copyright (C) 1999-2000 Harri Porten (porten@kde.org)
* Copyright (C) 2001 Peter Kelly (pmk@post.com)
* Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*
*/
#ifndef Heap_h
#define Heap_h
#include "MarkStack.h"
#include "MarkedSpace.h"
#include <wtf/Forward.h>
#include <wtf/HashSet.h>
#define ASSERT_CLASS_FITS_IN_CELL(class) COMPILE_ASSERT(sizeof(class) <= CELL_SIZE, class_fits_in_cell)
namespace JSC {
class JSValue;
class UString;
class GCActivityCallback;
class JSCell;
class JSGlobalData;
class JSValue;
class LiveObjectIterator;
class MarkedArgumentBuffer;
class MarkStack;
class WeakGCHandlePool;
typedef std::pair<JSValue, UString> ValueStringPair;
enum OperationInProgress { NoOperation, Allocation, Collection };
class Heap {
WTF_MAKE_NONCOPYABLE(Heap);
public:
void destroy();
void* allocate(size_t);
bool isBusy(); // true if an allocation or collection is in progress
void collectAllGarbage();
GCActivityCallback* activityCallback();
void setActivityCallback(PassOwnPtr<GCActivityCallback>);
static const size_t minExtraCost = 256;
static const size_t maxExtraCost = 1024 * 1024;
void reportExtraMemoryCost(size_t cost);
size_t objectCount() const;
MarkedSpace::Statistics statistics() const;
size_t size() const;
void protect(JSValue);
// Returns true if the value is no longer protected by any protect pointers
// (though it may still be alive due to heap/stack references).
bool unprotect(JSValue);
static Heap* heap(JSValue); // 0 for immediate values
static Heap* heap(JSCell*);
size_t globalObjectCount();
size_t protectedObjectCount();
size_t protectedGlobalObjectCount();
HashCountedSet<const char*>* protectedObjectTypeCounts();
HashCountedSet<const char*>* objectTypeCounts();
static bool isCellMarked(const JSCell*);
static bool checkMarkCell(const JSCell*);
static void markCell(JSCell*);
WeakGCHandle* addWeakGCHandle(JSCell*);
void markConservatively(ConservativeSet&, void* start, void* end);
void pushTempSortVector(WTF::Vector<ValueStringPair>*);
void popTempSortVector(WTF::Vector<ValueStringPair>*);
HashSet<MarkedArgumentBuffer*>& markListSet() { if (!m_markListSet) m_markListSet = new HashSet<MarkedArgumentBuffer*>; return *m_markListSet; }
JSGlobalData* globalData() const { return m_globalData; }
LiveObjectIterator primaryHeapBegin();
LiveObjectIterator primaryHeapEnd();
MachineStackMarker& machineStackMarker() { return m_machineStackMarker; }
MarkedSpace& markedSpace() { return m_markedSpace; }
private:
friend class JSGlobalData;
Heap(JSGlobalData*);
~Heap();
void recordExtraCost(size_t);
void markRoots();
void markProtectedObjects(MarkStack&);
void markTempSortVectors(MarkStack&);
void updateWeakGCHandles();
WeakGCHandlePool* weakGCHandlePool(size_t index);
MarkedSpace m_markedSpace;
OperationInProgress m_operationInProgress;
ProtectCountSet m_protectedValues;
WTF::Vector<PageAllocationAligned> m_weakGCHandlePools;
WTF::Vector<WTF::Vector<ValueStringPair>* > m_tempSortingVectors;
HashSet<MarkedArgumentBuffer*>* m_markListSet;
OwnPtr<GCActivityCallback> m_activityCallback;
JSGlobalData* m_globalData;
MachineStackMarker m_machineStackMarker;
MarkStack m_markStack;
size_t m_extraCost;
};
inline bool Heap::isCellMarked(const JSCell* cell)
{
return MarkedSpace::isCellMarked(cell);
}
inline bool Heap::checkMarkCell(const JSCell* cell)
{
return MarkedSpace::checkMarkCell(cell);
}
inline void Heap::markCell(JSCell* cell)
{
MarkedSpace::markCell(cell);
}
inline void Heap::reportExtraMemoryCost(size_t cost)
{
if (cost > minExtraCost)
recordExtraCost(cost);
}
inline WeakGCHandlePool* Heap::weakGCHandlePool(size_t index)
{
return static_cast<WeakGCHandlePool*>(m_weakGCHandlePools[index].base());
}
} // namespace JSC
#endif // Heap_h
|
