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, 2016, 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 #ifdef HAVE_SERVER_SUPPORT
193 { .name = "lock_reclaim_threshold_mb",
194 .fops = &ldlm_watermark_fops,
195 .data = &ldlm_reclaim_threshold_mb },
196 { .name = "lock_limit_mb",
197 .fops = &ldlm_watermark_fops,
198 .data = &ldlm_lock_limit_mb },
199 { .name = "lock_granted_count",
200 .fops = &ldlm_granted_fops,
201 .data = &ldlm_granted_total },
205 LASSERT(ldlm_ns_proc_dir == NULL);
207 ldlm_type_proc_dir = lprocfs_register(OBD_LDLM_DEVICENAME,
210 if (IS_ERR(ldlm_type_proc_dir)) {
211 CERROR("LProcFS failed in ldlm-init\n");
212 rc = PTR_ERR(ldlm_type_proc_dir);
216 ldlm_ns_proc_dir = lprocfs_register("namespaces",
219 if (IS_ERR(ldlm_ns_proc_dir)) {
220 CERROR("LProcFS failed in ldlm-init\n");
221 rc = PTR_ERR(ldlm_ns_proc_dir);
225 ldlm_svc_proc_dir = lprocfs_register("services",
228 if (IS_ERR(ldlm_svc_proc_dir)) {
229 CERROR("LProcFS failed in ldlm-init\n");
230 rc = PTR_ERR(ldlm_svc_proc_dir);
234 rc = lprocfs_add_vars(ldlm_type_proc_dir, list, NULL);
236 CERROR("LProcFS failed in ldlm-init\n");
243 lprocfs_remove(&ldlm_svc_proc_dir);
245 lprocfs_remove(&ldlm_ns_proc_dir);
247 lprocfs_remove(&ldlm_type_proc_dir);
249 ldlm_svc_proc_dir = NULL;
253 void ldlm_proc_cleanup(void)
255 if (ldlm_svc_proc_dir)
256 lprocfs_remove(&ldlm_svc_proc_dir);
258 if (ldlm_ns_proc_dir)
259 lprocfs_remove(&ldlm_ns_proc_dir);
261 if (ldlm_type_proc_dir)
262 lprocfs_remove(&ldlm_type_proc_dir);
265 static ssize_t resource_count_show(struct kobject *kobj, struct attribute *attr,
268 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
271 struct cfs_hash_bd bd;
274 /* result is not strictly consistant */
275 cfs_hash_for_each_bucket(ns->ns_rs_hash, &bd, i)
276 res += cfs_hash_bd_count_get(&bd);
277 return sprintf(buf, "%lld\n", res);
279 LUSTRE_RO_ATTR(resource_count);
281 static ssize_t lock_count_show(struct kobject *kobj, struct attribute *attr,
284 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
288 locks = lprocfs_stats_collector(ns->ns_stats, LDLM_NSS_LOCKS,
289 LPROCFS_FIELDS_FLAGS_SUM);
290 return sprintf(buf, "%lld\n", locks);
292 LUSTRE_RO_ATTR(lock_count);
294 static ssize_t lock_unused_count_show(struct kobject *kobj,
295 struct attribute *attr,
298 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
301 return sprintf(buf, "%d\n", ns->ns_nr_unused);
303 LUSTRE_RO_ATTR(lock_unused_count);
305 static ssize_t lru_size_show(struct kobject *kobj, struct attribute *attr,
308 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
310 __u32 *nr = &ns->ns_max_unused;
312 if (ns_connect_lru_resize(ns))
313 nr = &ns->ns_nr_unused;
314 return sprintf(buf, "%u\n", *nr);
317 static ssize_t lru_size_store(struct kobject *kobj, struct attribute *attr,
318 const char *buffer, size_t count)
320 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
326 if (strncmp(buffer, "clear", 5) == 0) {
328 "dropping all unused locks from namespace %s\n",
330 if (ns_connect_lru_resize(ns)) {
331 int canceled, unused = ns->ns_nr_unused;
333 /* Try to cancel all @ns_nr_unused locks. */
334 canceled = ldlm_cancel_lru(ns, unused, 0,
335 LDLM_LRU_FLAG_PASSED);
336 if (canceled < unused) {
338 "not all requested locks are canceled, requested: %d, canceled: %d\n",
344 tmp = ns->ns_max_unused;
345 ns->ns_max_unused = 0;
346 ldlm_cancel_lru(ns, 0, 0, LDLM_LRU_FLAG_PASSED);
347 ns->ns_max_unused = tmp;
352 err = kstrtoul(buffer, 10, &tmp);
354 CERROR("lru_size: invalid value written\n");
357 lru_resize = (tmp == 0);
359 if (ns_connect_lru_resize(ns)) {
361 ns->ns_max_unused = (unsigned int)tmp;
363 if (tmp > ns->ns_nr_unused)
364 tmp = ns->ns_nr_unused;
365 tmp = ns->ns_nr_unused - tmp;
368 "changing namespace %s unused locks from %u to %u\n",
369 ldlm_ns_name(ns), ns->ns_nr_unused,
371 ldlm_cancel_lru(ns, tmp, LCF_ASYNC, LDLM_LRU_FLAG_PASSED);
375 "disable lru_resize for namespace %s\n",
377 ns->ns_connect_flags &= ~OBD_CONNECT_LRU_RESIZE;
381 "changing namespace %s max_unused from %u to %u\n",
382 ldlm_ns_name(ns), ns->ns_max_unused,
384 ns->ns_max_unused = (unsigned int)tmp;
385 ldlm_cancel_lru(ns, 0, LCF_ASYNC, LDLM_LRU_FLAG_PASSED);
387 /* Make sure that LRU resize was originally supported before
388 * turning it on here.
391 (ns->ns_orig_connect_flags & OBD_CONNECT_LRU_RESIZE)) {
393 "enable lru_resize for namespace %s\n",
395 ns->ns_connect_flags |= OBD_CONNECT_LRU_RESIZE;
401 LUSTRE_RW_ATTR(lru_size);
403 static ssize_t lru_max_age_show(struct kobject *kobj, struct attribute *attr,
406 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
409 return sprintf(buf, "%u\n", ns->ns_max_age);
412 static ssize_t lru_max_age_store(struct kobject *kobj, struct attribute *attr,
413 const char *buffer, size_t count)
415 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
420 err = kstrtoul(buffer, 10, &tmp);
424 ns->ns_max_age = tmp;
428 LUSTRE_RW_ATTR(lru_max_age);
430 static ssize_t early_lock_cancel_show(struct kobject *kobj,
431 struct attribute *attr,
434 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
437 return sprintf(buf, "%d\n", ns_connect_cancelset(ns));
440 static ssize_t early_lock_cancel_store(struct kobject *kobj,
441 struct attribute *attr,
445 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
447 unsigned long supp = -1;
450 rc = kstrtoul(buffer, 10, &supp);
455 ns->ns_connect_flags &= ~OBD_CONNECT_CANCELSET;
456 else if (ns->ns_orig_connect_flags & OBD_CONNECT_CANCELSET)
457 ns->ns_connect_flags |= OBD_CONNECT_CANCELSET;
460 LUSTRE_RW_ATTR(early_lock_cancel);
462 #ifdef HAVE_SERVER_SUPPORT
463 static ssize_t ctime_age_limit_show(struct kobject *kobj,
464 struct attribute *attr, char *buf)
466 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
469 return sprintf(buf, "%u\n", ns->ns_ctime_age_limit);
472 static ssize_t ctime_age_limit_store(struct kobject *kobj,
473 struct attribute *attr,
474 const char *buffer, size_t count)
476 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
481 err = kstrtoul(buffer, 10, &tmp);
485 ns->ns_ctime_age_limit = tmp;
489 LUSTRE_RW_ATTR(ctime_age_limit);
491 static ssize_t lock_timeouts_show(struct kobject *kobj, struct attribute *attr,
494 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
497 return sprintf(buf, "%d\n", ns->ns_timeouts);
499 LUSTRE_RO_ATTR(lock_timeouts);
501 static ssize_t max_nolock_bytes_show(struct kobject *kobj,
502 struct attribute *attr, char *buf)
504 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
507 return sprintf(buf, "%u\n", ns->ns_max_nolock_size);
510 static ssize_t max_nolock_bytes_store(struct kobject *kobj,
511 struct attribute *attr,
512 const char *buffer, size_t count)
514 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
519 err = kstrtoul(buffer, 10, &tmp);
523 ns->ns_max_nolock_size = tmp;
527 LUSTRE_RW_ATTR(max_nolock_bytes);
529 static ssize_t contention_seconds_show(struct kobject *kobj,
530 struct attribute *attr, char *buf)
532 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
535 return sprintf(buf, "%u\n", ns->ns_contention_time);
538 static ssize_t contention_seconds_store(struct kobject *kobj,
539 struct attribute *attr,
540 const char *buffer, size_t count)
542 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
547 err = kstrtoul(buffer, 10, &tmp);
551 ns->ns_contention_time = tmp;
555 LUSTRE_RW_ATTR(contention_seconds);
557 static ssize_t contended_locks_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_contended_locks);
566 static ssize_t contended_locks_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_contended_locks = tmp;
583 LUSTRE_RW_ATTR(contended_locks);
585 static ssize_t max_parallel_ast_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, "%u\n", ns->ns_max_parallel_ast);
594 static ssize_t max_parallel_ast_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,
603 err = kstrtoul(buffer, 10, &tmp);
607 ns->ns_max_parallel_ast = tmp;
611 LUSTRE_RW_ATTR(max_parallel_ast);
613 #endif /* HAVE_SERVER_SUPPORT */
615 /* These are for namespaces in /sys/fs/lustre/ldlm/namespaces/ */
616 static struct attribute *ldlm_ns_attrs[] = {
617 &lustre_attr_resource_count.attr,
618 &lustre_attr_lock_count.attr,
619 &lustre_attr_lock_unused_count.attr,
620 &lustre_attr_lru_size.attr,
621 &lustre_attr_lru_max_age.attr,
622 &lustre_attr_early_lock_cancel.attr,
623 #ifdef HAVE_SERVER_SUPPORT
624 &lustre_attr_ctime_age_limit.attr,
625 &lustre_attr_lock_timeouts.attr,
626 &lustre_attr_max_nolock_bytes.attr,
627 &lustre_attr_contention_seconds.attr,
628 &lustre_attr_contended_locks.attr,
629 &lustre_attr_max_parallel_ast.attr,
634 static void ldlm_ns_release(struct kobject *kobj)
636 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
638 complete(&ns->ns_kobj_unregister);
641 static struct kobj_type ldlm_ns_ktype = {
642 .default_attrs = ldlm_ns_attrs,
643 .sysfs_ops = &lustre_sysfs_ops,
644 .release = ldlm_ns_release,
647 static void ldlm_namespace_proc_unregister(struct ldlm_namespace *ns)
649 if (ns->ns_proc_dir_entry == NULL)
650 CERROR("dlm namespace %s has no procfs dir?\n",
653 lprocfs_remove(&ns->ns_proc_dir_entry);
655 if (ns->ns_stats != NULL)
656 lprocfs_free_stats(&ns->ns_stats);
659 void ldlm_namespace_sysfs_unregister(struct ldlm_namespace *ns)
661 kobject_put(&ns->ns_kobj);
662 wait_for_completion(&ns->ns_kobj_unregister);
665 int ldlm_namespace_sysfs_register(struct ldlm_namespace *ns)
669 ns->ns_kobj.kset = ldlm_ns_kset;
670 init_completion(&ns->ns_kobj_unregister);
671 err = kobject_init_and_add(&ns->ns_kobj, &ldlm_ns_ktype, NULL,
672 "%s", ldlm_ns_name(ns));
674 ns->ns_stats = lprocfs_alloc_stats(LDLM_NSS_LAST, 0);
676 kobject_put(&ns->ns_kobj);
680 lprocfs_counter_init(ns->ns_stats, LDLM_NSS_LOCKS,
681 LPROCFS_CNTR_AVGMINMAX, "locks", "locks");
686 static int ldlm_namespace_proc_register(struct ldlm_namespace *ns)
688 struct proc_dir_entry *ns_pde;
691 LASSERT(ns->ns_rs_hash != NULL);
693 if (ns->ns_proc_dir_entry != NULL) {
694 ns_pde = ns->ns_proc_dir_entry;
696 ns_pde = proc_mkdir(ldlm_ns_name(ns), ldlm_ns_proc_dir);
699 ns->ns_proc_dir_entry = ns_pde;
704 #undef MAX_STRING_SIZE
705 #else /* CONFIG_PROC_FS */
707 #define ldlm_namespace_proc_unregister(ns) ({;})
708 #define ldlm_namespace_proc_register(ns) ({0;})
710 #endif /* CONFIG_PROC_FS */
712 static unsigned ldlm_res_hop_hash(struct cfs_hash *hs,
713 const void *key, unsigned mask)
715 const struct ldlm_res_id *id = key;
719 for (i = 0; i < RES_NAME_SIZE; i++)
724 static unsigned ldlm_res_hop_fid_hash(struct cfs_hash *hs,
725 const void *key, unsigned mask)
727 const struct ldlm_res_id *id = key;
732 fid.f_seq = id->name[LUSTRE_RES_ID_SEQ_OFF];
733 fid.f_oid = (__u32)id->name[LUSTRE_RES_ID_VER_OID_OFF];
734 fid.f_ver = (__u32)(id->name[LUSTRE_RES_ID_VER_OID_OFF] >> 32);
736 hash = fid_flatten32(&fid);
737 hash += (hash >> 4) + (hash << 12); /* mixing oid and seq */
738 if (id->name[LUSTRE_RES_ID_HSH_OFF] != 0) {
739 val = id->name[LUSTRE_RES_ID_HSH_OFF];
740 hash += (val >> 5) + (val << 11);
744 hash = hash_long(hash, hs->hs_bkt_bits);
745 /* give me another random factor */
746 hash -= hash_long((unsigned long)hs, val % 11 + 3);
748 hash <<= hs->hs_cur_bits - hs->hs_bkt_bits;
749 hash |= ldlm_res_hop_hash(hs, key, CFS_HASH_NBKT(hs) - 1);
754 static void *ldlm_res_hop_key(struct hlist_node *hnode)
756 struct ldlm_resource *res;
758 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
759 return &res->lr_name;
762 static int ldlm_res_hop_keycmp(const void *key, struct hlist_node *hnode)
764 struct ldlm_resource *res;
766 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
767 return ldlm_res_eq((const struct ldlm_res_id *)key,
768 (const struct ldlm_res_id *)&res->lr_name);
771 static void *ldlm_res_hop_object(struct hlist_node *hnode)
773 return hlist_entry(hnode, struct ldlm_resource, lr_hash);
777 ldlm_res_hop_get_locked(struct cfs_hash *hs, struct hlist_node *hnode)
779 struct ldlm_resource *res;
781 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
782 ldlm_resource_getref(res);
785 static void ldlm_res_hop_put(struct cfs_hash *hs, struct hlist_node *hnode)
787 struct ldlm_resource *res;
789 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
790 ldlm_resource_putref(res);
793 static struct cfs_hash_ops ldlm_ns_hash_ops = {
794 .hs_hash = ldlm_res_hop_hash,
795 .hs_key = ldlm_res_hop_key,
796 .hs_keycmp = ldlm_res_hop_keycmp,
798 .hs_object = ldlm_res_hop_object,
799 .hs_get = ldlm_res_hop_get_locked,
800 .hs_put = ldlm_res_hop_put
803 static struct cfs_hash_ops ldlm_ns_fid_hash_ops = {
804 .hs_hash = ldlm_res_hop_fid_hash,
805 .hs_key = ldlm_res_hop_key,
806 .hs_keycmp = ldlm_res_hop_keycmp,
808 .hs_object = ldlm_res_hop_object,
809 .hs_get = ldlm_res_hop_get_locked,
810 .hs_put = ldlm_res_hop_put
813 typedef struct ldlm_ns_hash_def {
814 enum ldlm_ns_type nsd_type;
815 /** hash bucket bits */
816 unsigned nsd_bkt_bits;
818 unsigned nsd_all_bits;
819 /** hash operations */
820 struct cfs_hash_ops *nsd_hops;
821 } ldlm_ns_hash_def_t;
823 static struct ldlm_ns_hash_def ldlm_ns_hash_defs[] =
826 .nsd_type = LDLM_NS_TYPE_MDC,
829 .nsd_hops = &ldlm_ns_fid_hash_ops,
832 .nsd_type = LDLM_NS_TYPE_MDT,
835 .nsd_hops = &ldlm_ns_fid_hash_ops,
838 .nsd_type = LDLM_NS_TYPE_OSC,
841 .nsd_hops = &ldlm_ns_hash_ops,
844 .nsd_type = LDLM_NS_TYPE_OST,
847 .nsd_hops = &ldlm_ns_hash_ops,
850 .nsd_type = LDLM_NS_TYPE_MGC,
853 .nsd_hops = &ldlm_ns_hash_ops,
856 .nsd_type = LDLM_NS_TYPE_MGT,
859 .nsd_hops = &ldlm_ns_hash_ops,
862 .nsd_type = LDLM_NS_TYPE_UNKNOWN,
867 * Create and initialize new empty namespace.
869 struct ldlm_namespace *ldlm_namespace_new(struct obd_device *obd, char *name,
870 enum ldlm_side client,
871 enum ldlm_appetite apt,
872 enum ldlm_ns_type ns_type)
874 struct ldlm_namespace *ns = NULL;
875 struct ldlm_ns_bucket *nsb;
876 struct ldlm_ns_hash_def *nsd;
877 struct cfs_hash_bd bd;
882 LASSERT(obd != NULL);
886 CERROR("ldlm_get_ref failed: %d\n", rc);
890 for (idx = 0;;idx++) {
891 nsd = &ldlm_ns_hash_defs[idx];
892 if (nsd->nsd_type == LDLM_NS_TYPE_UNKNOWN) {
893 CERROR("Unknown type %d for ns %s\n", ns_type, name);
897 if (nsd->nsd_type == ns_type)
905 ns->ns_rs_hash = cfs_hash_create(name,
906 nsd->nsd_all_bits, nsd->nsd_all_bits,
907 nsd->nsd_bkt_bits, sizeof(*nsb),
913 CFS_HASH_SPIN_BKTLOCK |
914 CFS_HASH_NO_ITEMREF);
915 if (ns->ns_rs_hash == NULL)
918 cfs_hash_for_each_bucket(ns->ns_rs_hash, &bd, idx) {
919 nsb = cfs_hash_bd_extra_get(ns->ns_rs_hash, &bd);
920 at_init(&nsb->nsb_at_estimate, ldlm_enqueue_min, 0);
921 nsb->nsb_namespace = ns;
922 nsb->nsb_reclaim_start = 0;
926 ns->ns_appetite = apt;
927 ns->ns_client = client;
929 INIT_LIST_HEAD(&ns->ns_list_chain);
930 INIT_LIST_HEAD(&ns->ns_unused_list);
931 spin_lock_init(&ns->ns_lock);
932 atomic_set(&ns->ns_bref, 0);
933 init_waitqueue_head(&ns->ns_waitq);
935 ns->ns_max_nolock_size = NS_DEFAULT_MAX_NOLOCK_BYTES;
936 ns->ns_contention_time = NS_DEFAULT_CONTENTION_SECONDS;
937 ns->ns_contended_locks = NS_DEFAULT_CONTENDED_LOCKS;
939 ns->ns_max_parallel_ast = LDLM_DEFAULT_PARALLEL_AST_LIMIT;
940 ns->ns_nr_unused = 0;
941 ns->ns_max_unused = LDLM_DEFAULT_LRU_SIZE;
942 ns->ns_max_age = LDLM_DEFAULT_MAX_ALIVE;
943 ns->ns_ctime_age_limit = LDLM_CTIME_AGE_LIMIT;
945 ns->ns_orig_connect_flags = 0;
946 ns->ns_connect_flags = 0;
948 ns->ns_reclaim_start = 0;
950 rc = ldlm_namespace_sysfs_register(ns);
952 CERROR("Can't initialize ns sysfs, rc %d\n", rc);
956 rc = ldlm_namespace_proc_register(ns);
958 CERROR("Can't initialize ns proc, rc %d\n", rc);
962 idx = ldlm_namespace_nr_read(client);
963 rc = ldlm_pool_init(&ns->ns_pool, ns, idx, client);
965 CERROR("Can't initialize lock pool, rc %d\n", rc);
969 ldlm_namespace_register(ns, client);
972 ldlm_namespace_proc_unregister(ns);
974 ldlm_namespace_sysfs_unregister(ns);
975 ldlm_namespace_cleanup(ns, 0);
977 cfs_hash_putref(ns->ns_rs_hash);
984 EXPORT_SYMBOL(ldlm_namespace_new);
986 extern struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock);
989 * Cancel and destroy all locks on a resource.
991 * If flags contains FL_LOCAL_ONLY, don't try to tell the server, just
992 * clean up. This is currently only used for recovery, and we make
993 * certain assumptions as a result--notably, that we shouldn't cancel
996 static void cleanup_resource(struct ldlm_resource *res, struct list_head *q,
999 struct list_head *tmp;
1000 int rc = 0, client = ns_is_client(ldlm_res_to_ns(res));
1001 bool local_only = !!(flags & LDLM_FL_LOCAL_ONLY);
1004 struct ldlm_lock *lock = NULL;
1006 /* First, we look for non-cleaned-yet lock
1007 * all cleaned locks are marked by CLEANED flag. */
1009 list_for_each(tmp, q) {
1010 lock = list_entry(tmp, struct ldlm_lock,
1012 if (ldlm_is_cleaned(lock)) {
1016 LDLM_LOCK_GET(lock);
1017 ldlm_set_cleaned(lock);
1026 /* Set CBPENDING so nothing in the cancellation path
1027 * can match this lock. */
1028 ldlm_set_cbpending(lock);
1029 ldlm_set_failed(lock);
1030 lock->l_flags |= flags;
1032 /* ... without sending a CANCEL message for local_only. */
1034 ldlm_set_local_only(lock);
1036 if (local_only && (lock->l_readers || lock->l_writers)) {
1037 /* This is a little bit gross, but much better than the
1038 * alternative: pretend that we got a blocking AST from
1039 * the server, so that when the lock is decref'd, it
1040 * will go away ... */
1042 LDLM_DEBUG(lock, "setting FL_LOCAL_ONLY");
1043 if (lock->l_flags & LDLM_FL_FAIL_LOC) {
1044 set_current_state(TASK_UNINTERRUPTIBLE);
1045 schedule_timeout(cfs_time_seconds(4));
1046 set_current_state(TASK_RUNNING);
1048 if (lock->l_completion_ast)
1049 lock->l_completion_ast(lock,
1050 LDLM_FL_FAILED, NULL);
1051 LDLM_LOCK_RELEASE(lock);
1056 struct lustre_handle lockh;
1059 ldlm_lock2handle(lock, &lockh);
1060 rc = ldlm_cli_cancel(&lockh, LCF_LOCAL);
1062 CERROR("ldlm_cli_cancel: %d\n", rc);
1065 LDLM_DEBUG(lock, "Freeing a lock still held by a "
1067 ldlm_lock_cancel(lock);
1069 LDLM_LOCK_RELEASE(lock);
1073 static int ldlm_resource_clean(struct cfs_hash *hs, struct cfs_hash_bd *bd,
1074 struct hlist_node *hnode, void *arg)
1076 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
1077 __u64 flags = *(__u64 *)arg;
1079 cleanup_resource(res, &res->lr_granted, flags);
1080 cleanup_resource(res, &res->lr_converting, flags);
1081 cleanup_resource(res, &res->lr_waiting, flags);
1086 static int ldlm_resource_complain(struct cfs_hash *hs, struct cfs_hash_bd *bd,
1087 struct hlist_node *hnode, void *arg)
1089 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
1092 CERROR("%s: namespace resource "DLDLMRES" (%p) refcount nonzero "
1093 "(%d) after lock cleanup; forcing cleanup.\n",
1094 ldlm_ns_name(ldlm_res_to_ns(res)), PLDLMRES(res), res,
1095 atomic_read(&res->lr_refcount) - 1);
1097 ldlm_resource_dump(D_ERROR, res);
1103 * Cancel and destroy all locks in the namespace.
1105 * Typically used during evictions when server notified client that it was
1106 * evicted and all of its state needs to be destroyed.
1107 * Also used during shutdown.
1109 int ldlm_namespace_cleanup(struct ldlm_namespace *ns, __u64 flags)
1112 CDEBUG(D_INFO, "NULL ns, skipping cleanup\n");
1116 cfs_hash_for_each_nolock(ns->ns_rs_hash, ldlm_resource_clean,
1118 cfs_hash_for_each_nolock(ns->ns_rs_hash, ldlm_resource_complain,
1122 EXPORT_SYMBOL(ldlm_namespace_cleanup);
1125 * Attempts to free namespace.
1127 * Only used when namespace goes away, like during an unmount.
1129 static int __ldlm_namespace_free(struct ldlm_namespace *ns, int force)
1133 /* At shutdown time, don't call the cancellation callback */
1134 ldlm_namespace_cleanup(ns, force ? LDLM_FL_LOCAL_ONLY : 0);
1136 if (atomic_read(&ns->ns_bref) > 0) {
1137 struct l_wait_info lwi = LWI_INTR(LWI_ON_SIGNAL_NOOP, NULL);
1140 "dlm namespace %s free waiting on refcount %d\n",
1141 ldlm_ns_name(ns), atomic_read(&ns->ns_bref));
1144 lwi = LWI_TIMEOUT(msecs_to_jiffies(obd_timeout *
1145 MSEC_PER_SEC) / 4, NULL, NULL);
1147 rc = l_wait_event(ns->ns_waitq,
1148 atomic_read(&ns->ns_bref) == 0, &lwi);
1150 /* Forced cleanups should be able to reclaim all references,
1151 * so it's safe to wait forever... we can't leak locks... */
1152 if (force && rc == -ETIMEDOUT) {
1153 LCONSOLE_ERROR("Forced cleanup waiting for %s "
1154 "namespace with %d resources in use, "
1155 "(rc=%d)\n", ldlm_ns_name(ns),
1156 atomic_read(&ns->ns_bref), rc);
1157 GOTO(force_wait, rc);
1160 if (atomic_read(&ns->ns_bref)) {
1161 LCONSOLE_ERROR("Cleanup waiting for %s namespace "
1162 "with %d resources in use, (rc=%d)\n",
1164 atomic_read(&ns->ns_bref), rc);
1165 RETURN(ELDLM_NAMESPACE_EXISTS);
1167 CDEBUG(D_DLMTRACE, "dlm namespace %s free done waiting\n",
1175 * Performs various cleanups for passed \a ns to make it drop refc and be
1176 * ready for freeing. Waits for refc == 0.
1178 * The following is done:
1179 * (0) Unregister \a ns from its list to make inaccessible for potential
1180 * users like pools thread and others;
1181 * (1) Clear all locks in \a ns.
1183 void ldlm_namespace_free_prior(struct ldlm_namespace *ns,
1184 struct obd_import *imp,
1194 spin_lock(&ns->ns_lock);
1195 ns->ns_stopping = 1;
1196 spin_unlock(&ns->ns_lock);
1199 * Can fail with -EINTR when force == 0 in which case try harder.
1201 rc = __ldlm_namespace_free(ns, force);
1202 if (rc != ELDLM_OK) {
1204 ptlrpc_disconnect_import(imp, 0);
1205 ptlrpc_invalidate_import(imp);
1209 * With all requests dropped and the import inactive
1210 * we are gaurenteed all reference will be dropped.
1212 rc = __ldlm_namespace_free(ns, 1);
1217 EXPORT_SYMBOL(ldlm_namespace_free_prior);
1220 * Performs freeing memory structures related to \a ns. This is only done
1221 * when ldlm_namespce_free_prior() successfully removed all resources
1222 * referencing \a ns and its refc == 0.
1224 void ldlm_namespace_free_post(struct ldlm_namespace *ns)
1232 /* Make sure that nobody can find this ns in its list. */
1233 ldlm_namespace_unregister(ns, ns->ns_client);
1234 /* Fini pool _before_ parent proc dir is removed. This is important as
1235 * ldlm_pool_fini() removes own proc dir which is child to @dir.
1236 * Removing it after @dir may cause oops. */
1237 ldlm_pool_fini(&ns->ns_pool);
1239 ldlm_namespace_proc_unregister(ns);
1240 ldlm_namespace_sysfs_unregister(ns);
1241 cfs_hash_putref(ns->ns_rs_hash);
1242 /* Namespace \a ns should be not on list at this time, otherwise
1243 * this will cause issues related to using freed \a ns in poold
1245 LASSERT(list_empty(&ns->ns_list_chain));
1250 EXPORT_SYMBOL(ldlm_namespace_free_post);
1253 * Cleanup the resource, and free namespace.
1256 * proc1: destroy import
1257 * class_disconnect_export(grab cl_sem) ->
1258 * -> ldlm_namespace_free ->
1259 * -> lprocfs_remove(grab _lprocfs_lock).
1260 * proc2: read proc info
1261 * lprocfs_fops_read(grab _lprocfs_lock) ->
1262 * -> osc_rd_active, etc(grab cl_sem).
1264 * So that I have to split the ldlm_namespace_free into two parts - the first
1265 * part ldlm_namespace_free_prior is used to cleanup the resource which is
1266 * being used; the 2nd part ldlm_namespace_free_post is used to unregister the
1267 * lprocfs entries, and then free memory. It will be called w/o cli->cl_sem
1270 void ldlm_namespace_free(struct ldlm_namespace *ns,
1271 struct obd_import *imp,
1274 ldlm_namespace_free_prior(ns, imp, force);
1275 ldlm_namespace_free_post(ns);
1277 EXPORT_SYMBOL(ldlm_namespace_free);
1279 void ldlm_namespace_get(struct ldlm_namespace *ns)
1281 atomic_inc(&ns->ns_bref);
1284 /* This is only for callers that care about refcount */
1285 static int ldlm_namespace_get_return(struct ldlm_namespace *ns)
1287 return atomic_inc_return(&ns->ns_bref);
1290 void ldlm_namespace_put(struct ldlm_namespace *ns)
1292 if (atomic_dec_and_lock(&ns->ns_bref, &ns->ns_lock)) {
1293 wake_up(&ns->ns_waitq);
1294 spin_unlock(&ns->ns_lock);
1298 /** Register \a ns in the list of namespaces */
1299 void ldlm_namespace_register(struct ldlm_namespace *ns, enum ldlm_side client)
1301 mutex_lock(ldlm_namespace_lock(client));
1302 LASSERT(list_empty(&ns->ns_list_chain));
1303 list_add(&ns->ns_list_chain, ldlm_namespace_inactive_list(client));
1304 ldlm_namespace_nr_inc(client);
1305 mutex_unlock(ldlm_namespace_lock(client));
1308 /** Unregister \a ns from the list of namespaces. */
1309 void ldlm_namespace_unregister(struct ldlm_namespace *ns, enum ldlm_side client)
1311 mutex_lock(ldlm_namespace_lock(client));
1312 LASSERT(!list_empty(&ns->ns_list_chain));
1313 /* Some asserts and possibly other parts of the code are still
1314 * using list_empty(&ns->ns_list_chain). This is why it is
1315 * important to use list_del_init() here. */
1316 list_del_init(&ns->ns_list_chain);
1317 ldlm_namespace_nr_dec(client);
1318 mutex_unlock(ldlm_namespace_lock(client));
1321 /** Should be called with ldlm_namespace_lock(client) taken. */
1322 void ldlm_namespace_move_to_active_locked(struct ldlm_namespace *ns,
1323 enum ldlm_side client)
1325 LASSERT(!list_empty(&ns->ns_list_chain));
1326 LASSERT(mutex_is_locked(ldlm_namespace_lock(client)));
1327 list_move_tail(&ns->ns_list_chain, ldlm_namespace_list(client));
1330 /** Should be called with ldlm_namespace_lock(client) taken. */
1331 void ldlm_namespace_move_to_inactive_locked(struct ldlm_namespace *ns,
1332 enum ldlm_side client)
1334 LASSERT(!list_empty(&ns->ns_list_chain));
1335 LASSERT(mutex_is_locked(ldlm_namespace_lock(client)));
1336 list_move_tail(&ns->ns_list_chain,
1337 ldlm_namespace_inactive_list(client));
1340 /** Should be called with ldlm_namespace_lock(client) taken. */
1341 struct ldlm_namespace *ldlm_namespace_first_locked(enum ldlm_side client)
1343 LASSERT(mutex_is_locked(ldlm_namespace_lock(client)));
1344 LASSERT(!list_empty(ldlm_namespace_list(client)));
1345 return container_of(ldlm_namespace_list(client)->next,
1346 struct ldlm_namespace, ns_list_chain);
1349 /** Create and initialize new resource. */
1350 static struct ldlm_resource *ldlm_resource_new(enum ldlm_type ldlm_type)
1352 struct ldlm_resource *res;
1355 OBD_SLAB_ALLOC_PTR_GFP(res, ldlm_resource_slab, GFP_NOFS);
1359 if (ldlm_type == LDLM_EXTENT) {
1360 OBD_SLAB_ALLOC(res->lr_itree, ldlm_interval_tree_slab,
1361 sizeof(*res->lr_itree) * LCK_MODE_NUM);
1362 if (res->lr_itree == NULL) {
1363 OBD_SLAB_FREE_PTR(res, ldlm_resource_slab);
1366 /* Initialize interval trees for each lock mode. */
1367 for (idx = 0; idx < LCK_MODE_NUM; idx++) {
1368 res->lr_itree[idx].lit_size = 0;
1369 res->lr_itree[idx].lit_mode = 1 << idx;
1370 res->lr_itree[idx].lit_root = NULL;
1374 INIT_LIST_HEAD(&res->lr_granted);
1375 INIT_LIST_HEAD(&res->lr_converting);
1376 INIT_LIST_HEAD(&res->lr_waiting);
1378 atomic_set(&res->lr_refcount, 1);
1379 spin_lock_init(&res->lr_lock);
1380 lu_ref_init(&res->lr_reference);
1382 /* Since LVB init can be delayed now, there is no longer need to
1383 * immediatelly acquire mutex here. */
1384 mutex_init(&res->lr_lvb_mutex);
1385 res->lr_lvb_initialized = false;
1391 * Return a reference to resource with given name, creating it if necessary.
1392 * Args: namespace with ns_lock unlocked
1393 * Locks: takes and releases NS hash-lock and res->lr_lock
1394 * Returns: referenced, unlocked ldlm_resource or NULL
1396 struct ldlm_resource *
1397 ldlm_resource_get(struct ldlm_namespace *ns, struct ldlm_resource *parent,
1398 const struct ldlm_res_id *name, enum ldlm_type type,
1401 struct hlist_node *hnode;
1402 struct ldlm_resource *res = NULL;
1403 struct cfs_hash_bd bd;
1405 int ns_refcount = 0;
1407 LASSERT(ns != NULL);
1408 LASSERT(parent == NULL);
1409 LASSERT(ns->ns_rs_hash != NULL);
1410 LASSERT(name->name[0] != 0);
1412 cfs_hash_bd_get_and_lock(ns->ns_rs_hash, (void *)name, &bd, 0);
1413 hnode = cfs_hash_bd_lookup_locked(ns->ns_rs_hash, &bd, (void *)name);
1414 if (hnode != NULL) {
1415 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 0);
1419 version = cfs_hash_bd_version_get(&bd);
1420 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 0);
1423 return ERR_PTR(-ENOENT);
1425 LASSERTF(type >= LDLM_MIN_TYPE && type < LDLM_MAX_TYPE,
1426 "type: %d\n", type);
1427 res = ldlm_resource_new(type);
1429 return ERR_PTR(-ENOMEM);
1431 res->lr_ns_bucket = cfs_hash_bd_extra_get(ns->ns_rs_hash, &bd);
1432 res->lr_name = *name;
1433 res->lr_type = type;
1435 cfs_hash_bd_lock(ns->ns_rs_hash, &bd, 1);
1436 hnode = (version == cfs_hash_bd_version_get(&bd)) ? NULL :
1437 cfs_hash_bd_lookup_locked(ns->ns_rs_hash, &bd, (void *)name);
1439 if (hnode != NULL) {
1440 /* Someone won the race and already added the resource. */
1441 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
1442 /* Clean lu_ref for failed resource. */
1443 lu_ref_fini(&res->lr_reference);
1444 if (res->lr_itree != NULL)
1445 OBD_SLAB_FREE(res->lr_itree, ldlm_interval_tree_slab,
1446 sizeof(*res->lr_itree) * LCK_MODE_NUM);
1447 OBD_SLAB_FREE(res, ldlm_resource_slab, sizeof *res);
1449 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
1452 /* We won! Let's add the resource. */
1453 cfs_hash_bd_add_locked(ns->ns_rs_hash, &bd, &res->lr_hash);
1454 if (cfs_hash_bd_count_get(&bd) == 1)
1455 ns_refcount = ldlm_namespace_get_return(ns);
1457 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
1459 OBD_FAIL_TIMEOUT(OBD_FAIL_LDLM_CREATE_RESOURCE, 2);
1461 /* Let's see if we happened to be the very first resource in this
1462 * namespace. If so, and this is a client namespace, we need to move
1463 * the namespace into the active namespaces list to be patrolled by
1464 * the ldlm_poold. */
1465 if (ns_is_client(ns) && ns_refcount == 1) {
1466 mutex_lock(ldlm_namespace_lock(LDLM_NAMESPACE_CLIENT));
1467 ldlm_namespace_move_to_active_locked(ns, LDLM_NAMESPACE_CLIENT);
1468 mutex_unlock(ldlm_namespace_lock(LDLM_NAMESPACE_CLIENT));
1473 EXPORT_SYMBOL(ldlm_resource_get);
1475 struct ldlm_resource *ldlm_resource_getref(struct ldlm_resource *res)
1477 LASSERT(res != NULL);
1478 LASSERT(res != LP_POISON);
1479 atomic_inc(&res->lr_refcount);
1480 CDEBUG(D_INFO, "getref res: %p count: %d\n", res,
1481 atomic_read(&res->lr_refcount));
1485 static void __ldlm_resource_putref_final(struct cfs_hash_bd *bd,
1486 struct ldlm_resource *res)
1488 struct ldlm_ns_bucket *nsb = res->lr_ns_bucket;
1490 if (!list_empty(&res->lr_granted)) {
1491 ldlm_resource_dump(D_ERROR, res);
1495 if (!list_empty(&res->lr_converting)) {
1496 ldlm_resource_dump(D_ERROR, res);
1500 if (!list_empty(&res->lr_waiting)) {
1501 ldlm_resource_dump(D_ERROR, res);
1505 cfs_hash_bd_del_locked(nsb->nsb_namespace->ns_rs_hash,
1507 lu_ref_fini(&res->lr_reference);
1508 if (cfs_hash_bd_count_get(bd) == 0)
1509 ldlm_namespace_put(nsb->nsb_namespace);
1512 /* Returns 1 if the resource was freed, 0 if it remains. */
1513 int ldlm_resource_putref(struct ldlm_resource *res)
1515 struct ldlm_namespace *ns = ldlm_res_to_ns(res);
1516 struct cfs_hash_bd bd;
1518 LASSERT_ATOMIC_GT_LT(&res->lr_refcount, 0, LI_POISON);
1519 CDEBUG(D_INFO, "putref res: %p count: %d\n",
1520 res, atomic_read(&res->lr_refcount) - 1);
1522 cfs_hash_bd_get(ns->ns_rs_hash, &res->lr_name, &bd);
1523 if (cfs_hash_bd_dec_and_lock(ns->ns_rs_hash, &bd, &res->lr_refcount)) {
1524 __ldlm_resource_putref_final(&bd, res);
1525 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
1526 if (ns->ns_lvbo && ns->ns_lvbo->lvbo_free)
1527 ns->ns_lvbo->lvbo_free(res);
1528 if (res->lr_itree != NULL)
1529 OBD_SLAB_FREE(res->lr_itree, ldlm_interval_tree_slab,
1530 sizeof(*res->lr_itree) * LCK_MODE_NUM);
1531 OBD_SLAB_FREE(res, ldlm_resource_slab, sizeof *res);
1536 EXPORT_SYMBOL(ldlm_resource_putref);
1539 * Add a lock into a given resource into specified lock list.
1541 void ldlm_resource_add_lock(struct ldlm_resource *res, struct list_head *head,
1542 struct ldlm_lock *lock)
1544 check_res_locked(res);
1546 LDLM_DEBUG(lock, "About to add this lock");
1548 if (ldlm_is_destroyed(lock)) {
1549 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
1553 LASSERT(list_empty(&lock->l_res_link));
1555 list_add_tail(&lock->l_res_link, head);
1559 * Insert a lock into resource after specified lock.
1561 * Obtain resource description from the lock we are inserting after.
1563 void ldlm_resource_insert_lock_after(struct ldlm_lock *original,
1564 struct ldlm_lock *new)
1566 struct ldlm_resource *res = original->l_resource;
1568 check_res_locked(res);
1570 ldlm_resource_dump(D_INFO, res);
1571 LDLM_DEBUG(new, "About to insert this lock after %p: ", original);
1573 if (ldlm_is_destroyed(new)) {
1574 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
1578 LASSERT(list_empty(&new->l_res_link));
1580 list_add(&new->l_res_link, &original->l_res_link);
1584 void ldlm_resource_unlink_lock(struct ldlm_lock *lock)
1586 int type = lock->l_resource->lr_type;
1588 check_res_locked(lock->l_resource);
1589 if (type == LDLM_IBITS || type == LDLM_PLAIN)
1590 ldlm_unlink_lock_skiplist(lock);
1591 else if (type == LDLM_EXTENT)
1592 ldlm_extent_unlink_lock(lock);
1593 list_del_init(&lock->l_res_link);
1595 EXPORT_SYMBOL(ldlm_resource_unlink_lock);
1597 void ldlm_res2desc(struct ldlm_resource *res, struct ldlm_resource_desc *desc)
1599 desc->lr_type = res->lr_type;
1600 desc->lr_name = res->lr_name;
1604 * Print information about all locks in all namespaces on this node to debug
1607 void ldlm_dump_all_namespaces(enum ldlm_side client, int level)
1609 struct list_head *tmp;
1611 if (!((libcfs_debug | D_ERROR) & level))
1614 mutex_lock(ldlm_namespace_lock(client));
1616 list_for_each(tmp, ldlm_namespace_list(client)) {
1617 struct ldlm_namespace *ns;
1619 ns = list_entry(tmp, struct ldlm_namespace, ns_list_chain);
1620 ldlm_namespace_dump(level, ns);
1623 mutex_unlock(ldlm_namespace_lock(client));
1626 static int ldlm_res_hash_dump(struct cfs_hash *hs, struct cfs_hash_bd *bd,
1627 struct hlist_node *hnode, void *arg)
1629 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
1630 int level = (int)(unsigned long)arg;
1633 ldlm_resource_dump(level, res);
1640 * Print information about all locks in this namespace on this node to debug
1643 void ldlm_namespace_dump(int level, struct ldlm_namespace *ns)
1645 if (!((libcfs_debug | D_ERROR) & level))
1648 CDEBUG(level, "--- Namespace: %s (rc: %d, side: %s)\n",
1649 ldlm_ns_name(ns), atomic_read(&ns->ns_bref),
1650 ns_is_client(ns) ? "client" : "server");
1652 if (cfs_time_before(cfs_time_current(), ns->ns_next_dump))
1655 cfs_hash_for_each_nolock(ns->ns_rs_hash,
1657 (void *)(unsigned long)level, 0);
1658 spin_lock(&ns->ns_lock);
1659 ns->ns_next_dump = cfs_time_shift(10);
1660 spin_unlock(&ns->ns_lock);
1664 * Print information about all locks in this resource to debug log.
1666 void ldlm_resource_dump(int level, struct ldlm_resource *res)
1668 struct ldlm_lock *lock;
1669 unsigned int granted = 0;
1671 CLASSERT(RES_NAME_SIZE == 4);
1673 if (!((libcfs_debug | D_ERROR) & level))
1676 CDEBUG(level, "--- Resource: "DLDLMRES" (%p) refcount = %d\n",
1677 PLDLMRES(res), res, atomic_read(&res->lr_refcount));
1679 if (!list_empty(&res->lr_granted)) {
1680 CDEBUG(level, "Granted locks (in reverse order):\n");
1681 list_for_each_entry_reverse(lock, &res->lr_granted,
1683 LDLM_DEBUG_LIMIT(level, lock, "###");
1684 if (!(level & D_CANTMASK) &&
1685 ++granted > ldlm_dump_granted_max) {
1686 CDEBUG(level, "only dump %d granted locks to "
1687 "avoid DDOS.\n", granted);
1692 if (!list_empty(&res->lr_converting)) {
1693 CDEBUG(level, "Converting locks:\n");
1694 list_for_each_entry(lock, &res->lr_converting, l_res_link)
1695 LDLM_DEBUG_LIMIT(level, lock, "###");
1697 if (!list_empty(&res->lr_waiting)) {
1698 CDEBUG(level, "Waiting locks:\n");
1699 list_for_each_entry(lock, &res->lr_waiting, l_res_link)
1700 LDLM_DEBUG_LIMIT(level, lock, "###");
1703 EXPORT_SYMBOL(ldlm_resource_dump);