root / slirp / ip_input.c @ cf2846b5
History | View | Annotate | Download (16.4 kB)
1 | f0cbd3ec | bellard | /*
|
---|---|---|---|
2 | f0cbd3ec | bellard | * Copyright (c) 1982, 1986, 1988, 1993
|
3 | f0cbd3ec | bellard | * The Regents of the University of California. All rights reserved.
|
4 | f0cbd3ec | bellard | *
|
5 | f0cbd3ec | bellard | * Redistribution and use in source and binary forms, with or without
|
6 | f0cbd3ec | bellard | * modification, are permitted provided that the following conditions
|
7 | f0cbd3ec | bellard | * are met:
|
8 | f0cbd3ec | bellard | * 1. Redistributions of source code must retain the above copyright
|
9 | f0cbd3ec | bellard | * notice, this list of conditions and the following disclaimer.
|
10 | f0cbd3ec | bellard | * 2. Redistributions in binary form must reproduce the above copyright
|
11 | f0cbd3ec | bellard | * notice, this list of conditions and the following disclaimer in the
|
12 | f0cbd3ec | bellard | * documentation and/or other materials provided with the distribution.
|
13 | 2f5f8996 | aliguori | * 3. Neither the name of the University nor the names of its contributors
|
14 | f0cbd3ec | bellard | * may be used to endorse or promote products derived from this software
|
15 | f0cbd3ec | bellard | * without specific prior written permission.
|
16 | f0cbd3ec | bellard | *
|
17 | f0cbd3ec | bellard | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
18 | f0cbd3ec | bellard | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
19 | f0cbd3ec | bellard | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
20 | f0cbd3ec | bellard | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
21 | f0cbd3ec | bellard | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
22 | f0cbd3ec | bellard | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
23 | f0cbd3ec | bellard | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
24 | f0cbd3ec | bellard | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
25 | f0cbd3ec | bellard | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
26 | f0cbd3ec | bellard | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
27 | f0cbd3ec | bellard | * SUCH DAMAGE.
|
28 | f0cbd3ec | bellard | *
|
29 | f0cbd3ec | bellard | * @(#)ip_input.c 8.2 (Berkeley) 1/4/94
|
30 | f0cbd3ec | bellard | * ip_input.c,v 1.11 1994/11/16 10:17:08 jkh Exp
|
31 | f0cbd3ec | bellard | */
|
32 | f0cbd3ec | bellard | |
33 | f0cbd3ec | bellard | /*
|
34 | f0cbd3ec | bellard | * Changes and additions relating to SLiRP are
|
35 | f0cbd3ec | bellard | * Copyright (c) 1995 Danny Gasparovski.
|
36 | 5fafdf24 | ths | *
|
37 | f0cbd3ec | bellard | * Please read the file COPYRIGHT for the
|
38 | f0cbd3ec | bellard | * terms and conditions of the copyright.
|
39 | f0cbd3ec | bellard | */
|
40 | f0cbd3ec | bellard | |
41 | f0cbd3ec | bellard | #include <slirp.h> |
42 | 429d0a3d | blueswir1 | #include <osdep.h> |
43 | f0cbd3ec | bellard | #include "ip_icmp.h" |
44 | f0cbd3ec | bellard | |
45 | 460fec67 | Jan Kiszka | static struct ip *ip_reass(Slirp *slirp, struct ip *ip, struct ipq *fp); |
46 | 460fec67 | Jan Kiszka | static void ip_freef(Slirp *slirp, struct ipq *fp); |
47 | 9634d903 | blueswir1 | static void ip_enq(register struct ipasfrag *p, |
48 | 9634d903 | blueswir1 | register struct ipasfrag *prev); |
49 | 9634d903 | blueswir1 | static void ip_deq(register struct ipasfrag *p); |
50 | 9634d903 | blueswir1 | |
51 | f0cbd3ec | bellard | /*
|
52 | f0cbd3ec | bellard | * IP initialization: fill in IP protocol switch table.
|
53 | f0cbd3ec | bellard | * All protocols not implemented in kernel go to raw IP protocol handler.
|
54 | f0cbd3ec | bellard | */
|
55 | f0cbd3ec | bellard | void
|
56 | 460fec67 | Jan Kiszka | ip_init(Slirp *slirp) |
57 | f0cbd3ec | bellard | { |
58 | 460fec67 | Jan Kiszka | slirp->ipq.ip_link.next = slirp->ipq.ip_link.prev = &slirp->ipq.ip_link; |
59 | 460fec67 | Jan Kiszka | udp_init(slirp); |
60 | 460fec67 | Jan Kiszka | tcp_init(slirp); |
61 | e6d43cfb | Jan Kiszka | icmp_init(slirp); |
62 | f0cbd3ec | bellard | } |
63 | f0cbd3ec | bellard | |
64 | f0cbd3ec | bellard | /*
|
65 | f0cbd3ec | bellard | * Ip input routine. Checksum and byte swap header. If fragmented
|
66 | f0cbd3ec | bellard | * try to reassemble. Process options. Pass to next level.
|
67 | f0cbd3ec | bellard | */
|
68 | f0cbd3ec | bellard | void
|
69 | 511d2b14 | blueswir1 | ip_input(struct mbuf *m)
|
70 | f0cbd3ec | bellard | { |
71 | 460fec67 | Jan Kiszka | Slirp *slirp = m->slirp; |
72 | f0cbd3ec | bellard | register struct ip *ip; |
73 | f0cbd3ec | bellard | int hlen;
|
74 | 5fafdf24 | ths | |
75 | f0cbd3ec | bellard | DEBUG_CALL("ip_input");
|
76 | f0cbd3ec | bellard | DEBUG_ARG("m = %lx", (long)m); |
77 | f0cbd3ec | bellard | DEBUG_ARG("m_len = %d", m->m_len);
|
78 | f0cbd3ec | bellard | |
79 | f0cbd3ec | bellard | if (m->m_len < sizeof (struct ip)) { |
80 | f0cbd3ec | bellard | return;
|
81 | f0cbd3ec | bellard | } |
82 | 5fafdf24 | ths | |
83 | f0cbd3ec | bellard | ip = mtod(m, struct ip *);
|
84 | 5fafdf24 | ths | |
85 | f0cbd3ec | bellard | if (ip->ip_v != IPVERSION) {
|
86 | f0cbd3ec | bellard | goto bad;
|
87 | f0cbd3ec | bellard | } |
88 | f0cbd3ec | bellard | |
89 | f0cbd3ec | bellard | hlen = ip->ip_hl << 2;
|
90 | f0cbd3ec | bellard | if (hlen<sizeof(struct ip ) || hlen>m->m_len) {/* min header length */ |
91 | 0fe6a7f2 | Jan Kiszka | goto bad; /* or packet too short */ |
92 | f0cbd3ec | bellard | } |
93 | f0cbd3ec | bellard | |
94 | f0cbd3ec | bellard | /* keep ip header intact for ICMP reply
|
95 | 5fafdf24 | ths | * ip->ip_sum = cksum(m, hlen);
|
96 | 5fafdf24 | ths | * if (ip->ip_sum) {
|
97 | f0cbd3ec | bellard | */
|
98 | f0cbd3ec | bellard | if(cksum(m,hlen)) {
|
99 | f0cbd3ec | bellard | goto bad;
|
100 | f0cbd3ec | bellard | } |
101 | f0cbd3ec | bellard | |
102 | f0cbd3ec | bellard | /*
|
103 | f0cbd3ec | bellard | * Convert fields to host representation.
|
104 | f0cbd3ec | bellard | */
|
105 | f0cbd3ec | bellard | NTOHS(ip->ip_len); |
106 | f0cbd3ec | bellard | if (ip->ip_len < hlen) {
|
107 | f0cbd3ec | bellard | goto bad;
|
108 | f0cbd3ec | bellard | } |
109 | f0cbd3ec | bellard | NTOHS(ip->ip_id); |
110 | f0cbd3ec | bellard | NTOHS(ip->ip_off); |
111 | f0cbd3ec | bellard | |
112 | f0cbd3ec | bellard | /*
|
113 | f0cbd3ec | bellard | * Check that the amount of data in the buffers
|
114 | f0cbd3ec | bellard | * is as at least much as the IP header would have us expect.
|
115 | f0cbd3ec | bellard | * Trim mbufs if longer than we expect.
|
116 | f0cbd3ec | bellard | * Drop packet if shorter than we expect.
|
117 | f0cbd3ec | bellard | */
|
118 | f0cbd3ec | bellard | if (m->m_len < ip->ip_len) {
|
119 | f0cbd3ec | bellard | goto bad;
|
120 | f0cbd3ec | bellard | } |
121 | a9ba3a85 | aliguori | |
122 | f0cbd3ec | bellard | /* Should drop packet if mbuf too long? hmmm... */
|
123 | f0cbd3ec | bellard | if (m->m_len > ip->ip_len)
|
124 | f0cbd3ec | bellard | m_adj(m, ip->ip_len - m->m_len); |
125 | f0cbd3ec | bellard | |
126 | f0cbd3ec | bellard | /* check ip_ttl for a correct ICMP reply */
|
127 | 0d491754 | Hervé Poussineau | if(ip->ip_ttl==0) { |
128 | f0cbd3ec | bellard | icmp_error(m, ICMP_TIMXCEED,ICMP_TIMXCEED_INTRANS, 0,"ttl"); |
129 | f0cbd3ec | bellard | goto bad;
|
130 | f0cbd3ec | bellard | } |
131 | f0cbd3ec | bellard | |
132 | f0cbd3ec | bellard | /*
|
133 | f0cbd3ec | bellard | * If offset or IP_MF are set, must reassemble.
|
134 | f0cbd3ec | bellard | * Otherwise, nothing need be done.
|
135 | f0cbd3ec | bellard | * (We could look in the reassembly queue to see
|
136 | f0cbd3ec | bellard | * if the packet was previously fragmented,
|
137 | f0cbd3ec | bellard | * but it's not worth the time; just let them time out.)
|
138 | 5fafdf24 | ths | *
|
139 | f0cbd3ec | bellard | * XXX This should fail, don't fragment yet
|
140 | f0cbd3ec | bellard | */
|
141 | f0cbd3ec | bellard | if (ip->ip_off &~ IP_DF) {
|
142 | f0cbd3ec | bellard | register struct ipq *fp; |
143 | 429d0a3d | blueswir1 | struct qlink *l;
|
144 | f0cbd3ec | bellard | /*
|
145 | f0cbd3ec | bellard | * Look for queue of fragments
|
146 | f0cbd3ec | bellard | * of this datagram.
|
147 | f0cbd3ec | bellard | */
|
148 | 460fec67 | Jan Kiszka | for (l = slirp->ipq.ip_link.next; l != &slirp->ipq.ip_link;
|
149 | 460fec67 | Jan Kiszka | l = l->next) { |
150 | 429d0a3d | blueswir1 | fp = container_of(l, struct ipq, ip_link);
|
151 | 429d0a3d | blueswir1 | if (ip->ip_id == fp->ipq_id &&
|
152 | 429d0a3d | blueswir1 | ip->ip_src.s_addr == fp->ipq_src.s_addr && |
153 | 429d0a3d | blueswir1 | ip->ip_dst.s_addr == fp->ipq_dst.s_addr && |
154 | 429d0a3d | blueswir1 | ip->ip_p == fp->ipq_p) |
155 | f0cbd3ec | bellard | goto found;
|
156 | 429d0a3d | blueswir1 | } |
157 | 429d0a3d | blueswir1 | fp = NULL;
|
158 | f0cbd3ec | bellard | found:
|
159 | f0cbd3ec | bellard | |
160 | f0cbd3ec | bellard | /*
|
161 | f0cbd3ec | bellard | * Adjust ip_len to not reflect header,
|
162 | f0cbd3ec | bellard | * set ip_mff if more fragments are expected,
|
163 | f0cbd3ec | bellard | * convert offset of this to bytes.
|
164 | f0cbd3ec | bellard | */
|
165 | f0cbd3ec | bellard | ip->ip_len -= hlen; |
166 | f0cbd3ec | bellard | if (ip->ip_off & IP_MF)
|
167 | 429d0a3d | blueswir1 | ip->ip_tos |= 1;
|
168 | 5fafdf24 | ths | else
|
169 | 429d0a3d | blueswir1 | ip->ip_tos &= ~1;
|
170 | f0cbd3ec | bellard | |
171 | f0cbd3ec | bellard | ip->ip_off <<= 3;
|
172 | f0cbd3ec | bellard | |
173 | f0cbd3ec | bellard | /*
|
174 | f0cbd3ec | bellard | * If datagram marked as having more fragments
|
175 | f0cbd3ec | bellard | * or if this is not the first fragment,
|
176 | f0cbd3ec | bellard | * attempt reassembly; if it succeeds, proceed.
|
177 | f0cbd3ec | bellard | */
|
178 | 429d0a3d | blueswir1 | if (ip->ip_tos & 1 || ip->ip_off) { |
179 | 460fec67 | Jan Kiszka | ip = ip_reass(slirp, ip, fp); |
180 | 511d2b14 | blueswir1 | if (ip == NULL) |
181 | f0cbd3ec | bellard | return;
|
182 | 460fec67 | Jan Kiszka | m = dtom(slirp, ip); |
183 | f0cbd3ec | bellard | } else
|
184 | f0cbd3ec | bellard | if (fp)
|
185 | 460fec67 | Jan Kiszka | ip_freef(slirp, fp); |
186 | f0cbd3ec | bellard | |
187 | f0cbd3ec | bellard | } else
|
188 | f0cbd3ec | bellard | ip->ip_len -= hlen; |
189 | f0cbd3ec | bellard | |
190 | f0cbd3ec | bellard | /*
|
191 | f0cbd3ec | bellard | * Switch out to protocol's input routine.
|
192 | f0cbd3ec | bellard | */
|
193 | f0cbd3ec | bellard | switch (ip->ip_p) {
|
194 | f0cbd3ec | bellard | case IPPROTO_TCP:
|
195 | f0cbd3ec | bellard | tcp_input(m, hlen, (struct socket *)NULL); |
196 | f0cbd3ec | bellard | break;
|
197 | f0cbd3ec | bellard | case IPPROTO_UDP:
|
198 | f0cbd3ec | bellard | udp_input(m, hlen); |
199 | f0cbd3ec | bellard | break;
|
200 | f0cbd3ec | bellard | case IPPROTO_ICMP:
|
201 | f0cbd3ec | bellard | icmp_input(m, hlen); |
202 | f0cbd3ec | bellard | break;
|
203 | f0cbd3ec | bellard | default:
|
204 | f0cbd3ec | bellard | m_free(m); |
205 | f0cbd3ec | bellard | } |
206 | f0cbd3ec | bellard | return;
|
207 | f0cbd3ec | bellard | bad:
|
208 | 3acccfc6 | Jan Kiszka | m_free(m); |
209 | f0cbd3ec | bellard | return;
|
210 | f0cbd3ec | bellard | } |
211 | f0cbd3ec | bellard | |
212 | 429d0a3d | blueswir1 | #define iptofrag(P) ((struct ipasfrag *)(((char*)(P)) - sizeof(struct qlink))) |
213 | 429d0a3d | blueswir1 | #define fragtoip(P) ((struct ip*)(((char*)(P)) + sizeof(struct qlink))) |
214 | f0cbd3ec | bellard | /*
|
215 | f0cbd3ec | bellard | * Take incoming datagram fragment and try to
|
216 | f0cbd3ec | bellard | * reassemble it into whole datagram. If a chain for
|
217 | f0cbd3ec | bellard | * reassembly of this datagram already exists, then it
|
218 | f0cbd3ec | bellard | * is given as fp; otherwise have to make a chain.
|
219 | f0cbd3ec | bellard | */
|
220 | 9634d903 | blueswir1 | static struct ip * |
221 | 460fec67 | Jan Kiszka | ip_reass(Slirp *slirp, struct ip *ip, struct ipq *fp) |
222 | f0cbd3ec | bellard | { |
223 | 460fec67 | Jan Kiszka | register struct mbuf *m = dtom(slirp, ip); |
224 | f0cbd3ec | bellard | register struct ipasfrag *q; |
225 | f0cbd3ec | bellard | int hlen = ip->ip_hl << 2; |
226 | f0cbd3ec | bellard | int i, next;
|
227 | 5fafdf24 | ths | |
228 | f0cbd3ec | bellard | DEBUG_CALL("ip_reass");
|
229 | f0cbd3ec | bellard | DEBUG_ARG("ip = %lx", (long)ip); |
230 | f0cbd3ec | bellard | DEBUG_ARG("fp = %lx", (long)fp); |
231 | f0cbd3ec | bellard | DEBUG_ARG("m = %lx", (long)m); |
232 | f0cbd3ec | bellard | |
233 | f0cbd3ec | bellard | /*
|
234 | f0cbd3ec | bellard | * Presence of header sizes in mbufs
|
235 | f0cbd3ec | bellard | * would confuse code below.
|
236 | f0cbd3ec | bellard | * Fragment m_data is concatenated.
|
237 | f0cbd3ec | bellard | */
|
238 | f0cbd3ec | bellard | m->m_data += hlen; |
239 | f0cbd3ec | bellard | m->m_len -= hlen; |
240 | f0cbd3ec | bellard | |
241 | f0cbd3ec | bellard | /*
|
242 | f0cbd3ec | bellard | * If first fragment to arrive, create a reassembly queue.
|
243 | f0cbd3ec | bellard | */
|
244 | 511d2b14 | blueswir1 | if (fp == NULL) { |
245 | 460fec67 | Jan Kiszka | struct mbuf *t = m_get(slirp);
|
246 | 460fec67 | Jan Kiszka | |
247 | 460fec67 | Jan Kiszka | if (t == NULL) { |
248 | 460fec67 | Jan Kiszka | goto dropfrag;
|
249 | 460fec67 | Jan Kiszka | } |
250 | f0cbd3ec | bellard | fp = mtod(t, struct ipq *);
|
251 | 460fec67 | Jan Kiszka | insque(&fp->ip_link, &slirp->ipq.ip_link); |
252 | f0cbd3ec | bellard | fp->ipq_ttl = IPFRAGTTL; |
253 | f0cbd3ec | bellard | fp->ipq_p = ip->ip_p; |
254 | f0cbd3ec | bellard | fp->ipq_id = ip->ip_id; |
255 | 429d0a3d | blueswir1 | fp->frag_link.next = fp->frag_link.prev = &fp->frag_link; |
256 | 429d0a3d | blueswir1 | fp->ipq_src = ip->ip_src; |
257 | 429d0a3d | blueswir1 | fp->ipq_dst = ip->ip_dst; |
258 | f0cbd3ec | bellard | q = (struct ipasfrag *)fp;
|
259 | f0cbd3ec | bellard | goto insert;
|
260 | f0cbd3ec | bellard | } |
261 | 5fafdf24 | ths | |
262 | f0cbd3ec | bellard | /*
|
263 | f0cbd3ec | bellard | * Find a segment which begins after this one does.
|
264 | f0cbd3ec | bellard | */
|
265 | 429d0a3d | blueswir1 | for (q = fp->frag_link.next; q != (struct ipasfrag *)&fp->frag_link; |
266 | 429d0a3d | blueswir1 | q = q->ipf_next) |
267 | 429d0a3d | blueswir1 | if (q->ipf_off > ip->ip_off)
|
268 | f0cbd3ec | bellard | break;
|
269 | f0cbd3ec | bellard | |
270 | f0cbd3ec | bellard | /*
|
271 | f0cbd3ec | bellard | * If there is a preceding segment, it may provide some of
|
272 | f0cbd3ec | bellard | * our data already. If so, drop the data from the incoming
|
273 | f0cbd3ec | bellard | * segment. If it provides all of our data, drop us.
|
274 | f0cbd3ec | bellard | */
|
275 | 429d0a3d | blueswir1 | if (q->ipf_prev != &fp->frag_link) {
|
276 | 429d0a3d | blueswir1 | struct ipasfrag *pq = q->ipf_prev;
|
277 | 429d0a3d | blueswir1 | i = pq->ipf_off + pq->ipf_len - ip->ip_off; |
278 | f0cbd3ec | bellard | if (i > 0) { |
279 | f0cbd3ec | bellard | if (i >= ip->ip_len)
|
280 | f0cbd3ec | bellard | goto dropfrag;
|
281 | 460fec67 | Jan Kiszka | m_adj(dtom(slirp, ip), i); |
282 | f0cbd3ec | bellard | ip->ip_off += i; |
283 | f0cbd3ec | bellard | ip->ip_len -= i; |
284 | f0cbd3ec | bellard | } |
285 | f0cbd3ec | bellard | } |
286 | f0cbd3ec | bellard | |
287 | f0cbd3ec | bellard | /*
|
288 | f0cbd3ec | bellard | * While we overlap succeeding segments trim them or,
|
289 | f0cbd3ec | bellard | * if they are completely covered, dequeue them.
|
290 | f0cbd3ec | bellard | */
|
291 | 429d0a3d | blueswir1 | while (q != (struct ipasfrag*)&fp->frag_link && |
292 | 429d0a3d | blueswir1 | ip->ip_off + ip->ip_len > q->ipf_off) { |
293 | 429d0a3d | blueswir1 | i = (ip->ip_off + ip->ip_len) - q->ipf_off; |
294 | 429d0a3d | blueswir1 | if (i < q->ipf_len) {
|
295 | 429d0a3d | blueswir1 | q->ipf_len -= i; |
296 | 429d0a3d | blueswir1 | q->ipf_off += i; |
297 | 460fec67 | Jan Kiszka | m_adj(dtom(slirp, q), i); |
298 | f0cbd3ec | bellard | break;
|
299 | f0cbd3ec | bellard | } |
300 | 429d0a3d | blueswir1 | q = q->ipf_next; |
301 | 3acccfc6 | Jan Kiszka | m_free(dtom(slirp, q->ipf_prev)); |
302 | 429d0a3d | blueswir1 | ip_deq(q->ipf_prev); |
303 | f0cbd3ec | bellard | } |
304 | f0cbd3ec | bellard | |
305 | f0cbd3ec | bellard | insert:
|
306 | f0cbd3ec | bellard | /*
|
307 | f0cbd3ec | bellard | * Stick new segment in its place;
|
308 | f0cbd3ec | bellard | * check for complete reassembly.
|
309 | f0cbd3ec | bellard | */
|
310 | 429d0a3d | blueswir1 | ip_enq(iptofrag(ip), q->ipf_prev); |
311 | f0cbd3ec | bellard | next = 0;
|
312 | 429d0a3d | blueswir1 | for (q = fp->frag_link.next; q != (struct ipasfrag*)&fp->frag_link; |
313 | 429d0a3d | blueswir1 | q = q->ipf_next) { |
314 | 429d0a3d | blueswir1 | if (q->ipf_off != next)
|
315 | 511d2b14 | blueswir1 | return NULL; |
316 | 429d0a3d | blueswir1 | next += q->ipf_len; |
317 | f0cbd3ec | bellard | } |
318 | 429d0a3d | blueswir1 | if (((struct ipasfrag *)(q->ipf_prev))->ipf_tos & 1) |
319 | 511d2b14 | blueswir1 | return NULL; |
320 | f0cbd3ec | bellard | |
321 | f0cbd3ec | bellard | /*
|
322 | f0cbd3ec | bellard | * Reassembly is complete; concatenate fragments.
|
323 | f0cbd3ec | bellard | */
|
324 | 429d0a3d | blueswir1 | q = fp->frag_link.next; |
325 | 460fec67 | Jan Kiszka | m = dtom(slirp, q); |
326 | f0cbd3ec | bellard | |
327 | f0cbd3ec | bellard | q = (struct ipasfrag *) q->ipf_next;
|
328 | 429d0a3d | blueswir1 | while (q != (struct ipasfrag*)&fp->frag_link) { |
329 | 460fec67 | Jan Kiszka | struct mbuf *t = dtom(slirp, q);
|
330 | f0cbd3ec | bellard | q = (struct ipasfrag *) q->ipf_next;
|
331 | fedc54ad | bellard | m_cat(m, t); |
332 | f0cbd3ec | bellard | } |
333 | f0cbd3ec | bellard | |
334 | f0cbd3ec | bellard | /*
|
335 | f0cbd3ec | bellard | * Create header for new ip packet by
|
336 | f0cbd3ec | bellard | * modifying header of first packet;
|
337 | f0cbd3ec | bellard | * dequeue and discard fragment reassembly header.
|
338 | f0cbd3ec | bellard | * Make header visible.
|
339 | f0cbd3ec | bellard | */
|
340 | 429d0a3d | blueswir1 | q = fp->frag_link.next; |
341 | f0cbd3ec | bellard | |
342 | f0cbd3ec | bellard | /*
|
343 | f0cbd3ec | bellard | * If the fragments concatenated to an mbuf that's
|
344 | f0cbd3ec | bellard | * bigger than the total size of the fragment, then and
|
345 | f0cbd3ec | bellard | * m_ext buffer was alloced. But fp->ipq_next points to
|
346 | f0cbd3ec | bellard | * the old buffer (in the mbuf), so we must point ip
|
347 | f0cbd3ec | bellard | * into the new buffer.
|
348 | f0cbd3ec | bellard | */
|
349 | f0cbd3ec | bellard | if (m->m_flags & M_EXT) {
|
350 | f2ba730e | blueswir1 | int delta = (char *)q - m->m_dat; |
351 | 429d0a3d | blueswir1 | q = (struct ipasfrag *)(m->m_ext + delta);
|
352 | f0cbd3ec | bellard | } |
353 | f0cbd3ec | bellard | |
354 | 429d0a3d | blueswir1 | ip = fragtoip(q); |
355 | f0cbd3ec | bellard | ip->ip_len = next; |
356 | 429d0a3d | blueswir1 | ip->ip_tos &= ~1;
|
357 | 429d0a3d | blueswir1 | ip->ip_src = fp->ipq_src; |
358 | 429d0a3d | blueswir1 | ip->ip_dst = fp->ipq_dst; |
359 | 429d0a3d | blueswir1 | remque(&fp->ip_link); |
360 | 460fec67 | Jan Kiszka | (void) m_free(dtom(slirp, fp));
|
361 | f0cbd3ec | bellard | m->m_len += (ip->ip_hl << 2);
|
362 | f0cbd3ec | bellard | m->m_data -= (ip->ip_hl << 2);
|
363 | f0cbd3ec | bellard | |
364 | 429d0a3d | blueswir1 | return ip;
|
365 | f0cbd3ec | bellard | |
366 | f0cbd3ec | bellard | dropfrag:
|
367 | 3acccfc6 | Jan Kiszka | m_free(m); |
368 | 511d2b14 | blueswir1 | return NULL; |
369 | f0cbd3ec | bellard | } |
370 | f0cbd3ec | bellard | |
371 | f0cbd3ec | bellard | /*
|
372 | f0cbd3ec | bellard | * Free a fragment reassembly header and all
|
373 | f0cbd3ec | bellard | * associated datagrams.
|
374 | f0cbd3ec | bellard | */
|
375 | 9634d903 | blueswir1 | static void |
376 | 460fec67 | Jan Kiszka | ip_freef(Slirp *slirp, struct ipq *fp)
|
377 | f0cbd3ec | bellard | { |
378 | f0cbd3ec | bellard | register struct ipasfrag *q, *p; |
379 | f0cbd3ec | bellard | |
380 | 429d0a3d | blueswir1 | for (q = fp->frag_link.next; q != (struct ipasfrag*)&fp->frag_link; q = p) { |
381 | 429d0a3d | blueswir1 | p = q->ipf_next; |
382 | f0cbd3ec | bellard | ip_deq(q); |
383 | 3acccfc6 | Jan Kiszka | m_free(dtom(slirp, q)); |
384 | f0cbd3ec | bellard | } |
385 | 429d0a3d | blueswir1 | remque(&fp->ip_link); |
386 | 460fec67 | Jan Kiszka | (void) m_free(dtom(slirp, fp));
|
387 | f0cbd3ec | bellard | } |
388 | f0cbd3ec | bellard | |
389 | f0cbd3ec | bellard | /*
|
390 | f0cbd3ec | bellard | * Put an ip fragment on a reassembly chain.
|
391 | f0cbd3ec | bellard | * Like insque, but pointers in middle of structure.
|
392 | f0cbd3ec | bellard | */
|
393 | 9634d903 | blueswir1 | static void |
394 | 9634d903 | blueswir1 | ip_enq(register struct ipasfrag *p, register struct ipasfrag *prev) |
395 | f0cbd3ec | bellard | { |
396 | f0cbd3ec | bellard | DEBUG_CALL("ip_enq");
|
397 | f0cbd3ec | bellard | DEBUG_ARG("prev = %lx", (long)prev); |
398 | 429d0a3d | blueswir1 | p->ipf_prev = prev; |
399 | f0cbd3ec | bellard | p->ipf_next = prev->ipf_next; |
400 | 429d0a3d | blueswir1 | ((struct ipasfrag *)(prev->ipf_next))->ipf_prev = p;
|
401 | 429d0a3d | blueswir1 | prev->ipf_next = p; |
402 | f0cbd3ec | bellard | } |
403 | f0cbd3ec | bellard | |
404 | f0cbd3ec | bellard | /*
|
405 | f0cbd3ec | bellard | * To ip_enq as remque is to insque.
|
406 | f0cbd3ec | bellard | */
|
407 | 9634d903 | blueswir1 | static void |
408 | 9634d903 | blueswir1 | ip_deq(register struct ipasfrag *p) |
409 | f0cbd3ec | bellard | { |
410 | f0cbd3ec | bellard | ((struct ipasfrag *)(p->ipf_prev))->ipf_next = p->ipf_next;
|
411 | f0cbd3ec | bellard | ((struct ipasfrag *)(p->ipf_next))->ipf_prev = p->ipf_prev;
|
412 | f0cbd3ec | bellard | } |
413 | f0cbd3ec | bellard | |
414 | f0cbd3ec | bellard | /*
|
415 | f0cbd3ec | bellard | * IP timer processing;
|
416 | f0cbd3ec | bellard | * if a timer expires on a reassembly
|
417 | f0cbd3ec | bellard | * queue, discard it.
|
418 | f0cbd3ec | bellard | */
|
419 | f0cbd3ec | bellard | void
|
420 | 460fec67 | Jan Kiszka | ip_slowtimo(Slirp *slirp) |
421 | f0cbd3ec | bellard | { |
422 | 429d0a3d | blueswir1 | struct qlink *l;
|
423 | 5fafdf24 | ths | |
424 | f0cbd3ec | bellard | DEBUG_CALL("ip_slowtimo");
|
425 | 5fafdf24 | ths | |
426 | 460fec67 | Jan Kiszka | l = slirp->ipq.ip_link.next; |
427 | 429d0a3d | blueswir1 | |
428 | 511d2b14 | blueswir1 | if (l == NULL) |
429 | f0cbd3ec | bellard | return;
|
430 | f0cbd3ec | bellard | |
431 | 460fec67 | Jan Kiszka | while (l != &slirp->ipq.ip_link) {
|
432 | 429d0a3d | blueswir1 | struct ipq *fp = container_of(l, struct ipq, ip_link); |
433 | 429d0a3d | blueswir1 | l = l->next; |
434 | 429d0a3d | blueswir1 | if (--fp->ipq_ttl == 0) { |
435 | 460fec67 | Jan Kiszka | ip_freef(slirp, fp); |
436 | f0cbd3ec | bellard | } |
437 | 460fec67 | Jan Kiszka | } |
438 | f0cbd3ec | bellard | } |
439 | f0cbd3ec | bellard | |
440 | f0cbd3ec | bellard | /*
|
441 | f0cbd3ec | bellard | * Do option processing on a datagram,
|
442 | f0cbd3ec | bellard | * possibly discarding it if bad options are encountered,
|
443 | f0cbd3ec | bellard | * or forwarding it if source-routed.
|
444 | f0cbd3ec | bellard | * Returns 1 if packet has been forwarded/freed,
|
445 | f0cbd3ec | bellard | * 0 if the packet should be processed further.
|
446 | f0cbd3ec | bellard | */
|
447 | f0cbd3ec | bellard | |
448 | f0cbd3ec | bellard | #ifdef notdef
|
449 | f0cbd3ec | bellard | |
450 | f0cbd3ec | bellard | int
|
451 | f0cbd3ec | bellard | ip_dooptions(m) |
452 | f0cbd3ec | bellard | struct mbuf *m;
|
453 | f0cbd3ec | bellard | { |
454 | f0cbd3ec | bellard | register struct ip *ip = mtod(m, struct ip *); |
455 | f0cbd3ec | bellard | register u_char *cp;
|
456 | f0cbd3ec | bellard | register struct ip_timestamp *ipt; |
457 | f0cbd3ec | bellard | register struct in_ifaddr *ia; |
458 | f0cbd3ec | bellard | int opt, optlen, cnt, off, code, type, forward = 0; |
459 | f0cbd3ec | bellard | struct in_addr *sin, dst;
|
460 | b6dce92e | Stefan Weil | typedef uint32_t n_time;
|
461 | f0cbd3ec | bellard | n_time ntime; |
462 | f0cbd3ec | bellard | |
463 | f0cbd3ec | bellard | dst = ip->ip_dst; |
464 | f0cbd3ec | bellard | cp = (u_char *)(ip + 1);
|
465 | f0cbd3ec | bellard | cnt = (ip->ip_hl << 2) - sizeof (struct ip); |
466 | f0cbd3ec | bellard | for (; cnt > 0; cnt -= optlen, cp += optlen) { |
467 | f0cbd3ec | bellard | opt = cp[IPOPT_OPTVAL]; |
468 | f0cbd3ec | bellard | if (opt == IPOPT_EOL)
|
469 | f0cbd3ec | bellard | break;
|
470 | f0cbd3ec | bellard | if (opt == IPOPT_NOP)
|
471 | f0cbd3ec | bellard | optlen = 1;
|
472 | f0cbd3ec | bellard | else {
|
473 | f0cbd3ec | bellard | optlen = cp[IPOPT_OLEN]; |
474 | f0cbd3ec | bellard | if (optlen <= 0 || optlen > cnt) { |
475 | f0cbd3ec | bellard | code = &cp[IPOPT_OLEN] - (u_char *)ip; |
476 | f0cbd3ec | bellard | goto bad;
|
477 | f0cbd3ec | bellard | } |
478 | f0cbd3ec | bellard | } |
479 | f0cbd3ec | bellard | switch (opt) {
|
480 | f0cbd3ec | bellard | |
481 | f0cbd3ec | bellard | default:
|
482 | f0cbd3ec | bellard | break;
|
483 | f0cbd3ec | bellard | |
484 | f0cbd3ec | bellard | /*
|
485 | f0cbd3ec | bellard | * Source routing with record.
|
486 | f0cbd3ec | bellard | * Find interface with current destination address.
|
487 | f0cbd3ec | bellard | * If none on this machine then drop if strictly routed,
|
488 | f0cbd3ec | bellard | * or do nothing if loosely routed.
|
489 | f0cbd3ec | bellard | * Record interface address and bring up next address
|
490 | f0cbd3ec | bellard | * component. If strictly routed make sure next
|
491 | f0cbd3ec | bellard | * address is on directly accessible net.
|
492 | f0cbd3ec | bellard | */
|
493 | f0cbd3ec | bellard | case IPOPT_LSRR:
|
494 | f0cbd3ec | bellard | case IPOPT_SSRR:
|
495 | f0cbd3ec | bellard | if ((off = cp[IPOPT_OFFSET]) < IPOPT_MINOFF) {
|
496 | f0cbd3ec | bellard | code = &cp[IPOPT_OFFSET] - (u_char *)ip; |
497 | f0cbd3ec | bellard | goto bad;
|
498 | f0cbd3ec | bellard | } |
499 | f0cbd3ec | bellard | ipaddr.sin_addr = ip->ip_dst; |
500 | f0cbd3ec | bellard | ia = (struct in_ifaddr *)
|
501 | f0cbd3ec | bellard | ifa_ifwithaddr((struct sockaddr *)&ipaddr);
|
502 | f0cbd3ec | bellard | if (ia == 0) { |
503 | f0cbd3ec | bellard | if (opt == IPOPT_SSRR) {
|
504 | f0cbd3ec | bellard | type = ICMP_UNREACH; |
505 | f0cbd3ec | bellard | code = ICMP_UNREACH_SRCFAIL; |
506 | f0cbd3ec | bellard | goto bad;
|
507 | f0cbd3ec | bellard | } |
508 | f0cbd3ec | bellard | /*
|
509 | f0cbd3ec | bellard | * Loose routing, and not at next destination
|
510 | f0cbd3ec | bellard | * yet; nothing to do except forward.
|
511 | f0cbd3ec | bellard | */
|
512 | f0cbd3ec | bellard | break;
|
513 | f0cbd3ec | bellard | } |
514 | cf2846b5 | Stefan Weil | off--; /* 0 origin */
|
515 | f0cbd3ec | bellard | if (off > optlen - sizeof(struct in_addr)) { |
516 | f0cbd3ec | bellard | /*
|
517 | f0cbd3ec | bellard | * End of source route. Should be for us.
|
518 | f0cbd3ec | bellard | */
|
519 | f0cbd3ec | bellard | save_rte(cp, ip->ip_src); |
520 | f0cbd3ec | bellard | break;
|
521 | f0cbd3ec | bellard | } |
522 | f0cbd3ec | bellard | /*
|
523 | f0cbd3ec | bellard | * locate outgoing interface
|
524 | f0cbd3ec | bellard | */
|
525 | f0cbd3ec | bellard | bcopy((caddr_t)(cp + off), (caddr_t)&ipaddr.sin_addr, |
526 | f0cbd3ec | bellard | sizeof(ipaddr.sin_addr));
|
527 | f0cbd3ec | bellard | if (opt == IPOPT_SSRR) {
|
528 | f0cbd3ec | bellard | #define INA struct in_ifaddr * |
529 | f0cbd3ec | bellard | #define SA struct sockaddr * |
530 | f0cbd3ec | bellard | if ((ia = (INA)ifa_ifwithdstaddr((SA)&ipaddr)) == 0) |
531 | f0cbd3ec | bellard | ia = (INA)ifa_ifwithnet((SA)&ipaddr); |
532 | f0cbd3ec | bellard | } else
|
533 | f0cbd3ec | bellard | ia = ip_rtaddr(ipaddr.sin_addr); |
534 | f0cbd3ec | bellard | if (ia == 0) { |
535 | f0cbd3ec | bellard | type = ICMP_UNREACH; |
536 | f0cbd3ec | bellard | code = ICMP_UNREACH_SRCFAIL; |
537 | f0cbd3ec | bellard | goto bad;
|
538 | f0cbd3ec | bellard | } |
539 | f0cbd3ec | bellard | ip->ip_dst = ipaddr.sin_addr; |
540 | f0cbd3ec | bellard | bcopy((caddr_t)&(IA_SIN(ia)->sin_addr), |
541 | f0cbd3ec | bellard | (caddr_t)(cp + off), sizeof(struct in_addr)); |
542 | f0cbd3ec | bellard | cp[IPOPT_OFFSET] += sizeof(struct in_addr); |
543 | f0cbd3ec | bellard | /*
|
544 | f0cbd3ec | bellard | * Let ip_intr's mcast routing check handle mcast pkts
|
545 | f0cbd3ec | bellard | */
|
546 | f0cbd3ec | bellard | forward = !IN_MULTICAST(ntohl(ip->ip_dst.s_addr)); |
547 | f0cbd3ec | bellard | break;
|
548 | f0cbd3ec | bellard | |
549 | f0cbd3ec | bellard | case IPOPT_RR:
|
550 | f0cbd3ec | bellard | if ((off = cp[IPOPT_OFFSET]) < IPOPT_MINOFF) {
|
551 | f0cbd3ec | bellard | code = &cp[IPOPT_OFFSET] - (u_char *)ip; |
552 | f0cbd3ec | bellard | goto bad;
|
553 | f0cbd3ec | bellard | } |
554 | f0cbd3ec | bellard | /*
|
555 | f0cbd3ec | bellard | * If no space remains, ignore.
|
556 | f0cbd3ec | bellard | */
|
557 | cf2846b5 | Stefan Weil | off--; /* 0 origin */
|
558 | f0cbd3ec | bellard | if (off > optlen - sizeof(struct in_addr)) |
559 | f0cbd3ec | bellard | break;
|
560 | f0cbd3ec | bellard | bcopy((caddr_t)(&ip->ip_dst), (caddr_t)&ipaddr.sin_addr, |
561 | f0cbd3ec | bellard | sizeof(ipaddr.sin_addr));
|
562 | f0cbd3ec | bellard | /*
|
563 | f0cbd3ec | bellard | * locate outgoing interface; if we're the destination,
|
564 | f0cbd3ec | bellard | * use the incoming interface (should be same).
|
565 | f0cbd3ec | bellard | */
|
566 | f0cbd3ec | bellard | if ((ia = (INA)ifa_ifwithaddr((SA)&ipaddr)) == 0 && |
567 | f0cbd3ec | bellard | (ia = ip_rtaddr(ipaddr.sin_addr)) == 0) {
|
568 | f0cbd3ec | bellard | type = ICMP_UNREACH; |
569 | f0cbd3ec | bellard | code = ICMP_UNREACH_HOST; |
570 | f0cbd3ec | bellard | goto bad;
|
571 | f0cbd3ec | bellard | } |
572 | f0cbd3ec | bellard | bcopy((caddr_t)&(IA_SIN(ia)->sin_addr), |
573 | f0cbd3ec | bellard | (caddr_t)(cp + off), sizeof(struct in_addr)); |
574 | f0cbd3ec | bellard | cp[IPOPT_OFFSET] += sizeof(struct in_addr); |
575 | f0cbd3ec | bellard | break;
|
576 | f0cbd3ec | bellard | |
577 | f0cbd3ec | bellard | case IPOPT_TS:
|
578 | f0cbd3ec | bellard | code = cp - (u_char *)ip; |
579 | f0cbd3ec | bellard | ipt = (struct ip_timestamp *)cp;
|
580 | f0cbd3ec | bellard | if (ipt->ipt_len < 5) |
581 | f0cbd3ec | bellard | goto bad;
|
582 | f0cbd3ec | bellard | if (ipt->ipt_ptr > ipt->ipt_len - sizeof (int32_t)) { |
583 | f0cbd3ec | bellard | if (++ipt->ipt_oflw == 0) |
584 | f0cbd3ec | bellard | goto bad;
|
585 | f0cbd3ec | bellard | break;
|
586 | f0cbd3ec | bellard | } |
587 | f0cbd3ec | bellard | sin = (struct in_addr *)(cp + ipt->ipt_ptr - 1); |
588 | f0cbd3ec | bellard | switch (ipt->ipt_flg) {
|
589 | f0cbd3ec | bellard | |
590 | f0cbd3ec | bellard | case IPOPT_TS_TSONLY:
|
591 | f0cbd3ec | bellard | break;
|
592 | f0cbd3ec | bellard | |
593 | f0cbd3ec | bellard | case IPOPT_TS_TSANDADDR:
|
594 | f0cbd3ec | bellard | if (ipt->ipt_ptr + sizeof(n_time) + |
595 | f0cbd3ec | bellard | sizeof(struct in_addr) > ipt->ipt_len) |
596 | f0cbd3ec | bellard | goto bad;
|
597 | f0cbd3ec | bellard | ipaddr.sin_addr = dst; |
598 | f0cbd3ec | bellard | ia = (INA)ifaof_ i f p foraddr((SA)&ipaddr, |
599 | f0cbd3ec | bellard | m->m_pkthdr.rcvif); |
600 | f0cbd3ec | bellard | if (ia == 0) |
601 | f0cbd3ec | bellard | continue;
|
602 | f0cbd3ec | bellard | bcopy((caddr_t)&IA_SIN(ia)->sin_addr, |
603 | f0cbd3ec | bellard | (caddr_t)sin, sizeof(struct in_addr)); |
604 | f0cbd3ec | bellard | ipt->ipt_ptr += sizeof(struct in_addr); |
605 | f0cbd3ec | bellard | break;
|
606 | f0cbd3ec | bellard | |
607 | f0cbd3ec | bellard | case IPOPT_TS_PRESPEC:
|
608 | f0cbd3ec | bellard | if (ipt->ipt_ptr + sizeof(n_time) + |
609 | f0cbd3ec | bellard | sizeof(struct in_addr) > ipt->ipt_len) |
610 | f0cbd3ec | bellard | goto bad;
|
611 | f0cbd3ec | bellard | bcopy((caddr_t)sin, (caddr_t)&ipaddr.sin_addr, |
612 | f0cbd3ec | bellard | sizeof(struct in_addr)); |
613 | f0cbd3ec | bellard | if (ifa_ifwithaddr((SA)&ipaddr) == 0) |
614 | f0cbd3ec | bellard | continue;
|
615 | f0cbd3ec | bellard | ipt->ipt_ptr += sizeof(struct in_addr); |
616 | f0cbd3ec | bellard | break;
|
617 | f0cbd3ec | bellard | |
618 | f0cbd3ec | bellard | default:
|
619 | f0cbd3ec | bellard | goto bad;
|
620 | f0cbd3ec | bellard | } |
621 | f0cbd3ec | bellard | ntime = iptime(); |
622 | f0cbd3ec | bellard | bcopy((caddr_t)&ntime, (caddr_t)cp + ipt->ipt_ptr - 1,
|
623 | f0cbd3ec | bellard | sizeof(n_time));
|
624 | f0cbd3ec | bellard | ipt->ipt_ptr += sizeof(n_time);
|
625 | f0cbd3ec | bellard | } |
626 | f0cbd3ec | bellard | } |
627 | f0cbd3ec | bellard | if (forward) {
|
628 | f0cbd3ec | bellard | ip_forward(m, 1);
|
629 | f0cbd3ec | bellard | return (1); |
630 | f0cbd3ec | bellard | } |
631 | f0cbd3ec | bellard | return (0); |
632 | f0cbd3ec | bellard | bad:
|
633 | f0cbd3ec | bellard | icmp_error(m, type, code, 0, 0); |
634 | f0cbd3ec | bellard | |
635 | f0cbd3ec | bellard | return (1); |
636 | f0cbd3ec | bellard | } |
637 | f0cbd3ec | bellard | |
638 | f0cbd3ec | bellard | #endif /* notdef */ |
639 | f0cbd3ec | bellard | |
640 | f0cbd3ec | bellard | /*
|
641 | f0cbd3ec | bellard | * Strip out IP options, at higher
|
642 | f0cbd3ec | bellard | * level protocol in the kernel.
|
643 | f0cbd3ec | bellard | * Second argument is buffer to which options
|
644 | f0cbd3ec | bellard | * will be moved, and return value is their length.
|
645 | f0cbd3ec | bellard | * (XXX) should be deleted; last arg currently ignored.
|
646 | f0cbd3ec | bellard | */
|
647 | f0cbd3ec | bellard | void
|
648 | 511d2b14 | blueswir1 | ip_stripoptions(register struct mbuf *m, struct mbuf *mopt) |
649 | f0cbd3ec | bellard | { |
650 | f0cbd3ec | bellard | register int i; |
651 | f0cbd3ec | bellard | struct ip *ip = mtod(m, struct ip *); |
652 | f0cbd3ec | bellard | register caddr_t opts;
|
653 | f0cbd3ec | bellard | int olen;
|
654 | f0cbd3ec | bellard | |
655 | f0cbd3ec | bellard | olen = (ip->ip_hl<<2) - sizeof (struct ip); |
656 | f0cbd3ec | bellard | opts = (caddr_t)(ip + 1);
|
657 | f0cbd3ec | bellard | i = m->m_len - (sizeof (struct ip) + olen); |
658 | f0cbd3ec | bellard | memcpy(opts, opts + olen, (unsigned)i);
|
659 | f0cbd3ec | bellard | m->m_len -= olen; |
660 | 5fafdf24 | ths | |
661 | f0cbd3ec | bellard | ip->ip_hl = sizeof(struct ip) >> 2; |
662 | f0cbd3ec | bellard | } |