luat_crc.c 7.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302
  1. #include "luat_base.h"
  2. #include "luat_crypto.h"
  3. #include "luat_malloc.h"
  4. uint8_t luat_crc8(const void *data, uint32_t len, uint8_t start, uint8_t poly, uint8_t is_reverse)
  5. {
  6. uint32_t i;
  7. uint8_t CRC8 = start;
  8. uint8_t wTemp = poly;
  9. uint8_t *Src = (uint8_t *)data;
  10. if (is_reverse)
  11. {
  12. poly = 0;
  13. for (i = 0; i < 8; i++)
  14. {
  15. if (wTemp & (1 << (7 - i)))
  16. {
  17. poly |= 1 << i;
  18. }
  19. }
  20. while (len--)
  21. {
  22. CRC8 ^= *Src++;
  23. for (i = 0; i < 8; i++)
  24. {
  25. if ((CRC8 & 0x01))
  26. {
  27. CRC8 >>= 1;
  28. CRC8 ^= poly;
  29. }
  30. else
  31. {
  32. CRC8 >>= 1;
  33. }
  34. }
  35. }
  36. }
  37. else
  38. {
  39. while (len--)
  40. {
  41. CRC8 ^= *Src++;
  42. for (i = 8; i > 0; --i)
  43. {
  44. if ((CRC8 & 0x80))
  45. {
  46. CRC8 <<= 1;
  47. CRC8 ^= poly;
  48. }
  49. else
  50. {
  51. CRC8 <<= 1;
  52. }
  53. }
  54. }
  55. }
  56. return CRC8;
  57. }
  58. /************************************************************************/
  59. /* CRC16 */
  60. /************************************************************************/
  61. uint16_t luat_crc16(const void *data, uint32_t len, uint16_t start,uint16_t final, uint16_t poly, uint8_t is_reverse)
  62. {
  63. uint32_t i;
  64. uint16_t CRC16 = start;
  65. uint16_t CRC16_out = final;
  66. uint16_t wTemp = poly;
  67. uint8_t *Src = (uint8_t *)data;
  68. if (is_reverse)
  69. {
  70. poly = 0;
  71. for (i = 0; i < 16; i++)
  72. {
  73. if (wTemp & (1 << (15 - i)))
  74. {
  75. poly |= 1 << i;
  76. }
  77. }
  78. while (len--)
  79. {
  80. for (i = 0; i < 8; i++)
  81. {
  82. if ((CRC16 & 0x0001) != 0)
  83. {
  84. CRC16 >>= 1;
  85. CRC16 ^= poly;
  86. }
  87. else
  88. {
  89. CRC16 >>= 1;
  90. }
  91. if ((*Src&(1 << i)) != 0)
  92. {
  93. CRC16 ^= poly;
  94. }
  95. }
  96. Src++;
  97. }
  98. }
  99. else
  100. {
  101. while (len--)
  102. {
  103. for (i = 8; i > 0; i--)
  104. {
  105. if ((CRC16 & 0x8000) != 0)
  106. {
  107. CRC16 <<= 1;
  108. CRC16 ^= poly;
  109. }
  110. else
  111. {
  112. CRC16 <<= 1;
  113. }
  114. if ((*Src&(1 << (i - 1))) != 0)
  115. {
  116. CRC16 ^= poly;
  117. }
  118. }
  119. Src++;
  120. }
  121. }
  122. return (uint16_t)(CRC16^CRC16_out);
  123. }
  124. static uint32_t *luat_crc32_table;
  125. static uint32_t luat_crc32_root;
  126. /**
  127. * @brief 反转数据
  128. * @param ref 需要反转的变量
  129. * @param ch 反转长度,多少位
  130. * @retval N反转后的数据
  131. */
  132. static unsigned long int prvReflect(unsigned long int ref, uint8_t ch)
  133. {
  134. unsigned long int value = 0;
  135. unsigned long int i;
  136. for (i = 1; i < (unsigned long int)(ch + 1); i++)
  137. {
  138. if (ref & 1)
  139. value |= (unsigned long int)1 << (ch - i);
  140. ref >>= 1;
  141. }
  142. return value;
  143. }
  144. /**
  145. * @brief 建立CRC32的查询表
  146. * @param Tab 表缓冲
  147. * @param Gen CRC32根
  148. * @retval None
  149. */
  150. static void prvCRC32_CreateTable(uint32_t *Tab, uint32_t Gen)
  151. {
  152. uint32_t crc;
  153. uint32_t i, j, temp, t1, t2, flag;
  154. // if (Tab[1] != 0)
  155. // return;
  156. for (i = 0; i < 256; i++)
  157. {
  158. temp = prvReflect(i, 8);
  159. Tab[i] = temp << 24;
  160. for (j = 0; j < 8; j++)
  161. {
  162. flag = Tab[i] & 0x80000000;
  163. t1 = Tab[i] << 1;
  164. if (0 == flag)
  165. {
  166. t2 = 0;
  167. }
  168. else
  169. {
  170. t2 = Gen;
  171. }
  172. Tab[i] = t1 ^ t2;
  173. }
  174. crc = Tab[i];
  175. Tab[i] = prvReflect(crc, 32);
  176. }
  177. }
  178. /**
  179. * @brief 计算buffer的crc校验码
  180. * @param CRC32_Table CRC32表
  181. * @param Buf 缓冲
  182. * @param Size 缓冲区长度
  183. * @param CRC32 初始CRC32值
  184. * @retval 计算后的CRC32
  185. */
  186. static uint32_t prvCRC32_Cal(uint32_t *CRC32_Table, const uint8_t *Buf, uint32_t Size, uint32_t CRC32Last)
  187. {
  188. uint32_t i;
  189. for (i = 0; i < Size; i++)
  190. {
  191. CRC32Last = CRC32_Table[(CRC32Last ^ Buf[i]) & 0xff] ^ (CRC32Last >> 8);
  192. }
  193. return CRC32Last;
  194. }
  195. uint32_t luat_crc32(const void *data, uint32_t len, uint32_t start, uint32_t poly)
  196. {
  197. if (!poly)
  198. {
  199. poly = 0x04C11DB7;
  200. }
  201. if (poly != luat_crc32_root)
  202. {
  203. luat_crc32_root = poly;
  204. if (!luat_crc32_table)
  205. {
  206. luat_crc32_table = luat_heap_malloc(1024);
  207. }
  208. prvCRC32_CreateTable(luat_crc32_table, luat_crc32_root);
  209. }
  210. return prvCRC32_Cal(luat_crc32_table, data, len, start);
  211. }
  212. // 仅追求数据的modbus crc16算法
  213. // from https://github.com/LacobusVentura/MODBUS-CRC16/blob/master/README.md
  214. // MIT协议
  215. #ifdef TYPE_EC718M
  216. #include "platform_def.h"
  217. #endif
  218. #ifndef __USER_FUNC_IN_RAM__
  219. #define __USER_FUNC_IN_RAM__
  220. #endif
  221. static uint16_t modbus_table[256] = {
  222. 0x0000, 0xC0C1, 0xC181, 0x0140, 0xC301, 0x03C0, 0x0280, 0xC241,
  223. 0xC601, 0x06C0, 0x0780, 0xC741, 0x0500, 0xC5C1, 0xC481, 0x0440,
  224. 0xCC01, 0x0CC0, 0x0D80, 0xCD41, 0x0F00, 0xCFC1, 0xCE81, 0x0E40,
  225. 0x0A00, 0xCAC1, 0xCB81, 0x0B40, 0xC901, 0x09C0, 0x0880, 0xC841,
  226. 0xD801, 0x18C0, 0x1980, 0xD941, 0x1B00, 0xDBC1, 0xDA81, 0x1A40,
  227. 0x1E00, 0xDEC1, 0xDF81, 0x1F40, 0xDD01, 0x1DC0, 0x1C80, 0xDC41,
  228. 0x1400, 0xD4C1, 0xD581, 0x1540, 0xD701, 0x17C0, 0x1680, 0xD641,
  229. 0xD201, 0x12C0, 0x1380, 0xD341, 0x1100, 0xD1C1, 0xD081, 0x1040,
  230. 0xF001, 0x30C0, 0x3180, 0xF141, 0x3300, 0xF3C1, 0xF281, 0x3240,
  231. 0x3600, 0xF6C1, 0xF781, 0x3740, 0xF501, 0x35C0, 0x3480, 0xF441,
  232. 0x3C00, 0xFCC1, 0xFD81, 0x3D40, 0xFF01, 0x3FC0, 0x3E80, 0xFE41,
  233. 0xFA01, 0x3AC0, 0x3B80, 0xFB41, 0x3900, 0xF9C1, 0xF881, 0x3840,
  234. 0x2800, 0xE8C1, 0xE981, 0x2940, 0xEB01, 0x2BC0, 0x2A80, 0xEA41,
  235. 0xEE01, 0x2EC0, 0x2F80, 0xEF41, 0x2D00, 0xEDC1, 0xEC81, 0x2C40,
  236. 0xE401, 0x24C0, 0x2580, 0xE541, 0x2700, 0xE7C1, 0xE681, 0x2640,
  237. 0x2200, 0xE2C1, 0xE381, 0x2340, 0xE101, 0x21C0, 0x2080, 0xE041,
  238. 0xA001, 0x60C0, 0x6180, 0xA141, 0x6300, 0xA3C1, 0xA281, 0x6240,
  239. 0x6600, 0xA6C1, 0xA781, 0x6740, 0xA501, 0x65C0, 0x6480, 0xA441,
  240. 0x6C00, 0xACC1, 0xAD81, 0x6D40, 0xAF01, 0x6FC0, 0x6E80, 0xAE41,
  241. 0xAA01, 0x6AC0, 0x6B80, 0xAB41, 0x6900, 0xA9C1, 0xA881, 0x6840,
  242. 0x7800, 0xB8C1, 0xB981, 0x7940, 0xBB01, 0x7BC0, 0x7A80, 0xBA41,
  243. 0xBE01, 0x7EC0, 0x7F80, 0xBF41, 0x7D00, 0xBDC1, 0xBC81, 0x7C40,
  244. 0xB401, 0x74C0, 0x7580, 0xB541, 0x7700, 0xB7C1, 0xB681, 0x7640,
  245. 0x7200, 0xB2C1, 0xB381, 0x7340, 0xB101, 0x71C0, 0x7080, 0xB041,
  246. 0x5000, 0x90C1, 0x9181, 0x5140, 0x9301, 0x53C0, 0x5280, 0x9241,
  247. 0x9601, 0x56C0, 0x5780, 0x9741, 0x5500, 0x95C1, 0x9481, 0x5440,
  248. 0x9C01, 0x5CC0, 0x5D80, 0x9D41, 0x5F00, 0x9FC1, 0x9E81, 0x5E40,
  249. 0x5A00, 0x9AC1, 0x9B81, 0x5B40, 0x9901, 0x59C0, 0x5880, 0x9841,
  250. 0x8801, 0x48C0, 0x4980, 0x8941, 0x4B00, 0x8BC1, 0x8A81, 0x4A40,
  251. 0x4E00, 0x8EC1, 0x8F81, 0x4F40, 0x8D01, 0x4DC0, 0x4C80, 0x8C41,
  252. 0x4400, 0x84C1, 0x8581, 0x4540, 0x8701, 0x47C0, 0x4680, 0x8641,
  253. 0x8201, 0x42C0, 0x4380, 0x8341, 0x4100, 0x81C1, 0x8081, 0x4040 };
  254. __USER_FUNC_IN_RAM__ uint16_t luat_crc16_modbus( const uint8_t *buf, uint32_t len)
  255. {
  256. uint8_t xor = 0;
  257. uint16_t crc = 0xFFFF;
  258. while( len-- )
  259. {
  260. xor = (*buf++) ^ crc;
  261. crc >>= 8;
  262. crc ^= modbus_table[xor];
  263. }
  264. return crc;
  265. }
  266. // CRC7算法
  267. uint8_t luat_crc7(const uint8_t* message, int length, uint8_t CRCPoly, uint8_t CRC)
  268. {
  269. // unsigned char CRCPoly = 0xe5;
  270. unsigned char CRCTable[256];
  271. // unsigned char CRC = 0x00;
  272. for (int i = 0; i < 256; i++){
  273. CRCTable[i] = (i & 0x80) ? i ^ CRCPoly : i;
  274. for (int j = 1; j < 8; j++){
  275. CRCTable[i] <<= 1;
  276. if (CRCTable[i] & 0x80)
  277. CRCTable[i] ^= CRCPoly;
  278. }
  279. }
  280. for (int i = 0; i < length; i++)
  281. CRC = CRCTable[(CRC << 1) ^ message[i]];
  282. return CRC<< 1;
  283. }