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 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 LPROC_SEQ_FOPS_RW_TYPE(ldlm_rw, uint);
82 #ifdef HAVE_SERVER_SUPPORT
84 static int seq_watermark_show(struct seq_file *m, void *data)
86 seq_printf(m, "%llu\n", *(__u64 *)m->private);
90 static ssize_t seq_watermark_write(struct file *file,
91 const char __user *buffer, size_t count,
96 __u64 *data = ((struct seq_file *)file->private_data)->private;
97 bool wm_low = (data == &ldlm_reclaim_threshold_mb) ? true : false;
100 rc = lprocfs_str_with_units_to_s64(buffer, count, &value, 'M');
102 CERROR("Failed to set %s, rc = %d.\n",
103 wm_low ? "lock_reclaim_threshold_mb" : "lock_limit_mb",
106 } else if (value != 0 && value < (1 << 20)) {
107 CERROR("%s should be greater than 1MB.\n",
108 wm_low ? "lock_reclaim_threshold_mb" : "lock_limit_mb");
111 watermark = value >> 20;
114 if (ldlm_lock_limit_mb != 0 && watermark > ldlm_lock_limit_mb) {
115 CERROR("lock_reclaim_threshold_mb must be smaller than "
121 if (watermark != 0) {
123 do_div(watermark, sizeof(struct ldlm_lock));
125 ldlm_reclaim_threshold = watermark;
127 if (ldlm_reclaim_threshold_mb != 0 &&
128 watermark < ldlm_reclaim_threshold_mb) {
129 CERROR("lock_limit_mb must be greater than "
130 "lock_reclaim_threshold_mb.\n");
135 if (watermark != 0) {
137 do_div(watermark, sizeof(struct ldlm_lock));
139 ldlm_lock_limit = watermark;
145 static int seq_watermark_open(struct inode *inode, struct file *file)
147 return single_open(file, seq_watermark_show, PDE_DATA(inode));
150 static const struct file_operations ldlm_watermark_fops = {
151 .owner = THIS_MODULE,
152 .open = seq_watermark_open,
154 .write = seq_watermark_write,
156 .release = lprocfs_single_release,
159 static int seq_granted_show(struct seq_file *m, void *data)
161 seq_printf(m, "%llu\n", percpu_counter_sum_positive(
162 (struct percpu_counter *)m->private));
166 static int seq_granted_open(struct inode *inode, struct file *file)
168 return single_open(file, seq_granted_show, PDE_DATA(inode));
171 static const struct file_operations ldlm_granted_fops = {
172 .owner = THIS_MODULE,
173 .open = seq_granted_open,
176 .release = seq_release,
179 #endif /* HAVE_SERVER_SUPPORT */
181 int ldlm_proc_setup(void)
184 struct lprocfs_vars list[] = {
185 { .name = "dump_namespaces",
186 .fops = &ldlm_dump_ns_fops,
188 { .name = "dump_granted_max",
189 .fops = &ldlm_rw_uint_fops,
190 .data = &ldlm_dump_granted_max },
191 #ifdef HAVE_SERVER_SUPPORT
192 { .name = "lock_reclaim_threshold_mb",
193 .fops = &ldlm_watermark_fops,
194 .data = &ldlm_reclaim_threshold_mb },
195 { .name = "lock_limit_mb",
196 .fops = &ldlm_watermark_fops,
197 .data = &ldlm_lock_limit_mb },
198 { .name = "lock_granted_count",
199 .fops = &ldlm_granted_fops,
200 .data = &ldlm_granted_total },
204 LASSERT(ldlm_ns_proc_dir == NULL);
206 ldlm_type_proc_dir = lprocfs_register(OBD_LDLM_DEVICENAME,
209 if (IS_ERR(ldlm_type_proc_dir)) {
210 CERROR("LProcFS failed in ldlm-init\n");
211 rc = PTR_ERR(ldlm_type_proc_dir);
215 ldlm_ns_proc_dir = lprocfs_register("namespaces",
218 if (IS_ERR(ldlm_ns_proc_dir)) {
219 CERROR("LProcFS failed in ldlm-init\n");
220 rc = PTR_ERR(ldlm_ns_proc_dir);
224 ldlm_svc_proc_dir = lprocfs_register("services",
227 if (IS_ERR(ldlm_svc_proc_dir)) {
228 CERROR("LProcFS failed in ldlm-init\n");
229 rc = PTR_ERR(ldlm_svc_proc_dir);
233 rc = lprocfs_add_vars(ldlm_type_proc_dir, list, NULL);
235 CERROR("LProcFS failed in ldlm-init\n");
242 lprocfs_remove(&ldlm_svc_proc_dir);
244 lprocfs_remove(&ldlm_ns_proc_dir);
246 lprocfs_remove(&ldlm_type_proc_dir);
248 ldlm_svc_proc_dir = NULL;
252 void ldlm_proc_cleanup(void)
254 if (ldlm_svc_proc_dir)
255 lprocfs_remove(&ldlm_svc_proc_dir);
257 if (ldlm_ns_proc_dir)
258 lprocfs_remove(&ldlm_ns_proc_dir);
260 if (ldlm_type_proc_dir)
261 lprocfs_remove(&ldlm_type_proc_dir);
264 static ssize_t resource_count_show(struct kobject *kobj, struct attribute *attr,
267 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
270 struct cfs_hash_bd bd;
273 /* result is not strictly consistant */
274 cfs_hash_for_each_bucket(ns->ns_rs_hash, &bd, i)
275 res += cfs_hash_bd_count_get(&bd);
276 return sprintf(buf, "%lld\n", res);
278 LUSTRE_RO_ATTR(resource_count);
280 static ssize_t lock_count_show(struct kobject *kobj, struct attribute *attr,
283 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
287 locks = lprocfs_stats_collector(ns->ns_stats, LDLM_NSS_LOCKS,
288 LPROCFS_FIELDS_FLAGS_SUM);
289 return sprintf(buf, "%lld\n", locks);
291 LUSTRE_RO_ATTR(lock_count);
293 static ssize_t lock_unused_count_show(struct kobject *kobj,
294 struct attribute *attr,
297 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
300 return sprintf(buf, "%d\n", ns->ns_nr_unused);
302 LUSTRE_RO_ATTR(lock_unused_count);
304 static ssize_t lru_size_show(struct kobject *kobj, struct attribute *attr,
307 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
309 __u32 *nr = &ns->ns_max_unused;
311 if (ns_connect_lru_resize(ns))
312 nr = &ns->ns_nr_unused;
313 return sprintf(buf, "%u\n", *nr);
316 static ssize_t lru_size_store(struct kobject *kobj, struct attribute *attr,
317 const char *buffer, size_t count)
319 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
325 if (strncmp(buffer, "clear", 5) == 0) {
327 "dropping all unused locks from namespace %s\n",
329 if (ns_connect_lru_resize(ns)) {
330 /* Try to cancel all @ns_nr_unused locks. */
331 ldlm_cancel_lru(ns, ns->ns_nr_unused, 0,
332 LDLM_LRU_FLAG_PASSED |
333 LDLM_LRU_FLAG_CLEANUP);
335 tmp = ns->ns_max_unused;
336 ns->ns_max_unused = 0;
337 ldlm_cancel_lru(ns, 0, 0, LDLM_LRU_FLAG_PASSED |
338 LDLM_LRU_FLAG_CLEANUP);
339 ns->ns_max_unused = tmp;
344 err = kstrtoul(buffer, 10, &tmp);
346 CERROR("lru_size: invalid value written\n");
349 lru_resize = (tmp == 0);
351 if (ns_connect_lru_resize(ns)) {
353 ns->ns_max_unused = (unsigned int)tmp;
355 if (tmp > ns->ns_nr_unused)
356 tmp = ns->ns_nr_unused;
357 tmp = ns->ns_nr_unused - tmp;
360 "changing namespace %s unused locks from %u to %u\n",
361 ldlm_ns_name(ns), ns->ns_nr_unused,
363 ldlm_cancel_lru(ns, tmp, LCF_ASYNC, LDLM_LRU_FLAG_PASSED);
367 "disable lru_resize for namespace %s\n",
369 ns->ns_connect_flags &= ~OBD_CONNECT_LRU_RESIZE;
373 "changing namespace %s max_unused from %u to %u\n",
374 ldlm_ns_name(ns), ns->ns_max_unused,
376 ns->ns_max_unused = (unsigned int)tmp;
377 ldlm_cancel_lru(ns, 0, LCF_ASYNC, LDLM_LRU_FLAG_PASSED);
379 /* Make sure that LRU resize was originally supported before
380 * turning it on here.
383 (ns->ns_orig_connect_flags & OBD_CONNECT_LRU_RESIZE)) {
385 "enable lru_resize for namespace %s\n",
387 ns->ns_connect_flags |= OBD_CONNECT_LRU_RESIZE;
393 LUSTRE_RW_ATTR(lru_size);
395 static ssize_t lru_max_age_show(struct kobject *kobj, struct attribute *attr,
398 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
401 return sprintf(buf, "%lld\n", ktime_to_ms(ns->ns_max_age));
404 static ssize_t lru_max_age_store(struct kobject *kobj, struct attribute *attr,
405 const char *buffer, size_t count)
407 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
409 int scale = NSEC_PER_MSEC;
410 unsigned long long tmp;
414 /* Did the user ask in seconds or milliseconds. Default is in ms */
415 buf = strstr(buffer, "ms");
417 buf = strchr(buffer, 's');
419 scale = NSEC_PER_SEC;
425 err = kstrtoull(buffer, 10, &tmp);
429 ns->ns_max_age = ktime_set(0, tmp * scale);
433 LUSTRE_RW_ATTR(lru_max_age);
435 static ssize_t early_lock_cancel_show(struct kobject *kobj,
436 struct attribute *attr,
439 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
442 return sprintf(buf, "%d\n", ns_connect_cancelset(ns));
445 static ssize_t early_lock_cancel_store(struct kobject *kobj,
446 struct attribute *attr,
450 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
452 unsigned long supp = -1;
455 rc = kstrtoul(buffer, 10, &supp);
460 ns->ns_connect_flags &= ~OBD_CONNECT_CANCELSET;
461 else if (ns->ns_orig_connect_flags & OBD_CONNECT_CANCELSET)
462 ns->ns_connect_flags |= OBD_CONNECT_CANCELSET;
465 LUSTRE_RW_ATTR(early_lock_cancel);
467 #ifdef HAVE_SERVER_SUPPORT
468 static ssize_t ctime_age_limit_show(struct kobject *kobj,
469 struct attribute *attr, char *buf)
471 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
474 return sprintf(buf, "%u\n", ns->ns_ctime_age_limit);
477 static ssize_t ctime_age_limit_store(struct kobject *kobj,
478 struct attribute *attr,
479 const char *buffer, size_t count)
481 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
486 err = kstrtoul(buffer, 10, &tmp);
490 ns->ns_ctime_age_limit = tmp;
494 LUSTRE_RW_ATTR(ctime_age_limit);
496 static ssize_t lock_timeouts_show(struct kobject *kobj, struct attribute *attr,
499 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
502 return sprintf(buf, "%d\n", ns->ns_timeouts);
504 LUSTRE_RO_ATTR(lock_timeouts);
506 static ssize_t max_nolock_bytes_show(struct kobject *kobj,
507 struct attribute *attr, char *buf)
509 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
512 return sprintf(buf, "%u\n", ns->ns_max_nolock_size);
515 static ssize_t max_nolock_bytes_store(struct kobject *kobj,
516 struct attribute *attr,
517 const char *buffer, size_t count)
519 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
524 err = kstrtoul(buffer, 10, &tmp);
528 ns->ns_max_nolock_size = tmp;
532 LUSTRE_RW_ATTR(max_nolock_bytes);
534 static ssize_t contention_seconds_show(struct kobject *kobj,
535 struct attribute *attr, char *buf)
537 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
540 return sprintf(buf, "%u\n", ns->ns_contention_time);
543 static ssize_t contention_seconds_store(struct kobject *kobj,
544 struct attribute *attr,
545 const char *buffer, size_t count)
547 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
552 err = kstrtoul(buffer, 10, &tmp);
556 ns->ns_contention_time = tmp;
560 LUSTRE_RW_ATTR(contention_seconds);
562 static ssize_t contended_locks_show(struct kobject *kobj,
563 struct attribute *attr, char *buf)
565 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
568 return sprintf(buf, "%u\n", ns->ns_contended_locks);
571 static ssize_t contended_locks_store(struct kobject *kobj,
572 struct attribute *attr,
573 const char *buffer, size_t count)
575 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
580 err = kstrtoul(buffer, 10, &tmp);
584 ns->ns_contended_locks = tmp;
588 LUSTRE_RW_ATTR(contended_locks);
590 static ssize_t max_parallel_ast_show(struct kobject *kobj,
591 struct attribute *attr, char *buf)
593 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
596 return sprintf(buf, "%u\n", ns->ns_max_parallel_ast);
599 static ssize_t max_parallel_ast_store(struct kobject *kobj,
600 struct attribute *attr,
601 const char *buffer, size_t count)
603 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
608 err = kstrtoul(buffer, 10, &tmp);
612 ns->ns_max_parallel_ast = tmp;
616 LUSTRE_RW_ATTR(max_parallel_ast);
618 #endif /* HAVE_SERVER_SUPPORT */
620 /* These are for namespaces in /sys/fs/lustre/ldlm/namespaces/ */
621 static struct attribute *ldlm_ns_attrs[] = {
622 &lustre_attr_resource_count.attr,
623 &lustre_attr_lock_count.attr,
624 &lustre_attr_lock_unused_count.attr,
625 &lustre_attr_lru_size.attr,
626 &lustre_attr_lru_max_age.attr,
627 &lustre_attr_early_lock_cancel.attr,
628 #ifdef HAVE_SERVER_SUPPORT
629 &lustre_attr_ctime_age_limit.attr,
630 &lustre_attr_lock_timeouts.attr,
631 &lustre_attr_max_nolock_bytes.attr,
632 &lustre_attr_contention_seconds.attr,
633 &lustre_attr_contended_locks.attr,
634 &lustre_attr_max_parallel_ast.attr,
639 static void ldlm_ns_release(struct kobject *kobj)
641 struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
643 complete(&ns->ns_kobj_unregister);
646 static struct kobj_type ldlm_ns_ktype = {
647 .default_attrs = ldlm_ns_attrs,
648 .sysfs_ops = &lustre_sysfs_ops,
649 .release = ldlm_ns_release,
652 static void ldlm_namespace_proc_unregister(struct ldlm_namespace *ns)
654 if (ns->ns_proc_dir_entry == NULL)
655 CERROR("dlm namespace %s has no procfs dir?\n",
658 lprocfs_remove(&ns->ns_proc_dir_entry);
660 if (ns->ns_stats != NULL)
661 lprocfs_free_stats(&ns->ns_stats);
664 void ldlm_namespace_sysfs_unregister(struct ldlm_namespace *ns)
666 kobject_put(&ns->ns_kobj);
667 wait_for_completion(&ns->ns_kobj_unregister);
670 int ldlm_namespace_sysfs_register(struct ldlm_namespace *ns)
674 ns->ns_kobj.kset = ldlm_ns_kset;
675 init_completion(&ns->ns_kobj_unregister);
676 err = kobject_init_and_add(&ns->ns_kobj, &ldlm_ns_ktype, NULL,
677 "%s", ldlm_ns_name(ns));
679 ns->ns_stats = lprocfs_alloc_stats(LDLM_NSS_LAST, 0);
681 kobject_put(&ns->ns_kobj);
685 lprocfs_counter_init(ns->ns_stats, LDLM_NSS_LOCKS,
686 LPROCFS_CNTR_AVGMINMAX, "locks", "locks");
691 static int ldlm_namespace_proc_register(struct ldlm_namespace *ns)
693 struct proc_dir_entry *ns_pde;
696 LASSERT(ns->ns_rs_hash != NULL);
698 if (ns->ns_proc_dir_entry != NULL) {
699 ns_pde = ns->ns_proc_dir_entry;
701 ns_pde = proc_mkdir(ldlm_ns_name(ns), ldlm_ns_proc_dir);
704 ns->ns_proc_dir_entry = ns_pde;
709 #undef MAX_STRING_SIZE
710 #else /* CONFIG_PROC_FS */
712 #define ldlm_namespace_proc_unregister(ns) ({;})
713 #define ldlm_namespace_proc_register(ns) ({0;})
715 #endif /* CONFIG_PROC_FS */
717 static unsigned ldlm_res_hop_hash(struct cfs_hash *hs,
718 const void *key, unsigned mask)
720 const struct ldlm_res_id *id = key;
724 for (i = 0; i < RES_NAME_SIZE; i++)
729 static unsigned ldlm_res_hop_fid_hash(struct cfs_hash *hs,
730 const void *key, unsigned mask)
732 const struct ldlm_res_id *id = key;
737 fid.f_seq = id->name[LUSTRE_RES_ID_SEQ_OFF];
738 fid.f_oid = (__u32)id->name[LUSTRE_RES_ID_VER_OID_OFF];
739 fid.f_ver = (__u32)(id->name[LUSTRE_RES_ID_VER_OID_OFF] >> 32);
741 hash = fid_flatten32(&fid);
742 hash += (hash >> 4) + (hash << 12); /* mixing oid and seq */
743 if (id->name[LUSTRE_RES_ID_HSH_OFF] != 0) {
744 val = id->name[LUSTRE_RES_ID_HSH_OFF];
745 hash += (val >> 5) + (val << 11);
749 hash = hash_long(hash, hs->hs_bkt_bits);
750 /* give me another random factor */
751 hash -= hash_long((unsigned long)hs, val % 11 + 3);
753 hash <<= hs->hs_cur_bits - hs->hs_bkt_bits;
754 hash |= ldlm_res_hop_hash(hs, key, CFS_HASH_NBKT(hs) - 1);
759 static void *ldlm_res_hop_key(struct hlist_node *hnode)
761 struct ldlm_resource *res;
763 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
764 return &res->lr_name;
767 static int ldlm_res_hop_keycmp(const void *key, struct hlist_node *hnode)
769 struct ldlm_resource *res;
771 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
772 return ldlm_res_eq((const struct ldlm_res_id *)key,
773 (const struct ldlm_res_id *)&res->lr_name);
776 static void *ldlm_res_hop_object(struct hlist_node *hnode)
778 return hlist_entry(hnode, struct ldlm_resource, lr_hash);
782 ldlm_res_hop_get_locked(struct cfs_hash *hs, struct hlist_node *hnode)
784 struct ldlm_resource *res;
786 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
787 ldlm_resource_getref(res);
790 static void ldlm_res_hop_put(struct cfs_hash *hs, struct hlist_node *hnode)
792 struct ldlm_resource *res;
794 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
795 ldlm_resource_putref(res);
798 static struct cfs_hash_ops ldlm_ns_hash_ops = {
799 .hs_hash = ldlm_res_hop_hash,
800 .hs_key = ldlm_res_hop_key,
801 .hs_keycmp = ldlm_res_hop_keycmp,
803 .hs_object = ldlm_res_hop_object,
804 .hs_get = ldlm_res_hop_get_locked,
805 .hs_put = ldlm_res_hop_put
808 static struct cfs_hash_ops ldlm_ns_fid_hash_ops = {
809 .hs_hash = ldlm_res_hop_fid_hash,
810 .hs_key = ldlm_res_hop_key,
811 .hs_keycmp = ldlm_res_hop_keycmp,
813 .hs_object = ldlm_res_hop_object,
814 .hs_get = ldlm_res_hop_get_locked,
815 .hs_put = ldlm_res_hop_put
818 typedef struct ldlm_ns_hash_def {
819 enum ldlm_ns_type nsd_type;
820 /** hash bucket bits */
821 unsigned nsd_bkt_bits;
823 unsigned nsd_all_bits;
824 /** hash operations */
825 struct cfs_hash_ops *nsd_hops;
826 } ldlm_ns_hash_def_t;
828 static struct ldlm_ns_hash_def ldlm_ns_hash_defs[] =
831 .nsd_type = LDLM_NS_TYPE_MDC,
834 .nsd_hops = &ldlm_ns_fid_hash_ops,
837 .nsd_type = LDLM_NS_TYPE_MDT,
840 .nsd_hops = &ldlm_ns_fid_hash_ops,
843 .nsd_type = LDLM_NS_TYPE_OSC,
846 .nsd_hops = &ldlm_ns_hash_ops,
849 .nsd_type = LDLM_NS_TYPE_OST,
852 .nsd_hops = &ldlm_ns_hash_ops,
855 .nsd_type = LDLM_NS_TYPE_MGC,
858 .nsd_hops = &ldlm_ns_hash_ops,
861 .nsd_type = LDLM_NS_TYPE_MGT,
864 .nsd_hops = &ldlm_ns_hash_ops,
867 .nsd_type = LDLM_NS_TYPE_UNKNOWN,
872 * Create and initialize new empty namespace.
874 struct ldlm_namespace *ldlm_namespace_new(struct obd_device *obd, char *name,
875 enum ldlm_side client,
876 enum ldlm_appetite apt,
877 enum ldlm_ns_type ns_type)
879 struct ldlm_namespace *ns = NULL;
880 struct ldlm_ns_bucket *nsb;
881 struct ldlm_ns_hash_def *nsd;
882 struct cfs_hash_bd bd;
887 LASSERT(obd != NULL);
891 CERROR("ldlm_get_ref failed: %d\n", rc);
895 for (idx = 0;;idx++) {
896 nsd = &ldlm_ns_hash_defs[idx];
897 if (nsd->nsd_type == LDLM_NS_TYPE_UNKNOWN) {
898 CERROR("Unknown type %d for ns %s\n", ns_type, name);
902 if (nsd->nsd_type == ns_type)
910 ns->ns_rs_hash = cfs_hash_create(name,
911 nsd->nsd_all_bits, nsd->nsd_all_bits,
912 nsd->nsd_bkt_bits, sizeof(*nsb),
918 CFS_HASH_SPIN_BKTLOCK |
919 CFS_HASH_NO_ITEMREF);
920 if (ns->ns_rs_hash == NULL)
923 cfs_hash_for_each_bucket(ns->ns_rs_hash, &bd, idx) {
924 nsb = cfs_hash_bd_extra_get(ns->ns_rs_hash, &bd);
925 at_init(&nsb->nsb_at_estimate, ldlm_enqueue_min, 0);
926 nsb->nsb_namespace = ns;
927 nsb->nsb_reclaim_start = 0;
931 ns->ns_appetite = apt;
932 ns->ns_client = client;
934 INIT_LIST_HEAD(&ns->ns_list_chain);
935 INIT_LIST_HEAD(&ns->ns_unused_list);
936 spin_lock_init(&ns->ns_lock);
937 atomic_set(&ns->ns_bref, 0);
938 init_waitqueue_head(&ns->ns_waitq);
940 ns->ns_max_nolock_size = NS_DEFAULT_MAX_NOLOCK_BYTES;
941 ns->ns_contention_time = NS_DEFAULT_CONTENTION_SECONDS;
942 ns->ns_contended_locks = NS_DEFAULT_CONTENDED_LOCKS;
944 ns->ns_max_parallel_ast = LDLM_DEFAULT_PARALLEL_AST_LIMIT;
945 ns->ns_nr_unused = 0;
946 ns->ns_max_unused = LDLM_DEFAULT_LRU_SIZE;
947 ns->ns_max_age = ktime_set(LDLM_DEFAULT_MAX_ALIVE, 0);
948 ns->ns_ctime_age_limit = LDLM_CTIME_AGE_LIMIT;
950 ns->ns_orig_connect_flags = 0;
951 ns->ns_connect_flags = 0;
953 ns->ns_reclaim_start = 0;
955 rc = ldlm_namespace_sysfs_register(ns);
957 CERROR("Can't initialize ns sysfs, rc %d\n", rc);
961 rc = ldlm_namespace_proc_register(ns);
963 CERROR("Can't initialize ns proc, rc %d\n", rc);
967 idx = ldlm_namespace_nr_read(client);
968 rc = ldlm_pool_init(&ns->ns_pool, ns, idx, client);
970 CERROR("Can't initialize lock pool, rc %d\n", rc);
974 ldlm_namespace_register(ns, client);
977 ldlm_namespace_proc_unregister(ns);
979 ldlm_namespace_sysfs_unregister(ns);
980 ldlm_namespace_cleanup(ns, 0);
982 cfs_hash_putref(ns->ns_rs_hash);
989 EXPORT_SYMBOL(ldlm_namespace_new);
991 extern struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock);
994 * Cancel and destroy all locks on a resource.
996 * If flags contains FL_LOCAL_ONLY, don't try to tell the server, just
997 * clean up. This is currently only used for recovery, and we make
998 * certain assumptions as a result--notably, that we shouldn't cancel
1001 static void cleanup_resource(struct ldlm_resource *res, struct list_head *q,
1004 struct list_head *tmp;
1005 int rc = 0, client = ns_is_client(ldlm_res_to_ns(res));
1006 bool local_only = !!(flags & LDLM_FL_LOCAL_ONLY);
1009 struct ldlm_lock *lock = NULL;
1011 /* First, we look for non-cleaned-yet lock
1012 * all cleaned locks are marked by CLEANED flag. */
1014 list_for_each(tmp, q) {
1015 lock = list_entry(tmp, struct ldlm_lock,
1017 if (ldlm_is_cleaned(lock)) {
1021 LDLM_LOCK_GET(lock);
1022 ldlm_set_cleaned(lock);
1031 /* Set CBPENDING so nothing in the cancellation path
1032 * can match this lock. */
1033 ldlm_set_cbpending(lock);
1034 ldlm_set_failed(lock);
1035 lock->l_flags |= flags;
1037 /* ... without sending a CANCEL message for local_only. */
1039 ldlm_set_local_only(lock);
1041 if (local_only && (lock->l_readers || lock->l_writers)) {
1042 /* This is a little bit gross, but much better than the
1043 * alternative: pretend that we got a blocking AST from
1044 * the server, so that when the lock is decref'd, it
1045 * will go away ... */
1047 LDLM_DEBUG(lock, "setting FL_LOCAL_ONLY");
1048 if (lock->l_flags & LDLM_FL_FAIL_LOC) {
1049 set_current_state(TASK_UNINTERRUPTIBLE);
1050 schedule_timeout(cfs_time_seconds(4));
1051 set_current_state(TASK_RUNNING);
1053 if (lock->l_completion_ast)
1054 lock->l_completion_ast(lock,
1055 LDLM_FL_FAILED, NULL);
1056 LDLM_LOCK_RELEASE(lock);
1061 struct lustre_handle lockh;
1064 ldlm_lock2handle(lock, &lockh);
1065 rc = ldlm_cli_cancel(&lockh, LCF_LOCAL);
1067 CERROR("ldlm_cli_cancel: %d\n", rc);
1070 LDLM_DEBUG(lock, "Freeing a lock still held by a "
1072 ldlm_lock_cancel(lock);
1074 LDLM_LOCK_RELEASE(lock);
1078 static int ldlm_resource_clean(struct cfs_hash *hs, struct cfs_hash_bd *bd,
1079 struct hlist_node *hnode, void *arg)
1081 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
1082 __u64 flags = *(__u64 *)arg;
1084 cleanup_resource(res, &res->lr_granted, flags);
1085 cleanup_resource(res, &res->lr_converting, flags);
1086 cleanup_resource(res, &res->lr_waiting, flags);
1091 static int ldlm_resource_complain(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);
1097 CERROR("%s: namespace resource "DLDLMRES" (%p) refcount nonzero "
1098 "(%d) after lock cleanup; forcing cleanup.\n",
1099 ldlm_ns_name(ldlm_res_to_ns(res)), PLDLMRES(res), res,
1100 atomic_read(&res->lr_refcount) - 1);
1102 ldlm_resource_dump(D_ERROR, res);
1108 * Cancel and destroy all locks in the namespace.
1110 * Typically used during evictions when server notified client that it was
1111 * evicted and all of its state needs to be destroyed.
1112 * Also used during shutdown.
1114 int ldlm_namespace_cleanup(struct ldlm_namespace *ns, __u64 flags)
1117 CDEBUG(D_INFO, "NULL ns, skipping cleanup\n");
1121 cfs_hash_for_each_nolock(ns->ns_rs_hash, ldlm_resource_clean,
1123 cfs_hash_for_each_nolock(ns->ns_rs_hash, ldlm_resource_complain,
1127 EXPORT_SYMBOL(ldlm_namespace_cleanup);
1130 * Attempts to free namespace.
1132 * Only used when namespace goes away, like during an unmount.
1134 static int __ldlm_namespace_free(struct ldlm_namespace *ns, int force)
1138 /* At shutdown time, don't call the cancellation callback */
1139 ldlm_namespace_cleanup(ns, force ? LDLM_FL_LOCAL_ONLY : 0);
1141 if (atomic_read(&ns->ns_bref) > 0) {
1142 struct l_wait_info lwi = LWI_INTR(LWI_ON_SIGNAL_NOOP, NULL);
1145 "dlm namespace %s free waiting on refcount %d\n",
1146 ldlm_ns_name(ns), atomic_read(&ns->ns_bref));
1149 lwi = LWI_TIMEOUT(msecs_to_jiffies(obd_timeout *
1150 MSEC_PER_SEC) / 4, NULL, NULL);
1152 rc = l_wait_event(ns->ns_waitq,
1153 atomic_read(&ns->ns_bref) == 0, &lwi);
1155 /* Forced cleanups should be able to reclaim all references,
1156 * so it's safe to wait forever... we can't leak locks... */
1157 if (force && rc == -ETIMEDOUT) {
1158 LCONSOLE_ERROR("Forced cleanup waiting for %s "
1159 "namespace with %d resources in use, "
1160 "(rc=%d)\n", ldlm_ns_name(ns),
1161 atomic_read(&ns->ns_bref), rc);
1162 GOTO(force_wait, rc);
1165 if (atomic_read(&ns->ns_bref)) {
1166 LCONSOLE_ERROR("Cleanup waiting for %s namespace "
1167 "with %d resources in use, (rc=%d)\n",
1169 atomic_read(&ns->ns_bref), rc);
1170 RETURN(ELDLM_NAMESPACE_EXISTS);
1172 CDEBUG(D_DLMTRACE, "dlm namespace %s free done waiting\n",
1180 * Performs various cleanups for passed \a ns to make it drop refc and be
1181 * ready for freeing. Waits for refc == 0.
1183 * The following is done:
1184 * (0) Unregister \a ns from its list to make inaccessible for potential
1185 * users like pools thread and others;
1186 * (1) Clear all locks in \a ns.
1188 void ldlm_namespace_free_prior(struct ldlm_namespace *ns,
1189 struct obd_import *imp,
1199 spin_lock(&ns->ns_lock);
1200 ns->ns_stopping = 1;
1201 spin_unlock(&ns->ns_lock);
1204 * Can fail with -EINTR when force == 0 in which case try harder.
1206 rc = __ldlm_namespace_free(ns, force);
1207 if (rc != ELDLM_OK) {
1209 ptlrpc_disconnect_import(imp, 0);
1210 ptlrpc_invalidate_import(imp);
1214 * With all requests dropped and the import inactive
1215 * we are gaurenteed all reference will be dropped.
1217 rc = __ldlm_namespace_free(ns, 1);
1222 EXPORT_SYMBOL(ldlm_namespace_free_prior);
1225 * Performs freeing memory structures related to \a ns. This is only done
1226 * when ldlm_namespce_free_prior() successfully removed all resources
1227 * referencing \a ns and its refc == 0.
1229 void ldlm_namespace_free_post(struct ldlm_namespace *ns)
1237 /* Make sure that nobody can find this ns in its list. */
1238 ldlm_namespace_unregister(ns, ns->ns_client);
1239 /* Fini pool _before_ parent proc dir is removed. This is important as
1240 * ldlm_pool_fini() removes own proc dir which is child to @dir.
1241 * Removing it after @dir may cause oops. */
1242 ldlm_pool_fini(&ns->ns_pool);
1244 ldlm_namespace_proc_unregister(ns);
1245 ldlm_namespace_sysfs_unregister(ns);
1246 cfs_hash_putref(ns->ns_rs_hash);
1247 /* Namespace \a ns should be not on list at this time, otherwise
1248 * this will cause issues related to using freed \a ns in poold
1250 LASSERT(list_empty(&ns->ns_list_chain));
1255 EXPORT_SYMBOL(ldlm_namespace_free_post);
1258 * Cleanup the resource, and free namespace.
1261 * proc1: destroy import
1262 * class_disconnect_export(grab cl_sem) ->
1263 * -> ldlm_namespace_free ->
1264 * -> lprocfs_remove(grab _lprocfs_lock).
1265 * proc2: read proc info
1266 * lprocfs_fops_read(grab _lprocfs_lock) ->
1267 * -> osc_rd_active, etc(grab cl_sem).
1269 * So that I have to split the ldlm_namespace_free into two parts - the first
1270 * part ldlm_namespace_free_prior is used to cleanup the resource which is
1271 * being used; the 2nd part ldlm_namespace_free_post is used to unregister the
1272 * lprocfs entries, and then free memory. It will be called w/o cli->cl_sem
1275 void ldlm_namespace_free(struct ldlm_namespace *ns,
1276 struct obd_import *imp,
1279 ldlm_namespace_free_prior(ns, imp, force);
1280 ldlm_namespace_free_post(ns);
1282 EXPORT_SYMBOL(ldlm_namespace_free);
1284 void ldlm_namespace_get(struct ldlm_namespace *ns)
1286 atomic_inc(&ns->ns_bref);
1289 /* This is only for callers that care about refcount */
1290 static int ldlm_namespace_get_return(struct ldlm_namespace *ns)
1292 return atomic_inc_return(&ns->ns_bref);
1295 void ldlm_namespace_put(struct ldlm_namespace *ns)
1297 if (atomic_dec_and_lock(&ns->ns_bref, &ns->ns_lock)) {
1298 wake_up(&ns->ns_waitq);
1299 spin_unlock(&ns->ns_lock);
1303 /** Register \a ns in the list of namespaces */
1304 void ldlm_namespace_register(struct ldlm_namespace *ns, enum ldlm_side client)
1306 mutex_lock(ldlm_namespace_lock(client));
1307 LASSERT(list_empty(&ns->ns_list_chain));
1308 list_add(&ns->ns_list_chain, ldlm_namespace_inactive_list(client));
1309 ldlm_namespace_nr_inc(client);
1310 mutex_unlock(ldlm_namespace_lock(client));
1313 /** Unregister \a ns from the list of namespaces. */
1314 void ldlm_namespace_unregister(struct ldlm_namespace *ns, enum ldlm_side client)
1316 mutex_lock(ldlm_namespace_lock(client));
1317 LASSERT(!list_empty(&ns->ns_list_chain));
1318 /* Some asserts and possibly other parts of the code are still
1319 * using list_empty(&ns->ns_list_chain). This is why it is
1320 * important to use list_del_init() here. */
1321 list_del_init(&ns->ns_list_chain);
1322 ldlm_namespace_nr_dec(client);
1323 mutex_unlock(ldlm_namespace_lock(client));
1326 /** Should be called with ldlm_namespace_lock(client) taken. */
1327 void ldlm_namespace_move_to_active_locked(struct ldlm_namespace *ns,
1328 enum ldlm_side client)
1330 LASSERT(!list_empty(&ns->ns_list_chain));
1331 LASSERT(mutex_is_locked(ldlm_namespace_lock(client)));
1332 list_move_tail(&ns->ns_list_chain, ldlm_namespace_list(client));
1335 /** Should be called with ldlm_namespace_lock(client) taken. */
1336 void ldlm_namespace_move_to_inactive_locked(struct ldlm_namespace *ns,
1337 enum ldlm_side client)
1339 LASSERT(!list_empty(&ns->ns_list_chain));
1340 LASSERT(mutex_is_locked(ldlm_namespace_lock(client)));
1341 list_move_tail(&ns->ns_list_chain,
1342 ldlm_namespace_inactive_list(client));
1345 /** Should be called with ldlm_namespace_lock(client) taken. */
1346 struct ldlm_namespace *ldlm_namespace_first_locked(enum ldlm_side client)
1348 LASSERT(mutex_is_locked(ldlm_namespace_lock(client)));
1349 LASSERT(!list_empty(ldlm_namespace_list(client)));
1350 return container_of(ldlm_namespace_list(client)->next,
1351 struct ldlm_namespace, ns_list_chain);
1354 /** Create and initialize new resource. */
1355 static struct ldlm_resource *ldlm_resource_new(enum ldlm_type ldlm_type)
1357 struct ldlm_resource *res;
1360 OBD_SLAB_ALLOC_PTR_GFP(res, ldlm_resource_slab, GFP_NOFS);
1364 if (ldlm_type == LDLM_EXTENT) {
1365 OBD_SLAB_ALLOC(res->lr_itree, ldlm_interval_tree_slab,
1366 sizeof(*res->lr_itree) * LCK_MODE_NUM);
1367 if (res->lr_itree == NULL) {
1368 OBD_SLAB_FREE_PTR(res, ldlm_resource_slab);
1371 /* Initialize interval trees for each lock mode. */
1372 for (idx = 0; idx < LCK_MODE_NUM; idx++) {
1373 res->lr_itree[idx].lit_size = 0;
1374 res->lr_itree[idx].lit_mode = 1 << idx;
1375 res->lr_itree[idx].lit_root = NULL;
1379 INIT_LIST_HEAD(&res->lr_granted);
1380 INIT_LIST_HEAD(&res->lr_converting);
1381 INIT_LIST_HEAD(&res->lr_waiting);
1383 atomic_set(&res->lr_refcount, 1);
1384 spin_lock_init(&res->lr_lock);
1385 lu_ref_init(&res->lr_reference);
1387 /* Since LVB init can be delayed now, there is no longer need to
1388 * immediatelly acquire mutex here. */
1389 mutex_init(&res->lr_lvb_mutex);
1390 res->lr_lvb_initialized = false;
1396 * Return a reference to resource with given name, creating it if necessary.
1397 * Args: namespace with ns_lock unlocked
1398 * Locks: takes and releases NS hash-lock and res->lr_lock
1399 * Returns: referenced, unlocked ldlm_resource or NULL
1401 struct ldlm_resource *
1402 ldlm_resource_get(struct ldlm_namespace *ns, struct ldlm_resource *parent,
1403 const struct ldlm_res_id *name, enum ldlm_type type,
1406 struct hlist_node *hnode;
1407 struct ldlm_resource *res = NULL;
1408 struct cfs_hash_bd bd;
1410 int ns_refcount = 0;
1412 LASSERT(ns != NULL);
1413 LASSERT(parent == NULL);
1414 LASSERT(ns->ns_rs_hash != NULL);
1415 LASSERT(name->name[0] != 0);
1417 cfs_hash_bd_get_and_lock(ns->ns_rs_hash, (void *)name, &bd, 0);
1418 hnode = cfs_hash_bd_lookup_locked(ns->ns_rs_hash, &bd, (void *)name);
1419 if (hnode != NULL) {
1420 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 0);
1424 version = cfs_hash_bd_version_get(&bd);
1425 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 0);
1428 return ERR_PTR(-ENOENT);
1430 LASSERTF(type >= LDLM_MIN_TYPE && type < LDLM_MAX_TYPE,
1431 "type: %d\n", type);
1432 res = ldlm_resource_new(type);
1434 return ERR_PTR(-ENOMEM);
1436 res->lr_ns_bucket = cfs_hash_bd_extra_get(ns->ns_rs_hash, &bd);
1437 res->lr_name = *name;
1438 res->lr_type = type;
1440 cfs_hash_bd_lock(ns->ns_rs_hash, &bd, 1);
1441 hnode = (version == cfs_hash_bd_version_get(&bd)) ? NULL :
1442 cfs_hash_bd_lookup_locked(ns->ns_rs_hash, &bd, (void *)name);
1444 if (hnode != NULL) {
1445 /* Someone won the race and already added the resource. */
1446 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
1447 /* Clean lu_ref for failed resource. */
1448 lu_ref_fini(&res->lr_reference);
1449 if (res->lr_itree != NULL)
1450 OBD_SLAB_FREE(res->lr_itree, ldlm_interval_tree_slab,
1451 sizeof(*res->lr_itree) * LCK_MODE_NUM);
1452 OBD_SLAB_FREE(res, ldlm_resource_slab, sizeof *res);
1454 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
1457 /* We won! Let's add the resource. */
1458 cfs_hash_bd_add_locked(ns->ns_rs_hash, &bd, &res->lr_hash);
1459 if (cfs_hash_bd_count_get(&bd) == 1)
1460 ns_refcount = ldlm_namespace_get_return(ns);
1462 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
1464 OBD_FAIL_TIMEOUT(OBD_FAIL_LDLM_CREATE_RESOURCE, 2);
1466 /* Let's see if we happened to be the very first resource in this
1467 * namespace. If so, and this is a client namespace, we need to move
1468 * the namespace into the active namespaces list to be patrolled by
1469 * the ldlm_poold. */
1470 if (ns_is_client(ns) && ns_refcount == 1) {
1471 mutex_lock(ldlm_namespace_lock(LDLM_NAMESPACE_CLIENT));
1472 ldlm_namespace_move_to_active_locked(ns, LDLM_NAMESPACE_CLIENT);
1473 mutex_unlock(ldlm_namespace_lock(LDLM_NAMESPACE_CLIENT));
1478 EXPORT_SYMBOL(ldlm_resource_get);
1480 struct ldlm_resource *ldlm_resource_getref(struct ldlm_resource *res)
1482 LASSERT(res != NULL);
1483 LASSERT(res != LP_POISON);
1484 atomic_inc(&res->lr_refcount);
1485 CDEBUG(D_INFO, "getref res: %p count: %d\n", res,
1486 atomic_read(&res->lr_refcount));
1490 static void __ldlm_resource_putref_final(struct cfs_hash_bd *bd,
1491 struct ldlm_resource *res)
1493 struct ldlm_ns_bucket *nsb = res->lr_ns_bucket;
1495 if (!list_empty(&res->lr_granted)) {
1496 ldlm_resource_dump(D_ERROR, res);
1500 if (!list_empty(&res->lr_converting)) {
1501 ldlm_resource_dump(D_ERROR, res);
1505 if (!list_empty(&res->lr_waiting)) {
1506 ldlm_resource_dump(D_ERROR, res);
1510 cfs_hash_bd_del_locked(nsb->nsb_namespace->ns_rs_hash,
1512 lu_ref_fini(&res->lr_reference);
1513 if (cfs_hash_bd_count_get(bd) == 0)
1514 ldlm_namespace_put(nsb->nsb_namespace);
1517 /* Returns 1 if the resource was freed, 0 if it remains. */
1518 int ldlm_resource_putref(struct ldlm_resource *res)
1520 struct ldlm_namespace *ns = ldlm_res_to_ns(res);
1521 struct cfs_hash_bd bd;
1523 LASSERT_ATOMIC_GT_LT(&res->lr_refcount, 0, LI_POISON);
1524 CDEBUG(D_INFO, "putref res: %p count: %d\n",
1525 res, atomic_read(&res->lr_refcount) - 1);
1527 cfs_hash_bd_get(ns->ns_rs_hash, &res->lr_name, &bd);
1528 if (cfs_hash_bd_dec_and_lock(ns->ns_rs_hash, &bd, &res->lr_refcount)) {
1529 __ldlm_resource_putref_final(&bd, res);
1530 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
1531 if (ns->ns_lvbo && ns->ns_lvbo->lvbo_free)
1532 ns->ns_lvbo->lvbo_free(res);
1533 if (res->lr_itree != NULL)
1534 OBD_SLAB_FREE(res->lr_itree, ldlm_interval_tree_slab,
1535 sizeof(*res->lr_itree) * LCK_MODE_NUM);
1536 OBD_SLAB_FREE(res, ldlm_resource_slab, sizeof *res);
1541 EXPORT_SYMBOL(ldlm_resource_putref);
1544 * Add a lock into a given resource into specified lock list.
1546 void ldlm_resource_add_lock(struct ldlm_resource *res, struct list_head *head,
1547 struct ldlm_lock *lock)
1549 check_res_locked(res);
1551 LDLM_DEBUG(lock, "About to add this lock");
1553 if (ldlm_is_destroyed(lock)) {
1554 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
1558 LASSERT(list_empty(&lock->l_res_link));
1560 list_add_tail(&lock->l_res_link, head);
1564 * Insert a lock into resource after specified lock.
1566 * Obtain resource description from the lock we are inserting after.
1568 void ldlm_resource_insert_lock_after(struct ldlm_lock *original,
1569 struct ldlm_lock *new)
1571 struct ldlm_resource *res = original->l_resource;
1573 check_res_locked(res);
1575 ldlm_resource_dump(D_INFO, res);
1576 LDLM_DEBUG(new, "About to insert this lock after %p: ", original);
1578 if (ldlm_is_destroyed(new)) {
1579 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
1583 LASSERT(list_empty(&new->l_res_link));
1585 list_add(&new->l_res_link, &original->l_res_link);
1589 void ldlm_resource_unlink_lock(struct ldlm_lock *lock)
1591 int type = lock->l_resource->lr_type;
1593 check_res_locked(lock->l_resource);
1594 if (type == LDLM_IBITS || type == LDLM_PLAIN)
1595 ldlm_unlink_lock_skiplist(lock);
1596 else if (type == LDLM_EXTENT)
1597 ldlm_extent_unlink_lock(lock);
1598 list_del_init(&lock->l_res_link);
1600 EXPORT_SYMBOL(ldlm_resource_unlink_lock);
1602 void ldlm_res2desc(struct ldlm_resource *res, struct ldlm_resource_desc *desc)
1604 desc->lr_type = res->lr_type;
1605 desc->lr_name = res->lr_name;
1609 * Print information about all locks in all namespaces on this node to debug
1612 void ldlm_dump_all_namespaces(enum ldlm_side client, int level)
1614 struct list_head *tmp;
1616 if (!((libcfs_debug | D_ERROR) & level))
1619 mutex_lock(ldlm_namespace_lock(client));
1621 list_for_each(tmp, ldlm_namespace_list(client)) {
1622 struct ldlm_namespace *ns;
1624 ns = list_entry(tmp, struct ldlm_namespace, ns_list_chain);
1625 ldlm_namespace_dump(level, ns);
1628 mutex_unlock(ldlm_namespace_lock(client));
1631 static int ldlm_res_hash_dump(struct cfs_hash *hs, struct cfs_hash_bd *bd,
1632 struct hlist_node *hnode, void *arg)
1634 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
1635 int level = (int)(unsigned long)arg;
1638 ldlm_resource_dump(level, res);
1645 * Print information about all locks in this namespace on this node to debug
1648 void ldlm_namespace_dump(int level, struct ldlm_namespace *ns)
1650 if (!((libcfs_debug | D_ERROR) & level))
1653 CDEBUG(level, "--- Namespace: %s (rc: %d, side: %s)\n",
1654 ldlm_ns_name(ns), atomic_read(&ns->ns_bref),
1655 ns_is_client(ns) ? "client" : "server");
1657 if (cfs_time_before(cfs_time_current(), ns->ns_next_dump))
1660 cfs_hash_for_each_nolock(ns->ns_rs_hash,
1662 (void *)(unsigned long)level, 0);
1663 spin_lock(&ns->ns_lock);
1664 ns->ns_next_dump = cfs_time_shift(10);
1665 spin_unlock(&ns->ns_lock);
1669 * Print information about all locks in this resource to debug log.
1671 void ldlm_resource_dump(int level, struct ldlm_resource *res)
1673 struct ldlm_lock *lock;
1674 unsigned int granted = 0;
1676 CLASSERT(RES_NAME_SIZE == 4);
1678 if (!((libcfs_debug | D_ERROR) & level))
1681 CDEBUG(level, "--- Resource: "DLDLMRES" (%p) refcount = %d\n",
1682 PLDLMRES(res), res, atomic_read(&res->lr_refcount));
1684 if (!list_empty(&res->lr_granted)) {
1685 CDEBUG(level, "Granted locks (in reverse order):\n");
1686 list_for_each_entry_reverse(lock, &res->lr_granted,
1688 LDLM_DEBUG_LIMIT(level, lock, "###");
1689 if (!(level & D_CANTMASK) &&
1690 ++granted > ldlm_dump_granted_max) {
1691 CDEBUG(level, "only dump %d granted locks to "
1692 "avoid DDOS.\n", granted);
1697 if (!list_empty(&res->lr_converting)) {
1698 CDEBUG(level, "Converting locks:\n");
1699 list_for_each_entry(lock, &res->lr_converting, l_res_link)
1700 LDLM_DEBUG_LIMIT(level, lock, "###");
1702 if (!list_empty(&res->lr_waiting)) {
1703 CDEBUG(level, "Waiting locks:\n");
1704 list_for_each_entry(lock, &res->lr_waiting, l_res_link)
1705 LDLM_DEBUG_LIMIT(level, lock, "###");
1708 EXPORT_SYMBOL(ldlm_resource_dump);