rcutree_trace.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512
  1. /*
  2. * Read-Copy Update tracing for classic implementation
  3. *
  4. * This program is free software; you can redistribute it and/or modify
  5. * it under the terms of the GNU General Public License as published by
  6. * the Free Software Foundation; either version 2 of the License, or
  7. * (at your option) any later version.
  8. *
  9. * This program is distributed in the hope that it will be useful,
  10. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. * GNU General Public License for more details.
  13. *
  14. * You should have received a copy of the GNU General Public License
  15. * along with this program; if not, write to the Free Software
  16. * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
  17. *
  18. * Copyright IBM Corporation, 2008
  19. *
  20. * Papers: http://www.rdrop.com/users/paulmck/RCU
  21. *
  22. * For detailed explanation of Read-Copy Update mechanism see -
  23. * Documentation/RCU
  24. *
  25. */
  26. #include <linux/types.h>
  27. #include <linux/kernel.h>
  28. #include <linux/init.h>
  29. #include <linux/spinlock.h>
  30. #include <linux/smp.h>
  31. #include <linux/rcupdate.h>
  32. #include <linux/interrupt.h>
  33. #include <linux/sched.h>
  34. #include <linux/atomic.h>
  35. #include <linux/bitops.h>
  36. #include <linux/module.h>
  37. #include <linux/completion.h>
  38. #include <linux/moduleparam.h>
  39. #include <linux/percpu.h>
  40. #include <linux/notifier.h>
  41. #include <linux/cpu.h>
  42. #include <linux/mutex.h>
  43. #include <linux/debugfs.h>
  44. #include <linux/seq_file.h>
  45. #define RCU_TREE_NONCORE
  46. #include "rcutree.h"
  47. static int show_rcubarrier(struct seq_file *m, void *unused)
  48. {
  49. struct rcu_state *rsp;
  50. for_each_rcu_flavor(rsp)
  51. seq_printf(m, "%s: %c bcc: %d nbd: %lu\n",
  52. rsp->name, rsp->rcu_barrier_in_progress ? 'B' : '.',
  53. atomic_read(&rsp->barrier_cpu_count),
  54. rsp->n_barrier_done);
  55. return 0;
  56. }
  57. static int rcubarrier_open(struct inode *inode, struct file *file)
  58. {
  59. return single_open(file, show_rcubarrier, NULL);
  60. }
  61. static const struct file_operations rcubarrier_fops = {
  62. .owner = THIS_MODULE,
  63. .open = rcubarrier_open,
  64. .read = seq_read,
  65. .llseek = seq_lseek,
  66. .release = single_release,
  67. };
  68. #ifdef CONFIG_RCU_BOOST
  69. static char convert_kthread_status(unsigned int kthread_status)
  70. {
  71. if (kthread_status > RCU_KTHREAD_MAX)
  72. return '?';
  73. return "SRWOY"[kthread_status];
  74. }
  75. #endif /* #ifdef CONFIG_RCU_BOOST */
  76. static void print_one_rcu_data(struct seq_file *m, struct rcu_data *rdp)
  77. {
  78. if (!rdp->beenonline)
  79. return;
  80. seq_printf(m, "%3d%cc=%lu g=%lu pq=%d pgp=%lu qp=%d",
  81. rdp->cpu,
  82. cpu_is_offline(rdp->cpu) ? '!' : ' ',
  83. rdp->completed, rdp->gpnum,
  84. rdp->passed_quiesce, rdp->passed_quiesce_gpnum,
  85. rdp->qs_pending);
  86. seq_printf(m, " dt=%d/%llx/%d df=%lu",
  87. atomic_read(&rdp->dynticks->dynticks),
  88. rdp->dynticks->dynticks_nesting,
  89. rdp->dynticks->dynticks_nmi_nesting,
  90. rdp->dynticks_fqs);
  91. seq_printf(m, " of=%lu", rdp->offline_fqs);
  92. seq_printf(m, " ql=%ld/%ld qs=%c%c%c%c",
  93. rdp->qlen_lazy, rdp->qlen,
  94. ".N"[rdp->nxttail[RCU_NEXT_READY_TAIL] !=
  95. rdp->nxttail[RCU_NEXT_TAIL]],
  96. ".R"[rdp->nxttail[RCU_WAIT_TAIL] !=
  97. rdp->nxttail[RCU_NEXT_READY_TAIL]],
  98. ".W"[rdp->nxttail[RCU_DONE_TAIL] !=
  99. rdp->nxttail[RCU_WAIT_TAIL]],
  100. ".D"[&rdp->nxtlist != rdp->nxttail[RCU_DONE_TAIL]]);
  101. #ifdef CONFIG_RCU_BOOST
  102. seq_printf(m, " kt=%d/%c/%d ktl=%x",
  103. per_cpu(rcu_cpu_has_work, rdp->cpu),
  104. convert_kthread_status(per_cpu(rcu_cpu_kthread_status,
  105. rdp->cpu)),
  106. per_cpu(rcu_cpu_kthread_cpu, rdp->cpu),
  107. per_cpu(rcu_cpu_kthread_loops, rdp->cpu) & 0xffff);
  108. #endif /* #ifdef CONFIG_RCU_BOOST */
  109. seq_printf(m, " b=%ld", rdp->blimit);
  110. seq_printf(m, " ci=%lu co=%lu ca=%lu\n",
  111. rdp->n_cbs_invoked, rdp->n_cbs_orphaned, rdp->n_cbs_adopted);
  112. }
  113. static int show_rcudata(struct seq_file *m, void *unused)
  114. {
  115. int cpu;
  116. struct rcu_state *rsp;
  117. for_each_rcu_flavor(rsp) {
  118. seq_printf(m, "%s:\n", rsp->name);
  119. for_each_possible_cpu(cpu)
  120. print_one_rcu_data(m, per_cpu_ptr(rsp->rda, cpu));
  121. }
  122. return 0;
  123. }
  124. static int rcudata_open(struct inode *inode, struct file *file)
  125. {
  126. return single_open(file, show_rcudata, NULL);
  127. }
  128. static const struct file_operations rcudata_fops = {
  129. .owner = THIS_MODULE,
  130. .open = rcudata_open,
  131. .read = seq_read,
  132. .llseek = seq_lseek,
  133. .release = single_release,
  134. };
  135. static void print_one_rcu_data_csv(struct seq_file *m, struct rcu_data *rdp)
  136. {
  137. if (!rdp->beenonline)
  138. return;
  139. seq_printf(m, "%d,%s,%lu,%lu,%d,%lu,%d",
  140. rdp->cpu,
  141. cpu_is_offline(rdp->cpu) ? "\"N\"" : "\"Y\"",
  142. rdp->completed, rdp->gpnum,
  143. rdp->passed_quiesce, rdp->passed_quiesce_gpnum,
  144. rdp->qs_pending);
  145. seq_printf(m, ",%d,%llx,%d,%lu",
  146. atomic_read(&rdp->dynticks->dynticks),
  147. rdp->dynticks->dynticks_nesting,
  148. rdp->dynticks->dynticks_nmi_nesting,
  149. rdp->dynticks_fqs);
  150. seq_printf(m, ",%lu", rdp->offline_fqs);
  151. seq_printf(m, ",%ld,%ld,\"%c%c%c%c\"", rdp->qlen_lazy, rdp->qlen,
  152. ".N"[rdp->nxttail[RCU_NEXT_READY_TAIL] !=
  153. rdp->nxttail[RCU_NEXT_TAIL]],
  154. ".R"[rdp->nxttail[RCU_WAIT_TAIL] !=
  155. rdp->nxttail[RCU_NEXT_READY_TAIL]],
  156. ".W"[rdp->nxttail[RCU_DONE_TAIL] !=
  157. rdp->nxttail[RCU_WAIT_TAIL]],
  158. ".D"[&rdp->nxtlist != rdp->nxttail[RCU_DONE_TAIL]]);
  159. #ifdef CONFIG_RCU_BOOST
  160. seq_printf(m, ",%d,\"%c\"",
  161. per_cpu(rcu_cpu_has_work, rdp->cpu),
  162. convert_kthread_status(per_cpu(rcu_cpu_kthread_status,
  163. rdp->cpu)));
  164. #endif /* #ifdef CONFIG_RCU_BOOST */
  165. seq_printf(m, ",%ld", rdp->blimit);
  166. seq_printf(m, ",%lu,%lu,%lu\n",
  167. rdp->n_cbs_invoked, rdp->n_cbs_orphaned, rdp->n_cbs_adopted);
  168. }
  169. static int show_rcudata_csv(struct seq_file *m, void *unused)
  170. {
  171. int cpu;
  172. struct rcu_state *rsp;
  173. seq_puts(m, "\"CPU\",\"Online?\",\"c\",\"g\",\"pq\",\"pgp\",\"pq\",");
  174. seq_puts(m, "\"dt\",\"dt nesting\",\"dt NMI nesting\",\"df\",");
  175. seq_puts(m, "\"of\",\"qll\",\"ql\",\"qs\"");
  176. #ifdef CONFIG_RCU_BOOST
  177. seq_puts(m, "\"kt\",\"ktl\"");
  178. #endif /* #ifdef CONFIG_RCU_BOOST */
  179. seq_puts(m, ",\"b\",\"ci\",\"co\",\"ca\"\n");
  180. for_each_rcu_flavor(rsp) {
  181. seq_printf(m, "\"%s:\"\n", rsp->name);
  182. for_each_possible_cpu(cpu)
  183. print_one_rcu_data_csv(m, per_cpu_ptr(rsp->rda, cpu));
  184. }
  185. return 0;
  186. }
  187. static int rcudata_csv_open(struct inode *inode, struct file *file)
  188. {
  189. return single_open(file, show_rcudata_csv, NULL);
  190. }
  191. static const struct file_operations rcudata_csv_fops = {
  192. .owner = THIS_MODULE,
  193. .open = rcudata_csv_open,
  194. .read = seq_read,
  195. .llseek = seq_lseek,
  196. .release = single_release,
  197. };
  198. #ifdef CONFIG_RCU_BOOST
  199. static void print_one_rcu_node_boost(struct seq_file *m, struct rcu_node *rnp)
  200. {
  201. seq_printf(m, "%d:%d tasks=%c%c%c%c kt=%c ntb=%lu neb=%lu nnb=%lu ",
  202. rnp->grplo, rnp->grphi,
  203. "T."[list_empty(&rnp->blkd_tasks)],
  204. "N."[!rnp->gp_tasks],
  205. "E."[!rnp->exp_tasks],
  206. "B."[!rnp->boost_tasks],
  207. convert_kthread_status(rnp->boost_kthread_status),
  208. rnp->n_tasks_boosted, rnp->n_exp_boosts,
  209. rnp->n_normal_boosts);
  210. seq_printf(m, "j=%04x bt=%04x\n",
  211. (int)(jiffies & 0xffff),
  212. (int)(rnp->boost_time & 0xffff));
  213. seq_printf(m, " balk: nt=%lu egt=%lu bt=%lu nb=%lu ny=%lu nos=%lu\n",
  214. rnp->n_balk_blkd_tasks,
  215. rnp->n_balk_exp_gp_tasks,
  216. rnp->n_balk_boost_tasks,
  217. rnp->n_balk_notblocked,
  218. rnp->n_balk_notyet,
  219. rnp->n_balk_nos);
  220. }
  221. static int show_rcu_node_boost(struct seq_file *m, void *unused)
  222. {
  223. struct rcu_node *rnp;
  224. rcu_for_each_leaf_node(&rcu_preempt_state, rnp)
  225. print_one_rcu_node_boost(m, rnp);
  226. return 0;
  227. }
  228. static int rcu_node_boost_open(struct inode *inode, struct file *file)
  229. {
  230. return single_open(file, show_rcu_node_boost, NULL);
  231. }
  232. static const struct file_operations rcu_node_boost_fops = {
  233. .owner = THIS_MODULE,
  234. .open = rcu_node_boost_open,
  235. .read = seq_read,
  236. .llseek = seq_lseek,
  237. .release = single_release,
  238. };
  239. /*
  240. * Create the rcuboost debugfs entry. Standard error return.
  241. */
  242. static int rcu_boost_trace_create_file(struct dentry *rcudir)
  243. {
  244. return !debugfs_create_file("rcuboost", 0444, rcudir, NULL,
  245. &rcu_node_boost_fops);
  246. }
  247. #else /* #ifdef CONFIG_RCU_BOOST */
  248. static int rcu_boost_trace_create_file(struct dentry *rcudir)
  249. {
  250. return 0; /* There cannot be an error if we didn't create it! */
  251. }
  252. #endif /* #else #ifdef CONFIG_RCU_BOOST */
  253. static void print_one_rcu_state(struct seq_file *m, struct rcu_state *rsp)
  254. {
  255. unsigned long gpnum;
  256. int level = 0;
  257. struct rcu_node *rnp;
  258. gpnum = rsp->gpnum;
  259. seq_printf(m, "%s: c=%lu g=%lu s=%d jfq=%ld j=%x ",
  260. rsp->name, rsp->completed, gpnum, rsp->fqs_state,
  261. (long)(rsp->jiffies_force_qs - jiffies),
  262. (int)(jiffies & 0xffff));
  263. seq_printf(m, "nfqs=%lu/nfqsng=%lu(%lu) fqlh=%lu oqlen=%ld/%ld\n",
  264. rsp->n_force_qs, rsp->n_force_qs_ngp,
  265. rsp->n_force_qs - rsp->n_force_qs_ngp,
  266. rsp->n_force_qs_lh, rsp->qlen_lazy, rsp->qlen);
  267. for (rnp = &rsp->node[0]; rnp - &rsp->node[0] < rcu_num_nodes; rnp++) {
  268. if (rnp->level != level) {
  269. seq_puts(m, "\n");
  270. level = rnp->level;
  271. }
  272. seq_printf(m, "%lx/%lx %c%c>%c %d:%d ^%d ",
  273. rnp->qsmask, rnp->qsmaskinit,
  274. ".G"[rnp->gp_tasks != NULL],
  275. ".E"[rnp->exp_tasks != NULL],
  276. ".T"[!list_empty(&rnp->blkd_tasks)],
  277. rnp->grplo, rnp->grphi, rnp->grpnum);
  278. }
  279. seq_puts(m, "\n");
  280. }
  281. static int show_rcuhier(struct seq_file *m, void *unused)
  282. {
  283. struct rcu_state *rsp;
  284. for_each_rcu_flavor(rsp)
  285. print_one_rcu_state(m, rsp);
  286. return 0;
  287. }
  288. static int rcuhier_open(struct inode *inode, struct file *file)
  289. {
  290. return single_open(file, show_rcuhier, NULL);
  291. }
  292. static const struct file_operations rcuhier_fops = {
  293. .owner = THIS_MODULE,
  294. .open = rcuhier_open,
  295. .read = seq_read,
  296. .llseek = seq_lseek,
  297. .release = single_release,
  298. };
  299. static void show_one_rcugp(struct seq_file *m, struct rcu_state *rsp)
  300. {
  301. unsigned long flags;
  302. unsigned long completed;
  303. unsigned long gpnum;
  304. unsigned long gpage;
  305. unsigned long gpmax;
  306. struct rcu_node *rnp = &rsp->node[0];
  307. raw_spin_lock_irqsave(&rnp->lock, flags);
  308. completed = rsp->completed;
  309. gpnum = rsp->gpnum;
  310. if (rsp->completed == rsp->gpnum)
  311. gpage = 0;
  312. else
  313. gpage = jiffies - rsp->gp_start;
  314. gpmax = rsp->gp_max;
  315. raw_spin_unlock_irqrestore(&rnp->lock, flags);
  316. seq_printf(m, "%s: completed=%ld gpnum=%lu age=%ld max=%ld\n",
  317. rsp->name, completed, gpnum, gpage, gpmax);
  318. }
  319. static int show_rcugp(struct seq_file *m, void *unused)
  320. {
  321. struct rcu_state *rsp;
  322. for_each_rcu_flavor(rsp)
  323. show_one_rcugp(m, rsp);
  324. return 0;
  325. }
  326. static int rcugp_open(struct inode *inode, struct file *file)
  327. {
  328. return single_open(file, show_rcugp, NULL);
  329. }
  330. static const struct file_operations rcugp_fops = {
  331. .owner = THIS_MODULE,
  332. .open = rcugp_open,
  333. .read = seq_read,
  334. .llseek = seq_lseek,
  335. .release = single_release,
  336. };
  337. static void print_one_rcu_pending(struct seq_file *m, struct rcu_data *rdp)
  338. {
  339. seq_printf(m, "%3d%cnp=%ld ",
  340. rdp->cpu,
  341. cpu_is_offline(rdp->cpu) ? '!' : ' ',
  342. rdp->n_rcu_pending);
  343. seq_printf(m, "qsp=%ld rpq=%ld cbr=%ld cng=%ld ",
  344. rdp->n_rp_qs_pending,
  345. rdp->n_rp_report_qs,
  346. rdp->n_rp_cb_ready,
  347. rdp->n_rp_cpu_needs_gp);
  348. seq_printf(m, "gpc=%ld gps=%ld nf=%ld nn=%ld\n",
  349. rdp->n_rp_gp_completed,
  350. rdp->n_rp_gp_started,
  351. rdp->n_rp_need_fqs,
  352. rdp->n_rp_need_nothing);
  353. }
  354. static int show_rcu_pending(struct seq_file *m, void *unused)
  355. {
  356. int cpu;
  357. struct rcu_data *rdp;
  358. struct rcu_state *rsp;
  359. for_each_rcu_flavor(rsp) {
  360. seq_printf(m, "%s:\n", rsp->name);
  361. for_each_possible_cpu(cpu) {
  362. rdp = per_cpu_ptr(rsp->rda, cpu);
  363. if (rdp->beenonline)
  364. print_one_rcu_pending(m, rdp);
  365. }
  366. }
  367. return 0;
  368. }
  369. static int rcu_pending_open(struct inode *inode, struct file *file)
  370. {
  371. return single_open(file, show_rcu_pending, NULL);
  372. }
  373. static const struct file_operations rcu_pending_fops = {
  374. .owner = THIS_MODULE,
  375. .open = rcu_pending_open,
  376. .read = seq_read,
  377. .llseek = seq_lseek,
  378. .release = single_release,
  379. };
  380. static int show_rcutorture(struct seq_file *m, void *unused)
  381. {
  382. seq_printf(m, "rcutorture test sequence: %lu %s\n",
  383. rcutorture_testseq >> 1,
  384. (rcutorture_testseq & 0x1) ? "(test in progress)" : "");
  385. seq_printf(m, "rcutorture update version number: %lu\n",
  386. rcutorture_vernum);
  387. return 0;
  388. }
  389. static int rcutorture_open(struct inode *inode, struct file *file)
  390. {
  391. return single_open(file, show_rcutorture, NULL);
  392. }
  393. static const struct file_operations rcutorture_fops = {
  394. .owner = THIS_MODULE,
  395. .open = rcutorture_open,
  396. .read = seq_read,
  397. .llseek = seq_lseek,
  398. .release = single_release,
  399. };
  400. static struct dentry *rcudir;
  401. static int __init rcutree_trace_init(void)
  402. {
  403. struct dentry *retval;
  404. rcudir = debugfs_create_dir("rcu", NULL);
  405. if (!rcudir)
  406. goto free_out;
  407. retval = debugfs_create_file("rcubarrier", 0444, rcudir,
  408. NULL, &rcubarrier_fops);
  409. if (!retval)
  410. goto free_out;
  411. retval = debugfs_create_file("rcudata", 0444, rcudir,
  412. NULL, &rcudata_fops);
  413. if (!retval)
  414. goto free_out;
  415. retval = debugfs_create_file("rcudata.csv", 0444, rcudir,
  416. NULL, &rcudata_csv_fops);
  417. if (!retval)
  418. goto free_out;
  419. if (rcu_boost_trace_create_file(rcudir))
  420. goto free_out;
  421. retval = debugfs_create_file("rcugp", 0444, rcudir, NULL, &rcugp_fops);
  422. if (!retval)
  423. goto free_out;
  424. retval = debugfs_create_file("rcuhier", 0444, rcudir,
  425. NULL, &rcuhier_fops);
  426. if (!retval)
  427. goto free_out;
  428. retval = debugfs_create_file("rcu_pending", 0444, rcudir,
  429. NULL, &rcu_pending_fops);
  430. if (!retval)
  431. goto free_out;
  432. retval = debugfs_create_file("rcutorture", 0444, rcudir,
  433. NULL, &rcutorture_fops);
  434. if (!retval)
  435. goto free_out;
  436. return 0;
  437. free_out:
  438. debugfs_remove_recursive(rcudir);
  439. return 1;
  440. }
  441. static void __exit rcutree_trace_cleanup(void)
  442. {
  443. debugfs_remove_recursive(rcudir);
  444. }
  445. module_init(rcutree_trace_init);
  446. module_exit(rcutree_trace_cleanup);
  447. MODULE_AUTHOR("Paul E. McKenney");
  448. MODULE_DESCRIPTION("Read-Copy Update tracing for hierarchical implementation");
  449. MODULE_LICENSE("GPL");