debug.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528
  1. /*
  2. * kernel/sched/debug.c
  3. *
  4. * Print the CFS rbtree
  5. *
  6. * Copyright(C) 2007, Red Hat, Inc., Ingo Molnar
  7. *
  8. * This program is free software; you can redistribute it and/or modify
  9. * it under the terms of the GNU General Public License version 2 as
  10. * published by the Free Software Foundation.
  11. */
  12. #include <linux/proc_fs.h>
  13. #include <linux/sched.h>
  14. #include <linux/seq_file.h>
  15. #include <linux/kallsyms.h>
  16. #include <linux/utsname.h>
  17. #include "sched.h"
  18. static DEFINE_SPINLOCK(sched_debug_lock);
  19. /*
  20. * This allows printing both to /proc/sched_debug and
  21. * to the console
  22. */
  23. #define SEQ_printf(m, x...) \
  24. do { \
  25. if (m) \
  26. seq_printf(m, x); \
  27. else \
  28. printk(x); \
  29. } while (0)
  30. /*
  31. * Ease the printing of nsec fields:
  32. */
  33. static long long nsec_high(unsigned long long nsec)
  34. {
  35. if ((long long)nsec < 0) {
  36. nsec = -nsec;
  37. do_div(nsec, 1000000);
  38. return -nsec;
  39. }
  40. do_div(nsec, 1000000);
  41. return nsec;
  42. }
  43. static unsigned long nsec_low(unsigned long long nsec)
  44. {
  45. if ((long long)nsec < 0)
  46. nsec = -nsec;
  47. return do_div(nsec, 1000000);
  48. }
  49. #define SPLIT_NS(x) nsec_high(x), nsec_low(x)
  50. #ifdef CONFIG_FAIR_GROUP_SCHED
  51. static void print_cfs_group_stats(struct seq_file *m, int cpu, struct task_group *tg)
  52. {
  53. struct sched_entity *se = tg->se[cpu];
  54. #define P(F) \
  55. SEQ_printf(m, " .%-30s: %lld\n", #F, (long long)F)
  56. #define PN(F) \
  57. SEQ_printf(m, " .%-30s: %lld.%06ld\n", #F, SPLIT_NS((long long)F))
  58. if (!se) {
  59. struct sched_avg *avg = &cpu_rq(cpu)->avg;
  60. P(avg->runnable_avg_sum);
  61. P(avg->runnable_avg_period);
  62. return;
  63. }
  64. PN(se->exec_start);
  65. PN(se->vruntime);
  66. PN(se->sum_exec_runtime);
  67. #ifdef CONFIG_SCHEDSTATS
  68. PN(se->statistics.wait_start);
  69. PN(se->statistics.sleep_start);
  70. PN(se->statistics.block_start);
  71. PN(se->statistics.sleep_max);
  72. PN(se->statistics.block_max);
  73. PN(se->statistics.exec_max);
  74. PN(se->statistics.slice_max);
  75. PN(se->statistics.wait_max);
  76. PN(se->statistics.wait_sum);
  77. P(se->statistics.wait_count);
  78. #endif
  79. P(se->load.weight);
  80. #ifdef CONFIG_SMP
  81. P(se->avg.runnable_avg_sum);
  82. P(se->avg.runnable_avg_period);
  83. P(se->avg.load_avg_contrib);
  84. #endif
  85. #undef PN
  86. #undef P
  87. }
  88. #endif
  89. #ifdef CONFIG_CGROUP_SCHED
  90. static char group_path[PATH_MAX];
  91. static char *task_group_path(struct task_group *tg)
  92. {
  93. if (autogroup_path(tg, group_path, PATH_MAX))
  94. return group_path;
  95. /*
  96. * May be NULL if the underlying cgroup isn't fully-created yet
  97. */
  98. if (!tg->css.cgroup) {
  99. group_path[0] = '\0';
  100. return group_path;
  101. }
  102. cgroup_path(tg->css.cgroup, group_path, PATH_MAX);
  103. return group_path;
  104. }
  105. #endif
  106. static void
  107. print_task(struct seq_file *m, struct rq *rq, struct task_struct *p)
  108. {
  109. if (rq->curr == p)
  110. SEQ_printf(m, "R");
  111. else
  112. SEQ_printf(m, " ");
  113. SEQ_printf(m, "%15s %5d %9Ld.%06ld %9Ld %5d ",
  114. p->comm, p->pid,
  115. SPLIT_NS(p->se.vruntime),
  116. (long long)(p->nvcsw + p->nivcsw),
  117. p->prio);
  118. #ifdef CONFIG_SCHEDSTATS
  119. SEQ_printf(m, "%9Ld.%06ld %9Ld.%06ld %9Ld.%06ld",
  120. SPLIT_NS(p->se.vruntime),
  121. SPLIT_NS(p->se.sum_exec_runtime),
  122. SPLIT_NS(p->se.statistics.sum_sleep_runtime));
  123. #else
  124. SEQ_printf(m, "%15Ld %15Ld %15Ld.%06ld %15Ld.%06ld %15Ld.%06ld",
  125. 0LL, 0LL, 0LL, 0L, 0LL, 0L, 0LL, 0L);
  126. #endif
  127. #ifdef CONFIG_CGROUP_SCHED
  128. SEQ_printf(m, " %s", task_group_path(task_group(p)));
  129. #endif
  130. SEQ_printf(m, "\n");
  131. }
  132. static void print_rq(struct seq_file *m, struct rq *rq, int rq_cpu)
  133. {
  134. struct task_struct *g, *p;
  135. unsigned long flags;
  136. SEQ_printf(m,
  137. "\nrunnable tasks:\n"
  138. " task PID tree-key switches prio"
  139. " exec-runtime sum-exec sum-sleep\n"
  140. "------------------------------------------------------"
  141. "----------------------------------------------------\n");
  142. read_lock_irqsave(&tasklist_lock, flags);
  143. do_each_thread(g, p) {
  144. if (!p->on_rq || task_cpu(p) != rq_cpu)
  145. continue;
  146. print_task(m, rq, p);
  147. } while_each_thread(g, p);
  148. read_unlock_irqrestore(&tasklist_lock, flags);
  149. }
  150. void print_cfs_rq(struct seq_file *m, int cpu, struct cfs_rq *cfs_rq)
  151. {
  152. s64 MIN_vruntime = -1, min_vruntime, max_vruntime = -1,
  153. spread, rq0_min_vruntime, spread0;
  154. struct rq *rq = cpu_rq(cpu);
  155. struct sched_entity *last;
  156. unsigned long flags;
  157. #ifdef CONFIG_FAIR_GROUP_SCHED
  158. SEQ_printf(m, "\ncfs_rq[%d]:%s\n", cpu, task_group_path(cfs_rq->tg));
  159. #else
  160. SEQ_printf(m, "\ncfs_rq[%d]:\n", cpu);
  161. #endif
  162. SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "exec_clock",
  163. SPLIT_NS(cfs_rq->exec_clock));
  164. raw_spin_lock_irqsave(&rq->lock, flags);
  165. if (cfs_rq->rb_leftmost)
  166. MIN_vruntime = (__pick_first_entity(cfs_rq))->vruntime;
  167. last = __pick_last_entity(cfs_rq);
  168. if (last)
  169. max_vruntime = last->vruntime;
  170. min_vruntime = cfs_rq->min_vruntime;
  171. rq0_min_vruntime = cpu_rq(0)->cfs.min_vruntime;
  172. raw_spin_unlock_irqrestore(&rq->lock, flags);
  173. SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "MIN_vruntime",
  174. SPLIT_NS(MIN_vruntime));
  175. SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "min_vruntime",
  176. SPLIT_NS(min_vruntime));
  177. SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "max_vruntime",
  178. SPLIT_NS(max_vruntime));
  179. spread = max_vruntime - MIN_vruntime;
  180. SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread",
  181. SPLIT_NS(spread));
  182. spread0 = min_vruntime - rq0_min_vruntime;
  183. SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "spread0",
  184. SPLIT_NS(spread0));
  185. SEQ_printf(m, " .%-30s: %d\n", "nr_spread_over",
  186. cfs_rq->nr_spread_over);
  187. SEQ_printf(m, " .%-30s: %d\n", "nr_running", cfs_rq->nr_running);
  188. SEQ_printf(m, " .%-30s: %ld\n", "load", cfs_rq->load.weight);
  189. #ifdef CONFIG_FAIR_GROUP_SCHED
  190. #ifdef CONFIG_SMP
  191. SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "load_avg",
  192. SPLIT_NS(cfs_rq->load_avg));
  193. SEQ_printf(m, " .%-30s: %Ld.%06ld\n", "load_period",
  194. SPLIT_NS(cfs_rq->load_period));
  195. SEQ_printf(m, " .%-30s: %ld\n", "load_contrib",
  196. cfs_rq->load_contribution);
  197. SEQ_printf(m, " .%-30s: %d\n", "load_tg",
  198. atomic_read(&cfs_rq->tg->load_weight));
  199. SEQ_printf(m, " .%-30s: %lld\n", "runnable_load_avg",
  200. cfs_rq->runnable_load_avg);
  201. #endif
  202. print_cfs_group_stats(m, cpu, cfs_rq->tg);
  203. #endif
  204. }
  205. void print_rt_rq(struct seq_file *m, int cpu, struct rt_rq *rt_rq)
  206. {
  207. #ifdef CONFIG_RT_GROUP_SCHED
  208. SEQ_printf(m, "\nrt_rq[%d]:%s\n", cpu, task_group_path(rt_rq->tg));
  209. #else
  210. SEQ_printf(m, "\nrt_rq[%d]:\n", cpu);
  211. #endif
  212. #define P(x) \
  213. SEQ_printf(m, " .%-30s: %Ld\n", #x, (long long)(rt_rq->x))
  214. #define PN(x) \
  215. SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rt_rq->x))
  216. P(rt_nr_running);
  217. P(rt_throttled);
  218. PN(rt_time);
  219. PN(rt_runtime);
  220. #undef PN
  221. #undef P
  222. }
  223. extern __read_mostly int sched_clock_running;
  224. static void print_cpu(struct seq_file *m, int cpu)
  225. {
  226. struct rq *rq = cpu_rq(cpu);
  227. unsigned long flags;
  228. #ifdef CONFIG_X86
  229. {
  230. unsigned int freq = cpu_khz ? : 1;
  231. SEQ_printf(m, "\ncpu#%d, %u.%03u MHz\n",
  232. cpu, freq / 1000, (freq % 1000));
  233. }
  234. #else
  235. SEQ_printf(m, "\ncpu#%d\n", cpu);
  236. #endif
  237. #define P(x) \
  238. do { \
  239. if (sizeof(rq->x) == 4) \
  240. SEQ_printf(m, " .%-30s: %ld\n", #x, (long)(rq->x)); \
  241. else \
  242. SEQ_printf(m, " .%-30s: %Ld\n", #x, (long long)(rq->x));\
  243. } while (0)
  244. #define PN(x) \
  245. SEQ_printf(m, " .%-30s: %Ld.%06ld\n", #x, SPLIT_NS(rq->x))
  246. P(nr_running);
  247. SEQ_printf(m, " .%-30s: %lu\n", "load",
  248. rq->load.weight);
  249. P(nr_switches);
  250. P(nr_load_updates);
  251. P(nr_uninterruptible);
  252. PN(next_balance);
  253. P(curr->pid);
  254. PN(clock);
  255. P(cpu_load[0]);
  256. P(cpu_load[1]);
  257. P(cpu_load[2]);
  258. P(cpu_load[3]);
  259. P(cpu_load[4]);
  260. #undef P
  261. #undef PN
  262. #ifdef CONFIG_SCHEDSTATS
  263. #define P(n) SEQ_printf(m, " .%-30s: %d\n", #n, rq->n);
  264. #define P64(n) SEQ_printf(m, " .%-30s: %Ld\n", #n, rq->n);
  265. P(yld_count);
  266. P(sched_count);
  267. P(sched_goidle);
  268. #ifdef CONFIG_SMP
  269. P64(avg_idle);
  270. #endif
  271. P(ttwu_count);
  272. P(ttwu_local);
  273. #undef P
  274. #undef P64
  275. #endif
  276. spin_lock_irqsave(&sched_debug_lock, flags);
  277. print_cfs_stats(m, cpu);
  278. print_rt_stats(m, cpu);
  279. rcu_read_lock();
  280. print_rq(m, rq, cpu);
  281. rcu_read_unlock();
  282. spin_unlock_irqrestore(&sched_debug_lock, flags);
  283. }
  284. static const char *sched_tunable_scaling_names[] = {
  285. "none",
  286. "logaritmic",
  287. "linear"
  288. };
  289. static int sched_debug_show(struct seq_file *m, void *v)
  290. {
  291. u64 ktime, sched_clk, cpu_clk;
  292. unsigned long flags;
  293. int cpu;
  294. local_irq_save(flags);
  295. ktime = ktime_to_ns(ktime_get());
  296. sched_clk = sched_clock();
  297. cpu_clk = local_clock();
  298. local_irq_restore(flags);
  299. SEQ_printf(m, "Sched Debug Version: v0.10, %s %.*s\n",
  300. init_utsname()->release,
  301. (int)strcspn(init_utsname()->version, " "),
  302. init_utsname()->version);
  303. #define P(x) \
  304. SEQ_printf(m, "%-40s: %Ld\n", #x, (long long)(x))
  305. #define PN(x) \
  306. SEQ_printf(m, "%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
  307. PN(ktime);
  308. PN(sched_clk);
  309. PN(cpu_clk);
  310. P(jiffies);
  311. #ifdef CONFIG_HAVE_UNSTABLE_SCHED_CLOCK
  312. P(sched_clock_stable);
  313. #endif
  314. #undef PN
  315. #undef P
  316. SEQ_printf(m, "\n");
  317. SEQ_printf(m, "sysctl_sched\n");
  318. #define P(x) \
  319. SEQ_printf(m, " .%-40s: %Ld\n", #x, (long long)(x))
  320. #define PN(x) \
  321. SEQ_printf(m, " .%-40s: %Ld.%06ld\n", #x, SPLIT_NS(x))
  322. PN(sysctl_sched_latency);
  323. PN(sysctl_sched_min_granularity);
  324. PN(sysctl_sched_wakeup_granularity);
  325. P(sysctl_sched_child_runs_first);
  326. P(sysctl_sched_features);
  327. #undef PN
  328. #undef P
  329. SEQ_printf(m, " .%-40s: %d (%s)\n", "sysctl_sched_tunable_scaling",
  330. sysctl_sched_tunable_scaling,
  331. sched_tunable_scaling_names[sysctl_sched_tunable_scaling]);
  332. for_each_online_cpu(cpu)
  333. print_cpu(m, cpu);
  334. SEQ_printf(m, "\n");
  335. return 0;
  336. }
  337. void sysrq_sched_debug_show(void)
  338. {
  339. sched_debug_show(NULL, NULL);
  340. }
  341. static int sched_debug_open(struct inode *inode, struct file *filp)
  342. {
  343. return single_open(filp, sched_debug_show, NULL);
  344. }
  345. static const struct file_operations sched_debug_fops = {
  346. .open = sched_debug_open,
  347. .read = seq_read,
  348. .llseek = seq_lseek,
  349. .release = single_release,
  350. };
  351. static int __init init_sched_debug_procfs(void)
  352. {
  353. struct proc_dir_entry *pe;
  354. pe = proc_create("sched_debug", 0444, NULL, &sched_debug_fops);
  355. if (!pe)
  356. return -ENOMEM;
  357. return 0;
  358. }
  359. __initcall(init_sched_debug_procfs);
  360. void proc_sched_show_task(struct task_struct *p, struct seq_file *m)
  361. {
  362. unsigned long nr_switches;
  363. SEQ_printf(m, "%s (%d, #threads: %d)\n", p->comm, p->pid,
  364. get_nr_threads(p));
  365. SEQ_printf(m,
  366. "---------------------------------------------------------\n");
  367. #define __P(F) \
  368. SEQ_printf(m, "%-35s:%21Ld\n", #F, (long long)F)
  369. #define P(F) \
  370. SEQ_printf(m, "%-35s:%21Ld\n", #F, (long long)p->F)
  371. #define __PN(F) \
  372. SEQ_printf(m, "%-35s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)F))
  373. #define PN(F) \
  374. SEQ_printf(m, "%-35s:%14Ld.%06ld\n", #F, SPLIT_NS((long long)p->F))
  375. PN(se.exec_start);
  376. PN(se.vruntime);
  377. PN(se.sum_exec_runtime);
  378. nr_switches = p->nvcsw + p->nivcsw;
  379. #ifdef CONFIG_SCHEDSTATS
  380. PN(se.statistics.wait_start);
  381. PN(se.statistics.sleep_start);
  382. PN(se.statistics.block_start);
  383. PN(se.statistics.sleep_max);
  384. PN(se.statistics.block_max);
  385. PN(se.statistics.exec_max);
  386. PN(se.statistics.slice_max);
  387. PN(se.statistics.wait_max);
  388. PN(se.statistics.wait_sum);
  389. P(se.statistics.wait_count);
  390. PN(se.statistics.iowait_sum);
  391. P(se.statistics.iowait_count);
  392. P(se.nr_migrations);
  393. P(se.statistics.nr_migrations_cold);
  394. P(se.statistics.nr_failed_migrations_affine);
  395. P(se.statistics.nr_failed_migrations_running);
  396. P(se.statistics.nr_failed_migrations_hot);
  397. P(se.statistics.nr_forced_migrations);
  398. P(se.statistics.nr_wakeups);
  399. P(se.statistics.nr_wakeups_sync);
  400. P(se.statistics.nr_wakeups_migrate);
  401. P(se.statistics.nr_wakeups_local);
  402. P(se.statistics.nr_wakeups_remote);
  403. P(se.statistics.nr_wakeups_affine);
  404. P(se.statistics.nr_wakeups_affine_attempts);
  405. P(se.statistics.nr_wakeups_passive);
  406. P(se.statistics.nr_wakeups_idle);
  407. {
  408. u64 avg_atom, avg_per_cpu;
  409. avg_atom = p->se.sum_exec_runtime;
  410. if (nr_switches)
  411. do_div(avg_atom, nr_switches);
  412. else
  413. avg_atom = -1LL;
  414. avg_per_cpu = p->se.sum_exec_runtime;
  415. if (p->se.nr_migrations) {
  416. avg_per_cpu = div64_u64(avg_per_cpu,
  417. p->se.nr_migrations);
  418. } else {
  419. avg_per_cpu = -1LL;
  420. }
  421. __PN(avg_atom);
  422. __PN(avg_per_cpu);
  423. }
  424. #endif
  425. __P(nr_switches);
  426. SEQ_printf(m, "%-35s:%21Ld\n",
  427. "nr_voluntary_switches", (long long)p->nvcsw);
  428. SEQ_printf(m, "%-35s:%21Ld\n",
  429. "nr_involuntary_switches", (long long)p->nivcsw);
  430. P(se.load.weight);
  431. P(policy);
  432. P(prio);
  433. #undef PN
  434. #undef __PN
  435. #undef P
  436. #undef __P
  437. {
  438. unsigned int this_cpu = raw_smp_processor_id();
  439. u64 t0, t1;
  440. t0 = cpu_clock(this_cpu);
  441. t1 = cpu_clock(this_cpu);
  442. SEQ_printf(m, "%-35s:%21Ld\n",
  443. "clock-delta", (long long)(t1-t0));
  444. }
  445. }
  446. void proc_sched_set_task(struct task_struct *p)
  447. {
  448. #ifdef CONFIG_SCHEDSTATS
  449. memset(&p->se.statistics, 0, sizeof(p->se.statistics));
  450. #endif
  451. }