* Author: Peter Braam <braam@clusterfs.com>
* Author: Phil Schwan <phil@clusterfs.com>
*
- * This file is part of Lustre, http://www.lustre.org.
+ * This file is part of the Lustre file system, http://www.lustre.org
+ * Lustre is a trademark of Cluster File Systems, Inc.
*
- * Lustre is free software; you can redistribute it and/or
- * modify it under the terms of version 2 of the GNU General Public
- * License as published by the Free Software Foundation.
+ * You may have signed or agreed to another license before downloading
+ * this software. If so, you are bound by the terms and conditions
+ * of that agreement, and the following does not apply to you. See the
+ * LICENSE file included with this distribution for more information.
*
- * Lustre is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- * GNU General Public License for more details.
+ * If you did not agree to a different license, then this copy of Lustre
+ * is open source software; you can redistribute it and/or modify it
+ * under the terms of version 2 of the GNU General Public License as
+ * published by the Free Software Foundation.
*
- * You should have received a copy of the GNU General Public License
- * along with Lustre; if not, write to the Free Software
- * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ * In either case, Lustre is distributed in the hope that it will be
+ * useful, but WITHOUT ANY WARRANTY; without even the implied warranty
+ * of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * license text for more details.
*/
#define DEBUG_SUBSYSTEM S_LDLM
#ifdef __KERNEL__
-#include <linux/lustre_dlm.h>
-#include <linux/obd_support.h>
-#include <linux/lustre_lib.h>
+#include <lustre_dlm.h>
+#include <obd_support.h>
+#include <lustre_lib.h>
#else
#include <liblustre.h>
#endif
-static int
-ldlm_plain_compat_queue(struct list_head *queue, struct ldlm_lock *new,
- int send_cbs, int first_enq)
+#include "ldlm_internal.h"
+
+static inline int
+ldlm_plain_compat_queue(struct list_head *queue, struct ldlm_lock *req,
+ struct list_head *work_list)
{
- struct list_head *tmp, *pos;
- ldlm_mode_t mode = new->l_req_mode;
+ struct list_head *tmp;
+ struct ldlm_lock *lock;
+ ldlm_mode_t req_mode = req->l_req_mode;
int compat = 1;
ENTRY;
- list_for_each_safe(tmp, pos, queue) {
- struct ldlm_lock *old;
+ lockmode_verify(req_mode);
- old = list_entry(tmp, struct ldlm_lock, l_res_link);
- if (old == new)
- continue;
+ list_for_each(tmp, queue) {
+ lock = list_entry(tmp, struct ldlm_lock, l_res_link);
- if (lockmode_compat(old->l_req_mode, mode) &&
- lockmode_compat(old->l_granted_mode, mode)) {
- CDEBUG(D_OTHER, "lock modes are compatible, next.\n");
+ if (req == lock)
+ RETURN(compat);
+
+ if (lockmode_compat(lock->l_req_mode, req_mode)) {
+ /* jump to next mode group */
+ if (LDLM_SL_HEAD(&lock->l_sl_mode))
+ tmp = &list_entry(lock->l_sl_mode.next,
+ struct ldlm_lock,
+ l_sl_mode)->l_res_link;
continue;
}
- compat = 0;
+ if (!work_list)
+ RETURN(0);
- /* if we're reprocessing the lock then the blocking ASTs
- * have already been sent. No need to continue. */
- if (!first_enq)
- break;
-
- if (send_cbs && (old->l_blocking_ast != NULL)) {
- CDEBUG(D_DLMTRACE, "lock %p incompatible; "
- "sending blocking AST.\n", old);
- ldlm_add_ast_work_item(old, new, NULL, 0);
- } else if (!(old->l_flags & LDLM_FL_LOCAL)) {
- CDEBUG(D_DLMTRACE, "lock %p incompatible; "
- "setting blocking AST.\n", old);
- old->l_flags |= LDLM_FL_AST_SENT;
- } else {
- CDEBUG(D_DLMTRACE, "local lock %p incompatible.\n",
- old);
+ compat = 0;
+ if (lock->l_blocking_ast)
+ ldlm_add_ast_work_item(lock, req, work_list);
+
+ if (LDLM_SL_HEAD(&lock->l_sl_mode)) {
+ /* add all members of the mode group */
+ do {
+ tmp = lock->l_res_link.next;
+ lock = list_entry(tmp, struct ldlm_lock,
+ l_res_link);
+ if (lock->l_blocking_ast)
+ ldlm_add_ast_work_item(
+ lock, req, work_list);
+ } while (!LDLM_SL_TAIL(&lock->l_sl_mode));
}
}
RETURN(compat);
}
-int
-ldlm_plain_enqueue(struct ldlm_lock **lockp, void *cookie, int *flags,
- int first_enq, ldlm_error_t *err)
+/* If first_enq is 0 (ie, called from ldlm_reprocess_queue):
+ * - blocking ASTs have already been sent
+ * - must call this function with the resource lock held
+ *
+ * If first_enq is 1 (ie, called from ldlm_lock_enqueue):
+ * - blocking ASTs have not been sent
+ * - must call this function with the resource lock held */
+int ldlm_process_plain_lock(struct ldlm_lock *lock, int *flags, int first_enq,
+ ldlm_error_t *err, struct list_head *work_list)
{
- struct ldlm_lock *lock = *lockp;
struct ldlm_resource *res = lock->l_resource;
- int convert_compat = 1;
- int waiting_compat = 1;
- int granted_compat = 1;
+ struct list_head rpc_list = CFS_LIST_HEAD_INIT(rpc_list);
+ int rc;
ENTRY;
- /* FIXME: We may want to optimize by checking lr_most_restr */
-
- /* On the first enqueue of this lock scan all of the queues
- * to set the LDLM_FL_AST_SENT flag in conflicting locks.
- * When the completion AST on the client side runs and sees
- * this flag is will set the LDLM_FL_CB_PENDING flag in the
- * lock so the client will know to cancel the lock as soon
- * as possible. This saves us from sending a blocking AST
- * in addition to the completion AST.
- *
- * If it's NOT the first enqueue of this lock then it must be
- * the first eligible lock in the queues because of the way that
- * ldlm_reprocess_all() works. So we don't have to check the
- * converting or waiting queues. */
- if (first_enq) {
- if (!list_empty(&res->lr_converting)) {
- convert_compat = 0;
- ldlm_plain_compat_queue(&res->lr_converting,
- lock, 0, first_enq);
- }
- if (!list_empty(&res->lr_waiting)) {
- waiting_compat = 0;
- ldlm_plain_compat_queue(&res->lr_waiting,
- lock, 0, first_enq);
- }
+ check_res_locked(res);
+ LASSERT(list_empty(&res->lr_converting));
+
+ if (!first_enq) {
+ LASSERT(work_list != NULL);
+ rc = ldlm_plain_compat_queue(&res->lr_granted, lock, NULL);
+ if (!rc)
+ RETURN(LDLM_ITER_STOP);
+ rc = ldlm_plain_compat_queue(&res->lr_waiting, lock, NULL);
+ if (!rc)
+ RETURN(LDLM_ITER_STOP);
+
+ ldlm_resource_unlink_lock(lock);
+ ldlm_grant_lock(lock, work_list);
+ RETURN(LDLM_ITER_CONTINUE);
}
- granted_compat =
- ldlm_plain_compat_queue(&res->lr_granted, lock, 1, first_enq);
- if (!convert_compat) {
- *flags |= LDLM_FL_BLOCK_CONV;
- RETURN(LDLM_ITER_STOP);
- }
- if (!waiting_compat) {
- *flags |= LDLM_FL_BLOCK_WAIT;
- RETURN(LDLM_ITER_STOP);
- }
- if (!granted_compat) {
+ restart:
+ rc = ldlm_plain_compat_queue(&res->lr_granted, lock, &rpc_list);
+ rc += ldlm_plain_compat_queue(&res->lr_waiting, lock, &rpc_list);
+
+ if (rc != 2) {
+ /* If either of the compat_queue()s returned 0, then we
+ * have ASTs to send and must go onto the waiting list.
+ *
+ * bug 2322: we used to unlink and re-add here, which was a
+ * terrible folly -- if we goto restart, we could get
+ * re-ordered! Causes deadlock, because ASTs aren't sent! */
+ if (list_empty(&lock->l_res_link))
+ ldlm_resource_add_lock(res, &res->lr_waiting, lock);
+ unlock_res(res);
+ rc = ldlm_run_bl_ast_work(&rpc_list);
+ lock_res(res);
+ if (rc == -ERESTART)
+ GOTO(restart, -ERESTART);
*flags |= LDLM_FL_BLOCK_GRANTED;
- RETURN(LDLM_ITER_STOP);
+ } else {
+ ldlm_resource_unlink_lock(lock);
+ ldlm_grant_lock(lock, NULL);
}
-
- list_del_init(&lock->l_res_link);
- ldlm_grant_lock(lock, NULL, 0);
-
- if (lock->l_flags & LDLM_FL_AST_SENT) {
- CDEBUG(D_DLMTRACE, "granted lock %p with AST set\n", lock);
- *flags |= (lock->l_flags & LDLM_FL_AST_SENT);
- }
-
- RETURN(LDLM_ITER_CONTINUE);
+ RETURN(0);
}