]> bbs.cooldavid.org Git - net-next-2.6.git/blame - net/ipv6/netfilter/nf_conntrack_reasm.c
Merge branch 'master' of /repos/git/net-next-2.6
[net-next-2.6.git] / net / ipv6 / netfilter / nf_conntrack_reasm.c
CommitLineData
9fb9cbb1
YK
1/*
2 * IPv6 fragment reassembly for connection tracking
3 *
4 * Copyright (C)2004 USAGI/WIDE Project
5 *
6 * Author:
7 * Yasuyuki Kozakai @USAGI <yasuyuki.kozakai@toshiba.co.jp>
8 *
9 * Based on: net/ipv6/reassembly.c
10 *
11 * This program is free software; you can redistribute it and/or
12 * modify it under the terms of the GNU General Public License
13 * as published by the Free Software Foundation; either version
14 * 2 of the License, or (at your option) any later version.
15 */
16
9fb9cbb1
YK
17#include <linux/errno.h>
18#include <linux/types.h>
19#include <linux/string.h>
20#include <linux/socket.h>
21#include <linux/sockios.h>
22#include <linux/jiffies.h>
23#include <linux/net.h>
24#include <linux/list.h>
25#include <linux/netdevice.h>
26#include <linux/in6.h>
27#include <linux/ipv6.h>
28#include <linux/icmpv6.h>
29#include <linux/random.h>
9fb9cbb1
YK
30
31#include <net/sock.h>
32#include <net/snmp.h>
5ab11c98 33#include <net/inet_frag.h>
9fb9cbb1
YK
34
35#include <net/ipv6.h>
36#include <net/protocol.h>
37#include <net/transp_v6.h>
38#include <net/rawv6.h>
39#include <net/ndisc.h>
40#include <net/addrconf.h>
99fa5f53 41#include <net/netfilter/ipv6/nf_conntrack_ipv6.h>
9fb9cbb1
YK
42#include <linux/sysctl.h>
43#include <linux/netfilter.h>
44#include <linux/netfilter_ipv6.h>
45#include <linux/kernel.h>
46#include <linux/module.h>
47
9fb9cbb1 48
9fb9cbb1
YK
49struct nf_ct_frag6_skb_cb
50{
51 struct inet6_skb_parm h;
52 int offset;
53 struct sk_buff *orig;
54};
55
56#define NFCT_FRAG6_CB(skb) ((struct nf_ct_frag6_skb_cb*)((skb)->cb))
57
58struct nf_ct_frag6_queue
59{
5ab11c98 60 struct inet_frag_queue q;
9fb9cbb1 61
bff9a89b 62 __be32 id; /* fragment id */
c92b544b 63 u32 user;
9fb9cbb1
YK
64 struct in6_addr saddr;
65 struct in6_addr daddr;
66
9fb9cbb1 67 unsigned int csum;
9fb9cbb1 68 __u16 nhoffset;
9fb9cbb1
YK
69};
70
7eb95156 71static struct inet_frags nf_frags;
ac18e750 72static struct netns_frags nf_init_frags;
9fb9cbb1 73
8d8354d2
PE
74#ifdef CONFIG_SYSCTL
75struct ctl_table nf_ct_ipv6_sysctl_table[] = {
76 {
77 .procname = "nf_conntrack_frag6_timeout",
b2fd5321 78 .data = &nf_init_frags.timeout,
8d8354d2
PE
79 .maxlen = sizeof(unsigned int),
80 .mode = 0644,
6d9f239a 81 .proc_handler = proc_dointvec_jiffies,
8d8354d2
PE
82 },
83 {
8d8354d2 84 .procname = "nf_conntrack_frag6_low_thresh",
e31e0bdc 85 .data = &nf_init_frags.low_thresh,
8d8354d2
PE
86 .maxlen = sizeof(unsigned int),
87 .mode = 0644,
6d9f239a 88 .proc_handler = proc_dointvec,
8d8354d2
PE
89 },
90 {
8d8354d2 91 .procname = "nf_conntrack_frag6_high_thresh",
e31e0bdc 92 .data = &nf_init_frags.high_thresh,
8d8354d2
PE
93 .maxlen = sizeof(unsigned int),
94 .mode = 0644,
6d9f239a 95 .proc_handler = proc_dointvec,
8d8354d2 96 },
f8572d8f 97 { }
8d8354d2
PE
98};
99#endif
100
321a3a99 101static unsigned int nf_hashfn(struct inet_frag_queue *q)
9fb9cbb1 102{
58c0fb0d 103 const struct nf_ct_frag6_queue *nq;
9fb9cbb1 104
321a3a99 105 nq = container_of(q, struct nf_ct_frag6_queue, q);
93c8b90f 106 return inet6_hash_frag(nq->id, &nq->saddr, &nq->daddr, nf_frags.rnd);
9fb9cbb1
YK
107}
108
1e4b8287
PE
109static void nf_skb_free(struct sk_buff *skb)
110{
111 if (NFCT_FRAG6_CB(skb)->orig)
112 kfree_skb(NFCT_FRAG6_CB(skb)->orig);
113}
114
9fb9cbb1 115/* Memory Tracking Functions. */
1ba430bc 116static inline void frag_kfree_skb(struct sk_buff *skb, unsigned int *work)
9fb9cbb1 117{
1ba430bc
YK
118 if (work)
119 *work -= skb->truesize;
6ddc0822 120 atomic_sub(skb->truesize, &nf_init_frags.mem);
1e4b8287 121 nf_skb_free(skb);
9fb9cbb1
YK
122 kfree_skb(skb);
123}
124
9fb9cbb1
YK
125/* Destruction primitives. */
126
4b6cb5d8 127static __inline__ void fq_put(struct nf_ct_frag6_queue *fq)
9fb9cbb1 128{
762cc408 129 inet_frag_put(&fq->q, &nf_frags);
9fb9cbb1
YK
130}
131
132/* Kill fq entry. It is not destroyed immediately,
133 * because caller (and someone more) holds reference count.
134 */
135static __inline__ void fq_kill(struct nf_ct_frag6_queue *fq)
136{
277e650d 137 inet_frag_kill(&fq->q, &nf_frags);
9fb9cbb1
YK
138}
139
140static void nf_ct_frag6_evictor(void)
141{
e8e16b70 142 local_bh_disable();
6ddc0822 143 inet_frag_evictor(&nf_init_frags, &nf_frags);
e8e16b70 144 local_bh_enable();
9fb9cbb1
YK
145}
146
147static void nf_ct_frag6_expire(unsigned long data)
148{
e521db9d
PE
149 struct nf_ct_frag6_queue *fq;
150
151 fq = container_of((struct inet_frag_queue *)data,
152 struct nf_ct_frag6_queue, q);
9fb9cbb1 153
5ab11c98 154 spin_lock(&fq->q.lock);
9fb9cbb1 155
bc578a54 156 if (fq->q.last_in & INET_FRAG_COMPLETE)
9fb9cbb1
YK
157 goto out;
158
159 fq_kill(fq);
160
161out:
5ab11c98 162 spin_unlock(&fq->q.lock);
4b6cb5d8 163 fq_put(fq);
9fb9cbb1
YK
164}
165
166/* Creation primitives. */
167
abd6523d 168static __inline__ struct nf_ct_frag6_queue *
0b5ccb2e 169fq_find(__be32 id, u32 user, struct in6_addr *src, struct in6_addr *dst)
9fb9cbb1 170{
2588fe1d 171 struct inet_frag_queue *q;
c6fda282 172 struct ip6_create_arg arg;
abd6523d 173 unsigned int hash;
9fb9cbb1 174
c6fda282 175 arg.id = id;
0b5ccb2e 176 arg.user = user;
c6fda282
PE
177 arg.src = src;
178 arg.dst = dst;
9a375803
PE
179
180 read_lock_bh(&nf_frags.lock);
93c8b90f 181 hash = inet6_hash_frag(id, src, dst, nf_frags.rnd);
9fb9cbb1 182
ac18e750 183 q = inet_frag_find(&nf_init_frags, &nf_frags, &arg, hash);
b9c69896 184 local_bh_enable();
c6fda282 185 if (q == NULL)
9fb9cbb1 186 goto oom;
9fb9cbb1 187
c6fda282 188 return container_of(q, struct nf_ct_frag6_queue, q);
9fb9cbb1
YK
189
190oom:
c6fda282 191 pr_debug("Can't alloc new queue\n");
9fb9cbb1
YK
192 return NULL;
193}
194
9fb9cbb1 195
1ab1457c 196static int nf_ct_frag6_queue(struct nf_ct_frag6_queue *fq, struct sk_buff *skb,
58c0fb0d 197 const struct frag_hdr *fhdr, int nhoff)
9fb9cbb1
YK
198{
199 struct sk_buff *prev, *next;
200 int offset, end;
201
bc578a54 202 if (fq->q.last_in & INET_FRAG_COMPLETE) {
0d53778e 203 pr_debug("Allready completed\n");
9fb9cbb1
YK
204 goto err;
205 }
206
207 offset = ntohs(fhdr->frag_off) & ~0x7;
0660e03f
ACM
208 end = offset + (ntohs(ipv6_hdr(skb)->payload_len) -
209 ((u8 *)(fhdr + 1) - (u8 *)(ipv6_hdr(skb) + 1)));
9fb9cbb1
YK
210
211 if ((unsigned int)end > IPV6_MAXPLEN) {
0d53778e 212 pr_debug("offset is too large.\n");
1ab1457c 213 return -1;
9fb9cbb1
YK
214 }
215
d56f90a7
ACM
216 if (skb->ip_summed == CHECKSUM_COMPLETE) {
217 const unsigned char *nh = skb_network_header(skb);
1ab1457c 218 skb->csum = csum_sub(skb->csum,
d56f90a7 219 csum_partial(nh, (u8 *)(fhdr + 1) - nh,
9fb9cbb1 220 0));
d56f90a7 221 }
9fb9cbb1
YK
222
223 /* Is this the final fragment? */
224 if (!(fhdr->frag_off & htons(IP6_MF))) {
225 /* If we already have some bits beyond end
226 * or have different end, the segment is corrupted.
227 */
5ab11c98 228 if (end < fq->q.len ||
bc578a54 229 ((fq->q.last_in & INET_FRAG_LAST_IN) && end != fq->q.len)) {
0d53778e 230 pr_debug("already received last fragment\n");
9fb9cbb1
YK
231 goto err;
232 }
bc578a54 233 fq->q.last_in |= INET_FRAG_LAST_IN;
5ab11c98 234 fq->q.len = end;
9fb9cbb1
YK
235 } else {
236 /* Check if the fragment is rounded to 8 bytes.
237 * Required by the RFC.
238 */
239 if (end & 0x7) {
240 /* RFC2460 says always send parameter problem in
241 * this case. -DaveM
242 */
0d53778e 243 pr_debug("end of fragment not rounded to 8 bytes.\n");
9fb9cbb1
YK
244 return -1;
245 }
5ab11c98 246 if (end > fq->q.len) {
9fb9cbb1 247 /* Some bits beyond end -> corruption. */
bc578a54 248 if (fq->q.last_in & INET_FRAG_LAST_IN) {
0d53778e 249 pr_debug("last packet already reached.\n");
9fb9cbb1
YK
250 goto err;
251 }
5ab11c98 252 fq->q.len = end;
9fb9cbb1
YK
253 }
254 }
255
256 if (end == offset)
257 goto err;
258
259 /* Point into the IP datagram 'data' part. */
260 if (!pskb_pull(skb, (u8 *) (fhdr + 1) - skb->data)) {
0d53778e 261 pr_debug("queue: message is too short.\n");
9fb9cbb1
YK
262 goto err;
263 }
b38dfee3 264 if (pskb_trim_rcsum(skb, end - offset)) {
0d53778e 265 pr_debug("Can't trim\n");
b38dfee3 266 goto err;
9fb9cbb1
YK
267 }
268
269 /* Find out which fragments are in front and at the back of us
270 * in the chain of fragments so far. We must know where to put
271 * this fragment, right?
272 */
273 prev = NULL;
5ab11c98 274 for (next = fq->q.fragments; next != NULL; next = next->next) {
9fb9cbb1
YK
275 if (NFCT_FRAG6_CB(next)->offset >= offset)
276 break; /* bingo! */
277 prev = next;
278 }
279
280 /* We found where to put this one. Check for overlap with
281 * preceding fragment, and, if needed, align things so that
282 * any overlaps are eliminated.
283 */
284 if (prev) {
285 int i = (NFCT_FRAG6_CB(prev)->offset + prev->len) - offset;
286
287 if (i > 0) {
288 offset += i;
289 if (end <= offset) {
0d53778e 290 pr_debug("overlap\n");
9fb9cbb1
YK
291 goto err;
292 }
293 if (!pskb_pull(skb, i)) {
0d53778e 294 pr_debug("Can't pull\n");
9fb9cbb1
YK
295 goto err;
296 }
297 if (skb->ip_summed != CHECKSUM_UNNECESSARY)
298 skb->ip_summed = CHECKSUM_NONE;
299 }
300 }
301
302 /* Look for overlap with succeeding segments.
303 * If we can merge fragments, do it.
304 */
305 while (next && NFCT_FRAG6_CB(next)->offset < end) {
306 /* overlap is 'i' bytes */
307 int i = end - NFCT_FRAG6_CB(next)->offset;
308
309 if (i < next->len) {
310 /* Eat head of the next overlapped fragment
311 * and leave the loop. The next ones cannot overlap.
312 */
0d53778e 313 pr_debug("Eat head of the overlapped parts.: %d", i);
9fb9cbb1
YK
314 if (!pskb_pull(next, i))
315 goto err;
316
317 /* next fragment */
318 NFCT_FRAG6_CB(next)->offset += i;
5ab11c98 319 fq->q.meat -= i;
9fb9cbb1
YK
320 if (next->ip_summed != CHECKSUM_UNNECESSARY)
321 next->ip_summed = CHECKSUM_NONE;
322 break;
323 } else {
324 struct sk_buff *free_it = next;
325
326 /* Old fragmnet is completely overridden with
327 * new one drop it.
328 */
329 next = next->next;
330
331 if (prev)
332 prev->next = next;
333 else
5ab11c98 334 fq->q.fragments = next;
9fb9cbb1 335
5ab11c98 336 fq->q.meat -= free_it->len;
1ba430bc 337 frag_kfree_skb(free_it, NULL);
9fb9cbb1
YK
338 }
339 }
340
341 NFCT_FRAG6_CB(skb)->offset = offset;
342
343 /* Insert this fragment in the chain of fragments. */
344 skb->next = next;
345 if (prev)
346 prev->next = skb;
347 else
5ab11c98 348 fq->q.fragments = skb;
9fb9cbb1
YK
349
350 skb->dev = NULL;
5ab11c98
PE
351 fq->q.stamp = skb->tstamp;
352 fq->q.meat += skb->len;
6ddc0822 353 atomic_add(skb->truesize, &nf_init_frags.mem);
9fb9cbb1
YK
354
355 /* The first fragment.
356 * nhoffset is obtained from the first fragment, of course.
357 */
358 if (offset == 0) {
359 fq->nhoffset = nhoff;
bc578a54 360 fq->q.last_in |= INET_FRAG_FIRST_IN;
9fb9cbb1 361 }
7eb95156 362 write_lock(&nf_frags.lock);
3140c25c 363 list_move_tail(&fq->q.lru_list, &nf_init_frags.lru_list);
7eb95156 364 write_unlock(&nf_frags.lock);
9fb9cbb1
YK
365 return 0;
366
367err:
368 return -1;
369}
370
371/*
372 * Check if this packet is complete.
373 * Returns NULL on failure by any reason, and pointer
374 * to current nexthdr field in reassembled frame.
375 *
376 * It is called with locked fq, and caller must check that
377 * queue is eligible for reassembly i.e. it is not COMPLETE,
378 * the last and the first frames arrived and all the bits are here.
379 */
380static struct sk_buff *
381nf_ct_frag6_reasm(struct nf_ct_frag6_queue *fq, struct net_device *dev)
382{
5ab11c98 383 struct sk_buff *fp, *op, *head = fq->q.fragments;
9fb9cbb1
YK
384 int payload_len;
385
386 fq_kill(fq);
387
547b792c
IJ
388 WARN_ON(head == NULL);
389 WARN_ON(NFCT_FRAG6_CB(head)->offset != 0);
9fb9cbb1
YK
390
391 /* Unfragmented part is taken from the first segment. */
d56f90a7 392 payload_len = ((head->data - skb_network_header(head)) -
5ab11c98 393 sizeof(struct ipv6hdr) + fq->q.len -
d56f90a7 394 sizeof(struct frag_hdr));
9fb9cbb1 395 if (payload_len > IPV6_MAXPLEN) {
0d53778e 396 pr_debug("payload len is too large.\n");
9fb9cbb1
YK
397 goto out_oversize;
398 }
399
400 /* Head of list must not be cloned. */
401 if (skb_cloned(head) && pskb_expand_head(head, 0, 0, GFP_ATOMIC)) {
0d53778e 402 pr_debug("skb is cloned but can't expand head");
9fb9cbb1
YK
403 goto out_oom;
404 }
405
406 /* If the first fragment is fragmented itself, we split
407 * it to two chunks: the first with data and paged part
408 * and the second, holding only fragments. */
343a9972 409 if (skb_has_frags(head)) {
9fb9cbb1
YK
410 struct sk_buff *clone;
411 int i, plen = 0;
412
413 if ((clone = alloc_skb(0, GFP_ATOMIC)) == NULL) {
0d53778e 414 pr_debug("Can't alloc skb\n");
9fb9cbb1
YK
415 goto out_oom;
416 }
417 clone->next = head->next;
418 head->next = clone;
419 skb_shinfo(clone)->frag_list = skb_shinfo(head)->frag_list;
343a9972 420 skb_frag_list_init(head);
9fb9cbb1
YK
421 for (i=0; i<skb_shinfo(head)->nr_frags; i++)
422 plen += skb_shinfo(head)->frags[i].size;
423 clone->len = clone->data_len = head->data_len - plen;
424 head->data_len -= clone->len;
425 head->len -= clone->len;
426 clone->csum = 0;
427 clone->ip_summed = head->ip_summed;
428
429 NFCT_FRAG6_CB(clone)->orig = NULL;
6ddc0822 430 atomic_add(clone->truesize, &nf_init_frags.mem);
9fb9cbb1
YK
431 }
432
433 /* We have to remove fragment header from datagram and to relocate
434 * header in order to calculate ICV correctly. */
bff9b61c 435 skb_network_header(head)[fq->nhoffset] = skb_transport_header(head)[0];
1ab1457c 436 memmove(head->head + sizeof(struct frag_hdr), head->head,
9fb9cbb1 437 (head->data - head->head) - sizeof(struct frag_hdr));
b0e380b1
ACM
438 head->mac_header += sizeof(struct frag_hdr);
439 head->network_header += sizeof(struct frag_hdr);
9fb9cbb1
YK
440
441 skb_shinfo(head)->frag_list = head->next;
badff6d0 442 skb_reset_transport_header(head);
d56f90a7 443 skb_push(head, head->data - skb_network_header(head));
6ddc0822 444 atomic_sub(head->truesize, &nf_init_frags.mem);
9fb9cbb1
YK
445
446 for (fp=head->next; fp; fp = fp->next) {
447 head->data_len += fp->len;
448 head->len += fp->len;
449 if (head->ip_summed != fp->ip_summed)
450 head->ip_summed = CHECKSUM_NONE;
84fa7933 451 else if (head->ip_summed == CHECKSUM_COMPLETE)
9fb9cbb1
YK
452 head->csum = csum_add(head->csum, fp->csum);
453 head->truesize += fp->truesize;
6ddc0822 454 atomic_sub(fp->truesize, &nf_init_frags.mem);
9fb9cbb1
YK
455 }
456
457 head->next = NULL;
458 head->dev = dev;
5ab11c98 459 head->tstamp = fq->q.stamp;
0660e03f 460 ipv6_hdr(head)->payload_len = htons(payload_len);
9fb9cbb1
YK
461
462 /* Yes, and fold redundant checksum back. 8) */
84fa7933 463 if (head->ip_summed == CHECKSUM_COMPLETE)
d56f90a7 464 head->csum = csum_partial(skb_network_header(head),
cfe1fc77 465 skb_network_header_len(head),
d56f90a7 466 head->csum);
9fb9cbb1 467
5ab11c98 468 fq->q.fragments = NULL;
9fb9cbb1
YK
469
470 /* all original skbs are linked into the NFCT_FRAG6_CB(head).orig */
471 fp = skb_shinfo(head)->frag_list;
472 if (NFCT_FRAG6_CB(fp)->orig == NULL)
473 /* at above code, head skb is divided into two skbs. */
474 fp = fp->next;
475
476 op = NFCT_FRAG6_CB(head)->orig;
477 for (; fp; fp = fp->next) {
478 struct sk_buff *orig = NFCT_FRAG6_CB(fp)->orig;
479
480 op->next = orig;
481 op = orig;
482 NFCT_FRAG6_CB(fp)->orig = NULL;
483 }
484
485 return head;
486
487out_oversize:
488 if (net_ratelimit())
489 printk(KERN_DEBUG "nf_ct_frag6_reasm: payload len = %d\n", payload_len);
490 goto out_fail;
491out_oom:
492 if (net_ratelimit())
493 printk(KERN_DEBUG "nf_ct_frag6_reasm: no memory for reassembly\n");
494out_fail:
495 return NULL;
496}
497
498/*
499 * find the header just before Fragment Header.
500 *
501 * if success return 0 and set ...
502 * (*prevhdrp): the value of "Next Header Field" in the header
503 * just before Fragment Header.
504 * (*prevhoff): the offset of "Next Header Field" in the header
505 * just before Fragment Header.
506 * (*fhoff) : the offset of Fragment Header.
507 *
508 * Based on ipv6_skip_hdr() in net/ipv6/exthdr.c
509 *
510 */
511static int
512find_prev_fhdr(struct sk_buff *skb, u8 *prevhdrp, int *prevhoff, int *fhoff)
513{
0660e03f 514 u8 nexthdr = ipv6_hdr(skb)->nexthdr;
6b88dd96
ACM
515 const int netoff = skb_network_offset(skb);
516 u8 prev_nhoff = netoff + offsetof(struct ipv6hdr, nexthdr);
517 int start = netoff + sizeof(struct ipv6hdr);
9fb9cbb1
YK
518 int len = skb->len - start;
519 u8 prevhdr = NEXTHDR_IPV6;
520
1ab1457c
YH
521 while (nexthdr != NEXTHDR_FRAGMENT) {
522 struct ipv6_opt_hdr hdr;
523 int hdrlen;
9fb9cbb1
YK
524
525 if (!ipv6_ext_hdr(nexthdr)) {
526 return -1;
527 }
1ab1457c 528 if (nexthdr == NEXTHDR_NONE) {
0d53778e 529 pr_debug("next header is none\n");
9fb9cbb1
YK
530 return -1;
531 }
d1238d53
CP
532 if (len < (int)sizeof(struct ipv6_opt_hdr)) {
533 pr_debug("too short\n");
534 return -1;
535 }
1ab1457c
YH
536 if (skb_copy_bits(skb, start, &hdr, sizeof(hdr)))
537 BUG();
538 if (nexthdr == NEXTHDR_AUTH)
539 hdrlen = (hdr.hdrlen+2)<<2;
540 else
541 hdrlen = ipv6_optlen(&hdr);
9fb9cbb1
YK
542
543 prevhdr = nexthdr;
544 prev_nhoff = start;
545
1ab1457c
YH
546 nexthdr = hdr.nexthdr;
547 len -= hdrlen;
548 start += hdrlen;
549 }
9fb9cbb1
YK
550
551 if (len < 0)
552 return -1;
553
554 *prevhdrp = prevhdr;
555 *prevhoff = prev_nhoff;
556 *fhoff = start;
557
558 return 0;
559}
560
0b5ccb2e 561struct sk_buff *nf_ct_frag6_gather(struct sk_buff *skb, u32 user)
9fb9cbb1 562{
1ab1457c 563 struct sk_buff *clone;
9fb9cbb1
YK
564 struct net_device *dev = skb->dev;
565 struct frag_hdr *fhdr;
566 struct nf_ct_frag6_queue *fq;
567 struct ipv6hdr *hdr;
568 int fhoff, nhoff;
569 u8 prevhdr;
570 struct sk_buff *ret_skb = NULL;
571
572 /* Jumbo payload inhibits frag. header */
0660e03f 573 if (ipv6_hdr(skb)->payload_len == 0) {
0d53778e 574 pr_debug("payload len = 0\n");
9fb9cbb1
YK
575 return skb;
576 }
577
578 if (find_prev_fhdr(skb, &prevhdr, &nhoff, &fhoff) < 0)
579 return skb;
580
581 clone = skb_clone(skb, GFP_ATOMIC);
582 if (clone == NULL) {
0d53778e 583 pr_debug("Can't clone skb\n");
9fb9cbb1
YK
584 return skb;
585 }
586
587 NFCT_FRAG6_CB(clone)->orig = skb;
588
589 if (!pskb_may_pull(clone, fhoff + sizeof(*fhdr))) {
0d53778e 590 pr_debug("message is too short.\n");
9fb9cbb1
YK
591 goto ret_orig;
592 }
593
967b05f6 594 skb_set_transport_header(clone, fhoff);
0660e03f 595 hdr = ipv6_hdr(clone);
bff9b61c 596 fhdr = (struct frag_hdr *)skb_transport_header(clone);
9fb9cbb1
YK
597
598 if (!(fhdr->frag_off & htons(0xFFF9))) {
0d53778e 599 pr_debug("Invalid fragment offset\n");
9fb9cbb1
YK
600 /* It is not a fragmented frame */
601 goto ret_orig;
602 }
603
e31e0bdc 604 if (atomic_read(&nf_init_frags.mem) > nf_init_frags.high_thresh)
9fb9cbb1
YK
605 nf_ct_frag6_evictor();
606
0b5ccb2e 607 fq = fq_find(fhdr->identification, user, &hdr->saddr, &hdr->daddr);
9fb9cbb1 608 if (fq == NULL) {
0d53778e 609 pr_debug("Can't find and can't create new queue\n");
9fb9cbb1
YK
610 goto ret_orig;
611 }
612
b9c69896 613 spin_lock_bh(&fq->q.lock);
9fb9cbb1
YK
614
615 if (nf_ct_frag6_queue(fq, clone, fhdr, nhoff) < 0) {
b9c69896 616 spin_unlock_bh(&fq->q.lock);
0d53778e 617 pr_debug("Can't insert skb to queue\n");
4b6cb5d8 618 fq_put(fq);
9fb9cbb1
YK
619 goto ret_orig;
620 }
621
bc578a54
JP
622 if (fq->q.last_in == (INET_FRAG_FIRST_IN | INET_FRAG_LAST_IN) &&
623 fq->q.meat == fq->q.len) {
9fb9cbb1
YK
624 ret_skb = nf_ct_frag6_reasm(fq, dev);
625 if (ret_skb == NULL)
0d53778e 626 pr_debug("Can't reassemble fragmented packets\n");
9fb9cbb1 627 }
b9c69896 628 spin_unlock_bh(&fq->q.lock);
9fb9cbb1 629
4b6cb5d8 630 fq_put(fq);
9fb9cbb1
YK
631 return ret_skb;
632
633ret_orig:
634 kfree_skb(clone);
635 return skb;
636}
637
638void nf_ct_frag6_output(unsigned int hooknum, struct sk_buff *skb,
639 struct net_device *in, struct net_device *out,
640 int (*okfn)(struct sk_buff *))
641{
642 struct sk_buff *s, *s2;
643
644 for (s = NFCT_FRAG6_CB(skb)->orig; s;) {
645 nf_conntrack_put_reasm(s->nfct_reasm);
646 nf_conntrack_get_reasm(skb);
647 s->nfct_reasm = skb;
648
649 s2 = s->next;
f9f02cca
PM
650 s->next = NULL;
651
9fb9cbb1
YK
652 NF_HOOK_THRESH(PF_INET6, hooknum, s, in, out, okfn,
653 NF_IP6_PRI_CONNTRACK_DEFRAG + 1);
654 s = s2;
655 }
656 nf_conntrack_put_reasm(skb);
657}
658
9fb9cbb1
YK
659int nf_ct_frag6_init(void)
660{
321a3a99 661 nf_frags.hashfn = nf_hashfn;
c6fda282 662 nf_frags.constructor = ip6_frag_init;
c9547709 663 nf_frags.destructor = NULL;
1e4b8287
PE
664 nf_frags.skb_free = nf_skb_free;
665 nf_frags.qsize = sizeof(struct nf_ct_frag6_queue);
abd6523d 666 nf_frags.match = ip6_frag_match;
e521db9d 667 nf_frags.frag_expire = nf_ct_frag6_expire;
3b4bc4a2 668 nf_frags.secret_interval = 10 * 60 * HZ;
b2fd5321 669 nf_init_frags.timeout = IPV6_FRAG_TIMEOUT;
7c070aa9
SW
670 nf_init_frags.high_thresh = IPV6_FRAG_HIGH_THRESH;
671 nf_init_frags.low_thresh = IPV6_FRAG_LOW_THRESH;
e5a2bb84 672 inet_frags_init_net(&nf_init_frags);
7eb95156 673 inet_frags_init(&nf_frags);
9fb9cbb1
YK
674
675 return 0;
676}
677
678void nf_ct_frag6_cleanup(void)
679{
7eb95156
PE
680 inet_frags_fini(&nf_frags);
681
e31e0bdc 682 nf_init_frags.low_thresh = 0;
9fb9cbb1
YK
683 nf_ct_frag6_evictor();
684}