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, 2014, 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_lock.c
38 * Author: Peter Braam <braam@clusterfs.com>
39 * Author: Phil Schwan <phil@clusterfs.com>
42 #define DEBUG_SUBSYSTEM S_LDLM
44 #include <libcfs/libcfs.h>
45 #include <obd_class.h>
46 #include "ldlm_internal.h"
49 char *ldlm_lockname[] = {
57 [LCK_GROUP] = "GROUP",
60 EXPORT_SYMBOL(ldlm_lockname);
62 char *ldlm_typename[] = {
64 [LDLM_EXTENT] = "EXT",
69 static ldlm_policy_wire_to_local_t ldlm_policy_wire_to_local[] = {
70 [LDLM_PLAIN - LDLM_MIN_TYPE] = ldlm_plain_policy_wire_to_local,
71 [LDLM_EXTENT - LDLM_MIN_TYPE] = ldlm_extent_policy_wire_to_local,
72 [LDLM_FLOCK - LDLM_MIN_TYPE] = ldlm_flock_policy_wire_to_local,
73 [LDLM_IBITS - LDLM_MIN_TYPE] = ldlm_ibits_policy_wire_to_local,
76 static ldlm_policy_local_to_wire_t ldlm_policy_local_to_wire[] = {
77 [LDLM_PLAIN - LDLM_MIN_TYPE] = ldlm_plain_policy_local_to_wire,
78 [LDLM_EXTENT - LDLM_MIN_TYPE] = ldlm_extent_policy_local_to_wire,
79 [LDLM_FLOCK - LDLM_MIN_TYPE] = ldlm_flock_policy_local_to_wire,
80 [LDLM_IBITS - LDLM_MIN_TYPE] = ldlm_ibits_policy_local_to_wire,
84 * Converts lock policy from local format to on the wire lock_desc format
86 void ldlm_convert_policy_to_wire(ldlm_type_t type,
87 const ldlm_policy_data_t *lpolicy,
88 ldlm_wire_policy_data_t *wpolicy)
90 ldlm_policy_local_to_wire_t convert;
92 convert = ldlm_policy_local_to_wire[type - LDLM_MIN_TYPE];
94 convert(lpolicy, wpolicy);
98 * Converts lock policy from on the wire lock_desc format to local format
100 void ldlm_convert_policy_to_local(struct obd_export *exp, ldlm_type_t type,
101 const ldlm_wire_policy_data_t *wpolicy,
102 ldlm_policy_data_t *lpolicy)
104 ldlm_policy_wire_to_local_t convert;
106 convert = ldlm_policy_wire_to_local[type - LDLM_MIN_TYPE];
108 convert(wpolicy, lpolicy);
111 char *ldlm_it2str(int it)
118 case (IT_OPEN | IT_CREAT):
133 CERROR("Unknown intent %d\n", it);
137 EXPORT_SYMBOL(ldlm_it2str);
139 extern struct kmem_cache *ldlm_lock_slab;
141 #ifdef HAVE_SERVER_SUPPORT
142 static ldlm_processing_policy ldlm_processing_policy_table[] = {
143 [LDLM_PLAIN] = ldlm_process_plain_lock,
144 [LDLM_EXTENT] = ldlm_process_extent_lock,
145 [LDLM_FLOCK] = ldlm_process_flock_lock,
146 [LDLM_IBITS] = ldlm_process_inodebits_lock,
149 ldlm_processing_policy ldlm_get_processing_policy(struct ldlm_resource *res)
151 return ldlm_processing_policy_table[res->lr_type];
153 EXPORT_SYMBOL(ldlm_get_processing_policy);
154 #endif /* HAVE_SERVER_SUPPORT */
156 void ldlm_register_intent(struct ldlm_namespace *ns, ldlm_res_policy arg)
160 EXPORT_SYMBOL(ldlm_register_intent);
163 * REFCOUNTED LOCK OBJECTS
168 * Get a reference on a lock.
170 * Lock refcounts, during creation:
171 * - one special one for allocation, dec'd only once in destroy
172 * - one for being a lock that's in-use
173 * - one for the addref associated with a new lock
175 struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock)
177 atomic_inc(&lock->l_refc);
180 EXPORT_SYMBOL(ldlm_lock_get);
183 * Release lock reference.
185 * Also frees the lock if it was last reference.
187 void ldlm_lock_put(struct ldlm_lock *lock)
191 LASSERT(lock->l_resource != LP_POISON);
192 LASSERT(atomic_read(&lock->l_refc) > 0);
193 if (atomic_dec_and_test(&lock->l_refc)) {
194 struct ldlm_resource *res;
197 "final lock_put on destroyed lock, freeing it.");
199 res = lock->l_resource;
200 LASSERT(ldlm_is_destroyed(lock));
201 LASSERT(list_empty(&lock->l_res_link));
202 LASSERT(list_empty(&lock->l_pending_chain));
204 lprocfs_counter_decr(ldlm_res_to_ns(res)->ns_stats,
206 lu_ref_del(&res->lr_reference, "lock", lock);
207 ldlm_resource_putref(res);
208 lock->l_resource = NULL;
209 if (lock->l_export) {
210 class_export_lock_put(lock->l_export, lock);
211 lock->l_export = NULL;
214 if (lock->l_lvb_data != NULL)
215 OBD_FREE_LARGE(lock->l_lvb_data, lock->l_lvb_len);
217 ldlm_interval_free(ldlm_interval_detach(lock));
218 lu_ref_fini(&lock->l_reference);
219 OBD_FREE_RCU(lock, sizeof(*lock), &lock->l_handle);
224 EXPORT_SYMBOL(ldlm_lock_put);
227 * Removes LDLM lock \a lock from LRU. Assumes LRU is already locked.
229 int ldlm_lock_remove_from_lru_nolock(struct ldlm_lock *lock)
232 if (!list_empty(&lock->l_lru)) {
233 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
235 LASSERT(lock->l_resource->lr_type != LDLM_FLOCK);
236 list_del_init(&lock->l_lru);
237 LASSERT(ns->ns_nr_unused > 0);
245 * Removes LDLM lock \a lock from LRU. Obtains the LRU lock first.
247 int ldlm_lock_remove_from_lru(struct ldlm_lock *lock)
249 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
253 if (ldlm_is_ns_srv(lock)) {
254 LASSERT(list_empty(&lock->l_lru));
258 spin_lock(&ns->ns_lock);
259 rc = ldlm_lock_remove_from_lru_nolock(lock);
260 spin_unlock(&ns->ns_lock);
266 * Adds LDLM lock \a lock to namespace LRU. Assumes LRU is already locked.
268 void ldlm_lock_add_to_lru_nolock(struct ldlm_lock *lock)
270 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
272 lock->l_last_used = cfs_time_current();
273 LASSERT(list_empty(&lock->l_lru));
274 LASSERT(lock->l_resource->lr_type != LDLM_FLOCK);
275 list_add_tail(&lock->l_lru, &ns->ns_unused_list);
276 ldlm_clear_skipped(lock);
277 LASSERT(ns->ns_nr_unused >= 0);
282 * Adds LDLM lock \a lock to namespace LRU. Obtains necessary LRU locks
285 void ldlm_lock_add_to_lru(struct ldlm_lock *lock)
287 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
290 spin_lock(&ns->ns_lock);
291 ldlm_lock_add_to_lru_nolock(lock);
292 spin_unlock(&ns->ns_lock);
297 * Moves LDLM lock \a lock that is already in namespace LRU to the tail of
298 * the LRU. Performs necessary LRU locking
300 void ldlm_lock_touch_in_lru(struct ldlm_lock *lock)
302 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
305 if (ldlm_is_ns_srv(lock)) {
306 LASSERT(list_empty(&lock->l_lru));
311 spin_lock(&ns->ns_lock);
312 if (!list_empty(&lock->l_lru)) {
313 ldlm_lock_remove_from_lru_nolock(lock);
314 ldlm_lock_add_to_lru_nolock(lock);
316 spin_unlock(&ns->ns_lock);
321 * Helper to destroy a locked lock.
323 * Used by ldlm_lock_destroy and ldlm_lock_destroy_nolock
324 * Must be called with l_lock and lr_lock held.
326 * Does not actually free the lock data, but rather marks the lock as
327 * destroyed by setting l_destroyed field in the lock to 1. Destroys a
328 * handle->lock association too, so that the lock can no longer be found
329 * and removes the lock from LRU list. Actual lock freeing occurs when
330 * last lock reference goes away.
332 * Original comment (of some historical value):
333 * This used to have a 'strict' flag, which recovery would use to mark an
334 * in-use lock as needing-to-die. Lest I am ever tempted to put it back, I
335 * shall explain why it's gone: with the new hash table scheme, once you call
336 * ldlm_lock_destroy, you can never drop your final references on this lock.
337 * Because it's not in the hash table anymore. -phil
339 static int ldlm_lock_destroy_internal(struct ldlm_lock *lock)
343 if (lock->l_readers || lock->l_writers) {
344 LDLM_ERROR(lock, "lock still has references");
348 if (!list_empty(&lock->l_res_link)) {
349 LDLM_ERROR(lock, "lock still on resource");
353 if (ldlm_is_destroyed(lock)) {
354 LASSERT(list_empty(&lock->l_lru));
358 ldlm_set_destroyed(lock);
360 if (lock->l_export && lock->l_export->exp_lock_hash) {
361 /* NB: it's safe to call cfs_hash_del() even lock isn't
362 * in exp_lock_hash. */
363 /* In the function below, .hs_keycmp resolves to
364 * ldlm_export_lock_keycmp() */
365 /* coverity[overrun-buffer-val] */
366 cfs_hash_del(lock->l_export->exp_lock_hash,
367 &lock->l_remote_handle, &lock->l_exp_hash);
370 ldlm_lock_remove_from_lru(lock);
371 class_handle_unhash(&lock->l_handle);
374 /* Wake anyone waiting for this lock */
375 /* FIXME: I should probably add yet another flag, instead of using
376 * l_export to only call this on clients */
378 class_export_put(lock->l_export);
379 lock->l_export = NULL;
380 if (lock->l_export && lock->l_completion_ast)
381 lock->l_completion_ast(lock, 0);
388 * Destroys a LDLM lock \a lock. Performs necessary locking first.
390 void ldlm_lock_destroy(struct ldlm_lock *lock)
394 lock_res_and_lock(lock);
395 first = ldlm_lock_destroy_internal(lock);
396 unlock_res_and_lock(lock);
398 /* drop reference from hashtable only for first destroy */
400 lu_ref_del(&lock->l_reference, "hash", lock);
401 LDLM_LOCK_RELEASE(lock);
407 * Destroys a LDLM lock \a lock that is already locked.
409 void ldlm_lock_destroy_nolock(struct ldlm_lock *lock)
413 first = ldlm_lock_destroy_internal(lock);
414 /* drop reference from hashtable only for first destroy */
416 lu_ref_del(&lock->l_reference, "hash", lock);
417 LDLM_LOCK_RELEASE(lock);
422 /* this is called by portals_handle2object with the handle lock taken */
423 static void lock_handle_addref(void *lock)
425 LDLM_LOCK_GET((struct ldlm_lock *)lock);
428 static void lock_handle_free(void *lock, int size)
430 LASSERT(size == sizeof(struct ldlm_lock));
431 OBD_SLAB_FREE(lock, ldlm_lock_slab, size);
434 static struct portals_handle_ops lock_handle_ops = {
435 .hop_addref = lock_handle_addref,
436 .hop_free = lock_handle_free,
441 * Allocate and initialize new lock structure.
443 * usage: pass in a resource on which you have done ldlm_resource_get
444 * new lock will take over the refcount.
445 * returns: lock with refcount 2 - one for current caller and one for remote
447 static struct ldlm_lock *ldlm_lock_new(struct ldlm_resource *resource)
449 struct ldlm_lock *lock;
452 if (resource == NULL)
455 OBD_SLAB_ALLOC_PTR_GFP(lock, ldlm_lock_slab, GFP_NOFS);
459 spin_lock_init(&lock->l_lock);
460 lock->l_resource = resource;
461 lu_ref_add(&resource->lr_reference, "lock", lock);
463 atomic_set(&lock->l_refc, 2);
464 INIT_LIST_HEAD(&lock->l_res_link);
465 INIT_LIST_HEAD(&lock->l_lru);
466 INIT_LIST_HEAD(&lock->l_pending_chain);
467 INIT_LIST_HEAD(&lock->l_bl_ast);
468 INIT_LIST_HEAD(&lock->l_cp_ast);
469 INIT_LIST_HEAD(&lock->l_rk_ast);
470 init_waitqueue_head(&lock->l_waitq);
471 lock->l_blocking_lock = NULL;
472 INIT_LIST_HEAD(&lock->l_sl_mode);
473 INIT_LIST_HEAD(&lock->l_sl_policy);
474 INIT_HLIST_NODE(&lock->l_exp_hash);
475 INIT_HLIST_NODE(&lock->l_exp_flock_hash);
477 lprocfs_counter_incr(ldlm_res_to_ns(resource)->ns_stats,
479 INIT_LIST_HEAD(&lock->l_handle.h_link);
480 class_handle_hash(&lock->l_handle, &lock_handle_ops);
482 lu_ref_init(&lock->l_reference);
483 lu_ref_add(&lock->l_reference, "hash", lock);
484 lock->l_callback_timeout = 0;
486 #if LUSTRE_TRACKS_LOCK_EXP_REFS
487 INIT_LIST_HEAD(&lock->l_exp_refs_link);
488 lock->l_exp_refs_nr = 0;
489 lock->l_exp_refs_target = NULL;
491 INIT_LIST_HEAD(&lock->l_exp_list);
497 * Moves LDLM lock \a lock to another resource.
498 * This is used on client when server returns some other lock than requested
499 * (typically as a result of intent operation)
501 int ldlm_lock_change_resource(struct ldlm_namespace *ns, struct ldlm_lock *lock,
502 const struct ldlm_res_id *new_resid)
504 struct ldlm_resource *oldres = lock->l_resource;
505 struct ldlm_resource *newres;
509 LASSERT(ns_is_client(ns));
511 lock_res_and_lock(lock);
512 if (memcmp(new_resid, &lock->l_resource->lr_name,
513 sizeof(lock->l_resource->lr_name)) == 0) {
515 unlock_res_and_lock(lock);
519 LASSERT(new_resid->name[0] != 0);
521 /* This function assumes that the lock isn't on any lists */
522 LASSERT(list_empty(&lock->l_res_link));
524 type = oldres->lr_type;
525 unlock_res_and_lock(lock);
527 newres = ldlm_resource_get(ns, NULL, new_resid, type, 1);
529 RETURN(PTR_ERR(newres));
531 lu_ref_add(&newres->lr_reference, "lock", lock);
533 * To flip the lock from the old to the new resource, lock, oldres and
534 * newres have to be locked. Resource spin-locks are nested within
535 * lock->l_lock, and are taken in the memory address order to avoid
538 spin_lock(&lock->l_lock);
539 oldres = lock->l_resource;
540 if (oldres < newres) {
542 lock_res_nested(newres, LRT_NEW);
545 lock_res_nested(oldres, LRT_NEW);
547 LASSERT(memcmp(new_resid, &oldres->lr_name,
548 sizeof oldres->lr_name) != 0);
549 lock->l_resource = newres;
551 unlock_res_and_lock(lock);
553 /* ...and the flowers are still standing! */
554 lu_ref_del(&oldres->lr_reference, "lock", lock);
555 ldlm_resource_putref(oldres);
560 /** \defgroup ldlm_handles LDLM HANDLES
561 * Ways to get hold of locks without any addresses.
566 * Fills in handle for LDLM lock \a lock into supplied \a lockh
567 * Does not take any references.
569 void ldlm_lock2handle(const struct ldlm_lock *lock, struct lustre_handle *lockh)
571 lockh->cookie = lock->l_handle.h_cookie;
573 EXPORT_SYMBOL(ldlm_lock2handle);
576 * Obtain a lock reference by handle.
578 * if \a flags: atomically get the lock and set the flags.
579 * Return NULL if flag already set
581 struct ldlm_lock *__ldlm_handle2lock(const struct lustre_handle *handle,
584 struct ldlm_lock *lock;
589 lock = class_handle2object(handle->cookie, NULL);
593 /* It's unlikely but possible that someone marked the lock as
594 * destroyed after we did handle2object on it */
595 if ((flags == 0) && !ldlm_is_destroyed(lock)) {
596 lu_ref_add(&lock->l_reference, "handle", current);
600 lock_res_and_lock(lock);
602 LASSERT(lock->l_resource != NULL);
604 lu_ref_add_atomic(&lock->l_reference, "handle", current);
605 if (unlikely(ldlm_is_destroyed(lock))) {
606 unlock_res_and_lock(lock);
607 CDEBUG(D_INFO, "lock already destroyed: lock %p\n", lock);
612 /* If we're setting flags, make sure none of them are already set. */
614 if ((lock->l_flags & flags) != 0) {
615 unlock_res_and_lock(lock);
620 lock->l_flags |= flags;
623 unlock_res_and_lock(lock);
626 EXPORT_SYMBOL(__ldlm_handle2lock);
627 /** @} ldlm_handles */
630 * Fill in "on the wire" representation for given LDLM lock into supplied
631 * lock descriptor \a desc structure.
633 void ldlm_lock2desc(struct ldlm_lock *lock, struct ldlm_lock_desc *desc)
635 ldlm_res2desc(lock->l_resource, &desc->l_resource);
636 desc->l_req_mode = lock->l_req_mode;
637 desc->l_granted_mode = lock->l_granted_mode;
638 ldlm_convert_policy_to_wire(lock->l_resource->lr_type,
639 &lock->l_policy_data,
640 &desc->l_policy_data);
644 * Add a lock to list of conflicting locks to send AST to.
646 * Only add if we have not sent a blocking AST to the lock yet.
648 static void ldlm_add_bl_work_item(struct ldlm_lock *lock, struct ldlm_lock *new,
649 struct list_head *work_list)
651 if (!ldlm_is_ast_sent(lock)) {
652 LDLM_DEBUG(lock, "lock incompatible; sending blocking AST.");
653 ldlm_set_ast_sent(lock);
654 /* If the enqueuing client said so, tell the AST recipient to
655 * discard dirty data, rather than writing back. */
656 if (ldlm_is_ast_discard_data(new))
657 ldlm_set_discard_data(lock);
658 LASSERT(list_empty(&lock->l_bl_ast));
659 list_add(&lock->l_bl_ast, work_list);
661 LASSERT(lock->l_blocking_lock == NULL);
662 lock->l_blocking_lock = LDLM_LOCK_GET(new);
667 * Add a lock to list of just granted locks to send completion AST to.
669 static void ldlm_add_cp_work_item(struct ldlm_lock *lock,
670 struct list_head *work_list)
672 if (!ldlm_is_cp_reqd(lock)) {
673 ldlm_set_cp_reqd(lock);
674 LDLM_DEBUG(lock, "lock granted; sending completion AST.");
675 LASSERT(list_empty(&lock->l_cp_ast));
676 list_add(&lock->l_cp_ast, work_list);
682 * Aggregator function to add AST work items into a list. Determines
683 * what sort of an AST work needs to be done and calls the proper
685 * Must be called with lr_lock held.
687 void ldlm_add_ast_work_item(struct ldlm_lock *lock, struct ldlm_lock *new,
688 struct list_head *work_list)
691 check_res_locked(lock->l_resource);
693 ldlm_add_bl_work_item(lock, new, work_list);
695 ldlm_add_cp_work_item(lock, work_list);
700 * Add specified reader/writer reference to LDLM lock with handle \a lockh.
701 * r/w reference type is determined by \a mode
702 * Calls ldlm_lock_addref_internal.
704 void ldlm_lock_addref(struct lustre_handle *lockh, __u32 mode)
706 struct ldlm_lock *lock;
708 lock = ldlm_handle2lock(lockh);
709 LASSERTF(lock != NULL, "Non-existing lock: "LPX64"\n", lockh->cookie);
710 ldlm_lock_addref_internal(lock, mode);
713 EXPORT_SYMBOL(ldlm_lock_addref);
717 * Add specified reader/writer reference to LDLM lock \a lock.
718 * r/w reference type is determined by \a mode
719 * Removes lock from LRU if it is there.
720 * Assumes the LDLM lock is already locked.
722 void ldlm_lock_addref_internal_nolock(struct ldlm_lock *lock, __u32 mode)
724 ldlm_lock_remove_from_lru(lock);
725 if (mode & (LCK_NL | LCK_CR | LCK_PR)) {
727 lu_ref_add_atomic(&lock->l_reference, "reader", lock);
729 if (mode & (LCK_EX | LCK_CW | LCK_PW | LCK_GROUP | LCK_COS)) {
731 lu_ref_add_atomic(&lock->l_reference, "writer", lock);
734 lu_ref_add_atomic(&lock->l_reference, "user", lock);
735 LDLM_DEBUG(lock, "ldlm_lock_addref(%s)", ldlm_lockname[mode]);
739 * Attempts to add reader/writer reference to a lock with handle \a lockh, and
740 * fails if lock is already LDLM_FL_CBPENDING or destroyed.
742 * \retval 0 success, lock was addref-ed
744 * \retval -EAGAIN lock is being canceled.
746 int ldlm_lock_addref_try(struct lustre_handle *lockh, __u32 mode)
748 struct ldlm_lock *lock;
752 lock = ldlm_handle2lock(lockh);
754 lock_res_and_lock(lock);
755 if (lock->l_readers != 0 || lock->l_writers != 0 ||
756 !ldlm_is_cbpending(lock)) {
757 ldlm_lock_addref_internal_nolock(lock, mode);
760 unlock_res_and_lock(lock);
765 EXPORT_SYMBOL(ldlm_lock_addref_try);
768 * Add specified reader/writer reference to LDLM lock \a lock.
769 * Locks LDLM lock and calls ldlm_lock_addref_internal_nolock to do the work.
770 * Only called for local locks.
772 void ldlm_lock_addref_internal(struct ldlm_lock *lock, __u32 mode)
774 lock_res_and_lock(lock);
775 ldlm_lock_addref_internal_nolock(lock, mode);
776 unlock_res_and_lock(lock);
780 * Removes reader/writer reference for LDLM lock \a lock.
781 * Assumes LDLM lock is already locked.
782 * only called in ldlm_flock_destroy and for local locks.
783 * Does NOT add lock to LRU if no r/w references left to accomodate flock locks
784 * that cannot be placed in LRU.
786 void ldlm_lock_decref_internal_nolock(struct ldlm_lock *lock, __u32 mode)
788 LDLM_DEBUG(lock, "ldlm_lock_decref(%s)", ldlm_lockname[mode]);
789 if (mode & (LCK_NL | LCK_CR | LCK_PR)) {
790 LASSERT(lock->l_readers > 0);
791 lu_ref_del(&lock->l_reference, "reader", lock);
794 if (mode & (LCK_EX | LCK_CW | LCK_PW | LCK_GROUP | LCK_COS)) {
795 LASSERT(lock->l_writers > 0);
796 lu_ref_del(&lock->l_reference, "writer", lock);
800 lu_ref_del(&lock->l_reference, "user", lock);
801 LDLM_LOCK_RELEASE(lock); /* matches the LDLM_LOCK_GET() in addref */
805 * Removes reader/writer reference for LDLM lock \a lock.
806 * Locks LDLM lock first.
807 * If the lock is determined to be client lock on a client and r/w refcount
808 * drops to zero and the lock is not blocked, the lock is added to LRU lock
810 * For blocked LDLM locks if r/w count drops to zero, blocking_ast is called.
812 void ldlm_lock_decref_internal(struct ldlm_lock *lock, __u32 mode)
814 struct ldlm_namespace *ns;
817 lock_res_and_lock(lock);
819 ns = ldlm_lock_to_ns(lock);
821 ldlm_lock_decref_internal_nolock(lock, mode);
823 if (ldlm_is_local(lock) &&
824 !lock->l_readers && !lock->l_writers) {
825 /* If this is a local lock on a server namespace and this was
826 * the last reference, cancel the lock. */
827 CDEBUG(D_INFO, "forcing cancel of local lock\n");
828 ldlm_set_cbpending(lock);
831 if (!lock->l_readers && !lock->l_writers &&
832 (ldlm_is_cbpending(lock) || lock->l_req_mode == LCK_GROUP)) {
833 /* If we received a blocked AST and this was the last reference,
835 * Group locks are special:
836 * They must not go in LRU, but they are not called back
837 * like non-group locks, instead they are manually released.
838 * They have an l_writers reference which they keep until
839 * they are manually released, so we remove them when they have
840 * no more reader or writer references. - LU-6368 */
841 if (ldlm_is_ns_srv(lock) && lock->l_export)
842 CERROR("FL_CBPENDING set on non-local lock--just a "
845 LDLM_DEBUG(lock, "final decref done on cbpending lock");
847 LDLM_LOCK_GET(lock); /* dropped by bl thread */
848 ldlm_lock_remove_from_lru(lock);
849 unlock_res_and_lock(lock);
851 if (ldlm_is_fail_loc(lock))
852 OBD_RACE(OBD_FAIL_LDLM_CP_BL_RACE);
854 if (ldlm_is_atomic_cb(lock) ||
855 ldlm_bl_to_thread_lock(ns, NULL, lock) != 0)
856 ldlm_handle_bl_callback(ns, NULL, lock);
857 } else if (ns_is_client(ns) &&
858 !lock->l_readers && !lock->l_writers &&
859 !ldlm_is_no_lru(lock) &&
860 !ldlm_is_bl_ast(lock)) {
862 LDLM_DEBUG(lock, "add lock into lru list");
864 /* If this is a client-side namespace and this was the last
865 * reference, put it on the LRU. */
866 ldlm_lock_add_to_lru(lock);
867 unlock_res_and_lock(lock);
869 if (ldlm_is_fail_loc(lock))
870 OBD_RACE(OBD_FAIL_LDLM_CP_BL_RACE);
872 /* Call ldlm_cancel_lru() only if EARLY_CANCEL and LRU RESIZE
873 * are not supported by the server, otherwise, it is done on
875 if (!exp_connect_cancelset(lock->l_conn_export) &&
876 !ns_connect_lru_resize(ns))
877 ldlm_cancel_lru(ns, 0, LCF_ASYNC, 0);
879 LDLM_DEBUG(lock, "do not add lock into lru list");
880 unlock_res_and_lock(lock);
887 * Decrease reader/writer refcount for LDLM lock with handle \a lockh
889 void ldlm_lock_decref(struct lustre_handle *lockh, __u32 mode)
891 struct ldlm_lock *lock = __ldlm_handle2lock(lockh, 0);
892 LASSERTF(lock != NULL, "Non-existing lock: "LPX64"\n", lockh->cookie);
893 ldlm_lock_decref_internal(lock, mode);
896 EXPORT_SYMBOL(ldlm_lock_decref);
899 * Decrease reader/writer refcount for LDLM lock with handle
900 * \a lockh and mark it for subsequent cancellation once r/w refcount
901 * drops to zero instead of putting into LRU.
904 void ldlm_lock_decref_and_cancel(struct lustre_handle *lockh, __u32 mode)
906 struct ldlm_lock *lock = __ldlm_handle2lock(lockh, 0);
909 LASSERT(lock != NULL);
911 LDLM_DEBUG(lock, "ldlm_lock_decref(%s)", ldlm_lockname[mode]);
912 lock_res_and_lock(lock);
913 ldlm_set_cbpending(lock);
914 unlock_res_and_lock(lock);
915 ldlm_lock_decref_internal(lock, mode);
918 EXPORT_SYMBOL(ldlm_lock_decref_and_cancel);
920 struct sl_insert_point {
921 struct list_head *res_link;
922 struct list_head *mode_link;
923 struct list_head *policy_link;
927 * Finds a position to insert the new lock into granted lock list.
929 * Used for locks eligible for skiplist optimization.
932 * queue [input]: the granted list where search acts on;
933 * req [input]: the lock whose position to be located;
934 * prev [output]: positions within 3 lists to insert @req to
938 * - ldlm_grant_lock_with_skiplist
940 static void search_granted_lock(struct list_head *queue,
941 struct ldlm_lock *req,
942 struct sl_insert_point *prev)
944 struct list_head *tmp;
945 struct ldlm_lock *lock, *mode_end, *policy_end;
948 list_for_each(tmp, queue) {
949 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
951 mode_end = list_entry(lock->l_sl_mode.prev,
952 struct ldlm_lock, l_sl_mode);
954 if (lock->l_req_mode != req->l_req_mode) {
955 /* jump to last lock of mode group */
956 tmp = &mode_end->l_res_link;
960 /* suitable mode group is found */
961 if (lock->l_resource->lr_type == LDLM_PLAIN) {
962 /* insert point is last lock of the mode group */
963 prev->res_link = &mode_end->l_res_link;
964 prev->mode_link = &mode_end->l_sl_mode;
965 prev->policy_link = &req->l_sl_policy;
968 } else if (lock->l_resource->lr_type == LDLM_IBITS) {
971 list_entry(lock->l_sl_policy.prev,
975 if (lock->l_policy_data.l_inodebits.bits ==
976 req->l_policy_data.l_inodebits.bits) {
977 /* insert point is last lock of
978 * the policy group */
980 &policy_end->l_res_link;
982 &policy_end->l_sl_mode;
984 &policy_end->l_sl_policy;
989 if (policy_end == mode_end)
990 /* done with mode group */
993 /* go to next policy group within mode group */
994 tmp = policy_end->l_res_link.next;
995 lock = list_entry(tmp, struct ldlm_lock,
997 } /* loop over policy groups within the mode group */
999 /* insert point is last lock of the mode group,
1000 * new policy group is started */
1001 prev->res_link = &mode_end->l_res_link;
1002 prev->mode_link = &mode_end->l_sl_mode;
1003 prev->policy_link = &req->l_sl_policy;
1007 LDLM_ERROR(lock,"is not LDLM_PLAIN or LDLM_IBITS lock");
1012 /* insert point is last lock on the queue,
1013 * new mode group and new policy group are started */
1014 prev->res_link = queue->prev;
1015 prev->mode_link = &req->l_sl_mode;
1016 prev->policy_link = &req->l_sl_policy;
1022 * Add a lock into resource granted list after a position described by
1025 static void ldlm_granted_list_add_lock(struct ldlm_lock *lock,
1026 struct sl_insert_point *prev)
1028 struct ldlm_resource *res = lock->l_resource;
1031 check_res_locked(res);
1033 ldlm_resource_dump(D_INFO, res);
1034 LDLM_DEBUG(lock, "About to add lock:");
1036 if (ldlm_is_destroyed(lock)) {
1037 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
1041 LASSERT(list_empty(&lock->l_res_link));
1042 LASSERT(list_empty(&lock->l_sl_mode));
1043 LASSERT(list_empty(&lock->l_sl_policy));
1046 * lock->link == prev->link means lock is first starting the group.
1047 * Don't re-add to itself to suppress kernel warnings.
1049 if (&lock->l_res_link != prev->res_link)
1050 list_add(&lock->l_res_link, prev->res_link);
1051 if (&lock->l_sl_mode != prev->mode_link)
1052 list_add(&lock->l_sl_mode, prev->mode_link);
1053 if (&lock->l_sl_policy != prev->policy_link)
1054 list_add(&lock->l_sl_policy, prev->policy_link);
1060 * Add a lock to granted list on a resource maintaining skiplist
1063 static void ldlm_grant_lock_with_skiplist(struct ldlm_lock *lock)
1065 struct sl_insert_point prev;
1068 LASSERT(lock->l_req_mode == lock->l_granted_mode);
1070 search_granted_lock(&lock->l_resource->lr_granted, lock, &prev);
1071 ldlm_granted_list_add_lock(lock, &prev);
1076 * Perform lock granting bookkeeping.
1078 * Includes putting the lock into granted list and updating lock mode.
1080 * - ldlm_lock_enqueue
1081 * - ldlm_reprocess_queue
1082 * - ldlm_lock_convert
1084 * must be called with lr_lock held
1086 void ldlm_grant_lock(struct ldlm_lock *lock, struct list_head *work_list)
1088 struct ldlm_resource *res = lock->l_resource;
1091 check_res_locked(res);
1093 lock->l_granted_mode = lock->l_req_mode;
1095 if (work_list && lock->l_completion_ast != NULL)
1096 ldlm_add_ast_work_item(lock, NULL, work_list);
1098 /* We should not add locks to granted list in the following cases:
1099 * - this is an UNLOCK but not a real lock;
1100 * - this is a TEST lock;
1101 * - this is a F_CANCELLK lock (async flock has req_mode == 0)
1102 * - this is a deadlock (flock cannot be granted) */
1103 if (lock->l_req_mode == 0 ||
1104 lock->l_req_mode == LCK_NL ||
1105 ldlm_is_test_lock(lock) ||
1106 ldlm_is_flock_deadlock(lock))
1109 if (res->lr_type == LDLM_PLAIN || res->lr_type == LDLM_IBITS)
1110 ldlm_grant_lock_with_skiplist(lock);
1111 else if (res->lr_type == LDLM_EXTENT)
1112 ldlm_extent_add_lock(res, lock);
1114 ldlm_resource_add_lock(res, &res->lr_granted, lock);
1116 if (lock->l_granted_mode < res->lr_most_restr)
1117 res->lr_most_restr = lock->l_granted_mode;
1119 ldlm_pool_add(&ldlm_res_to_ns(res)->ns_pool, lock);
1124 * Search for a lock with given properties in a queue.
1126 * \retval a referenced lock or NULL. See the flag descriptions below, in the
1127 * comment above ldlm_lock_match
1129 static struct ldlm_lock *search_queue(struct list_head *queue,
1131 ldlm_policy_data_t *policy,
1132 struct ldlm_lock *old_lock,
1133 __u64 flags, int unref)
1135 struct ldlm_lock *lock;
1136 struct list_head *tmp;
1138 list_for_each(tmp, queue) {
1141 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
1143 if (lock == old_lock)
1146 /* Check if this lock can be matched.
1147 * Used by LU-2919(exclusive open) for open lease lock */
1148 if (ldlm_is_excl(lock))
1151 /* llite sometimes wants to match locks that will be
1152 * canceled when their users drop, but we allow it to match
1153 * if it passes in CBPENDING and the lock still has users.
1154 * this is generally only going to be used by children
1155 * whose parents already hold a lock so forward progress
1156 * can still happen. */
1157 if (ldlm_is_cbpending(lock) &&
1158 !(flags & LDLM_FL_CBPENDING))
1160 if (!unref && ldlm_is_cbpending(lock) &&
1161 lock->l_readers == 0 && lock->l_writers == 0)
1164 if (!(lock->l_req_mode & *mode))
1166 match = lock->l_req_mode;
1168 if (lock->l_resource->lr_type == LDLM_EXTENT &&
1169 (lock->l_policy_data.l_extent.start >
1170 policy->l_extent.start ||
1171 lock->l_policy_data.l_extent.end < policy->l_extent.end))
1174 if (unlikely(match == LCK_GROUP) &&
1175 lock->l_resource->lr_type == LDLM_EXTENT &&
1176 policy->l_extent.gid != LDLM_GID_ANY &&
1177 lock->l_policy_data.l_extent.gid != policy->l_extent.gid)
1180 /* We match if we have existing lock with same or wider set
1182 if (lock->l_resource->lr_type == LDLM_IBITS &&
1183 ((lock->l_policy_data.l_inodebits.bits &
1184 policy->l_inodebits.bits) !=
1185 policy->l_inodebits.bits))
1188 if (!unref && LDLM_HAVE_MASK(lock, GONE))
1191 if ((flags & LDLM_FL_LOCAL_ONLY) &&
1192 !ldlm_is_local(lock))
1195 if (flags & LDLM_FL_TEST_LOCK) {
1196 LDLM_LOCK_GET(lock);
1197 ldlm_lock_touch_in_lru(lock);
1199 ldlm_lock_addref_internal_nolock(lock, match);
1208 void ldlm_lock_fail_match_locked(struct ldlm_lock *lock)
1210 if ((lock->l_flags & LDLM_FL_FAIL_NOTIFIED) == 0) {
1211 lock->l_flags |= LDLM_FL_FAIL_NOTIFIED;
1212 wake_up_all(&lock->l_waitq);
1215 EXPORT_SYMBOL(ldlm_lock_fail_match_locked);
1217 void ldlm_lock_fail_match(struct ldlm_lock *lock)
1219 lock_res_and_lock(lock);
1220 ldlm_lock_fail_match_locked(lock);
1221 unlock_res_and_lock(lock);
1225 * Mark lock as "matchable" by OST.
1227 * Used to prevent certain races in LOV/OSC where the lock is granted, but LVB
1229 * Assumes LDLM lock is already locked.
1231 void ldlm_lock_allow_match_locked(struct ldlm_lock *lock)
1233 ldlm_set_lvb_ready(lock);
1234 wake_up_all(&lock->l_waitq);
1236 EXPORT_SYMBOL(ldlm_lock_allow_match_locked);
1239 * Mark lock as "matchable" by OST.
1240 * Locks the lock and then \see ldlm_lock_allow_match_locked
1242 void ldlm_lock_allow_match(struct ldlm_lock *lock)
1244 lock_res_and_lock(lock);
1245 ldlm_lock_allow_match_locked(lock);
1246 unlock_res_and_lock(lock);
1248 EXPORT_SYMBOL(ldlm_lock_allow_match);
1251 * Attempt to find a lock with specified properties.
1253 * Typically returns a reference to matched lock unless LDLM_FL_TEST_LOCK is
1256 * Can be called in two ways:
1258 * If 'ns' is NULL, then lockh describes an existing lock that we want to look
1259 * for a duplicate of.
1261 * Otherwise, all of the fields must be filled in, to match against.
1263 * If 'flags' contains LDLM_FL_LOCAL_ONLY, then only match local locks on the
1264 * server (ie, connh is NULL)
1265 * If 'flags' contains LDLM_FL_BLOCK_GRANTED, then only locks on the granted
1266 * list will be considered
1267 * If 'flags' contains LDLM_FL_CBPENDING, then locks that have been marked
1268 * to be canceled can still be matched as long as they still have reader
1269 * or writer refernces
1270 * If 'flags' contains LDLM_FL_TEST_LOCK, then don't actually reference a lock,
1271 * just tell us if we would have matched.
1273 * \retval 1 if it finds an already-existing lock that is compatible; in this
1274 * case, lockh is filled in with a addref()ed lock
1276 * We also check security context, and if that fails we simply return 0 (to
1277 * keep caller code unchanged), the context failure will be discovered by
1278 * caller sometime later.
1280 ldlm_mode_t ldlm_lock_match(struct ldlm_namespace *ns, __u64 flags,
1281 const struct ldlm_res_id *res_id, ldlm_type_t type,
1282 ldlm_policy_data_t *policy, ldlm_mode_t mode,
1283 struct lustre_handle *lockh, int unref)
1285 struct ldlm_resource *res;
1286 struct ldlm_lock *lock, *old_lock = NULL;
1291 old_lock = ldlm_handle2lock(lockh);
1294 ns = ldlm_lock_to_ns(old_lock);
1295 res_id = &old_lock->l_resource->lr_name;
1296 type = old_lock->l_resource->lr_type;
1297 mode = old_lock->l_req_mode;
1300 res = ldlm_resource_get(ns, NULL, res_id, type, 0);
1302 LASSERT(old_lock == NULL);
1306 LDLM_RESOURCE_ADDREF(res);
1309 lock = search_queue(&res->lr_granted, &mode, policy, old_lock,
1313 if (flags & LDLM_FL_BLOCK_GRANTED)
1315 lock = search_queue(&res->lr_converting, &mode, policy, old_lock,
1319 lock = search_queue(&res->lr_waiting, &mode, policy, old_lock,
1327 LDLM_RESOURCE_DELREF(res);
1328 ldlm_resource_putref(res);
1331 ldlm_lock2handle(lock, lockh);
1332 if ((flags & LDLM_FL_LVB_READY) &&
1333 (!ldlm_is_lvb_ready(lock))) {
1334 __u64 wait_flags = LDLM_FL_LVB_READY |
1335 LDLM_FL_DESTROYED | LDLM_FL_FAIL_NOTIFIED;
1336 struct l_wait_info lwi;
1337 if (lock->l_completion_ast) {
1338 int err = lock->l_completion_ast(lock,
1339 LDLM_FL_WAIT_NOREPROC,
1342 if (flags & LDLM_FL_TEST_LOCK)
1343 LDLM_LOCK_RELEASE(lock);
1345 ldlm_lock_decref_internal(lock,
1352 lwi = LWI_TIMEOUT_INTR(cfs_time_seconds(obd_timeout),
1353 NULL, LWI_ON_SIGNAL_NOOP, NULL);
1355 /* XXX FIXME see comment on CAN_MATCH in lustre_dlm.h */
1356 l_wait_event(lock->l_waitq,
1357 lock->l_flags & wait_flags,
1359 if (!ldlm_is_lvb_ready(lock)) {
1360 if (flags & LDLM_FL_TEST_LOCK)
1361 LDLM_LOCK_RELEASE(lock);
1363 ldlm_lock_decref_internal(lock, mode);
1370 LDLM_DEBUG(lock, "matched ("LPU64" "LPU64")",
1371 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1372 res_id->name[2] : policy->l_extent.start,
1373 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1374 res_id->name[3] : policy->l_extent.end);
1376 /* check user's security context */
1377 if (lock->l_conn_export &&
1378 sptlrpc_import_check_ctx(
1379 class_exp2cliimp(lock->l_conn_export))) {
1380 if (!(flags & LDLM_FL_TEST_LOCK))
1381 ldlm_lock_decref_internal(lock, mode);
1385 if (flags & LDLM_FL_TEST_LOCK)
1386 LDLM_LOCK_RELEASE(lock);
1388 } else if (!(flags & LDLM_FL_TEST_LOCK)) {/*less verbose for test-only*/
1389 LDLM_DEBUG_NOLOCK("not matched ns %p type %u mode %u res "
1390 LPU64"/"LPU64" ("LPU64" "LPU64")", ns,
1391 type, mode, res_id->name[0], res_id->name[1],
1392 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1393 res_id->name[2] :policy->l_extent.start,
1394 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1395 res_id->name[3] : policy->l_extent.end);
1398 LDLM_LOCK_PUT(old_lock);
1400 return rc ? mode : 0;
1402 EXPORT_SYMBOL(ldlm_lock_match);
1404 ldlm_mode_t ldlm_revalidate_lock_handle(struct lustre_handle *lockh,
1407 struct ldlm_lock *lock;
1408 ldlm_mode_t mode = 0;
1411 lock = ldlm_handle2lock(lockh);
1413 lock_res_and_lock(lock);
1414 if (LDLM_HAVE_MASK(lock, GONE))
1417 if (ldlm_is_cbpending(lock) &&
1418 lock->l_readers == 0 && lock->l_writers == 0)
1422 *bits = lock->l_policy_data.l_inodebits.bits;
1423 mode = lock->l_granted_mode;
1424 ldlm_lock_addref_internal_nolock(lock, mode);
1431 unlock_res_and_lock(lock);
1432 LDLM_LOCK_PUT(lock);
1436 EXPORT_SYMBOL(ldlm_revalidate_lock_handle);
1438 /** The caller must guarantee that the buffer is large enough. */
1439 int ldlm_fill_lvb(struct ldlm_lock *lock, struct req_capsule *pill,
1440 enum req_location loc, void *data, int size)
1445 LASSERT(data != NULL);
1448 switch (lock->l_lvb_type) {
1450 if (size == sizeof(struct ost_lvb)) {
1451 if (loc == RCL_CLIENT)
1452 lvb = req_capsule_client_swab_get(pill,
1454 lustre_swab_ost_lvb);
1456 lvb = req_capsule_server_swab_get(pill,
1458 lustre_swab_ost_lvb);
1459 if (unlikely(lvb == NULL)) {
1460 LDLM_ERROR(lock, "no LVB");
1464 memcpy(data, lvb, size);
1465 } else if (size == sizeof(struct ost_lvb_v1)) {
1466 struct ost_lvb *olvb = data;
1468 if (loc == RCL_CLIENT)
1469 lvb = req_capsule_client_swab_get(pill,
1471 lustre_swab_ost_lvb_v1);
1473 lvb = req_capsule_server_sized_swab_get(pill,
1475 lustre_swab_ost_lvb_v1);
1476 if (unlikely(lvb == NULL)) {
1477 LDLM_ERROR(lock, "no LVB");
1481 memcpy(data, lvb, size);
1482 olvb->lvb_mtime_ns = 0;
1483 olvb->lvb_atime_ns = 0;
1484 olvb->lvb_ctime_ns = 0;
1486 LDLM_ERROR(lock, "Replied unexpected ost LVB size %d",
1492 if (size == sizeof(struct lquota_lvb)) {
1493 if (loc == RCL_CLIENT)
1494 lvb = req_capsule_client_swab_get(pill,
1496 lustre_swab_lquota_lvb);
1498 lvb = req_capsule_server_swab_get(pill,
1500 lustre_swab_lquota_lvb);
1501 if (unlikely(lvb == NULL)) {
1502 LDLM_ERROR(lock, "no LVB");
1506 memcpy(data, lvb, size);
1508 LDLM_ERROR(lock, "Replied unexpected lquota LVB size %d",
1517 if (loc == RCL_CLIENT)
1518 lvb = req_capsule_client_get(pill, &RMF_DLM_LVB);
1520 lvb = req_capsule_server_get(pill, &RMF_DLM_LVB);
1521 if (unlikely(lvb == NULL)) {
1522 LDLM_ERROR(lock, "no LVB");
1526 memcpy(data, lvb, size);
1529 LDLM_ERROR(lock, "Unknown LVB type: %d\n", lock->l_lvb_type);
1530 libcfs_debug_dumpstack(NULL);
1538 * Create and fill in new LDLM lock with specified properties.
1539 * Returns a referenced lock
1541 struct ldlm_lock *ldlm_lock_create(struct ldlm_namespace *ns,
1542 const struct ldlm_res_id *res_id,
1545 const struct ldlm_callback_suite *cbs,
1546 void *data, __u32 lvb_len,
1547 enum lvb_type lvb_type)
1549 struct ldlm_lock *lock;
1550 struct ldlm_resource *res;
1554 res = ldlm_resource_get(ns, NULL, res_id, type, 1);
1556 RETURN(ERR_CAST(res));
1558 lock = ldlm_lock_new(res);
1560 RETURN(ERR_PTR(-ENOMEM));
1562 lock->l_req_mode = mode;
1563 lock->l_ast_data = data;
1564 lock->l_pid = current_pid();
1565 if (ns_is_server(ns))
1566 ldlm_set_ns_srv(lock);
1568 lock->l_blocking_ast = cbs->lcs_blocking;
1569 lock->l_completion_ast = cbs->lcs_completion;
1570 lock->l_glimpse_ast = cbs->lcs_glimpse;
1573 lock->l_tree_node = NULL;
1574 /* if this is the extent lock, allocate the interval tree node */
1575 if (type == LDLM_EXTENT)
1576 if (ldlm_interval_alloc(lock) == NULL)
1577 GOTO(out, rc = -ENOMEM);
1580 lock->l_lvb_len = lvb_len;
1581 OBD_ALLOC_LARGE(lock->l_lvb_data, lvb_len);
1582 if (lock->l_lvb_data == NULL)
1583 GOTO(out, rc = -ENOMEM);
1586 lock->l_lvb_type = lvb_type;
1587 if (OBD_FAIL_CHECK(OBD_FAIL_LDLM_NEW_LOCK))
1588 GOTO(out, rc = -ENOENT);
1593 ldlm_lock_destroy(lock);
1594 LDLM_LOCK_RELEASE(lock);
1595 RETURN(ERR_PTR(rc));
1599 * Enqueue (request) a lock.
1601 * Does not block. As a result of enqueue the lock would be put
1602 * into granted or waiting list.
1604 * If namespace has intent policy sent and the lock has LDLM_FL_HAS_INTENT flag
1605 * set, skip all the enqueueing and delegate lock processing to intent policy
1608 ldlm_error_t ldlm_lock_enqueue(struct ldlm_namespace *ns,
1609 struct ldlm_lock **lockp,
1610 void *cookie, __u64 *flags)
1612 struct ldlm_lock *lock = *lockp;
1613 struct ldlm_resource *res = lock->l_resource;
1614 int local = ns_is_client(ldlm_res_to_ns(res));
1615 #ifdef HAVE_SERVER_SUPPORT
1616 ldlm_processing_policy policy;
1618 ldlm_error_t rc = ELDLM_OK;
1619 struct ldlm_interval *node = NULL;
1622 /* policies are not executed on the client or during replay */
1623 if ((*flags & (LDLM_FL_HAS_INTENT|LDLM_FL_REPLAY)) == LDLM_FL_HAS_INTENT
1624 && !local && ns->ns_policy) {
1625 rc = ns->ns_policy(ns, lockp, cookie, lock->l_req_mode, *flags,
1627 if (rc == ELDLM_LOCK_REPLACED) {
1628 /* The lock that was returned has already been granted,
1629 * and placed into lockp. If it's not the same as the
1630 * one we passed in, then destroy the old one and our
1631 * work here is done. */
1632 if (lock != *lockp) {
1633 ldlm_lock_destroy(lock);
1634 LDLM_LOCK_RELEASE(lock);
1636 *flags |= LDLM_FL_LOCK_CHANGED;
1638 } else if (rc != ELDLM_OK ||
1639 (rc == ELDLM_OK && (*flags & LDLM_FL_INTENT_ONLY))) {
1640 ldlm_lock_destroy(lock);
1645 if (*flags & LDLM_FL_RESENT) {
1646 /* Reconstruct LDLM_FL_SRV_ENQ_MASK @flags for reply.
1647 * Set LOCK_CHANGED always.
1648 * Check if the lock is granted for BLOCK_GRANTED.
1649 * Take NO_TIMEOUT from the lock as it is inherited through
1650 * LDLM_FL_INHERIT_MASK */
1651 *flags |= LDLM_FL_LOCK_CHANGED;
1652 if (lock->l_req_mode != lock->l_granted_mode)
1653 *flags |= LDLM_FL_BLOCK_GRANTED;
1654 *flags |= lock->l_flags & LDLM_FL_NO_TIMEOUT;
1658 /* For a replaying lock, it might be already in granted list. So
1659 * unlinking the lock will cause the interval node to be freed, we
1660 * have to allocate the interval node early otherwise we can't regrant
1661 * this lock in the future. - jay */
1662 if (!local && (*flags & LDLM_FL_REPLAY) && res->lr_type == LDLM_EXTENT)
1663 OBD_SLAB_ALLOC_PTR_GFP(node, ldlm_interval_slab, GFP_NOFS);
1665 lock_res_and_lock(lock);
1666 if (local && lock->l_req_mode == lock->l_granted_mode) {
1667 /* The server returned a blocked lock, but it was granted
1668 * before we got a chance to actually enqueue it. We don't
1669 * need to do anything else. */
1670 *flags &= ~LDLM_FL_BLOCKED_MASK;
1671 GOTO(out, rc = ELDLM_OK);
1674 ldlm_resource_unlink_lock(lock);
1675 if (res->lr_type == LDLM_EXTENT && lock->l_tree_node == NULL) {
1677 ldlm_lock_destroy_nolock(lock);
1678 GOTO(out, rc = -ENOMEM);
1681 INIT_LIST_HEAD(&node->li_group);
1682 ldlm_interval_attach(node, lock);
1686 /* Some flags from the enqueue want to make it into the AST, via the
1687 * lock's l_flags. */
1688 if (*flags & LDLM_FL_AST_DISCARD_DATA)
1689 ldlm_set_ast_discard_data(lock);
1690 if (*flags & LDLM_FL_TEST_LOCK)
1691 ldlm_set_test_lock(lock);
1693 /* This distinction between local lock trees is very important; a client
1694 * namespace only has information about locks taken by that client, and
1695 * thus doesn't have enough information to decide for itself if it can
1696 * be granted (below). In this case, we do exactly what the server
1697 * tells us to do, as dictated by the 'flags'.
1699 * We do exactly the same thing during recovery, when the server is
1700 * more or less trusting the clients not to lie.
1702 * FIXME (bug 268): Detect obvious lies by checking compatibility in
1703 * granted/converting queues. */
1705 if (*flags & LDLM_FL_BLOCK_CONV)
1706 ldlm_resource_add_lock(res, &res->lr_converting, lock);
1707 else if (*flags & (LDLM_FL_BLOCK_WAIT | LDLM_FL_BLOCK_GRANTED))
1708 ldlm_resource_add_lock(res, &res->lr_waiting, lock);
1710 ldlm_grant_lock(lock, NULL);
1711 GOTO(out, rc = ELDLM_OK);
1712 #ifdef HAVE_SERVER_SUPPORT
1713 } else if (*flags & LDLM_FL_REPLAY) {
1714 if (*flags & LDLM_FL_BLOCK_CONV) {
1715 ldlm_resource_add_lock(res, &res->lr_converting, lock);
1716 GOTO(out, rc = ELDLM_OK);
1717 } else if (*flags & LDLM_FL_BLOCK_WAIT) {
1718 ldlm_resource_add_lock(res, &res->lr_waiting, lock);
1719 GOTO(out, rc = ELDLM_OK);
1720 } else if (*flags & LDLM_FL_BLOCK_GRANTED) {
1721 ldlm_grant_lock(lock, NULL);
1722 GOTO(out, rc = ELDLM_OK);
1724 /* If no flags, fall through to normal enqueue path. */
1727 policy = ldlm_processing_policy_table[res->lr_type];
1728 policy(lock, flags, 1, &rc, NULL);
1732 CERROR("This is client-side-only module, cannot handle "
1733 "LDLM_NAMESPACE_SERVER resource type lock.\n");
1739 unlock_res_and_lock(lock);
1741 OBD_SLAB_FREE(node, ldlm_interval_slab, sizeof(*node));
1745 #ifdef HAVE_SERVER_SUPPORT
1747 * Iterate through all waiting locks on a given resource queue and attempt to
1750 * Must be called with resource lock held.
1752 int ldlm_reprocess_queue(struct ldlm_resource *res, struct list_head *queue,
1753 struct list_head *work_list)
1755 struct list_head *tmp, *pos;
1756 ldlm_processing_policy policy;
1758 int rc = LDLM_ITER_CONTINUE;
1762 check_res_locked(res);
1764 policy = ldlm_processing_policy_table[res->lr_type];
1767 list_for_each_safe(tmp, pos, queue) {
1768 struct ldlm_lock *pending;
1769 pending = list_entry(tmp, struct ldlm_lock, l_res_link);
1771 CDEBUG(D_INFO, "Reprocessing lock %p\n", pending);
1774 rc = policy(pending, &flags, 0, &err, work_list);
1775 if (rc != LDLM_ITER_CONTINUE)
1784 * Process a call to blocking AST callback for a lock in ast_work list
1787 ldlm_work_bl_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1789 struct ldlm_cb_set_arg *arg = opaq;
1790 struct ldlm_lock_desc d;
1792 struct ldlm_lock *lock;
1795 if (list_empty(arg->list))
1798 lock = list_entry(arg->list->next, struct ldlm_lock, l_bl_ast);
1800 /* nobody should touch l_bl_ast */
1801 lock_res_and_lock(lock);
1802 list_del_init(&lock->l_bl_ast);
1804 LASSERT(ldlm_is_ast_sent(lock));
1805 LASSERT(lock->l_bl_ast_run == 0);
1806 LASSERT(lock->l_blocking_lock);
1807 lock->l_bl_ast_run++;
1808 unlock_res_and_lock(lock);
1810 ldlm_lock2desc(lock->l_blocking_lock, &d);
1812 rc = lock->l_blocking_ast(lock, &d, (void *)arg, LDLM_CB_BLOCKING);
1813 LDLM_LOCK_RELEASE(lock->l_blocking_lock);
1814 lock->l_blocking_lock = NULL;
1815 LDLM_LOCK_RELEASE(lock);
1821 * Process a call to completion AST callback for a lock in ast_work list
1824 ldlm_work_cp_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1826 struct ldlm_cb_set_arg *arg = opaq;
1828 struct ldlm_lock *lock;
1829 ldlm_completion_callback completion_callback;
1832 if (list_empty(arg->list))
1835 lock = list_entry(arg->list->next, struct ldlm_lock, l_cp_ast);
1837 /* It's possible to receive a completion AST before we've set
1838 * the l_completion_ast pointer: either because the AST arrived
1839 * before the reply, or simply because there's a small race
1840 * window between receiving the reply and finishing the local
1841 * enqueue. (bug 842)
1843 * This can't happen with the blocking_ast, however, because we
1844 * will never call the local blocking_ast until we drop our
1845 * reader/writer reference, which we won't do until we get the
1846 * reply and finish enqueueing. */
1848 /* nobody should touch l_cp_ast */
1849 lock_res_and_lock(lock);
1850 list_del_init(&lock->l_cp_ast);
1851 LASSERT(ldlm_is_cp_reqd(lock));
1852 /* save l_completion_ast since it can be changed by
1853 * mds_intent_policy(), see bug 14225 */
1854 completion_callback = lock->l_completion_ast;
1855 ldlm_clear_cp_reqd(lock);
1856 unlock_res_and_lock(lock);
1858 if (completion_callback != NULL)
1859 rc = completion_callback(lock, 0, (void *)arg);
1860 LDLM_LOCK_RELEASE(lock);
1866 * Process a call to revocation AST callback for a lock in ast_work list
1869 ldlm_work_revoke_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1871 struct ldlm_cb_set_arg *arg = opaq;
1872 struct ldlm_lock_desc desc;
1874 struct ldlm_lock *lock;
1877 if (list_empty(arg->list))
1880 lock = list_entry(arg->list->next, struct ldlm_lock, l_rk_ast);
1881 list_del_init(&lock->l_rk_ast);
1883 /* the desc just pretend to exclusive */
1884 ldlm_lock2desc(lock, &desc);
1885 desc.l_req_mode = LCK_EX;
1886 desc.l_granted_mode = 0;
1888 rc = lock->l_blocking_ast(lock, &desc, (void*)arg, LDLM_CB_BLOCKING);
1889 LDLM_LOCK_RELEASE(lock);
1895 * Process a call to glimpse AST callback for a lock in ast_work list
1897 int ldlm_work_gl_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1899 struct ldlm_cb_set_arg *arg = opaq;
1900 struct ldlm_glimpse_work *gl_work;
1901 struct ldlm_lock *lock;
1905 if (list_empty(arg->list))
1908 gl_work = list_entry(arg->list->next, struct ldlm_glimpse_work,
1910 list_del_init(&gl_work->gl_list);
1912 lock = gl_work->gl_lock;
1914 /* transfer the glimpse descriptor to ldlm_cb_set_arg */
1915 arg->gl_desc = gl_work->gl_desc;
1917 /* invoke the actual glimpse callback */
1918 if (lock->l_glimpse_ast(lock, (void*)arg) == 0)
1921 LDLM_LOCK_RELEASE(lock);
1923 if ((gl_work->gl_flags & LDLM_GL_WORK_NOFREE) == 0)
1924 OBD_FREE_PTR(gl_work);
1930 * Process list of locks in need of ASTs being sent.
1932 * Used on server to send multiple ASTs together instead of sending one by
1935 int ldlm_run_ast_work(struct ldlm_namespace *ns, struct list_head *rpc_list,
1936 ldlm_desc_ast_t ast_type)
1938 struct ldlm_cb_set_arg *arg;
1939 set_producer_func work_ast_lock;
1942 if (list_empty(rpc_list))
1949 atomic_set(&arg->restart, 0);
1950 arg->list = rpc_list;
1953 case LDLM_WORK_BL_AST:
1954 arg->type = LDLM_BL_CALLBACK;
1955 work_ast_lock = ldlm_work_bl_ast_lock;
1957 case LDLM_WORK_CP_AST:
1958 arg->type = LDLM_CP_CALLBACK;
1959 work_ast_lock = ldlm_work_cp_ast_lock;
1961 case LDLM_WORK_REVOKE_AST:
1962 arg->type = LDLM_BL_CALLBACK;
1963 work_ast_lock = ldlm_work_revoke_ast_lock;
1965 case LDLM_WORK_GL_AST:
1966 arg->type = LDLM_GL_CALLBACK;
1967 work_ast_lock = ldlm_work_gl_ast_lock;
1973 /* We create a ptlrpc request set with flow control extension.
1974 * This request set will use the work_ast_lock function to produce new
1975 * requests and will send a new request each time one completes in order
1976 * to keep the number of requests in flight to ns_max_parallel_ast */
1977 arg->set = ptlrpc_prep_fcset(ns->ns_max_parallel_ast ? : UINT_MAX,
1978 work_ast_lock, arg);
1979 if (arg->set == NULL)
1980 GOTO(out, rc = -ENOMEM);
1982 ptlrpc_set_wait(arg->set);
1983 ptlrpc_set_destroy(arg->set);
1985 rc = atomic_read(&arg->restart) ? -ERESTART : 0;
1992 static int reprocess_one_queue(struct ldlm_resource *res, void *closure)
1994 ldlm_reprocess_all(res);
1995 return LDLM_ITER_CONTINUE;
1998 static int ldlm_reprocess_res(cfs_hash_t *hs, cfs_hash_bd_t *bd,
1999 struct hlist_node *hnode, void *arg)
2001 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
2004 rc = reprocess_one_queue(res, arg);
2006 return rc == LDLM_ITER_STOP;
2010 * Iterate through all resources on a namespace attempting to grant waiting
2013 void ldlm_reprocess_all_ns(struct ldlm_namespace *ns)
2018 cfs_hash_for_each_nolock(ns->ns_rs_hash,
2019 ldlm_reprocess_res, NULL);
2025 * Try to grant all waiting locks on a resource.
2027 * Calls ldlm_reprocess_queue on converting and waiting queues.
2029 * Typically called after some resource locks are cancelled to see
2030 * if anything could be granted as a result of the cancellation.
2032 void ldlm_reprocess_all(struct ldlm_resource *res)
2034 struct list_head rpc_list;
2035 #ifdef HAVE_SERVER_SUPPORT
2039 INIT_LIST_HEAD(&rpc_list);
2040 /* Local lock trees don't get reprocessed. */
2041 if (ns_is_client(ldlm_res_to_ns(res))) {
2048 rc = ldlm_reprocess_queue(res, &res->lr_converting, &rpc_list);
2049 if (rc == LDLM_ITER_CONTINUE)
2050 ldlm_reprocess_queue(res, &res->lr_waiting, &rpc_list);
2053 rc = ldlm_run_ast_work(ldlm_res_to_ns(res), &rpc_list,
2055 if (rc == -ERESTART) {
2056 LASSERT(list_empty(&rpc_list));
2062 INIT_LIST_HEAD(&rpc_list);
2063 if (!ns_is_client(ldlm_res_to_ns(res))) {
2064 CERROR("This is client-side-only module, cannot handle "
2065 "LDLM_NAMESPACE_SERVER resource type lock.\n");
2071 EXPORT_SYMBOL(ldlm_reprocess_all);
2074 * Helper function to call blocking AST for LDLM lock \a lock in a
2075 * "cancelling" mode.
2077 void ldlm_cancel_callback(struct ldlm_lock *lock)
2079 check_res_locked(lock->l_resource);
2080 if (!ldlm_is_cancel(lock)) {
2081 ldlm_set_cancel(lock);
2082 if (lock->l_blocking_ast) {
2083 unlock_res_and_lock(lock);
2084 lock->l_blocking_ast(lock, NULL, lock->l_ast_data,
2086 lock_res_and_lock(lock);
2088 LDLM_DEBUG(lock, "no blocking ast");
2091 ldlm_set_bl_done(lock);
2095 * Remove skiplist-enabled LDLM lock \a req from granted list
2097 void ldlm_unlink_lock_skiplist(struct ldlm_lock *req)
2099 if (req->l_resource->lr_type != LDLM_PLAIN &&
2100 req->l_resource->lr_type != LDLM_IBITS)
2103 list_del_init(&req->l_sl_policy);
2104 list_del_init(&req->l_sl_mode);
2108 * Attempts to cancel LDLM lock \a lock that has no reader/writer references.
2110 void ldlm_lock_cancel(struct ldlm_lock *lock)
2112 struct ldlm_resource *res;
2113 struct ldlm_namespace *ns;
2116 lock_res_and_lock(lock);
2118 res = lock->l_resource;
2119 ns = ldlm_res_to_ns(res);
2121 /* Please do not, no matter how tempting, remove this LBUG without
2122 * talking to me first. -phik */
2123 if (lock->l_readers || lock->l_writers) {
2124 LDLM_ERROR(lock, "lock still has references");
2128 if (ldlm_is_waited(lock))
2129 ldlm_del_waiting_lock(lock);
2131 /* Releases cancel callback. */
2132 ldlm_cancel_callback(lock);
2134 LASSERT(!ldlm_is_waited(lock));
2136 ldlm_resource_unlink_lock(lock);
2137 ldlm_lock_destroy_nolock(lock);
2139 if (lock->l_granted_mode == lock->l_req_mode)
2140 ldlm_pool_del(&ns->ns_pool, lock);
2142 /* Make sure we will not be called again for same lock what is possible
2143 * if not to zero out lock->l_granted_mode */
2144 lock->l_granted_mode = LCK_MINMODE;
2145 unlock_res_and_lock(lock);
2149 EXPORT_SYMBOL(ldlm_lock_cancel);
2152 * Set opaque data into the lock that only makes sense to upper layer.
2154 int ldlm_lock_set_data(struct lustre_handle *lockh, void *data)
2156 struct ldlm_lock *lock = ldlm_handle2lock(lockh);
2161 if (lock->l_ast_data == NULL)
2162 lock->l_ast_data = data;
2163 if (lock->l_ast_data == data)
2165 LDLM_LOCK_PUT(lock);
2169 EXPORT_SYMBOL(ldlm_lock_set_data);
2171 struct export_cl_data {
2172 struct obd_export *ecl_exp;
2177 * Iterator function for ldlm_cancel_locks_for_export.
2178 * Cancels passed locks.
2180 static int ldlm_cancel_locks_for_export_cb(cfs_hash_t *hs, cfs_hash_bd_t *bd,
2181 struct hlist_node *hnode, void *data)
2184 struct export_cl_data *ecl = (struct export_cl_data *)data;
2185 struct obd_export *exp = ecl->ecl_exp;
2186 struct ldlm_lock *lock = cfs_hash_object(hs, hnode);
2187 struct ldlm_resource *res;
2189 res = ldlm_resource_getref(lock->l_resource);
2190 LDLM_LOCK_GET(lock);
2192 LDLM_DEBUG(lock, "export %p", exp);
2193 ldlm_res_lvbo_update(res, NULL, 1);
2194 ldlm_lock_cancel(lock);
2195 ldlm_reprocess_all(res);
2196 ldlm_resource_putref(res);
2197 LDLM_LOCK_RELEASE(lock);
2200 if ((ecl->ecl_loop & -ecl->ecl_loop) == ecl->ecl_loop) {
2202 "Cancel lock %p for export %p (loop %d), still have "
2203 "%d locks left on hash table.\n",
2204 lock, exp, ecl->ecl_loop,
2205 atomic_read(&hs->hs_count));
2212 * Cancel all locks for given export.
2214 * Typically called on client disconnection/eviction
2216 void ldlm_cancel_locks_for_export(struct obd_export *exp)
2218 struct export_cl_data ecl = {
2223 cfs_hash_for_each_empty(exp->exp_lock_hash,
2224 ldlm_cancel_locks_for_export_cb, &ecl);
2228 * Downgrade an exclusive lock.
2230 * A fast variant of ldlm_lock_convert for convertion of exclusive
2231 * locks. The convertion is always successful.
2232 * Used by Commit on Sharing (COS) code.
2234 * \param lock A lock to convert
2235 * \param new_mode new lock mode
2237 void ldlm_lock_downgrade(struct ldlm_lock *lock, int new_mode)
2241 LASSERT(lock->l_granted_mode & (LCK_PW | LCK_EX));
2242 LASSERT(new_mode == LCK_COS);
2244 lock_res_and_lock(lock);
2245 ldlm_resource_unlink_lock(lock);
2247 * Remove the lock from pool as it will be added again in
2248 * ldlm_grant_lock() called below.
2250 ldlm_pool_del(&ldlm_lock_to_ns(lock)->ns_pool, lock);
2252 lock->l_req_mode = new_mode;
2253 ldlm_grant_lock(lock, NULL);
2254 unlock_res_and_lock(lock);
2255 ldlm_reprocess_all(lock->l_resource);
2259 EXPORT_SYMBOL(ldlm_lock_downgrade);
2262 * Attempt to convert already granted lock to a different mode.
2264 * While lock conversion is not currently used, future client-side
2265 * optimizations could take advantage of it to avoid discarding cached
2268 struct ldlm_resource *ldlm_lock_convert(struct ldlm_lock *lock, int new_mode,
2271 struct list_head rpc_list;
2272 struct ldlm_resource *res;
2273 struct ldlm_namespace *ns;
2275 #ifdef HAVE_SERVER_SUPPORT
2277 struct sl_insert_point prev;
2279 struct ldlm_interval *node;
2282 INIT_LIST_HEAD(&rpc_list);
2283 /* Just return if mode is unchanged. */
2284 if (new_mode == lock->l_granted_mode) {
2285 *flags |= LDLM_FL_BLOCK_GRANTED;
2286 RETURN(lock->l_resource);
2289 /* I can't check the type of lock here because the bitlock of lock
2290 * is not held here, so do the allocation blindly. -jay */
2291 OBD_SLAB_ALLOC_PTR_GFP(node, ldlm_interval_slab, GFP_NOFS);
2292 if (node == NULL) /* Actually, this causes EDEADLOCK to be returned */
2295 LASSERTF((new_mode == LCK_PW && lock->l_granted_mode == LCK_PR),
2296 "new_mode %u, granted %u\n", new_mode, lock->l_granted_mode);
2298 lock_res_and_lock(lock);
2300 res = lock->l_resource;
2301 ns = ldlm_res_to_ns(res);
2303 #ifdef HAVE_SERVER_SUPPORT
2304 old_mode = lock->l_req_mode;
2306 lock->l_req_mode = new_mode;
2307 if (res->lr_type == LDLM_PLAIN || res->lr_type == LDLM_IBITS) {
2308 #ifdef HAVE_SERVER_SUPPORT
2309 /* remember the lock position where the lock might be
2310 * added back to the granted list later and also
2311 * remember the join mode for skiplist fixing. */
2312 prev.res_link = lock->l_res_link.prev;
2313 prev.mode_link = lock->l_sl_mode.prev;
2314 prev.policy_link = lock->l_sl_policy.prev;
2316 ldlm_resource_unlink_lock(lock);
2318 ldlm_resource_unlink_lock(lock);
2319 if (res->lr_type == LDLM_EXTENT) {
2320 /* FIXME: ugly code, I have to attach the lock to a
2321 * interval node again since perhaps it will be granted
2323 INIT_LIST_HEAD(&node->li_group);
2324 ldlm_interval_attach(node, lock);
2330 * Remove old lock from the pool before adding the lock with new
2331 * mode below in ->policy()
2333 ldlm_pool_del(&ns->ns_pool, lock);
2335 /* If this is a local resource, put it on the appropriate list. */
2336 if (ns_is_client(ldlm_res_to_ns(res))) {
2337 if (*flags & (LDLM_FL_BLOCK_CONV | LDLM_FL_BLOCK_GRANTED)) {
2338 ldlm_resource_add_lock(res, &res->lr_converting, lock);
2340 /* This should never happen, because of the way the
2341 * server handles conversions. */
2342 LDLM_ERROR(lock, "Erroneous flags %x on local lock\n",
2346 ldlm_grant_lock(lock, &rpc_list);
2348 /* FIXME: completion handling not with lr_lock held ! */
2349 if (lock->l_completion_ast)
2350 lock->l_completion_ast(lock, 0, NULL);
2352 #ifdef HAVE_SERVER_SUPPORT
2357 ldlm_processing_policy policy;
2358 policy = ldlm_processing_policy_table[res->lr_type];
2359 rc = policy(lock, &pflags, 0, &err, &rpc_list);
2360 if (rc == LDLM_ITER_STOP) {
2361 lock->l_req_mode = old_mode;
2362 if (res->lr_type == LDLM_EXTENT)
2363 ldlm_extent_add_lock(res, lock);
2365 ldlm_granted_list_add_lock(lock, &prev);
2369 *flags |= LDLM_FL_BLOCK_GRANTED;
2375 CERROR("This is client-side-only module, cannot handle "
2376 "LDLM_NAMESPACE_SERVER resource type lock.\n");
2380 unlock_res_and_lock(lock);
2383 ldlm_run_ast_work(ns, &rpc_list, LDLM_WORK_CP_AST);
2385 OBD_SLAB_FREE(node, ldlm_interval_slab, sizeof(*node));
2390 * Print lock with lock handle \a lockh description into debug log.
2392 * Used when printing all locks on a resource for debug purposes.
2394 void ldlm_lock_dump_handle(int level, struct lustre_handle *lockh)
2396 struct ldlm_lock *lock;
2398 if (!((libcfs_debug | D_ERROR) & level))
2401 lock = ldlm_handle2lock(lockh);
2405 LDLM_DEBUG_LIMIT(level, lock, "###");
2407 LDLM_LOCK_PUT(lock);
2409 EXPORT_SYMBOL(ldlm_lock_dump_handle);
2412 * Print lock information with custom message into debug log.
2415 void _ldlm_lock_debug(struct ldlm_lock *lock,
2416 struct libcfs_debug_msg_data *msgdata,
2417 const char *fmt, ...)
2420 struct obd_export *exp = lock->l_export;
2421 struct ldlm_resource *resource = lock->l_resource;
2422 char *nid = "local";
2424 va_start(args, fmt);
2426 if (exp && exp->exp_connection) {
2427 nid = libcfs_nid2str(exp->exp_connection->c_peer.nid);
2428 } else if (exp && exp->exp_obd != NULL) {
2429 struct obd_import *imp = exp->exp_obd->u.cli.cl_import;
2430 nid = libcfs_nid2str(imp->imp_connection->c_peer.nid);
2433 if (resource == NULL) {
2434 libcfs_debug_vmsg2(msgdata, fmt, args,
2435 " ns: \?\? lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
2436 "res: \?\? rrc=\?\? type: \?\?\? flags: "LPX64" nid: %s "
2437 "remote: "LPX64" expref: %d pid: %u timeout: %lu "
2440 lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
2441 lock->l_readers, lock->l_writers,
2442 ldlm_lockname[lock->l_granted_mode],
2443 ldlm_lockname[lock->l_req_mode],
2444 lock->l_flags, nid, lock->l_remote_handle.cookie,
2445 exp ? atomic_read(&exp->exp_refcount) : -99,
2446 lock->l_pid, lock->l_callback_timeout, lock->l_lvb_type);
2451 switch (resource->lr_type) {
2453 libcfs_debug_vmsg2(msgdata, fmt, args,
2454 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
2455 "res: "DLDLMRES" rrc: %d type: %s ["LPU64"->"LPU64"] "
2456 "(req "LPU64"->"LPU64") flags: "LPX64" nid: %s remote: "
2457 LPX64" expref: %d pid: %u timeout: %lu lvb_type: %d\n",
2458 ldlm_lock_to_ns_name(lock), lock,
2459 lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
2460 lock->l_readers, lock->l_writers,
2461 ldlm_lockname[lock->l_granted_mode],
2462 ldlm_lockname[lock->l_req_mode],
2464 atomic_read(&resource->lr_refcount),
2465 ldlm_typename[resource->lr_type],
2466 lock->l_policy_data.l_extent.start,
2467 lock->l_policy_data.l_extent.end,
2468 lock->l_req_extent.start, lock->l_req_extent.end,
2469 lock->l_flags, nid, lock->l_remote_handle.cookie,
2470 exp ? atomic_read(&exp->exp_refcount) : -99,
2471 lock->l_pid, lock->l_callback_timeout,
2476 libcfs_debug_vmsg2(msgdata, fmt, args,
2477 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
2478 "res: "DLDLMRES" rrc: %d type: %s pid: %d "
2479 "["LPU64"->"LPU64"] flags: "LPX64" nid: %s "
2480 "remote: "LPX64" expref: %d pid: %u timeout: %lu\n",
2481 ldlm_lock_to_ns_name(lock), lock,
2482 lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
2483 lock->l_readers, lock->l_writers,
2484 ldlm_lockname[lock->l_granted_mode],
2485 ldlm_lockname[lock->l_req_mode],
2487 atomic_read(&resource->lr_refcount),
2488 ldlm_typename[resource->lr_type],
2489 lock->l_policy_data.l_flock.pid,
2490 lock->l_policy_data.l_flock.start,
2491 lock->l_policy_data.l_flock.end,
2492 lock->l_flags, nid, lock->l_remote_handle.cookie,
2493 exp ? atomic_read(&exp->exp_refcount) : -99,
2494 lock->l_pid, lock->l_callback_timeout);
2498 libcfs_debug_vmsg2(msgdata, fmt, args,
2499 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
2500 "res: "DLDLMRES" bits "LPX64" rrc: %d type: %s "
2501 "flags: "LPX64" nid: %s remote: "LPX64" expref: %d "
2502 "pid: %u timeout: %lu lvb_type: %d\n",
2503 ldlm_lock_to_ns_name(lock),
2504 lock, lock->l_handle.h_cookie,
2505 atomic_read(&lock->l_refc),
2506 lock->l_readers, lock->l_writers,
2507 ldlm_lockname[lock->l_granted_mode],
2508 ldlm_lockname[lock->l_req_mode],
2510 lock->l_policy_data.l_inodebits.bits,
2511 atomic_read(&resource->lr_refcount),
2512 ldlm_typename[resource->lr_type],
2513 lock->l_flags, nid, lock->l_remote_handle.cookie,
2514 exp ? atomic_read(&exp->exp_refcount) : -99,
2515 lock->l_pid, lock->l_callback_timeout,
2520 libcfs_debug_vmsg2(msgdata, fmt, args,
2521 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
2522 "res: "DLDLMRES" rrc: %d type: %s flags: "LPX64" "
2523 "nid: %s remote: "LPX64" expref: %d pid: %u "
2524 "timeout: %lu lvb_type: %d\n",
2525 ldlm_lock_to_ns_name(lock),
2526 lock, lock->l_handle.h_cookie,
2527 atomic_read(&lock->l_refc),
2528 lock->l_readers, lock->l_writers,
2529 ldlm_lockname[lock->l_granted_mode],
2530 ldlm_lockname[lock->l_req_mode],
2532 atomic_read(&resource->lr_refcount),
2533 ldlm_typename[resource->lr_type],
2534 lock->l_flags, nid, lock->l_remote_handle.cookie,
2535 exp ? atomic_read(&exp->exp_refcount) : -99,
2536 lock->l_pid, lock->l_callback_timeout,
2542 EXPORT_SYMBOL(_ldlm_lock_debug);