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