Lines Matching defs:W
32 each word consists of W bytes (4 or 8). If N is 3, for example, then three
36 of N * W bytes as are available have been processed. The results are combined
38 W must be 4 or 8. The upper limit on N can be increased if desired by adding
42 N and W are chosen empirically by benchmarking the execution time on a given
43 processor. The choices for N and W below were based on testing on Intel Kaby
46 with N=5, W=8. The Sparc, PowerPC, and MIPS64 were all fastest at N=5, W=4.
68 Define W and the associated z_word_t type. If W is not defined, then a
74 # define W Z_TESTW
78 # define W 8 /* required for MAKECRCH */
81 # define W 8
83 # define W 4
87 #ifdef W
88 # if W == 8 && defined(Z_U8)
91 # undef W
92 # define W 4
95 # undef W
104 #if defined(__aarch64__) && defined(__ARM_FEATURE_CRC32) && W == 8
108 #if defined(W) && (!defined(ARMCRC32) || defined(DYNAMIC_CRC_TABLE))
117 # if W == 8
127 # else /* W == 4 */
145 #ifdef W
147 local z_crc_t FAR crc_braid_table[W][256];
148 local z_word_t FAR crc_braid_big_table[W][256];
281 #ifdef W
292 #ifdef W
294 braid(crc_braid_table, crc_braid_big_table, N, W);
305 #if !defined(W) || W != 8
330 "#ifdef W\n"
332 "#if W == 8\n"
343 "#else /* W == 4 */\n"
365 "#if W == 8\n"
391 "#else /* W == 4 */\n"
497 #ifdef W
703 #ifdef W
706 Return the CRC of the W bytes in the word_t data, taking the
713 for (k = 0; k < W; k++)
721 for (k = 0; k < W; k++)
723 crc_big_table[(data >> ((W - 1) << 3)) & 0xff];
743 #ifdef W
746 if (len >= N * W + W - 1) {
753 while (len && ((z_size_t)buf & (W - 1)) != 0) {
759 blks = len / (N * W);
760 len -= blks * N * W;
854 for (k = 1; k < W; k++) {
976 for (k = 1; k < W; k++) {
1026 #endif /* W */