lustre/ldlm/ldlm_resource.c

   1 /*
   2  * GPL HEADER START
   3  *
   4  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   5  *
   6  * This program is free software; you can redistribute it and/or modify
   7  * it under the terms of the GNU General Public License version 2 only,
   8  * as published by the Free Software Foundation.
   9  *
  10  * This program is distributed in the hope that it will be useful, but
  11  * WITHOUT ANY WARRANTY; without even the implied warranty of
  12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  13  * General Public License version 2 for more details (a copy is included
  14  * in the LICENSE file that accompanied this code).
  15  *
  16  * You should have received a copy of the GNU General Public License
  17  * version 2 along with this program; If not, see
  18  * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
  19  *
  20  * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
  21  * CA 95054 USA or visit www.sun.com if you need additional information or
  22  * have any questions.
  23  *
  24  * GPL HEADER END
  25  */
  26 /*
  27  * Copyright (c) 2002, 2010, Oracle and/or its affiliates. All rights reserved.
  28  * Use is subject to license terms.
  29  *
  30  * Copyright (c) 2010, 2014, Intel Corporation.
  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_resource.c
  37  *
  38  * Author: Phil Schwan <phil@clusterfs.com>
  39  * Author: Peter Braam <braam@clusterfs.com>
  40  */
  41
  42 #define DEBUG_SUBSYSTEM S_LDLM
  43 #include <lustre_dlm.h>
  44 #include <lustre_fid.h>
  45 #include <obd_class.h>
  46 #include "ldlm_internal.h"
  47
  48 struct kmem_cache *ldlm_resource_slab, *ldlm_lock_slab;
  49
  50 int ldlm_srv_namespace_nr = 0;
  51 int ldlm_cli_namespace_nr = 0;
  52
  53 struct mutex ldlm_srv_namespace_lock;
  54 struct list_head ldlm_srv_namespace_list;
  55
  56 struct mutex ldlm_cli_namespace_lock;
  57 /* Client Namespaces that have active resources in them.
  58  * Once all resources go away, ldlm_poold moves such namespaces to the
  59  * inactive list */
  60 struct list_head ldlm_cli_active_namespace_list;
  61 /* Client namespaces that don't have any locks in them */
  62 struct list_head ldlm_cli_inactive_namespace_list;
  63
  64 static struct proc_dir_entry *ldlm_type_proc_dir;
  65 static struct proc_dir_entry *ldlm_ns_proc_dir;
  66 struct proc_dir_entry *ldlm_svc_proc_dir;
  67
  68 /* during debug dump certain amount of granted locks for one resource to avoid
  69  * DDOS. */
  70 static unsigned int ldlm_dump_granted_max = 256;
  71
  72 #ifdef CONFIG_PROC_FS
  73 static ssize_t
  74 lprocfs_dump_ns_seq_write(struct file *file, const char __user *buffer,
  75                           size_t count, loff_t *off)
  76 {
  77         ldlm_dump_all_namespaces(LDLM_NAMESPACE_SERVER, D_DLMTRACE);
  78         ldlm_dump_all_namespaces(LDLM_NAMESPACE_CLIENT, D_DLMTRACE);
  79         RETURN(count);
  80 }
  81 LPROC_SEQ_FOPS_WO_TYPE(ldlm, dump_ns);
  82
  83 LPROC_SEQ_FOPS_RW_TYPE(ldlm_rw, uint);
  84 LPROC_SEQ_FOPS_RO_TYPE(ldlm, uint);
  85
  86 int ldlm_proc_setup(void)
  87 {
  88         int rc;
  89         struct lprocfs_vars list[] = {
  90                 { .name =       "dump_namespaces",
  91                   .fops =       &ldlm_dump_ns_fops,
  92                   .proc_mode =  0222 },
  93                 { .name =       "dump_granted_max",
  94                   .fops =       &ldlm_rw_uint_fops,
  95                   .data =       &ldlm_dump_granted_max },
  96                 { .name =       "cancel_unused_locks_before_replay",
  97                   .fops =       &ldlm_rw_uint_fops,
  98                   .data =       &ldlm_cancel_unused_locks_before_replay },
  99                 { NULL }};
 100         ENTRY;
 101         LASSERT(ldlm_ns_proc_dir == NULL);
 102
 103         ldlm_type_proc_dir = lprocfs_register(OBD_LDLM_DEVICENAME,
 104                                               proc_lustre_root,
 105                                               NULL, NULL);
 106         if (IS_ERR(ldlm_type_proc_dir)) {
 107                 CERROR("LProcFS failed in ldlm-init\n");
 108                 rc = PTR_ERR(ldlm_type_proc_dir);
 109                 GOTO(err, rc);
 110         }
 111
 112         ldlm_ns_proc_dir = lprocfs_register("namespaces",
 113                                             ldlm_type_proc_dir,
 114                                             NULL, NULL);
 115         if (IS_ERR(ldlm_ns_proc_dir)) {
 116                 CERROR("LProcFS failed in ldlm-init\n");
 117                 rc = PTR_ERR(ldlm_ns_proc_dir);
 118                 GOTO(err_type, rc);
 119         }
 120
 121         ldlm_svc_proc_dir = lprocfs_register("services",
 122                                              ldlm_type_proc_dir,
 123                                              NULL, NULL);
 124         if (IS_ERR(ldlm_svc_proc_dir)) {
 125                 CERROR("LProcFS failed in ldlm-init\n");
 126                 rc = PTR_ERR(ldlm_svc_proc_dir);
 127                 GOTO(err_ns, rc);
 128         }
 129
 130         rc = lprocfs_add_vars(ldlm_type_proc_dir, list, NULL);
 131         if (rc != 0) {
 132                 CERROR("LProcFS failed in ldlm-init\n");
 133                 GOTO(err_svc, rc);
 134         }
 135
 136         RETURN(0);
 137
 138 err_svc:
 139         lprocfs_remove(&ldlm_svc_proc_dir);
 140 err_ns:
 141         lprocfs_remove(&ldlm_ns_proc_dir);
 142 err_type:
 143         lprocfs_remove(&ldlm_type_proc_dir);
 144 err:
 145         ldlm_svc_proc_dir = NULL;
 146         RETURN(rc);
 147 }
 148
 149 void ldlm_proc_cleanup(void)
 150 {
 151         if (ldlm_svc_proc_dir)
 152                 lprocfs_remove(&ldlm_svc_proc_dir);
 153
 154         if (ldlm_ns_proc_dir)
 155                 lprocfs_remove(&ldlm_ns_proc_dir);
 156
 157         if (ldlm_type_proc_dir)
 158                 lprocfs_remove(&ldlm_type_proc_dir);
 159 }
 160
 161 static int lprocfs_ns_resources_seq_show(struct seq_file *m, void *v)
 162 {
 163         struct ldlm_namespace   *ns  = m->private;
 164         __u64                   res = 0;
 165         cfs_hash_bd_t           bd;
 166         int                     i;
 167
 168         /* result is not strictly consistant */
 169         cfs_hash_for_each_bucket(ns->ns_rs_hash, &bd, i)
 170                 res += cfs_hash_bd_count_get(&bd);
 171         return lprocfs_u64_seq_show(m, &res);
 172 }
 173 LPROC_SEQ_FOPS_RO(lprocfs_ns_resources);
 174
 175 static int lprocfs_ns_locks_seq_show(struct seq_file *m, void *v)
 176 {
 177         struct ldlm_namespace   *ns = m->private;
 178         __u64                   locks;
 179
 180         locks = lprocfs_stats_collector(ns->ns_stats, LDLM_NSS_LOCKS,
 181                                         LPROCFS_FIELDS_FLAGS_SUM);
 182         return lprocfs_u64_seq_show(m, &locks);
 183 }
 184 LPROC_SEQ_FOPS_RO(lprocfs_ns_locks);
 185
 186 static int lprocfs_lru_size_seq_show(struct seq_file *m, void *v)
 187 {
 188         struct ldlm_namespace *ns = m->private;
 189         __u32 *nr = &ns->ns_max_unused;
 190
 191         if (ns_connect_lru_resize(ns))
 192                 nr = &ns->ns_nr_unused;
 193         return lprocfs_uint_seq_show(m, nr);
 194 }
 195
 196 static ssize_t lprocfs_lru_size_seq_write(struct file *file,
 197                                           const char __user *buffer,
 198                                           size_t count, loff_t *off)
 199 {
 200         struct ldlm_namespace *ns = ((struct seq_file *)file->private_data)->private;
 201         char dummy[MAX_STRING_SIZE + 1], *end;
 202         unsigned long tmp;
 203         int lru_resize;
 204
 205         dummy[MAX_STRING_SIZE] = '\0';
 206         if (copy_from_user(dummy, buffer, MAX_STRING_SIZE))
 207                 return -EFAULT;
 208
 209         if (strncmp(dummy, "clear", 5) == 0) {
 210                 CDEBUG(D_DLMTRACE,
 211                        "dropping all unused locks from namespace %s\n",
 212                        ldlm_ns_name(ns));
 213                 if (ns_connect_lru_resize(ns)) {
 214                         int canceled, unused  = ns->ns_nr_unused;
 215
 216                         /* Try to cancel all @ns_nr_unused locks. */
 217                         canceled = ldlm_cancel_lru(ns, unused, 0,
 218                                                    LDLM_CANCEL_PASSED);
 219                         if (canceled < unused) {
 220                                 CDEBUG(D_DLMTRACE,
 221                                        "not all requested locks are canceled, "
 222                                        "requested: %d, canceled: %d\n", unused,
 223                                        canceled);
 224                                 return -EINVAL;
 225                         }
 226                 } else {
 227                         tmp = ns->ns_max_unused;
 228                         ns->ns_max_unused = 0;
 229                         ldlm_cancel_lru(ns, 0, 0, LDLM_CANCEL_PASSED);
 230                         ns->ns_max_unused = tmp;
 231                 }
 232                 return count;
 233         }
 234
 235         tmp = simple_strtoul(dummy, &end, 0);
 236         if (dummy == end) {
 237                 CERROR("invalid value written\n");
 238                 return -EINVAL;
 239         }
 240         lru_resize = (tmp == 0);
 241
 242         if (ns_connect_lru_resize(ns)) {
 243                 if (!lru_resize)
 244                         ns->ns_max_unused = (unsigned int)tmp;
 245
 246                 if (tmp > ns->ns_nr_unused)
 247                         tmp = ns->ns_nr_unused;
 248                 tmp = ns->ns_nr_unused - tmp;
 249
 250                 CDEBUG(D_DLMTRACE,
 251                        "changing namespace %s unused locks from %u to %u\n",
 252                        ldlm_ns_name(ns), ns->ns_nr_unused,
 253                        (unsigned int)tmp);
 254                 ldlm_cancel_lru(ns, tmp, LCF_ASYNC, LDLM_CANCEL_PASSED);
 255
 256                 if (!lru_resize) {
 257                         CDEBUG(D_DLMTRACE,
 258                                "disable lru_resize for namespace %s\n",
 259                                ldlm_ns_name(ns));
 260                         ns->ns_connect_flags &= ~OBD_CONNECT_LRU_RESIZE;
 261                 }
 262         } else {
 263                 CDEBUG(D_DLMTRACE,
 264                        "changing namespace %s max_unused from %u to %u\n",
 265                        ldlm_ns_name(ns), ns->ns_max_unused,
 266                        (unsigned int)tmp);
 267                 ns->ns_max_unused = (unsigned int)tmp;
 268                 ldlm_cancel_lru(ns, 0, LCF_ASYNC, LDLM_CANCEL_PASSED);
 269
 270                 /* Make sure that LRU resize was originally supported before
 271                  * turning it on here. */
 272                 if (lru_resize &&
 273                     (ns->ns_orig_connect_flags & OBD_CONNECT_LRU_RESIZE)) {
 274                         CDEBUG(D_DLMTRACE,
 275                                "enable lru_resize for namespace %s\n",
 276                                ldlm_ns_name(ns));
 277                         ns->ns_connect_flags |= OBD_CONNECT_LRU_RESIZE;
 278                 }
 279         }
 280
 281         return count;
 282 }
 283 LPROC_SEQ_FOPS(lprocfs_lru_size);
 284
 285 static int lprocfs_elc_seq_show(struct seq_file *m, void *v)
 286 {
 287         struct ldlm_namespace *ns = m->private;
 288         unsigned int supp = ns_connect_cancelset(ns);
 289
 290         return lprocfs_uint_seq_show(m, &supp);
 291 }
 292
 293 static ssize_t lprocfs_elc_seq_write(struct file *file,
 294                                      const char __user *buffer,
 295                                      size_t count, loff_t *off)
 296 {
 297         struct ldlm_namespace *ns = ((struct seq_file *)file->private_data)->private;
 298         unsigned int supp = -1;
 299         int rc;
 300
 301         rc = lprocfs_wr_uint(file, buffer, count, &supp);
 302         if (rc < 0)
 303                 return rc;
 304
 305         if (supp == 0)
 306                 ns->ns_connect_flags &= ~OBD_CONNECT_CANCELSET;
 307         else if (ns->ns_orig_connect_flags & OBD_CONNECT_CANCELSET)
 308                 ns->ns_connect_flags |= OBD_CONNECT_CANCELSET;
 309         return count;
 310 }
 311 LPROC_SEQ_FOPS(lprocfs_elc);
 312
 313 static void ldlm_namespace_proc_unregister(struct ldlm_namespace *ns)
 314 {
 315         if (ns->ns_proc_dir_entry == NULL)
 316                 CERROR("dlm namespace %s has no procfs dir?\n",
 317                        ldlm_ns_name(ns));
 318         else
 319                 lprocfs_remove(&ns->ns_proc_dir_entry);
 320
 321         if (ns->ns_stats != NULL)
 322                 lprocfs_free_stats(&ns->ns_stats);
 323 }
 324
 325 static int ldlm_namespace_proc_register(struct ldlm_namespace *ns)
 326 {
 327         struct lprocfs_vars lock_vars[2];
 328         char lock_name[MAX_STRING_SIZE + 1];
 329         struct proc_dir_entry *ns_pde;
 330
 331         LASSERT(ns != NULL);
 332         LASSERT(ns->ns_rs_hash != NULL);
 333
 334         if (ns->ns_proc_dir_entry != NULL) {
 335                 ns_pde = ns->ns_proc_dir_entry;
 336         } else {
 337                 ns_pde = proc_mkdir(ldlm_ns_name(ns), ldlm_ns_proc_dir);
 338                 if (ns_pde == NULL)
 339                         return -ENOMEM;
 340                 ns->ns_proc_dir_entry = ns_pde;
 341         }
 342
 343         ns->ns_stats = lprocfs_alloc_stats(LDLM_NSS_LAST, 0);
 344         if (ns->ns_stats == NULL)
 345                 return -ENOMEM;
 346
 347         lprocfs_counter_init(ns->ns_stats, LDLM_NSS_LOCKS,
 348                              LPROCFS_CNTR_AVGMINMAX, "locks", "locks");
 349
 350         lock_name[MAX_STRING_SIZE] = '\0';
 351
 352         memset(lock_vars, 0, sizeof(lock_vars));
 353         lock_vars[0].name = lock_name;
 354
 355         ldlm_add_var(&lock_vars[0], ns_pde, "resource_count", ns,
 356                      &lprocfs_ns_resources_fops);
 357         ldlm_add_var(&lock_vars[0], ns_pde, "lock_count", ns,
 358                      &lprocfs_ns_locks_fops);
 359
 360         if (ns_is_client(ns)) {
 361                 ldlm_add_var(&lock_vars[0], ns_pde, "lock_unused_count",
 362                              &ns->ns_nr_unused, &ldlm_uint_fops);
 363                 ldlm_add_var(&lock_vars[0], ns_pde, "lru_size", ns,
 364                              &lprocfs_lru_size_fops);
 365                 ldlm_add_var(&lock_vars[0], ns_pde, "lru_max_age",
 366                              &ns->ns_max_age, &ldlm_rw_uint_fops);
 367                 ldlm_add_var(&lock_vars[0], ns_pde, "early_lock_cancel",
 368                              ns, &lprocfs_elc_fops);
 369         } else {
 370                 ldlm_add_var(&lock_vars[0], ns_pde, "ctime_age_limit",
 371                              &ns->ns_ctime_age_limit, &ldlm_rw_uint_fops);
 372                 ldlm_add_var(&lock_vars[0], ns_pde, "lock_timeouts",
 373                              &ns->ns_timeouts, &ldlm_uint_fops);
 374                 ldlm_add_var(&lock_vars[0], ns_pde, "max_nolock_bytes",
 375                              &ns->ns_max_nolock_size, &ldlm_rw_uint_fops);
 376                 ldlm_add_var(&lock_vars[0], ns_pde, "contention_seconds",
 377                              &ns->ns_contention_time, &ldlm_rw_uint_fops);
 378                 ldlm_add_var(&lock_vars[0], ns_pde, "contended_locks",
 379                              &ns->ns_contended_locks, &ldlm_rw_uint_fops);
 380                 ldlm_add_var(&lock_vars[0], ns_pde, "max_parallel_ast",
 381                              &ns->ns_max_parallel_ast, &ldlm_rw_uint_fops);
 382         }
 383         return 0;
 384 }
 385 #undef MAX_STRING_SIZE
 386 #else /* CONFIG_PROC_FS */
 387
 388 #define ldlm_namespace_proc_unregister(ns)      ({;})
 389 #define ldlm_namespace_proc_register(ns)        ({0;})
 390
 391 #endif /* CONFIG_PROC_FS */
 392
 393 static unsigned ldlm_res_hop_hash(cfs_hash_t *hs,
 394                                   const void *key, unsigned mask)
 395 {
 396         const struct ldlm_res_id     *id  = key;
 397         unsigned                val = 0;
 398         unsigned                i;
 399
 400         for (i = 0; i < RES_NAME_SIZE; i++)
 401                 val += id->name[i];
 402         return val & mask;
 403 }
 404
 405 static unsigned ldlm_res_hop_fid_hash(cfs_hash_t *hs,
 406                                       const void *key, unsigned mask)
 407 {
 408         const struct ldlm_res_id *id = key;
 409         struct lu_fid       fid;
 410         __u32               hash;
 411         __u32               val;
 412
 413         fid.f_seq = id->name[LUSTRE_RES_ID_SEQ_OFF];
 414         fid.f_oid = (__u32)id->name[LUSTRE_RES_ID_VER_OID_OFF];
 415         fid.f_ver = (__u32)(id->name[LUSTRE_RES_ID_VER_OID_OFF] >> 32);
 416
 417         hash = fid_flatten32(&fid);
 418         hash += (hash >> 4) + (hash << 12); /* mixing oid and seq */
 419         if (id->name[LUSTRE_RES_ID_HSH_OFF] != 0) {
 420                 val = id->name[LUSTRE_RES_ID_HSH_OFF];
 421                 hash += (val >> 5) + (val << 11);
 422         } else {
 423                 val = fid_oid(&fid);
 424         }
 425         hash = hash_long(hash, hs->hs_bkt_bits);
 426         /* give me another random factor */
 427         hash -= hash_long((unsigned long)hs, val % 11 + 3);
 428
 429         hash <<= hs->hs_cur_bits - hs->hs_bkt_bits;
 430         hash |= ldlm_res_hop_hash(hs, key, CFS_HASH_NBKT(hs) - 1);
 431
 432         return hash & mask;
 433 }
 434
 435 static void *ldlm_res_hop_key(struct hlist_node *hnode)
 436 {
 437         struct ldlm_resource   *res;
 438
 439         res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
 440         return &res->lr_name;
 441 }
 442
 443 static int ldlm_res_hop_keycmp(const void *key, struct hlist_node *hnode)
 444 {
 445         struct ldlm_resource   *res;
 446
 447         res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
 448         return ldlm_res_eq((const struct ldlm_res_id *)key,
 449                            (const struct ldlm_res_id *)&res->lr_name);
 450 }
 451
 452 static void *ldlm_res_hop_object(struct hlist_node *hnode)
 453 {
 454         return hlist_entry(hnode, struct ldlm_resource, lr_hash);
 455 }
 456
 457 static void ldlm_res_hop_get_locked(cfs_hash_t *hs, struct hlist_node *hnode)
 458 {
 459         struct ldlm_resource *res;
 460
 461         res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
 462         ldlm_resource_getref(res);
 463 }
 464
 465 static void ldlm_res_hop_put_locked(cfs_hash_t *hs, struct hlist_node *hnode)
 466 {
 467         struct ldlm_resource *res;
 468
 469         res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
 470         /* cfs_hash_for_each_nolock is the only chance we call it */
 471         ldlm_resource_putref_locked(res);
 472 }
 473
 474 static void ldlm_res_hop_put(cfs_hash_t *hs, struct hlist_node *hnode)
 475 {
 476         struct ldlm_resource *res;
 477
 478         res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
 479         ldlm_resource_putref(res);
 480 }
 481
 482 static cfs_hash_ops_t ldlm_ns_hash_ops = {
 483         .hs_hash        = ldlm_res_hop_hash,
 484         .hs_key         = ldlm_res_hop_key,
 485         .hs_keycmp      = ldlm_res_hop_keycmp,
 486         .hs_keycpy      = NULL,
 487         .hs_object      = ldlm_res_hop_object,
 488         .hs_get         = ldlm_res_hop_get_locked,
 489         .hs_put_locked  = ldlm_res_hop_put_locked,
 490         .hs_put         = ldlm_res_hop_put
 491 };
 492
 493 static cfs_hash_ops_t ldlm_ns_fid_hash_ops = {
 494         .hs_hash        = ldlm_res_hop_fid_hash,
 495         .hs_key         = ldlm_res_hop_key,
 496         .hs_keycmp      = ldlm_res_hop_keycmp,
 497         .hs_keycpy      = NULL,
 498         .hs_object      = ldlm_res_hop_object,
 499         .hs_get         = ldlm_res_hop_get_locked,
 500         .hs_put_locked  = ldlm_res_hop_put_locked,
 501         .hs_put         = ldlm_res_hop_put
 502 };
 503
 504 typedef struct {
 505         ldlm_ns_type_t  nsd_type;
 506         /** hash bucket bits */
 507         unsigned        nsd_bkt_bits;
 508         /** hash bits */
 509         unsigned        nsd_all_bits;
 510         /** hash operations */
 511         cfs_hash_ops_t *nsd_hops;
 512 } ldlm_ns_hash_def_t;
 513
 514 static ldlm_ns_hash_def_t ldlm_ns_hash_defs[] =
 515 {
 516         {
 517                 .nsd_type       = LDLM_NS_TYPE_MDC,
 518                 .nsd_bkt_bits   = 11,
 519                 .nsd_all_bits   = 16,
 520                 .nsd_hops       = &ldlm_ns_fid_hash_ops,
 521         },
 522         {
 523                 .nsd_type       = LDLM_NS_TYPE_MDT,
 524                 .nsd_bkt_bits   = 14,
 525                 .nsd_all_bits   = 21,
 526                 .nsd_hops       = &ldlm_ns_fid_hash_ops,
 527         },
 528         {
 529                 .nsd_type       = LDLM_NS_TYPE_OSC,
 530                 .nsd_bkt_bits   = 8,
 531                 .nsd_all_bits   = 12,
 532                 .nsd_hops       = &ldlm_ns_hash_ops,
 533         },
 534         {
 535                 .nsd_type       = LDLM_NS_TYPE_OST,
 536                 .nsd_bkt_bits   = 11,
 537                 .nsd_all_bits   = 17,
 538                 .nsd_hops       = &ldlm_ns_hash_ops,
 539         },
 540         {
 541                 .nsd_type       = LDLM_NS_TYPE_MGC,
 542                 .nsd_bkt_bits   = 4,
 543                 .nsd_all_bits   = 4,
 544                 .nsd_hops       = &ldlm_ns_hash_ops,
 545         },
 546         {
 547                 .nsd_type       = LDLM_NS_TYPE_MGT,
 548                 .nsd_bkt_bits   = 4,
 549                 .nsd_all_bits   = 4,
 550                 .nsd_hops       = &ldlm_ns_hash_ops,
 551         },
 552         {
 553                 .nsd_type       = LDLM_NS_TYPE_UNKNOWN,
 554         },
 555 };
 556
 557 /**
 558  * Create and initialize new empty namespace.
 559  */
 560 struct ldlm_namespace *ldlm_namespace_new(struct obd_device *obd, char *name,
 561                                           ldlm_side_t client,
 562                                           ldlm_appetite_t apt,
 563                                           ldlm_ns_type_t ns_type)
 564 {
 565         struct ldlm_namespace *ns = NULL;
 566         struct ldlm_ns_bucket *nsb;
 567         ldlm_ns_hash_def_t    *nsd;
 568         cfs_hash_bd_t          bd;
 569         int                    idx;
 570         int                    rc;
 571         ENTRY;
 572
 573         LASSERT(obd != NULL);
 574
 575         rc = ldlm_get_ref();
 576         if (rc) {
 577                 CERROR("ldlm_get_ref failed: %d\n", rc);
 578                 RETURN(NULL);
 579         }
 580
 581         for (idx = 0;;idx++) {
 582                 nsd = &ldlm_ns_hash_defs[idx];
 583                 if (nsd->nsd_type == LDLM_NS_TYPE_UNKNOWN) {
 584                         CERROR("Unknown type %d for ns %s\n", ns_type, name);
 585                         GOTO(out_ref, NULL);
 586                 }
 587
 588                 if (nsd->nsd_type == ns_type)
 589                         break;
 590         }
 591
 592         OBD_ALLOC_PTR(ns);
 593         if (!ns)
 594                 GOTO(out_ref, NULL);
 595
 596         ns->ns_rs_hash = cfs_hash_create(name,
 597                                          nsd->nsd_all_bits, nsd->nsd_all_bits,
 598                                          nsd->nsd_bkt_bits, sizeof(*nsb),
 599                                          CFS_HASH_MIN_THETA,
 600                                          CFS_HASH_MAX_THETA,
 601                                          nsd->nsd_hops,
 602                                          CFS_HASH_DEPTH |
 603                                          CFS_HASH_BIGNAME |
 604                                          CFS_HASH_SPIN_BKTLOCK |
 605                                          CFS_HASH_NO_ITEMREF);
 606         if (ns->ns_rs_hash == NULL)
 607                 GOTO(out_ns, NULL);
 608
 609         cfs_hash_for_each_bucket(ns->ns_rs_hash, &bd, idx) {
 610                 nsb = cfs_hash_bd_extra_get(ns->ns_rs_hash, &bd);
 611                 at_init(&nsb->nsb_at_estimate, ldlm_enqueue_min, 0);
 612                 nsb->nsb_namespace = ns;
 613         }
 614
 615         ns->ns_obd      = obd;
 616         ns->ns_appetite = apt;
 617         ns->ns_client   = client;
 618
 619         INIT_LIST_HEAD(&ns->ns_list_chain);
 620         INIT_LIST_HEAD(&ns->ns_unused_list);
 621         spin_lock_init(&ns->ns_lock);
 622         atomic_set(&ns->ns_bref, 0);
 623         init_waitqueue_head(&ns->ns_waitq);
 624
 625         ns->ns_max_nolock_size    = NS_DEFAULT_MAX_NOLOCK_BYTES;
 626         ns->ns_contention_time    = NS_DEFAULT_CONTENTION_SECONDS;
 627         ns->ns_contended_locks    = NS_DEFAULT_CONTENDED_LOCKS;
 628
 629         ns->ns_max_parallel_ast   = LDLM_DEFAULT_PARALLEL_AST_LIMIT;
 630         ns->ns_nr_unused          = 0;
 631         ns->ns_max_unused         = LDLM_DEFAULT_LRU_SIZE;
 632         ns->ns_max_age            = LDLM_DEFAULT_MAX_ALIVE;
 633         ns->ns_ctime_age_limit    = LDLM_CTIME_AGE_LIMIT;
 634         ns->ns_timeouts           = 0;
 635         ns->ns_orig_connect_flags = 0;
 636         ns->ns_connect_flags      = 0;
 637         ns->ns_stopping           = 0;
 638         rc = ldlm_namespace_proc_register(ns);
 639         if (rc != 0) {
 640                 CERROR("Can't initialize ns proc, rc %d\n", rc);
 641                 GOTO(out_hash, rc);
 642         }
 643
 644         idx = ldlm_namespace_nr_read(client);
 645         rc = ldlm_pool_init(&ns->ns_pool, ns, idx, client);
 646         if (rc) {
 647                 CERROR("Can't initialize lock pool, rc %d\n", rc);
 648                 GOTO(out_proc, rc);
 649         }
 650
 651         ldlm_namespace_register(ns, client);
 652         RETURN(ns);
 653 out_proc:
 654         ldlm_namespace_proc_unregister(ns);
 655         ldlm_namespace_cleanup(ns, 0);
 656 out_hash:
 657         cfs_hash_putref(ns->ns_rs_hash);
 658 out_ns:
 659         OBD_FREE_PTR(ns);
 660 out_ref:
 661         ldlm_put_ref();
 662         RETURN(NULL);
 663 }
 664 EXPORT_SYMBOL(ldlm_namespace_new);
 665
 666 extern struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock);
 667
 668 /**
 669  * Cancel and destroy all locks on a resource.
 670  *
 671  * If flags contains FL_LOCAL_ONLY, don't try to tell the server, just
 672  * clean up.  This is currently only used for recovery, and we make
 673  * certain assumptions as a result--notably, that we shouldn't cancel
 674  * locks with refs.
 675  */
 676 static void cleanup_resource(struct ldlm_resource *res, struct list_head *q,
 677                              __u64 flags)
 678 {
 679         struct list_head *tmp;
 680         int rc = 0, client = ns_is_client(ldlm_res_to_ns(res));
 681         bool local_only = !!(flags & LDLM_FL_LOCAL_ONLY);
 682
 683         do {
 684                 struct ldlm_lock *lock = NULL;
 685
 686                 /* First, we look for non-cleaned-yet lock
 687                  * all cleaned locks are marked by CLEANED flag. */
 688                 lock_res(res);
 689                 list_for_each(tmp, q) {
 690                         lock = list_entry(tmp, struct ldlm_lock,
 691                                           l_res_link);
 692                         if (ldlm_is_cleaned(lock)) {
 693                                 lock = NULL;
 694                                 continue;
 695                         }
 696                         LDLM_LOCK_GET(lock);
 697                         ldlm_set_cleaned(lock);
 698                         break;
 699                 }
 700
 701                 if (lock == NULL) {
 702                         unlock_res(res);
 703                         break;
 704                 }
 705
 706                 /* Set CBPENDING so nothing in the cancellation path
 707                  * can match this lock. */
 708                 ldlm_set_cbpending(lock);
 709                 ldlm_set_failed(lock);
 710                 lock->l_flags |= flags;
 711
 712                 /* ... without sending a CANCEL message for local_only. */
 713                 if (local_only)
 714                         ldlm_set_local_only(lock);
 715
 716                 if (local_only && (lock->l_readers || lock->l_writers)) {
 717                         /* This is a little bit gross, but much better than the
 718                          * alternative: pretend that we got a blocking AST from
 719                          * the server, so that when the lock is decref'd, it
 720                          * will go away ... */
 721                         unlock_res(res);
 722                         LDLM_DEBUG(lock, "setting FL_LOCAL_ONLY");
 723                         if (lock->l_flags & LDLM_FL_FAIL_LOC) {
 724                                 set_current_state(TASK_UNINTERRUPTIBLE);
 725                                 schedule_timeout(cfs_time_seconds(4));
 726                                 set_current_state(TASK_RUNNING);
 727                         }
 728                         if (lock->l_completion_ast)
 729                                 lock->l_completion_ast(lock,
 730                                                        LDLM_FL_FAILED, NULL);
 731                         LDLM_LOCK_RELEASE(lock);
 732                         continue;
 733                 }
 734
 735                 if (client) {
 736                         struct lustre_handle lockh;
 737
 738                         unlock_res(res);
 739                         ldlm_lock2handle(lock, &lockh);
 740                         rc = ldlm_cli_cancel(&lockh, LCF_ASYNC);
 741                         if (rc)
 742                                 CERROR("ldlm_cli_cancel: %d\n", rc);
 743                 } else {
 744                         ldlm_resource_unlink_lock(lock);
 745                         unlock_res(res);
 746                         LDLM_DEBUG(lock, "Freeing a lock still held by a "
 747                                    "client node");
 748                         ldlm_lock_destroy(lock);
 749                 }
 750                 LDLM_LOCK_RELEASE(lock);
 751         } while (1);
 752 }
 753
 754 static int ldlm_resource_clean(cfs_hash_t *hs, cfs_hash_bd_t *bd,
 755                                struct hlist_node *hnode, void *arg)
 756 {
 757         struct ldlm_resource *res = cfs_hash_object(hs, hnode);
 758         __u64 flags = *(__u64 *)arg;
 759
 760         cleanup_resource(res, &res->lr_granted, flags);
 761         cleanup_resource(res, &res->lr_converting, flags);
 762         cleanup_resource(res, &res->lr_waiting, flags);
 763
 764         return 0;
 765 }
 766
 767 static int ldlm_resource_complain(cfs_hash_t *hs, cfs_hash_bd_t *bd,
 768                                   struct hlist_node *hnode, void *arg)
 769 {
 770         struct ldlm_resource  *res = cfs_hash_object(hs, hnode);
 771
 772         lock_res(res);
 773         CERROR("%s: namespace resource "DLDLMRES" (%p) refcount nonzero "
 774                "(%d) after lock cleanup; forcing cleanup.\n",
 775                ldlm_ns_name(ldlm_res_to_ns(res)), PLDLMRES(res), res,
 776                atomic_read(&res->lr_refcount) - 1);
 777
 778         ldlm_resource_dump(D_ERROR, res);
 779         unlock_res(res);
 780         return 0;
 781 }
 782
 783 /**
 784  * Cancel and destroy all locks in the namespace.
 785  *
 786  * Typically used during evictions when server notified client that it was
 787  * evicted and all of its state needs to be destroyed.
 788  * Also used during shutdown.
 789  */
 790 int ldlm_namespace_cleanup(struct ldlm_namespace *ns, __u64 flags)
 791 {
 792         if (ns == NULL) {
 793                 CDEBUG(D_INFO, "NULL ns, skipping cleanup\n");
 794                 return ELDLM_OK;
 795         }
 796
 797         cfs_hash_for_each_nolock(ns->ns_rs_hash, ldlm_resource_clean, &flags);
 798         cfs_hash_for_each_nolock(ns->ns_rs_hash, ldlm_resource_complain, NULL);
 799         return ELDLM_OK;
 800 }
 801 EXPORT_SYMBOL(ldlm_namespace_cleanup);
 802
 803 /**
 804  * Attempts to free namespace.
 805  *
 806  * Only used when namespace goes away, like during an unmount.
 807  */
 808 static int __ldlm_namespace_free(struct ldlm_namespace *ns, int force)
 809 {
 810         ENTRY;
 811
 812         /* At shutdown time, don't call the cancellation callback */
 813         ldlm_namespace_cleanup(ns, force ? LDLM_FL_LOCAL_ONLY : 0);
 814
 815         if (atomic_read(&ns->ns_bref) > 0) {
 816                 struct l_wait_info lwi = LWI_INTR(LWI_ON_SIGNAL_NOOP, NULL);
 817                 int rc;
 818                 CDEBUG(D_DLMTRACE,
 819                        "dlm namespace %s free waiting on refcount %d\n",
 820                        ldlm_ns_name(ns), atomic_read(&ns->ns_bref));
 821 force_wait:
 822                 if (force)
 823                         lwi = LWI_TIMEOUT(msecs_to_jiffies(obd_timeout *
 824                                           MSEC_PER_SEC) / 4, NULL, NULL);
 825
 826                 rc = l_wait_event(ns->ns_waitq,
 827                                   atomic_read(&ns->ns_bref) == 0, &lwi);
 828
 829                 /* Forced cleanups should be able to reclaim all references,
 830                  * so it's safe to wait forever... we can't leak locks... */
 831                 if (force && rc == -ETIMEDOUT) {
 832                         LCONSOLE_ERROR("Forced cleanup waiting for %s "
 833                                        "namespace with %d resources in use, "
 834                                        "(rc=%d)\n", ldlm_ns_name(ns),
 835                                        atomic_read(&ns->ns_bref), rc);
 836                         GOTO(force_wait, rc);
 837                 }
 838
 839                 if (atomic_read(&ns->ns_bref)) {
 840                         LCONSOLE_ERROR("Cleanup waiting for %s namespace "
 841                                        "with %d resources in use, (rc=%d)\n",
 842                                        ldlm_ns_name(ns),
 843                                        atomic_read(&ns->ns_bref), rc);
 844                         RETURN(ELDLM_NAMESPACE_EXISTS);
 845                 }
 846                 CDEBUG(D_DLMTRACE, "dlm namespace %s free done waiting\n",
 847                        ldlm_ns_name(ns));
 848         }
 849
 850         RETURN(ELDLM_OK);
 851 }
 852
 853 /**
 854  * Performs various cleanups for passed \a ns to make it drop refc and be
 855  * ready for freeing. Waits for refc == 0.
 856  *
 857  * The following is done:
 858  * (0) Unregister \a ns from its list to make inaccessible for potential
 859  * users like pools thread and others;
 860  * (1) Clear all locks in \a ns.
 861  */
 862 void ldlm_namespace_free_prior(struct ldlm_namespace *ns,
 863                                struct obd_import *imp,
 864                                int force)
 865 {
 866         int rc;
 867         ENTRY;
 868         if (!ns) {
 869                 EXIT;
 870                 return;
 871         }
 872
 873         spin_lock(&ns->ns_lock);
 874         ns->ns_stopping = 1;
 875         spin_unlock(&ns->ns_lock);
 876
 877         /*
 878          * Can fail with -EINTR when force == 0 in which case try harder.
 879          */
 880         rc = __ldlm_namespace_free(ns, force);
 881         if (rc != ELDLM_OK) {
 882                 if (imp) {
 883                         ptlrpc_disconnect_import(imp, 0);
 884                         ptlrpc_invalidate_import(imp);
 885                 }
 886
 887                 /*
 888                  * With all requests dropped and the import inactive
 889                  * we are gaurenteed all reference will be dropped.
 890                  */
 891                 rc = __ldlm_namespace_free(ns, 1);
 892                 LASSERT(rc == 0);
 893         }
 894         EXIT;
 895 }
 896
 897 /**
 898  * Performs freeing memory structures related to \a ns. This is only done
 899  * when ldlm_namespce_free_prior() successfully removed all resources
 900  * referencing \a ns and its refc == 0.
 901  */
 902 void ldlm_namespace_free_post(struct ldlm_namespace *ns)
 903 {
 904         ENTRY;
 905         if (!ns) {
 906                 EXIT;
 907                 return;
 908         }
 909
 910         /* Make sure that nobody can find this ns in its list. */
 911         ldlm_namespace_unregister(ns, ns->ns_client);
 912         /* Fini pool _before_ parent proc dir is removed. This is important as
 913          * ldlm_pool_fini() removes own proc dir which is child to @dir.
 914          * Removing it after @dir may cause oops. */
 915         ldlm_pool_fini(&ns->ns_pool);
 916
 917         ldlm_namespace_proc_unregister(ns);
 918         cfs_hash_putref(ns->ns_rs_hash);
 919         /* Namespace \a ns should be not on list at this time, otherwise
 920          * this will cause issues related to using freed \a ns in poold
 921          * thread. */
 922         LASSERT(list_empty(&ns->ns_list_chain));
 923         OBD_FREE_PTR(ns);
 924         ldlm_put_ref();
 925         EXIT;
 926 }
 927
 928 /**
 929  * Cleanup the resource, and free namespace.
 930  * bug 12864:
 931  * Deadlock issue:
 932  * proc1: destroy import
 933  *        class_disconnect_export(grab cl_sem) ->
 934  *              -> ldlm_namespace_free ->
 935  *              -> lprocfs_remove(grab _lprocfs_lock).
 936  * proc2: read proc info
 937  *        lprocfs_fops_read(grab _lprocfs_lock) ->
 938  *              -> osc_rd_active, etc(grab cl_sem).
 939  *
 940  * So that I have to split the ldlm_namespace_free into two parts - the first
 941  * part ldlm_namespace_free_prior is used to cleanup the resource which is
 942  * being used; the 2nd part ldlm_namespace_free_post is used to unregister the
 943  * lprocfs entries, and then free memory. It will be called w/o cli->cl_sem
 944  * held.
 945  */
 946 void ldlm_namespace_free(struct ldlm_namespace *ns,
 947                          struct obd_import *imp,
 948                          int force)
 949 {
 950         ldlm_namespace_free_prior(ns, imp, force);
 951         ldlm_namespace_free_post(ns);
 952 }
 953 EXPORT_SYMBOL(ldlm_namespace_free);
 954
 955 void ldlm_namespace_get(struct ldlm_namespace *ns)
 956 {
 957         atomic_inc(&ns->ns_bref);
 958 }
 959
 960 /* This is only for callers that care about refcount */
 961 static int ldlm_namespace_get_return(struct ldlm_namespace *ns)
 962 {
 963         return atomic_inc_return(&ns->ns_bref);
 964 }
 965
 966 void ldlm_namespace_put(struct ldlm_namespace *ns)
 967 {
 968         if (atomic_dec_and_lock(&ns->ns_bref, &ns->ns_lock)) {
 969                 wake_up(&ns->ns_waitq);
 970                 spin_unlock(&ns->ns_lock);
 971         }
 972 }
 973
 974 /** Register \a ns in the list of namespaces */
 975 void ldlm_namespace_register(struct ldlm_namespace *ns, ldlm_side_t client)
 976 {
 977         mutex_lock(ldlm_namespace_lock(client));
 978         LASSERT(list_empty(&ns->ns_list_chain));
 979         list_add(&ns->ns_list_chain, ldlm_namespace_inactive_list(client));
 980         ldlm_namespace_nr_inc(client);
 981         mutex_unlock(ldlm_namespace_lock(client));
 982 }
 983
 984 /** Unregister \a ns from the list of namespaces. */
 985 void ldlm_namespace_unregister(struct ldlm_namespace *ns, ldlm_side_t client)
 986 {
 987         mutex_lock(ldlm_namespace_lock(client));
 988         LASSERT(!list_empty(&ns->ns_list_chain));
 989         /* Some asserts and possibly other parts of the code are still
 990          * using list_empty(&ns->ns_list_chain). This is why it is
 991          * important to use list_del_init() here. */
 992         list_del_init(&ns->ns_list_chain);
 993         ldlm_namespace_nr_dec(client);
 994         mutex_unlock(ldlm_namespace_lock(client));
 995 }
 996
 997 /** Should be called with ldlm_namespace_lock(client) taken. */
 998 void ldlm_namespace_move_to_active_locked(struct ldlm_namespace *ns,
 999                                        ldlm_side_t client)
