Lines Matching refs:endch
85 for (c = 0; c < endch; c++) \
90 endch = 0; \
92 endch = tab[endch]; \
94 if (endch != 0 && endch != 255) { \
102 radixsort(const u_char **a, int n, const u_char *tab, u_int endch) in radixsort() argument
111 r_sort_a(a, n, 0, tr, endch); in radixsort()
116 sradixsort(const u_char **a, int n, const u_char *tab, u_int endch) in sradixsort() argument
130 simplesort(a, n, 0, tr, endch); in sradixsort()
136 r_sort_b(a, ta, n, 0, tr, endch); in sradixsort()
149 r_sort_a(const u_char **a, int n, int i, const u_char *tr, u_int endch) in r_sort_a() argument
167 simplesort(a, n, i, tr, endch); in r_sort_a()
177 if (++count[c] == 1 && c != endch) { in r_sort_a()
184 r_sort_a(a, n, i, tr, endch); in r_sort_a()
198 if (endch == 0) /* Special case: set top[eos]. */ in r_sort_a()
240 u_int endch) in r_sort_b() argument
258 simplesort(a, n, i, tr, endch); in r_sort_b()
266 if (++count[c] == 1 && c != endch) { in r_sort_b()
273 r_sort_b(a, ta, n, i, tr, endch); in r_sort_b()
280 if (endch == 0) { in r_sort_b()
313 simplesort(const u_char **a, int n, int b, const u_char *tr, u_int endch) in simplesort() argument
324 (ch = tr[*s]) != endch; s++, t++) in simplesort()