Searched refs:B_IS_IN_TREE (Results 1 – 4 of 4) sorted by relevance
976 !B_IS_IN_TREE(father) || in is_left_neighbor_in_cache()977 !B_IS_IN_TREE(tb->FL[h]) || in is_left_neighbor_in_cache()995 RFALSE(buffer_uptodate(left) && !B_IS_IN_TREE(left), in is_left_neighbor_in_cache()1054 if (!B_IS_IN_TREE in get_far_parent()1229 RFALSE((curf && !B_IS_IN_TREE(curf)) || in get_parents()1230 (curcf && !B_IS_IN_TREE(curcf)), in get_parents()1264 RFALSE((curf && !B_IS_IN_TREE(curf)) || in get_parents()1265 (curcf && !B_IS_IN_TREE(curcf)), in get_parents()2119 if (!B_IS_IN_TREE in get_direct_parent()2191 RFALSE(!B_IS_IN_TREE(tb->FL[h]) || in get_neighbors()[all …]
20 inline int B_IS_IN_TREE(const struct buffer_head *bh) in B_IS_IN_TREE() function232 if (!B_IS_IN_TREE in get_lkey()278 if (!B_IS_IN_TREE in get_rkey()689 (!B_IS_IN_TREE(bh) || in search_by_key()913 if (!B_IS_IN_TREE(bh)) in comp_items()
1629 if (!bh || !B_IS_IN_TREE(bh)) in check_internal_node()1651 !B_IS_IN_TREE(bh)) { in locked_or_not_in_tree()
2964 int B_IS_IN_TREE(const struct buffer_head *);
