Searched refs:prev_badblocks (Results 1 - 1 of 1) sorted by relevance
| /linux-master/block/ |
| H A D | badblocks.c | 325 * time for the new loop prev_badblocks() is called to find an already set range
328 * the binary search inside prev_badblocks(), it is possible to provide a hint
329 * to prev_badblocks() for a fast path, then the expensive binary search can be
330 * avoided. In my test with the hint to prev_badblocks(), except for the first
331 * loop, all rested calls to prev_badblocks() can go into the fast path and
481 static int prev_badblocks(struct badblocks *bb, struct badblocks_context *bad, function
907 prev = prev_badblocks(bb, &bad, hint);
1181 prev = prev_badblocks(bb, &bad, hint);
1312 prev = prev_badblocks(bb, &bad, hint);
|
Completed in 106 milliseconds