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);
354 int ldlm_lock_change_resource(struct ldlm_namespace *ns, struct ldlm_lock *lock,
355 struct ldlm_res_id new_resid)
357 struct ldlm_resource *oldres = lock->l_resource;
358 struct ldlm_resource *newres;
362 LASSERT(ns->ns_client != 0);
364 lock_res_and_lock(lock);
365 if (memcmp(&new_resid, &lock->l_resource->lr_name,
366 sizeof(lock->l_resource->lr_name)) == 0) {
368 unlock_res_and_lock(lock);
372 LASSERT(new_resid.name[0] != 0);
374 /* This function assumes that the lock isn't on any lists */
375 LASSERT(list_empty(&lock->l_res_link));
377 type = oldres->lr_type;
378 unlock_res_and_lock(lock);
380 newres = ldlm_resource_get(ns, NULL, new_resid, type, 1);
381 if (newres == NULL) {
386 lock_res_and_lock(lock);
387 LASSERT(memcmp(&new_resid, &lock->l_resource->lr_name,
388 sizeof(lock->l_resource->lr_name)) != 0);
390 lock->l_resource = newres;
392 unlock_res_and_lock(lock);
394 /* ...and the flowers are still standing! */
395 ldlm_resource_putref(oldres);
404 void ldlm_lock2handle(struct ldlm_lock *lock, struct lustre_handle *lockh)
406 lockh->cookie = lock->l_handle.h_cookie;
409 /* if flags: atomically get the lock and set the flags.
410 * Return NULL if flag already set
413 struct ldlm_lock *__ldlm_handle2lock(struct lustre_handle *handle, int flags)
415 struct ldlm_namespace *ns;
416 struct ldlm_lock *lock = NULL, *retval = NULL;
421 lock = class_handle2object(handle->cookie);
425 LASSERT(lock->l_resource != NULL);
426 ns = lock->l_resource->lr_namespace;
429 lock_res_and_lock(lock);
431 /* It's unlikely but possible that someone marked the lock as
432 * destroyed after we did handle2object on it */
433 if (lock->l_destroyed) {
434 unlock_res_and_lock(lock);
435 CDEBUG(D_INFO, "lock already destroyed: lock %p\n", lock);
440 if (flags && (lock->l_flags & flags)) {
441 unlock_res_and_lock(lock);
447 lock->l_flags |= flags;
449 unlock_res_and_lock(lock);
456 struct ldlm_lock *ldlm_handle2lock_ns(struct ldlm_namespace *ns,
457 struct lustre_handle *handle)
459 struct ldlm_lock *retval = NULL;
460 retval = __ldlm_handle2lock(handle, 0);
464 void ldlm_lock2desc(struct ldlm_lock *lock, struct ldlm_lock_desc *desc)
466 struct obd_export *exp = lock->l_export?:lock->l_conn_export;
467 /* INODEBITS_INTEROP: If the other side does not support
468 * inodebits, reply with a plain lock descriptor.
470 if ((lock->l_resource->lr_type == LDLM_IBITS) &&
471 (exp && !(exp->exp_connect_flags & OBD_CONNECT_IBITS))) {
472 struct ldlm_resource res = *lock->l_resource;
474 /* Make sure all the right bits are set in this lock we
475 are going to pass to client */
476 LASSERTF(lock->l_policy_data.l_inodebits.bits ==
477 (MDS_INODELOCK_LOOKUP|MDS_INODELOCK_UPDATE),
478 "Inappropriate inode lock bits during "
479 "conversion " LPU64 "\n",
480 lock->l_policy_data.l_inodebits.bits);
481 res.lr_type = LDLM_PLAIN;
482 ldlm_res2desc(&res, &desc->l_resource);
483 /* Convert "new" lock mode to something old client can
485 if ((lock->l_req_mode == LCK_CR) ||
486 (lock->l_req_mode == LCK_CW))
487 desc->l_req_mode = LCK_PR;
489 desc->l_req_mode = lock->l_req_mode;
490 if ((lock->l_granted_mode == LCK_CR) ||
491 (lock->l_granted_mode == LCK_CW)) {
492 desc->l_granted_mode = LCK_PR;
494 /* We never grant PW/EX locks to clients */
495 LASSERT((lock->l_granted_mode != LCK_PW) &&
496 (lock->l_granted_mode != LCK_EX));
497 desc->l_granted_mode = lock->l_granted_mode;
500 /* We do not copy policy here, because there is no
501 policy for plain locks */
503 ldlm_res2desc(lock->l_resource, &desc->l_resource);
504 desc->l_req_mode = lock->l_req_mode;
505 desc->l_granted_mode = lock->l_granted_mode;
506 desc->l_policy_data = lock->l_policy_data;
510 void ldlm_add_bl_work_item(struct ldlm_lock *lock, struct ldlm_lock *new,
511 struct list_head *work_list)
513 if ((lock->l_flags & LDLM_FL_AST_SENT) == 0) {
514 LDLM_DEBUG(lock, "lock incompatible; sending blocking AST.");
515 lock->l_flags |= LDLM_FL_AST_SENT;
516 /* If the enqueuing client said so, tell the AST recipient to
517 * discard dirty data, rather than writing back. */
518 if (new->l_flags & LDLM_AST_DISCARD_DATA)
519 lock->l_flags |= LDLM_FL_DISCARD_DATA;
520 LASSERT(list_empty(&lock->l_bl_ast));
521 list_add(&lock->l_bl_ast, work_list);
523 LASSERT(lock->l_blocking_lock == NULL);
524 lock->l_blocking_lock = LDLM_LOCK_GET(new);
528 void ldlm_add_cp_work_item(struct ldlm_lock *lock, struct list_head *work_list)
530 if ((lock->l_flags & LDLM_FL_CP_REQD) == 0) {
531 lock->l_flags |= LDLM_FL_CP_REQD;
532 LDLM_DEBUG(lock, "lock granted; sending completion AST.");
533 LASSERT(list_empty(&lock->l_cp_ast));
534 list_add(&lock->l_cp_ast, work_list);
539 /* must be called with lr_lock held */
540 void ldlm_add_ast_work_item(struct ldlm_lock *lock, struct ldlm_lock *new,
541 struct list_head *work_list)
544 check_res_locked(lock->l_resource);
546 ldlm_add_bl_work_item(lock, new, work_list);
548 ldlm_add_cp_work_item(lock, work_list);
552 void ldlm_lock_addref(struct lustre_handle *lockh, __u32 mode)
554 struct ldlm_lock *lock;
556 lock = ldlm_handle2lock(lockh);
557 LASSERT(lock != NULL);
558 ldlm_lock_addref_internal(lock, mode);
562 void ldlm_lock_addref_internal_nolock(struct ldlm_lock *lock, __u32 mode)
564 ldlm_lock_remove_from_lru(lock);
565 if (mode & (LCK_NL | LCK_CR | LCK_PR))
567 if (mode & (LCK_EX | LCK_CW | LCK_PW | LCK_GROUP))
570 LDLM_DEBUG(lock, "ldlm_lock_addref(%s)", ldlm_lockname[mode]);
573 /* only called for local locks */
574 void ldlm_lock_addref_internal(struct ldlm_lock *lock, __u32 mode)
576 lock_res_and_lock(lock);
577 ldlm_lock_addref_internal_nolock(lock, mode);
578 unlock_res_and_lock(lock);
581 /* only called in ldlm_flock_destroy and for local locks.
582 * for LDLM_FLOCK type locks, l_blocking_ast is null, and
583 * ldlm_lock_remove_from_lru() does nothing, it is safe
584 * for ldlm_flock_destroy usage by dropping some code */
585 void ldlm_lock_decref_internal_nolock(struct ldlm_lock *lock, __u32 mode)
587 LDLM_DEBUG(lock, "ldlm_lock_decref(%s)", ldlm_lockname[mode]);
588 if (mode & (LCK_NL | LCK_CR | LCK_PR)) {
589 LASSERT(lock->l_readers > 0);
592 if (mode & (LCK_EX | LCK_CW | LCK_PW | LCK_GROUP)) {
593 LASSERT(lock->l_writers > 0);
597 LDLM_LOCK_PUT(lock); /* matches the ldlm_lock_get in addref */
600 void ldlm_lock_decref_internal(struct ldlm_lock *lock, __u32 mode)
602 struct ldlm_namespace *ns;
605 lock_res_and_lock(lock);
607 ns = lock->l_resource->lr_namespace;
609 ldlm_lock_decref_internal_nolock(lock, mode);
611 if (lock->l_flags & LDLM_FL_LOCAL &&
612 !lock->l_readers && !lock->l_writers) {
613 /* If this is a local lock on a server namespace and this was
614 * the last reference, cancel the lock. */
615 CDEBUG(D_INFO, "forcing cancel of local lock\n");
616 lock->l_flags |= LDLM_FL_CBPENDING;
619 if (!lock->l_readers && !lock->l_writers &&
620 (lock->l_flags & LDLM_FL_CBPENDING)) {
621 /* If we received a blocked AST and this was the last reference,
622 * run the callback. */
623 if (ns->ns_client == LDLM_NAMESPACE_SERVER && lock->l_export)
624 CERROR("FL_CBPENDING set on non-local lock--just a "
627 LDLM_DEBUG(lock, "final decref done on cbpending lock");
629 LDLM_LOCK_GET(lock); /* dropped by bl thread */
630 ldlm_lock_remove_from_lru(lock);
631 unlock_res_and_lock(lock);
632 if ((lock->l_flags & LDLM_FL_ATOMIC_CB) ||
633 ldlm_bl_to_thread_lock(ns, NULL, lock) != 0)
634 ldlm_handle_bl_callback(ns, NULL, lock);
635 } else if (ns->ns_client == LDLM_NAMESPACE_CLIENT &&
636 !lock->l_readers && !lock->l_writers &&
637 !(lock->l_flags & LDLM_FL_NO_LRU)) {
638 /* If this is a client-side namespace and this was the last
639 * reference, put it on the LRU. */
640 ldlm_lock_add_to_lru(lock);
641 unlock_res_and_lock(lock);
642 /* Call ldlm_cancel_lru() only if EARLY_CANCEL and LRU RESIZE
643 * are not supported by the server, otherwise, it is done on
645 if (!exp_connect_cancelset(lock->l_conn_export) &&
646 !exp_connect_lru_resize(lock->l_conn_export))
647 ldlm_cancel_lru(ns, 0, LDLM_ASYNC);
649 unlock_res_and_lock(lock);
655 void ldlm_lock_decref(struct lustre_handle *lockh, __u32 mode)
657 struct ldlm_lock *lock = __ldlm_handle2lock(lockh, 0);
658 LASSERTF(lock != NULL, "Non-existing lock: "LPX64"\n", lockh->cookie);
659 ldlm_lock_decref_internal(lock, mode);
663 /* This will drop a lock reference and mark it for destruction, but will not
664 * necessarily cancel the lock before returning. */
665 void ldlm_lock_decref_and_cancel(struct lustre_handle *lockh, __u32 mode)
667 struct ldlm_lock *lock = __ldlm_handle2lock(lockh, 0);
670 LASSERT(lock != NULL);
672 LDLM_DEBUG(lock, "ldlm_lock_decref(%s)", ldlm_lockname[mode]);
673 lock_res_and_lock(lock);
674 lock->l_flags |= LDLM_FL_CBPENDING;
675 unlock_res_and_lock(lock);
676 ldlm_lock_decref_internal(lock, mode);
681 * search_granted_lock
684 * Finds a position to insert the new lock.
686 * queue [input]: the granted list where search acts on;
687 * req [input]: the lock whose position to be located;
688 * lockp [output]: the position where the lock should be inserted before, or
689 * NULL indicating @req should be appended to @queue.
691 * Bit-masks combination of following values indicating in which way the
692 * lock need to be inserted.
693 * - LDLM_JOIN_NONE: noting about skip list needs to be fixed;
694 * - LDLM_MODE_JOIN_RIGHT: @req needs join right becoming the head of a
696 * - LDLM_POLICY_JOIN_RIGHT: @req needs join right becoming the head of
699 * - ldlm_grant_lock_with_skiplist
701 static int search_granted_lock(struct list_head *queue,
702 struct ldlm_lock *req,
703 struct ldlm_lock **lockp)
705 struct list_head *tmp, *tmp_tail;
706 struct ldlm_lock *lock, *mode_head_lock;
707 int rc = LDLM_JOIN_NONE;
710 list_for_each(tmp, queue) {
711 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
713 if (lock->l_req_mode != req->l_req_mode) {
714 if (LDLM_SL_HEAD(&lock->l_sl_mode))
715 tmp = &list_entry(lock->l_sl_mode.next,
717 l_sl_mode)->l_res_link;
721 /* found the same mode group */
722 if (lock->l_resource->lr_type == LDLM_PLAIN) {
724 rc = LDLM_MODE_JOIN_RIGHT;
726 } else if (lock->l_resource->lr_type == LDLM_IBITS) {
728 if (LDLM_SL_HEAD(&lock->l_sl_mode))
729 tmp_tail = &list_entry(lock->l_sl_mode.next,
731 l_sl_mode)->l_res_link;
732 mode_head_lock = lock;
734 if (lock->l_policy_data.l_inodebits.bits ==
735 req->l_policy_data.l_inodebits.bits) {
736 /* matched policy lock is found */
738 rc |= LDLM_POLICY_JOIN_RIGHT;
740 /* if the policy group head is also a
741 * mode group head or a single mode
743 if (LDLM_SL_HEAD(&lock->l_sl_mode) ||
745 LDLM_SL_EMPTY(&lock->l_sl_mode)))
746 rc |= LDLM_MODE_JOIN_RIGHT;
750 if (LDLM_SL_HEAD(&lock->l_sl_policy))
751 tmp = &list_entry(lock->l_sl_policy.next,
753 l_sl_policy)->l_res_link;
759 lock = list_entry(tmp, struct ldlm_lock,
761 } /* for all locks in the matched mode group */
763 /* no matched policy group is found, insert before
764 * the mode group head lock */
765 *lockp = mode_head_lock;
766 rc = LDLM_MODE_JOIN_RIGHT;
769 LDLM_ERROR(lock, "is not LDLM_PLAIN or LDLM_IBITS lock");
774 /* no matched mode group is found, append to the end */
782 static void ldlm_granted_list_add_lock(struct ldlm_lock *lock,
783 struct ldlm_lock *lockp,
786 struct ldlm_resource *res = lock->l_resource;
789 LASSERT(lockp || join == LDLM_JOIN_NONE);
791 check_res_locked(res);
793 ldlm_resource_dump(D_OTHER, res);
794 CDEBUG(D_OTHER, "About to add this lock:\n");
795 ldlm_lock_dump(D_OTHER, lock, 0);
797 if (lock->l_destroyed) {
798 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
802 LASSERT(list_empty(&lock->l_res_link));
805 list_add_tail(&lock->l_res_link, &lock->l_resource->lr_granted);
806 else if ((join & LDLM_MODE_JOIN_LEFT) || (join & LDLM_POLICY_JOIN_LEFT))
807 list_add(&lock->l_res_link, &lockp->l_res_link);
809 list_add_tail(&lock->l_res_link, &lockp->l_res_link);
812 if (join & LDLM_MODE_JOIN_RIGHT) {
813 LASSERT(! LDLM_SL_TAIL(&lockp->l_sl_mode));
814 if (LDLM_SL_EMPTY(&lockp->l_sl_mode)) {
815 lock->l_sl_mode.next = &lockp->l_sl_mode;
816 lockp->l_sl_mode.prev = &lock->l_sl_mode;
817 } else if (LDLM_SL_HEAD(&lockp->l_sl_mode)) {
818 lock->l_sl_mode.next = lockp->l_sl_mode.next;
819 lockp->l_sl_mode.next = NULL;
820 lock->l_sl_mode.next->prev = &lock->l_sl_mode;
822 } else if (join & LDLM_MODE_JOIN_LEFT) {
823 LASSERT(! LDLM_SL_HEAD(&lockp->l_sl_mode));
824 if (LDLM_SL_EMPTY(&lockp->l_sl_mode)) {
825 lock->l_sl_mode.prev = &lockp->l_sl_mode;
826 lockp->l_sl_mode.next = &lock->l_sl_mode;
827 } else if (LDLM_SL_TAIL(&lockp->l_sl_mode)) {
828 lock->l_sl_mode.prev = lockp->l_sl_mode.prev;
829 lockp->l_sl_mode.prev = NULL;
830 lock->l_sl_mode.prev->next = &lock->l_sl_mode;
834 if (join & LDLM_POLICY_JOIN_RIGHT) {
835 LASSERT(! LDLM_SL_TAIL(&lockp->l_sl_policy));
836 if (LDLM_SL_EMPTY(&lockp->l_sl_policy)) {
837 lock->l_sl_policy.next = &lockp->l_sl_policy;
838 lockp->l_sl_policy.prev = &lock->l_sl_policy;
839 } else if (LDLM_SL_HEAD(&lockp->l_sl_policy)) {
840 lock->l_sl_policy.next = lockp->l_sl_policy.next;
841 lockp->l_sl_policy.next = NULL;
842 lock->l_sl_policy.next->prev = &lock->l_sl_policy;
844 } else if (join & LDLM_POLICY_JOIN_LEFT) {
845 LASSERT(! LDLM_SL_HEAD(&lockp->l_sl_policy));
846 if (LDLM_SL_EMPTY(&lockp->l_sl_policy)) {
847 lock->l_sl_policy.prev = &lockp->l_sl_policy;
848 lockp->l_sl_policy.next = &lock->l_sl_policy;
849 } else if (LDLM_SL_TAIL(&lockp->l_sl_policy)) {
850 lock->l_sl_policy.prev = lockp->l_sl_policy.prev;
851 lockp->l_sl_policy.prev = NULL;
852 lock->l_sl_policy.prev->next = &lock->l_sl_policy;
859 static void ldlm_grant_lock_with_skiplist(struct ldlm_lock *lock)
861 int join = LDLM_JOIN_NONE;
862 struct ldlm_lock *lockp = NULL;
865 LASSERT(lock->l_req_mode == lock->l_granted_mode);
867 join = search_granted_lock(&lock->l_resource->lr_granted, lock, &lockp);
868 ldlm_granted_list_add_lock(lock, lockp, join);
873 * - ldlm_lock_enqueue
874 * - ldlm_reprocess_queue
875 * - ldlm_lock_convert
877 * must be called with lr_lock held
879 void ldlm_grant_lock(struct ldlm_lock *lock, struct list_head *work_list)
881 struct ldlm_resource *res = lock->l_resource;
884 check_res_locked(res);
886 lock->l_granted_mode = lock->l_req_mode;
887 if (res->lr_type == LDLM_PLAIN || res->lr_type == LDLM_IBITS)
888 ldlm_grant_lock_with_skiplist(lock);
890 ldlm_resource_add_lock(res, &res->lr_granted, lock);
892 if (lock->l_granted_mode < res->lr_most_restr)
893 res->lr_most_restr = lock->l_granted_mode;
895 if (work_list && lock->l_completion_ast != NULL)
896 ldlm_add_ast_work_item(lock, NULL, work_list);
898 ldlm_pool_add(&res->lr_namespace->ns_pool, lock);
902 /* returns a referenced lock or NULL. See the flag descriptions below, in the
903 * comment above ldlm_lock_match */
904 static struct ldlm_lock *search_queue(struct list_head *queue, ldlm_mode_t mode,
905 ldlm_policy_data_t *policy,
906 struct ldlm_lock *old_lock, int flags)
908 struct ldlm_lock *lock;
909 struct list_head *tmp;
911 list_for_each(tmp, queue) {
912 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
914 if (lock == old_lock)
917 /* llite sometimes wants to match locks that will be
918 * canceled when their users drop, but we allow it to match
919 * if it passes in CBPENDING and the lock still has users.
920 * this is generally only going to be used by children
921 * whose parents already hold a lock so forward progress
922 * can still happen. */
923 if (lock->l_flags & LDLM_FL_CBPENDING &&
924 !(flags & LDLM_FL_CBPENDING))
926 if (lock->l_flags & LDLM_FL_CBPENDING &&
927 lock->l_readers == 0 && lock->l_writers == 0)
930 if (!(lock->l_req_mode & mode))
933 if (lock->l_resource->lr_type == LDLM_EXTENT &&
934 (lock->l_policy_data.l_extent.start >
935 policy->l_extent.start ||
936 lock->l_policy_data.l_extent.end < policy->l_extent.end))
939 if (unlikely(mode == LCK_GROUP) &&
940 lock->l_resource->lr_type == LDLM_EXTENT &&
941 lock->l_policy_data.l_extent.gid != policy->l_extent.gid)
944 /* We match if we have existing lock with same or wider set
946 if (lock->l_resource->lr_type == LDLM_IBITS &&
947 ((lock->l_policy_data.l_inodebits.bits &
948 policy->l_inodebits.bits) !=
949 policy->l_inodebits.bits))
952 if (lock->l_destroyed || (lock->l_flags & LDLM_FL_FAILED))
955 if ((flags & LDLM_FL_LOCAL_ONLY) &&
956 !(lock->l_flags & LDLM_FL_LOCAL))
959 if (flags & LDLM_FL_TEST_LOCK) {
961 ldlm_lock_touch_in_lru(lock);
963 ldlm_lock_addref_internal_nolock(lock, mode);
971 void ldlm_lock_allow_match(struct ldlm_lock *lock)
973 lock_res_and_lock(lock);
974 lock->l_flags |= LDLM_FL_LVB_READY;
975 cfs_waitq_signal(&lock->l_waitq);
976 unlock_res_and_lock(lock);
979 /* Can be called in two ways:
981 * If 'ns' is NULL, then lockh describes an existing lock that we want to look
982 * for a duplicate of.
984 * Otherwise, all of the fields must be filled in, to match against.
986 * If 'flags' contains LDLM_FL_LOCAL_ONLY, then only match local locks on the
987 * server (ie, connh is NULL)
988 * If 'flags' contains LDLM_FL_BLOCK_GRANTED, then only locks on the granted
989 * list will be considered
990 * If 'flags' contains LDLM_FL_CBPENDING, then locks that have been marked
991 * to be canceled can still be matched as long as they still have reader
992 * or writer refernces
993 * If 'flags' contains LDLM_FL_TEST_LOCK, then don't actually reference a lock,
994 * just tell us if we would have matched.
996 * Returns 1 if it finds an already-existing lock that is compatible; in this
997 * case, lockh is filled in with a addref()ed lock
999 int ldlm_lock_match(struct ldlm_namespace *ns, int flags,
1000 struct ldlm_res_id *res_id, ldlm_type_t type,
1001 ldlm_policy_data_t *policy, ldlm_mode_t mode,
1002 struct lustre_handle *lockh)
1004 struct ldlm_resource *res;
1005 struct ldlm_lock *lock, *old_lock = NULL;
1010 old_lock = ldlm_handle2lock(lockh);
1013 ns = old_lock->l_resource->lr_namespace;
1014 res_id = &old_lock->l_resource->lr_name;
1015 type = old_lock->l_resource->lr_type;
1016 mode = old_lock->l_req_mode;
1019 res = ldlm_resource_get(ns, NULL, *res_id, type, 0);
1021 LASSERT(old_lock == NULL);
1027 lock = search_queue(&res->lr_granted, mode, policy, old_lock, flags);
1030 if (flags & LDLM_FL_BLOCK_GRANTED)
1032 lock = search_queue(&res->lr_converting, mode, policy, old_lock, flags);
1035 lock = search_queue(&res->lr_waiting, mode, policy, old_lock, flags);
1042 ldlm_resource_putref(res);
1045 ldlm_lock2handle(lock, lockh);
1046 if ((flags & LDLM_FL_LVB_READY) && (!(lock->l_flags & LDLM_FL_LVB_READY))) {
1047 struct l_wait_info lwi;
1048 if (lock->l_completion_ast) {
1049 int err = lock->l_completion_ast(lock,
1050 LDLM_FL_WAIT_NOREPROC,
1053 if (flags & LDLM_FL_TEST_LOCK)
1054 LDLM_LOCK_PUT(lock);
1056 ldlm_lock_decref_internal(lock, mode);
1062 lwi = LWI_TIMEOUT_INTR(cfs_time_seconds(obd_timeout), NULL,
1063 LWI_ON_SIGNAL_NOOP, NULL);
1065 /* XXX FIXME see comment on CAN_MATCH in lustre_dlm.h */
1066 l_wait_event(lock->l_waitq,
1067 (lock->l_flags & LDLM_FL_LVB_READY), &lwi);
1072 LDLM_DEBUG(lock, "matched ("LPU64" "LPU64")",
1073 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1074 res_id->name[2] : policy->l_extent.start,
1075 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1076 res_id->name[3] : policy->l_extent.end);
1077 } else if (!(flags & LDLM_FL_TEST_LOCK)) {/*less verbose for test-only*/
1078 LDLM_DEBUG_NOLOCK("not matched ns %p type %u mode %u res "
1079 LPU64"/"LPU64" ("LPU64" "LPU64")", ns,
1080 type, mode, res_id->name[0], res_id->name[1],
1081 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1082 res_id->name[2] :policy->l_extent.start,
1083 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1084 res_id->name[3] : policy->l_extent.end);
1087 LDLM_LOCK_PUT(old_lock);
1088 if (flags & LDLM_FL_TEST_LOCK && rc)
1089 LDLM_LOCK_PUT(lock);
1094 /* Returns a referenced lock */
1095 struct ldlm_lock *ldlm_lock_create(struct ldlm_namespace *ns,
1096 struct ldlm_res_id res_id, ldlm_type_t type,
1098 ldlm_blocking_callback blocking,
1099 ldlm_completion_callback completion,
1100 ldlm_glimpse_callback glimpse,
1101 void *data, __u32 lvb_len)
1103 struct ldlm_lock *lock;
1104 struct ldlm_resource *res;
1107 res = ldlm_resource_get(ns, NULL, res_id, type, 1);
1111 lock = ldlm_lock_new(res);
1112 ldlm_resource_putref(res);
1117 lock->l_req_mode = mode;
1118 lock->l_ast_data = data;
1119 lock->l_blocking_ast = blocking;
1120 lock->l_completion_ast = completion;
1121 lock->l_glimpse_ast = glimpse;
1122 lock->l_pid = cfs_curproc_pid();
1125 lock->l_lvb_len = lvb_len;
1126 OBD_ALLOC(lock->l_lvb_data, lvb_len);
1127 if (lock->l_lvb_data == NULL) {
1128 OBD_SLAB_FREE(lock, ldlm_lock_slab, sizeof(*lock));
1136 ldlm_error_t ldlm_lock_enqueue(struct ldlm_namespace *ns,
1137 struct ldlm_lock **lockp,
1138 void *cookie, int *flags)
1140 struct ldlm_lock *lock = *lockp;
1141 struct ldlm_resource *res = lock->l_resource;
1142 int local = res->lr_namespace->ns_client;
1143 ldlm_processing_policy policy;
1144 ldlm_error_t rc = ELDLM_OK;
1147 do_gettimeofday(&lock->l_enqueued_time);
1148 /* policies are not executed on the client or during replay */
1149 if ((*flags & (LDLM_FL_HAS_INTENT|LDLM_FL_REPLAY)) == LDLM_FL_HAS_INTENT
1150 && !local && ns->ns_policy) {
1151 rc = ns->ns_policy(ns, lockp, cookie, lock->l_req_mode, *flags,
1153 if (rc == ELDLM_LOCK_REPLACED) {
1154 /* The lock that was returned has already been granted,
1155 * and placed into lockp. If it's not the same as the
1156 * one we passed in, then destroy the old one and our
1157 * work here is done. */
1158 if (lock != *lockp) {
1159 ldlm_lock_destroy(lock);
1160 LDLM_LOCK_PUT(lock);
1162 *flags |= LDLM_FL_LOCK_CHANGED;
1164 } else if (rc != ELDLM_OK ||
1165 (rc == ELDLM_OK && (*flags & LDLM_FL_INTENT_ONLY))) {
1166 ldlm_lock_destroy(lock);
1171 lock_res_and_lock(lock);
1172 if (local && lock->l_req_mode == lock->l_granted_mode) {
1173 /* The server returned a blocked lock, but it was granted before
1174 * we got a chance to actually enqueue it. We don't need to do
1176 *flags &= ~(LDLM_FL_BLOCK_GRANTED |
1177 LDLM_FL_BLOCK_CONV | LDLM_FL_BLOCK_WAIT);
1178 GOTO(out, ELDLM_OK);
1181 /* Some flags from the enqueue want to make it into the AST, via the
1182 * lock's l_flags. */
1183 lock->l_flags |= *flags & LDLM_AST_DISCARD_DATA;
1185 /* This distinction between local lock trees is very important; a client
1186 * namespace only has information about locks taken by that client, and
1187 * thus doesn't have enough information to decide for itself if it can
1188 * be granted (below). In this case, we do exactly what the server
1189 * tells us to do, as dictated by the 'flags'.
1191 * We do exactly the same thing during recovery, when the server is
1192 * more or less trusting the clients not to lie.
1194 * FIXME (bug 268): Detect obvious lies by checking compatibility in
1195 * granted/converting queues. */
1196 ldlm_resource_unlink_lock(lock);
1198 if (*flags & LDLM_FL_BLOCK_CONV)
1199 ldlm_resource_add_lock(res, &res->lr_converting, lock);
1200 else if (*flags & (LDLM_FL_BLOCK_WAIT | LDLM_FL_BLOCK_GRANTED))
1201 ldlm_resource_add_lock(res, &res->lr_waiting, lock);
1203 ldlm_grant_lock(lock, NULL);
1204 GOTO(out, ELDLM_OK);
1205 } else if (*flags & LDLM_FL_REPLAY) {
1206 if (*flags & LDLM_FL_BLOCK_CONV) {
1207 ldlm_resource_add_lock(res, &res->lr_converting, lock);
1208 GOTO(out, ELDLM_OK);
1209 } else if (*flags & LDLM_FL_BLOCK_WAIT) {
1210 ldlm_resource_add_lock(res, &res->lr_waiting, lock);
1211 GOTO(out, ELDLM_OK);
1212 } else if (*flags & LDLM_FL_BLOCK_GRANTED) {
1213 ldlm_grant_lock(lock, NULL);
1214 GOTO(out, ELDLM_OK);
1216 /* If no flags, fall through to normal enqueue path. */
1219 policy = ldlm_processing_policy_table[res->lr_type];
1220 policy(lock, flags, 1, &rc, NULL);
1223 unlock_res_and_lock(lock);
1227 /* Must be called with namespace taken: queue is waiting or converting. */
1228 int ldlm_reprocess_queue(struct ldlm_resource *res, struct list_head *queue,
1229 struct list_head *work_list)
1231 struct list_head *tmp, *pos;
1232 ldlm_processing_policy policy;
1234 int rc = LDLM_ITER_CONTINUE;
1238 check_res_locked(res);
1240 policy = ldlm_processing_policy_table[res->lr_type];
1243 list_for_each_safe(tmp, pos, queue) {
1244 struct ldlm_lock *pending;
1245 pending = list_entry(tmp, struct ldlm_lock, l_res_link);
1247 CDEBUG(D_INFO, "Reprocessing lock %p\n", pending);
1250 rc = policy(pending, &flags, 0, &err, work_list);
1251 if (rc != LDLM_ITER_CONTINUE)
1258 /* Helper function for pair ldlm_run_{bl,cp}_ast_work().
1260 * Send an existing rpc set specified by @arg->set and then
1261 * destroy it. Create new one if @do_create flag is set. */
1263 ldlm_send_and_maybe_create_set(struct ldlm_cb_set_arg *arg, int do_create)
1267 rc = ptlrpc_set_wait(arg->set);
1268 if (arg->type == LDLM_BL_CALLBACK)
1269 OBD_FAIL_TIMEOUT(OBD_FAIL_LDLM_GLIMPSE, 2);
1270 ptlrpc_set_destroy(arg->set);
1273 arg->set = ptlrpc_prep_set();
1276 int ldlm_run_bl_ast_work(struct list_head *rpc_list)
1278 struct ldlm_cb_set_arg arg;
1279 struct list_head *tmp, *pos;
1280 struct ldlm_lock_desc d;
1285 arg.set = ptlrpc_prep_set();
1286 atomic_set(&arg.restart, 0);
1287 arg.type = LDLM_BL_CALLBACK;
1290 list_for_each_safe(tmp, pos, rpc_list) {
1291 struct ldlm_lock *lock =
1292 list_entry(tmp, struct ldlm_lock, l_bl_ast);
1294 /* nobody should touch l_bl_ast */
1295 lock_res_and_lock(lock);
1296 list_del_init(&lock->l_bl_ast);
1298 LASSERT(lock->l_flags & LDLM_FL_AST_SENT);
1299 LASSERT(lock->l_bl_ast_run == 0);
1300 LASSERT(lock->l_blocking_lock);
1301 lock->l_bl_ast_run++;
1302 unlock_res_and_lock(lock);
1304 ldlm_lock2desc(lock->l_blocking_lock, &d);
1306 LDLM_LOCK_PUT(lock->l_blocking_lock);
1307 lock->l_blocking_lock = NULL;
1308 rc = lock->l_blocking_ast(lock, &d, (void *)&arg,
1310 LDLM_LOCK_PUT(lock);
1313 /* Send the request set if it exceeds the PARALLEL_AST_LIMIT,
1314 * and create a new set for requests that remained in
1316 if (unlikely(ast_count == PARALLEL_AST_LIMIT)) {
1317 ldlm_send_and_maybe_create_set(&arg, 1);
1323 ldlm_send_and_maybe_create_set(&arg, 0);
1325 /* In case when number of ASTs is multiply of
1326 * PARALLEL_AST_LIMIT or @rpc_list was initially empty,
1327 * @arg.set must be destroyed here, otherwise we get
1328 * write memory leaking. */
1329 ptlrpc_set_destroy(arg.set);
1331 RETURN(atomic_read(&arg.restart) ? -ERESTART : 0);
1334 int ldlm_run_cp_ast_work(struct list_head *rpc_list)
1336 struct ldlm_cb_set_arg arg;
1337 struct list_head *tmp, *pos;
1342 arg.set = ptlrpc_prep_set();
1343 atomic_set(&arg.restart, 0);
1344 arg.type = LDLM_CP_CALLBACK;
1346 /* It's possible to receive a completion AST before we've set
1347 * the l_completion_ast pointer: either because the AST arrived
1348 * before the reply, or simply because there's a small race
1349 * window between receiving the reply and finishing the local
1350 * enqueue. (bug 842)
1352 * This can't happen with the blocking_ast, however, because we
1353 * will never call the local blocking_ast until we drop our
1354 * reader/writer reference, which we won't do until we get the
1355 * reply and finish enqueueing. */
1358 list_for_each_safe(tmp, pos, rpc_list) {
1359 struct ldlm_lock *lock =
1360 list_entry(tmp, struct ldlm_lock, l_cp_ast);
1362 /* nobody should touch l_cp_ast */
1363 lock_res_and_lock(lock);
1364 list_del_init(&lock->l_cp_ast);
1365 LASSERT(lock->l_flags & LDLM_FL_CP_REQD);
1366 lock->l_flags &= ~LDLM_FL_CP_REQD;
1367 unlock_res_and_lock(lock);
1369 if (lock->l_completion_ast != NULL) {
1370 rc = lock->l_completion_ast(lock, 0, (void *)&arg);
1373 LDLM_LOCK_PUT(lock);
1375 /* Send the request set if it exceeds the PARALLEL_AST_LIMIT,
1376 * and create a new set for requests that remained in
1378 if (unlikely(ast_count == PARALLEL_AST_LIMIT)) {
1379 ldlm_send_and_maybe_create_set(&arg, 1);
1385 ldlm_send_and_maybe_create_set(&arg, 0);
1387 /* In case when number of ASTs is multiply of
1388 * PARALLEL_AST_LIMIT or @rpc_list was initially empty,
1389 * @arg.set must be destroyed here, otherwise we get
1390 * write memory leaking. */
1391 ptlrpc_set_destroy(arg.set);
1393 RETURN(atomic_read(&arg.restart) ? -ERESTART : 0);
1396 static int reprocess_one_queue(struct ldlm_resource *res, void *closure)
1398 ldlm_reprocess_all(res);
1399 return LDLM_ITER_CONTINUE;
1402 void ldlm_reprocess_all_ns(struct ldlm_namespace *ns)
1404 struct list_head *tmp;
1408 spin_lock(&ns->ns_hash_lock);
1409 for (i = 0; i < RES_HASH_SIZE; i++) {
1410 tmp = ns->ns_hash[i].next;
1411 while (tmp != &(ns->ns_hash[i])) {
1412 struct ldlm_resource *res =
1413 list_entry(tmp, struct ldlm_resource, lr_hash);
1415 ldlm_resource_getref(res);
1416 spin_unlock(&ns->ns_hash_lock);
1418 rc = reprocess_one_queue(res, NULL);
1420 spin_lock(&ns->ns_hash_lock);
1422 ldlm_resource_putref_locked(res);
1424 if (rc == LDLM_ITER_STOP)
1429 spin_unlock(&ns->ns_hash_lock);
1433 void ldlm_reprocess_all(struct ldlm_resource *res)
1435 struct list_head rpc_list = LIST_HEAD_INIT(rpc_list);
1439 /* Local lock trees don't get reprocessed. */
1440 if (res->lr_namespace->ns_client) {
1447 rc = ldlm_reprocess_queue(res, &res->lr_converting, &rpc_list);
1448 if (rc == LDLM_ITER_CONTINUE)
1449 ldlm_reprocess_queue(res, &res->lr_waiting, &rpc_list);
1452 rc = ldlm_run_cp_ast_work(&rpc_list);
1453 if (rc == -ERESTART) {
1454 LASSERT(list_empty(&rpc_list));
1460 void ldlm_cancel_callback(struct ldlm_lock *lock)
1462 check_res_locked(lock->l_resource);
1463 if (!(lock->l_flags & LDLM_FL_CANCEL)) {
1464 lock->l_flags |= LDLM_FL_CANCEL;
1465 if (lock->l_blocking_ast) {
1466 // l_check_no_ns_lock(ns);
1467 unlock_res_and_lock(lock);
1468 lock->l_blocking_ast(lock, NULL, lock->l_ast_data,
1470 lock_res_and_lock(lock);
1472 LDLM_DEBUG(lock, "no blocking ast");
1475 lock->l_flags |= LDLM_FL_BL_DONE;
1478 void ldlm_unlink_lock_skiplist(struct ldlm_lock *req)
1480 struct ldlm_lock *lock;
1482 if (req->l_resource->lr_type != LDLM_PLAIN &&
1483 req->l_resource->lr_type != LDLM_IBITS)
1486 if (LDLM_SL_HEAD(&req->l_sl_mode)) {
1487 lock = list_entry(req->l_res_link.next, struct ldlm_lock,
1489 if (req->l_sl_mode.next == &lock->l_sl_mode) {
1490 lock->l_sl_mode.prev = NULL;
1492 lock->l_sl_mode.next = req->l_sl_mode.next;
1493 lock->l_sl_mode.next->prev = &lock->l_sl_mode;
1495 req->l_sl_mode.next = NULL;
1496 } else if (LDLM_SL_TAIL(&req->l_sl_mode)) {
1497 lock = list_entry(req->l_res_link.prev, struct ldlm_lock,
1499 if (req->l_sl_mode.prev == &lock->l_sl_mode) {
1500 lock->l_sl_mode.next = NULL;
1502 lock->l_sl_mode.prev = req->l_sl_mode.prev;
1503 lock->l_sl_mode.prev->next = &lock->l_sl_mode;
1505 req->l_sl_mode.prev = NULL;
1508 if (LDLM_SL_HEAD(&req->l_sl_policy)) {
1509 lock = list_entry(req->l_res_link.next, struct ldlm_lock,
1511 if (req->l_sl_policy.next == &lock->l_sl_policy) {
1512 lock->l_sl_policy.prev = NULL;
1514 lock->l_sl_policy.next = req->l_sl_policy.next;
1515 lock->l_sl_policy.next->prev = &lock->l_sl_policy;
1517 req->l_sl_policy.next = NULL;
1518 } else if (LDLM_SL_TAIL(&req->l_sl_policy)) {
1519 lock = list_entry(req->l_res_link.prev, struct ldlm_lock,
1521 if (req->l_sl_policy.prev == &lock->l_sl_policy) {
1522 lock->l_sl_policy.next = NULL;
1524 lock->l_sl_policy.prev = req->l_sl_policy.prev;
1525 lock->l_sl_policy.prev->next = &lock->l_sl_policy;
1527 req->l_sl_policy.prev = NULL;
1531 void ldlm_lock_cancel(struct ldlm_lock *lock)
1533 struct ldlm_resource *res;
1534 struct ldlm_namespace *ns;
1537 lock_res_and_lock(lock);
1539 res = lock->l_resource;
1540 ns = res->lr_namespace;
1542 /* Please do not, no matter how tempting, remove this LBUG without
1543 * talking to me first. -phik */
1544 if (lock->l_readers || lock->l_writers) {
1545 LDLM_ERROR(lock, "lock still has references");
1549 ldlm_del_waiting_lock(lock);
1551 /* Releases res lock */
1552 ldlm_cancel_callback(lock);
1554 /* Yes, second time, just in case it was added again while we were
1555 running with no res lock in ldlm_cancel_callback */
1556 ldlm_del_waiting_lock(lock);
1557 ldlm_resource_unlink_lock(lock);
1558 ldlm_lock_destroy_nolock(lock);
1560 if (lock->l_granted_mode == lock->l_req_mode)
1561 ldlm_pool_del(&ns->ns_pool, lock);
1563 /* Make sure we will not be called again for same lock what is possible
1564 * if not to zero out lock->l_granted_mode */
1565 lock->l_granted_mode = 0;
1566 unlock_res_and_lock(lock);
1571 int ldlm_lock_set_data(struct lustre_handle *lockh, void *data)
1573 struct ldlm_lock *lock = ldlm_handle2lock(lockh);
1579 lock->l_ast_data = data;
1580 LDLM_LOCK_PUT(lock);
1584 void ldlm_cancel_locks_for_export(struct obd_export *exp)
1586 struct ldlm_lock *lock;
1587 struct ldlm_resource *res;
1589 spin_lock(&exp->exp_ldlm_data.led_lock);
1590 while(!list_empty(&exp->exp_ldlm_data.led_held_locks)) {
1591 lock = list_entry(exp->exp_ldlm_data.led_held_locks.next,
1592 struct ldlm_lock, l_export_chain);
1593 res = ldlm_resource_getref(lock->l_resource);
1594 LDLM_LOCK_GET(lock);
1595 spin_unlock(&exp->exp_ldlm_data.led_lock);
1597 LDLM_DEBUG(lock, "export %p", exp);
1598 ldlm_res_lvbo_update(res, NULL, 0, 1);
1600 ldlm_lock_cancel(lock);
1601 ldlm_reprocess_all(res);
1603 ldlm_resource_putref(res);
1604 LDLM_LOCK_PUT(lock);
1605 spin_lock(&exp->exp_ldlm_data.led_lock);
1607 spin_unlock(&exp->exp_ldlm_data.led_lock);
1610 struct ldlm_resource *ldlm_lock_convert(struct ldlm_lock *lock, int new_mode,
1613 struct list_head rpc_list = LIST_HEAD_INIT(rpc_list);
1614 struct ldlm_resource *res;
1615 struct ldlm_namespace *ns;
1618 struct ldlm_lock *mark_lock = NULL;
1619 int join= LDLM_JOIN_NONE;
1623 if (new_mode == lock->l_granted_mode) { // No changes? Just return.
1624 *flags |= LDLM_FL_BLOCK_GRANTED;
1625 RETURN(lock->l_resource);
1628 LASSERTF(new_mode == LCK_PW && lock->l_granted_mode == LCK_PR,
1629 "new_mode %u, granted %u\n", new_mode, lock->l_granted_mode);
1631 lock_res_and_lock(lock);
1633 res = lock->l_resource;
1634 ns = res->lr_namespace;
1636 old_mode = lock->l_req_mode;
1637 lock->l_req_mode = new_mode;
1638 if (res->lr_type == LDLM_PLAIN || res->lr_type == LDLM_IBITS) {
1639 /* remember the lock position where the lock might be
1640 * added back to the granted list later and also
1641 * remember the join mode for skiplist fixing. */
1642 if (LDLM_SL_HEAD(&lock->l_sl_mode))
1643 join = LDLM_MODE_JOIN_RIGHT;
1644 else if (LDLM_SL_TAIL(&lock->l_sl_mode))
1645 join = LDLM_MODE_JOIN_LEFT;
1646 if (LDLM_SL_HEAD(&lock->l_sl_policy))
1647 join |= LDLM_POLICY_JOIN_RIGHT;
1648 else if (LDLM_SL_TAIL(&lock->l_sl_policy))
1649 join |= LDLM_POLICY_JOIN_LEFT;
1651 LASSERT(!((join & LDLM_MODE_JOIN_RIGHT) &&
1652 (join & LDLM_POLICY_JOIN_LEFT)));
1653 LASSERT(!((join & LDLM_MODE_JOIN_LEFT) &&
1654 (join & LDLM_POLICY_JOIN_RIGHT)));
1656 if ((join & LDLM_MODE_JOIN_LEFT) ||
1657 (join & LDLM_POLICY_JOIN_LEFT))
1658 mark_lock = list_entry(lock->l_res_link.prev,
1659 struct ldlm_lock, l_res_link);
1660 else if (lock->l_res_link.next != &res->lr_granted)
1661 mark_lock = list_entry(lock->l_res_link.next,
1662 struct ldlm_lock, l_res_link);
1664 ldlm_resource_unlink_lock(lock);
1666 /* If this is a local resource, put it on the appropriate list. */
1667 if (res->lr_namespace->ns_client) {
1668 if (*flags & (LDLM_FL_BLOCK_CONV | LDLM_FL_BLOCK_GRANTED)) {
1669 ldlm_resource_add_lock(res, &res->lr_converting, lock);
1671 /* This should never happen, because of the way the
1672 * server handles conversions. */
1673 LDLM_ERROR(lock, "Erroneous flags %d on local lock\n",
1677 ldlm_grant_lock(lock, &rpc_list);
1679 /* FIXME: completion handling not with ns_lock held ! */
1680 if (lock->l_completion_ast)
1681 lock->l_completion_ast(lock, 0, NULL);
1685 ldlm_processing_policy policy;
1686 policy = ldlm_processing_policy_table[res->lr_type];
1687 rc = policy(lock, &pflags, 0, &err, &rpc_list);
1688 if (rc == LDLM_ITER_STOP) {
1689 lock->l_req_mode = old_mode;
1690 ldlm_granted_list_add_lock(lock, mark_lock, join);
1693 *flags |= LDLM_FL_BLOCK_GRANTED;
1697 unlock_res_and_lock(lock);
1700 ldlm_run_cp_ast_work(&rpc_list);
1704 void ldlm_lock_dump(int level, struct ldlm_lock *lock, int pos)
1706 struct obd_device *obd = NULL;
1708 if (!((libcfs_debug | D_ERROR) & level))
1712 CDEBUG(level, " NULL LDLM lock\n");
1716 CDEBUG(level," -- Lock dump: %p/"LPX64" (rc: %d) (pos: %d) (pid: %d)\n",
1717 lock, lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
1719 if (lock->l_conn_export != NULL)
1720 obd = lock->l_conn_export->exp_obd;
1721 if (lock->l_export && lock->l_export->exp_connection) {
1722 CDEBUG(level, " Node: NID %s (rhandle: "LPX64")\n",
1723 libcfs_nid2str(lock->l_export->exp_connection->c_peer.nid),
1724 lock->l_remote_handle.cookie);
1725 } else if (obd == NULL) {
1726 CDEBUG(level, " Node: local\n");
1728 struct obd_import *imp = obd->u.cli.cl_import;
1729 CDEBUG(level, " Node: NID %s (rhandle: "LPX64")\n",
1730 libcfs_nid2str(imp->imp_connection->c_peer.nid),
1731 lock->l_remote_handle.cookie);
1733 CDEBUG(level, " Resource: %p ("LPU64"/"LPU64")\n", lock->l_resource,
1734 lock->l_resource->lr_name.name[0],
1735 lock->l_resource->lr_name.name[1]);
1736 CDEBUG(level, " Req mode: %s, grant mode: %s, rc: %u, read: %d, "
1737 "write: %d flags: %#x\n", ldlm_lockname[lock->l_req_mode],
1738 ldlm_lockname[lock->l_granted_mode],
1739 atomic_read(&lock->l_refc), lock->l_readers, lock->l_writers,
1741 if (lock->l_resource->lr_type == LDLM_EXTENT)
1742 CDEBUG(level, " Extent: "LPU64" -> "LPU64
1743 " (req "LPU64"-"LPU64")\n",
1744 lock->l_policy_data.l_extent.start,
1745 lock->l_policy_data.l_extent.end,
1746 lock->l_req_extent.start, lock->l_req_extent.end);
1747 else if (lock->l_resource->lr_type == LDLM_FLOCK)
1748 CDEBUG(level, " Pid: %d Extent: "LPU64" -> "LPU64"\n",
1749 lock->l_policy_data.l_flock.pid,
1750 lock->l_policy_data.l_flock.start,
1751 lock->l_policy_data.l_flock.end);
1752 else if (lock->l_resource->lr_type == LDLM_IBITS)
1753 CDEBUG(level, " Bits: "LPX64"\n",
1754 lock->l_policy_data.l_inodebits.bits);
1757 void ldlm_lock_dump_handle(int level, struct lustre_handle *lockh)
1759 struct ldlm_lock *lock;
1761 if (!((libcfs_debug | D_ERROR) & level))
1764 lock = ldlm_handle2lock(lockh);
1768 ldlm_lock_dump(D_OTHER, lock, 0);
1770 LDLM_LOCK_PUT(lock);
1773 void _ldlm_lock_debug(struct ldlm_lock *lock, __u32 level,
1774 struct libcfs_debug_msg_data *data, const char *fmt,
1778 cfs_debug_limit_state_t *cdls = data->msg_cdls;
1780 va_start(args, fmt);
1781 if (lock->l_resource == NULL) {
1782 libcfs_debug_vmsg2(cdls, data->msg_subsys, level, data->msg_file,
1783 data->msg_fn, data->msg_line, fmt, args,
1784 " ns: \?\? lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
1785 "res: \?\? rrc=\?\? type: \?\?\? flags: %x remote: "
1786 LPX64" expref: %d pid: %u\n", lock,
1787 lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
1788 lock->l_readers, lock->l_writers,
1789 ldlm_lockname[lock->l_granted_mode],
1790 ldlm_lockname[lock->l_req_mode],
1791 lock->l_flags, lock->l_remote_handle.cookie,
1793 atomic_read(&lock->l_export->exp_refcount) : -99,
1799 switch (lock->l_resource->lr_type) {
1801 libcfs_debug_vmsg2(cdls, data->msg_subsys, level, data->msg_file,
1802 data->msg_fn, data->msg_line, fmt, args,
1803 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
1804 "res: "LPU64"/"LPU64" rrc: %d type: %s ["LPU64"->"LPU64
1805 "] (req "LPU64"->"LPU64") flags: %x remote: "LPX64
1806 " expref: %d pid: %u\n",
1807 lock->l_resource->lr_namespace->ns_name, lock,
1808 lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
1809 lock->l_readers, lock->l_writers,
1810 ldlm_lockname[lock->l_granted_mode],
1811 ldlm_lockname[lock->l_req_mode],
1812 lock->l_resource->lr_name.name[0],
1813 lock->l_resource->lr_name.name[1],
1814 atomic_read(&lock->l_resource->lr_refcount),
1815 ldlm_typename[lock->l_resource->lr_type],
1816 lock->l_policy_data.l_extent.start,
1817 lock->l_policy_data.l_extent.end,
1818 lock->l_req_extent.start, lock->l_req_extent.end,
1819 lock->l_flags, lock->l_remote_handle.cookie,
1821 atomic_read(&lock->l_export->exp_refcount) : -99,
1825 libcfs_debug_vmsg2(cdls, data->msg_subsys, level, data->msg_file,
1826 data->msg_fn, data->msg_line, fmt, args,
1827 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
1828 "res: "LPU64"/"LPU64" rrc: %d type: %s pid: %d "
1829 "["LPU64"->"LPU64"] flags: %x remote: "LPX64
1830 " expref: %d pid: %u\n",
1831 lock->l_resource->lr_namespace->ns_name, lock,
1832 lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
1833 lock->l_readers, lock->l_writers,
1834 ldlm_lockname[lock->l_granted_mode],
1835 ldlm_lockname[lock->l_req_mode],
1836 lock->l_resource->lr_name.name[0],
1837 lock->l_resource->lr_name.name[1],
1838 atomic_read(&lock->l_resource->lr_refcount),
1839 ldlm_typename[lock->l_resource->lr_type],
1840 lock->l_policy_data.l_flock.pid,
1841 lock->l_policy_data.l_flock.start,
1842 lock->l_policy_data.l_flock.end,
1843 lock->l_flags, lock->l_remote_handle.cookie,
1845 atomic_read(&lock->l_export->exp_refcount) : -99,
1849 libcfs_debug_vmsg2(cdls, data->msg_subsys, level, data->msg_file,
1850 data->msg_fn, data->msg_line, fmt, args,
1851 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
1852 "res: "LPU64"/"LPU64" bits "LPX64" rrc: %d type: %s "
1853 "flags: %x remote: "LPX64" expref: %d "
1855 lock->l_resource->lr_namespace->ns_name,
1856 lock, lock->l_handle.h_cookie,
1857 atomic_read (&lock->l_refc),
1858 lock->l_readers, lock->l_writers,
1859 ldlm_lockname[lock->l_granted_mode],
1860 ldlm_lockname[lock->l_req_mode],
1861 lock->l_resource->lr_name.name[0],
1862 lock->l_resource->lr_name.name[1],
1863 lock->l_policy_data.l_inodebits.bits,
1864 atomic_read(&lock->l_resource->lr_refcount),
1865 ldlm_typename[lock->l_resource->lr_type],
1866 lock->l_flags, lock->l_remote_handle.cookie,
1868 atomic_read(&lock->l_export->exp_refcount) : -99,
1872 libcfs_debug_vmsg2(cdls, data->msg_subsys, level, data->msg_file,
1873 data->msg_fn, data->msg_line, fmt, args,
1874 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
1875 "res: "LPU64"/"LPU64" rrc: %d type: %s flags: %x "
1876 "remote: "LPX64" expref: %d pid: %u\n",
1877 lock->l_resource->lr_namespace->ns_name,
1878 lock, lock->l_handle.h_cookie,
1879 atomic_read (&lock->l_refc),
1880 lock->l_readers, lock->l_writers,
1881 ldlm_lockname[lock->l_granted_mode],
1882 ldlm_lockname[lock->l_req_mode],
1883 lock->l_resource->lr_name.name[0],
1884 lock->l_resource->lr_name.name[1],
1885 atomic_read(&lock->l_resource->lr_refcount),
1886 ldlm_typename[lock->l_resource->lr_type],
1887 lock->l_flags, lock->l_remote_handle.cookie,
1889 atomic_read(&lock->l_export->exp_refcount) : -99,
1895 EXPORT_SYMBOL(_ldlm_lock_debug);