]>
git.saurik.com Git - apple/javascriptcore.git/blob - heap/WeakSet.cpp
1eed8c37ac0a7927e5904d6b122179b327088c78
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.
30 #include "JSCInlines.h"
38 for (WeakBlock
* block
= m_blocks
.head(); block
; block
= next
) {
40 WeakBlock::destroy(block
);
47 for (WeakBlock
* block
= m_blocks
.head(); block
;) {
48 WeakBlock
* nextBlock
= block
->next();
50 if (block
->isLogicallyEmptyButNotFree()) {
51 // If this WeakBlock is logically empty, but still has Weaks pointing into it,
52 // we can't destroy it just yet. Detach it from the WeakSet and hand ownership
53 // to the Heap so we don't pin down the entire 64kB MarkedBlock.
54 m_blocks
.remove(block
);
55 heap()->addLogicallyEmptyWeakBlock(block
);
56 block
->disconnectMarkedBlock();
64 WeakBlock::FreeCell
* WeakSet::findAllocator()
66 if (WeakBlock::FreeCell
* allocator
= tryFindAllocator())
69 return addAllocator();
72 WeakBlock::FreeCell
* WeakSet::tryFindAllocator()
74 while (m_nextAllocator
) {
75 WeakBlock
* block
= m_nextAllocator
;
76 m_nextAllocator
= m_nextAllocator
->next();
78 WeakBlock::SweepResult sweepResult
= block
->takeSweepResult();
79 if (sweepResult
.freeList
)
80 return sweepResult
.freeList
;
86 WeakBlock::FreeCell
* WeakSet::addAllocator()
88 WeakBlock
* block
= WeakBlock::create(m_markedBlock
);
89 heap()->didAllocate(WeakBlock::blockSize
);
90 m_blocks
.append(block
);
91 WeakBlock::SweepResult sweepResult
= block
->takeSweepResult();
92 ASSERT(!sweepResult
.isNull() && sweepResult
.freeList
);
93 return sweepResult
.freeList
;
96 void WeakSet::removeAllocator(WeakBlock
* block
)
98 m_blocks
.remove(block
);
99 WeakBlock::destroy(block
);