]>
Commit | Line | Data |
---|---|---|
316670eb | 1 | /* |
39037602 | 2 | * Copyright (c) 2007-2016 Apple Inc. All rights reserved. |
316670eb A |
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 | ||
29 | /* $NetBSD: altq_classq.h,v 1.7 2006/10/12 19:59:08 peter Exp $ */ | |
30 | /* $KAME: altq_classq.h,v 1.6 2003/01/07 07:33:38 kjc Exp $ */ | |
31 | ||
32 | /* | |
33 | * Copyright (c) 1991-1997 Regents of the University of California. | |
34 | * All rights reserved. | |
35 | * | |
36 | * Redistribution and use in source and binary forms, with or without | |
37 | * modification, are permitted provided that the following conditions | |
38 | * are met: | |
39 | * 1. Redistributions of source code must retain the above copyright | |
40 | * notice, this list of conditions and the following disclaimer. | |
41 | * 2. Redistributions in binary form must reproduce the above copyright | |
42 | * notice, this list of conditions and the following disclaimer in the | |
43 | * documentation and/or other materials provided with the distribution. | |
44 | * 3. All advertising materials mentioning features or use of this software | |
45 | * must display the following acknowledgement: | |
46 | * This product includes software developed by the Network Research | |
47 | * Group at Lawrence Berkeley Laboratory. | |
48 | * 4. Neither the name of the University nor of the Laboratory may be used | |
49 | * to endorse or promote products derived from this software without | |
50 | * specific prior written permission. | |
51 | * | |
52 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | |
53 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
54 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
55 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | |
56 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
57 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
58 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
59 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
60 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
61 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
62 | * SUCH DAMAGE. | |
63 | */ | |
64 | /* | |
65 | * class queue definitions extracted from rm_class.h. | |
66 | */ | |
67 | #ifndef _NET_CLASSQ_CLASSQ_H_ | |
68 | #define _NET_CLASSQ_CLASSQ_H_ | |
69 | ||
70 | #ifdef PRIVATE | |
71 | #ifdef __cplusplus | |
72 | extern "C" { | |
73 | #endif | |
74 | ||
5ba3f43e A |
75 | /* |
76 | * Packet types | |
77 | */ | |
78 | typedef enum classq_pkt_type { | |
79 | QP_INVALID = 0, | |
80 | QP_MBUF, /* mbuf packet */ | |
81 | } classq_pkt_type_t; | |
82 | ||
316670eb A |
83 | /* |
84 | * Packet Queue types | |
85 | */ | |
86 | typedef enum classq_type { | |
87 | Q_DROPHEAD, | |
88 | Q_DROPTAIL, | |
316670eb A |
89 | Q_SFB |
90 | } classq_type_t; | |
91 | ||
92 | /* | |
93 | * Packet Queue states | |
94 | */ | |
95 | typedef enum classq_state { | |
96 | QS_RUNNING, | |
97 | QS_SUSPENDED | |
98 | } classq_state_t; | |
99 | ||
100 | #define DEFAULT_QLIMIT 128 /* default */ | |
101 | ||
39037602 A |
102 | #define CLASSQ_DEQUEUE_MAX_PKT_LIMIT 2048 |
103 | #define CLASSQ_DEQUEUE_MAX_BYTE_LIMIT (1024 * 1024) | |
104 | ||
316670eb A |
105 | /* |
106 | * generic packet counter | |
107 | */ | |
108 | struct pktcntr { | |
109 | u_int64_t packets; | |
110 | u_int64_t bytes; | |
111 | }; | |
112 | ||
113 | #ifdef BSD_KERNEL_PRIVATE | |
114 | #include <sys/mcache.h> | |
115 | #include <sys/mbuf.h> | |
116 | #include <sys/sysctl.h> | |
117 | ||
118 | /* | |
119 | * Packet Queue structures and macros to manipulate them. | |
120 | */ | |
121 | typedef struct _class_queue_ { | |
5ba3f43e A |
122 | union { |
123 | MBUFQ_HEAD(mq_head) __mbufq; /* mbuf packet queue */ | |
124 | } __pktq_u; | |
316670eb | 125 | u_int32_t qlen; /* Queue length (in number of packets) */ |
316670eb | 126 | u_int32_t qlim; /* Queue limit (in number of packets*) */ |
fe8ab488 | 127 | u_int64_t qsize; /* Approx. queue size (in number of bytes) */ |
316670eb A |
128 | classq_type_t qtype; /* Queue type */ |
129 | classq_state_t qstate; /* Queue state */ | |
5ba3f43e | 130 | classq_pkt_type_t qptype; /* Packet type */ |
316670eb A |
131 | } class_queue_t; |
132 | ||
5ba3f43e A |
133 | #define qmbufq(q) (q)->__pktq_u.__mbufq /* Get mbuf packet queue */ |
134 | #define qptype(q) (q)->qptype /* Get queue packet type */ | |
316670eb A |
135 | #define qtype(q) (q)->qtype /* Get queue type */ |
136 | #define qstate(q) (q)->qstate /* Get queue state */ | |
137 | #define qlimit(q) (q)->qlim /* Max packets to be queued */ | |
138 | #define qlen(q) (q)->qlen /* Current queue length. */ | |
139 | #define qsize(q) (q)->qsize /* Approx. bytes in queue */ | |
5ba3f43e A |
140 | |
141 | #define qhead(q) MBUFQ_FIRST(&qmbufq(q)) | |
316670eb A |
142 | |
143 | #define qempty(q) (qlen(q) == 0) /* Is the queue empty?? */ | |
144 | #define q_is_red(q) (qtype(q) == Q_RED) /* Is the queue a RED queue */ | |
145 | #define q_is_rio(q) (qtype(q) == Q_RIO) /* Is the queue a RIO queue */ | |
146 | #define q_is_blue(q) (qtype(q) == Q_BLUE) /* Is the queue a BLUE queue */ | |
147 | #define q_is_sfb(q) (qtype(q) == Q_SFB) /* Is the queue a SFB queue */ | |
148 | #define q_is_red_or_rio(q) (qtype(q) == Q_RED || qtype(q) == Q_RIO) | |
149 | #define q_is_suspended(q) (qstate(q) == QS_SUSPENDED) | |
150 | ||
151 | #define PKTCNTR_ADD(_cntr, _pkt, _len) do { \ | |
152 | (_cntr)->packets += (_pkt); \ | |
153 | (_cntr)->bytes += (_len); \ | |
154 | } while (0) | |
155 | ||
156 | #define PKTCNTR_CLEAR(_cntr) do { \ | |
157 | (_cntr)->packets = 0; \ | |
158 | (_cntr)->bytes = 0; \ | |
159 | } while (0) | |
160 | ||
161 | /* flags for mark_ecn() */ | |
162 | #define CLASSQF_ECN4 0x01 /* use packet marking for IPv4 packets */ | |
163 | #define CLASSQF_ECN6 0x02 /* use packet marking for IPv6 packets */ | |
164 | #define CLASSQF_ECN (CLASSQF_ECN4 | CLASSQF_ECN6) | |
165 | ||
166 | extern u_int32_t classq_verbose; | |
167 | ||
168 | SYSCTL_DECL(_net_classq); | |
169 | ||
5ba3f43e A |
170 | extern void _qinit(class_queue_t *, int, int, classq_pkt_type_t); |
171 | extern void _addq(class_queue_t *, void *); | |
172 | extern void _addq_multi(class_queue_t *, void *, void *, u_int32_t, u_int32_t); | |
173 | extern void *_getq(class_queue_t *); | |
174 | extern void *_getq_all(class_queue_t *, void **, u_int32_t *, u_int64_t *); | |
175 | extern void *_getq_tail(class_queue_t *); | |
176 | extern void *_getq_random(class_queue_t *); | |
177 | extern void *_getq_flow(class_queue_t *, u_int32_t); | |
178 | extern void *_getq_scidx_lt(class_queue_t *, u_int32_t); | |
179 | extern void _removeq(class_queue_t *, void *); | |
316670eb A |
180 | extern void _flushq(class_queue_t *); |
181 | extern void _flushq_flow(class_queue_t *, u_int32_t, u_int32_t *, u_int32_t *); | |
182 | ||
183 | extern void classq_init(void); | |
184 | ||
39236c6e | 185 | #if PF_ECN |
316670eb A |
186 | extern u_int8_t read_dsfield(struct mbuf *, struct pf_mtag *); |
187 | extern void write_dsfield(struct mbuf *, struct pf_mtag *, u_int8_t); | |
188 | extern int mark_ecn(struct mbuf *, struct pf_mtag *, int); | |
39236c6e | 189 | #endif /* PF_ECN */ |
316670eb A |
190 | #endif /* BSD_KERNEL_PRIVATE */ |
191 | ||
192 | #ifdef __cplusplus | |
193 | } | |
194 | #endif | |
195 | #endif /* PRIVATE */ | |
196 | #endif /* _NET_CLASSQ_CLASSQ_H_ */ |