es 62 opal/util/qsort.c #define SWAPINIT(a, es) swaptype = ((char *)a - (char *)0) % sizeof(long) || \ es 63 opal/util/qsort.c es % sizeof(long) ? 2 : es == sizeof(long)? 0 : 1; es 82 opal/util/qsort.c swapfunc(a, b, es, swaptype) es 98 opal/util/qsort.c opal_qsort(void *a, size_t n, size_t es, cmp_t *cmp) es 103 opal/util/qsort.c loop: SWAPINIT(a, es); es 106 opal/util/qsort.c for (pm = (char *)a + es; pm < (char *)a + n * es; pm += es) es 108 opal/util/qsort.c pl > (char *)a && CMP(thunk, pl - es, pl) > 0; es 109 opal/util/qsort.c pl -= es) es 110 opal/util/qsort.c swap(pl, pl - es); es 113 opal/util/qsort.c pm = (char *)a + (n / 2) * es; es 116 opal/util/qsort.c pn = (char *)a + (n - 1) * es; es 118 opal/util/qsort.c d = (n / 8) * es; es 126 opal/util/qsort.c pa = pb = (char *)a + es; es 128 opal/util/qsort.c pc = pd = (char *)a + (n - 1) * es; es 134 opal/util/qsort.c pa += es; es 136 opal/util/qsort.c pb += es; es 142 opal/util/qsort.c pd -= es; es 144 opal/util/qsort.c pc -= es; es 150 opal/util/qsort.c pb += es; es 151 opal/util/qsort.c pc -= es; es 154 opal/util/qsort.c for (pm = (char *)a + es; pm < (char *)a + n * es; pm += es) es 156 opal/util/qsort.c pl > (char *)a && CMP(thunk, pl - es, pl) > 0; es 157 opal/util/qsort.c pl -= es) es 158 opal/util/qsort.c swap(pl, pl - es); es 162 opal/util/qsort.c pn = (char *)a + n * es; es 165 opal/util/qsort.c r = (int) (min((char*) (pd - pc), (char*) (pn - pd - es))); es 167 opal/util/qsort.c if ((size_t) (r = pb - pa) > es) es 168 opal/util/qsort.c opal_qsort(a, r / es, es, cmp); es 169 opal/util/qsort.c if ((size_t) (r = pd - pc) > es) { es 172 opal/util/qsort.c n = r / es; es 30 opal/util/qsort.h void opal_qsort(void *a, size_t n, size_t es, int (*cmp)(const void *, const void*));