Home
last modified time | relevance | path

Searched refs:rb_leftmost (Results 1 – 4 of 4) sorted by relevance

/linux-4.1.27/kernel/sched/
Ddeadline.c50 return dl_rq->rb_leftmost == &dl_se->rb_node; in is_leftmost()
777 struct rb_node *leftmost = dl_rq->rb_leftmost; in dec_dl_deadline()
844 dl_rq->rb_leftmost = &dl_se->rb_node; in __enqueue_dl_entity()
859 if (dl_rq->rb_leftmost == &dl_se->rb_node) { in __dequeue_dl_entity()
863 dl_rq->rb_leftmost = next_node; in __dequeue_dl_entity()
1086 struct rb_node *left = dl_rq->rb_leftmost; in pick_next_dl_entity()
1214 struct rb_node *next_node = rq->dl.rb_leftmost; in pick_next_earliest_dl_task()
Dsched.h348 struct rb_node *rb_leftmost; member
477 struct rb_node *rb_leftmost; member
Ddebug.c190 if (cfs_rq->rb_leftmost) in print_cfs_rq()
Dfair.c469 if (cfs_rq->rb_leftmost) { in update_min_vruntime()
470 struct sched_entity *se = rb_entry(cfs_rq->rb_leftmost, in update_min_vruntime()
521 cfs_rq->rb_leftmost = &se->run_node; in __enqueue_entity()
529 if (cfs_rq->rb_leftmost == &se->run_node) { in __dequeue_entity()
533 cfs_rq->rb_leftmost = next_node; in __dequeue_entity()
541 struct rb_node *left = cfs_rq->rb_leftmost; in __pick_first_entity()