Lines Matching full:multiple
6 and the whole thing (message+CRC) is a multiple of the given
37 appropriate multiple of the divisor to subtract to being the remainder
42 throw the quotient bit away, but subtract the appropriate multiple of
49 multiple = remainder & 0x80000000 ? CRCPOLY : 0;
50 remainder = (remainder << 1 | next_input_bit()) ^ multiple;
70 multiple = (remainder & 0x80000000) ? CRCPOLY : 0;
71 remainder = (remainder << 1) ^ multiple;
78 multiple = (remainder & 1) ? CRCPOLY : 0;
79 remainder = (remainder >> 1) ^ multiple;
94 multiple = (remainder & 0x80000000) ? CRCPOLY : 0;
95 remainder = (remainder << 1) ^ multiple;
104 multiple = (remainder & 1) ? CRCPOLY : 0;
105 remainder = (remainder >> 1) ^ multiple;
109 If the input is a multiple of 32 bits, you can even XOR in a 32-bit
122 in the correct multiple to subtract, we can shift a byte at a time.
124 and the correct multiple of the polynomial to subtract is found using
178 Normally, appending zero bits to a message which is already a multiple
179 of a polynomial produces a larger multiple of that polynomial. Thus,