blob: b0fbc7632de5f9b13d8ccd2c42d73560c347669a [file] [log] [blame]
Ingo Molnar425e0962007-07-09 18:51:58 +02001
2#ifdef CONFIG_SCHEDSTATS
Alexey Dobriyanb5aadf72008-10-06 13:23:43 +04003
Ingo Molnar425e0962007-07-09 18:51:58 +02004/*
5 * Expects runqueue lock to be held for atomicity of update
6 */
7static inline void
8rq_sched_info_arrive(struct rq *rq, unsigned long long delta)
9{
10 if (rq) {
11 rq->rq_sched_info.run_delay += delta;
Ingo Molnar2d723762007-10-15 17:00:12 +020012 rq->rq_sched_info.pcount++;
Ingo Molnar425e0962007-07-09 18:51:58 +020013 }
14}
15
16/*
17 * Expects runqueue lock to be held for atomicity of update
18 */
19static inline void
20rq_sched_info_depart(struct rq *rq, unsigned long long delta)
21{
22 if (rq)
Ken Chen9c2c4802008-12-16 23:41:22 -080023 rq->rq_cpu_time += delta;
Ingo Molnar425e0962007-07-09 18:51:58 +020024}
Ankita Garg46ac22b2008-07-01 14:30:06 +053025
26static inline void
27rq_sched_info_dequeued(struct rq *rq, unsigned long long delta)
28{
29 if (rq)
30 rq->rq_sched_info.run_delay += delta;
31}
Ingo Molnar425e0962007-07-09 18:51:58 +020032# define schedstat_inc(rq, field) do { (rq)->field++; } while (0)
33# define schedstat_add(rq, field, amt) do { (rq)->field += (amt); } while (0)
Ingo Molnarc3c70112007-08-02 17:41:40 +020034# define schedstat_set(var, val) do { var = (val); } while (0)
Ingo Molnar425e0962007-07-09 18:51:58 +020035#else /* !CONFIG_SCHEDSTATS */
36static inline void
37rq_sched_info_arrive(struct rq *rq, unsigned long long delta)
38{}
39static inline void
Ankita Garg46ac22b2008-07-01 14:30:06 +053040rq_sched_info_dequeued(struct rq *rq, unsigned long long delta)
41{}
42static inline void
Ingo Molnar425e0962007-07-09 18:51:58 +020043rq_sched_info_depart(struct rq *rq, unsigned long long delta)
44{}
45# define schedstat_inc(rq, field) do { } while (0)
46# define schedstat_add(rq, field, amt) do { } while (0)
Ingo Molnarc3c70112007-08-02 17:41:40 +020047# define schedstat_set(var, val) do { } while (0)
Ingo Molnar425e0962007-07-09 18:51:58 +020048#endif
49
Naveen N. Raof6db8342015-06-25 23:53:37 +053050#ifdef CONFIG_SCHED_INFO
Ankita Garg46ac22b2008-07-01 14:30:06 +053051static inline void sched_info_reset_dequeued(struct task_struct *t)
52{
53 t->sched_info.last_queued = 0;
54}
55
Ingo Molnar425e0962007-07-09 18:51:58 +020056/*
Rakib Mullickd4a6f3c2010-10-24 16:28:47 +060057 * We are interested in knowing how long it was from the *first* time a
Ankita Garg46ac22b2008-07-01 14:30:06 +053058 * task was queued to the time that it finally hit a cpu, we call this routine
59 * from dequeue_task() to account for possible rq->clock skew across cpus. The
60 * delta taken on each cpu would annul the skew.
Ingo Molnar425e0962007-07-09 18:51:58 +020061 */
Michael S. Tsirkin43148952013-09-22 17:20:54 +030062static inline void sched_info_dequeued(struct rq *rq, struct task_struct *t)
Ingo Molnar425e0962007-07-09 18:51:58 +020063{
Michael S. Tsirkin43148952013-09-22 17:20:54 +030064 unsigned long long now = rq_clock(rq), delta = 0;
Ankita Garg46ac22b2008-07-01 14:30:06 +053065
66 if (unlikely(sched_info_on()))
67 if (t->sched_info.last_queued)
68 delta = now - t->sched_info.last_queued;
69 sched_info_reset_dequeued(t);
70 t->sched_info.run_delay += delta;
71
Michael S. Tsirkin43148952013-09-22 17:20:54 +030072 rq_sched_info_dequeued(rq, delta);
Ingo Molnar425e0962007-07-09 18:51:58 +020073}
74
75/*
76 * Called when a task finally hits the cpu. We can now calculate how
77 * long it was waiting to run. We also note when it began so that we
78 * can keep stats on how long its timeslice is.
79 */
Michael S. Tsirkin43148952013-09-22 17:20:54 +030080static void sched_info_arrive(struct rq *rq, struct task_struct *t)
Ingo Molnar425e0962007-07-09 18:51:58 +020081{
Michael S. Tsirkin43148952013-09-22 17:20:54 +030082 unsigned long long now = rq_clock(rq), delta = 0;
Ingo Molnar425e0962007-07-09 18:51:58 +020083
84 if (t->sched_info.last_queued)
85 delta = now - t->sched_info.last_queued;
Ankita Garg46ac22b2008-07-01 14:30:06 +053086 sched_info_reset_dequeued(t);
Ingo Molnar425e0962007-07-09 18:51:58 +020087 t->sched_info.run_delay += delta;
88 t->sched_info.last_arrival = now;
Ingo Molnar2d723762007-10-15 17:00:12 +020089 t->sched_info.pcount++;
Ingo Molnar425e0962007-07-09 18:51:58 +020090
Michael S. Tsirkin43148952013-09-22 17:20:54 +030091 rq_sched_info_arrive(rq, delta);
Ingo Molnar425e0962007-07-09 18:51:58 +020092}
93
94/*
Ingo Molnar425e0962007-07-09 18:51:58 +020095 * This function is only called from enqueue_task(), but also only updates
96 * the timestamp if it is already not set. It's assumed that
97 * sched_info_dequeued() will clear that stamp when appropriate.
98 */
Michael S. Tsirkin43148952013-09-22 17:20:54 +030099static inline void sched_info_queued(struct rq *rq, struct task_struct *t)
Ingo Molnar425e0962007-07-09 18:51:58 +0200100{
101 if (unlikely(sched_info_on()))
102 if (!t->sched_info.last_queued)
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300103 t->sched_info.last_queued = rq_clock(rq);
Ingo Molnar425e0962007-07-09 18:51:58 +0200104}
105
106/*
Michael S. Tsirkin13b62e42013-09-16 11:30:36 +0300107 * Called when a process ceases being the active-running process involuntarily
108 * due, typically, to expiring its time slice (this may also be called when
109 * switching to the idle task). Now we can calculate how long we ran.
Bharath Ravid4abc232008-06-16 15:11:01 +0530110 * Also, if the process is still in the TASK_RUNNING state, call
111 * sched_info_queued() to mark that it has now again started waiting on
112 * the runqueue.
Ingo Molnar425e0962007-07-09 18:51:58 +0200113 */
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300114static inline void sched_info_depart(struct rq *rq, struct task_struct *t)
Ingo Molnar425e0962007-07-09 18:51:58 +0200115{
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300116 unsigned long long delta = rq_clock(rq) -
Balbir Singh9a417852007-11-09 22:39:37 +0100117 t->sched_info.last_arrival;
Ingo Molnar425e0962007-07-09 18:51:58 +0200118
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300119 rq_sched_info_depart(rq, delta);
Bharath Ravid4abc232008-06-16 15:11:01 +0530120
121 if (t->state == TASK_RUNNING)
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300122 sched_info_queued(rq, t);
Ingo Molnar425e0962007-07-09 18:51:58 +0200123}
124
125/*
126 * Called when tasks are switched involuntarily due, typically, to expiring
127 * their time slice. (This may also be called when switching to or from
128 * the idle task.) We are only called when prev != next.
129 */
130static inline void
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300131__sched_info_switch(struct rq *rq,
132 struct task_struct *prev, struct task_struct *next)
Ingo Molnar425e0962007-07-09 18:51:58 +0200133{
Ingo Molnar425e0962007-07-09 18:51:58 +0200134 /*
135 * prev now departs the cpu. It's not interesting to record
136 * stats about how efficient we were at scheduling the idle
137 * process, however.
138 */
139 if (prev != rq->idle)
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300140 sched_info_depart(rq, prev);
Ingo Molnar425e0962007-07-09 18:51:58 +0200141
142 if (next != rq->idle)
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300143 sched_info_arrive(rq, next);
Ingo Molnar425e0962007-07-09 18:51:58 +0200144}
145static inline void
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300146sched_info_switch(struct rq *rq,
147 struct task_struct *prev, struct task_struct *next)
Ingo Molnar425e0962007-07-09 18:51:58 +0200148{
149 if (unlikely(sched_info_on()))
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300150 __sched_info_switch(rq, prev, next);
Ingo Molnar425e0962007-07-09 18:51:58 +0200151}
152#else
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300153#define sched_info_queued(rq, t) do { } while (0)
Ankita Garg46ac22b2008-07-01 14:30:06 +0530154#define sched_info_reset_dequeued(t) do { } while (0)
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300155#define sched_info_dequeued(rq, t) do { } while (0)
156#define sched_info_depart(rq, t) do { } while (0)
157#define sched_info_arrive(rq, next) do { } while (0)
158#define sched_info_switch(rq, t, next) do { } while (0)
Naveen N. Raof6db8342015-06-25 23:53:37 +0530159#endif /* CONFIG_SCHED_INFO */
Ingo Molnar425e0962007-07-09 18:51:58 +0200160
Frank Mayharbb34d922008-09-12 09:54:39 -0700161/*
162 * The following are functions that support scheduler-internal time accounting.
163 * These functions are generally called at the timer tick. None of this depends
164 * on CONFIG_SCHEDSTATS.
165 */
166
Frank Mayharbb34d922008-09-12 09:54:39 -0700167/**
KOSAKI Motohirofa18f7b2013-05-26 17:35:41 -0400168 * cputimer_running - return true if cputimer is running
169 *
170 * @tsk: Pointer to target task.
171 */
172static inline bool cputimer_running(struct task_struct *tsk)
173
174{
175 struct thread_group_cputimer *cputimer = &tsk->signal->cputimer;
176
Jason Low10180162015-04-28 13:00:22 -0700177 /* Check if cputimer isn't running. This is accessed without locking. */
178 if (!READ_ONCE(cputimer->running))
KOSAKI Motohirofa18f7b2013-05-26 17:35:41 -0400179 return false;
180
181 /*
182 * After we flush the task's sum_exec_runtime to sig->sum_sched_runtime
183 * in __exit_signal(), we won't account to the signal struct further
184 * cputime consumed by that task, even though the task can still be
185 * ticking after __exit_signal().
186 *
187 * In order to keep a consistent behaviour between thread group cputime
188 * and thread group cputimer accounting, lets also ignore the cputime
189 * elapsing after __exit_signal() in any thread group timer running.
190 *
191 * This makes sure that POSIX CPU clocks and timers are synchronized, so
192 * that a POSIX CPU timer won't expire while the corresponding POSIX CPU
193 * clock delta is behind the expiring timer value.
194 */
195 if (unlikely(!tsk->sighand))
196 return false;
197
198 return true;
199}
200
201/**
Frank Mayhar7086efe2008-09-12 09:54:39 -0700202 * account_group_user_time - Maintain utime for a thread group.
Frank Mayharbb34d922008-09-12 09:54:39 -0700203 *
Frank Mayhar7086efe2008-09-12 09:54:39 -0700204 * @tsk: Pointer to task structure.
205 * @cputime: Time value by which to increment the utime field of the
206 * thread_group_cputime structure.
Frank Mayharbb34d922008-09-12 09:54:39 -0700207 *
208 * If thread group time is being maintained, get the structure for the
209 * running CPU and update the utime field there.
210 */
Frank Mayhar7086efe2008-09-12 09:54:39 -0700211static inline void account_group_user_time(struct task_struct *tsk,
212 cputime_t cputime)
Frank Mayharbb34d922008-09-12 09:54:39 -0700213{
Oleg Nesterov48286d5082010-06-11 01:09:52 +0200214 struct thread_group_cputimer *cputimer = &tsk->signal->cputimer;
Frank Mayharbb34d922008-09-12 09:54:39 -0700215
KOSAKI Motohirofa18f7b2013-05-26 17:35:41 -0400216 if (!cputimer_running(tsk))
Peter Zijlstra4cd4c1b2009-02-05 12:24:16 +0100217 return;
218
Jason Low71107442015-04-28 13:00:24 -0700219 atomic64_add(cputime, &cputimer->cputime_atomic.utime);
Frank Mayharbb34d922008-09-12 09:54:39 -0700220}
221
222/**
Frank Mayhar7086efe2008-09-12 09:54:39 -0700223 * account_group_system_time - Maintain stime for a thread group.
Frank Mayharbb34d922008-09-12 09:54:39 -0700224 *
Frank Mayhar7086efe2008-09-12 09:54:39 -0700225 * @tsk: Pointer to task structure.
226 * @cputime: Time value by which to increment the stime field of the
227 * thread_group_cputime structure.
Frank Mayharbb34d922008-09-12 09:54:39 -0700228 *
229 * If thread group time is being maintained, get the structure for the
230 * running CPU and update the stime field there.
231 */
Frank Mayhar7086efe2008-09-12 09:54:39 -0700232static inline void account_group_system_time(struct task_struct *tsk,
233 cputime_t cputime)
Frank Mayharbb34d922008-09-12 09:54:39 -0700234{
Oleg Nesterov48286d5082010-06-11 01:09:52 +0200235 struct thread_group_cputimer *cputimer = &tsk->signal->cputimer;
Frank Mayharbb34d922008-09-12 09:54:39 -0700236
KOSAKI Motohirofa18f7b2013-05-26 17:35:41 -0400237 if (!cputimer_running(tsk))
Peter Zijlstra4cd4c1b2009-02-05 12:24:16 +0100238 return;
239
Jason Low71107442015-04-28 13:00:24 -0700240 atomic64_add(cputime, &cputimer->cputime_atomic.stime);
Frank Mayharbb34d922008-09-12 09:54:39 -0700241}
242
243/**
Frank Mayhar7086efe2008-09-12 09:54:39 -0700244 * account_group_exec_runtime - Maintain exec runtime for a thread group.
Frank Mayharbb34d922008-09-12 09:54:39 -0700245 *
Frank Mayhar7086efe2008-09-12 09:54:39 -0700246 * @tsk: Pointer to task structure.
Frank Mayharbb34d922008-09-12 09:54:39 -0700247 * @ns: Time value by which to increment the sum_exec_runtime field
Frank Mayhar7086efe2008-09-12 09:54:39 -0700248 * of the thread_group_cputime structure.
Frank Mayharbb34d922008-09-12 09:54:39 -0700249 *
250 * If thread group time is being maintained, get the structure for the
251 * running CPU and update the sum_exec_runtime field there.
252 */
Frank Mayhar7086efe2008-09-12 09:54:39 -0700253static inline void account_group_exec_runtime(struct task_struct *tsk,
254 unsigned long long ns)
Frank Mayharbb34d922008-09-12 09:54:39 -0700255{
Oleg Nesterov48286d5082010-06-11 01:09:52 +0200256 struct thread_group_cputimer *cputimer = &tsk->signal->cputimer;
Frank Mayharbb34d922008-09-12 09:54:39 -0700257
KOSAKI Motohirofa18f7b2013-05-26 17:35:41 -0400258 if (!cputimer_running(tsk))
Peter Zijlstra4cd4c1b2009-02-05 12:24:16 +0100259 return;
260
Jason Low71107442015-04-28 13:00:24 -0700261 atomic64_add(ns, &cputimer->cputime_atomic.sum_exec_runtime);
Frank Mayharbb34d922008-09-12 09:54:39 -0700262}