libdivsufsort/lib/divsufsort.c

47   saint_t c0, c1;
62     do { ++BUCKET_A(c1 = c0); } while((0 <= --i) && ((c0 = T[i]) >= c1));
65       ++BUCKET_BSTAR(c0, c1);
68       for(--i, c1 = c0; (0 <= i) && ((c0 = T[i]) <= c1); --i, c1 = c0) {
69         ++BUCKET_B(c0, c1);
85     for(c1 = c0 + 1; c1 < ALPHABET_SIZE; ++c1) {
86       j += BUCKET_BSTAR(c0, c1);
87       BUCKET_BSTAR(c0, c1) = j; /* end point */
88       i += BUCKET_B(c0, c1);
96       t = PAb[i], c0 = T[t], c1 = T[t + 1];
97       SA[--BUCKET_BSTAR(c0, c1)] = i;
99     t = PAb[m - 1], c0 = T[t], c1 = T[t + 1];
100     SA[--BUCKET_BSTAR(c0, c1)] = m - 1;
106     c0 = ALPHABET_SIZE - 2, c1 = ALPHABET_SIZE - 1, j = m;
116             d0 = c0, d1 = c1;
124             c0 = d0, c1 = d1, j = k;
135       for(c1 = ALPHABET_SIZE - 1; c0 < c1; j = i, --c1) {
136         i = BUCKET_BSTAR(c0, c1);
163       for(--i, c1 = c0; (0 <= i) && ((c0 = T[i]) >= c1); --i, c1 = c0) { }
166         for(--i, c1 = c0; (0 <= i) && ((c0 = T[i]) <= c1); --i, c1 = c0) { }
175       for(c1 = ALPHABET_SIZE - 1; c0 < c1; --c1) {
176         t = i - BUCKET_B(c0, c1);
177         BUCKET_B(c0, c1) = i; /* end point */
180         for(i = t, j = BUCKET_BSTAR(c0, c1);
200   saint_t c0, c1, c2;
205     for(c1 = ALPHABET_SIZE - 2; 0 <= c1; --c1) {
207       for(i = SA + BUCKET_BSTAR(c1, c1 + 1),
208           j = SA + BUCKET_A(c1 + 1) - 1, k = NULL, c2 = -1;
212           assert(T[s] == c1);
219             if(0 <= c2) { BUCKET_B(c2, c1) = k - SA; }
220             k = SA + BUCKET_B(c2 = c0, c1);
225           assert(((s == 0) && (T[s] == c1)) || (s < 0));
264   saint_t c0, c1, c2;
269     for(c1 = ALPHABET_SIZE - 2; 0 <= c1; --c1) {
271       for(i = SA + BUCKET_BSTAR(c1, c1 + 1),
272           j = SA + BUCKET_A(c1 + 1) - 1, k = NULL, c2 = -1;
276           assert(T[s] == c1);
283             if(0 <= c2) { BUCKET_B(c2, c1) = k - SA; }
284             k = SA + BUCKET_B(c2 = c0, c1);
292           assert(T[s] == c1);