Lines Matching refs:left
736 * For this to be so, the result of this function must have a left bias.
878 * se->min_deadline = min(se->deadline, left->min_deadline, right->min_deadline)
915 struct rb_node *left = rb_first_cached(&cfs_rq->tasks_timeline);
917 if (!left)
920 return __node_2_se(left);
938 * se->min_deadline = min(se->deadline, se->{left,right}->min_deadline)
964 * If this entity is not eligible, try the left subtree.
978 * Every se in a left branch is eligible, keep track of the
982 struct sched_entity *left = __node_2_se(node->rb_left);
984 if (!best_left || deadline_gt(min_deadline, best_left, left))
985 best_left = left;
988 * min_deadline is in the left branch. rb_left and all
992 if (left->min_deadline == se->min_deadline)
1023 /* min_deadline is in the left branch */
1041 struct sched_entity *left = __pick_first_entity(cfs_rq);
1042 if (left) {
1044 return left;
1151 * only 1/2 of the left utilization budget:
2861 * just one node left in each "group", the
7358 * there are no idle cores left in the system; tracked through