2 * Copyright (c) 1990 The Regents of the University of California.
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 * 4. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 * Copyright (c) 2001 by Thomas Moestl <tmm@FreeBSD.org>.
31 * All rights reserved.
33 * Redistribution and use in source and binary forms, with or without
34 * modification, are permitted provided that the following conditions
36 * 1. Redistributions of source code must retain the above copyright
37 * notice, this list of conditions and the following disclaimer.
38 * 2. Redistributions in binary form must reproduce the above copyright
39 * notice, this list of conditions and the following disclaimer in the
40 * documentation and/or other materials provided with the distribution.
42 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
43 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
44 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
45 * IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
46 * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
47 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
48 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
49 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
50 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
51 * USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
53 * from tahoe: in_cksum.c 1.2 86/01/05
54 * from: @(#)in_cksum.c 1.3 (Berkeley) 1/19/91
55 * from: Id: in_cksum.c,v 1.8 1995/12/03 18:35:19 bde Exp
56 * from: FreeBSD: src/sys/alpha/include/in_cksum.h,v 1.5 2000/05/06
61 #ifndef _MACHINE_IN_CKSUM_H_
62 #define _MACHINE_IN_CKSUM_H_ 1
64 #include <sys/cdefs.h>
66 #define in_cksum(m, len) in_cksum_skip(m, len, 0)
68 #if defined(IPVERSION) && (IPVERSION == 4)
70 in_cksum_update(struct ip *ip)
74 __tmp = (int)ip->ip_sum + 1;
75 ip->ip_sum = __tmp + (__tmp >> 16);
79 static __inline u_short
80 in_addword(u_short sum, u_short b)
90 : "=&r" (__ret), "=&r" (__tmp) : "r" (sum), "r" (b) : "cc");
94 static __inline u_short
95 in_pseudo(u_int sum, u_int b, u_int c)
101 "addccc %0, %4, %0\n"
107 : "=r" (sum), "=&r" (__tmp) : "0" (sum), "r" (b), "r" (c) : "cc");
111 #if defined(IPVERSION) && (IPVERSION == 4)
112 static __inline u_int
113 in_cksum_hdr(struct ip *ip)
115 u_long __ret, __tmp1, __tmp2, __tmp3, __tmp4;
118 * Use 32-bit memory accesses and additions - addition with carry only
119 * works for 32 bits, and fixing up alignment issues for 64 is probably
120 * more trouble than it's worth.
121 * This may read outside of the ip header, but does not cross a page
122 * boundary in doing so, so that should be OK.
123 * Actually, this specialized implementation might be overkill - using
124 * a generic implementation for both in_cksum_skip and in_cksum_hdr
125 * should not be too much more expensive.
127 #define __LD_ADD(addr, tmp, sum, offs, mod) \
128 "lduw [" #addr " + " #offs "], " #tmp "\n" \
129 "add" # mod " " #sum ", " #tmp ", " #sum "\n"
138 "sll %4, 3, %4\n" /* fix up unaligned buffers */
142 "lduw [%1 + 20], %2\n"
147 __LD_ADD(%1, %2, %0, 4, cc)
148 __LD_ADD(%1, %2, %0, 8, ccc)
149 __LD_ADD(%1, %2, %0, 12, ccc)
150 __LD_ADD(%1, %2, %0, 16, ccc)
151 "addc %0, 0, %0\n" /* reduce */
157 "andcc %3, 1, %3\n" /* need to byte-swap? */
159 "bne,a,pn %%xcc, 1b\n"
164 : "=&r" (__ret), "=r" (__tmp1), "=&r" (__tmp2), "=&r" (__tmp3),
165 "=&r" (__tmp4) : "1" (ip) : "cc");
172 u_short in_cksum_skip(struct mbuf *m, int len, int skip);
175 #endif /* _MACHINE_IN_CKSUM_H_ */