tools.cpp 6.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306
  1. #include "stdafx.h"
  2. #include "tools.h"
  3. const unsigned short crc_16_tab[] = {
  4. 0x0000, 0xc0c1, 0xc181, 0x0140, 0xc301, 0x03c0, 0x0280, 0xc241,
  5. 0xc601, 0x06c0, 0x0780, 0xc741, 0x0500, 0xc5c1, 0xc481, 0x0440,
  6. 0xcc01, 0x0cc0, 0x0d80, 0xcd41, 0x0f00, 0xcfc1, 0xce81, 0x0e40,
  7. 0x0a00, 0xcac1, 0xcb81, 0x0b40, 0xc901, 0x09c0, 0x0880, 0xc841,
  8. 0xd801, 0x18c0, 0x1980, 0xd941, 0x1b00, 0xdbc1, 0xda81, 0x1a40,
  9. 0x1e00, 0xdec1, 0xdf81, 0x1f40, 0xdd01, 0x1dc0, 0x1c80, 0xdc41,
  10. 0x1400, 0xd4c1, 0xd581, 0x1540, 0xd701, 0x17c0, 0x1680, 0xd641,
  11. 0xd201, 0x12c0, 0x1380, 0xd341, 0x1100, 0xd1c1, 0xd081, 0x1040,
  12. 0xf001, 0x30c0, 0x3180, 0xf141, 0x3300, 0xf3c1, 0xf281, 0x3240,
  13. 0x3600, 0xf6c1, 0xf781, 0x3740, 0xf501, 0x35c0, 0x3480, 0xf441,
  14. 0x3c00, 0xfcc1, 0xfd81, 0x3d40, 0xff01, 0x3fc0, 0x3e80, 0xfe41,
  15. 0xfa01, 0x3ac0, 0x3b80, 0xfb41, 0x3900, 0xf9c1, 0xf881, 0x3840,
  16. 0x2800, 0xe8c1, 0xe981, 0x2940, 0xeb01, 0x2bc0, 0x2a80, 0xea41,
  17. 0xee01, 0x2ec0, 0x2f80, 0xef41, 0x2d00, 0xedc1, 0xec81, 0x2c40,
  18. 0xe401, 0x24c0, 0x2580, 0xe541, 0x2700, 0xe7c1, 0xe681, 0x2640,
  19. 0x2200, 0xe2c1, 0xe381, 0x2340, 0xe101, 0x21c0, 0x2080, 0xe041,
  20. 0xa001, 0x60c0, 0x6180, 0xa141, 0x6300, 0xa3c1, 0xa281, 0x6240,
  21. 0x6600, 0xa6c1, 0xa781, 0x6740, 0xa501, 0x65c0, 0x6480, 0xa441,
  22. 0x6c00, 0xacc1, 0xad81, 0x6d40, 0xaf01, 0x6fc0, 0x6e80, 0xae41,
  23. 0xaa01, 0x6ac0, 0x6b80, 0xab41, 0x6900, 0xa9c1, 0xa881, 0x6840,
  24. 0x7800, 0xb8c1, 0xb981, 0x7940, 0xbb01, 0x7bc0, 0x7a80, 0xba41,
  25. 0xbe01, 0x7ec0, 0x7f80, 0xbf41, 0x7d00, 0xbdc1, 0xbc81, 0x7c40,
  26. 0xb401, 0x74c0, 0x7580, 0xb541, 0x7700, 0xb7c1, 0xb681, 0x7640,
  27. 0x7200, 0xb2c1, 0xb381, 0x7340, 0xb101, 0x71c0, 0x7080, 0xb041,
  28. 0x5000, 0x90c1, 0x9181, 0x5140, 0x9301, 0x53c0, 0x5280, 0x9241,
  29. 0x9601, 0x56c0, 0x5780, 0x9741, 0x5500, 0x95c1, 0x9481, 0x5440,
  30. 0x9c01, 0x5cc0, 0x5d80, 0x9d41, 0x5f00, 0x9fc1, 0x9e81, 0x5e40,
  31. 0x5a00, 0x9ac1, 0x9b81, 0x5b40, 0x9901, 0x59c0, 0x5880, 0x9841,
  32. 0x8801, 0x48c0, 0x4980, 0x8941, 0x4b00, 0x8bc1, 0x8a81, 0x4a40,
  33. 0x4e00, 0x8ec1, 0x8f81, 0x4f40, 0x8d01, 0x4dc0, 0x4c80, 0x8c41,
  34. 0x4400, 0x84c1, 0x8581, 0x4540, 0x8701, 0x47c0, 0x4680, 0x8641,
  35. 0x8201, 0x42c0, 0x4380, 0x8341, 0x4100, 0x81c1, 0x8081, 0x4040
  36. };
  37. /* Generate GetCRC */
  38. unsigned short GetCRC(unsigned char *p, unsigned short n)
  39. {
  40. unsigned char ch;
  41. unsigned short i;
  42. unsigned short crc = 0x0000;
  43. crc = 1;
  44. for (i = 0; i < n; i++) {
  45. ch = *p++;
  46. crc = (unsigned short)(crc_16_tab[(ch^crc) & 0xff] ^ (crc >> 8));
  47. // crc = calc_crc(crc,(unsigned short)ch);
  48. }
  49. crc = crc & 0x7f7f;
  50. return crc;
  51. }
  52. unsigned short GetCRC2(unsigned char *p, unsigned short n)
  53. {
  54. unsigned char ch;
  55. unsigned short i;
  56. unsigned short crc = 0x0000;
  57. for (i = 0; i < n; i++) {
  58. ch = *p++;
  59. crc = (unsigned short)(crc_16_tab[(ch^crc) & 0xff] ^ (crc >> 8));
  60. // crc = calc_crc(crc,(unsigned short)ch);
  61. }
  62. return crc;
  63. }
  64. WORD calccrc(BYTE crcbuf, WORD crc)
  65. {
  66. BYTE i;
  67. crc = crc ^ crcbuf;
  68. for (i = 0; i<8; i++) {
  69. BYTE chk;
  70. chk = crc & 1;
  71. crc = crc >> 1;
  72. crc = crc & 0x7fff;
  73. if (chk == 1)
  74. crc = crc ^ 0xa001;/* CRC polynom=0xa001 */
  75. crc = crc & 0xffff;
  76. }
  77. return crc;
  78. }
  79. WORD calccrc(BYTE crcbuf, WORD crc, WORD polynom)
  80. {
  81. BYTE i;
  82. crc = crc ^ crcbuf;
  83. for (i = 0; i<8; i++) {
  84. BYTE chk;
  85. chk = crc & 1;
  86. crc = crc >> 1;
  87. crc = crc & 0x7fff;
  88. if (chk == 1)
  89. crc = crc^polynom;
  90. crc = crc & 0xffff;
  91. }
  92. return crc;
  93. }
  94. WORD chkcrc(BYTE *buf, WORD len)
  95. {
  96. //BYTE hi,lo;
  97. WORD i;
  98. WORD crc;
  99. crc = 0x0000;/* Initial crc value=0x0000 */
  100. for (i = 0; i<len; i++) {
  101. crc = calccrc(*buf, crc);
  102. buf++;
  103. }
  104. //hi=crc%256;
  105. //lo=crc/256;
  106. //crc=((hi+0x0000)<<8)|lo;
  107. return crc;
  108. }
  109. WORD chkcrc(BYTE *buf, WORD len, WORD polynom)
  110. {
  111. WORD i;
  112. WORD crc;
  113. crc = 0x0000;
  114. for (i = 0; i<len; i++) {
  115. crc = calccrc(*buf, crc, polynom);
  116. buf++;
  117. }
  118. return crc;
  119. }
  120. void crc_calc_sinopec(BYTE *ptr_buffer, WORD length)
  121. {
  122. WORD crc_result;
  123. /* calculate CRC */
  124. crc_result = chkcrc(ptr_buffer, length);
  125. /* ... and store it */
  126. ptr_buffer[length] = (BYTE)(crc_result >> 8);;
  127. ptr_buffer[length + 1] = (BYTE)crc_result;
  128. }
  129. //中石化协议 检查发送数据包的有效数据和CRC中的转义字符ch,每一个替换为两个
  130. bool transEscapeCharacter(BYTE buf[DIT_BUFSIZE], int& len, BYTE ch)
  131. {
  132. bool ischeck = FALSE;
  133. BYTE tmpData[DIT_BUFSIZE];
  134. memset(tmpData, 0, DIT_BUFSIZE);
  135. tmpData[0] = buf[0];
  136. for (int i = 0, j = 0; j< DIT_BUFSIZE - 1; i++, j++)
  137. {
  138. if (i > 0)
  139. {
  140. if (buf[i] == ch)
  141. {
  142. tmpData[j] = ch;
  143. tmpData[j + 1] = ch;
  144. j++;
  145. len++;
  146. ischeck = true;
  147. }
  148. else
  149. {
  150. tmpData[j] = buf[i];
  151. }
  152. }
  153. }
  154. memcpy(buf, tmpData, DIT_BUFSIZE);
  155. return ischeck;
  156. }
  157. //例如base=2,times=3,结果返回2的3次方
  158. unsigned long power(int base, int times)
  159. {
  160. int i;
  161. unsigned long rslt = 1;
  162. for (i = 0; i<times; i++)
  163. rslt *= base;
  164. return rslt;
  165. }
  166. //bcd--存放BCD码的缓冲(高位在前如0x12 0x34 表示十进制数值1234)
  167. //len--bcd的字节长度
  168. //radix--
  169. //返回转换后的十进制数值
  170. //如:bcd = 0x12 0x34,则返回值为 1234
  171. unsigned long BCDtoDec(unsigned char *bcd, int len)
  172. {
  173. int i, tmp;
  174. unsigned long dec = 0;
  175. for (i = 0; i<len; i++)
  176. {
  177. tmp = ((bcd[i] >> 4) & 0x0f) * 10 + (bcd[i] & 0x0f);
  178. dec += tmp * power(100, len - 1 - i);
  179. }
  180. return dec;
  181. }
  182. //Dec--十进制数值
  183. //bcd--存放BCD码的缓冲(高位在前如0x12 0x34 表示十进制数值1234),得到的BCD码右对齐左补0
  184. //len--bcd的字节长度
  185. //返回0--成功
  186. //缓冲长度必须足够大,否则数字高位将被丢失
  187. ////如:Dec = 1234, 则运行结束后bcd的最后两个字节 = 0x12 0x34(可能为0x00 0x00 ... 0x12 0x34 )
  188. int DectoBCD(int Dec, unsigned char *bcd, int len)
  189. {
  190. int i, tmp;
  191. for (i = 0; i<len; i++)
  192. {
  193. tmp = Dec % 100;
  194. bcd[len - i - 1] = ((tmp / 10) << 4) + ((tmp % 10) & 0x0f);
  195. Dec /= 100;
  196. }
  197. return 0;
  198. }
  199. //中石化协议 检查收到数据包的有效数据和CRC中的转义字符ch,每两个替换为一个
  200. bool checkEscapeCharacter(BYTE buf[1024], int& len, BYTE ch)
  201. {
  202. bool ischeck = FALSE;
  203. BYTE tmpData[1024];
  204. memset(tmpData, 0, 1024);
  205. for (int i = 0, j = 0; i< 1024; i++, j++)
  206. {
  207. if (i < 1024 - 1 && buf[i] == ch && buf[i + 1] == ch)
  208. {
  209. tmpData[j] = ch;
  210. i += 1;
  211. len--;
  212. ischeck = TRUE;
  213. }
  214. else
  215. {
  216. tmpData[j] = buf[i];
  217. }
  218. }
  219. memcpy(buf, tmpData, 1024);
  220. return ischeck;
  221. }
  222. extern bool calcEscapeLength(const BYTE buf[DIT_BUFSIZE], int& len, BYTE ch)
  223. {
  224. bool ischeck = FALSE;
  225. //BYTE tmpData[1024];
  226. //memset(tmpData, 0, 1024);
  227. for (int i = 0, j = 0; i< 1024; i++, j++)
  228. {
  229. if (i < 1024 - 1 && buf[i] == ch && buf[i + 1] == ch)
  230. {
  231. //tmpData[j] = ch;
  232. i += 1;
  233. len--;
  234. ischeck = TRUE;
  235. }
  236. else
  237. {
  238. //tmpData[j] = buf[i];
  239. }
  240. }
  241. return ischeck;
  242. }