1
0
mirror of https://github.com/vlang/v.git synced 2023-08-10 21:13:21 +03:00
v/vlib/hash/crc32/crc32.v

64 lines
1.1 KiB
V
Raw Normal View History

2019-07-13 16:11:32 +03:00
// Copyright (c) 2019 Alexander Medvednikov. All rights reserved.
// Use of this source code is governed by an MIT license
// that can be found in the LICENSE file.
// This is a very basic crc32 implementation
// at the moment with no architecture optimizations
module crc32
// polynomials
const (
IEEE = 0xedb88320
Castagnoli = 0x82f63b78
Koopman = 0xeb31d82e
)
2019-07-15 18:49:01 +03:00
// The size of a CRC-32 checksum in bytes.
const (
Size = 4
)
2019-07-13 16:11:32 +03:00
struct Crc32 {
mut:
table []u32
}
fn(c mut Crc32) generate_table(poly int) {
for i := 0; i < 256; i++ {
mut crc := u32(i)
for j := 0; j < 8; j++ {
if crc&u32(1) == u32(1) {
crc = u32((crc >> u32(1)) ^ poly)
} else {
crc >>= u32(1)
}
}
c.table << crc
}
}
fn(c &Crc32) sum32(b []byte) u32 {
2019-07-13 16:11:32 +03:00
mut crc := ~u32(0)
for i := 0; i < b.len; i++ {
crc = c.table[byte(crc)^b[i]] ^ u32(crc >> u32(8))
2019-07-13 16:11:32 +03:00
}
return ~crc
}
pub fn(c &Crc32) checksum(b []byte) u32 {
return c.sum32(b)
2019-07-13 16:11:32 +03:00
}
// pass the polinomial to use
pub fn new(poly int) *Crc32 {
mut c := &Crc32{}
c.generate_table(poly)
return c
}
// calculate crc32 using IEEE
pub fn sum(b []byte) u32 {
2019-07-13 16:11:32 +03:00
mut c := new(IEEE)
return c.sum32(b)
2019-07-13 16:11:32 +03:00
}