mirror of
https://github.com/ddidderr/wuffs.git
synced 2026-11-18 16:32:11 +01:00
52 lines
1.4 KiB
Plaintext
52 lines
1.4 KiB
Plaintext
// Copyright 2017 The Wuffs Authors.
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// https://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
packageid "adl3"
|
|
|
|
// TODO: drop the '?' but still generate wuffs_adler32__hasher__initialize?
|
|
pub struct hasher?(
|
|
state base.u32 = 1,
|
|
)
|
|
|
|
pub func hasher.update!(x slice base.u8)(checksum base.u32) {
|
|
// The Adler-32 checksum's magic 65521 and 5552 numbers are discussed in
|
|
// RFC 1950.
|
|
|
|
var s1 base.u32 = this.state.low_bits(n:16)
|
|
var s2 base.u32 = this.state.high_bits(n:16)
|
|
|
|
while in.x.length() > 0 {
|
|
var remaining slice base.u8
|
|
if in.x.length() > 5552 {
|
|
remaining = in.x[5552:]
|
|
in.x = in.x[:5552]
|
|
}
|
|
|
|
iterate (p slice base.u8 =: in.x)(length:1, unroll:8) {
|
|
s1 ~mod+= p[0] as base.u32
|
|
s2 ~mod+= s1
|
|
}
|
|
|
|
s1 %= 65521
|
|
s2 %= 65521
|
|
|
|
in.x = remaining
|
|
}
|
|
|
|
// TODO: check that you can't assign to this.foo unless the method's effect
|
|
// is "!" impure or "?" impure coroutine.
|
|
this.state = ((s2 & 0xFFFF) << 16) | (s1 & 0xFFFF)
|
|
return this.state
|
|
}
|