Home | History | Annotate | Download | only in crc32

Lines Matching refs:Table

8 // The simple (and slow) CRC32 implementation only uses a 256*4 bytes table.
11 // table (8*256*4 bytes).
15 // simpleMakeTable allocates and constructs a Table for the specified
16 // polynomial. The table is suitable for use with the simple algorithm
18 func simpleMakeTable(poly uint32) *Table {
19 t := new(Table)
24 // simplePopulateTable constructs a Table for the specified polynomial, suitable
26 func simplePopulateTable(poly uint32, t *Table) {
40 // simpleUpdate uses the simple algorithm to update the CRC, given a table that
42 func simpleUpdate(crc uint32, tab *Table, p []byte) uint32 {
54 type slicing8Table [8]Table
57 // table is suitable for use with the slicing-by-8 algorithm (slicingUpdate).
72 // table that was previously computed using slicingMakeTable.