1 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
2 * vim:expandtab:shiftwidth=8:tabstop=8:
4 * Copyright (C) 2002 Cluster File Systems, Inc.
6 * This code is issued under the GNU General Public License.
7 * See the file COPYING in this distribution
9 * by Cluster File Systems, Inc.
12 #define DEBUG_SUBSYSTEM S_LDLM
14 #include <linux/lustre_dlm.h>
15 #include <linux/obd_class.h>
17 kmem_cache_t *ldlm_resource_slab, *ldlm_lock_slab;
19 spinlock_t ldlm_namespace_lock = SPIN_LOCK_UNLOCKED;
20 struct list_head ldlm_namespace_list = LIST_HEAD_INIT(ldlm_namespace_list);
21 static struct proc_dir_entry *ldlm_ns_proc_dir = NULL;
23 int ldlm_proc_setup(struct obd_device *obd)
26 LASSERT(ldlm_ns_proc_dir == NULL);
27 ldlm_ns_proc_dir=obd->obd_type->typ_procroot;
31 void ldlm_proc_cleanup(struct obd_device *obd)
33 ldlm_ns_proc_dir = NULL;
36 #define MAX_STRING_SIZE 100
37 void ldlm_proc_namespace(struct ldlm_namespace *ns)
39 struct lprocfs_vars lock_vars[2];
40 char lock_names[MAX_STRING_SIZE+1];
42 memset(lock_vars, 0, sizeof(lock_vars));
43 snprintf(lock_names, MAX_STRING_SIZE, "%s/resource_count", ns->ns_name);
44 lock_names[MAX_STRING_SIZE] = '\0';
45 lock_vars[0].name = lock_names;
46 lock_vars[0].read_fptr = lprocfs_ll_rd;
47 lock_vars[0].write_fptr = NULL;
48 lock_vars[0].data = &ns->ns_resources;
49 lprocfs_add_vars(ldlm_ns_proc_dir, lock_vars, 0);
51 memset(lock_vars, 0, sizeof(lock_vars));
52 snprintf(lock_names, MAX_STRING_SIZE, "%s/lock_count", ns->ns_name);
53 lock_names[MAX_STRING_SIZE] = '\0';
54 lock_vars[0].name = lock_names;
55 lock_vars[0].read_fptr = lprocfs_ll_rd;
56 lock_vars[0].write_fptr = NULL;
57 lock_vars[0].data = &ns->ns_locks;
58 lprocfs_add_vars(ldlm_ns_proc_dir, lock_vars, 0);
61 #undef MAX_STRING_SIZE
63 #define LDLM_MAX_UNUSED 20
64 struct ldlm_namespace *ldlm_namespace_new(char *name, __u32 client)
66 struct ldlm_namespace *ns = NULL;
67 struct list_head *bucket;
71 OBD_ALLOC(ns, sizeof(*ns));
77 ns->ns_hash = vmalloc(sizeof(*ns->ns_hash) * RES_HASH_SIZE);
82 obd_memory += sizeof(*ns->ns_hash) * RES_HASH_SIZE;
84 OBD_ALLOC(ns->ns_name, strlen(name) + 1);
89 strcpy(ns->ns_name, name);
91 INIT_LIST_HEAD(&ns->ns_root_list);
92 l_lock_init(&ns->ns_lock);
94 ns->ns_client = client;
95 spin_lock_init(&ns->ns_counter_lock);
99 for (bucket = ns->ns_hash + RES_HASH_SIZE - 1; bucket >= ns->ns_hash;
101 INIT_LIST_HEAD(bucket);
103 INIT_LIST_HEAD(&ns->ns_unused_list);
104 ns->ns_nr_unused = 0;
105 ns->ns_max_unused = LDLM_MAX_UNUSED;
107 spin_lock(&ldlm_namespace_lock);
108 list_add(&ns->ns_list_chain, &ldlm_namespace_list);
109 spin_unlock(&ldlm_namespace_lock);
110 ldlm_proc_namespace(ns);
114 if (ns && ns->ns_hash) {
116 obd_memory -= sizeof(*ns->ns_hash) * RES_HASH_SIZE;
118 if (ns && ns->ns_name)
119 OBD_FREE(ns->ns_name, strlen(name) + 1);
121 OBD_FREE(ns, sizeof(*ns));
125 extern struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock);
127 /* If 'local_only' is true, don't try to tell the server, just cleanup. */
128 static void cleanup_resource(struct ldlm_resource *res, struct list_head *q,
131 struct list_head *tmp, *pos;
132 int rc = 0, client = res->lr_namespace->ns_client;
135 list_for_each_safe(tmp, pos, q) {
136 struct ldlm_lock *lock;
137 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
140 /* At shutdown time, don't call the cancellation callback */
141 lock->l_flags |= LDLM_FL_CANCEL;
144 struct lustre_handle lockh;
145 ldlm_lock2handle(lock, &lockh);
147 rc = ldlm_cli_cancel(&lockh);
149 CERROR("ldlm_cli_cancel: %d\n", rc);
151 /* Force local cleanup on errors, too. */
152 if (local_only || rc != ELDLM_OK)
153 ldlm_lock_cancel(lock);
155 LDLM_DEBUG(lock, "Freeing a lock still held by a "
158 ldlm_resource_unlink_lock(lock);
159 ldlm_lock_destroy(lock);
165 int ldlm_namespace_cleanup(struct ldlm_namespace *ns, int local_only)
169 l_lock(&ns->ns_lock);
170 for (i = 0; i < RES_HASH_SIZE; i++) {
171 struct list_head *tmp, *pos;
172 list_for_each_safe(tmp, pos, &(ns->ns_hash[i])) {
173 struct ldlm_resource *res;
174 res = list_entry(tmp, struct ldlm_resource, lr_hash);
175 ldlm_resource_getref(res);
177 cleanup_resource(res, &res->lr_granted, local_only);
178 cleanup_resource(res, &res->lr_converting, local_only);
179 cleanup_resource(res, &res->lr_waiting, local_only);
181 /* XXX this is a bit counter-intuitive and should
182 * probably be cleaner: don't force cleanup if we're
183 * local_only (which is only used by recovery). We
184 * probably still have outstanding lock refs which
185 * reference these resources. -phil */
186 if (!ldlm_resource_put(res) && !local_only) {
187 CERROR("Resource refcount nonzero (%d) after "
188 "lock cleanup; forcing cleanup.\n",
189 atomic_read(&res->lr_refcount));
190 ldlm_resource_dump(res);
191 atomic_set(&res->lr_refcount, 1);
192 ldlm_resource_put(res);
196 l_unlock(&ns->ns_lock);
201 /* Cleanup, but also free, the namespace */
202 int ldlm_namespace_free(struct ldlm_namespace *ns)
207 spin_lock(&ldlm_namespace_lock);
208 list_del(&ns->ns_list_chain);
210 spin_unlock(&ldlm_namespace_lock);
212 ldlm_namespace_cleanup(ns, 0);
214 vfree(ns->ns_hash /* , sizeof(*ns->ns_hash) * RES_HASH_SIZE */);
215 obd_memory -= sizeof(*ns->ns_hash) * RES_HASH_SIZE;
216 OBD_FREE(ns->ns_name, strlen(ns->ns_name) + 1);
217 OBD_FREE(ns, sizeof(*ns));
222 int ldlm_client_free(struct obd_export *exp)
224 struct ldlm_export_data *led = &exp->exp_ldlm_data;
225 ptlrpc_cleanup_client(&led->led_import);
229 static __u32 ldlm_hash_fn(struct ldlm_resource *parent, __u64 *name)
234 for (i = 0; i < RES_NAME_SIZE; i++)
237 hash += (__u32)((unsigned long)parent >> 4);
239 return (hash & RES_HASH_MASK);
242 static struct ldlm_resource *ldlm_resource_new(void)
244 struct ldlm_resource *res;
246 res = kmem_cache_alloc(ldlm_resource_slab, SLAB_KERNEL);
251 memset(res, 0, sizeof(*res));
253 INIT_LIST_HEAD(&res->lr_children);
254 INIT_LIST_HEAD(&res->lr_childof);
255 INIT_LIST_HEAD(&res->lr_granted);
256 INIT_LIST_HEAD(&res->lr_converting);
257 INIT_LIST_HEAD(&res->lr_waiting);
259 atomic_set(&res->lr_refcount, 1);
264 /* Args: locked namespace
265 * Returns: newly-allocated, referenced, unlocked resource */
266 static struct ldlm_resource *ldlm_resource_add(struct ldlm_namespace *ns,
267 struct ldlm_resource *parent,
268 __u64 *name, __u32 type)
270 struct list_head *bucket;
271 struct ldlm_resource *res;
274 if (type < LDLM_MIN_TYPE || type > LDLM_MAX_TYPE) {
279 res = ldlm_resource_new();
285 spin_lock(&ns->ns_counter_lock);
287 spin_unlock(&ns->ns_counter_lock);
289 memcpy(res->lr_name, name, sizeof(res->lr_name));
290 res->lr_namespace = ns;
294 res->lr_most_restr = LCK_NL;
296 bucket = ns->ns_hash + ldlm_hash_fn(parent, name);
297 list_add(&res->lr_hash, bucket);
300 list_add(&res->lr_childof, &ns->ns_root_list);
302 res->lr_parent = parent;
303 list_add(&res->lr_childof, &parent->lr_children);
309 /* Args: unlocked namespace
310 * Locks: takes and releases ns->ns_lock and res->lr_lock
311 * Returns: referenced, unlocked ldlm_resource or NULL */
312 struct ldlm_resource *ldlm_resource_get(struct ldlm_namespace *ns,
313 struct ldlm_resource *parent,
314 __u64 *name, __u32 type, int create)
316 struct list_head *bucket;
317 struct list_head *tmp = bucket;
318 struct ldlm_resource *res = NULL;
321 if (ns == NULL || ns->ns_hash == NULL) {
326 l_lock(&ns->ns_lock);
327 bucket = ns->ns_hash + ldlm_hash_fn(parent, name);
329 list_for_each(tmp, bucket) {
330 struct ldlm_resource *chk;
331 chk = list_entry(tmp, struct ldlm_resource, lr_hash);
333 if (memcmp(chk->lr_name, name, sizeof(chk->lr_name)) == 0) {
335 atomic_inc(&res->lr_refcount);
341 if (res == NULL && create)
342 res = ldlm_resource_add(ns, parent, name, type);
343 l_unlock(&ns->ns_lock);
348 struct ldlm_resource *ldlm_resource_getref(struct ldlm_resource *res)
350 atomic_inc(&res->lr_refcount);
354 /* Returns 1 if the resource was freed, 0 if it remains. */
355 int ldlm_resource_put(struct ldlm_resource *res)
359 if (atomic_dec_and_test(&res->lr_refcount)) {
360 struct ldlm_namespace *ns = res->lr_namespace;
363 l_lock(&ns->ns_lock);
365 if (atomic_read(&res->lr_refcount) != 0) {
366 /* We lost the race. */
367 l_unlock(&ns->ns_lock);
371 if (!list_empty(&res->lr_granted))
374 if (!list_empty(&res->lr_converting))
377 if (!list_empty(&res->lr_waiting))
380 if (!list_empty(&res->lr_children))
384 list_del(&res->lr_hash);
385 list_del(&res->lr_childof);
387 kmem_cache_free(ldlm_resource_slab, res);
388 l_unlock(&ns->ns_lock);
390 spin_lock(&ns->ns_counter_lock);
392 spin_unlock(&ns->ns_counter_lock);
398 if (atomic_read(&res->lr_refcount) < 0)
405 void ldlm_resource_add_lock(struct ldlm_resource *res, struct list_head *head,
406 struct ldlm_lock *lock)
408 l_lock(&res->lr_namespace->ns_lock);
410 ldlm_resource_dump(res);
411 ldlm_lock_dump(lock);
413 if (!list_empty(&lock->l_res_link))
416 list_add(&lock->l_res_link, head);
417 l_unlock(&res->lr_namespace->ns_lock);
420 void ldlm_resource_unlink_lock(struct ldlm_lock *lock)
422 l_lock(&lock->l_resource->lr_namespace->ns_lock);
423 list_del_init(&lock->l_res_link);
424 l_unlock(&lock->l_resource->lr_namespace->ns_lock);
427 void ldlm_res2desc(struct ldlm_resource *res, struct ldlm_resource_desc *desc)
429 desc->lr_type = res->lr_type;
430 memcpy(desc->lr_name, res->lr_name, sizeof(desc->lr_name));
431 memcpy(desc->lr_version, res->lr_version, sizeof(desc->lr_version));
434 void ldlm_dump_all_namespaces(void)
436 struct list_head *tmp;
438 spin_lock(&ldlm_namespace_lock);
440 list_for_each(tmp, &ldlm_namespace_list) {
441 struct ldlm_namespace *ns;
442 ns = list_entry(tmp, struct ldlm_namespace, ns_list_chain);
443 ldlm_namespace_dump(ns);
446 spin_unlock(&ldlm_namespace_lock);
449 void ldlm_namespace_dump(struct ldlm_namespace *ns)
451 struct list_head *tmp;
453 l_lock(&ns->ns_lock);
454 CDEBUG(D_OTHER, "--- Namespace: %s (rc: %d, client: %d)\n", ns->ns_name,
455 ns->ns_refcount, ns->ns_client);
457 list_for_each(tmp, &ns->ns_root_list) {
458 struct ldlm_resource *res;
459 res = list_entry(tmp, struct ldlm_resource, lr_childof);
461 /* Once we have resources with children, this should really dump
462 * them recursively. */
463 ldlm_resource_dump(res);
465 l_unlock(&ns->ns_lock);
468 void ldlm_resource_dump(struct ldlm_resource *res)
470 struct list_head *tmp;
473 if (RES_NAME_SIZE != 3)
476 snprintf(name, sizeof(name), "%Lx %Lx %Lx",
477 (unsigned long long)res->lr_name[0],
478 (unsigned long long)res->lr_name[1],
479 (unsigned long long)res->lr_name[2]);
481 CDEBUG(D_OTHER, "--- Resource: %p (%s) (rc: %d)\n", res, name,
482 atomic_read(&res->lr_refcount));
483 CDEBUG(D_OTHER, "Namespace: %p (%s)\n", res->lr_namespace,
484 res->lr_namespace->ns_name);
485 CDEBUG(D_OTHER, "Parent: %p, root: %p\n", res->lr_parent, res->lr_root);
487 CDEBUG(D_OTHER, "Granted locks:\n");
488 list_for_each(tmp, &res->lr_granted) {
489 struct ldlm_lock *lock;
490 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
491 ldlm_lock_dump(lock);
494 CDEBUG(D_OTHER, "Converting locks:\n");
495 list_for_each(tmp, &res->lr_converting) {
496 struct ldlm_lock *lock;
497 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
498 ldlm_lock_dump(lock);
501 CDEBUG(D_OTHER, "Waiting locks:\n");
502 list_for_each(tmp, &res->lr_waiting) {
503 struct ldlm_lock *lock;
504 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
505 ldlm_lock_dump(lock);