NodeEntry - Haiku

647

NodeEntry* entry = (NodeEntry*)(fSingleDirBlock + NodeHeader::Size(fInode));

208

NodeEntry* entry = (NodeEntry*)(void*)(fLeafBuffer + NodeHeader::Size(fInode));

211

if ((NodeEntry*)(void*)fLeafBuffer + fInode->DirBlockSize()

266

NodeEntry* firstNodeEntry = (NodeEntry*)(fNodeBuffer + NodeHeader::Size(fInode));

274

NodeEntry* nodeEntry = (NodeEntry*)((char*)firstNodeEntry + i * sizeof(NodeEntry));

341

NodeEntry* nodeEntry = (NodeEntry*)(fNodeBuffer + NodeHeader::Size(fInode));

349

hashLowerBound<NodeEntry>(nodeEntry, left, right, hashValueOfRequest);