[INET]: Consolidate the xxx_evictor
[deliverable/linux.git] / net / ipv6 / reassembly.c
1 /*
2 * IPv6 fragment reassembly
3 * Linux INET6 implementation
4 *
5 * Authors:
6 * Pedro Roque <roque@di.fc.ul.pt>
7 *
8 * $Id: reassembly.c,v 1.26 2001/03/07 22:00:57 davem Exp $
9 *
10 * Based on: net/ipv4/ip_fragment.c
11 *
12 * This program is free software; you can redistribute it and/or
13 * modify it under the terms of the GNU General Public License
14 * as published by the Free Software Foundation; either version
15 * 2 of the License, or (at your option) any later version.
16 */
17
18 /*
19 * Fixes:
20 * Andi Kleen Make it work with multiple hosts.
21 * More RFC compliance.
22 *
23 * Horst von Brand Add missing #include <linux/string.h>
24 * Alexey Kuznetsov SMP races, threading, cleanup.
25 * Patrick McHardy LRU queue of frag heads for evictor.
26 * Mitsuru KANDA @USAGI Register inet6_protocol{}.
27 * David Stevens and
28 * YOSHIFUJI,H. @USAGI Always remove fragment header to
29 * calculate ICV correctly.
30 */
31 #include <linux/errno.h>
32 #include <linux/types.h>
33 #include <linux/string.h>
34 #include <linux/socket.h>
35 #include <linux/sockios.h>
36 #include <linux/jiffies.h>
37 #include <linux/net.h>
38 #include <linux/list.h>
39 #include <linux/netdevice.h>
40 #include <linux/in6.h>
41 #include <linux/ipv6.h>
42 #include <linux/icmpv6.h>
43 #include <linux/random.h>
44 #include <linux/jhash.h>
45 #include <linux/skbuff.h>
46
47 #include <net/sock.h>
48 #include <net/snmp.h>
49
50 #include <net/ipv6.h>
51 #include <net/ip6_route.h>
52 #include <net/protocol.h>
53 #include <net/transp_v6.h>
54 #include <net/rawv6.h>
55 #include <net/ndisc.h>
56 #include <net/addrconf.h>
57 #include <net/inet_frag.h>
58
59 struct ip6frag_skb_cb
60 {
61 struct inet6_skb_parm h;
62 int offset;
63 };
64
65 #define FRAG6_CB(skb) ((struct ip6frag_skb_cb*)((skb)->cb))
66
67
68 /*
69 * Equivalent of ipv4 struct ipq
70 */
71
72 struct frag_queue
73 {
74 struct inet_frag_queue q;
75
76 __be32 id; /* fragment id */
77 struct in6_addr saddr;
78 struct in6_addr daddr;
79
80 int iif;
81 unsigned int csum;
82 __u16 nhoffset;
83 };
84
85 struct inet_frags_ctl ip6_frags_ctl __read_mostly = {
86 .high_thresh = 256 * 1024,
87 .low_thresh = 192 * 1024,
88 .timeout = IPV6_FRAG_TIMEOUT,
89 .secret_interval = 10 * 60 * HZ,
90 };
91
92 static struct inet_frags ip6_frags;
93
94 int ip6_frag_nqueues(void)
95 {
96 return ip6_frags.nqueues;
97 }
98
99 int ip6_frag_mem(void)
100 {
101 return atomic_read(&ip6_frags.mem);
102 }
103
104 static int ip6_frag_reasm(struct frag_queue *fq, struct sk_buff *prev,
105 struct net_device *dev);
106
107 /*
108 * callers should be careful not to use the hash value outside the ipfrag_lock
109 * as doing so could race with ipfrag_hash_rnd being recalculated.
110 */
111 static unsigned int ip6qhashfn(__be32 id, struct in6_addr *saddr,
112 struct in6_addr *daddr)
113 {
114 u32 a, b, c;
115
116 a = (__force u32)saddr->s6_addr32[0];
117 b = (__force u32)saddr->s6_addr32[1];
118 c = (__force u32)saddr->s6_addr32[2];
119
120 a += JHASH_GOLDEN_RATIO;
121 b += JHASH_GOLDEN_RATIO;
122 c += ip6_frags.rnd;
123 __jhash_mix(a, b, c);
124
125 a += (__force u32)saddr->s6_addr32[3];
126 b += (__force u32)daddr->s6_addr32[0];
127 c += (__force u32)daddr->s6_addr32[1];
128 __jhash_mix(a, b, c);
129
130 a += (__force u32)daddr->s6_addr32[2];
131 b += (__force u32)daddr->s6_addr32[3];
132 c += (__force u32)id;
133 __jhash_mix(a, b, c);
134
135 return c & (INETFRAGS_HASHSZ - 1);
136 }
137
138 static unsigned int ip6_hashfn(struct inet_frag_queue *q)
139 {
140 struct frag_queue *fq;
141
142 fq = container_of(q, struct frag_queue, q);
143 return ip6qhashfn(fq->id, &fq->saddr, &fq->daddr);
144 }
145
146 /* Memory Tracking Functions. */
147 static inline void frag_kfree_skb(struct sk_buff *skb, int *work)
148 {
149 if (work)
150 *work -= skb->truesize;
151 atomic_sub(skb->truesize, &ip6_frags.mem);
152 kfree_skb(skb);
153 }
154
155 static void ip6_frag_free(struct inet_frag_queue *fq)
156 {
157 kfree(container_of(fq, struct frag_queue, q));
158 }
159
160 static inline struct frag_queue *frag_alloc_queue(void)
161 {
162 struct frag_queue *fq = kzalloc(sizeof(struct frag_queue), GFP_ATOMIC);
163
164 if(!fq)
165 return NULL;
166 atomic_add(sizeof(struct frag_queue), &ip6_frags.mem);
167 return fq;
168 }
169
170 /* Destruction primitives. */
171
172 static __inline__ void fq_put(struct frag_queue *fq, int *work)
173 {
174 if (atomic_dec_and_test(&fq->q.refcnt))
175 inet_frag_destroy(&fq->q, &ip6_frags, work);
176 }
177
178 /* Kill fq entry. It is not destroyed immediately,
179 * because caller (and someone more) holds reference count.
180 */
181 static __inline__ void fq_kill(struct frag_queue *fq)
182 {
183 inet_frag_kill(&fq->q, &ip6_frags);
184 }
185
186 static void ip6_evictor(struct inet6_dev *idev)
187 {
188 int evicted;
189
190 evicted = inet_frag_evictor(&ip6_frags);
191 if (evicted)
192 IP6_ADD_STATS_BH(idev, IPSTATS_MIB_REASMFAILS, evicted);
193 }
194
195 static void ip6_frag_expire(unsigned long data)
196 {
197 struct frag_queue *fq = (struct frag_queue *) data;
198 struct net_device *dev = NULL;
199
200 spin_lock(&fq->q.lock);
201
202 if (fq->q.last_in & COMPLETE)
203 goto out;
204
205 fq_kill(fq);
206
207 dev = dev_get_by_index(&init_net, fq->iif);
208 if (!dev)
209 goto out;
210
211 rcu_read_lock();
212 IP6_INC_STATS_BH(__in6_dev_get(dev), IPSTATS_MIB_REASMTIMEOUT);
213 IP6_INC_STATS_BH(__in6_dev_get(dev), IPSTATS_MIB_REASMFAILS);
214 rcu_read_unlock();
215
216 /* Don't send error if the first segment did not arrive. */
217 if (!(fq->q.last_in&FIRST_IN) || !fq->q.fragments)
218 goto out;
219
220 /*
221 But use as source device on which LAST ARRIVED
222 segment was received. And do not use fq->dev
223 pointer directly, device might already disappeared.
224 */
225 fq->q.fragments->dev = dev;
226 icmpv6_send(fq->q.fragments, ICMPV6_TIME_EXCEED, ICMPV6_EXC_FRAGTIME, 0, dev);
227 out:
228 if (dev)
229 dev_put(dev);
230 spin_unlock(&fq->q.lock);
231 fq_put(fq, NULL);
232 }
233
234 /* Creation primitives. */
235
236
237 static struct frag_queue *ip6_frag_intern(struct frag_queue *fq_in)
238 {
239 struct frag_queue *fq;
240 unsigned int hash;
241 #ifdef CONFIG_SMP
242 struct hlist_node *n;
243 #endif
244
245 write_lock(&ip6_frags.lock);
246 hash = ip6qhashfn(fq_in->id, &fq_in->saddr, &fq_in->daddr);
247 #ifdef CONFIG_SMP
248 hlist_for_each_entry(fq, n, &ip6_frags.hash[hash], q.list) {
249 if (fq->id == fq_in->id &&
250 ipv6_addr_equal(&fq_in->saddr, &fq->saddr) &&
251 ipv6_addr_equal(&fq_in->daddr, &fq->daddr)) {
252 atomic_inc(&fq->q.refcnt);
253 write_unlock(&ip6_frags.lock);
254 fq_in->q.last_in |= COMPLETE;
255 fq_put(fq_in, NULL);
256 return fq;
257 }
258 }
259 #endif
260 fq = fq_in;
261
262 if (!mod_timer(&fq->q.timer, jiffies + ip6_frags_ctl.timeout))
263 atomic_inc(&fq->q.refcnt);
264
265 atomic_inc(&fq->q.refcnt);
266 hlist_add_head(&fq->q.list, &ip6_frags.hash[hash]);
267 INIT_LIST_HEAD(&fq->q.lru_list);
268 list_add_tail(&fq->q.lru_list, &ip6_frags.lru_list);
269 ip6_frags.nqueues++;
270 write_unlock(&ip6_frags.lock);
271 return fq;
272 }
273
274
275 static struct frag_queue *
276 ip6_frag_create(__be32 id, struct in6_addr *src, struct in6_addr *dst,
277 struct inet6_dev *idev)
278 {
279 struct frag_queue *fq;
280
281 if ((fq = frag_alloc_queue()) == NULL)
282 goto oom;
283
284 fq->id = id;
285 ipv6_addr_copy(&fq->saddr, src);
286 ipv6_addr_copy(&fq->daddr, dst);
287
288 init_timer(&fq->q.timer);
289 fq->q.timer.function = ip6_frag_expire;
290 fq->q.timer.data = (long) fq;
291 spin_lock_init(&fq->q.lock);
292 atomic_set(&fq->q.refcnt, 1);
293
294 return ip6_frag_intern(fq);
295
296 oom:
297 IP6_INC_STATS_BH(idev, IPSTATS_MIB_REASMFAILS);
298 return NULL;
299 }
300
301 static __inline__ struct frag_queue *
302 fq_find(__be32 id, struct in6_addr *src, struct in6_addr *dst,
303 struct inet6_dev *idev)
304 {
305 struct frag_queue *fq;
306 struct hlist_node *n;
307 unsigned int hash;
308
309 read_lock(&ip6_frags.lock);
310 hash = ip6qhashfn(id, src, dst);
311 hlist_for_each_entry(fq, n, &ip6_frags.hash[hash], q.list) {
312 if (fq->id == id &&
313 ipv6_addr_equal(src, &fq->saddr) &&
314 ipv6_addr_equal(dst, &fq->daddr)) {
315 atomic_inc(&fq->q.refcnt);
316 read_unlock(&ip6_frags.lock);
317 return fq;
318 }
319 }
320 read_unlock(&ip6_frags.lock);
321
322 return ip6_frag_create(id, src, dst, idev);
323 }
324
325
326 static int ip6_frag_queue(struct frag_queue *fq, struct sk_buff *skb,
327 struct frag_hdr *fhdr, int nhoff)
328 {
329 struct sk_buff *prev, *next;
330 struct net_device *dev;
331 int offset, end;
332
333 if (fq->q.last_in & COMPLETE)
334 goto err;
335
336 offset = ntohs(fhdr->frag_off) & ~0x7;
337 end = offset + (ntohs(ipv6_hdr(skb)->payload_len) -
338 ((u8 *)(fhdr + 1) - (u8 *)(ipv6_hdr(skb) + 1)));
339
340 if ((unsigned int)end > IPV6_MAXPLEN) {
341 IP6_INC_STATS_BH(ip6_dst_idev(skb->dst),
342 IPSTATS_MIB_INHDRERRORS);
343 icmpv6_param_prob(skb, ICMPV6_HDR_FIELD,
344 ((u8 *)&fhdr->frag_off -
345 skb_network_header(skb)));
346 return -1;
347 }
348
349 if (skb->ip_summed == CHECKSUM_COMPLETE) {
350 const unsigned char *nh = skb_network_header(skb);
351 skb->csum = csum_sub(skb->csum,
352 csum_partial(nh, (u8 *)(fhdr + 1) - nh,
353 0));
354 }
355
356 /* Is this the final fragment? */
357 if (!(fhdr->frag_off & htons(IP6_MF))) {
358 /* If we already have some bits beyond end
359 * or have different end, the segment is corrupted.
360 */
361 if (end < fq->q.len ||
362 ((fq->q.last_in & LAST_IN) && end != fq->q.len))
363 goto err;
364 fq->q.last_in |= LAST_IN;
365 fq->q.len = end;
366 } else {
367 /* Check if the fragment is rounded to 8 bytes.
368 * Required by the RFC.
369 */
370 if (end & 0x7) {
371 /* RFC2460 says always send parameter problem in
372 * this case. -DaveM
373 */
374 IP6_INC_STATS_BH(ip6_dst_idev(skb->dst),
375 IPSTATS_MIB_INHDRERRORS);
376 icmpv6_param_prob(skb, ICMPV6_HDR_FIELD,
377 offsetof(struct ipv6hdr, payload_len));
378 return -1;
379 }
380 if (end > fq->q.len) {
381 /* Some bits beyond end -> corruption. */
382 if (fq->q.last_in & LAST_IN)
383 goto err;
384 fq->q.len = end;
385 }
386 }
387
388 if (end == offset)
389 goto err;
390
391 /* Point into the IP datagram 'data' part. */
392 if (!pskb_pull(skb, (u8 *) (fhdr + 1) - skb->data))
393 goto err;
394
395 if (pskb_trim_rcsum(skb, end - offset))
396 goto err;
397
398 /* Find out which fragments are in front and at the back of us
399 * in the chain of fragments so far. We must know where to put
400 * this fragment, right?
401 */
402 prev = NULL;
403 for(next = fq->q.fragments; next != NULL; next = next->next) {
404 if (FRAG6_CB(next)->offset >= offset)
405 break; /* bingo! */
406 prev = next;
407 }
408
409 /* We found where to put this one. Check for overlap with
410 * preceding fragment, and, if needed, align things so that
411 * any overlaps are eliminated.
412 */
413 if (prev) {
414 int i = (FRAG6_CB(prev)->offset + prev->len) - offset;
415
416 if (i > 0) {
417 offset += i;
418 if (end <= offset)
419 goto err;
420 if (!pskb_pull(skb, i))
421 goto err;
422 if (skb->ip_summed != CHECKSUM_UNNECESSARY)
423 skb->ip_summed = CHECKSUM_NONE;
424 }
425 }
426
427 /* Look for overlap with succeeding segments.
428 * If we can merge fragments, do it.
429 */
430 while (next && FRAG6_CB(next)->offset < end) {
431 int i = end - FRAG6_CB(next)->offset; /* overlap is 'i' bytes */
432
433 if (i < next->len) {
434 /* Eat head of the next overlapped fragment
435 * and leave the loop. The next ones cannot overlap.
436 */
437 if (!pskb_pull(next, i))
438 goto err;
439 FRAG6_CB(next)->offset += i; /* next fragment */
440 fq->q.meat -= i;
441 if (next->ip_summed != CHECKSUM_UNNECESSARY)
442 next->ip_summed = CHECKSUM_NONE;
443 break;
444 } else {
445 struct sk_buff *free_it = next;
446
447 /* Old fragment is completely overridden with
448 * new one drop it.
449 */
450 next = next->next;
451
452 if (prev)
453 prev->next = next;
454 else
455 fq->q.fragments = next;
456
457 fq->q.meat -= free_it->len;
458 frag_kfree_skb(free_it, NULL);
459 }
460 }
461
462 FRAG6_CB(skb)->offset = offset;
463
464 /* Insert this fragment in the chain of fragments. */
465 skb->next = next;
466 if (prev)
467 prev->next = skb;
468 else
469 fq->q.fragments = skb;
470
471 dev = skb->dev;
472 if (dev) {
473 fq->iif = dev->ifindex;
474 skb->dev = NULL;
475 }
476 fq->q.stamp = skb->tstamp;
477 fq->q.meat += skb->len;
478 atomic_add(skb->truesize, &ip6_frags.mem);
479
480 /* The first fragment.
481 * nhoffset is obtained from the first fragment, of course.
482 */
483 if (offset == 0) {
484 fq->nhoffset = nhoff;
485 fq->q.last_in |= FIRST_IN;
486 }
487
488 if (fq->q.last_in == (FIRST_IN | LAST_IN) && fq->q.meat == fq->q.len)
489 return ip6_frag_reasm(fq, prev, dev);
490
491 write_lock(&ip6_frags.lock);
492 list_move_tail(&fq->q.lru_list, &ip6_frags.lru_list);
493 write_unlock(&ip6_frags.lock);
494 return -1;
495
496 err:
497 IP6_INC_STATS(ip6_dst_idev(skb->dst), IPSTATS_MIB_REASMFAILS);
498 kfree_skb(skb);
499 return -1;
500 }
501
502 /*
503 * Check if this packet is complete.
504 * Returns NULL on failure by any reason, and pointer
505 * to current nexthdr field in reassembled frame.
506 *
507 * It is called with locked fq, and caller must check that
508 * queue is eligible for reassembly i.e. it is not COMPLETE,
509 * the last and the first frames arrived and all the bits are here.
510 */
511 static int ip6_frag_reasm(struct frag_queue *fq, struct sk_buff *prev,
512 struct net_device *dev)
513 {
514 struct sk_buff *fp, *head = fq->q.fragments;
515 int payload_len;
516 unsigned int nhoff;
517
518 fq_kill(fq);
519
520 /* Make the one we just received the head. */
521 if (prev) {
522 head = prev->next;
523 fp = skb_clone(head, GFP_ATOMIC);
524
525 if (!fp)
526 goto out_oom;
527
528 fp->next = head->next;
529 prev->next = fp;
530
531 skb_morph(head, fq->q.fragments);
532 head->next = fq->q.fragments->next;
533
534 kfree_skb(fq->q.fragments);
535 fq->q.fragments = head;
536 }
537
538 BUG_TRAP(head != NULL);
539 BUG_TRAP(FRAG6_CB(head)->offset == 0);
540
541 /* Unfragmented part is taken from the first segment. */
542 payload_len = ((head->data - skb_network_header(head)) -
543 sizeof(struct ipv6hdr) + fq->q.len -
544 sizeof(struct frag_hdr));
545 if (payload_len > IPV6_MAXPLEN)
546 goto out_oversize;
547
548 /* Head of list must not be cloned. */
549 if (skb_cloned(head) && pskb_expand_head(head, 0, 0, GFP_ATOMIC))
550 goto out_oom;
551
552 /* If the first fragment is fragmented itself, we split
553 * it to two chunks: the first with data and paged part
554 * and the second, holding only fragments. */
555 if (skb_shinfo(head)->frag_list) {
556 struct sk_buff *clone;
557 int i, plen = 0;
558
559 if ((clone = alloc_skb(0, GFP_ATOMIC)) == NULL)
560 goto out_oom;
561 clone->next = head->next;
562 head->next = clone;
563 skb_shinfo(clone)->frag_list = skb_shinfo(head)->frag_list;
564 skb_shinfo(head)->frag_list = NULL;
565 for (i=0; i<skb_shinfo(head)->nr_frags; i++)
566 plen += skb_shinfo(head)->frags[i].size;
567 clone->len = clone->data_len = head->data_len - plen;
568 head->data_len -= clone->len;
569 head->len -= clone->len;
570 clone->csum = 0;
571 clone->ip_summed = head->ip_summed;
572 atomic_add(clone->truesize, &ip6_frags.mem);
573 }
574
575 /* We have to remove fragment header from datagram and to relocate
576 * header in order to calculate ICV correctly. */
577 nhoff = fq->nhoffset;
578 skb_network_header(head)[nhoff] = skb_transport_header(head)[0];
579 memmove(head->head + sizeof(struct frag_hdr), head->head,
580 (head->data - head->head) - sizeof(struct frag_hdr));
581 head->mac_header += sizeof(struct frag_hdr);
582 head->network_header += sizeof(struct frag_hdr);
583
584 skb_shinfo(head)->frag_list = head->next;
585 skb_reset_transport_header(head);
586 skb_push(head, head->data - skb_network_header(head));
587 atomic_sub(head->truesize, &ip6_frags.mem);
588
589 for (fp=head->next; fp; fp = fp->next) {
590 head->data_len += fp->len;
591 head->len += fp->len;
592 if (head->ip_summed != fp->ip_summed)
593 head->ip_summed = CHECKSUM_NONE;
594 else if (head->ip_summed == CHECKSUM_COMPLETE)
595 head->csum = csum_add(head->csum, fp->csum);
596 head->truesize += fp->truesize;
597 atomic_sub(fp->truesize, &ip6_frags.mem);
598 }
599
600 head->next = NULL;
601 head->dev = dev;
602 head->tstamp = fq->q.stamp;
603 ipv6_hdr(head)->payload_len = htons(payload_len);
604 IP6CB(head)->nhoff = nhoff;
605
606 /* Yes, and fold redundant checksum back. 8) */
607 if (head->ip_summed == CHECKSUM_COMPLETE)
608 head->csum = csum_partial(skb_network_header(head),
609 skb_network_header_len(head),
610 head->csum);
611
612 rcu_read_lock();
613 IP6_INC_STATS_BH(__in6_dev_get(dev), IPSTATS_MIB_REASMOKS);
614 rcu_read_unlock();
615 fq->q.fragments = NULL;
616 return 1;
617
618 out_oversize:
619 if (net_ratelimit())
620 printk(KERN_DEBUG "ip6_frag_reasm: payload len = %d\n", payload_len);
621 goto out_fail;
622 out_oom:
623 if (net_ratelimit())
624 printk(KERN_DEBUG "ip6_frag_reasm: no memory for reassembly\n");
625 out_fail:
626 rcu_read_lock();
627 IP6_INC_STATS_BH(__in6_dev_get(dev), IPSTATS_MIB_REASMFAILS);
628 rcu_read_unlock();
629 return -1;
630 }
631
632 static int ipv6_frag_rcv(struct sk_buff **skbp)
633 {
634 struct sk_buff *skb = *skbp;
635 struct frag_hdr *fhdr;
636 struct frag_queue *fq;
637 struct ipv6hdr *hdr = ipv6_hdr(skb);
638
639 IP6_INC_STATS_BH(ip6_dst_idev(skb->dst), IPSTATS_MIB_REASMREQDS);
640
641 /* Jumbo payload inhibits frag. header */
642 if (hdr->payload_len==0) {
643 IP6_INC_STATS(ip6_dst_idev(skb->dst), IPSTATS_MIB_INHDRERRORS);
644 icmpv6_param_prob(skb, ICMPV6_HDR_FIELD,
645 skb_network_header_len(skb));
646 return -1;
647 }
648 if (!pskb_may_pull(skb, (skb_transport_offset(skb) +
649 sizeof(struct frag_hdr)))) {
650 IP6_INC_STATS(ip6_dst_idev(skb->dst), IPSTATS_MIB_INHDRERRORS);
651 icmpv6_param_prob(skb, ICMPV6_HDR_FIELD,
652 skb_network_header_len(skb));
653 return -1;
654 }
655
656 hdr = ipv6_hdr(skb);
657 fhdr = (struct frag_hdr *)skb_transport_header(skb);
658
659 if (!(fhdr->frag_off & htons(0xFFF9))) {
660 /* It is not a fragmented frame */
661 skb->transport_header += sizeof(struct frag_hdr);
662 IP6_INC_STATS_BH(ip6_dst_idev(skb->dst), IPSTATS_MIB_REASMOKS);
663
664 IP6CB(skb)->nhoff = (u8 *)fhdr - skb_network_header(skb);
665 return 1;
666 }
667
668 if (atomic_read(&ip6_frags.mem) > ip6_frags_ctl.high_thresh)
669 ip6_evictor(ip6_dst_idev(skb->dst));
670
671 if ((fq = fq_find(fhdr->identification, &hdr->saddr, &hdr->daddr,
672 ip6_dst_idev(skb->dst))) != NULL) {
673 int ret;
674
675 spin_lock(&fq->q.lock);
676
677 ret = ip6_frag_queue(fq, skb, fhdr, IP6CB(skb)->nhoff);
678
679 spin_unlock(&fq->q.lock);
680 fq_put(fq, NULL);
681 return ret;
682 }
683
684 IP6_INC_STATS_BH(ip6_dst_idev(skb->dst), IPSTATS_MIB_REASMFAILS);
685 kfree_skb(skb);
686 return -1;
687 }
688
689 static struct inet6_protocol frag_protocol =
690 {
691 .handler = ipv6_frag_rcv,
692 .flags = INET6_PROTO_NOPOLICY,
693 };
694
695 void __init ipv6_frag_init(void)
696 {
697 if (inet6_add_protocol(&frag_protocol, IPPROTO_FRAGMENT) < 0)
698 printk(KERN_ERR "ipv6_frag_init: Could not register protocol\n");
699
700 ip6_frags.ctl = &ip6_frags_ctl;
701 ip6_frags.hashfn = ip6_hashfn;
702 ip6_frags.destructor = ip6_frag_free;
703 ip6_frags.skb_free = NULL;
704 ip6_frags.qsize = sizeof(struct frag_queue);
705 inet_frags_init(&ip6_frags);
706 }
This page took 0.055456 seconds and 5 git commands to generate.