1 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
2 * vim:expandtab:shiftwidth=8:tabstop=8:
4 * Copyright (c) 2002 Cluster File Systems, Inc.
5 * Author: Peter Braam <braam@clusterfs.com>
6 * Author: Phil Schwan <phil@clusterfs.com>
8 * This file is part of Lustre, http://www.lustre.org.
10 * Lustre is free software; you can redistribute it and/or
11 * modify it under the terms of version 2 of the GNU General Public
12 * License as published by the Free Software Foundation.
14 * Lustre is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
19 * You should have received a copy of the GNU General Public License
20 * along with Lustre; if not, write to the Free Software
21 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
24 #define DEBUG_SUBSYSTEM S_LDLM
26 #include <linux/slab.h>
27 #include <linux/module.h>
28 #include <linux/random.h>
29 #include <linux/lustre_dlm.h>
30 #include <linux/lustre_mds.h>
31 #include <linux/obd_class.h>
33 //struct lustre_lock ldlm_everything_lock;
36 char *ldlm_lockname[] = {
45 char *ldlm_typename[] = {
50 char *ldlm_it2str(int it)
57 case (IT_OPEN | IT_CREAT):
88 CERROR("Unknown intent %d\n", it);
93 extern kmem_cache_t *ldlm_lock_slab;
94 struct lustre_lock ldlm_handle_lock;
96 static int ldlm_plain_compat(struct ldlm_lock *a, struct ldlm_lock *b);
98 ldlm_res_compat ldlm_res_compat_table[] = {
99 [LDLM_PLAIN] ldlm_plain_compat,
100 [LDLM_EXTENT] ldlm_extent_compat,
103 static ldlm_res_policy ldlm_intent_policy_func;
105 static int ldlm_plain_policy(struct ldlm_lock *lock, void *req_cookie,
106 ldlm_mode_t mode, int flags, void *data)
108 if ((flags & LDLM_FL_HAS_INTENT) && ldlm_intent_policy_func) {
109 return ldlm_intent_policy_func(lock, req_cookie, mode, flags,
116 ldlm_res_policy ldlm_res_policy_table[] = {
117 [LDLM_PLAIN] ldlm_plain_policy,
118 [LDLM_EXTENT] ldlm_extent_policy,
121 void ldlm_register_intent(ldlm_res_policy arg)
123 ldlm_intent_policy_func = arg;
126 void ldlm_unregister_intent(void)
128 ldlm_intent_policy_func = NULL;
132 * REFCOUNTED LOCK OBJECTS
137 * Lock refcounts, during creation:
138 * - one special one for allocation, dec'd only once in destroy
139 * - one for being a lock that's in-use
140 * - one for the addref associated with a new lock
142 struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock)
144 l_lock(&lock->l_resource->lr_namespace->ns_lock);
145 atomic_inc(&lock->l_refc);
146 ldlm_resource_getref(lock->l_resource);
147 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
151 void ldlm_lock_put(struct ldlm_lock *lock)
153 struct ldlm_namespace *ns = lock->l_resource->lr_namespace;
156 l_lock(&ns->ns_lock);
157 atomic_dec(&lock->l_refc);
158 LASSERT(atomic_read(&lock->l_refc) >= 0);
160 if (ldlm_resource_putref(lock->l_resource)) {
161 LASSERT(atomic_read(&lock->l_refc) == 0);
162 lock->l_resource = NULL;
165 LDLM_LOCK_PUT(lock->l_parent);
167 if (atomic_read(&lock->l_refc) == 0) {
168 LASSERT(lock->l_destroyed);
169 l_unlock(&ns->ns_lock);
170 LDLM_DEBUG(lock, "final lock_put on destroyed lock, freeing");
172 spin_lock(&ns->ns_counter_lock);
174 spin_unlock(&ns->ns_counter_lock);
176 lock->l_resource = NULL;
177 lock->l_random = DEAD_HANDLE_MAGIC;
178 if (lock->l_export && lock->l_export->exp_connection)
179 ptlrpc_put_connection(lock->l_export->exp_connection);
180 memset(lock, 0x5a, sizeof(*lock));
181 kmem_cache_free(ldlm_lock_slab, lock);
182 CDEBUG(D_MALLOC, "kfreed 'lock': %d at %p (tot 0).\n",
183 sizeof(*lock), lock);
185 l_unlock(&ns->ns_lock);
190 void ldlm_lock_remove_from_lru(struct ldlm_lock *lock)
193 l_lock(&lock->l_resource->lr_namespace->ns_lock);
194 if (!list_empty(&lock->l_lru)) {
195 list_del_init(&lock->l_lru);
196 lock->l_resource->lr_namespace->ns_nr_unused--;
197 LASSERT(lock->l_resource->lr_namespace->ns_nr_unused >= 0);
199 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
203 void ldlm_lock_destroy(struct ldlm_lock *lock)
206 l_lock(&lock->l_resource->lr_namespace->ns_lock);
208 if (!list_empty(&lock->l_children)) {
209 LDLM_DEBUG(lock, "still has children (%p)!",
210 lock->l_children.next);
211 ldlm_lock_dump(lock);
214 if (lock->l_readers || lock->l_writers) {
215 LDLM_DEBUG(lock, "lock still has references");
216 ldlm_lock_dump(lock);
219 if (!list_empty(&lock->l_res_link)) {
220 ldlm_lock_dump(lock);
224 if (lock->l_destroyed) {
225 LASSERT(list_empty(&lock->l_lru));
226 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
230 lock->l_destroyed = 1;
232 list_del(&lock->l_export_chain);
233 lock->l_export = NULL;
234 ldlm_lock_remove_from_lru(lock);
236 /* Wake anyone waiting for this lock */
237 /* FIXME: I should probably add yet another flag, instead of using
238 * l_export to only call this on clients */
239 if (lock->l_export && lock->l_completion_ast)
240 lock->l_completion_ast(lock, 0);
242 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
248 usage: pass in a resource on which you have done get
249 pass in a parent lock on which you have done a get
250 do not put the resource or the parent
251 returns: lock with refcount 1
253 static struct ldlm_lock *ldlm_lock_new(struct ldlm_lock *parent,
254 struct ldlm_resource *resource)
256 struct ldlm_lock *lock;
259 if (resource == NULL)
262 lock = kmem_cache_alloc(ldlm_lock_slab, SLAB_KERNEL);
266 memset(lock, 0, sizeof(*lock));
267 get_random_bytes(&lock->l_random, sizeof(__u64));
269 lock->l_resource = resource;
270 /* this refcount matches the one of the resource passed
271 in which is not being put away */
272 atomic_set(&lock->l_refc, 1);
273 INIT_LIST_HEAD(&lock->l_children);
274 INIT_LIST_HEAD(&lock->l_res_link);
275 INIT_LIST_HEAD(&lock->l_lru);
276 INIT_LIST_HEAD(&lock->l_export_chain);
277 INIT_LIST_HEAD(&lock->l_pending_chain);
278 init_waitqueue_head(&lock->l_waitq);
280 spin_lock(&resource->lr_namespace->ns_counter_lock);
281 resource->lr_namespace->ns_locks++;
282 spin_unlock(&resource->lr_namespace->ns_counter_lock);
284 if (parent != NULL) {
285 l_lock(&parent->l_resource->lr_namespace->ns_lock);
286 lock->l_parent = parent;
287 list_add(&lock->l_childof, &parent->l_children);
288 l_unlock(&parent->l_resource->lr_namespace->ns_lock);
291 CDEBUG(D_MALLOC, "kmalloced 'lock': %d at "
292 "%p (tot %d).\n", sizeof(*lock), lock, 1);
293 /* this is the extra refcount, to prevent the lock from evaporating */
298 int ldlm_lock_change_resource(struct ldlm_lock *lock, __u64 new_resid[3])
300 struct ldlm_namespace *ns = lock->l_resource->lr_namespace;
301 struct ldlm_resource *oldres = lock->l_resource;
305 l_lock(&ns->ns_lock);
306 if (memcmp(new_resid, lock->l_resource->lr_name,
307 sizeof(lock->l_resource->lr_name)) == 0) {
309 l_unlock(&ns->ns_lock);
313 LASSERT(new_resid[0] != 0);
315 /* This function assumes that the lock isn't on any lists */
316 LASSERT(list_empty(&lock->l_res_link));
318 lock->l_resource = ldlm_resource_get(ns, NULL, new_resid,
319 lock->l_resource->lr_type, 1);
320 if (lock->l_resource == NULL) {
325 /* move references over */
326 refc = atomic_read(&lock->l_refc);
327 for (i = 0; i < refc; i++) {
329 ldlm_resource_getref(lock->l_resource);
330 rc = ldlm_resource_putref(oldres);
331 if (rc == 1 && i != refc - 1)
334 /* compensate for the initial get above.. */
335 ldlm_resource_putref(lock->l_resource);
337 l_unlock(&ns->ns_lock);
345 void ldlm_lock2handle(struct ldlm_lock *lock, struct lustre_handle *lockh)
347 lockh->addr = (__u64) (unsigned long)lock;
348 lockh->cookie = lock->l_random;
352 * if flags: atomically get the lock and set the flags.
353 * Return NULL if flag already set
356 struct ldlm_lock *__ldlm_handle2lock(struct lustre_handle *handle, int strict,
359 struct ldlm_lock *lock = NULL, *retval = NULL;
367 lock = (struct ldlm_lock *)(unsigned long)(handle->addr);
368 if (!kmem_cache_validate(ldlm_lock_slab, (void *)lock)) {
369 //CERROR("bogus lock %p\n", lock);
373 if (lock->l_random != handle->cookie) {
374 //CERROR("bogus cookie: lock %p has "LPX64" vs. handle "LPX64
375 // "\n", lock, lock->l_random, handle->cookie);
378 if (!lock->l_resource) {
379 CERROR("trying to lock bogus resource: lock %p\n", lock);
380 //LDLM_DEBUG(lock, "ldlm_handle2lock(%p)", lock);
383 if (!lock->l_resource->lr_namespace) {
384 CERROR("trying to lock bogus namespace: lock %p\n", lock);
385 //LDLM_DEBUG(lock, "ldlm_handle2lock(%p)", lock);
389 l_lock(&lock->l_resource->lr_namespace->ns_lock);
390 if (strict && lock->l_destroyed) {
391 CERROR("lock already destroyed: lock %p\n", lock);
392 //LDLM_DEBUG(lock, "ldlm_handle2lock(%p)", lock);
396 if (flags && (lock->l_flags & flags))
400 lock->l_flags |= flags;
402 retval = LDLM_LOCK_GET(lock);
404 CERROR("lock disappeared below us!!! %p\n", lock);
407 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
412 static int ldlm_plain_compat(struct ldlm_lock *a, struct ldlm_lock *b)
414 return lockmode_compat(a->l_req_mode, b->l_req_mode);
417 void ldlm_lock2desc(struct ldlm_lock *lock, struct ldlm_lock_desc *desc)
419 ldlm_res2desc(lock->l_resource, &desc->l_resource);
420 desc->l_req_mode = lock->l_req_mode;
421 desc->l_granted_mode = lock->l_granted_mode;
422 memcpy(&desc->l_extent, &lock->l_extent, sizeof(desc->l_extent));
423 memcpy(desc->l_version, lock->l_version, sizeof(desc->l_version));
426 static void ldlm_add_ast_work_item(struct ldlm_lock *lock,
427 struct ldlm_lock *new)
429 struct ldlm_ast_work *w;
432 l_lock(&lock->l_resource->lr_namespace->ns_lock);
433 if (new && (lock->l_flags & LDLM_FL_AST_SENT))
436 OBD_ALLOC(w, sizeof(*w));
443 lock->l_flags |= LDLM_FL_AST_SENT;
445 ldlm_lock2desc(new, &w->w_desc);
448 w->w_lock = LDLM_LOCK_GET(lock);
449 list_add(&w->w_list, lock->l_resource->lr_tmp);
451 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
455 void ldlm_lock_addref(struct lustre_handle *lockh, __u32 mode)
457 struct ldlm_lock *lock;
459 lock = ldlm_handle2lock(lockh);
460 ldlm_lock_addref_internal(lock, mode);
464 /* only called for local locks */
465 void ldlm_lock_addref_internal(struct ldlm_lock *lock, __u32 mode)
467 l_lock(&lock->l_resource->lr_namespace->ns_lock);
468 ldlm_lock_remove_from_lru(lock);
469 if (mode == LCK_NL || mode == LCK_CR || mode == LCK_PR)
473 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
475 LDLM_DEBUG(lock, "ldlm_lock_addref(%s)", ldlm_lockname[mode]);
478 /* Args: unlocked lock */
479 int ldlm_cli_cancel_unused_resource(struct ldlm_namespace *ns,
480 __u64 *res_id, int flags);
482 void ldlm_lock_decref(struct lustre_handle *lockh, __u32 mode)
484 struct ldlm_lock *lock = __ldlm_handle2lock(lockh, 0, 0);
485 struct ldlm_namespace *ns;
491 LDLM_DEBUG(lock, "ldlm_lock_decref(%s)", ldlm_lockname[mode]);
492 ns = lock->l_resource->lr_namespace;
493 l_lock(&lock->l_resource->lr_namespace->ns_lock);
494 if (mode == LCK_NL || mode == LCK_CR || mode == LCK_PR)
499 /* If we received a blocked AST and this was the last reference,
500 * run the callback. */
501 if (!lock->l_readers && !lock->l_writers &&
502 (lock->l_flags & LDLM_FL_CBPENDING)) {
503 if (!lock->l_resource->lr_namespace->ns_client &&
505 CERROR("FL_CBPENDING set on non-local lock--just a "
508 LDLM_DEBUG(lock, "final decref done on cbpending lock");
509 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
511 /* FIXME: need a real 'desc' here */
512 lock->l_blocking_ast(lock, NULL, lock->l_data,
513 lock->l_data_len, LDLM_CB_BLOCKING);
514 } else if (ns->ns_client && !lock->l_readers && !lock->l_writers) {
515 LASSERT(list_empty(&lock->l_lru));
516 LASSERT(ns->ns_nr_unused >= 0);
517 list_add_tail(&lock->l_lru, &ns->ns_unused_list);
519 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
522 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
524 LDLM_LOCK_PUT(lock); /* matches the ldlm_lock_get in addref */
525 LDLM_LOCK_PUT(lock); /* matches the handle2lock above */
530 static int ldlm_lock_compat_list(struct ldlm_lock *lock, int send_cbs,
531 struct list_head *queue)
533 struct list_head *tmp, *pos;
536 list_for_each_safe(tmp, pos, queue) {
537 struct ldlm_lock *child;
538 ldlm_res_compat compat;
540 child = list_entry(tmp, struct ldlm_lock, l_res_link);
544 compat = ldlm_res_compat_table[child->l_resource->lr_type];
545 if (compat && compat(child, lock)) {
546 CDEBUG(D_OTHER, "compat function succeded, next.\n");
549 if (lockmode_compat(child->l_granted_mode, lock->l_req_mode)) {
550 CDEBUG(D_OTHER, "lock modes are compatible, next.\n");
556 if (send_cbs && child->l_blocking_ast != NULL) {
557 CDEBUG(D_OTHER, "lock %p incompatible; sending "
558 "blocking AST.\n", child);
559 ldlm_add_ast_work_item(child, lock);
566 static int ldlm_lock_compat(struct ldlm_lock *lock, int send_cbs)
571 l_lock(&lock->l_resource->lr_namespace->ns_lock);
572 rc = ldlm_lock_compat_list(lock, send_cbs,
573 &lock->l_resource->lr_granted);
574 /* FIXME: should we be sending ASTs to converting? */
576 rc = ldlm_lock_compat_list
577 (lock, send_cbs, &lock->l_resource->lr_converting);
579 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
584 - ldlm_handle_enqueuque - resource
586 void ldlm_grant_lock(struct ldlm_lock *lock)
588 struct ldlm_resource *res = lock->l_resource;
591 l_lock(&lock->l_resource->lr_namespace->ns_lock);
592 ldlm_resource_add_lock(res, &res->lr_granted, lock);
593 lock->l_granted_mode = lock->l_req_mode;
595 if (lock->l_granted_mode < res->lr_most_restr)
596 res->lr_most_restr = lock->l_granted_mode;
598 if (lock->l_completion_ast) {
599 ldlm_add_ast_work_item(lock, NULL);
601 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
605 /* returns a referenced lock or NULL */
606 static struct ldlm_lock *search_queue(struct list_head *queue, ldlm_mode_t mode,
607 struct ldlm_extent *extent,
608 struct ldlm_lock *old_lock)
610 struct ldlm_lock *lock;
611 struct list_head *tmp;
613 list_for_each(tmp, queue) {
614 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
616 if (lock == old_lock)
619 if (lock->l_flags & LDLM_FL_CBPENDING)
622 if (lock->l_req_mode != mode)
625 if (lock->l_resource->lr_type == LDLM_EXTENT &&
626 (lock->l_extent.start > extent->start ||
627 lock->l_extent.end < extent->end))
630 if (lock->l_destroyed)
633 ldlm_lock_addref_internal(lock, mode);
640 /* Can be called in two ways:
642 * If 'ns' is NULL, then lockh describes an existing lock that we want to look
643 * for a duplicate of.
645 * Otherwise, all of the fields must be filled in, to match against.
647 * Returns 1 if it finds an already-existing lock that is compatible; in this
648 * case, lockh is filled in with a addref()ed lock
650 int ldlm_lock_match(struct ldlm_namespace *ns, __u64 *res_id, __u32 type,
651 void *cookie, int cookielen, ldlm_mode_t mode,
652 struct lustre_handle *lockh)
654 struct ldlm_resource *res;
655 struct ldlm_lock *lock, *old_lock = NULL;
660 old_lock = ldlm_handle2lock(lockh);
663 ns = old_lock->l_resource->lr_namespace;
664 res_id = old_lock->l_resource->lr_name;
665 type = old_lock->l_resource->lr_type;
666 mode = old_lock->l_req_mode;
669 res = ldlm_resource_get(ns, NULL, res_id, type, 0);
671 LASSERT(old_lock == NULL);
675 l_lock(&ns->ns_lock);
677 if ((lock = search_queue(&res->lr_granted, mode, cookie, old_lock)))
679 if ((lock = search_queue(&res->lr_converting, mode, cookie, old_lock)))
681 if ((lock = search_queue(&res->lr_waiting, mode, cookie, old_lock)))
686 ldlm_resource_putref(res);
687 l_unlock(&ns->ns_lock);
690 ldlm_lock2handle(lock, lockh);
691 if (lock->l_completion_ast)
692 lock->l_completion_ast(lock, LDLM_FL_WAIT_NOREPROC);
695 LDLM_DEBUG(lock, "matched");
697 LDLM_DEBUG_NOLOCK("not matched");
700 LDLM_LOCK_PUT(old_lock);
705 /* Returns a referenced lock */
706 struct ldlm_lock *ldlm_lock_create(struct ldlm_namespace *ns,
707 struct lustre_handle *parent_lock_handle,
708 __u64 * res_id, __u32 type,
709 ldlm_mode_t mode, void *data, __u32 data_len)
711 struct ldlm_resource *res, *parent_res = NULL;
712 struct ldlm_lock *lock, *parent_lock = NULL;
714 if (parent_lock_handle) {
715 parent_lock = ldlm_handle2lock(parent_lock_handle);
717 parent_res = parent_lock->l_resource;
720 res = ldlm_resource_get(ns, parent_res, res_id, type, 1);
724 lock = ldlm_lock_new(parent_lock, res);
726 ldlm_resource_putref(res);
730 lock->l_req_mode = mode;
732 lock->l_data_len = data_len;
737 /* Must be called with lock->l_lock and lock->l_resource->lr_lock not held */
738 ldlm_error_t ldlm_lock_enqueue(struct ldlm_lock * lock,
739 void *cookie, int cookie_len,
741 ldlm_completion_callback completion,
742 ldlm_blocking_callback blocking)
744 struct ldlm_resource *res;
746 ldlm_res_policy policy;
749 res = lock->l_resource;
750 lock->l_blocking_ast = blocking;
752 if (res->lr_type == LDLM_EXTENT)
753 memcpy(&lock->l_extent, cookie, sizeof(lock->l_extent));
755 /* policies are not executed on the client or during replay */
756 local = res->lr_namespace->ns_client;
757 if (!local && !(*flags & LDLM_FL_REPLAY) &&
758 (policy = ldlm_res_policy_table[res->lr_type])) {
760 rc = policy(lock, cookie, lock->l_req_mode, *flags, NULL);
762 if (rc == ELDLM_LOCK_CHANGED) {
763 res = lock->l_resource;
764 *flags |= LDLM_FL_LOCK_CHANGED;
765 } else if (rc == ELDLM_LOCK_ABORTED) {
766 ldlm_lock_destroy(lock);
771 l_lock(&res->lr_namespace->ns_lock);
772 if (local && lock->l_req_mode == lock->l_granted_mode) {
773 /* The server returned a blocked lock, but it was granted before
774 * we got a chance to actually enqueue it. We don't need to do
776 *flags &= ~(LDLM_FL_BLOCK_GRANTED |
777 LDLM_FL_BLOCK_CONV | LDLM_FL_BLOCK_WAIT);
781 /* This distinction between local lock trees is very important; a client
782 * namespace only has information about locks taken by that client, and
783 * thus doesn't have enough information to decide for itself if it can
784 * be granted (below). In this case, we do exactly what the server
785 * tells us to do, as dictated by the 'flags'.
787 * We do exactly the same thing during recovery, when the server is
788 * more or less trusting the clients not to lie.
790 * FIXME (bug 629283): Detect obvious lies by checking compatibility in
791 * granted/converting queues. */
792 ldlm_resource_unlink_lock(lock);
793 if (local || (*flags & LDLM_FL_REPLAY)) {
794 if (*flags & LDLM_FL_BLOCK_CONV)
795 ldlm_resource_add_lock(res, res->lr_converting.prev,
797 else if (*flags & (LDLM_FL_BLOCK_WAIT | LDLM_FL_BLOCK_GRANTED))
798 ldlm_resource_add_lock(res, res->lr_waiting.prev, lock);
800 ldlm_grant_lock(lock);
804 /* FIXME: We may want to optimize by checking lr_most_restr */
805 if (!list_empty(&res->lr_converting)) {
806 ldlm_resource_add_lock(res, res->lr_waiting.prev, lock);
807 *flags |= LDLM_FL_BLOCK_CONV;
810 if (!list_empty(&res->lr_waiting)) {
811 ldlm_resource_add_lock(res, res->lr_waiting.prev, lock);
812 *flags |= LDLM_FL_BLOCK_WAIT;
815 if (!ldlm_lock_compat(lock, 0)) {
816 ldlm_resource_add_lock(res, res->lr_waiting.prev, lock);
817 *flags |= LDLM_FL_BLOCK_GRANTED;
821 ldlm_grant_lock(lock);
824 l_unlock(&res->lr_namespace->ns_lock);
825 /* Don't set 'completion_ast' until here so that if the lock is granted
826 * immediately we don't do an unnecessary completion call. */
827 lock->l_completion_ast = completion;
831 /* Must be called with namespace taken: queue is waiting or converting. */
832 static int ldlm_reprocess_queue(struct ldlm_resource *res,
833 struct list_head *queue)
835 struct list_head *tmp, *pos;
838 list_for_each_safe(tmp, pos, queue) {
839 struct ldlm_lock *pending;
840 pending = list_entry(tmp, struct ldlm_lock, l_res_link);
842 CDEBUG(D_INFO, "Reprocessing lock %p\n", pending);
844 if (!ldlm_lock_compat(pending, 1))
847 list_del_init(&pending->l_res_link);
848 ldlm_grant_lock(pending);
854 void ldlm_run_ast_work(struct list_head *rpc_list)
856 struct list_head *tmp, *pos;
860 list_for_each_safe(tmp, pos, rpc_list) {
861 struct ldlm_ast_work *w =
862 list_entry(tmp, struct ldlm_ast_work, w_list);
865 rc = w->w_lock->l_blocking_ast
866 (w->w_lock, &w->w_desc, w->w_data,
867 w->w_datalen, LDLM_CB_BLOCKING);
869 rc = w->w_lock->l_completion_ast(w->w_lock, w->w_flags);
871 CERROR("Failed AST - should clean & disconnect "
873 LDLM_LOCK_PUT(w->w_lock);
874 list_del(&w->w_list);
875 OBD_FREE(w, sizeof(*w));
880 /* Must be called with resource->lr_lock not taken. */
881 void ldlm_reprocess_all(struct ldlm_resource *res)
883 struct list_head rpc_list = LIST_HEAD_INIT(rpc_list);
886 /* Local lock trees don't get reprocessed. */
887 if (res->lr_namespace->ns_client) {
892 l_lock(&res->lr_namespace->ns_lock);
893 res->lr_tmp = &rpc_list;
895 ldlm_reprocess_queue(res, &res->lr_converting);
896 if (list_empty(&res->lr_converting))
897 ldlm_reprocess_queue(res, &res->lr_waiting);
900 l_unlock(&res->lr_namespace->ns_lock);
902 ldlm_run_ast_work(&rpc_list);
906 void ldlm_cancel_callback(struct ldlm_lock *lock)
908 l_lock(&lock->l_resource->lr_namespace->ns_lock);
909 if (!(lock->l_flags & LDLM_FL_CANCEL)) {
910 lock->l_flags |= LDLM_FL_CANCEL;
911 if (lock->l_blocking_ast)
912 lock->l_blocking_ast(lock, NULL, lock->l_data,
916 LDLM_DEBUG(lock, "no blocking ast");
918 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
921 void ldlm_lock_cancel(struct ldlm_lock *lock)
923 struct ldlm_resource *res;
924 struct ldlm_namespace *ns;
927 res = lock->l_resource;
928 ns = res->lr_namespace;
930 l_lock(&ns->ns_lock);
931 if (lock->l_readers || lock->l_writers)
932 LDLM_DEBUG(lock, "lock still has references");
934 ldlm_cancel_callback(lock);
936 ldlm_del_waiting_lock(lock);
937 ldlm_resource_unlink_lock(lock);
938 ldlm_lock_destroy(lock);
939 l_unlock(&ns->ns_lock);
943 int ldlm_lock_set_data(struct lustre_handle *lockh, void *data, int datalen)
945 struct ldlm_lock *lock = ldlm_handle2lock(lockh);
952 lock->l_data_len = datalen;
959 void ldlm_cancel_locks_for_export(struct obd_export *exp)
961 struct list_head *iter, *n; /* MUST BE CALLED "n"! */
963 list_for_each_safe(iter, n, &exp->exp_ldlm_data.led_held_locks) {
964 struct ldlm_lock *lock;
965 struct ldlm_resource *res;
966 lock = list_entry(iter, struct ldlm_lock, l_export_chain);
967 res = ldlm_resource_getref(lock->l_resource);
968 LDLM_DEBUG(lock, "export %p", exp);
969 ldlm_lock_cancel(lock);
970 ldlm_reprocess_all(res);
971 ldlm_resource_putref(res);
975 struct ldlm_resource *ldlm_lock_convert(struct ldlm_lock *lock, int new_mode,
978 struct list_head rpc_list = LIST_HEAD_INIT(rpc_list);
979 struct ldlm_resource *res;
980 struct ldlm_namespace *ns;
984 res = lock->l_resource;
985 ns = res->lr_namespace;
987 l_lock(&ns->ns_lock);
989 lock->l_req_mode = new_mode;
990 ldlm_resource_unlink_lock(lock);
992 /* If this is a local resource, put it on the appropriate list. */
993 if (res->lr_namespace->ns_client) {
994 if (*flags & (LDLM_FL_BLOCK_CONV | LDLM_FL_BLOCK_GRANTED))
995 ldlm_resource_add_lock(res, res->lr_converting.prev,
998 /* This should never happen, because of the way the
999 * server handles conversions. */
1002 res->lr_tmp = &rpc_list;
1003 ldlm_grant_lock(lock);
1006 /* FIXME: completion handling not with ns_lock held ! */
1007 if (lock->l_completion_ast)
1008 lock->l_completion_ast(lock, 0);
1011 /* FIXME: We should try the conversion right away and possibly
1012 * return success without the need for an extra AST */
1013 ldlm_resource_add_lock(res, res->lr_converting.prev, lock);
1014 *flags |= LDLM_FL_BLOCK_CONV;
1017 l_unlock(&ns->ns_lock);
1020 ldlm_run_ast_work(&rpc_list);
1024 void ldlm_lock_dump(struct ldlm_lock *lock)
1028 if (!(portal_debug & D_OTHER))
1031 if (RES_VERSION_SIZE != 4)
1035 CDEBUG(D_OTHER, " NULL LDLM lock\n");
1039 snprintf(ver, sizeof(ver), "%x %x %x %x",
1040 lock->l_version[0], lock->l_version[1],
1041 lock->l_version[2], lock->l_version[3]);
1043 CDEBUG(D_OTHER, " -- Lock dump: %p (%s)\n", lock, ver);
1044 if (lock->l_export && lock->l_export->exp_connection)
1045 CDEBUG(D_OTHER, " Node: NID %x (rhandle: "LPX64")\n",
1046 lock->l_export->exp_connection->c_peer.peer_nid,
1047 lock->l_remote_handle.addr);
1049 CDEBUG(D_OTHER, " Node: local\n");
1050 CDEBUG(D_OTHER, " Parent: %p\n", lock->l_parent);
1051 CDEBUG(D_OTHER, " Resource: %p ("LPD64")\n", lock->l_resource,
1052 lock->l_resource->lr_name[0]);
1053 CDEBUG(D_OTHER, " Requested mode: %d, granted mode: %d\n",
1054 (int)lock->l_req_mode, (int)lock->l_granted_mode);
1055 CDEBUG(D_OTHER, " Readers: %u ; Writers; %u\n",
1056 lock->l_readers, lock->l_writers);
1057 if (lock->l_resource->lr_type == LDLM_EXTENT)
1058 CDEBUG(D_OTHER, " Extent: %Lu -> %Lu\n",
1059 (unsigned long long)lock->l_extent.start,
1060 (unsigned long long)lock->l_extent.end);