Lines Matching defs:node
197 dump_bplustree_node(const bplustree_node* node, const bplustree_header* header,
201 kprintf(" left_link = %" B_PRId64 "\n", node->left_link);
202 kprintf(" right_link = %" B_PRId64 "\n", node->right_link);
203 kprintf(" overflow_link = %" B_PRId64 "\n", node->overflow_link);
204 kprintf(" all_key_count = %u\n", node->all_key_count);
205 kprintf(" all_key_length = %u\n", node->all_key_length);
210 if (node->all_key_count > node->all_key_length
211 || uint32(node->all_key_count * 10) > (uint32)header->node_size
212 || node->all_key_count == 0) {
214 dump_block((char *)node, header->node_size/*, sizeof(off_t)*/);
219 for (int32 i = 0;i < node->all_key_count;i++) {
221 char buffer[256], *key = (char *)node->KeyAt(i, &length);
224 dump_block((char *)node, header->node_size/*, sizeof(off_t)*/);
230 Unaligned<off_t>* value = node->Values() + i;
231 if ((addr_t)value < (addr_t)node
232 || (addr_t)value > (addr_t)node + header->node_size)
262 kprintf(" (duplicate node)\n");
291 bfs_inode* node;
293 node = (bfs_inode*)address;
306 node = &inode->Node();
309 dump_inode(node);
361 kprintf("root node: %p\n", volume->RootNode());
362 kprintf("indices node: %p\n\n", volume->IndicesNode());
424 kprintf("usage: %s <ptr-to-node> [ptr-to-header] [ptr-to-volume]\n",
429 bplustree_node* node = (bplustree_node*)parse_expression(argv[1]);
438 dump_bplustree_node(node, header, volume);
491 "dump a BFS B+tree node");