static void sort_inp(int ninp, t_inpfile inp[]) { int i, mm; mm = -1; for (i = 0; (i < ninp); i++) { mm = max(mm, inp[i].count); } for (i = 0; (i < ninp); i++) { if (inp[i].count == 0) { inp[i].count = mm++; } } gmx_qsort(inp, ninp, (size_t)sizeof(inp[0]), inp_comp); }
void gmx_qsort(void * base, size_t nmemb, size_t size, int (*compar)(const void *, const void *)) { #define QSORT_EXCH(a, b, t) (t = a, a = b, b = t) #define QSORT_SWAP(a, b) swaptype != 0 ? qsort_swapfunc(a, b, size, swaptype) : \ (void)QSORT_EXCH(*(int *)(a), *(int *)(b), t) char *pa, *pb, *pc, *pd, *pl, *pm, *pn, *pv, *cbase; int r, swaptype; int t, v; size_t s, st; cbase = (char *)base; swaptype = (size_t)(cbase - (char *)0) % sizeof(int) || size % sizeof(int) ? 2 : size == sizeof(int) ? 0 : 1; if (nmemb < 7) { /* Insertion sort on smallest arrays */ for (pm = cbase + size; pm < cbase + nmemb*size; pm += size) { for (pl = pm; (pl > cbase) && compar((void *)(pl-size), (void *) pl) > 0; pl -= size) { QSORT_SWAP(pl, pl-size); } } return; } /* Small arrays, middle element */ pm = cbase + (nmemb/2)*size; if (nmemb > 7) { pl = cbase; pn = cbase + (nmemb-1)*size; if (nmemb > 40) { /* Big arrays, pseudomedian of 9 */ s = (nmemb/8)*size; pl = (char *)qsort_med3((void *)pl, (void *)((size_t)pl+s), (void *)((size_t)pl+2*s), compar); pm = (char *)qsort_med3((void *)((size_t)pm-s), (void *)pm, (void *)((size_t)pm+s), compar); pn = (char *)qsort_med3((void *)((size_t)pn-2*s), (void *)((size_t)pn-s), (void *)pn, compar); } /* Mid-size, med of 3 */ pm = (char *)qsort_med3((void *)pl, (void *)pm, (void *)pn, compar); } /* pv points to partition value */ if (swaptype != 0) { pv = cbase; QSORT_SWAP(pv, pm); } else { pv = (char*)(void*)&v; v = *(int *)pm; } pa = pb = cbase; pc = pd = cbase + (nmemb-1)*size; for (;; ) { while (pb <= pc && (r = compar((void *)pb, (void *) pv)) <= 0) { if (r == 0) { QSORT_SWAP(pa, pb); pa += size; } pb += size; } while (pc >= pb && (r = compar((void *)pc, (void *) pv)) >= 0) { if (r == 0) { QSORT_SWAP(pc, pd); pd -= size; } pc -= size; } if (pb > pc) { break; } QSORT_SWAP(pb, pc); pb += size; pc -= size; } pn = cbase + nmemb*size; s = pa-cbase; st = pb-pa; if (st < s) { s = st; } if (s > 0) { qsort_swapfunc(cbase, pb-s, s, swaptype); } s = pd-pc; st = pn-pd-size; if (st < s) { s = st; } if (s > 0) { qsort_swapfunc(pb, pn-s, s, swaptype); } if ((s = pb-pa) > size) { gmx_qsort(cbase, s/size, size, compar); } if ((s = pd-pc) > size) { gmx_qsort(pn-s, s/size, size, compar); } #undef QSORT_EXCH #undef QSORT_SWAP return; }