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.gnu.org/licenses/gpl-2.0.html
23 * Copyright (c) 2003, 2010, Oracle and/or its affiliates. All rights reserved.
24 * Use is subject to license terms.
26 * Copyright (c) 2011, 2017, Intel Corporation.
29 * This file is part of Lustre, http://www.lustre.org/
31 * lustre/ldlm/ldlm_plain.c
33 * Author: Peter Braam <braam@clusterfs.com>
34 * Author: Phil Schwan <phil@clusterfs.com>
38 * This file contains implementation of PLAIN lock type.
40 * PLAIN locks are the simplest form of LDLM locking, and are used when
41 * there only needs to be a single lock on a resource. This avoids some
42 * of the complexity of EXTENT and IBITS lock types, but doesn't allow
43 * different "parts" of a resource to be locked concurrently. Example
44 * use cases for PLAIN locks include locking of MGS configuration logs
45 * and (as of Lustre 2.4) quota records.
48 #define DEBUG_SUBSYSTEM S_LDLM
50 #include <lustre_dlm.h>
51 #include <obd_support.h>
52 #include <lustre_lib.h>
54 #include "ldlm_internal.h"
56 #ifdef HAVE_SERVER_SUPPORT
58 * Determine if the lock is compatible with all locks on the queue.
60 * If \a work_list is provided, conflicting locks are linked there.
61 * If \a work_list is not provided, we exit this function on first conflict.
63 * \retval 0 if there are conflicting locks in the \a queue
64 * \retval 1 if the lock is compatible to all locks in \a queue
67 ldlm_plain_compat_queue(struct list_head *queue, struct ldlm_lock *req,
68 struct list_head *work_list)
70 enum ldlm_mode req_mode = req->l_req_mode;
71 struct ldlm_lock *lock, *next_lock;
75 lockmode_verify(req_mode);
77 list_for_each_entry_safe(lock, next_lock, queue, l_res_link) {
80 * We stop walking the queue if we hit ourselves so we don't
81 * take conflicting locks enqueued after us into account,
82 * or we'd wait forever.
87 /* Advance loop cursor to last lock of mode group. */
88 next_lock = list_entry(list_entry(lock->l_sl_mode.prev,
90 l_sl_mode)->l_res_link.next,
91 struct ldlm_lock, l_res_link);
93 if (lockmode_compat(lock->l_req_mode, req_mode))
102 * Add locks of the mode group to \a work_list as
103 * blocking locks for \a req.
105 if (lock->l_blocking_ast)
106 ldlm_add_ast_work_item(lock, req, work_list);
109 struct list_head *head;
111 head = &lock->l_sl_mode;
112 list_for_each_entry(lock, head, l_sl_mode)
113 if (lock->l_blocking_ast)
114 ldlm_add_ast_work_item(lock, req,
123 * Process a granting attempt for plain lock.
124 * Must be called with ns lock held.
126 * This function looks for any conflicts for \a lock in the granted or
127 * waiting queues. The lock is granted if no conflicts are found in
130 int ldlm_process_plain_lock(struct ldlm_lock *lock, __u64 *flags,
131 enum ldlm_process_intention intention,
132 enum ldlm_error *err, struct list_head *work_list)
134 struct ldlm_resource *res = lock->l_resource;
135 struct list_head *grant_work = intention == LDLM_PROCESS_ENQUEUE ?
140 LASSERT(!ldlm_is_granted(lock));
141 check_res_locked(res);
144 if (intention == LDLM_PROCESS_RESCAN) {
145 LASSERT(work_list != NULL);
146 rc = ldlm_plain_compat_queue(&res->lr_granted, lock, NULL);
148 RETURN(LDLM_ITER_STOP);
149 rc = ldlm_plain_compat_queue(&res->lr_waiting, lock, NULL);
151 RETURN(LDLM_ITER_STOP);
153 ldlm_resource_unlink_lock(lock);
154 ldlm_grant_lock(lock, grant_work);
155 RETURN(LDLM_ITER_CONTINUE);
158 rc = ldlm_plain_compat_queue(&res->lr_granted, lock, work_list);
159 rc += ldlm_plain_compat_queue(&res->lr_waiting, lock, work_list);
162 ldlm_resource_unlink_lock(lock);
163 ldlm_grant_lock(lock, grant_work);
166 RETURN(LDLM_ITER_CONTINUE);
168 #endif /* HAVE_SERVER_SUPPORT */
170 void ldlm_plain_policy_wire_to_local(const union ldlm_wire_policy_data *wpolicy,
171 union ldlm_policy_data *lpolicy)
173 /* No policy for plain locks */
176 void ldlm_plain_policy_local_to_wire(const union ldlm_policy_data *lpolicy,
177 union ldlm_wire_policy_data *wpolicy)
179 /* No policy for plain locks */