116 	unsigned long bit;  in udf_bitmap_free_blocks()  local
138 		bit = block % (sb->s_blocksize << 3);  in udf_bitmap_free_blocks()
143 		if (bit + count > (sb->s_blocksize << 3)) {  in udf_bitmap_free_blocks()
144 			overflow = bit + count - (sb->s_blocksize << 3);  in udf_bitmap_free_blocks()
153 			if (udf_set_bit(bit + i, bh->b_data)) {  in udf_bitmap_free_blocks()
154 				udf_debug("bit %lu already set\n", bit + i);  in udf_bitmap_free_blocks()
156 					  ((__u8 *)bh->b_data)[(bit + i) >> 3]);  in udf_bitmap_free_blocks()
178 	int bit, block, block_group;  in udf_bitmap_prealloc_blocks()  local
200 		bit = block % (sb->s_blocksize << 3);  in udf_bitmap_prealloc_blocks()
202 		while (bit < (sb->s_blocksize << 3) && block_count > 0) {  in udf_bitmap_prealloc_blocks()
203 			if (!udf_clear_bit(bit, bh->b_data))  in udf_bitmap_prealloc_blocks()
207 			bit++;  in udf_bitmap_prealloc_blocks()
224 	int newbit, bit = 0;  in udf_bitmap_new_block()  local
252 		bit = block % (sb->s_blocksize << 3);  in udf_bitmap_new_block()
253 		if (udf_test_bit(bit, bh->b_data))  in udf_bitmap_new_block()
256 		end_goal = (bit + 63) & ~63;  in udf_bitmap_new_block()
257 		bit = udf_find_next_one_bit(bh->b_data, end_goal, bit);  in udf_bitmap_new_block()
258 		if (bit < end_goal)  in udf_bitmap_new_block()
261 		ptr = memscan((char *)bh->b_data + (bit >> 3), 0xFF,  in udf_bitmap_new_block()
262 			      sb->s_blocksize - ((bit + 7) >> 3));  in udf_bitmap_new_block()
265 			bit = newbit;  in udf_bitmap_new_block()
270 					       sb->s_blocksize << 3, bit);  in udf_bitmap_new_block()
272 			bit = newbit;  in udf_bitmap_new_block()
291 				bit = (ptr - ((char *)bh->b_data)) << 3;  in udf_bitmap_new_block()
295 			bit = udf_find_next_one_bit(bh->b_data,  in udf_bitmap_new_block()
298 			if (bit < sb->s_blocksize << 3)  in udf_bitmap_new_block()
306 	if (bit < sb->s_blocksize << 3)  in udf_bitmap_new_block()
309 		bit = udf_find_next_one_bit(bh->b_data, sb->s_blocksize << 3,  in udf_bitmap_new_block()
311 	if (bit >= sb->s_blocksize << 3) {  in udf_bitmap_new_block()
318 	while (i < 7 && bit > (group_start << 3) &&  in udf_bitmap_new_block()
319 	       udf_test_bit(bit - 1, bh->b_data)) {  in udf_bitmap_new_block()
321 		--bit;  in udf_bitmap_new_block()
325 	newblock = bit + (block_group << (sb->s_blocksize_bits + 3)) -  in udf_bitmap_new_block()
339 	if (!udf_clear_bit(bit, bh->b_data)) {  in udf_bitmap_new_block()
340 		udf_debug("bit already cleared for block %d\n", bit);  in udf_bitmap_new_block()