Lines Matching defs:task_rq
280 if (prio_less(b, a, !!task_rq(a)->core->core_forceidle_count))
739 rq = task_rq(p);
741 if (likely(rq == task_rq(p) && !task_on_rq_migrating(p))) {
761 rq = task_rq(p);
767 * [S] ->on_rq = MIGRATING [L] rq = task_rq()
769 * [S] ->cpu = new_cpu [L] task_rq()
777 * dependency headed by '[L] rq = task_rq()' and the acquire
780 if (likely(rq == task_rq(p) && !task_on_rq_migrating(p))) {
1542 p->sched_class->reweight_task(task_rq(p), p, &lw);
2357 rq = task_rq(p);
2648 * If task_rq(p) != rq, it cannot be migrated here, because we're
2652 if (task_rq(p) == rq) {
2733 if (task_rq(p) != rq)
2752 if (task_rq(p) == rq) {
3368 * Furthermore, all task_rq users should acquire both locks, see
3372 lockdep_is_held(__rq_lockp(task_rq(p)))));
3401 src_rq = task_rq(p);
3821 atomic_dec(&task_rq(p)->nr_iowait);
3857 * By taking task_rq(p)->lock we serialize against schedule(), if @p->on_rq
4239 * Tries really hard to only take one task_rq(p)->lock for performance.
4397 atomic_dec(&task_rq(p)->nr_iowait);
5657 struct sched_entity *curr = task_rq(p)->cfs.curr;
6169 return (task_rq(t)->idle == t);
8417 if (task_rq(p) == rq && task_on_rq_queued(p))
10937 if (task_rq(t)->curr == t)
11180 struct rq *rq = task_rq(p);
11227 struct rq *rq = task_rq(p);