debug.c 12 KB

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