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_dequeued(struct rq *rq, unsigned long long delta)  in rq_sched_info_dequeued()  argument
30 	if (rq)  in rq_sched_info_dequeued()
31 		rq->rq_sched_info.run_delay += delta;  in rq_sched_info_dequeued()
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_dequeued(struct rq *rq, unsigned long long delta) { }  in rq_sched_info_dequeued()  argument
46 static inline void rq_sched_info_depart  (struct rq *rq, unsigned long long delta) { }  in rq_sched_info_depart()  argument
70 static inline void sched_info_dequeued(struct rq *rq, struct task_struct *t)  in sched_info_dequeued()  argument
72 	unsigned long long now = rq_clock(rq), delta = 0;  in sched_info_dequeued()
80 	rq_sched_info_dequeued(rq, delta);  in sched_info_dequeued()
88 static void sched_info_arrive(struct rq *rq, struct task_struct *t)  in sched_info_arrive()  argument
90 	unsigned long long now = rq_clock(rq), delta = 0;  in sched_info_arrive()
99 	rq_sched_info_arrive(rq, delta);  in sched_info_arrive()
107 static inline void sched_info_queued(struct rq *rq, struct task_struct *t)  in sched_info_queued()  argument
111 			t->sched_info.last_queued = rq_clock(rq);  in sched_info_queued()
123 static inline void sched_info_depart(struct rq *rq, struct task_struct *t)  in sched_info_depart()  argument
125 	unsigned long long delta = rq_clock(rq) - t->sched_info.last_arrival;  in sched_info_depart()
127 	rq_sched_info_depart(rq, delta);  in sched_info_depart()
130 		sched_info_queued(rq, t);  in sched_info_depart()
139 __sched_info_switch(struct rq *rq, struct task_struct *prev, struct task_struct *next)  in __sched_info_switch()  argument
146 	if (prev != rq->idle)  in __sched_info_switch()
147 		sched_info_depart(rq, prev);  in __sched_info_switch()
149 	if (next != rq->idle)  in __sched_info_switch()
150 		sched_info_arrive(rq, next);  in __sched_info_switch()
154 sched_info_switch(struct rq *rq, struct task_struct *prev, struct task_struct *next)  in sched_info_switch()  argument
157 		__sched_info_switch(rq, prev, next);  in sched_info_switch()
161 # define sched_info_queued(rq, t)	do { } while (0)  argument
163 # define sched_info_dequeued(rq, t)	do { } while (0)  argument
164 # define sched_info_depart(rq, t)	do { } while (0)  argument
165 # define sched_info_arrive(rq, next)	do { } while (0)  argument
166 # define sched_info_switch(rq, t, next)	do { } while (0)  argument