48                                        struct buffer_head *bh)  in buffer_info_init_bh()  argument
51 	bi->bi_bh       = bh;  in buffer_info_init_bh()
57 				       struct buffer_head *bh, int flag)  in do_balance_mark_leaf_dirty()  argument
59 	journal_mark_dirty(tb->transaction_handle, bh);  in do_balance_mark_leaf_dirty()
1516 static void store_thrown(struct tree_balance *tb, struct buffer_head *bh)  in store_thrown()  argument
1520 	if (buffer_dirty(bh))  in store_thrown()
1525 			tb->thrown[i] = bh;  in store_thrown()
1526 			get_bh(bh);	/* free_thrown puts this */  in store_thrown()
1551 void reiserfs_invalidate_buffer(struct tree_balance *tb, struct buffer_head *bh)  in reiserfs_invalidate_buffer()  argument
1554 	blkh = B_BLK_HEAD(bh);  in reiserfs_invalidate_buffer()
1558 	clear_buffer_dirty(bh);  in reiserfs_invalidate_buffer()
1559 	store_thrown(tb, bh);  in reiserfs_invalidate_buffer()
1621 static void check_internal_node(struct super_block *s, struct buffer_head *bh,  in check_internal_node()  argument
1627 	RFALSE(!bh, "PAP-12336: bh == 0");  in check_internal_node()
1629 	if (!bh || !B_IS_IN_TREE(bh))  in check_internal_node()
1632 	RFALSE(!buffer_dirty(bh) &&  in check_internal_node()
1633 	       !(buffer_journaled(bh) || buffer_journal_dirty(bh)),  in check_internal_node()
1634 	       "PAP-12337: buffer (%b) must be dirty", bh);  in check_internal_node()
1635 	dc = B_N_CHILD(bh, 0);  in check_internal_node()
1637 	for (i = 0; i <= B_NR_ITEMS(bh); i++, dc++) {  in check_internal_node()
1642 				       dc, bh);  in check_internal_node()
1648 				  struct buffer_head *bh, char *which)  in locked_or_not_in_tree()  argument
1650 	if ((!buffer_journal_prepared(bh) && buffer_locked(bh)) ||  in locked_or_not_in_tree()
1651 	    !B_IS_IN_TREE(bh)) {  in locked_or_not_in_tree()
1652 		reiserfs_warning(tb->tb_sb, "vs-12339", "%s (%b)", which, bh);  in locked_or_not_in_tree()