Searched refs:node_size (Results 1 - 12 of 12) sorted by relevance
/haiku-fatelf/src/bin/bfs_tools/lib/ |
H A D | dump.cpp | 193 printf(" node_size = %lu\n", header->node_size); 218 || uint32(node->all_key_count * 10) > (uint32)header->node_size) { 220 dump_block((char *)node, header->node_size, sizeof(off_t)); 230 dump_block((char *)node, header->node_size, sizeof(off_t)); 239 if ((uint32)value < (uint32)node || (uint32)value > (uint32)node + header->node_size)
|
H A D | BPlusTree.h | 27 uint32 node_size; member in struct:bplustree_header 255 return link == BPLUSTREE_NULL || (link > 0 && link <= maximum_size - node_size);
|
H A D | BPlusTree.cpp | 142 fHeader->node_size = fNodeSize; 172 || (header.root_node_pointer % header.node_size) != 0 197 Initialize(header.node_size);
|
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/bfs/r5/ |
H A D | Debug.cpp | 150 Print(" node_size = %lu\n", header->node_size); 208 || uint32(node->all_key_count * 10) > (uint32)header->node_size 211 dump_block((char *)node, header->node_size/*, sizeof(off_t)*/); 221 dump_block((char *)node, header->node_size/*, sizeof(off_t)*/); 228 if ((uint32)value < (uint32)node || (uint32)value > (uint32)node + header->node_size)
|
H A D | BPlusTree.h | 27 uint32 node_size; member in struct:bplustree_header 35 uint32 NodeSize() const { return BFS_ENDIAN_TO_HOST_INT32(node_size); }
|
H A D | BPlusTree.cpp | 323 fHeader->node_size = HOST_ENDIAN_TO_BFS_INT32(fNodeSize);
|
/haiku-fatelf/src/add-ons/kernel/file_systems/bfs/ |
H A D | Debug.cpp | 151 kprintf(" node_size = %u\n", (unsigned)header->NodeSize()); 211 || uint32(node->all_key_count * 10) > (uint32)header->node_size 214 dump_block((char *)node, header->node_size/*, sizeof(off_t)*/); 224 dump_block((char *)node, header->node_size/*, sizeof(off_t)*/); 232 || (addr_t)value > (addr_t)node + header->node_size)
|
H A D | BPlusTree.h | 22 uint32 node_size; member in struct:bplustree_header 30 uint32 NodeSize() const { return BFS_ENDIAN_TO_HOST_INT32(node_size); }
|
H A D | BPlusTree.cpp | 613 header->node_size = HOST_ENDIAN_TO_BFS_INT32(fNodeSize);
|
/haiku-fatelf/src/bin/bfs_tools/ |
H A D | bfsinfo.cpp | 35 int32 nodeSize = header->node_size; 48 dump_block((char *)node, header->node_size, 0);
|
/haiku-fatelf/src/system/boot/loader/file_systems/bfs/ |
H A D | BPlusTree.h | 26 uint32 node_size; member in struct:BFS::bplustree_header 34 uint32 NodeSize() const { return BFS_ENDIAN_TO_HOST_INT32(node_size); }
|
/haiku-fatelf/src/add-ons/kernel/file_systems/btrfs/ |
H A D | btrfs.h | 156 uint32 node_size; member in struct:btrfs_super_block
|
Completed in 222 milliseconds