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, 2017, 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
99 int ldlm_request_bufsize(int count, int type)
101 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;
126 "lock timed out (enqueued at %lld, %llds ago); not entering recovery in server code, just going back to sleep",
127 (s64)lock->l_activity,
128 (s64)(ktime_get_real_seconds() -
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);
145 "lock timed out (enqueued at %lld, %llds ago), entering recovery for %s@%s",
146 (s64)lock->l_activity,
147 (s64)(ktime_get_real_seconds() - lock->l_activity),
148 obd2cli_tgt(obd), imp->imp_connection->c_remote_uuid.uuid);
153 int is_granted_or_cancelled_nolock(struct ldlm_lock *lock)
157 check_res_locked(lock->l_resource);
158 if (ldlm_is_granted(lock) && !ldlm_is_cp_reqd(lock))
160 else if (ldlm_is_failed(lock) || ldlm_is_cancel(lock))
164 EXPORT_SYMBOL(is_granted_or_cancelled_nolock);
167 * Calculate the Completion timeout (covering enqueue, BL AST, data flush,
168 * lock cancel, and their replies). Used for lock completion timeout on the
171 * \param[in] lock lock which is waiting the completion callback
173 * \retval timeout in seconds to wait for the server reply
176 * We use the same basis for both server side and client side functions
177 * from a single node.
179 static time64_t ldlm_cp_timeout(struct ldlm_lock *lock)
187 * Wait a long time for enqueue - server may have to callback a
188 * lock from another client. Server will evict the other client if it
189 * doesn't respond reasonably, and then give us the lock.
191 timeout = at_get(ldlm_lock_to_ns_at(lock));
192 return max(3 * timeout, (time64_t) ldlm_enqueue_min);
196 * Helper function for ldlm_completion_ast(), updating timings when lock is
199 static int ldlm_completion_tail(struct ldlm_lock *lock, void *data)
204 if (ldlm_is_destroyed(lock) || ldlm_is_failed(lock)) {
205 LDLM_DEBUG(lock, "client-side enqueue: destroyed");
207 } else if (data == NULL) {
208 LDLM_DEBUG(lock, "client-side enqueue: granted");
210 /* Take into AT only CP RPC, not immediately granted locks */
211 delay = ktime_get_real_seconds() - lock->l_activity;
212 LDLM_DEBUG(lock, "client-side enqueue: granted after %llds",
215 /* Update our time estimate */
216 at_measured(ldlm_lock_to_ns_at(lock), delay);
222 * Implementation of ->l_completion_ast() for a client, that doesn't wait
223 * until lock is granted. Suitable for locks enqueued through ptlrpcd, of
224 * other threads that cannot block for long.
226 int ldlm_completion_ast_async(struct ldlm_lock *lock, __u64 flags, void *data)
230 if (flags == LDLM_FL_WAIT_NOREPROC) {
231 LDLM_DEBUG(lock, "client-side enqueue waiting on pending lock");
235 if (!(flags & LDLM_FL_BLOCKED_MASK)) {
236 wake_up(&lock->l_waitq);
237 RETURN(ldlm_completion_tail(lock, data));
241 "client-side enqueue returned a blocked lock, going forward");
242 ldlm_reprocess_all(lock->l_resource);
245 EXPORT_SYMBOL(ldlm_completion_ast_async);
248 * Generic LDLM "completion" AST. This is called in several cases:
250 * - when a reply to an ENQUEUE RPC is received from the server
251 * (ldlm_cli_enqueue_fini()). Lock might be granted or not granted at
252 * this point (determined by flags);
254 * - when LDLM_CP_CALLBACK RPC comes to client to notify it that lock has
257 * - when ldlm_lock_match(LDLM_FL_LVB_READY) is about to wait until lock
260 * - to force all locks when resource is destroyed (cleanup_resource());
262 * If lock is not granted in the first case, this function waits until second
263 * or penultimate cases happen in some other thread.
266 int ldlm_completion_ast(struct ldlm_lock *lock, __u64 flags, void *data)
268 /* XXX ALLOCATE - 160 bytes */
269 struct lock_wait_data lwd;
270 struct obd_device *obd;
271 struct obd_import *imp = NULL;
272 struct l_wait_info lwi;
278 if (flags == LDLM_FL_WAIT_NOREPROC) {
279 LDLM_DEBUG(lock, "client-side enqueue waiting on pending lock");
283 if (!(flags & LDLM_FL_BLOCKED_MASK)) {
284 wake_up(&lock->l_waitq);
288 LDLM_DEBUG(lock, "client-side enqueue returned a blocked locksleeping");
292 obd = class_exp2obd(lock->l_conn_export);
294 /* if this is a local lock, then there is no import */
296 imp = obd->u.cli.cl_import;
298 timeout = ldlm_cp_timeout(lock);
301 lock->l_activity = ktime_get_real_seconds();
303 if (ldlm_is_no_timeout(lock)) {
304 LDLM_DEBUG(lock, "waiting indefinitely because of NO_TIMEOUT");
305 lwi = LWI_INTR(interrupted_completion_wait, &lwd);
307 lwi = LWI_TIMEOUT_INTR(cfs_time_seconds(timeout),
308 ldlm_expired_completion_wait,
309 interrupted_completion_wait, &lwd);
313 spin_lock(&imp->imp_lock);
314 lwd.lwd_conn_cnt = imp->imp_conn_cnt;
315 spin_unlock(&imp->imp_lock);
318 if (ns_is_client(ldlm_lock_to_ns(lock)) &&
319 OBD_FAIL_CHECK_RESET(OBD_FAIL_LDLM_INTR_CP_AST,
320 OBD_FAIL_LDLM_CP_BL_RACE | OBD_FAIL_ONCE)) {
321 ldlm_set_fail_loc(lock);
324 /* Go to sleep until the lock is granted or cancelled. */
325 rc = l_wait_event(lock->l_waitq,
326 is_granted_or_cancelled(lock), &lwi);
330 LDLM_DEBUG(lock, "client-side enqueue waking up: failed (%d)",
335 RETURN(ldlm_completion_tail(lock, data));
337 EXPORT_SYMBOL(ldlm_completion_ast);
340 * A helper to build a blocking AST function
342 * Perform a common operation for blocking ASTs:
343 * defferred lock cancellation.
345 * \param lock the lock blocking or canceling AST was called on
347 * \see mdt_blocking_ast
348 * \see ldlm_blocking_ast
350 int ldlm_blocking_ast_nocheck(struct ldlm_lock *lock)
356 ldlm_set_cbpending(lock);
357 do_ast = (!lock->l_readers && !lock->l_writers);
358 unlock_res_and_lock(lock);
361 struct lustre_handle lockh;
364 LDLM_DEBUG(lock, "already unused, calling ldlm_cli_cancel");
365 ldlm_lock2handle(lock, &lockh);
366 rc = ldlm_cli_cancel(&lockh, LCF_ASYNC);
368 CERROR("ldlm_cli_cancel: %d\n", rc);
371 "Lock still has references, will be cancelled later");
375 EXPORT_SYMBOL(ldlm_blocking_ast_nocheck);
378 * Server blocking AST
380 * ->l_blocking_ast() callback for LDLM locks acquired by server-side
383 * \param lock the lock which blocks a request or cancelling lock
386 * \param flag indicates whether this cancelling or blocking callback
388 * \see ldlm_blocking_ast_nocheck
390 int ldlm_blocking_ast(struct ldlm_lock *lock, struct ldlm_lock_desc *desc,
391 void *data, int flag)
395 if (flag == LDLM_CB_CANCELING) {
396 /* Don't need to do anything here. */
400 lock_res_and_lock(lock);
402 * Get this: if ldlm_blocking_ast is racing with intent_policy, such
403 * that ldlm_blocking_ast is called just before intent_policy method
404 * takes the lr_lock, then by the time we get the lock, we might not
405 * be the correct blocking function anymore. So check, and return
408 if (lock->l_blocking_ast != ldlm_blocking_ast) {
409 unlock_res_and_lock(lock);
412 RETURN(ldlm_blocking_ast_nocheck(lock));
414 EXPORT_SYMBOL(ldlm_blocking_ast);
417 * Implements ldlm_lock::l_glimpse_ast for extent locks acquired on the server.
419 * Returning -ELDLM_NO_LOCK_DATA actually works, but the reason for that is
420 * rather subtle: with OST-side locking, it may so happen that _all_ extent
421 * locks are held by the OST. If client wants to obtain the current file size
422 * it calls ll_glimpse_size(), and (as all locks are held only on the server),
423 * this dummy glimpse callback fires and does nothing. The client still
424 * receives the correct file size due to the following fragment of code in
425 * ldlm_cb_interpret():
427 * if (rc == -ELDLM_NO_LOCK_DATA) {
428 * LDLM_DEBUG(lock, "lost race - client has a lock but no"
430 * ldlm_res_lvbo_update(lock->l_resource, NULL, 1);
433 * That is, after the glimpse returns this error, ofd_lvbo_update() is called
434 * and returns the updated file attributes from the inode to the client.
436 * See also comment in ofd_intent_policy() on why servers must set a non-NULL
437 * l_glimpse_ast when grabbing DLM locks. Otherwise, the server will assume
438 * that the object is in the process of being destroyed.
440 * \param[in] lock DLM lock being glimpsed, unused
441 * \param[in] reqp pointer to ptlrpc_request, unused
443 * \retval -ELDLM_NO_LOCK_DATA to get attributes from disk object
445 int ldlm_glimpse_ast(struct ldlm_lock *lock, void *reqp)
447 return -ELDLM_NO_LOCK_DATA;
451 * Enqueue a local lock (typically on a server).
453 int ldlm_cli_enqueue_local(const struct lu_env *env,
454 struct ldlm_namespace *ns,
455 const struct ldlm_res_id *res_id,
456 enum ldlm_type type, union ldlm_policy_data *policy,
457 enum ldlm_mode mode, __u64 *flags,
458 ldlm_blocking_callback blocking,
459 ldlm_completion_callback completion,
460 ldlm_glimpse_callback glimpse,
461 void *data, __u32 lvb_len, enum lvb_type lvb_type,
462 const __u64 *client_cookie,
463 struct lustre_handle *lockh)
465 struct ldlm_lock *lock;
467 const struct ldlm_callback_suite cbs = { .lcs_completion = completion,
468 .lcs_blocking = blocking,
469 .lcs_glimpse = glimpse,
474 LASSERT(!(*flags & LDLM_FL_REPLAY));
475 if (unlikely(ns_is_client(ns))) {
476 CERROR("Trying to enqueue local lock in a shadow namespace\n");
480 lock = ldlm_lock_create(ns, res_id, type, mode, &cbs, data, lvb_len,
483 GOTO(out_nolock, err = PTR_ERR(lock));
485 err = ldlm_lvbo_init(lock->l_resource);
487 LDLM_ERROR(lock, "delayed lvb init failed (rc %d)", err);
488 ldlm_lock_destroy_nolock(lock);
492 ldlm_lock2handle(lock, lockh);
495 * NB: we don't have any lock now (lock_res_and_lock)
496 * because it's a new lock
498 ldlm_lock_addref_internal_nolock(lock, mode);
499 ldlm_set_local(lock);
500 if (*flags & LDLM_FL_ATOMIC_CB)
501 ldlm_set_atomic_cb(lock);
503 if (*flags & LDLM_FL_CANCEL_ON_BLOCK)
504 ldlm_set_cancel_on_block(lock);
507 lock->l_policy_data = *policy;
508 if (client_cookie != NULL)
509 lock->l_client_cookie = *client_cookie;
510 if (type == LDLM_EXTENT) {
511 /* extent lock without policy is a bug */
515 lock->l_req_extent = policy->l_extent;
518 err = ldlm_lock_enqueue(env, ns, &lock, policy, flags);
519 if (unlikely(err != ELDLM_OK))
523 *policy = lock->l_policy_data;
525 if (lock->l_completion_ast)
526 lock->l_completion_ast(lock, *flags, NULL);
528 LDLM_DEBUG(lock, "client-side local enqueue handler, new lock created");
531 LDLM_LOCK_RELEASE(lock);
535 EXPORT_SYMBOL(ldlm_cli_enqueue_local);
537 static void failed_lock_cleanup(struct ldlm_namespace *ns,
538 struct ldlm_lock *lock, int mode)
542 /* Set a flag to prevent us from sending a CANCEL (b=407) */
543 lock_res_and_lock(lock);
544 /* Check that lock is not granted or failed, we might race. */
545 if (!ldlm_is_granted(lock) && !ldlm_is_failed(lock)) {
547 * Make sure that this lock will not be found by raced
548 * bl_ast and -EINVAL reply is sent to server anyways.
551 lock->l_flags |= LDLM_FL_LOCAL_ONLY | LDLM_FL_FAILED |
552 LDLM_FL_ATOMIC_CB | LDLM_FL_CBPENDING;
555 unlock_res_and_lock(lock);
559 "setting FL_LOCAL_ONLY | LDLM_FL_FAILED | LDLM_FL_ATOMIC_CB | LDLM_FL_CBPENDING");
561 LDLM_DEBUG(lock, "lock was granted or failed in race");
564 * XXX - HACK because we shouldn't call ldlm_lock_destroy()
565 * from llite/file.c/ll_file_flock().
568 * This code makes for the fact that we do not have blocking handler on
569 * a client for flock locks. As such this is the place where we must
570 * completely kill failed locks. (interrupted and those that
571 * were waiting to be granted when server evicted us.
573 if (lock->l_resource->lr_type == LDLM_FLOCK) {
574 lock_res_and_lock(lock);
575 if (!ldlm_is_destroyed(lock)) {
576 ldlm_resource_unlink_lock(lock);
577 ldlm_lock_decref_internal_nolock(lock, mode);
578 ldlm_lock_destroy_nolock(lock);
580 unlock_res_and_lock(lock);
582 ldlm_lock_decref_internal(lock, mode);
587 * Finishing portion of client lock enqueue code.
589 * Called after receiving reply from server.
591 int ldlm_cli_enqueue_fini(struct obd_export *exp, struct ptlrpc_request *req,
592 enum ldlm_type type, __u8 with_policy,
593 enum ldlm_mode mode, __u64 *flags, void *lvb,
594 __u32 lvb_len, const struct lustre_handle *lockh,
597 struct ldlm_namespace *ns = exp->exp_obd->obd_namespace;
598 const struct lu_env *env = NULL;
599 int is_replay = *flags & LDLM_FL_REPLAY;
600 struct ldlm_lock *lock;
601 struct ldlm_reply *reply;
602 int cleanup_phase = 1;
606 if (req && req->rq_svc_thread)
607 env = req->rq_svc_thread->t_env;
609 lock = ldlm_handle2lock(lockh);
610 /* ldlm_cli_enqueue is holding a reference on this lock. */
612 LASSERT(type == LDLM_FLOCK);
616 LASSERTF(ergo(lvb_len != 0, lvb_len == lock->l_lvb_len),
617 "lvb_len = %d, l_lvb_len = %d\n", lvb_len, lock->l_lvb_len);
619 if (rc != ELDLM_OK) {
621 LDLM_DEBUG(lock, "client-side enqueue END (%s)",
622 rc == ELDLM_LOCK_ABORTED ? "ABORTED" : "FAILED");
624 if (rc != ELDLM_LOCK_ABORTED)
628 /* Before we return, swab the reply */
629 reply = req_capsule_server_get(&req->rq_pill, &RMF_DLM_REP);
631 GOTO(cleanup, rc = -EPROTO);
636 size = req_capsule_get_size(&req->rq_pill, &RMF_DLM_LVB,
639 LDLM_ERROR(lock, "Fail to get lvb_len, rc = %d", size);
640 GOTO(cleanup, rc = size);
641 } else if (unlikely(size > lvb_len)) {
643 "Replied LVB is larger than expectation, expected = %d, replied = %d",
645 GOTO(cleanup, rc = -EINVAL);
650 if (rc == ELDLM_LOCK_ABORTED) {
651 if (lvb_len > 0 && lvb != NULL)
652 rc = ldlm_fill_lvb(lock, &req->rq_pill, RCL_SERVER,
654 GOTO(cleanup, rc = rc ? : ELDLM_LOCK_ABORTED);
657 /* lock enqueued on the server */
660 lock_res_and_lock(lock);
661 /* Key change rehash lock in per-export hash with new key */
662 if (exp->exp_lock_hash) {
664 * In the function below, .hs_keycmp resolves to
665 * ldlm_export_lock_keycmp()
667 /* coverity[overrun-buffer-val] */
668 cfs_hash_rehash_key(exp->exp_lock_hash,
669 &lock->l_remote_handle,
673 lock->l_remote_handle = reply->lock_handle;
676 *flags = ldlm_flags_from_wire(reply->lock_flags);
677 lock->l_flags |= ldlm_flags_from_wire(reply->lock_flags &
678 LDLM_FL_INHERIT_MASK);
679 unlock_res_and_lock(lock);
681 CDEBUG(D_INFO, "local: %p, remote cookie: %#llx, flags: %#llx\n",
682 lock, reply->lock_handle.cookie, *flags);
685 * If enqueue returned a blocked lock but the completion handler has
686 * already run, then it fixed up the resource and we don't need to do it
689 if ((*flags) & LDLM_FL_LOCK_CHANGED) {
690 int newmode = reply->lock_desc.l_req_mode;
693 if (newmode && newmode != lock->l_req_mode) {
694 LDLM_DEBUG(lock, "server returned different mode %s",
695 ldlm_lockname[newmode]);
696 lock->l_req_mode = newmode;
699 if (!ldlm_res_eq(&reply->lock_desc.l_resource.lr_name,
700 &lock->l_resource->lr_name)) {
702 "remote intent success, locking "DLDLMRES", instead of "DLDLMRES"\n",
703 PLDLMRES(&reply->lock_desc.l_resource),
704 PLDLMRES(lock->l_resource));
706 rc = ldlm_lock_change_resource(ns, lock,
707 &reply->lock_desc.l_resource.lr_name);
708 if (rc || lock->l_resource == NULL)
709 GOTO(cleanup, rc = -ENOMEM);
710 LDLM_DEBUG(lock, "client-side enqueue, new resource");
714 /* We assume lock type cannot change on server*/
715 ldlm_convert_policy_to_local(exp,
716 lock->l_resource->lr_type,
717 &reply->lock_desc.l_policy_data,
718 &lock->l_policy_data);
721 if (type != LDLM_PLAIN)
723 "client-side enqueue, new policy data");
726 if ((*flags) & LDLM_FL_AST_SENT) {
727 lock_res_and_lock(lock);
728 lock->l_flags |= LDLM_FL_CBPENDING | LDLM_FL_BL_AST;
729 unlock_res_and_lock(lock);
730 LDLM_DEBUG(lock, "enqueue reply includes blocking AST");
734 * If the lock has already been granted by a completion AST, don't
735 * clobber the LVB with an older one.
739 * We must lock or a racing completion might update lvb without
740 * letting us know and we'll clobber the correct value.
741 * Cannot unlock after the check either, a that still leaves
742 * a tiny window for completion to get in
744 lock_res_and_lock(lock);
745 if (!ldlm_is_granted(lock))
746 rc = ldlm_fill_lvb(lock, &req->rq_pill, RCL_SERVER,
747 lock->l_lvb_data, lvb_len);
748 unlock_res_and_lock(lock);
756 rc = ldlm_lock_enqueue(env, ns, &lock, NULL, flags);
757 if (lock->l_completion_ast != NULL) {
758 int err = lock->l_completion_ast(lock, *flags, NULL);
767 if (lvb_len > 0 && lvb != NULL) {
769 * Copy the LVB here, and not earlier, because the completion
770 * AST (if any) can override what we got in the reply
772 memcpy(lvb, lock->l_lvb_data, lvb_len);
775 LDLM_DEBUG(lock, "client-side enqueue END");
778 if (cleanup_phase == 1 && rc)
779 failed_lock_cleanup(ns, lock, mode);
780 /* Put lock 2 times, the second reference is held by ldlm_cli_enqueue */
782 LDLM_LOCK_RELEASE(lock);
785 EXPORT_SYMBOL(ldlm_cli_enqueue_fini);
788 * Estimate number of lock handles that would fit into request of given
789 * size. PAGE_SIZE-512 is to allow TCP/IP and LNET headers to fit into
790 * a single page on the send/receive side. XXX: 512 should be changed to
791 * more adequate value.
793 static inline int ldlm_req_handles_avail(int req_size, int off)
797 avail = min_t(int, LDLM_MAXREQSIZE, PAGE_SIZE - 512) - req_size;
798 if (likely(avail >= 0))
799 avail /= (int)sizeof(struct lustre_handle);
802 avail += LDLM_LOCKREQ_HANDLES - off;
807 static inline int ldlm_capsule_handles_avail(struct req_capsule *pill,
808 enum req_location loc,
811 __u32 size = req_capsule_msg_size(pill, loc);
813 return ldlm_req_handles_avail(size, off);
816 static inline int ldlm_format_handles_avail(struct obd_import *imp,
817 const struct req_format *fmt,
818 enum req_location loc, int off)
820 __u32 size = req_capsule_fmt_size(imp->imp_msg_magic, fmt, loc);
822 return ldlm_req_handles_avail(size, off);
826 * Cancel LRU locks and pack them into the enqueue request. Pack there the given
827 * \a count locks in \a cancels.
829 * This is to be called by functions preparing their own requests that
830 * might contain lists of locks to cancel in addition to actual operation
831 * that needs to be performed.
833 int ldlm_prep_elc_req(struct obd_export *exp, struct ptlrpc_request *req,
834 int version, int opc, int canceloff,
835 struct list_head *cancels, int count)
837 struct ldlm_namespace *ns = exp->exp_obd->obd_namespace;
838 struct req_capsule *pill = &req->rq_pill;
839 struct ldlm_request *dlm = NULL;
840 struct list_head head = LIST_HEAD_INIT(head);
841 enum ldlm_lru_flags lru_flags;
842 int avail, to_free, pack = 0;
849 if (ns_connect_cancelset(ns)) {
850 /* Estimate the amount of available space in the request. */
851 req_capsule_filled_sizes(pill, RCL_CLIENT);
852 avail = ldlm_capsule_handles_avail(pill, RCL_CLIENT, canceloff);
854 lru_flags = LDLM_LRU_FLAG_NO_WAIT | (ns_connect_lru_resize(ns) ?
855 LDLM_LRU_FLAG_LRUR : LDLM_LRU_FLAG_AGED);
856 to_free = !ns_connect_lru_resize(ns) &&
857 opc == LDLM_ENQUEUE ? 1 : 0;
860 * Cancel LRU locks here _only_ if the server supports
861 * EARLY_CANCEL. Otherwise we have to send extra CANCEL
862 * RPC, which will make us slower.
865 count += ldlm_cancel_lru_local(ns, cancels, to_free,
872 req_capsule_set_size(pill, &RMF_DLM_REQ, RCL_CLIENT,
873 ldlm_request_bufsize(pack, opc));
876 rc = ptlrpc_request_pack(req, version, opc);
878 ldlm_lock_list_put(cancels, l_bl_ast, count);
882 if (ns_connect_cancelset(ns)) {
884 dlm = req_capsule_client_get(pill, &RMF_DLM_REQ);
887 * Skip first lock handler in ldlm_request_pack(),
888 * this method will increment @lock_count according
889 * to the lock handle amount actually written to
892 dlm->lock_count = canceloff;
894 /* Pack into the request @pack lock handles. */
895 ldlm_cli_cancel_list(cancels, pack, req, 0);
896 /* Prepare and send separate cancel RPC for others. */
897 ldlm_cli_cancel_list(cancels, count - pack, NULL, 0);
899 ldlm_lock_list_put(cancels, l_bl_ast, count);
903 EXPORT_SYMBOL(ldlm_prep_elc_req);
905 int ldlm_prep_enqueue_req(struct obd_export *exp, struct ptlrpc_request *req,
906 struct list_head *cancels, int count)
908 return ldlm_prep_elc_req(exp, req, LUSTRE_DLM_VERSION, LDLM_ENQUEUE,
909 LDLM_ENQUEUE_CANCEL_OFF, cancels, count);
911 EXPORT_SYMBOL(ldlm_prep_enqueue_req);
913 struct ptlrpc_request *ldlm_enqueue_pack(struct obd_export *exp, int lvb_len)
915 struct ptlrpc_request *req;
920 req = ptlrpc_request_alloc(class_exp2cliimp(exp), &RQF_LDLM_ENQUEUE);
922 RETURN(ERR_PTR(-ENOMEM));
924 rc = ldlm_prep_enqueue_req(exp, req, NULL, 0);
926 ptlrpc_request_free(req);
930 req_capsule_set_size(&req->rq_pill, &RMF_DLM_LVB, RCL_SERVER, lvb_len);
931 ptlrpc_request_set_replen(req);
934 EXPORT_SYMBOL(ldlm_enqueue_pack);
937 * Client-side lock enqueue.
939 * If a request has some specific initialisation it is passed in \a reqp,
940 * otherwise it is created in ldlm_cli_enqueue.
942 * Supports sync and async requests, pass \a async flag accordingly. If a
943 * request was created in ldlm_cli_enqueue and it is the async request,
944 * pass it to the caller in \a reqp.
946 int ldlm_cli_enqueue(struct obd_export *exp, struct ptlrpc_request **reqp,
947 struct ldlm_enqueue_info *einfo,
948 const struct ldlm_res_id *res_id,
949 union ldlm_policy_data const *policy, __u64 *flags,
950 void *lvb, __u32 lvb_len, enum lvb_type lvb_type,
951 struct lustre_handle *lockh, int async)
953 struct ldlm_namespace *ns;
954 struct ldlm_lock *lock;
955 struct ldlm_request *body;
956 int is_replay = *flags & LDLM_FL_REPLAY;
957 int req_passed_in = 1;
959 struct ptlrpc_request *req;
963 LASSERT(exp != NULL);
965 ns = exp->exp_obd->obd_namespace;
968 * If we're replaying this lock, just check some invariants.
969 * If we're creating a new lock, get everything all setup nice.
972 lock = ldlm_handle2lock_long(lockh, 0);
973 LASSERT(lock != NULL);
974 LDLM_DEBUG(lock, "client-side enqueue START");
975 LASSERT(exp == lock->l_conn_export);
977 const struct ldlm_callback_suite cbs = {
978 .lcs_completion = einfo->ei_cb_cp,
979 .lcs_blocking = einfo->ei_cb_bl,
980 .lcs_glimpse = einfo->ei_cb_gl
982 lock = ldlm_lock_create(ns, res_id, einfo->ei_type,
983 einfo->ei_mode, &cbs, einfo->ei_cbdata,
986 RETURN(PTR_ERR(lock));
988 if (einfo->ei_cb_created)
989 einfo->ei_cb_created(lock);
991 /* for the local lock, add the reference */
992 ldlm_lock_addref_internal(lock, einfo->ei_mode);
993 ldlm_lock2handle(lock, lockh);
995 lock->l_policy_data = *policy;
997 if (einfo->ei_type == LDLM_EXTENT) {
998 /* extent lock without policy is a bug */
1002 lock->l_req_extent = policy->l_extent;
1004 LDLM_DEBUG(lock, "client-side enqueue START, flags %#llx",
1008 lock->l_conn_export = exp;
1009 lock->l_export = NULL;
1010 lock->l_blocking_ast = einfo->ei_cb_bl;
1011 lock->l_flags |= (*flags & (LDLM_FL_NO_LRU | LDLM_FL_EXCL));
1012 lock->l_activity = ktime_get_real_seconds();
1014 /* lock not sent to server yet */
1015 if (reqp == NULL || *reqp == NULL) {
1016 req = ldlm_enqueue_pack(exp, lvb_len);
1018 failed_lock_cleanup(ns, lock, einfo->ei_mode);
1019 LDLM_LOCK_RELEASE(lock);
1020 RETURN(PTR_ERR(req));
1030 len = req_capsule_get_size(&req->rq_pill, &RMF_DLM_REQ,
1032 LASSERTF(len >= sizeof(*body), "buflen[%d] = %d, not %d\n",
1033 DLM_LOCKREQ_OFF, len, (int)sizeof(*body));
1036 if (*flags & LDLM_FL_NDELAY) {
1037 DEBUG_REQ(D_DLMTRACE, req, "enque lock with no delay\n");
1038 req->rq_no_resend = req->rq_no_delay = 1;
1040 * probably set a shorter timeout value and handle ETIMEDOUT
1041 * in osc_lock_upcall() correctly
1043 /* lustre_msg_set_timeout(req, req->rq_timeout / 2); */
1046 /* Dump lock data into the request buffer */
1047 body = req_capsule_client_get(&req->rq_pill, &RMF_DLM_REQ);
1048 ldlm_lock2desc(lock, &body->lock_desc);
1049 body->lock_flags = ldlm_flags_to_wire(*flags);
1050 body->lock_handle[0] = *lockh;
1052 /* extended LDLM opcodes in client stats */
1053 if (exp->exp_obd->obd_svc_stats != NULL) {
1054 bool glimpse = *flags & LDLM_FL_HAS_INTENT;
1056 /* OST glimpse has no intent buffer */
1057 if (req_capsule_has_field(&req->rq_pill, &RMF_LDLM_INTENT,
1059 struct ldlm_intent *it;
1061 it = req_capsule_client_get(&req->rq_pill,
1063 glimpse = (it && (it->opc == IT_GLIMPSE));
1067 ldlm_svc_get_eopc(body, exp->exp_obd->obd_svc_stats);
1069 lprocfs_counter_incr(exp->exp_obd->obd_svc_stats,
1071 LDLM_GLIMPSE_ENQUEUE);
1075 LASSERT(reqp != NULL);
1079 LDLM_DEBUG(lock, "sending request");
1081 rc = ptlrpc_queue_wait(req);
1083 err = ldlm_cli_enqueue_fini(exp, req, einfo->ei_type, policy ? 1 : 0,
1084 einfo->ei_mode, flags, lvb, lvb_len,
1088 * If ldlm_cli_enqueue_fini did not find the lock, we need to free
1089 * one reference that we took
1092 LDLM_LOCK_RELEASE(lock);
1096 if (!req_passed_in && req != NULL) {
1097 ptlrpc_req_finished(req);
1104 EXPORT_SYMBOL(ldlm_cli_enqueue);
1107 * Client-side lock convert reply handling.
1109 * Finish client lock converting, checks for concurrent converts
1110 * and clear 'converting' flag so lock can be placed back into LRU.
1112 static int lock_convert_interpret(const struct lu_env *env,
1113 struct ptlrpc_request *req,
1116 struct ldlm_async_args *aa = args;
1117 struct ldlm_lock *lock;
1118 struct ldlm_reply *reply;
1122 lock = ldlm_handle2lock(&aa->lock_handle);
1124 LDLM_DEBUG_NOLOCK("convert ACK for unknown local cookie %#llx",
1125 aa->lock_handle.cookie);
1129 LDLM_DEBUG(lock, "CONVERTED lock:");
1134 reply = req_capsule_server_get(&req->rq_pill, &RMF_DLM_REP);
1136 GOTO(out, rc = -EPROTO);
1138 if (reply->lock_handle.cookie != aa->lock_handle.cookie) {
1140 "convert ACK with wrong lock cookie %#llx but cookie %#llx from server %s id %s\n",
1141 aa->lock_handle.cookie, reply->lock_handle.cookie,
1142 req->rq_export->exp_client_uuid.uuid,
1143 libcfs_id2str(req->rq_peer));
1144 GOTO(out, rc = ELDLM_NO_LOCK_DATA);
1147 lock_res_and_lock(lock);
1149 * Lock convert is sent for any new bits to drop, the converting flag
1150 * is dropped when ibits on server are the same as on client. Meanwhile
1151 * that can be so that more later convert will be replied first with
1152 * and clear converting flag, so in case of such race just exit here.
1153 * if lock has no converting bits then
1155 if (!ldlm_is_converting(lock)) {
1157 "convert ACK for lock without converting flag, reply ibits %#llx",
1158 reply->lock_desc.l_policy_data.l_inodebits.bits);
1159 } else if (reply->lock_desc.l_policy_data.l_inodebits.bits !=
1160 lock->l_policy_data.l_inodebits.bits) {
1162 * Compare server returned lock ibits and local lock ibits
1163 * if they are the same we consider convertion is done,
1164 * otherwise we have more converts inflight and keep
1167 LDLM_DEBUG(lock, "convert ACK with ibits %#llx\n",
1168 reply->lock_desc.l_policy_data.l_inodebits.bits);
1170 ldlm_clear_converting(lock);
1173 * Concurrent BL AST may arrive and cause another convert
1174 * or cancel so just do nothing here if bl_ast is set,
1175 * finish with convert otherwise.
1177 if (!ldlm_is_bl_ast(lock)) {
1178 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
1181 * Drop cancel_bits since there are no more converts
1182 * and put lock into LRU if it is still not used and
1185 lock->l_policy_data.l_inodebits.cancel_bits = 0;
1186 if (!lock->l_readers && !lock->l_writers &&
1187 !ldlm_is_canceling(lock)) {
1188 spin_lock(&ns->ns_lock);
1189 /* there is check for list_empty() inside */
1190 ldlm_lock_remove_from_lru_nolock(lock);
1191 ldlm_lock_add_to_lru_nolock(lock);
1192 spin_unlock(&ns->ns_lock);
1196 unlock_res_and_lock(lock);
1201 lock_res_and_lock(lock);
1202 if (ldlm_is_converting(lock)) {
1203 ldlm_clear_converting(lock);
1204 ldlm_set_cbpending(lock);
1205 ldlm_set_bl_ast(lock);
1206 lock->l_policy_data.l_inodebits.cancel_bits = 0;
1208 unlock_res_and_lock(lock);
1211 * fallback to normal lock cancel. If rc means there is no
1212 * valid lock on server, do only local cancel
1214 if (rc == ELDLM_NO_LOCK_DATA)
1219 rc = ldlm_cli_cancel(&aa->lock_handle, flag);
1221 LDLM_DEBUG(lock, "failed to cancel lock: rc = %d\n",
1224 LDLM_LOCK_PUT(lock);
1229 * Client-side IBITS lock convert.
1231 * Inform server that lock has been converted instead of canceling.
1232 * Server finishes convert on own side and does reprocess to grant
1233 * all related waiting locks.
1235 * Since convert means only ibits downgrading, client doesn't need to
1236 * wait for server reply to finish local converting process so this request
1237 * is made asynchronous.
1240 int ldlm_cli_convert(struct ldlm_lock *lock, __u32 *flags)
1242 struct ldlm_request *body;
1243 struct ptlrpc_request *req;
1244 struct ldlm_async_args *aa;
1245 struct obd_export *exp = lock->l_conn_export;
1250 LDLM_ERROR(lock, "convert must not be called on local locks.");
1255 * this is better to check earlier and it is done so already,
1256 * but this check is kept too as final one to issue an error
1257 * if any new code will miss such check.
1259 if (!exp_connect_lock_convert(exp)) {
1260 LDLM_ERROR(lock, "server doesn't support lock convert\n");
1264 if (lock->l_resource->lr_type != LDLM_IBITS) {
1265 LDLM_ERROR(lock, "convert works with IBITS locks only.");
1269 LDLM_DEBUG(lock, "client-side convert");
1271 req = ptlrpc_request_alloc_pack(class_exp2cliimp(exp),
1272 &RQF_LDLM_CONVERT, LUSTRE_DLM_VERSION,
1277 body = req_capsule_client_get(&req->rq_pill, &RMF_DLM_REQ);
1278 body->lock_handle[0] = lock->l_remote_handle;
1280 body->lock_desc.l_req_mode = lock->l_req_mode;
1281 body->lock_desc.l_granted_mode = lock->l_granted_mode;
1283 body->lock_desc.l_policy_data.l_inodebits.bits =
1284 lock->l_policy_data.l_inodebits.bits;
1285 body->lock_desc.l_policy_data.l_inodebits.cancel_bits = 0;
1287 body->lock_flags = ldlm_flags_to_wire(*flags);
1288 body->lock_count = 1;
1290 ptlrpc_request_set_replen(req);
1293 * Use cancel portals for convert as well as high-priority handling.
1295 req->rq_request_portal = LDLM_CANCEL_REQUEST_PORTAL;
1296 req->rq_reply_portal = LDLM_CANCEL_REPLY_PORTAL;
1298 ptlrpc_at_set_req_timeout(req);
1300 if (exp->exp_obd->obd_svc_stats != NULL)
1301 lprocfs_counter_incr(exp->exp_obd->obd_svc_stats,
1302 LDLM_CONVERT - LDLM_FIRST_OPC);
1304 aa = ptlrpc_req_async_args(req);
1305 ldlm_lock2handle(lock, &aa->lock_handle);
1306 req->rq_interpret_reply = lock_convert_interpret;
1308 ptlrpcd_add_req(req);
1313 * Cancel locks locally.
1315 * \retval LDLM_FL_LOCAL_ONLY if there is no need for a CANCEL RPC to the server
1316 * \retval LDLM_FL_CANCELING otherwise;
1317 * \retval LDLM_FL_BL_AST if there is a need for a separate CANCEL RPC.
1319 static __u64 ldlm_cli_cancel_local(struct ldlm_lock *lock)
1321 __u64 rc = LDLM_FL_LOCAL_ONLY;
1325 if (lock->l_conn_export) {
1328 LDLM_DEBUG(lock, "client-side cancel");
1329 /* Set this flag to prevent others from getting new references*/
1330 lock_res_and_lock(lock);
1331 ldlm_set_cbpending(lock);
1332 local_only = !!(lock->l_flags &
1333 (LDLM_FL_LOCAL_ONLY|LDLM_FL_CANCEL_ON_BLOCK));
1334 ldlm_cancel_callback(lock);
1335 rc = (ldlm_is_bl_ast(lock)) ?
1336 LDLM_FL_BL_AST : LDLM_FL_CANCELING;
1337 unlock_res_and_lock(lock);
1341 "not sending request (at caller's instruction)\n");
1342 rc = LDLM_FL_LOCAL_ONLY;
1344 ldlm_lock_cancel(lock);
1346 if (ns_is_client(ldlm_lock_to_ns(lock))) {
1347 LDLM_ERROR(lock, "Trying to cancel local lock");
1350 LDLM_DEBUG(lock, "server-side local cancel");
1351 ldlm_lock_cancel(lock);
1352 ldlm_reprocess_all(lock->l_resource);
1359 * Pack \a count locks in \a head into ldlm_request buffer of request \a req.
1361 static void ldlm_cancel_pack(struct ptlrpc_request *req,
1362 struct list_head *head, int count)
1364 struct ldlm_request *dlm;
1365 struct ldlm_lock *lock;
1366 int max, packed = 0;
1370 dlm = req_capsule_client_get(&req->rq_pill, &RMF_DLM_REQ);
1371 LASSERT(dlm != NULL);
1373 /* Check the room in the request buffer. */
1374 max = req_capsule_get_size(&req->rq_pill, &RMF_DLM_REQ, RCL_CLIENT) -
1375 sizeof(struct ldlm_request);
1376 max /= sizeof(struct lustre_handle);
1377 max += LDLM_LOCKREQ_HANDLES;
1378 LASSERT(max >= dlm->lock_count + count);
1381 * XXX: it would be better to pack lock handles grouped by resource.
1382 * so that the server cancel would call filter_lvbo_update() less
1385 list_for_each_entry(lock, head, l_bl_ast) {
1388 LASSERT(lock->l_conn_export);
1389 /* Pack the lock handle to the given request buffer. */
1390 LDLM_DEBUG(lock, "packing");
1391 dlm->lock_handle[dlm->lock_count++] = lock->l_remote_handle;
1394 CDEBUG(D_DLMTRACE, "%d locks packed\n", packed);
1399 * Prepare and send a batched cancel RPC. It will include \a count lock
1400 * handles of locks given in \a cancels list.
1402 int ldlm_cli_cancel_req(struct obd_export *exp, struct list_head *cancels,
1403 int count, enum ldlm_cancel_flags flags)
1405 struct ptlrpc_request *req = NULL;
1406 struct obd_import *imp;
1412 LASSERT(exp != NULL);
1415 CFS_FAIL_TIMEOUT(OBD_FAIL_LDLM_PAUSE_CANCEL, cfs_fail_val);
1417 if (CFS_FAIL_CHECK(OBD_FAIL_LDLM_CANCEL_RACE))
1420 free = ldlm_format_handles_avail(class_exp2cliimp(exp),
1421 &RQF_LDLM_CANCEL, RCL_CLIENT, 0);
1426 imp = class_exp2cliimp(exp);
1427 if (imp == NULL || imp->imp_invalid) {
1429 "skipping cancel on invalid import %p\n", imp);
1433 req = ptlrpc_request_alloc(imp, &RQF_LDLM_CANCEL);
1435 GOTO(out, rc = -ENOMEM);
1437 req_capsule_filled_sizes(&req->rq_pill, RCL_CLIENT);
1438 req_capsule_set_size(&req->rq_pill, &RMF_DLM_REQ, RCL_CLIENT,
1439 ldlm_request_bufsize(count, LDLM_CANCEL));
1441 rc = ptlrpc_request_pack(req, LUSTRE_DLM_VERSION, LDLM_CANCEL);
1443 ptlrpc_request_free(req);
1448 * If OSP want cancel cross-MDT lock, let's not block it in
1449 * in recovery, otherwise the lock will not released, if
1450 * the remote target is also in recovery, and it also need
1451 * this lock, it might cause deadlock.
1453 if (exp_connect_flags(exp) & OBD_CONNECT_MDS_MDS &&
1454 exp->exp_obd->obd_lu_dev != NULL &&
1455 exp->exp_obd->obd_lu_dev->ld_site != NULL) {
1456 struct lu_device *top_dev;
1458 top_dev = exp->exp_obd->obd_lu_dev->ld_site->ls_top_dev;
1459 if (top_dev != NULL &&
1460 top_dev->ld_obd->obd_recovering)
1461 req->rq_allow_replay = 1;
1464 req->rq_request_portal = LDLM_CANCEL_REQUEST_PORTAL;
1465 req->rq_reply_portal = LDLM_CANCEL_REPLY_PORTAL;
1466 ptlrpc_at_set_req_timeout(req);
1468 ldlm_cancel_pack(req, cancels, count);
1470 ptlrpc_request_set_replen(req);
1471 if (flags & LCF_ASYNC) {
1472 ptlrpcd_add_req(req);
1477 rc = ptlrpc_queue_wait(req);
1478 if (rc == LUSTRE_ESTALE) {
1480 "client/server (nid %s) out of sync -- not fatal\n",
1481 libcfs_nid2str(req->rq_import->imp_connection->c_peer.nid));
1483 } else if (rc == -ETIMEDOUT && /* check there was no reconnect*/
1484 req->rq_import_generation == imp->imp_generation) {
1485 ptlrpc_req_finished(req);
1487 } else if (rc != ELDLM_OK) {
1488 /* -ESHUTDOWN is common on umount */
1489 CDEBUG_LIMIT(rc == -ESHUTDOWN ? D_DLMTRACE : D_ERROR,
1490 "Got rc %d from cancel RPC: canceling anyway\n",
1498 ptlrpc_req_finished(req);
1501 return sent ? sent : rc;
1504 static inline struct ldlm_pool *ldlm_imp2pl(struct obd_import *imp)
1506 LASSERT(imp != NULL);
1507 return &imp->imp_obd->obd_namespace->ns_pool;
1511 * Update client's OBD pool related fields with new SLV and Limit from \a req.
1513 int ldlm_cli_update_pool(struct ptlrpc_request *req)
1515 struct obd_device *obd;
1520 if (unlikely(!req->rq_import || !req->rq_import->imp_obd ||
1521 !imp_connect_lru_resize(req->rq_import)))
1522 /* Do nothing for corner cases. */
1526 * In some cases RPC may contain SLV and limit zeroed out. This
1527 * is the case when server does not support LRU resize feature.
1528 * This is also possible in some recovery cases when server-side
1529 * reqs have no reference to the OBD export and thus access to
1530 * server-side namespace is not possible.
1532 if (lustre_msg_get_slv(req->rq_repmsg) == 0 ||
1533 lustre_msg_get_limit(req->rq_repmsg) == 0) {
1534 DEBUG_REQ(D_HA, req,
1535 "Zero SLV or Limit found (SLV: %llu, Limit: %u)",
1536 lustre_msg_get_slv(req->rq_repmsg),
1537 lustre_msg_get_limit(req->rq_repmsg));
1541 new_limit = lustre_msg_get_limit(req->rq_repmsg);
1542 new_slv = lustre_msg_get_slv(req->rq_repmsg);
1543 obd = req->rq_import->imp_obd;
1546 * Set new SLV and limit in OBD fields to make them accessible
1547 * to the pool thread. We do not access obd_namespace and pool
1548 * directly here as there is no reliable way to make sure that
1549 * they are still alive at cleanup time. Evil races are possible
1550 * which may cause Oops at that time.
1552 write_lock(&obd->obd_pool_lock);
1553 obd->obd_pool_slv = new_slv;
1554 obd->obd_pool_limit = new_limit;
1555 write_unlock(&obd->obd_pool_lock);
1561 * Client side lock cancel.
1563 * Lock must not have any readers or writers by this time.
1565 int ldlm_cli_cancel(const struct lustre_handle *lockh,
1566 enum ldlm_cancel_flags cancel_flags)
1568 struct obd_export *exp;
1569 enum ldlm_lru_flags lru_flags;
1570 int avail, count = 1;
1572 struct ldlm_namespace *ns;
1573 struct ldlm_lock *lock;
1574 struct list_head cancels = LIST_HEAD_INIT(cancels);
1578 lock = ldlm_handle2lock_long(lockh, 0);
1580 LDLM_DEBUG_NOLOCK("lock is already being destroyed");
1584 /* Convert lock bits instead of cancel for IBITS locks */
1585 if (cancel_flags & LCF_CONVERT) {
1586 LASSERT(lock->l_resource->lr_type == LDLM_IBITS);
1587 LASSERT(lock->l_policy_data.l_inodebits.cancel_bits != 0);
1589 rc = ldlm_cli_dropbits(lock,
1590 lock->l_policy_data.l_inodebits.cancel_bits);
1592 LDLM_LOCK_RELEASE(lock);
1597 lock_res_and_lock(lock);
1598 /* Lock is being canceled and the caller doesn't want to wait */
1599 if (ldlm_is_canceling(lock)) {
1600 if (cancel_flags & LCF_ASYNC) {
1601 unlock_res_and_lock(lock);
1603 struct l_wait_info lwi = { 0 };
1605 unlock_res_and_lock(lock);
1606 l_wait_event(lock->l_waitq, is_bl_done(lock), &lwi);
1608 LDLM_LOCK_RELEASE(lock);
1613 * Lock is being converted, cancel it immediately.
1614 * When convert will end, it releases lock and it will be gone.
1616 if (ldlm_is_converting(lock)) {
1617 /* set back flags removed by convert */
1618 ldlm_set_cbpending(lock);
1619 ldlm_set_bl_ast(lock);
1622 ldlm_set_canceling(lock);
1623 unlock_res_and_lock(lock);
1625 if (cancel_flags & LCF_LOCAL)
1626 OBD_FAIL_TIMEOUT(OBD_FAIL_LDLM_LOCAL_CANCEL_PAUSE,
1629 rc = ldlm_cli_cancel_local(lock);
1630 if (rc == LDLM_FL_LOCAL_ONLY || cancel_flags & LCF_LOCAL) {
1631 LDLM_LOCK_RELEASE(lock);
1635 * Even if the lock is marked as LDLM_FL_BL_AST, this is a LDLM_CANCEL
1636 * RPC which goes to canceld portal, so we can cancel other LRU locks
1637 * here and send them all as one LDLM_CANCEL RPC.
1639 LASSERT(list_empty(&lock->l_bl_ast));
1640 list_add(&lock->l_bl_ast, &cancels);
1642 exp = lock->l_conn_export;
1643 if (exp_connect_cancelset(exp)) {
1644 avail = ldlm_format_handles_avail(class_exp2cliimp(exp),
1649 ns = ldlm_lock_to_ns(lock);
1650 lru_flags = ns_connect_lru_resize(ns) ?
1651 LDLM_LRU_FLAG_LRUR : LDLM_LRU_FLAG_AGED;
1652 count += ldlm_cancel_lru_local(ns, &cancels, 0, avail - 1,
1653 LCF_BL_AST, lru_flags);
1655 ldlm_cli_cancel_list(&cancels, count, NULL, cancel_flags);
1658 EXPORT_SYMBOL(ldlm_cli_cancel);
1661 * Locally cancel up to \a count locks in list \a cancels.
1662 * Return the number of cancelled locks.
1664 int ldlm_cli_cancel_list_local(struct list_head *cancels, int count,
1665 enum ldlm_cancel_flags cancel_flags)
1667 struct list_head head = LIST_HEAD_INIT(head);
1668 struct ldlm_lock *lock, *next;
1669 int left = 0, bl_ast = 0;
1673 list_for_each_entry_safe(lock, next, cancels, l_bl_ast) {
1677 if (cancel_flags & LCF_LOCAL) {
1678 rc = LDLM_FL_LOCAL_ONLY;
1679 ldlm_lock_cancel(lock);
1681 rc = ldlm_cli_cancel_local(lock);
1684 * Until we have compound requests and can send LDLM_CANCEL
1685 * requests batched with generic RPCs, we need to send cancels
1686 * with the LDLM_FL_BL_AST flag in a separate RPC from
1687 * the one being generated now.
1689 if (!(cancel_flags & LCF_BL_AST) && (rc == LDLM_FL_BL_AST)) {
1690 LDLM_DEBUG(lock, "Cancel lock separately");
1691 list_del_init(&lock->l_bl_ast);
1692 list_add(&lock->l_bl_ast, &head);
1696 if (rc == LDLM_FL_LOCAL_ONLY) {
1697 /* CANCEL RPC should not be sent to server. */
1698 list_del_init(&lock->l_bl_ast);
1699 LDLM_LOCK_RELEASE(lock);
1705 ldlm_cli_cancel_list(&head, bl_ast, NULL, 0);
1712 * Cancel as many locks as possible w/o sending any RPCs (e.g. to write back
1713 * dirty data, to close a file, ...) or waiting for any RPCs in-flight (e.g.
1714 * readahead requests, ...)
1716 static enum ldlm_policy_res
1717 ldlm_cancel_no_wait_policy(struct ldlm_namespace *ns, struct ldlm_lock *lock,
1718 int unused, int added, int count)
1720 enum ldlm_policy_res result = LDLM_POLICY_CANCEL_LOCK;
1723 * don't check added & count since we want to process all locks
1725 * It's fine to not take lock to access lock->l_resource since
1726 * the lock has already been granted so it won't change.
1728 switch (lock->l_resource->lr_type) {
1731 if (ns->ns_cancel != NULL && ns->ns_cancel(lock) != 0)
1734 result = LDLM_POLICY_SKIP_LOCK;
1742 * Callback function for LRU-resize policy. Decides whether to keep
1743 * \a lock in LRU for current \a LRU size \a unused, added in current
1744 * scan \a added and number of locks to be preferably canceled \a count.
1746 * \retval LDLM_POLICY_KEEP_LOCK keep lock in LRU in stop scanning
1748 * \retval LDLM_POLICY_CANCEL_LOCK cancel lock from LRU
1750 static enum ldlm_policy_res ldlm_cancel_lrur_policy(struct ldlm_namespace *ns,
1751 struct ldlm_lock *lock,
1752 int unused, int added,
1755 ktime_t cur = ktime_get();
1756 struct ldlm_pool *pl = &ns->ns_pool;
1761 * Stop LRU processing when we reach past @count or have checked all
1764 if (count && added >= count)
1765 return LDLM_POLICY_KEEP_LOCK;
1768 * Despite of the LV, It doesn't make sense to keep the lock which
1769 * is unused for ns_max_age time.
1771 if (ktime_after(ktime_get(),
1772 ktime_add(lock->l_last_used, ns->ns_max_age)))
1773 return LDLM_POLICY_CANCEL_LOCK;
1775 slv = ldlm_pool_get_slv(pl);
1776 lvf = ldlm_pool_get_lvf(pl);
1777 la = div_u64(ktime_to_ns(ktime_sub(cur, lock->l_last_used)),
1779 lv = lvf * la * unused;
1781 /* Inform pool about current CLV to see it via debugfs. */
1782 ldlm_pool_set_clv(pl, lv);
1785 * Stop when SLV is not yet come from server or lv is smaller than
1788 if (slv == 0 || lv < slv)
1789 return LDLM_POLICY_KEEP_LOCK;
1791 return LDLM_POLICY_CANCEL_LOCK;
1794 static enum ldlm_policy_res
1795 ldlm_cancel_lrur_no_wait_policy(struct ldlm_namespace *ns,
1796 struct ldlm_lock *lock,
1797 int unused, int added,
1800 enum ldlm_policy_res result;
1802 result = ldlm_cancel_lrur_policy(ns, lock, unused, added, count);
1803 if (result == LDLM_POLICY_KEEP_LOCK)
1806 return ldlm_cancel_no_wait_policy(ns, lock, unused, added, count);
1810 * Callback function for debugfs used policy. Makes decision whether to keep
1811 * \a lock in LRU for current \a LRU size \a unused, added in current scan \a
1812 * added and number of locks to be preferably canceled \a count.
1814 * \retval LDLM_POLICY_KEEP_LOCK keep lock in LRU in stop scanning
1816 * \retval LDLM_POLICY_CANCEL_LOCK cancel lock from LRU
1818 static enum ldlm_policy_res ldlm_cancel_passed_policy(struct ldlm_namespace *ns,
1819 struct ldlm_lock *lock,
1820 int unused, int added,
1824 * Stop LRU processing when we reach past @count or have checked all
1827 return (added >= count) ?
1828 LDLM_POLICY_KEEP_LOCK : LDLM_POLICY_CANCEL_LOCK;
1832 * Callback function for aged policy. Makes decision whether to keep \a lock in
1833 * LRU for current LRU size \a unused, added in current scan \a added and
1834 * number of locks to be preferably canceled \a count.
1836 * \retval LDLM_POLICY_KEEP_LOCK keep lock in LRU in stop scanning
1838 * \retval LDLM_POLICY_CANCEL_LOCK cancel lock from LRU
1840 static enum ldlm_policy_res ldlm_cancel_aged_policy(struct ldlm_namespace *ns,
1841 struct ldlm_lock *lock,
1842 int unused, int added,
1845 if ((added >= count) &&
1846 ktime_before(ktime_get(),
1847 ktime_add(lock->l_last_used, ns->ns_max_age)))
1848 return LDLM_POLICY_KEEP_LOCK;
1850 return LDLM_POLICY_CANCEL_LOCK;
1853 static enum ldlm_policy_res
1854 ldlm_cancel_aged_no_wait_policy(struct ldlm_namespace *ns,
1855 struct ldlm_lock *lock,
1856 int unused, int added, int count)
1858 enum ldlm_policy_res result;
1860 result = ldlm_cancel_aged_policy(ns, lock, unused, added, count);
1861 if (result == LDLM_POLICY_KEEP_LOCK)
1864 return ldlm_cancel_no_wait_policy(ns, lock, unused, added, count);
1868 * Callback function for default policy. Makes decision whether to keep \a lock
1869 * in LRU for current LRU size \a unused, added in current scan \a added and
1870 * number of locks to be preferably canceled \a count.
1872 * \retval LDLM_POLICY_KEEP_LOCK keep lock in LRU in stop scanning
1874 * \retval LDLM_POLICY_CANCEL_LOCK cancel lock from LRU
1877 enum ldlm_policy_res ldlm_cancel_default_policy(struct ldlm_namespace *ns,
1878 struct ldlm_lock *lock,
1879 int unused, int added,
1883 * Stop LRU processing when we reach past count or have checked all
1886 return (added >= count) ?
1887 LDLM_POLICY_KEEP_LOCK : LDLM_POLICY_CANCEL_LOCK;
1890 typedef enum ldlm_policy_res
1891 (*ldlm_cancel_lru_policy_t)(struct ldlm_namespace *ns, struct ldlm_lock *lock,
1892 int unused, int added, int count);
1894 static ldlm_cancel_lru_policy_t
1895 ldlm_cancel_lru_policy(struct ldlm_namespace *ns, enum ldlm_lru_flags lru_flags)
1897 if (ns_connect_lru_resize(ns)) {
1898 if (lru_flags & LDLM_LRU_FLAG_SHRINK)
1899 /* We kill passed number of old locks. */
1900 return ldlm_cancel_passed_policy;
1901 if (lru_flags & LDLM_LRU_FLAG_LRUR) {
1902 if (lru_flags & LDLM_LRU_FLAG_NO_WAIT)
1903 return ldlm_cancel_lrur_no_wait_policy;
1905 return ldlm_cancel_lrur_policy;
1907 if (lru_flags & LDLM_LRU_FLAG_PASSED)
1908 return ldlm_cancel_passed_policy;
1910 if (lru_flags & LDLM_LRU_FLAG_AGED) {
1911 if (lru_flags & LDLM_LRU_FLAG_NO_WAIT)
1912 return ldlm_cancel_aged_no_wait_policy;
1914 return ldlm_cancel_aged_policy;
1917 if (lru_flags & LDLM_LRU_FLAG_NO_WAIT)
1918 return ldlm_cancel_no_wait_policy;
1920 return ldlm_cancel_default_policy;
1924 * - Free space in LRU for \a count new locks,
1925 * redundant unused locks are canceled locally;
1926 * - also cancel locally unused aged locks;
1927 * - do not cancel more than \a max locks;
1928 * - GET the found locks and add them into the \a cancels list.
1930 * A client lock can be added to the l_bl_ast list only when it is
1931 * marked LDLM_FL_CANCELING. Otherwise, somebody is already doing
1932 * CANCEL. There are the following use cases:
1933 * ldlm_cancel_resource_local(), ldlm_cancel_lru_local() and
1934 * ldlm_cli_cancel(), which check and set this flag properly. As any
1935 * attempt to cancel a lock rely on this flag, l_bl_ast list is accessed
1936 * later without any special locking.
1938 * Calling policies for enabled LRU resize:
1939 * ----------------------------------------
1940 * flags & LDLM_LRU_FLAG_LRUR - use LRU resize policy (SLV from server) to
1941 * cancel not more than \a count locks;
1943 * flags & LDLM_LRU_FLAG_PASSED - cancel \a count number of old locks (located
1944 * at the beginning of LRU list);
1946 * flags & LDLM_LRU_FLAG_SHRINK - cancel not more than \a count locks according
1947 * to memory pressre policy function;
1949 * flags & LDLM_LRU_FLAG_AGED - cancel \a count locks according to "aged policy"
1951 * flags & LDLM_LRU_FLAG_NO_WAIT - cancel as many unused locks as possible
1952 * (typically before replaying locks) w/o
1953 * sending any RPCs or waiting for any
1954 * outstanding RPC to complete.
1956 * flags & LDLM_CANCEL_CLEANUP - when cancelling read locks, do not check for
1957 * other read locks covering the same pages, just
1958 * discard those pages.
1960 static int ldlm_prepare_lru_list(struct ldlm_namespace *ns,
1961 struct list_head *cancels, int count, int max,
1962 enum ldlm_lru_flags lru_flags)
1964 ldlm_cancel_lru_policy_t pf;
1966 int no_wait = lru_flags & LDLM_LRU_FLAG_NO_WAIT;
1970 if (!ns_connect_lru_resize(ns))
1971 count += ns->ns_nr_unused - ns->ns_max_unused;
1973 pf = ldlm_cancel_lru_policy(ns, lru_flags);
1974 LASSERT(pf != NULL);
1976 /* For any flags, stop scanning if @max is reached. */
1977 while (!list_empty(&ns->ns_unused_list) && (max == 0 || added < max)) {
1978 struct ldlm_lock *lock;
1979 struct list_head *item, *next;
1980 enum ldlm_policy_res result;
1981 ktime_t last_use = ktime_set(0, 0);
1983 spin_lock(&ns->ns_lock);
1984 item = no_wait ? ns->ns_last_pos : &ns->ns_unused_list;
1985 for (item = item->next, next = item->next;
1986 item != &ns->ns_unused_list;
1987 item = next, next = item->next) {
1988 lock = list_entry(item, struct ldlm_lock, l_lru);
1990 /* No locks which got blocking requests. */
1991 LASSERT(!ldlm_is_bl_ast(lock));
1993 if (!ldlm_is_canceling(lock) &&
1994 !ldlm_is_converting(lock))
1998 * Somebody is already doing CANCEL. No need for this
1999 * lock in LRU, do not traverse it again.
2001 ldlm_lock_remove_from_lru_nolock(lock);
2003 if (item == &ns->ns_unused_list) {
2004 spin_unlock(&ns->ns_lock);
2008 last_use = lock->l_last_used;
2010 LDLM_LOCK_GET(lock);
2011 spin_unlock(&ns->ns_lock);
2012 lu_ref_add(&lock->l_reference, __FUNCTION__, current);
2015 * Pass the lock through the policy filter and see if it
2016 * should stay in LRU.
2018 * Even for shrinker policy we stop scanning if
2019 * we find a lock that should stay in the cache.
2020 * We should take into account lock age anyway
2021 * as a new lock is a valuable resource even if
2022 * it has a low weight.
2024 * That is, for shrinker policy we drop only
2025 * old locks, but additionally choose them by
2026 * their weight. Big extent locks will stay in
2029 result = pf(ns, lock, ns->ns_nr_unused, added, count);
2030 if (result == LDLM_POLICY_KEEP_LOCK) {
2031 lu_ref_del(&lock->l_reference, __func__, current);
2032 LDLM_LOCK_RELEASE(lock);
2036 if (result == LDLM_POLICY_SKIP_LOCK) {
2037 lu_ref_del(&lock->l_reference, __func__, current);
2039 spin_lock(&ns->ns_lock);
2040 if (!list_empty(&lock->l_lru) &&
2041 lock->l_lru.prev == ns->ns_last_pos)
2042 ns->ns_last_pos = &lock->l_lru;
2043 spin_unlock(&ns->ns_lock);
2046 LDLM_LOCK_RELEASE(lock);
2050 lock_res_and_lock(lock);
2051 /* Check flags again under the lock. */
2052 if (ldlm_is_canceling(lock) || ldlm_is_converting(lock) ||
2053 ldlm_lock_remove_from_lru_check(lock, last_use) == 0) {
2055 * Another thread is removing lock from LRU, or
2056 * somebody is already doing CANCEL, or there
2057 * is a blocking request which will send cancel
2058 * by itself, or the lock is no longer unused or
2059 * the lock has been used since the pf() call and
2060 * pages could be put under it.
2062 unlock_res_and_lock(lock);
2063 lu_ref_del(&lock->l_reference, __FUNCTION__, current);
2064 LDLM_LOCK_RELEASE(lock);
2067 LASSERT(!lock->l_readers && !lock->l_writers);
2070 * If we have chosen to cancel this lock voluntarily, we
2071 * better send cancel notification to server, so that it
2072 * frees appropriate state. This might lead to a race
2073 * where while we are doing cancel here, server is also
2074 * silently cancelling this lock.
2076 ldlm_clear_cancel_on_block(lock);
2079 * Setting the CBPENDING flag is a little misleading,
2080 * but prevents an important race; namely, once
2081 * CBPENDING is set, the lock can accumulate no more
2082 * readers/writers. Since readers and writers are
2083 * already zero here, ldlm_lock_decref() won't see
2084 * this flag and call l_blocking_ast
2086 lock->l_flags |= LDLM_FL_CBPENDING | LDLM_FL_CANCELING;
2088 if ((lru_flags & LDLM_LRU_FLAG_CLEANUP) &&
2089 (lock->l_resource->lr_type == LDLM_EXTENT ||
2090 ldlm_has_dom(lock)) && lock->l_granted_mode == LCK_PR)
2091 ldlm_set_discard_data(lock);
2094 * We can't re-add to l_lru as it confuses the
2095 * refcounting in ldlm_lock_remove_from_lru() if an AST
2096 * arrives after we drop lr_lock below. We use l_bl_ast
2097 * and can't use l_pending_chain as it is used both on
2098 * server and client nevertheless b=5666 says it is
2099 * used only on server
2101 LASSERT(list_empty(&lock->l_bl_ast));
2102 list_add(&lock->l_bl_ast, cancels);
2103 unlock_res_and_lock(lock);
2104 lu_ref_del(&lock->l_reference, __FUNCTION__, current);
2110 int ldlm_cancel_lru_local(struct ldlm_namespace *ns, struct list_head *cancels,
2112 enum ldlm_cancel_flags cancel_flags,
2113 enum ldlm_lru_flags lru_flags)
2117 added = ldlm_prepare_lru_list(ns, cancels, count, max, lru_flags);
2121 return ldlm_cli_cancel_list_local(cancels, added, cancel_flags);
2125 * Cancel at least \a nr locks from given namespace LRU.
2127 * When called with LCF_ASYNC the blocking callback will be handled
2128 * in a thread and this function will return after the thread has been
2129 * asked to call the callback. When called with LCF_ASYNC the blocking
2130 * callback will be performed in this function.
2132 int ldlm_cancel_lru(struct ldlm_namespace *ns, int nr,
2133 enum ldlm_cancel_flags cancel_flags,
2134 enum ldlm_lru_flags lru_flags)
2136 struct list_head cancels = LIST_HEAD_INIT(cancels);
2142 * Just prepare the list of locks, do not actually cancel them yet.
2143 * Locks are cancelled later in a separate thread.
2145 count = ldlm_prepare_lru_list(ns, &cancels, nr, 0, lru_flags);
2146 rc = ldlm_bl_to_thread_list(ns, NULL, &cancels, count, cancel_flags);
2154 * Find and cancel locally unused locks found on resource, matched to the
2155 * given policy, mode. GET the found locks and add them into the \a cancels
2158 int ldlm_cancel_resource_local(struct ldlm_resource *res,
2159 struct list_head *cancels,
2160 union ldlm_policy_data *policy,
2161 enum ldlm_mode mode, __u64 lock_flags,
2162 enum ldlm_cancel_flags cancel_flags,
2165 struct ldlm_lock *lock;
2171 list_for_each_entry(lock, &res->lr_granted, l_res_link) {
2172 if (opaque != NULL && lock->l_ast_data != opaque) {
2173 LDLM_ERROR(lock, "data %p doesn't match opaque %p",
2174 lock->l_ast_data, opaque);
2178 if (lock->l_readers || lock->l_writers)
2182 * If somebody is already doing CANCEL, or blocking AST came,
2183 * or lock is being converted then skip this lock.
2185 if (ldlm_is_bl_ast(lock) || ldlm_is_canceling(lock) ||
2186 ldlm_is_converting(lock))
2189 if (lockmode_compat(lock->l_granted_mode, mode))
2193 * If policy is given and this is IBITS lock, add to list only
2194 * those locks that match by policy.
2195 * Skip locks with DoM bit always to don't flush data.
2197 if (policy && (lock->l_resource->lr_type == LDLM_IBITS) &&
2198 (!(lock->l_policy_data.l_inodebits.bits &
2199 policy->l_inodebits.bits) || ldlm_has_dom(lock)))
2202 /* See CBPENDING comment in ldlm_cancel_lru */
2203 lock->l_flags |= LDLM_FL_CBPENDING | LDLM_FL_CANCELING |
2206 LASSERT(list_empty(&lock->l_bl_ast));
2207 list_add(&lock->l_bl_ast, cancels);
2208 LDLM_LOCK_GET(lock);
2213 RETURN(ldlm_cli_cancel_list_local(cancels, count, cancel_flags));
2215 EXPORT_SYMBOL(ldlm_cancel_resource_local);
2218 * Cancel client-side locks from a list and send/prepare cancel RPCs to the
2220 * If \a req is NULL, send CANCEL request to server with handles of locks
2221 * in the \a cancels. If EARLY_CANCEL is not supported, send CANCEL requests
2222 * separately per lock.
2223 * If \a req is not NULL, put handles of locks in \a cancels into the request
2224 * buffer at the offset \a off.
2225 * Destroy \a cancels at the end.
2227 int ldlm_cli_cancel_list(struct list_head *cancels, int count,
2228 struct ptlrpc_request *req,
2229 enum ldlm_cancel_flags flags)
2231 struct ldlm_lock *lock;
2236 if (list_empty(cancels) || count == 0)
2240 * XXX: requests (both batched and not) could be sent in parallel.
2241 * Usually it is enough to have just 1 RPC, but it is possible that
2242 * there are too many locks to be cancelled in LRU or on a resource.
2243 * It would also speed up the case when the server does not support
2247 LASSERT(!list_empty(cancels));
2248 lock = list_entry(cancels->next, struct ldlm_lock,
2250 LASSERT(lock->l_conn_export);
2252 if (exp_connect_cancelset(lock->l_conn_export)) {
2255 ldlm_cancel_pack(req, cancels, count);
2257 res = ldlm_cli_cancel_req(lock->l_conn_export,
2261 res = ldlm_cli_cancel_req(lock->l_conn_export,
2266 CDEBUG_LIMIT(res == -ESHUTDOWN ? D_DLMTRACE : D_ERROR,
2267 "ldlm_cli_cancel_list: %d\n", res);
2272 ldlm_lock_list_put(cancels, l_bl_ast, res);
2274 LASSERT(count == 0);
2277 EXPORT_SYMBOL(ldlm_cli_cancel_list);
2280 * Cancel all locks on a resource that have 0 readers/writers.
2282 * If flags & LDLM_FL_LOCAL_ONLY, throw the locks away without trying
2283 * to notify the server.
2285 int ldlm_cli_cancel_unused_resource(struct ldlm_namespace *ns,
2286 const struct ldlm_res_id *res_id,
2287 union ldlm_policy_data *policy,
2288 enum ldlm_mode mode,
2289 enum ldlm_cancel_flags flags, void *opaque)
2291 struct ldlm_resource *res;
2292 struct list_head cancels = LIST_HEAD_INIT(cancels);
2298 res = ldlm_resource_get(ns, NULL, res_id, 0, 0);
2300 /* This is not a problem. */
2301 CDEBUG(D_INFO, "No resource %llu\n", res_id->name[0]);
2305 LDLM_RESOURCE_ADDREF(res);
2306 count = ldlm_cancel_resource_local(res, &cancels, policy, mode,
2307 0, flags | LCF_BL_AST, opaque);
2308 rc = ldlm_cli_cancel_list(&cancels, count, NULL, flags);
2310 CERROR("canceling unused lock "DLDLMRES": rc = %d\n",
2313 LDLM_RESOURCE_DELREF(res);
2314 ldlm_resource_putref(res);
2317 EXPORT_SYMBOL(ldlm_cli_cancel_unused_resource);
2319 struct ldlm_cli_cancel_arg {
2325 ldlm_cli_hash_cancel_unused(struct cfs_hash *hs, struct cfs_hash_bd *bd,
2326 struct hlist_node *hnode, void *arg)
2328 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
2329 struct ldlm_cli_cancel_arg *lc = arg;
2331 ldlm_cli_cancel_unused_resource(ldlm_res_to_ns(res), &res->lr_name,
2332 NULL, LCK_MINMODE, lc->lc_flags,
2334 /* must return 0 for hash iteration */
2339 * Cancel all locks on a namespace (or a specific resource, if given)
2340 * that have 0 readers/writers.
2342 * If flags & LCF_LOCAL, throw the locks away without trying
2343 * to notify the server.
2345 int ldlm_cli_cancel_unused(struct ldlm_namespace *ns,
2346 const struct ldlm_res_id *res_id,
2347 enum ldlm_cancel_flags flags, void *opaque)
2349 struct ldlm_cli_cancel_arg arg = {
2351 .lc_opaque = opaque,
2359 if (res_id != NULL) {
2360 RETURN(ldlm_cli_cancel_unused_resource(ns, res_id, NULL,
2364 cfs_hash_for_each_nolock(ns->ns_rs_hash,
2365 ldlm_cli_hash_cancel_unused, &arg, 0);
2370 /* Lock iterators. */
2372 int ldlm_resource_foreach(struct ldlm_resource *res, ldlm_iterator_t iter,
2375 struct list_head *tmp, *next;
2376 struct ldlm_lock *lock;
2377 int rc = LDLM_ITER_CONTINUE;
2382 RETURN(LDLM_ITER_CONTINUE);
2385 list_for_each_safe(tmp, next, &res->lr_granted) {
2386 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
2388 if (iter(lock, closure) == LDLM_ITER_STOP)
2389 GOTO(out, rc = LDLM_ITER_STOP);
2392 list_for_each_safe(tmp, next, &res->lr_waiting) {
2393 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
2395 if (iter(lock, closure) == LDLM_ITER_STOP)
2396 GOTO(out, rc = LDLM_ITER_STOP);
2403 struct iter_helper_data {
2404 ldlm_iterator_t iter;
2408 static int ldlm_iter_helper(struct ldlm_lock *lock, void *closure)
2410 struct iter_helper_data *helper = closure;
2412 return helper->iter(lock, helper->closure);
2415 static int ldlm_res_iter_helper(struct cfs_hash *hs, struct cfs_hash_bd *bd,
2416 struct hlist_node *hnode, void *arg)
2419 struct ldlm_resource *res = cfs_hash_object(hs, hnode);
2421 return ldlm_resource_foreach(res, ldlm_iter_helper, arg) ==
2425 void ldlm_namespace_foreach(struct ldlm_namespace *ns,
2426 ldlm_iterator_t iter, void *closure)
2429 struct iter_helper_data helper = { .iter = iter, .closure = closure };
2431 cfs_hash_for_each_nolock(ns->ns_rs_hash,
2432 ldlm_res_iter_helper, &helper, 0);
2437 * non-blocking function to manipulate a lock whose cb_data is being put away.
2438 * return 0: find no resource
2439 * > 0: must be LDLM_ITER_STOP/LDLM_ITER_CONTINUE.
2442 int ldlm_resource_iterate(struct ldlm_namespace *ns,
2443 const struct ldlm_res_id *res_id,
2444 ldlm_iterator_t iter, void *data)
2446 struct ldlm_resource *res;
2451 LASSERTF(ns != NULL, "must pass in namespace\n");
2453 res = ldlm_resource_get(ns, NULL, res_id, 0, 0);
2457 LDLM_RESOURCE_ADDREF(res);
2458 rc = ldlm_resource_foreach(res, iter, data);
2459 LDLM_RESOURCE_DELREF(res);
2460 ldlm_resource_putref(res);
2463 EXPORT_SYMBOL(ldlm_resource_iterate);
2466 static int ldlm_chain_lock_for_replay(struct ldlm_lock *lock, void *closure)
2468 struct list_head *list = closure;
2470 /* we use l_pending_chain here, because it's unused on clients. */
2471 LASSERTF(list_empty(&lock->l_pending_chain),
2472 "lock %p next %p prev %p\n",
2473 lock, &lock->l_pending_chain.next,
2474 &lock->l_pending_chain.prev);
2476 * b=9573: don't replay locks left after eviction, or
2477 * b=17614: locks being actively cancelled. Get a reference
2478 * on a lock so that it does not disapear under us (e.g. due to cancel)
2480 if (!(lock->l_flags & (LDLM_FL_FAILED|LDLM_FL_BL_DONE))) {
2481 list_add(&lock->l_pending_chain, list);
2482 LDLM_LOCK_GET(lock);
2485 return LDLM_ITER_CONTINUE;
2488 static int replay_lock_interpret(const struct lu_env *env,
2489 struct ptlrpc_request *req, void *args, int rc)
2491 struct ldlm_async_args *aa = args;
2492 struct ldlm_lock *lock;
2493 struct ldlm_reply *reply;
2494 struct obd_export *exp;
2497 atomic_dec(&req->rq_import->imp_replay_inflight);
2501 reply = req_capsule_server_get(&req->rq_pill, &RMF_DLM_REP);
2503 GOTO(out, rc = -EPROTO);
2505 lock = ldlm_handle2lock(&aa->lock_handle);
2507 CERROR("received replay ack for unknown local cookie %#llx remote cookie %#llx from server %s id %s\n",
2508 aa->lock_handle.cookie, reply->lock_handle.cookie,
2509 req->rq_export->exp_client_uuid.uuid,
2510 libcfs_id2str(req->rq_peer));
2511 GOTO(out, rc = -ESTALE);
2514 /* Key change rehash lock in per-export hash with new key */
2515 exp = req->rq_export;
2516 if (exp && exp->exp_lock_hash) {
2518 * In the function below, .hs_keycmp resolves to
2519 * ldlm_export_lock_keycmp()
2521 /* coverity[overrun-buffer-val] */
2522 cfs_hash_rehash_key(exp->exp_lock_hash,
2523 &lock->l_remote_handle,
2524 &reply->lock_handle,
2527 lock->l_remote_handle = reply->lock_handle;
2530 LDLM_DEBUG(lock, "replayed lock:");
2531 ptlrpc_import_recovery_state_machine(req->rq_import);
2532 LDLM_LOCK_PUT(lock);
2535 ptlrpc_connect_import(req->rq_import);
2540 static int replay_one_lock(struct obd_import *imp, struct ldlm_lock *lock)
2542 struct ptlrpc_request *req;
2543 struct ldlm_async_args *aa;
2544 struct ldlm_request *body;
2550 /* b=11974: Do not replay a lock which is actively being canceled */
2551 if (ldlm_is_bl_done(lock)) {
2552 LDLM_DEBUG(lock, "Not replaying canceled lock:");
2557 * If this is reply-less callback lock, we cannot replay it, since
2558 * server might have long dropped it, but notification of that event was
2559 * lost by network. (and server granted conflicting lock already)
2561 if (ldlm_is_cancel_on_block(lock)) {
2562 LDLM_DEBUG(lock, "Not replaying reply-less lock:");
2563 ldlm_lock_cancel(lock);
2568 * If granted mode matches the requested mode, this lock is granted.
2570 * If we haven't been granted anything and are on a resource list,
2571 * then we're blocked/waiting.
2573 * If we haven't been granted anything and we're NOT on a resource list,
2574 * then we haven't got a reply yet and don't have a known disposition.
2575 * This happens whenever a lock enqueue is the request that triggers
2578 if (ldlm_is_granted(lock))
2579 flags = LDLM_FL_REPLAY | LDLM_FL_BLOCK_GRANTED;
2580 else if (!list_empty(&lock->l_res_link))
2581 flags = LDLM_FL_REPLAY | LDLM_FL_BLOCK_WAIT;
2583 flags = LDLM_FL_REPLAY;
2585 req = ptlrpc_request_alloc_pack(imp, &RQF_LDLM_ENQUEUE,
2586 LUSTRE_DLM_VERSION, LDLM_ENQUEUE);
2590 /* We're part of recovery, so don't wait for it. */
2591 req->rq_send_state = LUSTRE_IMP_REPLAY_LOCKS;
2593 body = req_capsule_client_get(&req->rq_pill, &RMF_DLM_REQ);
2594 ldlm_lock2desc(lock, &body->lock_desc);
2595 body->lock_flags = ldlm_flags_to_wire(flags);
2597 ldlm_lock2handle(lock, &body->lock_handle[0]);
2598 if (lock->l_lvb_len > 0)
2599 req_capsule_extend(&req->rq_pill, &RQF_LDLM_ENQUEUE_LVB);
2600 req_capsule_set_size(&req->rq_pill, &RMF_DLM_LVB, RCL_SERVER,
2602 ptlrpc_request_set_replen(req);
2604 * notify the server we've replayed all requests.
2605 * also, we mark the request to be put on a dedicated
2606 * queue to be processed after all request replayes.
2609 lustre_msg_set_flags(req->rq_reqmsg, MSG_REQ_REPLAY_DONE);
2611 LDLM_DEBUG(lock, "replaying lock:");
2613 atomic_inc(&req->rq_import->imp_replay_inflight);
2614 CLASSERT(sizeof(*aa) <= sizeof(req->rq_async_args));
2615 aa = ptlrpc_req_async_args(req);
2616 aa->lock_handle = body->lock_handle[0];
2617 req->rq_interpret_reply = replay_lock_interpret;
2618 ptlrpcd_add_req(req);
2624 * Cancel as many unused locks as possible before replay. since we are
2625 * in recovery, we can't wait for any outstanding RPCs to send any RPC
2628 * Called only in recovery before replaying locks. there is no need to
2629 * replay locks that are unused. since the clients may hold thousands of
2630 * cached unused locks, dropping the unused locks can greatly reduce the
2631 * load on the servers at recovery time.
2633 static void ldlm_cancel_unused_locks_for_replay(struct ldlm_namespace *ns)
2636 struct list_head cancels = LIST_HEAD_INIT(cancels);
2639 "Dropping as many unused locks as possible before replay for namespace %s (%d)\n",
2640 ldlm_ns_name(ns), ns->ns_nr_unused);
2643 * We don't need to care whether or not LRU resize is enabled
2644 * because the LDLM_LRU_FLAG_NO_WAIT policy doesn't use the
2647 canceled = ldlm_cancel_lru_local(ns, &cancels, ns->ns_nr_unused, 0,
2648 LCF_LOCAL, LDLM_LRU_FLAG_NO_WAIT);
2650 CDEBUG(D_DLMTRACE, "Canceled %d unused locks from namespace %s\n",
2651 canceled, ldlm_ns_name(ns));
2654 int ldlm_replay_locks(struct obd_import *imp)
2656 struct ldlm_namespace *ns = imp->imp_obd->obd_namespace;
2657 struct list_head list = LIST_HEAD_INIT(list);
2658 struct ldlm_lock *lock, *next;
2663 LASSERT(atomic_read(&imp->imp_replay_inflight) == 0);
2665 /* don't replay locks if import failed recovery */
2666 if (imp->imp_vbr_failed)
2669 /* ensure this doesn't fall to 0 before all have been queued */
2670 atomic_inc(&imp->imp_replay_inflight);
2672 if (ldlm_cancel_unused_locks_before_replay)
2673 ldlm_cancel_unused_locks_for_replay(ns);
2675 ldlm_namespace_foreach(ns, ldlm_chain_lock_for_replay, &list);
2677 list_for_each_entry_safe(lock, next, &list, l_pending_chain) {
2678 list_del_init(&lock->l_pending_chain);
2680 LDLM_LOCK_RELEASE(lock);
2681 continue; /* or try to do the rest? */
2683 rc = replay_one_lock(imp, lock);
2684 LDLM_LOCK_RELEASE(lock);
2687 atomic_dec(&imp->imp_replay_inflight);