[linux-2.6-block.git] / kernel / sched_debug.c

/*
 * kernel/time/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>

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_SCHED
static void print_cfs_group_stats(struct seq_file *m, int cpu, struct task_group *tg)
{
	struct sched_entity *se = tg->se[cpu];
	if (!se)
		return;

#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))

	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);
#undef PN
#undef P
}
#endif

#ifdef CONFIG_CGROUP_SCHED
static 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;

	/*
	 * May be NULL if the underlying cgroup isn't fully-created yet
	 */
	if (!tg->css.cgroup) {
		group_path[0] = '\0';
		return group_path;
	}
	cgroup_path(tg->css.cgroup, group_path, PATH_MAX);
	return group_path;
}
#endif

static void
print_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, p->pid,
		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_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;
	unsigned long flags;

	SEQ_printf(m,
	"\nrunnable tasks:\n"
	"            task   PID         tree-key  switches  prio"
	"     exec-runtime         sum-exec        sum-sleep\n"
	"------------------------------------------------------"
	"----------------------------------------------------\n");

	read_lock_irqsave(&tasklist_lock, flags);

	do_each_thread(g, p) {
		if (!p->on_rq || task_cpu(p) != rq_cpu)
			continue;

		print_task(m, rq, p);
	} while_each_thread(g, p);

	read_unlock_irqrestore(&tasklist_lock, flags);
}

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: %ld\n", "nr_running", cfs_rq->nr_running);
	SEQ_printf(m, "  .%-30s: %ld\n", "load", cfs_rq->load.weight);
#ifdef CONFIG_FAIR_GROUP_SCHED
#ifdef CONFIG_SMP
	SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", "load_avg",
			SPLIT_NS(cfs_rq->load_avg));
	SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", "load_period",
			SPLIT_NS(cfs_rq->load_period));
	SEQ_printf(m, "  .%-30s: %ld\n", "load_contrib",
			cfs_rq->load_contribution);
	SEQ_printf(m, "  .%-30s: %d\n", "load_tg",
			atomic_read(&cfs_rq->tg->load_weight));
#endif

	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, "\ncpu#%d, %u.%03u MHz\n",
			   cpu, freq / 1000, (freq % 1000));
	}
#else
	SEQ_printf(m, "\ncpu#%d\n", cpu);
#endif

#define P(x) \
	SEQ_printf(m, "  .%-30s: %Ld\n", #x, (long long)(rq->x))
#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);
	P(curr->pid);
	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_switch);
	P(sched_count);
	P(sched_goidle);
#ifdef CONFIG_SMP
	P64(avg_idle);
#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);

	rcu_read_lock();
	print_rq(m, rq, cpu);
	rcu_read_unlock();
	spin_unlock_irqrestore(&sched_debug_lock, flags);
}

static const char *sched_tunable_scaling_names[] = {
	"none",
	"logaritmic",
	"linear"
};

static int sched_debug_show(struct seq_file *m, void *v)
{
	u64 ktime, sched_clk, cpu_clk;
	unsigned long flags;
	int cpu;

	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.10, %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]);

	for_each_online_cpu(cpu)
		print_cpu(m, cpu);

	SEQ_printf(m, "\n");

	return 0;
}

static void sysrq_sched_debug_show(void)
{
	sched_debug_show(NULL, NULL);
}

static int sched_debug_open(struct inode *inode, struct file *filp)
{
	return single_open(filp, sched_debug_show, NULL);
}

static const struct file_operations sched_debug_fops = {
	.open		= sched_debug_open,
	.read		= seq_read,
	.llseek		= seq_lseek,
	.release	= single_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);

