Lines Matching full:multiple

216  * and the whole thing (message+CRC) is a multiple of the given
245  * to the current remainder.  Then you figure out the appropriate multiple
251  * throw the quotient bit away, but subtract the appropriate multiple of
257  * 	multiple = remainder & 0x80000000 ? CRCPOLY : 0;
258  * 	remainder = (remainder << 1 | next_input_bit()) ^ multiple;
277  * 	multiple = (remainder & 0x80000000) ? CRCPOLY : 0;
278  * 	remainder = (remainder << 1) ^ multiple;
283  * 	multiple = (remainder & 1) ? CRCPOLY : 0;
284  * 	remainder = (remainder >> 1) ^ multiple;
296  * 		multiple = (remainder & 0x80000000) ? CRCPOLY : 0;
297  * 		remainder = (remainder << 1) ^ multiple;
304  * 		multiple = (remainder & 1) ? CRCPOLY : 0;
305  * 		remainder = (remainder << 1) ^ multiple;
308  * If the input is a multiple of 32 bits, you can even XOR in a 32-bit
317  * in the correct multiple to subtract, we can shift a byte at a time.
319  * but again the multiple of the polynomial to subtract depends only on
322  * The multiple we need in that case is the low 32 bits of a 40-bit
323  * value whose high 8 bits are given, and which is a multiple of the
328  * is already a multiple of a polynomial produces a larger multiple of that