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;
95 static int ldlm_plain_compat(struct ldlm_lock *a, struct ldlm_lock *b);
97 ldlm_res_compat ldlm_res_compat_table[] = {
98 [LDLM_PLAIN] ldlm_plain_compat,
99 [LDLM_EXTENT] ldlm_extent_compat,
102 static ldlm_res_policy ldlm_intent_policy_func;
104 static int ldlm_plain_policy(struct ldlm_lock *lock, void *req_cookie,
105 ldlm_mode_t mode, int flags, void *data)
107 if ((flags & LDLM_FL_HAS_INTENT) && ldlm_intent_policy_func) {
108 return ldlm_intent_policy_func(lock, req_cookie, mode, flags,
115 ldlm_res_policy ldlm_res_policy_table[] = {
116 [LDLM_PLAIN] ldlm_plain_policy,
117 [LDLM_EXTENT] ldlm_extent_policy,
120 void ldlm_register_intent(ldlm_res_policy arg)
122 ldlm_intent_policy_func = arg;
125 void ldlm_unregister_intent(void)
127 ldlm_intent_policy_func = NULL;
131 * REFCOUNTED LOCK OBJECTS
136 * Lock refcounts, during creation:
137 * - one special one for allocation, dec'd only once in destroy
138 * - one for being a lock that's in-use
139 * - one for the addref associated with a new lock
141 struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock)
143 l_lock(&lock->l_resource->lr_namespace->ns_lock);
145 ldlm_resource_getref(lock->l_resource);
146 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
150 void ldlm_lock_put(struct ldlm_lock *lock)
152 struct ldlm_namespace *ns = lock->l_resource->lr_namespace;
155 l_lock(&ns->ns_lock);
157 //LDLM_DEBUG(lock, "after refc--");
158 if (lock->l_refc < 0)
161 if (ldlm_resource_put(lock->l_resource)) {
162 LASSERT(lock->l_refc == 0);
163 lock->l_resource = NULL;
166 LDLM_LOCK_PUT(lock->l_parent);
168 if (lock->l_refc == 0 && (lock->l_flags & LDLM_FL_DESTROYED)) {
169 l_unlock(&ns->ns_lock);
170 LDLM_DEBUG(lock, "final lock_put on destroyed lock, freeing");
172 //spin_lock(&ldlm_handle_lock);
173 spin_lock(&ns->ns_counter_lock);
175 spin_unlock(&ns->ns_counter_lock);
177 lock->l_resource = NULL;
178 lock->l_random = DEAD_HANDLE_MAGIC;
179 if (lock->l_export && lock->l_export->exp_connection)
180 ptlrpc_put_connection(lock->l_export->exp_connection);
181 kmem_cache_free(ldlm_lock_slab, lock);
182 //spin_unlock(&ldlm_handle_lock);
183 CDEBUG(D_MALLOC, "kfreed 'lock': %d at %p (tot 0).\n",
184 sizeof(*lock), lock);
186 l_unlock(&ns->ns_lock);
191 void ldlm_lock_destroy(struct ldlm_lock *lock)
194 l_lock(&lock->l_resource->lr_namespace->ns_lock);
196 if (!list_empty(&lock->l_children)) {
197 LDLM_DEBUG(lock, "still has children (%p)!",
198 lock->l_children.next);
199 ldlm_lock_dump(lock);
202 if (lock->l_readers || lock->l_writers) {
203 LDLM_DEBUG(lock, "lock still has references");
204 ldlm_lock_dump(lock);
207 if (!list_empty(&lock->l_res_link)) {
208 ldlm_lock_dump(lock);
212 if (lock->l_flags & LDLM_FL_DESTROYED) {
213 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
218 list_del_init(&lock->l_lru);
219 list_del(&lock->l_export_chain);
220 lock->l_export = NULL;
221 lock->l_flags |= LDLM_FL_DESTROYED;
223 /* Wake anyone waiting for this lock */
224 /* FIXME: I should probably add yet another flag, instead of using
225 * l_export to only call this on clients */
226 if (lock->l_export && lock->l_completion_ast)
227 lock->l_completion_ast(lock, 0);
229 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
235 usage: pass in a resource on which you have done get
236 pass in a parent lock on which you have done a get
237 do not put the resource or the parent
238 returns: lock with refcount 1
240 static struct ldlm_lock *ldlm_lock_new(struct ldlm_lock *parent,
241 struct ldlm_resource *resource)
243 struct ldlm_lock *lock;
246 if (resource == NULL)
249 lock = kmem_cache_alloc(ldlm_lock_slab, SLAB_KERNEL);
253 memset(lock, 0, sizeof(*lock));
254 get_random_bytes(&lock->l_random, sizeof(__u64));
256 lock->l_resource = resource;
257 /* this refcount matches the one of the resource passed
258 in which is not being put away */
260 INIT_LIST_HEAD(&lock->l_children);
261 INIT_LIST_HEAD(&lock->l_res_link);
262 INIT_LIST_HEAD(&lock->l_lru);
263 INIT_LIST_HEAD(&lock->l_export_chain);
264 INIT_LIST_HEAD(&lock->l_pending_chain);
265 init_waitqueue_head(&lock->l_waitq);
267 spin_lock(&resource->lr_namespace->ns_counter_lock);
268 resource->lr_namespace->ns_locks++;
269 spin_unlock(&resource->lr_namespace->ns_counter_lock);
271 if (parent != NULL) {
272 l_lock(&parent->l_resource->lr_namespace->ns_lock);
273 lock->l_parent = parent;
274 list_add(&lock->l_childof, &parent->l_children);
275 l_unlock(&parent->l_resource->lr_namespace->ns_lock);
278 CDEBUG(D_MALLOC, "kmalloced 'lock': %d at "
279 "%p (tot %d).\n", sizeof(*lock), lock, 1);
280 /* this is the extra refcount, to prevent the lock from evaporating */
285 int ldlm_lock_change_resource(struct ldlm_lock *lock, __u64 new_resid[3])
287 struct ldlm_namespace *ns = lock->l_resource->lr_namespace;
288 struct ldlm_resource *oldres = lock->l_resource;
292 l_lock(&ns->ns_lock);
293 if (memcmp(new_resid, lock->l_resource->lr_name,
294 sizeof(lock->l_resource->lr_name)) == 0) {
296 l_unlock(&ns->ns_lock);
300 type = lock->l_resource->lr_type;
301 if (new_resid[0] == 0)
303 lock->l_resource = ldlm_resource_get(ns, NULL, new_resid, type, 1);
304 if (lock->l_resource == NULL) {
309 /* move references over */
310 for (i = 0; i < lock->l_refc; i++) {
312 ldlm_resource_getref(lock->l_resource);
313 rc = ldlm_resource_put(oldres);
314 if (rc == 1 && i != lock->l_refc - 1)
317 /* compensate for the initial get above.. */
318 ldlm_resource_put(lock->l_resource);
320 l_unlock(&ns->ns_lock);
328 void ldlm_lock2handle(struct ldlm_lock *lock, struct lustre_handle *lockh)
330 lockh->addr = (__u64) (unsigned long)lock;
331 lockh->cookie = lock->l_random;
334 struct ldlm_lock *__ldlm_handle2lock(struct lustre_handle *handle,
337 struct ldlm_lock *lock = NULL, *retval = NULL;
340 if (!handle || !handle->addr)
343 //spin_lock(&ldlm_handle_lock);
344 lock = (struct ldlm_lock *)(unsigned long)(handle->addr);
345 if (!kmem_cache_validate(ldlm_lock_slab, (void *)lock)) {
346 CERROR("bogus lock %p\n", lock);
350 if (lock->l_random != handle->cookie) {
351 CERROR("bogus cookie: lock %p has "LPX64" vs. handle "LPX64"\n",
352 lock, lock->l_random, handle->cookie);
355 if (!lock->l_resource) {
356 CERROR("trying to lock bogus resource: lock %p\n", lock);
357 LDLM_DEBUG(lock, "ldlm_handle2lock(%p)", lock);
360 if (!lock->l_resource->lr_namespace) {
361 CERROR("trying to lock bogus namespace: lock %p\n", lock);
362 LDLM_DEBUG(lock, "ldlm_handle2lock(%p)", lock);
366 l_lock(&lock->l_resource->lr_namespace->ns_lock);
367 if (strict && lock->l_flags & LDLM_FL_DESTROYED) {
368 CERROR("lock already destroyed: lock %p\n", lock);
369 LDLM_DEBUG(lock, "ldlm_handle2lock(%p)", lock);
373 retval = LDLM_LOCK_GET(lock);
375 CERROR("lock disappeared below us!!! %p\n", lock);
378 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
380 //spin_unlock(&ldlm_handle_lock);
384 static int ldlm_plain_compat(struct ldlm_lock *a, struct ldlm_lock *b)
386 return lockmode_compat(a->l_req_mode, b->l_req_mode);
389 void ldlm_lock2desc(struct ldlm_lock *lock, struct ldlm_lock_desc *desc)
391 ldlm_res2desc(lock->l_resource, &desc->l_resource);
392 desc->l_req_mode = lock->l_req_mode;
393 desc->l_granted_mode = lock->l_granted_mode;
394 memcpy(&desc->l_extent, &lock->l_extent, sizeof(desc->l_extent));
395 memcpy(desc->l_version, lock->l_version, sizeof(desc->l_version));
398 static void ldlm_add_ast_work_item(struct ldlm_lock *lock,
399 struct ldlm_lock *new)
401 struct ldlm_ast_work *w;
404 l_lock(&lock->l_resource->lr_namespace->ns_lock);
405 if (new && (lock->l_flags & LDLM_FL_AST_SENT))
408 OBD_ALLOC(w, sizeof(*w));
415 lock->l_flags |= LDLM_FL_AST_SENT;
417 ldlm_lock2desc(new, &w->w_desc);
420 w->w_lock = LDLM_LOCK_GET(lock);
421 list_add(&w->w_list, lock->l_resource->lr_tmp);
423 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
427 void ldlm_lock_addref(struct lustre_handle *lockh, __u32 mode)
429 struct ldlm_lock *lock;
431 lock = ldlm_handle2lock(lockh);
432 ldlm_lock_addref_internal(lock, mode);
436 /* only called for local locks */
437 void ldlm_lock_addref_internal(struct ldlm_lock *lock, __u32 mode)
439 l_lock(&lock->l_resource->lr_namespace->ns_lock);
441 if (!list_empty(&lock->l_lru)) {
442 list_del_init(&lock->l_lru);
443 lock->l_resource->lr_namespace->ns_nr_unused--;
444 LASSERT(lock->l_resource->lr_namespace->ns_nr_unused >= 0);
447 if (mode == LCK_NL || mode == LCK_CR || mode == LCK_PR)
451 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
453 LDLM_DEBUG(lock, "ldlm_lock_addref(%s)", ldlm_lockname[mode]);
456 /* Args: unlocked lock */
457 int ldlm_cli_cancel_unused_resource(struct ldlm_namespace *ns,
458 __u64 *res_id, int flags);
460 void ldlm_lock_decref(struct lustre_handle *lockh, __u32 mode)
462 struct ldlm_lock *lock = __ldlm_handle2lock(lockh, 0);
463 struct ldlm_namespace *ns;
469 LDLM_DEBUG(lock, "ldlm_lock_decref(%s)", ldlm_lockname[mode]);
470 ns = lock->l_resource->lr_namespace;
471 l_lock(&lock->l_resource->lr_namespace->ns_lock);
472 if (mode == LCK_NL || mode == LCK_CR || mode == LCK_PR)
477 /* If we received a blocked AST and this was the last reference,
478 * run the callback. */
479 if (!lock->l_readers && !lock->l_writers &&
480 (lock->l_flags & LDLM_FL_CBPENDING)) {
481 if (!lock->l_resource->lr_namespace->ns_client &&
483 CERROR("FL_CBPENDING set on non-local lock--just a "
486 LDLM_DEBUG(lock, "final decref done on cbpending lock");
487 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
489 /* FIXME: need a real 'desc' here */
490 lock->l_blocking_ast(lock, NULL, lock->l_data,
491 lock->l_data_len, LDLM_CB_BLOCKING);
492 } else if (!lock->l_readers && !lock->l_writers) {
493 LASSERT(list_empty(&lock->l_lru));
494 LASSERT(ns->ns_nr_unused >= 0);
495 list_add_tail(&lock->l_lru, &ns->ns_unused_list);
497 if (ns->ns_client && ns->ns_nr_unused >= ns->ns_max_unused) {
498 CDEBUG(D_DLMTRACE, "%d unused (max %d), cancelling "
499 "LRU\n", ns->ns_nr_unused, ns->ns_max_unused);
500 ldlm_cli_cancel_unused_resource
501 (ns, lock->l_resource->lr_name, LDLM_FL_REDUCE);
503 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
505 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
507 LDLM_LOCK_PUT(lock); /* matches the ldlm_lock_get in addref */
508 LDLM_LOCK_PUT(lock); /* matches the handle2lock above */
513 static int ldlm_lock_compat_list(struct ldlm_lock *lock, int send_cbs,
514 struct list_head *queue)
516 struct list_head *tmp, *pos;
519 list_for_each_safe(tmp, pos, queue) {
520 struct ldlm_lock *child;
521 ldlm_res_compat compat;
523 child = list_entry(tmp, struct ldlm_lock, l_res_link);
527 compat = ldlm_res_compat_table[child->l_resource->lr_type];
528 if (compat && compat(child, lock)) {
529 CDEBUG(D_OTHER, "compat function succeded, next.\n");
532 if (lockmode_compat(child->l_granted_mode, lock->l_req_mode)) {
533 CDEBUG(D_OTHER, "lock modes are compatible, next.\n");
539 if (send_cbs && child->l_blocking_ast != NULL) {
540 CDEBUG(D_OTHER, "lock %p incompatible; sending "
541 "blocking AST.\n", child);
542 ldlm_add_ast_work_item(child, lock);
549 static int ldlm_lock_compat(struct ldlm_lock *lock, int send_cbs)
554 l_lock(&lock->l_resource->lr_namespace->ns_lock);
555 rc = ldlm_lock_compat_list(lock, send_cbs,
556 &lock->l_resource->lr_granted);
557 /* FIXME: should we be sending ASTs to converting? */
559 rc = ldlm_lock_compat_list
560 (lock, send_cbs, &lock->l_resource->lr_converting);
562 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
567 - ldlm_handle_enqueuque - resource
569 void ldlm_grant_lock(struct ldlm_lock *lock)
571 struct ldlm_resource *res = lock->l_resource;
574 l_lock(&lock->l_resource->lr_namespace->ns_lock);
575 ldlm_resource_add_lock(res, &res->lr_granted, lock);
576 lock->l_granted_mode = lock->l_req_mode;
578 if (lock->l_granted_mode < res->lr_most_restr)
579 res->lr_most_restr = lock->l_granted_mode;
581 if (lock->l_completion_ast) {
582 ldlm_add_ast_work_item(lock, NULL);
584 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
588 /* returns a referenced lock or NULL */
589 static struct ldlm_lock *search_queue(struct list_head *queue, ldlm_mode_t mode,
590 struct ldlm_extent *extent,
591 struct ldlm_lock *old_lock)
593 struct ldlm_lock *lock;
594 struct list_head *tmp;
596 list_for_each(tmp, queue) {
597 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
599 if (lock == old_lock)
602 if (lock->l_flags & (LDLM_FL_CBPENDING | LDLM_FL_DESTROYED))
605 /* lock_convert() takes the resource lock, so we're sure that
606 * req_mode and lr_type won't change beneath us */
607 if (lock->l_req_mode != mode)
610 if (lock->l_resource->lr_type == LDLM_EXTENT &&
611 (lock->l_extent.start > extent->start ||
612 lock->l_extent.end < extent->end))
615 ldlm_lock_addref_internal(lock, mode);
622 /* Can be called in two ways:
624 * If 'ns' is NULL, then lockh describes an existing lock that we want to look
625 * for a duplicate of.
627 * Otherwise, all of the fields must be filled in, to match against.
629 * Returns 1 if it finds an already-existing lock that is compatible; in this
630 * case, lockh is filled in with a addref()ed lock
632 int ldlm_lock_match(struct ldlm_namespace *ns, __u64 *res_id, __u32 type,
633 void *cookie, int cookielen, ldlm_mode_t mode,
634 struct lustre_handle *lockh)
636 struct ldlm_resource *res;
637 struct ldlm_lock *lock, *old_lock = NULL;
642 old_lock = ldlm_handle2lock(lockh);
645 ns = old_lock->l_resource->lr_namespace;
646 res_id = old_lock->l_resource->lr_name;
647 type = old_lock->l_resource->lr_type;
648 mode = old_lock->l_req_mode;
651 res = ldlm_resource_get(ns, NULL, res_id, type, 0);
653 LASSERT(old_lock == NULL);
657 ns = res->lr_namespace;
658 l_lock(&ns->ns_lock);
660 if ((lock = search_queue(&res->lr_granted, mode, cookie, old_lock)))
662 if ((lock = search_queue(&res->lr_converting, mode, cookie, old_lock)))
664 if ((lock = search_queue(&res->lr_waiting, mode, cookie, old_lock)))
669 ldlm_resource_put(res);
670 l_unlock(&ns->ns_lock);
673 ldlm_lock2handle(lock, lockh);
674 if (lock->l_completion_ast)
675 lock->l_completion_ast(lock, LDLM_FL_WAIT_NOREPROC);
678 LDLM_DEBUG(lock, "matched");
680 LDLM_DEBUG_NOLOCK("not matched");
683 LDLM_LOCK_PUT(old_lock);
688 /* Returns a referenced lock */
689 struct ldlm_lock *ldlm_lock_create(struct ldlm_namespace *ns,
690 struct lustre_handle *parent_lock_handle,
691 __u64 * res_id, __u32 type,
692 ldlm_mode_t mode, void *data, __u32 data_len)
694 struct ldlm_resource *res, *parent_res = NULL;
695 struct ldlm_lock *lock, *parent_lock;
697 parent_lock = ldlm_handle2lock(parent_lock_handle);
699 parent_res = parent_lock->l_resource;
701 res = ldlm_resource_get(ns, parent_res, res_id, type, 1);
705 lock = ldlm_lock_new(parent_lock, res);
707 ldlm_resource_put(res);
711 lock->l_req_mode = mode;
713 lock->l_data_len = data_len;
718 /* Must be called with lock->l_lock and lock->l_resource->lr_lock not held */
719 ldlm_error_t ldlm_lock_enqueue(struct ldlm_lock * lock,
720 void *cookie, int cookie_len,
722 ldlm_completion_callback completion,
723 ldlm_blocking_callback blocking)
725 struct ldlm_resource *res;
727 ldlm_res_policy policy;
730 res = lock->l_resource;
731 lock->l_blocking_ast = blocking;
733 if (res->lr_type == LDLM_EXTENT)
734 memcpy(&lock->l_extent, cookie, sizeof(lock->l_extent));
736 /* policies are not executed on the client or during replay */
737 local = res->lr_namespace->ns_client;
738 if (!local && !(*flags & LDLM_FL_REPLAY) &&
739 (policy = ldlm_res_policy_table[res->lr_type])) {
741 rc = policy(lock, cookie, lock->l_req_mode, *flags, NULL);
743 if (rc == ELDLM_LOCK_CHANGED) {
744 res = lock->l_resource;
745 *flags |= LDLM_FL_LOCK_CHANGED;
746 } else if (rc == ELDLM_LOCK_ABORTED) {
747 ldlm_lock_destroy(lock);
752 l_lock(&res->lr_namespace->ns_lock);
753 if (local && lock->l_req_mode == lock->l_granted_mode) {
754 /* The server returned a blocked lock, but it was granted before
755 * we got a chance to actually enqueue it. We don't need to do
757 *flags &= ~(LDLM_FL_BLOCK_GRANTED |
758 LDLM_FL_BLOCK_CONV | LDLM_FL_BLOCK_WAIT);
762 /* This distinction between local lock trees is very important; a client
763 * namespace only has information about locks taken by that client, and
764 * thus doesn't have enough information to decide for itself if it can
765 * be granted (below). In this case, we do exactly what the server
766 * tells us to do, as dictated by the 'flags'.
768 * We do exactly the same thing during recovery, when the server is
769 * more or less trusting the clients not to lie.
771 * FIXME (bug 629283): Detect obvious lies by checking compatibility in
772 * granted/converting queues. */
773 ldlm_resource_unlink_lock(lock);
774 if (local || (*flags & LDLM_FL_REPLAY)) {
775 if (*flags & LDLM_FL_BLOCK_CONV)
776 ldlm_resource_add_lock(res, res->lr_converting.prev,
778 else if (*flags & (LDLM_FL_BLOCK_WAIT | LDLM_FL_BLOCK_GRANTED))
779 ldlm_resource_add_lock(res, res->lr_waiting.prev, lock);
781 ldlm_grant_lock(lock);
785 /* FIXME: We may want to optimize by checking lr_most_restr */
786 if (!list_empty(&res->lr_converting)) {
787 ldlm_resource_add_lock(res, res->lr_waiting.prev, lock);
788 *flags |= LDLM_FL_BLOCK_CONV;
791 if (!list_empty(&res->lr_waiting)) {
792 ldlm_resource_add_lock(res, res->lr_waiting.prev, lock);
793 *flags |= LDLM_FL_BLOCK_WAIT;
796 if (!ldlm_lock_compat(lock, 0)) {
797 ldlm_resource_add_lock(res, res->lr_waiting.prev, lock);
798 *flags |= LDLM_FL_BLOCK_GRANTED;
802 ldlm_grant_lock(lock);
805 l_unlock(&res->lr_namespace->ns_lock);
806 /* Don't set 'completion_ast' until here so that if the lock is granted
807 * immediately we don't do an unnecessary completion call. */
808 lock->l_completion_ast = completion;
812 /* Must be called with namespace taken: queue is waiting or converting. */
813 static int ldlm_reprocess_queue(struct ldlm_resource *res,
814 struct list_head *queue)
816 struct list_head *tmp, *pos;
819 list_for_each_safe(tmp, pos, queue) {
820 struct ldlm_lock *pending;
821 pending = list_entry(tmp, struct ldlm_lock, l_res_link);
823 CDEBUG(D_INFO, "Reprocessing lock %p\n", pending);
825 if (!ldlm_lock_compat(pending, 1))
828 list_del_init(&pending->l_res_link);
829 ldlm_grant_lock(pending);
835 void ldlm_run_ast_work(struct list_head *rpc_list)
837 struct list_head *tmp, *pos;
841 list_for_each_safe(tmp, pos, rpc_list) {
842 struct ldlm_ast_work *w =
843 list_entry(tmp, struct ldlm_ast_work, w_list);
846 rc = w->w_lock->l_blocking_ast
847 (w->w_lock, &w->w_desc, w->w_data,
848 w->w_datalen, LDLM_CB_BLOCKING);
850 rc = w->w_lock->l_completion_ast(w->w_lock, w->w_flags);
852 CERROR("Failed AST - should clean & disconnect "
854 LDLM_LOCK_PUT(w->w_lock);
855 list_del(&w->w_list);
856 OBD_FREE(w, sizeof(*w));
861 /* Must be called with resource->lr_lock not taken. */
862 void ldlm_reprocess_all(struct ldlm_resource *res)
864 struct list_head rpc_list = LIST_HEAD_INIT(rpc_list);
867 /* Local lock trees don't get reprocessed. */
868 if (res->lr_namespace->ns_client) {
873 l_lock(&res->lr_namespace->ns_lock);
874 res->lr_tmp = &rpc_list;
876 ldlm_reprocess_queue(res, &res->lr_converting);
877 if (list_empty(&res->lr_converting))
878 ldlm_reprocess_queue(res, &res->lr_waiting);
881 l_unlock(&res->lr_namespace->ns_lock);
883 ldlm_run_ast_work(&rpc_list);
887 void ldlm_cancel_callback(struct ldlm_lock *lock)
889 l_lock(&lock->l_resource->lr_namespace->ns_lock);
890 if (!(lock->l_flags & LDLM_FL_CANCEL)) {
891 lock->l_flags |= LDLM_FL_CANCEL;
892 lock->l_blocking_ast(lock, NULL, lock->l_data,
893 lock->l_data_len, LDLM_CB_CANCELING);
895 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
898 void ldlm_lock_cancel(struct ldlm_lock *lock)
900 struct ldlm_resource *res;
901 struct ldlm_namespace *ns;
904 res = lock->l_resource;
905 ns = res->lr_namespace;
907 l_lock(&ns->ns_lock);
908 if (lock->l_readers || lock->l_writers)
909 CDEBUG(D_INFO, "lock still has references (%d readers, %d "
910 "writers)\n", lock->l_readers, lock->l_writers);
912 ldlm_cancel_callback(lock);
914 ldlm_del_waiting_lock(lock);
915 ldlm_resource_unlink_lock(lock);
916 ldlm_lock_destroy(lock);
917 l_unlock(&ns->ns_lock);
921 int ldlm_lock_set_data(struct lustre_handle *lockh, void *data, int datalen)
923 struct ldlm_lock *lock = ldlm_handle2lock(lockh);
930 lock->l_data_len = datalen;
937 void ldlm_cancel_locks_for_export(struct obd_export *exp)
939 struct list_head *iter, *n; /* MUST BE CALLED "n"! */
941 list_for_each_safe(iter, n, &exp->exp_ldlm_data.led_held_locks) {
942 struct ldlm_lock *lock;
943 struct ldlm_resource *res;
944 lock = list_entry(iter, struct ldlm_lock, l_export_chain);
945 res = ldlm_resource_getref(lock->l_resource);
946 LDLM_DEBUG(lock, "export %p", exp);
947 ldlm_lock_cancel(lock);
948 ldlm_reprocess_all(res);
949 ldlm_resource_put(res);
953 struct ldlm_resource *ldlm_lock_convert(struct ldlm_lock *lock, int new_mode,
956 struct list_head rpc_list = LIST_HEAD_INIT(rpc_list);
957 struct ldlm_resource *res;
958 struct ldlm_namespace *ns;
962 res = lock->l_resource;
963 ns = res->lr_namespace;
965 l_lock(&ns->ns_lock);
967 lock->l_req_mode = new_mode;
968 ldlm_resource_unlink_lock(lock);
970 /* If this is a local resource, put it on the appropriate list. */
971 if (res->lr_namespace->ns_client) {
972 if (*flags & (LDLM_FL_BLOCK_CONV | LDLM_FL_BLOCK_GRANTED))
973 ldlm_resource_add_lock(res, res->lr_converting.prev,
976 /* This should never happen, because of the way the
977 * server handles conversions. */
980 res->lr_tmp = &rpc_list;
981 ldlm_grant_lock(lock);
984 /* FIXME: completion handling not with ns_lock held ! */
985 if (lock->l_completion_ast)
986 lock->l_completion_ast(lock, 0);
989 /* FIXME: We should try the conversion right away and possibly
990 * return success without the need for an extra AST */
991 ldlm_resource_add_lock(res, res->lr_converting.prev, lock);
992 *flags |= LDLM_FL_BLOCK_CONV;
995 l_unlock(&ns->ns_lock);
998 ldlm_run_ast_work(&rpc_list);
1002 void ldlm_lock_dump(struct ldlm_lock *lock)
1006 if (!(portal_debug & D_OTHER))
1009 if (RES_VERSION_SIZE != 4)
1013 CDEBUG(D_OTHER, " NULL LDLM lock\n");
1017 snprintf(ver, sizeof(ver), "%x %x %x %x",
1018 lock->l_version[0], lock->l_version[1],
1019 lock->l_version[2], lock->l_version[3]);
1021 CDEBUG(D_OTHER, " -- Lock dump: %p (%s)\n", lock, ver);
1022 if (lock->l_export && lock->l_export->exp_connection)
1023 CDEBUG(D_OTHER, " Node: NID %x (rhandle: "LPX64")\n",
1024 lock->l_export->exp_connection->c_peer.peer_nid,
1025 lock->l_remote_handle.addr);
1027 CDEBUG(D_OTHER, " Node: local\n");
1028 CDEBUG(D_OTHER, " Parent: %p\n", lock->l_parent);
1029 CDEBUG(D_OTHER, " Resource: %p ("LPD64")\n", lock->l_resource,
1030 lock->l_resource->lr_name[0]);
1031 CDEBUG(D_OTHER, " Requested mode: %d, granted mode: %d\n",
1032 (int)lock->l_req_mode, (int)lock->l_granted_mode);
1033 CDEBUG(D_OTHER, " Readers: %u ; Writers; %u\n",
1034 lock->l_readers, lock->l_writers);
1035 if (lock->l_resource->lr_type == LDLM_EXTENT)
1036 CDEBUG(D_OTHER, " Extent: %Lu -> %Lu\n",
1037 (unsigned long long)lock->l_extent.start,
1038 (unsigned long long)lock->l_extent.end);