public inbox for linux-kernel@vger.kernel.org
 help / color / mirror / Atom feed
* There are smaller ways to encode a CRC32 table...
@ 2008-02-01  4:53 George Spelvin
  2008-02-01  4:54 ` H. Peter Anvin
  2008-02-01 10:37 ` Ian Campbell
  0 siblings, 2 replies; 3+ messages in thread
From: George Spelvin @ 2008-02-01  4:53 UTC (permalink / raw)
  To: hpa, ijc; +Cc: linux, linux-kernel, tglx, mingo, hpa

The code to fill it in is smaller than the table itself.
Is it worth complicating things with some INIT code to reduce
the stored image size?  (The table is not compressible.)

#define CRC32POLY	0xedb88320	/* CRC32 polynomial, little-endian */

static uint32_t crctab32[256];

void
crc32init(void)
{
	unsigned i, j;
	uint32_t crc = 1;

	crctab32[0] = 0;

	for (i = 128; i; i >>= 1) {
		crc = (crc >> 1) ^ ((crc & 1) ? CRC32POLY : 0);
		for (j = 0; j < 256; j += 2*i)
			crctab32[i+j] = crc ^ crctab32[j];
	}
}

The above code basically computes the CRCs of the bytes 0x80, 0x40, ... 0x01,
and applies the identity crctab32[i^j] = crctab32[i] ^ crctab32[j].

And BTW, storing the inverse of the CRC only catches trailing (after the CRC)
all-zero padding.  If this is not a problem, it's not necessary, although you
still might want to do it just for consistency.  This inversion changes the
CRC of the entire image (body + CRC) from all-zero to a fixed non-zero value.
(To be precise, to the (non-inverted) CRC of 0xffffffff.)

^ permalink raw reply	[flat|nested] 3+ messages in thread

end of thread, other threads:[~2008-02-01 10:38 UTC | newest]

Thread overview: 3+ messages (download: mbox.gz follow: Atom feed
-- links below jump to the message on this page --
2008-02-01  4:53 There are smaller ways to encode a CRC32 table George Spelvin
2008-02-01  4:54 ` H. Peter Anvin
2008-02-01 10:37 ` Ian Campbell

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox