File Manager

003 File Manager

Current Path: /usr/src/sys/kern

📁 ..
📄 Make.tags.inc(2.13 KB)
📄 Makefile(302 B)
📄 bus_if.m(26.31 KB)
📄 capabilities.conf(13.67 KB)
📄 clock_if.m(1.7 KB)
📄 cpufreq_if.m(2.27 KB)
📄 device_if.m(10.41 KB)
📄 firmw.S(2.15 KB)
📄 genassym.sh(1.11 KB)
📄 genoffset.c(1.68 KB)
📄 genoffset.sh(3.58 KB)
📄 imgact_aout.c(9.45 KB)
📄 imgact_binmisc.c(18.64 KB)
📄 imgact_elf.c(76.32 KB)
📄 imgact_elf32.c(1.47 KB)
📄 imgact_elf64.c(1.47 KB)
📄 imgact_shell.c(8.41 KB)
📄 init_main.c(24.31 KB)
📄 init_sysent.c(95.3 KB)
📄 kern_acct.c(19.03 KB)
📄 kern_alq.c(24.97 KB)
📄 kern_clock.c(21.12 KB)
📄 kern_clocksource.c(23.34 KB)
📄 kern_condvar.c(11.28 KB)
📄 kern_conf.c(36.14 KB)
📄 kern_cons.c(15.75 KB)
📄 kern_context.c(3.59 KB)
📄 kern_cpu.c(30.77 KB)
📄 kern_cpuset.c(59.78 KB)
📄 kern_ctf.c(8.73 KB)
📄 kern_descrip.c(112.87 KB)
📄 kern_dtrace.c(2.94 KB)
📄 kern_dump.c(8.51 KB)
📄 kern_environment.c(22.75 KB)
📄 kern_et.c(7.1 KB)
📄 kern_event.c(62.49 KB)
📄 kern_exec.c(46.67 KB)
📄 kern_exit.c(34.61 KB)
📄 kern_fail.c(29.32 KB)
📄 kern_ffclock.c(12.66 KB)
📄 kern_fork.c(28.29 KB)
📄 kern_hhook.c(13.58 KB)
📄 kern_idle.c(2.74 KB)
📄 kern_intr.c(40.44 KB)
📄 kern_jail.c(112.67 KB)
📄 kern_kcov.c(15.32 KB)
📄 kern_khelp.c(9.45 KB)
📄 kern_kthread.c(11.8 KB)
📄 kern_ktr.c(11.93 KB)
📄 kern_ktrace.c(31.41 KB)
📄 kern_linker.c(54.3 KB)
📄 kern_lock.c(46.99 KB)
📄 kern_lockf.c(64.46 KB)
📄 kern_lockstat.c(3.8 KB)
📄 kern_loginclass.c(6.69 KB)
📄 kern_malloc.c(37.09 KB)
📄 kern_mbuf.c(43.16 KB)
📄 kern_mib.c(24.26 KB)
📄 kern_module.c(11.05 KB)
📄 kern_mtxpool.c(5.82 KB)
📄 kern_mutex.c(33.62 KB)
📄 kern_ntptime.c(32.49 KB)
📄 kern_osd.c(12.37 KB)
📄 kern_physio.c(5.74 KB)
📄 kern_pmc.c(8.89 KB)
📄 kern_poll.c(15.86 KB)
📄 kern_priv.c(9.14 KB)
📄 kern_proc.c(80.01 KB)
📄 kern_procctl.c(19.48 KB)
📄 kern_prot.c(57.94 KB)
📄 kern_racct.c(34.01 KB)
📄 kern_rangelock.c(8.67 KB)
📄 kern_rctl.c(53.87 KB)
📄 kern_resource.c(36.66 KB)
📄 kern_rmlock.c(28.27 KB)
📄 kern_rwlock.c(40.72 KB)
📄 kern_sdt.c(2.05 KB)
📄 kern_sema.c(4.85 KB)
📄 kern_sendfile.c(33.97 KB)
📄 kern_sharedpage.c(10.37 KB)
📄 kern_shutdown.c(43.34 KB)
📄 kern_sig.c(101.89 KB)
📄 kern_switch.c(13.85 KB)
📄 kern_sx.c(40.27 KB)
📄 kern_synch.c(18.17 KB)
📄 kern_syscalls.c(6.74 KB)
📄 kern_sysctl.c(67.24 KB)
📄 kern_tc.c(55.73 KB)
📄 kern_thr.c(14.14 KB)
📄 kern_thread.c(41.75 KB)
📄 kern_time.c(40.89 KB)
📄 kern_timeout.c(43.08 KB)
📄 kern_tslog.c(3.44 KB)
📄 kern_ubsan.c(50.74 KB)
📄 kern_umtx.c(107.14 KB)
📄 kern_uuid.c(11.68 KB)
📄 kern_xxx.c(10.44 KB)
📄 ksched.c(6.56 KB)
📄 link_elf.c(47.99 KB)
📄 link_elf_obj.c(44.41 KB)
📄 linker_if.m(3.96 KB)
📄 makesyscalls.sh(23.57 KB)
📄 md4c.c(7.89 KB)
📄 md5c.c(9.56 KB)
📄 msi_if.m(2.48 KB)
📄 p1003_1b.c(8.84 KB)
📄 pic_if.m(3.9 KB)
📄 posix4_mib.c(5.59 KB)
📄 sched_4bsd.c(45.03 KB)
📄 sched_ule.c(82.65 KB)
📄 serdev_if.m(3.49 KB)
📄 stack_protector.c(613 B)
📄 subr_acl_nfs4.c(37.42 KB)
📄 subr_acl_posix1e.c(17.71 KB)
📄 subr_atomic64.c(3.97 KB)
📄 subr_autoconf.c(7.7 KB)
📄 subr_blist.c(31.88 KB)
📄 subr_boot.c(5.8 KB)
📄 subr_bufring.c(2.21 KB)
📄 subr_bus.c(145.4 KB)
📄 subr_bus_dma.c(19.67 KB)
📄 subr_busdma_bufalloc.c(5.24 KB)
📄 subr_capability.c(11.93 KB)
📄 subr_clock.c(10.61 KB)
📄 subr_compressor.c(13.11 KB)
📄 subr_counter.c(4.44 KB)
📄 subr_coverage.c(6.17 KB)
📄 subr_csan.c(25.39 KB)
📄 subr_devmap.c(9.8 KB)
📄 subr_devstat.c(16.21 KB)
📄 subr_disk.c(8.54 KB)
📄 subr_dummy_vdso_tc.c(1.7 KB)
📄 subr_early.c(2.26 KB)
📄 subr_epoch.c(25.02 KB)
📄 subr_eventhandler.c(9.17 KB)
📄 subr_fattime.c(9.98 KB)
📄 subr_filter.c(12.2 KB)
📄 subr_firmware.c(13.88 KB)
📄 subr_gtaskqueue.c(20.19 KB)
📄 subr_hash.c(4.8 KB)
📄 subr_hints.c(12.87 KB)
📄 subr_intr.c(40.61 KB)
📄 subr_kdb.c(16.13 KB)
📄 subr_kobj.c(7.1 KB)
📄 subr_lock.c(18.81 KB)
📄 subr_log.c(7.64 KB)
📄 subr_mchain.c(11.06 KB)
📄 subr_module.c(12.98 KB)
📄 subr_msgbuf.c(10.6 KB)
📄 subr_param.c(10.93 KB)
📄 subr_pcpu.c(10.18 KB)
📄 subr_pctrie.c(20.99 KB)
📄 subr_physmem.c(11.52 KB)
📄 subr_pidctrl.c(5.43 KB)
📄 subr_power.c(3.13 KB)
📄 subr_prf.c(27.42 KB)
📄 subr_prng.c(3.36 KB)
📄 subr_prof.c(15.43 KB)
📄 subr_rangeset.c(8.5 KB)
📄 subr_rman.c(27.61 KB)
📄 subr_rtc.c(11.42 KB)
📄 subr_sbuf.c(20.53 KB)
📄 subr_scanf.c(15.59 KB)
📄 subr_sfbuf.c(6.17 KB)
📄 subr_sglist.c(22.83 KB)
📄 subr_sleepqueue.c(39.43 KB)
📄 subr_smp.c(31.62 KB)
📄 subr_smr.c(20.17 KB)
📄 subr_stack.c(6.47 KB)
📄 subr_stats.c(103.01 KB)
📄 subr_syscall.c(7.98 KB)
📄 subr_taskqueue.c(21.1 KB)
📄 subr_terminal.c(15.52 KB)
📄 subr_trap.c(10.87 KB)
📄 subr_turnstile.c(35.58 KB)
📄 subr_uio.c(11.38 KB)
📄 subr_unit.c(22.97 KB)
📄 subr_vmem.c(43.25 KB)
📄 subr_witness.c(84.59 KB)
📄 sys_capability.c(15.06 KB)
📄 sys_eventfd.c(8.42 KB)
📄 sys_generic.c(44.22 KB)
📄 sys_getrandom.c(4.21 KB)
📄 sys_pipe.c(45.14 KB)
📄 sys_procdesc.c(14.57 KB)
📄 sys_process.c(30.73 KB)
📄 sys_socket.c(20.11 KB)
📄 syscalls.c(22.73 KB)
📄 syscalls.master(60.26 KB)
📄 systrace_args.c(178.49 KB)
📄 sysv_ipc.c(6.53 KB)
📄 sysv_msg.c(48.65 KB)
📄 sysv_sem.c(49.85 KB)
📄 sysv_shm.c(43.93 KB)
📄 tty.c(55.14 KB)
📄 tty_compat.c(11.46 KB)
📄 tty_info.c(9.93 KB)
📄 tty_inq.c(12.22 KB)
📄 tty_outq.c(8.74 KB)
📄 tty_pts.c(19.74 KB)
📄 tty_tty.c(2.83 KB)
📄 tty_ttydisc.c(28.6 KB)
📄 uipc_accf.c(8.07 KB)
📄 uipc_debug.c(12.42 KB)
📄 uipc_domain.c(13.13 KB)
📄 uipc_ktls.c(55.7 KB)
📄 uipc_mbuf.c(52.45 KB)
📄 uipc_mbuf2.c(12.64 KB)
📄 uipc_mbufhash.c(4.9 KB)
📄 uipc_mqueue.c(64.64 KB)
📄 uipc_sem.c(25.18 KB)
📄 uipc_shm.c(50.47 KB)
📄 uipc_sockbuf.c(42.9 KB)
📄 uipc_socket.c(110.61 KB)
📄 uipc_syscalls.c(35.94 KB)
📄 uipc_usrreq.c(75.11 KB)
📄 vfs_acl.c(14.5 KB)
📄 vfs_aio.c(76.32 KB)
📄 vfs_bio.c(145.39 KB)
📄 vfs_cache.c(143.09 KB)
📄 vfs_cluster.c(28.36 KB)
📄 vfs_default.c(33.16 KB)
📄 vfs_export.c(14.55 KB)
📄 vfs_extattr.c(17.91 KB)
📄 vfs_hash.c(6 KB)
📄 vfs_init.c(15.86 KB)
📄 vfs_lookup.c(45.48 KB)
📄 vfs_mount.c(62.58 KB)
📄 vfs_mountroot.c(26.23 KB)
📄 vfs_subr.c(167.52 KB)
📄 vfs_syscalls.c(106.86 KB)
📄 vfs_vnops.c(86.28 KB)
📄 vnode_if.src(13.66 KB)

