150 	int end, next;  in scan_bitmap_block()  local
191 		for (end = *beg + 1;; end++) {  in scan_bitmap_block()
192 			if (end >= *beg + max || end >= boundary  in scan_bitmap_block()
193 			    || reiserfs_test_le_bit(end, bh->b_data)) {  in scan_bitmap_block()
194 				next = end;  in scan_bitmap_block()
203 			if (unfm && is_block_in_journal(s, bmap_n, end, &next))  in scan_bitmap_block()
213 		if (end - *beg >= min) {  in scan_bitmap_block()
220 			for (i = *beg; i < end; i++) {  in scan_bitmap_block()
236 						end = i;  in scan_bitmap_block()
257 			bi->free_count -= (end - *beg);  in scan_bitmap_block()
264 			PUT_SB_FREE_BLOCKS(s, SB_FREE_BLOCKS(s) - (end - *beg));  in scan_bitmap_block()
267 			return end - (*beg);  in scan_bitmap_block()
792 	    hint->beg + keyed_hash(hash_in, 4) % (hint->end - hint->beg);  in new_hashed_relocation()
914 		hint->end = border - 1;  in set_border_in_hint()
925 			       4) % (hint->end - hint->beg);  in displace_large_file()
930 			       4) % (hint->end - hint->beg);  in displace_large_file()
945 	    hint->beg + keyed_hash(hash_in, 4) % (hint->end - hint->beg);  in hash_formatted_node()
964 				   4) % (hint->end - hint->beg);  in displace_new_packing_locality()
980 					 4) % (hint->end - hint->beg - 1);  in old_hashed_relocation()
997 	    le32_to_cpu(INODE_PKEY(hint->inode)->k_dir_id) % (hint->end -  in old_way()
1011 	    (keyed_hash((char *)(&key->k_dir_id), 4) % 100) * (hint->end / 100);  in hundredth_slices()
1013 	    || slice_start + (hint->end / 100) <= hint->search_start) {  in hundredth_slices()
1025 	hint->end = SB_BLOCK_COUNT(s) - 1;  in determine_search_start()