Lines Matching defs:word
40 each word consists of W bytes (4 or 8). If N is 3, for example, then three
43 This is done starting at a word boundary, and continues until as many blocks
120 local z_word_t byte_swap(z_word_t word) {
123 (word & 0xff00000000000000) >> 56 |
124 (word & 0xff000000000000) >> 40 |
125 (word & 0xff0000000000) >> 24 |
126 (word & 0xff00000000) >> 8 |
127 (word & 0xff000000) << 8 |
128 (word & 0xff0000) << 24 |
129 (word & 0xff00) << 40 |
130 (word & 0xff) << 56;
133 (word & 0xff000000) >> 24 |
134 (word & 0xff0000) >> 8 |
135 (word & 0xff00) << 8 |
136 (word & 0xff) << 24;
586 const z_word_t *word;
601 /* Compute the CRC up to a word boundary. */
608 /* Prepare to compute the CRC on full 64-bit words word[0..num-1]. */
609 word = (z_word_t const *)buf;
620 val0 = word[i];
621 val1 = word[i + Z_BATCH];
622 val2 = word[i + 2 * Z_BATCH];
627 word += 3 * Z_BATCH;
641 val0 = word[i];
642 val1 = word[i + last];
643 val2 = word[i + last2];
648 word += 3 * last;
657 val0 = word[i];
660 word += num;
663 buf = (const unsigned char FAR *)word;
680 least-significant byte of the word as the first byte of data, without any pre
848 /* Load the word for each braid into registers. */
867 /* Compute and update the CRC for each word. The loop should
970 /* Load the word for each braid into registers. */
989 /* Compute and update the CRC for each word. The loop should