Searched refs:BPLUSTREE_NULL (Results 1 - 6 of 6) sorted by relevance

/haiku/src/bin/bfs_tools/lib/
H A DBPlusTree.cpp78 fCurrentNodeOffset(BPLUSTREE_NULL)
89 fCurrentNodeOffset(BPLUSTREE_NULL)
103 fCurrentNodeOffset(BPLUSTREE_NULL)
128 fCurrentNodeOffset = BPLUSTREE_NULL;
147 fHeader->free_node_pointer = BPLUSTREE_NULL;
238 info.from = BPLUSTREE_NULL;
242 if (fHeader->free_node_pointer != BPLUSTREE_NULL) {
280 if (node->overflow_link != BPLUSTREE_NULL && !info.free) {
290 } else if (node->left_link != BPLUSTREE_NULL && info.free) {
326 fDuplicateNode = BPLUSTREE_NULL;
[all...]
H A DBPlusTree.h22 #define BPLUSTREE_NULL -1LL macro
256 return link == BPLUSTREE_NULL || (link > 0 && link <= maximum_size - node_size);
H A Ddump.cpp216 node->overflow_link == BPLUSTREE_NULL ? "leaf" : "index");
/haiku/src/add-ons/kernel/file_systems/bfs/
H A DBPlusTree.cpp144 fPreviousOffsets[i] = BPLUSTREE_NULL;
483 if (fTree == NULL || fTree->fStream == NULL || offset == BPLUSTREE_NULL)
674 = HOST_ENDIAN_TO_BFS_INT64((uint64)BPLUSTREE_NULL);
856 = HOST_ENDIAN_TO_BFS_INT64((uint64)BPLUSTREE_NULL);
863 node->left_link = HOST_ENDIAN_TO_BFS_INT64((uint64)BPLUSTREE_NULL);
864 node->right_link = HOST_ENDIAN_TO_BFS_INT64((uint64)BPLUSTREE_NULL);
865 node->overflow_link = HOST_ENDIAN_TO_BFS_INT64((uint64)BPLUSTREE_NULL);
879 node->left_link = HOST_ENDIAN_TO_BFS_INT64((uint64)BPLUSTREE_NULL);
1120 if (node->OverflowLink() == BPLUSTREE_NULL) {
1243 = HOST_ENDIAN_TO_BFS_INT64((uint64)BPLUSTREE_NULL);
[all...]
H A DBPlusTree.h30 #define BPLUSTREE_NULL -1LL macro
566 return link == BPLUSTREE_NULL
608 return OverflowLink() == BPLUSTREE_NULL;
/haiku/src/tests/add-ons/kernel/file_systems/bfs/btree/
H A Dtest.cpp74 node->overflow_link == BPLUSTREE_NULL ? "leaf" : "index",

Completed in 59 milliseconds