]>
Commit | Line | Data |
---|---|---|
f0cbd3ec FB |
1 | /* |
2 | * Copyright (c) 1988, 1992, 1993 | |
3 | * The Regents of the University of California. All rights reserved. | |
4 | * | |
5 | * Redistribution and use in source and binary forms, with or without | |
6 | * modification, are permitted provided that the following conditions | |
7 | * are met: | |
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. | |
2f5f8996 | 13 | * 3. Neither the name of the University nor the names of its contributors |
f0cbd3ec FB |
14 | * may be used to endorse or promote products derived from this software |
15 | * without specific prior written permission. | |
16 | * | |
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 | |
27 | * SUCH DAMAGE. | |
28 | * | |
29 | * @(#)in_cksum.c 8.1 (Berkeley) 6/10/93 | |
30 | * in_cksum.c,v 1.2 1994/08/02 07:48:16 davidg Exp | |
31 | */ | |
32 | ||
a9c94277 | 33 | #include "slirp.h" |
f0cbd3ec FB |
34 | |
35 | /* | |
36 | * Checksum routine for Internet Protocol family headers (Portable Version). | |
37 | * | |
38 | * This routine is very heavily used in the network | |
39 | * code and should be modified for each CPU to be as fast as possible. | |
5fafdf24 | 40 | * |
f0cbd3ec FB |
41 | * XXX Since we will never span more than 1 mbuf, we can optimise this |
42 | */ | |
43 | ||
44 | #define ADDCARRY(x) (x > 65535 ? x -= 65535 : x) | |
7107944a BS |
45 | #define REDUCE {l_util.l = sum; sum = l_util.s[0] + l_util.s[1]; \ |
46 | (void)ADDCARRY(sum);} | |
f0cbd3ec FB |
47 | |
48 | int cksum(struct mbuf *m, int len) | |
49 | { | |
b6dce92e | 50 | register uint16_t *w; |
f0cbd3ec FB |
51 | register int sum = 0; |
52 | register int mlen = 0; | |
53 | int byte_swapped = 0; | |
54 | ||
55 | union { | |
b6dce92e SW |
56 | uint8_t c[2]; |
57 | uint16_t s; | |
f0cbd3ec FB |
58 | } s_util; |
59 | union { | |
b6dce92e SW |
60 | uint16_t s[2]; |
61 | uint32_t l; | |
f0cbd3ec | 62 | } l_util; |
5fafdf24 | 63 | |
f0cbd3ec FB |
64 | if (m->m_len == 0) |
65 | goto cont; | |
b6dce92e | 66 | w = mtod(m, uint16_t *); |
5fafdf24 | 67 | |
f0cbd3ec | 68 | mlen = m->m_len; |
5fafdf24 | 69 | |
f0cbd3ec FB |
70 | if (len < mlen) |
71 | mlen = len; | |
72 | len -= mlen; | |
73 | /* | |
74 | * Force to even boundary. | |
75 | */ | |
2d26512b | 76 | if ((1 & (uintptr_t)w) && (mlen > 0)) { |
f0cbd3ec FB |
77 | REDUCE; |
78 | sum <<= 8; | |
b6dce92e SW |
79 | s_util.c[0] = *(uint8_t *)w; |
80 | w = (uint16_t *)((int8_t *)w + 1); | |
f0cbd3ec FB |
81 | mlen--; |
82 | byte_swapped = 1; | |
83 | } | |
84 | /* | |
85 | * Unroll the loop to make overhead from | |
86 | * branches &c small. | |
87 | */ | |
88 | while ((mlen -= 32) >= 0) { | |
89 | sum += w[0]; sum += w[1]; sum += w[2]; sum += w[3]; | |
90 | sum += w[4]; sum += w[5]; sum += w[6]; sum += w[7]; | |
91 | sum += w[8]; sum += w[9]; sum += w[10]; sum += w[11]; | |
92 | sum += w[12]; sum += w[13]; sum += w[14]; sum += w[15]; | |
93 | w += 16; | |
94 | } | |
95 | mlen += 32; | |
96 | while ((mlen -= 8) >= 0) { | |
97 | sum += w[0]; sum += w[1]; sum += w[2]; sum += w[3]; | |
98 | w += 4; | |
99 | } | |
100 | mlen += 8; | |
101 | if (mlen == 0 && byte_swapped == 0) | |
102 | goto cont; | |
103 | REDUCE; | |
104 | while ((mlen -= 2) >= 0) { | |
105 | sum += *w++; | |
106 | } | |
5fafdf24 | 107 | |
f0cbd3ec FB |
108 | if (byte_swapped) { |
109 | REDUCE; | |
110 | sum <<= 8; | |
f0cbd3ec | 111 | if (mlen == -1) { |
b6dce92e | 112 | s_util.c[1] = *(uint8_t *)w; |
f0cbd3ec FB |
113 | sum += s_util.s; |
114 | mlen = 0; | |
115 | } else | |
3b46e624 | 116 | |
f0cbd3ec FB |
117 | mlen = -1; |
118 | } else if (mlen == -1) | |
b6dce92e | 119 | s_util.c[0] = *(uint8_t *)w; |
5fafdf24 | 120 | |
f0cbd3ec | 121 | cont: |
f0cbd3ec | 122 | if (len) { |
226ea7a9 MAL |
123 | DEBUG_ERROR("cksum: out of data"); |
124 | DEBUG_ERROR(" len = %d", len); | |
f0cbd3ec | 125 | } |
f0cbd3ec FB |
126 | if (mlen == -1) { |
127 | /* The last mbuf has odd # of bytes. Follow the | |
128 | standard (the odd byte may be shifted left by 8 bits | |
129 | or not as determined by endian-ness of the machine) */ | |
130 | s_util.c[1] = 0; | |
131 | sum += s_util.s; | |
132 | } | |
133 | REDUCE; | |
134 | return (~sum & 0xffff); | |
135 | } | |
0d6ff71a GS |
136 | |
137 | int ip6_cksum(struct mbuf *m) | |
138 | { | |
139 | /* TODO: Optimize this by being able to pass the ip6_pseudohdr to cksum | |
140 | * separately from the mbuf */ | |
141 | struct ip6 save_ip, *ip = mtod(m, struct ip6 *); | |
142 | struct ip6_pseudohdr *ih = mtod(m, struct ip6_pseudohdr *); | |
143 | int sum; | |
144 | ||
145 | save_ip = *ip; | |
146 | ||
147 | ih->ih_src = save_ip.ip_src; | |
148 | ih->ih_dst = save_ip.ip_dst; | |
149 | ih->ih_pl = htonl((uint32_t)ntohs(save_ip.ip_pl)); | |
150 | ih->ih_zero_hi = 0; | |
151 | ih->ih_zero_lo = 0; | |
152 | ih->ih_nh = save_ip.ip_nh; | |
153 | ||
154 | sum = cksum(m, ((int)sizeof(struct ip6_pseudohdr)) | |
155 | + ntohl(ih->ih_pl)); | |
156 | ||
157 | *ip = save_ip; | |
158 | ||
159 | return sum; | |
160 | } |