Home
last modified time | relevance | path

Searched refs:B_IS_IN_TREE (Results 1 – 4 of 4) sorted by relevance

/linux-6.1.9/fs/reiserfs/
Dfix_node.c974 !B_IS_IN_TREE(father) || in is_left_neighbor_in_cache()
975 !B_IS_IN_TREE(tb->FL[h]) || in is_left_neighbor_in_cache()
993 RFALSE(buffer_uptodate(left) && !B_IS_IN_TREE(left), in is_left_neighbor_in_cache()
1052 if (!B_IS_IN_TREE in get_far_parent()
1227 RFALSE((curf && !B_IS_IN_TREE(curf)) || in get_parents()
1228 (curcf && !B_IS_IN_TREE(curcf)), in get_parents()
1262 RFALSE((curf && !B_IS_IN_TREE(curf)) || in get_parents()
1263 (curcf && !B_IS_IN_TREE(curcf)), in get_parents()
2115 if (!B_IS_IN_TREE in get_direct_parent()
2187 RFALSE(!B_IS_IN_TREE(tb->FL[h]) || in get_neighbors()
[all …]
Dstree.c20 inline int B_IS_IN_TREE(const struct buffer_head *bh) in B_IS_IN_TREE() function
232 if (!B_IS_IN_TREE in get_lkey()
278 if (!B_IS_IN_TREE in get_rkey()
713 (!B_IS_IN_TREE(bh) || in search_by_key()
936 if (!B_IS_IN_TREE(bh)) in comp_items()
Ddo_balan.c1618 if (!bh || !B_IS_IN_TREE(bh)) in check_internal_node()
1640 !B_IS_IN_TREE(bh)) { in locked_or_not_in_tree()
Dreiserfs.h2964 int B_IS_IN_TREE(const struct buffer_head *);