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_wire18_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_wire18_to_local,
73 [LDLM_IBITS - LDLM_MIN_TYPE] = ldlm_ibits_policy_wire_to_local,
76 static ldlm_policy_wire_to_local_t ldlm_policy_wire21_to_local[] = {
77 [LDLM_PLAIN - LDLM_MIN_TYPE] = ldlm_plain_policy_wire_to_local,
78 [LDLM_EXTENT - LDLM_MIN_TYPE] = ldlm_extent_policy_wire_to_local,
79 [LDLM_FLOCK - LDLM_MIN_TYPE] = ldlm_flock_policy_wire21_to_local,
80 [LDLM_IBITS - LDLM_MIN_TYPE] = ldlm_ibits_policy_wire_to_local,
83 static ldlm_policy_local_to_wire_t ldlm_policy_local_to_wire[] = {
84 [LDLM_PLAIN - LDLM_MIN_TYPE] = ldlm_plain_policy_local_to_wire,
85 [LDLM_EXTENT - LDLM_MIN_TYPE] = ldlm_extent_policy_local_to_wire,
86 [LDLM_FLOCK - LDLM_MIN_TYPE] = ldlm_flock_policy_local_to_wire,
87 [LDLM_IBITS - LDLM_MIN_TYPE] = ldlm_ibits_policy_local_to_wire,
91 * Converts lock policy from local format to on the wire lock_desc format
93 void ldlm_convert_policy_to_wire(ldlm_type_t type,
94 const ldlm_policy_data_t *lpolicy,
95 ldlm_wire_policy_data_t *wpolicy)
97 ldlm_policy_local_to_wire_t convert;
99 convert = ldlm_policy_local_to_wire[type - LDLM_MIN_TYPE];
101 convert(lpolicy, wpolicy);
105 * Converts lock policy from on the wire lock_desc format to local format
107 void ldlm_convert_policy_to_local(struct obd_export *exp, ldlm_type_t type,
108 const ldlm_wire_policy_data_t *wpolicy,
109 ldlm_policy_data_t *lpolicy)
111 ldlm_policy_wire_to_local_t convert;
114 /** some badness for 2.0.0 clients, but 2.0.0 isn't supported */
115 new_client = (exp_connect_flags(exp) & OBD_CONNECT_FULL20) != 0;
117 convert = ldlm_policy_wire21_to_local[type - LDLM_MIN_TYPE];
119 convert = ldlm_policy_wire18_to_local[type - LDLM_MIN_TYPE];
121 convert(wpolicy, lpolicy);
124 char *ldlm_it2str(int it)
131 case (IT_OPEN | IT_CREAT):
146 CERROR("Unknown intent %d\n", it);
150 EXPORT_SYMBOL(ldlm_it2str);
152 extern struct kmem_cache *ldlm_lock_slab;
154 #ifdef HAVE_SERVER_SUPPORT
155 static ldlm_processing_policy ldlm_processing_policy_table[] = {
156 [LDLM_PLAIN] = ldlm_process_plain_lock,
157 [LDLM_EXTENT] = ldlm_process_extent_lock,
158 [LDLM_FLOCK] = ldlm_process_flock_lock,
159 [LDLM_IBITS] = ldlm_process_inodebits_lock,
162 ldlm_processing_policy ldlm_get_processing_policy(struct ldlm_resource *res)
164 return ldlm_processing_policy_table[res->lr_type];
166 EXPORT_SYMBOL(ldlm_get_processing_policy);
167 #endif /* HAVE_SERVER_SUPPORT */
169 void ldlm_register_intent(struct ldlm_namespace *ns, ldlm_res_policy arg)
173 EXPORT_SYMBOL(ldlm_register_intent);
176 * REFCOUNTED LOCK OBJECTS
181 * Get a reference on a lock.
183 * Lock refcounts, during creation:
184 * - one special one for allocation, dec'd only once in destroy
185 * - one for being a lock that's in-use
186 * - one for the addref associated with a new lock
188 struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock)
190 atomic_inc(&lock->l_refc);
193 EXPORT_SYMBOL(ldlm_lock_get);
196 * Release lock reference.
198 * Also frees the lock if it was last reference.
200 void ldlm_lock_put(struct ldlm_lock *lock)
204 LASSERT(lock->l_resource != LP_POISON);
205 LASSERT(atomic_read(&lock->l_refc) > 0);
206 if (atomic_dec_and_test(&lock->l_refc)) {
207 struct ldlm_resource *res;
210 "final lock_put on destroyed lock, freeing it.");
212 res = lock->l_resource;
213 LASSERT(ldlm_is_destroyed(lock));
214 LASSERT(list_empty(&lock->l_res_link));
215 LASSERT(list_empty(&lock->l_pending_chain));
217 lprocfs_counter_decr(ldlm_res_to_ns(res)->ns_stats,
219 lu_ref_del(&res->lr_reference, "lock", lock);
220 ldlm_resource_putref(res);
221 lock->l_resource = NULL;
222 if (lock->l_export) {
223 class_export_lock_put(lock->l_export, lock);
224 lock->l_export = NULL;
227 if (lock->l_lvb_data != NULL)
228 OBD_FREE_LARGE(lock->l_lvb_data, lock->l_lvb_len);
230 ldlm_interval_free(ldlm_interval_detach(lock));
231 lu_ref_fini(&lock->l_reference);
232 OBD_FREE_RCU(lock, sizeof(*lock), &lock->l_handle);
237 EXPORT_SYMBOL(ldlm_lock_put);
240 * Removes LDLM lock \a lock from LRU. Assumes LRU is already locked.
242 int ldlm_lock_remove_from_lru_nolock(struct ldlm_lock *lock)
245 if (!list_empty(&lock->l_lru)) {
246 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
248 LASSERT(lock->l_resource->lr_type != LDLM_FLOCK);
249 list_del_init(&lock->l_lru);
250 LASSERT(ns->ns_nr_unused > 0);
258 * Removes LDLM lock \a lock from LRU. Obtains the LRU lock first.
260 int ldlm_lock_remove_from_lru(struct ldlm_lock *lock)
262 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
266 if (ldlm_is_ns_srv(lock)) {
267 LASSERT(list_empty(&lock->l_lru));
271 spin_lock(&ns->ns_lock);
272 rc = ldlm_lock_remove_from_lru_nolock(lock);
273 spin_unlock(&ns->ns_lock);
279 * Adds LDLM lock \a lock to namespace LRU. Assumes LRU is already locked.
281 void ldlm_lock_add_to_lru_nolock(struct ldlm_lock *lock)
283 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
285 lock->l_last_used = cfs_time_current();
286 LASSERT(list_empty(&lock->l_lru));
287 LASSERT(lock->l_resource->lr_type != LDLM_FLOCK);
288 list_add_tail(&lock->l_lru, &ns->ns_unused_list);
289 ldlm_clear_skipped(lock);
290 LASSERT(ns->ns_nr_unused >= 0);
295 * Adds LDLM lock \a lock to namespace LRU. Obtains necessary LRU locks
298 void ldlm_lock_add_to_lru(struct ldlm_lock *lock)
300 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
303 spin_lock(&ns->ns_lock);
304 ldlm_lock_add_to_lru_nolock(lock);
305 spin_unlock(&ns->ns_lock);
310 * Moves LDLM lock \a lock that is already in namespace LRU to the tail of
311 * the LRU. Performs necessary LRU locking
313 void ldlm_lock_touch_in_lru(struct ldlm_lock *lock)
315 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
318 if (ldlm_is_ns_srv(lock)) {
319 LASSERT(list_empty(&lock->l_lru));
324 spin_lock(&ns->ns_lock);
325 if (!list_empty(&lock->l_lru)) {
326 ldlm_lock_remove_from_lru_nolock(lock);
327 ldlm_lock_add_to_lru_nolock(lock);
329 spin_unlock(&ns->ns_lock);
334 * Helper to destroy a locked lock.
336 * Used by ldlm_lock_destroy and ldlm_lock_destroy_nolock
337 * Must be called with l_lock and lr_lock held.
339 * Does not actually free the lock data, but rather marks the lock as
340 * destroyed by setting l_destroyed field in the lock to 1. Destroys a
341 * handle->lock association too, so that the lock can no longer be found
342 * and removes the lock from LRU list. Actual lock freeing occurs when
343 * last lock reference goes away.
345 * Original comment (of some historical value):
346 * This used to have a 'strict' flag, which recovery would use to mark an
347 * in-use lock as needing-to-die. Lest I am ever tempted to put it back, I
348 * shall explain why it's gone: with the new hash table scheme, once you call
349 * ldlm_lock_destroy, you can never drop your final references on this lock.
350 * Because it's not in the hash table anymore. -phil
352 static int ldlm_lock_destroy_internal(struct ldlm_lock *lock)
356 if (lock->l_readers || lock->l_writers) {
357 LDLM_ERROR(lock, "lock still has references");
361 if (!list_empty(&lock->l_res_link)) {
362 LDLM_ERROR(lock, "lock still on resource");
366 if (ldlm_is_destroyed(lock)) {
367 LASSERT(list_empty(&lock->l_lru));
371 ldlm_set_destroyed(lock);
373 if (lock->l_export && lock->l_export->exp_lock_hash) {
374 /* NB: it's safe to call cfs_hash_del() even lock isn't
375 * in exp_lock_hash. */
376 /* In the function below, .hs_keycmp resolves to
377 * ldlm_export_lock_keycmp() */
378 /* coverity[overrun-buffer-val] */
379 cfs_hash_del(lock->l_export->exp_lock_hash,
380 &lock->l_remote_handle, &lock->l_exp_hash);
383 ldlm_lock_remove_from_lru(lock);
384 class_handle_unhash(&lock->l_handle);
387 /* Wake anyone waiting for this lock */
388 /* FIXME: I should probably add yet another flag, instead of using
389 * l_export to only call this on clients */
391 class_export_put(lock->l_export);
392 lock->l_export = NULL;
393 if (lock->l_export && lock->l_completion_ast)
394 lock->l_completion_ast(lock, 0);
401 * Destroys a LDLM lock \a lock. Performs necessary locking first.
403 void ldlm_lock_destroy(struct ldlm_lock *lock)
407 lock_res_and_lock(lock);
408 first = ldlm_lock_destroy_internal(lock);
409 unlock_res_and_lock(lock);
411 /* drop reference from hashtable only for first destroy */
413 lu_ref_del(&lock->l_reference, "hash", lock);
414 LDLM_LOCK_RELEASE(lock);
420 * Destroys a LDLM lock \a lock that is already locked.
422 void ldlm_lock_destroy_nolock(struct ldlm_lock *lock)
426 first = ldlm_lock_destroy_internal(lock);
427 /* drop reference from hashtable only for first destroy */
429 lu_ref_del(&lock->l_reference, "hash", lock);
430 LDLM_LOCK_RELEASE(lock);
435 /* this is called by portals_handle2object with the handle lock taken */
436 static void lock_handle_addref(void *lock)
438 LDLM_LOCK_GET((struct ldlm_lock *)lock);
441 static void lock_handle_free(void *lock, int size)
443 LASSERT(size == sizeof(struct ldlm_lock));
444 OBD_SLAB_FREE(lock, ldlm_lock_slab, size);
447 static struct portals_handle_ops lock_handle_ops = {
448 .hop_addref = lock_handle_addref,
449 .hop_free = lock_handle_free,
454 * Allocate and initialize new lock structure.
456 * usage: pass in a resource on which you have done ldlm_resource_get
457 * new lock will take over the refcount.
458 * returns: lock with refcount 2 - one for current caller and one for remote
460 static struct ldlm_lock *ldlm_lock_new(struct ldlm_resource *resource)
462 struct ldlm_lock *lock;
465 if (resource == NULL)
468 OBD_SLAB_ALLOC_PTR_GFP(lock, ldlm_lock_slab, GFP_NOFS);
472 spin_lock_init(&lock->l_lock);
473 lock->l_resource = resource;
474 lu_ref_add(&resource->lr_reference, "lock", lock);
476 atomic_set(&lock->l_refc, 2);
477 INIT_LIST_HEAD(&lock->l_res_link);
478 INIT_LIST_HEAD(&lock->l_lru);
479 INIT_LIST_HEAD(&lock->l_pending_chain);
480 INIT_LIST_HEAD(&lock->l_bl_ast);
481 INIT_LIST_HEAD(&lock->l_cp_ast);
482 INIT_LIST_HEAD(&lock->l_rk_ast);
483 init_waitqueue_head(&lock->l_waitq);
484 lock->l_blocking_lock = NULL;
485 INIT_LIST_HEAD(&lock->l_sl_mode);
486 INIT_LIST_HEAD(&lock->l_sl_policy);
487 INIT_HLIST_NODE(&lock->l_exp_hash);
488 INIT_HLIST_NODE(&lock->l_exp_flock_hash);
490 lprocfs_counter_incr(ldlm_res_to_ns(resource)->ns_stats,
492 INIT_LIST_HEAD(&lock->l_handle.h_link);
493 class_handle_hash(&lock->l_handle, &lock_handle_ops);
495 lu_ref_init(&lock->l_reference);
496 lu_ref_add(&lock->l_reference, "hash", lock);
497 lock->l_callback_timeout = 0;
499 #if LUSTRE_TRACKS_LOCK_EXP_REFS
500 INIT_LIST_HEAD(&lock->l_exp_refs_link);
501 lock->l_exp_refs_nr = 0;
502 lock->l_exp_refs_target = NULL;
504 INIT_LIST_HEAD(&lock->l_exp_list);
510 * Moves LDLM lock \a lock to another resource.
511 * This is used on client when server returns some other lock than requested
512 * (typically as a result of intent operation)
514 int ldlm_lock_change_resource(struct ldlm_namespace *ns, struct ldlm_lock *lock,
515 const struct ldlm_res_id *new_resid)
517 struct ldlm_resource *oldres = lock->l_resource;
518 struct ldlm_resource *newres;
522 LASSERT(ns_is_client(ns));
524 lock_res_and_lock(lock);
525 if (memcmp(new_resid, &lock->l_resource->lr_name,
526 sizeof(lock->l_resource->lr_name)) == 0) {
528 unlock_res_and_lock(lock);
532 LASSERT(new_resid->name[0] != 0);
534 /* This function assumes that the lock isn't on any lists */
535 LASSERT(list_empty(&lock->l_res_link));
537 type = oldres->lr_type;
538 unlock_res_and_lock(lock);
540 newres = ldlm_resource_get(ns, NULL, new_resid, type, 1);
542 RETURN(PTR_ERR(newres));
544 lu_ref_add(&newres->lr_reference, "lock", lock);
546 * To flip the lock from the old to the new resource, lock, oldres and
547 * newres have to be locked. Resource spin-locks are nested within
548 * lock->l_lock, and are taken in the memory address order to avoid
551 spin_lock(&lock->l_lock);
552 oldres = lock->l_resource;
553 if (oldres < newres) {
555 lock_res_nested(newres, LRT_NEW);
558 lock_res_nested(oldres, LRT_NEW);
560 LASSERT(memcmp(new_resid, &oldres->lr_name,
561 sizeof oldres->lr_name) != 0);
562 lock->l_resource = newres;
564 unlock_res_and_lock(lock);
566 /* ...and the flowers are still standing! */
567 lu_ref_del(&oldres->lr_reference, "lock", lock);
568 ldlm_resource_putref(oldres);
573 /** \defgroup ldlm_handles LDLM HANDLES
574 * Ways to get hold of locks without any addresses.
579 * Fills in handle for LDLM lock \a lock into supplied \a lockh
580 * Does not take any references.
582 void ldlm_lock2handle(const struct ldlm_lock *lock, struct lustre_handle *lockh)
584 lockh->cookie = lock->l_handle.h_cookie;
586 EXPORT_SYMBOL(ldlm_lock2handle);
589 * Obtain a lock reference by handle.
591 * if \a flags: atomically get the lock and set the flags.
592 * Return NULL if flag already set
594 struct ldlm_lock *__ldlm_handle2lock(const struct lustre_handle *handle,
597 struct ldlm_lock *lock;
602 lock = class_handle2object(handle->cookie, NULL);
606 /* It's unlikely but possible that someone marked the lock as
607 * destroyed after we did handle2object on it */
608 if ((flags == 0) && !ldlm_is_destroyed(lock)) {
609 lu_ref_add(&lock->l_reference, "handle", current);
613 lock_res_and_lock(lock);
615 LASSERT(lock->l_resource != NULL);
617 lu_ref_add_atomic(&lock->l_reference, "handle", current);
618 if (unlikely(ldlm_is_destroyed(lock))) {
619 unlock_res_and_lock(lock);
620 CDEBUG(D_INFO, "lock already destroyed: lock %p\n", lock);
625 /* If we're setting flags, make sure none of them are already set. */
627 if ((lock->l_flags & flags) != 0) {
628 unlock_res_and_lock(lock);
633 lock->l_flags |= flags;
636 unlock_res_and_lock(lock);
639 EXPORT_SYMBOL(__ldlm_handle2lock);
640 /** @} ldlm_handles */
643 * Fill in "on the wire" representation for given LDLM lock into supplied
644 * lock descriptor \a desc structure.
646 void ldlm_lock2desc(struct ldlm_lock *lock, struct ldlm_lock_desc *desc)
648 ldlm_res2desc(lock->l_resource, &desc->l_resource);
649 desc->l_req_mode = lock->l_req_mode;
650 desc->l_granted_mode = lock->l_granted_mode;
651 ldlm_convert_policy_to_wire(lock->l_resource->lr_type,
652 &lock->l_policy_data,
653 &desc->l_policy_data);
657 * Add a lock to list of conflicting locks to send AST to.
659 * Only add if we have not sent a blocking AST to the lock yet.
661 static void ldlm_add_bl_work_item(struct ldlm_lock *lock, struct ldlm_lock *new,
662 struct list_head *work_list)
664 if (!ldlm_is_ast_sent(lock)) {
665 LDLM_DEBUG(lock, "lock incompatible; sending blocking AST.");
666 ldlm_set_ast_sent(lock);
667 /* If the enqueuing client said so, tell the AST recipient to
668 * discard dirty data, rather than writing back. */
669 if (ldlm_is_ast_discard_data(new))
670 ldlm_set_discard_data(lock);
671 LASSERT(list_empty(&lock->l_bl_ast));
672 list_add(&lock->l_bl_ast, work_list);
674 LASSERT(lock->l_blocking_lock == NULL);
675 lock->l_blocking_lock = LDLM_LOCK_GET(new);
680 * Add a lock to list of just granted locks to send completion AST to.
682 static void ldlm_add_cp_work_item(struct ldlm_lock *lock,
683 struct list_head *work_list)
685 if (!ldlm_is_cp_reqd(lock)) {
686 ldlm_set_cp_reqd(lock);
687 LDLM_DEBUG(lock, "lock granted; sending completion AST.");
688 LASSERT(list_empty(&lock->l_cp_ast));
689 list_add(&lock->l_cp_ast, work_list);
695 * Aggregator function to add AST work items into a list. Determines
696 * what sort of an AST work needs to be done and calls the proper
698 * Must be called with lr_lock held.
700 void ldlm_add_ast_work_item(struct ldlm_lock *lock, struct ldlm_lock *new,
701 struct list_head *work_list)
704 check_res_locked(lock->l_resource);
706 ldlm_add_bl_work_item(lock, new, work_list);
708 ldlm_add_cp_work_item(lock, work_list);
713 * Add specified reader/writer reference to LDLM lock with handle \a lockh.
714 * r/w reference type is determined by \a mode
715 * Calls ldlm_lock_addref_internal.
717 void ldlm_lock_addref(struct lustre_handle *lockh, __u32 mode)
719 struct ldlm_lock *lock;
721 lock = ldlm_handle2lock(lockh);
722 LASSERTF(lock != NULL, "Non-existing lock: "LPX64"\n", lockh->cookie);
723 ldlm_lock_addref_internal(lock, mode);
726 EXPORT_SYMBOL(ldlm_lock_addref);
730 * Add specified reader/writer reference to LDLM lock \a lock.
731 * r/w reference type is determined by \a mode
732 * Removes lock from LRU if it is there.
733 * Assumes the LDLM lock is already locked.
735 void ldlm_lock_addref_internal_nolock(struct ldlm_lock *lock, __u32 mode)
737 ldlm_lock_remove_from_lru(lock);
738 if (mode & (LCK_NL | LCK_CR | LCK_PR)) {
740 lu_ref_add_atomic(&lock->l_reference, "reader", lock);
742 if (mode & (LCK_EX | LCK_CW | LCK_PW | LCK_GROUP | LCK_COS)) {
744 lu_ref_add_atomic(&lock->l_reference, "writer", lock);
747 lu_ref_add_atomic(&lock->l_reference, "user", lock);
748 LDLM_DEBUG(lock, "ldlm_lock_addref(%s)", ldlm_lockname[mode]);
752 * Attempts to add reader/writer reference to a lock with handle \a lockh, and
753 * fails if lock is already LDLM_FL_CBPENDING or destroyed.
755 * \retval 0 success, lock was addref-ed
757 * \retval -EAGAIN lock is being canceled.
759 int ldlm_lock_addref_try(struct lustre_handle *lockh, __u32 mode)
761 struct ldlm_lock *lock;
765 lock = ldlm_handle2lock(lockh);
767 lock_res_and_lock(lock);
768 if (lock->l_readers != 0 || lock->l_writers != 0 ||
769 !ldlm_is_cbpending(lock)) {
770 ldlm_lock_addref_internal_nolock(lock, mode);
773 unlock_res_and_lock(lock);
778 EXPORT_SYMBOL(ldlm_lock_addref_try);
781 * Add specified reader/writer reference to LDLM lock \a lock.
782 * Locks LDLM lock and calls ldlm_lock_addref_internal_nolock to do the work.
783 * Only called for local locks.
785 void ldlm_lock_addref_internal(struct ldlm_lock *lock, __u32 mode)
787 lock_res_and_lock(lock);
788 ldlm_lock_addref_internal_nolock(lock, mode);
789 unlock_res_and_lock(lock);
793 * Removes reader/writer reference for LDLM lock \a lock.
794 * Assumes LDLM lock is already locked.
795 * only called in ldlm_flock_destroy and for local locks.
796 * Does NOT add lock to LRU if no r/w references left to accomodate flock locks
797 * that cannot be placed in LRU.
799 void ldlm_lock_decref_internal_nolock(struct ldlm_lock *lock, __u32 mode)
801 LDLM_DEBUG(lock, "ldlm_lock_decref(%s)", ldlm_lockname[mode]);
802 if (mode & (LCK_NL | LCK_CR | LCK_PR)) {
803 LASSERT(lock->l_readers > 0);
804 lu_ref_del(&lock->l_reference, "reader", lock);
807 if (mode & (LCK_EX | LCK_CW | LCK_PW | LCK_GROUP | LCK_COS)) {
808 LASSERT(lock->l_writers > 0);
809 lu_ref_del(&lock->l_reference, "writer", lock);
813 lu_ref_del(&lock->l_reference, "user", lock);
814 LDLM_LOCK_RELEASE(lock); /* matches the LDLM_LOCK_GET() in addref */
818 * Removes reader/writer reference for LDLM lock \a lock.
819 * Locks LDLM lock first.
820 * If the lock is determined to be client lock on a client and r/w refcount
821 * drops to zero and the lock is not blocked, the lock is added to LRU lock
823 * For blocked LDLM locks if r/w count drops to zero, blocking_ast is called.
825 void ldlm_lock_decref_internal(struct ldlm_lock *lock, __u32 mode)
827 struct ldlm_namespace *ns;
830 lock_res_and_lock(lock);
832 ns = ldlm_lock_to_ns(lock);
834 ldlm_lock_decref_internal_nolock(lock, mode);
836 if (ldlm_is_local(lock) &&
837 !lock->l_readers && !lock->l_writers) {
838 /* If this is a local lock on a server namespace and this was
839 * the last reference, cancel the lock. */
840 CDEBUG(D_INFO, "forcing cancel of local lock\n");
841 ldlm_set_cbpending(lock);
844 if (!lock->l_readers && !lock->l_writers &&
845 ldlm_is_cbpending(lock)) {
846 /* If we received a blocked AST and this was the last reference,
847 * run the callback. */
848 if (ldlm_is_ns_srv(lock) && lock->l_export)
849 CERROR("FL_CBPENDING set on non-local lock--just a "
852 LDLM_DEBUG(lock, "final decref done on cbpending lock");
854 LDLM_LOCK_GET(lock); /* dropped by bl thread */
855 ldlm_lock_remove_from_lru(lock);
856 unlock_res_and_lock(lock);
858 if (ldlm_is_fail_loc(lock))
859 OBD_RACE(OBD_FAIL_LDLM_CP_BL_RACE);
861 if (ldlm_is_atomic_cb(lock) ||
862 ldlm_bl_to_thread_lock(ns, NULL, lock) != 0)
863 ldlm_handle_bl_callback(ns, NULL, lock);
864 } else if (ns_is_client(ns) &&
865 !lock->l_readers && !lock->l_writers &&
866 !ldlm_is_no_lru(lock) &&
867 !ldlm_is_bl_ast(lock)) {
869 LDLM_DEBUG(lock, "add lock into lru list");
871 /* If this is a client-side namespace and this was the last
872 * reference, put it on the LRU. */
873 ldlm_lock_add_to_lru(lock);
874 unlock_res_and_lock(lock);
876 if (ldlm_is_fail_loc(lock))
877 OBD_RACE(OBD_FAIL_LDLM_CP_BL_RACE);
879 /* Call ldlm_cancel_lru() only if EARLY_CANCEL and LRU RESIZE
880 * are not supported by the server, otherwise, it is done on
882 if (!exp_connect_cancelset(lock->l_conn_export) &&
883 !ns_connect_lru_resize(ns))
884 ldlm_cancel_lru(ns, 0, LCF_ASYNC, 0);
886 LDLM_DEBUG(lock, "do not add lock into lru list");
887 unlock_res_and_lock(lock);
894 * Decrease reader/writer refcount for LDLM lock with handle \a lockh
896 void ldlm_lock_decref(struct lustre_handle *lockh, __u32 mode)
898 struct ldlm_lock *lock = __ldlm_handle2lock(lockh, 0);
899 LASSERTF(lock != NULL, "Non-existing lock: "LPX64"\n", lockh->cookie);
900 ldlm_lock_decref_internal(lock, mode);
903 EXPORT_SYMBOL(ldlm_lock_decref);
906 * Decrease reader/writer refcount for LDLM lock with handle
907 * \a lockh and mark it for subsequent cancellation once r/w refcount
908 * drops to zero instead of putting into LRU.
910 * Typical usage is for GROUP locks which we cannot allow to be cached.
912 void ldlm_lock_decref_and_cancel(struct lustre_handle *lockh, __u32 mode)
914 struct ldlm_lock *lock = __ldlm_handle2lock(lockh, 0);
917 LASSERT(lock != NULL);
919 LDLM_DEBUG(lock, "ldlm_lock_decref(%s)", ldlm_lockname[mode]);
920 lock_res_and_lock(lock);
921 ldlm_set_cbpending(lock);
922 unlock_res_and_lock(lock);
923 ldlm_lock_decref_internal(lock, mode);
926 EXPORT_SYMBOL(ldlm_lock_decref_and_cancel);
928 struct sl_insert_point {
929 struct list_head *res_link;
930 struct list_head *mode_link;
931 struct list_head *policy_link;
935 * Finds a position to insert the new lock into granted lock list.
937 * Used for locks eligible for skiplist optimization.
940 * queue [input]: the granted list where search acts on;
941 * req [input]: the lock whose position to be located;
942 * prev [output]: positions within 3 lists to insert @req to
946 * - ldlm_grant_lock_with_skiplist
948 static void search_granted_lock(struct list_head *queue,
949 struct ldlm_lock *req,
950 struct sl_insert_point *prev)
952 struct list_head *tmp;
953 struct ldlm_lock *lock, *mode_end, *policy_end;
956 list_for_each(tmp, queue) {
957 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
959 mode_end = list_entry(lock->l_sl_mode.prev,
960 struct ldlm_lock, l_sl_mode);
962 if (lock->l_req_mode != req->l_req_mode) {
963 /* jump to last lock of mode group */
964 tmp = &mode_end->l_res_link;
968 /* suitable mode group is found */
969 if (lock->l_resource->lr_type == LDLM_PLAIN) {
970 /* insert point is last lock of the mode group */
971 prev->res_link = &mode_end->l_res_link;
972 prev->mode_link = &mode_end->l_sl_mode;
973 prev->policy_link = &req->l_sl_policy;
976 } else if (lock->l_resource->lr_type == LDLM_IBITS) {
979 list_entry(lock->l_sl_policy.prev,
983 if (lock->l_policy_data.l_inodebits.bits ==
984 req->l_policy_data.l_inodebits.bits) {
985 /* insert point is last lock of
986 * the policy group */
988 &policy_end->l_res_link;
990 &policy_end->l_sl_mode;
992 &policy_end->l_sl_policy;
997 if (policy_end == mode_end)
998 /* done with mode group */
1001 /* go to next policy group within mode group */
1002 tmp = policy_end->l_res_link.next;
1003 lock = list_entry(tmp, struct ldlm_lock,
1005 } /* loop over policy groups within the mode group */
1007 /* insert point is last lock of the mode group,
1008 * new policy group is started */
1009 prev->res_link = &mode_end->l_res_link;
1010 prev->mode_link = &mode_end->l_sl_mode;
1011 prev->policy_link = &req->l_sl_policy;
1015 LDLM_ERROR(lock,"is not LDLM_PLAIN or LDLM_IBITS lock");
1020 /* insert point is last lock on the queue,
1021 * new mode group and new policy group are started */
1022 prev->res_link = queue->prev;
1023 prev->mode_link = &req->l_sl_mode;
1024 prev->policy_link = &req->l_sl_policy;
1030 * Add a lock into resource granted list after a position described by
1033 static void ldlm_granted_list_add_lock(struct ldlm_lock *lock,
1034 struct sl_insert_point *prev)
1036 struct ldlm_resource *res = lock->l_resource;
1039 check_res_locked(res);
1041 ldlm_resource_dump(D_INFO, res);
1042 LDLM_DEBUG(lock, "About to add lock:");
1044 if (ldlm_is_destroyed(lock)) {
1045 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
1049 LASSERT(list_empty(&lock->l_res_link));
1050 LASSERT(list_empty(&lock->l_sl_mode));
1051 LASSERT(list_empty(&lock->l_sl_policy));
1054 * lock->link == prev->link means lock is first starting the group.
1055 * Don't re-add to itself to suppress kernel warnings.
1057 if (&lock->l_res_link != prev->res_link)
1058 list_add(&lock->l_res_link, prev->res_link);
1059 if (&lock->l_sl_mode != prev->mode_link)
1060 list_add(&lock->l_sl_mode, prev->mode_link);
1061 if (&lock->l_sl_policy != prev->policy_link)
1062 list_add(&lock->l_sl_policy, prev->policy_link);
1068 * Add a lock to granted list on a resource maintaining skiplist
1071 static void ldlm_grant_lock_with_skiplist(struct ldlm_lock *lock)
1073 struct sl_insert_point prev;
1076 LASSERT(lock->l_req_mode == lock->l_granted_mode);
1078 search_granted_lock(&lock->l_resource->lr_granted, lock, &prev);
1079 ldlm_granted_list_add_lock(lock, &prev);
1084 * Perform lock granting bookkeeping.
1086 * Includes putting the lock into granted list and updating lock mode.
1088 * - ldlm_lock_enqueue
1089 * - ldlm_reprocess_queue
1090 * - ldlm_lock_convert
1092 * must be called with lr_lock held
1094 void ldlm_grant_lock(struct ldlm_lock *lock, struct list_head *work_list)
1096 struct ldlm_resource *res = lock->l_resource;
1099 check_res_locked(res);
1101 lock->l_granted_mode = lock->l_req_mode;
1103 if (work_list && lock->l_completion_ast != NULL)
1104 ldlm_add_ast_work_item(lock, NULL, work_list);
1106 /* We should not add locks to granted list in the following cases:
1107 * - this is an UNLOCK but not a real lock;
1108 * - this is a TEST lock;
1109 * - this is a F_CANCELLK lock (async flock has req_mode == 0)
1110 * - this is a deadlock (flock cannot be granted) */
1111 if (lock->l_req_mode == 0 ||
1112 lock->l_req_mode == LCK_NL ||
1113 ldlm_is_test_lock(lock) ||
1114 ldlm_is_flock_deadlock(lock))
1117 if (res->lr_type == LDLM_PLAIN || res->lr_type == LDLM_IBITS)
1118 ldlm_grant_lock_with_skiplist(lock);
1119 else if (res->lr_type == LDLM_EXTENT)
1120 ldlm_extent_add_lock(res, lock);
1122 ldlm_resource_add_lock(res, &res->lr_granted, lock);
1124 if (lock->l_granted_mode < res->lr_most_restr)
1125 res->lr_most_restr = lock->l_granted_mode;
1127 ldlm_pool_add(&ldlm_res_to_ns(res)->ns_pool, lock);
1132 * Search for a lock with given properties in a queue.
1134 * \retval a referenced lock or NULL. See the flag descriptions below, in the
1135 * comment above ldlm_lock_match
1137 static struct ldlm_lock *search_queue(struct list_head *queue,
1139 ldlm_policy_data_t *policy,
1140 struct ldlm_lock *old_lock,
1141 __u64 flags, int unref)
1143 struct ldlm_lock *lock;
1144 struct list_head *tmp;
1146 list_for_each(tmp, queue) {
1149 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
1151 if (lock == old_lock)
1154 /* Check if this lock can be matched.
1155 * Used by LU-2919(exclusive open) for open lease lock */
1156 if (ldlm_is_excl(lock))
1159 /* llite sometimes wants to match locks that will be
1160 * canceled when their users drop, but we allow it to match
1161 * if it passes in CBPENDING and the lock still has users.
1162 * this is generally only going to be used by children
1163 * whose parents already hold a lock so forward progress
1164 * can still happen. */
1165 if (ldlm_is_cbpending(lock) &&
1166 !(flags & LDLM_FL_CBPENDING))
1168 if (!unref && ldlm_is_cbpending(lock) &&
1169 lock->l_readers == 0 && lock->l_writers == 0)
1172 if (!(lock->l_req_mode & *mode))
1174 match = lock->l_req_mode;
1176 if (lock->l_resource->lr_type == LDLM_EXTENT &&
1177 (lock->l_policy_data.l_extent.start >
1178 policy->l_extent.start ||
1179 lock->l_policy_data.l_extent.end < policy->l_extent.end))
1182 if (unlikely(match == LCK_GROUP) &&
1183 lock->l_resource->lr_type == LDLM_EXTENT &&
1184 policy->l_extent.gid != LDLM_GID_ANY &&
1185 lock->l_policy_data.l_extent.gid != policy->l_extent.gid)
1188 /* We match if we have existing lock with same or wider set
1190 if (lock->l_resource->lr_type == LDLM_IBITS &&
1191 ((lock->l_policy_data.l_inodebits.bits &
1192 policy->l_inodebits.bits) !=
1193 policy->l_inodebits.bits))
1196 if (!unref && LDLM_HAVE_MASK(lock, GONE))
1199 if ((flags & LDLM_FL_LOCAL_ONLY) &&
1200 !ldlm_is_local(lock))
1203 if (flags & LDLM_FL_TEST_LOCK) {
1204 LDLM_LOCK_GET(lock);
1205 ldlm_lock_touch_in_lru(lock);
1207 ldlm_lock_addref_internal_nolock(lock, match);
1216 void ldlm_lock_fail_match_locked(struct ldlm_lock *lock)
1218 if ((lock->l_flags & LDLM_FL_FAIL_NOTIFIED) == 0) {
1219 lock->l_flags |= LDLM_FL_FAIL_NOTIFIED;
1220 wake_up_all(&lock->l_waitq);
1223 EXPORT_SYMBOL(ldlm_lock_fail_match_locked);
1225 void ldlm_lock_fail_match(struct ldlm_lock *lock)
1227 lock_res_and_lock(lock);
1228 ldlm_lock_fail_match_locked(lock);
1229 unlock_res_and_lock(lock);
1233 * Mark lock as "matchable" by OST.
1235 * Used to prevent certain races in LOV/OSC where the lock is granted, but LVB
1237 * Assumes LDLM lock is already locked.
1239 void ldlm_lock_allow_match_locked(struct ldlm_lock *lock)
1241 ldlm_set_lvb_ready(lock);
1242 wake_up_all(&lock->l_waitq);
1244 EXPORT_SYMBOL(ldlm_lock_allow_match_locked);
1247 * Mark lock as "matchable" by OST.
1248 * Locks the lock and then \see ldlm_lock_allow_match_locked
1250 void ldlm_lock_allow_match(struct ldlm_lock *lock)
1252 lock_res_and_lock(lock);
1253 ldlm_lock_allow_match_locked(lock);
1254 unlock_res_and_lock(lock);
1256 EXPORT_SYMBOL(ldlm_lock_allow_match);
1259 * Attempt to find a lock with specified properties.
1261 * Typically returns a reference to matched lock unless LDLM_FL_TEST_LOCK is
1264 * Can be called in two ways:
1266 * If 'ns' is NULL, then lockh describes an existing lock that we want to look
1267 * for a duplicate of.
1269 * Otherwise, all of the fields must be filled in, to match against.
1271 * If 'flags' contains LDLM_FL_LOCAL_ONLY, then only match local locks on the
1272 * server (ie, connh is NULL)
1273 * If 'flags' contains LDLM_FL_BLOCK_GRANTED, then only locks on the granted
1274 * list will be considered
1275 * If 'flags' contains LDLM_FL_CBPENDING, then locks that have been marked
1276 * to be canceled can still be matched as long as they still have reader
1277 * or writer refernces
1278 * If 'flags' contains LDLM_FL_TEST_LOCK, then don't actually reference a lock,
1279 * just tell us if we would have matched.
1281 * \retval 1 if it finds an already-existing lock that is compatible; in this
1282 * case, lockh is filled in with a addref()ed lock
1284 * We also check security context, and if that fails we simply return 0 (to
1285 * keep caller code unchanged), the context failure will be discovered by
1286 * caller sometime later.
1288 ldlm_mode_t ldlm_lock_match(struct ldlm_namespace *ns, __u64 flags,
1289 const struct ldlm_res_id *res_id, ldlm_type_t type,
1290 ldlm_policy_data_t *policy, ldlm_mode_t mode,
1291 struct lustre_handle *lockh, int unref)
1293 struct ldlm_resource *res;
1294 struct ldlm_lock *lock, *old_lock = NULL;
1299 old_lock = ldlm_handle2lock(lockh);
1302 ns = ldlm_lock_to_ns(old_lock);
1303 res_id = &old_lock->l_resource->lr_name;
1304 type = old_lock->l_resource->lr_type;
1305 mode = old_lock->l_req_mode;
1308 res = ldlm_resource_get(ns, NULL, res_id, type, 0);
1310 LASSERT(old_lock == NULL);
1314 LDLM_RESOURCE_ADDREF(res);
1317 lock = search_queue(&res->lr_granted, &mode, policy, old_lock,
1321 if (flags & LDLM_FL_BLOCK_GRANTED)
1323 lock = search_queue(&res->lr_converting, &mode, policy, old_lock,
1327 lock = search_queue(&res->lr_waiting, &mode, policy, old_lock,
1335 LDLM_RESOURCE_DELREF(res);
1336 ldlm_resource_putref(res);
1339 ldlm_lock2handle(lock, lockh);
1340 if ((flags & LDLM_FL_LVB_READY) &&
1341 (!ldlm_is_lvb_ready(lock))) {
1342 __u64 wait_flags = LDLM_FL_LVB_READY |
1343 LDLM_FL_DESTROYED | LDLM_FL_FAIL_NOTIFIED;
1344 struct l_wait_info lwi;
1345 if (lock->l_completion_ast) {
1346 int err = lock->l_completion_ast(lock,
1347 LDLM_FL_WAIT_NOREPROC,
1350 if (flags & LDLM_FL_TEST_LOCK)
1351 LDLM_LOCK_RELEASE(lock);
1353 ldlm_lock_decref_internal(lock,
1360 lwi = LWI_TIMEOUT_INTR(cfs_time_seconds(obd_timeout),
1361 NULL, LWI_ON_SIGNAL_NOOP, NULL);
1363 /* XXX FIXME see comment on CAN_MATCH in lustre_dlm.h */
1364 l_wait_event(lock->l_waitq,
1365 lock->l_flags & wait_flags,
1367 if (!ldlm_is_lvb_ready(lock)) {
1368 if (flags & LDLM_FL_TEST_LOCK)
1369 LDLM_LOCK_RELEASE(lock);
1371 ldlm_lock_decref_internal(lock, mode);
1378 LDLM_DEBUG(lock, "matched ("LPU64" "LPU64")",
1379 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1380 res_id->name[2] : policy->l_extent.start,
1381 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1382 res_id->name[3] : policy->l_extent.end);
1384 /* check user's security context */
1385 if (lock->l_conn_export &&
1386 sptlrpc_import_check_ctx(
1387 class_exp2cliimp(lock->l_conn_export))) {
1388 if (!(flags & LDLM_FL_TEST_LOCK))
1389 ldlm_lock_decref_internal(lock, mode);
1393 if (flags & LDLM_FL_TEST_LOCK)
1394 LDLM_LOCK_RELEASE(lock);
1396 } else if (!(flags & LDLM_FL_TEST_LOCK)) {/*less verbose for test-only*/
1397 LDLM_DEBUG_NOLOCK("not matched ns %p type %u mode %u res "
1398 LPU64"/"LPU64" ("LPU64" "LPU64")", ns,
1399 type, mode, res_id->name[0], res_id->name[1],
1400 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1401 res_id->name[2] :policy->l_extent.start,
1402 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1403 res_id->name[3] : policy->l_extent.end);
1406 LDLM_LOCK_PUT(old_lock);
1408 return rc ? mode : 0;
1410 EXPORT_SYMBOL(ldlm_lock_match);
1412 ldlm_mode_t ldlm_revalidate_lock_handle(struct lustre_handle *lockh,
1415 struct ldlm_lock *lock;
1416 ldlm_mode_t mode = 0;
1419 lock = ldlm_handle2lock(lockh);
1421 lock_res_and_lock(lock);
1422 if (LDLM_HAVE_MASK(lock, GONE))
1425 if (ldlm_is_cbpending(lock) &&
1426 lock->l_readers == 0 && lock->l_writers == 0)
1430 *bits = lock->l_policy_data.l_inodebits.bits;
1431 mode = lock->l_granted_mode;
1432 ldlm_lock_addref_internal_nolock(lock, mode);
1439 unlock_res_and_lock(lock);
1440 LDLM_LOCK_PUT(lock);
1444 EXPORT_SYMBOL(ldlm_revalidate_lock_handle);
1446 /** The caller must guarantee that the buffer is large enough. */
1447 int ldlm_fill_lvb(struct ldlm_lock *lock, struct req_capsule *pill,
1448 enum req_location loc, void *data, int size)
1453 LASSERT(data != NULL);
1456 switch (lock->l_lvb_type) {
1458 if (size == sizeof(struct ost_lvb)) {
1459 if (loc == RCL_CLIENT)
1460 lvb = req_capsule_client_swab_get(pill,
1462 lustre_swab_ost_lvb);
1464 lvb = req_capsule_server_swab_get(pill,
1466 lustre_swab_ost_lvb);
1467 if (unlikely(lvb == NULL)) {
1468 LDLM_ERROR(lock, "no LVB");
1472 memcpy(data, lvb, size);
1473 } else if (size == sizeof(struct ost_lvb_v1)) {
1474 struct ost_lvb *olvb = data;
1476 if (loc == RCL_CLIENT)
1477 lvb = req_capsule_client_swab_get(pill,
1479 lustre_swab_ost_lvb_v1);
1481 lvb = req_capsule_server_sized_swab_get(pill,
1483 lustre_swab_ost_lvb_v1);
1484 if (unlikely(lvb == NULL)) {
1485 LDLM_ERROR(lock, "no LVB");
1489 memcpy(data, lvb, size);
1490 olvb->lvb_mtime_ns = 0;
1491 olvb->lvb_atime_ns = 0;
1492 olvb->lvb_ctime_ns = 0;
1494 LDLM_ERROR(lock, "Replied unexpected ost LVB size %d",
1500 if (size == sizeof(struct lquota_lvb)) {
1501 if (loc == RCL_CLIENT)
1502 lvb = req_capsule_client_swab_get(pill,
1504 lustre_swab_lquota_lvb);
1506 lvb = req_capsule_server_swab_get(pill,
1508 lustre_swab_lquota_lvb);
1509 if (unlikely(lvb == NULL)) {
1510 LDLM_ERROR(lock, "no LVB");
1514 memcpy(data, lvb, size);
1516 LDLM_ERROR(lock, "Replied unexpected lquota LVB size %d",
1525 if (loc == RCL_CLIENT)
1526 lvb = req_capsule_client_get(pill, &RMF_DLM_LVB);
1528 lvb = req_capsule_server_get(pill, &RMF_DLM_LVB);
1529 if (unlikely(lvb == NULL)) {
1530 LDLM_ERROR(lock, "no LVB");
1534 memcpy(data, lvb, size);
1537 LDLM_ERROR(lock, "Unknown LVB type: %d\n", lock->l_lvb_type);
1538 libcfs_debug_dumpstack(NULL);
1546 * Create and fill in new LDLM lock with specified properties.
1547 * Returns a referenced lock
1549 struct ldlm_lock *ldlm_lock_create(struct ldlm_namespace *ns,
1550 const struct ldlm_res_id *res_id,
1553 const struct ldlm_callback_suite *cbs,
1554 void *data, __u32 lvb_len,
1555 enum lvb_type lvb_type)
1557 struct ldlm_lock *lock;
1558 struct ldlm_resource *res;
1562 res = ldlm_resource_get(ns, NULL, res_id, type, 1);
1564 RETURN(ERR_CAST(res));
1566 lock = ldlm_lock_new(res);
1568 RETURN(ERR_PTR(-ENOMEM));
1570 lock->l_req_mode = mode;
1571 lock->l_ast_data = data;
1572 lock->l_pid = current_pid();
1573 if (ns_is_server(ns))
1574 ldlm_set_ns_srv(lock);
1576 lock->l_blocking_ast = cbs->lcs_blocking;
1577 lock->l_completion_ast = cbs->lcs_completion;
1578 lock->l_glimpse_ast = cbs->lcs_glimpse;
1581 lock->l_tree_node = NULL;
1582 /* if this is the extent lock, allocate the interval tree node */
1583 if (type == LDLM_EXTENT)
1584 if (ldlm_interval_alloc(lock) == NULL)
1585 GOTO(out, rc = -ENOMEM);
1588 lock->l_lvb_len = lvb_len;
1589 OBD_ALLOC_LARGE(lock->l_lvb_data, lvb_len);
1590 if (lock->l_lvb_data == NULL)
1591 GOTO(out, rc = -ENOMEM);
1594 lock->l_lvb_type = lvb_type;
1595 if (OBD_FAIL_CHECK(OBD_FAIL_LDLM_NEW_LOCK))
1596 GOTO(out, rc = -ENOENT);
1601 ldlm_lock_destroy(lock);
1602 LDLM_LOCK_RELEASE(lock);
1603 RETURN(ERR_PTR(rc));
1607 * Enqueue (request) a lock.
1609 * Does not block. As a result of enqueue the lock would be put
1610 * into granted or waiting list.
1612 * If namespace has intent policy sent and the lock has LDLM_FL_HAS_INTENT flag
1613 * set, skip all the enqueueing and delegate lock processing to intent policy
1616 ldlm_error_t ldlm_lock_enqueue(struct ldlm_namespace *ns,
1617 struct ldlm_lock **lockp,
1618 void *cookie, __u64 *flags)
1620 struct ldlm_lock *lock = *lockp;
1621 struct ldlm_resource *res = lock->l_resource;
1622 int local = ns_is_client(ldlm_res_to_ns(res));
1623 #ifdef HAVE_SERVER_SUPPORT
1624 ldlm_processing_policy policy;
1626 ldlm_error_t rc = ELDLM_OK;
1627 struct ldlm_interval *node = NULL;
1630 /* policies are not executed on the client or during replay */
1631 if ((*flags & (LDLM_FL_HAS_INTENT|LDLM_FL_REPLAY)) == LDLM_FL_HAS_INTENT
1632 && !local && ns->ns_policy) {
1633 rc = ns->ns_policy(ns, lockp, cookie, lock->l_req_mode, *flags,
1635 if (rc == ELDLM_LOCK_REPLACED) {
1636 /* The lock that was returned has already been granted,
1637 * and placed into lockp. If it's not the same as the
1638 * one we passed in, then destroy the old one and our
1639 * work here is done. */
1640 if (lock != *lockp) {
1641 ldlm_lock_destroy(lock);
1642 LDLM_LOCK_RELEASE(lock);
1644 *flags |= LDLM_FL_LOCK_CHANGED;
1646 } else if (rc != ELDLM_OK ||
1647 (rc == ELDLM_OK && (*flags & LDLM_FL_INTENT_ONLY))) {
1648 ldlm_lock_destroy(lock);
1653 if (*flags & LDLM_FL_RESENT) {
1654 /* Reconstruct LDLM_FL_SRV_ENQ_MASK @flags for reply.
1655 * Set LOCK_CHANGED always.
1656 * Check if the lock is granted for BLOCK_GRANTED.
1657 * Take NO_TIMEOUT from the lock as it is inherited through
1658 * LDLM_FL_INHERIT_MASK */
1659 *flags |= LDLM_FL_LOCK_CHANGED;
1660 if (lock->l_req_mode != lock->l_granted_mode)
1661 *flags |= LDLM_FL_BLOCK_GRANTED;
1662 *flags |= lock->l_flags & LDLM_FL_NO_TIMEOUT;
1666 /* For a replaying lock, it might be already in granted list. So
1667 * unlinking the lock will cause the interval node to be freed, we
1668 * have to allocate the interval node early otherwise we can't regrant
1669 * this lock in the future. - jay */
1670 if (!local && (*flags & LDLM_FL_REPLAY) && res->lr_type == LDLM_EXTENT)
1671 OBD_SLAB_ALLOC_PTR_GFP(node, ldlm_interval_slab, GFP_NOFS);
1673 lock_res_and_lock(lock);
1674 if (local && lock->l_req_mode == lock->l_granted_mode) {
1675 /* The server returned a blocked lock, but it was granted
1676 * before we got a chance to actually enqueue it. We don't
1677 * need to do anything else. */
1678 *flags &= ~LDLM_FL_BLOCKED_MASK;
1679 GOTO(out, rc = ELDLM_OK);
1682 ldlm_resource_unlink_lock(lock);
1683 if (res->lr_type == LDLM_EXTENT && lock->l_tree_node == NULL) {
1685 ldlm_lock_destroy_nolock(lock);
1686 GOTO(out, rc = -ENOMEM);
1689 INIT_LIST_HEAD(&node->li_group);
1690 ldlm_interval_attach(node, lock);
1694 /* Some flags from the enqueue want to make it into the AST, via the
1695 * lock's l_flags. */
1696 if (*flags & LDLM_FL_AST_DISCARD_DATA)
1697 ldlm_set_ast_discard_data(lock);
1698 if (*flags & LDLM_FL_TEST_LOCK)
1699 ldlm_set_test_lock(lock);
1701 /* This distinction between local lock trees is very important; a client
1702 * namespace only has information about locks taken by that client, and
1703 * thus doesn't have enough information to decide for itself if it can
1704 * be granted (below). In this case, we do exactly what the server
1705 * tells us to do, as dictated by the 'flags'.
1707 * We do exactly the same thing during recovery, when the server is
1708 * more or less trusting the clients not to lie.
1710 * FIXME (bug 268): Detect obvious lies by checking compatibility in
1711 * granted/converting queues. */
1713 if (*flags & LDLM_FL_BLOCK_CONV)
1714 ldlm_resource_add_lock(res, &res->lr_converting, lock);
1715 else if (*flags & (LDLM_FL_BLOCK_WAIT | LDLM_FL_BLOCK_GRANTED))
1716 ldlm_resource_add_lock(res, &res->lr_waiting, lock);
1718 ldlm_grant_lock(lock, NULL);
1719 GOTO(out, rc = ELDLM_OK);
1720 #ifdef HAVE_SERVER_SUPPORT
1721 } else if (*flags & LDLM_FL_REPLAY) {
1722 if (*flags & LDLM_FL_BLOCK_CONV) {
1723 ldlm_resource_add_lock(res, &res->lr_converting, lock);
1724 GOTO(out, rc = ELDLM_OK);
1725 } else if (*flags & LDLM_FL_BLOCK_WAIT) {
1726 ldlm_resource_add_lock(res, &res->lr_waiting, lock);
1727 GOTO(out, rc = ELDLM_OK);
1728 } else if (*flags & LDLM_FL_BLOCK_GRANTED) {
1729 ldlm_grant_lock(lock, NULL);
1730 GOTO(out, rc = ELDLM_OK);
1732 /* If no flags, fall through to normal enqueue path. */
1735 policy = ldlm_processing_policy_table[res->lr_type];
1736 policy(lock, flags, 1, &rc, NULL);
1740 CERROR("This is client-side-only module, cannot handle "
1741 "LDLM_NAMESPACE_SERVER resource type lock.\n");
1747 unlock_res_and_lock(lock);
1749 OBD_SLAB_FREE(node, ldlm_interval_slab, sizeof(*node));
1753 #ifdef HAVE_SERVER_SUPPORT
1755 * Iterate through all waiting locks on a given resource queue and attempt to
1758 * Must be called with resource lock held.
1760 int ldlm_reprocess_queue(struct ldlm_resource *res, struct list_head *queue,
1761 struct list_head *work_list)
1763 struct list_head *tmp, *pos;
1764 ldlm_processing_policy policy;
1766 int rc = LDLM_ITER_CONTINUE;
1770 check_res_locked(res);
1772 policy = ldlm_processing_policy_table[res->lr_type];
1775 list_for_each_safe(tmp, pos, queue) {
1776 struct ldlm_lock *pending;
1777 pending = list_entry(tmp, struct ldlm_lock, l_res_link);
1779 CDEBUG(D_INFO, "Reprocessing lock %p\n", pending);
1782 rc = policy(pending, &flags, 0, &err, work_list);
1783 if (rc != LDLM_ITER_CONTINUE)
1792 * Process a call to blocking AST callback for a lock in ast_work list
1795 ldlm_work_bl_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1797 struct ldlm_cb_set_arg *arg = opaq;
1798 struct ldlm_lock_desc d;
1800 struct ldlm_lock *lock;
1803 if (list_empty(arg->list))
1806 lock = list_entry(arg->list->next, struct ldlm_lock, l_bl_ast);
1808 /* nobody should touch l_bl_ast */
1809 lock_res_and_lock(lock);
1810 list_del_init(&lock->l_bl_ast);
1812 LASSERT(ldlm_is_ast_sent(lock));
1813 LASSERT(lock->l_bl_ast_run == 0);
1814 LASSERT(lock->l_blocking_lock);
1815 lock->l_bl_ast_run++;
1816 unlock_res_and_lock(lock);
1818 ldlm_lock2desc(lock->l_blocking_lock, &d);
1820 rc = lock->l_blocking_ast(lock, &d, (void *)arg, LDLM_CB_BLOCKING);
1821 LDLM_LOCK_RELEASE(lock->l_blocking_lock);
1822 lock->l_blocking_lock = NULL;
1823 LDLM_LOCK_RELEASE(lock);
1829 * Process a call to completion AST callback for a lock in ast_work list
1832 ldlm_work_cp_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1834 struct ldlm_cb_set_arg *arg = opaq;
1836 struct ldlm_lock *lock;
1837 ldlm_completion_callback completion_callback;
1840 if (list_empty(arg->list))
1843 lock = list_entry(arg->list->next, struct ldlm_lock, l_cp_ast);
1845 /* It's possible to receive a completion AST before we've set
1846 * the l_completion_ast pointer: either because the AST arrived
1847 * before the reply, or simply because there's a small race
1848 * window between receiving the reply and finishing the local
1849 * enqueue. (bug 842)
1851 * This can't happen with the blocking_ast, however, because we
1852 * will never call the local blocking_ast until we drop our
1853 * reader/writer reference, which we won't do until we get the
1854 * reply and finish enqueueing. */
1856 /* nobody should touch l_cp_ast */
1857 lock_res_and_lock(lock);
1858 list_del_init(&lock->l_cp_ast);
1859 LASSERT(ldlm_is_cp_reqd(lock));
1860 /* save l_completion_ast since it can be changed by
1861 * mds_intent_policy(), see bug 14225 */
1862 completion_callback = lock->l_completion_ast;
1863 ldlm_clear_cp_reqd(lock);
1864 unlock_res_and_lock(lock);
1866 if (completion_callback != NULL)
1867 rc = completion_callback(lock, 0, (void *)arg);
1868 LDLM_LOCK_RELEASE(lock);
1874 * Process a call to revocation AST callback for a lock in ast_work list
1877 ldlm_work_revoke_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1879 struct ldlm_cb_set_arg *arg = opaq;
1880 struct ldlm_lock_desc desc;
1882 struct ldlm_lock *lock;
1885 if (list_empty(arg->list))
1888 lock = list_entry(arg->list->next, struct ldlm_lock, l_rk_ast);
1889 list_del_init(&lock->l_rk_ast);
1891 /* the desc just pretend to exclusive */
1892 ldlm_lock2desc(lock, &desc);
1893 desc.l_req_mode = LCK_EX;
1894 desc.l_granted_mode = 0;
1896 rc = lock->l_blocking_ast(lock, &desc, (void*)arg, LDLM_CB_BLOCKING);
1897 LDLM_LOCK_RELEASE(lock);
1903 * Process a call to glimpse AST callback for a lock in ast_work list
1905 int ldlm_work_gl_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1907 struct ldlm_cb_set_arg *arg = opaq;
1908 struct ldlm_glimpse_work *gl_work;
1909 struct ldlm_lock *lock;
1913 if (list_empty(arg->list))
1916 gl_work = list_entry(arg->list->next, struct ldlm_glimpse_work,
1918 list_del_init(&gl_work->gl_list);
1920 lock = gl_work->gl_lock;
1922 /* transfer the glimpse descriptor to ldlm_cb_set_arg */
1923 arg->gl_desc = gl_work->gl_desc;
1925 /* invoke the actual glimpse callback */
1926 if (lock->l_glimpse_ast(lock, (void*)arg) == 0)
1929 LDLM_LOCK_RELEASE(lock);
1931 if ((gl_work->gl_flags & LDLM_GL_WORK_NOFREE) == 0)
1932 OBD_FREE_PTR(gl_work);
1938 * Process list of locks in need of ASTs being sent.
1940 * Used on server to send multiple ASTs together instead of sending one by
1943 int ldlm_run_ast_work(struct ldlm_namespace *ns, struct list_head *rpc_list,
1944 ldlm_desc_ast_t ast_type)
1946 struct ldlm_cb_set_arg *arg;
1947 set_producer_func work_ast_lock;
1950 if (list_empty(rpc_list))
1957 atomic_set(&arg->restart, 0);
1958 arg->list = rpc_list;
1961 case LDLM_WORK_BL_AST:
1962 arg->type = LDLM_BL_CALLBACK;
1963 work_ast_lock = ldlm_work_bl_ast_lock;
1965 case LDLM_WORK_CP_AST:
1966 arg->type = LDLM_CP_CALLBACK;
1967 work_ast_lock = ldlm_work_cp_ast_lock;
1969 case LDLM_WORK_REVOKE_AST:
1970 arg->type = LDLM_BL_CALLBACK;
1971 work_ast_lock = ldlm_work_revoke_ast_lock;
1973 case LDLM_WORK_GL_AST:
1974 arg->type = LDLM_GL_CALLBACK;
1975 work_ast_lock = ldlm_work_gl_ast_lock;
1981 /* We create a ptlrpc request set with flow control extension.
1982 * This request set will use the work_ast_lock function to produce new
1983 * requests and will send a new request each time one completes in order
1984 * to keep the number of requests in flight to ns_max_parallel_ast */
1985 arg->set = ptlrpc_prep_fcset(ns->ns_max_parallel_ast ? : UINT_MAX,
1986 work_ast_lock, arg);
1987 if (arg->set == NULL)
1988 GOTO(out, rc = -ENOMEM);
1990 ptlrpc_set_wait(arg->set);
1991 ptlrpc_set_destroy(arg->set);
1993 rc = atomic_read(&arg->restart) ? -ERESTART : 0;
2000 static int reprocess_one_queue(struct ldlm_resource *res, void *closure)
2002 ldlm_reprocess_all(res);
2003 return LDLM_ITER_CONTINUE;
2006 static int ldlm_reprocess_res(cfs_hash_t *hs, cfs_hash_bd_t *bd,
2007 struct hlist_node *hnode, void *arg)
2009 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
2012 rc = reprocess_one_queue(res, arg);
2014 return rc == LDLM_ITER_STOP;
2018 * Iterate through all resources on a namespace attempting to grant waiting
2021 void ldlm_reprocess_all_ns(struct ldlm_namespace *ns)
2026 cfs_hash_for_each_nolock(ns->ns_rs_hash,
2027 ldlm_reprocess_res, NULL);
2033 * Try to grant all waiting locks on a resource.
2035 * Calls ldlm_reprocess_queue on converting and waiting queues.
2037 * Typically called after some resource locks are cancelled to see
2038 * if anything could be granted as a result of the cancellation.
2040 void ldlm_reprocess_all(struct ldlm_resource *res)
2042 struct list_head rpc_list;
2043 #ifdef HAVE_SERVER_SUPPORT
2047 INIT_LIST_HEAD(&rpc_list);
2048 /* Local lock trees don't get reprocessed. */
2049 if (ns_is_client(ldlm_res_to_ns(res))) {
2056 rc = ldlm_reprocess_queue(res, &res->lr_converting, &rpc_list);
2057 if (rc == LDLM_ITER_CONTINUE)
2058 ldlm_reprocess_queue(res, &res->lr_waiting, &rpc_list);
2061 rc = ldlm_run_ast_work(ldlm_res_to_ns(res), &rpc_list,
2063 if (rc == -ERESTART) {
2064 LASSERT(list_empty(&rpc_list));
2070 INIT_LIST_HEAD(&rpc_list);
2071 if (!ns_is_client(ldlm_res_to_ns(res))) {
2072 CERROR("This is client-side-only module, cannot handle "
2073 "LDLM_NAMESPACE_SERVER resource type lock.\n");
2079 EXPORT_SYMBOL(ldlm_reprocess_all);
2082 * Helper function to call blocking AST for LDLM lock \a lock in a
2083 * "cancelling" mode.
2085 void ldlm_cancel_callback(struct ldlm_lock *lock)
2087 check_res_locked(lock->l_resource);
2088 if (!ldlm_is_cancel(lock)) {
2089 ldlm_set_cancel(lock);
2090 if (lock->l_blocking_ast) {
2091 unlock_res_and_lock(lock);
2092 lock->l_blocking_ast(lock, NULL, lock->l_ast_data,
2094 lock_res_and_lock(lock);
2096 LDLM_DEBUG(lock, "no blocking ast");
2099 ldlm_set_bl_done(lock);
2103 * Remove skiplist-enabled LDLM lock \a req from granted list
2105 void ldlm_unlink_lock_skiplist(struct ldlm_lock *req)
2107 if (req->l_resource->lr_type != LDLM_PLAIN &&
2108 req->l_resource->lr_type != LDLM_IBITS)
2111 list_del_init(&req->l_sl_policy);
2112 list_del_init(&req->l_sl_mode);
2116 * Attempts to cancel LDLM lock \a lock that has no reader/writer references.
2118 void ldlm_lock_cancel(struct ldlm_lock *lock)
2120 struct ldlm_resource *res;
2121 struct ldlm_namespace *ns;
2124 lock_res_and_lock(lock);
2126 res = lock->l_resource;
2127 ns = ldlm_res_to_ns(res);
2129 /* Please do not, no matter how tempting, remove this LBUG without
2130 * talking to me first. -phik */
2131 if (lock->l_readers || lock->l_writers) {
2132 LDLM_ERROR(lock, "lock still has references");
2136 if (ldlm_is_waited(lock))
2137 ldlm_del_waiting_lock(lock);
2139 /* Releases cancel callback. */
2140 ldlm_cancel_callback(lock);
2142 LASSERT(!ldlm_is_waited(lock));
2144 ldlm_resource_unlink_lock(lock);
2145 ldlm_lock_destroy_nolock(lock);
2147 if (lock->l_granted_mode == lock->l_req_mode)
2148 ldlm_pool_del(&ns->ns_pool, lock);
2150 /* Make sure we will not be called again for same lock what is possible
2151 * if not to zero out lock->l_granted_mode */
2152 lock->l_granted_mode = LCK_MINMODE;
2153 unlock_res_and_lock(lock);
2157 EXPORT_SYMBOL(ldlm_lock_cancel);
2160 * Set opaque data into the lock that only makes sense to upper layer.
2162 int ldlm_lock_set_data(struct lustre_handle *lockh, void *data)
2164 struct ldlm_lock *lock = ldlm_handle2lock(lockh);
2169 if (lock->l_ast_data == NULL)
2170 lock->l_ast_data = data;
2171 if (lock->l_ast_data == data)
2173 LDLM_LOCK_PUT(lock);
2177 EXPORT_SYMBOL(ldlm_lock_set_data);
2179 struct export_cl_data {
2180 struct obd_export *ecl_exp;
2185 * Iterator function for ldlm_cancel_locks_for_export.
2186 * Cancels passed locks.
2188 static int ldlm_cancel_locks_for_export_cb(cfs_hash_t *hs, cfs_hash_bd_t *bd,
2189 struct hlist_node *hnode, void *data)
2192 struct export_cl_data *ecl = (struct export_cl_data *)data;
2193 struct obd_export *exp = ecl->ecl_exp;
2194 struct ldlm_lock *lock = cfs_hash_object(hs, hnode);
2195 struct ldlm_resource *res;
2197 res = ldlm_resource_getref(lock->l_resource);
2198 LDLM_LOCK_GET(lock);
2200 LDLM_DEBUG(lock, "export %p", exp);
2201 ldlm_res_lvbo_update(res, NULL, 1);
2202 ldlm_lock_cancel(lock);
2203 ldlm_reprocess_all(res);
2204 ldlm_resource_putref(res);
2205 LDLM_LOCK_RELEASE(lock);
2208 if ((ecl->ecl_loop & -ecl->ecl_loop) == ecl->ecl_loop) {
2210 "Cancel lock %p for export %p (loop %d), still have "
2211 "%d locks left on hash table.\n",
2212 lock, exp, ecl->ecl_loop,
2213 atomic_read(&hs->hs_count));
2220 * Cancel all locks for given export.
2222 * Typically called on client disconnection/eviction
2224 void ldlm_cancel_locks_for_export(struct obd_export *exp)
2226 struct export_cl_data ecl = {
2231 cfs_hash_for_each_empty(exp->exp_lock_hash,
2232 ldlm_cancel_locks_for_export_cb, &ecl);
2236 * Downgrade an exclusive lock.
2238 * A fast variant of ldlm_lock_convert for convertion of exclusive
2239 * locks. The convertion is always successful.
2240 * Used by Commit on Sharing (COS) code.
2242 * \param lock A lock to convert
2243 * \param new_mode new lock mode
2245 void ldlm_lock_downgrade(struct ldlm_lock *lock, int new_mode)
2249 LASSERT(lock->l_granted_mode & (LCK_PW | LCK_EX));
2250 LASSERT(new_mode == LCK_COS);
2252 lock_res_and_lock(lock);
2253 ldlm_resource_unlink_lock(lock);
2255 * Remove the lock from pool as it will be added again in
2256 * ldlm_grant_lock() called below.
2258 ldlm_pool_del(&ldlm_lock_to_ns(lock)->ns_pool, lock);
2260 lock->l_req_mode = new_mode;
2261 ldlm_grant_lock(lock, NULL);
2262 unlock_res_and_lock(lock);
2263 ldlm_reprocess_all(lock->l_resource);
2267 EXPORT_SYMBOL(ldlm_lock_downgrade);
2270 * Attempt to convert already granted lock to a different mode.
2272 * While lock conversion is not currently used, future client-side
2273 * optimizations could take advantage of it to avoid discarding cached
2276 struct ldlm_resource *ldlm_lock_convert(struct ldlm_lock *lock, int new_mode,
2279 struct list_head rpc_list;
2280 struct ldlm_resource *res;
2281 struct ldlm_namespace *ns;
2283 #ifdef HAVE_SERVER_SUPPORT
2285 struct sl_insert_point prev;
2287 struct ldlm_interval *node;
2290 INIT_LIST_HEAD(&rpc_list);
2291 /* Just return if mode is unchanged. */
2292 if (new_mode == lock->l_granted_mode) {
2293 *flags |= LDLM_FL_BLOCK_GRANTED;
2294 RETURN(lock->l_resource);
2297 /* I can't check the type of lock here because the bitlock of lock
2298 * is not held here, so do the allocation blindly. -jay */
2299 OBD_SLAB_ALLOC_PTR_GFP(node, ldlm_interval_slab, GFP_NOFS);
2300 if (node == NULL) /* Actually, this causes EDEADLOCK to be returned */
2303 LASSERTF((new_mode == LCK_PW && lock->l_granted_mode == LCK_PR),
2304 "new_mode %u, granted %u\n", new_mode, lock->l_granted_mode);
2306 lock_res_and_lock(lock);
2308 res = lock->l_resource;
2309 ns = ldlm_res_to_ns(res);
2311 #ifdef HAVE_SERVER_SUPPORT
2312 old_mode = lock->l_req_mode;
2314 lock->l_req_mode = new_mode;
2315 if (res->lr_type == LDLM_PLAIN || res->lr_type == LDLM_IBITS) {
2316 #ifdef HAVE_SERVER_SUPPORT
2317 /* remember the lock position where the lock might be
2318 * added back to the granted list later and also
2319 * remember the join mode for skiplist fixing. */
2320 prev.res_link = lock->l_res_link.prev;
2321 prev.mode_link = lock->l_sl_mode.prev;
2322 prev.policy_link = lock->l_sl_policy.prev;
2324 ldlm_resource_unlink_lock(lock);
2326 ldlm_resource_unlink_lock(lock);
2327 if (res->lr_type == LDLM_EXTENT) {
2328 /* FIXME: ugly code, I have to attach the lock to a
2329 * interval node again since perhaps it will be granted
2331 INIT_LIST_HEAD(&node->li_group);
2332 ldlm_interval_attach(node, lock);
2338 * Remove old lock from the pool before adding the lock with new
2339 * mode below in ->policy()
2341 ldlm_pool_del(&ns->ns_pool, lock);
2343 /* If this is a local resource, put it on the appropriate list. */
2344 if (ns_is_client(ldlm_res_to_ns(res))) {
2345 if (*flags & (LDLM_FL_BLOCK_CONV | LDLM_FL_BLOCK_GRANTED)) {
2346 ldlm_resource_add_lock(res, &res->lr_converting, lock);
2348 /* This should never happen, because of the way the
2349 * server handles conversions. */
2350 LDLM_ERROR(lock, "Erroneous flags %x on local lock\n",
2354 ldlm_grant_lock(lock, &rpc_list);
2356 /* FIXME: completion handling not with lr_lock held ! */
2357 if (lock->l_completion_ast)
2358 lock->l_completion_ast(lock, 0, NULL);
2360 #ifdef HAVE_SERVER_SUPPORT
2365 ldlm_processing_policy policy;
2366 policy = ldlm_processing_policy_table[res->lr_type];
2367 rc = policy(lock, &pflags, 0, &err, &rpc_list);
2368 if (rc == LDLM_ITER_STOP) {
2369 lock->l_req_mode = old_mode;
2370 if (res->lr_type == LDLM_EXTENT)
2371 ldlm_extent_add_lock(res, lock);
2373 ldlm_granted_list_add_lock(lock, &prev);
2377 *flags |= LDLM_FL_BLOCK_GRANTED;
2383 CERROR("This is client-side-only module, cannot handle "
2384 "LDLM_NAMESPACE_SERVER resource type lock.\n");
2388 unlock_res_and_lock(lock);
2391 ldlm_run_ast_work(ns, &rpc_list, LDLM_WORK_CP_AST);
2393 OBD_SLAB_FREE(node, ldlm_interval_slab, sizeof(*node));
2398 * Print lock with lock handle \a lockh description into debug log.
2400 * Used when printing all locks on a resource for debug purposes.
2402 void ldlm_lock_dump_handle(int level, struct lustre_handle *lockh)
2404 struct ldlm_lock *lock;
2406 if (!((libcfs_debug | D_ERROR) & level))
2409 lock = ldlm_handle2lock(lockh);
2413 LDLM_DEBUG_LIMIT(level, lock, "###");
2415 LDLM_LOCK_PUT(lock);
2417 EXPORT_SYMBOL(ldlm_lock_dump_handle);
2420 * Print lock information with custom message into debug log.
2423 void _ldlm_lock_debug(struct ldlm_lock *lock,
2424 struct libcfs_debug_msg_data *msgdata,
2425 const char *fmt, ...)
2428 struct obd_export *exp = lock->l_export;
2429 struct ldlm_resource *resource = lock->l_resource;
2430 char *nid = "local";
2432 va_start(args, fmt);
2434 if (exp && exp->exp_connection) {
2435 nid = libcfs_nid2str(exp->exp_connection->c_peer.nid);
2436 } else if (exp && exp->exp_obd != NULL) {
2437 struct obd_import *imp = exp->exp_obd->u.cli.cl_import;
2438 nid = libcfs_nid2str(imp->imp_connection->c_peer.nid);
2441 if (resource == NULL) {
2442 libcfs_debug_vmsg2(msgdata, fmt, args,
2443 " ns: \?\? lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
2444 "res: \?\? rrc=\?\? type: \?\?\? flags: "LPX64" nid: %s "
2445 "remote: "LPX64" expref: %d pid: %u timeout: %lu "
2448 lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
2449 lock->l_readers, lock->l_writers,
2450 ldlm_lockname[lock->l_granted_mode],
2451 ldlm_lockname[lock->l_req_mode],
2452 lock->l_flags, nid, lock->l_remote_handle.cookie,
2453 exp ? atomic_read(&exp->exp_refcount) : -99,
2454 lock->l_pid, lock->l_callback_timeout, lock->l_lvb_type);
2459 switch (resource->lr_type) {
2461 libcfs_debug_vmsg2(msgdata, fmt, args,
2462 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
2463 "res: "DLDLMRES" rrc: %d type: %s ["LPU64"->"LPU64"] "
2464 "(req "LPU64"->"LPU64") flags: "LPX64" nid: %s remote: "
2465 LPX64" expref: %d pid: %u timeout: %lu lvb_type: %d\n",
2466 ldlm_lock_to_ns_name(lock), lock,
2467 lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
2468 lock->l_readers, lock->l_writers,
2469 ldlm_lockname[lock->l_granted_mode],
2470 ldlm_lockname[lock->l_req_mode],
2472 atomic_read(&resource->lr_refcount),
2473 ldlm_typename[resource->lr_type],
2474 lock->l_policy_data.l_extent.start,
2475 lock->l_policy_data.l_extent.end,
2476 lock->l_req_extent.start, lock->l_req_extent.end,
2477 lock->l_flags, nid, lock->l_remote_handle.cookie,
2478 exp ? atomic_read(&exp->exp_refcount) : -99,
2479 lock->l_pid, lock->l_callback_timeout,
2484 libcfs_debug_vmsg2(msgdata, fmt, args,
2485 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
2486 "res: "DLDLMRES" rrc: %d type: %s pid: %d "
2487 "["LPU64"->"LPU64"] flags: "LPX64" nid: %s "
2488 "remote: "LPX64" expref: %d pid: %u timeout: %lu\n",
2489 ldlm_lock_to_ns_name(lock), lock,
2490 lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
2491 lock->l_readers, lock->l_writers,
2492 ldlm_lockname[lock->l_granted_mode],
2493 ldlm_lockname[lock->l_req_mode],
2495 atomic_read(&resource->lr_refcount),
2496 ldlm_typename[resource->lr_type],
2497 lock->l_policy_data.l_flock.pid,
2498 lock->l_policy_data.l_flock.start,
2499 lock->l_policy_data.l_flock.end,
2500 lock->l_flags, nid, lock->l_remote_handle.cookie,
2501 exp ? atomic_read(&exp->exp_refcount) : -99,
2502 lock->l_pid, lock->l_callback_timeout);
2506 libcfs_debug_vmsg2(msgdata, fmt, args,
2507 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
2508 "res: "DLDLMRES" bits "LPX64" rrc: %d type: %s "
2509 "flags: "LPX64" nid: %s remote: "LPX64" expref: %d "
2510 "pid: %u timeout: %lu lvb_type: %d\n",
2511 ldlm_lock_to_ns_name(lock),
2512 lock, lock->l_handle.h_cookie,
2513 atomic_read(&lock->l_refc),
2514 lock->l_readers, lock->l_writers,
2515 ldlm_lockname[lock->l_granted_mode],
2516 ldlm_lockname[lock->l_req_mode],
2518 lock->l_policy_data.l_inodebits.bits,
2519 atomic_read(&resource->lr_refcount),
2520 ldlm_typename[resource->lr_type],
2521 lock->l_flags, nid, lock->l_remote_handle.cookie,
2522 exp ? atomic_read(&exp->exp_refcount) : -99,
2523 lock->l_pid, lock->l_callback_timeout,
2528 libcfs_debug_vmsg2(msgdata, fmt, args,
2529 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
2530 "res: "DLDLMRES" rrc: %d type: %s flags: "LPX64" "
2531 "nid: %s remote: "LPX64" expref: %d pid: %u "
2532 "timeout: %lu lvb_type: %d\n",
2533 ldlm_lock_to_ns_name(lock),
2534 lock, lock->l_handle.h_cookie,
2535 atomic_read(&lock->l_refc),
2536 lock->l_readers, lock->l_writers,
2537 ldlm_lockname[lock->l_granted_mode],
2538 ldlm_lockname[lock->l_req_mode],
2540 atomic_read(&resource->lr_refcount),
2541 ldlm_typename[resource->lr_type],
2542 lock->l_flags, nid, lock->l_remote_handle.cookie,
2543 exp ? atomic_read(&exp->exp_refcount) : -99,
2544 lock->l_pid, lock->l_callback_timeout,
2550 EXPORT_SYMBOL(_ldlm_lock_debug);