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.gnu.org/licenses/gpl-2.0.html
23 * Copyright (c) 2002, 2010, Oracle and/or its affiliates. All rights reserved.
24 * Use is subject to license terms.
26 * Copyright (c) 2010, 2015, Intel Corporation.
29 * This file is part of Lustre, http://www.lustre.org/
30 * Lustre is a trademark of Sun Microsystems, Inc.
32 * lustre/ldlm/ldlm_resource.c
34 * Author: Phil Schwan <phil@clusterfs.com>
35 * Author: Peter Braam <braam@clusterfs.com>
38 #define DEBUG_SUBSYSTEM S_LDLM
39 #include <lustre_dlm.h>
40 #include <lustre_fid.h>
41 #include <obd_class.h>
42 #include "ldlm_internal.h"
44 struct kmem_cache *ldlm_resource_slab, *ldlm_lock_slab;
45 struct kmem_cache *ldlm_interval_tree_slab;
47 int ldlm_srv_namespace_nr = 0;
48 int ldlm_cli_namespace_nr = 0;
50 struct mutex ldlm_srv_namespace_lock;
51 struct list_head ldlm_srv_namespace_list;
53 struct mutex ldlm_cli_namespace_lock;
54 /* Client Namespaces that have active resources in them.
55 * Once all resources go away, ldlm_poold moves such namespaces to the
57 struct list_head ldlm_cli_active_namespace_list;
58 /* Client namespaces that don't have any locks in them */
59 struct list_head ldlm_cli_inactive_namespace_list;
61 static struct proc_dir_entry *ldlm_type_proc_dir;
62 static struct proc_dir_entry *ldlm_ns_proc_dir;
63 struct proc_dir_entry *ldlm_svc_proc_dir;
65 /* during debug dump certain amount of granted locks for one resource to avoid
67 static unsigned int ldlm_dump_granted_max = 256;
71 lprocfs_dump_ns_seq_write(struct file *file, const char __user *buffer,
72 size_t count, loff_t *off)
74 ldlm_dump_all_namespaces(LDLM_NAMESPACE_SERVER, D_DLMTRACE);
75 ldlm_dump_all_namespaces(LDLM_NAMESPACE_CLIENT, D_DLMTRACE);
78 LPROC_SEQ_FOPS_WO_TYPE(ldlm, dump_ns);
80 LPROC_SEQ_FOPS_RW_TYPE(ldlm_rw, uint);
81 LPROC_SEQ_FOPS_RO_TYPE(ldlm, uint);
83 #ifdef HAVE_SERVER_SUPPORT
85 static int seq_watermark_show(struct seq_file *m, void *data)
87 seq_printf(m, "%llu\n", *(__u64 *)m->private);
91 static ssize_t seq_watermark_write(struct file *file,
92 const char __user *buffer, size_t count,
97 __u64 *data = ((struct seq_file *)file->private_data)->private;
98 bool wm_low = (data == &ldlm_reclaim_threshold_mb) ? true : false;
101 rc = lprocfs_str_with_units_to_s64(buffer, count, &value, 'M');
103 CERROR("Failed to set %s, rc = %d.\n",
104 wm_low ? "lock_reclaim_threshold_mb" : "lock_limit_mb",
107 } else if (value != 0 && value < (1 << 20)) {
108 CERROR("%s should be greater than 1MB.\n",
109 wm_low ? "lock_reclaim_threshold_mb" : "lock_limit_mb");
112 watermark = value >> 20;
115 if (ldlm_lock_limit_mb != 0 && watermark > ldlm_lock_limit_mb) {
116 CERROR("lock_reclaim_threshold_mb must be smaller than "
122 if (watermark != 0) {
124 do_div(watermark, sizeof(struct ldlm_lock));
126 ldlm_reclaim_threshold = watermark;
128 if (ldlm_reclaim_threshold_mb != 0 &&
129 watermark < ldlm_reclaim_threshold_mb) {
130 CERROR("lock_limit_mb must be greater than "
131 "lock_reclaim_threshold_mb.\n");
136 if (watermark != 0) {
138 do_div(watermark, sizeof(struct ldlm_lock));
140 ldlm_lock_limit = watermark;
146 static int seq_watermark_open(struct inode *inode, struct file *file)
148 return single_open(file, seq_watermark_show, PDE_DATA(inode));
151 static const struct file_operations ldlm_watermark_fops = {
152 .owner = THIS_MODULE,
153 .open = seq_watermark_open,
155 .write = seq_watermark_write,
157 .release = lprocfs_single_release,
160 static int seq_granted_show(struct seq_file *m, void *data)
162 seq_printf(m, "%llu\n", percpu_counter_sum_positive(
163 (struct percpu_counter *)m->private));
167 static int seq_granted_open(struct inode *inode, struct file *file)
169 return single_open(file, seq_granted_show, PDE_DATA(inode));
172 static const struct file_operations ldlm_granted_fops = {
173 .owner = THIS_MODULE,
174 .open = seq_granted_open,
177 .release = seq_release,
180 #endif /* HAVE_SERVER_SUPPORT */
182 int ldlm_proc_setup(void)
185 struct lprocfs_vars list[] = {
186 { .name = "dump_namespaces",
187 .fops = &ldlm_dump_ns_fops,
189 { .name = "dump_granted_max",
190 .fops = &ldlm_rw_uint_fops,
191 .data = &ldlm_dump_granted_max },
192 { .name = "cancel_unused_locks_before_replay",
193 .fops = &ldlm_rw_uint_fops,
194 .data = &ldlm_cancel_unused_locks_before_replay },
195 #ifdef HAVE_SERVER_SUPPORT
196 { .name = "lock_reclaim_threshold_mb",
197 .fops = &ldlm_watermark_fops,
198 .data = &ldlm_reclaim_threshold_mb },
199 { .name = "lock_limit_mb",
200 .fops = &ldlm_watermark_fops,
201 .data = &ldlm_lock_limit_mb },
202 { .name = "lock_granted_count",
203 .fops = &ldlm_granted_fops,
204 .data = &ldlm_granted_total },
208 LASSERT(ldlm_ns_proc_dir == NULL);
210 ldlm_type_proc_dir = lprocfs_register(OBD_LDLM_DEVICENAME,
213 if (IS_ERR(ldlm_type_proc_dir)) {
214 CERROR("LProcFS failed in ldlm-init\n");
215 rc = PTR_ERR(ldlm_type_proc_dir);
219 ldlm_ns_proc_dir = lprocfs_register("namespaces",
222 if (IS_ERR(ldlm_ns_proc_dir)) {
223 CERROR("LProcFS failed in ldlm-init\n");
224 rc = PTR_ERR(ldlm_ns_proc_dir);
228 ldlm_svc_proc_dir = lprocfs_register("services",
231 if (IS_ERR(ldlm_svc_proc_dir)) {
232 CERROR("LProcFS failed in ldlm-init\n");
233 rc = PTR_ERR(ldlm_svc_proc_dir);
237 rc = lprocfs_add_vars(ldlm_type_proc_dir, list, NULL);
239 CERROR("LProcFS failed in ldlm-init\n");
246 lprocfs_remove(&ldlm_svc_proc_dir);
248 lprocfs_remove(&ldlm_ns_proc_dir);
250 lprocfs_remove(&ldlm_type_proc_dir);
252 ldlm_svc_proc_dir = NULL;
256 void ldlm_proc_cleanup(void)
258 if (ldlm_svc_proc_dir)
259 lprocfs_remove(&ldlm_svc_proc_dir);
261 if (ldlm_ns_proc_dir)
262 lprocfs_remove(&ldlm_ns_proc_dir);
264 if (ldlm_type_proc_dir)
265 lprocfs_remove(&ldlm_type_proc_dir);
268 static int lprocfs_ns_resources_seq_show(struct seq_file *m, void *v)
270 struct ldlm_namespace *ns = m->private;
272 struct cfs_hash_bd bd;
275 /* result is not strictly consistant */
276 cfs_hash_for_each_bucket(ns->ns_rs_hash, &bd, i)
277 res += cfs_hash_bd_count_get(&bd);
278 return lprocfs_u64_seq_show(m, &res);
280 LPROC_SEQ_FOPS_RO(lprocfs_ns_resources);
282 static int lprocfs_ns_locks_seq_show(struct seq_file *m, void *v)
284 struct ldlm_namespace *ns = m->private;
287 locks = lprocfs_stats_collector(ns->ns_stats, LDLM_NSS_LOCKS,
288 LPROCFS_FIELDS_FLAGS_SUM);
289 return lprocfs_u64_seq_show(m, &locks);
291 LPROC_SEQ_FOPS_RO(lprocfs_ns_locks);
293 static int lprocfs_lru_size_seq_show(struct seq_file *m, void *v)
295 struct ldlm_namespace *ns = m->private;
296 __u32 *nr = &ns->ns_max_unused;
298 if (ns_connect_lru_resize(ns))
299 nr = &ns->ns_nr_unused;
300 return lprocfs_uint_seq_show(m, nr);
303 static ssize_t lprocfs_lru_size_seq_write(struct file *file,
304 const char __user *buffer,
305 size_t count, loff_t *off)
307 struct ldlm_namespace *ns = ((struct seq_file *)file->private_data)->private;
308 char dummy[MAX_STRING_SIZE + 1], *end;
312 dummy[MAX_STRING_SIZE] = '\0';
313 if (copy_from_user(dummy, buffer, MAX_STRING_SIZE))
316 if (strncmp(dummy, "clear", 5) == 0) {
318 "dropping all unused locks from namespace %s\n",
320 if (ns_connect_lru_resize(ns)) {
321 int canceled, unused = ns->ns_nr_unused;
323 /* Try to cancel all @ns_nr_unused locks. */
324 canceled = ldlm_cancel_lru(ns, unused, 0,
325 LDLM_LRU_FLAG_PASSED);
326 if (canceled < unused) {
328 "not all requested locks are canceled, "
329 "requested: %d, canceled: %d\n", unused,
334 tmp = ns->ns_max_unused;
335 ns->ns_max_unused = 0;
336 ldlm_cancel_lru(ns, 0, 0, LDLM_LRU_FLAG_PASSED);
337 ns->ns_max_unused = tmp;
342 tmp = simple_strtoul(dummy, &end, 0);
344 CERROR("invalid value written\n");
347 lru_resize = (tmp == 0);
349 if (ns_connect_lru_resize(ns)) {
351 ns->ns_max_unused = tmp;
353 if (tmp > ns->ns_nr_unused)
354 tmp = ns->ns_nr_unused;
355 tmp = ns->ns_nr_unused - tmp;
358 "changing namespace %s unused locks from %u to %u\n",
359 ldlm_ns_name(ns), ns->ns_nr_unused,
361 ldlm_cancel_lru(ns, tmp, LCF_ASYNC, LDLM_LRU_FLAG_PASSED);
365 "disable lru_resize for namespace %s\n",
367 ns->ns_connect_flags &= ~OBD_CONNECT_LRU_RESIZE;
371 "changing namespace %s max_unused from %u to %u\n",
372 ldlm_ns_name(ns), ns->ns_max_unused,
374 ns->ns_max_unused = (unsigned int)tmp;
375 ldlm_cancel_lru(ns, 0, LCF_ASYNC, LDLM_LRU_FLAG_PASSED);
377 /* Make sure that LRU resize was originally supported before
378 * turning it on here. */
380 (ns->ns_orig_connect_flags & OBD_CONNECT_LRU_RESIZE)) {
382 "enable lru_resize for namespace %s\n",
384 ns->ns_connect_flags |= OBD_CONNECT_LRU_RESIZE;
390 LPROC_SEQ_FOPS(lprocfs_lru_size);
392 static int lprocfs_elc_seq_show(struct seq_file *m, void *v)
394 struct ldlm_namespace *ns = m->private;
395 unsigned int supp = ns_connect_cancelset(ns);
397 return lprocfs_uint_seq_show(m, &supp);
400 static ssize_t lprocfs_elc_seq_write(struct file *file,
401 const char __user *buffer,
402 size_t count, loff_t *off)
404 struct ldlm_namespace *ns = ((struct seq_file *)file->private_data)->private;
405 unsigned int supp = -1;
408 rc = lprocfs_wr_uint(file, buffer, count, &supp);
413 ns->ns_connect_flags &= ~OBD_CONNECT_CANCELSET;
414 else if (ns->ns_orig_connect_flags & OBD_CONNECT_CANCELSET)
415 ns->ns_connect_flags |= OBD_CONNECT_CANCELSET;
418 LPROC_SEQ_FOPS(lprocfs_elc);
420 static void ldlm_namespace_proc_unregister(struct ldlm_namespace *ns)
422 if (ns->ns_proc_dir_entry == NULL)
423 CERROR("dlm namespace %s has no procfs dir?\n",
426 lprocfs_remove(&ns->ns_proc_dir_entry);
428 if (ns->ns_stats != NULL)
429 lprocfs_free_stats(&ns->ns_stats);
432 static int ldlm_namespace_proc_register(struct ldlm_namespace *ns)
434 struct lprocfs_vars lock_vars[2];
435 char lock_name[MAX_STRING_SIZE + 1];
436 struct proc_dir_entry *ns_pde;
439 LASSERT(ns->ns_rs_hash != NULL);
441 if (ns->ns_proc_dir_entry != NULL) {
442 ns_pde = ns->ns_proc_dir_entry;
444 ns_pde = proc_mkdir(ldlm_ns_name(ns), ldlm_ns_proc_dir);
447 ns->ns_proc_dir_entry = ns_pde;
450 ns->ns_stats = lprocfs_alloc_stats(LDLM_NSS_LAST, 0);
451 if (ns->ns_stats == NULL)
454 lprocfs_counter_init(ns->ns_stats, LDLM_NSS_LOCKS,
455 LPROCFS_CNTR_AVGMINMAX, "locks", "locks");
457 lock_name[MAX_STRING_SIZE] = '\0';
459 memset(lock_vars, 0, sizeof(lock_vars));
460 lock_vars[0].name = lock_name;
462 ldlm_add_var(&lock_vars[0], ns_pde, "resource_count", ns,
463 &lprocfs_ns_resources_fops);
464 ldlm_add_var(&lock_vars[0], ns_pde, "lock_count", ns,
465 &lprocfs_ns_locks_fops);
467 if (ns_is_client(ns)) {
468 ldlm_add_var(&lock_vars[0], ns_pde, "lock_unused_count",
469 &ns->ns_nr_unused, &ldlm_uint_fops);
470 ldlm_add_var(&lock_vars[0], ns_pde, "lru_size", ns,
471 &lprocfs_lru_size_fops);
472 ldlm_add_var(&lock_vars[0], ns_pde, "lru_max_age",
473 &ns->ns_max_age, &ldlm_rw_uint_fops);
474 ldlm_add_var(&lock_vars[0], ns_pde, "early_lock_cancel",
475 ns, &lprocfs_elc_fops);
477 ldlm_add_var(&lock_vars[0], ns_pde, "ctime_age_limit",
478 &ns->ns_ctime_age_limit, &ldlm_rw_uint_fops);
479 ldlm_add_var(&lock_vars[0], ns_pde, "lock_timeouts",
480 &ns->ns_timeouts, &ldlm_uint_fops);
481 ldlm_add_var(&lock_vars[0], ns_pde, "max_nolock_bytes",
482 &ns->ns_max_nolock_size, &ldlm_rw_uint_fops);
483 ldlm_add_var(&lock_vars[0], ns_pde, "contention_seconds",
484 &ns->ns_contention_time, &ldlm_rw_uint_fops);
485 ldlm_add_var(&lock_vars[0], ns_pde, "contended_locks",
486 &ns->ns_contended_locks, &ldlm_rw_uint_fops);
487 ldlm_add_var(&lock_vars[0], ns_pde, "max_parallel_ast",
488 &ns->ns_max_parallel_ast, &ldlm_rw_uint_fops);
492 #undef MAX_STRING_SIZE
493 #else /* CONFIG_PROC_FS */
495 #define ldlm_namespace_proc_unregister(ns) ({;})
496 #define ldlm_namespace_proc_register(ns) ({0;})
498 #endif /* CONFIG_PROC_FS */
500 static unsigned ldlm_res_hop_hash(struct cfs_hash *hs,
501 const void *key, unsigned mask)
503 const struct ldlm_res_id *id = key;
507 for (i = 0; i < RES_NAME_SIZE; i++)
512 static unsigned ldlm_res_hop_fid_hash(struct cfs_hash *hs,
513 const void *key, unsigned mask)
515 const struct ldlm_res_id *id = key;
520 fid.f_seq = id->name[LUSTRE_RES_ID_SEQ_OFF];
521 fid.f_oid = (__u32)id->name[LUSTRE_RES_ID_VER_OID_OFF];
522 fid.f_ver = (__u32)(id->name[LUSTRE_RES_ID_VER_OID_OFF] >> 32);
524 hash = fid_flatten32(&fid);
525 hash += (hash >> 4) + (hash << 12); /* mixing oid and seq */
526 if (id->name[LUSTRE_RES_ID_HSH_OFF] != 0) {
527 val = id->name[LUSTRE_RES_ID_HSH_OFF];
528 hash += (val >> 5) + (val << 11);
532 hash = hash_long(hash, hs->hs_bkt_bits);
533 /* give me another random factor */
534 hash -= hash_long((unsigned long)hs, val % 11 + 3);
536 hash <<= hs->hs_cur_bits - hs->hs_bkt_bits;
537 hash |= ldlm_res_hop_hash(hs, key, CFS_HASH_NBKT(hs) - 1);
542 static void *ldlm_res_hop_key(struct hlist_node *hnode)
544 struct ldlm_resource *res;
546 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
547 return &res->lr_name;
550 static int ldlm_res_hop_keycmp(const void *key, struct hlist_node *hnode)
552 struct ldlm_resource *res;
554 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
555 return ldlm_res_eq((const struct ldlm_res_id *)key,
556 (const struct ldlm_res_id *)&res->lr_name);
559 static void *ldlm_res_hop_object(struct hlist_node *hnode)
561 return hlist_entry(hnode, struct ldlm_resource, lr_hash);
565 ldlm_res_hop_get_locked(struct cfs_hash *hs, struct hlist_node *hnode)
567 struct ldlm_resource *res;
569 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
570 ldlm_resource_getref(res);
573 static void ldlm_res_hop_put(struct cfs_hash *hs, struct hlist_node *hnode)
575 struct ldlm_resource *res;
577 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
578 ldlm_resource_putref(res);
581 static struct cfs_hash_ops ldlm_ns_hash_ops = {
582 .hs_hash = ldlm_res_hop_hash,
583 .hs_key = ldlm_res_hop_key,
584 .hs_keycmp = ldlm_res_hop_keycmp,
586 .hs_object = ldlm_res_hop_object,
587 .hs_get = ldlm_res_hop_get_locked,
588 .hs_put = ldlm_res_hop_put
591 static struct cfs_hash_ops ldlm_ns_fid_hash_ops = {
592 .hs_hash = ldlm_res_hop_fid_hash,
593 .hs_key = ldlm_res_hop_key,
594 .hs_keycmp = ldlm_res_hop_keycmp,
596 .hs_object = ldlm_res_hop_object,
597 .hs_get = ldlm_res_hop_get_locked,
598 .hs_put = ldlm_res_hop_put
601 typedef struct ldlm_ns_hash_def {
602 enum ldlm_ns_type nsd_type;
603 /** hash bucket bits */
604 unsigned nsd_bkt_bits;
606 unsigned nsd_all_bits;
607 /** hash operations */
608 struct cfs_hash_ops *nsd_hops;
609 } ldlm_ns_hash_def_t;
611 static struct ldlm_ns_hash_def ldlm_ns_hash_defs[] =
614 .nsd_type = LDLM_NS_TYPE_MDC,
617 .nsd_hops = &ldlm_ns_fid_hash_ops,
620 .nsd_type = LDLM_NS_TYPE_MDT,
623 .nsd_hops = &ldlm_ns_fid_hash_ops,
626 .nsd_type = LDLM_NS_TYPE_OSC,
629 .nsd_hops = &ldlm_ns_hash_ops,
632 .nsd_type = LDLM_NS_TYPE_OST,
635 .nsd_hops = &ldlm_ns_hash_ops,
638 .nsd_type = LDLM_NS_TYPE_MGC,
641 .nsd_hops = &ldlm_ns_hash_ops,
644 .nsd_type = LDLM_NS_TYPE_MGT,
647 .nsd_hops = &ldlm_ns_hash_ops,
650 .nsd_type = LDLM_NS_TYPE_UNKNOWN,
655 * Create and initialize new empty namespace.
657 struct ldlm_namespace *ldlm_namespace_new(struct obd_device *obd, char *name,
658 enum ldlm_side client,
659 enum ldlm_appetite apt,
660 enum ldlm_ns_type ns_type)
662 struct ldlm_namespace *ns = NULL;
663 struct ldlm_ns_bucket *nsb;
664 struct ldlm_ns_hash_def *nsd;
665 struct cfs_hash_bd bd;
670 LASSERT(obd != NULL);
674 CERROR("ldlm_get_ref failed: %d\n", rc);
678 for (idx = 0;;idx++) {
679 nsd = &ldlm_ns_hash_defs[idx];
680 if (nsd->nsd_type == LDLM_NS_TYPE_UNKNOWN) {
681 CERROR("Unknown type %d for ns %s\n", ns_type, name);
685 if (nsd->nsd_type == ns_type)
693 ns->ns_rs_hash = cfs_hash_create(name,
694 nsd->nsd_all_bits, nsd->nsd_all_bits,
695 nsd->nsd_bkt_bits, sizeof(*nsb),
701 CFS_HASH_SPIN_BKTLOCK |
702 CFS_HASH_NO_ITEMREF);
703 if (ns->ns_rs_hash == NULL)
706 cfs_hash_for_each_bucket(ns->ns_rs_hash, &bd, idx) {
707 nsb = cfs_hash_bd_extra_get(ns->ns_rs_hash, &bd);
708 at_init(&nsb->nsb_at_estimate, ldlm_enqueue_min, 0);
709 nsb->nsb_namespace = ns;
710 nsb->nsb_reclaim_start = 0;
714 ns->ns_appetite = apt;
715 ns->ns_client = client;
717 INIT_LIST_HEAD(&ns->ns_list_chain);
718 INIT_LIST_HEAD(&ns->ns_unused_list);
719 spin_lock_init(&ns->ns_lock);
720 atomic_set(&ns->ns_bref, 0);
721 init_waitqueue_head(&ns->ns_waitq);
723 ns->ns_max_nolock_size = NS_DEFAULT_MAX_NOLOCK_BYTES;
724 ns->ns_contention_time = NS_DEFAULT_CONTENTION_SECONDS;
725 ns->ns_contended_locks = NS_DEFAULT_CONTENDED_LOCKS;
727 ns->ns_max_parallel_ast = LDLM_DEFAULT_PARALLEL_AST_LIMIT;
728 ns->ns_nr_unused = 0;
729 ns->ns_max_unused = LDLM_DEFAULT_LRU_SIZE;
730 ns->ns_max_age = LDLM_DEFAULT_MAX_ALIVE;
731 ns->ns_ctime_age_limit = LDLM_CTIME_AGE_LIMIT;
733 ns->ns_orig_connect_flags = 0;
734 ns->ns_connect_flags = 0;
736 ns->ns_reclaim_start = 0;
737 rc = ldlm_namespace_proc_register(ns);
739 CERROR("Can't initialize ns proc, rc %d\n", rc);
743 idx = ldlm_namespace_nr_read(client);
744 rc = ldlm_pool_init(&ns->ns_pool, ns, idx, client);
746 CERROR("Can't initialize lock pool, rc %d\n", rc);
750 ldlm_namespace_register(ns, client);
753 ldlm_namespace_proc_unregister(ns);
754 ldlm_namespace_cleanup(ns, 0);
756 cfs_hash_putref(ns->ns_rs_hash);
763 EXPORT_SYMBOL(ldlm_namespace_new);
765 extern struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock);
768 * Cancel and destroy all locks on a resource.
770 * If flags contains FL_LOCAL_ONLY, don't try to tell the server, just
771 * clean up. This is currently only used for recovery, and we make
772 * certain assumptions as a result--notably, that we shouldn't cancel
775 static void cleanup_resource(struct ldlm_resource *res, struct list_head *q,
778 struct list_head *tmp;
779 int rc = 0, client = ns_is_client(ldlm_res_to_ns(res));
780 bool local_only = !!(flags & LDLM_FL_LOCAL_ONLY);
783 struct ldlm_lock *lock = NULL;
785 /* First, we look for non-cleaned-yet lock
786 * all cleaned locks are marked by CLEANED flag. */
788 list_for_each(tmp, q) {
789 lock = list_entry(tmp, struct ldlm_lock,
791 if (ldlm_is_cleaned(lock)) {
796 ldlm_set_cleaned(lock);
805 /* Set CBPENDING so nothing in the cancellation path
806 * can match this lock. */
807 ldlm_set_cbpending(lock);
808 ldlm_set_failed(lock);
809 lock->l_flags |= flags;
811 /* ... without sending a CANCEL message for local_only. */
813 ldlm_set_local_only(lock);
815 if (local_only && (lock->l_readers || lock->l_writers)) {
816 /* This is a little bit gross, but much better than the
817 * alternative: pretend that we got a blocking AST from
818 * the server, so that when the lock is decref'd, it
819 * will go away ... */
821 LDLM_DEBUG(lock, "setting FL_LOCAL_ONLY");
822 if (lock->l_flags & LDLM_FL_FAIL_LOC) {
823 set_current_state(TASK_UNINTERRUPTIBLE);
824 schedule_timeout(cfs_time_seconds(4));
825 set_current_state(TASK_RUNNING);
827 if (lock->l_completion_ast)
828 lock->l_completion_ast(lock,
829 LDLM_FL_FAILED, NULL);
830 LDLM_LOCK_RELEASE(lock);
835 struct lustre_handle lockh;
838 ldlm_lock2handle(lock, &lockh);
839 rc = ldlm_cli_cancel(&lockh, LCF_LOCAL);
841 CERROR("ldlm_cli_cancel: %d\n", rc);
844 LDLM_DEBUG(lock, "Freeing a lock still held by a "
846 ldlm_lock_cancel(lock);
848 LDLM_LOCK_RELEASE(lock);
852 static int ldlm_resource_clean(struct cfs_hash *hs, struct cfs_hash_bd *bd,
853 struct hlist_node *hnode, void *arg)
855 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
856 __u64 flags = *(__u64 *)arg;
858 cleanup_resource(res, &res->lr_granted, flags);
859 cleanup_resource(res, &res->lr_converting, flags);
860 cleanup_resource(res, &res->lr_waiting, flags);
865 static int ldlm_resource_complain(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);
871 CERROR("%s: namespace resource "DLDLMRES" (%p) refcount nonzero "
872 "(%d) after lock cleanup; forcing cleanup.\n",
873 ldlm_ns_name(ldlm_res_to_ns(res)), PLDLMRES(res), res,
874 atomic_read(&res->lr_refcount) - 1);
876 ldlm_resource_dump(D_ERROR, res);
882 * Cancel and destroy all locks in the namespace.
884 * Typically used during evictions when server notified client that it was
885 * evicted and all of its state needs to be destroyed.
886 * Also used during shutdown.
888 int ldlm_namespace_cleanup(struct ldlm_namespace *ns, __u64 flags)
891 CDEBUG(D_INFO, "NULL ns, skipping cleanup\n");
895 cfs_hash_for_each_nolock(ns->ns_rs_hash, ldlm_resource_clean,
897 cfs_hash_for_each_nolock(ns->ns_rs_hash, ldlm_resource_complain,
901 EXPORT_SYMBOL(ldlm_namespace_cleanup);
904 * Attempts to free namespace.
906 * Only used when namespace goes away, like during an unmount.
908 static int __ldlm_namespace_free(struct ldlm_namespace *ns, int force)
912 /* At shutdown time, don't call the cancellation callback */
913 ldlm_namespace_cleanup(ns, force ? LDLM_FL_LOCAL_ONLY : 0);
915 if (atomic_read(&ns->ns_bref) > 0) {
916 struct l_wait_info lwi = LWI_INTR(LWI_ON_SIGNAL_NOOP, NULL);
919 "dlm namespace %s free waiting on refcount %d\n",
920 ldlm_ns_name(ns), atomic_read(&ns->ns_bref));
923 lwi = LWI_TIMEOUT(msecs_to_jiffies(obd_timeout *
924 MSEC_PER_SEC) / 4, NULL, NULL);
926 rc = l_wait_event(ns->ns_waitq,
927 atomic_read(&ns->ns_bref) == 0, &lwi);
929 /* Forced cleanups should be able to reclaim all references,
930 * so it's safe to wait forever... we can't leak locks... */
931 if (force && rc == -ETIMEDOUT) {
932 LCONSOLE_ERROR("Forced cleanup waiting for %s "
933 "namespace with %d resources in use, "
934 "(rc=%d)\n", ldlm_ns_name(ns),
935 atomic_read(&ns->ns_bref), rc);
936 GOTO(force_wait, rc);
939 if (atomic_read(&ns->ns_bref)) {
940 LCONSOLE_ERROR("Cleanup waiting for %s namespace "
941 "with %d resources in use, (rc=%d)\n",
943 atomic_read(&ns->ns_bref), rc);
944 RETURN(ELDLM_NAMESPACE_EXISTS);
946 CDEBUG(D_DLMTRACE, "dlm namespace %s free done waiting\n",
954 * Performs various cleanups for passed \a ns to make it drop refc and be
955 * ready for freeing. Waits for refc == 0.
957 * The following is done:
958 * (0) Unregister \a ns from its list to make inaccessible for potential
959 * users like pools thread and others;
960 * (1) Clear all locks in \a ns.
962 void ldlm_namespace_free_prior(struct ldlm_namespace *ns,
963 struct obd_import *imp,
973 spin_lock(&ns->ns_lock);
975 spin_unlock(&ns->ns_lock);
978 * Can fail with -EINTR when force == 0 in which case try harder.
980 rc = __ldlm_namespace_free(ns, force);
981 if (rc != ELDLM_OK) {
983 ptlrpc_disconnect_import(imp, 0);
984 ptlrpc_invalidate_import(imp);
988 * With all requests dropped and the import inactive
989 * we are gaurenteed all reference will be dropped.
991 rc = __ldlm_namespace_free(ns, 1);
996 EXPORT_SYMBOL(ldlm_namespace_free_prior);
999 * Performs freeing memory structures related to \a ns. This is only done
1000 * when ldlm_namespce_free_prior() successfully removed all resources
1001 * referencing \a ns and its refc == 0.
1003 void ldlm_namespace_free_post(struct ldlm_namespace *ns)
1011 /* Make sure that nobody can find this ns in its list. */
1012 ldlm_namespace_unregister(ns, ns->ns_client);
1013 /* Fini pool _before_ parent proc dir is removed. This is important as
1014 * ldlm_pool_fini() removes own proc dir which is child to @dir.
1015 * Removing it after @dir may cause oops. */
1016 ldlm_pool_fini(&ns->ns_pool);
1018 ldlm_namespace_proc_unregister(ns);
1019 cfs_hash_putref(ns->ns_rs_hash);
1020 /* Namespace \a ns should be not on list at this time, otherwise
1021 * this will cause issues related to using freed \a ns in poold
1023 LASSERT(list_empty(&ns->ns_list_chain));
1028 EXPORT_SYMBOL(ldlm_namespace_free_post);
1031 * Cleanup the resource, and free namespace.
1034 * proc1: destroy import
1035 * class_disconnect_export(grab cl_sem) ->
1036 * -> ldlm_namespace_free ->
1037 * -> lprocfs_remove(grab _lprocfs_lock).
1038 * proc2: read proc info
1039 * lprocfs_fops_read(grab _lprocfs_lock) ->
1040 * -> osc_rd_active, etc(grab cl_sem).
1042 * So that I have to split the ldlm_namespace_free into two parts - the first
1043 * part ldlm_namespace_free_prior is used to cleanup the resource which is
1044 * being used; the 2nd part ldlm_namespace_free_post is used to unregister the
1045 * lprocfs entries, and then free memory. It will be called w/o cli->cl_sem
1048 void ldlm_namespace_free(struct ldlm_namespace *ns,
1049 struct obd_import *imp,
1052 ldlm_namespace_free_prior(ns, imp, force);
1053 ldlm_namespace_free_post(ns);
1055 EXPORT_SYMBOL(ldlm_namespace_free);
1057 void ldlm_namespace_get(struct ldlm_namespace *ns)
1059 atomic_inc(&ns->ns_bref);
1062 /* This is only for callers that care about refcount */
1063 static int ldlm_namespace_get_return(struct ldlm_namespace *ns)
1065 return atomic_inc_return(&ns->ns_bref);
1068 void ldlm_namespace_put(struct ldlm_namespace *ns)
1070 if (atomic_dec_and_lock(&ns->ns_bref, &ns->ns_lock)) {
1071 wake_up(&ns->ns_waitq);
1072 spin_unlock(&ns->ns_lock);
1076 /** Register \a ns in the list of namespaces */
1077 void ldlm_namespace_register(struct ldlm_namespace *ns, enum ldlm_side client)
1079 mutex_lock(ldlm_namespace_lock(client));
1080 LASSERT(list_empty(&ns->ns_list_chain));
1081 list_add(&ns->ns_list_chain, ldlm_namespace_inactive_list(client));
1082 ldlm_namespace_nr_inc(client);
1083 mutex_unlock(ldlm_namespace_lock(client));
1086 /** Unregister \a ns from the list of namespaces. */
1087 void ldlm_namespace_unregister(struct ldlm_namespace *ns, enum ldlm_side client)
1089 mutex_lock(ldlm_namespace_lock(client));
1090 LASSERT(!list_empty(&ns->ns_list_chain));
1091 /* Some asserts and possibly other parts of the code are still
1092 * using list_empty(&ns->ns_list_chain). This is why it is
1093 * important to use list_del_init() here. */
1094 list_del_init(&ns->ns_list_chain);
1095 ldlm_namespace_nr_dec(client);
1096 mutex_unlock(ldlm_namespace_lock(client));
1099 /** Should be called with ldlm_namespace_lock(client) taken. */
1100 void ldlm_namespace_move_to_active_locked(struct ldlm_namespace *ns,
1101 enum ldlm_side client)
1103 LASSERT(!list_empty(&ns->ns_list_chain));
1104 LASSERT(mutex_is_locked(ldlm_namespace_lock(client)));
1105 list_move_tail(&ns->ns_list_chain, ldlm_namespace_list(client));
1108 /** Should be called with ldlm_namespace_lock(client) taken. */
1109 void ldlm_namespace_move_to_inactive_locked(struct ldlm_namespace *ns,
1110 enum ldlm_side client)
1112 LASSERT(!list_empty(&ns->ns_list_chain));
1113 LASSERT(mutex_is_locked(ldlm_namespace_lock(client)));
1114 list_move_tail(&ns->ns_list_chain,
1115 ldlm_namespace_inactive_list(client));
1118 /** Should be called with ldlm_namespace_lock(client) taken. */
1119 struct ldlm_namespace *ldlm_namespace_first_locked(enum ldlm_side client)
1121 LASSERT(mutex_is_locked(ldlm_namespace_lock(client)));
1122 LASSERT(!list_empty(ldlm_namespace_list(client)));
1123 return container_of(ldlm_namespace_list(client)->next,
1124 struct ldlm_namespace, ns_list_chain);
1127 /** Create and initialize new resource. */
1128 static struct ldlm_resource *ldlm_resource_new(enum ldlm_type ldlm_type)
1130 struct ldlm_resource *res;
1133 OBD_SLAB_ALLOC_PTR_GFP(res, ldlm_resource_slab, GFP_NOFS);
1137 if (ldlm_type == LDLM_EXTENT) {
1138 OBD_SLAB_ALLOC(res->lr_itree, ldlm_interval_tree_slab,
1139 sizeof(*res->lr_itree) * LCK_MODE_NUM);
1140 if (res->lr_itree == NULL) {
1141 OBD_SLAB_FREE_PTR(res, ldlm_resource_slab);
1144 /* Initialize interval trees for each lock mode. */
1145 for (idx = 0; idx < LCK_MODE_NUM; idx++) {
1146 res->lr_itree[idx].lit_size = 0;
1147 res->lr_itree[idx].lit_mode = 1 << idx;
1148 res->lr_itree[idx].lit_root = NULL;
1152 INIT_LIST_HEAD(&res->lr_granted);
1153 INIT_LIST_HEAD(&res->lr_converting);
1154 INIT_LIST_HEAD(&res->lr_waiting);
1156 atomic_set(&res->lr_refcount, 1);
1157 spin_lock_init(&res->lr_lock);
1158 lu_ref_init(&res->lr_reference);
1160 /* Since LVB init can be delayed now, there is no longer need to
1161 * immediatelly acquire mutex here. */
1162 mutex_init(&res->lr_lvb_mutex);
1163 res->lr_lvb_initialized = false;
1169 * Return a reference to resource with given name, creating it if necessary.
1170 * Args: namespace with ns_lock unlocked
1171 * Locks: takes and releases NS hash-lock and res->lr_lock
1172 * Returns: referenced, unlocked ldlm_resource or NULL
1174 struct ldlm_resource *
1175 ldlm_resource_get(struct ldlm_namespace *ns, struct ldlm_resource *parent,
1176 const struct ldlm_res_id *name, enum ldlm_type type,
1179 struct hlist_node *hnode;
1180 struct ldlm_resource *res = NULL;
1181 struct cfs_hash_bd bd;
1183 int ns_refcount = 0;
1185 LASSERT(ns != NULL);
1186 LASSERT(parent == NULL);
1187 LASSERT(ns->ns_rs_hash != NULL);
1188 LASSERT(name->name[0] != 0);
1190 cfs_hash_bd_get_and_lock(ns->ns_rs_hash, (void *)name, &bd, 0);
1191 hnode = cfs_hash_bd_lookup_locked(ns->ns_rs_hash, &bd, (void *)name);
1192 if (hnode != NULL) {
1193 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 0);
1197 version = cfs_hash_bd_version_get(&bd);
1198 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 0);
1201 return ERR_PTR(-ENOENT);
1203 LASSERTF(type >= LDLM_MIN_TYPE && type < LDLM_MAX_TYPE,
1204 "type: %d\n", type);
1205 res = ldlm_resource_new(type);
1207 return ERR_PTR(-ENOMEM);
1209 res->lr_ns_bucket = cfs_hash_bd_extra_get(ns->ns_rs_hash, &bd);
1210 res->lr_name = *name;
1211 res->lr_type = type;
1213 cfs_hash_bd_lock(ns->ns_rs_hash, &bd, 1);
1214 hnode = (version == cfs_hash_bd_version_get(&bd)) ? NULL :
1215 cfs_hash_bd_lookup_locked(ns->ns_rs_hash, &bd, (void *)name);
1217 if (hnode != NULL) {
1218 /* Someone won the race and already added the resource. */
1219 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
1220 /* Clean lu_ref for failed resource. */
1221 lu_ref_fini(&res->lr_reference);
1222 if (res->lr_itree != NULL)
1223 OBD_SLAB_FREE(res->lr_itree, ldlm_interval_tree_slab,
1224 sizeof(*res->lr_itree) * LCK_MODE_NUM);
1225 OBD_SLAB_FREE(res, ldlm_resource_slab, sizeof *res);
1227 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
1230 /* We won! Let's add the resource. */
1231 cfs_hash_bd_add_locked(ns->ns_rs_hash, &bd, &res->lr_hash);
1232 if (cfs_hash_bd_count_get(&bd) == 1)
1233 ns_refcount = ldlm_namespace_get_return(ns);
1235 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
1237 OBD_FAIL_TIMEOUT(OBD_FAIL_LDLM_CREATE_RESOURCE, 2);
1239 /* Let's see if we happened to be the very first resource in this
1240 * namespace. If so, and this is a client namespace, we need to move
1241 * the namespace into the active namespaces list to be patrolled by
1242 * the ldlm_poold. */
1243 if (ns_is_client(ns) && ns_refcount == 1) {
1244 mutex_lock(ldlm_namespace_lock(LDLM_NAMESPACE_CLIENT));
1245 ldlm_namespace_move_to_active_locked(ns, LDLM_NAMESPACE_CLIENT);
1246 mutex_unlock(ldlm_namespace_lock(LDLM_NAMESPACE_CLIENT));
1251 EXPORT_SYMBOL(ldlm_resource_get);
1253 struct ldlm_resource *ldlm_resource_getref(struct ldlm_resource *res)
1255 LASSERT(res != NULL);
1256 LASSERT(res != LP_POISON);
1257 atomic_inc(&res->lr_refcount);
1258 CDEBUG(D_INFO, "getref res: %p count: %d\n", res,
1259 atomic_read(&res->lr_refcount));
1263 static void __ldlm_resource_putref_final(struct cfs_hash_bd *bd,
1264 struct ldlm_resource *res)
1266 struct ldlm_ns_bucket *nsb = res->lr_ns_bucket;
1268 if (!list_empty(&res->lr_granted)) {
1269 ldlm_resource_dump(D_ERROR, res);
1273 if (!list_empty(&res->lr_converting)) {
1274 ldlm_resource_dump(D_ERROR, res);
1278 if (!list_empty(&res->lr_waiting)) {
1279 ldlm_resource_dump(D_ERROR, res);
1283 cfs_hash_bd_del_locked(nsb->nsb_namespace->ns_rs_hash,
1285 lu_ref_fini(&res->lr_reference);
1286 if (cfs_hash_bd_count_get(bd) == 0)
1287 ldlm_namespace_put(nsb->nsb_namespace);
1290 /* Returns 1 if the resource was freed, 0 if it remains. */
1291 int ldlm_resource_putref(struct ldlm_resource *res)
1293 struct ldlm_namespace *ns = ldlm_res_to_ns(res);
1294 struct cfs_hash_bd bd;
1296 LASSERT_ATOMIC_GT_LT(&res->lr_refcount, 0, LI_POISON);
1297 CDEBUG(D_INFO, "putref res: %p count: %d\n",
1298 res, atomic_read(&res->lr_refcount) - 1);
1300 cfs_hash_bd_get(ns->ns_rs_hash, &res->lr_name, &bd);
1301 if (cfs_hash_bd_dec_and_lock(ns->ns_rs_hash, &bd, &res->lr_refcount)) {
1302 __ldlm_resource_putref_final(&bd, res);
1303 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
1304 if (ns->ns_lvbo && ns->ns_lvbo->lvbo_free)
1305 ns->ns_lvbo->lvbo_free(res);
1306 if (res->lr_itree != NULL)
1307 OBD_SLAB_FREE(res->lr_itree, ldlm_interval_tree_slab,
1308 sizeof(*res->lr_itree) * LCK_MODE_NUM);
1309 OBD_SLAB_FREE(res, ldlm_resource_slab, sizeof *res);
1314 EXPORT_SYMBOL(ldlm_resource_putref);
1317 * Add a lock into a given resource into specified lock list.
1319 void ldlm_resource_add_lock(struct ldlm_resource *res, struct list_head *head,
1320 struct ldlm_lock *lock)
1322 check_res_locked(res);
1324 LDLM_DEBUG(lock, "About to add this lock");
1326 if (ldlm_is_destroyed(lock)) {
1327 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
1331 LASSERT(list_empty(&lock->l_res_link));
1333 list_add_tail(&lock->l_res_link, head);
1337 * Insert a lock into resource after specified lock.
1339 * Obtain resource description from the lock we are inserting after.
1341 void ldlm_resource_insert_lock_after(struct ldlm_lock *original,
1342 struct ldlm_lock *new)
1344 struct ldlm_resource *res = original->l_resource;
1346 check_res_locked(res);
1348 ldlm_resource_dump(D_INFO, res);
1349 LDLM_DEBUG(new, "About to insert this lock after %p: ", original);
1351 if (ldlm_is_destroyed(new)) {
1352 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
1356 LASSERT(list_empty(&new->l_res_link));
1358 list_add(&new->l_res_link, &original->l_res_link);
1362 void ldlm_resource_unlink_lock(struct ldlm_lock *lock)
1364 int type = lock->l_resource->lr_type;
1366 check_res_locked(lock->l_resource);
1367 if (type == LDLM_IBITS || type == LDLM_PLAIN)
1368 ldlm_unlink_lock_skiplist(lock);
1369 else if (type == LDLM_EXTENT)
1370 ldlm_extent_unlink_lock(lock);
1371 list_del_init(&lock->l_res_link);
1373 EXPORT_SYMBOL(ldlm_resource_unlink_lock);
1375 void ldlm_res2desc(struct ldlm_resource *res, struct ldlm_resource_desc *desc)
1377 desc->lr_type = res->lr_type;
1378 desc->lr_name = res->lr_name;
1382 * Print information about all locks in all namespaces on this node to debug
1385 void ldlm_dump_all_namespaces(enum ldlm_side client, int level)
1387 struct list_head *tmp;
1389 if (!((libcfs_debug | D_ERROR) & level))
1392 mutex_lock(ldlm_namespace_lock(client));
1394 list_for_each(tmp, ldlm_namespace_list(client)) {
1395 struct ldlm_namespace *ns;
1397 ns = list_entry(tmp, struct ldlm_namespace, ns_list_chain);
1398 ldlm_namespace_dump(level, ns);
1401 mutex_unlock(ldlm_namespace_lock(client));
1404 static int ldlm_res_hash_dump(struct cfs_hash *hs, struct cfs_hash_bd *bd,
1405 struct hlist_node *hnode, void *arg)
1407 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
1408 int level = (int)(unsigned long)arg;
1411 ldlm_resource_dump(level, res);
1418 * Print information about all locks in this namespace on this node to debug
1421 void ldlm_namespace_dump(int level, struct ldlm_namespace *ns)
1423 if (!((libcfs_debug | D_ERROR) & level))
1426 CDEBUG(level, "--- Namespace: %s (rc: %d, side: %s)\n",
1427 ldlm_ns_name(ns), atomic_read(&ns->ns_bref),
1428 ns_is_client(ns) ? "client" : "server");
1430 if (cfs_time_before(cfs_time_current(), ns->ns_next_dump))
1433 cfs_hash_for_each_nolock(ns->ns_rs_hash,
1435 (void *)(unsigned long)level, 0);
1436 spin_lock(&ns->ns_lock);
1437 ns->ns_next_dump = cfs_time_shift(10);
1438 spin_unlock(&ns->ns_lock);
1442 * Print information about all locks in this resource to debug log.
1444 void ldlm_resource_dump(int level, struct ldlm_resource *res)
1446 struct ldlm_lock *lock;
1447 unsigned int granted = 0;
1449 CLASSERT(RES_NAME_SIZE == 4);
1451 if (!((libcfs_debug | D_ERROR) & level))
1454 CDEBUG(level, "--- Resource: "DLDLMRES" (%p) refcount = %d\n",
1455 PLDLMRES(res), res, atomic_read(&res->lr_refcount));
1457 if (!list_empty(&res->lr_granted)) {
1458 CDEBUG(level, "Granted locks (in reverse order):\n");
1459 list_for_each_entry_reverse(lock, &res->lr_granted,
1461 LDLM_DEBUG_LIMIT(level, lock, "###");
1462 if (!(level & D_CANTMASK) &&
1463 ++granted > ldlm_dump_granted_max) {
1464 CDEBUG(level, "only dump %d granted locks to "
1465 "avoid DDOS.\n", granted);
1470 if (!list_empty(&res->lr_converting)) {
1471 CDEBUG(level, "Converting locks:\n");
1472 list_for_each_entry(lock, &res->lr_converting, l_res_link)
1473 LDLM_DEBUG_LIMIT(level, lock, "###");
1475 if (!list_empty(&res->lr_waiting)) {
1476 CDEBUG(level, "Waiting locks:\n");
1477 list_for_each_entry(lock, &res->lr_waiting, l_res_link)
1478 LDLM_DEBUG_LIMIT(level, lock, "###");
1481 EXPORT_SYMBOL(ldlm_resource_dump);