eligible          173 net/sched/sch_hfsc.c 	struct rb_root eligible;		/* eligible tree */
eligible          188 net/sched/sch_hfsc.c 	struct rb_node **p = &cl->sched->eligible.rb_node;
eligible          201 net/sched/sch_hfsc.c 	rb_insert_color(&cl->el_node, &cl->sched->eligible);
eligible          207 net/sched/sch_hfsc.c 	rb_erase(&cl->el_node, &cl->sched->eligible);
eligible          224 net/sched/sch_hfsc.c 	for (n = rb_first(&q->eligible); n != NULL; n = rb_next(n)) {
eligible          240 net/sched/sch_hfsc.c 	n = rb_first(&q->eligible);
eligible         1402 net/sched/sch_hfsc.c 	q->eligible = RB_ROOT;
eligible         1485 net/sched/sch_hfsc.c 	q->eligible = RB_ROOT;
eligible         2619 virt/kvm/kvm_main.c 	bool eligible;
eligible         2621 virt/kvm/kvm_main.c 	eligible = !vcpu->spin_loop.in_spin_loop ||
eligible         2627 virt/kvm/kvm_main.c 	return eligible;