/*
* Copyright (c) 2002, 2010, Oracle and/or its affiliates. All rights reserved.
* Use is subject to license terms.
+ *
+ * Copyright (c) 2011 Whamcloud, Inc.
+ *
*/
/*
* This file is part of Lustre, http://www.lustre.org/
#ifdef __KERNEL__
# include <libcfs/libcfs.h>
-# ifndef HAVE_VFS_INTENT_PATCHES
# include <linux/lustre_intent.h>
-# endif
#else
# include <liblustre.h>
#endif
[LDLM_IBITS] "IBT",
};
+static ldlm_policy_wire_to_local_t ldlm_policy_wire_to_local[] = {
+ [LDLM_PLAIN - LDLM_MIN_TYPE] ldlm_plain_policy_wire_to_local,
+ [LDLM_EXTENT - LDLM_MIN_TYPE] ldlm_extent_policy_wire_to_local,
+ [LDLM_FLOCK - LDLM_MIN_TYPE] ldlm_flock_policy_wire_to_local,
+ [LDLM_IBITS - LDLM_MIN_TYPE] ldlm_ibits_policy_wire_to_local,
+};
+
+static ldlm_policy_local_to_wire_t ldlm_policy_local_to_wire[] = {
+ [LDLM_PLAIN - LDLM_MIN_TYPE] ldlm_plain_policy_local_to_wire,
+ [LDLM_EXTENT - LDLM_MIN_TYPE] ldlm_extent_policy_local_to_wire,
+ [LDLM_FLOCK - LDLM_MIN_TYPE] ldlm_flock_policy_local_to_wire,
+ [LDLM_IBITS - LDLM_MIN_TYPE] ldlm_ibits_policy_local_to_wire,
+};
+
+/**
+ * Converts lock policy from local format to on the wire lock_desc format
+ */
+void ldlm_convert_policy_to_wire(ldlm_type_t type,
+ const ldlm_policy_data_t *lpolicy,
+ ldlm_wire_policy_data_t *wpolicy)
+{
+ ldlm_policy_local_to_wire_t convert;
+
+ convert = ldlm_policy_local_to_wire[type - LDLM_MIN_TYPE];
+
+ convert(lpolicy, wpolicy);
+}
+
+/**
+ * Converts lock policy from on the wire lock_desc format to local format
+ */
+void ldlm_convert_policy_to_local(ldlm_type_t type,
+ const ldlm_wire_policy_data_t *wpolicy,
+ ldlm_policy_data_t *lpolicy)
+{
+ ldlm_policy_wire_to_local_t convert;
+
+ convert = ldlm_policy_wire_to_local[type - LDLM_MIN_TYPE];
+
+ convert(wpolicy, lpolicy);
+}
+
char *ldlm_it2str(int it)
{
switch (it) {
LASSERT(cfs_list_empty(&lock->l_res_link));
LASSERT(cfs_list_empty(&lock->l_pending_chain));
- cfs_atomic_dec(&ldlm_res_to_ns(res)->ns_locks);
+ lprocfs_counter_decr(ldlm_res_to_ns(res)->ns_stats,
+ LDLM_NSS_LOCKS);
lu_ref_del(&res->lr_reference, "lock", lock);
ldlm_resource_putref(res);
lock->l_resource = NULL;
RETURN(0);
}
- cfs_spin_lock(&ns->ns_unused_lock);
+ cfs_spin_lock(&ns->ns_lock);
rc = ldlm_lock_remove_from_lru_nolock(lock);
- cfs_spin_unlock(&ns->ns_unused_lock);
+ cfs_spin_unlock(&ns->ns_lock);
EXIT;
return rc;
}
struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
ENTRY;
- cfs_spin_lock(&ns->ns_unused_lock);
+ cfs_spin_lock(&ns->ns_lock);
ldlm_lock_add_to_lru_nolock(lock);
- cfs_spin_unlock(&ns->ns_unused_lock);
+ cfs_spin_unlock(&ns->ns_lock);
EXIT;
}
return;
}
- cfs_spin_lock(&ns->ns_unused_lock);
+ cfs_spin_lock(&ns->ns_lock);
if (!cfs_list_empty(&lock->l_lru)) {
ldlm_lock_remove_from_lru_nolock(lock);
ldlm_lock_add_to_lru_nolock(lock);
}
- cfs_spin_unlock(&ns->ns_unused_lock);
+ cfs_spin_unlock(&ns->ns_lock);
EXIT;
}
CFS_INIT_LIST_HEAD(&lock->l_sl_policy);
CFS_INIT_HLIST_NODE(&lock->l_exp_hash);
- cfs_atomic_inc(&ldlm_res_to_ns(resource)->ns_locks);
+ lprocfs_counter_incr(ldlm_res_to_ns(resource)->ns_stats,
+ LDLM_NSS_LOCKS);
CFS_INIT_LIST_HEAD(&lock->l_handle.h_link);
class_handle_hash(&lock->l_handle, lock_handle_addref);
unlock_res_and_lock(lock);
newres = ldlm_resource_get(ns, NULL, new_resid, type, 1);
- lu_ref_add(&newres->lr_reference, "lock", lock);
if (newres == NULL)
RETURN(-ENOMEM);
+
+ lu_ref_add(&newres->lr_reference, "lock", lock);
/*
* To flip the lock from the old to the new resource, lock, oldres and
* newres have to be locked. Resource spin-locks are nested within
struct ldlm_lock *__ldlm_handle2lock(const struct lustre_handle *handle,
int flags)
{
- struct ldlm_namespace *ns;
- struct ldlm_lock *lock, *retval = NULL;
+ struct ldlm_lock *lock;
ENTRY;
LASSERT(handle);
if (lock == NULL)
RETURN(NULL);
- LASSERT(lock->l_resource != NULL);
- ns = ldlm_lock_to_ns(lock);
- LASSERT(ns != NULL);
+ /* It's unlikely but possible that someone marked the lock as
+ * destroyed after we did handle2object on it */
+ if (flags == 0 && !lock->l_destroyed) {
+ lu_ref_add(&lock->l_reference, "handle", cfs_current());
+ RETURN(lock);
+ }
- lu_ref_add_atomic(&lock->l_reference, "handle", cfs_current());
lock_res_and_lock(lock);
- /* It's unlikely but possible that someone marked the lock as
- * destroyed after we did handle2object on it */
- if (lock->l_destroyed) {
+ LASSERT(lock->l_resource != NULL);
+
+ lu_ref_add_atomic(&lock->l_reference, "handle", cfs_current());
+ if (unlikely(lock->l_destroyed)) {
unlock_res_and_lock(lock);
CDEBUG(D_INFO, "lock already destroyed: lock %p\n", lock);
LDLM_LOCK_PUT(lock);
- GOTO(out, retval);
+ RETURN(NULL);
}
if (flags && (lock->l_flags & flags)) {
unlock_res_and_lock(lock);
LDLM_LOCK_PUT(lock);
- GOTO(out, retval);
+ RETURN(NULL);
}
if (flags)
lock->l_flags |= flags;
unlock_res_and_lock(lock);
- retval = lock;
- EXIT;
- out:
- return retval;
+ RETURN(lock);
}
void ldlm_lock2desc(struct ldlm_lock *lock, struct ldlm_lock_desc *desc)
ldlm_res2desc(lock->l_resource, &desc->l_resource);
desc->l_req_mode = lock->l_req_mode;
desc->l_granted_mode = lock->l_granted_mode;
- desc->l_policy_data = lock->l_policy_data;
+ ldlm_convert_policy_to_wire(lock->l_resource->lr_type,
+ &lock->l_policy_data,
+ &desc->l_policy_data);
}
}
*
* Send an existing rpc set specified by @arg->set and then
* destroy it. Create new one if @do_create flag is set. */
-static void
-ldlm_send_and_maybe_create_set(struct ldlm_cb_set_arg *arg, int do_create)
+static int ldlm_deliver_cb_set(struct ldlm_cb_set_arg *arg, int do_create)
{
+ int rc = 0;
ENTRY;
- ptlrpc_set_wait(arg->set);
- if (arg->type == LDLM_BL_CALLBACK)
- OBD_FAIL_TIMEOUT(OBD_FAIL_LDLM_GLIMPSE, 2);
- ptlrpc_set_destroy(arg->set);
+ if (arg->set) {
+ ptlrpc_set_wait(arg->set);
+ if (arg->type == LDLM_BL_CALLBACK)
+ OBD_FAIL_TIMEOUT(OBD_FAIL_LDLM_GLIMPSE, 2);
+ ptlrpc_set_destroy(arg->set);
+ arg->set = NULL;
+ arg->rpcs = 0;
+ }
- if (do_create)
+ if (do_create) {
arg->set = ptlrpc_prep_set();
+ if (arg->set == NULL)
+ rc = -ENOMEM;
+ }
- EXIT;
+ RETURN(rc);
}
static int
struct ldlm_lock_desc d;
struct ldlm_lock *lock = cfs_list_entry(tmp, struct ldlm_lock,
l_bl_ast);
+ int rc;
ENTRY;
/* nobody should touch l_bl_ast */
ldlm_lock2desc(lock->l_blocking_lock, &d);
- lock->l_blocking_ast(lock, &d, (void *)arg,
- LDLM_CB_BLOCKING);
+ rc = lock->l_blocking_ast(lock, &d, (void *)arg,
+ LDLM_CB_BLOCKING);
LDLM_LOCK_RELEASE(lock->l_blocking_lock);
lock->l_blocking_lock = NULL;
LDLM_LOCK_RELEASE(lock);
- RETURN(1);
+ RETURN(rc);
}
static int
lock->l_flags &= ~LDLM_FL_CP_REQD;
unlock_res_and_lock(lock);
- if (completion_callback != NULL) {
- completion_callback(lock, 0, (void *)arg);
- rc = 1;
- }
+ if (completion_callback != NULL)
+ rc = completion_callback(lock, 0, (void *)arg);
LDLM_LOCK_RELEASE(lock);
RETURN(rc);
struct ldlm_lock_desc desc;
struct ldlm_lock *lock = cfs_list_entry(tmp, struct ldlm_lock,
l_rk_ast);
+ int rc;
ENTRY;
cfs_list_del_init(&lock->l_rk_ast);
desc.l_req_mode = LCK_EX;
desc.l_granted_mode = 0;
- lock->l_blocking_ast(lock, &desc, (void*)arg, LDLM_CB_BLOCKING);
+ rc = lock->l_blocking_ast(lock, &desc, (void*)arg, LDLM_CB_BLOCKING);
LDLM_LOCK_RELEASE(lock);
- RETURN(1);
+ RETURN(rc);
}
-int ldlm_run_ast_work(cfs_list_t *rpc_list, ldlm_desc_ast_t ast_type)
+int ldlm_run_ast_work(struct ldlm_namespace *ns, cfs_list_t *rpc_list,
+ ldlm_desc_ast_t ast_type)
{
- struct ldlm_cb_set_arg arg;
+ struct ldlm_cb_set_arg arg = { 0 };
cfs_list_t *tmp, *pos;
int (*work_ast_lock)(cfs_list_t *tmp, struct ldlm_cb_set_arg *arg);
- int ast_count;
+ unsigned int max_ast_count;
+ int rc;
ENTRY;
if (cfs_list_empty(rpc_list))
RETURN(0);
- arg.set = ptlrpc_prep_set();
- if (NULL == arg.set)
- RETURN(-ERESTART);
- cfs_atomic_set(&arg.restart, 0);
+ rc = ldlm_deliver_cb_set(&arg, 1);
+ if (rc != 0)
+ RETURN(rc);
+
switch (ast_type) {
case LDLM_WORK_BL_AST:
arg.type = LDLM_BL_CALLBACK;
LBUG();
}
- ast_count = 0;
+ max_ast_count = ns->ns_max_parallel_ast ? : UINT_MAX;
+
cfs_list_for_each_safe(tmp, pos, rpc_list) {
- ast_count += work_ast_lock(tmp, &arg);
-
- /* Send the request set if it exceeds the PARALLEL_AST_LIMIT,
- * and create a new set for requests that remained in
- * @rpc_list */
- if (unlikely(ast_count == PARALLEL_AST_LIMIT)) {
- ldlm_send_and_maybe_create_set(&arg, 1);
- ast_count = 0;
+ (void)work_ast_lock(tmp, &arg);
+ if (arg.rpcs > max_ast_count) {
+ rc = ldlm_deliver_cb_set(&arg, 1);
+ if (rc != 0)
+ break;
}
}
- if (ast_count > 0)
- ldlm_send_and_maybe_create_set(&arg, 0);
- else
- /* In case when number of ASTs is multiply of
- * PARALLEL_AST_LIMIT or @rpc_list was initially empty,
- * @arg.set must be destroyed here, otherwise we get
- * write memory leaking. */
- ptlrpc_set_destroy(arg.set);
+ (void)ldlm_deliver_cb_set(&arg, 0);
- RETURN(cfs_atomic_read(&arg.restart) ? -ERESTART : 0);
+ if (rc == 0 && cfs_atomic_read(&arg.restart))
+ rc = -ERESTART;
+
+ RETURN(rc);
}
static int reprocess_one_queue(struct ldlm_resource *res, void *closure)
return LDLM_ITER_CONTINUE;
}
-void ldlm_reprocess_all_ns(struct ldlm_namespace *ns)
+static int ldlm_reprocess_res(cfs_hash_t *hs, cfs_hash_bd_t *bd,
+ cfs_hlist_node_t *hnode, void *arg)
{
- cfs_list_t *tmp;
- int i, rc;
+ struct ldlm_resource *res = cfs_hash_object(hs, hnode);
+ int rc;
- if (ns == NULL)
- return;
+ rc = reprocess_one_queue(res, arg);
+ return rc == LDLM_ITER_STOP;
+}
+
+void ldlm_reprocess_all_ns(struct ldlm_namespace *ns)
+{
ENTRY;
- cfs_spin_lock(&ns->ns_hash_lock);
- for (i = 0; i < RES_HASH_SIZE; i++) {
- tmp = ns->ns_hash[i].next;
- while (tmp != &(ns->ns_hash[i])) {
- struct ldlm_resource *res =
- cfs_list_entry(tmp, struct ldlm_resource,
- lr_hash);
-
- ldlm_resource_getref(res);
- cfs_spin_unlock(&ns->ns_hash_lock);
- LDLM_RESOURCE_ADDREF(res);
-
- rc = reprocess_one_queue(res, NULL);
-
- LDLM_RESOURCE_DELREF(res);
- cfs_spin_lock(&ns->ns_hash_lock);
- tmp = tmp->next;
- ldlm_resource_putref_locked(res);
-
- if (rc == LDLM_ITER_STOP)
- GOTO(out, rc);
- }
+
+ if (ns != NULL) {
+ cfs_hash_for_each_nolock(ns->ns_rs_hash,
+ ldlm_reprocess_res, NULL);
}
- out:
- cfs_spin_unlock(&ns->ns_hash_lock);
EXIT;
}
ldlm_reprocess_queue(res, &res->lr_waiting, &rpc_list);
unlock_res(res);
- rc = ldlm_run_ast_work(&rpc_list, LDLM_WORK_CP_AST);
+ rc = ldlm_run_ast_work(ldlm_res_to_ns(res), &rpc_list,
+ LDLM_WORK_CP_AST);
if (rc == -ERESTART) {
LASSERT(cfs_list_empty(&rpc_list));
goto restart;
int ldlm_lock_set_data(struct lustre_handle *lockh, void *data)
{
struct ldlm_lock *lock = ldlm_handle2lock(lockh);
+ int rc = -EINVAL;
ENTRY;
- if (lock == NULL)
- RETURN(-EINVAL);
-
- lock->l_ast_data = data;
- LDLM_LOCK_PUT(lock);
- RETURN(0);
+ if (lock) {
+ if (lock->l_ast_data == NULL)
+ lock->l_ast_data = data;
+ if (lock->l_ast_data == data)
+ rc = 0;
+ LDLM_LOCK_PUT(lock);
+ }
+ RETURN(rc);
}
+EXPORT_SYMBOL(ldlm_lock_set_data);
int ldlm_cancel_locks_for_export_cb(cfs_hash_t *hs, cfs_hash_bd_t *bd,
cfs_hlist_node_t *hnode, void *data)
*/
void ldlm_lock_downgrade(struct ldlm_lock *lock, int new_mode)
{
- struct ldlm_namespace *ns;
ENTRY;
LASSERT(lock->l_granted_mode & (LCK_PW | LCK_EX));
* Remove the lock from pool as it will be added again in
* ldlm_grant_lock() called below.
*/
- ns = ldlm_lock_to_ns(lock);
- ldlm_pool_del(&ns->ns_pool, lock);
+ ldlm_pool_del(&ldlm_lock_to_ns(lock)->ns_pool, lock);
lock->l_req_mode = new_mode;
ldlm_grant_lock(lock, NULL);
ldlm_grant_lock(lock, &rpc_list);
granted = 1;
- /* FIXME: completion handling not with ns_lock held ! */
+ /* FIXME: completion handling not with lr_lock held ! */
if (lock->l_completion_ast)
lock->l_completion_ast(lock, 0, NULL);
}
unlock_res_and_lock(lock);
if (granted)
- ldlm_run_ast_work(&rpc_list, LDLM_WORK_CP_AST);
+ ldlm_run_ast_work(ns, &rpc_list, LDLM_WORK_CP_AST);
if (node)
OBD_SLAB_FREE(node, ldlm_interval_slab, sizeof(*node));
RETURN(res);
git://git.whamcloud.com / fs / lustre-release.git / blobdiff