Lines Matching refs:size
91 mergesort(void *base, size_t nmemb, size_t size, in mergesort() argument
99 if (size < PSIZE / 2) { /* Pointers must fit into 2 * size. */ in mergesort()
112 if (!(size % ISIZE) && !(((char *)base - (char *)0) % ISIZE)) in mergesort()
115 if ((list2 = malloc(nmemb * size + PSIZE)) == NULL) in mergesort()
119 setup(list1, list2, nmemb, size, cmp); in mergesort()
120 last = list2 + nmemb * size; in mergesort()
143 while ((b += size) < t && cmp(q, b) >sense) in mergesort()
149 EXPONENTIAL: for (i = size; ; i <<= 1) in mergesort()
151 if ((p = t - size) > b && in mergesort()
159 if (i == size) in mergesort()
164 while (t > b+size) { in mergesort()
165 i = (((t - b) / size) >> 1) * size; in mergesort()
172 FASTCASE: while (i > size) in mergesort()
180 i = size; in mergesort()
215 last = list2 + nmemb*size; in mergesort()
218 memmove(list2, list1, nmemb*size); in mergesort()
227 i = size; \
231 a -= size; \
236 i = size; \
251 setup(u_char *list1, u_char *list2, size_t n, size_t size, in setup() argument
257 size2 = size*2; in setup()
259 insertionsort(list1, n, size, cmp); in setup()
260 *EVAL(list2) = (u_char*) list2 + n*size; in setup()
268 insertionsort(list1 + (n - i) * size, i, size, cmp); in setup()
269 last = list1 + size * (n - i); in setup()
270 *EVAL(list2 + (last - list1)) = list2 + n * size; in setup()
275 sense = (cmp(f1, f1 + size) > 0); in setup()
280 if ((cmp(f2, f2+ size) > 0) != sense) in setup()
288 swap (f1, f1 + size); in setup()
293 if ((cmp(f2-size, f2) > 0) != sense) { in setup()
296 reverse(f1, f2-size); in setup()
301 reverse (f1, f2-size); in setup()
303 if (f2 < last || cmp(f2 - size, f2) > 0) in setup()
306 p2 = *EVAL(p2) = list2 + n*size; in setup()
312 if (cmp (f1, f1 + size) > 0) in setup()
313 swap(f1, f1 + size); in setup()
323 insertionsort(u_char *a, size_t n, size_t size, in insertionsort() argument
329 for (ai = a+size; --n >= 1; ai += size) in insertionsort()
330 for (t = ai; t > a; t -= size) { in insertionsort()
331 u = t - size; in insertionsort()