Lines Matching defs:table

85  * algorithm above and storing the results in a lookup table.  Given
86  * such a table, the CRC can be computed quite efficiently as follows:
105  * Initialize a CRC table [256 uint32_t's] with the given polynomial.
107 #define	CRC32_INIT(table, poly)						\
111 		for (Xt = (table) + Xi, *Xt = Xi, Xj = 8; Xj > 0; Xj--)	\
116  * Compute a 32-bit CRC using the specified starting value and table.
119 #define	CRC32(crc, buf, size, start, table)				\
125 		Xcrc = (Xcrc >> 8) ^ (table)[(Xcrc ^ *Xcp++) & 0xFF];	\
134 #define	CRC32_STRING(crc, len, str, start, table)			\
140 		Xcrc = (Xcrc >> 8) ^ (table)[(Xcrc ^ Xc) & 0xFF];	\
151  * The pre-computed table values for CRC32_POLY.
222  * The kernel's pre-computed table for CRC32_POLY.