sched_debug.c 10.2 KB
Newer Older
I
Ingo Molnar 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
/*
 * kernel/time/sched_debug.c
 *
 * Print the CFS rbtree
 *
 * Copyright(C) 2007, Red Hat, Inc., Ingo Molnar
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License version 2 as
 * published by the Free Software Foundation.
 */

#include <linux/proc_fs.h>
#include <linux/sched.h>
#include <linux/seq_file.h>
#include <linux/kallsyms.h>
#include <linux/utsname.h>

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

I
Ingo Molnar 已提交
31 32 33
/*
 * Ease the printing of nsec fields:
 */
I
Ingo Molnar 已提交
34
static long long nsec_high(unsigned long long nsec)
I
Ingo Molnar 已提交
35
{
I
Ingo Molnar 已提交
36
	if ((long long)nsec < 0) {
I
Ingo Molnar 已提交
37 38 39 40 41 42 43 44 45
		nsec = -nsec;
		do_div(nsec, 1000000);
		return -nsec;
	}
	do_div(nsec, 1000000);

	return nsec;
}

I
Ingo Molnar 已提交
46
static unsigned long nsec_low(unsigned long long nsec)
I
Ingo Molnar 已提交
47
{
I
Ingo Molnar 已提交
48
	if ((long long)nsec < 0)
I
Ingo Molnar 已提交
49 50 51 52 53 54 55
		nsec = -nsec;

	return do_div(nsec, 1000000);
}

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

I
Ingo Molnar 已提交
56
static void
57
print_task(struct seq_file *m, struct rq *rq, struct task_struct *p)
I
Ingo Molnar 已提交
58 59 60 61 62 63
{
	if (rq->curr == p)
		SEQ_printf(m, "R");
	else
		SEQ_printf(m, " ");

I
Ingo Molnar 已提交
64
	SEQ_printf(m, "%15s %5d %9Ld.%06ld %9Ld %5d ",
I
Ingo Molnar 已提交
65
		p->comm, p->pid,
I
Ingo Molnar 已提交
66
		SPLIT_NS(p->se.vruntime),
I
Ingo Molnar 已提交
67
		(long long)(p->nvcsw + p->nivcsw),
68
		p->prio);
I
Ingo Molnar 已提交
69
#ifdef CONFIG_SCHEDSTATS
70
	SEQ_printf(m, "%9Ld.%06ld %9Ld.%06ld %9Ld.%06ld",
I
Ingo Molnar 已提交
71 72 73
		SPLIT_NS(p->se.vruntime),
		SPLIT_NS(p->se.sum_exec_runtime),
		SPLIT_NS(p->se.sum_sleep_runtime));
I
Ingo Molnar 已提交
74
#else
75
	SEQ_printf(m, "%15Ld %15Ld %15Ld.%06ld %15Ld.%06ld %15Ld.%06ld",
I
Ingo Molnar 已提交
76
		0LL, 0LL, 0LL, 0L, 0LL, 0L, 0LL, 0L);
I
Ingo Molnar 已提交
77
#endif
78 79 80 81 82 83 84 85 86 87

#ifdef CONFIG_CGROUP_SCHED
	{
		char path[64];

		cgroup_path(task_group(p)->css.cgroup, path, sizeof(path));
		SEQ_printf(m, " %s", path);
	}
#endif
	SEQ_printf(m, "\n");
I
Ingo Molnar 已提交
88 89
}

90
static void print_rq(struct seq_file *m, struct rq *rq, int rq_cpu)
I
Ingo Molnar 已提交
91 92
{
	struct task_struct *g, *p;
P
Peter Zijlstra 已提交
93
	unsigned long flags;
I
Ingo Molnar 已提交
94 95 96

	SEQ_printf(m,
	"\nrunnable tasks:\n"
97 98
	"            task   PID         tree-key  switches  prio"
	"     exec-runtime         sum-exec        sum-sleep\n"
99
	"------------------------------------------------------"
100
	"----------------------------------------------------\n");
I
Ingo Molnar 已提交
101

P
Peter Zijlstra 已提交
102
	read_lock_irqsave(&tasklist_lock, flags);
I
Ingo Molnar 已提交
103 104 105 106 107

	do_each_thread(g, p) {
		if (!p->se.on_rq || task_cpu(p) != rq_cpu)
			continue;

108
		print_task(m, rq, p);
I
Ingo Molnar 已提交
109 110
	} while_each_thread(g, p);

P
Peter Zijlstra 已提交
111
	read_unlock_irqrestore(&tasklist_lock, flags);
I
Ingo Molnar 已提交
112 113
}

