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.gnu.org/licenses/gpl-2.0.html
23 * Copyright (c) 2002, 2010, Oracle and/or its affiliates. All rights reserved.
24 * Use is subject to license terms.
26 * Copyright (c) 2010, 2017, Intel Corporation.
29 * This file is part of Lustre, http://www.lustre.org/
30 * Lustre is a trademark of Sun Microsystems, Inc.
32 * lustre/ldlm/ldlm_lock.c
34 * Author: Peter Braam <braam@clusterfs.com>
35 * Author: Phil Schwan <phil@clusterfs.com>
38 #define DEBUG_SUBSYSTEM S_LDLM
40 #include <libcfs/libcfs.h>
42 #include <lustre_swab.h>
43 #include <obd_class.h>
45 #include "ldlm_internal.h"
47 struct kmem_cache *ldlm_glimpse_work_kmem;
48 EXPORT_SYMBOL(ldlm_glimpse_work_kmem);
51 char *ldlm_lockname[] = {
59 [LCK_GROUP] = "GROUP",
62 EXPORT_SYMBOL(ldlm_lockname);
64 char *ldlm_typename[] = {
66 [LDLM_EXTENT] = "EXT",
71 static ldlm_policy_wire_to_local_t ldlm_policy_wire_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_wire_to_local,
75 [LDLM_IBITS - LDLM_MIN_TYPE] = ldlm_ibits_policy_wire_to_local,
78 static ldlm_policy_local_to_wire_t ldlm_policy_local_to_wire[] = {
79 [LDLM_PLAIN - LDLM_MIN_TYPE] = ldlm_plain_policy_local_to_wire,
80 [LDLM_EXTENT - LDLM_MIN_TYPE] = ldlm_extent_policy_local_to_wire,
81 [LDLM_FLOCK - LDLM_MIN_TYPE] = ldlm_flock_policy_local_to_wire,
82 [LDLM_IBITS - LDLM_MIN_TYPE] = ldlm_ibits_policy_local_to_wire,
86 * Converts lock policy from local format to on the wire lock_desc format
88 void ldlm_convert_policy_to_wire(enum ldlm_type type,
89 const union ldlm_policy_data *lpolicy,
90 union ldlm_wire_policy_data *wpolicy)
92 ldlm_policy_local_to_wire_t convert;
94 convert = ldlm_policy_local_to_wire[type - LDLM_MIN_TYPE];
96 convert(lpolicy, wpolicy);
100 * Converts lock policy from on the wire lock_desc format to local format
102 void ldlm_convert_policy_to_local(struct obd_export *exp, enum ldlm_type type,
103 const union ldlm_wire_policy_data *wpolicy,
104 union ldlm_policy_data *lpolicy)
106 ldlm_policy_wire_to_local_t convert;
108 convert = ldlm_policy_wire_to_local[type - LDLM_MIN_TYPE];
110 convert(wpolicy, lpolicy);
113 const char *ldlm_it2str(enum ldlm_intent_flags it)
120 case (IT_OPEN | IT_CREAT):
133 CERROR("Unknown intent 0x%08x\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 if (ns->ns_last_pos == &lock->l_lru)
238 ns->ns_last_pos = lock->l_lru.prev;
239 list_del_init(&lock->l_lru);
240 LASSERT(ns->ns_nr_unused > 0);
248 * Removes LDLM lock \a lock from LRU. Obtains the LRU lock first.
250 * If \a last_use is non-zero, it will remove the lock from LRU only if
251 * it matches lock's l_last_used.
253 * \retval 0 if \a last_use is set, the lock is not in LRU list or \a last_use
254 * doesn't match lock's l_last_used;
255 * otherwise, the lock hasn't been in the LRU list.
256 * \retval 1 the lock was in LRU list and removed.
258 int ldlm_lock_remove_from_lru_check(struct ldlm_lock *lock, ktime_t last_use)
260 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
264 if (ldlm_is_ns_srv(lock)) {
265 LASSERT(list_empty(&lock->l_lru));
269 spin_lock(&ns->ns_lock);
270 if (!ktime_compare(last_use, ktime_set(0, 0)) ||
271 !ktime_compare(last_use, lock->l_last_used))
272 rc = ldlm_lock_remove_from_lru_nolock(lock);
273 spin_unlock(&ns->ns_lock);
279 * Adds LDLM lock \a lock to namespace LRU. Assumes LRU is already locked.
281 void ldlm_lock_add_to_lru_nolock(struct ldlm_lock *lock)
283 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
285 lock->l_last_used = ktime_get();
286 LASSERT(list_empty(&lock->l_lru));
287 LASSERT(lock->l_resource->lr_type != LDLM_FLOCK);
288 list_add_tail(&lock->l_lru, &ns->ns_unused_list);
289 LASSERT(ns->ns_nr_unused >= 0);
294 * Adds LDLM lock \a lock to namespace LRU. Obtains necessary LRU locks
297 void ldlm_lock_add_to_lru(struct ldlm_lock *lock)
299 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
302 spin_lock(&ns->ns_lock);
303 ldlm_lock_add_to_lru_nolock(lock);
304 spin_unlock(&ns->ns_lock);
309 * Moves LDLM lock \a lock that is already in namespace LRU to the tail of
310 * the LRU. Performs necessary LRU locking
312 void ldlm_lock_touch_in_lru(struct ldlm_lock *lock)
314 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
317 if (ldlm_is_ns_srv(lock)) {
318 LASSERT(list_empty(&lock->l_lru));
323 spin_lock(&ns->ns_lock);
324 if (!list_empty(&lock->l_lru)) {
325 ldlm_lock_remove_from_lru_nolock(lock);
326 ldlm_lock_add_to_lru_nolock(lock);
328 spin_unlock(&ns->ns_lock);
333 * Helper to destroy a locked lock.
335 * Used by ldlm_lock_destroy and ldlm_lock_destroy_nolock
336 * Must be called with l_lock and lr_lock held.
338 * Does not actually free the lock data, but rather marks the lock as
339 * destroyed by setting l_destroyed field in the lock to 1. Destroys a
340 * handle->lock association too, so that the lock can no longer be found
341 * and removes the lock from LRU list. Actual lock freeing occurs when
342 * last lock reference goes away.
344 * Original comment (of some historical value):
345 * This used to have a 'strict' flag, which recovery would use to mark an
346 * in-use lock as needing-to-die. Lest I am ever tempted to put it back, I
347 * shall explain why it's gone: with the new hash table scheme, once you call
348 * ldlm_lock_destroy, you can never drop your final references on this lock.
349 * Because it's not in the hash table anymore. -phil
351 static int ldlm_lock_destroy_internal(struct ldlm_lock *lock)
355 if (lock->l_readers || lock->l_writers) {
356 LDLM_ERROR(lock, "lock still has references");
360 if (!list_empty(&lock->l_res_link)) {
361 LDLM_ERROR(lock, "lock still on resource");
365 if (ldlm_is_destroyed(lock)) {
366 LASSERT(list_empty(&lock->l_lru));
370 ldlm_set_destroyed(lock);
372 if (lock->l_export && lock->l_export->exp_lock_hash) {
373 /* NB: it's safe to call cfs_hash_del() even lock isn't
374 * in exp_lock_hash. */
375 /* In the function below, .hs_keycmp resolves to
376 * ldlm_export_lock_keycmp() */
377 /* coverity[overrun-buffer-val] */
378 cfs_hash_del(lock->l_export->exp_lock_hash,
379 &lock->l_remote_handle, &lock->l_exp_hash);
382 ldlm_lock_remove_from_lru(lock);
383 class_handle_unhash(&lock->l_handle);
390 * Destroys a LDLM lock \a lock. Performs necessary locking first.
392 void ldlm_lock_destroy(struct ldlm_lock *lock)
396 lock_res_and_lock(lock);
397 first = ldlm_lock_destroy_internal(lock);
398 unlock_res_and_lock(lock);
400 /* drop reference from hashtable only for first destroy */
402 lu_ref_del(&lock->l_reference, "hash", lock);
403 LDLM_LOCK_RELEASE(lock);
409 * Destroys a LDLM lock \a lock that is already locked.
411 void ldlm_lock_destroy_nolock(struct ldlm_lock *lock)
415 first = ldlm_lock_destroy_internal(lock);
416 /* drop reference from hashtable only for first destroy */
418 lu_ref_del(&lock->l_reference, "hash", lock);
419 LDLM_LOCK_RELEASE(lock);
424 /* this is called by portals_handle2object with the handle lock taken */
425 static void lock_handle_addref(void *lock)
427 LDLM_LOCK_GET((struct ldlm_lock *)lock);
430 static void lock_handle_free(void *lock, int size)
432 LASSERT(size == sizeof(struct ldlm_lock));
433 OBD_SLAB_FREE(lock, ldlm_lock_slab, size);
436 static struct portals_handle_ops lock_handle_ops = {
437 .hop_addref = lock_handle_addref,
438 .hop_free = lock_handle_free,
443 * Allocate and initialize new lock structure.
445 * usage: pass in a resource on which you have done ldlm_resource_get
446 * new lock will take over the refcount.
447 * returns: lock with refcount 2 - one for current caller and one for remote
449 static struct ldlm_lock *ldlm_lock_new(struct ldlm_resource *resource)
451 struct ldlm_lock *lock;
454 if (resource == NULL)
457 OBD_SLAB_ALLOC_PTR_GFP(lock, ldlm_lock_slab, GFP_NOFS);
461 spin_lock_init(&lock->l_lock);
462 lock->l_resource = resource;
463 lu_ref_add(&resource->lr_reference, "lock", lock);
465 atomic_set(&lock->l_refc, 2);
466 INIT_LIST_HEAD(&lock->l_res_link);
467 INIT_LIST_HEAD(&lock->l_lru);
468 INIT_LIST_HEAD(&lock->l_pending_chain);
469 INIT_LIST_HEAD(&lock->l_bl_ast);
470 INIT_LIST_HEAD(&lock->l_cp_ast);
471 INIT_LIST_HEAD(&lock->l_rk_ast);
472 init_waitqueue_head(&lock->l_waitq);
473 lock->l_blocking_lock = NULL;
474 INIT_LIST_HEAD(&lock->l_sl_mode);
475 INIT_LIST_HEAD(&lock->l_sl_policy);
476 INIT_HLIST_NODE(&lock->l_exp_hash);
477 INIT_HLIST_NODE(&lock->l_exp_flock_hash);
479 lprocfs_counter_incr(ldlm_res_to_ns(resource)->ns_stats,
481 INIT_LIST_HEAD(&lock->l_handle.h_link);
482 class_handle_hash(&lock->l_handle, &lock_handle_ops);
484 lu_ref_init(&lock->l_reference);
485 lu_ref_add(&lock->l_reference, "hash", lock);
486 lock->l_callback_timeout = 0;
487 lock->l_activity = 0;
489 #if LUSTRE_TRACKS_LOCK_EXP_REFS
490 INIT_LIST_HEAD(&lock->l_exp_refs_link);
491 lock->l_exp_refs_nr = 0;
492 lock->l_exp_refs_target = NULL;
494 INIT_LIST_HEAD(&lock->l_exp_list);
500 * Moves LDLM lock \a lock to another resource.
501 * This is used on client when server returns some other lock than requested
502 * (typically as a result of intent operation)
504 int ldlm_lock_change_resource(struct ldlm_namespace *ns, struct ldlm_lock *lock,
505 const struct ldlm_res_id *new_resid)
507 struct ldlm_resource *oldres = lock->l_resource;
508 struct ldlm_resource *newres;
512 LASSERT(ns_is_client(ns));
514 lock_res_and_lock(lock);
515 if (memcmp(new_resid, &lock->l_resource->lr_name,
516 sizeof(lock->l_resource->lr_name)) == 0) {
518 unlock_res_and_lock(lock);
522 LASSERT(new_resid->name[0] != 0);
524 /* This function assumes that the lock isn't on any lists */
525 LASSERT(list_empty(&lock->l_res_link));
527 type = oldres->lr_type;
528 unlock_res_and_lock(lock);
530 newres = ldlm_resource_get(ns, NULL, new_resid, type, 1);
532 RETURN(PTR_ERR(newres));
534 lu_ref_add(&newres->lr_reference, "lock", lock);
536 * To flip the lock from the old to the new resource, lock, oldres and
537 * newres have to be locked. Resource spin-locks are nested within
538 * lock->l_lock, and are taken in the memory address order to avoid
541 spin_lock(&lock->l_lock);
542 oldres = lock->l_resource;
543 if (oldres < newres) {
545 lock_res_nested(newres, LRT_NEW);
548 lock_res_nested(oldres, LRT_NEW);
550 LASSERT(memcmp(new_resid, &oldres->lr_name,
551 sizeof oldres->lr_name) != 0);
552 lock->l_resource = newres;
554 unlock_res_and_lock(lock);
556 /* ...and the flowers are still standing! */
557 lu_ref_del(&oldres->lr_reference, "lock", lock);
558 ldlm_resource_putref(oldres);
563 /** \defgroup ldlm_handles LDLM HANDLES
564 * Ways to get hold of locks without any addresses.
569 * Fills in handle for LDLM lock \a lock into supplied \a lockh
570 * Does not take any references.
572 void ldlm_lock2handle(const struct ldlm_lock *lock, struct lustre_handle *lockh)
574 lockh->cookie = lock->l_handle.h_cookie;
576 EXPORT_SYMBOL(ldlm_lock2handle);
579 * Obtain a lock reference by handle.
581 * if \a flags: atomically get the lock and set the flags.
582 * Return NULL if flag already set
584 struct ldlm_lock *__ldlm_handle2lock(const struct lustre_handle *handle,
587 struct ldlm_lock *lock;
592 lock = class_handle2object(handle->cookie, NULL);
596 if (lock->l_export != NULL && lock->l_export->exp_failed) {
597 CDEBUG(D_INFO, "lock export failed: lock %p, exp %p\n",
598 lock, lock->l_export);
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(const 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: %#llx\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(const 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) || lock->l_req_mode == LCK_GROUP) &&
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.
840 * Group locks are special:
841 * They must not go in LRU, but they are not called back
842 * like non-group locks, instead they are manually released.
843 * They have an l_writers reference which they keep until
844 * they are manually released, so we remove them when they have
845 * no more reader or writer references. - LU-6368 */
846 ldlm_set_cbpending(lock);
849 if (!lock->l_readers && !lock->l_writers && ldlm_is_cbpending(lock)) {
850 /* If we received a blocked AST and this was the last reference,
851 * run the callback. */
852 if (ldlm_is_ns_srv(lock) && lock->l_export)
853 CERROR("FL_CBPENDING set on non-local lock--just a "
856 LDLM_DEBUG(lock, "final decref done on cbpending lock");
858 LDLM_LOCK_GET(lock); /* dropped by bl thread */
859 ldlm_lock_remove_from_lru(lock);
860 unlock_res_and_lock(lock);
862 if (ldlm_is_fail_loc(lock))
863 OBD_RACE(OBD_FAIL_LDLM_CP_BL_RACE);
865 if (ldlm_is_atomic_cb(lock) ||
866 ldlm_bl_to_thread_lock(ns, NULL, lock) != 0)
867 ldlm_handle_bl_callback(ns, NULL, lock);
868 } else if (ns_is_client(ns) &&
869 !lock->l_readers && !lock->l_writers &&
870 !ldlm_is_no_lru(lock) &&
871 !ldlm_is_bl_ast(lock) &&
872 !ldlm_is_converting(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(const struct lustre_handle *lockh, enum ldlm_mode mode)
903 struct ldlm_lock *lock = __ldlm_handle2lock(lockh, 0);
904 LASSERTF(lock != NULL, "Non-existing lock: %#llx\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(const 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 void ldlm_grant_lock_with_skiplist(struct ldlm_lock *lock)
1078 struct sl_insert_point prev;
1080 LASSERT(lock->l_req_mode == lock->l_granted_mode);
1082 search_granted_lock(&lock->l_resource->lr_granted, lock, &prev);
1083 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
1094 * must be called with lr_lock held
1096 void ldlm_grant_lock(struct ldlm_lock *lock, struct list_head *work_list)
1098 struct ldlm_resource *res = lock->l_resource;
1101 check_res_locked(res);
1103 lock->l_granted_mode = lock->l_req_mode;
1105 if (work_list && lock->l_completion_ast != NULL)
1106 ldlm_add_ast_work_item(lock, NULL, work_list);
1108 if (res->lr_type == LDLM_PLAIN || res->lr_type == LDLM_IBITS)
1109 ldlm_grant_lock_with_skiplist(lock);
1110 else if (res->lr_type == LDLM_EXTENT)
1111 ldlm_extent_add_lock(res, lock);
1112 else if (res->lr_type == LDLM_FLOCK) {
1113 /* We should not add locks to granted list in the following
1115 * - this is an UNLOCK but not a real lock;
1116 * - this is a TEST lock;
1117 * - this is a F_CANCELLK lock (async flock has req_mode == 0)
1118 * - this is a deadlock (flock cannot be granted) */
1119 if (lock->l_req_mode == 0 ||
1120 lock->l_req_mode == LCK_NL ||
1121 ldlm_is_test_lock(lock) ||
1122 ldlm_is_flock_deadlock(lock))
1124 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 (!equi(data->lmd_flags & LDLM_FL_LOCAL_ONLY, ldlm_is_local(lock)))
1211 return INTERVAL_ITER_CONT;
1213 if (data->lmd_flags & LDLM_FL_TEST_LOCK) {
1214 LDLM_LOCK_GET(lock);
1215 ldlm_lock_touch_in_lru(lock);
1217 ldlm_lock_addref_internal_nolock(lock, match);
1220 *data->lmd_mode = match;
1221 data->lmd_lock = lock;
1223 return INTERVAL_ITER_STOP;
1226 static unsigned int itree_overlap_cb(struct interval_node *in, void *args)
1228 struct ldlm_interval *node = to_ldlm_interval(in);
1229 struct lock_match_data *data = args;
1230 struct ldlm_lock *lock;
1233 list_for_each_entry(lock, &node->li_group, l_sl_policy) {
1234 rc = lock_matches(lock, data);
1235 if (rc == INTERVAL_ITER_STOP)
1236 return INTERVAL_ITER_STOP;
1238 return INTERVAL_ITER_CONT;
1242 * Search for a lock with given parameters in interval trees.
1244 * \param res search for a lock in this resource
1245 * \param data parameters
1247 * \retval a referenced lock or NULL.
1249 static struct ldlm_lock *search_itree(struct ldlm_resource *res,
1250 struct lock_match_data *data)
1252 struct interval_node_extent ext = {
1253 .start = data->lmd_policy->l_extent.start,
1254 .end = data->lmd_policy->l_extent.end
1258 for (idx = 0; idx < LCK_MODE_NUM; idx++) {
1259 struct ldlm_interval_tree *tree = &res->lr_itree[idx];
1261 if (tree->lit_root == NULL)
1264 if (!(tree->lit_mode & *data->lmd_mode))
1267 interval_search(tree->lit_root, &ext,
1268 itree_overlap_cb, data);
1270 return data->lmd_lock;
1275 * Search for a lock with given properties in a queue.
1277 * \param queue search for a lock in this queue
1278 * \param data parameters
1280 * \retval a referenced lock or NULL.
1282 static struct ldlm_lock *search_queue(struct list_head *queue,
1283 struct lock_match_data *data)
1285 struct ldlm_lock *lock;
1288 list_for_each_entry(lock, queue, l_res_link) {
1289 rc = lock_matches(lock, data);
1290 if (rc == INTERVAL_ITER_STOP)
1291 return data->lmd_lock;
1296 void ldlm_lock_fail_match_locked(struct ldlm_lock *lock)
1298 if ((lock->l_flags & LDLM_FL_FAIL_NOTIFIED) == 0) {
1299 lock->l_flags |= LDLM_FL_FAIL_NOTIFIED;
1300 wake_up_all(&lock->l_waitq);
1303 EXPORT_SYMBOL(ldlm_lock_fail_match_locked);
1305 void ldlm_lock_fail_match(struct ldlm_lock *lock)
1307 lock_res_and_lock(lock);
1308 ldlm_lock_fail_match_locked(lock);
1309 unlock_res_and_lock(lock);
1313 * Mark lock as "matchable" by OST.
1315 * Used to prevent certain races in LOV/OSC where the lock is granted, but LVB
1317 * Assumes LDLM lock is already locked.
1319 void ldlm_lock_allow_match_locked(struct ldlm_lock *lock)
1321 ldlm_set_lvb_ready(lock);
1322 wake_up_all(&lock->l_waitq);
1324 EXPORT_SYMBOL(ldlm_lock_allow_match_locked);
1327 * Mark lock as "matchable" by OST.
1328 * Locks the lock and then \see ldlm_lock_allow_match_locked
1330 void ldlm_lock_allow_match(struct ldlm_lock *lock)
1332 lock_res_and_lock(lock);
1333 ldlm_lock_allow_match_locked(lock);
1334 unlock_res_and_lock(lock);
1336 EXPORT_SYMBOL(ldlm_lock_allow_match);
1339 * Attempt to find a lock with specified properties.
1341 * Typically returns a reference to matched lock unless LDLM_FL_TEST_LOCK is
1344 * Can be called in two ways:
1346 * If 'ns' is NULL, then lockh describes an existing lock that we want to look
1347 * for a duplicate of.
1349 * Otherwise, all of the fields must be filled in, to match against.
1351 * If 'flags' contains LDLM_FL_LOCAL_ONLY, then only match local locks on the
1352 * server (ie, connh is NULL)
1353 * If 'flags' contains LDLM_FL_BLOCK_GRANTED, then only locks on the granted
1354 * list will be considered
1355 * If 'flags' contains LDLM_FL_CBPENDING, then locks that have been marked
1356 * to be canceled can still be matched as long as they still have reader
1357 * or writer refernces
1358 * If 'flags' contains LDLM_FL_TEST_LOCK, then don't actually reference a lock,
1359 * just tell us if we would have matched.
1361 * \retval 1 if it finds an already-existing lock that is compatible; in this
1362 * case, lockh is filled in with a addref()ed lock
1364 * We also check security context, and if that fails we simply return 0 (to
1365 * keep caller code unchanged), the context failure will be discovered by
1366 * caller sometime later.
1368 enum ldlm_mode ldlm_lock_match(struct ldlm_namespace *ns, __u64 flags,
1369 const struct ldlm_res_id *res_id,
1370 enum ldlm_type type,
1371 union ldlm_policy_data *policy,
1372 enum ldlm_mode mode,
1373 struct lustre_handle *lockh, int unref)
1375 struct lock_match_data data = {
1379 .lmd_policy = policy,
1383 struct ldlm_resource *res;
1384 struct ldlm_lock *lock;
1389 data.lmd_old = ldlm_handle2lock(lockh);
1390 LASSERT(data.lmd_old != NULL);
1392 ns = ldlm_lock_to_ns(data.lmd_old);
1393 res_id = &data.lmd_old->l_resource->lr_name;
1394 type = data.lmd_old->l_resource->lr_type;
1395 *data.lmd_mode = data.lmd_old->l_req_mode;
1398 res = ldlm_resource_get(ns, NULL, res_id, type, 0);
1400 LASSERT(data.lmd_old == NULL);
1404 LDLM_RESOURCE_ADDREF(res);
1407 if (res->lr_type == LDLM_EXTENT)
1408 lock = search_itree(res, &data);
1410 lock = search_queue(&res->lr_granted, &data);
1413 if (flags & LDLM_FL_BLOCK_GRANTED)
1415 lock = search_queue(&res->lr_waiting, &data);
1422 LDLM_RESOURCE_DELREF(res);
1423 ldlm_resource_putref(res);
1426 ldlm_lock2handle(lock, lockh);
1427 if ((flags & LDLM_FL_LVB_READY) &&
1428 (!ldlm_is_lvb_ready(lock))) {
1429 __u64 wait_flags = LDLM_FL_LVB_READY |
1430 LDLM_FL_DESTROYED | LDLM_FL_FAIL_NOTIFIED;
1431 struct l_wait_info lwi;
1432 if (lock->l_completion_ast) {
1433 int err = lock->l_completion_ast(lock,
1434 LDLM_FL_WAIT_NOREPROC,
1437 if (flags & LDLM_FL_TEST_LOCK)
1438 LDLM_LOCK_RELEASE(lock);
1440 ldlm_lock_decref_internal(lock,
1447 lwi = LWI_TIMEOUT_INTR(cfs_time_seconds(obd_timeout),
1448 NULL, LWI_ON_SIGNAL_NOOP, NULL);
1450 /* XXX FIXME see comment on CAN_MATCH in lustre_dlm.h */
1451 l_wait_event(lock->l_waitq,
1452 lock->l_flags & wait_flags,
1454 if (!ldlm_is_lvb_ready(lock)) {
1455 if (flags & LDLM_FL_TEST_LOCK)
1456 LDLM_LOCK_RELEASE(lock);
1458 ldlm_lock_decref_internal(lock, mode);
1465 LDLM_DEBUG(lock, "matched (%llu %llu)",
1466 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1467 res_id->name[2] : policy->l_extent.start,
1468 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1469 res_id->name[3] : policy->l_extent.end);
1471 /* check user's security context */
1472 if (lock->l_conn_export &&
1473 sptlrpc_import_check_ctx(
1474 class_exp2cliimp(lock->l_conn_export))) {
1475 if (!(flags & LDLM_FL_TEST_LOCK))
1476 ldlm_lock_decref_internal(lock, mode);
1480 if (flags & LDLM_FL_TEST_LOCK)
1481 LDLM_LOCK_RELEASE(lock);
1483 } else if (!(flags & LDLM_FL_TEST_LOCK)) {/*less verbose for test-only*/
1484 LDLM_DEBUG_NOLOCK("not matched ns %p type %u mode %u res "
1485 "%llu/%llu (%llu %llu)", ns,
1486 type, mode, res_id->name[0], res_id->name[1],
1487 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1488 res_id->name[2] :policy->l_extent.start,
1489 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1490 res_id->name[3] : policy->l_extent.end);
1492 if (data.lmd_old != NULL)
1493 LDLM_LOCK_PUT(data.lmd_old);
1495 return rc ? mode : 0;
1497 EXPORT_SYMBOL(ldlm_lock_match);
1499 enum ldlm_mode ldlm_revalidate_lock_handle(const struct lustre_handle *lockh,
1502 struct ldlm_lock *lock;
1503 enum ldlm_mode mode = 0;
1506 lock = ldlm_handle2lock(lockh);
1508 lock_res_and_lock(lock);
1509 if (LDLM_HAVE_MASK(lock, GONE))
1512 if (ldlm_is_cbpending(lock) &&
1513 lock->l_readers == 0 && lock->l_writers == 0)
1517 *bits = lock->l_policy_data.l_inodebits.bits;
1518 mode = lock->l_granted_mode;
1519 ldlm_lock_addref_internal_nolock(lock, mode);
1526 unlock_res_and_lock(lock);
1527 LDLM_LOCK_PUT(lock);
1531 EXPORT_SYMBOL(ldlm_revalidate_lock_handle);
1533 /** The caller must guarantee that the buffer is large enough. */
1534 int ldlm_fill_lvb(struct ldlm_lock *lock, struct req_capsule *pill,
1535 enum req_location loc, void *data, int size)
1540 LASSERT(data != NULL);
1543 switch (lock->l_lvb_type) {
1545 if (size == sizeof(struct ost_lvb)) {
1546 if (loc == RCL_CLIENT)
1547 lvb = req_capsule_client_swab_get(pill,
1549 lustre_swab_ost_lvb);
1551 lvb = req_capsule_server_swab_get(pill,
1553 lustre_swab_ost_lvb);
1554 if (unlikely(lvb == NULL)) {
1555 LDLM_ERROR(lock, "no LVB");
1559 memcpy(data, lvb, size);
1560 } else if (size == sizeof(struct ost_lvb_v1)) {
1561 struct ost_lvb *olvb = data;
1563 if (loc == RCL_CLIENT)
1564 lvb = req_capsule_client_swab_get(pill,
1566 lustre_swab_ost_lvb_v1);
1568 lvb = req_capsule_server_sized_swab_get(pill,
1570 lustre_swab_ost_lvb_v1);
1571 if (unlikely(lvb == NULL)) {
1572 LDLM_ERROR(lock, "no LVB");
1576 memcpy(data, lvb, size);
1577 olvb->lvb_mtime_ns = 0;
1578 olvb->lvb_atime_ns = 0;
1579 olvb->lvb_ctime_ns = 0;
1581 LDLM_ERROR(lock, "Replied unexpected ost LVB size %d",
1587 if (size == sizeof(struct lquota_lvb)) {
1588 if (loc == RCL_CLIENT)
1589 lvb = req_capsule_client_swab_get(pill,
1591 lustre_swab_lquota_lvb);
1593 lvb = req_capsule_server_swab_get(pill,
1595 lustre_swab_lquota_lvb);
1596 if (unlikely(lvb == NULL)) {
1597 LDLM_ERROR(lock, "no LVB");
1601 memcpy(data, lvb, size);
1603 LDLM_ERROR(lock, "Replied unexpected lquota LVB size %d",
1612 if (loc == RCL_CLIENT)
1613 lvb = req_capsule_client_get(pill, &RMF_DLM_LVB);
1615 lvb = req_capsule_server_get(pill, &RMF_DLM_LVB);
1616 if (unlikely(lvb == NULL)) {
1617 LDLM_ERROR(lock, "no LVB");
1621 memcpy(data, lvb, size);
1624 LDLM_ERROR(lock, "Unknown LVB type: %d", lock->l_lvb_type);
1625 libcfs_debug_dumpstack(NULL);
1633 * Create and fill in new LDLM lock with specified properties.
1634 * Returns a referenced lock
1636 struct ldlm_lock *ldlm_lock_create(struct ldlm_namespace *ns,
1637 const struct ldlm_res_id *res_id,
1638 enum ldlm_type type,
1639 enum ldlm_mode mode,
1640 const struct ldlm_callback_suite *cbs,
1641 void *data, __u32 lvb_len,
1642 enum lvb_type lvb_type)
1644 struct ldlm_lock *lock;
1645 struct ldlm_resource *res;
1649 res = ldlm_resource_get(ns, NULL, res_id, type, 1);
1651 RETURN(ERR_CAST(res));
1653 lock = ldlm_lock_new(res);
1655 RETURN(ERR_PTR(-ENOMEM));
1657 lock->l_req_mode = mode;
1658 lock->l_ast_data = data;
1659 lock->l_pid = current_pid();
1660 if (ns_is_server(ns))
1661 ldlm_set_ns_srv(lock);
1663 lock->l_blocking_ast = cbs->lcs_blocking;
1664 lock->l_completion_ast = cbs->lcs_completion;
1665 lock->l_glimpse_ast = cbs->lcs_glimpse;
1668 lock->l_tree_node = NULL;
1669 /* if this is the extent lock, allocate the interval tree node */
1670 if (type == LDLM_EXTENT)
1671 if (ldlm_interval_alloc(lock) == NULL)
1672 GOTO(out, rc = -ENOMEM);
1675 lock->l_lvb_len = lvb_len;
1676 OBD_ALLOC_LARGE(lock->l_lvb_data, lvb_len);
1677 if (lock->l_lvb_data == NULL)
1678 GOTO(out, rc = -ENOMEM);
1681 lock->l_lvb_type = lvb_type;
1682 if (OBD_FAIL_CHECK(OBD_FAIL_LDLM_NEW_LOCK))
1683 GOTO(out, rc = -ENOENT);
1688 ldlm_lock_destroy(lock);
1689 LDLM_LOCK_RELEASE(lock);
1690 RETURN(ERR_PTR(rc));
1693 #ifdef HAVE_SERVER_SUPPORT
1694 static enum ldlm_error ldlm_lock_enqueue_helper(struct ldlm_lock *lock,
1697 struct ldlm_resource *res = lock->l_resource;
1698 enum ldlm_error rc = ELDLM_OK;
1699 struct list_head rpc_list = LIST_HEAD_INIT(rpc_list);
1700 ldlm_processing_policy policy;
1703 policy = ldlm_processing_policy_table[res->lr_type];
1705 policy(lock, flags, LDLM_PROCESS_ENQUEUE, &rc, &rpc_list);
1706 if (rc == ELDLM_OK && lock->l_granted_mode != lock->l_req_mode &&
1707 res->lr_type != LDLM_FLOCK) {
1708 rc = ldlm_handle_conflict_lock(lock, flags, &rpc_list);
1709 if (rc == -ERESTART)
1713 if (!list_empty(&rpc_list))
1714 ldlm_discard_bl_list(&rpc_list);
1721 * Enqueue (request) a lock.
1723 * Does not block. As a result of enqueue the lock would be put
1724 * into granted or waiting list.
1726 * If namespace has intent policy sent and the lock has LDLM_FL_HAS_INTENT flag
1727 * set, skip all the enqueueing and delegate lock processing to intent policy
1730 enum ldlm_error ldlm_lock_enqueue(struct ldlm_namespace *ns,
1731 struct ldlm_lock **lockp,
1732 void *cookie, __u64 *flags)
1734 struct ldlm_lock *lock = *lockp;
1735 struct ldlm_resource *res = lock->l_resource;
1736 int local = ns_is_client(ldlm_res_to_ns(res));
1737 enum ldlm_error rc = ELDLM_OK;
1738 struct ldlm_interval *node = NULL;
1741 /* policies are not executed on the client or during replay */
1742 if ((*flags & (LDLM_FL_HAS_INTENT|LDLM_FL_REPLAY)) == LDLM_FL_HAS_INTENT
1743 && !local && ns->ns_policy) {
1744 rc = ns->ns_policy(ns, lockp, cookie, lock->l_req_mode, *flags,
1746 if (rc == ELDLM_LOCK_REPLACED) {
1747 /* The lock that was returned has already been granted,
1748 * and placed into lockp. If it's not the same as the
1749 * one we passed in, then destroy the old one and our
1750 * work here is done. */
1751 if (lock != *lockp) {
1752 ldlm_lock_destroy(lock);
1753 LDLM_LOCK_RELEASE(lock);
1755 *flags |= LDLM_FL_LOCK_CHANGED;
1757 } else if (rc != ELDLM_OK &&
1758 lock->l_req_mode == lock->l_granted_mode) {
1759 LASSERT(*flags & LDLM_FL_RESENT);
1760 /* It may happen that ns_policy returns an error in
1761 * resend case, object may be unlinked or just some
1762 * error occurs. It is unclear if lock reached the
1763 * client in the original reply, just leave the lock on
1764 * server, not returning it again to client. Due to
1765 * LU-6529, the server will not OOM. */
1767 } else if (rc != ELDLM_OK ||
1768 (rc == ELDLM_OK && (*flags & LDLM_FL_INTENT_ONLY))) {
1769 ldlm_lock_destroy(lock);
1774 if (*flags & LDLM_FL_RESENT) {
1775 /* Reconstruct LDLM_FL_SRV_ENQ_MASK @flags for reply.
1776 * Set LOCK_CHANGED always.
1777 * Check if the lock is granted for BLOCK_GRANTED.
1778 * Take NO_TIMEOUT from the lock as it is inherited through
1779 * LDLM_FL_INHERIT_MASK */
1780 *flags |= LDLM_FL_LOCK_CHANGED;
1781 if (lock->l_req_mode != lock->l_granted_mode)
1782 *flags |= LDLM_FL_BLOCK_GRANTED;
1783 *flags |= lock->l_flags & LDLM_FL_NO_TIMEOUT;
1787 /* For a replaying lock, it might be already in granted list. So
1788 * unlinking the lock will cause the interval node to be freed, we
1789 * have to allocate the interval node early otherwise we can't regrant
1790 * this lock in the future. - jay */
1791 if (!local && (*flags & LDLM_FL_REPLAY) && res->lr_type == LDLM_EXTENT)
1792 OBD_SLAB_ALLOC_PTR_GFP(node, ldlm_interval_slab, GFP_NOFS);
1794 lock_res_and_lock(lock);
1795 if (local && lock->l_req_mode == lock->l_granted_mode) {
1796 /* The server returned a blocked lock, but it was granted
1797 * before we got a chance to actually enqueue it. We don't
1798 * need to do anything else. */
1799 *flags &= ~LDLM_FL_BLOCKED_MASK;
1800 GOTO(out, rc = ELDLM_OK);
1803 ldlm_resource_unlink_lock(lock);
1804 if (res->lr_type == LDLM_EXTENT && lock->l_tree_node == NULL) {
1806 ldlm_lock_destroy_nolock(lock);
1807 GOTO(out, rc = -ENOMEM);
1810 INIT_LIST_HEAD(&node->li_group);
1811 ldlm_interval_attach(node, lock);
1815 /* Some flags from the enqueue want to make it into the AST, via the
1816 * lock's l_flags. */
1817 if (*flags & LDLM_FL_AST_DISCARD_DATA)
1818 ldlm_set_ast_discard_data(lock);
1819 if (*flags & LDLM_FL_TEST_LOCK)
1820 ldlm_set_test_lock(lock);
1821 if (*flags & LDLM_FL_COS_INCOMPAT)
1822 ldlm_set_cos_incompat(lock);
1823 if (*flags & LDLM_FL_COS_ENABLED)
1824 ldlm_set_cos_enabled(lock);
1826 /* This distinction between local lock trees is very important; a client
1827 * namespace only has information about locks taken by that client, and
1828 * thus doesn't have enough information to decide for itself if it can
1829 * be granted (below). In this case, we do exactly what the server
1830 * tells us to do, as dictated by the 'flags'.
1832 * We do exactly the same thing during recovery, when the server is
1833 * more or less trusting the clients not to lie.
1835 * FIXME (bug 268): Detect obvious lies by checking compatibility in
1838 if (*flags & (LDLM_FL_BLOCK_WAIT | LDLM_FL_BLOCK_GRANTED))
1839 ldlm_resource_add_lock(res, &res->lr_waiting, lock);
1841 ldlm_grant_lock(lock, NULL);
1842 GOTO(out, rc = ELDLM_OK);
1843 #ifdef HAVE_SERVER_SUPPORT
1844 } else if (*flags & LDLM_FL_REPLAY) {
1845 if (*flags & LDLM_FL_BLOCK_WAIT) {
1846 ldlm_resource_add_lock(res, &res->lr_waiting, lock);
1847 GOTO(out, rc = ELDLM_OK);
1848 } else if (*flags & LDLM_FL_BLOCK_GRANTED) {
1849 ldlm_grant_lock(lock, NULL);
1850 GOTO(out, rc = ELDLM_OK);
1852 /* If no flags, fall through to normal enqueue path. */
1855 rc = ldlm_lock_enqueue_helper(lock, flags);
1859 CERROR("This is client-side-only module, cannot handle "
1860 "LDLM_NAMESPACE_SERVER resource type lock.\n");
1866 unlock_res_and_lock(lock);
1868 OBD_SLAB_FREE(node, ldlm_interval_slab, sizeof(*node));
1872 #ifdef HAVE_SERVER_SUPPORT
1874 * Iterate through all waiting locks on a given resource queue and attempt to
1877 * Must be called with resource lock held.
1879 int ldlm_reprocess_queue(struct ldlm_resource *res, struct list_head *queue,
1880 struct list_head *work_list,
1881 enum ldlm_process_intention intention)
1883 struct list_head *tmp, *pos;
1884 ldlm_processing_policy policy;
1886 int rc = LDLM_ITER_CONTINUE;
1887 enum ldlm_error err;
1888 struct list_head bl_ast_list = LIST_HEAD_INIT(bl_ast_list);
1891 check_res_locked(res);
1893 policy = ldlm_processing_policy_table[res->lr_type];
1895 LASSERT(intention == LDLM_PROCESS_RESCAN ||
1896 intention == LDLM_PROCESS_RECOVERY);
1899 list_for_each_safe(tmp, pos, queue) {
1900 struct ldlm_lock *pending;
1901 struct list_head rpc_list = LIST_HEAD_INIT(rpc_list);
1903 pending = list_entry(tmp, struct ldlm_lock, l_res_link);
1905 CDEBUG(D_INFO, "Reprocessing lock %p\n", pending);
1908 rc = policy(pending, &flags, intention, &err, &rpc_list);
1909 if (pending->l_granted_mode == pending->l_req_mode ||
1910 res->lr_type == LDLM_FLOCK) {
1911 list_splice(&rpc_list, work_list);
1913 list_splice(&rpc_list, &bl_ast_list);
1916 * When this is called from recovery done, we always want
1917 * to scan the whole list no matter what 'rc' is returned.
1919 if (rc != LDLM_ITER_CONTINUE &&
1920 intention == LDLM_PROCESS_RESCAN)
1924 if (!list_empty(&bl_ast_list)) {
1927 rc = ldlm_run_ast_work(ldlm_res_to_ns(res), &bl_ast_list,
1931 if (rc == -ERESTART)
1935 if (!list_empty(&bl_ast_list))
1936 ldlm_discard_bl_list(&bl_ast_list);
1938 RETURN(intention == LDLM_PROCESS_RESCAN ? rc : LDLM_ITER_CONTINUE);
1942 * Conflicting locks are detected for a lock to be enqueued, add the lock
1943 * into waiting list and send blocking ASTs to the conflicting locks.
1945 * \param[in] lock The lock to be enqueued.
1946 * \param[out] flags Lock flags for the lock to be enqueued.
1947 * \param[in] rpc_list Conflicting locks list.
1949 * \retval -ERESTART: Some lock was instantly canceled while sending
1950 * blocking ASTs, caller needs to re-check conflicting
1952 * \retval -EAGAIN: Lock was destroyed, caller should return error.
1953 * \reval 0: Lock is successfully added in waiting list.
1955 int ldlm_handle_conflict_lock(struct ldlm_lock *lock, __u64 *flags,
1956 struct list_head *rpc_list)
1958 struct ldlm_resource *res = lock->l_resource;
1962 check_res_locked(res);
1964 /* If either of the compat_queue()s returned failure, then we
1965 * have ASTs to send and must go onto the waiting list.
1967 * bug 2322: we used to unlink and re-add here, which was a
1968 * terrible folly -- if we goto restart, we could get
1969 * re-ordered! Causes deadlock, because ASTs aren't sent! */
1970 if (list_empty(&lock->l_res_link))
1971 ldlm_resource_add_lock(res, &res->lr_waiting, lock);
1974 rc = ldlm_run_ast_work(ldlm_res_to_ns(res), rpc_list,
1977 if (OBD_FAIL_CHECK(OBD_FAIL_LDLM_OST_FAIL_RACE) &&
1978 !ns_is_client(ldlm_res_to_ns(res)))
1979 class_fail_export(lock->l_export);
1982 if (rc == -ERESTART) {
1983 /* 15715: The lock was granted and destroyed after
1984 * resource lock was dropped. Interval node was freed
1985 * in ldlm_lock_destroy. Anyway, this always happens
1986 * when a client is being evicted. So it would be
1987 * ok to return an error. -jay */
1988 if (ldlm_is_destroyed(lock))
1991 /* lock was granted while resource was unlocked. */
1992 if (lock->l_granted_mode == lock->l_req_mode) {
1993 /* bug 11300: if the lock has been granted,
1994 * break earlier because otherwise, we will go
1995 * to restart and ldlm_resource_unlink will be
1996 * called and it causes the interval node to be
1997 * freed. Then we will fail at
1998 * ldlm_extent_add_lock() */
1999 *flags &= ~LDLM_FL_BLOCKED_MASK;
2005 *flags |= LDLM_FL_BLOCK_GRANTED;
2011 * Discard all AST work items from list.
2013 * If for whatever reason we do not want to send ASTs to conflicting locks
2014 * anymore, disassemble the list with this function.
2016 void ldlm_discard_bl_list(struct list_head *bl_list)
2018 struct list_head *tmp, *pos;
2021 list_for_each_safe(pos, tmp, bl_list) {
2022 struct ldlm_lock *lock =
2023 list_entry(pos, struct ldlm_lock, l_bl_ast);
2025 list_del_init(&lock->l_bl_ast);
2026 LASSERT(ldlm_is_ast_sent(lock));
2027 ldlm_clear_ast_sent(lock);
2028 LASSERT(lock->l_bl_ast_run == 0);
2029 LASSERT(lock->l_blocking_lock);
2030 LDLM_LOCK_RELEASE(lock->l_blocking_lock);
2031 lock->l_blocking_lock = NULL;
2032 LDLM_LOCK_RELEASE(lock);
2040 * Process a call to blocking AST callback for a lock in ast_work list
2043 ldlm_work_bl_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
2045 struct ldlm_cb_set_arg *arg = opaq;
2046 struct ldlm_lock_desc d;
2048 struct ldlm_lock *lock;
2051 if (list_empty(arg->list))
2054 lock = list_entry(arg->list->next, struct ldlm_lock, l_bl_ast);
2056 /* nobody should touch l_bl_ast */
2057 lock_res_and_lock(lock);
2058 list_del_init(&lock->l_bl_ast);
2060 LASSERT(ldlm_is_ast_sent(lock));
2061 LASSERT(lock->l_bl_ast_run == 0);
2062 LASSERT(lock->l_blocking_lock);
2063 lock->l_bl_ast_run++;
2064 unlock_res_and_lock(lock);
2066 ldlm_lock2desc(lock->l_blocking_lock, &d);
2067 /* copy blocking lock ibits in cancel_bits as well,
2068 * new client may use them for lock convert and it is
2069 * important to use new field to convert locks from
2072 d.l_policy_data.l_inodebits.cancel_bits =
2073 lock->l_blocking_lock->l_policy_data.l_inodebits.bits;
2075 rc = lock->l_blocking_ast(lock, &d, (void *)arg, LDLM_CB_BLOCKING);
2076 LDLM_LOCK_RELEASE(lock->l_blocking_lock);
2077 lock->l_blocking_lock = NULL;
2078 LDLM_LOCK_RELEASE(lock);
2084 * Process a call to completion AST callback for a lock in ast_work list
2087 ldlm_work_cp_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
2089 struct ldlm_cb_set_arg *arg = opaq;
2091 struct ldlm_lock *lock;
2092 ldlm_completion_callback completion_callback;
2095 if (list_empty(arg->list))
2098 lock = list_entry(arg->list->next, struct ldlm_lock, l_cp_ast);
2100 /* It's possible to receive a completion AST before we've set
2101 * the l_completion_ast pointer: either because the AST arrived
2102 * before the reply, or simply because there's a small race
2103 * window between receiving the reply and finishing the local
2104 * enqueue. (bug 842)
2106 * This can't happen with the blocking_ast, however, because we
2107 * will never call the local blocking_ast until we drop our
2108 * reader/writer reference, which we won't do until we get the
2109 * reply and finish enqueueing. */
2111 /* nobody should touch l_cp_ast */
2112 lock_res_and_lock(lock);
2113 list_del_init(&lock->l_cp_ast);
2114 LASSERT(ldlm_is_cp_reqd(lock));
2115 /* save l_completion_ast since it can be changed by
2116 * mds_intent_policy(), see bug 14225 */
2117 completion_callback = lock->l_completion_ast;
2118 ldlm_clear_cp_reqd(lock);
2119 unlock_res_and_lock(lock);
2121 if (completion_callback != NULL)
2122 rc = completion_callback(lock, 0, (void *)arg);
2123 LDLM_LOCK_RELEASE(lock);
2129 * Process a call to revocation AST callback for a lock in ast_work list
2132 ldlm_work_revoke_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
2134 struct ldlm_cb_set_arg *arg = opaq;
2135 struct ldlm_lock_desc desc;
2137 struct ldlm_lock *lock;
2140 if (list_empty(arg->list))
2143 lock = list_entry(arg->list->next, struct ldlm_lock, l_rk_ast);
2144 list_del_init(&lock->l_rk_ast);
2146 /* the desc just pretend to exclusive */
2147 ldlm_lock2desc(lock, &desc);
2148 desc.l_req_mode = LCK_EX;
2149 desc.l_granted_mode = 0;
2151 rc = lock->l_blocking_ast(lock, &desc, (void*)arg, LDLM_CB_BLOCKING);
2152 LDLM_LOCK_RELEASE(lock);
2158 * Process a call to glimpse AST callback for a lock in ast_work list
2160 int ldlm_work_gl_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
2162 struct ldlm_cb_set_arg *arg = opaq;
2163 struct ldlm_glimpse_work *gl_work;
2164 struct ldlm_lock *lock;
2168 if (list_empty(arg->list))
2171 gl_work = list_entry(arg->list->next, struct ldlm_glimpse_work,
2173 list_del_init(&gl_work->gl_list);
2175 lock = gl_work->gl_lock;
2177 /* transfer the glimpse descriptor to ldlm_cb_set_arg */
2178 arg->gl_desc = gl_work->gl_desc;
2179 arg->gl_interpret_reply = gl_work->gl_interpret_reply;
2180 arg->gl_interpret_data = gl_work->gl_interpret_data;
2182 /* invoke the actual glimpse callback */
2183 if (lock->l_glimpse_ast(lock, (void*)arg) == 0)
2186 LDLM_LOCK_RELEASE(lock);
2187 if (gl_work->gl_flags & LDLM_GL_WORK_SLAB_ALLOCATED)
2188 OBD_SLAB_FREE_PTR(gl_work, ldlm_glimpse_work_kmem);
2190 OBD_FREE_PTR(gl_work);
2196 * Process list of locks in need of ASTs being sent.
2198 * Used on server to send multiple ASTs together instead of sending one by
2201 int ldlm_run_ast_work(struct ldlm_namespace *ns, struct list_head *rpc_list,
2202 ldlm_desc_ast_t ast_type)
2204 struct ldlm_cb_set_arg *arg;
2205 set_producer_func work_ast_lock;
2208 if (list_empty(rpc_list))
2215 atomic_set(&arg->restart, 0);
2216 arg->list = rpc_list;
2219 case LDLM_WORK_BL_AST:
2220 arg->type = LDLM_BL_CALLBACK;
2221 work_ast_lock = ldlm_work_bl_ast_lock;
2223 case LDLM_WORK_CP_AST:
2224 arg->type = LDLM_CP_CALLBACK;
2225 work_ast_lock = ldlm_work_cp_ast_lock;
2227 case LDLM_WORK_REVOKE_AST:
2228 arg->type = LDLM_BL_CALLBACK;
2229 work_ast_lock = ldlm_work_revoke_ast_lock;
2231 case LDLM_WORK_GL_AST:
2232 arg->type = LDLM_GL_CALLBACK;
2233 work_ast_lock = ldlm_work_gl_ast_lock;
2239 /* We create a ptlrpc request set with flow control extension.
2240 * This request set will use the work_ast_lock function to produce new
2241 * requests and will send a new request each time one completes in order
2242 * to keep the number of requests in flight to ns_max_parallel_ast */
2243 arg->set = ptlrpc_prep_fcset(ns->ns_max_parallel_ast ? : UINT_MAX,
2244 work_ast_lock, arg);
2245 if (arg->set == NULL)
2246 GOTO(out, rc = -ENOMEM);
2248 ptlrpc_set_wait(arg->set);
2249 ptlrpc_set_destroy(arg->set);
2251 rc = atomic_read(&arg->restart) ? -ERESTART : 0;
2259 * Try to grant all waiting locks on a resource.
2261 * Calls ldlm_reprocess_queue on waiting queue.
2263 * Typically called after some resource locks are cancelled to see
2264 * if anything could be granted as a result of the cancellation.
2266 static void __ldlm_reprocess_all(struct ldlm_resource *res,
2267 enum ldlm_process_intention intention)
2269 struct list_head rpc_list;
2270 #ifdef HAVE_SERVER_SUPPORT
2271 struct obd_device *obd;
2275 INIT_LIST_HEAD(&rpc_list);
2276 /* Local lock trees don't get reprocessed. */
2277 if (ns_is_client(ldlm_res_to_ns(res))) {
2282 /* Disable reprocess during lock replay stage but allow during
2283 * request replay stage.
2285 obd = ldlm_res_to_ns(res)->ns_obd;
2286 if (obd->obd_recovering &&
2287 atomic_read(&obd->obd_req_replay_clients) == 0)
2291 ldlm_reprocess_queue(res, &res->lr_waiting, &rpc_list, intention);
2294 rc = ldlm_run_ast_work(ldlm_res_to_ns(res), &rpc_list,
2296 if (rc == -ERESTART) {
2297 LASSERT(list_empty(&rpc_list));
2303 INIT_LIST_HEAD(&rpc_list);
2304 if (!ns_is_client(ldlm_res_to_ns(res))) {
2305 CERROR("This is client-side-only module, cannot handle "
2306 "LDLM_NAMESPACE_SERVER resource type lock.\n");
2313 void ldlm_reprocess_all(struct ldlm_resource *res)
2315 __ldlm_reprocess_all(res, LDLM_PROCESS_RESCAN);
2317 EXPORT_SYMBOL(ldlm_reprocess_all);
2319 static int ldlm_reprocess_res(struct cfs_hash *hs, struct cfs_hash_bd *bd,
2320 struct hlist_node *hnode, void *arg)
2322 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
2324 /* This is only called once after recovery done. LU-8306. */
2325 __ldlm_reprocess_all(res, LDLM_PROCESS_RECOVERY);
2330 * Iterate through all resources on a namespace attempting to grant waiting
2333 void ldlm_reprocess_recovery_done(struct ldlm_namespace *ns)
2338 cfs_hash_for_each_nolock(ns->ns_rs_hash,
2339 ldlm_reprocess_res, NULL, 0);
2345 * Helper function to call blocking AST for LDLM lock \a lock in a
2346 * "cancelling" mode.
2348 void ldlm_cancel_callback(struct ldlm_lock *lock)
2350 check_res_locked(lock->l_resource);
2351 if (!ldlm_is_cancel(lock)) {
2352 ldlm_set_cancel(lock);
2353 if (lock->l_blocking_ast) {
2354 unlock_res_and_lock(lock);
2355 lock->l_blocking_ast(lock, NULL, lock->l_ast_data,
2357 lock_res_and_lock(lock);
2359 LDLM_DEBUG(lock, "no blocking ast");
2362 /* only canceller can set bl_done bit */
2363 ldlm_set_bl_done(lock);
2364 wake_up_all(&lock->l_waitq);
2365 } else if (!ldlm_is_bl_done(lock)) {
2366 struct l_wait_info lwi = { 0 };
2368 /* The lock is guaranteed to have been canceled once
2369 * returning from this function. */
2370 unlock_res_and_lock(lock);
2371 l_wait_event(lock->l_waitq, is_bl_done(lock), &lwi);
2372 lock_res_and_lock(lock);
2377 * Remove skiplist-enabled LDLM lock \a req from granted list
2379 void ldlm_unlink_lock_skiplist(struct ldlm_lock *req)
2381 if (req->l_resource->lr_type != LDLM_PLAIN &&
2382 req->l_resource->lr_type != LDLM_IBITS)
2385 list_del_init(&req->l_sl_policy);
2386 list_del_init(&req->l_sl_mode);
2390 * Attempts to cancel LDLM lock \a lock that has no reader/writer references.
2392 void ldlm_lock_cancel(struct ldlm_lock *lock)
2394 struct ldlm_resource *res;
2395 struct ldlm_namespace *ns;
2398 lock_res_and_lock(lock);
2400 res = lock->l_resource;
2401 ns = ldlm_res_to_ns(res);
2403 /* Please do not, no matter how tempting, remove this LBUG without
2404 * talking to me first. -phik */
2405 if (lock->l_readers || lock->l_writers) {
2406 LDLM_ERROR(lock, "lock still has references");
2407 unlock_res_and_lock(lock);
2411 if (ldlm_is_waited(lock))
2412 ldlm_del_waiting_lock(lock);
2414 /* Releases cancel callback. */
2415 ldlm_cancel_callback(lock);
2417 /* Yes, second time, just in case it was added again while we were
2418 * running with no res lock in ldlm_cancel_callback */
2419 if (ldlm_is_waited(lock))
2420 ldlm_del_waiting_lock(lock);
2422 ldlm_resource_unlink_lock(lock);
2423 ldlm_lock_destroy_nolock(lock);
2425 if (lock->l_granted_mode == lock->l_req_mode)
2426 ldlm_pool_del(&ns->ns_pool, lock);
2428 /* Make sure we will not be called again for same lock what is possible
2429 * if not to zero out lock->l_granted_mode */
2430 lock->l_granted_mode = LCK_MINMODE;
2431 unlock_res_and_lock(lock);
2435 EXPORT_SYMBOL(ldlm_lock_cancel);
2438 * Set opaque data into the lock that only makes sense to upper layer.
2440 int ldlm_lock_set_data(const struct lustre_handle *lockh, void *data)
2442 struct ldlm_lock *lock = ldlm_handle2lock(lockh);
2447 if (lock->l_ast_data == NULL)
2448 lock->l_ast_data = data;
2449 if (lock->l_ast_data == data)
2451 LDLM_LOCK_PUT(lock);
2455 EXPORT_SYMBOL(ldlm_lock_set_data);
2457 struct export_cl_data {
2458 struct obd_export *ecl_exp;
2462 static void ldlm_cancel_lock_for_export(struct obd_export *exp,
2463 struct ldlm_lock *lock,
2464 struct export_cl_data *ecl)
2466 struct ldlm_resource *res;
2468 res = ldlm_resource_getref(lock->l_resource);
2470 ldlm_lvbo_update(res, lock, NULL, 1);
2471 ldlm_lock_cancel(lock);
2472 if (!exp->exp_obd->obd_stopping)
2473 ldlm_reprocess_all(res);
2474 ldlm_resource_putref(res);
2477 if ((ecl->ecl_loop & -ecl->ecl_loop) == ecl->ecl_loop) {
2478 CDEBUG(D_INFO, "Export %p, %d locks cancelled.\n",
2479 exp, ecl->ecl_loop);
2484 * Iterator function for ldlm_export_cancel_locks.
2485 * Cancels passed locks.
2488 ldlm_cancel_locks_for_export_cb(struct cfs_hash *hs, struct cfs_hash_bd *bd,
2489 struct hlist_node *hnode, void *data)
2492 struct export_cl_data *ecl = (struct export_cl_data *)data;
2493 struct obd_export *exp = ecl->ecl_exp;
2494 struct ldlm_lock *lock = cfs_hash_object(hs, hnode);
2496 LDLM_LOCK_GET(lock);
2497 ldlm_cancel_lock_for_export(exp, lock, ecl);
2498 LDLM_LOCK_RELEASE(lock);
2504 * Cancel all blocked locks for given export.
2506 * Typically called on client disconnection/eviction
2508 int ldlm_export_cancel_blocked_locks(struct obd_export *exp)
2510 struct export_cl_data ecl = {
2515 while (!list_empty(&exp->exp_bl_list)) {
2516 struct ldlm_lock *lock;
2518 spin_lock_bh(&exp->exp_bl_list_lock);
2519 if (!list_empty(&exp->exp_bl_list)) {
2520 lock = list_entry(exp->exp_bl_list.next,
2521 struct ldlm_lock, l_exp_list);
2522 LDLM_LOCK_GET(lock);
2523 list_del_init(&lock->l_exp_list);
2527 spin_unlock_bh(&exp->exp_bl_list_lock);
2532 ldlm_cancel_lock_for_export(exp, lock, &ecl);
2533 LDLM_LOCK_RELEASE(lock);
2536 CDEBUG(D_DLMTRACE, "Export %p, canceled %d locks, "
2537 "left on hash table %d.\n", exp, ecl.ecl_loop,
2538 atomic_read(&exp->exp_lock_hash->hs_count));
2540 return ecl.ecl_loop;
2544 * Cancel all locks for given export.
2546 * Typically called after client disconnection/eviction
2548 int ldlm_export_cancel_locks(struct obd_export *exp)
2550 struct export_cl_data ecl = {
2555 cfs_hash_for_each_empty(exp->exp_lock_hash,
2556 ldlm_cancel_locks_for_export_cb, &ecl);
2558 CDEBUG(D_DLMTRACE, "Export %p, canceled %d locks, "
2559 "left on hash table %d.\n", exp, ecl.ecl_loop,
2560 atomic_read(&exp->exp_lock_hash->hs_count));
2562 if (ecl.ecl_loop > 0 &&
2563 atomic_read(&exp->exp_lock_hash->hs_count) == 0 &&
2564 exp->exp_obd->obd_stopping)
2565 ldlm_reprocess_recovery_done(exp->exp_obd->obd_namespace);
2567 return ecl.ecl_loop;
2571 * Downgrade an PW/EX lock to COS mode.
2573 * A lock mode convertion from PW/EX mode to less conflict mode. The
2574 * convertion may fail if lock was canceled before downgrade, but it doesn't
2575 * indicate any problem, because such lock has no reader or writer, and will
2577 * Used by Commit on Sharing (COS) code only for now.
2579 * \param lock A lock to convert
2580 * \param new_mode new lock mode
2582 void ldlm_lock_mode_downgrade(struct ldlm_lock *lock, enum ldlm_mode new_mode)
2586 LASSERT(new_mode == LCK_COS);
2588 lock_res_and_lock(lock);
2590 if (!(lock->l_granted_mode & (LCK_PW | LCK_EX))) {
2591 unlock_res_and_lock(lock);
2593 LASSERT(lock->l_granted_mode == LCK_MINMODE);
2594 LDLM_DEBUG(lock, "lock was canceled before downgrade");
2598 ldlm_resource_unlink_lock(lock);
2600 * Remove the lock from pool as it will be added again in
2601 * ldlm_grant_lock() called below.
2603 ldlm_pool_del(&ldlm_lock_to_ns(lock)->ns_pool, lock);
2604 lock->l_req_mode = new_mode;
2605 ldlm_grant_lock(lock, NULL);
2607 unlock_res_and_lock(lock);
2609 ldlm_reprocess_all(lock->l_resource);
2613 EXPORT_SYMBOL(ldlm_lock_mode_downgrade);
2616 * Print lock with lock handle \a lockh description into debug log.
2618 * Used when printing all locks on a resource for debug purposes.
2620 void ldlm_lock_dump_handle(int level, const struct lustre_handle *lockh)
2622 struct ldlm_lock *lock;
2624 if (!((libcfs_debug | D_ERROR) & level))
2627 lock = ldlm_handle2lock(lockh);
2631 LDLM_DEBUG_LIMIT(level, lock, "###");
2633 LDLM_LOCK_PUT(lock);
2635 EXPORT_SYMBOL(ldlm_lock_dump_handle);
2638 * Print lock information with custom message into debug log.
2641 void _ldlm_lock_debug(struct ldlm_lock *lock,
2642 struct libcfs_debug_msg_data *msgdata,
2643 const char *fmt, ...)
2646 struct obd_export *exp = lock->l_export;
2647 struct ldlm_resource *resource = NULL;
2648 char *nid = "local";
2650 /* on server-side resource of lock doesn't change */
2651 if ((lock->l_flags & LDLM_FL_NS_SRV) != 0) {
2652 if (lock->l_resource != NULL)
2653 resource = ldlm_resource_getref(lock->l_resource);
2654 } else if (spin_trylock(&lock->l_lock)) {
2655 if (lock->l_resource != NULL)
2656 resource = ldlm_resource_getref(lock->l_resource);
2657 spin_unlock(&lock->l_lock);
2660 va_start(args, fmt);
2662 if (exp && exp->exp_connection) {
2663 nid = obd_export_nid2str(exp);
2664 } else if (exp && exp->exp_obd != NULL) {
2665 struct obd_import *imp = exp->exp_obd->u.cli.cl_import;
2666 nid = obd_import_nid2str(imp);
2669 if (resource == NULL) {
2670 libcfs_debug_vmsg2(msgdata, fmt, args,
2671 " ns: \?\? lock: %p/%#llx lrc: %d/%d,%d mode: %s/%s "
2672 "res: \?\? rrc=\?\? type: \?\?\? flags: %#llx nid: %s "
2673 "remote: %#llx expref: %d pid: %u timeout: %lld "
2676 lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
2677 lock->l_readers, lock->l_writers,
2678 ldlm_lockname[lock->l_granted_mode],
2679 ldlm_lockname[lock->l_req_mode],
2680 lock->l_flags, nid, lock->l_remote_handle.cookie,
2681 exp ? atomic_read(&exp->exp_refcount) : -99,
2682 lock->l_pid, lock->l_callback_timeout, lock->l_lvb_type);
2687 switch (resource->lr_type) {
2689 libcfs_debug_vmsg2(msgdata, fmt, args,
2690 " ns: %s lock: %p/%#llx lrc: %d/%d,%d mode: %s/%s "
2691 "res: "DLDLMRES" rrc: %d type: %s [%llu->%llu] "
2692 "(req %llu->%llu) flags: %#llx nid: %s remote: "
2693 "%#llx expref: %d pid: %u timeout: %lld lvb_type: %d\n",
2694 ldlm_lock_to_ns_name(lock), lock,
2695 lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
2696 lock->l_readers, lock->l_writers,
2697 ldlm_lockname[lock->l_granted_mode],
2698 ldlm_lockname[lock->l_req_mode],
2700 atomic_read(&resource->lr_refcount),
2701 ldlm_typename[resource->lr_type],
2702 lock->l_policy_data.l_extent.start,
2703 lock->l_policy_data.l_extent.end,
2704 lock->l_req_extent.start, lock->l_req_extent.end,
2705 lock->l_flags, nid, lock->l_remote_handle.cookie,
2706 exp ? atomic_read(&exp->exp_refcount) : -99,
2707 lock->l_pid, lock->l_callback_timeout,
2712 libcfs_debug_vmsg2(msgdata, fmt, args,
2713 " ns: %s lock: %p/%#llx lrc: %d/%d,%d mode: %s/%s "
2714 "res: "DLDLMRES" rrc: %d type: %s pid: %d "
2715 "[%llu->%llu] flags: %#llx nid: %s "
2716 "remote: %#llx expref: %d pid: %u timeout: %lld\n",
2717 ldlm_lock_to_ns_name(lock), lock,
2718 lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
2719 lock->l_readers, lock->l_writers,
2720 ldlm_lockname[lock->l_granted_mode],
2721 ldlm_lockname[lock->l_req_mode],
2723 atomic_read(&resource->lr_refcount),
2724 ldlm_typename[resource->lr_type],
2725 lock->l_policy_data.l_flock.pid,
2726 lock->l_policy_data.l_flock.start,
2727 lock->l_policy_data.l_flock.end,
2728 lock->l_flags, nid, lock->l_remote_handle.cookie,
2729 exp ? atomic_read(&exp->exp_refcount) : -99,
2730 lock->l_pid, lock->l_callback_timeout);
2734 libcfs_debug_vmsg2(msgdata, fmt, args,
2735 " ns: %s lock: %p/%#llx lrc: %d/%d,%d mode: %s/%s "
2736 "res: "DLDLMRES" bits %#llx/%#llx rrc: %d type: %s "
2737 "flags: %#llx nid: %s remote: %#llx expref: %d "
2738 "pid: %u timeout: %lld lvb_type: %d\n",
2739 ldlm_lock_to_ns_name(lock),
2740 lock, lock->l_handle.h_cookie,
2741 atomic_read(&lock->l_refc),
2742 lock->l_readers, lock->l_writers,
2743 ldlm_lockname[lock->l_granted_mode],
2744 ldlm_lockname[lock->l_req_mode],
2746 lock->l_policy_data.l_inodebits.bits,
2747 lock->l_policy_data.l_inodebits.try_bits,
2748 atomic_read(&resource->lr_refcount),
2749 ldlm_typename[resource->lr_type],
2750 lock->l_flags, nid, lock->l_remote_handle.cookie,
2751 exp ? atomic_read(&exp->exp_refcount) : -99,
2752 lock->l_pid, lock->l_callback_timeout,
2757 libcfs_debug_vmsg2(msgdata, fmt, args,
2758 " ns: %s lock: %p/%#llx lrc: %d/%d,%d mode: %s/%s "
2759 "res: "DLDLMRES" rrc: %d type: %s flags: %#llx "
2760 "nid: %s remote: %#llx expref: %d pid: %u "
2761 "timeout: %lld lvb_type: %d\n",
2762 ldlm_lock_to_ns_name(lock),
2763 lock, lock->l_handle.h_cookie,
2764 atomic_read(&lock->l_refc),
2765 lock->l_readers, lock->l_writers,
2766 ldlm_lockname[lock->l_granted_mode],
2767 ldlm_lockname[lock->l_req_mode],
2769 atomic_read(&resource->lr_refcount),
2770 ldlm_typename[resource->lr_type],
2771 lock->l_flags, nid, lock->l_remote_handle.cookie,
2772 exp ? atomic_read(&exp->exp_refcount) : -99,
2773 lock->l_pid, lock->l_callback_timeout,
2778 ldlm_resource_putref(resource);
2780 EXPORT_SYMBOL(_ldlm_lock_debug);