HTreeEntryIterator
HTreeEntryIterator* parent)
fParent = new(std::nothrow) HTreeEntryIterator(start, fDirectory);
class HTreeEntryIterator;
HTreeEntryIterator* parent = NULL);
HTreeEntryIterator* fParent;
fRootEntry = new(std::nothrow) HTreeEntryIterator(start, fDirectory);
HTreeEntryIterator* fRootEntry;
ObjectDeleter<HTreeEntryIterator> fRootEntryDeleter;
HTreeEntryIterator::~HTreeEntryIterator()
HTreeEntryIterator::Lookup(uint32 hash, int indirections,
fChild = new(std::nothrow) HTreeEntryIterator(blockNum, fBlockSize,
HTreeEntryIterator::GetNext(uint32& childBlock)
HTreeEntryIterator::BlocksNeededForNewEntry()
HTreeEntryIterator::HTreeEntryIterator(off_t offset, Inode* directory)
HTreeEntryIterator::InsertEntry(Transaction& transaction, uint32 hash,
HTreeEntryIterator::_HTreeEntryTail(uint8* block) const
HTreeEntryIterator::_Checksum(uint8* block) const
HTreeEntryIterator::_SetHTreeEntryChecksum(uint8* block)
HTreeEntryIterator::HTreeEntryIterator(uint32 block, uint32 blockSize,
Inode* directory, HTreeEntryIterator* parent, bool hasCollision)
HTreeEntryIterator::Init()
class HTreeEntryIterator {
HTreeEntryIterator(off_t offset,
~HTreeEntryIterator();
HTreeEntryIterator(uint32 block,
HTreeEntryIterator* parent,
HTreeEntryIterator* fParent;
HTreeEntryIterator* fChild;