Lines Matching refs:tr
67 tr = tr0; \
76 tr = tab; \
87 const u_char *tr; in radixsort() local
92 r_sort_a(a, n, 0, tr, endch); in radixsort()
99 const u_char *tr, **ta; in sradixsort() local
105 simplesort(a, n, 0, tr, endch); in sradixsort()
109 r_sort_b(a, ta, n, 0, tr, endch); in sradixsort()
122 r_sort_a(const u_char **a, int n, int i, const u_char *tr, u_int endch) in r_sort_a() argument
137 simplesort(a, n, i, tr, endch); in r_sort_a()
146 c = tr[(*ak++)[i]]; in r_sort_a()
154 r_sort_a(a, n, i, tr, endch); in r_sort_a()
202 for (r = *aj; aj < (ak = --top[c = tr[r[i]]]);) in r_sort_a()
209 r_sort_b(const u_char **a, const u_char **ta, int n, int i, const u_char *tr, in r_sort_b() argument
224 simplesort(a, n, i, tr, endch); in r_sort_b()
231 c = tr[(*ak)[i]]; in r_sort_b()
239 r_sort_b(a, ta, n, i, tr, endch); in r_sort_b()
273 *--top[tr[(*ak)[i]]] = *ak; in r_sort_b()
278 simplesort(const u_char **a, int n, int b, const u_char *tr, u_int endch) in simplesort() argument
287 (ch = tr[*s]) != endch; s++, t++) in simplesort()
288 if (ch != tr[*t]) in simplesort()
290 if (ch >= tr[*t]) in simplesort()