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
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;
}
*/
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);
}