#include <obd.h>
#include "lov_internal.h"
+static void lov_pool_getref(struct pool_desc *pool) {
+ atomic_inc(&pool->pool_refcount);
+}
+
+static void lov_pool_putref(struct pool_desc *pool) {
+ if (atomic_dec_and_test(&pool->pool_refcount)) {
+ lov_ost_pool_free(&(pool->pool_rr.lqr_pool));
+ lov_ost_pool_free(&(pool->pool_obds));
+ OBD_FREE_PTR(pool);
+ }
+}
+
+
/*
* hash function using a Rotating Hash algorithm
* Knuth, D. The Art of Computer Programming,
struct pool_desc *pool;
pool = hlist_entry(hnode, struct pool_desc, pool_hash);
+ lov_pool_getref(pool);
return (pool);
}
struct pool_desc *pool;
pool = hlist_entry(hnode, struct pool_desc, pool_hash);
+ lov_pool_putref(pool);
return (pool);
}
/* iterate to find a non empty entry */
prev_idx = iter->idx;
- read_lock(&pool_tgt_rwlock(iter->pool));
+ down_read(&pool_tgt_rw_sem(iter->pool));
iter->idx++;
if (iter->idx == pool_tgt_count(iter->pool)) {
iter->idx = prev_idx; /* we stay on the last entry */
- read_unlock(&pool_tgt_rwlock(iter->pool));
+ up_read(&pool_tgt_rw_sem(iter->pool));
return NULL;
}
- read_unlock(&pool_tgt_rwlock(iter->pool));
+ up_read(&pool_tgt_rw_sem(iter->pool));
(*pos)++;
/* return != NULL to continue */
return iter;
struct pool_desc *pool = (struct pool_desc *)s->private;
struct pool_iterator *iter;
+ lov_pool_getref(pool);
if ((pool_tgt_count(pool) == 0) ||
- (*pos >= pool_tgt_count(pool)))
+ (*pos >= pool_tgt_count(pool))) {
+ /* iter is not created, so stop() has no way to
+ * find pool to dec ref */
+ lov_pool_putref(pool);
return NULL;
+ }
- OBD_ALLOC(iter, sizeof(struct pool_iterator));
+ OBD_ALLOC_PTR(iter);
if (!iter)
return ERR_PTR(-ENOMEM);
iter->magic = POOL_IT_MAGIC;
/* we restore s->private so next call to pool_proc_start()
* will work */
s->private = iter->pool;
- OBD_FREE(iter, sizeof(struct pool_iterator));
+ lov_pool_putref(iter->pool);
+ OBD_FREE_PTR(iter);
}
return;
}
LASSERT(iter->pool != NULL);
LASSERT(iter->idx <= pool_tgt_count(iter->pool));
- read_lock(&pool_tgt_rwlock(iter->pool));
+ down_read(&pool_tgt_rw_sem(iter->pool));
tgt = pool_tgt(iter->pool, iter->idx);
- read_unlock(&pool_tgt_rwlock(iter->pool));
+ up_read(&pool_tgt_rw_sem(iter->pool));
if (tgt)
seq_printf(s, "%s\n", obd_uuid2str(&(tgt->ltd_uuid)));
{
int i;
+ lov_pool_getref(pool);
+
CDEBUG(level, "pool "LOV_POOLNAMEF" has %d members\n",
pool->pool_name, pool->pool_obds.op_count);
- read_lock(&pool_tgt_rwlock(pool));
+ down_read(&pool_tgt_rw_sem(pool));
+
for (i = 0; i < pool_tgt_count(pool) ; i++) {
if (!pool_tgt(pool, i) || !(pool_tgt(pool, i))->ltd_exp)
continue;
pool->pool_name, i,
obd_uuid2str(&((pool_tgt(pool, i))->ltd_uuid)));
}
- read_unlock(&pool_tgt_rwlock(pool));
+
+ up_read(&pool_tgt_rw_sem(pool));
+ lov_pool_putref(pool);
}
#define LOV_POOL_INIT_COUNT 2
count = LOV_POOL_INIT_COUNT;
op->op_array = NULL;
op->op_count = 0;
- rwlock_init(&op->op_rwlock);
+ init_rwsem(&op->op_rw_sem);
op->op_size = count;
OBD_ALLOC(op->op_array, op->op_size * sizeof(op->op_array[0]));
if (op->op_array == NULL) {
int rc = 0, i;
ENTRY;
- write_lock(&op->op_rwlock);
+ down_write(&op->op_rw_sem);
rc = lov_ost_pool_extend(op, max_count);
if (rc)
op->op_array[op->op_count] = idx;
op->op_count++;
out:
- write_unlock(&op->op_rwlock);
+ up_write(&op->op_rw_sem);
return rc;
}
{
int i;
- write_lock(&op->op_rwlock);
+ down_write(&op->op_rw_sem);
+
for (i = 0; i < op->op_count; i++) {
if (op->op_array[i] == idx) {
memmove(&op->op_array[i], &op->op_array[i + 1],
(op->op_count - i - 1) * sizeof(op->op_array[0]));
op->op_count--;
- write_unlock(&op->op_rwlock);
+ up_write(&op->op_rw_sem);
return 0;
}
}
- write_unlock(&op->op_rwlock);
+
+ up_write(&op->op_rw_sem);
return -EINVAL;
}
if (op->op_size == 0)
return 0;
- write_lock(&op->op_rwlock);
+ down_write(&op->op_rw_sem);
+
OBD_FREE(op->op_array, op->op_size * sizeof(op->op_array[0]));
op->op_array = NULL;
op->op_count = 0;
op->op_size = 0;
- write_unlock(&op->op_rwlock);
+
+ up_write(&op->op_rw_sem);
return 0;
}
struct lov_obd *lov;
struct pool_desc *new_pool;
int rc;
+ ENTRY;
lov = &(obd->u.lov);
if (strlen(poolname) > LOV_MAXPOOLNAME)
- return -ENAMETOOLONG;
+ RETURN(-ENAMETOOLONG);
OBD_ALLOC_PTR(new_pool);
if (new_pool == NULL)
- return -ENOMEM;
+ RETURN(-ENOMEM);
strncpy(new_pool->pool_name, poolname, LOV_MAXPOOLNAME);
new_pool->pool_name[LOV_MAXPOOLNAME] = '\0';
new_pool->pool_lov = lov;
+ /* ref count init to 1 because when created a pool is always used
+ * up to deletion
+ */
+ atomic_set(&new_pool->pool_refcount, 1);
rc = lov_ost_pool_init(&new_pool->pool_obds, 0);
if (rc)
GOTO(out_err, rc);
spin_lock(&obd->obd_dev_lock);
list_add_tail(&new_pool->pool_list, &lov->lov_pool_list);
lov->lov_pool_count++;
+
spin_unlock(&obd->obd_dev_lock);
CDEBUG(D_CONFIG, LOV_POOLNAMEF" is pool #%d\n",
#ifdef LPROCFS
/* ifdef needed for liblustre */
+ /* get ref for /proc file */
+ lov_pool_getref(new_pool);
new_pool->pool_proc_entry = lprocfs_add_simple(lov->lov_pool_proc_entry,
poolname, NULL, NULL,
new_pool,
if (IS_ERR(new_pool->pool_proc_entry)) {
CWARN("Cannot add proc pool entry "LOV_POOLNAMEF"\n", poolname);
new_pool->pool_proc_entry = NULL;
+ lov_pool_putref(new_pool);
}
- return 0;
+ RETURN(0);
out_err:
OBD_FREE_PTR(new_pool);
{
struct lov_obd *lov;
struct pool_desc *pool;
+ ENTRY;
lov = &(obd->u.lov);
spin_lock(&obd->obd_dev_lock);
- pool = lustre_hash_lookup(lov->lov_pools_hash_body,
- poolname);
+
+ pool = lustre_hash_lookup(lov->lov_pools_hash_body, poolname);
if (pool == NULL) {
spin_unlock(&obd->obd_dev_lock);
- return -ENOENT;
+ RETURN(-ENOENT);
}
#ifdef LPROCFS
- if (pool->pool_proc_entry != NULL)
+ if (pool->pool_proc_entry != NULL) {
remove_proc_entry(pool->pool_proc_entry->name,
pool->pool_proc_entry->parent);
+ /* remove ref for /proc file */
+ lov_pool_putref(pool);
+ }
#endif
lustre_hash_del_key(lov->lov_pools_hash_body, poolname);
+ list_del_init(&pool->pool_list);
lov->lov_pool_count--;
-
+ lh_put(lov->lov_pools_hash_body, &pool->pool_hash);
spin_unlock(&obd->obd_dev_lock);
- /* pool struct is not freed because it may be used by
- * some open in /proc. The struct is freed at lov_cleanup()
- */
- return 0;
+ /* remove ref got when pool was created in memory
+ * pool will be freed when refount will reach 0
+ */
+ lov_pool_putref(pool);
+
+ RETURN(0);
}
struct pool_desc *pool;
unsigned int i, lov_idx;
int rc;
+ ENTRY;
lov = &(obd->u.lov);
pool = lustre_hash_lookup(lov->lov_pools_hash_body, poolname);
if (pool == NULL)
- return -ENOENT;
+ RETURN(-ENOENT);
obd_str2uuid(&ost_uuid, ostname);
/* test if ost found in lov */
if (i == lov->desc.ld_tgt_count) {
mutex_up(&lov->lov_lock);
- return -EINVAL;
+ GOTO(out, rc = -EINVAL);
}
mutex_up(&lov->lov_lock);
rc = lov_ost_pool_add(&pool->pool_obds, lov_idx, lov->lov_tgt_size);
if (rc)
- return rc;
+ GOTO(out, rc);
pool->pool_rr.lqr_dirty = 1;
CDEBUG(D_CONFIG, "Added %s to "LOV_POOLNAMEF" as member %d\n",
ostname, poolname, pool_tgt_count(pool));
- return 0;
+
+ EXIT;
+out:
+ lh_put(lov->lov_pools_hash_body, &pool->pool_hash);
+ return rc;
}
int lov_pool_remove(struct obd_device *obd, char *poolname, char *ostname)
struct lov_obd *lov;
struct pool_desc *pool;
unsigned int i, lov_idx;
+ int rc = 0;
+ ENTRY;
lov = &(obd->u.lov);
pool = lustre_hash_lookup(lov->lov_pools_hash_body, poolname);
if (pool == NULL) {
spin_unlock(&obd->obd_dev_lock);
- return -ENOENT;
+ RETURN(-ENOENT);
}
obd_str2uuid(&ost_uuid, ostname);
/* test if ost found in lov */
if (i == lov->desc.ld_tgt_count) {
spin_unlock(&obd->obd_dev_lock);
- return -EINVAL;
+ GOTO(out, rc = -EINVAL);
}
spin_unlock(&obd->obd_dev_lock);
pool->pool_rr.lqr_dirty = 1;
- CDEBUG(D_CONFIG, "%s removed from "LOV_POOLNAMEF"\n", ostname, poolname);
+ CDEBUG(D_CONFIG, "%s removed from "LOV_POOLNAMEF"\n", ostname,
+ poolname);
- return 0;
+ EXIT;
+out:
+ lh_put(lov->lov_pools_hash_body, &pool->pool_hash);
+ return rc;
}
int lov_check_index_in_pool(__u32 idx, struct pool_desc *pool)
{
- int i;
+ int i, rc;
+ ENTRY;
+
+ /* caller may no have a ref on pool if it got the pool
+ * without calling lov_find_pool() (e.g. go through the lov pool
+ * list)
+ */
+ lov_pool_getref(pool);
+
+ down_read(&pool_tgt_rw_sem(pool));
- read_lock(&pool_tgt_rwlock(pool));
for (i = 0; i < pool_tgt_count(pool); i++) {
- if (pool_tgt_array(pool)[i] == idx) {
- read_unlock(&pool_tgt_rwlock(pool));
- return 0;
- }
+ if (pool_tgt_array(pool)[i] == idx)
+ GOTO(out, rc = 0);
}
- read_unlock(&pool_tgt_rwlock(pool));
- return -ENOENT;
+ rc = -ENOENT;
+ EXIT;
+out:
+ up_read(&pool_tgt_rw_sem(pool));
+
+ lov_pool_putref(pool);
+ return rc;
}
struct pool_desc *lov_find_pool(struct lov_obd *lov, char *poolname)
if ((pool != NULL) && (pool_tgt_count(pool) == 0)) {
CWARN("Request for an empty pool ("LOV_POOLNAMEF")\n",
poolname);
+ /* pool is ignored, so we remove ref on it */
+ lh_put(lov->lov_pools_hash_body, &pool->pool_hash);
pool = NULL;
}
}