[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)
		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.load_avg);
	P(se->avg.util_avg);
#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.statistics.wait_sum),
		SPLIT_NS(p->se.sum_exec_runtime),
		SPLIT_NS(p->se.statistics.sum_sleep_runtime));
#else
	SEQ_printf(m, "%9Ld.%06ld %9Ld.%06ld %9Ld.%06ld",
		0LL, 0L,
		SPLIT_NS(p->se.sum_exec_runtime),
		0LL, 0L);
#endif
#ifdef CONFIG_NUMA_BALANCING
	SEQ_printf(m, " %d %d", task_node(p), task_numa_group_id(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"
	"     wait-time             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: %lu\n", "load_avg",
			cfs_rq->avg.load_avg);
	SEQ_printf(m, "  .%-30s: %lu\n", "runnable_load_avg",
			cfs_rq->runnable_load_avg);
	SEQ_printf(m, "  .%-30s: %lu\n", "util_avg",
			cfs_rq->avg.util_avg);
	SEQ_printf(m, "  .%-30s: %ld\n", "removed_load_avg",
			atomic_long_read(&cfs_rq->removed_load_avg));
	SEQ_printf(m, "  .%-30s: %ld\n", "removed_util_avg",
			atomic_long_read(&cfs_rq->removed_util_avg));
#ifdef CONFIG_FAIR_GROUP_SCHED
	SEQ_printf(m, "  .%-30s: %lu\n", "tg_load_avg_contrib",
			cfs_rq->tg_load_avg_contrib);
	SEQ_printf(m, "  .%-30s: %ld\n", "tg_load_avg",
			atomic_long_read(&cfs_rq->tg->load_avg));
#endif
#endif
#ifdef CONFIG_CFS_BANDWIDTH
	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
}

void print_dl_rq(struct seq_file *m, int cpu, struct dl_rq *dl_rq)
{
	SEQ_printf(m, "\ndl_rq[%d]:\n", cpu);
	SEQ_printf(m, "  .%-30s: %ld\n", "dl_nr_running", dl_rq->dl_nr_running);
}

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);
	PN(clock_task);
	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_dl_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))


#ifdef CONFIG_NUMA_BALANCING
void print_numa_stats(struct seq_file *m, int node, unsigned long tsf,
		unsigned long tpf, unsigned long gsf, unsigned long gpf)
{
	SEQ_printf(m, "numa_faults node=%d ", node);
	SEQ_printf(m, "task_private=%lu task_shared=%lu ", tsf, tpf);
	SEQ_printf(m, "group_private=%lu group_shared=%lu\n", gsf, gpf);
}
#endif


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

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

	P(numa_pages_migrated);
	P(numa_preferred_nid);
	P(total_numa_faults);
	SEQ_printf(m, "current_node=%d, numa_group_id=%d\n",
			task_node(p), task_numa_group_id(p));
	show_numa_stats(p, m);
	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.sum_sleep_runtime);
	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.load_sum);
	P(se.avg.util_sum);
	P(se.avg.load_avg);
	P(se.avg.util_avg);
	P(se.avg.last_update_time);
#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
cd126afe	71	if (!se)
18bf2805	72	return;
18bf2805	73
ff9b48c3 BR	74	PN(se->exec_start);
	75	PN(se->vruntime);
	76	PN(se->sum_exec_runtime);
	77	#ifdef CONFIG_SCHEDSTATS
41acab88 LDM	78	PN(se->statistics.wait_start);
	79	PN(se->statistics.sleep_start);
	80	PN(se->statistics.block_start);
	81	PN(se->statistics.sleep_max);
	82	PN(se->statistics.block_max);
	83	PN(se->statistics.exec_max);
	84	PN(se->statistics.slice_max);
	85	PN(se->statistics.wait_max);
	86	PN(se->statistics.wait_sum);
	87	P(se->statistics.wait_count);