Editing: uipc_mbuf2.c

/*	$KAME: uipc_mbuf2.c,v 1.31 2001/11/28 11:08:53 itojun Exp $	*/
/*	$NetBSD: uipc_mbuf.c,v 1.40 1999/04/01 00:23:25 thorpej Exp $	*/

/*-
 * SPDX-License-Identifier: BSD-3-Clause
 *
 * Copyright (C) 1999 WIDE Project.
 * All rights reserved.
 * 
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. Neither the name of the project nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */
/*-
 * Copyright (c) 1982, 1986, 1988, 1991, 1993
 *	The Regents of the University of California.  All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. Neither the name of the University nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 *	@(#)uipc_mbuf.c	8.4 (Berkeley) 2/14/95
 */

#include <sys/cdefs.h>
__FBSDID("$FreeBSD$");

/*#define PULLDOWN_DEBUG*/

#include <sys/param.h>
#include <sys/systm.h>
#include <sys/kernel.h>
#include <sys/lock.h>
#include <sys/malloc.h>
#include <sys/mbuf.h>
#include <sys/mutex.h>

#include <security/mac/mac_framework.h>

static MALLOC_DEFINE(M_PACKET_TAGS, MBUF_TAG_MEM_NAME,
    "packet-attached information");

/* can't call it m_dup(), as freebsd[34] uses m_dup() with different arg */
static struct mbuf *m_dup1(struct mbuf *, int, int, int);