void proc_sched_show_task(struct task_struct *p, struct seq_file *m)
{
	unsigned long nr_switches;

	SEQ_printf(m, "%s (%d, #threads: %d)\n", p->comm, p->pid,
						get_nr_threads(p));
	SEQ_printf(m,
		"---------------------------------------------------------\n");
#define __P(F) \
	SEQ_printf(m, "%-35s:%21Ld\n", #F, (long long)F)
#define P(F) \
	SEQ_printf(m, "%-35s:%21Ld\n", #F, (long long)p->F)
#define __PN(F) \
	SEQ_printf(m, "%-35s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)F))
#define PN(F) \
	SEQ_printf(m, "%-35s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)p->F))

	PN(se.exec_start);
	PN(se.vruntime);
	PN(se.sum_exec_runtime);

	nr_switches = p->nvcsw + p->nivcsw;

#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);
	PN(se.statistics.iowait_sum);
	P(se.statistics.iowait_count);
	P(se.nr_migrations);
	P(se.statistics.nr_migrations_cold);
	P(se.statistics.nr_failed_migrations_affine);
	P(se.statistics.nr_failed_migrations_running);
	P(se.statistics.nr_failed_migrations_hot);
	P(se.statistics.nr_forced_migrations);
	P(se.statistics.nr_wakeups);
	P(se.statistics.nr_wakeups_sync);
	P(se.statistics.nr_wakeups_migrate);
	P(se.statistics.nr_wakeups_local);
	P(se.statistics.nr_wakeups_remote);
	P(se.statistics.nr_wakeups_affine);
	P(se.statistics.nr_wakeups_affine_attempts);
	P(se.statistics.nr_wakeups_passive);
	P(se.statistics.nr_wakeups_idle);

	{
		u64 avg_atom, avg_per_cpu;

		avg_atom = p->se.sum_exec_runtime;
		if (nr_switches)
			do_div(avg_atom, nr_switches);
		else
			avg_atom = -1LL;

		avg_per_cpu = p->se.sum_exec_runtime;
		if (p->se.nr_migrations) {
			avg_per_cpu = div64_u64(avg_per_cpu,
						p->se.nr_migrations);
		} else {
			avg_per_cpu = -1LL;
		}

		__PN(avg_atom);
		__PN(avg_per_cpu);
	}
#endif
	__P(nr_switches);
	SEQ_printf(m, "%-35s:%21Ld\n",
		   "nr_voluntary_switches", (long long)p->nvcsw);
	SEQ_printf(m, "%-35s:%21Ld\n",
		   "nr_involuntary_switches", (long long)p->nivcsw);

	P(se.load.weight);
	P(policy);
	P(prio);
#undef PN
#undef __PN
#undef P
#undef __P

	{
		unsigned int this_cpu = raw_smp_processor_id();
		u64 t0, t1;

		t0 = cpu_clock(this_cpu);
		t1 = cpu_clock(this_cpu);
		SEQ_printf(m, "%-35s:%21Ld\n",
			   "clock-delta", (long long)(t1-t0));
	}
}

void proc_sched_set_task(struct task_struct *p)
{
#ifdef CONFIG_SCHEDSTATS
	memset(&p->se.statistics, 0, sizeof(p->se.statistics));
#endif
}
Commit	Line	Data
43ae34cb IM	1	/*
	2	* kernel/time/sched_debug.c
	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>
	18
efe25c2c BR	19	static DEFINE_SPINLOCK(sched_debug_lock);
efe25c2c BR	20
43ae34cb IM	21	/*
	22	* This allows printing both to /proc/sched_debug and
	23	* to the console
	24	*/
	25	#define SEQ_printf(m, x...) \
	26	do { \
	27	if (m) \
	28	seq_printf(m, x); \
	29	else \
	30	printk(x); \
	31	} while (0)
	32
ef83a571 IM	33	/*
	34	* Ease the printing of nsec fields:
	35	*/
90b2628f	36	static long long nsec_high(unsigned long long nsec)
ef83a571	37	{
90b2628f	38	if ((long long)nsec < 0) {
ef83a571 IM	39	nsec = -nsec;
	40	do_div(nsec, 1000000);
	41	return -nsec;
	42	}
	43	do_div(nsec, 1000000);
	44
	45	return nsec;
	46	}
	47
90b2628f	48	static unsigned long nsec_low(unsigned long long nsec)
ef83a571	49	{
90b2628f	50	if ((long long)nsec < 0)
ef83a571 IM	51	nsec = -nsec;
	52
	53	return do_div(nsec, 1000000);
	54	}
	55
	56	#define SPLIT_NS(x) nsec_high(x), nsec_low(x)
	57
ff9b48c3	58	#ifdef CONFIG_FAIR_GROUP_SCHED
5091faa4	59	static void print_cfs_group_stats(struct seq_file m, int cpu, struct task_group tg)
ff9b48c3 BR	60	{
	61	struct sched_entity *se = tg->se[cpu];
	62	if (!se)
	63	return;
	64
	65	#define P(F) \
	66	SEQ_printf(m, " .%-30s: %lld\n", #F, (long long)F)
	67	#define PN(F) \
	68	SEQ_printf(m, " .%-30s: %lld.%06ld\n", #F, SPLIT_NS((long long)F))
	69
	70	PN(se->exec_start);
	71	PN(se->vruntime);
	72	PN(se->sum_exec_runtime);
	73	#ifdef CONFIG_SCHEDSTATS
41acab88 LDM	74	PN(se->statistics.wait_start);
	75	PN(se->statistics.sleep_start);
	76	PN(se->statistics.block_start);
	77	PN(se->statistics.sleep_max);
	78	PN(se->statistics.block_max);
	79	PN(se->statistics.exec_max);
	80	PN(se->statistics.slice_max);
	81	PN(se->statistics.wait_max);
	82	PN(se->statistics.wait_sum);
	83	P(se->statistics.wait_count);
ff9b48c3 BR	84	#endif
	85	P(se->load.weight);
	86	#undef PN
	87	#undef P
	88	}
	89	#endif
	90
efe25c2c BR	91	#ifdef CONFIG_CGROUP_SCHED
	92	static char group_path[PATH_MAX];
	93
	94	static char task_group_path(struct task_group tg)
	95	{
8ecedd7a BR	96	if (autogroup_path(tg, group_path, PATH_MAX))
	97	return group_path;
	98
efe25c2c BR	99	/*
	100	* May be NULL if the underlying cgroup isn't fully-created yet
	101	*/
	102	if (!tg->css.cgroup) {
	103	group_path[0] = '\0';
	104	return group_path;
	105	}
	106	cgroup_path(tg->css.cgroup, group_path, PATH_MAX);
	107	return group_path;
	108	}
	109	#endif
	110
43ae34cb	111	static void
a48da48b	112	print_task(struct seq_file m, struct rq rq, struct task_struct *p)
43ae34cb IM	113	{
	114	if (rq->curr == p)
	115	SEQ_printf(m, "R");
	116	else
	117	SEQ_printf(m, " ");
	118
ef83a571	119	SEQ_printf(m, "%15s %5d %9Ld.%06ld %9Ld %5d ",
43ae34cb	120	p->comm, p->pid,
ef83a571	121	SPLIT_NS(p->se.vruntime),
43ae34cb	122	(long long)(p->nvcsw + p->nivcsw),
6f605d83	123	p->prio);
6cfb0d5d	124	#ifdef CONFIG_SCHEDSTATS
d19ca308	125	SEQ_printf(m, "%9Ld.%06ld %9Ld.%06ld %9Ld.%06ld",
ef83a571 IM	126	SPLIT_NS(p->se.vruntime),
ef83a571 IM	127	SPLIT_NS(p->se.sum_exec_runtime),
41acab88	128	SPLIT_NS(p->se.statistics.sum_sleep_runtime));
6cfb0d5d	129	#else
d19ca308	130	SEQ_printf(m, "%15Ld %15Ld %15Ld.%06ld %15Ld.%06ld %15Ld.%06ld",
ef83a571	131	0LL, 0LL, 0LL, 0L, 0LL, 0L, 0LL, 0L);
6cfb0d5d	132	#endif
efe25c2c BR	133	#ifdef CONFIG_CGROUP_SCHED
	134	SEQ_printf(m, " %s", task_group_path(task_group(p)));
	135	#endif
d19ca308	136
d19ca308	137	SEQ_printf(m, "\n");
43ae34cb IM	138	}
43ae34cb IM	139
a48da48b	140	static void print_rq(struct seq_file m, struct rq rq, int rq_cpu)
43ae34cb IM	141	{
43ae34cb IM	142	struct task_struct g, p;
ab63a633	143	unsigned long flags;
43ae34cb IM	144
	145	SEQ_printf(m,
	146	"\nrunnable tasks:\n"
c86da3a3 MG	147	" task PID tree-key switches prio"
c86da3a3 MG	148	" exec-runtime sum-exec sum-sleep\n"
1a75b94f	149	"------------------------------------------------------"
c86da3a3	150	"----------------------------------------------------\n");
43ae34cb	151
ab63a633	152	read_lock_irqsave(&tasklist_lock, flags);
43ae34cb IM	153
43ae34cb IM	154	do_each_thread(g, p) {
fd2f4419	155	if (!p->on_rq \|\| task_cpu(p) != rq_cpu)
43ae34cb IM	156	continue;
43ae34cb IM	157
a48da48b	158	print_task(m, rq, p);
43ae34cb IM	159	} while_each_thread(g, p);
43ae34cb IM	160
ab63a633	161	read_unlock_irqrestore(&tasklist_lock, flags);
43ae34cb IM	162	}
43ae34cb IM	163
5cef9eca	164	void print_cfs_rq(struct seq_file m, int cpu, struct cfs_rq cfs_rq)
43ae34cb	165	{
86d9560c IM	166	s64 MIN_vruntime = -1, min_vruntime, max_vruntime = -1,
86d9560c IM	167	spread, rq0_min_vruntime, spread0;
348ec61e	168	struct rq *rq = cpu_rq(cpu);
67e12eac IM	169	struct sched_entity *last;
	170	unsigned long flags;
	171
efe25c2c BR	172	#ifdef CONFIG_FAIR_GROUP_SCHED
	173	SEQ_printf(m, "\ncfs_rq[%d]:%s\n", cpu, task_group_path(cfs_rq->tg));
	174	#else
ada18de2	175	SEQ_printf(m, "\ncfs_rq[%d]:\n", cpu);
efe25c2c	176	#endif
ef83a571 IM	177	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "exec_clock",
ef83a571 IM	178	SPLIT_NS(cfs_rq->exec_clock));
67e12eac	179
05fa785c	180	raw_spin_lock_irqsave(&rq->lock, flags);
67e12eac	181	if (cfs_rq->rb_leftmost)
ac53db59	182	MIN_vruntime = (__pick_first_entity(cfs_rq))->vruntime;
67e12eac IM	183	last = __pick_last_entity(cfs_rq);
	184	if (last)
	185	max_vruntime = last->vruntime;
5ac5c4d6	186	min_vruntime = cfs_rq->min_vruntime;
348ec61e	187	rq0_min_vruntime = cpu_rq(0)->cfs.min_vruntime;
05fa785c	188	raw_spin_unlock_irqrestore(&rq->lock, flags);
ef83a571 IM	189	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "MIN_vruntime",
	190	SPLIT_NS(MIN_vruntime));
	191	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "min_vruntime",
	192	SPLIT_NS(min_vruntime));
	193	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "max_vruntime",
	194	SPLIT_NS(max_vruntime));
67e12eac	195	spread = max_vruntime - MIN_vruntime;
ef83a571 IM	196	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread",
ef83a571 IM	197	SPLIT_NS(spread));
86d9560c	198	spread0 = min_vruntime - rq0_min_vruntime;
ef83a571 IM	199	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread0",
ef83a571 IM	200	SPLIT_NS(spread0));
5ac5c4d6	201	SEQ_printf(m, " .%-30s: %d\n", "nr_spread_over",
ddc97297	202	cfs_rq->nr_spread_over);
2069dd75 PZ	203	SEQ_printf(m, " .%-30s: %ld\n", "nr_running", cfs_rq->nr_running);
2069dd75 PZ	204	SEQ_printf(m, " .%-30s: %ld\n", "load", cfs_rq->load.weight);
c09595f6 PZ	205	#ifdef CONFIG_FAIR_GROUP_SCHED
c09595f6 PZ	206	#ifdef CONFIG_SMP
2069dd75 PZ	207	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "load_avg",
	208	SPLIT_NS(cfs_rq->load_avg));
	209	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "load_period",
	210	SPLIT_NS(cfs_rq->load_period));
	211	SEQ_printf(m, " .%-30s: %ld\n", "load_contrib",
	212	cfs_rq->load_contribution);
	213	SEQ_printf(m, " .%-30s: %d\n", "load_tg",
5091faa4	214	atomic_read(&cfs_rq->tg->load_weight));
c09595f6	215	#endif
2069dd75	216
ff9b48c3	217	print_cfs_group_stats(m, cpu, cfs_rq->tg);
c09595f6	218	#endif
43ae34cb IM	219	}
43ae34cb IM	220
ada18de2 PZ	221	void print_rt_rq(struct seq_file m, int cpu, struct rt_rq rt_rq)
ada18de2 PZ	222	{
efe25c2c BR	223	#ifdef CONFIG_RT_GROUP_SCHED
	224	SEQ_printf(m, "\nrt_rq[%d]:%s\n", cpu, task_group_path(rt_rq->tg));
	225	#else
ada18de2	226	SEQ_printf(m, "\nrt_rq[%d]:\n", cpu);
efe25c2c	227	#endif
ada18de2 PZ	228
	229	#define P(x) \
	230	SEQ_printf(m, " .%-30s: %Ld\n", #x, (long long)(rt_rq->x))
	231	#define PN(x) \
	232	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rt_rq->x))
	233
	234	P(rt_nr_running);
	235	P(rt_throttled);
	236	PN(rt_time);
	237	PN(rt_runtime);
	238
	239	#undef PN
	240	#undef P
	241	}
	242
