Lines Matching refs:rq

13 rq_sched_info_arrive(struct rq *rq, unsigned long long delta)
15 if (rq) {
16 rq->rq_sched_info.run_delay += delta;
17 rq->rq_sched_info.pcount++;
25 rq_sched_info_depart(struct rq *rq, unsigned long long delta)
27 if (rq)
28 rq->rq_cpu_time += delta;
32 rq_sched_info_dequeue(struct rq *rq, unsigned long long delta)
34 if (rq)
35 rq->rq_sched_info.run_delay += delta;
47 void __update_stats_wait_start(struct rq *rq, struct task_struct *p,
50 void __update_stats_wait_end(struct rq *rq, struct task_struct *p,
52 void __update_stats_enqueue_sleeper(struct rq *rq, struct task_struct *p,
72 static inline void rq_sched_info_arrive (struct rq *rq, unsigned long long delta) { }
73 static inline void rq_sched_info_dequeue(struct rq *rq, unsigned long long delta) { }
74 static inline void rq_sched_info_depart (struct rq *rq, unsigned long long delta) { }
85 # define __update_stats_wait_start(rq, p, stats) do { } while (0)
86 # define __update_stats_wait_end(rq, p, stats) do { } while (0)
87 # define __update_stats_enqueue_sleeper(rq, p, stats) do { } while (0)
170 struct rq *rq;
172 rq = __task_rq_lock(p, &rf);
174 __task_rq_unlock(rq, &rf);
202 * from dequeue_task() to account for possible rq->clock skew across CPUs. The
205 static inline void sched_info_dequeue(struct rq *rq, struct task_struct *t)
212 delta = rq_clock(rq) - t->sched_info.last_queued;
216 rq_sched_info_dequeue(rq, delta);
224 static void sched_info_arrive(struct rq *rq, struct task_struct *t)
231 now = rq_clock(rq);
238 rq_sched_info_arrive(rq, delta);
246 static inline void sched_info_enqueue(struct rq *rq, struct task_struct *t)
249 t->sched_info.last_queued = rq_clock(rq);
260 static inline void sched_info_depart(struct rq *rq, struct task_struct *t)
262 unsigned long long delta = rq_clock(rq) - t->sched_info.last_arrival;
264 rq_sched_info_depart(rq, delta);
267 sched_info_enqueue(rq, t);
276 sched_info_switch(struct rq *rq, struct task_struct *prev, struct task_struct *next)
283 if (prev != rq->idle)
284 sched_info_depart(rq, prev);
286 if (next != rq->idle)
287 sched_info_arrive(rq, next);
291 # define sched_info_enqueue(rq, t) do { } while (0)
292 # define sched_info_dequeue(rq, t) do { } while (0)
293 # define sched_info_switch(rq, t, next) do { } while (0)