1 /* 2 * Copyright (c) 2008 The DragonFly Project. All rights reserved. 3 * 4 * This code is derived from software contributed to The DragonFly Project 5 * by Matthew Dillon <dillon@backplane.com> 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 11 * 1. Redistributions of source code must retain the above copyright 12 * notice, this list of conditions and the following disclaimer. 13 * 2. Redistributions in binary form must reproduce the above copyright 14 * notice, this list of conditions and the following disclaimer in 15 * the documentation and/or other materials provided with the 16 * distribution. 17 * 3. Neither the name of The DragonFly Project nor the names of its 18 * contributors may be used to endorse or promote products derived 19 * from this software without specific, prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 22 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS 24 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE 25 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, 26 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING, 27 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 28 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED 29 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, 30 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT 31 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 32 * SUCH DAMAGE. 33 * 34 * $DragonFly: src/sys/net/altq/altq_fairq.h,v 1.1 2008/04/06 18:58:15 dillon Exp $ 35 */ 36 37 #ifndef _ALTQ_ALTQ_FAIRQ_H_ 38 #define _ALTQ_ALTQ_FAIRQ_H_ 39 40 #include <net/altq/altq.h> 41 #include <net/altq/altq_classq.h> 42 #include <net/altq/altq_red.h> 43 #include <net/altq/altq_rio.h> 44 #include <net/altq/altq_rmclass.h> 45 46 #define FAIRQ_MAX_BUCKETS 2048 /* maximum number of sorting buckets */ 47 #define FAIRQ_MAXPRI RM_MAXPRIO 48 #define FAIRQ_BITMAP_WIDTH (sizeof(fairq_bitmap_t)*8) 49 #define FAIRQ_BITMAP_MASK (FAIRQ_BITMAP_WIDTH - 1) 50 51 /* fairq class flags */ 52 #define FARF_RED 0x0001 /* use RED */ 53 #define FARF_ECN 0x0002 /* use RED/ECN */ 54 #define FARF_RIO 0x0004 /* use RIO */ 55 #define FARF_CLEARDSCP 0x0010 /* clear diffserv codepoint */ 56 #define FARF_DEFAULTCLASS 0x1000 /* default class */ 57 58 #define FARF_HAS_PACKETS 0x2000 /* might have queued packets */ 59 60 #define FARF_USERFLAGS (FARF_RED|FARF_ECN|FARF_RIO|FARF_CLEARDSCP| \ 61 FARF_DEFAULTCLASS) 62 63 /* special class handles */ 64 #define FAIRQ_NULLCLASS_HANDLE 0 65 66 typedef u_int fairq_bitmap_t; 67 68 struct fairq_classstats { 69 uint32_t class_handle; 70 71 u_int qlength; 72 u_int qlimit; 73 struct pktcntr xmit_cnt; /* transmitted packet counter */ 74 struct pktcntr drop_cnt; /* dropped packet counter */ 75 76 /* red and rio related info */ 77 int qtype; 78 struct redstats red[3]; /* rio has 3 red stats */ 79 }; 80 81 #ifdef _KERNEL 82 83 typedef struct fairq_bucket { 84 struct fairq_bucket *next; /* circular list */ 85 struct fairq_bucket *prev; /* circular list */ 86 class_queue_t queue; /* the actual queue */ 87 uint64_t bw_bytes; /* statistics used to calculate bw */ 88 uint64_t bw_delta; /* statistics used to calculate bw */ 89 uint64_t last_time; 90 int in_use; 91 } fairq_bucket_t; 92 93 struct fairq_class { 94 uint32_t cl_handle; /* class handle */ 95 u_int cl_nbuckets; /* (power of 2) */ 96 u_int cl_nbucket_mask; /* bucket mask */ 97 fairq_bucket_t *cl_buckets; 98 fairq_bucket_t *cl_head; /* head of circular bucket list */ 99 struct red *cl_red; /* RED state */ 100 int cl_advanced; /* already advanced head */ 101 uint64_t cl_hogs_m1; 102 uint64_t cl_lssc_m1; 103 uint64_t cl_bandwidth; 104 uint64_t cl_bw_current; 105 uint64_t cl_bw_bytes; 106 uint64_t cl_bw_delta; 107 uint64_t cl_last_time; 108 int cl_qtype; /* rollup */ 109 int cl_qlimit; 110 int cl_pri; /* priority */ 111 int cl_flags; /* class flags */ 112 struct fairq_if *cl_pif; /* back pointer to pif */ 113 struct altq_pktattr *cl_pktattr; /* saved header used by ECN */ 114 115 /* round robin index */ 116 117 /* statistics */ 118 struct pktcntr cl_xmitcnt; /* transmitted packet counter */ 119 struct pktcntr cl_dropcnt; /* dropped packet counter */ 120 }; 121 122 /* 123 * fairq interface state 124 */ 125 struct fairq_if { 126 struct fairq_if *pif_next; /* interface state list */ 127 struct ifaltq *pif_ifq; /* backpointer to ifaltq */ 128 u_int pif_bandwidth; /* link bandwidth in bps */ 129 int pif_maxpri; /* max priority in use */ 130 struct fairq_class *pif_poll_cache;/* cached poll */ 131 struct fairq_class *pif_default; /* default class */ 132 struct fairq_class *pif_classes[FAIRQ_MAXPRI]; /* classes */ 133 }; 134 135 #endif /* _KERNEL */ 136 137 #endif /* _ALTQ_ALTQ_FAIRQ_H_ */ 138