[linux-2.6-block.git] / kernel / sched / debug.c

/*
 * kernel/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>
#include <linux/mempolicy.h>

#include "sched.h"

static DEFINE_SPINLOCK(sched_debug_lock);

/*
 * This allows printing both to /proc/sched_debug and
 * to the console
 */
#define SEQ_printf(m, x...)			\
 do {						\
	if (m)					\
		seq_printf(m, x);		\
	else					\
		printk(x);			\
 } while (0)

/*
 * Ease the printing of nsec fields:
 */
static long long nsec_high(unsigned long long nsec)
{
	if ((long long)nsec < 0) {
		nsec = -nsec;
		do_div(nsec, 1000000);
		return -nsec;
	}
	do_div(nsec, 1000000);

	return nsec;
}

static unsigned long nsec_low(unsigned long long nsec)
{
	if ((long long)nsec < 0)
		nsec = -nsec;

	return do_div(nsec, 1000000);
}

#define SPLIT_NS(x) nsec_high(x), nsec_low(x)

#ifdef CONFIG_FAIR_GROUP_SCHED
static void print_cfs_group_stats(struct seq_file *m, int cpu, struct task_group *tg)
{
	struct sched_entity *se = tg->se[cpu];

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

	if (!se) {
		struct sched_avg *avg = &cpu_rq(cpu)->avg;
		P(avg->runnable_avg_sum);
		P(avg->runnable_avg_period);
		return;
	}


	PN(se->exec_start);
	PN(se->vruntime);
	PN(se->sum_exec_runtime);
#ifdef CONFIG_SCHEDSTATS
	PN(se->statistics.wait_start);
	PN(se->statistics.sleep_start);
	PN(se->statistics.block_start);
	PN(se->statistics.sleep_max);
	PN(se->statistics.block_max);
	PN(se->statistics.exec_max);
	PN(se->statistics.slice_max);
	PN(se->statistics.wait_max);
	PN(se->statistics.wait_sum);
	P(se->statistics.wait_count);
#endif
	P(se->load.weight);
#ifdef CONFIG_SMP
	P(se->avg.runnable_avg_sum);
	P(se->avg.runnable_avg_period);
	P(se->avg.load_avg_contrib);
	P(se->avg.decay_count);
#endif
#undef PN
#undef P
}
#endif

#ifdef CONFIG_CGROUP_SCHED
static char group_path[PATH_MAX];

static char *task_group_path(struct task_group *tg)
{
	if (autogroup_path(tg, group_path, PATH_MAX))
		return group_path;

	return cgroup_path(tg->css.cgroup, group_path, PATH_MAX);
}
#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, task_pid_nr(p),
		SPLIT_NS(p->se.vruntime),
		(long long)(p->nvcsw + p->nivcsw),
		p->prio);
#ifdef CONFIG_SCHEDSTATS
	SEQ_printf(m, "%9Ld.%06ld %9Ld.%06ld %9Ld.%06ld",
		SPLIT_NS(p->se.vruntime),
		SPLIT_NS(p->se.sum_exec_runtime),
		SPLIT_NS(p->se.statistics.sum_sleep_runtime));
#else
	SEQ_printf(m, "%15Ld %15Ld %15Ld.%06ld %15Ld.%06ld %15Ld.%06ld",
		0LL, 0LL, 0LL, 0L, 0LL, 0L, 0LL, 0L);
#endif
#ifdef CONFIG_NUMA_BALANCING
	SEQ_printf(m, " %d", task_node(p));
#endif
#ifdef CONFIG_CGROUP_SCHED
	SEQ_printf(m, " %s", task_group_path(task_group(p)));
#endif

	SEQ_printf(m, "\n");
}

static void print_rq(struct seq_file *m, struct rq *rq, int rq_cpu)
{
	struct task_struct *g, *p;
	unsigned long flags;

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

	read_lock_irqsave(&tasklist_lock, flags);

	do_each_thread(g, p) {
		if (task_cpu(p) != rq_cpu)
			continue;

		print_task(m, rq, p);
	} while_each_thread(g, p);

	read_unlock_irqrestore(&tasklist_lock, flags);
}

void print_cfs_rq(struct seq_file *m, int cpu, struct cfs_rq *cfs_rq)
{
	s64 MIN_vruntime = -1, min_vruntime, max_vruntime = -1,
		spread, rq0_min_vruntime, spread0;
	struct rq *rq = cpu_rq(cpu);
	struct sched_entity *last;
	unsigned long flags;

#ifdef CONFIG_FAIR_GROUP_SCHED
	SEQ_printf(m, "\ncfs_rq[%d]:%s\n", cpu, task_group_path(cfs_rq->tg));
#else
	SEQ_printf(m, "\ncfs_rq[%d]:\n", cpu);
#endif
	SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", "exec_clock",
			SPLIT_NS(cfs_rq->exec_clock));

	raw_spin_lock_irqsave(&rq->lock, flags);
	if (cfs_rq->rb_leftmost)
		MIN_vruntime = (__pick_first_entity(cfs_rq))->vruntime;
	last = __pick_last_entity(cfs_rq);
	if (last)
		max_vruntime = last->vruntime;
	min_vruntime = cfs_rq->min_vruntime;
	rq0_min_vruntime = cpu_rq(0)->cfs.min_vruntime;
	raw_spin_unlock_irqrestore(&rq->lock, flags);
	SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", "MIN_vruntime",
			SPLIT_NS(MIN_vruntime));
	SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", "min_vruntime",
			SPLIT_NS(min_vruntime));
	SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", "max_vruntime",
			SPLIT_NS(max_vruntime));
	spread = max_vruntime - MIN_vruntime;
	SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", "spread",
			SPLIT_NS(spread));
	spread0 = min_vruntime - rq0_min_vruntime;
	SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", "spread0",
			SPLIT_NS(spread0));
	SEQ_printf(m, "  .%-30s: %d\n", "nr_spread_over",
			cfs_rq->nr_spread_over);
	SEQ_printf(m, "  .%-30s: %d\n", "nr_running", cfs_rq->nr_running);
	SEQ_printf(m, "  .%-30s: %ld\n", "load", cfs_rq->load.weight);
