lustre/ldlm/ldlm_resource.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  *   Author: Phil Schwan <phil@clusterfs.com>
   6  *   Author: Peter Braam <braam@clusterfs.com>
   7  *
   8  *   This file is part of Lustre, http://www.lustre.org.
   9  *
  10  *   Lustre is free software; you can redistribute it and/or
  11  *   modify it under the terms of version 2 of the GNU General Public
  12  *   License as published by the Free Software Foundation.
  13  *
  14  *   Lustre is distributed in the hope that it will be useful,
  15  *   but WITHOUT ANY WARRANTY; without even the implied warranty of
  16  *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  17  *   GNU General Public License for more details.
  18  *
  19  *   You should have received a copy of the GNU General Public License
  20  *   along with Lustre; if not, write to the Free Software
  21  *   Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  22  */
  23
  24 #define DEBUG_SUBSYSTEM S_LDLM
  25 #ifdef __KERNEL__
  26 # include <linux/lustre_dlm.h>
  27 #else
  28 # include <liblustre.h>
  29 #endif
  30
  31 #include <linux/obd_class.h>
  32 #include "ldlm_internal.h"
  33
  34 kmem_cache_t *ldlm_resource_slab, *ldlm_lock_slab;
  35
  36 spinlock_t ldlm_namespace_lock = SPIN_LOCK_UNLOCKED;
  37 struct list_head ldlm_namespace_list = LIST_HEAD_INIT(ldlm_namespace_list);
  38 struct proc_dir_entry *ldlm_type_proc_dir = NULL;
  39 struct proc_dir_entry *ldlm_ns_proc_dir = NULL;
  40 struct proc_dir_entry *ldlm_svc_proc_dir = NULL;
  41
  42 #ifdef __KERNEL__
  43 static int ldlm_proc_dump_ns(struct file *file, const char *buffer,
  44                              unsigned long count, void *data)
  45 {
  46         ldlm_dump_all_namespaces();
  47         RETURN(count);
  48 }
  49
  50 int ldlm_proc_setup(void)
  51 {
  52         int rc;
  53         struct lprocfs_vars list[] = {
  54                 { "dump_namespaces", NULL, ldlm_proc_dump_ns, NULL },
  55                 { NULL }};
  56         ENTRY;
  57         LASSERT(ldlm_ns_proc_dir == NULL);
  58
  59         ldlm_type_proc_dir = lprocfs_register(OBD_LDLM_DEVICENAME,
  60                                                proc_lustre_root,
  61                                                NULL, NULL);
  62         if (IS_ERR(ldlm_type_proc_dir)) {
  63                 CERROR("LProcFS failed in ldlm-init\n");
  64                 rc = PTR_ERR(ldlm_type_proc_dir);
  65                 GOTO(err, rc);
  66         }
  67
  68         ldlm_ns_proc_dir = lprocfs_register("namespaces",
  69                                             ldlm_type_proc_dir,
  70                                             NULL, NULL);
  71         if (IS_ERR(ldlm_ns_proc_dir)) {
  72                 CERROR("LProcFS failed in ldlm-init\n");
  73                 rc = PTR_ERR(ldlm_ns_proc_dir);
  74                 GOTO(err_type, rc);
  75         }
  76
  77         ldlm_svc_proc_dir = lprocfs_register("services",
  78                                             ldlm_type_proc_dir,
  79                                             NULL, NULL);
  80         if (IS_ERR(ldlm_svc_proc_dir)) {
  81                 CERROR("LProcFS failed in ldlm-init\n");
  82                 rc = PTR_ERR(ldlm_svc_proc_dir);
  83                 GOTO(err_ns, rc);
  84         }
  85
  86         rc = lprocfs_add_vars(ldlm_type_proc_dir, list, NULL);
  87
  88         RETURN(0);
  89
  90 err_ns:
  91         lprocfs_remove(ldlm_ns_proc_dir);
  92 err_type:
  93         lprocfs_remove(ldlm_type_proc_dir);
  94 err:
  95         ldlm_type_proc_dir = NULL;
  96         ldlm_ns_proc_dir = NULL;
  97         ldlm_svc_proc_dir = NULL;
  98         RETURN(rc);
  99 }
 100
 101 void ldlm_proc_cleanup(void)
 102 {
 103         if (ldlm_svc_proc_dir) {
 104                 lprocfs_remove(ldlm_svc_proc_dir);
 105                 ldlm_svc_proc_dir = NULL;
 106         }
 107
 108         if (ldlm_ns_proc_dir) {
 109                 lprocfs_remove(ldlm_ns_proc_dir);
 110                 ldlm_ns_proc_dir = NULL;
 111         }
 112
 113         if (ldlm_type_proc_dir) {
 114                 lprocfs_remove(ldlm_type_proc_dir);
 115                 ldlm_type_proc_dir = NULL;
 116         }
 117 }
 118
 119 static int lprocfs_uint_rd(char *page, char **start, off_t off,
 120                            int count, int *eof, void *data)
 121 {
 122         unsigned int *temp = (unsigned int *)data;
 123         return snprintf(page, count, "%u\n", *temp);
 124 }
 125
 126 static int lprocfs_read_lru_size(char *page, char **start, off_t off,
 127                                  int count, int *eof, void *data)
 128 {
 129         struct ldlm_namespace *ns = data;
 130         return lprocfs_uint_rd(page, start, off, count, eof,
 131                                &ns->ns_max_unused);
 132 }
 133
 134 #define MAX_STRING_SIZE 128
 135 static int lprocfs_write_lru_size(struct file *file, const char *buffer,
 136                                   unsigned long count, void *data)
 137 {
 138         struct ldlm_namespace *ns = data;
 139         char dummy[MAX_STRING_SIZE + 1];
 140         unsigned long tmp;
 141
 142         dummy[MAX_STRING_SIZE] = '\0';
 143         copy_from_user(dummy, buffer, MAX_STRING_SIZE);
 144
 145         if (count == 6 && memcmp(dummy, "clear", 5) == 0) {
 146                 CDEBUG(D_DLMTRACE,
 147                        "dropping all unused locks from namespace %s\n",
 148                        ns->ns_name);
 149                 tmp = ns->ns_max_unused;
 150                 ns->ns_max_unused = 0;
 151                 ldlm_cancel_lru(ns);
 152                 ns->ns_max_unused = tmp;
 153                 return count;
 154         }
 155
 156         tmp = simple_strtoul(dummy, NULL, 0);
 157         CDEBUG(D_DLMTRACE, "changing namespace %s max_unused from %u to %u\n",
 158                ns->ns_name, ns->ns_max_unused, (unsigned int)tmp);
 159         ns->ns_max_unused = (unsigned int)tmp;
 160
 161         ldlm_cancel_lru(ns);
 162
 163         return count;
 164 }
 165
 166 void ldlm_proc_namespace(struct ldlm_namespace *ns)
 167 {
 168         struct lprocfs_vars lock_vars[2];
 169         char lock_name[MAX_STRING_SIZE + 1];
 170
 171         LASSERT(ns != NULL);
 172         LASSERT(ns->ns_name != NULL);
 173
 174         lock_name[MAX_STRING_SIZE] = '\0';
 175
 176         memset(lock_vars, 0, sizeof(lock_vars));
 177         lock_vars[0].read_fptr = lprocfs_rd_u64;
 178         lock_vars[0].name = lock_name;
 179
 180         snprintf(lock_name, MAX_STRING_SIZE, "%s/resource_count", ns->ns_name);
 181         lock_vars[0].data = &ns->ns_resources;
 182         lprocfs_add_vars(ldlm_ns_proc_dir, lock_vars, 0);
 183
 184         snprintf(lock_name, MAX_STRING_SIZE, "%s/lock_count", ns->ns_name);
 185         lock_vars[0].data = &ns->ns_locks;
 186         lprocfs_add_vars(ldlm_ns_proc_dir, lock_vars, 0);
 187
 188         if (ns->ns_client) {
 189                 snprintf(lock_name, MAX_STRING_SIZE, "%s/lock_unused_count",
 190                          ns->ns_name);
 191                 lock_vars[0].data = &ns->ns_nr_unused;
 192                 lock_vars[0].read_fptr = lprocfs_uint_rd;
 193                 lprocfs_add_vars(ldlm_ns_proc_dir, lock_vars, 0);
 194
 195                 snprintf(lock_name, MAX_STRING_SIZE, "%s/lru_size",
 196                          ns->ns_name);
 197                 lock_vars[0].data = ns;
 198                 lock_vars[0].read_fptr = lprocfs_read_lru_size;
 199                 lock_vars[0].write_fptr = lprocfs_write_lru_size;
 200                 lprocfs_add_vars(ldlm_ns_proc_dir, lock_vars, 0);
 201         }
 202 }
 203 #endif
 204 #undef MAX_STRING_SIZE
 205
 206 struct ldlm_namespace *ldlm_namespace_new(char *name, __u32 client)
 207 {
 208         struct ldlm_namespace *ns = NULL;
 209         struct list_head *bucket;
 210         int rc;
 211         ENTRY;
 212
 213         rc = ldlm_get_ref();
 214         if (rc) {
 215                 CERROR("ldlm_get_ref failed: %d\n", rc);
 216                 RETURN(NULL);
 217         }
 218
 219         OBD_ALLOC(ns, sizeof(*ns));
 220         if (!ns)
 221                 GOTO(out_ref, NULL);
 222
 223         OBD_VMALLOC(ns->ns_hash, sizeof(*ns->ns_hash) * RES_HASH_SIZE);
 224         if (!ns->ns_hash)
 225                 GOTO(out_ns, NULL);
 226
 227         OBD_ALLOC(ns->ns_name, strlen(name) + 1);
 228         if (!ns->ns_name)
 229                 GOTO(out_hash, NULL);
 230
 231         strcpy(ns->ns_name, name);
 232
 233         INIT_LIST_HEAD(&ns->ns_root_list);
 234         l_lock_init(&ns->ns_lock);
 235         ns->ns_refcount = 0;
 236         ns->ns_client = client;
 237         spin_lock_init(&ns->ns_counter_lock);
 238         ns->ns_locks = 0;
 239         ns->ns_resources = 0;
 240
 241         for (bucket = ns->ns_hash + RES_HASH_SIZE - 1; bucket >= ns->ns_hash;
 242              bucket--)
 243                 INIT_LIST_HEAD(bucket);
 244
 245         INIT_LIST_HEAD(&ns->ns_unused_list);
 246         ns->ns_nr_unused = 0;
 247         ns->ns_max_unused = LDLM_DEFAULT_LRU_SIZE;
 248
 249         spin_lock(&ldlm_namespace_lock);
 250         list_add(&ns->ns_list_chain, &ldlm_namespace_list);
 251         spin_unlock(&ldlm_namespace_lock);
 252 #ifdef __KERNEL__
 253         ldlm_proc_namespace(ns);
 254 #endif
 255         RETURN(ns);
 256
 257 out_hash:
 258         POISON(ns->ns_hash, 0x5a, sizeof(*ns->ns_hash) * RES_HASH_SIZE);
 259         OBD_VFREE(ns->ns_hash, sizeof(*ns->ns_hash) * RES_HASH_SIZE);
 260 out_ns:
 261         OBD_FREE(ns, sizeof(*ns));
 262 out_ref:
 263         ldlm_put_ref(0);
 264         RETURN(NULL);
 265 }
 266
 267 extern struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock);
 268
 269 /* If flags contains FL_LOCAL_ONLY, don't try to tell the server, just cleanup.
 270  * This is currently only used for recovery, and we make certain assumptions
 271  * as a result--notably, that we shouldn't cancel locks with refs. -phil
 272  *
 273  * Called with the ns_lock held. */
 274 static void cleanup_resource(struct ldlm_resource *res, struct list_head *q,
 275                              int flags)
 276 {
 277         struct list_head *tmp, *pos;
 278         int rc = 0, client = res->lr_namespace->ns_client;
 279         int local_only = (flags & LDLM_FL_LOCAL_ONLY);
 280         ENTRY;
 281
 282         list_for_each_safe(tmp, pos, q) {
 283                 struct ldlm_lock *lock;
 284                 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
 285                 LDLM_LOCK_GET(lock);
 286
 287                 lock->l_flags |= LDLM_FL_FAILED;
 288                 lock->l_flags |= flags;
 289
 290                 if (local_only && (lock->l_readers || lock->l_writers)) {
 291                         /* This is a little bit gross, but much better than the
 292                          * alternative: pretend that we got a blocking AST from
 293                          * the server, so that when the lock is decref'd, it
 294                          * will go away ... */
 295                         lock->l_flags |= LDLM_FL_CBPENDING;
 296                         /* ... without sending a CANCEL message. */
 297                         lock->l_flags |= LDLM_FL_LOCAL_ONLY;
 298                         LDLM_DEBUG(lock, "setting FL_LOCAL_ONLY");
 299                         if (lock->l_completion_ast)
 300                                 lock->l_completion_ast(lock, 0, NULL);
 301                         LDLM_LOCK_PUT(lock);
 302                         continue;
 303                 }
 304
 305                 if (client) {
 306                         struct lustre_handle lockh;
 307                         ldlm_lock2handle(lock, &lockh);
 308                         if (!local_only) {
 309                                 rc = ldlm_cli_cancel(&lockh);
 310                                 if (rc)
 311                                         CERROR("ldlm_cli_cancel: %d\n", rc);
 312                         }
 313                         /* Force local cleanup on errors, too. */
 314                         if (local_only || rc != ELDLM_OK)
 315                                 ldlm_lock_cancel(lock);
 316                 } else {
 317                         LDLM_DEBUG(lock, "Freeing a lock still held by a "
 318                                    "client node");
 319
 320                         ldlm_resource_unlink_lock(lock);
 321                         ldlm_lock_destroy(lock);
 322                 }
 323                 LDLM_LOCK_PUT(lock);
 324         }
 325         EXIT;
 326 }
 327
 328 int ldlm_namespace_cleanup(struct ldlm_namespace *ns, int flags)
 329 {
 330         int i;
 331
 332         if (ns == NULL) {
 333                 CDEBUG(D_INFO, "NULL ns, skipping cleanup\n");
 334                 return ELDLM_OK;
 335         }
 336
 337         l_lock(&ns->ns_lock);
 338         for (i = 0; i < RES_HASH_SIZE; i++) {
 339                 struct list_head *tmp, *pos;
 340                 list_for_each_safe(tmp, pos, &(ns->ns_hash[i])) {
 341                         struct ldlm_resource *res;
 342                         res = list_entry(tmp, struct ldlm_resource, lr_hash);
 343                         ldlm_resource_getref(res);
 344
 345                         cleanup_resource(res, &res->lr_granted, flags);
 346                         cleanup_resource(res, &res->lr_converting, flags);
 347                         cleanup_resource(res, &res->lr_waiting, flags);
 348
 349                         /* XXX what a mess: don't force cleanup if we're
 350                          * local_only (which is only used by recovery).  In that
 351                          * case, we probably still have outstanding lock refs
 352                          * which reference these resources. -phil */
 353                         if (!ldlm_resource_putref(res) &&
 354                             !(flags & LDLM_FL_LOCAL_ONLY)) {
 355                                 CERROR("Resource refcount nonzero (%d) after "
 356                                        "lock cleanup; forcing cleanup.\n",
 357                                        atomic_read(&res->lr_refcount));
 358                                 ldlm_resource_dump(res);
 359                                 atomic_set(&res->lr_refcount, 1);
 360                                 ldlm_resource_putref(res);
 361                         }
 362                 }
 363         }
 364         l_unlock(&ns->ns_lock);
 365
 366         return ELDLM_OK;
 367 }
 368
 369 /* Cleanup, but also free, the namespace */
 370 int ldlm_namespace_free(struct ldlm_namespace *ns, int force)
 371 {
 372         if (!ns)
 373                 RETURN(ELDLM_OK);
 374
 375         spin_lock(&ldlm_namespace_lock);
 376         list_del(&ns->ns_list_chain);
 377
 378         spin_unlock(&ldlm_namespace_lock);
 379
 380         /* At shutdown time, don't call the cancellation callback */
 381         ldlm_namespace_cleanup(ns, 0);
 382
 383 #ifdef __KERNEL__
 384         {
 385                 struct proc_dir_entry *dir;
 386                 dir = lprocfs_srch(ldlm_ns_proc_dir, ns->ns_name);
 387                 if (dir == NULL) {
 388                         CERROR("dlm namespace %s has no procfs dir?\n",
 389                                ns->ns_name);
 390                 } else {
 391                         lprocfs_remove(dir);
 392                 }
 393         }
 394 #endif
 395
 396         POISON(ns->ns_hash, 0x5a, sizeof(*ns->ns_hash) * RES_HASH_SIZE);
 397         OBD_VFREE(ns->ns_hash, sizeof(*ns->ns_hash) * RES_HASH_SIZE);
 398         OBD_FREE(ns->ns_name, strlen(ns->ns_name) + 1);
 399         OBD_FREE(ns, sizeof(*ns));
 400
 401         ldlm_put_ref(force);
 402
 403         return ELDLM_OK;
 404 }
 405
 406 static __u32 ldlm_hash_fn(struct ldlm_resource *parent, struct ldlm_res_id name)
 407 {
 408         __u32 hash = 0;
 409         int i;
 410
 411         for (i = 0; i < RES_NAME_SIZE; i++)
 412                 hash += name.name[i];
 413
 414         hash += (__u32)((unsigned long)parent >> 4);
 415
 416         return (hash & RES_HASH_MASK);
 417 }
 418
 419 static struct ldlm_resource *ldlm_resource_new(void)
 420 {
 421         struct ldlm_resource *res;
 422
 423         OBD_SLAB_ALLOC(res, ldlm_resource_slab, SLAB_NOFS, sizeof *res);
 424         if (res == NULL) {
 425                 LBUG();
 426                 return NULL;
 427         }
 428         memset(res, 0, sizeof(*res));
 429
 430         INIT_LIST_HEAD(&res->lr_children);
 431         INIT_LIST_HEAD(&res->lr_childof);
 432         INIT_LIST_HEAD(&res->lr_granted);
 433         INIT_LIST_HEAD(&res->lr_converting);
 434         INIT_LIST_HEAD(&res->lr_waiting);
 435         sema_init(&res->lr_lvb_sem, 1);
 436         atomic_set(&res->lr_refcount, 1);
 437
 438         return res;
 439 }
 440
 441 /* Args: locked namespace
 442  * Returns: newly-allocated, referenced, unlocked resource */
 443 static struct ldlm_resource *
 444 ldlm_resource_add(struct ldlm_namespace *ns, struct ldlm_resource *parent,
 445                   struct ldlm_res_id name, __u32 type)
 446 {
 447         struct list_head *bucket;
 448         struct ldlm_resource *res;
 449         ENTRY;
 450
 451         if (type < LDLM_MIN_TYPE || type > LDLM_MAX_TYPE) {
 452                 LBUG();
 453                 RETURN(NULL);
 454         }
 455
 456         res = ldlm_resource_new();
 457         if (!res) {
 458                 LBUG();
 459                 RETURN(NULL);
 460         }
 461
 462         spin_lock(&ns->ns_counter_lock);
 463         ns->ns_resources++;
 464         spin_unlock(&ns->ns_counter_lock);
 465
 466         l_lock(&ns->ns_lock);
 467         memcpy(&res->lr_name, &name, sizeof(res->lr_name));
 468         res->lr_namespace = ns;
 469         ns->ns_refcount++;
 470
 471         res->lr_type = type;
 472         res->lr_most_restr = LCK_NL;
 473
 474         bucket = ns->ns_hash + ldlm_hash_fn(parent, name);
 475         list_add(&res->lr_hash, bucket);
 476
 477         if (parent == NULL) {
 478                 list_add(&res->lr_childof, &ns->ns_root_list);
 479         } else {
 480                 res->lr_parent = parent;
 481                 list_add(&res->lr_childof, &parent->lr_children);
 482         }
 483         l_unlock(&ns->ns_lock);
 484
 485
 486         RETURN(res);
 487 }
 488
 489 /* Args: unlocked namespace
 490  * Locks: takes and releases ns->ns_lock and res->lr_lock
 491  * Returns: referenced, unlocked ldlm_resource or NULL */
 492 struct ldlm_resource *
 493 ldlm_resource_get(struct ldlm_namespace *ns, struct ldlm_resource *parent,
 494                   struct ldlm_res_id name, __u32 type, int create)
 495 {
 496         struct list_head *bucket, *tmp;
 497         struct ldlm_resource *res = NULL;
 498         ENTRY;
 499
 500         LASSERT(ns != NULL);
 501         LASSERT(ns->ns_hash != NULL);
 502         LASSERT(name.name[0] != 0);
 503
 504         l_lock(&ns->ns_lock);
 505         bucket = ns->ns_hash + ldlm_hash_fn(parent, name);
 506
 507         list_for_each(tmp, bucket) {
 508                 res = list_entry(tmp, struct ldlm_resource, lr_hash);
 509
 510                 if (memcmp(&res->lr_name, &name, sizeof(res->lr_name)) == 0) {
 511                         ldlm_resource_getref(res);
 512                         l_unlock(&ns->ns_lock);
 513                         RETURN(res);
 514                 }
 515         }
 516
 517         if (create)
 518                 res = ldlm_resource_add(ns, parent, name, type);
 519         else
 520                 res = NULL;
 521
 522         l_unlock(&ns->ns_lock);
 523
 524         if (create && ns->ns_lvbo && ns->ns_lvbo->lvbo_init) {
 525                 int rc = ns->ns_lvbo->lvbo_init(res);
 526                 if (rc)
 527                         CERROR("lvbo_init failed for resource "LPU64": rc %d\n",
 528                                name.name[0], rc);
 529         }
 530
 531         RETURN(res);
 532 }
 533
 534 struct ldlm_resource *ldlm_resource_getref(struct ldlm_resource *res)
 535 {
 536         LASSERT(res != NULL);
 537         LASSERT(res != (void *)0x5a5a5a5a);
 538         atomic_inc(&res->lr_refcount);
 539         CDEBUG(D_INFO, "getref res: %p count: %d\n", res,
 540                atomic_read(&res->lr_refcount));
 541         return res;
 542 }
 543
 544 /* Returns 1 if the resource was freed, 0 if it remains. */
 545 int ldlm_resource_putref(struct ldlm_resource *res)
 546 {
 547         int rc = 0;
 548         ENTRY;
 549
 550         CDEBUG(D_INFO, "putref res: %p count: %d\n", res,
 551                atomic_read(&res->lr_refcount) - 1);
 552         LASSERT(atomic_read(&res->lr_refcount) > 0);
 553         LASSERT(atomic_read(&res->lr_refcount) < 0x5a5a5a5a);
 554
 555         if (atomic_dec_and_test(&res->lr_refcount)) {
 556                 struct ldlm_namespace *ns = res->lr_namespace;
 557                 ENTRY;
 558
 559                 l_lock(&ns->ns_lock);
 560
 561                 if (atomic_read(&res->lr_refcount) != 0) {
 562                         /* We lost the race. */
 563                         l_unlock(&ns->ns_lock);
 564                         RETURN(rc);
 565                 }
 566
 567                 if (!list_empty(&res->lr_granted)) {
 568                         ldlm_resource_dump(res);
 569                         LBUG();
 570                 }
 571
 572                 if (!list_empty(&res->lr_converting)) {
 573                         ldlm_resource_dump(res);
 574                         LBUG();
 575                 }
 576
 577                 if (!list_empty(&res->lr_waiting)) {
 578                         ldlm_resource_dump(res);
 579                         LBUG();
 580                 }
 581
 582                 if (!list_empty(&res->lr_children)) {
 583                         ldlm_resource_dump(res);
 584                         LBUG();
 585                 }
 586
 587                 ns->ns_refcount--;
 588                 list_del_init(&res->lr_hash);
 589                 list_del_init(&res->lr_childof);
 590                 if (res->lr_lvb_data)
 591                         OBD_FREE(res->lr_lvb_data, res->lr_lvb_len);
 592                 l_unlock(&ns->ns_lock);
 593
 594                 OBD_SLAB_FREE(res, ldlm_resource_slab, sizeof *res);
 595
 596                 spin_lock(&ns->ns_counter_lock);
 597                 ns->ns_resources--;
 598                 spin_unlock(&ns->ns_counter_lock);
 599
 600                 rc = 1;
 601                 EXIT;
 602         }
 603
 604         RETURN(rc);
 605 }
 606
 607 void ldlm_resource_add_lock(struct ldlm_resource *res, struct list_head *head,
 608                             struct ldlm_lock *lock)
 609 {
 610         l_lock(&res->lr_namespace->ns_lock);
 611
 612         ldlm_resource_dump(res);
 613         CDEBUG(D_OTHER, "About to add this lock:\n");
 614         ldlm_lock_dump(D_OTHER, lock, 0);
 615
 616         if (lock->l_destroyed) {
 617                 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
 618                 goto out;
 619         }
 620
 621         LASSERT(list_empty(&lock->l_res_link));
 622
 623         list_add_tail(&lock->l_res_link, head);
 624  out:
 625         l_unlock(&res->lr_namespace->ns_lock);
 626 }
 627
 628 void ldlm_resource_insert_lock_after(struct ldlm_lock *original,
 629                                      struct ldlm_lock *new)
 630 {
 631         struct ldlm_resource *res = original->l_resource;
 632
 633         l_lock(&res->lr_namespace->ns_lock);
 634
 635         ldlm_resource_dump(res);
 636         CDEBUG(D_OTHER, "About to insert this lock after %p:\n", original);
 637         ldlm_lock_dump(D_OTHER, new, 0);
 638
 639         if (new->l_destroyed) {
 640                 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
 641                 goto out;
 642         }
 643
 644         LASSERT(list_empty(&new->l_res_link));
 645
 646         list_add(&new->l_res_link, &original->l_res_link);
 647  out:
 648         l_unlock(&res->lr_namespace->ns_lock);
 649 }
 650
 651 void ldlm_resource_unlink_lock(struct ldlm_lock *lock)
 652 {
 653         l_lock(&lock->l_resource->lr_namespace->ns_lock);
 654         list_del_init(&lock->l_res_link);
 655         l_unlock(&lock->l_resource->lr_namespace->ns_lock);
 656 }
 657
 658 void ldlm_res2desc(struct ldlm_resource *res, struct ldlm_resource_desc *desc)
 659 {
 660         desc->lr_type = res->lr_type;
 661         memcpy(&desc->lr_name, &res->lr_name, sizeof(desc->lr_name));
 662 }
 663
 664 void ldlm_dump_all_namespaces(void)
 665 {
 666         struct list_head *tmp;
 667
 668         spin_lock(&ldlm_namespace_lock);
 669
 670         list_for_each(tmp, &ldlm_namespace_list) {
 671                 struct ldlm_namespace *ns;
 672                 ns = list_entry(tmp, struct ldlm_namespace, ns_list_chain);
 673                 ldlm_namespace_dump(ns);
 674         }
 675
 676         spin_unlock(&ldlm_namespace_lock);
 677 }
 678
 679 void ldlm_namespace_dump(struct ldlm_namespace *ns)
 680 {
 681         struct list_head *tmp;
 682         unsigned int debug_save = portal_debug;
 683
 684         portal_debug |= D_OTHER;
 685         l_lock(&ns->ns_lock);
 686         CDEBUG(D_OTHER, "--- Namespace: %s (rc: %d, client: %d)\n", ns->ns_name,
 687                ns->ns_refcount, ns->ns_client);
 688
 689         list_for_each(tmp, &ns->ns_root_list) {
 690                 struct ldlm_resource *res;
 691                 res = list_entry(tmp, struct ldlm_resource, lr_childof);
 692
 693                 /* Once we have resources with children, this should really dump
 694                  * them recursively. */
 695                 ldlm_resource_dump(res);
 696         }
 697         l_unlock(&ns->ns_lock);
 698         portal_debug = debug_save;
 699 }
 700
 701 void ldlm_resource_dump(struct ldlm_resource *res)
 702 {
 703         struct list_head *tmp;
 704         int pos;
 705
 706         if (RES_NAME_SIZE != 4)
 707                 LBUG();
 708
 709         CDEBUG(D_OTHER, "--- Resource: %p ("LPU64"/"LPU64"/"LPU64"/"LPU64
 710                ") (rc: %d)\n", res, res->lr_name.name[0], res->lr_name.name[1],
 711                res->lr_name.name[2], res->lr_name.name[3],
 712                atomic_read(&res->lr_refcount));
 713
 714         if (!list_empty(&res->lr_granted)) {
 715                 pos = 0;
 716                 CDEBUG(D_OTHER, "Granted locks:\n");
 717                 list_for_each(tmp, &res->lr_granted) {
 718                         struct ldlm_lock *lock;
 719                         lock = list_entry(tmp, struct ldlm_lock, l_res_link);
 720                         ldlm_lock_dump(D_OTHER, lock, ++pos);
 721                 }
 722         }
 723         if (!list_empty(&res->lr_converting)) {
 724                 pos = 0;
 725                 CDEBUG(D_OTHER, "Converting locks:\n");
 726                 list_for_each(tmp, &res->lr_converting) {
 727                         struct ldlm_lock *lock;
 728                         lock = list_entry(tmp, struct ldlm_lock, l_res_link);
 729                         ldlm_lock_dump(D_OTHER, lock, ++pos);
 730                 }
 731         }
 732         if (!list_empty(&res->lr_waiting)) {
 733                 pos = 0;
 734                 CDEBUG(D_OTHER, "Waiting locks:\n");
 735                 list_for_each(tmp, &res->lr_waiting) {
 736                         struct ldlm_lock *lock;
 737                         lock = list_entry(tmp, struct ldlm_lock, l_res_link);
 738                         ldlm_lock_dump(D_OTHER, lock, ++pos);
 739                 }
 740         }
 741 }