• Home
  • Raw
  • Download

Lines Matching refs:lo

57 	int lo;  in badblocks_check()  local
74 lo = 0; in badblocks_check()
86 while (hi - lo > 1) { in badblocks_check()
87 int mid = (lo + hi) / 2; in badblocks_check()
94 lo = mid; in badblocks_check()
100 if (hi > lo) { in badblocks_check()
104 while (lo >= 0 && in badblocks_check()
105 BB_OFFSET(p[lo]) + BB_LEN(p[lo]) > s) { in badblocks_check()
106 if (BB_OFFSET(p[lo]) < target) { in badblocks_check()
110 if (rv != -1 && BB_ACK(p[lo])) in badblocks_check()
114 *first_bad = BB_OFFSET(p[lo]); in badblocks_check()
115 *bad_sectors = BB_LEN(p[lo]); in badblocks_check()
117 lo--; in badblocks_check()
167 int lo, hi; in badblocks_set() local
188 lo = 0; in badblocks_set()
191 while (hi - lo > 1) { in badblocks_set()
192 int mid = (lo + hi) / 2; in badblocks_set()
196 lo = mid; in badblocks_set()
200 if (hi > lo && BB_OFFSET(p[lo]) > s) in badblocks_set()
201 hi = lo; in badblocks_set()
203 if (hi > lo) { in badblocks_set()
207 sector_t a = BB_OFFSET(p[lo]); in badblocks_set()
208 sector_t e = a + BB_LEN(p[lo]); in badblocks_set()
209 int ack = BB_ACK(p[lo]); in badblocks_set()
222 p[lo] = BB_MAKE(a, e-a, ack); in badblocks_set()
228 if (BB_LEN(p[lo]) != BB_MAX_LEN) in badblocks_set()
229 p[lo] = BB_MAKE(a, BB_MAX_LEN, ack); in badblocks_set()
261 lo = hi; in badblocks_set()
269 int lolen = BB_LEN(p[lo]); in badblocks_set()
275 int ack = BB_ACK(p[lo]) && BB_ACK(p[hi]); in badblocks_set()
277 p[lo] = BB_MAKE(BB_OFFSET(p[lo]), newlen, ack); in badblocks_set()
334 int lo, hi; in badblocks_clear() local
354 lo = 0; in badblocks_clear()
357 while (hi - lo > 1) { in badblocks_clear()
358 int mid = (lo + hi) / 2; in badblocks_clear()
362 lo = mid; in badblocks_clear()
366 if (hi > lo) { in badblocks_clear()
371 if ((BB_OFFSET(p[lo]) + BB_LEN(p[lo]) > target) && in badblocks_clear()
372 (BB_OFFSET(p[lo]) < target)) { in badblocks_clear()
374 int ack = BB_ACK(p[lo]); in badblocks_clear()
375 sector_t a = BB_OFFSET(p[lo]); in badblocks_clear()
376 sector_t end = a + BB_LEN(p[lo]); in badblocks_clear()
384 memmove(p+lo+1, p+lo, (bb->count - lo) * 8); in badblocks_clear()
386 p[lo] = BB_MAKE(a, s-a, ack); in badblocks_clear()
387 lo++; in badblocks_clear()
389 p[lo] = BB_MAKE(target, end - target, ack); in badblocks_clear()
391 hi = lo; in badblocks_clear()
392 lo--; in badblocks_clear()
394 while (lo >= 0 && in badblocks_clear()
395 (BB_OFFSET(p[lo]) + BB_LEN(p[lo]) > s) && in badblocks_clear()
396 (BB_OFFSET(p[lo]) < target)) { in badblocks_clear()
398 if (BB_OFFSET(p[lo]) < s) { in badblocks_clear()
400 int ack = BB_ACK(p[lo]); in badblocks_clear()
401 sector_t start = BB_OFFSET(p[lo]); in badblocks_clear()
403 p[lo] = BB_MAKE(start, s - start, ack); in badblocks_clear()
407 lo--; in badblocks_clear()
412 if (hi - lo > 1) { in badblocks_clear()
413 memmove(p+lo+1, p+hi, (bb->count - hi) * 8); in badblocks_clear()
414 bb->count -= (hi - lo - 1); in badblocks_clear()