#ifdef CONFIG_SMP
	SEQ_printf(m, "  .%-30s: %ld\n", "runnable_load_avg",
			cfs_rq->runnable_load_avg);
	SEQ_printf(m, "  .%-30s: %ld\n", "blocked_load_avg",
			cfs_rq->blocked_load_avg);
#ifdef CONFIG_FAIR_GROUP_SCHED
	SEQ_printf(m, "  .%-30s: %ld\n", "tg_load_contrib",
			cfs_rq->tg_load_contrib);
	SEQ_printf(m, "  .%-30s: %d\n", "tg_runnable_contrib",
			cfs_rq->tg_runnable_contrib);
	SEQ_printf(m, "  .%-30s: %ld\n", "tg_load_avg",
			atomic_long_read(&cfs_rq->tg->load_avg));
	SEQ_printf(m, "  .%-30s: %d\n", "tg->runnable_avg",
			atomic_read(&cfs_rq->tg->runnable_avg));
#endif
#endif
#ifdef CONFIG_CFS_BANDWIDTH
	SEQ_printf(m, "  .%-30s: %d\n", "tg->cfs_bandwidth.timer_active",
			cfs_rq->tg->cfs_bandwidth.timer_active);
	SEQ_printf(m, "  .%-30s: %d\n", "throttled",
			cfs_rq->throttled);
	SEQ_printf(m, "  .%-30s: %d\n", "throttle_count",
			cfs_rq->throttle_count);
#endif

#ifdef CONFIG_FAIR_GROUP_SCHED
	print_cfs_group_stats(m, cpu, cfs_rq->tg);
#endif
}

void print_rt_rq(struct seq_file *m, int cpu, struct rt_rq *rt_rq)
{
#ifdef CONFIG_RT_GROUP_SCHED
	SEQ_printf(m, "\nrt_rq[%d]:%s\n", cpu, task_group_path(rt_rq->tg));
#else
	SEQ_printf(m, "\nrt_rq[%d]:\n", cpu);
#endif

#define P(x) \
	SEQ_printf(m, "  .%-30s: %Ld\n", #x, (long long)(rt_rq->x))
#define PN(x) \
	SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rt_rq->x))

	P(rt_nr_running);
	P(rt_throttled);
	PN(rt_time);
	PN(rt_runtime);

#undef PN
#undef P
}

extern __read_mostly int sched_clock_running;

static void print_cpu(struct seq_file *m, int cpu)
{
	struct rq *rq = cpu_rq(cpu);
	unsigned long flags;

#ifdef CONFIG_X86
	{
		unsigned int freq = cpu_khz ? : 1;

		SEQ_printf(m, "cpu#%d, %u.%03u MHz\n",
			   cpu, freq / 1000, (freq % 1000));
	}
#else
	SEQ_printf(m, "cpu#%d\n", cpu);
#endif

#define P(x)								\
do {									\
	if (sizeof(rq->x) == 4)						\
		SEQ_printf(m, "  .%-30s: %ld\n", #x, (long)(rq->x));	\
	else								\
		SEQ_printf(m, "  .%-30s: %Ld\n", #x, (long long)(rq->x));\
} while (0)

#define PN(x) \
	SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rq->x))

	P(nr_running);
	SEQ_printf(m, "  .%-30s: %lu\n", "load",
		   rq->load.weight);
	P(nr_switches);
	P(nr_load_updates);
	P(nr_uninterruptible);
	PN(next_balance);
	SEQ_printf(m, "  .%-30s: %ld\n", "curr->pid", (long)(task_pid_nr(rq->curr)));
	PN(clock);
	P(cpu_load[0]);
	P(cpu_load[1]);
	P(cpu_load[2]);
	P(cpu_load[3]);
	P(cpu_load[4]);
#undef P
#undef PN

#ifdef CONFIG_SCHEDSTATS
#define P(n) SEQ_printf(m, "  .%-30s: %d\n", #n, rq->n);
#define P64(n) SEQ_printf(m, "  .%-30s: %Ld\n", #n, rq->n);

	P(yld_count);

	P(sched_count);
	P(sched_goidle);
#ifdef CONFIG_SMP
	P64(avg_idle);
	P64(max_idle_balance_cost);
#endif

	P(ttwu_count);
	P(ttwu_local);

#undef P
#undef P64
#endif
	spin_lock_irqsave(&sched_debug_lock, flags);
	print_cfs_stats(m, cpu);
	print_rt_stats(m, cpu);

	rcu_read_lock();
	print_rq(m, rq, cpu);
	rcu_read_unlock();
	spin_unlock_irqrestore(&sched_debug_lock, flags);
	SEQ_printf(m, "\n");
}

static const char *sched_tunable_scaling_names[] = {
	"none",
	"logaritmic",
	"linear"
};

