debug_fs.c 6.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296
  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_nodeid) {
  54. if (lkb->lkb_nodeid != res->res_nodeid)
  55. seq_printf(s, " Remote: %3d %08x", lkb->lkb_nodeid,
  56. lkb->lkb_remid);
  57. else
  58. seq_printf(s, " Master: %08x", lkb->lkb_remid);
  59. }
  60. if (lkb->lkb_wait_type)
  61. seq_printf(s, " wait_type: %d", lkb->lkb_wait_type);
  62. seq_printf(s, "\n");
  63. }
  64. static int print_resource(struct dlm_rsb *res, struct seq_file *s)
  65. {
  66. struct dlm_lkb *lkb;
  67. int i, lvblen = res->res_ls->ls_lvblen;
  68. seq_printf(s, "\nResource %p Name (len=%d) \"", res, res->res_length);
  69. for (i = 0; i < res->res_length; i++) {
  70. if (isprint(res->res_name[i]))
  71. seq_printf(s, "%c", res->res_name[i]);
  72. else
  73. seq_printf(s, "%c", '.');
  74. }
  75. if (res->res_nodeid > 0)
  76. seq_printf(s, "\" \nLocal Copy, Master is node %d\n",
  77. res->res_nodeid);
  78. else if (res->res_nodeid == 0)
  79. seq_printf(s, "\" \nMaster Copy\n");
  80. else if (res->res_nodeid == -1)
  81. seq_printf(s, "\" \nLooking up master (lkid %x)\n",
  82. res->res_first_lkid);
  83. else
  84. seq_printf(s, "\" \nInvalid master %d\n", res->res_nodeid);
  85. /* Print the LVB: */
  86. if (res->res_lvbptr) {
  87. seq_printf(s, "LVB: ");
  88. for (i = 0; i < lvblen; i++) {
  89. if (i == lvblen / 2)
  90. seq_printf(s, "\n ");
  91. seq_printf(s, "%02x ",
  92. (unsigned char) res->res_lvbptr[i]);
  93. }
  94. if (rsb_flag(res, RSB_VALNOTVALID))
  95. seq_printf(s, " (INVALID)");
  96. seq_printf(s, "\n");
  97. }
  98. /* Print the locks attached to this resource */
  99. seq_printf(s, "Granted Queue\n");
  100. list_for_each_entry(lkb, &res->res_grantqueue, lkb_statequeue)
  101. print_lock(s, lkb, res);
  102. seq_printf(s, "Conversion Queue\n");
  103. list_for_each_entry(lkb, &res->res_convertqueue, lkb_statequeue)
  104. print_lock(s, lkb, res);
  105. seq_printf(s, "Waiting Queue\n");
  106. list_for_each_entry(lkb, &res->res_waitqueue, lkb_statequeue)
  107. print_lock(s, lkb, res);
  108. return 0;
  109. }
  110. static int rsb_iter_next(struct rsb_iter *ri)
  111. {
  112. struct dlm_ls *ls = ri->ls;
  113. int i;
  114. if (!ri->next) {
  115. top:
  116. /* Find the next non-empty hash bucket */
  117. for (i = ri->entry; i < ls->ls_rsbtbl_size; i++) {
  118. read_lock(&ls->ls_rsbtbl[i].lock);
  119. if (!list_empty(&ls->ls_rsbtbl[i].list)) {
  120. ri->next = ls->ls_rsbtbl[i].list.next;
  121. read_unlock(&ls->ls_rsbtbl[i].lock);
  122. break;
  123. }
  124. read_unlock(&ls->ls_rsbtbl[i].lock);
  125. }
  126. ri->entry = i;
  127. if (ri->entry >= ls->ls_rsbtbl_size)
  128. return 1;
  129. } else {
  130. i = ri->entry;
  131. read_lock(&ls->ls_rsbtbl[i].lock);
  132. ri->next = ri->next->next;
  133. if (ri->next->next == ls->ls_rsbtbl[i].list.next) {
  134. /* End of list - move to next bucket */
  135. ri->next = NULL;
  136. ri->entry++;
  137. read_unlock(&ls->ls_rsbtbl[i].lock);
  138. goto top;
  139. }
  140. read_unlock(&ls->ls_rsbtbl[i].lock);
  141. }
  142. ri->rsb = list_entry(ri->next, struct dlm_rsb, res_hashchain);
  143. return 0;
  144. }
  145. static void rsb_iter_free(struct rsb_iter *ri)
  146. {
  147. kfree(ri);
  148. }
  149. static struct rsb_iter *rsb_iter_init(struct dlm_ls *ls)
  150. {
  151. struct rsb_iter *ri;
  152. ri = kmalloc(sizeof *ri, GFP_KERNEL);
  153. if (!ri)
  154. return NULL;
  155. ri->ls = ls;
  156. ri->entry = 0;
  157. ri->next = NULL;
  158. if (rsb_iter_next(ri)) {
  159. rsb_iter_free(ri);
  160. return NULL;
  161. }
  162. return ri;
  163. }
  164. static void *seq_start(struct seq_file *file, loff_t *pos)
  165. {
  166. struct rsb_iter *ri;
  167. loff_t n = *pos;
  168. ri = rsb_iter_init(file->private);
  169. if (!ri)
  170. return NULL;
  171. while (n--) {
  172. if (rsb_iter_next(ri)) {
  173. rsb_iter_free(ri);
  174. return NULL;
  175. }
  176. }
  177. return ri;
  178. }
  179. static void *seq_next(struct seq_file *file, void *iter_ptr, loff_t *pos)
  180. {
  181. struct rsb_iter *ri = iter_ptr;
  182. (*pos)++;
  183. if (rsb_iter_next(ri)) {
  184. rsb_iter_free(ri);
  185. return NULL;
  186. }
  187. return ri;
  188. }
  189. static void seq_stop(struct seq_file *file, void *iter_ptr)
  190. {
  191. /* nothing for now */
  192. }
  193. static int seq_show(struct seq_file *file, void *iter_ptr)
  194. {
  195. struct rsb_iter *ri = iter_ptr;
  196. print_resource(ri->rsb, file);
  197. return 0;
  198. }
  199. static struct seq_operations dlm_seq_ops = {
  200. .start = seq_start,
  201. .next = seq_next,
  202. .stop = seq_stop,
  203. .show = seq_show,
  204. };
  205. static int do_open(struct inode *inode, struct file *file)
  206. {
  207. struct seq_file *seq;
  208. int ret;
  209. ret = seq_open(file, &dlm_seq_ops);
  210. if (ret)
  211. return ret;
  212. seq = file->private_data;
  213. seq->private = inode->u.generic_ip;
  214. return 0;
  215. }
  216. static struct file_operations dlm_fops = {
  217. .owner = THIS_MODULE,
  218. .open = do_open,
  219. .read = seq_read,
  220. .llseek = seq_lseek,
  221. .release = seq_release
  222. };
  223. int dlm_create_debug_file(struct dlm_ls *ls)
  224. {
  225. ls->ls_debug_dentry = debugfs_create_file(ls->ls_name,
  226. S_IFREG | S_IRUGO,
  227. dlm_root,
  228. ls,
  229. &dlm_fops);
  230. return ls->ls_debug_dentry ? 0 : -ENOMEM;
  231. }
  232. void dlm_delete_debug_file(struct dlm_ls *ls)
  233. {
  234. if (ls->ls_debug_dentry)
  235. debugfs_remove(ls->ls_debug_dentry);
  236. }
  237. int dlm_register_debugfs(void)
  238. {
  239. dlm_root = debugfs_create_dir("dlm", NULL);
  240. return dlm_root ? 0 : -ENOMEM;
  241. }
  242. void dlm_unregister_debugfs(void)
  243. {
  244. debugfs_remove(dlm_root);
  245. }