Add std/crc32 ieee_hasher.up_arm_crc32

This commit is contained in:
Nigel Tao committed 2021-02-13 17:02:02 +11:00
1 parent 3338b5eafa
commit 0834b40d22
2 files changed
+194 -2

No files matched your search

+48 -1
View File
@@ -24,6 +24,54 @@ pub func ieee_hasher.set_quirk_enabled!(quirk: base.u32, enabled: base.bool) {
// to signal "initializer not called"? Should the return type, in the generated
// C code, be "struct{ uint32_t checksum; wuffs_crc32__status status }"?
pub func ieee_hasher.update_u32!(x: slice base.u8) base.u32 {
if this.state == 0 {
choose up = [up_arm_crc32]
}
this.up!(x: args.x)
return this.state
}
pri func ieee_hasher.up!(x: slice base.u8),
choosy,
{
var s : base.u32
var p : slice base.u8
s = 0xFFFF_FFFF ^ this.state
// See "Multi-Byte Lookup Tables" in std/crc32/README.md for more detail on
// the slicing-by-M algorithm. We use an M of 16.
iterate (p = args.x)(length: 16, advance: 16, unroll: 2) {
s ^= ((p[0x00] as base.u32) << 0) |
((p[0x01] as base.u32) << 8) |
((p[0x02] as base.u32) << 16) |
((p[0x03] as base.u32) << 24)
s = IEEE_TABLE[0x00][p[0x0F]] ^
IEEE_TABLE[0x01][p[0x0E]] ^
IEEE_TABLE[0x02][p[0x0D]] ^
IEEE_TABLE[0x03][p[0x0C]] ^
IEEE_TABLE[0x04][p[0x0B]] ^
IEEE_TABLE[0x05][p[0x0A]] ^
IEEE_TABLE[0x06][p[0x09]] ^
IEEE_TABLE[0x07][p[0x08]] ^
IEEE_TABLE[0x08][p[0x07]] ^
IEEE_TABLE[0x09][p[0x06]] ^
IEEE_TABLE[0x0A][p[0x05]] ^
IEEE_TABLE[0x0B][p[0x04]] ^
IEEE_TABLE[0x0C][0xFF & (s >> 24)] ^
IEEE_TABLE[0x0D][0xFF & (s >> 16)] ^
IEEE_TABLE[0x0E][0xFF & (s >> 8)] ^
IEEE_TABLE[0x0F][0xFF & (s >> 0)]
} else (length: 1, advance: 1, unroll: 1) {
s = IEEE_TABLE[0][((s & 0xFF) as base.u8) ^ p[0]] ^ (s >> 8)
}
this.state = 0xFFFF_FFFF ^ s
}
pri func ieee_hasher.up_arm_crc32!(x: slice base.u8),
choose cpu_arch >= arm_crc32,
{
var s : base.u32
var p : slice base.u8
@@ -57,7 +105,6 @@ pub func ieee_hasher.update_u32!(x: slice base.u8) base.u32 {
}
this.state = 0xFFFF_FFFF ^ s
return this.state
}
// The table below was created by script/print-crc32-magic-numbers.go.