static void sched_debug_header(struct seq_file *m)
{
	u64 ktime, sched_clk, cpu_clk;
	unsigned long flags;

	local_irq_save(flags);
	ktime = ktime_to_ns(ktime_get());
	sched_clk = sched_clock();
	cpu_clk = local_clock();
	local_irq_restore(flags);

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

#define P(x) \
	SEQ_printf(m, "%-40s: %Ld\n", #x, (long long)(x))
#define PN(x) \
	SEQ_printf(m, "%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
	PN(ktime);
	PN(sched_clk);
	PN(cpu_clk);
	P(jiffies);
#ifdef CONFIG_HAVE_UNSTABLE_SCHED_CLOCK
	P(sched_clock_stable());
#endif
#undef PN
#undef P

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

#define P(x) \
	SEQ_printf(m, "  .%-40s: %Ld\n", #x, (long long)(x))
#define PN(x) \
	SEQ_printf(m, "  .%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
	PN(sysctl_sched_latency);
	PN(sysctl_sched_min_granularity);
	PN(sysctl_sched_wakeup_granularity);
	P(sysctl_sched_child_runs_first);
	P(sysctl_sched_features);
#undef PN
#undef P

	SEQ_printf(m, "  .%-40s: %d (%s)\n",
		"sysctl_sched_tunable_scaling",
		sysctl_sched_tunable_scaling,
		sched_tunable_scaling_names[sysctl_sched_tunable_scaling]);
	SEQ_printf(m, "\n");
}

static int sched_debug_show(struct seq_file *m, void *v)
{
	int cpu = (unsigned long)(v - 2);

	if (cpu != -1)
		print_cpu(m, cpu);
	else
		sched_debug_header(m);

	return 0;
}

void sysrq_sched_debug_show(void)
{
	int cpu;

	sched_debug_header(NULL);
	for_each_online_cpu(cpu)
		print_cpu(NULL, cpu);

}

/*
 * This itererator needs some explanation.
 * It returns 1 for the header position.
 * This means 2 is cpu 0.
 * In a hotplugged system some cpus, including cpu 0, may be missing so we have
 * to use cpumask_* to iterate over the cpus.
 */
static void *sched_debug_start(struct seq_file *file, loff_t *offset)
{
	unsigned long n = *offset;

	if (n == 0)
		return (void *) 1;

	n--;

	if (n > 0)
		n = cpumask_next(n - 1, cpu_online_mask);
	else
		n = cpumask_first(cpu_online_mask);

	*offset = n + 1;

	if (n < nr_cpu_ids)
		return (void *)(unsigned long)(n + 2);
	return NULL;
}

static void *sched_debug_next(struct seq_file *file, void *data, loff_t *offset)
{
	(*offset)++;
	return sched_debug_start(file, offset);
}

static void sched_debug_stop(struct seq_file *file, void *data)
{
}

static const struct seq_operations sched_debug_sops = {
	.start = sched_debug_start,
	.next = sched_debug_next,
	.stop = sched_debug_stop,
	.show = sched_debug_show,
};

static int sched_debug_release(struct inode *inode, struct file *file)
{
	seq_release(inode, file);

	return 0;
}

static int sched_debug_open(struct inode *inode, struct file *filp)
{
	int ret = 0;

	ret = seq_open(filp, &sched_debug_sops);

	return ret;
}

static const struct file_operations sched_debug_fops = {
	.open		= sched_debug_open,
	.read		= seq_read,
	.llseek		= seq_lseek,
	.release	= sched_debug_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);

#define __P(F) \
	SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)F)
#define P(F) \
	SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)p->F)
#define __PN(F) \
	SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)F))
#define PN(F) \
	SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)p->F))


static void sched_show_numa(struct task_struct *p, struct seq_file *m)
{
#ifdef CONFIG_NUMA_BALANCING
	struct mempolicy *pol;
	int node, i;

	if (p->mm)
		P(mm->numa_scan_seq);

	task_lock(p);
	pol = p->mempolicy;
	if (pol && !(pol->flags & MPOL_F_MORON))
		pol = NULL;
	mpol_get(pol);
	task_unlock(p);

	SEQ_printf(m, "numa_migrations, %ld\n", xchg(&p->numa_pages_migrated, 0));

	for_each_online_node(node) {
		for (i = 0; i < 2; i++) {
			unsigned long nr_faults = -1;
			int cpu_current, home_node;

			if (p->numa_faults_memory)
				nr_faults = p->numa_faults_memory[2*node + i];

			cpu_current = !i ? (task_node(p) == node) :
				(pol && node_isset(node, pol->v.nodes));

			home_node = (p->numa_preferred_nid == node);

			SEQ_printf(m, "numa_faults_memory, %d, %d, %d, %d, %ld\n",
				i, node, cpu_current, home_node, nr_faults);
		}
	}

	mpol_put(pol);
#endif
}

void proc_sched_show_task(struct task_struct *p, struct seq_file *m)
{
	unsigned long nr_switches;

	SEQ_printf(m, "%s (%d, #threads: %d)\n", p->comm, task_pid_nr(p),
						get_nr_threads(p));
	SEQ_printf(m,
		"---------------------------------------------------------"
		"----------\n");
#define __P(F) \
	SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)F)
#define P(F) \
	SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)p->F)
#define __PN(F) \
	SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)F))
#define PN(F) \
	SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)p->F))

	PN(se.exec_start);
	PN(se.vruntime);
	PN(se.sum_exec_runtime);

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

#ifdef CONFIG_SCHEDSTATS
	PN(se.statistics.wait_start);
	PN(se.statistics.sleep_start);
	PN(se.statistics.block_start);
	PN(se.statistics.sleep_max);
	PN(se.statistics.block_max);
	PN(se.statistics.exec_max);
	PN(se.statistics.slice_max);
	PN(se.statistics.wait_max);
	PN(se.statistics.wait_sum);
	P(se.statistics.wait_count);
	PN(se.statistics.iowait_sum);
	P(se.statistics.iowait_count);
	P(se.nr_migrations);
	P(se.statistics.nr_migrations_cold);
	P(se.statistics.nr_failed_migrations_affine);
	P(se.statistics.nr_failed_migrations_running);
	P(se.statistics.nr_failed_migrations_hot);
	P(se.statistics.nr_forced_migrations);
	P(se.statistics.nr_wakeups);
	P(se.statistics.nr_wakeups_sync);
	P(se.statistics.nr_wakeups_migrate);
	P(se.statistics.nr_wakeups_local);
	P(se.statistics.nr_wakeups_remote);
	P(se.statistics.nr_wakeups_affine);
	P(se.statistics.nr_wakeups_affine_attempts);
	P(se.statistics.nr_wakeups_passive);
	P(se.statistics.nr_wakeups_idle);

	{
		u64 avg_atom, avg_per_cpu;

		avg_atom = p->se.sum_exec_runtime;
		if (nr_switches)
			avg_atom = div64_ul(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, "%-45s:%21Ld\n",
		   "nr_voluntary_switches", (long long)p->nvcsw);
	SEQ_printf(m, "%-45s:%21Ld\n",
		   "nr_involuntary_switches", (long long)p->nivcsw);

	P(se.load.weight);
#ifdef CONFIG_SMP
	P(se.avg.runnable_avg_sum);
	P(se.avg.runnable_avg_period);
	P(se.avg.load_avg_contrib);
	P(se.avg.decay_count);
#endif
	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, "%-45s:%21Ld\n",
			   "clock-delta", (long long)(t1-t0));
	}

	sched_show_numa(p, m);
}