5bb6b1ea PZ	243	extern __read_mostly int sched_clock_running;
5bb6b1ea PZ	244
a48da48b	245	static void print_cpu(struct seq_file *m, int cpu)
43ae34cb	246	{
348ec61e	247	struct rq *rq = cpu_rq(cpu);
efe25c2c	248	unsigned long flags;
43ae34cb IM	249
	250	#ifdef CONFIG_X86
	251	{
	252	unsigned int freq = cpu_khz ? : 1;
	253
	254	SEQ_printf(m, "\ncpu#%d, %u.%03u MHz\n",
	255	cpu, freq / 1000, (freq % 1000));
	256	}
	257	#else
	258	SEQ_printf(m, "\ncpu#%d\n", cpu);
	259	#endif
	260
	261	#define P(x) \
	262	SEQ_printf(m, " .%-30s: %Ld\n", #x, (long long)(rq->x))
ef83a571 IM	263	#define PN(x) \
ef83a571 IM	264	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rq->x))
43ae34cb IM	265
	266	P(nr_running);
	267	SEQ_printf(m, " .%-30s: %lu\n", "load",
495eca49	268	rq->load.weight);
43ae34cb IM	269	P(nr_switches);
	270	P(nr_load_updates);
	271	P(nr_uninterruptible);
