mirror of
https://github.com/ddidderr/wuffs.git
synced 2026-11-19 16:47:28 +01:00
Make Iterate contain Assign's not Var's
This commit is contained in:
1 parent
cd9ab50f63
commit
d552f88738
13 files changed
+91
-91
No files matched your search
@@ -25,6 +25,7 @@ pub func hasher.update!(x slice base.u8) base.u32 {
|
||||
var s1 base.u32
|
||||
var s2 base.u32
|
||||
var remaining slice base.u8
|
||||
var p slice base.u8
|
||||
|
||||
if not this.started {
|
||||
this.started = true
|
||||
@@ -41,7 +42,7 @@ pub func hasher.update!(x slice base.u8) base.u32 {
|
||||
args.x = args.x[:5552]
|
||||
}
|
||||
|
||||
iterate (p slice base.u8 =: args.x)(length:1, unroll:8) {
|
||||
iterate (p = args.x)(length:1, unroll:8) {
|
||||
s1 ~mod+= p[0] as base.u32
|
||||
s2 ~mod+= s1
|
||||
}
|
||||
|
||||
@@ -22,12 +22,13 @@ pub struct ieee_hasher?(
|
||||
// C code, be "struct{ uint32_t checksum; wuffs_crc32__status status }"?
|
||||
pub func ieee_hasher.update!(x slice base.u8) base.u32 {
|
||||
var s base.u32
|
||||
var p slice base.u8
|
||||
|
||||
s = 0xFFFFFFFF ^ 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 slice base.u8 =: args.x)(length:16, unroll:2) {
|
||||
iterate (p = args.x)(length:16, unroll:2) {
|
||||
s ^= ((p[0x00] as base.u32) << 0) |
|
||||
((p[0x01] as base.u32) << 8) |
|
||||
((p[0x02] as base.u32) << 16) |
|
||||
|
||||
Reference in new issue
Block a user