writeback: Fix performance regression in wb_over_bg_thresh()
[deliverable/linux.git] / kernel / sched / stats.h
CommitLineData
425e0968
IM
1
2#ifdef CONFIG_SCHEDSTATS
b5aadf7f 3
425e0968
IM
4/*
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;
2d72376b 12 rq->rq_sched_info.pcount++;
425e0968
IM
13 }
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)
9c2c4802 23 rq->rq_cpu_time += delta;
425e0968 24}
46ac22ba
AG
25
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}
cb251765
MG
32# define schedstat_enabled() static_branch_unlikely(&sched_schedstats)
33# define schedstat_inc(rq, field) do { if (schedstat_enabled()) { (rq)->field++; } } while (0)
34# define schedstat_add(rq, field, amt) do { if (schedstat_enabled()) { (rq)->field += (amt); } } while (0)
35# define schedstat_set(var, val) do { if (schedstat_enabled()) { var = (val); } } while (0)
425e0968
IM
36#else /* !CONFIG_SCHEDSTATS */
37static inline void
38rq_sched_info_arrive(struct rq *rq, unsigned long long delta)
39{}
40static inline void
46ac22ba
AG
41rq_sched_info_dequeued(struct rq *rq, unsigned long long delta)
42{}
43static inline void
425e0968
IM
44rq_sched_info_depart(struct rq *rq, unsigned long long delta)
45{}
cb251765 46# define schedstat_enabled() 0
425e0968
IM
47# define schedstat_inc(rq, field) do { } while (0)
48# define schedstat_add(rq, field, amt) do { } while (0)
c3c70119 49# define schedstat_set(var, val) do { } while (0)
425e0968
IM
50#endif
51
f6db8347 52#ifdef CONFIG_SCHED_INFO
46ac22ba
AG
53static inline void sched_info_reset_dequeued(struct task_struct *t)
54{
55 t->sched_info.last_queued = 0;
56}
57
425e0968 58/*
d4a6f3c3 59 * We are interested in knowing how long it was from the *first* time a
46ac22ba
AG
60 * task was queued to the time that it finally hit a cpu, we call this routine
61 * from dequeue_task() to account for possible rq->clock skew across cpus. The
62 * delta taken on each cpu would annul the skew.
425e0968 63 */
43148951 64static inline void sched_info_dequeued(struct rq *rq, struct task_struct *t)
425e0968 65{
43148951 66 unsigned long long now = rq_clock(rq), delta = 0;
46ac22ba
AG
67
68 if (unlikely(sched_info_on()))
69 if (t->sched_info.last_queued)
70 delta = now - t->sched_info.last_queued;
71 sched_info_reset_dequeued(t);
72 t->sched_info.run_delay += delta;
73
43148951 74 rq_sched_info_dequeued(rq, delta);
425e0968
IM
75}
76
77/*
78 * Called when a task finally hits the cpu. We can now calculate how
79 * long it was waiting to run. We also note when it began so that we
80 * can keep stats on how long its timeslice is.
81 */
43148951 82static void sched_info_arrive(struct rq *rq, struct task_struct *t)
425e0968 83{
43148951 84 unsigned long long now = rq_clock(rq), delta = 0;
425e0968
IM
85
86 if (t->sched_info.last_queued)
87 delta = now - t->sched_info.last_queued;
46ac22ba 88 sched_info_reset_dequeued(t);
425e0968
IM
89 t->sched_info.run_delay += delta;
90 t->sched_info.last_arrival = now;
2d72376b 91 t->sched_info.pcount++;
425e0968 92
43148951 93 rq_sched_info_arrive(rq, delta);
425e0968
IM
94}
95
96/*
425e0968
IM
97 * This function is only called from enqueue_task(), but also only updates
98 * the timestamp if it is already not set. It's assumed that
99 * sched_info_dequeued() will clear that stamp when appropriate.
100 */
43148951 101static inline void sched_info_queued(struct rq *rq, struct task_struct *t)
425e0968
IM
102{
103 if (unlikely(sched_info_on()))
104 if (!t->sched_info.last_queued)
43148951 105 t->sched_info.last_queued = rq_clock(rq);
425e0968
IM
106}
107
108/*
13b62e46
MT
109 * Called when a process ceases being the active-running process involuntarily
110 * due, typically, to expiring its time slice (this may also be called when
111 * switching to the idle task). Now we can calculate how long we ran.
d4abc238
BR
112 * Also, if the process is still in the TASK_RUNNING state, call
113 * sched_info_queued() to mark that it has now again started waiting on
114 * the runqueue.
425e0968 115 */
43148951 116static inline void sched_info_depart(struct rq *rq, struct task_struct *t)
425e0968 117{
43148951 118 unsigned long long delta = rq_clock(rq) -
9a41785c 119 t->sched_info.last_arrival;
425e0968 120
43148951 121 rq_sched_info_depart(rq, delta);
d4abc238
BR
122
123 if (t->state == TASK_RUNNING)
43148951 124 sched_info_queued(rq, t);
425e0968
IM
125}
126
127/*
128 * Called when tasks are switched involuntarily due, typically, to expiring
129 * their time slice. (This may also be called when switching to or from
130 * the idle task.) We are only called when prev != next.
131 */
132static inline void
43148951
MT
133__sched_info_switch(struct rq *rq,
134 struct task_struct *prev, struct task_struct *next)
425e0968 135{
425e0968
IM
136 /*
137 * prev now departs the cpu. It's not interesting to record
138 * stats about how efficient we were at scheduling the idle
139 * process, however.
140 */
141 if (prev != rq->idle)
43148951 142 sched_info_depart(rq, prev);
425e0968
IM
143
144 if (next != rq->idle)
43148951 145 sched_info_arrive(rq, next);
425e0968
IM
146}
147static inline void
43148951
MT
148sched_info_switch(struct rq *rq,
149 struct task_struct *prev, struct task_struct *next)
425e0968
IM
150{
151 if (unlikely(sched_info_on()))
43148951 152 __sched_info_switch(rq, prev, next);
425e0968
IM
153}
154#else
43148951 155#define sched_info_queued(rq, t) do { } while (0)
46ac22ba 156#define sched_info_reset_dequeued(t) do { } while (0)
43148951
MT
157#define sched_info_dequeued(rq, t) do { } while (0)
158#define sched_info_depart(rq, t) do { } while (0)
159#define sched_info_arrive(rq, next) do { } while (0)
160#define sched_info_switch(rq, t, next) do { } while (0)
f6db8347 161#endif /* CONFIG_SCHED_INFO */
425e0968 162
bb34d92f
FM
163/*
164 * The following are functions that support scheduler-internal time accounting.
165 * These functions are generally called at the timer tick. None of this depends
166 * on CONFIG_SCHEDSTATS.
167 */
168
fa18f7bd
KM
169/**
170 * cputimer_running - return true if cputimer is running
171 *
172 * @tsk: Pointer to target task.
173 */
174static inline bool cputimer_running(struct task_struct *tsk)
175
176{
177 struct thread_group_cputimer *cputimer = &tsk->signal->cputimer;
178
1018016c
JL
179 /* Check if cputimer isn't running. This is accessed without locking. */
180 if (!READ_ONCE(cputimer->running))
fa18f7bd
KM
181 return false;
182
183 /*
184 * After we flush the task's sum_exec_runtime to sig->sum_sched_runtime
185 * in __exit_signal(), we won't account to the signal struct further
186 * cputime consumed by that task, even though the task can still be
187 * ticking after __exit_signal().
188 *
189 * In order to keep a consistent behaviour between thread group cputime
190 * and thread group cputimer accounting, lets also ignore the cputime
191 * elapsing after __exit_signal() in any thread group timer running.
192 *
193 * This makes sure that POSIX CPU clocks and timers are synchronized, so
194 * that a POSIX CPU timer won't expire while the corresponding POSIX CPU
195 * clock delta is behind the expiring timer value.
196 */
197 if (unlikely(!tsk->sighand))
198 return false;
199
200 return true;
201}
202
bb34d92f 203/**
7086efe1 204 * account_group_user_time - Maintain utime for a thread group.
bb34d92f 205 *
7086efe1
FM
206 * @tsk: Pointer to task structure.
207 * @cputime: Time value by which to increment the utime field of the
208 * thread_group_cputime structure.
bb34d92f
FM
209 *
210 * If thread group time is being maintained, get the structure for the
211 * running CPU and update the utime field there.
212 */
7086efe1
FM
213static inline void account_group_user_time(struct task_struct *tsk,
214 cputime_t cputime)
bb34d92f 215{
48286d50 216 struct thread_group_cputimer *cputimer = &tsk->signal->cputimer;
bb34d92f 217
fa18f7bd 218 if (!cputimer_running(tsk))
4cd4c1b4
PZ
219 return;
220
71107445 221 atomic64_add(cputime, &cputimer->cputime_atomic.utime);
bb34d92f
FM
222}
223
224/**
7086efe1 225 * account_group_system_time - Maintain stime for a thread group.
bb34d92f 226 *
7086efe1
FM
227 * @tsk: Pointer to task structure.
228 * @cputime: Time value by which to increment the stime field of the
229 * thread_group_cputime structure.
bb34d92f
FM
230 *
231 * If thread group time is being maintained, get the structure for the
232 * running CPU and update the stime field there.
233 */
7086efe1
FM
234static inline void account_group_system_time(struct task_struct *tsk,
235 cputime_t cputime)
bb34d92f 236{
48286d50 237 struct thread_group_cputimer *cputimer = &tsk->signal->cputimer;
4cd4c1b4 238
fa18f7bd 239 if (!cputimer_running(tsk))
4cd4c1b4 240 return;
bb34d92f 241
71107445 242 atomic64_add(cputime, &cputimer->cputime_atomic.stime);
bb34d92f
FM
243}
244
245/**
7086efe1 246 * account_group_exec_runtime - Maintain exec runtime for a thread group.
bb34d92f 247 *
7086efe1 248 * @tsk: Pointer to task structure.
bb34d92f 249 * @ns: Time value by which to increment the sum_exec_runtime field
7086efe1 250 * of the thread_group_cputime structure.
bb34d92f
FM
251 *
252 * If thread group time is being maintained, get the structure for the
253 * running CPU and update the sum_exec_runtime field there.
254 */
7086efe1
FM
255static inline void account_group_exec_runtime(struct task_struct *tsk,
256 unsigned long long ns)
bb34d92f 257{
48286d50 258 struct thread_group_cputimer *cputimer = &tsk->signal->cputimer;
4cd4c1b4 259
fa18f7bd 260 if (!cputimer_running(tsk))
4cd4c1b4 261 return;
bb34d92f 262
71107445 263 atomic64_add(ns, &cputimer->cputime_atomic.sum_exec_runtime);
bb34d92f 264}
This page took 0.54525 seconds and 5 git commands to generate.