rcutree_trace.c 13 KB

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