Lines Matching full:hi

469 	/* Each level of quicksort uses a lo and a hi index */  in xfarray_sortinfo_alloc()
545 xfarray_idx_t hi) in xfarray_isort() argument
549 loff_t len = xfarray_pos(si->array, hi - lo + 1); in xfarray_isort()
552 trace_xfarray_isort(si, lo, hi); in xfarray_isort()
560 sort(scratch, hi - lo + 1, si->array->obj_size, si->cmp_fn, NULL); in xfarray_isort()
606 xfarray_idx_t hi) in xfarray_want_pagesort() argument
614 end_pos = xfarray_pos(si->array, hi) + si->array->obj_size - 1; in xfarray_want_pagesort()
625 xfarray_idx_t hi) in xfarray_pagesort() argument
629 uint64_t len = xfarray_pos(si->array, hi - lo); in xfarray_pagesort()
632 trace_xfarray_pagesort(si, lo, hi); in xfarray_pagesort()
641 sort(startp, hi - lo + 1, si->array->obj_size, si->cmp_fn, NULL); in xfarray_pagesort()
695 xfarray_idx_t hi) in xfarray_qsort_pivot() argument
701 xfarray_idx_t step = (hi - lo) / (XFARRAY_QSORT_PIVOT_NR - 1); in xfarray_qsort_pivot()
720 *idxp = hi; in xfarray_qsort_pivot()
804 xfarray_idx_t hi) in xfarray_qsort_push() argument
919 * and hi after selecting a pivot, we will try to retain the xfile memory
939 xfarray_idx_t lo, hi; in xfarray_sort() local
956 hi = si_hi[si->stack_depth]; in xfarray_sort()
958 trace_xfarray_qsort(si, lo, hi); in xfarray_sort()
961 if (lo >= hi) { in xfarray_sort()
970 if (xfarray_want_pagesort(si, lo, hi)) { in xfarray_sort()
971 error = xfarray_pagesort(si, lo, hi); in xfarray_sort()
979 if (xfarray_want_isort(si, lo, hi)) { in xfarray_sort()
980 error = xfarray_isort(si, lo, hi); in xfarray_sort()
988 error = xfarray_qsort_pivot(si, lo, hi); in xfarray_sort()
993 * Rearrange a[lo..hi] such that everything smaller than the in xfarray_sort()
997 while (lo < hi) { in xfarray_sort()
999 * Decrement hi until it finds an a[hi] less than the in xfarray_sort()
1002 error = xfarray_sort_load_cached(si, hi, scratch); in xfarray_sort()
1006 lo < hi) { in xfarray_sort()
1007 hi--; in xfarray_sort()
1008 error = xfarray_sort_load_cached(si, hi, in xfarray_sort()
1020 /* Copy that item (a[hi]) to a[lo]. */ in xfarray_sort()
1021 if (lo < hi) { in xfarray_sort()
1035 lo < hi) { in xfarray_sort()
1049 /* Copy that item (a[lo]) to a[hi]. */ in xfarray_sort()
1050 if (lo < hi) { in xfarray_sort()
1051 error = xfarray_sort_store(si, hi--, scratch); in xfarray_sort()
1071 error = xfarray_qsort_push(si, si_lo, si_hi, lo, hi); in xfarray_sort()