13 rq_sched_info_arrive(struct rq *rq, unsigned long long delta)  in rq_sched_info_arrive()  argument
15 	if (rq) {  in rq_sched_info_arrive()
16 		rq->rq_sched_info.run_delay += delta;  in rq_sched_info_arrive()
17 		rq->rq_sched_info.pcount++;  in rq_sched_info_arrive()
25 rq_sched_info_depart(struct rq *rq, unsigned long long delta)  in rq_sched_info_depart()  argument
27 	if (rq)  in rq_sched_info_depart()
28 		rq->rq_cpu_time += delta;  in rq_sched_info_depart()
32 rq_sched_info_dequeue(struct rq *rq, unsigned long long delta)  in rq_sched_info_dequeue()  argument
34 	if (rq)  in rq_sched_info_dequeue()
35 		rq->rq_sched_info.run_delay += delta;  in rq_sched_info_dequeue()
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) { }  in rq_sched_info_arrive()  argument
73 static inline void rq_sched_info_dequeue(struct rq *rq, unsigned long long delta) { }  in rq_sched_info_dequeue()  argument
74 static inline void rq_sched_info_depart  (struct rq *rq, unsigned long long delta) { }  in rq_sched_info_depart()  argument
85 # define __update_stats_wait_start(rq, p, stats)       do { } while (0)  argument
86 # define __update_stats_wait_end(rq, p, stats)         do { } while (0)  argument
87 # define __update_stats_enqueue_sleeper(rq, p, stats)  do { } while (0)  argument
177 		struct rq *rq;  in psi_ttwu_dequeue()  local
185 		rq = __task_rq_lock(p, &rf);  in psi_ttwu_dequeue()
188 		__task_rq_unlock(rq, &rf);  in psi_ttwu_dequeue()
219 static inline void sched_info_dequeue(struct rq *rq, struct task_struct *t)  in sched_info_dequeue()  argument
226 	delta = rq_clock(rq) - t->sched_info.last_queued;  in sched_info_dequeue()
230 	rq_sched_info_dequeue(rq, delta);  in sched_info_dequeue()
238 static void sched_info_arrive(struct rq *rq, struct task_struct *t)  in sched_info_arrive()  argument
245 	now = rq_clock(rq);  in sched_info_arrive()
252 	rq_sched_info_arrive(rq, delta);  in sched_info_arrive()
260 static inline void sched_info_enqueue(struct rq *rq, struct task_struct *t)  in sched_info_enqueue()  argument
263 		t->sched_info.last_queued = rq_clock(rq);  in sched_info_enqueue()
274 static inline void sched_info_depart(struct rq *rq, struct task_struct *t)  in sched_info_depart()  argument
276 	unsigned long long delta = rq_clock(rq) - t->sched_info.last_arrival;  in sched_info_depart()
278 	rq_sched_info_depart(rq, delta);  in sched_info_depart()
281 		sched_info_enqueue(rq, t);  in sched_info_depart()
290 sched_info_switch(struct rq *rq, struct task_struct *prev, struct task_struct *next)  in sched_info_switch()  argument
297 	if (prev != rq->idle)  in sched_info_switch()
298 		sched_info_depart(rq, prev);  in sched_info_switch()
300 	if (next != rq->idle)  in sched_info_switch()
301 		sched_info_arrive(rq, next);  in sched_info_switch()
305 # define sched_info_enqueue(rq, t)	do { } while (0)  argument
306 # define sched_info_dequeue(rq, t)	do { } while (0)  argument
307 # define sched_info_switch(rq, t, next)	do { } while (0)  argument