114
void print_cfs_rq(struct seq_file *m, int cpu, struct cfs_rq *cfs_rq)
I
Ingo Molnar 已提交
115
{
I
Ingo Molnar 已提交
116 117
	s64 MIN_vruntime = -1, min_vruntime, max_vruntime = -1,
		spread, rq0_min_vruntime, spread0;
I
Ingo Molnar 已提交
118 119 120 121
	struct rq *rq = &per_cpu(runqueues, cpu);
	struct sched_entity *last;
	unsigned long flags;

122
#if defined(CONFIG_CGROUP_SCHED) && defined(CONFIG_FAIR_GROUP_SCHED)
123 124 125 126 127 128 129 130 131 132 133
	char path[128] = "";
	struct cgroup *cgroup = NULL;
	struct task_group *tg = cfs_rq->tg;

	if (tg)
		cgroup = tg->css.cgroup;

	if (cgroup)
		cgroup_path(cgroup, path, sizeof(path));

	SEQ_printf(m, "\ncfs_rq[%d]:%s\n", cpu, path);
134 135
#else
	SEQ_printf(m, "\ncfs_rq[%d]:\n", cpu);
136
#endif
I
Ingo Molnar 已提交
137

I
Ingo Molnar 已提交
138 139
	SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", "exec_clock",
			SPLIT_NS(cfs_rq->exec_clock));
I
Ingo Molnar 已提交
140 141 142 143 144 145 146

	spin_lock_irqsave(&rq->lock, flags);
	if (cfs_rq->rb_leftmost)
		MIN_vruntime = (__pick_next_entity(cfs_rq))->vruntime;
	last = __pick_last_entity(cfs_rq);
	if (last)
		max_vruntime = last->vruntime;
I
Ingo Molnar 已提交
147 148
	min_vruntime = rq->cfs.min_vruntime;
	rq0_min_vruntime = per_cpu(runqueues, 0).cfs.min_vruntime;
I
Ingo Molnar 已提交
149
	spin_unlock_irqrestore(&rq->lock, flags);
I
Ingo Molnar 已提交
150 151 152 153 154 155
	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));
I
Ingo Molnar 已提交
156
	spread = max_vruntime - MIN_vruntime;
I
Ingo Molnar 已提交
157 158
	SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", "spread",
			SPLIT_NS(spread));
I
Ingo Molnar 已提交
159
	spread0 = min_vruntime - rq0_min_vruntime;
I
Ingo Molnar 已提交
160 161
	SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", "spread0",
			SPLIT_NS(spread0));
162 163
	SEQ_printf(m, "  .%-30s: %ld\n", "nr_running", cfs_rq->nr_running);
	SEQ_printf(m, "  .%-30s: %ld\n", "load", cfs_rq->load.weight);
164
#ifdef CONFIG_SCHEDSTATS
165
	SEQ_printf(m, "  .%-30s: %d\n", "bkl_count",
166
			rq->bkl_count);
167
#endif
P
Peter Zijlstra 已提交
168 169
	SEQ_printf(m, "  .%-30s: %ld\n", "nr_spread_over",
			cfs_rq->nr_spread_over);
I
Ingo Molnar 已提交
170 171
}

172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204
void print_rt_rq(struct seq_file *m, int cpu, struct rt_rq *rt_rq)
{
#if defined(CONFIG_CGROUP_SCHED) && defined(CONFIG_RT_GROUP_SCHED)
	char path[128] = "";
	struct cgroup *cgroup = NULL;
	struct task_group *tg = rt_rq->tg;

	if (tg)
		cgroup = tg->css.cgroup;

	if (cgroup)
		cgroup_path(cgroup, path, sizeof(path));

	SEQ_printf(m, "\nrt_rq[%d]:%s\n", cpu, path);
#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
}

205
static void print_cpu(struct seq_file *m, int cpu)
I
Ingo Molnar 已提交
206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221
{
	struct rq *rq = &per_cpu(runqueues, cpu);

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

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

#define P(x) \
	SEQ_printf(m, "  .%-30s: %Ld\n", #x, (long long)(rq->x))
I
Ingo Molnar 已提交
222 223
#define PN(x) \
	SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rq->x))
I
Ingo Molnar 已提交
224 225 226

	P(nr_running);
	SEQ_printf(m, "  .%-30s: %lu\n", "load",
227
		   rq->load.weight);
I
Ingo Molnar 已提交
228 229 230 231
	P(nr_switches);
	P(nr_load_updates);
	P(nr_uninterruptible);
	SEQ_printf(m, "  .%-30s: %lu\n", "jiffies", jiffies);
