[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(long long nsec)
{
	if (nsec < 0) {
		nsec = -nsec;
		do_div(nsec, 1000000);
		return -nsec;
	}
	do_div(nsec, 1000000);

	return nsec;
}

static unsigned long nsec_low(long long nsec)
{
	if (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\n",
		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\n",
		0LL, 0LL, 0LL, 0L, 0LL, 0L, 0LL, 0L);
#endif
}

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;

	SEQ_printf(m, "\ncfs_rq\n");

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

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);
	PN(idle_clock);
	PN(prev_clock_raw);
	P(clock_warps);
	P(clock_overflows);
	P(clock_deep_idle_events);
	PN(clock_max_delta);
	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_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_batch_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 = create_proc_entry("sched_debug", 0644, NULL);
	if (!pe)
		return -ENOMEM;

	pe->proc_fops = &sched_debug_fops;

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

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