Home
last modified time | relevance | path

Searched refs:root_node_pointer (Results 1 – 5 of 5) sorted by relevance

/haiku/src/bin/bfs_tools/lib/
H A DBPlusTree.cpp146 fHeader->root_node_pointer = fNodeSize; in SetTo()
173 || (header.root_node_pointer % header.node_size) != 0 in SetTo()
174 || !header.IsValidLink(header.root_node_pointer) in SetTo()
204 bplustree_node *node = fCache.Get(header.root_node_pointer); in SetTo()
237 info.offset = fHeader->root_node_pointer; in Validate()
336 if (stack.Push(fHeader->root_node_pointer) < B_OK) in Goto()
622 nodeAndKey.nodeOffset = fHeader->root_node_pointer; in SeekDown()
1005 if (nodeAndKey.nodeOffset == fHeader->root_node_pointer) { in Insert()
1025 fHeader->root_node_pointer = newRoot; in Insert()
H A DBPlusTree.h31 off_t root_node_pointer; member
H A Ddump.cpp203 header->root_node_pointer); in dump_bplustree_header()
/haiku/src/add-ons/kernel/file_systems/bfs/
H A DBPlusTree.h38 int64 root_node_pointer; member
46 { return BFS_ENDIAN_TO_HOST_INT64(root_node_pointer); } in RootNode()
H A DBPlusTree.cpp672 header->root_node_pointer = HOST_ENDIAN_TO_BFS_INT64(nodeSize); in SetTo()
851 header->root_node_pointer = HOST_ENDIAN_TO_BFS_INT64(NodeSize()); in MakeEmpty()
1812 header->root_node_pointer = HOST_ENDIAN_TO_BFS_INT64(newRoot); in Insert()