blob: 34659a853505bec33603c423cd0ff71b989410a6 [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}
Josh Poimboeufae928822016-06-17 12:43:24 -050032#define schedstat_enabled() static_branch_unlikely(&sched_schedstats)
33#define schedstat_inc(var) do { if (schedstat_enabled()) { var++; } } while (0)
34#define schedstat_add(var, amt) do { if (schedstat_enabled()) { var += (amt); } } while (0)
35#define schedstat_set(var, val) do { if (schedstat_enabled()) { var = (val); } } while (0)
Josh Poimboeuf20e1d482016-06-17 12:43:25 -050036#define schedstat_val(var) (var)
37#define schedstat_val_or_zero(var) ((schedstat_enabled()) ? (var) : 0)
Josh Poimboeuf9c572592016-06-03 17:58:40 -050038
Ingo Molnar425e0962007-07-09 18:51:58 +020039#else /* !CONFIG_SCHEDSTATS */
40static inline void
41rq_sched_info_arrive(struct rq *rq, unsigned long long delta)
42{}
43static inline void
Ankita Garg46ac22b2008-07-01 14:30:06 +053044rq_sched_info_dequeued(struct rq *rq, unsigned long long delta)
45{}
46static inline void
Ingo Molnar425e0962007-07-09 18:51:58 +020047rq_sched_info_depart(struct rq *rq, unsigned long long delta)
48{}
Josh Poimboeufae928822016-06-17 12:43:24 -050049#define schedstat_enabled() 0
50#define schedstat_inc(var) do { } while (0)
51#define schedstat_add(var, amt) do { } while (0)
52#define schedstat_set(var, val) do { } while (0)
53#define schedstat_val(var) 0
Josh Poimboeuf20e1d482016-06-17 12:43:25 -050054#define schedstat_val_or_zero(var) 0
Josh Poimboeufae928822016-06-17 12:43:24 -050055#endif /* CONFIG_SCHEDSTATS */
Ingo Molnar425e0962007-07-09 18:51:58 +020056
Naveen N. Raof6db8342015-06-25 23:53:37 +053057#ifdef CONFIG_SCHED_INFO
Ankita Garg46ac22b2008-07-01 14:30:06 +053058static inline void sched_info_reset_dequeued(struct task_struct *t)
59{
60 t->sched_info.last_queued = 0;
61}
62
Ingo Molnar425e0962007-07-09 18:51:58 +020063/*
Rakib Mullickd4a6f3c2010-10-24 16:28:47 +060064 * We are interested in knowing how long it was from the *first* time a
Ankita Garg46ac22b2008-07-01 14:30:06 +053065 * task was queued to the time that it finally hit a cpu, we call this routine
66 * from dequeue_task() to account for possible rq->clock skew across cpus. The
67 * delta taken on each cpu would annul the skew.
Ingo Molnar425e0962007-07-09 18:51:58 +020068 */
Michael S. Tsirkin43148952013-09-22 17:20:54 +030069static inline void sched_info_dequeued(struct rq *rq, struct task_struct *t)
Ingo Molnar425e0962007-07-09 18:51:58 +020070{
Michael S. Tsirkin43148952013-09-22 17:20:54 +030071 unsigned long long now = rq_clock(rq), delta = 0;
Ankita Garg46ac22b2008-07-01 14:30:06 +053072
73 if (unlikely(sched_info_on()))
74 if (t->sched_info.last_queued)
75 delta = now - t->sched_info.last_queued;
76 sched_info_reset_dequeued(t);
77 t->sched_info.run_delay += delta;
78
Michael S. Tsirkin43148952013-09-22 17:20:54 +030079 rq_sched_info_dequeued(rq, delta);
Ingo Molnar425e0962007-07-09 18:51:58 +020080}
81
82/*
83 * Called when a task finally hits the cpu. We can now calculate how
84 * long it was waiting to run. We also note when it began so that we
85 * can keep stats on how long its timeslice is.
86 */
Michael S. Tsirkin43148952013-09-22 17:20:54 +030087static void sched_info_arrive(struct rq *rq, struct task_struct *t)
Ingo Molnar425e0962007-07-09 18:51:58 +020088{
Michael S. Tsirkin43148952013-09-22 17:20:54 +030089 unsigned long long now = rq_clock(rq), delta = 0;
Ingo Molnar425e0962007-07-09 18:51:58 +020090
91 if (t->sched_info.last_queued)
92 delta = now - t->sched_info.last_queued;
Ankita Garg46ac22b2008-07-01 14:30:06 +053093 sched_info_reset_dequeued(t);
Ingo Molnar425e0962007-07-09 18:51:58 +020094 t->sched_info.run_delay += delta;
95 t->sched_info.last_arrival = now;
Ingo Molnar2d723762007-10-15 17:00:12 +020096 t->sched_info.pcount++;
Ingo Molnar425e0962007-07-09 18:51:58 +020097
Michael S. Tsirkin43148952013-09-22 17:20:54 +030098 rq_sched_info_arrive(rq, delta);
Ingo Molnar425e0962007-07-09 18:51:58 +020099}
100
101/*
Ingo Molnar425e0962007-07-09 18:51:58 +0200102 * This function is only called from enqueue_task(), but also only updates
103 * the timestamp if it is already not set. It's assumed that
104 * sched_info_dequeued() will clear that stamp when appropriate.
105 */
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300106static inline void sched_info_queued(struct rq *rq, struct task_struct *t)
Ingo Molnar425e0962007-07-09 18:51:58 +0200107{
108 if (unlikely(sched_info_on()))
109 if (!t->sched_info.last_queued)
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300110 t->sched_info.last_queued = rq_clock(rq);
Ingo Molnar425e0962007-07-09 18:51:58 +0200111}
112
113/*
Michael S. Tsirkin13b62e42013-09-16 11:30:36 +0300114 * Called when a process ceases being the active-running process involuntarily
115 * due, typically, to expiring its time slice (this may also be called when
116 * switching to the idle task). Now we can calculate how long we ran.
Bharath Ravid4abc232008-06-16 15:11:01 +0530117 * Also, if the process is still in the TASK_RUNNING state, call
118 * sched_info_queued() to mark that it has now again started waiting on
119 * the runqueue.
Ingo Molnar425e0962007-07-09 18:51:58 +0200120 */
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300121static inline void sched_info_depart(struct rq *rq, struct task_struct *t)
Ingo Molnar425e0962007-07-09 18:51:58 +0200122{
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300123 unsigned long long delta = rq_clock(rq) -
Balbir Singh9a417852007-11-09 22:39:37 +0100124 t->sched_info.last_arrival;
Ingo Molnar425e0962007-07-09 18:51:58 +0200125
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300126 rq_sched_info_depart(rq, delta);
Bharath Ravid4abc232008-06-16 15:11:01 +0530127
128 if (t->state == TASK_RUNNING)
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300129 sched_info_queued(rq, t);
Ingo Molnar425e0962007-07-09 18:51:58 +0200130}
131
132/*
133 * Called when tasks are switched involuntarily due, typically, to expiring
134 * their time slice. (This may also be called when switching to or from
135 * the idle task.) We are only called when prev != next.
136 */
137static inline void
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300138__sched_info_switch(struct rq *rq,
139 struct task_struct *prev, struct task_struct *next)
Ingo Molnar425e0962007-07-09 18:51:58 +0200140{
Ingo Molnar425e0962007-07-09 18:51:58 +0200141 /*
142 * prev now departs the cpu. It's not interesting to record
143 * stats about how efficient we were at scheduling the idle
144 * process, however.
145 */
146 if (prev != rq->idle)
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300147 sched_info_depart(rq, prev);
Ingo Molnar425e0962007-07-09 18:51:58 +0200148
149 if (next != rq->idle)
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300150 sched_info_arrive(rq, next);
Ingo Molnar425e0962007-07-09 18:51:58 +0200151}
152static inline void
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300153sched_info_switch(struct rq *rq,
154 struct task_struct *prev, struct task_struct *next)
Ingo Molnar425e0962007-07-09 18:51:58 +0200155{
156 if (unlikely(sched_info_on()))
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300157 __sched_info_switch(rq, prev, next);
Ingo Molnar425e0962007-07-09 18:51:58 +0200158}
159#else
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300160#define sched_info_queued(rq, t) do { } while (0)
Ankita Garg46ac22b2008-07-01 14:30:06 +0530161#define sched_info_reset_dequeued(t) do { } while (0)
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300162#define sched_info_dequeued(rq, t) do { } while (0)
163#define sched_info_depart(rq, t) do { } while (0)
164#define sched_info_arrive(rq, next) do { } while (0)
165#define sched_info_switch(rq, t, next) do { } while (0)
Naveen N. Raof6db8342015-06-25 23:53:37 +0530166#endif /* CONFIG_SCHED_INFO */
Ingo Molnar425e0962007-07-09 18:51:58 +0200167
Frank Mayharbb34d922008-09-12 09:54:39 -0700168/*
169 * The following are functions that support scheduler-internal time accounting.
170 * These functions are generally called at the timer tick. None of this depends
171 * on CONFIG_SCHEDSTATS.
172 */
173
Frank Mayharbb34d922008-09-12 09:54:39 -0700174/**
KOSAKI Motohirofa18f7b2013-05-26 17:35:41 -0400175 * cputimer_running - return true if cputimer is running
176 *
177 * @tsk: Pointer to target task.
178 */
179static inline bool cputimer_running(struct task_struct *tsk)
180
181{
182 struct thread_group_cputimer *cputimer = &tsk->signal->cputimer;
183
Jason Low10180162015-04-28 13:00:22 -0700184 /* Check if cputimer isn't running. This is accessed without locking. */
185 if (!READ_ONCE(cputimer->running))
KOSAKI Motohirofa18f7b2013-05-26 17:35:41 -0400186 return false;
187
188 /*
189 * After we flush the task's sum_exec_runtime to sig->sum_sched_runtime
190 * in __exit_signal(), we won't account to the signal struct further
191 * cputime consumed by that task, even though the task can still be
192 * ticking after __exit_signal().
193 *
194 * In order to keep a consistent behaviour between thread group cputime
195 * and thread group cputimer accounting, lets also ignore the cputime
196 * elapsing after __exit_signal() in any thread group timer running.
197 *
198 * This makes sure that POSIX CPU clocks and timers are synchronized, so
199 * that a POSIX CPU timer won't expire while the corresponding POSIX CPU
200 * clock delta is behind the expiring timer value.
201 */
202 if (unlikely(!tsk->sighand))
203 return false;
204
205 return true;
206}
207
208/**
Frank Mayhar7086efe2008-09-12 09:54:39 -0700209 * account_group_user_time - Maintain utime for a thread group.
Frank Mayharbb34d922008-09-12 09:54:39 -0700210 *
Frank Mayhar7086efe2008-09-12 09:54:39 -0700211 * @tsk: Pointer to task structure.
212 * @cputime: Time value by which to increment the utime field of the
213 * thread_group_cputime structure.
Frank Mayharbb34d922008-09-12 09:54:39 -0700214 *
215 * If thread group time is being maintained, get the structure for the
216 * running CPU and update the utime field there.
217 */
Frank Mayhar7086efe2008-09-12 09:54:39 -0700218static inline void account_group_user_time(struct task_struct *tsk,
219 cputime_t cputime)
Frank Mayharbb34d922008-09-12 09:54:39 -0700220{
Oleg Nesterov48286d52010-06-11 01:09:52 +0200221 struct thread_group_cputimer *cputimer = &tsk->signal->cputimer;
Frank Mayharbb34d922008-09-12 09:54:39 -0700222
KOSAKI Motohirofa18f7b2013-05-26 17:35:41 -0400223 if (!cputimer_running(tsk))
Peter Zijlstra4cd4c1b2009-02-05 12:24:16 +0100224 return;
225
Jason Low71107442015-04-28 13:00:24 -0700226 atomic64_add(cputime, &cputimer->cputime_atomic.utime);
Frank Mayharbb34d922008-09-12 09:54:39 -0700227}
228
229/**
Frank Mayhar7086efe2008-09-12 09:54:39 -0700230 * account_group_system_time - Maintain stime for a thread group.
Frank Mayharbb34d922008-09-12 09:54:39 -0700231 *
Frank Mayhar7086efe2008-09-12 09:54:39 -0700232 * @tsk: Pointer to task structure.
233 * @cputime: Time value by which to increment the stime field of the
234 * thread_group_cputime structure.
Frank Mayharbb34d922008-09-12 09:54:39 -0700235 *
236 * If thread group time is being maintained, get the structure for the
237 * running CPU and update the stime field there.
238 */
Frank Mayhar7086efe2008-09-12 09:54:39 -0700239static inline void account_group_system_time(struct task_struct *tsk,
240 cputime_t cputime)
Frank Mayharbb34d922008-09-12 09:54:39 -0700241{
Oleg Nesterov48286d52010-06-11 01:09:52 +0200242 struct thread_group_cputimer *cputimer = &tsk->signal->cputimer;
Frank Mayharbb34d922008-09-12 09:54:39 -0700243
KOSAKI Motohirofa18f7b2013-05-26 17:35:41 -0400244 if (!cputimer_running(tsk))
Peter Zijlstra4cd4c1b2009-02-05 12:24:16 +0100245 return;
246
Jason Low71107442015-04-28 13:00:24 -0700247 atomic64_add(cputime, &cputimer->cputime_atomic.stime);
Frank Mayharbb34d922008-09-12 09:54:39 -0700248}
249
250/**
Frank Mayhar7086efe2008-09-12 09:54:39 -0700251 * account_group_exec_runtime - Maintain exec runtime for a thread group.
Frank Mayharbb34d922008-09-12 09:54:39 -0700252 *
Frank Mayhar7086efe2008-09-12 09:54:39 -0700253 * @tsk: Pointer to task structure.
Frank Mayharbb34d922008-09-12 09:54:39 -0700254 * @ns: Time value by which to increment the sum_exec_runtime field
Frank Mayhar7086efe2008-09-12 09:54:39 -0700255 * of the thread_group_cputime structure.
Frank Mayharbb34d922008-09-12 09:54:39 -0700256 *
257 * If thread group time is being maintained, get the structure for the
258 * running CPU and update the sum_exec_runtime field there.
259 */
Frank Mayhar7086efe2008-09-12 09:54:39 -0700260static inline void account_group_exec_runtime(struct task_struct *tsk,
261 unsigned long long ns)
Frank Mayharbb34d922008-09-12 09:54:39 -0700262{
Oleg Nesterov48286d52010-06-11 01:09:52 +0200263 struct thread_group_cputimer *cputimer = &tsk->signal->cputimer;
Frank Mayharbb34d922008-09-12 09:54:39 -0700264
KOSAKI Motohirofa18f7b2013-05-26 17:35:41 -0400265 if (!cputimer_running(tsk))
Peter Zijlstra4cd4c1b2009-02-05 12:24:16 +0100266 return;
267
Jason Low71107442015-04-28 13:00:24 -0700268 atomic64_add(ns, &cputimer->cputime_atomic.sum_exec_runtime);
Frank Mayharbb34d922008-09-12 09:54:39 -0700269}