Viewing: ldlm_resource.c
// SPDX-License-Identifier: GPL-2.0
/*
* Copyright (c) 2002, 2010, Oracle and/or its affiliates. All rights reserved.
* Use is subject to license terms.
*
* Copyright (c) 2010, 2017, Intel Corporation.
*/
/*
* This file is part of Lustre, http://www.lustre.org/
*
* Author: Phil Schwan <phil@clusterfs.com>
* Author: Peter Braam <braam@clusterfs.com>
*/
#define DEBUG_SUBSYSTEM S_LDLM
#include <lustre_dlm.h>
#include <lustre_fid.h>
#include <obd_class.h>
#include "ldlm_internal.h"
struct kmem_cache *ldlm_resource_slab, *ldlm_lock_slab;
struct kmem_cache *ldlm_interval_tree_slab;
struct kmem_cache *ldlm_inodebits_slab;
int ldlm_srv_namespace_nr;
int ldlm_cli_namespace_nr;
DEFINE_MUTEX(ldlm_srv_namespace_lock);
LIST_HEAD(ldlm_srv_namespace_list);
DEFINE_MUTEX(ldlm_cli_namespace_lock);
/* Client Namespaces that have active resources in them. Once all resources go
* away, ldlm_poold moves such namespaces to the inactive list
*/
LIST_HEAD(ldlm_cli_active_namespace_list);
/* Client namespaces that don't have any locks in them */
LIST_HEAD(ldlm_cli_inactive_namespace_list);
static struct dentry *ldlm_debugfs_dir;
static struct dentry *ldlm_ns_debugfs_dir;
struct dentry *ldlm_svc_debugfs_dir;
/* For debug dump, amount of granted locks for one resource to avoid DDOS. */
unsigned int ldlm_dump_granted_max = 256;
static ssize_t ldebugfs_dump_ns_seq_write(struct file *file,
const char __user *buffer,
size_t count, loff_t *off)
{
ldlm_dump_all_namespaces(LDLM_NAMESPACE_SERVER, D_DLMTRACE);
ldlm_dump_all_namespaces(LDLM_NAMESPACE_CLIENT, D_DLMTRACE);
RETURN(count);
}
LDEBUGFS_FOPS_WR_ONLY(ldlm, dump_ns);
static struct ldebugfs_vars ldlm_debugfs_list[] = {
{ .name = "dump_namespaces",
.fops = &ldlm_dump_ns_fops,
.proc_mode = 0222 },
{ NULL }
};
int ldlm_debugfs_setup(void)
{
ENTRY;
ldlm_debugfs_dir = debugfs_create_dir(OBD_LDLM_DEVICENAME,
debugfs_lustre_root);
ldlm_ns_debugfs_dir = debugfs_create_dir("namespaces",
ldlm_debugfs_dir);
ldlm_svc_debugfs_dir = debugfs_create_dir("services",
ldlm_debugfs_dir);
ldebugfs_add_vars(ldlm_debugfs_dir, ldlm_debugfs_list, NULL);
RETURN(0);
}
void ldlm_debugfs_cleanup(void)
{
debugfs_remove_recursive(ldlm_debugfs_dir);
ldlm_svc_debugfs_dir = NULL;
ldlm_ns_debugfs_dir = NULL;
ldlm_debugfs_dir = NULL;
}
static ssize_t resource_count_show(struct kobject *kobj, struct attribute *attr,
char *buf)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
u64 res = 0;
int pos;
struct ldlm_ns_bucket *nsb;
struct cfs_hash_bd bd;
/* result is not strictly consistant */
cfs_hash_for_each_bucket(ns->ns_rs_hash, &bd, pos) {
nsb = cfs_hash_bd_extra_get(ns->ns_rs_hash, &bd);
res += atomic_read(&nsb->nsb_count);
}
return sprintf(buf, "%lld\n", res);
}
LUSTRE_RO_ATTR(resource_count);
static ssize_t lock_count_show(struct kobject *kobj, struct attribute *attr,
char *buf)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
__u64 locks;
locks = lprocfs_stats_collector(ns->ns_stats, LDLM_NSS_LOCKS,
LPROCFS_FIELDS_FLAGS_SUM);
return sprintf(buf, "%lld\n", locks);
}
LUSTRE_RO_ATTR(lock_count);
static ssize_t lock_lru_priv_hits_show(struct kobject *kobj,
struct attribute *attr, char *buf)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
__u64 priv_hits;
priv_hits = lprocfs_stats_collector(ns->ns_stats,
LDLM_NSS_LRU_PRIV_HITS,
LPROCFS_FIELDS_FLAGS_SUM);
return scnprintf(buf, PAGE_SIZE, "%lld\n", priv_hits);
}
LUSTRE_RO_ATTR(lock_lru_priv_hits);
static ssize_t lock_lru_hits_show(struct kobject *kobj, struct attribute *attr,
char *buf)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
__u64 lru_hits;
lru_hits = lprocfs_stats_collector(ns->ns_stats, LDLM_NSS_LRU_HITS,
LPROCFS_FIELDS_FLAGS_SUM);
return scnprintf(buf, PAGE_SIZE, "%lld\n", lru_hits);
}
LUSTRE_RO_ATTR(lock_lru_hits);
static ssize_t lock_unused_count_show(struct kobject *kobj,
struct attribute *attr,
char *buf)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
return sprintf(buf, "%d\n", ns->ns_nr_unused);
}
LUSTRE_RO_ATTR(lock_unused_count);
static ssize_t lock_unused_priv_count_show(struct kobject *kobj,
struct attribute *attr, char *buf)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
return scnprintf(buf, PAGE_SIZE, "%d\n", ns->ns_nr_priv);
}
LUSTRE_RO_ATTR(lock_unused_priv_count);
static ssize_t lru_size_show(struct kobject *kobj, struct attribute *attr,
char *buf)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
__u32 *nr = &ns->ns_max_unused;
if (ns_connect_lru_resize(ns))
nr = &ns->ns_nr_unused;
return scnprintf(buf, PAGE_SIZE, "%u\n", *nr);
}
static ssize_t lru_size_store(struct kobject *kobj, struct attribute *attr,
const char *buffer, size_t count)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
unsigned long tmp;
int lru_resize;
int err;
if (strncmp(buffer, "clear", 5) == 0) {
CDEBUG(D_DLMTRACE,
"dropping all unused locks from namespace %s\n",
ldlm_ns_name(ns));
/* Try to cancel all @ns_nr_unused locks. */
ldlm_cancel_lru(ns, INT_MAX, 0, LDLM_LRU_FLAG_CLEANUP);
/* clear lru stats as well */
ns->ns_lfru_access_window_cnt = 0;
ns->ns_lfru_max_freq = LDLM_LFRU_MIN_PRIV_THRESH;
return count;
}
err = kstrtoul(buffer, 10, &tmp);
if (err != 0) {
CERROR("lru_size: invalid value written\n");
return -EINVAL;
}
lru_resize = (tmp == 0);
if (ns_connect_lru_resize(ns)) {
if (!lru_resize)
ns->ns_max_unused = (unsigned int)tmp;
if (tmp > ns->ns_nr_unused)
tmp = ns->ns_nr_unused;
tmp = ns->ns_nr_unused - tmp;
CDEBUG(D_DLMTRACE,
"changing namespace %s unused locks from %u to %u\n",
ldlm_ns_name(ns), ns->ns_nr_unused,
(unsigned int)tmp);
if (!lru_resize) {
CDEBUG(D_DLMTRACE,
"disable lru_resize for namespace %s\n",
ldlm_ns_name(ns));
ns->ns_connect_flags &= ~OBD_CONNECT_LRU_RESIZE;
}
ldlm_cancel_lru(ns, tmp, LCF_ASYNC, 0);
} else {
CDEBUG(D_DLMTRACE,
"changing namespace %s max_unused from %u to %u\n",
ldlm_ns_name(ns), ns->ns_max_unused,
(unsigned int)tmp);
/* This might be done even before connection from param setting
* config log, so it needs to be remembered to make sure
* LRU_SIZE is being set correctly in connection callback.
* See ptlrpc_connect_set_flags().
*/
spin_lock(&ns->ns_lock);
if (ns->ns_connect_flags == 0)
set_bit(LDLM_NS_LRU_SIZE_SET_BEFORE_CONN, ns->ns_flags);
spin_unlock(&ns->ns_lock);
/* Make sure that LRU resize was originally supported before
* turning it on here.
*/
if (lru_resize &&
(ns->ns_orig_connect_flags & OBD_CONNECT_LRU_RESIZE)) {
CDEBUG(D_DLMTRACE,
"enable lru_resize for namespace %s\n",
ldlm_ns_name(ns));
ns->ns_connect_flags |= OBD_CONNECT_LRU_RESIZE;
}
ns->ns_max_unused = (unsigned int)tmp;
ldlm_cancel_lru(ns, 0, LCF_ASYNC, 0);
}
return count;
}
LUSTRE_RW_ATTR(lru_size);
static ssize_t lru_cancel_batch_show(struct kobject *kobj,
struct attribute *attr, char *buf)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
return snprintf(buf, sizeof(buf) - 1, "%u\n", ns->ns_cancel_batch);
}
static ssize_t lru_cancel_batch_store(struct kobject *kobj,
struct attribute *attr,
const char *buffer, size_t count)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
unsigned long tmp;
if (kstrtoul(buffer, 10, &tmp))
return -EINVAL;
ns->ns_cancel_batch = (unsigned int)tmp;
return count;
}
LUSTRE_RW_ATTR(lru_cancel_batch);
static ssize_t ns_recalc_pct_show(struct kobject *kobj,
struct attribute *attr, char *buf)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
return snprintf(buf, sizeof(buf) - 1, "%u\n", ns->ns_recalc_pct);
}
static ssize_t ns_recalc_pct_store(struct kobject *kobj,
struct attribute *attr,
const char *buffer, size_t count)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
unsigned long tmp;
if (kstrtoul(buffer, 10, &tmp))
return -EINVAL;
if (tmp > 100)
return -ERANGE;
ns->ns_recalc_pct = (unsigned int)tmp;
return count;
}
LUSTRE_RW_ATTR(ns_recalc_pct);
static ssize_t lru_max_age_show(struct kobject *kobj, struct attribute *attr,
char *buf)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
return sprintf(buf, "%lld\n", ktime_to_ms(ns->ns_max_age));
}
static ssize_t lru_max_age_store(struct kobject *kobj, struct attribute *attr,
const char *buffer, size_t count)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
int scale = NSEC_PER_MSEC;
unsigned long long tmp;
char *buf;
/* Did the user ask in seconds or milliseconds. Default is in ms */
buf = strstr(buffer, "ms");
if (!buf) {
buf = strchr(buffer, 's');
if (buf)
scale = NSEC_PER_SEC;
}
if (buf)
*buf = '\0';
if (kstrtoull(buffer, 10, &tmp))
return -EINVAL;
ns->ns_max_age = ktime_set(0, tmp * scale);
return count;
}
LUSTRE_RW_ATTR(lru_max_age);
static ssize_t early_lock_cancel_show(struct kobject *kobj,
struct attribute *attr,
char *buf)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
return sprintf(buf, "%d\n", ns_connect_cancelset(ns));
}
static ssize_t early_lock_cancel_store(struct kobject *kobj,
struct attribute *attr,
const char *buffer,
size_t count)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
unsigned long supp = -1;
int rc;
rc = kstrtoul(buffer, 10, &supp);
if (rc < 0)
return rc;
if (supp == 0)
ns->ns_connect_flags &= ~OBD_CONNECT_CANCELSET;
else if (ns->ns_orig_connect_flags & OBD_CONNECT_CANCELSET)
ns->ns_connect_flags |= OBD_CONNECT_CANCELSET;
return count;
}
LUSTRE_RW_ATTR(early_lock_cancel);
static ssize_t dirty_age_limit_show(struct kobject *kobj,
struct attribute *attr, char *buf)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
return scnprintf(buf, PAGE_SIZE, "%llu\n",
ktime_divns(ns->ns_dirty_age_limit, NSEC_PER_SEC));
}
static ssize_t dirty_age_limit_store(struct kobject *kobj,
struct attribute *attr,
const char *buffer, size_t count)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
unsigned long long tmp;
if (kstrtoull(buffer, 10, &tmp))
return -EINVAL;
ns->ns_dirty_age_limit = ktime_set(tmp, 0);
return count;
}
LUSTRE_RW_ATTR(dirty_age_limit);
static ssize_t dump_stack_on_error_show(struct kobject *kobj,
struct attribute *attr, char *buf)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
return snprintf(buf, sizeof(buf) - 1, "%u\n",
test_bit(LDLM_NS_DUMP_STACK, ns->ns_flags));
}
static ssize_t dump_stack_on_error_store(struct kobject *kobj,
struct attribute *attr,
const char *buffer, size_t count)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
bool tmp;
int err;
err = kstrtobool(buffer, &tmp);
if (err)
return -EINVAL;
if (tmp)
set_bit(LDLM_NS_DUMP_STACK, ns->ns_flags);
else
clear_bit(LDLM_NS_DUMP_STACK, ns->ns_flags);
return count;
}
LUSTRE_RW_ATTR(dump_stack_on_error);
static ssize_t lru_priv_score_threshold_show(struct kobject *kobj,
struct attribute *attr, char *buf)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
return scnprintf(buf, PAGE_SIZE, "%d\n",
ns->ns_lfru_priv_score_threshold);
}
static ssize_t lru_priv_score_threshold_store(struct kobject *kobj,
struct attribute *attr,
const char *buffer, size_t count)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
int tmp;
if (kstrtoint(buffer, 10, &tmp))
return -EINVAL;
ns->ns_lfru_priv_score_threshold = tmp;
/* clear lru stats as well */
ns->ns_lfru_access_window_cnt = 0;
ns->ns_lfru_max_freq = LDLM_LFRU_MIN_PRIV_THRESH;
return count;
}
LUSTRE_RW_ATTR(lru_priv_score_threshold);
static ssize_t lru_priv_ratio_limit_show(struct kobject *kobj,
struct attribute *attr, char *buf)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
int ratio_100 = ns->ns_lfru_priv_ratio_limit_256 * 100 / 256;
return scnprintf(buf, PAGE_SIZE, "%d\n", ratio_100);
}
static ssize_t lru_priv_ratio_limit_store(struct kobject *kobj,
struct attribute *attr,
const char *buffer, size_t count)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
int tmp;
if (kstrtoint(buffer, 10, &tmp))
return -EINVAL;
/* limit ratio to a reasonable percentage of total lock count */
if (tmp < 10 || tmp > 70) {
int rc = -ERANGE;
CWARN("%s: ratio limit '%s' must be between 10-70%%: rc = %d\n",
ns->ns_name, buffer, rc);
return rc;
}
ns->ns_lfru_priv_ratio_limit_256 = tmp * 256 / 100;
return count;
}
LUSTRE_RW_ATTR(lru_priv_ratio_limit);
static ssize_t lock_cache_policy_show(struct kobject *kobj,
struct attribute *attr, char *buf)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
return scnprintf(buf, PAGE_SIZE, "%s\n",
ns->ns_lock_cache_policy == LDLM_LOCK_CACHE_LRU ?
"LRU" : "LFRU");
}
static ssize_t lock_cache_policy_store(struct kobject *kobj,
struct attribute *attr,
const char *buffer, size_t count)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
int policy = -1;
char policy_name[16] = {0};
size_t len = (count < sizeof(policy_name)) ? count :
sizeof(policy_name) - 1;
memcpy(policy_name, buffer, len);
policy_name[len] = '\0';
if (strncasecmp(policy_name, "LRU", 3) == 0)
policy = LDLM_LOCK_CACHE_LRU;
else if (strncasecmp(policy_name, "LFRU", 4) == 0)
policy = LDLM_LOCK_CACHE_LFRU;
else
return -EINVAL;
if (policy == ns->ns_lock_cache_policy)
return count;
spin_lock(&ns->ns_lock);
switch (policy) {
case LDLM_LOCK_CACHE_LRU:
/*
* Demote all privileged locks to the normal LRU list so the
* LRU policy can see them, and keep the state consistent.
*/
if (ns->ns_lock_cache_ops &&
ns->ns_lock_cache_ops->llco_try_batch_demote_locks)
ns->ns_lock_cache_ops->
llco_try_batch_demote_locks(ns, INT_MAX);
ns->ns_lock_cache_policy = policy;
ns->ns_lock_cache_ops = &ldlm_lru_cache_ops;
break;
case LDLM_LOCK_CACHE_LFRU:
ns->ns_lock_cache_policy = policy;
ns->ns_lock_cache_ops = &ldlm_lfru_cache_ops;
ns->ns_lfru_access_window_cnt = 0;
ns->ns_lfru_priv_score_threshold = LDLM_LFRU_MIN_PRIV_THRESH;
ns->ns_lfru_max_freq = LDLM_LFRU_MIN_PRIV_THRESH;
break;
default:
spin_unlock(&ns->ns_lock);
return -EINVAL;
}
spin_unlock(&ns->ns_lock);
return count;
}
LUSTRE_RW_ATTR(lock_cache_policy);
#ifdef CONFIG_LUSTRE_FS_SERVER
static ssize_t ctime_age_limit_show(struct kobject *kobj,
struct attribute *attr, char *buf)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
return scnprintf(buf, PAGE_SIZE, "%u\n", ns->ns_ctime_age_limit);
}
static ssize_t ctime_age_limit_store(struct kobject *kobj,
struct attribute *attr,
const char *buffer, size_t count)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
unsigned long tmp;
if (kstrtoul(buffer, 10, &tmp))
return -EINVAL;
ns->ns_ctime_age_limit = tmp;
return count;
}
LUSTRE_RW_ATTR(ctime_age_limit);
static ssize_t lock_timeouts_show(struct kobject *kobj, struct attribute *attr,
char *buf)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
return sprintf(buf, "%d\n", ns->ns_timeouts);
}
LUSTRE_RO_ATTR(lock_timeouts);
static ssize_t contention_events_show(struct kobject *kobj,
struct attribute *attr, char *buf)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
return scnprintf(buf, PAGE_SIZE, "%u\n",
atomic_read(&ns->ns_contention_events));
}
static ssize_t contention_events_store(struct kobject *kobj,
struct attribute *attr,
const char *buffer, size_t count)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
atomic_set(&ns->ns_contention_events, 0);
return count;
}
LUSTRE_RW_ATTR(contention_events);
static ssize_t contention_seconds_show(struct kobject *kobj,
struct attribute *attr, char *buf)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
return scnprintf(buf, PAGE_SIZE, "%u\n", ns->ns_contention_seconds);
}
static ssize_t contention_seconds_store(struct kobject *kobj,
struct attribute *attr,
const char *buffer, size_t count)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
unsigned int tmp;
if (kstrtouint(buffer, 10, &tmp))
return -EINVAL;
if (tmp == 0 || tmp > 16)
return -EINVAL;
ns->ns_contention_seconds = tmp;
return count;
}
LUSTRE_RW_ATTR(contention_seconds);
static ssize_t contended_locks_show(struct kobject *kobj,
struct attribute *attr, char *buf)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
return sprintf(buf, "%u\n", ns->ns_contended_locks);
}
static ssize_t contended_locks_store(struct kobject *kobj,
struct attribute *attr,
const char *buffer, size_t count)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
unsigned long tmp;
int err;
err = kstrtoul(buffer, 10, &tmp);
if (err != 0)
return -EINVAL;
ns->ns_contended_locks = tmp;
return count;
}
LUSTRE_RW_ATTR(contended_locks);
static ssize_t contention_hold_seconds_show(struct kobject *kobj,
struct attribute *attr, char *buf)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
return scnprintf(buf, PAGE_SIZE, "%u\n", ns->ns_contention_hold_seconds);
}
static ssize_t contention_hold_seconds_store(struct kobject *kobj,
struct attribute *attr,
const char *buffer, size_t count)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
u8 tmp;
if (kstrtou8(buffer, 10, &tmp))
return -EINVAL;
/* limit to a reasonable duration in seconds */
if (tmp < 10 || tmp > 60)
return -EINVAL;
ns->ns_contention_hold_seconds = tmp;
return count;
}
LUSTRE_RW_ATTR(contention_hold_seconds);
static ssize_t max_parallel_ast_show(struct kobject *kobj,
struct attribute *attr, char *buf)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
return sprintf(buf, "%u\n", ns->ns_max_parallel_ast);
}
static ssize_t max_parallel_ast_store(struct kobject *kobj,
struct attribute *attr,
const char *buffer, size_t count)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
unsigned long tmp;
int err;
err = kstrtoul(buffer, 10, &tmp);
if (err != 0)
return -EINVAL;
ns->ns_max_parallel_ast = tmp;
return count;
}
LUSTRE_RW_ATTR(max_parallel_ast);
#endif /* CONFIG_LUSTRE_FS_SERVER */
/* These are for namespaces in /sys/fs/lustre/ldlm/namespaces/ */
static struct attribute *ldlm_ns_attrs[] = {
&lustre_attr_resource_count.attr,
&lustre_attr_lock_count.attr,
&lustre_attr_lock_lru_priv_hits.attr,
&lustre_attr_lock_lru_hits.attr,
&lustre_attr_lock_unused_count.attr,
&lustre_attr_lock_unused_priv_count.attr,
&lustre_attr_ns_recalc_pct.attr,
&lustre_attr_lru_size.attr,
&lustre_attr_lru_cancel_batch.attr,
&lustre_attr_lru_max_age.attr,
&lustre_attr_early_lock_cancel.attr,
&lustre_attr_dirty_age_limit.attr,
&lustre_attr_dump_stack_on_error.attr,
&lustre_attr_lru_priv_score_threshold.attr,
&lustre_attr_lru_priv_ratio_limit.attr,
&lustre_attr_lock_cache_policy.attr,
#ifdef CONFIG_LUSTRE_FS_SERVER
&lustre_attr_ctime_age_limit.attr,
&lustre_attr_lock_timeouts.attr,
&lustre_attr_contention_events.attr,
&lustre_attr_contention_seconds.attr,
&lustre_attr_contended_locks.attr,
&lustre_attr_contention_hold_seconds.attr,
&lustre_attr_max_parallel_ast.attr,
#endif
NULL,
};
static void ldlm_ns_release(struct kobject *kobj)
{
struct ldlm_namespace *ns = container_of(kobj, struct ldlm_namespace,
ns_kobj);
complete(&ns->ns_kobj_unregister);
}
ATTRIBUTE_GROUPS(ldlm_ns);
static struct kobj_type ldlm_ns_ktype = {
.default_groups = ldlm_ns_groups,
.sysfs_ops = &lustre_sysfs_ops,
.release = ldlm_ns_release,
};
static void ldlm_namespace_debugfs_unregister(struct ldlm_namespace *ns)
{
if (IS_ERR_OR_NULL(ns->ns_debugfs_entry))
CERROR("dlm namespace %s has no procfs dir?\n",
ldlm_ns_name(ns));
else
debugfs_remove_recursive(ns->ns_debugfs_entry);
if (ns->ns_stats != NULL)
lprocfs_stats_free(&ns->ns_stats);
}
static void ldlm_namespace_sysfs_unregister(struct ldlm_namespace *ns)
{
kobject_put(&ns->ns_kobj);
wait_for_completion(&ns->ns_kobj_unregister);
}
static int ldlm_namespace_sysfs_register(struct ldlm_namespace *ns)
{
int err;
ns->ns_stats = lprocfs_stats_alloc(LDLM_NSS_LAST, 0);
if (!ns->ns_stats)
return -ENOMEM;
lprocfs_counter_init(ns->ns_stats, LDLM_NSS_LOCKS,
LPROCFS_CNTR_AVGMINMAX | LPROCFS_TYPE_LOCKS,
"locks");
lprocfs_counter_init(ns->ns_stats, LDLM_NSS_LRU_PRIV_HITS,
LPROCFS_CNTR_AVGMINMAX | LPROCFS_TYPE_LOCKS,
"lock_lru_priv_hits");
lprocfs_counter_init(ns->ns_stats, LDLM_NSS_LRU_HITS,
LPROCFS_CNTR_AVGMINMAX | LPROCFS_TYPE_LOCKS,
"lock_lru_hits");
ns->ns_kobj.kset = ldlm_ns_kset;
init_completion(&ns->ns_kobj_unregister);
err = kobject_init_and_add(&ns->ns_kobj, &ldlm_ns_ktype, NULL,
"%s", ldlm_ns_name(ns));
if (err) {
lprocfs_stats_free(&ns->ns_stats);
ns->ns_stats = NULL;
}
return err;
}
static int ldlm_namespace_debugfs_register(struct ldlm_namespace *ns)
{
struct dentry *ns_entry;
if (!IS_ERR_OR_NULL(ns->ns_debugfs_entry)) {
ns_entry = ns->ns_debugfs_entry;
} else {
ns_entry = debugfs_create_dir(ldlm_ns_name(ns),
ldlm_ns_debugfs_dir);
if (!ns_entry)
return -ENOMEM;
ns->ns_debugfs_entry = ns_entry;
}
return 0;
}
#undef MAX_STRING_SIZE
static unsigned int ldlm_res_hop_hash(struct cfs_hash *hs,
const void *key, const unsigned int bits)
{
const struct ldlm_res_id *id = key;
unsigned int val = 0;
unsigned int i;
for (i = 0; i < RES_NAME_SIZE; i++)
val += id->name[i];
return val & ((1UL << bits) - 1);
}
static void *ldlm_res_hop_key(struct hlist_node *hnode)
{
struct ldlm_resource *res;
res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
return &res->lr_name;
}
static int ldlm_res_hop_keycmp(const void *key, struct hlist_node *hnode)
{
struct ldlm_resource *res;
res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
return ldlm_res_eq((const struct ldlm_res_id *)key,
(const struct ldlm_res_id *)&res->lr_name);
}
static void *ldlm_res_hop_object(struct hlist_node *hnode)
{
return hlist_entry(hnode, struct ldlm_resource, lr_hash);
}
static void
ldlm_res_hop_get_locked(struct cfs_hash *hs, struct hlist_node *hnode)
{
struct ldlm_resource *res;
res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
ldlm_resource_getref(res);
}
static void ldlm_res_hop_put(struct cfs_hash *hs, struct hlist_node *hnode)
{
struct ldlm_resource *res;
res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
ldlm_resource_putref(res);
}
static struct cfs_hash_ops ldlm_ns_hash_ops = {
.hs_hash = ldlm_res_hop_hash,
.hs_key = ldlm_res_hop_key,
.hs_keycmp = ldlm_res_hop_keycmp,
.hs_keycpy = NULL,
.hs_object = ldlm_res_hop_object,
.hs_get = ldlm_res_hop_get_locked,
.hs_put = ldlm_res_hop_put
};
static struct {
/** hash bucket bits */
unsigned int nsd_bkt_bits;
/** hash bits */
unsigned int nsd_all_bits;
} ldlm_ns_hash_defs[] = {
[LDLM_NS_TYPE_MDC] = {
.nsd_bkt_bits = 11,
.nsd_all_bits = 16,
},
[LDLM_NS_TYPE_MDT] = {
.nsd_bkt_bits = 14,
.nsd_all_bits = 21,
},
[LDLM_NS_TYPE_OSC] = {
.nsd_bkt_bits = 8,
.nsd_all_bits = 12,
},
[LDLM_NS_TYPE_OST] = {
.nsd_bkt_bits = 11,
.nsd_all_bits = 17,
},
[LDLM_NS_TYPE_MGC] = {
.nsd_bkt_bits = 3,
.nsd_all_bits = 4,
},
[LDLM_NS_TYPE_MGT] = {
.nsd_bkt_bits = 3,
.nsd_all_bits = 4,
},
};
/**
* Create and initialize new empty namespace.
*/
struct ldlm_namespace *ldlm_namespace_new(struct obd_device *obd, char *name,
enum ldlm_side client,
enum ldlm_appetite apt,
enum ldlm_ns_type ns_type)
{
struct ldlm_namespace *ns = NULL;
struct ldlm_ns_bucket *nsb;
int idx;
int rc;
struct cfs_hash_bd bd;
int pos;
ENTRY;
LASSERT(obd != NULL);
rc = ldlm_get_ref();
if (rc) {
CERROR("%s: ldlm_get_ref failed: rc = %d\n", name, rc);
RETURN(ERR_PTR(rc));
}
if (ns_type >= ARRAY_SIZE(ldlm_ns_hash_defs) ||
ldlm_ns_hash_defs[ns_type].nsd_bkt_bits == 0) {
rc = -EINVAL;
CERROR("%s: unknown namespace type %d: rc = %d\n",
name, ns_type, rc);
GOTO(out_ref, rc);
}
OBD_ALLOC_PTR(ns);
if (!ns)
GOTO(out_ref, rc = -ENOMEM);
ns->ns_rs_hash = cfs_hash_create(name,
ldlm_ns_hash_defs[ns_type].nsd_all_bits,
ldlm_ns_hash_defs[ns_type].nsd_all_bits,
ldlm_ns_hash_defs[ns_type].nsd_bkt_bits,
sizeof(*nsb),
CFS_HASH_MIN_THETA,
CFS_HASH_MAX_THETA,
&ldlm_ns_hash_ops,
CFS_HASH_DEPTH |
CFS_HASH_BIGNAME |
CFS_HASH_SPIN_BKTLOCK |
CFS_HASH_NO_ITEMREF);
if (!ns->ns_rs_hash)
GOTO(out_ns, rc = -ENOMEM);
cfs_hash_for_each_bucket(ns->ns_rs_hash, &bd, pos) {
nsb = cfs_hash_bd_extra_get(ns->ns_rs_hash, &bd);
at_init(&nsb->nsb_at_estimate, obd_get_ldlm_enqueue_min(obd), 0);
nsb->nsb_namespace = ns;
nsb->nsb_reclaim_start = 0;
atomic_set(&nsb->nsb_count, 0);
}
ns->ns_obd = obd;
ns->ns_appetite = apt;
ns->ns_client = client;
ns->ns_name = kstrdup(name, GFP_KERNEL);
if (!ns->ns_name)
GOTO(out_hash, rc = -ENOMEM);
INIT_LIST_HEAD(&ns->ns_list_chain);
INIT_LIST_HEAD(&ns->ns_unused_normal_list);
INIT_LIST_HEAD(&ns->ns_unused_priv_list);
spin_lock_init(&ns->ns_lock);
atomic_set(&ns->ns_bref, 0);
init_waitqueue_head(&ns->ns_waitq);
ns->ns_connect_flags = 0;
ns->ns_nr_unused = 0;
ns->ns_nr_priv = 0;
ns->ns_last_pos = &ns->ns_unused_normal_list;
ns->ns_max_unused = LDLM_DEFAULT_LRU_SIZE;
ns->ns_cancel_batch = LDLM_DEFAULT_LRU_SHRINK_BATCH;
ns->ns_recalc_pct = LDLM_DEFAULT_SLV_RECALC_PCT;
ns->ns_max_age = ktime_set(LDLM_DEFAULT_LRU_MAX_AGE, 0);
ns->ns_timeouts = 0;
ns->ns_ctime_age_limit = LDLM_CTIME_AGE_LIMIT;
ns->ns_dirty_age_limit = ktime_set(LDLM_DIRTY_AGE_LIMIT, 0);
ns->ns_contention_seconds = NS_DEFAULT_CONTENTION_SECONDS;
ns->ns_contention_hold_seconds = NS_DEFAULT_CONTENTION_HOLD_SECONDS;
ns->ns_contended_locks = NS_DEFAULT_CONTENDED_LOCKS;
atomic_set(&ns->ns_contention_events, 0);
ns->ns_max_parallel_ast = LDLM_DEFAULT_PARALLEL_AST_LIMIT;
ns->ns_reclaim_start = 0;
ns->ns_lfru_access_window_cnt = 0;
ns->ns_lfru_max_freq = LDLM_LFRU_MIN_PRIV_THRESH;
ns->ns_lfru_priv_score_threshold = LDLM_LFRU_MIN_PRIV_THRESH;
ns->ns_lfru_priv_ratio_limit_256 =
LDLM_LFRU_PRIV_LIST_RATIO_LIMIT * 256 / 100;
ns->ns_lfru_check_window_size =
LDLM_DEFAULT_LRU_SIZE / LDLM_LFRU_UPDATE_WINDOW_DIV;
/* Default to LFRU cache policy */
ns->ns_lock_cache_policy = LDLM_LOCK_CACHE_LFRU;
ns->ns_lock_cache_ops = &ldlm_lfru_cache_ops;
rc = ldlm_namespace_sysfs_register(ns);
if (rc) {
CERROR("%s: cannot initialize ns sysfs: rc = %d\n", name, rc);
GOTO(out_hash, rc);
}
rc = ldlm_namespace_debugfs_register(ns);
if (rc) {
CERROR("%s: cannot initialize ns proc: rc = %d\n", name, rc);
GOTO(out_sysfs, rc);
}
idx = ldlm_namespace_nr_read(client);
rc = ldlm_pool_init(&ns->ns_pool, ns, idx, client);
if (rc) {
CERROR("%s: cannot initialize lock pool, rc = %d\n", name, rc);
GOTO(out_proc, rc);
}
ldlm_namespace_register(ns, client);
RETURN(ns);
out_proc:
ldlm_namespace_debugfs_unregister(ns);
out_sysfs:
ldlm_namespace_sysfs_unregister(ns);
ldlm_namespace_cleanup(ns, 0);
out_hash:
kfree(ns->ns_name);
cfs_hash_putref(ns->ns_rs_hash);
out_ns:
OBD_FREE_PTR(ns);
out_ref:
ldlm_put_ref();
RETURN(ERR_PTR(rc));
}
EXPORT_SYMBOL(ldlm_namespace_new);
/**
* Cancel and destroy all locks on a resource.
*
* If flags contains FL_LOCAL_ONLY, don't try to tell the server, just
* clean up. This is currently only used for recovery, and we make
* certain assumptions as a result--notably, that we shouldn't cancel
* locks with refs.
*/
static void cleanup_resource(struct ldlm_resource *res, struct list_head *q,
u64 flags)
{
int rc = 0, client = ns_is_client(ldlm_res_to_ns(res));
bool local_only = !!(flags & LDLM_FL_LOCAL_ONLY);
do {
struct ldlm_lock *lock = NULL, *tmp;
/* First, we look for non-cleaned-yet lock. all cleaned locks
* are marked by CLEANED flag.
*/
lock_res(res);
list_for_each_entry(tmp, q, l_res_link) {
if (ldlm_is_cleaned(tmp))
continue;
lock = tmp;
ldlm_lock_get(lock);
ldlm_set_cleaned(lock);
break;
}
if (lock == NULL) {
unlock_res(res);
break;
}
/* Set CBPENDING so nothing is in the cancellation path
* can match this lock.
*/
ldlm_set_cbpending(lock);
ldlm_set_failed(lock);
ldlm_clear_converting(lock);
lock->l_flags |= flags;
/* ... without sending a CANCEL message for local_only. */
if (local_only)
ldlm_set_local_only(lock);
if (local_only && (lock->l_readers || lock->l_writers)) {
/*
* This is a little bit gross, but much better than the
* alternative: pretend that we got a blocking AST from
* the server, so that when the lock is decref'd, it
* will go away ...
*/
unlock_res(res);
LDLM_DEBUG(lock, "setting FL_LOCAL_ONLY");
if (lock->l_flags & LDLM_FL_FAIL_LOC)
schedule_timeout_uninterruptible(
cfs_time_seconds(4));
if (lock->l_completion_ast)
lock->l_completion_ast(lock,
LDLM_FL_FAILED, NULL);
ldlm_lock_put(lock);
continue;
}
if (client) {
struct lustre_handle lockh;
unlock_res(res);
ldlm_lock2handle(lock, &lockh);
rc = ldlm_cli_cancel(&lockh, LCF_LOCAL);
if (rc)
CERROR("ldlm_cli_cancel: %d\n", rc);
} else {
unlock_res(res);
LDLM_DEBUG(lock,
"Freeing a lock still held by a client node");
ldlm_lock_cancel(lock);
}
ldlm_lock_put(lock);
} while (1);
}
static int ldlm_resource_clean(struct cfs_hash *hs, struct cfs_hash_bd *bd,
struct hlist_node *hnode, void *arg)
{
struct ldlm_resource *res = cfs_hash_object(hs, hnode);
__u64 flags = *(__u64 *)arg;
cleanup_resource(res, &res->lr_granted, flags);
cleanup_resource(res, &res->lr_waiting, flags);
return 0;
}
static int ldlm_resource_complain(struct cfs_hash *hs, struct cfs_hash_bd *bd,
struct hlist_node *hnode, void *arg)
{
struct ldlm_resource *res = cfs_hash_object(hs, hnode);
lock_res(res);
CERROR("%s: namespace resource "DLDLMRES" (%p) refcount nonzero (%d) after lock cleanup; forcing cleanup.\n",
ldlm_ns_name(ldlm_res_to_ns(res)), PLDLMRES(res), res,
refcount_read(&res->lr_refcount) - 1);
/* Use D_NETERROR since it is in the default mask */
ldlm_resource_dump(D_NETERROR, res);
unlock_res(res);
return 0;
}
/**
* Cancel and destroy all locks in the namespace.
*
* Typically used during evictions when server notified client that it was
* evicted and all of its state needs to be destroyed.
* Also used during shutdown.
*/
int ldlm_namespace_cleanup(struct ldlm_namespace *ns, __u64 flags)
{
if (ns == NULL) {
CDEBUG(D_INFO, "NULL ns, skipping cleanup\n");
return ELDLM_OK;
}
cfs_hash_for_each_nolock(ns->ns_rs_hash, ldlm_resource_clean,
&flags, 0);
cfs_hash_for_each_nolock(ns->ns_rs_hash, ldlm_resource_complain,
NULL, 0);
return ELDLM_OK;
}
EXPORT_SYMBOL(ldlm_namespace_cleanup);
/**
* Attempts to free namespace.
*
* Only used when namespace goes away, like during an unmount.
*/
static int __ldlm_namespace_free(struct ldlm_namespace *ns, int force)
{
ENTRY;
/* At shutdown time, don't call the cancellation callback */
ldlm_namespace_cleanup(ns, force ? LDLM_FL_LOCAL_ONLY : 0);
if (atomic_read(&ns->ns_bref) > 0) {
int rc;
CDEBUG(D_DLMTRACE,
"dlm namespace %s free waiting on refcount %d\n",
ldlm_ns_name(ns), atomic_read(&ns->ns_bref));
force_wait:
if (force)
rc = wait_event_idle_timeout(
ns->ns_waitq,
atomic_read(&ns->ns_bref) == 0,
cfs_time_seconds(1) / 4);
else
rc = l_wait_event_abortable(
ns->ns_waitq, atomic_read(&ns->ns_bref) == 0);
/* Forced cleanups should be able to reclaim all references,
* so it's safe to wait forever... we can't leak locks...
*/
if (force && rc == 0) {
rc = -ETIMEDOUT;
LCONSOLE_ERROR("Forced cleanup waiting for %s namespace with %d resources in use, "
"(rc=%d)\n", ldlm_ns_name(ns),
atomic_read(&ns->ns_bref), rc);
GOTO(force_wait, rc);
}
if (atomic_read(&ns->ns_bref)) {
LCONSOLE_ERROR("Cleanup waiting for %s namespace with %d resources in use, (rc=%d)\n",
ldlm_ns_name(ns),
atomic_read(&ns->ns_bref), rc);
RETURN(ELDLM_NAMESPACE_EXISTS);
}
CDEBUG(D_DLMTRACE, "dlm namespace %s free done waiting\n",
ldlm_ns_name(ns));
}
RETURN(ELDLM_OK);
}
/**
* Performs various cleanups for passed \a ns to make it drop refc and be
* ready for freeing. Waits for refc == 0.
*
* The following is done:
* (0) Unregister \a ns from its list to make inaccessible for potential
* users like pools thread and others;
* (1) Clear all locks in \a ns.
*/
void ldlm_namespace_free_prior(struct ldlm_namespace *ns,
struct obd_import *imp, int force)
{
int rc;
ENTRY;
if (!ns) {
EXIT;
return;
}
spin_lock(&ns->ns_lock);
set_bit(LDLM_NS_STOPPING, ns->ns_flags);
spin_unlock(&ns->ns_lock);
/* Can fail with -EINTR when force == 0 in which case try harder. */
rc = __ldlm_namespace_free(ns, force);
if (rc != ELDLM_OK) {
if (imp) {
ptlrpc_disconnect_import(imp, 0);
ptlrpc_invalidate_import(imp);
}
/*
* With all requests dropped and the import inactive
* we are gaurenteed all reference will be dropped.
*/
rc = __ldlm_namespace_free(ns, 1);
LASSERT(rc == 0);
}
EXIT;
}
EXPORT_SYMBOL(ldlm_namespace_free_prior);
/**
* Performs freeing memory structures related to \a ns. This is only done
* when ldlm_namespce_free_prior() successfully removed all resources
* referencing \a ns and its refc == 0.
*/
void ldlm_namespace_free_post(struct ldlm_namespace *ns)
{
ENTRY;
if (!ns) {
EXIT;
return;
}
/* Make sure that nobody can find this ns in its list. */
ldlm_namespace_unregister(ns, ns->ns_client);
/* Fini pool _before_ parent proc dir is removed. This is important as
* ldlm_pool_fini() removes own proc dir which is child to @dir.
* Removing it after @dir may cause oops.
*/
ldlm_pool_fini(&ns->ns_pool);
ldlm_namespace_debugfs_unregister(ns);
ldlm_namespace_sysfs_unregister(ns);
cfs_hash_putref(ns->ns_rs_hash);
kfree(ns->ns_name);
/* Namespace \a ns should be not on list at this time, otherwise
* this will cause issues related to using freed \a ns in poold
* thread.
*/
LASSERT(list_empty(&ns->ns_list_chain));
OBD_FREE_PTR(ns);
ldlm_put_ref();
EXIT;
}
EXPORT_SYMBOL(ldlm_namespace_free_post);
/**
* Cleanup the resource, and free namespace.
* bug 12864:
* Deadlock issue:
* proc1: destroy import
* class_disconnect_export(grab cl_sem) ->
* -> ldlm_namespace_free ->
* -> lprocfs_remove(grab _lprocfs_lock).
* proc2: read proc info
* lprocfs_fops_read(grab _lprocfs_lock) ->
* -> osc_rd_active, etc(grab cl_sem).
*
* So that I have to split the ldlm_namespace_free into two parts - the first
* part ldlm_namespace_free_prior is used to cleanup the resource which is
* being used; the 2nd part ldlm_namespace_free_post is used to unregister the
* lprocfs entries, and then free memory. It will be called w/o cli->cl_sem
* held.
*/
void ldlm_namespace_free(struct ldlm_namespace *ns,
struct obd_import *imp,
int force)
{
ldlm_namespace_free_prior(ns, imp, force);
ldlm_namespace_free_post(ns);
}
EXPORT_SYMBOL(ldlm_namespace_free);
void ldlm_namespace_get(struct ldlm_namespace *ns)
{
atomic_inc(&ns->ns_bref);
}
/* This is only for callers that care about refcount */
static int ldlm_namespace_get_return(struct ldlm_namespace *ns)
{
return atomic_inc_return(&ns->ns_bref);
}
void ldlm_namespace_put(struct ldlm_namespace *ns)
{
if (atomic_dec_and_lock(&ns->ns_bref, &ns->ns_lock)) {
wake_up(&ns->ns_waitq);
spin_unlock(&ns->ns_lock);
}
}
/** Register \a ns in the list of namespaces */
void ldlm_namespace_register(struct ldlm_namespace *ns, enum ldlm_side client)
{
mutex_lock(ldlm_namespace_lock(client));
LASSERT(list_empty(&ns->ns_list_chain));
list_add(&ns->ns_list_chain, ldlm_namespace_inactive_list(client));
ldlm_namespace_nr_inc(client);
mutex_unlock(ldlm_namespace_lock(client));
}
/** Unregister \a ns from the list of namespaces. */
void ldlm_namespace_unregister(struct ldlm_namespace *ns, enum ldlm_side client)
{
mutex_lock(ldlm_namespace_lock(client));
LASSERT(!list_empty(&ns->ns_list_chain));
/* Some asserts and possibly other parts of the code are still
* using list_empty(&ns->ns_list_chain). This is why it is
* important to use list_del_init() here.
*/
list_del_init(&ns->ns_list_chain);
ldlm_namespace_nr_dec(client);
mutex_unlock(ldlm_namespace_lock(client));
}
/** Should be called with ldlm_namespace_lock(client) taken. */
void ldlm_namespace_move_to_active_locked(struct ldlm_namespace *ns,
enum ldlm_side client)
{
LASSERT(!list_empty(&ns->ns_list_chain));
LASSERT(mutex_is_locked(ldlm_namespace_lock(client)));
list_move_tail(&ns->ns_list_chain, ldlm_namespace_list(client));
}
/** Should be called with ldlm_namespace_lock(client) taken. */
void ldlm_namespace_move_to_inactive_locked(struct ldlm_namespace *ns,
enum ldlm_side client)
{
LASSERT(!list_empty(&ns->ns_list_chain));
LASSERT(mutex_is_locked(ldlm_namespace_lock(client)));
list_move_tail(&ns->ns_list_chain,
ldlm_namespace_inactive_list(client));
}
/** Should be called with ldlm_namespace_lock(client) taken. */
struct ldlm_namespace *ldlm_namespace_first_locked(enum ldlm_side client)
{
LASSERT(mutex_is_locked(ldlm_namespace_lock(client)));
LASSERT(!list_empty(ldlm_namespace_list(client)));
return container_of(ldlm_namespace_list(client)->next,
struct ldlm_namespace, ns_list_chain);
}
static bool ldlm_resource_extent_new(struct ldlm_resource *res)
{
int idx;
OBD_SLAB_ALLOC(res->lr_itree, ldlm_interval_tree_slab,
sizeof(*res->lr_itree) * LCK_MODE_NUM);
if (res->lr_itree == NULL)
return false;
/* Initialize interval trees for each lock mode. */
for (idx = 0; idx < LCK_MODE_NUM; idx++) {
res->lr_itree[idx].lit_size = 0;
res->lr_itree[idx].lit_mode = BIT(idx);
res->lr_itree[idx].lit_root = RB_ROOT_CACHED;
}
return true;
}
static bool ldlm_resource_inodebits_new(struct ldlm_resource *res)
{
int i;
OBD_ALLOC_PTR(res->lr_ibits_queues);
if (res->lr_ibits_queues == NULL)
return false;
for (i = 0; i < MDS_INODELOCK_NUMBITS; i++)
INIT_LIST_HEAD(&res->lr_ibits_queues->liq_waiting[i]);
return true;
}
static bool ldlm_resource_flock_new(struct ldlm_resource *res)
{
res->lr_flock_node.lfn_needs_reprocess = false;
res->lr_flock_node.lfn_root = RB_ROOT_CACHED;
atomic_set(&res->lr_flock_node.lfn_unlock_pending, 0);
return true;
}
/** Create and initialize new resource. */
static struct ldlm_resource *ldlm_resource_new(enum ldlm_type ldlm_type)
{
struct ldlm_resource *res;
bool rc;
OBD_SLAB_ALLOC_PTR_GFP(res, ldlm_resource_slab, GFP_NOFS);
if (res == NULL)
return NULL;
switch (ldlm_type) {
case LDLM_EXTENT:
rc = ldlm_resource_extent_new(res);
break;
case LDLM_IBITS:
rc = ldlm_resource_inodebits_new(res);
break;
case LDLM_FLOCK:
rc = ldlm_resource_flock_new(res);
break;
default:
rc = true;
break;
}
if (!rc) {
OBD_SLAB_FREE_PTR(res, ldlm_resource_slab);
return NULL;
}
INIT_LIST_HEAD(&res->lr_granted);
INIT_LIST_HEAD(&res->lr_waiting);
INIT_LIST_HEAD(&res->lr_enqueueing);
refcount_set(&res->lr_refcount, 1);
spin_lock_init(&res->lr_lock);
/* Since LVB init can be delayed now, there is no longer need to
* immediatelly acquire mutex here.
*/
mutex_init(&res->lr_lvb_mutex);
res->lr_lvb_initialized = false;
memset(&res->lr_contention_hist, 0, sizeof(res->lr_contention_hist));
return res;
}
static void __ldlm_resource_free(struct rcu_head *head)
{
struct ldlm_resource *res = container_of(head, struct ldlm_resource,
lr_rcu);
OBD_SLAB_FREE_PTR(res, ldlm_resource_slab);
}
static void ldlm_resource_free(struct ldlm_resource *res)
{
if (res->lr_type == LDLM_EXTENT) {
if (res->lr_itree != NULL)
OBD_SLAB_FREE(res->lr_itree, ldlm_interval_tree_slab,
sizeof(*res->lr_itree) * LCK_MODE_NUM);
} else if (res->lr_type == LDLM_IBITS) {
OBD_FREE_PTR(res->lr_ibits_queues);
}
call_rcu(&res->lr_rcu, __ldlm_resource_free);
}
/**
* Return a reference to resource with given name, creating it if necessary.
* Args: namespace with ns_lock unlocked
* Locks: takes and releases NS hash-lock and res->lr_lock
* Returns: referenced, unlocked ldlm_resource or ERR_PTR
*/
struct ldlm_resource *
ldlm_resource_get(struct ldlm_namespace *ns, const struct ldlm_res_id *name,
enum ldlm_type type, int create)
{
struct hlist_node *hnode;
struct ldlm_resource *res = NULL;
struct cfs_hash_bd bd;
__u64 version;
int ns_refcount = 0;
LASSERT(ns != NULL);
LASSERT(ns->ns_rs_hash != NULL);
LASSERT(name->name[0] != 0);
cfs_hash_bd_get_and_lock(ns->ns_rs_hash, (void *)name, &bd, 0);
hnode = cfs_hash_bd_lookup_locked(ns->ns_rs_hash, &bd, (void *)name);
if (hnode != NULL) {
cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 0);
GOTO(found, res);
}
version = cfs_hash_bd_version_get(&bd);
cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 0);
if (create == 0)
return ERR_PTR(-ENOENT);
LASSERTF(type >= LDLM_TYPE_MIN && type < LDLM_TYPE_END,
"type: %d\n", type);
res = ldlm_resource_new(type);
if (res == NULL)
return ERR_PTR(-ENOMEM);
res->lr_name = *name;
res->lr_type = type;
cfs_hash_bd_lock(ns->ns_rs_hash, &bd, 1);
res->lr_ns_bucket = cfs_hash_bd_extra_get(ns->ns_rs_hash, &bd);
hnode = (version == cfs_hash_bd_version_get(&bd)) ? NULL :
cfs_hash_bd_lookup_locked(ns->ns_rs_hash, &bd, (void *)name);
if (hnode != NULL) {
/* Someone won the race and already added the resource. */
cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
ldlm_resource_free(res);
found:
res = hlist_entry(hnode, struct ldlm_resource, lr_hash);
return res;
}
/* We won! Let's add the resource. */
cfs_hash_bd_add_locked(ns->ns_rs_hash, &bd, &res->lr_hash);
if (atomic_inc_return(&res->lr_ns_bucket->nsb_count) == 1)
ns_refcount = ldlm_namespace_get_return(ns);
cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
CFS_FAIL_TIMEOUT(OBD_FAIL_LDLM_CREATE_RESOURCE, 2);
/* Let's see if we happened to be the very first resource in this
* namespace. If so, and this is a client namespace, we need to move
* the namespace into the active namespaces list to be patrolled by
* the ldlm_poold.
*/
if (ns_is_client(ns) && ns_refcount == 1) {
mutex_lock(ldlm_namespace_lock(LDLM_NAMESPACE_CLIENT));
ldlm_namespace_move_to_active_locked(ns, LDLM_NAMESPACE_CLIENT);
mutex_unlock(ldlm_namespace_lock(LDLM_NAMESPACE_CLIENT));
}
return res;
}
EXPORT_SYMBOL(ldlm_resource_get);
struct ldlm_resource *ldlm_resource_getref(struct ldlm_resource *res)
{
LASSERT(res != NULL);
LASSERT(res != LP_POISON);
refcount_inc(&res->lr_refcount);
CDEBUG(D_INFO, "getref res: %p count: %d\n", res,
refcount_read(&res->lr_refcount));
return res;
}
static void __ldlm_resource_putref_final(struct cfs_hash_bd *bd,
struct ldlm_resource *res)
{
struct ldlm_ns_bucket *nsb = res->lr_ns_bucket;
if (!list_empty(&res->lr_granted)) {
ldlm_resource_dump(D_ERROR, res);
LBUG();
}
if (!list_empty(&res->lr_waiting)) {
ldlm_resource_dump(D_ERROR, res);
LBUG();
}
if (!list_empty(&res->lr_enqueueing)) {
ldlm_resource_dump(D_ERROR, res);
LBUG();
}
cfs_hash_bd_del_locked(nsb->nsb_namespace->ns_rs_hash,
bd, &res->lr_hash);
if (atomic_dec_and_test(&nsb->nsb_count))
ldlm_namespace_put(nsb->nsb_namespace);
}
/* Returns 1 if the resource was freed, 0 if it remains. */
int ldlm_resource_putref(struct ldlm_resource *res)
{
struct ldlm_valblock_ops *ns_lvbo;
struct ldlm_namespace *ns;
struct cfs_hash_bd bd;
int refcount;
if (refcount_dec_not_one(&res->lr_refcount))
return 0;
ns = ldlm_res_to_ns(res);
/* save ops as __ldlm_resource_putref_final() may
* initiate namespace release in a separate thread */
ns_lvbo = ns->ns_lvbo;
refcount = refcount_read(&res->lr_refcount);
LASSERT(refcount < LI_POISON);
CDEBUG(D_INFO, "putref res: %p count: %d\n",
res, refcount_read(&res->lr_refcount) - 1);
cfs_hash_bd_get(ns->ns_rs_hash, &res->lr_name, &bd);
if (cfs_hash_bd_dec_and_lock(ns->ns_rs_hash, &bd, &res->lr_refcount)) {
__ldlm_resource_putref_final(&bd, res);
cfs_hash_bd_unlock(ns->ns_rs_hash, &bd, 1);
if (ns_lvbo && ns_lvbo->lvbo_free)
ns_lvbo->lvbo_free(res);
ldlm_resource_free(res);
return 1;
}
return 0;
}
EXPORT_SYMBOL(ldlm_resource_putref);
static void __ldlm_resource_add_lock(struct ldlm_resource *res,
struct list_head *head,
struct ldlm_lock *lock,
bool tail)
{
check_res_locked(res);
if (ldlm_is_destroyed(lock)) {
CDEBUG(D_OTHER, "Lock destroyed, not adding to resource\n");
return;
}
LASSERT(list_empty(&lock->l_res_link));
if (tail)
list_add_tail(&lock->l_res_link, head);
else
list_add(&lock->l_res_link, head);
if (res->lr_type == LDLM_IBITS)
ldlm_inodebits_add_lock(res, head, lock, tail);
else if (res->lr_type == LDLM_FLOCK)
LASSERT(lock->l_req_mode != LCK_NL || head != &res->lr_waiting);
ldlm_resource_dump(D_INFO, res);
}
/* Add a lock into a given resource into specified lock list. */
void ldlm_resource_add_lock(struct ldlm_resource *res, struct list_head *head,
struct ldlm_lock *lock)
{
LDLM_DEBUG(lock, "About to add this lock");
__ldlm_resource_add_lock(res, head, lock, true);
}
/* Insert a lock into resource after specified lock. */
void ldlm_resource_insert_lock_after(struct ldlm_lock *original,
struct ldlm_lock *new)
{
LASSERT(!list_empty(&original->l_res_link));
LDLM_DEBUG(new, "About to insert this lock after %p: ", original);
__ldlm_resource_add_lock(original->l_resource,
&original->l_res_link,
new, false);
}
/**
* Insert a lock into resource before the specified lock.
*
* IBITS waiting locks are to be inserted to the ibit lists as well, and only
* the insert-after operation is supported for them, because the set of bits
* of the previous and the new locks must match. Therefore, get the previous
* lock and insert after.
*/
void ldlm_resource_insert_lock_before(struct ldlm_lock *original,
struct ldlm_lock *new)
{
LASSERT(!list_empty(&original->l_res_link));
LDLM_DEBUG(new, "About to insert this lock before %p: ", original);
__ldlm_resource_add_lock(original->l_resource,
original->l_res_link.prev, new, false);
}
void ldlm_resource_unlink_lock(struct ldlm_lock *lock)
{
int type = lock->l_resource->lr_type;
check_res_locked(lock->l_resource);
switch (type) {
case LDLM_PLAIN:
ldlm_unlink_lock_skiplist(lock);
break;
case LDLM_EXTENT:
ldlm_extent_unlink_lock(lock);
break;
case LDLM_IBITS:
ldlm_inodebits_unlink_lock(lock);
break;
case LDLM_FLOCK:
ldlm_flock_unlink_lock(lock);
break;
}
list_del_init(&lock->l_res_link);
}
EXPORT_SYMBOL(ldlm_resource_unlink_lock);
void ldlm_res2desc(struct ldlm_resource *res, struct ldlm_resource_desc *desc)
{
desc->lr_type = res->lr_type;
desc->lr_name = res->lr_name;
}
/* Print info about all locks in all namespaces on this node to debug log. */
void ldlm_dump_all_namespaces(enum ldlm_side client, int level)
{
struct ldlm_namespace *ns;
if (!((libcfs_debug | D_ERROR) & level))
return;
mutex_lock(ldlm_namespace_lock(client));
list_for_each_entry(ns, ldlm_namespace_list(client), ns_list_chain)
ldlm_namespace_dump(level, ns);
mutex_unlock(ldlm_namespace_lock(client));
}
static int ldlm_res_hash_dump(struct cfs_hash *hs, struct cfs_hash_bd *bd,
struct hlist_node *hnode, void *arg)
{
struct ldlm_resource *res = cfs_hash_object(hs, hnode);
int level = (int)(unsigned long)arg;
lock_res(res);
ldlm_resource_dump(level, res);
unlock_res(res);
return 0;
}
/* Print info about all locks in this namespace on this node to debug log. */
void ldlm_namespace_dump(int level, struct ldlm_namespace *ns)
{
if (!((libcfs_debug | D_ERROR) & level))
return;
CDEBUG(level, "--- Namespace: %s (rc: %d, side: %s)\n",
ldlm_ns_name(ns), atomic_read(&ns->ns_bref),
ns_is_client(ns) ? "client" : "server");
if (ktime_get_seconds() < ns->ns_next_dump)
return;
cfs_hash_for_each_nolock(ns->ns_rs_hash,
ldlm_res_hash_dump,
(void *)(unsigned long)level, 0);
spin_lock(&ns->ns_lock);
ns->ns_next_dump = ktime_get_seconds() + 10;
spin_unlock(&ns->ns_lock);
}
/* Print information about all locks in this resource to debug log. */
void ldlm_resource_dump(int level, struct ldlm_resource *res)
{
struct ldlm_lock *lock;
unsigned int granted = 0;
BUILD_BUG_ON(RES_NAME_SIZE != 4);
if (!((libcfs_debug | D_ERROR) & level))
return;
CDEBUG(level, "--- Resource: "DLDLMRES" (%p) refcount = %d\n",
PLDLMRES(res), res, refcount_read(&res->lr_refcount));
if (!list_empty(&res->lr_granted)) {
CDEBUG(level, "Granted locks (in reverse order):\n");
list_for_each_entry_reverse(lock, &res->lr_granted,
l_res_link) {
LDLM_DEBUG_LIMIT(level, lock, "###");
if (!(level & D_CANTMASK) &&
++granted > ldlm_dump_granted_max) {
CDEBUG(level,
"only dump %d granted locks to avoid DDOS.\n",
granted);
break;
}
}
}
if (!list_empty(&res->lr_waiting)) {
CDEBUG(level, "Waiting locks:\n");
list_for_each_entry(lock, &res->lr_waiting, l_res_link)
LDLM_DEBUG_LIMIT(level, lock, "###");
}
}
EXPORT_SYMBOL(ldlm_resource_dump);
