6 * Copyright(C) 2007, Red Hat, Inc., Ingo Molnar
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License version 2 as
10 * published by the Free Software Foundation.
13 #include <linux/proc_fs.h>
14 #include <linux/sched.h>
15 #include <linux/seq_file.h>
16 #include <linux/kallsyms.h>
17 #include <linux/utsname.h>
21 static DEFINE_SPINLOCK(sched_debug_lock);
24 * This allows printing both to /proc/sched_debug and
27 #define SEQ_printf(m, x...) \
36 * Ease the printing of nsec fields:
38 static long long nsec_high(unsigned long long nsec)
40 if ((long long)nsec < 0) {
42 do_div(nsec, 1000000);
45 do_div(nsec, 1000000);
50 static unsigned long nsec_low(unsigned long long nsec)
52 if ((long long)nsec < 0)
55 return do_div(nsec, 1000000);
58 #define SPLIT_NS(x) nsec_high(x), nsec_low(x)
60 #ifdef CONFIG_FAIR_GROUP_SCHED
61 static void print_cfs_group_stats(struct seq_file *m, int cpu, struct task_group *tg)
63 struct sched_entity *se = tg->se[cpu];
66 SEQ_printf(m, " .%-30s: %lld\n", #F, (long long)F)
68 SEQ_printf(m, " .%-30s: %lld.%06ld\n", #F, SPLIT_NS((long long)F))
71 struct sched_avg *avg = &cpu_rq(cpu)->avg;
72 P(avg->runnable_avg_sum);
73 P(avg->runnable_avg_period);
80 PN(se->sum_exec_runtime);
81 #ifdef CONFIG_SCHEDSTATS
82 PN(se->statistics.wait_start);
83 PN(se->statistics.sleep_start);
84 PN(se->statistics.block_start);
85 PN(se->statistics.sleep_max);
86 PN(se->statistics.block_max);
87 PN(se->statistics.exec_max);
88 PN(se->statistics.slice_max);
89 PN(se->statistics.wait_max);
90 PN(se->statistics.wait_sum);
91 P(se->statistics.wait_count);
95 P(se->avg.runnable_avg_sum);
96 P(se->avg.runnable_avg_period);
97 P(se->avg.usage_avg_sum);
98 P(se->avg.load_avg_contrib);
99 P(se->avg.decay_count);
106 #ifdef CONFIG_CGROUP_SCHED
107 static char group_path[PATH_MAX];
109 static char *task_group_path(struct task_group *tg)
111 if (autogroup_path(tg, group_path, PATH_MAX))
114 cgroup_path(tg->css.cgroup, group_path, PATH_MAX);
120 print_task(struct seq_file *m, struct rq *rq, struct task_struct *p)
127 SEQ_printf(m, "%15s %5d %9Ld.%06ld %9Ld %5d ",
129 SPLIT_NS(p->se.vruntime),
130 (long long)(p->nvcsw + p->nivcsw),
132 #ifdef CONFIG_SCHEDSTATS
133 SEQ_printf(m, "%9Ld.%06ld %9Ld.%06ld %9Ld.%06ld",
134 SPLIT_NS(p->se.vruntime),
135 SPLIT_NS(p->se.sum_exec_runtime),
136 SPLIT_NS(p->se.statistics.sum_sleep_runtime));
138 SEQ_printf(m, "%15Ld %15Ld %15Ld.%06ld %15Ld.%06ld %15Ld.%06ld",
139 0LL, 0LL, 0LL, 0L, 0LL, 0L, 0LL, 0L);
141 #ifdef CONFIG_CGROUP_SCHED
142 SEQ_printf(m, " %s", task_group_path(task_group(p)));
148 static void print_rq(struct seq_file *m, struct rq *rq, int rq_cpu)
150 struct task_struct *g, *p;
154 "\nrunnable tasks:\n"
155 " task PID tree-key switches prio"
156 " exec-runtime sum-exec sum-sleep\n"
157 "------------------------------------------------------"
158 "----------------------------------------------------\n");
160 read_lock_irqsave(&tasklist_lock, flags);
162 do_each_thread(g, p) {
163 if (!p->on_rq || task_cpu(p) != rq_cpu)
166 print_task(m, rq, p);
167 } while_each_thread(g, p);
169 read_unlock_irqrestore(&tasklist_lock, flags);
172 void print_cfs_rq(struct seq_file *m, int cpu, struct cfs_rq *cfs_rq)
174 s64 MIN_vruntime = -1, min_vruntime, max_vruntime = -1,
175 spread, rq0_min_vruntime, spread0;
176 struct rq *rq = cpu_rq(cpu);
177 struct sched_entity *last;
180 #ifdef CONFIG_FAIR_GROUP_SCHED
181 SEQ_printf(m, "\ncfs_rq[%d]:%s\n", cpu, task_group_path(cfs_rq->tg));
183 SEQ_printf(m, "\ncfs_rq[%d]:\n", cpu);
185 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "exec_clock",
186 SPLIT_NS(cfs_rq->exec_clock));
188 raw_spin_lock_irqsave(&rq->lock, flags);
189 if (cfs_rq->rb_leftmost)
190 MIN_vruntime = (__pick_first_entity(cfs_rq))->vruntime;
191 last = __pick_last_entity(cfs_rq);
193 max_vruntime = last->vruntime;
194 min_vruntime = cfs_rq->min_vruntime;
195 rq0_min_vruntime = cpu_rq(0)->cfs.min_vruntime;
196 raw_spin_unlock_irqrestore(&rq->lock, flags);
197 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "MIN_vruntime",
198 SPLIT_NS(MIN_vruntime));
199 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "min_vruntime",
200 SPLIT_NS(min_vruntime));
201 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "max_vruntime",
202 SPLIT_NS(max_vruntime));
203 spread = max_vruntime - MIN_vruntime;
204 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread",
206 spread0 = min_vruntime - rq0_min_vruntime;
207 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread0",
209 SEQ_printf(m, " .%-30s: %d\n", "nr_spread_over",
210 cfs_rq->nr_spread_over);
211 SEQ_printf(m, " .%-30s: %d\n", "nr_running", cfs_rq->nr_running);
212 SEQ_printf(m, " .%-30s: %ld\n", "load", cfs_rq->load.weight);
213 #ifdef CONFIG_FAIR_GROUP_SCHED
215 SEQ_printf(m, " .%-30s: %lld\n", "runnable_load_avg",
216 cfs_rq->runnable_load_avg);
217 SEQ_printf(m, " .%-30s: %lld\n", "blocked_load_avg",
218 cfs_rq->blocked_load_avg);
219 SEQ_printf(m, " .%-30s: %lld\n", "tg_load_avg",
220 (unsigned long long)atomic64_read(&cfs_rq->tg->load_avg));
221 SEQ_printf(m, " .%-30s: %lld\n", "tg_load_contrib",
222 cfs_rq->tg_load_contrib);
223 SEQ_printf(m, " .%-30s: %d\n", "tg_runnable_contrib",
224 cfs_rq->tg_runnable_contrib);
225 SEQ_printf(m, " .%-30s: %d\n", "tg->runnable_avg",
226 atomic_read(&cfs_rq->tg->runnable_avg));
227 SEQ_printf(m, " .%-30s: %d\n", "tg->usage_avg",
228 atomic_read(&cfs_rq->tg->usage_avg));
231 print_cfs_group_stats(m, cpu, cfs_rq->tg);
235 void print_rt_rq(struct seq_file *m, int cpu, struct rt_rq *rt_rq)
237 #ifdef CONFIG_RT_GROUP_SCHED
238 SEQ_printf(m, "\nrt_rq[%d]:%s\n", cpu, task_group_path(rt_rq->tg));
240 SEQ_printf(m, "\nrt_rq[%d]:\n", cpu);
244 SEQ_printf(m, " .%-30s: %Ld\n", #x, (long long)(rt_rq->x))
246 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rt_rq->x))
257 extern __read_mostly int sched_clock_running;
259 static void print_cpu(struct seq_file *m, int cpu)
261 struct rq *rq = cpu_rq(cpu);
266 unsigned int freq = cpu_khz ? : 1;
268 SEQ_printf(m, "cpu#%d, %u.%03u MHz\n",
269 cpu, freq / 1000, (freq % 1000));
272 SEQ_printf(m, "cpu#%d\n", cpu);
277 if (sizeof(rq->x) == 4) \
278 SEQ_printf(m, " .%-30s: %ld\n", #x, (long)(rq->x)); \
280 SEQ_printf(m, " .%-30s: %Ld\n", #x, (long long)(rq->x));\
284 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rq->x))
287 SEQ_printf(m, " .%-30s: %lu\n", "load",
291 P(nr_uninterruptible);
303 #ifdef CONFIG_SCHEDSTATS
304 #define P(n) SEQ_printf(m, " .%-30s: %d\n", #n, rq->n);
305 #define P64(n) SEQ_printf(m, " .%-30s: %Ld\n", #n, rq->n);
321 spin_lock_irqsave(&sched_debug_lock, flags);
322 print_cfs_stats(m, cpu);
323 print_rt_stats(m, cpu);
326 print_rq(m, rq, cpu);
328 spin_unlock_irqrestore(&sched_debug_lock, flags);
332 static const char *sched_tunable_scaling_names[] = {
338 static void sched_debug_header(struct seq_file *m)
340 u64 ktime, sched_clk, cpu_clk;
343 local_irq_save(flags);
344 ktime = ktime_to_ns(ktime_get());
345 sched_clk = sched_clock();
346 cpu_clk = local_clock();
347 local_irq_restore(flags);
349 SEQ_printf(m, "Sched Debug Version: v0.10, %s %.*s\n",
350 init_utsname()->release,
351 (int)strcspn(init_utsname()->version, " "),
352 init_utsname()->version);
355 SEQ_printf(m, "%-40s: %Ld\n", #x, (long long)(x))
357 SEQ_printf(m, "%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
362 #ifdef CONFIG_HAVE_UNSTABLE_SCHED_CLOCK
363 P(sched_clock_stable);
369 SEQ_printf(m, "sysctl_sched\n");
372 SEQ_printf(m, " .%-40s: %Ld\n", #x, (long long)(x))
374 SEQ_printf(m, " .%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
375 PN(sysctl_sched_latency);
376 PN(sysctl_sched_min_granularity);
377 PN(sysctl_sched_wakeup_granularity);
378 P(sysctl_sched_child_runs_first);
379 P(sysctl_sched_features);
383 SEQ_printf(m, " .%-40s: %d (%s)\n",
384 "sysctl_sched_tunable_scaling",
385 sysctl_sched_tunable_scaling,
386 sched_tunable_scaling_names[sysctl_sched_tunable_scaling]);
390 static int sched_debug_show(struct seq_file *m, void *v)
392 int cpu = (unsigned long)(v - 2);
397 sched_debug_header(m);
402 void sysrq_sched_debug_show(void)
406 sched_debug_header(NULL);
407 for_each_online_cpu(cpu)
408 print_cpu(NULL, cpu);
413 * This itererator needs some explanation.
414 * It returns 1 for the header position.
415 * This means 2 is cpu 0.
416 * In a hotplugged system some cpus, including cpu 0, may be missing so we have
417 * to use cpumask_* to iterate over the cpus.
419 static void *sched_debug_start(struct seq_file *file, loff_t *offset)
421 unsigned long n = *offset;
429 n = cpumask_next(n - 1, cpu_online_mask);
431 n = cpumask_first(cpu_online_mask);
436 return (void *)(unsigned long)(n + 2);
440 static void *sched_debug_next(struct seq_file *file, void *data, loff_t *offset)
443 return sched_debug_start(file, offset);
446 static void sched_debug_stop(struct seq_file *file, void *data)
450 static const struct seq_operations sched_debug_sops = {
451 .start = sched_debug_start,
452 .next = sched_debug_next,
453 .stop = sched_debug_stop,
454 .show = sched_debug_show,
457 static int sched_debug_release(struct inode *inode, struct file *file)
459 seq_release(inode, file);
464 static int sched_debug_open(struct inode *inode, struct file *filp)
468 ret = seq_open(filp, &sched_debug_sops);
473 static const struct file_operations sched_debug_fops = {
474 .open = sched_debug_open,
477 .release = sched_debug_release,
480 static int __init init_sched_debug_procfs(void)
482 struct proc_dir_entry *pe;
484 pe = proc_create("sched_debug", 0444, NULL, &sched_debug_fops);
490 __initcall(init_sched_debug_procfs);
492 void proc_sched_show_task(struct task_struct *p, struct seq_file *m)
494 unsigned long nr_switches;
496 SEQ_printf(m, "%s (%d, #threads: %d)\n", p->comm, p->pid,
499 "---------------------------------------------------------\n");
501 SEQ_printf(m, "%-35s:%21Ld\n", #F, (long long)F)
503 SEQ_printf(m, "%-35s:%21Ld\n", #F, (long long)p->F)
505 SEQ_printf(m, "%-35s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)F))
507 SEQ_printf(m, "%-35s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)p->F))
511 PN(se.sum_exec_runtime);
513 nr_switches = p->nvcsw + p->nivcsw;
515 #ifdef CONFIG_SCHEDSTATS
516 PN(se.statistics.wait_start);
517 PN(se.statistics.sleep_start);
518 PN(se.statistics.block_start);
519 PN(se.statistics.sleep_max);
520 PN(se.statistics.block_max);
521 PN(se.statistics.exec_max);
522 PN(se.statistics.slice_max);
523 PN(se.statistics.wait_max);
524 PN(se.statistics.wait_sum);
525 P(se.statistics.wait_count);
526 PN(se.statistics.iowait_sum);
527 P(se.statistics.iowait_count);
529 P(se.statistics.nr_migrations_cold);
530 P(se.statistics.nr_failed_migrations_affine);
531 P(se.statistics.nr_failed_migrations_running);
532 P(se.statistics.nr_failed_migrations_hot);
533 P(se.statistics.nr_forced_migrations);
534 P(se.statistics.nr_wakeups);
535 P(se.statistics.nr_wakeups_sync);
536 P(se.statistics.nr_wakeups_migrate);
537 P(se.statistics.nr_wakeups_local);
538 P(se.statistics.nr_wakeups_remote);
539 P(se.statistics.nr_wakeups_affine);
540 P(se.statistics.nr_wakeups_affine_attempts);
541 P(se.statistics.nr_wakeups_passive);
542 P(se.statistics.nr_wakeups_idle);
545 u64 avg_atom, avg_per_cpu;
547 avg_atom = p->se.sum_exec_runtime;
549 do_div(avg_atom, nr_switches);
553 avg_per_cpu = p->se.sum_exec_runtime;
554 if (p->se.nr_migrations) {
555 avg_per_cpu = div64_u64(avg_per_cpu,
556 p->se.nr_migrations);
566 SEQ_printf(m, "%-35s:%21Ld\n",
567 "nr_voluntary_switches", (long long)p->nvcsw);
568 SEQ_printf(m, "%-35s:%21Ld\n",
569 "nr_involuntary_switches", (long long)p->nivcsw);
580 unsigned int this_cpu = raw_smp_processor_id();
583 t0 = cpu_clock(this_cpu);
584 t1 = cpu_clock(this_cpu);
585 SEQ_printf(m, "%-35s:%21Ld\n",
586 "clock-delta", (long long)(t1-t0));
590 void proc_sched_set_task(struct task_struct *p)
592 #ifdef CONFIG_SCHEDSTATS
593 memset(&p->se.statistics, 0, sizeof(p->se.statistics));