B_IS_IN_TREE     1865 fs/reiserfs/do_balan.c 	if (!bh || !B_IS_IN_TREE(bh))
B_IS_IN_TREE     1886 fs/reiserfs/do_balan.c 	    !B_IS_IN_TREE(bh)) {
B_IS_IN_TREE      912 fs/reiserfs/fix_node.c 	       !B_IS_IN_TREE(p_s_father) ||
B_IS_IN_TREE      913 fs/reiserfs/fix_node.c 	       !B_IS_IN_TREE(p_s_tb->FL[n_h]) ||
B_IS_IN_TREE      928 fs/reiserfs/fix_node.c 		RFALSE(buffer_uptodate(left) && !B_IS_IN_TREE(left),
B_IS_IN_TREE      979 fs/reiserfs/fix_node.c 		if (!B_IS_IN_TREE
B_IS_IN_TREE     1123 fs/reiserfs/fix_node.c 	RFALSE((p_s_curf && !B_IS_IN_TREE(p_s_curf)) ||
B_IS_IN_TREE     1124 fs/reiserfs/fix_node.c 	       (p_s_curcf && !B_IS_IN_TREE(p_s_curcf)),
B_IS_IN_TREE     1154 fs/reiserfs/fix_node.c 	RFALSE((p_s_curf && !B_IS_IN_TREE(p_s_curf)) ||
B_IS_IN_TREE     1155 fs/reiserfs/fix_node.c 	       (p_s_curcf && !B_IS_IN_TREE(p_s_curcf)),
B_IS_IN_TREE     1910 fs/reiserfs/fix_node.c 	if (!B_IS_IN_TREE
B_IS_IN_TREE     1972 fs/reiserfs/fix_node.c 		RFALSE(!B_IS_IN_TREE(p_s_tb->FL[n_h]) ||
B_IS_IN_TREE     1976 fs/reiserfs/fix_node.c 		RFALSE(!B_IS_IN_TREE(p_s_bh), "PAP-8280: invalid child");
B_IS_IN_TREE     2109 fs/reiserfs/fix_node.c 		if (!B_IS_IN_TREE(p_s_bh)) {
B_IS_IN_TREE     2365 fs/reiserfs/fix_node.c 	if (!buffer_uptodate(p_s_tbS0) || !B_IS_IN_TREE(p_s_tbS0)) {
B_IS_IN_TREE      265 fs/reiserfs/stree.c 		if (!B_IS_IN_TREE
B_IS_IN_TREE      308 fs/reiserfs/stree.c 		if (!B_IS_IN_TREE
B_IS_IN_TREE      688 fs/reiserfs/stree.c 		    (!B_IS_IN_TREE(p_s_bh) ||
B_IS_IN_TREE      892 fs/reiserfs/stree.c 	if (!B_IS_IN_TREE(p_s_bh = PATH_PLAST_BUFFER(p_s_path)))
B_IS_IN_TREE     1773 include/linux/reiserfs_fs.h int B_IS_IN_TREE(const struct buffer_head *);