[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)
{
	/*
	 * 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->se.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_next_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);

	P(bkl_count);

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