1 // SPDX-License-Identifier: GPL-2.0-only
5 * Print the CFS rbtree and other debugging details
7 * Copyright(C) 2007, Red Hat, Inc., Ingo Molnar
11 static DEFINE_SPINLOCK(sched_debug_lock);
14 * This allows printing both to /proc/sched_debug and
17 #define SEQ_printf(m, x...) \
26 * Ease the printing of nsec fields:
28 static long long nsec_high(unsigned long long nsec)
30 if ((long long)nsec < 0) {
32 do_div(nsec, 1000000);
35 do_div(nsec, 1000000);
40 static unsigned long nsec_low(unsigned long long nsec)
42 if ((long long)nsec < 0)
45 return do_div(nsec, 1000000);
48 #define SPLIT_NS(x) nsec_high(x), nsec_low(x)
50 #define SCHED_FEAT(name, enabled) \
53 static const char * const sched_feat_names[] = {
59 static int sched_feat_show(struct seq_file *m, void *v)
63 for (i = 0; i < __SCHED_FEAT_NR; i++) {
64 if (!(sysctl_sched_features & (1UL << i)))
66 seq_printf(m, "%s ", sched_feat_names[i]);
73 #ifdef CONFIG_JUMP_LABEL
75 #define jump_label_key__true STATIC_KEY_INIT_TRUE
76 #define jump_label_key__false STATIC_KEY_INIT_FALSE
78 #define SCHED_FEAT(name, enabled) \
79 jump_label_key__##enabled ,
81 struct static_key sched_feat_keys[__SCHED_FEAT_NR] = {
87 static void sched_feat_disable(int i)
89 static_key_disable_cpuslocked(&sched_feat_keys[i]);
92 static void sched_feat_enable(int i)
94 static_key_enable_cpuslocked(&sched_feat_keys[i]);
97 static void sched_feat_disable(int i) { };
98 static void sched_feat_enable(int i) { };
99 #endif /* CONFIG_JUMP_LABEL */
101 static int sched_feat_set(char *cmp)
106 if (strncmp(cmp, "NO_", 3) == 0) {
111 i = match_string(sched_feat_names, __SCHED_FEAT_NR, cmp);
116 sysctl_sched_features &= ~(1UL << i);
117 sched_feat_disable(i);
119 sysctl_sched_features |= (1UL << i);
120 sched_feat_enable(i);
127 sched_feat_write(struct file *filp, const char __user *ubuf,
128 size_t cnt, loff_t *ppos)
138 if (copy_from_user(&buf, ubuf, cnt))
144 /* Ensure the static_key remains in a consistent state */
145 inode = file_inode(filp);
148 ret = sched_feat_set(cmp);
159 static int sched_feat_open(struct inode *inode, struct file *filp)
161 return single_open(filp, sched_feat_show, NULL);
164 static const struct file_operations sched_feat_fops = {
165 .open = sched_feat_open,
166 .write = sched_feat_write,
169 .release = single_release,
172 __read_mostly bool sched_debug_enabled;
174 static __init int sched_init_debug(void)
176 debugfs_create_file("sched_features", 0644, NULL, NULL,
179 debugfs_create_bool("sched_debug", 0644, NULL,
180 &sched_debug_enabled);
184 late_initcall(sched_init_debug);
190 static struct ctl_table sd_ctl_dir[] = {
192 .procname = "sched_domain",
198 static struct ctl_table sd_ctl_root[] = {
200 .procname = "kernel",
207 static struct ctl_table *sd_alloc_ctl_entry(int n)
209 struct ctl_table *entry =
210 kcalloc(n, sizeof(struct ctl_table), GFP_KERNEL);
215 static void sd_free_ctl_entry(struct ctl_table **tablep)
217 struct ctl_table *entry;
220 * In the intermediate directories, both the child directory and
221 * procname are dynamically allocated and could fail but the mode
222 * will always be set. In the lowest directory the names are
223 * static strings and all have proc handlers.
225 for (entry = *tablep; entry->mode; entry++) {
227 sd_free_ctl_entry(&entry->child);
228 if (entry->proc_handler == NULL)
229 kfree(entry->procname);
236 static int min_load_idx = 0;
237 static int max_load_idx = CPU_LOAD_IDX_MAX-1;
240 set_table_entry(struct ctl_table *entry,
241 const char *procname, void *data, int maxlen,
242 umode_t mode, proc_handler *proc_handler,
245 entry->procname = procname;
247 entry->maxlen = maxlen;
249 entry->proc_handler = proc_handler;
252 entry->extra1 = &min_load_idx;
253 entry->extra2 = &max_load_idx;
257 static struct ctl_table *
258 sd_alloc_ctl_domain_table(struct sched_domain *sd)
260 struct ctl_table *table = sd_alloc_ctl_entry(14);
265 set_table_entry(&table[0] , "min_interval", &sd->min_interval, sizeof(long), 0644, proc_doulongvec_minmax, false);
266 set_table_entry(&table[1] , "max_interval", &sd->max_interval, sizeof(long), 0644, proc_doulongvec_minmax, false);
267 set_table_entry(&table[2] , "busy_idx", &sd->busy_idx, sizeof(int) , 0644, proc_dointvec_minmax, true );
268 set_table_entry(&table[3] , "idle_idx", &sd->idle_idx, sizeof(int) , 0644, proc_dointvec_minmax, true );
269 set_table_entry(&table[4] , "newidle_idx", &sd->newidle_idx, sizeof(int) , 0644, proc_dointvec_minmax, true );
270 set_table_entry(&table[5] , "wake_idx", &sd->wake_idx, sizeof(int) , 0644, proc_dointvec_minmax, true );
271 set_table_entry(&table[6] , "forkexec_idx", &sd->forkexec_idx, sizeof(int) , 0644, proc_dointvec_minmax, true );
272 set_table_entry(&table[7] , "busy_factor", &sd->busy_factor, sizeof(int) , 0644, proc_dointvec_minmax, false);
273 set_table_entry(&table[8] , "imbalance_pct", &sd->imbalance_pct, sizeof(int) , 0644, proc_dointvec_minmax, false);
274 set_table_entry(&table[9] , "cache_nice_tries", &sd->cache_nice_tries, sizeof(int) , 0644, proc_dointvec_minmax, false);
275 set_table_entry(&table[10], "flags", &sd->flags, sizeof(int) , 0644, proc_dointvec_minmax, false);
276 set_table_entry(&table[11], "max_newidle_lb_cost", &sd->max_newidle_lb_cost, sizeof(long), 0644, proc_doulongvec_minmax, false);
277 set_table_entry(&table[12], "name", sd->name, CORENAME_MAX_SIZE, 0444, proc_dostring, false);
278 /* &table[13] is terminator */
283 static struct ctl_table *sd_alloc_ctl_cpu_table(int cpu)
285 struct ctl_table *entry, *table;
286 struct sched_domain *sd;
287 int domain_num = 0, i;
290 for_each_domain(cpu, sd)
292 entry = table = sd_alloc_ctl_entry(domain_num + 1);
297 for_each_domain(cpu, sd) {
298 snprintf(buf, 32, "domain%d", i);
299 entry->procname = kstrdup(buf, GFP_KERNEL);
301 entry->child = sd_alloc_ctl_domain_table(sd);
308 static cpumask_var_t sd_sysctl_cpus;
309 static struct ctl_table_header *sd_sysctl_header;
311 void register_sched_domain_sysctl(void)
313 static struct ctl_table *cpu_entries;
314 static struct ctl_table **cpu_idx;
315 static bool init_done = false;
320 cpu_entries = sd_alloc_ctl_entry(num_possible_cpus() + 1);
324 WARN_ON(sd_ctl_dir[0].child);
325 sd_ctl_dir[0].child = cpu_entries;
329 struct ctl_table *e = cpu_entries;
331 cpu_idx = kcalloc(nr_cpu_ids, sizeof(struct ctl_table*), GFP_KERNEL);
335 /* deal with sparse possible map */
336 for_each_possible_cpu(i) {
342 if (!cpumask_available(sd_sysctl_cpus)) {
343 if (!alloc_cpumask_var(&sd_sysctl_cpus, GFP_KERNEL))
349 /* init to possible to not have holes in @cpu_entries */
350 cpumask_copy(sd_sysctl_cpus, cpu_possible_mask);
353 for_each_cpu(i, sd_sysctl_cpus) {
354 struct ctl_table *e = cpu_idx[i];
357 sd_free_ctl_entry(&e->child);
360 snprintf(buf, 32, "cpu%d", i);
361 e->procname = kstrdup(buf, GFP_KERNEL);
364 e->child = sd_alloc_ctl_cpu_table(i);
366 __cpumask_clear_cpu(i, sd_sysctl_cpus);
369 WARN_ON(sd_sysctl_header);
370 sd_sysctl_header = register_sysctl_table(sd_ctl_root);
373 void dirty_sched_domain_sysctl(int cpu)
375 if (cpumask_available(sd_sysctl_cpus))
376 __cpumask_set_cpu(cpu, sd_sysctl_cpus);
379 /* may be called multiple times per register */
380 void unregister_sched_domain_sysctl(void)
382 unregister_sysctl_table(sd_sysctl_header);
383 sd_sysctl_header = NULL;
385 #endif /* CONFIG_SYSCTL */
386 #endif /* CONFIG_SMP */
388 #ifdef CONFIG_FAIR_GROUP_SCHED
389 static void print_cfs_group_stats(struct seq_file *m, int cpu, struct task_group *tg)
391 struct sched_entity *se = tg->se[cpu];
393 #define P(F) SEQ_printf(m, " .%-30s: %lld\n", #F, (long long)F)
394 #define P_SCHEDSTAT(F) SEQ_printf(m, " .%-30s: %lld\n", #F, (long long)schedstat_val(F))
395 #define PN(F) SEQ_printf(m, " .%-30s: %lld.%06ld\n", #F, SPLIT_NS((long long)F))
396 #define PN_SCHEDSTAT(F) SEQ_printf(m, " .%-30s: %lld.%06ld\n", #F, SPLIT_NS((long long)schedstat_val(F)))
403 PN(se->sum_exec_runtime);
405 if (schedstat_enabled()) {
406 PN_SCHEDSTAT(se->statistics.wait_start);
407 PN_SCHEDSTAT(se->statistics.sleep_start);
408 PN_SCHEDSTAT(se->statistics.block_start);
409 PN_SCHEDSTAT(se->statistics.sleep_max);
410 PN_SCHEDSTAT(se->statistics.block_max);
411 PN_SCHEDSTAT(se->statistics.exec_max);
412 PN_SCHEDSTAT(se->statistics.slice_max);
413 PN_SCHEDSTAT(se->statistics.wait_max);
414 PN_SCHEDSTAT(se->statistics.wait_sum);
415 P_SCHEDSTAT(se->statistics.wait_count);
419 P(se->runnable_weight);
423 P(se->avg.runnable_load_avg);
433 #ifdef CONFIG_CGROUP_SCHED
434 static char group_path[PATH_MAX];
436 static char *task_group_path(struct task_group *tg)
438 if (autogroup_path(tg, group_path, PATH_MAX))
441 cgroup_path(tg->css.cgroup, group_path, PATH_MAX);
448 print_task(struct seq_file *m, struct rq *rq, struct task_struct *p)
453 SEQ_printf(m, " %c", task_state_to_char(p));
455 SEQ_printf(m, "%15s %5d %9Ld.%06ld %9Ld %5d ",
456 p->comm, task_pid_nr(p),
457 SPLIT_NS(p->se.vruntime),
458 (long long)(p->nvcsw + p->nivcsw),
461 SEQ_printf(m, "%9Ld.%06ld %9Ld.%06ld %9Ld.%06ld",
462 SPLIT_NS(schedstat_val_or_zero(p->se.statistics.wait_sum)),
463 SPLIT_NS(p->se.sum_exec_runtime),
464 SPLIT_NS(schedstat_val_or_zero(p->se.statistics.sum_sleep_runtime)));
466 #ifdef CONFIG_NUMA_BALANCING
467 SEQ_printf(m, " %d %d", task_node(p), task_numa_group_id(p));
469 #ifdef CONFIG_CGROUP_SCHED
470 SEQ_printf(m, " %s", task_group_path(task_group(p)));
476 static void print_rq(struct seq_file *m, struct rq *rq, int rq_cpu)
478 struct task_struct *g, *p;
481 SEQ_printf(m, "runnable tasks:\n");
482 SEQ_printf(m, " S task PID tree-key switches prio"
483 " wait-time sum-exec sum-sleep\n");
484 SEQ_printf(m, "-------------------------------------------------------"
485 "----------------------------------------------------\n");
488 for_each_process_thread(g, p) {
489 if (task_cpu(p) != rq_cpu)
492 print_task(m, rq, p);
497 void print_cfs_rq(struct seq_file *m, int cpu, struct cfs_rq *cfs_rq)
499 s64 MIN_vruntime = -1, min_vruntime, max_vruntime = -1,
500 spread, rq0_min_vruntime, spread0;
501 struct rq *rq = cpu_rq(cpu);
502 struct sched_entity *last;
505 #ifdef CONFIG_FAIR_GROUP_SCHED
507 SEQ_printf(m, "cfs_rq[%d]:%s\n", cpu, task_group_path(cfs_rq->tg));
510 SEQ_printf(m, "cfs_rq[%d]:\n", cpu);
512 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "exec_clock",
513 SPLIT_NS(cfs_rq->exec_clock));
515 raw_spin_lock_irqsave(&rq->lock, flags);
516 if (rb_first_cached(&cfs_rq->tasks_timeline))
517 MIN_vruntime = (__pick_first_entity(cfs_rq))->vruntime;
518 last = __pick_last_entity(cfs_rq);
520 max_vruntime = last->vruntime;
521 min_vruntime = cfs_rq->min_vruntime;
522 rq0_min_vruntime = cpu_rq(0)->cfs.min_vruntime;
523 raw_spin_unlock_irqrestore(&rq->lock, flags);
524 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "MIN_vruntime",
525 SPLIT_NS(MIN_vruntime));
526 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "min_vruntime",
527 SPLIT_NS(min_vruntime));
528 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "max_vruntime",
529 SPLIT_NS(max_vruntime));
530 spread = max_vruntime - MIN_vruntime;
531 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread",
533 spread0 = min_vruntime - rq0_min_vruntime;
534 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread0",
536 SEQ_printf(m, " .%-30s: %d\n", "nr_spread_over",
537 cfs_rq->nr_spread_over);
538 SEQ_printf(m, " .%-30s: %d\n", "nr_running", cfs_rq->nr_running);
539 SEQ_printf(m, " .%-30s: %ld\n", "load", cfs_rq->load.weight);
541 SEQ_printf(m, " .%-30s: %ld\n", "runnable_weight", cfs_rq->runnable_weight);
542 SEQ_printf(m, " .%-30s: %lu\n", "load_avg",
543 cfs_rq->avg.load_avg);
544 SEQ_printf(m, " .%-30s: %lu\n", "runnable_load_avg",
545 cfs_rq->avg.runnable_load_avg);
546 SEQ_printf(m, " .%-30s: %lu\n", "util_avg",
547 cfs_rq->avg.util_avg);
548 SEQ_printf(m, " .%-30s: %u\n", "util_est_enqueued",
549 cfs_rq->avg.util_est.enqueued);
550 SEQ_printf(m, " .%-30s: %ld\n", "removed.load_avg",
551 cfs_rq->removed.load_avg);
552 SEQ_printf(m, " .%-30s: %ld\n", "removed.util_avg",
553 cfs_rq->removed.util_avg);
554 SEQ_printf(m, " .%-30s: %ld\n", "removed.runnable_sum",
555 cfs_rq->removed.runnable_sum);
556 #ifdef CONFIG_FAIR_GROUP_SCHED
557 SEQ_printf(m, " .%-30s: %lu\n", "tg_load_avg_contrib",
558 cfs_rq->tg_load_avg_contrib);
559 SEQ_printf(m, " .%-30s: %ld\n", "tg_load_avg",
560 atomic_long_read(&cfs_rq->tg->load_avg));
563 #ifdef CONFIG_CFS_BANDWIDTH
564 SEQ_printf(m, " .%-30s: %d\n", "throttled",
566 SEQ_printf(m, " .%-30s: %d\n", "throttle_count",
567 cfs_rq->throttle_count);
570 #ifdef CONFIG_FAIR_GROUP_SCHED
571 print_cfs_group_stats(m, cpu, cfs_rq->tg);
575 void print_rt_rq(struct seq_file *m, int cpu, struct rt_rq *rt_rq)
577 #ifdef CONFIG_RT_GROUP_SCHED
579 SEQ_printf(m, "rt_rq[%d]:%s\n", cpu, task_group_path(rt_rq->tg));
582 SEQ_printf(m, "rt_rq[%d]:\n", cpu);
586 SEQ_printf(m, " .%-30s: %Ld\n", #x, (long long)(rt_rq->x))
588 SEQ_printf(m, " .%-30s: %lu\n", #x, (unsigned long)(rt_rq->x))
590 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rt_rq->x))
605 void print_dl_rq(struct seq_file *m, int cpu, struct dl_rq *dl_rq)
610 SEQ_printf(m, "dl_rq[%d]:\n", cpu);
613 SEQ_printf(m, " .%-30s: %lu\n", #x, (unsigned long)(dl_rq->x))
618 dl_bw = &cpu_rq(cpu)->rd->dl_bw;
620 dl_bw = &dl_rq->dl_bw;
622 SEQ_printf(m, " .%-30s: %lld\n", "dl_bw->bw", dl_bw->bw);
623 SEQ_printf(m, " .%-30s: %lld\n", "dl_bw->total_bw", dl_bw->total_bw);
628 static void print_cpu(struct seq_file *m, int cpu)
630 struct rq *rq = cpu_rq(cpu);
635 unsigned int freq = cpu_khz ? : 1;
637 SEQ_printf(m, "cpu#%d, %u.%03u MHz\n",
638 cpu, freq / 1000, (freq % 1000));
641 SEQ_printf(m, "cpu#%d\n", cpu);
646 if (sizeof(rq->x) == 4) \
647 SEQ_printf(m, " .%-30s: %ld\n", #x, (long)(rq->x)); \
649 SEQ_printf(m, " .%-30s: %Ld\n", #x, (long long)(rq->x));\
653 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rq->x))
656 SEQ_printf(m, " .%-30s: %lu\n", "load",
660 P(nr_uninterruptible);
662 SEQ_printf(m, " .%-30s: %ld\n", "curr->pid", (long)(task_pid_nr(rq->curr)));
674 #define P64(n) SEQ_printf(m, " .%-30s: %Ld\n", #n, rq->n);
676 P64(max_idle_balance_cost);
680 #define P(n) SEQ_printf(m, " .%-30s: %d\n", #n, schedstat_val(rq->n));
681 if (schedstat_enabled()) {
690 spin_lock_irqsave(&sched_debug_lock, flags);
691 print_cfs_stats(m, cpu);
692 print_rt_stats(m, cpu);
693 print_dl_stats(m, cpu);
695 print_rq(m, rq, cpu);
696 spin_unlock_irqrestore(&sched_debug_lock, flags);
700 static const char *sched_tunable_scaling_names[] = {
706 static void sched_debug_header(struct seq_file *m)
708 u64 ktime, sched_clk, cpu_clk;
711 local_irq_save(flags);
712 ktime = ktime_to_ns(ktime_get());
713 sched_clk = sched_clock();
714 cpu_clk = local_clock();
715 local_irq_restore(flags);
717 SEQ_printf(m, "Sched Debug Version: v0.11, %s %.*s\n",
718 init_utsname()->release,
719 (int)strcspn(init_utsname()->version, " "),
720 init_utsname()->version);
723 SEQ_printf(m, "%-40s: %Ld\n", #x, (long long)(x))
725 SEQ_printf(m, "%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
730 #ifdef CONFIG_HAVE_UNSTABLE_SCHED_CLOCK
731 P(sched_clock_stable());
737 SEQ_printf(m, "sysctl_sched\n");
740 SEQ_printf(m, " .%-40s: %Ld\n", #x, (long long)(x))
742 SEQ_printf(m, " .%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
743 PN(sysctl_sched_latency);
744 PN(sysctl_sched_min_granularity);
745 PN(sysctl_sched_wakeup_granularity);
746 P(sysctl_sched_child_runs_first);
747 P(sysctl_sched_features);
751 SEQ_printf(m, " .%-40s: %d (%s)\n",
752 "sysctl_sched_tunable_scaling",
753 sysctl_sched_tunable_scaling,
754 sched_tunable_scaling_names[sysctl_sched_tunable_scaling]);
758 static int sched_debug_show(struct seq_file *m, void *v)
760 int cpu = (unsigned long)(v - 2);
765 sched_debug_header(m);
770 void sysrq_sched_debug_show(void)
774 sched_debug_header(NULL);
775 for_each_online_cpu(cpu)
776 print_cpu(NULL, cpu);
781 * This itererator needs some explanation.
782 * It returns 1 for the header position.
783 * This means 2 is CPU 0.
784 * In a hotplugged system some CPUs, including CPU 0, may be missing so we have
785 * to use cpumask_* to iterate over the CPUs.
787 static void *sched_debug_start(struct seq_file *file, loff_t *offset)
789 unsigned long n = *offset;
797 n = cpumask_next(n - 1, cpu_online_mask);
799 n = cpumask_first(cpu_online_mask);
804 return (void *)(unsigned long)(n + 2);
809 static void *sched_debug_next(struct seq_file *file, void *data, loff_t *offset)
812 return sched_debug_start(file, offset);
815 static void sched_debug_stop(struct seq_file *file, void *data)
819 static const struct seq_operations sched_debug_sops = {
820 .start = sched_debug_start,
821 .next = sched_debug_next,
822 .stop = sched_debug_stop,
823 .show = sched_debug_show,
826 static int __init init_sched_debug_procfs(void)
828 if (!proc_create_seq("sched_debug", 0444, NULL, &sched_debug_sops))
833 __initcall(init_sched_debug_procfs);
835 #define __P(F) SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)F)
836 #define P(F) SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)p->F)
837 #define __PN(F) SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)F))
838 #define PN(F) SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)p->F))
841 #ifdef CONFIG_NUMA_BALANCING
842 void print_numa_stats(struct seq_file *m, int node, unsigned long tsf,
843 unsigned long tpf, unsigned long gsf, unsigned long gpf)
845 SEQ_printf(m, "numa_faults node=%d ", node);
846 SEQ_printf(m, "task_private=%lu task_shared=%lu ", tpf, tsf);
847 SEQ_printf(m, "group_private=%lu group_shared=%lu\n", gpf, gsf);
852 static void sched_show_numa(struct task_struct *p, struct seq_file *m)
854 #ifdef CONFIG_NUMA_BALANCING
855 struct mempolicy *pol;
858 P(mm->numa_scan_seq);
862 if (pol && !(pol->flags & MPOL_F_MORON))
867 P(numa_pages_migrated);
868 P(numa_preferred_nid);
869 P(total_numa_faults);
870 SEQ_printf(m, "current_node=%d, numa_group_id=%d\n",
871 task_node(p), task_numa_group_id(p));
872 show_numa_stats(p, m);
877 void proc_sched_show_task(struct task_struct *p, struct pid_namespace *ns,
880 unsigned long nr_switches;
882 SEQ_printf(m, "%s (%d, #threads: %d)\n", p->comm, task_pid_nr_ns(p, ns),
885 "---------------------------------------------------------"
888 SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)F)
890 SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)p->F)
891 #define P_SCHEDSTAT(F) \
892 SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)schedstat_val(p->F))
894 SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)F))
896 SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)p->F))
897 #define PN_SCHEDSTAT(F) \
898 SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)schedstat_val(p->F)))
902 PN(se.sum_exec_runtime);
904 nr_switches = p->nvcsw + p->nivcsw;
908 if (schedstat_enabled()) {
909 u64 avg_atom, avg_per_cpu;
911 PN_SCHEDSTAT(se.statistics.sum_sleep_runtime);
912 PN_SCHEDSTAT(se.statistics.wait_start);
913 PN_SCHEDSTAT(se.statistics.sleep_start);
914 PN_SCHEDSTAT(se.statistics.block_start);
915 PN_SCHEDSTAT(se.statistics.sleep_max);
916 PN_SCHEDSTAT(se.statistics.block_max);
917 PN_SCHEDSTAT(se.statistics.exec_max);
918 PN_SCHEDSTAT(se.statistics.slice_max);
919 PN_SCHEDSTAT(se.statistics.wait_max);
920 PN_SCHEDSTAT(se.statistics.wait_sum);
921 P_SCHEDSTAT(se.statistics.wait_count);
922 PN_SCHEDSTAT(se.statistics.iowait_sum);
923 P_SCHEDSTAT(se.statistics.iowait_count);
924 P_SCHEDSTAT(se.statistics.nr_migrations_cold);
925 P_SCHEDSTAT(se.statistics.nr_failed_migrations_affine);
926 P_SCHEDSTAT(se.statistics.nr_failed_migrations_running);
927 P_SCHEDSTAT(se.statistics.nr_failed_migrations_hot);
928 P_SCHEDSTAT(se.statistics.nr_forced_migrations);
929 P_SCHEDSTAT(se.statistics.nr_wakeups);
930 P_SCHEDSTAT(se.statistics.nr_wakeups_sync);
931 P_SCHEDSTAT(se.statistics.nr_wakeups_migrate);
932 P_SCHEDSTAT(se.statistics.nr_wakeups_local);
933 P_SCHEDSTAT(se.statistics.nr_wakeups_remote);
934 P_SCHEDSTAT(se.statistics.nr_wakeups_affine);
935 P_SCHEDSTAT(se.statistics.nr_wakeups_affine_attempts);
936 P_SCHEDSTAT(se.statistics.nr_wakeups_passive);
937 P_SCHEDSTAT(se.statistics.nr_wakeups_idle);
939 avg_atom = p->se.sum_exec_runtime;
941 avg_atom = div64_ul(avg_atom, nr_switches);
945 avg_per_cpu = p->se.sum_exec_runtime;
946 if (p->se.nr_migrations) {
947 avg_per_cpu = div64_u64(avg_per_cpu,
948 p->se.nr_migrations);
958 SEQ_printf(m, "%-45s:%21Ld\n",
959 "nr_voluntary_switches", (long long)p->nvcsw);
960 SEQ_printf(m, "%-45s:%21Ld\n",
961 "nr_involuntary_switches", (long long)p->nivcsw);
964 P(se.runnable_weight);
967 P(se.avg.runnable_load_sum);
970 P(se.avg.runnable_load_avg);
972 P(se.avg.last_update_time);
973 P(se.avg.util_est.ewma);
974 P(se.avg.util_est.enqueued);
978 if (task_has_dl_policy(p)) {
990 unsigned int this_cpu = raw_smp_processor_id();
993 t0 = cpu_clock(this_cpu);
994 t1 = cpu_clock(this_cpu);
995 SEQ_printf(m, "%-45s:%21Ld\n",
996 "clock-delta", (long long)(t1-t0));
999 sched_show_numa(p, m);
1002 void proc_sched_set_task(struct task_struct *p)
1004 #ifdef CONFIG_SCHEDSTATS
1005 memset(&p->se.statistics, 0, sizeof(p->se.statistics));