ip_dn_io.c revision 213265
1204591Sluigi/*- 2204591Sluigi * Copyright (c) 2010 Luigi Rizzo, 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 * Dummynet portions related to packet handling. 29204591Sluigi */ 30204591Sluigi#include <sys/cdefs.h> 31204591Sluigi__FBSDID("$FreeBSD: head/sys/netinet/ipfw/ip_dn_io.c 213265 2010-09-29 09:22:12Z luigi $"); 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/time.h> 47204591Sluigi#include <sys/sysctl.h> 48206461Sbz 49204591Sluigi#include <net/if.h> /* IFNAMSIZ, struct ifaddr, ifq head, lock.h mutex.h */ 50204591Sluigi#include <net/netisr.h> 51206461Sbz#include <net/vnet.h> 52206461Sbz 53204591Sluigi#include <netinet/in.h> 54204591Sluigi#include <netinet/ip.h> /* ip_len, ip_off */ 55204591Sluigi#include <netinet/ip_var.h> /* ip_output(), IP_FORWARDING */ 56204591Sluigi#include <netinet/ip_fw.h> 57204591Sluigi#include <netinet/ipfw/ip_fw_private.h> 58204591Sluigi#include <netinet/ipfw/dn_heap.h> 59204591Sluigi#include <netinet/ip_dummynet.h> 60204591Sluigi#include <netinet/ipfw/ip_dn_private.h> 61204591Sluigi#include <netinet/ipfw/dn_sched.h> 62204591Sluigi 63204591Sluigi#include <netinet/if_ether.h> /* various ether_* routines */ 64204591Sluigi 65204591Sluigi#include <netinet/ip6.h> /* for ip6_input, ip6_output prototypes */ 66204591Sluigi#include <netinet6/ip6_var.h> 67204591Sluigi 68204591Sluigi/* 69204591Sluigi * We keep a private variable for the simulation time, but we could 70204591Sluigi * probably use an existing one ("softticks" in sys/kern/kern_timeout.c) 71204591Sluigi * instead of dn_cfg.curr_time 72204591Sluigi */ 73204591Sluigi 74204591Sluigistruct dn_parms dn_cfg; 75206428Sluigi//VNET_DEFINE(struct dn_parms, _base_dn_cfg); 76204591Sluigi 77204591Sluigistatic long tick_last; /* Last tick duration (usec). */ 78204591Sluigistatic long tick_delta; /* Last vs standard tick diff (usec). */ 79204591Sluigistatic long tick_delta_sum; /* Accumulated tick difference (usec).*/ 80204591Sluigistatic long tick_adjustment; /* Tick adjustments done. */ 81204591Sluigistatic long tick_lost; /* Lost(coalesced) ticks number. */ 82204591Sluigi/* Adjusted vs non-adjusted curr_time difference (ticks). */ 83204591Sluigistatic long tick_diff; 84204591Sluigi 85204591Sluigistatic unsigned long io_pkt; 86204591Sluigistatic unsigned long io_pkt_fast; 87204591Sluigistatic unsigned long io_pkt_drop; 88204591Sluigi 89204591Sluigi/* 90204591Sluigi * We use a heap to store entities for which we have pending timer events. 91204591Sluigi * The heap is checked at every tick and all entities with expired events 92204591Sluigi * are extracted. 93204591Sluigi */ 94204591Sluigi 95204591SluigiMALLOC_DEFINE(M_DUMMYNET, "dummynet", "dummynet heap"); 96204591Sluigi 97204591Sluigiextern void (*bridge_dn_p)(struct mbuf *, struct ifnet *); 98204591Sluigi 99204591Sluigi#ifdef SYSCTL_NODE 100204591Sluigi 101204591SluigiSYSBEGIN(f4) 102204591Sluigi 103204591SluigiSYSCTL_DECL(_net_inet); 104204591SluigiSYSCTL_DECL(_net_inet_ip); 105204591SluigiSYSCTL_NODE(_net_inet_ip, OID_AUTO, dummynet, CTLFLAG_RW, 0, "Dummynet"); 106204591Sluigi 107206428Sluigi/* wrapper to pass dn_cfg fields to SYSCTL_* */ 108206428Sluigi//#define DC(x) (&(VNET_NAME(_base_dn_cfg).x)) 109206428Sluigi#define DC(x) (&(dn_cfg.x)) 110204591Sluigi/* parameters */ 111204591SluigiSYSCTL_INT(_net_inet_ip_dummynet, OID_AUTO, hash_size, 112206428Sluigi CTLFLAG_RW, DC(hash_size), 0, "Default hash table size"); 113204591SluigiSYSCTL_LONG(_net_inet_ip_dummynet, OID_AUTO, pipe_slot_limit, 114206428Sluigi CTLFLAG_RW, DC(slot_limit), 0, 115204591Sluigi "Upper limit in slots for pipe queue."); 116204591SluigiSYSCTL_LONG(_net_inet_ip_dummynet, OID_AUTO, pipe_byte_limit, 117206428Sluigi CTLFLAG_RW, DC(byte_limit), 0, 118204591Sluigi "Upper limit in bytes for pipe queue."); 119204591SluigiSYSCTL_INT(_net_inet_ip_dummynet, OID_AUTO, io_fast, 120206428Sluigi CTLFLAG_RW, DC(io_fast), 0, "Enable fast dummynet io."); 121204591SluigiSYSCTL_INT(_net_inet_ip_dummynet, OID_AUTO, debug, 122206428Sluigi CTLFLAG_RW, DC(debug), 0, "Dummynet debug level"); 123205173SluigiSYSCTL_INT(_net_inet_ip_dummynet, OID_AUTO, expire, 124206428Sluigi CTLFLAG_RW, DC(expire), 0, "Expire empty queues/pipes"); 125205173SluigiSYSCTL_INT(_net_inet_ip_dummynet, OID_AUTO, expire_cycle, 126206428Sluigi CTLFLAG_RD, DC(expire_cycle), 0, "Expire cycle for queues/pipes"); 127204591Sluigi 128204591Sluigi/* RED parameters */ 129204591SluigiSYSCTL_INT(_net_inet_ip_dummynet, OID_AUTO, red_lookup_depth, 130206428Sluigi CTLFLAG_RD, DC(red_lookup_depth), 0, "Depth of RED lookup table"); 131204591SluigiSYSCTL_INT(_net_inet_ip_dummynet, OID_AUTO, red_avg_pkt_size, 132206428Sluigi CTLFLAG_RD, DC(red_avg_pkt_size), 0, "RED Medium packet size"); 133204591SluigiSYSCTL_INT(_net_inet_ip_dummynet, OID_AUTO, red_max_pkt_size, 134206428Sluigi CTLFLAG_RD, DC(red_max_pkt_size), 0, "RED Max packet size"); 135204591Sluigi 136204591Sluigi/* time adjustment */ 137204591SluigiSYSCTL_LONG(_net_inet_ip_dummynet, OID_AUTO, tick_delta, 138204591Sluigi CTLFLAG_RD, &tick_delta, 0, "Last vs standard tick difference (usec)."); 139204591SluigiSYSCTL_LONG(_net_inet_ip_dummynet, OID_AUTO, tick_delta_sum, 140204591Sluigi CTLFLAG_RD, &tick_delta_sum, 0, "Accumulated tick difference (usec)."); 141204591SluigiSYSCTL_LONG(_net_inet_ip_dummynet, OID_AUTO, tick_adjustment, 142204591Sluigi CTLFLAG_RD, &tick_adjustment, 0, "Tick adjustments done."); 143204591SluigiSYSCTL_LONG(_net_inet_ip_dummynet, OID_AUTO, tick_diff, 144204591Sluigi CTLFLAG_RD, &tick_diff, 0, 145204591Sluigi "Adjusted vs non-adjusted curr_time difference (ticks)."); 146204591SluigiSYSCTL_LONG(_net_inet_ip_dummynet, OID_AUTO, tick_lost, 147204591Sluigi CTLFLAG_RD, &tick_lost, 0, 148204591Sluigi "Number of ticks coalesced by dummynet taskqueue."); 149204591Sluigi 150204591Sluigi/* statistics */ 151204591SluigiSYSCTL_INT(_net_inet_ip_dummynet, OID_AUTO, schk_count, 152206428Sluigi CTLFLAG_RD, DC(schk_count), 0, "Number of schedulers"); 153204591SluigiSYSCTL_INT(_net_inet_ip_dummynet, OID_AUTO, si_count, 154206428Sluigi CTLFLAG_RD, DC(si_count), 0, "Number of scheduler instances"); 155204591SluigiSYSCTL_INT(_net_inet_ip_dummynet, OID_AUTO, fsk_count, 156206428Sluigi CTLFLAG_RD, DC(fsk_count), 0, "Number of flowsets"); 157204591SluigiSYSCTL_INT(_net_inet_ip_dummynet, OID_AUTO, queue_count, 158206428Sluigi CTLFLAG_RD, DC(queue_count), 0, "Number of queues"); 159204591SluigiSYSCTL_ULONG(_net_inet_ip_dummynet, OID_AUTO, io_pkt, 160204591Sluigi CTLFLAG_RD, &io_pkt, 0, 161204591Sluigi "Number of packets passed to dummynet."); 162204591SluigiSYSCTL_ULONG(_net_inet_ip_dummynet, OID_AUTO, io_pkt_fast, 163204591Sluigi CTLFLAG_RD, &io_pkt_fast, 0, 164204591Sluigi "Number of packets bypassed dummynet scheduler."); 165204591SluigiSYSCTL_ULONG(_net_inet_ip_dummynet, OID_AUTO, io_pkt_drop, 166204591Sluigi CTLFLAG_RD, &io_pkt_drop, 0, 167204591Sluigi "Number of packets dropped by dummynet."); 168206428Sluigi#undef DC 169204591SluigiSYSEND 170204591Sluigi 171204591Sluigi#endif 172204591Sluigi 173204591Sluigistatic void dummynet_send(struct mbuf *); 174204591Sluigi 175204591Sluigi/* 176204591Sluigi * Packets processed by dummynet have an mbuf tag associated with 177204591Sluigi * them that carries their dummynet state. 178204591Sluigi * Outside dummynet, only the 'rule' field is relevant, and it must 179204591Sluigi * be at the beginning of the structure. 180204591Sluigi */ 181204591Sluigistruct dn_pkt_tag { 182204591Sluigi struct ipfw_rule_ref rule; /* matching rule */ 183204591Sluigi 184204591Sluigi /* second part, dummynet specific */ 185204591Sluigi int dn_dir; /* action when packet comes out.*/ 186204591Sluigi /* see ip_fw_private.h */ 187204591Sluigi uint64_t output_time; /* when the pkt is due for delivery*/ 188204591Sluigi struct ifnet *ifp; /* interface, for ip_output */ 189204591Sluigi struct _ip6dn_args ip6opt; /* XXX ipv6 options */ 190204591Sluigi}; 191204591Sluigi 192204591Sluigi/* 193204591Sluigi * Return the mbuf tag holding the dummynet state (it should 194204591Sluigi * be the first one on the list). 195204591Sluigi */ 196204591Sluigistatic struct dn_pkt_tag * 197204591Sluigidn_tag_get(struct mbuf *m) 198204591Sluigi{ 199204591Sluigi struct m_tag *mtag = m_tag_first(m); 200204591Sluigi KASSERT(mtag != NULL && 201204591Sluigi mtag->m_tag_cookie == MTAG_ABI_COMPAT && 202204591Sluigi mtag->m_tag_id == PACKET_TAG_DUMMYNET, 203204591Sluigi ("packet on dummynet queue w/o dummynet tag!")); 204204591Sluigi return (struct dn_pkt_tag *)(mtag+1); 205204591Sluigi} 206204591Sluigi 207204591Sluigistatic inline void 208204591Sluigimq_append(struct mq *q, struct mbuf *m) 209204591Sluigi{ 210204591Sluigi if (q->head == NULL) 211204591Sluigi q->head = m; 212204591Sluigi else 213204591Sluigi q->tail->m_nextpkt = m; 214204591Sluigi q->tail = m; 215204591Sluigi m->m_nextpkt = NULL; 216204591Sluigi} 217204591Sluigi 218204591Sluigi/* 219204591Sluigi * Dispose a list of packet. Use a functions so if we need to do 220204591Sluigi * more work, this is a central point to do it. 221204591Sluigi */ 222204591Sluigivoid dn_free_pkts(struct mbuf *mnext) 223204591Sluigi{ 224204591Sluigi struct mbuf *m; 225204591Sluigi 226204591Sluigi while ((m = mnext) != NULL) { 227204591Sluigi mnext = m->m_nextpkt; 228204591Sluigi FREE_PKT(m); 229204591Sluigi } 230204591Sluigi} 231204591Sluigi 232204591Sluigistatic int 233204591Sluigired_drops (struct dn_queue *q, int len) 234204591Sluigi{ 235204591Sluigi /* 236204591Sluigi * RED algorithm 237204591Sluigi * 238204591Sluigi * RED calculates the average queue size (avg) using a low-pass filter 239204591Sluigi * with an exponential weighted (w_q) moving average: 240204591Sluigi * avg <- (1-w_q) * avg + w_q * q_size 241204591Sluigi * where q_size is the queue length (measured in bytes or * packets). 242204591Sluigi * 243204591Sluigi * If q_size == 0, we compute the idle time for the link, and set 244204591Sluigi * avg = (1 - w_q)^(idle/s) 245204591Sluigi * where s is the time needed for transmitting a medium-sized packet. 246204591Sluigi * 247204591Sluigi * Now, if avg < min_th the packet is enqueued. 248204591Sluigi * If avg > max_th the packet is dropped. Otherwise, the packet is 249204591Sluigi * dropped with probability P function of avg. 250204591Sluigi */ 251204591Sluigi 252204591Sluigi struct dn_fsk *fs = q->fs; 253204591Sluigi int64_t p_b = 0; 254204591Sluigi 255204591Sluigi /* Queue in bytes or packets? */ 256204591Sluigi uint32_t q_size = (fs->fs.flags & DN_QSIZE_BYTES) ? 257204591Sluigi q->ni.len_bytes : q->ni.length; 258204591Sluigi 259204591Sluigi /* Average queue size estimation. */ 260204591Sluigi if (q_size != 0) { 261204591Sluigi /* Queue is not empty, avg <- avg + (q_size - avg) * w_q */ 262204591Sluigi int diff = SCALE(q_size) - q->avg; 263204591Sluigi int64_t v = SCALE_MUL((int64_t)diff, (int64_t)fs->w_q); 264204591Sluigi 265204591Sluigi q->avg += (int)v; 266204591Sluigi } else { 267204591Sluigi /* 268204591Sluigi * Queue is empty, find for how long the queue has been 269204591Sluigi * empty and use a lookup table for computing 270204591Sluigi * (1 - * w_q)^(idle_time/s) where s is the time to send a 271204591Sluigi * (small) packet. 272204591Sluigi * XXX check wraps... 273204591Sluigi */ 274204591Sluigi if (q->avg) { 275204591Sluigi u_int t = div64((dn_cfg.curr_time - q->q_time), fs->lookup_step); 276204591Sluigi 277204591Sluigi q->avg = (t < fs->lookup_depth) ? 278204591Sluigi SCALE_MUL(q->avg, fs->w_q_lookup[t]) : 0; 279204591Sluigi } 280204591Sluigi } 281204591Sluigi 282204591Sluigi /* Should i drop? */ 283204591Sluigi if (q->avg < fs->min_th) { 284204591Sluigi q->count = -1; 285204591Sluigi return (0); /* accept packet */ 286204591Sluigi } 287204591Sluigi if (q->avg >= fs->max_th) { /* average queue >= max threshold */ 288204591Sluigi if (fs->fs.flags & DN_IS_GENTLE_RED) { 289204591Sluigi /* 290204591Sluigi * According to Gentle-RED, if avg is greater than 291204591Sluigi * max_th the packet is dropped with a probability 292204591Sluigi * p_b = c_3 * avg - c_4 293204591Sluigi * where c_3 = (1 - max_p) / max_th 294204591Sluigi * c_4 = 1 - 2 * max_p 295204591Sluigi */ 296204591Sluigi p_b = SCALE_MUL((int64_t)fs->c_3, (int64_t)q->avg) - 297204591Sluigi fs->c_4; 298204591Sluigi } else { 299204591Sluigi q->count = -1; 300204591Sluigi return (1); 301204591Sluigi } 302204591Sluigi } else if (q->avg > fs->min_th) { 303204591Sluigi /* 304204591Sluigi * We compute p_b using the linear dropping function 305204591Sluigi * p_b = c_1 * avg - c_2 306204591Sluigi * where c_1 = max_p / (max_th - min_th) 307204591Sluigi * c_2 = max_p * min_th / (max_th - min_th) 308204591Sluigi */ 309204591Sluigi p_b = SCALE_MUL((int64_t)fs->c_1, (int64_t)q->avg) - fs->c_2; 310204591Sluigi } 311204591Sluigi 312204591Sluigi if (fs->fs.flags & DN_QSIZE_BYTES) 313204591Sluigi p_b = div64((p_b * len) , fs->max_pkt_size); 314204591Sluigi if (++q->count == 0) 315204591Sluigi q->random = random() & 0xffff; 316204591Sluigi else { 317204591Sluigi /* 318204591Sluigi * q->count counts packets arrived since last drop, so a greater 319204591Sluigi * value of q->count means a greater packet drop probability. 320204591Sluigi */ 321204591Sluigi if (SCALE_MUL(p_b, SCALE((int64_t)q->count)) > q->random) { 322204591Sluigi q->count = 0; 323204591Sluigi /* After a drop we calculate a new random value. */ 324204591Sluigi q->random = random() & 0xffff; 325204591Sluigi return (1); /* drop */ 326204591Sluigi } 327204591Sluigi } 328204591Sluigi /* End of RED algorithm. */ 329204591Sluigi 330204591Sluigi return (0); /* accept */ 331204591Sluigi 332204591Sluigi} 333204591Sluigi 334204591Sluigi/* 335204591Sluigi * Enqueue a packet in q, subject to space and queue management policy 336204591Sluigi * (whose parameters are in q->fs). 337204591Sluigi * Update stats for the queue and the scheduler. 338204591Sluigi * Return 0 on success, 1 on drop. The packet is consumed anyways. 339204591Sluigi */ 340204591Sluigiint 341204591Sluigidn_enqueue(struct dn_queue *q, struct mbuf* m, int drop) 342204591Sluigi{ 343204591Sluigi struct dn_fs *f; 344204591Sluigi struct dn_flow *ni; /* stats for scheduler instance */ 345204591Sluigi uint64_t len; 346204591Sluigi 347204591Sluigi if (q->fs == NULL || q->_si == NULL) { 348204591Sluigi printf("%s fs %p si %p, dropping\n", 349204591Sluigi __FUNCTION__, q->fs, q->_si); 350204591Sluigi FREE_PKT(m); 351204591Sluigi return 1; 352204591Sluigi } 353204591Sluigi f = &(q->fs->fs); 354204591Sluigi ni = &q->_si->ni; 355204591Sluigi len = m->m_pkthdr.len; 356204591Sluigi /* Update statistics, then check reasons to drop pkt. */ 357204591Sluigi q->ni.tot_bytes += len; 358204591Sluigi q->ni.tot_pkts++; 359204591Sluigi ni->tot_bytes += len; 360204591Sluigi ni->tot_pkts++; 361204591Sluigi if (drop) 362204591Sluigi goto drop; 363204591Sluigi if (f->plr && random() < f->plr) 364204591Sluigi goto drop; 365204591Sluigi if (f->flags & DN_IS_RED && red_drops(q, m->m_pkthdr.len)) 366204591Sluigi goto drop; 367204591Sluigi if (f->flags & DN_QSIZE_BYTES) { 368204591Sluigi if (q->ni.len_bytes > f->qsize) 369204591Sluigi goto drop; 370204591Sluigi } else if (q->ni.length >= f->qsize) { 371204591Sluigi goto drop; 372204591Sluigi } 373204591Sluigi mq_append(&q->mq, m); 374204591Sluigi q->ni.length++; 375204591Sluigi q->ni.len_bytes += len; 376204591Sluigi ni->length++; 377204591Sluigi ni->len_bytes += len; 378204591Sluigi return 0; 379204591Sluigi 380204591Sluigidrop: 381204591Sluigi io_pkt_drop++; 382204591Sluigi q->ni.drops++; 383204591Sluigi ni->drops++; 384204591Sluigi FREE_PKT(m); 385204591Sluigi return 1; 386204591Sluigi} 387204591Sluigi 388204591Sluigi/* 389204591Sluigi * Fetch packets from the delay line which are due now. If there are 390204591Sluigi * leftover packets, reinsert the delay line in the heap. 391204591Sluigi * Runs under scheduler lock. 392204591Sluigi */ 393204591Sluigistatic void 394204591Sluigitransmit_event(struct mq *q, struct delay_line *dline, uint64_t now) 395204591Sluigi{ 396204591Sluigi struct mbuf *m; 397204591Sluigi struct dn_pkt_tag *pkt = NULL; 398204591Sluigi 399204591Sluigi dline->oid.subtype = 0; /* not in heap */ 400204591Sluigi while ((m = dline->mq.head) != NULL) { 401204591Sluigi pkt = dn_tag_get(m); 402204591Sluigi if (!DN_KEY_LEQ(pkt->output_time, now)) 403204591Sluigi break; 404204591Sluigi dline->mq.head = m->m_nextpkt; 405204591Sluigi mq_append(q, m); 406204591Sluigi } 407204591Sluigi if (m != NULL) { 408204591Sluigi dline->oid.subtype = 1; /* in heap */ 409204591Sluigi heap_insert(&dn_cfg.evheap, pkt->output_time, dline); 410204591Sluigi } 411204591Sluigi} 412204591Sluigi 413204591Sluigi/* 414204591Sluigi * Convert the additional MAC overheads/delays into an equivalent 415204591Sluigi * number of bits for the given data rate. The samples are 416204591Sluigi * in milliseconds so we need to divide by 1000. 417204591Sluigi */ 418204591Sluigistatic uint64_t 419204591Sluigiextra_bits(struct mbuf *m, struct dn_schk *s) 420204591Sluigi{ 421204591Sluigi int index; 422204591Sluigi uint64_t bits; 423204591Sluigi struct dn_profile *pf = s->profile; 424204591Sluigi 425204591Sluigi if (!pf || pf->samples_no == 0) 426204591Sluigi return 0; 427204591Sluigi index = random() % pf->samples_no; 428204591Sluigi bits = div64((uint64_t)pf->samples[index] * s->link.bandwidth, 1000); 429204591Sluigi if (index >= pf->loss_level) { 430204591Sluigi struct dn_pkt_tag *dt = dn_tag_get(m); 431204591Sluigi if (dt) 432204591Sluigi dt->dn_dir = DIR_DROP; 433204591Sluigi } 434204591Sluigi return bits; 435204591Sluigi} 436204591Sluigi 437204591Sluigi/* 438204591Sluigi * Send traffic from a scheduler instance due by 'now'. 439204591Sluigi * Return a pointer to the head of the queue. 440204591Sluigi */ 441204591Sluigistatic struct mbuf * 442204591Sluigiserve_sched(struct mq *q, struct dn_sch_inst *si, uint64_t now) 443204591Sluigi{ 444204591Sluigi struct mq def_q; 445204591Sluigi struct dn_schk *s = si->sched; 446204591Sluigi struct mbuf *m = NULL; 447204591Sluigi int delay_line_idle = (si->dline.mq.head == NULL); 448204591Sluigi int done, bw; 449204591Sluigi 450204591Sluigi if (q == NULL) { 451204591Sluigi q = &def_q; 452204591Sluigi q->head = NULL; 453204591Sluigi } 454204591Sluigi 455204591Sluigi bw = s->link.bandwidth; 456204591Sluigi si->kflags &= ~DN_ACTIVE; 457204591Sluigi 458204591Sluigi if (bw > 0) 459204591Sluigi si->credit += (now - si->sched_time) * bw; 460204591Sluigi else 461204591Sluigi si->credit = 0; 462204591Sluigi si->sched_time = now; 463204591Sluigi done = 0; 464204591Sluigi while (si->credit >= 0 && (m = s->fp->dequeue(si)) != NULL) { 465204591Sluigi uint64_t len_scaled; 466204591Sluigi done++; 467204591Sluigi len_scaled = (bw == 0) ? 0 : hz * 468204591Sluigi (m->m_pkthdr.len * 8 + extra_bits(m, s)); 469204591Sluigi si->credit -= len_scaled; 470204591Sluigi /* Move packet in the delay line */ 471204591Sluigi dn_tag_get(m)->output_time += s->link.delay ; 472204591Sluigi mq_append(&si->dline.mq, m); 473204591Sluigi } 474204591Sluigi /* 475204591Sluigi * If credit >= 0 the instance is idle, mark time. 476204591Sluigi * Otherwise put back in the heap, and adjust the output 477204591Sluigi * time of the last inserted packet, m, which was too early. 478204591Sluigi */ 479204591Sluigi if (si->credit >= 0) { 480204591Sluigi si->idle_time = now; 481204591Sluigi } else { 482204591Sluigi uint64_t t; 483204591Sluigi KASSERT (bw > 0, ("bw=0 and credit<0 ?")); 484204591Sluigi t = div64(bw - 1 - si->credit, bw); 485204591Sluigi if (m) 486204591Sluigi dn_tag_get(m)->output_time += t; 487204591Sluigi si->kflags |= DN_ACTIVE; 488204591Sluigi heap_insert(&dn_cfg.evheap, now + t, si); 489204591Sluigi } 490204591Sluigi if (delay_line_idle && done) 491204591Sluigi transmit_event(q, &si->dline, now); 492204591Sluigi return q->head; 493204591Sluigi} 494204591Sluigi 495204591Sluigi/* 496204591Sluigi * The timer handler for dummynet. Time is computed in ticks, but 497204591Sluigi * but the code is tolerant to the actual rate at which this is called. 498204591Sluigi * Once complete, the function reschedules itself for the next tick. 499204591Sluigi */ 500204591Sluigivoid 501204591Sluigidummynet_task(void *context, int pending) 502204591Sluigi{ 503204591Sluigi struct timeval t; 504204591Sluigi struct mq q = { NULL, NULL }; /* queue to accumulate results */ 505204591Sluigi 506206461Sbz CURVNET_SET((struct vnet *)context); 507206428Sluigi 508204591Sluigi DN_BH_WLOCK(); 509204591Sluigi 510204591Sluigi /* Update number of lost(coalesced) ticks. */ 511204591Sluigi tick_lost += pending - 1; 512204591Sluigi 513204591Sluigi getmicrouptime(&t); 514204591Sluigi /* Last tick duration (usec). */ 515204591Sluigi tick_last = (t.tv_sec - dn_cfg.prev_t.tv_sec) * 1000000 + 516204591Sluigi (t.tv_usec - dn_cfg.prev_t.tv_usec); 517204591Sluigi /* Last tick vs standard tick difference (usec). */ 518204591Sluigi tick_delta = (tick_last * hz - 1000000) / hz; 519204591Sluigi /* Accumulated tick difference (usec). */ 520204591Sluigi tick_delta_sum += tick_delta; 521204591Sluigi 522204591Sluigi dn_cfg.prev_t = t; 523204591Sluigi 524204591Sluigi /* 525204591Sluigi * Adjust curr_time if the accumulated tick difference is 526204591Sluigi * greater than the 'standard' tick. Since curr_time should 527204591Sluigi * be monotonically increasing, we do positive adjustments 528204591Sluigi * as required, and throttle curr_time in case of negative 529204591Sluigi * adjustment. 530204591Sluigi */ 531204591Sluigi dn_cfg.curr_time++; 532204591Sluigi if (tick_delta_sum - tick >= 0) { 533204591Sluigi int diff = tick_delta_sum / tick; 534204591Sluigi 535204591Sluigi dn_cfg.curr_time += diff; 536204591Sluigi tick_diff += diff; 537204591Sluigi tick_delta_sum %= tick; 538204591Sluigi tick_adjustment++; 539204591Sluigi } else if (tick_delta_sum + tick <= 0) { 540204591Sluigi dn_cfg.curr_time--; 541204591Sluigi tick_diff--; 542204591Sluigi tick_delta_sum += tick; 543204591Sluigi tick_adjustment++; 544204591Sluigi } 545204591Sluigi 546204591Sluigi /* serve pending events, accumulate in q */ 547204591Sluigi for (;;) { 548204591Sluigi struct dn_id *p; /* generic parameter to handler */ 549204591Sluigi 550204591Sluigi if (dn_cfg.evheap.elements == 0 || 551204591Sluigi DN_KEY_LT(dn_cfg.curr_time, HEAP_TOP(&dn_cfg.evheap)->key)) 552204591Sluigi break; 553204591Sluigi p = HEAP_TOP(&dn_cfg.evheap)->object; 554204591Sluigi heap_extract(&dn_cfg.evheap, NULL); 555204591Sluigi 556204591Sluigi if (p->type == DN_SCH_I) { 557204591Sluigi serve_sched(&q, (struct dn_sch_inst *)p, dn_cfg.curr_time); 558204591Sluigi } else { /* extracted a delay line */ 559204591Sluigi transmit_event(&q, (struct delay_line *)p, dn_cfg.curr_time); 560204591Sluigi } 561204591Sluigi } 562205173Sluigi if (dn_cfg.expire && ++dn_cfg.expire_cycle >= dn_cfg.expire) { 563205173Sluigi dn_cfg.expire_cycle = 0; 564205173Sluigi dn_drain_scheduler(); 565205173Sluigi dn_drain_queue(); 566205173Sluigi } 567204591Sluigi 568204591Sluigi DN_BH_WUNLOCK(); 569204591Sluigi dn_reschedule(); 570204591Sluigi if (q.head != NULL) 571204591Sluigi dummynet_send(q.head); 572206428Sluigi CURVNET_RESTORE(); 573204591Sluigi} 574204591Sluigi 575204591Sluigi/* 576204591Sluigi * forward a chain of packets to the proper destination. 577204591Sluigi * This runs outside the dummynet lock. 578204591Sluigi */ 579204591Sluigistatic void 580204591Sluigidummynet_send(struct mbuf *m) 581204591Sluigi{ 582204591Sluigi struct mbuf *n; 583204591Sluigi 584204591Sluigi for (; m != NULL; m = n) { 585204591Sluigi struct ifnet *ifp = NULL; /* gcc 3.4.6 complains */ 586204591Sluigi struct m_tag *tag; 587204591Sluigi int dst; 588204591Sluigi 589204591Sluigi n = m->m_nextpkt; 590204591Sluigi m->m_nextpkt = NULL; 591204591Sluigi tag = m_tag_first(m); 592204591Sluigi if (tag == NULL) { /* should not happen */ 593204591Sluigi dst = DIR_DROP; 594204591Sluigi } else { 595204591Sluigi struct dn_pkt_tag *pkt = dn_tag_get(m); 596204591Sluigi /* extract the dummynet info, rename the tag 597204591Sluigi * to carry reinject info. 598204591Sluigi */ 599204591Sluigi dst = pkt->dn_dir; 600204591Sluigi ifp = pkt->ifp; 601204591Sluigi tag->m_tag_cookie = MTAG_IPFW_RULE; 602204591Sluigi tag->m_tag_id = 0; 603204591Sluigi } 604204591Sluigi 605204591Sluigi switch (dst) { 606204591Sluigi case DIR_OUT: 607204591Sluigi SET_HOST_IPLEN(mtod(m, struct ip *)); 608204591Sluigi ip_output(m, NULL, NULL, IP_FORWARDING, NULL, NULL); 609204591Sluigi break ; 610204591Sluigi 611204591Sluigi case DIR_IN : 612204591Sluigi /* put header in network format for ip_input() */ 613204591Sluigi //SET_NET_IPLEN(mtod(m, struct ip *)); 614204591Sluigi netisr_dispatch(NETISR_IP, m); 615204591Sluigi break; 616204591Sluigi 617204591Sluigi#ifdef INET6 618204591Sluigi case DIR_IN | PROTO_IPV6: 619204591Sluigi netisr_dispatch(NETISR_IPV6, m); 620204591Sluigi break; 621204591Sluigi 622204591Sluigi case DIR_OUT | PROTO_IPV6: 623204591Sluigi SET_HOST_IPLEN(mtod(m, struct ip *)); 624204591Sluigi ip6_output(m, NULL, NULL, IPV6_FORWARDING, NULL, NULL, NULL); 625204591Sluigi break; 626204591Sluigi#endif 627204591Sluigi 628204591Sluigi case DIR_FWD | PROTO_IFB: /* DN_TO_IFB_FWD: */ 629204591Sluigi if (bridge_dn_p != NULL) 630204591Sluigi ((*bridge_dn_p)(m, ifp)); 631204591Sluigi else 632204591Sluigi printf("dummynet: if_bridge not loaded\n"); 633204591Sluigi 634204591Sluigi break; 635204591Sluigi 636204591Sluigi case DIR_IN | PROTO_LAYER2: /* DN_TO_ETH_DEMUX: */ 637204591Sluigi /* 638204591Sluigi * The Ethernet code assumes the Ethernet header is 639204591Sluigi * contiguous in the first mbuf header. 640204591Sluigi * Insure this is true. 641204591Sluigi */ 642204591Sluigi if (m->m_len < ETHER_HDR_LEN && 643204591Sluigi (m = m_pullup(m, ETHER_HDR_LEN)) == NULL) { 644204591Sluigi printf("dummynet/ether: pullup failed, " 645204591Sluigi "dropping packet\n"); 646204591Sluigi break; 647204591Sluigi } 648204591Sluigi ether_demux(m->m_pkthdr.rcvif, m); 649204591Sluigi break; 650204591Sluigi 651204591Sluigi case DIR_OUT | PROTO_LAYER2: /* N_TO_ETH_OUT: */ 652204591Sluigi ether_output_frame(ifp, m); 653204591Sluigi break; 654204591Sluigi 655204591Sluigi case DIR_DROP: 656204591Sluigi /* drop the packet after some time */ 657204591Sluigi FREE_PKT(m); 658204591Sluigi break; 659204591Sluigi 660204591Sluigi default: 661204591Sluigi printf("dummynet: bad switch %d!\n", dst); 662204591Sluigi FREE_PKT(m); 663204591Sluigi break; 664204591Sluigi } 665204591Sluigi } 666204591Sluigi} 667204591Sluigi 668204591Sluigistatic inline int 669204591Sluigitag_mbuf(struct mbuf *m, int dir, struct ip_fw_args *fwa) 670204591Sluigi{ 671204591Sluigi struct dn_pkt_tag *dt; 672204591Sluigi struct m_tag *mtag; 673204591Sluigi 674204591Sluigi mtag = m_tag_get(PACKET_TAG_DUMMYNET, 675204591Sluigi sizeof(*dt), M_NOWAIT | M_ZERO); 676204591Sluigi if (mtag == NULL) 677204591Sluigi return 1; /* Cannot allocate packet header. */ 678204591Sluigi m_tag_prepend(m, mtag); /* Attach to mbuf chain. */ 679204591Sluigi dt = (struct dn_pkt_tag *)(mtag + 1); 680204591Sluigi dt->rule = fwa->rule; 681204591Sluigi dt->rule.info &= IPFW_ONEPASS; /* only keep this info */ 682204591Sluigi dt->dn_dir = dir; 683204591Sluigi dt->ifp = fwa->oif; 684204591Sluigi /* dt->output tame is updated as we move through */ 685204591Sluigi dt->output_time = dn_cfg.curr_time; 686204591Sluigi return 0; 687204591Sluigi} 688204591Sluigi 689204591Sluigi 690204591Sluigi/* 691204591Sluigi * dummynet hook for packets. 692204591Sluigi * We use the argument to locate the flowset fs and the sched_set sch 693204591Sluigi * associated to it. The we apply flow_mask and sched_mask to 694204591Sluigi * determine the queue and scheduler instances. 695204591Sluigi * 696204591Sluigi * dir where shall we send the packet after dummynet. 697204591Sluigi * *m0 the mbuf with the packet 698204591Sluigi * ifp the 'ifp' parameter from the caller. 699204591Sluigi * NULL in ip_input, destination interface in ip_output, 700204591Sluigi */ 701204591Sluigiint 702204591Sluigidummynet_io(struct mbuf **m0, int dir, struct ip_fw_args *fwa) 703204591Sluigi{ 704204591Sluigi struct mbuf *m = *m0; 705204591Sluigi struct dn_fsk *fs = NULL; 706204591Sluigi struct dn_sch_inst *si; 707204591Sluigi struct dn_queue *q = NULL; /* default */ 708204591Sluigi 709204591Sluigi int fs_id = (fwa->rule.info & IPFW_INFO_MASK) + 710204591Sluigi ((fwa->rule.info & IPFW_IS_PIPE) ? 2*DN_MAX_ID : 0); 711204591Sluigi DN_BH_WLOCK(); 712204591Sluigi io_pkt++; 713204591Sluigi /* we could actually tag outside the lock, but who cares... */ 714204591Sluigi if (tag_mbuf(m, dir, fwa)) 715204591Sluigi goto dropit; 716204591Sluigi if (dn_cfg.busy) { 717204591Sluigi /* if the upper half is busy doing something expensive, 718204591Sluigi * lets queue the packet and move forward 719204591Sluigi */ 720204591Sluigi mq_append(&dn_cfg.pending, m); 721204591Sluigi m = *m0 = NULL; /* consumed */ 722204591Sluigi goto done; /* already active, nothing to do */ 723204591Sluigi } 724204591Sluigi /* XXX locate_flowset could be optimised with a direct ref. */ 725204591Sluigi fs = dn_ht_find(dn_cfg.fshash, fs_id, 0, NULL); 726204591Sluigi if (fs == NULL) 727204591Sluigi goto dropit; /* This queue/pipe does not exist! */ 728204591Sluigi if (fs->sched == NULL) /* should not happen */ 729204591Sluigi goto dropit; 730204591Sluigi /* find scheduler instance, possibly applying sched_mask */ 731204591Sluigi si = ipdn_si_find(fs->sched, &(fwa->f_id)); 732204591Sluigi if (si == NULL) 733204591Sluigi goto dropit; 734204591Sluigi /* 735204591Sluigi * If the scheduler supports multiple queues, find the right one 736204591Sluigi * (otherwise it will be ignored by enqueue). 737204591Sluigi */ 738204591Sluigi if (fs->sched->fp->flags & DN_MULTIQUEUE) { 739204591Sluigi q = ipdn_q_find(fs, si, &(fwa->f_id)); 740204591Sluigi if (q == NULL) 741204591Sluigi goto dropit; 742204591Sluigi } 743204591Sluigi if (fs->sched->fp->enqueue(si, q, m)) { 744204591Sluigi /* packet was dropped by enqueue() */ 745204591Sluigi m = *m0 = NULL; 746204591Sluigi goto dropit; 747204591Sluigi } 748204591Sluigi 749204591Sluigi if (si->kflags & DN_ACTIVE) { 750204591Sluigi m = *m0 = NULL; /* consumed */ 751204591Sluigi goto done; /* already active, nothing to do */ 752204591Sluigi } 753204591Sluigi 754204591Sluigi /* compute the initial allowance */ 755213265Sluigi if (si->idle_time < dn_cfg.curr_time) { 756213265Sluigi /* Do this only on the first packet on an idle pipe */ 757204591Sluigi struct dn_link *p = &fs->sched->link; 758213265Sluigi 759213265Sluigi si->sched_time = dn_cfg.curr_time; 760204591Sluigi si->credit = dn_cfg.io_fast ? p->bandwidth : 0; 761204591Sluigi if (p->burst) { 762204591Sluigi uint64_t burst = (dn_cfg.curr_time - si->idle_time) * p->bandwidth; 763204591Sluigi if (burst > p->burst) 764204591Sluigi burst = p->burst; 765204591Sluigi si->credit += burst; 766204591Sluigi } 767204591Sluigi } 768204591Sluigi /* pass through scheduler and delay line */ 769204591Sluigi m = serve_sched(NULL, si, dn_cfg.curr_time); 770204591Sluigi 771204591Sluigi /* optimization -- pass it back to ipfw for immediate send */ 772204591Sluigi /* XXX Don't call dummynet_send() if scheduler return the packet 773204591Sluigi * just enqueued. This avoid a lock order reversal. 774204591Sluigi * 775204591Sluigi */ 776204591Sluigi if (/*dn_cfg.io_fast &&*/ m == *m0 && (dir & PROTO_LAYER2) == 0 ) { 777205602Sluigi /* fast io, rename the tag * to carry reinject info. */ 778205602Sluigi struct m_tag *tag = m_tag_first(m); 779205602Sluigi 780205602Sluigi tag->m_tag_cookie = MTAG_IPFW_RULE; 781205602Sluigi tag->m_tag_id = 0; 782204591Sluigi io_pkt_fast++; 783204591Sluigi if (m->m_nextpkt != NULL) { 784204591Sluigi printf("dummynet: fast io: pkt chain detected!\n"); 785204591Sluigi m->m_nextpkt = NULL; 786204591Sluigi } 787204591Sluigi m = NULL; 788204591Sluigi } else { 789204591Sluigi *m0 = NULL; 790204591Sluigi } 791204591Sluigidone: 792204591Sluigi DN_BH_WUNLOCK(); 793204591Sluigi if (m) 794204591Sluigi dummynet_send(m); 795204591Sluigi return 0; 796204591Sluigi 797204591Sluigidropit: 798204591Sluigi io_pkt_drop++; 799204591Sluigi DN_BH_WUNLOCK(); 800204591Sluigi if (m) 801204591Sluigi FREE_PKT(m); 802204591Sluigi *m0 = NULL; 803204591Sluigi return (fs && (fs->fs.flags & DN_NOERROR)) ? 0 : ENOBUFS; 804204591Sluigi} 805