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.sun.com/software/products/lustre/docs/GPLv2.pdf
20 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
21 * CA 95054 USA or visit www.sun.com if you need additional information or
27 * Copyright (c) 2002, 2010, Oracle and/or its affiliates. All rights reserved.
28 * Use is subject to license terms.
30 * Copyright (c) 2010, 2013, Intel Corporation.
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
36 * lustre/ldlm/ldlm_resource.c
38 * Author: Phil Schwan <phil@clusterfs.com>
39 * Author: Peter Braam <braam@clusterfs.com>
42 #define DEBUG_SUBSYSTEM S_LDLM
43 #include <lustre_dlm.h>
44 #include <lustre_fid.h>
45 #include <obd_class.h>
46 #include "ldlm_internal.h"
48 struct kmem_cache *ldlm_resource_slab, *ldlm_lock_slab;
50 int ldlm_srv_namespace_nr = 0;
51 int ldlm_cli_namespace_nr = 0;
53 struct mutex ldlm_srv_namespace_lock;
54 struct list_head ldlm_srv_namespace_list;
56 struct mutex ldlm_cli_namespace_lock;
57 /* Client Namespaces that have active resources in them.
58 * Once all resources go away, ldlm_poold moves such namespaces to the
60 struct list_head ldlm_cli_active_namespace_list;
61 /* Client namespaces that don't have any locks in them */
62 struct list_head ldlm_cli_inactive_namespace_list;
64 struct proc_dir_entry *ldlm_type_proc_dir = NULL;
65 struct proc_dir_entry *ldlm_ns_proc_dir = NULL;
66 struct proc_dir_entry *ldlm_svc_proc_dir = NULL;
68 extern unsigned int ldlm_cancel_unused_locks_before_replay;
70 /* during debug dump certain amount of granted locks for one resource to avoid
72 unsigned int ldlm_dump_granted_max = 256;
76 lprocfs_dump_ns_seq_write(struct file *file, const char *buffer,
77 size_t count, loff_t *off)
79 ldlm_dump_all_namespaces(LDLM_NAMESPACE_SERVER, D_DLMTRACE);
80 ldlm_dump_all_namespaces(LDLM_NAMESPACE_CLIENT, D_DLMTRACE);
83 LPROC_SEQ_FOPS_WO_TYPE(ldlm, dump_ns);
85 LPROC_SEQ_FOPS_RW_TYPE(ldlm_rw, uint);
86 LPROC_SEQ_FOPS_RO_TYPE(ldlm, uint);
88 int ldlm_proc_setup(void)
91 struct lprocfs_seq_vars list[] = {
92 { .name = "dump_namespaces",
93 .fops = &ldlm_dump_ns_fops,
95 { .name = "dump_granted_max",
96 .fops = &ldlm_rw_uint_fops,
97 .data = &ldlm_dump_granted_max },
98 { .name = "cancel_unused_locks_before_replay",
99 .fops = &ldlm_rw_uint_fops,
100 .data = &ldlm_cancel_unused_locks_before_replay },
103 LASSERT(ldlm_ns_proc_dir == NULL);
105 ldlm_type_proc_dir = lprocfs_seq_register(OBD_LDLM_DEVICENAME,
108 if (IS_ERR(ldlm_type_proc_dir)) {
109 CERROR("LProcFS failed in ldlm-init\n");
110 rc = PTR_ERR(ldlm_type_proc_dir);
114 ldlm_ns_proc_dir = lprocfs_seq_register("namespaces",
117 if (IS_ERR(ldlm_ns_proc_dir)) {
118 CERROR("LProcFS failed in ldlm-init\n");
119 rc = PTR_ERR(ldlm_ns_proc_dir);
123 ldlm_svc_proc_dir = lprocfs_seq_register("services",
126 if (IS_ERR(ldlm_svc_proc_dir)) {
127 CERROR("LProcFS failed in ldlm-init\n");
128 rc = PTR_ERR(ldlm_svc_proc_dir);
132 rc = lprocfs_seq_add_vars(ldlm_type_proc_dir, list, NULL);
134 CERROR("LProcFS failed in ldlm-init\n");
141 lprocfs_remove(&ldlm_svc_proc_dir);
143 lprocfs_remove(&ldlm_ns_proc_dir);
145 lprocfs_remove(&ldlm_type_proc_dir);
147 ldlm_svc_proc_dir = NULL;
151 void ldlm_proc_cleanup(void)
153 if (ldlm_svc_proc_dir)
154 lprocfs_remove(&ldlm_svc_proc_dir);
156 if (ldlm_ns_proc_dir)
157 lprocfs_remove(&ldlm_ns_proc_dir);
159 if (ldlm_type_proc_dir)
160 lprocfs_remove(&ldlm_type_proc_dir);
163 static int lprocfs_ns_resources_seq_show(struct seq_file *m, void *v)
165 struct ldlm_namespace *ns = m->private;
170 /* result is not strictly consistant */
171 cfs_hash_for_each_bucket(ns->ns_rs_hash, &bd, i)
172 res += cfs_hash_bd_count_get(&bd);
173 return lprocfs_u64_seq_show(m, &res);
175 LPROC_SEQ_FOPS_RO(lprocfs_ns_resources);
177 static int lprocfs_ns_locks_seq_show(struct seq_file *m, void *v)
179 struct ldlm_namespace *ns = m->private;
182 locks = lprocfs_stats_collector(ns->ns_stats, LDLM_NSS_LOCKS,
183 LPROCFS_FIELDS_FLAGS_SUM);
184 return lprocfs_u64_seq_show(m, &locks);
186 LPROC_SEQ_FOPS_RO(lprocfs_ns_locks);
188 static int lprocfs_lru_size_seq_show(struct seq_file *m, void *v)
190 struct ldlm_namespace *ns = m->private;
191 __u32 *nr = &ns->ns_max_unused;
193 if (ns_connect_lru_resize(ns))
194 nr = &ns->ns_nr_unused;
195 return lprocfs_uint_seq_show(m, nr);
198 static ssize_t lprocfs_lru_size_seq_write(struct file *file, const char *buffer,
199 size_t count, loff_t *off)
201 struct ldlm_namespace *ns = ((struct seq_file *)file->private_data)->private;
202 char dummy[MAX_STRING_SIZE + 1], *end;
206 dummy[MAX_STRING_SIZE] = '\0';
207 if (copy_from_user(dummy, buffer, MAX_STRING_SIZE))
210 if (strncmp(dummy, "clear", 5) == 0) {
212 "dropping all unused locks from namespace %s\n",
214 if (ns_connect_lru_resize(ns)) {
215 int canceled, unused = ns->ns_nr_unused;
217 /* Try to cancel all @ns_nr_unused locks. */
218 canceled = ldlm_cancel_lru(ns, unused, 0,
220 if (canceled < unused) {
222 "not all requested locks are canceled, "
223 "requested: %d, canceled: %d\n", unused,
228 tmp = ns->ns_max_unused;
229 ns->ns_max_unused = 0;
230 ldlm_cancel_lru(ns, 0, 0, LDLM_CANCEL_PASSED);
231 ns->ns_max_unused = tmp;
236 tmp = simple_strtoul(dummy, &end, 0);
238 CERROR("invalid value written\n");
241 lru_resize = (tmp == 0);
243 if (ns_connect_lru_resize(ns)) {
245 ns->ns_max_unused = (unsigned int)tmp;
247 if (tmp > ns->ns_nr_unused)
248 tmp = ns->ns_nr_unused;
249 tmp = ns->ns_nr_unused - tmp;
252 "changing namespace %s unused locks from %u to %u\n",
253 ldlm_ns_name(ns), ns->ns_nr_unused,
255 ldlm_cancel_lru(ns, tmp, LCF_ASYNC, LDLM_CANCEL_PASSED);
259 "disable lru_resize for namespace %s\n",
261 ns->ns_connect_flags &= ~OBD_CONNECT_LRU_RESIZE;
265 "changing namespace %s max_unused from %u to %u\n",
266 ldlm_ns_name(ns), ns->ns_max_unused,
268 ns->ns_max_unused = (unsigned int)tmp;
269 ldlm_cancel_lru(ns, 0, LCF_ASYNC, LDLM_CANCEL_PASSED);
271 /* Make sure that LRU resize was originally supported before
272 * turning it on here. */
274 (ns->ns_orig_connect_flags & OBD_CONNECT_LRU_RESIZE)) {
276 "enable lru_resize for namespace %s\n",
278 ns->ns_connect_flags |= OBD_CONNECT_LRU_RESIZE;
284 LPROC_SEQ_FOPS(lprocfs_lru_size);
286 static int lprocfs_elc_seq_show(struct seq_file *m, void *v)
288 struct ldlm_namespace *ns = m->private;
289 unsigned int supp = ns_connect_cancelset(ns);
291 return lprocfs_uint_seq_show(m, &supp);
294 static ssize_t lprocfs_elc_seq_write(struct file *file, const char *buffer,
295 size_t count, loff_t *off)
297 struct ldlm_namespace *ns = ((struct seq_file *)file->private_data)->private;
298 unsigned int supp = -1;
301 rc = lprocfs_wr_uint(file, buffer, count, &supp);
306 ns->ns_connect_flags &= ~OBD_CONNECT_CANCELSET;
307 else if (ns->ns_orig_connect_flags & OBD_CONNECT_CANCELSET)
308 ns->ns_connect_flags |= OBD_CONNECT_CANCELSET;
311 LPROC_SEQ_FOPS(lprocfs_elc);
313 void ldlm_namespace_proc_unregister(struct ldlm_namespace *ns)
315 if (ns->ns_proc_dir_entry == NULL)
316 CERROR("dlm namespace %s has no procfs dir?\n",
319 lprocfs_remove(&ns->ns_proc_dir_entry);
321 if (ns->ns_stats != NULL)
322 lprocfs_free_stats(&ns->ns_stats);
325 int ldlm_namespace_proc_register(struct ldlm_namespace *ns)
327 struct lprocfs_seq_vars lock_vars[2];
328 char lock_name[MAX_STRING_SIZE + 1];
329 struct proc_dir_entry *ns_pde;
332 LASSERT(ns->ns_rs_hash != NULL);
334 if (ns->ns_proc_dir_entry != NULL) {
335 ns_pde = ns->ns_proc_dir_entry;
337 ns_pde = proc_mkdir(ldlm_ns_name(ns), ldlm_ns_proc_dir);
340 ns->ns_proc_dir_entry = ns_pde;
343 ns->ns_stats = lprocfs_alloc_stats(LDLM_NSS_LAST, 0);
344 if (ns->ns_stats == NULL)
347 lprocfs_counter_init(ns->ns_stats, LDLM_NSS_LOCKS,
348 LPROCFS_CNTR_AVGMINMAX, "locks", "locks");
350 lock_name[MAX_STRING_SIZE] = '\0';
352 memset(lock_vars, 0, sizeof(lock_vars));
353 lock_vars[0].name = lock_name;
355 ldlm_add_var(&lock_vars[0], ns_pde, "resource_count", ns,
356 &lprocfs_ns_resources_fops);
357 ldlm_add_var(&lock_vars[0], ns_pde, "lock_count", ns,
358 &lprocfs_ns_locks_fops);
360 if (ns_is_client(ns)) {
361 ldlm_add_var(&lock_vars[0], ns_pde, "lock_unused_count",
362 &ns->ns_nr_unused, &ldlm_uint_fops);
363 ldlm_add_var(&lock_vars[0], ns_pde, "lru_size", ns,
364 &lprocfs_lru_size_fops);
365 ldlm_add_var(&lock_vars[0], ns_pde, "lru_max_age",
366 &ns->ns_max_age, &ldlm_rw_uint_fops);
367 ldlm_add_var(&lock_vars[0], ns_pde, "early_lock_cancel",
368 ns, &lprocfs_elc_fops);
370 ldlm_add_var(&lock_vars[0], ns_pde, "ctime_age_limit",
371 &ns->ns_ctime_age_limit, &ldlm_rw_uint_fops);
372 ldlm_add_var(&lock_vars[0], ns_pde, "lock_timeouts",
373 &ns->ns_timeouts, &ldlm_uint_fops);
374 ldlm_add_var(&lock_vars[0], ns_pde, "max_nolock_bytes",
375 &ns->ns_max_nolock_size, &ldlm_rw_uint_fops);
376 ldlm_add_var(&lock_vars[0], ns_pde, "contention_seconds",
377 &ns->ns_contention_time, &ldlm_rw_uint_fops);
378 ldlm_add_var(&lock_vars[0], ns_pde, "contended_locks",
379 &ns->ns_contended_locks, &ldlm_rw_uint_fops);
380 ldlm_add_var(&lock_vars[0], ns_pde, "max_parallel_ast",
381 &ns->ns_max_parallel_ast, &ldlm_rw_uint_fops);
385 #undef MAX_STRING_SIZE
388 #define ldlm_namespace_proc_unregister(ns) ({;})
389 #define ldlm_namespace_proc_register(ns) ({0;})
393 static unsigned ldlm_res_hop_hash(cfs_hash_t *hs,
394 const void *key, unsigned mask)
396 const struct ldlm_res_id *id = key;
400 for (i = 0; i < RES_NAME_SIZE; i++)
405 static unsigned ldlm_res_hop_fid_hash(cfs_hash_t *hs,
406 const void *key, unsigned mask)
408 const struct ldlm_res_id *id = key;
413 fid.f_seq = id->name[LUSTRE_RES_ID_SEQ_OFF];
414 fid.f_oid = (__u32)id->name[LUSTRE_RES_ID_VER_OID_OFF];
415 fid.f_ver = (__u32)(id->name[LUSTRE_RES_ID_VER_OID_OFF] >> 32);
417 hash = fid_flatten32(&fid);
418 hash += (hash >> 4) + (hash << 12); /* mixing oid and seq */
419 if (id->name[LUSTRE_RES_ID_HSH_OFF] != 0) {
420 val = id->name[LUSTRE_RES_ID_HSH_OFF];
421 hash += (val >> 5) + (val << 11);
425 hash = hash_long(hash, hs->hs_bkt_bits);
426 /* give me another random factor */
427 hash -= hash_long((unsigned long)hs, val % 11 + 3);
429 hash <<= hs->hs_cur_bits - hs->hs_bkt_bits;
430 hash |= ldlm_res_hop_hash(hs, key, CFS_HASH_NBKT(hs) - 1);
435 static void *ldlm_res_hop_key(struct hlist_node *hnode)
437 struct ldlm_resource *res;
439 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
440 return &res->lr_name;
443 static int ldlm_res_hop_keycmp(const void *key, struct hlist_node *hnode)
445 struct ldlm_resource *res;
447 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
448 return ldlm_res_eq((const struct ldlm_res_id *)key,
449 (const struct ldlm_res_id *)&res->lr_name);
452 static void *ldlm_res_hop_object(struct hlist_node *hnode)
454 return hlist_entry(hnode, struct ldlm_resource, lr_hash);
457 static void ldlm_res_hop_get_locked(cfs_hash_t *hs, struct hlist_node *hnode)
459 struct ldlm_resource *res;
461 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
462 ldlm_resource_getref(res);
465 static void ldlm_res_hop_put_locked(cfs_hash_t *hs, struct hlist_node *hnode)
467 struct ldlm_resource *res;
469 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
470 /* cfs_hash_for_each_nolock is the only chance we call it */
471 ldlm_resource_putref_locked(res);
474 static void ldlm_res_hop_put(cfs_hash_t *hs, struct hlist_node *hnode)
476 struct ldlm_resource *res;
478 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
479 ldlm_resource_putref(res);
482 cfs_hash_ops_t ldlm_ns_hash_ops = {
483 .hs_hash = ldlm_res_hop_hash,
484 .hs_key = ldlm_res_hop_key,
485 .hs_keycmp = ldlm_res_hop_keycmp,
487 .hs_object = ldlm_res_hop_object,
488 .hs_get = ldlm_res_hop_get_locked,
489 .hs_put_locked = ldlm_res_hop_put_locked,
490 .hs_put = ldlm_res_hop_put
493 cfs_hash_ops_t ldlm_ns_fid_hash_ops = {
494 .hs_hash = ldlm_res_hop_fid_hash,
495 .hs_key = ldlm_res_hop_key,
496 .hs_keycmp = ldlm_res_hop_keycmp,
498 .hs_object = ldlm_res_hop_object,
499 .hs_get = ldlm_res_hop_get_locked,
500 .hs_put_locked = ldlm_res_hop_put_locked,
501 .hs_put = ldlm_res_hop_put
505 ldlm_ns_type_t nsd_type;
506 /** hash bucket bits */
507 unsigned nsd_bkt_bits;
509 unsigned nsd_all_bits;
510 /** hash operations */
511 cfs_hash_ops_t *nsd_hops;
512 } ldlm_ns_hash_def_t;
514 ldlm_ns_hash_def_t ldlm_ns_hash_defs[] =
517 .nsd_type = LDLM_NS_TYPE_MDC,
520 .nsd_hops = &ldlm_ns_fid_hash_ops,
523 .nsd_type = LDLM_NS_TYPE_MDT,
526 .nsd_hops = &ldlm_ns_fid_hash_ops,
529 .nsd_type = LDLM_NS_TYPE_OSC,
532 .nsd_hops = &ldlm_ns_hash_ops,
535 .nsd_type = LDLM_NS_TYPE_OST,
538 .nsd_hops = &ldlm_ns_hash_ops,
541 .nsd_type = LDLM_NS_TYPE_MGC,
544 .nsd_hops = &ldlm_ns_hash_ops,
547 .nsd_type = LDLM_NS_TYPE_MGT,
550 .nsd_hops = &ldlm_ns_hash_ops,
553 .nsd_type = LDLM_NS_TYPE_UNKNOWN,
558 * Create and initialize new empty namespace.
560 struct ldlm_namespace *ldlm_namespace_new(struct obd_device *obd, char *name,
563 ldlm_ns_type_t ns_type)
565 struct ldlm_namespace *ns = NULL;
566 struct ldlm_ns_bucket *nsb;
567 ldlm_ns_hash_def_t *nsd;
573 LASSERT(obd != NULL);
577 CERROR("ldlm_get_ref failed: %d\n", rc);
581 for (idx = 0;;idx++) {
582 nsd = &ldlm_ns_hash_defs[idx];
583 if (nsd->nsd_type == LDLM_NS_TYPE_UNKNOWN) {
584 CERROR("Unknown type %d for ns %s\n", ns_type, name);
588 if (nsd->nsd_type == ns_type)
596 ns->ns_rs_hash = cfs_hash_create(name,
597 nsd->nsd_all_bits, nsd->nsd_all_bits,
598 nsd->nsd_bkt_bits, sizeof(*nsb),
604 CFS_HASH_SPIN_BKTLOCK |
605 CFS_HASH_NO_ITEMREF);
606 if (ns->ns_rs_hash == NULL)
609 cfs_hash_for_each_bucket(ns->ns_rs_hash, &bd, idx) {
610 nsb = cfs_hash_bd_extra_get(ns->ns_rs_hash, &bd);
611 at_init(&nsb->nsb_at_estimate, ldlm_enqueue_min, 0);
612 nsb->nsb_namespace = ns;
616 ns->ns_appetite = apt;
617 ns->ns_client = client;
619 INIT_LIST_HEAD(&ns->ns_list_chain);
620 INIT_LIST_HEAD(&ns->ns_unused_list);
621 spin_lock_init(&ns->ns_lock);
622 atomic_set(&ns->ns_bref, 0);
623 init_waitqueue_head(&ns->ns_waitq);
625 ns->ns_max_nolock_size = NS_DEFAULT_MAX_NOLOCK_BYTES;
626 ns->ns_contention_time = NS_DEFAULT_CONTENTION_SECONDS;
627 ns->ns_contended_locks = NS_DEFAULT_CONTENDED_LOCKS;
629 ns->ns_max_parallel_ast = LDLM_DEFAULT_PARALLEL_AST_LIMIT;
630 ns->ns_nr_unused = 0;
631 ns->ns_max_unused = LDLM_DEFAULT_LRU_SIZE;
632 ns->ns_max_age = LDLM_DEFAULT_MAX_ALIVE;
633 ns->ns_ctime_age_limit = LDLM_CTIME_AGE_LIMIT;
635 ns->ns_orig_connect_flags = 0;
636 ns->ns_connect_flags = 0;
638 rc = ldlm_namespace_proc_register(ns);
640 CERROR("Can't initialize ns proc, rc %d\n", rc);
644 idx = ldlm_namespace_nr_read(client);
645 rc = ldlm_pool_init(&ns->ns_pool, ns, idx, client);
647 CERROR("Can't initialize lock pool, rc %d\n", rc);
651 ldlm_namespace_register(ns, client);
654 ldlm_namespace_proc_unregister(ns);
655 ldlm_namespace_cleanup(ns, 0);
657 cfs_hash_putref(ns->ns_rs_hash);
664 EXPORT_SYMBOL(ldlm_namespace_new);
666 extern struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock);
669 * Cancel and destroy all locks on a resource.
671 * If flags contains FL_LOCAL_ONLY, don't try to tell the server, just
672 * clean up. This is currently only used for recovery, and we make
673 * certain assumptions as a result--notably, that we shouldn't cancel
676 static void cleanup_resource(struct ldlm_resource *res, struct list_head *q,
679 struct list_head *tmp;
680 int rc = 0, client = ns_is_client(ldlm_res_to_ns(res));
681 bool local_only = !!(flags & LDLM_FL_LOCAL_ONLY);
684 struct ldlm_lock *lock = NULL;
686 /* First, we look for non-cleaned-yet lock
687 * all cleaned locks are marked by CLEANED flag. */
689 list_for_each(tmp, q) {
690 lock = list_entry(tmp, struct ldlm_lock,
692 if (ldlm_is_cleaned(lock)) {
697 ldlm_set_cleaned(lock);
706 /* Set CBPENDING so nothing in the cancellation path
707 * can match this lock. */
708 ldlm_set_cbpending(lock);
709 ldlm_set_failed(lock);
710 lock->l_flags |= flags;
712 /* ... without sending a CANCEL message for local_only. */
714 ldlm_set_local_only(lock);
716 if (local_only && (lock->l_readers || lock->l_writers)) {
717 /* This is a little bit gross, but much better than the
718 * alternative: pretend that we got a blocking AST from
719 * the server, so that when the lock is decref'd, it
720 * will go away ... */
722 LDLM_DEBUG(lock, "setting FL_LOCAL_ONLY");
723 if (lock->l_flags & LDLM_FL_FAIL_LOC) {
724 schedule_timeout_and_set_state(
725 TASK_UNINTERRUPTIBLE,
726 cfs_time_seconds(4));
727 set_current_state(TASK_RUNNING);
729 if (lock->l_completion_ast)
730 lock->l_completion_ast(lock,
731 LDLM_FL_FAILED, NULL);
732 LDLM_LOCK_RELEASE(lock);
737 struct lustre_handle lockh;
740 ldlm_lock2handle(lock, &lockh);
741 rc = ldlm_cli_cancel(&lockh, LCF_ASYNC);
743 CERROR("ldlm_cli_cancel: %d\n", rc);
745 ldlm_resource_unlink_lock(lock);
747 LDLM_DEBUG(lock, "Freeing a lock still held by a "
749 ldlm_lock_destroy(lock);
751 LDLM_LOCK_RELEASE(lock);
755 static int ldlm_resource_clean(cfs_hash_t *hs, cfs_hash_bd_t *bd,
756 struct hlist_node *hnode, void *arg)
758 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
759 __u64 flags = *(__u64 *)arg;
761 cleanup_resource(res, &res->lr_granted, flags);
762 cleanup_resource(res, &res->lr_converting, flags);
763 cleanup_resource(res, &res->lr_waiting, flags);
768 static int ldlm_resource_complain(cfs_hash_t *hs, cfs_hash_bd_t *bd,
769 struct hlist_node *hnode, void *arg)
771 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
774 CERROR("%s: namespace resource "DLDLMRES" (%p) refcount nonzero "
775 "(%d) after lock cleanup; forcing cleanup.\n",
776 ldlm_ns_name(ldlm_res_to_ns(res)), PLDLMRES(res), res,
777 atomic_read(&res->lr_refcount) - 1);
779 ldlm_resource_dump(D_ERROR, res);
785 * Cancel and destroy all locks in the namespace.
787 * Typically used during evictions when server notified client that it was
788 * evicted and all of its state needs to be destroyed.
789 * Also used during shutdown.
791 int ldlm_namespace_cleanup(struct ldlm_namespace *ns, __u64 flags)
794 CDEBUG(D_INFO, "NULL ns, skipping cleanup\n");
798 cfs_hash_for_each_nolock(ns->ns_rs_hash, ldlm_resource_clean, &flags);
799 cfs_hash_for_each_nolock(ns->ns_rs_hash, ldlm_resource_complain, NULL);
802 EXPORT_SYMBOL(ldlm_namespace_cleanup);
805 * Attempts to free namespace.
807 * Only used when namespace goes away, like during an unmount.
809 static int __ldlm_namespace_free(struct ldlm_namespace *ns, int force)
813 /* At shutdown time, don't call the cancellation callback */
814 ldlm_namespace_cleanup(ns, force ? LDLM_FL_LOCAL_ONLY : 0);
816 if (atomic_read(&ns->ns_bref) > 0) {
817 struct l_wait_info lwi = LWI_INTR(LWI_ON_SIGNAL_NOOP, NULL);
820 "dlm namespace %s free waiting on refcount %d\n",
821 ldlm_ns_name(ns), atomic_read(&ns->ns_bref));
824 lwi = LWI_TIMEOUT(obd_timeout * HZ / 4, NULL, NULL);
826 rc = l_wait_event(ns->ns_waitq,
827 atomic_read(&ns->ns_bref) == 0, &lwi);
829 /* Forced cleanups should be able to reclaim all references,
830 * so it's safe to wait forever... we can't leak locks... */
831 if (force && rc == -ETIMEDOUT) {
832 LCONSOLE_ERROR("Forced cleanup waiting for %s "
833 "namespace with %d resources in use, "
834 "(rc=%d)\n", ldlm_ns_name(ns),
835 atomic_read(&ns->ns_bref), rc);
836 GOTO(force_wait, rc);
839 if (atomic_read(&ns->ns_bref)) {
840 LCONSOLE_ERROR("Cleanup waiting for %s namespace "
841 "with %d resources in use, (rc=%d)\n",
843 atomic_read(&ns->ns_bref), rc);
844 RETURN(ELDLM_NAMESPACE_EXISTS);
846 CDEBUG(D_DLMTRACE, "dlm namespace %s free done waiting\n",
854 * Performs various cleanups for passed \a ns to make it drop refc and be
855 * ready for freeing. Waits for refc == 0.
857 * The following is done:
858 * (0) Unregister \a ns from its list to make inaccessible for potential
859 * users like pools thread and others;
860 * (1) Clear all locks in \a ns.
862 void ldlm_namespace_free_prior(struct ldlm_namespace *ns,
863 struct obd_import *imp,
873 spin_lock(&ns->ns_lock);
875 spin_unlock(&ns->ns_lock);
878 * Can fail with -EINTR when force == 0 in which case try harder.
880 rc = __ldlm_namespace_free(ns, force);
881 if (rc != ELDLM_OK) {
883 ptlrpc_disconnect_import(imp, 0);
884 ptlrpc_invalidate_import(imp);
888 * With all requests dropped and the import inactive
889 * we are gaurenteed all reference will be dropped.
891 rc = __ldlm_namespace_free(ns, 1);
898 * Performs freeing memory structures related to \a ns. This is only done
899 * when ldlm_namespce_free_prior() successfully removed all resources
900 * referencing \a ns and its refc == 0.
902 void ldlm_namespace_free_post(struct ldlm_namespace *ns)
910 /* Make sure that nobody can find this ns in its list. */
911 ldlm_namespace_unregister(ns, ns->ns_client);
912 /* Fini pool _before_ parent proc dir is removed. This is important as
913 * ldlm_pool_fini() removes own proc dir which is child to @dir.
914 * Removing it after @dir may cause oops. */
915 ldlm_pool_fini(&ns->ns_pool);
917 ldlm_namespace_proc_unregister(ns);
918 cfs_hash_putref(ns->ns_rs_hash);
919 /* Namespace \a ns should be not on list at this time, otherwise
920 * this will cause issues related to using freed \a ns in poold
922 LASSERT(list_empty(&ns->ns_list_chain));
929 * Cleanup the resource, and free namespace.
932 * proc1: destroy import
933 * class_disconnect_export(grab cl_sem) ->
934 * -> ldlm_namespace_free ->
935 * -> lprocfs_remove(grab _lprocfs_lock).
936 * proc2: read proc info
937 * lprocfs_fops_read(grab _lprocfs_lock) ->
938 * -> osc_rd_active, etc(grab cl_sem).
940 * So that I have to split the ldlm_namespace_free into two parts - the first
941 * part ldlm_namespace_free_prior is used to cleanup the resource which is
942 * being used; the 2nd part ldlm_namespace_free_post is used to unregister the
943 * lprocfs entries, and then free memory. It will be called w/o cli->cl_sem
946 void ldlm_namespace_free(struct ldlm_namespace *ns,
947 struct obd_import *imp,
950 ldlm_namespace_free_prior(ns, imp, force);
951 ldlm_namespace_free_post(ns);
953 EXPORT_SYMBOL(ldlm_namespace_free);
955 void ldlm_namespace_get(struct ldlm_namespace *ns)
957 atomic_inc(&ns->ns_bref);
959 EXPORT_SYMBOL(ldlm_namespace_get);
961 /* This is only for callers that care about refcount */
962 int ldlm_namespace_get_return(struct ldlm_namespace *ns)
964 return atomic_inc_return(&ns->ns_bref);
967 void ldlm_namespace_put(struct ldlm_namespace *ns)
969 if (atomic_dec_and_lock(&ns->ns_bref, &ns->ns_lock)) {
970 wake_up(&ns->ns_waitq);
971 spin_unlock(&ns->ns_lock);
974 EXPORT_SYMBOL(ldlm_namespace_put);
976 /** Register \a ns in the list of namespaces */
977 void ldlm_namespace_register(struct ldlm_namespace *ns, ldlm_side_t client)
979 mutex_lock(ldlm_namespace_lock(client));
980 LASSERT(list_empty(&ns->ns_list_chain));
981 list_add(&ns->ns_list_chain, ldlm_namespace_inactive_list(client));
982 ldlm_namespace_nr_inc(client);
983 mutex_unlock(ldlm_namespace_lock(client));
986 /** Unregister \a ns from the list of namespaces. */
987 void ldlm_namespace_unregister(struct ldlm_namespace *ns, ldlm_side_t client)
989 mutex_lock(ldlm_namespace_lock(client));
990 LASSERT(!list_empty(&ns->ns_list_chain));
991 /* Some asserts and possibly other parts of the code are still
992 * using list_empty(&ns->ns_list_chain). This is why it is
993 * important to use list_del_init() here. */
994 list_del_init(&ns->ns_list_chain);
995 ldlm_namespace_nr_dec(client);
996 mutex_unlock(ldlm_namespace_lock(client));
999 /** Should be called with ldlm_namespace_lock(client) taken. */
1000 void ldlm_namespace_move_to_active_locked(struct ldlm_namespace *ns,
1003 LASSERT(!list_empty(&ns->ns_list_chain));
1004 LASSERT(mutex_is_locked(ldlm_namespace_lock(client)));
1005 list_move_tail(&ns->ns_list_chain, ldlm_namespace_list(client));
1008 /** Should be called with ldlm_namespace_lock(client) taken. */
1009 void ldlm_namespace_move_to_inactive_locked(struct ldlm_namespace *ns,
1012 LASSERT(!list_empty(&ns->ns_list_chain));
1013 LASSERT(mutex_is_locked(ldlm_namespace_lock(client)));
1014 list_move_tail(&ns->ns_list_chain,
1015 ldlm_namespace_inactive_list(client));
1018 /** Should be called with ldlm_namespace_lock(client) taken. */
1019 struct ldlm_namespace *ldlm_namespace_first_locked(ldlm_side_t client)
1021 LASSERT(mutex_is_locked(ldlm_namespace_lock(client)));
1022 LASSERT(!list_empty(ldlm_namespace_list(client)));
1023 return container_of(ldlm_namespace_list(client)->next,
1024 struct ldlm_namespace, ns_list_chain);
1027 /** Create and initialize new resource. */
1028 static struct ldlm_resource *ldlm_resource_new(void)
1030 struct ldlm_resource *res;
1033 OBD_SLAB_ALLOC_PTR_GFP(res, ldlm_resource_slab, GFP_NOFS);
1037 INIT_LIST_HEAD(&res->lr_granted);
1038 INIT_LIST_HEAD(&res->lr_converting);
1039 INIT_LIST_HEAD(&res->lr_waiting);
1041 /* Initialize interval trees for each lock mode. */
1042 for (idx = 0; idx < LCK_MODE_NUM; idx++) {
1043 res->lr_itree[idx].lit_size = 0;
1044 res->lr_itree[idx].lit_mode = 1 << idx;
1045 res->lr_itree[idx].lit_root = NULL;
1048 atomic_set(&res->lr_refcount, 1);
1049 spin_lock_init(&res->lr_lock);
1050 lu_ref_init(&res->lr_reference);
1052 /* Since LVB init can be delayed now, there is no longer need to
1053 * immediatelly acquire mutex here. */
1054 mutex_init(&res->lr_lvb_mutex);
1055 res->lr_lvb_initialized = false;
1061 * Return a reference to resource with given name, creating it if necessary.
1062 * Args: namespace with ns_lock unlocked
1063 * Locks: takes and releases NS hash-lock and res->lr_lock
1064 * Returns: referenced, unlocked ldlm_resource or NULL
1066 struct ldlm_resource *
1067 ldlm_resource_get(struct ldlm_namespace *ns, struct ldlm_resource *parent,
1068 const struct ldlm_res_id *name, ldlm_type_t type, int create)
1070 struct hlist_node *hnode;
1071 struct ldlm_resource *res = NULL;
1074 int ns_refcount = 0;
1076 LASSERT(ns != NULL);
1077 LASSERT(parent == NULL);
1078 LASSERT(ns->ns_rs_hash != NULL);
1079 LASSERT(name->name[0] != 0);
1081 cfs_hash_bd_get_and_lock(ns->ns_rs_hash, (void *)name, &bd, 0);
1082 hnode = cfs_hash_bd_lookup_locked(ns->ns_rs_hash, &bd, (void *)name);
1083 if (hnode != NULL) {
1084 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 0);
1088 version = cfs_hash_bd_version_get(&bd);
1089 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 0);
1092 return ERR_PTR(-ENOENT);
1094 LASSERTF(type >= LDLM_MIN_TYPE && type < LDLM_MAX_TYPE,
1095 "type: %d\n", type);
1096 res = ldlm_resource_new();
1098 return ERR_PTR(-ENOMEM);
1100 res->lr_ns_bucket = cfs_hash_bd_extra_get(ns->ns_rs_hash, &bd);
1101 res->lr_name = *name;
1102 res->lr_type = type;
1103 res->lr_most_restr = LCK_NL;
1105 cfs_hash_bd_lock(ns->ns_rs_hash, &bd, 1);
1106 hnode = (version == cfs_hash_bd_version_get(&bd)) ? NULL :
1107 cfs_hash_bd_lookup_locked(ns->ns_rs_hash, &bd, (void *)name);
1109 if (hnode != NULL) {
1110 /* Someone won the race and already added the resource. */
1111 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
1112 /* Clean lu_ref for failed resource. */
1113 lu_ref_fini(&res->lr_reference);
1114 OBD_SLAB_FREE(res, ldlm_resource_slab, sizeof *res);
1116 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
1119 /* We won! Let's add the resource. */
1120 cfs_hash_bd_add_locked(ns->ns_rs_hash, &bd, &res->lr_hash);
1121 if (cfs_hash_bd_count_get(&bd) == 1)
1122 ns_refcount = ldlm_namespace_get_return(ns);
1124 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
1126 OBD_FAIL_TIMEOUT(OBD_FAIL_LDLM_CREATE_RESOURCE, 2);
1128 /* Let's see if we happened to be the very first resource in this
1129 * namespace. If so, and this is a client namespace, we need to move
1130 * the namespace into the active namespaces list to be patrolled by
1131 * the ldlm_poold. */
1132 if (ns_is_client(ns) && ns_refcount == 1) {
1133 mutex_lock(ldlm_namespace_lock(LDLM_NAMESPACE_CLIENT));
1134 ldlm_namespace_move_to_active_locked(ns, LDLM_NAMESPACE_CLIENT);
1135 mutex_unlock(ldlm_namespace_lock(LDLM_NAMESPACE_CLIENT));
1140 EXPORT_SYMBOL(ldlm_resource_get);
1142 struct ldlm_resource *ldlm_resource_getref(struct ldlm_resource *res)
1144 LASSERT(res != NULL);
1145 LASSERT(res != LP_POISON);
1146 atomic_inc(&res->lr_refcount);
1147 CDEBUG(D_INFO, "getref res: %p count: %d\n", res,
1148 atomic_read(&res->lr_refcount));
1152 static void __ldlm_resource_putref_final(cfs_hash_bd_t *bd,
1153 struct ldlm_resource *res)
1155 struct ldlm_ns_bucket *nsb = res->lr_ns_bucket;
1157 if (!list_empty(&res->lr_granted)) {
1158 ldlm_resource_dump(D_ERROR, res);
1162 if (!list_empty(&res->lr_converting)) {
1163 ldlm_resource_dump(D_ERROR, res);
1167 if (!list_empty(&res->lr_waiting)) {
1168 ldlm_resource_dump(D_ERROR, res);
1172 cfs_hash_bd_del_locked(nsb->nsb_namespace->ns_rs_hash,
1174 lu_ref_fini(&res->lr_reference);
1175 if (cfs_hash_bd_count_get(bd) == 0)
1176 ldlm_namespace_put(nsb->nsb_namespace);
1179 /* Returns 1 if the resource was freed, 0 if it remains. */
1180 int ldlm_resource_putref(struct ldlm_resource *res)
1182 struct ldlm_namespace *ns = ldlm_res_to_ns(res);
1185 LASSERT_ATOMIC_GT_LT(&res->lr_refcount, 0, LI_POISON);
1186 CDEBUG(D_INFO, "putref res: %p count: %d\n",
1187 res, atomic_read(&res->lr_refcount) - 1);
1189 cfs_hash_bd_get(ns->ns_rs_hash, &res->lr_name, &bd);
1190 if (cfs_hash_bd_dec_and_lock(ns->ns_rs_hash, &bd, &res->lr_refcount)) {
1191 __ldlm_resource_putref_final(&bd, res);
1192 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
1193 if (ns->ns_lvbo && ns->ns_lvbo->lvbo_free)
1194 ns->ns_lvbo->lvbo_free(res);
1195 OBD_SLAB_FREE(res, ldlm_resource_slab, sizeof *res);
1200 EXPORT_SYMBOL(ldlm_resource_putref);
1202 /* Returns 1 if the resource was freed, 0 if it remains. */
1203 int ldlm_resource_putref_locked(struct ldlm_resource *res)
1205 struct ldlm_namespace *ns = ldlm_res_to_ns(res);
1207 LASSERT_ATOMIC_GT_LT(&res->lr_refcount, 0, LI_POISON);
1208 CDEBUG(D_INFO, "putref res: %p count: %d\n",
1209 res, atomic_read(&res->lr_refcount) - 1);
1211 if (atomic_dec_and_test(&res->lr_refcount)) {
1214 cfs_hash_bd_get(ldlm_res_to_ns(res)->ns_rs_hash,
1215 &res->lr_name, &bd);
1216 __ldlm_resource_putref_final(&bd, res);
1217 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
1218 /* NB: ns_rs_hash is created with CFS_HASH_NO_ITEMREF,
1219 * so we should never be here while calling cfs_hash_del,
1220 * cfs_hash_for_each_nolock is the only case we can get
1221 * here, which is safe to release cfs_hash_bd_lock.
1223 if (ns->ns_lvbo && ns->ns_lvbo->lvbo_free)
1224 ns->ns_lvbo->lvbo_free(res);
1225 OBD_SLAB_FREE(res, ldlm_resource_slab, sizeof *res);
1227 cfs_hash_bd_lock(ns->ns_rs_hash, &bd, 1);
1234 * Add a lock into a given resource into specified lock list.
1236 void ldlm_resource_add_lock(struct ldlm_resource *res, struct list_head *head,
1237 struct ldlm_lock *lock)
1239 check_res_locked(res);
1241 LDLM_DEBUG(lock, "About to add this lock:\n");
1243 if (ldlm_is_destroyed(lock)) {
1244 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
1248 LASSERT(list_empty(&lock->l_res_link));
1250 list_add_tail(&lock->l_res_link, head);
1254 * Insert a lock into resource after specified lock.
1256 * Obtain resource description from the lock we are inserting after.
1258 void ldlm_resource_insert_lock_after(struct ldlm_lock *original,
1259 struct ldlm_lock *new)
1261 struct ldlm_resource *res = original->l_resource;
1263 check_res_locked(res);
1265 ldlm_resource_dump(D_INFO, res);
1266 LDLM_DEBUG(new, "About to insert this lock after %p:\n", original);
1268 if (ldlm_is_destroyed(new)) {
1269 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
1273 LASSERT(list_empty(&new->l_res_link));
1275 list_add(&new->l_res_link, &original->l_res_link);
1279 void ldlm_resource_unlink_lock(struct ldlm_lock *lock)
1281 int type = lock->l_resource->lr_type;
1283 check_res_locked(lock->l_resource);
1284 if (type == LDLM_IBITS || type == LDLM_PLAIN)
1285 ldlm_unlink_lock_skiplist(lock);
1286 else if (type == LDLM_EXTENT)
1287 ldlm_extent_unlink_lock(lock);
1288 list_del_init(&lock->l_res_link);
1290 EXPORT_SYMBOL(ldlm_resource_unlink_lock);
1292 void ldlm_res2desc(struct ldlm_resource *res, struct ldlm_resource_desc *desc)
1294 desc->lr_type = res->lr_type;
1295 desc->lr_name = res->lr_name;
1299 * Print information about all locks in all namespaces on this node to debug
1302 void ldlm_dump_all_namespaces(ldlm_side_t client, int level)
1304 struct list_head *tmp;
1306 if (!((libcfs_debug | D_ERROR) & level))
1309 mutex_lock(ldlm_namespace_lock(client));
1311 list_for_each(tmp, ldlm_namespace_list(client)) {
1312 struct ldlm_namespace *ns;
1313 ns = list_entry(tmp, struct ldlm_namespace, ns_list_chain);
1314 ldlm_namespace_dump(level, ns);
1317 mutex_unlock(ldlm_namespace_lock(client));
1319 EXPORT_SYMBOL(ldlm_dump_all_namespaces);
1321 static int ldlm_res_hash_dump(cfs_hash_t *hs, cfs_hash_bd_t *bd,
1322 struct hlist_node *hnode, void *arg)
1324 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
1325 int level = (int)(unsigned long)arg;
1328 ldlm_resource_dump(level, res);
1335 * Print information about all locks in this namespace on this node to debug
1338 void ldlm_namespace_dump(int level, struct ldlm_namespace *ns)
1340 if (!((libcfs_debug | D_ERROR) & level))
1343 CDEBUG(level, "--- Namespace: %s (rc: %d, side: %s)\n",
1344 ldlm_ns_name(ns), atomic_read(&ns->ns_bref),
1345 ns_is_client(ns) ? "client" : "server");
1347 if (cfs_time_before(cfs_time_current(), ns->ns_next_dump))
1350 cfs_hash_for_each_nolock(ns->ns_rs_hash,
1352 (void *)(unsigned long)level);
1353 spin_lock(&ns->ns_lock);
1354 ns->ns_next_dump = cfs_time_shift(10);
1355 spin_unlock(&ns->ns_lock);
1357 EXPORT_SYMBOL(ldlm_namespace_dump);
1360 * Print information about all locks in this resource to debug log.
1362 void ldlm_resource_dump(int level, struct ldlm_resource *res)
1364 struct ldlm_lock *lock;
1365 unsigned int granted = 0;
1367 CLASSERT(RES_NAME_SIZE == 4);
1369 if (!((libcfs_debug | D_ERROR) & level))
1372 CDEBUG(level, "--- Resource: "DLDLMRES" (%p) refcount = %d\n",
1373 PLDLMRES(res), res, atomic_read(&res->lr_refcount));
1375 if (!list_empty(&res->lr_granted)) {
1376 CDEBUG(level, "Granted locks (in reverse order):\n");
1377 list_for_each_entry_reverse(lock, &res->lr_granted,
1379 LDLM_DEBUG_LIMIT(level, lock, "###");
1380 if (!(level & D_CANTMASK) &&
1381 ++granted > ldlm_dump_granted_max) {
1382 CDEBUG(level, "only dump %d granted locks to "
1383 "avoid DDOS.\n", granted);
1388 if (!list_empty(&res->lr_converting)) {
1389 CDEBUG(level, "Converting locks:\n");
1390 list_for_each_entry(lock, &res->lr_converting, l_res_link)
1391 LDLM_DEBUG_LIMIT(level, lock, "###");
1393 if (!list_empty(&res->lr_waiting)) {
1394 CDEBUG(level, "Waiting locks:\n");
1395 list_for_each_entry(lock, &res->lr_waiting, l_res_link)
1396 LDLM_DEBUG_LIMIT(level, lock, "###");