chiark / gitweb /
Generate the CRC table rather than hardcoding it.
[mLib] / man / crc32.3
b6b9d458 1.\" -*-nroff-*-
d2a91066 t \{\
3. ds ss \s8\u
4. ds se \d\s0
6.el \{\
7. ds ss ^
8. ds se
08da152e 10.TH crc32 3 "8 May 1999" "mLib"
b6b9d458 11.SH NAME
12crc32 \- calculate 32-bit CRC
08da152e 13.\" @crc32
b6b9d458 14.SH SYNOPSIS
16.B "#include <mLib/crc32.h>"
cededfbe 18.BI "uint32 crc32(uint32 " crc ", const void *" buf ", size_t " sz );
b6b9d458 19.BI CRC32( result ", " crc ", " buf ", " sz )
23.B crc32
24function calculates a 32-bit cyclic redundancy check of the data block
25at address
26.I buf
27and size
28.I sz
29passed to it.
31The function is restartable. For a first call, pass zero as the value
32of the
33.I crc
34argument; for subsequent blocks, pass in the previous output. The final
35answer is equal to the result you'd get from computing a CRC over the
36concatenation of the individual blocks.
39.B CRC32
40macro calculates a CRC inline. The calculated CRC value is placed in
41the variable named by
42.IR result .
43Only use the macro version when efficiency is a major concern: it makes
44the code rather harder to read.
46Note that a CRC is not cryptographically strong: it's fairly easy for an
47adversary to construct blocks of data with any desired CRC, or to modify
48a given block in a way which doesn't change its (unknown) CRC.
50The exact behaviour of the CRC is beyond the scope of this manual;
51suffice to say that the result is, in some suitable representation, the
d2a91066 52remainder after division in the finite field GF(2\*(ss32\*(se) of the
53block by a carefully chosen polynomial of order 32.
b6b9d458 54.SH "RETURN VALUE"
55The return value is the 32-bit CRC of the input block.
08da152e 56.SH "SEE ALSO"
57.BR mLib (3).
b6b9d458 58.SH AUTHOR
59Mark Wooding, <>