ef83a571	272	PN(next_balance);
43ae34cb	273	P(curr->pid);
ef83a571	274	PN(clock);
43ae34cb IM	275	P(cpu_load[0]);
	276	P(cpu_load[1]);
	277	P(cpu_load[2]);
	278	P(cpu_load[3]);
	279	P(cpu_load[4]);
	280	#undef P
ef83a571	281	#undef PN
43ae34cb	282
5ac5c4d6 PZ	283	#ifdef CONFIG_SCHEDSTATS
5ac5c4d6 PZ	284	#define P(n) SEQ_printf(m, " .%-30s: %d\n", #n, rq->n);
1b9508f6	285	#define P64(n) SEQ_printf(m, " .%-30s: %Ld\n", #n, rq->n);
5ac5c4d6	286
5ac5c4d6 PZ	287	P(yld_count);
	288
	289	P(sched_switch);
	290	P(sched_count);
	291	P(sched_goidle);
1b9508f6 MG	292	#ifdef CONFIG_SMP
	293	P64(avg_idle);
	294	#endif
5ac5c4d6 PZ	295
	296	P(ttwu_count);
	297	P(ttwu_local);
	298
5ac5c4d6	299	#undef P
fce20979	300	#undef P64
5ac5c4d6	301	#endif
efe25c2c	302	spin_lock_irqsave(&sched_debug_lock, flags);
5cef9eca	303	print_cfs_stats(m, cpu);
ada18de2	304	print_rt_stats(m, cpu);
43ae34cb	305
efe25c2c	306	rcu_read_lock();
a48da48b	307	print_rq(m, rq, cpu);
efe25c2c BR	308	rcu_read_unlock();
efe25c2c BR	309	spin_unlock_irqrestore(&sched_debug_lock, flags);
43ae34cb IM	310	}
43ae34cb IM	311
1983a922 CE	312	static const char *sched_tunable_scaling_names[] = {
	313	"none",
	314	"logaritmic",
	315	"linear"
	316	};
	317
