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

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

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

		print_task(m, rq, p);
	}
	rcu_read_unlock();
}

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

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