projects / linux-2.6-block.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
Merge branch 'core-locking-for-linus' of git://git.kernel.org/pub/scm/linux/kernel...
[linux-2.6-block.git] / kernel / sched_debug.c
CommitLineData
43ae34cb
IM		 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
ef83a571
IM		 31/*
32 * Ease the printing of nsec fields:
33 */
90b2628f 34static long long nsec_high(unsigned long long nsec)
ef83a571 35{
90b2628f 36 if ((long long)nsec < 0) {
ef83a571
IM		 37 nsec = -nsec;
38 do_div(nsec, 1000000);
39 return -nsec;
40 }
41 do_div(nsec, 1000000);
42
43 return nsec;
44}
45
90b2628f 46static unsigned long nsec_low(unsigned long long nsec)
ef83a571 47{
90b2628f 48 if ((long long)nsec < 0)
ef83a571
IM		 49 nsec = -nsec;
50
51 return do_div(nsec, 1000000);
52}
53
54#define SPLIT_NS(x) nsec_high(x), nsec_low(x)
55
ff9b48c3
BR		 56#ifdef CONFIG_FAIR_GROUP_SCHED
57static void print_cfs_group_stats(struct seq_file *m, int cpu,
58 struct task_group *tg)
59{
60 struct sched_entity *se = tg->se[cpu];
61 if (!se)
62 return;
63
64#define P(F) \
65 SEQ_printf(m, " .%-30s: %lld\n", #F, (long long)F)
66#define PN(F) \
67 SEQ_printf(m, " .%-30s: %lld.%06ld\n", #F, SPLIT_NS((long long)F))
68
69 PN(se->exec_start);
70 PN(se->vruntime);
71 PN(se->sum_exec_runtime);
72#ifdef CONFIG_SCHEDSTATS
73 PN(se->wait_start);
74 PN(se->sleep_start);
75 PN(se->block_start);
76 PN(se->sleep_max);
77 PN(se->block_max);
78 PN(se->exec_max);
79 PN(se->slice_max);
80 PN(se->wait_max);
81 PN(se->wait_sum);
82 P(se->wait_count);
83#endif
84 P(se->load.weight);
85#undef PN
86#undef P
87}
88#endif
89
43ae34cb 90static void
a48da48b 91print_task(struct seq_file *m, struct rq *rq, struct task_struct *p)
43ae34cb
IM		 92{
93 if (rq->curr == p)
94 SEQ_printf(m, "R");
95 else
96 SEQ_printf(m, " ");
97
ef83a571 98 SEQ_printf(m, "%15s %5d %9Ld.%06ld %9Ld %5d ",
43ae34cb 99 p->comm, p->pid,
ef83a571 100 SPLIT_NS(p->se.vruntime),
43ae34cb 101 (long long)(p->nvcsw + p->nivcsw),
6f605d83 102 p->prio);
6cfb0d5d 103#ifdef CONFIG_SCHEDSTATS
d19ca308 104 SEQ_printf(m, "%9Ld.%06ld %9Ld.%06ld %9Ld.%06ld",
ef83a571
IM		 105 SPLIT_NS(p->se.vruntime),
106 SPLIT_NS(p->se.sum_exec_runtime),
107 SPLIT_NS(p->se.sum_sleep_runtime));
6cfb0d5d 108#else
d19ca308 109 SEQ_printf(m, "%15Ld %15Ld %15Ld.%06ld %15Ld.%06ld %15Ld.%06ld",
ef83a571 110 0LL, 0LL, 0LL, 0L, 0LL, 0L, 0LL, 0L);
6cfb0d5d 111#endif
d19ca308
PZ		 112
113#ifdef CONFIG_CGROUP_SCHED
114 {
115 char path[64];
116
b629317e 117 rcu_read_lock();
d19ca308 118 cgroup_path(task_group(p)->css.cgroup, path, sizeof(path));
b629317e 119 rcu_read_unlock();
d19ca308
PZ		 120 SEQ_printf(m, " %s", path);
121 }
122#endif
123 SEQ_printf(m, "\n");
43ae34cb
IM		 124}
125
a48da48b 126static void print_rq(struct seq_file *m, struct rq *rq, int rq_cpu)
43ae34cb
IM		 127{
128 struct task_struct *g, *p;
ab63a633 129 unsigned long flags;
43ae34cb
IM		 130
131 SEQ_printf(m,
132 "\nrunnable tasks:\n"
c86da3a3
MG		 133 " task PID tree-key switches prio"
134 " exec-runtime sum-exec sum-sleep\n"
1a75b94f 135 "------------------------------------------------------"
c86da3a3 136 "----------------------------------------------------\n");
43ae34cb 137
ab63a633 138 read_lock_irqsave(&tasklist_lock, flags);
43ae34cb
IM		 139
140 do_each_thread(g, p) {
141 if (!p->se.on_rq || task_cpu(p) != rq_cpu)
142 continue;
143
a48da48b 144 print_task(m, rq, p);
43ae34cb
IM		 145 } while_each_thread(g, p);
146
ab63a633 147 read_unlock_irqrestore(&tasklist_lock, flags);
43ae34cb
IM		 148}
149
805194c3
LZ		 150#if defined(CONFIG_CGROUP_SCHED) && \
151 (defined(CONFIG_FAIR_GROUP_SCHED) || defined(CONFIG_RT_GROUP_SCHED))
152static void task_group_path(struct task_group *tg, char *buf, int buflen)
153{
154 /* may be NULL if the underlying cgroup isn't fully-created yet */
155 if (!tg->css.cgroup) {
156 buf[0] = '\0';
157 return;
158 }
159 cgroup_path(tg->css.cgroup, buf, buflen);
160}
161#endif
162
5cef9eca 163void print_cfs_rq(struct seq_file *m, int cpu, struct cfs_rq *cfs_rq)
43ae34cb 164{
86d9560c
IM		 165 s64 MIN_vruntime = -1, min_vruntime, max_vruntime = -1,
166 spread, rq0_min_vruntime, spread0;
348ec61e 167 struct rq *rq = cpu_rq(cpu);
67e12eac
IM		 168 struct sched_entity *last;
169 unsigned long flags;
170
ada18de2 171#if defined(CONFIG_CGROUP_SCHED) && defined(CONFIG_FAIR_GROUP_SCHED)
805194c3 172 char path[128];
d19ca308
PZ		 173 struct task_group *tg = cfs_rq->tg;
174
805194c3 175 task_group_path(tg, path, sizeof(path));
d19ca308
PZ		 176
177 SEQ_printf(m, "\ncfs_rq[%d]:%s\n", cpu, path);
6c415b92
AB		 178#elif defined(CONFIG_USER_SCHED) && defined(CONFIG_FAIR_GROUP_SCHED)
179 {
180 uid_t uid = cfs_rq->tg->uid;
181 SEQ_printf(m, "\ncfs_rq[%d] for UID: %u\n", cpu, uid);
182 }
ada18de2
PZ		 183#else
184 SEQ_printf(m, "\ncfs_rq[%d]:\n", cpu);
d19ca308 185#endif
ef83a571
IM		 186 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "exec_clock",
187 SPLIT_NS(cfs_rq->exec_clock));
67e12eac 188
05fa785c 189 raw_spin_lock_irqsave(&rq->lock, flags);
67e12eac
IM		 190 if (cfs_rq->rb_leftmost)
191 MIN_vruntime = (__pick_next_entity(cfs_rq))->vruntime;
192 last = __pick_last_entity(cfs_rq);
193 if (last)
194 max_vruntime = last->vruntime;
5ac5c4d6 195 min_vruntime = cfs_rq->min_vruntime;
348ec61e 196 rq0_min_vruntime = cpu_rq(0)->cfs.min_vruntime;
05fa785c 197 raw_spin_unlock_irqrestore(&rq->lock, flags);
ef83a571
IM		 198 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "MIN_vruntime",
199 SPLIT_NS(MIN_vruntime));
200 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "min_vruntime",
201 SPLIT_NS(min_vruntime));
202 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "max_vruntime",
203 SPLIT_NS(max_vruntime));
67e12eac 204 spread = max_vruntime - MIN_vruntime;
ef83a571
IM		 205 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread",
206 SPLIT_NS(spread));
86d9560c 207 spread0 = min_vruntime - rq0_min_vruntime;
ef83a571
IM		 208 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread0",
209 SPLIT_NS(spread0));
545f3b18
SV		 210 SEQ_printf(m, " .%-30s: %ld\n", "nr_running", cfs_rq->nr_running);
211 SEQ_printf(m, " .%-30s: %ld\n", "load", cfs_rq->load.weight);
32df2ee8 212
5ac5c4d6 213 SEQ_printf(m, " .%-30s: %d\n", "nr_spread_over",
ddc97297 214 cfs_rq->nr_spread_over);
c09595f6
PZ		 215#ifdef CONFIG_FAIR_GROUP_SCHED
216#ifdef CONFIG_SMP
217 SEQ_printf(m, " .%-30s: %lu\n", "shares", cfs_rq->shares);
218#endif
ff9b48c3 219 print_cfs_group_stats(m, cpu, cfs_rq->tg);
c09595f6 220#endif
43ae34cb
IM		 221}
222
ada18de2
PZ		 223void print_rt_rq(struct seq_file *m, int cpu, struct rt_rq *rt_rq)
224{
225#if defined(CONFIG_CGROUP_SCHED) && defined(CONFIG_RT_GROUP_SCHED)
805194c3 226 char path[128];
ada18de2
PZ		 227 struct task_group *tg = rt_rq->tg;
228
805194c3 229 task_group_path(tg, path, sizeof(path));
ada18de2
PZ		 230
231 SEQ_printf(m, "\nrt_rq[%d]:%s\n", cpu, path);
232#else
233 SEQ_printf(m, "\nrt_rq[%d]:\n", cpu);
234#endif
235
236
237#define P(x) \
238 SEQ_printf(m, " .%-30s: %Ld\n", #x, (long long)(rt_rq->x))
239#define PN(x) \
240 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rt_rq->x))
241
242 P(rt_nr_running);
243 P(rt_throttled);
244 PN(rt_time);
245 PN(rt_runtime);
246
247#undef PN
248#undef P
249}
250
a48da48b 251static void print_cpu(struct seq_file *m, int cpu)
43ae34cb 252{
348ec61e 253 struct rq *rq = cpu_rq(cpu);
43ae34cb
IM		 254
255#ifdef CONFIG_X86
256 {
257 unsigned int freq = cpu_khz ? : 1;
258
259 SEQ_printf(m, "\ncpu#%d, %u.%03u MHz\n",
260 cpu, freq / 1000, (freq % 1000));
261 }
262#else
263 SEQ_printf(m, "\ncpu#%d\n", cpu);
264#endif
265
266#define P(x) \
267 SEQ_printf(m, " .%-30s: %Ld\n", #x, (long long)(rq->x))
ef83a571
IM		 268#define PN(x) \
269 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rq->x))
43ae34cb
IM		 270
271 P(nr_running);
272 SEQ_printf(m, " .%-30s: %lu\n", "load",
495eca49 273 rq->load.weight);
43ae34cb
IM		 274 P(nr_switches);
275 P(nr_load_updates);
276 P(nr_uninterruptible);
ef83a571 277 PN(next_balance);
43ae34cb 278 P(curr->pid);
ef83a571 279 PN(clock);
43ae34cb
IM		 280 P(cpu_load[0]);
281 P(cpu_load[1]);
282 P(cpu_load[2]);
283 P(cpu_load[3]);
284 P(cpu_load[4]);
285#undef P
ef83a571 286#undef PN
43ae34cb 287
5ac5c4d6
PZ		 288#ifdef CONFIG_SCHEDSTATS
289#define P(n) SEQ_printf(m, " .%-30s: %d\n", #n, rq->n);
1b9508f6 290#define P64(n) SEQ_printf(m, " .%-30s: %Ld\n", #n, rq->n);
5ac5c4d6 291
5ac5c4d6
PZ		 292 P(yld_count);
293
294 P(sched_switch);
295 P(sched_count);
296 P(sched_goidle);
1b9508f6
MG		 297#ifdef CONFIG_SMP
298 P64(avg_idle);
299#endif
5ac5c4d6
PZ		 300
301 P(ttwu_count);
302 P(ttwu_local);
303
304 P(bkl_count);
305
306#undef P
307#endif
5cef9eca 308 print_cfs_stats(m, cpu);
ada18de2 309 print_rt_stats(m, cpu);
43ae34cb 310
a48da48b 311 print_rq(m, rq, cpu);
43ae34cb
IM		 312}
313
1983a922
CE		 314static const char *sched_tunable_scaling_names[] = {
315 "none",
316 "logaritmic",
317 "linear"
318};
319
43ae34cb
IM		 320static int sched_debug_show(struct seq_file *m, void *v)
321{
322 u64 now = ktime_to_ns(ktime_get());
323 int cpu;
324
67aa0f76 325 SEQ_printf(m, "Sched Debug Version: v0.09, %s %.*s\n",
43ae34cb
IM		 326 init_utsname()->release,
327 (int)strcspn(init_utsname()->version, " "),
328 init_utsname()->version);
329
ef83a571 330 SEQ_printf(m, "now at %Lu.%06ld msecs\n", SPLIT_NS(now));
43ae34cb 331
1aa4731e 332#define P(x) \
d822cece 333 SEQ_printf(m, " .%-40s: %Ld\n", #x, (long long)(x))
1aa4731e 334#define PN(x) \
d822cece 335 SEQ_printf(m, " .%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
af66df5e 336 P(jiffies);
1aa4731e 337 PN(sysctl_sched_latency);
b2be5e96 338 PN(sysctl_sched_min_granularity);
1aa4731e 339 PN(sysctl_sched_wakeup_granularity);
1aa4731e
IM		 340 PN(sysctl_sched_child_runs_first);
341 P(sysctl_sched_features);
342#undef PN
343#undef P
344
1983a922
CE		 345 SEQ_printf(m, " .%-40s: %d (%s)\n", "sysctl_sched_tunable_scaling",
346 sysctl_sched_tunable_scaling,
347 sched_tunable_scaling_names[sysctl_sched_tunable_scaling]);
348
43ae34cb 349 for_each_online_cpu(cpu)
a48da48b 350 print_cpu(m, cpu);
43ae34cb
IM		 351
352 SEQ_printf(m, "\n");
353
354 return 0;
355}
356
f3373461 357static void sysrq_sched_debug_show(void)
43ae34cb
IM		 358{
359 sched_debug_show(NULL, NULL);
360}
361
362static int sched_debug_open(struct inode *inode, struct file *filp)
363{
364 return single_open(filp, sched_debug_show, NULL);
365}
366
0dbee3a6 367static const struct file_operations sched_debug_fops = {
43ae34cb
IM		 368 .open = sched_debug_open,
369 .read = seq_read,
370 .llseek = seq_lseek,
5ea473a1 371 .release = single_release,
43ae34cb
IM		 372};
373
374static int __init init_sched_debug_procfs(void)
375{
376 struct proc_dir_entry *pe;
377
a9cf4ddb 378 pe = proc_create("sched_debug", 0444, NULL, &sched_debug_fops);
43ae34cb
IM		 379 if (!pe)
380 return -ENOMEM;
43ae34cb
IM		 381 return 0;
382}
383
384__initcall(init_sched_debug_procfs);
385
386void proc_sched_show_task(struct task_struct *p, struct seq_file *m)
387{
cc367732 388 unsigned long nr_switches;
43ae34cb
IM		 389 unsigned long flags;
390 int num_threads = 1;
391
43ae34cb
IM		 392 if (lock_task_sighand(p, &flags)) {
393 num_threads = atomic_read(&p->signal->count);
394 unlock_task_sighand(p, &flags);
395 }
43ae34cb
IM		 396
397 SEQ_printf(m, "%s (%d, #threads: %d)\n", p->comm, p->pid, num_threads);
2d92f227
IM		 398 SEQ_printf(m,
399 "---------------------------------------------------------\n");
cc367732
IM		 400#define __P(F) \
401 SEQ_printf(m, "%-35s:%21Ld\n", #F, (long long)F)
43ae34cb 402#define P(F) \
2d92f227 403 SEQ_printf(m, "%-35s:%21Ld\n", #F, (long long)p->F)
cc367732
IM		 404#define __PN(F) \
405 SEQ_printf(m, "%-35s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)F))
ef83a571 406#define PN(F) \
2d92f227 407 SEQ_printf(m, "%-35s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)p->F))
43ae34cb 408
ef83a571
IM		 409 PN(se.exec_start);
410 PN(se.vruntime);
411 PN(se.sum_exec_runtime);
4ae7d5ce 412 PN(se.avg_overlap);
831451ac 413 PN(se.avg_wakeup);
6cfb0d5d 414
cc367732
IM		 415 nr_switches = p->nvcsw + p->nivcsw;
416
6cfb0d5d 417#ifdef CONFIG_SCHEDSTATS
ef83a571
IM		 418 PN(se.wait_start);
419 PN(se.sleep_start);
420 PN(se.block_start);
421 PN(se.sleep_max);
422 PN(se.block_max);
423 PN(se.exec_max);
424 PN(se.slice_max);
425 PN(se.wait_max);
6d082592
AV		 426 PN(se.wait_sum);
427 P(se.wait_count);
8f0dfc34
AV		 428 PN(se.iowait_sum);
429 P(se.iowait_count);
2d72376b 430 P(sched_info.bkl_count);
cc367732
IM		 431 P(se.nr_migrations);
432 P(se.nr_migrations_cold);
433 P(se.nr_failed_migrations_affine);
434 P(se.nr_failed_migrations_running);
435 P(se.nr_failed_migrations_hot);
436 P(se.nr_forced_migrations);
cc367732
IM		 437 P(se.nr_wakeups);
438 P(se.nr_wakeups_sync);
439 P(se.nr_wakeups_migrate);
440 P(se.nr_wakeups_local);
441 P(se.nr_wakeups_remote);
442 P(se.nr_wakeups_affine);
443 P(se.nr_wakeups_affine_attempts);
444 P(se.nr_wakeups_passive);
445 P(se.nr_wakeups_idle);
446
447 {
448 u64 avg_atom, avg_per_cpu;
449
450 avg_atom = p->se.sum_exec_runtime;
451 if (nr_switches)
452 do_div(avg_atom, nr_switches);
453 else
454 avg_atom = -1LL;
455
456 avg_per_cpu = p->se.sum_exec_runtime;
c1a89740 457 if (p->se.nr_migrations) {
6f6d6a1a
RZ		 458 avg_per_cpu = div64_u64(avg_per_cpu,
459 p->se.nr_migrations);
c1a89740 460 } else {
cc367732 461 avg_per_cpu = -1LL;
c1a89740 462 }
cc367732
IM		 463
464 __PN(avg_atom);
465 __PN(avg_per_cpu);
466 }
6cfb0d5d 467#endif
cc367732 468 __P(nr_switches);
2d92f227 469 SEQ_printf(m, "%-35s:%21Ld\n",
cc367732
IM		 470 "nr_voluntary_switches", (long long)p->nvcsw);
471 SEQ_printf(m, "%-35s:%21Ld\n",
472 "nr_involuntary_switches", (long long)p->nivcsw);
473
43ae34cb
IM		 474 P(se.load.weight);
475 P(policy);
476 P(prio);
ef83a571 477#undef PN
cc367732
IM		 478#undef __PN
479#undef P
480#undef __P
43ae34cb
IM		 481
482 {
29d7b90c 483 unsigned int this_cpu = raw_smp_processor_id();
43ae34cb
IM		 484 u64 t0, t1;
485
29d7b90c
IM		 486 t0 = cpu_clock(this_cpu);
487 t1 = cpu_clock(this_cpu);
2d92f227 488 SEQ_printf(m, "%-35s:%21Ld\n",
43ae34cb
IM		 489 "clock-delta", (long long)(t1-t0));
490 }
491}
492
493void proc_sched_set_task(struct task_struct *p)
494{
6cfb0d5d 495#ifdef CONFIG_SCHEDSTATS
cc367732 496 p->se.wait_max = 0;
6d082592
AV		 497 p->se.wait_sum = 0;
498 p->se.wait_count = 0;
8f0dfc34
AV		 499 p->se.iowait_sum = 0;
500 p->se.iowait_count = 0;
cc367732
IM		 501 p->se.sleep_max = 0;
502 p->se.sum_sleep_runtime = 0;
503 p->se.block_max = 0;
504 p->se.exec_max = 0;
505 p->se.slice_max = 0;
506 p->se.nr_migrations = 0;
507 p->se.nr_migrations_cold = 0;
508 p->se.nr_failed_migrations_affine = 0;
509 p->se.nr_failed_migrations_running = 0;
510 p->se.nr_failed_migrations_hot = 0;
511 p->se.nr_forced_migrations = 0;
cc367732
IM		 512 p->se.nr_wakeups = 0;
513 p->se.nr_wakeups_sync = 0;
514 p->se.nr_wakeups_migrate = 0;
515 p->se.nr_wakeups_local = 0;
516 p->se.nr_wakeups_remote = 0;
517 p->se.nr_wakeups_affine = 0;
518 p->se.nr_wakeups_affine_attempts = 0;
519 p->se.nr_wakeups_passive = 0;
520 p->se.nr_wakeups_idle = 0;
521 p->sched_info.bkl_count = 0;
6cfb0d5d 522#endif
43ae34cb 523}
Linux 6.x block layer and io_uring tree(s)