Searched refs:eligible (Results 1 – 8 of 8) sorted by relevance
179 struct rb_root eligible; /* eligible tree */ member196 struct rb_node **p = &cl->sched->eligible.rb_node; in eltree_insert()209 rb_insert_color(&cl->el_node, &cl->sched->eligible); in eltree_insert()215 rb_erase(&cl->el_node, &cl->sched->eligible); in eltree_remove()232 for (n = rb_first(&q->eligible); n != NULL; n = rb_next(n)) { in eltree_get_mindl()248 n = rb_first(&q->eligible); in eltree_get_minel()1448 q->eligible = RB_ROOT; in hfsc_init_qdisc()1532 q->eligible = RB_ROOT; in hfsc_reset_qdisc()
1891 bool eligible; in kvm_vcpu_eligible_for_directed_yield() local1893 eligible = !vcpu->spin_loop.in_spin_loop || in kvm_vcpu_eligible_for_directed_yield()1899 return eligible; in kvm_vcpu_eligible_for_directed_yield()
184 This function chooses the most appropriate task eligible to run next.
209 larger checksum coverage lengths, each eligible fragment needs to be
19 DMA-eligible devices to the controller itself. Whenever the device
348 default and in the common case most cgroups are eligible for the
160 This tunable is used to define when dirty data is old enough to be eligible
866 eligible to be reclaimed for other purposes