Lines Matching +full:3 +full:k

34   each word consists of W bytes (4 or 8). If N is 3, for example, then three
36 indices in the array of words: 0, 3, 6, ..., 1, 4, 7, ..., and 2, 5, 8, ...
173 Return x^(n * 2^k) modulo p(x). Requires that x2n_table[] has been
176 local z_crc_t x2nmodp(z_off64_t n, unsigned k) { in x2nmodp() argument
182 p = multmodp(x2n_table[k & 31], p); in x2nmodp()
184 k++; in x2nmodp()
294 byte 0xb1 is the polynomial x^7+x^3+x^2+1), then the CRC is (q*x^32) mod p,
348 int k, n; in make_crc_table() local
407 for (k = 0; k < 8; k++) { in make_crc_table()
409 write_table(out, ltl[k], 256); in make_crc_table()
410 fprintf(out, "}%s", k < 7 ? ",\n" : ""); in make_crc_table()
416 for (k = 0; k < 8; k++) { in make_crc_table()
418 write_table64(out, big[k], 256); in make_crc_table()
419 fprintf(out, "}%s", k < 7 ? ",\n" : ""); in make_crc_table()
433 for (k = 0; k < 4; k++) { in make_crc_table()
435 write_table(out, ltl[k], 256); in make_crc_table()
436 fprintf(out, "}%s", k < 3 ? ",\n" : ""); in make_crc_table()
442 for (k = 0; k < 4; k++) { in make_crc_table()
444 write_table32hi(out, big[k], 256); in make_crc_table()
445 fprintf(out, "}%s", k < 3 ? ",\n" : ""); in make_crc_table()
474 Write the 32-bit values in table[0..k-1] to out, five per line in
477 local void write_table(FILE *out, const z_crc_t FAR *table, int k) { in write_table() argument
480 for (n = 0; n < k; n++) in write_table()
483 n == k - 1 ? "" : (n % 5 == 4 ? ",\n" : ", ")); in write_table()
487 Write the high 32-bits of each value in table[0..k-1] to out, five per line
490 local void write_table32hi(FILE *out, const z_word_t FAR *table, int k) { in write_table32hi() argument
493 for (n = 0; n < k; n++) in write_table32hi()
496 n == k - 1 ? "" : (n % 5 == 4 ? ",\n" : ", ")); in write_table32hi()
500 Write the 64-bit values in table[0..k-1] to out, three per line in
506 local void write_table64(FILE *out, const z_word_t FAR *table, int k) { in write_table64() argument
509 for (n = 0; n < k; n++) in write_table64()
510 fprintf(out, "%s0x%016llx%s", n == 0 || n % 3 ? "" : " ", in write_table64()
512 n == k - 1 ? "" : (n % 3 == 2 ? ",\n" : ", ")); in write_table64()
529 int k; in braid() local
531 for (k = 0; k < w; k++) { in braid()
532 p = x2nmodp((n * w + 3 - k) << 3, 0); in braid()
533 ltl[k][0] = 0; in braid()
534 big[w - 1 - k][0] = 0; in braid()
536 ltl[k][i] = q = multmodp(i << 24, p); in braid()
537 big[w - 1 - k][i] = byte_swap(q); in braid()
603 num = len >> 3; in crc32_z()
609 while (num >= 3 * Z_BATCH) { in crc32_z()
620 word += 3 * Z_BATCH; in crc32_z()
621 num -= 3 * Z_BATCH; in crc32_z()
628 last = num / 3; in crc32_z()
641 word += 3 * last; in crc32_z()
642 num -= 3 * last; in crc32_z()
677 int k; in crc_word() local
678 for (k = 0; k < W; k++) in crc_word()
684 int k; in crc_word_big() local
685 for (k = 0; k < W; k++) in crc_word_big()
687 crc_big_table[(data >> ((W - 1) << 3)) & 0xff]; in crc_word_big()
713 int k; in crc32_z() local
742 #if N > 3 in crc32_z()
763 #if N > 3 in crc32_z()
786 #if N > 3 in crc32_z()
787 word3 = crc3 ^ words[3]; in crc32_z()
806 #if N > 3 in crc32_z()
817 for (k = 1; k < W; k++) { in crc32_z()
818 crc0 ^= crc_braid_table[k][(word0 >> (k << 3)) & 0xff]; in crc32_z()
820 crc1 ^= crc_braid_table[k][(word1 >> (k << 3)) & 0xff]; in crc32_z()
822 crc2 ^= crc_braid_table[k][(word2 >> (k << 3)) & 0xff]; in crc32_z()
823 #if N > 3 in crc32_z()
824 crc3 ^= crc_braid_table[k][(word3 >> (k << 3)) & 0xff]; in crc32_z()
826 crc4 ^= crc_braid_table[k][(word4 >> (k << 3)) & 0xff]; in crc32_z()
828 crc5 ^= crc_braid_table[k][(word5 >> (k << 3)) & 0xff]; in crc32_z()
846 #if N > 3 in crc32_z()
847 crc = crc_word(crc3 ^ words[3] ^ crc); in crc32_z()
867 #if N > 3 in crc32_z()
885 #if N > 3 in crc32_z()
908 #if N > 3 in crc32_z()
909 word3 = crc3 ^ words[3]; in crc32_z()
928 #if N > 3 in crc32_z()
939 for (k = 1; k < W; k++) { in crc32_z()
940 crc0 ^= crc_braid_big_table[k][(word0 >> (k << 3)) & 0xff]; in crc32_z()
942 crc1 ^= crc_braid_big_table[k][(word1 >> (k << 3)) & 0xff]; in crc32_z()
944 crc2 ^= crc_braid_big_table[k][(word2 >> (k << 3)) & 0xff]; in crc32_z()
945 #if N > 3 in crc32_z()
946 crc3 ^= crc_braid_big_table[k][(word3 >> (k << 3)) & 0xff]; in crc32_z()
948 crc4 ^= crc_braid_big_table[k][(word4 >> (k << 3)) & 0xff]; in crc32_z()
950 crc5 ^= crc_braid_big_table[k][(word5 >> (k << 3)) & 0xff]; in crc32_z()
968 #if N > 3 in crc32_z()
969 comb = crc_word_big(crc3 ^ words[3] ^ comb); in crc32_z()
1025 return multmodp(x2nmodp(len2, 3), crc1) ^ (crc2 & 0xffffffff); in crc32_combine64()
1038 return x2nmodp(len2, 3); in crc32_combine_gen64()