#pragma once
#include "CellContainer.h"
#include "WeakBlock.h"
#include <wtf/SentinelLinkedList.h>
namespace JSC {
class Heap;
class WeakImpl;
class WeakSet : public BasicRawSentinelNode<WeakSet> {
friend class LLIntOffsetsExtractor;
public:
static WeakImpl* allocate(JSValue, WeakHandleOwner* = nullptr, void* context = nullptr);
static void deallocate(WeakImpl*);
WeakSet(VM&);
~WeakSet();
void lastChanceToFinalize();
Heap* heap() const;
VM& vm() const;
bool isEmpty() const;
bool isTriviallyDestructible() const;
void visit(SlotVisitor&);
void reap();
void sweep();
void shrink();
void resetAllocator();
static ptrdiff_t offsetOfVM() { return OBJECT_OFFSETOF(WeakSet, m_vm); }
private:
JS_EXPORT_PRIVATE WeakBlock::FreeCell* findAllocator(CellContainer);
WeakBlock::FreeCell* tryFindAllocator();
WeakBlock::FreeCell* addAllocator(CellContainer);
void removeAllocator(WeakBlock*);
WeakBlock::FreeCell* m_allocator { nullptr };
WeakBlock* m_nextAllocator { nullptr };
DoublyLinkedList<WeakBlock> m_blocks;
VM* m_vm;
};
inline WeakSet::WeakSet(VM& vm)
: 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 bool WeakSet::isTriviallyDestructible() const
{
if (!m_blocks.isEmpty())
return false;
if (isOnList())
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(SlotVisitor& 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::resetAllocator()
{
m_allocator = nullptr;
m_nextAllocator = m_blocks.head();
}
}