4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
20 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
21 * CA 95054 USA or visit www.sun.com if you need additional information or
27 * Copyright (c) 2002, 2010, Oracle and/or its affiliates. All rights reserved.
28 * Use is subject to license terms.
30 * Copyright (c) 2010, 2013, Intel Corporation.
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
36 * lustre/ldlm/ldlm_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 <linux/lustre_intent.h>
46 #include <obd_class.h>
47 #include "ldlm_internal.h"
50 char *ldlm_lockname[] = {
58 [LCK_GROUP] = "GROUP",
61 EXPORT_SYMBOL(ldlm_lockname);
63 char *ldlm_typename[] = {
65 [LDLM_EXTENT] = "EXT",
69 EXPORT_SYMBOL(ldlm_typename);
71 static ldlm_policy_wire_to_local_t ldlm_policy_wire18_to_local[] = {
72 [LDLM_PLAIN - LDLM_MIN_TYPE] = ldlm_plain_policy_wire_to_local,
73 [LDLM_EXTENT - LDLM_MIN_TYPE] = ldlm_extent_policy_wire_to_local,
74 [LDLM_FLOCK - LDLM_MIN_TYPE] = ldlm_flock_policy_wire18_to_local,
75 [LDLM_IBITS - LDLM_MIN_TYPE] = ldlm_ibits_policy_wire_to_local,
78 static ldlm_policy_wire_to_local_t ldlm_policy_wire21_to_local[] = {
79 [LDLM_PLAIN - LDLM_MIN_TYPE] = ldlm_plain_policy_wire_to_local,
80 [LDLM_EXTENT - LDLM_MIN_TYPE] = ldlm_extent_policy_wire_to_local,
81 [LDLM_FLOCK - LDLM_MIN_TYPE] = ldlm_flock_policy_wire21_to_local,
82 [LDLM_IBITS - LDLM_MIN_TYPE] = ldlm_ibits_policy_wire_to_local,
85 static ldlm_policy_local_to_wire_t ldlm_policy_local_to_wire[] = {
86 [LDLM_PLAIN - LDLM_MIN_TYPE] = ldlm_plain_policy_local_to_wire,
87 [LDLM_EXTENT - LDLM_MIN_TYPE] = ldlm_extent_policy_local_to_wire,
88 [LDLM_FLOCK - LDLM_MIN_TYPE] = ldlm_flock_policy_local_to_wire,
89 [LDLM_IBITS - LDLM_MIN_TYPE] = ldlm_ibits_policy_local_to_wire,
93 * Converts lock policy from local format to on the wire lock_desc format
95 void ldlm_convert_policy_to_wire(ldlm_type_t type,
96 const ldlm_policy_data_t *lpolicy,
97 ldlm_wire_policy_data_t *wpolicy)
99 ldlm_policy_local_to_wire_t convert;
101 convert = ldlm_policy_local_to_wire[type - LDLM_MIN_TYPE];
103 convert(lpolicy, wpolicy);
107 * Converts lock policy from on the wire lock_desc format to local format
109 void ldlm_convert_policy_to_local(struct obd_export *exp, ldlm_type_t type,
110 const ldlm_wire_policy_data_t *wpolicy,
111 ldlm_policy_data_t *lpolicy)
113 ldlm_policy_wire_to_local_t convert;
116 /** some badness for 2.0.0 clients, but 2.0.0 isn't supported */
117 new_client = (exp_connect_flags(exp) & OBD_CONNECT_FULL20) != 0;
119 convert = ldlm_policy_wire21_to_local[type - LDLM_MIN_TYPE];
121 convert = ldlm_policy_wire18_to_local[type - LDLM_MIN_TYPE];
123 convert(wpolicy, lpolicy);
126 char *ldlm_it2str(int it)
133 case (IT_OPEN | IT_CREAT):
148 CERROR("Unknown intent %d\n", it);
152 EXPORT_SYMBOL(ldlm_it2str);
154 extern struct kmem_cache *ldlm_lock_slab;
156 #ifdef HAVE_SERVER_SUPPORT
157 static ldlm_processing_policy ldlm_processing_policy_table[] = {
158 [LDLM_PLAIN] = ldlm_process_plain_lock,
159 [LDLM_EXTENT] = ldlm_process_extent_lock,
160 [LDLM_FLOCK] = ldlm_process_flock_lock,
161 [LDLM_IBITS] = ldlm_process_inodebits_lock,
164 ldlm_processing_policy ldlm_get_processing_policy(struct ldlm_resource *res)
166 return ldlm_processing_policy_table[res->lr_type];
168 EXPORT_SYMBOL(ldlm_get_processing_policy);
169 #endif /* HAVE_SERVER_SUPPORT */
171 void ldlm_register_intent(struct ldlm_namespace *ns, ldlm_res_policy arg)
175 EXPORT_SYMBOL(ldlm_register_intent);
178 * REFCOUNTED LOCK OBJECTS
183 * Get a reference on a lock.
185 * Lock refcounts, during creation:
186 * - one special one for allocation, dec'd only once in destroy
187 * - one for being a lock that's in-use
188 * - one for the addref associated with a new lock
190 struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock)
192 atomic_inc(&lock->l_refc);
195 EXPORT_SYMBOL(ldlm_lock_get);
198 * Release lock reference.
200 * Also frees the lock if it was last reference.
202 void ldlm_lock_put(struct ldlm_lock *lock)
206 LASSERT(lock->l_resource != LP_POISON);
207 LASSERT(atomic_read(&lock->l_refc) > 0);
208 if (atomic_dec_and_test(&lock->l_refc)) {
209 struct ldlm_resource *res;
212 "final lock_put on destroyed lock, freeing it.");
214 res = lock->l_resource;
215 LASSERT(ldlm_is_destroyed(lock));
216 LASSERT(list_empty(&lock->l_res_link));
217 LASSERT(list_empty(&lock->l_pending_chain));
219 lprocfs_counter_decr(ldlm_res_to_ns(res)->ns_stats,
221 lu_ref_del(&res->lr_reference, "lock", lock);
222 ldlm_resource_putref(res);
223 lock->l_resource = NULL;
224 if (lock->l_export) {
225 class_export_lock_put(lock->l_export, lock);
226 lock->l_export = NULL;
229 if (lock->l_lvb_data != NULL)
230 OBD_FREE_LARGE(lock->l_lvb_data, lock->l_lvb_len);
232 ldlm_interval_free(ldlm_interval_detach(lock));
233 lu_ref_fini(&lock->l_reference);
234 OBD_FREE_RCU(lock, sizeof(*lock), &lock->l_handle);
239 EXPORT_SYMBOL(ldlm_lock_put);
242 * Removes LDLM lock \a lock from LRU. Assumes LRU is already locked.
244 int ldlm_lock_remove_from_lru_nolock(struct ldlm_lock *lock)
247 if (!list_empty(&lock->l_lru)) {
248 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
250 LASSERT(lock->l_resource->lr_type != LDLM_FLOCK);
251 list_del_init(&lock->l_lru);
252 LASSERT(ns->ns_nr_unused > 0);
260 * Removes LDLM lock \a lock from LRU. Obtains the LRU lock first.
262 int ldlm_lock_remove_from_lru(struct ldlm_lock *lock)
264 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
268 if (ldlm_is_ns_srv(lock)) {
269 LASSERT(list_empty(&lock->l_lru));
273 spin_lock(&ns->ns_lock);
274 rc = ldlm_lock_remove_from_lru_nolock(lock);
275 spin_unlock(&ns->ns_lock);
281 * Adds LDLM lock \a lock to namespace LRU. Assumes LRU is already locked.
283 void ldlm_lock_add_to_lru_nolock(struct ldlm_lock *lock)
285 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
287 lock->l_last_used = cfs_time_current();
288 LASSERT(list_empty(&lock->l_lru));
289 LASSERT(lock->l_resource->lr_type != LDLM_FLOCK);
290 list_add_tail(&lock->l_lru, &ns->ns_unused_list);
291 ldlm_clear_skipped(lock);
292 LASSERT(ns->ns_nr_unused >= 0);
297 * Adds LDLM lock \a lock to namespace LRU. Obtains necessary LRU locks
300 void ldlm_lock_add_to_lru(struct ldlm_lock *lock)
302 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
305 spin_lock(&ns->ns_lock);
306 ldlm_lock_add_to_lru_nolock(lock);
307 spin_unlock(&ns->ns_lock);
312 * Moves LDLM lock \a lock that is already in namespace LRU to the tail of
313 * the LRU. Performs necessary LRU locking
315 void ldlm_lock_touch_in_lru(struct ldlm_lock *lock)
317 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
320 if (ldlm_is_ns_srv(lock)) {
321 LASSERT(list_empty(&lock->l_lru));
326 spin_lock(&ns->ns_lock);
327 if (!list_empty(&lock->l_lru)) {
328 ldlm_lock_remove_from_lru_nolock(lock);
329 ldlm_lock_add_to_lru_nolock(lock);
331 spin_unlock(&ns->ns_lock);
336 * Helper to destroy a locked lock.
338 * Used by ldlm_lock_destroy and ldlm_lock_destroy_nolock
339 * Must be called with l_lock and lr_lock held.
341 * Does not actually free the lock data, but rather marks the lock as
342 * destroyed by setting l_destroyed field in the lock to 1. Destroys a
343 * handle->lock association too, so that the lock can no longer be found
344 * and removes the lock from LRU list. Actual lock freeing occurs when
345 * last lock reference goes away.
347 * Original comment (of some historical value):
348 * This used to have a 'strict' flag, which recovery would use to mark an
349 * in-use lock as needing-to-die. Lest I am ever tempted to put it back, I
350 * shall explain why it's gone: with the new hash table scheme, once you call
351 * ldlm_lock_destroy, you can never drop your final references on this lock.
352 * Because it's not in the hash table anymore. -phil
354 int ldlm_lock_destroy_internal(struct ldlm_lock *lock)
358 if (lock->l_readers || lock->l_writers) {
359 LDLM_ERROR(lock, "lock still has references");
363 if (!list_empty(&lock->l_res_link)) {
364 LDLM_ERROR(lock, "lock still on resource");
368 if (ldlm_is_destroyed(lock)) {
369 LASSERT(list_empty(&lock->l_lru));
373 ldlm_set_destroyed(lock);
375 if (lock->l_export && lock->l_export->exp_lock_hash) {
376 /* NB: it's safe to call cfs_hash_del() even lock isn't
377 * in exp_lock_hash. */
378 /* In the function below, .hs_keycmp resolves to
379 * ldlm_export_lock_keycmp() */
380 /* coverity[overrun-buffer-val] */
381 cfs_hash_del(lock->l_export->exp_lock_hash,
382 &lock->l_remote_handle, &lock->l_exp_hash);
385 ldlm_lock_remove_from_lru(lock);
386 class_handle_unhash(&lock->l_handle);
389 /* Wake anyone waiting for this lock */
390 /* FIXME: I should probably add yet another flag, instead of using
391 * l_export to only call this on clients */
393 class_export_put(lock->l_export);
394 lock->l_export = NULL;
395 if (lock->l_export && lock->l_completion_ast)
396 lock->l_completion_ast(lock, 0);
403 * Destroys a LDLM lock \a lock. Performs necessary locking first.
405 void ldlm_lock_destroy(struct ldlm_lock *lock)
409 lock_res_and_lock(lock);
410 first = ldlm_lock_destroy_internal(lock);
411 unlock_res_and_lock(lock);
413 /* drop reference from hashtable only for first destroy */
415 lu_ref_del(&lock->l_reference, "hash", lock);
416 LDLM_LOCK_RELEASE(lock);
422 * Destroys a LDLM lock \a lock that is already locked.
424 void ldlm_lock_destroy_nolock(struct ldlm_lock *lock)
428 first = ldlm_lock_destroy_internal(lock);
429 /* drop reference from hashtable only for first destroy */
431 lu_ref_del(&lock->l_reference, "hash", lock);
432 LDLM_LOCK_RELEASE(lock);
437 /* this is called by portals_handle2object with the handle lock taken */
438 static void lock_handle_addref(void *lock)
440 LDLM_LOCK_GET((struct ldlm_lock *)lock);
443 static void lock_handle_free(void *lock, int size)
445 LASSERT(size == sizeof(struct ldlm_lock));
446 OBD_SLAB_FREE(lock, ldlm_lock_slab, size);
449 struct portals_handle_ops lock_handle_ops = {
450 .hop_addref = lock_handle_addref,
451 .hop_free = lock_handle_free,
456 * Allocate and initialize new lock structure.
458 * usage: pass in a resource on which you have done ldlm_resource_get
459 * new lock will take over the refcount.
460 * returns: lock with refcount 2 - one for current caller and one for remote
462 static struct ldlm_lock *ldlm_lock_new(struct ldlm_resource *resource)
464 struct ldlm_lock *lock;
467 if (resource == NULL)
470 OBD_SLAB_ALLOC_PTR_GFP(lock, ldlm_lock_slab, GFP_NOFS);
474 spin_lock_init(&lock->l_lock);
475 lock->l_resource = resource;
476 lu_ref_add(&resource->lr_reference, "lock", lock);
478 atomic_set(&lock->l_refc, 2);
479 INIT_LIST_HEAD(&lock->l_res_link);
480 INIT_LIST_HEAD(&lock->l_lru);
481 INIT_LIST_HEAD(&lock->l_pending_chain);
482 INIT_LIST_HEAD(&lock->l_bl_ast);
483 INIT_LIST_HEAD(&lock->l_cp_ast);
484 INIT_LIST_HEAD(&lock->l_rk_ast);
485 init_waitqueue_head(&lock->l_waitq);
486 lock->l_blocking_lock = NULL;
487 INIT_LIST_HEAD(&lock->l_sl_mode);
488 INIT_LIST_HEAD(&lock->l_sl_policy);
489 INIT_HLIST_NODE(&lock->l_exp_hash);
490 INIT_HLIST_NODE(&lock->l_exp_flock_hash);
492 lprocfs_counter_incr(ldlm_res_to_ns(resource)->ns_stats,
494 INIT_LIST_HEAD(&lock->l_handle.h_link);
495 class_handle_hash(&lock->l_handle, &lock_handle_ops);
497 lu_ref_init(&lock->l_reference);
498 lu_ref_add(&lock->l_reference, "hash", lock);
499 lock->l_callback_timeout = 0;
501 #if LUSTRE_TRACKS_LOCK_EXP_REFS
502 INIT_LIST_HEAD(&lock->l_exp_refs_link);
503 lock->l_exp_refs_nr = 0;
504 lock->l_exp_refs_target = NULL;
506 INIT_LIST_HEAD(&lock->l_exp_list);
512 * Moves LDLM lock \a lock to another resource.
513 * This is used on client when server returns some other lock than requested
514 * (typically as a result of intent operation)
516 int ldlm_lock_change_resource(struct ldlm_namespace *ns, struct ldlm_lock *lock,
517 const struct ldlm_res_id *new_resid)
519 struct ldlm_resource *oldres = lock->l_resource;
520 struct ldlm_resource *newres;
524 LASSERT(ns_is_client(ns));
526 lock_res_and_lock(lock);
527 if (memcmp(new_resid, &lock->l_resource->lr_name,
528 sizeof(lock->l_resource->lr_name)) == 0) {
530 unlock_res_and_lock(lock);
534 LASSERT(new_resid->name[0] != 0);
536 /* This function assumes that the lock isn't on any lists */
537 LASSERT(list_empty(&lock->l_res_link));
539 type = oldres->lr_type;
540 unlock_res_and_lock(lock);
542 newres = ldlm_resource_get(ns, NULL, new_resid, type, 1);
544 RETURN(PTR_ERR(newres));
546 lu_ref_add(&newres->lr_reference, "lock", lock);
548 * To flip the lock from the old to the new resource, lock, oldres and
549 * newres have to be locked. Resource spin-locks are nested within
550 * lock->l_lock, and are taken in the memory address order to avoid
553 spin_lock(&lock->l_lock);
554 oldres = lock->l_resource;
555 if (oldres < newres) {
557 lock_res_nested(newres, LRT_NEW);
560 lock_res_nested(oldres, LRT_NEW);
562 LASSERT(memcmp(new_resid, &oldres->lr_name,
563 sizeof oldres->lr_name) != 0);
564 lock->l_resource = newres;
566 unlock_res_and_lock(lock);
568 /* ...and the flowers are still standing! */
569 lu_ref_del(&oldres->lr_reference, "lock", lock);
570 ldlm_resource_putref(oldres);
574 EXPORT_SYMBOL(ldlm_lock_change_resource);
576 /** \defgroup ldlm_handles LDLM HANDLES
577 * Ways to get hold of locks without any addresses.
582 * Fills in handle for LDLM lock \a lock into supplied \a lockh
583 * Does not take any references.
585 void ldlm_lock2handle(const struct ldlm_lock *lock, struct lustre_handle *lockh)
587 lockh->cookie = lock->l_handle.h_cookie;
589 EXPORT_SYMBOL(ldlm_lock2handle);
592 * Obtain a lock reference by handle.
594 * if \a flags: atomically get the lock and set the flags.
595 * Return NULL if flag already set
597 struct ldlm_lock *__ldlm_handle2lock(const struct lustre_handle *handle,
600 struct ldlm_lock *lock;
605 lock = class_handle2object(handle->cookie, NULL);
609 /* It's unlikely but possible that someone marked the lock as
610 * destroyed after we did handle2object on it */
611 if ((flags == 0) && !ldlm_is_destroyed(lock)) {
612 lu_ref_add(&lock->l_reference, "handle", current);
616 lock_res_and_lock(lock);
618 LASSERT(lock->l_resource != NULL);
620 lu_ref_add_atomic(&lock->l_reference, "handle", current);
621 if (unlikely(ldlm_is_destroyed(lock))) {
622 unlock_res_and_lock(lock);
623 CDEBUG(D_INFO, "lock already destroyed: lock %p\n", lock);
628 /* If we're setting flags, make sure none of them are already set. */
630 if ((lock->l_flags & flags) != 0) {
631 unlock_res_and_lock(lock);
636 lock->l_flags |= flags;
639 unlock_res_and_lock(lock);
642 EXPORT_SYMBOL(__ldlm_handle2lock);
643 /** @} ldlm_handles */
646 * Fill in "on the wire" representation for given LDLM lock into supplied
647 * lock descriptor \a desc structure.
649 void ldlm_lock2desc(struct ldlm_lock *lock, struct ldlm_lock_desc *desc)
651 ldlm_res2desc(lock->l_resource, &desc->l_resource);
652 desc->l_req_mode = lock->l_req_mode;
653 desc->l_granted_mode = lock->l_granted_mode;
654 ldlm_convert_policy_to_wire(lock->l_resource->lr_type,
655 &lock->l_policy_data,
656 &desc->l_policy_data);
658 EXPORT_SYMBOL(ldlm_lock2desc);
661 * Add a lock to list of conflicting locks to send AST to.
663 * Only add if we have not sent a blocking AST to the lock yet.
665 void ldlm_add_bl_work_item(struct ldlm_lock *lock, struct ldlm_lock *new,
666 struct list_head *work_list)
668 if (!ldlm_is_ast_sent(lock)) {
669 LDLM_DEBUG(lock, "lock incompatible; sending blocking AST.");
670 ldlm_set_ast_sent(lock);
671 /* If the enqueuing client said so, tell the AST recipient to
672 * discard dirty data, rather than writing back. */
673 if (ldlm_is_ast_discard_data(new))
674 ldlm_set_discard_data(lock);
675 LASSERT(list_empty(&lock->l_bl_ast));
676 list_add(&lock->l_bl_ast, work_list);
678 LASSERT(lock->l_blocking_lock == NULL);
679 lock->l_blocking_lock = LDLM_LOCK_GET(new);
684 * Add a lock to list of just granted locks to send completion AST to.
686 void ldlm_add_cp_work_item(struct ldlm_lock *lock, struct list_head *work_list)
688 if (!ldlm_is_cp_reqd(lock)) {
689 ldlm_set_cp_reqd(lock);
690 LDLM_DEBUG(lock, "lock granted; sending completion AST.");
691 LASSERT(list_empty(&lock->l_cp_ast));
692 list_add(&lock->l_cp_ast, work_list);
698 * Aggregator function to add AST work items into a list. Determines
699 * what sort of an AST work needs to be done and calls the proper
701 * Must be called with lr_lock held.
703 void ldlm_add_ast_work_item(struct ldlm_lock *lock, struct ldlm_lock *new,
704 struct list_head *work_list)
707 check_res_locked(lock->l_resource);
709 ldlm_add_bl_work_item(lock, new, work_list);
711 ldlm_add_cp_work_item(lock, work_list);
716 * Add specified reader/writer reference to LDLM lock with handle \a lockh.
717 * r/w reference type is determined by \a mode
718 * Calls ldlm_lock_addref_internal.
720 void ldlm_lock_addref(struct lustre_handle *lockh, __u32 mode)
722 struct ldlm_lock *lock;
724 lock = ldlm_handle2lock(lockh);
725 LASSERT(lock != NULL);
726 ldlm_lock_addref_internal(lock, mode);
729 EXPORT_SYMBOL(ldlm_lock_addref);
733 * Add specified reader/writer reference to LDLM lock \a lock.
734 * r/w reference type is determined by \a mode
735 * Removes lock from LRU if it is there.
736 * Assumes the LDLM lock is already locked.
738 void ldlm_lock_addref_internal_nolock(struct ldlm_lock *lock, __u32 mode)
740 ldlm_lock_remove_from_lru(lock);
741 if (mode & (LCK_NL | LCK_CR | LCK_PR)) {
743 lu_ref_add_atomic(&lock->l_reference, "reader", lock);
745 if (mode & (LCK_EX | LCK_CW | LCK_PW | LCK_GROUP | LCK_COS)) {
747 lu_ref_add_atomic(&lock->l_reference, "writer", lock);
750 lu_ref_add_atomic(&lock->l_reference, "user", lock);
751 LDLM_DEBUG(lock, "ldlm_lock_addref(%s)", ldlm_lockname[mode]);
755 * Attempts to add reader/writer reference to a lock with handle \a lockh, and
756 * fails if lock is already LDLM_FL_CBPENDING or destroyed.
758 * \retval 0 success, lock was addref-ed
760 * \retval -EAGAIN lock is being canceled.
762 int ldlm_lock_addref_try(struct lustre_handle *lockh, __u32 mode)
764 struct ldlm_lock *lock;
768 lock = ldlm_handle2lock(lockh);
770 lock_res_and_lock(lock);
771 if (lock->l_readers != 0 || lock->l_writers != 0 ||
772 !ldlm_is_cbpending(lock)) {
773 ldlm_lock_addref_internal_nolock(lock, mode);
776 unlock_res_and_lock(lock);
781 EXPORT_SYMBOL(ldlm_lock_addref_try);
784 * Add specified reader/writer reference to LDLM lock \a lock.
785 * Locks LDLM lock and calls ldlm_lock_addref_internal_nolock to do the work.
786 * Only called for local locks.
788 void ldlm_lock_addref_internal(struct ldlm_lock *lock, __u32 mode)
790 lock_res_and_lock(lock);
791 ldlm_lock_addref_internal_nolock(lock, mode);
792 unlock_res_and_lock(lock);
796 * Removes reader/writer reference for LDLM lock \a lock.
797 * Assumes LDLM lock is already locked.
798 * only called in ldlm_flock_destroy and for local locks.
799 * Does NOT add lock to LRU if no r/w references left to accomodate flock locks
800 * that cannot be placed in LRU.
802 void ldlm_lock_decref_internal_nolock(struct ldlm_lock *lock, __u32 mode)
804 LDLM_DEBUG(lock, "ldlm_lock_decref(%s)", ldlm_lockname[mode]);
805 if (mode & (LCK_NL | LCK_CR | LCK_PR)) {
806 LASSERT(lock->l_readers > 0);
807 lu_ref_del(&lock->l_reference, "reader", lock);
810 if (mode & (LCK_EX | LCK_CW | LCK_PW | LCK_GROUP | LCK_COS)) {
811 LASSERT(lock->l_writers > 0);
812 lu_ref_del(&lock->l_reference, "writer", lock);
816 lu_ref_del(&lock->l_reference, "user", lock);
817 LDLM_LOCK_RELEASE(lock); /* matches the LDLM_LOCK_GET() in addref */
821 * Removes reader/writer reference for LDLM lock \a lock.
822 * Locks LDLM lock first.
823 * If the lock is determined to be client lock on a client and r/w refcount
824 * drops to zero and the lock is not blocked, the lock is added to LRU lock
826 * For blocked LDLM locks if r/w count drops to zero, blocking_ast is called.
828 void ldlm_lock_decref_internal(struct ldlm_lock *lock, __u32 mode)
830 struct ldlm_namespace *ns;
833 lock_res_and_lock(lock);
835 ns = ldlm_lock_to_ns(lock);
837 ldlm_lock_decref_internal_nolock(lock, mode);
839 if (ldlm_is_local(lock) &&
840 !lock->l_readers && !lock->l_writers) {
841 /* If this is a local lock on a server namespace and this was
842 * the last reference, cancel the lock. */
843 CDEBUG(D_INFO, "forcing cancel of local lock\n");
844 ldlm_set_cbpending(lock);
847 if (!lock->l_readers && !lock->l_writers &&
848 ldlm_is_cbpending(lock)) {
849 /* If we received a blocked AST and this was the last reference,
850 * run the callback. */
851 if (ldlm_is_ns_srv(lock) && lock->l_export)
852 CERROR("FL_CBPENDING set on non-local lock--just a "
855 LDLM_DEBUG(lock, "final decref done on cbpending lock");
857 LDLM_LOCK_GET(lock); /* dropped by bl thread */
858 ldlm_lock_remove_from_lru(lock);
859 unlock_res_and_lock(lock);
861 if (ldlm_is_fail_loc(lock))
862 OBD_RACE(OBD_FAIL_LDLM_CP_BL_RACE);
864 if (ldlm_is_atomic_cb(lock) ||
865 ldlm_bl_to_thread_lock(ns, NULL, lock) != 0)
866 ldlm_handle_bl_callback(ns, NULL, lock);
867 } else if (ns_is_client(ns) &&
868 !lock->l_readers && !lock->l_writers &&
869 !ldlm_is_no_lru(lock) &&
870 !ldlm_is_bl_ast(lock)) {
872 LDLM_DEBUG(lock, "add lock into lru list");
874 /* If this is a client-side namespace and this was the last
875 * reference, put it on the LRU. */
876 ldlm_lock_add_to_lru(lock);
877 unlock_res_and_lock(lock);
879 if (ldlm_is_fail_loc(lock))
880 OBD_RACE(OBD_FAIL_LDLM_CP_BL_RACE);
882 /* Call ldlm_cancel_lru() only if EARLY_CANCEL and LRU RESIZE
883 * are not supported by the server, otherwise, it is done on
885 if (!exp_connect_cancelset(lock->l_conn_export) &&
886 !ns_connect_lru_resize(ns))
887 ldlm_cancel_lru(ns, 0, LCF_ASYNC, 0);
889 LDLM_DEBUG(lock, "do not add lock into lru list");
890 unlock_res_and_lock(lock);
897 * Decrease reader/writer refcount for LDLM lock with handle \a lockh
899 void ldlm_lock_decref(struct lustre_handle *lockh, __u32 mode)
901 struct ldlm_lock *lock = __ldlm_handle2lock(lockh, 0);
902 LASSERTF(lock != NULL, "Non-existing lock: "LPX64"\n", lockh->cookie);
903 ldlm_lock_decref_internal(lock, mode);
906 EXPORT_SYMBOL(ldlm_lock_decref);
909 * Decrease reader/writer refcount for LDLM lock with handle
910 * \a lockh and mark it for subsequent cancellation once r/w refcount
911 * drops to zero instead of putting into LRU.
913 * Typical usage is for GROUP locks which we cannot allow to be cached.
915 void ldlm_lock_decref_and_cancel(struct lustre_handle *lockh, __u32 mode)
917 struct ldlm_lock *lock = __ldlm_handle2lock(lockh, 0);
920 LASSERT(lock != NULL);
922 LDLM_DEBUG(lock, "ldlm_lock_decref(%s)", ldlm_lockname[mode]);
923 lock_res_and_lock(lock);
924 ldlm_set_cbpending(lock);
925 unlock_res_and_lock(lock);
926 ldlm_lock_decref_internal(lock, mode);
929 EXPORT_SYMBOL(ldlm_lock_decref_and_cancel);
931 struct sl_insert_point {
932 struct list_head *res_link;
933 struct list_head *mode_link;
934 struct list_head *policy_link;
938 * Finds a position to insert the new lock into granted lock list.
940 * Used for locks eligible for skiplist optimization.
943 * queue [input]: the granted list where search acts on;
944 * req [input]: the lock whose position to be located;
945 * prev [output]: positions within 3 lists to insert @req to
949 * - ldlm_grant_lock_with_skiplist
951 static void search_granted_lock(struct list_head *queue,
952 struct ldlm_lock *req,
953 struct sl_insert_point *prev)
955 struct list_head *tmp;
956 struct ldlm_lock *lock, *mode_end, *policy_end;
959 list_for_each(tmp, queue) {
960 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
962 mode_end = list_entry(lock->l_sl_mode.prev,
963 struct ldlm_lock, l_sl_mode);
965 if (lock->l_req_mode != req->l_req_mode) {
966 /* jump to last lock of mode group */
967 tmp = &mode_end->l_res_link;
971 /* suitable mode group is found */
972 if (lock->l_resource->lr_type == LDLM_PLAIN) {
973 /* insert point is last lock of the mode group */
974 prev->res_link = &mode_end->l_res_link;
975 prev->mode_link = &mode_end->l_sl_mode;
976 prev->policy_link = &req->l_sl_policy;
979 } else if (lock->l_resource->lr_type == LDLM_IBITS) {
982 list_entry(lock->l_sl_policy.prev,
986 if (lock->l_policy_data.l_inodebits.bits ==
987 req->l_policy_data.l_inodebits.bits) {
988 /* insert point is last lock of
989 * the policy group */
991 &policy_end->l_res_link;
993 &policy_end->l_sl_mode;
995 &policy_end->l_sl_policy;
1000 if (policy_end == mode_end)
1001 /* done with mode group */
1004 /* go to next policy group within mode group */
1005 tmp = policy_end->l_res_link.next;
1006 lock = list_entry(tmp, struct ldlm_lock,
1008 } /* loop over policy groups within the mode group */
1010 /* insert point is last lock of the mode group,
1011 * new policy group is started */
1012 prev->res_link = &mode_end->l_res_link;
1013 prev->mode_link = &mode_end->l_sl_mode;
1014 prev->policy_link = &req->l_sl_policy;
1018 LDLM_ERROR(lock,"is not LDLM_PLAIN or LDLM_IBITS lock");
1023 /* insert point is last lock on the queue,
1024 * new mode group and new policy group are started */
1025 prev->res_link = queue->prev;
1026 prev->mode_link = &req->l_sl_mode;
1027 prev->policy_link = &req->l_sl_policy;
1033 * Add a lock into resource granted list after a position described by
1036 static void ldlm_granted_list_add_lock(struct ldlm_lock *lock,
1037 struct sl_insert_point *prev)
1039 struct ldlm_resource *res = lock->l_resource;
1042 check_res_locked(res);
1044 ldlm_resource_dump(D_INFO, res);
1045 LDLM_DEBUG(lock, "About to add lock:");
1047 if (ldlm_is_destroyed(lock)) {
1048 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
1052 LASSERT(list_empty(&lock->l_res_link));
1053 LASSERT(list_empty(&lock->l_sl_mode));
1054 LASSERT(list_empty(&lock->l_sl_policy));
1057 * lock->link == prev->link means lock is first starting the group.
1058 * Don't re-add to itself to suppress kernel warnings.
1060 if (&lock->l_res_link != prev->res_link)
1061 list_add(&lock->l_res_link, prev->res_link);
1062 if (&lock->l_sl_mode != prev->mode_link)
1063 list_add(&lock->l_sl_mode, prev->mode_link);
1064 if (&lock->l_sl_policy != prev->policy_link)
1065 list_add(&lock->l_sl_policy, prev->policy_link);
1071 * Add a lock to granted list on a resource maintaining skiplist
1074 static void ldlm_grant_lock_with_skiplist(struct ldlm_lock *lock)
1076 struct sl_insert_point prev;
1079 LASSERT(lock->l_req_mode == lock->l_granted_mode);
1081 search_granted_lock(&lock->l_resource->lr_granted, lock, &prev);
1082 ldlm_granted_list_add_lock(lock, &prev);
1087 * Perform lock granting bookkeeping.
1089 * Includes putting the lock into granted list and updating lock mode.
1091 * - ldlm_lock_enqueue
1092 * - ldlm_reprocess_queue
1093 * - ldlm_lock_convert
1095 * must be called with lr_lock held
1097 void ldlm_grant_lock(struct ldlm_lock *lock, struct list_head *work_list)
1099 struct ldlm_resource *res = lock->l_resource;
1102 check_res_locked(res);
1104 lock->l_granted_mode = lock->l_req_mode;
1106 if (work_list && lock->l_completion_ast != NULL)
1107 ldlm_add_ast_work_item(lock, NULL, work_list);
1109 /* We should not add locks to granted list in the following cases:
1110 * - this is an UNLOCK but not a real lock;
1111 * - this is a TEST lock;
1112 * - this is a F_CANCELLK lock (async flock has req_mode == 0)
1113 * - this is a deadlock (flock cannot be granted) */
1114 if (lock->l_req_mode == 0 ||
1115 lock->l_req_mode == LCK_NL ||
1116 ldlm_is_test_lock(lock) ||
1117 ldlm_is_flock_deadlock(lock))
1120 if (res->lr_type == LDLM_PLAIN || res->lr_type == LDLM_IBITS)
1121 ldlm_grant_lock_with_skiplist(lock);
1122 else if (res->lr_type == LDLM_EXTENT)
1123 ldlm_extent_add_lock(res, lock);
1125 ldlm_resource_add_lock(res, &res->lr_granted, lock);
1127 if (lock->l_granted_mode < res->lr_most_restr)
1128 res->lr_most_restr = lock->l_granted_mode;
1130 ldlm_pool_add(&ldlm_res_to_ns(res)->ns_pool, lock);
1135 * Search for a lock with given properties in a queue.
1137 * \retval a referenced lock or NULL. See the flag descriptions below, in the
1138 * comment above ldlm_lock_match
1140 static struct ldlm_lock *search_queue(struct list_head *queue,
1142 ldlm_policy_data_t *policy,
1143 struct ldlm_lock *old_lock,
1144 __u64 flags, int unref)
1146 struct ldlm_lock *lock;
1147 struct list_head *tmp;
1149 list_for_each(tmp, queue) {
1152 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
1154 if (lock == old_lock)
1157 /* Check if this lock can be matched.
1158 * Used by LU-2919(exclusive open) for open lease lock */
1159 if (ldlm_is_excl(lock))
1162 /* llite sometimes wants to match locks that will be
1163 * canceled when their users drop, but we allow it to match
1164 * if it passes in CBPENDING and the lock still has users.
1165 * this is generally only going to be used by children
1166 * whose parents already hold a lock so forward progress
1167 * can still happen. */
1168 if (ldlm_is_cbpending(lock) &&
1169 !(flags & LDLM_FL_CBPENDING))
1171 if (!unref && ldlm_is_cbpending(lock) &&
1172 lock->l_readers == 0 && lock->l_writers == 0)
1175 if (!(lock->l_req_mode & *mode))
1177 match = lock->l_req_mode;
1179 if (lock->l_resource->lr_type == LDLM_EXTENT &&
1180 (lock->l_policy_data.l_extent.start >
1181 policy->l_extent.start ||
1182 lock->l_policy_data.l_extent.end < policy->l_extent.end))
1185 if (unlikely(match == LCK_GROUP) &&
1186 lock->l_resource->lr_type == LDLM_EXTENT &&
1187 lock->l_policy_data.l_extent.gid != policy->l_extent.gid)
1190 /* We match if we have existing lock with same or wider set
1192 if (lock->l_resource->lr_type == LDLM_IBITS &&
1193 ((lock->l_policy_data.l_inodebits.bits &
1194 policy->l_inodebits.bits) !=
1195 policy->l_inodebits.bits))
1198 if (!unref && LDLM_HAVE_MASK(lock, GONE))
1201 if ((flags & LDLM_FL_LOCAL_ONLY) &&
1202 !ldlm_is_local(lock))
1205 if (flags & LDLM_FL_TEST_LOCK) {
1206 LDLM_LOCK_GET(lock);
1207 ldlm_lock_touch_in_lru(lock);
1209 ldlm_lock_addref_internal_nolock(lock, match);
1218 void ldlm_lock_fail_match_locked(struct ldlm_lock *lock)
1220 if ((lock->l_flags & LDLM_FL_FAIL_NOTIFIED) == 0) {
1221 lock->l_flags |= LDLM_FL_FAIL_NOTIFIED;
1222 wake_up_all(&lock->l_waitq);
1225 EXPORT_SYMBOL(ldlm_lock_fail_match_locked);
1227 void ldlm_lock_fail_match(struct ldlm_lock *lock)
1229 lock_res_and_lock(lock);
1230 ldlm_lock_fail_match_locked(lock);
1231 unlock_res_and_lock(lock);
1233 EXPORT_SYMBOL(ldlm_lock_fail_match);
1236 * Mark lock as "matchable" by OST.
1238 * Used to prevent certain races in LOV/OSC where the lock is granted, but LVB
1240 * Assumes LDLM lock is already locked.
1242 void ldlm_lock_allow_match_locked(struct ldlm_lock *lock)
1244 ldlm_set_lvb_ready(lock);
1245 wake_up_all(&lock->l_waitq);
1247 EXPORT_SYMBOL(ldlm_lock_allow_match_locked);
1250 * Mark lock as "matchable" by OST.
1251 * Locks the lock and then \see ldlm_lock_allow_match_locked
1253 void ldlm_lock_allow_match(struct ldlm_lock *lock)
1255 lock_res_and_lock(lock);
1256 ldlm_lock_allow_match_locked(lock);
1257 unlock_res_and_lock(lock);
1259 EXPORT_SYMBOL(ldlm_lock_allow_match);
1262 * Attempt to find a lock with specified properties.
1264 * Typically returns a reference to matched lock unless LDLM_FL_TEST_LOCK is
1267 * Can be called in two ways:
1269 * If 'ns' is NULL, then lockh describes an existing lock that we want to look
1270 * for a duplicate of.
1272 * Otherwise, all of the fields must be filled in, to match against.
1274 * If 'flags' contains LDLM_FL_LOCAL_ONLY, then only match local locks on the
1275 * server (ie, connh is NULL)
1276 * If 'flags' contains LDLM_FL_BLOCK_GRANTED, then only locks on the granted
1277 * list will be considered
1278 * If 'flags' contains LDLM_FL_CBPENDING, then locks that have been marked
1279 * to be canceled can still be matched as long as they still have reader
1280 * or writer refernces
1281 * If 'flags' contains LDLM_FL_TEST_LOCK, then don't actually reference a lock,
1282 * just tell us if we would have matched.
1284 * \retval 1 if it finds an already-existing lock that is compatible; in this
1285 * case, lockh is filled in with a addref()ed lock
1287 * We also check security context, and if that fails we simply return 0 (to
1288 * keep caller code unchanged), the context failure will be discovered by
1289 * caller sometime later.
1291 ldlm_mode_t ldlm_lock_match(struct ldlm_namespace *ns, __u64 flags,
1292 const struct ldlm_res_id *res_id, ldlm_type_t type,
1293 ldlm_policy_data_t *policy, ldlm_mode_t mode,
1294 struct lustre_handle *lockh, int unref)
1296 struct ldlm_resource *res;
1297 struct ldlm_lock *lock, *old_lock = NULL;
1302 old_lock = ldlm_handle2lock(lockh);
1305 ns = ldlm_lock_to_ns(old_lock);
1306 res_id = &old_lock->l_resource->lr_name;
1307 type = old_lock->l_resource->lr_type;
1308 mode = old_lock->l_req_mode;
1311 res = ldlm_resource_get(ns, NULL, res_id, type, 0);
1313 LASSERT(old_lock == NULL);
1317 LDLM_RESOURCE_ADDREF(res);
1320 lock = search_queue(&res->lr_granted, &mode, policy, old_lock,
1324 if (flags & LDLM_FL_BLOCK_GRANTED)
1326 lock = search_queue(&res->lr_converting, &mode, policy, old_lock,
1330 lock = search_queue(&res->lr_waiting, &mode, policy, old_lock,
1338 LDLM_RESOURCE_DELREF(res);
1339 ldlm_resource_putref(res);
1342 ldlm_lock2handle(lock, lockh);
1343 if ((flags & LDLM_FL_LVB_READY) &&
1344 (!ldlm_is_lvb_ready(lock))) {
1345 __u64 wait_flags = LDLM_FL_LVB_READY |
1346 LDLM_FL_DESTROYED | LDLM_FL_FAIL_NOTIFIED;
1347 struct l_wait_info lwi;
1348 if (lock->l_completion_ast) {
1349 int err = lock->l_completion_ast(lock,
1350 LDLM_FL_WAIT_NOREPROC,
1353 if (flags & LDLM_FL_TEST_LOCK)
1354 LDLM_LOCK_RELEASE(lock);
1356 ldlm_lock_decref_internal(lock,
1363 lwi = LWI_TIMEOUT_INTR(cfs_time_seconds(obd_timeout),
1364 NULL, LWI_ON_SIGNAL_NOOP, NULL);
1366 /* XXX FIXME see comment on CAN_MATCH in lustre_dlm.h */
1367 l_wait_event(lock->l_waitq,
1368 lock->l_flags & wait_flags,
1370 if (!ldlm_is_lvb_ready(lock)) {
1371 if (flags & LDLM_FL_TEST_LOCK)
1372 LDLM_LOCK_RELEASE(lock);
1374 ldlm_lock_decref_internal(lock, mode);
1381 LDLM_DEBUG(lock, "matched ("LPU64" "LPU64")",
1382 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1383 res_id->name[2] : policy->l_extent.start,
1384 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1385 res_id->name[3] : policy->l_extent.end);
1387 /* check user's security context */
1388 if (lock->l_conn_export &&
1389 sptlrpc_import_check_ctx(
1390 class_exp2cliimp(lock->l_conn_export))) {
1391 if (!(flags & LDLM_FL_TEST_LOCK))
1392 ldlm_lock_decref_internal(lock, mode);
1396 if (flags & LDLM_FL_TEST_LOCK)
1397 LDLM_LOCK_RELEASE(lock);
1399 } else if (!(flags & LDLM_FL_TEST_LOCK)) {/*less verbose for test-only*/
1400 LDLM_DEBUG_NOLOCK("not matched ns %p type %u mode %u res "
1401 LPU64"/"LPU64" ("LPU64" "LPU64")", ns,
1402 type, mode, res_id->name[0], res_id->name[1],
1403 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1404 res_id->name[2] :policy->l_extent.start,
1405 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1406 res_id->name[3] : policy->l_extent.end);
1409 LDLM_LOCK_PUT(old_lock);
1411 return rc ? mode : 0;
1413 EXPORT_SYMBOL(ldlm_lock_match);
1415 ldlm_mode_t ldlm_revalidate_lock_handle(struct lustre_handle *lockh,
1418 struct ldlm_lock *lock;
1419 ldlm_mode_t mode = 0;
1422 lock = ldlm_handle2lock(lockh);
1424 lock_res_and_lock(lock);
1425 if (LDLM_HAVE_MASK(lock, GONE))
1428 if (ldlm_is_cbpending(lock) &&
1429 lock->l_readers == 0 && lock->l_writers == 0)
1433 *bits = lock->l_policy_data.l_inodebits.bits;
1434 mode = lock->l_granted_mode;
1435 ldlm_lock_addref_internal_nolock(lock, mode);
1442 unlock_res_and_lock(lock);
1443 LDLM_LOCK_PUT(lock);
1447 EXPORT_SYMBOL(ldlm_revalidate_lock_handle);
1449 /** The caller must guarantee that the buffer is large enough. */
1450 int ldlm_fill_lvb(struct ldlm_lock *lock, struct req_capsule *pill,
1451 enum req_location loc, void *data, int size)
1456 LASSERT(data != NULL);
1459 switch (lock->l_lvb_type) {
1461 if (size == sizeof(struct ost_lvb)) {
1462 if (loc == RCL_CLIENT)
1463 lvb = req_capsule_client_swab_get(pill,
1465 lustre_swab_ost_lvb);
1467 lvb = req_capsule_server_swab_get(pill,
1469 lustre_swab_ost_lvb);
1470 if (unlikely(lvb == NULL)) {
1471 LDLM_ERROR(lock, "no LVB");
1475 memcpy(data, lvb, size);
1476 } else if (size == sizeof(struct ost_lvb_v1)) {
1477 struct ost_lvb *olvb = data;
1479 if (loc == RCL_CLIENT)
1480 lvb = req_capsule_client_swab_get(pill,
1482 lustre_swab_ost_lvb_v1);
1484 lvb = req_capsule_server_sized_swab_get(pill,
1486 lustre_swab_ost_lvb_v1);
1487 if (unlikely(lvb == NULL)) {
1488 LDLM_ERROR(lock, "no LVB");
1492 memcpy(data, lvb, size);
1493 olvb->lvb_mtime_ns = 0;
1494 olvb->lvb_atime_ns = 0;
1495 olvb->lvb_ctime_ns = 0;
1497 LDLM_ERROR(lock, "Replied unexpected ost LVB size %d",
1503 if (size == sizeof(struct lquota_lvb)) {
1504 if (loc == RCL_CLIENT)
1505 lvb = req_capsule_client_swab_get(pill,
1507 lustre_swab_lquota_lvb);
1509 lvb = req_capsule_server_swab_get(pill,
1511 lustre_swab_lquota_lvb);
1512 if (unlikely(lvb == NULL)) {
1513 LDLM_ERROR(lock, "no LVB");
1517 memcpy(data, lvb, size);
1519 LDLM_ERROR(lock, "Replied unexpected lquota LVB size %d",
1528 if (loc == RCL_CLIENT)
1529 lvb = req_capsule_client_get(pill, &RMF_DLM_LVB);
1531 lvb = req_capsule_server_get(pill, &RMF_DLM_LVB);
1532 if (unlikely(lvb == NULL)) {
1533 LDLM_ERROR(lock, "no LVB");
1537 memcpy(data, lvb, size);
1540 LDLM_ERROR(lock, "Unknown LVB type: %d\n", lock->l_lvb_type);
1541 libcfs_debug_dumpstack(NULL);
1549 * Create and fill in new LDLM lock with specified properties.
1550 * Returns a referenced lock
1552 struct ldlm_lock *ldlm_lock_create(struct ldlm_namespace *ns,
1553 const struct ldlm_res_id *res_id,
1556 const struct ldlm_callback_suite *cbs,
1557 void *data, __u32 lvb_len,
1558 enum lvb_type lvb_type)
1560 struct ldlm_lock *lock;
1561 struct ldlm_resource *res;
1565 res = ldlm_resource_get(ns, NULL, res_id, type, 1);
1567 RETURN(ERR_CAST(res));
1569 lock = ldlm_lock_new(res);
1571 RETURN(ERR_PTR(-ENOMEM));
1573 lock->l_req_mode = mode;
1574 lock->l_ast_data = data;
1575 lock->l_pid = current_pid();
1576 if (ns_is_server(ns))
1577 ldlm_set_ns_srv(lock);
1579 lock->l_blocking_ast = cbs->lcs_blocking;
1580 lock->l_completion_ast = cbs->lcs_completion;
1581 lock->l_glimpse_ast = cbs->lcs_glimpse;
1584 lock->l_tree_node = NULL;
1585 /* if this is the extent lock, allocate the interval tree node */
1586 if (type == LDLM_EXTENT)
1587 if (ldlm_interval_alloc(lock) == NULL)
1588 GOTO(out, rc = -ENOMEM);
1591 lock->l_lvb_len = lvb_len;
1592 OBD_ALLOC_LARGE(lock->l_lvb_data, lvb_len);
1593 if (lock->l_lvb_data == NULL)
1594 GOTO(out, rc = -ENOMEM);
1597 lock->l_lvb_type = lvb_type;
1598 if (OBD_FAIL_CHECK(OBD_FAIL_LDLM_NEW_LOCK))
1599 GOTO(out, rc = -ENOENT);
1604 ldlm_lock_destroy(lock);
1605 LDLM_LOCK_RELEASE(lock);
1606 RETURN(ERR_PTR(rc));
1610 * Enqueue (request) a lock.
1612 * Does not block. As a result of enqueue the lock would be put
1613 * into granted or waiting list.
1615 * If namespace has intent policy sent and the lock has LDLM_FL_HAS_INTENT flag
1616 * set, skip all the enqueueing and delegate lock processing to intent policy
1619 ldlm_error_t ldlm_lock_enqueue(struct ldlm_namespace *ns,
1620 struct ldlm_lock **lockp,
1621 void *cookie, __u64 *flags)
1623 struct ldlm_lock *lock = *lockp;
1624 struct ldlm_resource *res = lock->l_resource;
1625 int local = ns_is_client(ldlm_res_to_ns(res));
1626 #ifdef HAVE_SERVER_SUPPORT
1627 ldlm_processing_policy policy;
1629 ldlm_error_t rc = ELDLM_OK;
1630 struct ldlm_interval *node = NULL;
1633 lock->l_last_activity = cfs_time_current_sec();
1634 /* policies are not executed on the client or during replay */
1635 if ((*flags & (LDLM_FL_HAS_INTENT|LDLM_FL_REPLAY)) == LDLM_FL_HAS_INTENT
1636 && !local && ns->ns_policy) {
1637 rc = ns->ns_policy(ns, lockp, cookie, lock->l_req_mode, *flags,
1639 if (rc == ELDLM_LOCK_REPLACED) {
1640 /* The lock that was returned has already been granted,
1641 * and placed into lockp. If it's not the same as the
1642 * one we passed in, then destroy the old one and our
1643 * work here is done. */
1644 if (lock != *lockp) {
1645 ldlm_lock_destroy(lock);
1646 LDLM_LOCK_RELEASE(lock);
1648 *flags |= LDLM_FL_LOCK_CHANGED;
1650 } else if (rc != ELDLM_OK ||
1651 (rc == ELDLM_OK && (*flags & LDLM_FL_INTENT_ONLY))) {
1652 ldlm_lock_destroy(lock);
1657 if (*flags & LDLM_FL_RESENT)
1660 /* For a replaying lock, it might be already in granted list. So
1661 * unlinking the lock will cause the interval node to be freed, we
1662 * have to allocate the interval node early otherwise we can't regrant
1663 * this lock in the future. - jay */
1664 if (!local && (*flags & LDLM_FL_REPLAY) && res->lr_type == LDLM_EXTENT)
1665 OBD_SLAB_ALLOC_PTR_GFP(node, ldlm_interval_slab, GFP_NOFS);
1667 lock_res_and_lock(lock);
1668 if (local && lock->l_req_mode == lock->l_granted_mode) {
1669 /* The server returned a blocked lock, but it was granted
1670 * before we got a chance to actually enqueue it. We don't
1671 * need to do anything else. */
1672 *flags &= ~(LDLM_FL_BLOCK_GRANTED |
1673 LDLM_FL_BLOCK_CONV | LDLM_FL_BLOCK_WAIT);
1674 GOTO(out, rc = ELDLM_OK);
1677 ldlm_resource_unlink_lock(lock);
1678 if (res->lr_type == LDLM_EXTENT && lock->l_tree_node == NULL) {
1680 ldlm_lock_destroy_nolock(lock);
1681 GOTO(out, rc = -ENOMEM);
1684 INIT_LIST_HEAD(&node->li_group);
1685 ldlm_interval_attach(node, lock);
1689 /* Some flags from the enqueue want to make it into the AST, via the
1690 * lock's l_flags. */
1691 if (*flags & LDLM_FL_AST_DISCARD_DATA)
1692 ldlm_set_ast_discard_data(lock);
1693 if (*flags & LDLM_FL_TEST_LOCK)
1694 ldlm_set_test_lock(lock);
1696 /* This distinction between local lock trees is very important; a client
1697 * namespace only has information about locks taken by that client, and
1698 * thus doesn't have enough information to decide for itself if it can
1699 * be granted (below). In this case, we do exactly what the server
1700 * tells us to do, as dictated by the 'flags'.
1702 * We do exactly the same thing during recovery, when the server is
1703 * more or less trusting the clients not to lie.
1705 * FIXME (bug 268): Detect obvious lies by checking compatibility in
1706 * granted/converting queues. */
1708 if (*flags & LDLM_FL_BLOCK_CONV)
1709 ldlm_resource_add_lock(res, &res->lr_converting, lock);
1710 else if (*flags & (LDLM_FL_BLOCK_WAIT | LDLM_FL_BLOCK_GRANTED))
1711 ldlm_resource_add_lock(res, &res->lr_waiting, lock);
1713 ldlm_grant_lock(lock, NULL);
1714 GOTO(out, rc = ELDLM_OK);
1715 #ifdef HAVE_SERVER_SUPPORT
1716 } else if (*flags & LDLM_FL_REPLAY) {
1717 if (*flags & LDLM_FL_BLOCK_CONV) {
1718 ldlm_resource_add_lock(res, &res->lr_converting, lock);
1719 GOTO(out, rc = ELDLM_OK);
1720 } else if (*flags & LDLM_FL_BLOCK_WAIT) {
1721 ldlm_resource_add_lock(res, &res->lr_waiting, lock);
1722 GOTO(out, rc = ELDLM_OK);
1723 } else if (*flags & LDLM_FL_BLOCK_GRANTED) {
1724 ldlm_grant_lock(lock, NULL);
1725 GOTO(out, rc = ELDLM_OK);
1727 /* If no flags, fall through to normal enqueue path. */
1730 policy = ldlm_processing_policy_table[res->lr_type];
1731 policy(lock, flags, 1, &rc, NULL);
1735 CERROR("This is client-side-only module, cannot handle "
1736 "LDLM_NAMESPACE_SERVER resource type lock.\n");
1742 unlock_res_and_lock(lock);
1744 OBD_SLAB_FREE(node, ldlm_interval_slab, sizeof(*node));
1748 #ifdef HAVE_SERVER_SUPPORT
1750 * Iterate through all waiting locks on a given resource queue and attempt to
1753 * Must be called with resource lock held.
1755 int ldlm_reprocess_queue(struct ldlm_resource *res, struct list_head *queue,
1756 struct list_head *work_list)
1758 struct list_head *tmp, *pos;
1759 ldlm_processing_policy policy;
1761 int rc = LDLM_ITER_CONTINUE;
1765 check_res_locked(res);
1767 policy = ldlm_processing_policy_table[res->lr_type];
1770 list_for_each_safe(tmp, pos, queue) {
1771 struct ldlm_lock *pending;
1772 pending = list_entry(tmp, struct ldlm_lock, l_res_link);
1774 CDEBUG(D_INFO, "Reprocessing lock %p\n", pending);
1777 rc = policy(pending, &flags, 0, &err, work_list);
1778 if (rc != LDLM_ITER_CONTINUE)
1787 * Process a call to blocking AST callback for a lock in ast_work list
1790 ldlm_work_bl_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1792 struct ldlm_cb_set_arg *arg = opaq;
1793 struct ldlm_lock_desc d;
1795 struct ldlm_lock *lock;
1798 if (list_empty(arg->list))
1801 lock = list_entry(arg->list->next, struct ldlm_lock, l_bl_ast);
1803 /* nobody should touch l_bl_ast */
1804 lock_res_and_lock(lock);
1805 list_del_init(&lock->l_bl_ast);
1807 LASSERT(ldlm_is_ast_sent(lock));
1808 LASSERT(lock->l_bl_ast_run == 0);
1809 LASSERT(lock->l_blocking_lock);
1810 lock->l_bl_ast_run++;
1811 unlock_res_and_lock(lock);
1813 ldlm_lock2desc(lock->l_blocking_lock, &d);
1815 rc = lock->l_blocking_ast(lock, &d, (void *)arg, LDLM_CB_BLOCKING);
1816 LDLM_LOCK_RELEASE(lock->l_blocking_lock);
1817 lock->l_blocking_lock = NULL;
1818 LDLM_LOCK_RELEASE(lock);
1824 * Process a call to completion AST callback for a lock in ast_work list
1827 ldlm_work_cp_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1829 struct ldlm_cb_set_arg *arg = opaq;
1831 struct ldlm_lock *lock;
1832 ldlm_completion_callback completion_callback;
1835 if (list_empty(arg->list))
1838 lock = list_entry(arg->list->next, struct ldlm_lock, l_cp_ast);
1840 /* It's possible to receive a completion AST before we've set
1841 * the l_completion_ast pointer: either because the AST arrived
1842 * before the reply, or simply because there's a small race
1843 * window between receiving the reply and finishing the local
1844 * enqueue. (bug 842)
1846 * This can't happen with the blocking_ast, however, because we
1847 * will never call the local blocking_ast until we drop our
1848 * reader/writer reference, which we won't do until we get the
1849 * reply and finish enqueueing. */
1851 /* nobody should touch l_cp_ast */
1852 lock_res_and_lock(lock);
1853 list_del_init(&lock->l_cp_ast);
1854 LASSERT(ldlm_is_cp_reqd(lock));
1855 /* save l_completion_ast since it can be changed by
1856 * mds_intent_policy(), see bug 14225 */
1857 completion_callback = lock->l_completion_ast;
1858 ldlm_clear_cp_reqd(lock);
1859 unlock_res_and_lock(lock);
1861 if (completion_callback != NULL)
1862 rc = completion_callback(lock, 0, (void *)arg);
1863 LDLM_LOCK_RELEASE(lock);
1869 * Process a call to revocation AST callback for a lock in ast_work list
1872 ldlm_work_revoke_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1874 struct ldlm_cb_set_arg *arg = opaq;
1875 struct ldlm_lock_desc desc;
1877 struct ldlm_lock *lock;
1880 if (list_empty(arg->list))
1883 lock = list_entry(arg->list->next, struct ldlm_lock, l_rk_ast);
1884 list_del_init(&lock->l_rk_ast);
1886 /* the desc just pretend to exclusive */
1887 ldlm_lock2desc(lock, &desc);
1888 desc.l_req_mode = LCK_EX;
1889 desc.l_granted_mode = 0;
1891 rc = lock->l_blocking_ast(lock, &desc, (void*)arg, LDLM_CB_BLOCKING);
1892 LDLM_LOCK_RELEASE(lock);
1898 * Process a call to glimpse AST callback for a lock in ast_work list
1900 int ldlm_work_gl_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1902 struct ldlm_cb_set_arg *arg = opaq;
1903 struct ldlm_glimpse_work *gl_work;
1904 struct ldlm_lock *lock;
1908 if (list_empty(arg->list))
1911 gl_work = list_entry(arg->list->next, struct ldlm_glimpse_work,
1913 list_del_init(&gl_work->gl_list);
1915 lock = gl_work->gl_lock;
1917 /* transfer the glimpse descriptor to ldlm_cb_set_arg */
1918 arg->gl_desc = gl_work->gl_desc;
1920 /* invoke the actual glimpse callback */
1921 if (lock->l_glimpse_ast(lock, (void*)arg) == 0)
1924 LDLM_LOCK_RELEASE(lock);
1926 if ((gl_work->gl_flags & LDLM_GL_WORK_NOFREE) == 0)
1927 OBD_FREE_PTR(gl_work);
1933 * Process list of locks in need of ASTs being sent.
1935 * Used on server to send multiple ASTs together instead of sending one by
1938 int ldlm_run_ast_work(struct ldlm_namespace *ns, struct list_head *rpc_list,
1939 ldlm_desc_ast_t ast_type)
1941 struct ldlm_cb_set_arg *arg;
1942 set_producer_func work_ast_lock;
1945 if (list_empty(rpc_list))
1952 atomic_set(&arg->restart, 0);
1953 arg->list = rpc_list;
1956 case LDLM_WORK_BL_AST:
1957 arg->type = LDLM_BL_CALLBACK;
1958 work_ast_lock = ldlm_work_bl_ast_lock;
1960 case LDLM_WORK_CP_AST:
1961 arg->type = LDLM_CP_CALLBACK;
1962 work_ast_lock = ldlm_work_cp_ast_lock;
1964 case LDLM_WORK_REVOKE_AST:
1965 arg->type = LDLM_BL_CALLBACK;
1966 work_ast_lock = ldlm_work_revoke_ast_lock;
1968 case LDLM_WORK_GL_AST:
1969 arg->type = LDLM_GL_CALLBACK;
1970 work_ast_lock = ldlm_work_gl_ast_lock;
1976 /* We create a ptlrpc request set with flow control extension.
1977 * This request set will use the work_ast_lock function to produce new
1978 * requests and will send a new request each time one completes in order
1979 * to keep the number of requests in flight to ns_max_parallel_ast */
1980 arg->set = ptlrpc_prep_fcset(ns->ns_max_parallel_ast ? : UINT_MAX,
1981 work_ast_lock, arg);
1982 if (arg->set == NULL)
1983 GOTO(out, rc = -ENOMEM);
1985 ptlrpc_set_wait(arg->set);
1986 ptlrpc_set_destroy(arg->set);
1988 rc = atomic_read(&arg->restart) ? -ERESTART : 0;
1995 static int reprocess_one_queue(struct ldlm_resource *res, void *closure)
1997 ldlm_reprocess_all(res);
1998 return LDLM_ITER_CONTINUE;
2001 static int ldlm_reprocess_res(cfs_hash_t *hs, cfs_hash_bd_t *bd,
2002 struct hlist_node *hnode, void *arg)
2004 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
2007 rc = reprocess_one_queue(res, arg);
2009 return rc == LDLM_ITER_STOP;
2013 * Iterate through all resources on a namespace attempting to grant waiting
2016 void ldlm_reprocess_all_ns(struct ldlm_namespace *ns)
2021 cfs_hash_for_each_nolock(ns->ns_rs_hash,
2022 ldlm_reprocess_res, NULL);
2026 EXPORT_SYMBOL(ldlm_reprocess_all_ns);
2029 * Try to grant all waiting locks on a resource.
2031 * Calls ldlm_reprocess_queue on converting and waiting queues.
2033 * Typically called after some resource locks are cancelled to see
2034 * if anything could be granted as a result of the cancellation.
2036 void ldlm_reprocess_all(struct ldlm_resource *res)
2038 struct list_head rpc_list;
2039 #ifdef HAVE_SERVER_SUPPORT
2043 INIT_LIST_HEAD(&rpc_list);
2044 /* Local lock trees don't get reprocessed. */
2045 if (ns_is_client(ldlm_res_to_ns(res))) {
2052 rc = ldlm_reprocess_queue(res, &res->lr_converting, &rpc_list);
2053 if (rc == LDLM_ITER_CONTINUE)
2054 ldlm_reprocess_queue(res, &res->lr_waiting, &rpc_list);
2057 rc = ldlm_run_ast_work(ldlm_res_to_ns(res), &rpc_list,
2059 if (rc == -ERESTART) {
2060 LASSERT(list_empty(&rpc_list));
2066 INIT_LIST_HEAD(&rpc_list);
2067 if (!ns_is_client(ldlm_res_to_ns(res))) {
2068 CERROR("This is client-side-only module, cannot handle "
2069 "LDLM_NAMESPACE_SERVER resource type lock.\n");
2075 EXPORT_SYMBOL(ldlm_reprocess_all);
2078 * Helper function to call blocking AST for LDLM lock \a lock in a
2079 * "cancelling" mode.
2081 void ldlm_cancel_callback(struct ldlm_lock *lock)
2083 check_res_locked(lock->l_resource);
2084 if (!ldlm_is_cancel(lock)) {
2085 ldlm_set_cancel(lock);
2086 if (lock->l_blocking_ast) {
2087 unlock_res_and_lock(lock);
2088 lock->l_blocking_ast(lock, NULL, lock->l_ast_data,
2090 lock_res_and_lock(lock);
2092 LDLM_DEBUG(lock, "no blocking ast");
2095 ldlm_set_bl_done(lock);
2099 * Remove skiplist-enabled LDLM lock \a req from granted list
2101 void ldlm_unlink_lock_skiplist(struct ldlm_lock *req)
2103 if (req->l_resource->lr_type != LDLM_PLAIN &&
2104 req->l_resource->lr_type != LDLM_IBITS)
2107 list_del_init(&req->l_sl_policy);
2108 list_del_init(&req->l_sl_mode);
2112 * Attempts to cancel LDLM lock \a lock that has no reader/writer references.
2114 void ldlm_lock_cancel(struct ldlm_lock *lock)
2116 struct ldlm_resource *res;
2117 struct ldlm_namespace *ns;
2120 lock_res_and_lock(lock);
2122 res = lock->l_resource;
2123 ns = ldlm_res_to_ns(res);
2125 /* Please do not, no matter how tempting, remove this LBUG without
2126 * talking to me first. -phik */
2127 if (lock->l_readers || lock->l_writers) {
2128 LDLM_ERROR(lock, "lock still has references");
2132 if (ldlm_is_waited(lock))
2133 ldlm_del_waiting_lock(lock);
2135 /* Releases cancel callback. */
2136 ldlm_cancel_callback(lock);
2138 /* Yes, second time, just in case it was added again while we were
2139 * running with no res lock in ldlm_cancel_callback */
2140 if (ldlm_is_waited(lock))
2141 ldlm_del_waiting_lock(lock);
2143 ldlm_resource_unlink_lock(lock);
2144 ldlm_lock_destroy_nolock(lock);
2146 if (lock->l_granted_mode == lock->l_req_mode)
2147 ldlm_pool_del(&ns->ns_pool, lock);
2149 /* Make sure we will not be called again for same lock what is possible
2150 * if not to zero out lock->l_granted_mode */
2151 lock->l_granted_mode = LCK_MINMODE;
2152 unlock_res_and_lock(lock);
2156 EXPORT_SYMBOL(ldlm_lock_cancel);
2159 * Set opaque data into the lock that only makes sense to upper layer.
2161 int ldlm_lock_set_data(struct lustre_handle *lockh, void *data)
2163 struct ldlm_lock *lock = ldlm_handle2lock(lockh);
2168 if (lock->l_ast_data == NULL)
2169 lock->l_ast_data = data;
2170 if (lock->l_ast_data == data)
2172 LDLM_LOCK_PUT(lock);
2176 EXPORT_SYMBOL(ldlm_lock_set_data);
2178 struct export_cl_data {
2179 struct obd_export *ecl_exp;
2184 * Iterator function for ldlm_cancel_locks_for_export.
2185 * Cancels passed locks.
2187 int ldlm_cancel_locks_for_export_cb(cfs_hash_t *hs, cfs_hash_bd_t *bd,
2188 struct hlist_node *hnode, void *data)
2191 struct export_cl_data *ecl = (struct export_cl_data *)data;
2192 struct obd_export *exp = ecl->ecl_exp;
2193 struct ldlm_lock *lock = cfs_hash_object(hs, hnode);
2194 struct ldlm_resource *res;
2196 res = ldlm_resource_getref(lock->l_resource);
2197 LDLM_LOCK_GET(lock);
2199 LDLM_DEBUG(lock, "export %p", exp);
2200 ldlm_res_lvbo_update(res, NULL, 1);
2201 ldlm_lock_cancel(lock);
2202 ldlm_reprocess_all(res);
2203 ldlm_resource_putref(res);
2204 LDLM_LOCK_RELEASE(lock);
2207 if ((ecl->ecl_loop & -ecl->ecl_loop) == ecl->ecl_loop) {
2209 "Cancel lock %p for export %p (loop %d), still have "
2210 "%d locks left on hash table.\n",
2211 lock, exp, ecl->ecl_loop,
2212 atomic_read(&hs->hs_count));
2219 * Cancel all locks for given export.
2221 * Typically called on client disconnection/eviction
2223 void ldlm_cancel_locks_for_export(struct obd_export *exp)
2225 struct export_cl_data ecl = {
2230 cfs_hash_for_each_empty(exp->exp_lock_hash,
2231 ldlm_cancel_locks_for_export_cb, &ecl);
2235 * Downgrade an exclusive lock.
2237 * A fast variant of ldlm_lock_convert for convertion of exclusive
2238 * locks. The convertion is always successful.
2239 * Used by Commit on Sharing (COS) code.
2241 * \param lock A lock to convert
2242 * \param new_mode new lock mode
2244 void ldlm_lock_downgrade(struct ldlm_lock *lock, int new_mode)
2248 LASSERT(lock->l_granted_mode & (LCK_PW | LCK_EX));
2249 LASSERT(new_mode == LCK_COS);
2251 lock_res_and_lock(lock);
2252 ldlm_resource_unlink_lock(lock);
2254 * Remove the lock from pool as it will be added again in
2255 * ldlm_grant_lock() called below.
2257 ldlm_pool_del(&ldlm_lock_to_ns(lock)->ns_pool, lock);
2259 lock->l_req_mode = new_mode;
2260 ldlm_grant_lock(lock, NULL);
2261 unlock_res_and_lock(lock);
2262 ldlm_reprocess_all(lock->l_resource);
2266 EXPORT_SYMBOL(ldlm_lock_downgrade);
2269 * Attempt to convert already granted lock to a different mode.
2271 * While lock conversion is not currently used, future client-side
2272 * optimizations could take advantage of it to avoid discarding cached
2275 struct ldlm_resource *ldlm_lock_convert(struct ldlm_lock *lock, int new_mode,
2278 struct list_head rpc_list;
2279 struct ldlm_resource *res;
2280 struct ldlm_namespace *ns;
2282 #ifdef HAVE_SERVER_SUPPORT
2284 struct sl_insert_point prev;
2286 struct ldlm_interval *node;
2289 INIT_LIST_HEAD(&rpc_list);
2290 /* Just return if mode is unchanged. */
2291 if (new_mode == lock->l_granted_mode) {
2292 *flags |= LDLM_FL_BLOCK_GRANTED;
2293 RETURN(lock->l_resource);
2296 /* I can't check the type of lock here because the bitlock of lock
2297 * is not held here, so do the allocation blindly. -jay */
2298 OBD_SLAB_ALLOC_PTR_GFP(node, ldlm_interval_slab, GFP_NOFS);
2299 if (node == NULL) /* Actually, this causes EDEADLOCK to be returned */
2302 LASSERTF((new_mode == LCK_PW && lock->l_granted_mode == LCK_PR),
2303 "new_mode %u, granted %u\n", new_mode, lock->l_granted_mode);
2305 lock_res_and_lock(lock);
2307 res = lock->l_resource;
2308 ns = ldlm_res_to_ns(res);
2310 #ifdef HAVE_SERVER_SUPPORT
2311 old_mode = lock->l_req_mode;
2313 lock->l_req_mode = new_mode;
2314 if (res->lr_type == LDLM_PLAIN || res->lr_type == LDLM_IBITS) {
2315 #ifdef HAVE_SERVER_SUPPORT
2316 /* remember the lock position where the lock might be
2317 * added back to the granted list later and also
2318 * remember the join mode for skiplist fixing. */
2319 prev.res_link = lock->l_res_link.prev;
2320 prev.mode_link = lock->l_sl_mode.prev;
2321 prev.policy_link = lock->l_sl_policy.prev;
2323 ldlm_resource_unlink_lock(lock);
2325 ldlm_resource_unlink_lock(lock);
2326 if (res->lr_type == LDLM_EXTENT) {
2327 /* FIXME: ugly code, I have to attach the lock to a
2328 * interval node again since perhaps it will be granted
2330 INIT_LIST_HEAD(&node->li_group);
2331 ldlm_interval_attach(node, lock);
2337 * Remove old lock from the pool before adding the lock with new
2338 * mode below in ->policy()
2340 ldlm_pool_del(&ns->ns_pool, lock);
2342 /* If this is a local resource, put it on the appropriate list. */
2343 if (ns_is_client(ldlm_res_to_ns(res))) {
2344 if (*flags & (LDLM_FL_BLOCK_CONV | LDLM_FL_BLOCK_GRANTED)) {
2345 ldlm_resource_add_lock(res, &res->lr_converting, lock);
2347 /* This should never happen, because of the way the
2348 * server handles conversions. */
2349 LDLM_ERROR(lock, "Erroneous flags %x on local lock\n",
2353 ldlm_grant_lock(lock, &rpc_list);
2355 /* FIXME: completion handling not with lr_lock held ! */
2356 if (lock->l_completion_ast)
2357 lock->l_completion_ast(lock, 0, NULL);
2359 #ifdef HAVE_SERVER_SUPPORT
2364 ldlm_processing_policy policy;
2365 policy = ldlm_processing_policy_table[res->lr_type];
2366 rc = policy(lock, &pflags, 0, &err, &rpc_list);
2367 if (rc == LDLM_ITER_STOP) {
2368 lock->l_req_mode = old_mode;
2369 if (res->lr_type == LDLM_EXTENT)
2370 ldlm_extent_add_lock(res, lock);
2372 ldlm_granted_list_add_lock(lock, &prev);
2376 *flags |= LDLM_FL_BLOCK_GRANTED;
2382 CERROR("This is client-side-only module, cannot handle "
2383 "LDLM_NAMESPACE_SERVER resource type lock.\n");
2387 unlock_res_and_lock(lock);
2390 ldlm_run_ast_work(ns, &rpc_list, LDLM_WORK_CP_AST);
2392 OBD_SLAB_FREE(node, ldlm_interval_slab, sizeof(*node));
2395 EXPORT_SYMBOL(ldlm_lock_convert);
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);