list2              69 main/mergesort.c static void setup(u_char *list1, u_char *list2, size_t n, size_t size, int (*cmp)(const void *, const void *));
list2             111 main/mergesort.c 	u_char *list2, *list1, *p2, *p, *last, **p1;
list2             129 main/mergesort.c 	if ((list2 = malloc(nmemb * size + PSIZE)) == NULL)
list2             133 main/mergesort.c 	setup(list1, list2, nmemb, size, cmp);
list2             134 main/mergesort.c 	last = list2 + nmemb * size;
list2             136 main/mergesort.c 	while (*EVAL(list2) != last) {
list2             139 main/mergesort.c 	    for (tp2 = p2 = list2; p2 != last; p1 = EVAL(l2)) {
list2             142 main/mergesort.c 	    	f2 = l1 = list1 + (p2 - list2);
list2             145 main/mergesort.c 	    	l2 = list1 + (p2 - list2);
list2             227 main/mergesort.c 	    list1 = list2;
list2             228 main/mergesort.c 	    list2 = tp2;
list2             229 main/mergesort.c 	    last = list2 + nmemb*size;
list2             231 main/mergesort.c 	if (base == list2) {
list2             232 main/mergesort.c 		memmove(list2, list1, nmemb*size);
list2             233 main/mergesort.c 		list2 = list1;
list2             235 main/mergesort.c 	free(list2);
list2             265 main/mergesort.c static void setup(u_char *list1, u_char *list2, size_t n, size_t size, int (*cmp)(const void *, const void *))
list2             273 main/mergesort.c 		*EVAL(list2) = (u_char*) list2 + n*size;
list2             283 main/mergesort.c 	*EVAL(list2 + (last - list1)) = list2 + n * size;
list2             286 main/mergesort.c 	p2 = list2;
list2             299 main/mergesort.c 				p2 = *EVAL(p2) = f1 + size2 - list1 + list2;
list2             307 main/mergesort.c 					p2 = *EVAL(p2) = f2 - list1 + list2;
list2             317 main/mergesort.c 				p2 = *EVAL(p2) = f2 - list1 + list2;
list2             319 main/mergesort.c 				p2 = *EVAL(p2) = list2 + n*size;
list2             323 main/mergesort.c 	for (f1 = list1, p2 = list2; f1 < last; f1 += size2) {