Lines Matching refs:multiple
4 and the whole thing (message+CRC) is a multiple of the given
34 appropriate multiple of the divisor to subtract to being the remainder
39 throw the quotient bit away, but subtract the appropriate multiple of
45 multiple = remainder & 0x80000000 ? CRCPOLY : 0;
46 remainder = (remainder << 1 | next_input_bit()) ^ multiple;
66 multiple = (remainder & 0x80000000) ? CRCPOLY : 0;
67 remainder = (remainder << 1) ^ multiple;
73 multiple = (remainder & 1) ? CRCPOLY : 0;
74 remainder = (remainder >> 1) ^ multiple;
88 multiple = (remainder & 0x80000000) ? CRCPOLY : 0;
89 remainder = (remainder << 1) ^ multiple;
97 multiple = (remainder & 1) ? CRCPOLY : 0;
98 remainder = (remainder >> 1) ^ multiple;
102 If the input is a multiple of 32 bits, you can even XOR in a 32-bit
115 in the correct multiple to subtract, we can shift a byte at a time.
117 and the correct multiple of the polynomial to subtract is found using
171 Normally, appending zero bits to a message which is already a multiple
172 of a polynomial produces a larger multiple of that polynomial. Thus,