82 #define CREATE(initval, nmemb, par_i, child_i, par, child, size, count, tmp) { \  argument
83 	for (par_i = initval; (child_i = par_i * 2) <= nmemb; \
86 		if (child_i < nmemb && COMPAR(child, child + size) < 0) { \
114 #define SELECT(par_i, child_i, nmemb, par, child, size, k, count, tmp1, tmp2) { \  argument
115 	for (par_i = 1; (child_i = par_i * 2) <= nmemb; par_i = child_i) { \
117 		if (child_i < nmemb && COMPAR(child, child + size) < 0) { \
152 heapsort_b(void *vbase, size_t nmemb, size_t size, heapsort_block compar)  in heapsort_b()  argument
155 heapsort(void *vbase, size_t nmemb, size_t size,  in heapsort_b()
163 	if (nmemb <= 1)  in heapsort_b()
180 	for (l = nmemb / 2 + 1; --l;)  in heapsort_b()
181 		CREATE(l, nmemb, i, j, t, p, size, cnt, tmp);  in heapsort_b()
188 	while (nmemb > 1) {  in heapsort_b()
189 		COPY(k, base + nmemb * size, cnt, size, tmp1, tmp2);  in heapsort_b()
190 		COPY(base + nmemb * size, base + size, cnt, size, tmp1, tmp2);  in heapsort_b()
191 		--nmemb;  in heapsort_b()
192 		SELECT(i, j, nmemb, t, p, size, k, cnt, tmp1, tmp2);  in heapsort_b()