[linux-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>

/*
 * 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->wait_start);
	PN(se->sleep_start);
	PN(se->block_start);
	PN(se->sleep_max);
	PN(se->block_max);
	PN(se->exec_max);
	PN(se->slice_max);
	PN(se->wait_max);
	PN(se->wait_sum);
	P(se->wait_count);
#endif
	P(se->load.weight);
#undef PN
#undef P
}
#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.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
	{
		char path[64];

		cgroup_path(task_group(p)->css.cgroup, path, sizeof(path));
		SEQ_printf(m, " %s", path);
	}
#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);
}

#if defined(CONFIG_CGROUP_SCHED) && \
	(defined(CONFIG_FAIR_GROUP_SCHED) || defined(CONFIG_RT_GROUP_SCHED))
static void task_group_path(struct task_group *tg, char *buf, int buflen)
{
	/* may be NULL if the underlying cgroup isn't fully-created yet */
	if (!tg->css.cgroup) {
		buf[0] = '\0';
		return;
	}
	cgroup_path(tg->css.cgroup, buf, buflen);
}
#endif

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 = &per_cpu(runqueues, cpu);
	struct sched_entity *last;
	unsigned long flags;

#if defined(CONFIG_CGROUP_SCHED) && defined(CONFIG_FAIR_GROUP_SCHED)
	char path[128];
	struct task_group *tg = cfs_rq->tg;

	task_group_path(tg, path, sizeof(path));

	SEQ_printf(m, "\ncfs_rq[%d]:%s\n", cpu, path);
#elif defined(CONFIG_USER_SCHED) && defined(CONFIG_FAIR_GROUP_SCHED)
	{
		uid_t uid = cfs_rq->tg->uid;
		SEQ_printf(m, "\ncfs_rq[%d] for UID: %u\n", cpu, uid);
	}
#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));

	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 = per_cpu(runqueues, 0).cfs.min_vruntime;
	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: %ld\n", "nr_running", cfs_rq->nr_running);
	SEQ_printf(m, "  .%-30s: %ld\n", "load", cfs_rq->load.weight);

	SEQ_printf(m, "  .%-30s: %d\n", "nr_spread_over",
			cfs_rq->nr_spread_over);
#ifdef CONFIG_FAIR_GROUP_SCHED
#ifdef CONFIG_SMP
	SEQ_printf(m, "  .%-30s: %lu\n", "shares", cfs_rq->shares);
#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)
{
#if defined(CONFIG_CGROUP_SCHED) && defined(CONFIG_RT_GROUP_SCHED)
	char path[128];
	struct task_group *tg = rt_rq->tg;

	task_group_path(tg, path, sizeof(path));

	SEQ_printf(m, "\nrt_rq[%d]:%s\n", cpu, path);
#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
}

static void print_cpu(struct seq_file *m, int cpu)
{
	struct rq *rq = &per_cpu(runqueues, cpu);

#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);
	SEQ_printf(m, "  .%-30s: %lu\n", "jiffies", jiffies);
	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);

	P(yld_exp_empty);
	P(yld_act_empty);
	P(yld_both_empty);
	P(yld_count);

	P(sched_switch);
	P(sched_count);
	P(sched_goidle);

	P(ttwu_count);
	P(ttwu_local);

	P(bkl_count);

#undef P
#endif
	print_cfs_stats(m, cpu);
	print_rt_stats(m, cpu);

	print_rq(m, rq, cpu);
}

static int sched_debug_show(struct seq_file *m, void *v)
{
	u64 now = ktime_to_ns(ktime_get());
	int cpu;

	SEQ_printf(m, "Sched Debug Version: v0.08, %s %.*s\n",
		init_utsname()->release,
		(int)strcspn(init_utsname()->version, " "),
		init_utsname()->version);

	SEQ_printf(m, "now at %Lu.%06ld msecs\n", SPLIT_NS(now));

#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);
	PN(sysctl_sched_child_runs_first);
	P(sysctl_sched_features);
#undef PN
#undef P

	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;
	unsigned long flags;
	int num_threads = 1;

	if (lock_task_sighand(p, &flags)) {
		num_threads = atomic_read(&p->signal->count);
		unlock_task_sighand(p, &flags);
	}

	SEQ_printf(m, "%s (%d, #threads: %d)\n", p->comm, p->pid, num_threads);
	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);
	PN(se.avg_overlap);
	PN(se.avg_wakeup);

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

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