Lines Matching refs:endch
73 for (c = 0; c < endch; c++) \
78 endch = 0; \
80 endch = tab[endch]; \
82 if (endch != 0 && endch != 255) { \
90 radixsort(const u_char **a, int n, const u_char *tab, u_int endch) in radixsort() argument
97 r_sort_a(a, n, 0, tr, endch); in radixsort()
102 sradixsort(const u_char **a, int n, const u_char *tab, u_int endch) in sradixsort() argument
110 simplesort(a, n, 0, tr, endch); in sradixsort()
114 r_sort_b(a, ta, n, 0, tr, endch); in sradixsort()
127 r_sort_a(const u_char **a, int n, int i, const u_char *tr, u_int endch) in r_sort_a() argument
142 simplesort(a, n, i, tr, endch); in r_sort_a()
152 if (++count[c] == 1 && c != endch) { in r_sort_a()
159 r_sort_a(a, n, i, tr, endch); in r_sort_a()
184 if (endch == 0) /* Special case: set top[eos]. */ in r_sort_a()
226 u_int endch) in r_sort_b() argument
240 simplesort(a, n, i, tr, endch); in r_sort_b()
248 if (++count[c] == 1 && c != endch) { in r_sort_b()
255 r_sort_b(a, ta, n, i, tr, endch); in r_sort_b()
262 if (endch == 0) { in r_sort_b()
295 simplesort(const u_char **a, int n, int b, const u_char *tr, u_int endch) in simplesort() argument
303 (ch = tr[*s]) != endch; s++, t++) in simplesort()