4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
20 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
21 * CA 95054 USA or visit www.sun.com if you need additional information or
27 * Copyright (c) 2002, 2010, Oracle and/or its affiliates. All rights reserved.
28 * Use is subject to license terms.
30 * Copyright (c) 2010, 2013, Intel Corporation.
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
36 * lustre/ldlm/ldlm_lock.c
38 * Author: Peter Braam <braam@clusterfs.com>
39 * Author: Phil Schwan <phil@clusterfs.com>
42 #define DEBUG_SUBSYSTEM S_LDLM
44 #include <libcfs/libcfs.h>
45 #include <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",
68 EXPORT_SYMBOL(ldlm_typename);
70 static ldlm_policy_wire_to_local_t ldlm_policy_wire18_to_local[] = {
71 [LDLM_PLAIN - LDLM_MIN_TYPE] = ldlm_plain_policy_wire_to_local,
72 [LDLM_EXTENT - LDLM_MIN_TYPE] = ldlm_extent_policy_wire_to_local,
73 [LDLM_FLOCK - LDLM_MIN_TYPE] = ldlm_flock_policy_wire18_to_local,
74 [LDLM_IBITS - LDLM_MIN_TYPE] = ldlm_ibits_policy_wire_to_local,
77 static ldlm_policy_wire_to_local_t ldlm_policy_wire21_to_local[] = {
78 [LDLM_PLAIN - LDLM_MIN_TYPE] = ldlm_plain_policy_wire_to_local,
79 [LDLM_EXTENT - LDLM_MIN_TYPE] = ldlm_extent_policy_wire_to_local,
80 [LDLM_FLOCK - LDLM_MIN_TYPE] = ldlm_flock_policy_wire21_to_local,
81 [LDLM_IBITS - LDLM_MIN_TYPE] = ldlm_ibits_policy_wire_to_local,
84 static ldlm_policy_local_to_wire_t ldlm_policy_local_to_wire[] = {
85 [LDLM_PLAIN - LDLM_MIN_TYPE] = ldlm_plain_policy_local_to_wire,
86 [LDLM_EXTENT - LDLM_MIN_TYPE] = ldlm_extent_policy_local_to_wire,
87 [LDLM_FLOCK - LDLM_MIN_TYPE] = ldlm_flock_policy_local_to_wire,
88 [LDLM_IBITS - LDLM_MIN_TYPE] = ldlm_ibits_policy_local_to_wire,
92 * Converts lock policy from local format to on the wire lock_desc format
94 void ldlm_convert_policy_to_wire(ldlm_type_t type,
95 const ldlm_policy_data_t *lpolicy,
96 ldlm_wire_policy_data_t *wpolicy)
98 ldlm_policy_local_to_wire_t convert;
100 convert = ldlm_policy_local_to_wire[type - LDLM_MIN_TYPE];
102 convert(lpolicy, wpolicy);
106 * Converts lock policy from on the wire lock_desc format to local format
108 void ldlm_convert_policy_to_local(struct obd_export *exp, ldlm_type_t type,
109 const ldlm_wire_policy_data_t *wpolicy,
110 ldlm_policy_data_t *lpolicy)
112 ldlm_policy_wire_to_local_t convert;
115 /** some badness for 2.0.0 clients, but 2.0.0 isn't supported */
116 new_client = (exp_connect_flags(exp) & OBD_CONNECT_FULL20) != 0;
118 convert = ldlm_policy_wire21_to_local[type - LDLM_MIN_TYPE];
120 convert = ldlm_policy_wire18_to_local[type - LDLM_MIN_TYPE];
122 convert(wpolicy, lpolicy);
125 char *ldlm_it2str(int it)
132 case (IT_OPEN | IT_CREAT):
147 CERROR("Unknown intent %d\n", it);
151 EXPORT_SYMBOL(ldlm_it2str);
153 extern struct kmem_cache *ldlm_lock_slab;
155 #ifdef HAVE_SERVER_SUPPORT
156 static ldlm_processing_policy ldlm_processing_policy_table[] = {
157 [LDLM_PLAIN] = ldlm_process_plain_lock,
158 [LDLM_EXTENT] = ldlm_process_extent_lock,
159 [LDLM_FLOCK] = ldlm_process_flock_lock,
160 [LDLM_IBITS] = ldlm_process_inodebits_lock,
163 ldlm_processing_policy ldlm_get_processing_policy(struct ldlm_resource *res)
165 return ldlm_processing_policy_table[res->lr_type];
167 EXPORT_SYMBOL(ldlm_get_processing_policy);
168 #endif /* HAVE_SERVER_SUPPORT */
170 void ldlm_register_intent(struct ldlm_namespace *ns, ldlm_res_policy arg)
174 EXPORT_SYMBOL(ldlm_register_intent);
177 * REFCOUNTED LOCK OBJECTS
182 * Get a reference on a lock.
184 * Lock refcounts, during creation:
185 * - one special one for allocation, dec'd only once in destroy
186 * - one for being a lock that's in-use
187 * - one for the addref associated with a new lock
189 struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock)
191 atomic_inc(&lock->l_refc);
194 EXPORT_SYMBOL(ldlm_lock_get);
197 * Release lock reference.
199 * Also frees the lock if it was last reference.
201 void ldlm_lock_put(struct ldlm_lock *lock)
205 LASSERT(lock->l_resource != LP_POISON);
206 LASSERT(atomic_read(&lock->l_refc) > 0);
207 if (atomic_dec_and_test(&lock->l_refc)) {
208 struct ldlm_resource *res;
211 "final lock_put on destroyed lock, freeing it.");
213 res = lock->l_resource;
214 LASSERT(ldlm_is_destroyed(lock));
215 LASSERT(list_empty(&lock->l_res_link));
216 LASSERT(list_empty(&lock->l_pending_chain));
218 lprocfs_counter_decr(ldlm_res_to_ns(res)->ns_stats,
220 lu_ref_del(&res->lr_reference, "lock", lock);
221 ldlm_resource_putref(res);
222 lock->l_resource = NULL;
223 if (lock->l_export) {
224 class_export_lock_put(lock->l_export, lock);
225 lock->l_export = NULL;
228 if (lock->l_lvb_data != NULL)
229 OBD_FREE_LARGE(lock->l_lvb_data, lock->l_lvb_len);
231 ldlm_interval_free(ldlm_interval_detach(lock));
232 lu_ref_fini(&lock->l_reference);
233 OBD_FREE_RCU(lock, sizeof(*lock), &lock->l_handle);
238 EXPORT_SYMBOL(ldlm_lock_put);
241 * Removes LDLM lock \a lock from LRU. Assumes LRU is already locked.
243 int ldlm_lock_remove_from_lru_nolock(struct ldlm_lock *lock)
246 if (!list_empty(&lock->l_lru)) {
247 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
249 LASSERT(lock->l_resource->lr_type != LDLM_FLOCK);
250 list_del_init(&lock->l_lru);
251 LASSERT(ns->ns_nr_unused > 0);
259 * Removes LDLM lock \a lock from LRU. Obtains the LRU lock first.
261 int ldlm_lock_remove_from_lru(struct ldlm_lock *lock)
263 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
267 if (ldlm_is_ns_srv(lock)) {
268 LASSERT(list_empty(&lock->l_lru));
272 spin_lock(&ns->ns_lock);
273 rc = ldlm_lock_remove_from_lru_nolock(lock);
274 spin_unlock(&ns->ns_lock);
280 * Adds LDLM lock \a lock to namespace LRU. Assumes LRU is already locked.
282 void ldlm_lock_add_to_lru_nolock(struct ldlm_lock *lock)
284 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
286 lock->l_last_used = cfs_time_current();
287 LASSERT(list_empty(&lock->l_lru));
288 LASSERT(lock->l_resource->lr_type != LDLM_FLOCK);
289 list_add_tail(&lock->l_lru, &ns->ns_unused_list);
290 ldlm_clear_skipped(lock);
291 LASSERT(ns->ns_nr_unused >= 0);
296 * Adds LDLM lock \a lock to namespace LRU. Obtains necessary LRU locks
299 void ldlm_lock_add_to_lru(struct ldlm_lock *lock)
301 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
304 spin_lock(&ns->ns_lock);
305 ldlm_lock_add_to_lru_nolock(lock);
306 spin_unlock(&ns->ns_lock);
311 * Moves LDLM lock \a lock that is already in namespace LRU to the tail of
312 * the LRU. Performs necessary LRU locking
314 void ldlm_lock_touch_in_lru(struct ldlm_lock *lock)
316 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
319 if (ldlm_is_ns_srv(lock)) {
320 LASSERT(list_empty(&lock->l_lru));
325 spin_lock(&ns->ns_lock);
326 if (!list_empty(&lock->l_lru)) {
327 ldlm_lock_remove_from_lru_nolock(lock);
328 ldlm_lock_add_to_lru_nolock(lock);
330 spin_unlock(&ns->ns_lock);
335 * Helper to destroy a locked lock.
337 * Used by ldlm_lock_destroy and ldlm_lock_destroy_nolock
338 * Must be called with l_lock and lr_lock held.
340 * Does not actually free the lock data, but rather marks the lock as
341 * destroyed by setting l_destroyed field in the lock to 1. Destroys a
342 * handle->lock association too, so that the lock can no longer be found
343 * and removes the lock from LRU list. Actual lock freeing occurs when
344 * last lock reference goes away.
346 * Original comment (of some historical value):
347 * This used to have a 'strict' flag, which recovery would use to mark an
348 * in-use lock as needing-to-die. Lest I am ever tempted to put it back, I
349 * shall explain why it's gone: with the new hash table scheme, once you call
350 * ldlm_lock_destroy, you can never drop your final references on this lock.
351 * Because it's not in the hash table anymore. -phil
353 int ldlm_lock_destroy_internal(struct ldlm_lock *lock)
357 if (lock->l_readers || lock->l_writers) {
358 LDLM_ERROR(lock, "lock still has references");
362 if (!list_empty(&lock->l_res_link)) {
363 LDLM_ERROR(lock, "lock still on resource");
367 if (ldlm_is_destroyed(lock)) {
368 LASSERT(list_empty(&lock->l_lru));
372 ldlm_set_destroyed(lock);
374 if (lock->l_export && lock->l_export->exp_lock_hash) {
375 /* NB: it's safe to call cfs_hash_del() even lock isn't
376 * in exp_lock_hash. */
377 /* In the function below, .hs_keycmp resolves to
378 * ldlm_export_lock_keycmp() */
379 /* coverity[overrun-buffer-val] */
380 cfs_hash_del(lock->l_export->exp_lock_hash,
381 &lock->l_remote_handle, &lock->l_exp_hash);
384 ldlm_lock_remove_from_lru(lock);
385 class_handle_unhash(&lock->l_handle);
388 /* Wake anyone waiting for this lock */
389 /* FIXME: I should probably add yet another flag, instead of using
390 * l_export to only call this on clients */
392 class_export_put(lock->l_export);
393 lock->l_export = NULL;
394 if (lock->l_export && lock->l_completion_ast)
395 lock->l_completion_ast(lock, 0);
402 * Destroys a LDLM lock \a lock. Performs necessary locking first.
404 void ldlm_lock_destroy(struct ldlm_lock *lock)
408 lock_res_and_lock(lock);
409 first = ldlm_lock_destroy_internal(lock);
410 unlock_res_and_lock(lock);
412 /* drop reference from hashtable only for first destroy */
414 lu_ref_del(&lock->l_reference, "hash", lock);
415 LDLM_LOCK_RELEASE(lock);
421 * Destroys a LDLM lock \a lock that is already locked.
423 void ldlm_lock_destroy_nolock(struct ldlm_lock *lock)
427 first = ldlm_lock_destroy_internal(lock);
428 /* drop reference from hashtable only for first destroy */
430 lu_ref_del(&lock->l_reference, "hash", lock);
431 LDLM_LOCK_RELEASE(lock);
436 /* this is called by portals_handle2object with the handle lock taken */
437 static void lock_handle_addref(void *lock)
439 LDLM_LOCK_GET((struct ldlm_lock *)lock);
442 static void lock_handle_free(void *lock, int size)
444 LASSERT(size == sizeof(struct ldlm_lock));
445 OBD_SLAB_FREE(lock, ldlm_lock_slab, size);
448 struct portals_handle_ops lock_handle_ops = {
449 .hop_addref = lock_handle_addref,
450 .hop_free = lock_handle_free,
455 * Allocate and initialize new lock structure.
457 * usage: pass in a resource on which you have done ldlm_resource_get
458 * new lock will take over the refcount.
459 * returns: lock with refcount 2 - one for current caller and one for remote
461 static struct ldlm_lock *ldlm_lock_new(struct ldlm_resource *resource)
463 struct ldlm_lock *lock;
466 if (resource == NULL)
469 OBD_SLAB_ALLOC_PTR_GFP(lock, ldlm_lock_slab, GFP_NOFS);
473 spin_lock_init(&lock->l_lock);
474 lock->l_resource = resource;
475 lu_ref_add(&resource->lr_reference, "lock", lock);
477 atomic_set(&lock->l_refc, 2);
478 INIT_LIST_HEAD(&lock->l_res_link);
479 INIT_LIST_HEAD(&lock->l_lru);
480 INIT_LIST_HEAD(&lock->l_pending_chain);
481 INIT_LIST_HEAD(&lock->l_bl_ast);
482 INIT_LIST_HEAD(&lock->l_cp_ast);
483 INIT_LIST_HEAD(&lock->l_rk_ast);
484 init_waitqueue_head(&lock->l_waitq);
485 lock->l_blocking_lock = NULL;
486 INIT_LIST_HEAD(&lock->l_sl_mode);
487 INIT_LIST_HEAD(&lock->l_sl_policy);
488 INIT_HLIST_NODE(&lock->l_exp_hash);
489 INIT_HLIST_NODE(&lock->l_exp_flock_hash);
491 lprocfs_counter_incr(ldlm_res_to_ns(resource)->ns_stats,
493 INIT_LIST_HEAD(&lock->l_handle.h_link);
494 class_handle_hash(&lock->l_handle, &lock_handle_ops);
496 lu_ref_init(&lock->l_reference);
497 lu_ref_add(&lock->l_reference, "hash", lock);
498 lock->l_callback_timeout = 0;
500 #if LUSTRE_TRACKS_LOCK_EXP_REFS
501 INIT_LIST_HEAD(&lock->l_exp_refs_link);
502 lock->l_exp_refs_nr = 0;
503 lock->l_exp_refs_target = NULL;
505 INIT_LIST_HEAD(&lock->l_exp_list);
511 * Moves LDLM lock \a lock to another resource.
512 * This is used on client when server returns some other lock than requested
513 * (typically as a result of intent operation)
515 int ldlm_lock_change_resource(struct ldlm_namespace *ns, struct ldlm_lock *lock,
516 const struct ldlm_res_id *new_resid)
518 struct ldlm_resource *oldres = lock->l_resource;
519 struct ldlm_resource *newres;
523 LASSERT(ns_is_client(ns));
525 lock_res_and_lock(lock);
526 if (memcmp(new_resid, &lock->l_resource->lr_name,
527 sizeof(lock->l_resource->lr_name)) == 0) {
529 unlock_res_and_lock(lock);
533 LASSERT(new_resid->name[0] != 0);
535 /* This function assumes that the lock isn't on any lists */
536 LASSERT(list_empty(&lock->l_res_link));
538 type = oldres->lr_type;
539 unlock_res_and_lock(lock);
541 newres = ldlm_resource_get(ns, NULL, new_resid, type, 1);
543 RETURN(PTR_ERR(newres));
545 lu_ref_add(&newres->lr_reference, "lock", lock);
547 * To flip the lock from the old to the new resource, lock, oldres and
548 * newres have to be locked. Resource spin-locks are nested within
549 * lock->l_lock, and are taken in the memory address order to avoid
552 spin_lock(&lock->l_lock);
553 oldres = lock->l_resource;
554 if (oldres < newres) {
556 lock_res_nested(newres, LRT_NEW);
559 lock_res_nested(oldres, LRT_NEW);
561 LASSERT(memcmp(new_resid, &oldres->lr_name,
562 sizeof oldres->lr_name) != 0);
563 lock->l_resource = newres;
565 unlock_res_and_lock(lock);
567 /* ...and the flowers are still standing! */
568 lu_ref_del(&oldres->lr_reference, "lock", lock);
569 ldlm_resource_putref(oldres);
573 EXPORT_SYMBOL(ldlm_lock_change_resource);
575 /** \defgroup ldlm_handles LDLM HANDLES
576 * Ways to get hold of locks without any addresses.
581 * Fills in handle for LDLM lock \a lock into supplied \a lockh
582 * Does not take any references.
584 void ldlm_lock2handle(const struct ldlm_lock *lock, struct lustre_handle *lockh)
586 lockh->cookie = lock->l_handle.h_cookie;
588 EXPORT_SYMBOL(ldlm_lock2handle);
591 * Obtain a lock reference by handle.
593 * if \a flags: atomically get the lock and set the flags.
594 * Return NULL if flag already set
596 struct ldlm_lock *__ldlm_handle2lock(const struct lustre_handle *handle,
599 struct ldlm_lock *lock;
604 lock = class_handle2object(handle->cookie, NULL);
608 /* It's unlikely but possible that someone marked the lock as
609 * destroyed after we did handle2object on it */
610 if ((flags == 0) && !ldlm_is_destroyed(lock)) {
611 lu_ref_add(&lock->l_reference, "handle", current);
615 lock_res_and_lock(lock);
617 LASSERT(lock->l_resource != NULL);
619 lu_ref_add_atomic(&lock->l_reference, "handle", current);
620 if (unlikely(ldlm_is_destroyed(lock))) {
621 unlock_res_and_lock(lock);
622 CDEBUG(D_INFO, "lock already destroyed: lock %p\n", lock);
627 /* If we're setting flags, make sure none of them are already set. */
629 if ((lock->l_flags & flags) != 0) {
630 unlock_res_and_lock(lock);
635 lock->l_flags |= flags;
638 unlock_res_and_lock(lock);
641 EXPORT_SYMBOL(__ldlm_handle2lock);
642 /** @} ldlm_handles */
645 * Fill in "on the wire" representation for given LDLM lock into supplied
646 * lock descriptor \a desc structure.
648 void ldlm_lock2desc(struct ldlm_lock *lock, struct ldlm_lock_desc *desc)
650 ldlm_res2desc(lock->l_resource, &desc->l_resource);
651 desc->l_req_mode = lock->l_req_mode;
652 desc->l_granted_mode = lock->l_granted_mode;
653 ldlm_convert_policy_to_wire(lock->l_resource->lr_type,
654 &lock->l_policy_data,
655 &desc->l_policy_data);
657 EXPORT_SYMBOL(ldlm_lock2desc);
660 * Add a lock to list of conflicting locks to send AST to.
662 * Only add if we have not sent a blocking AST to the lock yet.
664 void ldlm_add_bl_work_item(struct ldlm_lock *lock, struct ldlm_lock *new,
665 struct list_head *work_list)
667 if (!ldlm_is_ast_sent(lock)) {
668 LDLM_DEBUG(lock, "lock incompatible; sending blocking AST.");
669 ldlm_set_ast_sent(lock);
670 /* If the enqueuing client said so, tell the AST recipient to
671 * discard dirty data, rather than writing back. */
672 if (ldlm_is_ast_discard_data(new))
673 ldlm_set_discard_data(lock);
674 LASSERT(list_empty(&lock->l_bl_ast));
675 list_add(&lock->l_bl_ast, work_list);
677 LASSERT(lock->l_blocking_lock == NULL);
678 lock->l_blocking_lock = LDLM_LOCK_GET(new);
683 * Add a lock to list of just granted locks to send completion AST to.
685 void ldlm_add_cp_work_item(struct ldlm_lock *lock, struct list_head *work_list)
687 if (!ldlm_is_cp_reqd(lock)) {
688 ldlm_set_cp_reqd(lock);
689 LDLM_DEBUG(lock, "lock granted; sending completion AST.");
690 LASSERT(list_empty(&lock->l_cp_ast));
691 list_add(&lock->l_cp_ast, work_list);
697 * Aggregator function to add AST work items into a list. Determines
698 * what sort of an AST work needs to be done and calls the proper
700 * Must be called with lr_lock held.
702 void ldlm_add_ast_work_item(struct ldlm_lock *lock, struct ldlm_lock *new,
703 struct list_head *work_list)
706 check_res_locked(lock->l_resource);
708 ldlm_add_bl_work_item(lock, new, work_list);
710 ldlm_add_cp_work_item(lock, work_list);
715 * Add specified reader/writer reference to LDLM lock with handle \a lockh.
716 * r/w reference type is determined by \a mode
717 * Calls ldlm_lock_addref_internal.
719 void ldlm_lock_addref(struct lustre_handle *lockh, __u32 mode)
721 struct ldlm_lock *lock;
723 lock = ldlm_handle2lock(lockh);
724 LASSERTF(lock != NULL, "Non-existing lock: "LPX64"\n", lockh->cookie);
725 ldlm_lock_addref_internal(lock, mode);
728 EXPORT_SYMBOL(ldlm_lock_addref);
732 * Add specified reader/writer reference to LDLM lock \a lock.
733 * r/w reference type is determined by \a mode
734 * Removes lock from LRU if it is there.
735 * Assumes the LDLM lock is already locked.
737 void ldlm_lock_addref_internal_nolock(struct ldlm_lock *lock, __u32 mode)
739 ldlm_lock_remove_from_lru(lock);
740 if (mode & (LCK_NL | LCK_CR | LCK_PR)) {
742 lu_ref_add_atomic(&lock->l_reference, "reader", lock);
744 if (mode & (LCK_EX | LCK_CW | LCK_PW | LCK_GROUP | LCK_COS)) {
746 lu_ref_add_atomic(&lock->l_reference, "writer", lock);
749 lu_ref_add_atomic(&lock->l_reference, "user", lock);
750 LDLM_DEBUG(lock, "ldlm_lock_addref(%s)", ldlm_lockname[mode]);
754 * Attempts to add reader/writer reference to a lock with handle \a lockh, and
755 * fails if lock is already LDLM_FL_CBPENDING or destroyed.
757 * \retval 0 success, lock was addref-ed
759 * \retval -EAGAIN lock is being canceled.
761 int ldlm_lock_addref_try(struct lustre_handle *lockh, __u32 mode)
763 struct ldlm_lock *lock;
767 lock = ldlm_handle2lock(lockh);
769 lock_res_and_lock(lock);
770 if (lock->l_readers != 0 || lock->l_writers != 0 ||
771 !ldlm_is_cbpending(lock)) {
772 ldlm_lock_addref_internal_nolock(lock, mode);
775 unlock_res_and_lock(lock);
780 EXPORT_SYMBOL(ldlm_lock_addref_try);
783 * Add specified reader/writer reference to LDLM lock \a lock.
784 * Locks LDLM lock and calls ldlm_lock_addref_internal_nolock to do the work.
785 * Only called for local locks.
787 void ldlm_lock_addref_internal(struct ldlm_lock *lock, __u32 mode)
789 lock_res_and_lock(lock);
790 ldlm_lock_addref_internal_nolock(lock, mode);
791 unlock_res_and_lock(lock);
795 * Removes reader/writer reference for LDLM lock \a lock.
796 * Assumes LDLM lock is already locked.
797 * only called in ldlm_flock_destroy and for local locks.
798 * Does NOT add lock to LRU if no r/w references left to accomodate flock locks
799 * that cannot be placed in LRU.
801 void ldlm_lock_decref_internal_nolock(struct ldlm_lock *lock, __u32 mode)
803 LDLM_DEBUG(lock, "ldlm_lock_decref(%s)", ldlm_lockname[mode]);
804 if (mode & (LCK_NL | LCK_CR | LCK_PR)) {
805 LASSERT(lock->l_readers > 0);
806 lu_ref_del(&lock->l_reference, "reader", lock);
809 if (mode & (LCK_EX | LCK_CW | LCK_PW | LCK_GROUP | LCK_COS)) {
810 LASSERT(lock->l_writers > 0);
811 lu_ref_del(&lock->l_reference, "writer", lock);
815 lu_ref_del(&lock->l_reference, "user", lock);
816 LDLM_LOCK_RELEASE(lock); /* matches the LDLM_LOCK_GET() in addref */
820 * Removes reader/writer reference for LDLM lock \a lock.
821 * Locks LDLM lock first.
822 * If the lock is determined to be client lock on a client and r/w refcount
823 * drops to zero and the lock is not blocked, the lock is added to LRU lock
825 * For blocked LDLM locks if r/w count drops to zero, blocking_ast is called.
827 void ldlm_lock_decref_internal(struct ldlm_lock *lock, __u32 mode)
829 struct ldlm_namespace *ns;
832 lock_res_and_lock(lock);
834 ns = ldlm_lock_to_ns(lock);
836 ldlm_lock_decref_internal_nolock(lock, mode);
838 if (ldlm_is_local(lock) &&
839 !lock->l_readers && !lock->l_writers) {
840 /* If this is a local lock on a server namespace and this was
841 * the last reference, cancel the lock. */
842 CDEBUG(D_INFO, "forcing cancel of local lock\n");
843 ldlm_set_cbpending(lock);
846 if (!lock->l_readers && !lock->l_writers &&
847 ldlm_is_cbpending(lock)) {
848 /* If we received a blocked AST and this was the last reference,
849 * run the callback. */
850 if (ldlm_is_ns_srv(lock) && lock->l_export)
851 CERROR("FL_CBPENDING set on non-local lock--just a "
854 LDLM_DEBUG(lock, "final decref done on cbpending lock");
856 LDLM_LOCK_GET(lock); /* dropped by bl thread */
857 ldlm_lock_remove_from_lru(lock);
858 unlock_res_and_lock(lock);
860 if (ldlm_is_fail_loc(lock))
861 OBD_RACE(OBD_FAIL_LDLM_CP_BL_RACE);
863 if (ldlm_is_atomic_cb(lock) ||
864 ldlm_bl_to_thread_lock(ns, NULL, lock) != 0)
865 ldlm_handle_bl_callback(ns, NULL, lock);
866 } else if (ns_is_client(ns) &&
867 !lock->l_readers && !lock->l_writers &&
868 !ldlm_is_no_lru(lock) &&
869 !ldlm_is_bl_ast(lock)) {
871 LDLM_DEBUG(lock, "add lock into lru list");
873 /* If this is a client-side namespace and this was the last
874 * reference, put it on the LRU. */
875 ldlm_lock_add_to_lru(lock);
876 unlock_res_and_lock(lock);
878 if (ldlm_is_fail_loc(lock))
879 OBD_RACE(OBD_FAIL_LDLM_CP_BL_RACE);
881 /* Call ldlm_cancel_lru() only if EARLY_CANCEL and LRU RESIZE
882 * are not supported by the server, otherwise, it is done on
884 if (!exp_connect_cancelset(lock->l_conn_export) &&
885 !ns_connect_lru_resize(ns))
886 ldlm_cancel_lru(ns, 0, LCF_ASYNC, 0);
888 LDLM_DEBUG(lock, "do not add lock into lru list");
889 unlock_res_and_lock(lock);
896 * Decrease reader/writer refcount for LDLM lock with handle \a lockh
898 void ldlm_lock_decref(struct lustre_handle *lockh, __u32 mode)
900 struct ldlm_lock *lock = __ldlm_handle2lock(lockh, 0);
901 LASSERTF(lock != NULL, "Non-existing lock: "LPX64"\n", lockh->cookie);
902 ldlm_lock_decref_internal(lock, mode);
905 EXPORT_SYMBOL(ldlm_lock_decref);
908 * Decrease reader/writer refcount for LDLM lock with handle
909 * \a lockh and mark it for subsequent cancellation once r/w refcount
910 * drops to zero instead of putting into LRU.
912 * Typical usage is for GROUP locks which we cannot allow to be cached.
914 void ldlm_lock_decref_and_cancel(struct lustre_handle *lockh, __u32 mode)
916 struct ldlm_lock *lock = __ldlm_handle2lock(lockh, 0);
919 LASSERT(lock != NULL);
921 LDLM_DEBUG(lock, "ldlm_lock_decref(%s)", ldlm_lockname[mode]);
922 lock_res_and_lock(lock);
923 ldlm_set_cbpending(lock);
924 unlock_res_and_lock(lock);
925 ldlm_lock_decref_internal(lock, mode);
928 EXPORT_SYMBOL(ldlm_lock_decref_and_cancel);
930 struct sl_insert_point {
931 struct list_head *res_link;
932 struct list_head *mode_link;
933 struct list_head *policy_link;
937 * Finds a position to insert the new lock into granted lock list.
939 * Used for locks eligible for skiplist optimization.
942 * queue [input]: the granted list where search acts on;
943 * req [input]: the lock whose position to be located;
944 * prev [output]: positions within 3 lists to insert @req to
948 * - ldlm_grant_lock_with_skiplist
950 static void search_granted_lock(struct list_head *queue,
951 struct ldlm_lock *req,
952 struct sl_insert_point *prev)
954 struct list_head *tmp;
955 struct ldlm_lock *lock, *mode_end, *policy_end;
958 list_for_each(tmp, queue) {
959 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
961 mode_end = list_entry(lock->l_sl_mode.prev,
962 struct ldlm_lock, l_sl_mode);
964 if (lock->l_req_mode != req->l_req_mode) {
965 /* jump to last lock of mode group */
966 tmp = &mode_end->l_res_link;
970 /* suitable mode group is found */
971 if (lock->l_resource->lr_type == LDLM_PLAIN) {
972 /* insert point is last lock of the mode group */
973 prev->res_link = &mode_end->l_res_link;
974 prev->mode_link = &mode_end->l_sl_mode;
975 prev->policy_link = &req->l_sl_policy;
978 } else if (lock->l_resource->lr_type == LDLM_IBITS) {
981 list_entry(lock->l_sl_policy.prev,
985 if (lock->l_policy_data.l_inodebits.bits ==
986 req->l_policy_data.l_inodebits.bits) {
987 /* insert point is last lock of
988 * the policy group */
990 &policy_end->l_res_link;
992 &policy_end->l_sl_mode;
994 &policy_end->l_sl_policy;
999 if (policy_end == mode_end)
1000 /* done with mode group */
1003 /* go to next policy group within mode group */
1004 tmp = policy_end->l_res_link.next;
1005 lock = list_entry(tmp, struct ldlm_lock,
1007 } /* loop over policy groups within the mode group */
1009 /* insert point is last lock of the mode group,
1010 * new policy group is started */
1011 prev->res_link = &mode_end->l_res_link;
1012 prev->mode_link = &mode_end->l_sl_mode;
1013 prev->policy_link = &req->l_sl_policy;
1017 LDLM_ERROR(lock,"is not LDLM_PLAIN or LDLM_IBITS lock");
1022 /* insert point is last lock on the queue,
1023 * new mode group and new policy group are started */
1024 prev->res_link = queue->prev;
1025 prev->mode_link = &req->l_sl_mode;
1026 prev->policy_link = &req->l_sl_policy;
1032 * Add a lock into resource granted list after a position described by
1035 static void ldlm_granted_list_add_lock(struct ldlm_lock *lock,
1036 struct sl_insert_point *prev)
1038 struct ldlm_resource *res = lock->l_resource;
1041 check_res_locked(res);
1043 ldlm_resource_dump(D_INFO, res);
1044 LDLM_DEBUG(lock, "About to add lock:");
1046 if (ldlm_is_destroyed(lock)) {
1047 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
1051 LASSERT(list_empty(&lock->l_res_link));
1052 LASSERT(list_empty(&lock->l_sl_mode));
1053 LASSERT(list_empty(&lock->l_sl_policy));
1056 * lock->link == prev->link means lock is first starting the group.
1057 * Don't re-add to itself to suppress kernel warnings.
1059 if (&lock->l_res_link != prev->res_link)
1060 list_add(&lock->l_res_link, prev->res_link);
1061 if (&lock->l_sl_mode != prev->mode_link)
1062 list_add(&lock->l_sl_mode, prev->mode_link);
1063 if (&lock->l_sl_policy != prev->policy_link)
1064 list_add(&lock->l_sl_policy, prev->policy_link);
1070 * Add a lock to granted list on a resource maintaining skiplist
1073 static void ldlm_grant_lock_with_skiplist(struct ldlm_lock *lock)
1075 struct sl_insert_point prev;
1078 LASSERT(lock->l_req_mode == lock->l_granted_mode);
1080 search_granted_lock(&lock->l_resource->lr_granted, lock, &prev);
1081 ldlm_granted_list_add_lock(lock, &prev);
1086 * Perform lock granting bookkeeping.
1088 * Includes putting the lock into granted list and updating lock mode.
1090 * - ldlm_lock_enqueue
1091 * - ldlm_reprocess_queue
1092 * - ldlm_lock_convert
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 /* We should not add locks to granted list in the following cases:
1109 * - this is an UNLOCK but not a real lock;
1110 * - this is a TEST lock;
1111 * - this is a F_CANCELLK lock (async flock has req_mode == 0)
1112 * - this is a deadlock (flock cannot be granted) */
1113 if (lock->l_req_mode == 0 ||
1114 lock->l_req_mode == LCK_NL ||
1115 ldlm_is_test_lock(lock) ||
1116 ldlm_is_flock_deadlock(lock))
1119 if (res->lr_type == LDLM_PLAIN || res->lr_type == LDLM_IBITS)
1120 ldlm_grant_lock_with_skiplist(lock);
1121 else if (res->lr_type == LDLM_EXTENT)
1122 ldlm_extent_add_lock(res, lock);
1124 ldlm_resource_add_lock(res, &res->lr_granted, lock);
1126 if (lock->l_granted_mode < res->lr_most_restr)
1127 res->lr_most_restr = lock->l_granted_mode;
1129 ldlm_pool_add(&ldlm_res_to_ns(res)->ns_pool, lock);
1134 * Search for a lock with given properties in a queue.
1136 * \retval a referenced lock or NULL. See the flag descriptions below, in the
1137 * comment above ldlm_lock_match
1139 static struct ldlm_lock *search_queue(struct list_head *queue,
1141 ldlm_policy_data_t *policy,
1142 struct ldlm_lock *old_lock,
1143 __u64 flags, int unref)
1145 struct ldlm_lock *lock;
1146 struct list_head *tmp;
1148 list_for_each(tmp, queue) {
1151 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
1153 if (lock == old_lock)
1156 /* Check if this lock can be matched.
1157 * Used by LU-2919(exclusive open) for open lease lock */
1158 if (ldlm_is_excl(lock))
1161 /* llite sometimes wants to match locks that will be
1162 * canceled when their users drop, but we allow it to match
1163 * if it passes in CBPENDING and the lock still has users.
1164 * this is generally only going to be used by children
1165 * whose parents already hold a lock so forward progress
1166 * can still happen. */
1167 if (ldlm_is_cbpending(lock) &&
1168 !(flags & LDLM_FL_CBPENDING))
1170 if (!unref && ldlm_is_cbpending(lock) &&
1171 lock->l_readers == 0 && lock->l_writers == 0)
1174 if (!(lock->l_req_mode & *mode))
1176 match = lock->l_req_mode;
1178 if (lock->l_resource->lr_type == LDLM_EXTENT &&
1179 (lock->l_policy_data.l_extent.start >
1180 policy->l_extent.start ||
1181 lock->l_policy_data.l_extent.end < policy->l_extent.end))
1184 if (unlikely(match == LCK_GROUP) &&
1185 lock->l_resource->lr_type == LDLM_EXTENT &&
1186 policy->l_extent.gid != LDLM_GID_ANY &&
1187 lock->l_policy_data.l_extent.gid != policy->l_extent.gid)
1190 /* We match if we have existing lock with same or wider set
1192 if (lock->l_resource->lr_type == LDLM_IBITS &&
1193 ((lock->l_policy_data.l_inodebits.bits &
1194 policy->l_inodebits.bits) !=
1195 policy->l_inodebits.bits))
1198 if (!unref && LDLM_HAVE_MASK(lock, GONE))
1201 if ((flags & LDLM_FL_LOCAL_ONLY) &&
1202 !ldlm_is_local(lock))
1205 if (flags & LDLM_FL_TEST_LOCK) {
1206 LDLM_LOCK_GET(lock);
1207 ldlm_lock_touch_in_lru(lock);
1209 ldlm_lock_addref_internal_nolock(lock, match);
1218 void ldlm_lock_fail_match_locked(struct ldlm_lock *lock)
1220 if ((lock->l_flags & LDLM_FL_FAIL_NOTIFIED) == 0) {
1221 lock->l_flags |= LDLM_FL_FAIL_NOTIFIED;
1222 wake_up_all(&lock->l_waitq);
1225 EXPORT_SYMBOL(ldlm_lock_fail_match_locked);
1227 void ldlm_lock_fail_match(struct ldlm_lock *lock)
1229 lock_res_and_lock(lock);
1230 ldlm_lock_fail_match_locked(lock);
1231 unlock_res_and_lock(lock);
1233 EXPORT_SYMBOL(ldlm_lock_fail_match);
1236 * Mark lock as "matchable" by OST.
1238 * Used to prevent certain races in LOV/OSC where the lock is granted, but LVB
1240 * Assumes LDLM lock is already locked.
1242 void ldlm_lock_allow_match_locked(struct ldlm_lock *lock)
1244 ldlm_set_lvb_ready(lock);
1245 wake_up_all(&lock->l_waitq);
1247 EXPORT_SYMBOL(ldlm_lock_allow_match_locked);
1250 * Mark lock as "matchable" by OST.
1251 * Locks the lock and then \see ldlm_lock_allow_match_locked
1253 void ldlm_lock_allow_match(struct ldlm_lock *lock)
1255 lock_res_and_lock(lock);
1256 ldlm_lock_allow_match_locked(lock);
1257 unlock_res_and_lock(lock);
1259 EXPORT_SYMBOL(ldlm_lock_allow_match);
1262 * Attempt to find a lock with specified properties.
1264 * Typically returns a reference to matched lock unless LDLM_FL_TEST_LOCK is
1267 * Can be called in two ways:
1269 * If 'ns' is NULL, then lockh describes an existing lock that we want to look
1270 * for a duplicate of.
1272 * Otherwise, all of the fields must be filled in, to match against.
1274 * If 'flags' contains LDLM_FL_LOCAL_ONLY, then only match local locks on the
1275 * server (ie, connh is NULL)
1276 * If 'flags' contains LDLM_FL_BLOCK_GRANTED, then only locks on the granted
1277 * list will be considered
1278 * If 'flags' contains LDLM_FL_CBPENDING, then locks that have been marked
1279 * to be canceled can still be matched as long as they still have reader
1280 * or writer refernces
1281 * If 'flags' contains LDLM_FL_TEST_LOCK, then don't actually reference a lock,
1282 * just tell us if we would have matched.
1284 * \retval 1 if it finds an already-existing lock that is compatible; in this
1285 * case, lockh is filled in with a addref()ed lock
1287 * We also check security context, and if that fails we simply return 0 (to
1288 * keep caller code unchanged), the context failure will be discovered by
1289 * caller sometime later.
1291 ldlm_mode_t ldlm_lock_match(struct ldlm_namespace *ns, __u64 flags,
1292 const struct ldlm_res_id *res_id, ldlm_type_t type,
1293 ldlm_policy_data_t *policy, ldlm_mode_t mode,
1294 struct lustre_handle *lockh, int unref)
1296 struct ldlm_resource *res;
1297 struct ldlm_lock *lock, *old_lock = NULL;
1302 old_lock = ldlm_handle2lock(lockh);
1305 ns = ldlm_lock_to_ns(old_lock);
1306 res_id = &old_lock->l_resource->lr_name;
1307 type = old_lock->l_resource->lr_type;
1308 mode = old_lock->l_req_mode;
1311 res = ldlm_resource_get(ns, NULL, res_id, type, 0);
1313 LASSERT(old_lock == NULL);
1317 LDLM_RESOURCE_ADDREF(res);
1320 lock = search_queue(&res->lr_granted, &mode, policy, old_lock,
1324 if (flags & LDLM_FL_BLOCK_GRANTED)
1326 lock = search_queue(&res->lr_converting, &mode, policy, old_lock,
1330 lock = search_queue(&res->lr_waiting, &mode, policy, old_lock,
1338 LDLM_RESOURCE_DELREF(res);
1339 ldlm_resource_putref(res);
1342 ldlm_lock2handle(lock, lockh);
1343 if ((flags & LDLM_FL_LVB_READY) &&
1344 (!ldlm_is_lvb_ready(lock))) {
1345 __u64 wait_flags = LDLM_FL_LVB_READY |
1346 LDLM_FL_DESTROYED | LDLM_FL_FAIL_NOTIFIED;
1347 struct l_wait_info lwi;
1348 if (lock->l_completion_ast) {
1349 int err = lock->l_completion_ast(lock,
1350 LDLM_FL_WAIT_NOREPROC,
1353 if (flags & LDLM_FL_TEST_LOCK)
1354 LDLM_LOCK_RELEASE(lock);
1356 ldlm_lock_decref_internal(lock,
1363 lwi = LWI_TIMEOUT_INTR(cfs_time_seconds(obd_timeout),
1364 NULL, LWI_ON_SIGNAL_NOOP, NULL);
1366 /* XXX FIXME see comment on CAN_MATCH in lustre_dlm.h */
1367 l_wait_event(lock->l_waitq,
1368 lock->l_flags & wait_flags,
1370 if (!ldlm_is_lvb_ready(lock)) {
1371 if (flags & LDLM_FL_TEST_LOCK)
1372 LDLM_LOCK_RELEASE(lock);
1374 ldlm_lock_decref_internal(lock, mode);
1381 LDLM_DEBUG(lock, "matched ("LPU64" "LPU64")",
1382 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1383 res_id->name[2] : policy->l_extent.start,
1384 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1385 res_id->name[3] : policy->l_extent.end);
1387 /* check user's security context */
1388 if (lock->l_conn_export &&
1389 sptlrpc_import_check_ctx(
1390 class_exp2cliimp(lock->l_conn_export))) {
1391 if (!(flags & LDLM_FL_TEST_LOCK))
1392 ldlm_lock_decref_internal(lock, mode);
1396 if (flags & LDLM_FL_TEST_LOCK)
1397 LDLM_LOCK_RELEASE(lock);
1399 } else if (!(flags & LDLM_FL_TEST_LOCK)) {/*less verbose for test-only*/
1400 LDLM_DEBUG_NOLOCK("not matched ns %p type %u mode %u res "
1401 LPU64"/"LPU64" ("LPU64" "LPU64")", ns,
1402 type, mode, res_id->name[0], res_id->name[1],
1403 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1404 res_id->name[2] :policy->l_extent.start,
1405 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1406 res_id->name[3] : policy->l_extent.end);
1409 LDLM_LOCK_PUT(old_lock);
1411 return rc ? mode : 0;
1413 EXPORT_SYMBOL(ldlm_lock_match);
1415 ldlm_mode_t ldlm_revalidate_lock_handle(struct lustre_handle *lockh,
1418 struct ldlm_lock *lock;
1419 ldlm_mode_t mode = 0;
1422 lock = ldlm_handle2lock(lockh);
1424 lock_res_and_lock(lock);
1425 if (LDLM_HAVE_MASK(lock, GONE))
1428 if (ldlm_is_cbpending(lock) &&
1429 lock->l_readers == 0 && lock->l_writers == 0)
1433 *bits = lock->l_policy_data.l_inodebits.bits;
1434 mode = lock->l_granted_mode;
1435 ldlm_lock_addref_internal_nolock(lock, mode);
1442 unlock_res_and_lock(lock);
1443 LDLM_LOCK_PUT(lock);
1447 EXPORT_SYMBOL(ldlm_revalidate_lock_handle);
1449 /** The caller must guarantee that the buffer is large enough. */
1450 int ldlm_fill_lvb(struct ldlm_lock *lock, struct req_capsule *pill,
1451 enum req_location loc, void *data, int size)
1456 LASSERT(data != NULL);
1459 switch (lock->l_lvb_type) {
1461 if (size == sizeof(struct ost_lvb)) {
1462 if (loc == RCL_CLIENT)
1463 lvb = req_capsule_client_swab_get(pill,
1465 lustre_swab_ost_lvb);
1467 lvb = req_capsule_server_swab_get(pill,
1469 lustre_swab_ost_lvb);
1470 if (unlikely(lvb == NULL)) {
1471 LDLM_ERROR(lock, "no LVB");
1475 memcpy(data, lvb, size);
1476 } else if (size == sizeof(struct ost_lvb_v1)) {
1477 struct ost_lvb *olvb = data;
1479 if (loc == RCL_CLIENT)
1480 lvb = req_capsule_client_swab_get(pill,
1482 lustre_swab_ost_lvb_v1);
1484 lvb = req_capsule_server_sized_swab_get(pill,
1486 lustre_swab_ost_lvb_v1);
1487 if (unlikely(lvb == NULL)) {
1488 LDLM_ERROR(lock, "no LVB");
1492 memcpy(data, lvb, size);
1493 olvb->lvb_mtime_ns = 0;
1494 olvb->lvb_atime_ns = 0;
1495 olvb->lvb_ctime_ns = 0;
1497 LDLM_ERROR(lock, "Replied unexpected ost LVB size %d",
1503 if (size == sizeof(struct lquota_lvb)) {
1504 if (loc == RCL_CLIENT)
1505 lvb = req_capsule_client_swab_get(pill,
1507 lustre_swab_lquota_lvb);
1509 lvb = req_capsule_server_swab_get(pill,
1511 lustre_swab_lquota_lvb);
1512 if (unlikely(lvb == NULL)) {
1513 LDLM_ERROR(lock, "no LVB");
1517 memcpy(data, lvb, size);
1519 LDLM_ERROR(lock, "Replied unexpected lquota LVB size %d",
1528 if (loc == RCL_CLIENT)
1529 lvb = req_capsule_client_get(pill, &RMF_DLM_LVB);
1531 lvb = req_capsule_server_get(pill, &RMF_DLM_LVB);
1532 if (unlikely(lvb == NULL)) {
1533 LDLM_ERROR(lock, "no LVB");
1537 memcpy(data, lvb, size);
1540 LDLM_ERROR(lock, "Unknown LVB type: %d\n", lock->l_lvb_type);
1541 libcfs_debug_dumpstack(NULL);
1549 * Create and fill in new LDLM lock with specified properties.
1550 * Returns a referenced lock
1552 struct ldlm_lock *ldlm_lock_create(struct ldlm_namespace *ns,
1553 const struct ldlm_res_id *res_id,
1556 const struct ldlm_callback_suite *cbs,
1557 void *data, __u32 lvb_len,
1558 enum lvb_type lvb_type)
1560 struct ldlm_lock *lock;
1561 struct ldlm_resource *res;
1565 res = ldlm_resource_get(ns, NULL, res_id, type, 1);
1567 RETURN(ERR_CAST(res));
1569 lock = ldlm_lock_new(res);
1571 RETURN(ERR_PTR(-ENOMEM));
1573 lock->l_req_mode = mode;
1574 lock->l_ast_data = data;
1575 lock->l_pid = current_pid();
1576 if (ns_is_server(ns))
1577 ldlm_set_ns_srv(lock);
1579 lock->l_blocking_ast = cbs->lcs_blocking;
1580 lock->l_completion_ast = cbs->lcs_completion;
1581 lock->l_glimpse_ast = cbs->lcs_glimpse;
1584 lock->l_tree_node = NULL;
1585 /* if this is the extent lock, allocate the interval tree node */
1586 if (type == LDLM_EXTENT)
1587 if (ldlm_interval_alloc(lock) == NULL)
1588 GOTO(out, rc = -ENOMEM);
1591 lock->l_lvb_len = lvb_len;
1592 OBD_ALLOC_LARGE(lock->l_lvb_data, lvb_len);
1593 if (lock->l_lvb_data == NULL)
1594 GOTO(out, rc = -ENOMEM);
1597 lock->l_lvb_type = lvb_type;
1598 if (OBD_FAIL_CHECK(OBD_FAIL_LDLM_NEW_LOCK))
1599 GOTO(out, rc = -ENOENT);
1604 ldlm_lock_destroy(lock);
1605 LDLM_LOCK_RELEASE(lock);
1606 RETURN(ERR_PTR(rc));
1610 * Enqueue (request) a lock.
1612 * Does not block. As a result of enqueue the lock would be put
1613 * into granted or waiting list.
1615 * If namespace has intent policy sent and the lock has LDLM_FL_HAS_INTENT flag
1616 * set, skip all the enqueueing and delegate lock processing to intent policy
1619 ldlm_error_t ldlm_lock_enqueue(struct ldlm_namespace *ns,
1620 struct ldlm_lock **lockp,
1621 void *cookie, __u64 *flags)
1623 struct ldlm_lock *lock = *lockp;
1624 struct ldlm_resource *res = lock->l_resource;
1625 int local = ns_is_client(ldlm_res_to_ns(res));
1626 #ifdef HAVE_SERVER_SUPPORT
1627 ldlm_processing_policy policy;
1629 ldlm_error_t rc = ELDLM_OK;
1630 struct ldlm_interval *node = NULL;
1633 /* policies are not executed on the client or during replay */
1634 if ((*flags & (LDLM_FL_HAS_INTENT|LDLM_FL_REPLAY)) == LDLM_FL_HAS_INTENT
1635 && !local && ns->ns_policy) {
1636 rc = ns->ns_policy(ns, lockp, cookie, lock->l_req_mode, *flags,
1638 if (rc == ELDLM_LOCK_REPLACED) {
1639 /* The lock that was returned has already been granted,
1640 * and placed into lockp. If it's not the same as the
1641 * one we passed in, then destroy the old one and our
1642 * work here is done. */
1643 if (lock != *lockp) {
1644 ldlm_lock_destroy(lock);
1645 LDLM_LOCK_RELEASE(lock);
1647 *flags |= LDLM_FL_LOCK_CHANGED;
1649 } else if (rc != ELDLM_OK ||
1650 (rc == ELDLM_OK && (*flags & LDLM_FL_INTENT_ONLY))) {
1651 ldlm_lock_destroy(lock);
1656 if (*flags & LDLM_FL_RESENT) {
1657 /* Reconstruct LDLM_FL_SRV_ENQ_MASK @flags for reply.
1658 * Set LOCK_CHANGED always.
1659 * Check if the lock is granted for BLOCK_GRANTED.
1660 * Take NO_TIMEOUT from the lock as it is inherited through
1661 * LDLM_FL_INHERIT_MASK */
1662 *flags |= LDLM_FL_LOCK_CHANGED;
1663 if (lock->l_req_mode != lock->l_granted_mode)
1664 *flags |= LDLM_FL_BLOCK_GRANTED;
1665 *flags |= lock->l_flags & LDLM_FL_NO_TIMEOUT;
1669 /* For a replaying lock, it might be already in granted list. So
1670 * unlinking the lock will cause the interval node to be freed, we
1671 * have to allocate the interval node early otherwise we can't regrant
1672 * this lock in the future. - jay */
1673 if (!local && (*flags & LDLM_FL_REPLAY) && res->lr_type == LDLM_EXTENT)
1674 OBD_SLAB_ALLOC_PTR_GFP(node, ldlm_interval_slab, GFP_NOFS);
1676 lock_res_and_lock(lock);
1677 if (local && lock->l_req_mode == lock->l_granted_mode) {
1678 /* The server returned a blocked lock, but it was granted
1679 * before we got a chance to actually enqueue it. We don't
1680 * need to do anything else. */
1681 *flags &= ~LDLM_FL_BLOCKED_MASK;
1682 GOTO(out, rc = ELDLM_OK);
1685 ldlm_resource_unlink_lock(lock);
1686 if (res->lr_type == LDLM_EXTENT && lock->l_tree_node == NULL) {
1688 ldlm_lock_destroy_nolock(lock);
1689 GOTO(out, rc = -ENOMEM);
1692 INIT_LIST_HEAD(&node->li_group);
1693 ldlm_interval_attach(node, lock);
1697 /* Some flags from the enqueue want to make it into the AST, via the
1698 * lock's l_flags. */
1699 if (*flags & LDLM_FL_AST_DISCARD_DATA)
1700 ldlm_set_ast_discard_data(lock);
1701 if (*flags & LDLM_FL_TEST_LOCK)
1702 ldlm_set_test_lock(lock);
1704 /* This distinction between local lock trees is very important; a client
1705 * namespace only has information about locks taken by that client, and
1706 * thus doesn't have enough information to decide for itself if it can
1707 * be granted (below). In this case, we do exactly what the server
1708 * tells us to do, as dictated by the 'flags'.
1710 * We do exactly the same thing during recovery, when the server is
1711 * more or less trusting the clients not to lie.
1713 * FIXME (bug 268): Detect obvious lies by checking compatibility in
1714 * granted/converting queues. */
1716 if (*flags & LDLM_FL_BLOCK_CONV)
1717 ldlm_resource_add_lock(res, &res->lr_converting, lock);
1718 else if (*flags & (LDLM_FL_BLOCK_WAIT | LDLM_FL_BLOCK_GRANTED))
1719 ldlm_resource_add_lock(res, &res->lr_waiting, lock);
1721 ldlm_grant_lock(lock, NULL);
1722 GOTO(out, rc = ELDLM_OK);
1723 #ifdef HAVE_SERVER_SUPPORT
1724 } else if (*flags & LDLM_FL_REPLAY) {
1725 if (*flags & LDLM_FL_BLOCK_CONV) {
1726 ldlm_resource_add_lock(res, &res->lr_converting, lock);
1727 GOTO(out, rc = ELDLM_OK);
1728 } else if (*flags & LDLM_FL_BLOCK_WAIT) {
1729 ldlm_resource_add_lock(res, &res->lr_waiting, lock);
1730 GOTO(out, rc = ELDLM_OK);
1731 } else if (*flags & LDLM_FL_BLOCK_GRANTED) {
1732 ldlm_grant_lock(lock, NULL);
1733 GOTO(out, rc = ELDLM_OK);
1735 /* If no flags, fall through to normal enqueue path. */
1738 policy = ldlm_processing_policy_table[res->lr_type];
1739 policy(lock, flags, 1, &rc, NULL);
1743 CERROR("This is client-side-only module, cannot handle "
1744 "LDLM_NAMESPACE_SERVER resource type lock.\n");
1750 unlock_res_and_lock(lock);
1752 OBD_SLAB_FREE(node, ldlm_interval_slab, sizeof(*node));
1756 #ifdef HAVE_SERVER_SUPPORT
1758 * Iterate through all waiting locks on a given resource queue and attempt to
1761 * Must be called with resource lock held.
1763 int ldlm_reprocess_queue(struct ldlm_resource *res, struct list_head *queue,
1764 struct list_head *work_list)
1766 struct list_head *tmp, *pos;
1767 ldlm_processing_policy policy;
1769 int rc = LDLM_ITER_CONTINUE;
1773 check_res_locked(res);
1775 policy = ldlm_processing_policy_table[res->lr_type];
1778 list_for_each_safe(tmp, pos, queue) {
1779 struct ldlm_lock *pending;
1780 pending = list_entry(tmp, struct ldlm_lock, l_res_link);
1782 CDEBUG(D_INFO, "Reprocessing lock %p\n", pending);
1785 rc = policy(pending, &flags, 0, &err, work_list);
1786 if (rc != LDLM_ITER_CONTINUE)
1795 * Process a call to blocking AST callback for a lock in ast_work list
1798 ldlm_work_bl_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1800 struct ldlm_cb_set_arg *arg = opaq;
1801 struct ldlm_lock_desc d;
1803 struct ldlm_lock *lock;
1806 if (list_empty(arg->list))
1809 lock = list_entry(arg->list->next, struct ldlm_lock, l_bl_ast);
1811 /* nobody should touch l_bl_ast */
1812 lock_res_and_lock(lock);
1813 list_del_init(&lock->l_bl_ast);
1815 LASSERT(ldlm_is_ast_sent(lock));
1816 LASSERT(lock->l_bl_ast_run == 0);
1817 LASSERT(lock->l_blocking_lock);
1818 lock->l_bl_ast_run++;
1819 unlock_res_and_lock(lock);
1821 ldlm_lock2desc(lock->l_blocking_lock, &d);
1823 rc = lock->l_blocking_ast(lock, &d, (void *)arg, LDLM_CB_BLOCKING);
1824 LDLM_LOCK_RELEASE(lock->l_blocking_lock);
1825 lock->l_blocking_lock = NULL;
1826 LDLM_LOCK_RELEASE(lock);
1832 * Process a call to completion AST callback for a lock in ast_work list
1835 ldlm_work_cp_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1837 struct ldlm_cb_set_arg *arg = opaq;
1839 struct ldlm_lock *lock;
1840 ldlm_completion_callback completion_callback;
1843 if (list_empty(arg->list))
1846 lock = list_entry(arg->list->next, struct ldlm_lock, l_cp_ast);
1848 /* It's possible to receive a completion AST before we've set
1849 * the l_completion_ast pointer: either because the AST arrived
1850 * before the reply, or simply because there's a small race
1851 * window between receiving the reply and finishing the local
1852 * enqueue. (bug 842)
1854 * This can't happen with the blocking_ast, however, because we
1855 * will never call the local blocking_ast until we drop our
1856 * reader/writer reference, which we won't do until we get the
1857 * reply and finish enqueueing. */
1859 /* nobody should touch l_cp_ast */
1860 lock_res_and_lock(lock);
1861 list_del_init(&lock->l_cp_ast);
1862 LASSERT(ldlm_is_cp_reqd(lock));
1863 /* save l_completion_ast since it can be changed by
1864 * mds_intent_policy(), see bug 14225 */
1865 completion_callback = lock->l_completion_ast;
1866 ldlm_clear_cp_reqd(lock);
1867 unlock_res_and_lock(lock);
1869 if (completion_callback != NULL)
1870 rc = completion_callback(lock, 0, (void *)arg);
1871 LDLM_LOCK_RELEASE(lock);
1877 * Process a call to revocation AST callback for a lock in ast_work list
1880 ldlm_work_revoke_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1882 struct ldlm_cb_set_arg *arg = opaq;
1883 struct ldlm_lock_desc desc;
1885 struct ldlm_lock *lock;
1888 if (list_empty(arg->list))
1891 lock = list_entry(arg->list->next, struct ldlm_lock, l_rk_ast);
1892 list_del_init(&lock->l_rk_ast);
1894 /* the desc just pretend to exclusive */
1895 ldlm_lock2desc(lock, &desc);
1896 desc.l_req_mode = LCK_EX;
1897 desc.l_granted_mode = 0;
1899 rc = lock->l_blocking_ast(lock, &desc, (void*)arg, LDLM_CB_BLOCKING);
1900 LDLM_LOCK_RELEASE(lock);
1906 * Process a call to glimpse AST callback for a lock in ast_work list
1908 int ldlm_work_gl_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1910 struct ldlm_cb_set_arg *arg = opaq;
1911 struct ldlm_glimpse_work *gl_work;
1912 struct ldlm_lock *lock;
1916 if (list_empty(arg->list))
1919 gl_work = list_entry(arg->list->next, struct ldlm_glimpse_work,
1921 list_del_init(&gl_work->gl_list);
1923 lock = gl_work->gl_lock;
1925 /* transfer the glimpse descriptor to ldlm_cb_set_arg */
1926 arg->gl_desc = gl_work->gl_desc;
1928 /* invoke the actual glimpse callback */
1929 if (lock->l_glimpse_ast(lock, (void*)arg) == 0)
1932 LDLM_LOCK_RELEASE(lock);
1934 if ((gl_work->gl_flags & LDLM_GL_WORK_NOFREE) == 0)
1935 OBD_FREE_PTR(gl_work);
1941 * Process list of locks in need of ASTs being sent.
1943 * Used on server to send multiple ASTs together instead of sending one by
1946 int ldlm_run_ast_work(struct ldlm_namespace *ns, struct list_head *rpc_list,
1947 ldlm_desc_ast_t ast_type)
1949 struct ldlm_cb_set_arg *arg;
1950 set_producer_func work_ast_lock;
1953 if (list_empty(rpc_list))
1960 atomic_set(&arg->restart, 0);
1961 arg->list = rpc_list;
1964 case LDLM_WORK_BL_AST:
1965 arg->type = LDLM_BL_CALLBACK;
1966 work_ast_lock = ldlm_work_bl_ast_lock;
1968 case LDLM_WORK_CP_AST:
1969 arg->type = LDLM_CP_CALLBACK;
1970 work_ast_lock = ldlm_work_cp_ast_lock;
1972 case LDLM_WORK_REVOKE_AST:
1973 arg->type = LDLM_BL_CALLBACK;
1974 work_ast_lock = ldlm_work_revoke_ast_lock;
1976 case LDLM_WORK_GL_AST:
1977 arg->type = LDLM_GL_CALLBACK;
1978 work_ast_lock = ldlm_work_gl_ast_lock;
1984 /* We create a ptlrpc request set with flow control extension.
1985 * This request set will use the work_ast_lock function to produce new
1986 * requests and will send a new request each time one completes in order
1987 * to keep the number of requests in flight to ns_max_parallel_ast */
1988 arg->set = ptlrpc_prep_fcset(ns->ns_max_parallel_ast ? : UINT_MAX,
1989 work_ast_lock, arg);
1990 if (arg->set == NULL)
1991 GOTO(out, rc = -ENOMEM);
1993 ptlrpc_set_wait(arg->set);
1994 ptlrpc_set_destroy(arg->set);
1996 rc = atomic_read(&arg->restart) ? -ERESTART : 0;
2003 static int reprocess_one_queue(struct ldlm_resource *res, void *closure)
2005 ldlm_reprocess_all(res);
2006 return LDLM_ITER_CONTINUE;
2009 static int ldlm_reprocess_res(cfs_hash_t *hs, cfs_hash_bd_t *bd,
2010 struct hlist_node *hnode, void *arg)
2012 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
2015 rc = reprocess_one_queue(res, arg);
2017 return rc == LDLM_ITER_STOP;
2021 * Iterate through all resources on a namespace attempting to grant waiting
2024 void ldlm_reprocess_all_ns(struct ldlm_namespace *ns)
2029 cfs_hash_for_each_nolock(ns->ns_rs_hash,
2030 ldlm_reprocess_res, NULL);
2034 EXPORT_SYMBOL(ldlm_reprocess_all_ns);
2037 * Try to grant all waiting locks on a resource.
2039 * Calls ldlm_reprocess_queue on converting and waiting queues.
2041 * Typically called after some resource locks are cancelled to see
2042 * if anything could be granted as a result of the cancellation.
2044 void ldlm_reprocess_all(struct ldlm_resource *res)
2046 struct list_head rpc_list;
2047 #ifdef HAVE_SERVER_SUPPORT
2051 INIT_LIST_HEAD(&rpc_list);
2052 /* Local lock trees don't get reprocessed. */
2053 if (ns_is_client(ldlm_res_to_ns(res))) {
2060 rc = ldlm_reprocess_queue(res, &res->lr_converting, &rpc_list);
2061 if (rc == LDLM_ITER_CONTINUE)
2062 ldlm_reprocess_queue(res, &res->lr_waiting, &rpc_list);
2065 rc = ldlm_run_ast_work(ldlm_res_to_ns(res), &rpc_list,
2067 if (rc == -ERESTART) {
2068 LASSERT(list_empty(&rpc_list));
2074 INIT_LIST_HEAD(&rpc_list);
2075 if (!ns_is_client(ldlm_res_to_ns(res))) {
2076 CERROR("This is client-side-only module, cannot handle "
2077 "LDLM_NAMESPACE_SERVER resource type lock.\n");
2083 EXPORT_SYMBOL(ldlm_reprocess_all);
2086 * Helper function to call blocking AST for LDLM lock \a lock in a
2087 * "cancelling" mode.
2089 void ldlm_cancel_callback(struct ldlm_lock *lock)
2091 check_res_locked(lock->l_resource);
2092 if (!ldlm_is_cancel(lock)) {
2093 ldlm_set_cancel(lock);
2094 if (lock->l_blocking_ast) {
2095 unlock_res_and_lock(lock);
2096 lock->l_blocking_ast(lock, NULL, lock->l_ast_data,
2098 lock_res_and_lock(lock);
2100 LDLM_DEBUG(lock, "no blocking ast");
2103 ldlm_set_bl_done(lock);
2107 * Remove skiplist-enabled LDLM lock \a req from granted list
2109 void ldlm_unlink_lock_skiplist(struct ldlm_lock *req)
2111 if (req->l_resource->lr_type != LDLM_PLAIN &&
2112 req->l_resource->lr_type != LDLM_IBITS)
2115 list_del_init(&req->l_sl_policy);
2116 list_del_init(&req->l_sl_mode);
2120 * Attempts to cancel LDLM lock \a lock that has no reader/writer references.
2122 void ldlm_lock_cancel(struct ldlm_lock *lock)
2124 struct ldlm_resource *res;
2125 struct ldlm_namespace *ns;
2128 lock_res_and_lock(lock);
2130 res = lock->l_resource;
2131 ns = ldlm_res_to_ns(res);
2133 /* Please do not, no matter how tempting, remove this LBUG without
2134 * talking to me first. -phik */
2135 if (lock->l_readers || lock->l_writers) {
2136 LDLM_ERROR(lock, "lock still has references");
2140 if (ldlm_is_waited(lock))
2141 ldlm_del_waiting_lock(lock);
2143 /* Releases cancel callback. */
2144 ldlm_cancel_callback(lock);
2146 /* Yes, second time, just in case it was added again while we were
2147 * running with no res lock in ldlm_cancel_callback */
2148 if (ldlm_is_waited(lock))
2149 ldlm_del_waiting_lock(lock);
2151 ldlm_resource_unlink_lock(lock);
2152 ldlm_lock_destroy_nolock(lock);
2154 if (lock->l_granted_mode == lock->l_req_mode)
2155 ldlm_pool_del(&ns->ns_pool, lock);
2157 /* Make sure we will not be called again for same lock what is possible
2158 * if not to zero out lock->l_granted_mode */
2159 lock->l_granted_mode = LCK_MINMODE;
2160 unlock_res_and_lock(lock);
2164 EXPORT_SYMBOL(ldlm_lock_cancel);
2167 * Set opaque data into the lock that only makes sense to upper layer.
2169 int ldlm_lock_set_data(struct lustre_handle *lockh, void *data)
2171 struct ldlm_lock *lock = ldlm_handle2lock(lockh);
2176 if (lock->l_ast_data == NULL)
2177 lock->l_ast_data = data;
2178 if (lock->l_ast_data == data)
2180 LDLM_LOCK_PUT(lock);
2184 EXPORT_SYMBOL(ldlm_lock_set_data);
2186 struct export_cl_data {
2187 struct obd_export *ecl_exp;
2192 * Iterator function for ldlm_cancel_locks_for_export.
2193 * Cancels passed locks.
2195 int ldlm_cancel_locks_for_export_cb(cfs_hash_t *hs, cfs_hash_bd_t *bd,
2196 struct hlist_node *hnode, void *data)
2199 struct export_cl_data *ecl = (struct export_cl_data *)data;
2200 struct obd_export *exp = ecl->ecl_exp;
2201 struct ldlm_lock *lock = cfs_hash_object(hs, hnode);
2202 struct ldlm_resource *res;
2204 res = ldlm_resource_getref(lock->l_resource);
2205 LDLM_LOCK_GET(lock);
2207 LDLM_DEBUG(lock, "export %p", exp);
2208 ldlm_res_lvbo_update(res, NULL, 1);
2209 ldlm_lock_cancel(lock);
2210 ldlm_reprocess_all(res);
2211 ldlm_resource_putref(res);
2212 LDLM_LOCK_RELEASE(lock);
2215 if ((ecl->ecl_loop & -ecl->ecl_loop) == ecl->ecl_loop) {
2217 "Cancel lock %p for export %p (loop %d), still have "
2218 "%d locks left on hash table.\n",
2219 lock, exp, ecl->ecl_loop,
2220 atomic_read(&hs->hs_count));
2227 * Cancel all locks for given export.
2229 * Typically called on client disconnection/eviction
2231 void ldlm_cancel_locks_for_export(struct obd_export *exp)
2233 struct export_cl_data ecl = {
2238 cfs_hash_for_each_empty(exp->exp_lock_hash,
2239 ldlm_cancel_locks_for_export_cb, &ecl);
2243 * Downgrade an exclusive lock.
2245 * A fast variant of ldlm_lock_convert for convertion of exclusive
2246 * locks. The convertion is always successful.
2247 * Used by Commit on Sharing (COS) code.
2249 * \param lock A lock to convert
2250 * \param new_mode new lock mode
2252 void ldlm_lock_downgrade(struct ldlm_lock *lock, int new_mode)
2256 LASSERT(lock->l_granted_mode & (LCK_PW | LCK_EX));
2257 LASSERT(new_mode == LCK_COS);
2259 lock_res_and_lock(lock);
2260 ldlm_resource_unlink_lock(lock);
2262 * Remove the lock from pool as it will be added again in
2263 * ldlm_grant_lock() called below.
2265 ldlm_pool_del(&ldlm_lock_to_ns(lock)->ns_pool, lock);
2267 lock->l_req_mode = new_mode;
2268 ldlm_grant_lock(lock, NULL);
2269 unlock_res_and_lock(lock);
2270 ldlm_reprocess_all(lock->l_resource);
2274 EXPORT_SYMBOL(ldlm_lock_downgrade);
2277 * Attempt to convert already granted lock to a different mode.
2279 * While lock conversion is not currently used, future client-side
2280 * optimizations could take advantage of it to avoid discarding cached
2283 struct ldlm_resource *ldlm_lock_convert(struct ldlm_lock *lock, int new_mode,
2286 struct list_head rpc_list;
2287 struct ldlm_resource *res;
2288 struct ldlm_namespace *ns;
2290 #ifdef HAVE_SERVER_SUPPORT
2292 struct sl_insert_point prev;
2294 struct ldlm_interval *node;
2297 INIT_LIST_HEAD(&rpc_list);
2298 /* Just return if mode is unchanged. */
2299 if (new_mode == lock->l_granted_mode) {
2300 *flags |= LDLM_FL_BLOCK_GRANTED;
2301 RETURN(lock->l_resource);
2304 /* I can't check the type of lock here because the bitlock of lock
2305 * is not held here, so do the allocation blindly. -jay */
2306 OBD_SLAB_ALLOC_PTR_GFP(node, ldlm_interval_slab, GFP_NOFS);
2307 if (node == NULL) /* Actually, this causes EDEADLOCK to be returned */
2310 LASSERTF((new_mode == LCK_PW && lock->l_granted_mode == LCK_PR),
2311 "new_mode %u, granted %u\n", new_mode, lock->l_granted_mode);
2313 lock_res_and_lock(lock);
2315 res = lock->l_resource;
2316 ns = ldlm_res_to_ns(res);
2318 #ifdef HAVE_SERVER_SUPPORT
2319 old_mode = lock->l_req_mode;
2321 lock->l_req_mode = new_mode;
2322 if (res->lr_type == LDLM_PLAIN || res->lr_type == LDLM_IBITS) {
2323 #ifdef HAVE_SERVER_SUPPORT
2324 /* remember the lock position where the lock might be
2325 * added back to the granted list later and also
2326 * remember the join mode for skiplist fixing. */
2327 prev.res_link = lock->l_res_link.prev;
2328 prev.mode_link = lock->l_sl_mode.prev;
2329 prev.policy_link = lock->l_sl_policy.prev;
2331 ldlm_resource_unlink_lock(lock);
2333 ldlm_resource_unlink_lock(lock);
2334 if (res->lr_type == LDLM_EXTENT) {
2335 /* FIXME: ugly code, I have to attach the lock to a
2336 * interval node again since perhaps it will be granted
2338 INIT_LIST_HEAD(&node->li_group);
2339 ldlm_interval_attach(node, lock);
2345 * Remove old lock from the pool before adding the lock with new
2346 * mode below in ->policy()
2348 ldlm_pool_del(&ns->ns_pool, lock);
2350 /* If this is a local resource, put it on the appropriate list. */
2351 if (ns_is_client(ldlm_res_to_ns(res))) {
2352 if (*flags & (LDLM_FL_BLOCK_CONV | LDLM_FL_BLOCK_GRANTED)) {
2353 ldlm_resource_add_lock(res, &res->lr_converting, lock);
2355 /* This should never happen, because of the way the
2356 * server handles conversions. */
2357 LDLM_ERROR(lock, "Erroneous flags %x on local lock\n",
2361 ldlm_grant_lock(lock, &rpc_list);
2363 /* FIXME: completion handling not with lr_lock held ! */
2364 if (lock->l_completion_ast)
2365 lock->l_completion_ast(lock, 0, NULL);
2367 #ifdef HAVE_SERVER_SUPPORT
2372 ldlm_processing_policy policy;
2373 policy = ldlm_processing_policy_table[res->lr_type];
2374 rc = policy(lock, &pflags, 0, &err, &rpc_list);
2375 if (rc == LDLM_ITER_STOP) {
2376 lock->l_req_mode = old_mode;
2377 if (res->lr_type == LDLM_EXTENT)
2378 ldlm_extent_add_lock(res, lock);
2380 ldlm_granted_list_add_lock(lock, &prev);
2384 *flags |= LDLM_FL_BLOCK_GRANTED;
2390 CERROR("This is client-side-only module, cannot handle "
2391 "LDLM_NAMESPACE_SERVER resource type lock.\n");
2395 unlock_res_and_lock(lock);
2398 ldlm_run_ast_work(ns, &rpc_list, LDLM_WORK_CP_AST);
2400 OBD_SLAB_FREE(node, ldlm_interval_slab, sizeof(*node));
2403 EXPORT_SYMBOL(ldlm_lock_convert);
2406 * Print lock with lock handle \a lockh description into debug log.
2408 * Used when printing all locks on a resource for debug purposes.
2410 void ldlm_lock_dump_handle(int level, struct lustre_handle *lockh)
2412 struct ldlm_lock *lock;
2414 if (!((libcfs_debug | D_ERROR) & level))
2417 lock = ldlm_handle2lock(lockh);
2421 LDLM_DEBUG_LIMIT(level, lock, "###");
2423 LDLM_LOCK_PUT(lock);
2425 EXPORT_SYMBOL(ldlm_lock_dump_handle);
2428 * Print lock information with custom message into debug log.
2431 void _ldlm_lock_debug(struct ldlm_lock *lock,
2432 struct libcfs_debug_msg_data *msgdata,
2433 const char *fmt, ...)
2436 struct obd_export *exp = lock->l_export;
2437 struct ldlm_resource *resource = lock->l_resource;
2438 char *nid = "local";
2440 va_start(args, fmt);
2442 if (exp && exp->exp_connection) {
2443 nid = libcfs_nid2str(exp->exp_connection->c_peer.nid);
2444 } else if (exp && exp->exp_obd != NULL) {
2445 struct obd_import *imp = exp->exp_obd->u.cli.cl_import;
2446 nid = libcfs_nid2str(imp->imp_connection->c_peer.nid);
2449 if (resource == NULL) {
2450 libcfs_debug_vmsg2(msgdata, fmt, args,
2451 " ns: \?\? lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
2452 "res: \?\? rrc=\?\? type: \?\?\? flags: "LPX64" nid: %s "
2453 "remote: "LPX64" expref: %d pid: %u timeout: %lu "
2456 lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
2457 lock->l_readers, lock->l_writers,
2458 ldlm_lockname[lock->l_granted_mode],
2459 ldlm_lockname[lock->l_req_mode],
2460 lock->l_flags, nid, lock->l_remote_handle.cookie,
2461 exp ? atomic_read(&exp->exp_refcount) : -99,
2462 lock->l_pid, lock->l_callback_timeout, lock->l_lvb_type);
2467 switch (resource->lr_type) {
2469 libcfs_debug_vmsg2(msgdata, fmt, args,
2470 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
2471 "res: "DLDLMRES" rrc: %d type: %s ["LPU64"->"LPU64"] "
2472 "(req "LPU64"->"LPU64") flags: "LPX64" nid: %s remote: "
2473 LPX64" expref: %d pid: %u timeout: %lu lvb_type: %d\n",
2474 ldlm_lock_to_ns_name(lock), lock,
2475 lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
2476 lock->l_readers, lock->l_writers,
2477 ldlm_lockname[lock->l_granted_mode],
2478 ldlm_lockname[lock->l_req_mode],
2480 atomic_read(&resource->lr_refcount),
2481 ldlm_typename[resource->lr_type],
2482 lock->l_policy_data.l_extent.start,
2483 lock->l_policy_data.l_extent.end,
2484 lock->l_req_extent.start, lock->l_req_extent.end,
2485 lock->l_flags, nid, lock->l_remote_handle.cookie,
2486 exp ? atomic_read(&exp->exp_refcount) : -99,
2487 lock->l_pid, lock->l_callback_timeout,
2492 libcfs_debug_vmsg2(msgdata, fmt, args,
2493 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
2494 "res: "DLDLMRES" rrc: %d type: %s pid: %d "
2495 "["LPU64"->"LPU64"] flags: "LPX64" nid: %s "
2496 "remote: "LPX64" expref: %d pid: %u timeout: %lu\n",
2497 ldlm_lock_to_ns_name(lock), lock,
2498 lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
2499 lock->l_readers, lock->l_writers,
2500 ldlm_lockname[lock->l_granted_mode],
2501 ldlm_lockname[lock->l_req_mode],
2503 atomic_read(&resource->lr_refcount),
2504 ldlm_typename[resource->lr_type],
2505 lock->l_policy_data.l_flock.pid,
2506 lock->l_policy_data.l_flock.start,
2507 lock->l_policy_data.l_flock.end,
2508 lock->l_flags, nid, lock->l_remote_handle.cookie,
2509 exp ? atomic_read(&exp->exp_refcount) : -99,
2510 lock->l_pid, lock->l_callback_timeout);
2514 libcfs_debug_vmsg2(msgdata, fmt, args,
2515 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
2516 "res: "DLDLMRES" bits "LPX64" rrc: %d type: %s "
2517 "flags: "LPX64" nid: %s remote: "LPX64" expref: %d "
2518 "pid: %u timeout: %lu lvb_type: %d\n",
2519 ldlm_lock_to_ns_name(lock),
2520 lock, lock->l_handle.h_cookie,
2521 atomic_read(&lock->l_refc),
2522 lock->l_readers, lock->l_writers,
2523 ldlm_lockname[lock->l_granted_mode],
2524 ldlm_lockname[lock->l_req_mode],
2526 lock->l_policy_data.l_inodebits.bits,
2527 atomic_read(&resource->lr_refcount),
2528 ldlm_typename[resource->lr_type],
2529 lock->l_flags, nid, lock->l_remote_handle.cookie,
2530 exp ? atomic_read(&exp->exp_refcount) : -99,
2531 lock->l_pid, lock->l_callback_timeout,
2536 libcfs_debug_vmsg2(msgdata, fmt, args,
2537 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
2538 "res: "DLDLMRES" rrc: %d type: %s flags: "LPX64" "
2539 "nid: %s remote: "LPX64" expref: %d pid: %u "
2540 "timeout: %lu lvb_type: %d\n",
2541 ldlm_lock_to_ns_name(lock),
2542 lock, lock->l_handle.h_cookie,
2543 atomic_read(&lock->l_refc),
2544 lock->l_readers, lock->l_writers,
2545 ldlm_lockname[lock->l_granted_mode],
2546 ldlm_lockname[lock->l_req_mode],
2548 atomic_read(&resource->lr_refcount),
2549 ldlm_typename[resource->lr_type],
2550 lock->l_flags, nid, lock->l_remote_handle.cookie,
2551 exp ? atomic_read(&exp->exp_refcount) : -99,
2552 lock->l_pid, lock->l_callback_timeout,
2558 EXPORT_SYMBOL(_ldlm_lock_debug);