1 /******************************************************************************
2 *******************************************************************************
4 ** Copyright (C) 2005 Red Hat, Inc. All rights reserved.
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.
10 *******************************************************************************
11 ******************************************************************************/
13 #include <linux/pagemap.h>
14 #include <linux/seq_file.h>
15 #include <linux/module.h>
16 #include <linux/ctype.h>
17 #include <linux/debugfs.h>
19 #include "dlm_internal.h"
22 #define DLM_DEBUG_BUF_LEN 4096
23 static char debug_buf[DLM_DEBUG_BUF_LEN];
24 static struct mutex debug_buf_lock;
26 static struct dentry *dlm_root;
33 struct list_head *next;
38 * dump all rsb's in the lockspace hash table
41 static char *print_lockmode(int mode)
63 static void print_resource_lock(struct seq_file *s, struct dlm_lkb *lkb,
66 seq_printf(s, "%08x %s", lkb->lkb_id, print_lockmode(lkb->lkb_grmode));
68 if (lkb->lkb_status == DLM_LKSTS_CONVERT
69 || lkb->lkb_status == DLM_LKSTS_WAITING)
70 seq_printf(s, " (%s)", print_lockmode(lkb->lkb_rqmode));
72 if (lkb->lkb_nodeid) {
73 if (lkb->lkb_nodeid != res->res_nodeid)
74 seq_printf(s, " Remote: %3d %08x", lkb->lkb_nodeid,
77 seq_printf(s, " Master: %08x", lkb->lkb_remid);
80 if (lkb->lkb_wait_type)
81 seq_printf(s, " wait_type: %d", lkb->lkb_wait_type);
86 static int print_resource(struct dlm_rsb *res, struct seq_file *s)
89 int i, lvblen = res->res_ls->ls_lvblen, recover_list, root_list;
93 seq_printf(s, "\nResource %p Name (len=%d) \"", res, res->res_length);
94 for (i = 0; i < res->res_length; i++) {
95 if (isprint(res->res_name[i]))
96 seq_printf(s, "%c", res->res_name[i]);
98 seq_printf(s, "%c", '.');
100 if (res->res_nodeid > 0)
101 seq_printf(s, "\" \nLocal Copy, Master is node %d\n",
103 else if (res->res_nodeid == 0)
104 seq_printf(s, "\" \nMaster Copy\n");
105 else if (res->res_nodeid == -1)
106 seq_printf(s, "\" \nLooking up master (lkid %x)\n",
107 res->res_first_lkid);
109 seq_printf(s, "\" \nInvalid master %d\n", res->res_nodeid);
112 if (res->res_lvbptr) {
113 seq_printf(s, "LVB: ");
114 for (i = 0; i < lvblen; i++) {
116 seq_printf(s, "\n ");
117 seq_printf(s, "%02x ",
118 (unsigned char) res->res_lvbptr[i]);
120 if (rsb_flag(res, RSB_VALNOTVALID))
121 seq_printf(s, " (INVALID)");
125 root_list = !list_empty(&res->res_root_list);
126 recover_list = !list_empty(&res->res_recover_list);
128 if (root_list || recover_list) {
129 seq_printf(s, "Recovery: root %d recover %d flags %lx "
130 "count %d\n", root_list, recover_list,
131 res->res_flags, res->res_recover_locks_count);
134 /* Print the locks attached to this resource */
135 seq_printf(s, "Granted Queue\n");
136 list_for_each_entry(lkb, &res->res_grantqueue, lkb_statequeue)
137 print_resource_lock(s, lkb, res);
139 seq_printf(s, "Conversion Queue\n");
140 list_for_each_entry(lkb, &res->res_convertqueue, lkb_statequeue)
141 print_resource_lock(s, lkb, res);
143 seq_printf(s, "Waiting Queue\n");
144 list_for_each_entry(lkb, &res->res_waitqueue, lkb_statequeue)
145 print_resource_lock(s, lkb, res);
147 if (list_empty(&res->res_lookup))
150 seq_printf(s, "Lookup Queue\n");
151 list_for_each_entry(lkb, &res->res_lookup, lkb_rsb_lookup) {
152 seq_printf(s, "%08x %s", lkb->lkb_id,
153 print_lockmode(lkb->lkb_rqmode));
154 if (lkb->lkb_wait_type)
155 seq_printf(s, " wait_type: %d", lkb->lkb_wait_type);
163 static void print_lock(struct seq_file *s, struct dlm_lkb *lkb, struct dlm_rsb *r)
165 struct dlm_user_args *ua;
166 unsigned int waiting = 0;
169 if (lkb->lkb_flags & DLM_IFL_USER) {
170 ua = (struct dlm_user_args *) lkb->lkb_astparam;
175 if (lkb->lkb_timestamp)
176 waiting = jiffies_to_msecs(jiffies - lkb->lkb_timestamp);
178 /* id nodeid remid pid xid exflags flags sts grmode rqmode time_ms
179 r_nodeid r_len r_name */
181 seq_printf(s, "%x %d %x %u %llu %x %x %d %d %d %u %u %d \"%s\"\n",
186 (unsigned long long)xid,
198 static int print_locks(struct dlm_rsb *r, struct seq_file *s)
204 list_for_each_entry(lkb, &r->res_grantqueue, lkb_statequeue)
205 print_lock(s, lkb, r);
207 list_for_each_entry(lkb, &r->res_convertqueue, lkb_statequeue)
208 print_lock(s, lkb, r);
210 list_for_each_entry(lkb, &r->res_waitqueue, lkb_statequeue)
211 print_lock(s, lkb, r);
217 static int rsb_iter_next(struct rsb_iter *ri)
219 struct dlm_ls *ls = ri->ls;
224 /* Find the next non-empty hash bucket */
225 for (i = ri->entry; i < ls->ls_rsbtbl_size; i++) {
226 read_lock(&ls->ls_rsbtbl[i].lock);
227 if (!list_empty(&ls->ls_rsbtbl[i].list)) {
228 ri->next = ls->ls_rsbtbl[i].list.next;
229 ri->rsb = list_entry(ri->next, struct dlm_rsb,
231 dlm_hold_rsb(ri->rsb);
232 read_unlock(&ls->ls_rsbtbl[i].lock);
235 read_unlock(&ls->ls_rsbtbl[i].lock);
239 if (ri->entry >= ls->ls_rsbtbl_size)
242 struct dlm_rsb *old = ri->rsb;
244 read_lock(&ls->ls_rsbtbl[i].lock);
245 ri->next = ri->next->next;
246 if (ri->next->next == ls->ls_rsbtbl[i].list.next) {
247 /* End of list - move to next bucket */
250 read_unlock(&ls->ls_rsbtbl[i].lock);
254 ri->rsb = list_entry(ri->next, struct dlm_rsb, res_hashchain);
255 dlm_hold_rsb(ri->rsb);
256 read_unlock(&ls->ls_rsbtbl[i].lock);
263 static void rsb_iter_free(struct rsb_iter *ri)
268 static struct rsb_iter *rsb_iter_init(struct dlm_ls *ls)
272 ri = kzalloc(sizeof *ri, GFP_KERNEL);
280 if (rsb_iter_next(ri)) {
288 static void *rsb_seq_start(struct seq_file *file, loff_t *pos)
293 ri = rsb_iter_init(file->private);
298 if (rsb_iter_next(ri)) {
307 static void *rsb_seq_next(struct seq_file *file, void *iter_ptr, loff_t *pos)
309 struct rsb_iter *ri = iter_ptr;
313 if (rsb_iter_next(ri)) {
321 static void rsb_seq_stop(struct seq_file *file, void *iter_ptr)
323 /* nothing for now */
326 static int rsb_seq_show(struct seq_file *file, void *iter_ptr)
328 struct rsb_iter *ri = iter_ptr;
332 seq_printf(file, "id nodeid remid pid xid exflags flags "
333 "sts grmode rqmode time_ms r_nodeid "
337 print_locks(ri->rsb, file);
339 print_resource(ri->rsb, file);
345 static struct seq_operations rsb_seq_ops = {
346 .start = rsb_seq_start,
347 .next = rsb_seq_next,
348 .stop = rsb_seq_stop,
349 .show = rsb_seq_show,
352 static int rsb_open(struct inode *inode, struct file *file)
354 struct seq_file *seq;
357 ret = seq_open(file, &rsb_seq_ops);
361 seq = file->private_data;
362 seq->private = inode->i_private;
367 static const struct file_operations rsb_fops = {
368 .owner = THIS_MODULE,
372 .release = seq_release
376 * Dump state in compact per-lock listing
379 static struct rsb_iter *locks_iter_init(struct dlm_ls *ls, loff_t *pos)
383 ri = kzalloc(sizeof *ri, GFP_KERNEL);
395 if (rsb_iter_next(ri)) {
403 static void *locks_seq_start(struct seq_file *file, loff_t *pos)
408 ri = locks_iter_init(file->private, pos);
413 if (rsb_iter_next(ri)) {
422 static struct seq_operations locks_seq_ops = {
423 .start = locks_seq_start,
424 .next = rsb_seq_next,
425 .stop = rsb_seq_stop,
426 .show = rsb_seq_show,
429 static int locks_open(struct inode *inode, struct file *file)
431 struct seq_file *seq;
434 ret = seq_open(file, &locks_seq_ops);
438 seq = file->private_data;
439 seq->private = inode->i_private;
444 static const struct file_operations locks_fops = {
445 .owner = THIS_MODULE,
449 .release = seq_release
453 * dump lkb's on the ls_waiters list
456 static int waiters_open(struct inode *inode, struct file *file)
458 file->private_data = inode->i_private;
462 static ssize_t waiters_read(struct file *file, char __user *userbuf,
463 size_t count, loff_t *ppos)
465 struct dlm_ls *ls = file->private_data;
467 size_t len = DLM_DEBUG_BUF_LEN, pos = 0, ret, rv;
469 mutex_lock(&debug_buf_lock);
470 mutex_lock(&ls->ls_waiters_mutex);
471 memset(debug_buf, 0, sizeof(debug_buf));
473 list_for_each_entry(lkb, &ls->ls_waiters, lkb_wait_reply) {
474 ret = snprintf(debug_buf + pos, len - pos, "%x %d %d %s\n",
475 lkb->lkb_id, lkb->lkb_wait_type,
476 lkb->lkb_nodeid, lkb->lkb_resource->res_name);
477 if (ret >= len - pos)
481 mutex_unlock(&ls->ls_waiters_mutex);
483 rv = simple_read_from_buffer(userbuf, count, ppos, debug_buf, pos);
484 mutex_unlock(&debug_buf_lock);
488 static const struct file_operations waiters_fops = {
489 .owner = THIS_MODULE,
490 .open = waiters_open,
494 int dlm_create_debug_file(struct dlm_ls *ls)
496 char name[DLM_LOCKSPACE_LEN+8];
498 ls->ls_debug_rsb_dentry = debugfs_create_file(ls->ls_name,
503 if (!ls->ls_debug_rsb_dentry)
506 memset(name, 0, sizeof(name));
507 snprintf(name, DLM_LOCKSPACE_LEN+8, "%s_waiters", ls->ls_name);
509 ls->ls_debug_waiters_dentry = debugfs_create_file(name,
514 if (!ls->ls_debug_waiters_dentry) {
515 debugfs_remove(ls->ls_debug_rsb_dentry);
519 memset(name, 0, sizeof(name));
520 snprintf(name, DLM_LOCKSPACE_LEN+8, "%s_locks", ls->ls_name);
522 ls->ls_debug_locks_dentry = debugfs_create_file(name,
527 if (!ls->ls_debug_locks_dentry) {
528 debugfs_remove(ls->ls_debug_waiters_dentry);
529 debugfs_remove(ls->ls_debug_rsb_dentry);
536 void dlm_delete_debug_file(struct dlm_ls *ls)
538 if (ls->ls_debug_rsb_dentry)
539 debugfs_remove(ls->ls_debug_rsb_dentry);
540 if (ls->ls_debug_waiters_dentry)
541 debugfs_remove(ls->ls_debug_waiters_dentry);
542 if (ls->ls_debug_locks_dentry)
543 debugfs_remove(ls->ls_debug_locks_dentry);
546 int dlm_register_debugfs(void)
548 mutex_init(&debug_buf_lock);
549 dlm_root = debugfs_create_dir("dlm", NULL);
550 return dlm_root ? 0 : -ENOMEM;
553 void dlm_unregister_debugfs(void)
555 debugfs_remove(dlm_root);