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