#define DEBUG_SUBSYSTEM S_LDLM
#include <linux/lustre_dlm.h>
+#include <linux/obd_class.h>
kmem_cache_t *ldlm_resource_slab, *ldlm_lock_slab;
+spinlock_t ldlm_namespace_lock = SPIN_LOCK_UNLOCKED;
+struct list_head ldlm_namespace_list = LIST_HEAD_INIT(ldlm_namespace_list);
+static struct proc_dir_entry *ldlm_ns_proc_dir = NULL;
+
+int ldlm_proc_setup(struct obd_device *obd)
+{
+ ENTRY;
+ LASSERT(ldlm_ns_proc_dir == NULL);
+ ldlm_ns_proc_dir=obd->obd_type->typ_procroot;
+ RETURN(0);
+}
+
+void ldlm_proc_cleanup(struct obd_device *obd)
+{
+ ldlm_ns_proc_dir = NULL;
+}
+
+#define MAX_STRING_SIZE 100
+void ldlm_proc_namespace(struct ldlm_namespace *ns)
+{
+ struct lprocfs_vars lock_vars[2];
+ char lock_names[MAX_STRING_SIZE+1];
+
+ memset(lock_vars, 0, sizeof(lock_vars));
+ snprintf(lock_names, MAX_STRING_SIZE, "%s/resource_count", ns->ns_name);
+ lock_names[MAX_STRING_SIZE] = '\0';
+ lock_vars[0].name = lock_names;
+ lock_vars[0].read_fptr = lprocfs_ll_rd;
+ lock_vars[0].write_fptr = NULL;
+ lock_vars[0].data = &ns->ns_resources;
+ lprocfs_add_vars(ldlm_ns_proc_dir, lock_vars, 0);
+
+ memset(lock_vars, 0, sizeof(lock_vars));
+ snprintf(lock_names, MAX_STRING_SIZE, "%s/lock_count", ns->ns_name);
+ lock_names[MAX_STRING_SIZE] = '\0';
+ lock_vars[0].name = lock_names;
+ lock_vars[0].read_fptr = lprocfs_ll_rd;
+ lock_vars[0].write_fptr = NULL;
+ lock_vars[0].data = &ns->ns_locks;
+ lprocfs_add_vars(ldlm_ns_proc_dir, lock_vars, 0);
+
+}
+#undef MAX_STRING_SIZE
+
+#define LDLM_MAX_UNUSED 20
struct ldlm_namespace *ldlm_namespace_new(char *name, __u32 client)
{
struct ldlm_namespace *ns = NULL;
struct list_head *bucket;
+
+
OBD_ALLOC(ns, sizeof(*ns));
if (!ns) {
LBUG();
LBUG();
GOTO(out, ns);
}
+ obd_memory += sizeof(*ns->ns_hash) * RES_HASH_SIZE;
OBD_ALLOC(ns->ns_name, strlen(name) + 1);
if (!ns->ns_name) {
}
strcpy(ns->ns_name, name);
- ptlrpc_init_client(NULL, NULL, LDLM_REQUEST_PORTAL, LDLM_REPLY_PORTAL,
- &ns->ns_rpc_client);
-
INIT_LIST_HEAD(&ns->ns_root_list);
l_lock_init(&ns->ns_lock);
ns->ns_refcount = 0;
ns->ns_client = client;
+ spin_lock_init(&ns->ns_counter_lock);
+ ns->ns_locks = 0;
+ ns->ns_resources = 0;
for (bucket = ns->ns_hash + RES_HASH_SIZE - 1; bucket >= ns->ns_hash;
bucket--)
INIT_LIST_HEAD(bucket);
+
+ INIT_LIST_HEAD(&ns->ns_unused_list);
+ ns->ns_nr_unused = 0;
+ ns->ns_max_unused = LDLM_MAX_UNUSED;
+
+ spin_lock(&ldlm_namespace_lock);
+ list_add(&ns->ns_list_chain, &ldlm_namespace_list);
+ spin_unlock(&ldlm_namespace_lock);
+ ldlm_proc_namespace(ns);
RETURN(ns);
out:
- if (ns && ns->ns_hash)
+ if (ns && ns->ns_hash) {
vfree(ns->ns_hash);
+ obd_memory -= sizeof(*ns->ns_hash) * RES_HASH_SIZE;
+ }
if (ns && ns->ns_name)
OBD_FREE(ns->ns_name, strlen(name) + 1);
if (ns)
extern struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock);
-static void cleanup_resource(struct ldlm_resource *res, struct list_head *q)
+/* If 'local_only' is true, don't try to tell the server, just cleanup. */
+static void cleanup_resource(struct ldlm_resource *res, struct list_head *q,
+ int local_only)
{
struct list_head *tmp, *pos;
int rc = 0, client = res->lr_namespace->ns_client;
lock = list_entry(tmp, struct ldlm_lock, l_res_link);
LDLM_LOCK_GET(lock);
+ /* At shutdown time, don't call the cancellation callback */
+ lock->l_flags |= LDLM_FL_CANCEL;
+
if (client) {
struct lustre_handle lockh;
ldlm_lock2handle(lock, &lockh);
- /* can we get away without a connh here? */
- rc = ldlm_cli_cancel(&lockh, NULL);
- if (rc < 0) {
- CERROR("ldlm_cli_cancel: %d\n", rc);
- LBUG();
+ if (!local_only) {
+ rc = ldlm_cli_cancel(&lockh);
+ if (rc)
+ CERROR("ldlm_cli_cancel: %d\n", rc);
}
+ /* Force local cleanup on errors, too. */
+ if (local_only || rc != ELDLM_OK)
+ ldlm_lock_cancel(lock);
} else {
- CERROR("Freeing a lock still held by a client node.\n");
+ LDLM_DEBUG(lock, "Freeing a lock still held by a "
+ "client node.\n");
ldlm_resource_unlink_lock(lock);
ldlm_lock_destroy(lock);
}
LDLM_LOCK_PUT(lock);
}
-
- return;
}
-int ldlm_namespace_free(struct ldlm_namespace *ns)
+int ldlm_namespace_cleanup(struct ldlm_namespace *ns, int local_only)
{
- struct list_head *tmp, *pos;
int i;
- if (!ns)
- RETURN(ELDLM_OK);
-
l_lock(&ns->ns_lock);
-
for (i = 0; i < RES_HASH_SIZE; i++) {
+ struct list_head *tmp, *pos;
list_for_each_safe(tmp, pos, &(ns->ns_hash[i])) {
struct ldlm_resource *res;
res = list_entry(tmp, struct ldlm_resource, lr_hash);
ldlm_resource_getref(res);
- cleanup_resource(res, &res->lr_granted);
- cleanup_resource(res, &res->lr_converting);
- cleanup_resource(res, &res->lr_waiting);
-
- if (!ldlm_resource_put(res)) {
+ cleanup_resource(res, &res->lr_granted, local_only);
+ cleanup_resource(res, &res->lr_converting, local_only);
+ cleanup_resource(res, &res->lr_waiting, local_only);
+
+ /* XXX this is a bit counter-intuitive and should
+ * probably be cleaner: don't force cleanup if we're
+ * local_only (which is only used by recovery). We
+ * probably still have outstanding lock refs which
+ * reference these resources. -phil */
+ if (!ldlm_resource_put(res) && !local_only) {
CERROR("Resource refcount nonzero (%d) after "
"lock cleanup; forcing cleanup.\n",
atomic_read(&res->lr_refcount));
}
}
}
+ l_unlock(&ns->ns_lock);
+
+ return ELDLM_OK;
+}
- vfree(ns->ns_hash /* , sizeof(struct list_head) * RES_HASH_SIZE */);
- ptlrpc_cleanup_client(&ns->ns_rpc_client);
+/* Cleanup, but also free, the namespace */
+int ldlm_namespace_free(struct ldlm_namespace *ns)
+{
+ if (!ns)
+ RETURN(ELDLM_OK);
+
+ spin_lock(&ldlm_namespace_lock);
+ list_del(&ns->ns_list_chain);
+
+ spin_unlock(&ldlm_namespace_lock);
+
+ ldlm_namespace_cleanup(ns, 0);
+
+ vfree(ns->ns_hash /* , sizeof(*ns->ns_hash) * RES_HASH_SIZE */);
+ obd_memory -= sizeof(*ns->ns_hash) * RES_HASH_SIZE;
OBD_FREE(ns->ns_name, strlen(ns->ns_name) + 1);
OBD_FREE(ns, sizeof(*ns));
return ELDLM_OK;
}
+int ldlm_client_free(struct obd_export *exp)
+{
+ struct ldlm_export_data *led = &exp->exp_ldlm_data;
+ ptlrpc_cleanup_client(&led->led_import);
+ RETURN(0);
+}
+
static __u32 ldlm_hash_fn(struct ldlm_resource *parent, __u64 *name)
{
__u32 hash = 0;
RETURN(NULL);
}
+ spin_lock(&ns->ns_counter_lock);
+ ns->ns_resources++;
+ spin_unlock(&ns->ns_counter_lock);
+
memcpy(res->lr_name, name, sizeof(res->lr_name));
res->lr_namespace = ns;
ns->ns_refcount++;
bucket = ns->ns_hash + ldlm_hash_fn(parent, name);
list_add(&res->lr_hash, bucket);
- if (parent == NULL) {
- res->lr_parent = res;
- list_add(&res->lr_rootlink, &ns->ns_root_list);
- } else {
+ if (parent == NULL)
+ list_add(&res->lr_childof, &ns->ns_root_list);
+ else {
res->lr_parent = parent;
list_add(&res->lr_childof, &parent->lr_children);
}
ns->ns_refcount--;
list_del(&res->lr_hash);
- list_del(&res->lr_rootlink);
list_del(&res->lr_childof);
kmem_cache_free(ldlm_resource_slab, res);
l_unlock(&ns->ns_lock);
+
+ spin_lock(&ns->ns_counter_lock);
+ ns->ns_resources--;
+ spin_unlock(&ns->ns_counter_lock);
+
rc = 1;
} else {
ENTRY;
memcpy(desc->lr_version, res->lr_version, sizeof(desc->lr_version));
}
+void ldlm_dump_all_namespaces(void)
+{
+ struct list_head *tmp;
+
+ spin_lock(&ldlm_namespace_lock);
+
+ list_for_each(tmp, &ldlm_namespace_list) {
+ struct ldlm_namespace *ns;
+ ns = list_entry(tmp, struct ldlm_namespace, ns_list_chain);
+ ldlm_namespace_dump(ns);
+ }
+
+ spin_unlock(&ldlm_namespace_lock);
+}
+
+void ldlm_namespace_dump(struct ldlm_namespace *ns)
+{
+ struct list_head *tmp;
+
+ l_lock(&ns->ns_lock);
+ CDEBUG(D_OTHER, "--- Namespace: %s (rc: %d, client: %d)\n", ns->ns_name,
+ ns->ns_refcount, ns->ns_client);
+
+ list_for_each(tmp, &ns->ns_root_list) {
+ struct ldlm_resource *res;
+ res = list_entry(tmp, struct ldlm_resource, lr_childof);
+
+ /* Once we have resources with children, this should really dump
+ * them recursively. */
+ ldlm_resource_dump(res);
+ }
+ l_unlock(&ns->ns_lock);
+}
+
void ldlm_resource_dump(struct ldlm_resource *res)
{
struct list_head *tmp;
git://git.whamcloud.com / fs / lustre-release.git / blobdiff