#include "stdafx.h"

#include "tools.h"


const unsigned short crc_16_tab[] = {

	0x0000, 0xc0c1, 0xc181, 0x0140, 0xc301, 0x03c0, 0x0280, 0xc241,

	0xc601, 0x06c0, 0x0780, 0xc741, 0x0500, 0xc5c1, 0xc481, 0x0440,

	0xcc01, 0x0cc0, 0x0d80, 0xcd41, 0x0f00, 0xcfc1, 0xce81, 0x0e40,

	0x0a00, 0xcac1, 0xcb81, 0x0b40, 0xc901, 0x09c0, 0x0880, 0xc841,

	0xd801, 0x18c0, 0x1980, 0xd941, 0x1b00, 0xdbc1, 0xda81, 0x1a40,

	0x1e00, 0xdec1, 0xdf81, 0x1f40, 0xdd01, 0x1dc0, 0x1c80, 0xdc41,

	0x1400, 0xd4c1, 0xd581, 0x1540, 0xd701, 0x17c0, 0x1680, 0xd641,

	0xd201, 0x12c0, 0x1380, 0xd341, 0x1100, 0xd1c1, 0xd081, 0x1040,

	0xf001, 0x30c0, 0x3180, 0xf141, 0x3300, 0xf3c1, 0xf281, 0x3240,

	0x3600, 0xf6c1, 0xf781, 0x3740, 0xf501, 0x35c0, 0x3480, 0xf441,

	0x3c00, 0xfcc1, 0xfd81, 0x3d40, 0xff01, 0x3fc0, 0x3e80, 0xfe41,

	0xfa01, 0x3ac0, 0x3b80, 0xfb41, 0x3900, 0xf9c1, 0xf881, 0x3840,

	0x2800, 0xe8c1, 0xe981, 0x2940, 0xeb01, 0x2bc0, 0x2a80, 0xea41,

	0xee01, 0x2ec0, 0x2f80, 0xef41, 0x2d00, 0xedc1, 0xec81, 0x2c40,

	0xe401, 0x24c0, 0x2580, 0xe541, 0x2700, 0xe7c1, 0xe681, 0x2640,

	0x2200, 0xe2c1, 0xe381, 0x2340, 0xe101, 0x21c0, 0x2080, 0xe041,

	0xa001, 0x60c0, 0x6180, 0xa141, 0x6300, 0xa3c1, 0xa281, 0x6240,

	0x6600, 0xa6c1, 0xa781, 0x6740, 0xa501, 0x65c0, 0x6480, 0xa441,

	0x6c00, 0xacc1, 0xad81, 0x6d40, 0xaf01, 0x6fc0, 0x6e80, 0xae41,

	0xaa01, 0x6ac0, 0x6b80, 0xab41, 0x6900, 0xa9c1, 0xa881, 0x6840,

	0x7800, 0xb8c1, 0xb981, 0x7940, 0xbb01, 0x7bc0, 0x7a80, 0xba41,

	0xbe01, 0x7ec0, 0x7f80, 0xbf41, 0x7d00, 0xbdc1, 0xbc81, 0x7c40,

	0xb401, 0x74c0, 0x7580, 0xb541, 0x7700, 0xb7c1, 0xb681, 0x7640,

	0x7200, 0xb2c1, 0xb381, 0x7340, 0xb101, 0x71c0, 0x7080, 0xb041,

	0x5000, 0x90c1, 0x9181, 0x5140, 0x9301, 0x53c0, 0x5280, 0x9241,

	0x9601, 0x56c0, 0x5780, 0x9741, 0x5500, 0x95c1, 0x9481, 0x5440,

	0x9c01, 0x5cc0, 0x5d80, 0x9d41, 0x5f00, 0x9fc1, 0x9e81, 0x5e40,

	0x5a00, 0x9ac1, 0x9b81, 0x5b40, 0x9901, 0x59c0, 0x5880, 0x9841,

	0x8801, 0x48c0, 0x4980, 0x8941, 0x4b00, 0x8bc1, 0x8a81, 0x4a40,

	0x4e00, 0x8ec1, 0x8f81, 0x4f40, 0x8d01, 0x4dc0, 0x4c80, 0x8c41,

	0x4400, 0x84c1, 0x8581, 0x4540, 0x8701, 0x47c0, 0x4680, 0x8641,

	0x8201, 0x42c0, 0x4380, 0x8341, 0x4100, 0x81c1, 0x8081, 0x4040

};

/* Generate GetCRC */
unsigned short GetCRC(unsigned char *p, unsigned short n)
{
	unsigned char        ch;
	unsigned short        i;
	unsigned short        crc = 0x0000;

	crc = 1;

	for (i = 0; i < n; i++) {
		ch = *p++;
		crc = (unsigned short)(crc_16_tab[(ch^crc) & 0xff] ^ (crc >> 8));
		//  crc = calc_crc(crc,(unsigned short)ch); 
	}

	crc = crc & 0x7f7f;

	return crc;
}

unsigned short GetCRC2(unsigned char *p, unsigned short n)
{
	unsigned char        ch;
	unsigned short        i;
	unsigned short        crc = 0x0000;

	for (i = 0; i < n; i++) {
		ch = *p++;
		crc = (unsigned short)(crc_16_tab[(ch^crc) & 0xff] ^ (crc >> 8));
		//  crc = calc_crc(crc,(unsigned short)ch); 
	}

	return crc;
}

