4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
20 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
21 * CA 95054 USA or visit www.sun.com if you need additional information or
27 * Copyright (c) 2002, 2010, Oracle and/or its affiliates. All rights reserved.
28 * Use is subject to license terms.
30 * Copyright (c) 2010, 2015, Intel Corporation.
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
36 * lustre/ldlm/ldlm_resource.c
38 * Author: Phil Schwan <phil@clusterfs.com>
39 * Author: Peter Braam <braam@clusterfs.com>
42 #define DEBUG_SUBSYSTEM S_LDLM
43 #include <lustre_dlm.h>
44 #include <lustre_fid.h>
45 #include <obd_class.h>
46 #include "ldlm_internal.h"
48 struct kmem_cache *ldlm_resource_slab, *ldlm_lock_slab;
49 struct kmem_cache *ldlm_interval_tree_slab;
51 int ldlm_srv_namespace_nr = 0;
52 int ldlm_cli_namespace_nr = 0;
54 struct mutex ldlm_srv_namespace_lock;
55 struct list_head ldlm_srv_namespace_list;
57 struct mutex ldlm_cli_namespace_lock;
58 /* Client Namespaces that have active resources in them.
59 * Once all resources go away, ldlm_poold moves such namespaces to the
61 struct list_head ldlm_cli_active_namespace_list;
62 /* Client namespaces that don't have any locks in them */
63 struct list_head ldlm_cli_inactive_namespace_list;
65 static struct proc_dir_entry *ldlm_type_proc_dir;
66 static struct proc_dir_entry *ldlm_ns_proc_dir;
67 struct proc_dir_entry *ldlm_svc_proc_dir;
69 /* during debug dump certain amount of granted locks for one resource to avoid
71 static unsigned int ldlm_dump_granted_max = 256;
75 lprocfs_dump_ns_seq_write(struct file *file, const char __user *buffer,
76 size_t count, loff_t *off)
78 ldlm_dump_all_namespaces(LDLM_NAMESPACE_SERVER, D_DLMTRACE);
79 ldlm_dump_all_namespaces(LDLM_NAMESPACE_CLIENT, D_DLMTRACE);
82 LPROC_SEQ_FOPS_WO_TYPE(ldlm, dump_ns);
84 LPROC_SEQ_FOPS_RW_TYPE(ldlm_rw, uint);
85 LPROC_SEQ_FOPS_RO_TYPE(ldlm, uint);
87 #ifdef HAVE_SERVER_SUPPORT
89 static int seq_watermark_show(struct seq_file *m, void *data)
91 return seq_printf(m, LPU64"\n", *(__u64 *)m->private);
94 static ssize_t seq_watermark_write(struct file *file,
95 const char __user *buffer, size_t count,
99 __u64 *data = ((struct seq_file *)file->private_data)->private;
100 bool wm_low = (data == &ldlm_reclaim_threshold_mb) ? true : false;
103 rc = lprocfs_write_frac_u64_helper(buffer, count, &watermark, 1 << 20);
105 CERROR("Failed to set %s, rc = %d.\n",
106 wm_low ? "lock_reclaim_threshold_mb" : "lock_limit_mb",
109 } else if (watermark != 0 && watermark < (1 << 20)) {
110 CERROR("%s should be greater than 1MB.\n",
111 wm_low ? "lock_reclaim_threshold_mb" : "lock_limit_mb");
117 if (ldlm_lock_limit_mb != 0 && watermark > ldlm_lock_limit_mb) {
118 CERROR("lock_reclaim_threshold_mb must be smaller than "
124 if (watermark != 0) {
126 do_div(watermark, sizeof(struct ldlm_lock));
128 ldlm_reclaim_threshold = watermark;
130 if (ldlm_reclaim_threshold_mb != 0 &&
131 watermark < ldlm_reclaim_threshold_mb) {
132 CERROR("lock_limit_mb must be greater than "
133 "lock_reclaim_threshold_mb.\n");
138 if (watermark != 0) {
140 do_div(watermark, sizeof(struct ldlm_lock));
142 ldlm_lock_limit = watermark;
148 static int seq_watermark_open(struct inode *inode, struct file *file)
150 return single_open(file, seq_watermark_show, PDE_DATA(inode));
153 static const struct file_operations ldlm_watermark_fops = {
154 .owner = THIS_MODULE,
155 .open = seq_watermark_open,
157 .write = seq_watermark_write,
159 .release = lprocfs_single_release,
162 static int seq_granted_show(struct seq_file *m, void *data)
164 return seq_printf(m, LPU64"\n", percpu_counter_sum_positive(
165 (struct percpu_counter *)m->private));
168 static int seq_granted_open(struct inode *inode, struct file *file)
170 return single_open(file, seq_granted_show, PDE_DATA(inode));
173 static const struct file_operations ldlm_granted_fops = {
174 .owner = THIS_MODULE,
175 .open = seq_granted_open,
178 .release = seq_release,
181 #endif /* HAVE_SERVER_SUPPORT */
183 int ldlm_proc_setup(void)
186 struct lprocfs_vars list[] = {
187 { .name = "dump_namespaces",
188 .fops = &ldlm_dump_ns_fops,
190 { .name = "dump_granted_max",
191 .fops = &ldlm_rw_uint_fops,
192 .data = &ldlm_dump_granted_max },
193 { .name = "cancel_unused_locks_before_replay",
194 .fops = &ldlm_rw_uint_fops,
195 .data = &ldlm_cancel_unused_locks_before_replay },
196 #ifdef HAVE_SERVER_SUPPORT
197 { .name = "lock_reclaim_threshold_mb",
198 .fops = &ldlm_watermark_fops,
199 .data = &ldlm_reclaim_threshold_mb },
200 { .name = "lock_limit_mb",
201 .fops = &ldlm_watermark_fops,
202 .data = &ldlm_lock_limit_mb },
203 { .name = "lock_granted_count",
204 .fops = &ldlm_granted_fops,
205 .data = &ldlm_granted_total },
209 LASSERT(ldlm_ns_proc_dir == NULL);
211 ldlm_type_proc_dir = lprocfs_register(OBD_LDLM_DEVICENAME,
214 if (IS_ERR(ldlm_type_proc_dir)) {
215 CERROR("LProcFS failed in ldlm-init\n");
216 rc = PTR_ERR(ldlm_type_proc_dir);
220 ldlm_ns_proc_dir = lprocfs_register("namespaces",
223 if (IS_ERR(ldlm_ns_proc_dir)) {
224 CERROR("LProcFS failed in ldlm-init\n");
225 rc = PTR_ERR(ldlm_ns_proc_dir);
229 ldlm_svc_proc_dir = lprocfs_register("services",
232 if (IS_ERR(ldlm_svc_proc_dir)) {
233 CERROR("LProcFS failed in ldlm-init\n");
234 rc = PTR_ERR(ldlm_svc_proc_dir);
238 rc = lprocfs_add_vars(ldlm_type_proc_dir, list, NULL);
240 CERROR("LProcFS failed in ldlm-init\n");
247 lprocfs_remove(&ldlm_svc_proc_dir);
249 lprocfs_remove(&ldlm_ns_proc_dir);
251 lprocfs_remove(&ldlm_type_proc_dir);
253 ldlm_svc_proc_dir = NULL;
257 void ldlm_proc_cleanup(void)
259 if (ldlm_svc_proc_dir)
260 lprocfs_remove(&ldlm_svc_proc_dir);
262 if (ldlm_ns_proc_dir)
263 lprocfs_remove(&ldlm_ns_proc_dir);
265 if (ldlm_type_proc_dir)
266 lprocfs_remove(&ldlm_type_proc_dir);
269 static int lprocfs_ns_resources_seq_show(struct seq_file *m, void *v)
271 struct ldlm_namespace *ns = m->private;
273 struct cfs_hash_bd bd;
276 /* result is not strictly consistant */
277 cfs_hash_for_each_bucket(ns->ns_rs_hash, &bd, i)
278 res += cfs_hash_bd_count_get(&bd);
279 return lprocfs_u64_seq_show(m, &res);
281 LPROC_SEQ_FOPS_RO(lprocfs_ns_resources);
283 static int lprocfs_ns_locks_seq_show(struct seq_file *m, void *v)
285 struct ldlm_namespace *ns = m->private;
288 locks = lprocfs_stats_collector(ns->ns_stats, LDLM_NSS_LOCKS,
289 LPROCFS_FIELDS_FLAGS_SUM);
290 return lprocfs_u64_seq_show(m, &locks);
292 LPROC_SEQ_FOPS_RO(lprocfs_ns_locks);
294 static int lprocfs_lru_size_seq_show(struct seq_file *m, void *v)
296 struct ldlm_namespace *ns = m->private;
297 __u32 *nr = &ns->ns_max_unused;
299 if (ns_connect_lru_resize(ns))
300 nr = &ns->ns_nr_unused;
301 return lprocfs_uint_seq_show(m, nr);
304 static ssize_t lprocfs_lru_size_seq_write(struct file *file,
305 const char __user *buffer,
306 size_t count, loff_t *off)
308 struct ldlm_namespace *ns = ((struct seq_file *)file->private_data)->private;
309 char dummy[MAX_STRING_SIZE + 1], *end;
313 dummy[MAX_STRING_SIZE] = '\0';
314 if (copy_from_user(dummy, buffer, MAX_STRING_SIZE))
317 if (strncmp(dummy, "clear", 5) == 0) {
319 "dropping all unused locks from namespace %s\n",
321 if (ns_connect_lru_resize(ns)) {
322 int canceled, unused = ns->ns_nr_unused;
324 /* Try to cancel all @ns_nr_unused locks. */
325 canceled = ldlm_cancel_lru(ns, unused, 0,
326 LDLM_LRU_FLAG_PASSED);
327 if (canceled < unused) {
329 "not all requested locks are canceled, "
330 "requested: %d, canceled: %d\n", unused,
335 tmp = ns->ns_max_unused;
336 ns->ns_max_unused = 0;
337 ldlm_cancel_lru(ns, 0, 0, LDLM_LRU_FLAG_PASSED);
338 ns->ns_max_unused = tmp;
343 tmp = simple_strtoul(dummy, &end, 0);
345 CERROR("invalid value written\n");
348 lru_resize = (tmp == 0);
350 if (ns_connect_lru_resize(ns)) {
352 ns->ns_max_unused = tmp;
354 if (tmp > ns->ns_nr_unused)
355 tmp = ns->ns_nr_unused;
356 tmp = ns->ns_nr_unused - tmp;
359 "changing namespace %s unused locks from %u to %u\n",
360 ldlm_ns_name(ns), ns->ns_nr_unused,
362 ldlm_cancel_lru(ns, tmp, LCF_ASYNC, LDLM_LRU_FLAG_PASSED);
366 "disable lru_resize for namespace %s\n",
368 ns->ns_connect_flags &= ~OBD_CONNECT_LRU_RESIZE;
372 "changing namespace %s max_unused from %u to %u\n",
373 ldlm_ns_name(ns), ns->ns_max_unused,
375 ns->ns_max_unused = (unsigned int)tmp;
376 ldlm_cancel_lru(ns, 0, LCF_ASYNC, LDLM_LRU_FLAG_PASSED);
378 /* Make sure that LRU resize was originally supported before
379 * turning it on here. */
381 (ns->ns_orig_connect_flags & OBD_CONNECT_LRU_RESIZE)) {
383 "enable lru_resize for namespace %s\n",
385 ns->ns_connect_flags |= OBD_CONNECT_LRU_RESIZE;
391 LPROC_SEQ_FOPS(lprocfs_lru_size);
393 static int lprocfs_elc_seq_show(struct seq_file *m, void *v)
395 struct ldlm_namespace *ns = m->private;
396 unsigned int supp = ns_connect_cancelset(ns);
398 return lprocfs_uint_seq_show(m, &supp);
401 static ssize_t lprocfs_elc_seq_write(struct file *file,
402 const char __user *buffer,
403 size_t count, loff_t *off)
405 struct ldlm_namespace *ns = ((struct seq_file *)file->private_data)->private;
406 unsigned int supp = -1;
409 rc = lprocfs_wr_uint(file, buffer, count, &supp);
414 ns->ns_connect_flags &= ~OBD_CONNECT_CANCELSET;
415 else if (ns->ns_orig_connect_flags & OBD_CONNECT_CANCELSET)
416 ns->ns_connect_flags |= OBD_CONNECT_CANCELSET;
419 LPROC_SEQ_FOPS(lprocfs_elc);
421 static void ldlm_namespace_proc_unregister(struct ldlm_namespace *ns)
423 if (ns->ns_proc_dir_entry == NULL)
424 CERROR("dlm namespace %s has no procfs dir?\n",
427 lprocfs_remove(&ns->ns_proc_dir_entry);
429 if (ns->ns_stats != NULL)
430 lprocfs_free_stats(&ns->ns_stats);
433 static int ldlm_namespace_proc_register(struct ldlm_namespace *ns)
435 struct lprocfs_vars lock_vars[2];
436 char lock_name[MAX_STRING_SIZE + 1];
437 struct proc_dir_entry *ns_pde;
440 LASSERT(ns->ns_rs_hash != NULL);
442 if (ns->ns_proc_dir_entry != NULL) {
443 ns_pde = ns->ns_proc_dir_entry;
445 ns_pde = proc_mkdir(ldlm_ns_name(ns), ldlm_ns_proc_dir);
448 ns->ns_proc_dir_entry = ns_pde;
451 ns->ns_stats = lprocfs_alloc_stats(LDLM_NSS_LAST, 0);
452 if (ns->ns_stats == NULL)
455 lprocfs_counter_init(ns->ns_stats, LDLM_NSS_LOCKS,
456 LPROCFS_CNTR_AVGMINMAX, "locks", "locks");
458 lock_name[MAX_STRING_SIZE] = '\0';
460 memset(lock_vars, 0, sizeof(lock_vars));
461 lock_vars[0].name = lock_name;
463 ldlm_add_var(&lock_vars[0], ns_pde, "resource_count", ns,
464 &lprocfs_ns_resources_fops);
465 ldlm_add_var(&lock_vars[0], ns_pde, "lock_count", ns,
466 &lprocfs_ns_locks_fops);
468 if (ns_is_client(ns)) {
469 ldlm_add_var(&lock_vars[0], ns_pde, "lock_unused_count",
470 &ns->ns_nr_unused, &ldlm_uint_fops);
471 ldlm_add_var(&lock_vars[0], ns_pde, "lru_size", ns,
472 &lprocfs_lru_size_fops);
473 ldlm_add_var(&lock_vars[0], ns_pde, "lru_max_age",
474 &ns->ns_max_age, &ldlm_rw_uint_fops);
475 ldlm_add_var(&lock_vars[0], ns_pde, "early_lock_cancel",
476 ns, &lprocfs_elc_fops);
478 ldlm_add_var(&lock_vars[0], ns_pde, "ctime_age_limit",
479 &ns->ns_ctime_age_limit, &ldlm_rw_uint_fops);
480 ldlm_add_var(&lock_vars[0], ns_pde, "lock_timeouts",
481 &ns->ns_timeouts, &ldlm_uint_fops);
482 ldlm_add_var(&lock_vars[0], ns_pde, "max_nolock_bytes",
483 &ns->ns_max_nolock_size, &ldlm_rw_uint_fops);
484 ldlm_add_var(&lock_vars[0], ns_pde, "contention_seconds",
485 &ns->ns_contention_time, &ldlm_rw_uint_fops);
486 ldlm_add_var(&lock_vars[0], ns_pde, "contended_locks",
487 &ns->ns_contended_locks, &ldlm_rw_uint_fops);
488 ldlm_add_var(&lock_vars[0], ns_pde, "max_parallel_ast",
489 &ns->ns_max_parallel_ast, &ldlm_rw_uint_fops);
493 #undef MAX_STRING_SIZE
494 #else /* CONFIG_PROC_FS */
496 #define ldlm_namespace_proc_unregister(ns) ({;})
497 #define ldlm_namespace_proc_register(ns) ({0;})
499 #endif /* CONFIG_PROC_FS */
501 static unsigned ldlm_res_hop_hash(struct cfs_hash *hs,
502 const void *key, unsigned mask)
504 const struct ldlm_res_id *id = key;
508 for (i = 0; i < RES_NAME_SIZE; i++)
513 static unsigned ldlm_res_hop_fid_hash(struct cfs_hash *hs,
514 const void *key, unsigned mask)
516 const struct ldlm_res_id *id = key;
521 fid.f_seq = id->name[LUSTRE_RES_ID_SEQ_OFF];
522 fid.f_oid = (__u32)id->name[LUSTRE_RES_ID_VER_OID_OFF];
523 fid.f_ver = (__u32)(id->name[LUSTRE_RES_ID_VER_OID_OFF] >> 32);
525 hash = fid_flatten32(&fid);
526 hash += (hash >> 4) + (hash << 12); /* mixing oid and seq */
527 if (id->name[LUSTRE_RES_ID_HSH_OFF] != 0) {
528 val = id->name[LUSTRE_RES_ID_HSH_OFF];
529 hash += (val >> 5) + (val << 11);
533 hash = hash_long(hash, hs->hs_bkt_bits);
534 /* give me another random factor */
535 hash -= hash_long((unsigned long)hs, val % 11 + 3);
537 hash <<= hs->hs_cur_bits - hs->hs_bkt_bits;
538 hash |= ldlm_res_hop_hash(hs, key, CFS_HASH_NBKT(hs) - 1);
543 static void *ldlm_res_hop_key(struct hlist_node *hnode)
545 struct ldlm_resource *res;
547 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
548 return &res->lr_name;
551 static int ldlm_res_hop_keycmp(const void *key, struct hlist_node *hnode)
553 struct ldlm_resource *res;
555 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
556 return ldlm_res_eq((const struct ldlm_res_id *)key,
557 (const struct ldlm_res_id *)&res->lr_name);
560 static void *ldlm_res_hop_object(struct hlist_node *hnode)
562 return hlist_entry(hnode, struct ldlm_resource, lr_hash);
566 ldlm_res_hop_get_locked(struct cfs_hash *hs, struct hlist_node *hnode)
568 struct ldlm_resource *res;
570 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
571 ldlm_resource_getref(res);
575 ldlm_res_hop_put_locked(struct cfs_hash *hs, struct hlist_node *hnode)
577 struct ldlm_resource *res;
579 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
580 /* cfs_hash_for_each_nolock is the only chance we call it */
581 ldlm_resource_putref_locked(res);
584 static void ldlm_res_hop_put(struct cfs_hash *hs, struct hlist_node *hnode)
586 struct ldlm_resource *res;
588 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
589 ldlm_resource_putref(res);
592 static struct cfs_hash_ops ldlm_ns_hash_ops = {
593 .hs_hash = ldlm_res_hop_hash,
594 .hs_key = ldlm_res_hop_key,
595 .hs_keycmp = ldlm_res_hop_keycmp,
597 .hs_object = ldlm_res_hop_object,
598 .hs_get = ldlm_res_hop_get_locked,
599 .hs_put_locked = ldlm_res_hop_put_locked,
600 .hs_put = ldlm_res_hop_put
603 static struct cfs_hash_ops ldlm_ns_fid_hash_ops = {
604 .hs_hash = ldlm_res_hop_fid_hash,
605 .hs_key = ldlm_res_hop_key,
606 .hs_keycmp = ldlm_res_hop_keycmp,
608 .hs_object = ldlm_res_hop_object,
609 .hs_get = ldlm_res_hop_get_locked,
610 .hs_put_locked = ldlm_res_hop_put_locked,
611 .hs_put = ldlm_res_hop_put
614 typedef struct ldlm_ns_hash_def {
615 enum ldlm_ns_type nsd_type;
616 /** hash bucket bits */
617 unsigned nsd_bkt_bits;
619 unsigned nsd_all_bits;
620 /** hash operations */
621 struct cfs_hash_ops *nsd_hops;
622 } ldlm_ns_hash_def_t;
624 static struct ldlm_ns_hash_def ldlm_ns_hash_defs[] =
627 .nsd_type = LDLM_NS_TYPE_MDC,
630 .nsd_hops = &ldlm_ns_fid_hash_ops,
633 .nsd_type = LDLM_NS_TYPE_MDT,
636 .nsd_hops = &ldlm_ns_fid_hash_ops,
639 .nsd_type = LDLM_NS_TYPE_OSC,
642 .nsd_hops = &ldlm_ns_hash_ops,
645 .nsd_type = LDLM_NS_TYPE_OST,
648 .nsd_hops = &ldlm_ns_hash_ops,
651 .nsd_type = LDLM_NS_TYPE_MGC,
654 .nsd_hops = &ldlm_ns_hash_ops,
657 .nsd_type = LDLM_NS_TYPE_MGT,
660 .nsd_hops = &ldlm_ns_hash_ops,
663 .nsd_type = LDLM_NS_TYPE_UNKNOWN,
668 * Create and initialize new empty namespace.
670 struct ldlm_namespace *ldlm_namespace_new(struct obd_device *obd, char *name,
671 enum ldlm_side client,
672 enum ldlm_appetite apt,
673 enum ldlm_ns_type ns_type)
675 struct ldlm_namespace *ns = NULL;
676 struct ldlm_ns_bucket *nsb;
677 struct ldlm_ns_hash_def *nsd;
678 struct cfs_hash_bd bd;
683 LASSERT(obd != NULL);
687 CERROR("ldlm_get_ref failed: %d\n", rc);
691 for (idx = 0;;idx++) {
692 nsd = &ldlm_ns_hash_defs[idx];
693 if (nsd->nsd_type == LDLM_NS_TYPE_UNKNOWN) {
694 CERROR("Unknown type %d for ns %s\n", ns_type, name);
698 if (nsd->nsd_type == ns_type)
706 ns->ns_rs_hash = cfs_hash_create(name,
707 nsd->nsd_all_bits, nsd->nsd_all_bits,
708 nsd->nsd_bkt_bits, sizeof(*nsb),
714 CFS_HASH_SPIN_BKTLOCK |
715 CFS_HASH_NO_ITEMREF);
716 if (ns->ns_rs_hash == NULL)
719 cfs_hash_for_each_bucket(ns->ns_rs_hash, &bd, idx) {
720 nsb = cfs_hash_bd_extra_get(ns->ns_rs_hash, &bd);
721 at_init(&nsb->nsb_at_estimate, ldlm_enqueue_min, 0);
722 nsb->nsb_namespace = ns;
723 nsb->nsb_reclaim_start = 0;
727 ns->ns_appetite = apt;
728 ns->ns_client = client;
730 INIT_LIST_HEAD(&ns->ns_list_chain);
731 INIT_LIST_HEAD(&ns->ns_unused_list);
732 spin_lock_init(&ns->ns_lock);
733 atomic_set(&ns->ns_bref, 0);
734 init_waitqueue_head(&ns->ns_waitq);
736 ns->ns_max_nolock_size = NS_DEFAULT_MAX_NOLOCK_BYTES;
737 ns->ns_contention_time = NS_DEFAULT_CONTENTION_SECONDS;
738 ns->ns_contended_locks = NS_DEFAULT_CONTENDED_LOCKS;
740 ns->ns_max_parallel_ast = LDLM_DEFAULT_PARALLEL_AST_LIMIT;
741 ns->ns_nr_unused = 0;
742 ns->ns_max_unused = LDLM_DEFAULT_LRU_SIZE;
743 ns->ns_max_age = LDLM_DEFAULT_MAX_ALIVE;
744 ns->ns_ctime_age_limit = LDLM_CTIME_AGE_LIMIT;
746 ns->ns_orig_connect_flags = 0;
747 ns->ns_connect_flags = 0;
749 ns->ns_reclaim_start = 0;
750 rc = ldlm_namespace_proc_register(ns);
752 CERROR("Can't initialize ns proc, rc %d\n", rc);
756 idx = ldlm_namespace_nr_read(client);
757 rc = ldlm_pool_init(&ns->ns_pool, ns, idx, client);
759 CERROR("Can't initialize lock pool, rc %d\n", rc);
763 ldlm_namespace_register(ns, client);
766 ldlm_namespace_proc_unregister(ns);
767 ldlm_namespace_cleanup(ns, 0);
769 cfs_hash_putref(ns->ns_rs_hash);
776 EXPORT_SYMBOL(ldlm_namespace_new);
778 extern struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock);
781 * Cancel and destroy all locks on a resource.
783 * If flags contains FL_LOCAL_ONLY, don't try to tell the server, just
784 * clean up. This is currently only used for recovery, and we make
785 * certain assumptions as a result--notably, that we shouldn't cancel
788 static void cleanup_resource(struct ldlm_resource *res, struct list_head *q,
791 struct list_head *tmp;
792 int rc = 0, client = ns_is_client(ldlm_res_to_ns(res));
793 bool local_only = !!(flags & LDLM_FL_LOCAL_ONLY);
796 struct ldlm_lock *lock = NULL;
798 /* First, we look for non-cleaned-yet lock
799 * all cleaned locks are marked by CLEANED flag. */
801 list_for_each(tmp, q) {
802 lock = list_entry(tmp, struct ldlm_lock,
804 if (ldlm_is_cleaned(lock)) {
809 ldlm_set_cleaned(lock);
818 /* Set CBPENDING so nothing in the cancellation path
819 * can match this lock. */
820 ldlm_set_cbpending(lock);
821 ldlm_set_failed(lock);
822 lock->l_flags |= flags;
824 /* ... without sending a CANCEL message for local_only. */
826 ldlm_set_local_only(lock);
828 if (local_only && (lock->l_readers || lock->l_writers)) {
829 /* This is a little bit gross, but much better than the
830 * alternative: pretend that we got a blocking AST from
831 * the server, so that when the lock is decref'd, it
832 * will go away ... */
834 LDLM_DEBUG(lock, "setting FL_LOCAL_ONLY");
835 if (lock->l_flags & LDLM_FL_FAIL_LOC) {
836 set_current_state(TASK_UNINTERRUPTIBLE);
837 schedule_timeout(cfs_time_seconds(4));
838 set_current_state(TASK_RUNNING);
840 if (lock->l_completion_ast)
841 lock->l_completion_ast(lock,
842 LDLM_FL_FAILED, NULL);
843 LDLM_LOCK_RELEASE(lock);
848 struct lustre_handle lockh;
851 ldlm_lock2handle(lock, &lockh);
852 rc = ldlm_cli_cancel(&lockh, LCF_LOCAL);
854 CERROR("ldlm_cli_cancel: %d\n", rc);
857 LDLM_DEBUG(lock, "Freeing a lock still held by a "
859 ldlm_lock_cancel(lock);
861 LDLM_LOCK_RELEASE(lock);
865 static int ldlm_resource_clean(struct cfs_hash *hs, struct cfs_hash_bd *bd,
866 struct hlist_node *hnode, void *arg)
868 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
869 __u64 flags = *(__u64 *)arg;
871 cleanup_resource(res, &res->lr_granted, flags);
872 cleanup_resource(res, &res->lr_converting, flags);
873 cleanup_resource(res, &res->lr_waiting, flags);
878 static int ldlm_resource_complain(struct cfs_hash *hs, struct cfs_hash_bd *bd,
879 struct hlist_node *hnode, void *arg)
881 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
884 CERROR("%s: namespace resource "DLDLMRES" (%p) refcount nonzero "
885 "(%d) after lock cleanup; forcing cleanup.\n",
886 ldlm_ns_name(ldlm_res_to_ns(res)), PLDLMRES(res), res,
887 atomic_read(&res->lr_refcount) - 1);
889 ldlm_resource_dump(D_ERROR, res);
895 * Cancel and destroy all locks in the namespace.
897 * Typically used during evictions when server notified client that it was
898 * evicted and all of its state needs to be destroyed.
899 * Also used during shutdown.
901 int ldlm_namespace_cleanup(struct ldlm_namespace *ns, __u64 flags)
904 CDEBUG(D_INFO, "NULL ns, skipping cleanup\n");
908 cfs_hash_for_each_nolock(ns->ns_rs_hash, ldlm_resource_clean,
910 cfs_hash_for_each_nolock(ns->ns_rs_hash, ldlm_resource_complain,
914 EXPORT_SYMBOL(ldlm_namespace_cleanup);
917 * Attempts to free namespace.
919 * Only used when namespace goes away, like during an unmount.
921 static int __ldlm_namespace_free(struct ldlm_namespace *ns, int force)
925 /* At shutdown time, don't call the cancellation callback */
926 ldlm_namespace_cleanup(ns, force ? LDLM_FL_LOCAL_ONLY : 0);
928 if (atomic_read(&ns->ns_bref) > 0) {
929 struct l_wait_info lwi = LWI_INTR(LWI_ON_SIGNAL_NOOP, NULL);
932 "dlm namespace %s free waiting on refcount %d\n",
933 ldlm_ns_name(ns), atomic_read(&ns->ns_bref));
936 lwi = LWI_TIMEOUT(msecs_to_jiffies(obd_timeout *
937 MSEC_PER_SEC) / 4, NULL, NULL);
939 rc = l_wait_event(ns->ns_waitq,
940 atomic_read(&ns->ns_bref) == 0, &lwi);
942 /* Forced cleanups should be able to reclaim all references,
943 * so it's safe to wait forever... we can't leak locks... */
944 if (force && rc == -ETIMEDOUT) {
945 LCONSOLE_ERROR("Forced cleanup waiting for %s "
946 "namespace with %d resources in use, "
947 "(rc=%d)\n", ldlm_ns_name(ns),
948 atomic_read(&ns->ns_bref), rc);
949 GOTO(force_wait, rc);
952 if (atomic_read(&ns->ns_bref)) {
953 LCONSOLE_ERROR("Cleanup waiting for %s namespace "
954 "with %d resources in use, (rc=%d)\n",
956 atomic_read(&ns->ns_bref), rc);
957 RETURN(ELDLM_NAMESPACE_EXISTS);
959 CDEBUG(D_DLMTRACE, "dlm namespace %s free done waiting\n",
967 * Performs various cleanups for passed \a ns to make it drop refc and be
968 * ready for freeing. Waits for refc == 0.
970 * The following is done:
971 * (0) Unregister \a ns from its list to make inaccessible for potential
972 * users like pools thread and others;
973 * (1) Clear all locks in \a ns.
975 void ldlm_namespace_free_prior(struct ldlm_namespace *ns,
976 struct obd_import *imp,
986 spin_lock(&ns->ns_lock);
988 spin_unlock(&ns->ns_lock);
991 * Can fail with -EINTR when force == 0 in which case try harder.
993 rc = __ldlm_namespace_free(ns, force);
994 if (rc != ELDLM_OK) {
996 ptlrpc_disconnect_import(imp, 0);
997 ptlrpc_invalidate_import(imp);
1001 * With all requests dropped and the import inactive
1002 * we are gaurenteed all reference will be dropped.
1004 rc = __ldlm_namespace_free(ns, 1);
1009 EXPORT_SYMBOL(ldlm_namespace_free_prior);
1012 * Performs freeing memory structures related to \a ns. This is only done
1013 * when ldlm_namespce_free_prior() successfully removed all resources
1014 * referencing \a ns and its refc == 0.
1016 void ldlm_namespace_free_post(struct ldlm_namespace *ns)
1024 /* Make sure that nobody can find this ns in its list. */
1025 ldlm_namespace_unregister(ns, ns->ns_client);
1026 /* Fini pool _before_ parent proc dir is removed. This is important as
1027 * ldlm_pool_fini() removes own proc dir which is child to @dir.
1028 * Removing it after @dir may cause oops. */
1029 ldlm_pool_fini(&ns->ns_pool);
1031 ldlm_namespace_proc_unregister(ns);
1032 cfs_hash_putref(ns->ns_rs_hash);
1033 /* Namespace \a ns should be not on list at this time, otherwise
1034 * this will cause issues related to using freed \a ns in poold
1036 LASSERT(list_empty(&ns->ns_list_chain));
1041 EXPORT_SYMBOL(ldlm_namespace_free_post);
1044 * Cleanup the resource, and free namespace.
1047 * proc1: destroy import
1048 * class_disconnect_export(grab cl_sem) ->
1049 * -> ldlm_namespace_free ->
1050 * -> lprocfs_remove(grab _lprocfs_lock).
1051 * proc2: read proc info
1052 * lprocfs_fops_read(grab _lprocfs_lock) ->
1053 * -> osc_rd_active, etc(grab cl_sem).
1055 * So that I have to split the ldlm_namespace_free into two parts - the first
1056 * part ldlm_namespace_free_prior is used to cleanup the resource which is
1057 * being used; the 2nd part ldlm_namespace_free_post is used to unregister the
1058 * lprocfs entries, and then free memory. It will be called w/o cli->cl_sem
1061 void ldlm_namespace_free(struct ldlm_namespace *ns,
1062 struct obd_import *imp,
1065 ldlm_namespace_free_prior(ns, imp, force);
1066 ldlm_namespace_free_post(ns);
1068 EXPORT_SYMBOL(ldlm_namespace_free);
1070 void ldlm_namespace_get(struct ldlm_namespace *ns)
1072 atomic_inc(&ns->ns_bref);
1075 /* This is only for callers that care about refcount */
1076 static int ldlm_namespace_get_return(struct ldlm_namespace *ns)
1078 return atomic_inc_return(&ns->ns_bref);
1081 void ldlm_namespace_put(struct ldlm_namespace *ns)
1083 if (atomic_dec_and_lock(&ns->ns_bref, &ns->ns_lock)) {
1084 wake_up(&ns->ns_waitq);
1085 spin_unlock(&ns->ns_lock);
1089 /** Register \a ns in the list of namespaces */
1090 void ldlm_namespace_register(struct ldlm_namespace *ns, enum ldlm_side client)
1092 mutex_lock(ldlm_namespace_lock(client));
1093 LASSERT(list_empty(&ns->ns_list_chain));
1094 list_add(&ns->ns_list_chain, ldlm_namespace_inactive_list(client));
1095 ldlm_namespace_nr_inc(client);
1096 mutex_unlock(ldlm_namespace_lock(client));
1099 /** Unregister \a ns from the list of namespaces. */
1100 void ldlm_namespace_unregister(struct ldlm_namespace *ns, enum ldlm_side client)
1102 mutex_lock(ldlm_namespace_lock(client));
1103 LASSERT(!list_empty(&ns->ns_list_chain));
1104 /* Some asserts and possibly other parts of the code are still
1105 * using list_empty(&ns->ns_list_chain). This is why it is
1106 * important to use list_del_init() here. */
1107 list_del_init(&ns->ns_list_chain);
1108 ldlm_namespace_nr_dec(client);
1109 mutex_unlock(ldlm_namespace_lock(client));
1112 /** Should be called with ldlm_namespace_lock(client) taken. */
1113 void ldlm_namespace_move_to_active_locked(struct ldlm_namespace *ns,
1114 enum ldlm_side client)
1116 LASSERT(!list_empty(&ns->ns_list_chain));
1117 LASSERT(mutex_is_locked(ldlm_namespace_lock(client)));
1118 list_move_tail(&ns->ns_list_chain, ldlm_namespace_list(client));
1121 /** Should be called with ldlm_namespace_lock(client) taken. */
1122 void ldlm_namespace_move_to_inactive_locked(struct ldlm_namespace *ns,
1123 enum ldlm_side client)
1125 LASSERT(!list_empty(&ns->ns_list_chain));
1126 LASSERT(mutex_is_locked(ldlm_namespace_lock(client)));
1127 list_move_tail(&ns->ns_list_chain,
1128 ldlm_namespace_inactive_list(client));
1131 /** Should be called with ldlm_namespace_lock(client) taken. */
1132 struct ldlm_namespace *ldlm_namespace_first_locked(enum ldlm_side client)
1134 LASSERT(mutex_is_locked(ldlm_namespace_lock(client)));
1135 LASSERT(!list_empty(ldlm_namespace_list(client)));
1136 return container_of(ldlm_namespace_list(client)->next,
1137 struct ldlm_namespace, ns_list_chain);
1140 /** Create and initialize new resource. */
1141 static struct ldlm_resource *ldlm_resource_new(enum ldlm_type ldlm_type)
1143 struct ldlm_resource *res;
1146 OBD_SLAB_ALLOC_PTR_GFP(res, ldlm_resource_slab, GFP_NOFS);
1150 if (ldlm_type == LDLM_EXTENT) {
1151 OBD_SLAB_ALLOC(res->lr_itree, ldlm_interval_tree_slab,
1152 sizeof(*res->lr_itree) * LCK_MODE_NUM);
1153 if (res->lr_itree == NULL) {
1154 OBD_SLAB_FREE_PTR(res, ldlm_resource_slab);
1157 /* Initialize interval trees for each lock mode. */
1158 for (idx = 0; idx < LCK_MODE_NUM; idx++) {
1159 res->lr_itree[idx].lit_size = 0;
1160 res->lr_itree[idx].lit_mode = 1 << idx;
1161 res->lr_itree[idx].lit_root = NULL;
1165 INIT_LIST_HEAD(&res->lr_granted);
1166 INIT_LIST_HEAD(&res->lr_converting);
1167 INIT_LIST_HEAD(&res->lr_waiting);
1169 atomic_set(&res->lr_refcount, 1);
1170 spin_lock_init(&res->lr_lock);
1171 lu_ref_init(&res->lr_reference);
1173 /* Since LVB init can be delayed now, there is no longer need to
1174 * immediatelly acquire mutex here. */
1175 mutex_init(&res->lr_lvb_mutex);
1176 res->lr_lvb_initialized = false;
1182 * Return a reference to resource with given name, creating it if necessary.
1183 * Args: namespace with ns_lock unlocked
1184 * Locks: takes and releases NS hash-lock and res->lr_lock
1185 * Returns: referenced, unlocked ldlm_resource or NULL
1187 struct ldlm_resource *
1188 ldlm_resource_get(struct ldlm_namespace *ns, struct ldlm_resource *parent,
1189 const struct ldlm_res_id *name, enum ldlm_type type,
1192 struct hlist_node *hnode;
1193 struct ldlm_resource *res = NULL;
1194 struct cfs_hash_bd bd;
1196 int ns_refcount = 0;
1198 LASSERT(ns != NULL);
1199 LASSERT(parent == NULL);
1200 LASSERT(ns->ns_rs_hash != NULL);
1201 LASSERT(name->name[0] != 0);
1203 cfs_hash_bd_get_and_lock(ns->ns_rs_hash, (void *)name, &bd, 0);
1204 hnode = cfs_hash_bd_lookup_locked(ns->ns_rs_hash, &bd, (void *)name);
1205 if (hnode != NULL) {
1206 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 0);
1210 version = cfs_hash_bd_version_get(&bd);
1211 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 0);
1214 return ERR_PTR(-ENOENT);
1216 LASSERTF(type >= LDLM_MIN_TYPE && type < LDLM_MAX_TYPE,
1217 "type: %d\n", type);
1218 res = ldlm_resource_new(type);
1220 return ERR_PTR(-ENOMEM);
1222 res->lr_ns_bucket = cfs_hash_bd_extra_get(ns->ns_rs_hash, &bd);
1223 res->lr_name = *name;
1224 res->lr_type = type;
1226 cfs_hash_bd_lock(ns->ns_rs_hash, &bd, 1);
1227 hnode = (version == cfs_hash_bd_version_get(&bd)) ? NULL :
1228 cfs_hash_bd_lookup_locked(ns->ns_rs_hash, &bd, (void *)name);
1230 if (hnode != NULL) {
1231 /* Someone won the race and already added the resource. */
1232 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
1233 /* Clean lu_ref for failed resource. */
1234 lu_ref_fini(&res->lr_reference);
1235 if (res->lr_itree != NULL)
1236 OBD_SLAB_FREE(res->lr_itree, ldlm_interval_tree_slab,
1237 sizeof(*res->lr_itree) * LCK_MODE_NUM);
1238 OBD_SLAB_FREE(res, ldlm_resource_slab, sizeof *res);
1240 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
1243 /* We won! Let's add the resource. */
1244 cfs_hash_bd_add_locked(ns->ns_rs_hash, &bd, &res->lr_hash);
1245 if (cfs_hash_bd_count_get(&bd) == 1)
1246 ns_refcount = ldlm_namespace_get_return(ns);
1248 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
1250 OBD_FAIL_TIMEOUT(OBD_FAIL_LDLM_CREATE_RESOURCE, 2);
1252 /* Let's see if we happened to be the very first resource in this
1253 * namespace. If so, and this is a client namespace, we need to move
1254 * the namespace into the active namespaces list to be patrolled by
1255 * the ldlm_poold. */
1256 if (ns_is_client(ns) && ns_refcount == 1) {
1257 mutex_lock(ldlm_namespace_lock(LDLM_NAMESPACE_CLIENT));
1258 ldlm_namespace_move_to_active_locked(ns, LDLM_NAMESPACE_CLIENT);
1259 mutex_unlock(ldlm_namespace_lock(LDLM_NAMESPACE_CLIENT));
1264 EXPORT_SYMBOL(ldlm_resource_get);
1266 struct ldlm_resource *ldlm_resource_getref(struct ldlm_resource *res)
1268 LASSERT(res != NULL);
1269 LASSERT(res != LP_POISON);
1270 atomic_inc(&res->lr_refcount);
1271 CDEBUG(D_INFO, "getref res: %p count: %d\n", res,
1272 atomic_read(&res->lr_refcount));
1276 static void __ldlm_resource_putref_final(struct cfs_hash_bd *bd,
1277 struct ldlm_resource *res)
1279 struct ldlm_ns_bucket *nsb = res->lr_ns_bucket;
1281 if (!list_empty(&res->lr_granted)) {
1282 ldlm_resource_dump(D_ERROR, res);
1286 if (!list_empty(&res->lr_converting)) {
1287 ldlm_resource_dump(D_ERROR, res);
1291 if (!list_empty(&res->lr_waiting)) {
1292 ldlm_resource_dump(D_ERROR, res);
1296 cfs_hash_bd_del_locked(nsb->nsb_namespace->ns_rs_hash,
1298 lu_ref_fini(&res->lr_reference);
1299 if (cfs_hash_bd_count_get(bd) == 0)
1300 ldlm_namespace_put(nsb->nsb_namespace);
1303 /* Returns 1 if the resource was freed, 0 if it remains. */
1304 int ldlm_resource_putref(struct ldlm_resource *res)
1306 struct ldlm_namespace *ns = ldlm_res_to_ns(res);
1307 struct cfs_hash_bd bd;
1309 LASSERT_ATOMIC_GT_LT(&res->lr_refcount, 0, LI_POISON);
1310 CDEBUG(D_INFO, "putref res: %p count: %d\n",
1311 res, atomic_read(&res->lr_refcount) - 1);
1313 cfs_hash_bd_get(ns->ns_rs_hash, &res->lr_name, &bd);
1314 if (cfs_hash_bd_dec_and_lock(ns->ns_rs_hash, &bd, &res->lr_refcount)) {
1315 __ldlm_resource_putref_final(&bd, res);
1316 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
1317 if (ns->ns_lvbo && ns->ns_lvbo->lvbo_free)
1318 ns->ns_lvbo->lvbo_free(res);
1319 if (res->lr_itree != NULL)
1320 OBD_SLAB_FREE(res->lr_itree, ldlm_interval_tree_slab,
1321 sizeof(*res->lr_itree) * LCK_MODE_NUM);
1322 OBD_SLAB_FREE(res, ldlm_resource_slab, sizeof *res);
1327 EXPORT_SYMBOL(ldlm_resource_putref);
1329 /* Returns 1 if the resource was freed, 0 if it remains. */
1330 int ldlm_resource_putref_locked(struct ldlm_resource *res)
1332 struct ldlm_namespace *ns = ldlm_res_to_ns(res);
1334 LASSERT_ATOMIC_GT_LT(&res->lr_refcount, 0, LI_POISON);
1335 CDEBUG(D_INFO, "putref res: %p count: %d\n",
1336 res, atomic_read(&res->lr_refcount) - 1);
1338 if (atomic_dec_and_test(&res->lr_refcount)) {
1339 struct cfs_hash_bd bd;
1341 cfs_hash_bd_get(ldlm_res_to_ns(res)->ns_rs_hash,
1342 &res->lr_name, &bd);
1343 __ldlm_resource_putref_final(&bd, res);
1344 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
1345 /* NB: ns_rs_hash is created with CFS_HASH_NO_ITEMREF,
1346 * so we should never be here while calling cfs_hash_del,
1347 * cfs_hash_for_each_nolock is the only case we can get
1348 * here, which is safe to release cfs_hash_bd_lock.
1350 if (ns->ns_lvbo && ns->ns_lvbo->lvbo_free)
1351 ns->ns_lvbo->lvbo_free(res);
1352 if (res->lr_itree != NULL)
1353 OBD_SLAB_FREE(res->lr_itree, ldlm_interval_tree_slab,
1354 sizeof(*res->lr_itree) * LCK_MODE_NUM);
1355 OBD_SLAB_FREE(res, ldlm_resource_slab, sizeof *res);
1357 cfs_hash_bd_lock(ns->ns_rs_hash, &bd, 1);
1364 * Add a lock into a given resource into specified lock list.
1366 void ldlm_resource_add_lock(struct ldlm_resource *res, struct list_head *head,
1367 struct ldlm_lock *lock)
1369 check_res_locked(res);
1371 LDLM_DEBUG(lock, "About to add this lock:\n");
1373 if (ldlm_is_destroyed(lock)) {
1374 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
1378 LASSERT(list_empty(&lock->l_res_link));
1380 list_add_tail(&lock->l_res_link, head);
1384 * Insert a lock into resource after specified lock.
1386 * Obtain resource description from the lock we are inserting after.
1388 void ldlm_resource_insert_lock_after(struct ldlm_lock *original,
1389 struct ldlm_lock *new)
1391 struct ldlm_resource *res = original->l_resource;
1393 check_res_locked(res);
1395 ldlm_resource_dump(D_INFO, res);
1396 LDLM_DEBUG(new, "About to insert this lock after %p:\n", original);
1398 if (ldlm_is_destroyed(new)) {
1399 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
1403 LASSERT(list_empty(&new->l_res_link));
1405 list_add(&new->l_res_link, &original->l_res_link);
1409 void ldlm_resource_unlink_lock(struct ldlm_lock *lock)
1411 int type = lock->l_resource->lr_type;
1413 check_res_locked(lock->l_resource);
1414 if (type == LDLM_IBITS || type == LDLM_PLAIN)
1415 ldlm_unlink_lock_skiplist(lock);
1416 else if (type == LDLM_EXTENT)
1417 ldlm_extent_unlink_lock(lock);
1418 list_del_init(&lock->l_res_link);
1420 EXPORT_SYMBOL(ldlm_resource_unlink_lock);
1422 void ldlm_res2desc(struct ldlm_resource *res, struct ldlm_resource_desc *desc)
1424 desc->lr_type = res->lr_type;
1425 desc->lr_name = res->lr_name;
1429 * Print information about all locks in all namespaces on this node to debug
1432 void ldlm_dump_all_namespaces(enum ldlm_side client, int level)
1434 struct list_head *tmp;
1436 if (!((libcfs_debug | D_ERROR) & level))
1439 mutex_lock(ldlm_namespace_lock(client));
1441 list_for_each(tmp, ldlm_namespace_list(client)) {
1442 struct ldlm_namespace *ns;
1444 ns = list_entry(tmp, struct ldlm_namespace, ns_list_chain);
1445 ldlm_namespace_dump(level, ns);
1448 mutex_unlock(ldlm_namespace_lock(client));
1451 static int ldlm_res_hash_dump(struct cfs_hash *hs, struct cfs_hash_bd *bd,
1452 struct hlist_node *hnode, void *arg)
1454 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
1455 int level = (int)(unsigned long)arg;
1458 ldlm_resource_dump(level, res);
1465 * Print information about all locks in this namespace on this node to debug
1468 void ldlm_namespace_dump(int level, struct ldlm_namespace *ns)
1470 if (!((libcfs_debug | D_ERROR) & level))
1473 CDEBUG(level, "--- Namespace: %s (rc: %d, side: %s)\n",
1474 ldlm_ns_name(ns), atomic_read(&ns->ns_bref),
1475 ns_is_client(ns) ? "client" : "server");
1477 if (cfs_time_before(cfs_time_current(), ns->ns_next_dump))
1480 cfs_hash_for_each_nolock(ns->ns_rs_hash,
1482 (void *)(unsigned long)level, 0);
1483 spin_lock(&ns->ns_lock);
1484 ns->ns_next_dump = cfs_time_shift(10);
1485 spin_unlock(&ns->ns_lock);
1489 * Print information about all locks in this resource to debug log.
1491 void ldlm_resource_dump(int level, struct ldlm_resource *res)
1493 struct ldlm_lock *lock;
1494 unsigned int granted = 0;
1496 CLASSERT(RES_NAME_SIZE == 4);
1498 if (!((libcfs_debug | D_ERROR) & level))
1501 CDEBUG(level, "--- Resource: "DLDLMRES" (%p) refcount = %d\n",
1502 PLDLMRES(res), res, atomic_read(&res->lr_refcount));
1504 if (!list_empty(&res->lr_granted)) {
1505 CDEBUG(level, "Granted locks (in reverse order):\n");
1506 list_for_each_entry_reverse(lock, &res->lr_granted,
1508 LDLM_DEBUG_LIMIT(level, lock, "###");
1509 if (!(level & D_CANTMASK) &&
1510 ++granted > ldlm_dump_granted_max) {
1511 CDEBUG(level, "only dump %d granted locks to "
1512 "avoid DDOS.\n", granted);
1517 if (!list_empty(&res->lr_converting)) {
1518 CDEBUG(level, "Converting locks:\n");
1519 list_for_each_entry(lock, &res->lr_converting, l_res_link)
1520 LDLM_DEBUG_LIMIT(level, lock, "###");
1522 if (!list_empty(&res->lr_waiting)) {
1523 CDEBUG(level, "Waiting locks:\n");
1524 list_for_each_entry(lock, &res->lr_waiting, l_res_link)
1525 LDLM_DEBUG_LIMIT(level, lock, "###");
1528 EXPORT_SYMBOL(ldlm_resource_dump);