35   6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
36   6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
100   saidx_t v;  in tr_fixdown()  local
103   for(v = SA[i], c = ISAd[v]; (j = 2 * i + 1) < size; SA[i] = SA[k], i = k) {  in tr_fixdown()
108   SA[i] = v;  in tr_fixdown()
224              saidx_t **pa, saidx_t **pb, saidx_t v) {  in tr_partition()  argument
229   for(b = middle - 1; (++b < last) && ((x = ISAd[*b]) == v);) { }  in tr_partition()
230   if(((a = b) < last) && (x < v)) {  in tr_partition()
231     for(; (++b < last) && ((x = ISAd[*b]) <= v);) {  in tr_partition()
232       if(x == v) { SWAP(*b, *a); ++a; }  in tr_partition()
235   for(c = last; (b < --c) && ((x = ISAd[*c]) == v);) { }  in tr_partition()
236   if((b < (d = c)) && (x > v)) {  in tr_partition()
237     for(; (b < --c) && ((x = ISAd[*c]) >= v);) {  in tr_partition()
238       if(x == v) { SWAP(*c, *d); --d; }  in tr_partition()
243     for(; (++b < c) && ((x = ISAd[*b]) <= v);) {  in tr_partition()
244       if(x == v) { SWAP(*b, *a); ++a; }  in tr_partition()
246     for(; (b < --c) && ((x = ISAd[*c]) >= v);) {  in tr_partition()
247       if(x == v) { SWAP(*c, *d); --d; }  in tr_partition()
270   saidx_t s, v;  in tr_copy()  local
272   v = b - SA - 1;  in tr_copy()
274     if((0 <= (s = *c - depth)) && (ISA[s] == v)) {  in tr_copy()
280     if((0 <= (s = *c - depth)) && (ISA[s] == v)) {  in tr_copy()
293   saidx_t s, v;  in tr_partialcopy()  local
296   v = b - SA - 1;  in tr_partialcopy()
299     if((0 <= (s = *c - depth)) && (ISA[s] == v)) {  in tr_partialcopy()
316     if((0 <= (s = *c - depth)) && (ISA[s] == v)) {  in tr_partialcopy()
334   saidx_t v, x = 0;  in tr_introsort()  local
348           for(c = first, v = a - SA - 1; c < a; ++c) { ISA[*c] = v; }  in tr_introsort()
351           for(c = a, v = b - SA - 1; c < b; ++c) { ISA[*c] = v; }  in tr_introsort()
399           if(++a < last) { for(b = first, v = a - SA - 1; b < a; ++b) { ISA[*b] = v; } }  in tr_introsort()
447     v = ISAd[*first];  in tr_introsort()
450     tr_partition(ISAd, first, first + 1, last, &a, &b, v);  in tr_introsort()
452       next = (ISA[*a] != v) ? tr_ilg(b - a) : -1;  in tr_introsort()
455       for(c = first, v = a - SA - 1; c < a; ++c) { ISA[*c] = v; }  in tr_introsort()
456       if(b < last) { for(c = a, v = b - SA - 1; c < b; ++c) { ISA[*c] = v; } }  in tr_introsort()