138     struct reiserfs_bitmap_info *bi=&SB_AP_BITMAP(s)[bmap_n];  in scan_bitmap_block()  local
149     if ( !bi ) {  in scan_bitmap_block()
153     if (buffer_locked (bi->bh)) {  in scan_bitmap_block()
155        __wait_on_buffer (bi->bh);  in scan_bitmap_block()
160     if (bi->first_zero_hint > *beg || bi->free_count == 1)  in scan_bitmap_block()
161 	*beg = bi->first_zero_hint;  in scan_bitmap_block()
165 	if (bi->free_count < min)  in scan_bitmap_block()
170 	        ((unsigned long*)(bi->bh->b_data), boundary, *beg);  in scan_bitmap_block()
181 	    if (end >= *beg + max || end >= boundary || reiserfs_test_le_bit (end, bi->bh->b_data)) {  in scan_bitmap_block()
195 	    reiserfs_prepare_for_journal (s, bi->bh, 1);  in scan_bitmap_block()
199 		if (reiserfs_test_and_set_le_bit (i, bi->bh->b_data)) {  in scan_bitmap_block()
210 			reiserfs_test_and_clear_le_bit (i, bi->bh->b_data);  in scan_bitmap_block()
211 		    reiserfs_restore_prepared_buffer (s, bi->bh);  in scan_bitmap_block()
212 		    *beg = max(org, (int)bi->first_zero_hint);  in scan_bitmap_block()
217 	    bi->free_count -= (end - *beg);  in scan_bitmap_block()
221 	    if ( bi->first_zero_hint >= *beg)  in scan_bitmap_block()
223 		bi->first_zero_hint = (bi->free_count > 0 ) ?  in scan_bitmap_block()
225 			((unsigned long*)(bi->bh->b_data), s->s_blocksize << 3, end) : (s->s_blocksize << 3);  in scan_bitmap_block()
227 	    journal_mark_dirty (th, s, bi->bh);  in scan_bitmap_block()