lustre/ldlm/ldlm_request.c

   1 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
   2  * vim:expandtab:shiftwidth=8:tabstop=8:
   3  *
   4  *  Copyright (C) 2002, 2003 Cluster File Systems, Inc.
   5  *
   6  *   This file is part of the Lustre file system, http://www.lustre.org
   7  *   Lustre is a trademark of Cluster File Systems, Inc.
   8  *
   9  *   You may have signed or agreed to another license before downloading
  10  *   this software.  If so, you are bound by the terms and conditions
  11  *   of that agreement, and the following does not apply to you.  See the
  12  *   LICENSE file included with this distribution for more information.
  13  *
  14  *   If you did not agree to a different license, then this copy of Lustre
  15  *   is open source software; you can redistribute it and/or modify it
  16  *   under the terms of version 2 of the GNU General Public License as
  17  *   published by the Free Software Foundation.
  18  *
  19  *   In either case, Lustre is distributed in the hope that it will be
  20  *   useful, but WITHOUT ANY WARRANTY; without even the implied warranty
  21  *   of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  22  *   license text for more details.
  23  */
  24
  25 #define DEBUG_SUBSYSTEM S_LDLM
  26 #ifndef __KERNEL__
  27 #include <signal.h>
  28 #include <liblustre.h>
  29 #endif
  30
  31 #include <lustre_dlm.h>
  32 #include <obd_class.h>
  33 #include <obd.h>
  34
  35 #include "ldlm_internal.h"
  36
  37 static void interrupted_completion_wait(void *data)
  38 {
  39 }
  40
  41 struct lock_wait_data {
  42         struct ldlm_lock *lwd_lock;
  43         __u32             lwd_conn_cnt;
  44 };
  45
  46 struct ldlm_async_args {
  47         struct lustre_handle lock_handle;
  48 };
  49
  50 int ldlm_expired_completion_wait(void *data)
  51 {
  52         struct lock_wait_data *lwd = data;
  53         struct ldlm_lock *lock = lwd->lwd_lock;
  54         struct obd_import *imp;
  55         struct obd_device *obd;
  56
  57         ENTRY;
  58         if (lock->l_conn_export == NULL) {
  59                 static cfs_time_t next_dump = 0, last_dump = 0;
  60
  61                 if (ptlrpc_check_suspend())
  62                         RETURN(0);
  63
  64                 LDLM_ERROR(lock, "lock timed out (enqueued at "CFS_TIME_T", "
  65                            CFS_DURATION_T"s ago); not entering recovery in "
  66                            "server code, just going back to sleep",
  67                            lock->l_enqueued_time.tv_sec,
  68                            cfs_time_current_sec() - lock->l_enqueued_time.tv_sec);
  69                 if (cfs_time_after(cfs_time_current(), next_dump)) {
  70                         last_dump = next_dump;
  71                         next_dump = cfs_time_shift(300);
  72                         ldlm_namespace_dump(D_DLMTRACE,
  73                                             lock->l_resource->lr_namespace);
  74                         if (last_dump == 0)
  75                                 libcfs_debug_dumplog();
  76                 }
  77                 RETURN(0);
  78         }
  79
  80         obd = lock->l_conn_export->exp_obd;
  81         imp = obd->u.cli.cl_import;
  82         ptlrpc_fail_import(imp, lwd->lwd_conn_cnt);
  83         LDLM_ERROR(lock, "lock timed out (enqueued at "CFS_TIME_T", "
  84                   CFS_DURATION_T"s ago), entering recovery for %s@%s",
  85                   lock->l_enqueued_time.tv_sec,
  86                   cfs_time_current_sec() - lock->l_enqueued_time.tv_sec,
  87                   obd2cli_tgt(obd), imp->imp_connection->c_remote_uuid.uuid);
  88
  89         RETURN(0);
  90 }
  91
  92 static int is_granted_or_cancelled(struct ldlm_lock *lock)
  93 {
  94         int ret = 0;
  95
  96         lock_res_and_lock(lock);
  97         if (((lock->l_req_mode == lock->l_granted_mode) &&
  98              !(lock->l_flags & LDLM_FL_CP_REQD)) ||
  99             (lock->l_flags & LDLM_FL_FAILED))
 100                 ret = 1;
 101         unlock_res_and_lock(lock);
 102
 103         return ret;
 104 }
 105
 106 int ldlm_completion_ast(struct ldlm_lock *lock, int flags, void *data)
 107 {
 108         /* XXX ALLOCATE - 160 bytes */
 109         struct lock_wait_data lwd;
 110         struct obd_device *obd;
 111         struct obd_import *imp = NULL;
 112         struct l_wait_info lwi;
 113         int rc = 0;
 114         ENTRY;
 115
 116         if (flags == LDLM_FL_WAIT_NOREPROC) {
 117                 LDLM_DEBUG(lock, "client-side enqueue waiting on pending lock");
 118                 goto noreproc;
 119         }
 120
 121         if (!(flags & (LDLM_FL_BLOCK_WAIT | LDLM_FL_BLOCK_GRANTED |
 122                        LDLM_FL_BLOCK_CONV))) {
 123                 cfs_waitq_signal(&lock->l_waitq);
 124                 RETURN(0);
 125         }
 126
 127         LDLM_DEBUG(lock, "client-side enqueue returned a blocked lock, "
 128                    "sleeping");
 129         ldlm_lock_dump(D_OTHER, lock, 0);
 130         ldlm_reprocess_all(lock->l_resource);
 131
 132 noreproc:
 133
 134         obd = class_exp2obd(lock->l_conn_export);
 135
 136         /* if this is a local lock, then there is no import */
 137         if (obd != NULL)
 138                 imp = obd->u.cli.cl_import;
 139
 140         lwd.lwd_lock = lock;
 141
 142         if (lock->l_flags & LDLM_FL_NO_TIMEOUT) {
 143                 LDLM_DEBUG(lock, "waiting indefinitely because of NO_TIMEOUT");
 144                 lwi = LWI_INTR(interrupted_completion_wait, &lwd);
 145         } else {
 146                 lwi = LWI_TIMEOUT_INTR(cfs_time_seconds(obd_timeout),
 147                                        ldlm_expired_completion_wait,
 148                                        interrupted_completion_wait, &lwd);
 149         }
 150
 151         if (imp != NULL) {
 152                 spin_lock(&imp->imp_lock);
 153                 lwd.lwd_conn_cnt = imp->imp_conn_cnt;
 154                 spin_unlock(&imp->imp_lock);
 155         }
 156
 157         /* Go to sleep until the lock is granted or cancelled. */
 158         rc = l_wait_event(lock->l_waitq, is_granted_or_cancelled(lock), &lwi);
 159
 160         if (lock->l_destroyed || lock->l_flags & LDLM_FL_FAILED) {
 161                 LDLM_DEBUG(lock, "client-side enqueue waking up: destroyed");
 162                 RETURN(-EIO);
 163         }
 164
 165         if (rc) {
 166                 LDLM_DEBUG(lock, "client-side enqueue waking up: failed (%d)",
 167                            rc);
 168                 RETURN(rc);
 169         }
 170
 171         LDLM_DEBUG(lock, "client-side enqueue waking up: granted");
 172         RETURN(0);
 173 }
 174
 175 /*
 176  * ->l_blocking_ast() callback for LDLM locks acquired by server-side OBDs.
 177  */
 178 int ldlm_blocking_ast(struct ldlm_lock *lock, struct ldlm_lock_desc *desc,
 179                       void *data, int flag)
 180 {
 181         int do_ast;
 182         ENTRY;
 183
 184         if (flag == LDLM_CB_CANCELING) {
 185                 /* Don't need to do anything here. */
 186                 RETURN(0);
 187         }
 188
 189         lock_res_and_lock(lock);
 190         /* Get this: if ldlm_blocking_ast is racing with intent_policy, such
 191          * that ldlm_blocking_ast is called just before intent_policy method
 192          * takes the ns_lock, then by the time we get the lock, we might not
 193          * be the correct blocking function anymore.  So check, and return
 194          * early, if so. */
 195         if (lock->l_blocking_ast != ldlm_blocking_ast) {
 196                 unlock_res_and_lock(lock);
 197                 RETURN(0);
 198         }
 199
 200         lock->l_flags |= LDLM_FL_CBPENDING;
 201         do_ast = (!lock->l_readers && !lock->l_writers);
 202         unlock_res_and_lock(lock);
 203
 204         if (do_ast) {
 205                 struct lustre_handle lockh;
 206                 int rc;
 207
 208                 LDLM_DEBUG(lock, "already unused, calling ldlm_cli_cancel");
 209                 ldlm_lock2handle(lock, &lockh);
 210                 rc = ldlm_cli_cancel(&lockh);
 211                 if (rc < 0)
 212                         CERROR("ldlm_cli_cancel: %d\n", rc);
 213         } else {
 214                 LDLM_DEBUG(lock, "Lock still has references, will be "
 215                            "cancelled later");
 216         }
 217         RETURN(0);
 218 }
 219
 220 /*
 221  * ->l_glimpse_ast() for DLM extent locks acquired on the server-side. See
 222  * comment in filter_intent_policy() on why you may need this.
 223  */
 224 int ldlm_glimpse_ast(struct ldlm_lock *lock, void *reqp)
 225 {
 226         /*
 227          * Returning -ELDLM_NO_LOCK_DATA actually works, but the reason for
 228          * that is rather subtle: with OST-side locking, it may so happen that
 229          * _all_ extent locks are held by the OST. If client wants to obtain
 230          * current file size it calls ll{,u}_glimpse_size(), and (as locks are
 231          * on the server), dummy glimpse callback fires and does
 232          * nothing. Client still receives correct file size due to the
 233          * following fragment in filter_intent_policy():
 234          *
 235          * rc = l->l_glimpse_ast(l, NULL); // this will update the LVB
 236          * if (rc != 0 && res->lr_namespace->ns_lvbo &&
 237          *     res->lr_namespace->ns_lvbo->lvbo_update) {
 238          *         res->lr_namespace->ns_lvbo->lvbo_update(res, NULL, 0, 1);
 239          * }
 240          *
 241          * that is, after glimpse_ast() fails, filter_lvbo_update() runs, and
 242          * returns correct file size to the client.
 243          */
 244         return -ELDLM_NO_LOCK_DATA;
 245 }
 246
 247 int ldlm_cli_enqueue_local(struct ldlm_namespace *ns,
 248                            const struct ldlm_res_id *res_id,
 249                            ldlm_type_t type, ldlm_policy_data_t *policy,
 250                            ldlm_mode_t mode, int *flags,
 251                            ldlm_blocking_callback blocking,
 252                            ldlm_completion_callback completion,
 253                            ldlm_glimpse_callback glimpse,
 254                            void *data, __u32 lvb_len, void *lvb_swabber,
 255                            struct lustre_handle *lockh)
 256 {
 257         struct ldlm_lock *lock;
 258         int err;
 259         ENTRY;
 260
 261         LASSERT(!(*flags & LDLM_FL_REPLAY));
 262         if (unlikely(ns_is_client(ns))) {
 263                 CERROR("Trying to enqueue local lock in a shadow namespace\n");
 264                 LBUG();
 265         }
 266
 267         lock = ldlm_lock_create(ns, res_id, type, mode, blocking,
 268                                 completion, glimpse, data, lvb_len);
 269         if (unlikely(!lock))
 270                 GOTO(out_nolock, err = -ENOMEM);
 271         LDLM_DEBUG(lock, "client-side local enqueue handler, new lock created");
 272
 273         ldlm_lock_addref_internal(lock, mode);
 274         ldlm_lock2handle(lock, lockh);
 275         lock_res_and_lock(lock);
 276         lock->l_flags |= LDLM_FL_LOCAL;
 277         if (*flags & LDLM_FL_ATOMIC_CB)
 278                 lock->l_flags |= LDLM_FL_ATOMIC_CB;
 279         lock->l_lvb_swabber = lvb_swabber;
 280         unlock_res_and_lock(lock);
 281         if (policy != NULL)
 282                 lock->l_policy_data = *policy;
 283         if (type == LDLM_EXTENT)
 284                 lock->l_req_extent = policy->l_extent;
 285
 286         err = ldlm_lock_enqueue(ns, &lock, policy, flags);
 287         if (unlikely(err != ELDLM_OK))
 288                 GOTO(out, err);
 289
 290         if (policy != NULL)
 291                 *policy = lock->l_policy_data;
 292
 293         LDLM_DEBUG_NOLOCK("client-side local enqueue handler END (lock %p)",
 294                           lock);
 295
 296         if (lock->l_completion_ast)
 297                 lock->l_completion_ast(lock, *flags, NULL);
 298
 299         LDLM_DEBUG(lock, "client-side local enqueue END");
 300         EXIT;
 301  out:
 302         LDLM_LOCK_PUT(lock);
 303  out_nolock:
 304         return err;
 305 }
 306
 307 static void failed_lock_cleanup(struct ldlm_namespace *ns,
 308                                 struct ldlm_lock *lock,
 309                                 struct lustre_handle *lockh, int mode)
 310 {
 311         /* Set a flag to prevent us from sending a CANCEL (bug 407) */
 312         lock_res_and_lock(lock);
 313         lock->l_flags |= LDLM_FL_LOCAL_ONLY;
 314         unlock_res_and_lock(lock);
 315         LDLM_DEBUG(lock, "setting FL_LOCAL_ONLY");
 316
 317         ldlm_lock_decref_and_cancel(lockh, mode);
 318
 319         /* XXX - HACK because we shouldn't call ldlm_lock_destroy()
 320          *       from llite/file.c/ll_file_flock(). */
 321         if (lock->l_resource->lr_type == LDLM_FLOCK) {
 322                 ldlm_lock_destroy(lock);
 323         }
 324 }
 325
 326 int ldlm_cli_enqueue_fini(struct obd_export *exp, struct ptlrpc_request *req,
 327                           ldlm_type_t type, __u8 with_policy, ldlm_mode_t mode,
 328                           int *flags, void *lvb, __u32 lvb_len,
 329                           void *lvb_swabber, struct lustre_handle *lockh,int rc)
 330 {
 331         struct ldlm_namespace *ns = exp->exp_obd->obd_namespace;
 332         int is_replay = *flags & LDLM_FL_REPLAY;
 333         struct ldlm_lock *lock;
 334         struct ldlm_reply *reply;
 335         int cleanup_phase = 1;
 336         ENTRY;
 337
 338         lock = ldlm_handle2lock(lockh);
 339         /* ldlm_cli_enqueue is holding a reference on this lock. */
 340         if (!lock) {
 341                 LASSERT(type == LDLM_FLOCK);
 342                 RETURN(-ENOLCK);
 343         }
 344
 345         if (rc != ELDLM_OK) {
 346                 LASSERT(!is_replay);
 347                 LDLM_DEBUG(lock, "client-side enqueue END (%s)",
 348                            rc == ELDLM_LOCK_ABORTED ? "ABORTED" : "FAILED");
 349                 if (rc == ELDLM_LOCK_ABORTED) {
 350                         /* Before we return, swab the reply */
 351                         reply = req_capsule_server_get(&req->rq_pill,
 352                                                        &RMF_DLM_REP);
 353                         if (reply == NULL)
 354                                 rc = -EPROTO;
 355                         if (lvb_len) {
 356                                 struct ost_lvb *tmplvb;
 357
 358                                 req_capsule_set_size(&req->rq_pill,
 359                                                      &RMF_DLM_LVB, RCL_SERVER,
 360                                                      lvb_len);
 361                             tmplvb = req_capsule_server_swab_get(&req->rq_pill,
 362                                                                  &RMF_DLM_LVB,
 363                                                                  lvb_swabber);
 364                                 if (tmplvb == NULL)
 365                                         GOTO(cleanup, rc = -EPROTO);
 366                                 if (lvb != NULL)
 367                                         memcpy(lvb, tmplvb, lvb_len);
 368                         }
 369                 }
 370                 GOTO(cleanup, rc);
 371         }
 372
 373         reply = req_capsule_server_get(&req->rq_pill, &RMF_DLM_REP);
 374         if (reply == NULL)
 375                 GOTO(cleanup, rc = -EPROTO);
 376
 377         /* lock enqueued on the server */
 378         cleanup_phase = 0;
 379
 380         lock_res_and_lock(lock);
 381         lock->l_remote_handle = reply->lock_handle;
 382         *flags = reply->lock_flags;
 383         lock->l_flags |= reply->lock_flags & LDLM_INHERIT_FLAGS;
 384         /* move NO_TIMEOUT flag to the lock to force ldlm_lock_match()
 385          * to wait with no timeout as well */
 386         lock->l_flags |= reply->lock_flags & LDLM_FL_NO_TIMEOUT;
 387         unlock_res_and_lock(lock);
 388
 389         CDEBUG(D_INFO, "local: %p, remote cookie: "LPX64", flags: 0x%x\n",
 390                lock, reply->lock_handle.cookie, *flags);
 391
 392         /* If enqueue returned a blocked lock but the completion handler has
 393          * already run, then it fixed up the resource and we don't need to do it
 394          * again. */
 395         if ((*flags) & LDLM_FL_LOCK_CHANGED) {
 396                 int newmode = reply->lock_desc.l_req_mode;
 397                 LASSERT(!is_replay);
 398                 if (newmode && newmode != lock->l_req_mode) {
 399                         LDLM_DEBUG(lock, "server returned different mode %s",
 400                                    ldlm_lockname[newmode]);
 401                         lock->l_req_mode = newmode;
 402                 }
 403
 404                 if (memcmp(reply->lock_desc.l_resource.lr_name.name,
 405                           lock->l_resource->lr_name.name,
 406                           sizeof(struct ldlm_res_id))) {
 407                         CDEBUG(D_INFO, "remote intent success, locking "
 408                                         "(%ld,%ld,%ld) instead of "
 409                                         "(%ld,%ld,%ld)\n",
 410                               (long)reply->lock_desc.l_resource.lr_name.name[0],
 411                               (long)reply->lock_desc.l_resource.lr_name.name[1],
 412                               (long)reply->lock_desc.l_resource.lr_name.name[2],
 413                               (long)lock->l_resource->lr_name.name[0],
 414                               (long)lock->l_resource->lr_name.name[1],
 415                               (long)lock->l_resource->lr_name.name[2]);
 416
 417                         rc = ldlm_lock_change_resource(ns, lock,
 418                                         &reply->lock_desc.l_resource.lr_name);
 419                         if (rc || lock->l_resource == NULL)
 420                                 GOTO(cleanup, rc = -ENOMEM);
 421                         LDLM_DEBUG(lock, "client-side enqueue, new resource");
 422                 }
 423                 if (with_policy)
 424                         if (!(type == LDLM_IBITS && !(exp->exp_connect_flags &
 425                                                     OBD_CONNECT_IBITS)))
 426                                 lock->l_policy_data =
 427                                                  reply->lock_desc.l_policy_data;
 428                 if (type != LDLM_PLAIN)
 429                         LDLM_DEBUG(lock,"client-side enqueue, new policy data");
 430         }
 431
 432         if ((*flags) & LDLM_FL_AST_SENT ||
 433             /* Cancel extent locks as soon as possible on a liblustre client,
 434              * because it cannot handle asynchronous ASTs robustly (see
 435              * bug 7311). */
 436             (LIBLUSTRE_CLIENT && type == LDLM_EXTENT)) {
 437                 lock_res_and_lock(lock);
 438                 lock->l_flags |= LDLM_FL_CBPENDING |  LDLM_FL_BL_AST;
 439                 unlock_res_and_lock(lock);
 440                 LDLM_DEBUG(lock, "enqueue reply includes blocking AST");
 441         }
 442
 443         /* If the lock has already been granted by a completion AST, don't
 444          * clobber the LVB with an older one. */
 445         if (lvb_len && (lock->l_req_mode != lock->l_granted_mode)) {
 446                 void *tmplvb;
 447
 448                 req_capsule_set_size(&req->rq_pill, &RMF_DLM_LVB, RCL_SERVER,
 449                                      lvb_len);
 450                 tmplvb = req_capsule_server_swab_get(&req->rq_pill,
 451                                                      &RMF_DLM_LVB,
 452                                                      lvb_swabber);
 453                 if (tmplvb == NULL)
 454                         GOTO(cleanup, rc = -EPROTO);
 455                 memcpy(lock->l_lvb_data, tmplvb, lvb_len);
 456         }
 457
 458         if (!is_replay) {
 459                 rc = ldlm_lock_enqueue(ns, &lock, NULL, flags);
 460                 if (lock->l_completion_ast != NULL) {
 461                         int err = lock->l_completion_ast(lock, *flags, NULL);
 462                         if (!rc)
 463                                 rc = err;
 464                         if (rc && type != LDLM_FLOCK) /* bug 9425, bug 10250 */
 465                                 cleanup_phase = 1;
 466                 }
 467         }
 468
 469         if (lvb_len && lvb != NULL) {
 470                 /* Copy the LVB here, and not earlier, because the completion
 471                  * AST (if any) can override what we got in the reply */
 472                 memcpy(lvb, lock->l_lvb_data, lvb_len);
 473         }
 474
 475         LDLM_DEBUG(lock, "client-side enqueue END");
 476         EXIT;
 477 cleanup:
 478         if (cleanup_phase == 1 && rc)
 479                 failed_lock_cleanup(ns, lock, lockh, mode);
 480         /* Put lock 2 times, the second reference is held by ldlm_cli_enqueue */
 481         LDLM_LOCK_PUT(lock);
 482         LDLM_LOCK_PUT(lock);
 483         return rc;
 484 }
 485
 486 /* PAGE_SIZE-512 is to allow TCP/IP and LNET headers to fit into
 487  * a single page on the send/receive side. XXX: 512 should be changed
 488  * to more adequate value. */
 489 static inline int ldlm_req_handles_avail(int req_size, int off)
 490 {
 491         int avail;
 492
 493         avail = min_t(int, LDLM_MAXREQSIZE, CFS_PAGE_SIZE - 512) - req_size;
 494         avail /= sizeof(struct lustre_handle);
 495         avail += LDLM_LOCKREQ_HANDLES - off;
 496
 497         return avail;
 498 }
 499
 500 static inline int ldlm_capsule_handles_avail(struct req_capsule *pill,
 501                                              enum req_location loc,
 502                                              int off)
 503 {
 504         int size = req_capsule_msg_size(pill, loc);
 505         return ldlm_req_handles_avail(size, off);
 506 }
 507
 508 static inline int ldlm_format_handles_avail(struct obd_import *imp,
 509                                             const struct req_format *fmt,
 510                                             enum req_location loc, int off)
 511 {
 512         int size = req_capsule_fmt_size(imp->imp_msg_magic, fmt, loc);
 513         return ldlm_req_handles_avail(size, off);
 514 }
 515
 516 /* Cancel lru locks and pack them into the enqueue request. Pack there the given
 517  * @count locks in @cancels. */
 518 int ldlm_prep_elc_req(struct obd_export *exp, struct ptlrpc_request *req,
 519                       int version, int opc, int canceloff,
 520                       struct list_head *cancels, int count)
 521 {
 522         struct ldlm_namespace   *ns = exp->exp_obd->obd_namespace;
 523         struct req_capsule      *pill = &req->rq_pill;
 524         struct ldlm_request     *dlm = NULL;
 525         int flags, avail, to_free, bufcount, pack = 0;
 526         CFS_LIST_HEAD(head);
 527         int rc;
 528         ENTRY;
 529
 530         if (cancels == NULL)
 531                 cancels = &head;
 532         if (exp_connect_cancelset(exp)) {
 533                 /* Estimate the amount of available space in the request. */
 534                 bufcount = req_capsule_filled_sizes(pill, RCL_CLIENT);
 535                 avail = ldlm_capsule_handles_avail(pill, RCL_CLIENT, canceloff);
 536
 537                 flags = ns_connect_lru_resize(ns) ?
 538                         LDLM_CANCEL_LRUR : LDLM_CANCEL_AGED;
 539                 to_free = !ns_connect_lru_resize(ns) &&
 540                           opc == LDLM_ENQUEUE ? 1 : 0;
 541
 542                 /* Cancel lru locks here _only_ if the server supports
 543                  * EARLY_CANCEL. Otherwise we have to send extra CANCEL
 544                  * rpc, what will make us slower. */
 545                 if (avail > count)
 546                         count += ldlm_cancel_lru_local(ns, cancels, to_free,
 547                                                        avail - count, 0, flags);
 548                 if (avail > count)
 549                         pack = count;
 550                 else
 551                         pack = avail;
 552                 req_capsule_set_size(pill, &RMF_DLM_REQ, RCL_CLIENT,
 553                                      ldlm_request_bufsize(pack, opc));
 554         }
 555
 556         rc = ptlrpc_request_pack(req, version, opc);
 557         if (rc) {
 558                 ldlm_lock_list_put(cancels, l_bl_ast, count);
 559                 RETURN(rc);
 560         }
 561
 562         if (exp_connect_cancelset(exp)) {
 563                 if (canceloff) {
 564                         dlm = req_capsule_client_get(pill, &RMF_DLM_REQ);
 565                         LASSERT(dlm);
 566                         /* Skip first lock handler in ldlm_request_pack(),
 567                          * this method will incrment @lock_count according
 568                          * to the lock handle amount actually written to
 569                          * the buffer. */
 570                         dlm->lock_count = canceloff;
 571                 }
 572                 /* Pack into the request @pack lock handles. */
 573                 ldlm_cli_cancel_list(cancels, pack, req, 0);
 574                 /* Prepare and send separate cancel rpc for others. */
 575                 ldlm_cli_cancel_list(cancels, count - pack, NULL, 0);
 576         } else {
 577                 ldlm_lock_list_put(cancels, l_bl_ast, count);
 578         }
 579         RETURN(0);
 580 }
 581
 582 int ldlm_prep_enqueue_req(struct obd_export *exp, struct ptlrpc_request *req,
 583                           struct list_head *cancels, int count)
 584 {
 585         return ldlm_prep_elc_req(exp, req, LUSTRE_DLM_VERSION, LDLM_ENQUEUE,
 586                                  LDLM_ENQUEUE_CANCEL_OFF, cancels, count);
 587 }
 588
 589 /* If a request has some specific initialisation it is passed in @reqp,
 590  * otherwise it is created in ldlm_cli_enqueue.
 591  *
 592  * Supports sync and async requests, pass @async flag accordingly. If a
 593  * request was created in ldlm_cli_enqueue and it is the async request,
 594  * pass it to the caller in @reqp. */
 595 int ldlm_cli_enqueue(struct obd_export *exp, struct ptlrpc_request **reqp,
 596                      struct ldlm_enqueue_info *einfo,
 597                      const struct ldlm_res_id *res_id,
 598                      ldlm_policy_data_t *policy, int *flags,
 599                      void *lvb, __u32 lvb_len, void *lvb_swabber,
 600                      struct lustre_handle *lockh, int async)
 601 {
 602         struct ldlm_namespace *ns = exp->exp_obd->obd_namespace;
 603         struct ldlm_lock      *lock;
 604         struct ldlm_request   *body;
 605         int                    is_replay = *flags & LDLM_FL_REPLAY;
 606         int                    req_passed_in = 1;
 607         int                    rc, err;
 608         struct ptlrpc_request *req;
 609         ENTRY;
 610
 611         LASSERT(exp != NULL);
 612
 613         /* If we're replaying this lock, just check some invariants.
 614          * If we're creating a new lock, get everything all setup nice. */
 615         if (is_replay) {
 616                 lock = ldlm_handle2lock(lockh);
 617                 LASSERT(lock != NULL);
 618                 LDLM_DEBUG(lock, "client-side enqueue START");
 619                 LASSERT(exp == lock->l_conn_export);
 620         } else {
 621                 lock = ldlm_lock_create(ns, res_id, einfo->ei_type,
 622                                         einfo->ei_mode, einfo->ei_cb_bl,
 623                                         einfo->ei_cb_cp, einfo->ei_cb_gl,
 624                                         einfo->ei_cbdata, lvb_len);
 625                 if (lock == NULL)
 626                         RETURN(-ENOMEM);
 627                 /* for the local lock, add the reference */
 628                 ldlm_lock_addref_internal(lock, einfo->ei_mode);
 629                 ldlm_lock2handle(lock, lockh);
 630                 lock->l_lvb_swabber = lvb_swabber;
 631                 if (policy != NULL) {
 632                         /* INODEBITS_INTEROP: If the server does not support
 633                          * inodebits, we will request a plain lock in the
 634                          * descriptor (ldlm_lock2desc() below) but use an
 635                          * inodebits lock internally with both bits set.
 636                          */
 637                         if (einfo->ei_type == LDLM_IBITS &&
 638                             !(exp->exp_connect_flags & OBD_CONNECT_IBITS))
 639                                 lock->l_policy_data.l_inodebits.bits =
 640                                         MDS_INODELOCK_LOOKUP |
 641                                         MDS_INODELOCK_UPDATE;
 642                         else
 643                                 lock->l_policy_data = *policy;
 644                 }
 645
 646                 if (einfo->ei_type == LDLM_EXTENT)
 647                         lock->l_req_extent = policy->l_extent;
 648                 LDLM_DEBUG(lock, "client-side enqueue START");
 649         }
 650
 651         /* lock not sent to server yet */
 652
 653         if (reqp == NULL || *reqp == NULL) {
 654                 req = ptlrpc_request_alloc_pack(class_exp2cliimp(exp),
 655                                                 &RQF_LDLM_ENQUEUE,
 656                                                 LUSTRE_DLM_VERSION,
 657                                                 LDLM_ENQUEUE);
 658                 if (req == NULL) {
 659                         failed_lock_cleanup(ns, lock, lockh, einfo->ei_mode);
 660                         LDLM_LOCK_PUT(lock);
 661                         RETURN(-ENOMEM);
 662                 }
 663                 req_passed_in = 0;
 664                 if (reqp)
 665                         *reqp = req;
 666         } else {
 667                 int len;
 668
 669                 req = *reqp;
 670                 len = req_capsule_get_size(&req->rq_pill, &RMF_DLM_REQ,
 671                                            RCL_CLIENT);
 672                 LASSERTF(len >= sizeof(*body), "buflen[%d] = %d, not %d\n",
 673                          DLM_LOCKREQ_OFF, len, sizeof(*body));
 674         }
 675
 676         lock->l_conn_export = exp;
 677         lock->l_export = NULL;
 678         lock->l_blocking_ast = einfo->ei_cb_bl;
 679
 680         /* Dump lock data into the request buffer */
 681         body = req_capsule_client_get(&req->rq_pill, &RMF_DLM_REQ);
 682         ldlm_lock2desc(lock, &body->lock_desc);
 683         body->lock_flags = *flags;
 684         body->lock_handle[0] = *lockh;
 685
 686         /* Continue as normal. */
 687         if (!req_passed_in) {
 688                 if (lvb_len > 0) {
 689                         req_capsule_extend(&req->rq_pill,
 690                                            &RQF_LDLM_ENQUEUE_LVB);
 691                         req_capsule_set_size(&req->rq_pill, &RMF_DLM_LVB,
 692                                              RCL_SERVER, lvb_len);
 693                 }
 694                 ptlrpc_request_set_replen(req);
 695         }
 696
 697         /*
 698          * Liblustre client doesn't get extent locks, except for O_APPEND case
 699          * where [0, OBD_OBJECT_EOF] lock is taken, or truncate, where
 700          * [i_size, OBD_OBJECT_EOF] lock is taken.
 701          */
 702         LASSERT(ergo(LIBLUSTRE_CLIENT, einfo->ei_type != LDLM_EXTENT ||
 703                      policy->l_extent.end == OBD_OBJECT_EOF));
 704
 705         if (async) {
 706                 LASSERT(reqp != NULL);
 707                 RETURN(0);
 708         }
 709
 710         LDLM_DEBUG(lock, "sending request");
 711         rc = ptlrpc_queue_wait(req);
 712         err = ldlm_cli_enqueue_fini(exp, req, einfo->ei_type, policy ? 1 : 0,
 713                                     einfo->ei_mode, flags, lvb, lvb_len,
 714                                     lvb_swabber, lockh, rc);
 715
 716         /* If ldlm_cli_enqueue_fini did not find the lock, we need to free
 717          * one reference that we took */
 718         if (err == -ENOLCK)
 719                 LDLM_LOCK_PUT(lock);
 720         else
 721                 rc = err;
 722
 723         if (!req_passed_in && req != NULL) {
 724                 ptlrpc_req_finished(req);
 725                 if (reqp)
 726                         *reqp = NULL;
 727         }
 728
 729         RETURN(rc);
 730 }
 731
 732 static int ldlm_cli_convert_local(struct ldlm_lock *lock, int new_mode,
 733                                   __u32 *flags)
 734 {
 735         struct ldlm_resource *res;
 736         int rc;
 737         ENTRY;
 738         if (ns_is_client(lock->l_resource->lr_namespace)) {
 739                 CERROR("Trying to cancel local lock\n");
 740                 LBUG();
 741         }
 742         LDLM_DEBUG(lock, "client-side local convert");
 743
 744         res = ldlm_lock_convert(lock, new_mode, flags);
 745         if (res) {
 746                 ldlm_reprocess_all(res);
 747                 rc = 0;
 748         } else {
 749                 rc = EDEADLOCK;
 750         }
 751         LDLM_DEBUG(lock, "client-side local convert handler END");
 752         LDLM_LOCK_PUT(lock);
 753         RETURN(rc);
 754 }
 755
 756 /* FIXME: one of ldlm_cli_convert or the server side should reject attempted
 757  * conversion of locks which are on the waiting or converting queue */
 758 /* Caller of this code is supposed to take care of lock readers/writers
 759    accounting */
 760 int ldlm_cli_convert(struct lustre_handle *lockh, int new_mode, __u32 *flags)
 761 {
 762         struct ldlm_request   *body;
 763         struct ldlm_reply     *reply;
 764         struct ldlm_lock      *lock;
 765         struct ldlm_resource  *res;
 766         struct ptlrpc_request *req;
 767         int                    rc;
 768         ENTRY;
 769
 770         lock = ldlm_handle2lock(lockh);
 771         if (!lock) {
 772                 LBUG();
 773                 RETURN(-EINVAL);
 774         }
 775         *flags = 0;
 776
 777         if (lock->l_conn_export == NULL)
 778                 RETURN(ldlm_cli_convert_local(lock, new_mode, flags));
 779
 780         LDLM_DEBUG(lock, "client-side convert");
 781
 782         req = ptlrpc_request_alloc_pack(class_exp2cliimp(lock->l_conn_export),
 783                                         &RQF_LDLM_CONVERT, LUSTRE_DLM_VERSION,
 784                                         LDLM_CONVERT);
 785         if (req == NULL) {
 786                 LDLM_LOCK_PUT(lock);
 787                 RETURN(-ENOMEM);
 788         }
 789
 790         body = req_capsule_client_get(&req->rq_pill, &RMF_DLM_REQ);
 791         body->lock_handle[0] = lock->l_remote_handle;
 792
 793         body->lock_desc.l_req_mode = new_mode;
 794         body->lock_flags = *flags;
 795
 796
 797         ptlrpc_request_set_replen(req);
 798         rc = ptlrpc_queue_wait(req);
 799         if (rc != ELDLM_OK)
 800                 GOTO(out, rc);
 801
 802         reply = req_capsule_server_get(&req->rq_pill, &RMF_DLM_REP);
 803         if (reply == NULL)
 804                 GOTO(out, rc = -EPROTO);
 805
 806         if (req->rq_status)
 807                 GOTO(out, rc = req->rq_status);
 808
 809         res = ldlm_lock_convert(lock, new_mode, &reply->lock_flags);
 810         if (res != NULL) {
 811                 ldlm_reprocess_all(res);
 812                 /* Go to sleep until the lock is granted. */
 813                 /* FIXME: or cancelled. */
 814                 if (lock->l_completion_ast) {
 815                         rc = lock->l_completion_ast(lock, LDLM_FL_WAIT_NOREPROC,
 816                                                     NULL);
 817                         if (rc)
 818                                 GOTO(out, rc);
 819                 }
 820         } else {
 821                 rc = EDEADLOCK;
 822         }
 823         EXIT;
 824  out:
 825         LDLM_LOCK_PUT(lock);
 826         ptlrpc_req_finished(req);
 827         return rc;
 828 }
 829
 830 /* Cancel locks locally.
 831  * Returns:
 832  * LDLM_FL_LOCAL_ONLY if tere is no need in a CANCEL rpc to the server;
 833  * LDLM_FL_CANCELING otherwise;
 834  * LDLM_FL_BL_AST if there is a need in a separate CANCEL rpc. */
 835 static int ldlm_cli_cancel_local(struct ldlm_lock *lock)
 836 {
 837         int rc = LDLM_FL_LOCAL_ONLY;
 838         ENTRY;
 839
 840         if (lock->l_conn_export) {
 841                 int local_only;
 842
 843                 LDLM_DEBUG(lock, "client-side cancel");
 844                 /* Set this flag to prevent others from getting new references*/
 845                 lock_res_and_lock(lock);
 846                 lock->l_flags |= LDLM_FL_CBPENDING;
 847                 local_only = (lock->l_flags &
 848                               (LDLM_FL_LOCAL_ONLY|LDLM_FL_CANCEL_ON_BLOCK));
 849                 ldlm_cancel_callback(lock);
 850                 rc = (lock->l_flags & LDLM_FL_BL_AST) ?
 851                         LDLM_FL_BL_AST : LDLM_FL_CANCELING;
 852                 unlock_res_and_lock(lock);
 853
 854                 if (local_only) {
 855                         CDEBUG(D_DLMTRACE, "not sending request (at caller's "
 856                                "instruction)\n");
 857                         rc = LDLM_FL_LOCAL_ONLY;
 858                 }
 859                 ldlm_lock_cancel(lock);
 860         } else {
 861                 if (ns_is_client(lock->l_resource->lr_namespace)) {
 862                         LDLM_ERROR(lock, "Trying to cancel local lock");
 863                         LBUG();
 864                 }
 865                 LDLM_DEBUG(lock, "server-side local cancel");
 866                 ldlm_lock_cancel(lock);
 867                 ldlm_reprocess_all(lock->l_resource);
 868                 LDLM_DEBUG(lock, "server-side local cancel handler END");
 869         }
 870
 871         RETURN(rc);
 872 }
 873
 874 /* Pack @count locks in @head into ldlm_request buffer at the offset @off,
 875    of the request @req. */
 876 static void ldlm_cancel_pack(struct ptlrpc_request *req,
 877                              struct list_head *head, int count)
 878 {
 879         struct ldlm_request *dlm;
 880         struct ldlm_lock *lock;
 881         int max, packed = 0;
 882         ENTRY;
 883
 884         dlm = req_capsule_client_get(&req->rq_pill, &RMF_DLM_REQ);
 885         LASSERT(dlm != NULL);
 886
 887         /* Check the room in the request buffer. */
 888         max = req_capsule_get_size(&req->rq_pill, &RMF_DLM_REQ, RCL_CLIENT) -
 889                 sizeof(struct ldlm_request);
 890         max /= sizeof(struct lustre_handle);
 891         max += LDLM_LOCKREQ_HANDLES;
 892         LASSERT(max >= dlm->lock_count + count);
 893
 894         /* XXX: it would be better to pack lock handles grouped by resource.
 895          * so that the server cancel would call filter_lvbo_update() less
 896          * frequently. */
 897         list_for_each_entry(lock, head, l_bl_ast) {
 898                 if (!count--)
 899                         break;
 900                 LASSERT(lock->l_conn_export);
 901                 /* Pack the lock handle to the given request buffer. */
 902                 LDLM_DEBUG(lock, "packing");
 903                 dlm->lock_handle[dlm->lock_count++] = lock->l_remote_handle;
 904                 packed++;
 905         }
 906         CDEBUG(D_DLMTRACE, "%d locks packed\n", packed);
 907         EXIT;
 908 }
 909
 910 /* Prepare and send a batched cancel rpc, it will include count lock handles
 911  * of locks given in @head. */
 912 int ldlm_cli_cancel_req(struct obd_export *exp, struct list_head *cancels,
 913                         int count, int flags)
 914 {
 915         struct ptlrpc_request *req = NULL;
 916         struct obd_import *imp;
 917         int free, sent = 0;
 918         int rc = 0;
 919         ENTRY;
 920
 921         LASSERT(exp != NULL);
 922         LASSERT(count > 0);
 923
 924         if (OBD_FAIL_CHECK(OBD_FAIL_LDLM_CANCEL_RACE))
 925                 RETURN(count);
 926
 927         free = ldlm_format_handles_avail(class_exp2cliimp(exp),
 928                                          &RQF_LDLM_CANCEL, RCL_CLIENT, 0);
 929         if (count > free)
 930                 count = free;
 931
 932         while (1) {
 933                 int bufcount;
 934
 935                 imp = class_exp2cliimp(exp);
 936                 if (imp == NULL || imp->imp_invalid) {
 937                         CDEBUG(D_DLMTRACE,
 938                                "skipping cancel on invalid import %p\n", imp);
 939                         RETURN(count);
 940                 }
 941
 942                 req = ptlrpc_request_alloc(imp, &RQF_LDLM_CANCEL);
 943                 if (req == NULL)
 944                         GOTO(out, rc = -ENOMEM);
 945
 946                 bufcount = req_capsule_filled_sizes(&req->rq_pill, RCL_CLIENT);
 947                 req_capsule_set_size(&req->rq_pill, &RMF_DLM_REQ, RCL_CLIENT,
 948                                      ldlm_request_bufsize(count, LDLM_CANCEL));
 949
 950                 rc = ptlrpc_request_pack(req, LUSTRE_DLM_VERSION, LDLM_CANCEL);
 951                 if (rc) {
 952                         ptlrpc_request_free(req);
 953                         GOTO(out, rc);
 954                 }
 955                 req->rq_no_resend = 1;
 956                 req->rq_no_delay = 1;
 957
 958                 /* XXX FIXME bug 249 */
 959                 req->rq_request_portal = LDLM_CANCEL_REQUEST_PORTAL;
 960                 req->rq_reply_portal = LDLM_CANCEL_REPLY_PORTAL;
 961
 962                 ldlm_cancel_pack(req, cancels, count);
 963
 964                 ptlrpc_request_set_replen(req);
 965                 if (flags & LDLM_FL_ASYNC) {
 966                         ptlrpcd_add_req(req);
 967                         sent = count;
 968                         GOTO(out, 0);
 969                 } else {
 970                         rc = ptlrpc_queue_wait(req);
 971                 }
 972                 if (rc == ESTALE) {
 973                         CDEBUG(D_DLMTRACE, "client/server (nid %s) "
 974                                "out of sync -- not fatal\n",
 975                                libcfs_nid2str(req->rq_import->
 976                                               imp_connection->c_peer.nid));
 977                         rc = 0;
 978                 } else if (rc == -ETIMEDOUT && /* check there was no reconnect*/
 979                            req->rq_import_generation == imp->imp_generation) {
 980                         ptlrpc_req_finished(req);
 981                         continue;
 982                 } else if (rc != ELDLM_OK) {
 983                         CERROR("Got rc %d from cancel RPC: canceling "
 984                                "anyway\n", rc);
 985                         break;
 986                 }
 987                 sent = count;
 988                 break;
 989         }
 990
 991         ptlrpc_req_finished(req);
 992         EXIT;
 993 out:
 994         return sent ? sent : rc;
 995 }
 996
 997 static inline struct ldlm_pool *ldlm_imp2pl(struct obd_import *imp)
 998 {
 999         LASSERT(imp != NULL);
1000         return &imp->imp_obd->obd_namespace->ns_pool;
1001 }
1002
1003 /**
1004  * Update client's obd pool related fields with new SLV and Limit from \a req.
1005  */
1006 int ldlm_cli_update_pool(struct ptlrpc_request *req)
1007 {
1008         struct obd_device *obd;
1009         __u64 old_slv, new_slv;
1010         __u32 new_limit;
1011         ENTRY;
1012
1013         if (unlikely(!req->rq_import || !req->rq_import->imp_obd ||
1014                      !imp_connect_lru_resize(req->rq_import)))
1015         {
1016                 /*
1017                  * Do nothing for corner cases.
1018                  */
1019                 RETURN(0);
1020         }
1021
1022         /*
1023          * In some cases RPC may contain slv and limit zeroed out. This is
1024          * the case when server does not support lru resize feature. This is
1025          * also possible in some recovery cases when server side reqs have no
1026          * ref to obd export and thus access to server side namespace is no
1027          * possible.
1028          */
1029         if (lustre_msg_get_slv(req->rq_repmsg) == 0 ||
1030             lustre_msg_get_limit(req->rq_repmsg) == 0) {
1031                 DEBUG_REQ(D_HA, req, "Zero SLV or Limit found "
1032                           "(SLV: "LPU64", Limit: %u)",
1033                           lustre_msg_get_slv(req->rq_repmsg),
1034                           lustre_msg_get_limit(req->rq_repmsg));
1035                 RETURN(0);
1036         }
1037
1038         new_limit = lustre_msg_get_limit(req->rq_repmsg);
1039         new_slv = lustre_msg_get_slv(req->rq_repmsg);
1040         obd = req->rq_import->imp_obd;
1041
1042         /*
1043          * Set new SLV and Limit to obd fields to make accessible for pool
1044          * thread. We do not access obd_namespace and pool directly here
1045          * as there is no reliable way to make sure that they are still
1046          * alive in cleanup time. Evil races are possible which may cause
1047          * oops in that time.
1048          */
1049         write_lock(&obd->obd_pool_lock);
1050         old_slv = obd->obd_pool_slv;
1051         obd->obd_pool_slv = new_slv;
1052         obd->obd_pool_limit = new_limit;
1053         write_unlock(&obd->obd_pool_lock);
1054
1055         /*
1056          * Check if we need to wakeup pools thread for fast SLV change.
1057          * This is only done when threads period is noticably long like
1058          * 10s or more.
1059          */
1060 #if defined(__KERNEL__) && (LDLM_POOLS_THREAD_PERIOD >= 10)
1061         if (old_slv > 0) {
1062                 __u64 fast_change = old_slv * LDLM_POOLS_FAST_SLV_CHANGE;
1063                 do_div(fast_change, 100);
1064
1065                 /*
1066                  * Wake up pools thread only if SLV has changed more than
1067                  * 50% since last update. In this case we want to react asap.
1068                  * Otherwise it is no sense to wake up pools as they are
1069                  * re-calculated every LDLM_POOLS_THREAD_PERIOD anyways.
1070                  */
1071                 if (old_slv > new_slv && old_slv - new_slv > fast_change)
1072                         ldlm_pools_wakeup();
1073         }
1074 #endif
1075         RETURN(0);
1076 }
1077 EXPORT_SYMBOL(ldlm_cli_update_pool);
1078
1079 int ldlm_cli_cancel(struct lustre_handle *lockh)
1080 {
1081         struct obd_export *exp;
1082         int avail, flags, count = 1, rc = 0;
1083         struct ldlm_namespace *ns;
1084         struct ldlm_lock *lock;
1085         CFS_LIST_HEAD(cancels);
1086         ENTRY;
1087
1088         /* concurrent cancels on the same handle can happen */
1089         lock = __ldlm_handle2lock(lockh, LDLM_FL_CANCELING);
1090         if (lock == NULL) {
1091                 LDLM_DEBUG_NOLOCK("lock is already being destroyed\n");
1092                 RETURN(0);
1093         }
1094
1095         rc = ldlm_cli_cancel_local(lock);
1096         if (rc < 0 || rc == LDLM_FL_LOCAL_ONLY) {
1097                 LDLM_LOCK_PUT(lock);
1098                 RETURN(rc < 0 ? rc : 0);
1099         }
1100         /* Even if the lock is marked as LDLM_FL_BL_AST, this is a LDLM_CANCEL
1101          * rpc which goes to canceld portal, so we can cancel other lru locks
1102          * here and send them all as one LDLM_CANCEL rpc. */
1103         LASSERT(list_empty(&lock->l_bl_ast));
1104         list_add(&lock->l_bl_ast, &cancels);
1105
1106         exp = lock->l_conn_export;
1107         if (exp_connect_cancelset(exp)) {
1108                 avail = ldlm_format_handles_avail(class_exp2cliimp(exp),
1109                                                   &RQF_LDLM_CANCEL,
1110                                                   RCL_CLIENT, 0);
1111                 LASSERT(avail > 0);
1112
1113                 ns = lock->l_resource->lr_namespace;
1114                 flags = ns_connect_lru_resize(ns) ?
1115                         LDLM_CANCEL_LRUR : LDLM_CANCEL_AGED;
1116                 count += ldlm_cancel_lru_local(ns, &cancels, 0, avail - 1,
1117                                                LDLM_FL_BL_AST, flags);
1118         }
1119         ldlm_cli_cancel_list(&cancels, count, NULL, 0);
1120         RETURN(0);
1121 }
1122
1123 /* XXX until we will have compound requests and can cut cancels from generic rpc
1124  * we need send cancels with LDLM_FL_BL_AST flag as separate rpc */
1125 static int ldlm_cancel_list(struct list_head *cancels, int count, int flags)
1126 {
1127         CFS_LIST_HEAD(head);
1128         struct ldlm_lock *lock, *next;
1129         int left = 0, bl_ast = 0, rc;
1130
1131         left = count;
1132         list_for_each_entry_safe(lock, next, cancels, l_bl_ast) {
1133                 if (left-- == 0)
1134                         break;
1135
1136                 if (flags & LDLM_FL_LOCAL_ONLY) {
1137                         rc = LDLM_FL_LOCAL_ONLY;
1138                         ldlm_lock_cancel(lock);
1139                 } else {
1140                         rc = ldlm_cli_cancel_local(lock);
1141                 }
1142                 if (!(flags & LDLM_FL_BL_AST) && (rc == LDLM_FL_BL_AST)) {
1143                         LDLM_DEBUG(lock, "Cancel lock separately");
1144                         list_del_init(&lock->l_bl_ast);
1145                         list_add(&lock->l_bl_ast, &head);
1146                         bl_ast ++;
1147                         continue;
1148                 }
1149                 if (rc == LDLM_FL_LOCAL_ONLY) {
1150                         /* CANCEL RPC should not be sent to server. */
1151                         list_del_init(&lock->l_bl_ast);
1152                         LDLM_LOCK_PUT(lock);
1153                         count--;
1154                 }
1155
1156         }
1157         if (bl_ast > 0) {
1158                 count -= bl_ast;
1159                 ldlm_cli_cancel_list(&head, bl_ast, NULL, 0);
1160         }
1161
1162         RETURN(count);
1163 }
1164
1165 /**
1166  * Callback function for shrink policy. Makes decision whether to keep
1167  * \a lock in LRU for current \a LRU size \a unused, added in current scan
1168  * \a added and number of locks to be preferably canceled \a count.
1169  *
1170  * \retval LDLM_POLICY_KEEP_LOCK keep lock in LRU in stop scanning
1171  *
1172  * \retval LDLM_POLICY_CANCEL_LOCK cancel lock from LRU
1173  */
1174 static ldlm_policy_res_t ldlm_cancel_shrink_policy(struct ldlm_namespace *ns,
1175                                                    struct ldlm_lock *lock,
1176                                                    int unused, int added,
1177                                                    int count)
1178 {
1179         int lock_cost;
1180         __u64 page_nr;
1181
1182         /*
1183          * Stop lru processing when we reached passed @count or checked all
1184          * locks in lru.
1185          */
1186         if (count && added >= count)
1187                 return LDLM_POLICY_KEEP_LOCK;
1188
1189         if (lock->l_resource->lr_type == LDLM_EXTENT) {
1190                 struct ldlm_extent *l_extent;
1191
1192                 /*
1193                  * For all extent locks cost is 1 + number of pages in
1194                  * their extent.
1195                  */
1196                 l_extent = &lock->l_policy_data.l_extent;
1197                 page_nr = (l_extent->end - l_extent->start);
1198                 do_div(page_nr, CFS_PAGE_SIZE);
1199
1200 #ifdef __KERNEL__
1201                 /*
1202                  * XXX: In fact this is evil hack, we can't access inode
1203                  * here. For doing it right we need somehow to have number
1204                  * of covered by lock. This should be fixed later when 10718
1205                  * is landed.
1206                  */
1207                 if (lock->l_ast_data != NULL) {
1208                         struct inode *inode = lock->l_ast_data;
1209                         if (page_nr > inode->i_mapping->nrpages)
1210                                 page_nr = inode->i_mapping->nrpages;
1211                 }
1212 #endif
1213                 lock_cost = 1 + page_nr;
1214         } else {
1215                 /*
1216                  * For all locks which are not extent ones cost is 1
1217                  */
1218                 lock_cost = 1;
1219         }
1220
1221         /*
1222          * Keep all expensive locks in lru for the memory pressure time
1223          * cancel policy. They anyways may be canceled by lru resize
1224          * pplicy if they have not small enough CLV.
1225          */
1226         return lock_cost > ns->ns_shrink_thumb ?
1227                 LDLM_POLICY_KEEP_LOCK : LDLM_POLICY_CANCEL_LOCK;
1228 }
1229
1230 /**
1231  * Callback function for lru-resize policy. Makes decision whether to keep
1232  * \a lock in LRU for current \a LRU size \a unused, added in current scan
1233  * \a added and number of locks to be preferably canceled \a count.
1234  *
1235  * \retval LDLM_POLICY_KEEP_LOCK keep lock in LRU in stop scanning
1236  *
1237  * \retval LDLM_POLICY_CANCEL_LOCK cancel lock from LRU
1238  */
1239 static ldlm_policy_res_t ldlm_cancel_lrur_policy(struct ldlm_namespace *ns,
1240                                                  struct ldlm_lock *lock,
1241                                                  int unused, int added,
1242                                                  int count)
1243 {
1244         cfs_time_t cur = cfs_time_current();
1245         struct ldlm_pool *pl = &ns->ns_pool;
1246         __u64 slv, lvf, lv;
1247         cfs_time_t la;
1248
1249         /*
1250          * Stop lru processing when we reached passed @count or checked all
1251          * locks in lru.
1252          */
1253         if (count && added >= count)
1254                 return LDLM_POLICY_KEEP_LOCK;
1255
1256         slv = ldlm_pool_get_slv(pl);
1257         lvf = ldlm_pool_get_lvf(pl);
1258         la = cfs_duration_sec(cfs_time_sub(cur,
1259                               lock->l_last_used));
1260
1261         /*
1262          * Stop when slv is not yet come from server or lv is smaller than
1263          * it is.
1264          */
1265         lv = lvf * la * unused;
1266
1267         /*
1268          * Inform pool about current CLV to see it via proc.
1269          */
1270         ldlm_pool_set_clv(pl, lv);
1271         return (slv == 1 || lv < slv) ?
1272                 LDLM_POLICY_KEEP_LOCK : LDLM_POLICY_CANCEL_LOCK;
1273 }
1274
1275 /**
1276  * Callback function for proc used policy. Makes decision whether to keep
1277  * \a lock in LRU for current \a LRU size \a unused, added in current scan
1278  * \a added and number of locks to be preferably canceled \a count.
1279  *
1280  * \retval LDLM_POLICY_KEEP_LOCK keep lock in LRU in stop scanning
1281  *
1282  * \retval LDLM_POLICY_CANCEL_LOCK cancel lock from LRU
1283  */
1284 static ldlm_policy_res_t ldlm_cancel_passed_policy(struct ldlm_namespace *ns,
1285                                                    struct ldlm_lock *lock,
1286                                                    int unused, int added,
1287                                                    int count)
1288 {
1289         /*
1290          * Stop lru processing when we reached passed @count or checked all
1291          * locks in lru.
1292          */
1293         return (added >= count) ?
1294                 LDLM_POLICY_KEEP_LOCK : LDLM_POLICY_CANCEL_LOCK;
1295 }
1296
1297 /**
1298  * Callback function for aged policy. Makes decision whether to keep
1299  * \a lock in LRU for current \a LRU size \a unused, added in current scan
1300  * \a added and number of locks to be preferably canceled \a count.
1301  *
1302  * \retval LDLM_POLICY_KEEP_LOCK keep lock in LRU in stop scanning
1303  *
1304  * \retval LDLM_POLICY_CANCEL_LOCK cancel lock from LRU
1305  */
1306 static ldlm_policy_res_t ldlm_cancel_aged_policy(struct ldlm_namespace *ns,
1307                                                  struct ldlm_lock *lock,
1308                                                  int unused, int added,
1309                                                  int count)
1310 {
1311         /*
1312          * Stop lru processing if young lock is found and we reached passed
1313          * @count.
1314          */
1315         return ((added >= count) &&
1316                 cfs_time_before(cfs_time_current(),
1317                                 cfs_time_add(lock->l_last_used,
1318                                              ns->ns_max_age))) ?
1319                 LDLM_POLICY_KEEP_LOCK : LDLM_POLICY_CANCEL_LOCK;
1320 }
1321
1322 /**
1323  * Callback function for default policy. Makes decision whether to keep
1324  * \a lock in LRU for current \a LRU size \a unused, added in current scan
1325  * \a added and number of locks to be preferably canceled \a count.
1326  *
1327  * \retval LDLM_POLICY_KEEP_LOCK keep lock in LRU in stop scanning
1328  *
1329  * \retval LDLM_POLICY_CANCEL_LOCK cancel lock from LRU
1330  */
1331 static ldlm_policy_res_t ldlm_cancel_default_policy(struct ldlm_namespace *ns,
1332                                                     struct ldlm_lock *lock,
1333                                                     int unused, int added,
1334                                                     int count)
1335 {
1336         /*
1337          * Stop lru processing when we reached passed @count or checked all
1338          * locks in lru.
1339          */
1340         return (added >= count) ?
1341                 LDLM_POLICY_KEEP_LOCK : LDLM_POLICY_CANCEL_LOCK;
1342 }
1343
1344 typedef ldlm_policy_res_t (*ldlm_cancel_lru_policy_t)(struct ldlm_namespace *,
1345                                                       struct ldlm_lock *, int,
1346                                                       int, int);
1347
1348 static ldlm_cancel_lru_policy_t
1349 ldlm_cancel_lru_policy(struct ldlm_namespace *ns, int flags)
1350 {
1351         if (ns_connect_lru_resize(ns)) {
1352                 if (flags & LDLM_CANCEL_SHRINK)
1353                         return ldlm_cancel_shrink_policy;
1354                 else if (flags & LDLM_CANCEL_LRUR)
1355                         return ldlm_cancel_lrur_policy;
1356                 else if (flags & LDLM_CANCEL_PASSED)
1357                         return ldlm_cancel_passed_policy;
1358         } else {
1359                 if (flags & LDLM_CANCEL_AGED)
1360                         return ldlm_cancel_aged_policy;
1361         }
1362
1363         return ldlm_cancel_default_policy;
1364 }
1365
1366 /* - Free space in lru for @count new locks,
1367  *   redundant unused locks are canceled locally;
1368  * - also cancel locally unused aged locks;
1369  * - do not cancel more than @max locks;
1370  * - GET the found locks and add them into the @cancels list.
1371  *
1372  * A client lock can be added to the l_bl_ast list only when it is
1373  * marked LDLM_FL_CANCELING. Otherwise, somebody is already doing CANCEL.
1374  * There are the following use cases: ldlm_cancel_resource_local(),
1375  * ldlm_cancel_lru_local() and ldlm_cli_cancel(), which check&set this
1376  * flag properly. As any attempt to cancel a lock rely on this flag,
1377  * l_bl_ast list is accessed later without any special locking.
1378  *
1379  * Calling policies for enabled lru resize:
1380  * ----------------------------------------
1381  * flags & LDLM_CANCEL_LRUR - use lru resize policy (SLV from server) to
1382  *                            cancel not more than @count locks;
1383  *
1384  * flags & LDLM_CANCEL_PASSED - cancel @count number of old locks (located at
1385  *                              the beginning of lru list);
1386  *
1387  * flags & LDLM_CANCEL_SHRINK - cancel not more than @count locks according to
1388  *                              memory pressre policy function;
1389  *
1390  * flags & LDLM_CANCEL_AGED -   cancel alocks according to "aged policy".
1391  */
1392 int ldlm_cancel_lru_local(struct ldlm_namespace *ns, struct list_head *cancels,
1393                           int count, int max, int cancel_flags, int flags)
1394 {
1395         ldlm_cancel_lru_policy_t pf;
1396         struct ldlm_lock *lock, *next;
1397         int added = 0, unused;
1398         ENTRY;
1399
1400         spin_lock(&ns->ns_unused_lock);
1401         unused = ns->ns_nr_unused;
1402
1403         if (!ns_connect_lru_resize(ns))
1404                 count += unused - ns->ns_max_unused;
1405
1406         pf = ldlm_cancel_lru_policy(ns, flags);
1407         LASSERT(pf != NULL);
1408
1409         while (!list_empty(&ns->ns_unused_list)) {
1410                 /* For any flags, stop scanning if @max is reached. */
1411                 if (max && added >= max)
1412                         break;
1413
1414                 list_for_each_entry_safe(lock, next, &ns->ns_unused_list, l_lru){
1415                         /* No locks which got blocking requests. */
1416                         LASSERT(!(lock->l_flags & LDLM_FL_BL_AST));
1417
1418                         /* Somebody is already doing CANCEL. No need in this
1419                          * lock in lru, do not traverse it again. */
1420                         if (!(lock->l_flags & LDLM_FL_CANCELING))
1421                                 break;
1422
1423                         ldlm_lock_remove_from_lru_nolock(lock);
1424                 }
1425                 if (&lock->l_lru == &ns->ns_unused_list)
1426                         break;
1427
1428                 /* Pass the lock through the policy filter and see if it
1429                  * should stay in lru.
1430                  *
1431                  * Even for shrinker policy we stop scanning if
1432                  * we find a lock that should stay in the cache.
1433                  * We should take into account lock age anyway
1434                  * as new lock even if it is small of weight is
1435                  * valuable resource.
1436                  *
1437                  * That is, for shrinker policy we drop only
1438                  * old locks, but additionally chose them by
1439                  * their weight. Big extent locks will stay in
1440                  * the cache. */
1441                 if (pf(ns, lock, unused, added, count) == LDLM_POLICY_KEEP_LOCK)
1442                         break;
1443
1444                 LDLM_LOCK_GET(lock); /* dropped by bl thread */
1445                 spin_unlock(&ns->ns_unused_lock);
1446
1447                 lock_res_and_lock(lock);
1448                 /* Check flags again under the lock. */
1449                 if ((lock->l_flags & LDLM_FL_CANCELING) ||
1450                     (ldlm_lock_remove_from_lru(lock) == 0)) {
1451                         /* other thread is removing lock from lru or
1452                          * somebody is already doing CANCEL or
1453                          * there is a blocking request which will send
1454                          * cancel by itseft or the lock is matched
1455                          * is already not unused. */
1456                         unlock_res_and_lock(lock);
1457                         LDLM_LOCK_PUT(lock);
1458                         spin_lock(&ns->ns_unused_lock);
1459                         continue;
1460                 }
1461                 LASSERT(!lock->l_readers && !lock->l_writers);
1462
1463                 /* If we have chosen to cancel this lock voluntarily, we
1464                  * better send cancel notification to server, so that it
1465                  * frees appropriate state. This might lead to a race
1466                  * where while we are doing cancel here, server is also
1467                  * silently cancelling this lock. */
1468                 lock->l_flags &= ~LDLM_FL_CANCEL_ON_BLOCK;
1469
1470                 /* Setting the CBPENDING flag is a little misleading,
1471                  * but prevents an important race; namely, once
1472                  * CBPENDING is set, the lock can accumulate no more
1473                  * readers/writers. Since readers and writers are
1474                  * already zero here, ldlm_lock_decref() won't see
1475                  * this flag and call l_blocking_ast */
1476                 lock->l_flags |= LDLM_FL_CBPENDING | LDLM_FL_CANCELING;
1477
1478                 /* We can't re-add to l_lru as it confuses the
1479                  * refcounting in ldlm_lock_remove_from_lru() if an AST
1480                  * arrives after we drop ns_lock below. We use l_bl_ast
1481                  * and can't use l_pending_chain as it is used both on
1482                  * server and client nevertheless bug 5666 says it is
1483                  * used only on server */
1484                 LASSERT(list_empty(&lock->l_bl_ast));
1485                 list_add(&lock->l_bl_ast, cancels);
1486                 unlock_res_and_lock(lock);
1487                 spin_lock(&ns->ns_unused_lock);
1488                 added++;
1489                 unused--;
1490         }
1491         spin_unlock(&ns->ns_unused_lock);
1492         RETURN(ldlm_cancel_list(cancels, added, cancel_flags));
1493 }
1494
1495 /* Returns number of locks which could be canceled next time when
1496  * ldlm_cancel_lru() is called. Used from locks pool shrinker. */
1497 int ldlm_cancel_lru_estimate(struct ldlm_namespace *ns,
1498                              int count, int max, int flags)
1499 {
1500         ldlm_cancel_lru_policy_t pf;
1501         struct ldlm_lock *lock;
1502         int added = 0, unused;
1503         ENTRY;
1504
1505         pf = ldlm_cancel_lru_policy(ns, flags);
1506         LASSERT(pf != NULL);
1507         spin_lock(&ns->ns_unused_lock);
1508         unused = ns->ns_nr_unused;
1509
1510         list_for_each_entry(lock, &ns->ns_unused_list, l_lru) {
1511                 /* For any flags, stop scanning if @max is reached. */
1512                 if (max && added >= max)
1513                         break;
1514
1515                 /* Somebody is already doing CANCEL or there is a
1516                  * blocking request will send cancel. Let's not count
1517                  * this lock. */
1518                 if ((lock->l_flags & LDLM_FL_CANCELING) ||
1519                     (lock->l_flags & LDLM_FL_BL_AST))
1520                         continue;
1521
1522                 /* Pass the lock through the policy filter and see if it
1523                  * should stay in lru. */
1524                 if (pf(ns, lock, unused, added, count) == LDLM_POLICY_KEEP_LOCK)
1525                         break;
1526
1527                 added++;
1528                 unused--;
1529         }
1530         spin_unlock(&ns->ns_unused_lock);
1531         RETURN(added);
1532 }
1533
1534 /* when called with LDLM_ASYNC the blocking callback will be handled
1535  * in a thread and this function will return after the thread has been
1536  * asked to call the callback.  when called with LDLM_SYNC the blocking
1537  * callback will be performed in this function. */
1538 int ldlm_cancel_lru(struct ldlm_namespace *ns, int nr, ldlm_sync_t sync,
1539                     int flags)
1540 {
1541         CFS_LIST_HEAD(cancels);
1542         int count, rc;
1543         ENTRY;
1544
1545 #ifndef __KERNEL__
1546         sync = LDLM_SYNC; /* force to be sync in user space */
1547 #endif
1548         count = ldlm_cancel_lru_local(ns, &cancels, nr, 0, 0, flags);
1549         if (sync == LDLM_ASYNC) {
1550                 rc = ldlm_bl_to_thread_list(ns, NULL, &cancels, count);
1551                 if (rc == 0)
1552                         RETURN(count);
1553         }
1554
1555         /* If an error occured in ASYNC mode, or
1556          * this is SYNC mode, cancel the list. */
1557         ldlm_cli_cancel_list(&cancels, count, NULL, 0);
1558         RETURN(count);
1559 }
1560
1561 /* Find and cancel locally unused locks found on resource, matched to the
1562  * given policy, mode. GET the found locks and add them into the @cancels
1563  * list. */
1564 int ldlm_cancel_resource_local(struct ldlm_resource *res,
1565                                struct list_head *cancels,
1566                                ldlm_policy_data_t *policy,
1567                                ldlm_mode_t mode, int lock_flags,
1568                                int cancel_flags, void *opaque)
1569 {
1570         struct ldlm_lock *lock;
1571         int count = 0;
1572         ENTRY;
1573
1574         lock_res(res);
1575         list_for_each_entry(lock, &res->lr_granted, l_res_link) {
1576                 if (opaque != NULL && lock->l_ast_data != opaque) {
1577                         LDLM_ERROR(lock, "data %p doesn't match opaque %p",
1578                                    lock->l_ast_data, opaque);
1579                         //LBUG();
1580                         continue;
1581                 }
1582
1583                 if (lock->l_readers || lock->l_writers) {
1584                         if (cancel_flags & LDLM_FL_WARN) {
1585                                 LDLM_ERROR(lock, "lock in use");
1586                                 //LBUG();
1587                         }
1588                         continue;
1589                 }
1590
1591                 /* If somebody is already doing CANCEL, or blocking ast came,
1592                  * skip this lock. */
1593                 if (lock->l_flags & LDLM_FL_BL_AST ||
1594                     lock->l_flags & LDLM_FL_CANCELING)
1595                         continue;
1596
1597                 if (lockmode_compat(lock->l_granted_mode, mode))
1598                         continue;
1599
1600                 /* If policy is given and this is IBITS lock, add to list only
1601                  * those locks that match by policy. */
1602                 if (policy && (lock->l_resource->lr_type == LDLM_IBITS) &&
1603                     !(lock->l_policy_data.l_inodebits.bits &
1604                       policy->l_inodebits.bits))
1605                         continue;
1606
1607                 /* See CBPENDING comment in ldlm_cancel_lru */
1608                 lock->l_flags |= LDLM_FL_CBPENDING | LDLM_FL_CANCELING |
1609                                  lock_flags;
1610
1611                 LASSERT(list_empty(&lock->l_bl_ast));
1612                 list_add(&lock->l_bl_ast, cancels);
1613                 LDLM_LOCK_GET(lock);
1614                 count++;
1615         }
1616         unlock_res(res);
1617
1618         RETURN(ldlm_cancel_list(cancels, count, cancel_flags));
1619 }
1620
1621 /* If @req is NULL, send CANCEL request to server with handles of locks
1622  * in the @cancels. If EARLY_CANCEL is not supported, send CANCEL requests
1623  * separately per lock.
1624  * If @req is not NULL, put handles of locks in @cancels into the request
1625  * buffer at the offset @off.
1626  * Destroy @cancels at the end. */
1627 int ldlm_cli_cancel_list(struct list_head *cancels, int count,
1628                          struct ptlrpc_request *req, int flags)
1629 {
1630         struct ldlm_lock *lock;
1631         int res = 0;
1632         ENTRY;
1633
1634         if (list_empty(cancels) || count == 0)
1635                 RETURN(0);
1636
1637         /* XXX: requests (both batched and not) could be sent in parallel.
1638          * Usually it is enough to have just 1 RPC, but it is possible that
1639          * there are to many locks to be cancelled in LRU or on a resource.
1640          * It would also speed up the case when the server does not support
1641          * the feature. */
1642         while (count > 0) {
1643                 LASSERT(!list_empty(cancels));
1644                 lock = list_entry(cancels->next, struct ldlm_lock, l_bl_ast);
1645                 LASSERT(lock->l_conn_export);
1646
1647                 if (exp_connect_cancelset(lock->l_conn_export)) {
1648                         res = count;
1649                         if (req)
1650                                 ldlm_cancel_pack(req, cancels, count);
1651                         else
1652                                 res = ldlm_cli_cancel_req(lock->l_conn_export,
1653                                                           cancels, count,
1654                                                           flags);
1655                 } else {
1656                         res = ldlm_cli_cancel_req(lock->l_conn_export,
1657                                                   cancels, 1, flags);
1658                 }
1659
1660                 if (res < 0) {
1661                         CERROR("ldlm_cli_cancel_list: %d\n", res);
1662                         res = count;
1663                 }
1664
1665                 count -= res;
1666                 ldlm_lock_list_put(cancels, l_bl_ast, res);
1667         }
1668         LASSERT(count == 0);
1669         RETURN(0);
1670 }
1671
1672 int ldlm_cli_cancel_unused_resource(struct ldlm_namespace *ns,
1673                                     const struct ldlm_res_id *res_id,
1674                                     ldlm_policy_data_t *policy,
1675                                     ldlm_mode_t mode, int flags, void *opaque)
1676 {
1677         struct ldlm_resource *res;
1678         CFS_LIST_HEAD(cancels);
1679         int count;
1680         int rc;
1681         ENTRY;
1682
1683         res = ldlm_resource_get(ns, NULL, res_id, 0, 0);
1684         if (res == NULL) {
1685                 /* This is not a problem. */
1686                 CDEBUG(D_INFO, "No resource "LPU64"\n", res_id->name[0]);
1687                 RETURN(0);
1688         }
1689
1690         count = ldlm_cancel_resource_local(res, &cancels, policy, mode,
1691                                            0, flags, opaque);
1692         rc = ldlm_cli_cancel_list(&cancels, count, NULL, flags);
1693         if (rc != ELDLM_OK)
1694                 CERROR("ldlm_cli_cancel_unused_resource: %d\n", rc);
1695
1696         ldlm_resource_putref(res);
1697         RETURN(0);
1698 }
1699
1700 static inline int have_no_nsresource(struct ldlm_namespace *ns)
1701 {
1702         int no_resource = 0;
1703
1704         spin_lock(&ns->ns_hash_lock);
1705         if (ns->ns_resources == 0)
1706                 no_resource = 1;
1707         spin_unlock(&ns->ns_hash_lock);
1708
1709         RETURN(no_resource);
1710 }
1711
1712 /* Cancel all locks on a namespace (or a specific resource, if given)
1713  * that have 0 readers/writers.
1714  *
1715  * If flags & LDLM_FL_LOCAL_ONLY, throw the locks away without trying
1716  * to notify the server. */
1717 int ldlm_cli_cancel_unused(struct ldlm_namespace *ns,
1718                            const struct ldlm_res_id *res_id,
1719                            int flags, void *opaque)
1720 {
1721         int i;
1722         ENTRY;
1723
1724         if (ns == NULL)
1725                 RETURN(ELDLM_OK);
1726
1727         if (res_id)
1728                 RETURN(ldlm_cli_cancel_unused_resource(ns, res_id, NULL,
1729                                                        LCK_MINMODE, flags,
1730                                                        opaque));
1731
1732         spin_lock(&ns->ns_hash_lock);
1733         for (i = 0; i < RES_HASH_SIZE; i++) {
1734                 struct list_head *tmp;
1735                 tmp = ns->ns_hash[i].next;
1736                 while (tmp != &(ns->ns_hash[i])) {
1737                         struct ldlm_resource *res;
1738                         int rc;
1739
1740                         res = list_entry(tmp, struct ldlm_resource, lr_hash);
1741                         ldlm_resource_getref(res);
1742                         spin_unlock(&ns->ns_hash_lock);
1743
1744                         rc = ldlm_cli_cancel_unused_resource(ns, &res->lr_name,
1745                                                              NULL, LCK_MINMODE,
1746                                                              flags, opaque);
1747
1748                         if (rc)
1749                                 CERROR("ldlm_cli_cancel_unused ("LPU64"): %d\n",
1750                                        res->lr_name.name[0], rc);
1751
1752                         spin_lock(&ns->ns_hash_lock);
1753                         tmp = tmp->next;
1754                         ldlm_resource_putref_locked(res);
1755                 }
1756         }
1757         spin_unlock(&ns->ns_hash_lock);
1758
1759         RETURN(ELDLM_OK);
1760 }
1761
1762 /* join/split resource locks to/from lru list */
1763 int ldlm_cli_join_lru(struct ldlm_namespace *ns,
1764                       const struct ldlm_res_id *res_id, int join)
1765 {
1766         struct ldlm_resource *res;
1767         struct ldlm_lock *lock, *n;
1768         int count = 0;
1769         ENTRY;
1770
1771         LASSERT(ns_is_client(ns));
1772
1773         res = ldlm_resource_get(ns, NULL, res_id, LDLM_EXTENT, 0);
1774         if (res == NULL)
1775                 RETURN(count);
1776         LASSERT(res->lr_type == LDLM_EXTENT);
1777
1778         lock_res(res);
1779         if (!join)
1780                 goto split;
1781
1782         list_for_each_entry_safe (lock, n, &res->lr_granted, l_res_link) {
1783                 if (list_empty(&lock->l_lru) &&
1784                     !lock->l_readers && !lock->l_writers &&
1785                     !(lock->l_flags & LDLM_FL_LOCAL) &&
1786                     !(lock->l_flags & LDLM_FL_CBPENDING) &&
1787                     !(lock->l_flags & LDLM_FL_BL_AST)) {
1788                         ldlm_lock_add_to_lru(lock);
1789                         lock->l_flags &= ~LDLM_FL_NO_LRU;
1790                         LDLM_DEBUG(lock, "join lock to lru");
1791                         count++;
1792                 }
1793         }
1794         goto unlock;
1795 split:
1796         spin_lock(&ns->ns_unused_lock);
1797         list_for_each_entry_safe (lock, n, &ns->ns_unused_list, l_lru) {
1798                 if (lock->l_resource == res) {
1799                         ldlm_lock_remove_from_lru_nolock(lock);
1800                         lock->l_flags |= LDLM_FL_NO_LRU;
1801                         LDLM_DEBUG(lock, "split lock from lru");
1802                         count++;
1803                 }
1804         }
1805         spin_unlock(&ns->ns_unused_lock);
1806 unlock:
1807         unlock_res(res);
1808         ldlm_resource_putref(res);
1809         RETURN(count);
1810 }
1811
1812 /* Lock iterators. */
1813
1814 int ldlm_resource_foreach(struct ldlm_resource *res, ldlm_iterator_t iter,
1815                           void *closure)
1816 {
1817         struct list_head *tmp, *next;
1818         struct ldlm_lock *lock;
1819         int rc = LDLM_ITER_CONTINUE;
1820
1821         ENTRY;
1822
1823         if (!res)
1824                 RETURN(LDLM_ITER_CONTINUE);
1825
1826         lock_res(res);
1827         list_for_each_safe(tmp, next, &res->lr_granted) {
1828                 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
1829
1830                 if (iter(lock, closure) == LDLM_ITER_STOP)
1831                         GOTO(out, rc = LDLM_ITER_STOP);
1832         }
1833
1834         list_for_each_safe(tmp, next, &res->lr_converting) {
1835                 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
1836
1837                 if (iter(lock, closure) == LDLM_ITER_STOP)
1838                         GOTO(out, rc = LDLM_ITER_STOP);
1839         }
1840
1841         list_for_each_safe(tmp, next, &res->lr_waiting) {
1842                 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
1843
1844                 if (iter(lock, closure) == LDLM_ITER_STOP)
1845                         GOTO(out, rc = LDLM_ITER_STOP);
1846         }
1847  out:
1848         unlock_res(res);
1849         RETURN(rc);
1850 }
1851
1852 struct iter_helper_data {
1853         ldlm_iterator_t iter;
1854         void *closure;
1855 };
1856
1857 static int ldlm_iter_helper(struct ldlm_lock *lock, void *closure)
1858 {
1859         struct iter_helper_data *helper = closure;
1860         return helper->iter(lock, helper->closure);
1861 }
1862
1863 static int ldlm_res_iter_helper(struct ldlm_resource *res, void *closure)
1864 {
1865         return ldlm_resource_foreach(res, ldlm_iter_helper, closure);
1866 }
1867
1868 int ldlm_namespace_foreach(struct ldlm_namespace *ns, ldlm_iterator_t iter,
1869                            void *closure)
1870 {
1871         struct iter_helper_data helper = { iter: iter, closure: closure };
1872         return ldlm_namespace_foreach_res(ns, ldlm_res_iter_helper, &helper);
1873 }
1874
1875 int ldlm_namespace_foreach_res(struct ldlm_namespace *ns,
1876                                ldlm_res_iterator_t iter, void *closure)
1877 {
1878         int i, rc = LDLM_ITER_CONTINUE;
1879         struct ldlm_resource *res;
1880         struct list_head *tmp;
1881
1882         ENTRY;
1883         spin_lock(&ns->ns_hash_lock);
1884         for (i = 0; i < RES_HASH_SIZE; i++) {
1885                 tmp = ns->ns_hash[i].next;
1886                 while (tmp != &(ns->ns_hash[i])) {
1887                         res = list_entry(tmp, struct ldlm_resource, lr_hash);
1888                         ldlm_resource_getref(res);
1889                         spin_unlock(&ns->ns_hash_lock);
1890
1891                         rc = iter(res, closure);
1892
1893                         spin_lock(&ns->ns_hash_lock);
1894                         tmp = tmp->next;
1895                         ldlm_resource_putref_locked(res);
1896                         if (rc == LDLM_ITER_STOP)
1897                                 GOTO(out, rc);
1898                 }
1899         }
1900  out:
1901         spin_unlock(&ns->ns_hash_lock);
1902         RETURN(rc);
1903 }
1904
1905 /* non-blocking function to manipulate a lock whose cb_data is being put away.*/
1906 void ldlm_resource_iterate(struct ldlm_namespace *ns,
1907                            const struct ldlm_res_id *res_id,
1908                            ldlm_iterator_t iter, void *data)
1909 {
1910         struct ldlm_resource *res;
1911         ENTRY;
1912
1913         if (ns == NULL) {
1914                 CERROR("must pass in namespace\n");
1915                 LBUG();
1916         }
1917
1918         res = ldlm_resource_get(ns, NULL, res_id, 0, 0);
1919         if (res == NULL) {
1920                 EXIT;
1921                 return;
1922         }
1923
1924         ldlm_resource_foreach(res, iter, data);
1925         ldlm_resource_putref(res);
1926         EXIT;
1927 }
1928
1929 /* Lock replay */
1930
1931 static int ldlm_chain_lock_for_replay(struct ldlm_lock *lock, void *closure)
1932 {
1933         struct list_head *list = closure;
1934
1935         /* we use l_pending_chain here, because it's unused on clients. */
1936         LASSERTF(list_empty(&lock->l_pending_chain),"lock %p next %p prev %p\n",
1937                  lock, &lock->l_pending_chain.next,&lock->l_pending_chain.prev);
1938         /* bug 9573: don't replay locks left after eviction */
1939         if (!(lock->l_flags & LDLM_FL_FAILED))
1940                 list_add(&lock->l_pending_chain, list);
1941         return LDLM_ITER_CONTINUE;
1942 }
1943
1944 static int replay_lock_interpret(struct ptlrpc_request *req,
1945                                  struct ldlm_async_args *aa, int rc)
1946 {
1947         struct ldlm_lock  *lock;
1948         struct ldlm_reply *reply;
1949
1950         ENTRY;
1951         atomic_dec(&req->rq_import->imp_replay_inflight);
1952         if (rc != ELDLM_OK)
1953                 GOTO(out, rc);
1954
1955
1956         reply = req_capsule_server_get(&req->rq_pill, &RMF_DLM_REP);
1957         if (reply == NULL)
1958                 GOTO(out, rc = -EPROTO);
1959
1960         lock = ldlm_handle2lock(&aa->lock_handle);
1961         if (!lock) {
1962                 CERROR("received replay ack for unknown local cookie "LPX64
1963                        " remote cookie "LPX64 " from server %s id %s\n",
1964                        aa->lock_handle.cookie, reply->lock_handle.cookie,
1965                        req->rq_export->exp_client_uuid.uuid,
1966                        libcfs_id2str(req->rq_peer));
1967                 GOTO(out, rc = -ESTALE);
1968         }
1969
1970         lock->l_remote_handle = reply->lock_handle;
1971         LDLM_DEBUG(lock, "replayed lock:");
1972         ptlrpc_import_recovery_state_machine(req->rq_import);
1973         LDLM_LOCK_PUT(lock);
1974 out:
1975         if (rc != ELDLM_OK)
1976                 ptlrpc_connect_import(req->rq_import, NULL);
1977
1978
1979         RETURN(rc);
1980 }
1981
1982 static int replay_one_lock(struct obd_import *imp, struct ldlm_lock *lock)
1983 {
1984         struct ptlrpc_request *req;
1985         struct ldlm_async_args *aa;
1986         struct ldlm_request   *body;
1987         int flags;
1988         ENTRY;
1989
1990
1991         /* Bug 11974: Do not replay a lock which is actively being canceled */
1992         if (lock->l_flags & LDLM_FL_CANCELING) {
1993                 LDLM_DEBUG(lock, "Not replaying canceled lock:");
1994                 RETURN(0);
1995         }
1996
1997         /* If this is reply-less callback lock, we cannot replay it, since
1998          * server might have long dropped it, but notification of that event was
1999          * lost by network. (and server granted conflicting lock already) */
2000         if (lock->l_flags & LDLM_FL_CANCEL_ON_BLOCK) {
2001                 LDLM_DEBUG(lock, "Not replaying reply-less lock:");
2002                 ldlm_lock_cancel(lock);
2003                 RETURN(0);
2004         }
2005         /*
2006          * If granted mode matches the requested mode, this lock is granted.
2007          *
2008          * If they differ, but we have a granted mode, then we were granted
2009          * one mode and now want another: ergo, converting.
2010          *
2011          * If we haven't been granted anything and are on a resource list,
2012          * then we're blocked/waiting.
2013          *
2014          * If we haven't been granted anything and we're NOT on a resource list,
2015          * then we haven't got a reply yet and don't have a known disposition.
2016          * This happens whenever a lock enqueue is the request that triggers
2017          * recovery.
2018          */
2019         if (lock->l_granted_mode == lock->l_req_mode)
2020                 flags = LDLM_FL_REPLAY | LDLM_FL_BLOCK_GRANTED;
2021         else if (lock->l_granted_mode)
2022                 flags = LDLM_FL_REPLAY | LDLM_FL_BLOCK_CONV;
2023         else if (!list_empty(&lock->l_res_link))
2024                 flags = LDLM_FL_REPLAY | LDLM_FL_BLOCK_WAIT;
2025         else
2026                 flags = LDLM_FL_REPLAY;
2027
2028         req = ptlrpc_request_alloc_pack(imp, &RQF_LDLM_ENQUEUE,
2029                                         LUSTRE_DLM_VERSION, LDLM_ENQUEUE);
2030         if (req == NULL)
2031                 RETURN(-ENOMEM);
2032
2033         /* We're part of recovery, so don't wait for it. */
2034         req->rq_send_state = LUSTRE_IMP_REPLAY_LOCKS;
2035
2036         body = req_capsule_client_get(&req->rq_pill, &RMF_DLM_REQ);
2037         ldlm_lock2desc(lock, &body->lock_desc);
2038         body->lock_flags = flags;
2039
2040         ldlm_lock2handle(lock, &body->lock_handle[0]);
2041         if (lock->l_lvb_len != 0) {
2042                 req_capsule_extend(&req->rq_pill, &RQF_LDLM_ENQUEUE_LVB);
2043                 req_capsule_set_size(&req->rq_pill, &RMF_DLM_LVB, RCL_SERVER,
2044                                      lock->l_lvb_len);
2045         }
2046         ptlrpc_request_set_replen(req);
2047         /* notify the server we've replayed all requests.
2048          * also, we mark the request to be put on a dedicated
2049          * queue to be processed after all request replayes.
2050          * bug 6063 */
2051         lustre_msg_set_flags(req->rq_reqmsg, MSG_REQ_REPLAY_DONE);
2052
2053         LDLM_DEBUG(lock, "replaying lock:");
2054
2055         atomic_inc(&req->rq_import->imp_replay_inflight);
2056         CLASSERT(sizeof(*aa) <= sizeof(req->rq_async_args));
2057         aa = (struct ldlm_async_args *)&req->rq_async_args;
2058         aa->lock_handle = body->lock_handle[0];
2059         req->rq_interpret_reply = replay_lock_interpret;
2060         ptlrpcd_add_req(req);
2061
2062         RETURN(0);
2063 }
2064
2065 int ldlm_replay_locks(struct obd_import *imp)
2066 {
2067         struct ldlm_namespace *ns = imp->imp_obd->obd_namespace;
2068         CFS_LIST_HEAD(list);
2069         struct ldlm_lock *lock, *next;
2070         int rc = 0;
2071
2072         ENTRY;
2073
2074         LASSERT(atomic_read(&imp->imp_replay_inflight) == 0);
2075
2076         /* ensure this doesn't fall to 0 before all have been queued */
2077         atomic_inc(&imp->imp_replay_inflight);
2078
2079         (void)ldlm_namespace_foreach(ns, ldlm_chain_lock_for_replay, &list);
2080
2081         list_for_each_entry_safe(lock, next, &list, l_pending_chain) {
2082                 list_del_init(&lock->l_pending_chain);
2083                 if (rc)
2084                         continue; /* or try to do the rest? */
2085                 rc = replay_one_lock(imp, lock);
2086         }
2087
2088         atomic_dec(&imp->imp_replay_inflight);
2089
2090         RETURN(rc);
2091 }