Lines Matching refs:tr
75 tr = tr0; \
84 tr = tab; \
95 const u_char *tr; in radixsort() local
100 r_sort_a(a, n, 0, tr, endch); in radixsort()
107 const u_char *tr, **ta; in sradixsort() local
113 simplesort(a, n, 0, tr, endch); in sradixsort()
117 r_sort_b(a, ta, n, 0, tr, endch); in sradixsort()
130 r_sort_a(const u_char **a, int n, int i, const u_char *tr, u_int endch) in r_sort_a() argument
145 simplesort(a, n, i, tr, endch); in r_sort_a()
154 c = tr[(*ak++)[i]]; in r_sort_a()
162 r_sort_a(a, n, i, tr, endch); in r_sort_a()
221 for (r = *aj; aj < (ak = --top[c = tr[r[i]]]);) in r_sort_a()
228 r_sort_b(const u_char **a, const u_char **ta, int n, int i, const u_char *tr, in r_sort_b() argument
243 simplesort(a, n, i, tr, endch); in r_sort_b()
250 c = tr[(*ak)[i]]; in r_sort_b()
258 r_sort_b(a, ta, n, i, tr, endch); in r_sort_b()
292 *--top[tr[(*ak)[i]]] = *ak; in r_sort_b()
298 simplesort(const u_char **a, int n, int b, const u_char *tr, u_int endch) in simplesort() argument
306 (ch = tr[*s]) != endch; s++, t++) in simplesort()
307 if (ch != tr[*t]) in simplesort()
309 if (ch >= tr[*t]) in simplesort()