Lines Matching refs:beg
144 unsigned int bmap_n, int *beg, int boundary,
151 int org = *beg;
176 *beg = reiserfs_find_next_zero_le_bit
177 ((unsigned long *)(bh->b_data), boundary, *beg);
183 if (*beg + min > boundary) {
188 if (unfm && is_block_in_journal(s, bmap_n, *beg, beg))
191 for (end = *beg + 1;; end++) {
192 if (end >= *beg + max || end >= boundary
208 * now (*beg) points to beginning of zero bits window,
213 if (end - *beg >= min) {
220 for (i = *beg; i < end; i++) {
235 if (i >= *beg + min) {
244 while (--i >= *beg)
248 *beg = org;
257 bi->free_count -= (end - *beg);
264 PUT_SB_FREE_BLOCKS(s, SB_FREE_BLOCKS(s) - (end - *beg));
267 return end - (*beg);
269 *beg = next;
781 /*hint->search_start = hint->beg;*/
792 hint->beg + keyed_hash(hash_in, 4) % (hint->end - hint->beg);
916 hint->beg = border;
923 hint->beg +
925 4) % (hint->end - hint->beg);
928 hint->beg +
930 4) % (hint->end - hint->beg);
945 hint->beg + keyed_hash(hash_in, 4) % (hint->end - hint->beg);
963 hint->beg + keyed_hash((char *)(&key->k_objectid),
964 4) % (hint->end - hint->beg);
979 hint->beg + (u32) keyed_hash(((char *)(&hash_in)),
980 4) % (hint->end - hint->beg - 1);
996 hint->beg +
998 hint->beg);
1024 hint->beg = 0;
1240 case 1: /* Search from hint->beg to hint->search_start */
1241 start = hint->beg;
1244 case 2: /* Last chance: Search from 0 to hint->beg */
1246 finish = hint->beg;