projects / deliverable / linux.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
ocfs2/dlm: Dumps the mles into a debugfs file
[deliverable/linux.git] / fs / ocfs2 / dlm / dlmdebug.c
CommitLineData
6714d8e8
KH		 1/* -*- mode: c; c-basic-offset: 8; -*-
2 * vim: noexpandtab sw=8 ts=8 sts=0:
3 *
4 * dlmdebug.c
5 *
6 * debug functionality for the dlm
7 *
8 * Copyright (C) 2004 Oracle. All rights reserved.
9 *
10 * This program is free software; you can redistribute it and/or
11 * modify it under the terms of the GNU General Public
12 * License as published by the Free Software Foundation; either
13 * version 2 of the License, or (at your option) any later version.
14 *
15 * This program is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 * General Public License for more details.
19 *
20 * You should have received a copy of the GNU General Public
21 * License along with this program; if not, write to the
22 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
23 * Boston, MA 021110-1307, USA.
24 *
25 */
26
27#include <linux/types.h>
28#include <linux/slab.h>
29#include <linux/highmem.h>
30#include <linux/utsname.h>
31#include <linux/sysctl.h>
32#include <linux/spinlock.h>
6325b4a2 33#include <linux/debugfs.h>
6714d8e8
KH		 34
35#include "cluster/heartbeat.h"
36#include "cluster/nodemanager.h"
37#include "cluster/tcp.h"
38
39#include "dlmapi.h"
40#include "dlmcommon.h"
6714d8e8 41#include "dlmdomain.h"
6325b4a2 42#include "dlmdebug.h"
6714d8e8
KH		 43
44#define MLOG_MASK_PREFIX ML_DLM
45#include "cluster/masklog.h"
46
47void dlm_print_one_lock_resource(struct dlm_lock_resource *res)
48{
49 mlog(ML_NOTICE, "lockres: %.*s, owner=%u, state=%u\n",
50 res->lockname.len, res->lockname.name,
51 res->owner, res->state);
52 spin_lock(&res->spinlock);
53 __dlm_print_one_lock_resource(res);
54 spin_unlock(&res->spinlock);
55}
56
ba2bf218
KH		 57static void dlm_print_lockres_refmap(struct dlm_lock_resource *res)
58{
59 int bit;
60 assert_spin_locked(&res->spinlock);
61
62 mlog(ML_NOTICE, " refmap nodes: [ ");
63 bit = 0;
64 while (1) {
65 bit = find_next_bit(res->refmap, O2NM_MAX_NODES, bit);
66 if (bit >= O2NM_MAX_NODES)
67 break;
68 printk("%u ", bit);
69 bit++;
70 }
71 printk("], inflight=%u\n", res->inflight_locks);
72}
73
6714d8e8
KH		 74void __dlm_print_one_lock_resource(struct dlm_lock_resource *res)
75{
76 struct list_head *iter2;
77 struct dlm_lock *lock;
78
79 assert_spin_locked(&res->spinlock);
80
81 mlog(ML_NOTICE, "lockres: %.*s, owner=%u, state=%u\n",
82 res->lockname.len, res->lockname.name,
83 res->owner, res->state);
84 mlog(ML_NOTICE, " last used: %lu, on purge list: %s\n",
85 res->last_used, list_empty(&res->purge) ? "no" : "yes");
ba2bf218 86 dlm_print_lockres_refmap(res);
6714d8e8
KH		 87 mlog(ML_NOTICE, " granted queue: \n");
88 list_for_each(iter2, &res->granted) {
89 lock = list_entry(iter2, struct dlm_lock, list);
90 spin_lock(&lock->spinlock);
91 mlog(ML_NOTICE, " type=%d, conv=%d, node=%u, "
29004858
KH		 92 "cookie=%u:%llu, ast=(empty=%c,pend=%c), bast=(empty=%c,pend=%c)\n",
93 lock->ml.type, lock->ml.convert_type, lock->ml.node,
74aa2585
KH		 94 dlm_get_lock_cookie_node(be64_to_cpu(lock->ml.cookie)),
95 dlm_get_lock_cookie_seq(be64_to_cpu(lock->ml.cookie)),
6714d8e8
KH		 96 list_empty(&lock->ast_list) ? 'y' : 'n',
97 lock->ast_pending ? 'y' : 'n',
98 list_empty(&lock->bast_list) ? 'y' : 'n',
99 lock->bast_pending ? 'y' : 'n');
100 spin_unlock(&lock->spinlock);
101 }
102 mlog(ML_NOTICE, " converting queue: \n");
103 list_for_each(iter2, &res->converting) {
104 lock = list_entry(iter2, struct dlm_lock, list);
105 spin_lock(&lock->spinlock);
106 mlog(ML_NOTICE, " type=%d, conv=%d, node=%u, "
29004858
KH		 107 "cookie=%u:%llu, ast=(empty=%c,pend=%c), bast=(empty=%c,pend=%c)\n",
108 lock->ml.type, lock->ml.convert_type, lock->ml.node,
74aa2585
KH		 109 dlm_get_lock_cookie_node(be64_to_cpu(lock->ml.cookie)),
110 dlm_get_lock_cookie_seq(be64_to_cpu(lock->ml.cookie)),
6714d8e8
KH		 111 list_empty(&lock->ast_list) ? 'y' : 'n',
112 lock->ast_pending ? 'y' : 'n',
113 list_empty(&lock->bast_list) ? 'y' : 'n',
114 lock->bast_pending ? 'y' : 'n');
115 spin_unlock(&lock->spinlock);
116 }
117 mlog(ML_NOTICE, " blocked queue: \n");
118 list_for_each(iter2, &res->blocked) {
119 lock = list_entry(iter2, struct dlm_lock, list);
120 spin_lock(&lock->spinlock);
121 mlog(ML_NOTICE, " type=%d, conv=%d, node=%u, "
29004858
KH		 122 "cookie=%u:%llu, ast=(empty=%c,pend=%c), bast=(empty=%c,pend=%c)\n",
123 lock->ml.type, lock->ml.convert_type, lock->ml.node,
74aa2585
KH		 124 dlm_get_lock_cookie_node(be64_to_cpu(lock->ml.cookie)),
125 dlm_get_lock_cookie_seq(be64_to_cpu(lock->ml.cookie)),
6714d8e8
KH		 126 list_empty(&lock->ast_list) ? 'y' : 'n',
127 lock->ast_pending ? 'y' : 'n',
128 list_empty(&lock->bast_list) ? 'y' : 'n',
129 lock->bast_pending ? 'y' : 'n');
130 spin_unlock(&lock->spinlock);
131 }
132}
133
134void dlm_print_one_lock(struct dlm_lock *lockid)
135{
136 dlm_print_one_lock_resource(lockid->lockres);
137}
138EXPORT_SYMBOL_GPL(dlm_print_one_lock);
139
3fb5a989 140#if 0
6714d8e8
KH		 141void dlm_dump_lock_resources(struct dlm_ctxt *dlm)
142{
143 struct dlm_lock_resource *res;
81f2094a
MF		 144 struct hlist_node *iter;
145 struct hlist_head *bucket;
6714d8e8
KH		 146 int i;
147
148 mlog(ML_NOTICE, "struct dlm_ctxt: %s, node=%u, key=%u\n",
149 dlm->name, dlm->node_num, dlm->key);
150 if (!dlm || !dlm->name) {
151 mlog(ML_ERROR, "dlm=%p\n", dlm);
152 return;
153 }
154
155 spin_lock(&dlm->spinlock);
81f2094a 156 for (i=0; i<DLM_HASH_BUCKETS; i++) {
03d864c0 157 bucket = dlm_lockres_hash(dlm, i);
81f2094a 158 hlist_for_each_entry(res, iter, bucket, hash_node)
6714d8e8 159 dlm_print_one_lock_resource(res);
6714d8e8
KH		 160 }
161 spin_unlock(&dlm->spinlock);
162}
3fb5a989 163#endif /* 0 */
6714d8e8
KH		 164
165static const char *dlm_errnames[] = {
166 [DLM_NORMAL] = "DLM_NORMAL",
167 [DLM_GRANTED] = "DLM_GRANTED",
168 [DLM_DENIED] = "DLM_DENIED",
169 [DLM_DENIED_NOLOCKS] = "DLM_DENIED_NOLOCKS",
170 [DLM_WORKING] = "DLM_WORKING",
171 [DLM_BLOCKED] = "DLM_BLOCKED",
172 [DLM_BLOCKED_ORPHAN] = "DLM_BLOCKED_ORPHAN",
173 [DLM_DENIED_GRACE_PERIOD] = "DLM_DENIED_GRACE_PERIOD",
174 [DLM_SYSERR] = "DLM_SYSERR",
175 [DLM_NOSUPPORT] = "DLM_NOSUPPORT",
176 [DLM_CANCELGRANT] = "DLM_CANCELGRANT",
177 [DLM_IVLOCKID] = "DLM_IVLOCKID",
178 [DLM_SYNC] = "DLM_SYNC",
179 [DLM_BADTYPE] = "DLM_BADTYPE",
180 [DLM_BADRESOURCE] = "DLM_BADRESOURCE",
181 [DLM_MAXHANDLES] = "DLM_MAXHANDLES",
182 [DLM_NOCLINFO] = "DLM_NOCLINFO",
183 [DLM_NOLOCKMGR] = "DLM_NOLOCKMGR",
184 [DLM_NOPURGED] = "DLM_NOPURGED",
185 [DLM_BADARGS] = "DLM_BADARGS",
186 [DLM_VOID] = "DLM_VOID",
187 [DLM_NOTQUEUED] = "DLM_NOTQUEUED",
188 [DLM_IVBUFLEN] = "DLM_IVBUFLEN",
189 [DLM_CVTUNGRANT] = "DLM_CVTUNGRANT",
190 [DLM_BADPARAM] = "DLM_BADPARAM",
191 [DLM_VALNOTVALID] = "DLM_VALNOTVALID",
192 [DLM_REJECTED] = "DLM_REJECTED",
193 [DLM_ABORT] = "DLM_ABORT",
194 [DLM_CANCEL] = "DLM_CANCEL",
195 [DLM_IVRESHANDLE] = "DLM_IVRESHANDLE",
196 [DLM_DEADLOCK] = "DLM_DEADLOCK",
197 [DLM_DENIED_NOASTS] = "DLM_DENIED_NOASTS",
198 [DLM_FORWARD] = "DLM_FORWARD",
199 [DLM_TIMEOUT] = "DLM_TIMEOUT",
200 [DLM_IVGROUPID] = "DLM_IVGROUPID",
201 [DLM_VERS_CONFLICT] = "DLM_VERS_CONFLICT",
202 [DLM_BAD_DEVICE_PATH] = "DLM_BAD_DEVICE_PATH",
203 [DLM_NO_DEVICE_PERMISSION] = "DLM_NO_DEVICE_PERMISSION",
204 [DLM_NO_CONTROL_DEVICE ] = "DLM_NO_CONTROL_DEVICE ",
205 [DLM_RECOVERING] = "DLM_RECOVERING",
206 [DLM_MIGRATING] = "DLM_MIGRATING",
207 [DLM_MAXSTATS] = "DLM_MAXSTATS",
208};
209
210static const char *dlm_errmsgs[] = {
211 [DLM_NORMAL] = "request in progress",
212 [DLM_GRANTED] = "request granted",
213 [DLM_DENIED] = "request denied",
214 [DLM_DENIED_NOLOCKS] = "request denied, out of system resources",
215 [DLM_WORKING] = "async request in progress",
216 [DLM_BLOCKED] = "lock request blocked",
217 [DLM_BLOCKED_ORPHAN] = "lock request blocked by a orphan lock",
218 [DLM_DENIED_GRACE_PERIOD] = "topological change in progress",
219 [DLM_SYSERR] = "system error",
220 [DLM_NOSUPPORT] = "unsupported",
221 [DLM_CANCELGRANT] = "can't cancel convert: already granted",
222 [DLM_IVLOCKID] = "bad lockid",
223 [DLM_SYNC] = "synchronous request granted",
224 [DLM_BADTYPE] = "bad resource type",
225 [DLM_BADRESOURCE] = "bad resource handle",
226 [DLM_MAXHANDLES] = "no more resource handles",
227 [DLM_NOCLINFO] = "can't contact cluster manager",
228 [DLM_NOLOCKMGR] = "can't contact lock manager",
229 [DLM_NOPURGED] = "can't contact purge daemon",
230 [DLM_BADARGS] = "bad api args",
231 [DLM_VOID] = "no status",
232 [DLM_NOTQUEUED] = "NOQUEUE was specified and request failed",
233 [DLM_IVBUFLEN] = "invalid resource name length",
234 [DLM_CVTUNGRANT] = "attempted to convert ungranted lock",
235 [DLM_BADPARAM] = "invalid lock mode specified",
236 [DLM_VALNOTVALID] = "value block has been invalidated",
237 [DLM_REJECTED] = "request rejected, unrecognized client",
238 [DLM_ABORT] = "blocked lock request cancelled",
239 [DLM_CANCEL] = "conversion request cancelled",
240 [DLM_IVRESHANDLE] = "invalid resource handle",
241 [DLM_DEADLOCK] = "deadlock recovery refused this request",
242 [DLM_DENIED_NOASTS] = "failed to allocate AST",
243 [DLM_FORWARD] = "request must wait for primary's response",
244 [DLM_TIMEOUT] = "timeout value for lock has expired",
245 [DLM_IVGROUPID] = "invalid group specification",
246 [DLM_VERS_CONFLICT] = "version conflicts prevent request handling",
247 [DLM_BAD_DEVICE_PATH] = "Locks device does not exist or path wrong",
248 [DLM_NO_DEVICE_PERMISSION] = "Client has insufficient perms for device",
249 [DLM_NO_CONTROL_DEVICE] = "Cannot set options on opened device ",
250 [DLM_RECOVERING] = "lock resource being recovered",
251 [DLM_MIGRATING] = "lock resource being migrated",
252 [DLM_MAXSTATS] = "invalid error number",
253};
254
255const char *dlm_errmsg(enum dlm_status err)
256{
257 if (err >= DLM_MAXSTATS || err < 0)
258 return dlm_errmsgs[DLM_MAXSTATS];
259 return dlm_errmsgs[err];
260}
261EXPORT_SYMBOL_GPL(dlm_errmsg);
262
263const char *dlm_errname(enum dlm_status err)
264{
265 if (err >= DLM_MAXSTATS || err < 0)
266 return dlm_errnames[DLM_MAXSTATS];
267 return dlm_errnames[err];
268}
269EXPORT_SYMBOL_GPL(dlm_errname);
6325b4a2
SM		 270
271
272#ifdef CONFIG_DEBUG_FS
273
274static struct dentry *dlm_debugfs_root = NULL;
275
4e3d24ed
SM		 276/* NOTE: This function converts a lockname into a string. It uses knowledge
277 * of the format of the lockname that should be outside the purview of the dlm.
278 * We are adding only to make dlm debugging slightly easier.
279 *
280 * For more on lockname formats, please refer to dlmglue.c and ocfs2_lockid.h.
281 */
282static int stringify_lockname(const char *lockname, int locklen,
283 char *buf, int len)
284{
285 int out = 0;
286 __be64 inode_blkno_be;
287
288#define OCFS2_DENTRY_LOCK_INO_START 18
289 if (*lockname == 'N') {
290 memcpy((__be64 *)&inode_blkno_be,
291 (char *)&lockname[OCFS2_DENTRY_LOCK_INO_START],
292 sizeof(__be64));
293 out += snprintf(buf + out, len - out, "%.*s%08x",
294 OCFS2_DENTRY_LOCK_INO_START - 1, lockname,
295 (unsigned int)be64_to_cpu(inode_blkno_be));
296 } else
297 out += snprintf(buf + out, len - out, "%.*s",
298 locklen, lockname);
299 return out;
300}
301
6325b4a2 302#define DLM_DEBUGFS_DIR "o2dlm"
007dce53 303#define DLM_DEBUGFS_DLM_STATE "dlm_state"
4e3d24ed 304#define DLM_DEBUGFS_LOCKING_STATE "locking_state"
d0129ace 305#define DLM_DEBUGFS_MLE_STATE "mle_state"
007dce53
SM		 306
307/* begin - utils funcs */
308static void dlm_debug_free(struct kref *kref)
309{
310 struct dlm_debug_ctxt *dc;
311
312 dc = container_of(kref, struct dlm_debug_ctxt, debug_refcnt);
313
314 kfree(dc);
315}
316
317void dlm_debug_put(struct dlm_debug_ctxt *dc)
318{
319 if (dc)
320 kref_put(&dc->debug_refcnt, dlm_debug_free);
321}
322
323static void dlm_debug_get(struct dlm_debug_ctxt *dc)
324{
325 kref_get(&dc->debug_refcnt);
326}
327
328static int stringify_nodemap(unsigned long *nodemap, int maxnodes,
329 char *buf, int len)
330{
331 int out = 0;
332 int i = -1;
333
334 while ((i = find_next_bit(nodemap, maxnodes, i + 1)) < maxnodes)
335 out += snprintf(buf + out, len - out, "%d ", i);
336
337 return out;
338}
339
340static struct debug_buffer *debug_buffer_allocate(void)
341{
342 struct debug_buffer *db = NULL;
343
344 db = kzalloc(sizeof(struct debug_buffer), GFP_KERNEL);
345 if (!db)
346 goto bail;
347
348 db->len = PAGE_SIZE;
349 db->buf = kmalloc(db->len, GFP_KERNEL);
350 if (!db->buf)
351 goto bail;
352
353 return db;
354bail:
355 kfree(db);
356 return NULL;
357}
358
359static ssize_t debug_buffer_read(struct file *file, char __user *buf,
360 size_t nbytes, loff_t *ppos)
361{
362 struct debug_buffer *db = file->private_data;
363
364 return simple_read_from_buffer(buf, nbytes, ppos, db->buf, db->len);
365}
366
367static loff_t debug_buffer_llseek(struct file *file, loff_t off, int whence)
368{
369 struct debug_buffer *db = file->private_data;
370 loff_t new = -1;
371
372 switch (whence) {
373 case 0:
374 new = off;
375 break;
376 case 1:
377 new = file->f_pos + off;
378 break;
379 }
380
381 if (new < 0 || new > db->len)
382 return -EINVAL;
383
384 return (file->f_pos = new);
385}
386
387static int debug_buffer_release(struct inode *inode, struct file *file)
388{
389 struct debug_buffer *db = (struct debug_buffer *)file->private_data;
390
391 if (db)
392 kfree(db->buf);
393 kfree(db);
394
395 return 0;
396}
397/* end - util funcs */
398
d0129ace
SM		 399/* begin - debug mle funcs */
400static int dump_mle(struct dlm_master_list_entry *mle, char *buf, int len)
401{
402 int out = 0;
403 unsigned int namelen;
404 const char *name;
405 char *mle_type;
406
407 if (mle->type != DLM_MLE_MASTER) {
408 namelen = mle->u.name.len;
409 name = mle->u.name.name;
410 } else {
411 namelen = mle->u.res->lockname.len;
412 name = mle->u.res->lockname.name;
413 }
414
415 if (mle->type == DLM_MLE_BLOCK)
416 mle_type = "BLK";
417 else if (mle->type == DLM_MLE_MASTER)
418 mle_type = "MAS";
419 else
420 mle_type = "MIG";
421
422 out += stringify_lockname(name, namelen, buf + out, len - out);
423 out += snprintf(buf + out, len - out,
424 "\t%3s\tmas=%3u\tnew=%3u\tevt=%1d\tuse=%1d\tref=%3d\n",
425 mle_type, mle->master, mle->new_master,
426 !list_empty(&mle->hb_events),
427 !!mle->inuse,
428 atomic_read(&mle->mle_refs.refcount));
429
430 out += snprintf(buf + out, len - out, "Maybe=");
431 out += stringify_nodemap(mle->maybe_map, O2NM_MAX_NODES,
432 buf + out, len - out);
433 out += snprintf(buf + out, len - out, "\n");
434
435 out += snprintf(buf + out, len - out, "Vote=");
436 out += stringify_nodemap(mle->vote_map, O2NM_MAX_NODES,
437 buf + out, len - out);
438 out += snprintf(buf + out, len - out, "\n");
439
440 out += snprintf(buf + out, len - out, "Response=");
441 out += stringify_nodemap(mle->response_map, O2NM_MAX_NODES,
442 buf + out, len - out);
443 out += snprintf(buf + out, len - out, "\n");
444
445 out += snprintf(buf + out, len - out, "Node=");
446 out += stringify_nodemap(mle->node_map, O2NM_MAX_NODES,
447 buf + out, len - out);
448 out += snprintf(buf + out, len - out, "\n");
449
450 out += snprintf(buf + out, len - out, "\n");
451
452 return out;
453}
454
455static int debug_mle_print(struct dlm_ctxt *dlm, struct debug_buffer *db)
456{
457 struct dlm_master_list_entry *mle;
458 int out = 0;
459 unsigned long total = 0;
460
461 out += snprintf(db->buf + out, db->len - out,
462 "Dumping MLEs for Domain: %s\n", dlm->name);
463
464 spin_lock(&dlm->master_lock);
465 list_for_each_entry(mle, &dlm->master_list, list) {
466 ++total;
467 if (db->len - out < 200)
468 continue;
469 out += dump_mle(mle, db->buf + out, db->len - out);
470 }
471 spin_unlock(&dlm->master_lock);
472
473 out += snprintf(db->buf + out, db->len - out,
474 "Total on list: %ld\n", total);
475 return out;
476}
477
478static int debug_mle_open(struct inode *inode, struct file *file)
479{
480 struct dlm_ctxt *dlm = inode->i_private;
481 struct debug_buffer *db;
482
483 db = debug_buffer_allocate();
484 if (!db)
485 goto bail;
486
487 db->len = debug_mle_print(dlm, db);
488
489 file->private_data = db;
490
491 return 0;
492bail:
493 return -ENOMEM;
494}
495
496static struct file_operations debug_mle_fops = {
497 .open = debug_mle_open,
498 .release = debug_buffer_release,
499 .read = debug_buffer_read,
500 .llseek = debug_buffer_llseek,
501};
502
503/* end - debug mle funcs */
504
4e3d24ed
SM		 505/* begin - debug lockres funcs */
506static int dump_lock(struct dlm_lock *lock, int list_type, char *buf, int len)
507{
508 int out;
509
510#define DEBUG_LOCK_VERSION 1
511 spin_lock(&lock->spinlock);
512 out = snprintf(buf, len, "LOCK:%d,%d,%d,%d,%d,%d:%lld,%d,%d,%d,%d,%d,"
513 "%d,%d,%d,%d\n",
514 DEBUG_LOCK_VERSION,
515 list_type, lock->ml.type, lock->ml.convert_type,
516 lock->ml.node,
517 dlm_get_lock_cookie_node(be64_to_cpu(lock->ml.cookie)),
518 dlm_get_lock_cookie_seq(be64_to_cpu(lock->ml.cookie)),
519 !list_empty(&lock->ast_list),
520 !list_empty(&lock->bast_list),
521 lock->ast_pending, lock->bast_pending,
522 lock->convert_pending, lock->lock_pending,
523 lock->cancel_pending, lock->unlock_pending,
524 atomic_read(&lock->lock_refs.refcount));
525 spin_unlock(&lock->spinlock);
526
527 return out;
528}
529
530static int dump_lockres(struct dlm_lock_resource *res, char *buf, int len)
531{
532 struct dlm_lock *lock;
533 int i;
534 int out = 0;
535
536 out += snprintf(buf + out, len - out, "NAME:");
537 out += stringify_lockname(res->lockname.name, res->lockname.len,
538 buf + out, len - out);
539 out += snprintf(buf + out, len - out, "\n");
540
541#define DEBUG_LRES_VERSION 1
542 out += snprintf(buf + out, len - out,
543 "LRES:%d,%d,%d,%ld,%d,%d,%d,%d,%d,%d,%d\n",
544 DEBUG_LRES_VERSION,
545 res->owner, res->state, res->last_used,
546 !list_empty(&res->purge),
547 !list_empty(&res->dirty),
548 !list_empty(&res->recovering),
549 res->inflight_locks, res->migration_pending,
550 atomic_read(&res->asts_reserved),
551 atomic_read(&res->refs.refcount));
552
553 /* refmap */
554 out += snprintf(buf + out, len - out, "RMAP:");
555 out += stringify_nodemap(res->refmap, O2NM_MAX_NODES,
556 buf + out, len - out);
557 out += snprintf(buf + out, len - out, "\n");
558
559 /* lvb */
560 out += snprintf(buf + out, len - out, "LVBX:");
561 for (i = 0; i < DLM_LVB_LEN; i++)
562 out += snprintf(buf + out, len - out,
563 "%02x", (unsigned char)res->lvb[i]);
564 out += snprintf(buf + out, len - out, "\n");
565
566 /* granted */
567 list_for_each_entry(lock, &res->granted, list)
568 out += dump_lock(lock, 0, buf + out, len - out);
569
570 /* converting */
571 list_for_each_entry(lock, &res->converting, list)
572 out += dump_lock(lock, 1, buf + out, len - out);
573
574 /* blocked */
575 list_for_each_entry(lock, &res->blocked, list)
576 out += dump_lock(lock, 2, buf + out, len - out);
577
578 out += snprintf(buf + out, len - out, "\n");
579
580 return out;
581}
582
583static void *lockres_seq_start(struct seq_file *m, loff_t *pos)
584{
585 struct debug_lockres *dl = m->private;
586 struct dlm_ctxt *dlm = dl->dl_ctxt;
587 struct dlm_lock_resource *res = NULL;
588
589 spin_lock(&dlm->spinlock);
590
591 if (dl->dl_res) {
592 list_for_each_entry(res, &dl->dl_res->tracking, tracking) {
593 if (dl->dl_res) {
594 dlm_lockres_put(dl->dl_res);
595 dl->dl_res = NULL;
596 }
597 if (&res->tracking == &dlm->tracking_list) {
598 mlog(0, "End of list found, %p\n", res);
599 dl = NULL;
600 break;
601 }
602 dlm_lockres_get(res);
603 dl->dl_res = res;
604 break;
605 }
606 } else {
607 if (!list_empty(&dlm->tracking_list)) {
608 list_for_each_entry(res, &dlm->tracking_list, tracking)
609 break;
610 dlm_lockres_get(res);
611 dl->dl_res = res;
612 } else
613 dl = NULL;
614 }
615
616 if (dl) {
617 spin_lock(&dl->dl_res->spinlock);
618 dump_lockres(dl->dl_res, dl->dl_buf, dl->dl_len - 1);
619 spin_unlock(&dl->dl_res->spinlock);
620 }
621
622 spin_unlock(&dlm->spinlock);
623
624 return dl;
625}
626
627static void lockres_seq_stop(struct seq_file *m, void *v)
628{
629}
630
631static void *lockres_seq_next(struct seq_file *m, void *v, loff_t *pos)
632{
633 return NULL;
634}
635
636static int lockres_seq_show(struct seq_file *s, void *v)
637{
638 struct debug_lockres *dl = (struct debug_lockres *)v;
639
640 seq_printf(s, "%s", dl->dl_buf);
641
642 return 0;
643}
644
645static struct seq_operations debug_lockres_ops = {
646 .start = lockres_seq_start,
647 .stop = lockres_seq_stop,
648 .next = lockres_seq_next,
649 .show = lockres_seq_show,
650};
651
652static int debug_lockres_open(struct inode *inode, struct file *file)
653{
654 struct dlm_ctxt *dlm = inode->i_private;
655 int ret = -ENOMEM;
656 struct seq_file *seq;
657 struct debug_lockres *dl = NULL;
658
659 dl = kzalloc(sizeof(struct debug_lockres), GFP_KERNEL);
660 if (!dl) {
661 mlog_errno(ret);
662 goto bail;
663 }
664
665 dl->dl_len = PAGE_SIZE;
666 dl->dl_buf = kmalloc(dl->dl_len, GFP_KERNEL);
667 if (!dl->dl_buf) {
668 mlog_errno(ret);
669 goto bail;
670 }
671
672 ret = seq_open(file, &debug_lockres_ops);
673 if (ret) {
674 mlog_errno(ret);
675 goto bail;
676 }
677
678 seq = (struct seq_file *) file->private_data;
679 seq->private = dl;
680
681 dlm_grab(dlm);
682 dl->dl_ctxt = dlm;
683
684 return 0;
685bail:
686 if (dl)
687 kfree(dl->dl_buf);
688 kfree(dl);
689 return ret;
690}
691
692static int debug_lockres_release(struct inode *inode, struct file *file)
693{
694 struct seq_file *seq = (struct seq_file *)file->private_data;
695 struct debug_lockres *dl = (struct debug_lockres *)seq->private;
696
697 if (dl->dl_res)
698 dlm_lockres_put(dl->dl_res);
699 dlm_put(dl->dl_ctxt);
700 kfree(dl->dl_buf);
701 return seq_release_private(inode, file);
702}
703
704static struct file_operations debug_lockres_fops = {
705 .open = debug_lockres_open,
706 .release = debug_lockres_release,
707 .read = seq_read,
708 .llseek = seq_lseek,
709};
710/* end - debug lockres funcs */
711
007dce53
SM		 712/* begin - debug state funcs */
713static int debug_state_print(struct dlm_ctxt *dlm, struct debug_buffer *db)
714{
715 int out = 0;
716 struct dlm_reco_node_data *node;
717 char *state;
718 int lres, rres, ures, tres;
719
720 lres = atomic_read(&dlm->local_resources);
721 rres = atomic_read(&dlm->remote_resources);
722 ures = atomic_read(&dlm->unknown_resources);
723 tres = lres + rres + ures;
724
725 spin_lock(&dlm->spinlock);
726
727 switch (dlm->dlm_state) {
728 case DLM_CTXT_NEW:
729 state = "NEW"; break;
730 case DLM_CTXT_JOINED:
731 state = "JOINED"; break;
732 case DLM_CTXT_IN_SHUTDOWN:
733 state = "SHUTDOWN"; break;
734 case DLM_CTXT_LEAVING:
735 state = "LEAVING"; break;
736 default:
737 state = "UNKNOWN"; break;
738 }
739
740 /* Domain: xxxxxxxxxx Key: 0xdfbac769 */
741 out += snprintf(db->buf + out, db->len - out,
742 "Domain: %s Key: 0x%08x\n", dlm->name, dlm->key);
743
744 /* Thread Pid: xxx Node: xxx State: xxxxx */
745 out += snprintf(db->buf + out, db->len - out,
746 "Thread Pid: %d Node: %d State: %s\n",
747 dlm->dlm_thread_task->pid, dlm->node_num, state);
748
749 /* Number of Joins: xxx Joining Node: xxx */
750 out += snprintf(db->buf + out, db->len - out,
751 "Number of Joins: %d Joining Node: %d\n",
752 dlm->num_joins, dlm->joining_node);
753
754 /* Domain Map: xx xx xx */
755 out += snprintf(db->buf + out, db->len - out, "Domain Map: ");
756 out += stringify_nodemap(dlm->domain_map, O2NM_MAX_NODES,
757 db->buf + out, db->len - out);
758 out += snprintf(db->buf + out, db->len - out, "\n");
759
760 /* Live Map: xx xx xx */
761 out += snprintf(db->buf + out, db->len - out, "Live Map: ");
762 out += stringify_nodemap(dlm->live_nodes_map, O2NM_MAX_NODES,
763 db->buf + out, db->len - out);
764 out += snprintf(db->buf + out, db->len - out, "\n");
765
766 /* Mastered Resources Total: xxx Locally: xxx Remotely: ... */
767 out += snprintf(db->buf + out, db->len - out,
768 "Mastered Resources Total: %d Locally: %d "
769 "Remotely: %d Unknown: %d\n",
770 tres, lres, rres, ures);
771
772 /* Lists: Dirty=Empty Purge=InUse PendingASTs=Empty ... */
773 out += snprintf(db->buf + out, db->len - out,
774 "Lists: Dirty=%s Purge=%s PendingASTs=%s "
775 "PendingBASTs=%s Master=%s\n",
776 (list_empty(&dlm->dirty_list) ? "Empty" : "InUse"),
777 (list_empty(&dlm->purge_list) ? "Empty" : "InUse"),
778 (list_empty(&dlm->pending_asts) ? "Empty" : "InUse"),
779 (list_empty(&dlm->pending_basts) ? "Empty" : "InUse"),
780 (list_empty(&dlm->master_list) ? "Empty" : "InUse"));
781
782 /* Purge Count: xxx Refs: xxx */
783 out += snprintf(db->buf + out, db->len - out,
784 "Purge Count: %d Refs: %d\n", dlm->purge_count,
785 atomic_read(&dlm->dlm_refs.refcount));
786
787 /* Dead Node: xxx */
788 out += snprintf(db->buf + out, db->len - out,
789 "Dead Node: %d\n", dlm->reco.dead_node);
790
791 /* What about DLM_RECO_STATE_FINALIZE? */
792 if (dlm->reco.state == DLM_RECO_STATE_ACTIVE)
793 state = "ACTIVE";
794 else
795 state = "INACTIVE";
796
797 /* Recovery Pid: xxxx Master: xxx State: xxxx */
798 out += snprintf(db->buf + out, db->len - out,
799 "Recovery Pid: %d Master: %d State: %s\n",
800 dlm->dlm_reco_thread_task->pid,
801 dlm->reco.new_master, state);
802
803 /* Recovery Map: xx xx */
804 out += snprintf(db->buf + out, db->len - out, "Recovery Map: ");
805 out += stringify_nodemap(dlm->recovery_map, O2NM_MAX_NODES,
806 db->buf + out, db->len - out);
807 out += snprintf(db->buf + out, db->len - out, "\n");
808
809 /* Recovery Node State: */
810 out += snprintf(db->buf + out, db->len - out, "Recovery Node State:\n");
811 list_for_each_entry(node, &dlm->reco.node_data, list) {
812 switch (node->state) {
813 case DLM_RECO_NODE_DATA_INIT:
814 state = "INIT";
815 break;
816 case DLM_RECO_NODE_DATA_REQUESTING:
817 state = "REQUESTING";
818 break;
819 case DLM_RECO_NODE_DATA_DEAD:
820 state = "DEAD";
821 break;
822 case DLM_RECO_NODE_DATA_RECEIVING:
823 state = "RECEIVING";
824 break;
825 case DLM_RECO_NODE_DATA_REQUESTED:
826 state = "REQUESTED";
827 break;
828 case DLM_RECO_NODE_DATA_DONE:
829 state = "DONE";
830 break;
831 case DLM_RECO_NODE_DATA_FINALIZE_SENT:
832 state = "FINALIZE-SENT";
833 break;
834 default:
835 state = "BAD";
836 break;
837 }
838 out += snprintf(db->buf + out, db->len - out, "\t%u - %s\n",
839 node->node_num, state);
840 }
841
842 spin_unlock(&dlm->spinlock);
843
844 return out;
845}
846
847static int debug_state_open(struct inode *inode, struct file *file)
848{
849 struct dlm_ctxt *dlm = inode->i_private;
850 struct debug_buffer *db = NULL;
851
852 db = debug_buffer_allocate();
853 if (!db)
854 goto bail;
855
856 db->len = debug_state_print(dlm, db);
857
858 file->private_data = db;
859
860 return 0;
861bail:
862 return -ENOMEM;
863}
864
865static struct file_operations debug_state_fops = {
866 .open = debug_state_open,
867 .release = debug_buffer_release,
868 .read = debug_buffer_read,
869 .llseek = debug_buffer_llseek,
870};
871/* end - debug state funcs */
872
873/* files in subroot */
874int dlm_debug_init(struct dlm_ctxt *dlm)
875{
876 struct dlm_debug_ctxt *dc = dlm->dlm_debug_ctxt;
877
878 /* for dumping dlm_ctxt */
879 dc->debug_state_dentry = debugfs_create_file(DLM_DEBUGFS_DLM_STATE,
880 S_IFREG|S_IRUSR,
881 dlm->dlm_debugfs_subroot,
882 dlm, &debug_state_fops);
883 if (!dc->debug_state_dentry) {
884 mlog_errno(-ENOMEM);
885 goto bail;
886 }
887
4e3d24ed
SM		 888 /* for dumping lockres */
889 dc->debug_lockres_dentry =
890 debugfs_create_file(DLM_DEBUGFS_LOCKING_STATE,
891 S_IFREG|S_IRUSR,
892 dlm->dlm_debugfs_subroot,
893 dlm, &debug_lockres_fops);
894 if (!dc->debug_lockres_dentry) {
895 mlog_errno(-ENOMEM);
896 goto bail;
897 }
898
d0129ace
SM		 899 /* for dumping mles */
900 dc->debug_mle_dentry = debugfs_create_file(DLM_DEBUGFS_MLE_STATE,
901 S_IFREG|S_IRUSR,
902 dlm->dlm_debugfs_subroot,
903 dlm, &debug_mle_fops);
904 if (!dc->debug_mle_dentry) {
905 mlog_errno(-ENOMEM);
906 goto bail;
907 }
908
007dce53
SM		 909 dlm_debug_get(dc);
910 return 0;
911
912bail:
913 dlm_debug_shutdown(dlm);
914 return -ENOMEM;
915}
916
917void dlm_debug_shutdown(struct dlm_ctxt *dlm)
918{
919 struct dlm_debug_ctxt *dc = dlm->dlm_debug_ctxt;
920
921 if (dc) {
d0129ace
SM		 922 if (dc->debug_mle_dentry)
923 debugfs_remove(dc->debug_mle_dentry);
4e3d24ed
SM		 924 if (dc->debug_lockres_dentry)
925 debugfs_remove(dc->debug_lockres_dentry);
007dce53
SM		 926 if (dc->debug_state_dentry)
927 debugfs_remove(dc->debug_state_dentry);
928 dlm_debug_put(dc);
929 }
930}
6325b4a2
SM		 931
932/* subroot - domain dir */
933int dlm_create_debugfs_subroot(struct dlm_ctxt *dlm)
934{
935 dlm->dlm_debugfs_subroot = debugfs_create_dir(dlm->name,
936 dlm_debugfs_root);
937 if (!dlm->dlm_debugfs_subroot) {
938 mlog_errno(-ENOMEM);
939 goto bail;
940 }
941
007dce53
SM		 942 dlm->dlm_debug_ctxt = kzalloc(sizeof(struct dlm_debug_ctxt),
943 GFP_KERNEL);
944 if (!dlm->dlm_debug_ctxt) {
945 mlog_errno(-ENOMEM);
946 goto bail;
947 }
948 kref_init(&dlm->dlm_debug_ctxt->debug_refcnt);
949
6325b4a2
SM		 950 return 0;
951bail:
952 dlm_destroy_debugfs_subroot(dlm);
953 return -ENOMEM;
954}
955
956void dlm_destroy_debugfs_subroot(struct dlm_ctxt *dlm)
957{
958 if (dlm->dlm_debugfs_subroot)
959 debugfs_remove(dlm->dlm_debugfs_subroot);
960}
961
962/* debugfs root */
963int dlm_create_debugfs_root(void)
964{
965 dlm_debugfs_root = debugfs_create_dir(DLM_DEBUGFS_DIR, NULL);
966 if (!dlm_debugfs_root) {
967 mlog_errno(-ENOMEM);
968 return -ENOMEM;
969 }
970 return 0;
971}
972
973void dlm_destroy_debugfs_root(void)
974{
975 if (dlm_debugfs_root)
976 debugfs_remove(dlm_debugfs_root);
977}
978#endif /* CONFIG_DEBUG_FS */
Linux kernel - Deliverables
This page took 0.385814 seconds and 5 git commands to generate.