459         data_block_t node_block,  in block_tree_node_get_key()  argument
474     if (!key && node_block == tree->inserting.block) {  in block_tree_node_get_key()
560         data_block_t node_block,  in block_tree_node_get_child()  argument
575     if (!child && node_block == tree->inserting.block) {  in block_tree_node_get_child()
599         data_block_t node_block,  in block_tree_node_get_data()  argument
614     if (!datap && node_block == tree->inserting.block) {  in block_tree_node_get_data()
642         data_block_t node_block,  in block_tree_node_print_internal()  argument
651         child = block_tree_node_get_child(tr, tree, node_block, node_ro, i);  in block_tree_node_print_internal()
657         if (block_tree_node_get_key(tree, node_block, node_ro, i)) {  in block_tree_node_print_internal()
662                    block_tree_node_get_key(tree, node_block, node_ro, i));  in block_tree_node_print_internal()
665     assert(!block_tree_node_get_child(tr, tree, node_block, node_ro, i));  in block_tree_node_print_internal()
678                                        data_block_t node_block,  in block_tree_node_print_leaf()  argument
688         key = block_tree_node_get_key(tree, node_block, node_ro, i);  in block_tree_node_print_leaf()
689         data = block_tree_node_get_data(tr, tree, node_block, node_ro, i);  in block_tree_node_print_leaf()
712                                   data_block_t node_block,  in block_tree_node_print()  argument
714     printf("  %3" PRIu64 ":", node_block);  in block_tree_node_print()
716         block_tree_node_print_leaf(tr, tree, node_block, node_ro);  in block_tree_node_print()
718         block_tree_node_print_internal(tr, tree, node_block, node_ro);  in block_tree_node_print()
783                                   data_block_t node_block,  in block_tree_node_check()  argument
802         key = block_tree_node_get_key(tree, node_block, node_ro, i);  in block_tree_node_check()
810                        __func__, node_block, i, key);  in block_tree_node_check()
818                        __func__, node_block, i);  in block_tree_node_check()
826                    __func__, node_block, i, key, min_key, prev_key, max_key);  in block_tree_node_check()
839         block_tree_node_print(tr, tree, node_block, node_ro);  in block_tree_node_check()
1204                                       data_block_t node_block,  in block_tree_node_find_block()  argument
1220         curr_key = block_tree_node_get_key(tree, node_block, node_ro, i);  in block_tree_node_find_block()
1227         assert(tree->inserting.block == node_block);  in block_tree_node_find_block()
1238         curr_key = block_tree_node_get_key(tree, node_block, node_ro, i);  in block_tree_node_find_block()
1246         *prev_key = block_tree_node_get_key(tree, node_block, node_ro, i - 1);  in block_tree_node_find_block()
1252         *child = block_tree_node_get_child(tr, tree, node_block, node_ro, i);  in block_tree_node_find_block()
1260                __func__, node_block, key, i,  in block_tree_node_find_block()
1263         block_tree_node_print(tr, tree, node_block, node_ro);  in block_tree_node_find_block()