1 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
2 * vim:expandtab:shiftwidth=8:tabstop=8:
6 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License version 2 only,
10 * as published by the Free Software Foundation.
12 * This program is distributed in the hope that it will be useful, but
13 * WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * General Public License version 2 for more details (a copy is included
16 * in the LICENSE file that accompanied this code).
18 * You should have received a copy of the GNU General Public License
19 * version 2 along with this program; If not, see
20 * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
22 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
23 * CA 95054 USA or visit www.sun.com if you need additional information or
29 * Copyright (c) 2004, 2010, Oracle and/or its affiliates. All rights reserved.
30 * Use is subject to license terms.
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
36 * lustre/ldlm/ldlm_inodebits.c
38 * Author: Peter Braam <braam@clusterfs.com>
39 * Author: Phil Schwan <phil@clusterfs.com>
42 #define DEBUG_SUBSYSTEM S_LDLM
44 # include <liblustre.h>
47 #include <lustre_dlm.h>
48 #include <obd_support.h>
49 #include <lustre_lib.h>
51 #include "ldlm_internal.h"
53 /* Determine if the lock is compatible with all locks on the queue. */
55 ldlm_inodebits_compat_queue(cfs_list_t *queue, struct ldlm_lock *req,
56 cfs_list_t *work_list)
59 struct ldlm_lock *lock;
60 ldlm_mode_t req_mode = req->l_req_mode;
61 __u64 req_bits = req->l_policy_data.l_inodebits.bits;
65 LASSERT(req_bits); /* There is no sense in lock with no bits set,
66 I think. Also such a lock would be compatible
67 with any other bit lock */
69 cfs_list_for_each(tmp, queue) {
70 cfs_list_t *mode_tail;
72 lock = cfs_list_entry(tmp, struct ldlm_lock, l_res_link);
77 /* last lock in mode group */
78 LASSERT(lock->l_sl_mode.prev != NULL);
79 mode_tail = &cfs_list_entry(lock->l_sl_mode.prev,
81 l_sl_mode)->l_res_link;
83 /* locks are compatible, bits don't matter */
84 if (lockmode_compat(lock->l_req_mode, req_mode)) {
85 /* jump to last lock in mode group */
93 /* last lock in policy group */
94 tmp = &cfs_list_entry(lock->l_sl_policy.prev,
96 l_sl_policy)->l_res_link;
98 /* locks with bits overlapped are conflicting locks */
99 if (lock->l_policy_data.l_inodebits.bits & req_bits) {
100 /* COS lock from the same client is
102 if (lock->l_req_mode == LCK_COS &&
103 lock->l_client_cookie == req->l_client_cookie)
104 goto not_conflicting;
105 /* conflicting policy */
111 /* add locks of the policy group to
112 * @work_list as blocking locks for
114 if (lock->l_blocking_ast)
115 ldlm_add_ast_work_item(lock, req,
117 head = &lock->l_sl_policy;
118 cfs_list_for_each_entry(lock, head, l_sl_policy)
119 if (lock->l_blocking_ast)
120 ldlm_add_ast_work_item(lock, req,
124 if (tmp == mode_tail)
128 lock = cfs_list_entry(tmp, struct ldlm_lock,
130 } /* loop over policy groups within one mode group */
131 } /* loop over mode groups within @queue */
136 /* If first_enq is 0 (ie, called from ldlm_reprocess_queue):
137 * - blocking ASTs have already been sent
138 * - must call this function with the ns lock held
140 * If first_enq is 1 (ie, called from ldlm_lock_enqueue):
141 * - blocking ASTs have not been sent
142 * - must call this function with the ns lock held once */
143 int ldlm_process_inodebits_lock(struct ldlm_lock *lock, int *flags,
144 int first_enq, ldlm_error_t *err,
145 cfs_list_t *work_list)
147 struct ldlm_resource *res = lock->l_resource;
148 CFS_LIST_HEAD(rpc_list);
152 LASSERT(cfs_list_empty(&res->lr_converting));
153 check_res_locked(res);
156 LASSERT(work_list != NULL);
157 rc = ldlm_inodebits_compat_queue(&res->lr_granted, lock, NULL);
159 RETURN(LDLM_ITER_STOP);
160 rc = ldlm_inodebits_compat_queue(&res->lr_waiting, lock, NULL);
162 RETURN(LDLM_ITER_STOP);
164 ldlm_resource_unlink_lock(lock);
165 ldlm_grant_lock(lock, work_list);
166 RETURN(LDLM_ITER_CONTINUE);
170 rc = ldlm_inodebits_compat_queue(&res->lr_granted, lock, &rpc_list);
171 rc += ldlm_inodebits_compat_queue(&res->lr_waiting, lock, &rpc_list);
174 /* If either of the compat_queue()s returned 0, then we
175 * have ASTs to send and must go onto the waiting list.
177 * bug 2322: we used to unlink and re-add here, which was a
178 * terrible folly -- if we goto restart, we could get
179 * re-ordered! Causes deadlock, because ASTs aren't sent! */
180 if (cfs_list_empty(&lock->l_res_link))
181 ldlm_resource_add_lock(res, &res->lr_waiting, lock);
183 rc = ldlm_run_ast_work(&rpc_list, LDLM_WORK_BL_AST);
186 GOTO(restart, -ERESTART);
187 *flags |= LDLM_FL_BLOCK_GRANTED;
189 ldlm_resource_unlink_lock(lock);
190 ldlm_grant_lock(lock, NULL);