Lines Matching defs:base
56 qsort(char *base, int n, int size, int (*compar)())
67 max = base + n * qsz;
69 qst(base, max);
70 hi = base + thresh;
80 for (j = lo = base; (lo += qsz) < hi; )
83 if (j != base) {
85 for (i = base, hi = base + qsz; i < hi; ) {
98 for (min = base; (hi = min += qsz) < max; ) {
128 qst(char *base, char *max)
137 * current partition. (Which should be max - base).
144 lo = max - base; /* number of elements as chars */
146 mid = i = base + qsz * ((lo / qsz) >> 1);
148 j = (qcmp((jj = base), i) > 0 ? jj : i);
167 for (i = base, j = max - qsz; ; ) {
206 * making sure lo is its size, base and max are update
212 if ((lo = j - base) <= (hi = max - i)) {
214 qst(base, j);
215 base = i;