X-Git-Url: https://git.whamcloud.com/?p=fs%2Flustre-release.git;a=blobdiff_plain;f=lustre%2Fldlm%2Fldlm_request.c;h=b6fb1d1d0343cf9299ad7172e70cd207bc022536;hp=a996da6acf80b4daaeb415f00c64673c76c0327c;hb=e6ba48a08c9fe831b3f60985a72bb31b9806bb34;hpb=7ff01fc9e03faeb8c23182e50b6b85107c598628 diff --git a/lustre/ldlm/ldlm_request.c b/lustre/ldlm/ldlm_request.c index a996da6..b6fb1d1 100644 --- a/lustre/ldlm/ldlm_request.c +++ b/lustre/ldlm/ldlm_request.c @@ -1,22 +1,37 @@ /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*- * vim:expandtab:shiftwidth=8:tabstop=8: * - * Copyright (C) 2002, 2003 Cluster File Systems, Inc. + * GPL HEADER START * - * This file is part of Lustre, http://www.lustre.org. + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * - * Lustre is free 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. + * This program is free software; you can redistribute it and/or modify + * it under the terms of the GNU General Public License version 2 only, + * as published by the Free Software Foundation. * - * 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 - * GNU General Public License for more details. + * This program 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 GNU + * General Public License version 2 for more details (a copy is included + * in the LICENSE file that accompanied this code). * - * You should have received a copy of the GNU General Public License - * along with Lustre; if not, write to the Free Software - * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. + * You should have received a copy of the GNU General Public License + * version 2 along with this program; If not, see + * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf + * + * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, + * CA 95054 USA or visit www.sun.com if you need additional information or + * have any questions. + * + * GPL HEADER END + */ +/* + * Copyright 2008 Sun Microsystems, Inc. All rights reserved + * Use is subject to license terms. + */ +/* + * This file is part of Lustre, http://www.lustre.org/ + * Lustre is a trademark of Sun Microsystems, Inc. */ #define DEBUG_SUBSYSTEM S_LDLM @@ -25,19 +40,27 @@ #include #endif -#include -#include -#include +#include +#include +#include #include "ldlm_internal.h" +int ldlm_enqueue_min = OBD_TIMEOUT_DEFAULT; +CFS_MODULE_PARM(ldlm_enqueue_min, "i", int, 0644, + "lock enqueue timeout minimum"); + static void interrupted_completion_wait(void *data) { } struct lock_wait_data { struct ldlm_lock *lwd_lock; - int lwd_generation; + __u32 lwd_conn_cnt; +}; + +struct ldlm_async_args { + struct lustre_handle lock_handle; }; int ldlm_expired_completion_wait(void *data) @@ -47,81 +70,196 @@ int ldlm_expired_completion_wait(void *data) struct obd_import *imp; struct obd_device *obd; + ENTRY; if (lock->l_conn_export == NULL) { - static unsigned long next_dump = 0; - - LDLM_ERROR(lock, "lock timed out; not entering recovery in " - "server code, just going back to sleep"); - if (time_after(jiffies, next_dump)) { - ldlm_namespace_dump(lock->l_resource->lr_namespace); - if (next_dump == 0) - portals_debug_dumplog(); - next_dump = jiffies + 300 * HZ; + static cfs_time_t next_dump = 0, last_dump = 0; + + if (ptlrpc_check_suspend()) + RETURN(0); + + LDLM_ERROR(lock, "lock timed out (enqueued at "CFS_TIME_T", " + CFS_DURATION_T"s ago); not entering recovery in " + "server code, just going back to sleep", + lock->l_last_activity, + cfs_time_sub(cfs_time_current_sec(), + lock->l_last_activity)); + 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_generation); - LDLM_ERROR(lock, "lock timed out, entering recovery for %s@%s", - imp->imp_target_uuid.uuid, - imp->imp_connection->c_remote_uuid.uuid); + ptlrpc_fail_import(imp, lwd->lwd_conn_cnt); + LDLM_ERROR(lock, "lock timed out (enqueued at "CFS_TIME_T", " + CFS_DURATION_T"s ago), entering recovery for %s@%s", + lock->l_last_activity, + cfs_time_sub(cfs_time_current_sec(), lock->l_last_activity), + obd2cli_tgt(obd), imp->imp_connection->c_remote_uuid.uuid); + + RETURN(0); +} + +/* We use the same basis for both server side and client side functions + from a single node. */ +int ldlm_get_enq_timeout(struct ldlm_lock *lock) +{ + int timeout = at_get(&lock->l_resource->lr_namespace->ns_at_estimate); + if (AT_OFF) + return obd_timeout / 2; + /* Since these are non-updating timeouts, we should be conservative. + It would be nice to have some kind of "early reply" mechanism for + lock callbacks too... */ + timeout = timeout + (timeout >> 1); /* 150% */ + return max(timeout, ldlm_enqueue_min); +} +EXPORT_SYMBOL(ldlm_get_enq_timeout); + +/** + * Helper function for ldlm_completion_ast(), updating timings when lock is + * actually granted. + */ +static int ldlm_completion_tail(struct ldlm_lock *lock) +{ + long delay; + int result; + + if (lock->l_destroyed || lock->l_flags & LDLM_FL_FAILED) { + LDLM_DEBUG(lock, "client-side enqueue: destroyed"); + result = -EIO; + } else { + delay = cfs_time_sub(cfs_time_current_sec(), + lock->l_last_activity); + LDLM_DEBUG(lock, "client-side enqueue: granted after " + CFS_DURATION_T"s", delay); + + /* Update our time estimate */ + at_add(&lock->l_resource->lr_namespace->ns_at_estimate, delay); + result = 0; + } + return result; +} + +/** + * Implementation of ->l_completion_ast() for a client, that doesn't wait + * until lock is granted. Suitable for locks enqueued through ptlrpcd, of + * other threads that cannot block for long. + */ +int ldlm_completion_ast_async(struct ldlm_lock *lock, int flags, void *data) +{ + ENTRY; + + if (flags == LDLM_FL_WAIT_NOREPROC) { + LDLM_DEBUG(lock, "client-side enqueue waiting on pending lock"); + RETURN(0); + } + + if (!(flags & (LDLM_FL_BLOCK_WAIT | LDLM_FL_BLOCK_GRANTED | + LDLM_FL_BLOCK_CONV))) { + cfs_waitq_signal(&lock->l_waitq); + RETURN(ldlm_completion_tail(lock)); + } + LDLM_DEBUG(lock, "client-side enqueue returned a blocked lock, " + "going forward"); + ldlm_lock_dump(D_OTHER, lock, 0); + ldlm_reprocess_all(lock->l_resource); RETURN(0); } +/** + * Client side LDLM "completion" AST. This is called in several cases: + * + * - when a reply to an ENQUEUE rpc is received from the server + * (ldlm_cli_enqueue_fini()). Lock might be granted or not granted at + * this point (determined by flags); + * + * - when LDLM_CP_CALLBACK rpc comes to client to notify it that lock has + * been granted; + * + * - when ldlm_lock_match(LDLM_FL_LVB_READY) is about to wait until lock + * gets correct lvb; + * + * - to force all locks when resource is destroyed (cleanup_resource()); + * + * - during lock conversion (not used currently). + * + * If lock is not granted in the first case, this function waits until second + * or penultimate cases happen in some other thread. + * + */ int ldlm_completion_ast(struct ldlm_lock *lock, int flags, void *data) { /* XXX ALLOCATE - 160 bytes */ struct lock_wait_data lwd; - unsigned long irqflags; struct obd_device *obd; struct obd_import *imp = NULL; struct l_wait_info lwi; + __u32 timeout; int rc = 0; ENTRY; - if (flags == LDLM_FL_WAIT_NOREPROC) + 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))) { - wake_up(&lock->l_waitq); + 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) + if (obd != NULL) { imp = obd->u.cli.cl_import; + } + + /* Wait a long time for enqueue - server may have to callback a + lock from another client. Server will evict the other client if it + doesn't respond reasonably, and then give us the lock. */ + timeout = ldlm_get_enq_timeout(lock) * 2; lwd.lwd_lock = lock; - lwi = LWI_TIMEOUT_INTR(obd_timeout * HZ, ldlm_expired_completion_wait, - interrupted_completion_wait, &lwd); - if (imp != NULL) { - spin_lock_irqsave(&imp->imp_lock, irqflags); - lwd.lwd_generation = imp->imp_generation; - spin_unlock_irqrestore(&imp->imp_lock, irqflags); + 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(timeout), + ldlm_expired_completion_wait, + interrupted_completion_wait, &lwd); } - /* 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_CANCEL)), &lwi); + if (imp != NULL) { + spin_lock(&imp->imp_lock); + lwd.lwd_conn_cnt = imp->imp_conn_cnt; + spin_unlock(&imp->imp_lock); + } - if (lock->l_destroyed) { - LDLM_DEBUG(lock, "client-side enqueue waking up: destroyed"); - RETURN(-EIO); + if (ns_is_client(lock->l_resource->lr_namespace) && + OBD_FAIL_CHECK_RESET(OBD_FAIL_LDLM_INTR_CP_AST, + OBD_FAIL_LDLM_CP_BL_RACE | OBD_FAIL_ONCE)) { + lock->l_flags |= LDLM_FL_FAIL_LOC; + rc = -EINTR; + } else { + /* Go to sleep until the lock is granted or cancelled. */ + rc = l_wait_event(lock->l_waitq, + is_granted_or_cancelled(lock), &lwi); } if (rc) { @@ -130,56 +268,159 @@ noreproc: RETURN(rc); } - LDLM_DEBUG(lock, "client-side enqueue waking up: granted"); + RETURN(ldlm_completion_tail(lock)); +} + +/** + * A helper to build a blocking ast function + * + * Perform a common operation for blocking asts: + * defferred lock cancellation. + * + * \param lock the lock blocking or canceling ast was called on + * \retval 0 + * \see mdt_blocking_ast + * \see ldlm_blocking_ast + */ +int ldlm_blocking_ast_nocheck(struct ldlm_lock *lock) +{ + int do_ast; + ENTRY; + + 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); } -static int ldlm_cli_enqueue_local(struct ldlm_namespace *ns, - struct ldlm_res_id res_id, - __u32 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) +/** + * Server blocking AST + * + * ->l_blocking_ast() callback for LDLM locks acquired by server-side + * OBDs. + * + * \param lock the lock which blocks a request or cancelling lock + * \param desc unused + * \param data unused + * \param flag indicates whether this cancelling or blocking callback + * \retval 0 + * \see ldlm_blocking_ast_nocheck + */ +int ldlm_blocking_ast(struct ldlm_lock *lock, struct ldlm_lock_desc *desc, + void *data, int flag) +{ + 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); + } + RETURN(ldlm_blocking_ast_nocheck(lock)); +} + +/* + * ->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, + const __u64 *client_cookie, + struct lustre_handle *lockh) { struct ldlm_lock *lock; int err; + const struct ldlm_callback_suite cbs = { .lcs_completion = completion, + .lcs_blocking = blocking, + .lcs_glimpse = glimpse, + }; ENTRY; - if (ns->ns_client) { + LASSERT(!(*flags & LDLM_FL_REPLAY)); + if (unlikely(ns_is_client(ns))) { CERROR("Trying to enqueue local lock in a shadow namespace\n"); LBUG(); } - lock = ldlm_lock_create(ns, NULL, res_id, type, mode, blocking, - completion, glimpse, data, lvb_len); - if (!lock) + lock = ldlm_lock_create(ns, res_id, type, mode, &cbs, 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) - memcpy(&lock->l_policy_data, policy, sizeof(*policy)); + lock->l_policy_data = *policy; + if (client_cookie != NULL) + lock->l_client_cookie = *client_cookie; if (type == LDLM_EXTENT) - memcpy(&lock->l_req_extent, &policy->l_extent, - sizeof(policy->l_extent)); + lock->l_req_extent = policy->l_extent; err = ldlm_lock_enqueue(ns, &lock, policy, flags); - if (err != ELDLM_OK) + if (unlikely(err != ELDLM_OK)) GOTO(out, err); if (policy != NULL) - memcpy(policy, &lock->l_policy_data, sizeof(*policy)); - if ((*flags) & LDLM_FL_LOCK_CHANGED) - memcpy(&res_id, &lock->l_resource->lr_name, sizeof(res_id)); + *policy = lock->l_policy_data; LDLM_DEBUG_NOLOCK("client-side local enqueue handler END (lock %p)", lock); @@ -190,7 +431,7 @@ static int ldlm_cli_enqueue_local(struct ldlm_namespace *ns, LDLM_DEBUG(lock, "client-side local enqueue END"); EXIT; out: - LDLM_LOCK_PUT(lock); + LDLM_LOCK_RELEASE(lock); out_nolock: return err; } @@ -199,101 +440,58 @@ 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) */ - l_lock(&ns->ns_lock); - lock->l_flags |= LDLM_FL_LOCAL_ONLY; - LDLM_DEBUG(lock, "setting FL_LOCAL_ONLY"); - l_unlock(&ns->ns_lock); - - ldlm_lock_decref_and_cancel(lockh, mode); -} - -int ldlm_cli_enqueue(struct obd_export *exp, - struct ptlrpc_request *req, - struct ldlm_namespace *ns, - struct ldlm_res_id res_id, - __u32 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) -{ - struct ldlm_lock *lock; - struct ldlm_request *body; - struct ldlm_reply *reply; - int rc, size[2] = {sizeof(*body), lvb_len}, req_passed_in = 1; - int is_replay = *flags & LDLM_FL_REPLAY; - ENTRY; + int need_cancel = 0; - if (exp == NULL) { - LASSERT(!is_replay); - rc = ldlm_cli_enqueue_local(ns, res_id, type, policy, mode, - flags, blocking, completion, - glimpse, data, lvb_len, lvb_swabber, - lockh); - RETURN(rc); + /* Set a flag to prevent us from sending a CANCEL (bug 407) */ + lock_res_and_lock(lock); + /* Check that lock is not granted or failed, we might race. */ + if ((lock->l_req_mode != lock->l_granted_mode) && + !(lock->l_flags & LDLM_FL_FAILED)) { + /* Make sure that this lock will not be found by raced + * bl_ast and -EINVAL reply is sent to server anyways. + * bug 17645 */ + lock->l_flags |= LDLM_FL_LOCAL_ONLY | LDLM_FL_FAILED | + LDLM_FL_ATOMIC_CB; + need_cancel = 1; } + unlock_res_and_lock(lock); - /* 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); - LDLM_DEBUG(lock, "client-side enqueue START"); - LASSERT(exp == lock->l_conn_export); + if (need_cancel) { + LDLM_DEBUG(lock, + "setting FL_LOCAL_ONLY | LDLM_FL_FAILED | " + "LDLM_FL_ATOMIC_CB"); + ldlm_lock_decref_and_cancel(lockh, mode); } else { - lock = ldlm_lock_create(ns, NULL, res_id, type, mode, blocking, - completion, glimpse, data, lvb_len); - if (lock == NULL) - GOTO(out_nolock, rc = -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) - memcpy(&lock->l_policy_data, policy, sizeof(*policy)); - if (type == LDLM_EXTENT) - memcpy(&lock->l_req_extent, &policy->l_extent, - sizeof(policy->l_extent)); - LDLM_DEBUG(lock, "client-side enqueue START"); + LDLM_DEBUG(lock, "lock was granted or failed in race"); + ldlm_lock_decref(lockh, mode); } - if (req == NULL) { - req = ptlrpc_prep_req(class_exp2cliimp(exp), LDLM_ENQUEUE, 1, - size, NULL); - if (req == NULL) - GOTO(out_lock, rc = -ENOMEM); - req_passed_in = 0; - } else if (req->rq_reqmsg->buflens[0] != sizeof(*body)) - LBUG(); - - /* Dump lock data into the request buffer */ - body = lustre_msg_buf(req->rq_reqmsg, 0, sizeof (*body)); - ldlm_lock2desc(lock, &body->lock_desc); - body->lock_flags = *flags; + /* 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); + } +} - memcpy(&body->lock_handle1, lockh, sizeof(*lockh)); +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 lustre_handle old_hash_key; + struct ldlm_lock *lock; + struct ldlm_reply *reply; + int cleanup_phase = 1; + ENTRY; - /* Continue as normal. */ - if (!req_passed_in) { - int buffers = 1; - if (lvb_len > 0) - buffers = 2; - size[0] = sizeof(*reply); - req->rq_replen = lustre_msg_size(buffers, size); + lock = ldlm_handle2lock(lockh); + /* ldlm_cli_enqueue is holding a reference on this lock. */ + if (!lock) { + LASSERT(type == LDLM_FLOCK); + RETURN(-ENOLCK); } - lock->l_conn_export = exp; - lock->l_export = NULL; - lock->l_blocking_ast = blocking; - - LDLM_DEBUG(lock, "sending request"); - rc = ptlrpc_queue_wait(req); if (rc != ELDLM_OK) { LASSERT(!is_replay); @@ -301,35 +499,51 @@ int ldlm_cli_enqueue(struct obd_export *exp, rc == ELDLM_LOCK_ABORTED ? "ABORTED" : "FAILED"); if (rc == ELDLM_LOCK_ABORTED) { /* Before we return, swab the reply */ - reply = lustre_swab_repbuf(req, 0, sizeof(*reply), - lustre_swab_ldlm_reply); - if (reply == NULL) { - CERROR("Can't unpack ldlm_reply\n"); + reply = req_capsule_server_get(&req->rq_pill, + &RMF_DLM_REP); + if (reply == NULL) rc = -EPROTO; - } if (lvb_len) { - void *tmplvb; - tmplvb = lustre_swab_repbuf(req, 1, lvb_len, - lvb_swabber); + struct ost_lvb *tmplvb; + + req_capsule_set_size(&req->rq_pill, + &RMF_DLM_LVB, RCL_SERVER, + lvb_len); + tmplvb = req_capsule_server_swab_get(&req->rq_pill, + &RMF_DLM_LVB, + lvb_swabber); if (tmplvb == NULL) - GOTO(out_lock, rc = -EPROTO); + GOTO(cleanup, rc = -EPROTO); if (lvb != NULL) memcpy(lvb, tmplvb, lvb_len); } } - GOTO(out_lock, rc); + GOTO(cleanup, rc); } - reply = lustre_swab_repbuf(req, 0, sizeof(*reply), - lustre_swab_ldlm_reply); - if (reply == NULL) { - CERROR("Can't unpack ldlm_reply\n"); - GOTO(out_lock, rc = -EPROTO); - } + reply = req_capsule_server_get(&req->rq_pill, &RMF_DLM_REP); + if (reply == NULL) + GOTO(cleanup, rc = -EPROTO); + + /* lock enqueued on the server */ + cleanup_phase = 0; + + lock_res_and_lock(lock); + old_hash_key = lock->l_remote_handle; + lock->l_remote_handle = reply->lock_handle; + + /* Key change rehash lock in per-export hash with new key */ + if (exp->exp_lock_hash) + lustre_hash_rehash_key(exp->exp_lock_hash, &old_hash_key, + &lock->l_remote_handle, + &lock->l_exp_hash); - memcpy(&lock->l_remote_handle, &reply->lock_handle, - sizeof(lock->l_remote_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); @@ -346,33 +560,42 @@ int ldlm_cli_enqueue(struct obd_export *exp, lock->l_req_mode = newmode; } - if (reply->lock_desc.l_resource.lr_name.name[0] != - lock->l_resource->lr_name.name[0]) { - CDEBUG(D_INFO, "remote intent success, locking %ld " - "instead of %ld\n", + 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)lock->l_resource->lr_name.name[0]); - - ldlm_lock_change_resource(ns, lock, - reply->lock_desc.l_resource.lr_name); - if (lock->l_resource == NULL) { - LBUG(); - GOTO(out_lock, rc = -ENOMEM); - } + (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]); + + rc = ldlm_lock_change_resource(ns, lock, + &reply->lock_desc.l_resource.lr_name); + if (rc || lock->l_resource == NULL) + GOTO(cleanup, rc = -ENOMEM); LDLM_DEBUG(lock, "client-side enqueue, new resource"); } - if (policy != NULL) - memcpy(&lock->l_policy_data, - &reply->lock_desc.l_policy_data, - sizeof(reply->lock_desc.l_policy_data)); + 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) { - l_lock(&ns->ns_lock); - lock->l_flags |= LDLM_FL_CBPENDING; - l_unlock(&ns->ns_lock); + 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 | LDLM_FL_BL_AST; + unlock_res_and_lock(lock); LDLM_DEBUG(lock, "enqueue reply includes blocking AST"); } @@ -380,9 +603,14 @@ int ldlm_cli_enqueue(struct obd_export *exp, * 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, 1, lvb_len, lvb_swabber); + + req_capsule_set_size(&req->rq_pill, &RMF_DLM_LVB, RCL_SERVER, + lvb_len); + tmplvb = req_capsule_server_swab_get(&req->rq_pill, + &RMF_DLM_LVB, + lvb_swabber); if (tmplvb == NULL) - GOTO(out_lock, rc = -EPROTO); + GOTO(cleanup, rc = -EPROTO); memcpy(lock->l_lvb_data, tmplvb, lvb_len); } @@ -392,6 +620,8 @@ int ldlm_cli_enqueue(struct obd_export *exp, 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; } } @@ -403,44 +633,307 @@ int ldlm_cli_enqueue(struct obd_export *exp, LDLM_DEBUG(lock, "client-side enqueue END"); EXIT; - out_lock: - if (rc) +cleanup: + if (cleanup_phase == 1 && rc) failed_lock_cleanup(ns, lock, lockh, mode); - if (!req_passed_in && req != NULL) - ptlrpc_req_finished(req); + /* Put lock 2 times, the second reference is held by ldlm_cli_enqueue */ LDLM_LOCK_PUT(lock); - out_nolock: + LDLM_LOCK_RELEASE(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. */ +static inline int ldlm_req_handles_avail(int req_size, int off) +{ + int avail; + + avail = min_t(int, LDLM_MAXREQSIZE, CFS_PAGE_SIZE - 512) - req_size; + if (likely(avail >= 0)) + avail /= (int)sizeof(struct lustre_handle); + else + avail = 0; + avail += LDLM_LOCKREQ_HANDLES - off; + + return avail; +} + +static inline int ldlm_capsule_handles_avail(struct req_capsule *pill, + enum req_location loc, + int off) +{ + int size = req_capsule_msg_size(pill, loc); + return ldlm_req_handles_avail(size, off); +} + +static inline int ldlm_format_handles_avail(struct obd_import *imp, + const struct req_format *fmt, + enum req_location loc, int off) +{ + int size = req_capsule_fmt_size(imp->imp_msg_magic, fmt, loc); + return ldlm_req_handles_avail(size, off); +} + +/* Cancel lru locks and pack them into the enqueue request. Pack there the given + * @count locks in @cancels. */ +int ldlm_prep_elc_req(struct obd_export *exp, struct ptlrpc_request *req, + int version, int opc, int canceloff, + struct list_head *cancels, int count) +{ + struct ldlm_namespace *ns = exp->exp_obd->obd_namespace; + struct req_capsule *pill = &req->rq_pill; + struct ldlm_request *dlm = NULL; + int flags, avail, to_free, bufcount, pack = 0; + CFS_LIST_HEAD(head); + int rc; + ENTRY; + + if (cancels == NULL) + cancels = &head; + if (exp_connect_cancelset(exp)) { + /* Estimate the amount of available space in the request. */ + bufcount = req_capsule_filled_sizes(pill, RCL_CLIENT); + avail = ldlm_capsule_handles_avail(pill, RCL_CLIENT, canceloff); + + flags = ns_connect_lru_resize(ns) ? + LDLM_CANCEL_LRUR : LDLM_CANCEL_AGED; + to_free = !ns_connect_lru_resize(ns) && + opc == LDLM_ENQUEUE ? 1 : 0; + + /* Cancel lru locks here _only_ if the server supports + * EARLY_CANCEL. Otherwise we have to send extra CANCEL + * rpc, what will make us slower. */ + if (avail > count) + count += ldlm_cancel_lru_local(ns, cancels, to_free, + avail - count, 0, flags); + if (avail > count) + pack = count; + else + pack = avail; + req_capsule_set_size(pill, &RMF_DLM_REQ, RCL_CLIENT, + ldlm_request_bufsize(pack, opc)); + } + + rc = ptlrpc_request_pack(req, version, opc); + if (rc) { + ldlm_lock_list_put(cancels, l_bl_ast, count); + RETURN(rc); + } + + if (exp_connect_cancelset(exp)) { + if (canceloff) { + dlm = req_capsule_client_get(pill, &RMF_DLM_REQ); + LASSERT(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 = canceloff; + } + /* Pack into the request @pack lock handles. */ + ldlm_cli_cancel_list(cancels, pack, req, 0); + /* Prepare and send separate cancel rpc for others. */ + ldlm_cli_cancel_list(cancels, count - pack, NULL, 0); + } else { + ldlm_lock_list_put(cancels, l_bl_ast, count); + } + RETURN(0); +} + +int ldlm_prep_enqueue_req(struct obd_export *exp, struct ptlrpc_request *req, + struct list_head *cancels, int count) +{ + return ldlm_prep_elc_req(exp, req, LUSTRE_DLM_VERSION, LDLM_ENQUEUE, + LDLM_ENQUEUE_CANCEL_OFF, cancels, count); +} + +/* 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, + struct ldlm_enqueue_info *einfo, + const struct ldlm_res_id *res_id, + ldlm_policy_data_t *policy, int *flags, + 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; + int is_replay = *flags & LDLM_FL_REPLAY; + int req_passed_in = 1; + int rc, err; + 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_long(lockh, 0); + LASSERT(lock != NULL); + LDLM_DEBUG(lock, "client-side enqueue START"); + LASSERT(exp == lock->l_conn_export); + } else { + const struct ldlm_callback_suite cbs = { + .lcs_completion = einfo->ei_cb_cp, + .lcs_blocking = einfo->ei_cb_bl, + .lcs_glimpse = einfo->ei_cb_gl, + .lcs_weigh = einfo->ei_cb_wg + }; + lock = ldlm_lock_create(ns, res_id, einfo->ei_type, + einfo->ei_mode, &cbs, einfo->ei_cbdata, + lvb_len); + if (lock == NULL) + RETURN(-ENOMEM); + /* for the local lock, add the reference */ + ldlm_lock_addref_internal(lock, einfo->ei_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 (einfo->ei_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 (einfo->ei_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 = ptlrpc_request_alloc_pack(class_exp2cliimp(exp), + &RQF_LDLM_ENQUEUE, + LUSTRE_DLM_VERSION, + LDLM_ENQUEUE); + if (req == NULL) { + failed_lock_cleanup(ns, lock, lockh, einfo->ei_mode); + LDLM_LOCK_RELEASE(lock); + RETURN(-ENOMEM); + } + req_passed_in = 0; + if (reqp) + *reqp = req; + } else { + int len; + + req = *reqp; + len = req_capsule_get_size(&req->rq_pill, &RMF_DLM_REQ, + RCL_CLIENT); + LASSERTF(len >= sizeof(*body), "buflen[%d] = %d, not %d\n", + DLM_LOCKREQ_OFF, len, (int)sizeof(*body)); + } + + lock->l_conn_export = exp; + lock->l_export = NULL; + lock->l_blocking_ast = einfo->ei_cb_bl; + + /* Dump lock data into the request buffer */ + body = req_capsule_client_get(&req->rq_pill, &RMF_DLM_REQ); + ldlm_lock2desc(lock, &body->lock_desc); + body->lock_flags = *flags; + body->lock_handle[0] = *lockh; + + /* Continue as normal. */ + if (!req_passed_in) { + if (lvb_len > 0) { + req_capsule_extend(&req->rq_pill, + &RQF_LDLM_ENQUEUE_LVB); + req_capsule_set_size(&req->rq_pill, &RMF_DLM_LVB, + RCL_SERVER, lvb_len); + } + ptlrpc_request_set_replen(req); + } + + /* + * 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, einfo->ei_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); + + err = ldlm_cli_enqueue_fini(exp, req, einfo->ei_type, policy ? 1 : 0, + einfo->ei_mode, flags, lvb, lvb_len, + lvb_swabber, lockh, rc); + + /* If ldlm_cli_enqueue_fini did not find the lock, we need to free + * one reference that we took */ + if (err == -ENOLCK) + LDLM_LOCK_RELEASE(lock); + else + rc = err; + + 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) + __u32 *flags) { + struct ldlm_resource *res; + int rc; ENTRY; - if (lock->l_resource->lr_namespace->ns_client) { + if (ns_is_client(lock->l_resource->lr_namespace)) { CERROR("Trying to cancel local lock\n"); LBUG(); } LDLM_DEBUG(lock, "client-side local convert"); - ldlm_lock_convert(lock, new_mode, flags); - ldlm_reprocess_all(lock->l_resource); - + 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(0); + 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 */ -int ldlm_cli_convert(struct lustre_handle *lockh, int new_mode, int *flags) +/* 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, __u32 *flags) { - struct ldlm_request *body; - struct ldlm_reply *reply; - struct ldlm_lock *lock; - struct ldlm_resource *res; + struct ldlm_request *body; + struct ldlm_reply *reply; + struct ldlm_lock *lock; + struct ldlm_resource *res; struct ptlrpc_request *req; - int rc, size = sizeof(*body); + int rc; ENTRY; lock = ldlm_handle2lock(lockh); @@ -455,39 +948,47 @@ int ldlm_cli_convert(struct lustre_handle *lockh, int new_mode, int *flags) LDLM_DEBUG(lock, "client-side convert"); - req = ptlrpc_prep_req(class_exp2cliimp(lock->l_conn_export), - LDLM_CONVERT, 1, &size, NULL); - if (!req) - GOTO(out, rc = -ENOMEM); + req = ptlrpc_request_alloc_pack(class_exp2cliimp(lock->l_conn_export), + &RQF_LDLM_CONVERT, LUSTRE_DLM_VERSION, + LDLM_CONVERT); + if (req == NULL) { + LDLM_LOCK_PUT(lock); + RETURN(-ENOMEM); + } - body = lustre_msg_buf(req->rq_reqmsg, 0, sizeof (*body)); - memcpy(&body->lock_handle1, &lock->l_remote_handle, - sizeof(body->lock_handle1)); + body = req_capsule_client_get(&req->rq_pill, &RMF_DLM_REQ); + body->lock_handle[0] = lock->l_remote_handle; body->lock_desc.l_req_mode = new_mode; body->lock_flags = *flags; - size = sizeof(*reply); - req->rq_replen = lustre_msg_size(1, &size); + ptlrpc_request_set_replen(req); rc = ptlrpc_queue_wait(req); if (rc != ELDLM_OK) GOTO(out, rc); - reply = lustre_swab_repbuf(req, 0, sizeof (*reply), - lustre_swab_ldlm_reply); - if (reply == NULL) { - CERROR ("Can't unpack ldlm_reply\n"); - GOTO (out, rc = -EPROTO); - } + reply = req_capsule_server_get(&req->rq_pill, &RMF_DLM_REP); + if (reply == NULL) + 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) + if (res != NULL) { ldlm_reprocess_all(res); - /* Go to sleep until the lock is granted. */ - /* FIXME: or cancelled. */ - if (lock->l_completion_ast) - lock->l_completion_ast(lock, LDLM_FL_WAIT_NOREPROC, NULL); + /* 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); @@ -495,153 +996,640 @@ int ldlm_cli_convert(struct lustre_handle *lockh, int new_mode, int *flags) return rc; } -int ldlm_cli_cancel(struct lustre_handle *lockh) +/* Cancel locks locally. + * Returns: + * LDLM_FL_LOCAL_ONLY if tere is no need in a CANCEL rpc to the server; + * LDLM_FL_CANCELING otherwise; + * LDLM_FL_BL_AST if there is a need in a separate CANCEL rpc. */ +static int ldlm_cli_cancel_local(struct ldlm_lock *lock) { - struct ptlrpc_request *req; - struct ldlm_lock *lock; - struct ldlm_request *body; - int rc = 0, size = sizeof(*body); + int rc = LDLM_FL_LOCAL_ONLY; ENTRY; - /* concurrent cancels on the same handle can happen */ - lock = __ldlm_handle2lock(lockh, LDLM_FL_CANCELING); - if (lock == NULL) - RETURN(0); - if (lock->l_conn_export) { int local_only; - struct obd_import *imp; LDLM_DEBUG(lock, "client-side cancel"); /* Set this flag to prevent others from getting new references*/ - l_lock(&lock->l_resource->lr_namespace->ns_lock); + lock_res_and_lock(lock); lock->l_flags |= LDLM_FL_CBPENDING; - local_only = (lock->l_flags & LDLM_FL_LOCAL_ONLY); - l_unlock(&lock->l_resource->lr_namespace->ns_lock); + local_only = (lock->l_flags & + (LDLM_FL_LOCAL_ONLY|LDLM_FL_CANCEL_ON_BLOCK)); ldlm_cancel_callback(lock); + rc = (lock->l_flags & LDLM_FL_BL_AST) ? + LDLM_FL_BL_AST : LDLM_FL_CANCELING; + unlock_res_and_lock(lock); if (local_only) { - CDEBUG(D_INFO, "not sending request (at caller's " + CDEBUG(D_DLMTRACE, "not sending request (at caller's " "instruction)\n"); - goto local_cancel; + rc = LDLM_FL_LOCAL_ONLY; + } + ldlm_lock_cancel(lock); + } else { + if (ns_is_client(lock->l_resource->lr_namespace)) { + 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, + struct list_head *head, int count) +{ + struct ldlm_request *dlm; + struct ldlm_lock *lock; + int max, packed = 0; + ENTRY; - restart: - imp = class_exp2cliimp(lock->l_conn_export); + dlm = req_capsule_client_get(&req->rq_pill, &RMF_DLM_REQ); + LASSERT(dlm != NULL); + + /* Check the room in the request buffer. */ + max = req_capsule_get_size(&req->rq_pill, &RMF_DLM_REQ, RCL_CLIENT) - + 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; + LASSERT(lock->l_conn_export); + /* Pack the lock handle to the given request buffer. */ + LDLM_DEBUG(lock, "packing"); + dlm->lock_handle[dlm->lock_count++] = lock->l_remote_handle; + packed++; + } + CDEBUG(D_DLMTRACE, "%d locks packed\n", packed); + 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 obd_import *imp; + int free, sent = 0; + int rc = 0; + ENTRY; + + LASSERT(exp != NULL); + LASSERT(count > 0); + + OBD_FAIL_TIMEOUT(OBD_FAIL_LDLM_PAUSE_CANCEL, obd_fail_val); + + if (OBD_FAIL_CHECK(OBD_FAIL_LDLM_CANCEL_RACE)) + RETURN(count); + + free = ldlm_format_handles_avail(class_exp2cliimp(exp), + &RQF_LDLM_CANCEL, RCL_CLIENT, 0); + if (count > free) + count = free; + + while (1) { + int bufcount; + + imp = class_exp2cliimp(exp); if (imp == NULL || imp->imp_invalid) { - CDEBUG(D_HA, "skipping cancel on invalid import %p\n", - imp); - goto local_cancel; + CDEBUG(D_DLMTRACE, + "skipping cancel on invalid import %p\n", imp); + RETURN(count); } - req = ptlrpc_prep_req(imp, LDLM_CANCEL, 1, &size, NULL); - if (!req) + req = ptlrpc_request_alloc(imp, &RQF_LDLM_CANCEL); + if (req == NULL) GOTO(out, rc = -ENOMEM); + + bufcount = req_capsule_filled_sizes(&req->rq_pill, RCL_CLIENT); + req_capsule_set_size(&req->rq_pill, &RMF_DLM_REQ, RCL_CLIENT, + ldlm_request_bufsize(count, LDLM_CANCEL)); + + rc = ptlrpc_request_pack(req, LUSTRE_DLM_VERSION, LDLM_CANCEL); + if (rc) { + ptlrpc_request_free(req); + GOTO(out, rc); + } 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; + ptlrpc_at_set_req_timeout(req); - body = lustre_msg_buf(req->rq_reqmsg, 0, sizeof (*body)); - memcpy(&body->lock_handle1, &lock->l_remote_handle, - sizeof(body->lock_handle1)); - - req->rq_replen = lustre_msg_size(0, NULL); - - rc = ptlrpc_queue_wait(req); + ldlm_cancel_pack(req, cancels, count); + ptlrpc_request_set_replen(req); + if (flags & LDLM_FL_ASYNC) { + ptlrpcd_add_req(req, PSCOPE_OTHER); + sent = count; + GOTO(out, 0); + } else { + rc = ptlrpc_queue_wait(req); + } if (rc == ESTALE) { - CERROR("client/server (nid "LPU64") out of sync--not " - "fatal\n", - req->rq_import->imp_connection->c_peer.peer_nid); - } else if (rc == -ETIMEDOUT) { + CDEBUG(D_DLMTRACE, "client/server (nid %s) " + "out of sync -- not fatal\n", + libcfs_nid2str(req->rq_import-> + imp_connection->c_peer.nid)); + rc = 0; + } else if (rc == -ETIMEDOUT && /* check there was no reconnect*/ + req->rq_import_generation == imp->imp_generation) { ptlrpc_req_finished(req); - GOTO(restart, rc); + continue; } else if (rc != ELDLM_OK) { CERROR("Got rc %d from cancel RPC: canceling " "anyway\n", rc); + break; } - - ptlrpc_req_finished(req); - local_cancel: - ldlm_lock_cancel(lock); - } else { - if (lock->l_resource->lr_namespace->ns_client) { - LDLM_ERROR(lock, "Trying to cancel local lock\n"); - LBUG(); - } - LDLM_DEBUG(lock, "client-side local cancel"); - ldlm_lock_cancel(lock); - ldlm_reprocess_all(lock->l_resource); - LDLM_DEBUG(lock, "client-side local cancel handler END"); + sent = count; + break; } + ptlrpc_req_finished(req); EXIT; - out: - LDLM_LOCK_PUT(lock); - return rc; +out: + return sent ? sent : rc; } -int ldlm_cancel_lru(struct ldlm_namespace *ns) +static inline struct ldlm_pool *ldlm_imp2pl(struct obd_import *imp) { - struct list_head *tmp, *next; - int count, rc = 0; + LASSERT(imp != NULL); + return &imp->imp_obd->obd_namespace->ns_pool; +} + +/** + * Update client's obd pool related fields with new SLV and Limit from \a req. + */ +int ldlm_cli_update_pool(struct ptlrpc_request *req) +{ + struct obd_device *obd; + __u64 old_slv, new_slv; + __u32 new_limit; ENTRY; + if (unlikely(!req->rq_import || !req->rq_import->imp_obd || + !imp_connect_lru_resize(req->rq_import))) + { + /* + * Do nothing for corner cases. + */ + RETURN(0); + } + + /* + * In some cases RPC may contain slv and limit zeroed out. This is + * the case when server does not support lru resize feature. This is + * also possible in some recovery cases when server side reqs have no + * ref to obd export and thus access to server side namespace is no + * possible. + */ + if (lustre_msg_get_slv(req->rq_repmsg) == 0 || + lustre_msg_get_limit(req->rq_repmsg) == 0) { + DEBUG_REQ(D_HA, req, "Zero SLV or Limit found " + "(SLV: "LPU64", Limit: %u)", + lustre_msg_get_slv(req->rq_repmsg), + lustre_msg_get_limit(req->rq_repmsg)); + RETURN(0); + } + + new_limit = lustre_msg_get_limit(req->rq_repmsg); + new_slv = lustre_msg_get_slv(req->rq_repmsg); + obd = req->rq_import->imp_obd; + + /* + * Set new SLV and Limit to obd fields to make accessible for pool + * thread. We do not access obd_namespace and pool directly here + * as there is no reliable way to make sure that they are still + * alive in cleanup time. Evil races are possible which may cause + * oops in that time. + */ + write_lock(&obd->obd_pool_lock); + old_slv = obd->obd_pool_slv; + obd->obd_pool_slv = new_slv; + obd->obd_pool_limit = new_limit; + write_unlock(&obd->obd_pool_lock); + + RETURN(0); +} +EXPORT_SYMBOL(ldlm_cli_update_pool); - l_lock(&ns->ns_lock); - count = ns->ns_nr_unused - ns->ns_max_unused; +int ldlm_cli_cancel(struct lustre_handle *lockh) +{ + struct obd_export *exp; + int avail, flags, count = 1, rc = 0; + struct ldlm_namespace *ns; + struct ldlm_lock *lock; + CFS_LIST_HEAD(cancels); + ENTRY; - if (count <= 0) { - l_unlock(&ns->ns_lock); + /* concurrent cancels on the same handle can happen */ + lock = ldlm_handle2lock_long(lockh, LDLM_FL_CANCELING); + if (lock == NULL) { + LDLM_DEBUG_NOLOCK("lock is already being destroyed\n"); RETURN(0); } - list_for_each_safe(tmp, next, &ns->ns_unused_list) { - struct ldlm_lock *lock; - lock = list_entry(tmp, struct ldlm_lock, l_lru); + rc = ldlm_cli_cancel_local(lock); + if (rc < 0 || rc == LDLM_FL_LOCAL_ONLY) { + LDLM_LOCK_RELEASE(lock); + RETURN(rc < 0 ? rc : 0); + } + /* Even if the lock is marked as LDLM_FL_BL_AST, this is a LDLM_CANCEL + * rpc which goes to canceld portal, so we can cancel other lru locks + * here and send them all as one LDLM_CANCEL rpc. */ + LASSERT(list_empty(&lock->l_bl_ast)); + list_add(&lock->l_bl_ast, &cancels); + + exp = lock->l_conn_export; + if (exp_connect_cancelset(exp)) { + avail = ldlm_format_handles_avail(class_exp2cliimp(exp), + &RQF_LDLM_CANCEL, + RCL_CLIENT, 0); + LASSERT(avail > 0); + + ns = lock->l_resource->lr_namespace; + flags = ns_connect_lru_resize(ns) ? + LDLM_CANCEL_LRUR : LDLM_CANCEL_AGED; + count += ldlm_cancel_lru_local(ns, &cancels, 0, avail - 1, + LDLM_FL_BL_AST, flags); + } + ldlm_cli_cancel_list(&cancels, count, NULL, 0); + RETURN(0); +} + +/* XXX until we will have compound requests and can cut cancels from generic rpc + * we need send cancels with LDLM_FL_BL_AST flag as separate rpc */ +static int ldlm_cancel_list(struct list_head *cancels, int count, int flags) +{ + CFS_LIST_HEAD(head); + struct ldlm_lock *lock, *next; + int left = 0, bl_ast = 0, rc; - LASSERT(!lock->l_readers && !lock->l_writers); + left = count; + list_for_each_entry_safe(lock, next, cancels, l_bl_ast) { + if (left-- == 0) + break; - /* 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; + if (flags & LDLM_FL_LOCAL_ONLY) { + rc = LDLM_FL_LOCAL_ONLY; + ldlm_lock_cancel(lock); + } else { + rc = ldlm_cli_cancel_local(lock); + } + if (!(flags & LDLM_FL_BL_AST) && (rc == LDLM_FL_BL_AST)) { + LDLM_DEBUG(lock, "Cancel lock separately"); + list_del_init(&lock->l_bl_ast); + list_add(&lock->l_bl_ast, &head); + bl_ast ++; + continue; + } + if (rc == LDLM_FL_LOCAL_ONLY) { + /* CANCEL RPC should not be sent to server. */ + list_del_init(&lock->l_bl_ast); + LDLM_LOCK_RELEASE(lock); + count--; + } + + } + if (bl_ast > 0) { + count -= bl_ast; + ldlm_cli_cancel_list(&head, bl_ast, NULL, 0); + } + + RETURN(count); +} + +/** + * Callback function for lru-resize policy. Makes decision whether to keep + * \a lock in LRU for current \a LRU size \a unused, added in current scan + * \a added and number of locks to be preferably canceled \a count. + * + * \retval LDLM_POLICY_KEEP_LOCK keep lock in LRU in stop scanning + * + * \retval LDLM_POLICY_CANCEL_LOCK cancel lock from LRU + */ +static ldlm_policy_res_t ldlm_cancel_lrur_policy(struct ldlm_namespace *ns, + struct ldlm_lock *lock, + int unused, int added, + int count) +{ + cfs_time_t cur = cfs_time_current(); + struct ldlm_pool *pl = &ns->ns_pool; + __u64 slv, lvf, lv; + cfs_time_t la; + + /* + * Stop lru processing when we reached passed @count or checked all + * locks in lru. + */ + if (count && added >= count) + return LDLM_POLICY_KEEP_LOCK; + + slv = ldlm_pool_get_slv(pl); + lvf = ldlm_pool_get_lvf(pl); + la = cfs_duration_sec(cfs_time_sub(cur, + lock->l_last_used)); + + /* + * Stop when slv is not yet come from server or lv is smaller than + * it is. + */ + lv = lvf * la * unused; + + /* + * Inform pool about current CLV to see it via proc. + */ + ldlm_pool_set_clv(pl, lv); + return (slv == 1 || lv < slv) ? + LDLM_POLICY_KEEP_LOCK : LDLM_POLICY_CANCEL_LOCK; +} + +/** + * Callback function for proc used policy. Makes decision whether to keep + * \a lock in LRU for current \a LRU size \a unused, added in current scan + * \a added and number of locks to be preferably canceled \a count. + * + * \retval LDLM_POLICY_KEEP_LOCK keep lock in LRU in stop scanning + * + * \retval LDLM_POLICY_CANCEL_LOCK cancel lock from LRU + */ +static ldlm_policy_res_t ldlm_cancel_passed_policy(struct ldlm_namespace *ns, + struct ldlm_lock *lock, + int unused, int added, + int count) +{ + /* + * Stop lru processing when we reached passed @count or checked all + * locks in lru. + */ + return (added >= count) ? + LDLM_POLICY_KEEP_LOCK : LDLM_POLICY_CANCEL_LOCK; +} + +/** + * Callback function for aged policy. Makes decision whether to keep + * \a lock in LRU for current \a LRU size \a unused, added in current scan + * \a added and number of locks to be preferably canceled \a count. + * + * \retval LDLM_POLICY_KEEP_LOCK keep lock in LRU in stop scanning + * + * \retval LDLM_POLICY_CANCEL_LOCK cancel lock from LRU + */ +static ldlm_policy_res_t ldlm_cancel_aged_policy(struct ldlm_namespace *ns, + struct ldlm_lock *lock, + int unused, int added, + int count) +{ + /* + * Stop lru processing if young lock is found and we reached passed + * @count. + */ + return ((added >= count) && + cfs_time_before(cfs_time_current(), + cfs_time_add(lock->l_last_used, + ns->ns_max_age))) ? + LDLM_POLICY_KEEP_LOCK : LDLM_POLICY_CANCEL_LOCK; +} + +/** + * Callback function for default policy. Makes decision whether to keep + * \a lock in LRU for current \a LRU size \a unused, added in current scan + * \a added and number of locks to be preferably canceled \a count. + * + * \retval LDLM_POLICY_KEEP_LOCK keep lock in LRU in stop scanning + * + * \retval LDLM_POLICY_CANCEL_LOCK cancel lock from LRU + */ +static ldlm_policy_res_t ldlm_cancel_default_policy(struct ldlm_namespace *ns, + struct ldlm_lock *lock, + int unused, int added, + int count) +{ + /* + * Stop lru processing when we reached passed @count or checked all + * locks in lru. + */ + return (added >= count) ? + LDLM_POLICY_KEEP_LOCK : LDLM_POLICY_CANCEL_LOCK; +} + +typedef ldlm_policy_res_t (*ldlm_cancel_lru_policy_t)(struct ldlm_namespace *, + struct ldlm_lock *, int, + int, int); + +static ldlm_cancel_lru_policy_t +ldlm_cancel_lru_policy(struct ldlm_namespace *ns, int flags) +{ + if (ns_connect_lru_resize(ns)) { + if (flags & LDLM_CANCEL_SHRINK) + /* We kill passed number of old locks. */ + return ldlm_cancel_passed_policy; + else if (flags & LDLM_CANCEL_LRUR) + return ldlm_cancel_lrur_policy; + else if (flags & LDLM_CANCEL_PASSED) + return ldlm_cancel_passed_policy; + } else { + if (flags & LDLM_CANCEL_AGED) + return ldlm_cancel_aged_policy; + } + + return ldlm_cancel_default_policy; +} + +/* - 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. + * + * Calling policies for enabled lru resize: + * ---------------------------------------- + * flags & LDLM_CANCEL_LRUR - use lru resize policy (SLV from server) to + * cancel not more than @count locks; + * + * flags & LDLM_CANCEL_PASSED - cancel @count number of old locks (located at + * the beginning of lru list); + * + * flags & LDLM_CANCEL_SHRINK - cancel not more than @count locks according to + * memory pressre policy function; + * + * flags & LDLM_CANCEL_AGED - cancel alocks according to "aged policy". + */ +int ldlm_cancel_lru_local(struct ldlm_namespace *ns, struct list_head *cancels, + int count, int max, int cancel_flags, int flags) +{ + ldlm_cancel_lru_policy_t pf; + struct ldlm_lock *lock, *next; + int added = 0, unused; + ENTRY; + + spin_lock(&ns->ns_unused_lock); + unused = ns->ns_nr_unused; + + if (!ns_connect_lru_resize(ns)) + count += unused - ns->ns_max_unused; + + pf = ldlm_cancel_lru_policy(ns, flags); + LASSERT(pf != NULL); + + while (!list_empty(&ns->ns_unused_list)) { + /* For any flags, stop scanning if @max is reached. */ + if (max && added >= max) + break; + + list_for_each_entry_safe(lock, next, &ns->ns_unused_list, l_lru){ + /* No locks which got blocking requests. */ + LASSERT(!(lock->l_flags & LDLM_FL_BL_AST)); - LDLM_LOCK_GET(lock); /* dropped by bl thread */ - ldlm_lock_remove_from_lru(lock); - ldlm_bl_to_thread(ns, NULL, lock); + /* Somebody is already doing CANCEL. No need in this + * lock in lru, do not traverse it again. */ + if (!(lock->l_flags & LDLM_FL_CANCELING)) + break; - if (--count == 0) + ldlm_lock_remove_from_lru_nolock(lock); + } + if (&lock->l_lru == &ns->ns_unused_list) + break; + + LDLM_LOCK_GET(lock); + spin_unlock(&ns->ns_unused_lock); + lu_ref_add(&lock->l_reference, __FUNCTION__, cfs_current()); + + /* Pass the lock through the policy filter and see if it + * should stay in lru. + * + * Even for shrinker policy we stop scanning if + * we find a lock that should stay in the cache. + * We should take into account lock age anyway + * as new lock even if it is small of weight is + * valuable resource. + * + * That is, for shrinker policy we drop only + * old locks, but additionally chose them by + * their weight. Big extent locks will stay in + * the cache. */ + if (pf(ns, lock, unused, added, count) == + LDLM_POLICY_KEEP_LOCK) { + lu_ref_del(&lock->l_reference, + __FUNCTION__, cfs_current()); + LDLM_LOCK_RELEASE(lock); + spin_lock(&ns->ns_unused_lock); break; + } + + lock_res_and_lock(lock); + /* Check flags again under the lock. */ + if ((lock->l_flags & LDLM_FL_CANCELING) || + (ldlm_lock_remove_from_lru(lock) == 0)) { + /* other thread is removing lock from lru or + * somebody is already doing CANCEL or + * there is a blocking request which will send + * cancel by itseft or the lock is matched + * is already not unused. */ + unlock_res_and_lock(lock); + lu_ref_del(&lock->l_reference, + __FUNCTION__, cfs_current()); + LDLM_LOCK_RELEASE(lock); + spin_lock(&ns->ns_unused_lock); + continue; + } + LASSERT(!lock->l_readers && !lock->l_writers); + + /* If we have chosen to cancel 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 nevertheless bug 5666 says it is + * used only on server */ + LASSERT(list_empty(&lock->l_bl_ast)); + list_add(&lock->l_bl_ast, cancels); + unlock_res_and_lock(lock); + lu_ref_del(&lock->l_reference, __FUNCTION__, cfs_current()); + spin_lock(&ns->ns_unused_lock); + added++; + unused--; } - l_unlock(&ns->ns_lock); - RETURN(rc); + spin_unlock(&ns->ns_unused_lock); + RETURN(ldlm_cancel_list(cancels, added, cancel_flags)); } -static int ldlm_cli_cancel_unused_resource(struct ldlm_namespace *ns, - struct ldlm_res_id res_id, int flags, - void *opaque) +/* 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, int nr, ldlm_sync_t sync, + int flags) { - struct ldlm_resource *res; - struct list_head *tmp, *next, list = LIST_HEAD_INIT(list); - struct ldlm_ast_work *w; + CFS_LIST_HEAD(cancels); + int count, 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); +#ifndef __KERNEL__ + sync = LDLM_SYNC; /* force to be sync in user space */ +#endif + count = ldlm_cancel_lru_local(ns, &cancels, nr, 0, 0, flags); + if (sync == LDLM_ASYNC) { + rc = ldlm_bl_to_thread_list(ns, NULL, &cancels, count); + if (rc == 0) + RETURN(count); } - l_lock(&ns->ns_lock); - list_for_each(tmp, &res->lr_granted) { - struct ldlm_lock *lock; - lock = list_entry(tmp, struct ldlm_lock, l_res_link); + /* If an error occured in ASYNC mode, or this is SYNC mode, + * cancel the list. */ + ldlm_cli_cancel_list(&cancels, count, NULL, 0); + RETURN(count); +} + +/* 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 cancel_flags, void *opaque) +{ + struct ldlm_lock *lock; + int count = 0; + 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); @@ -650,62 +1638,144 @@ static int ldlm_cli_cancel_unused_resource(struct ldlm_namespace *ns, } if (lock->l_readers || lock->l_writers) { - if (flags & LDLM_FL_WARN) { + if (cancel_flags & LDLM_FL_WARN) { LDLM_ERROR(lock, "lock in use"); //LBUG(); } continue; } - /* See CBPENDING comment in ldlm_cancel_lru */ - lock->l_flags |= LDLM_FL_CBPENDING; + /* If somebody is already doing CANCEL, or blocking ast came, + * skip this lock. */ + if (lock->l_flags & LDLM_FL_BL_AST || + lock->l_flags & LDLM_FL_CANCELING) + continue; - OBD_ALLOC(w, sizeof(*w)); - LASSERT(w); + if (lockmode_compat(lock->l_granted_mode, mode)) + continue; - w->w_lock = LDLM_LOCK_GET(lock); + /* 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; - /* Prevent the cancel callback from being called by setting - * LDLM_FL_CANCEL in the lock. Very sneaky. -p */ - if (flags & LDLM_FL_NO_CALLBACK) - w->w_lock->l_flags |= LDLM_FL_CANCEL; + /* See CBPENDING comment in ldlm_cancel_lru */ + lock->l_flags |= LDLM_FL_CBPENDING | LDLM_FL_CANCELING | + lock_flags; - list_add(&w->w_list, &list); + LASSERT(list_empty(&lock->l_bl_ast)); + list_add(&lock->l_bl_ast, cancels); + LDLM_LOCK_GET(lock); + count++; } - l_unlock(&ns->ns_lock); + unlock_res(res); - list_for_each_safe(tmp, next, &list) { - struct lustre_handle lockh; - int rc; - w = list_entry(tmp, struct ldlm_ast_work, w_list); + RETURN(ldlm_cancel_list(cancels, count, cancel_flags)); +} - if (flags & LDLM_FL_LOCAL_ONLY) { - ldlm_lock_cancel(w->w_lock); +/* 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 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, cancels, count); + else + res = ldlm_cli_cancel_req(lock->l_conn_export, + cancels, count, + flags); } else { - ldlm_lock2handle(w->w_lock, &lockh); - rc = ldlm_cli_cancel(&lockh); - if (rc != ELDLM_OK) - CERROR("ldlm_cli_cancel: %d\n", rc); + 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; } - list_del(&w->w_list); - LDLM_LOCK_PUT(w->w_lock); - OBD_FREE(w, sizeof(*w)); + + count -= res; + ldlm_lock_list_put(cancels, l_bl_ast, res); } + LASSERT(count == 0); + RETURN(0); +} - ldlm_resource_putref(res); +int ldlm_cli_cancel_unused_resource(struct ldlm_namespace *ns, + const struct ldlm_res_id *res_id, + ldlm_policy_data_t *policy, + ldlm_mode_t 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); + } + + LDLM_RESOURCE_ADDREF(res); + count = ldlm_cancel_resource_local(res, &cancels, policy, mode, + 0, flags, opaque); + rc = ldlm_cli_cancel_list(&cancels, count, NULL, flags); + if (rc != ELDLM_OK) + CERROR("ldlm_cli_cancel_unused_resource: %d\n", rc); + + LDLM_RESOURCE_DELREF(res); + 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. - * If flags & LDLM_FL_NO_CALLBACK, don't run the cancel callback. - * If flags & LDLM_FL_WARN, print a warning if some locks are still in use. */ + * to notify the server. */ int ldlm_cli_cancel_unused(struct ldlm_namespace *ns, - struct ldlm_res_id *res_id, int flags, void *opaque) + const struct ldlm_res_id *res_id, + int flags, void *opaque) { int i; ENTRY; @@ -714,28 +1784,38 @@ int ldlm_cli_cancel_unused(struct ldlm_namespace *ns, RETURN(ELDLM_OK); if (res_id) - RETURN(ldlm_cli_cancel_unused_resource(ns, *res_id, flags, + RETURN(ldlm_cli_cancel_unused_resource(ns, res_id, NULL, + LCK_MINMODE, flags, opaque)); - l_lock(&ns->ns_lock); + spin_lock(&ns->ns_hash_lock); for (i = 0; i < RES_HASH_SIZE; i++) { - struct list_head *tmp, *pos; - list_for_each_safe(tmp, pos, &(ns->ns_hash[i])) { - int rc; + 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, + LDLM_RESOURCE_ADDREF(res); + rc = ldlm_cli_cancel_unused_resource(ns, &res->lr_name, + NULL, LCK_MINMODE, flags, opaque); if (rc) - CERROR("cancel_unused_res ("LPU64"): %d\n", + CERROR("ldlm_cli_cancel_unused ("LPU64"): %d\n", res->lr_name.name[0], rc); - ldlm_resource_putref(res); + + LDLM_RESOURCE_DELREF(res); + spin_lock(&ns->ns_hash_lock); + tmp = tmp->next; + ldlm_resource_putref_locked(res); } } - l_unlock(&ns->ns_lock); + spin_unlock(&ns->ns_hash_lock); RETURN(ELDLM_OK); } @@ -748,14 +1828,13 @@ int ldlm_resource_foreach(struct ldlm_resource *res, ldlm_iterator_t iter, struct list_head *tmp, *next; struct ldlm_lock *lock; int rc = LDLM_ITER_CONTINUE; - struct ldlm_namespace *ns = res->lr_namespace; ENTRY; if (!res) RETURN(LDLM_ITER_CONTINUE); - l_lock(&ns->ns_lock); + lock_res(res); list_for_each_safe(tmp, next, &res->lr_granted) { lock = list_entry(tmp, struct ldlm_lock, l_res_link); @@ -777,7 +1856,7 @@ int ldlm_resource_foreach(struct ldlm_resource *res, ldlm_iterator_t iter, GOTO(out, rc = LDLM_ITER_STOP); } out: - l_unlock(&ns->ns_lock); + unlock_res(res); RETURN(rc); } @@ -808,47 +1887,56 @@ 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; - l_lock(&ns->ns_lock); + ENTRY; + spin_lock(&ns->ns_hash_lock); for (i = 0; i < RES_HASH_SIZE; i++) { - struct list_head *tmp, *next; - list_for_each_safe(tmp, next, &(ns->ns_hash[i])) { - struct ldlm_resource *res = - list_entry(tmp, struct ldlm_resource, lr_hash); - + 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); + LDLM_RESOURCE_ADDREF(res); + rc = iter(res, closure); - ldlm_resource_putref(res); + + LDLM_RESOURCE_DELREF(res); + spin_lock(&ns->ns_hash_lock); + tmp = tmp->next; + ldlm_resource_putref_locked(res); if (rc == LDLM_ITER_STOP) GOTO(out, rc); } } out: - l_unlock(&ns->ns_lock); + spin_unlock(&ns->ns_hash_lock); RETURN(rc); } /* non-blocking function to manipulate a lock whose cb_data is being put away.*/ -void ldlm_change_cbdata(struct ldlm_namespace *ns, struct ldlm_res_id *res_id, - ldlm_iterator_t iter, void *data) +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"); + CERROR("must pass in namespace\n"); LBUG(); } - res = ldlm_resource_get(ns, NULL, *res_id, 0, 0); + res = ldlm_resource_get(ns, NULL, res_id, 0, 0); if (res == NULL) { EXIT; return; } - l_lock(&ns->ns_lock); + LDLM_RESOURCE_ADDREF(res); ldlm_resource_foreach(res, iter, data); - l_unlock(&ns->ns_lock); + LDLM_RESOURCE_DELREF(res); ldlm_resource_putref(res); EXIT; } @@ -860,47 +1948,86 @@ 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. */ - list_add(&lock->l_pending_chain, list); + 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, - void * data, int rc) +static int replay_lock_interpret(const struct lu_env *env, + struct ptlrpc_request *req, + struct ldlm_async_args *aa, int rc) { - struct ldlm_lock *lock; - struct ldlm_reply *reply; + struct lustre_handle old_hash_key; + struct ldlm_lock *lock; + struct ldlm_reply *reply; + struct obd_export *exp; + ENTRY; atomic_dec(&req->rq_import->imp_replay_inflight); if (rc != ELDLM_OK) GOTO(out, rc); - lock = req->rq_async_args.pointer_arg[0]; - LASSERT(lock != NULL); - reply = lustre_swab_repbuf(req, 0, sizeof (*reply), - lustre_swab_ldlm_reply); - if (reply == NULL) { - CERROR("Can't unpack ldlm_reply\n"); - GOTO (out, rc = -EPROTO); + reply = req_capsule_server_get(&req->rq_pill, &RMF_DLM_REP); + if (reply == NULL) + 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); } - memcpy(&lock->l_remote_handle, &reply->lock_handle, - sizeof(lock->l_remote_handle)); + old_hash_key = lock->l_remote_handle; + lock->l_remote_handle = reply->lock_handle; + + /* Key change rehash lock in per-export hash with new key */ + exp = req->rq_export; + if (exp && exp->exp_lock_hash) + lustre_hash_rehash_key(exp->exp_lock_hash, &old_hash_key, + &lock->l_remote_handle, + &lock->l_exp_hash); + LDLM_DEBUG(lock, "replayed lock:"); ptlrpc_import_recovery_state_machine(req->rq_import); - out: + 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; - int buffers = 1; - int size[2]; + struct ldlm_async_args *aa; + struct ldlm_request *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. * @@ -924,32 +2051,39 @@ static int replay_one_lock(struct obd_import *imp, struct ldlm_lock *lock) else flags = LDLM_FL_REPLAY; - size[0] = sizeof(*body); - req = ptlrpc_prep_req(imp, LDLM_ENQUEUE, 1, size, NULL); - if (!req) + req = ptlrpc_request_alloc_pack(imp, &RQF_LDLM_ENQUEUE, + LUSTRE_DLM_VERSION, LDLM_ENQUEUE); + if (req == NULL) 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, 0, sizeof (*body)); + body = req_capsule_client_get(&req->rq_pill, &RMF_DLM_REQ); ldlm_lock2desc(lock, &body->lock_desc); body->lock_flags = flags; - ldlm_lock2handle(lock, &body->lock_handle1); - size[0] = sizeof(*reply); + ldlm_lock2handle(lock, &body->lock_handle[0]); if (lock->l_lvb_len != 0) { - buffers = 2; - size[1] = lock->l_lvb_len; + req_capsule_extend(&req->rq_pill, &RQF_LDLM_ENQUEUE_LVB); + req_capsule_set_size(&req->rq_pill, &RMF_DLM_LVB, RCL_SERVER, + lock->l_lvb_len); } - req->rq_replen = lustre_msg_size(buffers, size); + ptlrpc_request_set_replen(req); + /* 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); - req->rq_async_args.pointer_arg[0] = lock; - req->rq_interpret_reply = replay_lock_interpret; - ptlrpcd_add_req(req); + CLASSERT(sizeof(*aa) <= sizeof(req->rq_async_args)); + aa = ptlrpc_req_async_args(req); + aa->lock_handle = body->lock_handle[0]; + req->rq_interpret_reply = (ptlrpc_interpterer_t)replay_lock_interpret; + ptlrpcd_add_req(req, PSCOPE_OTHER); RETURN(0); } @@ -957,28 +2091,25 @@ static int replay_one_lock(struct obd_import *imp, struct ldlm_lock *lock) int ldlm_replay_locks(struct obd_import *imp) { struct ldlm_namespace *ns = imp->imp_obd->obd_namespace; - struct list_head list, *pos, *next; - struct ldlm_lock *lock; + CFS_LIST_HEAD(list); + struct ldlm_lock *lock, *next; int rc = 0; ENTRY; - 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); - l_lock(&ns->ns_lock); (void)ldlm_namespace_foreach(ns, ldlm_chain_lock_for_replay, &list); - list_for_each_safe(pos, next, &list) { - lock = list_entry(pos, struct ldlm_lock, l_pending_chain); - rc = replay_one_lock(imp, lock); + list_for_each_entry_safe(lock, next, &list, l_pending_chain) { + list_del_init(&lock->l_pending_chain); if (rc) - break; /* or try to do the rest? */ + continue; /* or try to do the rest? */ + rc = replay_one_lock(imp, lock); } - l_unlock(&ns->ns_lock); atomic_dec(&imp->imp_replay_inflight);