void proc_sched_set_task(struct task_struct *p)
{
#ifdef CONFIG_SCHEDSTATS
	memset(&p->se.statistics, 0, sizeof(p->se.statistics));
#endif
}
Commit	Line	Data
43ae34cb	1	/*
391e43da	2	* kernel/sched/debug.c
43ae34cb IM	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>
b32e86b4	18	#include <linux/mempolicy.h>
43ae34cb	19
029632fb PZ	20	#include "sched.h"
029632fb PZ	21
efe25c2c BR	22	static DEFINE_SPINLOCK(sched_debug_lock);
efe25c2c BR	23
43ae34cb IM	24	/*
	25	* This allows printing both to /proc/sched_debug and
	26	* to the console
	27	*/
	28	#define SEQ_printf(m, x...) \
	29	do { \
	30	if (m) \
	31	seq_printf(m, x); \
	32	else \
	33	printk(x); \
	34	} while (0)
	35
ef83a571 IM	36	/*
	37	* Ease the printing of nsec fields:
	38	*/
90b2628f	39	static long long nsec_high(unsigned long long nsec)
ef83a571	40	{
90b2628f	41	if ((long long)nsec < 0) {
ef83a571 IM	42	nsec = -nsec;
	43	do_div(nsec, 1000000);
	44	return -nsec;
	45	}
	46	do_div(nsec, 1000000);
	47
	48	return nsec;
	49	}
	50
90b2628f	51	static unsigned long nsec_low(unsigned long long nsec)
ef83a571	52	{
90b2628f	53	if ((long long)nsec < 0)
ef83a571 IM	54	nsec = -nsec;
	55
	56	return do_div(nsec, 1000000);
	57	}
	58
	59	#define SPLIT_NS(x) nsec_high(x), nsec_low(x)
	60
ff9b48c3	61	#ifdef CONFIG_FAIR_GROUP_SCHED
5091faa4	62	static void print_cfs_group_stats(struct seq_file m, int cpu, struct task_group tg)
ff9b48c3 BR	63	{
ff9b48c3 BR	64	struct sched_entity *se = tg->se[cpu];
ff9b48c3 BR	65
	66	#define P(F) \
	67	SEQ_printf(m, " .%-30s: %lld\n", #F, (long long)F)
	68	#define PN(F) \
	69	SEQ_printf(m, " .%-30s: %lld.%06ld\n", #F, SPLIT_NS((long long)F))
	70
18bf2805 BS	71	if (!se) {
	72	struct sched_avg *avg = &cpu_rq(cpu)->avg;
	73	P(avg->runnable_avg_sum);
	74	P(avg->runnable_avg_period);
	75	return;
	76	}
	77
	78
ff9b48c3 BR	79	PN(se->exec_start);
	80	PN(se->vruntime);
	81	PN(se->sum_exec_runtime);
	82	#ifdef CONFIG_SCHEDSTATS
41acab88 LDM	83	PN(se->statistics.wait_start);
	84	PN(se->statistics.sleep_start);
	85	PN(se->statistics.block_start);
	86	PN(se->statistics.sleep_max);
	87	PN(se->statistics.block_max);
	88	PN(se->statistics.exec_max);
	89	PN(se->statistics.slice_max);
	90	PN(se->statistics.wait_max);
	91	PN(se->statistics.wait_sum);
	92	P(se->statistics.wait_count);
ff9b48c3 BR	93	#endif
ff9b48c3 BR	94	P(se->load.weight);
9d85f21c PT	95	#ifdef CONFIG_SMP
	96	P(se->avg.runnable_avg_sum);
	97	P(se->avg.runnable_avg_period);
2dac754e	98	P(se->avg.load_avg_contrib);
9ee474f5	99	P(se->avg.decay_count);
9d85f21c	100	#endif
ff9b48c3 BR	101	#undef PN
	102	#undef P
	103	}
	104	#endif
	105
efe25c2c BR	106	#ifdef CONFIG_CGROUP_SCHED
	107	static char group_path[PATH_MAX];
	108
	109	static char task_group_path(struct task_group tg)
	110	{
8ecedd7a BR	111	if (autogroup_path(tg, group_path, PATH_MAX))
	112	return group_path;
	113
e61734c5	114	return cgroup_path(tg->css.cgroup, group_path, PATH_MAX);
efe25c2c BR	115	}
	116	#endif
	117
43ae34cb	118	static void
a48da48b	119	print_task(struct seq_file m, struct rq rq, struct task_struct *p)
43ae34cb IM	120	{
	121	if (rq->curr == p)
	122	SEQ_printf(m, "R");
	123	else
	124	SEQ_printf(m, " ");
	125
ef83a571	126	SEQ_printf(m, "%15s %5d %9Ld.%06ld %9Ld %5d ",
fc840914	127	p->comm, task_pid_nr(p),
ef83a571	128	SPLIT_NS(p->se.vruntime),
43ae34cb	129	(long long)(p->nvcsw + p->nivcsw),
6f605d83	130	p->prio);
6cfb0d5d	131	#ifdef CONFIG_SCHEDSTATS
d19ca308	132	SEQ_printf(m, "%9Ld.%06ld %9Ld.%06ld %9Ld.%06ld",
ef83a571 IM	133	SPLIT_NS(p->se.vruntime),
ef83a571 IM	134	SPLIT_NS(p->se.sum_exec_runtime),
41acab88	135	SPLIT_NS(p->se.statistics.sum_sleep_runtime));
6cfb0d5d	136	#else
d19ca308	137	SEQ_printf(m, "%15Ld %15Ld %15Ld.%06ld %15Ld.%06ld %15Ld.%06ld",
ef83a571	138	0LL, 0LL, 0LL, 0L, 0LL, 0L, 0LL, 0L);
6cfb0d5d	139	#endif
b32e86b4	140	#ifdef CONFIG_NUMA_BALANCING
de1b301a	141	SEQ_printf(m, " %d", task_node(p));
b32e86b4	142	#endif
efe25c2c BR	143	#ifdef CONFIG_CGROUP_SCHED
	144	SEQ_printf(m, " %s", task_group_path(task_group(p)));
	145	#endif
d19ca308	146
d19ca308	147	SEQ_printf(m, "\n");
43ae34cb IM	148	}
43ae34cb IM	149
a48da48b	150	static void print_rq(struct seq_file m, struct rq rq, int rq_cpu)
43ae34cb IM	151	{
43ae34cb IM	152	struct task_struct g, p;
ab63a633	153	unsigned long flags;
43ae34cb IM	154
	155	SEQ_printf(m,
	156	"\nrunnable tasks:\n"
c86da3a3 MG	157	" task PID tree-key switches prio"
c86da3a3 MG	158	" exec-runtime sum-exec sum-sleep\n"
1a75b94f	159	"------------------------------------------------------"
c86da3a3	160	"----------------------------------------------------\n");
43ae34cb	161
ab63a633	162	read_lock_irqsave(&tasklist_lock, flags);
43ae34cb IM	163
43ae34cb IM	164	do_each_thread(g, p) {
b32e86b4	165	if (task_cpu(p) != rq_cpu)
43ae34cb IM	166	continue;
43ae34cb IM	167
a48da48b	168	print_task(m, rq, p);
43ae34cb IM	169	} while_each_thread(g, p);
43ae34cb IM	170
ab63a633	171	read_unlock_irqrestore(&tasklist_lock, flags);
43ae34cb IM	172	}
43ae34cb IM	173
5cef9eca	174	void print_cfs_rq(struct seq_file m, int cpu, struct cfs_rq cfs_rq)
43ae34cb	175	{
86d9560c IM	176	s64 MIN_vruntime = -1, min_vruntime, max_vruntime = -1,
86d9560c IM	177	spread, rq0_min_vruntime, spread0;
348ec61e	178	struct rq *rq = cpu_rq(cpu);
67e12eac IM	179	struct sched_entity *last;
	180	unsigned long flags;
	181
efe25c2c BR	182	#ifdef CONFIG_FAIR_GROUP_SCHED
	183	SEQ_printf(m, "\ncfs_rq[%d]:%s\n", cpu, task_group_path(cfs_rq->tg));
	184	#else
ada18de2	185	SEQ_printf(m, "\ncfs_rq[%d]:\n", cpu);
efe25c2c	186	#endif
ef83a571 IM	187	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "exec_clock",
ef83a571 IM	188	SPLIT_NS(cfs_rq->exec_clock));
67e12eac	189
05fa785c	190	raw_spin_lock_irqsave(&rq->lock, flags);
67e12eac	191	if (cfs_rq->rb_leftmost)
ac53db59	192	MIN_vruntime = (__pick_first_entity(cfs_rq))->vruntime;
67e12eac IM	193	last = __pick_last_entity(cfs_rq);
	194	if (last)
	195	max_vruntime = last->vruntime;
5ac5c4d6	196	min_vruntime = cfs_rq->min_vruntime;
348ec61e	197	rq0_min_vruntime = cpu_rq(0)->cfs.min_vruntime;
05fa785c	198	raw_spin_unlock_irqrestore(&rq->lock, flags);
ef83a571 IM	199	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "MIN_vruntime",
	200	SPLIT_NS(MIN_vruntime));
	201	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "min_vruntime",
	202	SPLIT_NS(min_vruntime));
	203	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "max_vruntime",
	204	SPLIT_NS(max_vruntime));
