51 static inline void sched_info_reset_dequeued(struct task_struct *t)  in sched_info_reset_dequeued()  argument
53 	t->sched_info.last_queued = 0;  in sched_info_reset_dequeued()
62 static inline void sched_info_dequeued(struct rq *rq, struct task_struct *t)  in sched_info_dequeued()  argument
67 		if (t->sched_info.last_queued)  in sched_info_dequeued()
68 			delta = now - t->sched_info.last_queued;  in sched_info_dequeued()
69 	sched_info_reset_dequeued(t);  in sched_info_dequeued()
70 	t->sched_info.run_delay += delta;  in sched_info_dequeued()
80 static void sched_info_arrive(struct rq *rq, struct task_struct *t)  in sched_info_arrive()  argument
84 	if (t->sched_info.last_queued)  in sched_info_arrive()
85 		delta = now - t->sched_info.last_queued;  in sched_info_arrive()
86 	sched_info_reset_dequeued(t);  in sched_info_arrive()
87 	t->sched_info.run_delay += delta;  in sched_info_arrive()
88 	t->sched_info.last_arrival = now;  in sched_info_arrive()
89 	t->sched_info.pcount++;  in sched_info_arrive()
99 static inline void sched_info_queued(struct rq *rq, struct task_struct *t)  in sched_info_queued()  argument
102 		if (!t->sched_info.last_queued)  in sched_info_queued()
103 			t->sched_info.last_queued = rq_clock(rq);  in sched_info_queued()
114 static inline void sched_info_depart(struct rq *rq, struct task_struct *t)  in sched_info_depart()  argument
117 					t->sched_info.last_arrival;  in sched_info_depart()
121 	if (t->state == TASK_RUNNING)  in sched_info_depart()
122 		sched_info_queued(rq, t);  in sched_info_depart()
153 #define sched_info_queued(rq, t)		do { } while (0)  argument
154 #define sched_info_reset_dequeued(t)	do { } while (0)  argument
155 #define sched_info_dequeued(rq, t)		do { } while (0)  argument
156 #define sched_info_depart(rq, t)		do { } while (0)  argument
158 #define sched_info_switch(rq, t, next)		do { } while (0)  argument