lustre/lov/lov_qos.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
  20  * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
  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
  37 #ifndef EXPORT_SYMTAB
  38 # define EXPORT_SYMTAB
  39 #endif
  40 #define DEBUG_SUBSYSTEM S_LOV
  41
  42 #ifdef __KERNEL__
  43 #include <libcfs/libcfs.h>
  44 #else
  45 #include <liblustre.h>
  46 #endif
  47
  48 #include <obd_class.h>
  49 #include <obd_lov.h>
  50 #include <lustre/lustre_idl.h>
  51 #include "lov_internal.h"
  52
  53 /* #define QOS_DEBUG 1 */
  54 #define D_QOS D_OTHER
  55
  56 #define TGT_BAVAIL(i) (lov->lov_tgts[i]->ltd_exp->exp_obd->obd_osfs.os_bavail *\
  57                        lov->lov_tgts[i]->ltd_exp->exp_obd->obd_osfs.os_bsize)
  58 #define TGT_FFREE(i)  (lov->lov_tgts[i]->ltd_exp->exp_obd->obd_osfs.os_ffree)
  59
  60
  61 int qos_add_tgt(struct obd_device *obd, __u32 index)
  62 {
  63         struct lov_obd *lov = &obd->u.lov;
  64         struct lov_qos_oss *oss, *temposs;
  65         struct obd_export *exp = lov->lov_tgts[index]->ltd_exp;
  66         int rc = 0, found = 0;
  67         ENTRY;
  68
  69         /* We only need this QOS struct on MDT, not clients - but we may not
  70          * have registered the LOV's observer yet, so there's no way to know */
  71         if (!exp || !exp->exp_connection) {
  72                 CERROR("Missing connection\n");
  73                 RETURN(-ENOTCONN);
  74         }
  75
  76         down_write(&lov->lov_qos.lq_rw_sem);
  77         mutex_down(&lov->lov_lock);
  78         list_for_each_entry(oss, &lov->lov_qos.lq_oss_list, lqo_oss_list) {
  79                 if (obd_uuid_equals(&oss->lqo_uuid,
  80                                     &exp->exp_connection->c_remote_uuid)) {
  81                         found++;
  82                         break;
  83                 }
  84         }
  85
  86         if (!found) {
  87                 OBD_ALLOC_PTR(oss);
  88                 if (!oss)
  89                         GOTO(out, rc = -ENOMEM);
  90                 memcpy(&oss->lqo_uuid,
  91                        &exp->exp_connection->c_remote_uuid,
  92                        sizeof(oss->lqo_uuid));
  93         } else {
  94                 /* Assume we have to move this one */
  95                 list_del(&oss->lqo_oss_list);
  96         }
  97
  98         oss->lqo_ost_count++;
  99         lov->lov_tgts[index]->ltd_qos.ltq_oss = oss;
 100
 101         /* Add sorted by # of OSTs.  Find the first entry that we're
 102            bigger than... */
 103         list_for_each_entry(temposs, &lov->lov_qos.lq_oss_list, lqo_oss_list) {
 104                 if (oss->lqo_ost_count > temposs->lqo_ost_count)
 105                         break;
 106         }
 107         /* ...and add before it.  If we're the first or smallest, temposs
 108            points to the list head, and we add to the end. */
 109         list_add_tail(&oss->lqo_oss_list, &temposs->lqo_oss_list);
 110
 111         lov->lov_qos.lq_dirty = 1;
 112         lov->lov_qos.lq_rr.lqr_dirty = 1;
 113
 114         CDEBUG(D_QOS, "add tgt %s to OSS %s (%d OSTs)\n",
 115                obd_uuid2str(&lov->lov_tgts[index]->ltd_uuid),
 116                obd_uuid2str(&oss->lqo_uuid),
 117                oss->lqo_ost_count);
 118
 119 out:
 120         mutex_up(&lov->lov_lock);
 121         up_write(&lov->lov_qos.lq_rw_sem);
 122         RETURN(rc);
 123 }
 124
 125 int qos_del_tgt(struct obd_device *obd, struct lov_tgt_desc *tgt)
 126 {
 127         struct lov_obd *lov = &obd->u.lov;
 128         struct lov_qos_oss *oss;
 129         int rc = 0;
 130         ENTRY;
 131
 132         down_write(&lov->lov_qos.lq_rw_sem);
 133
 134         oss = tgt->ltd_qos.ltq_oss;
 135         if (!oss)
 136                 GOTO(out, rc = -ENOENT);
 137
 138         oss->lqo_ost_count--;
 139         if (oss->lqo_ost_count == 0) {
 140                 CDEBUG(D_QOS, "removing OSS %s\n",
 141                        obd_uuid2str(&oss->lqo_uuid));
 142                 list_del(&oss->lqo_oss_list);
 143                 OBD_FREE_PTR(oss);
 144         }
 145
 146         lov->lov_qos.lq_dirty = 1;
 147         lov->lov_qos.lq_rr.lqr_dirty = 1;
 148 out:
 149         up_write(&lov->lov_qos.lq_rw_sem);
 150         RETURN(rc);
 151 }
 152
 153 /* Recalculate per-object penalties for OSSs and OSTs,
 154    depends on size of each ost in an oss */
 155 static int qos_calc_ppo(struct obd_device *obd)
 156 {
 157         struct lov_obd *lov = &obd->u.lov;
 158         struct lov_qos_oss *oss;
 159         __u64 ba_max, ba_min, temp;
 160         __u32 num_active;
 161         int rc, i, prio_wide;
 162         time_t now, age;
 163         ENTRY;
 164
 165         if (!lov->lov_qos.lq_dirty)
 166                 GOTO(out, rc = 0);
 167
 168         num_active = lov->desc.ld_active_tgt_count - 1;
 169         if (num_active < 1)
 170                 GOTO(out, rc = -EAGAIN);
 171
 172         /* find bavail on each OSS */
 173         list_for_each_entry(oss, &lov->lov_qos.lq_oss_list, lqo_oss_list) {
 174                 oss->lqo_bavail = 0;
 175         }
 176         lov->lov_qos.lq_active_oss_count = 0;
 177
 178         /* How badly user wants to select osts "widely" (not recently chosen
 179            and not on recent oss's).  As opposed to "freely" (free space
 180            avail.) 0-256. */
 181         prio_wide = 256 - lov->lov_qos.lq_prio_free;
 182
 183         ba_min = (__u64)(-1);
 184         ba_max = 0;
 185         now = cfs_time_current_sec();
 186         /* Calculate OST penalty per object */
 187         /* (lov ref taken in alloc_qos) */
 188         for (i = 0; i < lov->desc.ld_tgt_count; i++) {
 189                 if (!lov->lov_tgts[i] || !lov->lov_tgts[i]->ltd_active)
 190                         continue;
 191                 temp = TGT_BAVAIL(i);
 192                 if (!temp)
 193                         continue;
 194                 ba_min = min(temp, ba_min);
 195                 ba_max = max(temp, ba_max);
 196
 197                 /* Count the number of usable OSS's */
 198                 if (lov->lov_tgts[i]->ltd_qos.ltq_oss->lqo_bavail == 0)
 199                         lov->lov_qos.lq_active_oss_count++;
 200                 lov->lov_tgts[i]->ltd_qos.ltq_oss->lqo_bavail += temp;
 201
 202                 /* per-OST penalty is prio * TGT_bavail / (num_ost - 1) / 2 */
 203                 temp >>= 1;
 204                 do_div(temp, num_active);
 205                 lov->lov_tgts[i]->ltd_qos.ltq_penalty_per_obj =
 206                         (temp * prio_wide) >> 8;
 207
 208                 age = (now - lov->lov_tgts[i]->ltd_qos.ltq_used) >> 3;
 209                 if (lov->lov_qos.lq_reset || age > 32 * lov->desc.ld_qos_maxage)
 210                         lov->lov_tgts[i]->ltd_qos.ltq_penalty = 0;
 211                 else if (age > lov->desc.ld_qos_maxage)
 212                         /* Decay the penalty by half for every 8x the update
 213                          * interval that the device has been idle.  That gives
 214                          * lots of time for the statfs information to be
 215                          * updated (which the penalty is only a proxy for),
 216                          * and avoids penalizing OSS/OSTs under light load. */
 217                         lov->lov_tgts[i]->ltd_qos.ltq_penalty >>=
 218                                 (age / lov->desc.ld_qos_maxage);
 219         }
 220
 221         num_active = lov->lov_qos.lq_active_oss_count - 1;
 222         if (num_active < 1) {
 223                 /* If there's only 1 OSS, we can't penalize it, so instead
 224                    we have to double the OST penalty */
 225                 num_active = 1;
 226                 for (i = 0; i < lov->desc.ld_tgt_count; i++) {
 227                         if (lov->lov_tgts[i] == NULL)
 228                                 continue;
 229                         lov->lov_tgts[i]->ltd_qos.ltq_penalty_per_obj <<= 1;
 230                 }
 231         }
 232
 233         /* Per-OSS penalty is prio * oss_avail / oss_osts / (num_oss - 1) / 2 */
 234         list_for_each_entry(oss, &lov->lov_qos.lq_oss_list, lqo_oss_list) {
 235                 temp = oss->lqo_bavail >> 1;
 236                 do_div(temp, oss->lqo_ost_count * num_active);
 237                 oss->lqo_penalty_per_obj = (temp * prio_wide) >> 8;
 238
 239                 age = (now - oss->lqo_used) >> 3;
 240                 if (lov->lov_qos.lq_reset || age > 32 * lov->desc.ld_qos_maxage)
 241                         oss->lqo_penalty = 0;
 242                 else if (age > lov->desc.ld_qos_maxage)
 243                         /* Decay the penalty by half for every 8x the update
 244                          * interval that the device has been idle.  That gives
 245                          * lots of time for the statfs information to be
 246                          * updated (which the penalty is only a proxy for),
 247                          * and avoids penalizing OSS/OSTs under light load. */
 248                         oss->lqo_penalty >>= (age / lov->desc.ld_qos_maxage);
 249         }
 250
 251         lov->lov_qos.lq_dirty = 0;
 252         lov->lov_qos.lq_reset = 0;
 253
 254         /* If each ost has almost same free space,
 255          * do rr allocation for better creation performance */
 256         lov->lov_qos.lq_same_space = 0;
 257         if ((ba_max * (256 - lov->lov_qos.lq_threshold_rr)) >> 8 < ba_min) {
 258                 lov->lov_qos.lq_same_space = 1;
 259                 /* Reset weights for the next time we enter qos mode */
 260                 lov->lov_qos.lq_reset = 1;
 261         }
 262         rc = 0;
 263
 264 out:
 265         if (!rc && lov->lov_qos.lq_same_space)
 266                 RETURN(-EAGAIN);
 267         RETURN(rc);
 268 }
 269
 270 static int qos_calc_weight(struct lov_obd *lov, int i)
 271 {
 272         __u64 temp, temp2;
 273
 274         /* Final ost weight = TGT_BAVAIL - ost_penalty - oss_penalty */
 275         temp = TGT_BAVAIL(i);
 276         temp2 = lov->lov_tgts[i]->ltd_qos.ltq_penalty +
 277                 lov->lov_tgts[i]->ltd_qos.ltq_oss->lqo_penalty;
 278         if (temp < temp2)
 279                 lov->lov_tgts[i]->ltd_qos.ltq_weight = 0;
 280         else
 281                 lov->lov_tgts[i]->ltd_qos.ltq_weight = temp - temp2;
 282         return 0;
 283 }
 284
 285 /* We just used this index for a stripe; adjust everyone's weights */
 286 static int qos_used(struct lov_obd *lov, struct ost_pool *osts,
 287                     __u32 index, __u64 *total_wt)
 288 {
 289         struct lov_qos_oss *oss;
 290         int j;
 291         ENTRY;
 292
 293         /* Don't allocate from this stripe anymore, until the next alloc_qos */
 294         lov->lov_tgts[index]->ltd_qos.ltq_usable = 0;
 295
 296         oss = lov->lov_tgts[index]->ltd_qos.ltq_oss;
 297
 298         /* Decay old penalty by half (we're adding max penalty, and don't
 299            want it to run away.) */
 300         lov->lov_tgts[index]->ltd_qos.ltq_penalty >>= 1;
 301         oss->lqo_penalty >>= 1;
 302
 303         /* mark the OSS and OST as recently used */
 304         lov->lov_tgts[index]->ltd_qos.ltq_used =
 305                 oss->lqo_used = cfs_time_current_sec();
 306
 307         /* Set max penalties for this OST and OSS */
 308         lov->lov_tgts[index]->ltd_qos.ltq_penalty +=
 309                 lov->lov_tgts[index]->ltd_qos.ltq_penalty_per_obj *
 310                 lov->desc.ld_active_tgt_count;
 311         oss->lqo_penalty += oss->lqo_penalty_per_obj *
 312                 lov->lov_qos.lq_active_oss_count;
 313
 314         /* Decrease all OSS penalties */
 315         list_for_each_entry(oss, &lov->lov_qos.lq_oss_list, lqo_oss_list) {
 316                 if (oss->lqo_penalty < oss->lqo_penalty_per_obj)
 317                         oss->lqo_penalty = 0;
 318                 else
 319                         oss->lqo_penalty -= oss->lqo_penalty_per_obj;
 320         }
 321
 322         *total_wt = 0;
 323         /* Decrease all OST penalties */
 324         for (j = 0; j < osts->op_count; j++) {
 325                 int i;
 326
 327                 i = osts->op_array[j];
 328                 if (!lov->lov_tgts[i] || !lov->lov_tgts[i]->ltd_active)
 329                         continue;
 330                 if (lov->lov_tgts[i]->ltd_qos.ltq_penalty <
 331                     lov->lov_tgts[i]->ltd_qos.ltq_penalty_per_obj)
 332                         lov->lov_tgts[i]->ltd_qos.ltq_penalty = 0;
 333                 else
 334                         lov->lov_tgts[i]->ltd_qos.ltq_penalty -=
 335                         lov->lov_tgts[i]->ltd_qos.ltq_penalty_per_obj;
 336
 337                 qos_calc_weight(lov, i);
 338
 339                 /* Recalc the total weight of usable osts */
 340                 if (lov->lov_tgts[i]->ltd_qos.ltq_usable)
 341                         *total_wt += lov->lov_tgts[i]->ltd_qos.ltq_weight;
 342
 343 #ifdef QOS_DEBUG
 344                 CDEBUG(D_QOS, "recalc tgt %d usable=%d avail="LPU64
 345                        " ostppo="LPU64" ostp="LPU64" ossppo="LPU64
 346                        " ossp="LPU64" wt="LPU64"\n",
 347                        i, lov->lov_tgts[i]->ltd_qos.ltq_usable,
 348                        TGT_BAVAIL(i) >> 10,
 349                        lov->lov_tgts[i]->ltd_qos.ltq_penalty_per_obj >> 10,
 350                        lov->lov_tgts[i]->ltd_qos.ltq_penalty >> 10,
 351                        lov->lov_tgts[i]->ltd_qos.ltq_oss->lqo_penalty_per_obj>>10,
 352                        lov->lov_tgts[i]->ltd_qos.ltq_oss->lqo_penalty >> 10,
 353                        lov->lov_tgts[i]->ltd_qos.ltq_weight >> 10);
 354 #endif
 355         }
 356
 357         RETURN(0);
 358 }
 359
 360 #define LOV_QOS_EMPTY ((__u32)-1)
 361 /* compute optimal round-robin order, based on OSTs per OSS */
 362 static int qos_calc_rr(struct lov_obd *lov, struct ost_pool *src_pool,
 363                        struct lov_qos_rr *lqr)
 364 {
 365         struct lov_qos_oss *oss;
 366         unsigned placed, real_count;
 367         int i, rc;
 368         ENTRY;
 369
 370         if (!lqr->lqr_dirty) {
 371                 LASSERT(lqr->lqr_pool.op_size);
 372                 RETURN(0);
 373         }
 374
 375         /* Do actual allocation. */
 376         down_write(&lov->lov_qos.lq_rw_sem);
 377
 378         /*
 379          * Check again. While we were sleeping on @lq_rw_sem something could
 380          * change.
 381          */
 382         if (!lqr->lqr_dirty) {
 383                 LASSERT(lqr->lqr_pool.op_size);
 384                 up_write(&lov->lov_qos.lq_rw_sem);
 385                 RETURN(0);
 386         }
 387
 388         real_count = src_pool->op_count;
 389
 390         /* Zero the pool array */
 391         /* alloc_rr is holding a read lock on the pool, so nobody is adding/
 392            deleting from the pool. The lq_rw_sem insures that nobody else
 393            is reading. */
 394         lqr->lqr_pool.op_count = real_count;
 395         rc = lov_ost_pool_extend(&lqr->lqr_pool, real_count);
 396         if (rc) {
 397                 up_write(&lov->lov_qos.lq_rw_sem);
 398                 RETURN(rc);
 399         }
 400         for (i = 0; i < lqr->lqr_pool.op_count; i++)
 401                 lqr->lqr_pool.op_array[i] = LOV_QOS_EMPTY;
 402
 403         /* Place all the OSTs from 1 OSS at the same time. */
 404         placed = 0;
 405         list_for_each_entry(oss, &lov->lov_qos.lq_oss_list, lqo_oss_list) {
 406                 int j = 0;
 407                 for (i = 0; i < lqr->lqr_pool.op_count; i++) {
 408                         if (lov->lov_tgts[src_pool->op_array[i]] &&
 409                             (lov->lov_tgts[src_pool->op_array[i]]->ltd_qos.ltq_oss == oss)) {
 410                               /* Evenly space these OSTs across arrayspace */
 411                               int next = j * lqr->lqr_pool.op_count / oss->lqo_ost_count;
 412                               while (lqr->lqr_pool.op_array[next] !=
 413                                      LOV_QOS_EMPTY)
 414                                         next = (next + 1) % lqr->lqr_pool.op_count;
 415                               lqr->lqr_pool.op_array[next] = src_pool->op_array[i];
 416                               j++;
 417                               placed++;
 418                         }
 419                 }
 420         }
 421
 422         lqr->lqr_dirty = 0;
 423         up_write(&lov->lov_qos.lq_rw_sem);
 424
 425         if (placed != real_count) {
 426                 /* This should never happen */
 427                 LCONSOLE_ERROR_MSG(0x14e, "Failed to place all OSTs in the "
 428                                    "round-robin list (%d of %d).\n",
 429                                    placed, real_count);
 430                 for (i = 0; i < lqr->lqr_pool.op_count; i++) {
 431                         LCONSOLE(D_WARNING, "rr #%d ost idx=%d\n", i,
 432                                  lqr->lqr_pool.op_array[i]);
 433                 }
 434                 lqr->lqr_dirty = 1;
 435                 RETURN(-EAGAIN);
 436         }
 437
 438 #ifdef QOS_DEBUG
 439         for (i = 0; i < lqr->lqr_pool.op_count; i++) {
 440                 LCONSOLE(D_QOS, "rr #%d ost idx=%d\n", i,
 441                          lqr->lqr_pool.op_array[i]);
 442         }
 443 #endif
 444
 445         RETURN(0);
 446 }
 447
 448
 449 void qos_shrink_lsm(struct lov_request_set *set)
 450 {
 451         struct lov_stripe_md *lsm = set->set_oi->oi_md, *lsm_new;
 452         /* XXX LOV STACKING call into osc for sizes */
 453         unsigned oldsize, newsize;
 454
 455         if (set->set_oti && set->set_cookies && set->set_cookie_sent) {
 456                 struct llog_cookie *cookies;
 457                 oldsize = lsm->lsm_stripe_count * sizeof(*cookies);
 458                 newsize = set->set_count * sizeof(*cookies);
 459
 460                 cookies = set->set_cookies;
 461                 oti_alloc_cookies(set->set_oti, set->set_count);
 462                 if (set->set_oti->oti_logcookies) {
 463                         memcpy(set->set_oti->oti_logcookies, cookies, newsize);
 464                         OBD_FREE(cookies, oldsize);
 465                         set->set_cookies = set->set_oti->oti_logcookies;
 466                 } else {
 467                         CWARN("'leaking' %d bytes\n", oldsize - newsize);
 468                 }
 469         }
 470
 471         CWARN("using fewer stripes for object "LPU64": old %u new %u\n",
 472               lsm->lsm_object_id, lsm->lsm_stripe_count, set->set_count);
 473         LASSERT(lsm->lsm_stripe_count >= set->set_count);
 474
 475         newsize = lov_stripe_md_size(set->set_count);
 476         OBD_ALLOC(lsm_new, newsize);
 477         if (lsm_new != NULL) {
 478                 int i;
 479                 memcpy(lsm_new, lsm, sizeof(*lsm));
 480                 for (i = 0; i < lsm->lsm_stripe_count; i++) {
 481                         if (i < set->set_count) {
 482                                 lsm_new->lsm_oinfo[i] = lsm->lsm_oinfo[i];
 483                                 continue;
 484                         }
 485                         OBD_SLAB_FREE(lsm->lsm_oinfo[i], lov_oinfo_slab,
 486                                       sizeof(struct lov_oinfo));
 487                 }
 488                 lsm_new->lsm_stripe_count = set->set_count;
 489                 OBD_FREE(lsm, sizeof(struct lov_stripe_md) +
 490                          lsm->lsm_stripe_count * sizeof(struct lov_oinfo *));
 491                 set->set_oi->oi_md = lsm_new;
 492         } else {
 493                 CWARN("'leaking' few bytes\n");
 494         }
 495 }
 496
 497 int qos_remedy_create(struct lov_request_set *set, struct lov_request *req)
 498 {
 499         struct lov_stripe_md *lsm = set->set_oi->oi_md;
 500         struct lov_obd *lov = &set->set_exp->exp_obd->u.lov;
 501         unsigned ost_idx, ost_count = lov->desc.ld_tgt_count;
 502         int stripe, i, rc = -EIO;
 503         ENTRY;
 504
 505         ost_idx = (req->rq_idx + lsm->lsm_stripe_count) % ost_count;
 506         for (i = 0; i < ost_count; i++, ost_idx = (ost_idx + 1) % ost_count) {
 507                 if (!lov->lov_tgts[ost_idx] ||
 508                     !lov->lov_tgts[ost_idx]->ltd_active)
 509                         continue;
 510                 /* check if objects has been created on this ost */
 511                 for (stripe = 0; stripe < lsm->lsm_stripe_count; stripe++) {
 512                         if (stripe == req->rq_stripe)
 513                                 continue;
 514                         if (ost_idx == lsm->lsm_oinfo[stripe]->loi_ost_idx)
 515                                 break;
 516                 }
 517
 518                 if (stripe >= lsm->lsm_stripe_count) {
 519                         req->rq_idx = ost_idx;
 520                         rc = obd_create(lov->lov_tgts[ost_idx]->ltd_exp,
 521                                         req->rq_oi.oi_oa, &req->rq_oi.oi_md,
 522                                         set->set_oti);
 523                         if (!rc)
 524                                 break;
 525                 }
 526         }
 527         RETURN(rc);
 528 }
 529
 530 static int min_stripe_count(int stripe_cnt, int flags)
 531 {
 532         return (flags & LOV_USES_DEFAULT_STRIPE ?
 533                 stripe_cnt - (stripe_cnt / 4) : stripe_cnt);
 534 }
 535
 536 #define LOV_CREATE_RESEED_MULT 4
 537 #define LOV_CREATE_RESEED_MIN  1000
 538 /* Allocate objects on osts with round-robin algorithm */
 539 static int alloc_rr(struct lov_obd *lov, int *idx_arr, int *stripe_cnt,
 540                     char *poolname, int flags)
 541 {
 542         unsigned array_idx;
 543         int i, rc, *idx_pos;
 544         __u32 ost_idx;
 545         int ost_start_idx_temp;
 546         int speed = 0;
 547         int stripe_cnt_min = min_stripe_count(*stripe_cnt, flags);
 548         struct pool_desc *pool;
 549         struct ost_pool *osts;
 550         struct lov_qos_rr *lqr;
 551         ENTRY;
 552
 553         pool = lov_find_pool(lov, poolname);
 554         if (pool == NULL) {
 555                 osts = &(lov->lov_packed);
 556                 lqr = &(lov->lov_qos.lq_rr);
 557         } else {
 558                 down_read(&pool_tgt_rw_sem(pool));
 559                 osts = &(pool->pool_obds);
 560                 lqr = &(pool->pool_rr);
 561         }
 562
 563         rc = qos_calc_rr(lov, osts, lqr);
 564         if (rc)
 565                 GOTO(out, rc);
 566
 567         if (--lqr->lqr_start_count <= 0) {
 568                 lqr->lqr_start_idx = ll_rand() % osts->op_count;
 569                 lqr->lqr_start_count =
 570                         (LOV_CREATE_RESEED_MIN / max(osts->op_count, 1U) +
 571                          LOV_CREATE_RESEED_MULT) * max(osts->op_count, 1U);
 572         } else if (stripe_cnt_min >= osts->op_count ||
 573                    lqr->lqr_start_idx > osts->op_count) {
 574                 /* If we have allocated from all of the OSTs, slowly
 575                  * precess the next start if the OST/stripe count isn't
 576                  * already doing this for us. */
 577                 lqr->lqr_start_idx %= osts->op_count;
 578                 if (*stripe_cnt > 1 && (osts->op_count % (*stripe_cnt)) != 1)
 579                         ++lqr->lqr_offset_idx;
 580         }
 581         down_read(&lov->lov_qos.lq_rw_sem);
 582         ost_start_idx_temp = lqr->lqr_start_idx;
 583
 584 repeat_find:
 585         array_idx = (lqr->lqr_start_idx + lqr->lqr_offset_idx) % osts->op_count;
 586         idx_pos = idx_arr;
 587 #ifdef QOS_DEBUG
 588         CDEBUG(D_QOS, "pool '%s' want %d startidx %d startcnt %d offset %d "
 589                "active %d count %d arrayidx %d\n", poolname,
 590                *stripe_cnt, lqr->lqr_start_idx, lqr->lqr_start_count,
 591                lqr->lqr_offset_idx, osts->op_count, osts->op_count, array_idx);
 592 #endif
 593
 594         for (i = 0; i < osts->op_count;
 595                     i++, array_idx=(array_idx + 1) % osts->op_count) {
 596                 ++lqr->lqr_start_idx;
 597                 ost_idx = lqr->lqr_pool.op_array[array_idx];
 598 #ifdef QOS_DEBUG
 599                 CDEBUG(D_QOS, "#%d strt %d act %d strp %d ary %d idx %d\n",
 600                        i, lqr->lqr_start_idx,
 601                        ((ost_idx != LOV_QOS_EMPTY) && lov->lov_tgts[ost_idx]) ?
 602                        lov->lov_tgts[ost_idx]->ltd_active : 0,
 603                        idx_pos - idx_arr, array_idx, ost_idx);
 604 #endif
 605                 if ((ost_idx == LOV_QOS_EMPTY) || !lov->lov_tgts[ost_idx] ||
 606                     !lov->lov_tgts[ost_idx]->ltd_active)
 607                         continue;
 608
 609                 /* Fail Check before osc_precreate() is called
 610                    so we can only 'fail' single OSC. */
 611                 if (OBD_FAIL_CHECK(OBD_FAIL_MDS_OSC_PRECREATE) && ost_idx == 0)
 612                         continue;
 613
 614                 /* Drop slow OSCs if we can */
 615                 if (obd_precreate(lov->lov_tgts[ost_idx]->ltd_exp) > speed)
 616                         continue;
 617
 618                 *idx_pos = ost_idx;
 619                 idx_pos++;
 620                 /* We have enough stripes */
 621                 if (idx_pos - idx_arr == *stripe_cnt)
 622                         break;
 623         }
 624         if ((speed < 2) && (idx_pos - idx_arr < stripe_cnt_min)) {
 625                 /* Try again, allowing slower OSCs */
 626                 speed++;
 627                 lqr->lqr_start_idx = ost_start_idx_temp;
 628                 goto repeat_find;
 629         }
 630
 631         up_read(&lov->lov_qos.lq_rw_sem);
 632
 633         *stripe_cnt = idx_pos - idx_arr;
 634 out:
 635         if (pool != NULL) {
 636                 up_read(&pool_tgt_rw_sem(pool));
 637                 /* put back ref got by lov_find_pool() */
 638                 lov_pool_putref(pool);
 639         }
 640
 641         RETURN(rc);
 642 }
 643
 644 /* alloc objects on osts with specific stripe offset */
 645 static int alloc_specific(struct lov_obd *lov, struct lov_stripe_md *lsm,
 646                           int *idx_arr)
 647 {
 648         unsigned ost_idx, array_idx, ost_count;
 649         int i, rc, *idx_pos;
 650         int speed = 0;
 651         struct pool_desc *pool;
 652         struct ost_pool *osts;
 653         ENTRY;
 654
 655         pool = lov_find_pool(lov, lsm->lsm_pool_name);
 656         if (pool == NULL) {
 657                 osts = &(lov->lov_packed);
 658         } else {
 659                 down_read(&pool_tgt_rw_sem(pool));
 660                 osts = &(pool->pool_obds);
 661         }
 662
 663         ost_count = osts->op_count;
 664
 665 repeat_find:
 666         /* search loi_ost_idx in ost array */
 667         array_idx = 0;
 668         for (i = 0; i < ost_count; i++) {
 669                 if (osts->op_array[i] == lsm->lsm_oinfo[0]->loi_ost_idx) {
 670                         array_idx = i;
 671                         break;
 672                 }
 673         }
 674         if (i == ost_count) {
 675                 CERROR("Start index %d not found in pool '%s'\n",
 676                        lsm->lsm_oinfo[0]->loi_ost_idx, lsm->lsm_pool_name);
 677                 GOTO(out, rc = -EINVAL);
 678         }
 679
 680         idx_pos = idx_arr;
 681         for (i = 0; i < ost_count;
 682              i++, array_idx = (array_idx + 1) % ost_count) {
 683                 ost_idx = osts->op_array[array_idx];
 684
 685                 if (!lov->lov_tgts[ost_idx] ||
 686                     !lov->lov_tgts[ost_idx]->ltd_active) {
 687                         continue;
 688                 }
 689
 690                 /* Fail Check before osc_precreate() is called
 691                    so we can only 'fail' single OSC. */
 692                 if (OBD_FAIL_CHECK(OBD_FAIL_MDS_OSC_PRECREATE) && ost_idx == 0)
 693                         continue;
 694
 695                 /* Drop slow OSCs if we can, but not for requested start idx.
 696                  *
 697                  * This means "if OSC is slow and it is not the requested
 698                  * start OST, then it can be skipped, otherwise skip it only
 699                  * if it is inactive/recovering/out-of-space." */
 700                 if ((obd_precreate(lov->lov_tgts[ost_idx]->ltd_exp) > speed) &&
 701                     (i != 0 || speed >= 2))
 702                         continue;
 703
 704                 *idx_pos = ost_idx;
 705                 idx_pos++;
 706                 /* We have enough stripes */
 707                 if (idx_pos - idx_arr == lsm->lsm_stripe_count)
 708                         GOTO(out, rc = 0);
 709         }
 710         if (speed < 2) {
 711                 /* Try again, allowing slower OSCs */
 712                 speed++;
 713                 goto repeat_find;
 714         }
 715
 716         /* If we were passed specific striping params, then a failure to
 717          * meet those requirements is an error, since we can't reallocate
 718          * that memory (it might be part of a larger array or something).
 719          *
 720          * We can only get here if lsm_stripe_count was originally > 1.
 721          */
 722         CERROR("can't lstripe objid "LPX64": have %d want %u\n",
 723                lsm->lsm_object_id, (int)(idx_pos - idx_arr),
 724                lsm->lsm_stripe_count);
 725         rc = -EFBIG;
 726 out:
 727         if (pool != NULL) {
 728                 up_read(&pool_tgt_rw_sem(pool));
 729                 /* put back ref got by lov_find_pool() */
 730                 lov_pool_putref(pool);
 731         }
 732
 733         RETURN(rc);
 734 }
 735
 736 /* Alloc objects on osts with optimization based on:
 737    - free space
 738    - network resources (shared OSS's)
 739 */
 740 static int alloc_qos(struct obd_export *exp, int *idx_arr, int *stripe_cnt,
 741                      char *poolname, int flags)
 742 {
 743         struct lov_obd *lov = &exp->exp_obd->u.lov;
 744         static time_t last_warn = 0;
 745         time_t now = cfs_time_current_sec();
 746         __u64 total_bavail, total_weight = 0;
 747         int nfound, good_osts, i, warn = 0, rc = 0;
 748         int stripe_cnt_min = min_stripe_count(*stripe_cnt, flags);
 749         struct pool_desc *pool;
 750         struct ost_pool *osts;
 751         struct lov_qos_rr *lqr;
 752         ENTRY;
 753
 754         if (stripe_cnt_min < 1)
 755                 RETURN(-EINVAL);
 756
 757         pool = lov_find_pool(lov, poolname);
 758         if (pool == NULL) {
 759                 osts = &(lov->lov_packed);
 760                 lqr = &(lov->lov_qos.lq_rr);
 761         } else {
 762                 down_read(&pool_tgt_rw_sem(pool));
 763                 osts = &(pool->pool_obds);
 764                 lqr = &(pool->pool_rr);
 765         }
 766
 767         obd_getref(exp->exp_obd);
 768
 769         /* wait for fresh statfs info if needed, the rpcs are sent in
 770          * lov_create() */
 771         qos_statfs_update(exp->exp_obd,
 772                           cfs_time_shift_64(-2 * lov->desc.ld_qos_maxage), 1);
 773
 774         /* Detect -EAGAIN early, before expensive lock is taken. */
 775         if (!lov->lov_qos.lq_dirty && lov->lov_qos.lq_same_space)
 776                 GOTO(out_nolock, rc = -EAGAIN);
 777
 778         /* Do actual allocation, use write lock here. */
 779         down_write(&lov->lov_qos.lq_rw_sem);
 780
 781         /*
 782          * Check again, while we were sleeping on @lq_rw_sem things could
 783          * change.
 784          */
 785         if (!lov->lov_qos.lq_dirty && lov->lov_qos.lq_same_space)
 786                 GOTO(out, rc = -EAGAIN);
 787
 788         if (lov->desc.ld_active_tgt_count < 2)
 789                 GOTO(out, rc = -EAGAIN);
 790
 791         rc = qos_calc_ppo(exp->exp_obd);
 792         if (rc)
 793                 GOTO(out, rc);
 794
 795         total_bavail = 0;
 796         good_osts = 0;
 797         /* Warn users about zero available space/inode every 30 min */
 798         if (cfs_time_sub(now, last_warn) > 60 * 30)
 799                 warn = 1;
 800         /* Find all the OSTs that are valid stripe candidates */
 801         for (i = 0; i < osts->op_count; i++) {
 802                 __u64 bavail;
 803
 804                 if (!lov->lov_tgts[osts->op_array[i]] ||
 805                     !lov->lov_tgts[osts->op_array[i]]->ltd_active)
 806                         continue;
 807                 bavail = TGT_BAVAIL(osts->op_array[i]);
 808                 if (!bavail) {
 809                         if (warn) {
 810                                 CDEBUG(D_QOS, "no free space on %s\n",
 811                                      obd_uuid2str(&lov->lov_tgts[osts->op_array[i]]->ltd_uuid));
 812                                 last_warn = now;
 813                         }
 814                         continue;
 815                 }
 816                 if (!TGT_FFREE(osts->op_array[i])) {
 817                         if (warn) {
 818                                 CDEBUG(D_QOS, "no free inodes on %s\n",
 819                                      obd_uuid2str(&lov->lov_tgts[osts->op_array[i]]->ltd_uuid));
 820                                 last_warn = now;
 821                         }
 822                         continue;
 823                 }
 824
 825                 /* Fail Check before osc_precreate() is called
 826                    so we can only 'fail' single OSC. */
 827                 if (OBD_FAIL_CHECK(OBD_FAIL_MDS_OSC_PRECREATE) && osts->op_array[i] == 0)
 828                         continue;
 829
 830                 if (obd_precreate(lov->lov_tgts[osts->op_array[i]]->ltd_exp) > 2)
 831                         continue;
 832
 833                 lov->lov_tgts[osts->op_array[i]]->ltd_qos.ltq_usable = 1;
 834                 qos_calc_weight(lov, osts->op_array[i]);
 835                 total_bavail += bavail;
 836                 total_weight += lov->lov_tgts[osts->op_array[i]]->ltd_qos.ltq_weight;
 837
 838                 good_osts++;
 839         }
 840
 841 #ifdef QOS_DEBUG
 842         CDEBUG(D_QOS, "found %d good osts\n", good_osts);
 843 #endif
 844
 845         if (good_osts < stripe_cnt_min)
 846                 GOTO(out, rc = -EAGAIN);
 847
 848         if (!total_bavail)
 849                 GOTO(out, rc = -ENOSPC);
 850
 851         /* We have enough osts */
 852         if (good_osts < *stripe_cnt)
 853                 *stripe_cnt = good_osts;
 854
 855         if (!*stripe_cnt)
 856                 GOTO(out, rc = -EAGAIN);
 857
 858         /* Find enough OSTs with weighted random allocation. */
 859         nfound = 0;
 860         while (nfound < *stripe_cnt) {
 861                 __u64 rand, cur_weight;
 862
 863                 cur_weight = 0;
 864                 rc = -ENODEV;
 865
 866                 if (total_weight) {
 867 #if BITS_PER_LONG == 32
 868                         rand = ll_rand() % (unsigned)total_weight;
 869                         /* If total_weight > 32-bit, first generate the high
 870                          * 32 bits of the random number, then add in the low
 871                          * 32 bits (truncated to the upper limit, if needed) */
 872                         if (total_weight > 0xffffffffULL)
 873                                 rand = (__u64)(ll_rand() %
 874                                           (unsigned)(total_weight >> 32)) << 32;
 875                         else
 876                                 rand = 0;
 877
 878                         if (rand == (total_weight & 0xffffffff00000000ULL))
 879                                 rand |= ll_rand() % (unsigned)total_weight;
 880                         else
 881                                 rand |= ll_rand();
 882
 883 #else
 884                         rand = ((__u64)ll_rand() << 32 | ll_rand()) %
 885                                 total_weight;
 886 #endif
 887                 } else {
 888                         rand = 0;
 889                 }
 890
 891                 /* On average, this will hit larger-weighted osts more often.
 892                    0-weight osts will always get used last (only when rand=0).*/
 893                 for (i = 0; i < osts->op_count; i++) {
 894                         if (!lov->lov_tgts[osts->op_array[i]] ||
 895                             !lov->lov_tgts[osts->op_array[i]]->ltd_qos.ltq_usable)
 896                                 continue;
 897
 898                         cur_weight += lov->lov_tgts[osts->op_array[i]]->ltd_qos.ltq_weight;
 899 #ifdef QOS_DEBUG
 900                         CDEBUG(D_QOS, "stripe_cnt=%d nfound=%d cur_weight="LPU64
 901                                       " rand="LPU64" total_weight="LPU64"\n",
 902                                *stripe_cnt, nfound, cur_weight, rand, total_weight);
 903 #endif
 904                         if (cur_weight >= rand) {
 905 #ifdef QOS_DEBUG
 906                                 CDEBUG(D_QOS, "assigned stripe=%d to idx=%d\n",
 907                                        nfound, osts->op_array[i]);
 908 #endif
 909                                 idx_arr[nfound++] = osts->op_array[i];
 910                                 qos_used(lov, osts, osts->op_array[i], &total_weight);
 911                                 rc = 0;
 912                                 break;
 913                         }
 914                 }
 915                 /* should never satisfy below condition */
 916                 if (rc) {
 917                         CERROR("Didn't find any OSTs?\n");
 918                         break;
 919                 }
 920         }
 921         LASSERT(nfound == *stripe_cnt);
 922
 923 out:
 924         up_write(&lov->lov_qos.lq_rw_sem);
 925
 926 out_nolock:
 927         if (pool != NULL) {
 928                 up_read(&pool_tgt_rw_sem(pool));
 929                 /* put back ref got by lov_find_pool() */
 930                 lov_pool_putref(pool);
 931         }
 932
 933         if (rc == -EAGAIN)
 934                 rc = alloc_rr(lov, idx_arr, stripe_cnt, poolname, flags);
 935
 936         obd_putref(exp->exp_obd);
 937         RETURN(rc);
 938 }
 939
 940 /* return new alloced stripe count on success */
 941 static int alloc_idx_array(struct obd_export *exp, struct lov_stripe_md *lsm,
 942                            int newea, int **idx_arr, int *arr_cnt, int flags)
 943 {
 944         struct lov_obd *lov = &exp->exp_obd->u.lov;
 945         int stripe_cnt = lsm->lsm_stripe_count;
 946         int i, rc = 0;
 947         int *tmp_arr = NULL;
 948         ENTRY;
 949
 950         *arr_cnt = stripe_cnt;
 951         OBD_ALLOC(tmp_arr, *arr_cnt * sizeof(int));
 952         if (tmp_arr == NULL)
 953                 RETURN(-ENOMEM);
 954         for (i = 0; i < *arr_cnt; i++)
 955                 tmp_arr[i] = -1;
 956
 957         if (newea ||
 958             lsm->lsm_oinfo[0]->loi_ost_idx >= lov->desc.ld_tgt_count)
 959                 rc = alloc_qos(exp, tmp_arr, &stripe_cnt,
 960                                lsm->lsm_pool_name, flags);
 961         else
 962                 rc = alloc_specific(lov, lsm, tmp_arr);
 963
 964         if (rc)
 965                 GOTO(out_arr, rc);
 966
 967         *idx_arr = tmp_arr;
 968         RETURN(stripe_cnt);
 969 out_arr:
 970         OBD_FREE(tmp_arr, *arr_cnt * sizeof(int));
 971         *arr_cnt = 0;
 972         RETURN(rc);
 973 }
 974
 975 static void free_idx_array(int *idx_arr, int arr_cnt)
 976 {
 977         if (arr_cnt)
 978                 OBD_FREE(idx_arr, arr_cnt * sizeof(int));
 979 }
 980
 981 int qos_prep_create(struct obd_export *exp, struct lov_request_set *set)
 982 {
 983         struct lov_obd *lov = &exp->exp_obd->u.lov;
 984         struct lov_stripe_md *lsm;
 985         struct obdo *src_oa = set->set_oi->oi_oa;
 986         struct obd_trans_info *oti = set->set_oti;
 987         int i, stripes, rc = 0, newea = 0;
 988         int flag = LOV_USES_ASSIGNED_STRIPE;
 989         int *idx_arr = NULL, idx_cnt = 0;
 990         ENTRY;
 991
 992         LASSERT(src_oa->o_valid & OBD_MD_FLID);
 993         LASSERT(src_oa->o_valid & OBD_MD_FLGROUP);
 994
 995         if (set->set_oi->oi_md == NULL) {
 996                 int stripes_def = lov_get_stripecnt(lov, 0);
 997
 998                 /* If the MDS file was truncated up to some size, stripe over
 999                  * enough OSTs to allow the file to be created at that size.
1000                  * This may mean we use more than the default # of stripes. */
1001                 if (src_oa->o_valid & OBD_MD_FLSIZE) {
1002                         obd_size min_bavail = LUSTRE_STRIPE_MAXBYTES;
1003
1004                         /* Find a small number of stripes we can use
1005                            (up to # of active osts). */
1006                         stripes = 1;
1007                         for (i = 0; i < lov->desc.ld_tgt_count; i++) {
1008                                 if (!lov->lov_tgts[i] ||
1009                                     !lov->lov_tgts[i]->ltd_active)
1010                                         continue;
1011                                 min_bavail = min(min_bavail, TGT_BAVAIL(i));
1012                                 if (min_bavail * stripes > src_oa->o_size)
1013                                         break;
1014                                 stripes++;
1015                         }
1016
1017                         if (stripes < stripes_def)
1018                                 stripes = stripes_def;
1019                 } else {
1020                          flag = LOV_USES_DEFAULT_STRIPE;
1021                          stripes = stripes_def;
1022                 }
1023
1024                 rc = lov_alloc_memmd(&set->set_oi->oi_md, stripes,
1025                                      lov->desc.ld_pattern ?
1026                                      lov->desc.ld_pattern : LOV_PATTERN_RAID0,
1027                                      LOV_MAGIC);
1028                 if (rc < 0)
1029                         GOTO(out_err, rc);
1030                 newea = 1;
1031                 rc = 0;
1032         }
1033
1034         lsm = set->set_oi->oi_md;
1035         lsm->lsm_object_id = src_oa->o_id;
1036         lsm->lsm_object_gr = src_oa->o_gr;
1037
1038         if (!lsm->lsm_stripe_size)
1039                 lsm->lsm_stripe_size = lov->desc.ld_default_stripe_size;
1040         if (!lsm->lsm_pattern) {
1041                 LASSERT(lov->desc.ld_pattern);
1042                 lsm->lsm_pattern = lov->desc.ld_pattern;
1043         }
1044
1045         stripes = alloc_idx_array(exp, lsm, newea, &idx_arr, &idx_cnt, flag);
1046         if (stripes <= 0)
1047                 GOTO(out_err, rc = stripes ? stripes : -EIO);
1048         LASSERTF(stripes <= lsm->lsm_stripe_count,"requested %d allocated %d\n",
1049                  lsm->lsm_stripe_count, stripes);
1050
1051         for (i = 0; i < stripes; i++) {
1052                 struct lov_request *req;
1053                 int ost_idx = idx_arr[i];
1054                 LASSERT(ost_idx >= 0);
1055
1056                 OBD_ALLOC(req, sizeof(*req));
1057                 if (req == NULL)
1058                         GOTO(out_err, rc = -ENOMEM);
1059                 lov_set_add_req(req, set);
1060
1061                 req->rq_buflen = sizeof(*req->rq_oi.oi_md);
1062                 OBD_ALLOC(req->rq_oi.oi_md, req->rq_buflen);
1063                 if (req->rq_oi.oi_md == NULL)
1064                         GOTO(out_err, rc = -ENOMEM);
1065
1066                 OBDO_ALLOC(req->rq_oi.oi_oa);
1067                 if (req->rq_oi.oi_oa == NULL)
1068                         GOTO(out_err, rc = -ENOMEM);
1069
1070                 req->rq_idx = ost_idx;
1071                 req->rq_stripe = i;
1072                 /* create data objects with "parent" OA */
1073                 memcpy(req->rq_oi.oi_oa, src_oa, sizeof(*req->rq_oi.oi_oa));
1074
1075                 /* XXX When we start creating objects on demand, we need to
1076                  *     make sure that we always create the object on the
1077                  *     stripe which holds the existing file size.
1078                  */
1079                 if (src_oa->o_valid & OBD_MD_FLSIZE) {
1080                         req->rq_oi.oi_oa->o_size =
1081                                 lov_size_to_stripe(lsm, src_oa->o_size, i);
1082
1083                         CDEBUG(D_INODE, "stripe %d has size "LPU64"/"LPU64"\n",
1084                                i, req->rq_oi.oi_oa->o_size, src_oa->o_size);
1085                 }
1086         }
1087         LASSERT(set->set_count == stripes);
1088
1089         if (stripes < lsm->lsm_stripe_count)
1090                 qos_shrink_lsm(set);
1091         if (OBD_FAIL_CHECK(OBD_FAIL_MDS_LOV_PREP_CREATE)) {
1092                 qos_shrink_lsm(set);
1093                 rc = -EIO;
1094         }
1095
1096         if (oti && (src_oa->o_valid & OBD_MD_FLCOOKIE)) {
1097                 oti_alloc_cookies(oti, set->set_count);
1098                 if (!oti->oti_logcookies)
1099                         GOTO(out_err, rc = -ENOMEM);
1100                 set->set_cookies = oti->oti_logcookies;
1101         }
1102 out_err:
1103         if (newea && rc)
1104                 obd_free_memmd(exp, &set->set_oi->oi_md);
1105         if (idx_arr)
1106                 free_idx_array(idx_arr, idx_cnt);
1107         EXIT;
1108         return rc;
1109 }
1110
1111 void qos_update(struct lov_obd *lov)
1112 {
1113         ENTRY;
1114         lov->lov_qos.lq_dirty = 1;
1115 }
1116
1117 void qos_statfs_done(struct lov_obd *lov)
1118 {
1119         LASSERT(lov->lov_qos.lq_statfs_in_progress);
1120         down_write(&lov->lov_qos.lq_rw_sem);
1121         lov->lov_qos.lq_statfs_in_progress = 0;
1122         /* wake up any threads waiting for the statfs rpcs to complete */
1123         cfs_waitq_signal(&lov->lov_qos.lq_statfs_waitq);
1124         up_write(&lov->lov_qos.lq_rw_sem);
1125 }
1126
1127 static int qos_statfs_ready(struct obd_device *obd, __u64 max_age)
1128 {
1129         struct lov_obd         *lov = &obd->u.lov;
1130         int rc;
1131         ENTRY;
1132         down_read(&lov->lov_qos.lq_rw_sem);
1133         rc = lov->lov_qos.lq_statfs_in_progress == 0 ||
1134              cfs_time_beforeq_64(max_age, obd->obd_osfs_age);
1135         up_read(&lov->lov_qos.lq_rw_sem);
1136         RETURN(rc);
1137 }
1138
1139 /*
1140  * Update statfs data if the current osfs age is older than max_age.
1141  * If wait is not set, it means that we are called from lov_create()
1142  * and we should just issue the rpcs without waiting for them to complete.
1143  * If wait is set, we are called from alloc_qos() and we just have
1144  * to wait for the request set to complete.
1145  */
1146 void qos_statfs_update(struct obd_device *obd, __u64 max_age, int wait)
1147 {
1148         struct lov_obd         *lov = &obd->u.lov;
1149         struct obd_info        *oinfo;
1150         int                     rc = 0;
1151         struct ptlrpc_request_set *set = NULL;
1152         ENTRY;
1153
1154         if (cfs_time_beforeq_64(max_age, obd->obd_osfs_age))
1155                 /* statfs data are quite recent, don't need to refresh it */
1156                 RETURN_EXIT;
1157
1158         if (!wait && lov->lov_qos.lq_statfs_in_progress)
1159                 /* statfs already in progress */
1160                 RETURN_EXIT;
1161
1162         down_write(&lov->lov_qos.lq_rw_sem);
1163         if (lov->lov_qos.lq_statfs_in_progress) {
1164                 up_write(&lov->lov_qos.lq_rw_sem);
1165                 GOTO(out, rc = 0);
1166         }
1167         /* no statfs in flight, send rpcs */
1168         lov->lov_qos.lq_statfs_in_progress = 1;
1169         up_write(&lov->lov_qos.lq_rw_sem);
1170
1171         if (wait)
1172                 CDEBUG(D_QOS, "%s: did not manage to get fresh statfs data "
1173                        "in a timely manner (osfs age "LPU64", max age "LPU64")"
1174                        ", sending new statfs rpcs\n",
1175                        obd_uuid2str(&lov->desc.ld_uuid), obd->obd_osfs_age,
1176                        max_age);
1177
1178         /* need to send statfs rpcs */
1179         CDEBUG(D_QOS, "sending new statfs requests\n");
1180         memset(lov->lov_qos.lq_statfs_data, 0,
1181                sizeof(*lov->lov_qos.lq_statfs_data));
1182         oinfo = &lov->lov_qos.lq_statfs_data->lsd_oi;
1183         oinfo->oi_osfs = &lov->lov_qos.lq_statfs_data->lsd_statfs;
1184         oinfo->oi_flags = OBD_STATFS_NODELAY;
1185         set = ptlrpc_prep_set();
1186         if (!set)
1187                 GOTO(out_failed, rc = -ENOMEM);
1188
1189         rc = obd_statfs_async(obd, oinfo, max_age, set);
1190         if (rc || list_empty(&set->set_requests)) {
1191                 if (rc)
1192                         CWARN("statfs failed with %d\n", rc);
1193                 GOTO(out_failed, rc);
1194         }
1195         /* send requests via ptlrpcd */
1196         oinfo->oi_flags |= OBD_STATFS_PTLRPCD;
1197         ptlrpcd_add_rqset(set);
1198         GOTO(out, rc);
1199
1200 out_failed:
1201         down_write(&lov->lov_qos.lq_rw_sem);
1202         lov->lov_qos.lq_statfs_in_progress = 0;
1203         /* wake up any threads waiting for the statfs rpcs to complete */
1204         cfs_waitq_signal(&lov->lov_qos.lq_statfs_waitq);
1205         up_write(&lov->lov_qos.lq_rw_sem);
1206         wait = 0;
1207 out:
1208         if (set)
1209                 ptlrpc_set_destroy(set);
1210         if (wait) {
1211                 struct l_wait_info lwi = { 0 };
1212                 CDEBUG(D_QOS, "waiting for statfs requests to complete\n");
1213                 l_wait_event(lov->lov_qos.lq_statfs_waitq,
1214                              qos_statfs_ready(obd, max_age), &lwi);
1215                 if (cfs_time_before_64(obd->obd_osfs_age, max_age))
1216                         CDEBUG(D_QOS, "%s: still no fresh statfs data after "
1217                                       "waiting (osfs age "LPU64", max age "
1218                                       LPU64")\n",
1219                                       obd_uuid2str(&lov->desc.ld_uuid),
1220                                       obd->obd_osfs_age, max_age);
1221         }
1222 }