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(long long nsec
)
38 do_div(nsec
, 1000000);
41 do_div(nsec
, 1000000);
46 static unsigned long nsec_low(long long nsec
)
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\n",
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\n",
76 0LL, 0LL, 0LL, 0L, 0LL, 0L, 0LL, 0L);
80 static void print_rq(struct seq_file
*m
, struct rq
*rq
, int rq_cpu
)
82 struct task_struct
*g
, *p
;
87 " task PID tree-key switches prio"
88 " exec-runtime sum-exec sum-sleep\n"
89 "------------------------------------------------------"
90 "----------------------------------------------------\n");
92 read_lock_irqsave(&tasklist_lock
, flags
);
94 do_each_thread(g
, p
) {
95 if (!p
->se
.on_rq
|| task_cpu(p
) != rq_cpu
)
99 } while_each_thread(g
, p
);
101 read_unlock_irqrestore(&tasklist_lock
, flags
);
104 void print_cfs_rq(struct seq_file
*m
, int cpu
, struct cfs_rq
*cfs_rq
)
106 s64 MIN_vruntime
= -1, min_vruntime
, max_vruntime
= -1,
107 spread
, rq0_min_vruntime
, spread0
;
108 struct rq
*rq
= &per_cpu(runqueues
, cpu
);
109 struct sched_entity
*last
;
112 SEQ_printf(m
, "\ncfs_rq\n");
114 SEQ_printf(m
, " .%-30s: %Ld.%06ld\n", "exec_clock",
115 SPLIT_NS(cfs_rq
->exec_clock
));
117 spin_lock_irqsave(&rq
->lock
, flags
);
118 if (cfs_rq
->rb_leftmost
)
119 MIN_vruntime
= (__pick_next_entity(cfs_rq
))->vruntime
;
120 last
= __pick_last_entity(cfs_rq
);
122 max_vruntime
= last
->vruntime
;
123 min_vruntime
= rq
->cfs
.min_vruntime
;
124 rq0_min_vruntime
= per_cpu(runqueues
, 0).cfs
.min_vruntime
;
125 spin_unlock_irqrestore(&rq
->lock
, flags
);
126 SEQ_printf(m
, " .%-30s: %Ld.%06ld\n", "MIN_vruntime",
127 SPLIT_NS(MIN_vruntime
));
128 SEQ_printf(m
, " .%-30s: %Ld.%06ld\n", "min_vruntime",
129 SPLIT_NS(min_vruntime
));
130 SEQ_printf(m
, " .%-30s: %Ld.%06ld\n", "max_vruntime",
131 SPLIT_NS(max_vruntime
));
132 spread
= max_vruntime
- MIN_vruntime
;
133 SEQ_printf(m
, " .%-30s: %Ld.%06ld\n", "spread",
135 spread0
= min_vruntime
- rq0_min_vruntime
;
136 SEQ_printf(m
, " .%-30s: %Ld.%06ld\n", "spread0",
138 SEQ_printf(m
, " .%-30s: %ld\n", "nr_running", cfs_rq
->nr_running
);
139 SEQ_printf(m
, " .%-30s: %ld\n", "load", cfs_rq
->load
.weight
);
140 #ifdef CONFIG_SCHEDSTATS
141 SEQ_printf(m
, " .%-30s: %d\n", "bkl_count",
144 SEQ_printf(m
, " .%-30s: %ld\n", "nr_spread_over",
145 cfs_rq
->nr_spread_over
);
148 static void print_cpu(struct seq_file
*m
, int cpu
)
150 struct rq
*rq
= &per_cpu(runqueues
, cpu
);
154 unsigned int freq
= cpu_khz
? : 1;
156 SEQ_printf(m
, "\ncpu#%d, %u.%03u MHz\n",
157 cpu
, freq
/ 1000, (freq
% 1000));
160 SEQ_printf(m
, "\ncpu#%d\n", cpu
);
164 SEQ_printf(m, " .%-30s: %Ld\n", #x, (long long)(rq->x))
166 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rq->x))
169 SEQ_printf(m
, " .%-30s: %lu\n", "load",
173 P(nr_uninterruptible
);
174 SEQ_printf(m
, " .%-30s: %lu\n", "jiffies", jiffies
);
182 P(clock_deep_idle_events
);
192 print_cfs_stats(m
, cpu
);
194 print_rq(m
, rq
, cpu
);
197 static int sched_debug_show(struct seq_file
*m
, void *v
)
199 u64 now
= ktime_to_ns(ktime_get());
202 SEQ_printf(m
, "Sched Debug Version: v0.06-v22, %s %.*s\n",
203 init_utsname()->release
,
204 (int)strcspn(init_utsname()->version
, " "),
205 init_utsname()->version
);
207 SEQ_printf(m
, "now at %Lu.%06ld msecs\n", SPLIT_NS(now
));
210 SEQ_printf(m, " .%-40s: %Ld\n", #x, (long long)(x))
212 SEQ_printf(m, " .%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
213 PN(sysctl_sched_latency
);
214 PN(sysctl_sched_min_granularity
);
215 PN(sysctl_sched_wakeup_granularity
);
216 PN(sysctl_sched_batch_wakeup_granularity
);
217 PN(sysctl_sched_child_runs_first
);
218 P(sysctl_sched_features
);
222 for_each_online_cpu(cpu
)
230 static void sysrq_sched_debug_show(void)
232 sched_debug_show(NULL
, NULL
);
235 static int sched_debug_open(struct inode
*inode
, struct file
*filp
)
237 return single_open(filp
, sched_debug_show
, NULL
);
240 static const struct file_operations sched_debug_fops
= {
241 .open
= sched_debug_open
,
244 .release
= single_release
,
247 static int __init
init_sched_debug_procfs(void)
249 struct proc_dir_entry
*pe
;
251 pe
= create_proc_entry("sched_debug", 0644, NULL
);
255 pe
->proc_fops
= &sched_debug_fops
;
260 __initcall(init_sched_debug_procfs
);
262 void proc_sched_show_task(struct task_struct
*p
, struct seq_file
*m
)
264 unsigned long nr_switches
;
269 if (lock_task_sighand(p
, &flags
)) {
270 num_threads
= atomic_read(&p
->signal
->count
);
271 unlock_task_sighand(p
, &flags
);
275 SEQ_printf(m
, "%s (%d, #threads: %d)\n", p
->comm
, p
->pid
, num_threads
);
277 "---------------------------------------------------------\n");
279 SEQ_printf(m, "%-35s:%21Ld\n", #F, (long long)F)
281 SEQ_printf(m, "%-35s:%21Ld\n", #F, (long long)p->F)
283 SEQ_printf(m, "%-35s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)F))
285 SEQ_printf(m, "%-35s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)p->F))
289 PN(se
.sum_exec_runtime
);
291 nr_switches
= p
->nvcsw
+ p
->nivcsw
;
293 #ifdef CONFIG_SCHEDSTATS
302 P(sched_info
.bkl_count
);
304 P(se
.nr_migrations_cold
);
305 P(se
.nr_failed_migrations_affine
);
306 P(se
.nr_failed_migrations_running
);
307 P(se
.nr_failed_migrations_hot
);
308 P(se
.nr_forced_migrations
);
309 P(se
.nr_forced2_migrations
);
311 P(se
.nr_wakeups_sync
);
312 P(se
.nr_wakeups_migrate
);
313 P(se
.nr_wakeups_local
);
314 P(se
.nr_wakeups_remote
);
315 P(se
.nr_wakeups_affine
);
316 P(se
.nr_wakeups_affine_attempts
);
317 P(se
.nr_wakeups_passive
);
318 P(se
.nr_wakeups_idle
);
321 u64 avg_atom
, avg_per_cpu
;
323 avg_atom
= p
->se
.sum_exec_runtime
;
325 do_div(avg_atom
, nr_switches
);
329 avg_per_cpu
= p
->se
.sum_exec_runtime
;
330 if (p
->se
.nr_migrations
)
331 avg_per_cpu
= div64_64(avg_per_cpu
, p
->se
.nr_migrations
);
340 SEQ_printf(m
, "%-35s:%21Ld\n",
341 "nr_voluntary_switches", (long long)p
->nvcsw
);
342 SEQ_printf(m
, "%-35s:%21Ld\n",
343 "nr_involuntary_switches", (long long)p
->nivcsw
);
358 SEQ_printf(m
, "%-35s:%21Ld\n",
359 "clock-delta", (long long)(t1
-t0
));
363 void proc_sched_set_task(struct task_struct
*p
)
365 #ifdef CONFIG_SCHEDSTATS
368 p
->se
.sum_sleep_runtime
= 0;
372 p
->se
.nr_migrations
= 0;
373 p
->se
.nr_migrations_cold
= 0;
374 p
->se
.nr_failed_migrations_affine
= 0;
375 p
->se
.nr_failed_migrations_running
= 0;
376 p
->se
.nr_failed_migrations_hot
= 0;
377 p
->se
.nr_forced_migrations
= 0;
378 p
->se
.nr_forced2_migrations
= 0;
379 p
->se
.nr_wakeups
= 0;
380 p
->se
.nr_wakeups_sync
= 0;
381 p
->se
.nr_wakeups_migrate
= 0;
382 p
->se
.nr_wakeups_local
= 0;
383 p
->se
.nr_wakeups_remote
= 0;
384 p
->se
.nr_wakeups_affine
= 0;
385 p
->se
.nr_wakeups_affine_attempts
= 0;
386 p
->se
.nr_wakeups_passive
= 0;
387 p
->se
.nr_wakeups_idle
= 0;
388 p
->sched_info
.bkl_count
= 0;
390 p
->se
.sum_exec_runtime
= 0;
391 p
->se
.prev_sum_exec_runtime
= 0;