crc32fast/
combine.rs
1const GF2_DIM: usize = 32;
2
3fn gf2_matrix_times(mat: &[u32; GF2_DIM], mut vec: u32) -> u32 {
4 let mut sum = 0;
5 let mut idx = 0;
6 while vec > 0 {
7 if vec & 1 == 1 {
8 sum ^= mat[idx];
9 }
10 vec >>= 1;
11 idx += 1;
12 }
13 return sum;
14}
15
16fn gf2_matrix_square(square: &mut [u32; GF2_DIM], mat: &[u32; GF2_DIM]) {
17 for n in 0..GF2_DIM {
18 square[n] = gf2_matrix_times(mat, mat[n]);
19 }
20}
21
22pub(crate) fn combine(mut crc1: u32, crc2: u32, mut len2: u64) -> u32 {
23 let mut row: u32;
24 let mut even = [0u32; GF2_DIM]; let mut odd = [0u32; GF2_DIM]; if len2 <= 0 {
29 return crc1;
30 }
31
32 odd[0] = 0xedb88320; row = 1;
35 for n in 1..GF2_DIM {
36 odd[n] = row;
37 row <<= 1;
38 }
39
40 gf2_matrix_square(&mut even, &odd);
42
43 gf2_matrix_square(&mut odd, &even);
45
46 loop {
49 gf2_matrix_square(&mut even, &odd);
51 if len2 & 1 == 1 {
52 crc1 = gf2_matrix_times(&even, crc1);
53 }
54 len2 >>= 1;
55
56 if len2 == 0 {
58 break;
59 }
60
61 gf2_matrix_square(&mut odd, &even);
63 if len2 & 1 == 1 {
64 crc1 = gf2_matrix_times(&odd, crc1);
65 }
66 len2 >>= 1;
67
68 if len2 == 0 {
70 break;
71 }
72 }
73
74 crc1 ^= crc2;
76 return crc1;
77}