67e12eac	205	spread = max_vruntime - MIN_vruntime;
ef83a571 IM	206	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread",
ef83a571 IM	207	SPLIT_NS(spread));
86d9560c	208	spread0 = min_vruntime - rq0_min_vruntime;
ef83a571 IM	209	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread0",
ef83a571 IM	210	SPLIT_NS(spread0));
5ac5c4d6	211	SEQ_printf(m, " .%-30s: %d\n", "nr_spread_over",
ddc97297	212	cfs_rq->nr_spread_over);
c82513e5	213	SEQ_printf(m, " .%-30s: %d\n", "nr_running", cfs_rq->nr_running);
2069dd75	214	SEQ_printf(m, " .%-30s: %ld\n", "load", cfs_rq->load.weight);
c09595f6	215	#ifdef CONFIG_SMP
72a4cf20	216	SEQ_printf(m, " .%-30s: %ld\n", "runnable_load_avg",
2dac754e	217	cfs_rq->runnable_load_avg);
72a4cf20	218	SEQ_printf(m, " .%-30s: %ld\n", "blocked_load_avg",
9ee474f5	219	cfs_rq->blocked_load_avg);
333bb864	220	#ifdef CONFIG_FAIR_GROUP_SCHED
bf5b986e	221	SEQ_printf(m, " .%-30s: %ld\n", "tg_load_contrib",
c566e8e9	222	cfs_rq->tg_load_contrib);
bb17f655 PT	223	SEQ_printf(m, " .%-30s: %d\n", "tg_runnable_contrib",
bb17f655 PT	224	cfs_rq->tg_runnable_contrib);
333bb864 AS	225	SEQ_printf(m, " .%-30s: %ld\n", "tg_load_avg",
333bb864 AS	226	atomic_long_read(&cfs_rq->tg->load_avg));
bb17f655 PT	227	SEQ_printf(m, " .%-30s: %d\n", "tg->runnable_avg",
bb17f655 PT	228	atomic_read(&cfs_rq->tg->runnable_avg));
c09595f6	229	#endif
333bb864	230	#endif
f9f9ffc2 BS	231	#ifdef CONFIG_CFS_BANDWIDTH
	232	SEQ_printf(m, " .%-30s: %d\n", "tg->cfs_bandwidth.timer_active",
	233	cfs_rq->tg->cfs_bandwidth.timer_active);
	234	SEQ_printf(m, " .%-30s: %d\n", "throttled",
	235	cfs_rq->throttled);
	236	SEQ_printf(m, " .%-30s: %d\n", "throttle_count",
	237	cfs_rq->throttle_count);
	238	#endif
