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;
47 int ldlm_srv_namespace_nr = 0;
48 int ldlm_cli_namespace_nr = 0;
50 DEFINE_MUTEX(ldlm_srv_namespace_lock);
51 LIST_HEAD(ldlm_srv_namespace_list);
53 DEFINE_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 LIST_HEAD(ldlm_cli_active_namespace_list);
58 /* Client namespaces that don't have any locks in them */
59 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_WR_ONLY(ldlm, dump_ns);
80 static int ldlm_rw_uint_seq_show(struct seq_file *m, void *v)
82 seq_printf(m, "%u\n", *(unsigned int *)m->private);
87 ldlm_rw_uint_seq_write(struct file *file, const char __user *buffer,
88 size_t count, loff_t *off)
90 struct seq_file *seq = file->private_data;
95 return kstrtouint_from_user(buffer, count, 0,
96 (unsigned int *)seq->private);
99 LPROC_SEQ_FOPS(ldlm_rw_uint);
101 #ifdef HAVE_SERVER_SUPPORT
103 static int seq_watermark_show(struct seq_file *m, void *data)
105 seq_printf(m, "%llu\n", *(__u64 *)m->private);
109 static ssize_t seq_watermark_write(struct file *file,
110 const char __user *buffer, size_t count,
115 __u64 *data = ((struct seq_file *)file->private_data)->private;
116 bool wm_low = (data == &ldlm_reclaim_threshold_mb) ? true : false;
119 rc = lprocfs_str_with_units_to_s64(buffer, count, &value, 'M');
121 CERROR("Failed to set %s, rc = %d.\n",
122 wm_low ? "lock_reclaim_threshold_mb" : "lock_limit_mb",
125 } else if (value != 0 && value < (1 << 20)) {
126 CERROR("%s should be greater than 1MB.\n",
127 wm_low ? "lock_reclaim_threshold_mb" : "lock_limit_mb");
130 watermark = value >> 20;
133 if (ldlm_lock_limit_mb != 0 && watermark > ldlm_lock_limit_mb) {
134 CERROR("lock_reclaim_threshold_mb must be smaller than "
140 if (watermark != 0) {
142 do_div(watermark, sizeof(struct ldlm_lock));
144 ldlm_reclaim_threshold = watermark;
146 if (ldlm_reclaim_threshold_mb != 0 &&
147 watermark < ldlm_reclaim_threshold_mb) {
148 CERROR("lock_limit_mb must be greater than "
149 "lock_reclaim_threshold_mb.\n");
154 if (watermark != 0) {
156 do_div(watermark, sizeof(struct ldlm_lock));
158 ldlm_lock_limit = watermark;
164 static int seq_watermark_open(struct inode *inode, struct file *file)
166 return single_open(file, seq_watermark_show, PDE_DATA(inode));
169 static const struct file_operations ldlm_watermark_fops = {
170 .owner = THIS_MODULE,
171 .open = seq_watermark_open,
173 .write = seq_watermark_write,
175 .release = lprocfs_single_release,
178 static int seq_granted_show(struct seq_file *m, void *data)
180 seq_printf(m, "%llu\n", percpu_counter_sum_positive(
181 (struct percpu_counter *)m->private));
185 static int seq_granted_open(struct inode *inode, struct file *file)
187 return single_open(file, seq_granted_show, PDE_DATA(inode));
190 static const struct file_operations ldlm_granted_fops = {
191 .owner = THIS_MODULE,
192 .open = seq_granted_open,
195 .release = seq_release,
198 #endif /* HAVE_SERVER_SUPPORT */
200 int ldlm_proc_setup(void)
203 struct lprocfs_vars list[] = {
204 { .name = "dump_namespaces",
205 .fops = &ldlm_dump_ns_fops,
207 { .name = "dump_granted_max",
208 .fops = &ldlm_rw_uint_fops,
209 .data = &ldlm_dump_granted_max },
210 #ifdef HAVE_SERVER_SUPPORT
211 { .name = "lock_reclaim_threshold_mb",
212 .fops = &ldlm_watermark_fops,
213 .data = &ldlm_reclaim_threshold_mb },
214 { .name = "lock_limit_mb",
215 .fops = &ldlm_watermark_fops,
216 .data = &ldlm_lock_limit_mb },
217 { .name = "lock_granted_count",
218 .fops = &ldlm_granted_fops,
219 .data = &ldlm_granted_total },
223 LASSERT(ldlm_ns_proc_dir == NULL);
225 ldlm_type_proc_dir = lprocfs_register(OBD_LDLM_DEVICENAME,
228 if (IS_ERR(ldlm_type_proc_dir)) {
229 CERROR("LProcFS failed in ldlm-init\n");
230 rc = PTR_ERR(ldlm_type_proc_dir);
234 ldlm_ns_proc_dir = lprocfs_register("namespaces",
237 if (IS_ERR(ldlm_ns_proc_dir)) {
238 CERROR("LProcFS failed in ldlm-init\n");
239 rc = PTR_ERR(ldlm_ns_proc_dir);
243 ldlm_svc_proc_dir = lprocfs_register("services",
246 if (IS_ERR(ldlm_svc_proc_dir)) {
247 CERROR("LProcFS failed in ldlm-init\n");
248 rc = PTR_ERR(ldlm_svc_proc_dir);
252 rc = lprocfs_add_vars(ldlm_type_proc_dir, list, NULL);
254 CERROR("LProcFS failed in ldlm-init\n");
261 lprocfs_remove(&ldlm_svc_proc_dir);
263 lprocfs_remove(&ldlm_ns_proc_dir);
265 lprocfs_remove(&ldlm_type_proc_dir);
267 ldlm_svc_proc_dir = NULL;
271 void ldlm_proc_cleanup(void)
273 if (ldlm_svc_proc_dir)
274 lprocfs_remove(&ldlm_svc_proc_dir);
276 if (ldlm_ns_proc_dir)
277 lprocfs_remove(&ldlm_ns_proc_dir);
279 if (ldlm_type_proc_dir)
280 lprocfs_remove(&ldlm_type_proc_dir);
283 static ssize_t resource_count_show(struct kobject *kobj, struct attribute *attr,
286 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
289 struct cfs_hash_bd bd;
292 /* result is not strictly consistant */
293 cfs_hash_for_each_bucket(ns->ns_rs_hash, &bd, i)
294 res += cfs_hash_bd_count_get(&bd);
295 return sprintf(buf, "%lld\n", res);
297 LUSTRE_RO_ATTR(resource_count);
299 static ssize_t lock_count_show(struct kobject *kobj, struct attribute *attr,
302 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
306 locks = lprocfs_stats_collector(ns->ns_stats, LDLM_NSS_LOCKS,
307 LPROCFS_FIELDS_FLAGS_SUM);
308 return sprintf(buf, "%lld\n", locks);
310 LUSTRE_RO_ATTR(lock_count);
312 static ssize_t lock_unused_count_show(struct kobject *kobj,
313 struct attribute *attr,
316 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
319 return sprintf(buf, "%d\n", ns->ns_nr_unused);
321 LUSTRE_RO_ATTR(lock_unused_count);
323 static ssize_t lru_size_show(struct kobject *kobj, struct attribute *attr,
326 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
328 __u32 *nr = &ns->ns_max_unused;
330 if (ns_connect_lru_resize(ns))
331 nr = &ns->ns_nr_unused;
332 return sprintf(buf, "%u\n", *nr);
335 static ssize_t lru_size_store(struct kobject *kobj, struct attribute *attr,
336 const char *buffer, size_t count)
338 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
344 if (strncmp(buffer, "clear", 5) == 0) {
346 "dropping all unused locks from namespace %s\n",
348 if (ns_connect_lru_resize(ns)) {
349 /* Try to cancel all @ns_nr_unused locks. */
350 ldlm_cancel_lru(ns, ns->ns_nr_unused, 0,
351 LDLM_LRU_FLAG_PASSED |
352 LDLM_LRU_FLAG_CLEANUP);
354 tmp = ns->ns_max_unused;
355 ns->ns_max_unused = 0;
356 ldlm_cancel_lru(ns, 0, 0, LDLM_LRU_FLAG_PASSED |
357 LDLM_LRU_FLAG_CLEANUP);
358 ns->ns_max_unused = tmp;
363 err = kstrtoul(buffer, 10, &tmp);
365 CERROR("lru_size: invalid value written\n");
368 lru_resize = (tmp == 0);
370 if (ns_connect_lru_resize(ns)) {
372 ns->ns_max_unused = (unsigned int)tmp;
374 if (tmp > ns->ns_nr_unused)
375 tmp = ns->ns_nr_unused;
376 tmp = ns->ns_nr_unused - tmp;
379 "changing namespace %s unused locks from %u to %u\n",
380 ldlm_ns_name(ns), ns->ns_nr_unused,
382 ldlm_cancel_lru(ns, tmp, LCF_ASYNC, LDLM_LRU_FLAG_PASSED);
386 "disable lru_resize for namespace %s\n",
388 ns->ns_connect_flags &= ~OBD_CONNECT_LRU_RESIZE;
392 "changing namespace %s max_unused from %u to %u\n",
393 ldlm_ns_name(ns), ns->ns_max_unused,
395 ns->ns_max_unused = (unsigned int)tmp;
396 ldlm_cancel_lru(ns, 0, LCF_ASYNC, LDLM_LRU_FLAG_PASSED);
398 /* Make sure that LRU resize was originally supported before
399 * turning it on here.
402 (ns->ns_orig_connect_flags & OBD_CONNECT_LRU_RESIZE)) {
404 "enable lru_resize for namespace %s\n",
406 ns->ns_connect_flags |= OBD_CONNECT_LRU_RESIZE;
412 LUSTRE_RW_ATTR(lru_size);
414 static ssize_t lru_max_age_show(struct kobject *kobj, struct attribute *attr,
417 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
420 return sprintf(buf, "%lld\n", ktime_to_ms(ns->ns_max_age));
423 static ssize_t lru_max_age_store(struct kobject *kobj, struct attribute *attr,
424 const char *buffer, size_t count)
426 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
428 int scale = NSEC_PER_MSEC;
429 unsigned long long tmp;
432 /* Did the user ask in seconds or milliseconds. Default is in ms */
433 buf = strstr(buffer, "ms");
435 buf = strchr(buffer, 's');
437 scale = NSEC_PER_SEC;
443 if (kstrtoull(buffer, 10, &tmp))
446 ns->ns_max_age = ktime_set(0, tmp * scale);
450 LUSTRE_RW_ATTR(lru_max_age);
452 static ssize_t early_lock_cancel_show(struct kobject *kobj,
453 struct attribute *attr,
456 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
459 return sprintf(buf, "%d\n", ns_connect_cancelset(ns));
462 static ssize_t early_lock_cancel_store(struct kobject *kobj,
463 struct attribute *attr,
467 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
469 unsigned long supp = -1;
472 rc = kstrtoul(buffer, 10, &supp);
477 ns->ns_connect_flags &= ~OBD_CONNECT_CANCELSET;
478 else if (ns->ns_orig_connect_flags & OBD_CONNECT_CANCELSET)
479 ns->ns_connect_flags |= OBD_CONNECT_CANCELSET;
482 LUSTRE_RW_ATTR(early_lock_cancel);
484 #ifdef HAVE_SERVER_SUPPORT
485 static ssize_t ctime_age_limit_show(struct kobject *kobj,
486 struct attribute *attr, char *buf)
488 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
491 return sprintf(buf, "%llu\n", ns->ns_ctime_age_limit);
494 static ssize_t ctime_age_limit_store(struct kobject *kobj,
495 struct attribute *attr,
496 const char *buffer, size_t count)
498 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
500 unsigned long long tmp;
502 if (kstrtoull(buffer, 10, &tmp))
505 ns->ns_ctime_age_limit = tmp;
509 LUSTRE_RW_ATTR(ctime_age_limit);
511 static ssize_t lock_timeouts_show(struct kobject *kobj, struct attribute *attr,
514 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
517 return sprintf(buf, "%d\n", ns->ns_timeouts);
519 LUSTRE_RO_ATTR(lock_timeouts);
521 static ssize_t max_nolock_bytes_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, "%u\n", ns->ns_max_nolock_size);
530 static ssize_t max_nolock_bytes_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,
539 err = kstrtoul(buffer, 10, &tmp);
543 ns->ns_max_nolock_size = tmp;
547 LUSTRE_RW_ATTR(max_nolock_bytes);
549 static ssize_t contention_seconds_show(struct kobject *kobj,
550 struct attribute *attr, char *buf)
552 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
555 return sprintf(buf, "%llu\n", ns->ns_contention_time);
558 static ssize_t contention_seconds_store(struct kobject *kobj,
559 struct attribute *attr,
560 const char *buffer, size_t count)
562 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
564 unsigned long long tmp;
566 if (kstrtoull(buffer, 10, &tmp))
569 ns->ns_contention_time = tmp;
573 LUSTRE_RW_ATTR(contention_seconds);
575 static ssize_t contended_locks_show(struct kobject *kobj,
576 struct attribute *attr, char *buf)
578 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
581 return sprintf(buf, "%u\n", ns->ns_contended_locks);
584 static ssize_t contended_locks_store(struct kobject *kobj,
585 struct attribute *attr,
586 const char *buffer, size_t count)
588 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
593 err = kstrtoul(buffer, 10, &tmp);
597 ns->ns_contended_locks = tmp;
601 LUSTRE_RW_ATTR(contended_locks);
603 static ssize_t max_parallel_ast_show(struct kobject *kobj,
604 struct attribute *attr, char *buf)
606 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
609 return sprintf(buf, "%u\n", ns->ns_max_parallel_ast);
612 static ssize_t max_parallel_ast_store(struct kobject *kobj,
613 struct attribute *attr,
614 const char *buffer, size_t count)
616 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
621 err = kstrtoul(buffer, 10, &tmp);
625 ns->ns_max_parallel_ast = tmp;
629 LUSTRE_RW_ATTR(max_parallel_ast);
631 #endif /* HAVE_SERVER_SUPPORT */
633 /* These are for namespaces in /sys/fs/lustre/ldlm/namespaces/ */
634 static struct attribute *ldlm_ns_attrs[] = {
635 &lustre_attr_resource_count.attr,
636 &lustre_attr_lock_count.attr,
637 &lustre_attr_lock_unused_count.attr,
638 &lustre_attr_lru_size.attr,
639 &lustre_attr_lru_max_age.attr,
640 &lustre_attr_early_lock_cancel.attr,
641 #ifdef HAVE_SERVER_SUPPORT
642 &lustre_attr_ctime_age_limit.attr,
643 &lustre_attr_lock_timeouts.attr,
644 &lustre_attr_max_nolock_bytes.attr,
645 &lustre_attr_contention_seconds.attr,
646 &lustre_attr_contended_locks.attr,
647 &lustre_attr_max_parallel_ast.attr,
652 static void ldlm_ns_release(struct kobject *kobj)
654 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
656 complete(&ns->ns_kobj_unregister);
659 static struct kobj_type ldlm_ns_ktype = {
660 .default_attrs = ldlm_ns_attrs,
661 .sysfs_ops = &lustre_sysfs_ops,
662 .release = ldlm_ns_release,
665 static void ldlm_namespace_proc_unregister(struct ldlm_namespace *ns)
667 if (ns->ns_proc_dir_entry == NULL)
668 CERROR("dlm namespace %s has no procfs dir?\n",
671 lprocfs_remove(&ns->ns_proc_dir_entry);
673 if (ns->ns_stats != NULL)
674 lprocfs_free_stats(&ns->ns_stats);
677 void ldlm_namespace_sysfs_unregister(struct ldlm_namespace *ns)
679 kobject_put(&ns->ns_kobj);
680 wait_for_completion(&ns->ns_kobj_unregister);
683 int ldlm_namespace_sysfs_register(struct ldlm_namespace *ns)
687 ns->ns_kobj.kset = ldlm_ns_kset;
688 init_completion(&ns->ns_kobj_unregister);
689 err = kobject_init_and_add(&ns->ns_kobj, &ldlm_ns_ktype, NULL,
690 "%s", ldlm_ns_name(ns));
692 ns->ns_stats = lprocfs_alloc_stats(LDLM_NSS_LAST, 0);
694 kobject_put(&ns->ns_kobj);
698 lprocfs_counter_init(ns->ns_stats, LDLM_NSS_LOCKS,
699 LPROCFS_CNTR_AVGMINMAX, "locks", "locks");
704 static int ldlm_namespace_proc_register(struct ldlm_namespace *ns)
706 struct proc_dir_entry *ns_pde;
709 LASSERT(ns->ns_rs_hash != NULL);
711 if (ns->ns_proc_dir_entry != NULL) {
712 ns_pde = ns->ns_proc_dir_entry;
714 ns_pde = proc_mkdir(ldlm_ns_name(ns), ldlm_ns_proc_dir);
717 ns->ns_proc_dir_entry = ns_pde;
722 #undef MAX_STRING_SIZE
723 #else /* CONFIG_PROC_FS */
725 #define ldlm_namespace_proc_unregister(ns) ({;})
726 #define ldlm_namespace_proc_register(ns) ({0;})
728 #endif /* CONFIG_PROC_FS */
730 static unsigned ldlm_res_hop_hash(struct cfs_hash *hs,
731 const void *key, unsigned mask)
733 const struct ldlm_res_id *id = key;
737 for (i = 0; i < RES_NAME_SIZE; i++)
742 static unsigned ldlm_res_hop_fid_hash(struct cfs_hash *hs,
743 const void *key, unsigned mask)
745 const struct ldlm_res_id *id = key;
750 fid.f_seq = id->name[LUSTRE_RES_ID_SEQ_OFF];
751 fid.f_oid = (__u32)id->name[LUSTRE_RES_ID_VER_OID_OFF];
752 fid.f_ver = (__u32)(id->name[LUSTRE_RES_ID_VER_OID_OFF] >> 32);
754 hash = fid_flatten32(&fid);
755 hash += (hash >> 4) + (hash << 12); /* mixing oid and seq */
756 if (id->name[LUSTRE_RES_ID_HSH_OFF] != 0) {
757 val = id->name[LUSTRE_RES_ID_HSH_OFF];
758 hash += (val >> 5) + (val << 11);
762 hash = hash_long(hash, hs->hs_bkt_bits);
763 /* give me another random factor */
764 hash -= hash_long((unsigned long)hs, val % 11 + 3);
766 hash <<= hs->hs_cur_bits - hs->hs_bkt_bits;
767 hash |= ldlm_res_hop_hash(hs, key, CFS_HASH_NBKT(hs) - 1);
772 static void *ldlm_res_hop_key(struct hlist_node *hnode)
774 struct ldlm_resource *res;
776 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
777 return &res->lr_name;
780 static int ldlm_res_hop_keycmp(const void *key, struct hlist_node *hnode)
782 struct ldlm_resource *res;
784 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
785 return ldlm_res_eq((const struct ldlm_res_id *)key,
786 (const struct ldlm_res_id *)&res->lr_name);
789 static void *ldlm_res_hop_object(struct hlist_node *hnode)
791 return hlist_entry(hnode, struct ldlm_resource, lr_hash);
795 ldlm_res_hop_get_locked(struct cfs_hash *hs, struct hlist_node *hnode)
797 struct ldlm_resource *res;
799 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
800 ldlm_resource_getref(res);
803 static void ldlm_res_hop_put(struct cfs_hash *hs, struct hlist_node *hnode)
805 struct ldlm_resource *res;
807 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
808 ldlm_resource_putref(res);
811 static struct cfs_hash_ops ldlm_ns_hash_ops = {
812 .hs_hash = ldlm_res_hop_hash,
813 .hs_key = ldlm_res_hop_key,
814 .hs_keycmp = ldlm_res_hop_keycmp,
816 .hs_object = ldlm_res_hop_object,
817 .hs_get = ldlm_res_hop_get_locked,
818 .hs_put = ldlm_res_hop_put
821 static struct cfs_hash_ops ldlm_ns_fid_hash_ops = {
822 .hs_hash = ldlm_res_hop_fid_hash,
823 .hs_key = ldlm_res_hop_key,
824 .hs_keycmp = ldlm_res_hop_keycmp,
826 .hs_object = ldlm_res_hop_object,
827 .hs_get = ldlm_res_hop_get_locked,
828 .hs_put = ldlm_res_hop_put
831 typedef struct ldlm_ns_hash_def {
832 enum ldlm_ns_type nsd_type;
833 /** hash bucket bits */
834 unsigned nsd_bkt_bits;
836 unsigned nsd_all_bits;
837 /** hash operations */
838 struct cfs_hash_ops *nsd_hops;
839 } ldlm_ns_hash_def_t;
841 static struct ldlm_ns_hash_def ldlm_ns_hash_defs[] =
844 .nsd_type = LDLM_NS_TYPE_MDC,
847 .nsd_hops = &ldlm_ns_fid_hash_ops,
850 .nsd_type = LDLM_NS_TYPE_MDT,
853 .nsd_hops = &ldlm_ns_fid_hash_ops,
856 .nsd_type = LDLM_NS_TYPE_OSC,
859 .nsd_hops = &ldlm_ns_hash_ops,
862 .nsd_type = LDLM_NS_TYPE_OST,
865 .nsd_hops = &ldlm_ns_hash_ops,
868 .nsd_type = LDLM_NS_TYPE_MGC,
871 .nsd_hops = &ldlm_ns_hash_ops,
874 .nsd_type = LDLM_NS_TYPE_MGT,
877 .nsd_hops = &ldlm_ns_hash_ops,
880 .nsd_type = LDLM_NS_TYPE_UNKNOWN,
885 * Create and initialize new empty namespace.
887 struct ldlm_namespace *ldlm_namespace_new(struct obd_device *obd, char *name,
888 enum ldlm_side client,
889 enum ldlm_appetite apt,
890 enum ldlm_ns_type ns_type)
892 struct ldlm_namespace *ns = NULL;
893 struct ldlm_ns_bucket *nsb;
894 struct ldlm_ns_hash_def *nsd;
895 struct cfs_hash_bd bd;
900 LASSERT(obd != NULL);
904 CERROR("ldlm_get_ref failed: %d\n", rc);
908 for (idx = 0;;idx++) {
909 nsd = &ldlm_ns_hash_defs[idx];
910 if (nsd->nsd_type == LDLM_NS_TYPE_UNKNOWN) {
911 CERROR("Unknown type %d for ns %s\n", ns_type, name);
915 if (nsd->nsd_type == ns_type)
923 ns->ns_rs_hash = cfs_hash_create(name,
924 nsd->nsd_all_bits, nsd->nsd_all_bits,
925 nsd->nsd_bkt_bits, sizeof(*nsb),
931 CFS_HASH_SPIN_BKTLOCK |
932 CFS_HASH_NO_ITEMREF);
933 if (ns->ns_rs_hash == NULL)
936 cfs_hash_for_each_bucket(ns->ns_rs_hash, &bd, idx) {
937 nsb = cfs_hash_bd_extra_get(ns->ns_rs_hash, &bd);
938 at_init(&nsb->nsb_at_estimate, ldlm_enqueue_min, 0);
939 nsb->nsb_namespace = ns;
940 nsb->nsb_reclaim_start = 0;
944 ns->ns_appetite = apt;
945 ns->ns_client = client;
947 INIT_LIST_HEAD(&ns->ns_list_chain);
948 INIT_LIST_HEAD(&ns->ns_unused_list);
949 spin_lock_init(&ns->ns_lock);
950 atomic_set(&ns->ns_bref, 0);
951 init_waitqueue_head(&ns->ns_waitq);
953 ns->ns_max_nolock_size = NS_DEFAULT_MAX_NOLOCK_BYTES;
954 ns->ns_contention_time = NS_DEFAULT_CONTENTION_SECONDS;
955 ns->ns_contended_locks = NS_DEFAULT_CONTENDED_LOCKS;
957 ns->ns_max_parallel_ast = LDLM_DEFAULT_PARALLEL_AST_LIMIT;
958 ns->ns_nr_unused = 0;
959 ns->ns_max_unused = LDLM_DEFAULT_LRU_SIZE;
960 ns->ns_max_age = ktime_set(LDLM_DEFAULT_MAX_ALIVE, 0);
961 ns->ns_ctime_age_limit = LDLM_CTIME_AGE_LIMIT;
963 ns->ns_orig_connect_flags = 0;
964 ns->ns_connect_flags = 0;
966 ns->ns_reclaim_start = 0;
968 rc = ldlm_namespace_sysfs_register(ns);
970 CERROR("Can't initialize ns sysfs, rc %d\n", rc);
974 rc = ldlm_namespace_proc_register(ns);
976 CERROR("Can't initialize ns proc, rc %d\n", rc);
980 idx = ldlm_namespace_nr_read(client);
981 rc = ldlm_pool_init(&ns->ns_pool, ns, idx, client);
983 CERROR("Can't initialize lock pool, rc %d\n", rc);
987 ldlm_namespace_register(ns, client);
990 ldlm_namespace_proc_unregister(ns);
992 ldlm_namespace_sysfs_unregister(ns);
993 ldlm_namespace_cleanup(ns, 0);
995 cfs_hash_putref(ns->ns_rs_hash);
1002 EXPORT_SYMBOL(ldlm_namespace_new);
1004 extern struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock);
1007 * Cancel and destroy all locks on a resource.
1009 * If flags contains FL_LOCAL_ONLY, don't try to tell the server, just
1010 * clean up. This is currently only used for recovery, and we make
1011 * certain assumptions as a result--notably, that we shouldn't cancel
1014 static void cleanup_resource(struct ldlm_resource *res, struct list_head *q,
1017 struct list_head *tmp;
1018 int rc = 0, client = ns_is_client(ldlm_res_to_ns(res));
1019 bool local_only = !!(flags & LDLM_FL_LOCAL_ONLY);
1022 struct ldlm_lock *lock = NULL;
1024 /* First, we look for non-cleaned-yet lock
1025 * all cleaned locks are marked by CLEANED flag. */
1027 list_for_each(tmp, q) {
1028 lock = list_entry(tmp, struct ldlm_lock,
1030 if (ldlm_is_cleaned(lock)) {
1034 LDLM_LOCK_GET(lock);
1035 ldlm_set_cleaned(lock);
1044 /* Set CBPENDING so nothing in the cancellation path
1045 * can match this lock. */
1046 ldlm_set_cbpending(lock);
1047 ldlm_set_failed(lock);
1048 lock->l_flags |= flags;
1050 /* ... without sending a CANCEL message for local_only. */
1052 ldlm_set_local_only(lock);
1054 if (local_only && (lock->l_readers || lock->l_writers)) {
1055 /* This is a little bit gross, but much better than the
1056 * alternative: pretend that we got a blocking AST from
1057 * the server, so that when the lock is decref'd, it
1058 * will go away ... */
1060 LDLM_DEBUG(lock, "setting FL_LOCAL_ONLY");
1061 if (lock->l_flags & LDLM_FL_FAIL_LOC) {
1062 set_current_state(TASK_UNINTERRUPTIBLE);
1063 schedule_timeout(cfs_time_seconds(4));
1064 set_current_state(TASK_RUNNING);
1066 if (lock->l_completion_ast)
1067 lock->l_completion_ast(lock,
1068 LDLM_FL_FAILED, NULL);
1069 LDLM_LOCK_RELEASE(lock);
1074 struct lustre_handle lockh;
1077 ldlm_lock2handle(lock, &lockh);
1078 rc = ldlm_cli_cancel(&lockh, LCF_LOCAL);
1080 CERROR("ldlm_cli_cancel: %d\n", rc);
1083 LDLM_DEBUG(lock, "Freeing a lock still held by a "
1085 ldlm_lock_cancel(lock);
1087 LDLM_LOCK_RELEASE(lock);
1091 static int ldlm_resource_clean(struct cfs_hash *hs, struct cfs_hash_bd *bd,
1092 struct hlist_node *hnode, void *arg)
1094 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
1095 __u64 flags = *(__u64 *)arg;
1097 cleanup_resource(res, &res->lr_granted, flags);
1098 cleanup_resource(res, &res->lr_waiting, flags);
1103 static int ldlm_resource_complain(struct cfs_hash *hs, struct cfs_hash_bd *bd,
1104 struct hlist_node *hnode, void *arg)
1106 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
1109 CERROR("%s: namespace resource "DLDLMRES" (%p) refcount nonzero "
1110 "(%d) after lock cleanup; forcing cleanup.\n",
1111 ldlm_ns_name(ldlm_res_to_ns(res)), PLDLMRES(res), res,
1112 atomic_read(&res->lr_refcount) - 1);
1114 ldlm_resource_dump(D_ERROR, res);
1120 * Cancel and destroy all locks in the namespace.
1122 * Typically used during evictions when server notified client that it was
1123 * evicted and all of its state needs to be destroyed.
1124 * Also used during shutdown.
1126 int ldlm_namespace_cleanup(struct ldlm_namespace *ns, __u64 flags)
1129 CDEBUG(D_INFO, "NULL ns, skipping cleanup\n");
1133 cfs_hash_for_each_nolock(ns->ns_rs_hash, ldlm_resource_clean,
1135 cfs_hash_for_each_nolock(ns->ns_rs_hash, ldlm_resource_complain,
1139 EXPORT_SYMBOL(ldlm_namespace_cleanup);
1142 * Attempts to free namespace.
1144 * Only used when namespace goes away, like during an unmount.
1146 static int __ldlm_namespace_free(struct ldlm_namespace *ns, int force)
1150 /* At shutdown time, don't call the cancellation callback */
1151 ldlm_namespace_cleanup(ns, force ? LDLM_FL_LOCAL_ONLY : 0);
1153 if (atomic_read(&ns->ns_bref) > 0) {
1154 struct l_wait_info lwi = LWI_INTR(LWI_ON_SIGNAL_NOOP, NULL);
1157 "dlm namespace %s free waiting on refcount %d\n",
1158 ldlm_ns_name(ns), atomic_read(&ns->ns_bref));
1161 lwi = LWI_TIMEOUT(msecs_to_jiffies(obd_timeout *
1162 MSEC_PER_SEC) / 4, NULL, NULL);
1164 rc = l_wait_event(ns->ns_waitq,
1165 atomic_read(&ns->ns_bref) == 0, &lwi);
1167 /* Forced cleanups should be able to reclaim all references,
1168 * so it's safe to wait forever... we can't leak locks... */
1169 if (force && rc == -ETIMEDOUT) {
1170 LCONSOLE_ERROR("Forced cleanup waiting for %s "
1171 "namespace with %d resources in use, "
1172 "(rc=%d)\n", ldlm_ns_name(ns),
1173 atomic_read(&ns->ns_bref), rc);
1174 GOTO(force_wait, rc);
1177 if (atomic_read(&ns->ns_bref)) {
1178 LCONSOLE_ERROR("Cleanup waiting for %s namespace "
1179 "with %d resources in use, (rc=%d)\n",
1181 atomic_read(&ns->ns_bref), rc);
1182 RETURN(ELDLM_NAMESPACE_EXISTS);
1184 CDEBUG(D_DLMTRACE, "dlm namespace %s free done waiting\n",
1192 * Performs various cleanups for passed \a ns to make it drop refc and be
1193 * ready for freeing. Waits for refc == 0.
1195 * The following is done:
1196 * (0) Unregister \a ns from its list to make inaccessible for potential
1197 * users like pools thread and others;
1198 * (1) Clear all locks in \a ns.
1200 void ldlm_namespace_free_prior(struct ldlm_namespace *ns,
1201 struct obd_import *imp,
1211 spin_lock(&ns->ns_lock);
1212 ns->ns_stopping = 1;
1213 spin_unlock(&ns->ns_lock);
1216 * Can fail with -EINTR when force == 0 in which case try harder.
1218 rc = __ldlm_namespace_free(ns, force);
1219 if (rc != ELDLM_OK) {
1221 ptlrpc_disconnect_import(imp, 0);
1222 ptlrpc_invalidate_import(imp);
1226 * With all requests dropped and the import inactive
1227 * we are gaurenteed all reference will be dropped.
1229 rc = __ldlm_namespace_free(ns, 1);
1234 EXPORT_SYMBOL(ldlm_namespace_free_prior);
1237 * Performs freeing memory structures related to \a ns. This is only done
1238 * when ldlm_namespce_free_prior() successfully removed all resources
1239 * referencing \a ns and its refc == 0.
1241 void ldlm_namespace_free_post(struct ldlm_namespace *ns)
1249 /* Make sure that nobody can find this ns in its list. */
1250 ldlm_namespace_unregister(ns, ns->ns_client);
1251 /* Fini pool _before_ parent proc dir is removed. This is important as
1252 * ldlm_pool_fini() removes own proc dir which is child to @dir.
1253 * Removing it after @dir may cause oops. */
1254 ldlm_pool_fini(&ns->ns_pool);
1256 ldlm_namespace_proc_unregister(ns);
1257 ldlm_namespace_sysfs_unregister(ns);
1258 cfs_hash_putref(ns->ns_rs_hash);
1259 /* Namespace \a ns should be not on list at this time, otherwise
1260 * this will cause issues related to using freed \a ns in poold
1262 LASSERT(list_empty(&ns->ns_list_chain));
1267 EXPORT_SYMBOL(ldlm_namespace_free_post);
1270 * Cleanup the resource, and free namespace.
1273 * proc1: destroy import
1274 * class_disconnect_export(grab cl_sem) ->
1275 * -> ldlm_namespace_free ->
1276 * -> lprocfs_remove(grab _lprocfs_lock).
1277 * proc2: read proc info
1278 * lprocfs_fops_read(grab _lprocfs_lock) ->
1279 * -> osc_rd_active, etc(grab cl_sem).
1281 * So that I have to split the ldlm_namespace_free into two parts - the first
1282 * part ldlm_namespace_free_prior is used to cleanup the resource which is
1283 * being used; the 2nd part ldlm_namespace_free_post is used to unregister the
1284 * lprocfs entries, and then free memory. It will be called w/o cli->cl_sem
1287 void ldlm_namespace_free(struct ldlm_namespace *ns,
1288 struct obd_import *imp,
1291 ldlm_namespace_free_prior(ns, imp, force);
1292 ldlm_namespace_free_post(ns);
1294 EXPORT_SYMBOL(ldlm_namespace_free);
1296 void ldlm_namespace_get(struct ldlm_namespace *ns)
1298 atomic_inc(&ns->ns_bref);
1301 /* This is only for callers that care about refcount */
1302 static int ldlm_namespace_get_return(struct ldlm_namespace *ns)
1304 return atomic_inc_return(&ns->ns_bref);
1307 void ldlm_namespace_put(struct ldlm_namespace *ns)
1309 if (atomic_dec_and_lock(&ns->ns_bref, &ns->ns_lock)) {
1310 wake_up(&ns->ns_waitq);
1311 spin_unlock(&ns->ns_lock);
1315 /** Register \a ns in the list of namespaces */
1316 void ldlm_namespace_register(struct ldlm_namespace *ns, enum ldlm_side client)
1318 mutex_lock(ldlm_namespace_lock(client));
1319 LASSERT(list_empty(&ns->ns_list_chain));
1320 list_add(&ns->ns_list_chain, ldlm_namespace_inactive_list(client));
1321 ldlm_namespace_nr_inc(client);
1322 mutex_unlock(ldlm_namespace_lock(client));
1325 /** Unregister \a ns from the list of namespaces. */
1326 void ldlm_namespace_unregister(struct ldlm_namespace *ns, enum ldlm_side client)
1328 mutex_lock(ldlm_namespace_lock(client));
1329 LASSERT(!list_empty(&ns->ns_list_chain));
1330 /* Some asserts and possibly other parts of the code are still
1331 * using list_empty(&ns->ns_list_chain). This is why it is
1332 * important to use list_del_init() here. */
1333 list_del_init(&ns->ns_list_chain);
1334 ldlm_namespace_nr_dec(client);
1335 mutex_unlock(ldlm_namespace_lock(client));
1338 /** Should be called with ldlm_namespace_lock(client) taken. */
1339 void ldlm_namespace_move_to_active_locked(struct ldlm_namespace *ns,
1340 enum ldlm_side client)
1342 LASSERT(!list_empty(&ns->ns_list_chain));
1343 LASSERT(mutex_is_locked(ldlm_namespace_lock(client)));
1344 list_move_tail(&ns->ns_list_chain, ldlm_namespace_list(client));
1347 /** Should be called with ldlm_namespace_lock(client) taken. */
1348 void ldlm_namespace_move_to_inactive_locked(struct ldlm_namespace *ns,
1349 enum ldlm_side client)
1351 LASSERT(!list_empty(&ns->ns_list_chain));
1352 LASSERT(mutex_is_locked(ldlm_namespace_lock(client)));
1353 list_move_tail(&ns->ns_list_chain,
1354 ldlm_namespace_inactive_list(client));
1357 /** Should be called with ldlm_namespace_lock(client) taken. */
1358 struct ldlm_namespace *ldlm_namespace_first_locked(enum ldlm_side client)
1360 LASSERT(mutex_is_locked(ldlm_namespace_lock(client)));
1361 LASSERT(!list_empty(ldlm_namespace_list(client)));
1362 return container_of(ldlm_namespace_list(client)->next,
1363 struct ldlm_namespace, ns_list_chain);
1366 /** Create and initialize new resource. */
1367 static struct ldlm_resource *ldlm_resource_new(enum ldlm_type ldlm_type)
1369 struct ldlm_resource *res;
1372 OBD_SLAB_ALLOC_PTR_GFP(res, ldlm_resource_slab, GFP_NOFS);
1376 if (ldlm_type == LDLM_EXTENT) {
1377 OBD_SLAB_ALLOC(res->lr_itree, ldlm_interval_tree_slab,
1378 sizeof(*res->lr_itree) * LCK_MODE_NUM);
1379 if (res->lr_itree == NULL) {
1380 OBD_SLAB_FREE_PTR(res, ldlm_resource_slab);
1383 /* Initialize interval trees for each lock mode. */
1384 for (idx = 0; idx < LCK_MODE_NUM; idx++) {
1385 res->lr_itree[idx].lit_size = 0;
1386 res->lr_itree[idx].lit_mode = 1 << idx;
1387 res->lr_itree[idx].lit_root = NULL;
1391 INIT_LIST_HEAD(&res->lr_granted);
1392 INIT_LIST_HEAD(&res->lr_waiting);
1394 atomic_set(&res->lr_refcount, 1);
1395 spin_lock_init(&res->lr_lock);
1396 lu_ref_init(&res->lr_reference);
1398 /* Since LVB init can be delayed now, there is no longer need to
1399 * immediatelly acquire mutex here. */
1400 mutex_init(&res->lr_lvb_mutex);
1401 res->lr_lvb_initialized = false;
1407 * Return a reference to resource with given name, creating it if necessary.
1408 * Args: namespace with ns_lock unlocked
1409 * Locks: takes and releases NS hash-lock and res->lr_lock
1410 * Returns: referenced, unlocked ldlm_resource or NULL
1412 struct ldlm_resource *
1413 ldlm_resource_get(struct ldlm_namespace *ns, struct ldlm_resource *parent,
1414 const struct ldlm_res_id *name, enum ldlm_type type,
1417 struct hlist_node *hnode;
1418 struct ldlm_resource *res = NULL;
1419 struct cfs_hash_bd bd;
1421 int ns_refcount = 0;
1423 LASSERT(ns != NULL);
1424 LASSERT(parent == NULL);
1425 LASSERT(ns->ns_rs_hash != NULL);
1426 LASSERT(name->name[0] != 0);
1428 cfs_hash_bd_get_and_lock(ns->ns_rs_hash, (void *)name, &bd, 0);
1429 hnode = cfs_hash_bd_lookup_locked(ns->ns_rs_hash, &bd, (void *)name);
1430 if (hnode != NULL) {
1431 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 0);
1435 version = cfs_hash_bd_version_get(&bd);
1436 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 0);
1439 return ERR_PTR(-ENOENT);
1441 LASSERTF(type >= LDLM_MIN_TYPE && type < LDLM_MAX_TYPE,
1442 "type: %d\n", type);
1443 res = ldlm_resource_new(type);
1445 return ERR_PTR(-ENOMEM);
1447 res->lr_ns_bucket = cfs_hash_bd_extra_get(ns->ns_rs_hash, &bd);
1448 res->lr_name = *name;
1449 res->lr_type = type;
1451 cfs_hash_bd_lock(ns->ns_rs_hash, &bd, 1);
1452 hnode = (version == cfs_hash_bd_version_get(&bd)) ? NULL :
1453 cfs_hash_bd_lookup_locked(ns->ns_rs_hash, &bd, (void *)name);
1455 if (hnode != NULL) {
1456 /* Someone won the race and already added the resource. */
1457 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
1458 /* Clean lu_ref for failed resource. */
1459 lu_ref_fini(&res->lr_reference);
1460 if (res->lr_itree != NULL)
1461 OBD_SLAB_FREE(res->lr_itree, ldlm_interval_tree_slab,
1462 sizeof(*res->lr_itree) * LCK_MODE_NUM);
1463 OBD_SLAB_FREE(res, ldlm_resource_slab, sizeof *res);
1465 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
1468 /* We won! Let's add the resource. */
1469 cfs_hash_bd_add_locked(ns->ns_rs_hash, &bd, &res->lr_hash);
1470 if (cfs_hash_bd_count_get(&bd) == 1)
1471 ns_refcount = ldlm_namespace_get_return(ns);
1473 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
1475 OBD_FAIL_TIMEOUT(OBD_FAIL_LDLM_CREATE_RESOURCE, 2);
1477 /* Let's see if we happened to be the very first resource in this
1478 * namespace. If so, and this is a client namespace, we need to move
1479 * the namespace into the active namespaces list to be patrolled by
1480 * the ldlm_poold. */
1481 if (ns_is_client(ns) && ns_refcount == 1) {
1482 mutex_lock(ldlm_namespace_lock(LDLM_NAMESPACE_CLIENT));
1483 ldlm_namespace_move_to_active_locked(ns, LDLM_NAMESPACE_CLIENT);
1484 mutex_unlock(ldlm_namespace_lock(LDLM_NAMESPACE_CLIENT));
1489 EXPORT_SYMBOL(ldlm_resource_get);
1491 struct ldlm_resource *ldlm_resource_getref(struct ldlm_resource *res)
1493 LASSERT(res != NULL);
1494 LASSERT(res != LP_POISON);
1495 atomic_inc(&res->lr_refcount);
1496 CDEBUG(D_INFO, "getref res: %p count: %d\n", res,
1497 atomic_read(&res->lr_refcount));
1501 static void __ldlm_resource_putref_final(struct cfs_hash_bd *bd,
1502 struct ldlm_resource *res)
1504 struct ldlm_ns_bucket *nsb = res->lr_ns_bucket;
1506 if (!list_empty(&res->lr_granted)) {
1507 ldlm_resource_dump(D_ERROR, res);
1511 if (!list_empty(&res->lr_waiting)) {
1512 ldlm_resource_dump(D_ERROR, res);
1516 cfs_hash_bd_del_locked(nsb->nsb_namespace->ns_rs_hash,
1518 lu_ref_fini(&res->lr_reference);
1519 if (cfs_hash_bd_count_get(bd) == 0)
1520 ldlm_namespace_put(nsb->nsb_namespace);
1523 /* Returns 1 if the resource was freed, 0 if it remains. */
1524 int ldlm_resource_putref(struct ldlm_resource *res)
1526 struct ldlm_namespace *ns = ldlm_res_to_ns(res);
1527 struct cfs_hash_bd bd;
1529 LASSERT_ATOMIC_GT_LT(&res->lr_refcount, 0, LI_POISON);
1530 CDEBUG(D_INFO, "putref res: %p count: %d\n",
1531 res, atomic_read(&res->lr_refcount) - 1);
1533 cfs_hash_bd_get(ns->ns_rs_hash, &res->lr_name, &bd);
1534 if (cfs_hash_bd_dec_and_lock(ns->ns_rs_hash, &bd, &res->lr_refcount)) {
1535 __ldlm_resource_putref_final(&bd, res);
1536 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
1537 if (ns->ns_lvbo && ns->ns_lvbo->lvbo_free)
1538 ns->ns_lvbo->lvbo_free(res);
1539 if (res->lr_itree != NULL)
1540 OBD_SLAB_FREE(res->lr_itree, ldlm_interval_tree_slab,
1541 sizeof(*res->lr_itree) * LCK_MODE_NUM);
1542 OBD_SLAB_FREE(res, ldlm_resource_slab, sizeof *res);
1547 EXPORT_SYMBOL(ldlm_resource_putref);
1550 * Add a lock into a given resource into specified lock list.
1552 void ldlm_resource_add_lock(struct ldlm_resource *res, struct list_head *head,
1553 struct ldlm_lock *lock)
1555 check_res_locked(res);
1557 LDLM_DEBUG(lock, "About to add this lock");
1559 if (ldlm_is_destroyed(lock)) {
1560 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
1564 LASSERT(list_empty(&lock->l_res_link));
1566 list_add_tail(&lock->l_res_link, head);
1570 * Insert a lock into resource after specified lock.
1572 * Obtain resource description from the lock we are inserting after.
1574 void ldlm_resource_insert_lock_after(struct ldlm_lock *original,
1575 struct ldlm_lock *new)
1577 struct ldlm_resource *res = original->l_resource;
1579 check_res_locked(res);
1581 ldlm_resource_dump(D_INFO, res);
1582 LDLM_DEBUG(new, "About to insert this lock after %p: ", original);
1584 if (ldlm_is_destroyed(new)) {
1585 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
1589 LASSERT(list_empty(&new->l_res_link));
1591 list_add(&new->l_res_link, &original->l_res_link);
1595 void ldlm_resource_unlink_lock(struct ldlm_lock *lock)
1597 int type = lock->l_resource->lr_type;
1599 check_res_locked(lock->l_resource);
1600 if (type == LDLM_IBITS || type == LDLM_PLAIN)
1601 ldlm_unlink_lock_skiplist(lock);
1602 else if (type == LDLM_EXTENT)
1603 ldlm_extent_unlink_lock(lock);
1604 list_del_init(&lock->l_res_link);
1606 EXPORT_SYMBOL(ldlm_resource_unlink_lock);
1608 void ldlm_res2desc(struct ldlm_resource *res, struct ldlm_resource_desc *desc)
1610 desc->lr_type = res->lr_type;
1611 desc->lr_name = res->lr_name;
1615 * Print information about all locks in all namespaces on this node to debug
1618 void ldlm_dump_all_namespaces(enum ldlm_side client, int level)
1620 struct list_head *tmp;
1622 if (!((libcfs_debug | D_ERROR) & level))
1625 mutex_lock(ldlm_namespace_lock(client));
1627 list_for_each(tmp, ldlm_namespace_list(client)) {
1628 struct ldlm_namespace *ns;
1630 ns = list_entry(tmp, struct ldlm_namespace, ns_list_chain);
1631 ldlm_namespace_dump(level, ns);
1634 mutex_unlock(ldlm_namespace_lock(client));
1637 static int ldlm_res_hash_dump(struct cfs_hash *hs, struct cfs_hash_bd *bd,
1638 struct hlist_node *hnode, void *arg)
1640 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
1641 int level = (int)(unsigned long)arg;
1644 ldlm_resource_dump(level, res);
1651 * Print information about all locks in this namespace on this node to debug
1654 void ldlm_namespace_dump(int level, struct ldlm_namespace *ns)
1656 if (!((libcfs_debug | D_ERROR) & level))
1659 CDEBUG(level, "--- Namespace: %s (rc: %d, side: %s)\n",
1660 ldlm_ns_name(ns), atomic_read(&ns->ns_bref),
1661 ns_is_client(ns) ? "client" : "server");
1663 if (ktime_get_seconds() < ns->ns_next_dump)
1666 cfs_hash_for_each_nolock(ns->ns_rs_hash,
1668 (void *)(unsigned long)level, 0);
1669 spin_lock(&ns->ns_lock);
1670 ns->ns_next_dump = ktime_get_seconds() + 10;
1671 spin_unlock(&ns->ns_lock);
1675 * Print information about all locks in this resource to debug log.
1677 void ldlm_resource_dump(int level, struct ldlm_resource *res)
1679 struct ldlm_lock *lock;
1680 unsigned int granted = 0;
1682 CLASSERT(RES_NAME_SIZE == 4);
1684 if (!((libcfs_debug | D_ERROR) & level))
1687 CDEBUG(level, "--- Resource: "DLDLMRES" (%p) refcount = %d\n",
1688 PLDLMRES(res), res, atomic_read(&res->lr_refcount));
1690 if (!list_empty(&res->lr_granted)) {
1691 CDEBUG(level, "Granted locks (in reverse order):\n");
1692 list_for_each_entry_reverse(lock, &res->lr_granted,
1694 LDLM_DEBUG_LIMIT(level, lock, "###");
1695 if (!(level & D_CANTMASK) &&
1696 ++granted > ldlm_dump_granted_max) {
1697 CDEBUG(level, "only dump %d granted locks to "
1698 "avoid DDOS.\n", granted);
1704 if (!list_empty(&res->lr_waiting)) {
1705 CDEBUG(level, "Waiting locks:\n");
1706 list_for_each_entry(lock, &res->lr_waiting, l_res_link)
1707 LDLM_DEBUG_LIMIT(level, lock, "###");
1710 EXPORT_SYMBOL(ldlm_resource_dump);