blob: 48748d04144d5c720dc7c44335b8b15400a774d1 [file] [log] [blame]
Ingo Molnar43ae34c2007-07-09 18:52:00 +02001/*
2 * kernel/time/sched_debug.c
3 *
4 * Print the CFS rbtree
5 *
6 * Copyright(C) 2007, Red Hat, Inc., Ingo Molnar
7 *
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.
11 */
12
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>
18
19/*
20 * This allows printing both to /proc/sched_debug and
21 * to the console
22 */
23#define SEQ_printf(m, x...) \
24 do { \
25 if (m) \
26 seq_printf(m, x); \
27 else \
28 printk(x); \
29 } while (0)
30
Ingo Molnaref83a572007-10-15 17:00:08 +020031/*
32 * Ease the printing of nsec fields:
33 */
34static long long nsec_high(long long nsec)
35{
36 if (nsec < 0) {
37 nsec = -nsec;
38 do_div(nsec, 1000000);
39 return -nsec;
40 }
41 do_div(nsec, 1000000);
42
43 return nsec;
44}
45
46static unsigned long nsec_low(long long nsec)
47{
48 if (nsec < 0)
49 nsec = -nsec;
50
51 return do_div(nsec, 1000000);
52}
53
54#define SPLIT_NS(x) nsec_high(x), nsec_low(x)
55
Ingo Molnar43ae34c2007-07-09 18:52:00 +020056static void
Ingo Molnara48da482007-08-09 11:16:51 +020057print_task(struct seq_file *m, struct rq *rq, struct task_struct *p)
Ingo Molnar43ae34c2007-07-09 18:52:00 +020058{
59 if (rq->curr == p)
60 SEQ_printf(m, "R");
61 else
62 SEQ_printf(m, " ");
63
Ingo Molnaref83a572007-10-15 17:00:08 +020064 SEQ_printf(m, "%15s %5d %9Ld.%06ld %9Ld %5d ",
Ingo Molnar43ae34c2007-07-09 18:52:00 +020065 p->comm, p->pid,
Ingo Molnaref83a572007-10-15 17:00:08 +020066 SPLIT_NS(p->se.vruntime),
Ingo Molnar43ae34c2007-07-09 18:52:00 +020067 (long long)(p->nvcsw + p->nivcsw),
Al Viro6f605d82007-08-06 04:26:59 +010068 p->prio);
Ingo Molnar6cfb0d52007-08-02 17:41:40 +020069#ifdef CONFIG_SCHEDSTATS
Mike Galbraithc86da3a2007-10-15 17:00:08 +020070 SEQ_printf(m, "%9Ld.%06ld %9Ld.%06ld %9Ld.%06ld\n",
Ingo Molnaref83a572007-10-15 17:00:08 +020071 SPLIT_NS(p->se.vruntime),
72 SPLIT_NS(p->se.sum_exec_runtime),
73 SPLIT_NS(p->se.sum_sleep_runtime));
Ingo Molnar6cfb0d52007-08-02 17:41:40 +020074#else
Ingo Molnaref83a572007-10-15 17:00:08 +020075 SEQ_printf(m, "%15Ld %15Ld %15Ld.%06ld %15Ld.%06ld %15Ld.%06ld\n",
76 0LL, 0LL, 0LL, 0L, 0LL, 0L, 0LL, 0L);
Ingo Molnar6cfb0d52007-08-02 17:41:40 +020077#endif
Ingo Molnar43ae34c2007-07-09 18:52:00 +020078}
79
Ingo Molnara48da482007-08-09 11:16:51 +020080static void print_rq(struct seq_file *m, struct rq *rq, int rq_cpu)
Ingo Molnar43ae34c2007-07-09 18:52:00 +020081{
82 struct task_struct *g, *p;
83
84 SEQ_printf(m,
85 "\nrunnable tasks:\n"
Mike Galbraithc86da3a2007-10-15 17:00:08 +020086 " task PID tree-key switches prio"
87 " exec-runtime sum-exec sum-sleep\n"
Ingo Molnar1a75b942007-10-15 17:00:08 +020088 "------------------------------------------------------"
Mike Galbraithc86da3a2007-10-15 17:00:08 +020089 "----------------------------------------------------\n");
Ingo Molnar43ae34c2007-07-09 18:52:00 +020090
91 read_lock_irq(&tasklist_lock);
92
93 do_each_thread(g, p) {
94 if (!p->se.on_rq || task_cpu(p) != rq_cpu)
95 continue;
96
Ingo Molnara48da482007-08-09 11:16:51 +020097 print_task(m, rq, p);
Ingo Molnar43ae34c2007-07-09 18:52:00 +020098 } while_each_thread(g, p);
99
100 read_unlock_irq(&tasklist_lock);
101}
102
Ingo Molnar5cef9ec2007-08-09 11:16:47 +0200103void print_cfs_rq(struct seq_file *m, int cpu, struct cfs_rq *cfs_rq)
Ingo Molnar43ae34c2007-07-09 18:52:00 +0200104{
Ingo Molnar86d95602007-10-15 17:00:06 +0200105 s64 MIN_vruntime = -1, min_vruntime, max_vruntime = -1,
106 spread, rq0_min_vruntime, spread0;
Ingo Molnar67e12ea2007-10-15 17:00:05 +0200107 struct rq *rq = &per_cpu(runqueues, cpu);
108 struct sched_entity *last;
109 unsigned long flags;
110
Ingo Molnar5167e752007-08-10 23:05:11 +0200111 SEQ_printf(m, "\ncfs_rq\n");
Ingo Molnar43ae34c2007-07-09 18:52:00 +0200112
Ingo Molnaref83a572007-10-15 17:00:08 +0200113 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "exec_clock",
114 SPLIT_NS(cfs_rq->exec_clock));
Ingo Molnar67e12ea2007-10-15 17:00:05 +0200115
116 spin_lock_irqsave(&rq->lock, flags);
117 if (cfs_rq->rb_leftmost)
118 MIN_vruntime = (__pick_next_entity(cfs_rq))->vruntime;
119 last = __pick_last_entity(cfs_rq);
120 if (last)
121 max_vruntime = last->vruntime;
Ingo Molnar86d95602007-10-15 17:00:06 +0200122 min_vruntime = rq->cfs.min_vruntime;
123 rq0_min_vruntime = per_cpu(runqueues, 0).cfs.min_vruntime;
Ingo Molnar67e12ea2007-10-15 17:00:05 +0200124 spin_unlock_irqrestore(&rq->lock, flags);
Ingo Molnaref83a572007-10-15 17:00:08 +0200125 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "MIN_vruntime",
126 SPLIT_NS(MIN_vruntime));
127 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "min_vruntime",
128 SPLIT_NS(min_vruntime));
129 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "max_vruntime",
130 SPLIT_NS(max_vruntime));
Ingo Molnar67e12ea2007-10-15 17:00:05 +0200131 spread = max_vruntime - MIN_vruntime;
Ingo Molnaref83a572007-10-15 17:00:08 +0200132 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread",
133 SPLIT_NS(spread));
Ingo Molnar86d95602007-10-15 17:00:06 +0200134 spread0 = min_vruntime - rq0_min_vruntime;
Ingo Molnaref83a572007-10-15 17:00:08 +0200135 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread0",
136 SPLIT_NS(spread0));
Srivatsa Vaddagiri545f3b12007-10-15 17:00:09 +0200137 SEQ_printf(m, " .%-30s: %ld\n", "nr_running", cfs_rq->nr_running);
138 SEQ_printf(m, " .%-30s: %ld\n", "load", cfs_rq->load.weight);
S.Caglar Onurfdd71d12007-10-15 17:00:10 +0200139#ifdef CONFIG_SCHEDSTATS
Ingo Molnar2d723762007-10-15 17:00:12 +0200140 SEQ_printf(m, " .%-30s: %ld\n", "bkl_count",
141 rq->bkl_count);
S.Caglar Onurfdd71d12007-10-15 17:00:10 +0200142#endif
Peter Zijlstraddc97292007-10-15 17:00:10 +0200143 SEQ_printf(m, " .%-30s: %ld\n", "nr_spread_over",
144 cfs_rq->nr_spread_over);
Ingo Molnar43ae34c2007-07-09 18:52:00 +0200145}
146
Ingo Molnara48da482007-08-09 11:16:51 +0200147static void print_cpu(struct seq_file *m, int cpu)
Ingo Molnar43ae34c2007-07-09 18:52:00 +0200148{
149 struct rq *rq = &per_cpu(runqueues, cpu);
150
151#ifdef CONFIG_X86
152 {
153 unsigned int freq = cpu_khz ? : 1;
154
155 SEQ_printf(m, "\ncpu#%d, %u.%03u MHz\n",
156 cpu, freq / 1000, (freq % 1000));
157 }
158#else
159 SEQ_printf(m, "\ncpu#%d\n", cpu);
160#endif
161
162#define P(x) \
163 SEQ_printf(m, " .%-30s: %Ld\n", #x, (long long)(rq->x))
Ingo Molnaref83a572007-10-15 17:00:08 +0200164#define PN(x) \
165 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rq->x))
Ingo Molnar43ae34c2007-07-09 18:52:00 +0200166
167 P(nr_running);
168 SEQ_printf(m, " .%-30s: %lu\n", "load",
Dmitry Adamushko495eca42007-10-15 17:00:06 +0200169 rq->load.weight);
Ingo Molnar43ae34c2007-07-09 18:52:00 +0200170 P(nr_switches);
171 P(nr_load_updates);
172 P(nr_uninterruptible);
173 SEQ_printf(m, " .%-30s: %lu\n", "jiffies", jiffies);
Ingo Molnaref83a572007-10-15 17:00:08 +0200174 PN(next_balance);
Ingo Molnar43ae34c2007-07-09 18:52:00 +0200175 P(curr->pid);
Ingo Molnaref83a572007-10-15 17:00:08 +0200176 PN(clock);
177 PN(idle_clock);
178 PN(prev_clock_raw);
Ingo Molnar43ae34c2007-07-09 18:52:00 +0200179 P(clock_warps);
180 P(clock_overflows);
Ingo Molnar2aa44d02007-08-23 15:18:02 +0200181 P(clock_deep_idle_events);
Ingo Molnaref83a572007-10-15 17:00:08 +0200182 PN(clock_max_delta);
Ingo Molnar43ae34c2007-07-09 18:52:00 +0200183 P(cpu_load[0]);
184 P(cpu_load[1]);
185 P(cpu_load[2]);
186 P(cpu_load[3]);
187 P(cpu_load[4]);
188#undef P
Ingo Molnaref83a572007-10-15 17:00:08 +0200189#undef PN
Ingo Molnar43ae34c2007-07-09 18:52:00 +0200190
Ingo Molnar5cef9ec2007-08-09 11:16:47 +0200191 print_cfs_stats(m, cpu);
Ingo Molnar43ae34c2007-07-09 18:52:00 +0200192
Ingo Molnara48da482007-08-09 11:16:51 +0200193 print_rq(m, rq, cpu);
Ingo Molnar43ae34c2007-07-09 18:52:00 +0200194}
195
196static int sched_debug_show(struct seq_file *m, void *v)
197{
198 u64 now = ktime_to_ns(ktime_get());
199 int cpu;
200
Ingo Molnar6cfb0d52007-08-02 17:41:40 +0200201 SEQ_printf(m, "Sched Debug Version: v0.05-v20, %s %.*s\n",
Ingo Molnar43ae34c2007-07-09 18:52:00 +0200202 init_utsname()->release,
203 (int)strcspn(init_utsname()->version, " "),
204 init_utsname()->version);
205
Ingo Molnaref83a572007-10-15 17:00:08 +0200206 SEQ_printf(m, "now at %Lu.%06ld msecs\n", SPLIT_NS(now));
Ingo Molnar43ae34c2007-07-09 18:52:00 +0200207
Ingo Molnar1aa47312007-10-15 17:00:10 +0200208#define P(x) \
Ingo Molnard822cec2007-10-15 17:00:10 +0200209 SEQ_printf(m, " .%-40s: %Ld\n", #x, (long long)(x))
Ingo Molnar1aa47312007-10-15 17:00:10 +0200210#define PN(x) \
Ingo Molnard822cec2007-10-15 17:00:10 +0200211 SEQ_printf(m, " .%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
Ingo Molnar1aa47312007-10-15 17:00:10 +0200212 PN(sysctl_sched_latency);
Peter Zijlstra5f6d858e2007-10-15 17:00:12 +0200213 PN(sysctl_sched_nr_latency);
Ingo Molnar1aa47312007-10-15 17:00:10 +0200214 PN(sysctl_sched_wakeup_granularity);
215 PN(sysctl_sched_batch_wakeup_granularity);
216 PN(sysctl_sched_child_runs_first);
217 P(sysctl_sched_features);
218#undef PN
219#undef P
220
Ingo Molnar43ae34c2007-07-09 18:52:00 +0200221 for_each_online_cpu(cpu)
Ingo Molnara48da482007-08-09 11:16:51 +0200222 print_cpu(m, cpu);
Ingo Molnar43ae34c2007-07-09 18:52:00 +0200223
224 SEQ_printf(m, "\n");
225
226 return 0;
227}
228
Josh Triplettf33734612007-07-26 13:40:43 +0200229static void sysrq_sched_debug_show(void)
Ingo Molnar43ae34c2007-07-09 18:52:00 +0200230{
231 sched_debug_show(NULL, NULL);
232}
233
Srivatsa Vaddagiri24e377a2007-10-15 17:00:09 +0200234#ifdef CONFIG_FAIR_USER_SCHED
235
236static DEFINE_MUTEX(root_user_share_mutex);
237
238static int
239root_user_share_read_proc(char *page, char **start, off_t off, int count,
240 int *eof, void *data)
241{
Srivatsa Vaddagirifb615582007-10-15 17:00:12 +0200242 return sprintf(page, "%d\n", init_task_grp_load);
Srivatsa Vaddagiri24e377a2007-10-15 17:00:09 +0200243}
244
245static int
246root_user_share_write_proc(struct file *file, const char __user *buffer,
247 unsigned long count, void *data)
248{
249 unsigned long shares;
250 char kbuf[sizeof(unsigned long)+1];
251 int rc = 0;
252
253 if (copy_from_user(kbuf, buffer, sizeof(kbuf)))
254 return -EFAULT;
255
256 shares = simple_strtoul(kbuf, NULL, 0);
257
258 if (!shares)
259 shares = NICE_0_LOAD;
260
261 mutex_lock(&root_user_share_mutex);
262
263 init_task_grp_load = shares;
264 rc = sched_group_set_shares(&init_task_grp, shares);
265
266 mutex_unlock(&root_user_share_mutex);
267
268 return (rc < 0 ? rc : count);
269}
270
271#endif /* CONFIG_FAIR_USER_SCHED */
272
Ingo Molnar43ae34c2007-07-09 18:52:00 +0200273static int sched_debug_open(struct inode *inode, struct file *filp)
274{
275 return single_open(filp, sched_debug_show, NULL);
276}
277
278static struct file_operations sched_debug_fops = {
279 .open = sched_debug_open,
280 .read = seq_read,
281 .llseek = seq_lseek,
Alexey Dobriyan5ea473a2007-07-31 00:38:50 -0700282 .release = single_release,
Ingo Molnar43ae34c2007-07-09 18:52:00 +0200283};
284
285static int __init init_sched_debug_procfs(void)
286{
287 struct proc_dir_entry *pe;
288
289 pe = create_proc_entry("sched_debug", 0644, NULL);
290 if (!pe)
291 return -ENOMEM;
292
293 pe->proc_fops = &sched_debug_fops;
294
Srivatsa Vaddagiri24e377a2007-10-15 17:00:09 +0200295#ifdef CONFIG_FAIR_USER_SCHED
Srivatsa Vaddagirifb615582007-10-15 17:00:12 +0200296 pe = create_proc_entry("root_user_cpu_share", 0644, NULL);
Srivatsa Vaddagiri24e377a2007-10-15 17:00:09 +0200297 if (!pe)
298 return -ENOMEM;
299
300 pe->read_proc = root_user_share_read_proc;
301 pe->write_proc = root_user_share_write_proc;
302#endif
303
Ingo Molnar43ae34c2007-07-09 18:52:00 +0200304 return 0;
305}
306
307__initcall(init_sched_debug_procfs);
308
309void proc_sched_show_task(struct task_struct *p, struct seq_file *m)
310{
311 unsigned long flags;
312 int num_threads = 1;
313
314 rcu_read_lock();
315 if (lock_task_sighand(p, &flags)) {
316 num_threads = atomic_read(&p->signal->count);
317 unlock_task_sighand(p, &flags);
318 }
319 rcu_read_unlock();
320
321 SEQ_printf(m, "%s (%d, #threads: %d)\n", p->comm, p->pid, num_threads);
322 SEQ_printf(m, "----------------------------------------------\n");
323#define P(F) \
324 SEQ_printf(m, "%-25s:%20Ld\n", #F, (long long)p->F)
Ingo Molnaref83a572007-10-15 17:00:08 +0200325#define PN(F) \
326 SEQ_printf(m, "%-25s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)p->F))
Ingo Molnar43ae34c2007-07-09 18:52:00 +0200327
Ingo Molnaref83a572007-10-15 17:00:08 +0200328 PN(se.exec_start);
329 PN(se.vruntime);
330 PN(se.sum_exec_runtime);
Ingo Molnar6cfb0d52007-08-02 17:41:40 +0200331
332#ifdef CONFIG_SCHEDSTATS
Ingo Molnaref83a572007-10-15 17:00:08 +0200333 PN(se.wait_start);
334 PN(se.sleep_start);
335 PN(se.block_start);
336 PN(se.sleep_max);
337 PN(se.block_max);
338 PN(se.exec_max);
339 PN(se.slice_max);
340 PN(se.wait_max);
Ingo Molnar2d723762007-10-15 17:00:12 +0200341 P(sched_info.bkl_count);
Ingo Molnar6cfb0d52007-08-02 17:41:40 +0200342#endif
Ingo Molnar43ae34c2007-07-09 18:52:00 +0200343 SEQ_printf(m, "%-25s:%20Ld\n",
344 "nr_switches", (long long)(p->nvcsw + p->nivcsw));
345 P(se.load.weight);
346 P(policy);
347 P(prio);
348#undef P
Ingo Molnaref83a572007-10-15 17:00:08 +0200349#undef PN
Ingo Molnar43ae34c2007-07-09 18:52:00 +0200350
351 {
352 u64 t0, t1;
353
354 t0 = sched_clock();
355 t1 = sched_clock();
356 SEQ_printf(m, "%-25s:%20Ld\n",
357 "clock-delta", (long long)(t1-t0));
358 }
359}
360
361void proc_sched_set_task(struct task_struct *p)
362{
Ingo Molnar6cfb0d52007-08-02 17:41:40 +0200363#ifdef CONFIG_SCHEDSTATS
Ingo Molnara4b29ba2007-10-15 17:00:02 +0200364 p->se.sleep_max = 0;
365 p->se.block_max = 0;
366 p->se.exec_max = 0;
Ingo Molnareba1ed42007-10-15 17:00:02 +0200367 p->se.slice_max = 0;
Ingo Molnara4b29ba2007-10-15 17:00:02 +0200368 p->se.wait_max = 0;
Ingo Molnar2d723762007-10-15 17:00:12 +0200369 p->sched_info.bkl_count = 0;
Ingo Molnar6cfb0d52007-08-02 17:41:40 +0200370#endif
Ingo Molnara4b29ba2007-10-15 17:00:02 +0200371 p->se.sum_exec_runtime = 0;
Ingo Molnar2491b2b2007-09-05 14:32:49 +0200372 p->se.prev_sum_exec_runtime = 0;
Ingo Molnar43ae34c2007-07-09 18:52:00 +0200373}