/*
 * ensure that [off, off + len) is contiguous on the mbuf chain "m".
 * packet chain before "off" is kept untouched.
 * if offp == NULL, the target will start at <retval, 0> on resulting chain.
 * if offp != NULL, the target will start at <retval, *offp> on resulting chain.
 *
 * on error return (NULL return value), original "m" will be freed.
 *
 * XXX: M_TRAILINGSPACE/M_LEADINGSPACE only permitted on writable ext_buf.
 */
struct mbuf *
m_pulldown(struct mbuf *m, int off, int len, int *offp)
{
	struct mbuf *n, *o;
	int hlen, tlen, olen;
	int writable;

/* check invalid arguments. */
	KASSERT(m != NULL, ("%s: fix caller: m is NULL off %d len %d offp %p\n",
	    __func__, off, len, offp));
	if (len > MCLBYTES) {
		m_freem(m);
		return NULL;	/* impossible */
	}

#ifdef PULLDOWN_DEBUG
    {
	struct mbuf *t;
	printf("before:");
	for (t = m; t; t = t->m_next)
		printf(" %d", t->m_len);
	printf("\n");
    }
#endif
	n = m;
	while (n != NULL && off > 0) {
		if (n->m_len > off)
			break;
		off -= n->m_len;
		n = n->m_next;
	}
	/* be sure to point non-empty mbuf */
	while (n != NULL && n->m_len == 0)
		n = n->m_next;
	if (!n) {
		m_freem(m);
		return NULL;	/* mbuf chain too short */
	}

/*
	 * The following comment is dated but still partially applies:
	 *
	 * XXX: This code is flawed because it considers a "writable" mbuf
	 *      data region to require all of the following:
	 *	  (i) mbuf _has_ to have M_EXT set; if it is just a regular
	 *	      mbuf, it is still not considered "writable."
	 *	  (ii) since mbuf has M_EXT, the ext_type _has_ to be
	 *	       EXT_CLUSTER. Anything else makes it non-writable.
	 *	  (iii) M_WRITABLE() must evaluate true.
	 *      Ideally, the requirement should only be (iii).
	 *
	 * If we're writable, we're sure we're writable, because the ref. count
	 * cannot increase from 1, as that would require possession of mbuf
	 * n by someone else (which is impossible). However, if we're _not_
	 * writable, we may eventually become writable )if the ref. count drops
	 * to 1), but we'll fail to notice it unless we re-evaluate
	 * M_WRITABLE(). For now, we only evaluate once at the beginning and
	 * live with this.
	 */
	writable = 0;
	if ((n->m_flags & M_EXT) == 0 ||
	    (n->m_ext.ext_type == EXT_CLUSTER && M_WRITABLE(n)))
		writable = 1;

/*
	 * the target data is on <n, off>.
	 * if we got enough data on the mbuf "n", we're done.
	 */
	if ((off == 0 || offp) && len <= n->m_len - off)
		goto ok;

/*
	 * when len <= n->m_len - off and off != 0, it is a special case.
	 * len bytes from <n, off> sits in single mbuf, but the caller does
	 * not like the starting position (off).
	 * chop the current mbuf into two pieces, set off to 0.
	 */
	if (len <= n->m_len - off) {
		o = m_dup1(n, off, n->m_len - off, M_NOWAIT);
		if (o == NULL) {
			m_freem(m);
			return NULL;	/* ENOBUFS */
		}
		n->m_len = off;
		o->m_next = n->m_next;
		n->m_next = o;
		n = n->m_next;
		off = 0;
		goto ok;
	}

/*
	 * we need to take hlen from <n, off> and tlen from <n->m_next, 0>,
	 * and construct contiguous mbuf with m_len == len.
	 * note that hlen + tlen == len, and tlen > 0.
	 */
	hlen = n->m_len - off;
	tlen = len - hlen;

/*
	 * ensure that we have enough trailing data on mbuf chain.
	 * if not, we can do nothing about the chain.
	 */
	olen = 0;
	for (o = n->m_next; o != NULL; o = o->m_next)
		olen += o->m_len;
	if (hlen + olen < len) {
		m_freem(m);
		return NULL;	/* mbuf chain too short */
	}

/*
	 * easy cases first.
	 * we need to use m_copydata() to get data from <n->m_next, 0>.
	 */
	if ((off == 0 || offp) && M_TRAILINGSPACE(n) >= tlen
	 && writable) {
		m_copydata(n->m_next, 0, tlen, mtod(n, caddr_t) + n->m_len);
		n->m_len += tlen;
		m_adj(n->m_next, tlen);
		goto ok;
	}
	if ((off == 0 || offp) && M_LEADINGSPACE(n->m_next) >= hlen
	 && writable && n->m_next->m_len >= tlen) {
		n->m_next->m_data -= hlen;
		n->m_next->m_len += hlen;
		bcopy(mtod(n, caddr_t) + off, mtod(n->m_next, caddr_t), hlen);
		n->m_len -= hlen;
		n = n->m_next;
		off = 0;
		goto ok;
	}

/*
	 * now, we need to do the hard way.  don't m_copy as there's no room
	 * on both end.
	 */
	if (len > MLEN)
		o = m_getcl(M_NOWAIT, m->m_type, 0);
	else
		o = m_get(M_NOWAIT, m->m_type);
	if (!o) {
		m_freem(m);
		return NULL;	/* ENOBUFS */
	}
	/* get hlen from <n, off> into <o, 0> */
	o->m_len = hlen;
	bcopy(mtod(n, caddr_t) + off, mtod(o, caddr_t), hlen);
	n->m_len -= hlen;
	/* get tlen from <n->m_next, 0> into <o, hlen> */
	m_copydata(n->m_next, 0, tlen, mtod(o, caddr_t) + o->m_len);
	o->m_len += tlen;
	m_adj(n->m_next, tlen);
	o->m_next = n->m_next;
	n->m_next = o;
	n = o;
	off = 0;

ok:
#ifdef PULLDOWN_DEBUG
    {
	struct mbuf *t;
	printf("after:");
	for (t = m; t; t = t->m_next)
		printf("%c%d", t == n ? '*' : ' ', t->m_len);
	printf(" (off=%d)\n", off);
    }
#endif
	if (offp)
		*offp = off;
	return n;
}