2069dd75	239
333bb864	240	#ifdef CONFIG_FAIR_GROUP_SCHED
ff9b48c3	241	print_cfs_group_stats(m, cpu, cfs_rq->tg);
c09595f6	242	#endif
43ae34cb IM	243	}
43ae34cb IM	244
ada18de2 PZ	245	void print_rt_rq(struct seq_file m, int cpu, struct rt_rq rt_rq)
ada18de2 PZ	246	{
efe25c2c BR	247	#ifdef CONFIG_RT_GROUP_SCHED
	248	SEQ_printf(m, "\nrt_rq[%d]:%s\n", cpu, task_group_path(rt_rq->tg));
	249	#else
ada18de2	250	SEQ_printf(m, "\nrt_rq[%d]:\n", cpu);
efe25c2c	251	#endif
ada18de2 PZ	252
	253	#define P(x) \
	254	SEQ_printf(m, " .%-30s: %Ld\n", #x, (long long)(rt_rq->x))
	255	#define PN(x) \
	256	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rt_rq->x))
	257
	258	P(rt_nr_running);
	259	P(rt_throttled);
	260	PN(rt_time);
	261	PN(rt_runtime);
	262
	263	#undef PN
	264	#undef P
	265	}
	266
5bb6b1ea PZ	267	extern __read_mostly int sched_clock_running;
5bb6b1ea PZ	268
a48da48b	269	static void print_cpu(struct seq_file *m, int cpu)
43ae34cb	270	{
348ec61e	271	struct rq *rq = cpu_rq(cpu);
efe25c2c	272	unsigned long flags;
43ae34cb IM	273
	274	#ifdef CONFIG_X86
	275	{
	276	unsigned int freq = cpu_khz ? : 1;
	277
bbbfeac9	278	SEQ_printf(m, "cpu#%d, %u.%03u MHz\n",
43ae34cb IM	279	cpu, freq / 1000, (freq % 1000));
	280	}
	281	#else
bbbfeac9	282	SEQ_printf(m, "cpu#%d\n", cpu);
43ae34cb IM	283	#endif
43ae34cb IM	284
13e099d2 PZ	285	#define P(x) \
	286	do { \
	287	if (sizeof(rq->x) == 4) \
	288	SEQ_printf(m, " .%-30s: %ld\n", #x, (long)(rq->x)); \
	289	else \
	290	SEQ_printf(m, " .%-30s: %Ld\n", #x, (long long)(rq->x));\
	291	} while (0)
	292
ef83a571 IM	293	#define PN(x) \
ef83a571 IM	294	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rq->x))
43ae34cb IM	295
	296	P(nr_running);
	297	SEQ_printf(m, " .%-30s: %lu\n", "load",
495eca49	298	rq->load.weight);
43ae34cb IM	299	P(nr_switches);
	300	P(nr_load_updates);
	301	P(nr_uninterruptible);
ef83a571	302	PN(next_balance);
fc840914	303	SEQ_printf(m, " .%-30s: %ld\n", "curr->pid", (long)(task_pid_nr(rq->curr)));
ef83a571	304	PN(clock);
43ae34cb IM	305	P(cpu_load[0]);
	306	P(cpu_load[1]);
	307	P(cpu_load[2]);
	308	P(cpu_load[3]);
	309	P(cpu_load[4]);
	310	#undef P
ef83a571	311	#undef PN
43ae34cb	312
5ac5c4d6 PZ	313	#ifdef CONFIG_SCHEDSTATS
5ac5c4d6 PZ	314	#define P(n) SEQ_printf(m, " .%-30s: %d\n", #n, rq->n);
1b9508f6	315	#define P64(n) SEQ_printf(m, " .%-30s: %Ld\n", #n, rq->n);
5ac5c4d6	316
5ac5c4d6 PZ	317	P(yld_count);
5ac5c4d6 PZ	318
5ac5c4d6 PZ	319	P(sched_count);
5ac5c4d6 PZ	320	P(sched_goidle);
1b9508f6 MG	321	#ifdef CONFIG_SMP
1b9508f6 MG	322	P64(avg_idle);
37e6bae8	323	P64(max_idle_balance_cost);
1b9508f6	324	#endif
5ac5c4d6 PZ	325
	326	P(ttwu_count);
	327	P(ttwu_local);
	328
5ac5c4d6	329	#undef P
fce20979	330	#undef P64
5ac5c4d6	331	#endif
efe25c2c	332	spin_lock_irqsave(&sched_debug_lock, flags);
5cef9eca	333	print_cfs_stats(m, cpu);
ada18de2	334	print_rt_stats(m, cpu);
43ae34cb	335
efe25c2c	336	rcu_read_lock();
a48da48b	337	print_rq(m, rq, cpu);
efe25c2c BR	338	rcu_read_unlock();
efe25c2c BR	339	spin_unlock_irqrestore(&sched_debug_lock, flags);
bbbfeac9	340	SEQ_printf(m, "\n");
43ae34cb IM	341	}
43ae34cb IM	342
1983a922 CE	343	static const char *sched_tunable_scaling_names[] = {
	344	"none",
	345	"logaritmic",
	346	"linear"
	347	};
	348
