4 static inline int Compare_PetscMPIInt_Private(const void *left, const void *right, PETSC_UNUSED Pet…  in Compare_PetscMPIInt_Private()  argument
6   PetscMPIInt l = *(PetscMPIInt *)left, r = *(PetscMPIInt *)right;  in Compare_PetscMPIInt_Private()
10 static inline int Compare_PetscInt_Private(const void *left, const void *right, PETSC_UNUSED PetscC…  in Compare_PetscInt_Private()  argument
12   PetscInt l = *(PetscInt *)left, r = *(PetscInt *)right;  in Compare_PetscInt_Private()
16 static inline int Compare_PetscReal_Private(const void *left, const void *right, PETSC_UNUSED Petsc…  in Compare_PetscReal_Private()  argument
18   PetscReal l = *(PetscReal *)left, r = *(PetscReal *)right;  in Compare_PetscReal_Private()
209 …, char *tarr, size_t size, CompFunc cmp, PetscCtx ctx, PetscInt left, PetscInt mid, PetscInt right)  in PetscTimSortMergeLo_Private()  argument
216   while ((i < llen) && (j <= right)) {  in PetscTimSortMergeLo_Private()
232 …   PetscCall(PetscGallopSearchLeft_Private(arr, size, cmp, ctx, j, right, tarr + (i * size), &l2));  in PetscTimSortMergeLo_Private()
237           if (i >= llen || j > right) break;  in PetscTimSortMergeLo_Private()
245       if (++j <= right && ++gallopright >= MIN_GALLOP_GLOBAL) {  in PetscTimSortMergeLo_Private()
250 …   PetscCall(PetscGallopSearchLeft_Private(arr, size, cmp, ctx, j, right, tarr + (i * size), &l2));  in PetscTimSortMergeLo_Private()
261           if (i >= llen || j > right) break;  in PetscTimSortMergeLo_Private()
271 …char *btarr, size_t bsize, CompFunc cmp, PetscCtx ctx, PetscInt left, PetscInt mid, PetscInt right)  in PetscTimSortMergeLoWithArray_Private()  argument
278   while ((i < llen) && (j <= right)) {  in PetscTimSortMergeLoWithArray_Private()
294 …PetscCall(PetscGallopSearchLeft_Private(arr, asize, cmp, ctx, j, right, atarr + (i * asize), &l2));  in PetscTimSortMergeLoWithArray_Private()
299           if (i >= llen || j > right) break;  in PetscTimSortMergeLoWithArray_Private()
307       if (++j <= right && ++gallopright >= MIN_GALLOP_GLOBAL) {  in PetscTimSortMergeLoWithArray_Private()
312 …PetscCall(PetscGallopSearchLeft_Private(arr, asize, cmp, ctx, j, right, atarr + (i * asize), &l2));  in PetscTimSortMergeLoWithArray_Private()
323           if (i >= llen || j > right) break;  in PetscTimSortMergeLoWithArray_Private()
336 …, char *tarr, size_t size, CompFunc cmp, PetscCtx ctx, PetscInt left, PetscInt mid, PetscInt right)  in PetscTimSortMergeHi_Private()  argument
338   PetscInt       i = right - mid, j = mid - 1, k = right, gallopleft = 0, gallopright = 0;  in PetscTimSortMergeHi_Private()
339   const PetscInt rlen = right - mid + 1;  in PetscTimSortMergeHi_Private()
398 …char *btarr, size_t bsize, CompFunc cmp, PetscCtx ctx, PetscInt left, PetscInt mid, PetscInt right)  in PetscTimSortMergeHiWithArray_Private()  argument
400   PetscInt       i = right - mid, j = mid - 1, k = right, gallopleft = 0, gallopright = 0;  in PetscTimSortMergeHiWithArray_Private()
401   const PetscInt rlen = right - mid + 1;  in PetscTimSortMergeHiWithArray_Private()
462 …char *tarr, size_t size, CompFunc cmp, PetscCtx ctx, PetscInt left, PetscInt start, PetscInt right)  in PetscInsertionSort_Private()  argument
467   for (; i <= right; ++i) {  in PetscInsertionSort_Private()
479 …ar *btarr, size_t bsize, CompFunc cmp, PetscCtx ctx, PetscInt left, PetscInt start, PetscInt right)  in PetscInsertionSortWithArray_Private()  argument
484   for (; i <= right; ++i) {  in PetscInsertionSortWithArray_Private()
497 …char *tarr, size_t size, CompFunc cmp, PetscCtx ctx, PetscInt left, PetscInt start, PetscInt right)  in PetscBinaryInsertionSort_Private()  argument
502   for (; i <= right; ++i) {  in PetscBinaryInsertionSort_Private()
519 …ar *btarr, size_t bsize, CompFunc cmp, PetscCtx ctx, PetscInt left, PetscInt start, PetscInt right)  in PetscBinaryInsertionSortWithArray_Private()  argument
524   for (; i <= right; ++i) {  in PetscBinaryInsertionSortWithArray_Private()