static struct mbuf *
m_dup1(struct mbuf *m, int off, int len, int wait)
{
	struct mbuf *n;
	int copyhdr;

if (len > MCLBYTES)
		return NULL;
	if (off == 0 && (m->m_flags & M_PKTHDR) != 0)
		copyhdr = 1;
	else
		copyhdr = 0;
	if (len >= MINCLSIZE) {
		if (copyhdr == 1)
			n = m_getcl(wait, m->m_type, M_PKTHDR);
		else
			n = m_getcl(wait, m->m_type, 0);
	} else {
		if (copyhdr == 1)
			n = m_gethdr(wait, m->m_type);
		else
			n = m_get(wait, m->m_type);
	}
	if (!n)
		return NULL; /* ENOBUFS */

if (copyhdr && !m_dup_pkthdr(n, m, wait)) {
		m_free(n);
		return NULL;
	}
	m_copydata(m, off, len, mtod(n, caddr_t));
	n->m_len = len;
	return n;
}

/* Free a packet tag. */
void
m_tag_free_default(struct m_tag *t)
{
#ifdef MAC
	if (t->m_tag_id == PACKET_TAG_MACLABEL)
		mac_mbuf_tag_destroy(t);
#endif
	free(t, M_PACKET_TAGS);
}

/* Get a packet tag structure along with specified data following. */
struct m_tag *
m_tag_alloc(uint32_t cookie, int type, int len, int wait)
{
	struct m_tag *t;

MBUF_CHECKSLEEP(wait);
	if (len < 0)
		return NULL;
	t = malloc(len + sizeof(struct m_tag), M_PACKET_TAGS, wait);
	if (t == NULL)
		return NULL;
	m_tag_setup(t, cookie, type, len);
	t->m_tag_free = m_tag_free_default;
	return t;
}

