Lines Matching +full:8 +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, ...
40 W must be 4 or 8. The upper limit on N can be increased if desired by adding
48 with N=5, W=8. The Sparc, PowerPC, and MIPS64 were all fastest at N=5, W=4.
80 # define W 8 /* required for MAKECRCH */
83 # define W 8
90 # if W == 8 && defined(Z_U8)
102 #if defined(__aarch64__) && defined(__ARM_FEATURE_CRC32) && W == 8
114 # if W == 8 in byte_swap()
119 (word & 0xff00000000) >> 8 | in byte_swap()
120 (word & 0xff000000) << 8 | in byte_swap()
127 (word & 0xff0000) >> 8 | in byte_swap()
128 (word & 0xff00) << 8 | in byte_swap()
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()
287 x^32+x^26+x^23+x^22+x^16+x^12+x^11+x^10+x^8+x^7+x^5+x^4+x^2+x+1.
317 for (j = 0; j < 8; j++) in make_crc_table()
344 #if !defined(W) || W != 8 in make_crc_table()
348 int k, n; in make_crc_table() local
349 z_crc_t ltl[8][256]; in make_crc_table()
350 z_word_t big[8][256]; in make_crc_table()
371 "#if W == 8\n" in make_crc_table()
399 braid(ltl, big, n, 8); in make_crc_table()
404 "#if W == 8\n" in make_crc_table()
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()
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()
677 int k; in crc_word() local
678 for (k = 0; k < W; k++) in crc_word()
679 data = (data >> 8) ^ crc_table[data & 0xff]; in crc_word()
684 int k; in crc_word_big() local
685 for (k = 0; k < W; k++) in crc_word_big()
686 data = (data << 8) ^ in crc_word_big()
713 int k; in crc32_z() local
718 crc = (crc >> 8) ^ crc_table[(crc ^ *buf++) & 0xff]; 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()
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()
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()
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()
992 while (len >= 8) { in crc32_z()
993 len -= 8; in crc32_z()
994 crc = (crc >> 8) ^ crc_table[(crc ^ *buf++) & 0xff]; in crc32_z()
995 crc = (crc >> 8) ^ crc_table[(crc ^ *buf++) & 0xff]; in crc32_z()
996 crc = (crc >> 8) ^ crc_table[(crc ^ *buf++) & 0xff]; in crc32_z()
997 crc = (crc >> 8) ^ crc_table[(crc ^ *buf++) & 0xff]; in crc32_z()
998 crc = (crc >> 8) ^ crc_table[(crc ^ *buf++) & 0xff]; in crc32_z()
999 crc = (crc >> 8) ^ crc_table[(crc ^ *buf++) & 0xff]; in crc32_z()
1000 crc = (crc >> 8) ^ crc_table[(crc ^ *buf++) & 0xff]; in crc32_z()
1001 crc = (crc >> 8) ^ crc_table[(crc ^ *buf++) & 0xff]; in crc32_z()
1005 crc = (crc >> 8) ^ crc_table[(crc ^ *buf++) & 0xff]; in crc32_z()