Lines Matching full:32

21 To produce a 32-bit CRC, the divisor is actually a 33-bit CRC polynomial.
22 Since it's 33 bits long, bit 32 is always going to be set, so usually the
39 and to make the XOR cancel, it's just a copy of bit 32 of the remainder.
53 Notice how, to get at bit 32 of the shifted remainder, we look
58 32 bits later.  Thus, the first 32 cycles of this are pretty boring.
59 Also, to add the CRC to a message, we need a 32-bit-long hole for it at
60 the end, so we have to add 32 extra cycles shifting in zeros at the
64 next_input_bit() until the moment it's needed.  Then the first 32 cycles
65 can be precomputed, and merging in the final 32 zero bits to make room
109 If the input is a multiple of 32 bits, you can even XOR in a 32-bit
110 word at a time and increase the inner loop count to 32.
127 (The table entries are simply the CRC-32 of the given one-byte messages.)
150 x^32 to x^39, while the other goes from x^40 to x^47.
157 Each step, 32 bits of data is fetched, XORed with the CRC, and the result
158 broken into bytes and looked up in the tables.  Because the 32-bit shift
167 in parallel.  Each step, the 32-bit CRC is shifted 64 bits and XORed