1 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
2 * vim:expandtab:shiftwidth=8:tabstop=8:
6 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License version 2 only,
10 * as published by the Free Software Foundation.
12 * This program is distributed in the hope that it will be useful, but
13 * WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * General Public License version 2 for more details (a copy is included
16 * in the LICENSE file that accompanied this code).
18 * You should have received a copy of the GNU General Public License
19 * version 2 along with this program; If not, see
20 * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
22 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
23 * CA 95054 USA or visit www.sun.com if you need additional information or
29 * Copyright 2008 Sun Microsystems, Inc. All rights reserved
30 * Use is subject to license terms.
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
44 # include <lustre_dlm.h>
46 # include <liblustre.h>
49 #include <obd_class.h>
50 #include "ldlm_internal.h"
52 cfs_mem_cache_t *ldlm_resource_slab, *ldlm_lock_slab;
54 atomic_t ldlm_srv_namespace_nr = ATOMIC_INIT(0);
55 atomic_t ldlm_cli_namespace_nr = ATOMIC_INIT(0);
57 struct semaphore ldlm_srv_namespace_lock;
58 CFS_LIST_HEAD(ldlm_srv_namespace_list);
60 struct semaphore ldlm_cli_namespace_lock;
61 CFS_LIST_HEAD(ldlm_cli_namespace_list);
63 cfs_proc_dir_entry_t *ldlm_type_proc_dir = NULL;
64 cfs_proc_dir_entry_t *ldlm_ns_proc_dir = NULL;
65 cfs_proc_dir_entry_t *ldlm_svc_proc_dir = NULL;
68 static int ldlm_proc_dump_ns(struct file *file, const char *buffer,
69 unsigned long count, void *data)
71 ldlm_dump_all_namespaces(LDLM_NAMESPACE_SERVER, D_DLMTRACE);
72 ldlm_dump_all_namespaces(LDLM_NAMESPACE_CLIENT, D_DLMTRACE);
76 int ldlm_proc_setup(void)
79 struct lprocfs_vars list[] = {
80 { "dump_namespaces", NULL, ldlm_proc_dump_ns, NULL },
83 LASSERT(ldlm_ns_proc_dir == NULL);
85 ldlm_type_proc_dir = lprocfs_register(OBD_LDLM_DEVICENAME,
88 if (IS_ERR(ldlm_type_proc_dir)) {
89 CERROR("LProcFS failed in ldlm-init\n");
90 rc = PTR_ERR(ldlm_type_proc_dir);
94 ldlm_ns_proc_dir = lprocfs_register("namespaces",
97 if (IS_ERR(ldlm_ns_proc_dir)) {
98 CERROR("LProcFS failed in ldlm-init\n");
99 rc = PTR_ERR(ldlm_ns_proc_dir);
103 ldlm_svc_proc_dir = lprocfs_register("services",
106 if (IS_ERR(ldlm_svc_proc_dir)) {
107 CERROR("LProcFS failed in ldlm-init\n");
108 rc = PTR_ERR(ldlm_svc_proc_dir);
112 rc = lprocfs_add_vars(ldlm_type_proc_dir, list, NULL);
117 lprocfs_remove(&ldlm_ns_proc_dir);
119 lprocfs_remove(&ldlm_type_proc_dir);
121 ldlm_svc_proc_dir = NULL;
125 void ldlm_proc_cleanup(void)
127 if (ldlm_svc_proc_dir)
128 lprocfs_remove(&ldlm_svc_proc_dir);
130 if (ldlm_ns_proc_dir)
131 lprocfs_remove(&ldlm_ns_proc_dir);
133 if (ldlm_type_proc_dir)
134 lprocfs_remove(&ldlm_type_proc_dir);
137 static int lprocfs_rd_lru_size(char *page, char **start, off_t off,
138 int count, int *eof, void *data)
140 struct ldlm_namespace *ns = data;
141 __u32 *nr = &ns->ns_max_unused;
143 if (ns_connect_lru_resize(ns))
144 nr = &ns->ns_nr_unused;
145 return lprocfs_rd_uint(page, start, off, count, eof, nr);
148 static int lprocfs_wr_lru_size(struct file *file, const char *buffer,
149 unsigned long count, void *data)
151 struct ldlm_namespace *ns = data;
152 char dummy[MAX_STRING_SIZE + 1], *end;
156 dummy[MAX_STRING_SIZE] = '\0';
157 if (copy_from_user(dummy, buffer, MAX_STRING_SIZE))
160 if (strncmp(dummy, "clear", 5) == 0) {
162 "dropping all unused locks from namespace %s\n",
164 if (ns_connect_lru_resize(ns)) {
165 int canceled, unused = ns->ns_nr_unused;
167 /* Try to cancel all @ns_nr_unused locks. */
168 canceled = ldlm_cancel_lru(ns, unused, LDLM_SYNC,
170 if (canceled < unused) {
171 CERROR("not all requested locks are canceled, "
172 "requested: %d, canceled: %d\n", unused,
177 tmp = ns->ns_max_unused;
178 ns->ns_max_unused = 0;
179 ldlm_cancel_lru(ns, 0, LDLM_SYNC, LDLM_CANCEL_PASSED);
180 ns->ns_max_unused = tmp;
185 tmp = simple_strtoul(dummy, &end, 0);
187 CERROR("invalid value written\n");
190 lru_resize = (tmp == 0);
192 if (ns_connect_lru_resize(ns)) {
194 ns->ns_max_unused = (unsigned int)tmp;
196 if (tmp > ns->ns_nr_unused)
197 tmp = ns->ns_nr_unused;
198 tmp = ns->ns_nr_unused - tmp;
201 "changing namespace %s unused locks from %u to %u\n",
202 ns->ns_name, ns->ns_nr_unused, (unsigned int)tmp);
203 ldlm_cancel_lru(ns, tmp, LDLM_ASYNC, LDLM_CANCEL_PASSED);
207 "disable lru_resize for namespace %s\n",
209 ns->ns_connect_flags &= ~OBD_CONNECT_LRU_RESIZE;
213 "changing namespace %s max_unused from %u to %u\n",
214 ns->ns_name, ns->ns_max_unused, (unsigned int)tmp);
215 ns->ns_max_unused = (unsigned int)tmp;
216 ldlm_cancel_lru(ns, 0, LDLM_ASYNC, LDLM_CANCEL_PASSED);
218 /* Make sure that originally lru resize was supported before
219 * turning it on here. */
221 (ns->ns_orig_connect_flags & OBD_CONNECT_LRU_RESIZE)) {
223 "enable lru_resize for namespace %s\n",
225 ns->ns_connect_flags |= OBD_CONNECT_LRU_RESIZE;
232 void ldlm_proc_namespace(struct ldlm_namespace *ns)
234 struct lprocfs_vars lock_vars[2];
235 char lock_name[MAX_STRING_SIZE + 1];
238 LASSERT(ns->ns_name != NULL);
240 lock_name[MAX_STRING_SIZE] = '\0';
242 memset(lock_vars, 0, sizeof(lock_vars));
243 lock_vars[0].name = lock_name;
245 snprintf(lock_name, MAX_STRING_SIZE, "%s/resource_count", ns->ns_name);
246 lock_vars[0].data = &ns->ns_refcount;
247 lock_vars[0].read_fptr = lprocfs_rd_atomic;
248 lprocfs_add_vars(ldlm_ns_proc_dir, lock_vars, 0);
250 snprintf(lock_name, MAX_STRING_SIZE, "%s/lock_count", ns->ns_name);
251 lock_vars[0].data = &ns->ns_locks;
252 lock_vars[0].read_fptr = lprocfs_rd_atomic;
253 lprocfs_add_vars(ldlm_ns_proc_dir, lock_vars, 0);
255 if (ns_is_client(ns)) {
256 snprintf(lock_name, MAX_STRING_SIZE, "%s/lock_unused_count",
258 lock_vars[0].data = &ns->ns_nr_unused;
259 lock_vars[0].read_fptr = lprocfs_rd_uint;
260 lprocfs_add_vars(ldlm_ns_proc_dir, lock_vars, 0);
262 snprintf(lock_name, MAX_STRING_SIZE, "%s/lru_size",
264 lock_vars[0].data = ns;
265 lock_vars[0].read_fptr = lprocfs_rd_lru_size;
266 lock_vars[0].write_fptr = lprocfs_wr_lru_size;
267 lprocfs_add_vars(ldlm_ns_proc_dir, lock_vars, 0);
269 snprintf(lock_name, MAX_STRING_SIZE, "%s/shrink_thumb",
271 lock_vars[0].data = ns;
272 lock_vars[0].read_fptr = lprocfs_rd_uint;
273 lock_vars[0].write_fptr = lprocfs_wr_uint;
274 lprocfs_add_vars(ldlm_ns_proc_dir, lock_vars, 0);
276 snprintf(lock_name, MAX_STRING_SIZE, "%s/lru_max_age",
278 lock_vars[0].data = &ns->ns_max_age;
279 lock_vars[0].read_fptr = lprocfs_rd_uint;
280 lock_vars[0].write_fptr = lprocfs_wr_uint;
281 lprocfs_add_vars(ldlm_ns_proc_dir, lock_vars, 0);
283 snprintf(lock_name, MAX_STRING_SIZE, "%s/ctime_age_limit",
285 lock_vars[0].data = &ns->ns_ctime_age_limit;
286 lock_vars[0].read_fptr = lprocfs_rd_uint;
287 lock_vars[0].write_fptr = lprocfs_wr_uint;
288 lprocfs_add_vars(ldlm_ns_proc_dir, lock_vars, 0);
290 snprintf(lock_name, MAX_STRING_SIZE, "%s/max_nolock_bytes",
292 lock_vars[0].data = &ns->ns_max_nolock_size;
293 lock_vars[0].read_fptr = lprocfs_rd_uint;
294 lock_vars[0].write_fptr = lprocfs_wr_uint;
295 lprocfs_add_vars(ldlm_ns_proc_dir, lock_vars, 0);
297 snprintf(lock_name, MAX_STRING_SIZE, "%s/contention_seconds",
299 lock_vars[0].data = &ns->ns_contention_time;
300 lock_vars[0].read_fptr = lprocfs_rd_uint;
301 lock_vars[0].write_fptr = lprocfs_wr_uint;
302 lprocfs_add_vars(ldlm_ns_proc_dir, lock_vars, 0);
304 snprintf(lock_name, MAX_STRING_SIZE, "%s/contended_locks",
306 lock_vars[0].data = &ns->ns_contended_locks;
307 lock_vars[0].read_fptr = lprocfs_rd_uint;
308 lock_vars[0].write_fptr = lprocfs_wr_uint;
309 lprocfs_add_vars(ldlm_ns_proc_dir, lock_vars, 0);
312 #undef MAX_STRING_SIZE
314 #define ldlm_proc_namespace(ns) do {} while (0)
317 struct ldlm_namespace *ldlm_namespace_new(struct obd_device *obd, char *name,
318 ldlm_side_t client, ldlm_appetite_t apt)
320 struct ldlm_namespace *ns = NULL;
321 struct list_head *bucket;
322 int rc, idx, namelen;
327 CERROR("ldlm_get_ref failed: %d\n", rc);
335 OBD_VMALLOC(ns->ns_hash, sizeof(*ns->ns_hash) * RES_HASH_SIZE);
339 ns->ns_shrink_thumb = LDLM_LOCK_SHRINK_THUMB;
340 ns->ns_appetite = apt;
342 LASSERT(obd != NULL);
345 namelen = strlen(name);
346 OBD_ALLOC(ns->ns_name, namelen + 1);
348 GOTO(out_hash, NULL);
350 strcpy(ns->ns_name, name);
352 CFS_INIT_LIST_HEAD(&ns->ns_root_list);
353 CFS_INIT_LIST_HEAD(&ns->ns_list_chain);
355 ns->ns_client = client;
356 spin_lock_init(&ns->ns_hash_lock);
357 atomic_set(&ns->ns_locks, 0);
358 ns->ns_resources = 0;
359 cfs_waitq_init(&ns->ns_waitq);
360 ns->ns_max_nolock_size = NS_DEFAULT_MAX_NOLOCK_BYTES;
361 ns->ns_contention_time = NS_DEFAULT_CONTENTION_SECONDS;
362 ns->ns_contended_locks = NS_DEFAULT_CONTENDED_LOCKS;
364 for (bucket = ns->ns_hash + RES_HASH_SIZE - 1; bucket >= ns->ns_hash;
366 CFS_INIT_LIST_HEAD(bucket);
368 CFS_INIT_LIST_HEAD(&ns->ns_unused_list);
369 ns->ns_nr_unused = 0;
370 ns->ns_max_unused = LDLM_DEFAULT_LRU_SIZE;
371 ns->ns_max_age = LDLM_DEFAULT_MAX_ALIVE;
372 ns->ns_ctime_age_limit = LDLM_CTIME_AGE_LIMIT;
373 spin_lock_init(&ns->ns_unused_lock);
374 ns->ns_orig_connect_flags = 0;
375 ns->ns_connect_flags = 0;
376 ldlm_proc_namespace(ns);
378 idx = atomic_read(ldlm_namespace_nr(client));
379 rc = ldlm_pool_init(&ns->ns_pool, ns, idx, client);
381 CERROR("Can't initialize lock pool, rc %d\n", rc);
385 at_init(&ns->ns_at_estimate, ldlm_enqueue_min, 0);
387 ldlm_namespace_register(ns, client);
390 ldlm_namespace_cleanup(ns, 0);
391 OBD_FREE(ns->ns_name, namelen + 1);
393 OBD_VFREE(ns->ns_hash, sizeof(*ns->ns_hash) * RES_HASH_SIZE);
401 extern struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock);
403 /* If flags contains FL_LOCAL_ONLY, don't try to tell the server, just cleanup.
404 * This is currently only used for recovery, and we make certain assumptions
405 * as a result--notably, that we shouldn't cancel locks with refs. -phil
407 * Called with the ns_lock held. */
408 static void cleanup_resource(struct ldlm_resource *res, struct list_head *q,
411 struct list_head *tmp;
412 int rc = 0, client = ns_is_client(res->lr_namespace);
413 int local_only = (flags & LDLM_FL_LOCAL_ONLY);
418 struct ldlm_lock *lock = NULL;
420 /* first, we look for non-cleaned-yet lock
421 * all cleaned locks are marked by CLEANED flag */
423 list_for_each(tmp, q) {
424 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
425 if (lock->l_flags & LDLM_FL_CLEANED) {
430 lock->l_flags |= LDLM_FL_CLEANED;
439 /* Set CBPENDING so nothing in the cancellation path
440 * can match this lock */
441 lock->l_flags |= LDLM_FL_CBPENDING;
442 lock->l_flags |= LDLM_FL_FAILED;
443 lock->l_flags |= flags;
445 /* ... without sending a CANCEL message for local_only. */
447 lock->l_flags |= LDLM_FL_LOCAL_ONLY;
449 if (local_only && (lock->l_readers || lock->l_writers)) {
450 /* This is a little bit gross, but much better than the
451 * alternative: pretend that we got a blocking AST from
452 * the server, so that when the lock is decref'd, it
453 * will go away ... */
455 LDLM_DEBUG(lock, "setting FL_LOCAL_ONLY");
456 if (lock->l_completion_ast)
457 lock->l_completion_ast(lock, 0, NULL);
463 struct lustre_handle lockh;
466 ldlm_lock2handle(lock, &lockh);
467 rc = ldlm_cli_cancel(&lockh);
469 CERROR("ldlm_cli_cancel: %d\n", rc);
471 ldlm_resource_unlink_lock(lock);
473 LDLM_DEBUG(lock, "Freeing a lock still held by a "
475 ldlm_lock_destroy(lock);
483 int ldlm_namespace_cleanup(struct ldlm_namespace *ns, int flags)
485 struct list_head *tmp;
489 CDEBUG(D_INFO, "NULL ns, skipping cleanup\n");
493 for (i = 0; i < RES_HASH_SIZE; i++) {
494 spin_lock(&ns->ns_hash_lock);
495 tmp = ns->ns_hash[i].next;
496 while (tmp != &(ns->ns_hash[i])) {
497 struct ldlm_resource *res;
498 res = list_entry(tmp, struct ldlm_resource, lr_hash);
499 ldlm_resource_getref(res);
500 spin_unlock(&ns->ns_hash_lock);
502 cleanup_resource(res, &res->lr_granted, flags);
503 cleanup_resource(res, &res->lr_converting, flags);
504 cleanup_resource(res, &res->lr_waiting, flags);
506 spin_lock(&ns->ns_hash_lock);
509 /* XXX: former stuff caused issues in case of race
510 * between ldlm_namespace_cleanup() and lockd() when
511 * client gets blocking ast when lock gets distracted by
512 * server. This is 1_4 branch solution, let's see how
514 if (!ldlm_resource_putref_locked(res))
516 "Namespace %s resource refcount nonzero "
517 "(%d) after lock cleanup; forcing cleanup.\n",
518 ns->ns_name, atomic_read(&res->lr_refcount));
520 spin_unlock(&ns->ns_hash_lock);
526 static int __ldlm_namespace_free(struct ldlm_namespace *ns, int force)
530 /* At shutdown time, don't call the cancellation callback */
531 ldlm_namespace_cleanup(ns, force ? LDLM_FL_LOCAL_ONLY : 0);
533 if (ns->ns_refcount > 0) {
534 struct l_wait_info lwi = LWI_INTR(LWI_ON_SIGNAL_NOOP, NULL);
537 "dlm namespace %s free waiting on refcount %d\n",
538 ns->ns_name, ns->ns_refcount);
541 lwi = LWI_TIMEOUT(obd_timeout * HZ / 4, NULL, NULL);
543 rc = l_wait_event(ns->ns_waitq,
544 ns->ns_refcount == 0, &lwi);
546 /* Forced cleanups should be able to reclaim all references,
547 * so it's safe to wait forever... we can't leak locks... */
548 if (force && rc == -ETIMEDOUT) {
549 LCONSOLE_ERROR("Forced cleanup waiting for %s "
550 "namespace with %d resources in use, "
551 "(rc=%d)\n", ns->ns_name,
552 ns->ns_refcount, rc);
553 GOTO(force_wait, rc);
556 if (ns->ns_refcount) {
557 LCONSOLE_ERROR("Cleanup waiting for %s namespace "
558 "with %d resources in use, (rc=%d)\n",
560 ns->ns_refcount, rc);
561 RETURN(ELDLM_NAMESPACE_EXISTS);
564 "dlm namespace %s free done waiting\n", ns->ns_name);
571 * Performs various cleanups for passed \a ns to make it drop refc and be ready
572 * for freeing. Waits for refc == 0.
574 * The following is done:
575 * (0) Unregister \a ns from its list to make inaccessible for potential users
576 * like pools thread and others;
577 * (1) Clear all locks in \a ns.
579 void ldlm_namespace_free_prior(struct ldlm_namespace *ns,
580 struct obd_import *imp,
591 * Make sure that nobody can find this ns in its list.
593 ldlm_namespace_unregister(ns, ns->ns_client);
596 * Can fail with -EINTR when force == 0 in which case try harder.
598 rc = __ldlm_namespace_free(ns, force);
599 if (rc != ELDLM_OK) {
601 ptlrpc_disconnect_import(imp, 0);
602 ptlrpc_invalidate_import(imp);
606 * With all requests dropped and the import inactive
607 * we are gaurenteed all reference will be dropped.
609 rc = __ldlm_namespace_free(ns, 1);
616 * Performs freeing memory structures related to \a ns. This is only done when
617 * ldlm_namespce_free_prior() successfully removed all resources referencing
618 * \a ns and its refc == 0.
620 void ldlm_namespace_free_post(struct ldlm_namespace *ns)
629 * Fini pool _before_ parent proc dir is removed. This is important as
630 * ldlm_pool_fini() removes own proc dir which is child to @dir. Removing
631 * it after @dir may cause oops.
633 ldlm_pool_fini(&ns->ns_pool);
637 struct proc_dir_entry *dir;
638 dir = lprocfs_srch(ldlm_ns_proc_dir, ns->ns_name);
640 CERROR("dlm namespace %s has no procfs dir?\n",
643 lprocfs_remove(&dir);
648 OBD_VFREE(ns->ns_hash, sizeof(*ns->ns_hash) * RES_HASH_SIZE);
649 OBD_FREE(ns->ns_name, strlen(ns->ns_name) + 1);
652 * Namespace \a ns should be not on list in this time, otherwise this
653 * will cause issues realted to using freed \a ns in pools thread.
655 LASSERT(list_empty(&ns->ns_list_chain));
662 /* Cleanup the resource, and free namespace.
665 * proc1: destroy import
666 * class_disconnect_export(grab cl_sem) ->
667 * -> ldlm_namespace_free ->
668 * -> lprocfs_remove(grab _lprocfs_lock).
669 * proc2: read proc info
670 * lprocfs_fops_read(grab _lprocfs_lock) ->
671 * -> osc_rd_active, etc(grab cl_sem).
673 * So that I have to split the ldlm_namespace_free into two parts - the first
674 * part ldlm_namespace_free_prior is used to cleanup the resource which is
675 * being used; the 2nd part ldlm_namespace_free_post is used to unregister the
676 * lprocfs entries, and then free memory. It will be called w/o cli->cl_sem
679 void ldlm_namespace_free(struct ldlm_namespace *ns,
680 struct obd_import *imp,
683 ldlm_namespace_free_prior(ns, imp, force);
684 ldlm_namespace_free_post(ns);
688 void ldlm_namespace_get_locked(struct ldlm_namespace *ns)
690 LASSERT(ns->ns_refcount >= 0);
694 void ldlm_namespace_get(struct ldlm_namespace *ns)
696 spin_lock(&ns->ns_hash_lock);
697 ldlm_namespace_get_locked(ns);
698 spin_unlock(&ns->ns_hash_lock);
701 void ldlm_namespace_put_locked(struct ldlm_namespace *ns, int wakeup)
703 LASSERT(ns->ns_refcount > 0);
705 if (ns->ns_refcount == 0 && wakeup)
706 wake_up(&ns->ns_waitq);
709 void ldlm_namespace_put(struct ldlm_namespace *ns, int wakeup)
711 spin_lock(&ns->ns_hash_lock);
712 ldlm_namespace_put_locked(ns, wakeup);
713 spin_unlock(&ns->ns_hash_lock);
716 /* Register @ns in the list of namespaces */
717 void ldlm_namespace_register(struct ldlm_namespace *ns, ldlm_side_t client)
719 mutex_down(ldlm_namespace_lock(client));
720 LASSERT(list_empty(&ns->ns_list_chain));
721 list_add(&ns->ns_list_chain, ldlm_namespace_list(client));
722 atomic_inc(ldlm_namespace_nr(client));
723 mutex_up(ldlm_namespace_lock(client));
726 /* Unregister @ns from the list of namespaces */
727 void ldlm_namespace_unregister(struct ldlm_namespace *ns, ldlm_side_t client)
729 mutex_down(ldlm_namespace_lock(client));
730 LASSERT(!list_empty(&ns->ns_list_chain));
732 * Some asserts and possibly other parts of code still using
733 * list_empty(&ns->ns_list_chain). This is why it is important
734 * to use list_del_init() here.
736 list_del_init(&ns->ns_list_chain);
737 atomic_dec(ldlm_namespace_nr(client));
738 mutex_up(ldlm_namespace_lock(client));
741 /* Should be called under ldlm_namespace_lock(client) taken */
742 void ldlm_namespace_move_locked(struct ldlm_namespace *ns, ldlm_side_t client)
744 LASSERT(!list_empty(&ns->ns_list_chain));
745 LASSERT_SEM_LOCKED(ldlm_namespace_lock(client));
746 list_move_tail(&ns->ns_list_chain, ldlm_namespace_list(client));
749 /* Should be called under ldlm_namespace_lock(client) taken */
750 struct ldlm_namespace *ldlm_namespace_first_locked(ldlm_side_t client)
752 LASSERT_SEM_LOCKED(ldlm_namespace_lock(client));
753 LASSERT(!list_empty(ldlm_namespace_list(client)));
754 return container_of(ldlm_namespace_list(client)->next,
755 struct ldlm_namespace, ns_list_chain);
757 static __u32 ldlm_hash_fn(struct ldlm_resource *parent,
758 const struct ldlm_res_id *name)
763 for (i = 0; i < RES_NAME_SIZE; i++)
764 hash += name->name[i];
766 hash += (__u32)((unsigned long)parent >> 4);
768 return (hash & RES_HASH_MASK);
771 static struct ldlm_resource *ldlm_resource_new(void)
773 struct ldlm_resource *res;
776 OBD_SLAB_ALLOC(res, ldlm_resource_slab, CFS_ALLOC_IO, sizeof *res);
780 memset(res, 0, sizeof(*res));
782 CFS_INIT_LIST_HEAD(&res->lr_children);
783 CFS_INIT_LIST_HEAD(&res->lr_childof);
784 CFS_INIT_LIST_HEAD(&res->lr_granted);
785 CFS_INIT_LIST_HEAD(&res->lr_converting);
786 CFS_INIT_LIST_HEAD(&res->lr_waiting);
788 /* initialize interval trees for each lock mode*/
789 for (idx = 0; idx < LCK_MODE_NUM; idx++) {
790 res->lr_itree[idx].lit_size = 0;
791 res->lr_itree[idx].lit_mode = 1 << idx;
792 res->lr_itree[idx].lit_root = NULL;
795 atomic_set(&res->lr_refcount, 1);
796 spin_lock_init(&res->lr_lock);
798 /* one who creates the resource must unlock
799 * the semaphore after lvb initialization */
800 init_MUTEX_LOCKED(&res->lr_lvb_sem);
805 /* must be called with hash lock held */
806 static struct ldlm_resource *
807 ldlm_resource_find(struct ldlm_namespace *ns, const struct ldlm_res_id *name,
810 struct list_head *bucket, *tmp;
811 struct ldlm_resource *res;
813 LASSERT_SPIN_LOCKED(&ns->ns_hash_lock);
814 bucket = ns->ns_hash + hash;
816 list_for_each(tmp, bucket) {
817 res = list_entry(tmp, struct ldlm_resource, lr_hash);
818 if (memcmp(&res->lr_name, name, sizeof(res->lr_name)) == 0)
825 /* Args: locked namespace
826 * Returns: newly-allocated, referenced, unlocked resource */
827 static struct ldlm_resource *
828 ldlm_resource_add(struct ldlm_namespace *ns, struct ldlm_resource *parent,
829 const struct ldlm_res_id *name, __u32 hash, ldlm_type_t type)
831 struct list_head *bucket;
832 struct ldlm_resource *res, *old_res;
835 LASSERTF(type >= LDLM_MIN_TYPE && type < LDLM_MAX_TYPE,
838 res = ldlm_resource_new();
842 res->lr_name = *name;
843 res->lr_namespace = ns;
845 res->lr_most_restr = LCK_NL;
847 spin_lock(&ns->ns_hash_lock);
848 old_res = ldlm_resource_find(ns, name, hash);
850 /* someone won the race and added the resource before */
851 ldlm_resource_getref(old_res);
852 spin_unlock(&ns->ns_hash_lock);
853 OBD_SLAB_FREE(res, ldlm_resource_slab, sizeof *res);
854 /* synchronize WRT resource creation */
855 if (ns->ns_lvbo && ns->ns_lvbo->lvbo_init) {
856 down(&old_res->lr_lvb_sem);
857 up(&old_res->lr_lvb_sem);
862 /* we won! let's add the resource */
863 bucket = ns->ns_hash + hash;
864 list_add(&res->lr_hash, bucket);
866 ldlm_namespace_get_locked(ns);
868 if (parent == NULL) {
869 list_add(&res->lr_childof, &ns->ns_root_list);
871 res->lr_parent = parent;
872 list_add(&res->lr_childof, &parent->lr_children);
874 spin_unlock(&ns->ns_hash_lock);
876 if (ns->ns_lvbo && ns->ns_lvbo->lvbo_init) {
879 OBD_FAIL_TIMEOUT(OBD_FAIL_LDLM_CREATE_RESOURCE, 2);
880 rc = ns->ns_lvbo->lvbo_init(res);
882 CERROR("lvbo_init failed for resource "
883 LPU64": rc %d\n", name->name[0], rc);
884 /* we create resource with locked lr_lvb_sem */
885 up(&res->lr_lvb_sem);
891 /* Args: unlocked namespace
892 * Locks: takes and releases ns->ns_lock and res->lr_lock
893 * Returns: referenced, unlocked ldlm_resource or NULL */
894 struct ldlm_resource *
895 ldlm_resource_get(struct ldlm_namespace *ns, struct ldlm_resource *parent,
896 const struct ldlm_res_id *name, ldlm_type_t type, int create)
898 __u32 hash = ldlm_hash_fn(parent, name);
899 struct ldlm_resource *res = NULL;
903 LASSERT(ns->ns_hash != NULL);
904 LASSERT(name->name[0] != 0);
906 spin_lock(&ns->ns_hash_lock);
907 res = ldlm_resource_find(ns, name, hash);
909 ldlm_resource_getref(res);
910 spin_unlock(&ns->ns_hash_lock);
911 /* synchronize WRT resource creation */
912 if (ns->ns_lvbo && ns->ns_lvbo->lvbo_init) {
913 down(&res->lr_lvb_sem);
914 up(&res->lr_lvb_sem);
918 spin_unlock(&ns->ns_hash_lock);
923 res = ldlm_resource_add(ns, parent, name, hash, type);
927 struct ldlm_resource *ldlm_resource_getref(struct ldlm_resource *res)
929 LASSERT(res != NULL);
930 LASSERT(res != LP_POISON);
931 atomic_inc(&res->lr_refcount);
932 CDEBUG(D_INFO, "getref res: %p count: %d\n", res,
933 atomic_read(&res->lr_refcount));
937 void __ldlm_resource_putref_final(struct ldlm_resource *res)
939 struct ldlm_namespace *ns = res->lr_namespace;
941 LASSERT_SPIN_LOCKED(&ns->ns_hash_lock);
943 if (!list_empty(&res->lr_granted)) {
944 ldlm_resource_dump(D_ERROR, res);
948 if (!list_empty(&res->lr_converting)) {
949 ldlm_resource_dump(D_ERROR, res);
953 if (!list_empty(&res->lr_waiting)) {
954 ldlm_resource_dump(D_ERROR, res);
958 if (!list_empty(&res->lr_children)) {
959 ldlm_resource_dump(D_ERROR, res);
963 /* Pass 0 here to not wake ->ns_waitq up yet, we will do it few
964 * lines below when all children are freed. */
965 ldlm_namespace_put_locked(ns, 0);
966 list_del_init(&res->lr_hash);
967 list_del_init(&res->lr_childof);
970 if (ns->ns_resources == 0)
971 wake_up(&ns->ns_waitq);
974 /* Returns 1 if the resource was freed, 0 if it remains. */
975 int ldlm_resource_putref(struct ldlm_resource *res)
977 struct ldlm_namespace *ns = res->lr_namespace;
981 CDEBUG(D_INFO, "putref res: %p count: %d\n", res,
982 atomic_read(&res->lr_refcount) - 1);
983 LASSERTF(atomic_read(&res->lr_refcount) > 0, "%d",
984 atomic_read(&res->lr_refcount));
985 LASSERTF(atomic_read(&res->lr_refcount) < LI_POISON, "%d",
986 atomic_read(&res->lr_refcount));
988 if (atomic_dec_and_lock(&res->lr_refcount, &ns->ns_hash_lock)) {
989 __ldlm_resource_putref_final(res);
990 spin_unlock(&ns->ns_hash_lock);
991 if (res->lr_lvb_data)
992 OBD_FREE(res->lr_lvb_data, res->lr_lvb_len);
993 OBD_SLAB_FREE(res, ldlm_resource_slab, sizeof *res);
1000 /* Returns 1 if the resource was freed, 0 if it remains. */
1001 int ldlm_resource_putref_locked(struct ldlm_resource *res)
1006 CDEBUG(D_INFO, "putref res: %p count: %d\n", res,
1007 atomic_read(&res->lr_refcount) - 1);
1008 LASSERT(atomic_read(&res->lr_refcount) > 0);
1009 LASSERT(atomic_read(&res->lr_refcount) < LI_POISON);
1011 LASSERT(atomic_read(&res->lr_refcount) >= 0);
1012 if (atomic_dec_and_test(&res->lr_refcount)) {
1013 __ldlm_resource_putref_final(res);
1014 if (res->lr_lvb_data)
1015 OBD_FREE(res->lr_lvb_data, res->lr_lvb_len);
1016 OBD_SLAB_FREE(res, ldlm_resource_slab, sizeof *res);
1023 void ldlm_resource_add_lock(struct ldlm_resource *res, struct list_head *head,
1024 struct ldlm_lock *lock)
1026 check_res_locked(res);
1028 ldlm_resource_dump(D_INFO, res);
1029 CDEBUG(D_OTHER, "About to add this lock:\n");
1030 ldlm_lock_dump(D_OTHER, lock, 0);
1032 if (lock->l_destroyed) {
1033 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
1037 LASSERT(list_empty(&lock->l_res_link));
1039 list_add_tail(&lock->l_res_link, head);
1042 void ldlm_resource_insert_lock_after(struct ldlm_lock *original,
1043 struct ldlm_lock *new)
1045 struct ldlm_resource *res = original->l_resource;
1047 check_res_locked(res);
1049 ldlm_resource_dump(D_INFO, res);
1050 CDEBUG(D_OTHER, "About to insert this lock after %p:\n", original);
1051 ldlm_lock_dump(D_OTHER, new, 0);
1053 if (new->l_destroyed) {
1054 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
1058 LASSERT(list_empty(&new->l_res_link));
1060 list_add(&new->l_res_link, &original->l_res_link);
1064 void ldlm_resource_unlink_lock(struct ldlm_lock *lock)
1066 int type = lock->l_resource->lr_type;
1068 check_res_locked(lock->l_resource);
1069 if (type == LDLM_IBITS || type == LDLM_PLAIN)
1070 ldlm_unlink_lock_skiplist(lock);
1071 else if (type == LDLM_EXTENT)
1072 ldlm_extent_unlink_lock(lock);
1073 list_del_init(&lock->l_res_link);
1076 void ldlm_res2desc(struct ldlm_resource *res, struct ldlm_resource_desc *desc)
1078 desc->lr_type = res->lr_type;
1079 desc->lr_name = res->lr_name;
1082 void ldlm_dump_all_namespaces(ldlm_side_t client, int level)
1084 struct list_head *tmp;
1086 if (!((libcfs_debug | D_ERROR) & level))
1089 mutex_down(ldlm_namespace_lock(client));
1091 list_for_each(tmp, ldlm_namespace_list(client)) {
1092 struct ldlm_namespace *ns;
1093 ns = list_entry(tmp, struct ldlm_namespace, ns_list_chain);
1094 ldlm_namespace_dump(level, ns);
1097 mutex_up(ldlm_namespace_lock(client));
1100 void ldlm_namespace_dump(int level, struct ldlm_namespace *ns)
1102 struct list_head *tmp;
1104 if (!((libcfs_debug | D_ERROR) & level))
1107 CDEBUG(level, "--- Namespace: %s (rc: %d, side: %s)\n",
1108 ns->ns_name, ns->ns_refcount,
1109 ns_is_client(ns) ? "client" : "server");
1111 if (cfs_time_before(cfs_time_current(), ns->ns_next_dump))
1114 spin_lock(&ns->ns_hash_lock);
1115 tmp = ns->ns_root_list.next;
1116 while (tmp != &ns->ns_root_list) {
1117 struct ldlm_resource *res;
1118 res = list_entry(tmp, struct ldlm_resource, lr_childof);
1120 ldlm_resource_getref(res);
1121 spin_unlock(&ns->ns_hash_lock);
1124 ldlm_resource_dump(level, res);
1127 spin_lock(&ns->ns_hash_lock);
1129 ldlm_resource_putref_locked(res);
1131 ns->ns_next_dump = cfs_time_shift(10);
1132 spin_unlock(&ns->ns_hash_lock);
1135 void ldlm_resource_dump(int level, struct ldlm_resource *res)
1137 struct list_head *tmp;
1140 CLASSERT(RES_NAME_SIZE == 4);
1142 if (!((libcfs_debug | D_ERROR) & level))
1145 CDEBUG(level, "--- Resource: %p ("LPU64"/"LPU64"/"LPU64"/"LPU64
1146 ") (rc: %d)\n", res, res->lr_name.name[0], res->lr_name.name[1],
1147 res->lr_name.name[2], res->lr_name.name[3],
1148 atomic_read(&res->lr_refcount));
1150 if (!list_empty(&res->lr_granted)) {
1152 CDEBUG(level, "Granted locks:\n");
1153 list_for_each(tmp, &res->lr_granted) {
1154 struct ldlm_lock *lock;
1155 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
1156 ldlm_lock_dump(level, lock, ++pos);
1159 if (!list_empty(&res->lr_converting)) {
1161 CDEBUG(level, "Converting locks:\n");
1162 list_for_each(tmp, &res->lr_converting) {
1163 struct ldlm_lock *lock;
1164 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
1165 ldlm_lock_dump(level, lock, ++pos);
1168 if (!list_empty(&res->lr_waiting)) {
1170 CDEBUG(level, "Waiting locks:\n");
1171 list_for_each(tmp, &res->lr_waiting) {
1172 struct ldlm_lock *lock;
1173 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
1174 ldlm_lock_dump(level, lock, ++pos);