ff9b48c3 BR	88	#endif
ff9b48c3 BR	89	P(se->load.weight);
9d85f21c	90	#ifdef CONFIG_SMP
9d89c257 YD	91	P(se->avg.load_avg);
9d89c257 YD	92	P(se->avg.util_avg);
9d85f21c	93	#endif
ff9b48c3 BR	94	#undef PN
	95	#undef P
	96	}
	97	#endif
	98
efe25c2c BR	99	#ifdef CONFIG_CGROUP_SCHED
	100	static char group_path[PATH_MAX];
	101
	102	static char task_group_path(struct task_group tg)
	103	{
8ecedd7a BR	104	if (autogroup_path(tg, group_path, PATH_MAX))
	105	return group_path;
	106
e61734c5	107	return cgroup_path(tg->css.cgroup, group_path, PATH_MAX);
efe25c2c BR	108	}
	109	#endif
	110
43ae34cb	111	static void
a48da48b	112	print_task(struct seq_file m, struct rq rq, struct task_struct *p)
43ae34cb IM	113	{
	114	if (rq->curr == p)
	115	SEQ_printf(m, "R");
	116	else
	117	SEQ_printf(m, " ");
	118
ef83a571	119	SEQ_printf(m, "%15s %5d %9Ld.%06ld %9Ld %5d ",
fc840914	120	p->comm, task_pid_nr(p),
ef83a571	121	SPLIT_NS(p->se.vruntime),
43ae34cb	122	(long long)(p->nvcsw + p->nivcsw),
6f605d83	123	p->prio);
6cfb0d5d	124	#ifdef CONFIG_SCHEDSTATS
d19ca308	125	SEQ_printf(m, "%9Ld.%06ld %9Ld.%06ld %9Ld.%06ld",
c5f3ab1c	126	SPLIT_NS(p->se.statistics.wait_sum),
ef83a571	127	SPLIT_NS(p->se.sum_exec_runtime),
41acab88	128	SPLIT_NS(p->se.statistics.sum_sleep_runtime));
6cfb0d5d	129	#else
33d6176e SD	130	SEQ_printf(m, "%9Ld.%06ld %9Ld.%06ld %9Ld.%06ld",
	131	0LL, 0L,
	132	SPLIT_NS(p->se.sum_exec_runtime),
	133	0LL, 0L);
6cfb0d5d	134	#endif
b32e86b4	135	#ifdef CONFIG_NUMA_BALANCING
e3d24d0a	136	SEQ_printf(m, " %d %d", task_node(p), task_numa_group_id(p));
b32e86b4	137	#endif
efe25c2c BR	138	#ifdef CONFIG_CGROUP_SCHED
	139	SEQ_printf(m, " %s", task_group_path(task_group(p)));
	140	#endif
d19ca308	141
d19ca308	142	SEQ_printf(m, "\n");
43ae34cb IM	143	}
43ae34cb IM	144
a48da48b	145	static void print_rq(struct seq_file m, struct rq rq, int rq_cpu)
43ae34cb IM	146	{
	147	struct task_struct g, p;
	148
	149	SEQ_printf(m,
	150	"\nrunnable tasks:\n"
c86da3a3	151	" task PID tree-key switches prio"
c5f3ab1c	152	" wait-time sum-exec sum-sleep\n"
1a75b94f	153	"------------------------------------------------------"
c86da3a3	154	"----------------------------------------------------\n");
43ae34cb	155
5bd96ab6	156	rcu_read_lock();
d38e83c7	157	for_each_process_thread(g, p) {
b32e86b4	158	if (task_cpu(p) != rq_cpu)
43ae34cb IM	159	continue;
43ae34cb IM	160
a48da48b	161	print_task(m, rq, p);
d38e83c7	162	}
5bd96ab6	163	rcu_read_unlock();
43ae34cb IM	164	}
43ae34cb IM	165
5cef9eca	166	void print_cfs_rq(struct seq_file m, int cpu, struct cfs_rq cfs_rq)
43ae34cb	167	{
86d9560c IM	168	s64 MIN_vruntime = -1, min_vruntime, max_vruntime = -1,
86d9560c IM	169	spread, rq0_min_vruntime, spread0;
348ec61e	170	struct rq *rq = cpu_rq(cpu);
67e12eac IM	171	struct sched_entity *last;
	172	unsigned long flags;
	173
efe25c2c BR	174	#ifdef CONFIG_FAIR_GROUP_SCHED
	175	SEQ_printf(m, "\ncfs_rq[%d]:%s\n", cpu, task_group_path(cfs_rq->tg));
	176	#else
ada18de2	177	SEQ_printf(m, "\ncfs_rq[%d]:\n", cpu);
efe25c2c	178	#endif
ef83a571 IM	179	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "exec_clock",
ef83a571 IM	180	SPLIT_NS(cfs_rq->exec_clock));
67e12eac	181
05fa785c	182	raw_spin_lock_irqsave(&rq->lock, flags);
67e12eac	183	if (cfs_rq->rb_leftmost)
ac53db59	184	MIN_vruntime = (__pick_first_entity(cfs_rq))->vruntime;
67e12eac IM	185	last = __pick_last_entity(cfs_rq);
	186	if (last)
	187	max_vruntime = last->vruntime;
