Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * INET An implementation of the TCP/IP protocol suite for the LINUX | |
3 | * operating system. INET is implemented using the BSD Socket | |
4 | * interface as the means of communication with the user level. | |
5 | * | |
6 | * The IP fragmentation functionality. | |
e905a9ed | 7 | * |
1da177e4 LT |
8 | * Authors: Fred N. van Kempen <waltje@uWalt.NL.Mugnet.ORG> |
9 | * Alan Cox <Alan.Cox@linux.org> | |
10 | * | |
11 | * Fixes: | |
12 | * Alan Cox : Split from ip.c , see ip_input.c for history. | |
13 | * David S. Miller : Begin massive cleanup... | |
14 | * Andi Kleen : Add sysctls. | |
15 | * xxxx : Overlapfrag bug. | |
16 | * Ultima : ip_expire() kernel panic. | |
17 | * Bill Hawes : Frag accounting and evictor fixes. | |
18 | * John McDonald : 0 length frag bug. | |
19 | * Alexey Kuznetsov: SMP races, threading, cleanup. | |
20 | * Patrick McHardy : LRU queue of frag heads for evictor. | |
21 | */ | |
22 | ||
89cee8b1 | 23 | #include <linux/compiler.h> |
1da177e4 LT |
24 | #include <linux/module.h> |
25 | #include <linux/types.h> | |
26 | #include <linux/mm.h> | |
27 | #include <linux/jiffies.h> | |
28 | #include <linux/skbuff.h> | |
29 | #include <linux/list.h> | |
30 | #include <linux/ip.h> | |
31 | #include <linux/icmp.h> | |
32 | #include <linux/netdevice.h> | |
33 | #include <linux/jhash.h> | |
34 | #include <linux/random.h> | |
35 | #include <net/sock.h> | |
36 | #include <net/ip.h> | |
37 | #include <net/icmp.h> | |
38 | #include <net/checksum.h> | |
89cee8b1 | 39 | #include <net/inetpeer.h> |
5ab11c98 | 40 | #include <net/inet_frag.h> |
1da177e4 LT |
41 | #include <linux/tcp.h> |
42 | #include <linux/udp.h> | |
43 | #include <linux/inet.h> | |
44 | #include <linux/netfilter_ipv4.h> | |
45 | ||
46 | /* NOTE. Logic of IP defragmentation is parallel to corresponding IPv6 | |
47 | * code now. If you change something here, _PLEASE_ update ipv6/reassembly.c | |
48 | * as well. Or notify me, at least. --ANK | |
49 | */ | |
50 | ||
8d8354d2 | 51 | static int sysctl_ipfrag_max_dist __read_mostly = 64; |
89cee8b1 | 52 | |
1da177e4 LT |
53 | struct ipfrag_skb_cb |
54 | { | |
55 | struct inet_skb_parm h; | |
56 | int offset; | |
57 | }; | |
58 | ||
59 | #define FRAG_CB(skb) ((struct ipfrag_skb_cb*)((skb)->cb)) | |
60 | ||
61 | /* Describe an entry in the "incomplete datagrams" queue. */ | |
62 | struct ipq { | |
5ab11c98 PE |
63 | struct inet_frag_queue q; |
64 | ||
1da177e4 | 65 | u32 user; |
18277770 AV |
66 | __be32 saddr; |
67 | __be32 daddr; | |
68 | __be16 id; | |
1da177e4 | 69 | u8 protocol; |
89cee8b1 HX |
70 | int iif; |
71 | unsigned int rid; | |
72 | struct inet_peer *peer; | |
1da177e4 LT |
73 | }; |
74 | ||
7eb95156 | 75 | static struct inet_frags ip4_frags; |
1da177e4 | 76 | |
e5a2bb84 | 77 | int ip_frag_nqueues(struct net *net) |
7eb95156 | 78 | { |
e5a2bb84 | 79 | return net->ipv4.frags.nqueues; |
7eb95156 | 80 | } |
1da177e4 | 81 | |
6ddc0822 | 82 | int ip_frag_mem(struct net *net) |
7eb95156 | 83 | { |
6ddc0822 | 84 | return atomic_read(&net->ipv4.frags.mem); |
7eb95156 | 85 | } |
1da177e4 | 86 | |
1706d587 HX |
87 | static int ip_frag_reasm(struct ipq *qp, struct sk_buff *prev, |
88 | struct net_device *dev); | |
89 | ||
c6fda282 PE |
90 | struct ip4_create_arg { |
91 | struct iphdr *iph; | |
92 | u32 user; | |
93 | }; | |
94 | ||
18277770 | 95 | static unsigned int ipqhashfn(__be16 id, __be32 saddr, __be32 daddr, u8 prot) |
1da177e4 | 96 | { |
18277770 AV |
97 | return jhash_3words((__force u32)id << 16 | prot, |
98 | (__force u32)saddr, (__force u32)daddr, | |
7eb95156 | 99 | ip4_frags.rnd) & (INETFRAGS_HASHSZ - 1); |
1da177e4 LT |
100 | } |
101 | ||
321a3a99 | 102 | static unsigned int ip4_hashfn(struct inet_frag_queue *q) |
1da177e4 | 103 | { |
321a3a99 | 104 | struct ipq *ipq; |
1da177e4 | 105 | |
321a3a99 PE |
106 | ipq = container_of(q, struct ipq, q); |
107 | return ipqhashfn(ipq->id, ipq->saddr, ipq->daddr, ipq->protocol); | |
1da177e4 LT |
108 | } |
109 | ||
abd6523d PE |
110 | static int ip4_frag_match(struct inet_frag_queue *q, void *a) |
111 | { | |
112 | struct ipq *qp; | |
113 | struct ip4_create_arg *arg = a; | |
114 | ||
115 | qp = container_of(q, struct ipq, q); | |
116 | return (qp->id == arg->iph->id && | |
117 | qp->saddr == arg->iph->saddr && | |
118 | qp->daddr == arg->iph->daddr && | |
119 | qp->protocol == arg->iph->protocol && | |
120 | qp->user == arg->user); | |
121 | } | |
122 | ||
1da177e4 | 123 | /* Memory Tracking Functions. */ |
6ddc0822 PE |
124 | static __inline__ void frag_kfree_skb(struct netns_frags *nf, |
125 | struct sk_buff *skb, int *work) | |
1da177e4 LT |
126 | { |
127 | if (work) | |
128 | *work -= skb->truesize; | |
6ddc0822 | 129 | atomic_sub(skb->truesize, &nf->mem); |
1da177e4 LT |
130 | kfree_skb(skb); |
131 | } | |
132 | ||
c6fda282 PE |
133 | static void ip4_frag_init(struct inet_frag_queue *q, void *a) |
134 | { | |
135 | struct ipq *qp = container_of(q, struct ipq, q); | |
136 | struct ip4_create_arg *arg = a; | |
137 | ||
138 | qp->protocol = arg->iph->protocol; | |
139 | qp->id = arg->iph->id; | |
140 | qp->saddr = arg->iph->saddr; | |
141 | qp->daddr = arg->iph->daddr; | |
142 | qp->user = arg->user; | |
143 | qp->peer = sysctl_ipfrag_max_dist ? | |
144 | inet_getpeer(arg->iph->saddr, 1) : NULL; | |
145 | } | |
146 | ||
1e4b8287 | 147 | static __inline__ void ip4_frag_free(struct inet_frag_queue *q) |
1da177e4 | 148 | { |
1e4b8287 PE |
149 | struct ipq *qp; |
150 | ||
151 | qp = container_of(q, struct ipq, q); | |
152 | if (qp->peer) | |
153 | inet_putpeer(qp->peer); | |
1da177e4 LT |
154 | } |
155 | ||
1da177e4 LT |
156 | |
157 | /* Destruction primitives. */ | |
158 | ||
4b6cb5d8 | 159 | static __inline__ void ipq_put(struct ipq *ipq) |
1da177e4 | 160 | { |
762cc408 | 161 | inet_frag_put(&ipq->q, &ip4_frags); |
1da177e4 LT |
162 | } |
163 | ||
164 | /* Kill ipq entry. It is not destroyed immediately, | |
165 | * because caller (and someone more) holds reference count. | |
166 | */ | |
167 | static void ipq_kill(struct ipq *ipq) | |
168 | { | |
277e650d | 169 | inet_frag_kill(&ipq->q, &ip4_frags); |
1da177e4 LT |
170 | } |
171 | ||
e905a9ed | 172 | /* Memory limiting on fragments. Evictor trashes the oldest |
1da177e4 LT |
173 | * fragment queue until we are back under the threshold. |
174 | */ | |
6ddc0822 | 175 | static void ip_evictor(struct net *net) |
1da177e4 | 176 | { |
8e7999c4 PE |
177 | int evicted; |
178 | ||
6ddc0822 | 179 | evicted = inet_frag_evictor(&net->ipv4.frags, &ip4_frags); |
8e7999c4 PE |
180 | if (evicted) |
181 | IP_ADD_STATS_BH(IPSTATS_MIB_REASMFAILS, evicted); | |
1da177e4 LT |
182 | } |
183 | ||
184 | /* | |
185 | * Oops, a fragment queue timed out. Kill it and send an ICMP reply. | |
186 | */ | |
187 | static void ip_expire(unsigned long arg) | |
188 | { | |
e521db9d PE |
189 | struct ipq *qp; |
190 | ||
191 | qp = container_of((struct inet_frag_queue *) arg, struct ipq, q); | |
1da177e4 | 192 | |
5ab11c98 | 193 | spin_lock(&qp->q.lock); |
1da177e4 | 194 | |
bc578a54 | 195 | if (qp->q.last_in & INET_FRAG_COMPLETE) |
1da177e4 LT |
196 | goto out; |
197 | ||
198 | ipq_kill(qp); | |
199 | ||
200 | IP_INC_STATS_BH(IPSTATS_MIB_REASMTIMEOUT); | |
201 | IP_INC_STATS_BH(IPSTATS_MIB_REASMFAILS); | |
202 | ||
bc578a54 | 203 | if ((qp->q.last_in & INET_FRAG_FIRST_IN) && qp->q.fragments != NULL) { |
5ab11c98 | 204 | struct sk_buff *head = qp->q.fragments; |
cb84663e DL |
205 | struct net *net; |
206 | ||
207 | net = container_of(qp->q.net, struct net, ipv4.frags); | |
1da177e4 | 208 | /* Send an ICMP "Fragment Reassembly Timeout" message. */ |
cb84663e | 209 | if ((head->dev = dev_get_by_index(net, qp->iif)) != NULL) { |
1da177e4 LT |
210 | icmp_send(head, ICMP_TIME_EXCEEDED, ICMP_EXC_FRAGTIME, 0); |
211 | dev_put(head->dev); | |
212 | } | |
213 | } | |
214 | out: | |
5ab11c98 | 215 | spin_unlock(&qp->q.lock); |
4b6cb5d8 | 216 | ipq_put(qp); |
1da177e4 LT |
217 | } |
218 | ||
abd6523d PE |
219 | /* Find the correct entry in the "incomplete datagrams" queue for |
220 | * this IP datagram, and create new one, if nothing is found. | |
221 | */ | |
ac18e750 | 222 | static inline struct ipq *ip_find(struct net *net, struct iphdr *iph, u32 user) |
1da177e4 | 223 | { |
c6fda282 PE |
224 | struct inet_frag_queue *q; |
225 | struct ip4_create_arg arg; | |
abd6523d | 226 | unsigned int hash; |
1da177e4 | 227 | |
c6fda282 PE |
228 | arg.iph = iph; |
229 | arg.user = user; | |
abd6523d | 230 | hash = ipqhashfn(iph->id, iph->saddr, iph->daddr, iph->protocol); |
1da177e4 | 231 | |
ac18e750 | 232 | q = inet_frag_find(&net->ipv4.frags, &ip4_frags, &arg, hash); |
c6fda282 PE |
233 | if (q == NULL) |
234 | goto out_nomem; | |
1da177e4 | 235 | |
c6fda282 | 236 | return container_of(q, struct ipq, q); |
1da177e4 LT |
237 | |
238 | out_nomem: | |
64ce2073 | 239 | LIMIT_NETDEBUG(KERN_ERR "ip_frag_create: no memory left !\n"); |
1da177e4 LT |
240 | return NULL; |
241 | } | |
242 | ||
89cee8b1 HX |
243 | /* Is the fragment too far ahead to be part of ipq? */ |
244 | static inline int ip_frag_too_far(struct ipq *qp) | |
245 | { | |
246 | struct inet_peer *peer = qp->peer; | |
247 | unsigned int max = sysctl_ipfrag_max_dist; | |
248 | unsigned int start, end; | |
249 | ||
250 | int rc; | |
251 | ||
252 | if (!peer || !max) | |
253 | return 0; | |
254 | ||
255 | start = qp->rid; | |
256 | end = atomic_inc_return(&peer->rid); | |
257 | qp->rid = end; | |
258 | ||
5ab11c98 | 259 | rc = qp->q.fragments && (end - start) > max; |
89cee8b1 HX |
260 | |
261 | if (rc) { | |
262 | IP_INC_STATS_BH(IPSTATS_MIB_REASMFAILS); | |
263 | } | |
264 | ||
265 | return rc; | |
266 | } | |
267 | ||
268 | static int ip_frag_reinit(struct ipq *qp) | |
269 | { | |
270 | struct sk_buff *fp; | |
271 | ||
b2fd5321 | 272 | if (!mod_timer(&qp->q.timer, jiffies + qp->q.net->timeout)) { |
5ab11c98 | 273 | atomic_inc(&qp->q.refcnt); |
89cee8b1 HX |
274 | return -ETIMEDOUT; |
275 | } | |
276 | ||
5ab11c98 | 277 | fp = qp->q.fragments; |
89cee8b1 HX |
278 | do { |
279 | struct sk_buff *xp = fp->next; | |
6ddc0822 | 280 | frag_kfree_skb(qp->q.net, fp, NULL); |
89cee8b1 HX |
281 | fp = xp; |
282 | } while (fp); | |
283 | ||
5ab11c98 PE |
284 | qp->q.last_in = 0; |
285 | qp->q.len = 0; | |
286 | qp->q.meat = 0; | |
287 | qp->q.fragments = NULL; | |
89cee8b1 HX |
288 | qp->iif = 0; |
289 | ||
290 | return 0; | |
291 | } | |
292 | ||
1da177e4 | 293 | /* Add new segment to existing queue. */ |
1706d587 | 294 | static int ip_frag_queue(struct ipq *qp, struct sk_buff *skb) |
1da177e4 LT |
295 | { |
296 | struct sk_buff *prev, *next; | |
1706d587 | 297 | struct net_device *dev; |
1da177e4 LT |
298 | int flags, offset; |
299 | int ihl, end; | |
1706d587 | 300 | int err = -ENOENT; |
1da177e4 | 301 | |
bc578a54 | 302 | if (qp->q.last_in & INET_FRAG_COMPLETE) |
1da177e4 LT |
303 | goto err; |
304 | ||
89cee8b1 | 305 | if (!(IPCB(skb)->flags & IPSKB_FRAG_COMPLETE) && |
1706d587 HX |
306 | unlikely(ip_frag_too_far(qp)) && |
307 | unlikely(err = ip_frag_reinit(qp))) { | |
89cee8b1 HX |
308 | ipq_kill(qp); |
309 | goto err; | |
310 | } | |
311 | ||
eddc9ec5 | 312 | offset = ntohs(ip_hdr(skb)->frag_off); |
1da177e4 LT |
313 | flags = offset & ~IP_OFFSET; |
314 | offset &= IP_OFFSET; | |
315 | offset <<= 3; /* offset is in 8-byte chunks */ | |
c9bdd4b5 | 316 | ihl = ip_hdrlen(skb); |
1da177e4 LT |
317 | |
318 | /* Determine the position of this fragment. */ | |
e905a9ed | 319 | end = offset + skb->len - ihl; |
1706d587 | 320 | err = -EINVAL; |
1da177e4 LT |
321 | |
322 | /* Is this the final fragment? */ | |
323 | if ((flags & IP_MF) == 0) { | |
324 | /* If we already have some bits beyond end | |
325 | * or have different end, the segment is corrrupted. | |
326 | */ | |
5ab11c98 | 327 | if (end < qp->q.len || |
bc578a54 | 328 | ((qp->q.last_in & INET_FRAG_LAST_IN) && end != qp->q.len)) |
1da177e4 | 329 | goto err; |
bc578a54 | 330 | qp->q.last_in |= INET_FRAG_LAST_IN; |
5ab11c98 | 331 | qp->q.len = end; |
1da177e4 LT |
332 | } else { |
333 | if (end&7) { | |
334 | end &= ~7; | |
335 | if (skb->ip_summed != CHECKSUM_UNNECESSARY) | |
336 | skb->ip_summed = CHECKSUM_NONE; | |
337 | } | |
5ab11c98 | 338 | if (end > qp->q.len) { |
1da177e4 | 339 | /* Some bits beyond end -> corruption. */ |
bc578a54 | 340 | if (qp->q.last_in & INET_FRAG_LAST_IN) |
1da177e4 | 341 | goto err; |
5ab11c98 | 342 | qp->q.len = end; |
1da177e4 LT |
343 | } |
344 | } | |
345 | if (end == offset) | |
346 | goto err; | |
347 | ||
1706d587 | 348 | err = -ENOMEM; |
1da177e4 LT |
349 | if (pskb_pull(skb, ihl) == NULL) |
350 | goto err; | |
1706d587 HX |
351 | |
352 | err = pskb_trim_rcsum(skb, end - offset); | |
353 | if (err) | |
1da177e4 LT |
354 | goto err; |
355 | ||
356 | /* Find out which fragments are in front and at the back of us | |
357 | * in the chain of fragments so far. We must know where to put | |
358 | * this fragment, right? | |
359 | */ | |
360 | prev = NULL; | |
5ab11c98 | 361 | for (next = qp->q.fragments; next != NULL; next = next->next) { |
1da177e4 LT |
362 | if (FRAG_CB(next)->offset >= offset) |
363 | break; /* bingo! */ | |
364 | prev = next; | |
365 | } | |
366 | ||
367 | /* We found where to put this one. Check for overlap with | |
368 | * preceding fragment, and, if needed, align things so that | |
369 | * any overlaps are eliminated. | |
370 | */ | |
371 | if (prev) { | |
372 | int i = (FRAG_CB(prev)->offset + prev->len) - offset; | |
373 | ||
374 | if (i > 0) { | |
375 | offset += i; | |
1706d587 | 376 | err = -EINVAL; |
1da177e4 LT |
377 | if (end <= offset) |
378 | goto err; | |
1706d587 | 379 | err = -ENOMEM; |
1da177e4 LT |
380 | if (!pskb_pull(skb, i)) |
381 | goto err; | |
382 | if (skb->ip_summed != CHECKSUM_UNNECESSARY) | |
383 | skb->ip_summed = CHECKSUM_NONE; | |
384 | } | |
385 | } | |
386 | ||
1706d587 HX |
387 | err = -ENOMEM; |
388 | ||
1da177e4 LT |
389 | while (next && FRAG_CB(next)->offset < end) { |
390 | int i = end - FRAG_CB(next)->offset; /* overlap is 'i' bytes */ | |
391 | ||
392 | if (i < next->len) { | |
393 | /* Eat head of the next overlapped fragment | |
394 | * and leave the loop. The next ones cannot overlap. | |
395 | */ | |
396 | if (!pskb_pull(next, i)) | |
397 | goto err; | |
398 | FRAG_CB(next)->offset += i; | |
5ab11c98 | 399 | qp->q.meat -= i; |
1da177e4 LT |
400 | if (next->ip_summed != CHECKSUM_UNNECESSARY) |
401 | next->ip_summed = CHECKSUM_NONE; | |
402 | break; | |
403 | } else { | |
404 | struct sk_buff *free_it = next; | |
405 | ||
47c6bf77 | 406 | /* Old fragment is completely overridden with |
1da177e4 LT |
407 | * new one drop it. |
408 | */ | |
409 | next = next->next; | |
410 | ||
411 | if (prev) | |
412 | prev->next = next; | |
413 | else | |
5ab11c98 | 414 | qp->q.fragments = next; |
1da177e4 | 415 | |
5ab11c98 | 416 | qp->q.meat -= free_it->len; |
6ddc0822 | 417 | frag_kfree_skb(qp->q.net, free_it, NULL); |
1da177e4 LT |
418 | } |
419 | } | |
420 | ||
421 | FRAG_CB(skb)->offset = offset; | |
422 | ||
423 | /* Insert this fragment in the chain of fragments. */ | |
424 | skb->next = next; | |
425 | if (prev) | |
426 | prev->next = skb; | |
427 | else | |
5ab11c98 | 428 | qp->q.fragments = skb; |
1da177e4 | 429 | |
1706d587 HX |
430 | dev = skb->dev; |
431 | if (dev) { | |
432 | qp->iif = dev->ifindex; | |
433 | skb->dev = NULL; | |
434 | } | |
5ab11c98 PE |
435 | qp->q.stamp = skb->tstamp; |
436 | qp->q.meat += skb->len; | |
6ddc0822 | 437 | atomic_add(skb->truesize, &qp->q.net->mem); |
1da177e4 | 438 | if (offset == 0) |
bc578a54 | 439 | qp->q.last_in |= INET_FRAG_FIRST_IN; |
1da177e4 | 440 | |
bc578a54 JP |
441 | if (qp->q.last_in == (INET_FRAG_FIRST_IN | INET_FRAG_LAST_IN) && |
442 | qp->q.meat == qp->q.len) | |
1706d587 HX |
443 | return ip_frag_reasm(qp, prev, dev); |
444 | ||
7eb95156 | 445 | write_lock(&ip4_frags.lock); |
3140c25c | 446 | list_move_tail(&qp->q.lru_list, &qp->q.net->lru_list); |
7eb95156 | 447 | write_unlock(&ip4_frags.lock); |
1706d587 | 448 | return -EINPROGRESS; |
1da177e4 LT |
449 | |
450 | err: | |
451 | kfree_skb(skb); | |
1706d587 | 452 | return err; |
1da177e4 LT |
453 | } |
454 | ||
455 | ||
456 | /* Build a new IP datagram from all its fragments. */ | |
457 | ||
1706d587 HX |
458 | static int ip_frag_reasm(struct ipq *qp, struct sk_buff *prev, |
459 | struct net_device *dev) | |
1da177e4 LT |
460 | { |
461 | struct iphdr *iph; | |
5ab11c98 | 462 | struct sk_buff *fp, *head = qp->q.fragments; |
1da177e4 LT |
463 | int len; |
464 | int ihlen; | |
1706d587 | 465 | int err; |
1da177e4 LT |
466 | |
467 | ipq_kill(qp); | |
468 | ||
1706d587 HX |
469 | /* Make the one we just received the head. */ |
470 | if (prev) { | |
471 | head = prev->next; | |
472 | fp = skb_clone(head, GFP_ATOMIC); | |
1706d587 HX |
473 | if (!fp) |
474 | goto out_nomem; | |
475 | ||
476 | fp->next = head->next; | |
477 | prev->next = fp; | |
478 | ||
5ab11c98 PE |
479 | skb_morph(head, qp->q.fragments); |
480 | head->next = qp->q.fragments->next; | |
1706d587 | 481 | |
5ab11c98 PE |
482 | kfree_skb(qp->q.fragments); |
483 | qp->q.fragments = head; | |
1706d587 HX |
484 | } |
485 | ||
1da177e4 LT |
486 | BUG_TRAP(head != NULL); |
487 | BUG_TRAP(FRAG_CB(head)->offset == 0); | |
488 | ||
489 | /* Allocate a new buffer for the datagram. */ | |
c9bdd4b5 | 490 | ihlen = ip_hdrlen(head); |
5ab11c98 | 491 | len = ihlen + qp->q.len; |
1da177e4 | 492 | |
1706d587 | 493 | err = -E2BIG; |
132adf54 | 494 | if (len > 65535) |
1da177e4 LT |
495 | goto out_oversize; |
496 | ||
497 | /* Head of list must not be cloned. */ | |
498 | if (skb_cloned(head) && pskb_expand_head(head, 0, 0, GFP_ATOMIC)) | |
499 | goto out_nomem; | |
500 | ||
501 | /* If the first fragment is fragmented itself, we split | |
502 | * it to two chunks: the first with data and paged part | |
503 | * and the second, holding only fragments. */ | |
504 | if (skb_shinfo(head)->frag_list) { | |
505 | struct sk_buff *clone; | |
506 | int i, plen = 0; | |
507 | ||
508 | if ((clone = alloc_skb(0, GFP_ATOMIC)) == NULL) | |
509 | goto out_nomem; | |
510 | clone->next = head->next; | |
511 | head->next = clone; | |
512 | skb_shinfo(clone)->frag_list = skb_shinfo(head)->frag_list; | |
513 | skb_shinfo(head)->frag_list = NULL; | |
514 | for (i=0; i<skb_shinfo(head)->nr_frags; i++) | |
515 | plen += skb_shinfo(head)->frags[i].size; | |
516 | clone->len = clone->data_len = head->data_len - plen; | |
517 | head->data_len -= clone->len; | |
518 | head->len -= clone->len; | |
519 | clone->csum = 0; | |
520 | clone->ip_summed = head->ip_summed; | |
6ddc0822 | 521 | atomic_add(clone->truesize, &qp->q.net->mem); |
1da177e4 LT |
522 | } |
523 | ||
524 | skb_shinfo(head)->frag_list = head->next; | |
d56f90a7 | 525 | skb_push(head, head->data - skb_network_header(head)); |
6ddc0822 | 526 | atomic_sub(head->truesize, &qp->q.net->mem); |
1da177e4 LT |
527 | |
528 | for (fp=head->next; fp; fp = fp->next) { | |
529 | head->data_len += fp->len; | |
530 | head->len += fp->len; | |
531 | if (head->ip_summed != fp->ip_summed) | |
532 | head->ip_summed = CHECKSUM_NONE; | |
84fa7933 | 533 | else if (head->ip_summed == CHECKSUM_COMPLETE) |
1da177e4 LT |
534 | head->csum = csum_add(head->csum, fp->csum); |
535 | head->truesize += fp->truesize; | |
6ddc0822 | 536 | atomic_sub(fp->truesize, &qp->q.net->mem); |
1da177e4 LT |
537 | } |
538 | ||
539 | head->next = NULL; | |
540 | head->dev = dev; | |
5ab11c98 | 541 | head->tstamp = qp->q.stamp; |
1da177e4 | 542 | |
eddc9ec5 | 543 | iph = ip_hdr(head); |
1da177e4 LT |
544 | iph->frag_off = 0; |
545 | iph->tot_len = htons(len); | |
546 | IP_INC_STATS_BH(IPSTATS_MIB_REASMOKS); | |
5ab11c98 | 547 | qp->q.fragments = NULL; |
1706d587 | 548 | return 0; |
1da177e4 LT |
549 | |
550 | out_nomem: | |
e905a9ed | 551 | LIMIT_NETDEBUG(KERN_ERR "IP: queue_glue: no memory for gluing " |
64ce2073 | 552 | "queue %p\n", qp); |
45542479 | 553 | err = -ENOMEM; |
1da177e4 LT |
554 | goto out_fail; |
555 | out_oversize: | |
556 | if (net_ratelimit()) | |
557 | printk(KERN_INFO | |
a7d632b6 | 558 | "Oversized IP packet from " NIPQUAD_FMT ".\n", |
1da177e4 LT |
559 | NIPQUAD(qp->saddr)); |
560 | out_fail: | |
561 | IP_INC_STATS_BH(IPSTATS_MIB_REASMFAILS); | |
1706d587 | 562 | return err; |
1da177e4 LT |
563 | } |
564 | ||
565 | /* Process an incoming IP datagram fragment. */ | |
776c729e | 566 | int ip_defrag(struct sk_buff *skb, u32 user) |
1da177e4 | 567 | { |
1da177e4 | 568 | struct ipq *qp; |
ac18e750 | 569 | struct net *net; |
e905a9ed | 570 | |
1da177e4 LT |
571 | IP_INC_STATS_BH(IPSTATS_MIB_REASMREQDS); |
572 | ||
c346dca1 | 573 | net = skb->dev ? dev_net(skb->dev) : dev_net(skb->dst->dev); |
1da177e4 | 574 | /* Start by cleaning up the memory. */ |
e31e0bdc | 575 | if (atomic_read(&net->ipv4.frags.mem) > net->ipv4.frags.high_thresh) |
6ddc0822 | 576 | ip_evictor(net); |
1da177e4 | 577 | |
1da177e4 | 578 | /* Lookup (or create) queue header */ |
ac18e750 | 579 | if ((qp = ip_find(net, ip_hdr(skb), user)) != NULL) { |
1706d587 | 580 | int ret; |
1da177e4 | 581 | |
5ab11c98 | 582 | spin_lock(&qp->q.lock); |
1da177e4 | 583 | |
1706d587 | 584 | ret = ip_frag_queue(qp, skb); |
1da177e4 | 585 | |
5ab11c98 | 586 | spin_unlock(&qp->q.lock); |
4b6cb5d8 | 587 | ipq_put(qp); |
776c729e | 588 | return ret; |
1da177e4 LT |
589 | } |
590 | ||
591 | IP_INC_STATS_BH(IPSTATS_MIB_REASMFAILS); | |
592 | kfree_skb(skb); | |
776c729e | 593 | return -ENOMEM; |
1da177e4 LT |
594 | } |
595 | ||
8d8354d2 PE |
596 | #ifdef CONFIG_SYSCTL |
597 | static int zero; | |
598 | ||
0a64b4b8 | 599 | static struct ctl_table ip4_frags_ns_ctl_table[] = { |
8d8354d2 PE |
600 | { |
601 | .ctl_name = NET_IPV4_IPFRAG_HIGH_THRESH, | |
602 | .procname = "ipfrag_high_thresh", | |
e31e0bdc | 603 | .data = &init_net.ipv4.frags.high_thresh, |
8d8354d2 PE |
604 | .maxlen = sizeof(int), |
605 | .mode = 0644, | |
606 | .proc_handler = &proc_dointvec | |
607 | }, | |
608 | { | |
609 | .ctl_name = NET_IPV4_IPFRAG_LOW_THRESH, | |
610 | .procname = "ipfrag_low_thresh", | |
e31e0bdc | 611 | .data = &init_net.ipv4.frags.low_thresh, |
8d8354d2 PE |
612 | .maxlen = sizeof(int), |
613 | .mode = 0644, | |
614 | .proc_handler = &proc_dointvec | |
615 | }, | |
616 | { | |
617 | .ctl_name = NET_IPV4_IPFRAG_TIME, | |
618 | .procname = "ipfrag_time", | |
b2fd5321 | 619 | .data = &init_net.ipv4.frags.timeout, |
8d8354d2 PE |
620 | .maxlen = sizeof(int), |
621 | .mode = 0644, | |
622 | .proc_handler = &proc_dointvec_jiffies, | |
623 | .strategy = &sysctl_jiffies | |
624 | }, | |
7d291ebb PE |
625 | { } |
626 | }; | |
627 | ||
628 | static struct ctl_table ip4_frags_ctl_table[] = { | |
8d8354d2 PE |
629 | { |
630 | .ctl_name = NET_IPV4_IPFRAG_SECRET_INTERVAL, | |
631 | .procname = "ipfrag_secret_interval", | |
3b4bc4a2 | 632 | .data = &ip4_frags.secret_interval, |
8d8354d2 PE |
633 | .maxlen = sizeof(int), |
634 | .mode = 0644, | |
635 | .proc_handler = &proc_dointvec_jiffies, | |
636 | .strategy = &sysctl_jiffies | |
637 | }, | |
638 | { | |
639 | .procname = "ipfrag_max_dist", | |
640 | .data = &sysctl_ipfrag_max_dist, | |
641 | .maxlen = sizeof(int), | |
642 | .mode = 0644, | |
643 | .proc_handler = &proc_dointvec_minmax, | |
644 | .extra1 = &zero | |
645 | }, | |
646 | { } | |
647 | }; | |
648 | ||
0a64b4b8 | 649 | static int ip4_frags_ns_ctl_register(struct net *net) |
8d8354d2 | 650 | { |
e4a2d5c2 | 651 | struct ctl_table *table; |
8d8354d2 PE |
652 | struct ctl_table_header *hdr; |
653 | ||
0a64b4b8 | 654 | table = ip4_frags_ns_ctl_table; |
e4a2d5c2 | 655 | if (net != &init_net) { |
0a64b4b8 | 656 | table = kmemdup(table, sizeof(ip4_frags_ns_ctl_table), GFP_KERNEL); |
e4a2d5c2 PE |
657 | if (table == NULL) |
658 | goto err_alloc; | |
659 | ||
e31e0bdc PE |
660 | table[0].data = &net->ipv4.frags.high_thresh; |
661 | table[1].data = &net->ipv4.frags.low_thresh; | |
b2fd5321 | 662 | table[2].data = &net->ipv4.frags.timeout; |
e4a2d5c2 PE |
663 | } |
664 | ||
665 | hdr = register_net_sysctl_table(net, net_ipv4_ctl_path, table); | |
666 | if (hdr == NULL) | |
667 | goto err_reg; | |
668 | ||
669 | net->ipv4.frags_hdr = hdr; | |
670 | return 0; | |
671 | ||
672 | err_reg: | |
673 | if (net != &init_net) | |
674 | kfree(table); | |
675 | err_alloc: | |
676 | return -ENOMEM; | |
677 | } | |
678 | ||
0a64b4b8 | 679 | static void ip4_frags_ns_ctl_unregister(struct net *net) |
e4a2d5c2 PE |
680 | { |
681 | struct ctl_table *table; | |
682 | ||
683 | table = net->ipv4.frags_hdr->ctl_table_arg; | |
684 | unregister_net_sysctl_table(net->ipv4.frags_hdr); | |
685 | kfree(table); | |
8d8354d2 | 686 | } |
7d291ebb PE |
687 | |
688 | static void ip4_frags_ctl_register(void) | |
689 | { | |
690 | register_net_sysctl_rotable(net_ipv4_ctl_path, ip4_frags_ctl_table); | |
691 | } | |
8d8354d2 | 692 | #else |
0a64b4b8 | 693 | static inline int ip4_frags_ns_ctl_register(struct net *net) |
8d8354d2 PE |
694 | { |
695 | return 0; | |
696 | } | |
e4a2d5c2 | 697 | |
0a64b4b8 | 698 | static inline void ip4_frags_ns_ctl_unregister(struct net *net) |
e4a2d5c2 PE |
699 | { |
700 | } | |
7d291ebb PE |
701 | |
702 | static inline void ip4_frags_ctl_register(void) | |
703 | { | |
704 | } | |
8d8354d2 PE |
705 | #endif |
706 | ||
707 | static int ipv4_frags_init_net(struct net *net) | |
708 | { | |
e31e0bdc PE |
709 | /* |
710 | * Fragment cache limits. We will commit 256K at one time. Should we | |
711 | * cross that limit we will prune down to 192K. This should cope with | |
712 | * even the most extreme cases without allowing an attacker to | |
713 | * measurably harm machine performance. | |
714 | */ | |
715 | net->ipv4.frags.high_thresh = 256 * 1024; | |
716 | net->ipv4.frags.low_thresh = 192 * 1024; | |
b2fd5321 PE |
717 | /* |
718 | * Important NOTE! Fragment queue must be destroyed before MSL expires. | |
719 | * RFC791 is wrong proposing to prolongate timer each fragment arrival | |
720 | * by TTL. | |
721 | */ | |
722 | net->ipv4.frags.timeout = IP_FRAG_TIME; | |
723 | ||
e5a2bb84 PE |
724 | inet_frags_init_net(&net->ipv4.frags); |
725 | ||
0a64b4b8 | 726 | return ip4_frags_ns_ctl_register(net); |
8d8354d2 PE |
727 | } |
728 | ||
81566e83 PE |
729 | static void ipv4_frags_exit_net(struct net *net) |
730 | { | |
0a64b4b8 | 731 | ip4_frags_ns_ctl_unregister(net); |
81566e83 PE |
732 | inet_frags_exit_net(&net->ipv4.frags, &ip4_frags); |
733 | } | |
734 | ||
735 | static struct pernet_operations ip4_frags_ops = { | |
736 | .init = ipv4_frags_init_net, | |
737 | .exit = ipv4_frags_exit_net, | |
738 | }; | |
739 | ||
b7aa0bf7 | 740 | void __init ipfrag_init(void) |
1da177e4 | 741 | { |
7d291ebb | 742 | ip4_frags_ctl_register(); |
81566e83 | 743 | register_pernet_subsys(&ip4_frags_ops); |
321a3a99 | 744 | ip4_frags.hashfn = ip4_hashfn; |
c6fda282 | 745 | ip4_frags.constructor = ip4_frag_init; |
1e4b8287 PE |
746 | ip4_frags.destructor = ip4_frag_free; |
747 | ip4_frags.skb_free = NULL; | |
748 | ip4_frags.qsize = sizeof(struct ipq); | |
abd6523d | 749 | ip4_frags.match = ip4_frag_match; |
e521db9d | 750 | ip4_frags.frag_expire = ip_expire; |
3b4bc4a2 | 751 | ip4_frags.secret_interval = 10 * 60 * HZ; |
7eb95156 | 752 | inet_frags_init(&ip4_frags); |
1da177e4 LT |
753 | } |
754 | ||
755 | EXPORT_SYMBOL(ip_defrag); |