1 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
2 * vim:expandtab:shiftwidth=8:tabstop=8:
4 * Copyright (c) 2002, 2003 Cluster File Systems, Inc.
5 * Author: Peter Braam <braam@clusterfs.com>
6 * Author: Phil Schwan <phil@clusterfs.com>
8 * This file is part of the Lustre file system, http://www.lustre.org
9 * Lustre is a trademark of Cluster File Systems, Inc.
11 * You may have signed or agreed to another license before downloading
12 * this software. If so, you are bound by the terms and conditions
13 * of that agreement, and the following does not apply to you. See the
14 * LICENSE file included with this distribution for more information.
16 * If you did not agree to a different license, then this copy of Lustre
17 * is open source software; you can redistribute it and/or modify it
18 * under the terms of version 2 of the GNU General Public License as
19 * published by the Free Software Foundation.
21 * In either case, Lustre is distributed in the hope that it will be
22 * useful, but WITHOUT ANY WARRANTY; without even the implied warranty
23 * of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
24 * license text for more details.
27 #define DEBUG_SUBSYSTEM S_LDLM
30 # include <libcfs/libcfs.h>
31 # include <linux/lustre_intent.h>
33 # include <liblustre.h>
34 # include <libcfs/kp30.h>
37 #include <obd_class.h>
38 #include "ldlm_internal.h"
40 //struct lustre_lock ldlm_everything_lock;
42 /* lock's skip list pointers fix mode */
43 #define LDLM_JOIN_NONE 0
44 #define LDLM_MODE_JOIN_RIGHT 1
45 #define LDLM_MODE_JOIN_LEFT (1 << 1)
46 #define LDLM_POLICY_JOIN_RIGHT (1 << 2)
47 #define LDLM_POLICY_JOIN_LEFT (1 << 3)
50 char *ldlm_lockname[] = {
61 char *ldlm_typename[] = {
68 char *ldlm_it2str(int it)
75 case (IT_OPEN | IT_CREAT):
88 CERROR("Unknown intent %d\n", it);
93 extern cfs_mem_cache_t *ldlm_lock_slab;
95 static ldlm_processing_policy ldlm_processing_policy_table[] = {
96 [LDLM_PLAIN] ldlm_process_plain_lock,
97 [LDLM_EXTENT] ldlm_process_extent_lock,
99 [LDLM_FLOCK] ldlm_process_flock_lock,
101 [LDLM_IBITS] ldlm_process_inodebits_lock,
104 ldlm_processing_policy ldlm_get_processing_policy(struct ldlm_resource *res)
106 return ldlm_processing_policy_table[res->lr_type];
109 void ldlm_register_intent(struct ldlm_namespace *ns, ldlm_res_policy arg)
115 * REFCOUNTED LOCK OBJECTS
120 * Lock refcounts, during creation:
121 * - one special one for allocation, dec'd only once in destroy
122 * - one for being a lock that's in-use
123 * - one for the addref associated with a new lock
125 struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock)
127 atomic_inc(&lock->l_refc);
131 static void ldlm_lock_free(struct ldlm_lock *lock, size_t size)
133 LASSERT(size == sizeof(*lock));
134 OBD_SLAB_FREE(lock, ldlm_lock_slab, sizeof(*lock));
137 void ldlm_lock_put(struct ldlm_lock *lock)
141 LASSERT(lock->l_resource != LP_POISON);
142 LASSERT(atomic_read(&lock->l_refc) > 0);
143 if (atomic_dec_and_test(&lock->l_refc)) {
144 struct ldlm_resource *res;
146 LDLM_DEBUG(lock, "final lock_put on destroyed lock, freeing it.");
148 res = lock->l_resource;
149 LASSERT(lock->l_destroyed);
150 LASSERT(list_empty(&lock->l_res_link));
151 LASSERT(list_empty(&lock->l_pending_chain));
153 atomic_dec(&res->lr_namespace->ns_locks);
154 ldlm_resource_putref(res);
155 lock->l_resource = NULL;
156 if (lock->l_export) {
157 class_export_put(lock->l_export);
158 lock->l_export = NULL;
161 if (lock->l_lvb_data != NULL)
162 OBD_FREE(lock->l_lvb_data, lock->l_lvb_len);
164 OBD_FREE_RCU_CB(lock, sizeof(*lock), &lock->l_handle,
171 int ldlm_lock_remove_from_lru_nolock(struct ldlm_lock *lock)
174 if (!list_empty(&lock->l_lru)) {
175 struct ldlm_namespace *ns = lock->l_resource->lr_namespace;
176 LASSERT(lock->l_resource->lr_type != LDLM_FLOCK);
177 list_del_init(&lock->l_lru);
179 LASSERT(ns->ns_nr_unused >= 0);
185 int ldlm_lock_remove_from_lru(struct ldlm_lock *lock)
187 struct ldlm_namespace *ns = lock->l_resource->lr_namespace;
190 spin_lock(&ns->ns_unused_lock);
191 rc = ldlm_lock_remove_from_lru_nolock(lock);
192 spin_unlock(&ns->ns_unused_lock);
197 void ldlm_lock_add_to_lru_nolock(struct ldlm_lock *lock)
199 struct ldlm_namespace *ns = lock->l_resource->lr_namespace;
200 lock->l_last_used = cfs_time_current();
201 LASSERT(list_empty(&lock->l_lru));
202 list_add_tail(&lock->l_lru, &ns->ns_unused_list);
203 LASSERT(ns->ns_nr_unused >= 0);
207 void ldlm_lock_add_to_lru(struct ldlm_lock *lock)
209 struct ldlm_namespace *ns = lock->l_resource->lr_namespace;
211 spin_lock(&ns->ns_unused_lock);
212 ldlm_lock_add_to_lru_nolock(lock);
213 spin_unlock(&ns->ns_unused_lock);
217 void ldlm_lock_touch_in_lru(struct ldlm_lock *lock)
219 struct ldlm_namespace *ns = lock->l_resource->lr_namespace;
221 spin_lock(&ns->ns_unused_lock);
222 if (!list_empty(&lock->l_lru)) {
223 ldlm_lock_remove_from_lru_nolock(lock);
224 ldlm_lock_add_to_lru_nolock(lock);
226 spin_unlock(&ns->ns_unused_lock);
230 /* This used to have a 'strict' flag, which recovery would use to mark an
231 * in-use lock as needing-to-die. Lest I am ever tempted to put it back, I
232 * shall explain why it's gone: with the new hash table scheme, once you call
233 * ldlm_lock_destroy, you can never drop your final references on this lock.
234 * Because it's not in the hash table anymore. -phil */
235 int ldlm_lock_destroy_internal(struct ldlm_lock *lock)
239 if (lock->l_readers || lock->l_writers) {
240 LDLM_ERROR(lock, "lock still has references");
241 ldlm_lock_dump(D_ERROR, lock, 0);
245 if (!list_empty(&lock->l_res_link)) {
246 LDLM_ERROR(lock, "lock still on resource");
247 ldlm_lock_dump(D_ERROR, lock, 0);
251 if (lock->l_destroyed) {
252 LASSERT(list_empty(&lock->l_lru));
256 lock->l_destroyed = 1;
259 spin_lock(&lock->l_export->exp_ldlm_data.led_lock);
260 list_del_init(&lock->l_export_chain);
262 spin_unlock(&lock->l_export->exp_ldlm_data.led_lock);
264 ldlm_lock_remove_from_lru(lock);
265 class_handle_unhash(&lock->l_handle);
268 /* Wake anyone waiting for this lock */
269 /* FIXME: I should probably add yet another flag, instead of using
270 * l_export to only call this on clients */
272 class_export_put(lock->l_export);
273 lock->l_export = NULL;
274 if (lock->l_export && lock->l_completion_ast)
275 lock->l_completion_ast(lock, 0);
281 void ldlm_lock_destroy(struct ldlm_lock *lock)
285 lock_res_and_lock(lock);
286 first = ldlm_lock_destroy_internal(lock);
287 unlock_res_and_lock(lock);
289 /* drop reference from hashtable only for first destroy */
295 void ldlm_lock_destroy_nolock(struct ldlm_lock *lock)
299 first = ldlm_lock_destroy_internal(lock);
300 /* drop reference from hashtable only for first destroy */
306 /* this is called by portals_handle2object with the handle lock taken */
307 static void lock_handle_addref(void *lock)
309 LDLM_LOCK_GET((struct ldlm_lock *)lock);
313 * usage: pass in a resource on which you have done ldlm_resource_get
314 * pass in a parent lock on which you have done a ldlm_lock_get
315 * after return, ldlm_*_put the resource and parent
316 * returns: lock with refcount 2 - one for current caller and one for remote
318 static struct ldlm_lock *ldlm_lock_new(struct ldlm_resource *resource)
320 struct ldlm_lock *lock;
323 if (resource == NULL)
326 OBD_SLAB_ALLOC(lock, ldlm_lock_slab, CFS_ALLOC_IO, sizeof(*lock));
330 spin_lock_init(&lock->l_lock);
331 lock->l_resource = ldlm_resource_getref(resource);
333 atomic_set(&lock->l_refc, 2);
334 CFS_INIT_LIST_HEAD(&lock->l_res_link);
335 CFS_INIT_LIST_HEAD(&lock->l_lru);
336 CFS_INIT_LIST_HEAD(&lock->l_export_chain);
337 CFS_INIT_LIST_HEAD(&lock->l_pending_chain);
338 CFS_INIT_LIST_HEAD(&lock->l_bl_ast);
339 CFS_INIT_LIST_HEAD(&lock->l_cp_ast);
340 cfs_waitq_init(&lock->l_waitq);
341 lock->l_blocking_lock = NULL;
342 lock->l_sl_mode.prev = NULL;
343 lock->l_sl_mode.next = NULL;
344 lock->l_sl_policy.prev = NULL;
345 lock->l_sl_policy.next = NULL;
347 atomic_inc(&resource->lr_namespace->ns_locks);
348 CFS_INIT_LIST_HEAD(&lock->l_handle.h_link);
349 class_handle_hash(&lock->l_handle, lock_handle_addref);
351 CFS_INIT_LIST_HEAD(&lock->l_extents_list);
352 spin_lock_init(&lock->l_extents_list_lock);
353 CFS_INIT_LIST_HEAD(&lock->l_cache_locks_list);
358 int ldlm_lock_change_resource(struct ldlm_namespace *ns, struct ldlm_lock *lock,
359 struct ldlm_res_id new_resid)
361 struct ldlm_resource *oldres = lock->l_resource;
362 struct ldlm_resource *newres;
366 LASSERT(ns_is_client(ns));
368 lock_res_and_lock(lock);
369 if (memcmp(&new_resid, &lock->l_resource->lr_name,
370 sizeof(lock->l_resource->lr_name)) == 0) {
372 unlock_res_and_lock(lock);
376 LASSERT(new_resid.name[0] != 0);
378 /* This function assumes that the lock isn't on any lists */
379 LASSERT(list_empty(&lock->l_res_link));
381 type = oldres->lr_type;
382 unlock_res_and_lock(lock);
384 newres = ldlm_resource_get(ns, NULL, new_resid, type, 1);
385 if (newres == NULL) {
390 lock_res_and_lock(lock);
391 LASSERT(memcmp(&new_resid, &lock->l_resource->lr_name,
392 sizeof(lock->l_resource->lr_name)) != 0);
394 lock->l_resource = newres;
396 unlock_res_and_lock(lock);
398 /* ...and the flowers are still standing! */
399 ldlm_resource_putref(oldres);
408 void ldlm_lock2handle(struct ldlm_lock *lock, struct lustre_handle *lockh)
410 lockh->cookie = lock->l_handle.h_cookie;
413 /* if flags: atomically get the lock and set the flags.
414 * Return NULL if flag already set
417 struct ldlm_lock *__ldlm_handle2lock(struct lustre_handle *handle, int flags)
419 struct ldlm_namespace *ns;
420 struct ldlm_lock *lock = NULL, *retval = NULL;
425 lock = class_handle2object(handle->cookie);
429 LASSERT(lock->l_resource != NULL);
430 ns = lock->l_resource->lr_namespace;
433 lock_res_and_lock(lock);
435 /* It's unlikely but possible that someone marked the lock as
436 * destroyed after we did handle2object on it */
437 if (lock->l_destroyed) {
438 unlock_res_and_lock(lock);
439 CDEBUG(D_INFO, "lock already destroyed: lock %p\n", lock);
444 if (flags && (lock->l_flags & flags)) {
445 unlock_res_and_lock(lock);
451 lock->l_flags |= flags;
453 unlock_res_and_lock(lock);
460 struct ldlm_lock *ldlm_handle2lock_ns(struct ldlm_namespace *ns,
461 struct lustre_handle *handle)
463 struct ldlm_lock *retval = NULL;
464 retval = __ldlm_handle2lock(handle, 0);
468 void ldlm_lock2desc(struct ldlm_lock *lock, struct ldlm_lock_desc *desc)
470 struct obd_export *exp = lock->l_export?:lock->l_conn_export;
471 /* INODEBITS_INTEROP: If the other side does not support
472 * inodebits, reply with a plain lock descriptor.
474 if ((lock->l_resource->lr_type == LDLM_IBITS) &&
475 (exp && !(exp->exp_connect_flags & OBD_CONNECT_IBITS))) {
476 struct ldlm_resource res = *lock->l_resource;
478 /* Make sure all the right bits are set in this lock we
479 are going to pass to client */
480 LASSERTF(lock->l_policy_data.l_inodebits.bits ==
481 (MDS_INODELOCK_LOOKUP|MDS_INODELOCK_UPDATE),
482 "Inappropriate inode lock bits during "
483 "conversion " LPU64 "\n",
484 lock->l_policy_data.l_inodebits.bits);
485 res.lr_type = LDLM_PLAIN;
486 ldlm_res2desc(&res, &desc->l_resource);
487 /* Convert "new" lock mode to something old client can
489 if ((lock->l_req_mode == LCK_CR) ||
490 (lock->l_req_mode == LCK_CW))
491 desc->l_req_mode = LCK_PR;
493 desc->l_req_mode = lock->l_req_mode;
494 if ((lock->l_granted_mode == LCK_CR) ||
495 (lock->l_granted_mode == LCK_CW)) {
496 desc->l_granted_mode = LCK_PR;
498 /* We never grant PW/EX locks to clients */
499 LASSERT((lock->l_granted_mode != LCK_PW) &&
500 (lock->l_granted_mode != LCK_EX));
501 desc->l_granted_mode = lock->l_granted_mode;
504 /* We do not copy policy here, because there is no
505 policy for plain locks */
507 ldlm_res2desc(lock->l_resource, &desc->l_resource);
508 desc->l_req_mode = lock->l_req_mode;
509 desc->l_granted_mode = lock->l_granted_mode;
510 desc->l_policy_data = lock->l_policy_data;
514 void ldlm_add_bl_work_item(struct ldlm_lock *lock, struct ldlm_lock *new,
515 struct list_head *work_list)
517 if ((lock->l_flags & LDLM_FL_AST_SENT) == 0) {
518 LDLM_DEBUG(lock, "lock incompatible; sending blocking AST.");
519 lock->l_flags |= LDLM_FL_AST_SENT;
520 /* If the enqueuing client said so, tell the AST recipient to
521 * discard dirty data, rather than writing back. */
522 if (new->l_flags & LDLM_AST_DISCARD_DATA)
523 lock->l_flags |= LDLM_FL_DISCARD_DATA;
524 LASSERT(list_empty(&lock->l_bl_ast));
525 list_add(&lock->l_bl_ast, work_list);
527 LASSERT(lock->l_blocking_lock == NULL);
528 lock->l_blocking_lock = LDLM_LOCK_GET(new);
532 void ldlm_add_cp_work_item(struct ldlm_lock *lock, struct list_head *work_list)
534 if ((lock->l_flags & LDLM_FL_CP_REQD) == 0) {
535 lock->l_flags |= LDLM_FL_CP_REQD;
536 LDLM_DEBUG(lock, "lock granted; sending completion AST.");
537 LASSERT(list_empty(&lock->l_cp_ast));
538 list_add(&lock->l_cp_ast, work_list);
543 /* must be called with lr_lock held */
544 void ldlm_add_ast_work_item(struct ldlm_lock *lock, struct ldlm_lock *new,
545 struct list_head *work_list)
548 check_res_locked(lock->l_resource);
550 ldlm_add_bl_work_item(lock, new, work_list);
552 ldlm_add_cp_work_item(lock, work_list);
556 void ldlm_lock_addref(struct lustre_handle *lockh, __u32 mode)
558 struct ldlm_lock *lock;
560 lock = ldlm_handle2lock(lockh);
561 LASSERT(lock != NULL);
562 ldlm_lock_addref_internal(lock, mode);
566 void ldlm_lock_addref_internal_nolock(struct ldlm_lock *lock, __u32 mode)
568 ldlm_lock_remove_from_lru(lock);
569 if (mode & (LCK_NL | LCK_CR | LCK_PR))
571 if (mode & (LCK_EX | LCK_CW | LCK_PW | LCK_GROUP))
574 LDLM_DEBUG(lock, "ldlm_lock_addref(%s)", ldlm_lockname[mode]);
577 /* only called for local locks */
578 void ldlm_lock_addref_internal(struct ldlm_lock *lock, __u32 mode)
580 lock_res_and_lock(lock);
581 ldlm_lock_addref_internal_nolock(lock, mode);
582 unlock_res_and_lock(lock);
585 /* only called in ldlm_flock_destroy and for local locks.
586 * for LDLM_FLOCK type locks, l_blocking_ast is null, and
587 * ldlm_lock_remove_from_lru() does nothing, it is safe
588 * for ldlm_flock_destroy usage by dropping some code */
589 void ldlm_lock_decref_internal_nolock(struct ldlm_lock *lock, __u32 mode)
591 LDLM_DEBUG(lock, "ldlm_lock_decref(%s)", ldlm_lockname[mode]);
592 if (mode & (LCK_NL | LCK_CR | LCK_PR)) {
593 LASSERT(lock->l_readers > 0);
596 if (mode & (LCK_EX | LCK_CW | LCK_PW | LCK_GROUP)) {
597 LASSERT(lock->l_writers > 0);
601 LDLM_LOCK_PUT(lock); /* matches the ldlm_lock_get in addref */
604 void ldlm_lock_decref_internal(struct ldlm_lock *lock, __u32 mode)
606 struct ldlm_namespace *ns;
609 lock_res_and_lock(lock);
611 ns = lock->l_resource->lr_namespace;
613 ldlm_lock_decref_internal_nolock(lock, mode);
615 if (lock->l_flags & LDLM_FL_LOCAL &&
616 !lock->l_readers && !lock->l_writers) {
617 /* If this is a local lock on a server namespace and this was
618 * the last reference, cancel the lock. */
619 CDEBUG(D_INFO, "forcing cancel of local lock\n");
620 lock->l_flags |= LDLM_FL_CBPENDING;
623 if (!lock->l_readers && !lock->l_writers &&
624 (lock->l_flags & LDLM_FL_CBPENDING)) {
625 /* If we received a blocked AST and this was the last reference,
626 * run the callback. */
627 if (ns_is_server(ns) && lock->l_export)
628 CERROR("FL_CBPENDING set on non-local lock--just a "
631 LDLM_DEBUG(lock, "final decref done on cbpending lock");
633 LDLM_LOCK_GET(lock); /* dropped by bl thread */
634 ldlm_lock_remove_from_lru(lock);
635 unlock_res_and_lock(lock);
636 if ((lock->l_flags & LDLM_FL_ATOMIC_CB) ||
637 ldlm_bl_to_thread_lock(ns, NULL, lock) != 0)
638 ldlm_handle_bl_callback(ns, NULL, lock);
639 } else if (ns_is_client(ns) &&
640 !lock->l_readers && !lock->l_writers &&
641 !(lock->l_flags & LDLM_FL_NO_LRU)) {
642 /* If this is a client-side namespace and this was the last
643 * reference, put it on the LRU. */
644 ldlm_lock_add_to_lru(lock);
645 unlock_res_and_lock(lock);
646 /* Call ldlm_cancel_lru() only if EARLY_CANCEL and LRU RESIZE
647 * are not supported by the server, otherwise, it is done on
649 if (!exp_connect_cancelset(lock->l_conn_export) &&
650 !ns_connect_lru_resize(ns))
651 ldlm_cancel_lru(ns, 0, LDLM_ASYNC, 0);
653 unlock_res_and_lock(lock);
659 void ldlm_lock_decref(struct lustre_handle *lockh, __u32 mode)
661 struct ldlm_lock *lock = __ldlm_handle2lock(lockh, 0);
662 LASSERTF(lock != NULL, "Non-existing lock: "LPX64"\n", lockh->cookie);
663 ldlm_lock_decref_internal(lock, mode);
667 /* This will drop a lock reference and mark it for destruction, but will not
668 * necessarily cancel the lock before returning. */
669 void ldlm_lock_decref_and_cancel(struct lustre_handle *lockh, __u32 mode)
671 struct ldlm_lock *lock = __ldlm_handle2lock(lockh, 0);
674 LASSERT(lock != NULL);
676 LDLM_DEBUG(lock, "ldlm_lock_decref(%s)", ldlm_lockname[mode]);
677 lock_res_and_lock(lock);
678 lock->l_flags |= LDLM_FL_CBPENDING;
679 unlock_res_and_lock(lock);
680 ldlm_lock_decref_internal(lock, mode);
685 * search_granted_lock
688 * Finds a position to insert the new lock.
690 * queue [input]: the granted list where search acts on;
691 * req [input]: the lock whose position to be located;
692 * lockp [output]: the position where the lock should be inserted before, or
693 * NULL indicating @req should be appended to @queue.
695 * Bit-masks combination of following values indicating in which way the
696 * lock need to be inserted.
697 * - LDLM_JOIN_NONE: noting about skip list needs to be fixed;
698 * - LDLM_MODE_JOIN_RIGHT: @req needs join right becoming the head of a
700 * - LDLM_POLICY_JOIN_RIGHT: @req needs join right becoming the head of
703 * - ldlm_grant_lock_with_skiplist
705 static int search_granted_lock(struct list_head *queue,
706 struct ldlm_lock *req,
707 struct ldlm_lock **lockp)
709 struct list_head *tmp, *tmp_tail;
710 struct ldlm_lock *lock, *mode_head_lock;
711 int rc = LDLM_JOIN_NONE;
714 list_for_each(tmp, queue) {
715 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
717 if (lock->l_req_mode != req->l_req_mode) {
718 if (LDLM_SL_HEAD(&lock->l_sl_mode))
719 tmp = &list_entry(lock->l_sl_mode.next,
721 l_sl_mode)->l_res_link;
725 /* found the same mode group */
726 if (lock->l_resource->lr_type == LDLM_PLAIN) {
728 rc = LDLM_MODE_JOIN_RIGHT;
730 } else if (lock->l_resource->lr_type == LDLM_IBITS) {
732 if (LDLM_SL_HEAD(&lock->l_sl_mode))
733 tmp_tail = &list_entry(lock->l_sl_mode.next,
735 l_sl_mode)->l_res_link;
736 mode_head_lock = lock;
738 if (lock->l_policy_data.l_inodebits.bits ==
739 req->l_policy_data.l_inodebits.bits) {
740 /* matched policy lock is found */
742 rc |= LDLM_POLICY_JOIN_RIGHT;
744 /* if the policy group head is also a
745 * mode group head or a single mode
747 if (LDLM_SL_HEAD(&lock->l_sl_mode) ||
749 LDLM_SL_EMPTY(&lock->l_sl_mode)))
750 rc |= LDLM_MODE_JOIN_RIGHT;
754 if (LDLM_SL_HEAD(&lock->l_sl_policy))
755 tmp = &list_entry(lock->l_sl_policy.next,
757 l_sl_policy)->l_res_link;
763 lock = list_entry(tmp, struct ldlm_lock,
765 } /* for all locks in the matched mode group */
767 /* no matched policy group is found, insert before
768 * the mode group head lock */
769 *lockp = mode_head_lock;
770 rc = LDLM_MODE_JOIN_RIGHT;
773 LDLM_ERROR(lock, "is not LDLM_PLAIN or LDLM_IBITS lock");
778 /* no matched mode group is found, append to the end */
786 static void ldlm_granted_list_add_lock(struct ldlm_lock *lock,
787 struct ldlm_lock *lockp,
790 struct ldlm_resource *res = lock->l_resource;
793 LASSERT(lockp || join == LDLM_JOIN_NONE);
795 check_res_locked(res);
797 ldlm_resource_dump(D_OTHER, res);
798 CDEBUG(D_OTHER, "About to add this lock:\n");
799 ldlm_lock_dump(D_OTHER, lock, 0);
801 if (lock->l_destroyed) {
802 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
806 LASSERT(list_empty(&lock->l_res_link));
809 list_add_tail(&lock->l_res_link, &lock->l_resource->lr_granted);
810 else if ((join & LDLM_MODE_JOIN_LEFT) || (join & LDLM_POLICY_JOIN_LEFT))
811 list_add(&lock->l_res_link, &lockp->l_res_link);
813 list_add_tail(&lock->l_res_link, &lockp->l_res_link);
816 if (join & LDLM_MODE_JOIN_RIGHT) {
817 LASSERT(! LDLM_SL_TAIL(&lockp->l_sl_mode));
818 if (LDLM_SL_EMPTY(&lockp->l_sl_mode)) {
819 lock->l_sl_mode.next = &lockp->l_sl_mode;
820 lockp->l_sl_mode.prev = &lock->l_sl_mode;
821 } else if (LDLM_SL_HEAD(&lockp->l_sl_mode)) {
822 lock->l_sl_mode.next = lockp->l_sl_mode.next;
823 lockp->l_sl_mode.next = NULL;
824 lock->l_sl_mode.next->prev = &lock->l_sl_mode;
826 } else if (join & LDLM_MODE_JOIN_LEFT) {
827 LASSERT(! LDLM_SL_HEAD(&lockp->l_sl_mode));
828 if (LDLM_SL_EMPTY(&lockp->l_sl_mode)) {
829 lock->l_sl_mode.prev = &lockp->l_sl_mode;
830 lockp->l_sl_mode.next = &lock->l_sl_mode;
831 } else if (LDLM_SL_TAIL(&lockp->l_sl_mode)) {
832 lock->l_sl_mode.prev = lockp->l_sl_mode.prev;
833 lockp->l_sl_mode.prev = NULL;
834 lock->l_sl_mode.prev->next = &lock->l_sl_mode;
838 if (join & LDLM_POLICY_JOIN_RIGHT) {
839 LASSERT(! LDLM_SL_TAIL(&lockp->l_sl_policy));
840 if (LDLM_SL_EMPTY(&lockp->l_sl_policy)) {
841 lock->l_sl_policy.next = &lockp->l_sl_policy;
842 lockp->l_sl_policy.prev = &lock->l_sl_policy;
843 } else if (LDLM_SL_HEAD(&lockp->l_sl_policy)) {
844 lock->l_sl_policy.next = lockp->l_sl_policy.next;
845 lockp->l_sl_policy.next = NULL;
846 lock->l_sl_policy.next->prev = &lock->l_sl_policy;
848 } else if (join & LDLM_POLICY_JOIN_LEFT) {
849 LASSERT(! LDLM_SL_HEAD(&lockp->l_sl_policy));
850 if (LDLM_SL_EMPTY(&lockp->l_sl_policy)) {
851 lock->l_sl_policy.prev = &lockp->l_sl_policy;
852 lockp->l_sl_policy.next = &lock->l_sl_policy;
853 } else if (LDLM_SL_TAIL(&lockp->l_sl_policy)) {
854 lock->l_sl_policy.prev = lockp->l_sl_policy.prev;
855 lockp->l_sl_policy.prev = NULL;
856 lock->l_sl_policy.prev->next = &lock->l_sl_policy;
863 static void ldlm_grant_lock_with_skiplist(struct ldlm_lock *lock)
865 int join = LDLM_JOIN_NONE;
866 struct ldlm_lock *lockp = NULL;
869 LASSERT(lock->l_req_mode == lock->l_granted_mode);
871 join = search_granted_lock(&lock->l_resource->lr_granted, lock, &lockp);
872 ldlm_granted_list_add_lock(lock, lockp, join);
877 * - ldlm_lock_enqueue
878 * - ldlm_reprocess_queue
879 * - ldlm_lock_convert
881 * must be called with lr_lock held
883 void ldlm_grant_lock(struct ldlm_lock *lock, struct list_head *work_list)
885 struct ldlm_resource *res = lock->l_resource;
888 check_res_locked(res);
890 lock->l_granted_mode = lock->l_req_mode;
891 if (res->lr_type == LDLM_PLAIN || res->lr_type == LDLM_IBITS)
892 ldlm_grant_lock_with_skiplist(lock);
894 ldlm_resource_add_lock(res, &res->lr_granted, lock);
896 if (lock->l_granted_mode < res->lr_most_restr)
897 res->lr_most_restr = lock->l_granted_mode;
899 if (work_list && lock->l_completion_ast != NULL)
900 ldlm_add_ast_work_item(lock, NULL, work_list);
902 ldlm_pool_add(&res->lr_namespace->ns_pool, lock);
906 /* returns a referenced lock or NULL. See the flag descriptions below, in the
907 * comment above ldlm_lock_match */
908 static struct ldlm_lock *search_queue(struct list_head *queue,
910 ldlm_policy_data_t *policy,
911 struct ldlm_lock *old_lock, int flags)
913 struct ldlm_lock *lock;
914 struct list_head *tmp;
916 list_for_each(tmp, queue) {
919 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
921 if (lock == old_lock)
924 /* llite sometimes wants to match locks that will be
925 * canceled when their users drop, but we allow it to match
926 * if it passes in CBPENDING and the lock still has users.
927 * this is generally only going to be used by children
928 * whose parents already hold a lock so forward progress
929 * can still happen. */
930 if (lock->l_flags & LDLM_FL_CBPENDING &&
931 !(flags & LDLM_FL_CBPENDING))
933 if (lock->l_flags & LDLM_FL_CBPENDING &&
934 lock->l_readers == 0 && lock->l_writers == 0)
937 if (!(lock->l_req_mode & *mode))
940 match = lock->l_req_mode;
941 if (lock->l_resource->lr_type == LDLM_EXTENT &&
942 (lock->l_policy_data.l_extent.start >
943 policy->l_extent.start ||
944 lock->l_policy_data.l_extent.end < policy->l_extent.end))
947 if (unlikely(match == LCK_GROUP) &&
948 lock->l_resource->lr_type == LDLM_EXTENT &&
949 lock->l_policy_data.l_extent.gid != policy->l_extent.gid)
952 /* We match if we have existing lock with same or wider set
954 if (lock->l_resource->lr_type == LDLM_IBITS &&
955 ((lock->l_policy_data.l_inodebits.bits &
956 policy->l_inodebits.bits) !=
957 policy->l_inodebits.bits))
960 if (lock->l_destroyed || (lock->l_flags & LDLM_FL_FAILED))
963 if ((flags & LDLM_FL_LOCAL_ONLY) &&
964 !(lock->l_flags & LDLM_FL_LOCAL))
967 if (flags & LDLM_FL_TEST_LOCK) {
969 ldlm_lock_touch_in_lru(lock);
971 ldlm_lock_addref_internal_nolock(lock, match);
980 void ldlm_lock_allow_match(struct ldlm_lock *lock)
982 lock_res_and_lock(lock);
983 lock->l_flags |= LDLM_FL_LVB_READY;
984 cfs_waitq_signal(&lock->l_waitq);
985 unlock_res_and_lock(lock);
988 /* Can be called in two ways:
990 * If 'ns' is NULL, then lockh describes an existing lock that we want to look
991 * for a duplicate of.
993 * Otherwise, all of the fields must be filled in, to match against.
995 * If 'flags' contains LDLM_FL_LOCAL_ONLY, then only match local locks on the
996 * server (ie, connh is NULL)
997 * If 'flags' contains LDLM_FL_BLOCK_GRANTED, then only locks on the granted
998 * list will be considered
999 * If 'flags' contains LDLM_FL_CBPENDING, then locks that have been marked
1000 * to be canceled can still be matched as long as they still have reader
1001 * or writer refernces
1002 * If 'flags' contains LDLM_FL_TEST_LOCK, then don't actually reference a lock,
1003 * just tell us if we would have matched.
1005 * Returns 1 if it finds an already-existing lock that is compatible; in this
1006 * case, lockh is filled in with a addref()ed lock
1008 ldlm_mode_t ldlm_lock_match(struct ldlm_namespace *ns, int flags,
1009 struct ldlm_res_id *res_id, ldlm_type_t type,
1010 ldlm_policy_data_t *policy, ldlm_mode_t mode,
1011 struct lustre_handle *lockh)
1013 struct ldlm_resource *res;
1014 struct ldlm_lock *lock, *old_lock = NULL;
1019 old_lock = ldlm_handle2lock(lockh);
1022 ns = old_lock->l_resource->lr_namespace;
1023 res_id = &old_lock->l_resource->lr_name;
1024 type = old_lock->l_resource->lr_type;
1025 mode = old_lock->l_req_mode;
1028 res = ldlm_resource_get(ns, NULL, *res_id, type, 0);
1030 LASSERT(old_lock == NULL);
1036 lock = search_queue(&res->lr_granted, &mode, policy, old_lock, flags);
1039 if (flags & LDLM_FL_BLOCK_GRANTED)
1041 lock = search_queue(&res->lr_converting, &mode, policy, old_lock, flags);
1044 lock = search_queue(&res->lr_waiting, &mode, policy, old_lock, flags);
1051 ldlm_resource_putref(res);
1054 ldlm_lock2handle(lock, lockh);
1055 if ((flags & LDLM_FL_LVB_READY) && (!(lock->l_flags & LDLM_FL_LVB_READY))) {
1056 struct l_wait_info lwi;
1057 if (lock->l_completion_ast) {
1058 int err = lock->l_completion_ast(lock,
1059 LDLM_FL_WAIT_NOREPROC,
1062 if (flags & LDLM_FL_TEST_LOCK)
1063 LDLM_LOCK_PUT(lock);
1065 ldlm_lock_decref_internal(lock, mode);
1071 lwi = LWI_TIMEOUT_INTR(cfs_time_seconds(obd_timeout), NULL,
1072 LWI_ON_SIGNAL_NOOP, NULL);
1074 /* XXX FIXME see comment on CAN_MATCH in lustre_dlm.h */
1075 l_wait_event(lock->l_waitq,
1076 (lock->l_flags & LDLM_FL_LVB_READY), &lwi);
1081 LDLM_DEBUG(lock, "matched ("LPU64" "LPU64")",
1082 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1083 res_id->name[2] : policy->l_extent.start,
1084 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1085 res_id->name[3] : policy->l_extent.end);
1086 } else if (!(flags & LDLM_FL_TEST_LOCK)) {/*less verbose for test-only*/
1087 LDLM_DEBUG_NOLOCK("not matched ns %p type %u mode %u res "
1088 LPU64"/"LPU64" ("LPU64" "LPU64")", ns,
1089 type, mode, res_id->name[0], res_id->name[1],
1090 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1091 res_id->name[2] :policy->l_extent.start,
1092 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1093 res_id->name[3] : policy->l_extent.end);
1096 LDLM_LOCK_PUT(old_lock);
1097 if (flags & LDLM_FL_TEST_LOCK && rc)
1098 LDLM_LOCK_PUT(lock);
1100 return rc ? mode : 0;
1103 /* Returns a referenced lock */
1104 struct ldlm_lock *ldlm_lock_create(struct ldlm_namespace *ns,
1105 struct ldlm_res_id res_id, ldlm_type_t type,
1107 ldlm_blocking_callback blocking,
1108 ldlm_completion_callback completion,
1109 ldlm_glimpse_callback glimpse,
1110 void *data, __u32 lvb_len)
1112 struct ldlm_lock *lock;
1113 struct ldlm_resource *res;
1116 res = ldlm_resource_get(ns, NULL, res_id, type, 1);
1120 lock = ldlm_lock_new(res);
1121 ldlm_resource_putref(res);
1126 lock->l_req_mode = mode;
1127 lock->l_ast_data = data;
1128 lock->l_blocking_ast = blocking;
1129 lock->l_completion_ast = completion;
1130 lock->l_glimpse_ast = glimpse;
1131 lock->l_pid = cfs_curproc_pid();
1134 lock->l_lvb_len = lvb_len;
1135 OBD_ALLOC(lock->l_lvb_data, lvb_len);
1136 if (lock->l_lvb_data == NULL) {
1137 OBD_SLAB_FREE(lock, ldlm_lock_slab, sizeof(*lock));
1145 ldlm_error_t ldlm_lock_enqueue(struct ldlm_namespace *ns,
1146 struct ldlm_lock **lockp,
1147 void *cookie, int *flags)
1149 struct ldlm_lock *lock = *lockp;
1150 struct ldlm_resource *res = lock->l_resource;
1151 int local = ns_is_client(res->lr_namespace);
1152 ldlm_processing_policy policy;
1153 ldlm_error_t rc = ELDLM_OK;
1156 do_gettimeofday(&lock->l_enqueued_time);
1157 /* policies are not executed on the client or during replay */
1158 if ((*flags & (LDLM_FL_HAS_INTENT|LDLM_FL_REPLAY)) == LDLM_FL_HAS_INTENT
1159 && !local && ns->ns_policy) {
1160 rc = ns->ns_policy(ns, lockp, cookie, lock->l_req_mode, *flags,
1162 if (rc == ELDLM_LOCK_REPLACED) {
1163 /* The lock that was returned has already been granted,
1164 * and placed into lockp. If it's not the same as the
1165 * one we passed in, then destroy the old one and our
1166 * work here is done. */
1167 if (lock != *lockp) {
1168 ldlm_lock_destroy(lock);
1169 LDLM_LOCK_PUT(lock);
1171 *flags |= LDLM_FL_LOCK_CHANGED;
1173 } else if (rc != ELDLM_OK ||
1174 (rc == ELDLM_OK && (*flags & LDLM_FL_INTENT_ONLY))) {
1175 ldlm_lock_destroy(lock);
1180 lock_res_and_lock(lock);
1181 if (local && lock->l_req_mode == lock->l_granted_mode) {
1182 /* The server returned a blocked lock, but it was granted before
1183 * we got a chance to actually enqueue it. We don't need to do
1185 *flags &= ~(LDLM_FL_BLOCK_GRANTED |
1186 LDLM_FL_BLOCK_CONV | LDLM_FL_BLOCK_WAIT);
1187 GOTO(out, ELDLM_OK);
1190 /* Some flags from the enqueue want to make it into the AST, via the
1191 * lock's l_flags. */
1192 lock->l_flags |= *flags & LDLM_AST_DISCARD_DATA;
1194 /* This distinction between local lock trees is very important; a client
1195 * namespace only has information about locks taken by that client, and
1196 * thus doesn't have enough information to decide for itself if it can
1197 * be granted (below). In this case, we do exactly what the server
1198 * tells us to do, as dictated by the 'flags'.
1200 * We do exactly the same thing during recovery, when the server is
1201 * more or less trusting the clients not to lie.
1203 * FIXME (bug 268): Detect obvious lies by checking compatibility in
1204 * granted/converting queues. */
1205 ldlm_resource_unlink_lock(lock);
1207 if (*flags & LDLM_FL_BLOCK_CONV)
1208 ldlm_resource_add_lock(res, &res->lr_converting, lock);
1209 else if (*flags & (LDLM_FL_BLOCK_WAIT | LDLM_FL_BLOCK_GRANTED))
1210 ldlm_resource_add_lock(res, &res->lr_waiting, lock);
1212 ldlm_grant_lock(lock, NULL);
1213 GOTO(out, ELDLM_OK);
1214 } else if (*flags & LDLM_FL_REPLAY) {
1215 if (*flags & LDLM_FL_BLOCK_CONV) {
1216 ldlm_resource_add_lock(res, &res->lr_converting, lock);
1217 GOTO(out, ELDLM_OK);
1218 } else if (*flags & LDLM_FL_BLOCK_WAIT) {
1219 ldlm_resource_add_lock(res, &res->lr_waiting, lock);
1220 GOTO(out, ELDLM_OK);
1221 } else if (*flags & LDLM_FL_BLOCK_GRANTED) {
1222 ldlm_grant_lock(lock, NULL);
1223 GOTO(out, ELDLM_OK);
1225 /* If no flags, fall through to normal enqueue path. */
1228 policy = ldlm_processing_policy_table[res->lr_type];
1229 policy(lock, flags, 1, &rc, NULL);
1232 unlock_res_and_lock(lock);
1236 /* Must be called with namespace taken: queue is waiting or converting. */
1237 int ldlm_reprocess_queue(struct ldlm_resource *res, struct list_head *queue,
1238 struct list_head *work_list)
1240 struct list_head *tmp, *pos;
1241 ldlm_processing_policy policy;
1243 int rc = LDLM_ITER_CONTINUE;
1247 check_res_locked(res);
1249 policy = ldlm_processing_policy_table[res->lr_type];
1252 list_for_each_safe(tmp, pos, queue) {
1253 struct ldlm_lock *pending;
1254 pending = list_entry(tmp, struct ldlm_lock, l_res_link);
1256 CDEBUG(D_INFO, "Reprocessing lock %p\n", pending);
1259 rc = policy(pending, &flags, 0, &err, work_list);
1260 if (rc != LDLM_ITER_CONTINUE)
1267 /* Helper function for pair ldlm_run_{bl,cp}_ast_work().
1269 * Send an existing rpc set specified by @arg->set and then
1270 * destroy it. Create new one if @do_create flag is set. */
1272 ldlm_send_and_maybe_create_set(struct ldlm_cb_set_arg *arg, int do_create)
1276 rc = ptlrpc_set_wait(arg->set);
1277 if (arg->type == LDLM_BL_CALLBACK)
1278 OBD_FAIL_TIMEOUT(OBD_FAIL_LDLM_GLIMPSE, 2);
1279 ptlrpc_set_destroy(arg->set);
1282 arg->set = ptlrpc_prep_set();
1285 int ldlm_run_bl_ast_work(struct list_head *rpc_list)
1287 struct ldlm_cb_set_arg arg;
1288 struct list_head *tmp, *pos;
1289 struct ldlm_lock_desc d;
1294 arg.set = ptlrpc_prep_set();
1295 atomic_set(&arg.restart, 0);
1296 arg.type = LDLM_BL_CALLBACK;
1299 list_for_each_safe(tmp, pos, rpc_list) {
1300 struct ldlm_lock *lock =
1301 list_entry(tmp, struct ldlm_lock, l_bl_ast);
1303 /* nobody should touch l_bl_ast */
1304 lock_res_and_lock(lock);
1305 list_del_init(&lock->l_bl_ast);
1307 LASSERT(lock->l_flags & LDLM_FL_AST_SENT);
1308 LASSERT(lock->l_bl_ast_run == 0);
1309 LASSERT(lock->l_blocking_lock);
1310 lock->l_bl_ast_run++;
1311 unlock_res_and_lock(lock);
1313 ldlm_lock2desc(lock->l_blocking_lock, &d);
1315 LDLM_LOCK_PUT(lock->l_blocking_lock);
1316 lock->l_blocking_lock = NULL;
1317 rc = lock->l_blocking_ast(lock, &d, (void *)&arg,
1319 LDLM_LOCK_PUT(lock);
1322 /* Send the request set if it exceeds the PARALLEL_AST_LIMIT,
1323 * and create a new set for requests that remained in
1325 if (unlikely(ast_count == PARALLEL_AST_LIMIT)) {
1326 ldlm_send_and_maybe_create_set(&arg, 1);
1332 ldlm_send_and_maybe_create_set(&arg, 0);
1334 /* In case when number of ASTs is multiply of
1335 * PARALLEL_AST_LIMIT or @rpc_list was initially empty,
1336 * @arg.set must be destroyed here, otherwise we get
1337 * write memory leaking. */
1338 ptlrpc_set_destroy(arg.set);
1340 RETURN(atomic_read(&arg.restart) ? -ERESTART : 0);
1343 int ldlm_run_cp_ast_work(struct list_head *rpc_list)
1345 struct ldlm_cb_set_arg arg;
1346 struct list_head *tmp, *pos;
1351 arg.set = ptlrpc_prep_set();
1352 atomic_set(&arg.restart, 0);
1353 arg.type = LDLM_CP_CALLBACK;
1355 /* It's possible to receive a completion AST before we've set
1356 * the l_completion_ast pointer: either because the AST arrived
1357 * before the reply, or simply because there's a small race
1358 * window between receiving the reply and finishing the local
1359 * enqueue. (bug 842)
1361 * This can't happen with the blocking_ast, however, because we
1362 * will never call the local blocking_ast until we drop our
1363 * reader/writer reference, which we won't do until we get the
1364 * reply and finish enqueueing. */
1367 list_for_each_safe(tmp, pos, rpc_list) {
1368 struct ldlm_lock *lock =
1369 list_entry(tmp, struct ldlm_lock, l_cp_ast);
1370 ldlm_completion_callback completion_callback;
1372 /* nobody should touch l_cp_ast */
1373 lock_res_and_lock(lock);
1374 list_del_init(&lock->l_cp_ast);
1375 LASSERT(lock->l_flags & LDLM_FL_CP_REQD);
1376 /* save l_completion_ast since it can be changed by
1377 * mds_intent_policy(), see bug 14225 */
1378 completion_callback = lock->l_completion_ast;
1379 lock->l_flags &= ~LDLM_FL_CP_REQD;
1380 unlock_res_and_lock(lock);
1382 if (completion_callback != NULL) {
1383 rc = completion_callback(lock, 0, (void *)&arg);
1386 LDLM_LOCK_PUT(lock);
1388 /* Send the request set if it exceeds the PARALLEL_AST_LIMIT,
1389 * and create a new set for requests that remained in
1391 if (unlikely(ast_count == PARALLEL_AST_LIMIT)) {
1392 ldlm_send_and_maybe_create_set(&arg, 1);
1398 ldlm_send_and_maybe_create_set(&arg, 0);
1400 /* In case when number of ASTs is multiply of
1401 * PARALLEL_AST_LIMIT or @rpc_list was initially empty,
1402 * @arg.set must be destroyed here, otherwise we get
1403 * write memory leaking. */
1404 ptlrpc_set_destroy(arg.set);
1406 RETURN(atomic_read(&arg.restart) ? -ERESTART : 0);
1409 static int reprocess_one_queue(struct ldlm_resource *res, void *closure)
1411 ldlm_reprocess_all(res);
1412 return LDLM_ITER_CONTINUE;
1415 void ldlm_reprocess_all_ns(struct ldlm_namespace *ns)
1417 struct list_head *tmp;
1421 spin_lock(&ns->ns_hash_lock);
1422 for (i = 0; i < RES_HASH_SIZE; i++) {
1423 tmp = ns->ns_hash[i].next;
1424 while (tmp != &(ns->ns_hash[i])) {
1425 struct ldlm_resource *res =
1426 list_entry(tmp, struct ldlm_resource, lr_hash);
1428 ldlm_resource_getref(res);
1429 spin_unlock(&ns->ns_hash_lock);
1431 rc = reprocess_one_queue(res, NULL);
1433 spin_lock(&ns->ns_hash_lock);
1435 ldlm_resource_putref_locked(res);
1437 if (rc == LDLM_ITER_STOP)
1442 spin_unlock(&ns->ns_hash_lock);
1446 void ldlm_reprocess_all(struct ldlm_resource *res)
1448 struct list_head rpc_list = LIST_HEAD_INIT(rpc_list);
1452 /* Local lock trees don't get reprocessed. */
1453 if (ns_is_client(res->lr_namespace)) {
1460 rc = ldlm_reprocess_queue(res, &res->lr_converting, &rpc_list);
1461 if (rc == LDLM_ITER_CONTINUE)
1462 ldlm_reprocess_queue(res, &res->lr_waiting, &rpc_list);
1465 rc = ldlm_run_cp_ast_work(&rpc_list);
1466 if (rc == -ERESTART) {
1467 LASSERT(list_empty(&rpc_list));
1473 void ldlm_cancel_callback(struct ldlm_lock *lock)
1475 check_res_locked(lock->l_resource);
1476 if (!(lock->l_flags & LDLM_FL_CANCEL)) {
1477 lock->l_flags |= LDLM_FL_CANCEL;
1478 if (lock->l_blocking_ast) {
1479 // l_check_no_ns_lock(ns);
1480 unlock_res_and_lock(lock);
1481 lock->l_blocking_ast(lock, NULL, lock->l_ast_data,
1483 lock_res_and_lock(lock);
1485 LDLM_DEBUG(lock, "no blocking ast");
1488 lock->l_flags |= LDLM_FL_BL_DONE;
1491 void ldlm_unlink_lock_skiplist(struct ldlm_lock *req)
1493 struct ldlm_lock *lock;
1495 if (req->l_resource->lr_type != LDLM_PLAIN &&
1496 req->l_resource->lr_type != LDLM_IBITS)
1499 if (LDLM_SL_HEAD(&req->l_sl_mode)) {
1500 lock = list_entry(req->l_res_link.next, struct ldlm_lock,
1502 if (req->l_sl_mode.next == &lock->l_sl_mode) {
1503 lock->l_sl_mode.prev = NULL;
1505 lock->l_sl_mode.next = req->l_sl_mode.next;
1506 lock->l_sl_mode.next->prev = &lock->l_sl_mode;
1508 req->l_sl_mode.next = NULL;
1509 } else if (LDLM_SL_TAIL(&req->l_sl_mode)) {
1510 lock = list_entry(req->l_res_link.prev, struct ldlm_lock,
1512 if (req->l_sl_mode.prev == &lock->l_sl_mode) {
1513 lock->l_sl_mode.next = NULL;
1515 lock->l_sl_mode.prev = req->l_sl_mode.prev;
1516 lock->l_sl_mode.prev->next = &lock->l_sl_mode;
1518 req->l_sl_mode.prev = NULL;
1521 if (LDLM_SL_HEAD(&req->l_sl_policy)) {
1522 lock = list_entry(req->l_res_link.next, struct ldlm_lock,
1524 if (req->l_sl_policy.next == &lock->l_sl_policy) {
1525 lock->l_sl_policy.prev = NULL;
1527 lock->l_sl_policy.next = req->l_sl_policy.next;
1528 lock->l_sl_policy.next->prev = &lock->l_sl_policy;
1530 req->l_sl_policy.next = NULL;
1531 } else if (LDLM_SL_TAIL(&req->l_sl_policy)) {
1532 lock = list_entry(req->l_res_link.prev, struct ldlm_lock,
1534 if (req->l_sl_policy.prev == &lock->l_sl_policy) {
1535 lock->l_sl_policy.next = NULL;
1537 lock->l_sl_policy.prev = req->l_sl_policy.prev;
1538 lock->l_sl_policy.prev->next = &lock->l_sl_policy;
1540 req->l_sl_policy.prev = NULL;
1544 void ldlm_lock_cancel(struct ldlm_lock *lock)
1546 struct ldlm_resource *res;
1547 struct ldlm_namespace *ns;
1550 lock_res_and_lock(lock);
1552 res = lock->l_resource;
1553 ns = res->lr_namespace;
1555 /* Please do not, no matter how tempting, remove this LBUG without
1556 * talking to me first. -phik */
1557 if (lock->l_readers || lock->l_writers) {
1558 LDLM_ERROR(lock, "lock still has references");
1562 ldlm_del_waiting_lock(lock);
1564 /* Releases res lock */
1565 ldlm_cancel_callback(lock);
1567 /* Yes, second time, just in case it was added again while we were
1568 running with no res lock in ldlm_cancel_callback */
1569 ldlm_del_waiting_lock(lock);
1570 ldlm_resource_unlink_lock(lock);
1571 ldlm_lock_destroy_nolock(lock);
1573 if (lock->l_granted_mode == lock->l_req_mode)
1574 ldlm_pool_del(&ns->ns_pool, lock);
1576 /* Make sure we will not be called again for same lock what is possible
1577 * if not to zero out lock->l_granted_mode */
1578 lock->l_granted_mode = 0;
1579 unlock_res_and_lock(lock);
1584 int ldlm_lock_set_data(struct lustre_handle *lockh, void *data)
1586 struct ldlm_lock *lock = ldlm_handle2lock(lockh);
1592 lock->l_ast_data = data;
1593 LDLM_LOCK_PUT(lock);
1597 void ldlm_cancel_locks_for_export(struct obd_export *exp)
1599 struct ldlm_lock *lock;
1600 struct ldlm_resource *res;
1602 spin_lock(&exp->exp_ldlm_data.led_lock);
1603 while(!list_empty(&exp->exp_ldlm_data.led_held_locks)) {
1604 lock = list_entry(exp->exp_ldlm_data.led_held_locks.next,
1605 struct ldlm_lock, l_export_chain);
1606 res = ldlm_resource_getref(lock->l_resource);
1607 LDLM_LOCK_GET(lock);
1608 spin_unlock(&exp->exp_ldlm_data.led_lock);
1610 LDLM_DEBUG(lock, "export %p", exp);
1611 ldlm_res_lvbo_update(res, NULL, 0, 1);
1613 ldlm_lock_cancel(lock);
1614 ldlm_reprocess_all(res);
1616 ldlm_resource_putref(res);
1617 LDLM_LOCK_PUT(lock);
1618 spin_lock(&exp->exp_ldlm_data.led_lock);
1620 spin_unlock(&exp->exp_ldlm_data.led_lock);
1623 struct ldlm_resource *ldlm_lock_convert(struct ldlm_lock *lock, int new_mode,
1626 struct list_head rpc_list = LIST_HEAD_INIT(rpc_list);
1627 struct ldlm_resource *res;
1628 struct ldlm_namespace *ns;
1631 struct ldlm_lock *mark_lock = NULL;
1632 int join= LDLM_JOIN_NONE;
1636 if (new_mode == lock->l_granted_mode) { // No changes? Just return.
1637 *flags |= LDLM_FL_BLOCK_GRANTED;
1638 RETURN(lock->l_resource);
1641 LASSERTF(new_mode == LCK_PW && lock->l_granted_mode == LCK_PR,
1642 "new_mode %u, granted %u\n", new_mode, lock->l_granted_mode);
1644 lock_res_and_lock(lock);
1646 res = lock->l_resource;
1647 ns = res->lr_namespace;
1649 old_mode = lock->l_req_mode;
1650 lock->l_req_mode = new_mode;
1651 if (res->lr_type == LDLM_PLAIN || res->lr_type == LDLM_IBITS) {
1652 /* remember the lock position where the lock might be
1653 * added back to the granted list later and also
1654 * remember the join mode for skiplist fixing. */
1655 if (LDLM_SL_HEAD(&lock->l_sl_mode))
1656 join = LDLM_MODE_JOIN_RIGHT;
1657 else if (LDLM_SL_TAIL(&lock->l_sl_mode))
1658 join = LDLM_MODE_JOIN_LEFT;
1659 if (LDLM_SL_HEAD(&lock->l_sl_policy))
1660 join |= LDLM_POLICY_JOIN_RIGHT;
1661 else if (LDLM_SL_TAIL(&lock->l_sl_policy))
1662 join |= LDLM_POLICY_JOIN_LEFT;
1664 LASSERT(!((join & LDLM_MODE_JOIN_RIGHT) &&
1665 (join & LDLM_POLICY_JOIN_LEFT)));
1666 LASSERT(!((join & LDLM_MODE_JOIN_LEFT) &&
1667 (join & LDLM_POLICY_JOIN_RIGHT)));
1669 if ((join & LDLM_MODE_JOIN_LEFT) ||
1670 (join & LDLM_POLICY_JOIN_LEFT))
1671 mark_lock = list_entry(lock->l_res_link.prev,
1672 struct ldlm_lock, l_res_link);
1673 else if (lock->l_res_link.next != &res->lr_granted)
1674 mark_lock = list_entry(lock->l_res_link.next,
1675 struct ldlm_lock, l_res_link);
1677 ldlm_resource_unlink_lock(lock);
1679 /* If this is a local resource, put it on the appropriate list. */
1680 if (ns_is_client(res->lr_namespace)) {
1681 if (*flags & (LDLM_FL_BLOCK_CONV | LDLM_FL_BLOCK_GRANTED)) {
1682 ldlm_resource_add_lock(res, &res->lr_converting, lock);
1684 /* This should never happen, because of the way the
1685 * server handles conversions. */
1686 LDLM_ERROR(lock, "Erroneous flags %d on local lock\n",
1690 ldlm_grant_lock(lock, &rpc_list);
1692 /* FIXME: completion handling not with ns_lock held ! */
1693 if (lock->l_completion_ast)
1694 lock->l_completion_ast(lock, 0, NULL);
1698 ldlm_processing_policy policy;
1699 policy = ldlm_processing_policy_table[res->lr_type];
1700 rc = policy(lock, &pflags, 0, &err, &rpc_list);
1701 if (rc == LDLM_ITER_STOP) {
1702 lock->l_req_mode = old_mode;
1703 ldlm_granted_list_add_lock(lock, mark_lock, join);
1706 *flags |= LDLM_FL_BLOCK_GRANTED;
1710 unlock_res_and_lock(lock);
1713 ldlm_run_cp_ast_work(&rpc_list);
1717 void ldlm_lock_dump(int level, struct ldlm_lock *lock, int pos)
1719 struct obd_device *obd = NULL;
1721 if (!((libcfs_debug | D_ERROR) & level))
1725 CDEBUG(level, " NULL LDLM lock\n");
1729 CDEBUG(level," -- Lock dump: %p/"LPX64" (rc: %d) (pos: %d) (pid: %d)\n",
1730 lock, lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
1732 if (lock->l_conn_export != NULL)
1733 obd = lock->l_conn_export->exp_obd;
1734 if (lock->l_export && lock->l_export->exp_connection) {
1735 CDEBUG(level, " Node: NID %s (rhandle: "LPX64")\n",
1736 libcfs_nid2str(lock->l_export->exp_connection->c_peer.nid),
1737 lock->l_remote_handle.cookie);
1738 } else if (obd == NULL) {
1739 CDEBUG(level, " Node: local\n");
1741 struct obd_import *imp = obd->u.cli.cl_import;
1742 CDEBUG(level, " Node: NID %s (rhandle: "LPX64")\n",
1743 libcfs_nid2str(imp->imp_connection->c_peer.nid),
1744 lock->l_remote_handle.cookie);
1746 CDEBUG(level, " Resource: %p ("LPU64"/"LPU64")\n", lock->l_resource,
1747 lock->l_resource->lr_name.name[0],
1748 lock->l_resource->lr_name.name[1]);
1749 CDEBUG(level, " Req mode: %s, grant mode: %s, rc: %u, read: %d, "
1750 "write: %d flags: %#x\n", ldlm_lockname[lock->l_req_mode],
1751 ldlm_lockname[lock->l_granted_mode],
1752 atomic_read(&lock->l_refc), lock->l_readers, lock->l_writers,
1754 if (lock->l_resource->lr_type == LDLM_EXTENT)
1755 CDEBUG(level, " Extent: "LPU64" -> "LPU64
1756 " (req "LPU64"-"LPU64")\n",
1757 lock->l_policy_data.l_extent.start,
1758 lock->l_policy_data.l_extent.end,
1759 lock->l_req_extent.start, lock->l_req_extent.end);
1760 else if (lock->l_resource->lr_type == LDLM_FLOCK)
1761 CDEBUG(level, " Pid: %d Extent: "LPU64" -> "LPU64"\n",
1762 lock->l_policy_data.l_flock.pid,
1763 lock->l_policy_data.l_flock.start,
1764 lock->l_policy_data.l_flock.end);
1765 else if (lock->l_resource->lr_type == LDLM_IBITS)
1766 CDEBUG(level, " Bits: "LPX64"\n",
1767 lock->l_policy_data.l_inodebits.bits);
1770 void ldlm_lock_dump_handle(int level, struct lustre_handle *lockh)
1772 struct ldlm_lock *lock;
1774 if (!((libcfs_debug | D_ERROR) & level))
1777 lock = ldlm_handle2lock(lockh);
1781 ldlm_lock_dump(D_OTHER, lock, 0);
1783 LDLM_LOCK_PUT(lock);
1786 void _ldlm_lock_debug(struct ldlm_lock *lock, __u32 level,
1787 struct libcfs_debug_msg_data *data, const char *fmt,
1791 cfs_debug_limit_state_t *cdls = data->msg_cdls;
1793 va_start(args, fmt);
1794 if (lock->l_resource == NULL) {
1795 libcfs_debug_vmsg2(cdls, data->msg_subsys, level, data->msg_file,
1796 data->msg_fn, data->msg_line, fmt, args,
1797 " ns: \?\? lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
1798 "res: \?\? rrc=\?\? type: \?\?\? flags: %x remote: "
1799 LPX64" expref: %d pid: %u\n", lock,
1800 lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
1801 lock->l_readers, lock->l_writers,
1802 ldlm_lockname[lock->l_granted_mode],
1803 ldlm_lockname[lock->l_req_mode],
1804 lock->l_flags, lock->l_remote_handle.cookie,
1806 atomic_read(&lock->l_export->exp_refcount) : -99,
1812 switch (lock->l_resource->lr_type) {
1814 libcfs_debug_vmsg2(cdls, data->msg_subsys, level, data->msg_file,
1815 data->msg_fn, data->msg_line, fmt, args,
1816 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
1817 "res: "LPU64"/"LPU64" rrc: %d type: %s ["LPU64"->"LPU64
1818 "] (req "LPU64"->"LPU64") flags: %x remote: "LPX64
1819 " expref: %d pid: %u\n",
1820 lock->l_resource->lr_namespace->ns_name, lock,
1821 lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
1822 lock->l_readers, lock->l_writers,
1823 ldlm_lockname[lock->l_granted_mode],
1824 ldlm_lockname[lock->l_req_mode],
1825 lock->l_resource->lr_name.name[0],
1826 lock->l_resource->lr_name.name[1],
1827 atomic_read(&lock->l_resource->lr_refcount),
1828 ldlm_typename[lock->l_resource->lr_type],
1829 lock->l_policy_data.l_extent.start,
1830 lock->l_policy_data.l_extent.end,
1831 lock->l_req_extent.start, lock->l_req_extent.end,
1832 lock->l_flags, lock->l_remote_handle.cookie,
1834 atomic_read(&lock->l_export->exp_refcount) : -99,
1838 libcfs_debug_vmsg2(cdls, data->msg_subsys, level, data->msg_file,
1839 data->msg_fn, data->msg_line, fmt, args,
1840 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
1841 "res: "LPU64"/"LPU64" rrc: %d type: %s pid: %d "
1842 "["LPU64"->"LPU64"] flags: %x remote: "LPX64
1843 " expref: %d pid: %u\n",
1844 lock->l_resource->lr_namespace->ns_name, lock,
1845 lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
1846 lock->l_readers, lock->l_writers,
1847 ldlm_lockname[lock->l_granted_mode],
1848 ldlm_lockname[lock->l_req_mode],
1849 lock->l_resource->lr_name.name[0],
1850 lock->l_resource->lr_name.name[1],
1851 atomic_read(&lock->l_resource->lr_refcount),
1852 ldlm_typename[lock->l_resource->lr_type],
1853 lock->l_policy_data.l_flock.pid,
1854 lock->l_policy_data.l_flock.start,
1855 lock->l_policy_data.l_flock.end,
1856 lock->l_flags, lock->l_remote_handle.cookie,
1858 atomic_read(&lock->l_export->exp_refcount) : -99,
1862 libcfs_debug_vmsg2(cdls, data->msg_subsys, level, data->msg_file,
1863 data->msg_fn, data->msg_line, fmt, args,
1864 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
1865 "res: "LPU64"/"LPU64" bits "LPX64" rrc: %d type: %s "
1866 "flags: %x remote: "LPX64" expref: %d "
1868 lock->l_resource->lr_namespace->ns_name,
1869 lock, lock->l_handle.h_cookie,
1870 atomic_read (&lock->l_refc),
1871 lock->l_readers, lock->l_writers,
1872 ldlm_lockname[lock->l_granted_mode],
1873 ldlm_lockname[lock->l_req_mode],
1874 lock->l_resource->lr_name.name[0],
1875 lock->l_resource->lr_name.name[1],
1876 lock->l_policy_data.l_inodebits.bits,
1877 atomic_read(&lock->l_resource->lr_refcount),
1878 ldlm_typename[lock->l_resource->lr_type],
1879 lock->l_flags, lock->l_remote_handle.cookie,
1881 atomic_read(&lock->l_export->exp_refcount) : -99,
1885 libcfs_debug_vmsg2(cdls, data->msg_subsys, level, data->msg_file,
1886 data->msg_fn, data->msg_line, fmt, args,
1887 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
1888 "res: "LPU64"/"LPU64" rrc: %d type: %s flags: %x "
1889 "remote: "LPX64" expref: %d pid: %u\n",
1890 lock->l_resource->lr_namespace->ns_name,
1891 lock, lock->l_handle.h_cookie,
1892 atomic_read (&lock->l_refc),
1893 lock->l_readers, lock->l_writers,
1894 ldlm_lockname[lock->l_granted_mode],
1895 ldlm_lockname[lock->l_req_mode],
1896 lock->l_resource->lr_name.name[0],
1897 lock->l_resource->lr_name.name[1],
1898 atomic_read(&lock->l_resource->lr_refcount),
1899 ldlm_typename[lock->l_resource->lr_type],
1900 lock->l_flags, lock->l_remote_handle.cookie,
1902 atomic_read(&lock->l_export->exp_refcount) : -99,
1908 EXPORT_SYMBOL(_ldlm_lock_debug);