Lines Matching defs:qavg
122 u32 forced_drop; /* Forced drops, qavg > max_thresh */
123 u32 forced_mark; /* Forced marks, qavg > max_thresh */
151 unsigned long qavg; /* Average queue length: Wlog scaled */
164 * it might result in an unreasonable qavg for a while. --TGR
166 v->qavg = 0;
286 v->qavg = 0;
309 * v->qavg *= (1-W)^m
320 return v->qavg >> shift;
329 us_idle = (v->qavg * (u64)us_idle) >> p->Scell_log;
331 if (us_idle < (v->qavg >> 1))
332 return v->qavg - us_idle;
334 return v->qavg >> 1;
343 * NOTE: v->qavg is fixed point number with point at Wlog.
347 * qavg = qavg*(1-W) + backlog*W;
351 return v->qavg + (backlog - (v->qavg >> p->Wlog));
372 unsigned long qavg)
382 Taking into account, that qavg have fixed
386 max_P*(qavg - qth_min)/(qth_max-qth_min) < rnd/qcount
390 return !(((qavg - p->qth_min) >> p->Wlog) * v->qcount < v->qR);
399 static inline int red_cmp_thresh(const struct red_parms *p, unsigned long qavg)
401 if (qavg < p->qth_min)
403 else if (qavg >= p->qth_max)
417 unsigned long qavg)
419 switch (red_cmp_thresh(p, qavg)) {
426 if (red_mark_probability(p, v, qavg)) {
447 unsigned long qavg;
450 qavg = v->qavg;
452 qavg = red_calc_qavg_from_idle_time(p, v);
454 /* v->qavg is fixed point number with point at Wlog */
455 qavg >>= p->Wlog;
457 if (qavg > p->target_max && p->max_P <= MAX_P_MAX)
459 else if (qavg < p->target_min && p->max_P >= MAX_P_MIN)