linux-6.12.1/lib/crc32.c

3  * cleaned up code to current version of sparse and added the slicing-by-8
4  * algorithm to the closely similar existing slicing-by-4 algorithm.
9  * subsequently included in the kernel, thus was re-licensed under the
56 /* implements slicing-by-4 or slicing-by-8 algorithm */
88 		} while ((--len) && ((long)buf)&3);
101 	--b;
104 	for (--b; len; --len) {
118 		u8 *p = (u8 *)(b + 1) - 1;
125 		} while (--len);
137  * crc32_le_generic() - Calculate bitwise little-endian Ethernet AUTODIN II
139  * @crc: seed value for computation.  ~0 for Ethernet, sometimes 0 for other
141  * @p: pointer to buffer over which CRC32/CRC32C is run
143  * @tab: little-endian Ethernet table
152 	while (len--) {
158 	while (len--) {
166 	while (len--) {
173 	while (len--) {
213  * This follows the "little-endian" CRC convention that the lsbit
214  * represents the highest power of x, and the msbit represents x^0.
231  * crc32_generic_shift - Append @len 0 bytes to crc, in logarithmic time
232  * @crc: The original little-endian CRC (i.e. lsbit is x^31 coefficient)
237  * over separate ranges of a buffer, then summing them.
245 	u32 power = polynomial;	/* CRC of x^32 */  local
257 		/* "power" is x^(2^i), modulo the polynomial */
259 			crc = gf2_multiply(crc, power, polynomial);
265 		/* Square power, advancing to x^(2^(i+1)) */
266 		power = gf2_multiply(power, power, polynomial);
285  * crc32_be_generic() - Calculate bitwise big-endian Ethernet AUTODIN II CRC32
286  * @crc: seed value for computation.  ~0 for Ethernet, sometimes 0 for
288  * @p: pointer to buffer over which CRC32 is run
290  * @tab: big-endian Ethernet table
299 	while (len--) {
307 	while (len--) {
315 	while (len--) {
321 	while (len--) {