--- Libc/Libc-1725.40.4/stdlib/FreeBSD/heapsort_b.c
+++ Libc/Libc-825.26/stdlib/FreeBSD/heapsort_b.c
@@ -136,8 +136,10 @@
  * only advantage over quicksort is that it requires little additional memory.
  */
 int
-heapsort_b(void *vbase, size_t nmemb, size_t size,
-    int (^compar)(const void *, const void *))
+heapsort_b(vbase, nmemb, size, compar)
+	void *vbase;
+	size_t nmemb, size;
+	int (^compar)(const void *, const void *);
 {
 	size_t cnt, i, j, l;
 	char tmp, *tmp1, *tmp2;