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, 2012, 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 "../../include/linux/libcfs/libcfs.h"
45 #include "../include/lustre_intent.h"
46 #include "../include/obd_class.h"
47 #include "ldlm_internal.h"
50 char *ldlm_lockname[] = {
58 [LCK_GROUP] = "GROUP",
61 EXPORT_SYMBOL(ldlm_lockname);
63 char *ldlm_typename[] = {
65 [LDLM_EXTENT] = "EXT",
69 EXPORT_SYMBOL(ldlm_typename);
71 static ldlm_policy_wire_to_local_t ldlm_policy_wire18_to_local[] = {
72 [LDLM_PLAIN - LDLM_MIN_TYPE] = ldlm_plain_policy_wire_to_local,
73 [LDLM_EXTENT - LDLM_MIN_TYPE] = ldlm_extent_policy_wire_to_local,
74 [LDLM_FLOCK - LDLM_MIN_TYPE] = ldlm_flock_policy_wire18_to_local,
75 [LDLM_IBITS - LDLM_MIN_TYPE] = ldlm_ibits_policy_wire_to_local,
78 static ldlm_policy_wire_to_local_t ldlm_policy_wire21_to_local[] = {
79 [LDLM_PLAIN - LDLM_MIN_TYPE] = ldlm_plain_policy_wire_to_local,
80 [LDLM_EXTENT - LDLM_MIN_TYPE] = ldlm_extent_policy_wire_to_local,
81 [LDLM_FLOCK - LDLM_MIN_TYPE] = ldlm_flock_policy_wire21_to_local,
82 [LDLM_IBITS - LDLM_MIN_TYPE] = ldlm_ibits_policy_wire_to_local,
85 static ldlm_policy_local_to_wire_t ldlm_policy_local_to_wire[] = {
86 [LDLM_PLAIN - LDLM_MIN_TYPE] = ldlm_plain_policy_local_to_wire,
87 [LDLM_EXTENT - LDLM_MIN_TYPE] = ldlm_extent_policy_local_to_wire,
88 [LDLM_FLOCK - LDLM_MIN_TYPE] = ldlm_flock_policy_local_to_wire,
89 [LDLM_IBITS - LDLM_MIN_TYPE] = ldlm_ibits_policy_local_to_wire,
93 * Converts lock policy from local format to on the wire lock_desc format
95 void ldlm_convert_policy_to_wire(ldlm_type_t type,
96 const ldlm_policy_data_t *lpolicy,
97 ldlm_wire_policy_data_t *wpolicy)
99 ldlm_policy_local_to_wire_t convert;
101 convert = ldlm_policy_local_to_wire[type - LDLM_MIN_TYPE];
103 convert(lpolicy, wpolicy);
107 * Converts lock policy from on the wire lock_desc format to local format
109 void ldlm_convert_policy_to_local(struct obd_export *exp, ldlm_type_t type,
110 const ldlm_wire_policy_data_t *wpolicy,
111 ldlm_policy_data_t *lpolicy)
113 ldlm_policy_wire_to_local_t convert;
116 /** some badness for 2.0.0 clients, but 2.0.0 isn't supported */
117 new_client = (exp_connect_flags(exp) & OBD_CONNECT_FULL20) != 0;
119 convert = ldlm_policy_wire21_to_local[type - LDLM_MIN_TYPE];
121 convert = ldlm_policy_wire18_to_local[type - LDLM_MIN_TYPE];
123 convert(wpolicy, lpolicy);
126 char *ldlm_it2str(int it)
133 case (IT_OPEN | IT_CREAT):
148 CERROR("Unknown intent %d\n", it);
152 EXPORT_SYMBOL(ldlm_it2str);
154 extern struct kmem_cache *ldlm_lock_slab;
157 void ldlm_register_intent(struct ldlm_namespace *ns, ldlm_res_policy arg)
161 EXPORT_SYMBOL(ldlm_register_intent);
164 * REFCOUNTED LOCK OBJECTS
169 * Get a reference on a lock.
171 * Lock refcounts, during creation:
172 * - one special one for allocation, dec'd only once in destroy
173 * - one for being a lock that's in-use
174 * - one for the addref associated with a new lock
176 struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock)
178 atomic_inc(&lock->l_refc);
181 EXPORT_SYMBOL(ldlm_lock_get);
184 * Release lock reference.
186 * Also frees the lock if it was last reference.
188 void ldlm_lock_put(struct ldlm_lock *lock)
190 LASSERT(lock->l_resource != LP_POISON);
191 LASSERT(atomic_read(&lock->l_refc) > 0);
192 if (atomic_dec_and_test(&lock->l_refc)) {
193 struct ldlm_resource *res;
196 "final lock_put on destroyed lock, freeing it.");
198 res = lock->l_resource;
199 LASSERT(lock->l_flags & LDLM_FL_DESTROYED);
200 LASSERT(list_empty(&lock->l_res_link));
201 LASSERT(list_empty(&lock->l_pending_chain));
203 lprocfs_counter_decr(ldlm_res_to_ns(res)->ns_stats,
205 lu_ref_del(&res->lr_reference, "lock", lock);
206 ldlm_resource_putref(res);
207 lock->l_resource = NULL;
208 if (lock->l_export) {
209 class_export_lock_put(lock->l_export, lock);
210 lock->l_export = NULL;
213 if (lock->l_lvb_data != NULL)
214 OBD_FREE(lock->l_lvb_data, lock->l_lvb_len);
216 ldlm_interval_free(ldlm_interval_detach(lock));
217 lu_ref_fini(&lock->l_reference);
218 OBD_FREE_RCU(lock, sizeof(*lock), &lock->l_handle);
221 EXPORT_SYMBOL(ldlm_lock_put);
224 * Removes LDLM lock \a lock from LRU. Assumes LRU is already locked.
226 int ldlm_lock_remove_from_lru_nolock(struct ldlm_lock *lock)
230 if (!list_empty(&lock->l_lru)) {
231 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
233 LASSERT(lock->l_resource->lr_type != LDLM_FLOCK);
234 list_del_init(&lock->l_lru);
235 LASSERT(ns->ns_nr_unused > 0);
243 * Removes LDLM lock \a lock from LRU. Obtains the LRU lock first.
245 int ldlm_lock_remove_from_lru(struct ldlm_lock *lock)
247 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
250 if (lock->l_flags & LDLM_FL_NS_SRV) {
251 LASSERT(list_empty(&lock->l_lru));
255 spin_lock(&ns->ns_lock);
256 rc = ldlm_lock_remove_from_lru_nolock(lock);
257 spin_unlock(&ns->ns_lock);
262 * Adds LDLM lock \a lock to namespace LRU. Assumes LRU is already locked.
264 void ldlm_lock_add_to_lru_nolock(struct ldlm_lock *lock)
266 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
268 lock->l_last_used = cfs_time_current();
269 LASSERT(list_empty(&lock->l_lru));
270 LASSERT(lock->l_resource->lr_type != LDLM_FLOCK);
271 list_add_tail(&lock->l_lru, &ns->ns_unused_list);
272 if (lock->l_flags & LDLM_FL_SKIPPED)
273 lock->l_flags &= ~LDLM_FL_SKIPPED;
274 LASSERT(ns->ns_nr_unused >= 0);
279 * Adds LDLM lock \a lock to namespace LRU. Obtains necessary LRU locks
282 void ldlm_lock_add_to_lru(struct ldlm_lock *lock)
284 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
286 spin_lock(&ns->ns_lock);
287 ldlm_lock_add_to_lru_nolock(lock);
288 spin_unlock(&ns->ns_lock);
292 * Moves LDLM lock \a lock that is already in namespace LRU to the tail of
293 * the LRU. Performs necessary LRU locking
295 void ldlm_lock_touch_in_lru(struct ldlm_lock *lock)
297 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
299 if (lock->l_flags & LDLM_FL_NS_SRV) {
300 LASSERT(list_empty(&lock->l_lru));
304 spin_lock(&ns->ns_lock);
305 if (!list_empty(&lock->l_lru)) {
306 ldlm_lock_remove_from_lru_nolock(lock);
307 ldlm_lock_add_to_lru_nolock(lock);
309 spin_unlock(&ns->ns_lock);
313 * Helper to destroy a locked lock.
315 * Used by ldlm_lock_destroy and ldlm_lock_destroy_nolock
316 * Must be called with l_lock and lr_lock held.
318 * Does not actually free the lock data, but rather marks the lock as
319 * destroyed by setting l_destroyed field in the lock to 1. Destroys a
320 * handle->lock association too, so that the lock can no longer be found
321 * and removes the lock from LRU list. Actual lock freeing occurs when
322 * last lock reference goes away.
324 * Original comment (of some historical value):
325 * This used to have a 'strict' flag, which recovery would use to mark an
326 * in-use lock as needing-to-die. Lest I am ever tempted to put it back, I
327 * shall explain why it's gone: with the new hash table scheme, once you call
328 * ldlm_lock_destroy, you can never drop your final references on this lock.
329 * Because it's not in the hash table anymore. -phil
331 int ldlm_lock_destroy_internal(struct ldlm_lock *lock)
333 if (lock->l_readers || lock->l_writers) {
334 LDLM_ERROR(lock, "lock still has references");
338 if (!list_empty(&lock->l_res_link)) {
339 LDLM_ERROR(lock, "lock still on resource");
343 if (lock->l_flags & LDLM_FL_DESTROYED) {
344 LASSERT(list_empty(&lock->l_lru));
347 lock->l_flags |= LDLM_FL_DESTROYED;
349 if (lock->l_export && lock->l_export->exp_lock_hash) {
350 /* NB: it's safe to call cfs_hash_del() even lock isn't
351 * in exp_lock_hash. */
352 /* In the function below, .hs_keycmp resolves to
353 * ldlm_export_lock_keycmp() */
354 /* coverity[overrun-buffer-val] */
355 cfs_hash_del(lock->l_export->exp_lock_hash,
356 &lock->l_remote_handle, &lock->l_exp_hash);
359 ldlm_lock_remove_from_lru(lock);
360 class_handle_unhash(&lock->l_handle);
363 /* Wake anyone waiting for this lock */
364 /* FIXME: I should probably add yet another flag, instead of using
365 * l_export to only call this on clients */
367 class_export_put(lock->l_export);
368 lock->l_export = NULL;
369 if (lock->l_export && lock->l_completion_ast)
370 lock->l_completion_ast(lock, 0);
376 * Destroys a LDLM lock \a lock. Performs necessary locking first.
378 void ldlm_lock_destroy(struct ldlm_lock *lock)
382 lock_res_and_lock(lock);
383 first = ldlm_lock_destroy_internal(lock);
384 unlock_res_and_lock(lock);
386 /* drop reference from hashtable only for first destroy */
388 lu_ref_del(&lock->l_reference, "hash", lock);
389 LDLM_LOCK_RELEASE(lock);
394 * Destroys a LDLM lock \a lock that is already locked.
396 void ldlm_lock_destroy_nolock(struct ldlm_lock *lock)
400 first = ldlm_lock_destroy_internal(lock);
401 /* drop reference from hashtable only for first destroy */
403 lu_ref_del(&lock->l_reference, "hash", lock);
404 LDLM_LOCK_RELEASE(lock);
408 /* this is called by portals_handle2object with the handle lock taken */
409 static void lock_handle_addref(void *lock)
411 LDLM_LOCK_GET((struct ldlm_lock *)lock);
414 static void lock_handle_free(void *lock, int size)
416 LASSERT(size == sizeof(struct ldlm_lock));
417 OBD_SLAB_FREE(lock, ldlm_lock_slab, size);
420 struct portals_handle_ops lock_handle_ops = {
421 .hop_addref = lock_handle_addref,
422 .hop_free = lock_handle_free,
427 * Allocate and initialize new lock structure.
429 * usage: pass in a resource on which you have done ldlm_resource_get
430 * new lock will take over the refcount.
431 * returns: lock with refcount 2 - one for current caller and one for remote
433 static struct ldlm_lock *ldlm_lock_new(struct ldlm_resource *resource)
435 struct ldlm_lock *lock;
437 if (resource == NULL)
440 OBD_SLAB_ALLOC_PTR_GFP(lock, ldlm_lock_slab, GFP_NOFS);
444 spin_lock_init(&lock->l_lock);
445 lock->l_resource = resource;
446 lu_ref_add(&resource->lr_reference, "lock", lock);
448 atomic_set(&lock->l_refc, 2);
449 INIT_LIST_HEAD(&lock->l_res_link);
450 INIT_LIST_HEAD(&lock->l_lru);
451 INIT_LIST_HEAD(&lock->l_pending_chain);
452 INIT_LIST_HEAD(&lock->l_bl_ast);
453 INIT_LIST_HEAD(&lock->l_cp_ast);
454 INIT_LIST_HEAD(&lock->l_rk_ast);
455 init_waitqueue_head(&lock->l_waitq);
456 lock->l_blocking_lock = NULL;
457 INIT_LIST_HEAD(&lock->l_sl_mode);
458 INIT_LIST_HEAD(&lock->l_sl_policy);
459 INIT_HLIST_NODE(&lock->l_exp_hash);
460 INIT_HLIST_NODE(&lock->l_exp_flock_hash);
462 lprocfs_counter_incr(ldlm_res_to_ns(resource)->ns_stats,
464 INIT_LIST_HEAD(&lock->l_handle.h_link);
465 class_handle_hash(&lock->l_handle, &lock_handle_ops);
467 lu_ref_init(&lock->l_reference);
468 lu_ref_add(&lock->l_reference, "hash", lock);
469 lock->l_callback_timeout = 0;
471 #if LUSTRE_TRACKS_LOCK_EXP_REFS
472 INIT_LIST_HEAD(&lock->l_exp_refs_link);
473 lock->l_exp_refs_nr = 0;
474 lock->l_exp_refs_target = NULL;
476 INIT_LIST_HEAD(&lock->l_exp_list);
482 * Moves LDLM lock \a lock to another resource.
483 * This is used on client when server returns some other lock than requested
484 * (typically as a result of intent operation)
486 int ldlm_lock_change_resource(struct ldlm_namespace *ns, struct ldlm_lock *lock,
487 const struct ldlm_res_id *new_resid)
489 struct ldlm_resource *oldres = lock->l_resource;
490 struct ldlm_resource *newres;
493 LASSERT(ns_is_client(ns));
495 lock_res_and_lock(lock);
496 if (memcmp(new_resid, &lock->l_resource->lr_name,
497 sizeof(lock->l_resource->lr_name)) == 0) {
499 unlock_res_and_lock(lock);
503 LASSERT(new_resid->name[0] != 0);
505 /* This function assumes that the lock isn't on any lists */
506 LASSERT(list_empty(&lock->l_res_link));
508 type = oldres->lr_type;
509 unlock_res_and_lock(lock);
511 newres = ldlm_resource_get(ns, NULL, new_resid, type, 1);
515 lu_ref_add(&newres->lr_reference, "lock", lock);
517 * To flip the lock from the old to the new resource, lock, oldres and
518 * newres have to be locked. Resource spin-locks are nested within
519 * lock->l_lock, and are taken in the memory address order to avoid
522 spin_lock(&lock->l_lock);
523 oldres = lock->l_resource;
524 if (oldres < newres) {
526 lock_res_nested(newres, LRT_NEW);
529 lock_res_nested(oldres, LRT_NEW);
531 LASSERT(memcmp(new_resid, &oldres->lr_name,
532 sizeof(oldres->lr_name)) != 0);
533 lock->l_resource = newres;
535 unlock_res_and_lock(lock);
537 /* ...and the flowers are still standing! */
538 lu_ref_del(&oldres->lr_reference, "lock", lock);
539 ldlm_resource_putref(oldres);
543 EXPORT_SYMBOL(ldlm_lock_change_resource);
545 /** \defgroup ldlm_handles LDLM HANDLES
546 * Ways to get hold of locks without any addresses.
551 * Fills in handle for LDLM lock \a lock into supplied \a lockh
552 * Does not take any references.
554 void ldlm_lock2handle(const struct ldlm_lock *lock, struct lustre_handle *lockh)
556 lockh->cookie = lock->l_handle.h_cookie;
558 EXPORT_SYMBOL(ldlm_lock2handle);
561 * Obtain a lock reference by handle.
563 * if \a flags: atomically get the lock and set the flags.
564 * Return NULL if flag already set
566 struct ldlm_lock *__ldlm_handle2lock(const struct lustre_handle *handle,
569 struct ldlm_lock *lock;
573 lock = class_handle2object(handle->cookie);
577 /* It's unlikely but possible that someone marked the lock as
578 * destroyed after we did handle2object on it */
579 if (flags == 0 && ((lock->l_flags & LDLM_FL_DESTROYED)== 0)) {
580 lu_ref_add(&lock->l_reference, "handle", current);
584 lock_res_and_lock(lock);
586 LASSERT(lock->l_resource != NULL);
588 lu_ref_add_atomic(&lock->l_reference, "handle", current);
589 if (unlikely(lock->l_flags & LDLM_FL_DESTROYED)) {
590 unlock_res_and_lock(lock);
591 CDEBUG(D_INFO, "lock already destroyed: lock %p\n", lock);
596 if (flags && (lock->l_flags & flags)) {
597 unlock_res_and_lock(lock);
603 lock->l_flags |= flags;
605 unlock_res_and_lock(lock);
608 EXPORT_SYMBOL(__ldlm_handle2lock);
609 /** @} ldlm_handles */
612 * Fill in "on the wire" representation for given LDLM lock into supplied
613 * lock descriptor \a desc structure.
615 void ldlm_lock2desc(struct ldlm_lock *lock, struct ldlm_lock_desc *desc)
617 ldlm_res2desc(lock->l_resource, &desc->l_resource);
618 desc->l_req_mode = lock->l_req_mode;
619 desc->l_granted_mode = lock->l_granted_mode;
620 ldlm_convert_policy_to_wire(lock->l_resource->lr_type,
621 &lock->l_policy_data,
622 &desc->l_policy_data);
624 EXPORT_SYMBOL(ldlm_lock2desc);
627 * Add a lock to list of conflicting locks to send AST to.
629 * Only add if we have not sent a blocking AST to the lock yet.
631 void ldlm_add_bl_work_item(struct ldlm_lock *lock, struct ldlm_lock *new,
632 struct list_head *work_list)
634 if ((lock->l_flags & LDLM_FL_AST_SENT) == 0) {
635 LDLM_DEBUG(lock, "lock incompatible; sending blocking AST.");
636 lock->l_flags |= LDLM_FL_AST_SENT;
637 /* If the enqueuing client said so, tell the AST recipient to
638 * discard dirty data, rather than writing back. */
639 if (new->l_flags & LDLM_FL_AST_DISCARD_DATA)
640 lock->l_flags |= LDLM_FL_DISCARD_DATA;
641 LASSERT(list_empty(&lock->l_bl_ast));
642 list_add(&lock->l_bl_ast, work_list);
644 LASSERT(lock->l_blocking_lock == NULL);
645 lock->l_blocking_lock = LDLM_LOCK_GET(new);
650 * Add a lock to list of just granted locks to send completion AST to.
652 void ldlm_add_cp_work_item(struct ldlm_lock *lock, struct list_head *work_list)
654 if ((lock->l_flags & LDLM_FL_CP_REQD) == 0) {
655 lock->l_flags |= LDLM_FL_CP_REQD;
656 LDLM_DEBUG(lock, "lock granted; sending completion AST.");
657 LASSERT(list_empty(&lock->l_cp_ast));
658 list_add(&lock->l_cp_ast, work_list);
664 * Aggregator function to add AST work items into a list. Determines
665 * what sort of an AST work needs to be done and calls the proper
667 * Must be called with lr_lock held.
669 void ldlm_add_ast_work_item(struct ldlm_lock *lock, struct ldlm_lock *new,
670 struct list_head *work_list)
672 check_res_locked(lock->l_resource);
674 ldlm_add_bl_work_item(lock, new, work_list);
676 ldlm_add_cp_work_item(lock, work_list);
680 * Add specified reader/writer reference to LDLM lock with handle \a lockh.
681 * r/w reference type is determined by \a mode
682 * Calls ldlm_lock_addref_internal.
684 void ldlm_lock_addref(struct lustre_handle *lockh, __u32 mode)
686 struct ldlm_lock *lock;
688 lock = ldlm_handle2lock(lockh);
689 LASSERT(lock != NULL);
690 ldlm_lock_addref_internal(lock, mode);
693 EXPORT_SYMBOL(ldlm_lock_addref);
697 * Add specified reader/writer reference to LDLM lock \a lock.
698 * r/w reference type is determined by \a mode
699 * Removes lock from LRU if it is there.
700 * Assumes the LDLM lock is already locked.
702 void ldlm_lock_addref_internal_nolock(struct ldlm_lock *lock, __u32 mode)
704 ldlm_lock_remove_from_lru(lock);
705 if (mode & (LCK_NL | LCK_CR | LCK_PR)) {
707 lu_ref_add_atomic(&lock->l_reference, "reader", lock);
709 if (mode & (LCK_EX | LCK_CW | LCK_PW | LCK_GROUP | LCK_COS)) {
711 lu_ref_add_atomic(&lock->l_reference, "writer", lock);
714 lu_ref_add_atomic(&lock->l_reference, "user", lock);
715 LDLM_DEBUG(lock, "ldlm_lock_addref(%s)", ldlm_lockname[mode]);
719 * Attempts to add reader/writer reference to a lock with handle \a lockh, and
720 * fails if lock is already LDLM_FL_CBPENDING or destroyed.
722 * \retval 0 success, lock was addref-ed
724 * \retval -EAGAIN lock is being canceled.
726 int ldlm_lock_addref_try(struct lustre_handle *lockh, __u32 mode)
728 struct ldlm_lock *lock;
732 lock = ldlm_handle2lock(lockh);
734 lock_res_and_lock(lock);
735 if (lock->l_readers != 0 || lock->l_writers != 0 ||
736 !(lock->l_flags & LDLM_FL_CBPENDING)) {
737 ldlm_lock_addref_internal_nolock(lock, mode);
740 unlock_res_and_lock(lock);
745 EXPORT_SYMBOL(ldlm_lock_addref_try);
748 * Add specified reader/writer reference to LDLM lock \a lock.
749 * Locks LDLM lock and calls ldlm_lock_addref_internal_nolock to do the work.
750 * Only called for local locks.
752 void ldlm_lock_addref_internal(struct ldlm_lock *lock, __u32 mode)
754 lock_res_and_lock(lock);
755 ldlm_lock_addref_internal_nolock(lock, mode);
756 unlock_res_and_lock(lock);
760 * Removes reader/writer reference for LDLM lock \a lock.
761 * Assumes LDLM lock is already locked.
762 * only called in ldlm_flock_destroy and for local locks.
763 * Does NOT add lock to LRU if no r/w references left to accommodate flock locks
764 * that cannot be placed in LRU.
766 void ldlm_lock_decref_internal_nolock(struct ldlm_lock *lock, __u32 mode)
768 LDLM_DEBUG(lock, "ldlm_lock_decref(%s)", ldlm_lockname[mode]);
769 if (mode & (LCK_NL | LCK_CR | LCK_PR)) {
770 LASSERT(lock->l_readers > 0);
771 lu_ref_del(&lock->l_reference, "reader", lock);
774 if (mode & (LCK_EX | LCK_CW | LCK_PW | LCK_GROUP | LCK_COS)) {
775 LASSERT(lock->l_writers > 0);
776 lu_ref_del(&lock->l_reference, "writer", lock);
780 lu_ref_del(&lock->l_reference, "user", lock);
781 LDLM_LOCK_RELEASE(lock); /* matches the LDLM_LOCK_GET() in addref */
785 * Removes reader/writer reference for LDLM lock \a lock.
786 * Locks LDLM lock first.
787 * If the lock is determined to be client lock on a client and r/w refcount
788 * drops to zero and the lock is not blocked, the lock is added to LRU lock
790 * For blocked LDLM locks if r/w count drops to zero, blocking_ast is called.
792 void ldlm_lock_decref_internal(struct ldlm_lock *lock, __u32 mode)
794 struct ldlm_namespace *ns;
796 lock_res_and_lock(lock);
798 ns = ldlm_lock_to_ns(lock);
800 ldlm_lock_decref_internal_nolock(lock, mode);
802 if (lock->l_flags & LDLM_FL_LOCAL &&
803 !lock->l_readers && !lock->l_writers) {
804 /* If this is a local lock on a server namespace and this was
805 * the last reference, cancel the lock. */
806 CDEBUG(D_INFO, "forcing cancel of local lock\n");
807 lock->l_flags |= LDLM_FL_CBPENDING;
810 if (!lock->l_readers && !lock->l_writers &&
811 (lock->l_flags & LDLM_FL_CBPENDING)) {
812 /* If we received a blocked AST and this was the last reference,
813 * run the callback. */
814 if ((lock->l_flags & LDLM_FL_NS_SRV) && lock->l_export)
815 CERROR("FL_CBPENDING set on non-local lock--just a warning\n");
817 LDLM_DEBUG(lock, "final decref done on cbpending lock");
819 LDLM_LOCK_GET(lock); /* dropped by bl thread */
820 ldlm_lock_remove_from_lru(lock);
821 unlock_res_and_lock(lock);
823 if (lock->l_flags & LDLM_FL_FAIL_LOC)
824 OBD_RACE(OBD_FAIL_LDLM_CP_BL_RACE);
826 if ((lock->l_flags & LDLM_FL_ATOMIC_CB) ||
827 ldlm_bl_to_thread_lock(ns, NULL, lock) != 0)
828 ldlm_handle_bl_callback(ns, NULL, lock);
829 } else if (ns_is_client(ns) &&
830 !lock->l_readers && !lock->l_writers &&
831 !(lock->l_flags & LDLM_FL_NO_LRU) &&
832 !(lock->l_flags & LDLM_FL_BL_AST)) {
834 LDLM_DEBUG(lock, "add lock into lru list");
836 /* If this is a client-side namespace and this was the last
837 * reference, put it on the LRU. */
838 ldlm_lock_add_to_lru(lock);
839 unlock_res_and_lock(lock);
841 if (lock->l_flags & LDLM_FL_FAIL_LOC)
842 OBD_RACE(OBD_FAIL_LDLM_CP_BL_RACE);
844 /* Call ldlm_cancel_lru() only if EARLY_CANCEL and LRU RESIZE
845 * are not supported by the server, otherwise, it is done on
847 if (!exp_connect_cancelset(lock->l_conn_export) &&
848 !ns_connect_lru_resize(ns))
849 ldlm_cancel_lru(ns, 0, LCF_ASYNC, 0);
851 LDLM_DEBUG(lock, "do not add lock into lru list");
852 unlock_res_and_lock(lock);
857 * Decrease reader/writer refcount for LDLM lock with handle \a lockh
859 void ldlm_lock_decref(struct lustre_handle *lockh, __u32 mode)
861 struct ldlm_lock *lock = __ldlm_handle2lock(lockh, 0);
863 LASSERTF(lock != NULL, "Non-existing lock: %#llx\n", lockh->cookie);
864 ldlm_lock_decref_internal(lock, mode);
867 EXPORT_SYMBOL(ldlm_lock_decref);
870 * Decrease reader/writer refcount for LDLM lock with handle
871 * \a lockh and mark it for subsequent cancellation once r/w refcount
872 * drops to zero instead of putting into LRU.
874 * Typical usage is for GROUP locks which we cannot allow to be cached.
876 void ldlm_lock_decref_and_cancel(struct lustre_handle *lockh, __u32 mode)
878 struct ldlm_lock *lock = __ldlm_handle2lock(lockh, 0);
880 LASSERT(lock != NULL);
882 LDLM_DEBUG(lock, "ldlm_lock_decref(%s)", ldlm_lockname[mode]);
883 lock_res_and_lock(lock);
884 lock->l_flags |= LDLM_FL_CBPENDING;
885 unlock_res_and_lock(lock);
886 ldlm_lock_decref_internal(lock, mode);
889 EXPORT_SYMBOL(ldlm_lock_decref_and_cancel);
891 struct sl_insert_point {
892 struct list_head *res_link;
893 struct list_head *mode_link;
894 struct list_head *policy_link;
898 * Finds a position to insert the new lock into granted lock list.
900 * Used for locks eligible for skiplist optimization.
903 * queue [input]: the granted list where search acts on;
904 * req [input]: the lock whose position to be located;
905 * prev [output]: positions within 3 lists to insert @req to
909 * - ldlm_grant_lock_with_skiplist
911 static void search_granted_lock(struct list_head *queue,
912 struct ldlm_lock *req,
913 struct sl_insert_point *prev)
915 struct list_head *tmp;
916 struct ldlm_lock *lock, *mode_end, *policy_end;
918 list_for_each(tmp, queue) {
919 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
921 mode_end = list_entry(lock->l_sl_mode.prev,
922 struct ldlm_lock, l_sl_mode);
924 if (lock->l_req_mode != req->l_req_mode) {
925 /* jump to last lock of mode group */
926 tmp = &mode_end->l_res_link;
930 /* suitable mode group is found */
931 if (lock->l_resource->lr_type == LDLM_PLAIN) {
932 /* insert point is last lock of the mode group */
933 prev->res_link = &mode_end->l_res_link;
934 prev->mode_link = &mode_end->l_sl_mode;
935 prev->policy_link = &req->l_sl_policy;
937 } else if (lock->l_resource->lr_type == LDLM_IBITS) {
940 list_entry(lock->l_sl_policy.prev,
944 if (lock->l_policy_data.l_inodebits.bits ==
945 req->l_policy_data.l_inodebits.bits) {
946 /* insert point is last lock of
947 * the policy group */
949 &policy_end->l_res_link;
951 &policy_end->l_sl_mode;
953 &policy_end->l_sl_policy;
957 if (policy_end == mode_end)
958 /* done with mode group */
961 /* go to next policy group within mode group */
962 tmp = policy_end->l_res_link.next;
963 lock = list_entry(tmp, struct ldlm_lock,
965 } /* loop over policy groups within the mode group */
967 /* insert point is last lock of the mode group,
968 * new policy group is started */
969 prev->res_link = &mode_end->l_res_link;
970 prev->mode_link = &mode_end->l_sl_mode;
971 prev->policy_link = &req->l_sl_policy;
975 "is not LDLM_PLAIN or LDLM_IBITS lock");
980 /* insert point is last lock on the queue,
981 * new mode group and new policy group are started */
982 prev->res_link = queue->prev;
983 prev->mode_link = &req->l_sl_mode;
984 prev->policy_link = &req->l_sl_policy;
989 * Add a lock into resource granted list after a position described by
992 static void ldlm_granted_list_add_lock(struct ldlm_lock *lock,
993 struct sl_insert_point *prev)
995 struct ldlm_resource *res = lock->l_resource;
997 check_res_locked(res);
999 ldlm_resource_dump(D_INFO, res);
1000 LDLM_DEBUG(lock, "About to add lock:");
1002 if (lock->l_flags & LDLM_FL_DESTROYED) {
1003 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
1007 LASSERT(list_empty(&lock->l_res_link));
1008 LASSERT(list_empty(&lock->l_sl_mode));
1009 LASSERT(list_empty(&lock->l_sl_policy));
1012 * lock->link == prev->link means lock is first starting the group.
1013 * Don't re-add to itself to suppress kernel warnings.
1015 if (&lock->l_res_link != prev->res_link)
1016 list_add(&lock->l_res_link, prev->res_link);
1017 if (&lock->l_sl_mode != prev->mode_link)
1018 list_add(&lock->l_sl_mode, prev->mode_link);
1019 if (&lock->l_sl_policy != prev->policy_link)
1020 list_add(&lock->l_sl_policy, prev->policy_link);
1024 * Add a lock to granted list on a resource maintaining skiplist
1027 static void ldlm_grant_lock_with_skiplist(struct ldlm_lock *lock)
1029 struct sl_insert_point prev;
1031 LASSERT(lock->l_req_mode == lock->l_granted_mode);
1033 search_granted_lock(&lock->l_resource->lr_granted, lock, &prev);
1034 ldlm_granted_list_add_lock(lock, &prev);
1038 * Perform lock granting bookkeeping.
1040 * Includes putting the lock into granted list and updating lock mode.
1042 * - ldlm_lock_enqueue
1043 * - ldlm_reprocess_queue
1044 * - ldlm_lock_convert
1046 * must be called with lr_lock held
1048 void ldlm_grant_lock(struct ldlm_lock *lock, struct list_head *work_list)
1050 struct ldlm_resource *res = lock->l_resource;
1052 check_res_locked(res);
1054 lock->l_granted_mode = lock->l_req_mode;
1055 if (res->lr_type == LDLM_PLAIN || res->lr_type == LDLM_IBITS)
1056 ldlm_grant_lock_with_skiplist(lock);
1057 else if (res->lr_type == LDLM_EXTENT)
1058 ldlm_extent_add_lock(res, lock);
1060 ldlm_resource_add_lock(res, &res->lr_granted, lock);
1062 if (lock->l_granted_mode < res->lr_most_restr)
1063 res->lr_most_restr = lock->l_granted_mode;
1065 if (work_list && lock->l_completion_ast != NULL)
1066 ldlm_add_ast_work_item(lock, NULL, work_list);
1068 ldlm_pool_add(&ldlm_res_to_ns(res)->ns_pool, lock);
1072 * Search for a lock with given properties in a queue.
1074 * \retval a referenced lock or NULL. See the flag descriptions below, in the
1075 * comment above ldlm_lock_match
1077 static struct ldlm_lock *search_queue(struct list_head *queue,
1079 ldlm_policy_data_t *policy,
1080 struct ldlm_lock *old_lock,
1081 __u64 flags, int unref)
1083 struct ldlm_lock *lock;
1084 struct list_head *tmp;
1086 list_for_each(tmp, queue) {
1089 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
1091 if (lock == old_lock)
1094 /* Check if this lock can be matched.
1095 * Used by LU-2919(exclusive open) for open lease lock */
1096 if (ldlm_is_excl(lock))
1099 /* llite sometimes wants to match locks that will be
1100 * canceled when their users drop, but we allow it to match
1101 * if it passes in CBPENDING and the lock still has users.
1102 * this is generally only going to be used by children
1103 * whose parents already hold a lock so forward progress
1104 * can still happen. */
1105 if (lock->l_flags & LDLM_FL_CBPENDING &&
1106 !(flags & LDLM_FL_CBPENDING))
1108 if (!unref && lock->l_flags & LDLM_FL_CBPENDING &&
1109 lock->l_readers == 0 && lock->l_writers == 0)
1112 if (!(lock->l_req_mode & *mode))
1114 match = lock->l_req_mode;
1116 if (lock->l_resource->lr_type == LDLM_EXTENT &&
1117 (lock->l_policy_data.l_extent.start >
1118 policy->l_extent.start ||
1119 lock->l_policy_data.l_extent.end < policy->l_extent.end))
1122 if (unlikely(match == LCK_GROUP) &&
1123 lock->l_resource->lr_type == LDLM_EXTENT &&
1124 lock->l_policy_data.l_extent.gid != policy->l_extent.gid)
1127 /* We match if we have existing lock with same or wider set
1129 if (lock->l_resource->lr_type == LDLM_IBITS &&
1130 ((lock->l_policy_data.l_inodebits.bits &
1131 policy->l_inodebits.bits) !=
1132 policy->l_inodebits.bits))
1135 if (!unref && (lock->l_flags & LDLM_FL_GONE_MASK))
1138 if ((flags & LDLM_FL_LOCAL_ONLY) &&
1139 !(lock->l_flags & LDLM_FL_LOCAL))
1142 if (flags & LDLM_FL_TEST_LOCK) {
1143 LDLM_LOCK_GET(lock);
1144 ldlm_lock_touch_in_lru(lock);
1146 ldlm_lock_addref_internal_nolock(lock, match);
1155 void ldlm_lock_fail_match_locked(struct ldlm_lock *lock)
1157 if ((lock->l_flags & LDLM_FL_FAIL_NOTIFIED) == 0) {
1158 lock->l_flags |= LDLM_FL_FAIL_NOTIFIED;
1159 wake_up_all(&lock->l_waitq);
1162 EXPORT_SYMBOL(ldlm_lock_fail_match_locked);
1164 void ldlm_lock_fail_match(struct ldlm_lock *lock)
1166 lock_res_and_lock(lock);
1167 ldlm_lock_fail_match_locked(lock);
1168 unlock_res_and_lock(lock);
1170 EXPORT_SYMBOL(ldlm_lock_fail_match);
1173 * Mark lock as "matchable" by OST.
1175 * Used to prevent certain races in LOV/OSC where the lock is granted, but LVB
1177 * Assumes LDLM lock is already locked.
1179 void ldlm_lock_allow_match_locked(struct ldlm_lock *lock)
1181 lock->l_flags |= LDLM_FL_LVB_READY;
1182 wake_up_all(&lock->l_waitq);
1184 EXPORT_SYMBOL(ldlm_lock_allow_match_locked);
1187 * Mark lock as "matchable" by OST.
1188 * Locks the lock and then \see ldlm_lock_allow_match_locked
1190 void ldlm_lock_allow_match(struct ldlm_lock *lock)
1192 lock_res_and_lock(lock);
1193 ldlm_lock_allow_match_locked(lock);
1194 unlock_res_and_lock(lock);
1196 EXPORT_SYMBOL(ldlm_lock_allow_match);
1199 * Attempt to find a lock with specified properties.
1201 * Typically returns a reference to matched lock unless LDLM_FL_TEST_LOCK is
1204 * Can be called in two ways:
1206 * If 'ns' is NULL, then lockh describes an existing lock that we want to look
1207 * for a duplicate of.
1209 * Otherwise, all of the fields must be filled in, to match against.
1211 * If 'flags' contains LDLM_FL_LOCAL_ONLY, then only match local locks on the
1212 * server (ie, connh is NULL)
1213 * If 'flags' contains LDLM_FL_BLOCK_GRANTED, then only locks on the granted
1214 * list will be considered
1215 * If 'flags' contains LDLM_FL_CBPENDING, then locks that have been marked
1216 * to be canceled can still be matched as long as they still have reader
1217 * or writer referneces
1218 * If 'flags' contains LDLM_FL_TEST_LOCK, then don't actually reference a lock,
1219 * just tell us if we would have matched.
1221 * \retval 1 if it finds an already-existing lock that is compatible; in this
1222 * case, lockh is filled in with a addref()ed lock
1224 * We also check security context, and if that fails we simply return 0 (to
1225 * keep caller code unchanged), the context failure will be discovered by
1226 * caller sometime later.
1228 ldlm_mode_t ldlm_lock_match(struct ldlm_namespace *ns, __u64 flags,
1229 const struct ldlm_res_id *res_id, ldlm_type_t type,
1230 ldlm_policy_data_t *policy, ldlm_mode_t mode,
1231 struct lustre_handle *lockh, int unref)
1233 struct ldlm_resource *res;
1234 struct ldlm_lock *lock, *old_lock = NULL;
1238 old_lock = ldlm_handle2lock(lockh);
1241 ns = ldlm_lock_to_ns(old_lock);
1242 res_id = &old_lock->l_resource->lr_name;
1243 type = old_lock->l_resource->lr_type;
1244 mode = old_lock->l_req_mode;
1247 res = ldlm_resource_get(ns, NULL, res_id, type, 0);
1249 LASSERT(old_lock == NULL);
1253 LDLM_RESOURCE_ADDREF(res);
1256 lock = search_queue(&res->lr_granted, &mode, policy, old_lock,
1262 if (flags & LDLM_FL_BLOCK_GRANTED) {
1266 lock = search_queue(&res->lr_converting, &mode, policy, old_lock,
1272 lock = search_queue(&res->lr_waiting, &mode, policy, old_lock,
1281 LDLM_RESOURCE_DELREF(res);
1282 ldlm_resource_putref(res);
1285 ldlm_lock2handle(lock, lockh);
1286 if ((flags & LDLM_FL_LVB_READY) &&
1287 (!(lock->l_flags & LDLM_FL_LVB_READY))) {
1288 __u64 wait_flags = LDLM_FL_LVB_READY |
1289 LDLM_FL_DESTROYED | LDLM_FL_FAIL_NOTIFIED;
1290 struct l_wait_info lwi;
1292 if (lock->l_completion_ast) {
1293 int err = lock->l_completion_ast(lock,
1294 LDLM_FL_WAIT_NOREPROC,
1297 if (flags & LDLM_FL_TEST_LOCK)
1298 LDLM_LOCK_RELEASE(lock);
1300 ldlm_lock_decref_internal(lock,
1307 lwi = LWI_TIMEOUT_INTR(cfs_time_seconds(obd_timeout),
1308 NULL, LWI_ON_SIGNAL_NOOP, NULL);
1310 /* XXX FIXME see comment on CAN_MATCH in lustre_dlm.h */
1311 l_wait_event(lock->l_waitq,
1312 lock->l_flags & wait_flags,
1314 if (!(lock->l_flags & LDLM_FL_LVB_READY)) {
1315 if (flags & LDLM_FL_TEST_LOCK)
1316 LDLM_LOCK_RELEASE(lock);
1318 ldlm_lock_decref_internal(lock, mode);
1325 LDLM_DEBUG(lock, "matched (%llu %llu)",
1326 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1327 res_id->name[2] : policy->l_extent.start,
1328 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1329 res_id->name[3] : policy->l_extent.end);
1331 /* check user's security context */
1332 if (lock->l_conn_export &&
1333 sptlrpc_import_check_ctx(
1334 class_exp2cliimp(lock->l_conn_export))) {
1335 if (!(flags & LDLM_FL_TEST_LOCK))
1336 ldlm_lock_decref_internal(lock, mode);
1340 if (flags & LDLM_FL_TEST_LOCK)
1341 LDLM_LOCK_RELEASE(lock);
1343 } else if (!(flags & LDLM_FL_TEST_LOCK)) {/*less verbose for test-only*/
1344 LDLM_DEBUG_NOLOCK("not matched ns %p type %u mode %u res %llu/%llu (%llu %llu)",
1345 ns, type, mode, res_id->name[0],
1347 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1348 res_id->name[2] :policy->l_extent.start,
1349 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1350 res_id->name[3] : policy->l_extent.end);
1353 LDLM_LOCK_PUT(old_lock);
1355 return rc ? mode : 0;
1357 EXPORT_SYMBOL(ldlm_lock_match);
1359 ldlm_mode_t ldlm_revalidate_lock_handle(struct lustre_handle *lockh,
1362 struct ldlm_lock *lock;
1363 ldlm_mode_t mode = 0;
1365 lock = ldlm_handle2lock(lockh);
1367 lock_res_and_lock(lock);
1368 if (lock->l_flags & LDLM_FL_GONE_MASK)
1371 if (lock->l_flags & LDLM_FL_CBPENDING &&
1372 lock->l_readers == 0 && lock->l_writers == 0)
1376 *bits = lock->l_policy_data.l_inodebits.bits;
1377 mode = lock->l_granted_mode;
1378 ldlm_lock_addref_internal_nolock(lock, mode);
1383 unlock_res_and_lock(lock);
1384 LDLM_LOCK_PUT(lock);
1388 EXPORT_SYMBOL(ldlm_revalidate_lock_handle);
1390 /** The caller must guarantee that the buffer is large enough. */
1391 int ldlm_fill_lvb(struct ldlm_lock *lock, struct req_capsule *pill,
1392 enum req_location loc, void *data, int size)
1396 LASSERT(data != NULL);
1399 switch (lock->l_lvb_type) {
1401 if (size == sizeof(struct ost_lvb)) {
1402 if (loc == RCL_CLIENT)
1403 lvb = req_capsule_client_swab_get(pill,
1405 lustre_swab_ost_lvb);
1407 lvb = req_capsule_server_swab_get(pill,
1409 lustre_swab_ost_lvb);
1410 if (unlikely(lvb == NULL)) {
1411 LDLM_ERROR(lock, "no LVB");
1415 memcpy(data, lvb, size);
1416 } else if (size == sizeof(struct ost_lvb_v1)) {
1417 struct ost_lvb *olvb = data;
1419 if (loc == RCL_CLIENT)
1420 lvb = req_capsule_client_swab_get(pill,
1422 lustre_swab_ost_lvb_v1);
1424 lvb = req_capsule_server_sized_swab_get(pill,
1426 lustre_swab_ost_lvb_v1);
1427 if (unlikely(lvb == NULL)) {
1428 LDLM_ERROR(lock, "no LVB");
1432 memcpy(data, lvb, size);
1433 olvb->lvb_mtime_ns = 0;
1434 olvb->lvb_atime_ns = 0;
1435 olvb->lvb_ctime_ns = 0;
1437 LDLM_ERROR(lock, "Replied unexpected ost LVB size %d",
1443 if (size == sizeof(struct lquota_lvb)) {
1444 if (loc == RCL_CLIENT)
1445 lvb = req_capsule_client_swab_get(pill,
1447 lustre_swab_lquota_lvb);
1449 lvb = req_capsule_server_swab_get(pill,
1451 lustre_swab_lquota_lvb);
1452 if (unlikely(lvb == NULL)) {
1453 LDLM_ERROR(lock, "no LVB");
1457 memcpy(data, lvb, size);
1460 "Replied unexpected lquota LVB size %d",
1469 if (loc == RCL_CLIENT)
1470 lvb = req_capsule_client_get(pill, &RMF_DLM_LVB);
1472 lvb = req_capsule_server_get(pill, &RMF_DLM_LVB);
1473 if (unlikely(lvb == NULL)) {
1474 LDLM_ERROR(lock, "no LVB");
1478 memcpy(data, lvb, size);
1481 LDLM_ERROR(lock, "Unknown LVB type: %d\n", lock->l_lvb_type);
1490 * Create and fill in new LDLM lock with specified properties.
1491 * Returns a referenced lock
1493 struct ldlm_lock *ldlm_lock_create(struct ldlm_namespace *ns,
1494 const struct ldlm_res_id *res_id,
1497 const struct ldlm_callback_suite *cbs,
1498 void *data, __u32 lvb_len,
1499 enum lvb_type lvb_type)
1501 struct ldlm_lock *lock;
1502 struct ldlm_resource *res;
1504 res = ldlm_resource_get(ns, NULL, res_id, type, 1);
1508 lock = ldlm_lock_new(res);
1513 lock->l_req_mode = mode;
1514 lock->l_ast_data = data;
1515 lock->l_pid = current_pid();
1516 if (ns_is_server(ns))
1517 lock->l_flags |= LDLM_FL_NS_SRV;
1519 lock->l_blocking_ast = cbs->lcs_blocking;
1520 lock->l_completion_ast = cbs->lcs_completion;
1521 lock->l_glimpse_ast = cbs->lcs_glimpse;
1524 lock->l_tree_node = NULL;
1525 /* if this is the extent lock, allocate the interval tree node */
1526 if (type == LDLM_EXTENT) {
1527 if (ldlm_interval_alloc(lock) == NULL)
1532 lock->l_lvb_len = lvb_len;
1533 OBD_ALLOC(lock->l_lvb_data, lvb_len);
1534 if (lock->l_lvb_data == NULL)
1538 lock->l_lvb_type = lvb_type;
1539 if (OBD_FAIL_CHECK(OBD_FAIL_LDLM_NEW_LOCK))
1545 ldlm_lock_destroy(lock);
1546 LDLM_LOCK_RELEASE(lock);
1551 * Enqueue (request) a lock.
1553 * Does not block. As a result of enqueue the lock would be put
1554 * into granted or waiting list.
1556 * If namespace has intent policy sent and the lock has LDLM_FL_HAS_INTENT flag
1557 * set, skip all the enqueueing and delegate lock processing to intent policy
1560 ldlm_error_t ldlm_lock_enqueue(struct ldlm_namespace *ns,
1561 struct ldlm_lock **lockp,
1562 void *cookie, __u64 *flags)
1564 struct ldlm_lock *lock = *lockp;
1565 struct ldlm_resource *res = lock->l_resource;
1566 int local = ns_is_client(ldlm_res_to_ns(res));
1567 ldlm_error_t rc = ELDLM_OK;
1568 struct ldlm_interval *node = NULL;
1570 lock->l_last_activity = get_seconds();
1571 /* policies are not executed on the client or during replay */
1572 if ((*flags & (LDLM_FL_HAS_INTENT|LDLM_FL_REPLAY)) == LDLM_FL_HAS_INTENT
1573 && !local && ns->ns_policy) {
1574 rc = ns->ns_policy(ns, lockp, cookie, lock->l_req_mode, *flags,
1576 if (rc == ELDLM_LOCK_REPLACED) {
1577 /* The lock that was returned has already been granted,
1578 * and placed into lockp. If it's not the same as the
1579 * one we passed in, then destroy the old one and our
1580 * work here is done. */
1581 if (lock != *lockp) {
1582 ldlm_lock_destroy(lock);
1583 LDLM_LOCK_RELEASE(lock);
1585 *flags |= LDLM_FL_LOCK_CHANGED;
1587 } else if (rc != ELDLM_OK ||
1588 (rc == ELDLM_OK && (*flags & LDLM_FL_INTENT_ONLY))) {
1589 ldlm_lock_destroy(lock);
1594 /* For a replaying lock, it might be already in granted list. So
1595 * unlinking the lock will cause the interval node to be freed, we
1596 * have to allocate the interval node early otherwise we can't regrant
1597 * this lock in the future. - jay */
1598 if (!local && (*flags & LDLM_FL_REPLAY) && res->lr_type == LDLM_EXTENT)
1599 OBD_SLAB_ALLOC_PTR_GFP(node, ldlm_interval_slab, GFP_NOFS);
1601 lock_res_and_lock(lock);
1602 if (local && lock->l_req_mode == lock->l_granted_mode) {
1603 /* The server returned a blocked lock, but it was granted
1604 * before we got a chance to actually enqueue it. We don't
1605 * need to do anything else. */
1606 *flags &= ~(LDLM_FL_BLOCK_GRANTED |
1607 LDLM_FL_BLOCK_CONV | LDLM_FL_BLOCK_WAIT);
1611 ldlm_resource_unlink_lock(lock);
1612 if (res->lr_type == LDLM_EXTENT && lock->l_tree_node == NULL) {
1614 ldlm_lock_destroy_nolock(lock);
1619 INIT_LIST_HEAD(&node->li_group);
1620 ldlm_interval_attach(node, lock);
1624 /* Some flags from the enqueue want to make it into the AST, via the
1625 * lock's l_flags. */
1626 lock->l_flags |= *flags & LDLM_FL_AST_DISCARD_DATA;
1628 /* This distinction between local lock trees is very important; a client
1629 * namespace only has information about locks taken by that client, and
1630 * thus doesn't have enough information to decide for itself if it can
1631 * be granted (below). In this case, we do exactly what the server
1632 * tells us to do, as dictated by the 'flags'.
1634 * We do exactly the same thing during recovery, when the server is
1635 * more or less trusting the clients not to lie.
1637 * FIXME (bug 268): Detect obvious lies by checking compatibility in
1638 * granted/converting queues. */
1640 if (*flags & LDLM_FL_BLOCK_CONV)
1641 ldlm_resource_add_lock(res, &res->lr_converting, lock);
1642 else if (*flags & (LDLM_FL_BLOCK_WAIT | LDLM_FL_BLOCK_GRANTED))
1643 ldlm_resource_add_lock(res, &res->lr_waiting, lock);
1645 ldlm_grant_lock(lock, NULL);
1648 CERROR("This is client-side-only module, cannot handle LDLM_NAMESPACE_SERVER resource type lock.\n");
1653 unlock_res_and_lock(lock);
1655 OBD_SLAB_FREE(node, ldlm_interval_slab, sizeof(*node));
1661 * Process a call to blocking AST callback for a lock in ast_work list
1664 ldlm_work_bl_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1666 struct ldlm_cb_set_arg *arg = opaq;
1667 struct ldlm_lock_desc d;
1669 struct ldlm_lock *lock;
1671 if (list_empty(arg->list))
1674 lock = list_entry(arg->list->next, struct ldlm_lock, l_bl_ast);
1676 /* nobody should touch l_bl_ast */
1677 lock_res_and_lock(lock);
1678 list_del_init(&lock->l_bl_ast);
1680 LASSERT(lock->l_flags & LDLM_FL_AST_SENT);
1681 LASSERT(lock->l_bl_ast_run == 0);
1682 LASSERT(lock->l_blocking_lock);
1683 lock->l_bl_ast_run++;
1684 unlock_res_and_lock(lock);
1686 ldlm_lock2desc(lock->l_blocking_lock, &d);
1688 rc = lock->l_blocking_ast(lock, &d, (void *)arg, LDLM_CB_BLOCKING);
1689 LDLM_LOCK_RELEASE(lock->l_blocking_lock);
1690 lock->l_blocking_lock = NULL;
1691 LDLM_LOCK_RELEASE(lock);
1697 * Process a call to completion AST callback for a lock in ast_work list
1700 ldlm_work_cp_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1702 struct ldlm_cb_set_arg *arg = opaq;
1704 struct ldlm_lock *lock;
1705 ldlm_completion_callback completion_callback;
1707 if (list_empty(arg->list))
1710 lock = list_entry(arg->list->next, struct ldlm_lock, l_cp_ast);
1712 /* It's possible to receive a completion AST before we've set
1713 * the l_completion_ast pointer: either because the AST arrived
1714 * before the reply, or simply because there's a small race
1715 * window between receiving the reply and finishing the local
1716 * enqueue. (bug 842)
1718 * This can't happen with the blocking_ast, however, because we
1719 * will never call the local blocking_ast until we drop our
1720 * reader/writer reference, which we won't do until we get the
1721 * reply and finish enqueueing. */
1723 /* nobody should touch l_cp_ast */
1724 lock_res_and_lock(lock);
1725 list_del_init(&lock->l_cp_ast);
1726 LASSERT(lock->l_flags & LDLM_FL_CP_REQD);
1727 /* save l_completion_ast since it can be changed by
1728 * mds_intent_policy(), see bug 14225 */
1729 completion_callback = lock->l_completion_ast;
1730 lock->l_flags &= ~LDLM_FL_CP_REQD;
1731 unlock_res_and_lock(lock);
1733 if (completion_callback != NULL)
1734 rc = completion_callback(lock, 0, (void *)arg);
1735 LDLM_LOCK_RELEASE(lock);
1741 * Process a call to revocation AST callback for a lock in ast_work list
1744 ldlm_work_revoke_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1746 struct ldlm_cb_set_arg *arg = opaq;
1747 struct ldlm_lock_desc desc;
1749 struct ldlm_lock *lock;
1751 if (list_empty(arg->list))
1754 lock = list_entry(arg->list->next, struct ldlm_lock, l_rk_ast);
1755 list_del_init(&lock->l_rk_ast);
1757 /* the desc just pretend to exclusive */
1758 ldlm_lock2desc(lock, &desc);
1759 desc.l_req_mode = LCK_EX;
1760 desc.l_granted_mode = 0;
1762 rc = lock->l_blocking_ast(lock, &desc, (void *)arg, LDLM_CB_BLOCKING);
1763 LDLM_LOCK_RELEASE(lock);
1769 * Process a call to glimpse AST callback for a lock in ast_work list
1771 int ldlm_work_gl_ast_lock(struct ptlrpc_request_set *rqset, void *opaq)
1773 struct ldlm_cb_set_arg *arg = opaq;
1774 struct ldlm_glimpse_work *gl_work;
1775 struct ldlm_lock *lock;
1778 if (list_empty(arg->list))
1781 gl_work = list_entry(arg->list->next, struct ldlm_glimpse_work,
1783 list_del_init(&gl_work->gl_list);
1785 lock = gl_work->gl_lock;
1787 /* transfer the glimpse descriptor to ldlm_cb_set_arg */
1788 arg->gl_desc = gl_work->gl_desc;
1790 /* invoke the actual glimpse callback */
1791 if (lock->l_glimpse_ast(lock, (void *)arg) == 0)
1794 LDLM_LOCK_RELEASE(lock);
1796 if ((gl_work->gl_flags & LDLM_GL_WORK_NOFREE) == 0)
1797 OBD_FREE_PTR(gl_work);
1803 * Process list of locks in need of ASTs being sent.
1805 * Used on server to send multiple ASTs together instead of sending one by
1808 int ldlm_run_ast_work(struct ldlm_namespace *ns, struct list_head *rpc_list,
1809 ldlm_desc_ast_t ast_type)
1811 struct ldlm_cb_set_arg *arg;
1812 set_producer_func work_ast_lock;
1815 if (list_empty(rpc_list))
1822 atomic_set(&arg->restart, 0);
1823 arg->list = rpc_list;
1826 case LDLM_WORK_BL_AST:
1827 arg->type = LDLM_BL_CALLBACK;
1828 work_ast_lock = ldlm_work_bl_ast_lock;
1830 case LDLM_WORK_CP_AST:
1831 arg->type = LDLM_CP_CALLBACK;
1832 work_ast_lock = ldlm_work_cp_ast_lock;
1834 case LDLM_WORK_REVOKE_AST:
1835 arg->type = LDLM_BL_CALLBACK;
1836 work_ast_lock = ldlm_work_revoke_ast_lock;
1838 case LDLM_WORK_GL_AST:
1839 arg->type = LDLM_GL_CALLBACK;
1840 work_ast_lock = ldlm_work_gl_ast_lock;
1846 /* We create a ptlrpc request set with flow control extension.
1847 * This request set will use the work_ast_lock function to produce new
1848 * requests and will send a new request each time one completes in order
1849 * to keep the number of requests in flight to ns_max_parallel_ast */
1850 arg->set = ptlrpc_prep_fcset(ns->ns_max_parallel_ast ? : UINT_MAX,
1851 work_ast_lock, arg);
1852 if (arg->set == NULL) {
1857 ptlrpc_set_wait(arg->set);
1858 ptlrpc_set_destroy(arg->set);
1860 rc = atomic_read(&arg->restart) ? -ERESTART : 0;
1867 static int reprocess_one_queue(struct ldlm_resource *res, void *closure)
1869 ldlm_reprocess_all(res);
1870 return LDLM_ITER_CONTINUE;
1873 static int ldlm_reprocess_res(struct cfs_hash *hs, struct cfs_hash_bd *bd,
1874 struct hlist_node *hnode, void *arg)
1876 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
1879 rc = reprocess_one_queue(res, arg);
1881 return rc == LDLM_ITER_STOP;
1885 * Iterate through all resources on a namespace attempting to grant waiting
1888 void ldlm_reprocess_all_ns(struct ldlm_namespace *ns)
1891 cfs_hash_for_each_nolock(ns->ns_rs_hash,
1892 ldlm_reprocess_res, NULL);
1895 EXPORT_SYMBOL(ldlm_reprocess_all_ns);
1898 * Try to grant all waiting locks on a resource.
1900 * Calls ldlm_reprocess_queue on converting and waiting queues.
1902 * Typically called after some resource locks are cancelled to see
1903 * if anything could be granted as a result of the cancellation.
1905 void ldlm_reprocess_all(struct ldlm_resource *res)
1907 LIST_HEAD(rpc_list);
1909 if (!ns_is_client(ldlm_res_to_ns(res))) {
1910 CERROR("This is client-side-only module, cannot handle LDLM_NAMESPACE_SERVER resource type lock.\n");
1916 * Helper function to call blocking AST for LDLM lock \a lock in a
1917 * "cancelling" mode.
1919 void ldlm_cancel_callback(struct ldlm_lock *lock)
1921 check_res_locked(lock->l_resource);
1922 if (!(lock->l_flags & LDLM_FL_CANCEL)) {
1923 lock->l_flags |= LDLM_FL_CANCEL;
1924 if (lock->l_blocking_ast) {
1925 unlock_res_and_lock(lock);
1926 lock->l_blocking_ast(lock, NULL, lock->l_ast_data,
1928 lock_res_and_lock(lock);
1930 LDLM_DEBUG(lock, "no blocking ast");
1933 lock->l_flags |= LDLM_FL_BL_DONE;
1937 * Remove skiplist-enabled LDLM lock \a req from granted list
1939 void ldlm_unlink_lock_skiplist(struct ldlm_lock *req)
1941 if (req->l_resource->lr_type != LDLM_PLAIN &&
1942 req->l_resource->lr_type != LDLM_IBITS)
1945 list_del_init(&req->l_sl_policy);
1946 list_del_init(&req->l_sl_mode);
1950 * Attempts to cancel LDLM lock \a lock that has no reader/writer references.
1952 void ldlm_lock_cancel(struct ldlm_lock *lock)
1954 struct ldlm_resource *res;
1955 struct ldlm_namespace *ns;
1957 lock_res_and_lock(lock);
1959 res = lock->l_resource;
1960 ns = ldlm_res_to_ns(res);
1962 /* Please do not, no matter how tempting, remove this LBUG without
1963 * talking to me first. -phik */
1964 if (lock->l_readers || lock->l_writers) {
1965 LDLM_ERROR(lock, "lock still has references");
1969 if (lock->l_flags & LDLM_FL_WAITED)
1970 ldlm_del_waiting_lock(lock);
1972 /* Releases cancel callback. */
1973 ldlm_cancel_callback(lock);
1975 /* Yes, second time, just in case it was added again while we were
1976 * running with no res lock in ldlm_cancel_callback */
1977 if (lock->l_flags & LDLM_FL_WAITED)
1978 ldlm_del_waiting_lock(lock);
1980 ldlm_resource_unlink_lock(lock);
1981 ldlm_lock_destroy_nolock(lock);
1983 if (lock->l_granted_mode == lock->l_req_mode)
1984 ldlm_pool_del(&ns->ns_pool, lock);
1986 /* Make sure we will not be called again for same lock what is possible
1987 * if not to zero out lock->l_granted_mode */
1988 lock->l_granted_mode = LCK_MINMODE;
1989 unlock_res_and_lock(lock);
1991 EXPORT_SYMBOL(ldlm_lock_cancel);
1994 * Set opaque data into the lock that only makes sense to upper layer.
1996 int ldlm_lock_set_data(struct lustre_handle *lockh, void *data)
1998 struct ldlm_lock *lock = ldlm_handle2lock(lockh);
2002 if (lock->l_ast_data == NULL)
2003 lock->l_ast_data = data;
2004 if (lock->l_ast_data == data)
2006 LDLM_LOCK_PUT(lock);
2010 EXPORT_SYMBOL(ldlm_lock_set_data);
2012 struct export_cl_data {
2013 struct obd_export *ecl_exp;
2018 * Iterator function for ldlm_cancel_locks_for_export.
2019 * Cancels passed locks.
2021 int ldlm_cancel_locks_for_export_cb(struct cfs_hash *hs, struct cfs_hash_bd *bd,
2022 struct hlist_node *hnode, void *data)
2025 struct export_cl_data *ecl = (struct export_cl_data *)data;
2026 struct obd_export *exp = ecl->ecl_exp;
2027 struct ldlm_lock *lock = cfs_hash_object(hs, hnode);
2028 struct ldlm_resource *res;
2030 res = ldlm_resource_getref(lock->l_resource);
2031 LDLM_LOCK_GET(lock);
2033 LDLM_DEBUG(lock, "export %p", exp);
2034 ldlm_res_lvbo_update(res, NULL, 1);
2035 ldlm_lock_cancel(lock);
2036 ldlm_reprocess_all(res);
2037 ldlm_resource_putref(res);
2038 LDLM_LOCK_RELEASE(lock);
2041 if ((ecl->ecl_loop & -ecl->ecl_loop) == ecl->ecl_loop) {
2043 "Cancel lock %p for export %p (loop %d), still have %d locks left on hash table.\n",
2044 lock, exp, ecl->ecl_loop,
2045 atomic_read(&hs->hs_count));
2052 * Cancel all locks for given export.
2054 * Typically called on client disconnection/eviction
2056 void ldlm_cancel_locks_for_export(struct obd_export *exp)
2058 struct export_cl_data ecl = {
2063 cfs_hash_for_each_empty(exp->exp_lock_hash,
2064 ldlm_cancel_locks_for_export_cb, &ecl);
2068 * Downgrade an exclusive lock.
2070 * A fast variant of ldlm_lock_convert for conversion of exclusive
2071 * locks. The conversion is always successful.
2072 * Used by Commit on Sharing (COS) code.
2074 * \param lock A lock to convert
2075 * \param new_mode new lock mode
2077 void ldlm_lock_downgrade(struct ldlm_lock *lock, int new_mode)
2079 LASSERT(lock->l_granted_mode & (LCK_PW | LCK_EX));
2080 LASSERT(new_mode == LCK_COS);
2082 lock_res_and_lock(lock);
2083 ldlm_resource_unlink_lock(lock);
2085 * Remove the lock from pool as it will be added again in
2086 * ldlm_grant_lock() called below.
2088 ldlm_pool_del(&ldlm_lock_to_ns(lock)->ns_pool, lock);
2090 lock->l_req_mode = new_mode;
2091 ldlm_grant_lock(lock, NULL);
2092 unlock_res_and_lock(lock);
2093 ldlm_reprocess_all(lock->l_resource);
2095 EXPORT_SYMBOL(ldlm_lock_downgrade);
2098 * Attempt to convert already granted lock to a different mode.
2100 * While lock conversion is not currently used, future client-side
2101 * optimizations could take advantage of it to avoid discarding cached
2104 struct ldlm_resource *ldlm_lock_convert(struct ldlm_lock *lock, int new_mode,
2107 LIST_HEAD(rpc_list);
2108 struct ldlm_resource *res;
2109 struct ldlm_namespace *ns;
2111 struct ldlm_interval *node;
2113 /* Just return if mode is unchanged. */
2114 if (new_mode == lock->l_granted_mode) {
2115 *flags |= LDLM_FL_BLOCK_GRANTED;
2116 return lock->l_resource;
2119 /* I can't check the type of lock here because the bitlock of lock
2120 * is not held here, so do the allocation blindly. -jay */
2121 OBD_SLAB_ALLOC_PTR_GFP(node, ldlm_interval_slab, GFP_NOFS);
2123 /* Actually, this causes EDEADLOCK to be returned */
2126 LASSERTF((new_mode == LCK_PW && lock->l_granted_mode == LCK_PR),
2127 "new_mode %u, granted %u\n", new_mode, lock->l_granted_mode);
2129 lock_res_and_lock(lock);
2131 res = lock->l_resource;
2132 ns = ldlm_res_to_ns(res);
2134 lock->l_req_mode = new_mode;
2135 if (res->lr_type == LDLM_PLAIN || res->lr_type == LDLM_IBITS) {
2136 ldlm_resource_unlink_lock(lock);
2138 ldlm_resource_unlink_lock(lock);
2139 if (res->lr_type == LDLM_EXTENT) {
2140 /* FIXME: ugly code, I have to attach the lock to a
2141 * interval node again since perhaps it will be granted
2143 INIT_LIST_HEAD(&node->li_group);
2144 ldlm_interval_attach(node, lock);
2150 * Remove old lock from the pool before adding the lock with new
2151 * mode below in ->policy()
2153 ldlm_pool_del(&ns->ns_pool, lock);
2155 /* If this is a local resource, put it on the appropriate list. */
2156 if (ns_is_client(ldlm_res_to_ns(res))) {
2157 if (*flags & (LDLM_FL_BLOCK_CONV | LDLM_FL_BLOCK_GRANTED)) {
2158 ldlm_resource_add_lock(res, &res->lr_converting, lock);
2160 /* This should never happen, because of the way the
2161 * server handles conversions. */
2162 LDLM_ERROR(lock, "Erroneous flags %x on local lock\n",
2166 ldlm_grant_lock(lock, &rpc_list);
2168 /* FIXME: completion handling not with lr_lock held ! */
2169 if (lock->l_completion_ast)
2170 lock->l_completion_ast(lock, 0, NULL);
2173 CERROR("This is client-side-only module, cannot handle LDLM_NAMESPACE_SERVER resource type lock.\n");
2176 unlock_res_and_lock(lock);
2179 ldlm_run_ast_work(ns, &rpc_list, LDLM_WORK_CP_AST);
2181 OBD_SLAB_FREE(node, ldlm_interval_slab, sizeof(*node));
2184 EXPORT_SYMBOL(ldlm_lock_convert);
2187 * Print lock with lock handle \a lockh description into debug log.
2189 * Used when printing all locks on a resource for debug purposes.
2191 void ldlm_lock_dump_handle(int level, struct lustre_handle *lockh)
2193 struct ldlm_lock *lock;
2195 if (!((libcfs_debug | D_ERROR) & level))
2198 lock = ldlm_handle2lock(lockh);
2202 LDLM_DEBUG_LIMIT(level, lock, "###");
2204 LDLM_LOCK_PUT(lock);
2206 EXPORT_SYMBOL(ldlm_lock_dump_handle);
2209 * Print lock information with custom message into debug log.
2212 void _ldlm_lock_debug(struct ldlm_lock *lock,
2213 struct libcfs_debug_msg_data *msgdata,
2214 const char *fmt, ...)
2217 struct obd_export *exp = lock->l_export;
2218 struct ldlm_resource *resource = lock->l_resource;
2219 char *nid = "local";
2221 va_start(args, fmt);
2223 if (exp && exp->exp_connection) {
2224 nid = libcfs_nid2str(exp->exp_connection->c_peer.nid);
2225 } else if (exp && exp->exp_obd != NULL) {
2226 struct obd_import *imp = exp->exp_obd->u.cli.cl_import;
2228 nid = libcfs_nid2str(imp->imp_connection->c_peer.nid);
2231 if (resource == NULL) {
2232 libcfs_debug_vmsg2(msgdata, fmt, args,
2233 " ns: \?\? lock: %p/%#llx lrc: %d/%d,%d mode: %s/%s res: \?\? rrc=\?\? type: \?\?\? flags: %#llx nid: %s remote: %#llx expref: %d pid: %u timeout: %lu lvb_type: %d\n",
2235 lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
2236 lock->l_readers, lock->l_writers,
2237 ldlm_lockname[lock->l_granted_mode],
2238 ldlm_lockname[lock->l_req_mode],
2239 lock->l_flags, nid, lock->l_remote_handle.cookie,
2240 exp ? atomic_read(&exp->exp_refcount) : -99,
2241 lock->l_pid, lock->l_callback_timeout, lock->l_lvb_type);
2246 switch (resource->lr_type) {
2248 libcfs_debug_vmsg2(msgdata, fmt, args,
2249 " ns: %s lock: %p/%#llx lrc: %d/%d,%d mode: %s/%s res: " DLDLMRES " rrc: %d type: %s [%llu->%llu] (req %llu->%llu) flags: %#llx nid: %s remote: %#llx expref: %d pid: %u timeout: %lu lvb_type: %d\n",
2250 ldlm_lock_to_ns_name(lock), lock,
2251 lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
2252 lock->l_readers, lock->l_writers,
2253 ldlm_lockname[lock->l_granted_mode],
2254 ldlm_lockname[lock->l_req_mode],
2256 atomic_read(&resource->lr_refcount),
2257 ldlm_typename[resource->lr_type],
2258 lock->l_policy_data.l_extent.start,
2259 lock->l_policy_data.l_extent.end,
2260 lock->l_req_extent.start, lock->l_req_extent.end,
2261 lock->l_flags, nid, lock->l_remote_handle.cookie,
2262 exp ? atomic_read(&exp->exp_refcount) : -99,
2263 lock->l_pid, lock->l_callback_timeout,
2268 libcfs_debug_vmsg2(msgdata, fmt, args,
2269 " ns: %s lock: %p/%#llx lrc: %d/%d,%d mode: %s/%s res: " DLDLMRES " rrc: %d type: %s pid: %d [%llu->%llu] flags: %#llx nid: %s remote: %#llx expref: %d pid: %u timeout: %lu\n",
2270 ldlm_lock_to_ns_name(lock), lock,
2271 lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
2272 lock->l_readers, lock->l_writers,
2273 ldlm_lockname[lock->l_granted_mode],
2274 ldlm_lockname[lock->l_req_mode],
2276 atomic_read(&resource->lr_refcount),
2277 ldlm_typename[resource->lr_type],
2278 lock->l_policy_data.l_flock.pid,
2279 lock->l_policy_data.l_flock.start,
2280 lock->l_policy_data.l_flock.end,
2281 lock->l_flags, nid, lock->l_remote_handle.cookie,
2282 exp ? atomic_read(&exp->exp_refcount) : -99,
2283 lock->l_pid, lock->l_callback_timeout);
2287 libcfs_debug_vmsg2(msgdata, fmt, args,
2288 " ns: %s lock: %p/%#llx lrc: %d/%d,%d mode: %s/%s res: " DLDLMRES " bits %#llx rrc: %d type: %s flags: %#llx nid: %s remote: %#llx expref: %d pid: %u timeout: %lu lvb_type: %d\n",
2289 ldlm_lock_to_ns_name(lock),
2290 lock, lock->l_handle.h_cookie,
2291 atomic_read(&lock->l_refc),
2292 lock->l_readers, lock->l_writers,
2293 ldlm_lockname[lock->l_granted_mode],
2294 ldlm_lockname[lock->l_req_mode],
2296 lock->l_policy_data.l_inodebits.bits,
2297 atomic_read(&resource->lr_refcount),
2298 ldlm_typename[resource->lr_type],
2299 lock->l_flags, nid, lock->l_remote_handle.cookie,
2300 exp ? atomic_read(&exp->exp_refcount) : -99,
2301 lock->l_pid, lock->l_callback_timeout,
2306 libcfs_debug_vmsg2(msgdata, fmt, args,
2307 " ns: %s lock: %p/%#llx lrc: %d/%d,%d mode: %s/%s res: " DLDLMRES " rrc: %d type: %s flags: %#llx nid: %s remote: %#llx expref: %d pid: %u timeout: %lu lvb_type: %d\n",
2308 ldlm_lock_to_ns_name(lock),
2309 lock, lock->l_handle.h_cookie,
2310 atomic_read(&lock->l_refc),
2311 lock->l_readers, lock->l_writers,
2312 ldlm_lockname[lock->l_granted_mode],
2313 ldlm_lockname[lock->l_req_mode],
2315 atomic_read(&resource->lr_refcount),
2316 ldlm_typename[resource->lr_type],
2317 lock->l_flags, nid, lock->l_remote_handle.cookie,
2318 exp ? atomic_read(&exp->exp_refcount) : -99,
2319 lock->l_pid, lock->l_callback_timeout,
2325 EXPORT_SYMBOL(_ldlm_lock_debug);