]>
Commit | Line | Data |
---|---|---|
425e0968 IM |
1 | |
2 | #ifdef CONFIG_SCHEDSTATS | |
b5aadf7f | 3 | |
425e0968 IM |
4 | /* |
5 | * Expects runqueue lock to be held for atomicity of update | |
6 | */ | |
7 | static inline void | |
8 | rq_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 | */ | |
19 | static inline void | |
20 | rq_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 | |
26 | static inline void | |
27 | rq_sched_info_dequeued(struct rq *rq, unsigned long long delta) | |
28 | { | |
29 | if (rq) | |
30 | rq->rq_sched_info.run_delay += delta; | |
31 | } | |
425e0968 IM |
32 | # define schedstat_inc(rq, field) do { (rq)->field++; } while (0) |
33 | # define schedstat_add(rq, field, amt) do { (rq)->field += (amt); } while (0) | |
c3c70119 | 34 | # define schedstat_set(var, val) do { var = (val); } while (0) |
425e0968 IM |
35 | #else /* !CONFIG_SCHEDSTATS */ |
36 | static inline void | |
37 | rq_sched_info_arrive(struct rq *rq, unsigned long long delta) | |
38 | {} | |
39 | static inline void | |
46ac22ba AG |
40 | rq_sched_info_dequeued(struct rq *rq, unsigned long long delta) |
41 | {} | |
42 | static inline void | |
425e0968 IM |
43 | rq_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) | |
c3c70119 | 47 | # define schedstat_set(var, val) do { } while (0) |
425e0968 IM |
48 | #endif |
49 | ||
9a41785c | 50 | #if defined(CONFIG_SCHEDSTATS) || defined(CONFIG_TASK_DELAY_ACCT) |
46ac22ba AG |
51 | static inline void sched_info_reset_dequeued(struct task_struct *t) |
52 | { | |
53 | t->sched_info.last_queued = 0; | |
54 | } | |
55 | ||
425e0968 | 56 | /* |
d4a6f3c3 | 57 | * We are interested in knowing how long it was from the *first* time a |
46ac22ba AG |
58 | * 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. | |
425e0968 | 61 | */ |
43148951 | 62 | static inline void sched_info_dequeued(struct rq *rq, struct task_struct *t) |
425e0968 | 63 | { |
43148951 | 64 | unsigned long long now = rq_clock(rq), delta = 0; |
46ac22ba AG |
65 | |
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 | ||
43148951 | 72 | rq_sched_info_dequeued(rq, delta); |
425e0968 IM |
73 | } |
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 | */ | |
43148951 | 80 | static void sched_info_arrive(struct rq *rq, struct task_struct *t) |
425e0968 | 81 | { |
43148951 | 82 | unsigned long long now = rq_clock(rq), delta = 0; |
425e0968 IM |
83 | |
84 | if (t->sched_info.last_queued) | |
85 | delta = now - t->sched_info.last_queued; | |
46ac22ba | 86 | sched_info_reset_dequeued(t); |
425e0968 IM |
87 | t->sched_info.run_delay += delta; |
88 | t->sched_info.last_arrival = now; | |
2d72376b | 89 | t->sched_info.pcount++; |
425e0968 | 90 | |
43148951 | 91 | rq_sched_info_arrive(rq, delta); |
425e0968 IM |
92 | } |
93 | ||
94 | /* | |
425e0968 IM |
95 | * 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 | */ | |
43148951 | 99 | static inline void sched_info_queued(struct rq *rq, struct task_struct *t) |
425e0968 IM |
100 | { |
101 | if (unlikely(sched_info_on())) | |
102 | if (!t->sched_info.last_queued) | |
43148951 | 103 | t->sched_info.last_queued = rq_clock(rq); |
425e0968 IM |
104 | } |
105 | ||
106 | /* | |
13b62e46 MT |
107 | * 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. | |
d4abc238 BR |
110 | * 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. | |
425e0968 | 113 | */ |
43148951 | 114 | static inline void sched_info_depart(struct rq *rq, struct task_struct *t) |
425e0968 | 115 | { |
43148951 | 116 | unsigned long long delta = rq_clock(rq) - |
9a41785c | 117 | t->sched_info.last_arrival; |
425e0968 | 118 | |
43148951 | 119 | rq_sched_info_depart(rq, delta); |
d4abc238 BR |
120 | |
121 | if (t->state == TASK_RUNNING) | |
43148951 | 122 | sched_info_queued(rq, t); |
425e0968 IM |
123 | } |
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 | */ | |
130 | static inline void | |
43148951 MT |
131 | __sched_info_switch(struct rq *rq, |
132 | struct task_struct *prev, struct task_struct *next) | |
425e0968 | 133 | { |
425e0968 IM |
134 | /* |
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) | |
43148951 | 140 | sched_info_depart(rq, prev); |
425e0968 IM |
141 | |
142 | if (next != rq->idle) | |
43148951 | 143 | sched_info_arrive(rq, next); |
425e0968 IM |
144 | } |
145 | static inline void | |
43148951 MT |
146 | sched_info_switch(struct rq *rq, |
147 | struct task_struct *prev, struct task_struct *next) | |
425e0968 IM |
148 | { |
149 | if (unlikely(sched_info_on())) | |
43148951 | 150 | __sched_info_switch(rq, prev, next); |
425e0968 IM |
151 | } |
152 | #else | |
43148951 | 153 | #define sched_info_queued(rq, t) do { } while (0) |
46ac22ba | 154 | #define sched_info_reset_dequeued(t) do { } while (0) |
43148951 MT |
155 | #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) | |
9a41785c | 159 | #endif /* CONFIG_SCHEDSTATS || CONFIG_TASK_DELAY_ACCT */ |
425e0968 | 160 | |
bb34d92f FM |
161 | /* |
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 | ||
fa18f7bd KM |
167 | /** |
168 | * cputimer_running - return true if cputimer is running | |
169 | * | |
170 | * @tsk: Pointer to target task. | |
171 | */ | |
172 | static inline bool cputimer_running(struct task_struct *tsk) | |
173 | ||
174 | { | |
175 | struct thread_group_cputimer *cputimer = &tsk->signal->cputimer; | |
176 | ||
177 | if (!cputimer->running) | |
178 | return false; | |
179 | ||
180 | /* | |
181 | * After we flush the task's sum_exec_runtime to sig->sum_sched_runtime | |
182 | * in __exit_signal(), we won't account to the signal struct further | |
183 | * cputime consumed by that task, even though the task can still be | |
184 | * ticking after __exit_signal(). | |
185 | * | |
186 | * In order to keep a consistent behaviour between thread group cputime | |
187 | * and thread group cputimer accounting, lets also ignore the cputime | |
188 | * elapsing after __exit_signal() in any thread group timer running. | |
189 | * | |
190 | * This makes sure that POSIX CPU clocks and timers are synchronized, so | |
191 | * that a POSIX CPU timer won't expire while the corresponding POSIX CPU | |
192 | * clock delta is behind the expiring timer value. | |
193 | */ | |
194 | if (unlikely(!tsk->sighand)) | |
195 | return false; | |
196 | ||
197 | return true; | |
198 | } | |
199 | ||
bb34d92f | 200 | /** |
7086efe1 | 201 | * account_group_user_time - Maintain utime for a thread group. |
bb34d92f | 202 | * |
7086efe1 FM |
203 | * @tsk: Pointer to task structure. |
204 | * @cputime: Time value by which to increment the utime field of the | |
205 | * thread_group_cputime structure. | |
bb34d92f FM |
206 | * |
207 | * If thread group time is being maintained, get the structure for the | |
208 | * running CPU and update the utime field there. | |
209 | */ | |
7086efe1 FM |
210 | static inline void account_group_user_time(struct task_struct *tsk, |
211 | cputime_t cputime) | |
bb34d92f | 212 | { |
48286d50 | 213 | struct thread_group_cputimer *cputimer = &tsk->signal->cputimer; |
bb34d92f | 214 | |
fa18f7bd | 215 | if (!cputimer_running(tsk)) |
4cd4c1b4 PZ |
216 | return; |
217 | ||
ee30a7b2 | 218 | raw_spin_lock(&cputimer->lock); |
64861634 | 219 | cputimer->cputime.utime += cputime; |
ee30a7b2 | 220 | raw_spin_unlock(&cputimer->lock); |
bb34d92f FM |
221 | } |
222 | ||
223 | /** | |
7086efe1 | 224 | * account_group_system_time - Maintain stime for a thread group. |
bb34d92f | 225 | * |
7086efe1 FM |
226 | * @tsk: Pointer to task structure. |
227 | * @cputime: Time value by which to increment the stime field of the | |
228 | * thread_group_cputime structure. | |
bb34d92f FM |
229 | * |
230 | * If thread group time is being maintained, get the structure for the | |
231 | * running CPU and update the stime field there. | |
232 | */ | |
7086efe1 FM |
233 | static inline void account_group_system_time(struct task_struct *tsk, |
234 | cputime_t cputime) | |
bb34d92f | 235 | { |
48286d50 | 236 | struct thread_group_cputimer *cputimer = &tsk->signal->cputimer; |
4cd4c1b4 | 237 | |
fa18f7bd | 238 | if (!cputimer_running(tsk)) |
4cd4c1b4 | 239 | return; |
bb34d92f | 240 | |
ee30a7b2 | 241 | raw_spin_lock(&cputimer->lock); |
64861634 | 242 | cputimer->cputime.stime += cputime; |
ee30a7b2 | 243 | raw_spin_unlock(&cputimer->lock); |
bb34d92f FM |
244 | } |
245 | ||
246 | /** | |
7086efe1 | 247 | * account_group_exec_runtime - Maintain exec runtime for a thread group. |
bb34d92f | 248 | * |
7086efe1 | 249 | * @tsk: Pointer to task structure. |
bb34d92f | 250 | * @ns: Time value by which to increment the sum_exec_runtime field |
7086efe1 | 251 | * of the thread_group_cputime structure. |
bb34d92f FM |
252 | * |
253 | * If thread group time is being maintained, get the structure for the | |
254 | * running CPU and update the sum_exec_runtime field there. | |
255 | */ | |
7086efe1 FM |
256 | static inline void account_group_exec_runtime(struct task_struct *tsk, |
257 | unsigned long long ns) | |
bb34d92f | 258 | { |
48286d50 | 259 | struct thread_group_cputimer *cputimer = &tsk->signal->cputimer; |
4cd4c1b4 | 260 | |
fa18f7bd | 261 | if (!cputimer_running(tsk)) |
4cd4c1b4 | 262 | return; |
bb34d92f | 263 | |
ee30a7b2 | 264 | raw_spin_lock(&cputimer->lock); |
4cd4c1b4 | 265 | cputimer->cputime.sum_exec_runtime += ns; |
ee30a7b2 | 266 | raw_spin_unlock(&cputimer->lock); |
bb34d92f | 267 | } |