1000 {
1001         LASSERT(!list_empty(&ns->ns_list_chain));
1002         LASSERT(mutex_is_locked(ldlm_namespace_lock(client)));
1003         list_move_tail(&ns->ns_list_chain, ldlm_namespace_list(client));
1004 }
1005
1006 /** Should be called with ldlm_namespace_lock(client) taken. */
1007 void ldlm_namespace_move_to_inactive_locked(struct ldlm_namespace *ns,
1008                                          ldlm_side_t client)
1009 {
1010         LASSERT(!list_empty(&ns->ns_list_chain));
1011         LASSERT(mutex_is_locked(ldlm_namespace_lock(client)));
1012         list_move_tail(&ns->ns_list_chain,
1013                        ldlm_namespace_inactive_list(client));
1014 }
1015
1016 /** Should be called with ldlm_namespace_lock(client) taken. */
1017 struct ldlm_namespace *ldlm_namespace_first_locked(ldlm_side_t client)
1018 {
1019         LASSERT(mutex_is_locked(ldlm_namespace_lock(client)));
1020         LASSERT(!list_empty(ldlm_namespace_list(client)));
1021         return container_of(ldlm_namespace_list(client)->next,
1022                             struct ldlm_namespace, ns_list_chain);
1023 }
1024
1025 /** Create and initialize new resource. */
1026 static struct ldlm_resource *ldlm_resource_new(void)
1027 {
1028         struct ldlm_resource *res;
1029         int idx;
1030
1031         OBD_SLAB_ALLOC_PTR_GFP(res, ldlm_resource_slab, GFP_NOFS);
1032         if (res == NULL)
1033                 return NULL;
1034
1035         INIT_LIST_HEAD(&res->lr_granted);
1036         INIT_LIST_HEAD(&res->lr_converting);
1037         INIT_LIST_HEAD(&res->lr_waiting);
1038
1039         /* Initialize interval trees for each lock mode. */
1040         for (idx = 0; idx < LCK_MODE_NUM; idx++) {
1041                 res->lr_itree[idx].lit_size = 0;
1042                 res->lr_itree[idx].lit_mode = 1 << idx;
1043                 res->lr_itree[idx].lit_root = NULL;
1044         }
1045
1046         atomic_set(&res->lr_refcount, 1);
1047         spin_lock_init(&res->lr_lock);
1048         lu_ref_init(&res->lr_reference);
1049
1050         /* Since LVB init can be delayed now, there is no longer need to
1051          * immediatelly acquire mutex here. */
1052         mutex_init(&res->lr_lvb_mutex);
1053         res->lr_lvb_initialized = false;
1054
1055         return res;
1056 }
1057
1058 /**
1059  * Return a reference to resource with given name, creating it if necessary.
1060  * Args: namespace with ns_lock unlocked
1061  * Locks: takes and releases NS hash-lock and res->lr_lock
1062  * Returns: referenced, unlocked ldlm_resource or NULL
1063  */
1064 struct ldlm_resource *
1065 ldlm_resource_get(struct ldlm_namespace *ns, struct ldlm_resource *parent,
1066                   const struct ldlm_res_id *name, ldlm_type_t type, int create)
1067 {
1068         struct hlist_node       *hnode;
1069         struct ldlm_resource    *res = NULL;
1070         cfs_hash_bd_t           bd;
1071         __u64                   version;
1072         int                     ns_refcount = 0;
1073
1074         LASSERT(ns != NULL);
1075         LASSERT(parent == NULL);
1076         LASSERT(ns->ns_rs_hash != NULL);
1077         LASSERT(name->name[0] != 0);
1078
1079         cfs_hash_bd_get_and_lock(ns->ns_rs_hash, (void *)name, &bd, 0);
1080         hnode = cfs_hash_bd_lookup_locked(ns->ns_rs_hash, &bd, (void *)name);
1081         if (hnode != NULL) {
1082                 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 0);
1083                 GOTO(found, res);
1084         }
1085
1086         version = cfs_hash_bd_version_get(&bd);
1087         cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 0);
1088
1089         if (create == 0)
1090                 return ERR_PTR(-ENOENT);
1091
1092         LASSERTF(type >= LDLM_MIN_TYPE && type < LDLM_MAX_TYPE,
1093                  "type: %d\n", type);
1094         res = ldlm_resource_new();
1095         if (res == NULL)
1096                 return ERR_PTR(-ENOMEM);
1097
1098         res->lr_ns_bucket  = cfs_hash_bd_extra_get(ns->ns_rs_hash, &bd);
1099         res->lr_name       = *name;
1100         res->lr_type       = type;
1101         res->lr_most_restr = LCK_NL;
1102
1103         cfs_hash_bd_lock(ns->ns_rs_hash, &bd, 1);
1104         hnode = (version == cfs_hash_bd_version_get(&bd)) ? NULL :
1105                 cfs_hash_bd_lookup_locked(ns->ns_rs_hash, &bd, (void *)name);
1106
1107         if (hnode != NULL) {
1108                 /* Someone won the race and already added the resource. */
1109                 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
1110                 /* Clean lu_ref for failed resource. */
1111                 lu_ref_fini(&res->lr_reference);
1112                 OBD_SLAB_FREE(res, ldlm_resource_slab, sizeof *res);
1113 found:
1114                 res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
1115                 return res;
1116         }
1117         /* We won! Let's add the resource. */
1118         cfs_hash_bd_add_locked(ns->ns_rs_hash, &bd, &res->lr_hash);
1119         if (cfs_hash_bd_count_get(&bd) == 1)
1120                 ns_refcount = ldlm_namespace_get_return(ns);
1121
1122         cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
1123
1124         OBD_FAIL_TIMEOUT(OBD_FAIL_LDLM_CREATE_RESOURCE, 2);
1125
1126         /* Let's see if we happened to be the very first resource in this
1127          * namespace. If so, and this is a client namespace, we need to move
1128          * the namespace into the active namespaces list to be patrolled by
1129          * the ldlm_poold. */
1130         if (ns_is_client(ns) && ns_refcount == 1) {
1131                 mutex_lock(ldlm_namespace_lock(LDLM_NAMESPACE_CLIENT));
1132                 ldlm_namespace_move_to_active_locked(ns, LDLM_NAMESPACE_CLIENT);
1133                 mutex_unlock(ldlm_namespace_lock(LDLM_NAMESPACE_CLIENT));
1134         }
1135
1136         return res;
1137 }
1138 EXPORT_SYMBOL(ldlm_resource_get);
1139
1140 struct ldlm_resource *ldlm_resource_getref(struct ldlm_resource *res)
1141 {
1142         LASSERT(res != NULL);
1143         LASSERT(res != LP_POISON);
1144         atomic_inc(&res->lr_refcount);
1145         CDEBUG(D_INFO, "getref res: %p count: %d\n", res,
1146                atomic_read(&res->lr_refcount));
1147         return res;
1148 }
1149
1150 static void __ldlm_resource_putref_final(cfs_hash_bd_t *bd,
1151                                          struct ldlm_resource *res)
1152 {
1153         struct ldlm_ns_bucket *nsb = res->lr_ns_bucket;
1154
1155         if (!list_empty(&res->lr_granted)) {
1156                 ldlm_resource_dump(D_ERROR, res);
1157                 LBUG();
1158         }
1159
1160         if (!list_empty(&res->lr_converting)) {
1161                 ldlm_resource_dump(D_ERROR, res);
1162                 LBUG();
1163         }
1164
1165         if (!list_empty(&res->lr_waiting)) {
1166                 ldlm_resource_dump(D_ERROR, res);
1167                 LBUG();
1168         }
1169
1170         cfs_hash_bd_del_locked(nsb->nsb_namespace->ns_rs_hash,
1171                                bd, &res->lr_hash);
1172         lu_ref_fini(&res->lr_reference);
1173         if (cfs_hash_bd_count_get(bd) == 0)
1174                 ldlm_namespace_put(nsb->nsb_namespace);
1175 }
1176
1177 /* Returns 1 if the resource was freed, 0 if it remains. */
1178 int ldlm_resource_putref(struct ldlm_resource *res)
1179 {
1180         struct ldlm_namespace *ns = ldlm_res_to_ns(res);
1181         cfs_hash_bd_t   bd;
1182
1183         LASSERT_ATOMIC_GT_LT(&res->lr_refcount, 0, LI_POISON);
1184         CDEBUG(D_INFO, "putref res: %p count: %d\n",
1185                res, atomic_read(&res->lr_refcount) - 1);
1186
1187         cfs_hash_bd_get(ns->ns_rs_hash, &res->lr_name, &bd);
1188         if (cfs_hash_bd_dec_and_lock(ns->ns_rs_hash, &bd, &res->lr_refcount)) {
1189                 __ldlm_resource_putref_final(&bd, res);
1190                 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
1191                 if (ns->ns_lvbo && ns->ns_lvbo->lvbo_free)
1192                         ns->ns_lvbo->lvbo_free(res);
1193                 OBD_SLAB_FREE(res, ldlm_resource_slab, sizeof *res);
1194                 return 1;
1195         }
1196         return 0;
1197 }
1198 EXPORT_SYMBOL(ldlm_resource_putref);
1199
1200 /* Returns 1 if the resource was freed, 0 if it remains. */
1201 int ldlm_resource_putref_locked(struct ldlm_resource *res)
1202 {
1203         struct ldlm_namespace *ns = ldlm_res_to_ns(res);
1204
1205         LASSERT_ATOMIC_GT_LT(&res->lr_refcount, 0, LI_POISON);
1206         CDEBUG(D_INFO, "putref res: %p count: %d\n",
1207                res, atomic_read(&res->lr_refcount) - 1);
1208
1209         if (atomic_dec_and_test(&res->lr_refcount)) {
1210                 cfs_hash_bd_t bd;
1211
1212                 cfs_hash_bd_get(ldlm_res_to_ns(res)->ns_rs_hash,
1213                                 &res->lr_name, &bd);
1214                 __ldlm_resource_putref_final(&bd, res);
1215                 cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
1216                 /* NB: ns_rs_hash is created with CFS_HASH_NO_ITEMREF,
1217                  * so we should never be here while calling cfs_hash_del,
1218                  * cfs_hash_for_each_nolock is the only case we can get
1219                  * here, which is safe to release cfs_hash_bd_lock.
1220                  */
1221                 if (ns->ns_lvbo && ns->ns_lvbo->lvbo_free)
1222                         ns->ns_lvbo->lvbo_free(res);
1223                 OBD_SLAB_FREE(res, ldlm_resource_slab, sizeof *res);
1224
1225                 cfs_hash_bd_lock(ns->ns_rs_hash, &bd, 1);
1226                 return 1;
1227         }
1228         return 0;
1229 }
1230
1231 /**
1232  * Add a lock into a given resource into specified lock list.
1233  */
1234 void ldlm_resource_add_lock(struct ldlm_resource *res, struct list_head *head,
1235                             struct ldlm_lock *lock)
1236 {
1237         check_res_locked(res);
1238
1239         LDLM_DEBUG(lock, "About to add this lock:\n");
1240
1241         if (ldlm_is_destroyed(lock)) {
1242                 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
1243                 return;
1244         }
1245
1246         LASSERT(list_empty(&lock->l_res_link));
1247
1248         list_add_tail(&lock->l_res_link, head);
1249 }
1250
1251 /**
1252  * Insert a lock into resource after specified lock.
1253  *
1254  * Obtain resource description from the lock we are inserting after.
1255  */
1256 void ldlm_resource_insert_lock_after(struct ldlm_lock *original,
1257                                      struct ldlm_lock *new)
1258 {
1259         struct ldlm_resource *res = original->l_resource;
1260
1261         check_res_locked(res);
1262
1263         ldlm_resource_dump(D_INFO, res);
1264         LDLM_DEBUG(new, "About to insert this lock after %p:\n", original);
1265
1266         if (ldlm_is_destroyed(new)) {
1267                 CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
1268                 goto out;
1269         }
1270
1271         LASSERT(list_empty(&new->l_res_link));
1272
1273         list_add(&new->l_res_link, &original->l_res_link);
1274  out:;
1275 }
1276
1277 void ldlm_resource_unlink_lock(struct ldlm_lock *lock)
1278 {
1279         int type = lock->l_resource->lr_type;
1280
1281         check_res_locked(lock->l_resource);
1282         if (type == LDLM_IBITS || type == LDLM_PLAIN)
1283                 ldlm_unlink_lock_skiplist(lock);
1284         else if (type == LDLM_EXTENT)
1285                 ldlm_extent_unlink_lock(lock);
1286         list_del_init(&lock->l_res_link);
1287 }
1288 EXPORT_SYMBOL(ldlm_resource_unlink_lock);
1289
1290 void ldlm_res2desc(struct ldlm_resource *res, struct ldlm_resource_desc *desc)
1291 {
1292         desc->lr_type = res->lr_type;
1293         desc->lr_name = res->lr_name;
1294 }
1295
1296 /**
1297  * Print information about all locks in all namespaces on this node to debug
1298  * log.
1299  */
1300 void ldlm_dump_all_namespaces(ldlm_side_t client, int level)
1301 {
1302         struct list_head *tmp;
1303
1304         if (!((libcfs_debug | D_ERROR) & level))
1305                 return;
1306
1307         mutex_lock(ldlm_namespace_lock(client));
1308
1309         list_for_each(tmp, ldlm_namespace_list(client)) {
1310                 struct ldlm_namespace *ns;
1311                 ns = list_entry(tmp, struct ldlm_namespace, ns_list_chain);
1312                 ldlm_namespace_dump(level, ns);
1313         }
1314
1315         mutex_unlock(ldlm_namespace_lock(client));
1316 }
1317
1318 static int ldlm_res_hash_dump(cfs_hash_t *hs, cfs_hash_bd_t *bd,
1319                               struct hlist_node *hnode, void *arg)
1320 {
1321         struct ldlm_resource *res = cfs_hash_object(hs, hnode);
1322         int    level = (int)(unsigned long)arg;
1323
1324         lock_res(res);
1325         ldlm_resource_dump(level, res);
1326         unlock_res(res);
1327
1328         return 0;
1329 }
1330
1331 /**
1332  * Print information about all locks in this namespace on this node to debug
1333  * log.
1334  */
1335 void ldlm_namespace_dump(int level, struct ldlm_namespace *ns)
1336 {
1337         if (!((libcfs_debug | D_ERROR) & level))
1338                 return;
1339
1340         CDEBUG(level, "--- Namespace: %s (rc: %d, side: %s)\n",
1341                ldlm_ns_name(ns), atomic_read(&ns->ns_bref),
1342                ns_is_client(ns) ? "client" : "server");
1343
1344         if (cfs_time_before(cfs_time_current(), ns->ns_next_dump))
1345                 return;
1346
1347         cfs_hash_for_each_nolock(ns->ns_rs_hash,
1348                                  ldlm_res_hash_dump,
1349                                  (void *)(unsigned long)level);
1350         spin_lock(&ns->ns_lock);
1351         ns->ns_next_dump = cfs_time_shift(10);
1352         spin_unlock(&ns->ns_lock);
1353 }
1354
1355 /**
1356  * Print information about all locks in this resource to debug log.
1357  */
1358 void ldlm_resource_dump(int level, struct ldlm_resource *res)
1359 {
1360         struct ldlm_lock *lock;
1361         unsigned int granted = 0;
1362
1363         CLASSERT(RES_NAME_SIZE == 4);
1364
1365         if (!((libcfs_debug | D_ERROR) & level))
1366                 return;
1367
1368         CDEBUG(level, "--- Resource: "DLDLMRES" (%p) refcount = %d\n",
1369                PLDLMRES(res), res, atomic_read(&res->lr_refcount));
1370
1371         if (!list_empty(&res->lr_granted)) {
1372                 CDEBUG(level, "Granted locks (in reverse order):\n");
1373                 list_for_each_entry_reverse(lock, &res->lr_granted,
1374                                                 l_res_link) {
1375                         LDLM_DEBUG_LIMIT(level, lock, "###");
1376                         if (!(level & D_CANTMASK) &&
1377                             ++granted > ldlm_dump_granted_max) {
1378                                 CDEBUG(level, "only dump %d granted locks to "
1379                                        "avoid DDOS.\n", granted);
1380                                 break;
1381                         }
1382                 }
1383         }
1384         if (!list_empty(&res->lr_converting)) {
1385                 CDEBUG(level, "Converting locks:\n");
1386                 list_for_each_entry(lock, &res->lr_converting, l_res_link)
1387                         LDLM_DEBUG_LIMIT(level, lock, "###");
1388         }
1389         if (!list_empty(&res->lr_waiting)) {
1390                 CDEBUG(level, "Waiting locks:\n");
1391                 list_for_each_entry(lock, &res->lr_waiting, l_res_link)
1392                         LDLM_DEBUG_LIMIT(level, lock, "###");
1393         }
1394 }
1395 EXPORT_SYMBOL(ldlm_resource_dump);