Lines Matching full:eligible
128 struct rb_node el_node; /* qdisc's eligible tree member */
139 u64 cl_e; /* eligible time */
159 struct runtime_sc cl_eligible; /* eligible curve */
173 struct rb_root eligible; /* eligible tree */ member
181 * eligible tree holds backlogged classes being sorted by their eligible times.
182 * there is one eligible tree per hfsc instance.
188 struct rb_node **p = &cl->sched->eligible.rb_node; in eltree_insert()
201 rb_insert_color(&cl->el_node, &cl->sched->eligible); in eltree_insert()
207 rb_erase(&cl->el_node, &cl->sched->eligible); in eltree_remove()
217 /* find the class with the minimum deadline among the eligible classes */
224 for (n = rb_first(&q->eligible); n != NULL; n = rb_next(n)) { in eltree_get_mindl()
234 /* find the class with minimum eligible time among the eligible classes */
240 n = rb_first(&q->eligible); in eltree_get_minel()
618 * update the eligible curve. in init_ed()
1416 q->eligible = RB_ROOT; in hfsc_init_qdisc()
1499 q->eligible = RB_ROOT; in hfsc_reset_qdisc()
1606 * if there are eligible classes, use real-time criteria. in hfsc_dequeue()
1608 * the eligible classes. in hfsc_dequeue()