51 	int i = (num/2 - 1) * size, n = num * size, c, r;  in sort()  local
58 		for (r = i; r * 2 + size < n; r  = c) {  in sort()
59 			c = r * 2 + size;  in sort()
60 			if (c < n - size &&  in sort()
61 					cmp_func(base + c, base + c + size) < 0)  in sort()
62 				c += size;  in sort()
63 			if (cmp_func(base + r, base + c) >= 0)  in sort()
65 			swap_func(base + r, base + c, size);  in sort()
72 		for (r = 0; r * 2 + size < i; r = c) {  in sort()
73 			c = r * 2 + size;  in sort()
74 			if (c < i - size &&  in sort()
75 					cmp_func(base + c, base + c + size) < 0)  in sort()
76 				c += size;  in sort()
77 			if (cmp_func(base + r, base + c) >= 0)  in sort()
79 			swap_func(base + r, base + c, size);  in sort()