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) 2002, 2010, Oracle and/or its affiliates. All rights reserved.
28 * Use is subject to license terms.
30 * Copyright (c) 2010, 2014, Intel Corporation.
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
37 * This file contains Asynchronous System Trap (AST) handlers and related
38 * LDLM request-processing routines.
40 * An AST is a callback issued on a lock when its state is changed. There are
41 * several different types of ASTs (callbacks) registered for each lock:
43 * - completion AST: when a lock is enqueued by some process, but cannot be
44 * granted immediately due to other conflicting locks on the same resource,
45 * the completion AST is sent to notify the caller when the lock is
48 * - blocking AST: when a lock is granted to some process, if another process
49 * enqueues a conflicting (blocking) lock on a resource, a blocking AST is
50 * sent to notify the holder(s) of the lock(s) of the conflicting lock
51 * request. The lock holder(s) must release their lock(s) on that resource in
52 * a timely manner or be evicted by the server.
54 * - glimpse AST: this is used when a process wants information about a lock
55 * (i.e. the lock value block (LVB)) but does not necessarily require holding
56 * the lock. If the resource is locked, the lock holder(s) are sent glimpse
57 * ASTs and the LVB is returned to the caller, and lock holder(s) may CANCEL
58 * their lock(s) if they are idle. If the resource is not locked, the server
62 #define DEBUG_SUBSYSTEM S_LDLM
64 #include <lustre_dlm.h>
65 #include <obd_class.h>
68 #include "ldlm_internal.h"
70 unsigned int ldlm_enqueue_min = OBD_TIMEOUT_DEFAULT;
71 CFS_MODULE_PARM(ldlm_enqueue_min, "i", uint, 0644,
72 "lock enqueue timeout minimum");
74 /* in client side, whether the cached locks will be canceled before replay */
75 unsigned int ldlm_cancel_unused_locks_before_replay = 1;
77 static void interrupted_completion_wait(void *data)
81 struct lock_wait_data {
82 struct ldlm_lock *lwd_lock;
86 struct ldlm_async_args {
87 struct lustre_handle lock_handle;
90 int ldlm_expired_completion_wait(void *data)
92 struct lock_wait_data *lwd = data;
93 struct ldlm_lock *lock = lwd->lwd_lock;
94 struct obd_import *imp;
95 struct obd_device *obd;
98 if (lock->l_conn_export == NULL) {
99 static cfs_time_t next_dump = 0, last_dump = 0;
101 LCONSOLE_WARN("lock timed out (enqueued at "CFS_TIME_T", "
102 CFS_DURATION_T"s ago)\n",
103 lock->l_last_activity,
104 cfs_time_sub(cfs_time_current_sec(),
105 lock->l_last_activity));
106 LDLM_DEBUG(lock, "lock timed out (enqueued at "CFS_TIME_T", "
107 CFS_DURATION_T"s ago); not entering recovery in "
108 "server code, just going back to sleep",
109 lock->l_last_activity,
110 cfs_time_sub(cfs_time_current_sec(),
111 lock->l_last_activity));
112 if (cfs_time_after(cfs_time_current(), next_dump)) {
113 last_dump = next_dump;
114 next_dump = cfs_time_shift(300);
115 ldlm_namespace_dump(D_DLMTRACE,
116 ldlm_lock_to_ns(lock));
118 libcfs_debug_dumplog();
123 obd = lock->l_conn_export->exp_obd;
124 imp = obd->u.cli.cl_import;
125 ptlrpc_fail_import(imp, lwd->lwd_conn_cnt);
126 LDLM_ERROR(lock, "lock timed out (enqueued at "CFS_TIME_T", "
127 CFS_DURATION_T"s ago), entering recovery for %s@%s",
128 lock->l_last_activity,
129 cfs_time_sub(cfs_time_current_sec(), lock->l_last_activity),
130 obd2cli_tgt(obd), imp->imp_connection->c_remote_uuid.uuid);
136 * Calculate the Completion timeout (covering enqueue, BL AST, data flush,
137 * lock cancel, and their replies). Used for lock completion timeout on the
140 * \param[in] lock lock which is waiting the completion callback
142 * \retval timeout in seconds to wait for the server reply
145 /* We use the same basis for both server side and client side functions
146 from a single node. */
147 static unsigned int ldlm_cp_timeout(struct ldlm_lock *lock)
149 unsigned int timeout;
154 /* Wait a long time for enqueue - server may have to callback a
155 * lock from another client. Server will evict the other client if it
156 * doesn't respond reasonably, and then give us the lock. */
157 timeout = at_get(ldlm_lock_to_ns_at(lock));
158 return max(3 * timeout, ldlm_enqueue_min);
162 * Helper function for ldlm_completion_ast(), updating timings when lock is
165 static int ldlm_completion_tail(struct ldlm_lock *lock, void *data)
170 if (ldlm_is_destroyed(lock) || ldlm_is_failed(lock)) {
171 LDLM_DEBUG(lock, "client-side enqueue: destroyed");
173 } else if (data == NULL) {
174 LDLM_DEBUG(lock, "client-side enqueue: granted");
176 /* Take into AT only CP RPC, not immediately granted locks */
177 delay = cfs_time_sub(cfs_time_current_sec(),
178 lock->l_last_activity);
179 LDLM_DEBUG(lock, "client-side enqueue: granted after "
180 CFS_DURATION_T"s", delay);
182 /* Update our time estimate */
183 at_measured(ldlm_lock_to_ns_at(lock), delay);
189 * Implementation of ->l_completion_ast() for a client, that doesn't wait
190 * until lock is granted. Suitable for locks enqueued through ptlrpcd, of
191 * other threads that cannot block for long.
193 int ldlm_completion_ast_async(struct ldlm_lock *lock, __u64 flags, void *data)
197 if (flags == LDLM_FL_WAIT_NOREPROC) {
198 LDLM_DEBUG(lock, "client-side enqueue waiting on pending lock");
202 if (!(flags & LDLM_FL_BLOCKED_MASK)) {
203 wake_up(&lock->l_waitq);
204 RETURN(ldlm_completion_tail(lock, data));
207 LDLM_DEBUG(lock, "client-side enqueue returned a blocked lock, "
209 ldlm_reprocess_all(lock->l_resource);
212 EXPORT_SYMBOL(ldlm_completion_ast_async);
215 * Generic LDLM "completion" AST. This is called in several cases:
217 * - when a reply to an ENQUEUE RPC is received from the server
218 * (ldlm_cli_enqueue_fini()). Lock might be granted or not granted at
219 * this point (determined by flags);
221 * - when LDLM_CP_CALLBACK RPC comes to client to notify it that lock has
224 * - when ldlm_lock_match(LDLM_FL_LVB_READY) is about to wait until lock
227 * - to force all locks when resource is destroyed (cleanup_resource());
229 * - during lock conversion (not used currently).
231 * If lock is not granted in the first case, this function waits until second
232 * or penultimate cases happen in some other thread.
235 int ldlm_completion_ast(struct ldlm_lock *lock, __u64 flags, void *data)
237 /* XXX ALLOCATE - 160 bytes */
238 struct lock_wait_data lwd;
239 struct obd_device *obd;
240 struct obd_import *imp = NULL;
241 struct l_wait_info lwi;
246 if (flags == LDLM_FL_WAIT_NOREPROC) {
247 LDLM_DEBUG(lock, "client-side enqueue waiting on pending lock");
251 if (!(flags & LDLM_FL_BLOCKED_MASK)) {
252 wake_up(&lock->l_waitq);
256 LDLM_DEBUG(lock, "client-side enqueue returned a blocked lock, "
261 obd = class_exp2obd(lock->l_conn_export);
263 /* if this is a local lock, then there is no import */
265 imp = obd->u.cli.cl_import;
268 timeout = ldlm_cp_timeout(lock);
271 lock->l_last_activity = cfs_time_current_sec();
273 if (ldlm_is_no_timeout(lock)) {
274 LDLM_DEBUG(lock, "waiting indefinitely because of NO_TIMEOUT");
275 lwi = LWI_INTR(interrupted_completion_wait, &lwd);
277 lwi = LWI_TIMEOUT_INTR(cfs_time_seconds(timeout),
278 ldlm_expired_completion_wait,
279 interrupted_completion_wait, &lwd);
283 spin_lock(&imp->imp_lock);
284 lwd.lwd_conn_cnt = imp->imp_conn_cnt;
285 spin_unlock(&imp->imp_lock);
288 if (ns_is_client(ldlm_lock_to_ns(lock)) &&
289 OBD_FAIL_CHECK_RESET(OBD_FAIL_LDLM_INTR_CP_AST,
290 OBD_FAIL_LDLM_CP_BL_RACE | OBD_FAIL_ONCE)) {
291 ldlm_set_fail_loc(lock);
294 /* Go to sleep until the lock is granted or cancelled. */
295 rc = l_wait_event(lock->l_waitq,
296 is_granted_or_cancelled(lock), &lwi);
300 LDLM_DEBUG(lock, "client-side enqueue waking up: failed (%d)",
305 RETURN(ldlm_completion_tail(lock, data));
307 EXPORT_SYMBOL(ldlm_completion_ast);
310 * A helper to build a blocking AST function
312 * Perform a common operation for blocking ASTs:
313 * defferred lock cancellation.
315 * \param lock the lock blocking or canceling AST was called on
317 * \see mdt_blocking_ast
318 * \see ldlm_blocking_ast
320 int ldlm_blocking_ast_nocheck(struct ldlm_lock *lock)
325 ldlm_set_cbpending(lock);
326 do_ast = (!lock->l_readers && !lock->l_writers);
327 unlock_res_and_lock(lock);
330 struct lustre_handle lockh;
333 LDLM_DEBUG(lock, "already unused, calling ldlm_cli_cancel");
334 ldlm_lock2handle(lock, &lockh);
335 rc = ldlm_cli_cancel(&lockh, LCF_ASYNC);
337 CERROR("ldlm_cli_cancel: %d\n", rc);
339 LDLM_DEBUG(lock, "Lock still has references, will be "
344 EXPORT_SYMBOL(ldlm_blocking_ast_nocheck);
347 * Server blocking AST
349 * ->l_blocking_ast() callback for LDLM locks acquired by server-side
352 * \param lock the lock which blocks a request or cancelling lock
355 * \param flag indicates whether this cancelling or blocking callback
357 * \see ldlm_blocking_ast_nocheck
359 int ldlm_blocking_ast(struct ldlm_lock *lock, struct ldlm_lock_desc *desc,
360 void *data, int flag)
364 if (flag == LDLM_CB_CANCELING) {
365 /* Don't need to do anything here. */
369 lock_res_and_lock(lock);
370 /* Get this: if ldlm_blocking_ast is racing with intent_policy, such
371 * that ldlm_blocking_ast is called just before intent_policy method
372 * takes the lr_lock, then by the time we get the lock, we might not
373 * be the correct blocking function anymore. So check, and return
375 if (lock->l_blocking_ast != ldlm_blocking_ast) {
376 unlock_res_and_lock(lock);
379 RETURN(ldlm_blocking_ast_nocheck(lock));
381 EXPORT_SYMBOL(ldlm_blocking_ast);
384 * Implements ldlm_lock::l_glimpse_ast for extent locks acquired on the server.
386 * Returning -ELDLM_NO_LOCK_DATA actually works, but the reason for that is
387 * rather subtle: with OST-side locking, it may so happen that _all_ extent
388 * locks are held by the OST. If client wants to obtain the current file size
389 * it calls ll_glimpse_size(), and (as all locks are held only on the server),
390 * this dummy glimpse callback fires and does nothing. The client still
391 * receives the correct file size due to the following fragment of code in
392 * ldlm_cb_interpret():
394 * if (rc == -ELDLM_NO_LOCK_DATA) {
395 * LDLM_DEBUG(lock, "lost race - client has a lock but no"
397 * ldlm_res_lvbo_update(lock->l_resource, NULL, 1);
400 * That is, after the glimpse returns this error, ofd_lvbo_update() is called
401 * and returns the updated file attributes from the inode to the client.
403 * See also comment in ofd_intent_policy() on why servers must set a non-NULL
404 * l_glimpse_ast when grabbing DLM locks. Otherwise, the server will assume
405 * that the object is in the process of being destroyed.
407 * \param[in] lock DLM lock being glimpsed, unused
408 * \param[in] reqp pointer to ptlrpc_request, unused
410 * \retval -ELDLM_NO_LOCK_DATA to get attributes from disk object
412 int ldlm_glimpse_ast(struct ldlm_lock *lock, void *reqp)
414 return -ELDLM_NO_LOCK_DATA;
418 * Enqueue a local lock (typically on a server).
420 int ldlm_cli_enqueue_local(struct ldlm_namespace *ns,
421 const struct ldlm_res_id *res_id,
422 enum ldlm_type type, union ldlm_policy_data *policy,
423 enum ldlm_mode mode, __u64 *flags,
424 ldlm_blocking_callback blocking,
425 ldlm_completion_callback completion,
426 ldlm_glimpse_callback glimpse,
427 void *data, __u32 lvb_len, enum lvb_type lvb_type,
428 const __u64 *client_cookie,
429 struct lustre_handle *lockh)
431 struct ldlm_lock *lock;
433 const struct ldlm_callback_suite cbs = { .lcs_completion = completion,
434 .lcs_blocking = blocking,
435 .lcs_glimpse = glimpse,
439 LASSERT(!(*flags & LDLM_FL_REPLAY));
440 if (unlikely(ns_is_client(ns))) {
441 CERROR("Trying to enqueue local lock in a shadow namespace\n");
445 lock = ldlm_lock_create(ns, res_id, type, mode, &cbs, data, lvb_len,
448 GOTO(out_nolock, err = PTR_ERR(lock));
450 err = ldlm_lvbo_init(lock->l_resource);
452 LDLM_ERROR(lock, "delayed lvb init failed (rc %d)", err);
456 ldlm_lock2handle(lock, lockh);
458 /* NB: we don't have any lock now (lock_res_and_lock)
459 * because it's a new lock */
460 ldlm_lock_addref_internal_nolock(lock, mode);
461 ldlm_set_local(lock);
462 if (*flags & LDLM_FL_ATOMIC_CB)
463 ldlm_set_atomic_cb(lock);
466 lock->l_policy_data = *policy;
467 if (client_cookie != NULL)
468 lock->l_client_cookie = *client_cookie;
469 if (type == LDLM_EXTENT) {
470 /* extent lock without policy is a bug */
474 lock->l_req_extent = policy->l_extent;
477 err = ldlm_lock_enqueue(ns, &lock, policy, flags);
478 if (unlikely(err != ELDLM_OK))
482 *policy = lock->l_policy_data;
484 if (lock->l_completion_ast)
485 lock->l_completion_ast(lock, *flags, NULL);
487 LDLM_DEBUG(lock, "client-side local enqueue handler, new lock created");
490 LDLM_LOCK_RELEASE(lock);
494 EXPORT_SYMBOL(ldlm_cli_enqueue_local);
496 static void failed_lock_cleanup(struct ldlm_namespace *ns,
497 struct ldlm_lock *lock, int mode)
501 /* Set a flag to prevent us from sending a CANCEL (bug 407) */
502 lock_res_and_lock(lock);
503 /* Check that lock is not granted or failed, we might race. */
504 if ((lock->l_req_mode != lock->l_granted_mode) &&
505 !ldlm_is_failed(lock)) {
506 /* Make sure that this lock will not be found by raced
507 * bl_ast and -EINVAL reply is sent to server anyways.
509 lock->l_flags |= LDLM_FL_LOCAL_ONLY | LDLM_FL_FAILED |
510 LDLM_FL_ATOMIC_CB | LDLM_FL_CBPENDING;
513 unlock_res_and_lock(lock);
517 "setting FL_LOCAL_ONLY | LDLM_FL_FAILED | "
518 "LDLM_FL_ATOMIC_CB | LDLM_FL_CBPENDING");
520 LDLM_DEBUG(lock, "lock was granted or failed in race");
522 /* XXX - HACK because we shouldn't call ldlm_lock_destroy()
523 * from llite/file.c/ll_file_flock(). */
524 /* This code makes for the fact that we do not have blocking handler on
525 * a client for flock locks. As such this is the place where we must
526 * completely kill failed locks. (interrupted and those that
527 * were waiting to be granted when server evicted us. */
528 if (lock->l_resource->lr_type == LDLM_FLOCK) {
529 lock_res_and_lock(lock);
530 if (!ldlm_is_destroyed(lock)) {
531 ldlm_resource_unlink_lock(lock);
532 ldlm_lock_decref_internal_nolock(lock, mode);
533 ldlm_lock_destroy_nolock(lock);
535 unlock_res_and_lock(lock);
537 ldlm_lock_decref_internal(lock, mode);
542 * Finishing portion of client lock enqueue code.
544 * Called after receiving reply from server.
546 int ldlm_cli_enqueue_fini(struct obd_export *exp, struct ptlrpc_request *req,
547 enum ldlm_type type, __u8 with_policy,
548 enum ldlm_mode mode, __u64 *flags, void *lvb,
549 __u32 lvb_len, struct lustre_handle *lockh, int rc)
551 struct ldlm_namespace *ns = exp->exp_obd->obd_namespace;
552 int is_replay = *flags & LDLM_FL_REPLAY;
553 struct ldlm_lock *lock;
554 struct ldlm_reply *reply;
555 int cleanup_phase = 1;
558 lock = ldlm_handle2lock(lockh);
559 /* ldlm_cli_enqueue is holding a reference on this lock. */
561 LASSERT(type == LDLM_FLOCK);
565 LASSERTF(ergo(lvb_len != 0, lvb_len == lock->l_lvb_len),
566 "lvb_len = %d, l_lvb_len = %d\n", lvb_len, lock->l_lvb_len);
568 if (rc != ELDLM_OK) {
570 LDLM_DEBUG(lock, "client-side enqueue END (%s)",
571 rc == ELDLM_LOCK_ABORTED ? "ABORTED" : "FAILED");
573 if (rc != ELDLM_LOCK_ABORTED)
577 /* Before we return, swab the reply */
578 reply = req_capsule_server_get(&req->rq_pill, &RMF_DLM_REP);
580 GOTO(cleanup, rc = -EPROTO);
585 size = req_capsule_get_size(&req->rq_pill, &RMF_DLM_LVB,
588 LDLM_ERROR(lock, "Fail to get lvb_len, rc = %d", size);
589 GOTO(cleanup, rc = size);
590 } else if (unlikely(size > lvb_len)) {
591 LDLM_ERROR(lock, "Replied LVB is larger than "
592 "expectation, expected = %d, replied = %d",
594 GOTO(cleanup, rc = -EINVAL);
599 if (rc == ELDLM_LOCK_ABORTED) {
600 if (lvb_len > 0 && lvb != NULL)
601 rc = ldlm_fill_lvb(lock, &req->rq_pill, RCL_SERVER,
603 GOTO(cleanup, rc = rc ? : ELDLM_LOCK_ABORTED);
606 /* lock enqueued on the server */
609 lock_res_and_lock(lock);
610 /* Key change rehash lock in per-export hash with new key */
611 if (exp->exp_lock_hash) {
612 /* In the function below, .hs_keycmp resolves to
613 * ldlm_export_lock_keycmp() */
614 /* coverity[overrun-buffer-val] */
615 cfs_hash_rehash_key(exp->exp_lock_hash,
616 &lock->l_remote_handle,
620 lock->l_remote_handle = reply->lock_handle;
623 *flags = ldlm_flags_from_wire(reply->lock_flags);
624 lock->l_flags |= ldlm_flags_from_wire(reply->lock_flags &
625 LDLM_FL_INHERIT_MASK);
626 unlock_res_and_lock(lock);
628 CDEBUG(D_INFO, "local: %p, remote cookie: "LPX64", flags: "LPX64"\n",
629 lock, reply->lock_handle.cookie, *flags);
631 /* If enqueue returned a blocked lock but the completion handler has
632 * already run, then it fixed up the resource and we don't need to do it
634 if ((*flags) & LDLM_FL_LOCK_CHANGED) {
635 int newmode = reply->lock_desc.l_req_mode;
637 if (newmode && newmode != lock->l_req_mode) {
638 LDLM_DEBUG(lock, "server returned different mode %s",
639 ldlm_lockname[newmode]);
640 lock->l_req_mode = newmode;
643 if (!ldlm_res_eq(&reply->lock_desc.l_resource.lr_name,
644 &lock->l_resource->lr_name)) {
645 CDEBUG(D_INFO, "remote intent success, locking "DLDLMRES
646 " instead of "DLDLMRES"\n",
647 PLDLMRES(&reply->lock_desc.l_resource),
648 PLDLMRES(lock->l_resource));
650 rc = ldlm_lock_change_resource(ns, lock,
651 &reply->lock_desc.l_resource.lr_name);
652 if (rc || lock->l_resource == NULL)
653 GOTO(cleanup, rc = -ENOMEM);
654 LDLM_DEBUG(lock, "client-side enqueue, new resource");
657 if (!(type == LDLM_IBITS &&
658 !(exp_connect_flags(exp) & OBD_CONNECT_IBITS)))
659 /* We assume lock type cannot change on server*/
660 ldlm_convert_policy_to_local(exp,
661 lock->l_resource->lr_type,
662 &reply->lock_desc.l_policy_data,
663 &lock->l_policy_data);
664 if (type != LDLM_PLAIN)
665 LDLM_DEBUG(lock,"client-side enqueue, new policy data");
668 if ((*flags) & LDLM_FL_AST_SENT) {
669 lock_res_and_lock(lock);
670 lock->l_flags |= LDLM_FL_CBPENDING | LDLM_FL_BL_AST;
671 unlock_res_and_lock(lock);
672 LDLM_DEBUG(lock, "enqueue reply includes blocking AST");
675 /* If the lock has already been granted by a completion AST, don't
676 * clobber the LVB with an older one. */
678 /* We must lock or a racing completion might update lvb without
679 * letting us know and we'll clobber the correct value.
680 * Cannot unlock after the check either, a that still leaves
681 * a tiny window for completion to get in */
682 lock_res_and_lock(lock);
683 if (lock->l_req_mode != lock->l_granted_mode)
684 rc = ldlm_fill_lvb(lock, &req->rq_pill, RCL_SERVER,
685 lock->l_lvb_data, lvb_len);
686 unlock_res_and_lock(lock);
694 rc = ldlm_lock_enqueue(ns, &lock, NULL, flags);
695 if (lock->l_completion_ast != NULL) {
696 int err = lock->l_completion_ast(lock, *flags, NULL);
704 if (lvb_len > 0 && lvb != NULL) {
705 /* Copy the LVB here, and not earlier, because the completion
706 * AST (if any) can override what we got in the reply */
707 memcpy(lvb, lock->l_lvb_data, lvb_len);
710 LDLM_DEBUG(lock, "client-side enqueue END");
713 if (cleanup_phase == 1 && rc)
714 failed_lock_cleanup(ns, lock, mode);
715 /* Put lock 2 times, the second reference is held by ldlm_cli_enqueue */
717 LDLM_LOCK_RELEASE(lock);
720 EXPORT_SYMBOL(ldlm_cli_enqueue_fini);
723 * Estimate number of lock handles that would fit into request of given
724 * size. PAGE_SIZE-512 is to allow TCP/IP and LNET headers to fit into
725 * a single page on the send/receive side. XXX: 512 should be changed to
726 * more adequate value.
728 static inline int ldlm_req_handles_avail(int req_size, int off)
732 avail = min_t(int, LDLM_MAXREQSIZE, PAGE_CACHE_SIZE - 512) - req_size;
733 if (likely(avail >= 0))
734 avail /= (int)sizeof(struct lustre_handle);
737 avail += LDLM_LOCKREQ_HANDLES - off;
742 static inline int ldlm_capsule_handles_avail(struct req_capsule *pill,
743 enum req_location loc,
746 __u32 size = req_capsule_msg_size(pill, loc);
747 return ldlm_req_handles_avail(size, off);
750 static inline int ldlm_format_handles_avail(struct obd_import *imp,
751 const struct req_format *fmt,
752 enum req_location loc, int off)
754 __u32 size = req_capsule_fmt_size(imp->imp_msg_magic, fmt, loc);
755 return ldlm_req_handles_avail(size, off);
759 * Cancel LRU locks and pack them into the enqueue request. Pack there the given
760 * \a count locks in \a cancels.
762 * This is to be called by functions preparing their own requests that
763 * might contain lists of locks to cancel in addition to actual operation
764 * that needs to be performed.
766 int ldlm_prep_elc_req(struct obd_export *exp, struct ptlrpc_request *req,
767 int version, int opc, int canceloff,
768 struct list_head *cancels, int count)
770 struct ldlm_namespace *ns = exp->exp_obd->obd_namespace;
771 struct req_capsule *pill = &req->rq_pill;
772 struct ldlm_request *dlm = NULL;
773 struct list_head head = LIST_HEAD_INIT(head);
774 enum ldlm_lru_flags lru_flags;
775 int avail, to_free, pack = 0;
781 if (ns_connect_cancelset(ns)) {
782 /* Estimate the amount of available space in the request. */
783 req_capsule_filled_sizes(pill, RCL_CLIENT);
784 avail = ldlm_capsule_handles_avail(pill, RCL_CLIENT, canceloff);
786 lru_flags = ns_connect_lru_resize(ns) ?
787 LDLM_LRU_FLAG_LRUR_NO_WAIT : LDLM_LRU_FLAG_AGED;
788 to_free = !ns_connect_lru_resize(ns) &&
789 opc == LDLM_ENQUEUE ? 1 : 0;
791 /* Cancel LRU locks here _only_ if the server supports
792 * EARLY_CANCEL. Otherwise we have to send extra CANCEL
793 * RPC, which will make us slower. */
795 count += ldlm_cancel_lru_local(ns, cancels, to_free,
802 req_capsule_set_size(pill, &RMF_DLM_REQ, RCL_CLIENT,
803 ldlm_request_bufsize(pack, opc));
806 rc = ptlrpc_request_pack(req, version, opc);
808 ldlm_lock_list_put(cancels, l_bl_ast, count);
812 if (ns_connect_cancelset(ns)) {
814 dlm = req_capsule_client_get(pill, &RMF_DLM_REQ);
816 /* Skip first lock handler in ldlm_request_pack(),
817 * this method will increment @lock_count according
818 * to the lock handle amount actually written to
820 dlm->lock_count = canceloff;
822 /* Pack into the request @pack lock handles. */
823 ldlm_cli_cancel_list(cancels, pack, req, 0);
824 /* Prepare and send separate cancel RPC for others. */
825 ldlm_cli_cancel_list(cancels, count - pack, NULL, 0);
827 ldlm_lock_list_put(cancels, l_bl_ast, count);
831 EXPORT_SYMBOL(ldlm_prep_elc_req);
833 int ldlm_prep_enqueue_req(struct obd_export *exp, struct ptlrpc_request *req,
834 struct list_head *cancels, int count)
836 return ldlm_prep_elc_req(exp, req, LUSTRE_DLM_VERSION, LDLM_ENQUEUE,
837 LDLM_ENQUEUE_CANCEL_OFF, cancels, count);
839 EXPORT_SYMBOL(ldlm_prep_enqueue_req);
841 struct ptlrpc_request *ldlm_enqueue_pack(struct obd_export *exp, int lvb_len)
843 struct ptlrpc_request *req;
847 req = ptlrpc_request_alloc(class_exp2cliimp(exp), &RQF_LDLM_ENQUEUE);
849 RETURN(ERR_PTR(-ENOMEM));
851 rc = ldlm_prep_enqueue_req(exp, req, NULL, 0);
853 ptlrpc_request_free(req);
857 req_capsule_set_size(&req->rq_pill, &RMF_DLM_LVB, RCL_SERVER, lvb_len);
858 ptlrpc_request_set_replen(req);
861 EXPORT_SYMBOL(ldlm_enqueue_pack);
864 * Client-side lock enqueue.
866 * If a request has some specific initialisation it is passed in \a reqp,
867 * otherwise it is created in ldlm_cli_enqueue.
869 * Supports sync and async requests, pass \a async flag accordingly. If a
870 * request was created in ldlm_cli_enqueue and it is the async request,
871 * pass it to the caller in \a reqp.
873 int ldlm_cli_enqueue(struct obd_export *exp, struct ptlrpc_request **reqp,
874 struct ldlm_enqueue_info *einfo,
875 const struct ldlm_res_id *res_id,
876 union ldlm_policy_data const *policy, __u64 *flags,
877 void *lvb, __u32 lvb_len, enum lvb_type lvb_type,
878 struct lustre_handle *lockh, int async)
880 struct ldlm_namespace *ns;
881 struct ldlm_lock *lock;
882 struct ldlm_request *body;
883 int is_replay = *flags & LDLM_FL_REPLAY;
884 int req_passed_in = 1;
886 struct ptlrpc_request *req;
889 LASSERT(exp != NULL);
891 ns = exp->exp_obd->obd_namespace;
893 /* If we're replaying this lock, just check some invariants.
894 * If we're creating a new lock, get everything all setup nice. */
896 lock = ldlm_handle2lock_long(lockh, 0);
897 LASSERT(lock != NULL);
898 LDLM_DEBUG(lock, "client-side enqueue START");
899 LASSERT(exp == lock->l_conn_export);
901 const struct ldlm_callback_suite cbs = {
902 .lcs_completion = einfo->ei_cb_cp,
903 .lcs_blocking = einfo->ei_cb_bl,
904 .lcs_glimpse = einfo->ei_cb_gl
906 lock = ldlm_lock_create(ns, res_id, einfo->ei_type,
907 einfo->ei_mode, &cbs, einfo->ei_cbdata,
910 RETURN(PTR_ERR(lock));
911 /* for the local lock, add the reference */
912 ldlm_lock_addref_internal(lock, einfo->ei_mode);
913 ldlm_lock2handle(lock, lockh);
915 lock->l_policy_data = *policy;
917 if (einfo->ei_type == LDLM_EXTENT) {
918 /* extent lock without policy is a bug */
922 lock->l_req_extent = policy->l_extent;
924 LDLM_DEBUG(lock, "client-side enqueue START, flags "LPX64"\n",
928 lock->l_conn_export = exp;
929 lock->l_export = NULL;
930 lock->l_blocking_ast = einfo->ei_cb_bl;
931 lock->l_flags |= (*flags & (LDLM_FL_NO_LRU | LDLM_FL_EXCL));
932 lock->l_last_activity = cfs_time_current_sec();
934 /* lock not sent to server yet */
936 if (reqp == NULL || *reqp == NULL) {
937 req = ptlrpc_request_alloc_pack(class_exp2cliimp(exp),
942 failed_lock_cleanup(ns, lock, einfo->ei_mode);
943 LDLM_LOCK_RELEASE(lock);
953 len = req_capsule_get_size(&req->rq_pill, &RMF_DLM_REQ,
955 LASSERTF(len >= sizeof(*body), "buflen[%d] = %d, not %d\n",
956 DLM_LOCKREQ_OFF, len, (int)sizeof(*body));
959 /* Dump lock data into the request buffer */
960 body = req_capsule_client_get(&req->rq_pill, &RMF_DLM_REQ);
961 ldlm_lock2desc(lock, &body->lock_desc);
962 body->lock_flags = ldlm_flags_to_wire(*flags);
963 body->lock_handle[0] = *lockh;
965 /* Continue as normal. */
966 if (!req_passed_in) {
968 req_capsule_extend(&req->rq_pill,
969 &RQF_LDLM_ENQUEUE_LVB);
970 req_capsule_set_size(&req->rq_pill, &RMF_DLM_LVB, RCL_SERVER,
972 ptlrpc_request_set_replen(req);
976 LASSERT(reqp != NULL);
980 LDLM_DEBUG(lock, "sending request");
982 rc = ptlrpc_queue_wait(req);
984 err = ldlm_cli_enqueue_fini(exp, req, einfo->ei_type, policy ? 1 : 0,
985 einfo->ei_mode, flags, lvb, lvb_len,
988 /* If ldlm_cli_enqueue_fini did not find the lock, we need to free
989 * one reference that we took */
991 LDLM_LOCK_RELEASE(lock);
995 if (!req_passed_in && req != NULL) {
996 ptlrpc_req_finished(req);
1003 EXPORT_SYMBOL(ldlm_cli_enqueue);
1005 static int ldlm_cli_convert_local(struct ldlm_lock *lock, int new_mode,
1008 struct ldlm_resource *res;
1011 if (ns_is_client(ldlm_lock_to_ns(lock))) {
1012 CERROR("Trying to cancel local lock\n");
1015 LDLM_DEBUG(lock, "client-side local convert");
1017 res = ldlm_lock_convert(lock, new_mode, flags);
1019 ldlm_reprocess_all(res);
1022 rc = LUSTRE_EDEADLK;
1024 LDLM_DEBUG(lock, "client-side local convert handler END");
1025 LDLM_LOCK_PUT(lock);
1029 /* FIXME: one of ldlm_cli_convert or the server side should reject attempted
1030 * conversion of locks which are on the waiting or converting queue */
1031 /* Caller of this code is supposed to take care of lock readers/writers
1033 int ldlm_cli_convert(struct lustre_handle *lockh, int new_mode, __u32 *flags)
1035 struct ldlm_request *body;
1036 struct ldlm_reply *reply;
1037 struct ldlm_lock *lock;
1038 struct ldlm_resource *res;
1039 struct ptlrpc_request *req;
1043 lock = ldlm_handle2lock(lockh);
1050 if (lock->l_conn_export == NULL)
1051 RETURN(ldlm_cli_convert_local(lock, new_mode, flags));
1053 LDLM_DEBUG(lock, "client-side convert");
1055 req = ptlrpc_request_alloc_pack(class_exp2cliimp(lock->l_conn_export),
1056 &RQF_LDLM_CONVERT, LUSTRE_DLM_VERSION,
1059 LDLM_LOCK_PUT(lock);
1063 body = req_capsule_client_get(&req->rq_pill, &RMF_DLM_REQ);
1064 body->lock_handle[0] = lock->l_remote_handle;
1066 body->lock_desc.l_req_mode = new_mode;
1067 body->lock_flags = ldlm_flags_to_wire(*flags);
1070 ptlrpc_request_set_replen(req);
1071 rc = ptlrpc_queue_wait(req);
1075 reply = req_capsule_server_get(&req->rq_pill, &RMF_DLM_REP);
1077 GOTO(out, rc = -EPROTO);
1080 GOTO(out, rc = req->rq_status);
1082 res = ldlm_lock_convert(lock, new_mode, &reply->lock_flags);
1084 ldlm_reprocess_all(res);
1085 /* Go to sleep until the lock is granted. */
1086 /* FIXME: or cancelled. */
1087 if (lock->l_completion_ast) {
1088 rc = lock->l_completion_ast(lock, LDLM_FL_WAIT_NOREPROC,
1094 rc = LUSTRE_EDEADLK;
1098 LDLM_LOCK_PUT(lock);
1099 ptlrpc_req_finished(req);
1104 * Cancel locks locally.
1106 * \retval LDLM_FL_LOCAL_ONLY if there is no need for a CANCEL RPC to the server
1107 * \retval LDLM_FL_CANCELING otherwise;
1108 * \retval LDLM_FL_BL_AST if there is a need for a separate CANCEL RPC.
1110 static __u64 ldlm_cli_cancel_local(struct ldlm_lock *lock)
1112 __u64 rc = LDLM_FL_LOCAL_ONLY;
1115 if (lock->l_conn_export) {
1118 LDLM_DEBUG(lock, "client-side cancel");
1119 /* Set this flag to prevent others from getting new references*/
1120 lock_res_and_lock(lock);
1121 ldlm_set_cbpending(lock);
1122 local_only = !!(lock->l_flags &
1123 (LDLM_FL_LOCAL_ONLY|LDLM_FL_CANCEL_ON_BLOCK));
1124 ldlm_cancel_callback(lock);
1125 rc = (ldlm_is_bl_ast(lock)) ?
1126 LDLM_FL_BL_AST : LDLM_FL_CANCELING;
1127 unlock_res_and_lock(lock);
1130 CDEBUG(D_DLMTRACE, "not sending request (at caller's "
1132 rc = LDLM_FL_LOCAL_ONLY;
1134 ldlm_lock_cancel(lock);
1136 if (ns_is_client(ldlm_lock_to_ns(lock))) {
1137 LDLM_ERROR(lock, "Trying to cancel local lock");
1140 LDLM_DEBUG(lock, "server-side local cancel");
1141 ldlm_lock_cancel(lock);
1142 ldlm_reprocess_all(lock->l_resource);
1149 * Pack \a count locks in \a head into ldlm_request buffer of request \a req.
1151 static void ldlm_cancel_pack(struct ptlrpc_request *req,
1152 struct list_head *head, int count)
1154 struct ldlm_request *dlm;
1155 struct ldlm_lock *lock;
1156 int max, packed = 0;
1159 dlm = req_capsule_client_get(&req->rq_pill, &RMF_DLM_REQ);
1160 LASSERT(dlm != NULL);
1162 /* Check the room in the request buffer. */
1163 max = req_capsule_get_size(&req->rq_pill, &RMF_DLM_REQ, RCL_CLIENT) -
1164 sizeof(struct ldlm_request);
1165 max /= sizeof(struct lustre_handle);
1166 max += LDLM_LOCKREQ_HANDLES;
1167 LASSERT(max >= dlm->lock_count + count);
1169 /* XXX: it would be better to pack lock handles grouped by resource.
1170 * so that the server cancel would call filter_lvbo_update() less
1172 list_for_each_entry(lock, head, l_bl_ast) {
1175 LASSERT(lock->l_conn_export);
1176 /* Pack the lock handle to the given request buffer. */
1177 LDLM_DEBUG(lock, "packing");
1178 dlm->lock_handle[dlm->lock_count++] = lock->l_remote_handle;
1181 CDEBUG(D_DLMTRACE, "%d locks packed\n", packed);
1186 * Prepare and send a batched cancel RPC. It will include \a count lock
1187 * handles of locks given in \a cancels list. */
1188 int ldlm_cli_cancel_req(struct obd_export *exp, struct list_head *cancels,
1189 int count, enum ldlm_cancel_flags flags)
1191 struct ptlrpc_request *req = NULL;
1192 struct obd_import *imp;
1197 LASSERT(exp != NULL);
1200 CFS_FAIL_TIMEOUT(OBD_FAIL_LDLM_PAUSE_CANCEL, cfs_fail_val);
1202 if (CFS_FAIL_CHECK(OBD_FAIL_LDLM_CANCEL_RACE))
1205 free = ldlm_format_handles_avail(class_exp2cliimp(exp),
1206 &RQF_LDLM_CANCEL, RCL_CLIENT, 0);
1211 imp = class_exp2cliimp(exp);
1212 if (imp == NULL || imp->imp_invalid) {
1214 "skipping cancel on invalid import %p\n", imp);
1218 req = ptlrpc_request_alloc(imp, &RQF_LDLM_CANCEL);
1220 GOTO(out, rc = -ENOMEM);
1222 req_capsule_filled_sizes(&req->rq_pill, RCL_CLIENT);
1223 req_capsule_set_size(&req->rq_pill, &RMF_DLM_REQ, RCL_CLIENT,
1224 ldlm_request_bufsize(count, LDLM_CANCEL));
1226 rc = ptlrpc_request_pack(req, LUSTRE_DLM_VERSION, LDLM_CANCEL);
1228 ptlrpc_request_free(req);
1232 req->rq_request_portal = LDLM_CANCEL_REQUEST_PORTAL;
1233 req->rq_reply_portal = LDLM_CANCEL_REPLY_PORTAL;
1234 ptlrpc_at_set_req_timeout(req);
1236 ldlm_cancel_pack(req, cancels, count);
1238 ptlrpc_request_set_replen(req);
1239 if (flags & LCF_ASYNC) {
1240 ptlrpcd_add_req(req);
1245 rc = ptlrpc_queue_wait(req);
1246 if (rc == LUSTRE_ESTALE) {
1247 CDEBUG(D_DLMTRACE, "client/server (nid %s) "
1248 "out of sync -- not fatal\n",
1249 libcfs_nid2str(req->rq_import->
1250 imp_connection->c_peer.nid));
1252 } else if (rc == -ETIMEDOUT && /* check there was no reconnect*/
1253 req->rq_import_generation == imp->imp_generation) {
1254 ptlrpc_req_finished(req);
1256 } else if (rc != ELDLM_OK) {
1257 /* -ESHUTDOWN is common on umount */
1258 CDEBUG_LIMIT(rc == -ESHUTDOWN ? D_DLMTRACE : D_ERROR,
1259 "Got rc %d from cancel RPC: "
1260 "canceling anyway\n", rc);
1267 ptlrpc_req_finished(req);
1270 return sent ? sent : rc;
1273 static inline struct ldlm_pool *ldlm_imp2pl(struct obd_import *imp)
1275 LASSERT(imp != NULL);
1276 return &imp->imp_obd->obd_namespace->ns_pool;
1280 * Update client's OBD pool related fields with new SLV and Limit from \a req.
1282 int ldlm_cli_update_pool(struct ptlrpc_request *req)
1284 struct obd_device *obd;
1288 if (unlikely(!req->rq_import || !req->rq_import->imp_obd ||
1289 !imp_connect_lru_resize(req->rq_import)))
1292 * Do nothing for corner cases.
1297 /* In some cases RPC may contain SLV and limit zeroed out. This
1298 * is the case when server does not support LRU resize feature.
1299 * This is also possible in some recovery cases when server-side
1300 * reqs have no reference to the OBD export and thus access to
1301 * server-side namespace is not possible. */
1302 if (lustre_msg_get_slv(req->rq_repmsg) == 0 ||
1303 lustre_msg_get_limit(req->rq_repmsg) == 0) {
1304 DEBUG_REQ(D_HA, req, "Zero SLV or Limit found "
1305 "(SLV: "LPU64", Limit: %u)",
1306 lustre_msg_get_slv(req->rq_repmsg),
1307 lustre_msg_get_limit(req->rq_repmsg));
1311 new_limit = lustre_msg_get_limit(req->rq_repmsg);
1312 new_slv = lustre_msg_get_slv(req->rq_repmsg);
1313 obd = req->rq_import->imp_obd;
1315 /* Set new SLV and limit in OBD fields to make them accessible
1316 * to the pool thread. We do not access obd_namespace and pool
1317 * directly here as there is no reliable way to make sure that
1318 * they are still alive at cleanup time. Evil races are possible
1319 * which may cause Oops at that time. */
1320 write_lock(&obd->obd_pool_lock);
1321 obd->obd_pool_slv = new_slv;
1322 obd->obd_pool_limit = new_limit;
1323 write_unlock(&obd->obd_pool_lock);
1329 * Client side lock cancel.
1331 * Lock must not have any readers or writers by this time.
1333 int ldlm_cli_cancel(struct lustre_handle *lockh,
1334 enum ldlm_cancel_flags cancel_flags)
1336 struct obd_export *exp;
1337 enum ldlm_lru_flags lru_flags;
1338 int avail, count = 1;
1340 struct ldlm_namespace *ns;
1341 struct ldlm_lock *lock;
1342 struct list_head cancels = LIST_HEAD_INIT(cancels);
1345 /* concurrent cancels on the same handle can happen */
1346 lock = ldlm_handle2lock_long(lockh, LDLM_FL_CANCELING);
1348 LDLM_DEBUG_NOLOCK("lock is already being destroyed");
1352 rc = ldlm_cli_cancel_local(lock);
1353 if (rc == LDLM_FL_LOCAL_ONLY || cancel_flags & LCF_LOCAL) {
1354 LDLM_LOCK_RELEASE(lock);
1357 /* Even if the lock is marked as LDLM_FL_BL_AST, this is a LDLM_CANCEL
1358 * RPC which goes to canceld portal, so we can cancel other LRU locks
1359 * here and send them all as one LDLM_CANCEL RPC. */
1360 LASSERT(list_empty(&lock->l_bl_ast));
1361 list_add(&lock->l_bl_ast, &cancels);
1363 exp = lock->l_conn_export;
1364 if (exp_connect_cancelset(exp)) {
1365 avail = ldlm_format_handles_avail(class_exp2cliimp(exp),
1370 ns = ldlm_lock_to_ns(lock);
1371 lru_flags = ns_connect_lru_resize(ns) ?
1372 LDLM_LRU_FLAG_LRUR : LDLM_LRU_FLAG_AGED;
1373 count += ldlm_cancel_lru_local(ns, &cancels, 0, avail - 1,
1374 LCF_BL_AST, lru_flags);
1376 ldlm_cli_cancel_list(&cancels, count, NULL, cancel_flags);
1379 EXPORT_SYMBOL(ldlm_cli_cancel);
1382 * Locally cancel up to \a count locks in list \a cancels.
1383 * Return the number of cancelled locks.
1385 int ldlm_cli_cancel_list_local(struct list_head *cancels, int count,
1386 enum ldlm_cancel_flags cancel_flags)
1388 struct list_head head = LIST_HEAD_INIT(head);
1389 struct ldlm_lock *lock, *next;
1390 int left = 0, bl_ast = 0;
1394 list_for_each_entry_safe(lock, next, cancels, l_bl_ast) {
1398 if (cancel_flags & LCF_LOCAL) {
1399 rc = LDLM_FL_LOCAL_ONLY;
1400 ldlm_lock_cancel(lock);
1402 rc = ldlm_cli_cancel_local(lock);
1404 /* Until we have compound requests and can send LDLM_CANCEL
1405 * requests batched with generic RPCs, we need to send cancels
1406 * with the LDLM_FL_BL_AST flag in a separate RPC from
1407 * the one being generated now. */
1408 if (!(cancel_flags & LCF_BL_AST) && (rc == LDLM_FL_BL_AST)) {
1409 LDLM_DEBUG(lock, "Cancel lock separately");
1410 list_del_init(&lock->l_bl_ast);
1411 list_add(&lock->l_bl_ast, &head);
1415 if (rc == LDLM_FL_LOCAL_ONLY) {
1416 /* CANCEL RPC should not be sent to server. */
1417 list_del_init(&lock->l_bl_ast);
1418 LDLM_LOCK_RELEASE(lock);
1424 ldlm_cli_cancel_list(&head, bl_ast, NULL, 0);
1431 * Cancel as many locks as possible w/o sending any RPCs (e.g. to write back
1432 * dirty data, to close a file, ...) or waiting for any RPCs in-flight (e.g.
1433 * readahead requests, ...)
1435 static enum ldlm_policy_res
1436 ldlm_cancel_no_wait_policy(struct ldlm_namespace *ns, struct ldlm_lock *lock,
1437 int unused, int added, int count)
1439 enum ldlm_policy_res result = LDLM_POLICY_CANCEL_LOCK;
1441 /* don't check added & count since we want to process all locks
1443 * It's fine to not take lock to access lock->l_resource since
1444 * the lock has already been granted so it won't change. */
1445 switch (lock->l_resource->lr_type) {
1448 if (ns->ns_cancel != NULL && ns->ns_cancel(lock) != 0)
1451 result = LDLM_POLICY_SKIP_LOCK;
1452 lock_res_and_lock(lock);
1453 ldlm_set_skipped(lock);
1454 unlock_res_and_lock(lock);
1462 * Callback function for LRU-resize policy. Decides whether to keep
1463 * \a lock in LRU for current \a LRU size \a unused, added in current
1464 * scan \a added and number of locks to be preferably canceled \a count.
1466 * \retval LDLM_POLICY_KEEP_LOCK keep lock in LRU in stop scanning
1468 * \retval LDLM_POLICY_CANCEL_LOCK cancel lock from LRU
1470 static enum ldlm_policy_res ldlm_cancel_lrur_policy(struct ldlm_namespace *ns,
1471 struct ldlm_lock *lock,
1472 int unused, int added,
1475 cfs_time_t cur = cfs_time_current();
1476 struct ldlm_pool *pl = &ns->ns_pool;
1480 /* Stop LRU processing when we reach past @count or have checked all
1482 if (count && added >= count)
1483 return LDLM_POLICY_KEEP_LOCK;
1485 /* Despite of the LV, It doesn't make sense to keep the lock which
1486 * is unused for ns_max_age time. */
1487 if (cfs_time_after(cfs_time_current(),
1488 cfs_time_add(lock->l_last_used, ns->ns_max_age)))
1489 return LDLM_POLICY_CANCEL_LOCK;
1491 slv = ldlm_pool_get_slv(pl);
1492 lvf = ldlm_pool_get_lvf(pl);
1493 la = cfs_duration_sec(cfs_time_sub(cur,
1494 lock->l_last_used));
1495 lv = lvf * la * unused;
1497 /* Inform pool about current CLV to see it via proc. */
1498 ldlm_pool_set_clv(pl, lv);
1500 /* Stop when SLV is not yet come from server or lv is smaller than
1502 if (slv == 0 || lv < slv)
1503 return LDLM_POLICY_KEEP_LOCK;
1505 return LDLM_POLICY_CANCEL_LOCK;
1508 static enum ldlm_policy_res
1509 ldlm_cancel_lrur_no_wait_policy(struct ldlm_namespace *ns,
1510 struct ldlm_lock *lock,
1511 int unused, int added,
1514 enum ldlm_policy_res result;
1516 result = ldlm_cancel_lrur_policy(ns, lock, unused, added, count);
1517 if (result == LDLM_POLICY_KEEP_LOCK)
1520 return ldlm_cancel_no_wait_policy(ns, lock, unused, added, count);
1524 * Callback function for proc used policy. Makes decision whether to keep
1525 * \a lock in LRU for current \a LRU size \a unused, added in current scan \a
1526 * added and number of locks to be preferably canceled \a count.
1528 * \retval LDLM_POLICY_KEEP_LOCK keep lock in LRU in stop scanning
1530 * \retval LDLM_POLICY_CANCEL_LOCK cancel lock from LRU
1532 static enum ldlm_policy_res ldlm_cancel_passed_policy(struct ldlm_namespace *ns,
1533 struct ldlm_lock *lock,
1534 int unused, int added,
1537 /* Stop LRU processing when we reach past @count or have checked all
1539 return (added >= count) ?
1540 LDLM_POLICY_KEEP_LOCK : LDLM_POLICY_CANCEL_LOCK;
1544 * Callback function for aged policy. Makes decision whether to keep \a lock in
1545 * LRU for current LRU size \a unused, added in current scan \a added and
1546 * number of locks to be preferably canceled \a count.
1548 * \retval LDLM_POLICY_KEEP_LOCK keep lock in LRU in stop scanning
1550 * \retval LDLM_POLICY_CANCEL_LOCK cancel lock from LRU
1552 static enum ldlm_policy_res ldlm_cancel_aged_policy(struct ldlm_namespace *ns,
1553 struct ldlm_lock *lock,
1554 int unused, int added,
1557 if ((added >= count) &&
1558 cfs_time_before(cfs_time_current(),
1559 cfs_time_add(lock->l_last_used, ns->ns_max_age)))
1560 return LDLM_POLICY_KEEP_LOCK;
1562 return LDLM_POLICY_CANCEL_LOCK;
1566 * Callback function for default policy. Makes decision whether to keep \a lock
1567 * in LRU for current LRU size \a unused, added in current scan \a added and
1568 * number of locks to be preferably canceled \a count.
1570 * \retval LDLM_POLICY_KEEP_LOCK keep lock in LRU in stop scanning
1572 * \retval LDLM_POLICY_CANCEL_LOCK cancel lock from LRU
1575 enum ldlm_policy_res ldlm_cancel_default_policy(struct ldlm_namespace *ns,
1576 struct ldlm_lock *lock,
1577 int unused, int added,
1580 /* Stop LRU processing when we reach past count or have checked all
1582 return (added >= count) ?
1583 LDLM_POLICY_KEEP_LOCK : LDLM_POLICY_CANCEL_LOCK;
1586 typedef enum ldlm_policy_res
1587 (*ldlm_cancel_lru_policy_t)(struct ldlm_namespace *ns, struct ldlm_lock *lock,
1588 int unused, int added, int count);
1590 static ldlm_cancel_lru_policy_t
1591 ldlm_cancel_lru_policy(struct ldlm_namespace *ns, enum ldlm_lru_flags lru_flags)
1593 if (lru_flags & LDLM_LRU_FLAG_NO_WAIT)
1594 return ldlm_cancel_no_wait_policy;
1596 if (ns_connect_lru_resize(ns)) {
1597 if (lru_flags & LDLM_LRU_FLAG_SHRINK)
1598 /* We kill passed number of old locks. */
1599 return ldlm_cancel_passed_policy;
1600 if (lru_flags & LDLM_LRU_FLAG_LRUR)
1601 return ldlm_cancel_lrur_policy;
1602 if (lru_flags & LDLM_LRU_FLAG_PASSED)
1603 return ldlm_cancel_passed_policy;
1604 else if (lru_flags & LDLM_LRU_FLAG_LRUR_NO_WAIT)
1605 return ldlm_cancel_lrur_no_wait_policy;
1607 if (lru_flags & LDLM_LRU_FLAG_AGED)
1608 return ldlm_cancel_aged_policy;
1611 return ldlm_cancel_default_policy;
1615 * - Free space in LRU for \a count new locks,
1616 * redundant unused locks are canceled locally;
1617 * - also cancel locally unused aged locks;
1618 * - do not cancel more than \a max locks;
1619 * - GET the found locks and add them into the \a cancels list.
1621 * A client lock can be added to the l_bl_ast list only when it is
1622 * marked LDLM_FL_CANCELING. Otherwise, somebody is already doing
1623 * CANCEL. There are the following use cases:
1624 * ldlm_cancel_resource_local(), ldlm_cancel_lru_local() and
1625 * ldlm_cli_cancel(), which check and set this flag properly. As any
1626 * attempt to cancel a lock rely on this flag, l_bl_ast list is accessed
1627 * later without any special locking.
1629 * Calling policies for enabled LRU resize:
1630 * ----------------------------------------
1631 * flags & LDLM_LRU_FLAG_LRUR - use LRU resize policy (SLV from server) to
1632 * cancel not more than \a count locks;
1634 * flags & LDLM_LRU_FLAG_PASSED - cancel \a count number of old locks (located
1635 * at the beginning of LRU list);
1637 * flags & LDLM_LRU_FLAG_SHRINK - cancel not more than \a count locks according
1638 * to memory pressre policy function;
1640 * flags & LDLM_LRU_FLAG_AGED - cancel \a count locks according to "aged policy"
1642 * flags & LDLM_LRU_FLAG_NO_WAIT - cancel as many unused locks as possible
1643 * (typically before replaying locks) w/o
1644 * sending any RPCs or waiting for any
1645 * outstanding RPC to complete.
1647 static int ldlm_prepare_lru_list(struct ldlm_namespace *ns,
1648 struct list_head *cancels, int count, int max,
1649 enum ldlm_lru_flags lru_flags)
1651 ldlm_cancel_lru_policy_t pf;
1652 struct ldlm_lock *lock, *next;
1653 int added = 0, unused, remained;
1654 int no_wait = lru_flags & (LDLM_LRU_FLAG_NO_WAIT |
1655 LDLM_LRU_FLAG_LRUR_NO_WAIT);
1658 spin_lock(&ns->ns_lock);
1659 unused = ns->ns_nr_unused;
1662 if (!ns_connect_lru_resize(ns))
1663 count += unused - ns->ns_max_unused;
1665 pf = ldlm_cancel_lru_policy(ns, lru_flags);
1666 LASSERT(pf != NULL);
1668 while (!list_empty(&ns->ns_unused_list)) {
1669 enum ldlm_policy_res result;
1670 cfs_time_t last_use = 0;
1672 /* all unused locks */
1673 if (remained-- <= 0)
1676 /* For any flags, stop scanning if @max is reached. */
1677 if (max && added >= max)
1680 list_for_each_entry_safe(lock, next, &ns->ns_unused_list,
1682 /* No locks which got blocking requests. */
1683 LASSERT(!ldlm_is_bl_ast(lock));
1685 if (no_wait && ldlm_is_skipped(lock))
1686 /* already processed */
1689 last_use = lock->l_last_used;
1690 if (last_use == cfs_time_current())
1693 /* Somebody is already doing CANCEL. No need for this
1694 * lock in LRU, do not traverse it again. */
1695 if (!ldlm_is_canceling(lock))
1698 ldlm_lock_remove_from_lru_nolock(lock);
1700 if (&lock->l_lru == &ns->ns_unused_list)
1703 LDLM_LOCK_GET(lock);
1704 spin_unlock(&ns->ns_lock);
1705 lu_ref_add(&lock->l_reference, __FUNCTION__, current);
1707 /* Pass the lock through the policy filter and see if it
1708 * should stay in LRU.
1710 * Even for shrinker policy we stop scanning if
1711 * we find a lock that should stay in the cache.
1712 * We should take into account lock age anyway
1713 * as a new lock is a valuable resource even if
1714 * it has a low weight.
1716 * That is, for shrinker policy we drop only
1717 * old locks, but additionally choose them by
1718 * their weight. Big extent locks will stay in
1720 result = pf(ns, lock, unused, added, count);
1721 if (result == LDLM_POLICY_KEEP_LOCK) {
1722 lu_ref_del(&lock->l_reference,
1723 __FUNCTION__, current);
1724 LDLM_LOCK_RELEASE(lock);
1725 spin_lock(&ns->ns_lock);
1728 if (result == LDLM_POLICY_SKIP_LOCK) {
1729 lu_ref_del(&lock->l_reference,
1731 LDLM_LOCK_RELEASE(lock);
1732 spin_lock(&ns->ns_lock);
1736 lock_res_and_lock(lock);
1737 /* Check flags again under the lock. */
1738 if (ldlm_is_canceling(lock) ||
1739 ldlm_lock_remove_from_lru_check(lock, last_use) == 0) {
1740 /* Another thread is removing lock from LRU, or
1741 * somebody is already doing CANCEL, or there
1742 * is a blocking request which will send cancel
1743 * by itself, or the lock is no longer unused or
1744 * the lock has been used since the pf() call and
1745 * pages could be put under it. */
1746 unlock_res_and_lock(lock);
1747 lu_ref_del(&lock->l_reference, __FUNCTION__, current);
1748 LDLM_LOCK_RELEASE(lock);
1749 spin_lock(&ns->ns_lock);
1752 LASSERT(!lock->l_readers && !lock->l_writers);
1754 /* If we have chosen to cancel this lock voluntarily, we
1755 * better send cancel notification to server, so that it
1756 * frees appropriate state. This might lead to a race
1757 * where while we are doing cancel here, server is also
1758 * silently cancelling this lock. */
1759 ldlm_clear_cancel_on_block(lock);
1761 /* Setting the CBPENDING flag is a little misleading,
1762 * but prevents an important race; namely, once
1763 * CBPENDING is set, the lock can accumulate no more
1764 * readers/writers. Since readers and writers are
1765 * already zero here, ldlm_lock_decref() won't see
1766 * this flag and call l_blocking_ast */
1767 lock->l_flags |= LDLM_FL_CBPENDING | LDLM_FL_CANCELING;
1769 /* We can't re-add to l_lru as it confuses the
1770 * refcounting in ldlm_lock_remove_from_lru() if an AST
1771 * arrives after we drop lr_lock below. We use l_bl_ast
1772 * and can't use l_pending_chain as it is used both on
1773 * server and client nevertheless bug 5666 says it is
1774 * used only on server */
1775 LASSERT(list_empty(&lock->l_bl_ast));
1776 list_add(&lock->l_bl_ast, cancels);
1777 unlock_res_and_lock(lock);
1778 lu_ref_del(&lock->l_reference, __FUNCTION__, current);
1779 spin_lock(&ns->ns_lock);
1783 spin_unlock(&ns->ns_lock);
1787 int ldlm_cancel_lru_local(struct ldlm_namespace *ns, struct list_head *cancels,
1789 enum ldlm_cancel_flags cancel_flags,
1790 enum ldlm_lru_flags lru_flags)
1794 added = ldlm_prepare_lru_list(ns, cancels, count, max, lru_flags);
1798 return ldlm_cli_cancel_list_local(cancels, added, cancel_flags);
1802 * Cancel at least \a nr locks from given namespace LRU.
1804 * When called with LCF_ASYNC the blocking callback will be handled
1805 * in a thread and this function will return after the thread has been
1806 * asked to call the callback. When called with LCF_ASYNC the blocking
1807 * callback will be performed in this function.
1809 int ldlm_cancel_lru(struct ldlm_namespace *ns, int nr,
1810 enum ldlm_cancel_flags cancel_flags,
1811 enum ldlm_lru_flags lru_flags)
1813 struct list_head cancels = LIST_HEAD_INIT(cancels);
1817 /* Just prepare the list of locks, do not actually cancel them yet.
1818 * Locks are cancelled later in a separate thread. */
1819 count = ldlm_prepare_lru_list(ns, &cancels, nr, 0, lru_flags);
1820 rc = ldlm_bl_to_thread_list(ns, NULL, &cancels, count, cancel_flags);
1828 * Find and cancel locally unused locks found on resource, matched to the
1829 * given policy, mode. GET the found locks and add them into the \a cancels
1832 int ldlm_cancel_resource_local(struct ldlm_resource *res,
1833 struct list_head *cancels,
1834 union ldlm_policy_data *policy,
1835 enum ldlm_mode mode, __u64 lock_flags,
1836 enum ldlm_cancel_flags cancel_flags,
1839 struct ldlm_lock *lock;
1844 list_for_each_entry(lock, &res->lr_granted, l_res_link) {
1845 if (opaque != NULL && lock->l_ast_data != opaque) {
1846 LDLM_ERROR(lock, "data %p doesn't match opaque %p",
1847 lock->l_ast_data, opaque);
1852 if (lock->l_readers || lock->l_writers)
1855 /* If somebody is already doing CANCEL, or blocking AST came,
1856 * skip this lock. */
1857 if (ldlm_is_bl_ast(lock) || ldlm_is_canceling(lock))
1860 if (lockmode_compat(lock->l_granted_mode, mode))
1863 /* If policy is given and this is IBITS lock, add to list only
1864 * those locks that match by policy. */
1865 if (policy && (lock->l_resource->lr_type == LDLM_IBITS) &&
1866 !(lock->l_policy_data.l_inodebits.bits &
1867 policy->l_inodebits.bits))
1870 /* See CBPENDING comment in ldlm_cancel_lru */
1871 lock->l_flags |= LDLM_FL_CBPENDING | LDLM_FL_CANCELING |
1874 LASSERT(list_empty(&lock->l_bl_ast));
1875 list_add(&lock->l_bl_ast, cancels);
1876 LDLM_LOCK_GET(lock);
1881 RETURN(ldlm_cli_cancel_list_local(cancels, count, cancel_flags));
1883 EXPORT_SYMBOL(ldlm_cancel_resource_local);
1886 * Cancel client-side locks from a list and send/prepare cancel RPCs to the
1888 * If \a req is NULL, send CANCEL request to server with handles of locks
1889 * in the \a cancels. If EARLY_CANCEL is not supported, send CANCEL requests
1890 * separately per lock.
1891 * If \a req is not NULL, put handles of locks in \a cancels into the request
1892 * buffer at the offset \a off.
1893 * Destroy \a cancels at the end.
1895 int ldlm_cli_cancel_list(struct list_head *cancels, int count,
1896 struct ptlrpc_request *req,
1897 enum ldlm_cancel_flags flags)
1899 struct ldlm_lock *lock;
1903 if (list_empty(cancels) || count == 0)
1906 /* XXX: requests (both batched and not) could be sent in parallel.
1907 * Usually it is enough to have just 1 RPC, but it is possible that
1908 * there are too many locks to be cancelled in LRU or on a resource.
1909 * It would also speed up the case when the server does not support
1912 LASSERT(!list_empty(cancels));
1913 lock = list_entry(cancels->next, struct ldlm_lock,
1915 LASSERT(lock->l_conn_export);
1917 if (exp_connect_cancelset(lock->l_conn_export)) {
1920 ldlm_cancel_pack(req, cancels, count);
1922 res = ldlm_cli_cancel_req(lock->l_conn_export,
1926 res = ldlm_cli_cancel_req(lock->l_conn_export,
1931 CDEBUG_LIMIT(res == -ESHUTDOWN ? D_DLMTRACE : D_ERROR,
1932 "ldlm_cli_cancel_list: %d\n", res);
1937 ldlm_lock_list_put(cancels, l_bl_ast, res);
1939 LASSERT(count == 0);
1942 EXPORT_SYMBOL(ldlm_cli_cancel_list);
1945 * Cancel all locks on a resource that have 0 readers/writers.
1947 * If flags & LDLM_FL_LOCAL_ONLY, throw the locks away without trying
1948 * to notify the server. */
1949 int ldlm_cli_cancel_unused_resource(struct ldlm_namespace *ns,
1950 const struct ldlm_res_id *res_id,
1951 union ldlm_policy_data *policy,
1952 enum ldlm_mode mode,
1953 enum ldlm_cancel_flags flags, void *opaque)
1955 struct ldlm_resource *res;
1956 struct list_head cancels = LIST_HEAD_INIT(cancels);
1961 res = ldlm_resource_get(ns, NULL, res_id, 0, 0);
1963 /* This is not a problem. */
1964 CDEBUG(D_INFO, "No resource "LPU64"\n", res_id->name[0]);
1968 LDLM_RESOURCE_ADDREF(res);
1969 count = ldlm_cancel_resource_local(res, &cancels, policy, mode,
1970 0, flags | LCF_BL_AST, opaque);
1971 rc = ldlm_cli_cancel_list(&cancels, count, NULL, flags);
1973 CERROR("canceling unused lock "DLDLMRES": rc = %d\n",
1976 LDLM_RESOURCE_DELREF(res);
1977 ldlm_resource_putref(res);
1980 EXPORT_SYMBOL(ldlm_cli_cancel_unused_resource);
1982 struct ldlm_cli_cancel_arg {
1988 ldlm_cli_hash_cancel_unused(struct cfs_hash *hs, struct cfs_hash_bd *bd,
1989 struct hlist_node *hnode, void *arg)
1991 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
1992 struct ldlm_cli_cancel_arg *lc = arg;
1994 ldlm_cli_cancel_unused_resource(ldlm_res_to_ns(res), &res->lr_name,
1995 NULL, LCK_MINMODE, lc->lc_flags,
1997 /* must return 0 for hash iteration */
2002 * Cancel all locks on a namespace (or a specific resource, if given)
2003 * that have 0 readers/writers.
2005 * If flags & LCF_LOCAL, throw the locks away without trying
2006 * to notify the server. */
2007 int ldlm_cli_cancel_unused(struct ldlm_namespace *ns,
2008 const struct ldlm_res_id *res_id,
2009 enum ldlm_cancel_flags flags, void *opaque)
2011 struct ldlm_cli_cancel_arg arg = {
2013 .lc_opaque = opaque,
2021 if (res_id != NULL) {
2022 RETURN(ldlm_cli_cancel_unused_resource(ns, res_id, NULL,
2026 cfs_hash_for_each_nolock(ns->ns_rs_hash,
2027 ldlm_cli_hash_cancel_unused, &arg, 0);
2032 /* Lock iterators. */
2034 int ldlm_resource_foreach(struct ldlm_resource *res, ldlm_iterator_t iter,
2037 struct list_head *tmp, *next;
2038 struct ldlm_lock *lock;
2039 int rc = LDLM_ITER_CONTINUE;
2044 RETURN(LDLM_ITER_CONTINUE);
2047 list_for_each_safe(tmp, next, &res->lr_granted) {
2048 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
2050 if (iter(lock, closure) == LDLM_ITER_STOP)
2051 GOTO(out, rc = LDLM_ITER_STOP);
2054 list_for_each_safe(tmp, next, &res->lr_converting) {
2055 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
2057 if (iter(lock, closure) == LDLM_ITER_STOP)
2058 GOTO(out, rc = LDLM_ITER_STOP);
2061 list_for_each_safe(tmp, next, &res->lr_waiting) {
2062 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
2064 if (iter(lock, closure) == LDLM_ITER_STOP)
2065 GOTO(out, rc = LDLM_ITER_STOP);
2072 struct iter_helper_data {
2073 ldlm_iterator_t iter;
2077 static int ldlm_iter_helper(struct ldlm_lock *lock, void *closure)
2079 struct iter_helper_data *helper = closure;
2080 return helper->iter(lock, helper->closure);
2083 static int ldlm_res_iter_helper(struct cfs_hash *hs, struct cfs_hash_bd *bd,
2084 struct hlist_node *hnode, void *arg)
2087 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
2089 return ldlm_resource_foreach(res, ldlm_iter_helper, arg) ==
2093 void ldlm_namespace_foreach(struct ldlm_namespace *ns,
2094 ldlm_iterator_t iter, void *closure)
2097 struct iter_helper_data helper = { .iter = iter, .closure = closure };
2099 cfs_hash_for_each_nolock(ns->ns_rs_hash,
2100 ldlm_res_iter_helper, &helper, 0);
2104 /* non-blocking function to manipulate a lock whose cb_data is being put away.
2105 * return 0: find no resource
2106 * > 0: must be LDLM_ITER_STOP/LDLM_ITER_CONTINUE.
2109 int ldlm_resource_iterate(struct ldlm_namespace *ns,
2110 const struct ldlm_res_id *res_id,
2111 ldlm_iterator_t iter, void *data)
2113 struct ldlm_resource *res;
2117 LASSERTF(ns != NULL, "must pass in namespace\n");
2119 res = ldlm_resource_get(ns, NULL, res_id, 0, 0);
2123 LDLM_RESOURCE_ADDREF(res);
2124 rc = ldlm_resource_foreach(res, iter, data);
2125 LDLM_RESOURCE_DELREF(res);
2126 ldlm_resource_putref(res);
2129 EXPORT_SYMBOL(ldlm_resource_iterate);
2133 static int ldlm_chain_lock_for_replay(struct ldlm_lock *lock, void *closure)
2135 struct list_head *list = closure;
2137 /* we use l_pending_chain here, because it's unused on clients. */
2138 LASSERTF(list_empty(&lock->l_pending_chain),
2139 "lock %p next %p prev %p\n",
2140 lock, &lock->l_pending_chain.next,&lock->l_pending_chain.prev);
2141 /* bug 9573: don't replay locks left after eviction, or
2142 * bug 17614: locks being actively cancelled. Get a reference
2143 * on a lock so that it does not disapear under us (e.g. due to cancel)
2145 if (!(lock->l_flags & (LDLM_FL_FAILED|LDLM_FL_CANCELING))) {
2146 list_add(&lock->l_pending_chain, list);
2147 LDLM_LOCK_GET(lock);
2150 return LDLM_ITER_CONTINUE;
2153 static int replay_lock_interpret(const struct lu_env *env,
2154 struct ptlrpc_request *req,
2155 struct ldlm_async_args *aa, int rc)
2157 struct ldlm_lock *lock;
2158 struct ldlm_reply *reply;
2159 struct obd_export *exp;
2162 atomic_dec(&req->rq_import->imp_replay_inflight);
2166 reply = req_capsule_server_get(&req->rq_pill, &RMF_DLM_REP);
2168 GOTO(out, rc = -EPROTO);
2170 lock = ldlm_handle2lock(&aa->lock_handle);
2172 CERROR("received replay ack for unknown local cookie "LPX64
2173 " remote cookie "LPX64 " from server %s id %s\n",
2174 aa->lock_handle.cookie, reply->lock_handle.cookie,
2175 req->rq_export->exp_client_uuid.uuid,
2176 libcfs_id2str(req->rq_peer));
2177 GOTO(out, rc = -ESTALE);
2180 /* Key change rehash lock in per-export hash with new key */
2181 exp = req->rq_export;
2182 if (exp && exp->exp_lock_hash) {
2183 /* In the function below, .hs_keycmp resolves to
2184 * ldlm_export_lock_keycmp() */
2185 /* coverity[overrun-buffer-val] */
2186 cfs_hash_rehash_key(exp->exp_lock_hash,
2187 &lock->l_remote_handle,
2188 &reply->lock_handle,
2191 lock->l_remote_handle = reply->lock_handle;
2194 LDLM_DEBUG(lock, "replayed lock:");
2195 ptlrpc_import_recovery_state_machine(req->rq_import);
2196 LDLM_LOCK_PUT(lock);
2199 ptlrpc_connect_import(req->rq_import);
2204 static int replay_one_lock(struct obd_import *imp, struct ldlm_lock *lock)
2206 struct ptlrpc_request *req;
2207 struct ldlm_async_args *aa;
2208 struct ldlm_request *body;
2213 /* Bug 11974: Do not replay a lock which is actively being canceled */
2214 if (ldlm_is_canceling(lock)) {
2215 LDLM_DEBUG(lock, "Not replaying canceled lock:");
2219 /* If this is reply-less callback lock, we cannot replay it, since
2220 * server might have long dropped it, but notification of that event was
2221 * lost by network. (and server granted conflicting lock already) */
2222 if (ldlm_is_cancel_on_block(lock)) {
2223 LDLM_DEBUG(lock, "Not replaying reply-less lock:");
2224 ldlm_lock_cancel(lock);
2229 * If granted mode matches the requested mode, this lock is granted.
2231 * If they differ, but we have a granted mode, then we were granted
2232 * one mode and now want another: ergo, converting.
2234 * If we haven't been granted anything and are on a resource list,
2235 * then we're blocked/waiting.
2237 * If we haven't been granted anything and we're NOT on a resource list,
2238 * then we haven't got a reply yet and don't have a known disposition.
2239 * This happens whenever a lock enqueue is the request that triggers
2242 if (lock->l_granted_mode == lock->l_req_mode)
2243 flags = LDLM_FL_REPLAY | LDLM_FL_BLOCK_GRANTED;
2244 else if (lock->l_granted_mode)
2245 flags = LDLM_FL_REPLAY | LDLM_FL_BLOCK_CONV;
2246 else if (!list_empty(&lock->l_res_link))
2247 flags = LDLM_FL_REPLAY | LDLM_FL_BLOCK_WAIT;
2249 flags = LDLM_FL_REPLAY;
2251 req = ptlrpc_request_alloc_pack(imp, &RQF_LDLM_ENQUEUE,
2252 LUSTRE_DLM_VERSION, LDLM_ENQUEUE);
2256 /* We're part of recovery, so don't wait for it. */
2257 req->rq_send_state = LUSTRE_IMP_REPLAY_LOCKS;
2259 body = req_capsule_client_get(&req->rq_pill, &RMF_DLM_REQ);
2260 ldlm_lock2desc(lock, &body->lock_desc);
2261 body->lock_flags = ldlm_flags_to_wire(flags);
2263 ldlm_lock2handle(lock, &body->lock_handle[0]);
2264 if (lock->l_lvb_len > 0)
2265 req_capsule_extend(&req->rq_pill, &RQF_LDLM_ENQUEUE_LVB);
2266 req_capsule_set_size(&req->rq_pill, &RMF_DLM_LVB, RCL_SERVER,
2268 ptlrpc_request_set_replen(req);
2269 /* notify the server we've replayed all requests.
2270 * also, we mark the request to be put on a dedicated
2271 * queue to be processed after all request replayes.
2273 lustre_msg_set_flags(req->rq_reqmsg, MSG_REQ_REPLAY_DONE);
2275 LDLM_DEBUG(lock, "replaying lock:");
2277 atomic_inc(&req->rq_import->imp_replay_inflight);
2278 CLASSERT(sizeof(*aa) <= sizeof(req->rq_async_args));
2279 aa = ptlrpc_req_async_args(req);
2280 aa->lock_handle = body->lock_handle[0];
2281 req->rq_interpret_reply = (ptlrpc_interpterer_t)replay_lock_interpret;
2282 ptlrpcd_add_req(req);
2288 * Cancel as many unused locks as possible before replay. since we are
2289 * in recovery, we can't wait for any outstanding RPCs to send any RPC
2292 * Called only in recovery before replaying locks. there is no need to
2293 * replay locks that are unused. since the clients may hold thousands of
2294 * cached unused locks, dropping the unused locks can greatly reduce the
2295 * load on the servers at recovery time.
2297 static void ldlm_cancel_unused_locks_for_replay(struct ldlm_namespace *ns)
2300 struct list_head cancels = LIST_HEAD_INIT(cancels);
2302 CDEBUG(D_DLMTRACE, "Dropping as many unused locks as possible before"
2303 "replay for namespace %s (%d)\n",
2304 ldlm_ns_name(ns), ns->ns_nr_unused);
2306 /* We don't need to care whether or not LRU resize is enabled
2307 * because the LDLM_LRU_FLAG_NO_WAIT policy doesn't use the
2308 * count parameter */
2309 canceled = ldlm_cancel_lru_local(ns, &cancels, ns->ns_nr_unused, 0,
2310 LCF_LOCAL, LDLM_LRU_FLAG_NO_WAIT);
2312 CDEBUG(D_DLMTRACE, "Canceled %d unused locks from namespace %s\n",
2313 canceled, ldlm_ns_name(ns));
2316 int ldlm_replay_locks(struct obd_import *imp)
2318 struct ldlm_namespace *ns = imp->imp_obd->obd_namespace;
2319 struct list_head list = LIST_HEAD_INIT(list);
2320 struct ldlm_lock *lock, *next;
2325 LASSERT(atomic_read(&imp->imp_replay_inflight) == 0);
2327 /* don't replay locks if import failed recovery */
2328 if (imp->imp_vbr_failed)
2331 /* ensure this doesn't fall to 0 before all have been queued */
2332 atomic_inc(&imp->imp_replay_inflight);
2334 if (ldlm_cancel_unused_locks_before_replay)
2335 ldlm_cancel_unused_locks_for_replay(ns);
2337 ldlm_namespace_foreach(ns, ldlm_chain_lock_for_replay, &list);
2339 list_for_each_entry_safe(lock, next, &list, l_pending_chain) {
2340 list_del_init(&lock->l_pending_chain);
2342 LDLM_LOCK_RELEASE(lock);
2343 continue; /* or try to do the rest? */
2345 rc = replay_one_lock(imp, lock);
2346 LDLM_LOCK_RELEASE(lock);
2349 atomic_dec(&imp->imp_replay_inflight);