Searched refs:leftmost (Results 1 – 4 of 4) sorted by relevance
70 account for possible wraparounds). CFS picks the "leftmost" task from this74 to become the "leftmost task" and thus get on the CPU within a deterministic81 becomes the "leftmost task" of the time-ordered rbtree it maintains (plus a82 small amount of "granularity" distance relative to the leftmost task so that we83 do not over-schedule tasks and trash the cache), then the new leftmost task is
952 int ret, leftmost; in __hrtimer_start_range_ns() local980 leftmost = enqueue_hrtimer(timer, new_base); in __hrtimer_start_range_ns()988 if (leftmost && new_base->cpu_base == &__get_cpu_var(hrtimer_bases)) in __hrtimer_start_range_ns()
483 int leftmost = 1; in __enqueue_entity() local499 leftmost = 0; in __enqueue_entity()507 if (leftmost) in __enqueue_entity()
796 is 31. In the case of node names, this is only the leftmost part of