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/mm.h>
15 #include <linux/sched/task.h>
16 #include <linux/seq_file.h>
17 #include <linux/kallsyms.h>
18 #include <linux/utsname.h>
19 #include <linux/mempolicy.h>
20 #include <linux/debugfs.h>
24 static DEFINE_SPINLOCK(sched_debug_lock);
27 * This allows printing both to /proc/sched_debug and
30 #define SEQ_printf(m, x...) \
39 * Ease the printing of nsec fields:
41 static long long nsec_high(unsigned long long nsec)
43 if ((long long)nsec < 0) {
45 do_div(nsec, 1000000);
48 do_div(nsec, 1000000);
53 static unsigned long nsec_low(unsigned long long nsec)
55 if ((long long)nsec < 0)
58 return do_div(nsec, 1000000);
61 #define SPLIT_NS(x) nsec_high(x), nsec_low(x)
63 #define SCHED_FEAT(name, enabled) \
66 static const char * const sched_feat_names[] = {
72 static int sched_feat_show(struct seq_file *m, void *v)
76 for (i = 0; i < __SCHED_FEAT_NR; i++) {
77 if (!(sysctl_sched_features & (1UL << i)))
79 seq_printf(m, "%s ", sched_feat_names[i]);
86 #ifdef HAVE_JUMP_LABEL
88 #define jump_label_key__true STATIC_KEY_INIT_TRUE
89 #define jump_label_key__false STATIC_KEY_INIT_FALSE
91 #define SCHED_FEAT(name, enabled) \
92 jump_label_key__##enabled ,
94 struct static_key sched_feat_keys[__SCHED_FEAT_NR] = {
100 static void sched_feat_disable(int i)
102 static_key_disable(&sched_feat_keys[i]);
105 static void sched_feat_enable(int i)
107 static_key_enable(&sched_feat_keys[i]);
110 static void sched_feat_disable(int i) { };
111 static void sched_feat_enable(int i) { };
112 #endif /* HAVE_JUMP_LABEL */
114 static int sched_feat_set(char *cmp)
119 if (strncmp(cmp, "NO_", 3) == 0) {
124 for (i = 0; i < __SCHED_FEAT_NR; i++) {
125 if (strcmp(cmp, sched_feat_names[i]) == 0) {
127 sysctl_sched_features &= ~(1UL << i);
128 sched_feat_disable(i);
130 sysctl_sched_features |= (1UL << i);
131 sched_feat_enable(i);
141 sched_feat_write(struct file *filp, const char __user *ubuf,
142 size_t cnt, loff_t *ppos)
152 if (copy_from_user(&buf, ubuf, cnt))
158 /* Ensure the static_key remains in a consistent state */
159 inode = file_inode(filp);
161 i = sched_feat_set(cmp);
163 if (i == __SCHED_FEAT_NR)
171 static int sched_feat_open(struct inode *inode, struct file *filp)
173 return single_open(filp, sched_feat_show, NULL);
176 static const struct file_operations sched_feat_fops = {
177 .open = sched_feat_open,
178 .write = sched_feat_write,
181 .release = single_release,
184 static __init int sched_init_debug(void)
186 debugfs_create_file("sched_features", 0644, NULL, NULL,
191 late_initcall(sched_init_debug);
197 static struct ctl_table sd_ctl_dir[] = {
199 .procname = "sched_domain",
205 static struct ctl_table sd_ctl_root[] = {
207 .procname = "kernel",
214 static struct ctl_table *sd_alloc_ctl_entry(int n)
216 struct ctl_table *entry =
217 kcalloc(n, sizeof(struct ctl_table), GFP_KERNEL);
222 static void sd_free_ctl_entry(struct ctl_table **tablep)
224 struct ctl_table *entry;
227 * In the intermediate directories, both the child directory and
228 * procname are dynamically allocated and could fail but the mode
229 * will always be set. In the lowest directory the names are
230 * static strings and all have proc handlers.
232 for (entry = *tablep; entry->mode; entry++) {
234 sd_free_ctl_entry(&entry->child);
235 if (entry->proc_handler == NULL)
236 kfree(entry->procname);
243 static int min_load_idx = 0;
244 static int max_load_idx = CPU_LOAD_IDX_MAX-1;
247 set_table_entry(struct ctl_table *entry,
248 const char *procname, void *data, int maxlen,
249 umode_t mode, proc_handler *proc_handler,
252 entry->procname = procname;
254 entry->maxlen = maxlen;
256 entry->proc_handler = proc_handler;
259 entry->extra1 = &min_load_idx;
260 entry->extra2 = &max_load_idx;
264 static struct ctl_table *
265 sd_alloc_ctl_domain_table(struct sched_domain *sd)
267 struct ctl_table *table = sd_alloc_ctl_entry(14);
272 set_table_entry(&table[0], "min_interval", &sd->min_interval,
273 sizeof(long), 0644, proc_doulongvec_minmax, false);
274 set_table_entry(&table[1], "max_interval", &sd->max_interval,
275 sizeof(long), 0644, proc_doulongvec_minmax, false);
276 set_table_entry(&table[2], "busy_idx", &sd->busy_idx,
277 sizeof(int), 0644, proc_dointvec_minmax, true);
278 set_table_entry(&table[3], "idle_idx", &sd->idle_idx,
279 sizeof(int), 0644, proc_dointvec_minmax, true);
280 set_table_entry(&table[4], "newidle_idx", &sd->newidle_idx,
281 sizeof(int), 0644, proc_dointvec_minmax, true);
282 set_table_entry(&table[5], "wake_idx", &sd->wake_idx,
283 sizeof(int), 0644, proc_dointvec_minmax, true);
284 set_table_entry(&table[6], "forkexec_idx", &sd->forkexec_idx,
285 sizeof(int), 0644, proc_dointvec_minmax, true);
286 set_table_entry(&table[7], "busy_factor", &sd->busy_factor,
287 sizeof(int), 0644, proc_dointvec_minmax, false);
288 set_table_entry(&table[8], "imbalance_pct", &sd->imbalance_pct,
289 sizeof(int), 0644, proc_dointvec_minmax, false);
290 set_table_entry(&table[9], "cache_nice_tries",
291 &sd->cache_nice_tries,
292 sizeof(int), 0644, proc_dointvec_minmax, false);
293 set_table_entry(&table[10], "flags", &sd->flags,
294 sizeof(int), 0644, proc_dointvec_minmax, false);
295 set_table_entry(&table[11], "max_newidle_lb_cost",
296 &sd->max_newidle_lb_cost,
297 sizeof(long), 0644, proc_doulongvec_minmax, false);
298 set_table_entry(&table[12], "name", sd->name,
299 CORENAME_MAX_SIZE, 0444, proc_dostring, false);
300 /* &table[13] is terminator */
305 static struct ctl_table *sd_alloc_ctl_cpu_table(int cpu)
307 struct ctl_table *entry, *table;
308 struct sched_domain *sd;
309 int domain_num = 0, i;
312 for_each_domain(cpu, sd)
314 entry = table = sd_alloc_ctl_entry(domain_num + 1);
319 for_each_domain(cpu, sd) {
320 snprintf(buf, 32, "domain%d", i);
321 entry->procname = kstrdup(buf, GFP_KERNEL);
323 entry->child = sd_alloc_ctl_domain_table(sd);
330 static struct ctl_table_header *sd_sysctl_header;
331 void register_sched_domain_sysctl(void)
333 int i, cpu_num = num_possible_cpus();
334 struct ctl_table *entry = sd_alloc_ctl_entry(cpu_num + 1);
337 WARN_ON(sd_ctl_dir[0].child);
338 sd_ctl_dir[0].child = entry;
343 for_each_possible_cpu(i) {
344 snprintf(buf, 32, "cpu%d", i);
345 entry->procname = kstrdup(buf, GFP_KERNEL);
347 entry->child = sd_alloc_ctl_cpu_table(i);
351 WARN_ON(sd_sysctl_header);
352 sd_sysctl_header = register_sysctl_table(sd_ctl_root);
355 /* may be called multiple times per register */
356 void unregister_sched_domain_sysctl(void)
358 unregister_sysctl_table(sd_sysctl_header);
359 sd_sysctl_header = NULL;
360 if (sd_ctl_dir[0].child)
361 sd_free_ctl_entry(&sd_ctl_dir[0].child);
363 #endif /* CONFIG_SYSCTL */
364 #endif /* CONFIG_SMP */
366 #ifdef CONFIG_FAIR_GROUP_SCHED
367 static void print_cfs_group_stats(struct seq_file *m, int cpu, struct task_group *tg)
369 struct sched_entity *se = tg->se[cpu];
372 SEQ_printf(m, " .%-30s: %lld\n", #F, (long long)F)
373 #define P_SCHEDSTAT(F) \
374 SEQ_printf(m, " .%-30s: %lld\n", #F, (long long)schedstat_val(F))
376 SEQ_printf(m, " .%-30s: %lld.%06ld\n", #F, SPLIT_NS((long long)F))
377 #define PN_SCHEDSTAT(F) \
378 SEQ_printf(m, " .%-30s: %lld.%06ld\n", #F, SPLIT_NS((long long)schedstat_val(F)))
385 PN(se->sum_exec_runtime);
386 if (schedstat_enabled()) {
387 PN_SCHEDSTAT(se->statistics.wait_start);
388 PN_SCHEDSTAT(se->statistics.sleep_start);
389 PN_SCHEDSTAT(se->statistics.block_start);
390 PN_SCHEDSTAT(se->statistics.sleep_max);
391 PN_SCHEDSTAT(se->statistics.block_max);
392 PN_SCHEDSTAT(se->statistics.exec_max);
393 PN_SCHEDSTAT(se->statistics.slice_max);
394 PN_SCHEDSTAT(se->statistics.wait_max);
395 PN_SCHEDSTAT(se->statistics.wait_sum);
396 P_SCHEDSTAT(se->statistics.wait_count);
411 #ifdef CONFIG_CGROUP_SCHED
412 static char group_path[PATH_MAX];
414 static char *task_group_path(struct task_group *tg)
416 if (autogroup_path(tg, group_path, PATH_MAX))
419 cgroup_path(tg->css.cgroup, group_path, PATH_MAX);
425 print_task(struct seq_file *m, struct rq *rq, struct task_struct *p)
432 SEQ_printf(m, "%15s %5d %9Ld.%06ld %9Ld %5d ",
433 p->comm, task_pid_nr(p),
434 SPLIT_NS(p->se.vruntime),
435 (long long)(p->nvcsw + p->nivcsw),
438 SEQ_printf(m, "%9Ld.%06ld %9Ld.%06ld %9Ld.%06ld",
439 SPLIT_NS(schedstat_val_or_zero(p->se.statistics.wait_sum)),
440 SPLIT_NS(p->se.sum_exec_runtime),
441 SPLIT_NS(schedstat_val_or_zero(p->se.statistics.sum_sleep_runtime)));
443 #ifdef CONFIG_NUMA_BALANCING
444 SEQ_printf(m, " %d %d", task_node(p), task_numa_group_id(p));
446 #ifdef CONFIG_CGROUP_SCHED
447 SEQ_printf(m, " %s", task_group_path(task_group(p)));
453 static void print_rq(struct seq_file *m, struct rq *rq, int rq_cpu)
455 struct task_struct *g, *p;
458 "\nrunnable tasks:\n"
459 " task PID tree-key switches prio"
460 " wait-time sum-exec sum-sleep\n"
461 "------------------------------------------------------"
462 "----------------------------------------------------\n");
465 for_each_process_thread(g, p) {
466 if (task_cpu(p) != rq_cpu)
469 print_task(m, rq, p);
474 void print_cfs_rq(struct seq_file *m, int cpu, struct cfs_rq *cfs_rq)
476 s64 MIN_vruntime = -1, min_vruntime, max_vruntime = -1,
477 spread, rq0_min_vruntime, spread0;
478 struct rq *rq = cpu_rq(cpu);
479 struct sched_entity *last;
482 #ifdef CONFIG_FAIR_GROUP_SCHED
483 SEQ_printf(m, "\ncfs_rq[%d]:%s\n", cpu, task_group_path(cfs_rq->tg));
485 SEQ_printf(m, "\ncfs_rq[%d]:\n", cpu);
487 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "exec_clock",
488 SPLIT_NS(cfs_rq->exec_clock));
490 raw_spin_lock_irqsave(&rq->lock, flags);
491 if (cfs_rq->rb_leftmost)
492 MIN_vruntime = (__pick_first_entity(cfs_rq))->vruntime;
493 last = __pick_last_entity(cfs_rq);
495 max_vruntime = last->vruntime;
496 min_vruntime = cfs_rq->min_vruntime;
497 rq0_min_vruntime = cpu_rq(0)->cfs.min_vruntime;
498 raw_spin_unlock_irqrestore(&rq->lock, flags);
499 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "MIN_vruntime",
500 SPLIT_NS(MIN_vruntime));
501 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "min_vruntime",
502 SPLIT_NS(min_vruntime));
503 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "max_vruntime",
504 SPLIT_NS(max_vruntime));
505 spread = max_vruntime - MIN_vruntime;
506 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread",
508 spread0 = min_vruntime - rq0_min_vruntime;
509 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread0",
511 SEQ_printf(m, " .%-30s: %d\n", "nr_spread_over",
512 cfs_rq->nr_spread_over);
513 SEQ_printf(m, " .%-30s: %d\n", "nr_running", cfs_rq->nr_running);
514 SEQ_printf(m, " .%-30s: %ld\n", "load", cfs_rq->load.weight);
516 SEQ_printf(m, " .%-30s: %lu\n", "load_avg",
517 cfs_rq->avg.load_avg);
518 SEQ_printf(m, " .%-30s: %lu\n", "runnable_load_avg",
519 cfs_rq->runnable_load_avg);
520 SEQ_printf(m, " .%-30s: %lu\n", "util_avg",
521 cfs_rq->avg.util_avg);
522 SEQ_printf(m, " .%-30s: %ld\n", "removed_load_avg",
523 atomic_long_read(&cfs_rq->removed_load_avg));
524 SEQ_printf(m, " .%-30s: %ld\n", "removed_util_avg",
525 atomic_long_read(&cfs_rq->removed_util_avg));
526 #ifdef CONFIG_FAIR_GROUP_SCHED
527 SEQ_printf(m, " .%-30s: %lu\n", "tg_load_avg_contrib",
528 cfs_rq->tg_load_avg_contrib);
529 SEQ_printf(m, " .%-30s: %ld\n", "tg_load_avg",
530 atomic_long_read(&cfs_rq->tg->load_avg));
533 #ifdef CONFIG_CFS_BANDWIDTH
534 SEQ_printf(m, " .%-30s: %d\n", "throttled",
536 SEQ_printf(m, " .%-30s: %d\n", "throttle_count",
537 cfs_rq->throttle_count);
540 #ifdef CONFIG_FAIR_GROUP_SCHED
541 print_cfs_group_stats(m, cpu, cfs_rq->tg);
545 void print_rt_rq(struct seq_file *m, int cpu, struct rt_rq *rt_rq)
547 #ifdef CONFIG_RT_GROUP_SCHED
548 SEQ_printf(m, "\nrt_rq[%d]:%s\n", cpu, task_group_path(rt_rq->tg));
550 SEQ_printf(m, "\nrt_rq[%d]:\n", cpu);
554 SEQ_printf(m, " .%-30s: %Ld\n", #x, (long long)(rt_rq->x))
556 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rt_rq->x))
567 void print_dl_rq(struct seq_file *m, int cpu, struct dl_rq *dl_rq)
571 SEQ_printf(m, "\ndl_rq[%d]:\n", cpu);
572 SEQ_printf(m, " .%-30s: %ld\n", "dl_nr_running", dl_rq->dl_nr_running);
574 dl_bw = &cpu_rq(cpu)->rd->dl_bw;
576 dl_bw = &dl_rq->dl_bw;
578 SEQ_printf(m, " .%-30s: %lld\n", "dl_bw->bw", dl_bw->bw);
579 SEQ_printf(m, " .%-30s: %lld\n", "dl_bw->total_bw", dl_bw->total_bw);
582 extern __read_mostly int sched_clock_running;
584 static void print_cpu(struct seq_file *m, int cpu)
586 struct rq *rq = cpu_rq(cpu);
591 unsigned int freq = cpu_khz ? : 1;
593 SEQ_printf(m, "cpu#%d, %u.%03u MHz\n",
594 cpu, freq / 1000, (freq % 1000));
597 SEQ_printf(m, "cpu#%d\n", cpu);
602 if (sizeof(rq->x) == 4) \
603 SEQ_printf(m, " .%-30s: %ld\n", #x, (long)(rq->x)); \
605 SEQ_printf(m, " .%-30s: %Ld\n", #x, (long long)(rq->x));\
609 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rq->x))
612 SEQ_printf(m, " .%-30s: %lu\n", "load",
616 P(nr_uninterruptible);
618 SEQ_printf(m, " .%-30s: %ld\n", "curr->pid", (long)(task_pid_nr(rq->curr)));
630 #define P64(n) SEQ_printf(m, " .%-30s: %Ld\n", #n, rq->n);
632 P64(max_idle_balance_cost);
636 #define P(n) SEQ_printf(m, " .%-30s: %d\n", #n, schedstat_val(rq->n));
637 if (schedstat_enabled()) {
646 spin_lock_irqsave(&sched_debug_lock, flags);
647 print_cfs_stats(m, cpu);
648 print_rt_stats(m, cpu);
649 print_dl_stats(m, cpu);
651 print_rq(m, rq, cpu);
652 spin_unlock_irqrestore(&sched_debug_lock, flags);
656 static const char *sched_tunable_scaling_names[] = {
662 static void sched_debug_header(struct seq_file *m)
664 u64 ktime, sched_clk, cpu_clk;
667 local_irq_save(flags);
668 ktime = ktime_to_ns(ktime_get());
669 sched_clk = sched_clock();
670 cpu_clk = local_clock();
671 local_irq_restore(flags);
673 SEQ_printf(m, "Sched Debug Version: v0.11, %s %.*s\n",
674 init_utsname()->release,
675 (int)strcspn(init_utsname()->version, " "),
676 init_utsname()->version);
679 SEQ_printf(m, "%-40s: %Ld\n", #x, (long long)(x))
681 SEQ_printf(m, "%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
686 #ifdef CONFIG_HAVE_UNSTABLE_SCHED_CLOCK
687 P(sched_clock_stable());
693 SEQ_printf(m, "sysctl_sched\n");
696 SEQ_printf(m, " .%-40s: %Ld\n", #x, (long long)(x))
698 SEQ_printf(m, " .%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
699 PN(sysctl_sched_latency);
700 PN(sysctl_sched_min_granularity);
701 PN(sysctl_sched_wakeup_granularity);
702 P(sysctl_sched_child_runs_first);
703 P(sysctl_sched_features);
707 SEQ_printf(m, " .%-40s: %d (%s)\n",
708 "sysctl_sched_tunable_scaling",
709 sysctl_sched_tunable_scaling,
710 sched_tunable_scaling_names[sysctl_sched_tunable_scaling]);
714 static int sched_debug_show(struct seq_file *m, void *v)
716 int cpu = (unsigned long)(v - 2);
721 sched_debug_header(m);
726 void sysrq_sched_debug_show(void)
730 sched_debug_header(NULL);
731 for_each_online_cpu(cpu)
732 print_cpu(NULL, cpu);
737 * This itererator needs some explanation.
738 * It returns 1 for the header position.
739 * This means 2 is cpu 0.
740 * In a hotplugged system some cpus, including cpu 0, may be missing so we have
741 * to use cpumask_* to iterate over the cpus.
743 static void *sched_debug_start(struct seq_file *file, loff_t *offset)
745 unsigned long n = *offset;
753 n = cpumask_next(n - 1, cpu_online_mask);
755 n = cpumask_first(cpu_online_mask);
760 return (void *)(unsigned long)(n + 2);
764 static void *sched_debug_next(struct seq_file *file, void *data, loff_t *offset)
767 return sched_debug_start(file, offset);
770 static void sched_debug_stop(struct seq_file *file, void *data)
774 static const struct seq_operations sched_debug_sops = {
775 .start = sched_debug_start,
776 .next = sched_debug_next,
777 .stop = sched_debug_stop,
778 .show = sched_debug_show,
781 static int sched_debug_release(struct inode *inode, struct file *file)
783 seq_release(inode, file);
788 static int sched_debug_open(struct inode *inode, struct file *filp)
792 ret = seq_open(filp, &sched_debug_sops);
797 static const struct file_operations sched_debug_fops = {
798 .open = sched_debug_open,
801 .release = sched_debug_release,
804 static int __init init_sched_debug_procfs(void)
806 struct proc_dir_entry *pe;
808 pe = proc_create("sched_debug", 0444, NULL, &sched_debug_fops);
814 __initcall(init_sched_debug_procfs);
817 SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)F)
819 SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)p->F)
821 SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)F))
823 SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)p->F))
826 #ifdef CONFIG_NUMA_BALANCING
827 void print_numa_stats(struct seq_file *m, int node, unsigned long tsf,
828 unsigned long tpf, unsigned long gsf, unsigned long gpf)
830 SEQ_printf(m, "numa_faults node=%d ", node);
831 SEQ_printf(m, "task_private=%lu task_shared=%lu ", tsf, tpf);
832 SEQ_printf(m, "group_private=%lu group_shared=%lu\n", gsf, gpf);
837 static void sched_show_numa(struct task_struct *p, struct seq_file *m)
839 #ifdef CONFIG_NUMA_BALANCING
840 struct mempolicy *pol;
843 P(mm->numa_scan_seq);
847 if (pol && !(pol->flags & MPOL_F_MORON))
852 P(numa_pages_migrated);
853 P(numa_preferred_nid);
854 P(total_numa_faults);
855 SEQ_printf(m, "current_node=%d, numa_group_id=%d\n",
856 task_node(p), task_numa_group_id(p));
857 show_numa_stats(p, m);
862 void proc_sched_show_task(struct task_struct *p, struct seq_file *m)
864 unsigned long nr_switches;
866 SEQ_printf(m, "%s (%d, #threads: %d)\n", p->comm, task_pid_nr(p),
869 "---------------------------------------------------------"
872 SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)F)
874 SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)p->F)
875 #define P_SCHEDSTAT(F) \
876 SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)schedstat_val(p->F))
878 SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)F))
880 SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)p->F))
881 #define PN_SCHEDSTAT(F) \
882 SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)schedstat_val(p->F)))
886 PN(se.sum_exec_runtime);
888 nr_switches = p->nvcsw + p->nivcsw;
892 if (schedstat_enabled()) {
893 u64 avg_atom, avg_per_cpu;
895 PN_SCHEDSTAT(se.statistics.sum_sleep_runtime);
896 PN_SCHEDSTAT(se.statistics.wait_start);
897 PN_SCHEDSTAT(se.statistics.sleep_start);
898 PN_SCHEDSTAT(se.statistics.block_start);
899 PN_SCHEDSTAT(se.statistics.sleep_max);
900 PN_SCHEDSTAT(se.statistics.block_max);
901 PN_SCHEDSTAT(se.statistics.exec_max);
902 PN_SCHEDSTAT(se.statistics.slice_max);
903 PN_SCHEDSTAT(se.statistics.wait_max);
904 PN_SCHEDSTAT(se.statistics.wait_sum);
905 P_SCHEDSTAT(se.statistics.wait_count);
906 PN_SCHEDSTAT(se.statistics.iowait_sum);
907 P_SCHEDSTAT(se.statistics.iowait_count);
908 P_SCHEDSTAT(se.statistics.nr_migrations_cold);
909 P_SCHEDSTAT(se.statistics.nr_failed_migrations_affine);
910 P_SCHEDSTAT(se.statistics.nr_failed_migrations_running);
911 P_SCHEDSTAT(se.statistics.nr_failed_migrations_hot);
912 P_SCHEDSTAT(se.statistics.nr_forced_migrations);
913 P_SCHEDSTAT(se.statistics.nr_wakeups);
914 P_SCHEDSTAT(se.statistics.nr_wakeups_sync);
915 P_SCHEDSTAT(se.statistics.nr_wakeups_migrate);
916 P_SCHEDSTAT(se.statistics.nr_wakeups_local);
917 P_SCHEDSTAT(se.statistics.nr_wakeups_remote);
918 P_SCHEDSTAT(se.statistics.nr_wakeups_affine);
919 P_SCHEDSTAT(se.statistics.nr_wakeups_affine_attempts);
920 P_SCHEDSTAT(se.statistics.nr_wakeups_passive);
921 P_SCHEDSTAT(se.statistics.nr_wakeups_idle);
923 avg_atom = p->se.sum_exec_runtime;
925 avg_atom = div64_ul(avg_atom, nr_switches);
929 avg_per_cpu = p->se.sum_exec_runtime;
930 if (p->se.nr_migrations) {
931 avg_per_cpu = div64_u64(avg_per_cpu,
932 p->se.nr_migrations);
942 SEQ_printf(m, "%-45s:%21Ld\n",
943 "nr_voluntary_switches", (long long)p->nvcsw);
944 SEQ_printf(m, "%-45s:%21Ld\n",
945 "nr_involuntary_switches", (long long)p->nivcsw);
953 P(se.avg.last_update_time);
957 if (p->policy == SCHED_DEADLINE) {
969 unsigned int this_cpu = raw_smp_processor_id();
972 t0 = cpu_clock(this_cpu);
973 t1 = cpu_clock(this_cpu);
974 SEQ_printf(m, "%-45s:%21Ld\n",
975 "clock-delta", (long long)(t1-t0));
978 sched_show_numa(p, m);
981 void proc_sched_set_task(struct task_struct *p)
983 #ifdef CONFIG_SCHEDSTATS
984 memset(&p->se.statistics, 0, sizeof(p->se.statistics));