summaryrefslogtreecommitdiffstats
path: root/Source/JavaScriptCore/collector/handles/HandleHeap.h
blob: 4bb9b002b4c379a6042a309393606442fe0d16bb (plain)
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
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
/*
 * Copyright (C) 2011 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. AND ITS CONTRIBUTORS ``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 ITS 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.
 */

#ifndef HandleHeap_h
#define HandleHeap_h

#include "BlockStack.h"
#include "Handle.h"
#include "SentinelLinkedList.h"
#include "SinglyLinkedList.h"

namespace JSC {

class HandleHeap;
class JSGlobalData;
class JSValue;
class MarkStack;

class Finalizer {
public:
    virtual void finalize(Handle<Unknown>, void*) = 0;
    virtual ~Finalizer() {}
};

class HandleHeap {
public:
    static HandleHeap* heapFor(HandleSlot);

    HandleHeap(JSGlobalData*);

    HandleSlot allocate();
    void deallocate(HandleSlot);
    
    void makeWeak(HandleSlot, Finalizer*, void* context);
    void makeSelfDestroying(HandleSlot, Finalizer*, void* context);

    void markStrongHandles(MarkStack&);
    void updateAfterMark();
    
    // Should only be called during teardown.
    void clearWeakPointers();

    void writeBarrier(HandleSlot, const JSValue&);

#if !ASSERT_DISABLED
    Finalizer* getFinalizer(HandleSlot handle)
    {
        return toNode(handle)->finalizer();
    }
#endif

    unsigned protectedGlobalObjectCount();
    
private:
    typedef uintptr_t HandleHeapWithFlags;
    enum { FlagsMask = 3, WeakFlag = 1, SelfDestroyingFlag = 2 };
    class Node {
    public:
        Node(WTF::SentinelTag);
        Node(HandleHeap*);
        
        HandleSlot slot();
        HandleHeap* handleHeap();

        void setFinalizer(Finalizer*, void* context);
        Finalizer* finalizer();
        void* finalizerContext();

        void setPrev(Node*);
        Node* prev();

        void setNext(Node*);
        Node* next();

        bool isWeak();
        void makeWeak();
        
        bool isSelfDestroying();
        void makeSelfDestroying();

    private:
        JSValue m_value;
        HandleHeapWithFlags m_handleHeapWithFlags;
        Finalizer* m_finalizer;
        void* m_finalizerContext;
        Node* m_prev;
        Node* m_next;
    };

    static HandleSlot toHandle(Node*);
    static Node* toNode(HandleSlot);

    void grow();

    JSGlobalData* m_globalData;
    BlockStack<Node> m_blockStack;

    SentinelLinkedList<Node> m_strongList;
    SentinelLinkedList<Node> m_weakList;
    SentinelLinkedList<Node> m_immediateList;
    SinglyLinkedList<Node> m_freeList;
    Node* m_nextToFinalize;

#if !ASSERT_DISABLED
    bool m_handlingFinalizers;
#endif
};

inline HandleHeap* HandleHeap::heapFor(HandleSlot handle)
{
    return toNode(handle)->handleHeap();
}

inline HandleSlot HandleHeap::toHandle(Node* node)
{
    return reinterpret_cast<HandleSlot>(node);
}

inline HandleHeap::Node* HandleHeap::toNode(HandleSlot handle)
{
    return reinterpret_cast<Node*>(handle);
}

inline HandleSlot HandleHeap::allocate()
{
    if (m_freeList.isEmpty())
        grow();

    Node* node = m_freeList.pop();
    new (node) Node(this);
    m_immediateList.push(node);
    return toHandle(node);
}

inline void HandleHeap::deallocate(HandleSlot handle)
{
    Node* node = toNode(handle);
    if (m_nextToFinalize == node) {
        m_nextToFinalize = node->next();
        ASSERT(m_nextToFinalize->next());
    }
    SentinelLinkedList<Node>::remove(node);
    m_freeList.push(node);
}

inline void HandleHeap::makeWeak(HandleSlot handle, Finalizer* finalizer, void* context)
{
    Node* node = toNode(handle);
    SentinelLinkedList<Node>::remove(node);
    node->setFinalizer(finalizer, context);
    node->makeWeak();
    if (handle->isCell() && *handle)
        m_weakList.push(node);
    else
        m_immediateList.push(node);
}

inline void HandleHeap::makeSelfDestroying(HandleSlot handle, Finalizer* finalizer, void* context)
{
    makeWeak(handle, finalizer, context);
    Node* node = toNode(handle);
    node->makeSelfDestroying();
}

inline HandleHeap::Node::Node(HandleHeap* handleHeap)
    : m_handleHeapWithFlags(reinterpret_cast<uintptr_t>(handleHeap))
    , m_finalizer(0)
    , m_finalizerContext(0)
{
}

inline HandleHeap::Node::Node(WTF::SentinelTag)
    : m_handleHeapWithFlags(0)
    , m_finalizer(0)
    , m_finalizerContext(0)
{
}

inline HandleSlot HandleHeap::Node::slot()
{
    return &m_value;
}

inline HandleHeap* HandleHeap::Node::handleHeap()
{
    return reinterpret_cast<HandleHeap*>(m_handleHeapWithFlags & ~FlagsMask);
}

inline void HandleHeap::Node::setFinalizer(Finalizer* finalizer, void* context)
{
    m_finalizer = finalizer;
    m_finalizerContext = context;
}

inline void HandleHeap::Node::makeWeak()
{
    ASSERT(!(m_handleHeapWithFlags & WeakFlag));
    m_handleHeapWithFlags |= WeakFlag;
}

inline bool HandleHeap::Node::isWeak()
{
    return !!(m_handleHeapWithFlags & WeakFlag);
}

inline void HandleHeap::Node::makeSelfDestroying()
{
    ASSERT(m_handleHeapWithFlags & WeakFlag);
    ASSERT(!(m_handleHeapWithFlags & SelfDestroyingFlag));
    m_handleHeapWithFlags |= SelfDestroyingFlag;
}

inline bool HandleHeap::Node::isSelfDestroying()
{
    return !!(m_handleHeapWithFlags & SelfDestroyingFlag);
}

inline Finalizer* HandleHeap::Node::finalizer()
{
    return m_finalizer;
}

inline void* HandleHeap::Node::finalizerContext()
{
    ASSERT(m_finalizer);
    return m_finalizerContext;
}

inline void HandleHeap::Node::setPrev(Node* prev)
{
    m_prev = prev;
}

inline HandleHeap::Node* HandleHeap::Node::prev()
{
    return m_prev;
}

inline void HandleHeap::Node::setNext(Node* next)
{
    m_next = next;
}

inline HandleHeap::Node* HandleHeap::Node::next()
{
    return m_next;
}

}

#endif