Searched refs:leftmost (Results 1 – 7 of 7) sorted by relevance
172 int leftmost = 1; in rt_mutex_enqueue() local181 leftmost = 0; in rt_mutex_enqueue()185 if (leftmost) in rt_mutex_enqueue()211 int leftmost = 1; in rt_mutex_enqueue_pi() local220 leftmost = 0; in rt_mutex_enqueue_pi()224 if (leftmost) in rt_mutex_enqueue_pi()
163 int leftmost = 1; in enqueue_pushable_dl_task() local175 leftmost = 0; in enqueue_pushable_dl_task()179 if (leftmost) in enqueue_pushable_dl_task()777 struct rb_node *leftmost = dl_rq->rb_leftmost; in dec_dl_deadline() local780 entry = rb_entry(leftmost, struct sched_dl_entity, rb_node); in dec_dl_deadline()828 int leftmost = 1; in __enqueue_dl_entity() local839 leftmost = 0; in __enqueue_dl_entity()843 if (leftmost) in __enqueue_dl_entity()
496 int leftmost = 1; in __enqueue_entity() local512 leftmost = 0; in __enqueue_entity()520 if (leftmost) in __enqueue_entity()
69 p->se.vruntime key. CFS picks the "leftmost" task from this tree and sticks to it.72 to become the "leftmost task" and thus get on the CPU within a deterministic79 becomes the "leftmost task" of the time-ordered rbtree it maintains (plus a80 small amount of "granularity" distance relative to the leftmost task so that we81 do not over-schedule tasks and trash the cache), then the new leftmost task is
942 int ret, leftmost; in __hrtimer_start_range_ns() local970 leftmost = enqueue_hrtimer(timer, new_base); in __hrtimer_start_range_ns()972 if (!leftmost) { in __hrtimer_start_range_ns()
282 * Iterate to find the leftmost such node N.294 return node; /* node is leftmost match */
827 is 31. In the case of node names, this is only the leftmost part of