41 					     struct buffer_head ** bh)  in ext2_get_group_desc()  argument
68 	if (bh)  in ext2_get_group_desc()
69 		*bh = sbi->s_group_desc[group_desc];  in ext2_get_group_desc()
76 					struct buffer_head *bh)  in ext2_valid_block_bitmap()  argument
88 	if (!ext2_test_bit(offset, bh->b_data))  in ext2_valid_block_bitmap()
95 	if (!ext2_test_bit(offset, bh->b_data))  in ext2_valid_block_bitmap()
102 	next_zero_bit = ext2_find_next_zero_bit(bh->b_data,  in ext2_valid_block_bitmap()
127 	struct buffer_head * bh = NULL;  in read_block_bitmap()  local
134 	bh = sb_getblk(sb, bitmap_blk);  in read_block_bitmap()
135 	if (unlikely(!bh)) {  in read_block_bitmap()
142 	if (likely(bh_uptodate_or_lock(bh)))  in read_block_bitmap()
143 		return bh;  in read_block_bitmap()
145 	if (bh_submit_read(bh) < 0) {  in read_block_bitmap()
146 		brelse(bh);  in read_block_bitmap()
154 	ext2_valid_block_bitmap(sb, desc, block_group, bh);  in read_block_bitmap()
159 	return bh;  in read_block_bitmap()
163 	struct ext2_group_desc *desc, struct buffer_head *bh, int count)  in group_adjust_blocks()  argument
173 		mark_buffer_dirty(bh);  in group_adjust_blocks()
579 bitmap_search_next_usable_block(ext2_grpblk_t start, struct buffer_head *bh,  in bitmap_search_next_usable_block()  argument
584 	next = ext2_find_next_zero_bit(bh->b_data, maxblocks, start);  in bitmap_search_next_usable_block()
603 find_next_usable_block(int start, struct buffer_head *bh, int maxblocks)  in find_next_usable_block()  argument
620 		here = ext2_find_next_zero_bit(bh->b_data, end_goal, start);  in find_next_usable_block()
630 	p = ((char *)bh->b_data) + (here >> 3);  in find_next_usable_block()
632 	next = (r - ((char *)bh->b_data)) << 3;  in find_next_usable_block()
637 	here = bitmap_search_next_usable_block(here, bh, maxblocks);  in find_next_usable_block()