5ac5c4d6	188	min_vruntime = cfs_rq->min_vruntime;
348ec61e	189	rq0_min_vruntime = cpu_rq(0)->cfs.min_vruntime;
05fa785c	190	raw_spin_unlock_irqrestore(&rq->lock, flags);
ef83a571 IM	191	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "MIN_vruntime",
	192	SPLIT_NS(MIN_vruntime));
	193	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "min_vruntime",
	194	SPLIT_NS(min_vruntime));
	195	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "max_vruntime",
	196	SPLIT_NS(max_vruntime));
67e12eac	197	spread = max_vruntime - MIN_vruntime;
ef83a571 IM	198	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread",
ef83a571 IM	199	SPLIT_NS(spread));
86d9560c	200	spread0 = min_vruntime - rq0_min_vruntime;
ef83a571 IM	201	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread0",
ef83a571 IM	202	SPLIT_NS(spread0));
5ac5c4d6	203	SEQ_printf(m, " .%-30s: %d\n", "nr_spread_over",
ddc97297	204	cfs_rq->nr_spread_over);
c82513e5	205	SEQ_printf(m, " .%-30s: %d\n", "nr_running", cfs_rq->nr_running);
2069dd75	206	SEQ_printf(m, " .%-30s: %ld\n", "load", cfs_rq->load.weight);
c09595f6	207	#ifdef CONFIG_SMP
9d89c257 YD	208	SEQ_printf(m, " .%-30s: %lu\n", "load_avg",
9d89c257 YD	209	cfs_rq->avg.load_avg);
13962234 YD	210	SEQ_printf(m, " .%-30s: %lu\n", "runnable_load_avg",
13962234 YD	211	cfs_rq->runnable_load_avg);
9d89c257 YD	212	SEQ_printf(m, " .%-30s: %lu\n", "util_avg",
	213	cfs_rq->avg.util_avg);
	214	SEQ_printf(m, " .%-30s: %ld\n", "removed_load_avg",
	215	atomic_long_read(&cfs_rq->removed_load_avg));
	216	SEQ_printf(m, " .%-30s: %ld\n", "removed_util_avg",
	217	atomic_long_read(&cfs_rq->removed_util_avg));
333bb864	218	#ifdef CONFIG_FAIR_GROUP_SCHED
9d89c257 YD	219	SEQ_printf(m, " .%-30s: %lu\n", "tg_load_avg_contrib",
9d89c257 YD	220	cfs_rq->tg_load_avg_contrib);
333bb864 AS	221	SEQ_printf(m, " .%-30s: %ld\n", "tg_load_avg",
333bb864 AS	222	atomic_long_read(&cfs_rq->tg->load_avg));
c09595f6	223	#endif
333bb864	224	#endif
f9f9ffc2	225	#ifdef CONFIG_CFS_BANDWIDTH
f9f9ffc2 BS	226	SEQ_printf(m, " .%-30s: %d\n", "throttled",
	227	cfs_rq->throttled);
	228	SEQ_printf(m, " .%-30s: %d\n", "throttle_count",
	229	cfs_rq->throttle_count);
	230	#endif
