Lines Matching defs:W
34 each word consists of W bytes (4 or 8). If N is 3, for example, then three
38 of N * W bytes as are available have been processed. The results are combined
40 W must be 4 or 8. The upper limit on N can be increased if desired by adding
44 N and W are chosen empirically by benchmarking the execution time on a given
45 processor. The choices for N and W below were based on testing on Intel Kaby
48 with N=5, W=8. The Sparc, PowerPC, and MIPS64 were all fastest at N=5, W=4.
70 Define W and the associated z_word_t type. If W is not defined, then a
76 # define W Z_TESTW
80 # define W 8 /* required for MAKECRCH */
83 # define W 8
85 # define W 4
89 #ifdef W
90 # if W == 8 && defined(Z_U8)
93 # undef W
94 # define W 4
97 # undef W
102 #if defined(__aarch64__) && defined(__ARM_FEATURE_CRC32) && W == 8
106 #if defined(W) && (!defined(ARMCRC32) || defined(DYNAMIC_CRC_TABLE))
114 # if W == 8
124 # else /* W == 4 */
195 #ifdef W
197 local z_crc_t FAR crc_braid_table[W][256];
198 local z_word_t FAR crc_braid_big_table[W][256];
320 #ifdef W
331 #ifdef W
333 braid(crc_braid_table, crc_braid_big_table, N, W);
344 #if !defined(W) || W != 8
369 "#ifdef W\n"
371 "#if W == 8\n"
382 "#else /* W == 4 */\n"
404 "#if W == 8\n"
430 "#else /* W == 4 */\n"
523 #ifdef W
669 #ifdef W
672 Return the CRC of the W bytes in the word_t data, taking the
678 for (k = 0; k < W; k++)
685 for (k = 0; k < W; k++)
687 crc_big_table[(data >> ((W - 1) << 3)) & 0xff];
706 #ifdef W
709 if (len >= N * W + W - 1) {
716 while (len && ((z_size_t)buf & (W - 1)) != 0) {
722 blks = len / (N * W);
723 len -= blks * N * W;
817 for (k = 1; k < W; k++) {
939 for (k = 1; k < W; k++) {
989 #endif /* W */