]> git.zerfleddert.de Git - proxmark3-svn/blob - common/crc.c
BUG: smash stack in addParity call. Didn't take in consideration that it adds bits...
[proxmark3-svn] / common / crc.c
1 //-----------------------------------------------------------------------------
2 // This code is licensed to you under the terms of the GNU GPL, version 2 or,
3 // at your option, any later version. See the LICENSE.txt file for the text of
4 // the license.
5 //-----------------------------------------------------------------------------
6 // Generic CRC calculation code.
7 //-----------------------------------------------------------------------------
8 #include "crc.h"
9 #include "util.h"
10 #include <stdint.h>
11 #include <stddef.h>
12
13 void crc_init(crc_t *crc, int order, uint32_t polynom, uint32_t initial_value, uint32_t final_xor)
14 {
15 crc->order = order;
16 crc->polynom = polynom;
17 crc->initial_value = initial_value;
18 crc->final_xor = final_xor;
19 crc->mask = (1L<<order)-1;
20 crc_clear(crc);
21 }
22
23 void crc_update(crc_t *crc, uint32_t data, int data_width)
24 {
25 for( int i=0; i < data_width; i++) {
26 int oldstate = crc->state;
27 crc->state = crc->state >> 1;
28 if( (oldstate^data) & 1 ) {
29 crc->state ^= crc->polynom;
30 }
31 data >>= 1;
32 }
33 }
34
35 void crc_clear(crc_t *crc)
36 {
37 crc->state = crc->initial_value & crc->mask;
38 }
39
40 uint32_t crc_finish(crc_t *crc)
41 {
42 return ( crc->state ^ crc->final_xor ) & crc->mask;
43 }
44
45 //credits to iceman
46 uint32_t CRC8Maxim(uint8_t *buff, size_t size) {
47 crc_t crc;
48 crc_init(&crc, 9, 0x8c, 0x00, 0x00);
49 crc_clear(&crc);
50
51 for (size_t i=0; i < size; ++i)
52 crc_update(&crc, buff[i], 8);
53
54 return crc_finish(&crc);
55 }
56
57 //credits to iceman
58 uint32_t CRC8Legic(uint8_t *buff, size_t size) {
59
60 // Poly 0x63, reversed poly 0xC6, Init 0x55, Final 0x00
61 crc_t crc;
62 crc_init(&crc, 8, 0xC6, 0x55, 0);
63 crc_clear(&crc);
64
65 for ( int i = 0; i < size; ++i)
66 crc_update(&crc, buff[i], 8);
67 return SwapBits(crc_finish(&crc), 8);
68 }
69
70
Impressum, Datenschutz