9 rq_sched_info_arrive(struct rq *rq, unsigned long long delta)  in rq_sched_info_arrive()  argument
11 	if (rq) {  in rq_sched_info_arrive()
12 		rq->rq_sched_info.run_delay += delta;  in rq_sched_info_arrive()
13 		rq->rq_sched_info.pcount++;  in rq_sched_info_arrive()
21 rq_sched_info_depart(struct rq *rq, unsigned long long delta)  in rq_sched_info_depart()  argument
23 	if (rq)  in rq_sched_info_depart()
24 		rq->rq_cpu_time += delta;  in rq_sched_info_depart()
28 rq_sched_info_dequeue(struct rq *rq, unsigned long long delta)  in rq_sched_info_dequeue()  argument
30 	if (rq)  in rq_sched_info_dequeue()
31 		rq->rq_sched_info.run_delay += delta;  in rq_sched_info_dequeue()
44 static inline void rq_sched_info_arrive  (struct rq *rq, unsigned long long delta) { }  in rq_sched_info_arrive()  argument
45 static inline void rq_sched_info_dequeue(struct rq *rq, unsigned long long delta) { }  in rq_sched_info_dequeue()  argument
46 static inline void rq_sched_info_depart  (struct rq *rq, unsigned long long delta) { }  in rq_sched_info_depart()  argument
118 		struct rq *rq;  in psi_ttwu_dequeue()  local
126 		rq = __task_rq_lock(p, &rf);  in psi_ttwu_dequeue()
129 		__task_rq_unlock(rq, &rf);  in psi_ttwu_dequeue()
159 static inline void sched_info_dequeue(struct rq *rq, struct task_struct *t)  in sched_info_dequeue()  argument
166 	delta = rq_clock(rq) - t->sched_info.last_queued;  in sched_info_dequeue()
170 	rq_sched_info_dequeue(rq, delta);  in sched_info_dequeue()
178 static void sched_info_arrive(struct rq *rq, struct task_struct *t)  in sched_info_arrive()  argument
185 	now = rq_clock(rq);  in sched_info_arrive()
192 	rq_sched_info_arrive(rq, delta);  in sched_info_arrive()
200 static inline void sched_info_enqueue(struct rq *rq, struct task_struct *t)  in sched_info_enqueue()  argument
203 		t->sched_info.last_queued = rq_clock(rq);  in sched_info_enqueue()
214 static inline void sched_info_depart(struct rq *rq, struct task_struct *t)  in sched_info_depart()  argument
216 	unsigned long long delta = rq_clock(rq) - t->sched_info.last_arrival;  in sched_info_depart()
218 	rq_sched_info_depart(rq, delta);  in sched_info_depart()
221 		sched_info_enqueue(rq, t);  in sched_info_depart()
230 sched_info_switch(struct rq *rq, struct task_struct *prev, struct task_struct *next)  in sched_info_switch()  argument
237 	if (prev != rq->idle)  in sched_info_switch()
238 		sched_info_depart(rq, prev);  in sched_info_switch()
240 	if (next != rq->idle)  in sched_info_switch()
241 		sched_info_arrive(rq, next);  in sched_info_switch()
245 # define sched_info_enqueue(rq, t)	do { } while (0)  argument
246 # define sched_info_dequeue(rq, t)	do { } while (0)  argument
247 # define sched_info_switch(rq, t, next)	do { } while (0)  argument