Home
last modified time | relevance | path

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

/linux-2.6.39/fs/reiserfs/ !
Dstree.c406 if (blkh_level(blkh) != DISK_LEAF_NODE_LEVEL) { in is_leaf()
476 if (nr <= DISK_LEAF_NODE_LEVEL || nr > MAX_HEIGHT) { in is_internal()
511 if (level == DISK_LEAF_NODE_LEVEL) in is_tree_node()
740 DISK_LEAF_NODE_LEVEL) ? IH_SIZE : in search_by_key()
764 node_level == DISK_LEAF_NODE_LEVEL + 1) { in search_by_key()
Dprints.c725 if (!(B_LEVEL(bh) > DISK_LEAF_NODE_LEVEL && B_LEVEL(bh) <= MAX_HEIGHT)) in check_internal_block_head()
Ddo_balan.c110 RFALSE(tb->FR[0] && B_LEVEL(tb->FR[0]) != DISK_LEAF_NODE_LEVEL + 1, in balance_leaf_when_delete()
1171 set_blkh_level(B_BLK_HEAD(S_new[i]), DISK_LEAF_NODE_LEVEL); in balance_leaf()
Dfix_node.c1016 RFALSE(B_LEVEL(*pcom_father) <= DISK_LEAF_NODE_LEVEL, in get_far_parent()
/linux-2.6.39/include/linux/ !
Dreiserfs_fs.h883 #define DISK_LEAF_NODE_LEVEL 1 /* Leaf node level. */ macro
900 #define B_IS_ITEMS_LEVEL(bh) (B_LEVEL(bh) == DISK_LEAF_NODE_LEVEL)
903 #define B_IS_KEYS_LEVEL(bh) (B_LEVEL(bh) > DISK_LEAF_NODE_LEVEL \
1975 #define search_item(s,key,path) search_by_key (s, key, path, DISK_LEAF_NODE_LEVEL)