【校验】TCP和UDP的校验和

时间:2023-03-08 22:01:43
【校验】TCP和UDP的校验和

  一开始,私以为校验和只是简单的求和得到的结果,后来在TCP和UDP里面看到使用的校验和方式有点奇怪--二进制反码(循环进位)求和

  人类的认知过程必将从简单到复杂,看下这个二进制反码循环求和是啥子意思。以16进制示例:

  1.对校验序列word1,word2...wordn的二进制表示求反码

  2.对求的反码序列循环进位求和,循环进位求和的意思是指把求和的进位加到低位,可能进位有x位,把这x位表示的数字和求和结果的16位相加。

  感觉好像变复杂了。没关系,二进制反码循环进位求和有以下特性:

  1.求和过程先求反码再二进制循环进位求和等价于先二进制循环进位求和再对求和结果求反码。(如此大大减少求反码的次数)

  2.与字节序(大端小端问题)无关。(这也许是许多协议使用这种方式求和的原因)

 ///@func:To caculate the Checksum of data
///@param: 1.nums :the number of sizeof(unsigned short int)
///
unsigned short int WordCheckSum(const unsigned short int *data, unsigned short int nums)
{
short int index = ;
unsigned int sum = ;
unsigned short int checkSum ;
for (index = ; index < nums;index++)
{
sum += data[index];
}
//cout << "the sum of data is: " << hex << sum << endl;
checkSum = (unsigned short int)(sum & 0xffff)+(unsigned short int)(sum >> ) ;
/*cout << "the checkSum of data is: " << checkSum << endl;*/
return ~checkSum;
}

  测试代码:

WORD data1[] = {
0x1122, 0x1122, 0x1122, 0x1122, 0x1122
};
WORD data2[] = {
0x2211, 0x2211, 0x2211, 0x2211, 0x2211
};
cout << "the CheckSum of data1 is: " << hex << WordCheckSum(data1, ) << endl;
cout << "the CheckSum of data2 is: " << hex << WordCheckSum(data2, ) << endl;

  测试结果:

【校验】TCP和UDP的校验和

  可见,二进制反码求和与字节序无关。