}
void crc_clear(crc_t *crc) {
+
crc->state = crc->initial_value & crc->mask;
if (crc->refin)
crc->state = reflect(crc->state, crc->order);
}
-void crc_update(crc_t *crc, uint32_t indata, int data_width){
-
- //reflected
- if (crc->refin) indata = reflect(indata, data_width);
+void crc_update2(crc_t *crc, uint32_t data, int data_width){
+
+ if (crc->refin)
+ data = reflect(data, data_width);
// Bring the next byte into the remainder.
- crc->state ^= indata << (crc->order - data_width);
+ crc->state ^= data << (crc->order - data_width);
- for( uint8_t bit = data_width; bit > 0; --bit) {
-
-
- // Try to divide the current data bit.
+ for( uint8_t bit = data_width; bit > 0; --bit) {
+
if (crc->state & crc->topbit)
crc->state = (crc->state << 1) ^ crc->polynom;
else
}
}
-void crc_update2(crc_t *crc, uint32_t data, int data_width)
+void crc_update(crc_t *crc, uint32_t data, int data_width)
{
- if (crc->refin) data = reflect(data, data_width);
+ if (crc->refin)
+ data = reflect(data, data_width);
int i;
for(i=0; i<data_width; i++) {
crc_t crc;
crc_init_ref(&crc, 8, 0x63, 0x55, 0, TRUE, TRUE);
for ( int i = 0; i < size; ++i)
- crc_update(&crc, buff[i], 8);
+ crc_update2(&crc, buff[i], 8);
return reflect(crc_finish(&crc), 8);
}