Lines Matching refs:end
150 int end, next;
191 for (end = *beg + 1;; end++) {
192 if (end >= *beg + max || end >= boundary
193 || reiserfs_test_le_bit(end, bh->b_data)) {
194 next = end;
199 * finding the other end of zero bit window requires
203 if (unfm && is_block_in_journal(s, bmap_n, end, &next))
209 * (end) points to one bit after the window end
213 if (end - *beg >= min) {
220 for (i = *beg; i < end; i++) {
236 end = i;
257 bi->free_count -= (end - *beg);
264 PUT_SB_FREE_BLOCKS(s, SB_FREE_BLOCKS(s) - (end - *beg));
267 return end - (*beg);
792 hint->beg + keyed_hash(hash_in, 4) % (hint->end - hint->beg);
914 hint->end = border - 1;
925 4) % (hint->end - hint->beg);
930 4) % (hint->end - hint->beg);
945 hint->beg + keyed_hash(hash_in, 4) % (hint->end - hint->beg);
964 4) % (hint->end - hint->beg);
980 4) % (hint->end - hint->beg - 1);
997 le32_to_cpu(INODE_PKEY(hint->inode)->k_dir_id) % (hint->end -
1011 (keyed_hash((char *)(&key->k_dir_id), 4) % 100) * (hint->end / 100);
1013 || slice_start + (hint->end / 100) <= hint->search_start) {
1025 hint->end = SB_BLOCK_COUNT(s) - 1;
1236 case 0: /* Search from hint->search_start to end of disk */