--- Libc/Libc-1725.40.4/stdlib/FreeBSD/radixsort.c
+++ Libc/Libc-825.26/stdlib/FreeBSD/radixsort.c
@@ -95,7 +95,10 @@
 }
 
 int
-radixsort(const u_char **a, int n, const u_char *tab, u_int endch)
+radixsort(a, n, tab, endch)
+	const u_char **a, *tab;
+	int n;
+	u_int endch;
 {
 	const u_char *tr;
 	int c;
@@ -107,7 +110,10 @@
 }
 
 int
-sradixsort(const u_char **a, int n, const u_char *tab, u_int endch)
+sradixsort(a, n, tab, endch)
+	const u_char **a, *tab;
+	int n;
+	u_int endch;
 {
 	const u_char *tr, **ta;
 	int c;
@@ -138,7 +144,11 @@
 
 /* Unstable, in-place sort. */
 static void
-r_sort_a(const u_char **a, int n, int i, const u_char *tr, u_int endch)
+r_sort_a(a, n, i, tr, endch)
+	const u_char **a;
+	int n, i;
+	const u_char *tr;
+	u_int endch;
 {
 	static int *count, nc, bmin;
 	int c;
@@ -242,8 +252,11 @@
 
 /* Stable sort, requiring additional memory. */
 static void
-r_sort_b(const u_char **a, const u_char **ta, int n, int i, const u_char *tr,
-    u_int endch)
+r_sort_b(a, ta, n, i, tr, endch)
+	const u_char **a, **ta;
+	int n, i;
+	const u_char *tr;
+	u_int endch;
 {
 	static int *count, nc, bmin;
 	int c;
@@ -316,9 +329,12 @@
 	}
 }
 
-/* insertion sort */
 static inline void
-simplesort(const u_char **a, int n, int b, const u_char *tr, u_int endch)
+simplesort(a, n, b, tr, endch)	/* insertion sort */
+	const u_char **a;
+	int n, b;
+	const u_char *tr;
+	u_int endch;
 {
 	u_char ch;
 	const u_char  **ak, **ai, *s, *t;