Searched refs:B_LEVEL (Results 1 – 5 of 5) sorted by relevance
137 B_LEVEL(bh), B_NR_ITEMS(bh), B_FREE_SPACE(bh)); in sprintf_block_head()734 if (!(B_LEVEL(bh) > DISK_LEAF_NODE_LEVEL && B_LEVEL(bh) <= MAX_HEIGHT)) in check_internal_block_head()
22 RFALSE(B_LEVEL(bh) > MAX_HEIGHT, in B_IS_IN_TREE()25 return (B_LEVEL(bh) != FREE_LEVEL); in B_IS_IN_TREE()531 if (B_LEVEL(bh) != level) { in is_tree_node()534 B_LEVEL(bh), level); in is_tree_node()716 B_LEVEL(bh) != expected_level || in search_by_key()765 node_level = B_LEVEL(bh); in search_by_key()
1684 #define B_LEVEL(bh) (blkh_level(B_BLK_HEAD(bh))) macro1695 #define B_IS_ITEMS_LEVEL(bh) (B_LEVEL(bh) == DISK_LEAF_NODE_LEVEL)1698 #define B_IS_KEYS_LEVEL(bh) (B_LEVEL(bh) > DISK_LEAF_NODE_LEVEL \1699 && B_LEVEL(bh) <= MAX_HEIGHT)
1103 RFALSE(B_LEVEL(*pcom_father) <= DISK_LEAF_NODE_LEVEL, in get_far_parent()1154 RFALSE(B_LEVEL(*pfather) != h + 1, in get_far_parent()
247 RFALSE(tb->FR[0] && B_LEVEL(tb->FR[0]) != DISK_LEAF_NODE_LEVEL + 1, in balance_leaf_when_delete()