/* Unlink and free a packet tag. */
void
m_tag_delete(struct mbuf *m, struct m_tag *t)
{

KASSERT(m && t, ("m_tag_delete: null argument, m %p t %p", m, t));
	m_tag_unlink(m, t);
	m_tag_free(t);
}

/* Unlink and free a packet tag chain, starting from given tag. */
void
m_tag_delete_chain(struct mbuf *m, struct m_tag *t)
{
	struct m_tag *p, *q;

KASSERT(m, ("m_tag_delete_chain: null mbuf"));
	if (t != NULL)
		p = t;
	else
		p = SLIST_FIRST(&m->m_pkthdr.tags);
	if (p == NULL)
		return;
	while ((q = SLIST_NEXT(p, m_tag_link)) != NULL)
		m_tag_delete(m, q);
	m_tag_delete(m, p);
}

/*
 * Strip off all tags that would normally vanish when
 * passing through a network interface.  Only persistent
 * tags will exist after this; these are expected to remain
 * so long as the mbuf chain exists, regardless of the
 * path the mbufs take.
 */
void
m_tag_delete_nonpersistent(struct mbuf *m)
{
	struct m_tag *p, *q;

SLIST_FOREACH_SAFE(p, &m->m_pkthdr.tags, m_tag_link, q)
		if ((p->m_tag_id & MTAG_PERSISTENT) == 0)
			m_tag_delete(m, p);
}

