47   saint_t c0, c1;  in sort_typeBstar()  local
60   for(i = n - 1, m = n, c0 = T[n - 1]; 0 <= i;) {  in sort_typeBstar()
62     do { ++BUCKET_A(c1 = c0); } while((0 <= --i) && ((c0 = T[i]) >= c1));  in sort_typeBstar()
65       ++BUCKET_BSTAR(c0, c1);  in sort_typeBstar()
68       for(--i, c1 = c0; (0 <= i) && ((c0 = T[i]) <= c1); --i, c1 = c0) {  in sort_typeBstar()
69         ++BUCKET_B(c0, c1);  in sort_typeBstar()
81   for(c0 = 0, i = 0, j = 0; c0 < ALPHABET_SIZE; ++c0) {  in sort_typeBstar()
82     t = i + BUCKET_A(c0);  in sort_typeBstar()
83     BUCKET_A(c0) = i + j; /* start point */  in sort_typeBstar()
84     i = t + BUCKET_B(c0, c0);  in sort_typeBstar()
85     for(c1 = c0 + 1; c1 < ALPHABET_SIZE; ++c1) {  in sort_typeBstar()
86       j += BUCKET_BSTAR(c0, c1);  in sort_typeBstar()
87       BUCKET_BSTAR(c0, c1) = j; /* end point */  in sort_typeBstar()
88       i += BUCKET_B(c0, c1);  in sort_typeBstar()
96       t = PAb[i], c0 = T[t], c1 = T[t + 1];  in sort_typeBstar()
97       SA[--BUCKET_BSTAR(c0, c1)] = i;  in sort_typeBstar()
99     t = PAb[m - 1], c0 = T[t], c1 = T[t + 1];  in sort_typeBstar()
100     SA[--BUCKET_BSTAR(c0, c1)] = m - 1;  in sort_typeBstar()
106     c0 = ALPHABET_SIZE - 2, c1 = ALPHABET_SIZE - 1, j = m;  in sort_typeBstar()
116             d0 = c0, d1 = c1;  in sort_typeBstar()
124             c0 = d0, c1 = d1, j = k;  in sort_typeBstar()
134     for(c0 = ALPHABET_SIZE - 2, j = m; 0 < j; --c0) {  in sort_typeBstar()
135       for(c1 = ALPHABET_SIZE - 1; c0 < c1; j = i, --c1) {  in sort_typeBstar()
136         i = BUCKET_BSTAR(c0, c1);  in sort_typeBstar()
162     for(i = n - 1, j = m, c0 = T[n - 1]; 0 <= i;) {  in sort_typeBstar()
163       for(--i, c1 = c0; (0 <= i) && ((c0 = T[i]) >= c1); --i, c1 = c0) { }  in sort_typeBstar()
166         for(--i, c1 = c0; (0 <= i) && ((c0 = T[i]) <= c1); --i, c1 = c0) { }  in sort_typeBstar()
173     for(c0 = ALPHABET_SIZE - 2, k = m - 1; 0 <= c0; --c0) {  in sort_typeBstar()
174       i = BUCKET_A(c0 + 1) - 1;  in sort_typeBstar()
175       for(c1 = ALPHABET_SIZE - 1; c0 < c1; --c1) {  in sort_typeBstar()
176         t = i - BUCKET_B(c0, c1);  in sort_typeBstar()
177         BUCKET_B(c0, c1) = i; /* end point */  in sort_typeBstar()
180         for(i = t, j = BUCKET_BSTAR(c0, c1);  in sort_typeBstar()
184       BUCKET_BSTAR(c0, c0 + 1) = i - BUCKET_B(c0, c0) + 1; /* start point */  in sort_typeBstar()
185       BUCKET_B(c0, c0) = i; /* end point */  in sort_typeBstar()
200   saint_t c0, c1, c2;  in construct_SA()  local
216           c0 = T[--s];  in construct_SA()
217           if((0 < s) && (T[s - 1] > c0)) { s = ~s; }  in construct_SA()
218           if(c0 != c2) {  in construct_SA()
220             k = SA + BUCKET_B(c2 = c0, c1);  in construct_SA()
240       c0 = T[--s];  in construct_SA()
241       if((s == 0) || (T[s - 1] < c0)) { s = ~s; }  in construct_SA()
242       if(c0 != c2) {  in construct_SA()
244         k = SA + BUCKET_A(c2 = c0);  in construct_SA()
264   saint_t c0, c1, c2;  in construct_BWT()  local
279           c0 = T[--s];  in construct_BWT()
280           *j = ~((saidx_t)c0);  in construct_BWT()
281           if((0 < s) && (T[s - 1] > c0)) { s = ~s; }  in construct_BWT()
282           if(c0 != c2) {  in construct_BWT()
284             k = SA + BUCKET_B(c2 = c0, c1);  in construct_BWT()
307       c0 = T[--s];  in construct_BWT()
308       *i = c0;  in construct_BWT()
309       if((0 < s) && (T[s - 1] < c0)) { s = ~((saidx_t)T[s - 1]); }  in construct_BWT()
310       if(c0 != c2) {  in construct_BWT()
312         k = SA + BUCKET_A(c2 = c0);  in construct_BWT()