projects / linux-2.6-block.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
Merge tag 'pwm/for-4.9-rc1' of git://git.kernel.org/pub/scm/linux/kernel/git/thierry...
[linux-2.6-block.git] / kernel / sched / debug.c
CommitLineData
43ae34cb 1/*
391e43da 2 * kernel/sched/debug.c
43ae34cb
IM		 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>
b32e86b4 18#include <linux/mempolicy.h>
d6ca41d7 19#include <linux/debugfs.h>
43ae34cb 20
029632fb
PZ		 21#include "sched.h"
22
efe25c2c
BR		 23static DEFINE_SPINLOCK(sched_debug_lock);
24
43ae34cb
IM		 25/*
26 * This allows printing both to /proc/sched_debug and
27 * to the console
28 */
29#define SEQ_printf(m, x...) \
30 do { \
31 if (m) \
32 seq_printf(m, x); \
33 else \
34 printk(x); \
35 } while (0)
36
ef83a571
IM		 37/*
38 * Ease the printing of nsec fields:
39 */
90b2628f 40static long long nsec_high(unsigned long long nsec)
ef83a571 41{
90b2628f 42 if ((long long)nsec < 0) {
ef83a571
IM		 43 nsec = -nsec;
44 do_div(nsec, 1000000);
45 return -nsec;
46 }
47 do_div(nsec, 1000000);
48
49 return nsec;
50}
51
90b2628f 52static unsigned long nsec_low(unsigned long long nsec)
ef83a571 53{
90b2628f 54 if ((long long)nsec < 0)
ef83a571
IM		 55 nsec = -nsec;
56
57 return do_div(nsec, 1000000);
58}
59
60#define SPLIT_NS(x) nsec_high(x), nsec_low(x)
61
d6ca41d7
SRRH		 62#define SCHED_FEAT(name, enabled) \
63 #name ,
64
65static const char * const sched_feat_names[] = {
66#include "features.h"
67};
68
69#undef SCHED_FEAT
70
71static int sched_feat_show(struct seq_file *m, void *v)
72{
73 int i;
74
75 for (i = 0; i < __SCHED_FEAT_NR; i++) {
76 if (!(sysctl_sched_features & (1UL << i)))
77 seq_puts(m, "NO_");
78 seq_printf(m, "%s ", sched_feat_names[i]);
79 }
80 seq_puts(m, "\n");
81
82 return 0;
83}
84
85#ifdef HAVE_JUMP_LABEL
86
87#define jump_label_key__true STATIC_KEY_INIT_TRUE
88#define jump_label_key__false STATIC_KEY_INIT_FALSE
89
90#define SCHED_FEAT(name, enabled) \
91 jump_label_key__##enabled ,
92
93struct static_key sched_feat_keys[__SCHED_FEAT_NR] = {
94#include "features.h"
95};
96
97#undef SCHED_FEAT
98
99static void sched_feat_disable(int i)
100{
101 static_key_disable(&sched_feat_keys[i]);
102}
103
104static void sched_feat_enable(int i)
105{
106 static_key_enable(&sched_feat_keys[i]);
107}
108#else
109static void sched_feat_disable(int i) { };
110static void sched_feat_enable(int i) { };
111#endif /* HAVE_JUMP_LABEL */
112
113static int sched_feat_set(char *cmp)
114{
115 int i;
116 int neg = 0;
117
118 if (strncmp(cmp, "NO_", 3) == 0) {
119 neg = 1;
120 cmp += 3;
121 }
122
123 for (i = 0; i < __SCHED_FEAT_NR; i++) {
124 if (strcmp(cmp, sched_feat_names[i]) == 0) {
125 if (neg) {
126 sysctl_sched_features &= ~(1UL << i);
127 sched_feat_disable(i);
128 } else {
129 sysctl_sched_features |= (1UL << i);
130 sched_feat_enable(i);
131 }
132 break;
133 }
134 }
135
136 return i;
137}
138
139static ssize_t
140sched_feat_write(struct file *filp, const char __user *ubuf,
141 size_t cnt, loff_t *ppos)
142{
143 char buf[64];
144 char *cmp;
145 int i;
146 struct inode *inode;
147
148 if (cnt > 63)
149 cnt = 63;
150
151 if (copy_from_user(&buf, ubuf, cnt))
152 return -EFAULT;
153
154 buf[cnt] = 0;
155 cmp = strstrip(buf);
156
157 /* Ensure the static_key remains in a consistent state */
158 inode = file_inode(filp);
159 inode_lock(inode);
160 i = sched_feat_set(cmp);
161 inode_unlock(inode);
162 if (i == __SCHED_FEAT_NR)
163 return -EINVAL;
164
165 *ppos += cnt;
166
167 return cnt;
168}
169
170static int sched_feat_open(struct inode *inode, struct file *filp)
171{
172 return single_open(filp, sched_feat_show, NULL);
173}
174
175static const struct file_operations sched_feat_fops = {
176 .open = sched_feat_open,
177 .write = sched_feat_write,
178 .read = seq_read,
179 .llseek = seq_lseek,
180 .release = single_release,
181};
182
183static __init int sched_init_debug(void)
184{
185 debugfs_create_file("sched_features", 0644, NULL, NULL,
186 &sched_feat_fops);
187
188 return 0;
189}
190late_initcall(sched_init_debug);
191
3866e845
SRRH		 192#ifdef CONFIG_SMP
193
194#ifdef CONFIG_SYSCTL
195
196static struct ctl_table sd_ctl_dir[] = {
197 {
198 .procname = "sched_domain",
199 .mode = 0555,
200 },
201 {}
202};
203
204static struct ctl_table sd_ctl_root[] = {
205 {
206 .procname = "kernel",
207 .mode = 0555,
208 .child = sd_ctl_dir,
209 },
210 {}
211};
212
213static struct ctl_table *sd_alloc_ctl_entry(int n)
214{
215 struct ctl_table *entry =
216 kcalloc(n, sizeof(struct ctl_table), GFP_KERNEL);
217
218 return entry;
219}
220
221static void sd_free_ctl_entry(struct ctl_table **tablep)
222{
223 struct ctl_table *entry;
224
225 /*
226 * In the intermediate directories, both the child directory and
227 * procname are dynamically allocated and could fail but the mode
228 * will always be set. In the lowest directory the names are
229 * static strings and all have proc handlers.
230 */
231 for (entry = *tablep; entry->mode; entry++) {
232 if (entry->child)
233 sd_free_ctl_entry(&entry->child);
234 if (entry->proc_handler == NULL)
235 kfree(entry->procname);
236 }
237
238 kfree(*tablep);
239 *tablep = NULL;
240}
241
242static int min_load_idx = 0;
243static int max_load_idx = CPU_LOAD_IDX_MAX-1;
244
245static void
246set_table_entry(struct ctl_table *entry,
247 const char *procname, void *data, int maxlen,
248 umode_t mode, proc_handler *proc_handler,
249 bool load_idx)
250{
251 entry->procname = procname;
252 entry->data = data;
253 entry->maxlen = maxlen;
254 entry->mode = mode;
255 entry->proc_handler = proc_handler;
256
257 if (load_idx) {
258 entry->extra1 = &min_load_idx;
259 entry->extra2 = &max_load_idx;
260 }
261}
262
263static struct ctl_table *
264sd_alloc_ctl_domain_table(struct sched_domain *sd)
265{
266 struct ctl_table *table = sd_alloc_ctl_entry(14);
267
268 if (table == NULL)
269 return NULL;
270
271 set_table_entry(&table[0], "min_interval", &sd->min_interval,
272 sizeof(long), 0644, proc_doulongvec_minmax, false);
273 set_table_entry(&table[1], "max_interval", &sd->max_interval,
274 sizeof(long), 0644, proc_doulongvec_minmax, false);
275 set_table_entry(&table[2], "busy_idx", &sd->busy_idx,
276 sizeof(int), 0644, proc_dointvec_minmax, true);
277 set_table_entry(&table[3], "idle_idx", &sd->idle_idx,
278 sizeof(int), 0644, proc_dointvec_minmax, true);
279 set_table_entry(&table[4], "newidle_idx", &sd->newidle_idx,
280 sizeof(int), 0644, proc_dointvec_minmax, true);
281 set_table_entry(&table[5], "wake_idx", &sd->wake_idx,
282 sizeof(int), 0644, proc_dointvec_minmax, true);
283 set_table_entry(&table[6], "forkexec_idx", &sd->forkexec_idx,
284 sizeof(int), 0644, proc_dointvec_minmax, true);
285 set_table_entry(&table[7], "busy_factor", &sd->busy_factor,
286 sizeof(int), 0644, proc_dointvec_minmax, false);
287 set_table_entry(&table[8], "imbalance_pct", &sd->imbalance_pct,
288 sizeof(int), 0644, proc_dointvec_minmax, false);
289 set_table_entry(&table[9], "cache_nice_tries",
290 &sd->cache_nice_tries,
291 sizeof(int), 0644, proc_dointvec_minmax, false);
292 set_table_entry(&table[10], "flags", &sd->flags,
293 sizeof(int), 0644, proc_dointvec_minmax, false);
294 set_table_entry(&table[11], "max_newidle_lb_cost",
295 &sd->max_newidle_lb_cost,
296 sizeof(long), 0644, proc_doulongvec_minmax, false);
297 set_table_entry(&table[12], "name", sd->name,
298 CORENAME_MAX_SIZE, 0444, proc_dostring, false);
299 /* &table[13] is terminator */
300
301 return table;
302}
303
304static struct ctl_table *sd_alloc_ctl_cpu_table(int cpu)
305{
306 struct ctl_table *entry, *table;
307 struct sched_domain *sd;
308 int domain_num = 0, i;
309 char buf[32];
310
311 for_each_domain(cpu, sd)
312 domain_num++;
313 entry = table = sd_alloc_ctl_entry(domain_num + 1);
314 if (table == NULL)
315 return NULL;
316
317 i = 0;
318 for_each_domain(cpu, sd) {
319 snprintf(buf, 32, "domain%d", i);
320 entry->procname = kstrdup(buf, GFP_KERNEL);
321 entry->mode = 0555;
322 entry->child = sd_alloc_ctl_domain_table(sd);
323 entry++;
324 i++;
325 }
326 return table;
327}
328
329static struct ctl_table_header *sd_sysctl_header;
330void register_sched_domain_sysctl(void)
331{
332 int i, cpu_num = num_possible_cpus();
333 struct ctl_table *entry = sd_alloc_ctl_entry(cpu_num + 1);
334 char buf[32];
335
336 WARN_ON(sd_ctl_dir[0].child);
337 sd_ctl_dir[0].child = entry;
338
339 if (entry == NULL)
340 return;
341
342 for_each_possible_cpu(i) {
343 snprintf(buf, 32, "cpu%d", i);
344 entry->procname = kstrdup(buf, GFP_KERNEL);
345 entry->mode = 0555;
346 entry->child = sd_alloc_ctl_cpu_table(i);
347 entry++;
348 }
349
350 WARN_ON(sd_sysctl_header);
351 sd_sysctl_header = register_sysctl_table(sd_ctl_root);
352}
353
354/* may be called multiple times per register */
355void unregister_sched_domain_sysctl(void)
356{
357 unregister_sysctl_table(sd_sysctl_header);
358 sd_sysctl_header = NULL;
359 if (sd_ctl_dir[0].child)
360 sd_free_ctl_entry(&sd_ctl_dir[0].child);
361}
362#endif /* CONFIG_SYSCTL */
363#endif /* CONFIG_SMP */
364
ff9b48c3 365#ifdef CONFIG_FAIR_GROUP_SCHED
5091faa4 366static void print_cfs_group_stats(struct seq_file *m, int cpu, struct task_group *tg)
ff9b48c3
BR		 367{
368 struct sched_entity *se = tg->se[cpu];
ff9b48c3
BR		 369
370#define P(F) \
371 SEQ_printf(m, " .%-30s: %lld\n", #F, (long long)F)
4fa8d299
JP		 372#define P_SCHEDSTAT(F) \
373 SEQ_printf(m, " .%-30s: %lld\n", #F, (long long)schedstat_val(F))
ff9b48c3
BR		 374#define PN(F) \
375 SEQ_printf(m, " .%-30s: %lld.%06ld\n", #F, SPLIT_NS((long long)F))
4fa8d299
JP		 376#define PN_SCHEDSTAT(F) \
377 SEQ_printf(m, " .%-30s: %lld.%06ld\n", #F, SPLIT_NS((long long)schedstat_val(F)))
ff9b48c3 378
cd126afe 379 if (!se)
18bf2805 380 return;
18bf2805 381
ff9b48c3
BR		 382 PN(se->exec_start);
383 PN(se->vruntime);
384 PN(se->sum_exec_runtime);
cb251765 385 if (schedstat_enabled()) {
4fa8d299
JP		 386 PN_SCHEDSTAT(se->statistics.wait_start);
387 PN_SCHEDSTAT(se->statistics.sleep_start);
388 PN_SCHEDSTAT(se->statistics.block_start);
389 PN_SCHEDSTAT(se->statistics.sleep_max);
390 PN_SCHEDSTAT(se->statistics.block_max);
391 PN_SCHEDSTAT(se->statistics.exec_max);
392 PN_SCHEDSTAT(se->statistics.slice_max);
393 PN_SCHEDSTAT(se->statistics.wait_max);
394 PN_SCHEDSTAT(se->statistics.wait_sum);
395 P_SCHEDSTAT(se->statistics.wait_count);
cb251765 396 }
ff9b48c3 397 P(se->load.weight);
9d85f21c 398#ifdef CONFIG_SMP
9d89c257
YD		 399 P(se->avg.load_avg);
400 P(se->avg.util_avg);
9d85f21c 401#endif
4fa8d299
JP		 402
403#undef PN_SCHEDSTAT
ff9b48c3 404#undef PN
4fa8d299 405#undef P_SCHEDSTAT
ff9b48c3
BR		 406#undef P
407}
408#endif
409
efe25c2c
BR		 410#ifdef CONFIG_CGROUP_SCHED
411static char group_path[PATH_MAX];
412
413static char *task_group_path(struct task_group *tg)
414{
8ecedd7a
BR		 415 if (autogroup_path(tg, group_path, PATH_MAX))
416 return group_path;
417
e61734c5 418 return cgroup_path(tg->css.cgroup, group_path, PATH_MAX);
efe25c2c
BR		 419}
420#endif
421
43ae34cb 422static void
a48da48b 423print_task(struct seq_file *m, struct rq *rq, struct task_struct *p)
43ae34cb
IM		 424{
425 if (rq->curr == p)
426 SEQ_printf(m, "R");
427 else
428 SEQ_printf(m, " ");
429
ef83a571 430 SEQ_printf(m, "%15s %5d %9Ld.%06ld %9Ld %5d ",
fc840914 431 p->comm, task_pid_nr(p),
ef83a571 432 SPLIT_NS(p->se.vruntime),
43ae34cb 433 (long long)(p->nvcsw + p->nivcsw),
6f605d83 434 p->prio);
9c572591 435
33d6176e 436 SEQ_printf(m, "%9Ld.%06ld %9Ld.%06ld %9Ld.%06ld",
20e1d486 437 SPLIT_NS(schedstat_val_or_zero(p->se.statistics.wait_sum)),
33d6176e 438 SPLIT_NS(p->se.sum_exec_runtime),
20e1d486 439 SPLIT_NS(schedstat_val_or_zero(p->se.statistics.sum_sleep_runtime)));
9c572591 440
b32e86b4 441#ifdef CONFIG_NUMA_BALANCING
e3d24d0a 442 SEQ_printf(m, " %d %d", task_node(p), task_numa_group_id(p));
b32e86b4 443#endif
efe25c2c
BR		 444#ifdef CONFIG_CGROUP_SCHED
445 SEQ_printf(m, " %s", task_group_path(task_group(p)));
446#endif
d19ca308 447
d19ca308 448 SEQ_printf(m, "\n");
43ae34cb
IM		 449}
450
a48da48b 451static void print_rq(struct seq_file *m, struct rq *rq, int rq_cpu)
43ae34cb
IM		 452{
453 struct task_struct *g, *p;
454
455 SEQ_printf(m,
456 "\nrunnable tasks:\n"
c86da3a3 457 " task PID tree-key switches prio"
c5f3ab1c 458 " wait-time sum-exec sum-sleep\n"
1a75b94f 459 "------------------------------------------------------"
c86da3a3 460 "----------------------------------------------------\n");
43ae34cb 461
5bd96ab6 462 rcu_read_lock();
d38e83c7 463 for_each_process_thread(g, p) {
b32e86b4 464 if (task_cpu(p) != rq_cpu)
43ae34cb
IM		 465 continue;
466
a48da48b 467 print_task(m, rq, p);
d38e83c7 468 }
5bd96ab6 469 rcu_read_unlock();
43ae34cb
IM		 470}
471
5cef9eca 472void print_cfs_rq(struct seq_file *m, int cpu, struct cfs_rq *cfs_rq)
43ae34cb 473{
86d9560c
IM		 474 s64 MIN_vruntime = -1, min_vruntime, max_vruntime = -1,
475 spread, rq0_min_vruntime, spread0;
348ec61e 476 struct rq *rq = cpu_rq(cpu);
67e12eac
IM		 477 struct sched_entity *last;
478 unsigned long flags;
479
efe25c2c
BR		 480#ifdef CONFIG_FAIR_GROUP_SCHED
481 SEQ_printf(m, "\ncfs_rq[%d]:%s\n", cpu, task_group_path(cfs_rq->tg));
482#else
ada18de2 483 SEQ_printf(m, "\ncfs_rq[%d]:\n", cpu);
efe25c2c 484#endif
ef83a571
IM		 485 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "exec_clock",
486 SPLIT_NS(cfs_rq->exec_clock));
67e12eac 487
05fa785c 488 raw_spin_lock_irqsave(&rq->lock, flags);
67e12eac 489 if (cfs_rq->rb_leftmost)
ac53db59 490 MIN_vruntime = (__pick_first_entity(cfs_rq))->vruntime;
67e12eac
IM		 491 last = __pick_last_entity(cfs_rq);
492 if (last)
493 max_vruntime = last->vruntime;
5ac5c4d6 494 min_vruntime = cfs_rq->min_vruntime;
348ec61e 495 rq0_min_vruntime = cpu_rq(0)->cfs.min_vruntime;
05fa785c 496 raw_spin_unlock_irqrestore(&rq->lock, flags);
ef83a571
IM		 497 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "MIN_vruntime",
498 SPLIT_NS(MIN_vruntime));
499 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "min_vruntime",
500 SPLIT_NS(min_vruntime));
501 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "max_vruntime",
502 SPLIT_NS(max_vruntime));
67e12eac 503 spread = max_vruntime - MIN_vruntime;
ef83a571
IM		 504 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread",
505 SPLIT_NS(spread));
86d9560c 506 spread0 = min_vruntime - rq0_min_vruntime;
ef83a571
IM		 507 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread0",
508 SPLIT_NS(spread0));
5ac5c4d6 509 SEQ_printf(m, " .%-30s: %d\n", "nr_spread_over",
ddc97297 510 cfs_rq->nr_spread_over);
c82513e5 511 SEQ_printf(m, " .%-30s: %d\n", "nr_running", cfs_rq->nr_running);
2069dd75 512 SEQ_printf(m, " .%-30s: %ld\n", "load", cfs_rq->load.weight);
c09595f6 513#ifdef CONFIG_SMP
9d89c257
YD		 514 SEQ_printf(m, " .%-30s: %lu\n", "load_avg",
515 cfs_rq->avg.load_avg);
13962234
YD		 516 SEQ_printf(m, " .%-30s: %lu\n", "runnable_load_avg",
517 cfs_rq->runnable_load_avg);
9d89c257
YD		 518 SEQ_printf(m, " .%-30s: %lu\n", "util_avg",
519 cfs_rq->avg.util_avg);
520 SEQ_printf(m, " .%-30s: %ld\n", "removed_load_avg",
521 atomic_long_read(&cfs_rq->removed_load_avg));
522 SEQ_printf(m, " .%-30s: %ld\n", "removed_util_avg",
523 atomic_long_read(&cfs_rq->removed_util_avg));
333bb864 524#ifdef CONFIG_FAIR_GROUP_SCHED
9d89c257
YD		 525 SEQ_printf(m, " .%-30s: %lu\n", "tg_load_avg_contrib",
526 cfs_rq->tg_load_avg_contrib);
333bb864
AS		 527 SEQ_printf(m, " .%-30s: %ld\n", "tg_load_avg",
528 atomic_long_read(&cfs_rq->tg->load_avg));
c09595f6 529#endif
333bb864 530#endif
f9f9ffc2 531#ifdef CONFIG_CFS_BANDWIDTH
f9f9ffc2
BS		 532 SEQ_printf(m, " .%-30s: %d\n", "throttled",
533 cfs_rq->throttled);
534 SEQ_printf(m, " .%-30s: %d\n", "throttle_count",
535 cfs_rq->throttle_count);
536#endif
2069dd75 537
333bb864 538#ifdef CONFIG_FAIR_GROUP_SCHED
ff9b48c3 539 print_cfs_group_stats(m, cpu, cfs_rq->tg);
c09595f6 540#endif
43ae34cb
IM		 541}
542
ada18de2
PZ		 543void print_rt_rq(struct seq_file *m, int cpu, struct rt_rq *rt_rq)
544{
efe25c2c
BR		 545#ifdef CONFIG_RT_GROUP_SCHED
546 SEQ_printf(m, "\nrt_rq[%d]:%s\n", cpu, task_group_path(rt_rq->tg));
547#else
ada18de2 548 SEQ_printf(m, "\nrt_rq[%d]:\n", cpu);
efe25c2c 549#endif
ada18de2
PZ		 550
551#define P(x) \
552 SEQ_printf(m, " .%-30s: %Ld\n", #x, (long long)(rt_rq->x))
553#define PN(x) \
554 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rt_rq->x))
555
556 P(rt_nr_running);
557 P(rt_throttled);
558 PN(rt_time);
559 PN(rt_runtime);
560
561#undef PN
562#undef P
563}
564
acb32132
WL		 565void print_dl_rq(struct seq_file *m, int cpu, struct dl_rq *dl_rq)
566{
ef477183
SRRH		 567 struct dl_bw *dl_bw;
568
acb32132
WL		 569 SEQ_printf(m, "\ndl_rq[%d]:\n", cpu);
570 SEQ_printf(m, " .%-30s: %ld\n", "dl_nr_running", dl_rq->dl_nr_running);
ef477183
SRRH		 571#ifdef CONFIG_SMP
572 dl_bw = &cpu_rq(cpu)->rd->dl_bw;
573#else
574 dl_bw = &dl_rq->dl_bw;
575#endif
576 SEQ_printf(m, " .%-30s: %lld\n", "dl_bw->bw", dl_bw->bw);
577 SEQ_printf(m, " .%-30s: %lld\n", "dl_bw->total_bw", dl_bw->total_bw);
acb32132
WL		 578}
579
5bb6b1ea
PZ		 580extern __read_mostly int sched_clock_running;
581
a48da48b 582static void print_cpu(struct seq_file *m, int cpu)
43ae34cb 583{
348ec61e 584 struct rq *rq = cpu_rq(cpu);
efe25c2c 585 unsigned long flags;
43ae34cb
IM		 586
587#ifdef CONFIG_X86
588 {
589 unsigned int freq = cpu_khz ? : 1;
590
bbbfeac9 591 SEQ_printf(m, "cpu#%d, %u.%03u MHz\n",
43ae34cb
IM		 592 cpu, freq / 1000, (freq % 1000));
593 }
594#else
bbbfeac9 595 SEQ_printf(m, "cpu#%d\n", cpu);
43ae34cb
IM		 596#endif
597
13e099d2
PZ		 598#define P(x) \
599do { \
600 if (sizeof(rq->x) == 4) \
601 SEQ_printf(m, " .%-30s: %ld\n", #x, (long)(rq->x)); \
602 else \
603 SEQ_printf(m, " .%-30s: %Ld\n", #x, (long long)(rq->x));\
604} while (0)
605
ef83a571
IM		 606#define PN(x) \
607 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rq->x))
43ae34cb
IM		 608
609 P(nr_running);
610 SEQ_printf(m, " .%-30s: %lu\n", "load",
495eca49 611 rq->load.weight);
43ae34cb
IM		 612 P(nr_switches);
613 P(nr_load_updates);
614 P(nr_uninterruptible);
ef83a571 615 PN(next_balance);
fc840914 616 SEQ_printf(m, " .%-30s: %ld\n", "curr->pid", (long)(task_pid_nr(rq->curr)));
ef83a571 617 PN(clock);
5a537597 618 PN(clock_task);
43ae34cb
IM		 619 P(cpu_load[0]);
620 P(cpu_load[1]);
621 P(cpu_load[2]);
622 P(cpu_load[3]);
623 P(cpu_load[4]);
624#undef P
ef83a571 625#undef PN
43ae34cb 626
1b9508f6 627#ifdef CONFIG_SMP
db6ea2fb 628#define P64(n) SEQ_printf(m, " .%-30s: %Ld\n", #n, rq->n);
1b9508f6 629 P64(avg_idle);
37e6bae8 630 P64(max_idle_balance_cost);
db6ea2fb 631#undef P64
1b9508f6 632#endif
5ac5c4d6 633
4fa8d299 634#define P(n) SEQ_printf(m, " .%-30s: %d\n", #n, schedstat_val(rq->n));
cb251765
MG		 635 if (schedstat_enabled()) {
636 P(yld_count);
637 P(sched_count);
638 P(sched_goidle);
639 P(ttwu_count);
640 P(ttwu_local);
641 }
5ac5c4d6 642#undef P
4fa8d299 643
efe25c2c 644 spin_lock_irqsave(&sched_debug_lock, flags);
5cef9eca 645 print_cfs_stats(m, cpu);
ada18de2 646 print_rt_stats(m, cpu);
acb32132 647 print_dl_stats(m, cpu);
43ae34cb 648
a48da48b 649 print_rq(m, rq, cpu);
efe25c2c 650 spin_unlock_irqrestore(&sched_debug_lock, flags);
bbbfeac9 651 SEQ_printf(m, "\n");
43ae34cb
IM		 652}
653
1983a922
CE		 654static const char *sched_tunable_scaling_names[] = {
655 "none",
656 "logaritmic",
657 "linear"
658};
659
bbbfeac9 660static void sched_debug_header(struct seq_file *m)
43ae34cb 661{
5bb6b1ea
PZ		 662 u64 ktime, sched_clk, cpu_clk;
663 unsigned long flags;
43ae34cb 664
5bb6b1ea
PZ		 665 local_irq_save(flags);
666 ktime = ktime_to_ns(ktime_get());
667 sched_clk = sched_clock();
668 cpu_clk = local_clock();
669 local_irq_restore(flags);
670
b32e86b4 671 SEQ_printf(m, "Sched Debug Version: v0.11, %s %.*s\n",
43ae34cb
IM		 672 init_utsname()->release,
673 (int)strcspn(init_utsname()->version, " "),
674 init_utsname()->version);
675
5bb6b1ea
PZ		 676#define P(x) \
677 SEQ_printf(m, "%-40s: %Ld\n", #x, (long long)(x))
678#define PN(x) \
679 SEQ_printf(m, "%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
680 PN(ktime);
681 PN(sched_clk);
682 PN(cpu_clk);
683 P(jiffies);
684#ifdef CONFIG_HAVE_UNSTABLE_SCHED_CLOCK
35af99e6 685 P(sched_clock_stable());
5bb6b1ea
PZ		 686#endif
687#undef PN
688#undef P
689
690 SEQ_printf(m, "\n");
691 SEQ_printf(m, "sysctl_sched\n");
43ae34cb 692
1aa4731e 693#define P(x) \
d822cece 694 SEQ_printf(m, " .%-40s: %Ld\n", #x, (long long)(x))
1aa4731e 695#define PN(x) \
d822cece 696 SEQ_printf(m, " .%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
1aa4731e 697 PN(sysctl_sched_latency);
b2be5e96 698 PN(sysctl_sched_min_granularity);
1aa4731e 699 PN(sysctl_sched_wakeup_granularity);
eebef746 700 P(sysctl_sched_child_runs_first);
1aa4731e
IM		 701 P(sysctl_sched_features);
702#undef PN
703#undef P
704
bbbfeac9
NZ		 705 SEQ_printf(m, " .%-40s: %d (%s)\n",
706 "sysctl_sched_tunable_scaling",
1983a922
CE		 707 sysctl_sched_tunable_scaling,
708 sched_tunable_scaling_names[sysctl_sched_tunable_scaling]);
bbbfeac9
NZ		 709 SEQ_printf(m, "\n");
710}
1983a922 711
bbbfeac9
NZ		 712static int sched_debug_show(struct seq_file *m, void *v)
713{
714 int cpu = (unsigned long)(v - 2);
43ae34cb 715
bbbfeac9
NZ		 716 if (cpu != -1)
717 print_cpu(m, cpu);
718 else
719 sched_debug_header(m);
43ae34cb
IM		 720
721 return 0;
722}
723
029632fb 724void sysrq_sched_debug_show(void)
43ae34cb 725{
bbbfeac9
NZ		 726 int cpu;
727
728 sched_debug_header(NULL);
729 for_each_online_cpu(cpu)
730 print_cpu(NULL, cpu);
731
732}
733
734/*
735 * This itererator needs some explanation.
736 * It returns 1 for the header position.
737 * This means 2 is cpu 0.
738 * In a hotplugged system some cpus, including cpu 0, may be missing so we have
739 * to use cpumask_* to iterate over the cpus.
740 */
741static void *sched_debug_start(struct seq_file *file, loff_t *offset)
742{
743 unsigned long n = *offset;
744
745 if (n == 0)
746 return (void *) 1;
747
748 n--;
749
750 if (n > 0)
751 n = cpumask_next(n - 1, cpu_online_mask);
752 else
753 n = cpumask_first(cpu_online_mask);
754
755 *offset = n + 1;
756
757 if (n < nr_cpu_ids)
758 return (void *)(unsigned long)(n + 2);
759 return NULL;
760}
761
762static void *sched_debug_next(struct seq_file *file, void *data, loff_t *offset)
763{
764 (*offset)++;
765 return sched_debug_start(file, offset);
766}
767
768static void sched_debug_stop(struct seq_file *file, void *data)
769{
770}
771
772static const struct seq_operations sched_debug_sops = {
773 .start = sched_debug_start,
774 .next = sched_debug_next,
775 .stop = sched_debug_stop,
776 .show = sched_debug_show,
777};
778
779static int sched_debug_release(struct inode *inode, struct file *file)
780{
781 seq_release(inode, file);
782
783 return 0;
43ae34cb
IM		 784}
785
786static int sched_debug_open(struct inode *inode, struct file *filp)
787{
bbbfeac9
NZ		 788 int ret = 0;
789
790 ret = seq_open(filp, &sched_debug_sops);
791
792 return ret;
43ae34cb
IM		 793}
794
0dbee3a6 795static const struct file_operations sched_debug_fops = {
43ae34cb
IM		 796 .open = sched_debug_open,
797 .read = seq_read,
798 .llseek = seq_lseek,
bbbfeac9 799 .release = sched_debug_release,
43ae34cb
IM		 800};
801
802static int __init init_sched_debug_procfs(void)
803{
804 struct proc_dir_entry *pe;
805
a9cf4ddb 806 pe = proc_create("sched_debug", 0444, NULL, &sched_debug_fops);
43ae34cb
IM		 807 if (!pe)
808 return -ENOMEM;
43ae34cb
IM		 809 return 0;
810}
811
812__initcall(init_sched_debug_procfs);
813
b32e86b4
IM		 814#define __P(F) \
815 SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)F)
816#define P(F) \
817 SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)p->F)
818#define __PN(F) \
819 SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)F))
820#define PN(F) \
821 SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)p->F))
822
823
397f2378
SD		 824#ifdef CONFIG_NUMA_BALANCING
825void print_numa_stats(struct seq_file *m, int node, unsigned long tsf,
826 unsigned long tpf, unsigned long gsf, unsigned long gpf)
827{
828 SEQ_printf(m, "numa_faults node=%d ", node);
829 SEQ_printf(m, "task_private=%lu task_shared=%lu ", tsf, tpf);
830 SEQ_printf(m, "group_private=%lu group_shared=%lu\n", gsf, gpf);
831}
832#endif
833
834
b32e86b4
IM		 835static void sched_show_numa(struct task_struct *p, struct seq_file *m)
836{
837#ifdef CONFIG_NUMA_BALANCING
838 struct mempolicy *pol;
b32e86b4
IM		 839
840 if (p->mm)
841 P(mm->numa_scan_seq);
842
843 task_lock(p);
844 pol = p->mempolicy;
845 if (pol && !(pol->flags & MPOL_F_MORON))
846 pol = NULL;
847 mpol_get(pol);
848 task_unlock(p);
849
397f2378
SD		 850 P(numa_pages_migrated);
851 P(numa_preferred_nid);
852 P(total_numa_faults);
853 SEQ_printf(m, "current_node=%d, numa_group_id=%d\n",
854 task_node(p), task_numa_group_id(p));
855 show_numa_stats(p, m);
b32e86b4
IM		 856 mpol_put(pol);
857#endif
858}
859
43ae34cb
IM		 860void proc_sched_show_task(struct task_struct *p, struct seq_file *m)
861{
cc367732 862 unsigned long nr_switches;
43ae34cb 863
fc840914 864 SEQ_printf(m, "%s (%d, #threads: %d)\n", p->comm, task_pid_nr(p),
5089a976 865 get_nr_threads(p));
2d92f227 866 SEQ_printf(m,
add332a1
KB		 867 "---------------------------------------------------------"
868 "----------\n");
cc367732 869#define __P(F) \
add332a1 870 SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)F)
43ae34cb 871#define P(F) \
add332a1 872 SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)p->F)
4fa8d299
JP		 873#define P_SCHEDSTAT(F) \
874 SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)schedstat_val(p->F))
cc367732 875#define __PN(F) \
add332a1 876 SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)F))
ef83a571 877#define PN(F) \
add332a1 878 SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)p->F))
4fa8d299
JP		 879#define PN_SCHEDSTAT(F) \
880 SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)schedstat_val(p->F)))
43ae34cb 881
ef83a571
IM		 882 PN(se.exec_start);
883 PN(se.vruntime);
884 PN(se.sum_exec_runtime);
6cfb0d5d 885
cc367732
IM		 886 nr_switches = p->nvcsw + p->nivcsw;
887
cc367732 888 P(se.nr_migrations);
cc367732 889
cb251765 890 if (schedstat_enabled()) {
cc367732
IM		 891 u64 avg_atom, avg_per_cpu;
892
4fa8d299
JP		 893 PN_SCHEDSTAT(se.statistics.sum_sleep_runtime);
894 PN_SCHEDSTAT(se.statistics.wait_start);
895 PN_SCHEDSTAT(se.statistics.sleep_start);
896 PN_SCHEDSTAT(se.statistics.block_start);
897 PN_SCHEDSTAT(se.statistics.sleep_max);
898 PN_SCHEDSTAT(se.statistics.block_max);
899 PN_SCHEDSTAT(se.statistics.exec_max);
900 PN_SCHEDSTAT(se.statistics.slice_max);
901 PN_SCHEDSTAT(se.statistics.wait_max);
902 PN_SCHEDSTAT(se.statistics.wait_sum);
903 P_SCHEDSTAT(se.statistics.wait_count);
904 PN_SCHEDSTAT(se.statistics.iowait_sum);
905 P_SCHEDSTAT(se.statistics.iowait_count);
906 P_SCHEDSTAT(se.statistics.nr_migrations_cold);
907 P_SCHEDSTAT(se.statistics.nr_failed_migrations_affine);
908 P_SCHEDSTAT(se.statistics.nr_failed_migrations_running);
909 P_SCHEDSTAT(se.statistics.nr_failed_migrations_hot);
910 P_SCHEDSTAT(se.statistics.nr_forced_migrations);
911 P_SCHEDSTAT(se.statistics.nr_wakeups);
912 P_SCHEDSTAT(se.statistics.nr_wakeups_sync);
913 P_SCHEDSTAT(se.statistics.nr_wakeups_migrate);
914 P_SCHEDSTAT(se.statistics.nr_wakeups_local);
915 P_SCHEDSTAT(se.statistics.nr_wakeups_remote);
916 P_SCHEDSTAT(se.statistics.nr_wakeups_affine);
917 P_SCHEDSTAT(se.statistics.nr_wakeups_affine_attempts);
918 P_SCHEDSTAT(se.statistics.nr_wakeups_passive);
919 P_SCHEDSTAT(se.statistics.nr_wakeups_idle);
cb251765 920
cc367732
IM		 921 avg_atom = p->se.sum_exec_runtime;
922 if (nr_switches)
b0ab99e7 923 avg_atom = div64_ul(avg_atom, nr_switches);
cc367732
IM		 924 else
925 avg_atom = -1LL;
926
927 avg_per_cpu = p->se.sum_exec_runtime;
c1a89740 928 if (p->se.nr_migrations) {
6f6d6a1a
RZ		 929 avg_per_cpu = div64_u64(avg_per_cpu,
930 p->se.nr_migrations);
c1a89740 931 } else {
cc367732 932 avg_per_cpu = -1LL;
c1a89740 933 }
cc367732
IM		 934
935 __PN(avg_atom);
936 __PN(avg_per_cpu);
937 }
4fa8d299 938
cc367732 939 __P(nr_switches);
add332a1 940 SEQ_printf(m, "%-45s:%21Ld\n",
cc367732 941 "nr_voluntary_switches", (long long)p->nvcsw);
add332a1 942 SEQ_printf(m, "%-45s:%21Ld\n",
cc367732
IM		 943 "nr_involuntary_switches", (long long)p->nivcsw);
944
43ae34cb 945 P(se.load.weight);
333bb864 946#ifdef CONFIG_SMP
9d89c257
YD		 947 P(se.avg.load_sum);
948 P(se.avg.util_sum);
949 P(se.avg.load_avg);
950 P(se.avg.util_avg);
951 P(se.avg.last_update_time);
939fd731 952#endif
43ae34cb
IM		 953 P(policy);
954 P(prio);
4fa8d299 955#undef PN_SCHEDSTAT
ef83a571 956#undef PN
cc367732 957#undef __PN
4fa8d299 958#undef P_SCHEDSTAT
cc367732
IM		 959#undef P
960#undef __P
43ae34cb
IM		 961
962 {
29d7b90c 963 unsigned int this_cpu = raw_smp_processor_id();
43ae34cb
IM		 964 u64 t0, t1;
965
29d7b90c
IM		 966 t0 = cpu_clock(this_cpu);
967 t1 = cpu_clock(this_cpu);
add332a1 968 SEQ_printf(m, "%-45s:%21Ld\n",
43ae34cb
IM		 969 "clock-delta", (long long)(t1-t0));
970 }
b32e86b4
IM		 971
972 sched_show_numa(p, m);
43ae34cb
IM		 973}
974
975void proc_sched_set_task(struct task_struct *p)
976{
6cfb0d5d 977#ifdef CONFIG_SCHEDSTATS
41acab88 978 memset(&p->se.statistics, 0, sizeof(p->se.statistics));
6cfb0d5d 979#endif
43ae34cb 980}
Linux 6.x block layer and io_uring tree(s)