rcutree_trace.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509
  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 qp=%d",
  81. rdp->cpu,
  82. cpu_is_offline(rdp->cpu) ? '!' : ' ',
  83. rdp->completed, rdp->gpnum,
  84. rdp->passed_quiesce, rdp->qs_pending);
  85. seq_printf(m, " dt=%d/%llx/%d df=%lu",
  86. atomic_read(&rdp->dynticks->dynticks),
  87. rdp->dynticks->dynticks_nesting,
  88. rdp->dynticks->dynticks_nmi_nesting,
  89. rdp->dynticks_fqs);
  90. seq_printf(m, " of=%lu", rdp->offline_fqs);
  91. seq_printf(m, " ql=%ld/%ld qs=%c%c%c%c",
  92. rdp->qlen_lazy, rdp->qlen,
  93. ".N"[rdp->nxttail[RCU_NEXT_READY_TAIL] !=
  94. rdp->nxttail[RCU_NEXT_TAIL]],
  95. ".R"[rdp->nxttail[RCU_WAIT_TAIL] !=
  96. rdp->nxttail[RCU_NEXT_READY_TAIL]],
  97. ".W"[rdp->nxttail[RCU_DONE_TAIL] !=
  98. rdp->nxttail[RCU_WAIT_TAIL]],
  99. ".D"[&rdp->nxtlist != rdp->nxttail[RCU_DONE_TAIL]]);
  100. #ifdef CONFIG_RCU_BOOST
  101. seq_printf(m, " kt=%d/%c/%d ktl=%x",
  102. per_cpu(rcu_cpu_has_work, rdp->cpu),
  103. convert_kthread_status(per_cpu(rcu_cpu_kthread_status,
  104. rdp->cpu)),
  105. per_cpu(rcu_cpu_kthread_cpu, rdp->cpu),
  106. per_cpu(rcu_cpu_kthread_loops, rdp->cpu) & 0xffff);
  107. #endif /* #ifdef CONFIG_RCU_BOOST */
  108. seq_printf(m, " b=%ld", rdp->blimit);
  109. seq_printf(m, " ci=%lu co=%lu ca=%lu\n",
  110. rdp->n_cbs_invoked, rdp->n_cbs_orphaned, rdp->n_cbs_adopted);
  111. }
  112. static int show_rcudata(struct seq_file *m, void *unused)
  113. {
  114. int cpu;
  115. struct rcu_state *rsp;
  116. for_each_rcu_flavor(rsp) {
  117. seq_printf(m, "%s:\n", rsp->name);
  118. for_each_possible_cpu(cpu)
  119. print_one_rcu_data(m, per_cpu_ptr(rsp->rda, cpu));
  120. }
  121. return 0;
  122. }
  123. static int rcudata_open(struct inode *inode, struct file *file)
  124. {
  125. return single_open(file, show_rcudata, NULL);
  126. }
  127. static const struct file_operations rcudata_fops = {
  128. .owner = THIS_MODULE,
  129. .open = rcudata_open,
  130. .read = seq_read,
  131. .llseek = seq_lseek,
  132. .release = single_release,
  133. };
  134. static void print_one_rcu_data_csv(struct seq_file *m, struct rcu_data *rdp)
  135. {
  136. if (!rdp->beenonline)
  137. return;
  138. seq_printf(m, "%d,%s,%lu,%lu,%d,%d",
  139. rdp->cpu,
  140. cpu_is_offline(rdp->cpu) ? "\"N\"" : "\"Y\"",
  141. rdp->completed, rdp->gpnum,
  142. rdp->passed_quiesce, rdp->qs_pending);
  143. seq_printf(m, ",%d,%llx,%d,%lu",
  144. atomic_read(&rdp->dynticks->dynticks),
  145. rdp->dynticks->dynticks_nesting,
  146. rdp->dynticks->dynticks_nmi_nesting,
  147. rdp->dynticks_fqs);
  148. seq_printf(m, ",%lu", rdp->offline_fqs);
  149. seq_printf(m, ",%ld,%ld,\"%c%c%c%c\"", rdp->qlen_lazy, rdp->qlen,
  150. ".N"[rdp->nxttail[RCU_NEXT_READY_TAIL] !=
  151. rdp->nxttail[RCU_NEXT_TAIL]],
  152. ".R"[rdp->nxttail[RCU_WAIT_TAIL] !=
  153. rdp->nxttail[RCU_NEXT_READY_TAIL]],
  154. ".W"[rdp->nxttail[RCU_DONE_TAIL] !=
  155. rdp->nxttail[RCU_WAIT_TAIL]],
  156. ".D"[&rdp->nxtlist != rdp->nxttail[RCU_DONE_TAIL]]);
  157. #ifdef CONFIG_RCU_BOOST
  158. seq_printf(m, ",%d,\"%c\"",
  159. per_cpu(rcu_cpu_has_work, rdp->cpu),
  160. convert_kthread_status(per_cpu(rcu_cpu_kthread_status,
  161. rdp->cpu)));
  162. #endif /* #ifdef CONFIG_RCU_BOOST */
  163. seq_printf(m, ",%ld", rdp->blimit);
  164. seq_printf(m, ",%lu,%lu,%lu\n",
  165. rdp->n_cbs_invoked, rdp->n_cbs_orphaned, rdp->n_cbs_adopted);
  166. }
  167. static int show_rcudata_csv(struct seq_file *m, void *unused)
  168. {
  169. int cpu;
  170. struct rcu_state *rsp;
  171. seq_puts(m, "\"CPU\",\"Online?\",\"c\",\"g\",\"pq\",\"pq\",");
  172. seq_puts(m, "\"dt\",\"dt nesting\",\"dt NMI nesting\",\"df\",");
  173. seq_puts(m, "\"of\",\"qll\",\"ql\",\"qs\"");
  174. #ifdef CONFIG_RCU_BOOST
  175. seq_puts(m, "\"kt\",\"ktl\"");
  176. #endif /* #ifdef CONFIG_RCU_BOOST */
  177. seq_puts(m, ",\"b\",\"ci\",\"co\",\"ca\"\n");
  178. for_each_rcu_flavor(rsp) {
  179. seq_printf(m, "\"%s:\"\n", rsp->name);
  180. for_each_possible_cpu(cpu)
  181. print_one_rcu_data_csv(m, per_cpu_ptr(rsp->rda, cpu));
  182. }
  183. return 0;
  184. }
  185. static int rcudata_csv_open(struct inode *inode, struct file *file)
  186. {
  187. return single_open(file, show_rcudata_csv, NULL);
  188. }
  189. static const struct file_operations rcudata_csv_fops = {
  190. .owner = THIS_MODULE,
  191. .open = rcudata_csv_open,
  192. .read = seq_read,
  193. .llseek = seq_lseek,
  194. .release = single_release,
  195. };
  196. #ifdef CONFIG_RCU_BOOST
  197. static void print_one_rcu_node_boost(struct seq_file *m, struct rcu_node *rnp)
  198. {
  199. seq_printf(m, "%d:%d tasks=%c%c%c%c kt=%c ntb=%lu neb=%lu nnb=%lu ",
  200. rnp->grplo, rnp->grphi,
  201. "T."[list_empty(&rnp->blkd_tasks)],
  202. "N."[!rnp->gp_tasks],
  203. "E."[!rnp->exp_tasks],
  204. "B."[!rnp->boost_tasks],
  205. convert_kthread_status(rnp->boost_kthread_status),
  206. rnp->n_tasks_boosted, rnp->n_exp_boosts,
  207. rnp->n_normal_boosts);
  208. seq_printf(m, "j=%04x bt=%04x\n",
  209. (int)(jiffies & 0xffff),
  210. (int)(rnp->boost_time & 0xffff));
  211. seq_printf(m, " balk: nt=%lu egt=%lu bt=%lu nb=%lu ny=%lu nos=%lu\n",
  212. rnp->n_balk_blkd_tasks,
  213. rnp->n_balk_exp_gp_tasks,
  214. rnp->n_balk_boost_tasks,
  215. rnp->n_balk_notblocked,
  216. rnp->n_balk_notyet,
  217. rnp->n_balk_nos);
  218. }
  219. static int show_rcu_node_boost(struct seq_file *m, void *unused)
  220. {
  221. struct rcu_node *rnp;
  222. rcu_for_each_leaf_node(&rcu_preempt_state, rnp)
  223. print_one_rcu_node_boost(m, rnp);
  224. return 0;
  225. }
  226. static int rcu_node_boost_open(struct inode *inode, struct file *file)
  227. {
  228. return single_open(file, show_rcu_node_boost, NULL);
  229. }
  230. static const struct file_operations rcu_node_boost_fops = {
  231. .owner = THIS_MODULE,
  232. .open = rcu_node_boost_open,
  233. .read = seq_read,
  234. .llseek = seq_lseek,
  235. .release = single_release,
  236. };
  237. /*
  238. * Create the rcuboost debugfs entry. Standard error return.
  239. */
  240. static int rcu_boost_trace_create_file(struct dentry *rcudir)
  241. {
  242. return !debugfs_create_file("rcuboost", 0444, rcudir, NULL,
  243. &rcu_node_boost_fops);
  244. }
  245. #else /* #ifdef CONFIG_RCU_BOOST */
  246. static int rcu_boost_trace_create_file(struct dentry *rcudir)
  247. {
  248. return 0; /* There cannot be an error if we didn't create it! */
  249. }
  250. #endif /* #else #ifdef CONFIG_RCU_BOOST */
  251. static void print_one_rcu_state(struct seq_file *m, struct rcu_state *rsp)
  252. {
  253. unsigned long gpnum;
  254. int level = 0;
  255. struct rcu_node *rnp;
  256. gpnum = rsp->gpnum;
  257. seq_printf(m, "%s: c=%lu g=%lu s=%d jfq=%ld j=%x ",
  258. rsp->name, rsp->completed, gpnum, rsp->fqs_state,
  259. (long)(rsp->jiffies_force_qs - jiffies),
  260. (int)(jiffies & 0xffff));
  261. seq_printf(m, "nfqs=%lu/nfqsng=%lu(%lu) fqlh=%lu oqlen=%ld/%ld\n",
  262. rsp->n_force_qs, rsp->n_force_qs_ngp,
  263. rsp->n_force_qs - rsp->n_force_qs_ngp,
  264. rsp->n_force_qs_lh, rsp->qlen_lazy, rsp->qlen);
  265. for (rnp = &rsp->node[0]; rnp - &rsp->node[0] < rcu_num_nodes; rnp++) {
  266. if (rnp->level != level) {
  267. seq_puts(m, "\n");
  268. level = rnp->level;
  269. }
  270. seq_printf(m, "%lx/%lx %c%c>%c %d:%d ^%d ",
  271. rnp->qsmask, rnp->qsmaskinit,
  272. ".G"[rnp->gp_tasks != NULL],
  273. ".E"[rnp->exp_tasks != NULL],
  274. ".T"[!list_empty(&rnp->blkd_tasks)],
  275. rnp->grplo, rnp->grphi, rnp->grpnum);
  276. }
  277. seq_puts(m, "\n");
  278. }
  279. static int show_rcuhier(struct seq_file *m, void *unused)
  280. {
  281. struct rcu_state *rsp;
  282. for_each_rcu_flavor(rsp)
  283. print_one_rcu_state(m, rsp);
  284. return 0;
  285. }
  286. static int rcuhier_open(struct inode *inode, struct file *file)
  287. {
  288. return single_open(file, show_rcuhier, NULL);
  289. }
  290. static const struct file_operations rcuhier_fops = {
  291. .owner = THIS_MODULE,
  292. .open = rcuhier_open,
  293. .read = seq_read,
  294. .llseek = seq_lseek,
  295. .release = single_release,
  296. };
  297. static void show_one_rcugp(struct seq_file *m, struct rcu_state *rsp)
  298. {
  299. unsigned long flags;
  300. unsigned long completed;
  301. unsigned long gpnum;
  302. unsigned long gpage;
  303. unsigned long gpmax;
  304. struct rcu_node *rnp = &rsp->node[0];
  305. raw_spin_lock_irqsave(&rnp->lock, flags);
  306. completed = rsp->completed;
  307. gpnum = rsp->gpnum;
  308. if (rsp->completed == rsp->gpnum)
  309. gpage = 0;
  310. else
  311. gpage = jiffies - rsp->gp_start;
  312. gpmax = rsp->gp_max;
  313. raw_spin_unlock_irqrestore(&rnp->lock, flags);
  314. seq_printf(m, "%s: completed=%ld gpnum=%lu age=%ld max=%ld\n",
  315. rsp->name, completed, gpnum, gpage, gpmax);
  316. }
  317. static int show_rcugp(struct seq_file *m, void *unused)
  318. {
  319. struct rcu_state *rsp;
  320. for_each_rcu_flavor(rsp)
  321. show_one_rcugp(m, rsp);
  322. return 0;
  323. }
  324. static int rcugp_open(struct inode *inode, struct file *file)
  325. {
  326. return single_open(file, show_rcugp, NULL);
  327. }
  328. static const struct file_operations rcugp_fops = {
  329. .owner = THIS_MODULE,
  330. .open = rcugp_open,
  331. .read = seq_read,
  332. .llseek = seq_lseek,
  333. .release = single_release,
  334. };
  335. static void print_one_rcu_pending(struct seq_file *m, struct rcu_data *rdp)
  336. {
  337. seq_printf(m, "%3d%cnp=%ld ",
  338. rdp->cpu,
  339. cpu_is_offline(rdp->cpu) ? '!' : ' ',
  340. rdp->n_rcu_pending);
  341. seq_printf(m, "qsp=%ld rpq=%ld cbr=%ld cng=%ld ",
  342. rdp->n_rp_qs_pending,
  343. rdp->n_rp_report_qs,
  344. rdp->n_rp_cb_ready,
  345. rdp->n_rp_cpu_needs_gp);
  346. seq_printf(m, "gpc=%ld gps=%ld nn=%ld\n",
  347. rdp->n_rp_gp_completed,
  348. rdp->n_rp_gp_started,
  349. rdp->n_rp_need_nothing);
  350. }
  351. static int show_rcu_pending(struct seq_file *m, void *unused)
  352. {
  353. int cpu;
  354. struct rcu_data *rdp;
  355. struct rcu_state *rsp;
  356. for_each_rcu_flavor(rsp) {
  357. seq_printf(m, "%s:\n", rsp->name);
  358. for_each_possible_cpu(cpu) {
  359. rdp = per_cpu_ptr(rsp->rda, cpu);
  360. if (rdp->beenonline)
  361. print_one_rcu_pending(m, rdp);
  362. }
  363. }
  364. return 0;
  365. }
  366. static int rcu_pending_open(struct inode *inode, struct file *file)
  367. {
  368. return single_open(file, show_rcu_pending, NULL);
  369. }
  370. static const struct file_operations rcu_pending_fops = {
  371. .owner = THIS_MODULE,
  372. .open = rcu_pending_open,
  373. .read = seq_read,
  374. .llseek = seq_lseek,
  375. .release = single_release,
  376. };
  377. static int show_rcutorture(struct seq_file *m, void *unused)
  378. {
  379. seq_printf(m, "rcutorture test sequence: %lu %s\n",
  380. rcutorture_testseq >> 1,
  381. (rcutorture_testseq & 0x1) ? "(test in progress)" : "");
  382. seq_printf(m, "rcutorture update version number: %lu\n",
  383. rcutorture_vernum);
  384. return 0;
  385. }
  386. static int rcutorture_open(struct inode *inode, struct file *file)
  387. {
  388. return single_open(file, show_rcutorture, NULL);
  389. }
  390. static const struct file_operations rcutorture_fops = {
  391. .owner = THIS_MODULE,
  392. .open = rcutorture_open,
  393. .read = seq_read,
  394. .llseek = seq_lseek,
  395. .release = single_release,
  396. };
  397. static struct dentry *rcudir;
  398. static int __init rcutree_trace_init(void)
  399. {
  400. struct dentry *retval;
  401. rcudir = debugfs_create_dir("rcu", NULL);
  402. if (!rcudir)
  403. goto free_out;
  404. retval = debugfs_create_file("rcubarrier", 0444, rcudir,
  405. NULL, &rcubarrier_fops);
  406. if (!retval)
  407. goto free_out;
  408. retval = debugfs_create_file("rcudata", 0444, rcudir,
  409. NULL, &rcudata_fops);
  410. if (!retval)
  411. goto free_out;
  412. retval = debugfs_create_file("rcudata.csv", 0444, rcudir,
  413. NULL, &rcudata_csv_fops);
  414. if (!retval)
  415. goto free_out;
  416. if (rcu_boost_trace_create_file(rcudir))
  417. goto free_out;
  418. retval = debugfs_create_file("rcugp", 0444, rcudir, NULL, &rcugp_fops);
  419. if (!retval)
  420. goto free_out;
  421. retval = debugfs_create_file("rcuhier", 0444, rcudir,
  422. NULL, &rcuhier_fops);
  423. if (!retval)
  424. goto free_out;
  425. retval = debugfs_create_file("rcu_pending", 0444, rcudir,
  426. NULL, &rcu_pending_fops);
  427. if (!retval)
  428. goto free_out;
  429. retval = debugfs_create_file("rcutorture", 0444, rcudir,
  430. NULL, &rcutorture_fops);
  431. if (!retval)
  432. goto free_out;
  433. return 0;
  434. free_out:
  435. debugfs_remove_recursive(rcudir);
  436. return 1;
  437. }
  438. static void __exit rcutree_trace_cleanup(void)
  439. {
  440. debugfs_remove_recursive(rcudir);
  441. }
  442. module_init(rcutree_trace_init);
  443. module_exit(rcutree_trace_cleanup);
  444. MODULE_AUTHOR("Paul E. McKenney");
  445. MODULE_DESCRIPTION("Read-Copy Update tracing for hierarchical implementation");
  446. MODULE_LICENSE("GPL");