bbbfeac9	349	static void sched_debug_header(struct seq_file *m)
43ae34cb	350	{
5bb6b1ea PZ	351	u64 ktime, sched_clk, cpu_clk;
5bb6b1ea PZ	352	unsigned long flags;
43ae34cb	353
5bb6b1ea PZ	354	local_irq_save(flags);
	355	ktime = ktime_to_ns(ktime_get());
	356	sched_clk = sched_clock();
	357	cpu_clk = local_clock();
	358	local_irq_restore(flags);
	359
b32e86b4	360	SEQ_printf(m, "Sched Debug Version: v0.11, %s %.*s\n",
43ae34cb IM	361	init_utsname()->release,
	362	(int)strcspn(init_utsname()->version, " "),
	363	init_utsname()->version);
	364
5bb6b1ea PZ	365	#define P(x) \
	366	SEQ_printf(m, "%-40s: %Ld\n", #x, (long long)(x))
	367	#define PN(x) \
	368	SEQ_printf(m, "%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
	369	PN(ktime);
	370	PN(sched_clk);
	371	PN(cpu_clk);
	372	P(jiffies);
	373	#ifdef CONFIG_HAVE_UNSTABLE_SCHED_CLOCK
35af99e6	374	P(sched_clock_stable());
5bb6b1ea PZ	375	#endif
	376	#undef PN
	377	#undef P
	378
	379	SEQ_printf(m, "\n");
	380	SEQ_printf(m, "sysctl_sched\n");
43ae34cb	381
1aa4731e	382	#define P(x) \
d822cece	383	SEQ_printf(m, " .%-40s: %Ld\n", #x, (long long)(x))
1aa4731e	384	#define PN(x) \
d822cece	385	SEQ_printf(m, " .%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
1aa4731e	386	PN(sysctl_sched_latency);
b2be5e96	387	PN(sysctl_sched_min_granularity);
1aa4731e	388	PN(sysctl_sched_wakeup_granularity);
eebef746	389	P(sysctl_sched_child_runs_first);
1aa4731e IM	390	P(sysctl_sched_features);
	391	#undef PN
	392	#undef P
	393
bbbfeac9 NZ	394	SEQ_printf(m, " .%-40s: %d (%s)\n",
bbbfeac9 NZ	395	"sysctl_sched_tunable_scaling",
1983a922 CE	396	sysctl_sched_tunable_scaling,
1983a922 CE	397	sched_tunable_scaling_names[sysctl_sched_tunable_scaling]);
bbbfeac9 NZ	398	SEQ_printf(m, "\n");
bbbfeac9 NZ	399	}
1983a922	400
bbbfeac9 NZ	401	static int sched_debug_show(struct seq_file m, void v)
	402	{
	403	int cpu = (unsigned long)(v - 2);
43ae34cb	404
bbbfeac9 NZ	405	if (cpu != -1)
	406	print_cpu(m, cpu);
	407	else
	408	sched_debug_header(m);
43ae34cb IM	409
	410	return 0;
	411	}
	412
029632fb	413	void sysrq_sched_debug_show(void)
43ae34cb	414	{
bbbfeac9 NZ	415	int cpu;
	416
	417	sched_debug_header(NULL);
	418	for_each_online_cpu(cpu)
	419	print_cpu(NULL, cpu);
	420
	421	}
	422
	423	/*
	424	* This itererator needs some explanation.
	425	* It returns 1 for the header position.
	426	* This means 2 is cpu 0.
	427	* In a hotplugged system some cpus, including cpu 0, may be missing so we have
	428	* to use cpumask_* to iterate over the cpus.
	429	*/
	430	static void sched_debug_start(struct seq_file file, loff_t *offset)
	431	{
	432	unsigned long n = *offset;
	433
	434	if (n == 0)
	435	return (void *) 1;
	436
	437	n--;
	438
	439	if (n > 0)
	440	n = cpumask_next(n - 1, cpu_online_mask);
	441	else
	442	n = cpumask_first(cpu_online_mask);
	443
	444	*offset = n + 1;
	445
	446	if (n < nr_cpu_ids)
	447	return (void *)(unsigned long)(n + 2);
	448	return NULL;
	449	}
	450
	451	static void sched_debug_next(struct seq_file file, void data, loff_t offset)
	452	{
	453	(*offset)++;
	454	return sched_debug_start(file, offset);
	455	}
	456
	457	static void sched_debug_stop(struct seq_file file, void data)
	458	{
	459	}
	460
	461	static const struct seq_operations sched_debug_sops = {
	462	.start = sched_debug_start,
	463	.next = sched_debug_next,
	464	.stop = sched_debug_stop,
	465	.show = sched_debug_show,
	466	};
	467
	468	static int sched_debug_release(struct inode inode, struct file file)
	469	{
	470	seq_release(inode, file);
	471
	472	return 0;
43ae34cb IM	473	}
	474
	475	static int sched_debug_open(struct inode inode, struct file filp)
	476	{
bbbfeac9 NZ	477	int ret = 0;
	478
	479	ret = seq_open(filp, &sched_debug_sops);
	480
	481	return ret;
43ae34cb IM	482	}
43ae34cb IM	483
0dbee3a6	484	static const struct file_operations sched_debug_fops = {
43ae34cb IM	485	.open = sched_debug_open,
	486	.read = seq_read,
	487	.llseek = seq_lseek,
bbbfeac9	488	.release = sched_debug_release,
43ae34cb IM	489	};
	490
	491	static int __init init_sched_debug_procfs(void)
	492	{
	493	struct proc_dir_entry *pe;
	494
a9cf4ddb	495	pe = proc_create("sched_debug", 0444, NULL, &sched_debug_fops);
43ae34cb IM	496	if (!pe)
43ae34cb IM	497	return -ENOMEM;
43ae34cb IM	498	return 0;
	499	}
	500
	501	__initcall(init_sched_debug_procfs);
	502
b32e86b4 IM	503	#define __P(F) \
	504	SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)F)
	505	#define P(F) \
	506	SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)p->F)
	507	#define __PN(F) \
	508	SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)F))
	509	#define PN(F) \
	510	SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)p->F))
	511
	512
	513	static void sched_show_numa(struct task_struct p, struct seq_file m)
	514	{
	515	#ifdef CONFIG_NUMA_BALANCING
	516	struct mempolicy *pol;
	517	int node, i;
	518
	519	if (p->mm)
	520	P(mm->numa_scan_seq);
	521
	522	task_lock(p);
	523	pol = p->mempolicy;
	524	if (pol && !(pol->flags & MPOL_F_MORON))
	525	pol = NULL;
	526	mpol_get(pol);
	527	task_unlock(p);
	528
	529	SEQ_printf(m, "numa_migrations, %ld\n", xchg(&p->numa_pages_migrated, 0));
	530
	531	for_each_online_node(node) {
	532	for (i = 0; i < 2; i++) {
	533	unsigned long nr_faults = -1;
	534	int cpu_current, home_node;
	535
ff1df896 RR	536	if (p->numa_faults_memory)
ff1df896 RR	537	nr_faults = p->numa_faults_memory[2*node + i];
b32e86b4 IM	538
	539	cpu_current = !i ? (task_node(p) == node) :
	540	(pol && node_isset(node, pol->v.nodes));
	541
	542	home_node = (p->numa_preferred_nid == node);
	543
ff1df896	544	SEQ_printf(m, "numa_faults_memory, %d, %d, %d, %d, %ld\n",
b32e86b4 IM	545	i, node, cpu_current, home_node, nr_faults);
	546	}
	547	}
	548
	549	mpol_put(pol);
	550	#endif
	551	}
	552
