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 "JSGlobalData.h"
37
for (WeakBlock* block = m_blocks.head(); block; block = next) {
39
heap()->blockAllocator().deallocate(WeakBlock::destroy(block));
46
for (WeakBlock* block = m_blocks.head(); block; block = block->next())
52
WeakBlock::FreeCell* WeakSet::findAllocator()
54
if (WeakBlock::FreeCell* allocator = tryFindAllocator())
57
return addAllocator();
60
WeakBlock::FreeCell* WeakSet::tryFindAllocator()
62
while (m_nextAllocator) {
63
WeakBlock* block = m_nextAllocator;
64
m_nextAllocator = m_nextAllocator->next();
66
WeakBlock::SweepResult sweepResult = block->takeSweepResult();
67
if (sweepResult.freeList)
68
return sweepResult.freeList;
74
WeakBlock::FreeCell* WeakSet::addAllocator()
76
WeakBlock* block = WeakBlock::create(heap()->blockAllocator().allocate<WeakBlock>());
77
heap()->didAllocate(WeakBlock::blockSize);
78
m_blocks.append(block);
79
WeakBlock::SweepResult sweepResult = block->takeSweepResult();
80
ASSERT(!sweepResult.isNull() && sweepResult.freeList);
81
return sweepResult.freeList;
84
void WeakSet::removeAllocator(WeakBlock* block)
86
m_blocks.remove(block);
87
WeakBlock::destroy(block);