Lines Matching refs:curr
101 rt_rq->highest_prio.curr = MAX_RT_PRIO;
176 rt_rq->highest_prio.curr = MAX_RT_PRIO;
289 return rq->rt.highest_prio.curr > prev->prio && !cpu_isolated(cpu_of(rq));
558 struct task_struct *curr = rq_of_rt_rq(rt_rq)->curr;
573 if (rt_rq->highest_prio.curr < curr->prio) {
954 if (rt_rq->rt_nr_running && rq->curr == rq->idle) {
991 return rt_rq->highest_prio.curr;
1061 struct task_struct *curr = rq->curr;
1062 struct sched_rt_entity *rt_se = &curr->rt;
1066 if (curr->sched_class != &rt_sched_class) {
1071 delta_exec = now - curr->se.exec_start;
1076 schedstat_set(curr->se.statistics.exec_max, max(curr->se.statistics.exec_max, delta_exec));
1078 curr->se.sum_exec_runtime += delta_exec;
1079 account_group_exec_runtime(curr, delta_exec);
1081 curr->se.exec_start = now;
1082 cgroup_account_cputime(curr, delta_exec);
1177 if (rq->online && rt_rq->highest_prio.curr != prev_prio) {
1178 cpupri_set(&rq->rd->cpupri, rq->cpu, rt_rq->highest_prio.curr);
1196 int prev_prio = rt_rq->highest_prio.curr;
1199 rt_rq->highest_prio.curr = prio;
1207 int prev_prio = rt_rq->highest_prio.curr;
1219 rt_rq->highest_prio.curr = sched_find_first_bit(array->bitmap);
1222 rt_rq->highest_prio.curr = MAX_RT_PRIO;
1456 return sync && task_has_rt_policy(rq->curr) && p->prio <= rq->rt.highest_prio.next && rq->rt.rt_nr_running <= 0x2;
1527 requeue_task_rt(rq, rq->curr, 0);
1535 struct task_struct *curr;
1551 curr = READ_ONCE(rq->curr); /* unlocked access */
1581 test = curr && unlikely(rt_task(curr)) && (curr->nr_cpus_allowed < 0x2 || curr->prio <= p->prio);
1605 if (target != -1 && p->prio < cpu_rq(target)->rt.highest_prio.curr) {
1623 if (rq->curr->nr_cpus_allowed == 1 || !cpupri_find(&rq->rd->cpupri, rq->curr, NULL)) {
1667 if (p->prio < rq->curr->prio) {
1685 if (p->prio == rq->curr->prio && !test_tsk_need_resched(rq->curr)) {
1707 if (rq->curr->sched_class != &rt_sched_class) {
2112 if (lowest_rq->rt.highest_prio.curr <= task->prio) {
2138 if (lowest_rq->rt.highest_prio.curr > task->prio) {
2171 if (WARN_ON(next_task == rq->curr)) {
2180 if (unlikely(next_task->prio < rq->curr->prio)) {
2460 if (src_rq->rt.highest_prio.next >= this_rq->rt.highest_prio.curr) {
2480 if (p && (p->prio < this_rq->rt.highest_prio.curr)) {
2481 WARN_ON(p == src_rq->curr);
2492 if (p->prio < src_rq->curr->prio) {
2523 bool need_to_push = !task_running(rq, p) && !test_tsk_need_resched(rq->curr) && p->nr_cpus_allowed > 1 &&
2524 (dl_task(rq->curr) || rt_task(rq->curr)) &&
2525 (rq->curr->nr_cpus_allowed < 2 || rq->curr->prio <= p->prio);
2540 cpupri_set(&rq->rd->cpupri, rq->cpu, rq->rt.highest_prio.curr);
2613 if (p->prio < rq->curr->prio && cpu_online(cpu_of(rq))) {
2629 if (rq->curr == p) {
2643 if (p->prio > rq->rt.highest_prio.curr) {
2658 if (p->prio < rq->curr->prio) {
2698 * and everything must be accessed through the @rq and @curr passed in