ip_dn_glue.c revision 221521
1213267Sluigi/*- 2204591Sluigi * Copyright (c) 2010 Riccardo Panicucci, Universita` di Pisa 3204591Sluigi * All rights reserved 4204591Sluigi * 5204591Sluigi * Redistribution and use in source and binary forms, with or without 6204591Sluigi * modification, are permitted provided that the following conditions 7204591Sluigi * are met: 8204591Sluigi * 1. Redistributions of source code must retain the above copyright 9204591Sluigi * notice, this list of conditions and the following disclaimer. 10204591Sluigi * 2. Redistributions in binary form must reproduce the above copyright 11204591Sluigi * notice, this list of conditions and the following disclaimer in the 12204591Sluigi * documentation and/or other materials provided with the distribution. 13204591Sluigi * 14204591Sluigi * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 15204591Sluigi * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 16204591Sluigi * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 17204591Sluigi * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 18204591Sluigi * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 19204591Sluigi * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 20204591Sluigi * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 21204591Sluigi * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 22204591Sluigi * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 23204591Sluigi * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 24204591Sluigi * SUCH DAMAGE. 25204591Sluigi */ 26204591Sluigi 27204591Sluigi/* 28204591Sluigi * $FreeBSD: head/sys/netinet/ipfw/ip_dn_glue.c 221521 2011-05-06 07:13:34Z ae $ 29204591Sluigi * 30204591Sluigi * Binary compatibility support for /sbin/ipfw RELENG_7 and RELENG_8 31204591Sluigi */ 32204591Sluigi 33204591Sluigi#include "opt_inet6.h" 34204591Sluigi 35204591Sluigi#include <sys/param.h> 36204591Sluigi#include <sys/systm.h> 37204591Sluigi#include <sys/malloc.h> 38204591Sluigi#include <sys/mbuf.h> 39204591Sluigi#include <sys/kernel.h> 40204591Sluigi#include <sys/lock.h> 41204591Sluigi#include <sys/module.h> 42204591Sluigi#include <sys/priv.h> 43204591Sluigi#include <sys/proc.h> 44204591Sluigi#include <sys/rwlock.h> 45204591Sluigi#include <sys/socket.h> 46204591Sluigi#include <sys/socketvar.h> 47204591Sluigi#include <sys/time.h> 48204591Sluigi#include <sys/taskqueue.h> 49204591Sluigi#include <net/if.h> /* IFNAMSIZ, struct ifaddr, ifq head, lock.h mutex.h */ 50204591Sluigi#include <netinet/in.h> 51204591Sluigi#include <netinet/ip_var.h> /* ip_output(), IP_FORWARDING */ 52204591Sluigi#include <netinet/ip_fw.h> 53204591Sluigi#include <netinet/ipfw/ip_fw_private.h> 54204591Sluigi#include <netinet/ipfw/dn_heap.h> 55204591Sluigi#include <netinet/ip_dummynet.h> 56204591Sluigi#include <netinet/ipfw/ip_dn_private.h> 57204591Sluigi#include <netinet/ipfw/dn_sched.h> 58204591Sluigi 59204591Sluigi/* FREEBSD7.2 ip_dummynet.h r191715*/ 60204591Sluigi 61204591Sluigistruct dn_heap_entry7 { 62204591Sluigi int64_t key; /* sorting key. Topmost element is smallest one */ 63204591Sluigi void *object; /* object pointer */ 64204591Sluigi}; 65204591Sluigi 66204591Sluigistruct dn_heap7 { 67204591Sluigi int size; 68204591Sluigi int elements; 69204591Sluigi int offset; /* XXX if > 0 this is the offset of direct ptr to obj */ 70204591Sluigi struct dn_heap_entry7 *p; /* really an array of "size" entries */ 71204591Sluigi}; 72204591Sluigi 73204591Sluigi/* Common to 7.2 and 8 */ 74204591Sluigistruct dn_flow_set { 75204591Sluigi SLIST_ENTRY(dn_flow_set) next; /* linked list in a hash slot */ 76204591Sluigi 77204591Sluigi u_short fs_nr ; /* flow_set number */ 78204591Sluigi u_short flags_fs; 79204591Sluigi#define DNOLD_HAVE_FLOW_MASK 0x0001 80204591Sluigi#define DNOLD_IS_RED 0x0002 81204591Sluigi#define DNOLD_IS_GENTLE_RED 0x0004 82204591Sluigi#define DNOLD_QSIZE_IS_BYTES 0x0008 /* queue size is measured in bytes */ 83204591Sluigi#define DNOLD_NOERROR 0x0010 /* do not report ENOBUFS on drops */ 84204591Sluigi#define DNOLD_HAS_PROFILE 0x0020 /* the pipe has a delay profile. */ 85204591Sluigi#define DNOLD_IS_PIPE 0x4000 86204591Sluigi#define DNOLD_IS_QUEUE 0x8000 87204591Sluigi 88204591Sluigi struct dn_pipe7 *pipe ; /* pointer to parent pipe */ 89204591Sluigi u_short parent_nr ; /* parent pipe#, 0 if local to a pipe */ 90204591Sluigi 91204591Sluigi int weight ; /* WFQ queue weight */ 92204591Sluigi int qsize ; /* queue size in slots or bytes */ 93204591Sluigi int plr ; /* pkt loss rate (2^31-1 means 100%) */ 94204591Sluigi 95204591Sluigi struct ipfw_flow_id flow_mask ; 96204591Sluigi 97204591Sluigi /* hash table of queues onto this flow_set */ 98204591Sluigi int rq_size ; /* number of slots */ 99204591Sluigi int rq_elements ; /* active elements */ 100204591Sluigi struct dn_flow_queue7 **rq; /* array of rq_size entries */ 101204591Sluigi 102204591Sluigi u_int32_t last_expired ; /* do not expire too frequently */ 103204591Sluigi int backlogged ; /* #active queues for this flowset */ 104204591Sluigi 105204591Sluigi /* RED parameters */ 106204591Sluigi#define SCALE_RED 16 107204591Sluigi#define SCALE(x) ( (x) << SCALE_RED ) 108204591Sluigi#define SCALE_VAL(x) ( (x) >> SCALE_RED ) 109204591Sluigi#define SCALE_MUL(x,y) ( ( (x) * (y) ) >> SCALE_RED ) 110204591Sluigi int w_q ; /* queue weight (scaled) */ 111204591Sluigi int max_th ; /* maximum threshold for queue (scaled) */ 112204591Sluigi int min_th ; /* minimum threshold for queue (scaled) */ 113204591Sluigi int max_p ; /* maximum value for p_b (scaled) */ 114204591Sluigi u_int c_1 ; /* max_p/(max_th-min_th) (scaled) */ 115204591Sluigi u_int c_2 ; /* max_p*min_th/(max_th-min_th) (scaled) */ 116204591Sluigi u_int c_3 ; /* for GRED, (1-max_p)/max_th (scaled) */ 117204591Sluigi u_int c_4 ; /* for GRED, 1 - 2*max_p (scaled) */ 118204591Sluigi u_int * w_q_lookup ; /* lookup table for computing (1-w_q)^t */ 119204591Sluigi u_int lookup_depth ; /* depth of lookup table */ 120204591Sluigi int lookup_step ; /* granularity inside the lookup table */ 121204591Sluigi int lookup_weight ; /* equal to (1-w_q)^t / (1-w_q)^(t+1) */ 122204591Sluigi int avg_pkt_size ; /* medium packet size */ 123204591Sluigi int max_pkt_size ; /* max packet size */ 124204591Sluigi}; 125204591SluigiSLIST_HEAD(dn_flow_set_head, dn_flow_set); 126204591Sluigi 127204591Sluigi#define DN_IS_PIPE 0x4000 128204591Sluigi#define DN_IS_QUEUE 0x8000 129204591Sluigistruct dn_flow_queue7 { 130204591Sluigi struct dn_flow_queue7 *next ; 131204591Sluigi struct ipfw_flow_id id ; 132204591Sluigi 133204591Sluigi struct mbuf *head, *tail ; /* queue of packets */ 134204591Sluigi u_int len ; 135204591Sluigi u_int len_bytes ; 136204591Sluigi 137204591Sluigi u_long numbytes; 138204591Sluigi 139204591Sluigi u_int64_t tot_pkts ; /* statistics counters */ 140204591Sluigi u_int64_t tot_bytes ; 141204591Sluigi u_int32_t drops ; 142204591Sluigi 143204591Sluigi int hash_slot ; /* debugging/diagnostic */ 144204591Sluigi 145204591Sluigi /* RED parameters */ 146204591Sluigi int avg ; /* average queue length est. (scaled) */ 147204591Sluigi int count ; /* arrivals since last RED drop */ 148204591Sluigi int random ; /* random value (scaled) */ 149204591Sluigi u_int32_t q_time; /* start of queue idle time */ 150204591Sluigi 151204591Sluigi /* WF2Q+ support */ 152204591Sluigi struct dn_flow_set *fs ; /* parent flow set */ 153204591Sluigi int heap_pos ; /* position (index) of struct in heap */ 154204591Sluigi int64_t sched_time ; /* current time when queue enters ready_heap */ 155204591Sluigi 156204591Sluigi int64_t S,F ; /* start time, finish time */ 157204591Sluigi}; 158204591Sluigi 159204591Sluigistruct dn_pipe7 { /* a pipe */ 160204591Sluigi SLIST_ENTRY(dn_pipe7) next; /* linked list in a hash slot */ 161204591Sluigi 162204591Sluigi int pipe_nr ; /* number */ 163204591Sluigi int bandwidth; /* really, bytes/tick. */ 164204591Sluigi int delay ; /* really, ticks */ 165204591Sluigi 166204591Sluigi struct mbuf *head, *tail ; /* packets in delay line */ 167204591Sluigi 168204591Sluigi /* WF2Q+ */ 169204591Sluigi struct dn_heap7 scheduler_heap ; /* top extract - key Finish time*/ 170204591Sluigi struct dn_heap7 not_eligible_heap; /* top extract- key Start time */ 171204591Sluigi struct dn_heap7 idle_heap ; /* random extract - key Start=Finish time */ 172204591Sluigi 173204591Sluigi int64_t V ; /* virtual time */ 174204591Sluigi int sum; /* sum of weights of all active sessions */ 175204591Sluigi 176204591Sluigi int numbytes; 177204591Sluigi 178204591Sluigi int64_t sched_time ; /* time pipe was scheduled in ready_heap */ 179204591Sluigi 180204591Sluigi /* 181204591Sluigi * When the tx clock come from an interface (if_name[0] != '\0'), its name 182204591Sluigi * is stored below, whereas the ifp is filled when the rule is configured. 183204591Sluigi */ 184204591Sluigi char if_name[IFNAMSIZ]; 185204591Sluigi struct ifnet *ifp ; 186204591Sluigi int ready ; /* set if ifp != NULL and we got a signal from it */ 187204591Sluigi 188204591Sluigi struct dn_flow_set fs ; /* used with fixed-rate flows */ 189204591Sluigi}; 190204591SluigiSLIST_HEAD(dn_pipe_head7, dn_pipe7); 191204591Sluigi 192204591Sluigi 193204591Sluigi/* FREEBSD8 ip_dummynet.h r196045 */ 194204591Sluigistruct dn_flow_queue8 { 195204591Sluigi struct dn_flow_queue8 *next ; 196204591Sluigi struct ipfw_flow_id id ; 197204591Sluigi 198204591Sluigi struct mbuf *head, *tail ; /* queue of packets */ 199204591Sluigi u_int len ; 200204591Sluigi u_int len_bytes ; 201204591Sluigi 202204591Sluigi uint64_t numbytes ; /* credit for transmission (dynamic queues) */ 203204591Sluigi int64_t extra_bits; /* extra bits simulating unavailable channel */ 204204591Sluigi 205204591Sluigi u_int64_t tot_pkts ; /* statistics counters */ 206204591Sluigi u_int64_t tot_bytes ; 207204591Sluigi u_int32_t drops ; 208204591Sluigi 209204591Sluigi int hash_slot ; /* debugging/diagnostic */ 210204591Sluigi 211204591Sluigi /* RED parameters */ 212204591Sluigi int avg ; /* average queue length est. (scaled) */ 213204591Sluigi int count ; /* arrivals since last RED drop */ 214204591Sluigi int random ; /* random value (scaled) */ 215204591Sluigi int64_t idle_time; /* start of queue idle time */ 216204591Sluigi 217204591Sluigi /* WF2Q+ support */ 218204591Sluigi struct dn_flow_set *fs ; /* parent flow set */ 219204591Sluigi int heap_pos ; /* position (index) of struct in heap */ 220204591Sluigi int64_t sched_time ; /* current time when queue enters ready_heap */ 221204591Sluigi 222204591Sluigi int64_t S,F ; /* start time, finish time */ 223204591Sluigi}; 224204591Sluigi 225204591Sluigistruct dn_pipe8 { /* a pipe */ 226204591Sluigi SLIST_ENTRY(dn_pipe8) next; /* linked list in a hash slot */ 227204591Sluigi 228204591Sluigi int pipe_nr ; /* number */ 229204591Sluigi int bandwidth; /* really, bytes/tick. */ 230204591Sluigi int delay ; /* really, ticks */ 231204591Sluigi 232204591Sluigi struct mbuf *head, *tail ; /* packets in delay line */ 233204591Sluigi 234204591Sluigi /* WF2Q+ */ 235204591Sluigi struct dn_heap7 scheduler_heap ; /* top extract - key Finish time*/ 236204591Sluigi struct dn_heap7 not_eligible_heap; /* top extract- key Start time */ 237204591Sluigi struct dn_heap7 idle_heap ; /* random extract - key Start=Finish time */ 238204591Sluigi 239204591Sluigi int64_t V ; /* virtual time */ 240204591Sluigi int sum; /* sum of weights of all active sessions */ 241204591Sluigi 242204591Sluigi /* Same as in dn_flow_queue, numbytes can become large */ 243204591Sluigi int64_t numbytes; /* bits I can transmit (more or less). */ 244204591Sluigi uint64_t burst; /* burst size, scaled: bits * hz */ 245204591Sluigi 246204591Sluigi int64_t sched_time ; /* time pipe was scheduled in ready_heap */ 247204591Sluigi int64_t idle_time; /* start of pipe idle time */ 248204591Sluigi 249204591Sluigi char if_name[IFNAMSIZ]; 250204591Sluigi struct ifnet *ifp ; 251204591Sluigi int ready ; /* set if ifp != NULL and we got a signal from it */ 252204591Sluigi 253204591Sluigi struct dn_flow_set fs ; /* used with fixed-rate flows */ 254204591Sluigi 255204591Sluigi /* fields to simulate a delay profile */ 256204591Sluigi#define ED_MAX_NAME_LEN 32 257204591Sluigi char name[ED_MAX_NAME_LEN]; 258204591Sluigi int loss_level; 259204591Sluigi int samples_no; 260204591Sluigi int *samples; 261204591Sluigi}; 262204591Sluigi 263204591Sluigi#define ED_MAX_SAMPLES_NO 1024 264204591Sluigistruct dn_pipe_max8 { 265204591Sluigi struct dn_pipe8 pipe; 266204591Sluigi int samples[ED_MAX_SAMPLES_NO]; 267204591Sluigi}; 268204591SluigiSLIST_HEAD(dn_pipe_head8, dn_pipe8); 269204591Sluigi 270204591Sluigi/* 271204591Sluigi * Changes from 7.2 to 8: 272204591Sluigi * dn_pipe: 273204591Sluigi * numbytes from int to int64_t 274204591Sluigi * add burst (int64_t) 275204591Sluigi * add idle_time (int64_t) 276204591Sluigi * add profile 277204591Sluigi * add struct dn_pipe_max 278204591Sluigi * add flag DN_HAS_PROFILE 279204591Sluigi * 280204591Sluigi * dn_flow_queue 281204591Sluigi * numbytes from u_long to int64_t 282204591Sluigi * add extra_bits (int64_t) 283204591Sluigi * q_time from u_int32_t to int64_t and name idle_time 284204591Sluigi * 285204591Sluigi * dn_flow_set unchanged 286204591Sluigi * 287204591Sluigi */ 288204591Sluigi 289204591Sluigi/* NOTE:XXX copied from dummynet.c */ 290204591Sluigi#define O_NEXT(p, len) ((void *)((char *)p + len)) 291204591Sluigistatic void 292204591Sluigioid_fill(struct dn_id *oid, int len, int type, uintptr_t id) 293204591Sluigi{ 294204591Sluigi oid->len = len; 295204591Sluigi oid->type = type; 296204591Sluigi oid->subtype = 0; 297204591Sluigi oid->id = id; 298204591Sluigi} 299204591Sluigi/* make room in the buffer and move the pointer forward */ 300204591Sluigistatic void * 301204591Sluigio_next(struct dn_id **o, int len, int type) 302204591Sluigi{ 303204591Sluigi struct dn_id *ret = *o; 304204591Sluigi oid_fill(ret, len, type, 0); 305204591Sluigi *o = O_NEXT(*o, len); 306204591Sluigi return ret; 307204591Sluigi} 308204591Sluigi 309204591Sluigi 310204591Sluigistatic size_t pipesize7 = sizeof(struct dn_pipe7); 311204591Sluigistatic size_t pipesize8 = sizeof(struct dn_pipe8); 312204591Sluigistatic size_t pipesizemax8 = sizeof(struct dn_pipe_max8); 313204591Sluigi 314204591Sluigi/* Indicate 'ipfw' version 315204591Sluigi * 1: from FreeBSD 7.2 316204591Sluigi * 0: from FreeBSD 8 317204591Sluigi * -1: unknow (for now is unused) 318204591Sluigi * 319204591Sluigi * It is update when a IP_DUMMYNET_DEL or IP_DUMMYNET_CONFIGURE request arrives 320204591Sluigi * NOTE: if a IP_DUMMYNET_GET arrives and the 'ipfw' version is unknow, 321204591Sluigi * it is suppose to be the FreeBSD 8 version. 322204591Sluigi */ 323204591Sluigistatic int is7 = 0; 324204591Sluigi 325204591Sluigistatic int 326204591Sluigiconvertflags2new(int src) 327204591Sluigi{ 328204591Sluigi int dst = 0; 329204591Sluigi 330204591Sluigi if (src & DNOLD_HAVE_FLOW_MASK) 331204591Sluigi dst |= DN_HAVE_MASK; 332204591Sluigi if (src & DNOLD_QSIZE_IS_BYTES) 333204591Sluigi dst |= DN_QSIZE_BYTES; 334204591Sluigi if (src & DNOLD_NOERROR) 335204591Sluigi dst |= DN_NOERROR; 336204591Sluigi if (src & DNOLD_IS_RED) 337204591Sluigi dst |= DN_IS_RED; 338204591Sluigi if (src & DNOLD_IS_GENTLE_RED) 339204591Sluigi dst |= DN_IS_GENTLE_RED; 340204591Sluigi if (src & DNOLD_HAS_PROFILE) 341204591Sluigi dst |= DN_HAS_PROFILE; 342204591Sluigi 343204591Sluigi return dst; 344204591Sluigi} 345204591Sluigi 346204591Sluigistatic int 347204591Sluigiconvertflags2old(int src) 348204591Sluigi{ 349204591Sluigi int dst = 0; 350204591Sluigi 351204591Sluigi if (src & DN_HAVE_MASK) 352204591Sluigi dst |= DNOLD_HAVE_FLOW_MASK; 353204591Sluigi if (src & DN_IS_RED) 354204591Sluigi dst |= DNOLD_IS_RED; 355204591Sluigi if (src & DN_IS_GENTLE_RED) 356204591Sluigi dst |= DNOLD_IS_GENTLE_RED; 357204591Sluigi if (src & DN_NOERROR) 358204591Sluigi dst |= DNOLD_NOERROR; 359204591Sluigi if (src & DN_HAS_PROFILE) 360204591Sluigi dst |= DNOLD_HAS_PROFILE; 361204591Sluigi if (src & DN_QSIZE_BYTES) 362204591Sluigi dst |= DNOLD_QSIZE_IS_BYTES; 363204591Sluigi 364204591Sluigi return dst; 365204591Sluigi} 366204591Sluigi 367204591Sluigistatic int 368204591Sluigidn_compat_del(void *v) 369204591Sluigi{ 370204591Sluigi struct dn_pipe7 *p = (struct dn_pipe7 *) v; 371204591Sluigi struct dn_pipe8 *p8 = (struct dn_pipe8 *) v; 372204591Sluigi struct { 373204591Sluigi struct dn_id oid; 374204591Sluigi uintptr_t a[1]; /* add more if we want a list */ 375204591Sluigi } cmd; 376204591Sluigi 377204591Sluigi /* XXX DN_API_VERSION ??? */ 378204591Sluigi oid_fill((void *)&cmd, sizeof(cmd), DN_CMD_DELETE, DN_API_VERSION); 379204591Sluigi 380204591Sluigi if (is7) { 381204591Sluigi if (p->pipe_nr == 0 && p->fs.fs_nr == 0) 382204591Sluigi return EINVAL; 383204591Sluigi if (p->pipe_nr != 0 && p->fs.fs_nr != 0) 384204591Sluigi return EINVAL; 385204591Sluigi } else { 386204591Sluigi if (p8->pipe_nr == 0 && p8->fs.fs_nr == 0) 387204591Sluigi return EINVAL; 388204591Sluigi if (p8->pipe_nr != 0 && p8->fs.fs_nr != 0) 389204591Sluigi return EINVAL; 390204591Sluigi } 391204591Sluigi 392204591Sluigi if (p->pipe_nr != 0) { /* pipe x delete */ 393204591Sluigi cmd.a[0] = p->pipe_nr; 394204591Sluigi cmd.oid.subtype = DN_LINK; 395204591Sluigi } else { /* queue x delete */ 396204591Sluigi cmd.oid.subtype = DN_FS; 397204591Sluigi cmd.a[0] = (is7) ? p->fs.fs_nr : p8->fs.fs_nr; 398204591Sluigi } 399204591Sluigi 400204591Sluigi return do_config(&cmd, cmd.oid.len); 401204591Sluigi} 402204591Sluigi 403204591Sluigistatic int 404204591Sluigidn_compat_config_queue(struct dn_fs *fs, void* v) 405204591Sluigi{ 406204591Sluigi struct dn_pipe7 *p7 = (struct dn_pipe7 *)v; 407204591Sluigi struct dn_pipe8 *p8 = (struct dn_pipe8 *)v; 408204591Sluigi struct dn_flow_set *f; 409204591Sluigi 410204591Sluigi if (is7) 411204591Sluigi f = &p7->fs; 412204591Sluigi else 413204591Sluigi f = &p8->fs; 414204591Sluigi 415204591Sluigi fs->fs_nr = f->fs_nr; 416204591Sluigi fs->sched_nr = f->parent_nr; 417204591Sluigi fs->flow_mask = f->flow_mask; 418204591Sluigi fs->buckets = f->rq_size; 419204591Sluigi fs->qsize = f->qsize; 420204591Sluigi fs->plr = f->plr; 421204591Sluigi fs->par[0] = f->weight; 422204591Sluigi fs->flags = convertflags2new(f->flags_fs); 423204591Sluigi if (fs->flags & DN_IS_GENTLE_RED || fs->flags & DN_IS_RED) { 424204591Sluigi fs->w_q = f->w_q; 425204591Sluigi fs->max_th = f->max_th; 426204591Sluigi fs->min_th = f->min_th; 427204591Sluigi fs->max_p = f->max_p; 428204591Sluigi } 429204591Sluigi 430204591Sluigi return 0; 431204591Sluigi} 432204591Sluigi 433204591Sluigistatic int 434204591Sluigidn_compat_config_pipe(struct dn_sch *sch, struct dn_link *p, 435204591Sluigi struct dn_fs *fs, void* v) 436204591Sluigi{ 437204591Sluigi struct dn_pipe7 *p7 = (struct dn_pipe7 *)v; 438204591Sluigi struct dn_pipe8 *p8 = (struct dn_pipe8 *)v; 439204591Sluigi int i = p7->pipe_nr; 440204591Sluigi 441204591Sluigi sch->sched_nr = i; 442204591Sluigi sch->oid.subtype = 0; 443204591Sluigi p->link_nr = i; 444204591Sluigi fs->fs_nr = i + 2*DN_MAX_ID; 445204591Sluigi fs->sched_nr = i + DN_MAX_ID; 446204591Sluigi 447204591Sluigi /* Common to 7 and 8 */ 448204591Sluigi p->bandwidth = p7->bandwidth; 449204591Sluigi p->delay = p7->delay; 450204591Sluigi if (!is7) { 451204591Sluigi /* FreeBSD 8 has burst */ 452204591Sluigi p->burst = p8->burst; 453204591Sluigi } 454204591Sluigi 455204591Sluigi /* fill the fifo flowset */ 456204591Sluigi dn_compat_config_queue(fs, v); 457204591Sluigi fs->fs_nr = i + 2*DN_MAX_ID; 458204591Sluigi fs->sched_nr = i + DN_MAX_ID; 459204591Sluigi 460204591Sluigi /* Move scheduler related parameter from fs to sch */ 461204591Sluigi sch->buckets = fs->buckets; /*XXX*/ 462204591Sluigi fs->buckets = 0; 463204591Sluigi if (fs->flags & DN_HAVE_MASK) { 464204591Sluigi sch->flags |= DN_HAVE_MASK; 465204591Sluigi fs->flags &= ~DN_HAVE_MASK; 466204591Sluigi sch->sched_mask = fs->flow_mask; 467204591Sluigi bzero(&fs->flow_mask, sizeof(struct ipfw_flow_id)); 468204591Sluigi } 469204591Sluigi 470204591Sluigi return 0; 471204591Sluigi} 472204591Sluigi 473204591Sluigistatic int 474204591Sluigidn_compat_config_profile(struct dn_profile *pf, struct dn_link *p, 475204591Sluigi void *v) 476204591Sluigi{ 477204591Sluigi struct dn_pipe8 *p8 = (struct dn_pipe8 *)v; 478204591Sluigi 479204591Sluigi p8->samples = &(((struct dn_pipe_max8 *)p8)->samples[0]); 480204591Sluigi 481204591Sluigi pf->link_nr = p->link_nr; 482204591Sluigi pf->loss_level = p8->loss_level; 483204591Sluigi// pf->bandwidth = p->bandwidth; //XXX bandwidth redundant? 484204591Sluigi pf->samples_no = p8->samples_no; 485204591Sluigi strncpy(pf->name, p8->name,sizeof(pf->name)); 486204591Sluigi bcopy(p8->samples, pf->samples, sizeof(pf->samples)); 487204591Sluigi 488204591Sluigi return 0; 489204591Sluigi} 490204591Sluigi 491204591Sluigi/* 492204591Sluigi * If p->pipe_nr != 0 the command is 'pipe x config', so need to create 493204591Sluigi * the three main struct, else only a flowset is created 494204591Sluigi */ 495204591Sluigistatic int 496204591Sluigidn_compat_configure(void *v) 497204591Sluigi{ 498204954Sluigi struct dn_id *buf = NULL, *base; 499204591Sluigi struct dn_sch *sch = NULL; 500204591Sluigi struct dn_link *p = NULL; 501204591Sluigi struct dn_fs *fs = NULL; 502204591Sluigi struct dn_profile *pf = NULL; 503204591Sluigi int lmax; 504204591Sluigi int error; 505204591Sluigi 506204591Sluigi struct dn_pipe7 *p7 = (struct dn_pipe7 *)v; 507204591Sluigi struct dn_pipe8 *p8 = (struct dn_pipe8 *)v; 508204591Sluigi 509204591Sluigi int i; /* number of object to configure */ 510204591Sluigi 511204591Sluigi lmax = sizeof(struct dn_id); /* command header */ 512204591Sluigi lmax += sizeof(struct dn_sch) + sizeof(struct dn_link) + 513204591Sluigi sizeof(struct dn_fs) + sizeof(struct dn_profile); 514204591Sluigi 515204591Sluigi base = buf = malloc(lmax, M_DUMMYNET, M_WAIT|M_ZERO); 516204591Sluigi o_next(&buf, sizeof(struct dn_id), DN_CMD_CONFIG); 517204591Sluigi base->id = DN_API_VERSION; 518204591Sluigi 519204591Sluigi /* pipe_nr is the same in p7 and p8 */ 520204591Sluigi i = p7->pipe_nr; 521204591Sluigi if (i != 0) { /* pipe config */ 522204591Sluigi sch = o_next(&buf, sizeof(*sch), DN_SCH); 523204591Sluigi p = o_next(&buf, sizeof(*p), DN_LINK); 524204591Sluigi fs = o_next(&buf, sizeof(*fs), DN_FS); 525204591Sluigi 526204591Sluigi error = dn_compat_config_pipe(sch, p, fs, v); 527204591Sluigi if (error) { 528204591Sluigi free(buf, M_DUMMYNET); 529204591Sluigi return error; 530204591Sluigi } 531204591Sluigi if (!is7 && p8->samples_no > 0) { 532204591Sluigi /* Add profiles*/ 533204591Sluigi pf = o_next(&buf, sizeof(*pf), DN_PROFILE); 534204591Sluigi error = dn_compat_config_profile(pf, p, v); 535204591Sluigi if (error) { 536204591Sluigi free(buf, M_DUMMYNET); 537204591Sluigi return error; 538204591Sluigi } 539204591Sluigi } 540204591Sluigi } else { /* queue config */ 541204591Sluigi fs = o_next(&buf, sizeof(*fs), DN_FS); 542204591Sluigi error = dn_compat_config_queue(fs, v); 543204591Sluigi if (error) { 544204591Sluigi free(buf, M_DUMMYNET); 545204591Sluigi return error; 546204591Sluigi } 547204591Sluigi } 548204591Sluigi error = do_config(base, (char *)buf - (char *)base); 549204591Sluigi 550204954Sluigi if (buf) 551204954Sluigi free(buf, M_DUMMYNET); 552204591Sluigi return error; 553204591Sluigi} 554204591Sluigi 555204591Sluigiint 556206425Sluigidn_compat_calc_size(void) 557204591Sluigi{ 558204591Sluigi int need = 0; 559204591Sluigi /* XXX use FreeBSD 8 struct size */ 560204591Sluigi /* NOTE: 561204591Sluigi * - half scheduler: schk_count/2 562204591Sluigi * - all flowset: fsk_count 563204591Sluigi * - all flowset queues: queue_count 564204591Sluigi * - all pipe queue: si_count 565204591Sluigi */ 566204591Sluigi need += dn_cfg.schk_count * sizeof(struct dn_pipe8) / 2; 567204591Sluigi need += dn_cfg.fsk_count * sizeof(struct dn_flow_set); 568204591Sluigi need += dn_cfg.si_count * sizeof(struct dn_flow_queue8); 569204591Sluigi need += dn_cfg.queue_count * sizeof(struct dn_flow_queue8); 570204591Sluigi 571204591Sluigi return need; 572204591Sluigi} 573204591Sluigi 574204591Sluigiint 575204591Sluigidn_c_copy_q (void *_ni, void *arg) 576204591Sluigi{ 577204591Sluigi struct copy_args *a = arg; 578204591Sluigi struct dn_flow_queue7 *fq7 = (struct dn_flow_queue7 *)*a->start; 579204591Sluigi struct dn_flow_queue8 *fq8 = (struct dn_flow_queue8 *)*a->start; 580204591Sluigi struct dn_flow *ni = (struct dn_flow *)_ni; 581204591Sluigi int size = 0; 582204591Sluigi 583204591Sluigi /* XXX hash slot not set */ 584204591Sluigi /* No difference between 7.2/8 */ 585204591Sluigi fq7->len = ni->length; 586204591Sluigi fq7->len_bytes = ni->len_bytes; 587204591Sluigi fq7->id = ni->fid; 588204591Sluigi 589204591Sluigi if (is7) { 590204591Sluigi size = sizeof(struct dn_flow_queue7); 591204591Sluigi fq7->tot_pkts = ni->tot_pkts; 592204591Sluigi fq7->tot_bytes = ni->tot_bytes; 593204591Sluigi fq7->drops = ni->drops; 594204591Sluigi } else { 595204591Sluigi size = sizeof(struct dn_flow_queue8); 596204591Sluigi fq8->tot_pkts = ni->tot_pkts; 597204591Sluigi fq8->tot_bytes = ni->tot_bytes; 598204591Sluigi fq8->drops = ni->drops; 599204591Sluigi } 600204591Sluigi 601204591Sluigi *a->start += size; 602204591Sluigi return 0; 603204591Sluigi} 604204591Sluigi 605204591Sluigiint 606204591Sluigidn_c_copy_pipe(struct dn_schk *s, struct copy_args *a, int nq) 607204591Sluigi{ 608204591Sluigi struct dn_link *l = &s->link; 609204591Sluigi struct dn_fsk *f = s->fs; 610204591Sluigi 611204591Sluigi struct dn_pipe7 *pipe7 = (struct dn_pipe7 *)*a->start; 612204591Sluigi struct dn_pipe8 *pipe8 = (struct dn_pipe8 *)*a->start; 613204591Sluigi struct dn_flow_set *fs; 614204591Sluigi int size = 0; 615204591Sluigi 616204591Sluigi if (is7) { 617204591Sluigi fs = &pipe7->fs; 618204591Sluigi size = sizeof(struct dn_pipe7); 619204591Sluigi } else { 620204591Sluigi fs = &pipe8->fs; 621204591Sluigi size = sizeof(struct dn_pipe8); 622204591Sluigi } 623204591Sluigi 624204591Sluigi /* These 4 field are the same in pipe7 and pipe8 */ 625204591Sluigi pipe7->next.sle_next = (struct dn_pipe7 *)DN_IS_PIPE; 626204591Sluigi pipe7->bandwidth = l->bandwidth; 627221521Sae pipe7->delay = l->delay * 1000 / hz; 628204591Sluigi pipe7->pipe_nr = l->link_nr - DN_MAX_ID; 629204591Sluigi 630204591Sluigi if (!is7) { 631204591Sluigi if (s->profile) { 632204591Sluigi struct dn_profile *pf = s->profile; 633204591Sluigi strncpy(pipe8->name, pf->name, sizeof(pf->name)); 634204591Sluigi pipe8->loss_level = pf->loss_level; 635204591Sluigi pipe8->samples_no = pf->samples_no; 636204591Sluigi } 637204591Sluigi pipe8->burst = div64(l->burst , 8 * hz); 638204591Sluigi } 639204591Sluigi 640204591Sluigi fs->flow_mask = s->sch.sched_mask; 641204591Sluigi fs->rq_size = s->sch.buckets ? s->sch.buckets : 1; 642204591Sluigi 643204591Sluigi fs->parent_nr = l->link_nr - DN_MAX_ID; 644204591Sluigi fs->qsize = f->fs.qsize; 645204591Sluigi fs->plr = f->fs.plr; 646204591Sluigi fs->w_q = f->fs.w_q; 647204591Sluigi fs->max_th = f->max_th; 648204591Sluigi fs->min_th = f->min_th; 649204591Sluigi fs->max_p = f->fs.max_p; 650204591Sluigi fs->rq_elements = nq; 651204591Sluigi 652204591Sluigi fs->flags_fs = convertflags2old(f->fs.flags); 653204591Sluigi 654204591Sluigi *a->start += size; 655204591Sluigi return 0; 656204591Sluigi} 657204591Sluigi 658204591Sluigi 659204591Sluigiint 660204591Sluigidn_compat_copy_pipe(struct copy_args *a, void *_o) 661204591Sluigi{ 662204591Sluigi int have = a->end - *a->start; 663204591Sluigi int need = 0; 664204591Sluigi int pipe_size = sizeof(struct dn_pipe8); 665204591Sluigi int queue_size = sizeof(struct dn_flow_queue8); 666204591Sluigi int n_queue = 0; /* number of queues */ 667204591Sluigi 668204591Sluigi struct dn_schk *s = (struct dn_schk *)_o; 669204591Sluigi /* calculate needed space: 670204591Sluigi * - struct dn_pipe 671204591Sluigi * - if there are instances, dn_queue * n_instances 672204591Sluigi */ 673204591Sluigi n_queue = (s->sch.flags & DN_HAVE_MASK ? dn_ht_entries(s->siht) : 674204591Sluigi (s->siht ? 1 : 0)); 675204591Sluigi need = pipe_size + queue_size * n_queue; 676204591Sluigi if (have < need) { 677204591Sluigi D("have %d < need %d", have, need); 678204591Sluigi return 1; 679204591Sluigi } 680204591Sluigi /* copy pipe */ 681204591Sluigi dn_c_copy_pipe(s, a, n_queue); 682204591Sluigi 683204591Sluigi /* copy queues */ 684204591Sluigi if (s->sch.flags & DN_HAVE_MASK) 685204591Sluigi dn_ht_scan(s->siht, dn_c_copy_q, a); 686204591Sluigi else if (s->siht) 687204591Sluigi dn_c_copy_q(s->siht, a); 688204591Sluigi return 0; 689204591Sluigi} 690204591Sluigi 691204591Sluigiint 692204591Sluigidn_c_copy_fs(struct dn_fsk *f, struct copy_args *a, int nq) 693204591Sluigi{ 694204591Sluigi struct dn_flow_set *fs = (struct dn_flow_set *)*a->start; 695204591Sluigi 696204591Sluigi fs->next.sle_next = (struct dn_flow_set *)DN_IS_QUEUE; 697204591Sluigi fs->fs_nr = f->fs.fs_nr; 698204591Sluigi fs->qsize = f->fs.qsize; 699204591Sluigi fs->plr = f->fs.plr; 700204591Sluigi fs->w_q = f->fs.w_q; 701204591Sluigi fs->max_th = f->max_th; 702204591Sluigi fs->min_th = f->min_th; 703204591Sluigi fs->max_p = f->fs.max_p; 704204591Sluigi fs->flow_mask = f->fs.flow_mask; 705204591Sluigi fs->rq_elements = nq; 706204591Sluigi fs->rq_size = (f->fs.buckets ? f->fs.buckets : 1); 707204591Sluigi fs->parent_nr = f->fs.sched_nr; 708204591Sluigi fs->weight = f->fs.par[0]; 709204591Sluigi 710204591Sluigi fs->flags_fs = convertflags2old(f->fs.flags); 711204591Sluigi *a->start += sizeof(struct dn_flow_set); 712204591Sluigi return 0; 713204591Sluigi} 714204591Sluigi 715204591Sluigiint 716204591Sluigidn_compat_copy_queue(struct copy_args *a, void *_o) 717204591Sluigi{ 718204591Sluigi int have = a->end - *a->start; 719204591Sluigi int need = 0; 720204591Sluigi int fs_size = sizeof(struct dn_flow_set); 721204591Sluigi int queue_size = sizeof(struct dn_flow_queue8); 722204591Sluigi 723204591Sluigi struct dn_fsk *fs = (struct dn_fsk *)_o; 724204591Sluigi int n_queue = 0; /* number of queues */ 725204591Sluigi 726204591Sluigi n_queue = (fs->fs.flags & DN_HAVE_MASK ? dn_ht_entries(fs->qht) : 727204591Sluigi (fs->qht ? 1 : 0)); 728204591Sluigi 729204591Sluigi need = fs_size + queue_size * n_queue; 730204591Sluigi if (have < need) { 731204591Sluigi D("have < need"); 732204591Sluigi return 1; 733204591Sluigi } 734204591Sluigi 735204591Sluigi /* copy flowset */ 736204591Sluigi dn_c_copy_fs(fs, a, n_queue); 737204591Sluigi 738204591Sluigi /* copy queues */ 739204591Sluigi if (fs->fs.flags & DN_HAVE_MASK) 740204591Sluigi dn_ht_scan(fs->qht, dn_c_copy_q, a); 741204591Sluigi else if (fs->qht) 742204591Sluigi dn_c_copy_q(fs->qht, a); 743204591Sluigi 744204591Sluigi return 0; 745204591Sluigi} 746204591Sluigi 747204591Sluigiint 748204591Sluigicopy_data_helper_compat(void *_o, void *_arg) 749204591Sluigi{ 750204591Sluigi struct copy_args *a = _arg; 751204591Sluigi 752204591Sluigi if (a->type == DN_COMPAT_PIPE) { 753204591Sluigi struct dn_schk *s = _o; 754204591Sluigi if (s->sch.oid.subtype != 1 || s->sch.sched_nr <= DN_MAX_ID) { 755204591Sluigi return 0; /* not old type */ 756204591Sluigi } 757204591Sluigi /* copy pipe parameters, and if instance exists, copy 758204591Sluigi * other parameters and eventually queues. 759204591Sluigi */ 760204591Sluigi if(dn_compat_copy_pipe(a, _o)) 761204591Sluigi return DNHT_SCAN_END; 762204591Sluigi } else if (a->type == DN_COMPAT_QUEUE) { 763204591Sluigi struct dn_fsk *fs = _o; 764204591Sluigi if (fs->fs.fs_nr >= DN_MAX_ID) 765204591Sluigi return 0; 766204591Sluigi if (dn_compat_copy_queue(a, _o)) 767204591Sluigi return DNHT_SCAN_END; 768204591Sluigi } 769204591Sluigi return 0; 770204591Sluigi} 771204591Sluigi 772204591Sluigi/* Main function to manage old requests */ 773204591Sluigiint 774204591Sluigiip_dummynet_compat(struct sockopt *sopt) 775204591Sluigi{ 776204591Sluigi int error=0; 777204591Sluigi void *v = NULL; 778204591Sluigi struct dn_id oid; 779204591Sluigi 780204591Sluigi /* Lenght of data, used to found ipfw version... */ 781204591Sluigi int len = sopt->sopt_valsize; 782204591Sluigi 783204591Sluigi /* len can be 0 if command was dummynet_flush */ 784204591Sluigi if (len == pipesize7) { 785204591Sluigi D("setting compatibility with FreeBSD 7.2"); 786204591Sluigi is7 = 1; 787204591Sluigi } 788204591Sluigi else if (len == pipesize8 || len == pipesizemax8) { 789204591Sluigi D("setting compatibility with FreeBSD 8"); 790204591Sluigi is7 = 0; 791204591Sluigi } 792204591Sluigi 793204591Sluigi switch (sopt->sopt_name) { 794204591Sluigi default: 795204591Sluigi printf("dummynet: -- unknown option %d", sopt->sopt_name); 796204591Sluigi error = EINVAL; 797204591Sluigi break; 798204591Sluigi 799204591Sluigi case IP_DUMMYNET_FLUSH: 800204591Sluigi oid_fill(&oid, sizeof(oid), DN_CMD_FLUSH, DN_API_VERSION); 801204591Sluigi do_config(&oid, oid.len); 802204591Sluigi break; 803204591Sluigi 804204591Sluigi case IP_DUMMYNET_DEL: 805204591Sluigi v = malloc(len, M_TEMP, M_WAITOK); 806204591Sluigi error = sooptcopyin(sopt, v, len, len); 807204591Sluigi if (error) 808204591Sluigi break; 809204591Sluigi error = dn_compat_del(v); 810220204Sae free(v, M_TEMP); 811204591Sluigi break; 812204591Sluigi 813204591Sluigi case IP_DUMMYNET_CONFIGURE: 814204591Sluigi v = malloc(len, M_TEMP, M_WAITOK); 815204591Sluigi error = sooptcopyin(sopt, v, len, len); 816204591Sluigi if (error) 817204591Sluigi break; 818204591Sluigi error = dn_compat_configure(v); 819220204Sae free(v, M_TEMP); 820204591Sluigi break; 821204591Sluigi 822204591Sluigi case IP_DUMMYNET_GET: { 823204591Sluigi void *buf; 824204591Sluigi int ret; 825204591Sluigi int original_size = sopt->sopt_valsize; 826204591Sluigi int size; 827204591Sluigi 828204591Sluigi ret = dummynet_get(sopt, &buf); 829204591Sluigi if (ret) 830204591Sluigi return 0;//XXX ? 831204591Sluigi size = sopt->sopt_valsize; 832204591Sluigi sopt->sopt_valsize = original_size; 833204591Sluigi D("size=%d, buf=%p", size, buf); 834204591Sluigi ret = sooptcopyout(sopt, buf, size); 835204591Sluigi if (ret) 836204591Sluigi printf(" %s ERROR sooptcopyout\n", __FUNCTION__); 837204591Sluigi if (buf) 838204591Sluigi free(buf, M_DUMMYNET); 839204591Sluigi } 840204591Sluigi } 841204591Sluigi 842204591Sluigi return error; 843204591Sluigi} 844204591Sluigi 845204591Sluigi 846