Lines Matching defs:mid
296 * XXX should be the one closest to mid but mid is not yet computed.
371 int mid=0; /* midpoint for binary srch */
453 mid = (low + high) >> 1;
454 if ((hash = be32_to_cpu(blp[mid].hashval)) == args->hashval)
457 low = mid + 1;
459 high = mid - 1;
461 while (mid >= 0 && be32_to_cpu(blp[mid].hashval) >= args->hashval) {
462 mid--;
499 mid++;
500 if (mid)
501 memmove(blp, &blp[1], mid * sizeof(*blp));
503 lfloghigh = mid;
509 for (lowstale = mid;
515 for (highstale = mid + 1;
519 (lowstale < 0 || mid - lowstale > highstale - mid);
527 mid - lowstale <= highstale - mid)) {
528 if (mid - lowstale)
530 (mid - lowstale) * sizeof(*blp));
532 lfloghigh = max(mid, lfloghigh);
539 mid++;
540 if (highstale - mid)
541 memmove(&blp[mid + 1], &blp[mid],
542 (highstale - mid) * sizeof(*blp));
543 lfloglow = min(mid, lfloglow);
555 blp[mid].hashval = cpu_to_be32(args->hashval);
556 blp[mid].address = cpu_to_be32(xfs_dir2_byte_to_dataptr(
691 int mid; /* binary search current idx */
712 mid = (low + high) >> 1;
713 if ((hash = be32_to_cpu(blp[mid].hashval)) == args->hashval)
716 low = mid + 1;
718 high = mid - 1;
728 while (mid > 0 && be32_to_cpu(blp[mid - 1].hashval) == args->hashval) {
729 mid--;
736 if ((addr = be32_to_cpu(blp[mid].address)) == XFS_DIR2_NULL_DATAPTR)
752 *entno = mid;
756 } while (++mid < be32_to_cpu(btp->count) &&
757 be32_to_cpu(blp[mid].hashval) == hash);