libdivsufsort/lib/sssort.c

143            saidx_t depth) {
146   for(U1 = T + depth + *p1,
147       U2 = T + depth + *p2,
168                  saidx_t *first, saidx_t *last, saidx_t depth) {
174     for(t = *i, j = i + 1; 0 < (r = ss_compare(T, PA + t, PA + *j, depth));) {
292                     saidx_t *first, saidx_t *last, saidx_t depth) {
296     for(; (++a < b) && ((PA[*a] + depth) >= (PA[*a + 1] + 1));) { *a = ~*a; }
297     for(; (a < --b) && ((PA[*b] + depth) <  (PA[*b + 1] + 1));) { }
312               saidx_t depth) {
326       if(1 < (last - first)) { ss_insertionsort(T, PA, first, last, depth); }
328       STACK_POP(first, last, depth, limit);
332     Td = T + depth;
343         first = ss_partition(PA, first, a, depth);
347           STACK_PUSH(a, last, depth, -1);
348           last = a, depth += 1, limit = ss_ilg(a - first);
354           STACK_PUSH(first, a, depth + 1, ss_ilg(a - first));
357           last = a, depth += 1, limit = ss_ilg(a - first);
400       b = (v <= Td[PA[*a] - 1]) ? a : ss_partition(PA, a, c, depth);
404           STACK_PUSH(b, c, depth + 1, ss_ilg(c - b));
405           STACK_PUSH(c, last, depth, limit);
408           STACK_PUSH(c, last, depth, limit);
409           STACK_PUSH(b, c, depth + 1, ss_ilg(c - b));
412           STACK_PUSH(c, last, depth, limit);
413           STACK_PUSH(first, a, depth, limit);
414           first = b, last = c, depth += 1, limit = ss_ilg(c - b);
418           STACK_PUSH(b, c, depth + 1, ss_ilg(c - b));
419           STACK_PUSH(first, a, depth, limit);
422           STACK_PUSH(first, a, depth, limit);
423           STACK_PUSH(b, c, depth + 1, ss_ilg(c - b));
426           STACK_PUSH(first, a, depth, limit);
427           STACK_PUSH(c, last, depth, limit);
428           first = b, last = c, depth += 1, limit = ss_ilg(c - b);
434         first = ss_partition(PA, first, last, depth);
437       depth += 1;
504                 saidx_t depth) {
518       q = ss_compare(T, PA + ((0 <= *b) ? *b : ~*b), p, depth);
547                 saidx_t *buf, saidx_t depth) {
556     r = ss_compare(T, PA + *b, PA + *c, depth);
597                  saidx_t *buf, saidx_t depth) {
613     r = ss_compare(T, p1, p2, depth);
656              saidx_t *buf, saidx_t bufsize, saidx_t depth) {
662        (((c) & 2) && (ss_compare(T, PA + GETIDX(*((a) - 1)), PA + *(a), depth) == 0))) {\
665     if(((c) & 4) && ((ss_compare(T, PA + GETIDX(*((b) - 1)), PA + *(b), depth) == 0))) {\
678         ss_mergebackward(T, PA, first, middle, last, buf, depth);
687         ss_mergeforward(T, PA, first, middle, last, buf, depth);
698                        PA + GETIDX(*(middle - m - half - 1)), depth) < 0) {
728       if(ss_compare(T, PA + GETIDX(*(middle - 1)), PA + *middle, depth) == 0) {
750        saidx_t depth, saidx_t n, saint_t lastsuffix) {
761   ss_mintrosort(T, PA, first, last, depth);
773     ss_mintrosort(T, PA, a, a + SS_BLOCKSIZE, depth);
775     ss_insertionsort(T, PA, a, a + SS_BLOCKSIZE, depth);
781       ss_swapmerge(T, PA, b - k, b, b + k, curbuf, curbufsize, depth);
785   ss_mintrosort(T, PA, a, middle, depth);
787   ss_insertionsort(T, PA, a, middle, depth);
791       ss_swapmerge(T, PA, a - k, a, middle, buf, bufsize, depth);
797     ss_mintrosort(T, PA, middle, last, depth);
799     ss_insertionsort(T, PA, middle, last, depth);
801     ss_inplacemerge(T, PA, first, middle, last, depth);
809         (a < last) && ((*a < 0) || (0 < ss_compare(T, &(PAi[0]), PA + *a, depth)));