4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
20 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
21 * CA 95054 USA or visit www.sun.com if you need additional information or
27 * Copyright (c) 2004, 2010, Oracle and/or its affiliates. All rights reserved.
28 * Use is subject to license terms.
30 * Copyright (c) 2011, Whamcloud, Inc.
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 #ifdef HAVE_SERVER_SUPPORT
54 /* Determine if the lock is compatible with all locks on the queue. */
56 ldlm_inodebits_compat_queue(cfs_list_t *queue, struct ldlm_lock *req,
57 cfs_list_t *work_list)
60 struct ldlm_lock *lock;
61 ldlm_mode_t req_mode = req->l_req_mode;
62 __u64 req_bits = req->l_policy_data.l_inodebits.bits;
66 LASSERT(req_bits); /* There is no sense in lock with no bits set,
67 I think. Also such a lock would be compatible
68 with any other bit lock */
70 cfs_list_for_each(tmp, queue) {
71 cfs_list_t *mode_tail;
73 lock = cfs_list_entry(tmp, struct ldlm_lock, l_res_link);
78 /* last lock in mode group */
79 LASSERT(lock->l_sl_mode.prev != NULL);
80 mode_tail = &cfs_list_entry(lock->l_sl_mode.prev,
82 l_sl_mode)->l_res_link;
84 /* locks are compatible, bits don't matter */
85 if (lockmode_compat(lock->l_req_mode, req_mode)) {
86 /* jump to last lock in mode group */
94 /* last lock in policy group */
95 tmp = &cfs_list_entry(lock->l_sl_policy.prev,
97 l_sl_policy)->l_res_link;
99 /* locks with bits overlapped are conflicting locks */
100 if (lock->l_policy_data.l_inodebits.bits & req_bits) {
101 /* COS lock from the same client is
103 if (lock->l_req_mode == LCK_COS &&
104 lock->l_client_cookie == req->l_client_cookie)
105 goto not_conflicting;
106 /* conflicting policy */
112 /* add locks of the policy group to
113 * @work_list as blocking locks for
115 if (lock->l_blocking_ast)
116 ldlm_add_ast_work_item(lock, req,
118 head = &lock->l_sl_policy;
119 cfs_list_for_each_entry(lock, head, l_sl_policy)
120 if (lock->l_blocking_ast)
121 ldlm_add_ast_work_item(lock, req,
125 if (tmp == mode_tail)
129 lock = cfs_list_entry(tmp, struct ldlm_lock,
131 } /* loop over policy groups within one mode group */
132 } /* loop over mode groups within @queue */
137 /* If first_enq is 0 (ie, called from ldlm_reprocess_queue):
138 * - blocking ASTs have already been sent
139 * - must call this function with the ns lock held
141 * If first_enq is 1 (ie, called from ldlm_lock_enqueue):
142 * - blocking ASTs have not been sent
143 * - must call this function with the ns lock held once */
144 int ldlm_process_inodebits_lock(struct ldlm_lock *lock, __u64 *flags,
145 int first_enq, ldlm_error_t *err,
146 cfs_list_t *work_list)
148 struct ldlm_resource *res = lock->l_resource;
149 CFS_LIST_HEAD(rpc_list);
153 LASSERT(cfs_list_empty(&res->lr_converting));
154 check_res_locked(res);
157 LASSERT(work_list != NULL);
158 rc = ldlm_inodebits_compat_queue(&res->lr_granted, lock, NULL);
160 RETURN(LDLM_ITER_STOP);
161 rc = ldlm_inodebits_compat_queue(&res->lr_waiting, lock, NULL);
163 RETURN(LDLM_ITER_STOP);
165 ldlm_resource_unlink_lock(lock);
166 ldlm_grant_lock(lock, work_list);
167 RETURN(LDLM_ITER_CONTINUE);
171 rc = ldlm_inodebits_compat_queue(&res->lr_granted, lock, &rpc_list);
172 rc += ldlm_inodebits_compat_queue(&res->lr_waiting, lock, &rpc_list);
175 /* If either of the compat_queue()s returned 0, then we
176 * have ASTs to send and must go onto the waiting list.
178 * bug 2322: we used to unlink and re-add here, which was a
179 * terrible folly -- if we goto restart, we could get
180 * re-ordered! Causes deadlock, because ASTs aren't sent! */
181 if (cfs_list_empty(&lock->l_res_link))
182 ldlm_resource_add_lock(res, &res->lr_waiting, lock);
184 rc = ldlm_run_ast_work(ldlm_res_to_ns(res), &rpc_list,
188 GOTO(restart, -ERESTART);
189 *flags |= LDLM_FL_BLOCK_GRANTED;
191 ldlm_resource_unlink_lock(lock);
192 ldlm_grant_lock(lock, NULL);
196 #endif /* HAVE_SERVER_SUPPORT */
198 void ldlm_ibits_policy_wire_to_local(const ldlm_wire_policy_data_t *wpolicy,
199 ldlm_policy_data_t *lpolicy)
201 memset(lpolicy, 0, sizeof(*lpolicy));
202 lpolicy->l_inodebits.bits = wpolicy->l_inodebits.bits;
205 void ldlm_ibits_policy_local_to_wire(const ldlm_policy_data_t *lpolicy,
206 ldlm_wire_policy_data_t *wpolicy)
208 memset(wpolicy, 0, sizeof(*wpolicy));
209 wpolicy->l_inodebits.bits = lpolicy->l_inodebits.bits;