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) 2002, 2010, Oracle and/or its affiliates. All rights reserved.
24 * Use is subject to license terms.
26 * Copyright (c) 2010, 2016, Intel Corporation.
29 * This file is part of Lustre, http://www.lustre.org/
30 * Lustre is a trademark of Sun Microsystems, Inc.
33 * This file contains Asynchronous System Trap (AST) handlers and related
34 * LDLM request-processing routines.
36 * An AST is a callback issued on a lock when its state is changed. There are
37 * several different types of ASTs (callbacks) registered for each lock:
39 * - completion AST: when a lock is enqueued by some process, but cannot be
40 * granted immediately due to other conflicting locks on the same resource,
41 * the completion AST is sent to notify the caller when the lock is
44 * - blocking AST: when a lock is granted to some process, if another process
45 * enqueues a conflicting (blocking) lock on a resource, a blocking AST is
46 * sent to notify the holder(s) of the lock(s) of the conflicting lock
47 * request. The lock holder(s) must release their lock(s) on that resource in
48 * a timely manner or be evicted by the server.
50 * - glimpse AST: this is used when a process wants information about a lock
51 * (i.e. the lock value block (LVB)) but does not necessarily require holding
52 * the lock. If the resource is locked, the lock holder(s) are sent glimpse
53 * ASTs and the LVB is returned to the caller, and lock holder(s) may CANCEL
54 * their lock(s) if they are idle. If the resource is not locked, the server
58 #define DEBUG_SUBSYSTEM S_LDLM
60 #include <lustre_errno.h>
61 #include <lustre_dlm.h>
62 #include <obd_class.h>
65 #include "ldlm_internal.h"
67 unsigned int ldlm_enqueue_min = OBD_TIMEOUT_DEFAULT;
68 module_param(ldlm_enqueue_min, uint, 0644);
69 MODULE_PARM_DESC(ldlm_enqueue_min, "lock enqueue timeout minimum");
71 /* in client side, whether the cached locks will be canceled before replay */
72 unsigned int ldlm_cancel_unused_locks_before_replay = 1;
74 static void interrupted_completion_wait(void *data)
78 struct lock_wait_data {
79 struct ldlm_lock *lwd_lock;
83 struct ldlm_async_args {
84 struct lustre_handle lock_handle;
88 * ldlm_request_bufsize
90 * If opcode=LDLM_ENQUEUE, 1 slot is already occupied,
91 * LDLM_LOCKREQ_HANDLE -1 slots are available.
92 * Otherwise, LDLM_LOCKREQ_HANDLE slots are available.
97 * \retval size of the request buffer
100 int ldlm_request_bufsize(int count, int type)
102 int avail = LDLM_LOCKREQ_HANDLES;
103 if (type == LDLM_ENQUEUE)
104 avail -= LDLM_ENQUEUE_CANCEL_OFF;
107 avail = (count - avail) * sizeof(struct lustre_handle);
111 return sizeof(struct ldlm_request) + avail;
114 int ldlm_expired_completion_wait(void *data)
116 struct lock_wait_data *lwd = data;
117 struct ldlm_lock *lock = lwd->lwd_lock;
118 struct obd_import *imp;
119 struct obd_device *obd;
122 if (lock->l_conn_export == NULL) {
123 static time64_t next_dump, last_dump;
125 LDLM_ERROR(lock, "lock timed out (enqueued at %lld, %llds ago); "
126 "not entering recovery in server code, just going back to sleep",
127 (s64)lock->l_last_activity,
128 (s64)(ktime_get_real_seconds() -
129 lock->l_last_activity));
130 if (ktime_get_seconds() > next_dump) {
131 last_dump = next_dump;
132 next_dump = ktime_get_seconds() + 300;
133 ldlm_namespace_dump(D_DLMTRACE,
134 ldlm_lock_to_ns(lock));
136 libcfs_debug_dumplog();
141 obd = lock->l_conn_export->exp_obd;
142 imp = obd->u.cli.cl_import;
143 ptlrpc_fail_import(imp, lwd->lwd_conn_cnt);
144 LDLM_ERROR(lock, "lock timed out (enqueued at %lld, %llds ago), entering recovery for %s@%s",
145 (s64)lock->l_last_activity,
146 (s64)(ktime_get_real_seconds() - lock->l_last_activity),
147 obd2cli_tgt(obd), imp->imp_connection->c_remote_uuid.uuid);
153 * Calculate the Completion timeout (covering enqueue, BL AST, data flush,
154 * lock cancel, and their replies). Used for lock completion timeout on the
157 * \param[in] lock lock which is waiting the completion callback
159 * \retval timeout in seconds to wait for the server reply
162 /* We use the same basis for both server side and client side functions
163 from a single node. */
164 static time64_t ldlm_cp_timeout(struct ldlm_lock *lock)
171 /* Wait a long time for enqueue - server may have to callback a
172 * lock from another client. Server will evict the other client if it
173 * doesn't respond reasonably, and then give us the lock. */
174 timeout = at_get(ldlm_lock_to_ns_at(lock));
175 return max(3 * timeout, (time64_t) ldlm_enqueue_min);
179 * Helper function for ldlm_completion_ast(), updating timings when lock is
182 static int ldlm_completion_tail(struct ldlm_lock *lock, void *data)
187 if (ldlm_is_destroyed(lock) || ldlm_is_failed(lock)) {
188 LDLM_DEBUG(lock, "client-side enqueue: destroyed");
190 } else if (data == NULL) {
191 LDLM_DEBUG(lock, "client-side enqueue: granted");
193 /* Take into AT only CP RPC, not immediately granted locks */
194 delay = ktime_get_real_seconds() - lock->l_last_activity;
195 LDLM_DEBUG(lock, "client-side enqueue: granted after %llds",
198 /* Update our time estimate */
199 at_measured(ldlm_lock_to_ns_at(lock), delay);
205 * Implementation of ->l_completion_ast() for a client, that doesn't wait
206 * until lock is granted. Suitable for locks enqueued through ptlrpcd, of
207 * other threads that cannot block for long.
209 int ldlm_completion_ast_async(struct ldlm_lock *lock, __u64 flags, void *data)
213 if (flags == LDLM_FL_WAIT_NOREPROC) {
214 LDLM_DEBUG(lock, "client-side enqueue waiting on pending lock");
218 if (!(flags & LDLM_FL_BLOCKED_MASK)) {
219 wake_up(&lock->l_waitq);
220 RETURN(ldlm_completion_tail(lock, data));
223 LDLM_DEBUG(lock, "client-side enqueue returned a blocked lock, "
225 ldlm_reprocess_all(lock->l_resource);
228 EXPORT_SYMBOL(ldlm_completion_ast_async);
231 * Generic LDLM "completion" AST. This is called in several cases:
233 * - when a reply to an ENQUEUE RPC is received from the server
234 * (ldlm_cli_enqueue_fini()). Lock might be granted or not granted at
235 * this point (determined by flags);
237 * - when LDLM_CP_CALLBACK RPC comes to client to notify it that lock has
240 * - when ldlm_lock_match(LDLM_FL_LVB_READY) is about to wait until lock
243 * - to force all locks when resource is destroyed (cleanup_resource());
245 * - during lock conversion (not used currently).
247 * If lock is not granted in the first case, this function waits until second
248 * or penultimate cases happen in some other thread.
251 int ldlm_completion_ast(struct ldlm_lock *lock, __u64 flags, void *data)
253 /* XXX ALLOCATE - 160 bytes */
254 struct lock_wait_data lwd;
255 struct obd_device *obd;
256 struct obd_import *imp = NULL;
257 struct l_wait_info lwi;
262 if (flags == LDLM_FL_WAIT_NOREPROC) {
263 LDLM_DEBUG(lock, "client-side enqueue waiting on pending lock");
267 if (!(flags & LDLM_FL_BLOCKED_MASK)) {
268 wake_up(&lock->l_waitq);
272 LDLM_DEBUG(lock, "client-side enqueue returned a blocked lock, "
277 obd = class_exp2obd(lock->l_conn_export);
279 /* if this is a local lock, then there is no import */
281 imp = obd->u.cli.cl_import;
284 timeout = ldlm_cp_timeout(lock);
287 lock->l_last_activity = ktime_get_real_seconds();
289 if (ldlm_is_no_timeout(lock)) {
290 LDLM_DEBUG(lock, "waiting indefinitely because of NO_TIMEOUT");
291 lwi = LWI_INTR(interrupted_completion_wait, &lwd);
293 lwi = LWI_TIMEOUT_INTR(cfs_time_seconds(timeout),
294 ldlm_expired_completion_wait,
295 interrupted_completion_wait, &lwd);
299 spin_lock(&imp->imp_lock);
300 lwd.lwd_conn_cnt = imp->imp_conn_cnt;
301 spin_unlock(&imp->imp_lock);
304 if (ns_is_client(ldlm_lock_to_ns(lock)) &&
305 OBD_FAIL_CHECK_RESET(OBD_FAIL_LDLM_INTR_CP_AST,
306 OBD_FAIL_LDLM_CP_BL_RACE | OBD_FAIL_ONCE)) {
307 ldlm_set_fail_loc(lock);
310 /* Go to sleep until the lock is granted or cancelled. */
311 rc = l_wait_event(lock->l_waitq,
312 is_granted_or_cancelled(lock), &lwi);
316 LDLM_DEBUG(lock, "client-side enqueue waking up: failed (%d)",
321 RETURN(ldlm_completion_tail(lock, data));
323 EXPORT_SYMBOL(ldlm_completion_ast);
326 * A helper to build a blocking AST function
328 * Perform a common operation for blocking ASTs:
329 * defferred lock cancellation.
331 * \param lock the lock blocking or canceling AST was called on
333 * \see mdt_blocking_ast
334 * \see ldlm_blocking_ast
336 int ldlm_blocking_ast_nocheck(struct ldlm_lock *lock)
341 ldlm_set_cbpending(lock);
342 do_ast = (!lock->l_readers && !lock->l_writers);
343 unlock_res_and_lock(lock);
346 struct lustre_handle lockh;
349 LDLM_DEBUG(lock, "already unused, calling ldlm_cli_cancel");
350 ldlm_lock2handle(lock, &lockh);
351 rc = ldlm_cli_cancel(&lockh, LCF_ASYNC);
353 CERROR("ldlm_cli_cancel: %d\n", rc);
355 LDLM_DEBUG(lock, "Lock still has references, will be "
360 EXPORT_SYMBOL(ldlm_blocking_ast_nocheck);
363 * Server blocking AST
365 * ->l_blocking_ast() callback for LDLM locks acquired by server-side
368 * \param lock the lock which blocks a request or cancelling lock
371 * \param flag indicates whether this cancelling or blocking callback
373 * \see ldlm_blocking_ast_nocheck
375 int ldlm_blocking_ast(struct ldlm_lock *lock, struct ldlm_lock_desc *desc,
376 void *data, int flag)
380 if (flag == LDLM_CB_CANCELING) {
381 /* Don't need to do anything here. */
385 lock_res_and_lock(lock);
386 /* Get this: if ldlm_blocking_ast is racing with intent_policy, such
387 * that ldlm_blocking_ast is called just before intent_policy method
388 * takes the lr_lock, then by the time we get the lock, we might not
389 * be the correct blocking function anymore. So check, and return
391 if (lock->l_blocking_ast != ldlm_blocking_ast) {
392 unlock_res_and_lock(lock);
395 RETURN(ldlm_blocking_ast_nocheck(lock));
397 EXPORT_SYMBOL(ldlm_blocking_ast);
400 * Implements ldlm_lock::l_glimpse_ast for extent locks acquired on the server.
402 * Returning -ELDLM_NO_LOCK_DATA actually works, but the reason for that is
403 * rather subtle: with OST-side locking, it may so happen that _all_ extent
404 * locks are held by the OST. If client wants to obtain the current file size
405 * it calls ll_glimpse_size(), and (as all locks are held only on the server),
406 * this dummy glimpse callback fires and does nothing. The client still
407 * receives the correct file size due to the following fragment of code in
408 * ldlm_cb_interpret():
410 * if (rc == -ELDLM_NO_LOCK_DATA) {
411 * LDLM_DEBUG(lock, "lost race - client has a lock but no"
413 * ldlm_res_lvbo_update(lock->l_resource, NULL, 1);
416 * That is, after the glimpse returns this error, ofd_lvbo_update() is called
417 * and returns the updated file attributes from the inode to the client.
419 * See also comment in ofd_intent_policy() on why servers must set a non-NULL
420 * l_glimpse_ast when grabbing DLM locks. Otherwise, the server will assume
421 * that the object is in the process of being destroyed.
423 * \param[in] lock DLM lock being glimpsed, unused
424 * \param[in] reqp pointer to ptlrpc_request, unused
426 * \retval -ELDLM_NO_LOCK_DATA to get attributes from disk object
428 int ldlm_glimpse_ast(struct ldlm_lock *lock, void *reqp)
430 return -ELDLM_NO_LOCK_DATA;
434 * Enqueue a local lock (typically on a server).
436 int ldlm_cli_enqueue_local(struct ldlm_namespace *ns,
437 const struct ldlm_res_id *res_id,
438 enum ldlm_type type, union ldlm_policy_data *policy,
439 enum ldlm_mode mode, __u64 *flags,
440 ldlm_blocking_callback blocking,
441 ldlm_completion_callback completion,
442 ldlm_glimpse_callback glimpse,
443 void *data, __u32 lvb_len, enum lvb_type lvb_type,
444 const __u64 *client_cookie,
445 struct lustre_handle *lockh)
447 struct ldlm_lock *lock;
449 const struct ldlm_callback_suite cbs = { .lcs_completion = completion,
450 .lcs_blocking = blocking,
451 .lcs_glimpse = glimpse,
455 LASSERT(!(*flags & LDLM_FL_REPLAY));
456 if (unlikely(ns_is_client(ns))) {
457 CERROR("Trying to enqueue local lock in a shadow namespace\n");
461 lock = ldlm_lock_create(ns, res_id, type, mode, &cbs, data, lvb_len,
464 GOTO(out_nolock, err = PTR_ERR(lock));
466 err = ldlm_lvbo_init(lock->l_resource);
468 LDLM_ERROR(lock, "delayed lvb init failed (rc %d)", err);
472 ldlm_lock2handle(lock, lockh);
474 /* NB: we don't have any lock now (lock_res_and_lock)
475 * because it's a new lock */
476 ldlm_lock_addref_internal_nolock(lock, mode);
477 ldlm_set_local(lock);
478 if (*flags & LDLM_FL_ATOMIC_CB)
479 ldlm_set_atomic_cb(lock);
482 lock->l_policy_data = *policy;
483 if (client_cookie != NULL)
484 lock->l_client_cookie = *client_cookie;
485 if (type == LDLM_EXTENT) {
486 /* extent lock without policy is a bug */
490 lock->l_req_extent = policy->l_extent;
493 err = ldlm_lock_enqueue(ns, &lock, policy, flags);
494 if (unlikely(err != ELDLM_OK))
498 *policy = lock->l_policy_data;
500 if (lock->l_completion_ast)
501 lock->l_completion_ast(lock, *flags, NULL);
503 LDLM_DEBUG(lock, "client-side local enqueue handler, new lock created");
506 LDLM_LOCK_RELEASE(lock);
510 EXPORT_SYMBOL(ldlm_cli_enqueue_local);
512 static void failed_lock_cleanup(struct ldlm_namespace *ns,
513 struct ldlm_lock *lock, int mode)
517 /* Set a flag to prevent us from sending a CANCEL (bug 407) */
518 lock_res_and_lock(lock);
519 /* Check that lock is not granted or failed, we might race. */
520 if ((lock->l_req_mode != lock->l_granted_mode) &&
521 !ldlm_is_failed(lock)) {
522 /* Make sure that this lock will not be found by raced
523 * bl_ast and -EINVAL reply is sent to server anyways.
525 lock->l_flags |= LDLM_FL_LOCAL_ONLY | LDLM_FL_FAILED |
526 LDLM_FL_ATOMIC_CB | LDLM_FL_CBPENDING;
529 unlock_res_and_lock(lock);
533 "setting FL_LOCAL_ONLY | LDLM_FL_FAILED | "
534 "LDLM_FL_ATOMIC_CB | LDLM_FL_CBPENDING");
536 LDLM_DEBUG(lock, "lock was granted or failed in race");
538 /* XXX - HACK because we shouldn't call ldlm_lock_destroy()
539 * from llite/file.c/ll_file_flock(). */
540 /* This code makes for the fact that we do not have blocking handler on
541 * a client for flock locks. As such this is the place where we must
542 * completely kill failed locks. (interrupted and those that
543 * were waiting to be granted when server evicted us. */
544 if (lock->l_resource->lr_type == LDLM_FLOCK) {
545 lock_res_and_lock(lock);
546 if (!ldlm_is_destroyed(lock)) {
547 ldlm_resource_unlink_lock(lock);
548 ldlm_lock_decref_internal_nolock(lock, mode);
549 ldlm_lock_destroy_nolock(lock);
551 unlock_res_and_lock(lock);
553 ldlm_lock_decref_internal(lock, mode);
558 * Finishing portion of client lock enqueue code.
560 * Called after receiving reply from server.
562 int ldlm_cli_enqueue_fini(struct obd_export *exp, struct ptlrpc_request *req,
563 enum ldlm_type type, __u8 with_policy,
564 enum ldlm_mode mode, __u64 *flags, void *lvb,
565 __u32 lvb_len, const struct lustre_handle *lockh,
568 struct ldlm_namespace *ns = exp->exp_obd->obd_namespace;
569 int is_replay = *flags & LDLM_FL_REPLAY;
570 struct ldlm_lock *lock;
571 struct ldlm_reply *reply;
572 int cleanup_phase = 1;
575 lock = ldlm_handle2lock(lockh);
576 /* ldlm_cli_enqueue is holding a reference on this lock. */
578 LASSERT(type == LDLM_FLOCK);
582 LASSERTF(ergo(lvb_len != 0, lvb_len == lock->l_lvb_len),
583 "lvb_len = %d, l_lvb_len = %d\n", lvb_len, lock->l_lvb_len);
585 if (rc != ELDLM_OK) {
587 LDLM_DEBUG(lock, "client-side enqueue END (%s)",
588 rc == ELDLM_LOCK_ABORTED ? "ABORTED" : "FAILED");
590 if (rc != ELDLM_LOCK_ABORTED)
594 /* Before we return, swab the reply */
595 reply = req_capsule_server_get(&req->rq_pill, &RMF_DLM_REP);
597 GOTO(cleanup, rc = -EPROTO);
602 size = req_capsule_get_size(&req->rq_pill, &RMF_DLM_LVB,
605 LDLM_ERROR(lock, "Fail to get lvb_len, rc = %d", size);
606 GOTO(cleanup, rc = size);
607 } else if (unlikely(size > lvb_len)) {
608 LDLM_ERROR(lock, "Replied LVB is larger than "
609 "expectation, expected = %d, replied = %d",
611 GOTO(cleanup, rc = -EINVAL);
616 if (rc == ELDLM_LOCK_ABORTED) {
617 if (lvb_len > 0 && lvb != NULL)
618 rc = ldlm_fill_lvb(lock, &req->rq_pill, RCL_SERVER,
620 GOTO(cleanup, rc = rc ? : ELDLM_LOCK_ABORTED);
623 /* lock enqueued on the server */
626 lock_res_and_lock(lock);
627 /* Key change rehash lock in per-export hash with new key */
628 if (exp->exp_lock_hash) {
629 /* In the function below, .hs_keycmp resolves to
630 * ldlm_export_lock_keycmp() */
631 /* coverity[overrun-buffer-val] */
632 cfs_hash_rehash_key(exp->exp_lock_hash,
633 &lock->l_remote_handle,
637 lock->l_remote_handle = reply->lock_handle;
640 *flags = ldlm_flags_from_wire(reply->lock_flags);
641 lock->l_flags |= ldlm_flags_from_wire(reply->lock_flags &
642 LDLM_FL_INHERIT_MASK);
643 unlock_res_and_lock(lock);
645 CDEBUG(D_INFO, "local: %p, remote cookie: %#llx, flags: %#llx\n",
646 lock, reply->lock_handle.cookie, *flags);
648 /* If enqueue returned a blocked lock but the completion handler has
649 * already run, then it fixed up the resource and we don't need to do it
651 if ((*flags) & LDLM_FL_LOCK_CHANGED) {
652 int newmode = reply->lock_desc.l_req_mode;
654 if (newmode && newmode != lock->l_req_mode) {
655 LDLM_DEBUG(lock, "server returned different mode %s",
656 ldlm_lockname[newmode]);
657 lock->l_req_mode = newmode;
660 if (!ldlm_res_eq(&reply->lock_desc.l_resource.lr_name,
661 &lock->l_resource->lr_name)) {
662 CDEBUG(D_INFO, "remote intent success, locking "DLDLMRES
663 " instead of "DLDLMRES"\n",
664 PLDLMRES(&reply->lock_desc.l_resource),
665 PLDLMRES(lock->l_resource));
667 rc = ldlm_lock_change_resource(ns, lock,
668 &reply->lock_desc.l_resource.lr_name);
669 if (rc || lock->l_resource == NULL)
670 GOTO(cleanup, rc = -ENOMEM);
671 LDLM_DEBUG(lock, "client-side enqueue, new resource");
674 if (!(type == LDLM_IBITS &&
675 !(exp_connect_flags(exp) & OBD_CONNECT_IBITS)))
676 /* We assume lock type cannot change on server*/
677 ldlm_convert_policy_to_local(exp,
678 lock->l_resource->lr_type,
679 &reply->lock_desc.l_policy_data,
680 &lock->l_policy_data);
681 if (type != LDLM_PLAIN)
682 LDLM_DEBUG(lock,"client-side enqueue, new policy data");
685 if ((*flags) & LDLM_FL_AST_SENT) {
686 lock_res_and_lock(lock);
687 lock->l_flags |= LDLM_FL_CBPENDING | LDLM_FL_BL_AST;
688 unlock_res_and_lock(lock);
689 LDLM_DEBUG(lock, "enqueue reply includes blocking AST");
692 /* If the lock has already been granted by a completion AST, don't
693 * clobber the LVB with an older one. */
695 /* We must lock or a racing completion might update lvb without
696 * letting us know and we'll clobber the correct value.
697 * Cannot unlock after the check either, a that still leaves
698 * a tiny window for completion to get in */
699 lock_res_and_lock(lock);
700 if (lock->l_req_mode != lock->l_granted_mode)
701 rc = ldlm_fill_lvb(lock, &req->rq_pill, RCL_SERVER,
702 lock->l_lvb_data, lvb_len);
703 unlock_res_and_lock(lock);
711 rc = ldlm_lock_enqueue(ns, &lock, NULL, flags);
712 if (lock->l_completion_ast != NULL) {
713 int err = lock->l_completion_ast(lock, *flags, NULL);
721 if (lvb_len > 0 && lvb != NULL) {
722 /* Copy the LVB here, and not earlier, because the completion
723 * AST (if any) can override what we got in the reply */
724 memcpy(lvb, lock->l_lvb_data, lvb_len);
727 LDLM_DEBUG(lock, "client-side enqueue END");
730 if (cleanup_phase == 1 && rc)
731 failed_lock_cleanup(ns, lock, mode);
732 /* Put lock 2 times, the second reference is held by ldlm_cli_enqueue */
734 LDLM_LOCK_RELEASE(lock);
737 EXPORT_SYMBOL(ldlm_cli_enqueue_fini);
740 * Estimate number of lock handles that would fit into request of given
741 * size. PAGE_SIZE-512 is to allow TCP/IP and LNET headers to fit into
742 * a single page on the send/receive side. XXX: 512 should be changed to
743 * more adequate value.
745 static inline int ldlm_req_handles_avail(int req_size, int off)
749 avail = min_t(int, LDLM_MAXREQSIZE, PAGE_SIZE - 512) - req_size;
750 if (likely(avail >= 0))
751 avail /= (int)sizeof(struct lustre_handle);
754 avail += LDLM_LOCKREQ_HANDLES - off;
759 static inline int ldlm_capsule_handles_avail(struct req_capsule *pill,
760 enum req_location loc,
763 __u32 size = req_capsule_msg_size(pill, loc);
764 return ldlm_req_handles_avail(size, off);
767 static inline int ldlm_format_handles_avail(struct obd_import *imp,
768 const struct req_format *fmt,
769 enum req_location loc, int off)
771 __u32 size = req_capsule_fmt_size(imp->imp_msg_magic, fmt, loc);
772 return ldlm_req_handles_avail(size, off);
776 * Cancel LRU locks and pack them into the enqueue request. Pack there the given
777 * \a count locks in \a cancels.
779 * This is to be called by functions preparing their own requests that
780 * might contain lists of locks to cancel in addition to actual operation
781 * that needs to be performed.
783 int ldlm_prep_elc_req(struct obd_export *exp, struct ptlrpc_request *req,
784 int version, int opc, int canceloff,
785 struct list_head *cancels, int count)
787 struct ldlm_namespace *ns = exp->exp_obd->obd_namespace;
788 struct req_capsule *pill = &req->rq_pill;
789 struct ldlm_request *dlm = NULL;
790 struct list_head head = LIST_HEAD_INIT(head);
791 enum ldlm_lru_flags lru_flags;
792 int avail, to_free, pack = 0;
798 if (ns_connect_cancelset(ns)) {
799 /* Estimate the amount of available space in the request. */
800 req_capsule_filled_sizes(pill, RCL_CLIENT);
801 avail = ldlm_capsule_handles_avail(pill, RCL_CLIENT, canceloff);
803 lru_flags = LDLM_LRU_FLAG_NO_WAIT | (ns_connect_lru_resize(ns) ?
804 LDLM_LRU_FLAG_LRUR : LDLM_LRU_FLAG_AGED);
805 to_free = !ns_connect_lru_resize(ns) &&
806 opc == LDLM_ENQUEUE ? 1 : 0;
808 /* Cancel LRU locks here _only_ if the server supports
809 * EARLY_CANCEL. Otherwise we have to send extra CANCEL
810 * RPC, which will make us slower. */
812 count += ldlm_cancel_lru_local(ns, cancels, to_free,
819 req_capsule_set_size(pill, &RMF_DLM_REQ, RCL_CLIENT,
820 ldlm_request_bufsize(pack, opc));
823 rc = ptlrpc_request_pack(req, version, opc);
825 ldlm_lock_list_put(cancels, l_bl_ast, count);
829 if (ns_connect_cancelset(ns)) {
831 dlm = req_capsule_client_get(pill, &RMF_DLM_REQ);
833 /* Skip first lock handler in ldlm_request_pack(),
834 * this method will increment @lock_count according
835 * to the lock handle amount actually written to
837 dlm->lock_count = canceloff;
839 /* Pack into the request @pack lock handles. */
840 ldlm_cli_cancel_list(cancels, pack, req, 0);
841 /* Prepare and send separate cancel RPC for others. */
842 ldlm_cli_cancel_list(cancels, count - pack, NULL, 0);
844 ldlm_lock_list_put(cancels, l_bl_ast, count);
848 EXPORT_SYMBOL(ldlm_prep_elc_req);
850 int ldlm_prep_enqueue_req(struct obd_export *exp, struct ptlrpc_request *req,
851 struct list_head *cancels, int count)
853 return ldlm_prep_elc_req(exp, req, LUSTRE_DLM_VERSION, LDLM_ENQUEUE,
854 LDLM_ENQUEUE_CANCEL_OFF, cancels, count);
856 EXPORT_SYMBOL(ldlm_prep_enqueue_req);
858 struct ptlrpc_request *ldlm_enqueue_pack(struct obd_export *exp, int lvb_len)
860 struct ptlrpc_request *req;
864 req = ptlrpc_request_alloc(class_exp2cliimp(exp), &RQF_LDLM_ENQUEUE);
866 RETURN(ERR_PTR(-ENOMEM));
868 rc = ldlm_prep_enqueue_req(exp, req, NULL, 0);
870 ptlrpc_request_free(req);
874 req_capsule_set_size(&req->rq_pill, &RMF_DLM_LVB, RCL_SERVER, lvb_len);
875 ptlrpc_request_set_replen(req);
878 EXPORT_SYMBOL(ldlm_enqueue_pack);
881 * Client-side lock enqueue.
883 * If a request has some specific initialisation it is passed in \a reqp,
884 * otherwise it is created in ldlm_cli_enqueue.
886 * Supports sync and async requests, pass \a async flag accordingly. If a
887 * request was created in ldlm_cli_enqueue and it is the async request,
888 * pass it to the caller in \a reqp.
890 int ldlm_cli_enqueue(struct obd_export *exp, struct ptlrpc_request **reqp,
891 struct ldlm_enqueue_info *einfo,
892 const struct ldlm_res_id *res_id,
893 union ldlm_policy_data const *policy, __u64 *flags,
894 void *lvb, __u32 lvb_len, enum lvb_type lvb_type,
895 struct lustre_handle *lockh, int async)
897 struct ldlm_namespace *ns;
898 struct ldlm_lock *lock;
899 struct ldlm_request *body;
900 int is_replay = *flags & LDLM_FL_REPLAY;
901 int req_passed_in = 1;
903 struct ptlrpc_request *req;
906 LASSERT(exp != NULL);
908 ns = exp->exp_obd->obd_namespace;
910 /* If we're replaying this lock, just check some invariants.
911 * If we're creating a new lock, get everything all setup nice. */
913 lock = ldlm_handle2lock_long(lockh, 0);
914 LASSERT(lock != NULL);
915 LDLM_DEBUG(lock, "client-side enqueue START");
916 LASSERT(exp == lock->l_conn_export);
918 const struct ldlm_callback_suite cbs = {
919 .lcs_completion = einfo->ei_cb_cp,
920 .lcs_blocking = einfo->ei_cb_bl,
921 .lcs_glimpse = einfo->ei_cb_gl
923 lock = ldlm_lock_create(ns, res_id, einfo->ei_type,
924 einfo->ei_mode, &cbs, einfo->ei_cbdata,
927 RETURN(PTR_ERR(lock));
928 /* for the local lock, add the reference */
929 ldlm_lock_addref_internal(lock, einfo->ei_mode);
930 ldlm_lock2handle(lock, lockh);
932 lock->l_policy_data = *policy;
934 if (einfo->ei_type == LDLM_EXTENT) {
935 /* extent lock without policy is a bug */
939 lock->l_req_extent = policy->l_extent;
941 LDLM_DEBUG(lock, "client-side enqueue START, flags %#llx",
945 lock->l_conn_export = exp;
946 lock->l_export = NULL;
947 lock->l_blocking_ast = einfo->ei_cb_bl;
948 lock->l_flags |= (*flags & (LDLM_FL_NO_LRU | LDLM_FL_EXCL));
949 lock->l_last_activity = ktime_get_real_seconds();
951 /* lock not sent to server yet */
952 if (reqp == NULL || *reqp == NULL) {
953 req = ldlm_enqueue_pack(exp, lvb_len);
955 failed_lock_cleanup(ns, lock, einfo->ei_mode);
956 LDLM_LOCK_RELEASE(lock);
957 RETURN(PTR_ERR(req));
967 len = req_capsule_get_size(&req->rq_pill, &RMF_DLM_REQ,
969 LASSERTF(len >= sizeof(*body), "buflen[%d] = %d, not %d\n",
970 DLM_LOCKREQ_OFF, len, (int)sizeof(*body));
973 /* Dump lock data into the request buffer */
974 body = req_capsule_client_get(&req->rq_pill, &RMF_DLM_REQ);
975 ldlm_lock2desc(lock, &body->lock_desc);
976 body->lock_flags = ldlm_flags_to_wire(*flags);
977 body->lock_handle[0] = *lockh;
980 LASSERT(reqp != NULL);
984 LDLM_DEBUG(lock, "sending request");
986 rc = ptlrpc_queue_wait(req);
988 err = ldlm_cli_enqueue_fini(exp, req, einfo->ei_type, policy ? 1 : 0,
989 einfo->ei_mode, flags, lvb, lvb_len,
992 /* If ldlm_cli_enqueue_fini did not find the lock, we need to free
993 * one reference that we took */
995 LDLM_LOCK_RELEASE(lock);
999 if (!req_passed_in && req != NULL) {
1000 ptlrpc_req_finished(req);
1007 EXPORT_SYMBOL(ldlm_cli_enqueue);
1009 static int ldlm_cli_convert_local(struct ldlm_lock *lock, int new_mode,
1012 struct ldlm_resource *res;
1015 if (ns_is_client(ldlm_lock_to_ns(lock))) {
1016 CERROR("Trying to cancel local lock\n");
1019 LDLM_DEBUG(lock, "client-side local convert");
1021 res = ldlm_lock_convert(lock, new_mode, flags);
1023 ldlm_reprocess_all(res);
1026 rc = LUSTRE_EDEADLK;
1028 LDLM_DEBUG(lock, "client-side local convert handler END");
1029 LDLM_LOCK_PUT(lock);
1033 /* FIXME: one of ldlm_cli_convert or the server side should reject attempted
1034 * conversion of locks which are on the waiting or converting queue */
1035 /* Caller of this code is supposed to take care of lock readers/writers
1037 int ldlm_cli_convert(const struct lustre_handle *lockh, int new_mode,
1040 struct ldlm_request *body;
1041 struct ldlm_reply *reply;
1042 struct ldlm_lock *lock;
1043 struct ldlm_resource *res;
1044 struct ptlrpc_request *req;
1048 lock = ldlm_handle2lock(lockh);
1055 if (lock->l_conn_export == NULL)
1056 RETURN(ldlm_cli_convert_local(lock, new_mode, flags));
1058 LDLM_DEBUG(lock, "client-side convert");
1060 req = ptlrpc_request_alloc_pack(class_exp2cliimp(lock->l_conn_export),
1061 &RQF_LDLM_CONVERT, LUSTRE_DLM_VERSION,
1064 LDLM_LOCK_PUT(lock);
1068 body = req_capsule_client_get(&req->rq_pill, &RMF_DLM_REQ);
1069 body->lock_handle[0] = lock->l_remote_handle;
1071 body->lock_desc.l_req_mode = new_mode;
1072 body->lock_flags = ldlm_flags_to_wire(*flags);
1075 ptlrpc_request_set_replen(req);
1076 rc = ptlrpc_queue_wait(req);
1080 reply = req_capsule_server_get(&req->rq_pill, &RMF_DLM_REP);
1082 GOTO(out, rc = -EPROTO);
1085 GOTO(out, rc = req->rq_status);
1087 res = ldlm_lock_convert(lock, new_mode, &reply->lock_flags);
1089 ldlm_reprocess_all(res);
1090 /* Go to sleep until the lock is granted. */
1091 /* FIXME: or cancelled. */
1092 if (lock->l_completion_ast) {
1093 rc = lock->l_completion_ast(lock, LDLM_FL_WAIT_NOREPROC,
1099 rc = LUSTRE_EDEADLK;
1103 LDLM_LOCK_PUT(lock);
1104 ptlrpc_req_finished(req);
1109 * Cancel locks locally.
1111 * \retval LDLM_FL_LOCAL_ONLY if there is no need for a CANCEL RPC to the server
1112 * \retval LDLM_FL_CANCELING otherwise;
1113 * \retval LDLM_FL_BL_AST if there is a need for a separate CANCEL RPC.
1115 static __u64 ldlm_cli_cancel_local(struct ldlm_lock *lock)
1117 __u64 rc = LDLM_FL_LOCAL_ONLY;
1120 if (lock->l_conn_export) {
1123 LDLM_DEBUG(lock, "client-side cancel");
1124 /* Set this flag to prevent others from getting new references*/
1125 lock_res_and_lock(lock);
1126 ldlm_set_cbpending(lock);
1127 local_only = !!(lock->l_flags &
1128 (LDLM_FL_LOCAL_ONLY|LDLM_FL_CANCEL_ON_BLOCK));
1129 ldlm_cancel_callback(lock);
1130 rc = (ldlm_is_bl_ast(lock)) ?
1131 LDLM_FL_BL_AST : LDLM_FL_CANCELING;
1132 unlock_res_and_lock(lock);
1135 CDEBUG(D_DLMTRACE, "not sending request (at caller's "
1137 rc = LDLM_FL_LOCAL_ONLY;
1139 ldlm_lock_cancel(lock);
1141 if (ns_is_client(ldlm_lock_to_ns(lock))) {
1142 LDLM_ERROR(lock, "Trying to cancel local lock");
1145 LDLM_DEBUG(lock, "server-side local cancel");
1146 ldlm_lock_cancel(lock);
1147 ldlm_reprocess_all(lock->l_resource);
1154 * Pack \a count locks in \a head into ldlm_request buffer of request \a req.
1156 static void ldlm_cancel_pack(struct ptlrpc_request *req,
1157 struct list_head *head, int count)
1159 struct ldlm_request *dlm;
1160 struct ldlm_lock *lock;
1161 int max, packed = 0;
1164 dlm = req_capsule_client_get(&req->rq_pill, &RMF_DLM_REQ);
1165 LASSERT(dlm != NULL);
1167 /* Check the room in the request buffer. */
1168 max = req_capsule_get_size(&req->rq_pill, &RMF_DLM_REQ, RCL_CLIENT) -
1169 sizeof(struct ldlm_request);
1170 max /= sizeof(struct lustre_handle);
1171 max += LDLM_LOCKREQ_HANDLES;
1172 LASSERT(max >= dlm->lock_count + count);
1174 /* XXX: it would be better to pack lock handles grouped by resource.
1175 * so that the server cancel would call filter_lvbo_update() less
1177 list_for_each_entry(lock, head, l_bl_ast) {
1180 LASSERT(lock->l_conn_export);
1181 /* Pack the lock handle to the given request buffer. */
1182 LDLM_DEBUG(lock, "packing");
1183 dlm->lock_handle[dlm->lock_count++] = lock->l_remote_handle;
1186 CDEBUG(D_DLMTRACE, "%d locks packed\n", packed);
1191 * Prepare and send a batched cancel RPC. It will include \a count lock
1192 * handles of locks given in \a cancels list. */
1193 int ldlm_cli_cancel_req(struct obd_export *exp, struct list_head *cancels,
1194 int count, enum ldlm_cancel_flags flags)
1196 struct ptlrpc_request *req = NULL;
1197 struct obd_import *imp;
1202 LASSERT(exp != NULL);
1205 CFS_FAIL_TIMEOUT(OBD_FAIL_LDLM_PAUSE_CANCEL, cfs_fail_val);
1207 if (CFS_FAIL_CHECK(OBD_FAIL_LDLM_CANCEL_RACE))
1210 free = ldlm_format_handles_avail(class_exp2cliimp(exp),
1211 &RQF_LDLM_CANCEL, RCL_CLIENT, 0);
1216 imp = class_exp2cliimp(exp);
1217 if (imp == NULL || imp->imp_invalid) {
1219 "skipping cancel on invalid import %p\n", imp);
1223 req = ptlrpc_request_alloc(imp, &RQF_LDLM_CANCEL);
1225 GOTO(out, rc = -ENOMEM);
1227 req_capsule_filled_sizes(&req->rq_pill, RCL_CLIENT);
1228 req_capsule_set_size(&req->rq_pill, &RMF_DLM_REQ, RCL_CLIENT,
1229 ldlm_request_bufsize(count, LDLM_CANCEL));
1231 rc = ptlrpc_request_pack(req, LUSTRE_DLM_VERSION, LDLM_CANCEL);
1233 ptlrpc_request_free(req);
1237 /* If OSP want cancel cross-MDT lock, let's not block it in
1238 * in recovery, otherwise the lock will not released, if
1239 * the remote target is also in recovery, and it also need
1240 * this lock, it might cause deadlock. */
1241 if (exp_connect_flags(exp) & OBD_CONNECT_MDS_MDS &&
1242 exp->exp_obd->obd_lu_dev != NULL &&
1243 exp->exp_obd->obd_lu_dev->ld_site != NULL) {
1244 struct lu_device *top_dev;
1246 top_dev = exp->exp_obd->obd_lu_dev->ld_site->ls_top_dev;
1247 if (top_dev != NULL &&
1248 top_dev->ld_obd->obd_recovering)
1249 req->rq_allow_replay = 1;
1252 req->rq_request_portal = LDLM_CANCEL_REQUEST_PORTAL;
1253 req->rq_reply_portal = LDLM_CANCEL_REPLY_PORTAL;
1254 ptlrpc_at_set_req_timeout(req);
1256 ldlm_cancel_pack(req, cancels, count);
1258 ptlrpc_request_set_replen(req);
1259 if (flags & LCF_ASYNC) {
1260 ptlrpcd_add_req(req);
1265 rc = ptlrpc_queue_wait(req);
1266 if (rc == LUSTRE_ESTALE) {
1267 CDEBUG(D_DLMTRACE, "client/server (nid %s) "
1268 "out of sync -- not fatal\n",
1269 libcfs_nid2str(req->rq_import->
1270 imp_connection->c_peer.nid));
1272 } else if (rc == -ETIMEDOUT && /* check there was no reconnect*/
1273 req->rq_import_generation == imp->imp_generation) {
1274 ptlrpc_req_finished(req);
1276 } else if (rc != ELDLM_OK) {
1277 /* -ESHUTDOWN is common on umount */
1278 CDEBUG_LIMIT(rc == -ESHUTDOWN ? D_DLMTRACE : D_ERROR,
1279 "Got rc %d from cancel RPC: "
1280 "canceling anyway\n", rc);
1287 ptlrpc_req_finished(req);
1290 return sent ? sent : rc;
1293 static inline struct ldlm_pool *ldlm_imp2pl(struct obd_import *imp)
1295 LASSERT(imp != NULL);
1296 return &imp->imp_obd->obd_namespace->ns_pool;
1300 * Update client's OBD pool related fields with new SLV and Limit from \a req.
1302 int ldlm_cli_update_pool(struct ptlrpc_request *req)
1304 struct obd_device *obd;
1308 if (unlikely(!req->rq_import || !req->rq_import->imp_obd ||
1309 !imp_connect_lru_resize(req->rq_import)))
1312 * Do nothing for corner cases.
1317 /* In some cases RPC may contain SLV and limit zeroed out. This
1318 * is the case when server does not support LRU resize feature.
1319 * This is also possible in some recovery cases when server-side
1320 * reqs have no reference to the OBD export and thus access to
1321 * server-side namespace is not possible. */
1322 if (lustre_msg_get_slv(req->rq_repmsg) == 0 ||
1323 lustre_msg_get_limit(req->rq_repmsg) == 0) {
1324 DEBUG_REQ(D_HA, req, "Zero SLV or Limit found "
1325 "(SLV: %llu, Limit: %u)",
1326 lustre_msg_get_slv(req->rq_repmsg),
1327 lustre_msg_get_limit(req->rq_repmsg));
1331 new_limit = lustre_msg_get_limit(req->rq_repmsg);
1332 new_slv = lustre_msg_get_slv(req->rq_repmsg);
1333 obd = req->rq_import->imp_obd;
1335 /* Set new SLV and limit in OBD fields to make them accessible
1336 * to the pool thread. We do not access obd_namespace and pool
1337 * directly here as there is no reliable way to make sure that
1338 * they are still alive at cleanup time. Evil races are possible
1339 * which may cause Oops at that time. */
1340 write_lock(&obd->obd_pool_lock);
1341 obd->obd_pool_slv = new_slv;
1342 obd->obd_pool_limit = new_limit;
1343 write_unlock(&obd->obd_pool_lock);
1349 * Client side lock cancel.
1351 * Lock must not have any readers or writers by this time.
1353 int ldlm_cli_cancel(const struct lustre_handle *lockh,
1354 enum ldlm_cancel_flags cancel_flags)
1356 struct obd_export *exp;
1357 enum ldlm_lru_flags lru_flags;
1358 int avail, count = 1;
1360 struct ldlm_namespace *ns;
1361 struct ldlm_lock *lock;
1362 struct list_head cancels = LIST_HEAD_INIT(cancels);
1365 lock = ldlm_handle2lock_long(lockh, 0);
1367 LDLM_DEBUG_NOLOCK("lock is already being destroyed");
1371 lock_res_and_lock(lock);
1372 /* Lock is being canceled and the caller doesn't want to wait */
1373 if (ldlm_is_canceling(lock) && (cancel_flags & LCF_ASYNC)) {
1374 unlock_res_and_lock(lock);
1375 LDLM_LOCK_RELEASE(lock);
1379 ldlm_set_canceling(lock);
1380 unlock_res_and_lock(lock);
1382 rc = ldlm_cli_cancel_local(lock);
1383 if (rc == LDLM_FL_LOCAL_ONLY || cancel_flags & LCF_LOCAL) {
1384 LDLM_LOCK_RELEASE(lock);
1387 /* Even if the lock is marked as LDLM_FL_BL_AST, this is a LDLM_CANCEL
1388 * RPC which goes to canceld portal, so we can cancel other LRU locks
1389 * here and send them all as one LDLM_CANCEL RPC. */
1390 LASSERT(list_empty(&lock->l_bl_ast));
1391 list_add(&lock->l_bl_ast, &cancels);
1393 exp = lock->l_conn_export;
1394 if (exp_connect_cancelset(exp)) {
1395 avail = ldlm_format_handles_avail(class_exp2cliimp(exp),
1400 ns = ldlm_lock_to_ns(lock);
1401 lru_flags = ns_connect_lru_resize(ns) ?
1402 LDLM_LRU_FLAG_LRUR : LDLM_LRU_FLAG_AGED;
1403 count += ldlm_cancel_lru_local(ns, &cancels, 0, avail - 1,
1404 LCF_BL_AST, lru_flags);
1406 ldlm_cli_cancel_list(&cancels, count, NULL, cancel_flags);
1409 EXPORT_SYMBOL(ldlm_cli_cancel);
1412 * Locally cancel up to \a count locks in list \a cancels.
1413 * Return the number of cancelled locks.
1415 int ldlm_cli_cancel_list_local(struct list_head *cancels, int count,
1416 enum ldlm_cancel_flags cancel_flags)
1418 struct list_head head = LIST_HEAD_INIT(head);
1419 struct ldlm_lock *lock, *next;
1420 int left = 0, bl_ast = 0;
1424 list_for_each_entry_safe(lock, next, cancels, l_bl_ast) {
1428 if (cancel_flags & LCF_LOCAL) {
1429 rc = LDLM_FL_LOCAL_ONLY;
1430 ldlm_lock_cancel(lock);
1432 rc = ldlm_cli_cancel_local(lock);
1434 /* Until we have compound requests and can send LDLM_CANCEL
1435 * requests batched with generic RPCs, we need to send cancels
1436 * with the LDLM_FL_BL_AST flag in a separate RPC from
1437 * the one being generated now. */
1438 if (!(cancel_flags & LCF_BL_AST) && (rc == LDLM_FL_BL_AST)) {
1439 LDLM_DEBUG(lock, "Cancel lock separately");
1440 list_del_init(&lock->l_bl_ast);
1441 list_add(&lock->l_bl_ast, &head);
1445 if (rc == LDLM_FL_LOCAL_ONLY) {
1446 /* CANCEL RPC should not be sent to server. */
1447 list_del_init(&lock->l_bl_ast);
1448 LDLM_LOCK_RELEASE(lock);
1454 ldlm_cli_cancel_list(&head, bl_ast, NULL, 0);
1461 * Cancel as many locks as possible w/o sending any RPCs (e.g. to write back
1462 * dirty data, to close a file, ...) or waiting for any RPCs in-flight (e.g.
1463 * readahead requests, ...)
1465 static enum ldlm_policy_res
1466 ldlm_cancel_no_wait_policy(struct ldlm_namespace *ns, struct ldlm_lock *lock,
1467 int unused, int added, int count)
1469 enum ldlm_policy_res result = LDLM_POLICY_CANCEL_LOCK;
1471 /* don't check added & count since we want to process all locks
1473 * It's fine to not take lock to access lock->l_resource since
1474 * the lock has already been granted so it won't change. */
1475 switch (lock->l_resource->lr_type) {
1478 if (ns->ns_cancel != NULL && ns->ns_cancel(lock) != 0)
1481 result = LDLM_POLICY_SKIP_LOCK;
1482 lock_res_and_lock(lock);
1483 ldlm_set_skipped(lock);
1484 unlock_res_and_lock(lock);
1492 * Callback function for LRU-resize policy. Decides whether to keep
1493 * \a lock in LRU for current \a LRU size \a unused, added in current
1494 * scan \a added and number of locks to be preferably canceled \a count.
1496 * \retval LDLM_POLICY_KEEP_LOCK keep lock in LRU in stop scanning
1498 * \retval LDLM_POLICY_CANCEL_LOCK cancel lock from LRU
1500 static enum ldlm_policy_res ldlm_cancel_lrur_policy(struct ldlm_namespace *ns,
1501 struct ldlm_lock *lock,
1502 int unused, int added,
1505 ktime_t cur = ktime_get();
1506 struct ldlm_pool *pl = &ns->ns_pool;
1510 /* Stop LRU processing when we reach past @count or have checked all
1512 if (count && added >= count)
1513 return LDLM_POLICY_KEEP_LOCK;
1515 /* Despite of the LV, It doesn't make sense to keep the lock which
1516 * is unused for ns_max_age time.
1518 if (ktime_after(ktime_get(),
1519 ktime_add(lock->l_last_used, ns->ns_max_age)))
1520 return LDLM_POLICY_CANCEL_LOCK;
1522 slv = ldlm_pool_get_slv(pl);
1523 lvf = ldlm_pool_get_lvf(pl);
1524 la = ktime_to_ns(ktime_sub(cur, lock->l_last_used)) / NSEC_PER_SEC;
1525 lv = lvf * la * unused;
1527 /* Inform pool about current CLV to see it via proc. */
1528 ldlm_pool_set_clv(pl, lv);
1530 /* Stop when SLV is not yet come from server or lv is smaller than
1532 if (slv == 0 || lv < slv)
1533 return LDLM_POLICY_KEEP_LOCK;
1535 return LDLM_POLICY_CANCEL_LOCK;
1538 static enum ldlm_policy_res
1539 ldlm_cancel_lrur_no_wait_policy(struct ldlm_namespace *ns,
1540 struct ldlm_lock *lock,
1541 int unused, int added,
1544 enum ldlm_policy_res result;
1546 result = ldlm_cancel_lrur_policy(ns, lock, unused, added, count);
1547 if (result == LDLM_POLICY_KEEP_LOCK)
1550 return ldlm_cancel_no_wait_policy(ns, lock, unused, added, count);
1554 * Callback function for proc used policy. Makes decision whether to keep
1555 * \a lock in LRU for current \a LRU size \a unused, added in current scan \a
1556 * added and number of locks to be preferably canceled \a count.
1558 * \retval LDLM_POLICY_KEEP_LOCK keep lock in LRU in stop scanning
1560 * \retval LDLM_POLICY_CANCEL_LOCK cancel lock from LRU
1562 static enum ldlm_policy_res ldlm_cancel_passed_policy(struct ldlm_namespace *ns,
1563 struct ldlm_lock *lock,
1564 int unused, int added,
1567 /* Stop LRU processing when we reach past @count or have checked all
1569 return (added >= count) ?
1570 LDLM_POLICY_KEEP_LOCK : LDLM_POLICY_CANCEL_LOCK;
1574 * Callback function for aged policy. Makes decision whether to keep \a lock in
1575 * LRU for current LRU size \a unused, added in current scan \a added and
1576 * number of locks to be preferably canceled \a count.
1578 * \retval LDLM_POLICY_KEEP_LOCK keep lock in LRU in stop scanning
1580 * \retval LDLM_POLICY_CANCEL_LOCK cancel lock from LRU
1582 static enum ldlm_policy_res ldlm_cancel_aged_policy(struct ldlm_namespace *ns,
1583 struct ldlm_lock *lock,
1584 int unused, int added,
1587 if ((added >= count) &&
1588 ktime_before(ktime_get(),
1589 ktime_add(lock->l_last_used, ns->ns_max_age)))
1590 return LDLM_POLICY_KEEP_LOCK;
1592 return LDLM_POLICY_CANCEL_LOCK;
1595 static enum ldlm_policy_res
1596 ldlm_cancel_aged_no_wait_policy(struct ldlm_namespace *ns,
1597 struct ldlm_lock *lock,
1598 int unused, int added, int count)
1600 enum ldlm_policy_res result;
1602 result = ldlm_cancel_aged_policy(ns, lock, unused, added, count);
1603 if (result == LDLM_POLICY_KEEP_LOCK)
1606 return ldlm_cancel_no_wait_policy(ns, lock, unused, added, count);
1610 * Callback function for default policy. Makes decision whether to keep \a lock
1611 * in LRU for current LRU size \a unused, added in current scan \a added and
1612 * number of locks to be preferably canceled \a count.
1614 * \retval LDLM_POLICY_KEEP_LOCK keep lock in LRU in stop scanning
1616 * \retval LDLM_POLICY_CANCEL_LOCK cancel lock from LRU
1619 enum ldlm_policy_res ldlm_cancel_default_policy(struct ldlm_namespace *ns,
1620 struct ldlm_lock *lock,
1621 int unused, int added,
1624 /* Stop LRU processing when we reach past count or have checked all
1626 return (added >= count) ?
1627 LDLM_POLICY_KEEP_LOCK : LDLM_POLICY_CANCEL_LOCK;
1630 typedef enum ldlm_policy_res
1631 (*ldlm_cancel_lru_policy_t)(struct ldlm_namespace *ns, struct ldlm_lock *lock,
1632 int unused, int added, int count);
1634 static ldlm_cancel_lru_policy_t
1635 ldlm_cancel_lru_policy(struct ldlm_namespace *ns, enum ldlm_lru_flags lru_flags)
1637 if (ns_connect_lru_resize(ns)) {
1638 if (lru_flags & LDLM_LRU_FLAG_SHRINK)
1639 /* We kill passed number of old locks. */
1640 return ldlm_cancel_passed_policy;
1641 if (lru_flags & LDLM_LRU_FLAG_LRUR) {
1642 if (lru_flags & LDLM_LRU_FLAG_NO_WAIT)
1643 return ldlm_cancel_lrur_no_wait_policy;
1645 return ldlm_cancel_lrur_policy;
1647 if (lru_flags & LDLM_LRU_FLAG_PASSED)
1648 return ldlm_cancel_passed_policy;
1650 if (lru_flags & LDLM_LRU_FLAG_AGED) {
1651 if (lru_flags & LDLM_LRU_FLAG_NO_WAIT)
1652 return ldlm_cancel_aged_no_wait_policy;
1654 return ldlm_cancel_aged_policy;
1657 if (lru_flags & LDLM_LRU_FLAG_NO_WAIT)
1658 return ldlm_cancel_no_wait_policy;
1660 return ldlm_cancel_default_policy;
1664 * - Free space in LRU for \a count new locks,
1665 * redundant unused locks are canceled locally;
1666 * - also cancel locally unused aged locks;
1667 * - do not cancel more than \a max locks;
1668 * - GET the found locks and add them into the \a cancels list.
1670 * A client lock can be added to the l_bl_ast list only when it is
1671 * marked LDLM_FL_CANCELING. Otherwise, somebody is already doing
1672 * CANCEL. There are the following use cases:
1673 * ldlm_cancel_resource_local(), ldlm_cancel_lru_local() and
1674 * ldlm_cli_cancel(), which check and set this flag properly. As any
1675 * attempt to cancel a lock rely on this flag, l_bl_ast list is accessed
1676 * later without any special locking.
1678 * Calling policies for enabled LRU resize:
1679 * ----------------------------------------
1680 * flags & LDLM_LRU_FLAG_LRUR - use LRU resize policy (SLV from server) to
1681 * cancel not more than \a count locks;
1683 * flags & LDLM_LRU_FLAG_PASSED - cancel \a count number of old locks (located
1684 * at the beginning of LRU list);
1686 * flags & LDLM_LRU_FLAG_SHRINK - cancel not more than \a count locks according
1687 * to memory pressre policy function;
1689 * flags & LDLM_LRU_FLAG_AGED - cancel \a count locks according to "aged policy"
1691 * flags & LDLM_LRU_FLAG_NO_WAIT - cancel as many unused locks as possible
1692 * (typically before replaying locks) w/o
1693 * sending any RPCs or waiting for any
1694 * outstanding RPC to complete.
1696 * flags & LDLM_CANCEL_CLEANUP - when cancelling read locks, do not check for
1697 * other read locks covering the same pages, just
1698 * discard those pages.
1700 static int ldlm_prepare_lru_list(struct ldlm_namespace *ns,
1701 struct list_head *cancels, int count, int max,
1702 enum ldlm_lru_flags lru_flags)
1704 ldlm_cancel_lru_policy_t pf;
1705 struct ldlm_lock *lock, *next;
1706 int added = 0, unused, remained;
1707 int no_wait = lru_flags & LDLM_LRU_FLAG_NO_WAIT;
1710 spin_lock(&ns->ns_lock);
1711 unused = ns->ns_nr_unused;
1714 if (!ns_connect_lru_resize(ns))
1715 count += unused - ns->ns_max_unused;
1717 pf = ldlm_cancel_lru_policy(ns, lru_flags);
1718 LASSERT(pf != NULL);
1720 while (!list_empty(&ns->ns_unused_list)) {
1721 enum ldlm_policy_res result;
1722 ktime_t last_use = ktime_set(0, 0);
1724 /* all unused locks */
1725 if (remained-- <= 0)
1728 /* For any flags, stop scanning if @max is reached. */
1729 if (max && added >= max)
1732 list_for_each_entry_safe(lock, next, &ns->ns_unused_list,
1734 /* No locks which got blocking requests. */
1735 LASSERT(!ldlm_is_bl_ast(lock));
1737 if (no_wait && ldlm_is_skipped(lock))
1738 /* already processed */
1741 last_use = lock->l_last_used;
1743 /* Somebody is already doing CANCEL. No need for this
1744 * lock in LRU, do not traverse it again. */
1745 if (!ldlm_is_canceling(lock))
1748 ldlm_lock_remove_from_lru_nolock(lock);
1750 if (&lock->l_lru == &ns->ns_unused_list)
1753 LDLM_LOCK_GET(lock);
1754 spin_unlock(&ns->ns_lock);
1755 lu_ref_add(&lock->l_reference, __FUNCTION__, current);
1757 /* Pass the lock through the policy filter and see if it
1758 * should stay in LRU.
1760 * Even for shrinker policy we stop scanning if
1761 * we find a lock that should stay in the cache.
1762 * We should take into account lock age anyway
1763 * as a new lock is a valuable resource even if
1764 * it has a low weight.
1766 * That is, for shrinker policy we drop only
1767 * old locks, but additionally choose them by
1768 * their weight. Big extent locks will stay in
1770 result = pf(ns, lock, unused, added, count);
1771 if (result == LDLM_POLICY_KEEP_LOCK) {
1772 lu_ref_del(&lock->l_reference,
1773 __FUNCTION__, current);
1774 LDLM_LOCK_RELEASE(lock);
1775 spin_lock(&ns->ns_lock);
1778 if (result == LDLM_POLICY_SKIP_LOCK) {
1779 lu_ref_del(&lock->l_reference,
1781 LDLM_LOCK_RELEASE(lock);
1782 spin_lock(&ns->ns_lock);
1786 lock_res_and_lock(lock);
1787 /* Check flags again under the lock. */
1788 if (ldlm_is_canceling(lock) ||
1789 ldlm_lock_remove_from_lru_check(lock, last_use) == 0) {
1790 /* Another thread is removing lock from LRU, or
1791 * somebody is already doing CANCEL, or there
1792 * is a blocking request which will send cancel
1793 * by itself, or the lock is no longer unused or
1794 * the lock has been used since the pf() call and
1795 * pages could be put under it. */
1796 unlock_res_and_lock(lock);
1797 lu_ref_del(&lock->l_reference, __FUNCTION__, current);
1798 LDLM_LOCK_RELEASE(lock);
1799 spin_lock(&ns->ns_lock);
1802 LASSERT(!lock->l_readers && !lock->l_writers);
1804 /* If we have chosen to cancel this lock voluntarily, we
1805 * better send cancel notification to server, so that it
1806 * frees appropriate state. This might lead to a race
1807 * where while we are doing cancel here, server is also
1808 * silently cancelling this lock. */
1809 ldlm_clear_cancel_on_block(lock);
1811 /* Setting the CBPENDING flag is a little misleading,
1812 * but prevents an important race; namely, once
1813 * CBPENDING is set, the lock can accumulate no more
1814 * readers/writers. Since readers and writers are
1815 * already zero here, ldlm_lock_decref() won't see
1816 * this flag and call l_blocking_ast */
1817 lock->l_flags |= LDLM_FL_CBPENDING | LDLM_FL_CANCELING;
1819 if ((lru_flags & LDLM_LRU_FLAG_CLEANUP) &&
1820 lock->l_resource->lr_type == LDLM_EXTENT &&
1821 lock->l_granted_mode == LCK_PR)
1822 ldlm_set_discard_data(lock);
1824 /* We can't re-add to l_lru as it confuses the
1825 * refcounting in ldlm_lock_remove_from_lru() if an AST
1826 * arrives after we drop lr_lock below. We use l_bl_ast
1827 * and can't use l_pending_chain as it is used both on
1828 * server and client nevertheless bug 5666 says it is
1829 * used only on server */
1830 LASSERT(list_empty(&lock->l_bl_ast));
1831 list_add(&lock->l_bl_ast, cancels);
1832 unlock_res_and_lock(lock);
1833 lu_ref_del(&lock->l_reference, __FUNCTION__, current);
1834 spin_lock(&ns->ns_lock);
1838 spin_unlock(&ns->ns_lock);
1842 int ldlm_cancel_lru_local(struct ldlm_namespace *ns, struct list_head *cancels,
1844 enum ldlm_cancel_flags cancel_flags,
1845 enum ldlm_lru_flags lru_flags)
1849 added = ldlm_prepare_lru_list(ns, cancels, count, max, lru_flags);
1853 return ldlm_cli_cancel_list_local(cancels, added, cancel_flags);
1857 * Cancel at least \a nr locks from given namespace LRU.
1859 * When called with LCF_ASYNC the blocking callback will be handled
1860 * in a thread and this function will return after the thread has been
1861 * asked to call the callback. When called with LCF_ASYNC the blocking
1862 * callback will be performed in this function.
1864 int ldlm_cancel_lru(struct ldlm_namespace *ns, int nr,
1865 enum ldlm_cancel_flags cancel_flags,
1866 enum ldlm_lru_flags lru_flags)
1868 struct list_head cancels = LIST_HEAD_INIT(cancels);
1872 /* Just prepare the list of locks, do not actually cancel them yet.
1873 * Locks are cancelled later in a separate thread. */
1874 count = ldlm_prepare_lru_list(ns, &cancels, nr, 0, lru_flags);
1875 rc = ldlm_bl_to_thread_list(ns, NULL, &cancels, count, cancel_flags);
1883 * Find and cancel locally unused locks found on resource, matched to the
1884 * given policy, mode. GET the found locks and add them into the \a cancels
1887 int ldlm_cancel_resource_local(struct ldlm_resource *res,
1888 struct list_head *cancels,
1889 union ldlm_policy_data *policy,
1890 enum ldlm_mode mode, __u64 lock_flags,
1891 enum ldlm_cancel_flags cancel_flags,
1894 struct ldlm_lock *lock;
1899 list_for_each_entry(lock, &res->lr_granted, l_res_link) {
1900 if (opaque != NULL && lock->l_ast_data != opaque) {
1901 LDLM_ERROR(lock, "data %p doesn't match opaque %p",
1902 lock->l_ast_data, opaque);
1907 if (lock->l_readers || lock->l_writers)
1910 /* If somebody is already doing CANCEL, or blocking AST came,
1911 * skip this lock. */
1912 if (ldlm_is_bl_ast(lock) || ldlm_is_canceling(lock))
1915 if (lockmode_compat(lock->l_granted_mode, mode))
1918 /* If policy is given and this is IBITS lock, add to list only
1919 * those locks that match by policy. */
1920 if (policy && (lock->l_resource->lr_type == LDLM_IBITS) &&
1921 !(lock->l_policy_data.l_inodebits.bits &
1922 policy->l_inodebits.bits))
1925 /* See CBPENDING comment in ldlm_cancel_lru */
1926 lock->l_flags |= LDLM_FL_CBPENDING | LDLM_FL_CANCELING |
1929 LASSERT(list_empty(&lock->l_bl_ast));
1930 list_add(&lock->l_bl_ast, cancels);
1931 LDLM_LOCK_GET(lock);
1936 RETURN(ldlm_cli_cancel_list_local(cancels, count, cancel_flags));
1938 EXPORT_SYMBOL(ldlm_cancel_resource_local);
1941 * Cancel client-side locks from a list and send/prepare cancel RPCs to the
1943 * If \a req is NULL, send CANCEL request to server with handles of locks
1944 * in the \a cancels. If EARLY_CANCEL is not supported, send CANCEL requests
1945 * separately per lock.
1946 * If \a req is not NULL, put handles of locks in \a cancels into the request
1947 * buffer at the offset \a off.
1948 * Destroy \a cancels at the end.
1950 int ldlm_cli_cancel_list(struct list_head *cancels, int count,
1951 struct ptlrpc_request *req,
1952 enum ldlm_cancel_flags flags)
1954 struct ldlm_lock *lock;
1958 if (list_empty(cancels) || count == 0)
1961 /* XXX: requests (both batched and not) could be sent in parallel.
1962 * Usually it is enough to have just 1 RPC, but it is possible that
1963 * there are too many locks to be cancelled in LRU or on a resource.
1964 * It would also speed up the case when the server does not support
1967 LASSERT(!list_empty(cancels));
1968 lock = list_entry(cancels->next, struct ldlm_lock,
1970 LASSERT(lock->l_conn_export);
1972 if (exp_connect_cancelset(lock->l_conn_export)) {
1975 ldlm_cancel_pack(req, cancels, count);
1977 res = ldlm_cli_cancel_req(lock->l_conn_export,
1981 res = ldlm_cli_cancel_req(lock->l_conn_export,
1986 CDEBUG_LIMIT(res == -ESHUTDOWN ? D_DLMTRACE : D_ERROR,
1987 "ldlm_cli_cancel_list: %d\n", res);
1992 ldlm_lock_list_put(cancels, l_bl_ast, res);
1994 LASSERT(count == 0);
1997 EXPORT_SYMBOL(ldlm_cli_cancel_list);
2000 * Cancel all locks on a resource that have 0 readers/writers.
2002 * If flags & LDLM_FL_LOCAL_ONLY, throw the locks away without trying
2003 * to notify the server. */
2004 int ldlm_cli_cancel_unused_resource(struct ldlm_namespace *ns,
2005 const struct ldlm_res_id *res_id,
2006 union ldlm_policy_data *policy,
2007 enum ldlm_mode mode,
2008 enum ldlm_cancel_flags flags, void *opaque)
2010 struct ldlm_resource *res;
2011 struct list_head cancels = LIST_HEAD_INIT(cancels);
2016 res = ldlm_resource_get(ns, NULL, res_id, 0, 0);
2018 /* This is not a problem. */
2019 CDEBUG(D_INFO, "No resource %llu\n", res_id->name[0]);
2023 LDLM_RESOURCE_ADDREF(res);
2024 count = ldlm_cancel_resource_local(res, &cancels, policy, mode,
2025 0, flags | LCF_BL_AST, opaque);
2026 rc = ldlm_cli_cancel_list(&cancels, count, NULL, flags);
2028 CERROR("canceling unused lock "DLDLMRES": rc = %d\n",
2031 LDLM_RESOURCE_DELREF(res);
2032 ldlm_resource_putref(res);
2035 EXPORT_SYMBOL(ldlm_cli_cancel_unused_resource);
2037 struct ldlm_cli_cancel_arg {
2043 ldlm_cli_hash_cancel_unused(struct cfs_hash *hs, struct cfs_hash_bd *bd,
2044 struct hlist_node *hnode, void *arg)
2046 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
2047 struct ldlm_cli_cancel_arg *lc = arg;
2049 ldlm_cli_cancel_unused_resource(ldlm_res_to_ns(res), &res->lr_name,
2050 NULL, LCK_MINMODE, lc->lc_flags,
2052 /* must return 0 for hash iteration */
2057 * Cancel all locks on a namespace (or a specific resource, if given)
2058 * that have 0 readers/writers.
2060 * If flags & LCF_LOCAL, throw the locks away without trying
2061 * to notify the server. */
2062 int ldlm_cli_cancel_unused(struct ldlm_namespace *ns,
2063 const struct ldlm_res_id *res_id,
2064 enum ldlm_cancel_flags flags, void *opaque)
2066 struct ldlm_cli_cancel_arg arg = {
2068 .lc_opaque = opaque,
2076 if (res_id != NULL) {
2077 RETURN(ldlm_cli_cancel_unused_resource(ns, res_id, NULL,
2081 cfs_hash_for_each_nolock(ns->ns_rs_hash,
2082 ldlm_cli_hash_cancel_unused, &arg, 0);
2087 /* Lock iterators. */
2089 int ldlm_resource_foreach(struct ldlm_resource *res, ldlm_iterator_t iter,
2092 struct list_head *tmp, *next;
2093 struct ldlm_lock *lock;
2094 int rc = LDLM_ITER_CONTINUE;
2099 RETURN(LDLM_ITER_CONTINUE);
2102 list_for_each_safe(tmp, next, &res->lr_granted) {
2103 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
2105 if (iter(lock, closure) == LDLM_ITER_STOP)
2106 GOTO(out, rc = LDLM_ITER_STOP);
2109 list_for_each_safe(tmp, next, &res->lr_converting) {
2110 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
2112 if (iter(lock, closure) == LDLM_ITER_STOP)
2113 GOTO(out, rc = LDLM_ITER_STOP);
2116 list_for_each_safe(tmp, next, &res->lr_waiting) {
2117 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
2119 if (iter(lock, closure) == LDLM_ITER_STOP)
2120 GOTO(out, rc = LDLM_ITER_STOP);
2127 struct iter_helper_data {
2128 ldlm_iterator_t iter;
2132 static int ldlm_iter_helper(struct ldlm_lock *lock, void *closure)
2134 struct iter_helper_data *helper = closure;
2135 return helper->iter(lock, helper->closure);
2138 static int ldlm_res_iter_helper(struct cfs_hash *hs, struct cfs_hash_bd *bd,
2139 struct hlist_node *hnode, void *arg)
2142 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
2144 return ldlm_resource_foreach(res, ldlm_iter_helper, arg) ==
2148 void ldlm_namespace_foreach(struct ldlm_namespace *ns,
2149 ldlm_iterator_t iter, void *closure)
2152 struct iter_helper_data helper = { .iter = iter, .closure = closure };
2154 cfs_hash_for_each_nolock(ns->ns_rs_hash,
2155 ldlm_res_iter_helper, &helper, 0);
2159 /* non-blocking function to manipulate a lock whose cb_data is being put away.
2160 * return 0: find no resource
2161 * > 0: must be LDLM_ITER_STOP/LDLM_ITER_CONTINUE.
2164 int ldlm_resource_iterate(struct ldlm_namespace *ns,
2165 const struct ldlm_res_id *res_id,
2166 ldlm_iterator_t iter, void *data)
2168 struct ldlm_resource *res;
2172 LASSERTF(ns != NULL, "must pass in namespace\n");
2174 res = ldlm_resource_get(ns, NULL, res_id, 0, 0);
2178 LDLM_RESOURCE_ADDREF(res);
2179 rc = ldlm_resource_foreach(res, iter, data);
2180 LDLM_RESOURCE_DELREF(res);
2181 ldlm_resource_putref(res);
2184 EXPORT_SYMBOL(ldlm_resource_iterate);
2188 static int ldlm_chain_lock_for_replay(struct ldlm_lock *lock, void *closure)
2190 struct list_head *list = closure;
2192 /* we use l_pending_chain here, because it's unused on clients. */
2193 LASSERTF(list_empty(&lock->l_pending_chain),
2194 "lock %p next %p prev %p\n",
2195 lock, &lock->l_pending_chain.next,&lock->l_pending_chain.prev);
2196 /* bug 9573: don't replay locks left after eviction, or
2197 * bug 17614: locks being actively cancelled. Get a reference
2198 * on a lock so that it does not disapear under us (e.g. due to cancel)
2200 if (!(lock->l_flags & (LDLM_FL_FAILED|LDLM_FL_BL_DONE))) {
2201 list_add(&lock->l_pending_chain, list);
2202 LDLM_LOCK_GET(lock);
2205 return LDLM_ITER_CONTINUE;
2208 static int replay_lock_interpret(const struct lu_env *env,
2209 struct ptlrpc_request *req,
2210 struct ldlm_async_args *aa, int rc)
2212 struct ldlm_lock *lock;
2213 struct ldlm_reply *reply;
2214 struct obd_export *exp;
2217 atomic_dec(&req->rq_import->imp_replay_inflight);
2221 reply = req_capsule_server_get(&req->rq_pill, &RMF_DLM_REP);
2223 GOTO(out, rc = -EPROTO);
2225 lock = ldlm_handle2lock(&aa->lock_handle);
2227 CERROR("received replay ack for unknown local cookie %#llx"
2228 " remote cookie %#llx from server %s id %s\n",
2229 aa->lock_handle.cookie, reply->lock_handle.cookie,
2230 req->rq_export->exp_client_uuid.uuid,
2231 libcfs_id2str(req->rq_peer));
2232 GOTO(out, rc = -ESTALE);
2235 /* Key change rehash lock in per-export hash with new key */
2236 exp = req->rq_export;
2237 if (exp && exp->exp_lock_hash) {
2238 /* In the function below, .hs_keycmp resolves to
2239 * ldlm_export_lock_keycmp() */
2240 /* coverity[overrun-buffer-val] */
2241 cfs_hash_rehash_key(exp->exp_lock_hash,
2242 &lock->l_remote_handle,
2243 &reply->lock_handle,
2246 lock->l_remote_handle = reply->lock_handle;
2249 LDLM_DEBUG(lock, "replayed lock:");
2250 ptlrpc_import_recovery_state_machine(req->rq_import);
2251 LDLM_LOCK_PUT(lock);
2254 ptlrpc_connect_import(req->rq_import);
2259 static int replay_one_lock(struct obd_import *imp, struct ldlm_lock *lock)
2261 struct ptlrpc_request *req;
2262 struct ldlm_async_args *aa;
2263 struct ldlm_request *body;
2268 /* Bug 11974: Do not replay a lock which is actively being canceled */
2269 if (ldlm_is_bl_done(lock)) {
2270 LDLM_DEBUG(lock, "Not replaying canceled lock:");
2274 /* If this is reply-less callback lock, we cannot replay it, since
2275 * server might have long dropped it, but notification of that event was
2276 * lost by network. (and server granted conflicting lock already) */
2277 if (ldlm_is_cancel_on_block(lock)) {
2278 LDLM_DEBUG(lock, "Not replaying reply-less lock:");
2279 ldlm_lock_cancel(lock);
2284 * If granted mode matches the requested mode, this lock is granted.
2286 * If they differ, but we have a granted mode, then we were granted
2287 * one mode and now want another: ergo, converting.
2289 * If we haven't been granted anything and are on a resource list,
2290 * then we're blocked/waiting.
2292 * If we haven't been granted anything and we're NOT on a resource list,
2293 * then we haven't got a reply yet and don't have a known disposition.
2294 * This happens whenever a lock enqueue is the request that triggers
2297 if (lock->l_granted_mode == lock->l_req_mode)
2298 flags = LDLM_FL_REPLAY | LDLM_FL_BLOCK_GRANTED;
2299 else if (lock->l_granted_mode)
2300 flags = LDLM_FL_REPLAY | LDLM_FL_BLOCK_CONV;
2301 else if (!list_empty(&lock->l_res_link))
2302 flags = LDLM_FL_REPLAY | LDLM_FL_BLOCK_WAIT;
2304 flags = LDLM_FL_REPLAY;
2306 req = ptlrpc_request_alloc_pack(imp, &RQF_LDLM_ENQUEUE,
2307 LUSTRE_DLM_VERSION, LDLM_ENQUEUE);
2311 /* We're part of recovery, so don't wait for it. */
2312 req->rq_send_state = LUSTRE_IMP_REPLAY_LOCKS;
2314 body = req_capsule_client_get(&req->rq_pill, &RMF_DLM_REQ);
2315 ldlm_lock2desc(lock, &body->lock_desc);
2316 body->lock_flags = ldlm_flags_to_wire(flags);
2318 ldlm_lock2handle(lock, &body->lock_handle[0]);
2319 if (lock->l_lvb_len > 0)
2320 req_capsule_extend(&req->rq_pill, &RQF_LDLM_ENQUEUE_LVB);
2321 req_capsule_set_size(&req->rq_pill, &RMF_DLM_LVB, RCL_SERVER,
2323 ptlrpc_request_set_replen(req);
2324 /* notify the server we've replayed all requests.
2325 * also, we mark the request to be put on a dedicated
2326 * queue to be processed after all request replayes.
2328 lustre_msg_set_flags(req->rq_reqmsg, MSG_REQ_REPLAY_DONE);
2330 LDLM_DEBUG(lock, "replaying lock:");
2332 atomic_inc(&req->rq_import->imp_replay_inflight);
2333 CLASSERT(sizeof(*aa) <= sizeof(req->rq_async_args));
2334 aa = ptlrpc_req_async_args(req);
2335 aa->lock_handle = body->lock_handle[0];
2336 req->rq_interpret_reply = (ptlrpc_interpterer_t)replay_lock_interpret;
2337 ptlrpcd_add_req(req);
2343 * Cancel as many unused locks as possible before replay. since we are
2344 * in recovery, we can't wait for any outstanding RPCs to send any RPC
2347 * Called only in recovery before replaying locks. there is no need to
2348 * replay locks that are unused. since the clients may hold thousands of
2349 * cached unused locks, dropping the unused locks can greatly reduce the
2350 * load on the servers at recovery time.
2352 static void ldlm_cancel_unused_locks_for_replay(struct ldlm_namespace *ns)
2355 struct list_head cancels = LIST_HEAD_INIT(cancels);
2357 CDEBUG(D_DLMTRACE, "Dropping as many unused locks as possible before"
2358 "replay for namespace %s (%d)\n",
2359 ldlm_ns_name(ns), ns->ns_nr_unused);
2361 /* We don't need to care whether or not LRU resize is enabled
2362 * because the LDLM_LRU_FLAG_NO_WAIT policy doesn't use the
2363 * count parameter */
2364 canceled = ldlm_cancel_lru_local(ns, &cancels, ns->ns_nr_unused, 0,
2365 LCF_LOCAL, LDLM_LRU_FLAG_NO_WAIT);
2367 CDEBUG(D_DLMTRACE, "Canceled %d unused locks from namespace %s\n",
2368 canceled, ldlm_ns_name(ns));
2371 int ldlm_replay_locks(struct obd_import *imp)
2373 struct ldlm_namespace *ns = imp->imp_obd->obd_namespace;
2374 struct list_head list = LIST_HEAD_INIT(list);
2375 struct ldlm_lock *lock, *next;
2380 LASSERT(atomic_read(&imp->imp_replay_inflight) == 0);
2382 /* don't replay locks if import failed recovery */
2383 if (imp->imp_vbr_failed)
2386 /* ensure this doesn't fall to 0 before all have been queued */
2387 atomic_inc(&imp->imp_replay_inflight);
2389 if (ldlm_cancel_unused_locks_before_replay)
2390 ldlm_cancel_unused_locks_for_replay(ns);
2392 ldlm_namespace_foreach(ns, ldlm_chain_lock_for_replay, &list);
2394 list_for_each_entry_safe(lock, next, &list, l_pending_chain) {
2395 list_del_init(&lock->l_pending_chain);
2397 LDLM_LOCK_RELEASE(lock);
2398 continue; /* or try to do the rest? */
2400 rc = replay_one_lock(imp, lock);
2401 LDLM_LOCK_RELEASE(lock);
2404 atomic_dec(&imp->imp_replay_inflight);