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
12 * This allows printing both to /proc/sched_debug and
15 #define SEQ_printf(m, x...) \
24 * Ease the printing of nsec fields:
26 static long long nsec_high(unsigned long long nsec)
28 if ((long long)nsec < 0) {
30 do_div(nsec, 1000000);
33 do_div(nsec, 1000000);
38 static unsigned long nsec_low(unsigned long long nsec)
40 if ((long long)nsec < 0)
43 return do_div(nsec, 1000000);
46 #define SPLIT_NS(x) nsec_high(x), nsec_low(x)
48 #define SCHED_FEAT(name, enabled) \
51 static const char * const sched_feat_names[] = {
57 static int sched_feat_show(struct seq_file *m, void *v)
61 for (i = 0; i < __SCHED_FEAT_NR; i++) {
62 if (!(sysctl_sched_features & (1UL << i)))
64 seq_printf(m, "%s ", sched_feat_names[i]);
71 #ifdef CONFIG_JUMP_LABEL
73 #define jump_label_key__true STATIC_KEY_INIT_TRUE
74 #define jump_label_key__false STATIC_KEY_INIT_FALSE
76 #define SCHED_FEAT(name, enabled) \
77 jump_label_key__##enabled ,
79 struct static_key sched_feat_keys[__SCHED_FEAT_NR] = {
85 static void sched_feat_disable(int i)
87 static_key_disable_cpuslocked(&sched_feat_keys[i]);
90 static void sched_feat_enable(int i)
92 static_key_enable_cpuslocked(&sched_feat_keys[i]);
95 static void sched_feat_disable(int i) { };
96 static void sched_feat_enable(int i) { };
97 #endif /* CONFIG_JUMP_LABEL */
99 static int sched_feat_set(char *cmp)
104 if (strncmp(cmp, "NO_", 3) == 0) {
109 i = match_string(sched_feat_names, __SCHED_FEAT_NR, cmp);
114 sysctl_sched_features &= ~(1UL << i);
115 sched_feat_disable(i);
117 sysctl_sched_features |= (1UL << i);
118 sched_feat_enable(i);
125 sched_feat_write(struct file *filp, const char __user *ubuf,
126 size_t cnt, loff_t *ppos)
136 if (copy_from_user(&buf, ubuf, cnt))
142 /* Ensure the static_key remains in a consistent state */
143 inode = file_inode(filp);
146 ret = sched_feat_set(cmp);
157 static int sched_feat_open(struct inode *inode, struct file *filp)
159 return single_open(filp, sched_feat_show, NULL);
162 static const struct file_operations sched_feat_fops = {
163 .open = sched_feat_open,
164 .write = sched_feat_write,
167 .release = single_release,
170 __read_mostly bool sched_debug_enabled;
172 static __init int sched_init_debug(void)
174 debugfs_create_file("sched_features", 0644, NULL, NULL,
177 debugfs_create_bool("sched_debug", 0644, NULL,
178 &sched_debug_enabled);
182 late_initcall(sched_init_debug);
188 static struct ctl_table sd_ctl_dir[] = {
190 .procname = "sched_domain",
196 static struct ctl_table sd_ctl_root[] = {
198 .procname = "kernel",
205 static struct ctl_table *sd_alloc_ctl_entry(int n)
207 struct ctl_table *entry =
208 kcalloc(n, sizeof(struct ctl_table), GFP_KERNEL);
213 static void sd_free_ctl_entry(struct ctl_table **tablep)
215 struct ctl_table *entry;
218 * In the intermediate directories, both the child directory and
219 * procname are dynamically allocated and could fail but the mode
220 * will always be set. In the lowest directory the names are
221 * static strings and all have proc handlers.
223 for (entry = *tablep; entry->mode; entry++) {
225 sd_free_ctl_entry(&entry->child);
226 if (entry->proc_handler == NULL)
227 kfree(entry->procname);
235 set_table_entry(struct ctl_table *entry,
236 const char *procname, void *data, int maxlen,
237 umode_t mode, proc_handler *proc_handler)
239 entry->procname = procname;
241 entry->maxlen = maxlen;
243 entry->proc_handler = proc_handler;
246 static int sd_ctl_doflags(struct ctl_table *table, int write,
247 void *buffer, size_t *lenp, loff_t *ppos)
249 unsigned long flags = *(unsigned long *)table->data;
250 size_t data_size = 0;
258 for_each_set_bit(idx, &flags, __SD_FLAG_CNT) {
259 char *name = sd_flag_debug[idx].name;
261 /* Name plus whitespace */
262 data_size += strlen(name) + 1;
265 if (*ppos > data_size) {
270 buf = kcalloc(data_size + 1, sizeof(*buf), GFP_KERNEL);
274 for_each_set_bit(idx, &flags, __SD_FLAG_CNT) {
275 char *name = sd_flag_debug[idx].name;
277 len += snprintf(buf + len, strlen(name) + 2, "%s ", name);
286 memcpy(buffer, tmp, len);
288 ((char *)buffer)[len] = '\n';
300 static struct ctl_table *
301 sd_alloc_ctl_domain_table(struct sched_domain *sd)
303 struct ctl_table *table = sd_alloc_ctl_entry(9);
308 set_table_entry(&table[0], "min_interval", &sd->min_interval, sizeof(long), 0644, proc_doulongvec_minmax);
309 set_table_entry(&table[1], "max_interval", &sd->max_interval, sizeof(long), 0644, proc_doulongvec_minmax);
310 set_table_entry(&table[2], "busy_factor", &sd->busy_factor, sizeof(int), 0644, proc_dointvec_minmax);
311 set_table_entry(&table[3], "imbalance_pct", &sd->imbalance_pct, sizeof(int), 0644, proc_dointvec_minmax);
312 set_table_entry(&table[4], "cache_nice_tries", &sd->cache_nice_tries, sizeof(int), 0644, proc_dointvec_minmax);
313 set_table_entry(&table[5], "flags", &sd->flags, sizeof(int), 0444, sd_ctl_doflags);
314 set_table_entry(&table[6], "max_newidle_lb_cost", &sd->max_newidle_lb_cost, sizeof(long), 0644, proc_doulongvec_minmax);
315 set_table_entry(&table[7], "name", sd->name, CORENAME_MAX_SIZE, 0444, proc_dostring);
316 /* &table[8] is terminator */
321 static struct ctl_table *sd_alloc_ctl_cpu_table(int cpu)
323 struct ctl_table *entry, *table;
324 struct sched_domain *sd;
325 int domain_num = 0, i;
328 for_each_domain(cpu, sd)
330 entry = table = sd_alloc_ctl_entry(domain_num + 1);
335 for_each_domain(cpu, sd) {
336 snprintf(buf, 32, "domain%d", i);
337 entry->procname = kstrdup(buf, GFP_KERNEL);
339 entry->child = sd_alloc_ctl_domain_table(sd);
346 static cpumask_var_t sd_sysctl_cpus;
347 static struct ctl_table_header *sd_sysctl_header;
349 void register_sched_domain_sysctl(void)
351 static struct ctl_table *cpu_entries;
352 static struct ctl_table **cpu_idx;
353 static bool init_done = false;
358 cpu_entries = sd_alloc_ctl_entry(num_possible_cpus() + 1);
362 WARN_ON(sd_ctl_dir[0].child);
363 sd_ctl_dir[0].child = cpu_entries;
367 struct ctl_table *e = cpu_entries;
369 cpu_idx = kcalloc(nr_cpu_ids, sizeof(struct ctl_table*), GFP_KERNEL);
373 /* deal with sparse possible map */
374 for_each_possible_cpu(i) {
380 if (!cpumask_available(sd_sysctl_cpus)) {
381 if (!alloc_cpumask_var(&sd_sysctl_cpus, GFP_KERNEL))
387 /* init to possible to not have holes in @cpu_entries */
388 cpumask_copy(sd_sysctl_cpus, cpu_possible_mask);
391 for_each_cpu(i, sd_sysctl_cpus) {
392 struct ctl_table *e = cpu_idx[i];
395 sd_free_ctl_entry(&e->child);
398 snprintf(buf, 32, "cpu%d", i);
399 e->procname = kstrdup(buf, GFP_KERNEL);
402 e->child = sd_alloc_ctl_cpu_table(i);
404 __cpumask_clear_cpu(i, sd_sysctl_cpus);
407 WARN_ON(sd_sysctl_header);
408 sd_sysctl_header = register_sysctl_table(sd_ctl_root);
411 void dirty_sched_domain_sysctl(int cpu)
413 if (cpumask_available(sd_sysctl_cpus))
414 __cpumask_set_cpu(cpu, sd_sysctl_cpus);
417 /* may be called multiple times per register */
418 void unregister_sched_domain_sysctl(void)
420 unregister_sysctl_table(sd_sysctl_header);
421 sd_sysctl_header = NULL;
423 #endif /* CONFIG_SYSCTL */
424 #endif /* CONFIG_SMP */
426 #ifdef CONFIG_FAIR_GROUP_SCHED
427 static void print_cfs_group_stats(struct seq_file *m, int cpu, struct task_group *tg)
429 struct sched_entity *se = tg->se[cpu];
431 #define P(F) SEQ_printf(m, " .%-30s: %lld\n", #F, (long long)F)
432 #define P_SCHEDSTAT(F) SEQ_printf(m, " .%-30s: %lld\n", #F, (long long)schedstat_val(F))
433 #define PN(F) SEQ_printf(m, " .%-30s: %lld.%06ld\n", #F, SPLIT_NS((long long)F))
434 #define PN_SCHEDSTAT(F) SEQ_printf(m, " .%-30s: %lld.%06ld\n", #F, SPLIT_NS((long long)schedstat_val(F)))
441 PN(se->sum_exec_runtime);
443 if (schedstat_enabled()) {
444 PN_SCHEDSTAT(se->statistics.wait_start);
445 PN_SCHEDSTAT(se->statistics.sleep_start);
446 PN_SCHEDSTAT(se->statistics.block_start);
447 PN_SCHEDSTAT(se->statistics.sleep_max);
448 PN_SCHEDSTAT(se->statistics.block_max);
449 PN_SCHEDSTAT(se->statistics.exec_max);
450 PN_SCHEDSTAT(se->statistics.slice_max);
451 PN_SCHEDSTAT(se->statistics.wait_max);
452 PN_SCHEDSTAT(se->statistics.wait_sum);
453 P_SCHEDSTAT(se->statistics.wait_count);
460 P(se->avg.runnable_avg);
470 #ifdef CONFIG_CGROUP_SCHED
471 static DEFINE_SPINLOCK(sched_debug_lock);
472 static char group_path[PATH_MAX];
474 static void task_group_path(struct task_group *tg, char *path, int plen)
476 if (autogroup_path(tg, path, plen))
479 cgroup_path(tg->css.cgroup, path, plen);
483 * Only 1 SEQ_printf_task_group_path() caller can use the full length
484 * group_path[] for cgroup path. Other simultaneous callers will have
485 * to use a shorter stack buffer. A "..." suffix is appended at the end
486 * of the stack buffer so that it will show up in case the output length
487 * matches the given buffer size to indicate possible path name truncation.
489 #define SEQ_printf_task_group_path(m, tg, fmt...) \
491 if (spin_trylock(&sched_debug_lock)) { \
492 task_group_path(tg, group_path, sizeof(group_path)); \
493 SEQ_printf(m, fmt, group_path); \
494 spin_unlock(&sched_debug_lock); \
497 char *bufend = buf + sizeof(buf) - 3; \
498 task_group_path(tg, buf, bufend - buf); \
499 strcpy(bufend - 1, "..."); \
500 SEQ_printf(m, fmt, buf); \
506 print_task(struct seq_file *m, struct rq *rq, struct task_struct *p)
511 SEQ_printf(m, " %c", task_state_to_char(p));
513 SEQ_printf(m, " %15s %5d %9Ld.%06ld %9Ld %5d ",
514 p->comm, task_pid_nr(p),
515 SPLIT_NS(p->se.vruntime),
516 (long long)(p->nvcsw + p->nivcsw),
519 SEQ_printf(m, "%9Ld.%06ld %9Ld.%06ld %9Ld.%06ld",
520 SPLIT_NS(schedstat_val_or_zero(p->se.statistics.wait_sum)),
521 SPLIT_NS(p->se.sum_exec_runtime),
522 SPLIT_NS(schedstat_val_or_zero(p->se.statistics.sum_sleep_runtime)));
524 #ifdef CONFIG_NUMA_BALANCING
525 SEQ_printf(m, " %d %d", task_node(p), task_numa_group_id(p));
527 #ifdef CONFIG_CGROUP_SCHED
528 SEQ_printf_task_group_path(m, task_group(p), " %s")
534 static void print_rq(struct seq_file *m, struct rq *rq, int rq_cpu)
536 struct task_struct *g, *p;
539 SEQ_printf(m, "runnable tasks:\n");
540 SEQ_printf(m, " S task PID tree-key switches prio"
541 " wait-time sum-exec sum-sleep\n");
542 SEQ_printf(m, "-------------------------------------------------------"
543 "------------------------------------------------------\n");
546 for_each_process_thread(g, p) {
547 if (task_cpu(p) != rq_cpu)
550 print_task(m, rq, p);
555 void print_cfs_rq(struct seq_file *m, int cpu, struct cfs_rq *cfs_rq)
557 s64 MIN_vruntime = -1, min_vruntime, max_vruntime = -1,
558 spread, rq0_min_vruntime, spread0;
559 struct rq *rq = cpu_rq(cpu);
560 struct sched_entity *last;
563 #ifdef CONFIG_FAIR_GROUP_SCHED
565 SEQ_printf_task_group_path(m, cfs_rq->tg, "cfs_rq[%d]:%s\n", cpu);
568 SEQ_printf(m, "cfs_rq[%d]:\n", cpu);
570 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "exec_clock",
571 SPLIT_NS(cfs_rq->exec_clock));
573 raw_spin_lock_irqsave(&rq->lock, flags);
574 if (rb_first_cached(&cfs_rq->tasks_timeline))
575 MIN_vruntime = (__pick_first_entity(cfs_rq))->vruntime;
576 last = __pick_last_entity(cfs_rq);
578 max_vruntime = last->vruntime;
579 min_vruntime = cfs_rq->min_vruntime;
580 rq0_min_vruntime = cpu_rq(0)->cfs.min_vruntime;
581 raw_spin_unlock_irqrestore(&rq->lock, flags);
582 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "MIN_vruntime",
583 SPLIT_NS(MIN_vruntime));
584 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "min_vruntime",
585 SPLIT_NS(min_vruntime));
586 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "max_vruntime",
587 SPLIT_NS(max_vruntime));
588 spread = max_vruntime - MIN_vruntime;
589 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread",
591 spread0 = min_vruntime - rq0_min_vruntime;
592 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread0",
594 SEQ_printf(m, " .%-30s: %d\n", "nr_spread_over",
595 cfs_rq->nr_spread_over);
596 SEQ_printf(m, " .%-30s: %d\n", "nr_running", cfs_rq->nr_running);
597 SEQ_printf(m, " .%-30s: %ld\n", "load", cfs_rq->load.weight);
599 SEQ_printf(m, " .%-30s: %lu\n", "load_avg",
600 cfs_rq->avg.load_avg);
601 SEQ_printf(m, " .%-30s: %lu\n", "runnable_avg",
602 cfs_rq->avg.runnable_avg);
603 SEQ_printf(m, " .%-30s: %lu\n", "util_avg",
604 cfs_rq->avg.util_avg);
605 SEQ_printf(m, " .%-30s: %u\n", "util_est_enqueued",
606 cfs_rq->avg.util_est.enqueued);
607 SEQ_printf(m, " .%-30s: %ld\n", "removed.load_avg",
608 cfs_rq->removed.load_avg);
609 SEQ_printf(m, " .%-30s: %ld\n", "removed.util_avg",
610 cfs_rq->removed.util_avg);
611 SEQ_printf(m, " .%-30s: %ld\n", "removed.runnable_avg",
612 cfs_rq->removed.runnable_avg);
613 #ifdef CONFIG_FAIR_GROUP_SCHED
614 SEQ_printf(m, " .%-30s: %lu\n", "tg_load_avg_contrib",
615 cfs_rq->tg_load_avg_contrib);
616 SEQ_printf(m, " .%-30s: %ld\n", "tg_load_avg",
617 atomic_long_read(&cfs_rq->tg->load_avg));
620 #ifdef CONFIG_CFS_BANDWIDTH
621 SEQ_printf(m, " .%-30s: %d\n", "throttled",
623 SEQ_printf(m, " .%-30s: %d\n", "throttle_count",
624 cfs_rq->throttle_count);
627 #ifdef CONFIG_FAIR_GROUP_SCHED
628 print_cfs_group_stats(m, cpu, cfs_rq->tg);
632 void print_rt_rq(struct seq_file *m, int cpu, struct rt_rq *rt_rq)
634 #ifdef CONFIG_RT_GROUP_SCHED
636 SEQ_printf_task_group_path(m, rt_rq->tg, "rt_rq[%d]:%s\n", cpu);
639 SEQ_printf(m, "rt_rq[%d]:\n", cpu);
643 SEQ_printf(m, " .%-30s: %Ld\n", #x, (long long)(rt_rq->x))
645 SEQ_printf(m, " .%-30s: %lu\n", #x, (unsigned long)(rt_rq->x))
647 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rt_rq->x))
662 void print_dl_rq(struct seq_file *m, int cpu, struct dl_rq *dl_rq)
667 SEQ_printf(m, "dl_rq[%d]:\n", cpu);
670 SEQ_printf(m, " .%-30s: %lu\n", #x, (unsigned long)(dl_rq->x))
675 dl_bw = &cpu_rq(cpu)->rd->dl_bw;
677 dl_bw = &dl_rq->dl_bw;
679 SEQ_printf(m, " .%-30s: %lld\n", "dl_bw->bw", dl_bw->bw);
680 SEQ_printf(m, " .%-30s: %lld\n", "dl_bw->total_bw", dl_bw->total_bw);
685 static void print_cpu(struct seq_file *m, int cpu)
687 struct rq *rq = cpu_rq(cpu);
691 unsigned int freq = cpu_khz ? : 1;
693 SEQ_printf(m, "cpu#%d, %u.%03u MHz\n",
694 cpu, freq / 1000, (freq % 1000));
697 SEQ_printf(m, "cpu#%d\n", cpu);
702 if (sizeof(rq->x) == 4) \
703 SEQ_printf(m, " .%-30s: %ld\n", #x, (long)(rq->x)); \
705 SEQ_printf(m, " .%-30s: %Ld\n", #x, (long long)(rq->x));\
709 SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rq->x))
713 P(nr_uninterruptible);
715 SEQ_printf(m, " .%-30s: %ld\n", "curr->pid", (long)(task_pid_nr(rq->curr)));
722 #define P64(n) SEQ_printf(m, " .%-30s: %Ld\n", #n, rq->n);
724 P64(max_idle_balance_cost);
728 #define P(n) SEQ_printf(m, " .%-30s: %d\n", #n, schedstat_val(rq->n));
729 if (schedstat_enabled()) {
738 print_cfs_stats(m, cpu);
739 print_rt_stats(m, cpu);
740 print_dl_stats(m, cpu);
742 print_rq(m, rq, cpu);
746 static const char *sched_tunable_scaling_names[] = {
752 static void sched_debug_header(struct seq_file *m)
754 u64 ktime, sched_clk, cpu_clk;
757 local_irq_save(flags);
758 ktime = ktime_to_ns(ktime_get());
759 sched_clk = sched_clock();
760 cpu_clk = local_clock();
761 local_irq_restore(flags);
763 SEQ_printf(m, "Sched Debug Version: v0.11, %s %.*s\n",
764 init_utsname()->release,
765 (int)strcspn(init_utsname()->version, " "),
766 init_utsname()->version);
769 SEQ_printf(m, "%-40s: %Ld\n", #x, (long long)(x))
771 SEQ_printf(m, "%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
776 #ifdef CONFIG_HAVE_UNSTABLE_SCHED_CLOCK
777 P(sched_clock_stable());
783 SEQ_printf(m, "sysctl_sched\n");
786 SEQ_printf(m, " .%-40s: %Ld\n", #x, (long long)(x))
788 SEQ_printf(m, " .%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
789 PN(sysctl_sched_latency);
790 PN(sysctl_sched_min_granularity);
791 PN(sysctl_sched_wakeup_granularity);
792 P(sysctl_sched_child_runs_first);
793 P(sysctl_sched_features);
797 SEQ_printf(m, " .%-40s: %d (%s)\n",
798 "sysctl_sched_tunable_scaling",
799 sysctl_sched_tunable_scaling,
800 sched_tunable_scaling_names[sysctl_sched_tunable_scaling]);
804 static int sched_debug_show(struct seq_file *m, void *v)
806 int cpu = (unsigned long)(v - 2);
811 sched_debug_header(m);
816 void sysrq_sched_debug_show(void)
820 sched_debug_header(NULL);
821 for_each_online_cpu(cpu) {
823 * Need to reset softlockup watchdogs on all CPUs, because
824 * another CPU might be blocked waiting for us to process
825 * an IPI or stop_machine.
827 touch_nmi_watchdog();
828 touch_all_softlockup_watchdogs();
829 print_cpu(NULL, cpu);
834 * This itererator needs some explanation.
835 * It returns 1 for the header position.
836 * This means 2 is CPU 0.
837 * In a hotplugged system some CPUs, including CPU 0, may be missing so we have
838 * to use cpumask_* to iterate over the CPUs.
840 static void *sched_debug_start(struct seq_file *file, loff_t *offset)
842 unsigned long n = *offset;
850 n = cpumask_next(n - 1, cpu_online_mask);
852 n = cpumask_first(cpu_online_mask);
857 return (void *)(unsigned long)(n + 2);
862 static void *sched_debug_next(struct seq_file *file, void *data, loff_t *offset)
865 return sched_debug_start(file, offset);
868 static void sched_debug_stop(struct seq_file *file, void *data)
872 static const struct seq_operations sched_debug_sops = {
873 .start = sched_debug_start,
874 .next = sched_debug_next,
875 .stop = sched_debug_stop,
876 .show = sched_debug_show,
879 static int __init init_sched_debug_procfs(void)
881 if (!proc_create_seq("sched_debug", 0444, NULL, &sched_debug_sops))
886 __initcall(init_sched_debug_procfs);
888 #define __PS(S, F) SEQ_printf(m, "%-45s:%21Ld\n", S, (long long)(F))
889 #define __P(F) __PS(#F, F)
890 #define P(F) __PS(#F, p->F)
891 #define PM(F, M) __PS(#F, p->F & (M))
892 #define __PSN(S, F) SEQ_printf(m, "%-45s:%14Ld.%06ld\n", S, SPLIT_NS((long long)(F)))
893 #define __PN(F) __PSN(#F, F)
894 #define PN(F) __PSN(#F, p->F)
897 #ifdef CONFIG_NUMA_BALANCING
898 void print_numa_stats(struct seq_file *m, int node, unsigned long tsf,
899 unsigned long tpf, unsigned long gsf, unsigned long gpf)
901 SEQ_printf(m, "numa_faults node=%d ", node);
902 SEQ_printf(m, "task_private=%lu task_shared=%lu ", tpf, tsf);
903 SEQ_printf(m, "group_private=%lu group_shared=%lu\n", gpf, gsf);
908 static void sched_show_numa(struct task_struct *p, struct seq_file *m)
910 #ifdef CONFIG_NUMA_BALANCING
912 P(mm->numa_scan_seq);
914 P(numa_pages_migrated);
915 P(numa_preferred_nid);
916 P(total_numa_faults);
917 SEQ_printf(m, "current_node=%d, numa_group_id=%d\n",
918 task_node(p), task_numa_group_id(p));
919 show_numa_stats(p, m);
923 void proc_sched_show_task(struct task_struct *p, struct pid_namespace *ns,
926 unsigned long nr_switches;
928 SEQ_printf(m, "%s (%d, #threads: %d)\n", p->comm, task_pid_nr_ns(p, ns),
931 "---------------------------------------------------------"
934 #define P_SCHEDSTAT(F) __PS(#F, schedstat_val(p->F))
935 #define PN_SCHEDSTAT(F) __PSN(#F, schedstat_val(p->F))
939 PN(se.sum_exec_runtime);
941 nr_switches = p->nvcsw + p->nivcsw;
945 if (schedstat_enabled()) {
946 u64 avg_atom, avg_per_cpu;
948 PN_SCHEDSTAT(se.statistics.sum_sleep_runtime);
949 PN_SCHEDSTAT(se.statistics.wait_start);
950 PN_SCHEDSTAT(se.statistics.sleep_start);
951 PN_SCHEDSTAT(se.statistics.block_start);
952 PN_SCHEDSTAT(se.statistics.sleep_max);
953 PN_SCHEDSTAT(se.statistics.block_max);
954 PN_SCHEDSTAT(se.statistics.exec_max);
955 PN_SCHEDSTAT(se.statistics.slice_max);
956 PN_SCHEDSTAT(se.statistics.wait_max);
957 PN_SCHEDSTAT(se.statistics.wait_sum);
958 P_SCHEDSTAT(se.statistics.wait_count);
959 PN_SCHEDSTAT(se.statistics.iowait_sum);
960 P_SCHEDSTAT(se.statistics.iowait_count);
961 P_SCHEDSTAT(se.statistics.nr_migrations_cold);
962 P_SCHEDSTAT(se.statistics.nr_failed_migrations_affine);
963 P_SCHEDSTAT(se.statistics.nr_failed_migrations_running);
964 P_SCHEDSTAT(se.statistics.nr_failed_migrations_hot);
965 P_SCHEDSTAT(se.statistics.nr_forced_migrations);
966 P_SCHEDSTAT(se.statistics.nr_wakeups);
967 P_SCHEDSTAT(se.statistics.nr_wakeups_sync);
968 P_SCHEDSTAT(se.statistics.nr_wakeups_migrate);
969 P_SCHEDSTAT(se.statistics.nr_wakeups_local);
970 P_SCHEDSTAT(se.statistics.nr_wakeups_remote);
971 P_SCHEDSTAT(se.statistics.nr_wakeups_affine);
972 P_SCHEDSTAT(se.statistics.nr_wakeups_affine_attempts);
973 P_SCHEDSTAT(se.statistics.nr_wakeups_passive);
974 P_SCHEDSTAT(se.statistics.nr_wakeups_idle);
976 avg_atom = p->se.sum_exec_runtime;
978 avg_atom = div64_ul(avg_atom, nr_switches);
982 avg_per_cpu = p->se.sum_exec_runtime;
983 if (p->se.nr_migrations) {
984 avg_per_cpu = div64_u64(avg_per_cpu,
985 p->se.nr_migrations);
995 __PS("nr_voluntary_switches", p->nvcsw);
996 __PS("nr_involuntary_switches", p->nivcsw);
1001 P(se.avg.runnable_sum);
1004 P(se.avg.runnable_avg);
1006 P(se.avg.last_update_time);
1007 P(se.avg.util_est.ewma);
1008 PM(se.avg.util_est.enqueued, ~UTIL_AVG_UNCHANGED);
1010 #ifdef CONFIG_UCLAMP_TASK
1011 __PS("uclamp.min", p->uclamp_req[UCLAMP_MIN].value);
1012 __PS("uclamp.max", p->uclamp_req[UCLAMP_MAX].value);
1013 __PS("effective uclamp.min", uclamp_eff_value(p, UCLAMP_MIN));
1014 __PS("effective uclamp.max", uclamp_eff_value(p, UCLAMP_MAX));
1018 if (task_has_dl_policy(p)) {
1026 unsigned int this_cpu = raw_smp_processor_id();
1029 t0 = cpu_clock(this_cpu);
1030 t1 = cpu_clock(this_cpu);
1031 __PS("clock-delta", t1-t0);
1034 sched_show_numa(p, m);
1037 void proc_sched_set_task(struct task_struct *p)
1039 #ifdef CONFIG_SCHEDSTATS
1040 memset(&p->se.statistics, 0, sizeof(p->se.statistics));