mirror of
https://github.com/octoleo/syncthing.git
synced 2024-11-10 15:20:56 +00:00
110 lines
2.5 KiB
Go
110 lines
2.5 KiB
Go
// Package rollinghash/adler32 implements a rolling version of hash/adler32
|
|
|
|
package adler32
|
|
|
|
import (
|
|
"hash"
|
|
vanilla "hash/adler32"
|
|
|
|
"github.com/chmduquesne/rollinghash"
|
|
)
|
|
|
|
const (
|
|
Mod = 65521
|
|
Size = 4
|
|
)
|
|
|
|
// Adler32 is a digest which satisfies the rollinghash.Hash32 interface.
|
|
// It implements the adler32 algorithm https://en.wikipedia.org/wiki/Adler-32
|
|
type Adler32 struct {
|
|
a, b uint32
|
|
|
|
// window is treated like a circular buffer, where the oldest element
|
|
// is indicated by d.oldest
|
|
window []byte
|
|
oldest int
|
|
n uint32
|
|
|
|
vanilla hash.Hash32
|
|
}
|
|
|
|
// Reset resets the digest to its initial state.
|
|
func (d *Adler32) Reset() {
|
|
d.window = d.window[:1] // Reset the size but don't reallocate
|
|
d.window[0] = 0
|
|
d.a = 1
|
|
d.b = 0
|
|
d.oldest = 0
|
|
}
|
|
|
|
// New returns a new Adler32 digest
|
|
func New() *Adler32 {
|
|
return &Adler32{
|
|
a: 1,
|
|
b: 0,
|
|
window: make([]byte, 1, rollinghash.DefaultWindowCap),
|
|
oldest: 0,
|
|
vanilla: vanilla.New(),
|
|
}
|
|
}
|
|
|
|
// Size is 4 bytes
|
|
func (d *Adler32) Size() int { return Size }
|
|
|
|
// BlockSize is 1 byte
|
|
func (d *Adler32) BlockSize() int { return 1 }
|
|
|
|
// Write (re)initializes the rolling window with the input byte slice and
|
|
// adds its data to the digest.
|
|
func (d *Adler32) Write(p []byte) (int, error) {
|
|
// Copy the window, avoiding allocations where possible
|
|
l := len(p)
|
|
if l == 0 {
|
|
l = 1
|
|
}
|
|
if len(d.window) != l {
|
|
if cap(d.window) >= l {
|
|
d.window = d.window[:l]
|
|
} else {
|
|
d.window = make([]byte, len(p))
|
|
}
|
|
}
|
|
copy(d.window, p)
|
|
|
|
// Piggy-back on the core implementation
|
|
d.vanilla.Reset()
|
|
d.vanilla.Write(p)
|
|
s := d.vanilla.Sum32()
|
|
d.a, d.b = s&0xffff, s>>16
|
|
d.n = uint32(len(p)) % Mod
|
|
return len(d.window), nil
|
|
}
|
|
|
|
// Sum32 returns the hash as a uint32
|
|
func (d *Adler32) Sum32() uint32 {
|
|
return d.b<<16 | d.a
|
|
}
|
|
|
|
// Sum returns the hash as a byte slice
|
|
func (d *Adler32) Sum(b []byte) []byte {
|
|
v := d.Sum32()
|
|
return append(b, byte(v>>24), byte(v>>16), byte(v>>8), byte(v))
|
|
}
|
|
|
|
// Roll updates the checksum of the window from the entering byte. You
|
|
// MUST initialize a window with Write() before calling this method.
|
|
func (d *Adler32) Roll(b byte) {
|
|
// extract the entering/leaving bytes and update the circular buffer.
|
|
enter := uint32(b)
|
|
leave := uint32(d.window[d.oldest])
|
|
d.window[d.oldest] = b
|
|
d.oldest += 1
|
|
if d.oldest >= len(d.window) {
|
|
d.oldest = 0
|
|
}
|
|
|
|
// See http://stackoverflow.com/questions/40985080/why-does-my-rolling-adler32-checksum-not-work-in-go-modulo-arithmetic
|
|
d.a = (d.a + Mod + enter - leave) % Mod
|
|
d.b = (d.b + (d.n*leave/Mod+1)*Mod + d.a - (d.n * leave) - 1) % Mod
|
|
}
|