43ae34cb IM	318	static int sched_debug_show(struct seq_file m, void v)
43ae34cb IM	319	{
5bb6b1ea PZ	320	u64 ktime, sched_clk, cpu_clk;
5bb6b1ea PZ	321	unsigned long flags;
43ae34cb IM	322	int cpu;
43ae34cb IM	323
5bb6b1ea PZ	324	local_irq_save(flags);
	325	ktime = ktime_to_ns(ktime_get());
	326	sched_clk = sched_clock();
	327	cpu_clk = local_clock();
	328	local_irq_restore(flags);
	329
	330	SEQ_printf(m, "Sched Debug Version: v0.10, %s %.*s\n",
43ae34cb IM	331	init_utsname()->release,
	332	(int)strcspn(init_utsname()->version, " "),
	333	init_utsname()->version);
	334
5bb6b1ea PZ	335	#define P(x) \
	336	SEQ_printf(m, "%-40s: %Ld\n", #x, (long long)(x))
	337	#define PN(x) \
	338	SEQ_printf(m, "%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
	339	PN(ktime);
	340	PN(sched_clk);
	341	PN(cpu_clk);
	342	P(jiffies);
	343	#ifdef CONFIG_HAVE_UNSTABLE_SCHED_CLOCK
	344	P(sched_clock_stable);
	345	#endif
	346	#undef PN
	347	#undef P
	348
	349	SEQ_printf(m, "\n");
	350	SEQ_printf(m, "sysctl_sched\n");
43ae34cb	351
1aa4731e	352	#define P(x) \
d822cece	353	SEQ_printf(m, " .%-40s: %Ld\n", #x, (long long)(x))
1aa4731e	354	#define PN(x) \
d822cece	355	SEQ_printf(m, " .%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
1aa4731e	356	PN(sysctl_sched_latency);
b2be5e96	357	PN(sysctl_sched_min_granularity);
1aa4731e	358	PN(sysctl_sched_wakeup_granularity);
eebef746	359	P(sysctl_sched_child_runs_first);
1aa4731e IM	360	P(sysctl_sched_features);
	361	#undef PN
	362	#undef P
	363
1983a922 CE	364	SEQ_printf(m, " .%-40s: %d (%s)\n", "sysctl_sched_tunable_scaling",
	365	sysctl_sched_tunable_scaling,
	366	sched_tunable_scaling_names[sysctl_sched_tunable_scaling]);
	367
43ae34cb	368	for_each_online_cpu(cpu)
a48da48b	369	print_cpu(m, cpu);
43ae34cb IM	370
	371	SEQ_printf(m, "\n");
	372
	373	return 0;
	374	}
	375
f3373461	376	static void sysrq_sched_debug_show(void)
43ae34cb IM	377	{
	378	sched_debug_show(NULL, NULL);
	379	}
	380
	381	static int sched_debug_open(struct inode inode, struct file filp)
	382	{
	383	return single_open(filp, sched_debug_show, NULL);
	384	}
	385
0dbee3a6	386	static const struct file_operations sched_debug_fops = {
43ae34cb IM	387	.open = sched_debug_open,
	388	.read = seq_read,
	389	.llseek = seq_lseek,
5ea473a1	390	.release = single_release,
43ae34cb IM	391	};
	392
	393	static int __init init_sched_debug_procfs(void)
	394	{
	395	struct proc_dir_entry *pe;
	396
a9cf4ddb	397	pe = proc_create("sched_debug", 0444, NULL, &sched_debug_fops);
43ae34cb IM	398	if (!pe)
43ae34cb IM	399	return -ENOMEM;
43ae34cb IM	400	return 0;
	401	}
	402
	403	__initcall(init_sched_debug_procfs);
	404
	405	void proc_sched_show_task(struct task_struct p, struct seq_file m)
	406	{
cc367732	407	unsigned long nr_switches;
43ae34cb	408
5089a976 ON	409	SEQ_printf(m, "%s (%d, #threads: %d)\n", p->comm, p->pid,
5089a976 ON	410	get_nr_threads(p));
2d92f227 IM	411	SEQ_printf(m,
2d92f227 IM	412	"---------------------------------------------------------\n");
cc367732 IM	413	#define __P(F) \
cc367732 IM	414	SEQ_printf(m, "%-35s:%21Ld\n", #F, (long long)F)
43ae34cb	415	#define P(F) \
2d92f227	416	SEQ_printf(m, "%-35s:%21Ld\n", #F, (long long)p->F)
cc367732 IM	417	#define __PN(F) \
cc367732 IM	418	SEQ_printf(m, "%-35s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)F))
ef83a571	419	#define PN(F) \
2d92f227	420	SEQ_printf(m, "%-35s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)p->F))
43ae34cb	421
ef83a571 IM	422	PN(se.exec_start);
	423	PN(se.vruntime);
	424	PN(se.sum_exec_runtime);
6cfb0d5d	425
cc367732 IM	426	nr_switches = p->nvcsw + p->nivcsw;
cc367732 IM	427
6cfb0d5d	428	#ifdef CONFIG_SCHEDSTATS
41acab88 LDM	429	PN(se.statistics.wait_start);
	430	PN(se.statistics.sleep_start);
	431	PN(se.statistics.block_start);
	432	PN(se.statistics.sleep_max);
	433	PN(se.statistics.block_max);
	434	PN(se.statistics.exec_max);
	435	PN(se.statistics.slice_max);
	436	PN(se.statistics.wait_max);
	437	PN(se.statistics.wait_sum);
	438	P(se.statistics.wait_count);
	439	PN(se.statistics.iowait_sum);
	440	P(se.statistics.iowait_count);
cc367732	441	P(se.nr_migrations);
41acab88 LDM	442	P(se.statistics.nr_migrations_cold);
	443	P(se.statistics.nr_failed_migrations_affine);
	444	P(se.statistics.nr_failed_migrations_running);
	445	P(se.statistics.nr_failed_migrations_hot);
	446	P(se.statistics.nr_forced_migrations);
	447	P(se.statistics.nr_wakeups);
	448	P(se.statistics.nr_wakeups_sync);
	449	P(se.statistics.nr_wakeups_migrate);
	450	P(se.statistics.nr_wakeups_local);
	451	P(se.statistics.nr_wakeups_remote);
	452	P(se.statistics.nr_wakeups_affine);
	453	P(se.statistics.nr_wakeups_affine_attempts);
	454	P(se.statistics.nr_wakeups_passive);
	455	P(se.statistics.nr_wakeups_idle);
cc367732 IM	456
	457	{
	458	u64 avg_atom, avg_per_cpu;
	459
	460	avg_atom = p->se.sum_exec_runtime;
	461	if (nr_switches)
	462	do_div(avg_atom, nr_switches);
	463	else
	464	avg_atom = -1LL;
	465
	466	avg_per_cpu = p->se.sum_exec_runtime;
c1a89740	467	if (p->se.nr_migrations) {
6f6d6a1a RZ	468	avg_per_cpu = div64_u64(avg_per_cpu,
6f6d6a1a RZ	469	p->se.nr_migrations);
c1a89740	470	} else {
cc367732	471	avg_per_cpu = -1LL;
c1a89740	472	}
cc367732 IM	473
	474	__PN(avg_atom);
	475	__PN(avg_per_cpu);
	476	}
6cfb0d5d	477	#endif
cc367732	478	__P(nr_switches);
2d92f227	479	SEQ_printf(m, "%-35s:%21Ld\n",
cc367732 IM	480	"nr_voluntary_switches", (long long)p->nvcsw);
	481	SEQ_printf(m, "%-35s:%21Ld\n",
	482	"nr_involuntary_switches", (long long)p->nivcsw);
	483
43ae34cb IM	484	P(se.load.weight);
	485	P(policy);
	486	P(prio);
ef83a571	487	#undef PN
cc367732 IM	488	#undef __PN
	489	#undef P
	490	#undef __P
43ae34cb IM	491
43ae34cb IM	492	{
29d7b90c	493	unsigned int this_cpu = raw_smp_processor_id();
43ae34cb IM	494	u64 t0, t1;
43ae34cb IM	495
29d7b90c IM	496	t0 = cpu_clock(this_cpu);
29d7b90c IM	497	t1 = cpu_clock(this_cpu);
2d92f227	498	SEQ_printf(m, "%-35s:%21Ld\n",
43ae34cb IM	499	"clock-delta", (long long)(t1-t0));
	500	}
	501	}
	502
	503	void proc_sched_set_task(struct task_struct *p)
	504	{
6cfb0d5d	505	#ifdef CONFIG_SCHEDSTATS
41acab88	506	memset(&p->se.statistics, 0, sizeof(p->se.statistics));
6cfb0d5d	507	#endif
43ae34cb	508	}