lustre/ldlm/ldlm_lock.c

   1 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
   2  * vim:expandtab:shiftwidth=8:tabstop=8:
   3  *
   4  * GPL HEADER START
   5  *
   6  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   7  *
   8  * This program is free software; you can redistribute it and/or modify
   9  * it under the terms of the GNU General Public License version 2 only,
  10  * as published by the Free Software Foundation.
  11  *
  12  * This program is distributed in the hope that it will be useful, but
  13  * WITHOUT ANY WARRANTY; without even the implied warranty of
  14  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  15  * General Public License version 2 for more details (a copy is included
  16  * in the LICENSE file that accompanied this code).
  17  *
  18  * You should have received a copy of the GNU General Public License
  19  * version 2 along with this program; If not, see [sun.com URL with a
  20  * copy of GPLv2].
  21  *
  22  * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
  23  * CA 95054 USA or visit www.sun.com if you need additional information or
  24  * have any questions.
  25  *
  26  * GPL HEADER END
  27  */
  28 /*
  29  * Copyright  2008 Sun Microsystems, Inc. All rights reserved
  30  * Use is subject to license terms.
  31  */
  32 /*
  33  * This file is part of Lustre, http://www.lustre.org/
  34  * Lustre is a trademark of Sun Microsystems, Inc.
  35  *
  36  * lustre/ldlm/ldlm_lock.c
  37  *
  38  * Author: Peter Braam <braam@clusterfs.com>
  39  * Author: Phil Schwan <phil@clusterfs.com>
  40  */
  41
  42 #define DEBUG_SUBSYSTEM S_LDLM
  43
  44 #ifdef __KERNEL__
  45 # include <libcfs/libcfs.h>
  46 # ifndef HAVE_VFS_INTENT_PATCHES
  47 # include <linux/lustre_intent.h>
  48 # endif
  49 #else
  50 # include <liblustre.h>
  51 #endif
  52
  53 #include <obd_class.h>
  54 #include "ldlm_internal.h"
  55
  56 /* lock types */
  57 char *ldlm_lockname[] = {
  58         [0] "--",
  59         [LCK_EX] "EX",
  60         [LCK_PW] "PW",
  61         [LCK_PR] "PR",
  62         [LCK_CW] "CW",
  63         [LCK_CR] "CR",
  64         [LCK_NL] "NL",
  65         [LCK_GROUP] "GROUP"
  66 };
  67
  68 char *ldlm_typename[] = {
  69         [LDLM_PLAIN] "PLN",
  70         [LDLM_EXTENT] "EXT",
  71         [LDLM_FLOCK] "FLK",
  72         [LDLM_IBITS] "IBT",
  73 };
  74
  75 char *ldlm_it2str(int it)
  76 {
  77         switch (it) {
  78         case IT_OPEN:
  79                 return "open";
  80         case IT_CREAT:
  81                 return "creat";
  82         case (IT_OPEN | IT_CREAT):
  83                 return "open|creat";
  84         case IT_READDIR:
  85                 return "readdir";
  86         case IT_GETATTR:
  87                 return "getattr";
  88         case IT_LOOKUP:
  89                 return "lookup";
  90         case IT_UNLINK:
  91                 return "unlink";
  92         case IT_GETXATTR:
  93                 return "getxattr";
  94         default:
  95                 CERROR("Unknown intent %d\n", it);
  96                 return "UNKNOWN";
  97         }
  98 }
  99
 100 extern cfs_mem_cache_t *ldlm_lock_slab;
 101
 102 static ldlm_processing_policy ldlm_processing_policy_table[] = {
 103         [LDLM_PLAIN] ldlm_process_plain_lock,
 104         [LDLM_EXTENT] ldlm_process_extent_lock,
 105 #ifdef __KERNEL__
 106         [LDLM_FLOCK] ldlm_process_flock_lock,
 107 #endif
 108         [LDLM_IBITS] ldlm_process_inodebits_lock,
 109 };
 110
 111 ldlm_processing_policy ldlm_get_processing_policy(struct ldlm_resource *res)
 112 {
 113         return ldlm_processing_policy_table[res->lr_type];
 114 }
 115
 116 void ldlm_register_intent(struct ldlm_namespace *ns, ldlm_res_policy arg)
 117 {
 118         ns->ns_policy = arg;
 119 }
 120
 121 /*
 122  * REFCOUNTED LOCK OBJECTS
 123  */
 124
 125
 126 /*
 127  * Lock refcounts, during creation:
 128  *   - one special one for allocation, dec'd only once in destroy
 129  *   - one for being a lock that's in-use
 130  *   - one for the addref associated with a new lock
 131  */
 132 struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock)
 133 {
 134         atomic_inc(&lock->l_refc);
 135         return lock;
 136 }
 137
 138 static void ldlm_lock_free(struct ldlm_lock *lock, size_t size)
 139 {
 140         LASSERT(size == sizeof(*lock));
 141         OBD_SLAB_FREE(lock, ldlm_lock_slab, sizeof(*lock));
 142 }
 143
 144 void ldlm_lock_put(struct ldlm_lock *lock)
 145 {
 146         ENTRY;
 147
 148         LASSERT(lock->l_resource != LP_POISON);
 149         LASSERT(atomic_read(&lock->l_refc) > 0);
 150         if (atomic_dec_and_test(&lock->l_refc)) {
 151                 struct ldlm_resource *res;
 152
 153                 LDLM_DEBUG(lock,
 154                            "final lock_put on destroyed lock, freeing it.");
 155
 156                 res = lock->l_resource;
 157                 LASSERT(lock->l_destroyed);
 158                 LASSERT(list_empty(&lock->l_res_link));
 159                 LASSERT(list_empty(&lock->l_pending_chain));
 160
 161                 atomic_dec(&res->lr_namespace->ns_locks);
 162                 ldlm_resource_putref(res);
 163                 lock->l_resource = NULL;
 164                 if (lock->l_export) {
 165                         class_export_put(lock->l_export);
 166                         lock->l_export = NULL;
 167                 }
 168
 169                 if (lock->l_lvb_data != NULL)
 170                         OBD_FREE(lock->l_lvb_data, lock->l_lvb_len);
 171
 172                 ldlm_interval_free(ldlm_interval_detach(lock));
 173                 OBD_FREE_RCU_CB(lock, sizeof(*lock), &lock->l_handle,
 174                                 ldlm_lock_free);
 175         }
 176
 177         EXIT;
 178 }
 179
 180 int ldlm_lock_remove_from_lru_nolock(struct ldlm_lock *lock)
 181 {
 182         int rc = 0;
 183         if (!list_empty(&lock->l_lru)) {
 184                 struct ldlm_namespace *ns = lock->l_resource->lr_namespace;
 185                 LASSERT(lock->l_resource->lr_type != LDLM_FLOCK);
 186                 list_del_init(&lock->l_lru);
 187                 ns->ns_nr_unused--;
 188                 LASSERT(ns->ns_nr_unused >= 0);
 189                 rc = 1;
 190         }
 191         return rc;
 192 }
 193
 194 int ldlm_lock_remove_from_lru(struct ldlm_lock *lock)
 195 {
 196         struct ldlm_namespace *ns = lock->l_resource->lr_namespace;
 197         int rc;
 198         ENTRY;
 199         spin_lock(&ns->ns_unused_lock);
 200         rc = ldlm_lock_remove_from_lru_nolock(lock);
 201         spin_unlock(&ns->ns_unused_lock);
 202         EXIT;
 203         return rc;
 204 }
 205
 206 void ldlm_lock_add_to_lru_nolock(struct ldlm_lock *lock)
 207 {
 208         struct ldlm_namespace *ns = lock->l_resource->lr_namespace;
 209         lock->l_last_used = cfs_time_current();
 210         LASSERT(list_empty(&lock->l_lru));
 211         LASSERT(lock->l_resource->lr_type != LDLM_FLOCK);
 212         list_add_tail(&lock->l_lru, &ns->ns_unused_list);
 213         LASSERT(ns->ns_nr_unused >= 0);
 214         ns->ns_nr_unused++;
 215 }
 216
 217 void ldlm_lock_add_to_lru(struct ldlm_lock *lock)
 218 {
 219         struct ldlm_namespace *ns = lock->l_resource->lr_namespace;
 220         ENTRY;
 221         spin_lock(&ns->ns_unused_lock);
 222         ldlm_lock_add_to_lru_nolock(lock);
 223         spin_unlock(&ns->ns_unused_lock);
 224         EXIT;
 225 }
 226
 227 void ldlm_lock_touch_in_lru(struct ldlm_lock *lock)
 228 {
 229         struct ldlm_namespace *ns = lock->l_resource->lr_namespace;
 230         ENTRY;
 231         spin_lock(&ns->ns_unused_lock);
 232         if (!list_empty(&lock->l_lru)) {
 233                 ldlm_lock_remove_from_lru_nolock(lock);
 234                 ldlm_lock_add_to_lru_nolock(lock);
 235         }
 236         spin_unlock(&ns->ns_unused_lock);
 237         EXIT;
 238 }
 239
 240 /* This used to have a 'strict' flag, which recovery would use to mark an
 241  * in-use lock as needing-to-die.  Lest I am ever tempted to put it back, I
 242  * shall explain why it's gone: with the new hash table scheme, once you call
 243  * ldlm_lock_destroy, you can never drop your final references on this lock.
 244  * Because it's not in the hash table anymore.  -phil */
 245 int ldlm_lock_destroy_internal(struct ldlm_lock *lock)
 246 {
 247         ENTRY;
 248
 249         if (lock->l_readers || lock->l_writers) {
 250                 LDLM_ERROR(lock, "lock still has references");
 251                 ldlm_lock_dump(D_ERROR, lock, 0);
 252                 LBUG();
 253         }
 254
 255         if (!list_empty(&lock->l_res_link)) {
 256                 LDLM_ERROR(lock, "lock still on resource");
 257                 ldlm_lock_dump(D_ERROR, lock, 0);
 258                 LBUG();
 259         }
 260
 261         if (lock->l_destroyed) {
 262                 LASSERT(list_empty(&lock->l_lru));
 263                 EXIT;
 264                 return 0;
 265         }
 266         lock->l_destroyed = 1;
 267
 268         if (lock->l_export)
 269                 spin_lock(&lock->l_export->exp_ldlm_data.led_lock);
 270         list_del_init(&lock->l_export_chain);
 271         if (lock->l_export)
 272                 spin_unlock(&lock->l_export->exp_ldlm_data.led_lock);
 273
 274         ldlm_lock_remove_from_lru(lock);
 275         class_handle_unhash(&lock->l_handle);
 276
 277 #if 0
 278         /* Wake anyone waiting for this lock */
 279         /* FIXME: I should probably add yet another flag, instead of using
 280          * l_export to only call this on clients */
 281         if (lock->l_export)
 282                 class_export_put(lock->l_export);
 283         lock->l_export = NULL;
 284         if (lock->l_export && lock->l_completion_ast)
 285                 lock->l_completion_ast(lock, 0);
 286 #endif
 287         EXIT;
 288         return 1;
 289 }
 290
 291 void ldlm_lock_destroy(struct ldlm_lock *lock)
 292 {
 293         int first;
 294         ENTRY;
 295         lock_res_and_lock(lock);
 296         first = ldlm_lock_destroy_internal(lock);
 297         unlock_res_and_lock(lock);
 298
 299         /* drop reference from hashtable only for first destroy */
 300         if (first)
 301                 LDLM_LOCK_PUT(lock);
 302         EXIT;
 303 }
 304
 305 void ldlm_lock_destroy_nolock(struct ldlm_lock *lock)
 306 {
 307         int first;
 308         ENTRY;
 309         first = ldlm_lock_destroy_internal(lock);
 310         /* drop reference from hashtable only for first destroy */
 311         if (first)
 312                 LDLM_LOCK_PUT(lock);
 313         EXIT;
 314 }
 315
 316 /* this is called by portals_handle2object with the handle lock taken */
 317 static void lock_handle_addref(void *lock)
 318 {
 319         LDLM_LOCK_GET((struct ldlm_lock *)lock);
 320 }
 321
 322 /*
 323  * usage: pass in a resource on which you have done ldlm_resource_get
 324  *        pass in a parent lock on which you have done a ldlm_lock_get
 325  *        after return, ldlm_*_put the resource and parent
 326  * returns: lock with refcount 2 - one for current caller and one for remote
 327  */
 328 static struct ldlm_lock *ldlm_lock_new(struct ldlm_resource *resource)
 329 {
 330         struct ldlm_lock *lock;
 331         ENTRY;
 332
 333         if (resource == NULL)
 334                 LBUG();
 335
 336         OBD_SLAB_ALLOC(lock, ldlm_lock_slab, CFS_ALLOC_IO, sizeof(*lock));
 337         if (lock == NULL)
 338                 RETURN(NULL);
 339
 340         spin_lock_init(&lock->l_lock);
 341         lock->l_resource = ldlm_resource_getref(resource);
 342
 343         atomic_set(&lock->l_refc, 2);
 344         CFS_INIT_LIST_HEAD(&lock->l_res_link);
 345         CFS_INIT_LIST_HEAD(&lock->l_lru);
 346         CFS_INIT_LIST_HEAD(&lock->l_export_chain);
 347         CFS_INIT_LIST_HEAD(&lock->l_pending_chain);
 348         CFS_INIT_LIST_HEAD(&lock->l_bl_ast);
 349         CFS_INIT_LIST_HEAD(&lock->l_cp_ast);
 350         cfs_waitq_init(&lock->l_waitq);
 351         lock->l_blocking_lock = NULL;
 352         CFS_INIT_LIST_HEAD(&lock->l_sl_mode);
 353         CFS_INIT_LIST_HEAD(&lock->l_sl_policy);
 354
 355         atomic_inc(&resource->lr_namespace->ns_locks);
 356         CFS_INIT_LIST_HEAD(&lock->l_handle.h_link);
 357         class_handle_hash(&lock->l_handle, lock_handle_addref);
 358
 359         CFS_INIT_LIST_HEAD(&lock->l_extents_list);
 360         spin_lock_init(&lock->l_extents_list_lock);
 361         CFS_INIT_LIST_HEAD(&lock->l_cache_locks_list);
 362
 363         RETURN(lock);
 364 }
 365
 366 int ldlm_lock_change_resource(struct ldlm_namespace *ns, struct ldlm_lock *lock,
 367                               const struct ldlm_res_id *new_resid)
 368 {
 369         struct ldlm_resource *oldres = lock->l_resource;
 370         struct ldlm_resource *newres;
 371         int type;
 372         ENTRY;
 373
 374         LASSERT(ns_is_client(ns));
 375
 376         lock_res_and_lock(lock);
 377         if (memcmp(new_resid, &lock->l_resource->lr_name,
 378                    sizeof(lock->l_resource->lr_name)) == 0) {
 379                 /* Nothing to do */
 380                 unlock_res_and_lock(lock);
 381                 RETURN(0);
 382         }
 383
 384         LASSERT(new_resid->name[0] != 0);
 385
 386         /* This function assumes that the lock isn't on any lists */
 387         LASSERT(list_empty(&lock->l_res_link));
 388
 389         type = oldres->lr_type;
 390         unlock_res_and_lock(lock);
 391
 392         newres = ldlm_resource_get(ns, NULL, new_resid, type, 1);
 393         if (newres == NULL)
 394                 RETURN(-ENOMEM);
 395
 396         lock_res_and_lock(lock);
 397         LASSERT(memcmp(new_resid, &lock->l_resource->lr_name,
 398                        sizeof(lock->l_resource->lr_name)) != 0);
 399         lock_res(newres);
 400         lock->l_resource = newres;
 401         unlock_res(oldres);
 402         unlock_res_and_lock(lock);
 403
 404         /* ...and the flowers are still standing! */
 405         ldlm_resource_putref(oldres);
 406
 407         RETURN(0);
 408 }
 409
 410 /*
 411  *  HANDLES
 412  */
 413
 414 void ldlm_lock2handle(const struct ldlm_lock *lock, struct lustre_handle *lockh)
 415 {
 416         lockh->cookie = lock->l_handle.h_cookie;
 417 }
 418
 419 /* if flags: atomically get the lock and set the flags.
 420  *           Return NULL if flag already set
 421  */
 422
 423 struct ldlm_lock *__ldlm_handle2lock(const struct lustre_handle *handle,
 424                                      int flags)
 425 {
 426         struct ldlm_namespace *ns;
 427         struct ldlm_lock *lock, *retval = NULL;
 428         ENTRY;
 429
 430         LASSERT(handle);
 431
 432         lock = class_handle2object(handle->cookie);
 433         if (lock == NULL)
 434                 RETURN(NULL);
 435
 436         LASSERT(lock->l_resource != NULL);
 437         ns = lock->l_resource->lr_namespace;
 438         LASSERT(ns != NULL);
 439
 440         lock_res_and_lock(lock);
 441
 442         /* It's unlikely but possible that someone marked the lock as
 443          * destroyed after we did handle2object on it */
 444         if (lock->l_destroyed) {
 445                 unlock_res_and_lock(lock);
 446                 CDEBUG(D_INFO, "lock already destroyed: lock %p\n", lock);
 447                 LDLM_LOCK_PUT(lock);
 448                 GOTO(out, retval);
 449         }
 450
 451         if (flags && (lock->l_flags & flags)) {
 452                 unlock_res_and_lock(lock);
 453                 LDLM_LOCK_PUT(lock);
 454                 GOTO(out, retval);
 455         }
 456
 457         if (flags)
 458                 lock->l_flags |= flags;
 459
 460         unlock_res_and_lock(lock);
 461         retval = lock;
 462         EXIT;
 463  out:
 464         return retval;
 465 }
 466
 467 struct ldlm_lock *ldlm_handle2lock_ns(struct ldlm_namespace *ns,
 468                                       const struct lustre_handle *handle)
 469 {
 470         struct ldlm_lock *retval = NULL;
 471         retval = __ldlm_handle2lock(handle, 0);
 472         return retval;
 473 }
 474
 475 void ldlm_lock2desc(struct ldlm_lock *lock, struct ldlm_lock_desc *desc)
 476 {
 477         struct obd_export *exp = lock->l_export?:lock->l_conn_export;
 478         /* INODEBITS_INTEROP: If the other side does not support
 479          * inodebits, reply with a plain lock descriptor.
 480          */
 481         if ((lock->l_resource->lr_type == LDLM_IBITS) &&
 482             (exp && !(exp->exp_connect_flags & OBD_CONNECT_IBITS))) {
 483                 struct ldlm_resource res = *lock->l_resource;
 484
 485                 /* Make sure all the right bits are set in this lock we
 486                    are going to pass to client */
 487                 LASSERTF(lock->l_policy_data.l_inodebits.bits ==
 488                          (MDS_INODELOCK_LOOKUP|MDS_INODELOCK_UPDATE),
 489                          "Inappropriate inode lock bits during "
 490                          "conversion " LPU64 "\n",
 491                          lock->l_policy_data.l_inodebits.bits);
 492                 res.lr_type = LDLM_PLAIN;
 493                 ldlm_res2desc(&res, &desc->l_resource);
 494                 /* Convert "new" lock mode to something old client can
 495                    understand */
 496                 if ((lock->l_req_mode == LCK_CR) ||
 497                     (lock->l_req_mode == LCK_CW))
 498                         desc->l_req_mode = LCK_PR;
 499                 else
 500                         desc->l_req_mode = lock->l_req_mode;
 501                 if ((lock->l_granted_mode == LCK_CR) ||
 502                     (lock->l_granted_mode == LCK_CW)) {
 503                         desc->l_granted_mode = LCK_PR;
 504                 } else {
 505                         /* We never grant PW/EX locks to clients */
 506                         LASSERT((lock->l_granted_mode != LCK_PW) &&
 507                                 (lock->l_granted_mode != LCK_EX));
 508                         desc->l_granted_mode = lock->l_granted_mode;
 509                 }
 510
 511                 /* We do not copy policy here, because there is no
 512                    policy for plain locks */
 513         } else {
 514                 ldlm_res2desc(lock->l_resource, &desc->l_resource);
 515                 desc->l_req_mode = lock->l_req_mode;
 516                 desc->l_granted_mode = lock->l_granted_mode;
 517                 desc->l_policy_data = lock->l_policy_data;
 518         }
 519 }
 520
 521 void ldlm_add_bl_work_item(struct ldlm_lock *lock, struct ldlm_lock *new,
 522                            struct list_head *work_list)
 523 {
 524         if ((lock->l_flags & LDLM_FL_AST_SENT) == 0) {
 525                 LDLM_DEBUG(lock, "lock incompatible; sending blocking AST.");
 526                 lock->l_flags |= LDLM_FL_AST_SENT;
 527                 /* If the enqueuing client said so, tell the AST recipient to
 528                  * discard dirty data, rather than writing back. */
 529                 if (new->l_flags & LDLM_AST_DISCARD_DATA)
 530                         lock->l_flags |= LDLM_FL_DISCARD_DATA;
 531                 LASSERT(list_empty(&lock->l_bl_ast));
 532                 list_add(&lock->l_bl_ast, work_list);
 533                 LDLM_LOCK_GET(lock);
 534                 LASSERT(lock->l_blocking_lock == NULL);
 535                 lock->l_blocking_lock = LDLM_LOCK_GET(new);
 536         }
 537 }
 538
 539 void ldlm_add_cp_work_item(struct ldlm_lock *lock, struct list_head *work_list)
 540 {
 541         if ((lock->l_flags & LDLM_FL_CP_REQD) == 0) {
 542                 lock->l_flags |= LDLM_FL_CP_REQD;
 543                 LDLM_DEBUG(lock, "lock granted; sending completion AST.");
 544                 LASSERT(list_empty(&lock->l_cp_ast));
 545                 list_add(&lock->l_cp_ast, work_list);
 546                 LDLM_LOCK_GET(lock);
 547         }
 548 }
 549
 550 /* must be called with lr_lock held */
 551 void ldlm_add_ast_work_item(struct ldlm_lock *lock, struct ldlm_lock *new,
 552                                 struct list_head *work_list)
 553 {
 554         ENTRY;
 555         check_res_locked(lock->l_resource);
 556         if (new)
 557                 ldlm_add_bl_work_item(lock, new, work_list);
 558         else
 559                 ldlm_add_cp_work_item(lock, work_list);
 560         EXIT;
 561 }
 562
 563 void ldlm_lock_addref(struct lustre_handle *lockh, __u32 mode)
 564 {
 565         struct ldlm_lock *lock;
 566
 567         lock = ldlm_handle2lock(lockh);
 568         LASSERT(lock != NULL);
 569         ldlm_lock_addref_internal(lock, mode);
 570         LDLM_LOCK_PUT(lock);
 571 }
 572
 573 void ldlm_lock_addref_internal_nolock(struct ldlm_lock *lock, __u32 mode)
 574 {
 575         ldlm_lock_remove_from_lru(lock);
 576         if (mode & (LCK_NL | LCK_CR | LCK_PR))
 577                 lock->l_readers++;
 578         if (mode & (LCK_EX | LCK_CW | LCK_PW | LCK_GROUP))
 579                 lock->l_writers++;
 580         LDLM_LOCK_GET(lock);
 581         LDLM_DEBUG(lock, "ldlm_lock_addref(%s)", ldlm_lockname[mode]);
 582 }
 583
 584 /* only called for local locks */
 585 void ldlm_lock_addref_internal(struct ldlm_lock *lock, __u32 mode)
 586 {
 587         lock_res_and_lock(lock);
 588         ldlm_lock_addref_internal_nolock(lock, mode);
 589         unlock_res_and_lock(lock);
 590 }
 591
 592 void ldlm_lock_decref_internal(struct ldlm_lock *lock, __u32 mode)
 593 {
 594         struct ldlm_namespace *ns;
 595         ENTRY;
 596
 597         lock_res_and_lock(lock);
 598
 599         ns = lock->l_resource->lr_namespace;
 600
 601         LDLM_DEBUG(lock, "ldlm_lock_decref(%s)", ldlm_lockname[mode]);
 602         if (mode & (LCK_NL | LCK_CR | LCK_PR)) {
 603                 LASSERT(lock->l_readers > 0);
 604                 lock->l_readers--;
 605         }
 606         if (mode & (LCK_EX | LCK_CW | LCK_PW | LCK_GROUP)) {
 607                 LASSERT(lock->l_writers > 0);
 608                 lock->l_writers--;
 609         }
 610
 611         if (lock->l_flags & LDLM_FL_LOCAL &&
 612             !lock->l_readers && !lock->l_writers) {
 613                 /* If this is a local lock on a server namespace and this was
 614                  * the last reference, cancel the lock. */
 615                 CDEBUG(D_INFO, "forcing cancel of local lock\n");
 616                 lock->l_flags |= LDLM_FL_CBPENDING;
 617         }
 618
 619         if (!lock->l_readers && !lock->l_writers &&
 620             (lock->l_flags & LDLM_FL_CBPENDING)) {
 621                 /* If we received a blocked AST and this was the last reference,
 622                  * run the callback. */
 623                 if (ns_is_server(ns) && lock->l_export)
 624                         CERROR("FL_CBPENDING set on non-local lock--just a "
 625                                "warning\n");
 626
 627                 LDLM_DEBUG(lock, "final decref done on cbpending lock");
 628
 629                 LDLM_LOCK_GET(lock); /* dropped by bl thread */
 630                 ldlm_lock_remove_from_lru(lock);
 631                 unlock_res_and_lock(lock);
 632                 if ((lock->l_flags & LDLM_FL_ATOMIC_CB) ||
 633                     ldlm_bl_to_thread_lock(ns, NULL, lock) != 0)
 634                         ldlm_handle_bl_callback(ns, NULL, lock);
 635         } else if (ns_is_client(ns) &&
 636                    !lock->l_readers && !lock->l_writers &&
 637                    !(lock->l_flags & LDLM_FL_NO_LRU) &&
 638                    !(lock->l_flags & LDLM_FL_BL_AST)) {
 639                 /* If this is a client-side namespace and this was the last
 640                  * reference, put it on the LRU. */
 641                 ldlm_lock_add_to_lru(lock);
 642                 unlock_res_and_lock(lock);
 643                 /* Call ldlm_cancel_lru() only if EARLY_CANCEL and LRU RESIZE
 644                  * are not supported by the server, otherwise, it is done on
 645                  * enqueue. */
 646                 if (!exp_connect_cancelset(lock->l_conn_export) &&
 647                     !ns_connect_lru_resize(ns))
 648                         ldlm_cancel_lru(ns, 0, LDLM_ASYNC, 0);
 649         } else {
 650                 unlock_res_and_lock(lock);
 651         }
 652
 653         LDLM_LOCK_PUT(lock);    /* matches the ldlm_lock_get in addref */
 654
 655         EXIT;
 656 }
 657
 658 void ldlm_lock_decref(struct lustre_handle *lockh, __u32 mode)
 659 {
 660         struct ldlm_lock *lock = __ldlm_handle2lock(lockh, 0);
 661         LASSERTF(lock != NULL, "Non-existing lock: "LPX64"\n", lockh->cookie);
 662         ldlm_lock_decref_internal(lock, mode);
 663         LDLM_LOCK_PUT(lock);
 664 }
 665
 666 /* This will drop a lock reference and mark it for destruction, but will not
 667  * necessarily cancel the lock before returning. */
 668 void ldlm_lock_decref_and_cancel(struct lustre_handle *lockh, __u32 mode)
 669 {
 670         struct ldlm_lock *lock = __ldlm_handle2lock(lockh, 0);
 671         ENTRY;
 672
 673         LASSERT(lock != NULL);
 674
 675         LDLM_DEBUG(lock, "ldlm_lock_decref(%s)", ldlm_lockname[mode]);
 676         lock_res_and_lock(lock);
 677         lock->l_flags |= LDLM_FL_CBPENDING;
 678         unlock_res_and_lock(lock);
 679         ldlm_lock_decref_internal(lock, mode);
 680         LDLM_LOCK_PUT(lock);
 681 }
 682
 683 struct sl_insert_point {
 684         struct list_head *res_link;
 685         struct list_head *mode_link;
 686         struct list_head *policy_link;
 687 };
 688
 689 /*
 690  * search_granted_lock
 691  *
 692  * Description:
 693  *      Finds a position to insert the new lock.
 694  * Parameters:
 695  *      queue [input]:  the granted list where search acts on;
 696  *      req [input]:    the lock whose position to be located;
 697  *      prev [output]:  positions within 3 lists to insert @req to
 698  * Return Value:
 699  *      filled @prev
 700  * NOTE: called by
 701  *  - ldlm_grant_lock_with_skiplist
 702  */
 703 static void search_granted_lock(struct list_head *queue,
 704                                 struct ldlm_lock *req,
 705                                 struct sl_insert_point *prev)
 706 {
 707         struct list_head *tmp;
 708         struct ldlm_lock *lock, *mode_end, *policy_end;
 709         ENTRY;
 710
 711         list_for_each(tmp, queue) {
 712                 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
 713
 714                 mode_end = list_entry(lock->l_sl_mode.prev, struct ldlm_lock,
 715                                       l_sl_mode);
 716
 717                 if (lock->l_req_mode != req->l_req_mode) {
 718                         /* jump to last lock of mode group */
 719                         tmp = &mode_end->l_res_link;
 720                         continue;
 721                 }
 722
 723                 /* suitable mode group is found */
 724                 if (lock->l_resource->lr_type == LDLM_PLAIN) {
 725                         /* insert point is last lock of the mode group */
 726                         prev->res_link = &mode_end->l_res_link;
 727                         prev->mode_link = &mode_end->l_sl_mode;
 728                         prev->policy_link = &req->l_sl_policy;
 729                         EXIT;
 730                         return;
 731                 } else if (lock->l_resource->lr_type == LDLM_IBITS) {
 732                         for (;;) {
 733                                 policy_end = list_entry(lock->l_sl_policy.prev,
 734                                                         struct ldlm_lock,
 735                                                         l_sl_policy);
 736
 737                                 if (lock->l_policy_data.l_inodebits.bits ==
 738                                     req->l_policy_data.l_inodebits.bits) {
 739                                         /* insert point is last lock of
 740                                          * the policy group */
 741                                         prev->res_link =
 742                                                 &policy_end->l_res_link;
 743                                         prev->mode_link =
 744                                                 &policy_end->l_sl_mode;
 745                                         prev->policy_link =
 746                                                 &policy_end->l_sl_policy;
 747                                         EXIT;
 748                                         return;
 749                                 }
 750
 751                                 if (policy_end == mode_end)
 752                                         /* done with mode group */
 753                                         break;
 754
 755                                 /* jump to next policy group within the mode group */
 756                                 tmp = policy_end->l_res_link.next;
 757                                 lock = list_entry(tmp, struct ldlm_lock,
 758                                                   l_res_link);
 759                         }  /* loop over policy groups within the mode group */
 760
 761                         /* insert point is last lock of the mode group,
 762                          * new policy group is started */
 763                         prev->res_link = &mode_end->l_res_link;
 764                         prev->mode_link = &mode_end->l_sl_mode;
 765                         prev->policy_link = &req->l_sl_policy;
 766                         EXIT;
 767                         return;
 768                 } else {
 769                         LDLM_ERROR(lock, "is not LDLM_PLAIN or LDLM_IBITS lock");
 770                         LBUG();
 771                 }
 772         }
 773
 774         /* insert point is last lock on the queue,
 775          * new mode group and new policy group are started */
 776         prev->res_link = queue->prev;
 777         prev->mode_link = &req->l_sl_mode;
 778         prev->policy_link = &req->l_sl_policy;
 779         EXIT;
 780         return;
 781 }
 782
 783 static void ldlm_granted_list_add_lock(struct ldlm_lock *lock,
 784                                        struct sl_insert_point *prev)
 785 {
 786         struct ldlm_resource *res = lock->l_resource;
 787         ENTRY;
 788
 789         check_res_locked(res);
 790
 791         ldlm_resource_dump(D_OTHER, res);
 792         CDEBUG(D_OTHER, "About to add this lock:\n");
 793         ldlm_lock_dump(D_OTHER, lock, 0);
 794
 795         if (lock->l_destroyed) {
 796                 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
 797                 return;
 798         }
 799
 800         LASSERT(list_empty(&lock->l_res_link));
 801         LASSERT(list_empty(&lock->l_sl_mode));
 802         LASSERT(list_empty(&lock->l_sl_policy));
 803
 804         list_add(&lock->l_res_link, prev->res_link);
 805         list_add(&lock->l_sl_mode, prev->mode_link);
 806         list_add(&lock->l_sl_policy, prev->policy_link);
 807
 808         EXIT;
 809 }
 810
 811 static void ldlm_grant_lock_with_skiplist(struct ldlm_lock *lock)
 812 {
 813         struct sl_insert_point prev;
 814         ENTRY;
 815
 816         LASSERT(lock->l_req_mode == lock->l_granted_mode);
 817
 818         search_granted_lock(&lock->l_resource->lr_granted, lock, &prev);
 819         ldlm_granted_list_add_lock(lock, &prev);
 820         EXIT;
 821 }
 822
 823 /* NOTE: called by
 824  *  - ldlm_lock_enqueue
 825  *  - ldlm_reprocess_queue
 826  *  - ldlm_lock_convert
 827  *
 828  * must be called with lr_lock held
 829  */
 830 void ldlm_grant_lock(struct ldlm_lock *lock, struct list_head *work_list)
 831 {
 832         struct ldlm_resource *res = lock->l_resource;
 833         ENTRY;
 834
 835         check_res_locked(res);
 836
 837         lock->l_granted_mode = lock->l_req_mode;
 838         if (res->lr_type == LDLM_PLAIN || res->lr_type == LDLM_IBITS)
 839                 ldlm_grant_lock_with_skiplist(lock);
 840         else if (res->lr_type == LDLM_EXTENT)
 841                 ldlm_extent_add_lock(res, lock);
 842         else
 843                 ldlm_resource_add_lock(res, &res->lr_granted, lock);
 844
 845         if (lock->l_granted_mode < res->lr_most_restr)
 846                 res->lr_most_restr = lock->l_granted_mode;
 847
 848         if (work_list && lock->l_completion_ast != NULL)
 849                 ldlm_add_ast_work_item(lock, NULL, work_list);
 850
 851         ldlm_pool_add(&res->lr_namespace->ns_pool, lock);
 852         EXIT;
 853 }
 854
 855 /* returns a referenced lock or NULL.  See the flag descriptions below, in the
 856  * comment above ldlm_lock_match */
 857 static struct ldlm_lock *search_queue(struct list_head *queue,
 858                                       ldlm_mode_t *mode,
 859                                       ldlm_policy_data_t *policy,
 860                                       struct ldlm_lock *old_lock, int flags)
 861 {
 862         struct ldlm_lock *lock;
 863         struct list_head *tmp;
 864
 865         list_for_each(tmp, queue) {
 866                 ldlm_mode_t match;
 867
 868                 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
 869
 870                 if (lock == old_lock)
 871                         break;
 872
 873                 /* llite sometimes wants to match locks that will be
 874                  * canceled when their users drop, but we allow it to match
 875                  * if it passes in CBPENDING and the lock still has users.
 876                  * this is generally only going to be used by children
 877                  * whose parents already hold a lock so forward progress
 878                  * can still happen. */
 879                 if (lock->l_flags & LDLM_FL_CBPENDING &&
 880                     !(flags & LDLM_FL_CBPENDING))
 881                         continue;
 882                 if (lock->l_flags & LDLM_FL_CBPENDING &&
 883                     lock->l_readers == 0 && lock->l_writers == 0)
 884                         continue;
 885
 886                 if (!(lock->l_req_mode & *mode))
 887                         continue;
 888                 match = lock->l_req_mode;
 889
 890                 if (lock->l_resource->lr_type == LDLM_EXTENT &&
 891                     (lock->l_policy_data.l_extent.start >
 892                      policy->l_extent.start ||
 893                      lock->l_policy_data.l_extent.end < policy->l_extent.end))
 894                         continue;
 895
 896                 if (unlikely(match == LCK_GROUP) &&
 897                     lock->l_resource->lr_type == LDLM_EXTENT &&
 898                     lock->l_policy_data.l_extent.gid != policy->l_extent.gid)
 899                         continue;
 900
 901                 /* We match if we have existing lock with same or wider set
 902                    of bits. */
 903                 if (lock->l_resource->lr_type == LDLM_IBITS &&
 904                      ((lock->l_policy_data.l_inodebits.bits &
 905                       policy->l_inodebits.bits) !=
 906                       policy->l_inodebits.bits))
 907                         continue;
 908
 909                 if (lock->l_destroyed || (lock->l_flags & LDLM_FL_FAILED))
 910                         continue;
 911
 912                 if ((flags & LDLM_FL_LOCAL_ONLY) &&
 913                     !(lock->l_flags & LDLM_FL_LOCAL))
 914                         continue;
 915
 916                 if (flags & LDLM_FL_TEST_LOCK) {
 917                         LDLM_LOCK_GET(lock);
 918                         ldlm_lock_touch_in_lru(lock);
 919                 } else {
 920                         ldlm_lock_addref_internal_nolock(lock, match);
 921                 }
 922                 *mode = match;
 923                 return lock;
 924         }
 925
 926         return NULL;
 927 }
 928
 929 void ldlm_lock_allow_match(struct ldlm_lock *lock)
 930 {
 931         lock_res_and_lock(lock);
 932         lock->l_flags |= LDLM_FL_LVB_READY;
 933         cfs_waitq_signal(&lock->l_waitq);
 934         unlock_res_and_lock(lock);
 935 }
 936
 937 /**
 938  * Checks if requested extent lock is compatible with another owned lock.
 939  *
 940  * Checks if \a lock is compatible with a read or write lock
 941  * (specified by \a rw) for an extent [\a start , \a end].
 942  *
 943  * \param lock the already owned lock
 944  * \param rw OBD_BRW_READ if requested for reading,
 945  *           OBD_BRW_WRITE if requested for writing
 946  * \param start start of the requested extent
 947  * \param end end of the requested extent
 948  * \param cookie transparent parameter for passing locking context
 949  *
 950  * \post result == 1, *cookie == context, appropriate lock is referenced
 951  *
 952  * \retval 1 owned lock is reused for the request
 953  * \retval 0 no lock reused for the request
 954  *
 955  * \see ldlm_lock_fast_release
 956  */
 957 int ldlm_lock_fast_match(struct ldlm_lock *lock, int rw,
 958                          obd_off start, obd_off end,
 959                          void **cookie)
 960 {
 961         LASSERT(rw == OBD_BRW_READ || rw == OBD_BRW_WRITE);
 962         /* should LCK_GROUP be handled in a special way? */
 963         if (lock && (rw == OBD_BRW_READ ||
 964                      (lock->l_granted_mode & (LCK_PW | LCK_GROUP))) &&
 965             (lock->l_policy_data.l_extent.start <= start) &&
 966             (lock->l_policy_data.l_extent.end >= end)) {
 967                 ldlm_lock_addref_internal(lock, rw == OBD_BRW_WRITE ? LCK_PW : LCK_PR);
 968                 *cookie = (void *)lock;
 969                 return 1; /* avoid using rc for stack relief */
 970         }
 971         return 0;
 972 }
 973
 974 /**
 975  * Releases a reference to a lock taken in a "fast" way.
 976  *
 977  * Releases a read or write (specified by \a rw) lock
 978  * referenced by \a cookie.
 979  *
 980  * \param rw OBD_BRW_READ if requested for reading,
 981  *           OBD_BRW_WRITE if requested for writing
 982  * \param cookie transparent parameter for passing locking context
 983  *
 984  * \post appropriate lock is dereferenced
 985  *
 986  * \see ldlm_lock_fast_lock
 987  */
 988 void ldlm_lock_fast_release(void *cookie, int rw)
 989 {
 990         struct ldlm_lock *lock = (struct ldlm_lock *)cookie;
 991
 992         LASSERT(lock != NULL);
 993         LASSERT(rw == OBD_BRW_READ || rw == OBD_BRW_WRITE);
 994         LASSERT(rw == OBD_BRW_READ ||
 995                 (lock->l_granted_mode & (LCK_PW | LCK_GROUP)));
 996         ldlm_lock_decref_internal(lock, rw == OBD_BRW_WRITE ? LCK_PW : LCK_PR);
 997 }
 998
 999 /* Can be called in two ways:
1000  *
1001  * If 'ns' is NULL, then lockh describes an existing lock that we want to look
1002  * for a duplicate of.
1003  *
1004  * Otherwise, all of the fields must be filled in, to match against.
1005  *
1006  * If 'flags' contains LDLM_FL_LOCAL_ONLY, then only match local locks on the
1007  *     server (ie, connh is NULL)
1008  * If 'flags' contains LDLM_FL_BLOCK_GRANTED, then only locks on the granted
1009  *     list will be considered
1010  * If 'flags' contains LDLM_FL_CBPENDING, then locks that have been marked
1011  *     to be canceled can still be matched as long as they still have reader
1012  *     or writer refernces
1013  * If 'flags' contains LDLM_FL_TEST_LOCK, then don't actually reference a lock,
1014  *     just tell us if we would have matched.
1015  *
1016  * Returns 1 if it finds an already-existing lock that is compatible; in this
1017  * case, lockh is filled in with a addref()ed lock
1018  *
1019  * we also check security context, if that failed we simply return 0 (to keep
1020  * caller code unchanged), the context failure will be discovered by caller
1021  * sometime later.
1022  */
1023 ldlm_mode_t ldlm_lock_match(struct ldlm_namespace *ns, int flags,
1024                             const struct ldlm_res_id *res_id, ldlm_type_t type,
1025                             ldlm_policy_data_t *policy, ldlm_mode_t mode,
1026                             struct lustre_handle *lockh)
1027 {
1028         struct ldlm_resource *res;
1029         struct ldlm_lock *lock, *old_lock = NULL;
1030         int rc = 0;
1031         ENTRY;
1032
1033         if (ns == NULL) {
1034                 old_lock = ldlm_handle2lock(lockh);
1035                 LASSERT(old_lock);
1036
1037                 ns = old_lock->l_resource->lr_namespace;
1038                 res_id = &old_lock->l_resource->lr_name;
1039                 type = old_lock->l_resource->lr_type;
1040                 mode = old_lock->l_req_mode;
1041         }
1042
1043         res = ldlm_resource_get(ns, NULL, res_id, type, 0);
1044         if (res == NULL) {
1045                 LASSERT(old_lock == NULL);
1046                 RETURN(0);
1047         }
1048
1049         lock_res(res);
1050
1051         lock = search_queue(&res->lr_granted, &mode, policy, old_lock, flags);
1052         if (lock != NULL)
1053                 GOTO(out, rc = 1);
1054         if (flags & LDLM_FL_BLOCK_GRANTED)
1055                 GOTO(out, rc = 0);
1056         lock = search_queue(&res->lr_converting, &mode, policy, old_lock, flags);
1057         if (lock != NULL)
1058                 GOTO(out, rc = 1);
1059         lock = search_queue(&res->lr_waiting, &mode, policy, old_lock, flags);
1060         if (lock != NULL)
1061                 GOTO(out, rc = 1);
1062
1063         EXIT;
1064  out:
1065         unlock_res(res);
1066         ldlm_resource_putref(res);
1067
1068         if (lock) {
1069                 ldlm_lock2handle(lock, lockh);
1070                 if ((flags & LDLM_FL_LVB_READY) &&
1071                     (!(lock->l_flags & LDLM_FL_LVB_READY))) {
1072                         struct l_wait_info lwi;
1073                         if (lock->l_completion_ast) {
1074                                 int err = lock->l_completion_ast(lock,
1075                                                           LDLM_FL_WAIT_NOREPROC,
1076                                                                  NULL);
1077                                 if (err) {
1078                                         if (flags & LDLM_FL_TEST_LOCK)
1079                                                 LDLM_LOCK_PUT(lock);
1080                                         else
1081                                                 ldlm_lock_decref_internal(lock, mode);
1082                                         rc = 0;
1083                                         goto out2;
1084                                 }
1085                         }
1086
1087                         lwi = LWI_TIMEOUT_INTR(cfs_time_seconds(obd_timeout), NULL,
1088                                                LWI_ON_SIGNAL_NOOP, NULL);
1089
1090                         /* XXX FIXME see comment on CAN_MATCH in lustre_dlm.h */
1091                         l_wait_event(lock->l_waitq,
1092                                      (lock->l_flags & LDLM_FL_LVB_READY), &lwi);
1093                 }
1094         }
1095  out2:
1096         if (rc) {
1097                 LDLM_DEBUG(lock, "matched ("LPU64" "LPU64")",
1098                            (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1099                                 res_id->name[2] : policy->l_extent.start,
1100                            (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1101                                 res_id->name[3] : policy->l_extent.end);
1102
1103                 /* check user's security context */
1104                 if (lock->l_conn_export &&
1105                     sptlrpc_import_check_ctx(
1106                                 class_exp2cliimp(lock->l_conn_export))) {
1107                         if (!(flags & LDLM_FL_TEST_LOCK))
1108                                 ldlm_lock_decref_internal(lock, mode);
1109                         rc = 0;
1110                 }
1111
1112                 if (flags & LDLM_FL_TEST_LOCK)
1113                         LDLM_LOCK_PUT(lock);
1114
1115         } else if (!(flags & LDLM_FL_TEST_LOCK)) {/*less verbose for test-only*/
1116                 LDLM_DEBUG_NOLOCK("not matched ns %p type %u mode %u res "
1117                                   LPU64"/"LPU64" ("LPU64" "LPU64")", ns,
1118                                   type, mode, res_id->name[0], res_id->name[1],
1119                                   (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1120                                         res_id->name[2] :policy->l_extent.start,
1121                                 (type == LDLM_PLAIN || type == LDLM_IBITS) ?
1122                                         res_id->name[3] : policy->l_extent.end);
1123         }
1124         if (old_lock)
1125                 LDLM_LOCK_PUT(old_lock);
1126
1127         return rc ? mode : 0;
1128 }
1129
1130 /* Returns a referenced lock */
1131 struct ldlm_lock *ldlm_lock_create(struct ldlm_namespace *ns,
1132                                    const struct ldlm_res_id *res_id,
1133                                    ldlm_type_t type,
1134                                    ldlm_mode_t mode,
1135                                    ldlm_blocking_callback blocking,
1136                                    ldlm_completion_callback completion,
1137                                    ldlm_glimpse_callback glimpse,
1138                                    void *data, __u32 lvb_len)
1139 {
1140         struct ldlm_lock *lock;
1141         struct ldlm_resource *res;
1142         ENTRY;
1143
1144         res = ldlm_resource_get(ns, NULL, res_id, type, 1);
1145         if (res == NULL)
1146                 RETURN(NULL);
1147
1148         lock = ldlm_lock_new(res);
1149         ldlm_resource_putref(res);
1150
1151         if (lock == NULL)
1152                 RETURN(NULL);
1153
1154         lock->l_req_mode = mode;
1155         lock->l_ast_data = data;
1156         lock->l_blocking_ast = blocking;
1157         lock->l_completion_ast = completion;
1158         lock->l_glimpse_ast = glimpse;
1159         lock->l_pid = cfs_curproc_pid();
1160
1161         lock->l_tree_node = NULL;
1162         /* if this is the extent lock, allocate the interval tree node */
1163         if (type == LDLM_EXTENT) {
1164                 if (ldlm_interval_alloc(lock) == NULL)
1165                         GOTO(out, 0);
1166         }
1167
1168         if (lvb_len) {
1169                 lock->l_lvb_len = lvb_len;
1170                 OBD_ALLOC(lock->l_lvb_data, lvb_len);
1171                 if (lock->l_lvb_data == NULL)
1172                         GOTO(out, 0);
1173         }
1174
1175         RETURN(lock);
1176
1177 out:
1178         if (lock->l_lvb_data)
1179                 OBD_FREE(lock->l_lvb_data, lvb_len);
1180         ldlm_interval_free(ldlm_interval_detach(lock));
1181         OBD_SLAB_FREE(lock, ldlm_lock_slab, sizeof(*lock));
1182         return NULL;
1183 }
1184
1185 ldlm_error_t ldlm_lock_enqueue(struct ldlm_namespace *ns,
1186                                struct ldlm_lock **lockp,
1187                                void *cookie, int *flags)
1188 {
1189         struct ldlm_lock *lock = *lockp;
1190         struct ldlm_resource *res = lock->l_resource;
1191         int local = ns_is_client(res->lr_namespace);
1192         ldlm_processing_policy policy;
1193         ldlm_error_t rc = ELDLM_OK;
1194         struct ldlm_interval *node = NULL;
1195         ENTRY;
1196
1197         do_gettimeofday(&lock->l_enqueued_time);
1198         /* policies are not executed on the client or during replay */
1199         if ((*flags & (LDLM_FL_HAS_INTENT|LDLM_FL_REPLAY)) == LDLM_FL_HAS_INTENT
1200             && !local && ns->ns_policy) {
1201                 rc = ns->ns_policy(ns, lockp, cookie, lock->l_req_mode, *flags,
1202                                    NULL);
1203                 if (rc == ELDLM_LOCK_REPLACED) {
1204                         /* The lock that was returned has already been granted,
1205                          * and placed into lockp.  If it's not the same as the
1206                          * one we passed in, then destroy the old one and our
1207                          * work here is done. */
1208                         if (lock != *lockp) {
1209                                 ldlm_lock_destroy(lock);
1210                                 LDLM_LOCK_PUT(lock);
1211                         }
1212                         *flags |= LDLM_FL_LOCK_CHANGED;
1213                         RETURN(0);
1214                 } else if (rc != ELDLM_OK ||
1215                            (rc == ELDLM_OK && (*flags & LDLM_FL_INTENT_ONLY))) {
1216                         ldlm_lock_destroy(lock);
1217                         RETURN(rc);
1218                 }
1219         }
1220
1221         /* For a replaying lock, it might be already in granted list. So
1222          * unlinking the lock will cause the interval node to be freed, we
1223          * have to allocate the interval node early otherwise we can't regrant
1224          * this lock in the future. - jay */
1225         if (!local && (*flags & LDLM_FL_REPLAY) && res->lr_type == LDLM_EXTENT)
1226                 OBD_SLAB_ALLOC(node, ldlm_interval_slab, CFS_ALLOC_IO,
1227                                sizeof(*node));
1228
1229         lock_res_and_lock(lock);
1230         if (local && lock->l_req_mode == lock->l_granted_mode) {
1231                 /* The server returned a blocked lock, but it was granted
1232                  * before we got a chance to actually enqueue it.  We don't
1233                  * need to do anything else. */
1234                 *flags &= ~(LDLM_FL_BLOCK_GRANTED |
1235                             LDLM_FL_BLOCK_CONV | LDLM_FL_BLOCK_WAIT);
1236                 GOTO(out, ELDLM_OK);
1237         }
1238
1239         ldlm_resource_unlink_lock(lock);
1240         if (res->lr_type == LDLM_EXTENT && lock->l_tree_node == NULL) {
1241                 if (node == NULL) {
1242                         ldlm_lock_destroy_nolock(lock);
1243                         GOTO(out, rc = -ENOMEM);
1244                 }
1245
1246                 CFS_INIT_LIST_HEAD(&node->li_group);
1247                 ldlm_interval_attach(node, lock);
1248                 node = NULL;
1249         }
1250
1251         /* Some flags from the enqueue want to make it into the AST, via the
1252          * lock's l_flags. */
1253         lock->l_flags |= *flags & LDLM_AST_DISCARD_DATA;
1254
1255         /* This distinction between local lock trees is very important; a client
1256          * namespace only has information about locks taken by that client, and
1257          * thus doesn't have enough information to decide for itself if it can
1258          * be granted (below).  In this case, we do exactly what the server
1259          * tells us to do, as dictated by the 'flags'.
1260          *
1261          * We do exactly the same thing during recovery, when the server is
1262          * more or less trusting the clients not to lie.
1263          *
1264          * FIXME (bug 268): Detect obvious lies by checking compatibility in
1265          * granted/converting queues. */
1266         if (local) {
1267                 if (*flags & LDLM_FL_BLOCK_CONV)
1268                         ldlm_resource_add_lock(res, &res->lr_converting, lock);
1269                 else if (*flags & (LDLM_FL_BLOCK_WAIT | LDLM_FL_BLOCK_GRANTED))
1270                         ldlm_resource_add_lock(res, &res->lr_waiting, lock);
1271                 else
1272                         ldlm_grant_lock(lock, NULL);
1273                 GOTO(out, ELDLM_OK);
1274         } else if (*flags & LDLM_FL_REPLAY) {
1275                 if (*flags & LDLM_FL_BLOCK_CONV) {
1276                         ldlm_resource_add_lock(res, &res->lr_converting, lock);
1277                         GOTO(out, ELDLM_OK);
1278                 } else if (*flags & LDLM_FL_BLOCK_WAIT) {
1279                         ldlm_resource_add_lock(res, &res->lr_waiting, lock);
1280                         GOTO(out, ELDLM_OK);
1281                 } else if (*flags & LDLM_FL_BLOCK_GRANTED) {
1282                         ldlm_grant_lock(lock, NULL);
1283                         GOTO(out, ELDLM_OK);
1284                 }
1285                 /* If no flags, fall through to normal enqueue path. */
1286         }
1287
1288         policy = ldlm_processing_policy_table[res->lr_type];
1289         policy(lock, flags, 1, &rc, NULL);
1290         GOTO(out, rc);
1291 out:
1292         unlock_res_and_lock(lock);
1293         if (node)
1294                 OBD_SLAB_FREE(node, ldlm_interval_slab, sizeof(*node));
1295         return rc;
1296 }
1297
1298 /* Must be called with namespace taken: queue is waiting or converting. */
1299 int ldlm_reprocess_queue(struct ldlm_resource *res, struct list_head *queue,
1300                          struct list_head *work_list)
1301 {
1302         struct list_head *tmp, *pos;
1303         ldlm_processing_policy policy;
1304         int flags;
1305         int rc = LDLM_ITER_CONTINUE;
1306         ldlm_error_t err;
1307         ENTRY;
1308
1309         check_res_locked(res);
1310
1311         policy = ldlm_processing_policy_table[res->lr_type];
1312         LASSERT(policy);
1313
1314         list_for_each_safe(tmp, pos, queue) {
1315                 struct ldlm_lock *pending;
1316                 pending = list_entry(tmp, struct ldlm_lock, l_res_link);
1317
1318                 CDEBUG(D_INFO, "Reprocessing lock %p\n", pending);
1319
1320                 flags = 0;
1321                 rc = policy(pending, &flags, 0, &err, work_list);
1322                 if (rc != LDLM_ITER_CONTINUE)
1323                         break;
1324         }
1325
1326         RETURN(rc);
1327 }
1328
1329 /* Helper function for ldlm_run_ast_work().
1330  *
1331  * Send an existing rpc set specified by @arg->set and then
1332  * destroy it. Create new one if @do_create flag is set. */
1333 static void
1334 ldlm_send_and_maybe_create_set(struct ldlm_cb_set_arg *arg, int do_create)
1335 {
1336         ENTRY;
1337
1338         ptlrpc_set_wait(arg->set);
1339         if (arg->type == LDLM_BL_CALLBACK)
1340                 OBD_FAIL_TIMEOUT(OBD_FAIL_LDLM_GLIMPSE, 2);
1341         ptlrpc_set_destroy(arg->set);
1342
1343         if (do_create)
1344                 arg->set = ptlrpc_prep_set();
1345
1346         EXIT;
1347 }
1348
1349 static int
1350 ldlm_work_bl_ast_lock(struct list_head *tmp, struct ldlm_cb_set_arg *arg)
1351 {
1352         struct ldlm_lock_desc d;
1353         struct ldlm_lock *lock = list_entry(tmp, struct ldlm_lock, l_bl_ast);
1354         ENTRY;
1355
1356         /* nobody should touch l_bl_ast */
1357         lock_res_and_lock(lock);
1358         list_del_init(&lock->l_bl_ast);
1359
1360         LASSERT(lock->l_flags & LDLM_FL_AST_SENT);
1361         LASSERT(lock->l_bl_ast_run == 0);
1362         LASSERT(lock->l_blocking_lock);
1363         lock->l_bl_ast_run++;
1364         unlock_res_and_lock(lock);
1365
1366         ldlm_lock2desc(lock->l_blocking_lock, &d);
1367
1368         LDLM_LOCK_PUT(lock->l_blocking_lock);
1369         lock->l_blocking_lock = NULL;
1370         lock->l_blocking_ast(lock, &d, (void *)arg,
1371                              LDLM_CB_BLOCKING);
1372         LDLM_LOCK_PUT(lock);
1373
1374         RETURN(1);
1375 }
1376
1377 static int
1378 ldlm_work_cp_ast_lock(struct list_head *tmp, struct ldlm_cb_set_arg *arg)
1379 {
1380         struct ldlm_lock *lock = list_entry(tmp, struct ldlm_lock, l_cp_ast);
1381         ldlm_completion_callback completion_callback;
1382         int rc = 0;
1383         ENTRY;
1384
1385         /* It's possible to receive a completion AST before we've set
1386          * the l_completion_ast pointer: either because the AST arrived
1387          * before the reply, or simply because there's a small race
1388          * window between receiving the reply and finishing the local
1389          * enqueue. (bug 842)
1390          *
1391          * This can't happen with the blocking_ast, however, because we
1392          * will never call the local blocking_ast until we drop our
1393          * reader/writer reference, which we won't do until we get the
1394          * reply and finish enqueueing. */
1395
1396         /* nobody should touch l_cp_ast */
1397         lock_res_and_lock(lock);
1398         list_del_init(&lock->l_cp_ast);
1399         LASSERT(lock->l_flags & LDLM_FL_CP_REQD);
1400         /* save l_completion_ast since it can be changed by
1401          * mds_intent_policy(), see bug 14225 */
1402         completion_callback = lock->l_completion_ast;
1403         lock->l_flags &= ~LDLM_FL_CP_REQD;
1404         unlock_res_and_lock(lock);
1405
1406         if (completion_callback != NULL) {
1407                 completion_callback(lock, 0, (void *)arg);
1408                 rc = 1;
1409         }
1410         LDLM_LOCK_PUT(lock);
1411
1412         RETURN(rc);
1413 }
1414
1415 static int
1416 ldlm_work_revoke_ast_lock(struct list_head *tmp, struct ldlm_cb_set_arg *arg)
1417 {
1418         struct ldlm_lock_desc desc;
1419         struct ldlm_lock *lock = list_entry(tmp, struct ldlm_lock, l_export_chain);
1420         ENTRY;
1421
1422         list_del_init(&lock->l_export_chain);
1423
1424         /* the desc just pretend to exclusive */
1425         ldlm_lock2desc(lock, &desc);
1426         desc.l_req_mode = LCK_EX;
1427         desc.l_granted_mode = 0;
1428
1429         lock->l_blocking_ast(lock, &desc, (void*)arg, LDLM_CB_BLOCKING);
1430         LDLM_LOCK_PUT(lock);
1431
1432         RETURN(1);
1433 }
1434
1435 int ldlm_run_ast_work(struct list_head *rpc_list, ldlm_desc_ast_t ast_type)
1436 {
1437         struct ldlm_cb_set_arg arg;
1438         struct list_head *tmp, *pos;
1439         int (*work_ast_lock)(struct list_head *tmp, struct ldlm_cb_set_arg *arg);
1440         int ast_count;
1441         ENTRY;
1442
1443         arg.set = ptlrpc_prep_set();
1444         atomic_set(&arg.restart, 0);
1445         switch (ast_type) {
1446         case LDLM_WORK_BL_AST:
1447                 arg.type = LDLM_BL_CALLBACK;
1448                 work_ast_lock = ldlm_work_bl_ast_lock;
1449                 break;
1450         case LDLM_WORK_CP_AST:
1451                 arg.type = LDLM_CP_CALLBACK;
1452                 work_ast_lock = ldlm_work_cp_ast_lock;
1453                 break;
1454         case LDLM_WORK_REVOKE_AST:
1455                 arg.type = LDLM_BL_CALLBACK;
1456                 work_ast_lock = ldlm_work_revoke_ast_lock;
1457                 break;
1458         default:
1459                 LBUG();
1460         }
1461
1462         ast_count = 0;
1463         list_for_each_safe(tmp, pos, rpc_list) {
1464                 ast_count += work_ast_lock(tmp, &arg);
1465
1466                 /* Send the request set if it exceeds the PARALLEL_AST_LIMIT,
1467                  * and create a new set for requests that remained in
1468                  * @rpc_list */
1469                 if (unlikely(ast_count == PARALLEL_AST_LIMIT)) {
1470                         ldlm_send_and_maybe_create_set(&arg, 1);
1471                         ast_count = 0;
1472                 }
1473         }
1474
1475         if (ast_count > 0)
1476                 ldlm_send_and_maybe_create_set(&arg, 0);
1477         else
1478                 /* In case when number of ASTs is multiply of
1479                  * PARALLEL_AST_LIMIT or @rpc_list was initially empty,
1480                  * @arg.set must be destroyed here, otherwise we get
1481                  * write memory leaking. */
1482                 ptlrpc_set_destroy(arg.set);
1483
1484         RETURN(atomic_read(&arg.restart) ? -ERESTART : 0);
1485 }
1486
1487 static int reprocess_one_queue(struct ldlm_resource *res, void *closure)
1488 {
1489         ldlm_reprocess_all(res);
1490         return LDLM_ITER_CONTINUE;
1491 }
1492
1493 void ldlm_reprocess_all_ns(struct ldlm_namespace *ns)
1494 {
1495         struct list_head *tmp;
1496         int i, rc;
1497
1498         if (ns == NULL)
1499                 return;
1500
1501         ENTRY;
1502         spin_lock(&ns->ns_hash_lock);
1503         for (i = 0; i < RES_HASH_SIZE; i++) {
1504                 tmp = ns->ns_hash[i].next;
1505                 while (tmp != &(ns->ns_hash[i])) {
1506                         struct ldlm_resource *res =
1507                                 list_entry(tmp, struct ldlm_resource, lr_hash);
1508
1509                         ldlm_resource_getref(res);
1510                         spin_unlock(&ns->ns_hash_lock);
1511
1512                         rc = reprocess_one_queue(res, NULL);
1513
1514                         spin_lock(&ns->ns_hash_lock);
1515                         tmp = tmp->next;
1516                         ldlm_resource_putref_locked(res);
1517
1518                         if (rc == LDLM_ITER_STOP)
1519                                 GOTO(out, rc);
1520                 }
1521         }
1522  out:
1523         spin_unlock(&ns->ns_hash_lock);
1524         EXIT;
1525 }
1526
1527 void ldlm_reprocess_all(struct ldlm_resource *res)
1528 {
1529         CFS_LIST_HEAD(rpc_list);
1530         int rc;
1531         ENTRY;
1532
1533         /* Local lock trees don't get reprocessed. */
1534         if (ns_is_client(res->lr_namespace)) {
1535                 EXIT;
1536                 return;
1537         }
1538
1539  restart:
1540         lock_res(res);
1541         rc = ldlm_reprocess_queue(res, &res->lr_converting, &rpc_list);
1542         if (rc == LDLM_ITER_CONTINUE)
1543                 ldlm_reprocess_queue(res, &res->lr_waiting, &rpc_list);
1544         unlock_res(res);
1545
1546         rc = ldlm_run_ast_work(&rpc_list, LDLM_WORK_CP_AST);
1547         if (rc == -ERESTART) {
1548                 LASSERT(list_empty(&rpc_list));
1549                 goto restart;
1550         }
1551         EXIT;
1552 }
1553
1554 void ldlm_cancel_callback(struct ldlm_lock *lock)
1555 {
1556         check_res_locked(lock->l_resource);
1557         if (!(lock->l_flags & LDLM_FL_CANCEL)) {
1558                 lock->l_flags |= LDLM_FL_CANCEL;
1559                 if (lock->l_blocking_ast) {
1560                         // l_check_no_ns_lock(ns);
1561                         unlock_res_and_lock(lock);
1562                         lock->l_blocking_ast(lock, NULL, lock->l_ast_data,
1563                                              LDLM_CB_CANCELING);
1564                         lock_res_and_lock(lock);
1565                 } else {
1566                         LDLM_DEBUG(lock, "no blocking ast");
1567                 }
1568         }
1569         lock->l_flags |= LDLM_FL_BL_DONE;
1570 }
1571
1572 void ldlm_unlink_lock_skiplist(struct ldlm_lock *req)
1573 {
1574         if (req->l_resource->lr_type != LDLM_PLAIN &&
1575             req->l_resource->lr_type != LDLM_IBITS)
1576                 return;
1577
1578         list_del_init(&req->l_sl_policy);
1579         list_del_init(&req->l_sl_mode);
1580 }
1581
1582 void ldlm_lock_cancel(struct ldlm_lock *lock)
1583 {
1584         struct ldlm_resource *res;
1585         struct ldlm_namespace *ns;
1586         ENTRY;
1587
1588         lock_res_and_lock(lock);
1589
1590         res = lock->l_resource;
1591         ns = res->lr_namespace;
1592
1593         /* Please do not, no matter how tempting, remove this LBUG without
1594          * talking to me first. -phik */
1595         if (lock->l_readers || lock->l_writers) {
1596                 LDLM_ERROR(lock, "lock still has references");
1597                 LBUG();
1598         }
1599
1600         ldlm_del_waiting_lock(lock);
1601
1602         /* Releases cancel callback. */
1603         ldlm_cancel_callback(lock);
1604
1605         /* Yes, second time, just in case it was added again while we were
1606            running with no res lock in ldlm_cancel_callback */
1607         ldlm_del_waiting_lock(lock);
1608         ldlm_resource_unlink_lock(lock);
1609         ldlm_lock_destroy_nolock(lock);
1610
1611         if (lock->l_granted_mode == lock->l_req_mode)
1612                 ldlm_pool_del(&ns->ns_pool, lock);
1613
1614         /* Make sure we will not be called again for same lock what is possible
1615          * if not to zero out lock->l_granted_mode */
1616         lock->l_granted_mode = 0;
1617         unlock_res_and_lock(lock);
1618
1619         EXIT;
1620 }
1621
1622 int ldlm_lock_set_data(struct lustre_handle *lockh, void *data)
1623 {
1624         struct ldlm_lock *lock = ldlm_handle2lock(lockh);
1625         ENTRY;
1626
1627         if (lock == NULL)
1628                 RETURN(-EINVAL);
1629
1630         lock->l_ast_data = data;
1631         LDLM_LOCK_PUT(lock);
1632         RETURN(0);
1633 }
1634
1635 void ldlm_cancel_locks_for_export(struct obd_export *exp)
1636 {
1637         struct ldlm_lock *lock;
1638         struct ldlm_resource *res;
1639
1640         spin_lock(&exp->exp_ldlm_data.led_lock);
1641         while(!list_empty(&exp->exp_ldlm_data.led_held_locks)) {
1642                 lock = list_entry(exp->exp_ldlm_data.led_held_locks.next,
1643                                   struct ldlm_lock, l_export_chain);
1644                 res = ldlm_resource_getref(lock->l_resource);
1645                 LDLM_LOCK_GET(lock);
1646                 spin_unlock(&exp->exp_ldlm_data.led_lock);
1647
1648                 LDLM_DEBUG(lock, "export %p", exp);
1649                 ldlm_res_lvbo_update(res, NULL, 0, 1);
1650
1651                 ldlm_lock_cancel(lock);
1652                 ldlm_reprocess_all(res);
1653
1654                 ldlm_resource_putref(res);
1655                 LDLM_LOCK_PUT(lock);
1656                 spin_lock(&exp->exp_ldlm_data.led_lock);
1657         }
1658         spin_unlock(&exp->exp_ldlm_data.led_lock);
1659 }
1660
1661 struct ldlm_resource *ldlm_lock_convert(struct ldlm_lock *lock, int new_mode,
1662                                         __u32 *flags)
1663 {
1664         CFS_LIST_HEAD(rpc_list);
1665         struct ldlm_resource *res;
1666         struct ldlm_namespace *ns;
1667         int granted = 0;
1668         int old_mode, rc;
1669         struct sl_insert_point prev;
1670         ldlm_error_t err;
1671         struct ldlm_interval *node;
1672         ENTRY;
1673
1674         if (new_mode == lock->l_granted_mode) { // No changes? Just return.
1675                 *flags |= LDLM_FL_BLOCK_GRANTED;
1676                 RETURN(lock->l_resource);
1677         }
1678
1679         /* I can't check the type of lock here because the bitlock of lock
1680          * is not held here, so do the allocation blindly. -jay */
1681         OBD_SLAB_ALLOC(node, ldlm_interval_slab, CFS_ALLOC_IO, sizeof(*node));
1682         if (node == NULL)  /* Actually, this causes EDEADLOCK to be returned */
1683                 RETURN(NULL);
1684
1685         LASSERTF(new_mode == LCK_PW && lock->l_granted_mode == LCK_PR,
1686                  "new_mode %u, granted %u\n", new_mode, lock->l_granted_mode);
1687
1688         lock_res_and_lock(lock);
1689
1690         res = lock->l_resource;
1691         ns = res->lr_namespace;
1692
1693         old_mode = lock->l_req_mode;
1694         lock->l_req_mode = new_mode;
1695         if (res->lr_type == LDLM_PLAIN || res->lr_type == LDLM_IBITS) {
1696                 /* remember the lock position where the lock might be
1697                  * added back to the granted list later and also
1698                  * remember the join mode for skiplist fixing. */
1699                 prev.res_link = lock->l_res_link.prev;
1700                 prev.mode_link = lock->l_sl_mode.prev;
1701                 prev.policy_link = lock->l_sl_policy.prev;
1702                 ldlm_resource_unlink_lock(lock);
1703         } else {
1704                 ldlm_resource_unlink_lock(lock);
1705                 if (res->lr_type == LDLM_EXTENT) {
1706                         /* FIXME: ugly code, I have to attach the lock to a
1707                          * interval node again since perhaps it will be granted
1708                          * soon */
1709                         CFS_INIT_LIST_HEAD(&node->li_group);
1710                         ldlm_interval_attach(node, lock);
1711                         node = NULL;
1712                 }
1713         }
1714
1715         /* If this is a local resource, put it on the appropriate list. */
1716         if (ns_is_client(res->lr_namespace)) {
1717                 if (*flags & (LDLM_FL_BLOCK_CONV | LDLM_FL_BLOCK_GRANTED)) {
1718                         ldlm_resource_add_lock(res, &res->lr_converting, lock);
1719                 } else {
1720                         /* This should never happen, because of the way the
1721                          * server handles conversions. */
1722                         LDLM_ERROR(lock, "Erroneous flags %d on local lock\n",
1723                                    *flags);
1724                         LBUG();
1725
1726                         ldlm_grant_lock(lock, &rpc_list);
1727                         granted = 1;
1728                         /* FIXME: completion handling not with ns_lock held ! */
1729                         if (lock->l_completion_ast)
1730                                 lock->l_completion_ast(lock, 0, NULL);
1731                 }
1732         } else {
1733                 int pflags = 0;
1734                 ldlm_processing_policy policy;
1735                 policy = ldlm_processing_policy_table[res->lr_type];
1736                 rc = policy(lock, &pflags, 0, &err, &rpc_list);
1737                 if (rc == LDLM_ITER_STOP) {
1738                         lock->l_req_mode = old_mode;
1739                         if (res->lr_type == LDLM_EXTENT)
1740                                 ldlm_extent_add_lock(res, lock);
1741                         else
1742                                 ldlm_granted_list_add_lock(lock, &prev);
1743
1744                         res = NULL;
1745                 } else {
1746                         *flags |= LDLM_FL_BLOCK_GRANTED;
1747                         granted = 1;
1748                 }
1749         }
1750         unlock_res_and_lock(lock);
1751
1752         if (granted)
1753                 ldlm_run_ast_work(&rpc_list, LDLM_WORK_CP_AST);
1754         if (node)
1755                 OBD_SLAB_FREE(node, ldlm_interval_slab, sizeof(*node));
1756         RETURN(res);
1757 }
1758
1759 void ldlm_lock_dump(int level, struct ldlm_lock *lock, int pos)
1760 {
1761         struct obd_device *obd = NULL;
1762
1763         if (!((libcfs_debug | D_ERROR) & level))
1764                 return;
1765
1766         if (!lock) {
1767                 CDEBUG(level, "  NULL LDLM lock\n");
1768                 return;
1769         }
1770
1771         CDEBUG(level," -- Lock dump: %p/"LPX64" (rc: %d) (pos: %d) (pid: %d)\n",
1772                lock, lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
1773                pos, lock->l_pid);
1774         if (lock->l_conn_export != NULL)
1775                 obd = lock->l_conn_export->exp_obd;
1776         if (lock->l_export && lock->l_export->exp_connection) {
1777                 CDEBUG(level, "  Node: NID %s (rhandle: "LPX64")\n",
1778                      libcfs_nid2str(lock->l_export->exp_connection->c_peer.nid),
1779                      lock->l_remote_handle.cookie);
1780         } else if (obd == NULL) {
1781                 CDEBUG(level, "  Node: local\n");
1782         } else {
1783                 struct obd_import *imp = obd->u.cli.cl_import;
1784                 CDEBUG(level, "  Node: NID %s (rhandle: "LPX64")\n",
1785                        libcfs_nid2str(imp->imp_connection->c_peer.nid),
1786                        lock->l_remote_handle.cookie);
1787         }
1788         CDEBUG(level, "  Resource: %p ("LPU64"/"LPU64"/"LPU64")\n",
1789                   lock->l_resource,
1790                   lock->l_resource->lr_name.name[0],
1791                   lock->l_resource->lr_name.name[1],
1792                   lock->l_resource->lr_name.name[2]);
1793         CDEBUG(level, "  Req mode: %s, grant mode: %s, rc: %u, read: %d, "
1794                "write: %d flags: %#x\n", ldlm_lockname[lock->l_req_mode],
1795                ldlm_lockname[lock->l_granted_mode],
1796                atomic_read(&lock->l_refc), lock->l_readers, lock->l_writers,
1797                lock->l_flags);
1798         if (lock->l_resource->lr_type == LDLM_EXTENT)
1799                 CDEBUG(level, "  Extent: "LPU64" -> "LPU64
1800                        " (req "LPU64"-"LPU64")\n",
1801                        lock->l_policy_data.l_extent.start,
1802                        lock->l_policy_data.l_extent.end,
1803                        lock->l_req_extent.start, lock->l_req_extent.end);
1804         else if (lock->l_resource->lr_type == LDLM_FLOCK)
1805                 CDEBUG(level, "  Pid: %d Extent: "LPU64" -> "LPU64"\n",
1806                        lock->l_policy_data.l_flock.pid,
1807                        lock->l_policy_data.l_flock.start,
1808                        lock->l_policy_data.l_flock.end);
1809        else if (lock->l_resource->lr_type == LDLM_IBITS)
1810                 CDEBUG(level, "  Bits: "LPX64"\n",
1811                        lock->l_policy_data.l_inodebits.bits);
1812 }
1813
1814 void ldlm_lock_dump_handle(int level, struct lustre_handle *lockh)
1815 {
1816         struct ldlm_lock *lock;
1817
1818         if (!((libcfs_debug | D_ERROR) & level))
1819                 return;
1820
1821         lock = ldlm_handle2lock(lockh);
1822         if (lock == NULL)
1823                 return;
1824
1825         ldlm_lock_dump(D_OTHER, lock, 0);
1826
1827         LDLM_LOCK_PUT(lock);
1828 }
1829
1830 void _ldlm_lock_debug(struct ldlm_lock *lock, __u32 level,
1831                       struct libcfs_debug_msg_data *data, const char *fmt,
1832                       ...)
1833 {
1834         va_list args;
1835         cfs_debug_limit_state_t *cdls = data->msg_cdls;
1836
1837         va_start(args, fmt);
1838
1839         if (lock->l_resource == NULL) {
1840                 libcfs_debug_vmsg2(cdls, data->msg_subsys, level, data->msg_file,
1841                                    data->msg_fn, data->msg_line, fmt, args,
1842                        " ns: \?\? lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
1843                        "res: \?\? rrc=\?\? type: \?\?\? flags: %x remote: "
1844                        LPX64" expref: %d pid: %u\n", lock,
1845                        lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
1846                        lock->l_readers, lock->l_writers,
1847                        ldlm_lockname[lock->l_granted_mode],
1848                        ldlm_lockname[lock->l_req_mode],
1849                        lock->l_flags, lock->l_remote_handle.cookie,
1850                        lock->l_export ?
1851                        atomic_read(&lock->l_export->exp_refcount) : -99,
1852                        lock->l_pid);
1853                 va_end(args);
1854                 return;
1855         }
1856
1857         switch (lock->l_resource->lr_type) {
1858         case LDLM_EXTENT:
1859                 libcfs_debug_vmsg2(cdls, data->msg_subsys, level, data->msg_file,
1860                                    data->msg_fn, data->msg_line, fmt, args,
1861                        " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
1862                        "res: "LPU64"/"LPU64" rrc: %d type: %s ["LPU64"->"LPU64
1863                        "] (req "LPU64"->"LPU64") flags: %x remote: "LPX64
1864                        " expref: %d pid: %u\n",
1865                        lock->l_resource->lr_namespace->ns_name, lock,
1866                        lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
1867                        lock->l_readers, lock->l_writers,
1868                        ldlm_lockname[lock->l_granted_mode],
1869                        ldlm_lockname[lock->l_req_mode],
1870                        lock->l_resource->lr_name.name[0],
1871                        lock->l_resource->lr_name.name[1],
1872                        atomic_read(&lock->l_resource->lr_refcount),
1873                        ldlm_typename[lock->l_resource->lr_type],
1874                        lock->l_policy_data.l_extent.start,
1875                        lock->l_policy_data.l_extent.end,
1876                        lock->l_req_extent.start, lock->l_req_extent.end,
1877                        lock->l_flags, lock->l_remote_handle.cookie,
1878                        lock->l_export ?
1879                        atomic_read(&lock->l_export->exp_refcount) : -99,
1880                        lock->l_pid);
1881                 break;
1882
1883         case LDLM_FLOCK:
1884                 libcfs_debug_vmsg2(cdls, data->msg_subsys, level, data->msg_file,
1885                                    data->msg_fn, data->msg_line, fmt, args,
1886                        " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
1887                        "res: "LPU64"/"LPU64" rrc: %d type: %s pid: %d "
1888                        "["LPU64"->"LPU64"] flags: %x remote: "LPX64
1889                        " expref: %d pid: %u\n",
1890                        lock->l_resource->lr_namespace->ns_name, lock,
1891                        lock->l_handle.h_cookie, atomic_read(&lock->l_refc),
1892                        lock->l_readers, lock->l_writers,
1893                        ldlm_lockname[lock->l_granted_mode],
1894                        ldlm_lockname[lock->l_req_mode],
1895                        lock->l_resource->lr_name.name[0],
1896                        lock->l_resource->lr_name.name[1],
1897                        atomic_read(&lock->l_resource->lr_refcount),
1898                        ldlm_typename[lock->l_resource->lr_type],
1899                        lock->l_policy_data.l_flock.pid,
1900                        lock->l_policy_data.l_flock.start,
1901                        lock->l_policy_data.l_flock.end,
1902                        lock->l_flags, lock->l_remote_handle.cookie,
1903                        lock->l_export ?
1904                        atomic_read(&lock->l_export->exp_refcount) : -99,
1905                        lock->l_pid);
1906                 break;
1907
1908         case LDLM_IBITS:
1909                 libcfs_debug_vmsg2(cdls, data->msg_subsys, level, data->msg_file,
1910                                    data->msg_fn, data->msg_line, fmt, args,
1911                        " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
1912                        "res: "LPU64"/"LPU64" bits "LPX64" rrc: %d type: %s "
1913                        "flags: %x remote: "LPX64" expref: %d "
1914                        "pid %u\n",
1915                        lock->l_resource->lr_namespace->ns_name,
1916                        lock, lock->l_handle.h_cookie,
1917                        atomic_read (&lock->l_refc),
1918                        lock->l_readers, lock->l_writers,
1919                        ldlm_lockname[lock->l_granted_mode],
1920                        ldlm_lockname[lock->l_req_mode],
1921                        lock->l_resource->lr_name.name[0],
1922                        lock->l_resource->lr_name.name[1],
1923                        lock->l_policy_data.l_inodebits.bits,
1924                        atomic_read(&lock->l_resource->lr_refcount),
1925                        ldlm_typename[lock->l_resource->lr_type],
1926                        lock->l_flags, lock->l_remote_handle.cookie,
1927                        lock->l_export ?
1928                        atomic_read(&lock->l_export->exp_refcount) : -99,
1929                        lock->l_pid);
1930                 break;
1931
1932         default:
1933                 libcfs_debug_vmsg2(cdls, data->msg_subsys, level, data->msg_file,
1934                                    data->msg_fn, data->msg_line, fmt, args,
1935                        " ns: %s lock: %p/"LPX64" lrc: %d/%d,%d mode: %s/%s "
1936                        "res: "LPU64"/"LPU64" rrc: %d type: %s flags: %x "
1937                        "remote: "LPX64" expref: %d pid: %u\n",
1938                        lock->l_resource->lr_namespace->ns_name,
1939                        lock, lock->l_handle.h_cookie,
1940                        atomic_read (&lock->l_refc),
1941                        lock->l_readers, lock->l_writers,
1942                        ldlm_lockname[lock->l_granted_mode],
1943                        ldlm_lockname[lock->l_req_mode],
1944                        lock->l_resource->lr_name.name[0],
1945                        lock->l_resource->lr_name.name[1],
1946                        atomic_read(&lock->l_resource->lr_refcount),
1947                        ldlm_typename[lock->l_resource->lr_type],
1948                        lock->l_flags, lock->l_remote_handle.cookie,
1949                        lock->l_export ?
1950                        atomic_read(&lock->l_export->exp_refcount) : -99,
1951                        lock->l_pid);
1952                 break;
1953         }
1954         va_end(args);
1955 }
1956 EXPORT_SYMBOL(_ldlm_lock_debug);