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 /* lock's skip list pointers fix mode */
41 #define LDLM_JOIN_NONE 0
42 #define LDLM_MODE_JOIN_RIGHT 1
43 #define LDLM_MODE_JOIN_LEFT (1 << 1)
44 #define LDLM_POLICY_JOIN_RIGHT (1 << 2)
45 #define LDLM_POLICY_JOIN_LEFT (1 << 3)
48 char *ldlm_lockname[] = {
59 char *ldlm_typename[] = {
66 char *ldlm_it2str(int it)
73 case (IT_OPEN | IT_CREAT):
86 CERROR("Unknown intent %d\n", it);
91 extern cfs_mem_cache_t *ldlm_lock_slab;
93 static ldlm_processing_policy ldlm_processing_policy_table[] = {
94 [LDLM_PLAIN] ldlm_process_plain_lock,
95 [LDLM_EXTENT] ldlm_process_extent_lock,
97 [LDLM_FLOCK] ldlm_process_flock_lock,
99 [LDLM_IBITS] ldlm_process_inodebits_lock,
102 ldlm_processing_policy ldlm_get_processing_policy(struct ldlm_resource *res)
104 return ldlm_processing_policy_table[res->lr_type];
107 void ldlm_register_intent(struct ldlm_namespace *ns, ldlm_res_policy arg)
113 * REFCOUNTED LOCK OBJECTS
118 * Lock refcounts, during creation:
119 * - one special one for allocation, dec'd only once in destroy
120 * - one for being a lock that's in-use
121 * - one for the addref associated with a new lock
123 struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock)
125 atomic_inc(&lock->l_refc);
129 static void ldlm_lock_free(struct ldlm_lock *lock, size_t size)
131 LASSERT(size == sizeof(*lock));
132 OBD_SLAB_FREE(lock, ldlm_lock_slab, sizeof(*lock));
135 void ldlm_lock_put(struct ldlm_lock *lock)
139 LASSERT(lock->l_resource != LP_POISON);
140 LASSERT(atomic_read(&lock->l_refc) > 0);
141 if (atomic_dec_and_test(&lock->l_refc)) {
142 struct ldlm_resource *res;
145 "final lock_put on destroyed lock, freeing it.");
147 res = lock->l_resource;
148 LASSERT(lock->l_destroyed);
149 LASSERT(list_empty(&lock->l_res_link));
150 LASSERT(list_empty(&lock->l_pending_chain));
153 LDLM_LOCK_PUT(lock->l_parent);
155 atomic_dec(&res->lr_namespace->ns_locks);
156 ldlm_resource_putref(res);
157 lock->l_resource = NULL;
158 if (lock->l_export) {
159 class_export_put(lock->l_export);
160 lock->l_export = NULL;
163 if (lock->l_lvb_data != NULL)
164 OBD_FREE(lock->l_lvb_data, lock->l_lvb_len);
166 OBD_FREE_RCU_CB(lock, sizeof(*lock), &lock->l_handle,
173 int ldlm_lock_remove_from_lru_nolock(struct ldlm_lock *lock)
176 if (!list_empty(&lock->l_lru)) {
177 LASSERT(lock->l_resource->lr_type != LDLM_FLOCK);
178 list_del_init(&lock->l_lru);
179 lock->l_resource->lr_namespace->ns_nr_unused--;
180 LASSERT(lock->l_resource->lr_namespace->ns_nr_unused >= 0);
186 int ldlm_lock_remove_from_lru(struct ldlm_lock *lock)
190 spin_lock(&lock->l_resource->lr_namespace->ns_unused_lock);
191 rc = ldlm_lock_remove_from_lru_nolock(lock);
192 spin_unlock(&lock->l_resource->lr_namespace->ns_unused_lock);
197 /* This used to have a 'strict' flag, which recovery would use to mark an
198 * in-use lock as needing-to-die. Lest I am ever tempted to put it back, I
199 * shall explain why it's gone: with the new hash table scheme, once you call
200 * ldlm_lock_destroy, you can never drop your final references on this lock.
201 * Because it's not in the hash table anymore. -phil */
202 int ldlm_lock_destroy_internal(struct ldlm_lock *lock)
206 if (!list_empty(&lock->l_children)) {
207 LDLM_ERROR(lock, "still has children (%p)!",
208 lock->l_children.next);
209 ldlm_lock_dump(D_ERROR, lock, 0);
212 if (lock->l_readers || lock->l_writers) {
213 LDLM_ERROR(lock, "lock still has references");
214 ldlm_lock_dump(D_ERROR, lock, 0);
218 if (!list_empty(&lock->l_res_link)) {
219 LDLM_ERROR(lock, "lock still on resource");
220 ldlm_lock_dump(D_ERROR, lock, 0);
224 if (lock->l_destroyed) {
225 LASSERT(list_empty(&lock->l_lru));
229 lock->l_destroyed = 1;
232 spin_lock(&lock->l_export->exp_ldlm_data.led_lock);
233 list_del_init(&lock->l_export_chain);
235 spin_unlock(&lock->l_export->exp_ldlm_data.led_lock);
237 ldlm_lock_remove_from_lru(lock);
238 class_handle_unhash(&lock->l_handle);
241 /* Wake anyone waiting for this lock */
242 /* FIXME: I should probably add yet another flag, instead of using
243 * l_export to only call this on clients */
245 class_export_put(lock->l_export);
246 lock->l_export = NULL;
247 if (lock->l_export && lock->l_completion_ast)
248 lock->l_completion_ast(lock, 0);
254 void ldlm_lock_destroy(struct ldlm_lock *lock)
258 lock_res_and_lock(lock);
259 first = ldlm_lock_destroy_internal(lock);
260 unlock_res_and_lock(lock);
262 /* drop reference from hashtable only for first destroy */
268 void ldlm_lock_destroy_nolock(struct ldlm_lock *lock)
272 first = ldlm_lock_destroy_internal(lock);
273 /* drop reference from hashtable only for first destroy */
279 /* this is called by portals_handle2object with the handle lock taken */
280 static void lock_handle_addref(void *lock)
282 LDLM_LOCK_GET((struct ldlm_lock *)lock);
286 * usage: pass in a resource on which you have done ldlm_resource_get
287 * pass in a parent lock on which you have done a ldlm_lock_get
288 * after return, ldlm_*_put the resource and parent
289 * returns: lock with refcount 2 - one for current caller and one for remote
291 static struct ldlm_lock *ldlm_lock_new(struct ldlm_lock *parent,
292 struct ldlm_resource *resource)
294 struct ldlm_lock *lock;
297 if (resource == NULL)
300 OBD_SLAB_ALLOC(lock, ldlm_lock_slab, CFS_ALLOC_IO, sizeof(*lock));
304 lock->l_resource = ldlm_resource_getref(resource);
306 atomic_set(&lock->l_refc, 2);
307 CFS_INIT_LIST_HEAD(&lock->l_children);
308 CFS_INIT_LIST_HEAD(&lock->l_res_link);
309 CFS_INIT_LIST_HEAD(&lock->l_lru);
310 CFS_INIT_LIST_HEAD(&lock->l_export_chain);
311 CFS_INIT_LIST_HEAD(&lock->l_pending_chain);
312 CFS_INIT_LIST_HEAD(&lock->l_tmp);
313 CFS_INIT_LIST_HEAD(&lock->l_bl_ast);
314 CFS_INIT_LIST_HEAD(&lock->l_cp_ast);
315 cfs_waitq_init(&lock->l_waitq);
316 lock->l_blocking_lock = NULL;
318 lock->l_sl_mode.prev = NULL;
319 lock->l_sl_mode.next = NULL;
320 lock->l_sl_policy.prev = NULL;
321 lock->l_sl_policy.next = NULL;
323 atomic_inc(&resource->lr_namespace->ns_locks);
325 if (parent != NULL) {
326 spin_lock(&resource->lr_namespace->ns_hash_lock);
327 lock->l_parent = LDLM_LOCK_GET(parent);
328 list_add(&lock->l_childof, &parent->l_children);
329 spin_unlock(&resource->lr_namespace->ns_hash_lock);
332 CFS_INIT_LIST_HEAD(&lock->l_handle.h_link);
333 class_handle_hash(&lock->l_handle, lock_handle_addref);
338 int ldlm_lock_change_resource(struct ldlm_namespace *ns, struct ldlm_lock *lock,
339 const struct ldlm_res_id *new_resid)
341 struct ldlm_resource *oldres = lock->l_resource;
342 struct ldlm_resource *newres;
346 LASSERT(ns->ns_client != 0);
348 lock_res_and_lock(lock);
349 if (memcmp(new_resid, &lock->l_resource->lr_name,
350 sizeof(lock->l_resource->lr_name)) == 0) {
352 unlock_res_and_lock(lock);
356 LASSERT(new_resid->name[0] != 0);
358 /* This function assumes that the lock isn't on any lists */
359 LASSERT(list_empty(&lock->l_res_link));
361 type = oldres->lr_type;
362 unlock_res_and_lock(lock);
364 newres = ldlm_resource_get(ns, NULL, new_resid, type, 1);
365 if (newres == NULL) {
370 lock_res_and_lock(lock);
371 LASSERT(memcmp(new_resid, &lock->l_resource->lr_name,
372 sizeof(lock->l_resource->lr_name)) != 0);
374 lock->l_resource = newres;
377 unlock_bitlock(lock);
379 /* ...and the flowers are still standing! */
380 ldlm_resource_putref(oldres);
389 void ldlm_lock2handle(const struct ldlm_lock *lock, struct lustre_handle *lockh)
391 lockh->cookie = lock->l_handle.h_cookie;
394 /* if flags: atomically get the lock and set the flags.
395 * Return NULL if flag already set
398 struct ldlm_lock *__ldlm_handle2lock(const struct lustre_handle *handle,
401 struct ldlm_namespace *ns;
402 struct ldlm_lock *lock, *retval = NULL;
407 lock = class_handle2object(handle->cookie);
411 LASSERT(lock->l_resource != NULL);
412 ns = lock->l_resource->lr_namespace;
415 lock_res_and_lock(lock);
417 /* It's unlikely but possible that someone marked the lock as
418 * destroyed after we did handle2object on it */
419 if (lock->l_destroyed) {
420 unlock_res_and_lock(lock);
421 CDEBUG(D_INFO, "lock already destroyed: lock %p\n", lock);
426 if (flags && (lock->l_flags & flags)) {
427 unlock_res_and_lock(lock);
433 lock->l_flags |= flags;
435 unlock_res_and_lock(lock);
442 struct ldlm_lock *ldlm_handle2lock_ns(struct ldlm_namespace *ns,
443 const struct lustre_handle *handle)
445 struct ldlm_lock *retval = NULL;
446 retval = __ldlm_handle2lock(handle, 0);
450 void ldlm_lock2desc(struct ldlm_lock *lock, struct ldlm_lock_desc *desc)
452 struct obd_export *exp = lock->l_export?:lock->l_conn_export;
453 /* INODEBITS_INTEROP: If the other side does not support
454 * inodebits, reply with a plain lock descriptor.
456 if ((lock->l_resource->lr_type == LDLM_IBITS) &&
457 (exp && !(exp->exp_connect_flags & OBD_CONNECT_IBITS))) {
458 struct ldlm_resource res = *lock->l_resource;
460 /* Make sure all the right bits are set in this lock we
461 are going to pass to client */
462 LASSERTF(lock->l_policy_data.l_inodebits.bits ==
463 (MDS_INODELOCK_LOOKUP|MDS_INODELOCK_UPDATE),
464 "Inappropriate inode lock bits during "
465 "conversion " LPU64 "\n",
466 lock->l_policy_data.l_inodebits.bits);
467 res.lr_type = LDLM_PLAIN;
468 ldlm_res2desc(&res, &desc->l_resource);
469 /* Convert "new" lock mode to something old client can
471 if ((lock->l_req_mode == LCK_CR) ||
472 (lock->l_req_mode == LCK_CW))
473 desc->l_req_mode = LCK_PR;
475 desc->l_req_mode = lock->l_req_mode;
476 if ((lock->l_granted_mode == LCK_CR) ||
477 (lock->l_granted_mode == LCK_CW)) {
478 desc->l_granted_mode = LCK_PR;
480 /* We never grant PW/EX locks to clients */
481 LASSERT((lock->l_granted_mode != LCK_PW) &&
482 (lock->l_granted_mode != LCK_EX));
483 desc->l_granted_mode = lock->l_granted_mode;
486 /* We do not copy policy here, because there is no
487 policy for plain locks */
489 ldlm_res2desc(lock->l_resource, &desc->l_resource);
490 desc->l_req_mode = lock->l_req_mode;
491 desc->l_granted_mode = lock->l_granted_mode;
492 desc->l_policy_data = lock->l_policy_data;
496 void ldlm_add_bl_work_item(struct ldlm_lock *lock, struct ldlm_lock *new,
497 struct list_head *work_list)
499 if ((lock->l_flags & LDLM_FL_AST_SENT) == 0) {
500 LDLM_DEBUG(lock, "lock incompatible; sending blocking AST.");
501 lock->l_flags |= LDLM_FL_AST_SENT;
502 /* If the enqueuing client said so, tell the AST recipient to
503 * discard dirty data, rather than writing back. */
504 if (new->l_flags & LDLM_AST_DISCARD_DATA)
505 lock->l_flags |= LDLM_FL_DISCARD_DATA;
506 LASSERT(list_empty(&lock->l_bl_ast));
507 list_add(&lock->l_bl_ast, work_list);
509 LASSERT(lock->l_blocking_lock == NULL);
510 lock->l_blocking_lock = LDLM_LOCK_GET(new);
514 void ldlm_add_cp_work_item(struct ldlm_lock *lock, struct list_head *work_list)
516 if ((lock->l_flags & LDLM_FL_CP_REQD) == 0) {
517 lock->l_flags |= LDLM_FL_CP_REQD;
518 LDLM_DEBUG(lock, "lock granted; sending completion AST.");
519 LASSERT(list_empty(&lock->l_cp_ast));
520 list_add(&lock->l_cp_ast, work_list);
525 /* must be called with lr_lock held */
526 void ldlm_add_ast_work_item(struct ldlm_lock *lock, struct ldlm_lock *new,
527 struct list_head *work_list)
530 check_res_locked(lock->l_resource);
532 ldlm_add_bl_work_item(lock, new, work_list);
534 ldlm_add_cp_work_item(lock, work_list);
538 void ldlm_lock_addref(struct lustre_handle *lockh, __u32 mode)
540 struct ldlm_lock *lock;
542 lock = ldlm_handle2lock(lockh);
543 LASSERT(lock != NULL);
544 ldlm_lock_addref_internal(lock, mode);
548 void ldlm_lock_addref_internal_nolock(struct ldlm_lock *lock, __u32 mode)
550 ldlm_lock_remove_from_lru(lock);
551 if (mode & (LCK_NL | LCK_CR | LCK_PR))
553 if (mode & (LCK_EX | LCK_CW | LCK_PW | LCK_GROUP))
555 lock->l_last_used = cfs_time_current();
557 LDLM_DEBUG(lock, "ldlm_lock_addref(%s)", ldlm_lockname[mode]);
560 /* only called for local locks */
561 void ldlm_lock_addref_internal(struct ldlm_lock *lock, __u32 mode)
563 lock_res_and_lock(lock);
564 ldlm_lock_addref_internal_nolock(lock, mode);
565 unlock_res_and_lock(lock);
568 void ldlm_lock_decref_internal(struct ldlm_lock *lock, __u32 mode)
570 struct ldlm_namespace *ns;
573 lock_res_and_lock(lock);
575 ns = lock->l_resource->lr_namespace;
577 LDLM_DEBUG(lock, "ldlm_lock_decref(%s)", ldlm_lockname[mode]);
578 if (mode & (LCK_NL | LCK_CR | LCK_PR)) {
579 LASSERT(lock->l_readers > 0);
582 if (mode & (LCK_EX | LCK_CW | LCK_PW | LCK_GROUP)) {
583 LASSERT(lock->l_writers > 0);
587 if (lock->l_flags & LDLM_FL_LOCAL &&
588 !lock->l_readers && !lock->l_writers) {
589 /* If this is a local lock on a server namespace and this was
590 * the last reference, cancel the lock. */
591 CDEBUG(D_INFO, "forcing cancel of local lock\n");
592 lock->l_flags |= LDLM_FL_CBPENDING;
595 if (!lock->l_readers && !lock->l_writers &&
596 (lock->l_flags & LDLM_FL_CBPENDING)) {
597 /* If we received a blocked AST and this was the last reference,
598 * run the callback. */
599 if (ns->ns_client == LDLM_NAMESPACE_SERVER && lock->l_export)
600 CERROR("FL_CBPENDING set on non-local lock--just a "
603 LDLM_DEBUG(lock, "final decref done on cbpending lock");
605 LDLM_LOCK_GET(lock); /* dropped by bl thread */
606 ldlm_lock_remove_from_lru(lock);
607 unlock_res_and_lock(lock);
608 if ((lock->l_flags & LDLM_FL_ATOMIC_CB) ||
609 ldlm_bl_to_thread(ns, NULL, lock) != 0)
610 ldlm_handle_bl_callback(ns, NULL, lock);
611 } else if (ns->ns_client == LDLM_NAMESPACE_CLIENT &&
612 !lock->l_readers && !lock->l_writers &&
613 !(lock->l_flags & LDLM_FL_NO_LRU)) {
614 /* If this is a client-side namespace and this was the last
615 * reference, put it on the LRU. */
616 LASSERT(list_empty(&lock->l_lru));
617 LASSERT(ns->ns_nr_unused >= 0);
618 spin_lock(&ns->ns_unused_lock);
619 list_add_tail(&lock->l_lru, &ns->ns_unused_list);
621 spin_unlock(&ns->ns_unused_lock);
622 unlock_res_and_lock(lock);
623 ldlm_cancel_lru(ns, LDLM_ASYNC);
625 unlock_res_and_lock(lock);
628 LDLM_LOCK_PUT(lock); /* matches the ldlm_lock_get in addref */
633 void ldlm_lock_decref(struct lustre_handle *lockh, __u32 mode)
635 struct ldlm_lock *lock = __ldlm_handle2lock(lockh, 0);
636 LASSERTF(lock != NULL, "Non-existing lock: "LPX64"\n", lockh->cookie);
637 ldlm_lock_decref_internal(lock, mode);
641 /* This will drop a lock reference and mark it for destruction, but will not
642 * necessarily cancel the lock before returning. */
643 void ldlm_lock_decref_and_cancel(struct lustre_handle *lockh, __u32 mode)
645 struct ldlm_lock *lock = __ldlm_handle2lock(lockh, 0);
648 LASSERT(lock != NULL);
650 LDLM_DEBUG(lock, "ldlm_lock_decref(%s)", ldlm_lockname[mode]);
651 lock_res_and_lock(lock);
652 lock->l_flags |= LDLM_FL_CBPENDING;
653 unlock_res_and_lock(lock);
654 ldlm_lock_decref_internal(lock, mode);
659 * search_granted_lock
662 * Finds a position to insert the new lock.
664 * queue [input]: the granted list where search acts on;
665 * req [input]: the lock whose position to be located;
666 * lockp [output]: the position where the lock should be inserted before, or
667 * NULL indicating @req should be appended to @queue.
669 * Bit-masks combination of following values indicating in which way the
670 * lock need to be inserted.
671 * - LDLM_JOIN_NONE: noting about skip list needs to be fixed;
672 * - LDLM_MODE_JOIN_RIGHT: @req needs join right becoming the head of a
674 * - LDLM_POLICY_JOIN_RIGHT: @req needs join right becoming the head of
677 * - ldlm_grant_lock_with_skiplist
679 static int search_granted_lock(struct list_head *queue,
680 struct ldlm_lock *req,
681 struct ldlm_lock **lockp)
683 struct list_head *tmp, *tmp_tail;
684 struct ldlm_lock *lock, *mode_head_lock;
685 int rc = LDLM_JOIN_NONE;
688 list_for_each(tmp, queue) {
689 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
691 if (lock->l_req_mode != req->l_req_mode) {
692 if (LDLM_SL_HEAD(&lock->l_sl_mode))
693 tmp = &list_entry(lock->l_sl_mode.next,
695 l_sl_mode)->l_res_link;
699 /* found the same mode group */
700 if (lock->l_resource->lr_type == LDLM_PLAIN) {
702 rc = LDLM_MODE_JOIN_RIGHT;
704 } else if (lock->l_resource->lr_type == LDLM_IBITS) {
706 if (LDLM_SL_HEAD(&lock->l_sl_mode))
707 tmp_tail = &list_entry(lock->l_sl_mode.next,
709 l_sl_mode)->l_res_link;
710 mode_head_lock = lock;
712 if (lock->l_policy_data.l_inodebits.bits ==
713 req->l_policy_data.l_inodebits.bits) {
714 /* matched policy lock is found */
716 rc |= LDLM_POLICY_JOIN_RIGHT;
718 /* if the policy group head is also a
719 * mode group head or a single mode
721 if (LDLM_SL_HEAD(&lock->l_sl_mode) ||
723 LDLM_SL_EMPTY(&lock->l_sl_mode)))
724 rc |= LDLM_MODE_JOIN_RIGHT;
728 if (LDLM_SL_HEAD(&lock->l_sl_policy))
729 tmp = &list_entry(lock->l_sl_policy.next,
731 l_sl_policy)->l_res_link;
737 lock = list_entry(tmp, struct ldlm_lock,
739 } /* for all locks in the matched mode group */
741 /* no matched policy group is found, insert before
742 * the mode group head lock */
743 *lockp = mode_head_lock;
744 rc = LDLM_MODE_JOIN_RIGHT;
747 LDLM_ERROR(lock, "is not LDLM_PLAIN or LDLM_IBITS lock");
752 /* no matched mode group is found, append to the end */
760 static void ldlm_granted_list_add_lock(struct ldlm_lock *lock,
761 struct ldlm_lock *lockp,
764 struct ldlm_resource *res = lock->l_resource;
767 LASSERT(lockp || join == LDLM_JOIN_NONE);
769 check_res_locked(res);
771 ldlm_resource_dump(D_OTHER, res);
772 CDEBUG(D_OTHER, "About to add this lock:\n");
773 ldlm_lock_dump(D_OTHER, lock, 0);
775 if (lock->l_destroyed) {
776 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
780 LASSERT(list_empty(&lock->l_res_link));
783 list_add_tail(&lock->l_res_link, &lock->l_resource->lr_granted);
784 else if ((join & LDLM_MODE_JOIN_LEFT) || (join & LDLM_POLICY_JOIN_LEFT))
785 list_add(&lock->l_res_link, &lockp->l_res_link);
787 list_add_tail(&lock->l_res_link, &lockp->l_res_link);
790 if (join & LDLM_MODE_JOIN_RIGHT) {
791 LASSERT(! LDLM_SL_TAIL(&lockp->l_sl_mode));
792 if (LDLM_SL_EMPTY(&lockp->l_sl_mode)) {
793 lock->l_sl_mode.next = &lockp->l_sl_mode;
794 lockp->l_sl_mode.prev = &lock->l_sl_mode;
795 } else if (LDLM_SL_HEAD(&lockp->l_sl_mode)) {
796 lock->l_sl_mode.next = lockp->l_sl_mode.next;
797 lockp->l_sl_mode.next = NULL;
798 lock->l_sl_mode.next->prev = &lock->l_sl_mode;
800 } else if (join & LDLM_MODE_JOIN_LEFT) {
801 LASSERT(! LDLM_SL_HEAD(&lockp->l_sl_mode));
802 if (LDLM_SL_EMPTY(&lockp->l_sl_mode)) {
803 lock->l_sl_mode.prev = &lockp->l_sl_mode;
804 lockp->l_sl_mode.next = &lock->l_sl_mode;
805 } else if (LDLM_SL_TAIL(&lockp->l_sl_mode)) {
806 lock->l_sl_mode.prev = lockp->l_sl_mode.prev;
807 lockp->l_sl_mode.prev = NULL;
808 lock->l_sl_mode.prev->next = &lock->l_sl_mode;
812 if (join & LDLM_POLICY_JOIN_RIGHT) {
813 LASSERT(! LDLM_SL_TAIL(&lockp->l_sl_policy));
814 if (LDLM_SL_EMPTY(&lockp->l_sl_policy)) {
815 lock->l_sl_policy.next = &lockp->l_sl_policy;
816 lockp->l_sl_policy.prev = &lock->l_sl_policy;
817 } else if (LDLM_SL_HEAD(&lockp->l_sl_policy)) {
818 lock->l_sl_policy.next = lockp->l_sl_policy.next;
819 lockp->l_sl_policy.next = NULL;
820 lock->l_sl_policy.next->prev = &lock->l_sl_policy;
822 } else if (join & LDLM_POLICY_JOIN_LEFT) {
823 LASSERT(! LDLM_SL_HEAD(&lockp->l_sl_policy));
824 if (LDLM_SL_EMPTY(&lockp->l_sl_policy)) {
825 lock->l_sl_policy.prev = &lockp->l_sl_policy;
826 lockp->l_sl_policy.next = &lock->l_sl_policy;
827 } else if (LDLM_SL_TAIL(&lockp->l_sl_policy)) {
828 lock->l_sl_policy.prev = lockp->l_sl_policy.prev;
829 lockp->l_sl_policy.prev = NULL;
830 lock->l_sl_policy.prev->next = &lock->l_sl_policy;
837 static void ldlm_grant_lock_with_skiplist(struct ldlm_lock *lock)
839 int join = LDLM_JOIN_NONE;
840 struct ldlm_lock *lockp = NULL;
843 LASSERT(lock->l_req_mode == lock->l_granted_mode);
845 join = search_granted_lock(&lock->l_resource->lr_granted, lock, &lockp);
846 ldlm_granted_list_add_lock(lock, lockp, join);
851 * - ldlm_lock_enqueue
852 * - ldlm_reprocess_queue
853 * - ldlm_lock_convert
855 * must be called with lr_lock held
857 void ldlm_grant_lock(struct ldlm_lock *lock, struct list_head *work_list)
859 struct ldlm_resource *res = lock->l_resource;
862 check_res_locked(res);
864 lock->l_granted_mode = lock->l_req_mode;
865 if (res->lr_type == LDLM_PLAIN || res->lr_type == LDLM_IBITS)
866 ldlm_grant_lock_with_skiplist(lock);
868 ldlm_resource_add_lock(res, &res->lr_granted, lock);
870 if (lock->l_granted_mode < res->lr_most_restr)
871 res->lr_most_restr = lock->l_granted_mode;
873 if (work_list && lock->l_completion_ast != NULL)
874 ldlm_add_ast_work_item(lock, NULL, work_list);
879 /* returns a referenced lock or NULL. See the flag descriptions below, in the
880 * comment above ldlm_lock_match */
881 static struct ldlm_lock *search_queue(struct list_head *queue, ldlm_mode_t mode,
882 ldlm_policy_data_t *policy,
883 struct ldlm_lock *old_lock, int flags)
885 struct ldlm_lock *lock;
886 struct list_head *tmp;
888 list_for_each(tmp, queue) {
889 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
891 if (lock == old_lock)
894 /* llite sometimes wants to match locks that will be
895 * canceled when their users drop, but we allow it to match
896 * if it passes in CBPENDING and the lock still has users.
897 * this is generally only going to be used by children
898 * whose parents already hold a lock so forward progress
899 * can still happen. */
900 if (lock->l_flags & LDLM_FL_CBPENDING &&
901 !(flags & LDLM_FL_CBPENDING))
903 if (lock->l_flags & LDLM_FL_CBPENDING &&
904 lock->l_readers == 0 && lock->l_writers == 0)
907 if (!(lock->l_req_mode & mode))
910 if (lock->l_resource->lr_type == LDLM_EXTENT &&
911 (lock->l_policy_data.l_extent.start >
912 policy->l_extent.start ||
913 lock->l_policy_data.l_extent.end < policy->l_extent.end))
916 if (unlikely(mode == LCK_GROUP) &&
917 lock->l_resource->lr_type == LDLM_EXTENT &&
918 lock->l_policy_data.l_extent.gid != policy->l_extent.gid)
921 /* We match if we have existing lock with same or wider set
923 if (lock->l_resource->lr_type == LDLM_IBITS &&
924 ((lock->l_policy_data.l_inodebits.bits &
925 policy->l_inodebits.bits) !=
926 policy->l_inodebits.bits))
929 if (lock->l_destroyed || (lock->l_flags & LDLM_FL_FAILED))
932 if ((flags & LDLM_FL_LOCAL_ONLY) &&
933 !(lock->l_flags & LDLM_FL_LOCAL))
936 if (flags & LDLM_FL_TEST_LOCK)
939 ldlm_lock_addref_internal_nolock(lock, mode);
946 void ldlm_lock_allow_match(struct ldlm_lock *lock)
948 lock_res_and_lock(lock);
949 lock->l_flags |= LDLM_FL_LVB_READY;
950 cfs_waitq_signal(&lock->l_waitq);
951 unlock_res_and_lock(lock);
954 /* Can be called in two ways:
956 * If 'ns' is NULL, then lockh describes an existing lock that we want to look
957 * for a duplicate of.
959 * Otherwise, all of the fields must be filled in, to match against.
961 * If 'flags' contains LDLM_FL_LOCAL_ONLY, then only match local locks on the
962 * server (ie, connh is NULL)
963 * If 'flags' contains LDLM_FL_BLOCK_GRANTED, then only locks on the granted
964 * list will be considered
965 * If 'flags' contains LDLM_FL_CBPENDING, then locks that have been marked
966 * to be canceled can still be matched as long as they still have reader
967 * or writer refernces
968 * If 'flags' contains LDLM_FL_TEST_LOCK, then don't actually reference a lock,
969 * just tell us if we would have matched.
971 * Returns 1 if it finds an already-existing lock that is compatible; in this
972 * case, lockh is filled in with a addref()ed lock
974 * we also check security context, if that failed we simply return 0 (to keep
975 * caller code unchanged), the context failure will be discovered by caller
978 int ldlm_lock_match(struct ldlm_namespace *ns, int flags,
979 const struct ldlm_res_id *res_id, ldlm_type_t type,
980 ldlm_policy_data_t *policy, ldlm_mode_t mode,
981 struct lustre_handle *lockh)
983 struct ldlm_resource *res;
984 struct ldlm_lock *lock, *old_lock = NULL;
989 old_lock = ldlm_handle2lock(lockh);
992 ns = old_lock->l_resource->lr_namespace;
993 res_id = &old_lock->l_resource->lr_name;
994 type = old_lock->l_resource->lr_type;
995 mode = old_lock->l_req_mode;
998 res = ldlm_resource_get(ns, NULL, res_id, type, 0);
1000 LASSERT(old_lock == NULL);
1006 lock = search_queue(&res->lr_granted, mode, policy, old_lock, flags);
1009 if (flags & LDLM_FL_BLOCK_GRANTED)
1011 lock = search_queue(&res->lr_converting, mode, policy, old_lock, flags);
1014 lock = search_queue(&res->lr_waiting, mode, policy, old_lock, flags);
1021 ldlm_resource_putref(res);
1024 ldlm_lock2handle(lock, lockh);
1025 if ((flags & LDLM_FL_LVB_READY) &&
1026 (!(lock->l_flags & LDLM_FL_LVB_READY))) {
1027 struct l_wait_info lwi;
1028 if (lock->l_completion_ast) {
1029 int err = lock->l_completion_ast(lock,
1030 LDLM_FL_WAIT_NOREPROC,
1033 if (flags & LDLM_FL_TEST_LOCK)
1034 LDLM_LOCK_PUT(lock);
1036 ldlm_lock_decref_internal(lock, mode);
1042 lwi = LWI_TIMEOUT_INTR(cfs_time_seconds(obd_timeout), NULL,
1043 LWI_ON_SIGNAL_NOOP, NULL);
1045 /* XXX FIXME see comment on CAN_MATCH in lustre_dlm.h */
1046 l_wait_event(lock->l_waitq,
1047 (lock->l_flags & LDLM_FL_LVB_READY), &lwi);
1052 LDLM_DEBUG(lock, "matched ("LPU64" "LPU64")",
1053 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1054 res_id->name[2] : policy->l_extent.start,
1055 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1056 res_id->name[3] : policy->l_extent.end);
1058 /* check user's security context */
1059 if (lock->l_conn_export &&
1060 sptlrpc_import_check_ctx(
1061 class_exp2cliimp(lock->l_conn_export))) {
1062 if (!(flags & LDLM_FL_TEST_LOCK))
1063 ldlm_lock_decref_internal(lock, mode);
1067 if (flags & LDLM_FL_TEST_LOCK)
1068 LDLM_LOCK_PUT(lock);
1070 } else if (!(flags & LDLM_FL_TEST_LOCK)) {/*less verbose for test-only*/
1071 LDLM_DEBUG_NOLOCK("not matched ns %p type %u mode %u res "
1072 LPU64"/"LPU64" ("LPU64" "LPU64")", ns,
1073 type, mode, res_id->name[0], res_id->name[1],
1074 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1075 res_id->name[2] :policy->l_extent.start,
1076 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1077 res_id->name[3] : policy->l_extent.end);
1080 LDLM_LOCK_PUT(old_lock);
1085 /* Returns a referenced lock */
1086 struct ldlm_lock *ldlm_lock_create(struct ldlm_namespace *ns,
1087 const struct lustre_handle *parent_lock_handle,
1088 const struct ldlm_res_id *res_id,
1091 ldlm_blocking_callback blocking,
1092 ldlm_completion_callback completion,
1093 ldlm_glimpse_callback glimpse,
1094 void *data, __u32 lvb_len)
1096 struct ldlm_resource *res, *parent_res = NULL;
1097 struct ldlm_lock *lock, *parent_lock = NULL;
1100 if (parent_lock_handle) {
1101 parent_lock = ldlm_handle2lock(parent_lock_handle);
1103 parent_res = parent_lock->l_resource;
1106 res = ldlm_resource_get(ns, parent_res, res_id, type, 1);
1110 lock = ldlm_lock_new(parent_lock, res);
1111 ldlm_resource_putref(res);
1112 if (parent_lock != NULL)
1113 LDLM_LOCK_PUT(parent_lock);
1118 lock->l_req_mode = mode;
1119 lock->l_ast_data = data;
1120 lock->l_blocking_ast = blocking;
1121 lock->l_completion_ast = completion;
1122 lock->l_glimpse_ast = glimpse;
1123 lock->l_pid = cfs_curproc_pid();
1126 lock->l_lvb_len = lvb_len;
1127 OBD_ALLOC(lock->l_lvb_data, lvb_len);
1128 if (lock->l_lvb_data == NULL) {
1129 OBD_SLAB_FREE(lock, ldlm_lock_slab, sizeof(*lock));
1137 ldlm_error_t ldlm_lock_enqueue(struct ldlm_namespace *ns,
1138 struct ldlm_lock **lockp,
1139 void *cookie, int *flags)
1141 struct ldlm_lock *lock = *lockp;
1142 struct ldlm_resource *res = lock->l_resource;
1143 int local = res->lr_namespace->ns_client;
1144 ldlm_processing_policy policy;
1145 ldlm_error_t rc = ELDLM_OK;
1148 do_gettimeofday(&lock->l_enqueued_time);
1149 /* policies are not executed on the client or during replay */
1150 if ((*flags & (LDLM_FL_HAS_INTENT|LDLM_FL_REPLAY)) == LDLM_FL_HAS_INTENT
1151 && !local && ns->ns_policy) {
1152 rc = ns->ns_policy(ns, lockp, cookie, lock->l_req_mode, *flags,
1154 if (rc == ELDLM_LOCK_REPLACED) {
1155 /* The lock that was returned has already been granted,
1156 * and placed into lockp. If it's not the same as the
1157 * one we passed in, then destroy the old one and our
1158 * work here is done. */
1159 if (lock != *lockp) {
1160 ldlm_lock_destroy(lock);
1161 LDLM_LOCK_PUT(lock);
1163 *flags |= LDLM_FL_LOCK_CHANGED;
1165 } else if (rc != ELDLM_OK ||
1166 (rc == ELDLM_OK && (*flags & LDLM_FL_INTENT_ONLY))) {
1167 ldlm_lock_destroy(lock);
1172 lock_res_and_lock(lock);
1173 if (local && lock->l_req_mode == lock->l_granted_mode) {
1174 /* The server returned a blocked lock, but it was granted before
1175 * we got a chance to actually enqueue it. We don't need to do
1177 *flags &= ~(LDLM_FL_BLOCK_GRANTED |
1178 LDLM_FL_BLOCK_CONV | LDLM_FL_BLOCK_WAIT);
1179 GOTO(out, ELDLM_OK);
1182 /* Some flags from the enqueue want to make it into the AST, via the
1183 * lock's l_flags. */
1184 lock->l_flags |= *flags & LDLM_AST_DISCARD_DATA;
1186 /* This distinction between local lock trees is very important; a client
1187 * namespace only has information about locks taken by that client, and
1188 * thus doesn't have enough information to decide for itself if it can
1189 * be granted (below). In this case, we do exactly what the server
1190 * tells us to do, as dictated by the 'flags'.
1192 * We do exactly the same thing during recovery, when the server is
1193 * more or less trusting the clients not to lie.
1195 * FIXME (bug 268): Detect obvious lies by checking compatibility in
1196 * granted/converting queues. */
1197 ldlm_resource_unlink_lock(lock);
1199 if (*flags & LDLM_FL_BLOCK_CONV)
1200 ldlm_resource_add_lock(res, &res->lr_converting, lock);
1201 else if (*flags & (LDLM_FL_BLOCK_WAIT | LDLM_FL_BLOCK_GRANTED))
1202 ldlm_resource_add_lock(res, &res->lr_waiting, lock);
1204 ldlm_grant_lock(lock, NULL);
1205 GOTO(out, ELDLM_OK);
1206 } else if (*flags & LDLM_FL_REPLAY) {
1207 if (*flags & LDLM_FL_BLOCK_CONV) {
1208 ldlm_resource_add_lock(res, &res->lr_converting, lock);
1209 GOTO(out, ELDLM_OK);
1210 } else if (*flags & LDLM_FL_BLOCK_WAIT) {
1211 ldlm_resource_add_lock(res, &res->lr_waiting, lock);
1212 GOTO(out, ELDLM_OK);
1213 } else if (*flags & LDLM_FL_BLOCK_GRANTED) {
1214 ldlm_grant_lock(lock, NULL);
1215 GOTO(out, ELDLM_OK);
1217 /* If no flags, fall through to normal enqueue path. */
1220 policy = ldlm_processing_policy_table[res->lr_type];
1221 policy(lock, flags, 1, &rc, NULL);
1224 unlock_res_and_lock(lock);
1228 /* Must be called with namespace taken: queue is waiting or converting. */
1229 int ldlm_reprocess_queue(struct ldlm_resource *res, struct list_head *queue,
1230 struct list_head *work_list)
1232 struct list_head *tmp, *pos;
1233 ldlm_processing_policy policy;
1235 int rc = LDLM_ITER_CONTINUE;
1239 check_res_locked(res);
1241 policy = ldlm_processing_policy_table[res->lr_type];
1244 list_for_each_safe(tmp, pos, queue) {
1245 struct ldlm_lock *pending;
1246 pending = list_entry(tmp, struct ldlm_lock, l_res_link);
1248 CDEBUG(D_INFO, "Reprocessing lock %p\n", pending);
1251 rc = policy(pending, &flags, 0, &err, work_list);
1252 if (rc != LDLM_ITER_CONTINUE)
1259 int ldlm_run_bl_ast_work(struct list_head *rpc_list)
1261 struct list_head *tmp, *pos;
1262 struct ldlm_lock_desc d;
1263 int rc = 0, retval = 0;
1266 list_for_each_safe(tmp, pos, rpc_list) {
1267 struct ldlm_lock *lock =
1268 list_entry(tmp, struct ldlm_lock, l_bl_ast);
1270 /* nobody should touch l_bl_ast */
1271 lock_res_and_lock(lock);
1272 list_del_init(&lock->l_bl_ast);
1274 LASSERT(lock->l_flags & LDLM_FL_AST_SENT);
1275 LASSERT(lock->l_bl_ast_run == 0);
1276 LASSERT(lock->l_blocking_lock);
1277 lock->l_bl_ast_run++;
1278 unlock_res_and_lock(lock);
1280 ldlm_lock2desc(lock->l_blocking_lock, &d);
1282 LDLM_LOCK_PUT(lock->l_blocking_lock);
1283 lock->l_blocking_lock = NULL;
1284 rc = lock->l_blocking_ast(lock, &d, NULL, LDLM_CB_BLOCKING);
1286 if (rc == -ERESTART)
1289 CDEBUG(D_DLMTRACE, "Failed AST - should clean & "
1290 "disconnect client\n");
1291 LDLM_LOCK_PUT(lock);
1296 int ldlm_run_cp_ast_work(struct list_head *rpc_list)
1298 struct list_head *tmp, *pos;
1299 int rc = 0, retval = 0;
1302 /* It's possible to receive a completion AST before we've set
1303 * the l_completion_ast pointer: either because the AST arrived
1304 * before the reply, or simply because there's a small race
1305 * window between receiving the reply and finishing the local
1306 * enqueue. (bug 842)
1308 * This can't happen with the blocking_ast, however, because we
1309 * will never call the local blocking_ast until we drop our
1310 * reader/writer reference, which we won't do until we get the
1311 * reply and finish enqueueing. */
1313 list_for_each_safe(tmp, pos, rpc_list) {
1314 struct ldlm_lock *lock =
1315 list_entry(tmp, struct ldlm_lock, l_cp_ast);
1317 /* nobody should touch l_cp_ast */
1318 lock_res_and_lock(lock);
1319 list_del_init(&lock->l_cp_ast);
1320 LASSERT(lock->l_flags & LDLM_FL_CP_REQD);
1321 lock->l_flags &= ~LDLM_FL_CP_REQD;
1322 unlock_res_and_lock(lock);
1324 if (lock->l_completion_ast != NULL)
1325 rc = lock->l_completion_ast(lock, 0, 0);
1326 if (rc == -ERESTART)
1329 CDEBUG(D_DLMTRACE, "Failed AST - should clean & "
1330 "disconnect client\n");
1331 LDLM_LOCK_PUT(lock);
1336 static int reprocess_one_queue(struct ldlm_resource *res, void *closure)
1338 ldlm_reprocess_all(res);
1339 return LDLM_ITER_CONTINUE;
1342 void ldlm_reprocess_all_ns(struct ldlm_namespace *ns)
1344 struct list_head *tmp;
1351 spin_lock(&ns->ns_hash_lock);
1352 for (i = 0; i < RES_HASH_SIZE; i++) {
1353 tmp = ns->ns_hash[i].next;
1354 while (tmp != &(ns->ns_hash[i])) {
1355 struct ldlm_resource *res =
1356 list_entry(tmp, struct ldlm_resource, lr_hash);
1358 ldlm_resource_getref(res);
1359 spin_unlock(&ns->ns_hash_lock);
1361 rc = reprocess_one_queue(res, NULL);
1363 spin_lock(&ns->ns_hash_lock);
1365 ldlm_resource_putref_locked(res);
1367 if (rc == LDLM_ITER_STOP)
1372 spin_unlock(&ns->ns_hash_lock);
1376 void ldlm_reprocess_all(struct ldlm_resource *res)
1378 struct list_head rpc_list = LIST_HEAD_INIT(rpc_list);
1382 /* Local lock trees don't get reprocessed. */
1383 if (res->lr_namespace->ns_client) {
1390 rc = ldlm_reprocess_queue(res, &res->lr_converting, &rpc_list);
1391 if (rc == LDLM_ITER_CONTINUE)
1392 ldlm_reprocess_queue(res, &res->lr_waiting, &rpc_list);
1395 rc = ldlm_run_cp_ast_work(&rpc_list);
1396 if (rc == -ERESTART) {
1397 LASSERT(list_empty(&rpc_list));
1403 void ldlm_cancel_callback(struct ldlm_lock *lock)
1405 check_res_locked(lock->l_resource);
1406 if (!(lock->l_flags & LDLM_FL_CANCEL)) {
1407 lock->l_flags |= LDLM_FL_CANCEL;
1408 if (lock->l_blocking_ast) {
1409 // l_check_no_ns_lock(ns);
1410 unlock_res_and_lock(lock);
1411 lock->l_blocking_ast(lock, NULL, lock->l_ast_data,
1413 lock_res_and_lock(lock);
1415 LDLM_DEBUG(lock, "no blocking ast");
1420 void ldlm_unlink_lock_skiplist(struct ldlm_lock *req)
1422 struct ldlm_lock *lock;
1424 if (req->l_resource->lr_type != LDLM_PLAIN &&
1425 req->l_resource->lr_type != LDLM_IBITS)
1428 if (LDLM_SL_HEAD(&req->l_sl_mode)) {
1429 lock = list_entry(req->l_res_link.next, struct ldlm_lock,
1431 if (req->l_sl_mode.next == &lock->l_sl_mode) {
1432 lock->l_sl_mode.prev = NULL;
1434 lock->l_sl_mode.next = req->l_sl_mode.next;
1435 lock->l_sl_mode.next->prev = &lock->l_sl_mode;
1437 req->l_sl_mode.next = NULL;
1438 } else if (LDLM_SL_TAIL(&req->l_sl_mode)) {
1439 lock = list_entry(req->l_res_link.prev, struct ldlm_lock,
1441 if (req->l_sl_mode.prev == &lock->l_sl_mode) {
1442 lock->l_sl_mode.next = NULL;
1444 lock->l_sl_mode.prev = req->l_sl_mode.prev;
1445 lock->l_sl_mode.prev->next = &lock->l_sl_mode;
1447 req->l_sl_mode.prev = NULL;
1450 if (LDLM_SL_HEAD(&req->l_sl_policy)) {
1451 lock = list_entry(req->l_res_link.next, struct ldlm_lock,
1453 if (req->l_sl_policy.next == &lock->l_sl_policy) {
1454 lock->l_sl_policy.prev = NULL;
1456 lock->l_sl_policy.next = req->l_sl_policy.next;
1457 lock->l_sl_policy.next->prev = &lock->l_sl_policy;
1459 req->l_sl_policy.next = NULL;
1460 } else if (LDLM_SL_TAIL(&req->l_sl_policy)) {
1461 lock = list_entry(req->l_res_link.prev, struct ldlm_lock,
1463 if (req->l_sl_policy.prev == &lock->l_sl_policy) {
1464 lock->l_sl_policy.next = NULL;
1466 lock->l_sl_policy.prev = req->l_sl_policy.prev;
1467 lock->l_sl_policy.prev->next = &lock->l_sl_policy;
1469 req->l_sl_policy.prev = NULL;
1473 void ldlm_lock_cancel(struct ldlm_lock *lock)
1475 struct ldlm_resource *res;
1476 struct ldlm_namespace *ns;
1479 lock_res_and_lock(lock);
1481 res = lock->l_resource;
1482 ns = res->lr_namespace;
1484 /* Please do not, no matter how tempting, remove this LBUG without
1485 * talking to me first. -phik */
1486 if (lock->l_readers || lock->l_writers) {
1487 LDLM_ERROR(lock, "lock still has references");
1491 ldlm_del_waiting_lock(lock);
1493 /* Releases cancel callback. */
1494 ldlm_cancel_callback(lock);
1496 /* Yes, second time, just in case it was added again while we were
1497 running with no res lock in ldlm_cancel_callback */
1498 ldlm_del_waiting_lock(lock);
1499 ldlm_resource_unlink_lock(lock);
1500 ldlm_lock_destroy_nolock(lock);
1501 unlock_res_and_lock(lock);
1506 int ldlm_lock_set_data(struct lustre_handle *lockh, void *data)
1508 struct ldlm_lock *lock = ldlm_handle2lock(lockh);
1514 lock->l_ast_data = data;
1515 LDLM_LOCK_PUT(lock);
1519 void ldlm_cancel_locks_for_export(struct obd_export *exp)
1521 struct ldlm_lock *lock;
1522 struct ldlm_resource *res;
1524 spin_lock(&exp->exp_ldlm_data.led_lock);
1525 while(!list_empty(&exp->exp_ldlm_data.led_held_locks)) {
1526 lock = list_entry(exp->exp_ldlm_data.led_held_locks.next,
1527 struct ldlm_lock, l_export_chain);
1528 res = ldlm_resource_getref(lock->l_resource);
1529 LDLM_LOCK_GET(lock);
1530 spin_unlock(&exp->exp_ldlm_data.led_lock);
1532 LDLM_DEBUG(lock, "export %p", exp);
1533 ldlm_lock_cancel(lock);
1534 ldlm_reprocess_all(res);
1536 ldlm_resource_putref(res);
1537 LDLM_LOCK_PUT(lock);
1538 spin_lock(&exp->exp_ldlm_data.led_lock);
1540 spin_unlock(&exp->exp_ldlm_data.led_lock);
1543 struct ldlm_resource *ldlm_lock_convert(struct ldlm_lock *lock, int new_mode,
1546 struct list_head rpc_list = LIST_HEAD_INIT(rpc_list);
1547 struct ldlm_resource *res;
1548 struct ldlm_namespace *ns;
1551 struct ldlm_lock *mark_lock = NULL;
1552 int join = LDLM_JOIN_NONE;
1556 if (new_mode == lock->l_granted_mode) { // No changes? Just return.
1557 *flags |= LDLM_FL_BLOCK_GRANTED;
1558 RETURN(lock->l_resource);
1561 LASSERTF(new_mode == LCK_PW && lock->l_granted_mode == LCK_PR,
1562 "new_mode %u, granted %u\n", new_mode, lock->l_granted_mode);
1564 lock_res_and_lock(lock);
1566 res = lock->l_resource;
1567 ns = res->lr_namespace;
1569 old_mode = lock->l_req_mode;
1570 lock->l_req_mode = new_mode;
1571 if (res->lr_type == LDLM_PLAIN || res->lr_type == LDLM_IBITS) {
1572 /* remember the lock position where the lock might be
1573 * added back to the granted list later and also
1574 * remember the join mode for skiplist fixing. */
1575 if (LDLM_SL_HEAD(&lock->l_sl_mode))
1576 join = LDLM_MODE_JOIN_RIGHT;
1577 else if (LDLM_SL_TAIL(&lock->l_sl_mode))
1578 join = LDLM_MODE_JOIN_LEFT;
1579 if (LDLM_SL_HEAD(&lock->l_sl_policy))
1580 join |= LDLM_POLICY_JOIN_RIGHT;
1581 else if (LDLM_SL_TAIL(&lock->l_sl_policy))
1582 join |= LDLM_POLICY_JOIN_LEFT;
1584 LASSERT(!((join & LDLM_MODE_JOIN_RIGHT) &&
1585 (join & LDLM_POLICY_JOIN_LEFT)));
1586 LASSERT(!((join & LDLM_MODE_JOIN_LEFT) &&
1587 (join & LDLM_POLICY_JOIN_RIGHT)));
1589 if ((join & LDLM_MODE_JOIN_LEFT) ||
1590 (join & LDLM_POLICY_JOIN_LEFT))
1591 mark_lock = list_entry(lock->l_res_link.prev,
1592 struct ldlm_lock, l_res_link);
1593 else if (lock->l_res_link.next != &res->lr_granted)
1594 mark_lock = list_entry(lock->l_res_link.next,
1595 struct ldlm_lock, l_res_link);
1597 ldlm_resource_unlink_lock(lock);
1599 /* If this is a local resource, put it on the appropriate list. */
1600 if (res->lr_namespace->ns_client) {
1601 if (*flags & (LDLM_FL_BLOCK_CONV | LDLM_FL_BLOCK_GRANTED)) {
1602 ldlm_resource_add_lock(res, &res->lr_converting, lock);
1604 /* This should never happen, because of the way the
1605 * server handles conversions. */
1606 LDLM_ERROR(lock, "Erroneous flags %d on local lock\n",
1610 ldlm_grant_lock(lock, &rpc_list);
1612 /* FIXME: completion handling not with ns_lock held ! */
1613 if (lock->l_completion_ast)
1614 lock->l_completion_ast(lock, 0, NULL);
1618 ldlm_processing_policy policy;
1619 policy = ldlm_processing_policy_table[res->lr_type];
1620 rc = policy(lock, &pflags, 0, &err, &rpc_list);
1621 if (rc == LDLM_ITER_STOP) {
1622 lock->l_req_mode = old_mode;
1623 ldlm_granted_list_add_lock(lock, mark_lock, join);
1626 *flags |= LDLM_FL_BLOCK_GRANTED;
1630 unlock_res_and_lock(lock);
1633 ldlm_run_cp_ast_work(&rpc_list);
1637 void ldlm_lock_dump(int level, struct ldlm_lock *lock, int pos)
1639 struct obd_device *obd = NULL;
1641 if (!((libcfs_debug | D_ERROR) & level))
1645 CDEBUG(level, " NULL LDLM lock\n");
1649 CDEBUG(level," -- Lock dump: %p/"LPX64" (rc: %d) (pos: %d) (pid: %d)\n",
1650 lock, lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
1652 if (lock->l_conn_export != NULL)
1653 obd = lock->l_conn_export->exp_obd;
1654 if (lock->l_export && lock->l_export->exp_connection) {
1655 CDEBUG(level, " Node: NID %s (rhandle: "LPX64")\n",
1656 libcfs_nid2str(lock->l_export->exp_connection->c_peer.nid),
1657 lock->l_remote_handle.cookie);
1658 } else if (obd == NULL) {
1659 CDEBUG(level, " Node: local\n");
1661 struct obd_import *imp = obd->u.cli.cl_import;
1662 CDEBUG(level, " Node: NID %s (rhandle: "LPX64")\n",
1663 libcfs_nid2str(imp->imp_connection->c_peer.nid),
1664 lock->l_remote_handle.cookie);
1666 CDEBUG(level, " Resource: %p ("LPU64"/"LPU64"/"LPU64")\n",
1668 lock->l_resource->lr_name.name[0],
1669 lock->l_resource->lr_name.name[1],
1670 lock->l_resource->lr_name.name[2]);
1671 CDEBUG(level, " Req mode: %s, grant mode: %s, rc: %u, read: %d, "
1672 "write: %d flags: %#x\n", ldlm_lockname[lock->l_req_mode],
1673 ldlm_lockname[lock->l_granted_mode],
1674 atomic_read(&lock->l_refc), lock->l_readers, lock->l_writers,
1676 if (lock->l_resource->lr_type == LDLM_EXTENT)
1677 CDEBUG(level, " Extent: "LPU64" -> "LPU64
1678 " (req "LPU64"-"LPU64")\n",
1679 lock->l_policy_data.l_extent.start,
1680 lock->l_policy_data.l_extent.end,
1681 lock->l_req_extent.start, lock->l_req_extent.end);
1682 else if (lock->l_resource->lr_type == LDLM_FLOCK)
1683 CDEBUG(level, " Pid: %d Extent: "LPU64" -> "LPU64"\n",
1684 lock->l_policy_data.l_flock.pid,
1685 lock->l_policy_data.l_flock.start,
1686 lock->l_policy_data.l_flock.end);
1687 else if (lock->l_resource->lr_type == LDLM_IBITS)
1688 CDEBUG(level, " Bits: "LPX64"\n",
1689 lock->l_policy_data.l_inodebits.bits);
1692 void ldlm_lock_dump_handle(int level, struct lustre_handle *lockh)
1694 struct ldlm_lock *lock;
1696 if (!((libcfs_debug | D_ERROR) & level))
1699 lock = ldlm_handle2lock(lockh);
1703 ldlm_lock_dump(D_OTHER, lock, 0);
1705 LDLM_LOCK_PUT(lock);
1708 void _ldlm_lock_debug(struct ldlm_lock *lock, __u32 level,
1709 struct libcfs_debug_msg_data *data, const char *fmt,
1713 cfs_debug_limit_state_t *cdls = data->msg_cdls;
1715 va_start(args, fmt);
1717 if (lock->l_resource == NULL) {
1718 libcfs_debug_vmsg2(cdls, data->msg_subsys, level, data->msg_file,
1719 data->msg_fn, data->msg_line, fmt, args,
1720 " ns: \?\? lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
1721 "res: \?\? rrc=\?\? type: \?\?\? flags: %x remote: "
1722 LPX64" expref: %d pid: %u\n", lock,
1723 lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
1724 lock->l_readers, lock->l_writers,
1725 ldlm_lockname[lock->l_granted_mode],
1726 ldlm_lockname[lock->l_req_mode],
1727 lock->l_flags, lock->l_remote_handle.cookie,
1729 atomic_read(&lock->l_export->exp_refcount) : -99,
1735 switch (lock->l_resource->lr_type) {
1737 libcfs_debug_vmsg2(cdls, data->msg_subsys, level, data->msg_file,
1738 data->msg_fn, data->msg_line, fmt, args,
1739 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
1740 "res: "LPU64"/"LPU64" rrc: %d type: %s ["LPU64"->"LPU64
1741 "] (req "LPU64"->"LPU64") flags: %x remote: "LPX64
1742 " expref: %d pid: %u\n",
1743 lock->l_resource->lr_namespace->ns_name, lock,
1744 lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
1745 lock->l_readers, lock->l_writers,
1746 ldlm_lockname[lock->l_granted_mode],
1747 ldlm_lockname[lock->l_req_mode],
1748 lock->l_resource->lr_name.name[0],
1749 lock->l_resource->lr_name.name[1],
1750 atomic_read(&lock->l_resource->lr_refcount),
1751 ldlm_typename[lock->l_resource->lr_type],
1752 lock->l_policy_data.l_extent.start,
1753 lock->l_policy_data.l_extent.end,
1754 lock->l_req_extent.start, lock->l_req_extent.end,
1755 lock->l_flags, lock->l_remote_handle.cookie,
1757 atomic_read(&lock->l_export->exp_refcount) : -99,
1762 libcfs_debug_vmsg2(cdls, data->msg_subsys, level, data->msg_file,
1763 data->msg_fn, data->msg_line, fmt, args,
1764 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
1765 "res: "LPU64"/"LPU64" rrc: %d type: %s pid: %d "
1766 "["LPU64"->"LPU64"] flags: %x remote: "LPX64
1767 " expref: %d pid: %u\n",
1768 lock->l_resource->lr_namespace->ns_name, lock,
1769 lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
1770 lock->l_readers, lock->l_writers,
1771 ldlm_lockname[lock->l_granted_mode],
1772 ldlm_lockname[lock->l_req_mode],
1773 lock->l_resource->lr_name.name[0],
1774 lock->l_resource->lr_name.name[1],
1775 atomic_read(&lock->l_resource->lr_refcount),
1776 ldlm_typename[lock->l_resource->lr_type],
1777 lock->l_policy_data.l_flock.pid,
1778 lock->l_policy_data.l_flock.start,
1779 lock->l_policy_data.l_flock.end,
1780 lock->l_flags, lock->l_remote_handle.cookie,
1782 atomic_read(&lock->l_export->exp_refcount) : -99,
1787 libcfs_debug_vmsg2(cdls, data->msg_subsys, level, data->msg_file,
1788 data->msg_fn, data->msg_line, fmt, args,
1789 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
1790 "res: "LPU64"/"LPU64" bits "LPX64" rrc: %d type: %s "
1791 "flags: %x remote: "LPX64" expref: %d "
1793 lock->l_resource->lr_namespace->ns_name,
1794 lock, lock->l_handle.h_cookie,
1795 atomic_read (&lock->l_refc),
1796 lock->l_readers, lock->l_writers,
1797 ldlm_lockname[lock->l_granted_mode],
1798 ldlm_lockname[lock->l_req_mode],
1799 lock->l_resource->lr_name.name[0],
1800 lock->l_resource->lr_name.name[1],
1801 lock->l_policy_data.l_inodebits.bits,
1802 atomic_read(&lock->l_resource->lr_refcount),
1803 ldlm_typename[lock->l_resource->lr_type],
1804 lock->l_flags, lock->l_remote_handle.cookie,
1806 atomic_read(&lock->l_export->exp_refcount) : -99,
1811 libcfs_debug_vmsg2(cdls, data->msg_subsys, level, data->msg_file,
1812 data->msg_fn, data->msg_line, fmt, args,
1813 " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
1814 "res: "LPU64"/"LPU64" rrc: %d type: %s flags: %x "
1815 "remote: "LPX64" expref: %d pid: %u\n",
1816 lock->l_resource->lr_namespace->ns_name,
1817 lock, lock->l_handle.h_cookie,
1818 atomic_read (&lock->l_refc),
1819 lock->l_readers, lock->l_writers,
1820 ldlm_lockname[lock->l_granted_mode],
1821 ldlm_lockname[lock->l_req_mode],
1822 lock->l_resource->lr_name.name[0],
1823 lock->l_resource->lr_name.name[1],
1824 atomic_read(&lock->l_resource->lr_refcount),
1825 ldlm_typename[lock->l_resource->lr_type],
1826 lock->l_flags, lock->l_remote_handle.cookie,
1828 atomic_read(&lock->l_export->exp_refcount) : -99,
1834 EXPORT_SYMBOL(_ldlm_lock_debug);