list1              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 *));
list1             111 main/mergesort.c 	u_char *list2, *list1, *p2, *p, *last, **p1;
list1             132 main/mergesort.c 	list1 = base;
list1             133 main/mergesort.c 	setup(list1, list2, nmemb, size, cmp);
list1             137 main/mergesort.c 	    l2 = list1;
list1             138 main/mergesort.c 	    p1 = EVAL(list1);
list1             142 main/mergesort.c 	    	f2 = l1 = list1 + (p2 - list2);
list1             145 main/mergesort.c 	    	l2 = list1 + (p2 - list2);
list1             226 main/mergesort.c 	    tp2 = list1;	/* swap list1, list2 */
list1             227 main/mergesort.c 	    list1 = list2;
list1             232 main/mergesort.c 		memmove(list2, list1, nmemb*size);
list1             233 main/mergesort.c 		list2 = list1;
list1             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 *))
list1             272 main/mergesort.c 		insertionsort(list1, n, size, cmp);
list1             281 main/mergesort.c 	insertionsort(list1 + (n - i) * size, i, size, cmp);
list1             282 main/mergesort.c 	last = list1 + size * (n - i);
list1             283 main/mergesort.c 	*EVAL(list2 + (last - list1)) = list2 + n * size;
list1             287 main/mergesort.c 	f1 = list1;
list1             299 main/mergesort.c 				p2 = *EVAL(p2) = f1 + size2 - list1 + list2;
list1             307 main/mergesort.c 					p2 = *EVAL(p2) = f2 - list1 + list2;
list1             317 main/mergesort.c 				p2 = *EVAL(p2) = f2 - list1 + list2;
list1             323 main/mergesort.c 	for (f1 = list1, p2 = list2; f1 < last; f1 += size2) {