debug_fs.c 6.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310
  1. /******************************************************************************
  2. *******************************************************************************
  3. **
  4. ** Copyright (C) 2005 Red Hat, Inc. All rights reserved.
  5. **
  6. ** This copyrighted material is made available to anyone wishing to use,
  7. ** modify, copy, or redistribute it subject to the terms and conditions
  8. ** of the GNU General Public License v.2.
  9. **
  10. *******************************************************************************
  11. ******************************************************************************/
  12. #include <linux/pagemap.h>
  13. #include <linux/seq_file.h>
  14. #include <linux/module.h>
  15. #include <linux/ctype.h>
  16. #include <linux/debugfs.h>
  17. #include "dlm_internal.h"
  18. static struct dentry *dlm_root;
  19. struct rsb_iter {
  20. int entry;
  21. struct dlm_ls *ls;
  22. struct list_head *next;
  23. struct dlm_rsb *rsb;
  24. };
  25. static char *print_lockmode(int mode)
  26. {
  27. switch (mode) {
  28. case DLM_LOCK_IV:
  29. return "--";
  30. case DLM_LOCK_NL:
  31. return "NL";
  32. case DLM_LOCK_CR:
  33. return "CR";
  34. case DLM_LOCK_CW:
  35. return "CW";
  36. case DLM_LOCK_PR:
  37. return "PR";
  38. case DLM_LOCK_PW:
  39. return "PW";
  40. case DLM_LOCK_EX:
  41. return "EX";
  42. default:
  43. return "??";
  44. }
  45. }
  46. static void print_lock(struct seq_file *s, struct dlm_lkb *lkb,
  47. struct dlm_rsb *res)
  48. {
  49. seq_printf(s, "%08x %s", lkb->lkb_id, print_lockmode(lkb->lkb_grmode));
  50. if (lkb->lkb_status == DLM_LKSTS_CONVERT
  51. || lkb->lkb_status == DLM_LKSTS_WAITING)
  52. seq_printf(s, " (%s)", print_lockmode(lkb->lkb_rqmode));
  53. if (lkb->lkb_range) {
  54. /* FIXME: this warns on Alpha */
  55. if (lkb->lkb_status == DLM_LKSTS_CONVERT
  56. || lkb->lkb_status == DLM_LKSTS_GRANTED)
  57. seq_printf(s, " %llx-%llx",
  58. lkb->lkb_range[GR_RANGE_START],
  59. lkb->lkb_range[GR_RANGE_END]);
  60. if (lkb->lkb_status == DLM_LKSTS_CONVERT
  61. || lkb->lkb_status == DLM_LKSTS_WAITING)
  62. seq_printf(s, " (%llx-%llx)",
  63. lkb->lkb_range[RQ_RANGE_START],
  64. lkb->lkb_range[RQ_RANGE_END]);
  65. }
  66. if (lkb->lkb_nodeid) {
  67. if (lkb->lkb_nodeid != res->res_nodeid)
  68. seq_printf(s, " Remote: %3d %08x", lkb->lkb_nodeid,
  69. lkb->lkb_remid);
  70. else
  71. seq_printf(s, " Master: %08x", lkb->lkb_remid);
  72. }
  73. if (lkb->lkb_wait_type)
  74. seq_printf(s, " wait_type: %d", lkb->lkb_wait_type);
  75. seq_printf(s, "\n");
  76. }
  77. static int print_resource(struct dlm_rsb *res, struct seq_file *s)
  78. {
  79. struct dlm_lkb *lkb;
  80. int i, lvblen = res->res_ls->ls_lvblen;
  81. seq_printf(s, "\nResource %p Name (len=%d) \"", res, res->res_length);
  82. for (i = 0; i < res->res_length; i++) {
  83. if (isprint(res->res_name[i]))
  84. seq_printf(s, "%c", res->res_name[i]);
  85. else
  86. seq_printf(s, "%c", '.');
  87. }
  88. if (res->res_nodeid > 0)
  89. seq_printf(s, "\" \nLocal Copy, Master is node %d\n",
  90. res->res_nodeid);
  91. else if (res->res_nodeid == 0)
  92. seq_printf(s, "\" \nMaster Copy\n");
  93. else if (res->res_nodeid == -1)
  94. seq_printf(s, "\" \nLooking up master (lkid %x)\n",
  95. res->res_first_lkid);
  96. else
  97. seq_printf(s, "\" \nInvalid master %d\n", res->res_nodeid);
  98. /* Print the LVB: */
  99. if (res->res_lvbptr) {
  100. seq_printf(s, "LVB: ");
  101. for (i = 0; i < lvblen; i++) {
  102. if (i == lvblen / 2)
  103. seq_printf(s, "\n ");
  104. seq_printf(s, "%02x ",
  105. (unsigned char) res->res_lvbptr[i]);
  106. }
  107. if (rsb_flag(res, RSB_VALNOTVALID))
  108. seq_printf(s, " (INVALID)");
  109. seq_printf(s, "\n");
  110. }
  111. /* Print the locks attached to this resource */
  112. seq_printf(s, "Granted Queue\n");
  113. list_for_each_entry(lkb, &res->res_grantqueue, lkb_statequeue)
  114. print_lock(s, lkb, res);
  115. seq_printf(s, "Conversion Queue\n");
  116. list_for_each_entry(lkb, &res->res_convertqueue, lkb_statequeue)
  117. print_lock(s, lkb, res);
  118. seq_printf(s, "Waiting Queue\n");
  119. list_for_each_entry(lkb, &res->res_waitqueue, lkb_statequeue)
  120. print_lock(s, lkb, res);
  121. return 0;
  122. }
  123. static int rsb_iter_next(struct rsb_iter *ri)
  124. {
  125. struct dlm_ls *ls = ri->ls;
  126. int i;
  127. if (!ri->next) {
  128. top:
  129. /* Find the next non-empty hash bucket */
  130. for (i = ri->entry; i < ls->ls_rsbtbl_size; i++) {
  131. read_lock(&ls->ls_rsbtbl[i].lock);
  132. if (!list_empty(&ls->ls_rsbtbl[i].list)) {
  133. ri->next = ls->ls_rsbtbl[i].list.next;
  134. read_unlock(&ls->ls_rsbtbl[i].lock);
  135. break;
  136. }
  137. read_unlock(&ls->ls_rsbtbl[i].lock);
  138. }
  139. ri->entry = i;
  140. if (ri->entry >= ls->ls_rsbtbl_size)
  141. return 1;
  142. } else {
  143. i = ri->entry;
  144. read_lock(&ls->ls_rsbtbl[i].lock);
  145. ri->next = ri->next->next;
  146. if (ri->next->next == ls->ls_rsbtbl[i].list.next) {
  147. /* End of list - move to next bucket */
  148. ri->next = NULL;
  149. ri->entry++;
  150. read_unlock(&ls->ls_rsbtbl[i].lock);
  151. goto top;
  152. }
  153. read_unlock(&ls->ls_rsbtbl[i].lock);
  154. }
  155. ri->rsb = list_entry(ri->next, struct dlm_rsb, res_hashchain);
  156. return 0;
  157. }
  158. static void rsb_iter_free(struct rsb_iter *ri)
  159. {
  160. kfree(ri);
  161. }
  162. static struct rsb_iter *rsb_iter_init(struct dlm_ls *ls)
  163. {
  164. struct rsb_iter *ri;
  165. ri = kmalloc(sizeof *ri, GFP_KERNEL);
  166. if (!ri)
  167. return NULL;
  168. ri->ls = ls;
  169. ri->entry = 0;
  170. ri->next = NULL;
  171. if (rsb_iter_next(ri)) {
  172. rsb_iter_free(ri);
  173. return NULL;
  174. }
  175. return ri;
  176. }
  177. static void *seq_start(struct seq_file *file, loff_t *pos)
  178. {
  179. struct rsb_iter *ri;
  180. loff_t n = *pos;
  181. ri = rsb_iter_init(file->private);
  182. if (!ri)
  183. return NULL;
  184. while (n--) {
  185. if (rsb_iter_next(ri)) {
  186. rsb_iter_free(ri);
  187. return NULL;
  188. }
  189. }
  190. return ri;
  191. }
  192. static void *seq_next(struct seq_file *file, void *iter_ptr, loff_t *pos)
  193. {
  194. struct rsb_iter *ri = iter_ptr;
  195. (*pos)++;
  196. if (rsb_iter_next(ri)) {
  197. rsb_iter_free(ri);
  198. return NULL;
  199. }
  200. return ri;
  201. }
  202. static void seq_stop(struct seq_file *file, void *iter_ptr)
  203. {
  204. /* nothing for now */
  205. }
  206. static int seq_show(struct seq_file *file, void *iter_ptr)
  207. {
  208. struct rsb_iter *ri = iter_ptr;
  209. print_resource(ri->rsb, file);
  210. return 0;
  211. }
  212. static struct seq_operations dlm_seq_ops = {
  213. .start = seq_start,
  214. .next = seq_next,
  215. .stop = seq_stop,
  216. .show = seq_show,
  217. };
  218. static int do_open(struct inode *inode, struct file *file)
  219. {
  220. struct seq_file *seq;
  221. int ret;
  222. ret = seq_open(file, &dlm_seq_ops);
  223. if (ret)
  224. return ret;
  225. seq = file->private_data;
  226. seq->private = inode->u.generic_ip;
  227. return 0;
  228. }
  229. static struct file_operations dlm_fops = {
  230. .owner = THIS_MODULE,
  231. .open = do_open,
  232. .read = seq_read,
  233. .llseek = seq_lseek,
  234. .release = seq_release
  235. };
  236. int dlm_create_debug_file(struct dlm_ls *ls)
  237. {
  238. ls->ls_debug_dentry = debugfs_create_file(ls->ls_name,
  239. S_IFREG | S_IRUGO,
  240. dlm_root,
  241. ls,
  242. &dlm_fops);
  243. return ls->ls_debug_dentry ? 0 : -ENOMEM;
  244. }
  245. void dlm_delete_debug_file(struct dlm_ls *ls)
  246. {
  247. if (ls->ls_debug_dentry)
  248. debugfs_remove(ls->ls_debug_dentry);
  249. }
  250. int dlm_register_debugfs(void)
  251. {
  252. dlm_root = debugfs_create_dir("dlm", NULL);
  253. return dlm_root ? 0 : -ENOMEM;
  254. }
  255. void dlm_unregister_debugfs(void)
  256. {
  257. debugfs_remove(dlm_root);
  258. }