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

/*
 * 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)

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);
}

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 cgroup *cgroup = NULL;
	struct task_group *tg = cfs_rq->tg;

	if (tg)
		cgroup = tg->css.cgroup;

	if (cgroup)
		cgroup_path(cgroup, path, sizeof(path));

	SEQ_printf(m, "\ncfs_rq[%d]:%s\n", cpu, path);
#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 = rq->cfs.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);
#ifdef CONFIG_SCHEDSTATS
	SEQ_printf(m, "  .%-30s: %d\n", "bkl_count",
			rq->bkl_count);
#endif
	SEQ_printf(m, "  .%-30s: %ld\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
#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 cgroup *cgroup = NULL;
	struct task_group *tg = rt_rq->tg;

	if (tg)
		cgroup = tg->css.cgroup;

	if (cgroup)
		cgroup_path(cgroup, 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

	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.07, %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", 0644, 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;

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

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

	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

	{
		u64 t0, t1;

		t0 = sched_clock();
		t1 = sched_clock();
		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
43ae34cb	56	static void
a48da48b	57	print_task(struct seq_file m, struct rq rq, struct task_struct *p)
43ae34cb IM	58	{
	59	if (rq->curr == p)
	60	SEQ_printf(m, "R");
	61	else
	62	SEQ_printf(m, " ");
	63
ef83a571	64	SEQ_printf(m, "%15s %5d %9Ld.%06ld %9Ld %5d ",
43ae34cb	65	p->comm, p->pid,
ef83a571	66	SPLIT_NS(p->se.vruntime),
43ae34cb	67	(long long)(p->nvcsw + p->nivcsw),
6f605d83	68	p->prio);
6cfb0d5d	69	#ifdef CONFIG_SCHEDSTATS
d19ca308	70	SEQ_printf(m, "%9Ld.%06ld %9Ld.%06ld %9Ld.%06ld",
ef83a571 IM	71	SPLIT_NS(p->se.vruntime),
	72	SPLIT_NS(p->se.sum_exec_runtime),
	73	SPLIT_NS(p->se.sum_sleep_runtime));
6cfb0d5d	74	#else
d19ca308	75	SEQ_printf(m, "%15Ld %15Ld %15Ld.%06ld %15Ld.%06ld %15Ld.%06ld",
ef83a571	76	0LL, 0LL, 0LL, 0L, 0LL, 0L, 0LL, 0L);
6cfb0d5d	77	#endif
d19ca308 PZ	78
	79	#ifdef CONFIG_CGROUP_SCHED
	80	{
	81	char path[64];
	82
	83	cgroup_path(task_group(p)->css.cgroup, path, sizeof(path));
	84	SEQ_printf(m, " %s", path);
	85	}
	86	#endif
	87	SEQ_printf(m, "\n");
43ae34cb IM	88	}
43ae34cb IM	89
a48da48b	90	static void print_rq(struct seq_file m, struct rq rq, int rq_cpu)
43ae34cb IM	91	{
43ae34cb IM	92	struct task_struct g, p;
ab63a633	93	unsigned long flags;
43ae34cb IM	94
	95	SEQ_printf(m,
	96	"\nrunnable tasks:\n"
c86da3a3 MG	97	" task PID tree-key switches prio"
c86da3a3 MG	98	" exec-runtime sum-exec sum-sleep\n"
1a75b94f	99	"------------------------------------------------------"
c86da3a3	100	"----------------------------------------------------\n");
43ae34cb	101
ab63a633	102	read_lock_irqsave(&tasklist_lock, flags);
43ae34cb IM	103
	104	do_each_thread(g, p) {
	105	if (!p->se.on_rq \|\| task_cpu(p) != rq_cpu)
	106	continue;
	107
a48da48b	108	print_task(m, rq, p);
43ae34cb IM	109	} while_each_thread(g, p);
43ae34cb IM	110
ab63a633	111	read_unlock_irqrestore(&tasklist_lock, flags);
43ae34cb IM	112	}
43ae34cb IM	113
5cef9eca	114	void print_cfs_rq(struct seq_file m, int cpu, struct cfs_rq cfs_rq)
43ae34cb	115	{
86d9560c IM	116	s64 MIN_vruntime = -1, min_vruntime, max_vruntime = -1,
86d9560c IM	117	spread, rq0_min_vruntime, spread0;
67e12eac IM	118	struct rq *rq = &per_cpu(runqueues, cpu);
	119	struct sched_entity *last;
	120	unsigned long flags;
	121
ada18de2	122	#if defined(CONFIG_CGROUP_SCHED) && defined(CONFIG_FAIR_GROUP_SCHED)
d19ca308 PZ	123	char path[128] = "";
	124	struct cgroup *cgroup = NULL;
	125	struct task_group *tg = cfs_rq->tg;
	126
	127	if (tg)
	128	cgroup = tg->css.cgroup;
	129
	130	if (cgroup)
	131	cgroup_path(cgroup, path, sizeof(path));
	132
	133	SEQ_printf(m, "\ncfs_rq[%d]:%s\n", cpu, path);
ada18de2 PZ	134	#else
ada18de2 PZ	135	SEQ_printf(m, "\ncfs_rq[%d]:\n", cpu);
d19ca308	136	#endif
43ae34cb	137
ef83a571 IM	138	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "exec_clock",
ef83a571 IM	139	SPLIT_NS(cfs_rq->exec_clock));
67e12eac IM	140
	141	spin_lock_irqsave(&rq->lock, flags);
	142	if (cfs_rq->rb_leftmost)
	143	MIN_vruntime = (__pick_next_entity(cfs_rq))->vruntime;
	144	last = __pick_last_entity(cfs_rq);
	145	if (last)
	146	max_vruntime = last->vruntime;
86d9560c IM	147	min_vruntime = rq->cfs.min_vruntime;
86d9560c IM	148	rq0_min_vruntime = per_cpu(runqueues, 0).cfs.min_vruntime;
67e12eac	149	spin_unlock_irqrestore(&rq->lock, flags);
ef83a571 IM	150	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "MIN_vruntime",
	151	SPLIT_NS(MIN_vruntime));
	152	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "min_vruntime",
	153	SPLIT_NS(min_vruntime));
	154	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "max_vruntime",
	155	SPLIT_NS(max_vruntime));
67e12eac	156	spread = max_vruntime - MIN_vruntime;
ef83a571 IM	157	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread",
ef83a571 IM	158	SPLIT_NS(spread));
86d9560c	159	spread0 = min_vruntime - rq0_min_vruntime;
ef83a571 IM	160	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread0",
ef83a571 IM	161	SPLIT_NS(spread0));
545f3b18 SV	162	SEQ_printf(m, " .%-30s: %ld\n", "nr_running", cfs_rq->nr_running);
545f3b18 SV	163	SEQ_printf(m, " .%-30s: %ld\n", "load", cfs_rq->load.weight);
fdd71d13	164	#ifdef CONFIG_SCHEDSTATS
480b9434	165	SEQ_printf(m, " .%-30s: %d\n", "bkl_count",
2d72376b	166	rq->bkl_count);
fdd71d13	167	#endif
ddc97297 PZ	168	SEQ_printf(m, " .%-30s: %ld\n", "nr_spread_over",
ddc97297 PZ	169	cfs_rq->nr_spread_over);
c09595f6 PZ	170	#ifdef CONFIG_FAIR_GROUP_SCHED
	171	#ifdef CONFIG_SMP
	172	SEQ_printf(m, " .%-30s: %lu\n", "shares", cfs_rq->shares);
	173	#endif
	174	#endif
43ae34cb IM	175	}
43ae34cb IM	176
ada18de2 PZ	177	void print_rt_rq(struct seq_file m, int cpu, struct rt_rq rt_rq)
	178	{
	179	#if defined(CONFIG_CGROUP_SCHED) && defined(CONFIG_RT_GROUP_SCHED)
	180	char path[128] = "";
	181	struct cgroup *cgroup = NULL;
	182	struct task_group *tg = rt_rq->tg;
	183
	184	if (tg)
	185	cgroup = tg->css.cgroup;
	186
	187	if (cgroup)
	188	cgroup_path(cgroup, path, sizeof(path));
	189
	190	SEQ_printf(m, "\nrt_rq[%d]:%s\n", cpu, path);
	191	#else
	192	SEQ_printf(m, "\nrt_rq[%d]:\n", cpu);
	193	#endif
	194
	195
	196	#define P(x) \
	197	SEQ_printf(m, " .%-30s: %Ld\n", #x, (long long)(rt_rq->x))
	198	#define PN(x) \
	199	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rt_rq->x))
	200
	201	P(rt_nr_running);
	202	P(rt_throttled);
	203	PN(rt_time);
	204	PN(rt_runtime);
	205
	206	#undef PN
	207	#undef P
	208	}
	209
a48da48b	210	static void print_cpu(struct seq_file *m, int cpu)
43ae34cb IM	211	{
	212	struct rq *rq = &per_cpu(runqueues, cpu);
	213
	214	#ifdef CONFIG_X86
	215	{
	216	unsigned int freq = cpu_khz ? : 1;
	217
	218	SEQ_printf(m, "\ncpu#%d, %u.%03u MHz\n",
	219	cpu, freq / 1000, (freq % 1000));
	220	}
	221	#else
	222	SEQ_printf(m, "\ncpu#%d\n", cpu);
	223	#endif
	224
	225	#define P(x) \
	226	SEQ_printf(m, " .%-30s: %Ld\n", #x, (long long)(rq->x))
ef83a571 IM	227	#define PN(x) \
ef83a571 IM	228	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rq->x))
43ae34cb IM	229
	230	P(nr_running);
	231	SEQ_printf(m, " .%-30s: %lu\n", "load",
495eca49	232	rq->load.weight);
43ae34cb IM	233	P(nr_switches);
	234	P(nr_load_updates);
	235	P(nr_uninterruptible);
	236	SEQ_printf(m, " .%-30s: %lu\n", "jiffies", jiffies);
ef83a571	237	PN(next_balance);
43ae34cb	238	P(curr->pid);
ef83a571	239	PN(clock);
43ae34cb IM	240	P(cpu_load[0]);
	241	P(cpu_load[1]);
	242	P(cpu_load[2]);
	243	P(cpu_load[3]);
	244	P(cpu_load[4]);
	245	#undef P
ef83a571	246	#undef PN
43ae34cb	247
5cef9eca	248	print_cfs_stats(m, cpu);
ada18de2	249	print_rt_stats(m, cpu);
43ae34cb	250
a48da48b	251	print_rq(m, rq, cpu);
43ae34cb IM	252	}
	253
	254	static int sched_debug_show(struct seq_file m, void v)
	255	{
	256	u64 now = ktime_to_ns(ktime_get());
	257	int cpu;
	258
f7b9329e	259	SEQ_printf(m, "Sched Debug Version: v0.07, %s %.*s\n",
43ae34cb IM	260	init_utsname()->release,
	261	(int)strcspn(init_utsname()->version, " "),
	262	init_utsname()->version);
	263
ef83a571	264	SEQ_printf(m, "now at %Lu.%06ld msecs\n", SPLIT_NS(now));
43ae34cb	265
1aa4731e	266	#define P(x) \
d822cece	267	SEQ_printf(m, " .%-40s: %Ld\n", #x, (long long)(x))
1aa4731e	268	#define PN(x) \
d822cece	269	SEQ_printf(m, " .%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
1aa4731e	270	PN(sysctl_sched_latency);
b2be5e96	271	PN(sysctl_sched_min_granularity);
1aa4731e	272	PN(sysctl_sched_wakeup_granularity);
1aa4731e IM	273	PN(sysctl_sched_child_runs_first);
	274	P(sysctl_sched_features);
	275	#undef PN
	276	#undef P
	277
43ae34cb	278	for_each_online_cpu(cpu)
a48da48b	279	print_cpu(m, cpu);
43ae34cb IM	280
	281	SEQ_printf(m, "\n");
	282
	283	return 0;
	284	}
	285
f3373461	286	static void sysrq_sched_debug_show(void)
43ae34cb IM	287	{
	288	sched_debug_show(NULL, NULL);
	289	}
	290
	291	static int sched_debug_open(struct inode inode, struct file filp)
	292	{
	293	return single_open(filp, sched_debug_show, NULL);
	294	}
	295
0dbee3a6	296	static const struct file_operations sched_debug_fops = {
43ae34cb IM	297	.open = sched_debug_open,
	298	.read = seq_read,
	299	.llseek = seq_lseek,
5ea473a1	300	.release = single_release,
43ae34cb IM	301	};
	302
	303	static int __init init_sched_debug_procfs(void)
	304	{
	305	struct proc_dir_entry *pe;
	306
c33fff0a	307	pe = proc_create("sched_debug", 0644, NULL, &sched_debug_fops);
43ae34cb IM	308	if (!pe)
43ae34cb IM	309	return -ENOMEM;
43ae34cb IM	310	return 0;
	311	}
	312
	313	__initcall(init_sched_debug_procfs);
	314
	315	void proc_sched_show_task(struct task_struct p, struct seq_file m)
	316	{
cc367732	317	unsigned long nr_switches;
43ae34cb IM	318	unsigned long flags;
	319	int num_threads = 1;
	320
	321	rcu_read_lock();
	322	if (lock_task_sighand(p, &flags)) {
	323	num_threads = atomic_read(&p->signal->count);
	324	unlock_task_sighand(p, &flags);
	325	}
	326	rcu_read_unlock();
	327
	328	SEQ_printf(m, "%s (%d, #threads: %d)\n", p->comm, p->pid, num_threads);
2d92f227 IM	329	SEQ_printf(m,
2d92f227 IM	330	"---------------------------------------------------------\n");
cc367732 IM	331	#define __P(F) \
cc367732 IM	332	SEQ_printf(m, "%-35s:%21Ld\n", #F, (long long)F)
43ae34cb	333	#define P(F) \
2d92f227	334	SEQ_printf(m, "%-35s:%21Ld\n", #F, (long long)p->F)
cc367732 IM	335	#define __PN(F) \
cc367732 IM	336	SEQ_printf(m, "%-35s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)F))
ef83a571	337	#define PN(F) \
2d92f227	338	SEQ_printf(m, "%-35s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)p->F))
43ae34cb	339
ef83a571 IM	340	PN(se.exec_start);
	341	PN(se.vruntime);
	342	PN(se.sum_exec_runtime);
4ae7d5ce	343	PN(se.avg_overlap);
6cfb0d5d	344
cc367732 IM	345	nr_switches = p->nvcsw + p->nivcsw;
cc367732 IM	346
6cfb0d5d	347	#ifdef CONFIG_SCHEDSTATS
ef83a571 IM	348	PN(se.wait_start);
	349	PN(se.sleep_start);
	350	PN(se.block_start);
	351	PN(se.sleep_max);
	352	PN(se.block_max);
	353	PN(se.exec_max);
	354	PN(se.slice_max);
	355	PN(se.wait_max);
6d082592 AV	356	PN(se.wait_sum);
6d082592 AV	357	P(se.wait_count);
2d72376b	358	P(sched_info.bkl_count);
cc367732 IM	359	P(se.nr_migrations);
	360	P(se.nr_migrations_cold);
	361	P(se.nr_failed_migrations_affine);
	362	P(se.nr_failed_migrations_running);
	363	P(se.nr_failed_migrations_hot);
	364	P(se.nr_forced_migrations);
	365	P(se.nr_forced2_migrations);
	366	P(se.nr_wakeups);
	367	P(se.nr_wakeups_sync);
	368	P(se.nr_wakeups_migrate);
	369	P(se.nr_wakeups_local);
	370	P(se.nr_wakeups_remote);
	371	P(se.nr_wakeups_affine);
	372	P(se.nr_wakeups_affine_attempts);
	373	P(se.nr_wakeups_passive);
	374	P(se.nr_wakeups_idle);
	375
	376	{
	377	u64 avg_atom, avg_per_cpu;
	378
	379	avg_atom = p->se.sum_exec_runtime;
	380	if (nr_switches)
	381	do_div(avg_atom, nr_switches);
	382	else
	383	avg_atom = -1LL;
	384
	385	avg_per_cpu = p->se.sum_exec_runtime;
c1a89740	386	if (p->se.nr_migrations) {
6f6d6a1a RZ	387	avg_per_cpu = div64_u64(avg_per_cpu,
6f6d6a1a RZ	388	p->se.nr_migrations);
c1a89740	389	} else {
cc367732	390	avg_per_cpu = -1LL;
c1a89740	391	}
cc367732 IM	392
	393	__PN(avg_atom);
	394	__PN(avg_per_cpu);
	395	}
6cfb0d5d	396	#endif
cc367732	397	__P(nr_switches);
2d92f227	398	SEQ_printf(m, "%-35s:%21Ld\n",
cc367732 IM	399	"nr_voluntary_switches", (long long)p->nvcsw);
	400	SEQ_printf(m, "%-35s:%21Ld\n",
	401	"nr_involuntary_switches", (long long)p->nivcsw);
	402
43ae34cb IM	403	P(se.load.weight);
	404	P(policy);
	405	P(prio);
ef83a571	406	#undef PN
cc367732 IM	407	#undef __PN
	408	#undef P
	409	#undef __P
43ae34cb IM	410
	411	{
	412	u64 t0, t1;
	413
	414	t0 = sched_clock();
	415	t1 = sched_clock();
2d92f227	416	SEQ_printf(m, "%-35s:%21Ld\n",
43ae34cb IM	417	"clock-delta", (long long)(t1-t0));
	418	}
	419	}
	420
	421	void proc_sched_set_task(struct task_struct *p)
	422	{
6cfb0d5d	423	#ifdef CONFIG_SCHEDSTATS
cc367732	424	p->se.wait_max = 0;
6d082592 AV	425	p->se.wait_sum = 0;
6d082592 AV	426	p->se.wait_count = 0;
cc367732 IM	427	p->se.sleep_max = 0;
	428	p->se.sum_sleep_runtime = 0;
	429	p->se.block_max = 0;
	430	p->se.exec_max = 0;
	431	p->se.slice_max = 0;
	432	p->se.nr_migrations = 0;
	433	p->se.nr_migrations_cold = 0;
	434	p->se.nr_failed_migrations_affine = 0;
	435	p->se.nr_failed_migrations_running = 0;
	436	p->se.nr_failed_migrations_hot = 0;
	437	p->se.nr_forced_migrations = 0;
	438	p->se.nr_forced2_migrations = 0;
	439	p->se.nr_wakeups = 0;
	440	p->se.nr_wakeups_sync = 0;
	441	p->se.nr_wakeups_migrate = 0;
	442	p->se.nr_wakeups_local = 0;
	443	p->se.nr_wakeups_remote = 0;
	444	p->se.nr_wakeups_affine = 0;
	445	p->se.nr_wakeups_affine_attempts = 0;
	446	p->se.nr_wakeups_passive = 0;
	447	p->se.nr_wakeups_idle = 0;
	448	p->sched_info.bkl_count = 0;
6cfb0d5d	449	#endif
cc367732 IM	450	p->se.sum_exec_runtime = 0;
	451	p->se.prev_sum_exec_runtime = 0;
	452	p->nvcsw = 0;
	453	p->nivcsw = 0;
43ae34cb	454	}