2 * kernel/time/sched_debug.c
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>
20 * This allows printing both to /proc/sched_debug and
23 #define SEQ_printf(m, x...) \
32 * Ease the printing of nsec fields:
34 static long long nsec_high(unsigned long long nsec)
36 if ((long long)nsec < 0) {
38 do_div(nsec, 1000000);
41 do_div(nsec, 1000000);
46 static unsigned long nsec_low(unsigned long long nsec)
48 if ((long long)nsec < 0)
51 return do_div(nsec, 1000000);
54 #define SPLIT_NS(x) nsec_high(x), nsec_low(x)
57 print_task(struct seq_file *m, struct rq *rq, struct task_struct *p)
64 SEQ_printf(m, "%15s %5d %9Ld.%06ld %9Ld %5d ",
66 SPLIT_NS(p->se.vruntime),
67 (long long)(p->nvcsw + p->nivcsw),
69 #ifdef CONFIG_SCHEDSTATS
70 SEQ_printf(m, "%9Ld.%06ld %9Ld.%06ld %9Ld.%06ld",
71 SPLIT_NS(p->se.vruntime),
72 SPLIT_NS(p->se.sum_exec_runtime),
73 SPLIT_NS(p->se.sum_sleep_runtime));
75 SEQ_printf(m, "%15Ld %15Ld %15Ld.%06ld %15Ld.%06ld %15Ld.%06ld",
76 0LL, 0LL, 0LL, 0L, 0LL, 0L, 0LL, 0L);
79 #ifdef CONFIG_CGROUP_SCHED
83 cgroup_path(task_group(p)->css.cgroup, path, sizeof(path));
84 SEQ_printf(m, " %s", path);
90 static void print_rq(struct seq_file *m, struct rq *rq, int rq_cpu)
92 struct task_struct *g, *p;
97 " task PID tree-key switches prio"
98 " exec-runtime sum-exec sum-sleep\n"
99 "------------------------------------------------------"
100 "----------------------------------------------------\n");
102 read_lock_irqsave(&tasklist_lock, flags);
104 do_each_thread(g, p) {
105 if (!p->se.on_rq || task_cpu(p) != rq_cpu)
108 print_task(m, rq, p);
109 } while_each_thread(g, p);
111 read_unlock_irqrestore(&tasklist_lock, flags);
114 void print_cfs_rq(struct seq_file *m, int cpu, struct cfs_rq *cfs_rq)
116 s64 MIN_vruntime = -1, min_vruntime, max_vruntime = -1,
117 spread, rq0_min_vruntime, spread0;
118 struct rq *rq = &per_cpu(runqueues, cpu);
119 struct sched_entity *last;
122 #if !defined(CONFIG_CGROUP_SCHED) || !defined(CONFIG_USER_SCHED)
123 SEQ_printf(m, "\ncfs_rq[%d]:\n", cpu);
126 struct cgroup *cgroup = NULL;
127 struct task_group *tg = cfs_rq->tg;
130 cgroup = tg->css.cgroup;
133 cgroup_path(cgroup, path, sizeof(path));
135 SEQ_printf(m, "\ncfs_rq[%d]:%s\n", cpu, path);
138 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "exec_clock",
139 SPLIT_NS(cfs_rq->exec_clock));
141 spin_lock_irqsave(&rq->lock, flags);
142 if (cfs_rq->rb_leftmost)
143 MIN_vruntime = (__pick_next_entity(cfs_rq))->vruntime;
144 last = __pick_last_entity(cfs_rq);
146 max_vruntime = last->vruntime;
147 min_vruntime = rq->cfs.min_vruntime;
148 rq0_min_vruntime = per_cpu(runqueues, 0).cfs.min_vruntime;
149 spin_unlock_irqrestore(&rq->lock, flags);
150 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "MIN_vruntime",
151 SPLIT_NS(MIN_vruntime));
152 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "min_vruntime",
153 SPLIT_NS(min_vruntime));
154 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "max_vruntime",
155 SPLIT_NS(max_vruntime));
156 spread = max_vruntime - MIN_vruntime;
157 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread",
159 spread0 = min_vruntime - rq0_min_vruntime;
160 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread0",
162 SEQ_printf(m, " .%-30s: %ld\n", "nr_running", cfs_rq->nr_running);
163 SEQ_printf(m, " .%-30s: %ld\n", "load", cfs_rq->load.weight);
164 #ifdef CONFIG_SCHEDSTATS
165 SEQ_printf(m, " .%-30s: %d\n", "bkl_count",
168 SEQ_printf(m, " .%-30s: %ld\n", "nr_spread_over",
169 cfs_rq->nr_spread_over);
170 #ifdef CONFIG_FAIR_GROUP_SCHED
172 SEQ_printf(m, " .%-30s: %lu\n", "shares", cfs_rq->shares);
177 static void print_cpu(struct seq_file *m, int cpu)
179 struct rq *rq = &per_cpu(runqueues, cpu);
183 unsigned int freq = cpu_khz ? : 1;
185 SEQ_printf(m, "\ncpu#%d, %u.%03u MHz\n",
186 cpu, freq / 1000, (freq % 1000));
189 SEQ_printf(m, "\ncpu#%d\n", cpu);
193 SEQ_printf(m, " .%-30s: %Ld\n", #x, (long long)(rq->x))
195 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rq->x))
198 SEQ_printf(m, " .%-30s: %lu\n", "load",
202 P(nr_uninterruptible);
203 SEQ_printf(m, " .%-30s: %lu\n", "jiffies", jiffies);
212 P(clock_deep_idle_events);
222 print_cfs_stats(m, cpu);
224 print_rq(m, rq, cpu);
227 static int sched_debug_show(struct seq_file *m, void *v)
229 u64 now = ktime_to_ns(ktime_get());
232 SEQ_printf(m, "Sched Debug Version: v0.07, %s %.*s\n",
233 init_utsname()->release,
234 (int)strcspn(init_utsname()->version, " "),
235 init_utsname()->version);
237 SEQ_printf(m, "now at %Lu.%06ld msecs\n", SPLIT_NS(now));
240 SEQ_printf(m, " .%-40s: %Ld\n", #x, (long long)(x))
242 SEQ_printf(m, " .%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
243 PN(sysctl_sched_latency);
244 PN(sysctl_sched_min_granularity);
245 PN(sysctl_sched_wakeup_granularity);
246 PN(sysctl_sched_child_runs_first);
247 P(sysctl_sched_features);
251 for_each_online_cpu(cpu)
259 static void sysrq_sched_debug_show(void)
261 sched_debug_show(NULL, NULL);
264 static int sched_debug_open(struct inode *inode, struct file *filp)
266 return single_open(filp, sched_debug_show, NULL);
269 static const struct file_operations sched_debug_fops = {
270 .open = sched_debug_open,
273 .release = single_release,
276 static int __init init_sched_debug_procfs(void)
278 struct proc_dir_entry *pe;
280 pe = proc_create("sched_debug", 0644, NULL, &sched_debug_fops);
286 __initcall(init_sched_debug_procfs);
288 void proc_sched_show_task(struct task_struct *p, struct seq_file *m)
290 unsigned long nr_switches;
295 if (lock_task_sighand(p, &flags)) {
296 num_threads = atomic_read(&p->signal->count);
297 unlock_task_sighand(p, &flags);
301 SEQ_printf(m, "%s (%d, #threads: %d)\n", p->comm, p->pid, num_threads);
303 "---------------------------------------------------------\n");
305 SEQ_printf(m, "%-35s:%21Ld\n", #F, (long long)F)
307 SEQ_printf(m, "%-35s:%21Ld\n", #F, (long long)p->F)
309 SEQ_printf(m, "%-35s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)F))
311 SEQ_printf(m, "%-35s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)p->F))
315 PN(se.sum_exec_runtime);
318 nr_switches = p->nvcsw + p->nivcsw;
320 #ifdef CONFIG_SCHEDSTATS
331 P(sched_info.bkl_count);
333 P(se.nr_migrations_cold);
334 P(se.nr_failed_migrations_affine);
335 P(se.nr_failed_migrations_running);
336 P(se.nr_failed_migrations_hot);
337 P(se.nr_forced_migrations);
338 P(se.nr_forced2_migrations);
340 P(se.nr_wakeups_sync);
341 P(se.nr_wakeups_migrate);
342 P(se.nr_wakeups_local);
343 P(se.nr_wakeups_remote);
344 P(se.nr_wakeups_affine);
345 P(se.nr_wakeups_affine_attempts);
346 P(se.nr_wakeups_passive);
347 P(se.nr_wakeups_idle);
350 u64 avg_atom, avg_per_cpu;
352 avg_atom = p->se.sum_exec_runtime;
354 do_div(avg_atom, nr_switches);
358 avg_per_cpu = p->se.sum_exec_runtime;
359 if (p->se.nr_migrations) {
360 avg_per_cpu = div64_u64(avg_per_cpu,
361 p->se.nr_migrations);
371 SEQ_printf(m, "%-35s:%21Ld\n",
372 "nr_voluntary_switches", (long long)p->nvcsw);
373 SEQ_printf(m, "%-35s:%21Ld\n",
374 "nr_involuntary_switches", (long long)p->nivcsw);
389 SEQ_printf(m, "%-35s:%21Ld\n",
390 "clock-delta", (long long)(t1-t0));
394 void proc_sched_set_task(struct task_struct *p)
396 #ifdef CONFIG_SCHEDSTATS
399 p->se.wait_count = 0;
401 p->se.sum_sleep_runtime = 0;
405 p->se.nr_migrations = 0;
406 p->se.nr_migrations_cold = 0;
407 p->se.nr_failed_migrations_affine = 0;
408 p->se.nr_failed_migrations_running = 0;
409 p->se.nr_failed_migrations_hot = 0;
410 p->se.nr_forced_migrations = 0;
411 p->se.nr_forced2_migrations = 0;
412 p->se.nr_wakeups = 0;
413 p->se.nr_wakeups_sync = 0;
414 p->se.nr_wakeups_migrate = 0;
415 p->se.nr_wakeups_local = 0;
416 p->se.nr_wakeups_remote = 0;
417 p->se.nr_wakeups_affine = 0;
418 p->se.nr_wakeups_affine_attempts = 0;
419 p->se.nr_wakeups_passive = 0;
420 p->se.nr_wakeups_idle = 0;
421 p->sched_info.bkl_count = 0;
423 p->se.sum_exec_runtime = 0;
424 p->se.prev_sum_exec_runtime = 0;