2069dd75	231
333bb864	232	#ifdef CONFIG_FAIR_GROUP_SCHED
ff9b48c3	233	print_cfs_group_stats(m, cpu, cfs_rq->tg);
c09595f6	234	#endif
43ae34cb IM	235	}
43ae34cb IM	236
ada18de2 PZ	237	void print_rt_rq(struct seq_file m, int cpu, struct rt_rq rt_rq)
ada18de2 PZ	238	{
efe25c2c BR	239	#ifdef CONFIG_RT_GROUP_SCHED
	240	SEQ_printf(m, "\nrt_rq[%d]:%s\n", cpu, task_group_path(rt_rq->tg));
	241	#else
ada18de2	242	SEQ_printf(m, "\nrt_rq[%d]:\n", cpu);
efe25c2c	243	#endif
ada18de2 PZ	244
	245	#define P(x) \
	246	SEQ_printf(m, " .%-30s: %Ld\n", #x, (long long)(rt_rq->x))
	247	#define PN(x) \
	248	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rt_rq->x))
	249
	250	P(rt_nr_running);
	251	P(rt_throttled);
	252	PN(rt_time);
	253	PN(rt_runtime);
	254
	255	#undef PN
	256	#undef P
	257	}
	258
acb32132 WL	259	void print_dl_rq(struct seq_file m, int cpu, struct dl_rq dl_rq)
	260	{
	261	SEQ_printf(m, "\ndl_rq[%d]:\n", cpu);
	262	SEQ_printf(m, " .%-30s: %ld\n", "dl_nr_running", dl_rq->dl_nr_running);
	263	}
	264
5bb6b1ea PZ	265	extern __read_mostly int sched_clock_running;
5bb6b1ea PZ	266
a48da48b	267	static void print_cpu(struct seq_file *m, int cpu)
43ae34cb	268	{
348ec61e	269	struct rq *rq = cpu_rq(cpu);
efe25c2c	270	unsigned long flags;
43ae34cb IM	271
	272	#ifdef CONFIG_X86
	273	{
	274	unsigned int freq = cpu_khz ? : 1;
	275
bbbfeac9	276	SEQ_printf(m, "cpu#%d, %u.%03u MHz\n",
43ae34cb IM	277	cpu, freq / 1000, (freq % 1000));
	278	}
	279	#else
bbbfeac9	280	SEQ_printf(m, "cpu#%d\n", cpu);
43ae34cb IM	281	#endif
43ae34cb IM	282
13e099d2 PZ	283	#define P(x) \
	284	do { \
	285	if (sizeof(rq->x) == 4) \
	286	SEQ_printf(m, " .%-30s: %ld\n", #x, (long)(rq->x)); \
	287	else \
	288	SEQ_printf(m, " .%-30s: %Ld\n", #x, (long long)(rq->x));\
	289	} while (0)
	290
ef83a571 IM	291	#define PN(x) \
ef83a571 IM	292	SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rq->x))
43ae34cb IM	293
	294	P(nr_running);
	295	SEQ_printf(m, " .%-30s: %lu\n", "load",
495eca49	296	rq->load.weight);
43ae34cb IM	297	P(nr_switches);
	298	P(nr_load_updates);
	299	P(nr_uninterruptible);
ef83a571	300	PN(next_balance);
fc840914	301	SEQ_printf(m, " .%-30s: %ld\n", "curr->pid", (long)(task_pid_nr(rq->curr)));
ef83a571	302	PN(clock);
5a537597	303	PN(clock_task);
43ae34cb IM	304	P(cpu_load[0]);
	305	P(cpu_load[1]);
	306	P(cpu_load[2]);
	307	P(cpu_load[3]);
	308	P(cpu_load[4]);
	309	#undef P
ef83a571	310	#undef PN
43ae34cb	311
5ac5c4d6 PZ	312	#ifdef CONFIG_SCHEDSTATS
5ac5c4d6 PZ	313	#define P(n) SEQ_printf(m, " .%-30s: %d\n", #n, rq->n);
1b9508f6	314	#define P64(n) SEQ_printf(m, " .%-30s: %Ld\n", #n, rq->n);
5ac5c4d6	315
5ac5c4d6 PZ	316	P(yld_count);
5ac5c4d6 PZ	317
5ac5c4d6 PZ	318	P(sched_count);
5ac5c4d6 PZ	319	P(sched_goidle);
1b9508f6 MG	320	#ifdef CONFIG_SMP
1b9508f6 MG	321	P64(avg_idle);
37e6bae8	322	P64(max_idle_balance_cost);
1b9508f6	323	#endif
5ac5c4d6 PZ	324
	325	P(ttwu_count);
	326	P(ttwu_local);
	327
5ac5c4d6	328	#undef P
fce20979	329	#undef P64
5ac5c4d6	330	#endif
efe25c2c	331	spin_lock_irqsave(&sched_debug_lock, flags);
5cef9eca	332	print_cfs_stats(m, cpu);
ada18de2	333	print_rt_stats(m, cpu);
acb32132	334	print_dl_stats(m, cpu);
43ae34cb	335
a48da48b	336	print_rq(m, rq, cpu);
efe25c2c	337	spin_unlock_irqrestore(&sched_debug_lock, flags);
bbbfeac9	338	SEQ_printf(m, "\n");
43ae34cb IM	339	}
43ae34cb IM	340
1983a922 CE	341	static const char *sched_tunable_scaling_names[] = {
	342	"none",
	343	"logaritmic",
	344	"linear"
	345	};
	346
