/* * kernel/sched/debug.c * * Print the CFS rbtree * * Copyright(C) 2007, Red Hat, Inc., Ingo Molnar * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published by the Free Software Foundation. */ #include <linux/proc_fs.h>#include <linux/sched.h>#include <linux/seq_file.h>#include <linux/kallsyms.h>#include <linux/utsname.h>#include <linux/mempolicy.h> #include "sched.h" static DEFINE_SPINLOCK(sched_debug_lock); /* * This allows printing both to /proc/sched_debug and * to the console */#define SEQ_printf(m, x...)			\ do {						\	if (m)					\		seq_printf(m, x);		\	else					\		printk(x);			\ } while (0) /* * Ease the printing of nsec fields: */static long long nsec_high(unsigned long long nsec){	if ((long long)nsec < 0) {		nsec = -nsec;		do_div(nsec, 1000000);		return -nsec;	}	do_div(nsec, 1000000); 	return nsec;} static unsigned long nsec_low(unsigned long long nsec){	if ((long long)nsec < 0)		nsec = -nsec; 	return do_div(nsec, 1000000);} #define SPLIT_NS(x) nsec_high(x), nsec_low(x) #ifdef CONFIG_FAIR_GROUP_SCHEDstatic void print_cfs_group_stats(struct seq_file *m, int cpu, struct task_group *tg){	struct sched_entity *se = tg->se[cpu]; #define P(F) \	SEQ_printf(m, "  .%-30s: %lld\n", #F, (long long)F)#define PN(F) \	SEQ_printf(m, "  .%-30s: %lld.%06ld\n", #F, SPLIT_NS((long long)F)) 	if (!se) {		struct sched_avg *avg = &cpu_rq(cpu)->avg;		P(avg->runnable_avg_sum);		P(avg->runnable_avg_period);		return;	}  	PN(se->exec_start);	PN(se->vruntime);	PN(se->sum_exec_runtime);#ifdef CONFIG_SCHEDSTATS	PN(se->statistics.wait_start);	PN(se->statistics.sleep_start);	PN(se->statistics.block_start);	PN(se->statistics.sleep_max);	PN(se->statistics.block_max);	PN(se->statistics.exec_max);	PN(se->statistics.slice_max);	PN(se->statistics.wait_max);	PN(se->statistics.wait_sum);	P(se->statistics.wait_count);#endif	P(se->load.weight);#ifdef CONFIG_SMP	P(se->avg.runnable_avg_sum);	P(se->avg.runnable_avg_period);	P(se->avg.load_avg_contrib);	P(se->avg.decay_count);#endif#undef PN#undef P}#endif #ifdef CONFIG_CGROUP_SCHEDstatic char group_path[PATH_MAX]; static char *task_group_path(struct task_group *tg){	if (autogroup_path(tg, group_path, PATH_MAX))		return group_path; 	return cgroup_path(tg->css.cgroup, group_path, PATH_MAX);}#endif static voidprint_task(struct seq_file *m, struct rq *rq, struct task_struct *p){	if (rq->curr == p)		SEQ_printf(m, "R");	else		SEQ_printf(m, " "); 	SEQ_printf(m, "%15s %5d %9Ld.%06ld %9Ld %5d ",		p->comm, task_pid_nr(p),		SPLIT_NS(p->se.vruntime),		(long long)(p->nvcsw + p->nivcsw),		p->prio);#ifdef CONFIG_SCHEDSTATS	SEQ_printf(m, "%9Ld.%06ld %9Ld.%06ld %9Ld.%06ld",		SPLIT_NS(p->se.vruntime),		SPLIT_NS(p->se.sum_exec_runtime),		SPLIT_NS(p->se.statistics.sum_sleep_runtime));#else	SEQ_printf(m, "%15Ld %15Ld %15Ld.%06ld %15Ld.%06ld %15Ld.%06ld",		0LL, 0LL, 0LL, 0L, 0LL, 0L, 0LL, 0L);#endif#ifdef CONFIG_NUMA_BALANCING	SEQ_printf(m, " %d", task_node(p));#endif#ifdef CONFIG_CGROUP_SCHED	SEQ_printf(m, " %s", task_group_path(task_group(p)));#endif 	SEQ_printf(m, "\n");} static void print_rq(struct seq_file *m, struct rq *rq, int rq_cpu){	struct task_struct *g, *p; 	SEQ_printf(m,	"\nrunnable tasks:\n"	"            task   PID         tree-key  switches  prio"	"     exec-runtime         sum-exec        sum-sleep\n"	"------------------------------------------------------"	"----------------------------------------------------\n"); 	rcu_read_lock();	for_each_process_thread(g, p) {		if (task_cpu(p) != rq_cpu)			continue; 		print_task(m, rq, p);	}	rcu_read_unlock();} void print_cfs_rq(struct seq_file *m, int cpu, struct cfs_rq *cfs_rq){	s64 MIN_vruntime = -1, min_vruntime, max_vruntime = -1,		spread, rq0_min_vruntime, spread0;	struct rq *rq = cpu_rq(cpu);	struct sched_entity *last;	unsigned long flags; #ifdef CONFIG_FAIR_GROUP_SCHED	SEQ_printf(m, "\ncfs_rq[%d]:%s\n", cpu, task_group_path(cfs_rq->tg));#else	SEQ_printf(m, "\ncfs_rq[%d]:\n", cpu);#endif	SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", "exec_clock",			SPLIT_NS(cfs_rq->exec_clock)); 	raw_spin_lock_irqsave(&rq->lock, flags);	if (cfs_rq->rb_leftmost)		MIN_vruntime = (__pick_first_entity(cfs_rq))->vruntime;	last = __pick_last_entity(cfs_rq);	if (last)		max_vruntime = last->vruntime;	min_vruntime = cfs_rq->min_vruntime;	rq0_min_vruntime = cpu_rq(0)->cfs.min_vruntime;	raw_spin_unlock_irqrestore(&rq->lock, flags);	SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", "MIN_vruntime",			SPLIT_NS(MIN_vruntime));	SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", "min_vruntime",			SPLIT_NS(min_vruntime));	SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", "max_vruntime",			SPLIT_NS(max_vruntime));	spread = max_vruntime - MIN_vruntime;	SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", "spread",			SPLIT_NS(spread));	spread0 = min_vruntime - rq0_min_vruntime;	SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", "spread0",			SPLIT_NS(spread0));	SEQ_printf(m, "  .%-30s: %d\n", "nr_spread_over",			cfs_rq->nr_spread_over);	SEQ_printf(m, "  .%-30s: %d\n", "nr_running", cfs_rq->nr_running);	SEQ_printf(m, "  .%-30s: %ld\n", "load", cfs_rq->load.weight);#ifdef CONFIG_SMP	SEQ_printf(m, "  .%-30s: %ld\n", "runnable_load_avg",			cfs_rq->runnable_load_avg);	SEQ_printf(m, "  .%-30s: %ld\n", "blocked_load_avg",			cfs_rq->blocked_load_avg);#ifdef CONFIG_FAIR_GROUP_SCHED	SEQ_printf(m, "  .%-30s: %ld\n", "tg_load_contrib",			cfs_rq->tg_load_contrib);	SEQ_printf(m, "  .%-30s: %d\n", "tg_runnable_contrib",			cfs_rq->tg_runnable_contrib);	SEQ_printf(m, "  .%-30s: %ld\n", "tg_load_avg",			atomic_long_read(&cfs_rq->tg->load_avg));	SEQ_printf(m, "  .%-30s: %d\n", "tg->runnable_avg",			atomic_read(&cfs_rq->tg->runnable_avg));#endif#endif#ifdef CONFIG_CFS_BANDWIDTH	SEQ_printf(m, "  .%-30s: %d\n", "tg->cfs_bandwidth.timer_active",			cfs_rq->tg->cfs_bandwidth.timer_active);	SEQ_printf(m, "  .%-30s: %d\n", "throttled",			cfs_rq->throttled);	SEQ_printf(m, "  .%-30s: %d\n", "throttle_count",			cfs_rq->throttle_count);#endif #ifdef CONFIG_FAIR_GROUP_SCHED	print_cfs_group_stats(m, cpu, cfs_rq->tg);#endif} void print_rt_rq(struct seq_file *m, int cpu, struct rt_rq *rt_rq){#ifdef CONFIG_RT_GROUP_SCHED	SEQ_printf(m, "\nrt_rq[%d]:%s\n", cpu, task_group_path(rt_rq->tg));#else	SEQ_printf(m, "\nrt_rq[%d]:\n", cpu);#endif #define P(x) \	SEQ_printf(m, "  .%-30s: %Ld\n", #x, (long long)(rt_rq->x))#define PN(x) \	SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rt_rq->x)) 	P(rt_nr_running);	P(rt_throttled);	PN(rt_time);	PN(rt_runtime); #undef PN#undef P} extern __read_mostly int sched_clock_running; static void print_cpu(struct seq_file *m, int cpu){	struct rq *rq = cpu_rq(cpu);	unsigned long flags; #ifdef CONFIG_X86	{		unsigned int freq = cpu_khz ? : 1; 		SEQ_printf(m, "cpu#%d, %u.%03u MHz\n",			   cpu, freq / 1000, (freq % 1000));	}#else	SEQ_printf(m, "cpu#%d\n", cpu);#endif #define P(x)								\do {									\	if (sizeof(rq->x) == 4)						\		SEQ_printf(m, "  .%-30s: %ld\n", #x, (long)(rq->x));	\	else								\		SEQ_printf(m, "  .%-30s: %Ld\n", #x, (long long)(rq->x));\} while (0) #define PN(x) \	SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rq->x)) 	P(nr_running);	SEQ_printf(m, "  .%-30s: %lu\n", "load",		   rq->load.weight);	P(nr_switches);	P(nr_load_updates);	P(nr_uninterruptible);	PN(next_balance);	SEQ_printf(m, "  .%-30s: %ld\n", "curr->pid", (long)(task_pid_nr(rq->curr)));	PN(clock);	P(cpu_load[0]);	P(cpu_load[1]);	P(cpu_load[2]);	P(cpu_load[3]);	P(cpu_load[4]);#undef P#undef PN #ifdef CONFIG_SCHEDSTATS#define P(n) SEQ_printf(m, "  .%-30s: %d\n", #n, rq->n);#define P64(n) SEQ_printf(m, "  .%-30s: %Ld\n", #n, rq->n); 	P(yld_count); 	P(sched_count);	P(sched_goidle);#ifdef CONFIG_SMP	P64(avg_idle);	P64(max_idle_balance_cost);#endif 	P(ttwu_count);	P(ttwu_local); #undef P#undef P64#endif	spin_lock_irqsave(&sched_debug_lock, flags);	print_cfs_stats(m, cpu);	print_rt_stats(m, cpu); 	print_rq(m, rq, cpu);	spin_unlock_irqrestore(&sched_debug_lock, flags);	SEQ_printf(m, "\n");} static const char *sched_tunable_scaling_names[] = {	"none",	"logaritmic",	"linear"}; static void sched_debug_header(struct seq_file *m){	u64 ktime, sched_clk, cpu_clk;	unsigned long flags; 	local_irq_save(flags);	ktime = ktime_to_ns(ktime_get());	sched_clk = sched_clock();	cpu_clk = local_clock();	local_irq_restore(flags); 	SEQ_printf(m, "Sched Debug Version: v0.11, %s %.*s\n",		init_utsname()->release,		(int)strcspn(init_utsname()->version, " "),		init_utsname()->version); #define P(x) \	SEQ_printf(m, "%-40s: %Ld\n", #x, (long long)(x))#define PN(x) \	SEQ_printf(m, "%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))	PN(ktime);	PN(sched_clk);	PN(cpu_clk);	P(jiffies);#ifdef CONFIG_HAVE_UNSTABLE_SCHED_CLOCK	P(sched_clock_stable());#endif#undef PN#undef P 	SEQ_printf(m, "\n");	SEQ_printf(m, "sysctl_sched\n"); #define P(x) \	SEQ_printf(m, "  .%-40s: %Ld\n", #x, (long long)(x))#define PN(x) \	SEQ_printf(m, "  .%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))	PN(sysctl_sched_latency);	PN(sysctl_sched_min_granularity);	PN(sysctl_sched_wakeup_granularity);	P(sysctl_sched_child_runs_first);	P(sysctl_sched_features);#undef PN#undef P 	SEQ_printf(m, "  .%-40s: %d (%s)\n",		"sysctl_sched_tunable_scaling",		sysctl_sched_tunable_scaling,		sched_tunable_scaling_names[sysctl_sched_tunable_scaling]);	SEQ_printf(m, "\n");} static int sched_debug_show(struct seq_file *m, void *v){	int cpu = (unsigned long)(v - 2); 	if (cpu != -1)		print_cpu(m, cpu);	else		sched_debug_header(m); 	return 0;} void sysrq_sched_debug_show(void){	int cpu; 	sched_debug_header(NULL);	for_each_online_cpu(cpu)		print_cpu(NULL, cpu); } /* * This itererator needs some explanation. * It returns 1 for the header position. * This means 2 is cpu 0. * In a hotplugged system some cpus, including cpu 0, may be missing so we have * to use cpumask_* to iterate over the cpus. */static void *sched_debug_start(struct seq_file *file, loff_t *offset){	unsigned long n = *offset; 	if (n == 0)		return (void *) 1; 	n--; 	if (n > 0)		n = cpumask_next(n - 1, cpu_online_mask);	else		n = cpumask_first(cpu_online_mask); 	*offset = n + 1; 	if (n < nr_cpu_ids)		return (void *)(unsigned long)(n + 2);	return NULL;} static void *sched_debug_next(struct seq_file *file, void *data, loff_t *offset){	(*offset)++;	return sched_debug_start(file, offset);} static void sched_debug_stop(struct seq_file *file, void *data){} static const struct seq_operations sched_debug_sops = {	.start = sched_debug_start,	.next = sched_debug_next,	.stop = sched_debug_stop,	.show = sched_debug_show,}; static int sched_debug_release(struct inode *inode, struct file *file){	seq_release(inode, file); 	return 0;} static int sched_debug_open(struct inode *inode, struct file *filp){	int ret = 0; 	ret = seq_open(filp, &sched_debug_sops); 	return ret;} static const struct file_operations sched_debug_fops = {	.open		= sched_debug_open,	.read		= seq_read,	.llseek		= seq_lseek,	.release	= sched_debug_release,}; static int __init init_sched_debug_procfs(void){	struct proc_dir_entry *pe; 	pe = proc_create("sched_debug", 0444, NULL, &sched_debug_fops);	if (!pe)		return -ENOMEM;	return 0;} __initcall(init_sched_debug_procfs); #define __P(F) \	SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)F)#define P(F) \

Lines 1–500 of 660. Load more