210 static inline void sched_info_dequeue(struct rq *rq, struct task_struct *t)  in sched_info_dequeue()  argument
214 	if (!t->sched_info.last_queued)  in sched_info_dequeue()
217 	delta = rq_clock(rq) - t->sched_info.last_queued;  in sched_info_dequeue()
218 	t->sched_info.last_queued = 0;  in sched_info_dequeue()
219 	t->sched_info.run_delay += delta;  in sched_info_dequeue()
229 static void sched_info_arrive(struct rq *rq, struct task_struct *t)  in sched_info_arrive()  argument
233 	if (!t->sched_info.last_queued)  in sched_info_arrive()
237 	delta = now - t->sched_info.last_queued;  in sched_info_arrive()
238 	t->sched_info.last_queued = 0;  in sched_info_arrive()
239 	t->sched_info.run_delay += delta;  in sched_info_arrive()
240 	t->sched_info.last_arrival = now;  in sched_info_arrive()
241 	t->sched_info.pcount++;  in sched_info_arrive()
251 static inline void sched_info_enqueue(struct rq *rq, struct task_struct *t)  in sched_info_enqueue()  argument
253 	if (!t->sched_info.last_queued)  in sched_info_enqueue()
254 		t->sched_info.last_queued = rq_clock(rq);  in sched_info_enqueue()
265 static inline void sched_info_depart(struct rq *rq, struct task_struct *t)  in sched_info_depart()  argument
267 	unsigned long long delta = rq_clock(rq) - t->sched_info.last_arrival;  in sched_info_depart()
271 	if (task_is_running(t))  in sched_info_depart()
272 		sched_info_enqueue(rq, t);  in sched_info_depart()
296 # define sched_info_enqueue(rq, t)	do { } while (0)  argument
297 # define sched_info_dequeue(rq, t)	do { } while (0)  argument
298 # define sched_info_switch(rq, t, next)	do { } while (0)  argument