-
Oleg Drokin authoredr=nikita,shadow Do not replay locks that are being cancelled. Do not reference locks by their address during replay, just by their handle.
Oleg Drokin authoredr=nikita,shadow Do not replay locks that are being cancelled. Do not reference locks by their address during replay, just by their handle.
ldlm_request.c 61.68 KiB
/* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
* vim:expandtab:shiftwidth=8:tabstop=8:
*
* Copyright (C) 2002, 2003 Cluster File Systems, Inc.
*
* This file is part of the Lustre file system, http://www.lustre.org
* Lustre is a trademark of Cluster File Systems, Inc.
*
* You may have signed or agreed to another license before downloading
* this software. If so, you are bound by the terms and conditions
* of that agreement, and the following does not apply to you. See the
* LICENSE file included with this distribution for more information.
*
* If you did not agree to a different license, then this copy of Lustre
* is open source software; you can redistribute it and/or modify it
* under the terms of version 2 of the GNU General Public License as
* published by the Free Software Foundation.
*
* In either case, Lustre is distributed in the hope that it will be
* useful, but WITHOUT ANY WARRANTY; without even the implied warranty
* of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* license text for more details.
*/
#define DEBUG_SUBSYSTEM S_LDLM
#ifndef __KERNEL__
#include <signal.h>
#include <liblustre.h>
#endif
#include <lustre_dlm.h>
#include <obd_class.h>
#include <obd.h>
#include "ldlm_internal.h"
static void interrupted_completion_wait(void *data)
{
}
struct lock_wait_data {
struct ldlm_lock *lwd_lock;
__u32 lwd_conn_cnt;
};
struct ldlm_async_args {
struct lustre_handle lock_handle;
};
int ldlm_expired_completion_wait(void *data)
{
struct lock_wait_data *lwd = data;
struct ldlm_lock *lock = lwd->lwd_lock;
struct obd_import *imp;
struct obd_device *obd;
ENTRY;
if (lock->l_conn_export == NULL) {
static cfs_time_t next_dump = 0, last_dump = 0;
if (ptlrpc_check_suspend())
RETURN(0);
LDLM_ERROR(lock, "lock timed out (enqueued at %lu, %lus ago); "
"not entering recovery in server code, just going "
"back to sleep", lock->l_enqueued_time.tv_sec,
CURRENT_SECONDS - lock->l_enqueued_time.tv_sec);
if (cfs_time_after(cfs_time_current(), next_dump)) {
last_dump = next_dump;
next_dump = cfs_time_shift(300); ldlm_namespace_dump(D_DLMTRACE,
lock->l_resource->lr_namespace);
if (last_dump == 0)
libcfs_debug_dumplog();
}
RETURN(0);
}
obd = lock->l_conn_export->exp_obd;
imp = obd->u.cli.cl_import;
ptlrpc_fail_import(imp, lwd->lwd_conn_cnt);
LDLM_ERROR(lock, "lock timed out (enqueued at %lu, %lus ago), entering "
"recovery for %s@%s", lock->l_enqueued_time.tv_sec,
CURRENT_SECONDS - lock->l_enqueued_time.tv_sec,
obd2cli_tgt(obd), imp->imp_connection->c_remote_uuid.uuid);
RETURN(0);
}
int ldlm_completion_ast(struct ldlm_lock *lock, int flags, void *data)
{
/* XXX ALLOCATE - 160 bytes */
struct lock_wait_data lwd;
struct obd_device *obd;
struct obd_import *imp = NULL;
struct l_wait_info lwi;
int rc = 0;
ENTRY;
if (flags == LDLM_FL_WAIT_NOREPROC) {
LDLM_DEBUG(lock, "client-side enqueue waiting on pending lock");
goto noreproc;
}
if (!(flags & (LDLM_FL_BLOCK_WAIT | LDLM_FL_BLOCK_GRANTED |
LDLM_FL_BLOCK_CONV))) {
cfs_waitq_signal(&lock->l_waitq);
RETURN(0);
}
LDLM_DEBUG(lock, "client-side enqueue returned a blocked lock, "
"sleeping");
ldlm_lock_dump(D_OTHER, lock, 0);
ldlm_reprocess_all(lock->l_resource);
noreproc:
obd = class_exp2obd(lock->l_conn_export);
/* if this is a local lock, then there is no import */
if (obd != NULL)
imp = obd->u.cli.cl_import;
lwd.lwd_lock = lock;
if (lock->l_flags & LDLM_FL_NO_TIMEOUT) {
LDLM_DEBUG(lock, "waiting indefinitely because of NO_TIMEOUT");
lwi = LWI_INTR(interrupted_completion_wait, &lwd);
} else {
lwi = LWI_TIMEOUT_INTR(cfs_time_seconds(obd_timeout),
ldlm_expired_completion_wait,
interrupted_completion_wait, &lwd);
}
if (imp != NULL) {
spin_lock(&imp->imp_lock);
lwd.lwd_conn_cnt = imp->imp_conn_cnt;
spin_unlock(&imp->imp_lock);
}
/* Go to sleep until the lock is granted or cancelled. */
rc = l_wait_event(lock->l_waitq,
((lock->l_req_mode == lock->l_granted_mode) ||
(lock->l_flags & LDLM_FL_FAILED)), &lwi);
if (lock->l_destroyed || lock->l_flags & LDLM_FL_FAILED) {
LDLM_DEBUG(lock, "client-side enqueue waking up: destroyed");
RETURN(-EIO);
}
if (rc) {
LDLM_DEBUG(lock, "client-side enqueue waking up: failed (%d)",
rc);
RETURN(rc);
}
LDLM_DEBUG(lock, "client-side enqueue waking up: granted");
RETURN(0);
}
/*
* ->l_blocking_ast() callback for LDLM locks acquired by server-side OBDs.
*/
int ldlm_blocking_ast(struct ldlm_lock *lock, struct ldlm_lock_desc *desc,
void *data, int flag)
{
int do_ast;
ENTRY;
if (flag == LDLM_CB_CANCELING) {
/* Don't need to do anything here. */
RETURN(0);
}
lock_res_and_lock(lock);
/* Get this: if ldlm_blocking_ast is racing with intent_policy, such
* that ldlm_blocking_ast is called just before intent_policy method
* takes the ns_lock, then by the time we get the lock, we might not
* be the correct blocking function anymore. So check, and return
* early, if so. */
if (lock->l_blocking_ast != ldlm_blocking_ast) {
unlock_res_and_lock(lock);
RETURN(0);
}
lock->l_flags |= LDLM_FL_CBPENDING;
do_ast = (!lock->l_readers && !lock->l_writers);
unlock_res_and_lock(lock);
if (do_ast) {
struct lustre_handle lockh;
int rc;
LDLM_DEBUG(lock, "already unused, calling ldlm_cli_cancel");
ldlm_lock2handle(lock, &lockh);
rc = ldlm_cli_cancel(&lockh);
if (rc < 0)
CERROR("ldlm_cli_cancel: %d\n", rc);
} else {
LDLM_DEBUG(lock, "Lock still has references, will be "
"cancelled later");
}
RETURN(0);
}
/*
* ->l_glimpse_ast() for DLM extent locks acquired on the server-side. See
* comment in filter_intent_policy() on why you may need this.
*/
int ldlm_glimpse_ast(struct ldlm_lock *lock, void *reqp){
/*
* Returning -ELDLM_NO_LOCK_DATA actually works, but the reason for
* that is rather subtle: with OST-side locking, it may so happen that
* _all_ extent locks are held by the OST. If client wants to obtain
* current file size it calls ll{,u}_glimpse_size(), and (as locks are
* on the server), dummy glimpse callback fires and does
* nothing. Client still receives correct file size due to the
* following fragment in filter_intent_policy():
*
* rc = l->l_glimpse_ast(l, NULL); // this will update the LVB
* if (rc != 0 && res->lr_namespace->ns_lvbo &&
* res->lr_namespace->ns_lvbo->lvbo_update) {
* res->lr_namespace->ns_lvbo->lvbo_update(res, NULL, 0, 1);
* }
*
* that is, after glimpse_ast() fails, filter_lvbo_update() runs, and
* returns correct file size to the client.
*/
return -ELDLM_NO_LOCK_DATA;
}
int ldlm_cli_enqueue_local(struct ldlm_namespace *ns,
const struct ldlm_res_id *res_id,
ldlm_type_t type, ldlm_policy_data_t *policy,
ldlm_mode_t mode, int *flags,
ldlm_blocking_callback blocking,
ldlm_completion_callback completion,
ldlm_glimpse_callback glimpse,
void *data, __u32 lvb_len, void *lvb_swabber,
struct lustre_handle *lockh)
{
struct ldlm_lock *lock;
int err;
ENTRY;
LASSERT(!(*flags & LDLM_FL_REPLAY));
if (unlikely(ns->ns_client)) {
CERROR("Trying to enqueue local lock in a shadow namespace\n");
LBUG();
}
lock = ldlm_lock_create(ns, res_id, type, mode, blocking,
completion, glimpse, data, lvb_len);
if (unlikely(!lock))
GOTO(out_nolock, err = -ENOMEM);
LDLM_DEBUG(lock, "client-side local enqueue handler, new lock created");
ldlm_lock_addref_internal(lock, mode);
ldlm_lock2handle(lock, lockh);
lock_res_and_lock(lock);
lock->l_flags |= LDLM_FL_LOCAL;
if (*flags & LDLM_FL_ATOMIC_CB)
lock->l_flags |= LDLM_FL_ATOMIC_CB;
lock->l_lvb_swabber = lvb_swabber;
unlock_res_and_lock(lock);
if (policy != NULL)
lock->l_policy_data = *policy;
if (type == LDLM_EXTENT)
lock->l_req_extent = policy->l_extent;
err = ldlm_lock_enqueue(ns, &lock, policy, flags);
if (unlikely(err != ELDLM_OK))
GOTO(out, err);
if (policy != NULL)
*policy = lock->l_policy_data;
LDLM_DEBUG_NOLOCK("client-side local enqueue handler END (lock %p)",
lock);
if (lock->l_completion_ast)
lock->l_completion_ast(lock, *flags, NULL);
LDLM_DEBUG(lock, "client-side local enqueue END");
EXIT;
out:
LDLM_LOCK_PUT(lock);
out_nolock:
return err;
}
static void failed_lock_cleanup(struct ldlm_namespace *ns,
struct ldlm_lock *lock,
struct lustre_handle *lockh, int mode)
{
/* Set a flag to prevent us from sending a CANCEL (bug 407) */
lock_res_and_lock(lock);
lock->l_flags |= LDLM_FL_LOCAL_ONLY;
unlock_res_and_lock(lock);
LDLM_DEBUG(lock, "setting FL_LOCAL_ONLY");
ldlm_lock_decref_and_cancel(lockh, mode);
/* XXX - HACK because we shouldn't call ldlm_lock_destroy()
* from llite/file.c/ll_file_flock(). */
if (lock->l_resource->lr_type == LDLM_FLOCK) {
ldlm_lock_destroy(lock);
}
}
int ldlm_cli_enqueue_fini(struct obd_export *exp, struct ptlrpc_request *req,
ldlm_type_t type, __u8 with_policy, ldlm_mode_t mode,
int *flags, void *lvb, __u32 lvb_len,
void *lvb_swabber, struct lustre_handle *lockh,int rc)
{
struct ldlm_namespace *ns = exp->exp_obd->obd_namespace;
int is_replay = *flags & LDLM_FL_REPLAY;
struct ldlm_lock *lock;
struct ldlm_reply *reply;
int cleanup_phase = 1;
ENTRY;
lock = ldlm_handle2lock(lockh);
/* ldlm_cli_enqueue is holding a reference on this lock. */
LASSERT(lock != NULL);
if (rc != ELDLM_OK) {
LASSERT(!is_replay);
LDLM_DEBUG(lock, "client-side enqueue END (%s)",
rc == ELDLM_LOCK_ABORTED ? "ABORTED" : "FAILED");
if (rc == ELDLM_LOCK_ABORTED) {
/* Before we return, swab the reply */
reply = lustre_swab_repbuf(req, DLM_LOCKREPLY_OFF,
sizeof(*reply),
lustre_swab_ldlm_reply);
if (reply == NULL) {
CERROR("Can't unpack ldlm_reply\n");
rc = -EPROTO;
}
if (lvb_len) {
void *tmplvb;
tmplvb = lustre_swab_repbuf(req,
DLM_REPLY_REC_OFF,
lvb_len,
lvb_swabber);
if (tmplvb == NULL)
GOTO(cleanup, rc = -EPROTO);
if (lvb != NULL)
memcpy(lvb, tmplvb, lvb_len);
} }
GOTO(cleanup, rc);
}
reply = lustre_swab_repbuf(req, DLM_LOCKREPLY_OFF, sizeof(*reply),
lustre_swab_ldlm_reply);
if (reply == NULL) {
CERROR("Can't unpack ldlm_reply\n");
GOTO(cleanup, rc = -EPROTO);
}
/* lock enqueued on the server */
cleanup_phase = 0;
lock_res_and_lock(lock);
lock->l_remote_handle = reply->lock_handle;
*flags = reply->lock_flags;
lock->l_flags |= reply->lock_flags & LDLM_INHERIT_FLAGS;
/* move NO_TIMEOUT flag to the lock to force ldlm_lock_match()
* to wait with no timeout as well */
lock->l_flags |= reply->lock_flags & LDLM_FL_NO_TIMEOUT;
unlock_res_and_lock(lock);
CDEBUG(D_INFO, "local: %p, remote cookie: "LPX64", flags: 0x%x\n",
lock, reply->lock_handle.cookie, *flags);
/* If enqueue returned a blocked lock but the completion handler has
* already run, then it fixed up the resource and we don't need to do it
* again. */
if ((*flags) & LDLM_FL_LOCK_CHANGED) {
int newmode = reply->lock_desc.l_req_mode;
LASSERT(!is_replay);
if (newmode && newmode != lock->l_req_mode) {
LDLM_DEBUG(lock, "server returned different mode %s",
ldlm_lockname[newmode]);
lock->l_req_mode = newmode;
}
if (memcmp(reply->lock_desc.l_resource.lr_name.name,
lock->l_resource->lr_name.name,
sizeof(struct ldlm_res_id))) {
CDEBUG(D_INFO, "remote intent success, locking "
"(%ld,%ld,%ld) instead of "
"(%ld,%ld,%ld)\n",
(long)reply->lock_desc.l_resource.lr_name.name[0],
(long)reply->lock_desc.l_resource.lr_name.name[1],
(long)reply->lock_desc.l_resource.lr_name.name[2],
(long)lock->l_resource->lr_name.name[0],
(long)lock->l_resource->lr_name.name[1],
(long)lock->l_resource->lr_name.name[2]);
ldlm_lock_change_resource(ns, lock,
&reply->lock_desc.l_resource.lr_name);
if (lock->l_resource == NULL) {
LBUG();
GOTO(cleanup, rc = -ENOMEM);
}
LDLM_DEBUG(lock, "client-side enqueue, new resource");
}
if (with_policy)
if (!(type == LDLM_IBITS && !(exp->exp_connect_flags &
OBD_CONNECT_IBITS)))
lock->l_policy_data =
reply->lock_desc.l_policy_data;
if (type != LDLM_PLAIN)
LDLM_DEBUG(lock,"client-side enqueue, new policy data");
}
if ((*flags) & LDLM_FL_AST_SENT ||
/* Cancel extent locks as soon as possible on a liblustre client, * because it cannot handle asynchronous ASTs robustly (see
* bug 7311). */
(LIBLUSTRE_CLIENT && type == LDLM_EXTENT)) {
lock_res_and_lock(lock);
lock->l_flags |= LDLM_FL_CBPENDING;
unlock_res_and_lock(lock);
LDLM_DEBUG(lock, "enqueue reply includes blocking AST");
}
/* If the lock has already been granted by a completion AST, don't
* clobber the LVB with an older one. */
if (lvb_len && (lock->l_req_mode != lock->l_granted_mode)) {
void *tmplvb;
tmplvb = lustre_swab_repbuf(req, DLM_REPLY_REC_OFF, lvb_len,
lvb_swabber);
if (tmplvb == NULL)
GOTO(cleanup, rc = -EPROTO);
memcpy(lock->l_lvb_data, tmplvb, lvb_len);
}
if (!is_replay) {
rc = ldlm_lock_enqueue(ns, &lock, NULL, flags);
if (lock->l_completion_ast != NULL) {
int err = lock->l_completion_ast(lock, *flags, NULL);
if (!rc)
rc = err;
if (rc && type != LDLM_FLOCK) /* bug 9425, bug 10250 */
cleanup_phase = 1;
}
}
if (lvb_len && lvb != NULL) {
/* Copy the LVB here, and not earlier, because the completion
* AST (if any) can override what we got in the reply */
memcpy(lvb, lock->l_lvb_data, lvb_len);
}
LDLM_DEBUG(lock, "client-side enqueue END");
EXIT;
cleanup:
if (cleanup_phase == 1 && rc)
failed_lock_cleanup(ns, lock, lockh, mode);
/* Put lock 2 times, the second reference is held by ldlm_cli_enqueue */
LDLM_LOCK_PUT(lock);
LDLM_LOCK_PUT(lock);
return rc;
}
/* PAGE_SIZE-512 is to allow TCP/IP and LNET headers to fit into
* a single page on the send/receive side. XXX: 512 should be changed
* to more adequate value. */
#define ldlm_req_handles_avail(exp, size, bufcount, off) \
({ \
int _avail = min_t(int, LDLM_MAXREQSIZE, PAGE_SIZE - 512); \
int _s = size[DLM_LOCKREQ_OFF]; \
size[DLM_LOCKREQ_OFF] = sizeof(struct ldlm_request); \
_avail -= lustre_msg_size(class_exp2cliimp(exp)->imp_msg_magic, \
bufcount, size); \
_avail /= sizeof(struct lustre_handle); \
_avail += LDLM_LOCKREQ_HANDLES - off; \
size[DLM_LOCKREQ_OFF] = _s; \
_avail; \
})
/* Cancel lru locks and pack them into the enqueue request. Pack there the given
* @count locks in @cancel. */
struct ptlrpc_request *ldlm_prep_enqueue_req(struct obd_export *exp,
int bufcount, int *size,
struct list_head *cancels,
int count){
struct ldlm_namespace *ns = exp->exp_obd->obd_namespace;
struct ldlm_request *dlm = NULL;
struct ptlrpc_request *req;
CFS_LIST_HEAD(head);
ENTRY;
if (cancels == NULL)
cancels = &head;
if (exp_connect_cancelset(exp)) {
/* Estimate the amount of available space in the request. */
int avail = ldlm_req_handles_avail(exp, size, bufcount,
LDLM_ENQUEUE_CANCEL_OFF);
LASSERT(avail >= count);
/* Cancel lru locks here _only_ if the server supports
* EARLY_CANCEL. Otherwise we have to send extra CANCEL
* rpc right on enqueue, what will make it slower, vs.
* asynchronous rpc in blocking thread. */
count += ldlm_cancel_lru_local(ns, cancels, 1, avail - count,
LDLM_CANCEL_AGED);
size[DLM_LOCKREQ_OFF] =
ldlm_request_bufsize(count, LDLM_ENQUEUE);
}
req = ptlrpc_prep_req(class_exp2cliimp(exp), LUSTRE_DLM_VERSION,
LDLM_ENQUEUE, bufcount, size, NULL);
if (exp_connect_cancelset(exp) && req) {
dlm = lustre_msg_buf(req->rq_reqmsg,
DLM_LOCKREQ_OFF, sizeof(*dlm));
/* Skip first lock handler in ldlm_request_pack(), this method
* will incrment @lock_count according to the lock handle amount
* actually written to the buffer. */
dlm->lock_count = LDLM_ENQUEUE_CANCEL_OFF;
ldlm_cli_cancel_list(cancels, count, req, DLM_LOCKREQ_OFF, 0);
} else {
ldlm_lock_list_put(cancels, l_bl_ast, count);
}
RETURN(req);
}
/* If a request has some specific initialisation it is passed in @reqp,
* otherwise it is created in ldlm_cli_enqueue.
*
* Supports sync and async requests, pass @async flag accordingly. If a
* request was created in ldlm_cli_enqueue and it is the async request,
* pass it to the caller in @reqp. */
int ldlm_cli_enqueue(struct obd_export *exp, struct ptlrpc_request **reqp,
const struct ldlm_res_id *res_id,
ldlm_type_t type, ldlm_policy_data_t *policy,
ldlm_mode_t mode, int *flags,
ldlm_blocking_callback blocking,
ldlm_completion_callback completion,
ldlm_glimpse_callback glimpse,
void *data, void *lvb, __u32 lvb_len, void *lvb_swabber,
struct lustre_handle *lockh, int async)
{
struct ldlm_namespace *ns = exp->exp_obd->obd_namespace;
struct ldlm_lock *lock;
struct ldlm_request *body;
struct ldlm_reply *reply;
int size[3] = { [MSG_PTLRPC_BODY_OFF] = sizeof(struct ptlrpc_body),
[DLM_LOCKREQ_OFF] = sizeof(*body),
[DLM_REPLY_REC_OFF] = lvb_len };
int is_replay = *flags & LDLM_FL_REPLAY;
int req_passed_in = 1, rc;
struct ptlrpc_request *req;
ENTRY;
LASSERT(exp != NULL);
/* If we're replaying this lock, just check some invariants.
* If we're creating a new lock, get everything all setup nice. */
if (is_replay) {
lock = ldlm_handle2lock(lockh);
LASSERT(lock != NULL);
LDLM_DEBUG(lock, "client-side enqueue START");
LASSERT(exp == lock->l_conn_export);
} else {
lock = ldlm_lock_create(ns, res_id, type, mode, blocking,
completion, glimpse, data, lvb_len);
if (lock == NULL)
RETURN(-ENOMEM);
/* for the local lock, add the reference */
ldlm_lock_addref_internal(lock, mode);
ldlm_lock2handle(lock, lockh);
lock->l_lvb_swabber = lvb_swabber;
if (policy != NULL) {
/* INODEBITS_INTEROP: If the server does not support
* inodebits, we will request a plain lock in the
* descriptor (ldlm_lock2desc() below) but use an
* inodebits lock internally with both bits set.
*/
if (type == LDLM_IBITS && !(exp->exp_connect_flags &
OBD_CONNECT_IBITS))
lock->l_policy_data.l_inodebits.bits =
MDS_INODELOCK_LOOKUP |
MDS_INODELOCK_UPDATE;
else
lock->l_policy_data = *policy;
}
if (type == LDLM_EXTENT)
lock->l_req_extent = policy->l_extent;
LDLM_DEBUG(lock, "client-side enqueue START");
}
/* lock not sent to server yet */
if (reqp == NULL || *reqp == NULL) {
req = ldlm_prep_enqueue_req(exp, 2, size, NULL, 0);
if (req == NULL) {
failed_lock_cleanup(ns, lock, lockh, mode);
LDLM_LOCK_PUT(lock);
RETURN(-ENOMEM);
}
req_passed_in = 0;
if (reqp)
*reqp = req;
} else {
req = *reqp;
LASSERTF(lustre_msg_buflen(req->rq_reqmsg, DLM_LOCKREQ_OFF) >=
sizeof(*body), "buflen[%d] = %d, not "LPSZ"\n",
DLM_LOCKREQ_OFF,
lustre_msg_buflen(req->rq_reqmsg, DLM_LOCKREQ_OFF),
sizeof(*body));
}
lock->l_conn_export = exp;
lock->l_export = NULL;
lock->l_blocking_ast = blocking;
/* Dump lock data into the request buffer */
body = lustre_msg_buf(req->rq_reqmsg, DLM_LOCKREQ_OFF, sizeof(*body));
ldlm_lock2desc(lock, &body->lock_desc);
body->lock_flags = *flags;
body->lock_handle[0] = *lockh;
/* Continue as normal. */
if (!req_passed_in) {
size[DLM_LOCKREPLY_OFF] = sizeof(*reply); ptlrpc_req_set_repsize(req, 2 + (lvb_len > 0), size);
}
/*
* Liblustre client doesn't get extent locks, except for O_APPEND case
* where [0, OBD_OBJECT_EOF] lock is taken, or truncate, where
* [i_size, OBD_OBJECT_EOF] lock is taken.
*/
LASSERT(ergo(LIBLUSTRE_CLIENT, type != LDLM_EXTENT ||
policy->l_extent.end == OBD_OBJECT_EOF));
if (async) {
LASSERT(reqp != NULL);
RETURN(0);
}
LDLM_DEBUG(lock, "sending request");
rc = ptlrpc_queue_wait(req);
rc = ldlm_cli_enqueue_fini(exp, req, type, policy ? 1 : 0,
mode, flags, lvb, lvb_len, lvb_swabber,
lockh, rc);
if (!req_passed_in && req != NULL) {
ptlrpc_req_finished(req);
if (reqp)
*reqp = NULL;
}
RETURN(rc);
}
static int ldlm_cli_convert_local(struct ldlm_lock *lock, int new_mode,
int *flags)
{
struct ldlm_resource *res;
int rc;
ENTRY;
if (lock->l_resource->lr_namespace->ns_client) {
CERROR("Trying to cancel local lock\n");
LBUG();
}
LDLM_DEBUG(lock, "client-side local convert");
res = ldlm_lock_convert(lock, new_mode, flags);
if (res) {
ldlm_reprocess_all(res);
rc = 0;
} else {
rc = EDEADLOCK;
}
LDLM_DEBUG(lock, "client-side local convert handler END");
LDLM_LOCK_PUT(lock);
RETURN(rc);
}
/* FIXME: one of ldlm_cli_convert or the server side should reject attempted
* conversion of locks which are on the waiting or converting queue */
/* Caller of this code is supposed to take care of lock readers/writers
accounting */
int ldlm_cli_convert(struct lustre_handle *lockh, int new_mode, int *flags)
{
struct ldlm_request *body;
struct ldlm_reply *reply;
struct ldlm_lock *lock;
struct ldlm_resource *res;
struct ptlrpc_request *req;
int size[2] = { [MSG_PTLRPC_BODY_OFF] = sizeof(struct ptlrpc_body),
[DLM_LOCKREQ_OFF] = sizeof(*body) };
int rc;
ENTRY;
lock = ldlm_handle2lock(lockh);
if (!lock) {
LBUG();
RETURN(-EINVAL);
}
*flags = 0;
if (lock->l_conn_export == NULL)
RETURN(ldlm_cli_convert_local(lock, new_mode, flags));
LDLM_DEBUG(lock, "client-side convert");
req = ptlrpc_prep_req(class_exp2cliimp(lock->l_conn_export),
LUSTRE_DLM_VERSION, LDLM_CONVERT, 2, size, NULL);
if (!req)
GOTO(out, rc = -ENOMEM);
body = lustre_msg_buf(req->rq_reqmsg, DLM_LOCKREQ_OFF, sizeof(*body));
body->lock_handle[0] = lock->l_remote_handle;
body->lock_desc.l_req_mode = new_mode;
body->lock_flags = *flags;
size[DLM_LOCKREPLY_OFF] = sizeof(*reply);
ptlrpc_req_set_repsize(req, 2, size);
rc = ptlrpc_queue_wait(req);
if (rc != ELDLM_OK)
GOTO(out, rc);
reply = lustre_swab_repbuf(req, DLM_LOCKREPLY_OFF, sizeof(*reply),
lustre_swab_ldlm_reply);
if (reply == NULL) {
CERROR ("Can't unpack ldlm_reply\n");
GOTO (out, rc = -EPROTO);
}
if (req->rq_status)
GOTO(out, rc = req->rq_status);
res = ldlm_lock_convert(lock, new_mode, &reply->lock_flags);
if (res != NULL) {
ldlm_reprocess_all(res);
/* Go to sleep until the lock is granted. */
/* FIXME: or cancelled. */
if (lock->l_completion_ast) {
rc = lock->l_completion_ast(lock, LDLM_FL_WAIT_NOREPROC,
NULL);
if (rc)
GOTO(out, rc);
}
} else {
rc = EDEADLOCK;
}
EXIT;
out:
LDLM_LOCK_PUT(lock);
ptlrpc_req_finished(req);
return rc;
}
/* Cancel locks locally.
* Returns: 1 if there is a need to send a cancel RPC to server. 0 otherwise. */
static int ldlm_cli_cancel_local(struct ldlm_lock *lock)
{
int rc = 0;
ENTRY;
if (lock->l_conn_export) { int local_only;
LDLM_DEBUG(lock, "client-side cancel");
/* Set this flag to prevent others from getting new references*/
lock_res_and_lock(lock);
lock->l_flags |= LDLM_FL_CBPENDING;
local_only = (lock->l_flags &
(LDLM_FL_LOCAL_ONLY|LDLM_FL_CANCEL_ON_BLOCK));
ldlm_cancel_callback(lock);
unlock_res_and_lock(lock);
if (local_only)
CDEBUG(D_INFO, "not sending request (at caller's "
"instruction)\n");
else
rc = 1;
ldlm_lock_cancel(lock);
} else {
if (lock->l_resource->lr_namespace->ns_client) {
LDLM_ERROR(lock, "Trying to cancel local lock");
LBUG();
}
LDLM_DEBUG(lock, "server-side local cancel");
ldlm_lock_cancel(lock);
ldlm_reprocess_all(lock->l_resource);
LDLM_DEBUG(lock, "server-side local cancel handler END");
}
RETURN(rc);
}
/* Pack @count locks in @head into ldlm_request buffer at the offset @off,
of the request @req. */
static void ldlm_cancel_pack(struct ptlrpc_request *req, int off,
struct list_head *head, int count)
{
struct ldlm_request *dlm;
struct ldlm_lock *lock;
int max;
ENTRY;
dlm = lustre_msg_buf(req->rq_reqmsg, off, sizeof(*dlm));
LASSERT(dlm != NULL);
/* Check the room in the request buffer. */
max = lustre_msg_buflen(req->rq_reqmsg, off) -
sizeof(struct ldlm_request);
max /= sizeof(struct lustre_handle);
max += LDLM_LOCKREQ_HANDLES;
LASSERT(max >= dlm->lock_count + count);
/* XXX: it would be better to pack lock handles grouped by resource.
* so that the server cancel would call filter_lvbo_update() less
* frequently. */
list_for_each_entry(lock, head, l_bl_ast) {
if (!count--)
break;
/* Pack the lock handle to the given request buffer. */
LASSERT(lock->l_conn_export);
/* Cannot be set on a lock in a resource granted list.*/
LASSERT(!(lock->l_flags &
(LDLM_FL_LOCAL_ONLY|LDLM_FL_CANCEL_ON_BLOCK)));
/* If @lock is marked CANCEL_ON_BLOCK, cancel
* will not be sent in ldlm_cli_cancel(). It
* is used for liblustre clients, no cancel on
* block requests. However, even for liblustre
* clients, when the flag is set, batched cancel
* should be sent (what if no block rpc has
* come). To not send another separated rpc in * this case, the caller pass CANCEL_ON_BLOCK
* flag to ldlm_cli_cancel_unused_resource(). */
dlm->lock_handle[dlm->lock_count++] = lock->l_remote_handle;
}
EXIT;
}
/* Prepare and send a batched cancel rpc, it will include count lock handles
* of locks given in @head. */
int ldlm_cli_cancel_req(struct obd_export *exp, struct list_head *cancels,
int count, int flags)
{
struct ptlrpc_request *req = NULL;
struct ldlm_request *body;
int size[2] = { [MSG_PTLRPC_BODY_OFF] = sizeof(struct ptlrpc_body),
[DLM_LOCKREQ_OFF] = sizeof(*body) };
struct obd_import *imp;
int free, sent = 0;
int rc = 0;
ENTRY;
LASSERT(exp != NULL);
LASSERT(count > 0);
free = ldlm_req_handles_avail(exp, size, 2, 0);
if (count > free)
count = free;
size[DLM_LOCKREQ_OFF] = ldlm_request_bufsize(count, LDLM_CANCEL);
while (1) {
imp = class_exp2cliimp(exp);
if (imp == NULL || imp->imp_invalid) {
CDEBUG(D_HA, "skipping cancel on invalid import %p\n",
imp);
break;
}
req = ptlrpc_prep_req(imp, LUSTRE_DLM_VERSION, LDLM_CANCEL, 2,
size, NULL);
if (!req)
GOTO(out, rc = -ENOMEM);
req->rq_no_resend = 1;
req->rq_no_delay = 1;
/* XXX FIXME bug 249 */
req->rq_request_portal = LDLM_CANCEL_REQUEST_PORTAL;
req->rq_reply_portal = LDLM_CANCEL_REPLY_PORTAL;
body = lustre_msg_buf(req->rq_reqmsg, DLM_LOCKREQ_OFF,
sizeof(*body));
ldlm_cancel_pack(req, DLM_LOCKREQ_OFF, cancels, count);
ptlrpc_req_set_repsize(req, 1, NULL);
if (flags & LDLM_FL_ASYNC) {
ptlrpcd_add_req(req);
sent = count;
GOTO(out, 0);
} else {
rc = ptlrpc_queue_wait(req);
}
if (rc == ESTALE) {
CDEBUG(D_DLMTRACE, "client/server (nid %s) "
"out of sync -- not fatal\n",
libcfs_nid2str(req->rq_import->
imp_connection->c_peer.nid));
} else if (rc == -ETIMEDOUT && /* check there was no reconnect*/
req->rq_import_generation == imp->imp_generation) {
ptlrpc_req_finished(req);
continue; } else if (rc != ELDLM_OK) {
CERROR("Got rc %d from cancel RPC: canceling "
"anyway\n", rc);
break;
}
sent = count;
break;
}
ptlrpc_req_finished(req);
EXIT;
out:
return sent ? sent : rc;
}
int ldlm_cli_cancel(struct lustre_handle *lockh)
{
struct ldlm_lock *lock;
CFS_LIST_HEAD(head);
int rc = 0;
ENTRY;
/* concurrent cancels on the same handle can happen */
lock = __ldlm_handle2lock(lockh, LDLM_FL_CANCELING);
if (lock == NULL)
RETURN(0);
rc = ldlm_cli_cancel_local(lock);
if (rc <= 0)
GOTO(out, rc);
list_add(&lock->l_bl_ast, &head);
rc = ldlm_cli_cancel_req(lock->l_conn_export, &head, 1, 0);
EXIT;
out:
LDLM_LOCK_PUT(lock);
return rc < 0 ? rc : 0;
}
/* - Free space in lru for @count new locks,
* redundant unused locks are canceled locally;
* - also cancel locally unused aged locks;
* - do not cancel more than @max locks;
* - GET the found locks and add them into the @cancels list.
*
* A client lock can be added to the l_bl_ast list only when it is
* marked LDLM_FL_CANCELING. Otherwise, somebody is already doing CANCEL.
* There are the following use cases: ldlm_cancel_resource_local(),
* ldlm_cancel_lru_local() and ldlm_cli_cancel(), which check&set this
* flag properly. As any attempt to cancel a lock rely on this flag,
* l_bl_ast list is accessed later without any special locking. */
int ldlm_cancel_lru_local(struct ldlm_namespace *ns, struct list_head *cancels,
int count, int max, int flags)
{
cfs_time_t cur = cfs_time_current();
struct ldlm_lock *lock, *next;
int rc, added = 0, left;
ENTRY;
spin_lock(&ns->ns_unused_lock);
count += ns->ns_nr_unused - ns->ns_max_unused;
while (!list_empty(&ns->ns_unused_list)) {
struct list_head *tmp = ns->ns_unused_list.next;
lock = list_entry(tmp, struct ldlm_lock, l_lru);
if (max && added >= max)
break;
if ((added >= count) &&
(!(flags & LDLM_CANCEL_AGED) || cfs_time_before_64(cur, ns->ns_max_age +
lock->l_last_used)))
break;
LDLM_LOCK_GET(lock); /* dropped by bl thread */
spin_unlock(&ns->ns_unused_lock);
lock_res_and_lock(lock);
if ((ldlm_lock_remove_from_lru(lock) == 0) ||
(lock->l_flags & LDLM_FL_CANCELING)) {
/* other thread is removing lock from lru or
* somebody is already doing CANCEL. */
unlock_res_and_lock(lock);
LDLM_LOCK_PUT(lock);
spin_lock(&ns->ns_unused_lock);
continue;
}
LASSERT(!lock->l_readers && !lock->l_writers);
/* If we have chosen to canecl this lock voluntarily, we better
send cancel notification to server, so that it frees
appropriate state. This might lead to a race where while
we are doing cancel here, server is also silently
cancelling this lock. */
lock->l_flags &= ~LDLM_FL_CANCEL_ON_BLOCK;
/* Setting the CBPENDING flag is a little misleading, but
* prevents an important race; namely, once CBPENDING is set,
* the lock can accumulate no more readers/writers. Since
* readers and writers are already zero here, ldlm_lock_decref
* won't see this flag and call l_blocking_ast */
lock->l_flags |= LDLM_FL_CBPENDING | LDLM_FL_CANCELING;
/* We can't re-add to l_lru as it confuses the refcounting in
* ldlm_lock_remove_from_lru() if an AST arrives after we drop
* ns_lock below. We use l_bl_ast and can't use l_pending_chain
* as it is used both on server and client nevertheles bug 5666
* says it is used only on server. --umka */
LASSERT(list_empty(&lock->l_bl_ast));
list_add(&lock->l_bl_ast, cancels);
unlock_res_and_lock(lock);
spin_lock(&ns->ns_unused_lock);
added++;
}
spin_unlock(&ns->ns_unused_lock);
/* Handle only @added inserted locks. */
left = added;
list_for_each_entry_safe(lock, next, cancels, l_bl_ast) {
if (left-- == 0)
break;
rc = ldlm_cli_cancel_local(lock);
if (rc == 0) {
/* CANCEL RPC should not be sent to server. */
list_del_init(&lock->l_bl_ast);
LDLM_LOCK_PUT(lock);
added--;
}
}
RETURN(added);
}
/* when called with LDLM_ASYNC the blocking callback will be handled
* in a thread and this function will return after the thread has been
* asked to call the callback. when called with LDLM_SYNC the blocking
* callback will be performed in this function. */
int ldlm_cancel_lru(struct ldlm_namespace *ns, ldlm_sync_t sync)
{
CFS_LIST_HEAD(cancels);
int count, rc; ENTRY;
#ifndef __KERNEL__
sync = LDLM_SYNC; /* force to be sync in user space */
#endif
count = ldlm_cancel_lru_local(ns, &cancels, 0, 0, 0);
if (sync == LDLM_ASYNC) {
struct ldlm_lock *lock, *next;
list_for_each_entry_safe(lock, next, &cancels, l_bl_ast) {
/* Remove from the list to allow blocking thread to
* re-use l_bl_ast. */
list_del_init(&lock->l_bl_ast);
rc = ldlm_bl_to_thread(ns, NULL, lock,
LDLM_FL_CANCELING);
if (rc)
list_add_tail(&lock->l_bl_ast, &next->l_bl_ast);
}
}
/* If some locks are left in the list in ASYNC mode, or
* this is SYNC mode, cancel the list. */
ldlm_cli_cancel_list(&cancels, count, NULL, DLM_LOCKREQ_OFF, 0);
RETURN(0);
}
/* Find and cancel locally unused locks found on resource, matched to the
* given policy, mode. GET the found locks and add them into the @cancels
* list. */
int ldlm_cancel_resource_local(struct ldlm_resource *res,
struct list_head *cancels,
ldlm_policy_data_t *policy,
ldlm_mode_t mode, int lock_flags,
int flags, void *opaque)
{
struct ldlm_lock *lock, *next;
int count = 0, left;
ENTRY;
lock_res(res);
list_for_each_entry(lock, &res->lr_granted, l_res_link) {
if (opaque != NULL && lock->l_ast_data != opaque) {
LDLM_ERROR(lock, "data %p doesn't match opaque %p",
lock->l_ast_data, opaque);
//LBUG();
continue;
}
if (lock->l_readers || lock->l_writers) {
if (flags & LDLM_FL_WARN) {
LDLM_ERROR(lock, "lock in use");
//LBUG();
}
continue;
}
if (lockmode_compat(lock->l_granted_mode, mode))
continue;
/* If policy is given and this is IBITS lock, add to list only
* those locks that match by policy. */
if (policy && (lock->l_resource->lr_type == LDLM_IBITS) &&
!(lock->l_policy_data.l_inodebits.bits &
policy->l_inodebits.bits))
continue;
/* If somebody is already doing CANCEL, skip it. */
if (lock->l_flags & LDLM_FL_CANCELING)
continue;
/* See CBPENDING comment in ldlm_cancel_lru */ lock->l_flags |= LDLM_FL_CBPENDING | LDLM_FL_CANCELING |
lock_flags;
LASSERT(list_empty(&lock->l_bl_ast));
list_add(&lock->l_bl_ast, cancels);
LDLM_LOCK_GET(lock);
count++;
}
unlock_res(res);
/* Handle only @count inserted locks. */
left = count;
list_for_each_entry_safe(lock, next, cancels, l_bl_ast) {
int rc = 0;
if (left-- == 0)
break;
if (flags & LDLM_FL_LOCAL_ONLY)
ldlm_lock_cancel(lock);
else
rc = ldlm_cli_cancel_local(lock);
if (rc == 0) {
/* CANCEL RPC should not be sent to server. */
list_del_init(&lock->l_bl_ast);
LDLM_LOCK_PUT(lock);
count--;
}
}
RETURN(count);
}
/* If @req is NULL, send CANCEL request to server with handles of locks
* in the @cancels. If EARLY_CANCEL is not supported, send CANCEL requests
* separately per lock.
* If @req is not NULL, put handles of locks in @cancels into the request
* buffer at the offset @off.
* Destroy @cancels at the end. */
int ldlm_cli_cancel_list(struct list_head *cancels, int count,
struct ptlrpc_request *req, int off, int flags)
{
struct ldlm_lock *lock;
int res = 0;
ENTRY;
if (list_empty(cancels) || count == 0)
RETURN(0);
/* XXX: requests (both batched and not) could be sent in parallel.
* Usually it is enough to have just 1 RPC, but it is possible that
* there are to many locks to be cancelled in LRU or on a resource.
* It would also speed up the case when the server does not support
* the feature. */
while (count > 0) {
LASSERT(!list_empty(cancels));
lock = list_entry(cancels->next, struct ldlm_lock, l_bl_ast);
LASSERT(lock->l_conn_export);
if (exp_connect_cancelset(lock->l_conn_export)) {
res = count;
if (req)
ldlm_cancel_pack(req, off, cancels, count);
else
res = ldlm_cli_cancel_req(lock->l_conn_export,
cancels, count, flags);
} else {
res = ldlm_cli_cancel_req(lock->l_conn_export,
cancels, 1, flags);
}
if (res < 0) {
CERROR("ldlm_cli_cancel_list: %d\n", res);
res = count;
}
count -= res;
ldlm_lock_list_put(cancels, l_bl_ast, res);
}
LASSERT(list_empty(cancels));
LASSERT(count == 0);
RETURN(0);
}
int ldlm_cli_cancel_unused_resource(struct ldlm_namespace *ns,
const struct ldlm_res_id *res_id,
ldlm_policy_data_t *policy,
int mode, int flags, void *opaque)
{
struct ldlm_resource *res;
CFS_LIST_HEAD(cancels);
int count;
int rc;
ENTRY;
res = ldlm_resource_get(ns, NULL, res_id, 0, 0);
if (res == NULL) {
/* This is not a problem. */
CDEBUG(D_INFO, "No resource "LPU64"\n", res_id->name[0]);
RETURN(0);
}
count = ldlm_cancel_resource_local(res, &cancels, policy, mode,
0, flags, opaque);
rc = ldlm_cli_cancel_list(&cancels, count, NULL,
DLM_LOCKREQ_OFF, flags);
if (rc != ELDLM_OK)
CERROR("ldlm_cli_cancel_unused_resource: %d\n", rc);
ldlm_resource_putref(res);
RETURN(0);
}
static inline int have_no_nsresource(struct ldlm_namespace *ns)
{
int no_resource = 0;
spin_lock(&ns->ns_hash_lock);
if (ns->ns_resources == 0)
no_resource = 1;
spin_unlock(&ns->ns_hash_lock);
RETURN(no_resource);
}
/* Cancel all locks on a namespace (or a specific resource, if given)
* that have 0 readers/writers.
*
* If flags & LDLM_FL_LOCAL_ONLY, throw the locks away without trying
* to notify the server. */
int ldlm_cli_cancel_unused(struct ldlm_namespace *ns,
const struct ldlm_res_id *res_id,
int flags, void *opaque)
{
int i;
ENTRY;
if (ns == NULL)
RETURN(ELDLM_OK);
if (res_id) RETURN(ldlm_cli_cancel_unused_resource(ns, res_id, NULL,
LCK_MINMODE, flags,
opaque));
spin_lock(&ns->ns_hash_lock);
for (i = 0; i < RES_HASH_SIZE; i++) {
struct list_head *tmp;
tmp = ns->ns_hash[i].next;
while (tmp != &(ns->ns_hash[i])) {
struct ldlm_resource *res;
int rc;
res = list_entry(tmp, struct ldlm_resource, lr_hash);
ldlm_resource_getref(res);
spin_unlock(&ns->ns_hash_lock);
rc = ldlm_cli_cancel_unused_resource(ns, &res->lr_name,
NULL, LCK_MINMODE,
flags, opaque);
if (rc)
CERROR("ldlm_cli_cancel_unused ("LPU64"): %d\n",
res->lr_name.name[0], rc);
spin_lock(&ns->ns_hash_lock);
tmp = tmp->next;
ldlm_resource_putref_locked(res);
}
}
spin_unlock(&ns->ns_hash_lock);
RETURN(ELDLM_OK);
}
/* join/split resource locks to/from lru list */
int ldlm_cli_join_lru(struct ldlm_namespace *ns,
const struct ldlm_res_id *res_id, int join)
{
struct ldlm_resource *res;
struct ldlm_lock *lock, *n;
int count = 0;
ENTRY;
LASSERT(ns->ns_client == LDLM_NAMESPACE_CLIENT);
res = ldlm_resource_get(ns, NULL, res_id, LDLM_EXTENT, 0);
if (res == NULL)
RETURN(count);
LASSERT(res->lr_type == LDLM_EXTENT);
lock_res(res);
if (!join)
goto split;
list_for_each_entry_safe (lock, n, &res->lr_granted, l_res_link) {
if (list_empty(&lock->l_lru) &&
!lock->l_readers && !lock->l_writers &&
!(lock->l_flags & LDLM_FL_LOCAL) &&
!(lock->l_flags & LDLM_FL_CBPENDING)) {
lock->l_last_used = cfs_time_current();
spin_lock(&ns->ns_unused_lock);
LASSERT(ns->ns_nr_unused >= 0);
list_add_tail(&lock->l_lru, &ns->ns_unused_list);
ns->ns_nr_unused++;
spin_unlock(&ns->ns_unused_lock);
lock->l_flags &= ~LDLM_FL_NO_LRU;
LDLM_DEBUG(lock, "join lock to lru");
count++;
}
} goto unlock;
split:
spin_lock(&ns->ns_unused_lock);
list_for_each_entry_safe (lock, n, &ns->ns_unused_list, l_lru) {
if (lock->l_resource == res) {
ldlm_lock_remove_from_lru_nolock(lock);
lock->l_flags |= LDLM_FL_NO_LRU;
LDLM_DEBUG(lock, "split lock from lru");
count++;
}
}
spin_unlock(&ns->ns_unused_lock);
unlock:
unlock_res(res);
ldlm_resource_putref(res);
RETURN(count);
}
/* Lock iterators. */
int ldlm_resource_foreach(struct ldlm_resource *res, ldlm_iterator_t iter,
void *closure)
{
struct list_head *tmp, *next;
struct ldlm_lock *lock;
int rc = LDLM_ITER_CONTINUE;
ENTRY;
if (!res)
RETURN(LDLM_ITER_CONTINUE);
lock_res(res);
list_for_each_safe(tmp, next, &res->lr_granted) {
lock = list_entry(tmp, struct ldlm_lock, l_res_link);
if (iter(lock, closure) == LDLM_ITER_STOP)
GOTO(out, rc = LDLM_ITER_STOP);
}
list_for_each_safe(tmp, next, &res->lr_converting) {
lock = list_entry(tmp, struct ldlm_lock, l_res_link);
if (iter(lock, closure) == LDLM_ITER_STOP)
GOTO(out, rc = LDLM_ITER_STOP);
}
list_for_each_safe(tmp, next, &res->lr_waiting) {
lock = list_entry(tmp, struct ldlm_lock, l_res_link);
if (iter(lock, closure) == LDLM_ITER_STOP)
GOTO(out, rc = LDLM_ITER_STOP);
}
out:
unlock_res(res);
RETURN(rc);
}
struct iter_helper_data {
ldlm_iterator_t iter;
void *closure;
};
static int ldlm_iter_helper(struct ldlm_lock *lock, void *closure)
{
struct iter_helper_data *helper = closure;
return helper->iter(lock, helper->closure);
}
static int ldlm_res_iter_helper(struct ldlm_resource *res, void *closure){
return ldlm_resource_foreach(res, ldlm_iter_helper, closure);
}
int ldlm_namespace_foreach(struct ldlm_namespace *ns, ldlm_iterator_t iter,
void *closure)
{
struct iter_helper_data helper = { iter: iter, closure: closure };
return ldlm_namespace_foreach_res(ns, ldlm_res_iter_helper, &helper);
}
int ldlm_namespace_foreach_res(struct ldlm_namespace *ns,
ldlm_res_iterator_t iter, void *closure)
{
int i, rc = LDLM_ITER_CONTINUE;
struct ldlm_resource *res;
struct list_head *tmp;
ENTRY;
spin_lock(&ns->ns_hash_lock);
for (i = 0; i < RES_HASH_SIZE; i++) {
tmp = ns->ns_hash[i].next;
while (tmp != &(ns->ns_hash[i])) {
res = list_entry(tmp, struct ldlm_resource, lr_hash);
ldlm_resource_getref(res);
spin_unlock(&ns->ns_hash_lock);
rc = iter(res, closure);
spin_lock(&ns->ns_hash_lock);
tmp = tmp->next;
ldlm_resource_putref_locked(res);
if (rc == LDLM_ITER_STOP)
GOTO(out, rc);
}
}
out:
spin_unlock(&ns->ns_hash_lock);
RETURN(rc);
}
/* non-blocking function to manipulate a lock whose cb_data is being put away.*/
void ldlm_resource_iterate(struct ldlm_namespace *ns,
const struct ldlm_res_id *res_id,
ldlm_iterator_t iter, void *data)
{
struct ldlm_resource *res;
ENTRY;
if (ns == NULL) {
CERROR("must pass in namespace\n");
LBUG();
}
res = ldlm_resource_get(ns, NULL, res_id, 0, 0);
if (res == NULL) {
EXIT;
return;
}
ldlm_resource_foreach(res, iter, data);
ldlm_resource_putref(res);
EXIT;
}
/* Lock replay */
static int ldlm_chain_lock_for_replay(struct ldlm_lock *lock, void *closure)
{
struct list_head *list = closure;
/* we use l_pending_chain here, because it's unused on clients. */
LASSERTF(list_empty(&lock->l_pending_chain),"lock %p next %p prev %p\n",
lock, &lock->l_pending_chain.next,&lock->l_pending_chain.prev);
/* bug 9573: don't replay locks left after eviction */
if (!(lock->l_flags & LDLM_FL_FAILED))
list_add(&lock->l_pending_chain, list);
return LDLM_ITER_CONTINUE;
}
static int replay_lock_interpret(struct ptlrpc_request *req,
struct ldlm_async_args *aa, int rc)
{
struct ldlm_lock *lock;
struct ldlm_reply *reply;
ENTRY;
atomic_dec(&req->rq_import->imp_replay_inflight);
if (rc != ELDLM_OK)
GOTO(out, rc);
reply = lustre_swab_repbuf(req, DLM_LOCKREPLY_OFF, sizeof(*reply),
lustre_swab_ldlm_reply);
if (reply == NULL) {
CERROR("Can't unpack ldlm_reply\n");
GOTO (out, rc = -EPROTO);
}
lock = ldlm_handle2lock(&aa->lock_handle);
if (!lock) {
CERROR("received replay ack for unknown local cookie "LPX64
" remote cookie "LPX64 " from server %s id %s\n",
aa->lock_handle.cookie, reply->lock_handle.cookie,
req->rq_export->exp_client_uuid.uuid,
libcfs_id2str(req->rq_peer));
GOTO(out, rc = -ESTALE);
}
lock->l_remote_handle = reply->lock_handle;
LDLM_DEBUG(lock, "replayed lock:");
ptlrpc_import_recovery_state_machine(req->rq_import);
LDLM_LOCK_PUT(lock);
out:
if (rc != ELDLM_OK)
ptlrpc_connect_import(req->rq_import, NULL);
RETURN(rc);
}
static int replay_one_lock(struct obd_import *imp, struct ldlm_lock *lock)
{
struct ptlrpc_request *req;
struct ldlm_request *body;
struct ldlm_reply *reply;
struct ldlm_async_args *aa;
int buffers = 2;
int size[3] = { sizeof(struct ptlrpc_body) };
int flags;
ENTRY;
/* Bug 11974: Do not replay a lock which is actively being canceled */
if (lock->l_flags & LDLM_FL_CANCELING) {
LDLM_DEBUG(lock, "Not replaying canceled lock:");
RETURN(0);
}
/* If this is reply-less callback lock, we cannot replay it, since * server might have long dropped it, but notification of that event was
* lost by network. (and server granted conflicting lock already) */
if (lock->l_flags & LDLM_FL_CANCEL_ON_BLOCK) {
LDLM_DEBUG(lock, "Not replaying reply-less lock:");
ldlm_lock_cancel(lock);
RETURN(0);
}
/*
* If granted mode matches the requested mode, this lock is granted.
*
* If they differ, but we have a granted mode, then we were granted
* one mode and now want another: ergo, converting.
*
* If we haven't been granted anything and are on a resource list,
* then we're blocked/waiting.
*
* If we haven't been granted anything and we're NOT on a resource list,
* then we haven't got a reply yet and don't have a known disposition.
* This happens whenever a lock enqueue is the request that triggers
* recovery.
*/
if (lock->l_granted_mode == lock->l_req_mode)
flags = LDLM_FL_REPLAY | LDLM_FL_BLOCK_GRANTED;
else if (lock->l_granted_mode)
flags = LDLM_FL_REPLAY | LDLM_FL_BLOCK_CONV;
else if (!list_empty(&lock->l_res_link))
flags = LDLM_FL_REPLAY | LDLM_FL_BLOCK_WAIT;
else
flags = LDLM_FL_REPLAY;
size[DLM_LOCKREQ_OFF] = sizeof(*body);
req = ptlrpc_prep_req(imp, LUSTRE_DLM_VERSION, LDLM_ENQUEUE, 2, size,
NULL);
if (!req)
RETURN(-ENOMEM);
/* We're part of recovery, so don't wait for it. */
req->rq_send_state = LUSTRE_IMP_REPLAY_LOCKS;
body = lustre_msg_buf(req->rq_reqmsg, DLM_LOCKREQ_OFF, sizeof(*body));
ldlm_lock2desc(lock, &body->lock_desc);
body->lock_flags = flags;
ldlm_lock2handle(lock, &body->lock_handle[0]);
size[DLM_LOCKREPLY_OFF] = sizeof(*reply);
if (lock->l_lvb_len != 0) {
buffers = 3;
size[DLM_REPLY_REC_OFF] = lock->l_lvb_len;
}
ptlrpc_req_set_repsize(req, buffers, size);
/* notify the server we've replayed all requests.
* also, we mark the request to be put on a dedicated
* queue to be processed after all request replayes.
* bug 6063 */
lustre_msg_set_flags(req->rq_reqmsg, MSG_REQ_REPLAY_DONE);
LDLM_DEBUG(lock, "replaying lock:");
atomic_inc(&req->rq_import->imp_replay_inflight);
CLASSERT(sizeof(*aa) <= sizeof(req->rq_async_args));
aa = (struct ldlm_async_args *)&req->rq_async_args;
aa->lock_handle = body->lock_handle[0];
req->rq_interpret_reply = replay_lock_interpret;
ptlrpcd_add_req(req);
RETURN(0);
}
int ldlm_replay_locks(struct obd_import *imp)
{ struct ldlm_namespace *ns = imp->imp_obd->obd_namespace;
struct list_head list;
struct ldlm_lock *lock, *next;
int rc = 0;
ENTRY;
CFS_INIT_LIST_HEAD(&list);
LASSERT(atomic_read(&imp->imp_replay_inflight) == 0);
/* ensure this doesn't fall to 0 before all have been queued */
atomic_inc(&imp->imp_replay_inflight);
(void)ldlm_namespace_foreach(ns, ldlm_chain_lock_for_replay, &list);
list_for_each_entry_safe(lock, next, &list, l_pending_chain) {
list_del_init(&lock->l_pending_chain);
if (rc)
continue; /* or try to do the rest? */
rc = replay_one_lock(imp, lock);
}
atomic_dec(&imp->imp_replay_inflight);
RETURN(rc);
}