#include "config.h"
#include "WeakSet.h"
#include "Heap.h"
#include "VM.h"
namespace JSC {
WeakSet::~WeakSet()
{
if (isOnList())
remove();
Heap& heap = *this->heap();
WeakBlock* next = nullptr;
for (WeakBlock* block = m_blocks.head(); block; block = next) {
next = block->next();
WeakBlock::destroy(heap, block);
}
m_blocks.clear();
}
void WeakSet::sweep()
{
for (WeakBlock* block = m_blocks.head(); block;) {
heap()->sweepNextLogicallyEmptyWeakBlock();
WeakBlock* nextBlock = block->next();
block->sweep();
if (block->isLogicallyEmptyButNotFree()) {
m_blocks.remove(block);
heap()->addLogicallyEmptyWeakBlock(block);
block->disconnectContainer();
}
block = nextBlock;
}
resetAllocator();
}
void WeakSet::shrink()
{
WeakBlock* next;
for (WeakBlock* block = m_blocks.head(); block; block = next) {
next = block->next();
if (block->isEmpty())
removeAllocator(block);
}
resetAllocator();
if (m_blocks.isEmpty() && isOnList())
remove();
}
WeakBlock::FreeCell* WeakSet::findAllocator(CellContainer container)
{
if (WeakBlock::FreeCell* allocator = tryFindAllocator())
return allocator;
return addAllocator(container);
}
WeakBlock::FreeCell* WeakSet::tryFindAllocator()
{
while (m_nextAllocator) {
WeakBlock* block = m_nextAllocator;
m_nextAllocator = m_nextAllocator->next();
WeakBlock::SweepResult sweepResult = block->takeSweepResult();
if (sweepResult.freeList)
return sweepResult.freeList;
}
return nullptr;
}
WeakBlock::FreeCell* WeakSet::addAllocator(CellContainer container)
{
if (!isOnList())
heap()->objectSpace().addActiveWeakSet(this);
WeakBlock* block = WeakBlock::create(*heap(), container);
heap()->didAllocate(WeakBlock::blockSize);
m_blocks.append(block);
WeakBlock::SweepResult sweepResult = block->takeSweepResult();
ASSERT(!sweepResult.isNull() && sweepResult.freeList);
return sweepResult.freeList;
}
void WeakSet::removeAllocator(WeakBlock* block)
{
m_blocks.remove(block);
WeakBlock::destroy(*heap(), block);
}
}