lustre/lov/lov_pool.c

   1 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
   2  * vim:expandtab:shiftwidth=8:tabstop=8:
   3  *
   4  * GPL HEADER START
   5  *
   6  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   7  *
   8  * This program is free software; you can redistribute it and/or modify
   9  * it under the terms of the GNU General Public License version 2 only,
  10  * as published by the Free Software Foundation.
  11  *
  12  * This program is distributed in the hope that it will be useful, but
  13  * WITHOUT ANY WARRANTY; without even the implied warranty of
  14  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  15  * General Public License version 2 for more details (a copy is included
  16  * in the LICENSE file that accompanied this code).
  17  *
  18  * You should have received a copy of the GNU General Public License
  19  * version 2 along with this program; If not, see [sun.com URL with a
  20  * copy of GPLv2].
  21  *
  22  * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
  23  * CA 95054 USA or visit www.sun.com if you need additional information or
  24  * have any questions.
  25  *
  26  * GPL HEADER END
  27  */
  28 /*
  29  * Copyright  2008 Sun Microsystems, Inc. All rights reserved
  30  * Use is subject to license terms.
  31  */
  32 /*
  33  * This file is part of Lustre, http://www.lustre.org/
  34  * Lustre is a trademark of Sun Microsystems, Inc.
  35  *
  36  * lustre/lov/lov_pool.c
  37  *
  38  * OST pool methods
  39  *
  40  * Author: Jacques-Charles LAFOUCRIERE <jc.lafoucriere@cea.fr>
  41  */
  42
  43 #define DEBUG_SUBSYSTEM S_LOV
  44
  45 #ifdef __KERNEL__
  46 #include <libcfs/libcfs.h>
  47 #else
  48 #include <liblustre.h>
  49 #endif
  50
  51 #include <obd.h>
  52 #include "lov_internal.h"
  53
  54 /*
  55  * hash function using a Rotating Hash algorithm
  56  * Knuth, D. The Art of Computer Programming,
  57  * Volume 3: Sorting and Searching,
  58  * Chapter 6.4.
  59  * Addison Wesley, 1973
  60  */
  61 static __u32 pool_hashfn(lustre_hash_t *hash_body, void *key, unsigned mask)
  62 {
  63         int i;
  64         __u32 result;
  65         char *poolname;
  66
  67         result = 0;
  68         poolname = (char *)key;
  69         for (i = 0; i < LOV_MAXPOOLNAME; i++) {
  70                 if (poolname[i] == '\0')
  71                         break;
  72                 result = (result << 4)^(result >> 28) ^  poolname[i];
  73         }
  74         return (result % mask);
  75 }
  76
  77 static void *pool_key(struct hlist_node *hnode)
  78 {
  79         struct pool_desc *pool;
  80
  81         pool = hlist_entry(hnode, struct pool_desc, pool_hash);
  82         return (pool->pool_name);
  83 }
  84
  85 static int pool_hashkey_compare(void *key, struct hlist_node *compared_hnode)
  86 {
  87         char *pool_name;
  88         struct pool_desc *pool;
  89         int rc;
  90
  91         pool_name = (char *)key;
  92         pool = hlist_entry(compared_hnode, struct pool_desc, pool_hash);
  93         rc = strncmp(pool_name, pool->pool_name, LOV_MAXPOOLNAME);
  94         return (!rc);
  95 }
  96
  97 static void *pool_hashrefcount_get(struct hlist_node *hnode)
  98 {
  99         struct pool_desc *pool;
 100
 101         pool = hlist_entry(hnode, struct pool_desc, pool_hash);
 102         return (pool);
 103 }
 104
 105 static void *pool_hashrefcount_put(struct hlist_node *hnode)
 106 {
 107         struct pool_desc *pool;
 108
 109         pool = hlist_entry(hnode, struct pool_desc, pool_hash);
 110         return (pool);
 111 }
 112
 113 lustre_hash_ops_t pool_hash_operations = {
 114         .lh_hash        = pool_hashfn,
 115         .lh_key         = pool_key,
 116         .lh_compare     = pool_hashkey_compare,
 117         .lh_get         = pool_hashrefcount_get,
 118         .lh_put         = pool_hashrefcount_put,
 119 };
 120
 121 #ifdef LPROCFS
 122 /* ifdef needed for liblustre support */
 123 /*
 124  * pool /proc seq_file methods
 125  */
 126 /*
 127  * iterator is used to go through the target pool entries
 128  * index is the current entry index in the lp_array[] array
 129  * index >= pos returned to the seq_file interface
 130  * pos is from 0 to (pool->pool_obds.op_count - 1)
 131  */
 132 #define POOL_IT_MAGIC 0xB001CEA0
 133 struct pool_iterator {
 134         int magic;
 135         struct pool_desc *pool;
 136         int idx;        /* from 0 to pool_tgt_size - 1 */
 137 };
 138
 139 static void *pool_proc_next(struct seq_file *s, void *v, loff_t *pos)
 140 {
 141         struct pool_iterator *iter = (struct pool_iterator *)s->private;
 142         int prev_idx;
 143
 144         LASSERTF(iter->magic == POOL_IT_MAGIC, "%08X", iter->magic);
 145
 146         /* test if end of file */
 147         if (*pos >= pool_tgt_count(iter->pool))
 148                 return NULL;
 149
 150         /* iterate to find a non empty entry */
 151         prev_idx = iter->idx;
 152         read_lock(&pool_tgt_rwlock(iter->pool));
 153         iter->idx++;
 154         if (iter->idx == pool_tgt_count(iter->pool)) {
 155                 iter->idx = prev_idx; /* we stay on the last entry */
 156                 read_unlock(&pool_tgt_rwlock(iter->pool));
 157                 return NULL;
 158         }
 159         read_unlock(&pool_tgt_rwlock(iter->pool));
 160         (*pos)++;
 161         /* return != NULL to continue */
 162         return iter;
 163 }
 164
 165 static void *pool_proc_start(struct seq_file *s, loff_t *pos)
 166 {
 167         struct pool_desc *pool = (struct pool_desc *)s->private;
 168         struct pool_iterator *iter;
 169
 170         if ((pool_tgt_count(pool) == 0) ||
 171             (*pos >= pool_tgt_count(pool)))
 172                 return NULL;
 173
 174         OBD_ALLOC(iter, sizeof(struct pool_iterator));
 175         if (!iter)
 176                 return ERR_PTR(-ENOMEM);
 177         iter->magic = POOL_IT_MAGIC;
 178         iter->pool = pool;
 179         iter->idx = 0;
 180
 181         /* we use seq_file private field to memorized iterator so
 182          * we can free it at stop() */
 183         /* /!\ do not forget to restore it to pool before freeing it */
 184         s->private = iter;
 185         if (*pos > 0) {
 186                 loff_t i;
 187                 void *ptr;
 188
 189                 i = 0;
 190                 do {
 191                      ptr = pool_proc_next(s, &iter, &i);
 192                 } while ((i < *pos) && (ptr != NULL));
 193                 return ptr;
 194         }
 195         return iter;
 196 }
 197
 198 static void pool_proc_stop(struct seq_file *s, void *v)
 199 {
 200         struct pool_iterator *iter = (struct pool_iterator *)s->private;
 201
 202         /* in some cases stop() method is called 2 times, without
 203          * calling start() method (see seq_read() from fs/seq_file.c)
 204          * we have to free only if s->private is an iterator */
 205         if ((iter) && (iter->magic == POOL_IT_MAGIC)) {
 206                 /* we restore s->private so next call to pool_proc_start()
 207                  * will work */
 208                 s->private = iter->pool;
 209                 OBD_FREE(iter, sizeof(struct pool_iterator));
 210         }
 211         return;
 212 }
 213
 214 static int pool_proc_show(struct seq_file *s, void *v)
 215 {
 216         struct pool_iterator *iter = (struct pool_iterator *)v;
 217         struct lov_tgt_desc *tgt;
 218
 219         LASSERTF(iter->magic == POOL_IT_MAGIC, "%08X", iter->magic);
 220         LASSERT(iter->pool != NULL);
 221         LASSERT(iter->idx <= pool_tgt_count(iter->pool));
 222
 223         read_lock(&pool_tgt_rwlock(iter->pool));
 224         tgt = pool_tgt(iter->pool, iter->idx);
 225         read_unlock(&pool_tgt_rwlock(iter->pool));
 226         if (tgt)
 227                 seq_printf(s, "%s\n", obd_uuid2str(&(tgt->ltd_uuid)));
 228
 229         return 0;
 230 }
 231
 232 static struct seq_operations pool_proc_ops = {
 233         .start          = pool_proc_start,
 234         .next           = pool_proc_next,
 235         .stop           = pool_proc_stop,
 236         .show           = pool_proc_show,
 237 };
 238
 239 static int pool_proc_open(struct inode *inode, struct file *file)
 240 {
 241         int rc;
 242
 243         rc = seq_open(file, &pool_proc_ops);
 244         if (!rc) {
 245                 struct seq_file *s = file->private_data;
 246                 s->private = PROC_I(inode)->pde->data;
 247         }
 248         return rc;
 249 }
 250
 251 static struct file_operations pool_proc_operations = {
 252         .open           = pool_proc_open,
 253         .read           = seq_read,
 254         .llseek         = seq_lseek,
 255         .release        = seq_release,
 256 };
 257 #endif /* LPROCFS */
 258
 259 void lov_dump_pool(int level, struct pool_desc *pool)
 260 {
 261         int i;
 262
 263         CDEBUG(level, "pool "LOV_POOLNAMEF" has %d members\n",
 264                pool->pool_name, pool->pool_obds.op_count);
 265         read_lock(&pool_tgt_rwlock(pool));
 266         for (i = 0; i < pool_tgt_count(pool) ; i++) {
 267                 if (!pool_tgt(pool, i) || !(pool_tgt(pool, i))->ltd_exp)
 268                         continue;
 269                 CDEBUG(level, "pool "LOV_POOLNAMEF"[%d] = %s\n",
 270                        pool->pool_name, i,
 271                        obd_uuid2str(&((pool_tgt(pool, i))->ltd_uuid)));
 272         }
 273         read_unlock(&pool_tgt_rwlock(pool));
 274 }
 275
 276 #define LOV_POOL_INIT_COUNT 2
 277 int lov_ost_pool_init(struct ost_pool *op, unsigned int count)
 278 {
 279         if (count == 0)
 280                 count = LOV_POOL_INIT_COUNT;
 281         op->op_array = NULL;
 282         op->op_count = 0;
 283         rwlock_init(&op->op_rwlock);
 284         op->op_size = count;
 285         OBD_ALLOC(op->op_array, op->op_size * sizeof(op->op_array[0]));
 286         if (op->op_array == NULL) {
 287                 op->op_size = 0;
 288                 return -ENOMEM;
 289         }
 290         return 0;
 291 }
 292
 293 /* Caller must hold write op_rwlock */
 294 int lov_ost_pool_extend(struct ost_pool *op, unsigned int max_count)
 295 {
 296         __u32 *new;
 297         int new_size;
 298
 299         LASSERT(max_count != 0);
 300
 301         if (op->op_count < op->op_size)
 302                 return 0;
 303
 304         new_size = min(max_count, 2 * op->op_size);
 305         OBD_ALLOC(new, new_size * sizeof(op->op_array[0]));
 306         if (new == NULL)
 307                 return -ENOMEM;
 308
 309         /* copy old array to new one */
 310         memcpy(new, op->op_array, op->op_size * sizeof(op->op_array[0]));
 311         OBD_FREE(op->op_array, op->op_size * sizeof(op->op_array[0]));
 312         op->op_array = new;
 313         op->op_size = new_size;
 314         return 0;
 315 }
 316
 317 int lov_ost_pool_add(struct ost_pool *op, __u32 idx, unsigned int max_count)
 318 {
 319         int rc = 0, i;
 320         ENTRY;
 321
 322         write_lock(&op->op_rwlock);
 323
 324         rc = lov_ost_pool_extend(op, max_count);
 325         if (rc)
 326                 GOTO(out, rc);
 327
 328         /* search ost in pool array */
 329         for (i = 0; i < op->op_count; i++) {
 330                 if (op->op_array[i] == idx)
 331                         GOTO(out, rc = -EEXIST);
 332         }
 333         /* ost not found we add it */
 334         op->op_array[op->op_count] = idx;
 335         op->op_count++;
 336 out:
 337         write_unlock(&op->op_rwlock);
 338         return rc;
 339 }
 340
 341 int lov_ost_pool_remove(struct ost_pool *op, __u32 idx)
 342 {
 343         int i;
 344
 345         write_lock(&op->op_rwlock);
 346         for (i = 0; i < op->op_count; i++) {
 347                 if (op->op_array[i] == idx) {
 348                         memmove(&op->op_array[i], &op->op_array[i + 1],
 349                                 (op->op_count - i - 1) * sizeof(op->op_array[0]));
 350                         op->op_count--;
 351                         write_unlock(&op->op_rwlock);
 352                         return 0;
 353                 }
 354         }
 355         write_unlock(&op->op_rwlock);
 356         return -EINVAL;
 357 }
 358
 359 int lov_ost_pool_free(struct ost_pool *op)
 360 {
 361         if (op->op_size == 0)
 362                 return 0;
 363
 364         write_lock(&op->op_rwlock);
 365         OBD_FREE(op->op_array, op->op_size * sizeof(op->op_array[0]));
 366         op->op_array = NULL;
 367         op->op_count = 0;
 368         op->op_size = 0;
 369         write_unlock(&op->op_rwlock);
 370         return 0;
 371 }
 372
 373
 374 int lov_pool_new(struct obd_device *obd, char *poolname)
 375 {
 376         struct lov_obd *lov;
 377         struct pool_desc *new_pool;
 378         int rc;
 379
 380         lov = &(obd->u.lov);
 381
 382         if (strlen(poolname) > LOV_MAXPOOLNAME)
 383                 return -ENAMETOOLONG;
 384
 385         OBD_ALLOC_PTR(new_pool);
 386         if (new_pool == NULL)
 387                 return -ENOMEM;
 388
 389         strncpy(new_pool->pool_name, poolname, LOV_MAXPOOLNAME);
 390         new_pool->pool_name[LOV_MAXPOOLNAME] = '\0';
 391         new_pool->pool_lov = lov;
 392         rc = lov_ost_pool_init(&new_pool->pool_obds, 0);
 393         if (rc)
 394                GOTO(out_err, rc);
 395
 396         memset(&(new_pool->pool_rr), 0, sizeof(struct lov_qos_rr));
 397         rc = lov_ost_pool_init(&new_pool->pool_rr.lqr_pool, 0);
 398         if (rc) {
 399                 lov_ost_pool_free(&new_pool->pool_obds);
 400                 GOTO(out_err, rc);
 401         }
 402
 403         spin_lock(&obd->obd_dev_lock);
 404         /* check if pool already exists */
 405         if (lustre_hash_lookup(lov->lov_pools_hash_body, poolname) != NULL) {
 406                 spin_unlock(&obd->obd_dev_lock);
 407                 lov_ost_pool_free(&new_pool->pool_rr.lqr_pool);
 408                 lov_ost_pool_free(&new_pool->pool_obds);
 409                 GOTO(out_err, rc = -EEXIST);
 410         }
 411
 412         INIT_HLIST_NODE(&new_pool->pool_hash);
 413         lustre_hash_add_unique(lov->lov_pools_hash_body, poolname,
 414                                &new_pool->pool_hash);
 415         list_add_tail(&new_pool->pool_list, &lov->lov_pool_list);
 416         lov->lov_pool_count++;
 417         spin_unlock(&obd->obd_dev_lock);
 418
 419         CDEBUG(D_CONFIG, LOV_POOLNAMEF" is pool #%d\n",
 420                poolname, lov->lov_pool_count);
 421
 422 #ifdef LPROCFS
 423         /* ifdef needed for liblustre */
 424         new_pool->pool_proc_entry = lprocfs_add_simple(lov->lov_pool_proc_entry,
 425                                                        poolname, NULL, NULL,
 426                                                        new_pool,
 427                                                        &pool_proc_operations);
 428 #endif
 429
 430         if (IS_ERR(new_pool->pool_proc_entry)) {
 431                 CWARN("Cannot add proc pool entry "LOV_POOLNAMEF"\n", poolname);
 432                 new_pool->pool_proc_entry = NULL;
 433         }
 434
 435         return 0;
 436
 437 out_err:
 438         OBD_FREE_PTR(new_pool);
 439         return rc;
 440 }
 441
 442 int lov_pool_del(struct obd_device *obd, char *poolname)
 443 {
 444         struct lov_obd *lov;
 445         struct pool_desc *pool;
 446
 447         lov = &(obd->u.lov);
 448
 449         spin_lock(&obd->obd_dev_lock);
 450         pool = lustre_hash_lookup(lov->lov_pools_hash_body,
 451                                              poolname);
 452         if (pool == NULL) {
 453                 spin_unlock(&obd->obd_dev_lock);
 454                 return -ENOENT;
 455         }
 456
 457 #ifdef LPROCFS
 458         if (pool->pool_proc_entry != NULL)
 459                 remove_proc_entry(pool->pool_proc_entry->name,
 460                                   pool->pool_proc_entry->parent);
 461 #endif
 462
 463         lustre_hash_del_key(lov->lov_pools_hash_body, poolname);
 464
 465         lov->lov_pool_count--;
 466
 467         spin_unlock(&obd->obd_dev_lock);
 468
 469         /* pool struct is not freed because it may be used by
 470          * some open in /proc. The struct is freed at lov_cleanup()
 471         */
 472         return 0;
 473 }
 474
 475
 476 int lov_pool_add(struct obd_device *obd, char *poolname, char *ostname)
 477 {
 478         struct obd_uuid ost_uuid;
 479         struct lov_obd *lov;
 480         struct pool_desc *pool;
 481         unsigned int i, lov_idx;
 482         int rc;
 483
 484         lov = &(obd->u.lov);
 485
 486         pool = lustre_hash_lookup(lov->lov_pools_hash_body, poolname);
 487         if (pool == NULL)
 488                 return -ENOENT;
 489
 490         obd_str2uuid(&ost_uuid, ostname);
 491
 492
 493         /* search ost in lov array */
 494         mutex_down(&lov->lov_lock);
 495         for (i = 0; i < lov->desc.ld_tgt_count; i++) {
 496                 if (!lov->lov_tgts[i])
 497                         continue;
 498                 if (obd_uuid_equals(&ost_uuid, &(lov->lov_tgts[i]->ltd_uuid)))
 499                         break;
 500         }
 501
 502         /* test if ost found in lov */
 503         if (i == lov->desc.ld_tgt_count) {
 504                 mutex_up(&lov->lov_lock);
 505                 return -EINVAL;
 506         }
 507         mutex_up(&lov->lov_lock);
 508
 509         lov_idx = i;
 510
 511         rc = lov_ost_pool_add(&pool->pool_obds, lov_idx, lov->lov_tgt_size);
 512         if (rc)
 513                 return rc;
 514
 515         pool->pool_rr.lqr_dirty = 1;
 516
 517         CDEBUG(D_CONFIG, "Added %s to "LOV_POOLNAMEF" as member %d\n",
 518                ostname, poolname,  pool_tgt_count(pool));
 519         return 0;
 520 }
 521
 522 int lov_pool_remove(struct obd_device *obd, char *poolname, char *ostname)
 523 {
 524         struct obd_uuid ost_uuid;
 525         struct lov_obd *lov;
 526         struct pool_desc *pool;
 527         unsigned int i, lov_idx;
 528
 529         lov = &(obd->u.lov);
 530
 531         spin_lock(&obd->obd_dev_lock);
 532         pool = lustre_hash_lookup(lov->lov_pools_hash_body, poolname);
 533         if (pool == NULL) {
 534                 spin_unlock(&obd->obd_dev_lock);
 535                 return -ENOENT;
 536         }
 537
 538         obd_str2uuid(&ost_uuid, ostname);
 539
 540         /* search ost in lov array, to get index */
 541         for (i = 0; i < lov->desc.ld_tgt_count; i++) {
 542                 if (!lov->lov_tgts[i])
 543                         continue;
 544
 545                 if (obd_uuid_equals(&ost_uuid, &(lov->lov_tgts[i]->ltd_uuid)))
 546                         break;
 547         }
 548
 549         /* test if ost found in lov */
 550         if (i == lov->desc.ld_tgt_count) {
 551                 spin_unlock(&obd->obd_dev_lock);
 552                 return -EINVAL;
 553         }
 554
 555         spin_unlock(&obd->obd_dev_lock);
 556
 557         lov_idx = i;
 558
 559         lov_ost_pool_remove(&pool->pool_obds, lov_idx);
 560
 561         pool->pool_rr.lqr_dirty = 1;
 562
 563         CDEBUG(D_CONFIG, "%s removed from "LOV_POOLNAMEF"\n", ostname, poolname);
 564
 565         return 0;
 566 }
 567
 568 int lov_check_index_in_pool(__u32 idx, struct pool_desc *pool)
 569 {
 570         int i;
 571
 572         read_lock(&pool_tgt_rwlock(pool));
 573         for (i = 0; i < pool_tgt_count(pool); i++) {
 574                 if (pool_tgt_array(pool)[i] == idx) {
 575                         read_unlock(&pool_tgt_rwlock(pool));
 576                         return 0;
 577                 }
 578         }
 579         read_unlock(&pool_tgt_rwlock(pool));
 580         return -ENOENT;
 581 }
 582
 583 struct pool_desc *lov_find_pool(struct lov_obd *lov, char *poolname)
 584 {
 585         struct pool_desc *pool;
 586
 587         pool = NULL;
 588         if (poolname[0] != '\0') {
 589                 pool = lustre_hash_lookup(lov->lov_pools_hash_body, poolname);
 590                 if (pool == NULL)
 591                         CWARN("Request for an unknown pool ("LOV_POOLNAMEF")\n",
 592                               poolname);
 593                 if ((pool != NULL) && (pool_tgt_count(pool) == 0)) {
 594                         CWARN("Request for an empty pool ("LOV_POOLNAMEF")\n",
 595                                poolname);
 596                         pool = NULL;
 597                 }
 598         }
 599         return pool;
 600 }
 601