Lines Matching full:sort

438 /* Allocate memory to handle the sort. */
453 	 * fewer than 9 items.  Make sure the in-memory sort will always take  in xfarray_sortinfo_alloc()
462 	 * sort will always take care of the last few levels of recursion for  in xfarray_sortinfo_alloc()
472 	/* Scratchpad for in-memory sort, or finding the pivot */  in xfarray_sortinfo_alloc()
498 /* Should this sort be terminated by a fatal signal? */
517 /* Do we want an in-memory sort? */
538  * Sort a small number of array records using scratchpad memory.  The records
560 	sort(scratch, hi - lo + 1, si->array->obj_size, si->cmp_fn, NULL);  in xfarray_isort()
567  * Sort the records from lo to hi (inclusive) if they are all backed by the
597 	sort(startp, hi - lo + 1, si->array->obj_size, si->cmp_fn, NULL);  in xfarray_foliosort()
643  * Load evenly-spaced records within the given range into memory, sort them,
706 	sort(parray, XFARRAY_QSORT_PIVOT_NR, pivot_rec_sz, si->cmp_fn, NULL);  in xfarray_qsort_pivot()
867  * Sort the array elements via quicksort.  This implementation incorporates
871  *    to sort.  This helps us to avoid recursion in the call stack, which is
889  *    map the page directly and run heap sort directly on the xfile page
936 		/* Nothing left in this partition to sort; pop stack. */  in xfarray_sort()
954 		/* If insertion sort can solve our problems, we're done. */  in xfarray_sort()