bbbfeac9	347	static void sched_debug_header(struct seq_file *m)
43ae34cb	348	{
5bb6b1ea PZ	349	u64 ktime, sched_clk, cpu_clk;
5bb6b1ea PZ	350	unsigned long flags;
43ae34cb	351
5bb6b1ea PZ	352	local_irq_save(flags);
	353	ktime = ktime_to_ns(ktime_get());
	354	sched_clk = sched_clock();
	355	cpu_clk = local_clock();
	356	local_irq_restore(flags);
	357
b32e86b4	358	SEQ_printf(m, "Sched Debug Version: v0.11, %s %.*s\n",
43ae34cb IM	359	init_utsname()->release,
	360	(int)strcspn(init_utsname()->version, " "),
	361	init_utsname()->version);
	362
5bb6b1ea PZ	363	#define P(x) \
	364	SEQ_printf(m, "%-40s: %Ld\n", #x, (long long)(x))
	365	#define PN(x) \
	366	SEQ_printf(m, "%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
	367	PN(ktime);
	368	PN(sched_clk);
	369	PN(cpu_clk);
	370	P(jiffies);
	371	#ifdef CONFIG_HAVE_UNSTABLE_SCHED_CLOCK
35af99e6	372	P(sched_clock_stable());
5bb6b1ea PZ	373	#endif
	374	#undef PN
	375	#undef P
	376
	377	SEQ_printf(m, "\n");
	378	SEQ_printf(m, "sysctl_sched\n");
43ae34cb	379
1aa4731e	380	#define P(x) \
d822cece	381	SEQ_printf(m, " .%-40s: %Ld\n", #x, (long long)(x))
1aa4731e	382	#define PN(x) \
d822cece	383	SEQ_printf(m, " .%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
1aa4731e	384	PN(sysctl_sched_latency);
b2be5e96	385	PN(sysctl_sched_min_granularity);
1aa4731e	386	PN(sysctl_sched_wakeup_granularity);
eebef746	387	P(sysctl_sched_child_runs_first);
1aa4731e IM	388	P(sysctl_sched_features);
	389	#undef PN
	390	#undef P
	391
bbbfeac9 NZ	392	SEQ_printf(m, " .%-40s: %d (%s)\n",
bbbfeac9 NZ	393	"sysctl_sched_tunable_scaling",
1983a922 CE	394	sysctl_sched_tunable_scaling,
1983a922 CE	395	sched_tunable_scaling_names[sysctl_sched_tunable_scaling]);
bbbfeac9 NZ	396	SEQ_printf(m, "\n");
bbbfeac9 NZ	397	}
1983a922	398
bbbfeac9 NZ	399	static int sched_debug_show(struct seq_file m, void v)
	400	{
	401	int cpu = (unsigned long)(v - 2);
43ae34cb	402
bbbfeac9 NZ	403	if (cpu != -1)
	404	print_cpu(m, cpu);
	405	else
	406	sched_debug_header(m);
43ae34cb IM	407
	408	return 0;
	409	}
	410
029632fb	411	void sysrq_sched_debug_show(void)
43ae34cb	412	{
bbbfeac9 NZ	413	int cpu;
	414
	415	sched_debug_header(NULL);
	416	for_each_online_cpu(cpu)
	417	print_cpu(NULL, cpu);
	418
	419	}
	420
	421	/*
	422	* This itererator needs some explanation.
	423	* It returns 1 for the header position.
	424	* This means 2 is cpu 0.
	425	* In a hotplugged system some cpus, including cpu 0, may be missing so we have
	426	* to use cpumask_* to iterate over the cpus.
	427	*/
	428	static void sched_debug_start(struct seq_file file, loff_t *offset)
	429	{
	430	unsigned long n = *offset;
	431
	432	if (n == 0)
	433	return (void *) 1;
	434
	435	n--;
	436
	437	if (n > 0)
	438	n = cpumask_next(n - 1, cpu_online_mask);
	439	else
	440	n = cpumask_first(cpu_online_mask);
	441
	442	*offset = n + 1;
	443
	444	if (n < nr_cpu_ids)
	445	return (void *)(unsigned long)(n + 2);
	446	return NULL;
	447	}
	448
	449	static void sched_debug_next(struct seq_file file, void data, loff_t offset)
	450	{
	451	(*offset)++;
	452	return sched_debug_start(file, offset);
	453	}
	454
	455	static void sched_debug_stop(struct seq_file file, void data)
	456	{
	457	}
	458
	459	static const struct seq_operations sched_debug_sops = {
	460	.start = sched_debug_start,
	461	.next = sched_debug_next,
	462	.stop = sched_debug_stop,
	463	.show = sched_debug_show,
	464	};
	465
	466	static int sched_debug_release(struct inode inode, struct file file)
	467	{
	468	seq_release(inode, file);
	469
	470	return 0;
43ae34cb IM	471	}
	472
	473	static int sched_debug_open(struct inode inode, struct file filp)
	474	{
bbbfeac9 NZ	475	int ret = 0;
	476
	477	ret = seq_open(filp, &sched_debug_sops);
	478
	479	return ret;
43ae34cb IM	480	}
43ae34cb IM	481
0dbee3a6	482	static const struct file_operations sched_debug_fops = {
43ae34cb IM	483	.open = sched_debug_open,
	484	.read = seq_read,
	485	.llseek = seq_lseek,
bbbfeac9	486	.release = sched_debug_release,
43ae34cb IM	487	};
	488
	489	static int __init init_sched_debug_procfs(void)
	490	{
	491	struct proc_dir_entry *pe;
	492
a9cf4ddb	493	pe = proc_create("sched_debug", 0444, NULL, &sched_debug_fops);
43ae34cb IM	494	if (!pe)
43ae34cb IM	495	return -ENOMEM;
43ae34cb IM	496	return 0;
	497	}
	498
	499	__initcall(init_sched_debug_procfs);
	500
b32e86b4 IM	501	#define __P(F) \
	502	SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)F)
	503	#define P(F) \
	504	SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)p->F)
	505	#define __PN(F) \
	506	SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)F))
	507	#define PN(F) \
	508	SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)p->F))
	509
	510
