sched: group scheduler, fix bloat
[deliverable/linux.git] / kernel / sched_debug.c
1 /*
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
31 /*
32 * Ease the printing of nsec fields:
33 */
34 static 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
46 static 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
56 static void
57 print_task(struct seq_file *m, struct rq *rq, struct task_struct *p)
58 {
59 if (rq->curr == p)
60 SEQ_printf(m, "R");
61 else
62 SEQ_printf(m, " ");
63
64 SEQ_printf(m, "%15s %5d %9Ld.%06ld %9Ld %5d ",
65 p->comm, p->pid,
66 SPLIT_NS(p->se.vruntime),
67 (long long)(p->nvcsw + p->nivcsw),
68 p->prio);
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));
74 #else
75 SEQ_printf(m, "%15Ld %15Ld %15Ld.%06ld %15Ld.%06ld %15Ld.%06ld\n",
76 0LL, 0LL, 0LL, 0L, 0LL, 0L, 0LL, 0L);
77 #endif
78 }
79
80 static void print_rq(struct seq_file *m, struct rq *rq, int rq_cpu)
81 {
82 struct task_struct *g, *p;
83
84 SEQ_printf(m,
85 "\nrunnable tasks:\n"
86 " task PID tree-key switches prio"
87 " exec-runtime sum-exec sum-sleep\n"
88 "------------------------------------------------------"
89 "----------------------------------------------------\n");
90
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
97 print_task(m, rq, p);
98 } while_each_thread(g, p);
99
100 read_unlock_irq(&tasklist_lock);
101 }
102
103 void print_cfs_rq(struct seq_file *m, int cpu, struct cfs_rq *cfs_rq)
104 {
105 s64 MIN_vruntime = -1, min_vruntime, max_vruntime = -1,
106 spread, rq0_min_vruntime, spread0;
107 struct rq *rq = &per_cpu(runqueues, cpu);
108 struct sched_entity *last;
109 unsigned long flags;
110
111 SEQ_printf(m, "\ncfs_rq\n");
112
113 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "exec_clock",
114 SPLIT_NS(cfs_rq->exec_clock));
115
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;
122 min_vruntime = rq->cfs.min_vruntime;
123 rq0_min_vruntime = per_cpu(runqueues, 0).cfs.min_vruntime;
124 spin_unlock_irqrestore(&rq->lock, flags);
125 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));
131 spread = max_vruntime - MIN_vruntime;
132 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread",
133 SPLIT_NS(spread));
134 spread0 = min_vruntime - rq0_min_vruntime;
135 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread0",
136 SPLIT_NS(spread0));
137 SEQ_printf(m, " .%-30s: %ld\n", "nr_running", cfs_rq->nr_running);
138 SEQ_printf(m, " .%-30s: %ld\n", "load", cfs_rq->load.weight);
139 #ifdef CONFIG_SCHEDSTATS
140 SEQ_printf(m, " .%-30s: %ld\n", "bkl_count",
141 rq->bkl_count);
142 #endif
143 SEQ_printf(m, " .%-30s: %ld\n", "nr_spread_over",
144 cfs_rq->nr_spread_over);
145 }
146
147 static void print_cpu(struct seq_file *m, int cpu)
148 {
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))
164 #define PN(x) \
165 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rq->x))
166
167 P(nr_running);
168 SEQ_printf(m, " .%-30s: %lu\n", "load",
169 rq->load.weight);
170 P(nr_switches);
171 P(nr_load_updates);
172 P(nr_uninterruptible);
173 SEQ_printf(m, " .%-30s: %lu\n", "jiffies", jiffies);
174 PN(next_balance);
175 P(curr->pid);
176 PN(clock);
177 PN(idle_clock);
178 PN(prev_clock_raw);
179 P(clock_warps);
180 P(clock_overflows);
181 P(clock_deep_idle_events);
182 PN(clock_max_delta);
183 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
189 #undef PN
190
191 print_cfs_stats(m, cpu);
192
193 print_rq(m, rq, cpu);
194 }
195
196 static int sched_debug_show(struct seq_file *m, void *v)
197 {
198 u64 now = ktime_to_ns(ktime_get());
199 int cpu;
200
201 SEQ_printf(m, "Sched Debug Version: v0.05-v20, %s %.*s\n",
202 init_utsname()->release,
203 (int)strcspn(init_utsname()->version, " "),
204 init_utsname()->version);
205
206 SEQ_printf(m, "now at %Lu.%06ld msecs\n", SPLIT_NS(now));
207
208 #define P(x) \
209 SEQ_printf(m, " .%-40s: %Ld\n", #x, (long long)(x))
210 #define PN(x) \
211 SEQ_printf(m, " .%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
212 PN(sysctl_sched_latency);
213 PN(sysctl_sched_nr_latency);
214 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
221 for_each_online_cpu(cpu)
222 print_cpu(m, cpu);
223
224 SEQ_printf(m, "\n");
225
226 return 0;
227 }
228
229 static void sysrq_sched_debug_show(void)
230 {
231 sched_debug_show(NULL, NULL);
232 }
233
234 #ifdef CONFIG_FAIR_USER_SCHED
235
236 static DEFINE_MUTEX(root_user_share_mutex);
237
238 static int
239 root_user_share_read_proc(char *page, char **start, off_t off, int count,
240 int *eof, void *data)
241 {
242 return sprintf(page, "%d\n", init_task_grp_load);
243 }
244
245 static int
246 root_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
273 static int sched_debug_open(struct inode *inode, struct file *filp)
274 {
275 return single_open(filp, sched_debug_show, NULL);
276 }
277
278 static struct file_operations sched_debug_fops = {
279 .open = sched_debug_open,
280 .read = seq_read,
281 .llseek = seq_lseek,
282 .release = single_release,
283 };
284
285 static 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
295 #ifdef CONFIG_FAIR_USER_SCHED
296 pe = create_proc_entry("root_user_cpu_share", 0644, NULL);
297 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
304 return 0;
305 }
306
307 __initcall(init_sched_debug_procfs);
308
309 void 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)
325 #define PN(F) \
326 SEQ_printf(m, "%-25s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)p->F))
327
328 PN(se.exec_start);
329 PN(se.vruntime);
330 PN(se.sum_exec_runtime);
331
332 #ifdef CONFIG_SCHEDSTATS
333 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);
341 P(sched_info.bkl_count);
342 #endif
343 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
349 #undef PN
350
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
361 void proc_sched_set_task(struct task_struct *p)
362 {
363 #ifdef CONFIG_SCHEDSTATS
364 p->se.sleep_max = 0;
365 p->se.block_max = 0;
366 p->se.exec_max = 0;
367 p->se.slice_max = 0;
368 p->se.wait_max = 0;
369 p->sched_info.bkl_count = 0;
370 #endif
371 p->se.sum_exec_runtime = 0;
372 p->se.prev_sum_exec_runtime = 0;
373 }
This page took 0.039652 seconds and 5 git commands to generate.