- int nleft = len;
- unsigned short * w = addr;
- int sum = 0;
- unsigned short answer = 0;
-
- /*
- * Our algorithm is simple, using a 32 bit accumulator (sum), we add
- * sequential 16 bit words to it, and at the end, fold back all the
- * carry bits from the top 16 bits into the lower 16 bits.
- */
- while (nleft > 1) {
- sum += *w++;
- nleft -= 2;
+ uint32_t accumulator = 0;
+ for (size_t i = 0; i < ICMP_ECHO_PACKET_BYTES / 2; i++) {
+ accumulator += ntohs(data[i]);
+ if (accumulator > 0xffff) accumulator -= 0xffff;