[go: up one dir, main page]

crc 3.4.0

Rust implementation of CRC with support of various standards
Documentation 
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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207

use crate::util::*;

pub(crate) const fn crc8_table<const L: usize>(
    width: u8,
    poly: u8,
    reflect: bool,
) -> [[u8; 256]; L] {
    let poly = if reflect {
        let poly = poly.reverse_bits();
        poly >> (8u8 - width)
    } else {
        poly << (8u8 - width)
    };

    let mut table = [[0u8; 256]; L];

    // Generate first table (lane 0) directly
    let mut i = 0;
    while i < 256 && L > 0 {
        table[0][i] = crc8(poly, reflect, i as u8);
        i += 1;
    }

    // Generate subsequent lanes based on lane 0
    if L > 1 {
        let mut i = 0;
        while i < 256 {
            let mut e = 1;
            while e < L {
                let one_lower = table[e - 1][i];
                table[e][i] = table[0][one_lower as usize];
                e += 1;
            }
            i += 1;
        }
    }

    table
}

pub(crate) const fn crc16_table<const L: usize>(
    width: u8,
    poly: u16,
    reflect: bool,
) -> [[u16; 256]; L] {
    let poly = if reflect {
        let poly = poly.reverse_bits();
        poly >> (16u8 - width)
    } else {
        poly << (16u8 - width)
    };

    let mut table = [[0u16; 256]; L];

    // Generate first table (lane 0) directly
    let mut i = 0;
    while i < 256 && L > 0 {
        table[0][i] = crc16(poly, reflect, i as u16);
        i += 1;
    }

    // Generate subsequent lanes based on lane 0
    if L > 1 {
        let mut i = 0;
        while i < 256 {
            let mut e = 1;
            while e < L {
                let one_lower = table[e - 1][i];
                if reflect {
                    table[e][i] = (one_lower >> 8) ^ table[0][(one_lower & 0xFF) as usize];
                } else {
                    table[e][i] = (one_lower << 8) ^ table[0][((one_lower >> 8) & 0xFF) as usize];
                }
                e += 1;
            }
            i += 1;
        }
    }

    table
}

pub(crate) const fn crc32_table<const L: usize>(
    width: u8,
    poly: u32,
    reflect: bool,
) -> [[u32; 256]; L] {
    let poly = if reflect {
        let poly = poly.reverse_bits();
        poly >> (32u8 - width)
    } else {
        poly << (32u8 - width)
    };

    let mut table = [[0u32; 256]; L];

    // Generate first table (lane 0) directly
    let mut i = 0;
    while i < 256 && L > 0 {
        table[0][i] = crc32(poly, reflect, i as u32);
        i += 1;
    }

    // Generate subsequent lanes based on lane 0
    if L > 1 {
        let mut i = 0;
        while i < 256 {
            let mut e = 1;
            while e < L {
                let one_lower = table[e - 1][i];
                if reflect {
                    table[e][i] = (one_lower >> 8) ^ table[0][(one_lower & 0xFF) as usize];
                } else {
                    table[e][i] = (one_lower << 8) ^ table[0][((one_lower >> 24) & 0xFF) as usize];
                }
                e += 1;
            }
            i += 1;
        }
    }

    table
}

pub(crate) const fn crc64_table<const L: usize>(
    width: u8,
    poly: u64,
    reflect: bool,
) -> [[u64; 256]; L] {
    let poly = if reflect {
        let poly = poly.reverse_bits();
        poly >> (64u8 - width)
    } else {
        poly << (64u8 - width)
    };

    let mut table = [[0u64; 256]; L];

    // Generate first table (lane 0) directly
    let mut i = 0;
    while i < 256 && L > 0 {
        table[0][i] = crc64(poly, reflect, i as u64);
        i += 1;
    }

    // Generate subsequent lanes based on lane 0
    if L > 1 {
        let mut i = 0;
        while i < 256 {
            let mut e = 1;
            while e < L {
                let one_lower = table[e - 1][i];
                if reflect {
                    table[e][i] = (one_lower >> 8) ^ table[0][(one_lower & 0xFF) as usize];
                } else {
                    table[e][i] = (one_lower << 8) ^ table[0][((one_lower >> 56) & 0xFF) as usize];
                }
                e += 1;
            }
            i += 1;
        }
    }

    table
}

pub(crate) const fn crc128_table<const L: usize>(
    width: u8,
    poly: u128,
    reflect: bool,
) -> [[u128; 256]; L] {
    let poly = if reflect {
        let poly = poly.reverse_bits();
        poly >> (128u8 - width)
    } else {
        poly << (128u8 - width)
    };

    let mut table = [[0u128; 256]; L];

    // Generate first table (lane 0) directly
    let mut i = 0;
    while i < 256 && L > 0 {
        table[0][i] = crc128(poly, reflect, i as u128);
        i += 1;
    }

    // Generate subsequent lanes based on lane 0
    if L > 1 {
        let mut i = 0;
        while i < 256 {
            let mut e = 1;
            while e < L {
                let one_lower = table[e - 1][i];
                if reflect {
                    table[e][i] = (one_lower >> 8) ^ table[0][(one_lower & 0xFF) as usize];
                } else {
                    table[e][i] = (one_lower << 8) ^ table[0][((one_lower >> 120) & 0xFF) as usize];
                }
                e += 1;
            }
            i += 1;
        }
    }

    table
}