43ae34cb IM	553	void proc_sched_show_task(struct task_struct p, struct seq_file m)
43ae34cb IM	554	{
cc367732	555	unsigned long nr_switches;
43ae34cb	556
fc840914	557	SEQ_printf(m, "%s (%d, #threads: %d)\n", p->comm, task_pid_nr(p),
5089a976	558	get_nr_threads(p));
2d92f227	559	SEQ_printf(m,
add332a1 KB	560	"---------------------------------------------------------"
add332a1 KB	561	"----------\n");
cc367732	562	#define __P(F) \
add332a1	563	SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)F)
43ae34cb	564	#define P(F) \
add332a1	565	SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)p->F)
cc367732	566	#define __PN(F) \
add332a1	567	SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)F))
ef83a571	568	#define PN(F) \
add332a1	569	SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)p->F))
43ae34cb	570
ef83a571 IM	571	PN(se.exec_start);
	572	PN(se.vruntime);
	573	PN(se.sum_exec_runtime);
6cfb0d5d	574
cc367732 IM	575	nr_switches = p->nvcsw + p->nivcsw;
cc367732 IM	576
6cfb0d5d	577	#ifdef CONFIG_SCHEDSTATS
41acab88 LDM	578	PN(se.statistics.wait_start);
	579	PN(se.statistics.sleep_start);
	580	PN(se.statistics.block_start);
	581	PN(se.statistics.sleep_max);
	582	PN(se.statistics.block_max);
	583	PN(se.statistics.exec_max);
	584	PN(se.statistics.slice_max);
	585	PN(se.statistics.wait_max);
	586	PN(se.statistics.wait_sum);
	587	P(se.statistics.wait_count);
	588	PN(se.statistics.iowait_sum);
	589	P(se.statistics.iowait_count);
cc367732	590	P(se.nr_migrations);
41acab88 LDM	591	P(se.statistics.nr_migrations_cold);
	592	P(se.statistics.nr_failed_migrations_affine);
	593	P(se.statistics.nr_failed_migrations_running);
	594	P(se.statistics.nr_failed_migrations_hot);
	595	P(se.statistics.nr_forced_migrations);
	596	P(se.statistics.nr_wakeups);
	597	P(se.statistics.nr_wakeups_sync);
	598	P(se.statistics.nr_wakeups_migrate);
	599	P(se.statistics.nr_wakeups_local);
	600	P(se.statistics.nr_wakeups_remote);
	601	P(se.statistics.nr_wakeups_affine);
	602	P(se.statistics.nr_wakeups_affine_attempts);
	603	P(se.statistics.nr_wakeups_passive);
	604	P(se.statistics.nr_wakeups_idle);
cc367732 IM	605
	606	{
	607	u64 avg_atom, avg_per_cpu;
	608
	609	avg_atom = p->se.sum_exec_runtime;
	610	if (nr_switches)
b0ab99e7	611	avg_atom = div64_ul(avg_atom, nr_switches);
cc367732 IM	612	else
	613	avg_atom = -1LL;
	614
	615	avg_per_cpu = p->se.sum_exec_runtime;
c1a89740	616	if (p->se.nr_migrations) {
6f6d6a1a RZ	617	avg_per_cpu = div64_u64(avg_per_cpu,
6f6d6a1a RZ	618	p->se.nr_migrations);
c1a89740	619	} else {
cc367732	620	avg_per_cpu = -1LL;
c1a89740	621	}
cc367732 IM	622
	623	__PN(avg_atom);
	624	__PN(avg_per_cpu);
	625	}
6cfb0d5d	626	#endif
cc367732	627	__P(nr_switches);
add332a1	628	SEQ_printf(m, "%-45s:%21Ld\n",
cc367732	629	"nr_voluntary_switches", (long long)p->nvcsw);
add332a1	630	SEQ_printf(m, "%-45s:%21Ld\n",
cc367732 IM	631	"nr_involuntary_switches", (long long)p->nivcsw);
cc367732 IM	632
43ae34cb	633	P(se.load.weight);
333bb864	634	#ifdef CONFIG_SMP
939fd731 KB	635	P(se.avg.runnable_avg_sum);
	636	P(se.avg.runnable_avg_period);
	637	P(se.avg.load_avg_contrib);
	638	P(se.avg.decay_count);
	639	#endif
43ae34cb IM	640	P(policy);
43ae34cb IM	641	P(prio);
ef83a571	642	#undef PN
cc367732 IM	643	#undef __PN
	644	#undef P
	645	#undef __P
43ae34cb IM	646
43ae34cb IM	647	{
29d7b90c	648	unsigned int this_cpu = raw_smp_processor_id();
43ae34cb IM	649	u64 t0, t1;
43ae34cb IM	650
29d7b90c IM	651	t0 = cpu_clock(this_cpu);
29d7b90c IM	652	t1 = cpu_clock(this_cpu);
add332a1	653	SEQ_printf(m, "%-45s:%21Ld\n",
43ae34cb IM	654	"clock-delta", (long long)(t1-t0));
43ae34cb IM	655	}
b32e86b4 IM	656
b32e86b4 IM	657	sched_show_numa(p, m);
43ae34cb IM	658	}
	659
	660	void proc_sched_set_task(struct task_struct *p)
	661	{
6cfb0d5d	662	#ifdef CONFIG_SCHEDSTATS
41acab88	663	memset(&p->se.statistics, 0, sizeof(p->se.statistics));
6cfb0d5d	664	#endif
43ae34cb	665	}