Lines Matching defs:endch
70 for (c = 0; c < endch; c++) \
75 endch = 0; \
77 endch = tab[endch]; \
79 if (endch != 0 && endch != 255) { \
87 radixsort(const u_char **a, int n, const u_char *tab, u_int endch)
94 r_sort_a(a, n, 0, tr, endch);
99 sradixsort(const u_char **a, int n, const u_char *tab, u_int endch)
107 simplesort(a, n, 0, tr, endch);
111 r_sort_b(a, ta, n, 0, tr, endch);
124 r_sort_a(const u_char **a, int n, int i, const u_char *tr, u_int endch)
139 simplesort(a, n, i, tr, endch);
149 if (++count[c] == 1 && c != endch) {
156 r_sort_a(a, n, i, tr, endch);
181 if (endch == 0) /* Special case: set top[eos]. */
223 u_int endch)
237 simplesort(a, n, i, tr, endch);
245 if (++count[c] == 1 && c != endch) {
252 r_sort_b(a, ta, n, i, tr, endch);
259 if (endch == 0) {
292 simplesort(const u_char **a, int n, int b, const u_char *tr, u_int endch)
300 (ch = tr[*s]) != endch; s++, t++)