4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
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.
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).
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
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
27 * Copyright (c) 2002, 2010, Oracle and/or its affiliates. All rights reserved.
28 * Use is subject to license terms.
30 * Copyright (c) 2010, 2012, Intel Corporation.
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
36 * lustre/ldlm/ldlm_resource.c
38 * Author: Phil Schwan <phil@clusterfs.com>
39 * Author: Peter Braam <braam@clusterfs.com>
42 #define DEBUG_SUBSYSTEM S_LDLM
43 # include <lustre_dlm.h>
45 #include <lustre_fid.h>
46 #include <obd_class.h>
47 #include "ldlm_internal.h"
49 struct kmem_cache
*ldlm_resource_slab
, *ldlm_lock_slab
;
51 int ldlm_srv_namespace_nr
= 0;
52 int ldlm_cli_namespace_nr
= 0;
54 struct mutex ldlm_srv_namespace_lock
;
55 LIST_HEAD(ldlm_srv_namespace_list
);
57 struct mutex ldlm_cli_namespace_lock
;
58 /* Client Namespaces that have active resources in them.
59 * Once all resources go away, ldlm_poold moves such namespaces to the
61 LIST_HEAD(ldlm_cli_active_namespace_list
);
62 /* Client namespaces that don't have any locks in them */
63 LIST_HEAD(ldlm_cli_inactive_namespace_list
);
65 struct proc_dir_entry
*ldlm_type_proc_dir
= NULL
;
66 struct proc_dir_entry
*ldlm_ns_proc_dir
= NULL
;
67 struct proc_dir_entry
*ldlm_svc_proc_dir
= NULL
;
69 extern unsigned int ldlm_cancel_unused_locks_before_replay
;
71 /* during debug dump certain amount of granted locks for one resource to avoid
73 unsigned int ldlm_dump_granted_max
= 256;
76 static ssize_t
lprocfs_wr_dump_ns(struct file
*file
, const char *buffer
,
77 size_t count
, loff_t
*off
)
79 ldlm_dump_all_namespaces(LDLM_NAMESPACE_SERVER
, D_DLMTRACE
);
80 ldlm_dump_all_namespaces(LDLM_NAMESPACE_CLIENT
, D_DLMTRACE
);
83 LPROC_SEQ_FOPS_WR_ONLY(ldlm
, dump_ns
);
85 LPROC_SEQ_FOPS_RW_TYPE(ldlm_rw
, uint
);
86 LPROC_SEQ_FOPS_RO_TYPE(ldlm
, uint
);
88 int ldlm_proc_setup(void)
91 struct lprocfs_vars list
[] = {
92 { "dump_namespaces", &ldlm_dump_ns_fops
, NULL
, 0222 },
93 { "dump_granted_max", &ldlm_rw_uint_fops
,
94 &ldlm_dump_granted_max
},
95 { "cancel_unused_locks_before_replay", &ldlm_rw_uint_fops
,
96 &ldlm_cancel_unused_locks_before_replay
},
98 LASSERT(ldlm_ns_proc_dir
== NULL
);
100 ldlm_type_proc_dir
= lprocfs_register(OBD_LDLM_DEVICENAME
,
103 if (IS_ERR(ldlm_type_proc_dir
)) {
104 CERROR("LProcFS failed in ldlm-init\n");
105 rc
= PTR_ERR(ldlm_type_proc_dir
);
109 ldlm_ns_proc_dir
= lprocfs_register("namespaces",
112 if (IS_ERR(ldlm_ns_proc_dir
)) {
113 CERROR("LProcFS failed in ldlm-init\n");
114 rc
= PTR_ERR(ldlm_ns_proc_dir
);
118 ldlm_svc_proc_dir
= lprocfs_register("services",
121 if (IS_ERR(ldlm_svc_proc_dir
)) {
122 CERROR("LProcFS failed in ldlm-init\n");
123 rc
= PTR_ERR(ldlm_svc_proc_dir
);
127 rc
= lprocfs_add_vars(ldlm_type_proc_dir
, list
, NULL
);
132 lprocfs_remove(&ldlm_ns_proc_dir
);
134 lprocfs_remove(&ldlm_type_proc_dir
);
136 ldlm_svc_proc_dir
= NULL
;
137 ldlm_type_proc_dir
= NULL
;
138 ldlm_ns_proc_dir
= NULL
;
142 void ldlm_proc_cleanup(void)
144 if (ldlm_svc_proc_dir
)
145 lprocfs_remove(&ldlm_svc_proc_dir
);
147 if (ldlm_ns_proc_dir
)
148 lprocfs_remove(&ldlm_ns_proc_dir
);
150 if (ldlm_type_proc_dir
)
151 lprocfs_remove(&ldlm_type_proc_dir
);
153 ldlm_svc_proc_dir
= NULL
;
154 ldlm_type_proc_dir
= NULL
;
155 ldlm_ns_proc_dir
= NULL
;
158 static int lprocfs_ns_resources_seq_show(struct seq_file
*m
, void *v
)
160 struct ldlm_namespace
*ns
= m
->private;
162 struct cfs_hash_bd bd
;
165 /* result is not strictly consistent */
166 cfs_hash_for_each_bucket(ns
->ns_rs_hash
, &bd
, i
)
167 res
+= cfs_hash_bd_count_get(&bd
);
168 return lprocfs_rd_u64(m
, &res
);
170 LPROC_SEQ_FOPS_RO(lprocfs_ns_resources
);
172 static int lprocfs_ns_locks_seq_show(struct seq_file
*m
, void *v
)
174 struct ldlm_namespace
*ns
= m
->private;
177 locks
= lprocfs_stats_collector(ns
->ns_stats
, LDLM_NSS_LOCKS
,
178 LPROCFS_FIELDS_FLAGS_SUM
);
179 return lprocfs_rd_u64(m
, &locks
);
181 LPROC_SEQ_FOPS_RO(lprocfs_ns_locks
);
183 static int lprocfs_lru_size_seq_show(struct seq_file
*m
, void *v
)
185 struct ldlm_namespace
*ns
= m
->private;
186 __u32
*nr
= &ns
->ns_max_unused
;
188 if (ns_connect_lru_resize(ns
))
189 nr
= &ns
->ns_nr_unused
;
190 return lprocfs_rd_uint(m
, nr
);
193 static ssize_t
lprocfs_lru_size_seq_write(struct file
*file
, const char *buffer
,
194 size_t count
, loff_t
*off
)
196 struct ldlm_namespace
*ns
= ((struct seq_file
*)file
->private_data
)->private;
197 char dummy
[MAX_STRING_SIZE
+ 1];
202 dummy
[MAX_STRING_SIZE
] = '\0';
203 if (copy_from_user(dummy
, buffer
, MAX_STRING_SIZE
))
206 if (strncmp(dummy
, "clear", 5) == 0) {
208 "dropping all unused locks from namespace %s\n",
210 if (ns_connect_lru_resize(ns
)) {
211 int canceled
, unused
= ns
->ns_nr_unused
;
213 /* Try to cancel all @ns_nr_unused locks. */
214 canceled
= ldlm_cancel_lru(ns
, unused
, 0,
216 if (canceled
< unused
) {
218 "not all requested locks are canceled, "
219 "requested: %d, canceled: %d\n", unused
,
224 tmp
= ns
->ns_max_unused
;
225 ns
->ns_max_unused
= 0;
226 ldlm_cancel_lru(ns
, 0, 0, LDLM_CANCEL_PASSED
);
227 ns
->ns_max_unused
= tmp
;
232 err
= kstrtoul(dummy
, 10, &tmp
);
234 CERROR("invalid value written\n");
237 lru_resize
= (tmp
== 0);
239 if (ns_connect_lru_resize(ns
)) {
241 ns
->ns_max_unused
= (unsigned int)tmp
;
243 if (tmp
> ns
->ns_nr_unused
)
244 tmp
= ns
->ns_nr_unused
;
245 tmp
= ns
->ns_nr_unused
- tmp
;
248 "changing namespace %s unused locks from %u to %u\n",
249 ldlm_ns_name(ns
), ns
->ns_nr_unused
,
251 ldlm_cancel_lru(ns
, tmp
, LCF_ASYNC
, LDLM_CANCEL_PASSED
);
255 "disable lru_resize for namespace %s\n",
257 ns
->ns_connect_flags
&= ~OBD_CONNECT_LRU_RESIZE
;
261 "changing namespace %s max_unused from %u to %u\n",
262 ldlm_ns_name(ns
), ns
->ns_max_unused
,
264 ns
->ns_max_unused
= (unsigned int)tmp
;
265 ldlm_cancel_lru(ns
, 0, LCF_ASYNC
, LDLM_CANCEL_PASSED
);
267 /* Make sure that LRU resize was originally supported before
268 * turning it on here. */
270 (ns
->ns_orig_connect_flags
& OBD_CONNECT_LRU_RESIZE
)) {
272 "enable lru_resize for namespace %s\n",
274 ns
->ns_connect_flags
|= OBD_CONNECT_LRU_RESIZE
;
280 LPROC_SEQ_FOPS(lprocfs_lru_size
);
282 static int lprocfs_elc_seq_show(struct seq_file
*m
, void *v
)
284 struct ldlm_namespace
*ns
= m
->private;
285 unsigned int supp
= ns_connect_cancelset(ns
);
287 return lprocfs_rd_uint(m
, &supp
);
290 static ssize_t
lprocfs_elc_seq_write(struct file
*file
, const char *buffer
,
291 size_t count
, loff_t
*off
)
293 struct ldlm_namespace
*ns
= ((struct seq_file
*)file
->private_data
)->private;
294 unsigned int supp
= -1;
297 rc
= lprocfs_wr_uint(file
, buffer
, count
, &supp
);
302 ns
->ns_connect_flags
&= ~OBD_CONNECT_CANCELSET
;
303 else if (ns
->ns_orig_connect_flags
& OBD_CONNECT_CANCELSET
)
304 ns
->ns_connect_flags
|= OBD_CONNECT_CANCELSET
;
307 LPROC_SEQ_FOPS(lprocfs_elc
);
309 void ldlm_namespace_proc_unregister(struct ldlm_namespace
*ns
)
311 if (ns
->ns_proc_dir_entry
== NULL
)
312 CERROR("dlm namespace %s has no procfs dir?\n",
315 lprocfs_remove(&ns
->ns_proc_dir_entry
);
317 if (ns
->ns_stats
!= NULL
)
318 lprocfs_free_stats(&ns
->ns_stats
);
321 #define LDLM_NS_ADD_VAR(name, var, ops) \
323 snprintf(lock_name, MAX_STRING_SIZE, name); \
324 lock_vars[0].data = var; \
325 lock_vars[0].fops = ops; \
326 lprocfs_add_vars(ns_pde, lock_vars, NULL); \
329 int ldlm_namespace_proc_register(struct ldlm_namespace
*ns
)
331 struct lprocfs_vars lock_vars
[2];
332 char lock_name
[MAX_STRING_SIZE
+ 1];
333 struct proc_dir_entry
*ns_pde
;
336 LASSERT(ns
->ns_rs_hash
!= NULL
);
338 if (ns
->ns_proc_dir_entry
!= NULL
) {
339 ns_pde
= ns
->ns_proc_dir_entry
;
341 ns_pde
= proc_mkdir(ldlm_ns_name(ns
), ldlm_ns_proc_dir
);
344 ns
->ns_proc_dir_entry
= ns_pde
;
347 ns
->ns_stats
= lprocfs_alloc_stats(LDLM_NSS_LAST
, 0);
348 if (ns
->ns_stats
== NULL
)
351 lprocfs_counter_init(ns
->ns_stats
, LDLM_NSS_LOCKS
,
352 LPROCFS_CNTR_AVGMINMAX
, "locks", "locks");
354 lock_name
[MAX_STRING_SIZE
] = '\0';
356 memset(lock_vars
, 0, sizeof(lock_vars
));
357 lock_vars
[0].name
= lock_name
;
359 LDLM_NS_ADD_VAR("resource_count", ns
, &lprocfs_ns_resources_fops
);
360 LDLM_NS_ADD_VAR("lock_count", ns
, &lprocfs_ns_locks_fops
);
362 if (ns_is_client(ns
)) {
363 LDLM_NS_ADD_VAR("lock_unused_count", &ns
->ns_nr_unused
,
365 LDLM_NS_ADD_VAR("lru_size", ns
, &lprocfs_lru_size_fops
);
366 LDLM_NS_ADD_VAR("lru_max_age", &ns
->ns_max_age
,
368 LDLM_NS_ADD_VAR("early_lock_cancel", ns
, &lprocfs_elc_fops
);
370 LDLM_NS_ADD_VAR("ctime_age_limit", &ns
->ns_ctime_age_limit
,
372 LDLM_NS_ADD_VAR("lock_timeouts", &ns
->ns_timeouts
,
374 LDLM_NS_ADD_VAR("max_nolock_bytes", &ns
->ns_max_nolock_size
,
376 LDLM_NS_ADD_VAR("contention_seconds", &ns
->ns_contention_time
,
378 LDLM_NS_ADD_VAR("contended_locks", &ns
->ns_contended_locks
,
380 LDLM_NS_ADD_VAR("max_parallel_ast", &ns
->ns_max_parallel_ast
,
385 #undef MAX_STRING_SIZE
388 #define ldlm_namespace_proc_unregister(ns) ({;})
389 #define ldlm_namespace_proc_register(ns) ({0;})
393 static unsigned ldlm_res_hop_hash(struct cfs_hash
*hs
,
394 const void *key
, unsigned mask
)
396 const struct ldlm_res_id
*id
= key
;
400 for (i
= 0; i
< RES_NAME_SIZE
; i
++)
405 static unsigned ldlm_res_hop_fid_hash(struct cfs_hash
*hs
,
406 const void *key
, unsigned mask
)
408 const struct ldlm_res_id
*id
= key
;
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);
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);
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);
429 hash
<<= hs
->hs_cur_bits
- hs
->hs_bkt_bits
;
430 hash
|= ldlm_res_hop_hash(hs
, key
, CFS_HASH_NBKT(hs
) - 1);
435 static void *ldlm_res_hop_key(struct hlist_node
*hnode
)
437 struct ldlm_resource
*res
;
439 res
= hlist_entry(hnode
, struct ldlm_resource
, lr_hash
);
440 return &res
->lr_name
;
443 static int ldlm_res_hop_keycmp(const void *key
, struct hlist_node
*hnode
)
445 struct ldlm_resource
*res
;
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
);
452 static void *ldlm_res_hop_object(struct hlist_node
*hnode
)
454 return hlist_entry(hnode
, struct ldlm_resource
, lr_hash
);
457 static void ldlm_res_hop_get_locked(struct cfs_hash
*hs
, struct hlist_node
*hnode
)
459 struct ldlm_resource
*res
;
461 res
= hlist_entry(hnode
, struct ldlm_resource
, lr_hash
);
462 ldlm_resource_getref(res
);
465 static void ldlm_res_hop_put_locked(struct cfs_hash
*hs
, struct hlist_node
*hnode
)
467 struct ldlm_resource
*res
;
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
);
474 static void ldlm_res_hop_put(struct cfs_hash
*hs
, struct hlist_node
*hnode
)
476 struct ldlm_resource
*res
;
478 res
= hlist_entry(hnode
, struct ldlm_resource
, lr_hash
);
479 ldlm_resource_putref(res
);
482 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
,
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
493 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
,
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
505 ldlm_ns_type_t nsd_type
;
506 /** hash bucket bits */
507 unsigned nsd_bkt_bits
;
509 unsigned nsd_all_bits
;
510 /** hash operations */
511 cfs_hash_ops_t
*nsd_hops
;
512 } ldlm_ns_hash_def_t
;
514 ldlm_ns_hash_def_t ldlm_ns_hash_defs
[] =
517 .nsd_type
= LDLM_NS_TYPE_MDC
,
520 .nsd_hops
= &ldlm_ns_fid_hash_ops
,
523 .nsd_type
= LDLM_NS_TYPE_MDT
,
526 .nsd_hops
= &ldlm_ns_fid_hash_ops
,
529 .nsd_type
= LDLM_NS_TYPE_OSC
,
532 .nsd_hops
= &ldlm_ns_hash_ops
,
535 .nsd_type
= LDLM_NS_TYPE_OST
,
538 .nsd_hops
= &ldlm_ns_hash_ops
,
541 .nsd_type
= LDLM_NS_TYPE_MGC
,
544 .nsd_hops
= &ldlm_ns_hash_ops
,
547 .nsd_type
= LDLM_NS_TYPE_MGT
,
550 .nsd_hops
= &ldlm_ns_hash_ops
,
553 .nsd_type
= LDLM_NS_TYPE_UNKNOWN
,
558 * Create and initialize new empty namespace.
560 struct ldlm_namespace
*ldlm_namespace_new(struct obd_device
*obd
, char *name
,
563 ldlm_ns_type_t ns_type
)
565 struct ldlm_namespace
*ns
= NULL
;
566 struct ldlm_ns_bucket
*nsb
;
567 ldlm_ns_hash_def_t
*nsd
;
568 struct cfs_hash_bd bd
;
572 LASSERT(obd
!= NULL
);
576 CERROR("ldlm_get_ref failed: %d\n", rc
);
580 for (idx
= 0;;idx
++) {
581 nsd
= &ldlm_ns_hash_defs
[idx
];
582 if (nsd
->nsd_type
== LDLM_NS_TYPE_UNKNOWN
) {
583 CERROR("Unknown type %d for ns %s\n", ns_type
, name
);
587 if (nsd
->nsd_type
== ns_type
)
595 ns
->ns_rs_hash
= cfs_hash_create(name
,
596 nsd
->nsd_all_bits
, nsd
->nsd_all_bits
,
597 nsd
->nsd_bkt_bits
, sizeof(*nsb
),
603 CFS_HASH_SPIN_BKTLOCK
|
604 CFS_HASH_NO_ITEMREF
);
605 if (ns
->ns_rs_hash
== NULL
)
608 cfs_hash_for_each_bucket(ns
->ns_rs_hash
, &bd
, idx
) {
609 nsb
= cfs_hash_bd_extra_get(ns
->ns_rs_hash
, &bd
);
610 at_init(&nsb
->nsb_at_estimate
, ldlm_enqueue_min
, 0);
611 nsb
->nsb_namespace
= ns
;
615 ns
->ns_appetite
= apt
;
616 ns
->ns_client
= client
;
618 INIT_LIST_HEAD(&ns
->ns_list_chain
);
619 INIT_LIST_HEAD(&ns
->ns_unused_list
);
620 spin_lock_init(&ns
->ns_lock
);
621 atomic_set(&ns
->ns_bref
, 0);
622 init_waitqueue_head(&ns
->ns_waitq
);
624 ns
->ns_max_nolock_size
= NS_DEFAULT_MAX_NOLOCK_BYTES
;
625 ns
->ns_contention_time
= NS_DEFAULT_CONTENTION_SECONDS
;
626 ns
->ns_contended_locks
= NS_DEFAULT_CONTENDED_LOCKS
;
628 ns
->ns_max_parallel_ast
= LDLM_DEFAULT_PARALLEL_AST_LIMIT
;
629 ns
->ns_nr_unused
= 0;
630 ns
->ns_max_unused
= LDLM_DEFAULT_LRU_SIZE
;
631 ns
->ns_max_age
= LDLM_DEFAULT_MAX_ALIVE
;
632 ns
->ns_ctime_age_limit
= LDLM_CTIME_AGE_LIMIT
;
634 ns
->ns_orig_connect_flags
= 0;
635 ns
->ns_connect_flags
= 0;
637 rc
= ldlm_namespace_proc_register(ns
);
639 CERROR("Can't initialize ns proc, rc %d\n", rc
);
643 idx
= ldlm_namespace_nr_read(client
);
644 rc
= ldlm_pool_init(&ns
->ns_pool
, ns
, idx
, client
);
646 CERROR("Can't initialize lock pool, rc %d\n", rc
);
650 ldlm_namespace_register(ns
, client
);
653 ldlm_namespace_proc_unregister(ns
);
654 ldlm_namespace_cleanup(ns
, 0);
656 cfs_hash_putref(ns
->ns_rs_hash
);
663 EXPORT_SYMBOL(ldlm_namespace_new
);
665 extern struct ldlm_lock
*ldlm_lock_get(struct ldlm_lock
*lock
);
668 * Cancel and destroy all locks on a resource.
670 * If flags contains FL_LOCAL_ONLY, don't try to tell the server, just
671 * clean up. This is currently only used for recovery, and we make
672 * certain assumptions as a result--notably, that we shouldn't cancel
675 static void cleanup_resource(struct ldlm_resource
*res
, struct list_head
*q
,
678 struct list_head
*tmp
;
679 int rc
= 0, client
= ns_is_client(ldlm_res_to_ns(res
));
680 bool local_only
= !!(flags
& LDLM_FL_LOCAL_ONLY
);
683 struct ldlm_lock
*lock
= NULL
;
685 /* First, we look for non-cleaned-yet lock
686 * all cleaned locks are marked by CLEANED flag. */
688 list_for_each(tmp
, q
) {
689 lock
= list_entry(tmp
, struct ldlm_lock
,
691 if (lock
->l_flags
& LDLM_FL_CLEANED
) {
696 lock
->l_flags
|= LDLM_FL_CLEANED
;
705 /* Set CBPENDING so nothing in the cancellation path
706 * can match this lock. */
707 lock
->l_flags
|= LDLM_FL_CBPENDING
;
708 lock
->l_flags
|= LDLM_FL_FAILED
;
709 lock
->l_flags
|= flags
;
711 /* ... without sending a CANCEL message for local_only. */
713 lock
->l_flags
|= LDLM_FL_LOCAL_ONLY
;
715 if (local_only
&& (lock
->l_readers
|| lock
->l_writers
)) {
716 /* This is a little bit gross, but much better than the
717 * alternative: pretend that we got a blocking AST from
718 * the server, so that when the lock is decref'd, it
719 * will go away ... */
721 LDLM_DEBUG(lock
, "setting FL_LOCAL_ONLY");
722 if (lock
->l_completion_ast
)
723 lock
->l_completion_ast(lock
, 0, NULL
);
724 LDLM_LOCK_RELEASE(lock
);
729 struct lustre_handle lockh
;
732 ldlm_lock2handle(lock
, &lockh
);
733 rc
= ldlm_cli_cancel(&lockh
, LCF_ASYNC
);
735 CERROR("ldlm_cli_cancel: %d\n", rc
);
737 ldlm_resource_unlink_lock(lock
);
739 LDLM_DEBUG(lock
, "Freeing a lock still held by a "
741 ldlm_lock_destroy(lock
);
743 LDLM_LOCK_RELEASE(lock
);
747 static int ldlm_resource_clean(struct cfs_hash
*hs
, struct cfs_hash_bd
*bd
,
748 struct hlist_node
*hnode
, void *arg
)
750 struct ldlm_resource
*res
= cfs_hash_object(hs
, hnode
);
751 __u64 flags
= *(__u64
*)arg
;
753 cleanup_resource(res
, &res
->lr_granted
, flags
);
754 cleanup_resource(res
, &res
->lr_converting
, flags
);
755 cleanup_resource(res
, &res
->lr_waiting
, flags
);
760 static int ldlm_resource_complain(struct cfs_hash
*hs
, struct cfs_hash_bd
*bd
,
761 struct hlist_node
*hnode
, void *arg
)
763 struct ldlm_resource
*res
= cfs_hash_object(hs
, hnode
);
766 CERROR("%s: namespace resource "DLDLMRES
767 " (%p) refcount nonzero (%d) after lock cleanup; forcing cleanup.\n",
768 ldlm_ns_name(ldlm_res_to_ns(res
)), PLDLMRES(res
), res
,
769 atomic_read(&res
->lr_refcount
) - 1);
771 ldlm_resource_dump(D_ERROR
, res
);
777 * Cancel and destroy all locks in the namespace.
779 * Typically used during evictions when server notified client that it was
780 * evicted and all of its state needs to be destroyed.
781 * Also used during shutdown.
783 int ldlm_namespace_cleanup(struct ldlm_namespace
*ns
, __u64 flags
)
786 CDEBUG(D_INFO
, "NULL ns, skipping cleanup\n");
790 cfs_hash_for_each_nolock(ns
->ns_rs_hash
, ldlm_resource_clean
, &flags
);
791 cfs_hash_for_each_nolock(ns
->ns_rs_hash
, ldlm_resource_complain
, NULL
);
794 EXPORT_SYMBOL(ldlm_namespace_cleanup
);
797 * Attempts to free namespace.
799 * Only used when namespace goes away, like during an unmount.
801 static int __ldlm_namespace_free(struct ldlm_namespace
*ns
, int force
)
803 /* At shutdown time, don't call the cancellation callback */
804 ldlm_namespace_cleanup(ns
, force
? LDLM_FL_LOCAL_ONLY
: 0);
806 if (atomic_read(&ns
->ns_bref
) > 0) {
807 struct l_wait_info lwi
= LWI_INTR(LWI_ON_SIGNAL_NOOP
, NULL
);
810 "dlm namespace %s free waiting on refcount %d\n",
811 ldlm_ns_name(ns
), atomic_read(&ns
->ns_bref
));
814 lwi
= LWI_TIMEOUT(obd_timeout
* HZ
/ 4, NULL
, NULL
);
816 rc
= l_wait_event(ns
->ns_waitq
,
817 atomic_read(&ns
->ns_bref
) == 0, &lwi
);
819 /* Forced cleanups should be able to reclaim all references,
820 * so it's safe to wait forever... we can't leak locks... */
821 if (force
&& rc
== -ETIMEDOUT
) {
822 LCONSOLE_ERROR("Forced cleanup waiting for %s "
823 "namespace with %d resources in use, "
824 "(rc=%d)\n", ldlm_ns_name(ns
),
825 atomic_read(&ns
->ns_bref
), rc
);
826 GOTO(force_wait
, rc
);
829 if (atomic_read(&ns
->ns_bref
)) {
830 LCONSOLE_ERROR("Cleanup waiting for %s namespace "
831 "with %d resources in use, (rc=%d)\n",
833 atomic_read(&ns
->ns_bref
), rc
);
834 return ELDLM_NAMESPACE_EXISTS
;
836 CDEBUG(D_DLMTRACE
, "dlm namespace %s free done waiting\n",
844 * Performs various cleanups for passed \a ns to make it drop refc and be
845 * ready for freeing. Waits for refc == 0.
847 * The following is done:
848 * (0) Unregister \a ns from its list to make inaccessible for potential
849 * users like pools thread and others;
850 * (1) Clear all locks in \a ns.
852 void ldlm_namespace_free_prior(struct ldlm_namespace
*ns
,
853 struct obd_import
*imp
,
861 spin_lock(&ns
->ns_lock
);
863 spin_unlock(&ns
->ns_lock
);
866 * Can fail with -EINTR when force == 0 in which case try harder.
868 rc
= __ldlm_namespace_free(ns
, force
);
869 if (rc
!= ELDLM_OK
) {
871 ptlrpc_disconnect_import(imp
, 0);
872 ptlrpc_invalidate_import(imp
);
876 * With all requests dropped and the import inactive
877 * we are guaranteed all reference will be dropped.
879 rc
= __ldlm_namespace_free(ns
, 1);
885 * Performs freeing memory structures related to \a ns. This is only done
886 * when ldlm_namespce_free_prior() successfully removed all resources
887 * referencing \a ns and its refc == 0.
889 void ldlm_namespace_free_post(struct ldlm_namespace
*ns
)
894 /* Make sure that nobody can find this ns in its list. */
895 ldlm_namespace_unregister(ns
, ns
->ns_client
);
896 /* Fini pool _before_ parent proc dir is removed. This is important as
897 * ldlm_pool_fini() removes own proc dir which is child to @dir.
898 * Removing it after @dir may cause oops. */
899 ldlm_pool_fini(&ns
->ns_pool
);
901 ldlm_namespace_proc_unregister(ns
);
902 cfs_hash_putref(ns
->ns_rs_hash
);
903 /* Namespace \a ns should be not on list at this time, otherwise
904 * this will cause issues related to using freed \a ns in poold
906 LASSERT(list_empty(&ns
->ns_list_chain
));
912 * Cleanup the resource, and free namespace.
915 * proc1: destroy import
916 * class_disconnect_export(grab cl_sem) ->
917 * -> ldlm_namespace_free ->
918 * -> lprocfs_remove(grab _lprocfs_lock).
919 * proc2: read proc info
920 * lprocfs_fops_read(grab _lprocfs_lock) ->
921 * -> osc_rd_active, etc(grab cl_sem).
923 * So that I have to split the ldlm_namespace_free into two parts - the first
924 * part ldlm_namespace_free_prior is used to cleanup the resource which is
925 * being used; the 2nd part ldlm_namespace_free_post is used to unregister the
926 * lprocfs entries, and then free memory. It will be called w/o cli->cl_sem
929 void ldlm_namespace_free(struct ldlm_namespace
*ns
,
930 struct obd_import
*imp
,
933 ldlm_namespace_free_prior(ns
, imp
, force
);
934 ldlm_namespace_free_post(ns
);
936 EXPORT_SYMBOL(ldlm_namespace_free
);
938 void ldlm_namespace_get(struct ldlm_namespace
*ns
)
940 atomic_inc(&ns
->ns_bref
);
942 EXPORT_SYMBOL(ldlm_namespace_get
);
944 /* This is only for callers that care about refcount */
945 int ldlm_namespace_get_return(struct ldlm_namespace
*ns
)
947 return atomic_inc_return(&ns
->ns_bref
);
950 void ldlm_namespace_put(struct ldlm_namespace
*ns
)
952 if (atomic_dec_and_lock(&ns
->ns_bref
, &ns
->ns_lock
)) {
953 wake_up(&ns
->ns_waitq
);
954 spin_unlock(&ns
->ns_lock
);
957 EXPORT_SYMBOL(ldlm_namespace_put
);
959 /** Register \a ns in the list of namespaces */
960 void ldlm_namespace_register(struct ldlm_namespace
*ns
, ldlm_side_t client
)
962 mutex_lock(ldlm_namespace_lock(client
));
963 LASSERT(list_empty(&ns
->ns_list_chain
));
964 list_add(&ns
->ns_list_chain
, ldlm_namespace_inactive_list(client
));
965 ldlm_namespace_nr_inc(client
);
966 mutex_unlock(ldlm_namespace_lock(client
));
969 /** Unregister \a ns from the list of namespaces. */
970 void ldlm_namespace_unregister(struct ldlm_namespace
*ns
, ldlm_side_t client
)
972 mutex_lock(ldlm_namespace_lock(client
));
973 LASSERT(!list_empty(&ns
->ns_list_chain
));
974 /* Some asserts and possibly other parts of the code are still
975 * using list_empty(&ns->ns_list_chain). This is why it is
976 * important to use list_del_init() here. */
977 list_del_init(&ns
->ns_list_chain
);
978 ldlm_namespace_nr_dec(client
);
979 mutex_unlock(ldlm_namespace_lock(client
));
982 /** Should be called with ldlm_namespace_lock(client) taken. */
983 void ldlm_namespace_move_to_active_locked(struct ldlm_namespace
*ns
,
986 LASSERT(!list_empty(&ns
->ns_list_chain
));
987 LASSERT(mutex_is_locked(ldlm_namespace_lock(client
)));
988 list_move_tail(&ns
->ns_list_chain
, ldlm_namespace_list(client
));
991 /** Should be called with ldlm_namespace_lock(client) taken. */
992 void ldlm_namespace_move_to_inactive_locked(struct ldlm_namespace
*ns
,
995 LASSERT(!list_empty(&ns
->ns_list_chain
));
996 LASSERT(mutex_is_locked(ldlm_namespace_lock(client
)));
997 list_move_tail(&ns
->ns_list_chain
,
998 ldlm_namespace_inactive_list(client
));
1001 /** Should be called with ldlm_namespace_lock(client) taken. */
1002 struct ldlm_namespace
*ldlm_namespace_first_locked(ldlm_side_t client
)
1004 LASSERT(mutex_is_locked(ldlm_namespace_lock(client
)));
1005 LASSERT(!list_empty(ldlm_namespace_list(client
)));
1006 return container_of(ldlm_namespace_list(client
)->next
,
1007 struct ldlm_namespace
, ns_list_chain
);
1010 /** Create and initialize new resource. */
1011 static struct ldlm_resource
*ldlm_resource_new(void)
1013 struct ldlm_resource
*res
;
1016 OBD_SLAB_ALLOC_PTR_GFP(res
, ldlm_resource_slab
, GFP_NOFS
);
1020 INIT_LIST_HEAD(&res
->lr_granted
);
1021 INIT_LIST_HEAD(&res
->lr_converting
);
1022 INIT_LIST_HEAD(&res
->lr_waiting
);
1024 /* Initialize interval trees for each lock mode. */
1025 for (idx
= 0; idx
< LCK_MODE_NUM
; idx
++) {
1026 res
->lr_itree
[idx
].lit_size
= 0;
1027 res
->lr_itree
[idx
].lit_mode
= 1 << idx
;
1028 res
->lr_itree
[idx
].lit_root
= NULL
;
1031 atomic_set(&res
->lr_refcount
, 1);
1032 spin_lock_init(&res
->lr_lock
);
1033 lu_ref_init(&res
->lr_reference
);
1035 /* The creator of the resource must unlock the mutex after LVB
1036 * initialization. */
1037 mutex_init(&res
->lr_lvb_mutex
);
1038 mutex_lock(&res
->lr_lvb_mutex
);
1044 * Return a reference to resource with given name, creating it if necessary.
1045 * Args: namespace with ns_lock unlocked
1046 * Locks: takes and releases NS hash-lock and res->lr_lock
1047 * Returns: referenced, unlocked ldlm_resource or NULL
1049 struct ldlm_resource
*
1050 ldlm_resource_get(struct ldlm_namespace
*ns
, struct ldlm_resource
*parent
,
1051 const struct ldlm_res_id
*name
, ldlm_type_t type
, int create
)
1053 struct hlist_node
*hnode
;
1054 struct ldlm_resource
*res
;
1055 struct cfs_hash_bd bd
;
1057 int ns_refcount
= 0;
1059 LASSERT(ns
!= NULL
);
1060 LASSERT(parent
== NULL
);
1061 LASSERT(ns
->ns_rs_hash
!= NULL
);
1062 LASSERT(name
->name
[0] != 0);
1064 cfs_hash_bd_get_and_lock(ns
->ns_rs_hash
, (void *)name
, &bd
, 0);
1065 hnode
= cfs_hash_bd_lookup_locked(ns
->ns_rs_hash
, &bd
, (void *)name
);
1066 if (hnode
!= NULL
) {
1067 cfs_hash_bd_unlock(ns
->ns_rs_hash
, &bd
, 0);
1068 res
= hlist_entry(hnode
, struct ldlm_resource
, lr_hash
);
1069 /* Synchronize with regard to resource creation. */
1070 if (ns
->ns_lvbo
&& ns
->ns_lvbo
->lvbo_init
) {
1071 mutex_lock(&res
->lr_lvb_mutex
);
1072 mutex_unlock(&res
->lr_lvb_mutex
);
1075 if (unlikely(res
->lr_lvb_len
< 0)) {
1076 ldlm_resource_putref(res
);
1082 version
= cfs_hash_bd_version_get(&bd
);
1083 cfs_hash_bd_unlock(ns
->ns_rs_hash
, &bd
, 0);
1088 LASSERTF(type
>= LDLM_MIN_TYPE
&& type
< LDLM_MAX_TYPE
,
1089 "type: %d\n", type
);
1090 res
= ldlm_resource_new();
1094 res
->lr_ns_bucket
= cfs_hash_bd_extra_get(ns
->ns_rs_hash
, &bd
);
1095 res
->lr_name
= *name
;
1096 res
->lr_type
= type
;
1097 res
->lr_most_restr
= LCK_NL
;
1099 cfs_hash_bd_lock(ns
->ns_rs_hash
, &bd
, 1);
1100 hnode
= (version
== cfs_hash_bd_version_get(&bd
)) ? NULL
:
1101 cfs_hash_bd_lookup_locked(ns
->ns_rs_hash
, &bd
, (void *)name
);
1103 if (hnode
!= NULL
) {
1104 /* Someone won the race and already added the resource. */
1105 cfs_hash_bd_unlock(ns
->ns_rs_hash
, &bd
, 1);
1106 /* Clean lu_ref for failed resource. */
1107 lu_ref_fini(&res
->lr_reference
);
1108 /* We have taken lr_lvb_mutex. Drop it. */
1109 mutex_unlock(&res
->lr_lvb_mutex
);
1110 OBD_SLAB_FREE(res
, ldlm_resource_slab
, sizeof(*res
));
1112 res
= hlist_entry(hnode
, struct ldlm_resource
, lr_hash
);
1113 /* Synchronize with regard to resource creation. */
1114 if (ns
->ns_lvbo
&& ns
->ns_lvbo
->lvbo_init
) {
1115 mutex_lock(&res
->lr_lvb_mutex
);
1116 mutex_unlock(&res
->lr_lvb_mutex
);
1119 if (unlikely(res
->lr_lvb_len
< 0)) {
1120 ldlm_resource_putref(res
);
1125 /* We won! Let's add the resource. */
1126 cfs_hash_bd_add_locked(ns
->ns_rs_hash
, &bd
, &res
->lr_hash
);
1127 if (cfs_hash_bd_count_get(&bd
) == 1)
1128 ns_refcount
= ldlm_namespace_get_return(ns
);
1130 cfs_hash_bd_unlock(ns
->ns_rs_hash
, &bd
, 1);
1131 if (ns
->ns_lvbo
&& ns
->ns_lvbo
->lvbo_init
) {
1134 OBD_FAIL_TIMEOUT(OBD_FAIL_LDLM_CREATE_RESOURCE
, 2);
1135 rc
= ns
->ns_lvbo
->lvbo_init(res
);
1137 CERROR("%s: lvbo_init failed for resource "LPX64
":"
1138 LPX64
": rc = %d\n", ns
->ns_obd
->obd_name
,
1139 name
->name
[0], name
->name
[1], rc
);
1140 if (res
->lr_lvb_data
) {
1141 OBD_FREE(res
->lr_lvb_data
, res
->lr_lvb_len
);
1142 res
->lr_lvb_data
= NULL
;
1144 res
->lr_lvb_len
= rc
;
1145 mutex_unlock(&res
->lr_lvb_mutex
);
1146 ldlm_resource_putref(res
);
1151 /* We create resource with locked lr_lvb_mutex. */
1152 mutex_unlock(&res
->lr_lvb_mutex
);
1154 /* Let's see if we happened to be the very first resource in this
1155 * namespace. If so, and this is a client namespace, we need to move
1156 * the namespace into the active namespaces list to be patrolled by
1157 * the ldlm_poold. */
1158 if (ns_is_client(ns
) && ns_refcount
== 1) {
1159 mutex_lock(ldlm_namespace_lock(LDLM_NAMESPACE_CLIENT
));
1160 ldlm_namespace_move_to_active_locked(ns
, LDLM_NAMESPACE_CLIENT
);
1161 mutex_unlock(ldlm_namespace_lock(LDLM_NAMESPACE_CLIENT
));
1166 EXPORT_SYMBOL(ldlm_resource_get
);
1168 struct ldlm_resource
*ldlm_resource_getref(struct ldlm_resource
*res
)
1170 LASSERT(res
!= NULL
);
1171 LASSERT(res
!= LP_POISON
);
1172 atomic_inc(&res
->lr_refcount
);
1173 CDEBUG(D_INFO
, "getref res: %p count: %d\n", res
,
1174 atomic_read(&res
->lr_refcount
));
1178 static void __ldlm_resource_putref_final(struct cfs_hash_bd
*bd
,
1179 struct ldlm_resource
*res
)
1181 struct ldlm_ns_bucket
*nsb
= res
->lr_ns_bucket
;
1183 if (!list_empty(&res
->lr_granted
)) {
1184 ldlm_resource_dump(D_ERROR
, res
);
1188 if (!list_empty(&res
->lr_converting
)) {
1189 ldlm_resource_dump(D_ERROR
, res
);
1193 if (!list_empty(&res
->lr_waiting
)) {
1194 ldlm_resource_dump(D_ERROR
, res
);
1198 cfs_hash_bd_del_locked(nsb
->nsb_namespace
->ns_rs_hash
,
1200 lu_ref_fini(&res
->lr_reference
);
1201 if (cfs_hash_bd_count_get(bd
) == 0)
1202 ldlm_namespace_put(nsb
->nsb_namespace
);
1205 /* Returns 1 if the resource was freed, 0 if it remains. */
1206 int ldlm_resource_putref(struct ldlm_resource
*res
)
1208 struct ldlm_namespace
*ns
= ldlm_res_to_ns(res
);
1209 struct cfs_hash_bd bd
;
1211 LASSERT_ATOMIC_GT_LT(&res
->lr_refcount
, 0, LI_POISON
);
1212 CDEBUG(D_INFO
, "putref res: %p count: %d\n",
1213 res
, atomic_read(&res
->lr_refcount
) - 1);
1215 cfs_hash_bd_get(ns
->ns_rs_hash
, &res
->lr_name
, &bd
);
1216 if (cfs_hash_bd_dec_and_lock(ns
->ns_rs_hash
, &bd
, &res
->lr_refcount
)) {
1217 __ldlm_resource_putref_final(&bd
, res
);
1218 cfs_hash_bd_unlock(ns
->ns_rs_hash
, &bd
, 1);
1219 if (ns
->ns_lvbo
&& ns
->ns_lvbo
->lvbo_free
)
1220 ns
->ns_lvbo
->lvbo_free(res
);
1221 OBD_SLAB_FREE(res
, ldlm_resource_slab
, sizeof(*res
));
1226 EXPORT_SYMBOL(ldlm_resource_putref
);
1228 /* Returns 1 if the resource was freed, 0 if it remains. */
1229 int ldlm_resource_putref_locked(struct ldlm_resource
*res
)
1231 struct ldlm_namespace
*ns
= ldlm_res_to_ns(res
);
1233 LASSERT_ATOMIC_GT_LT(&res
->lr_refcount
, 0, LI_POISON
);
1234 CDEBUG(D_INFO
, "putref res: %p count: %d\n",
1235 res
, atomic_read(&res
->lr_refcount
) - 1);
1237 if (atomic_dec_and_test(&res
->lr_refcount
)) {
1238 struct cfs_hash_bd bd
;
1240 cfs_hash_bd_get(ldlm_res_to_ns(res
)->ns_rs_hash
,
1241 &res
->lr_name
, &bd
);
1242 __ldlm_resource_putref_final(&bd
, res
);
1243 cfs_hash_bd_unlock(ns
->ns_rs_hash
, &bd
, 1);
1244 /* NB: ns_rs_hash is created with CFS_HASH_NO_ITEMREF,
1245 * so we should never be here while calling cfs_hash_del,
1246 * cfs_hash_for_each_nolock is the only case we can get
1247 * here, which is safe to release cfs_hash_bd_lock.
1249 if (ns
->ns_lvbo
&& ns
->ns_lvbo
->lvbo_free
)
1250 ns
->ns_lvbo
->lvbo_free(res
);
1251 OBD_SLAB_FREE(res
, ldlm_resource_slab
, sizeof(*res
));
1253 cfs_hash_bd_lock(ns
->ns_rs_hash
, &bd
, 1);
1260 * Add a lock into a given resource into specified lock list.
1262 void ldlm_resource_add_lock(struct ldlm_resource
*res
, struct list_head
*head
,
1263 struct ldlm_lock
*lock
)
1265 check_res_locked(res
);
1267 LDLM_DEBUG(lock
, "About to add this lock:\n");
1269 if (lock
->l_flags
& LDLM_FL_DESTROYED
) {
1270 CDEBUG(D_OTHER
, "Lock destroyed, not adding to resource\n");
1274 LASSERT(list_empty(&lock
->l_res_link
));
1276 list_add_tail(&lock
->l_res_link
, head
);
1280 * Insert a lock into resource after specified lock.
1282 * Obtain resource description from the lock we are inserting after.
1284 void ldlm_resource_insert_lock_after(struct ldlm_lock
*original
,
1285 struct ldlm_lock
*new)
1287 struct ldlm_resource
*res
= original
->l_resource
;
1289 check_res_locked(res
);
1291 ldlm_resource_dump(D_INFO
, res
);
1292 LDLM_DEBUG(new, "About to insert this lock after %p:\n", original
);
1294 if (new->l_flags
& LDLM_FL_DESTROYED
) {
1295 CDEBUG(D_OTHER
, "Lock destroyed, not adding to resource\n");
1299 LASSERT(list_empty(&new->l_res_link
));
1301 list_add(&new->l_res_link
, &original
->l_res_link
);
1305 void ldlm_resource_unlink_lock(struct ldlm_lock
*lock
)
1307 int type
= lock
->l_resource
->lr_type
;
1309 check_res_locked(lock
->l_resource
);
1310 if (type
== LDLM_IBITS
|| type
== LDLM_PLAIN
)
1311 ldlm_unlink_lock_skiplist(lock
);
1312 else if (type
== LDLM_EXTENT
)
1313 ldlm_extent_unlink_lock(lock
);
1314 list_del_init(&lock
->l_res_link
);
1316 EXPORT_SYMBOL(ldlm_resource_unlink_lock
);
1318 void ldlm_res2desc(struct ldlm_resource
*res
, struct ldlm_resource_desc
*desc
)
1320 desc
->lr_type
= res
->lr_type
;
1321 desc
->lr_name
= res
->lr_name
;
1325 * Print information about all locks in all namespaces on this node to debug
1328 void ldlm_dump_all_namespaces(ldlm_side_t client
, int level
)
1330 struct list_head
*tmp
;
1332 if (!((libcfs_debug
| D_ERROR
) & level
))
1335 mutex_lock(ldlm_namespace_lock(client
));
1337 list_for_each(tmp
, ldlm_namespace_list(client
)) {
1338 struct ldlm_namespace
*ns
;
1339 ns
= list_entry(tmp
, struct ldlm_namespace
, ns_list_chain
);
1340 ldlm_namespace_dump(level
, ns
);
1343 mutex_unlock(ldlm_namespace_lock(client
));
1345 EXPORT_SYMBOL(ldlm_dump_all_namespaces
);
1347 static int ldlm_res_hash_dump(struct cfs_hash
*hs
, struct cfs_hash_bd
*bd
,
1348 struct hlist_node
*hnode
, void *arg
)
1350 struct ldlm_resource
*res
= cfs_hash_object(hs
, hnode
);
1351 int level
= (int)(unsigned long)arg
;
1354 ldlm_resource_dump(level
, res
);
1361 * Print information about all locks in this namespace on this node to debug
1364 void ldlm_namespace_dump(int level
, struct ldlm_namespace
*ns
)
1366 if (!((libcfs_debug
| D_ERROR
) & level
))
1369 CDEBUG(level
, "--- Namespace: %s (rc: %d, side: %s)\n",
1370 ldlm_ns_name(ns
), atomic_read(&ns
->ns_bref
),
1371 ns_is_client(ns
) ? "client" : "server");
1373 if (cfs_time_before(cfs_time_current(), ns
->ns_next_dump
))
1376 cfs_hash_for_each_nolock(ns
->ns_rs_hash
,
1378 (void *)(unsigned long)level
);
1379 spin_lock(&ns
->ns_lock
);
1380 ns
->ns_next_dump
= cfs_time_shift(10);
1381 spin_unlock(&ns
->ns_lock
);
1383 EXPORT_SYMBOL(ldlm_namespace_dump
);
1386 * Print information about all locks in this resource to debug log.
1388 void ldlm_resource_dump(int level
, struct ldlm_resource
*res
)
1390 struct ldlm_lock
*lock
;
1391 unsigned int granted
= 0;
1393 CLASSERT(RES_NAME_SIZE
== 4);
1395 if (!((libcfs_debug
| D_ERROR
) & level
))
1398 CDEBUG(level
, "--- Resource: "DLDLMRES
" (%p) refcount = %d\n",
1399 PLDLMRES(res
), res
, atomic_read(&res
->lr_refcount
));
1401 if (!list_empty(&res
->lr_granted
)) {
1402 CDEBUG(level
, "Granted locks (in reverse order):\n");
1403 list_for_each_entry_reverse(lock
, &res
->lr_granted
,
1405 LDLM_DEBUG_LIMIT(level
, lock
, "###");
1406 if (!(level
& D_CANTMASK
) &&
1407 ++granted
> ldlm_dump_granted_max
) {
1408 CDEBUG(level
, "only dump %d granted locks to "
1409 "avoid DDOS.\n", granted
);
1414 if (!list_empty(&res
->lr_converting
)) {
1415 CDEBUG(level
, "Converting locks:\n");
1416 list_for_each_entry(lock
, &res
->lr_converting
, l_res_link
)
1417 LDLM_DEBUG_LIMIT(level
, lock
, "###");
1419 if (!list_empty(&res
->lr_waiting
)) {
1420 CDEBUG(level
, "Waiting locks:\n");
1421 list_for_each_entry(lock
, &res
->lr_waiting
, l_res_link
)
1422 LDLM_DEBUG_LIMIT(level
, lock
, "###");