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, 2017, 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;
46 struct kmem_cache *ldlm_inodebits_slab;
48 int ldlm_srv_namespace_nr = 0;
49 int ldlm_cli_namespace_nr = 0;
51 DEFINE_MUTEX(ldlm_srv_namespace_lock);
52 LIST_HEAD(ldlm_srv_namespace_list);
54 DEFINE_MUTEX(ldlm_cli_namespace_lock);
55 /* Client Namespaces that have active resources in them.
56 * Once all resources go away, ldlm_poold moves such namespaces to the
58 LIST_HEAD(ldlm_cli_active_namespace_list);
59 /* Client namespaces that don't have any locks in them */
60 LIST_HEAD(ldlm_cli_inactive_namespace_list);
62 static struct dentry *ldlm_debugfs_dir;
63 static struct dentry *ldlm_ns_debugfs_dir;
64 struct dentry *ldlm_svc_debugfs_dir;
66 /* during debug dump certain amount of granted locks for one resource to avoid
68 static unsigned int ldlm_dump_granted_max = 256;
70 static ssize_t ldebugfs_dump_ns_seq_write(struct file *file,
71 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);
79 LDEBUGFS_FOPS_WR_ONLY(ldlm, dump_ns);
81 static int ldlm_rw_uint_seq_show(struct seq_file *m, void *v)
83 seq_printf(m, "%u\n", *(unsigned int *)m->private);
88 ldlm_rw_uint_seq_write(struct file *file, const char __user *buffer,
89 size_t count, loff_t *off)
91 struct seq_file *seq = file->private_data;
96 return kstrtouint_from_user(buffer, count, 0,
97 (unsigned int *)seq->private);
100 LDEBUGFS_SEQ_FOPS(ldlm_rw_uint);
102 #ifdef HAVE_SERVER_SUPPORT
104 static int seq_watermark_show(struct seq_file *m, void *data)
106 seq_printf(m, "%llu\n", *(__u64 *)m->private);
110 static ssize_t seq_watermark_write(struct file *file,
111 const char __user *buffer, size_t count,
116 __u64 *data = ((struct seq_file *)file->private_data)->private;
117 bool wm_low = (data == &ldlm_reclaim_threshold_mb) ? true : false;
120 rc = lprocfs_str_with_units_to_s64(buffer, count, &value, 'M');
122 CERROR("Failed to set %s, rc = %d.\n",
123 wm_low ? "lock_reclaim_threshold_mb" : "lock_limit_mb",
126 } else if (value != 0 && value < (1 << 20)) {
127 CERROR("%s should be greater than 1MB.\n",
128 wm_low ? "lock_reclaim_threshold_mb" : "lock_limit_mb");
131 watermark = value >> 20;
134 if (ldlm_lock_limit_mb != 0 && watermark > ldlm_lock_limit_mb) {
135 CERROR("lock_reclaim_threshold_mb must be smaller than "
141 if (watermark != 0) {
143 do_div(watermark, sizeof(struct ldlm_lock));
145 ldlm_reclaim_threshold = watermark;
147 if (ldlm_reclaim_threshold_mb != 0 &&
148 watermark < ldlm_reclaim_threshold_mb) {
149 CERROR("lock_limit_mb must be greater than "
150 "lock_reclaim_threshold_mb.\n");
155 if (watermark != 0) {
157 do_div(watermark, sizeof(struct ldlm_lock));
159 ldlm_lock_limit = watermark;
165 static int seq_watermark_open(struct inode *inode, struct file *file)
167 return single_open(file, seq_watermark_show, inode->i_private);
170 static const struct file_operations ldlm_watermark_fops = {
171 .owner = THIS_MODULE,
172 .open = seq_watermark_open,
174 .write = seq_watermark_write,
176 .release = lprocfs_single_release,
179 static int seq_granted_show(struct seq_file *m, void *data)
181 seq_printf(m, "%llu\n", percpu_counter_sum_positive(
182 (struct percpu_counter *)m->private));
186 static int seq_granted_open(struct inode *inode, struct file *file)
188 return single_open(file, seq_granted_show, inode->i_private);
191 static const struct file_operations ldlm_granted_fops = {
192 .owner = THIS_MODULE,
193 .open = seq_granted_open,
196 .release = seq_release,
199 #endif /* HAVE_SERVER_SUPPORT */
201 static struct lprocfs_vars ldlm_debugfs_list[] = {
202 { .name = "dump_namespaces",
203 .fops = &ldlm_dump_ns_fops,
205 { .name = "dump_granted_max",
206 .fops = &ldlm_rw_uint_fops,
207 .data = &ldlm_dump_granted_max },
208 #ifdef HAVE_SERVER_SUPPORT
209 { .name = "lock_reclaim_threshold_mb",
210 .fops = &ldlm_watermark_fops,
211 .data = &ldlm_reclaim_threshold_mb },
212 { .name = "lock_limit_mb",
213 .fops = &ldlm_watermark_fops,
214 .data = &ldlm_lock_limit_mb },
215 { .name = "lock_granted_count",
216 .fops = &ldlm_granted_fops,
217 .data = &ldlm_granted_total },
222 int ldlm_debugfs_setup(void)
227 ldlm_debugfs_dir = ldebugfs_register(OBD_LDLM_DEVICENAME,
230 if (IS_ERR_OR_NULL(ldlm_debugfs_dir)) {
231 CERROR("LDebugFS failed in ldlm-init\n");
232 rc = ldlm_debugfs_dir ? PTR_ERR(ldlm_debugfs_dir) : -ENOMEM;
236 ldlm_ns_debugfs_dir = ldebugfs_register("namespaces",
239 if (IS_ERR_OR_NULL(ldlm_ns_debugfs_dir)) {
240 CERROR("LProcFS failed in ldlm-init\n");
241 rc = ldlm_ns_debugfs_dir ? PTR_ERR(ldlm_ns_debugfs_dir)
246 ldlm_svc_debugfs_dir = ldebugfs_register("services",
249 if (IS_ERR_OR_NULL(ldlm_svc_debugfs_dir)) {
250 CERROR("LProcFS failed in ldlm-init\n");
251 rc = ldlm_svc_debugfs_dir ? PTR_ERR(ldlm_svc_debugfs_dir)
256 rc = ldebugfs_add_vars(ldlm_debugfs_dir, ldlm_debugfs_list, NULL);
258 CERROR("LProcFS failed in ldlm-init\n");
265 ldebugfs_remove(&ldlm_svc_debugfs_dir);
267 ldebugfs_remove(&ldlm_ns_debugfs_dir);
269 ldebugfs_remove(&ldlm_debugfs_dir);
271 ldlm_svc_debugfs_dir = NULL;
272 ldlm_ns_debugfs_dir = NULL;
273 ldlm_debugfs_dir = NULL;
277 void ldlm_debugfs_cleanup(void)
279 if (!IS_ERR_OR_NULL(ldlm_svc_debugfs_dir))
280 ldebugfs_remove(&ldlm_svc_debugfs_dir);
282 if (!IS_ERR_OR_NULL(ldlm_ns_debugfs_dir))
283 ldebugfs_remove(&ldlm_ns_debugfs_dir);
285 if (!IS_ERR_OR_NULL(ldlm_debugfs_dir))
286 ldebugfs_remove(&ldlm_debugfs_dir);
288 ldlm_svc_debugfs_dir = NULL;
289 ldlm_ns_debugfs_dir = NULL;
290 ldlm_debugfs_dir = NULL;
293 static ssize_t resource_count_show(struct kobject *kobj, struct attribute *attr,
296 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
299 struct cfs_hash_bd bd;
302 /* result is not strictly consistant */
303 cfs_hash_for_each_bucket(ns->ns_rs_hash, &bd, i)
304 res += cfs_hash_bd_count_get(&bd);
305 return sprintf(buf, "%lld\n", res);
307 LUSTRE_RO_ATTR(resource_count);
309 static ssize_t lock_count_show(struct kobject *kobj, struct attribute *attr,
312 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
316 locks = lprocfs_stats_collector(ns->ns_stats, LDLM_NSS_LOCKS,
317 LPROCFS_FIELDS_FLAGS_SUM);
318 return sprintf(buf, "%lld\n", locks);
320 LUSTRE_RO_ATTR(lock_count);
322 static ssize_t lock_unused_count_show(struct kobject *kobj,
323 struct attribute *attr,
326 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
329 return sprintf(buf, "%d\n", ns->ns_nr_unused);
331 LUSTRE_RO_ATTR(lock_unused_count);
333 static ssize_t lru_size_show(struct kobject *kobj, struct attribute *attr,
336 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
338 __u32 *nr = &ns->ns_max_unused;
340 if (ns_connect_lru_resize(ns))
341 nr = &ns->ns_nr_unused;
342 return sprintf(buf, "%u\n", *nr);
345 static ssize_t lru_size_store(struct kobject *kobj, struct attribute *attr,
346 const char *buffer, size_t count)
348 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
354 if (strncmp(buffer, "clear", 5) == 0) {
356 "dropping all unused locks from namespace %s\n",
358 if (ns_connect_lru_resize(ns)) {
359 /* Try to cancel all @ns_nr_unused locks. */
360 ldlm_cancel_lru(ns, ns->ns_nr_unused, 0,
361 LDLM_LRU_FLAG_PASSED |
362 LDLM_LRU_FLAG_CLEANUP);
364 tmp = ns->ns_max_unused;
365 ns->ns_max_unused = 0;
366 ldlm_cancel_lru(ns, 0, 0, LDLM_LRU_FLAG_PASSED |
367 LDLM_LRU_FLAG_CLEANUP);
368 ns->ns_max_unused = tmp;
373 err = kstrtoul(buffer, 10, &tmp);
375 CERROR("lru_size: invalid value written\n");
378 lru_resize = (tmp == 0);
380 if (ns_connect_lru_resize(ns)) {
382 ns->ns_max_unused = (unsigned int)tmp;
384 if (tmp > ns->ns_nr_unused)
385 tmp = ns->ns_nr_unused;
386 tmp = ns->ns_nr_unused - tmp;
389 "changing namespace %s unused locks from %u to %u\n",
390 ldlm_ns_name(ns), ns->ns_nr_unused,
392 ldlm_cancel_lru(ns, tmp, LCF_ASYNC, LDLM_LRU_FLAG_PASSED);
396 "disable lru_resize for namespace %s\n",
398 ns->ns_connect_flags &= ~OBD_CONNECT_LRU_RESIZE;
402 "changing namespace %s max_unused from %u to %u\n",
403 ldlm_ns_name(ns), ns->ns_max_unused,
405 ns->ns_max_unused = (unsigned int)tmp;
406 ldlm_cancel_lru(ns, 0, LCF_ASYNC, LDLM_LRU_FLAG_PASSED);
408 /* Make sure that LRU resize was originally supported before
409 * turning it on here.
412 (ns->ns_orig_connect_flags & OBD_CONNECT_LRU_RESIZE)) {
414 "enable lru_resize for namespace %s\n",
416 ns->ns_connect_flags |= OBD_CONNECT_LRU_RESIZE;
422 LUSTRE_RW_ATTR(lru_size);
424 static ssize_t lru_max_age_show(struct kobject *kobj, struct attribute *attr,
427 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
430 return sprintf(buf, "%lld\n", ktime_to_ms(ns->ns_max_age));
433 static ssize_t lru_max_age_store(struct kobject *kobj, struct attribute *attr,
434 const char *buffer, size_t count)
436 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
438 int scale = NSEC_PER_MSEC;
439 unsigned long long tmp;
442 /* Did the user ask in seconds or milliseconds. Default is in ms */
443 buf = strstr(buffer, "ms");
445 buf = strchr(buffer, 's');
447 scale = NSEC_PER_SEC;
453 if (kstrtoull(buffer, 10, &tmp))
456 ns->ns_max_age = ktime_set(0, tmp * scale);
460 LUSTRE_RW_ATTR(lru_max_age);
462 static ssize_t early_lock_cancel_show(struct kobject *kobj,
463 struct attribute *attr,
466 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
469 return sprintf(buf, "%d\n", ns_connect_cancelset(ns));
472 static ssize_t early_lock_cancel_store(struct kobject *kobj,
473 struct attribute *attr,
477 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
479 unsigned long supp = -1;
482 rc = kstrtoul(buffer, 10, &supp);
487 ns->ns_connect_flags &= ~OBD_CONNECT_CANCELSET;
488 else if (ns->ns_orig_connect_flags & OBD_CONNECT_CANCELSET)
489 ns->ns_connect_flags |= OBD_CONNECT_CANCELSET;
492 LUSTRE_RW_ATTR(early_lock_cancel);
494 static ssize_t dirty_age_limit_show(struct kobject *kobj,
495 struct attribute *attr, char *buf)
497 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
500 return sprintf(buf, "%llu\n", ns->ns_dirty_age_limit);
503 static ssize_t dirty_age_limit_store(struct kobject *kobj,
504 struct attribute *attr,
505 const char *buffer, size_t count)
507 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
509 unsigned long long tmp;
511 if (kstrtoull(buffer, 10, &tmp))
514 ns->ns_dirty_age_limit = tmp;
518 LUSTRE_RW_ATTR(dirty_age_limit);
520 #ifdef HAVE_SERVER_SUPPORT
521 static ssize_t ctime_age_limit_show(struct kobject *kobj,
522 struct attribute *attr, char *buf)
524 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
527 return sprintf(buf, "%llu\n", ns->ns_ctime_age_limit);
530 static ssize_t ctime_age_limit_store(struct kobject *kobj,
531 struct attribute *attr,
532 const char *buffer, size_t count)
534 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
536 unsigned long long tmp;
538 if (kstrtoull(buffer, 10, &tmp))
541 ns->ns_ctime_age_limit = tmp;
545 LUSTRE_RW_ATTR(ctime_age_limit);
547 static ssize_t lock_timeouts_show(struct kobject *kobj, struct attribute *attr,
550 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
553 return sprintf(buf, "%d\n", ns->ns_timeouts);
555 LUSTRE_RO_ATTR(lock_timeouts);
557 static ssize_t max_nolock_bytes_show(struct kobject *kobj,
558 struct attribute *attr, char *buf)
560 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
563 return sprintf(buf, "%u\n", ns->ns_max_nolock_size);
566 static ssize_t max_nolock_bytes_store(struct kobject *kobj,
567 struct attribute *attr,
568 const char *buffer, size_t count)
570 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
575 err = kstrtoul(buffer, 10, &tmp);
579 ns->ns_max_nolock_size = tmp;
583 LUSTRE_RW_ATTR(max_nolock_bytes);
585 static ssize_t contention_seconds_show(struct kobject *kobj,
586 struct attribute *attr, char *buf)
588 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
591 return sprintf(buf, "%llu\n", ns->ns_contention_time);
594 static ssize_t contention_seconds_store(struct kobject *kobj,
595 struct attribute *attr,
596 const char *buffer, size_t count)
598 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
600 unsigned long long tmp;
602 if (kstrtoull(buffer, 10, &tmp))
605 ns->ns_contention_time = tmp;
609 LUSTRE_RW_ATTR(contention_seconds);
611 static ssize_t contended_locks_show(struct kobject *kobj,
612 struct attribute *attr, char *buf)
614 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
617 return sprintf(buf, "%u\n", ns->ns_contended_locks);
620 static ssize_t contended_locks_store(struct kobject *kobj,
621 struct attribute *attr,
622 const char *buffer, size_t count)
624 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
629 err = kstrtoul(buffer, 10, &tmp);
633 ns->ns_contended_locks = tmp;
637 LUSTRE_RW_ATTR(contended_locks);
639 static ssize_t max_parallel_ast_show(struct kobject *kobj,
640 struct attribute *attr, char *buf)
642 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
645 return sprintf(buf, "%u\n", ns->ns_max_parallel_ast);
648 static ssize_t max_parallel_ast_store(struct kobject *kobj,
649 struct attribute *attr,
650 const char *buffer, size_t count)
652 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
657 err = kstrtoul(buffer, 10, &tmp);
661 ns->ns_max_parallel_ast = tmp;
665 LUSTRE_RW_ATTR(max_parallel_ast);
667 #endif /* HAVE_SERVER_SUPPORT */
669 /* These are for namespaces in /sys/fs/lustre/ldlm/namespaces/ */
670 static struct attribute *ldlm_ns_attrs[] = {
671 &lustre_attr_resource_count.attr,
672 &lustre_attr_lock_count.attr,
673 &lustre_attr_lock_unused_count.attr,
674 &lustre_attr_lru_size.attr,
675 &lustre_attr_lru_max_age.attr,
676 &lustre_attr_early_lock_cancel.attr,
677 &lustre_attr_dirty_age_limit.attr,
678 #ifdef HAVE_SERVER_SUPPORT
679 &lustre_attr_ctime_age_limit.attr,
680 &lustre_attr_lock_timeouts.attr,
681 &lustre_attr_max_nolock_bytes.attr,
682 &lustre_attr_contention_seconds.attr,
683 &lustre_attr_contended_locks.attr,
684 &lustre_attr_max_parallel_ast.attr,
689 static void ldlm_ns_release(struct kobject *kobj)
691 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
693 complete(&ns->ns_kobj_unregister);
696 static struct kobj_type ldlm_ns_ktype = {
697 .default_attrs = ldlm_ns_attrs,
698 .sysfs_ops = &lustre_sysfs_ops,
699 .release = ldlm_ns_release,
702 static void ldlm_namespace_debugfs_unregister(struct ldlm_namespace *ns)
704 if (IS_ERR_OR_NULL(ns->ns_debugfs_entry))
705 CERROR("dlm namespace %s has no procfs dir?\n",
708 ldebugfs_remove(&ns->ns_debugfs_entry);
710 if (ns->ns_stats != NULL)
711 lprocfs_free_stats(&ns->ns_stats);
714 void ldlm_namespace_sysfs_unregister(struct ldlm_namespace *ns)
716 kobject_put(&ns->ns_kobj);
717 wait_for_completion(&ns->ns_kobj_unregister);
720 int ldlm_namespace_sysfs_register(struct ldlm_namespace *ns)
724 ns->ns_kobj.kset = ldlm_ns_kset;
725 init_completion(&ns->ns_kobj_unregister);
726 err = kobject_init_and_add(&ns->ns_kobj, &ldlm_ns_ktype, NULL,
727 "%s", ldlm_ns_name(ns));
729 ns->ns_stats = lprocfs_alloc_stats(LDLM_NSS_LAST, 0);
731 kobject_put(&ns->ns_kobj);
735 lprocfs_counter_init(ns->ns_stats, LDLM_NSS_LOCKS,
736 LPROCFS_CNTR_AVGMINMAX, "locks", "locks");
741 static int ldlm_namespace_debugfs_register(struct ldlm_namespace *ns)
743 struct dentry *ns_entry;
745 if (!IS_ERR_OR_NULL(ns->ns_debugfs_entry)) {
746 ns_entry = ns->ns_debugfs_entry;
748 ns_entry = debugfs_create_dir(ldlm_ns_name(ns),
749 ldlm_ns_debugfs_dir);
752 ns->ns_debugfs_entry = ns_entry;
757 #undef MAX_STRING_SIZE
759 static unsigned ldlm_res_hop_hash(struct cfs_hash *hs,
760 const void *key, unsigned int mask)
762 const struct ldlm_res_id *id = key;
763 unsigned int val = 0;
766 for (i = 0; i < RES_NAME_SIZE; i++)
771 static unsigned int ldlm_res_hop_fid_hash(const struct ldlm_res_id *id, unsigned int bits)
777 fid.f_seq = id->name[LUSTRE_RES_ID_SEQ_OFF];
778 fid.f_oid = (__u32)id->name[LUSTRE_RES_ID_VER_OID_OFF];
779 fid.f_ver = (__u32)(id->name[LUSTRE_RES_ID_VER_OID_OFF] >> 32);
781 hash = fid_flatten32(&fid);
782 hash += (hash >> 4) + (hash << 12); /* mixing oid and seq */
783 if (id->name[LUSTRE_RES_ID_HSH_OFF] != 0) {
784 val = id->name[LUSTRE_RES_ID_HSH_OFF];
788 hash += (val >> 5) + (val << 11);
789 return cfs_hash_32(hash, bits);
792 static void *ldlm_res_hop_key(struct hlist_node *hnode)
794 struct ldlm_resource *res;
796 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
797 return &res->lr_name;
800 static int ldlm_res_hop_keycmp(const void *key, struct hlist_node *hnode)
802 struct ldlm_resource *res;
804 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
805 return ldlm_res_eq((const struct ldlm_res_id *)key,
806 (const struct ldlm_res_id *)&res->lr_name);
809 static void *ldlm_res_hop_object(struct hlist_node *hnode)
811 return hlist_entry(hnode, struct ldlm_resource, lr_hash);
815 ldlm_res_hop_get_locked(struct cfs_hash *hs, struct hlist_node *hnode)
817 struct ldlm_resource *res;
819 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
820 ldlm_resource_getref(res);
823 static void ldlm_res_hop_put(struct cfs_hash *hs, struct hlist_node *hnode)
825 struct ldlm_resource *res;
827 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
828 ldlm_resource_putref(res);
831 static struct cfs_hash_ops ldlm_ns_hash_ops = {
832 .hs_hash = ldlm_res_hop_hash,
833 .hs_key = ldlm_res_hop_key,
834 .hs_keycmp = ldlm_res_hop_keycmp,
836 .hs_object = ldlm_res_hop_object,
837 .hs_get = ldlm_res_hop_get_locked,
838 .hs_put = ldlm_res_hop_put
841 typedef struct ldlm_ns_hash_def {
842 enum ldlm_ns_type nsd_type;
843 /** hash bucket bits */
844 unsigned nsd_bkt_bits;
846 unsigned nsd_all_bits;
847 /** hash operations */
848 struct cfs_hash_ops *nsd_hops;
849 } ldlm_ns_hash_def_t;
851 static struct ldlm_ns_hash_def ldlm_ns_hash_defs[] =
854 .nsd_type = LDLM_NS_TYPE_MDC,
857 .nsd_hops = &ldlm_ns_hash_ops,
860 .nsd_type = LDLM_NS_TYPE_MDT,
863 .nsd_hops = &ldlm_ns_hash_ops,
866 .nsd_type = LDLM_NS_TYPE_OSC,
869 .nsd_hops = &ldlm_ns_hash_ops,
872 .nsd_type = LDLM_NS_TYPE_OST,
875 .nsd_hops = &ldlm_ns_hash_ops,
878 .nsd_type = LDLM_NS_TYPE_MGC,
881 .nsd_hops = &ldlm_ns_hash_ops,
884 .nsd_type = LDLM_NS_TYPE_MGT,
887 .nsd_hops = &ldlm_ns_hash_ops,
890 .nsd_type = LDLM_NS_TYPE_UNKNOWN,
895 * Create and initialize new empty namespace.
897 struct ldlm_namespace *ldlm_namespace_new(struct obd_device *obd, char *name,
898 enum ldlm_side client,
899 enum ldlm_appetite apt,
900 enum ldlm_ns_type ns_type)
902 struct ldlm_namespace *ns = NULL;
903 struct ldlm_ns_hash_def *nsd;
908 LASSERT(obd != NULL);
912 CERROR("ldlm_get_ref failed: %d\n", rc);
916 for (idx = 0; ; idx++) {
917 nsd = &ldlm_ns_hash_defs[idx];
918 if (nsd->nsd_type == LDLM_NS_TYPE_UNKNOWN) {
919 CERROR("Unknown type %d for ns %s\n", ns_type, name);
923 if (nsd->nsd_type == ns_type)
931 ns->ns_rs_hash = cfs_hash_create(name,
932 nsd->nsd_all_bits, nsd->nsd_all_bits,
933 nsd->nsd_bkt_bits, 0,
939 CFS_HASH_SPIN_BKTLOCK |
940 CFS_HASH_NO_ITEMREF);
941 if (ns->ns_rs_hash == NULL)
944 ns->ns_bucket_bits = nsd->nsd_all_bits - nsd->nsd_bkt_bits;
945 OBD_ALLOC_LARGE(ns->ns_rs_buckets,
946 BIT(ns->ns_bucket_bits) * sizeof(ns->ns_rs_buckets[0]));
947 if (!ns->ns_rs_buckets)
950 for (idx = 0; idx < (1 << ns->ns_bucket_bits); idx++) {
951 struct ldlm_ns_bucket *nsb = &ns->ns_rs_buckets[idx];
953 at_init(&nsb->nsb_at_estimate, ldlm_enqueue_min, 0);
954 nsb->nsb_namespace = ns;
955 nsb->nsb_reclaim_start = 0;
959 ns->ns_appetite = apt;
960 ns->ns_client = client;
961 ns->ns_name = kstrdup(name, GFP_KERNEL);
965 INIT_LIST_HEAD(&ns->ns_list_chain);
966 INIT_LIST_HEAD(&ns->ns_unused_list);
967 spin_lock_init(&ns->ns_lock);
968 atomic_set(&ns->ns_bref, 0);
969 init_waitqueue_head(&ns->ns_waitq);
971 ns->ns_max_nolock_size = NS_DEFAULT_MAX_NOLOCK_BYTES;
972 ns->ns_contention_time = NS_DEFAULT_CONTENTION_SECONDS;
973 ns->ns_contended_locks = NS_DEFAULT_CONTENDED_LOCKS;
975 ns->ns_max_parallel_ast = LDLM_DEFAULT_PARALLEL_AST_LIMIT;
976 ns->ns_nr_unused = 0;
977 ns->ns_max_unused = LDLM_DEFAULT_LRU_SIZE;
978 ns->ns_max_age = ktime_set(LDLM_DEFAULT_MAX_ALIVE, 0);
979 ns->ns_ctime_age_limit = LDLM_CTIME_AGE_LIMIT;
980 ns->ns_dirty_age_limit = LDLM_DIRTY_AGE_LIMIT;
982 ns->ns_orig_connect_flags = 0;
983 ns->ns_connect_flags = 0;
985 ns->ns_reclaim_start = 0;
986 ns->ns_last_pos = &ns->ns_unused_list;
988 rc = ldlm_namespace_sysfs_register(ns);
990 CERROR("Can't initialize ns sysfs, rc %d\n", rc);
994 rc = ldlm_namespace_debugfs_register(ns);
996 CERROR("Can't initialize ns proc, rc %d\n", rc);
1000 idx = ldlm_namespace_nr_read(client);
1001 rc = ldlm_pool_init(&ns->ns_pool, ns, idx, client);
1003 CERROR("Can't initialize lock pool, rc %d\n", rc);
1007 ldlm_namespace_register(ns, client);
1010 ldlm_namespace_debugfs_unregister(ns);
1012 ldlm_namespace_sysfs_unregister(ns);
1013 ldlm_namespace_cleanup(ns, 0);
1015 OBD_FREE_LARGE(ns->ns_rs_buckets,
1016 BIT(ns->ns_bucket_bits) * sizeof(ns->ns_rs_buckets[0]));
1018 cfs_hash_putref(ns->ns_rs_hash);
1025 EXPORT_SYMBOL(ldlm_namespace_new);
1028 * Cancel and destroy all locks on a resource.
1030 * If flags contains FL_LOCAL_ONLY, don't try to tell the server, just
1031 * clean up. This is currently only used for recovery, and we make
1032 * certain assumptions as a result--notably, that we shouldn't cancel
1035 static void cleanup_resource(struct ldlm_resource *res, struct list_head *q,
1038 struct list_head *tmp;
1039 int rc = 0, client = ns_is_client(ldlm_res_to_ns(res));
1040 bool local_only = !!(flags & LDLM_FL_LOCAL_ONLY);
1043 struct ldlm_lock *lock = NULL;
1045 /* First, we look for non-cleaned-yet lock
1046 * all cleaned locks are marked by CLEANED flag. */
1048 list_for_each(tmp, q) {
1049 lock = list_entry(tmp, struct ldlm_lock,
1051 if (ldlm_is_cleaned(lock)) {
1055 LDLM_LOCK_GET(lock);
1056 ldlm_set_cleaned(lock);
1065 /* Set CBPENDING so nothing in the cancellation path
1066 * can match this lock. */
1067 ldlm_set_cbpending(lock);
1068 ldlm_set_failed(lock);
1069 lock->l_flags |= flags;
1071 /* ... without sending a CANCEL message for local_only. */
1073 ldlm_set_local_only(lock);
1075 if (local_only && (lock->l_readers || lock->l_writers)) {
1077 * This is a little bit gross, but much better than the
1078 * alternative: pretend that we got a blocking AST from
1079 * the server, so that when the lock is decref'd, it
1083 LDLM_DEBUG(lock, "setting FL_LOCAL_ONLY");
1084 if (lock->l_flags & LDLM_FL_FAIL_LOC) {
1085 set_current_state(TASK_UNINTERRUPTIBLE);
1086 schedule_timeout(cfs_time_seconds(4));
1087 set_current_state(TASK_RUNNING);
1089 if (lock->l_completion_ast)
1090 lock->l_completion_ast(lock,
1091 LDLM_FL_FAILED, NULL);
1092 LDLM_LOCK_RELEASE(lock);
1097 struct lustre_handle lockh;
1100 ldlm_lock2handle(lock, &lockh);
1101 rc = ldlm_cli_cancel(&lockh, LCF_LOCAL);
1103 CERROR("ldlm_cli_cancel: %d\n", rc);
1107 "Freeing a lock still held by a client node");
1108 ldlm_lock_cancel(lock);
1110 LDLM_LOCK_RELEASE(lock);
1114 static int ldlm_resource_clean(struct cfs_hash *hs, struct cfs_hash_bd *bd,
1115 struct hlist_node *hnode, void *arg)
1117 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
1118 __u64 flags = *(__u64 *)arg;
1120 cleanup_resource(res, &res->lr_granted, flags);
1121 cleanup_resource(res, &res->lr_waiting, flags);
1126 static int ldlm_resource_complain(struct cfs_hash *hs, struct cfs_hash_bd *bd,
1127 struct hlist_node *hnode, void *arg)
1129 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
1132 CERROR("%s: namespace resource "DLDLMRES" (%p) refcount nonzero "
1133 "(%d) after lock cleanup; forcing cleanup.\n",
1134 ldlm_ns_name(ldlm_res_to_ns(res)), PLDLMRES(res), res,
1135 atomic_read(&res->lr_refcount) - 1);
1137 /* Use D_NETERROR since it is in the default mask */
1138 ldlm_resource_dump(D_NETERROR, res);
1144 * Cancel and destroy all locks in the namespace.
1146 * Typically used during evictions when server notified client that it was
1147 * evicted and all of its state needs to be destroyed.
1148 * Also used during shutdown.
1150 int ldlm_namespace_cleanup(struct ldlm_namespace *ns, __u64 flags)
1153 CDEBUG(D_INFO, "NULL ns, skipping cleanup\n");
1157 cfs_hash_for_each_nolock(ns->ns_rs_hash, ldlm_resource_clean,
1159 cfs_hash_for_each_nolock(ns->ns_rs_hash, ldlm_resource_complain,
1163 EXPORT_SYMBOL(ldlm_namespace_cleanup);
1166 * Attempts to free namespace.
1168 * Only used when namespace goes away, like during an unmount.
1170 static int __ldlm_namespace_free(struct ldlm_namespace *ns, int force)
1174 /* At shutdown time, don't call the cancellation callback */
1175 ldlm_namespace_cleanup(ns, force ? LDLM_FL_LOCAL_ONLY : 0);
1177 if (atomic_read(&ns->ns_bref) > 0) {
1180 "dlm namespace %s free waiting on refcount %d\n",
1181 ldlm_ns_name(ns), atomic_read(&ns->ns_bref));
1184 rc = wait_event_idle_timeout(
1186 atomic_read(&ns->ns_bref) == 0,
1187 cfs_time_seconds(1) / 4);
1189 rc = l_wait_event_abortable(
1190 ns->ns_waitq, atomic_read(&ns->ns_bref) == 0);
1192 /* Forced cleanups should be able to reclaim all references,
1193 * so it's safe to wait forever... we can't leak locks... */
1194 if (force && rc == 0) {
1196 LCONSOLE_ERROR("Forced cleanup waiting for %s "
1197 "namespace with %d resources in use, "
1198 "(rc=%d)\n", ldlm_ns_name(ns),
1199 atomic_read(&ns->ns_bref), rc);
1200 GOTO(force_wait, rc);
1203 if (atomic_read(&ns->ns_bref)) {
1204 LCONSOLE_ERROR("Cleanup waiting for %s namespace "
1205 "with %d resources in use, (rc=%d)\n",
1207 atomic_read(&ns->ns_bref), rc);
1208 RETURN(ELDLM_NAMESPACE_EXISTS);
1210 CDEBUG(D_DLMTRACE, "dlm namespace %s free done waiting\n",
1218 * Performs various cleanups for passed \a ns to make it drop refc and be
1219 * ready for freeing. Waits for refc == 0.
1221 * The following is done:
1222 * (0) Unregister \a ns from its list to make inaccessible for potential
1223 * users like pools thread and others;
1224 * (1) Clear all locks in \a ns.
1226 void ldlm_namespace_free_prior(struct ldlm_namespace *ns,
1227 struct obd_import *imp,
1238 spin_lock(&ns->ns_lock);
1239 ns->ns_stopping = 1;
1240 spin_unlock(&ns->ns_lock);
1243 * Can fail with -EINTR when force == 0 in which case try harder.
1245 rc = __ldlm_namespace_free(ns, force);
1246 if (rc != ELDLM_OK) {
1248 ptlrpc_disconnect_import(imp, 0);
1249 ptlrpc_invalidate_import(imp);
1253 * With all requests dropped and the import inactive
1254 * we are gaurenteed all reference will be dropped.
1256 rc = __ldlm_namespace_free(ns, 1);
1261 EXPORT_SYMBOL(ldlm_namespace_free_prior);
1264 * Performs freeing memory structures related to \a ns. This is only done
1265 * when ldlm_namespce_free_prior() successfully removed all resources
1266 * referencing \a ns and its refc == 0.
1268 void ldlm_namespace_free_post(struct ldlm_namespace *ns)
1276 /* Make sure that nobody can find this ns in its list. */
1277 ldlm_namespace_unregister(ns, ns->ns_client);
1278 /* Fini pool _before_ parent proc dir is removed. This is important as
1279 * ldlm_pool_fini() removes own proc dir which is child to @dir.
1280 * Removing it after @dir may cause oops. */
1281 ldlm_pool_fini(&ns->ns_pool);
1283 ldlm_namespace_debugfs_unregister(ns);
1284 ldlm_namespace_sysfs_unregister(ns);
1285 cfs_hash_putref(ns->ns_rs_hash);
1286 OBD_FREE_LARGE(ns->ns_rs_buckets,
1287 BIT(ns->ns_bucket_bits) * sizeof(ns->ns_rs_buckets[0]));
1289 /* Namespace \a ns should be not on list at this time, otherwise
1290 * this will cause issues related to using freed \a ns in poold
1293 LASSERT(list_empty(&ns->ns_list_chain));
1298 EXPORT_SYMBOL(ldlm_namespace_free_post);
1301 * Cleanup the resource, and free namespace.
1304 * proc1: destroy import
1305 * class_disconnect_export(grab cl_sem) ->
1306 * -> ldlm_namespace_free ->
1307 * -> lprocfs_remove(grab _lprocfs_lock).
1308 * proc2: read proc info
1309 * lprocfs_fops_read(grab _lprocfs_lock) ->
1310 * -> osc_rd_active, etc(grab cl_sem).
1312 * So that I have to split the ldlm_namespace_free into two parts - the first
1313 * part ldlm_namespace_free_prior is used to cleanup the resource which is
1314 * being used; the 2nd part ldlm_namespace_free_post is used to unregister the
1315 * lprocfs entries, and then free memory. It will be called w/o cli->cl_sem
1318 void ldlm_namespace_free(struct ldlm_namespace *ns,
1319 struct obd_import *imp,
1322 ldlm_namespace_free_prior(ns, imp, force);
1323 ldlm_namespace_free_post(ns);
1325 EXPORT_SYMBOL(ldlm_namespace_free);
1327 void ldlm_namespace_get(struct ldlm_namespace *ns)
1329 atomic_inc(&ns->ns_bref);
1332 /* This is only for callers that care about refcount */
1333 static int ldlm_namespace_get_return(struct ldlm_namespace *ns)
1335 return atomic_inc_return(&ns->ns_bref);
1338 void ldlm_namespace_put(struct ldlm_namespace *ns)
1340 if (atomic_dec_and_lock(&ns->ns_bref, &ns->ns_lock)) {
1341 wake_up(&ns->ns_waitq);
1342 spin_unlock(&ns->ns_lock);
1346 /** Register \a ns in the list of namespaces */
1347 void ldlm_namespace_register(struct ldlm_namespace *ns, enum ldlm_side client)
1349 mutex_lock(ldlm_namespace_lock(client));
1350 LASSERT(list_empty(&ns->ns_list_chain));
1351 list_add(&ns->ns_list_chain, ldlm_namespace_inactive_list(client));
1352 ldlm_namespace_nr_inc(client);
1353 mutex_unlock(ldlm_namespace_lock(client));
1356 /** Unregister \a ns from the list of namespaces. */
1357 void ldlm_namespace_unregister(struct ldlm_namespace *ns, enum ldlm_side client)
1359 mutex_lock(ldlm_namespace_lock(client));
1360 LASSERT(!list_empty(&ns->ns_list_chain));
1361 /* Some asserts and possibly other parts of the code are still
1362 * using list_empty(&ns->ns_list_chain). This is why it is
1363 * important to use list_del_init() here. */
1364 list_del_init(&ns->ns_list_chain);
1365 ldlm_namespace_nr_dec(client);
1366 mutex_unlock(ldlm_namespace_lock(client));
1369 /** Should be called with ldlm_namespace_lock(client) taken. */
1370 void ldlm_namespace_move_to_active_locked(struct ldlm_namespace *ns,
1371 enum ldlm_side client)
1373 LASSERT(!list_empty(&ns->ns_list_chain));
1374 LASSERT(mutex_is_locked(ldlm_namespace_lock(client)));
1375 list_move_tail(&ns->ns_list_chain, ldlm_namespace_list(client));
1378 /** Should be called with ldlm_namespace_lock(client) taken. */
1379 void ldlm_namespace_move_to_inactive_locked(struct ldlm_namespace *ns,
1380 enum ldlm_side client)
1382 LASSERT(!list_empty(&ns->ns_list_chain));
1383 LASSERT(mutex_is_locked(ldlm_namespace_lock(client)));
1384 list_move_tail(&ns->ns_list_chain,
1385 ldlm_namespace_inactive_list(client));
1388 /** Should be called with ldlm_namespace_lock(client) taken. */
1389 struct ldlm_namespace *ldlm_namespace_first_locked(enum ldlm_side client)
1391 LASSERT(mutex_is_locked(ldlm_namespace_lock(client)));
1392 LASSERT(!list_empty(ldlm_namespace_list(client)));
1393 return container_of(ldlm_namespace_list(client)->next,
1394 struct ldlm_namespace, ns_list_chain);
1397 static bool ldlm_resource_extent_new(struct ldlm_resource *res)
1401 OBD_SLAB_ALLOC(res->lr_itree, ldlm_interval_tree_slab,
1402 sizeof(*res->lr_itree) * LCK_MODE_NUM);
1403 if (res->lr_itree == NULL)
1405 /* Initialize interval trees for each lock mode. */
1406 for (idx = 0; idx < LCK_MODE_NUM; idx++) {
1407 res->lr_itree[idx].lit_size = 0;
1408 res->lr_itree[idx].lit_mode = 1 << idx;
1409 res->lr_itree[idx].lit_root = NULL;
1414 static bool ldlm_resource_inodebits_new(struct ldlm_resource *res)
1418 OBD_ALLOC_PTR(res->lr_ibits_queues);
1419 if (res->lr_ibits_queues == NULL)
1421 for (i = 0; i < MDS_INODELOCK_NUMBITS; i++)
1422 INIT_LIST_HEAD(&res->lr_ibits_queues->liq_waiting[i]);
1426 /** Create and initialize new resource. */
1427 static struct ldlm_resource *ldlm_resource_new(enum ldlm_type ldlm_type)
1429 struct ldlm_resource *res;
1432 OBD_SLAB_ALLOC_PTR_GFP(res, ldlm_resource_slab, GFP_NOFS);
1436 switch (ldlm_type) {
1438 rc = ldlm_resource_extent_new(res);
1441 rc = ldlm_resource_inodebits_new(res);
1448 OBD_SLAB_FREE_PTR(res, ldlm_resource_slab);
1452 INIT_LIST_HEAD(&res->lr_granted);
1453 INIT_LIST_HEAD(&res->lr_waiting);
1455 atomic_set(&res->lr_refcount, 1);
1456 spin_lock_init(&res->lr_lock);
1457 lu_ref_init(&res->lr_reference);
1459 /* Since LVB init can be delayed now, there is no longer need to
1460 * immediatelly acquire mutex here. */
1461 mutex_init(&res->lr_lvb_mutex);
1462 res->lr_lvb_initialized = false;
1467 static void ldlm_resource_free(struct ldlm_resource *res)
1469 if (res->lr_type == LDLM_EXTENT) {
1470 if (res->lr_itree != NULL)
1471 OBD_SLAB_FREE(res->lr_itree, ldlm_interval_tree_slab,
1472 sizeof(*res->lr_itree) * LCK_MODE_NUM);
1473 } else if (res->lr_type == LDLM_IBITS) {
1474 if (res->lr_ibits_queues != NULL)
1475 OBD_FREE_PTR(res->lr_ibits_queues);
1478 OBD_SLAB_FREE(res, ldlm_resource_slab, sizeof *res);
1482 * Return a reference to resource with given name, creating it if necessary.
1483 * Args: namespace with ns_lock unlocked
1484 * Locks: takes and releases NS hash-lock and res->lr_lock
1485 * Returns: referenced, unlocked ldlm_resource or NULL
1487 struct ldlm_resource *
1488 ldlm_resource_get(struct ldlm_namespace *ns, struct ldlm_resource *parent,
1489 const struct ldlm_res_id *name, enum ldlm_type type,
1492 struct hlist_node *hnode;
1493 struct ldlm_resource *res = NULL;
1494 struct cfs_hash_bd bd;
1496 int ns_refcount = 0;
1499 LASSERT(ns != NULL);
1500 LASSERT(parent == NULL);
1501 LASSERT(ns->ns_rs_hash != NULL);
1502 LASSERT(name->name[0] != 0);
1504 cfs_hash_bd_get_and_lock(ns->ns_rs_hash, (void *)name, &bd, 0);
1505 hnode = cfs_hash_bd_lookup_locked(ns->ns_rs_hash, &bd, (void *)name);
1506 if (hnode != NULL) {
1507 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 0);
1511 version = cfs_hash_bd_version_get(&bd);
1512 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 0);
1515 return ERR_PTR(-ENOENT);
1517 LASSERTF(type >= LDLM_MIN_TYPE && type < LDLM_MAX_TYPE,
1518 "type: %d\n", type);
1519 res = ldlm_resource_new(type);
1521 return ERR_PTR(-ENOMEM);
1523 hash = ldlm_res_hop_fid_hash(name, ns->ns_bucket_bits);
1524 res->lr_ns_bucket = &ns->ns_rs_buckets[hash];
1525 res->lr_name = *name;
1526 res->lr_type = type;
1528 cfs_hash_bd_lock(ns->ns_rs_hash, &bd, 1);
1529 hnode = (version == cfs_hash_bd_version_get(&bd)) ? NULL :
1530 cfs_hash_bd_lookup_locked(ns->ns_rs_hash, &bd, (void *)name);
1532 if (hnode != NULL) {
1533 /* Someone won the race and already added the resource. */
1534 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
1535 /* Clean lu_ref for failed resource. */
1536 lu_ref_fini(&res->lr_reference);
1537 ldlm_resource_free(res);
1539 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
1542 /* We won! Let's add the resource. */
1543 cfs_hash_bd_add_locked(ns->ns_rs_hash, &bd, &res->lr_hash);
1544 if (cfs_hash_bd_count_get(&bd) == 1)
1545 ns_refcount = ldlm_namespace_get_return(ns);
1547 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
1549 OBD_FAIL_TIMEOUT(OBD_FAIL_LDLM_CREATE_RESOURCE, 2);
1551 /* Let's see if we happened to be the very first resource in this
1552 * namespace. If so, and this is a client namespace, we need to move
1553 * the namespace into the active namespaces list to be patrolled by
1554 * the ldlm_poold. */
1555 if (ns_is_client(ns) && ns_refcount == 1) {
1556 mutex_lock(ldlm_namespace_lock(LDLM_NAMESPACE_CLIENT));
1557 ldlm_namespace_move_to_active_locked(ns, LDLM_NAMESPACE_CLIENT);
1558 mutex_unlock(ldlm_namespace_lock(LDLM_NAMESPACE_CLIENT));
1563 EXPORT_SYMBOL(ldlm_resource_get);
1565 struct ldlm_resource *ldlm_resource_getref(struct ldlm_resource *res)
1567 LASSERT(res != NULL);
1568 LASSERT(res != LP_POISON);
1569 atomic_inc(&res->lr_refcount);
1570 CDEBUG(D_INFO, "getref res: %p count: %d\n", res,
1571 atomic_read(&res->lr_refcount));
1575 static void __ldlm_resource_putref_final(struct cfs_hash_bd *bd,
1576 struct ldlm_resource *res)
1578 struct ldlm_ns_bucket *nsb = res->lr_ns_bucket;
1580 if (!list_empty(&res->lr_granted)) {
1581 ldlm_resource_dump(D_ERROR, res);
1585 if (!list_empty(&res->lr_waiting)) {
1586 ldlm_resource_dump(D_ERROR, res);
1590 cfs_hash_bd_del_locked(nsb->nsb_namespace->ns_rs_hash,
1592 lu_ref_fini(&res->lr_reference);
1593 if (cfs_hash_bd_count_get(bd) == 0)
1594 ldlm_namespace_put(nsb->nsb_namespace);
1597 /* Returns 1 if the resource was freed, 0 if it remains. */
1598 int ldlm_resource_putref(struct ldlm_resource *res)
1600 struct ldlm_namespace *ns = ldlm_res_to_ns(res);
1601 struct cfs_hash_bd bd;
1603 LASSERT_ATOMIC_GT_LT(&res->lr_refcount, 0, LI_POISON);
1604 CDEBUG(D_INFO, "putref res: %p count: %d\n",
1605 res, atomic_read(&res->lr_refcount) - 1);
1607 cfs_hash_bd_get(ns->ns_rs_hash, &res->lr_name, &bd);
1608 if (cfs_hash_bd_dec_and_lock(ns->ns_rs_hash, &bd, &res->lr_refcount)) {
1609 __ldlm_resource_putref_final(&bd, res);
1610 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
1611 if (ns->ns_lvbo && ns->ns_lvbo->lvbo_free)
1612 ns->ns_lvbo->lvbo_free(res);
1613 ldlm_resource_free(res);
1618 EXPORT_SYMBOL(ldlm_resource_putref);
1621 * Add a lock into a given resource into specified lock list.
1623 void ldlm_resource_add_lock(struct ldlm_resource *res, struct list_head *head,
1624 struct ldlm_lock *lock)
1626 check_res_locked(res);
1628 LDLM_DEBUG(lock, "About to add this lock");
1630 if (ldlm_is_destroyed(lock)) {
1631 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
1635 LASSERT(list_empty(&lock->l_res_link));
1637 list_add_tail(&lock->l_res_link, head);
1639 if (res->lr_type == LDLM_IBITS)
1640 ldlm_inodebits_add_lock(res, head, lock);
1644 * Insert a lock into resource after specified lock.
1646 * Obtain resource description from the lock we are inserting after.
1648 void ldlm_resource_insert_lock_after(struct ldlm_lock *original,
1649 struct ldlm_lock *new)
1651 struct ldlm_resource *res = original->l_resource;
1653 check_res_locked(res);
1655 ldlm_resource_dump(D_INFO, res);
1656 LDLM_DEBUG(new, "About to insert this lock after %p: ", original);
1658 if (ldlm_is_destroyed(new)) {
1659 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
1663 LASSERT(list_empty(&new->l_res_link));
1665 list_add(&new->l_res_link, &original->l_res_link);
1669 void ldlm_resource_unlink_lock(struct ldlm_lock *lock)
1671 int type = lock->l_resource->lr_type;
1673 check_res_locked(lock->l_resource);
1676 ldlm_unlink_lock_skiplist(lock);
1679 ldlm_extent_unlink_lock(lock);
1682 ldlm_inodebits_unlink_lock(lock);
1685 list_del_init(&lock->l_res_link);
1687 EXPORT_SYMBOL(ldlm_resource_unlink_lock);
1689 void ldlm_res2desc(struct ldlm_resource *res, struct ldlm_resource_desc *desc)
1691 desc->lr_type = res->lr_type;
1692 desc->lr_name = res->lr_name;
1696 * Print information about all locks in all namespaces on this node to debug
1699 void ldlm_dump_all_namespaces(enum ldlm_side client, int level)
1701 struct list_head *tmp;
1703 if (!((libcfs_debug | D_ERROR) & level))
1706 mutex_lock(ldlm_namespace_lock(client));
1708 list_for_each(tmp, ldlm_namespace_list(client)) {
1709 struct ldlm_namespace *ns;
1711 ns = list_entry(tmp, struct ldlm_namespace, ns_list_chain);
1712 ldlm_namespace_dump(level, ns);
1715 mutex_unlock(ldlm_namespace_lock(client));
1718 static int ldlm_res_hash_dump(struct cfs_hash *hs, struct cfs_hash_bd *bd,
1719 struct hlist_node *hnode, void *arg)
1721 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
1722 int level = (int)(unsigned long)arg;
1725 ldlm_resource_dump(level, res);
1732 * Print information about all locks in this namespace on this node to debug
1735 void ldlm_namespace_dump(int level, struct ldlm_namespace *ns)
1737 if (!((libcfs_debug | D_ERROR) & level))
1740 CDEBUG(level, "--- Namespace: %s (rc: %d, side: %s)\n",
1741 ldlm_ns_name(ns), atomic_read(&ns->ns_bref),
1742 ns_is_client(ns) ? "client" : "server");
1744 if (ktime_get_seconds() < ns->ns_next_dump)
1747 cfs_hash_for_each_nolock(ns->ns_rs_hash,
1749 (void *)(unsigned long)level, 0);
1750 spin_lock(&ns->ns_lock);
1751 ns->ns_next_dump = ktime_get_seconds() + 10;
1752 spin_unlock(&ns->ns_lock);
1756 * Print information about all locks in this resource to debug log.
1758 void ldlm_resource_dump(int level, struct ldlm_resource *res)
1760 struct ldlm_lock *lock;
1761 unsigned int granted = 0;
1763 BUILD_BUG_ON(RES_NAME_SIZE != 4);
1765 if (!((libcfs_debug | D_ERROR) & level))
1768 CDEBUG(level, "--- Resource: "DLDLMRES" (%p) refcount = %d\n",
1769 PLDLMRES(res), res, atomic_read(&res->lr_refcount));
1771 if (!list_empty(&res->lr_granted)) {
1772 CDEBUG(level, "Granted locks (in reverse order):\n");
1773 list_for_each_entry_reverse(lock, &res->lr_granted,
1775 LDLM_DEBUG_LIMIT(level, lock, "###");
1776 if (!(level & D_CANTMASK) &&
1777 ++granted > ldlm_dump_granted_max) {
1779 "only dump %d granted locks to avoid DDOS.\n",
1786 if (!list_empty(&res->lr_waiting)) {
1787 CDEBUG(level, "Waiting locks:\n");
1788 list_for_each_entry(lock, &res->lr_waiting, l_res_link)
1789 LDLM_DEBUG_LIMIT(level, lock, "###");
1792 EXPORT_SYMBOL(ldlm_resource_dump);