libc/stdlib/radixsort.c

74 		for (c = 0; c < endch; c++)				\
79 		endch = 0;						\
81 		endch = tab[endch];					\
83 		if (endch != 0 && endch != 255) {			\
91 radixsort(const u_char **a, int n, const u_char *tab, u_int endch)
98 	r_sort_a(a, n, 0, tr, endch);
103 sradixsort(const u_char **a, int n, const u_char *tab, u_int endch)
111 		simplesort(a, n, 0, tr, endch);
115 		r_sort_b(a, ta, n, 0, tr, endch);
128 r_sort_a(const u_char **a, int n, int i, const u_char *tr, u_int endch)
143 			simplesort(a, n, i, tr, endch);
153 				if (++count[c] == 1 && c != endch) {
160 				r_sort_a(a, n, i, tr, endch);
185 		if (endch == 0)		/* Special case: set top[eos]. */
227     u_int endch)
241 			simplesort(a, n, i, tr, endch);
249 				if (++count[c] == 1 && c != endch) {
256 				r_sort_b(a, ta, n, i, tr, endch);
263 		if (endch == 0) {
296 simplesort(const u_char **a, int n, int b, const u_char *tr, u_int endch)
304 			    (ch = tr[*s]) != endch; s++, t++)