Lines Matching +full:6 +full:b
35 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
36 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
121 y = sqq_table[x >> ((e - 6) - (e & 1))] << ((e >> 1) - 7); in ss_isqrt()
125 y = (sqq_table[x >> ((e - 6) - (e & 1))] >> (7 - (e >> 1))) + 1; in ss_isqrt()
293 saidx_t *a, *b; in ss_partition() local
295 for(a = first - 1, b = last;;) { in ss_partition()
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()
298 if(b <= a) { break; } in ss_partition()
299 t = ~*b; in ss_partition()
300 *b = *a; in ss_partition()
314 struct { saidx_t *a, *b, c; saint_t d; } stack[STACK_SIZE]; in ss_mintrosort() member
316 saidx_t *a, *b, *c, *d, *e, *f; in ss_mintrosort() local
369 for(b = first; (++b < last) && ((x = Td[PA[*b]]) == v);) { } in ss_mintrosort()
370 if(((a = b) < last) && (x < v)) { in ss_mintrosort()
371 for(; (++b < last) && ((x = Td[PA[*b]]) <= v);) { in ss_mintrosort()
372 if(x == v) { SWAP(*b, *a); ++a; } in ss_mintrosort()
375 for(c = last; (b < --c) && ((x = Td[PA[*c]]) == v);) { } in ss_mintrosort()
376 if((b < (d = c)) && (x > v)) { in ss_mintrosort()
377 for(; (b < --c) && ((x = Td[PA[*c]]) >= v);) { in ss_mintrosort()
381 for(; b < c;) { in ss_mintrosort()
382 SWAP(*b, *c); in ss_mintrosort()
383 for(; (++b < c) && ((x = Td[PA[*b]]) <= v);) { in ss_mintrosort()
384 if(x == v) { SWAP(*b, *a); ++a; } in ss_mintrosort()
386 for(; (b < --c) && ((x = Td[PA[*c]]) >= v);) { in ss_mintrosort()
392 c = b - 1; in ss_mintrosort()
394 if((s = a - first) > (t = b - a)) { s = t; } in ss_mintrosort()
395 for(e = first, f = b - s; 0 < s; --s, ++e, ++f) { SWAP(*e, *f); } in ss_mintrosort()
397 for(e = b, f = last - s; 0 < s; --s, ++e, ++f) { SWAP(*e, *f); } in ss_mintrosort()
399 a = first + (b - a), c = last - (d - c); in ss_mintrosort()
400 b = (v <= Td[PA[*a] - 1]) ? a : ss_partition(PA, a, c, depth); in ss_mintrosort()
403 if((last - c) <= (c - b)) { in ss_mintrosort()
404 STACK_PUSH(b, c, depth + 1, ss_ilg(c - b)); in ss_mintrosort()
407 } else if((a - first) <= (c - b)) { in ss_mintrosort()
409 STACK_PUSH(b, c, depth + 1, ss_ilg(c - b)); in ss_mintrosort()
414 first = b, last = c, depth += 1, limit = ss_ilg(c - b); in ss_mintrosort()
417 if((a - first) <= (c - b)) { in ss_mintrosort()
418 STACK_PUSH(b, c, depth + 1, ss_ilg(c - b)); in ss_mintrosort()
421 } else if((last - c) <= (c - b)) { in ss_mintrosort()
423 STACK_PUSH(b, c, depth + 1, ss_ilg(c - b)); in ss_mintrosort()
428 first = b, last = c, depth += 1, limit = ss_ilg(c - b); in ss_mintrosort()
452 ss_blockswap(saidx_t *a, saidx_t *b, saidx_t n) { in ss_blockswap() argument
454 for(; 0 < n; --n, ++a, ++b) { in ss_blockswap()
455 t = *a, *a = *b, *b = t; in ss_blockswap()
462 saidx_t *a, *b, t; in ss_rotate() local
468 a = last - 1, b = middle - 1; in ss_rotate()
471 *a-- = *b, *b-- = *a; in ss_rotate()
472 if(b < first) { in ss_rotate()
476 a -= 1, b = middle - 1; in ss_rotate()
481 a = first, b = middle; in ss_rotate()
484 *a++ = *b, *b++ = *a; in ss_rotate()
485 if(last <= b) { in ss_rotate()
489 a += 1, b = middle; in ss_rotate()
506 saidx_t *a, *b; in ss_inplacemerge() local
517 b = a + half; in ss_inplacemerge()
518 q = ss_compare(T, PA + ((0 <= *b) ? *b : ~*b), p, depth); in ss_inplacemerge()
520 a = b + 1; in ss_inplacemerge()
548 saidx_t *a, *b, *c, *bufend; in ss_mergeforward() local
555 for(t = *(a = first), b = buf, c = middle;;) { in ss_mergeforward()
556 r = ss_compare(T, PA + *b, PA + *c, depth); in ss_mergeforward()
559 *a++ = *b; in ss_mergeforward()
560 if(bufend <= b) { *bufend = t; return; } in ss_mergeforward()
561 *b++ = *a; in ss_mergeforward()
562 } while(*b < 0); in ss_mergeforward()
567 while(b < bufend) { *a++ = *b, *b++ = *a; } in ss_mergeforward()
568 *a = *b, *b = t; in ss_mergeforward()
575 *a++ = *b; in ss_mergeforward()
576 if(bufend <= b) { *bufend = t; return; } in ss_mergeforward()
577 *b++ = *a; in ss_mergeforward()
578 } while(*b < 0); in ss_mergeforward()
583 while(b < bufend) { *a++ = *b, *b++ = *a; } in ss_mergeforward()
584 *a = *b, *b = t; in ss_mergeforward()
599 saidx_t *a, *b, *c, *bufend; in ss_mergebackward() local
612 for(t = *(a = last - 1), b = bufend, c = middle - 1;;) { in ss_mergebackward()
615 if(x & 1) { do { *a-- = *b, *b-- = *a; } while(*b < 0); x ^= 1; } in ss_mergebackward()
616 *a-- = *b; in ss_mergebackward()
617 if(b <= buf) { *buf = t; break; } in ss_mergebackward()
618 *b-- = *a; in ss_mergebackward()
619 if(*b < 0) { p1 = PA + ~*b; x |= 1; } in ss_mergebackward()
620 else { p1 = PA + *b; } in ss_mergebackward()
625 while(buf < b) { *a-- = *b, *b-- = *a; } in ss_mergebackward()
626 *a = *b, *b = t; in ss_mergebackward()
632 if(x & 1) { do { *a-- = *b, *b-- = *a; } while(*b < 0); x ^= 1; } in ss_mergebackward()
633 *a-- = ~*b; in ss_mergebackward()
634 if(b <= buf) { *buf = t; break; } in ss_mergebackward()
635 *b-- = *a; in ss_mergebackward()
639 while(buf < b) { *a-- = *b, *b-- = *a; } in ss_mergebackward()
640 *a = *b, *b = t; in ss_mergebackward()
643 if(*b < 0) { p1 = PA + ~*b; x |= 1; } in ss_mergebackward()
644 else { p1 = PA + *b; } in ss_mergebackward()
659 #define MERGE_CHECK(a, b, c)\ in ss_swapmerge() argument
665 if(((c) & 4) && ((ss_compare(T, PA + GETIDX(*((b) - 1)), PA + *(b), depth) == 0))) {\ in ss_swapmerge()
666 *(b) = ~*(b);\ in ss_swapmerge()
669 struct { saidx_t *a, *b, *c; saint_t d; } stack[STACK_SIZE]; in ss_swapmerge() member
723 if((next & 2) && (r == middle)) { next ^= 6; } in ss_swapmerge()
753 saidx_t *b, *middle, *curbuf; in sssort() local
780 for(b = a, k = SS_BLOCKSIZE, j = i; j & 1; b -= k, k <<= 1, j >>= 1) { in sssort()
781 ss_swapmerge(T, PA, b - k, b, b + k, curbuf, curbufsize, depth); in sssort()
806 /* Insert last type B* suffix. */ in sssort()