Searched refs:leafEntry (Results 1 - 4 of 4) sorted by relevance
| /haiku/src/add-ons/kernel/file_systems/xfs/ |
| H A D | Extent.cpp | 214 ExtentLeafEntry* leafEntry = BlockFirstLeaf(blockTail); local
220 hashLowerBound<ExtentLeafEntry>(leafEntry, left, right, hashValueOfRequest);
222 while (B_BENDIAN_TO_HOST_INT32(leafEntry[left].hashval)
225 uint32 address = B_BENDIAN_TO_HOST_INT32(leafEntry[left].address);
|
| H A D | Node.cpp | 394 ExtentLeafEntry* leafEntry =
396 if (leafEntry == NULL)
405 hashLowerBound<ExtentLeafEntry>(leafEntry, left, right, hashValueOfRequest);
407 while (B_BENDIAN_TO_HOST_INT32(leafEntry[left].hashval)
410 uint32 address = B_BENDIAN_TO_HOST_INT32(leafEntry[left].address);
|
| H A D | LeafDirectory.cpp | 338 ExtentLeafEntry* leafEntry = FirstLeaf();
339 if (leafEntry == NULL)
348 hashLowerBound<ExtentLeafEntry>(leafEntry, left, right, hashValueOfRequest);
350 while (B_BENDIAN_TO_HOST_INT32(leafEntry[left].hashval)
353 uint32 address = B_BENDIAN_TO_HOST_INT32(leafEntry[left].address);
|
| H A D | BPlusTree.cpp | 730 ExtentLeafEntry* leafEntry
738 hashLowerBound<ExtentLeafEntry>(leafEntry, left, right, hashValueOfRequest);
742 leafEntry[numberOfLeafEntries - 1].hashval);
744 while (B_BENDIAN_TO_HOST_INT32(leafEntry[left].hashval)
746 uint32 address = B_BENDIAN_TO_HOST_INT32(leafEntry[left].address);
|
Completed in 92 milliseconds