/* Find a tag, starting from a given position. */
struct m_tag *
m_tag_locate(struct mbuf *m, uint32_t cookie, int type, struct m_tag *t)
{
	struct m_tag *p;

KASSERT(m, ("m_tag_locate: null mbuf"));
	if (t == NULL)
		p = SLIST_FIRST(&m->m_pkthdr.tags);
	else
		p = SLIST_NEXT(t, m_tag_link);
	while (p != NULL) {
		if (p->m_tag_cookie == cookie && p->m_tag_id == type)
			return p;
		p = SLIST_NEXT(p, m_tag_link);
	}
	return NULL;
}

/* Copy a single tag. */
struct m_tag *
m_tag_copy(struct m_tag *t, int how)
{
	struct m_tag *p;

MBUF_CHECKSLEEP(how);
	KASSERT(t, ("m_tag_copy: null tag"));
	p = m_tag_alloc(t->m_tag_cookie, t->m_tag_id, t->m_tag_len, how);
	if (p == NULL)
		return (NULL);
#ifdef MAC
	/*
	 * XXXMAC: we should probably pass off the initialization, and
	 * copying here?  can we hide that PACKET_TAG_MACLABEL is
	 * special from the mbuf code?
	 */
	if (t->m_tag_id == PACKET_TAG_MACLABEL) {
		if (mac_mbuf_tag_init(p, how) != 0) {
			m_tag_free(p);
			return (NULL);
		}
		mac_mbuf_tag_copy(t, p);
	} else
#endif
		bcopy(t + 1, p + 1, t->m_tag_len); /* Copy the data */
	return p;
}

/*
 * Copy two tag chains. The destination mbuf (to) loses any attached
 * tags even if the operation fails. This should not be a problem, as
 * m_tag_copy_chain() is typically called with a newly-allocated
 * destination mbuf.
 */
int
m_tag_copy_chain(struct mbuf *to, const struct mbuf *from, int how)
{
	struct m_tag *p, *t, *tprev = NULL;

MBUF_CHECKSLEEP(how);
	KASSERT(to && from,
		("m_tag_copy_chain: null argument, to %p from %p", to, from));
	m_tag_delete_chain(to, NULL);
	SLIST_FOREACH(p, &from->m_pkthdr.tags, m_tag_link) {
		t = m_tag_copy(p, how);
		if (t == NULL) {
			m_tag_delete_chain(to, NULL);
			return 0;
		}
		if (tprev == NULL)
			SLIST_INSERT_HEAD(&to->m_pkthdr.tags, t, m_tag_link);
		else
			SLIST_INSERT_AFTER(tprev, t, m_tag_link);
		tprev = t;
	}
	return 1;
}

003 File Manager

Editing: uipc_mbuf2.c

Upload File

Create Folder