2
* Copyright (c) 1988, 1992, 1993
3
* The Regents of the University of California. All rights reserved.
5
* Redistribution and use in source and binary forms, with or without
6
* modification, are permitted provided that the following conditions
8
* 1. Redistributions of source code must retain the above copyright
9
* notice, this list of conditions and the following disclaimer.
10
* 2. Redistributions in binary form must reproduce the above copyright
11
* notice, this list of conditions and the following disclaimer in the
12
* documentation and/or other materials provided with the distribution.
13
* 3. All advertising materials mentioning features or use of this software
14
* must display the following acknowledgement:
15
* This product includes software developed by the University of
16
* California, Berkeley and its contributors.
17
* 4. Neither the name of the University nor the names of its contributors
18
* may be used to endorse or promote products derived from this software
19
* without specific prior written permission.
21
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33
* @(#)in_cksum.c 8.1 (Berkeley) 6/10/93
34
* in_cksum.c,v 1.2 1994/08/02 07:48:16 davidg Exp
40
* Checksum routine for Internet Protocol family headers (Portable Version).
42
* This routine is very heavily used in the network
43
* code and should be modified for each CPU to be as fast as possible.
45
* XXX Since we will never span more than 1 mbuf, we can optimise this
48
#define ADDCARRY(x) (x > 65535 ? x -= 65535 : x)
49
#define REDUCE {l_util.l = sum; sum = l_util.s[0] + l_util.s[1]; ADDCARRY(sum);}
51
int cksum(struct mbuf *m, int len)
53
register u_int16_t *w;
55
register int mlen = 0;
69
w = mtod(m, u_int16_t *);
77
* Force to even boundary.
79
if ((1 & (long) w) && (mlen > 0)) {
82
s_util.c[0] = *(u_int8_t *)w;
83
w = (u_int16_t *)((int8_t *)w + 1);
88
* Unroll the loop to make overhead from
91
while ((mlen -= 32) >= 0) {
92
sum += w[0]; sum += w[1]; sum += w[2]; sum += w[3];
93
sum += w[4]; sum += w[5]; sum += w[6]; sum += w[7];
94
sum += w[8]; sum += w[9]; sum += w[10]; sum += w[11];
95
sum += w[12]; sum += w[13]; sum += w[14]; sum += w[15];
99
while ((mlen -= 8) >= 0) {
100
sum += w[0]; sum += w[1]; sum += w[2]; sum += w[3];
104
if (mlen == 0 && byte_swapped == 0)
107
while ((mlen -= 2) >= 0) {
116
s_util.c[1] = *(u_int8_t *)w;
122
} else if (mlen == -1)
123
s_util.c[0] = *(u_int8_t *)w;
128
DEBUG_ERROR((dfd, "cksum: out of data\n"));
129
DEBUG_ERROR((dfd, " len = %d\n", len));
133
/* The last mbuf has odd # of bytes. Follow the
134
standard (the odd byte may be shifted left by 8 bits
135
or not as determined by endian-ness of the machine) */
140
return (~sum & 0xffff);
added
removed
src/slirp/cksum.c
