2096 	struct buffer_head *bh;  in get_direct_parent()  local
2120 	    (bh = PATH_OFFSET_PBUFFER(path, path_offset - 1)))  in get_direct_parent()
2125 				  path_offset - 1)) > B_NR_ITEMS(bh))  in get_direct_parent()
2129 	if (B_N_CHILD_NUM(bh, position) !=  in get_direct_parent()
2133 	if (buffer_locked(bh)) {  in get_direct_parent()
2135 		__wait_on_buffer(bh);  in get_direct_parent()
2161 	struct buffer_head *bh;  in get_neighbors()  local
2169 		bh = PATH_OFFSET_PBUFFER(tb->tb_path, path_offset);  in get_neighbors()
2171 		RFALSE(bh == tb->FL[h] &&  in get_neighbors()
2176 		    (bh ==  in get_neighbors()
2181 		bh = sb_bread(sb, son_number);  in get_neighbors()
2183 		if (!bh)  in get_neighbors()
2186 			brelse(bh);  in get_neighbors()
2194 		       bh->b_blocknr, "PAP-8275: invalid parent");  in get_neighbors()
2195 		RFALSE(!B_IS_IN_TREE(bh), "PAP-8280: invalid child");  in get_neighbors()
2197 		       B_FREE_SPACE(bh) !=  in get_neighbors()
2198 		       MAX_CHILD_SIZE(bh) -  in get_neighbors()
2203 		tb->L[h] = bh;  in get_neighbors()
2209 		bh = PATH_OFFSET_PBUFFER(tb->tb_path, path_offset);  in get_neighbors()
2211 		RFALSE(bh == tb->FR[h] &&  in get_neighbors()
2214 		       B_NR_ITEMS(bh),  in get_neighbors()
2218 		    (bh == tb->FR[h]) ? tb->rkey[h] + 1 : 0;  in get_neighbors()
2221 		bh = sb_bread(sb, son_number);  in get_neighbors()
2223 		if (!bh)  in get_neighbors()
2226 			brelse(bh);  in get_neighbors()
2231 		tb->R[h] = bh;  in get_neighbors()
2234 		       && B_FREE_SPACE(bh) !=  in get_neighbors()
2235 		       MAX_CHILD_SIZE(bh) -  in get_neighbors()
2238 		       B_FREE_SPACE(bh), MAX_CHILD_SIZE(bh),  in get_neighbors()
2245 static int get_virtual_node_size(struct super_block *sb, struct buffer_head *bh)  in get_virtual_node_size()  argument
2318 				   struct buffer_head *bh,  in tb_buffer_sanity_check()  argument
2321 	if (bh) {  in tb_buffer_sanity_check()
2322 		if (atomic_read(&(bh->b_count)) <= 0)  in tb_buffer_sanity_check()
2326 				       "(%b)", descr, level, bh);  in tb_buffer_sanity_check()
2328 		if (!buffer_uptodate(bh))  in tb_buffer_sanity_check()
2331 				       descr, level, bh);  in tb_buffer_sanity_check()
2333 		if (!B_IS_IN_TREE(bh))  in tb_buffer_sanity_check()
2336 				       descr, level, bh);  in tb_buffer_sanity_check()
2338 		if (bh->b_bdev != sb->s_bdev)  in tb_buffer_sanity_check()
2341 				       descr, level, bh);  in tb_buffer_sanity_check()
2343 		if (bh->b_size != sb->s_blocksize)  in tb_buffer_sanity_check()
2346 				       descr, level, bh);  in tb_buffer_sanity_check()
2348 		if (bh->b_blocknr > SB_BLOCK_COUNT(sb))  in tb_buffer_sanity_check()
2351 				       descr, level, bh);  in tb_buffer_sanity_check()
2356 				   struct buffer_head *bh,  in tb_buffer_sanity_check()  argument
2362 static int clear_all_dirty_bits(struct super_block *s, struct buffer_head *bh)  in clear_all_dirty_bits()  argument
2364 	return reiserfs_prepare_for_journal(s, bh, 0);  in clear_all_dirty_bits()