tree_trace.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496
  1. /*
  2. * Read-Copy Update tracing for hierarchical 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, you can access it online at
  16. * http://www.gnu.org/licenses/gpl-2.0.html.
  17. *
  18. * Copyright IBM Corporation, 2008
  19. * Author: Paul E. McKenney
  20. *
  21. * Papers: http://www.rdrop.com/users/paulmck/RCU
  22. *
  23. * For detailed explanation of Read-Copy Update mechanism see -
  24. * Documentation/RCU
  25. *
  26. */
  27. #include <linux/types.h>
  28. #include <linux/kernel.h>
  29. #include <linux/init.h>
  30. #include <linux/spinlock.h>
  31. #include <linux/smp.h>
  32. #include <linux/rcupdate.h>
  33. #include <linux/interrupt.h>
  34. #include <linux/sched.h>
  35. #include <linux/atomic.h>
  36. #include <linux/bitops.h>
  37. #include <linux/completion.h>
  38. #include <linux/percpu.h>
  39. #include <linux/notifier.h>
  40. #include <linux/cpu.h>
  41. #include <linux/mutex.h>
  42. #include <linux/debugfs.h>
  43. #include <linux/seq_file.h>
  44. #define RCU_TREE_NONCORE
  45. #include "tree.h"
  46. DECLARE_PER_CPU_SHARED_ALIGNED(unsigned long, rcu_qs_ctr);
  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 bseq: %lu\n",
  77. atomic_read(&rsp->barrier_cpu_count),
  78. rsp->barrier_sequence);
  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 cnq=%d/%d:%d",
  106. rdp->cpu,
  107. cpu_is_offline(rdp->cpu) ? '!' : ' ',
  108. ulong2long(rdp->completed), ulong2long(rdp->gpnum),
  109. rdp->cpu_no_qs.b.norm,
  110. rdp->rcu_qs_ctr_snap == per_cpu(rcu_qs_ctr, rdp->cpu),
  111. rdp->core_needs_qs);
  112. seq_printf(m, " dt=%d/%llx/%d df=%lu",
  113. atomic_read(&rdp->dynticks->dynticks),
  114. rdp->dynticks->dynticks_nesting,
  115. rdp->dynticks->dynticks_nmi_nesting,
  116. rdp->dynticks_fqs);
  117. seq_printf(m, " of=%lu", rdp->offline_fqs);
  118. rcu_nocb_q_lengths(rdp, &ql, &qll);
  119. qll += rdp->qlen_lazy;
  120. ql += rdp->qlen;
  121. seq_printf(m, " ql=%ld/%ld qs=%c%c%c%c",
  122. qll, ql,
  123. ".N"[rdp->nxttail[RCU_NEXT_READY_TAIL] !=
  124. rdp->nxttail[RCU_NEXT_TAIL]],
  125. ".R"[rdp->nxttail[RCU_WAIT_TAIL] !=
  126. rdp->nxttail[RCU_NEXT_READY_TAIL]],
  127. ".W"[rdp->nxttail[RCU_DONE_TAIL] !=
  128. rdp->nxttail[RCU_WAIT_TAIL]],
  129. ".D"[&rdp->nxtlist != rdp->nxttail[RCU_DONE_TAIL]]);
  130. #ifdef CONFIG_RCU_BOOST
  131. seq_printf(m, " kt=%d/%c ktl=%x",
  132. per_cpu(rcu_cpu_has_work, rdp->cpu),
  133. convert_kthread_status(per_cpu(rcu_cpu_kthread_status,
  134. rdp->cpu)),
  135. per_cpu(rcu_cpu_kthread_loops, rdp->cpu) & 0xffff);
  136. #endif /* #ifdef CONFIG_RCU_BOOST */
  137. seq_printf(m, " b=%ld", rdp->blimit);
  138. seq_printf(m, " ci=%lu nci=%lu co=%lu ca=%lu\n",
  139. rdp->n_cbs_invoked, rdp->n_nocbs_invoked,
  140. rdp->n_cbs_orphaned, rdp->n_cbs_adopted);
  141. }
  142. static int show_rcudata(struct seq_file *m, void *v)
  143. {
  144. print_one_rcu_data(m, (struct rcu_data *)v);
  145. return 0;
  146. }
  147. static const struct seq_operations rcudate_op = {
  148. .start = r_start,
  149. .next = r_next,
  150. .stop = r_stop,
  151. .show = show_rcudata,
  152. };
  153. static int rcudata_open(struct inode *inode, struct file *file)
  154. {
  155. return r_open(inode, file, &rcudate_op);
  156. }
  157. static const struct file_operations rcudata_fops = {
  158. .owner = THIS_MODULE,
  159. .open = rcudata_open,
  160. .read = seq_read,
  161. .llseek = no_llseek,
  162. .release = seq_release,
  163. };
  164. static int show_rcuexp(struct seq_file *m, void *v)
  165. {
  166. int cpu;
  167. struct rcu_state *rsp = (struct rcu_state *)m->private;
  168. struct rcu_data *rdp;
  169. unsigned long s0 = 0, s1 = 0, s2 = 0, s3 = 0;
  170. for_each_possible_cpu(cpu) {
  171. rdp = per_cpu_ptr(rsp->rda, cpu);
  172. s0 += atomic_long_read(&rdp->exp_workdone0);
  173. s1 += atomic_long_read(&rdp->exp_workdone1);
  174. s2 += atomic_long_read(&rdp->exp_workdone2);
  175. s3 += atomic_long_read(&rdp->exp_workdone3);
  176. }
  177. seq_printf(m, "s=%lu wd0=%lu wd1=%lu wd2=%lu wd3=%lu n=%lu enq=%d sc=%lu\n",
  178. rsp->expedited_sequence, s0, s1, s2, s3,
  179. atomic_long_read(&rsp->expedited_normal),
  180. atomic_read(&rsp->expedited_need_qs),
  181. rsp->expedited_sequence / 2);
  182. return 0;
  183. }
  184. static int rcuexp_open(struct inode *inode, struct file *file)
  185. {
  186. return single_open(file, show_rcuexp, inode->i_private);
  187. }
  188. static const struct file_operations rcuexp_fops = {
  189. .owner = THIS_MODULE,
  190. .open = rcuexp_open,
  191. .read = seq_read,
  192. .llseek = no_llseek,
  193. .release = single_release,
  194. };
  195. #ifdef CONFIG_RCU_BOOST
  196. static void print_one_rcu_node_boost(struct seq_file *m, struct rcu_node *rnp)
  197. {
  198. seq_printf(m, "%d:%d tasks=%c%c%c%c kt=%c ntb=%lu neb=%lu nnb=%lu ",
  199. rnp->grplo, rnp->grphi,
  200. "T."[list_empty(&rnp->blkd_tasks)],
  201. "N."[!rnp->gp_tasks],
  202. "E."[!rnp->exp_tasks],
  203. "B."[!rnp->boost_tasks],
  204. convert_kthread_status(rnp->boost_kthread_status),
  205. rnp->n_tasks_boosted, rnp->n_exp_boosts,
  206. rnp->n_normal_boosts);
  207. seq_printf(m, "j=%04x bt=%04x\n",
  208. (int)(jiffies & 0xffff),
  209. (int)(rnp->boost_time & 0xffff));
  210. seq_printf(m, " balk: nt=%lu egt=%lu bt=%lu nb=%lu ny=%lu nos=%lu\n",
  211. rnp->n_balk_blkd_tasks,
  212. rnp->n_balk_exp_gp_tasks,
  213. rnp->n_balk_boost_tasks,
  214. rnp->n_balk_notblocked,
  215. rnp->n_balk_notyet,
  216. rnp->n_balk_nos);
  217. }
  218. static int show_rcu_node_boost(struct seq_file *m, void *unused)
  219. {
  220. struct rcu_node *rnp;
  221. rcu_for_each_leaf_node(&rcu_preempt_state, rnp)
  222. print_one_rcu_node_boost(m, rnp);
  223. return 0;
  224. }
  225. static int rcu_node_boost_open(struct inode *inode, struct file *file)
  226. {
  227. return single_open(file, show_rcu_node_boost, NULL);
  228. }
  229. static const struct file_operations rcu_node_boost_fops = {
  230. .owner = THIS_MODULE,
  231. .open = rcu_node_boost_open,
  232. .read = seq_read,
  233. .llseek = no_llseek,
  234. .release = single_release,
  235. };
  236. #endif /* #ifdef CONFIG_RCU_BOOST */
  237. static void print_one_rcu_state(struct seq_file *m, struct rcu_state *rsp)
  238. {
  239. unsigned long gpnum;
  240. int level = 0;
  241. struct rcu_node *rnp;
  242. gpnum = rsp->gpnum;
  243. seq_printf(m, "c=%ld g=%ld s=%d jfq=%ld j=%x ",
  244. ulong2long(rsp->completed), ulong2long(gpnum),
  245. rsp->gp_state,
  246. (long)(rsp->jiffies_force_qs - jiffies),
  247. (int)(jiffies & 0xffff));
  248. seq_printf(m, "nfqs=%lu/nfqsng=%lu(%lu) fqlh=%lu oqlen=%ld/%ld\n",
  249. rsp->n_force_qs, rsp->n_force_qs_ngp,
  250. rsp->n_force_qs - rsp->n_force_qs_ngp,
  251. READ_ONCE(rsp->n_force_qs_lh), rsp->qlen_lazy, rsp->qlen);
  252. for (rnp = &rsp->node[0]; rnp - &rsp->node[0] < rcu_num_nodes; rnp++) {
  253. if (rnp->level != level) {
  254. seq_puts(m, "\n");
  255. level = rnp->level;
  256. }
  257. seq_printf(m, "%lx/%lx->%lx %c%c>%c %d:%d ^%d ",
  258. rnp->qsmask, rnp->qsmaskinit, rnp->qsmaskinitnext,
  259. ".G"[rnp->gp_tasks != NULL],
  260. ".E"[rnp->exp_tasks != NULL],
  261. ".T"[!list_empty(&rnp->blkd_tasks)],
  262. rnp->grplo, rnp->grphi, rnp->grpnum);
  263. }
  264. seq_puts(m, "\n");
  265. }
  266. static int show_rcuhier(struct seq_file *m, void *v)
  267. {
  268. struct rcu_state *rsp = (struct rcu_state *)m->private;
  269. print_one_rcu_state(m, rsp);
  270. return 0;
  271. }
  272. static int rcuhier_open(struct inode *inode, struct file *file)
  273. {
  274. return single_open(file, show_rcuhier, inode->i_private);
  275. }
  276. static const struct file_operations rcuhier_fops = {
  277. .owner = THIS_MODULE,
  278. .open = rcuhier_open,
  279. .read = seq_read,
  280. .llseek = no_llseek,
  281. .release = single_release,
  282. };
  283. static void show_one_rcugp(struct seq_file *m, struct rcu_state *rsp)
  284. {
  285. unsigned long flags;
  286. unsigned long completed;
  287. unsigned long gpnum;
  288. unsigned long gpage;
  289. unsigned long gpmax;
  290. struct rcu_node *rnp = &rsp->node[0];
  291. raw_spin_lock_irqsave_rcu_node(rnp, flags);
  292. completed = READ_ONCE(rsp->completed);
  293. gpnum = READ_ONCE(rsp->gpnum);
  294. if (completed == gpnum)
  295. gpage = 0;
  296. else
  297. gpage = jiffies - rsp->gp_start;
  298. gpmax = rsp->gp_max;
  299. raw_spin_unlock_irqrestore(&rnp->lock, flags);
  300. seq_printf(m, "completed=%ld gpnum=%ld age=%ld max=%ld\n",
  301. ulong2long(completed), ulong2long(gpnum), gpage, gpmax);
  302. }
  303. static int show_rcugp(struct seq_file *m, void *v)
  304. {
  305. struct rcu_state *rsp = (struct rcu_state *)m->private;
  306. show_one_rcugp(m, rsp);
  307. return 0;
  308. }
  309. static int rcugp_open(struct inode *inode, struct file *file)
  310. {
  311. return single_open(file, show_rcugp, inode->i_private);
  312. }
  313. static const struct file_operations rcugp_fops = {
  314. .owner = THIS_MODULE,
  315. .open = rcugp_open,
  316. .read = seq_read,
  317. .llseek = no_llseek,
  318. .release = single_release,
  319. };
  320. static void print_one_rcu_pending(struct seq_file *m, struct rcu_data *rdp)
  321. {
  322. if (!rdp->beenonline)
  323. return;
  324. seq_printf(m, "%3d%cnp=%ld ",
  325. rdp->cpu,
  326. cpu_is_offline(rdp->cpu) ? '!' : ' ',
  327. rdp->n_rcu_pending);
  328. seq_printf(m, "qsp=%ld rpq=%ld cbr=%ld cng=%ld ",
  329. rdp->n_rp_core_needs_qs,
  330. rdp->n_rp_report_qs,
  331. rdp->n_rp_cb_ready,
  332. rdp->n_rp_cpu_needs_gp);
  333. seq_printf(m, "gpc=%ld gps=%ld nn=%ld ndw%ld\n",
  334. rdp->n_rp_gp_completed,
  335. rdp->n_rp_gp_started,
  336. rdp->n_rp_nocb_defer_wakeup,
  337. rdp->n_rp_need_nothing);
  338. }
  339. static int show_rcu_pending(struct seq_file *m, void *v)
  340. {
  341. print_one_rcu_pending(m, (struct rcu_data *)v);
  342. return 0;
  343. }
  344. static const struct seq_operations rcu_pending_op = {
  345. .start = r_start,
  346. .next = r_next,
  347. .stop = r_stop,
  348. .show = show_rcu_pending,
  349. };
  350. static int rcu_pending_open(struct inode *inode, struct file *file)
  351. {
  352. return r_open(inode, file, &rcu_pending_op);
  353. }
  354. static const struct file_operations rcu_pending_fops = {
  355. .owner = THIS_MODULE,
  356. .open = rcu_pending_open,
  357. .read = seq_read,
  358. .llseek = no_llseek,
  359. .release = seq_release,
  360. };
  361. static int show_rcutorture(struct seq_file *m, void *unused)
  362. {
  363. seq_printf(m, "rcutorture test sequence: %lu %s\n",
  364. rcutorture_testseq >> 1,
  365. (rcutorture_testseq & 0x1) ? "(test in progress)" : "");
  366. seq_printf(m, "rcutorture update version number: %lu\n",
  367. rcutorture_vernum);
  368. return 0;
  369. }
  370. static int rcutorture_open(struct inode *inode, struct file *file)
  371. {
  372. return single_open(file, show_rcutorture, NULL);
  373. }
  374. static const struct file_operations rcutorture_fops = {
  375. .owner = THIS_MODULE,
  376. .open = rcutorture_open,
  377. .read = seq_read,
  378. .llseek = seq_lseek,
  379. .release = single_release,
  380. };
  381. static struct dentry *rcudir;
  382. static int __init rcutree_trace_init(void)
  383. {
  384. struct rcu_state *rsp;
  385. struct dentry *retval;
  386. struct dentry *rspdir;
  387. rcudir = debugfs_create_dir("rcu", NULL);
  388. if (!rcudir)
  389. goto free_out;
  390. for_each_rcu_flavor(rsp) {
  391. rspdir = debugfs_create_dir(rsp->name, rcudir);
  392. if (!rspdir)
  393. goto free_out;
  394. retval = debugfs_create_file("rcudata", 0444,
  395. rspdir, rsp, &rcudata_fops);
  396. if (!retval)
  397. goto free_out;
  398. retval = debugfs_create_file("rcuexp", 0444,
  399. rspdir, rsp, &rcuexp_fops);
  400. if (!retval)
  401. goto free_out;
  402. retval = debugfs_create_file("rcu_pending", 0444,
  403. rspdir, rsp, &rcu_pending_fops);
  404. if (!retval)
  405. goto free_out;
  406. retval = debugfs_create_file("rcubarrier", 0444,
  407. rspdir, rsp, &rcubarrier_fops);
  408. if (!retval)
  409. goto free_out;
  410. #ifdef CONFIG_RCU_BOOST
  411. if (rsp == &rcu_preempt_state) {
  412. retval = debugfs_create_file("rcuboost", 0444,
  413. rspdir, NULL, &rcu_node_boost_fops);
  414. if (!retval)
  415. goto free_out;
  416. }
  417. #endif
  418. retval = debugfs_create_file("rcugp", 0444,
  419. rspdir, rsp, &rcugp_fops);
  420. if (!retval)
  421. goto free_out;
  422. retval = debugfs_create_file("rcuhier", 0444,
  423. rspdir, rsp, &rcuhier_fops);
  424. if (!retval)
  425. goto free_out;
  426. }
  427. retval = debugfs_create_file("rcutorture", 0444, rcudir,
  428. NULL, &rcutorture_fops);
  429. if (!retval)
  430. goto free_out;
  431. return 0;
  432. free_out:
  433. debugfs_remove_recursive(rcudir);
  434. return 1;
  435. }
  436. device_initcall(rcutree_trace_init);