Lines Matching refs:depth
233 int depth) { in ss_compare() argument
236 for(U1 = T + depth + *p1, in ss_compare()
237 U2 = T + depth + *p2, in ss_compare()
258 int *first, int *last, int depth) { in ss_insertionsort() argument
264 for(t = *i, j = i + 1; 0 < (r = ss_compare(T, PA + t, PA + *j, depth));) { in ss_insertionsort()
382 int *first, int *last, int depth) { in ss_partition() argument
386 for(; (++a < b) && ((PA[*a] + depth) >= (PA[*a + 1] + 1));) { *a = ~*a; } in ss_partition()
387 for(; (a < --b) && ((PA[*b] + depth) < (PA[*b + 1] + 1));) { } in ss_partition()
402 int depth) { in ss_mintrosort() argument
416 if(1 < (last - first)) { ss_insertionsort(T, PA, first, last, depth); } in ss_mintrosort()
418 STACK_POP(first, last, depth, limit); in ss_mintrosort()
422 Td = T + depth; in ss_mintrosort()
433 first = ss_partition(PA, first, a, depth); in ss_mintrosort()
437 STACK_PUSH(a, last, depth, -1); in ss_mintrosort()
438 last = a, depth += 1, limit = ss_ilg(a - first); in ss_mintrosort()
444 STACK_PUSH(first, a, depth + 1, ss_ilg(a - first)); in ss_mintrosort()
447 last = a, depth += 1, limit = ss_ilg(a - first); in ss_mintrosort()
490 b = (v <= Td[PA[*a] - 1]) ? a : ss_partition(PA, a, c, depth); in ss_mintrosort()
494 STACK_PUSH(b, c, depth + 1, ss_ilg(c - b)); in ss_mintrosort()
495 STACK_PUSH(c, last, depth, limit); in ss_mintrosort()
498 STACK_PUSH(c, last, depth, limit); in ss_mintrosort()
499 STACK_PUSH(b, c, depth + 1, ss_ilg(c - b)); in ss_mintrosort()
502 STACK_PUSH(c, last, depth, limit); in ss_mintrosort()
503 STACK_PUSH(first, a, depth, limit); in ss_mintrosort()
504 first = b, last = c, depth += 1, limit = ss_ilg(c - b); in ss_mintrosort()
508 STACK_PUSH(b, c, depth + 1, ss_ilg(c - b)); in ss_mintrosort()
509 STACK_PUSH(first, a, depth, limit); in ss_mintrosort()
512 STACK_PUSH(first, a, depth, limit); in ss_mintrosort()
513 STACK_PUSH(b, c, depth + 1, ss_ilg(c - b)); in ss_mintrosort()
516 STACK_PUSH(first, a, depth, limit); in ss_mintrosort()
517 STACK_PUSH(c, last, depth, limit); in ss_mintrosort()
518 first = b, last = c, depth += 1, limit = ss_ilg(c - b); in ss_mintrosort()
524 first = ss_partition(PA, first, last, depth); in ss_mintrosort()
527 depth += 1; in ss_mintrosort()
594 int depth) { in ss_inplacemerge() argument
608 q = ss_compare(T, PA + ((0 <= *b) ? *b : ~*b), p, depth); in ss_inplacemerge()
637 int *buf, int depth) { in ss_mergeforward() argument
646 r = ss_compare(T, PA + *b, PA + *c, depth); in ss_mergeforward()
687 int *buf, int depth) { in ss_mergebackward() argument
703 r = ss_compare(T, p1, p2, depth); in ss_mergebackward()
746 int *buf, int bufsize, int depth) { in ss_swapmerge() argument
752 (((c) & 2) && (ss_compare(T, PA + GETIDX(*((a) - 1)), PA + *(a), depth) == 0))) {\ in ss_swapmerge()
755 if(((c) & 4) && ((ss_compare(T, PA + GETIDX(*((b) - 1)), PA + *(b), depth) == 0))) {\ in ss_swapmerge()
768 ss_mergebackward(T, PA, first, middle, last, buf, depth); in ss_swapmerge()
777 ss_mergeforward(T, PA, first, middle, last, buf, depth); in ss_swapmerge()
788 PA + GETIDX(*(middle - m - half - 1)), depth) < 0) { in ss_swapmerge()
818 if(ss_compare(T, PA + GETIDX(*(middle - 1)), PA + *middle, depth) == 0) { in ss_swapmerge()
839 int depth, int n, int lastsuffix) { in sssort() argument
850 ss_mintrosort(T, PA, first, last, depth); in sssort()
862 ss_mintrosort(T, PA, a, a + SS_BLOCKSIZE, depth); in sssort()
864 ss_insertionsort(T, PA, a, a + SS_BLOCKSIZE, depth); in sssort()
870 ss_swapmerge(T, PA, b - k, b, b + k, curbuf, curbufsize, depth); in sssort()
874 ss_mintrosort(T, PA, a, middle, depth); in sssort()
876 ss_insertionsort(T, PA, a, middle, depth); in sssort()
880 ss_swapmerge(T, PA, a - k, a, middle, buf, bufsize, depth); in sssort()
886 ss_mintrosort(T, PA, middle, last, depth); in sssort()
888 ss_insertionsort(T, PA, middle, last, depth); in sssort()
890 ss_inplacemerge(T, PA, first, middle, last, depth); in sssort()
898 (a < last) && ((*a < 0) || (0 < ss_compare(T, &(PAi[0]), PA + *a, depth))); in sssort()
1114 int depth) { in tr_copy() argument
1122 if((0 <= (s = *c - depth)) && (ISA[s] == v)) { in tr_copy()
1128 if((0 <= (s = *c - depth)) && (ISA[s] == v)) { in tr_copy()
1139 int depth) { in tr_partialcopy() argument
1147 if((0 <= (s = *c - depth)) && (ISA[s] == v)) { in tr_partialcopy()
1149 rank = ISA[s + depth]; in tr_partialcopy()
1164 if((0 <= (s = *c - depth)) && (ISA[s] == v)) { in tr_partialcopy()
1166 rank = ISA[s + depth]; in tr_partialcopy()
1402 trsort(int *ISA, int *SA, int n, int depth) { in trsort() argument
1410 for(ISAd = ISA + depth; -n < *SA; ISAd += ISAd - ISA) { in trsort()