]> git.saurik.com Git - apple/xnu.git/blob - bsd/sys/mbuf.h
6b585f2b93bf0935d45ed215ee1e4221d8c0f0a0
[apple/xnu.git] / bsd / sys / mbuf.h
1 /*
2 * Copyright (c) 1999-2015 Apple Inc. All rights reserved.
3 *
4 * @APPLE_OSREFERENCE_LICENSE_HEADER_START@
5 *
6 * This file contains Original Code and/or Modifications of Original Code
7 * as defined in and that are subject to the Apple Public Source License
8 * Version 2.0 (the 'License'). You may not use this file except in
9 * compliance with the License. The rights granted to you under the License
10 * may not be used to create, or enable the creation or redistribution of,
11 * unlawful or unlicensed copies of an Apple operating system, or to
12 * circumvent, violate, or enable the circumvention or violation of, any
13 * terms of an Apple operating system software license agreement.
14 *
15 * Please obtain a copy of the License at
16 * http://www.opensource.apple.com/apsl/ and read it before using this file.
17 *
18 * The Original Code and all software distributed under the License are
19 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
20 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
21 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
22 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
23 * Please see the License for the specific language governing rights and
24 * limitations under the License.
25 *
26 * @APPLE_OSREFERENCE_LICENSE_HEADER_END@
27 */
28 /* Copyright (c) 1998, 1999 Apple Computer, Inc. All Rights Reserved */
29 /* Copyright (c) 1995 NeXT Computer, Inc. All Rights Reserved */
30 /*
31 * Mach Operating System
32 * Copyright (c) 1987 Carnegie-Mellon University
33 * All rights reserved. The CMU software License Agreement specifies
34 * the terms and conditions for use and redistribution.
35 */
36 /*
37 * Copyright (c) 1994 NeXT Computer, Inc. All rights reserved.
38 *
39 * Copyright (c) 1982, 1986, 1988 Regents of the University of California.
40 * All rights reserved.
41 *
42 * Redistribution and use in source and binary forms, with or without
43 * modification, are permitted provided that the following conditions
44 * are met:
45 * 1. Redistributions of source code must retain the above copyright
46 * notice, this list of conditions and the following disclaimer.
47 * 2. Redistributions in binary form must reproduce the above copyright
48 * notice, this list of conditions and the following disclaimer in the
49 * documentation and/or other materials provided with the distribution.
50 * 3. All advertising materials mentioning features or use of this software
51 * must display the following acknowledgement:
52 * This product includes software developed by the University of
53 * California, Berkeley and its contributors.
54 * 4. Neither the name of the University nor the names of its contributors
55 * may be used to endorse or promote products derived from this software
56 * without specific prior written permission.
57 *
58 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
59 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
60 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
61 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
62 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
63 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
64 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
65 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
66 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
67 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
68 * SUCH DAMAGE.
69 *
70 * @(#)mbuf.h 8.3 (Berkeley) 1/21/94
71 */
72 /*
73 * NOTICE: This file was modified by SPARTA, Inc. in 2005 to introduce
74 * support for mandatory and extensible security protections. This notice
75 * is included in support of clause 2.2 (b) of the Apple Public License,
76 * Version 2.0.
77 */
78
79 #ifndef _SYS_MBUF_H_
80 #define _SYS_MBUF_H_
81
82 #include <sys/cdefs.h>
83 #include <sys/appleapiopts.h>
84
85 #ifdef XNU_KERNEL_PRIVATE
86
87 #include <sys/lock.h>
88 #include <sys/queue.h>
89 #include <machine/endian.h>
90 /*
91 * Mbufs are of a single size, MSIZE (machine/param.h), which
92 * includes overhead. An mbuf may add a single "mbuf cluster" of size
93 * MCLBYTES/MBIGCLBYTES/M16KCLBYTES (also in machine/param.h), which has
94 * no additional overhead and is used instead of the internal data area;
95 * this is done when at least MINCLSIZE of data must be stored.
96 */
97
98 /*
99 * The following _MLEN and _MHLEN macros are private to xnu. Private code
100 * that are outside of xnu must use the mbuf_get_{mlen,mhlen} routines since
101 * the sizes of the structures are dependent upon specific xnu configs.
102 */
103 #define _MLEN (MSIZE - sizeof(struct m_hdr)) /* normal data len */
104 #define _MHLEN (_MLEN - sizeof(struct pkthdr)) /* data len w/pkthdr */
105
106 #define NMBPGSHIFT (PAGE_SHIFT - MSIZESHIFT)
107 #define NMBPG (1 << NMBPGSHIFT) /* # of mbufs per page */
108
109 #define NCLPGSHIFT (PAGE_SHIFT - MCLSHIFT)
110 #define NCLPG (1 << NCLPGSHIFT) /* # of cl per page */
111
112 #define NBCLPGSHIFT (PAGE_SHIFT - MBIGCLSHIFT)
113 #define NBCLPG (1 << NBCLPGSHIFT) /* # of big cl per page */
114
115 #define NMBPCLSHIFT (MCLSHIFT - MSIZESHIFT)
116 #define NMBPCL (1 << NMBPCLSHIFT) /* # of mbufs per cl */
117
118 #define NCLPJCLSHIFT (M16KCLSHIFT - MCLSHIFT)
119 #define NCLPJCL (1 << NCLPJCLSHIFT) /* # of cl per jumbo cl */
120
121 #define NCLPBGSHIFT (MBIGCLSHIFT - MCLSHIFT)
122 #define NCLPBG (1 << NCLPBGSHIFT) /* # of cl per big cl */
123
124 #define NMBPBGSHIFT (MBIGCLSHIFT - MSIZESHIFT)
125 #define NMBPBG (1 << NMBPBGSHIFT) /* # of mbufs per big cl */
126
127 /*
128 * Macros for type conversion
129 * mtod(m,t) - convert mbuf pointer to data pointer of correct type
130 * dtom(x) - convert data pointer within mbuf to mbuf pointer (XXX)
131 */
132 #define mtod(m, t) ((t)m_mtod(m))
133 #define dtom(x) m_dtom(x)
134
135 /* header at beginning of each mbuf: */
136 struct m_hdr {
137 struct mbuf *mh_next; /* next buffer in chain */
138 struct mbuf *mh_nextpkt; /* next chain in queue/record */
139 caddr_t mh_data; /* location of data */
140 int32_t mh_len; /* amount of data in this mbuf */
141 u_int16_t mh_type; /* type of data in this mbuf */
142 u_int16_t mh_flags; /* flags; see below */
143 };
144
145 /*
146 * Packet tag structure (see below for details).
147 */
148 struct m_tag {
149 u_int64_t m_tag_cookie; /* Error checking */
150 #ifndef __LP64__
151 u_int32_t pad; /* For structure alignment */
152 #endif /* !__LP64__ */
153 SLIST_ENTRY(m_tag) m_tag_link; /* List of packet tags */
154 u_int16_t m_tag_type; /* Module specific type */
155 u_int16_t m_tag_len; /* Length of data */
156 u_int32_t m_tag_id; /* Module ID */
157 };
158
159 #define M_TAG_ALIGN(len) \
160 (P2ROUNDUP(len, sizeof (u_int64_t)) + sizeof (struct m_tag))
161
162 #define M_TAG_VALID_PATTERN 0xfeedfacefeedfaceULL
163 #define M_TAG_FREE_PATTERN 0xdeadbeefdeadbeefULL
164
165 /*
166 * Packet tag header structure (at the top of mbuf). Pointers are
167 * 32-bit in ILP32; m_tag needs 64-bit alignment, hence padded.
168 */
169 struct m_taghdr {
170 #ifndef __LP64__
171 u_int32_t pad; /* For structure alignment */
172 #endif /* !__LP64__ */
173 u_int64_t refcnt; /* Number of tags in this mbuf */
174 };
175
176 /*
177 * Driver auxiliary metadata tag (KERNEL_TAG_TYPE_DRVAUX).
178 */
179 struct m_drvaux_tag {
180 u_int32_t da_family; /* IFNET_FAMILY values */
181 u_int32_t da_subfamily; /* IFNET_SUBFAMILY values */
182 u_int32_t da_reserved; /* for future */
183 u_int32_t da_length; /* length of following data */
184 };
185
186 /* Values for pftag_flags (16-bit wide) */
187 #define PF_TAG_GENERATED 0x1 /* pkt generated by PF */
188 #define PF_TAG_FRAGCACHE 0x2
189 #define PF_TAG_TRANSLATE_LOCALHOST 0x4
190 #if PF_ECN
191 #define PF_TAG_HDR_INET 0x8 /* hdr points to IPv4 */
192 #define PF_TAG_HDR_INET6 0x10 /* hdr points to IPv6 */
193 #endif /* PF_ECN */
194 /*
195 * PF mbuf tag
196 */
197 struct pf_mtag {
198 u_int16_t pftag_flags; /* PF_TAG flags */
199 u_int16_t pftag_rtableid; /* alternate routing table id */
200 u_int16_t pftag_tag;
201 u_int16_t pftag_routed;
202 #if PF_ALTQ
203 u_int32_t pftag_qid;
204 #endif /* PF_ALTQ */
205 #if PF_ECN
206 void *pftag_hdr; /* saved hdr pos in mbuf, for ECN */
207 #endif /* PF_ECN */
208 };
209
210 /*
211 * TCP mbuf tag
212 */
213 struct tcp_pktinfo {
214 union {
215 struct {
216 u_int32_t segsz; /* segment size (actual MSS) */
217 u_int32_t start_seq; /* start seq of this packet */
218 } __tx;
219 struct {
220 u_int16_t lro_pktlen; /* max seg size encountered */
221 u_int8_t lro_npkts; /* # of coalesced TCP pkts */
222 u_int8_t lro_timediff; /* time spent in LRO */
223 } __rx;
224 } __offload;
225 union {
226 u_int32_t pri; /* send msg priority */
227 u_int32_t seq; /* recv msg sequence # */
228 } __msgattr;
229 #define tso_segsz proto_mtag.__pr_u.tcp.tm_tcp.__offload.__tx.segsz
230 #define tx_start_seq proto_mtag.__pr_u.tcp.tm_tcp.__offload.__tx.start_seq
231 #define lro_pktlen proto_mtag.__pr_u.tcp.tm_tcp.__offload.__rx.lro_pktlen
232 #define lro_npkts proto_mtag.__pr_u.tcp.tm_tcp.__offload.__rx.lro_npkts
233 #define lro_elapsed proto_mtag.__pr_u.tcp.tm_tcp.__offload.__rx.lro_timediff
234 #define msg_pri proto_mtag.__pr_u.tcp.tm_tcp.__msgattr.pri
235 #define msg_seq proto_mtag.__pr_u.tcp.tm_tcp.__msgattr.seq
236 };
237
238 /*
239 * MPTCP mbuf tag
240 */
241 struct mptcp_pktinfo {
242 u_int64_t mtpi_dsn; /* MPTCP Data Sequence Number */
243 u_int32_t mtpi_rel_seq; /* Relative Seq Number */
244 u_int32_t mtpi_length; /* Length of mapping */
245 #define mp_dsn proto_mtag.__pr_u.tcp.tm_mptcp.mtpi_dsn
246 #define mp_rseq proto_mtag.__pr_u.tcp.tm_mptcp.mtpi_rel_seq
247 #define mp_rlen proto_mtag.__pr_u.tcp.tm_mptcp.mtpi_length
248 };
249
250 /*
251 * TCP specific mbuf tag. Note that the current implementation uses
252 * MPTCP metadata strictly between MPTCP and the TCP subflow layers,
253 * hence tm_tcp and tm_mptcp are mutually exclusive. This also means
254 * that TCP messages functionality is currently incompatible with MPTCP.
255 */
256 struct tcp_mtag {
257 union {
258 struct tcp_pktinfo tm_tcp; /* TCP and below */
259 struct mptcp_pktinfo tm_mptcp; /* MPTCP-TCP only */
260 };
261 };
262
263 struct driver_mtag_ {
264 uintptr_t _drv_tx_compl_arg;
265 uintptr_t _drv_tx_compl_data;
266 kern_return_t _drv_tx_status;
267 uint16_t _drv_flowid;
268 #define drv_tx_compl_arg builtin_mtag._drv_mtag._drv_tx_compl_arg
269 #define drv_tx_compl_data builtin_mtag._drv_mtag._drv_tx_compl_data
270 #define drv_tx_status builtin_mtag._drv_mtag._drv_tx_status
271 #define drv_flowid builtin_mtag._drv_mtag._drv_flowid
272 };
273
274 /*
275 * Protocol specific mbuf tag (at most one protocol metadata per mbuf).
276 *
277 * Care must be taken to ensure that they are mutually exclusive, e.g.
278 * IPSec policy ID implies no TCP segment offload (which is fine given
279 * that the former is used on the virtual ipsec interface that does
280 * not advertise the TSO capability.)
281 */
282 struct proto_mtag_ {
283 union {
284 struct tcp_mtag tcp; /* TCP specific */
285 } __pr_u;
286 };
287
288 /*
289 * NECP specific mbuf tag.
290 */
291 struct necp_mtag_ {
292 u_int32_t necp_policy_id;
293 u_int32_t necp_last_interface_index;
294 u_int32_t necp_route_rule_id;
295 u_int32_t necp_app_id;
296 };
297
298 union builtin_mtag {
299 struct {
300 struct proto_mtag_ _proto_mtag; /* built-in protocol-specific tag */
301 struct pf_mtag _pf_mtag; /* built-in PF tag */
302 struct necp_mtag_ _necp_mtag; /* built-in NECP tag */
303 } _net_mtag;
304 struct driver_mtag_ _drv_mtag;
305 #define necp_mtag builtin_mtag._net_mtag._necp_mtag
306 #define proto_mtag builtin_mtag._net_mtag._proto_mtag
307 #define driver_mtag builtin_mtag._drv_mtag
308 };
309
310 /*
311 * Record/packet header in first mbuf of chain; valid only if M_PKTHDR set.
312 */
313 struct pkthdr {
314 struct ifnet *rcvif; /* rcv interface */
315 /* variables for ip and tcp reassembly */
316 void *pkt_hdr; /* pointer to packet header */
317 int32_t len; /* total packet length */
318 /* variables for hardware checksum */
319 /* Note: csum_flags is used for hardware checksum and VLAN */
320 u_int32_t csum_flags; /* flags regarding checksum */
321 union {
322 struct {
323 u_int16_t val; /* checksum value */
324 u_int16_t start; /* checksum start offset */
325 } _csum_rx;
326 #define csum_rx_val _csum_rx.val
327 #define csum_rx_start _csum_rx.start
328 struct {
329 u_int16_t start; /* checksum start offset */
330 u_int16_t stuff; /* checksum stuff offset */
331 } _csum_tx;
332 #define csum_tx_start _csum_tx.start
333 #define csum_tx_stuff _csum_tx.stuff
334 u_int32_t csum_data; /* data field used by csum routines */
335 };
336 u_int16_t vlan_tag; /* VLAN tag, host byte order */
337 /*
338 * Packet classifier info
339 *
340 * PKTF_FLOW_ID set means valid flow ID. A non-zero flow ID value
341 * means the packet has been classified by one of the flow sources.
342 * It is also a prerequisite for flow control advisory, which is
343 * enabled by additionally setting PKTF_FLOW_ADV.
344 *
345 * The protocol value is a best-effort representation of the payload.
346 * It is opportunistically updated and used only for optimization.
347 * It is not a substitute for parsing the protocol header(s); use it
348 * only as a hint.
349 *
350 * If PKTF_IFAINFO is set, pkt_ifainfo contains one or both of the
351 * indices of interfaces which own the source and/or destination
352 * addresses of the packet. For the local/loopback case (PKTF_LOOP),
353 * both should be valid, and thus allows for the receiving end to
354 * quickly determine the actual interfaces used by the the addresses;
355 * they may not necessarily be the same or refer to the loopback
356 * interface. Otherwise, in the non-local/loopback case, the indices
357 * are opportunistically set, and because of that only one may be set
358 * (0 means the index has not been determined.) In addition, the
359 * interface address flags are also recorded. This allows us to avoid
360 * storing the corresponding {in,in6}_ifaddr in an mbuf tag. Ideally
361 * this would be a superset of {ia,ia6}_flags, but the namespaces are
362 * overlapping at present, so we'll need a new set of values in future
363 * to achieve this. For now, we will just rely on the address family
364 * related code paths examining this mbuf to interpret the flags.
365 */
366 u_int8_t pkt_proto; /* IPPROTO value */
367 u_int8_t pkt_flowsrc; /* FLOWSRC values */
368 u_int32_t pkt_flowid; /* flow ID */
369 u_int32_t pkt_flags; /* PKTF flags (see below) */
370 u_int32_t pkt_svc; /* MBUF_SVC value */
371
372 u_int32_t pkt_compl_context; /* Packet completion context */
373
374 union {
375 struct {
376 u_int16_t src; /* ifindex of src addr i/f */
377 u_int16_t src_flags; /* src PKT_IFAIFF flags */
378 u_int16_t dst; /* ifindex of dst addr i/f */
379 u_int16_t dst_flags; /* dst PKT_IFAIFF flags */
380 } _pkt_iaif;
381 #define src_ifindex _pkt_iaif.src
382 #define src_iff _pkt_iaif.src_flags
383 #define dst_ifindex _pkt_iaif.dst
384 #define dst_iff _pkt_iaif.dst_flags
385 u_int64_t pkt_ifainfo; /* data field used by ifainfo */
386 struct {
387 u_int32_t if_data; /* bytes in interface queue */
388 u_int32_t sndbuf_data; /* bytes in socket buffer */
389 } _pkt_bsr; /* Buffer status report used by cellular interface */
390 #define bufstatus_if _pkt_bsr.if_data
391 #define bufstatus_sndbuf _pkt_bsr.sndbuf_data
392 };
393 #if MEASURE_BW
394 u_int64_t pkt_bwseq; /* sequence # */
395 #endif /* MEASURE_BW */
396 u_int64_t pkt_timestamp; /* enqueue time */
397
398 /*
399 * Tags (external and built-in)
400 */
401 SLIST_HEAD(packet_tags, m_tag) tags; /* list of external tags */
402 union builtin_mtag builtin_mtag;
403 /*
404 * Module private scratch space (32-bit aligned), currently 16-bytes
405 * large. Anything stored here is not guaranteed to survive across
406 * modules.
407 */
408 struct {
409 union {
410 u_int8_t __mpriv8[16];
411 u_int16_t __mpriv16[8];
412 struct {
413 union {
414 u_int8_t __val8[4];
415 u_int16_t __val16[2];
416 u_int32_t __val32;
417 } __mpriv32_u;
418 } __mpriv32[4];
419 u_int64_t __mpriv64[2];
420 } __mpriv_u;
421 } pkt_mpriv __attribute__((aligned(4)));
422 u_int32_t redzone; /* red zone */
423 u_int32_t pkt_compl_callbacks; /* Packet completion callbacks */
424 };
425
426 /*
427 * Flow data source type. A data source module is responsible for generating
428 * a unique flow ID and associating it to each data flow as pkt_flowid.
429 * This is required for flow control/advisory, as it allows the output queue
430 * to identify the data source object and inform that it can resume its
431 * transmission (in the event it was flow controlled.)
432 */
433 #define FLOWSRC_INPCB 1 /* flow ID generated by INPCB */
434 #define FLOWSRC_IFNET 2 /* flow ID generated by interface */
435 #define FLOWSRC_PF 3 /* flow ID generated by PF */
436 #define FLOWSRC_CHANNEL 4 /* flow ID generated by channel */
437
438 /*
439 * Packet flags. Unlike m_flags, all packet flags are copied along when
440 * copying m_pkthdr, i.e. no equivalent of M_COPYFLAGS here. These flags
441 * (and other classifier info) will be cleared during DLIL input.
442 *
443 * Some notes about M_LOOP and PKTF_LOOP:
444 *
445 * - M_LOOP flag is overloaded, and its use is discouraged. Historically,
446 * that flag was used by the KAME implementation for allowing certain
447 * certain exceptions to be made in the IP6_EXTHDR_CHECK() logic; this
448 * was originally meant to be set as the packet is looped back to the
449 * system, and in some circumstances temporarily set in ip6_output().
450 * Over time, this flag was used by the pre-output routines to indicate
451 * to the DLIL frameout and output routines, that the packet may be
452 * looped back to the system under the right conditions. In addition,
453 * this is an mbuf flag rather than an mbuf packet header flag.
454 *
455 * - PKTF_LOOP is an mbuf packet header flag, which is set if and only
456 * if the packet was looped back to the system. This flag should be
457 * used instead for newer code.
458 */
459 #define PKTF_FLOW_ID 0x1 /* pkt has valid flowid value */
460 #define PKTF_FLOW_ADV 0x2 /* pkt triggers local flow advisory */
461 #define PKTF_FLOW_LOCALSRC 0x4 /* pkt is locally originated */
462 #define PKTF_FLOW_RAWSOCK 0x8 /* pkt locally generated by raw sock */
463 #define PKTF_PRIO_PRIVILEGED 0x10 /* packet priority is privileged */
464 #define PKTF_PROXY_DST 0x20 /* processed but not locally destined */
465 #define PKTF_INET_RESOLVE 0x40 /* IPv4 resolver packet */
466 #define PKTF_INET6_RESOLVE 0x80 /* IPv6 resolver packet */
467 #define PKTF_RESOLVE_RTR 0x100 /* pkt is for resolving router */
468 #define PKTF_SW_LRO_PKT 0x200 /* pkt is a large coalesced pkt */
469 #define PKTF_SW_LRO_DID_CSUM 0x400 /* IP and TCP checksums done by LRO */
470 #define PKTF_MPTCP 0x800 /* TCP with MPTCP metadata */
471 #define PKTF_MPSO 0x1000 /* MPTCP socket meta data */
472 #define PKTF_LOOP 0x2000 /* loopbacked packet */
473 #define PKTF_IFAINFO 0x4000 /* pkt has valid interface addr info */
474 #define PKTF_SO_BACKGROUND 0x8000 /* data is from background source */
475 #define PKTF_FORWARDED 0x10000 /* pkt was forwarded from another i/f */
476 #define PKTF_PRIV_GUARDED 0x20000 /* pkt_mpriv area guard enabled */
477 #define PKTF_KEEPALIVE 0x40000 /* pkt is kernel-generated keepalive */
478 #define PKTF_SO_REALTIME 0x80000 /* data is realtime traffic */
479 #define PKTF_VALID_UNSENT_DATA 0x100000 /* unsent data is valid */
480 #define PKTF_TCP_REXMT 0x200000 /* packet is TCP retransmission */
481 #define PKTF_REASSEMBLED 0x400000 /* Packet was reassembled */
482 #define PKTF_TX_COMPL_TS_REQ 0x800000 /* tx completion timestamp requested */
483 #define PKTF_DRV_TS_VALID 0x1000000 /* driver timestamp is valid */
484 #define PKTF_DRIVER_MTAG 0x2000000 /* driver mbuf tags fields inited */
485 #define PKTF_NEW_FLOW 0x4000000 /* Data from a new flow */
486 #define PKTF_START_SEQ 0x8000000 /* valid start sequence */
487 #define PKTF_LAST_PKT 0x10000000 /* last packet in the flow */
488
489 /* flags related to flow control/advisory and identification */
490 #define PKTF_FLOW_MASK \
491 (PKTF_FLOW_ID | PKTF_FLOW_ADV | PKTF_FLOW_LOCALSRC | PKTF_FLOW_RAWSOCK)
492
493 /*
494 * Description of external storage mapped into mbuf, valid only if M_EXT set.
495 */
496 typedef void (*m_ext_free_func_t)(caddr_t, u_int, caddr_t);
497 struct m_ext {
498 caddr_t ext_buf; /* start of buffer */
499 m_ext_free_func_t ext_free; /* free routine if not the usual */
500 u_int ext_size; /* size of buffer, for ext_free */
501 caddr_t ext_arg; /* additional ext_free argument */
502 struct ext_ref {
503 struct mbuf *paired;
504 u_int16_t minref;
505 u_int16_t refcnt;
506 u_int16_t prefcnt;
507 u_int16_t flags;
508 u_int32_t priv;
509 uintptr_t ext_token;
510 } *ext_refflags;
511 };
512
513 /* define m_ext to a type since it gets redefined below */
514 typedef struct m_ext _m_ext_t;
515
516 /*
517 * The mbuf object
518 */
519 struct mbuf {
520 struct m_hdr m_hdr;
521 union {
522 struct {
523 struct pkthdr MH_pkthdr; /* M_PKTHDR set */
524 union {
525 struct m_ext MH_ext; /* M_EXT set */
526 char MH_databuf[_MHLEN];
527 } MH_dat;
528 } MH;
529 char M_databuf[_MLEN]; /* !M_PKTHDR, !M_EXT */
530 } M_dat;
531 };
532
533 #define m_next m_hdr.mh_next
534 #define m_len m_hdr.mh_len
535 #define m_data m_hdr.mh_data
536 #define m_type m_hdr.mh_type
537 #define m_flags m_hdr.mh_flags
538 #define m_nextpkt m_hdr.mh_nextpkt
539 #define m_act m_nextpkt
540 #define m_pkthdr M_dat.MH.MH_pkthdr
541 #define m_ext M_dat.MH.MH_dat.MH_ext
542 #define m_pktdat M_dat.MH.MH_dat.MH_databuf
543 #define m_dat M_dat.M_databuf
544 #define m_pktlen(_m) ((_m)->m_pkthdr.len)
545 #define m_pftag(_m) (&(_m)->m_pkthdr.builtin_mtag._net_mtag._pf_mtag)
546
547 /* mbuf flags (private) */
548 #define M_EXT 0x0001 /* has associated external storage */
549 #define M_PKTHDR 0x0002 /* start of record */
550 #define M_EOR 0x0004 /* end of record */
551 #define M_PROTO1 0x0008 /* protocol-specific */
552 #define M_PROTO2 0x0010 /* protocol-specific */
553 #define M_PROTO3 0x0020 /* protocol-specific */
554 #define M_LOOP 0x0040 /* packet is looped back (also see PKTF_LOOP) */
555 #define M_PROTO5 0x0080 /* protocol-specific */
556
557 /* mbuf pkthdr flags, also in m_flags (private) */
558 #define M_BCAST 0x0100 /* send/received as link-level broadcast */
559 #define M_MCAST 0x0200 /* send/received as link-level multicast */
560 #define M_FRAG 0x0400 /* packet is a fragment of a larger packet */
561 #define M_FIRSTFRAG 0x0800 /* packet is first fragment */
562 #define M_LASTFRAG 0x1000 /* packet is last fragment */
563 #define M_PROMISC 0x2000 /* packet is promiscuous (shouldn't go to stack) */
564 #define M_HASFCS 0x4000 /* packet has FCS */
565 #define M_TAGHDR 0x8000 /* m_tag hdr structure at top of mbuf data */
566
567 /*
568 * Flags to purge when crossing layers.
569 */
570 #define M_PROTOFLAGS \
571 (M_PROTO1|M_PROTO2|M_PROTO3|M_PROTO5)
572
573 /* flags copied when copying m_pkthdr */
574 #define M_COPYFLAGS \
575 (M_PKTHDR|M_EOR|M_PROTO1|M_PROTO2|M_PROTO3 | \
576 M_LOOP|M_PROTO5|M_BCAST|M_MCAST|M_FRAG | \
577 M_FIRSTFRAG|M_LASTFRAG|M_PROMISC|M_HASFCS)
578
579 /* flags indicating hw checksum support and sw checksum requirements */
580 #define CSUM_IP 0x0001 /* will csum IP */
581 #define CSUM_TCP 0x0002 /* will csum TCP */
582 #define CSUM_UDP 0x0004 /* will csum UDP */
583 #define CSUM_IP_FRAGS 0x0008 /* will csum IP fragments */
584 #define CSUM_FRAGMENT 0x0010 /* will do IP fragmentation */
585 #define CSUM_TCPIPV6 0x0020 /* will csum TCP for IPv6 */
586 #define CSUM_UDPIPV6 0x0040 /* will csum UDP for IPv6 */
587 #define CSUM_FRAGMENT_IPV6 0x0080 /* will do IPv6 fragmentation */
588
589 #define CSUM_IP_CHECKED 0x0100 /* did csum IP */
590 #define CSUM_IP_VALID 0x0200 /* ... the csum is valid */
591 #define CSUM_DATA_VALID 0x0400 /* csum_data field is valid */
592 #define CSUM_PSEUDO_HDR 0x0800 /* csum_data has pseudo hdr */
593 #define CSUM_PARTIAL 0x1000 /* simple Sum16 computation */
594
595 #define CSUM_DELAY_DATA (CSUM_TCP | CSUM_UDP)
596 #define CSUM_DELAY_IP (CSUM_IP) /* IPv4 only: no IPv6 IP cksum */
597 #define CSUM_DELAY_IPV6_DATA (CSUM_TCPIPV6 | CSUM_UDPIPV6)
598 #define CSUM_DATA_IPV6_VALID CSUM_DATA_VALID /* csum_data field is valid */
599
600 #define CSUM_TX_FLAGS \
601 (CSUM_DELAY_IP | CSUM_DELAY_DATA | CSUM_DELAY_IPV6_DATA | \
602 CSUM_DATA_VALID | CSUM_PARTIAL)
603
604 #define CSUM_RX_FLAGS \
605 (CSUM_IP_CHECKED | CSUM_IP_VALID | CSUM_PSEUDO_HDR | \
606 CSUM_DATA_VALID | CSUM_PARTIAL)
607
608 /*
609 * Note: see also IF_HWASSIST_CSUM defined in <net/if_var.h>
610 */
611
612 /* VLAN tag present */
613 #define CSUM_VLAN_TAG_VALID 0x10000 /* vlan_tag field is valid */
614
615 /* TCP Segment Offloading requested on this mbuf */
616 #define CSUM_TSO_IPV4 0x100000 /* This mbuf needs to be segmented by the NIC */
617 #define CSUM_TSO_IPV6 0x200000 /* This mbuf needs to be segmented by the NIC */
618
619 #define TSO_IPV4_OK(_ifp, _m) \
620 (((_ifp)->if_hwassist & IFNET_TSO_IPV4) && \
621 ((_m)->m_pkthdr.csum_flags & CSUM_TSO_IPV4)) \
622
623 #define TSO_IPV4_NOTOK(_ifp, _m) \
624 (!((_ifp)->if_hwassist & IFNET_TSO_IPV4) && \
625 ((_m)->m_pkthdr.csum_flags & CSUM_TSO_IPV4)) \
626
627 #define TSO_IPV6_OK(_ifp, _m) \
628 (((_ifp)->if_hwassist & IFNET_TSO_IPV6) && \
629 ((_m)->m_pkthdr.csum_flags & CSUM_TSO_IPV6)) \
630
631 #define TSO_IPV6_NOTOK(_ifp, _m) \
632 (!((_ifp)->if_hwassist & IFNET_TSO_IPV6) && \
633 ((_m)->m_pkthdr.csum_flags & CSUM_TSO_IPV6)) \
634
635 #endif /* XNU_KERNEL_PRIVATE */
636
637 /* mbuf types */
638 #define MT_FREE 0 /* should be on free list */
639 #define MT_DATA 1 /* dynamic (data) allocation */
640 #define MT_HEADER 2 /* packet header */
641 #define MT_SOCKET 3 /* socket structure */
642 #define MT_PCB 4 /* protocol control block */
643 #define MT_RTABLE 5 /* routing tables */
644 #define MT_HTABLE 6 /* IMP host tables */
645 #define MT_ATABLE 7 /* address resolution tables */
646 #define MT_SONAME 8 /* socket name */
647 #define MT_SOOPTS 10 /* socket options */
648 #define MT_FTABLE 11 /* fragment reassembly header */
649 #define MT_RIGHTS 12 /* access rights */
650 #define MT_IFADDR 13 /* interface address */
651 #define MT_CONTROL 14 /* extra-data protocol message */
652 #define MT_OOBDATA 15 /* expedited data */
653 #define MT_TAG 16 /* volatile metadata associated to pkts */
654 #define MT_MAX 32 /* enough? */
655
656 #ifdef XNU_KERNEL_PRIVATE
657 /*
658 * mbuf allocation/deallocation macros:
659 *
660 * MGET(struct mbuf *m, int how, int type)
661 * allocates an mbuf and initializes it to contain internal data.
662 *
663 * MGETHDR(struct mbuf *m, int how, int type)
664 * allocates an mbuf and initializes it to contain a packet header
665 * and internal data.
666 */
667
668 #if 1
669 #define MCHECK(m) m_mcheck(m)
670 #else
671 #define MCHECK(m)
672 #endif
673
674 #define MGET(m, how, type) ((m) = m_get((how), (type)))
675
676 #define MGETHDR(m, how, type) ((m) = m_gethdr((how), (type)))
677
678 /*
679 * Mbuf cluster macros.
680 * MCLALLOC(caddr_t p, int how) allocates an mbuf cluster.
681 * MCLGET adds such clusters to a normal mbuf;
682 * the flag M_EXT is set upon success.
683 * MCLFREE releases a reference to a cluster allocated by MCLALLOC,
684 * freeing the cluster if the reference count has reached 0.
685 *
686 * Normal mbuf clusters are normally treated as character arrays
687 * after allocation, but use the first word of the buffer as a free list
688 * pointer while on the free list.
689 */
690 union mcluster {
691 union mcluster *mcl_next;
692 char mcl_buf[MCLBYTES];
693 };
694
695 #define MCLALLOC(p, how) ((p) = m_mclalloc(how))
696
697 #define MCLFREE(p) m_mclfree(p)
698
699 #define MCLGET(m, how) ((m) = m_mclget(m, how))
700
701 /*
702 * Mbuf big cluster
703 */
704 union mbigcluster {
705 union mbigcluster *mbc_next;
706 char mbc_buf[MBIGCLBYTES];
707 };
708
709 /*
710 * Mbuf jumbo cluster
711 */
712 union m16kcluster {
713 union m16kcluster *m16kcl_next;
714 char m16kcl_buf[M16KCLBYTES];
715 };
716
717 #define MCLHASREFERENCE(m) m_mclhasreference(m)
718
719 /*
720 * MFREE(struct mbuf *m, struct mbuf *n)
721 * Free a single mbuf and associated external storage.
722 * Place the successor, if any, in n.
723 */
724
725 #define MFREE(m, n) ((n) = m_free(m))
726
727 /*
728 * Copy mbuf pkthdr from from to to.
729 * from must have M_PKTHDR set, and to must be empty.
730 * aux pointer will be moved to `to'.
731 */
732 #define M_COPY_PKTHDR(to, from) m_copy_pkthdr(to, from)
733
734 #define M_COPY_PFTAG(to, from) m_copy_pftag(to, from)
735
736 #define M_COPY_CLASSIFIER(to, from) m_copy_classifier(to, from)
737
738 /*
739 * Set the m_data pointer of a newly-allocated mbuf (m_get/MGET) to place
740 * an object of the specified size at the end of the mbuf, longword aligned.
741 */
742 #define M_ALIGN(m, len) \
743 do { \
744 (m)->m_data += (MLEN - (len)) &~ (sizeof (long) - 1); \
745 } while (0)
746
747 /*
748 * As above, for mbufs allocated with m_gethdr/MGETHDR
749 * or initialized by M_COPY_PKTHDR.
750 */
751 #define MH_ALIGN(m, len) \
752 do { \
753 (m)->m_data += (MHLEN - (len)) &~ (sizeof (long) - 1); \
754 } while (0)
755
756 /*
757 * Compute the amount of space available
758 * before the current start of data in an mbuf.
759 * Subroutine - data not available if certain references.
760 */
761 #define M_LEADINGSPACE(m) m_leadingspace(m)
762
763 /*
764 * Compute the amount of space available
765 * after the end of data in an mbuf.
766 * Subroutine - data not available if certain references.
767 */
768 #define M_TRAILINGSPACE(m) m_trailingspace(m)
769
770 /*
771 * Arrange to prepend space of size plen to mbuf m.
772 * If a new mbuf must be allocated, how specifies whether to wait.
773 * If how is M_DONTWAIT and allocation fails, the original mbuf chain
774 * is freed and m is set to NULL.
775 */
776 #define M_PREPEND(m, plen, how, align) \
777 ((m) = m_prepend_2((m), (plen), (how), (align)))
778
779 /* change mbuf to new type */
780 #define MCHTYPE(m, t) m_mchtype(m, t)
781
782 /* compatiblity with 4.3 */
783 #define m_copy(m, o, l) m_copym((m), (o), (l), M_DONTWAIT)
784
785 #define MBSHIFT 20 /* 1MB */
786 #define MBSIZE (1 << MBSHIFT)
787 #define GBSHIFT 30 /* 1GB */
788 #define GBSIZE (1 << GBSHIFT)
789
790 /*
791 * M_STRUCT_GET ensures that intermediate protocol header (from "off" to
792 * "off+len") is located in single mbuf, on contiguous memory region.
793 * The pointer to the region will be returned to pointer variable "val",
794 * with type "typ".
795 *
796 * M_STRUCT_GET0 does the same, except that it aligns the structure at
797 * very top of mbuf. GET0 is likely to make memory copy than GET.
798 */
799 #define M_STRUCT_GET(val, typ, m, off, len) \
800 do { \
801 struct mbuf *t; \
802 int tmp; \
803 \
804 if ((m)->m_len >= (off) + (len)) { \
805 (val) = (typ)(mtod((m), caddr_t) + (off)); \
806 } else { \
807 t = m_pulldown((m), (off), (len), &tmp); \
808 if (t != NULL) { \
809 if (t->m_len < tmp + (len)) \
810 panic("m_pulldown malfunction"); \
811 (val) = (typ)(mtod(t, caddr_t) + tmp); \
812 } else { \
813 (val) = (typ)NULL; \
814 (m) = NULL; \
815 } \
816 } \
817 } while (0)
818
819 #define M_STRUCT_GET0(val, typ, m, off, len) \
820 do { \
821 struct mbuf *t; \
822 \
823 if ((off) == 0 && ((m)->m_len >= (len))) { \
824 (val) = (typ)(void *)mtod(m, caddr_t); \
825 } else { \
826 t = m_pulldown((m), (off), (len), NULL); \
827 if (t != NULL) { \
828 if (t->m_len < (len)) \
829 panic("m_pulldown malfunction"); \
830 (val) = (typ)(void *)mtod(t, caddr_t); \
831 } else { \
832 (val) = (typ)NULL; \
833 (m) = NULL; \
834 } \
835 } \
836 } while (0)
837
838 #define MBUF_INPUT_CHECK(m, rcvif) \
839 do { \
840 if (!(m->m_flags & MBUF_PKTHDR) || \
841 m->m_len < 0 || \
842 m->m_len > ((njcl > 0) ? njclbytes : MBIGCLBYTES) || \
843 m->m_type == MT_FREE || \
844 ((m->m_flags & M_EXT) != 0 && m->m_ext.ext_buf == NULL)) { \
845 panic_plain("Failed mbuf validity check: mbuf %p len %d " \
846 "type %d flags 0x%x data %p rcvif %s ifflags 0x%x", \
847 m, m->m_len, m->m_type, m->m_flags, \
848 ((m->m_flags & M_EXT) ? m->m_ext.ext_buf : m->m_data), \
849 if_name(rcvif), \
850 (rcvif->if_flags & 0xffff)); \
851 } \
852 } while (0)
853
854 /*
855 * Simple mbuf queueing system
856 *
857 * This is basically a SIMPLEQ adapted to mbuf use (i.e. using
858 * m_nextpkt instead of field.sqe_next).
859 *
860 * m_next is ignored, so queueing chains of mbufs is possible
861 */
862 #define MBUFQ_HEAD(name) \
863 struct name { \
864 struct mbuf *mq_first; /* first packet */ \
865 struct mbuf **mq_last; /* addr of last next packet */ \
866 }
867
868 #define MBUFQ_INIT(q) do { \
869 MBUFQ_FIRST(q) = NULL; \
870 (q)->mq_last = &MBUFQ_FIRST(q); \
871 } while (0)
872
873 #define MBUFQ_PREPEND(q, m) do { \
874 if ((MBUFQ_NEXT(m) = MBUFQ_FIRST(q)) == NULL) \
875 (q)->mq_last = &MBUFQ_NEXT(m); \
876 MBUFQ_FIRST(q) = (m); \
877 } while (0)
878
879 #define MBUFQ_ENQUEUE(q, m) do { \
880 MBUFQ_NEXT(m) = NULL; \
881 *(q)->mq_last = (m); \
882 (q)->mq_last = &MBUFQ_NEXT(m); \
883 } while (0)
884
885 #define MBUFQ_ENQUEUE_MULTI(q, m, n) do { \
886 MBUFQ_NEXT(n) = NULL; \
887 *(q)->mq_last = (m); \
888 (q)->mq_last = &MBUFQ_NEXT(n); \
889 } while (0)
890
891 #define MBUFQ_DEQUEUE(q, m) do { \
892 if (((m) = MBUFQ_FIRST(q)) != NULL) { \
893 if ((MBUFQ_FIRST(q) = MBUFQ_NEXT(m)) == NULL) \
894 (q)->mq_last = &MBUFQ_FIRST(q); \
895 else \
896 MBUFQ_NEXT(m) = NULL; \
897 } \
898 } while (0)
899
900 #define MBUFQ_REMOVE(q, m) do { \
901 if (MBUFQ_FIRST(q) == (m)) { \
902 MBUFQ_DEQUEUE(q, m); \
903 } else { \
904 struct mbuf *_m = MBUFQ_FIRST(q); \
905 while (MBUFQ_NEXT(_m) != (m)) \
906 _m = MBUFQ_NEXT(_m); \
907 if ((MBUFQ_NEXT(_m) = \
908 MBUFQ_NEXT(MBUFQ_NEXT(_m))) == NULL) \
909 (q)->mq_last = &MBUFQ_NEXT(_m); \
910 } \
911 } while (0)
912
913 #define MBUFQ_DRAIN(q) do { \
914 struct mbuf *__m0; \
915 while ((__m0 = MBUFQ_FIRST(q)) != NULL) { \
916 MBUFQ_FIRST(q) = MBUFQ_NEXT(__m0); \
917 MBUFQ_NEXT(__m0) = NULL; \
918 m_freem(__m0); \
919 } \
920 (q)->mq_last = &MBUFQ_FIRST(q); \
921 } while (0)
922
923 #define MBUFQ_FOREACH(m, q) \
924 for ((m) = MBUFQ_FIRST(q); \
925 (m); \
926 (m) = MBUFQ_NEXT(m))
927
928 #define MBUFQ_FOREACH_SAFE(m, q, tvar) \
929 for ((m) = MBUFQ_FIRST(q); \
930 (m) && ((tvar) = MBUFQ_NEXT(m), 1); \
931 (m) = (tvar))
932
933 #define MBUFQ_EMPTY(q) ((q)->mq_first == NULL)
934 #define MBUFQ_FIRST(q) ((q)->mq_first)
935 #define MBUFQ_NEXT(m) ((m)->m_nextpkt)
936 /*
937 * mq_last is initialized to point to mq_first, so check if they're
938 * equal and return NULL when the list is empty. Otherwise, we need
939 * to subtract the offset of MBUQ_NEXT (i.e. m_nextpkt field) to get
940 * to the base mbuf address to return to caller.
941 */
942 #define MBUFQ_LAST(head) \
943 (((head)->mq_last == &MBUFQ_FIRST(head)) ? NULL : \
944 ((struct mbuf *)(void *)((char *)(head)->mq_last - \
945 (size_t)(&MBUFQ_NEXT((struct mbuf *)0)))))
946
947 #define max_linkhdr P2ROUNDUP(_max_linkhdr, sizeof (u_int32_t))
948 #define max_protohdr P2ROUNDUP(_max_protohdr, sizeof (u_int32_t))
949 #endif /* XNU_KERNEL_PRIVATE */
950
951 /*
952 * Mbuf statistics (legacy).
953 */
954 struct mbstat {
955 u_int32_t m_mbufs; /* mbufs obtained from page pool */
956 u_int32_t m_clusters; /* clusters obtained from page pool */
957 u_int32_t m_spare; /* spare field */
958 u_int32_t m_clfree; /* free clusters */
959 u_int32_t m_drops; /* times failed to find space */
960 u_int32_t m_wait; /* times waited for space */
961 u_int32_t m_drain; /* times drained protocols for space */
962 u_short m_mtypes[256]; /* type specific mbuf allocations */
963 u_int32_t m_mcfail; /* times m_copym failed */
964 u_int32_t m_mpfail; /* times m_pullup failed */
965 u_int32_t m_msize; /* length of an mbuf */
966 u_int32_t m_mclbytes; /* length of an mbuf cluster */
967 u_int32_t m_minclsize; /* min length of data to allocate a cluster */
968 u_int32_t m_mlen; /* length of data in an mbuf */
969 u_int32_t m_mhlen; /* length of data in a header mbuf */
970 u_int32_t m_bigclusters; /* clusters obtained from page pool */
971 u_int32_t m_bigclfree; /* free clusters */
972 u_int32_t m_bigmclbytes; /* length of an mbuf cluster */
973 };
974
975 /* Compatibillity with 10.3 */
976 struct ombstat {
977 u_int32_t m_mbufs; /* mbufs obtained from page pool */
978 u_int32_t m_clusters; /* clusters obtained from page pool */
979 u_int32_t m_spare; /* spare field */
980 u_int32_t m_clfree; /* free clusters */
981 u_int32_t m_drops; /* times failed to find space */
982 u_int32_t m_wait; /* times waited for space */
983 u_int32_t m_drain; /* times drained protocols for space */
984 u_short m_mtypes[256]; /* type specific mbuf allocations */
985 u_int32_t m_mcfail; /* times m_copym failed */
986 u_int32_t m_mpfail; /* times m_pullup failed */
987 u_int32_t m_msize; /* length of an mbuf */
988 u_int32_t m_mclbytes; /* length of an mbuf cluster */
989 u_int32_t m_minclsize; /* min length of data to allocate a cluster */
990 u_int32_t m_mlen; /* length of data in an mbuf */
991 u_int32_t m_mhlen; /* length of data in a header mbuf */
992 };
993
994 /*
995 * mbuf class statistics.
996 */
997 #define MAX_MBUF_CNAME 15
998
999 #if defined(XNU_KERNEL_PRIVATE)
1000 /* For backwards compatibility with 32-bit userland process */
1001 struct omb_class_stat {
1002 char mbcl_cname[MAX_MBUF_CNAME + 1]; /* class name */
1003 u_int32_t mbcl_size; /* buffer size */
1004 u_int32_t mbcl_total; /* # of buffers created */
1005 u_int32_t mbcl_active; /* # of active buffers */
1006 u_int32_t mbcl_infree; /* # of available buffers */
1007 u_int32_t mbcl_slab_cnt; /* # of available slabs */
1008 u_int64_t mbcl_alloc_cnt; /* # of times alloc is called */
1009 u_int64_t mbcl_free_cnt; /* # of times free is called */
1010 u_int64_t mbcl_notified; /* # of notified wakeups */
1011 u_int64_t mbcl_purge_cnt; /* # of purges so far */
1012 u_int64_t mbcl_fail_cnt; /* # of allocation failures */
1013 u_int32_t mbcl_ctotal; /* total only for this class */
1014 u_int32_t mbcl_release_cnt; /* amount of memory returned */
1015 /*
1016 * Cache layer statistics
1017 */
1018 u_int32_t mbcl_mc_state; /* cache state (see below) */
1019 u_int32_t mbcl_mc_cached; /* # of cached buffers */
1020 u_int32_t mbcl_mc_waiter_cnt; /* # waiters on the cache */
1021 u_int32_t mbcl_mc_wretry_cnt; /* # of wait retries */
1022 u_int32_t mbcl_mc_nwretry_cnt; /* # of no-wait retry attempts */
1023 u_int64_t mbcl_reserved[4]; /* for future use */
1024 } __attribute__((__packed__));
1025 #endif /* XNU_KERNEL_PRIVATE */
1026
1027 typedef struct mb_class_stat {
1028 char mbcl_cname[MAX_MBUF_CNAME + 1]; /* class name */
1029 u_int32_t mbcl_size; /* buffer size */
1030 u_int32_t mbcl_total; /* # of buffers created */
1031 u_int32_t mbcl_active; /* # of active buffers */
1032 u_int32_t mbcl_infree; /* # of available buffers */
1033 u_int32_t mbcl_slab_cnt; /* # of available slabs */
1034 #if defined(KERNEL) || defined(__LP64__)
1035 u_int32_t mbcl_pad; /* padding */
1036 #endif /* KERNEL || __LP64__ */
1037 u_int64_t mbcl_alloc_cnt; /* # of times alloc is called */
1038 u_int64_t mbcl_free_cnt; /* # of times free is called */
1039 u_int64_t mbcl_notified; /* # of notified wakeups */
1040 u_int64_t mbcl_purge_cnt; /* # of purges so far */
1041 u_int64_t mbcl_fail_cnt; /* # of allocation failures */
1042 u_int32_t mbcl_ctotal; /* total only for this class */
1043 u_int32_t mbcl_release_cnt; /* amount of memory returned */
1044 /*
1045 * Cache layer statistics
1046 */
1047 u_int32_t mbcl_mc_state; /* cache state (see below) */
1048 u_int32_t mbcl_mc_cached; /* # of cached buffers */
1049 u_int32_t mbcl_mc_waiter_cnt; /* # waiters on the cache */
1050 u_int32_t mbcl_mc_wretry_cnt; /* # of wait retries */
1051 u_int32_t mbcl_mc_nwretry_cnt; /* # of no-wait retry attempts */
1052 u_int32_t mbcl_peak_reported; /* last usage peak reported */
1053 u_int32_t mbcl_reserved[7]; /* for future use */
1054 } mb_class_stat_t;
1055
1056 #define MCS_DISABLED 0 /* cache is permanently disabled */
1057 #define MCS_ONLINE 1 /* cache is online */
1058 #define MCS_PURGING 2 /* cache is being purged */
1059 #define MCS_OFFLINE 3 /* cache is offline (resizing) */
1060
1061 #if defined(XNU_KERNEL_PRIVATE)
1062 /* For backwards compatibility with 32-bit userland process */
1063 struct omb_stat {
1064 u_int32_t mbs_cnt; /* number of classes */
1065 struct omb_class_stat mbs_class[1]; /* class array */
1066 } __attribute__((__packed__));
1067 #endif /* XNU_KERNEL_PRIVATE */
1068
1069 typedef struct mb_stat {
1070 u_int32_t mbs_cnt; /* number of classes */
1071 #if defined(KERNEL) || defined(__LP64__)
1072 u_int32_t mbs_pad; /* padding */
1073 #endif /* KERNEL || __LP64__ */
1074 mb_class_stat_t mbs_class[1]; /* class array */
1075 } mb_stat_t;
1076
1077 #ifdef PRIVATE
1078 #define MLEAK_STACK_DEPTH 16 /* Max PC stack depth */
1079
1080 typedef struct mleak_trace_stat {
1081 u_int64_t mltr_collisions;
1082 u_int64_t mltr_hitcount;
1083 u_int64_t mltr_allocs;
1084 u_int64_t mltr_depth;
1085 u_int64_t mltr_addr[MLEAK_STACK_DEPTH];
1086 } mleak_trace_stat_t;
1087
1088 typedef struct mleak_stat {
1089 u_int32_t ml_isaddr64; /* 64-bit KVA? */
1090 u_int32_t ml_cnt; /* number of traces */
1091 mleak_trace_stat_t ml_trace[1]; /* trace array */
1092 } mleak_stat_t;
1093
1094 struct mleak_table {
1095 u_int32_t mleak_capture; /* sampling capture counter */
1096 u_int32_t mleak_sample_factor; /* sample factor */
1097
1098 /* Times two active records want to occupy the same spot */
1099 u_int64_t alloc_collisions;
1100 u_int64_t trace_collisions;
1101
1102 /* Times new record lands on spot previously occupied by freed alloc */
1103 u_int64_t alloc_overwrites;
1104 u_int64_t trace_overwrites;
1105
1106 /* Times a new alloc or trace is put into the hash table */
1107 u_int64_t alloc_recorded;
1108 u_int64_t trace_recorded;
1109
1110 /* Total number of outstanding allocs */
1111 u_int64_t outstanding_allocs;
1112
1113 /* Times mleak_log returned false because couldn't acquire the lock */
1114 u_int64_t total_conflicts;
1115 };
1116 #endif /* PRIVATE */
1117
1118 #ifdef KERNEL_PRIVATE
1119 __BEGIN_DECLS
1120
1121 /*
1122 * Exported (private)
1123 */
1124
1125 extern struct mbstat mbstat; /* statistics */
1126
1127 __END_DECLS
1128 #endif /* KERNEL_PRIVATE */
1129
1130 #ifdef XNU_KERNEL_PRIVATE
1131 __BEGIN_DECLS
1132
1133 /*
1134 * Not exported (xnu private)
1135 */
1136
1137 /* flags to m_get/MGET */
1138 /* Need to include malloc.h to get right options for malloc */
1139 #include <sys/malloc.h>
1140
1141 struct mbuf;
1142
1143 /* length to m_copy to copy all */
1144 #define M_COPYALL 1000000000
1145
1146 #define M_DONTWAIT M_NOWAIT
1147 #define M_WAIT M_WAITOK
1148
1149 /* modes for m_copym and variants */
1150 #define M_COPYM_NOOP_HDR 0 /* don't copy/move pkthdr contents */
1151 #define M_COPYM_COPY_HDR 1 /* copy pkthdr from old to new */
1152 #define M_COPYM_MOVE_HDR 2 /* move pkthdr from old to new */
1153 #define M_COPYM_MUST_COPY_HDR 3 /* MUST copy pkthdr from old to new */
1154 #define M_COPYM_MUST_MOVE_HDR 4 /* MUST move pkthdr from old to new */
1155
1156 /*
1157 * These macros are mapped to the appropriate KPIs, so that private code
1158 * can be simply recompiled in order to be forward-compatible with future
1159 * changes toward the struture sizes.
1160 */
1161 #define MLEN mbuf_get_mlen() /* normal data len */
1162 #define MHLEN mbuf_get_mhlen() /* data len w/pkthdr */
1163
1164 #define MINCLSIZE mbuf_get_minclsize() /* cluster usage threshold */
1165
1166 extern void m_freem(struct mbuf *);
1167 extern u_int64_t mcl_to_paddr(char *);
1168 extern void m_adj(struct mbuf *, int);
1169 extern void m_cat(struct mbuf *, struct mbuf *);
1170 extern void m_copydata(struct mbuf *, int, int, void *);
1171 extern struct mbuf *m_copym(struct mbuf *, int, int, int);
1172 extern struct mbuf *m_copym_mode(struct mbuf *, int, int, int, uint32_t);
1173 extern struct mbuf *m_get(int, int);
1174 extern struct mbuf *m_gethdr(int, int);
1175 extern struct mbuf *m_getpacket(void);
1176 extern struct mbuf *m_getpackets(int, int, int);
1177 extern struct mbuf *m_mclget(struct mbuf *, int);
1178 extern void *m_mtod(struct mbuf *);
1179 extern struct mbuf *m_prepend_2(struct mbuf *, int, int, int);
1180 extern struct mbuf *m_pullup(struct mbuf *, int);
1181 extern struct mbuf *m_split(struct mbuf *, int, int);
1182 extern void m_mclfree(caddr_t p);
1183
1184 /*
1185 * On platforms which require strict alignment (currently for anything but
1186 * i386 or x86_64), this macro checks whether the data pointer of an mbuf
1187 * is 32-bit aligned (this is the expected minimum alignment for protocol
1188 * headers), and assert otherwise.
1189 */
1190 #if defined(__i386__) || defined(__x86_64__)
1191 #define MBUF_STRICT_DATA_ALIGNMENT_CHECK_32(_m)
1192 #else /* !__i386__ && !__x86_64__ */
1193 #define MBUF_STRICT_DATA_ALIGNMENT_CHECK_32(_m) do { \
1194 if (!IS_P2ALIGNED((_m)->m_data, sizeof (u_int32_t))) { \
1195 if (((_m)->m_flags & M_PKTHDR) && \
1196 (_m)->m_pkthdr.rcvif != NULL) { \
1197 panic_plain("\n%s: mbuf %p data ptr %p is not " \
1198 "32-bit aligned [%s: alignerrs=%lld]\n", \
1199 __func__, (_m), (_m)->m_data, \
1200 if_name((_m)->m_pkthdr.rcvif), \
1201 (_m)->m_pkthdr.rcvif->if_alignerrs); \
1202 } else { \
1203 panic_plain("\n%s: mbuf %p data ptr %p is not " \
1204 "32-bit aligned\n", \
1205 __func__, (_m), (_m)->m_data); \
1206 } \
1207 } \
1208 } while (0)
1209 #endif /* !__i386__ && !__x86_64__ */
1210
1211 /* Maximum number of MBUF_SC values (excluding MBUF_SC_UNSPEC) */
1212 #define MBUF_SC_MAX_CLASSES 10
1213
1214 /*
1215 * These conversion macros rely on the corresponding MBUF_SC and
1216 * MBUF_TC values in order to establish the following mapping:
1217 *
1218 * MBUF_SC_BK_SYS ] ==> MBUF_TC_BK
1219 * MBUF_SC_BK ]
1220 *
1221 * MBUF_SC_BE ] ==> MBUF_TC_BE
1222 * MBUF_SC_RD ]
1223 * MBUF_SC_OAM ]
1224 *
1225 * MBUF_SC_AV ] ==> MBUF_TC_VI
1226 * MBUF_SC_RV ]
1227 * MBUF_SC_VI ]
1228 *
1229 * MBUF_SC_VO ] ==> MBUF_TC_VO
1230 * MBUF_SC_CTL ]
1231 *
1232 * The values assigned to each service class allows for a fast mapping to
1233 * the corresponding MBUF_TC traffic class values, as well as to retrieve the
1234 * assigned index; therefore care must be taken when comparing against these
1235 * values. Use the corresponding class and index macros to retrieve the
1236 * corresponding portion, and never assume that a higher class corresponds
1237 * to a higher index.
1238 */
1239 #define MBUF_SCVAL(x) ((x) & 0xffff)
1240 #define MBUF_SCIDX(x) ((((x) >> 16) & 0xff) >> 3)
1241 #define MBUF_SC2TC(_sc) (MBUF_SCVAL(_sc) >> 7)
1242 #define MBUF_TC2SCVAL(_tc) ((_tc) << 7)
1243 #define IS_MBUF_SC_BACKGROUND(_sc) (((_sc) == MBUF_SC_BK_SYS) || \
1244 ((_sc) == MBUF_SC_BK))
1245 #define IS_MBUF_SC_REALTIME(_sc) ((_sc) >= MBUF_SC_AV && (_sc) <= MBUF_SC_VO)
1246 #define IS_MBUF_SC_BESTEFFORT(_sc) ((_sc) == MBUF_SC_BE || \
1247 (_sc) == MBUF_SC_RD || (_sc) == MBUF_SC_OAM)
1248
1249 #define SCIDX_BK_SYS MBUF_SCIDX(MBUF_SC_BK_SYS)
1250 #define SCIDX_BK MBUF_SCIDX(MBUF_SC_BK)
1251 #define SCIDX_BE MBUF_SCIDX(MBUF_SC_BE)
1252 #define SCIDX_RD MBUF_SCIDX(MBUF_SC_RD)
1253 #define SCIDX_OAM MBUF_SCIDX(MBUF_SC_OAM)
1254 #define SCIDX_AV MBUF_SCIDX(MBUF_SC_AV)
1255 #define SCIDX_RV MBUF_SCIDX(MBUF_SC_RV)
1256 #define SCIDX_VI MBUF_SCIDX(MBUF_SC_VI)
1257 #define SCIDX_VO MBUF_SCIDX(MBUF_SC_VO)
1258 #define SCIDX_CTL MBUF_SCIDX(MBUF_SC_CTL)
1259
1260 #define SCVAL_BK_SYS MBUF_SCVAL(MBUF_SC_BK_SYS)
1261 #define SCVAL_BK MBUF_SCVAL(MBUF_SC_BK)
1262 #define SCVAL_BE MBUF_SCVAL(MBUF_SC_BE)
1263 #define SCVAL_RD MBUF_SCVAL(MBUF_SC_RD)
1264 #define SCVAL_OAM MBUF_SCVAL(MBUF_SC_OAM)
1265 #define SCVAL_AV MBUF_SCVAL(MBUF_SC_AV)
1266 #define SCVAL_RV MBUF_SCVAL(MBUF_SC_RV)
1267 #define SCVAL_VI MBUF_SCVAL(MBUF_SC_VI)
1268 #define SCVAL_VO MBUF_SCVAL(MBUF_SC_VO)
1269 #define SCVAL_CTL MBUF_SCVAL(MBUF_SC_CTL)
1270
1271 #define MBUF_VALID_SC(c) \
1272 (c == MBUF_SC_BK_SYS || c == MBUF_SC_BK || c == MBUF_SC_BE || \
1273 c == MBUF_SC_RD || c == MBUF_SC_OAM || c == MBUF_SC_AV || \
1274 c == MBUF_SC_RV || c == MBUF_SC_VI || c == MBUF_SC_VO || \
1275 c == MBUF_SC_CTL)
1276
1277 #define MBUF_VALID_SCIDX(c) \
1278 (c == SCIDX_BK_SYS || c == SCIDX_BK || c == SCIDX_BE || \
1279 c == SCIDX_RD || c == SCIDX_OAM || c == SCIDX_AV || \
1280 c == SCIDX_RV || c == SCIDX_VI || c == SCIDX_VO || \
1281 c == SCIDX_CTL)
1282
1283 #define MBUF_VALID_SCVAL(c) \
1284 (c == SCVAL_BK_SYS || c == SCVAL_BK || c == SCVAL_BE || \
1285 c == SCVAL_RD || c == SCVAL_OAM || c == SCVAL_AV || \
1286 c == SCVAL_RV || c == SCVAL_VI || c == SCVAL_VO || \
1287 c == SCVAL_CTL)
1288
1289 extern unsigned char *mbutl; /* start VA of mbuf pool */
1290 extern unsigned char *embutl; /* end VA of mbuf pool */
1291 extern unsigned int nmbclusters; /* number of mapped clusters */
1292 extern int njcl; /* # of jumbo clusters */
1293 extern int njclbytes; /* size of a jumbo cluster */
1294 extern int max_hdr; /* largest link+protocol header */
1295 extern int max_datalen; /* MHLEN - max_hdr */
1296
1297 /* Use max_linkhdr instead of _max_linkhdr */
1298 extern int _max_linkhdr; /* largest link-level header */
1299
1300 /* Use max_protohdr instead of _max_protohdr */
1301 extern int _max_protohdr; /* largest protocol header */
1302
1303 __private_extern__ unsigned int mbuf_default_ncl(int, u_int64_t);
1304 __private_extern__ void mbinit(void);
1305 __private_extern__ struct mbuf *m_clattach(struct mbuf *, int, caddr_t,
1306 void (*)(caddr_t, u_int, caddr_t), u_int, caddr_t, int, int);
1307 __private_extern__ caddr_t m_bigalloc(int);
1308 __private_extern__ void m_bigfree(caddr_t, u_int, caddr_t);
1309 __private_extern__ struct mbuf *m_mbigget(struct mbuf *, int);
1310 __private_extern__ caddr_t m_16kalloc(int);
1311 __private_extern__ void m_16kfree(caddr_t, u_int, caddr_t);
1312 __private_extern__ struct mbuf *m_m16kget(struct mbuf *, int);
1313 __private_extern__ int m_reinit(struct mbuf *, int);
1314 __private_extern__ struct mbuf *m_free(struct mbuf *);
1315 __private_extern__ struct mbuf *m_getclr(int, int);
1316 __private_extern__ struct mbuf *m_getptr(struct mbuf *, int, int *);
1317 __private_extern__ unsigned int m_length(struct mbuf *);
1318 __private_extern__ unsigned int m_length2(struct mbuf *, struct mbuf **);
1319 __private_extern__ unsigned int m_fixhdr(struct mbuf *);
1320 __private_extern__ struct mbuf *m_defrag(struct mbuf *, int);
1321 __private_extern__ struct mbuf *m_defrag_offset(struct mbuf *, u_int32_t, int);
1322 __private_extern__ struct mbuf *m_prepend(struct mbuf *, int, int);
1323 __private_extern__ struct mbuf *m_copyup(struct mbuf *, int, int);
1324 __private_extern__ struct mbuf *m_retry(int, int);
1325 __private_extern__ struct mbuf *m_retryhdr(int, int);
1326 __private_extern__ int m_freem_list(struct mbuf *);
1327 __private_extern__ int m_append(struct mbuf *, int, caddr_t);
1328 __private_extern__ struct mbuf *m_last(struct mbuf *);
1329 __private_extern__ struct mbuf *m_devget(char *, int, int, struct ifnet *,
1330 void (*)(const void *, void *, size_t));
1331 __private_extern__ struct mbuf *m_pulldown(struct mbuf *, int, int, int *);
1332
1333 __private_extern__ struct mbuf *m_getcl(int, int, int);
1334 __private_extern__ caddr_t m_mclalloc(int);
1335 __private_extern__ int m_mclhasreference(struct mbuf *);
1336 __private_extern__ void m_copy_pkthdr(struct mbuf *, struct mbuf *);
1337 __private_extern__ void m_copy_pftag(struct mbuf *, struct mbuf *);
1338 __private_extern__ void m_copy_classifier(struct mbuf *, struct mbuf *);
1339
1340 __private_extern__ struct mbuf *m_dtom(void *);
1341 __private_extern__ int m_mtocl(void *);
1342 __private_extern__ union mcluster *m_cltom(int);
1343
1344 __private_extern__ int m_trailingspace(struct mbuf *);
1345 __private_extern__ int m_leadingspace(struct mbuf *);
1346
1347 __private_extern__ struct mbuf *m_normalize(struct mbuf *m);
1348 __private_extern__ void m_mchtype(struct mbuf *m, int t);
1349 __private_extern__ void m_mcheck(struct mbuf *);
1350
1351 __private_extern__ void m_copyback(struct mbuf *, int, int, const void *);
1352 __private_extern__ struct mbuf *m_copyback_cow(struct mbuf *, int, int,
1353 const void *, int);
1354 __private_extern__ int m_makewritable(struct mbuf **, int, int, int);
1355 __private_extern__ struct mbuf *m_dup(struct mbuf *m, int how);
1356 __private_extern__ struct mbuf *m_copym_with_hdrs(struct mbuf *, int, int, int,
1357 struct mbuf **, int *, uint32_t);
1358 __private_extern__ struct mbuf *m_getpackethdrs(int, int);
1359 __private_extern__ struct mbuf *m_getpacket_how(int);
1360 __private_extern__ struct mbuf *m_getpackets_internal(unsigned int *, int,
1361 int, int, size_t);
1362 __private_extern__ struct mbuf *m_allocpacket_internal(unsigned int *, size_t,
1363 unsigned int *, int, int, size_t);
1364
1365 __private_extern__ int m_ext_set_prop(struct mbuf *, uint32_t, uint32_t);
1366 __private_extern__ uint32_t m_ext_get_prop(struct mbuf *);
1367 __private_extern__ int m_ext_paired_is_active(struct mbuf *);
1368 __private_extern__ void m_ext_paired_activate(struct mbuf *);
1369
1370 __private_extern__ void m_drain(void);
1371
1372 /*
1373 * Packets may have annotations attached by affixing a list of "packet
1374 * tags" to the pkthdr structure. Packet tags are dynamically allocated
1375 * semi-opaque data structures that have a fixed header (struct m_tag)
1376 * that specifies the size of the memory block and an <id,type> pair that
1377 * identifies it. The id identifies the module and the type identifies the
1378 * type of data for that module. The id of zero is reserved for the kernel.
1379 *
1380 * Note that the packet tag returned by m_tag_allocate has the default
1381 * memory alignment implemented by malloc. To reference private data one
1382 * can use a construct like:
1383 *
1384 * struct m_tag *mtag = m_tag_allocate(...);
1385 * struct foo *p = (struct foo *)(mtag+1);
1386 *
1387 * if the alignment of struct m_tag is sufficient for referencing members
1388 * of struct foo. Otherwise it is necessary to embed struct m_tag within
1389 * the private data structure to insure proper alignment; e.g.
1390 *
1391 * struct foo {
1392 * struct m_tag tag;
1393 * ...
1394 * };
1395 * struct foo *p = (struct foo *) m_tag_allocate(...);
1396 * struct m_tag *mtag = &p->tag;
1397 */
1398
1399 #define KERNEL_MODULE_TAG_ID 0
1400
1401 enum {
1402 KERNEL_TAG_TYPE_NONE = 0,
1403 KERNEL_TAG_TYPE_DUMMYNET = 1,
1404 KERNEL_TAG_TYPE_DIVERT = 2,
1405 KERNEL_TAG_TYPE_IPFORWARD = 3,
1406 KERNEL_TAG_TYPE_IPFILT = 4,
1407 KERNEL_TAG_TYPE_MACLABEL = 5,
1408 KERNEL_TAG_TYPE_MAC_POLICY_LABEL = 6,
1409 KERNEL_TAG_TYPE_ENCAP = 8,
1410 KERNEL_TAG_TYPE_INET6 = 9,
1411 KERNEL_TAG_TYPE_IPSEC = 10,
1412 KERNEL_TAG_TYPE_DRVAUX = 11,
1413 };
1414
1415 /* Packet tag routines */
1416 __private_extern__ struct m_tag *m_tag_alloc(u_int32_t, u_int16_t, int, int);
1417 __private_extern__ struct m_tag *m_tag_create(u_int32_t, u_int16_t, int, int,
1418 struct mbuf *);
1419 __private_extern__ void m_tag_free(struct m_tag *);
1420 __private_extern__ void m_tag_prepend(struct mbuf *, struct m_tag *);
1421 __private_extern__ void m_tag_unlink(struct mbuf *, struct m_tag *);
1422 __private_extern__ void m_tag_delete(struct mbuf *, struct m_tag *);
1423 __private_extern__ void m_tag_delete_chain(struct mbuf *, struct m_tag *);
1424 __private_extern__ struct m_tag *m_tag_locate(struct mbuf *, u_int32_t,
1425 u_int16_t, struct m_tag *);
1426 __private_extern__ struct m_tag *m_tag_copy(struct m_tag *, int);
1427 __private_extern__ int m_tag_copy_chain(struct mbuf *, struct mbuf *, int);
1428 __private_extern__ void m_tag_init(struct mbuf *, int);
1429 __private_extern__ struct m_tag *m_tag_first(struct mbuf *);
1430 __private_extern__ struct m_tag *m_tag_next(struct mbuf *, struct m_tag *);
1431
1432 __END_DECLS
1433 #endif /* XNU_KERNEL_PRIVATE */
1434 #ifdef KERNEL
1435 #include <sys/kpi_mbuf.h>
1436 #ifdef XNU_KERNEL_PRIVATE
1437 __BEGIN_DECLS
1438
1439 __private_extern__ void m_scratch_init(struct mbuf *);
1440 __private_extern__ u_int32_t m_scratch_get(struct mbuf *, u_int8_t **);
1441
1442 __private_extern__ void m_classifier_init(struct mbuf *, uint32_t);
1443
1444 __private_extern__ int m_set_service_class(struct mbuf *, mbuf_svc_class_t);
1445 __private_extern__ mbuf_svc_class_t m_get_service_class(struct mbuf *);
1446 __private_extern__ mbuf_svc_class_t m_service_class_from_idx(u_int32_t);
1447 __private_extern__ mbuf_svc_class_t m_service_class_from_val(u_int32_t);
1448 __private_extern__ int m_set_traffic_class(struct mbuf *, mbuf_traffic_class_t);
1449 __private_extern__ mbuf_traffic_class_t m_get_traffic_class(struct mbuf *);
1450
1451 #define ADDCARRY(_x) do { \
1452 while (((_x) >> 16) != 0) \
1453 (_x) = ((_x) >> 16) + ((_x) & 0xffff); \
1454 } while (0)
1455
1456 __private_extern__ u_int16_t m_adj_sum16(struct mbuf *, u_int32_t,
1457 u_int32_t, u_int32_t);
1458 __private_extern__ u_int16_t m_sum16(struct mbuf *, u_int32_t, u_int32_t);
1459
1460 __private_extern__ void m_set_ext(struct mbuf *, struct ext_ref *, m_ext_free_func_t, caddr_t);
1461 __private_extern__ struct ext_ref *m_get_rfa(struct mbuf *);
1462 __private_extern__ m_ext_free_func_t m_get_ext_free(struct mbuf *);
1463 __private_extern__ caddr_t m_get_ext_arg(struct mbuf *);
1464
1465 extern void m_do_tx_compl_callback(struct mbuf *, struct ifnet *);
1466
1467 __END_DECLS
1468 #endif /* XNU_KERNEL_PRIVATE */
1469 #endif /* KERNEL */
1470 #endif /* !_SYS_MBUF_H_ */