forked from mrhooray/crc-rs
/
util.rs
63 lines (60 loc) · 1.39 KB
/
util.rs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
pub(crate) const fn crc8(poly: u8, reflect: bool, mut byte: u8) -> u8 {
if reflect {
byte = byte.reverse_bits()
};
let mut value = byte;
let mut i = 0;
while i < 8 {
value = (value << 1) ^ ((value >> 7) * poly);
i += 1;
}
if reflect {
value = value.reverse_bits()
}
value
}
pub(crate) const fn crc16(poly: u16, reflect: bool, mut byte: u8) -> u16 {
if reflect {
byte = byte.reverse_bits()
};
let mut value = (byte as u16) << 8;
let mut i = 0;
while i < 8 {
value = (value << 1) ^ ((value >> 15) * poly);
i += 1;
}
if reflect {
value = value.reverse_bits()
}
value
}
pub(crate) const fn crc32(poly: u32, reflect: bool, mut byte: u8) -> u32 {
if reflect {
byte = byte.reverse_bits()
};
let mut value = (byte as u32) << 24;
let mut i = 0;
while i < 8 {
value = (value << 1) ^ ((value >> 31) * poly);
i += 1;
}
if reflect {
value = value.reverse_bits()
}
value
}
pub(crate) const fn crc64(poly: u64, reflect: bool, mut byte: u8) -> u64 {
if reflect {
byte = byte.reverse_bits()
};
let mut value = (byte as u64) << 56;
let mut i = 0;
while i < 8 {
value = (value << 1) ^ ((value >> 63) * poly);
i += 1;
}
if reflect {
value = value.reverse_bits()
}
value
}