#ifndef WeakSet_h
#define WeakSet_h
#include "WeakBlock.h"
namespace JSC {
class Heap;
class WeakImpl;
class WeakSet {
public:
static WeakImpl* allocate(JSValue, WeakHandleOwner* = 0, void* context = 0);
static void deallocate(WeakImpl*);
WeakSet(VM*);
~WeakSet();
void lastChanceToFinalize();
Heap* heap() const;
VM* vm() const;
bool isEmpty() const;
void visit(HeapRootVisitor&);
void reap();
void sweep();
void shrink();
void resetAllocator();
private:
JS_EXPORT_PRIVATE WeakBlock::FreeCell* findAllocator();
WeakBlock::FreeCell* tryFindAllocator();
WeakBlock::FreeCell* addAllocator();
void removeAllocator(WeakBlock*);
WeakBlock::FreeCell* m_allocator;
WeakBlock* m_nextAllocator;
DoublyLinkedList<WeakBlock> m_blocks;
VM* m_vm;
};
inline WeakSet::WeakSet(VM* vm)
: m_allocator(0)
, m_nextAllocator(0)
, m_vm(vm)
{
}
inline VM* WeakSet::vm() const
{
return m_vm;
}
inline bool WeakSet::isEmpty() const
{
for (WeakBlock* block = m_blocks.head(); block; block = block->next()) {
if (!block->isEmpty())
return false;
}
return true;
}
inline void WeakSet::deallocate(WeakImpl* weakImpl)
{
weakImpl->setState(WeakImpl::Deallocated);
}
inline void WeakSet::lastChanceToFinalize()
{
for (WeakBlock* block = m_blocks.head(); block; block = block->next())
block->lastChanceToFinalize();
}
inline void WeakSet::visit(HeapRootVisitor& visitor)
{
for (WeakBlock* block = m_blocks.head(); block; block = block->next())
block->visit(visitor);
}
inline void WeakSet::reap()
{
for (WeakBlock* block = m_blocks.head(); block; block = block->next())
block->reap();
}
inline void WeakSet::shrink()
{
WeakBlock* next;
for (WeakBlock* block = m_blocks.head(); block; block = next) {
next = block->next();
if (block->isEmpty())
removeAllocator(block);
}
resetAllocator();
}
inline void WeakSet::resetAllocator()
{
m_allocator = 0;
m_nextAllocator = m_blocks.head();
}
}
#endif // WeakSet_h