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)
117 (word & 0xff00000000000000) >> 56 |
118 (word & 0xff000000000000) >> 40 |
119 (word & 0xff0000000000) >> 24 |
120 (word & 0xff00000000) >> 8 |
121 (word & 0xff000000) << 8 |
122 (word & 0xff0000) << 24 |
123 (word & 0xff00) << 40 |
124 (word & 0xff) << 56;
127 (word & 0xff000000) >> 24 |
128 (word & 0xff0000) >> 8 |
129 (word & 0xff00) << 8 |
130 (word & 0xff) << 24;
588 const z_word_t *word;
603 /* Compute the CRC up to a word boundary. */
610 /* Prepare to compute the CRC on full 64-bit words word[0..num-1]. */
611 word = (z_word_t const *)buf;
622 val0 = word[i];
623 val1 = word[i + Z_BATCH];
624 val2 = word[i + 2 * Z_BATCH];
629 word += 3 * Z_BATCH;
643 val0 = word[i];
644 val1 = word[i + last];
645 val2 = word[i + last2];
650 word += 3 * last;
659 val0 = word[i];
662 word += num;
665 buf = (const unsigned char FAR *)word;
682 least-significant byte of the word as the first byte of data, without any pre
791 /* Load the word for each braid into registers. */
810 /* Compute and update the CRC for each word. The loop should
913 /* Load the word for each braid into registers. */
932 /* Compute and update the CRC for each word. The loop should