150 	unsigned long	qavg;		/* Average queue length: Wlog scaled */  member
165 	v->qavg		= 0;  in red_set_vars()
285 	v->qavg = 0;  in red_restart()
319 		return v->qavg >> shift;  in red_calc_qavg_from_idle_time()
328 		us_idle = (v->qavg * (u64)us_idle) >> p->Scell_log;  in red_calc_qavg_from_idle_time()
330 		if (us_idle < (v->qavg >> 1))  in red_calc_qavg_from_idle_time()
331 			return v->qavg - us_idle;  in red_calc_qavg_from_idle_time()
333 			return v->qavg >> 1;  in red_calc_qavg_from_idle_time()
350 	return v->qavg + (backlog - (v->qavg >> p->Wlog));  in red_calc_qavg_no_idle_time()
371 				       unsigned long qavg)  in red_mark_probability()  argument
389 	return !(((qavg - p->qth_min) >> p->Wlog) * v->qcount < v->qR);  in red_mark_probability()
398 static inline int red_cmp_thresh(const struct red_parms *p, unsigned long qavg)  in red_cmp_thresh()  argument
400 	if (qavg < p->qth_min)  in red_cmp_thresh()
402 	else if (qavg >= p->qth_max)  in red_cmp_thresh()
416 			     unsigned long qavg)  in red_action()  argument
418 	switch (red_cmp_thresh(p, qavg)) {  in red_action()
425 				if (red_mark_probability(p, v, qavg)) {  in red_action()
446 	unsigned long qavg;  in red_adaptative_algo()  local
449 	qavg = v->qavg;  in red_adaptative_algo()
451 		qavg = red_calc_qavg_from_idle_time(p, v);  in red_adaptative_algo()
454 	qavg >>= p->Wlog;  in red_adaptative_algo()
456 	if (qavg > p->target_max && p->max_P <= MAX_P_MAX)  in red_adaptative_algo()
458 	else if (qavg < p->target_min && p->max_P >= MAX_P_MIN)  in red_adaptative_algo()