Lines Matching full:multiple

254  * and the whole thing (message+CRC) is a multiple of the given
283  * to the current remainder.  Then you figure out the appropriate multiple
289  * throw the quotient bit away, but subtract the appropriate multiple of
295  * 	multiple = remainder & 0x80000000 ? CRCPOLY : 0;
296  * 	remainder = (remainder << 1 | next_input_bit()) ^ multiple;
315  * 	multiple = (remainder & 0x80000000) ? CRCPOLY : 0;
316  * 	remainder = (remainder << 1) ^ multiple;
321  * 	multiple = (remainder & 1) ? CRCPOLY : 0;
322  * 	remainder = (remainder >> 1) ^ multiple;
334  * 		multiple = (remainder & 0x80000000) ? CRCPOLY : 0;
335  * 		remainder = (remainder << 1) ^ multiple;
342  * 		multiple = (remainder & 1) ? CRCPOLY : 0;
343  * 		remainder = (remainder << 1) ^ multiple;
346  * If the input is a multiple of 32 bits, you can even XOR in a 32-bit
355  * in the correct multiple to subtract, we can shift a byte at a time.
357  * but again the multiple of the polynomial to subtract depends only on
361  * value whose high 8 bits are given, and which is a multiple of the
366  * is already a multiple of a polynomial produces a larger multiple of that