| 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; | 
| Mike Travis | 39106dc | 2008-04-08 11:43:03 -0700 | [diff] [blame] | 12 | int mask_len = NR_CPUS/32 * 9; | 
|  | 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, | 
| Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 34 | rq->rq_sched_info.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 |  | 
| Mike Travis | 39106dc | 2008-04-08 11:43:03 -0700 | [diff] [blame] | 45 | cpumask_scnprintf(mask_str, mask_len, sd->span); | 
| Ingo Molnar | 2d72376 | 2007-10-15 17:00:12 +0200 | [diff] [blame] | 46 | seq_printf(seq, "domain%d %s", dcount++, mask_str); | 
| Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 47 | for (itype = CPU_IDLE; itype < CPU_MAX_IDLE_TYPES; | 
|  | 48 | itype++) { | 
| Ken Chen | 480b943 | 2007-10-18 21:32:56 +0200 | [diff] [blame] | 49 | seq_printf(seq, " %u %u %u %u %u %u %u %u", | 
| Ingo Molnar | 2d72376 | 2007-10-15 17:00:12 +0200 | [diff] [blame] | 50 | sd->lb_count[itype], | 
| Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 51 | sd->lb_balanced[itype], | 
|  | 52 | sd->lb_failed[itype], | 
|  | 53 | sd->lb_imbalance[itype], | 
|  | 54 | sd->lb_gained[itype], | 
|  | 55 | sd->lb_hot_gained[itype], | 
|  | 56 | sd->lb_nobusyq[itype], | 
|  | 57 | sd->lb_nobusyg[itype]); | 
|  | 58 | } | 
| Ingo Molnar | f95e0d1 | 2007-11-28 15:52:56 +0100 | [diff] [blame] | 59 | seq_printf(seq, | 
|  | 60 | " %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] | 61 | sd->alb_count, sd->alb_failed, sd->alb_pushed, | 
|  | 62 | sd->sbe_count, sd->sbe_balanced, sd->sbe_pushed, | 
|  | 63 | sd->sbf_count, sd->sbf_balanced, sd->sbf_pushed, | 
| Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 64 | sd->ttwu_wake_remote, sd->ttwu_move_affine, | 
|  | 65 | sd->ttwu_move_balance); | 
|  | 66 | } | 
|  | 67 | preempt_enable(); | 
|  | 68 | #endif | 
|  | 69 | } | 
| Adrian Bunk | c6fba54 | 2008-05-14 16:22:59 -0700 | [diff] [blame] | 70 | kfree(mask_str); | 
| Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 71 | return 0; | 
|  | 72 | } | 
|  | 73 |  | 
|  | 74 | static int schedstat_open(struct inode *inode, struct file *file) | 
|  | 75 | { | 
|  | 76 | unsigned int size = PAGE_SIZE * (1 + num_online_cpus() / 32); | 
|  | 77 | char *buf = kmalloc(size, GFP_KERNEL); | 
|  | 78 | struct seq_file *m; | 
|  | 79 | int res; | 
|  | 80 |  | 
|  | 81 | if (!buf) | 
|  | 82 | return -ENOMEM; | 
|  | 83 | res = single_open(file, show_schedstat, NULL); | 
|  | 84 | if (!res) { | 
|  | 85 | m = file->private_data; | 
|  | 86 | m->buf = buf; | 
|  | 87 | m->size = size; | 
|  | 88 | } else | 
|  | 89 | kfree(buf); | 
|  | 90 | return res; | 
|  | 91 | } | 
|  | 92 |  | 
|  | 93 | const struct file_operations proc_schedstat_operations = { | 
|  | 94 | .open    = schedstat_open, | 
|  | 95 | .read    = seq_read, | 
|  | 96 | .llseek  = seq_lseek, | 
|  | 97 | .release = single_release, | 
|  | 98 | }; | 
|  | 99 |  | 
|  | 100 | /* | 
|  | 101 | * Expects runqueue lock to be held for atomicity of update | 
|  | 102 | */ | 
|  | 103 | static inline void | 
|  | 104 | rq_sched_info_arrive(struct rq *rq, unsigned long long delta) | 
|  | 105 | { | 
|  | 106 | if (rq) { | 
|  | 107 | rq->rq_sched_info.run_delay += delta; | 
| Ingo Molnar | 2d72376 | 2007-10-15 17:00:12 +0200 | [diff] [blame] | 108 | rq->rq_sched_info.pcount++; | 
| Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 109 | } | 
|  | 110 | } | 
|  | 111 |  | 
|  | 112 | /* | 
|  | 113 | * Expects runqueue lock to be held for atomicity of update | 
|  | 114 | */ | 
|  | 115 | static inline void | 
|  | 116 | rq_sched_info_depart(struct rq *rq, unsigned long long delta) | 
|  | 117 | { | 
|  | 118 | if (rq) | 
|  | 119 | rq->rq_sched_info.cpu_time += delta; | 
|  | 120 | } | 
| Ankita Garg | 46ac22b | 2008-07-01 14:30:06 +0530 | [diff] [blame] | 121 |  | 
|  | 122 | static inline void | 
|  | 123 | rq_sched_info_dequeued(struct rq *rq, unsigned long long delta) | 
|  | 124 | { | 
|  | 125 | if (rq) | 
|  | 126 | rq->rq_sched_info.run_delay += delta; | 
|  | 127 | } | 
| Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 128 | # define schedstat_inc(rq, field)	do { (rq)->field++; } while (0) | 
|  | 129 | # define schedstat_add(rq, field, amt)	do { (rq)->field += (amt); } while (0) | 
| Ingo Molnar | c3c7011 | 2007-08-02 17:41:40 +0200 | [diff] [blame] | 130 | # define schedstat_set(var, val)	do { var = (val); } while (0) | 
| Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 131 | #else /* !CONFIG_SCHEDSTATS */ | 
|  | 132 | static inline void | 
|  | 133 | rq_sched_info_arrive(struct rq *rq, unsigned long long delta) | 
|  | 134 | {} | 
|  | 135 | static inline void | 
| Ankita Garg | 46ac22b | 2008-07-01 14:30:06 +0530 | [diff] [blame] | 136 | rq_sched_info_dequeued(struct rq *rq, unsigned long long delta) | 
|  | 137 | {} | 
|  | 138 | static inline void | 
| Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 139 | rq_sched_info_depart(struct rq *rq, unsigned long long delta) | 
|  | 140 | {} | 
|  | 141 | # define schedstat_inc(rq, field)	do { } while (0) | 
|  | 142 | # define schedstat_add(rq, field, amt)	do { } while (0) | 
| Ingo Molnar | c3c7011 | 2007-08-02 17:41:40 +0200 | [diff] [blame] | 143 | # define schedstat_set(var, val)	do { } while (0) | 
| Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 144 | #endif | 
|  | 145 |  | 
| Balbir Singh | 9a41785 | 2007-11-09 22:39:37 +0100 | [diff] [blame] | 146 | #if defined(CONFIG_SCHEDSTATS) || defined(CONFIG_TASK_DELAY_ACCT) | 
| Ankita Garg | 46ac22b | 2008-07-01 14:30:06 +0530 | [diff] [blame] | 147 | static inline void sched_info_reset_dequeued(struct task_struct *t) | 
|  | 148 | { | 
|  | 149 | t->sched_info.last_queued = 0; | 
|  | 150 | } | 
|  | 151 |  | 
| Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 152 | /* | 
|  | 153 | * Called when a process is dequeued from the active array and given | 
|  | 154 | * the cpu.  We should note that with the exception of interactive | 
|  | 155 | * tasks, the expired queue will become the active queue after the active | 
|  | 156 | * queue is empty, without explicitly dequeuing and requeuing tasks in the | 
|  | 157 | * expired queue.  (Interactive tasks may be requeued directly to the | 
|  | 158 | * active queue, thus delaying tasks in the expired queue from running; | 
|  | 159 | * see scheduler_tick()). | 
|  | 160 | * | 
| Ankita Garg | 46ac22b | 2008-07-01 14:30:06 +0530 | [diff] [blame] | 161 | * Though we are interested in knowing how long it was from the *first* time a | 
|  | 162 | * task was queued to the time that it finally hit a cpu, we call this routine | 
|  | 163 | * from dequeue_task() to account for possible rq->clock skew across cpus. The | 
|  | 164 | * delta taken on each cpu would annul the skew. | 
| Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 165 | */ | 
|  | 166 | static inline void sched_info_dequeued(struct task_struct *t) | 
|  | 167 | { | 
| Ankita Garg | 46ac22b | 2008-07-01 14:30:06 +0530 | [diff] [blame] | 168 | unsigned long long now = task_rq(t)->clock, delta = 0; | 
|  | 169 |  | 
|  | 170 | if (unlikely(sched_info_on())) | 
|  | 171 | if (t->sched_info.last_queued) | 
|  | 172 | delta = now - t->sched_info.last_queued; | 
|  | 173 | sched_info_reset_dequeued(t); | 
|  | 174 | t->sched_info.run_delay += delta; | 
|  | 175 |  | 
|  | 176 | rq_sched_info_dequeued(task_rq(t), delta); | 
| Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 177 | } | 
|  | 178 |  | 
|  | 179 | /* | 
|  | 180 | * Called when a task finally hits the cpu.  We can now calculate how | 
|  | 181 | * long it was waiting to run.  We also note when it began so that we | 
|  | 182 | * can keep stats on how long its timeslice is. | 
|  | 183 | */ | 
|  | 184 | static void sched_info_arrive(struct task_struct *t) | 
|  | 185 | { | 
| Balbir Singh | 9a41785 | 2007-11-09 22:39:37 +0100 | [diff] [blame] | 186 | unsigned long long now = task_rq(t)->clock, delta = 0; | 
| Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 187 |  | 
|  | 188 | if (t->sched_info.last_queued) | 
|  | 189 | delta = now - t->sched_info.last_queued; | 
| Ankita Garg | 46ac22b | 2008-07-01 14:30:06 +0530 | [diff] [blame] | 190 | sched_info_reset_dequeued(t); | 
| Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 191 | t->sched_info.run_delay += delta; | 
|  | 192 | t->sched_info.last_arrival = now; | 
| Ingo Molnar | 2d72376 | 2007-10-15 17:00:12 +0200 | [diff] [blame] | 193 | t->sched_info.pcount++; | 
| Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 194 |  | 
|  | 195 | rq_sched_info_arrive(task_rq(t), delta); | 
|  | 196 | } | 
|  | 197 |  | 
|  | 198 | /* | 
|  | 199 | * Called when a process is queued into either the active or expired | 
|  | 200 | * array.  The time is noted and later used to determine how long we | 
|  | 201 | * had to wait for us to reach the cpu.  Since the expired queue will | 
|  | 202 | * become the active queue after active queue is empty, without dequeuing | 
|  | 203 | * and requeuing any tasks, we are interested in queuing to either. It | 
|  | 204 | * is unusual but not impossible for tasks to be dequeued and immediately | 
|  | 205 | * requeued in the same or another array: this can happen in sched_yield(), | 
|  | 206 | * set_user_nice(), and even load_balance() as it moves tasks from runqueue | 
|  | 207 | * to runqueue. | 
|  | 208 | * | 
|  | 209 | * This function is only called from enqueue_task(), but also only updates | 
|  | 210 | * the timestamp if it is already not set.  It's assumed that | 
|  | 211 | * sched_info_dequeued() will clear that stamp when appropriate. | 
|  | 212 | */ | 
|  | 213 | static inline void sched_info_queued(struct task_struct *t) | 
|  | 214 | { | 
|  | 215 | if (unlikely(sched_info_on())) | 
|  | 216 | if (!t->sched_info.last_queued) | 
| Balbir Singh | 9a41785 | 2007-11-09 22:39:37 +0100 | [diff] [blame] | 217 | t->sched_info.last_queued = task_rq(t)->clock; | 
| Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 218 | } | 
|  | 219 |  | 
|  | 220 | /* | 
|  | 221 | * Called when a process ceases being the active-running process, either | 
|  | 222 | * voluntarily or involuntarily.  Now we can calculate how long we ran. | 
| Bharath Ravi | d4abc23 | 2008-06-16 15:11:01 +0530 | [diff] [blame] | 223 | * Also, if the process is still in the TASK_RUNNING state, call | 
|  | 224 | * sched_info_queued() to mark that it has now again started waiting on | 
|  | 225 | * the runqueue. | 
| Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 226 | */ | 
|  | 227 | static inline void sched_info_depart(struct task_struct *t) | 
|  | 228 | { | 
| Balbir Singh | 9a41785 | 2007-11-09 22:39:37 +0100 | [diff] [blame] | 229 | unsigned long long delta = task_rq(t)->clock - | 
|  | 230 | t->sched_info.last_arrival; | 
| Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 231 |  | 
|  | 232 | t->sched_info.cpu_time += delta; | 
|  | 233 | rq_sched_info_depart(task_rq(t), delta); | 
| Bharath Ravi | d4abc23 | 2008-06-16 15:11:01 +0530 | [diff] [blame] | 234 |  | 
|  | 235 | if (t->state == TASK_RUNNING) | 
|  | 236 | sched_info_queued(t); | 
| Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 237 | } | 
|  | 238 |  | 
|  | 239 | /* | 
|  | 240 | * Called when tasks are switched involuntarily due, typically, to expiring | 
|  | 241 | * their time slice.  (This may also be called when switching to or from | 
|  | 242 | * the idle task.)  We are only called when prev != next. | 
|  | 243 | */ | 
|  | 244 | static inline void | 
|  | 245 | __sched_info_switch(struct task_struct *prev, struct task_struct *next) | 
|  | 246 | { | 
|  | 247 | struct rq *rq = task_rq(prev); | 
|  | 248 |  | 
|  | 249 | /* | 
|  | 250 | * prev now departs the cpu.  It's not interesting to record | 
|  | 251 | * stats about how efficient we were at scheduling the idle | 
|  | 252 | * process, however. | 
|  | 253 | */ | 
|  | 254 | if (prev != rq->idle) | 
|  | 255 | sched_info_depart(prev); | 
|  | 256 |  | 
|  | 257 | if (next != rq->idle) | 
|  | 258 | sched_info_arrive(next); | 
|  | 259 | } | 
|  | 260 | static inline void | 
|  | 261 | sched_info_switch(struct task_struct *prev, struct task_struct *next) | 
|  | 262 | { | 
|  | 263 | if (unlikely(sched_info_on())) | 
|  | 264 | __sched_info_switch(prev, next); | 
|  | 265 | } | 
|  | 266 | #else | 
| Ankita Garg | 46ac22b | 2008-07-01 14:30:06 +0530 | [diff] [blame] | 267 | #define sched_info_queued(t)			do { } while (0) | 
|  | 268 | #define sched_info_reset_dequeued(t)	do { } while (0) | 
|  | 269 | #define sched_info_dequeued(t)			do { } while (0) | 
|  | 270 | #define sched_info_switch(t, next)		do { } while (0) | 
| Balbir Singh | 9a41785 | 2007-11-09 22:39:37 +0100 | [diff] [blame] | 271 | #endif /* CONFIG_SCHEDSTATS || CONFIG_TASK_DELAY_ACCT */ | 
| Ingo Molnar | 425e096 | 2007-07-09 18:51:58 +0200 | [diff] [blame] | 272 |  |