]>
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"
37 friend class LLIntOffsetsExtractor
;
40 static WeakImpl
* allocate(JSValue
, WeakHandleOwner
* = 0, void* context
= 0);
41 static void deallocate(WeakImpl
*);
45 void lastChanceToFinalize();
52 void visit(HeapRootVisitor
&);
56 void resetAllocator();
59 JS_EXPORT_PRIVATE
WeakBlock::FreeCell
* findAllocator();
60 WeakBlock::FreeCell
* tryFindAllocator();
61 WeakBlock::FreeCell
* addAllocator();
62 void removeAllocator(WeakBlock
*);
64 WeakBlock::FreeCell
* m_allocator
;
65 WeakBlock
* m_nextAllocator
;
66 DoublyLinkedList
<WeakBlock
> m_blocks
;
70 inline WeakSet::WeakSet(VM
* vm
)
77 inline VM
* WeakSet::vm() const
82 inline bool WeakSet::isEmpty() const
84 for (WeakBlock
* block
= m_blocks
.head(); block
; block
= block
->next()) {
85 if (!block
->isEmpty())
92 inline void WeakSet::deallocate(WeakImpl
* weakImpl
)
94 weakImpl
->setState(WeakImpl::Deallocated
);
97 inline void WeakSet::lastChanceToFinalize()
99 for (WeakBlock
* block
= m_blocks
.head(); block
; block
= block
->next())
100 block
->lastChanceToFinalize();
103 inline void WeakSet::visit(HeapRootVisitor
& visitor
)
105 for (WeakBlock
* block
= m_blocks
.head(); block
; block
= block
->next())
106 block
->visit(visitor
);
109 inline void WeakSet::reap()
111 for (WeakBlock
* block
= m_blocks
.head(); block
; block
= block
->next())
115 inline void WeakSet::shrink()
118 for (WeakBlock
* block
= m_blocks
.head(); block
; block
= next
) {
119 next
= block
->next();
121 if (block
->isEmpty())
122 removeAllocator(block
);
128 inline void WeakSet::resetAllocator()
131 m_nextAllocator
= m_blocks
.head();