[deliverable/linux.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;

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

	read_lock_irq(&tasklist_lock);

	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_irq(&tasklist_lock);
}

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: %ld\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.05-v20, %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_nr_latency);
	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);
}

#ifdef CONFIG_FAIR_USER_SCHED

static DEFINE_MUTEX(root_user_share_mutex);

static int
root_user_share_read_proc(char *page, char **start, off_t off, int count,
				 int *eof, void *data)
{
	return sprintf(page, "%d\n", init_task_grp_load);
}

static int
root_user_share_write_proc(struct file *file, const char __user *buffer,
				 unsigned long count, void *data)
{
	unsigned long shares;
	char kbuf[sizeof(unsigned long)+1];
	int rc = 0;

	if (copy_from_user(kbuf, buffer, sizeof(kbuf)))
		return -EFAULT;

	shares = simple_strtoul(kbuf, NULL, 0);

	if (!shares)
		shares = NICE_0_LOAD;

	mutex_lock(&root_user_share_mutex);

	init_task_grp_load = shares;
	rc = sched_group_set_shares(&init_task_grp, shares);

	mutex_unlock(&root_user_share_mutex);

	return (rc < 0 ? rc : count);
}

#endif	/* CONFIG_FAIR_USER_SCHED */

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

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

#ifdef CONFIG_FAIR_USER_SCHED
	pe = create_proc_entry("root_user_cpu_share", 0644, NULL);
	if (!pe)
		return -ENOMEM;

	pe->read_proc = root_user_share_read_proc;
	pe->write_proc = root_user_share_write_proc;
#endif

	return 0;
}

__initcall(init_sched_debug_procfs);

void proc_sched_show_task(struct task_struct *p, struct seq_file *m)
{
	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, "%-25s:%20Ld\n", #F, (long long)p->F)
#define PN(F) \
	SEQ_printf(m, "%-25s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)p->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);
	P(sched_info.bkl_count);
#endif
	SEQ_printf(m, "%-25s:%20Ld\n",
		   "nr_switches", (long long)(p->nvcsw + p->nivcsw));
	P(se.load.weight);
	P(policy);
	P(prio);
#undef P
#undef PN

	{
		u64 t0, t1;

		t0 = sched_clock();
		t1 = sched_clock();
		SEQ_printf(m, "%-25s:%20Ld\n",
			   "clock-delta", (long long)(t1-t0));
	}
}

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