Searched refs:HTreeEntry (Results 1 - 3 of 3) sorted by relevance

/haiku/src/add-ons/kernel/file_systems/ext2/
H A DHTreeEntryIterator.cpp43 fFirstEntry = offset % fBlockSize / sizeof(HTreeEntry);
94 &((HTreeEntry*)block)[fFirstEntry]);
110 if (fLimit != maxSize / sizeof(HTreeEntry) - fFirstEntry) {
113 (uint32)(maxSize / sizeof(HTreeEntry) - fFirstEntry), fBlockNum);
157 HTreeEntry* start = (HTreeEntry*)block + fCurrentEntry + 1;
158 HTreeEntry* end = (HTreeEntry*)block + fCount + fFirstEntry - 1;
159 HTreeEntry* middle = start;
167 middle = (HTreeEntry*)((en
[all...]
H A DHTree.h61 struct HTreeEntry { struct
97 HTreeEntry entries[0];
H A DDirectoryIterator.cpp619 - ((uint8*)root->count_limit - secondBlock)) / sizeof(HTreeEntry));
734 HTreeEntry* htreeEntry = (HTreeEntry*)root->count_limit;
881 HTreeEntry* entries = (HTreeEntry*)block;
882 uint16 firstEntry = offset % fBlockSize / sizeof(HTreeEntry);
899 offset + count * sizeof(HTreeEntry));
901 offset + count * sizeof(HTreeEntry));

Completed in 93 milliseconds