Lines Matching defs:word
34 each word consists of W bytes (4 or 8). If N is 3, for example, then three
37 This is done starting at a word boundary, and continues until as many blocks
113 local z_word_t byte_swap(z_word_t word) {
116 (word & 0xff00000000000000) >> 56 |
117 (word & 0xff000000000000) >> 40 |
118 (word & 0xff0000000000) >> 24 |
119 (word & 0xff00000000) >> 8 |
120 (word & 0xff000000) << 8 |
121 (word & 0xff0000) << 24 |
122 (word & 0xff00) << 40 |
123 (word & 0xff) << 56;
126 (word & 0xff000000) >> 24 |
127 (word & 0xff0000) >> 8 |
128 (word & 0xff00) << 8 |
129 (word & 0xff) << 24;
579 const z_word_t *word;
594 /* Compute the CRC up to a word boundary. */
601 /* Prepare to compute the CRC on full 64-bit words word[0..num-1]. */
602 word = (z_word_t const *)buf;
613 val0 = word[i];
614 val1 = word[i + Z_BATCH];
615 val2 = word[i + 2 * Z_BATCH];
620 word += 3 * Z_BATCH;
634 val0 = word[i];
635 val1 = word[i + last];
636 val2 = word[i + last2];
641 word += 3 * last;
650 val0 = word[i];
653 word += num;
656 buf = (const unsigned char FAR *)word;
673 least-significant byte of the word as the first byte of data, without any pre
780 /* Load the word for each braid into registers. */
799 /* Compute and update the CRC for each word. The loop should
902 /* Load the word for each braid into registers. */
921 /* Compute and update the CRC for each word. The loop should