#ifndef WeakBlock_h
#define WeakBlock_h
#include "HeapBlock.h"
#include "WeakHandleOwner.h"
#include "WeakImpl.h"
#include <wtf/DoublyLinkedList.h>
#include <wtf/StdLibExtras.h>
namespace JSC {
class DeadBlock;
class HeapRootVisitor;
class JSValue;
class WeakHandleOwner;
class WeakBlock : public HeapBlock<WeakBlock> {
public:
friend class WTF::DoublyLinkedListNode<WeakBlock>;
static const size_t blockSize = 4 * KB;
struct FreeCell {
FreeCell* next;
};
struct SweepResult {
SweepResult();
bool isNull() const;
bool blockIsFree;
FreeCell* freeList;
};
static WeakBlock* create(DeadBlock*);
static WeakImpl* asWeakImpl(FreeCell*);
bool isEmpty();
void sweep();
SweepResult takeSweepResult();
void visit(HeapRootVisitor&);
void reap();
void lastChanceToFinalize();
private:
static FreeCell* asFreeCell(WeakImpl*);
WeakBlock(Region*);
WeakImpl* firstWeakImpl();
void finalize(WeakImpl*);
WeakImpl* weakImpls();
size_t weakImplCount();
void addToFreeList(FreeCell**, WeakImpl*);
SweepResult m_sweepResult;
};
inline WeakBlock::SweepResult::SweepResult()
: blockIsFree(true)
, freeList(0)
{
ASSERT(isNull());
}
inline bool WeakBlock::SweepResult::isNull() const
{
return blockIsFree && !freeList; }
inline WeakImpl* WeakBlock::asWeakImpl(FreeCell* freeCell)
{
return reinterpret_cast_ptr<WeakImpl*>(freeCell);
}
inline WeakBlock::SweepResult WeakBlock::takeSweepResult()
{
SweepResult tmp;
std::swap(tmp, m_sweepResult);
ASSERT(m_sweepResult.isNull());
return tmp;
}
inline WeakBlock::FreeCell* WeakBlock::asFreeCell(WeakImpl* weakImpl)
{
return reinterpret_cast_ptr<FreeCell*>(weakImpl);
}
inline WeakImpl* WeakBlock::weakImpls()
{
return reinterpret_cast_ptr<WeakImpl*>(this) + ((sizeof(WeakBlock) + sizeof(WeakImpl) - 1) / sizeof(WeakImpl));
}
inline size_t WeakBlock::weakImplCount()
{
return (blockSize / sizeof(WeakImpl)) - ((sizeof(WeakBlock) + sizeof(WeakImpl) - 1) / sizeof(WeakImpl));
}
inline void WeakBlock::addToFreeList(FreeCell** freeList, WeakImpl* weakImpl)
{
ASSERT(weakImpl->state() == WeakImpl::Deallocated);
FreeCell* freeCell = asFreeCell(weakImpl);
ASSERT(!*freeList || ((char*)*freeList > (char*)this && (char*)*freeList < (char*)this + blockSize));
ASSERT((char*)freeCell > (char*)this && (char*)freeCell < (char*)this + blockSize);
freeCell->next = *freeList;
*freeList = freeCell;
}
inline bool WeakBlock::isEmpty()
{
return !m_sweepResult.isNull() && m_sweepResult.blockIsFree;
}
}
#endif // WeakBlock_h