B_IS_IN_TREE     1618 fs/reiserfs/do_balan.c 	if (!bh || !B_IS_IN_TREE(bh))
B_IS_IN_TREE     1640 fs/reiserfs/do_balan.c 	    !B_IS_IN_TREE(bh)) {
B_IS_IN_TREE      974 fs/reiserfs/fix_node.c 	       !B_IS_IN_TREE(father) ||
B_IS_IN_TREE      975 fs/reiserfs/fix_node.c 	       !B_IS_IN_TREE(tb->FL[h]) ||
B_IS_IN_TREE      993 fs/reiserfs/fix_node.c 		RFALSE(buffer_uptodate(left) && !B_IS_IN_TREE(left),
B_IS_IN_TREE     1052 fs/reiserfs/fix_node.c 		if (!B_IS_IN_TREE
B_IS_IN_TREE     1227 fs/reiserfs/fix_node.c 	RFALSE((curf && !B_IS_IN_TREE(curf)) ||
B_IS_IN_TREE     1228 fs/reiserfs/fix_node.c 	       (curcf && !B_IS_IN_TREE(curcf)),
B_IS_IN_TREE     1262 fs/reiserfs/fix_node.c 	RFALSE((curf && !B_IS_IN_TREE(curf)) ||
B_IS_IN_TREE     1263 fs/reiserfs/fix_node.c 	       (curcf && !B_IS_IN_TREE(curcf)),
B_IS_IN_TREE     2115 fs/reiserfs/fix_node.c 	if (!B_IS_IN_TREE
B_IS_IN_TREE     2187 fs/reiserfs/fix_node.c 		RFALSE(!B_IS_IN_TREE(tb->FL[h]) ||
B_IS_IN_TREE     2191 fs/reiserfs/fix_node.c 		RFALSE(!B_IS_IN_TREE(bh), "PAP-8280: invalid child");
B_IS_IN_TREE     2329 fs/reiserfs/fix_node.c 		if (!B_IS_IN_TREE(bh))
B_IS_IN_TREE     2592 fs/reiserfs/fix_node.c 	if (!buffer_uptodate(tbS0) || !B_IS_IN_TREE(tbS0))
B_IS_IN_TREE     2966 fs/reiserfs/reiserfs.h int B_IS_IN_TREE(const struct buffer_head *);
B_IS_IN_TREE      232 fs/reiserfs/stree.c 		if (!B_IS_IN_TREE
B_IS_IN_TREE      278 fs/reiserfs/stree.c 		if (!B_IS_IN_TREE
B_IS_IN_TREE      686 fs/reiserfs/stree.c 		    (!B_IS_IN_TREE(bh) ||
B_IS_IN_TREE      909 fs/reiserfs/stree.c 	if (!B_IS_IN_TREE(bh))