2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. Neither the name of the project nor the names of its contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * $KAME: frag6.c,v 1.33 2002/01/07 11:34:48 kjc Exp $
34 #include <sys/cdefs.h>
35 __FBSDID("$FreeBSD$");
39 #include <sys/param.h>
40 #include <sys/systm.h>
41 #include <sys/malloc.h>
43 #include <sys/domain.h>
44 #include <sys/eventhandler.h>
45 #include <sys/protosw.h>
46 #include <sys/socket.h>
47 #include <sys/errno.h>
49 #include <sys/kernel.h>
50 #include <sys/syslog.h>
53 #include <net/if_var.h>
54 #include <net/netisr.h>
55 #include <net/route.h>
58 #include <netinet/in.h>
59 #include <netinet/in_var.h>
60 #include <netinet/ip6.h>
61 #include <netinet6/ip6_var.h>
62 #include <netinet/icmp6.h>
63 #include <netinet/in_systm.h> /* for ECN definitions */
64 #include <netinet/ip.h> /* for ECN definitions */
66 #include <security/mac/mac_framework.h>
68 static void frag6_enq(struct ip6asfrag *, struct ip6asfrag *);
69 static void frag6_deq(struct ip6asfrag *);
70 static void frag6_insque(struct ip6q *, struct ip6q *);
71 static void frag6_remque(struct ip6q *);
72 static void frag6_freef(struct ip6q *);
74 static struct mtx ip6qlock;
76 * These fields all protected by ip6qlock.
78 VNET_DEFINE_STATIC(u_int, frag6_nfragpackets);
79 VNET_DEFINE_STATIC(u_int, frag6_nfrags);
80 VNET_DEFINE_STATIC(struct ip6q, ip6q); /* ip6 reassemble queue */
82 #define V_frag6_nfragpackets VNET(frag6_nfragpackets)
83 #define V_frag6_nfrags VNET(frag6_nfrags)
84 #define V_ip6q VNET(ip6q)
86 #define IP6Q_LOCK_INIT() mtx_init(&ip6qlock, "ip6qlock", NULL, MTX_DEF);
87 #define IP6Q_LOCK() mtx_lock(&ip6qlock)
88 #define IP6Q_TRYLOCK() mtx_trylock(&ip6qlock)
89 #define IP6Q_LOCK_ASSERT() mtx_assert(&ip6qlock, MA_OWNED)
90 #define IP6Q_UNLOCK() mtx_unlock(&ip6qlock)
92 static MALLOC_DEFINE(M_FTABLE, "fragment", "fragment reassembly header");
95 * Initialise reassembly queue and fragment identifier.
98 frag6_change(void *tag)
101 V_ip6_maxfragpackets = nmbclusters / 4;
102 V_ip6_maxfrags = nmbclusters / 4;
109 V_ip6_maxfragpackets = nmbclusters / 4;
110 V_ip6_maxfrags = nmbclusters / 4;
111 V_ip6q.ip6q_next = V_ip6q.ip6q_prev = &V_ip6q;
113 if (!IS_DEFAULT_VNET(curvnet))
116 EVENTHANDLER_REGISTER(nmbclusters_change,
117 frag6_change, NULL, EVENTHANDLER_PRI_ANY);
123 * In RFC2460, fragment and reassembly rule do not agree with each other,
124 * in terms of next header field handling in fragment header.
125 * While the sender will use the same value for all of the fragmented packets,
126 * receiver is suggested not to check the consistency.
128 * fragment rule (p20):
129 * (2) A Fragment header containing:
130 * The Next Header value that identifies the first header of
131 * the Fragmentable Part of the original packet.
132 * -> next header field is same for all fragments
134 * reassembly rule (p21):
135 * The Next Header field of the last header of the Unfragmentable
136 * Part is obtained from the Next Header field of the first
137 * fragment's Fragment header.
138 * -> should grab it from the first fragment only
140 * The following note also contradicts with fragment rule - no one is going to
141 * send different fragment with different next header field.
143 * additional note (p22):
144 * The Next Header values in the Fragment headers of different
145 * fragments of the same original packet may differ. Only the value
146 * from the Offset zero fragment packet is used for reassembly.
147 * -> should grab it from the first fragment only
149 * There is no explicit reason given in the RFC. Historical reason maybe?
155 frag6_input(struct mbuf **mp, int *offp, int proto)
157 struct mbuf *m = *mp, *t;
159 struct ip6_frag *ip6f;
161 struct ip6asfrag *af6, *ip6af, *af6dwn;
162 struct in6_ifaddr *ia;
163 int offset = *offp, nxt, i, next;
165 int fragoff, frgpartlen; /* must be larger than u_int16_t */
166 struct ifnet *dstifp;
170 struct ip6_direct_ctx *ip6dc;
174 char ip6buf[INET6_ADDRSTRLEN];
177 ip6 = mtod(m, struct ip6_hdr *);
178 #ifndef PULLDOWN_TEST
179 IP6_EXTHDR_CHECK(m, offset, sizeof(struct ip6_frag), IPPROTO_DONE);
180 ip6f = (struct ip6_frag *)((caddr_t)ip6 + offset);
182 IP6_EXTHDR_GET(ip6f, struct ip6_frag *, m, offset, sizeof(*ip6f));
184 return (IPPROTO_DONE);
188 /* find the destination interface of the packet. */
189 ia = in6ifa_ifwithaddr(&ip6->ip6_dst, 0 /* XXX */);
192 ifa_free(&ia->ia_ifa);
194 /* jumbo payload can't contain a fragment header */
195 if (ip6->ip6_plen == 0) {
196 icmp6_error(m, ICMP6_PARAM_PROB, ICMP6_PARAMPROB_HEADER, offset);
197 in6_ifstat_inc(dstifp, ifs6_reass_fail);
202 * check whether fragment packet's fragment length is
203 * multiple of 8 octets.
204 * sizeof(struct ip6_frag) == 8
205 * sizeof(struct ip6_hdr) = 40
207 if ((ip6f->ip6f_offlg & IP6F_MORE_FRAG) &&
208 (((ntohs(ip6->ip6_plen) - offset) & 0x7) != 0)) {
209 icmp6_error(m, ICMP6_PARAM_PROB, ICMP6_PARAMPROB_HEADER,
210 offsetof(struct ip6_hdr, ip6_plen));
211 in6_ifstat_inc(dstifp, ifs6_reass_fail);
215 IP6STAT_INC(ip6s_fragments);
216 in6_ifstat_inc(dstifp, ifs6_reass_reqd);
218 /* offset now points to data portion */
219 offset += sizeof(struct ip6_frag);
222 * RFC 6946: Handle "atomic" fragments (offset and m bit set to 0)
223 * upfront, unrelated to any reassembly. Just skip the fragment header.
225 if ((ip6f->ip6f_offlg & ~IP6F_RESERVED_MASK) == 0) {
226 /* XXX-BZ we want dedicated counters for this. */
227 IP6STAT_INC(ip6s_reassembled);
228 in6_ifstat_inc(dstifp, ifs6_reass_ok);
230 m->m_flags |= M_FRAGMENTED;
231 return (ip6f->ip6f_nxt);
237 * Enforce upper bound on number of fragments.
238 * If maxfrag is 0, never accept fragments.
239 * If maxfrag is -1, accept all fragments without limitation.
241 if (V_ip6_maxfrags < 0)
243 else if (V_frag6_nfrags >= (u_int)V_ip6_maxfrags)
246 for (q6 = V_ip6q.ip6q_next; q6 != &V_ip6q; q6 = q6->ip6q_next)
247 if (ip6f->ip6f_ident == q6->ip6q_ident &&
248 IN6_ARE_ADDR_EQUAL(&ip6->ip6_src, &q6->ip6q_src) &&
249 IN6_ARE_ADDR_EQUAL(&ip6->ip6_dst, &q6->ip6q_dst)
251 && mac_ip6q_match(m, q6)
258 * the first fragment to arrive, create a reassembly queue.
263 * Enforce upper bound on number of fragmented packets
264 * for which we attempt reassembly;
265 * If maxfragpackets is 0, never accept fragments.
266 * If maxfragpackets is -1, accept all fragments without
269 if (V_ip6_maxfragpackets < 0)
271 else if (V_frag6_nfragpackets >= (u_int)V_ip6_maxfragpackets)
273 V_frag6_nfragpackets++;
274 q6 = (struct ip6q *)malloc(sizeof(struct ip6q), M_FTABLE,
278 bzero(q6, sizeof(*q6));
280 if (mac_ip6q_init(q6, M_NOWAIT) != 0) {
284 mac_ip6q_create(m, q6);
286 frag6_insque(q6, &V_ip6q);
288 /* ip6q_nxt will be filled afterwards, from 1st fragment */
289 q6->ip6q_down = q6->ip6q_up = (struct ip6asfrag *)q6;
291 q6->ip6q_nxtp = (u_char *)nxtp;
293 q6->ip6q_ident = ip6f->ip6f_ident;
294 q6->ip6q_ttl = IPV6_FRAGTTL;
295 q6->ip6q_src = ip6->ip6_src;
296 q6->ip6q_dst = ip6->ip6_dst;
298 (ntohl(ip6->ip6_flow) >> 20) & IPTOS_ECN_MASK;
299 q6->ip6q_unfrglen = -1; /* The 1st fragment has not arrived. */
305 * If it's the 1st fragment, record the length of the
306 * unfragmentable part and the next header of the fragment header.
308 fragoff = ntohs(ip6f->ip6f_offlg & IP6F_OFF_MASK);
310 q6->ip6q_unfrglen = offset - sizeof(struct ip6_hdr) -
311 sizeof(struct ip6_frag);
312 q6->ip6q_nxt = ip6f->ip6f_nxt;
316 * Check that the reassembled packet would not exceed 65535 bytes
318 * If it would exceed, discard the fragment and return an ICMP error.
320 frgpartlen = sizeof(struct ip6_hdr) + ntohs(ip6->ip6_plen) - offset;
321 if (q6->ip6q_unfrglen >= 0) {
322 /* The 1st fragment has already arrived. */
323 if (q6->ip6q_unfrglen + fragoff + frgpartlen > IPV6_MAXPACKET) {
324 icmp6_error(m, ICMP6_PARAM_PROB, ICMP6_PARAMPROB_HEADER,
325 offset - sizeof(struct ip6_frag) +
326 offsetof(struct ip6_frag, ip6f_offlg));
328 return (IPPROTO_DONE);
330 } else if (fragoff + frgpartlen > IPV6_MAXPACKET) {
331 icmp6_error(m, ICMP6_PARAM_PROB, ICMP6_PARAMPROB_HEADER,
332 offset - sizeof(struct ip6_frag) +
333 offsetof(struct ip6_frag, ip6f_offlg));
335 return (IPPROTO_DONE);
338 * If it's the first fragment, do the above check for each
339 * fragment already stored in the reassembly queue.
342 for (af6 = q6->ip6q_down; af6 != (struct ip6asfrag *)q6;
344 af6dwn = af6->ip6af_down;
346 if (q6->ip6q_unfrglen + af6->ip6af_off + af6->ip6af_frglen >
348 struct mbuf *merr = IP6_REASS_MBUF(af6);
349 struct ip6_hdr *ip6err;
350 int erroff = af6->ip6af_offset;
352 /* dequeue the fragment. */
356 /* adjust pointer. */
357 ip6err = mtod(merr, struct ip6_hdr *);
360 * Restore source and destination addresses
361 * in the erroneous IPv6 header.
363 ip6err->ip6_src = q6->ip6q_src;
364 ip6err->ip6_dst = q6->ip6q_dst;
366 icmp6_error(merr, ICMP6_PARAM_PROB,
367 ICMP6_PARAMPROB_HEADER,
368 erroff - sizeof(struct ip6_frag) +
369 offsetof(struct ip6_frag, ip6f_offlg));
374 ip6af = (struct ip6asfrag *)malloc(sizeof(struct ip6asfrag), M_FTABLE,
378 bzero(ip6af, sizeof(*ip6af));
379 ip6af->ip6af_mff = ip6f->ip6f_offlg & IP6F_MORE_FRAG;
380 ip6af->ip6af_off = fragoff;
381 ip6af->ip6af_frglen = frgpartlen;
382 ip6af->ip6af_offset = offset;
383 IP6_REASS_MBUF(ip6af) = m;
386 af6 = (struct ip6asfrag *)q6;
391 * Handle ECN by comparing this segment with the first one;
392 * if CE is set, do not lose CE.
393 * drop if CE and not-ECT are mixed for the same packet.
395 ecn = (ntohl(ip6->ip6_flow) >> 20) & IPTOS_ECN_MASK;
397 if (ecn == IPTOS_ECN_CE) {
398 if (ecn0 == IPTOS_ECN_NOTECT) {
399 free(ip6af, M_FTABLE);
402 if (ecn0 != IPTOS_ECN_CE)
403 q6->ip6q_ecn = IPTOS_ECN_CE;
405 if (ecn == IPTOS_ECN_NOTECT && ecn0 != IPTOS_ECN_NOTECT) {
406 free(ip6af, M_FTABLE);
411 * Find a segment which begins after this one does.
413 for (af6 = q6->ip6q_down; af6 != (struct ip6asfrag *)q6;
414 af6 = af6->ip6af_down)
415 if (af6->ip6af_off > ip6af->ip6af_off)
420 * If there is a preceding segment, it may provide some of
421 * our data already. If so, drop the data from the incoming
422 * segment. If it provides all of our data, drop us.
424 if (af6->ip6af_up != (struct ip6asfrag *)q6) {
425 i = af6->ip6af_up->ip6af_off + af6->ip6af_up->ip6af_frglen
428 if (i >= ip6af->ip6af_frglen)
430 m_adj(IP6_REASS_MBUF(ip6af), i);
431 ip6af->ip6af_off += i;
432 ip6af->ip6af_frglen -= i;
437 * While we overlap succeeding segments trim them or,
438 * if they are completely covered, dequeue them.
440 while (af6 != (struct ip6asfrag *)q6 &&
441 ip6af->ip6af_off + ip6af->ip6af_frglen > af6->ip6af_off) {
442 i = (ip6af->ip6af_off + ip6af->ip6af_frglen) - af6->ip6af_off;
443 if (i < af6->ip6af_frglen) {
444 af6->ip6af_frglen -= i;
446 m_adj(IP6_REASS_MBUF(af6), i);
449 af6 = af6->ip6af_down;
450 m_freem(IP6_REASS_MBUF(af6->ip6af_up));
451 frag6_deq(af6->ip6af_up);
455 * If the incoming framgent overlaps some existing fragments in
456 * the reassembly queue, drop it, since it is dangerous to override
457 * existing fragments from a security point of view.
458 * We don't know which fragment is the bad guy - here we trust
459 * fragment that came in earlier, with no real reason.
461 * Note: due to changes after disabling this part, mbuf passed to
462 * m_adj() below now does not meet the requirement.
464 if (af6->ip6af_up != (struct ip6asfrag *)q6) {
465 i = af6->ip6af_up->ip6af_off + af6->ip6af_up->ip6af_frglen
468 #if 0 /* suppress the noisy log */
469 log(LOG_ERR, "%d bytes of a fragment from %s "
470 "overlaps the previous fragment\n",
471 i, ip6_sprintf(ip6buf, &q6->ip6q_src));
473 free(ip6af, M_FTABLE);
477 if (af6 != (struct ip6asfrag *)q6) {
478 i = (ip6af->ip6af_off + ip6af->ip6af_frglen) - af6->ip6af_off;
480 #if 0 /* suppress the noisy log */
481 log(LOG_ERR, "%d bytes of a fragment from %s "
482 "overlaps the succeeding fragment",
483 i, ip6_sprintf(ip6buf, &q6->ip6q_src));
485 free(ip6af, M_FTABLE);
494 mac_ip6q_update(m, q6);
498 * Stick new segment in its place;
499 * check for complete reassembly.
500 * Move to front of packet queue, as we are
501 * the most recently active fragmented packet.
503 frag6_enq(ip6af, af6->ip6af_up);
507 if (q6 != V_ip6q.ip6q_next) {
509 frag6_insque(q6, &V_ip6q);
513 for (af6 = q6->ip6q_down; af6 != (struct ip6asfrag *)q6;
514 af6 = af6->ip6af_down) {
515 if (af6->ip6af_off != next) {
519 next += af6->ip6af_frglen;
521 if (af6->ip6af_up->ip6af_mff) {
527 * Reassembly is complete; concatenate fragments.
529 ip6af = q6->ip6q_down;
530 t = m = IP6_REASS_MBUF(ip6af);
531 af6 = ip6af->ip6af_down;
533 while (af6 != (struct ip6asfrag *)q6) {
534 m->m_pkthdr.csum_flags &=
535 IP6_REASS_MBUF(af6)->m_pkthdr.csum_flags;
536 m->m_pkthdr.csum_data +=
537 IP6_REASS_MBUF(af6)->m_pkthdr.csum_data;
539 af6dwn = af6->ip6af_down;
543 m_adj(IP6_REASS_MBUF(af6), af6->ip6af_offset);
544 m_demote_pkthdr(IP6_REASS_MBUF(af6));
545 m_cat(t, IP6_REASS_MBUF(af6));
550 while (m->m_pkthdr.csum_data & 0xffff0000)
551 m->m_pkthdr.csum_data = (m->m_pkthdr.csum_data & 0xffff) +
552 (m->m_pkthdr.csum_data >> 16);
554 /* adjust offset to point where the original next header starts */
555 offset = ip6af->ip6af_offset - sizeof(struct ip6_frag);
556 free(ip6af, M_FTABLE);
557 ip6 = mtod(m, struct ip6_hdr *);
558 ip6->ip6_plen = htons((u_short)next + offset - sizeof(struct ip6_hdr));
559 if (q6->ip6q_ecn == IPTOS_ECN_CE)
560 ip6->ip6_flow |= htonl(IPTOS_ECN_CE << 20);
563 *q6->ip6q_nxtp = (u_char)(nxt & 0xff);
566 if (ip6_deletefraghdr(m, offset, M_NOWAIT) != 0) {
568 V_frag6_nfrags -= q6->ip6q_nfrag;
570 mac_ip6q_destroy(q6);
573 V_frag6_nfragpackets--;
579 * Store NXT to the original.
581 m_copyback(m, ip6_get_prevhdr(m, offset), sizeof(uint8_t),
585 V_frag6_nfrags -= q6->ip6q_nfrag;
587 mac_ip6q_reassemble(q6, m);
588 mac_ip6q_destroy(q6);
591 V_frag6_nfragpackets--;
593 if (m->m_flags & M_PKTHDR) { /* Isn't it always true? */
595 for (t = m; t; t = t->m_next)
597 m->m_pkthdr.len = plen;
601 mtag = m_tag_alloc(MTAG_ABI_IPV6, IPV6_TAG_DIRECT, sizeof(*ip6dc),
606 ip6dc = (struct ip6_direct_ctx *)(mtag + 1);
607 ip6dc->ip6dc_nxt = nxt;
608 ip6dc->ip6dc_off = offset;
610 m_tag_prepend(m, mtag);
614 IP6STAT_INC(ip6s_reassembled);
615 in6_ifstat_inc(dstifp, ifs6_reass_ok);
619 * Queue/dispatch for reprocessing.
621 netisr_dispatch(NETISR_IPV6_DIRECT, m);
626 * Tell launch routine the next header
636 in6_ifstat_inc(dstifp, ifs6_reass_fail);
637 IP6STAT_INC(ip6s_fragdropped);
643 * Free a fragment reassembly header and all
644 * associated datagrams.
647 frag6_freef(struct ip6q *q6)
649 struct ip6asfrag *af6, *down6;
653 for (af6 = q6->ip6q_down; af6 != (struct ip6asfrag *)q6;
655 struct mbuf *m = IP6_REASS_MBUF(af6);
657 down6 = af6->ip6af_down;
661 * Return ICMP time exceeded error for the 1st fragment.
662 * Just free other fragments.
664 if (af6->ip6af_off == 0) {
668 ip6 = mtod(m, struct ip6_hdr *);
670 /* restore source and destination addresses */
671 ip6->ip6_src = q6->ip6q_src;
672 ip6->ip6_dst = q6->ip6q_dst;
674 icmp6_error(m, ICMP6_TIME_EXCEEDED,
675 ICMP6_TIME_EXCEED_REASSEMBLY, 0);
681 V_frag6_nfrags -= q6->ip6q_nfrag;
683 mac_ip6q_destroy(q6);
686 V_frag6_nfragpackets--;
690 * Put an ip fragment on a reassembly chain.
691 * Like insque, but pointers in middle of structure.
694 frag6_enq(struct ip6asfrag *af6, struct ip6asfrag *up6)
700 af6->ip6af_down = up6->ip6af_down;
701 up6->ip6af_down->ip6af_up = af6;
702 up6->ip6af_down = af6;
706 * To frag6_enq as remque is to insque.
709 frag6_deq(struct ip6asfrag *af6)
714 af6->ip6af_up->ip6af_down = af6->ip6af_down;
715 af6->ip6af_down->ip6af_up = af6->ip6af_up;
719 frag6_insque(struct ip6q *new, struct ip6q *old)
724 new->ip6q_prev = old;
725 new->ip6q_next = old->ip6q_next;
726 old->ip6q_next->ip6q_prev= new;
727 old->ip6q_next = new;
731 frag6_remque(struct ip6q *p6)
736 p6->ip6q_prev->ip6q_next = p6->ip6q_next;
737 p6->ip6q_next->ip6q_prev = p6->ip6q_prev;
741 * IPv6 reassembling timer processing;
742 * if a timer expires on a reassembly
748 VNET_ITERATOR_DECL(vnet_iter);
751 VNET_LIST_RLOCK_NOSLEEP();
753 VNET_FOREACH(vnet_iter) {
754 CURVNET_SET(vnet_iter);
755 q6 = V_ip6q.ip6q_next;
757 while (q6 != &V_ip6q) {
760 if (q6->ip6q_prev->ip6q_ttl == 0) {
761 IP6STAT_INC(ip6s_fragtimeout);
762 /* XXX in6_ifstat_inc(ifp, ifs6_reass_fail) */
763 frag6_freef(q6->ip6q_prev);
767 * If we are over the maximum number of fragments
768 * (due to the limit being lowered), drain off
769 * enough to get down to the new limit.
771 while (V_frag6_nfragpackets > (u_int)V_ip6_maxfragpackets &&
773 IP6STAT_INC(ip6s_fragoverflow);
774 /* XXX in6_ifstat_inc(ifp, ifs6_reass_fail) */
775 frag6_freef(V_ip6q.ip6q_prev);
780 VNET_LIST_RUNLOCK_NOSLEEP();
784 * Drain off all datagram fragments.
789 VNET_ITERATOR_DECL(vnet_iter);
791 VNET_LIST_RLOCK_NOSLEEP();
792 if (IP6Q_TRYLOCK() == 0) {
793 VNET_LIST_RUNLOCK_NOSLEEP();
796 VNET_FOREACH(vnet_iter) {
797 CURVNET_SET(vnet_iter);
798 while (V_ip6q.ip6q_next != &V_ip6q) {
799 IP6STAT_INC(ip6s_fragdropped);
800 /* XXX in6_ifstat_inc(ifp, ifs6_reass_fail) */
801 frag6_freef(V_ip6q.ip6q_next);
806 VNET_LIST_RUNLOCK_NOSLEEP();
810 ip6_deletefraghdr(struct mbuf *m, int offset, int wait)
812 struct ip6_hdr *ip6 = mtod(m, struct ip6_hdr *);
815 /* Delete frag6 header. */
816 if (m->m_len >= offset + sizeof(struct ip6_frag)) {
817 /* This is the only possible case with !PULLDOWN_TEST. */
818 bcopy(ip6, (char *)ip6 + sizeof(struct ip6_frag),
820 m->m_data += sizeof(struct ip6_frag);
821 m->m_len -= sizeof(struct ip6_frag);
823 /* This comes with no copy if the boundary is on cluster. */
824 if ((t = m_split(m, offset, wait)) == NULL)
826 m_adj(t, sizeof(struct ip6_frag));
830 m->m_flags |= M_FRAGMENTED;