]>
git.saurik.com Git - apple/javascriptcore.git/blob - heap/WeakSet.h
2 * Copyright (C) 2012 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. AND ITS CONTRIBUTORS ``AS IS''
14 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
15 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
17 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
18 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
19 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
20 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
21 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
22 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
23 * THE POSSIBILITY OF SUCH DAMAGE.
29 #include "WeakBlock.h"
38 static WeakImpl
* allocate(JSValue
, WeakHandleOwner
* = 0, void* context
= 0);
39 static void deallocate(WeakImpl
*);
43 void lastChanceToFinalize();
50 void visit(HeapRootVisitor
&);
54 void resetAllocator();
57 JS_EXPORT_PRIVATE
WeakBlock::FreeCell
* findAllocator();
58 WeakBlock::FreeCell
* tryFindAllocator();
59 WeakBlock::FreeCell
* addAllocator();
60 void removeAllocator(WeakBlock
*);
62 WeakBlock::FreeCell
* m_allocator
;
63 WeakBlock
* m_nextAllocator
;
64 DoublyLinkedList
<WeakBlock
> m_blocks
;
68 inline WeakSet::WeakSet(VM
* vm
)
75 inline VM
* WeakSet::vm() const
80 inline bool WeakSet::isEmpty() const
82 for (WeakBlock
* block
= m_blocks
.head(); block
; block
= block
->next()) {
83 if (!block
->isEmpty())
90 inline void WeakSet::deallocate(WeakImpl
* weakImpl
)
92 weakImpl
->setState(WeakImpl::Deallocated
);
95 inline void WeakSet::lastChanceToFinalize()
97 for (WeakBlock
* block
= m_blocks
.head(); block
; block
= block
->next())
98 block
->lastChanceToFinalize();
101 inline void WeakSet::visit(HeapRootVisitor
& visitor
)
103 for (WeakBlock
* block
= m_blocks
.head(); block
; block
= block
->next())
104 block
->visit(visitor
);
107 inline void WeakSet::reap()
109 for (WeakBlock
* block
= m_blocks
.head(); block
; block
= block
->next())
113 inline void WeakSet::shrink()
116 for (WeakBlock
* block
= m_blocks
.head(); block
; block
= next
) {
117 next
= block
->next();
119 if (block
->isEmpty())
120 removeAllocator(block
);
126 inline void WeakSet::resetAllocator()
129 m_nextAllocator
= m_blocks
.head();