debug_fs.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751
  1. /******************************************************************************
  2. *******************************************************************************
  3. **
  4. ** Copyright (C) 2005-2008 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. #include "lock.h"
  19. #define DLM_DEBUG_BUF_LEN 4096
  20. static char debug_buf[DLM_DEBUG_BUF_LEN];
  21. static struct mutex debug_buf_lock;
  22. static struct dentry *dlm_root;
  23. struct rsb_iter {
  24. int entry;
  25. int format;
  26. int header;
  27. struct dlm_ls *ls;
  28. struct list_head *next;
  29. struct dlm_rsb *rsb;
  30. };
  31. /*
  32. * dump all rsb's in the lockspace hash table
  33. */
  34. static char *print_lockmode(int mode)
  35. {
  36. switch (mode) {
  37. case DLM_LOCK_IV:
  38. return "--";
  39. case DLM_LOCK_NL:
  40. return "NL";
  41. case DLM_LOCK_CR:
  42. return "CR";
  43. case DLM_LOCK_CW:
  44. return "CW";
  45. case DLM_LOCK_PR:
  46. return "PR";
  47. case DLM_LOCK_PW:
  48. return "PW";
  49. case DLM_LOCK_EX:
  50. return "EX";
  51. default:
  52. return "??";
  53. }
  54. }
  55. static void print_format1_lock(struct seq_file *s, struct dlm_lkb *lkb,
  56. struct dlm_rsb *res)
  57. {
  58. seq_printf(s, "%08x %s", lkb->lkb_id, print_lockmode(lkb->lkb_grmode));
  59. if (lkb->lkb_status == DLM_LKSTS_CONVERT
  60. || lkb->lkb_status == DLM_LKSTS_WAITING)
  61. seq_printf(s, " (%s)", print_lockmode(lkb->lkb_rqmode));
  62. if (lkb->lkb_nodeid) {
  63. if (lkb->lkb_nodeid != res->res_nodeid)
  64. seq_printf(s, " Remote: %3d %08x", lkb->lkb_nodeid,
  65. lkb->lkb_remid);
  66. else
  67. seq_printf(s, " Master: %08x", lkb->lkb_remid);
  68. }
  69. if (lkb->lkb_wait_type)
  70. seq_printf(s, " wait_type: %d", lkb->lkb_wait_type);
  71. seq_printf(s, "\n");
  72. }
  73. static int print_format1(struct dlm_rsb *res, struct seq_file *s)
  74. {
  75. struct dlm_lkb *lkb;
  76. int i, lvblen = res->res_ls->ls_lvblen, recover_list, root_list;
  77. lock_rsb(res);
  78. seq_printf(s, "\nResource %p Name (len=%d) \"", res, res->res_length);
  79. for (i = 0; i < res->res_length; i++) {
  80. if (isprint(res->res_name[i]))
  81. seq_printf(s, "%c", res->res_name[i]);
  82. else
  83. seq_printf(s, "%c", '.');
  84. }
  85. if (res->res_nodeid > 0)
  86. seq_printf(s, "\" \nLocal Copy, Master is node %d\n",
  87. res->res_nodeid);
  88. else if (res->res_nodeid == 0)
  89. seq_printf(s, "\" \nMaster Copy\n");
  90. else if (res->res_nodeid == -1)
  91. seq_printf(s, "\" \nLooking up master (lkid %x)\n",
  92. res->res_first_lkid);
  93. else
  94. seq_printf(s, "\" \nInvalid master %d\n", res->res_nodeid);
  95. /* Print the LVB: */
  96. if (res->res_lvbptr) {
  97. seq_printf(s, "LVB: ");
  98. for (i = 0; i < lvblen; i++) {
  99. if (i == lvblen / 2)
  100. seq_printf(s, "\n ");
  101. seq_printf(s, "%02x ",
  102. (unsigned char) res->res_lvbptr[i]);
  103. }
  104. if (rsb_flag(res, RSB_VALNOTVALID))
  105. seq_printf(s, " (INVALID)");
  106. seq_printf(s, "\n");
  107. }
  108. root_list = !list_empty(&res->res_root_list);
  109. recover_list = !list_empty(&res->res_recover_list);
  110. if (root_list || recover_list) {
  111. seq_printf(s, "Recovery: root %d recover %d flags %lx "
  112. "count %d\n", root_list, recover_list,
  113. res->res_flags, res->res_recover_locks_count);
  114. }
  115. /* Print the locks attached to this resource */
  116. seq_printf(s, "Granted Queue\n");
  117. list_for_each_entry(lkb, &res->res_grantqueue, lkb_statequeue)
  118. print_format1_lock(s, lkb, res);
  119. seq_printf(s, "Conversion Queue\n");
  120. list_for_each_entry(lkb, &res->res_convertqueue, lkb_statequeue)
  121. print_format1_lock(s, lkb, res);
  122. seq_printf(s, "Waiting Queue\n");
  123. list_for_each_entry(lkb, &res->res_waitqueue, lkb_statequeue)
  124. print_format1_lock(s, lkb, res);
  125. if (list_empty(&res->res_lookup))
  126. goto out;
  127. seq_printf(s, "Lookup Queue\n");
  128. list_for_each_entry(lkb, &res->res_lookup, lkb_rsb_lookup) {
  129. seq_printf(s, "%08x %s", lkb->lkb_id,
  130. print_lockmode(lkb->lkb_rqmode));
  131. if (lkb->lkb_wait_type)
  132. seq_printf(s, " wait_type: %d", lkb->lkb_wait_type);
  133. seq_printf(s, "\n");
  134. }
  135. out:
  136. unlock_rsb(res);
  137. return 0;
  138. }
  139. static void print_format2_lock(struct seq_file *s, struct dlm_lkb *lkb,
  140. struct dlm_rsb *r)
  141. {
  142. u64 xid = 0;
  143. u64 us;
  144. if (lkb->lkb_flags & DLM_IFL_USER) {
  145. if (lkb->lkb_ua)
  146. xid = lkb->lkb_ua->xid;
  147. }
  148. /* microseconds since lkb was added to current queue */
  149. us = ktime_to_us(ktime_sub(ktime_get(), lkb->lkb_timestamp));
  150. /* id nodeid remid pid xid exflags flags sts grmode rqmode time_us
  151. r_nodeid r_len r_name */
  152. seq_printf(s, "%x %d %x %u %llu %x %x %d %d %d %llu %u %d \"%s\"\n",
  153. lkb->lkb_id,
  154. lkb->lkb_nodeid,
  155. lkb->lkb_remid,
  156. lkb->lkb_ownpid,
  157. (unsigned long long)xid,
  158. lkb->lkb_exflags,
  159. lkb->lkb_flags,
  160. lkb->lkb_status,
  161. lkb->lkb_grmode,
  162. lkb->lkb_rqmode,
  163. (unsigned long long)us,
  164. r->res_nodeid,
  165. r->res_length,
  166. r->res_name);
  167. }
  168. static int print_format2(struct dlm_rsb *r, struct seq_file *s)
  169. {
  170. struct dlm_lkb *lkb;
  171. lock_rsb(r);
  172. list_for_each_entry(lkb, &r->res_grantqueue, lkb_statequeue)
  173. print_format2_lock(s, lkb, r);
  174. list_for_each_entry(lkb, &r->res_convertqueue, lkb_statequeue)
  175. print_format2_lock(s, lkb, r);
  176. list_for_each_entry(lkb, &r->res_waitqueue, lkb_statequeue)
  177. print_format2_lock(s, lkb, r);
  178. unlock_rsb(r);
  179. return 0;
  180. }
  181. static void print_format3_lock(struct seq_file *s, struct dlm_lkb *lkb,
  182. int rsb_lookup)
  183. {
  184. u64 xid = 0;
  185. if (lkb->lkb_flags & DLM_IFL_USER) {
  186. if (lkb->lkb_ua)
  187. xid = lkb->lkb_ua->xid;
  188. }
  189. seq_printf(s, "lkb %x %d %x %u %llu %x %x %d %d %d %d %d %d %u %llu %llu\n",
  190. lkb->lkb_id,
  191. lkb->lkb_nodeid,
  192. lkb->lkb_remid,
  193. lkb->lkb_ownpid,
  194. (unsigned long long)xid,
  195. lkb->lkb_exflags,
  196. lkb->lkb_flags,
  197. lkb->lkb_status,
  198. lkb->lkb_grmode,
  199. lkb->lkb_rqmode,
  200. lkb->lkb_highbast,
  201. rsb_lookup,
  202. lkb->lkb_wait_type,
  203. lkb->lkb_lvbseq,
  204. (unsigned long long)ktime_to_ns(lkb->lkb_timestamp),
  205. (unsigned long long)ktime_to_ns(lkb->lkb_time_bast));
  206. }
  207. static int print_format3(struct dlm_rsb *r, struct seq_file *s)
  208. {
  209. struct dlm_lkb *lkb;
  210. int i, lvblen = r->res_ls->ls_lvblen;
  211. int print_name = 1;
  212. lock_rsb(r);
  213. seq_printf(s, "rsb %p %d %x %lx %d %d %u %d ",
  214. r,
  215. r->res_nodeid,
  216. r->res_first_lkid,
  217. r->res_flags,
  218. !list_empty(&r->res_root_list),
  219. !list_empty(&r->res_recover_list),
  220. r->res_recover_locks_count,
  221. r->res_length);
  222. for (i = 0; i < r->res_length; i++) {
  223. if (!isascii(r->res_name[i]) || !isprint(r->res_name[i]))
  224. print_name = 0;
  225. }
  226. seq_printf(s, "%s", print_name ? "str " : "hex");
  227. for (i = 0; i < r->res_length; i++) {
  228. if (print_name)
  229. seq_printf(s, "%c", r->res_name[i]);
  230. else
  231. seq_printf(s, " %02x", (unsigned char)r->res_name[i]);
  232. }
  233. seq_printf(s, "\n");
  234. if (!r->res_lvbptr)
  235. goto do_locks;
  236. seq_printf(s, "lvb %u %d", r->res_lvbseq, lvblen);
  237. for (i = 0; i < lvblen; i++)
  238. seq_printf(s, " %02x", (unsigned char)r->res_lvbptr[i]);
  239. seq_printf(s, "\n");
  240. do_locks:
  241. list_for_each_entry(lkb, &r->res_grantqueue, lkb_statequeue)
  242. print_format3_lock(s, lkb, 0);
  243. list_for_each_entry(lkb, &r->res_convertqueue, lkb_statequeue)
  244. print_format3_lock(s, lkb, 0);
  245. list_for_each_entry(lkb, &r->res_waitqueue, lkb_statequeue)
  246. print_format3_lock(s, lkb, 0);
  247. list_for_each_entry(lkb, &r->res_lookup, lkb_rsb_lookup)
  248. print_format3_lock(s, lkb, 1);
  249. unlock_rsb(r);
  250. return 0;
  251. }
  252. static int rsb_iter_next(struct rsb_iter *ri)
  253. {
  254. struct dlm_ls *ls = ri->ls;
  255. int i;
  256. if (!ri->next) {
  257. top:
  258. /* Find the next non-empty hash bucket */
  259. for (i = ri->entry; i < ls->ls_rsbtbl_size; i++) {
  260. read_lock(&ls->ls_rsbtbl[i].lock);
  261. if (!list_empty(&ls->ls_rsbtbl[i].list)) {
  262. ri->next = ls->ls_rsbtbl[i].list.next;
  263. ri->rsb = list_entry(ri->next, struct dlm_rsb,
  264. res_hashchain);
  265. dlm_hold_rsb(ri->rsb);
  266. read_unlock(&ls->ls_rsbtbl[i].lock);
  267. break;
  268. }
  269. read_unlock(&ls->ls_rsbtbl[i].lock);
  270. }
  271. ri->entry = i;
  272. if (ri->entry >= ls->ls_rsbtbl_size)
  273. return 1;
  274. } else {
  275. struct dlm_rsb *old = ri->rsb;
  276. i = ri->entry;
  277. read_lock(&ls->ls_rsbtbl[i].lock);
  278. ri->next = ri->next->next;
  279. if (ri->next->next == ls->ls_rsbtbl[i].list.next) {
  280. /* End of list - move to next bucket */
  281. ri->next = NULL;
  282. ri->entry++;
  283. read_unlock(&ls->ls_rsbtbl[i].lock);
  284. dlm_put_rsb(old);
  285. goto top;
  286. }
  287. ri->rsb = list_entry(ri->next, struct dlm_rsb, res_hashchain);
  288. dlm_hold_rsb(ri->rsb);
  289. read_unlock(&ls->ls_rsbtbl[i].lock);
  290. dlm_put_rsb(old);
  291. }
  292. return 0;
  293. }
  294. static void rsb_iter_free(struct rsb_iter *ri)
  295. {
  296. kfree(ri);
  297. }
  298. static struct rsb_iter *rsb_iter_init(struct dlm_ls *ls)
  299. {
  300. struct rsb_iter *ri;
  301. ri = kzalloc(sizeof *ri, GFP_KERNEL);
  302. if (!ri)
  303. return NULL;
  304. ri->ls = ls;
  305. ri->entry = 0;
  306. ri->next = NULL;
  307. ri->format = 1;
  308. if (rsb_iter_next(ri)) {
  309. rsb_iter_free(ri);
  310. return NULL;
  311. }
  312. return ri;
  313. }
  314. static void *rsb_seq_start(struct seq_file *file, loff_t *pos)
  315. {
  316. struct rsb_iter *ri;
  317. loff_t n = *pos;
  318. ri = rsb_iter_init(file->private);
  319. if (!ri)
  320. return NULL;
  321. while (n--) {
  322. if (rsb_iter_next(ri)) {
  323. rsb_iter_free(ri);
  324. return NULL;
  325. }
  326. }
  327. return ri;
  328. }
  329. static void *rsb_seq_next(struct seq_file *file, void *iter_ptr, loff_t *pos)
  330. {
  331. struct rsb_iter *ri = iter_ptr;
  332. (*pos)++;
  333. if (rsb_iter_next(ri)) {
  334. rsb_iter_free(ri);
  335. return NULL;
  336. }
  337. return ri;
  338. }
  339. static void rsb_seq_stop(struct seq_file *file, void *iter_ptr)
  340. {
  341. /* nothing for now */
  342. }
  343. static int rsb_seq_show(struct seq_file *file, void *iter_ptr)
  344. {
  345. struct rsb_iter *ri = iter_ptr;
  346. switch (ri->format) {
  347. case 1:
  348. print_format1(ri->rsb, file);
  349. break;
  350. case 2:
  351. if (ri->header) {
  352. seq_printf(file, "id nodeid remid pid xid exflags "
  353. "flags sts grmode rqmode time_ms "
  354. "r_nodeid r_len r_name\n");
  355. ri->header = 0;
  356. }
  357. print_format2(ri->rsb, file);
  358. break;
  359. case 3:
  360. if (ri->header) {
  361. seq_printf(file, "version rsb 1.1 lvb 1.1 lkb 1.1\n");
  362. ri->header = 0;
  363. }
  364. print_format3(ri->rsb, file);
  365. break;
  366. }
  367. return 0;
  368. }
  369. static struct seq_operations rsb_seq_ops = {
  370. .start = rsb_seq_start,
  371. .next = rsb_seq_next,
  372. .stop = rsb_seq_stop,
  373. .show = rsb_seq_show,
  374. };
  375. static int rsb_open(struct inode *inode, struct file *file)
  376. {
  377. struct seq_file *seq;
  378. int ret;
  379. ret = seq_open(file, &rsb_seq_ops);
  380. if (ret)
  381. return ret;
  382. seq = file->private_data;
  383. seq->private = inode->i_private;
  384. return 0;
  385. }
  386. static const struct file_operations rsb_fops = {
  387. .owner = THIS_MODULE,
  388. .open = rsb_open,
  389. .read = seq_read,
  390. .llseek = seq_lseek,
  391. .release = seq_release
  392. };
  393. /*
  394. * Dump state in compact per-lock listing
  395. */
  396. static struct rsb_iter *locks_iter_init(struct dlm_ls *ls, loff_t *pos)
  397. {
  398. struct rsb_iter *ri;
  399. ri = kzalloc(sizeof *ri, GFP_KERNEL);
  400. if (!ri)
  401. return NULL;
  402. ri->ls = ls;
  403. ri->entry = 0;
  404. ri->next = NULL;
  405. ri->format = 2;
  406. if (*pos == 0)
  407. ri->header = 1;
  408. if (rsb_iter_next(ri)) {
  409. rsb_iter_free(ri);
  410. return NULL;
  411. }
  412. return ri;
  413. }
  414. static void *locks_seq_start(struct seq_file *file, loff_t *pos)
  415. {
  416. struct rsb_iter *ri;
  417. loff_t n = *pos;
  418. ri = locks_iter_init(file->private, pos);
  419. if (!ri)
  420. return NULL;
  421. while (n--) {
  422. if (rsb_iter_next(ri)) {
  423. rsb_iter_free(ri);
  424. return NULL;
  425. }
  426. }
  427. return ri;
  428. }
  429. static struct seq_operations locks_seq_ops = {
  430. .start = locks_seq_start,
  431. .next = rsb_seq_next,
  432. .stop = rsb_seq_stop,
  433. .show = rsb_seq_show,
  434. };
  435. static int locks_open(struct inode *inode, struct file *file)
  436. {
  437. struct seq_file *seq;
  438. int ret;
  439. ret = seq_open(file, &locks_seq_ops);
  440. if (ret)
  441. return ret;
  442. seq = file->private_data;
  443. seq->private = inode->i_private;
  444. return 0;
  445. }
  446. static const struct file_operations locks_fops = {
  447. .owner = THIS_MODULE,
  448. .open = locks_open,
  449. .read = seq_read,
  450. .llseek = seq_lseek,
  451. .release = seq_release
  452. };
  453. /*
  454. * Dump all rsb/lvb/lkb state in compact listing, more complete than _locks
  455. * This can replace both formats 1 and 2 eventually.
  456. */
  457. static struct rsb_iter *all_iter_init(struct dlm_ls *ls, loff_t *pos)
  458. {
  459. struct rsb_iter *ri;
  460. ri = kzalloc(sizeof *ri, GFP_KERNEL);
  461. if (!ri)
  462. return NULL;
  463. ri->ls = ls;
  464. ri->entry = 0;
  465. ri->next = NULL;
  466. ri->format = 3;
  467. if (*pos == 0)
  468. ri->header = 1;
  469. if (rsb_iter_next(ri)) {
  470. rsb_iter_free(ri);
  471. return NULL;
  472. }
  473. return ri;
  474. }
  475. static void *all_seq_start(struct seq_file *file, loff_t *pos)
  476. {
  477. struct rsb_iter *ri;
  478. loff_t n = *pos;
  479. ri = all_iter_init(file->private, pos);
  480. if (!ri)
  481. return NULL;
  482. while (n--) {
  483. if (rsb_iter_next(ri)) {
  484. rsb_iter_free(ri);
  485. return NULL;
  486. }
  487. }
  488. return ri;
  489. }
  490. static struct seq_operations all_seq_ops = {
  491. .start = all_seq_start,
  492. .next = rsb_seq_next,
  493. .stop = rsb_seq_stop,
  494. .show = rsb_seq_show,
  495. };
  496. static int all_open(struct inode *inode, struct file *file)
  497. {
  498. struct seq_file *seq;
  499. int ret;
  500. ret = seq_open(file, &all_seq_ops);
  501. if (ret)
  502. return ret;
  503. seq = file->private_data;
  504. seq->private = inode->i_private;
  505. return 0;
  506. }
  507. static const struct file_operations all_fops = {
  508. .owner = THIS_MODULE,
  509. .open = all_open,
  510. .read = seq_read,
  511. .llseek = seq_lseek,
  512. .release = seq_release
  513. };
  514. /*
  515. * dump lkb's on the ls_waiters list
  516. */
  517. static int waiters_open(struct inode *inode, struct file *file)
  518. {
  519. file->private_data = inode->i_private;
  520. return 0;
  521. }
  522. static ssize_t waiters_read(struct file *file, char __user *userbuf,
  523. size_t count, loff_t *ppos)
  524. {
  525. struct dlm_ls *ls = file->private_data;
  526. struct dlm_lkb *lkb;
  527. size_t len = DLM_DEBUG_BUF_LEN, pos = 0, ret, rv;
  528. mutex_lock(&debug_buf_lock);
  529. mutex_lock(&ls->ls_waiters_mutex);
  530. memset(debug_buf, 0, sizeof(debug_buf));
  531. list_for_each_entry(lkb, &ls->ls_waiters, lkb_wait_reply) {
  532. ret = snprintf(debug_buf + pos, len - pos, "%x %d %d %s\n",
  533. lkb->lkb_id, lkb->lkb_wait_type,
  534. lkb->lkb_nodeid, lkb->lkb_resource->res_name);
  535. if (ret >= len - pos)
  536. break;
  537. pos += ret;
  538. }
  539. mutex_unlock(&ls->ls_waiters_mutex);
  540. rv = simple_read_from_buffer(userbuf, count, ppos, debug_buf, pos);
  541. mutex_unlock(&debug_buf_lock);
  542. return rv;
  543. }
  544. static const struct file_operations waiters_fops = {
  545. .owner = THIS_MODULE,
  546. .open = waiters_open,
  547. .read = waiters_read
  548. };
  549. void dlm_delete_debug_file(struct dlm_ls *ls)
  550. {
  551. if (ls->ls_debug_rsb_dentry)
  552. debugfs_remove(ls->ls_debug_rsb_dentry);
  553. if (ls->ls_debug_waiters_dentry)
  554. debugfs_remove(ls->ls_debug_waiters_dentry);
  555. if (ls->ls_debug_locks_dentry)
  556. debugfs_remove(ls->ls_debug_locks_dentry);
  557. if (ls->ls_debug_all_dentry)
  558. debugfs_remove(ls->ls_debug_all_dentry);
  559. }
  560. int dlm_create_debug_file(struct dlm_ls *ls)
  561. {
  562. char name[DLM_LOCKSPACE_LEN+8];
  563. /* format 1 */
  564. ls->ls_debug_rsb_dentry = debugfs_create_file(ls->ls_name,
  565. S_IFREG | S_IRUGO,
  566. dlm_root,
  567. ls,
  568. &rsb_fops);
  569. if (!ls->ls_debug_rsb_dentry)
  570. goto fail;
  571. /* format 2 */
  572. memset(name, 0, sizeof(name));
  573. snprintf(name, DLM_LOCKSPACE_LEN+8, "%s_locks", ls->ls_name);
  574. ls->ls_debug_locks_dentry = debugfs_create_file(name,
  575. S_IFREG | S_IRUGO,
  576. dlm_root,
  577. ls,
  578. &locks_fops);
  579. if (!ls->ls_debug_locks_dentry)
  580. goto fail;
  581. /* format 3 */
  582. memset(name, 0, sizeof(name));
  583. snprintf(name, DLM_LOCKSPACE_LEN+8, "%s_all", ls->ls_name);
  584. ls->ls_debug_all_dentry = debugfs_create_file(name,
  585. S_IFREG | S_IRUGO,
  586. dlm_root,
  587. ls,
  588. &all_fops);
  589. if (!ls->ls_debug_all_dentry)
  590. goto fail;
  591. memset(name, 0, sizeof(name));
  592. snprintf(name, DLM_LOCKSPACE_LEN+8, "%s_waiters", ls->ls_name);
  593. ls->ls_debug_waiters_dentry = debugfs_create_file(name,
  594. S_IFREG | S_IRUGO,
  595. dlm_root,
  596. ls,
  597. &waiters_fops);
  598. if (!ls->ls_debug_waiters_dentry)
  599. goto fail;
  600. return 0;
  601. fail:
  602. dlm_delete_debug_file(ls);
  603. return -ENOMEM;
  604. }
  605. int __init dlm_register_debugfs(void)
  606. {
  607. mutex_init(&debug_buf_lock);
  608. dlm_root = debugfs_create_dir("dlm", NULL);
  609. return dlm_root ? 0 : -ENOMEM;
  610. }
  611. void dlm_unregister_debugfs(void)
  612. {
  613. debugfs_remove(dlm_root);
  614. }