397f2378 SD	511	#ifdef CONFIG_NUMA_BALANCING
	512	void print_numa_stats(struct seq_file *m, int node, unsigned long tsf,
	513	unsigned long tpf, unsigned long gsf, unsigned long gpf)
	514	{
	515	SEQ_printf(m, "numa_faults node=%d ", node);
	516	SEQ_printf(m, "task_private=%lu task_shared=%lu ", tsf, tpf);
	517	SEQ_printf(m, "group_private=%lu group_shared=%lu\n", gsf, gpf);
	518	}
	519	#endif
	520
	521
b32e86b4 IM	522	static void sched_show_numa(struct task_struct p, struct seq_file m)
	523	{
	524	#ifdef CONFIG_NUMA_BALANCING
	525	struct mempolicy *pol;
b32e86b4 IM	526
	527	if (p->mm)
	528	P(mm->numa_scan_seq);
	529
	530	task_lock(p);
	531	pol = p->mempolicy;
	532	if (pol && !(pol->flags & MPOL_F_MORON))
	533	pol = NULL;
	534	mpol_get(pol);
	535	task_unlock(p);
	536
397f2378 SD	537	P(numa_pages_migrated);
	538	P(numa_preferred_nid);
	539	P(total_numa_faults);
	540	SEQ_printf(m, "current_node=%d, numa_group_id=%d\n",
	541	task_node(p), task_numa_group_id(p));
	542	show_numa_stats(p, m);
b32e86b4 IM	543	mpol_put(pol);
	544	#endif
	545	}
	546
