blob: 33d0daf83842a1a8ae8a9548c4a0e81f5dc1d9fb [file] [log] [blame]
Greg Kroah-Hartmanb2441312017-11-01 15:07:57 +01001/* SPDX-License-Identifier: GPL-2.0 */
Ingo Molnar425e0962007-07-09 18:51:58 +02002
3#ifdef CONFIG_SCHEDSTATS
Alexey Dobriyanb5aadf72008-10-06 13:23:43 +04004
Ingo Molnar425e0962007-07-09 18:51:58 +02005/*
6 * Expects runqueue lock to be held for atomicity of update
7 */
8static inline void
9rq_sched_info_arrive(struct rq *rq, unsigned long long delta)
10{
11 if (rq) {
12 rq->rq_sched_info.run_delay += delta;
Ingo Molnar2d723762007-10-15 17:00:12 +020013 rq->rq_sched_info.pcount++;
Ingo Molnar425e0962007-07-09 18:51:58 +020014 }
15}
16
17/*
18 * Expects runqueue lock to be held for atomicity of update
19 */
20static inline void
21rq_sched_info_depart(struct rq *rq, unsigned long long delta)
22{
23 if (rq)
Ken Chen9c2c4802008-12-16 23:41:22 -080024 rq->rq_cpu_time += delta;
Ingo Molnar425e0962007-07-09 18:51:58 +020025}
Ankita Garg46ac22b2008-07-01 14:30:06 +053026
27static inline void
28rq_sched_info_dequeued(struct rq *rq, unsigned long long delta)
29{
30 if (rq)
31 rq->rq_sched_info.run_delay += delta;
32}
Ingo Molnar97fb7a02018-03-03 14:01:12 +010033#define schedstat_enabled() static_branch_unlikely(&sched_schedstats)
Peter Zijlstrab85c8b72018-01-16 20:51:06 +010034#define __schedstat_inc(var) do { var++; } while (0)
Ingo Molnar97fb7a02018-03-03 14:01:12 +010035#define schedstat_inc(var) do { if (schedstat_enabled()) { var++; } } while (0)
Peter Zijlstra2ed41a52018-01-23 20:34:30 +010036#define __schedstat_add(var, amt) do { var += (amt); } while (0)
Ingo Molnar97fb7a02018-03-03 14:01:12 +010037#define schedstat_add(var, amt) do { if (schedstat_enabled()) { var += (amt); } } while (0)
38#define __schedstat_set(var, val) do { var = (val); } while (0)
39#define schedstat_set(var, val) do { if (schedstat_enabled()) { var = (val); } } while (0)
40#define schedstat_val(var) (var)
41#define schedstat_val_or_zero(var) ((schedstat_enabled()) ? (var) : 0)
Josh Poimboeuf9c572592016-06-03 17:58:40 -050042
Ingo Molnar97fb7a02018-03-03 14:01:12 +010043#else /* !CONFIG_SCHEDSTATS: */
44static inline void rq_sched_info_arrive (struct rq *rq, unsigned long long delta) { }
45static inline void rq_sched_info_dequeued(struct rq *rq, unsigned long long delta) { }
46static inline void rq_sched_info_depart (struct rq *rq, unsigned long long delta) { }
47# define schedstat_enabled() 0
48# define __schedstat_inc(var) do { } while (0)
49# define schedstat_inc(var) do { } while (0)
50# define __schedstat_add(var, amt) do { } while (0)
51# define schedstat_add(var, amt) do { } while (0)
52# define __schedstat_set(var, val) do { } while (0)
53# define schedstat_set(var, val) do { } while (0)
54# define schedstat_val(var) 0
55# define schedstat_val_or_zero(var) 0
Josh Poimboeufae928822016-06-17 12:43:24 -050056#endif /* CONFIG_SCHEDSTATS */
Ingo Molnar425e0962007-07-09 18:51:58 +020057
Johannes Weinereb414682018-10-26 15:06:27 -070058#ifdef CONFIG_PSI
59/*
60 * PSI tracks state that persists across sleeps, such as iowaits and
61 * memory stalls. As a result, it has to distinguish between sleeps,
62 * where a task's runnable state changes, and requeues, where a task
63 * and its state are being moved between CPUs and runqueues.
64 */
65static inline void psi_enqueue(struct task_struct *p, bool wakeup)
66{
67 int clear = 0, set = TSK_RUNNING;
68
Johannes Weinere0c27442018-11-30 14:09:58 -080069 if (static_branch_likely(&psi_disabled))
Johannes Weinereb414682018-10-26 15:06:27 -070070 return;
71
72 if (!wakeup || p->sched_psi_wake_requeue) {
Yafang Shao1066d1b2020-03-16 21:28:05 -040073 if (p->in_memstall)
Johannes Weinereb414682018-10-26 15:06:27 -070074 set |= TSK_MEMSTALL;
75 if (p->sched_psi_wake_requeue)
76 p->sched_psi_wake_requeue = 0;
77 } else {
78 if (p->in_iowait)
79 clear |= TSK_IOWAIT;
80 }
81
82 psi_task_change(p, clear, set);
83}
84
85static inline void psi_dequeue(struct task_struct *p, bool sleep)
86{
87 int clear = TSK_RUNNING, set = 0;
88
Johannes Weinere0c27442018-11-30 14:09:58 -080089 if (static_branch_likely(&psi_disabled))
Johannes Weinereb414682018-10-26 15:06:27 -070090 return;
91
92 if (!sleep) {
Yafang Shao1066d1b2020-03-16 21:28:05 -040093 if (p->in_memstall)
Johannes Weinereb414682018-10-26 15:06:27 -070094 clear |= TSK_MEMSTALL;
95 } else {
Johannes Weinerb05e75d2020-03-16 15:13:31 -040096 /*
97 * When a task sleeps, schedule() dequeues it before
98 * switching to the next one. Merge the clearing of
99 * TSK_RUNNING and TSK_ONCPU to save an unnecessary
100 * psi_task_change() call in psi_sched_switch().
101 */
102 clear |= TSK_ONCPU;
103
Johannes Weinereb414682018-10-26 15:06:27 -0700104 if (p->in_iowait)
105 set |= TSK_IOWAIT;
106 }
107
108 psi_task_change(p, clear, set);
109}
110
111static inline void psi_ttwu_dequeue(struct task_struct *p)
112{
Johannes Weinere0c27442018-11-30 14:09:58 -0800113 if (static_branch_likely(&psi_disabled))
Johannes Weinereb414682018-10-26 15:06:27 -0700114 return;
115 /*
116 * Is the task being migrated during a wakeup? Make sure to
117 * deregister its sleep-persistent psi states from the old
118 * queue, and let psi_enqueue() know it has to requeue.
119 */
Yafang Shao1066d1b2020-03-16 21:28:05 -0400120 if (unlikely(p->in_iowait || p->in_memstall)) {
Johannes Weinereb414682018-10-26 15:06:27 -0700121 struct rq_flags rf;
122 struct rq *rq;
123 int clear = 0;
124
125 if (p->in_iowait)
126 clear |= TSK_IOWAIT;
Yafang Shao1066d1b2020-03-16 21:28:05 -0400127 if (p->in_memstall)
Johannes Weinereb414682018-10-26 15:06:27 -0700128 clear |= TSK_MEMSTALL;
129
130 rq = __task_rq_lock(p, &rf);
131 psi_task_change(p, clear, 0);
132 p->sched_psi_wake_requeue = 1;
133 __task_rq_unlock(rq, &rf);
134 }
135}
136
Johannes Weinerb05e75d2020-03-16 15:13:31 -0400137static inline void psi_sched_switch(struct task_struct *prev,
138 struct task_struct *next,
139 bool sleep)
140{
141 if (static_branch_likely(&psi_disabled))
142 return;
143
Johannes Weiner36b238d2020-03-16 15:13:32 -0400144 psi_task_switch(prev, next, sleep);
Johannes Weinerb05e75d2020-03-16 15:13:31 -0400145}
146
Johannes Weinereb414682018-10-26 15:06:27 -0700147static inline void psi_task_tick(struct rq *rq)
148{
Johannes Weinere0c27442018-11-30 14:09:58 -0800149 if (static_branch_likely(&psi_disabled))
Johannes Weinereb414682018-10-26 15:06:27 -0700150 return;
151
Yafang Shao1066d1b2020-03-16 21:28:05 -0400152 if (unlikely(rq->curr->in_memstall))
Johannes Weinereb414682018-10-26 15:06:27 -0700153 psi_memstall_tick(rq->curr, cpu_of(rq));
154}
155#else /* CONFIG_PSI */
156static inline void psi_enqueue(struct task_struct *p, bool wakeup) {}
157static inline void psi_dequeue(struct task_struct *p, bool sleep) {}
158static inline void psi_ttwu_dequeue(struct task_struct *p) {}
Johannes Weinerb05e75d2020-03-16 15:13:31 -0400159static inline void psi_sched_switch(struct task_struct *prev,
160 struct task_struct *next,
161 bool sleep) {}
Johannes Weinereb414682018-10-26 15:06:27 -0700162static inline void psi_task_tick(struct rq *rq) {}
163#endif /* CONFIG_PSI */
164
Naveen N. Raof6db8342015-06-25 23:53:37 +0530165#ifdef CONFIG_SCHED_INFO
Ankita Garg46ac22b2008-07-01 14:30:06 +0530166static inline void sched_info_reset_dequeued(struct task_struct *t)
167{
168 t->sched_info.last_queued = 0;
169}
170
Ingo Molnar425e0962007-07-09 18:51:58 +0200171/*
Rakib Mullickd4a6f3c2010-10-24 16:28:47 +0600172 * We are interested in knowing how long it was from the *first* time a
Ingo Molnar97fb7a02018-03-03 14:01:12 +0100173 * task was queued to the time that it finally hit a CPU, we call this routine
174 * from dequeue_task() to account for possible rq->clock skew across CPUs. The
175 * delta taken on each CPU would annul the skew.
Ingo Molnar425e0962007-07-09 18:51:58 +0200176 */
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300177static inline void sched_info_dequeued(struct rq *rq, struct task_struct *t)
Ingo Molnar425e0962007-07-09 18:51:58 +0200178{
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300179 unsigned long long now = rq_clock(rq), delta = 0;
Ankita Garg46ac22b2008-07-01 14:30:06 +0530180
Yi Wang65d74e92019-07-05 12:35:07 +0800181 if (sched_info_on()) {
Ankita Garg46ac22b2008-07-01 14:30:06 +0530182 if (t->sched_info.last_queued)
183 delta = now - t->sched_info.last_queued;
Yi Wang65d74e92019-07-05 12:35:07 +0800184 }
Ankita Garg46ac22b2008-07-01 14:30:06 +0530185 sched_info_reset_dequeued(t);
186 t->sched_info.run_delay += delta;
187
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300188 rq_sched_info_dequeued(rq, delta);
Ingo Molnar425e0962007-07-09 18:51:58 +0200189}
190
191/*
Ingo Molnar97fb7a02018-03-03 14:01:12 +0100192 * Called when a task finally hits the CPU. We can now calculate how
Ingo Molnar425e0962007-07-09 18:51:58 +0200193 * long it was waiting to run. We also note when it began so that we
194 * can keep stats on how long its timeslice is.
195 */
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300196static void sched_info_arrive(struct rq *rq, struct task_struct *t)
Ingo Molnar425e0962007-07-09 18:51:58 +0200197{
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300198 unsigned long long now = rq_clock(rq), delta = 0;
Ingo Molnar425e0962007-07-09 18:51:58 +0200199
200 if (t->sched_info.last_queued)
201 delta = now - t->sched_info.last_queued;
Ankita Garg46ac22b2008-07-01 14:30:06 +0530202 sched_info_reset_dequeued(t);
Ingo Molnar425e0962007-07-09 18:51:58 +0200203 t->sched_info.run_delay += delta;
204 t->sched_info.last_arrival = now;
Ingo Molnar2d723762007-10-15 17:00:12 +0200205 t->sched_info.pcount++;
Ingo Molnar425e0962007-07-09 18:51:58 +0200206
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300207 rq_sched_info_arrive(rq, delta);
Ingo Molnar425e0962007-07-09 18:51:58 +0200208}
209
210/*
Ingo Molnar425e0962007-07-09 18:51:58 +0200211 * This function is only called from enqueue_task(), but also only updates
212 * the timestamp if it is already not set. It's assumed that
213 * sched_info_dequeued() will clear that stamp when appropriate.
214 */
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300215static inline void sched_info_queued(struct rq *rq, struct task_struct *t)
Ingo Molnar425e0962007-07-09 18:51:58 +0200216{
Yi Wang65d74e92019-07-05 12:35:07 +0800217 if (sched_info_on()) {
Ingo Molnar425e0962007-07-09 18:51:58 +0200218 if (!t->sched_info.last_queued)
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300219 t->sched_info.last_queued = rq_clock(rq);
Ingo Molnar97fb7a02018-03-03 14:01:12 +0100220 }
Ingo Molnar425e0962007-07-09 18:51:58 +0200221}
222
223/*
Michael S. Tsirkin13b62e42013-09-16 11:30:36 +0300224 * Called when a process ceases being the active-running process involuntarily
225 * due, typically, to expiring its time slice (this may also be called when
226 * switching to the idle task). Now we can calculate how long we ran.
Bharath Ravid4abc232008-06-16 15:11:01 +0530227 * Also, if the process is still in the TASK_RUNNING state, call
228 * sched_info_queued() to mark that it has now again started waiting on
229 * the runqueue.
Ingo Molnar425e0962007-07-09 18:51:58 +0200230 */
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300231static inline void sched_info_depart(struct rq *rq, struct task_struct *t)
Ingo Molnar425e0962007-07-09 18:51:58 +0200232{
Ingo Molnar97fb7a02018-03-03 14:01:12 +0100233 unsigned long long delta = rq_clock(rq) - t->sched_info.last_arrival;
Ingo Molnar425e0962007-07-09 18:51:58 +0200234
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300235 rq_sched_info_depart(rq, delta);
Bharath Ravid4abc232008-06-16 15:11:01 +0530236
237 if (t->state == TASK_RUNNING)
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300238 sched_info_queued(rq, t);
Ingo Molnar425e0962007-07-09 18:51:58 +0200239}
240
241/*
242 * Called when tasks are switched involuntarily due, typically, to expiring
243 * their time slice. (This may also be called when switching to or from
244 * the idle task.) We are only called when prev != next.
245 */
246static inline void
Ingo Molnar97fb7a02018-03-03 14:01:12 +0100247__sched_info_switch(struct rq *rq, struct task_struct *prev, struct task_struct *next)
Ingo Molnar425e0962007-07-09 18:51:58 +0200248{
Ingo Molnar425e0962007-07-09 18:51:58 +0200249 /*
Ingo Molnar97fb7a02018-03-03 14:01:12 +0100250 * prev now departs the CPU. It's not interesting to record
Ingo Molnar425e0962007-07-09 18:51:58 +0200251 * stats about how efficient we were at scheduling the idle
252 * process, however.
253 */
254 if (prev != rq->idle)
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300255 sched_info_depart(rq, prev);
Ingo Molnar425e0962007-07-09 18:51:58 +0200256
257 if (next != rq->idle)
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300258 sched_info_arrive(rq, next);
Ingo Molnar425e0962007-07-09 18:51:58 +0200259}
Ingo Molnar97fb7a02018-03-03 14:01:12 +0100260
Ingo Molnar425e0962007-07-09 18:51:58 +0200261static inline void
Ingo Molnar97fb7a02018-03-03 14:01:12 +0100262sched_info_switch(struct rq *rq, struct task_struct *prev, struct task_struct *next)
Ingo Molnar425e0962007-07-09 18:51:58 +0200263{
Yi Wang65d74e92019-07-05 12:35:07 +0800264 if (sched_info_on())
Michael S. Tsirkin43148952013-09-22 17:20:54 +0300265 __sched_info_switch(rq, prev, next);
Ingo Molnar425e0962007-07-09 18:51:58 +0200266}
Ingo Molnar97fb7a02018-03-03 14:01:12 +0100267
268#else /* !CONFIG_SCHED_INFO: */
269# define sched_info_queued(rq, t) do { } while (0)
270# define sched_info_reset_dequeued(t) do { } while (0)
271# define sched_info_dequeued(rq, t) do { } while (0)
272# define sched_info_depart(rq, t) do { } while (0)
273# define sched_info_arrive(rq, next) do { } while (0)
274# define sched_info_switch(rq, t, next) do { } while (0)
Naveen N. Raof6db8342015-06-25 23:53:37 +0530275#endif /* CONFIG_SCHED_INFO */