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
36 #include <sys/param.h>
38 #include <sys/systm.h>
41 * Checksum routine for Internet Protocol family headers (Portable Version).
43 * This routine is very heavily used in the network
44 * code and should be modified for each CPU to be as fast as possible.
47 #define ADDCARRY(x) (x > 65535 ? x -= 65535 : x)
48 #define REDUCE {l_util.l = sum; sum = l_util.s[0] + l_util.s[1]; ADDCARRY(sum);}
52 register struct mbuf
*m
;
57 register int mlen
= 0;
69 for (;m
&& len
; m
= m
->m_next
) {
72 w
= mtod(m
, u_short
*);
75 * The first byte of this mbuf is the continuation
76 * of a word spanning between this mbuf and the
79 * s_util.c[0] is already saved when scanning previous
82 s_util
.c
[1] = *(char *)w
;
84 w
= (u_short
*)((char *)w
+ 1);
93 * Force to even boundary.
95 if ((1 & (int) w
) && (mlen
> 0)) {
98 s_util
.c
[0] = *(u_char
*)w
;
99 w
= (u_short
*)((char *)w
+ 1);
104 * Unroll the loop to make overhead from
107 while ((mlen
-= 32) >= 0) {
108 sum
+= w
[0]; sum
+= w
[1]; sum
+= w
[2]; sum
+= w
[3];
109 sum
+= w
[4]; sum
+= w
[5]; sum
+= w
[6]; sum
+= w
[7];
110 sum
+= w
[8]; sum
+= w
[9]; sum
+= w
[10]; sum
+= w
[11];
111 sum
+= w
[12]; sum
+= w
[13]; sum
+= w
[14]; sum
+= w
[15];
115 while ((mlen
-= 8) >= 0) {
116 sum
+= w
[0]; sum
+= w
[1]; sum
+= w
[2]; sum
+= w
[3];
120 if (mlen
== 0 && byte_swapped
== 0)
123 while ((mlen
-= 2) >= 0) {
131 s_util
.c
[1] = *(char *)w
;
136 } else if (mlen
== -1)
137 s_util
.c
[0] = *(char *)w
;
140 panic("cksum: out of data: need %d bytes\n", len
);
143 /* The last mbuf has odd # of bytes. Follow the
144 standard (the odd byte may be shifted left by 8 bits
145 or not as determined by endian-ness of the machine) */
150 return (~sum
& 0xffff);