Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 1 | |
| 2 | #ifdef CONFIG_SCHEDSTATS |
| 3 | /* |
| 4 | * bump this up when changing the output format or the meaning of an existing |
| 5 | * format, so that tools can adapt (or abort) |
| 6 | */ |
| 7 | #define SCHEDSTAT_VERSION 14 |
| 8 | |
| 9 | static int show_schedstat(struct seq_file *seq, void *v) |
| 10 | { |
| 11 | int cpu; |
Peter Zijlstra | b968905 | 2008-10-17 12:58:19 +0200 | [diff] [blame] | 12 | int mask_len = DIV_ROUND_UP(NR_CPUS, 32) * 9; |
Mike Travis | 39106dc | 2008-04-08 11:43:03 -0700 | [diff] [blame] | 13 | char *mask_str = kmalloc(mask_len, GFP_KERNEL); |
| 14 | |
| 15 | if (mask_str == NULL) |
| 16 | return -ENOMEM; |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 17 | |
| 18 | seq_printf(seq, "version %d\n", SCHEDSTAT_VERSION); |
| 19 | seq_printf(seq, "timestamp %lu\n", jiffies); |
| 20 | for_each_online_cpu(cpu) { |
| 21 | struct rq *rq = cpu_rq(cpu); |
| 22 | #ifdef CONFIG_SMP |
| 23 | struct sched_domain *sd; |
Ingo Molnar | 2d72376 | 2007-10-15 17:00:12 +0200 | [diff] [blame] | 24 | int dcount = 0; |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 25 | #endif |
| 26 | |
| 27 | /* runqueue-specific stats */ |
| 28 | seq_printf(seq, |
Ken Chen | 480b943 | 2007-10-18 21:32:56 +0200 | [diff] [blame] | 29 | "cpu%d %u %u %u %u %u %u %u %u %u %llu %llu %lu", |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 30 | cpu, rq->yld_both_empty, |
Ingo Molnar | 2d72376 | 2007-10-15 17:00:12 +0200 | [diff] [blame] | 31 | rq->yld_act_empty, rq->yld_exp_empty, rq->yld_count, |
| 32 | rq->sched_switch, rq->sched_count, rq->sched_goidle, |
| 33 | rq->ttwu_count, rq->ttwu_local, |
Ken Chen | 9c2c480 | 2008-12-16 23:41:22 -0800 | [diff] [blame] | 34 | rq->rq_cpu_time, |
Ingo Molnar | 2d72376 | 2007-10-15 17:00:12 +0200 | [diff] [blame] | 35 | rq->rq_sched_info.run_delay, rq->rq_sched_info.pcount); |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 36 | |
| 37 | seq_printf(seq, "\n"); |
| 38 | |
| 39 | #ifdef CONFIG_SMP |
| 40 | /* domain-specific stats */ |
| 41 | preempt_disable(); |
| 42 | for_each_domain(cpu, sd) { |
| 43 | enum cpu_idle_type itype; |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 44 | |
Rusty Russell | 758b2cd | 2008-11-25 02:35:04 +1030 | [diff] [blame] | 45 | cpumask_scnprintf(mask_str, mask_len, |
Rusty Russell | 968ea6d | 2008-12-13 21:55:51 +1030 | [diff] [blame] | 46 | sched_domain_span(sd)); |
Ingo Molnar | 2d72376 | 2007-10-15 17:00:12 +0200 | [diff] [blame] | 47 | seq_printf(seq, "domain%d %s", dcount++, mask_str); |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 48 | for (itype = CPU_IDLE; itype < CPU_MAX_IDLE_TYPES; |
| 49 | itype++) { |
Ken Chen | 480b943 | 2007-10-18 21:32:56 +0200 | [diff] [blame] | 50 | seq_printf(seq, " %u %u %u %u %u %u %u %u", |
Ingo Molnar | 2d72376 | 2007-10-15 17:00:12 +0200 | [diff] [blame] | 51 | sd->lb_count[itype], |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 52 | sd->lb_balanced[itype], |
| 53 | sd->lb_failed[itype], |
| 54 | sd->lb_imbalance[itype], |
| 55 | sd->lb_gained[itype], |
| 56 | sd->lb_hot_gained[itype], |
| 57 | sd->lb_nobusyq[itype], |
| 58 | sd->lb_nobusyg[itype]); |
| 59 | } |
Ingo Molnar | f95e0d1 | 2007-11-28 15:52:56 +0100 | [diff] [blame] | 60 | seq_printf(seq, |
| 61 | " %u %u %u %u %u %u %u %u %u %u %u %u\n", |
Ingo Molnar | 2d72376 | 2007-10-15 17:00:12 +0200 | [diff] [blame] | 62 | sd->alb_count, sd->alb_failed, sd->alb_pushed, |
| 63 | sd->sbe_count, sd->sbe_balanced, sd->sbe_pushed, |
| 64 | sd->sbf_count, sd->sbf_balanced, sd->sbf_pushed, |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 65 | sd->ttwu_wake_remote, sd->ttwu_move_affine, |
| 66 | sd->ttwu_move_balance); |
| 67 | } |
| 68 | preempt_enable(); |
| 69 | #endif |
| 70 | } |
Adrian Bunk | c6fba54 | 2008-05-14 16:22:59 -0700 | [diff] [blame] | 71 | kfree(mask_str); |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 72 | return 0; |
| 73 | } |
| 74 | |
| 75 | static int schedstat_open(struct inode *inode, struct file *file) |
| 76 | { |
| 77 | unsigned int size = PAGE_SIZE * (1 + num_online_cpus() / 32); |
| 78 | char *buf = kmalloc(size, GFP_KERNEL); |
| 79 | struct seq_file *m; |
| 80 | int res; |
| 81 | |
| 82 | if (!buf) |
| 83 | return -ENOMEM; |
| 84 | res = single_open(file, show_schedstat, NULL); |
| 85 | if (!res) { |
| 86 | m = file->private_data; |
| 87 | m->buf = buf; |
| 88 | m->size = size; |
| 89 | } else |
| 90 | kfree(buf); |
| 91 | return res; |
| 92 | } |
| 93 | |
Alexey Dobriyan | b5aadf7 | 2008-10-06 13:23:43 +0400 | [diff] [blame] | 94 | static const struct file_operations proc_schedstat_operations = { |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 95 | .open = schedstat_open, |
| 96 | .read = seq_read, |
| 97 | .llseek = seq_lseek, |
| 98 | .release = single_release, |
| 99 | }; |
| 100 | |
Alexey Dobriyan | b5aadf7 | 2008-10-06 13:23:43 +0400 | [diff] [blame] | 101 | static int __init proc_schedstat_init(void) |
| 102 | { |
| 103 | proc_create("schedstat", 0, NULL, &proc_schedstat_operations); |
| 104 | return 0; |
| 105 | } |
| 106 | module_init(proc_schedstat_init); |
| 107 | |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 108 | /* |
| 109 | * Expects runqueue lock to be held for atomicity of update |
| 110 | */ |
| 111 | static inline void |
| 112 | rq_sched_info_arrive(struct rq *rq, unsigned long long delta) |
| 113 | { |
| 114 | if (rq) { |
| 115 | rq->rq_sched_info.run_delay += delta; |
Ingo Molnar | 2d72376 | 2007-10-15 17:00:12 +0200 | [diff] [blame] | 116 | rq->rq_sched_info.pcount++; |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 117 | } |
| 118 | } |
| 119 | |
| 120 | /* |
| 121 | * Expects runqueue lock to be held for atomicity of update |
| 122 | */ |
| 123 | static inline void |
| 124 | rq_sched_info_depart(struct rq *rq, unsigned long long delta) |
| 125 | { |
| 126 | if (rq) |
Ken Chen | 9c2c480 | 2008-12-16 23:41:22 -0800 | [diff] [blame] | 127 | rq->rq_cpu_time += delta; |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 128 | } |
Ankita Garg | 46ac22b | 2008-07-01 14:30:06 +0530 | [diff] [blame] | 129 | |
| 130 | static inline void |
| 131 | rq_sched_info_dequeued(struct rq *rq, unsigned long long delta) |
| 132 | { |
| 133 | if (rq) |
| 134 | rq->rq_sched_info.run_delay += delta; |
| 135 | } |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 136 | # define schedstat_inc(rq, field) do { (rq)->field++; } while (0) |
| 137 | # define schedstat_add(rq, field, amt) do { (rq)->field += (amt); } while (0) |
Ingo Molnar | c3c7011 | 2007-08-02 17:41:40 +0200 | [diff] [blame] | 138 | # define schedstat_set(var, val) do { var = (val); } while (0) |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 139 | #else /* !CONFIG_SCHEDSTATS */ |
| 140 | static inline void |
| 141 | rq_sched_info_arrive(struct rq *rq, unsigned long long delta) |
| 142 | {} |
| 143 | static inline void |
Ankita Garg | 46ac22b | 2008-07-01 14:30:06 +0530 | [diff] [blame] | 144 | rq_sched_info_dequeued(struct rq *rq, unsigned long long delta) |
| 145 | {} |
| 146 | static inline void |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 147 | rq_sched_info_depart(struct rq *rq, unsigned long long delta) |
| 148 | {} |
| 149 | # define schedstat_inc(rq, field) do { } while (0) |
| 150 | # define schedstat_add(rq, field, amt) do { } while (0) |
Ingo Molnar | c3c7011 | 2007-08-02 17:41:40 +0200 | [diff] [blame] | 151 | # define schedstat_set(var, val) do { } while (0) |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 152 | #endif |
| 153 | |
Balbir Singh | 9a41785 | 2007-11-09 22:39:37 +0100 | [diff] [blame] | 154 | #if defined(CONFIG_SCHEDSTATS) || defined(CONFIG_TASK_DELAY_ACCT) |
Ankita Garg | 46ac22b | 2008-07-01 14:30:06 +0530 | [diff] [blame] | 155 | static inline void sched_info_reset_dequeued(struct task_struct *t) |
| 156 | { |
| 157 | t->sched_info.last_queued = 0; |
| 158 | } |
| 159 | |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 160 | /* |
| 161 | * Called when a process is dequeued from the active array and given |
| 162 | * the cpu. We should note that with the exception of interactive |
| 163 | * tasks, the expired queue will become the active queue after the active |
| 164 | * queue is empty, without explicitly dequeuing and requeuing tasks in the |
| 165 | * expired queue. (Interactive tasks may be requeued directly to the |
| 166 | * active queue, thus delaying tasks in the expired queue from running; |
| 167 | * see scheduler_tick()). |
| 168 | * |
Ankita Garg | 46ac22b | 2008-07-01 14:30:06 +0530 | [diff] [blame] | 169 | * Though we are interested in knowing how long it was from the *first* time a |
| 170 | * task was queued to the time that it finally hit a cpu, we call this routine |
| 171 | * from dequeue_task() to account for possible rq->clock skew across cpus. The |
| 172 | * delta taken on each cpu would annul the skew. |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 173 | */ |
| 174 | static inline void sched_info_dequeued(struct task_struct *t) |
| 175 | { |
Ankita Garg | 46ac22b | 2008-07-01 14:30:06 +0530 | [diff] [blame] | 176 | unsigned long long now = task_rq(t)->clock, delta = 0; |
| 177 | |
| 178 | if (unlikely(sched_info_on())) |
| 179 | if (t->sched_info.last_queued) |
| 180 | delta = now - t->sched_info.last_queued; |
| 181 | sched_info_reset_dequeued(t); |
| 182 | t->sched_info.run_delay += delta; |
| 183 | |
| 184 | rq_sched_info_dequeued(task_rq(t), delta); |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 185 | } |
| 186 | |
| 187 | /* |
| 188 | * Called when a task finally hits the cpu. We can now calculate how |
| 189 | * long it was waiting to run. We also note when it began so that we |
| 190 | * can keep stats on how long its timeslice is. |
| 191 | */ |
| 192 | static void sched_info_arrive(struct task_struct *t) |
| 193 | { |
Balbir Singh | 9a41785 | 2007-11-09 22:39:37 +0100 | [diff] [blame] | 194 | unsigned long long now = task_rq(t)->clock, delta = 0; |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 195 | |
| 196 | if (t->sched_info.last_queued) |
| 197 | delta = now - t->sched_info.last_queued; |
Ankita Garg | 46ac22b | 2008-07-01 14:30:06 +0530 | [diff] [blame] | 198 | sched_info_reset_dequeued(t); |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 199 | t->sched_info.run_delay += delta; |
| 200 | t->sched_info.last_arrival = now; |
Ingo Molnar | 2d72376 | 2007-10-15 17:00:12 +0200 | [diff] [blame] | 201 | t->sched_info.pcount++; |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 202 | |
| 203 | rq_sched_info_arrive(task_rq(t), delta); |
| 204 | } |
| 205 | |
| 206 | /* |
| 207 | * Called when a process is queued into either the active or expired |
| 208 | * array. The time is noted and later used to determine how long we |
| 209 | * had to wait for us to reach the cpu. Since the expired queue will |
| 210 | * become the active queue after active queue is empty, without dequeuing |
| 211 | * and requeuing any tasks, we are interested in queuing to either. It |
| 212 | * is unusual but not impossible for tasks to be dequeued and immediately |
| 213 | * requeued in the same or another array: this can happen in sched_yield(), |
| 214 | * set_user_nice(), and even load_balance() as it moves tasks from runqueue |
| 215 | * to runqueue. |
| 216 | * |
| 217 | * This function is only called from enqueue_task(), but also only updates |
| 218 | * the timestamp if it is already not set. It's assumed that |
| 219 | * sched_info_dequeued() will clear that stamp when appropriate. |
| 220 | */ |
| 221 | static inline void sched_info_queued(struct task_struct *t) |
| 222 | { |
| 223 | if (unlikely(sched_info_on())) |
| 224 | if (!t->sched_info.last_queued) |
Balbir Singh | 9a41785 | 2007-11-09 22:39:37 +0100 | [diff] [blame] | 225 | t->sched_info.last_queued = task_rq(t)->clock; |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 226 | } |
| 227 | |
| 228 | /* |
| 229 | * Called when a process ceases being the active-running process, either |
| 230 | * voluntarily or involuntarily. Now we can calculate how long we ran. |
Bharath Ravi | d4abc23 | 2008-06-16 15:11:01 +0530 | [diff] [blame] | 231 | * Also, if the process is still in the TASK_RUNNING state, call |
| 232 | * sched_info_queued() to mark that it has now again started waiting on |
| 233 | * the runqueue. |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 234 | */ |
| 235 | static inline void sched_info_depart(struct task_struct *t) |
| 236 | { |
Balbir Singh | 9a41785 | 2007-11-09 22:39:37 +0100 | [diff] [blame] | 237 | unsigned long long delta = task_rq(t)->clock - |
| 238 | t->sched_info.last_arrival; |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 239 | |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 240 | rq_sched_info_depart(task_rq(t), delta); |
Bharath Ravi | d4abc23 | 2008-06-16 15:11:01 +0530 | [diff] [blame] | 241 | |
| 242 | if (t->state == TASK_RUNNING) |
| 243 | sched_info_queued(t); |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 244 | } |
| 245 | |
| 246 | /* |
| 247 | * Called when tasks are switched involuntarily due, typically, to expiring |
| 248 | * their time slice. (This may also be called when switching to or from |
| 249 | * the idle task.) We are only called when prev != next. |
| 250 | */ |
| 251 | static inline void |
| 252 | __sched_info_switch(struct task_struct *prev, struct task_struct *next) |
| 253 | { |
| 254 | struct rq *rq = task_rq(prev); |
| 255 | |
| 256 | /* |
| 257 | * prev now departs the cpu. It's not interesting to record |
| 258 | * stats about how efficient we were at scheduling the idle |
| 259 | * process, however. |
| 260 | */ |
| 261 | if (prev != rq->idle) |
| 262 | sched_info_depart(prev); |
| 263 | |
| 264 | if (next != rq->idle) |
| 265 | sched_info_arrive(next); |
| 266 | } |
| 267 | static inline void |
| 268 | sched_info_switch(struct task_struct *prev, struct task_struct *next) |
| 269 | { |
| 270 | if (unlikely(sched_info_on())) |
| 271 | __sched_info_switch(prev, next); |
| 272 | } |
| 273 | #else |
Ankita Garg | 46ac22b | 2008-07-01 14:30:06 +0530 | [diff] [blame] | 274 | #define sched_info_queued(t) do { } while (0) |
| 275 | #define sched_info_reset_dequeued(t) do { } while (0) |
| 276 | #define sched_info_dequeued(t) do { } while (0) |
| 277 | #define sched_info_switch(t, next) do { } while (0) |
Balbir Singh | 9a41785 | 2007-11-09 22:39:37 +0100 | [diff] [blame] | 278 | #endif /* CONFIG_SCHEDSTATS || CONFIG_TASK_DELAY_ACCT */ |
Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 279 | |
Frank Mayhar | bb34d92 | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 280 | /* |
| 281 | * The following are functions that support scheduler-internal time accounting. |
| 282 | * These functions are generally called at the timer tick. None of this depends |
| 283 | * on CONFIG_SCHEDSTATS. |
| 284 | */ |
| 285 | |
Frank Mayhar | bb34d92 | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 286 | /** |
Frank Mayhar | 7086efe | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 287 | * account_group_user_time - Maintain utime for a thread group. |
Frank Mayhar | bb34d92 | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 288 | * |
Frank Mayhar | 7086efe | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 289 | * @tsk: Pointer to task structure. |
| 290 | * @cputime: Time value by which to increment the utime field of the |
| 291 | * thread_group_cputime structure. |
Frank Mayhar | bb34d92 | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 292 | * |
| 293 | * If thread group time is being maintained, get the structure for the |
| 294 | * running CPU and update the utime field there. |
| 295 | */ |
Frank Mayhar | 7086efe | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 296 | static inline void account_group_user_time(struct task_struct *tsk, |
| 297 | cputime_t cputime) |
Frank Mayhar | bb34d92 | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 298 | { |
Peter Zijlstra | 4cd4c1b | 2009-02-05 12:24:16 +0100 | [diff] [blame] | 299 | struct thread_group_cputimer *cputimer; |
Frank Mayhar | 7086efe | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 300 | |
Oleg Nesterov | ad133ba | 2008-11-17 15:39:47 +0100 | [diff] [blame] | 301 | /* tsk == current, ensure it is safe to use ->signal */ |
| 302 | if (unlikely(tsk->exit_state)) |
Frank Mayhar | 7086efe | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 303 | return; |
Oleg Nesterov | ad133ba | 2008-11-17 15:39:47 +0100 | [diff] [blame] | 304 | |
Peter Zijlstra | 4cd4c1b | 2009-02-05 12:24:16 +0100 | [diff] [blame] | 305 | cputimer = &tsk->signal->cputimer; |
Frank Mayhar | bb34d92 | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 306 | |
Peter Zijlstra | 4cd4c1b | 2009-02-05 12:24:16 +0100 | [diff] [blame] | 307 | if (!cputimer->running) |
| 308 | return; |
| 309 | |
| 310 | spin_lock(&cputimer->lock); |
| 311 | cputimer->cputime.utime = |
| 312 | cputime_add(cputimer->cputime.utime, cputime); |
| 313 | spin_unlock(&cputimer->lock); |
Frank Mayhar | bb34d92 | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 314 | } |
| 315 | |
| 316 | /** |
Frank Mayhar | 7086efe | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 317 | * account_group_system_time - Maintain stime for a thread group. |
Frank Mayhar | bb34d92 | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 318 | * |
Frank Mayhar | 7086efe | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 319 | * @tsk: Pointer to task structure. |
| 320 | * @cputime: Time value by which to increment the stime field of the |
| 321 | * thread_group_cputime structure. |
Frank Mayhar | bb34d92 | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 322 | * |
| 323 | * If thread group time is being maintained, get the structure for the |
| 324 | * running CPU and update the stime field there. |
| 325 | */ |
Frank Mayhar | 7086efe | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 326 | static inline void account_group_system_time(struct task_struct *tsk, |
| 327 | cputime_t cputime) |
Frank Mayhar | bb34d92 | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 328 | { |
Peter Zijlstra | 4cd4c1b | 2009-02-05 12:24:16 +0100 | [diff] [blame] | 329 | struct thread_group_cputimer *cputimer; |
Frank Mayhar | 7086efe | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 330 | |
Oleg Nesterov | ad133ba | 2008-11-17 15:39:47 +0100 | [diff] [blame] | 331 | /* tsk == current, ensure it is safe to use ->signal */ |
| 332 | if (unlikely(tsk->exit_state)) |
Frank Mayhar | 7086efe | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 333 | return; |
Oleg Nesterov | ad133ba | 2008-11-17 15:39:47 +0100 | [diff] [blame] | 334 | |
Peter Zijlstra | 4cd4c1b | 2009-02-05 12:24:16 +0100 | [diff] [blame] | 335 | cputimer = &tsk->signal->cputimer; |
Frank Mayhar | bb34d92 | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 336 | |
Peter Zijlstra | 4cd4c1b | 2009-02-05 12:24:16 +0100 | [diff] [blame] | 337 | if (!cputimer->running) |
| 338 | return; |
| 339 | |
| 340 | spin_lock(&cputimer->lock); |
| 341 | cputimer->cputime.stime = |
| 342 | cputime_add(cputimer->cputime.stime, cputime); |
| 343 | spin_unlock(&cputimer->lock); |
Frank Mayhar | bb34d92 | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 344 | } |
| 345 | |
| 346 | /** |
Frank Mayhar | 7086efe | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 347 | * account_group_exec_runtime - Maintain exec runtime for a thread group. |
Frank Mayhar | bb34d92 | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 348 | * |
Frank Mayhar | 7086efe | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 349 | * @tsk: Pointer to task structure. |
Frank Mayhar | bb34d92 | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 350 | * @ns: Time value by which to increment the sum_exec_runtime field |
Frank Mayhar | 7086efe | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 351 | * of the thread_group_cputime structure. |
Frank Mayhar | bb34d92 | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 352 | * |
| 353 | * If thread group time is being maintained, get the structure for the |
| 354 | * running CPU and update the sum_exec_runtime field there. |
| 355 | */ |
Frank Mayhar | 7086efe | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 356 | static inline void account_group_exec_runtime(struct task_struct *tsk, |
| 357 | unsigned long long ns) |
Frank Mayhar | bb34d92 | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 358 | { |
Peter Zijlstra | 4cd4c1b | 2009-02-05 12:24:16 +0100 | [diff] [blame] | 359 | struct thread_group_cputimer *cputimer; |
Frank Mayhar | 7086efe | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 360 | struct signal_struct *sig; |
| 361 | |
| 362 | sig = tsk->signal; |
Oleg Nesterov | ad133ba | 2008-11-17 15:39:47 +0100 | [diff] [blame] | 363 | /* see __exit_signal()->task_rq_unlock_wait() */ |
| 364 | barrier(); |
Frank Mayhar | 7086efe | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 365 | if (unlikely(!sig)) |
| 366 | return; |
Oleg Nesterov | ad133ba | 2008-11-17 15:39:47 +0100 | [diff] [blame] | 367 | |
Peter Zijlstra | 4cd4c1b | 2009-02-05 12:24:16 +0100 | [diff] [blame] | 368 | cputimer = &sig->cputimer; |
Frank Mayhar | bb34d92 | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 369 | |
Peter Zijlstra | 4cd4c1b | 2009-02-05 12:24:16 +0100 | [diff] [blame] | 370 | if (!cputimer->running) |
| 371 | return; |
| 372 | |
| 373 | spin_lock(&cputimer->lock); |
| 374 | cputimer->cputime.sum_exec_runtime += ns; |
| 375 | spin_unlock(&cputimer->lock); |
Frank Mayhar | bb34d92 | 2008-09-12 09:54:39 -0700 | [diff] [blame] | 376 | } |