2 * Copyright (c) 1982, 1986, 1988, 1991, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 4. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * @(#)uipc_mbuf.c 8.2 (Berkeley) 1/4/94
32 #include <sys/cdefs.h>
33 __FBSDID("$FreeBSD$");
36 #include "opt_param.h"
37 #include "opt_mbuf_stress_test.h"
39 #include <sys/param.h>
40 #include <sys/systm.h>
41 #include <sys/kernel.h>
42 #include <sys/limits.h>
44 #include <sys/malloc.h>
46 #include <sys/sysctl.h>
47 #include <sys/domain.h>
48 #include <sys/protosw.h>
51 #include <security/mac/mac_framework.h>
57 #ifdef MBUF_STRESS_TEST
62 int m_defragrandomfailures;
66 * sysctl(8) exported objects
68 SYSCTL_INT(_kern_ipc, KIPC_MAX_LINKHDR, max_linkhdr, CTLFLAG_RD,
69 &max_linkhdr, 0, "Size of largest link layer header");
70 SYSCTL_INT(_kern_ipc, KIPC_MAX_PROTOHDR, max_protohdr, CTLFLAG_RD,
71 &max_protohdr, 0, "Size of largest protocol layer header");
72 SYSCTL_INT(_kern_ipc, KIPC_MAX_HDR, max_hdr, CTLFLAG_RD,
73 &max_hdr, 0, "Size of largest link plus protocol header");
74 SYSCTL_INT(_kern_ipc, KIPC_MAX_DATALEN, max_datalen, CTLFLAG_RD,
75 &max_datalen, 0, "Minimum space left in mbuf after max_hdr");
76 #ifdef MBUF_STRESS_TEST
77 SYSCTL_INT(_kern_ipc, OID_AUTO, m_defragpackets, CTLFLAG_RD,
78 &m_defragpackets, 0, "");
79 SYSCTL_INT(_kern_ipc, OID_AUTO, m_defragbytes, CTLFLAG_RD,
80 &m_defragbytes, 0, "");
81 SYSCTL_INT(_kern_ipc, OID_AUTO, m_defraguseless, CTLFLAG_RD,
82 &m_defraguseless, 0, "");
83 SYSCTL_INT(_kern_ipc, OID_AUTO, m_defragfailure, CTLFLAG_RD,
84 &m_defragfailure, 0, "");
85 SYSCTL_INT(_kern_ipc, OID_AUTO, m_defragrandomfailures, CTLFLAG_RW,
86 &m_defragrandomfailures, 0, "");
90 * Allocate a given length worth of mbufs and/or clusters (whatever fits
91 * best) and return a pointer to the top of the allocated chain. If an
92 * existing mbuf chain is provided, then we will append the new chain
93 * to the existing one but still return the top of the newly allocated
97 m_getm2(struct mbuf *m, int len, int how, short type, int flags)
99 struct mbuf *mb, *nm = NULL, *mtail = NULL;
101 KASSERT(len >= 0, ("%s: len is < 0", __func__));
103 /* Validate flags. */
104 flags &= (M_PKTHDR | M_EOR);
106 /* Packet header mbuf must be first in chain. */
107 if ((flags & M_PKTHDR) && m != NULL)
110 /* Loop and append maximum sized mbufs to the chain tail. */
113 mb = m_getjcl(how, type, (flags & M_PKTHDR),
115 else if (len >= MINCLSIZE)
116 mb = m_getcl(how, type, (flags & M_PKTHDR));
117 else if (flags & M_PKTHDR)
118 mb = m_gethdr(how, type);
120 mb = m_get(how, type);
122 /* Fail the whole operation if one mbuf can't be allocated. */
130 len -= (mb->m_flags & M_EXT) ? mb->m_ext.ext_size :
131 ((mb->m_flags & M_PKTHDR) ? MHLEN : MLEN);
137 flags &= ~M_PKTHDR; /* Only valid on the first mbuf. */
140 mtail->m_flags |= M_EOR; /* Only valid on the last mbuf. */
142 /* If mbuf was supplied, append new chain to the end of it. */
144 for (mtail = m; mtail->m_next != NULL; mtail = mtail->m_next)
147 mtail->m_flags &= ~M_EOR;
155 * Free an entire chain of mbufs and associated external buffers, if
159 m_freem(struct mbuf *mb)
167 * Configure a provided mbuf to refer to the provided external storage
168 * buffer and setup a reference count for said buffer. If the setting
169 * up of the reference count fails, the M_EXT bit will not be set. If
170 * successfull, the M_EXT bit is set in the mbuf's flags.
173 * mb The existing mbuf to which to attach the provided buffer.
174 * buf The address of the provided external storage buffer.
175 * size The size of the provided buffer.
176 * freef A pointer to a routine that is responsible for freeing the
177 * provided external storage buffer.
178 * args A pointer to an argument structure (of any type) to be passed
179 * to the provided freef routine (may be NULL).
180 * flags Any other flags to be passed to the provided mbuf.
181 * type The type that the external storage buffer should be
188 m_extadd(struct mbuf *mb, caddr_t buf, u_int size,
189 void (*freef)(void *, void *), void *args, int flags, int type)
191 KASSERT(type != EXT_CLUSTER, ("%s: EXT_CLUSTER not allowed", __func__));
193 if (type != EXT_EXTREF)
194 mb->m_ext.ref_cnt = (u_int *)uma_zalloc(zone_ext_refcnt, M_NOWAIT);
195 if (mb->m_ext.ref_cnt != NULL) {
196 *(mb->m_ext.ref_cnt) = 1;
197 mb->m_flags |= (M_EXT | flags);
198 mb->m_ext.ext_buf = buf;
199 mb->m_data = mb->m_ext.ext_buf;
200 mb->m_ext.ext_size = size;
201 mb->m_ext.ext_free = freef;
202 mb->m_ext.ext_args = args;
203 mb->m_ext.ext_type = type;
208 * Non-directly-exported function to clean up after mbufs with M_EXT
209 * storage attached to them if the reference count hits 1.
212 mb_free_ext(struct mbuf *m)
214 KASSERT((m->m_flags & M_EXT) == M_EXT, ("%s: M_EXT not set", __func__));
215 KASSERT(m->m_ext.ref_cnt != NULL, ("%s: ref_cnt not set", __func__));
217 /* Free attached storage if this mbuf is the only reference to it. */
218 if (*(m->m_ext.ref_cnt) == 1 ||
219 atomic_fetchadd_int(m->m_ext.ref_cnt, -1) == 1) {
220 switch (m->m_ext.ext_type) {
221 case EXT_PACKET: /* The packet zone is special. */
222 if (*(m->m_ext.ref_cnt) == 0)
223 *(m->m_ext.ref_cnt) = 1;
224 uma_zfree(zone_pack, m);
225 return; /* Job done. */
227 uma_zfree(zone_clust, m->m_ext.ext_buf);
230 uma_zfree(zone_jumbop, m->m_ext.ext_buf);
233 uma_zfree(zone_jumbo9, m->m_ext.ext_buf);
236 uma_zfree(zone_jumbo16, m->m_ext.ext_buf);
242 *(m->m_ext.ref_cnt) = 0;
243 uma_zfree(zone_ext_refcnt, __DEVOLATILE(u_int *,
247 KASSERT(m->m_ext.ext_free != NULL,
248 ("%s: ext_free not set", __func__));
249 (*(m->m_ext.ext_free))(m->m_ext.ext_buf,
253 KASSERT(m->m_ext.ext_type == 0,
254 ("%s: unknown ext_type", __func__));
258 * Free this mbuf back to the mbuf zone with all m_ext
259 * information purged.
261 m->m_ext.ext_buf = NULL;
262 m->m_ext.ext_free = NULL;
263 m->m_ext.ext_args = NULL;
264 m->m_ext.ref_cnt = NULL;
265 m->m_ext.ext_size = 0;
266 m->m_ext.ext_type = 0;
267 m->m_flags &= ~M_EXT;
268 uma_zfree(zone_mbuf, m);
272 * Attach the the cluster from *m to *n, set up m_ext in *n
273 * and bump the refcount of the cluster.
276 mb_dupcl(struct mbuf *n, struct mbuf *m)
278 KASSERT((m->m_flags & M_EXT) == M_EXT, ("%s: M_EXT not set", __func__));
279 KASSERT(m->m_ext.ref_cnt != NULL, ("%s: ref_cnt not set", __func__));
280 KASSERT((n->m_flags & M_EXT) == 0, ("%s: M_EXT set", __func__));
282 if (*(m->m_ext.ref_cnt) == 1)
283 *(m->m_ext.ref_cnt) += 1;
285 atomic_add_int(m->m_ext.ref_cnt, 1);
286 n->m_ext.ext_buf = m->m_ext.ext_buf;
287 n->m_ext.ext_free = m->m_ext.ext_free;
288 n->m_ext.ext_args = m->m_ext.ext_args;
289 n->m_ext.ext_size = m->m_ext.ext_size;
290 n->m_ext.ref_cnt = m->m_ext.ref_cnt;
291 n->m_ext.ext_type = m->m_ext.ext_type;
296 * Clean up mbuf (chain) from any tags and packet headers.
297 * If "all" is set then the first mbuf in the chain will be
301 m_demote(struct mbuf *m0, int all)
305 for (m = all ? m0 : m0->m_next; m != NULL; m = m->m_next) {
306 if (m->m_flags & M_PKTHDR) {
307 m_tag_delete_chain(m, NULL);
308 m->m_flags &= ~M_PKTHDR;
309 bzero(&m->m_pkthdr, sizeof(struct pkthdr));
311 if (m->m_type == MT_HEADER)
313 if (m != m0 && m->m_nextpkt != NULL)
315 m->m_flags = m->m_flags & (M_EXT|M_EOR|M_RDONLY|M_FREELIST);
320 * Sanity checks on mbuf (chain) for use in KASSERT() and general
322 * Returns 0 or panics when bad and 1 on all tests passed.
323 * Sanitize, 0 to run M_SANITY_ACTION, 1 to garble things so they
327 m_sanity(struct mbuf *m0, int sanitize)
333 #define M_SANITY_ACTION(s) return (0)
334 /* #define M_SANITY_ACTION(s) panic("mbuf %p: " s, m) */
336 for (m = m0; m != NULL; m = m->m_next) {
338 * Basic pointer checks. If any of these fails then some
339 * unrelated kernel memory before or after us is trashed.
340 * No way to recover from that.
342 a = ((m->m_flags & M_EXT) ? m->m_ext.ext_buf :
343 ((m->m_flags & M_PKTHDR) ? (caddr_t)(&m->m_pktdat) :
344 (caddr_t)(&m->m_dat)) );
345 b = (caddr_t)(a + (m->m_flags & M_EXT ? m->m_ext.ext_size :
346 ((m->m_flags & M_PKTHDR) ? MHLEN : MLEN)));
347 if ((caddr_t)m->m_data < a)
348 M_SANITY_ACTION("m_data outside mbuf data range left");
349 if ((caddr_t)m->m_data > b)
350 M_SANITY_ACTION("m_data outside mbuf data range right");
351 if ((caddr_t)m->m_data + m->m_len > b)
352 M_SANITY_ACTION("m_data + m_len exeeds mbuf space");
353 if ((m->m_flags & M_PKTHDR) && m->m_pkthdr.header) {
354 if ((caddr_t)m->m_pkthdr.header < a ||
355 (caddr_t)m->m_pkthdr.header > b)
356 M_SANITY_ACTION("m_pkthdr.header outside mbuf data range");
359 /* m->m_nextpkt may only be set on first mbuf in chain. */
360 if (m != m0 && m->m_nextpkt != NULL) {
362 m_freem(m->m_nextpkt);
363 m->m_nextpkt = (struct mbuf *)0xDEADC0DE;
365 M_SANITY_ACTION("m->m_nextpkt on in-chain mbuf");
368 /* correct type correlations. */
369 if (m->m_type == MT_HEADER && !(m->m_flags & M_PKTHDR)) {
373 M_SANITY_ACTION("MT_HEADER set but not M_PKTHDR");
376 /* packet length (not mbuf length!) calculation */
377 if (m0->m_flags & M_PKTHDR)
380 /* m_tags may only be attached to first mbuf in chain. */
381 if (m != m0 && m->m_flags & M_PKTHDR &&
382 !SLIST_EMPTY(&m->m_pkthdr.tags)) {
384 m_tag_delete_chain(m, NULL);
385 /* put in 0xDEADC0DE perhaps? */
387 M_SANITY_ACTION("m_tags on in-chain mbuf");
390 /* M_PKTHDR may only be set on first mbuf in chain */
391 if (m != m0 && m->m_flags & M_PKTHDR) {
393 bzero(&m->m_pkthdr, sizeof(m->m_pkthdr));
394 m->m_flags &= ~M_PKTHDR;
395 /* put in 0xDEADCODE and leave hdr flag in */
397 M_SANITY_ACTION("M_PKTHDR on in-chain mbuf");
401 if (pktlen && pktlen != m->m_pkthdr.len) {
405 M_SANITY_ACTION("m_pkthdr.len != mbuf chain length");
409 #undef M_SANITY_ACTION
414 * "Move" mbuf pkthdr from "from" to "to".
415 * "from" must have M_PKTHDR set, and "to" must be empty.
418 m_move_pkthdr(struct mbuf *to, struct mbuf *from)
422 /* see below for why these are not enabled */
424 /* Note: with MAC, this may not be a good assertion. */
425 KASSERT(SLIST_EMPTY(&to->m_pkthdr.tags),
426 ("m_move_pkthdr: to has tags"));
430 * XXXMAC: It could be this should also occur for non-MAC?
432 if (to->m_flags & M_PKTHDR)
433 m_tag_delete_chain(to, NULL);
435 to->m_flags = (from->m_flags & M_COPYFLAGS) | (to->m_flags & M_EXT);
436 if ((to->m_flags & M_EXT) == 0)
437 to->m_data = to->m_pktdat;
438 to->m_pkthdr = from->m_pkthdr; /* especially tags */
439 SLIST_INIT(&from->m_pkthdr.tags); /* purge tags from src */
440 from->m_flags &= ~M_PKTHDR;
444 * Duplicate "from"'s mbuf pkthdr in "to".
445 * "from" must have M_PKTHDR set, and "to" must be empty.
446 * In particular, this does a deep copy of the packet tags.
449 m_dup_pkthdr(struct mbuf *to, struct mbuf *from, int how)
454 * The mbuf allocator only initializes the pkthdr
455 * when the mbuf is allocated with MGETHDR. Many users
456 * (e.g. m_copy*, m_prepend) use MGET and then
457 * smash the pkthdr as needed causing these
458 * assertions to trip. For now just disable them.
461 /* Note: with MAC, this may not be a good assertion. */
462 KASSERT(SLIST_EMPTY(&to->m_pkthdr.tags), ("m_dup_pkthdr: to has tags"));
464 MBUF_CHECKSLEEP(how);
466 if (to->m_flags & M_PKTHDR)
467 m_tag_delete_chain(to, NULL);
469 to->m_flags = (from->m_flags & M_COPYFLAGS) | (to->m_flags & M_EXT);
470 if ((to->m_flags & M_EXT) == 0)
471 to->m_data = to->m_pktdat;
472 to->m_pkthdr = from->m_pkthdr;
473 SLIST_INIT(&to->m_pkthdr.tags);
474 return (m_tag_copy_chain(to, from, MBTOM(how)));
478 * Lesser-used path for M_PREPEND:
479 * allocate new mbuf to prepend to chain,
483 m_prepend(struct mbuf *m, int len, int how)
487 if (m->m_flags & M_PKTHDR)
488 MGETHDR(mn, how, m->m_type);
490 MGET(mn, how, m->m_type);
495 if (m->m_flags & M_PKTHDR)
496 M_MOVE_PKTHDR(mn, m);
506 * Make a copy of an mbuf chain starting "off0" bytes from the beginning,
507 * continuing for "len" bytes. If len is M_COPYALL, copy to end of mbuf.
508 * The wait parameter is a choice of M_TRYWAIT/M_DONTWAIT from caller.
509 * Note that the copy is read-only, because clusters are not copied,
510 * only their reference counts are incremented.
513 m_copym(struct mbuf *m, int off0, int len, int wait)
515 struct mbuf *n, **np;
520 KASSERT(off >= 0, ("m_copym, negative off %d", off));
521 KASSERT(len >= 0, ("m_copym, negative len %d", len));
522 MBUF_CHECKSLEEP(wait);
523 if (off == 0 && m->m_flags & M_PKTHDR)
526 KASSERT(m != NULL, ("m_copym, offset > size of mbuf chain"));
536 KASSERT(len == M_COPYALL,
537 ("m_copym, length > size of mbuf chain"));
541 MGETHDR(n, wait, m->m_type);
543 MGET(n, wait, m->m_type);
548 if (!m_dup_pkthdr(n, m, wait))
550 if (len == M_COPYALL)
551 n->m_pkthdr.len -= off0;
553 n->m_pkthdr.len = len;
556 n->m_len = min(len, m->m_len - off);
557 if (m->m_flags & M_EXT) {
558 n->m_data = m->m_data + off;
561 bcopy(mtod(m, caddr_t)+off, mtod(n, caddr_t),
563 if (len != M_COPYALL)
570 mbstat.m_mcfail++; /* XXX: No consistency. */
575 mbstat.m_mcfail++; /* XXX: No consistency. */
580 * Returns mbuf chain with new head for the prepending case.
581 * Copies from mbuf (chain) n from off for len to mbuf (chain) m
582 * either prepending or appending the data.
583 * The resulting mbuf (chain) m is fully writeable.
584 * m is destination (is made writeable)
585 * n is source, off is offset in source, len is len from offset
586 * dir, 0 append, 1 prepend
587 * how, wait or nowait
591 m_bcopyxxx(void *s, void *t, u_int len)
593 bcopy(s, t, (size_t)len);
598 m_copymdata(struct mbuf *m, struct mbuf *n, int off, int len,
601 struct mbuf *mm, *x, *z, *prev = NULL;
606 KASSERT(m != NULL && n != NULL, ("m_copymdata, no target or source"));
607 KASSERT(off >= 0, ("m_copymdata, negative off %d", off));
608 KASSERT(len >= 0, ("m_copymdata, negative len %d", len));
609 KASSERT(prep == 0 || prep == 1, ("m_copymdata, unknown direction %d", prep));
618 for (z = n; z != NULL; z = z->m_next)
620 if (len == M_COPYALL)
622 if (off + len > nlen || len < 1)
625 if (!M_WRITABLE(mm)) {
626 /* XXX: Use proper m_xxx function instead. */
627 x = m_getcl(how, MT_DATA, mm->m_flags);
630 bcopy(mm->m_ext.ext_buf, x->m_ext.ext_buf, x->m_ext.ext_size);
631 p = x->m_ext.ext_buf + (mm->m_data - mm->m_ext.ext_buf);
641 * Append/prepend the data. Allocating mbufs as necessary.
643 /* Shortcut if enough free space in first/last mbuf. */
644 if (!prep && M_TRAILINGSPACE(mm) >= len) {
645 m_apply(n, off, len, m_bcopyxxx, mtod(mm, caddr_t) +
648 mm->m_pkthdr.len += len;
651 if (prep && M_LEADINGSPACE(mm) >= len) {
652 mm->m_data = mtod(mm, caddr_t) - len;
653 m_apply(n, off, len, m_bcopyxxx, mtod(mm, caddr_t));
655 mm->m_pkthdr.len += len;
659 /* Expand first/last mbuf to cluster if possible. */
660 if (!prep && !(mm->m_flags & M_EXT) && len > M_TRAILINGSPACE(mm)) {
661 bcopy(mm->m_data, &buf, mm->m_len);
663 if (!(mm->m_flags & M_EXT))
665 bcopy(&buf, mm->m_ext.ext_buf, mm->m_len);
666 mm->m_data = mm->m_ext.ext_buf;
667 mm->m_pkthdr.header = NULL;
669 if (prep && !(mm->m_flags & M_EXT) && len > M_LEADINGSPACE(mm)) {
670 bcopy(mm->m_data, &buf, mm->m_len);
672 if (!(mm->m_flags & M_EXT))
674 bcopy(&buf, (caddr_t *)mm->m_ext.ext_buf +
675 mm->m_ext.ext_size - mm->m_len, mm->m_len);
676 mm->m_data = (caddr_t)mm->m_ext.ext_buf +
677 mm->m_ext.ext_size - mm->m_len;
678 mm->m_pkthdr.header = NULL;
681 /* Append/prepend as many mbuf (clusters) as necessary to fit len. */
682 if (!prep && len > M_TRAILINGSPACE(mm)) {
683 if (!m_getm(mm, len - M_TRAILINGSPACE(mm), how, MT_DATA))
686 if (prep && len > M_LEADINGSPACE(mm)) {
687 if (!(z = m_getm(NULL, len - M_LEADINGSPACE(mm), how, MT_DATA)))
690 for (x = z; x != NULL; x = x->m_next) {
691 i += x->m_flags & M_EXT ? x->m_ext.ext_size :
692 (x->m_flags & M_PKTHDR ? MHLEN : MLEN);
696 z->m_data += i - len;
697 m_move_pkthdr(mm, z);
702 /* Seek to start position in source mbuf. Optimization for long chains. */
710 /* Copy data into target mbuf. */
713 KASSERT(z != NULL, ("m_copymdata, falling off target edge"));
714 i = M_TRAILINGSPACE(z);
715 m_apply(n, off, i, m_bcopyxxx, mtod(z, caddr_t) + z->m_len);
717 /* fixup pkthdr.len if necessary */
718 if ((prep ? mm : m)->m_flags & M_PKTHDR)
719 (prep ? mm : m)->m_pkthdr.len += i;
724 return (prep ? mm : m);
728 * Copy an entire packet, including header (which must be present).
729 * An optimization of the common case `m_copym(m, 0, M_COPYALL, how)'.
730 * Note that the copy is read-only, because clusters are not copied,
731 * only their reference counts are incremented.
732 * Preserve alignment of the first mbuf so if the creator has left
733 * some room at the beginning (e.g. for inserting protocol headers)
734 * the copies still have the room available.
737 m_copypacket(struct mbuf *m, int how)
739 struct mbuf *top, *n, *o;
741 MBUF_CHECKSLEEP(how);
742 MGET(n, how, m->m_type);
747 if (!m_dup_pkthdr(n, m, how))
750 if (m->m_flags & M_EXT) {
751 n->m_data = m->m_data;
754 n->m_data = n->m_pktdat + (m->m_data - m->m_pktdat );
755 bcopy(mtod(m, char *), mtod(n, char *), n->m_len);
760 MGET(o, how, m->m_type);
768 if (m->m_flags & M_EXT) {
769 n->m_data = m->m_data;
772 bcopy(mtod(m, char *), mtod(n, char *), n->m_len);
780 mbstat.m_mcfail++; /* XXX: No consistency. */
785 * Copy data from an mbuf chain starting "off" bytes from the beginning,
786 * continuing for "len" bytes, into the indicated buffer.
789 m_copydata(const struct mbuf *m, int off, int len, caddr_t cp)
793 KASSERT(off >= 0, ("m_copydata, negative off %d", off));
794 KASSERT(len >= 0, ("m_copydata, negative len %d", len));
796 KASSERT(m != NULL, ("m_copydata, offset > size of mbuf chain"));
803 KASSERT(m != NULL, ("m_copydata, length > size of mbuf chain"));
804 count = min(m->m_len - off, len);
805 bcopy(mtod(m, caddr_t) + off, cp, count);
814 * Copy a packet header mbuf chain into a completely new chain, including
815 * copying any mbuf clusters. Use this instead of m_copypacket() when
816 * you need a writable copy of an mbuf chain.
819 m_dup(struct mbuf *m, int how)
821 struct mbuf **p, *top = NULL;
822 int remain, moff, nsize;
824 MBUF_CHECKSLEEP(how);
830 /* While there's more data, get a new mbuf, tack it on, and fill it */
831 remain = m->m_pkthdr.len;
834 while (remain > 0 || top == NULL) { /* allow m->m_pkthdr.len == 0 */
837 /* Get the next new mbuf */
838 if (remain >= MINCLSIZE) {
839 n = m_getcl(how, m->m_type, 0);
842 n = m_get(how, m->m_type);
848 if (top == NULL) { /* First one, must be PKTHDR */
849 if (!m_dup_pkthdr(n, m, how)) {
853 if ((n->m_flags & M_EXT) == 0)
858 /* Link it into the new chain */
862 /* Copy data from original mbuf(s) into new mbuf */
863 while (n->m_len < nsize && m != NULL) {
864 int chunk = min(nsize - n->m_len, m->m_len - moff);
866 bcopy(m->m_data + moff, n->m_data + n->m_len, chunk);
870 if (moff == m->m_len) {
876 /* Check correct total mbuf length */
877 KASSERT((remain > 0 && m != NULL) || (remain == 0 && m == NULL),
878 ("%s: bogus m_pkthdr.len", __func__));
884 mbstat.m_mcfail++; /* XXX: No consistency. */
889 * Concatenate mbuf chain n to m.
890 * Both chains must be of the same type (e.g. MT_DATA).
891 * Any m_pkthdr is not updated.
894 m_cat(struct mbuf *m, struct mbuf *n)
899 if (m->m_flags & M_EXT ||
900 m->m_data + m->m_len + n->m_len >= &m->m_dat[MLEN]) {
901 /* just join the two chains */
905 /* splat the data from one into the other */
906 bcopy(mtod(n, caddr_t), mtod(m, caddr_t) + m->m_len,
908 m->m_len += n->m_len;
914 m_adj(struct mbuf *mp, int req_len)
920 if ((m = mp) == NULL)
926 while (m != NULL && len > 0) {
927 if (m->m_len <= len) {
938 if (mp->m_flags & M_PKTHDR)
939 m->m_pkthdr.len -= (req_len - len);
942 * Trim from tail. Scan the mbuf chain,
943 * calculating its length and finding the last mbuf.
944 * If the adjustment only affects this mbuf, then just
945 * adjust and return. Otherwise, rescan and truncate
946 * after the remaining size.
952 if (m->m_next == (struct mbuf *)0)
956 if (m->m_len >= len) {
958 if (mp->m_flags & M_PKTHDR)
959 mp->m_pkthdr.len -= len;
966 * Correct length for chain is "count".
967 * Find the mbuf with last data, adjust its length,
968 * and toss data from remaining mbufs on chain.
971 if (m->m_flags & M_PKTHDR)
972 m->m_pkthdr.len = count;
973 for (; m; m = m->m_next) {
974 if (m->m_len >= count) {
976 if (m->m_next != NULL) {
988 * Rearange an mbuf chain so that len bytes are contiguous
989 * and in the data area of an mbuf (so that mtod and dtom
990 * will work for a structure of size len). Returns the resulting
991 * mbuf chain on success, frees it and returns null on failure.
992 * If there is room, it will add up to max_protohdr-len extra bytes to the
993 * contiguous region in an attempt to avoid being called next time.
996 m_pullup(struct mbuf *n, int len)
1003 * If first mbuf has no cluster, and has room for len bytes
1004 * without shifting current data, pullup into it,
1005 * otherwise allocate a new mbuf to prepend to the chain.
1007 if ((n->m_flags & M_EXT) == 0 &&
1008 n->m_data + len < &n->m_dat[MLEN] && n->m_next) {
1009 if (n->m_len >= len)
1017 MGET(m, M_DONTWAIT, n->m_type);
1021 if (n->m_flags & M_PKTHDR)
1022 M_MOVE_PKTHDR(m, n);
1024 space = &m->m_dat[MLEN] - (m->m_data + m->m_len);
1026 count = min(min(max(len, max_protohdr), space), n->m_len);
1027 bcopy(mtod(n, caddr_t), mtod(m, caddr_t) + m->m_len,
1037 } while (len > 0 && n);
1046 mbstat.m_mpfail++; /* XXX: No consistency. */
1051 * Like m_pullup(), except a new mbuf is always allocated, and we allow
1052 * the amount of empty space before the data in the new mbuf to be specified
1053 * (in the event that the caller expects to prepend later).
1058 m_copyup(struct mbuf *n, int len, int dstoff)
1063 if (len > (MHLEN - dstoff))
1065 MGET(m, M_DONTWAIT, n->m_type);
1069 if (n->m_flags & M_PKTHDR)
1070 M_MOVE_PKTHDR(m, n);
1071 m->m_data += dstoff;
1072 space = &m->m_dat[MLEN] - (m->m_data + m->m_len);
1074 count = min(min(max(len, max_protohdr), space), n->m_len);
1075 memcpy(mtod(m, caddr_t) + m->m_len, mtod(n, caddr_t),
1085 } while (len > 0 && n);
1099 * Partition an mbuf chain in two pieces, returning the tail --
1100 * all but the first len0 bytes. In case of failure, it returns NULL and
1101 * attempts to restore the chain to its original state.
1103 * Note that the resulting mbufs might be read-only, because the new
1104 * mbuf can end up sharing an mbuf cluster with the original mbuf if
1105 * the "breaking point" happens to lie within a cluster mbuf. Use the
1106 * M_WRITABLE() macro to check for this case.
1109 m_split(struct mbuf *m0, int len0, int wait)
1112 u_int len = len0, remain;
1114 MBUF_CHECKSLEEP(wait);
1115 for (m = m0; m && len > m->m_len; m = m->m_next)
1119 remain = m->m_len - len;
1120 if (m0->m_flags & M_PKTHDR) {
1121 MGETHDR(n, wait, m0->m_type);
1124 n->m_pkthdr.rcvif = m0->m_pkthdr.rcvif;
1125 n->m_pkthdr.len = m0->m_pkthdr.len - len0;
1126 m0->m_pkthdr.len = len0;
1127 if (m->m_flags & M_EXT)
1129 if (remain > MHLEN) {
1130 /* m can't be the lead packet */
1132 n->m_next = m_split(m, len, wait);
1133 if (n->m_next == NULL) {
1141 MH_ALIGN(n, remain);
1142 } else if (remain == 0) {
1147 MGET(n, wait, m->m_type);
1153 if (m->m_flags & M_EXT) {
1154 n->m_data = m->m_data + len;
1157 bcopy(mtod(m, caddr_t) + len, mtod(n, caddr_t), remain);
1161 n->m_next = m->m_next;
1166 * Routine to copy from device local memory into mbufs.
1167 * Note that `off' argument is offset into first mbuf of target chain from
1168 * which to begin copying the data to.
1171 m_devget(char *buf, int totlen, int off, struct ifnet *ifp,
1172 void (*copy)(char *from, caddr_t to, u_int len))
1175 struct mbuf *top = NULL, **mp = ⊤
1178 if (off < 0 || off > MHLEN)
1181 while (totlen > 0) {
1182 if (top == NULL) { /* First one, must be PKTHDR */
1183 if (totlen + off >= MINCLSIZE) {
1184 m = m_getcl(M_DONTWAIT, MT_DATA, M_PKTHDR);
1187 m = m_gethdr(M_DONTWAIT, MT_DATA);
1190 /* Place initial small packet/header at end of mbuf */
1191 if (m && totlen + off + max_linkhdr <= MLEN) {
1192 m->m_data += max_linkhdr;
1198 m->m_pkthdr.rcvif = ifp;
1199 m->m_pkthdr.len = totlen;
1201 if (totlen + off >= MINCLSIZE) {
1202 m = m_getcl(M_DONTWAIT, MT_DATA, 0);
1205 m = m_get(M_DONTWAIT, MT_DATA);
1218 m->m_len = len = min(totlen, len);
1220 copy(buf, mtod(m, caddr_t), (u_int)len);
1222 bcopy(buf, mtod(m, caddr_t), (u_int)len);
1232 * Copy data from a buffer back into the indicated mbuf chain,
1233 * starting "off" bytes from the beginning, extending the mbuf
1234 * chain if necessary.
1237 m_copyback(struct mbuf *m0, int off, int len, c_caddr_t cp)
1240 struct mbuf *m = m0, *n;
1245 while (off > (mlen = m->m_len)) {
1248 if (m->m_next == NULL) {
1249 n = m_get(M_DONTWAIT, m->m_type);
1252 bzero(mtod(n, caddr_t), MLEN);
1253 n->m_len = min(MLEN, len + off);
1259 mlen = min (m->m_len - off, len);
1260 bcopy(cp, off + mtod(m, caddr_t), (u_int)mlen);
1268 if (m->m_next == NULL) {
1269 n = m_get(M_DONTWAIT, m->m_type);
1272 n->m_len = min(MLEN, len);
1277 out: if (((m = m0)->m_flags & M_PKTHDR) && (m->m_pkthdr.len < totlen))
1278 m->m_pkthdr.len = totlen;
1282 * Append the specified data to the indicated mbuf chain,
1283 * Extend the mbuf chain if the new data does not fit in
1286 * Return 1 if able to complete the job; otherwise 0.
1289 m_append(struct mbuf *m0, int len, c_caddr_t cp)
1292 int remainder, space;
1294 for (m = m0; m->m_next != NULL; m = m->m_next)
1297 space = M_TRAILINGSPACE(m);
1300 * Copy into available space.
1302 if (space > remainder)
1304 bcopy(cp, mtod(m, caddr_t) + m->m_len, space);
1306 cp += space, remainder -= space;
1308 while (remainder > 0) {
1310 * Allocate a new mbuf; could check space
1311 * and allocate a cluster instead.
1313 n = m_get(M_DONTWAIT, m->m_type);
1316 n->m_len = min(MLEN, remainder);
1317 bcopy(cp, mtod(n, caddr_t), n->m_len);
1318 cp += n->m_len, remainder -= n->m_len;
1322 if (m0->m_flags & M_PKTHDR)
1323 m0->m_pkthdr.len += len - remainder;
1324 return (remainder == 0);
1328 * Apply function f to the data in an mbuf chain starting "off" bytes from
1329 * the beginning, continuing for "len" bytes.
1332 m_apply(struct mbuf *m, int off, int len,
1333 int (*f)(void *, void *, u_int), void *arg)
1338 KASSERT(off >= 0, ("m_apply, negative off %d", off));
1339 KASSERT(len >= 0, ("m_apply, negative len %d", len));
1341 KASSERT(m != NULL, ("m_apply, offset > size of mbuf chain"));
1348 KASSERT(m != NULL, ("m_apply, offset > size of mbuf chain"));
1349 count = min(m->m_len - off, len);
1350 rval = (*f)(arg, mtod(m, caddr_t) + off, count);
1361 * Return a pointer to mbuf/offset of location in mbuf chain.
1364 m_getptr(struct mbuf *m, int loc, int *off)
1368 /* Normal end of search. */
1369 if (m->m_len > loc) {
1374 if (m->m_next == NULL) {
1376 /* Point at the end of valid data. */
1389 m_print(const struct mbuf *m, int maxlen)
1393 const struct mbuf *m2;
1395 if (m->m_flags & M_PKTHDR)
1396 len = m->m_pkthdr.len;
1400 while (m2 != NULL && (len == -1 || len)) {
1402 if (maxlen != -1 && pdata > maxlen)
1404 printf("mbuf: %p len: %d, next: %p, %b%s", m2, m2->m_len,
1405 m2->m_next, m2->m_flags, "\20\20freelist\17skipfw"
1406 "\11proto5\10proto4\7proto3\6proto2\5proto1\4rdonly"
1407 "\3eor\2pkthdr\1ext", pdata ? "" : "\n");
1409 printf(", %*D\n", pdata, (u_char *)m2->m_data, "-");
1415 printf("%d bytes unaccounted for.\n", len);
1420 m_fixhdr(struct mbuf *m0)
1424 len = m_length(m0, NULL);
1425 m0->m_pkthdr.len = len;
1430 m_length(struct mbuf *m0, struct mbuf **last)
1436 for (m = m0; m != NULL; m = m->m_next) {
1438 if (m->m_next == NULL)
1447 * Defragment a mbuf chain, returning the shortest possible
1448 * chain of mbufs and clusters. If allocation fails and
1449 * this cannot be completed, NULL will be returned, but
1450 * the passed in chain will be unchanged. Upon success,
1451 * the original chain will be freed, and the new chain
1454 * If a non-packet header is passed in, the original
1455 * mbuf (chain?) will be returned unharmed.
1458 m_defrag(struct mbuf *m0, int how)
1460 struct mbuf *m_new = NULL, *m_final = NULL;
1461 int progress = 0, length;
1463 MBUF_CHECKSLEEP(how);
1464 if (!(m0->m_flags & M_PKTHDR))
1467 m_fixhdr(m0); /* Needed sanity check */
1469 #ifdef MBUF_STRESS_TEST
1470 if (m_defragrandomfailures) {
1471 int temp = arc4random() & 0xff;
1477 if (m0->m_pkthdr.len > MHLEN)
1478 m_final = m_getcl(how, MT_DATA, M_PKTHDR);
1480 m_final = m_gethdr(how, MT_DATA);
1482 if (m_final == NULL)
1485 if (m_dup_pkthdr(m_final, m0, how) == 0)
1490 while (progress < m0->m_pkthdr.len) {
1491 length = m0->m_pkthdr.len - progress;
1492 if (length > MCLBYTES)
1495 if (m_new == NULL) {
1497 m_new = m_getcl(how, MT_DATA, 0);
1499 m_new = m_get(how, MT_DATA);
1504 m_copydata(m0, progress, length, mtod(m_new, caddr_t));
1506 m_new->m_len = length;
1507 if (m_new != m_final)
1508 m_cat(m_final, m_new);
1511 #ifdef MBUF_STRESS_TEST
1512 if (m0->m_next == NULL)
1517 #ifdef MBUF_STRESS_TEST
1519 m_defragbytes += m0->m_pkthdr.len;
1523 #ifdef MBUF_STRESS_TEST
1531 #ifdef MBUF_STRESS_TEST
1534 * Fragment an mbuf chain. There's no reason you'd ever want to do
1535 * this in normal usage, but it's great for stress testing various
1538 * If fragmentation is not possible, the original chain will be
1541 * Possible length values:
1542 * 0 no fragmentation will occur
1543 * > 0 each fragment will be of the specified length
1544 * -1 each fragment will be the same random value in length
1545 * -2 each fragment's length will be entirely random
1546 * (Random values range from 1 to 256)
1549 m_fragment(struct mbuf *m0, int how, int length)
1551 struct mbuf *m_new = NULL, *m_final = NULL;
1554 if (!(m0->m_flags & M_PKTHDR))
1557 if ((length == 0) || (length < -2))
1560 m_fixhdr(m0); /* Needed sanity check */
1562 m_final = m_getcl(how, MT_DATA, M_PKTHDR);
1564 if (m_final == NULL)
1567 if (m_dup_pkthdr(m_final, m0, how) == 0)
1573 length = 1 + (arc4random() & 255);
1575 while (progress < m0->m_pkthdr.len) {
1581 fraglen = 1 + (arc4random() & 255);
1582 if (fraglen > m0->m_pkthdr.len - progress)
1583 fraglen = m0->m_pkthdr.len - progress;
1585 if (fraglen > MCLBYTES)
1588 if (m_new == NULL) {
1589 m_new = m_getcl(how, MT_DATA, 0);
1594 m_copydata(m0, progress, fraglen, mtod(m_new, caddr_t));
1595 progress += fraglen;
1596 m_new->m_len = fraglen;
1597 if (m_new != m_final)
1598 m_cat(m_final, m_new);
1607 /* Return the original chain on failure */
1614 * Copy the contents of uio into a properly sized mbuf chain.
1617 m_uiotombuf(struct uio *uio, int how, int len, int align, int flags)
1619 struct mbuf *m, *mb;
1620 int error, length, total;
1624 * len can be zero or an arbitrary large value bound by
1625 * the total data supplied by the uio.
1628 total = min(uio->uio_resid, len);
1630 total = uio->uio_resid;
1633 * The smallest unit returned by m_getm2() is a single mbuf
1634 * with pkthdr. We can't align past it. Align align itself.
1637 align &= ~(sizeof(long) - 1);
1641 /* Give us all or nothing. */
1642 m = m_getm2(NULL, total + align, how, MT_DATA, flags);
1647 /* Fill all mbufs with uio data and update header information. */
1648 for (mb = m; mb != NULL; mb = mb->m_next) {
1649 length = min(M_TRAILINGSPACE(mb), total - progress);
1651 error = uiomove(mtod(mb, void *), length, uio);
1659 if (flags & M_PKTHDR)
1660 m->m_pkthdr.len += length;
1662 KASSERT(progress == total, ("%s: progress != total", __func__));
1668 * Set the m_data pointer of a newly-allocated mbuf
1669 * to place an object of the specified size at the
1670 * end of the mbuf, longword aligned.
1673 m_align(struct mbuf *m, int len)
1677 if (m->m_flags & M_EXT)
1678 adjust = m->m_ext.ext_size - len;
1679 else if (m->m_flags & M_PKTHDR)
1680 adjust = MHLEN - len;
1682 adjust = MLEN - len;
1683 m->m_data += adjust &~ (sizeof(long)-1);
1687 * Create a writable copy of the mbuf chain. While doing this
1688 * we compact the chain with a goal of producing a chain with
1689 * at most two mbufs. The second mbuf in this chain is likely
1690 * to be a cluster. The primary purpose of this work is to create
1691 * a writable packet for encryption, compression, etc. The
1692 * secondary goal is to linearize the data so the data can be
1693 * passed to crypto hardware in the most efficient manner possible.
1696 m_unshare(struct mbuf *m0, int how)
1698 struct mbuf *m, *mprev;
1699 struct mbuf *n, *mfirst, *mlast;
1703 for (m = m0; m != NULL; m = mprev->m_next) {
1705 * Regular mbufs are ignored unless there's a cluster
1706 * in front of it that we can use to coalesce. We do
1707 * the latter mainly so later clusters can be coalesced
1708 * also w/o having to handle them specially (i.e. convert
1709 * mbuf+cluster -> cluster). This optimization is heavily
1710 * influenced by the assumption that we're running over
1711 * Ethernet where MCLBYTES is large enough that the max
1712 * packet size will permit lots of coalescing into a
1713 * single cluster. This in turn permits efficient
1714 * crypto operations, especially when using hardware.
1716 if ((m->m_flags & M_EXT) == 0) {
1717 if (mprev && (mprev->m_flags & M_EXT) &&
1718 m->m_len <= M_TRAILINGSPACE(mprev)) {
1719 /* XXX: this ignores mbuf types */
1720 memcpy(mtod(mprev, caddr_t) + mprev->m_len,
1721 mtod(m, caddr_t), m->m_len);
1722 mprev->m_len += m->m_len;
1723 mprev->m_next = m->m_next; /* unlink from chain */
1724 m_free(m); /* reclaim mbuf */
1726 newipsecstat.ips_mbcoalesced++;
1734 * Writable mbufs are left alone (for now).
1736 if (M_WRITABLE(m)) {
1742 * Not writable, replace with a copy or coalesce with
1743 * the previous mbuf if possible (since we have to copy
1744 * it anyway, we try to reduce the number of mbufs and
1745 * clusters so that future work is easier).
1747 KASSERT(m->m_flags & M_EXT, ("m_flags 0x%x", m->m_flags));
1748 /* NB: we only coalesce into a cluster or larger */
1749 if (mprev != NULL && (mprev->m_flags & M_EXT) &&
1750 m->m_len <= M_TRAILINGSPACE(mprev)) {
1751 /* XXX: this ignores mbuf types */
1752 memcpy(mtod(mprev, caddr_t) + mprev->m_len,
1753 mtod(m, caddr_t), m->m_len);
1754 mprev->m_len += m->m_len;
1755 mprev->m_next = m->m_next; /* unlink from chain */
1756 m_free(m); /* reclaim mbuf */
1758 newipsecstat.ips_clcoalesced++;
1764 * Allocate new space to hold the copy...
1766 /* XXX why can M_PKTHDR be set past the first mbuf? */
1767 if (mprev == NULL && (m->m_flags & M_PKTHDR)) {
1769 * NB: if a packet header is present we must
1770 * allocate the mbuf separately from any cluster
1771 * because M_MOVE_PKTHDR will smash the data
1772 * pointer and drop the M_EXT marker.
1774 MGETHDR(n, how, m->m_type);
1779 M_MOVE_PKTHDR(n, m);
1781 if ((n->m_flags & M_EXT) == 0) {
1787 n = m_getcl(how, m->m_type, m->m_flags);
1794 * ... and copy the data. We deal with jumbo mbufs
1795 * (i.e. m_len > MCLBYTES) by splitting them into
1796 * clusters. We could just malloc a buffer and make
1797 * it external but too many device drivers don't know
1798 * how to break up the non-contiguous memory when
1806 int cc = min(len, MCLBYTES);
1807 memcpy(mtod(n, caddr_t), mtod(m, caddr_t) + off, cc);
1813 newipsecstat.ips_clcopied++;
1821 n = m_getcl(how, m->m_type, m->m_flags);
1828 n->m_next = m->m_next;
1830 m0 = mfirst; /* new head of chain */
1832 mprev->m_next = mfirst; /* replace old mbuf */
1833 m_free(m); /* release old mbuf */