Lines Matching +full:drop +full:- +full:out
1 /*-
2 * Copyright (C) 1998-2003
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26 /*-
27 * Copyright (c) 1990-1994 Regents of the University of California.
55 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
96 * RIO: RED with IN/OUT bit
100 * http://diffserv.lcs.mit.edu/Papers/exp-alloc-ddc-wf.{ps,pdf}
102 * this implementation is extended to support more than 2 drop precedence
108 * (classes can be mapped to CBQ or H-FSC classes.)
111 * +---+---+---+---+---+---+---+---+
113 * +---+---+---+---+---+---+---+---+
120 * low drop prec: 01
121 * medium drop prec: 10
122 * high drop prec: 01
137 /* fixed-point uses 12-bit decimal places */
138 #define FP_SHIFT 12 /* fixed-point shift */
140 /* red parameters for drop probability */
141 #define INV_P_MAX 10 /* inverse of max drop probability */
151 delta = (a)->tv_usec - (b)->tv_usec; \
152 if ((xxs = (a)->tv_sec - (b)->tv_sec) != 0) { \
162 xxs--; \
170 { TH_MAX * 2 + TH_MIN, TH_MAX * 3, INV_P_MAX }, /* low drop precedence */
171 { TH_MAX + TH_MIN, TH_MAX * 2, INV_P_MAX }, /* medium drop precedence */
172 { TH_MIN, TH_MAX, INV_P_MAX } /* high drop precedence */
189 rp->rio_flags = flags; in rio_alloc()
192 rp->rio_pkttime = 800; in rio_alloc()
194 rp->rio_pkttime = pkttime; in rio_alloc()
197 rp->rio_weight = weight; in rio_alloc()
200 rp->rio_weight = W_WEIGHT; in rio_alloc()
203 npkts_per_sec = 1000000 / rp->rio_pkttime; in rio_alloc()
206 rp->rio_weight = W_WEIGHT_2; in rio_alloc()
209 rp->rio_weight = W_WEIGHT_1; in rio_alloc()
214 w = rp->rio_weight; in rio_alloc()
217 rp->rio_wshift = i; in rio_alloc()
218 w = 1 << rp->rio_wshift; in rio_alloc()
219 if (w != rp->rio_weight) { in rio_alloc()
221 rp->rio_weight, w); in rio_alloc()
222 rp->rio_weight = w; in rio_alloc()
226 rp->rio_wtab = wtab_alloc(rp->rio_weight); in rio_alloc()
229 struct dropprec_state *prec = &rp->rio_precstate[i]; in rio_alloc()
231 prec->avg = 0; in rio_alloc()
232 prec->idle = 1; in rio_alloc()
235 prec->inv_pmax = default_rio_params[i].inv_pmax; in rio_alloc()
237 prec->inv_pmax = params[i].inv_pmax; in rio_alloc()
239 prec->th_min = default_rio_params[i].th_min; in rio_alloc()
241 prec->th_min = params[i].th_min; in rio_alloc()
243 prec->th_max = default_rio_params[i].th_max; in rio_alloc()
245 prec->th_max = params[i].th_max; in rio_alloc()
251 prec->th_min_s = prec->th_min << (rp->rio_wshift + FP_SHIFT); in rio_alloc()
252 prec->th_max_s = prec->th_max << (rp->rio_wshift + FP_SHIFT); in rio_alloc()
256 * probd = (2 * (TH_MAX-TH_MIN) / pmax) in fixed-point in rio_alloc()
258 prec->probd = (2 * (prec->th_max - prec->th_min) in rio_alloc()
259 * prec->inv_pmax) << FP_SHIFT; in rio_alloc()
261 microtime(&prec->last); in rio_alloc()
270 wtab_destroy(rp->rio_wtab); in rio_destroy()
280 bcopy(&rp->q_stats[i], sp, sizeof(struct redstats)); in rio_getstats()
281 sp->q_avg = rp->rio_precstate[i].avg >> rp->rio_wshift; in rio_getstats()
288 * internally, a drop precedence value is converted to an index
298 return ((dpindex >> 3) - 1); in dscp2index()
304 * kludge: when a packet is dequeued, we need to know its drop precedence
305 * in order to keep the queue length of each drop precedence.
309 do { (m)->m_pkthdr.rcvif = (void *)((long)(idx)); } while (0)
311 ({ long idx; idx = (long)((m)->m_pkthdr.rcvif); \
312 (m)->m_pkthdr.rcvif = NULL; idx; })
329 * update avg of the precedence states whose drop precedence in rio_addq()
330 * is larger than or equal to the drop precedence of the packet in rio_addq()
334 prec = &rp->rio_precstate[i]; in rio_addq()
335 avg = prec->avg; in rio_addq()
336 if (prec->idle) { in rio_addq()
337 prec->idle = 0; in rio_addq()
340 t = (now.tv_sec - prec->last.tv_sec); in rio_addq()
345 (now.tv_usec - prec->last.tv_usec); in rio_addq()
346 n = t / rp->rio_pkttime; in rio_addq()
347 /* calculate (avg = (1 - Wq)^n * avg) */ in rio_addq()
350 pow_w(rp->rio_wtab, n); in rio_addq()
354 /* run estimator. (avg is scaled by WEIGHT in fixed-point) */ in rio_addq()
355 avg += (prec->qlen << FP_SHIFT) - (avg >> rp->rio_wshift); in rio_addq()
356 prec->avg = avg; /* save the new value */ in rio_addq()
361 prec->count++; in rio_addq()
364 prec = &rp->rio_precstate[dpindex]; in rio_addq()
365 avg = prec->avg; in rio_addq()
367 /* see if we drop early */ in rio_addq()
369 if (avg >= prec->th_min_s && prec->qlen > 1) { in rio_addq()
370 if (avg >= prec->th_max_s) { in rio_addq()
371 /* avg >= th_max: forced drop */ in rio_addq()
373 } else if (prec->old == 0) { in rio_addq()
375 prec->count = 1; in rio_addq()
376 prec->old = 1; in rio_addq()
377 } else if (drop_early((avg - prec->th_min_s) >> rp->rio_wshift, in rio_addq()
378 prec->probd, prec->count)) { in rio_addq()
379 /* unforced drop by red */ in rio_addq()
384 prec->old = 0; in rio_addq()
388 * if the queue length hits the hard limit, it's a forced drop. in rio_addq()
394 /* always drop incoming packet (as opposed to randomdrop) */ in rio_addq()
396 rp->rio_precstate[i].count = 0; in rio_addq()
399 rp->q_stats[dpindex].drop_unforced++; in rio_addq()
401 rp->q_stats[dpindex].drop_forced++; in rio_addq()
402 PKTCNTR_ADD(&rp->q_stats[dpindex].drop_cnt, m_pktlen(m)); in rio_addq()
405 return (-1); in rio_addq()
409 rp->rio_precstate[i].qlen++; in rio_addq()
411 /* save drop precedence index in mbuf hdr */ in rio_addq()
414 if (rp->rio_flags & RIOF_CLEARDSCP) in rio_addq()
423 PKTCNTR_ADD(&rp->q_stats[dpindex].xmit_cnt, m_pktlen(m)); in rio_addq()
439 if (--rp->rio_precstate[i].qlen == 0) { in rio_getq()
440 if (rp->rio_precstate[i].idle == 0) { in rio_getq()
441 rp->rio_precstate[i].idle = 1; in rio_getq()
442 microtime(&rp->rio_precstate[i].last); in rio_getq()