7 #define SWAP(a, b, t) \  macro
30       if (v[vdx[0]] > v[vdx[1]]) SWAP(vdx[0], vdx[1], tmp);  in PetscSortIntWithPermutation_Private()
34   SWAP(vdx[0], vdx[right / 2], tmp);  in PetscSortIntWithPermutation_Private()
40       SWAP(vdx[last], vdx[i], tmp);  in PetscSortIntWithPermutation_Private()
43   SWAP(vdx[0], vdx[last], tmp);  in PetscSortIntWithPermutation_Private()
82           SWAP(idx[k], idx[j], tmp);  in PetscSortIntWithPermutation()
101       if (v[vdx[0]] > v[vdx[1]]) SWAP(vdx[0], vdx[1], tmp);  in PetscSortRealWithPermutation_Private()
105   SWAP(vdx[0], vdx[right / 2], tmp);  in PetscSortRealWithPermutation_Private()
111       SWAP(vdx[last], vdx[i], tmp);  in PetscSortRealWithPermutation_Private()
114   SWAP(vdx[0], vdx[last], tmp);  in PetscSortRealWithPermutation_Private()
154           SWAP(idx[k], idx[j], tmp);  in PetscSortRealWithPermutation()
175       if (gt) SWAP(vdx[0], vdx[1], tmp);  in PetscSortStrWithPermutation_Private()
179   SWAP(vdx[0], vdx[right / 2], tmp);  in PetscSortStrWithPermutation_Private()
186       SWAP(vdx[last], vdx[i], tmp);  in PetscSortStrWithPermutation_Private()
189   SWAP(vdx[0], vdx[last], tmp);  in PetscSortStrWithPermutation_Private()
231           SWAP(idx[k], idx[j], tmp);  in PetscSortStrWithPermutation()