4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
20 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
21 * CA 95054 USA or visit www.sun.com if you need additional information or
27 * Copyright (c) 2002, 2010, Oracle and/or its affiliates. All rights reserved.
28 * Use is subject to license terms.
30 * Copyright (c) 2010, 2014, Intel Corporation.
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
36 * lustre/ldlm/ldlm_lock.c
38 * Author: Peter Braam <braam@clusterfs.com>
39 * Author: Phil Schwan <phil@clusterfs.com>
42 #define DEBUG_SUBSYSTEM S_LDLM
44 #include <libcfs/libcfs.h>
45 #include <obd_class.h>
46 #include "ldlm_internal.h"
49 char *ldlm_lockname[] = {
57 [LCK_GROUP] = "GROUP",
60 EXPORT_SYMBOL(ldlm_lockname);
62 char *ldlm_typename[] = {
64 [LDLM_EXTENT] = "EXT",
69 static ldlm_policy_wire_to_local_t ldlm_policy_wire_to_local[] = {
70 [LDLM_PLAIN - LDLM_MIN_TYPE] = ldlm_plain_policy_wire_to_local,
71 [LDLM_EXTENT - LDLM_MIN_TYPE] = ldlm_extent_policy_wire_to_local,
72 [LDLM_FLOCK - LDLM_MIN_TYPE] = ldlm_flock_policy_wire_to_local,
73 [LDLM_IBITS - LDLM_MIN_TYPE] = ldlm_ibits_policy_wire_to_local,
76 static ldlm_policy_local_to_wire_t ldlm_policy_local_to_wire[] = {
77 [LDLM_PLAIN - LDLM_MIN_TYPE] = ldlm_plain_policy_local_to_wire,
78 [LDLM_EXTENT - LDLM_MIN_TYPE] = ldlm_extent_policy_local_to_wire,
79 [LDLM_FLOCK - LDLM_MIN_TYPE] = ldlm_flock_policy_local_to_wire,
80 [LDLM_IBITS - LDLM_MIN_TYPE] = ldlm_ibits_policy_local_to_wire,
84 * Converts lock policy from local format to on the wire lock_desc format
86 void ldlm_convert_policy_to_wire(enum ldlm_type type,
87 const union ldlm_policy_data *lpolicy,
88 union ldlm_wire_policy_data *wpolicy)
90 ldlm_policy_local_to_wire_t convert;
92 convert = ldlm_policy_local_to_wire[type - LDLM_MIN_TYPE];
94 convert(lpolicy, wpolicy);
98 * Converts lock policy from on the wire lock_desc format to local format
100 void ldlm_convert_policy_to_local(struct obd_export *exp, enum ldlm_type type,
101 const union ldlm_wire_policy_data *wpolicy,
102 union ldlm_policy_data *lpolicy)
104 ldlm_policy_wire_to_local_t convert;
106 convert = ldlm_policy_wire_to_local[type - LDLM_MIN_TYPE];
108 convert(wpolicy, lpolicy);
111 char *ldlm_it2str(int it)
118 case (IT_OPEN | IT_CREAT):
133 CERROR("Unknown intent %d\n", it);
137 EXPORT_SYMBOL(ldlm_it2str);
139 extern struct kmem_cache *ldlm_lock_slab;
141 #ifdef HAVE_SERVER_SUPPORT
142 static ldlm_processing_policy ldlm_processing_policy_table[] = {
143 [LDLM_PLAIN] = ldlm_process_plain_lock,
144 [LDLM_EXTENT] = ldlm_process_extent_lock,
145 [LDLM_FLOCK] = ldlm_process_flock_lock,
146 [LDLM_IBITS] = ldlm_process_inodebits_lock,
149 ldlm_processing_policy ldlm_get_processing_policy(struct ldlm_resource *res)
151 return ldlm_processing_policy_table[res->lr_type];
153 EXPORT_SYMBOL(ldlm_get_processing_policy);
154 #endif /* HAVE_SERVER_SUPPORT */
156 void ldlm_register_intent(struct ldlm_namespace *ns, ldlm_res_policy arg)
160 EXPORT_SYMBOL(ldlm_register_intent);
163 * REFCOUNTED LOCK OBJECTS
168 * Get a reference on a lock.
170 * Lock refcounts, during creation:
171 * - one special one for allocation, dec'd only once in destroy
172 * - one for being a lock that's in-use
173 * - one for the addref associated with a new lock
175 struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock)
177 atomic_inc(&lock->l_refc);
180 EXPORT_SYMBOL(ldlm_lock_get);
183 * Release lock reference.
185 * Also frees the lock if it was last reference.
187 void ldlm_lock_put(struct ldlm_lock *lock)
191 LASSERT(lock->l_resource != LP_POISON);
192 LASSERT(atomic_read(&lock->l_refc) > 0);
193 if (atomic_dec_and_test(&lock->l_refc)) {
194 struct ldlm_resource *res;
197 "final lock_put on destroyed lock, freeing it.");
199 res = lock->l_resource;
200 LASSERT(ldlm_is_destroyed(lock));
201 LASSERT(list_empty(&lock->l_exp_list));
202 LASSERT(list_empty(&lock->l_res_link));
203 LASSERT(list_empty(&lock->l_pending_chain));
205 lprocfs_counter_decr(ldlm_res_to_ns(res)->ns_stats,
207 lu_ref_del(&res->lr_reference, "lock", lock);
208 ldlm_resource_putref(res);
209 lock->l_resource = NULL;
210 if (lock->l_export) {
211 class_export_lock_put(lock->l_export, lock);
212 lock->l_export = NULL;
215 if (lock->l_lvb_data != NULL)
216 OBD_FREE_LARGE(lock->l_lvb_data, lock->l_lvb_len);
218 ldlm_interval_free(ldlm_interval_detach(lock));
219 lu_ref_fini(&lock->l_reference);
220 OBD_FREE_RCU(lock, sizeof(*lock), &lock->l_handle);
225 EXPORT_SYMBOL(ldlm_lock_put);
228 * Removes LDLM lock \a lock from LRU. Assumes LRU is already locked.
230 int ldlm_lock_remove_from_lru_nolock(struct ldlm_lock *lock)
233 if (!list_empty(&lock->l_lru)) {
234 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
236 LASSERT(lock->l_resource->lr_type != LDLM_FLOCK);
237 list_del_init(&lock->l_lru);
238 LASSERT(ns->ns_nr_unused > 0);
246 * Removes LDLM lock \a lock from LRU. Obtains the LRU lock first.
248 * If \a last_use is non-zero, it will remove the lock from LRU only if
249 * it matches lock's l_last_used.
251 * \retval 0 if \a last_use is set, the lock is not in LRU list or \a last_use
252 * doesn't match lock's l_last_used;
253 * otherwise, the lock hasn't been in the LRU list.
254 * \retval 1 the lock was in LRU list and removed.
256 int ldlm_lock_remove_from_lru_check(struct ldlm_lock *lock, cfs_time_t last_use)
258 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
262 if (ldlm_is_ns_srv(lock)) {
263 LASSERT(list_empty(&lock->l_lru));
267 spin_lock(&ns->ns_lock);
268 if (last_use == 0 || last_use == lock->l_last_used)
269 rc = ldlm_lock_remove_from_lru_nolock(lock);
270 spin_unlock(&ns->ns_lock);
276 * Adds LDLM lock \a lock to namespace LRU. Assumes LRU is already locked.
278 void ldlm_lock_add_to_lru_nolock(struct ldlm_lock *lock)
280 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
282 lock->l_last_used = cfs_time_current();
283 LASSERT(list_empty(&lock->l_lru));
284 LASSERT(lock->l_resource->lr_type != LDLM_FLOCK);
285 list_add_tail(&lock->l_lru, &ns->ns_unused_list);
286 ldlm_clear_skipped(lock);
287 LASSERT(ns->ns_nr_unused >= 0);
292 * Adds LDLM lock \a lock to namespace LRU. Obtains necessary LRU locks
295 void ldlm_lock_add_to_lru(struct ldlm_lock *lock)
297 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
300 spin_lock(&ns->ns_lock);
301 ldlm_lock_add_to_lru_nolock(lock);
302 spin_unlock(&ns->ns_lock);
307 * Moves LDLM lock \a lock that is already in namespace LRU to the tail of
308 * the LRU. Performs necessary LRU locking
310 void ldlm_lock_touch_in_lru(struct ldlm_lock *lock)
312 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
315 if (ldlm_is_ns_srv(lock)) {
316 LASSERT(list_empty(&lock->l_lru));
321 spin_lock(&ns->ns_lock);
322 if (!list_empty(&lock->l_lru)) {
323 ldlm_lock_remove_from_lru_nolock(lock);
324 ldlm_lock_add_to_lru_nolock(lock);
326 spin_unlock(&ns->ns_lock);
331 * Helper to destroy a locked lock.
333 * Used by ldlm_lock_destroy and ldlm_lock_destroy_nolock
334 * Must be called with l_lock and lr_lock held.
336 * Does not actually free the lock data, but rather marks the lock as
337 * destroyed by setting l_destroyed field in the lock to 1. Destroys a
338 * handle->lock association too, so that the lock can no longer be found
339 * and removes the lock from LRU list. Actual lock freeing occurs when
340 * last lock reference goes away.
342 * Original comment (of some historical value):
343 * This used to have a 'strict' flag, which recovery would use to mark an
344 * in-use lock as needing-to-die. Lest I am ever tempted to put it back, I
345 * shall explain why it's gone: with the new hash table scheme, once you call
346 * ldlm_lock_destroy, you can never drop your final references on this lock.
347 * Because it's not in the hash table anymore. -phil
349 static int ldlm_lock_destroy_internal(struct ldlm_lock *lock)
353 if (lock->l_readers || lock->l_writers) {
354 LDLM_ERROR(lock, "lock still has references");
358 if (!list_empty(&lock->l_res_link)) {
359 LDLM_ERROR(lock, "lock still on resource");
363 if (ldlm_is_destroyed(lock)) {
364 LASSERT(list_empty(&lock->l_lru));
368 ldlm_set_destroyed(lock);
370 if (lock->l_export && lock->l_export->exp_lock_hash) {
371 /* NB: it's safe to call cfs_hash_del() even lock isn't
372 * in exp_lock_hash. */
373 /* In the function below, .hs_keycmp resolves to
374 * ldlm_export_lock_keycmp() */
375 /* coverity[overrun-buffer-val] */
376 cfs_hash_del(lock->l_export->exp_lock_hash,
377 &lock->l_remote_handle, &lock->l_exp_hash);
380 ldlm_lock_remove_from_lru(lock);
381 class_handle_unhash(&lock->l_handle);
384 /* Wake anyone waiting for this lock */
385 /* FIXME: I should probably add yet another flag, instead of using
386 * l_export to only call this on clients */
388 class_export_put(lock->l_export);
389 lock->l_export = NULL;
390 if (lock->l_export && lock->l_completion_ast)
391 lock->l_completion_ast(lock, 0);
398 * Destroys a LDLM lock \a lock. Performs necessary locking first.
400 void ldlm_lock_destroy(struct ldlm_lock *lock)
404 lock_res_and_lock(lock);
405 first = ldlm_lock_destroy_internal(lock);
406 unlock_res_and_lock(lock);
408 /* drop reference from hashtable only for first destroy */
410 lu_ref_del(&lock->l_reference, "hash", lock);
411 LDLM_LOCK_RELEASE(lock);
417 * Destroys a LDLM lock \a lock that is already locked.
419 void ldlm_lock_destroy_nolock(struct ldlm_lock *lock)
423 first = ldlm_lock_destroy_internal(lock);
424 /* drop reference from hashtable only for first destroy */
426 lu_ref_del(&lock->l_reference, "hash", lock);
427 LDLM_LOCK_RELEASE(lock);
432 /* this is called by portals_handle2object with the handle lock taken */
433 static void lock_handle_addref(void *lock)
435 LDLM_LOCK_GET((struct ldlm_lock *)lock);
438 static void lock_handle_free(void *lock, int size)
440 LASSERT(size == sizeof(struct ldlm_lock));
441 OBD_SLAB_FREE(lock, ldlm_lock_slab, size);
444 static struct portals_handle_ops lock_handle_ops = {
445 .hop_addref = lock_handle_addref,
446 .hop_free = lock_handle_free,
451 * Allocate and initialize new lock structure.
453 * usage: pass in a resource on which you have done ldlm_resource_get
454 * new lock will take over the refcount.
455 * returns: lock with refcount 2 - one for current caller and one for remote
457 static struct ldlm_lock *ldlm_lock_new(struct ldlm_resource *resource)
459 struct ldlm_lock *lock;
462 if (resource == NULL)
465 OBD_SLAB_ALLOC_PTR_GFP(lock, ldlm_lock_slab, GFP_NOFS);
469 spin_lock_init(&lock->l_lock);
470 lock->l_resource = resource;
471 lu_ref_add(&resource->lr_reference, "lock", lock);
473 atomic_set(&lock->l_refc, 2);
474 INIT_LIST_HEAD(&lock->l_res_link);
475 INIT_LIST_HEAD(&lock->l_lru);
476 INIT_LIST_HEAD(&lock->l_pending_chain);
477 INIT_LIST_HEAD(&lock->l_bl_ast);
478 INIT_LIST_HEAD(&lock->l_cp_ast);
479 INIT_LIST_HEAD(&lock->l_rk_ast);
480 init_waitqueue_head(&lock->l_waitq);
481 lock->l_blocking_lock = NULL;
482 INIT_LIST_HEAD(&lock->l_sl_mode);
483 INIT_LIST_HEAD(&lock->l_sl_policy);
484 INIT_HLIST_NODE(&lock->l_exp_hash);
485 INIT_HLIST_NODE(&lock->l_exp_flock_hash);
487 lprocfs_counter_incr(ldlm_res_to_ns(resource)->ns_stats,
489 INIT_LIST_HEAD(&lock->l_handle.h_link);
490 class_handle_hash(&lock->l_handle, &lock_handle_ops);
492 lu_ref_init(&lock->l_reference);
493 lu_ref_add(&lock->l_reference, "hash", lock);
494 lock->l_callback_timeout = 0;
496 #if LUSTRE_TRACKS_LOCK_EXP_REFS
497 INIT_LIST_HEAD(&lock->l_exp_refs_link);
498 lock->l_exp_refs_nr = 0;
499 lock->l_exp_refs_target = NULL;
501 INIT_LIST_HEAD(&lock->l_exp_list);
507 * Moves LDLM lock \a lock to another resource.
508 * This is used on client when server returns some other lock than requested
509 * (typically as a result of intent operation)
511 int ldlm_lock_change_resource(struct ldlm_namespace *ns, struct ldlm_lock *lock,
512 const struct ldlm_res_id *new_resid)
514 struct ldlm_resource *oldres = lock->l_resource;
515 struct ldlm_resource *newres;
519 LASSERT(ns_is_client(ns));
521 lock_res_and_lock(lock);
522 if (memcmp(new_resid, &lock->l_resource->lr_name,
523 sizeof(lock->l_resource->lr_name)) == 0) {
525 unlock_res_and_lock(lock);
529 LASSERT(new_resid->name[0] != 0);
531 /* This function assumes that the lock isn't on any lists */
532 LASSERT(list_empty(&lock->l_res_link));
534 type = oldres->lr_type;
535 unlock_res_and_lock(lock);
537 newres = ldlm_resource_get(ns, NULL, new_resid, type, 1);
539 RETURN(PTR_ERR(newres));
541 lu_ref_add(&newres->lr_reference, "lock", lock);
543 * To flip the lock from the old to the new resource, lock, oldres and
544 * newres have to be locked. Resource spin-locks are nested within
545 * lock->l_lock, and are taken in the memory address order to avoid
548 spin_lock(&lock->l_lock);
549 oldres = lock->l_resource;
550 if (oldres < newres) {
552 lock_res_nested(newres, LRT_NEW);
555 lock_res_nested(oldres, LRT_NEW);
557 LASSERT(memcmp(new_resid, &oldres->lr_name,
558 sizeof oldres->lr_name) != 0);
559 lock->l_resource = newres;
561 unlock_res_and_lock(lock);
563 /* ...and the flowers are still standing! */
564 lu_ref_del(&oldres->lr_reference, "lock", lock);
565 ldlm_resource_putref(oldres);
570 /** \defgroup ldlm_handles LDLM HANDLES
571 * Ways to get hold of locks without any addresses.
576 * Fills in handle for LDLM lock \a lock into supplied \a lockh
577 * Does not take any references.
579 void ldlm_lock2handle(const struct ldlm_lock *lock, struct lustre_handle *lockh)
581 lockh->cookie = lock->l_handle.h_cookie;
583 EXPORT_SYMBOL(ldlm_lock2handle);
586 * Obtain a lock reference by handle.
588 * if \a flags: atomically get the lock and set the flags.
589 * Return NULL if flag already set
591 struct ldlm_lock *__ldlm_handle2lock(const struct lustre_handle *handle,
594 struct ldlm_lock *lock;
599 lock = class_handle2object(handle->cookie, NULL);
603 /* It's unlikely but possible that someone marked the lock as
604 * destroyed after we did handle2object on it */
605 if ((flags == 0) && !ldlm_is_destroyed(lock)) {
606 lu_ref_add(&lock->l_reference, "handle", current);
610 lock_res_and_lock(lock);
612 LASSERT(lock->l_resource != NULL);
614 lu_ref_add_atomic(&lock->l_reference, "handle", current);
615 if (unlikely(ldlm_is_destroyed(lock))) {
616 unlock_res_and_lock(lock);
617 CDEBUG(D_INFO, "lock already destroyed: lock %p\n", lock);
622 /* If we're setting flags, make sure none of them are already set. */
624 if ((lock->l_flags & flags) != 0) {
625 unlock_res_and_lock(lock);
630 lock->l_flags |= flags;
633 unlock_res_and_lock(lock);
636 EXPORT_SYMBOL(__ldlm_handle2lock);
637 /** @} ldlm_handles */
640 * Fill in "on the wire" representation for given LDLM lock into supplied
641 * lock descriptor \a desc structure.
643 void ldlm_lock2desc(struct ldlm_lock *lock, struct ldlm_lock_desc *desc)
645 ldlm_res2desc(lock->l_resource, &desc->l_resource);
646 desc->l_req_mode = lock->l_req_mode;
647 desc->l_granted_mode = lock->l_granted_mode;
648 ldlm_convert_policy_to_wire(lock->l_resource->lr_type,
649 &lock->l_policy_data,
650 &desc->l_policy_data);
654 * Add a lock to list of conflicting locks to send AST to.
656 * Only add if we have not sent a blocking AST to the lock yet.
658 static void ldlm_add_bl_work_item(struct ldlm_lock *lock, struct ldlm_lock *new,
659 struct list_head *work_list)
661 if (!ldlm_is_ast_sent(lock)) {
662 LDLM_DEBUG(lock, "lock incompatible; sending blocking AST.");
663 ldlm_set_ast_sent(lock);
664 /* If the enqueuing client said so, tell the AST recipient to
665 * discard dirty data, rather than writing back. */
666 if (ldlm_is_ast_discard_data(new))
667 ldlm_set_discard_data(lock);
668 LASSERT(list_empty(&lock->l_bl_ast));
669 list_add(&lock->l_bl_ast, work_list);
671 LASSERT(lock->l_blocking_lock == NULL);
672 lock->l_blocking_lock = LDLM_LOCK_GET(new);
677 * Add a lock to list of just granted locks to send completion AST to.
679 static void ldlm_add_cp_work_item(struct ldlm_lock *lock,
680 struct list_head *work_list)
682 if (!ldlm_is_cp_reqd(lock)) {
683 ldlm_set_cp_reqd(lock);
684 LDLM_DEBUG(lock, "lock granted; sending completion AST.");
685 LASSERT(list_empty(&lock->l_cp_ast));
686 list_add(&lock->l_cp_ast, work_list);
692 * Aggregator function to add AST work items into a list. Determines
693 * what sort of an AST work needs to be done and calls the proper
695 * Must be called with lr_lock held.
697 void ldlm_add_ast_work_item(struct ldlm_lock *lock, struct ldlm_lock *new,
698 struct list_head *work_list)
701 check_res_locked(lock->l_resource);
703 ldlm_add_bl_work_item(lock, new, work_list);
705 ldlm_add_cp_work_item(lock, work_list);
710 * Add specified reader/writer reference to LDLM lock with handle \a lockh.
711 * r/w reference type is determined by \a mode
712 * Calls ldlm_lock_addref_internal.
714 void ldlm_lock_addref(struct lustre_handle *lockh, enum ldlm_mode mode)
716 struct ldlm_lock *lock;
718 lock = ldlm_handle2lock(lockh);
719 LASSERTF(lock != NULL, "Non-existing lock: "LPX64"\n", lockh->cookie);
720 ldlm_lock_addref_internal(lock, mode);
723 EXPORT_SYMBOL(ldlm_lock_addref);
727 * Add specified reader/writer reference to LDLM lock \a lock.
728 * r/w reference type is determined by \a mode
729 * Removes lock from LRU if it is there.
730 * Assumes the LDLM lock is already locked.
732 void ldlm_lock_addref_internal_nolock(struct ldlm_lock *lock,
735 ldlm_lock_remove_from_lru(lock);
736 if (mode & (LCK_NL | LCK_CR | LCK_PR)) {
738 lu_ref_add_atomic(&lock->l_reference, "reader", lock);
740 if (mode & (LCK_EX | LCK_CW | LCK_PW | LCK_GROUP | LCK_COS)) {
742 lu_ref_add_atomic(&lock->l_reference, "writer", lock);
745 lu_ref_add_atomic(&lock->l_reference, "user", lock);
746 LDLM_DEBUG(lock, "ldlm_lock_addref(%s)", ldlm_lockname[mode]);
750 * Attempts to add reader/writer reference to a lock with handle \a lockh, and
751 * fails if lock is already LDLM_FL_CBPENDING or destroyed.
753 * \retval 0 success, lock was addref-ed
755 * \retval -EAGAIN lock is being canceled.
757 int ldlm_lock_addref_try(struct lustre_handle *lockh, enum ldlm_mode mode)
759 struct ldlm_lock *lock;
763 lock = ldlm_handle2lock(lockh);
765 lock_res_and_lock(lock);
766 if (lock->l_readers != 0 || lock->l_writers != 0 ||
767 !ldlm_is_cbpending(lock)) {
768 ldlm_lock_addref_internal_nolock(lock, mode);
771 unlock_res_and_lock(lock);
776 EXPORT_SYMBOL(ldlm_lock_addref_try);
779 * Add specified reader/writer reference to LDLM lock \a lock.
780 * Locks LDLM lock and calls ldlm_lock_addref_internal_nolock to do the work.
781 * Only called for local locks.
783 void ldlm_lock_addref_internal(struct ldlm_lock *lock, enum ldlm_mode mode)
785 lock_res_and_lock(lock);
786 ldlm_lock_addref_internal_nolock(lock, mode);
787 unlock_res_and_lock(lock);
791 * Removes reader/writer reference for LDLM lock \a lock.
792 * Assumes LDLM lock is already locked.
793 * only called in ldlm_flock_destroy and for local locks.
794 * Does NOT add lock to LRU if no r/w references left to accomodate flock locks
795 * that cannot be placed in LRU.
797 void ldlm_lock_decref_internal_nolock(struct ldlm_lock *lock,
800 LDLM_DEBUG(lock, "ldlm_lock_decref(%s)", ldlm_lockname[mode]);
801 if (mode & (LCK_NL | LCK_CR | LCK_PR)) {
802 LASSERT(lock->l_readers > 0);
803 lu_ref_del(&lock->l_reference, "reader", lock);
806 if (mode & (LCK_EX | LCK_CW | LCK_PW | LCK_GROUP | LCK_COS)) {
807 LASSERT(lock->l_writers > 0);
808 lu_ref_del(&lock->l_reference, "writer", lock);
812 lu_ref_del(&lock->l_reference, "user", lock);
813 LDLM_LOCK_RELEASE(lock); /* matches the LDLM_LOCK_GET() in addref */
817 * Removes reader/writer reference for LDLM lock \a lock.
818 * Locks LDLM lock first.
819 * If the lock is determined to be client lock on a client and r/w refcount
820 * drops to zero and the lock is not blocked, the lock is added to LRU lock
822 * For blocked LDLM locks if r/w count drops to zero, blocking_ast is called.
824 void ldlm_lock_decref_internal(struct ldlm_lock *lock, enum ldlm_mode mode)
826 struct ldlm_namespace *ns;
829 lock_res_and_lock(lock);
831 ns = ldlm_lock_to_ns(lock);
833 ldlm_lock_decref_internal_nolock(lock, mode);
835 if (ldlm_is_local(lock) &&
836 !lock->l_readers && !lock->l_writers) {
837 /* If this is a local lock on a server namespace and this was
838 * the last reference, cancel the lock. */
839 CDEBUG(D_INFO, "forcing cancel of local lock\n");
840 ldlm_set_cbpending(lock);
843 if (!lock->l_readers && !lock->l_writers &&
844 (ldlm_is_cbpending(lock) || lock->l_req_mode == LCK_GROUP)) {
845 /* If we received a blocked AST and this was the last reference,
847 * Group locks are special:
848 * They must not go in LRU, but they are not called back
849 * like non-group locks, instead they are manually released.
850 * They have an l_writers reference which they keep until
851 * they are manually released, so we remove them when they have
852 * no more reader or writer references. - LU-6368 */
853 if (ldlm_is_ns_srv(lock) && lock->l_export)
854 CERROR("FL_CBPENDING set on non-local lock--just a "
857 LDLM_DEBUG(lock, "final decref done on cbpending lock");
859 LDLM_LOCK_GET(lock); /* dropped by bl thread */
860 ldlm_lock_remove_from_lru(lock);
861 unlock_res_and_lock(lock);
863 if (ldlm_is_fail_loc(lock))
864 OBD_RACE(OBD_FAIL_LDLM_CP_BL_RACE);
866 if (ldlm_is_atomic_cb(lock) ||
867 ldlm_bl_to_thread_lock(ns, NULL, lock) != 0)
868 ldlm_handle_bl_callback(ns, NULL, lock);
869 } else if (ns_is_client(ns) &&
870 !lock->l_readers && !lock->l_writers &&
871 !ldlm_is_no_lru(lock) &&
872 !ldlm_is_bl_ast(lock)) {
874 LDLM_DEBUG(lock, "add lock into lru list");
876 /* If this is a client-side namespace and this was the last
877 * reference, put it on the LRU. */
878 ldlm_lock_add_to_lru(lock);
879 unlock_res_and_lock(lock);
881 if (ldlm_is_fail_loc(lock))
882 OBD_RACE(OBD_FAIL_LDLM_CP_BL_RACE);
884 /* Call ldlm_cancel_lru() only if EARLY_CANCEL and LRU RESIZE
885 * are not supported by the server, otherwise, it is done on
887 if (!exp_connect_cancelset(lock->l_conn_export) &&
888 !ns_connect_lru_resize(ns))
889 ldlm_cancel_lru(ns, 0, LCF_ASYNC, 0);
891 LDLM_DEBUG(lock, "do not add lock into lru list");
892 unlock_res_and_lock(lock);
899 * Decrease reader/writer refcount for LDLM lock with handle \a lockh
901 void ldlm_lock_decref(struct lustre_handle *lockh, enum ldlm_mode mode)
903 struct ldlm_lock *lock = __ldlm_handle2lock(lockh, 0);
904 LASSERTF(lock != NULL, "Non-existing lock: "LPX64"\n", lockh->cookie);
905 ldlm_lock_decref_internal(lock, mode);
908 EXPORT_SYMBOL(ldlm_lock_decref);
911 * Decrease reader/writer refcount for LDLM lock with handle
912 * \a lockh and mark it for subsequent cancellation once r/w refcount
913 * drops to zero instead of putting into LRU.
916 void ldlm_lock_decref_and_cancel(struct lustre_handle *lockh,
919 struct ldlm_lock *lock = __ldlm_handle2lock(lockh, 0);
922 LASSERT(lock != NULL);
924 LDLM_DEBUG(lock, "ldlm_lock_decref(%s)", ldlm_lockname[mode]);
925 lock_res_and_lock(lock);
926 ldlm_set_cbpending(lock);
927 unlock_res_and_lock(lock);
928 ldlm_lock_decref_internal(lock, mode);
931 EXPORT_SYMBOL(ldlm_lock_decref_and_cancel);
933 struct sl_insert_point {
934 struct list_head *res_link;
935 struct list_head *mode_link;
936 struct list_head *policy_link;
940 * Finds a position to insert the new lock into granted lock list.
942 * Used for locks eligible for skiplist optimization.
945 * queue [input]: the granted list where search acts on;
946 * req [input]: the lock whose position to be located;
947 * prev [output]: positions within 3 lists to insert @req to
951 * - ldlm_grant_lock_with_skiplist
953 static void search_granted_lock(struct list_head *queue,
954 struct ldlm_lock *req,
955 struct sl_insert_point *prev)
957 struct list_head *tmp;
958 struct ldlm_lock *lock, *mode_end, *policy_end;
961 list_for_each(tmp, queue) {
962 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
964 mode_end = list_entry(lock->l_sl_mode.prev,
965 struct ldlm_lock, l_sl_mode);
967 if (lock->l_req_mode != req->l_req_mode) {
968 /* jump to last lock of mode group */
969 tmp = &mode_end->l_res_link;
973 /* suitable mode group is found */
974 if (lock->l_resource->lr_type == LDLM_PLAIN) {
975 /* insert point is last lock of the mode group */
976 prev->res_link = &mode_end->l_res_link;
977 prev->mode_link = &mode_end->l_sl_mode;
978 prev->policy_link = &req->l_sl_policy;
981 } else if (lock->l_resource->lr_type == LDLM_IBITS) {
984 list_entry(lock->l_sl_policy.prev,
988 if (lock->l_policy_data.l_inodebits.bits ==
989 req->l_policy_data.l_inodebits.bits) {
990 /* insert point is last lock of
991 * the policy group */
993 &policy_end->l_res_link;
995 &policy_end->l_sl_mode;
997 &policy_end->l_sl_policy;
1002 if (policy_end == mode_end)
1003 /* done with mode group */
1006 /* go to next policy group within mode group */
1007 tmp = policy_end->l_res_link.next;
1008 lock = list_entry(tmp, struct ldlm_lock,
1010 } /* loop over policy groups within the mode group */
1012 /* insert point is last lock of the mode group,
1013 * new policy group is started */
1014 prev->res_link = &mode_end->l_res_link;
1015 prev->mode_link = &mode_end->l_sl_mode;
1016 prev->policy_link = &req->l_sl_policy;
1020 LDLM_ERROR(lock,"is not LDLM_PLAIN or LDLM_IBITS lock");
1025 /* insert point is last lock on the queue,
1026 * new mode group and new policy group are started */
1027 prev->res_link = queue->prev;
1028 prev->mode_link = &req->l_sl_mode;
1029 prev->policy_link = &req->l_sl_policy;
1035 * Add a lock into resource granted list after a position described by
1038 static void ldlm_granted_list_add_lock(struct ldlm_lock *lock,
1039 struct sl_insert_point *prev)
1041 struct ldlm_resource *res = lock->l_resource;
1044 check_res_locked(res);
1046 ldlm_resource_dump(D_INFO, res);
1047 LDLM_DEBUG(lock, "About to add lock:");
1049 if (ldlm_is_destroyed(lock)) {
1050 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
1054 LASSERT(list_empty(&lock->l_res_link));
1055 LASSERT(list_empty(&lock->l_sl_mode));
1056 LASSERT(list_empty(&lock->l_sl_policy));
1059 * lock->link == prev->link means lock is first starting the group.
1060 * Don't re-add to itself to suppress kernel warnings.
1062 if (&lock->l_res_link != prev->res_link)
1063 list_add(&lock->l_res_link, prev->res_link);
1064 if (&lock->l_sl_mode != prev->mode_link)
1065 list_add(&lock->l_sl_mode, prev->mode_link);
1066 if (&lock->l_sl_policy != prev->policy_link)
1067 list_add(&lock->l_sl_policy, prev->policy_link);
1073 * Add a lock to granted list on a resource maintaining skiplist
1076 static void ldlm_grant_lock_with_skiplist(struct ldlm_lock *lock)
1078 struct sl_insert_point prev;
1081 LASSERT(lock->l_req_mode == lock->l_granted_mode);
1083 search_granted_lock(&lock->l_resource->lr_granted, lock, &prev);
1084 ldlm_granted_list_add_lock(lock, &prev);
1089 * Perform lock granting bookkeeping.
1091 * Includes putting the lock into granted list and updating lock mode.
1093 * - ldlm_lock_enqueue
1094 * - ldlm_reprocess_queue
1095 * - ldlm_lock_convert
1097 * must be called with lr_lock held
1099 void ldlm_grant_lock(struct ldlm_lock *lock, struct list_head *work_list)
1101 struct ldlm_resource *res = lock->l_resource;
1104 check_res_locked(res);
1106 lock->l_granted_mode = lock->l_req_mode;
1108 if (work_list && lock->l_completion_ast != NULL)
1109 ldlm_add_ast_work_item(lock, NULL, work_list);
1111 /* We should not add locks to granted list in the following cases:
1112 * - this is an UNLOCK but not a real lock;
1113 * - this is a TEST lock;
1114 * - this is a F_CANCELLK lock (async flock has req_mode == 0)
1115 * - this is a deadlock (flock cannot be granted) */
1116 if (lock->l_req_mode == 0 ||
1117 lock->l_req_mode == LCK_NL ||
1118 ldlm_is_test_lock(lock) ||
1119 ldlm_is_flock_deadlock(lock))
1122 if (res->lr_type == LDLM_PLAIN || res->lr_type == LDLM_IBITS)
1123 ldlm_grant_lock_with_skiplist(lock);
1124 else if (res->lr_type == LDLM_EXTENT)
1125 ldlm_extent_add_lock(res, lock);
1127 ldlm_resource_add_lock(res, &res->lr_granted, lock);
1129 ldlm_pool_add(&ldlm_res_to_ns(res)->ns_pool, lock);
1134 * Describe the overlap between two locks. itree_overlap_cb data.
1136 struct lock_match_data {
1137 struct ldlm_lock *lmd_old;
1138 struct ldlm_lock *lmd_lock;
1139 enum ldlm_mode *lmd_mode;
1140 union ldlm_policy_data *lmd_policy;
1146 * Check if the given @lock meets the criteria for a match.
1147 * A reference on the lock is taken if matched.
1149 * \param lock test-against this lock
1150 * \param data parameters
1152 static int lock_matches(struct ldlm_lock *lock, struct lock_match_data *data)
1154 union ldlm_policy_data *lpol = &lock->l_policy_data;
1155 enum ldlm_mode match;
1157 if (lock == data->lmd_old)
1158 return INTERVAL_ITER_STOP;
1160 /* Check if this lock can be matched.
1161 * Used by LU-2919(exclusive open) for open lease lock */
1162 if (ldlm_is_excl(lock))
1163 return INTERVAL_ITER_CONT;
1165 /* llite sometimes wants to match locks that will be
1166 * canceled when their users drop, but we allow it to match
1167 * if it passes in CBPENDING and the lock still has users.
1168 * this is generally only going to be used by children
1169 * whose parents already hold a lock so forward progress
1170 * can still happen. */
1171 if (ldlm_is_cbpending(lock) &&
1172 !(data->lmd_flags & LDLM_FL_CBPENDING))
1173 return INTERVAL_ITER_CONT;
1174 if (!data->lmd_unref && ldlm_is_cbpending(lock) &&
1175 lock->l_readers == 0 && lock->l_writers == 0)
1176 return INTERVAL_ITER_CONT;
1178 if (!(lock->l_req_mode & *data->lmd_mode))
1179 return INTERVAL_ITER_CONT;
1180 match = lock->l_req_mode;
1182 switch (lock->l_resource->lr_type) {
1184 if (lpol->l_extent.start > data->lmd_policy->l_extent.start ||
1185 lpol->l_extent.end < data->lmd_policy->l_extent.end)
1186 return INTERVAL_ITER_CONT;
1188 if (unlikely(match == LCK_GROUP) &&
1189 data->lmd_policy->l_extent.gid != LDLM_GID_ANY &&
1190 lpol->l_extent.gid != data->lmd_policy->l_extent.gid)
1191 return INTERVAL_ITER_CONT;
1194 /* We match if we have existing lock with same or wider set
1196 if ((lpol->l_inodebits.bits &
1197 data->lmd_policy->l_inodebits.bits) !=
1198 data->lmd_policy->l_inodebits.bits)
1199 return INTERVAL_ITER_CONT;
1205 /* We match if we have existing lock with same or wider set
1207 if (!data->lmd_unref && LDLM_HAVE_MASK(lock, GONE))
1208 return INTERVAL_ITER_CONT;
1210 if ((data->lmd_flags & LDLM_FL_LOCAL_ONLY) &&
1211 !ldlm_is_local(lock))
1212 return INTERVAL_ITER_CONT;
1214 if (data->lmd_flags & LDLM_FL_TEST_LOCK) {
1215 LDLM_LOCK_GET(lock);
1216 ldlm_lock_touch_in_lru(lock);
1218 ldlm_lock_addref_internal_nolock(lock, match);
1221 *data->lmd_mode = match;
1222 data->lmd_lock = lock;
1224 return INTERVAL_ITER_STOP;
1227 static unsigned int itree_overlap_cb(struct interval_node *in, void *args)
1229 struct ldlm_interval *node = to_ldlm_interval(in);
1230 struct lock_match_data *data = args;
1231 struct ldlm_lock *lock;
1234 list_for_each_entry(lock, &node->li_group, l_sl_policy) {
1235 rc = lock_matches(lock, data);
1236 if (rc == INTERVAL_ITER_STOP)
1237 return INTERVAL_ITER_STOP;
1239 return INTERVAL_ITER_CONT;
1243 * Search for a lock with given parameters in interval trees.
1245 * \param res search for a lock in this resource
1246 * \param data parameters
1248 * \retval a referenced lock or NULL.
1250 static struct ldlm_lock *search_itree(struct ldlm_resource *res,
1251 struct lock_match_data *data)
1253 struct interval_node_extent ext = {
1254 .start = data->lmd_policy->l_extent.start,
1255 .end = data->lmd_policy->l_extent.end
1259 for (idx = 0; idx < LCK_MODE_NUM; idx++) {
1260 struct ldlm_interval_tree *tree = &res->lr_itree[idx];
1262 if (tree->lit_root == NULL)
1265 if (!(tree->lit_mode & *data->lmd_mode))
1268 interval_search(tree->lit_root, &ext,
1269 itree_overlap_cb, data);
1271 return data->lmd_lock;
1276 * Search for a lock with given properties in a queue.
1278 * \param queue search for a lock in this queue
1279 * \param data parameters
1281 * \retval a referenced lock or NULL.
1283 static struct ldlm_lock *search_queue(struct list_head *queue,
1284 struct lock_match_data *data)
1286 struct ldlm_lock *lock;
1289 list_for_each_entry(lock, queue, l_res_link) {
1290 rc = lock_matches(lock, data);
1291 if (rc == INTERVAL_ITER_STOP)
1292 return data->lmd_lock;
1297 void ldlm_lock_fail_match_locked(struct ldlm_lock *lock)
1299 if ((lock->l_flags & LDLM_FL_FAIL_NOTIFIED) == 0) {
1300 lock->l_flags |= LDLM_FL_FAIL_NOTIFIED;
1301 wake_up_all(&lock->l_waitq);
1304 EXPORT_SYMBOL(ldlm_lock_fail_match_locked);
1306 void ldlm_lock_fail_match(struct ldlm_lock *lock)
1308 lock_res_and_lock(lock);
1309 ldlm_lock_fail_match_locked(lock);
1310 unlock_res_and_lock(lock);
1314 * Mark lock as "matchable" by OST.
1316 * Used to prevent certain races in LOV/OSC where the lock is granted, but LVB
1318 * Assumes LDLM lock is already locked.
1320 void ldlm_lock_allow_match_locked(struct ldlm_lock *lock)
1322 ldlm_set_lvb_ready(lock);
1323 wake_up_all(&lock->l_waitq);
1325 EXPORT_SYMBOL(ldlm_lock_allow_match_locked);
1328 * Mark lock as "matchable" by OST.
1329 * Locks the lock and then \see ldlm_lock_allow_match_locked
1331 void ldlm_lock_allow_match(struct ldlm_lock *lock)
1333 lock_res_and_lock(lock);
1334 ldlm_lock_allow_match_locked(lock);
1335 unlock_res_and_lock(lock);
1337 EXPORT_SYMBOL(ldlm_lock_allow_match);
1340 * Attempt to find a lock with specified properties.
1342 * Typically returns a reference to matched lock unless LDLM_FL_TEST_LOCK is
1345 * Can be called in two ways:
1347 * If 'ns' is NULL, then lockh describes an existing lock that we want to look
1348 * for a duplicate of.
1350 * Otherwise, all of the fields must be filled in, to match against.
1352 * If 'flags' contains LDLM_FL_LOCAL_ONLY, then only match local locks on the
1353 * server (ie, connh is NULL)
1354 * If 'flags' contains LDLM_FL_BLOCK_GRANTED, then only locks on the granted
1355 * list will be considered
1356 * If 'flags' contains LDLM_FL_CBPENDING, then locks that have been marked
1357 * to be canceled can still be matched as long as they still have reader
1358 * or writer refernces
1359 * If 'flags' contains LDLM_FL_TEST_LOCK, then don't actually reference a lock,
1360 * just tell us if we would have matched.
1362 * \retval 1 if it finds an already-existing lock that is compatible; in this
1363 * case, lockh is filled in with a addref()ed lock
1365 * We also check security context, and if that fails we simply return 0 (to
1366 * keep caller code unchanged), the context failure will be discovered by
1367 * caller sometime later.
1369 enum ldlm_mode ldlm_lock_match(struct ldlm_namespace *ns, __u64 flags,
1370 const struct ldlm_res_id *res_id,
1371 enum ldlm_type type,
1372 union ldlm_policy_data *policy,
1373 enum ldlm_mode mode,
1374 struct lustre_handle *lockh, int unref)
1376 struct lock_match_data data = {
1380 .lmd_policy = policy,
1384 struct ldlm_resource *res;
1385 struct ldlm_lock *lock;
1390 data.lmd_old = ldlm_handle2lock(lockh);
1391 LASSERT(data.lmd_old != NULL);
1393 ns = ldlm_lock_to_ns(data.lmd_old);
1394 res_id = &data.lmd_old->l_resource->lr_name;
1395 type = data.lmd_old->l_resource->lr_type;
1396 *data.lmd_mode = data.lmd_old->l_req_mode;
1399 res = ldlm_resource_get(ns, NULL, res_id, type, 0);
1401 LASSERT(data.lmd_old == NULL);
1405 LDLM_RESOURCE_ADDREF(res);
1408 if (res->lr_type == LDLM_EXTENT)
1409 lock = search_itree(res, &data);
1411 lock = search_queue(&res->lr_granted, &data);
1414 if (flags & LDLM_FL_BLOCK_GRANTED)
1416 lock = search_queue(&res->lr_converting, &data);
1419 lock = search_queue(&res->lr_waiting, &data);
1426 LDLM_RESOURCE_DELREF(res);
1427 ldlm_resource_putref(res);
1430 ldlm_lock2handle(lock, lockh);
1431 if ((flags & LDLM_FL_LVB_READY) &&
1432 (!ldlm_is_lvb_ready(lock))) {
1433 __u64 wait_flags = LDLM_FL_LVB_READY |
1434 LDLM_FL_DESTROYED | LDLM_FL_FAIL_NOTIFIED;
1435 struct l_wait_info lwi;
1436 if (lock->l_completion_ast) {
1437 int err = lock->l_completion_ast(lock,
1438 LDLM_FL_WAIT_NOREPROC,
1441 if (flags & LDLM_FL_TEST_LOCK)
1442 LDLM_LOCK_RELEASE(lock);
1444 ldlm_lock_decref_internal(lock,
1451 lwi = LWI_TIMEOUT_INTR(cfs_time_seconds(obd_timeout),
1452 NULL, LWI_ON_SIGNAL_NOOP, NULL);
1454 /* XXX FIXME see comment on CAN_MATCH in lustre_dlm.h */
1455 l_wait_event(lock->l_waitq,
1456 lock->l_flags & wait_flags,
1458 if (!ldlm_is_lvb_ready(lock)) {
1459 if (flags & LDLM_FL_TEST_LOCK)
1460 LDLM_LOCK_RELEASE(lock);
1462 ldlm_lock_decref_internal(lock, mode);
1469 LDLM_DEBUG(lock, "matched ("LPU64" "LPU64")",
1470 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1471 res_id->name[2] : policy->l_extent.start,
1472 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1473 res_id->name[3] : policy->l_extent.end);
1475 /* check user's security context */
1476 if (lock->l_conn_export &&
1477 sptlrpc_import_check_ctx(
1478 class_exp2cliimp(lock->l_conn_export))) {
1479 if (!(flags & LDLM_FL_TEST_LOCK))
1480 ldlm_lock_decref_internal(lock, mode);
1484 if (flags & LDLM_FL_TEST_LOCK)
1485 LDLM_LOCK_RELEASE(lock);
1487 } else if (!(flags & LDLM_FL_TEST_LOCK)) {/*less verbose for test-only*/
1488 LDLM_DEBUG_NOLOCK("not matched ns %p type %u mode %u res "
1489 LPU64"/"LPU64" ("LPU64" "LPU64")", ns,
1490 type, mode, res_id->name[0], res_id->name[1],
1491 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1492 res_id->name[2] :policy->l_extent.start,
1493 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1494 res_id->name[3] : policy->l_extent.end);
1496 if (data.lmd_old != NULL)
1497 LDLM_LOCK_PUT(data.lmd_old);
1499 return rc ? mode : 0;
1501 EXPORT_SYMBOL(ldlm_lock_match);
1503 enum ldlm_mode ldlm_revalidate_lock_handle(struct lustre_handle *lockh,
1506 struct ldlm_lock *lock;
1507 enum ldlm_mode mode = 0;
1510 lock = ldlm_handle2lock(lockh);
1512 lock_res_and_lock(lock);
1513 if (LDLM_HAVE_MASK(lock, GONE))
1516 if (ldlm_is_cbpending(lock) &&
1517 lock->l_readers == 0 && lock->l_writers == 0)
1521 *bits = lock->l_policy_data.l_inodebits.bits;
1522 mode = lock->l_granted_mode;
1523 ldlm_lock_addref_internal_nolock(lock, mode);
1530 unlock_res_and_lock(lock);
1531 LDLM_LOCK_PUT(lock);
1535 EXPORT_SYMBOL(ldlm_revalidate_lock_handle);
1537 /** The caller must guarantee that the buffer is large enough. */
1538 int ldlm_fill_lvb(struct ldlm_lock *lock, struct req_capsule *pill,
1539 enum req_location loc, void *data, int size)
1544 LASSERT(data != NULL);
1547 switch (lock->l_lvb_type) {
1549 if (size == sizeof(struct ost_lvb)) {
1550 if (loc == RCL_CLIENT)
1551 lvb = req_capsule_client_swab_get(pill,
1553 lustre_swab_ost_lvb);
1555 lvb = req_capsule_server_swab_get(pill,
1557 lustre_swab_ost_lvb);
1558 if (unlikely(lvb == NULL)) {
1559 LDLM_ERROR(lock, "no LVB");
1563 memcpy(data, lvb, size);
1564 } else if (size == sizeof(struct ost_lvb_v1)) {
1565 struct ost_lvb *olvb = data;
1567 if (loc == RCL_CLIENT)
1568 lvb = req_capsule_client_swab_get(pill,
1570 lustre_swab_ost_lvb_v1);
1572 lvb = req_capsule_server_sized_swab_get(pill,
1574 lustre_swab_ost_lvb_v1);
1575 if (unlikely(lvb == NULL)) {
1576 LDLM_ERROR(lock, "no LVB");
1580 memcpy(data, lvb, size);
1581 olvb->lvb_mtime_ns = 0;
1582 olvb->lvb_atime_ns = 0;
1583 olvb->lvb_ctime_ns = 0;
1585 LDLM_ERROR(lock, "Replied unexpected ost LVB size %d",
1591 if (size == sizeof(struct lquota_lvb)) {
1592 if (loc == RCL_CLIENT)
1593 lvb = req_capsule_client_swab_get(pill,
1595 lustre_swab_lquota_lvb);
1597 lvb = req_capsule_server_swab_get(pill,
1599 lustre_swab_lquota_lvb);
1600 if (unlikely(lvb == NULL)) {
1601 LDLM_ERROR(lock, "no LVB");
1605 memcpy(data, lvb, size);
1607 LDLM_ERROR(lock, "Replied unexpected lquota LVB size %d",
1616 if (loc == RCL_CLIENT)
1617 lvb = req_capsule_client_get(pill, &RMF_DLM_LVB);
1619 lvb = req_capsule_server_get(pill, &RMF_DLM_LVB);
1620 if (unlikely(lvb == NULL)) {
1621 LDLM_ERROR(lock, "no LVB");
1625 memcpy(data, lvb, size);
1628 LDLM_ERROR(lock, "Unknown LVB type: %d\n", lock->l_lvb_type);
1629 libcfs_debug_dumpstack(NULL);
1637 * Create and fill in new LDLM lock with specified properties.
1638 * Returns a referenced lock
1640 struct ldlm_lock *ldlm_lock_create(struct ldlm_namespace *ns,
1641 const struct ldlm_res_id *res_id,
1642 enum ldlm_type type,
1643 enum ldlm_mode mode,
1644 const struct ldlm_callback_suite *cbs,
1645 void *data, __u32 lvb_len,
1646 enum lvb_type lvb_type)
1648 struct ldlm_lock *lock;
1649 struct ldlm_resource *res;
1653 res = ldlm_resource_get(ns, NULL, res_id, type, 1);
1655 RETURN(ERR_CAST(res));
1657 lock = ldlm_lock_new(res);
1659 RETURN(ERR_PTR(-ENOMEM));
1661 lock->l_req_mode = mode;
1662 lock->l_ast_data = data;
1663 lock->l_pid = current_pid();
1664 if (ns_is_server(ns))
1665 ldlm_set_ns_srv(lock);
1667 lock->l_blocking_ast = cbs->lcs_blocking;
1668 lock->l_completion_ast = cbs->lcs_completion;
1669 lock->l_glimpse_ast = cbs->lcs_glimpse;
1672 lock->l_tree_node = NULL;
1673 /* if this is the extent lock, allocate the interval tree node */
1674 if (type == LDLM_EXTENT)
1675 if (ldlm_interval_alloc(lock) == NULL)
1676 GOTO(out, rc = -ENOMEM);
1679 lock->l_lvb_len = lvb_len;
1680 OBD_ALLOC_LARGE(lock->l_lvb_data, lvb_len);
1681 if (lock->l_lvb_data == NULL)
1682 GOTO(out, rc = -ENOMEM);
1685 lock->l_lvb_type = lvb_type;
1686 if (OBD_FAIL_CHECK(OBD_FAIL_LDLM_NEW_LOCK))
1687 GOTO(out, rc = -ENOENT);
1692 ldlm_lock_destroy(lock);
1693 LDLM_LOCK_RELEASE(lock);
1694 RETURN(ERR_PTR(rc));
1698 * Enqueue (request) a lock.
1700 * Does not block. As a result of enqueue the lock would be put
1701 * into granted or waiting list.
1703 * If namespace has intent policy sent and the lock has LDLM_FL_HAS_INTENT flag
1704 * set, skip all the enqueueing and delegate lock processing to intent policy
1707 enum ldlm_error ldlm_lock_enqueue(struct ldlm_namespace *ns,
1708 struct ldlm_lock **lockp,
1709 void *cookie, __u64 *flags)
1711 struct ldlm_lock *lock = *lockp;
1712 struct ldlm_resource *res = lock->l_resource;
1713 int local = ns_is_client(ldlm_res_to_ns(res));
1714 #ifdef HAVE_SERVER_SUPPORT
1715 ldlm_processing_policy policy;
1717 enum ldlm_error rc = ELDLM_OK;
1718 struct ldlm_interval *node = NULL;
1721 /* policies are not executed on the client or during replay */
1722 if ((*flags & (LDLM_FL_HAS_INTENT|LDLM_FL_REPLAY)) == LDLM_FL_HAS_INTENT
1723 && !local && ns->ns_policy) {
1724 rc = ns->ns_policy(ns, lockp, cookie, lock->l_req_mode, *flags,
1726 if (rc == ELDLM_LOCK_REPLACED) {
1727 /* The lock that was returned has already been granted,
1728 * and placed into lockp. If it's not the same as the
1729 * one we passed in, then destroy the old one and our
1730 * work here is done. */
1731 if (lock != *lockp) {
1732 ldlm_lock_destroy(lock);
1733 LDLM_LOCK_RELEASE(lock);
1735 *flags |= LDLM_FL_LOCK_CHANGED;
1737 } else if (rc != ELDLM_OK ||
1738 (rc == ELDLM_OK && (*flags & LDLM_FL_INTENT_ONLY))) {
1739 ldlm_lock_destroy(lock);
1744 if (*flags & LDLM_FL_RESENT) {
1745 /* Reconstruct LDLM_FL_SRV_ENQ_MASK @flags for reply.
1746 * Set LOCK_CHANGED always.
1747 * Check if the lock is granted for BLOCK_GRANTED.
1748 * Take NO_TIMEOUT from the lock as it is inherited through
1749 * LDLM_FL_INHERIT_MASK */
1750 *flags |= LDLM_FL_LOCK_CHANGED;
1751 if (lock->l_req_mode != lock->l_granted_mode)
1752 *flags |= LDLM_FL_BLOCK_GRANTED;
1753 *flags |= lock->l_flags & LDLM_FL_NO_TIMEOUT;
1757 /* For a replaying lock, it might be already in granted list. So
1758 * unlinking the lock will cause the interval node to be freed, we
1759 * have to allocate the interval node early otherwise we can't regrant
1760 * this lock in the future. - jay */
1761 if (!local && (*flags & LDLM_FL_REPLAY) && res->lr_type == LDLM_EXTENT)
1762 OBD_SLAB_ALLOC_PTR_GFP(node, ldlm_interval_slab, GFP_NOFS);
1764 lock_res_and_lock(lock);
1765 if (local && lock->l_req_mode == lock->l_granted_mode) {
1766 /* The server returned a blocked lock, but it was granted
1767 * before we got a chance to actually enqueue it. We don't
1768 * need to do anything else. */
1769 *flags &= ~LDLM_FL_BLOCKED_MASK;
1770 GOTO(out, rc = ELDLM_OK);
1773 ldlm_resource_unlink_lock(lock);
1774 if (res->lr_type == LDLM_EXTENT && lock->l_tree_node == NULL) {
1776 ldlm_lock_destroy_nolock(lock);
1777 GOTO(out, rc = -ENOMEM);
1780 INIT_LIST_HEAD(&node->li_group);
1781 ldlm_interval_attach(node, lock);
1785 /* Some flags from the enqueue want to make it into the AST, via the
1786 * lock's l_flags. */
1787 if (*flags & LDLM_FL_AST_DISCARD_DATA)
1788 ldlm_set_ast_discard_data(lock);
1789 if (*flags & LDLM_FL_TEST_LOCK)
1790 ldlm_set_test_lock(lock);
1792 /* This distinction between local lock trees is very important; a client
1793 * namespace only has information about locks taken by that client, and
1794 * thus doesn't have enough information to decide for itself if it can
1795 * be granted (below). In this case, we do exactly what the server
1796 * tells us to do, as dictated by the 'flags'.
1798 * We do exactly the same thing during recovery, when the server is
1799 * more or less trusting the clients not to lie.
1801 * FIXME (bug 268): Detect obvious lies by checking compatibility in
1802 * granted/converting queues. */
1804 if (*flags & LDLM_FL_BLOCK_CONV)
1805 ldlm_resource_add_lock(res, &res->lr_converting, lock);
1806 else if (*flags & (LDLM_FL_BLOCK_WAIT | LDLM_FL_BLOCK_GRANTED))
1807 ldlm_resource_add_lock(res, &res->lr_waiting, lock);
1809 ldlm_grant_lock(lock, NULL);
1810 GOTO(out, rc = ELDLM_OK);
1811 #ifdef HAVE_SERVER_SUPPORT
1812 } else if (*flags & LDLM_FL_REPLAY) {
1813 if (*flags & LDLM_FL_BLOCK_CONV) {
1814 ldlm_resource_add_lock(res, &res->lr_converting, lock);
1815 GOTO(out, rc = ELDLM_OK);
1816 } else if (*flags & LDLM_FL_BLOCK_WAIT) {
1817 ldlm_resource_add_lock(res, &res->lr_waiting, lock);
1818 GOTO(out, rc = ELDLM_OK);
1819 } else if (*flags & LDLM_FL_BLOCK_GRANTED) {
1820 ldlm_grant_lock(lock, NULL);
1821 GOTO(out, rc = ELDLM_OK);
1823 /* If no flags, fall through to normal enqueue path. */
1826 policy = ldlm_processing_policy_table[res->lr_type];
1827 policy(lock, flags, 1, &rc, NULL);
1831 CERROR("This is client-side-only module, cannot handle "
1832 "LDLM_NAMESPACE_SERVER resource type lock.\n");
1838 unlock_res_and_lock(lock);
1840 OBD_SLAB_FREE(node, ldlm_interval_slab, sizeof(*node));
1844 #ifdef HAVE_SERVER_SUPPORT
1846 * Iterate through all waiting locks on a given resource queue and attempt to
1849 * Must be called with resource lock held.
1851 int ldlm_reprocess_queue(struct ldlm_resource *res, struct list_head *queue,
1852 struct list_head *work_list)
1854 struct list_head *tmp, *pos;
1855 ldlm_processing_policy policy;
1857 int rc = LDLM_ITER_CONTINUE;
1858 enum ldlm_error err;
1861 check_res_locked(res);
1863 policy = ldlm_processing_policy_table[res->lr_type];
1866 list_for_each_safe(tmp, pos, queue) {
1867 struct ldlm_lock *pending;
1869 pending = list_entry(tmp, struct ldlm_lock, l_res_link);
1871 CDEBUG(D_INFO, "Reprocessing lock %p\n", pending);
1874 rc = policy(pending, &flags, 0, &err, work_list);
1875 if (rc != LDLM_ITER_CONTINUE)
1884 * Process a call to blocking AST callback for a lock in ast_work list
1887 ldlm_work_bl_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1889 struct ldlm_cb_set_arg *arg = opaq;
1890 struct ldlm_lock_desc d;
1892 struct ldlm_lock *lock;
1895 if (list_empty(arg->list))
1898 lock = list_entry(arg->list->next, struct ldlm_lock, l_bl_ast);
1900 /* nobody should touch l_bl_ast */
1901 lock_res_and_lock(lock);
1902 list_del_init(&lock->l_bl_ast);
1904 LASSERT(ldlm_is_ast_sent(lock));
1905 LASSERT(lock->l_bl_ast_run == 0);
1906 LASSERT(lock->l_blocking_lock);
1907 lock->l_bl_ast_run++;
1908 unlock_res_and_lock(lock);
1910 ldlm_lock2desc(lock->l_blocking_lock, &d);
1912 rc = lock->l_blocking_ast(lock, &d, (void *)arg, LDLM_CB_BLOCKING);
1913 LDLM_LOCK_RELEASE(lock->l_blocking_lock);
1914 lock->l_blocking_lock = NULL;
1915 LDLM_LOCK_RELEASE(lock);
1921 * Process a call to completion AST callback for a lock in ast_work list
1924 ldlm_work_cp_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1926 struct ldlm_cb_set_arg *arg = opaq;
1928 struct ldlm_lock *lock;
1929 ldlm_completion_callback completion_callback;
1932 if (list_empty(arg->list))
1935 lock = list_entry(arg->list->next, struct ldlm_lock, l_cp_ast);
1937 /* It's possible to receive a completion AST before we've set
1938 * the l_completion_ast pointer: either because the AST arrived
1939 * before the reply, or simply because there's a small race
1940 * window between receiving the reply and finishing the local
1941 * enqueue. (bug 842)
1943 * This can't happen with the blocking_ast, however, because we
1944 * will never call the local blocking_ast until we drop our
1945 * reader/writer reference, which we won't do until we get the
1946 * reply and finish enqueueing. */
1948 /* nobody should touch l_cp_ast */
1949 lock_res_and_lock(lock);
1950 list_del_init(&lock->l_cp_ast);
1951 LASSERT(ldlm_is_cp_reqd(lock));
1952 /* save l_completion_ast since it can be changed by
1953 * mds_intent_policy(), see bug 14225 */
1954 completion_callback = lock->l_completion_ast;
1955 ldlm_clear_cp_reqd(lock);
1956 unlock_res_and_lock(lock);
1958 if (completion_callback != NULL)
1959 rc = completion_callback(lock, 0, (void *)arg);
1960 LDLM_LOCK_RELEASE(lock);
1966 * Process a call to revocation AST callback for a lock in ast_work list
1969 ldlm_work_revoke_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1971 struct ldlm_cb_set_arg *arg = opaq;
1972 struct ldlm_lock_desc desc;
1974 struct ldlm_lock *lock;
1977 if (list_empty(arg->list))
1980 lock = list_entry(arg->list->next, struct ldlm_lock, l_rk_ast);
1981 list_del_init(&lock->l_rk_ast);
1983 /* the desc just pretend to exclusive */
1984 ldlm_lock2desc(lock, &desc);
1985 desc.l_req_mode = LCK_EX;
1986 desc.l_granted_mode = 0;
1988 rc = lock->l_blocking_ast(lock, &desc, (void*)arg, LDLM_CB_BLOCKING);
1989 LDLM_LOCK_RELEASE(lock);
1995 * Process a call to glimpse AST callback for a lock in ast_work list
1997 int ldlm_work_gl_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1999 struct ldlm_cb_set_arg *arg = opaq;
2000 struct ldlm_glimpse_work *gl_work;
2001 struct ldlm_lock *lock;
2005 if (list_empty(arg->list))
2008 gl_work = list_entry(arg->list->next, struct ldlm_glimpse_work,
2010 list_del_init(&gl_work->gl_list);
2012 lock = gl_work->gl_lock;
2014 /* transfer the glimpse descriptor to ldlm_cb_set_arg */
2015 arg->gl_desc = gl_work->gl_desc;
2017 /* invoke the actual glimpse callback */
2018 if (lock->l_glimpse_ast(lock, (void*)arg) == 0)
2021 LDLM_LOCK_RELEASE(lock);
2023 if ((gl_work->gl_flags & LDLM_GL_WORK_NOFREE) == 0)
2024 OBD_FREE_PTR(gl_work);
2030 * Process list of locks in need of ASTs being sent.
2032 * Used on server to send multiple ASTs together instead of sending one by
2035 int ldlm_run_ast_work(struct ldlm_namespace *ns, struct list_head *rpc_list,
2036 ldlm_desc_ast_t ast_type)
2038 struct ldlm_cb_set_arg *arg;
2039 set_producer_func work_ast_lock;
2042 if (list_empty(rpc_list))
2049 atomic_set(&arg->restart, 0);
2050 arg->list = rpc_list;
2053 case LDLM_WORK_BL_AST:
2054 arg->type = LDLM_BL_CALLBACK;
2055 work_ast_lock = ldlm_work_bl_ast_lock;
2057 case LDLM_WORK_CP_AST:
2058 arg->type = LDLM_CP_CALLBACK;
2059 work_ast_lock = ldlm_work_cp_ast_lock;
2061 case LDLM_WORK_REVOKE_AST:
2062 arg->type = LDLM_BL_CALLBACK;
2063 work_ast_lock = ldlm_work_revoke_ast_lock;
2065 case LDLM_WORK_GL_AST:
2066 arg->type = LDLM_GL_CALLBACK;
2067 work_ast_lock = ldlm_work_gl_ast_lock;
2073 /* We create a ptlrpc request set with flow control extension.
2074 * This request set will use the work_ast_lock function to produce new
2075 * requests and will send a new request each time one completes in order
2076 * to keep the number of requests in flight to ns_max_parallel_ast */
2077 arg->set = ptlrpc_prep_fcset(ns->ns_max_parallel_ast ? : UINT_MAX,
2078 work_ast_lock, arg);
2079 if (arg->set == NULL)
2080 GOTO(out, rc = -ENOMEM);
2082 ptlrpc_set_wait(arg->set);
2083 ptlrpc_set_destroy(arg->set);
2085 rc = atomic_read(&arg->restart) ? -ERESTART : 0;
2092 static int reprocess_one_queue(struct ldlm_resource *res, void *closure)
2094 ldlm_reprocess_all(res);
2095 return LDLM_ITER_CONTINUE;
2098 static int ldlm_reprocess_res(struct cfs_hash *hs, struct cfs_hash_bd *bd,
2099 struct hlist_node *hnode, void *arg)
2101 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
2104 rc = reprocess_one_queue(res, arg);
2106 return rc == LDLM_ITER_STOP;
2110 * Iterate through all resources on a namespace attempting to grant waiting
2113 void ldlm_reprocess_all_ns(struct ldlm_namespace *ns)
2118 cfs_hash_for_each_nolock(ns->ns_rs_hash,
2119 ldlm_reprocess_res, NULL, 0);
2125 * Try to grant all waiting locks on a resource.
2127 * Calls ldlm_reprocess_queue on converting and waiting queues.
2129 * Typically called after some resource locks are cancelled to see
2130 * if anything could be granted as a result of the cancellation.
2132 void ldlm_reprocess_all(struct ldlm_resource *res)
2134 struct list_head rpc_list;
2135 #ifdef HAVE_SERVER_SUPPORT
2139 INIT_LIST_HEAD(&rpc_list);
2140 /* Local lock trees don't get reprocessed. */
2141 if (ns_is_client(ldlm_res_to_ns(res))) {
2148 rc = ldlm_reprocess_queue(res, &res->lr_converting, &rpc_list);
2149 if (rc == LDLM_ITER_CONTINUE)
2150 ldlm_reprocess_queue(res, &res->lr_waiting, &rpc_list);
2153 rc = ldlm_run_ast_work(ldlm_res_to_ns(res), &rpc_list,
2155 if (rc == -ERESTART) {
2156 LASSERT(list_empty(&rpc_list));
2162 INIT_LIST_HEAD(&rpc_list);
2163 if (!ns_is_client(ldlm_res_to_ns(res))) {
2164 CERROR("This is client-side-only module, cannot handle "
2165 "LDLM_NAMESPACE_SERVER resource type lock.\n");
2171 EXPORT_SYMBOL(ldlm_reprocess_all);
2174 * Helper function to call blocking AST for LDLM lock \a lock in a
2175 * "cancelling" mode.
2177 void ldlm_cancel_callback(struct ldlm_lock *lock)
2179 check_res_locked(lock->l_resource);
2180 if (!ldlm_is_cancel(lock)) {
2181 ldlm_set_cancel(lock);
2182 if (lock->l_blocking_ast) {
2183 unlock_res_and_lock(lock);
2184 lock->l_blocking_ast(lock, NULL, lock->l_ast_data,
2186 lock_res_and_lock(lock);
2188 LDLM_DEBUG(lock, "no blocking ast");
2191 ldlm_set_bl_done(lock);
2195 * Remove skiplist-enabled LDLM lock \a req from granted list
2197 void ldlm_unlink_lock_skiplist(struct ldlm_lock *req)
2199 if (req->l_resource->lr_type != LDLM_PLAIN &&
2200 req->l_resource->lr_type != LDLM_IBITS)
2203 list_del_init(&req->l_sl_policy);
2204 list_del_init(&req->l_sl_mode);
2208 * Attempts to cancel LDLM lock \a lock that has no reader/writer references.
2210 void ldlm_lock_cancel(struct ldlm_lock *lock)
2212 struct ldlm_resource *res;
2213 struct ldlm_namespace *ns;
2216 lock_res_and_lock(lock);
2218 res = lock->l_resource;
2219 ns = ldlm_res_to_ns(res);
2221 /* Please do not, no matter how tempting, remove this LBUG without
2222 * talking to me first. -phik */
2223 if (lock->l_readers || lock->l_writers) {
2224 LDLM_ERROR(lock, "lock still has references");
2228 if (ldlm_is_waited(lock))
2229 ldlm_del_waiting_lock(lock);
2231 /* Releases cancel callback. */
2232 ldlm_cancel_callback(lock);
2234 LASSERT(!ldlm_is_waited(lock));
2236 ldlm_resource_unlink_lock(lock);
2237 ldlm_lock_destroy_nolock(lock);
2239 if (lock->l_granted_mode == lock->l_req_mode)
2240 ldlm_pool_del(&ns->ns_pool, lock);
2242 /* Make sure we will not be called again for same lock what is possible
2243 * if not to zero out lock->l_granted_mode */
2244 lock->l_granted_mode = LCK_MINMODE;
2245 unlock_res_and_lock(lock);
2249 EXPORT_SYMBOL(ldlm_lock_cancel);
2252 * Set opaque data into the lock that only makes sense to upper layer.
2254 int ldlm_lock_set_data(struct lustre_handle *lockh, void *data)
2256 struct ldlm_lock *lock = ldlm_handle2lock(lockh);
2261 if (lock->l_ast_data == NULL)
2262 lock->l_ast_data = data;
2263 if (lock->l_ast_data == data)
2265 LDLM_LOCK_PUT(lock);
2269 EXPORT_SYMBOL(ldlm_lock_set_data);
2271 struct export_cl_data {
2272 struct obd_export *ecl_exp;
2276 static void ldlm_cancel_lock_for_export(struct obd_export *exp,
2277 struct ldlm_lock *lock,
2278 struct export_cl_data *ecl)
2280 struct ldlm_resource *res;
2282 res = ldlm_resource_getref(lock->l_resource);
2284 ldlm_res_lvbo_update(res, NULL, 1);
2285 ldlm_lock_cancel(lock);
2286 if (!exp->exp_obd->obd_stopping)
2287 ldlm_reprocess_all(res);
2288 ldlm_resource_putref(res);
2291 if ((ecl->ecl_loop & -ecl->ecl_loop) == ecl->ecl_loop) {
2292 CDEBUG(D_INFO, "Export %p, %d locks cancelled.\n",
2293 exp, ecl->ecl_loop);
2298 * Iterator function for ldlm_export_cancel_locks.
2299 * Cancels passed locks.
2302 ldlm_cancel_locks_for_export_cb(struct cfs_hash *hs, struct cfs_hash_bd *bd,
2303 struct hlist_node *hnode, void *data)
2306 struct export_cl_data *ecl = (struct export_cl_data *)data;
2307 struct obd_export *exp = ecl->ecl_exp;
2308 struct ldlm_lock *lock = cfs_hash_object(hs, hnode);
2310 LDLM_LOCK_GET(lock);
2311 ldlm_cancel_lock_for_export(exp, lock, ecl);
2312 LDLM_LOCK_RELEASE(lock);
2318 * Cancel all blocked locks for given export.
2320 * Typically called on client disconnection/eviction
2322 int ldlm_export_cancel_blocked_locks(struct obd_export *exp)
2324 struct export_cl_data ecl = {
2329 while (!list_empty(&exp->exp_bl_list)) {
2330 struct ldlm_lock *lock;
2332 spin_lock_bh(&exp->exp_bl_list_lock);
2333 if (!list_empty(&exp->exp_bl_list)) {
2334 lock = list_entry(exp->exp_bl_list.next,
2335 struct ldlm_lock, l_exp_list);
2336 LDLM_LOCK_GET(lock);
2337 list_del_init(&lock->l_exp_list);
2341 spin_unlock_bh(&exp->exp_bl_list_lock);
2346 ldlm_cancel_lock_for_export(exp, lock, &ecl);
2347 LDLM_LOCK_RELEASE(lock);
2350 CDEBUG(D_DLMTRACE, "Export %p, canceled %d locks, "
2351 "left on hash table %d.\n", exp, ecl.ecl_loop,
2352 atomic_read(&exp->exp_lock_hash->hs_count));
2354 return ecl.ecl_loop;
2358 * Cancel all locks for given export.
2360 * Typically called after client disconnection/eviction
2362 int ldlm_export_cancel_locks(struct obd_export *exp)
2364 struct export_cl_data ecl = {
2369 cfs_hash_for_each_empty(exp->exp_lock_hash,
2370 ldlm_cancel_locks_for_export_cb, &ecl);
2372 CDEBUG(D_DLMTRACE, "Export %p, canceled %d locks, "
2373 "left on hash table %d.\n", exp, ecl.ecl_loop,
2374 atomic_read(&exp->exp_lock_hash->hs_count));
2376 return ecl.ecl_loop;
2380 * Downgrade an exclusive lock.
2382 * A fast variant of ldlm_lock_convert for convertion of exclusive
2383 * locks. The convertion is always successful.
2384 * Used by Commit on Sharing (COS) code.
2386 * \param lock A lock to convert
2387 * \param new_mode new lock mode
2389 void ldlm_lock_downgrade(struct ldlm_lock *lock, enum ldlm_mode new_mode)
2393 LASSERT(lock->l_granted_mode & (LCK_PW | LCK_EX));
2394 LASSERT(new_mode == LCK_COS);
2396 lock_res_and_lock(lock);
2397 ldlm_resource_unlink_lock(lock);
2399 * Remove the lock from pool as it will be added again in
2400 * ldlm_grant_lock() called below.
2402 ldlm_pool_del(&ldlm_lock_to_ns(lock)->ns_pool, lock);
2404 lock->l_req_mode = new_mode;
2405 ldlm_grant_lock(lock, NULL);
2406 unlock_res_and_lock(lock);
2407 ldlm_reprocess_all(lock->l_resource);
2411 EXPORT_SYMBOL(ldlm_lock_downgrade);
2414 * Attempt to convert already granted lock to a different mode.
2416 * While lock conversion is not currently used, future client-side
2417 * optimizations could take advantage of it to avoid discarding cached
2420 struct ldlm_resource *ldlm_lock_convert(struct ldlm_lock *lock,
2421 enum ldlm_mode new_mode, __u32 *flags)
2423 struct list_head rpc_list;
2424 struct ldlm_resource *res;
2425 struct ldlm_namespace *ns;
2427 #ifdef HAVE_SERVER_SUPPORT
2429 struct sl_insert_point prev;
2431 struct ldlm_interval *node;
2434 INIT_LIST_HEAD(&rpc_list);
2435 /* Just return if mode is unchanged. */
2436 if (new_mode == lock->l_granted_mode) {
2437 *flags |= LDLM_FL_BLOCK_GRANTED;
2438 RETURN(lock->l_resource);
2441 /* I can't check the type of lock here because the bitlock of lock
2442 * is not held here, so do the allocation blindly. -jay */
2443 OBD_SLAB_ALLOC_PTR_GFP(node, ldlm_interval_slab, GFP_NOFS);
2444 if (node == NULL) /* Actually, this causes EDEADLOCK to be returned */
2447 LASSERTF((new_mode == LCK_PW && lock->l_granted_mode == LCK_PR),
2448 "new_mode %u, granted %u\n", new_mode, lock->l_granted_mode);
2450 lock_res_and_lock(lock);
2452 res = lock->l_resource;
2453 ns = ldlm_res_to_ns(res);
2455 #ifdef HAVE_SERVER_SUPPORT
2456 old_mode = lock->l_req_mode;
2458 lock->l_req_mode = new_mode;
2459 if (res->lr_type == LDLM_PLAIN || res->lr_type == LDLM_IBITS) {
2460 #ifdef HAVE_SERVER_SUPPORT
2461 /* remember the lock position where the lock might be
2462 * added back to the granted list later and also
2463 * remember the join mode for skiplist fixing. */
2464 prev.res_link = lock->l_res_link.prev;
2465 prev.mode_link = lock->l_sl_mode.prev;
2466 prev.policy_link = lock->l_sl_policy.prev;
2468 ldlm_resource_unlink_lock(lock);
2470 ldlm_resource_unlink_lock(lock);
2471 if (res->lr_type == LDLM_EXTENT) {
2472 /* FIXME: ugly code, I have to attach the lock to a
2473 * interval node again since perhaps it will be granted
2475 INIT_LIST_HEAD(&node->li_group);
2476 ldlm_interval_attach(node, lock);
2482 * Remove old lock from the pool before adding the lock with new
2483 * mode below in ->policy()
2485 ldlm_pool_del(&ns->ns_pool, lock);
2487 /* If this is a local resource, put it on the appropriate list. */
2488 if (ns_is_client(ldlm_res_to_ns(res))) {
2489 if (*flags & (LDLM_FL_BLOCK_CONV | LDLM_FL_BLOCK_GRANTED)) {
2490 ldlm_resource_add_lock(res, &res->lr_converting, lock);
2492 /* This should never happen, because of the way the
2493 * server handles conversions. */
2494 LDLM_ERROR(lock, "Erroneous flags %x on local lock\n",
2498 ldlm_grant_lock(lock, &rpc_list);
2500 /* FIXME: completion handling not with lr_lock held ! */
2501 if (lock->l_completion_ast)
2502 lock->l_completion_ast(lock, 0, NULL);
2504 #ifdef HAVE_SERVER_SUPPORT
2507 enum ldlm_error err;
2509 ldlm_processing_policy policy;
2511 policy = ldlm_processing_policy_table[res->lr_type];
2512 rc = policy(lock, &pflags, 0, &err, &rpc_list);
2513 if (rc == LDLM_ITER_STOP) {
2514 lock->l_req_mode = old_mode;
2515 if (res->lr_type == LDLM_EXTENT)
2516 ldlm_extent_add_lock(res, lock);
2518 ldlm_granted_list_add_lock(lock, &prev);
2522 *flags |= LDLM_FL_BLOCK_GRANTED;
2528 CERROR("This is client-side-only module, cannot handle "
2529 "LDLM_NAMESPACE_SERVER resource type lock.\n");
2533 unlock_res_and_lock(lock);
2536 ldlm_run_ast_work(ns, &rpc_list, LDLM_WORK_CP_AST);
2538 OBD_SLAB_FREE(node, ldlm_interval_slab, sizeof(*node));
2543 * Print lock with lock handle \a lockh description into debug log.
2545 * Used when printing all locks on a resource for debug purposes.
2547 void ldlm_lock_dump_handle(int level, struct lustre_handle *lockh)
2549 struct ldlm_lock *lock;
2551 if (!((libcfs_debug | D_ERROR) & level))
2554 lock = ldlm_handle2lock(lockh);
2558 LDLM_DEBUG_LIMIT(level, lock, "###");
2560 LDLM_LOCK_PUT(lock);
2562 EXPORT_SYMBOL(ldlm_lock_dump_handle);
2565 * Print lock information with custom message into debug log.
2568 void _ldlm_lock_debug(struct ldlm_lock *lock,
2569 struct libcfs_debug_msg_data *msgdata,
2570 const char *fmt, ...)
2573 struct obd_export *exp = lock->l_export;
2574 struct ldlm_resource *resource = lock->l_resource;
2575 char *nid = "local";
2577 va_start(args, fmt);
2579 if (exp && exp->exp_connection) {
2580 nid = libcfs_nid2str(exp->exp_connection->c_peer.nid);
2581 } else if (exp && exp->exp_obd != NULL) {
2582 struct obd_import *imp = exp->exp_obd->u.cli.cl_import;
2583 nid = libcfs_nid2str(imp->imp_connection->c_peer.nid);
2586 if (resource == NULL) {
2587 libcfs_debug_vmsg2(msgdata, fmt, args,
2588 " ns: \?\? lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
2589 "res: \?\? rrc=\?\? type: \?\?\? flags: "LPX64" nid: %s "
2590 "remote: "LPX64" expref: %d pid: %u timeout: %lu "
2593 lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
2594 lock->l_readers, lock->l_writers,
2595 ldlm_lockname[lock->l_granted_mode],
2596 ldlm_lockname[lock->l_req_mode],
2597 lock->l_flags, nid, lock->l_remote_handle.cookie,
2598 exp ? atomic_read(&exp->exp_refcount) : -99,
2599 lock->l_pid, lock->l_callback_timeout, lock->l_lvb_type);
2604 switch (resource->lr_type) {
2606 libcfs_debug_vmsg2(msgdata, fmt, args,
2607 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
2608 "res: "DLDLMRES" rrc: %d type: %s ["LPU64"->"LPU64"] "
2609 "(req "LPU64"->"LPU64") flags: "LPX64" nid: %s remote: "
2610 LPX64" expref: %d pid: %u timeout: %lu lvb_type: %d\n",
2611 ldlm_lock_to_ns_name(lock), lock,
2612 lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
2613 lock->l_readers, lock->l_writers,
2614 ldlm_lockname[lock->l_granted_mode],
2615 ldlm_lockname[lock->l_req_mode],
2617 atomic_read(&resource->lr_refcount),
2618 ldlm_typename[resource->lr_type],
2619 lock->l_policy_data.l_extent.start,
2620 lock->l_policy_data.l_extent.end,
2621 lock->l_req_extent.start, lock->l_req_extent.end,
2622 lock->l_flags, nid, lock->l_remote_handle.cookie,
2623 exp ? atomic_read(&exp->exp_refcount) : -99,
2624 lock->l_pid, lock->l_callback_timeout,
2629 libcfs_debug_vmsg2(msgdata, fmt, args,
2630 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
2631 "res: "DLDLMRES" rrc: %d type: %s pid: %d "
2632 "["LPU64"->"LPU64"] flags: "LPX64" nid: %s "
2633 "remote: "LPX64" expref: %d pid: %u timeout: %lu\n",
2634 ldlm_lock_to_ns_name(lock), lock,
2635 lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
2636 lock->l_readers, lock->l_writers,
2637 ldlm_lockname[lock->l_granted_mode],
2638 ldlm_lockname[lock->l_req_mode],
2640 atomic_read(&resource->lr_refcount),
2641 ldlm_typename[resource->lr_type],
2642 lock->l_policy_data.l_flock.pid,
2643 lock->l_policy_data.l_flock.start,
2644 lock->l_policy_data.l_flock.end,
2645 lock->l_flags, nid, lock->l_remote_handle.cookie,
2646 exp ? atomic_read(&exp->exp_refcount) : -99,
2647 lock->l_pid, lock->l_callback_timeout);
2651 libcfs_debug_vmsg2(msgdata, fmt, args,
2652 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
2653 "res: "DLDLMRES" bits "LPX64" rrc: %d type: %s "
2654 "flags: "LPX64" nid: %s remote: "LPX64" expref: %d "
2655 "pid: %u timeout: %lu lvb_type: %d\n",
2656 ldlm_lock_to_ns_name(lock),
2657 lock, lock->l_handle.h_cookie,
2658 atomic_read(&lock->l_refc),
2659 lock->l_readers, lock->l_writers,
2660 ldlm_lockname[lock->l_granted_mode],
2661 ldlm_lockname[lock->l_req_mode],
2663 lock->l_policy_data.l_inodebits.bits,
2664 atomic_read(&resource->lr_refcount),
2665 ldlm_typename[resource->lr_type],
2666 lock->l_flags, nid, lock->l_remote_handle.cookie,
2667 exp ? atomic_read(&exp->exp_refcount) : -99,
2668 lock->l_pid, lock->l_callback_timeout,
2673 libcfs_debug_vmsg2(msgdata, fmt, args,
2674 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
2675 "res: "DLDLMRES" rrc: %d type: %s flags: "LPX64" "
2676 "nid: %s remote: "LPX64" expref: %d pid: %u "
2677 "timeout: %lu lvb_type: %d\n",
2678 ldlm_lock_to_ns_name(lock),
2679 lock, lock->l_handle.h_cookie,
2680 atomic_read(&lock->l_refc),
2681 lock->l_readers, lock->l_writers,
2682 ldlm_lockname[lock->l_granted_mode],
2683 ldlm_lockname[lock->l_req_mode],
2685 atomic_read(&resource->lr_refcount),
2686 ldlm_typename[resource->lr_type],
2687 lock->l_flags, nid, lock->l_remote_handle.cookie,
2688 exp ? atomic_read(&exp->exp_refcount) : -99,
2689 lock->l_pid, lock->l_callback_timeout,
2695 EXPORT_SYMBOL(_ldlm_lock_debug);