Lines Matching defs:qavg
122 u32 forced_drop; /* Forced drops, qavg > max_thresh */
123 u32 forced_mark; /* Forced marks, qavg > max_thresh */
150 unsigned long qavg; /* Average queue length: Wlog scaled */
163 * it might result in an unreasonable qavg for a while. --TGR
165 v->qavg = 0;
285 v->qavg = 0;
308 * v->qavg *= (1-W)^m
319 return v->qavg >> shift;
328 us_idle = (v->qavg * (u64)us_idle) >> p->Scell_log;
330 if (us_idle < (v->qavg >> 1))
331 return v->qavg - us_idle;
333 return v->qavg >> 1;
342 * NOTE: v->qavg is fixed point number with point at Wlog.
346 * qavg = qavg*(1-W) + backlog*W;
350 return v->qavg + (backlog - (v->qavg >> p->Wlog));
371 unsigned long qavg)
381 Taking into account, that qavg have fixed
385 max_P*(qavg - qth_min)/(qth_max-qth_min) < rnd/qcount
389 return !(((qavg - p->qth_min) >> p->Wlog) * v->qcount < v->qR);
398 static inline int red_cmp_thresh(const struct red_parms *p, unsigned long qavg)
400 if (qavg < p->qth_min)
402 else if (qavg >= p->qth_max)
416 unsigned long qavg)
418 switch (red_cmp_thresh(p, qavg)) {
425 if (red_mark_probability(p, v, qavg)) {
446 unsigned long qavg;
449 qavg = v->qavg;
451 qavg = red_calc_qavg_from_idle_time(p, v);
453 /* v->qavg is fixed point number with point at Wlog */
454 qavg >>= p->Wlog;
456 if (qavg > p->target_max && p->max_P <= MAX_P_MAX)
458 else if (qavg < p->target_min && p->max_P >= MAX_P_MIN)