2003-04-22 21:02:15 +02:00
|
|
|
#include <stdint.h>
|
|
|
|
#include <ip_checksum.h>
|
|
|
|
|
|
|
|
unsigned long compute_ip_checksum(void *addr, unsigned long length)
|
|
|
|
{
|
|
|
|
uint8_t *ptr;
|
|
|
|
volatile union {
|
|
|
|
uint8_t byte[2];
|
|
|
|
uint16_t word;
|
|
|
|
} value;
|
|
|
|
unsigned long sum;
|
|
|
|
unsigned long i;
|
|
|
|
/* In the most straight forward way possible,
|
|
|
|
* compute an ip style checksum.
|
|
|
|
*/
|
|
|
|
sum = 0;
|
|
|
|
ptr = addr;
|
|
|
|
for(i = 0; i < length; i++) {
|
2009-03-31 18:42:57 +02:00
|
|
|
unsigned long v;
|
|
|
|
v = ptr[i];
|
2003-04-22 21:02:15 +02:00
|
|
|
if (i & 1) {
|
2009-03-31 18:42:57 +02:00
|
|
|
v <<= 8;
|
2003-04-22 21:02:15 +02:00
|
|
|
}
|
|
|
|
/* Add the new value */
|
2009-03-31 18:42:57 +02:00
|
|
|
sum += v;
|
2003-04-22 21:02:15 +02:00
|
|
|
/* Wrap around the carry */
|
|
|
|
if (sum > 0xFFFF) {
|
|
|
|
sum = (sum + (sum >> 16)) & 0xFFFF;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
value.byte[0] = sum & 0xff;
|
|
|
|
value.byte[1] = (sum >> 8) & 0xff;
|
|
|
|
return (~value.word) & 0xFFFF;
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned long add_ip_checksums(unsigned long offset, unsigned long sum, unsigned long new)
|
|
|
|
{
|
|
|
|
unsigned long checksum;
|
|
|
|
sum = ~sum & 0xFFFF;
|
|
|
|
new = ~new & 0xFFFF;
|
|
|
|
if (offset & 1) {
|
2010-04-27 08:56:47 +02:00
|
|
|
/* byte swap the sum if it came from an odd offset
|
2003-04-22 21:02:15 +02:00
|
|
|
* since the computation is endian independant this
|
|
|
|
* works.
|
|
|
|
*/
|
|
|
|
new = ((new >> 8) & 0xff) | ((new << 8) & 0xff00);
|
|
|
|
}
|
|
|
|
checksum = sum + new;
|
|
|
|
if (checksum > 0xFFFF) {
|
|
|
|
checksum -= 0xFFFF;
|
|
|
|
}
|
|
|
|
return (~checksum) & 0xFFFF;
|
|
|
|
}
|