Lines Matching full:tab
54 struct gred_sched_data *tab[MAX_DPs]; member
99 struct gred_sched_data *q = table->tab[i]; in gred_wred_mode_check()
106 if (table->tab[n] && table->tab[n]->prio == q->prio) in gred_wred_mode_check()
160 if (dp >= t->DPs || (q = t->tab[dp]) == NULL) { in gred_enqueue()
163 q = t->tab[dp]; in gred_enqueue()
186 if (t->tab[i] && t->tab[i]->prio < q->prio && in gred_enqueue()
187 !red_is_idling(&t->tab[i]->vars)) in gred_enqueue()
188 qavg += t->tab[i]->vars.qavg; in gred_enqueue()
259 if (dp >= t->DPs || (q = t->tab[dp]) == NULL) { in gred_dequeue()
288 struct gred_sched_data *q = t->tab[i]; in gred_reset()
341 if (table->tab[i]) { in gred_change_table_def()
344 gred_destroy_vq(table->tab[i]); in gred_change_table_def()
345 table->tab[i] = NULL; in gred_change_table_def()
358 struct gred_sched_data *q = table->tab[dp]; in gred_change_vq()
364 table->tab[dp] = q = *prealloc; in gred_change_vq()
437 if (table->tab[table->def]) in gred_change()
438 def_prio = table->tab[table->def]->prio; in gred_change()
515 struct gred_sched_data *q = table->tab[i]; in gred_dump()
530 struct gred_sched_data *q = table->tab[i]; in gred_dump()
588 if (table->tab[i]) in gred_destroy()
589 gred_destroy_vq(table->tab[i]); in gred_destroy()