43ae34cb IM	547	void proc_sched_show_task(struct task_struct p, struct seq_file m)
43ae34cb IM	548	{
cc367732	549	unsigned long nr_switches;
43ae34cb	550
fc840914	551	SEQ_printf(m, "%s (%d, #threads: %d)\n", p->comm, task_pid_nr(p),
5089a976	552	get_nr_threads(p));
2d92f227	553	SEQ_printf(m,
add332a1 KB	554	"---------------------------------------------------------"
add332a1 KB	555	"----------\n");
cc367732	556	#define __P(F) \
add332a1	557	SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)F)
43ae34cb	558	#define P(F) \
add332a1	559	SEQ_printf(m, "%-45s:%21Ld\n", #F, (long long)p->F)
cc367732	560	#define __PN(F) \
add332a1	561	SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)F))
ef83a571	562	#define PN(F) \
add332a1	563	SEQ_printf(m, "%-45s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)p->F))
43ae34cb	564
ef83a571 IM	565	PN(se.exec_start);
	566	PN(se.vruntime);
	567	PN(se.sum_exec_runtime);
6cfb0d5d	568
cc367732 IM	569	nr_switches = p->nvcsw + p->nivcsw;
cc367732 IM	570
6cfb0d5d	571	#ifdef CONFIG_SCHEDSTATS
82a0d276	572	PN(se.statistics.sum_sleep_runtime);
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
9d89c257 YD	630	P(se.avg.load_sum);
	631	P(se.avg.util_sum);
	632	P(se.avg.load_avg);
	633	P(se.avg.util_avg);
	634	P(se.avg.last_update_time);
939fd731	635	#endif
43ae34cb IM	636	P(policy);
43ae34cb IM	637	P(prio);
ef83a571	638	#undef PN
cc367732 IM	639	#undef __PN
	640	#undef P
	641	#undef __P
43ae34cb IM	642
43ae34cb IM	643	{
29d7b90c	644	unsigned int this_cpu = raw_smp_processor_id();
43ae34cb IM	645	u64 t0, t1;
43ae34cb IM	646
29d7b90c IM	647	t0 = cpu_clock(this_cpu);
29d7b90c IM	648	t1 = cpu_clock(this_cpu);
add332a1	649	SEQ_printf(m, "%-45s:%21Ld\n",
43ae34cb IM	650	"clock-delta", (long long)(t1-t0));
43ae34cb IM	651	}
b32e86b4 IM	652
b32e86b4 IM	653	sched_show_numa(p, m);
43ae34cb IM	654	}
	655
	656	void proc_sched_set_task(struct task_struct *p)
	657	{
6cfb0d5d	658	#ifdef CONFIG_SCHEDSTATS
41acab88	659	memset(&p->se.statistics, 0, sizeof(p->se.statistics));
6cfb0d5d	660	#endif
43ae34cb	661	}