I
Ingo Molnar 已提交
232
	PN(next_balance);
I
Ingo Molnar 已提交
233
	P(curr->pid);
I
Ingo Molnar 已提交
234
	PN(clock);
I
Ingo Molnar 已提交
235 236 237 238 239 240
	P(cpu_load[0]);
	P(cpu_load[1]);
	P(cpu_load[2]);
	P(cpu_load[3]);
	P(cpu_load[4]);
#undef P
I
Ingo Molnar 已提交
241
#undef PN
I
Ingo Molnar 已提交
242

243
	print_cfs_stats(m, cpu);
244
	print_rt_stats(m, cpu);
I
Ingo Molnar 已提交
245

246
	print_rq(m, rq, cpu);
I
Ingo Molnar 已提交
247 248 249 250 251 252 253
}

static int sched_debug_show(struct seq_file *m, void *v)
{
	u64 now = ktime_to_ns(ktime_get());
	int cpu;

254
	SEQ_printf(m, "Sched Debug Version: v0.07, %s %.*s\n",
I
Ingo Molnar 已提交
255 256 257 258
		init_utsname()->release,
		(int)strcspn(init_utsname()->version, " "),
		init_utsname()->version);

I
Ingo Molnar 已提交
259
	SEQ_printf(m, "now at %Lu.%06ld msecs\n", SPLIT_NS(now));
I
Ingo Molnar 已提交
260

I
Ingo Molnar 已提交
261
#define P(x) \
262
	SEQ_printf(m, "  .%-40s: %Ld\n", #x, (long long)(x))
I
Ingo Molnar 已提交
263
#define PN(x) \
264
	SEQ_printf(m, "  .%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
I
Ingo Molnar 已提交
265
	PN(sysctl_sched_latency);
266
	PN(sysctl_sched_min_granularity);
I
Ingo Molnar 已提交
267 268 269 270 271 272
	PN(sysctl_sched_wakeup_granularity);
	PN(sysctl_sched_child_runs_first);
	P(sysctl_sched_features);
#undef PN
#undef P

I
Ingo Molnar 已提交
273
	for_each_online_cpu(cpu)
274
		print_cpu(m, cpu);
I
Ingo Molnar 已提交
275 276 277 278 279 280

	SEQ_printf(m, "\n");

	return 0;
}

281
static void sysrq_sched_debug_show(void)
I
Ingo Molnar 已提交
282 283 284 285 286 287 288 289 290
{
	sched_debug_show(NULL, NULL);
}

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

291
static const struct file_operations sched_debug_fops = {
I
Ingo Molnar 已提交
292 293 294
	.open		= sched_debug_open,
	.read		= seq_read,
	.llseek		= seq_lseek,
295
	.release	= single_release,
I
Ingo Molnar 已提交
296 297 298 299 300 301
};

static int __init init_sched_debug_procfs(void)
{
	struct proc_dir_entry *pe;

302
	pe = proc_create("sched_debug", 0644, NULL, &sched_debug_fops);
I
Ingo Molnar 已提交
303 304 305 306 307 308 309 310 311
	if (!pe)
		return -ENOMEM;
	return 0;
}

__initcall(init_sched_debug_procfs);

void proc_sched_show_task(struct task_struct *p, struct seq_file *m)
{
312
	unsigned long nr_switches;
I
Ingo Molnar 已提交
313 314 315 316 317 318 319 320 321 322 323
	unsigned long flags;
	int num_threads = 1;

	rcu_read_lock();
	if (lock_task_sighand(p, &flags)) {
		num_threads = atomic_read(&p->signal->count);
		unlock_task_sighand(p, &flags);
	}
	rcu_read_unlock();

	SEQ_printf(m, "%s (%d, #threads: %d)\n", p->comm, p->pid, num_threads);
324 325
	SEQ_printf(m,
		"---------------------------------------------------------\n");
326 327
#define __P(F) \
	SEQ_printf(m, "%-35s:%21Ld\n", #F, (long long)F)
I
Ingo Molnar 已提交
328
#define P(F) \
329
	SEQ_printf(m, "%-35s:%21Ld\n", #F, (long long)p->F)
330 331
#define __PN(F) \
	SEQ_printf(m, "%-35s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)F))
I
Ingo Molnar 已提交
332
#define PN(F) \
333
	SEQ_printf(m, "%-35s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)p->F))
I
Ingo Molnar 已提交
334

I
Ingo Molnar 已提交
335 336 337
	PN(se.exec_start);
	PN(se.vruntime);
	PN(se.sum_exec_runtime);
I
Ingo Molnar 已提交
338
	PN(se.avg_overlap);
I
Ingo Molnar 已提交
339

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

I
Ingo Molnar 已提交
342
#ifdef CONFIG_SCHEDSTATS
I
Ingo Molnar 已提交
343 344 345 346 347 348 349 350
	PN(se.wait_start);
	PN(se.sleep_start);
	PN(se.block_start);
	PN(se.sleep_max);
	PN(se.block_max);
	PN(se.exec_max);
	PN(se.slice_max);
	PN(se.wait_max);
351 352
	PN(se.wait_sum);
	P(se.wait_count);
353
	P(sched_info.bkl_count);
354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380
	P(se.nr_migrations);
	P(se.nr_migrations_cold);
	P(se.nr_failed_migrations_affine);
	P(se.nr_failed_migrations_running);
	P(se.nr_failed_migrations_hot);
	P(se.nr_forced_migrations);
	P(se.nr_forced2_migrations);
	P(se.nr_wakeups);
	P(se.nr_wakeups_sync);
	P(se.nr_wakeups_migrate);
	P(se.nr_wakeups_local);
	P(se.nr_wakeups_remote);
	P(se.nr_wakeups_affine);
	P(se.nr_wakeups_affine_attempts);
	P(se.nr_wakeups_passive);
	P(se.nr_wakeups_idle);

	{
		u64 avg_atom, avg_per_cpu;

		avg_atom = p->se.sum_exec_runtime;
		if (nr_switches)
			do_div(avg_atom, nr_switches);
		else
			avg_atom = -1LL;

		avg_per_cpu = p->se.sum_exec_runtime;
381
		if (p->se.nr_migrations) {
R
Roman Zippel 已提交
382 383
			avg_per_cpu = div64_u64(avg_per_cpu,
						p->se.nr_migrations);
384
		} else {
385
			avg_per_cpu = -1LL;
386
		}
387 388 389 390

		__PN(avg_atom);
		__PN(avg_per_cpu);
	}
I
Ingo Molnar 已提交
391
#endif
392
	__P(nr_switches);
393
	SEQ_printf(m, "%-35s:%21Ld\n",
394 395 396 397
		   "nr_voluntary_switches", (long long)p->nvcsw);
	SEQ_printf(m, "%-35s:%21Ld\n",
		   "nr_involuntary_switches", (long long)p->nivcsw);

I
Ingo Molnar 已提交
398 399 400
	P(se.load.weight);
	P(policy);
	P(prio);
I
Ingo Molnar 已提交
401
#undef PN
402 403 404
#undef __PN
#undef P
#undef __P
I
Ingo Molnar 已提交
405 406 407 408 409 410

	{
		u64 t0, t1;

		t0 = sched_clock();
		t1 = sched_clock();
411
		SEQ_printf(m, "%-35s:%21Ld\n",
I
Ingo Molnar 已提交
412 413 414 415 416 417
			   "clock-delta", (long long)(t1-t0));
	}
}

void proc_sched_set_task(struct task_struct *p)
{
I
Ingo Molnar 已提交
418
#ifdef CONFIG_SCHEDSTATS
419
	p->se.wait_max				= 0;
420 421
	p->se.wait_sum				= 0;
	p->se.wait_count			= 0;
422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443
	p->se.sleep_max				= 0;
	p->se.sum_sleep_runtime			= 0;
	p->se.block_max				= 0;
	p->se.exec_max				= 0;
	p->se.slice_max				= 0;
	p->se.nr_migrations			= 0;
	p->se.nr_migrations_cold		= 0;
	p->se.nr_failed_migrations_affine	= 0;
	p->se.nr_failed_migrations_running	= 0;
	p->se.nr_failed_migrations_hot		= 0;
	p->se.nr_forced_migrations		= 0;
	p->se.nr_forced2_migrations		= 0;
	p->se.nr_wakeups			= 0;
	p->se.nr_wakeups_sync			= 0;
	p->se.nr_wakeups_migrate		= 0;
	p->se.nr_wakeups_local			= 0;
	p->se.nr_wakeups_remote			= 0;
	p->se.nr_wakeups_affine			= 0;
	p->se.nr_wakeups_affine_attempts	= 0;
	p->se.nr_wakeups_passive		= 0;
	p->se.nr_wakeups_idle			= 0;
	p->sched_info.bkl_count			= 0;
I
Ingo Molnar 已提交
444
#endif
445 446 447 448
	p->se.sum_exec_runtime			= 0;
	p->se.prev_sum_exec_runtime		= 0;
	p->nvcsw				= 0;
	p->nivcsw				= 0;
I
Ingo Molnar 已提交
449
}