2 * Copyright (c) 1998-2010 Luigi Rizzo, Universita` di Pisa
3 * Portions Copyright (c) 2000 Akamba Corp.
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
16 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
19 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
20 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
21 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
22 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
23 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
24 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * $FreeBSD: user/luigi/ipfw3-head/sys/netinet/ip_dummynet.h 203321 2010-01-31 21:39:25Z luigi $
30 #ifndef _IP_DUMMYNET_H
31 #define _IP_DUMMYNET_H
34 * Definition of the kernel-userland API for dummynet.
36 * Setsockopt() and getsockopt() pass a batch of objects, each
37 * of them starting with a "struct dn_id" which should fully identify
38 * the object and its relation with others in the sequence.
39 * The first object in each request should have
40 * type= DN_CMD_*, id = DN_API_VERSION.
41 * For other objects, type and subtype specify the object, len indicates
42 * the total length including the header, and 'id' identifies the specific
45 * Most objects are numbered with an identifier in the range 1..65535.
46 * DN_MAX_ID indicates the first value outside the range.
49 #define DN_API_VERSION 12500000
50 #define DN_MAX_ID 0x10000
53 uint16_t len; /* total obj len including this header */
56 uint32_t id; /* generic id */
60 * These values are in the type field of struct dn_id.
61 * To preserve the ABI, never rearrange the list or delete
62 * entries with the exception of DN_LAST
73 DN_FLOW, /* struct dn_flow */
74 DN_TEXT, /* opaque text is the object */
76 DN_CMD_CONFIG = 0x80, /* objects follow */
77 DN_CMD_DELETE, /* subtype + list of entries */
78 DN_CMD_GET, /* subtype + list of entries */
80 /* for compatibility with FreeBSD 7.2/8 */
85 /* special commands for emulation of sysctl variables */
92 enum { /* subtype for schedulers, flowset and the like */
96 /* others are in individual modules */
99 enum { /* user flags */
100 DN_HAVE_MASK = 0x0001, /* fs or sched has a mask */
101 DN_NOERROR = 0x0002, /* do not report errors */
102 DN_QHT_HASH = 0x0004, /* qht is a hash table */
103 DN_QSIZE_BYTES = 0x0008, /* queue size is in bytes */
104 DN_HAS_PROFILE = 0x0010, /* a link has a profile */
106 DN_IS_GENTLE_RED= 0x0040,
107 DN_PIPE_CMD = 0x1000, /* pipe config... */
117 * Userland sets bw and delay in bits/s and milliseconds.
118 * The kernel converts this back and forth to bits/tick and ticks.
119 * XXX what about burst ?
122 int bandwidth; /* bit/s or bits/tick. */
123 int delay; /* ms and ticks */
124 uint64_t burst; /* scaled. bits*Hz XXX */
128 * A flowset, which is a template for flows. Contains parameters
129 * from the command line: id, target scheduler, queue sizes, plr,
130 * flow masks, buckets for the flow hash, and possibly scheduler-
131 * specific parameters (weight, quantum and so on).
135 uint32_t fs_nr; /* the flowset number */
136 uint32_t flags; /* userland flags */
137 int qsize; /* queue size in slots or bytes */
138 int32_t plr; /* PLR, pkt loss rate (2^31-1 means 100%) */
139 uint32_t buckets; /* buckets used for the queue hash table */
141 struct ipfw_flow_id flow_mask;
142 uint32_t sched_nr; /* the scheduler we attach to */
143 /* generic scheduler parameters. Leave them at -1 if unset.
144 * Now we use 0: weight, 1: lmax, 2: priority
148 /* RED/GRED parameters.
149 * weight and probabilities are in the range 0..1 represented
150 * in fixed point arithmetic with SCALE_RED decimal bits.
153 #define SCALE(x) ( (x) << SCALE_RED )
154 #define SCALE_VAL(x) ( (x) >> SCALE_RED )
155 #define SCALE_MUL(x,y) ( ( (x) * (y) ) >> SCALE_RED )
156 int w_q ; /* queue weight (scaled) */
157 int max_th ; /* maximum threshold for queue (scaled) */
158 int min_th ; /* minimum threshold for queue (scaled) */
159 int max_p ; /* maximum value for p_b (scaled) */
164 * dn_flow collects flow_id and stats for queues and scheduler
165 * instances, and is used to pass these info to userland.
166 * oid.type/oid.subtype describe the object, oid.id is number
167 * of the parent object.
171 struct ipfw_flow_id fid;
172 uint64_t tot_pkts; /* statistics counters */
174 uint32_t length; /* Queue lenght, in packets */
175 uint32_t len_bytes; /* Queue lenght, in bytes */
181 * Scheduler template, mostly indicating the name, number,
182 * sched_mask and buckets.
186 uint32_t sched_nr; /* N, scheduler number */
187 uint32_t buckets; /* number of buckets for the instances */
188 uint32_t flags; /* have_mask, ... */
190 char name[16]; /* null terminated */
191 /* mask to select the appropriate scheduler instance */
192 struct ipfw_flow_id sched_mask; /* M */
196 /* A delay profile is attached to a link.
197 * Note that a profile, as any other object, cannot be longer than 2^16
199 #define ED_MAX_SAMPLES_NO 1024
202 /* fields to simulate a delay profile */
203 #define ED_MAX_NAME_LEN 32
204 char name[ED_MAX_NAME_LEN];
207 int bandwidth; // XXX use link bandwidth?
208 int samples_no; /* actual len of samples[] */
209 int samples[0]; /* may be shorter */
213 * Overall structure of dummynet
215 In dummynet, packets are selected with the firewall rules, and passed
216 to two different objects: PIPE or QUEUE (bad name).
218 A QUEUE defines a classifier, which groups packets into flows
219 according to a 'mask', puts them into independent queues (one
220 per flow) with configurable size and queue management policy,
221 and passes flows to a scheduler:
223 (flow_mask|sched_mask) sched_mask
224 +---------+ weight Wx +-------------+
225 | |->-[flow]-->--| |-+
226 -->--| QUEUE x | ... | | |
227 | |->-[flow]-->--| SCHEDuler N | |
229 ... | +--[LINK N]-->--
230 +---------+ weight Wy | | +--[LINK N]-->--
231 | |->-[flow]-->--| | |
232 -->--| QUEUE y | ... | | |
233 | |->-[flow]-->--| | |
234 +---------+ +-------------+ |
237 Many QUEUE objects can connect to the same scheduler, each
238 QUEUE object can have its own set of parameters.
240 In turn, the SCHEDuler 'forks' multiple instances according
241 to a 'sched_mask', each instance manages its own set of queues
242 and transmits on a private instance of a configurable LINK.
244 A PIPE is a simplified version of the above, where there
245 is no flow_mask, and each scheduler instance handles a single queue.
247 The following data structures (visible from userland) describe
248 the objects used by dummynet:
250 + dn_link, contains the main configuration parameters related
251 to delay and bandwidth;
252 + dn_profile describes a delay profile;
253 + dn_flow describes the flow status (flow id, statistics)
255 + dn_sch describes a scheduler
256 + dn_fs describes a flowset (msk, weight, queue parameters)
261 #endif /* _IP_DUMMYNET_H */