rcutree_trace.c 13 KB

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