WORD calccrc(BYTE crcbuf, WORD crc)
{
	BYTE i;
	crc = crc ^ crcbuf;
	for (i = 0; i<8; i++) {
		BYTE chk;
		chk = crc & 1;
		crc = crc >> 1;
		crc = crc & 0x7fff;
		if (chk == 1)
			crc = crc ^ 0xa001;/* CRC polynom=0xa001 */
		crc = crc & 0xffff;
	}
	return crc;
}
WORD calccrc(BYTE crcbuf, WORD crc, WORD polynom)
{
	BYTE i;
	crc = crc ^ crcbuf;
	for (i = 0; i<8; i++) {
		BYTE chk;
		chk = crc & 1;
		crc = crc >> 1;
		crc = crc & 0x7fff;
		if (chk == 1)
			crc = crc^polynom;
		crc = crc & 0xffff;
	}
	return crc;
}
WORD chkcrc(BYTE *buf, WORD len)
{
	//BYTE hi,lo;
	WORD i;
	WORD crc;
	crc = 0x0000;/* Initial crc value=0x0000 */
	for (i = 0; i<len; i++) {
		crc = calccrc(*buf, crc);
		buf++;
	}
	//hi=crc%256;
	//lo=crc/256;
	//crc=((hi+0x0000)<<8)|lo;
	return crc;
}
WORD chkcrc(BYTE *buf, WORD len, WORD polynom)
{
	WORD i;
	WORD crc;
	crc = 0x0000;
	for (i = 0; i<len; i++) {
		crc = calccrc(*buf, crc, polynom);
		buf++;
	}
	return crc;
}
void crc_calc_sinopec(BYTE *ptr_buffer, WORD length)
{
	WORD crc_result;

	/* calculate CRC */
	crc_result = chkcrc(ptr_buffer, length);
	/* ... and store it */
	ptr_buffer[length] = (BYTE)(crc_result >> 8);;
	ptr_buffer[length + 1] = (BYTE)crc_result;

}


//中石化协议 检查发送数据包的有效数据和CRC中的转义字符ch，每一个替换为两个
bool transEscapeCharacter(BYTE buf[DIT_BUFSIZE], int& len, BYTE ch)
{
	bool ischeck = FALSE;
	BYTE tmpData[DIT_BUFSIZE];
	memset(tmpData, 0, DIT_BUFSIZE);
	tmpData[0] = buf[0];

	for (int i = 0, j = 0; j< DIT_BUFSIZE - 1; i++, j++)
	{
		if (i > 0)
		{
			if (buf[i] == ch)
			{
				tmpData[j] = ch;
				tmpData[j + 1] = ch;
				j++;
				len++;
				ischeck = true;
			}
			else
			{
				tmpData[j] = buf[i];
			}
		}
	}
	memcpy(buf, tmpData, DIT_BUFSIZE);
	return ischeck;
}


//例如base=2，times=3，结果返回2的3次方
unsigned long power(int base, int times)
{
	int i;
	unsigned long rslt = 1;

	for (i = 0; i<times; i++)
		rslt *= base;

	return rslt;
}

//bcd--存放BCD码的缓冲（高位在前如0x12 0x34 表示十进制数值1234）
//len--bcd的字节长度
//radix--
//返回转换后的十进制数值
//如：bcd = 0x12 0x34，则返回值为 1234
unsigned long BCDtoDec(unsigned char *bcd, int len)
{
	int i, tmp;
	unsigned long dec = 0;

	for (i = 0; i<len; i++)
	{
		tmp = ((bcd[i] >> 4) & 0x0f) * 10 + (bcd[i] & 0x0f);
		dec += tmp * power(100, len - 1 - i);
	}

	return dec;
}


//Dec--十进制数值
//bcd--存放BCD码的缓冲（高位在前如0x12 0x34 表示十进制数值1234），得到的BCD码右对齐左补0
//len--bcd的字节长度
//返回0--成功
//缓冲长度必须足够大，否则数字高位将被丢失
////如：Dec = 1234, 则运行结束后bcd的最后两个字节 = 0x12 0x34（可能为0x00 0x00 ... 0x12 0x34 ）
int DectoBCD(int Dec, unsigned char *bcd, int len)
{
	int i, tmp;
	for (i = 0; i<len; i++)
	{
		tmp = Dec % 100;
		bcd[len - i - 1] = ((tmp / 10) << 4) + ((tmp % 10) & 0x0f);
		Dec /= 100;
	}

	return 0;
}

//中石化协议 检查收到数据包的有效数据和CRC中的转义字符ch，每两个替换为一个
bool checkEscapeCharacter(BYTE buf[1024], int& len, BYTE ch)
{
	bool ischeck = FALSE;
	BYTE tmpData[1024];
	memset(tmpData, 0, 1024);

	for (int i = 0, j = 0; i< 1024; i++, j++)
	{
		if (i < 1024 - 1 && buf[i] == ch && buf[i + 1] == ch)
		{
			tmpData[j] = ch;
			i += 1;
			len--;
			ischeck = TRUE;
		}
		else
		{
			tmpData[j] = buf[i];
		}
	}
	memcpy(buf, tmpData, 1024);
	return ischeck;
}

extern bool calcEscapeLength(const BYTE buf[DIT_BUFSIZE], int& len, BYTE ch)
{
	bool ischeck = FALSE;
	//BYTE tmpData[1024];
	//memset(tmpData, 0, 1024);

	for (int i = 0, j = 0; i< 1024; i++, j++)
	{
		if (i < 1024 - 1 && buf[i] == ch && buf[i + 1] == ch)
		{
			//tmpData[j] = ch;
			i += 1;
			len--;
			ischeck = TRUE;
		}
		else
		{
			//tmpData[j] = buf[i];
		}
	}
	return ischeck;
}