net/sched/sch_hfsc.c

127 	struct rb_node el_node;		/* qdisc's eligible tree member */
138 	u64	cl_e;			/* eligible time */
158 	struct runtime_sc cl_eligible;	/* eligible curve */
172 	struct rb_root eligible;		/* eligible tree */  member
180  * eligible tree holds backlogged classes being sorted by their eligible times.
181  * there is one eligible tree per hfsc instance.
187 	struct rb_node **p = &cl->sched->eligible.rb_node;  in eltree_insert()
200 	rb_insert_color(&cl->el_node, &cl->sched->eligible);  in eltree_insert()
206 	rb_erase(&cl->el_node, &cl->sched->eligible);  in eltree_remove()
216 /* find the class with the minimum deadline among the eligible classes */
223 	for (n = rb_first(&q->eligible); n != NULL; n = rb_next(n)) {  in eltree_get_mindl()
233 /* find the class with minimum eligible time among the eligible classes */
239 	n = rb_first(&q->eligible);  in eltree_get_minel()
617 	 * update the eligible curve.  in init_ed()
1411 	q->eligible = RB_ROOT;  in hfsc_init_qdisc()
1493 	q->eligible = RB_ROOT;  in hfsc_reset_qdisc()
1600 	 * if there are eligible classes, use real-time criteria.  in hfsc_dequeue()
1602 	 * the eligible classes.  in hfsc_dequeue()