/kernel/linux/linux-5.10/include/net/ |
H A D | red.h | 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 */ member 164 * it might result in an unreasonable qavg for a while. --TGR in red_set_vars() 166 v->qavg = 0; in red_set_vars() 286 v->qavg = 0; in red_restart() 309 * v->qavg *= (1-W)^m in red_calc_qavg_from_idle_time() 320 return v->qavg >> shift; in red_calc_qavg_from_idle_time() 329 us_idle = (v->qavg * (u64)us_idle) >> p->Scell_log; in red_calc_qavg_from_idle_time() 331 if (us_idle < (v->qavg >> in red_calc_qavg_from_idle_time() 370 red_mark_probability(const struct red_parms *p, const struct red_vars *v, unsigned long qavg) red_mark_probability() argument 399 red_cmp_thresh(const struct red_parms *p, unsigned long qavg) red_cmp_thresh() argument 415 red_action(const struct red_parms *p, struct red_vars *v, unsigned long qavg) red_action() argument 447 unsigned long qavg; red_adaptative_algo() local [all...] |
/kernel/linux/linux-6.6/include/net/ |
H A D | red.h | 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 */ member 163 * it might result in an unreasonable qavg for a while. --TGR in red_set_vars() 165 v->qavg = 0; in red_set_vars() 285 v->qavg = 0; in red_restart() 308 * v->qavg *= (1-W)^m in red_calc_qavg_from_idle_time() 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 >> in red_calc_qavg_from_idle_time() 369 red_mark_probability(const struct red_parms *p, const struct red_vars *v, unsigned long qavg) red_mark_probability() argument 398 red_cmp_thresh(const struct red_parms *p, unsigned long qavg) red_cmp_thresh() argument 414 red_action(const struct red_parms *p, struct red_vars *v, unsigned long qavg) red_action() argument 446 unsigned long qavg; red_adaptative_algo() local [all...] |
/kernel/linux/linux-5.10/net/sched/ |
H A D | sch_gred.c | 130 q->vars.qavg = table->wred_set.qavg; in gred_load_wred_set() 137 table->wred_set.qavg = q->vars.qavg; in gred_store_wred_set() 169 unsigned long qavg = 0; in gred_enqueue() local 200 qavg += t->tab[i]->vars.qavg; in gred_enqueue() 211 q->vars.qavg = red_calc_qavg(&q->parms, in gred_enqueue() 221 switch (red_action(&q->parms, &q->vars, q->vars.qavg + qavg)) { in gred_enqueue() 798 unsigned long qavg; gred_dump() local [all...] |
H A D | sch_choke.c | 60 u32 forced_drop; /* Forced drops, qavg > max_thresh */ 61 u32 forced_mark; /* Forced marks, qavg > max_thresh */ 221 q->vars.qavg = red_calc_qavg(p, &q->vars, sch->q.qlen); in choke_enqueue() 226 if (q->vars.qavg <= p->qth_min) in choke_enqueue() 239 if (q->vars.qavg > p->qth_max) { in choke_enqueue() 251 if (red_mark_probability(p, &q->vars, q->vars.qavg)) { in choke_enqueue()
|
H A D | sch_sfq.c | 379 slot->vars.qavg = red_calc_qavg_no_idle_time(q->red_parms, in sfq_enqueue() 384 slot->vars.qavg)) { in sfq_enqueue() 585 slot->vars.qavg = red_calc_qavg(q->red_parms, in sfq_rehash()
|
H A D | sch_red.c | 78 q->vars.qavg = red_calc_qavg(&q->parms, in red_enqueue() 85 switch (red_action(&q->parms, &q->vars, q->vars.qavg)) { in red_enqueue()
|
/kernel/linux/linux-6.6/net/sched/ |
H A D | sch_gred.c | 131 q->vars.qavg = table->wred_set.qavg; in gred_load_wred_set() 138 table->wred_set.qavg = q->vars.qavg; in gred_store_wred_set() 170 unsigned long qavg = 0; in gred_enqueue() local 201 qavg += t->tab[i]->vars.qavg; in gred_enqueue() 212 q->vars.qavg = red_calc_qavg(&q->parms, in gred_enqueue() 222 switch (red_action(&q->parms, &q->vars, q->vars.qavg + qavg)) { in gred_enqueue() 809 unsigned long qavg; gred_dump() local [all...] |
H A D | sch_choke.c | 60 u32 forced_drop; /* Forced drops, qavg > max_thresh */ 61 u32 forced_mark; /* Forced marks, qavg > max_thresh */ 220 q->vars.qavg = red_calc_qavg(p, &q->vars, sch->q.qlen); in choke_enqueue() 225 if (q->vars.qavg <= p->qth_min) in choke_enqueue() 238 if (q->vars.qavg > p->qth_max) { in choke_enqueue() 250 if (red_mark_probability(p, &q->vars, q->vars.qavg)) { in choke_enqueue()
|
H A D | sch_sfq.c | 379 slot->vars.qavg = red_calc_qavg_no_idle_time(q->red_parms, in sfq_enqueue() 384 slot->vars.qavg)) { in sfq_enqueue() 585 slot->vars.qavg = red_calc_qavg(q->red_parms, in sfq_rehash()
|
H A D | sch_red.c | 78 q->vars.qavg = red_calc_qavg(&q->parms, in red_enqueue() 85 switch (red_action(&q->parms, &q->vars, q->vars.qavg)) { in red_enqueue()
|