Searched refs:HTreeEntry (Results 1 – 3 of 3) sorted by relevance
43 fFirstEntry = offset % fBlockSize / sizeof(HTreeEntry); in HTreeEntryIterator()94 &((HTreeEntry*)block)[fFirstEntry]); in Init()110 if (fLimit != maxSize / sizeof(HTreeEntry) - fFirstEntry) { in Init()113 (uint32)(maxSize / sizeof(HTreeEntry) - fFirstEntry), fBlockNum); in Init()157 HTreeEntry* start = (HTreeEntry*)block + fCurrentEntry + 1; in Lookup()158 HTreeEntry* end = (HTreeEntry*)block + fCount + fFirstEntry - 1; in Lookup()159 HTreeEntry* middle = start; in Lookup()167 middle = (HTreeEntry*)((end - start) / 2 in Lookup()184 fCurrentEntry = ((uint8*)start - block) / sizeof(HTreeEntry); in Lookup()266 HTreeEntry* entry = &((HTreeEntry*)block)[fCurrentEntry]; in GetNext()[all …]
61 struct HTreeEntry { struct97 HTreeEntry entries[0];
619 - ((uint8*)root->count_limit - secondBlock)) / sizeof(HTreeEntry)); in _SplitIndexedBlock()734 HTreeEntry* htreeEntry = (HTreeEntry*)root->count_limit; in _SplitIndexedBlock()881 HTreeEntry* entries = (HTreeEntry*)block; in _HTreeEntryTail()882 uint16 firstEntry = offset % fBlockSize / sizeof(HTreeEntry); in _HTreeEntryTail()899 offset + count * sizeof(HTreeEntry)); in _HTreeRootChecksum()901 offset + count * sizeof(HTreeEntry)); in _HTreeRootChecksum()