Searched refs:B_IS_IN_TREE (Results 1 – 4 of 4) sorted by relevance
912 !B_IS_IN_TREE(father) || in is_left_neighbor_in_cache()913 !B_IS_IN_TREE(tb->FL[h]) || in is_left_neighbor_in_cache()928 RFALSE(buffer_uptodate(left) && !B_IS_IN_TREE(left), in is_left_neighbor_in_cache()979 if (!B_IS_IN_TREE in get_far_parent()1129 RFALSE((curf && !B_IS_IN_TREE(curf)) || in get_parents()1130 (curcf && !B_IS_IN_TREE(curcf)), in get_parents()1161 RFALSE((curf && !B_IS_IN_TREE(curf)) || in get_parents()1162 (curcf && !B_IS_IN_TREE(curcf)), in get_parents()1917 if (!B_IS_IN_TREE in get_direct_parent()1983 RFALSE(!B_IS_IN_TREE(tb->FL[h]) || in get_neighbors()[all …]
59 inline int B_IS_IN_TREE(const struct buffer_head *bh) in B_IS_IN_TREE() function258 if (!B_IS_IN_TREE in get_lkey()301 if (!B_IS_IN_TREE in get_rkey()685 (!B_IS_IN_TREE(bh) || in search_by_key()889 if (!B_IS_IN_TREE(bh)) in comp_items()
1802 if (!bh || !B_IS_IN_TREE(bh)) in check_internal_node()1824 !B_IS_IN_TREE(bh)) { in locked_or_not_in_tree()
2508 int B_IS_IN_TREE(const struct buffer_head *);