X-Git-Url: https://git.whamcloud.com/?p=fs%2Flustre-release.git;a=blobdiff_plain;f=lustre%2Flov%2Flov_qos.c;h=2262c503af6bc56e2d048422cb6321da5fba1698;hp=64cfa27566ce1432578bb48b6295016dbc4b729c;hb=eb7c28ff977f4e0a280558aa74e23f2a9ab0ea0c;hpb=b92e914bd75cb62d34d7e42e8bf78864755106f2 diff --git a/lustre/lov/lov_qos.c b/lustre/lov/lov_qos.c index 64cfa27..2262c50 100644 --- a/lustre/lov/lov_qos.c +++ b/lustre/lov/lov_qos.c @@ -1,22 +1,37 @@ /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*- * vim:expandtab:shiftwidth=8:tabstop=8: * - * Copyright (C) 2002, 2003 Cluster File Systems, Inc. + * GPL HEADER START * - * This file is part of Lustre, http://www.lustre.org. + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * - * Lustre is free software; you can redistribute it and/or - * modify it under the terms of version 2 of the GNU General Public - * License as published by the Free Software Foundation. + * This program is free software; you can redistribute it and/or modify + * it under the terms of the GNU General Public License version 2 only, + * as published by the Free Software Foundation. * - * Lustre is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. + * This program is distributed in the hope that it will be useful, but + * WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + * General Public License version 2 for more details (a copy is included + * in the LICENSE file that accompanied this code). * - * You should have received a copy of the GNU General Public License - * along with Lustre; if not, write to the Free Software - * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. + * You should have received a copy of the GNU General Public License + * version 2 along with this program; If not, see + * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf + * + * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, + * CA 95054 USA or visit www.sun.com if you need additional information or + * have any questions. + * + * GPL HEADER END + */ +/* + * Copyright (c) 2005, 2010, Oracle and/or its affiliates. All rights reserved. + * Use is subject to license terms. + */ +/* + * This file is part of Lustre, http://www.lustre.org/ + * Lustre is a trademark of Sun Microsystems, Inc. */ #ifndef EXPORT_SYMTAB @@ -25,19 +40,415 @@ #define DEBUG_SUBSYSTEM S_LOV #ifdef __KERNEL__ +#include #else #include #endif -#include -#include - +#include +#include +#include #include "lov_internal.h" +/* #define QOS_DEBUG 1 */ +#define D_QOS D_OTHER + +#define TGT_BAVAIL(i) (lov->lov_tgts[i]->ltd_exp->exp_obd->obd_osfs.os_bavail *\ + lov->lov_tgts[i]->ltd_exp->exp_obd->obd_osfs.os_bsize) + + +int qos_add_tgt(struct obd_device *obd, __u32 index) +{ + struct lov_obd *lov = &obd->u.lov; + struct lov_qos_oss *oss, *temposs; + struct obd_export *exp = lov->lov_tgts[index]->ltd_exp; + int rc = 0, found = 0; + ENTRY; + + /* We only need this QOS struct on MDT, not clients - but we may not + * have registered the LOV's observer yet, so there's no way to know */ + if (!exp || !exp->exp_connection) { + CERROR("Missing connection\n"); + RETURN(-ENOTCONN); + } + + cfs_down_write(&lov->lov_qos.lq_rw_sem); + cfs_mutex_down(&lov->lov_lock); + cfs_list_for_each_entry(oss, &lov->lov_qos.lq_oss_list, lqo_oss_list) { + if (obd_uuid_equals(&oss->lqo_uuid, + &exp->exp_connection->c_remote_uuid)) { + found++; + break; + } + } + + if (!found) { + OBD_ALLOC_PTR(oss); + if (!oss) + GOTO(out, rc = -ENOMEM); + memcpy(&oss->lqo_uuid, + &exp->exp_connection->c_remote_uuid, + sizeof(oss->lqo_uuid)); + } else { + /* Assume we have to move this one */ + cfs_list_del(&oss->lqo_oss_list); + } + + oss->lqo_ost_count++; + lov->lov_tgts[index]->ltd_qos.ltq_oss = oss; + + /* Add sorted by # of OSTs. Find the first entry that we're + bigger than... */ + cfs_list_for_each_entry(temposs, &lov->lov_qos.lq_oss_list, + lqo_oss_list) { + if (oss->lqo_ost_count > temposs->lqo_ost_count) + break; + } + /* ...and add before it. If we're the first or smallest, temposs + points to the list head, and we add to the end. */ + cfs_list_add_tail(&oss->lqo_oss_list, &temposs->lqo_oss_list); + + lov->lov_qos.lq_dirty = 1; + lov->lov_qos.lq_rr.lqr_dirty = 1; + + CDEBUG(D_QOS, "add tgt %s to OSS %s (%d OSTs)\n", + obd_uuid2str(&lov->lov_tgts[index]->ltd_uuid), + obd_uuid2str(&oss->lqo_uuid), + oss->lqo_ost_count); + +out: + cfs_mutex_up(&lov->lov_lock); + cfs_up_write(&lov->lov_qos.lq_rw_sem); + RETURN(rc); +} + +int qos_del_tgt(struct obd_device *obd, struct lov_tgt_desc *tgt) +{ + struct lov_obd *lov = &obd->u.lov; + struct lov_qos_oss *oss; + int rc = 0; + ENTRY; + + cfs_down_write(&lov->lov_qos.lq_rw_sem); + + oss = tgt->ltd_qos.ltq_oss; + if (!oss) + GOTO(out, rc = -ENOENT); + + oss->lqo_ost_count--; + if (oss->lqo_ost_count == 0) { + CDEBUG(D_QOS, "removing OSS %s\n", + obd_uuid2str(&oss->lqo_uuid)); + cfs_list_del(&oss->lqo_oss_list); + OBD_FREE_PTR(oss); + } + + lov->lov_qos.lq_dirty = 1; + lov->lov_qos.lq_rr.lqr_dirty = 1; +out: + cfs_up_write(&lov->lov_qos.lq_rw_sem); + RETURN(rc); +} + +/* Recalculate per-object penalties for OSSs and OSTs, + depends on size of each ost in an oss */ +static int qos_calc_ppo(struct obd_device *obd) +{ + struct lov_obd *lov = &obd->u.lov; + struct lov_qos_oss *oss; + __u64 ba_max, ba_min, temp; + __u32 num_active; + int rc, i, prio_wide; + time_t now, age; + ENTRY; + + if (!lov->lov_qos.lq_dirty) + GOTO(out, rc = 0); + + num_active = lov->desc.ld_active_tgt_count - 1; + if (num_active < 1) + GOTO(out, rc = -EAGAIN); + + /* find bavail on each OSS */ + cfs_list_for_each_entry(oss, &lov->lov_qos.lq_oss_list, lqo_oss_list) { + oss->lqo_bavail = 0; + } + lov->lov_qos.lq_active_oss_count = 0; + + /* How badly user wants to select osts "widely" (not recently chosen + and not on recent oss's). As opposed to "freely" (free space + avail.) 0-256. */ + prio_wide = 256 - lov->lov_qos.lq_prio_free; + + ba_min = (__u64)(-1); + ba_max = 0; + now = cfs_time_current_sec(); + /* Calculate OST penalty per object */ + /* (lov ref taken in alloc_qos) */ + for (i = 0; i < lov->desc.ld_tgt_count; i++) { + if (!lov->lov_tgts[i] || !lov->lov_tgts[i]->ltd_active) + continue; + temp = TGT_BAVAIL(i); + if (!temp) + continue; + ba_min = min(temp, ba_min); + ba_max = max(temp, ba_max); + + /* Count the number of usable OSS's */ + if (lov->lov_tgts[i]->ltd_qos.ltq_oss->lqo_bavail == 0) + lov->lov_qos.lq_active_oss_count++; + lov->lov_tgts[i]->ltd_qos.ltq_oss->lqo_bavail += temp; + + /* per-OST penalty is prio * TGT_bavail / (num_ost - 1) / 2 */ + temp >>= 1; + do_div(temp, num_active); + lov->lov_tgts[i]->ltd_qos.ltq_penalty_per_obj = + (temp * prio_wide) >> 8; + + age = (now - lov->lov_tgts[i]->ltd_qos.ltq_used) >> 3; + if (lov->lov_qos.lq_reset || age > 32 * lov->desc.ld_qos_maxage) + lov->lov_tgts[i]->ltd_qos.ltq_penalty = 0; + else if (age > lov->desc.ld_qos_maxage) + /* Decay the penalty by half for every 8x the update + * interval that the device has been idle. That gives + * lots of time for the statfs information to be + * updated (which the penalty is only a proxy for), + * and avoids penalizing OSS/OSTs under light load. */ + lov->lov_tgts[i]->ltd_qos.ltq_penalty >>= + (age / lov->desc.ld_qos_maxage); + } + + num_active = lov->lov_qos.lq_active_oss_count - 1; + if (num_active < 1) { + /* If there's only 1 OSS, we can't penalize it, so instead + we have to double the OST penalty */ + num_active = 1; + for (i = 0; i < lov->desc.ld_tgt_count; i++) { + if (lov->lov_tgts[i] == NULL) + continue; + lov->lov_tgts[i]->ltd_qos.ltq_penalty_per_obj <<= 1; + } + } + + /* Per-OSS penalty is prio * oss_avail / oss_osts / (num_oss - 1) / 2 */ + cfs_list_for_each_entry(oss, &lov->lov_qos.lq_oss_list, lqo_oss_list) { + temp = oss->lqo_bavail >> 1; + do_div(temp, oss->lqo_ost_count * num_active); + oss->lqo_penalty_per_obj = (temp * prio_wide) >> 8; + + age = (now - oss->lqo_used) >> 3; + if (lov->lov_qos.lq_reset || age > 32 * lov->desc.ld_qos_maxage) + oss->lqo_penalty = 0; + else if (age > lov->desc.ld_qos_maxage) + /* Decay the penalty by half for every 8x the update + * interval that the device has been idle. That gives + * lots of time for the statfs information to be + * updated (which the penalty is only a proxy for), + * and avoids penalizing OSS/OSTs under light load. */ + oss->lqo_penalty >>= (age / lov->desc.ld_qos_maxage); + } + + lov->lov_qos.lq_dirty = 0; + lov->lov_qos.lq_reset = 0; + + /* If each ost has almost same free space, + * do rr allocation for better creation performance */ + lov->lov_qos.lq_same_space = 0; + if ((ba_max * (256 - lov->lov_qos.lq_threshold_rr)) >> 8 < ba_min) { + lov->lov_qos.lq_same_space = 1; + /* Reset weights for the next time we enter qos mode */ + lov->lov_qos.lq_reset = 1; + } + rc = 0; + +out: + if (!rc && lov->lov_qos.lq_same_space) + RETURN(-EAGAIN); + RETURN(rc); +} + +static int qos_calc_weight(struct lov_obd *lov, int i) +{ + __u64 temp, temp2; + + /* Final ost weight = TGT_BAVAIL - ost_penalty - oss_penalty */ + temp = TGT_BAVAIL(i); + temp2 = lov->lov_tgts[i]->ltd_qos.ltq_penalty + + lov->lov_tgts[i]->ltd_qos.ltq_oss->lqo_penalty; + if (temp < temp2) + lov->lov_tgts[i]->ltd_qos.ltq_weight = 0; + else + lov->lov_tgts[i]->ltd_qos.ltq_weight = temp - temp2; + return 0; +} + +/* We just used this index for a stripe; adjust everyone's weights */ +static int qos_used(struct lov_obd *lov, struct ost_pool *osts, + __u32 index, __u64 *total_wt) +{ + struct lov_qos_oss *oss; + int j; + ENTRY; + + /* Don't allocate from this stripe anymore, until the next alloc_qos */ + lov->lov_tgts[index]->ltd_qos.ltq_usable = 0; + + oss = lov->lov_tgts[index]->ltd_qos.ltq_oss; + + /* Decay old penalty by half (we're adding max penalty, and don't + want it to run away.) */ + lov->lov_tgts[index]->ltd_qos.ltq_penalty >>= 1; + oss->lqo_penalty >>= 1; + + /* mark the OSS and OST as recently used */ + lov->lov_tgts[index]->ltd_qos.ltq_used = + oss->lqo_used = cfs_time_current_sec(); + + /* Set max penalties for this OST and OSS */ + lov->lov_tgts[index]->ltd_qos.ltq_penalty += + lov->lov_tgts[index]->ltd_qos.ltq_penalty_per_obj * + lov->desc.ld_active_tgt_count; + oss->lqo_penalty += oss->lqo_penalty_per_obj * + lov->lov_qos.lq_active_oss_count; + + /* Decrease all OSS penalties */ + cfs_list_for_each_entry(oss, &lov->lov_qos.lq_oss_list, lqo_oss_list) { + if (oss->lqo_penalty < oss->lqo_penalty_per_obj) + oss->lqo_penalty = 0; + else + oss->lqo_penalty -= oss->lqo_penalty_per_obj; + } + + *total_wt = 0; + /* Decrease all OST penalties */ + for (j = 0; j < osts->op_count; j++) { + int i; + + i = osts->op_array[j]; + if (!lov->lov_tgts[i] || !lov->lov_tgts[i]->ltd_active) + continue; + if (lov->lov_tgts[i]->ltd_qos.ltq_penalty < + lov->lov_tgts[i]->ltd_qos.ltq_penalty_per_obj) + lov->lov_tgts[i]->ltd_qos.ltq_penalty = 0; + else + lov->lov_tgts[i]->ltd_qos.ltq_penalty -= + lov->lov_tgts[i]->ltd_qos.ltq_penalty_per_obj; + + qos_calc_weight(lov, i); + + /* Recalc the total weight of usable osts */ + if (lov->lov_tgts[i]->ltd_qos.ltq_usable) + *total_wt += lov->lov_tgts[i]->ltd_qos.ltq_weight; + +#ifdef QOS_DEBUG + CDEBUG(D_QOS, "recalc tgt %d usable=%d avail="LPU64 + " ostppo="LPU64" ostp="LPU64" ossppo="LPU64 + " ossp="LPU64" wt="LPU64"\n", + i, lov->lov_tgts[i]->ltd_qos.ltq_usable, + TGT_BAVAIL(i) >> 10, + lov->lov_tgts[i]->ltd_qos.ltq_penalty_per_obj >> 10, + lov->lov_tgts[i]->ltd_qos.ltq_penalty >> 10, + lov->lov_tgts[i]->ltd_qos.ltq_oss->lqo_penalty_per_obj>>10, + lov->lov_tgts[i]->ltd_qos.ltq_oss->lqo_penalty >> 10, + lov->lov_tgts[i]->ltd_qos.ltq_weight >> 10); +#endif + } + + RETURN(0); +} + +#define LOV_QOS_EMPTY ((__u32)-1) +/* compute optimal round-robin order, based on OSTs per OSS */ +static int qos_calc_rr(struct lov_obd *lov, struct ost_pool *src_pool, + struct lov_qos_rr *lqr) +{ + struct lov_qos_oss *oss; + unsigned placed, real_count; + int i, rc; + ENTRY; + + if (!lqr->lqr_dirty) { + LASSERT(lqr->lqr_pool.op_size); + RETURN(0); + } + + /* Do actual allocation. */ + cfs_down_write(&lov->lov_qos.lq_rw_sem); + + /* + * Check again. While we were sleeping on @lq_rw_sem something could + * change. + */ + if (!lqr->lqr_dirty) { + LASSERT(lqr->lqr_pool.op_size); + cfs_up_write(&lov->lov_qos.lq_rw_sem); + RETURN(0); + } + + real_count = src_pool->op_count; + + /* Zero the pool array */ + /* alloc_rr is holding a read lock on the pool, so nobody is adding/ + deleting from the pool. The lq_rw_sem insures that nobody else + is reading. */ + lqr->lqr_pool.op_count = real_count; + rc = lov_ost_pool_extend(&lqr->lqr_pool, real_count); + if (rc) { + cfs_up_write(&lov->lov_qos.lq_rw_sem); + RETURN(rc); + } + for (i = 0; i < lqr->lqr_pool.op_count; i++) + lqr->lqr_pool.op_array[i] = LOV_QOS_EMPTY; + + /* Place all the OSTs from 1 OSS at the same time. */ + placed = 0; + cfs_list_for_each_entry(oss, &lov->lov_qos.lq_oss_list, lqo_oss_list) { + int j = 0; + for (i = 0; i < lqr->lqr_pool.op_count; i++) { + if (lov->lov_tgts[src_pool->op_array[i]] && + (lov->lov_tgts[src_pool->op_array[i]]->ltd_qos.ltq_oss == oss)) { + /* Evenly space these OSTs across arrayspace */ + int next = j * lqr->lqr_pool.op_count / oss->lqo_ost_count; + while (lqr->lqr_pool.op_array[next] != + LOV_QOS_EMPTY) + next = (next + 1) % lqr->lqr_pool.op_count; + lqr->lqr_pool.op_array[next] = src_pool->op_array[i]; + j++; + placed++; + } + } + } + + lqr->lqr_dirty = 0; + cfs_up_write(&lov->lov_qos.lq_rw_sem); + + if (placed != real_count) { + /* This should never happen */ + LCONSOLE_ERROR_MSG(0x14e, "Failed to place all OSTs in the " + "round-robin list (%d of %d).\n", + placed, real_count); + for (i = 0; i < lqr->lqr_pool.op_count; i++) { + LCONSOLE(D_WARNING, "rr #%d ost idx=%d\n", i, + lqr->lqr_pool.op_array[i]); + } + lqr->lqr_dirty = 1; + RETURN(-EAGAIN); + } + +#ifdef QOS_DEBUG + for (i = 0; i < lqr->lqr_pool.op_count; i++) { + LCONSOLE(D_QOS, "rr #%d ost idx=%d\n", i, + lqr->lqr_pool.op_array[i]); + } +#endif + + RETURN(0); +} + + void qos_shrink_lsm(struct lov_request_set *set) { - struct lov_stripe_md *lsm = set->set_md; - struct lov_stripe_md *lsm_new; + struct lov_stripe_md *lsm = set->set_oi->oi_md, *lsm_new; /* XXX LOV STACKING call into osc for sizes */ unsigned oldsize, newsize; @@ -57,128 +468,771 @@ void qos_shrink_lsm(struct lov_request_set *set) } } - CWARN("using fewer stripes for object "LPX64": old %u new %u\n", + CWARN("using fewer stripes for object "LPU64": old %u new %u\n", lsm->lsm_object_id, lsm->lsm_stripe_count, set->set_count); + LASSERT(lsm->lsm_stripe_count >= set->set_count); - oldsize = lov_stripe_md_size(lsm->lsm_stripe_count); newsize = lov_stripe_md_size(set->set_count); OBD_ALLOC(lsm_new, newsize); if (lsm_new != NULL) { - memcpy(lsm_new, lsm, newsize); + int i; + memcpy(lsm_new, lsm, sizeof(*lsm)); + for (i = 0; i < lsm->lsm_stripe_count; i++) { + if (i < set->set_count) { + lsm_new->lsm_oinfo[i] = lsm->lsm_oinfo[i]; + continue; + } + OBD_SLAB_FREE(lsm->lsm_oinfo[i], lov_oinfo_slab, + sizeof(struct lov_oinfo)); + } lsm_new->lsm_stripe_count = set->set_count; - OBD_FREE(lsm, oldsize); - set->set_md = lsm_new; + OBD_FREE(lsm, sizeof(struct lov_stripe_md) + + lsm->lsm_stripe_count * sizeof(struct lov_oinfo *)); + set->set_oi->oi_md = lsm_new; + } else { + CWARN("'leaking' few bytes\n"); + } +} + +/** + * Check whether we can create the object on the OST(refered by ost_idx) + * \retval: + * 0: create the object. + * other value: did not create the object. + */ +static int lov_check_and_create_object(struct lov_obd *lov, int ost_idx, + struct lov_stripe_md *lsm, + struct lov_request *req, + struct obd_trans_info *oti) +{ + int stripe; + int rc = -EIO; + ENTRY; + + CDEBUG(D_QOS, "Check and create on idx %d \n", ost_idx); + if (!lov->lov_tgts[ost_idx] || + !lov->lov_tgts[ost_idx]->ltd_active) + RETURN(rc); + + /* check if objects has been created on this ost */ + for (stripe = 0; stripe < lsm->lsm_stripe_count; stripe++) { + /* already have object at this stripe */ + if (ost_idx == lsm->lsm_oinfo[stripe]->loi_ost_idx) + break; + } + + if (stripe >= lsm->lsm_stripe_count) { + req->rq_idx = ost_idx; + rc = obd_create(lov->lov_tgts[ost_idx]->ltd_exp, + req->rq_oi.oi_oa, &req->rq_oi.oi_md, + oti); + } + RETURN(rc); +} + +int qos_remedy_create(struct lov_request_set *set, struct lov_request *req) +{ + struct lov_stripe_md *lsm = set->set_oi->oi_md; + struct lov_obd *lov = &set->set_exp->exp_obd->u.lov; + unsigned ost_idx = 0, ost_count; + struct pool_desc *pool; + struct ost_pool *osts = NULL; + int i, rc = -EIO; + ENTRY; + + /* First check whether we can create the objects on the pool */ + pool = lov_find_pool(lov, lsm->lsm_pool_name); + if (pool != NULL) { + cfs_down_read(&pool_tgt_rw_sem(pool)); + osts = &(pool->pool_obds); + ost_count = osts->op_count; + for (i = 0; i < ost_count; i++, ost_idx = osts->op_array[i]) { + rc = lov_check_and_create_object(lov, ost_idx, lsm, req, + set->set_oti); + if (rc == 0) + break; + } + cfs_up_read(&pool_tgt_rw_sem(pool)); + lov_pool_putref(pool); + RETURN(rc); + } + + ost_count = lov->desc.ld_tgt_count; + /* Then check whether we can create the objects on other OSTs */ + ost_idx = (req->rq_idx + lsm->lsm_stripe_count) % ost_count; + for (i = 0; i < ost_count; i++, ost_idx = (ost_idx + 1) % ost_count) { + rc = lov_check_and_create_object(lov, ost_idx, lsm, req, + set->set_oti); + + if (rc == 0) + break; + } + + RETURN(rc); +} + +static int min_stripe_count(int stripe_cnt, int flags) +{ + return (flags & LOV_USES_DEFAULT_STRIPE ? + stripe_cnt - (stripe_cnt / 4) : stripe_cnt); +} + +#define LOV_CREATE_RESEED_MULT 4 +#define LOV_CREATE_RESEED_MIN 1000 +/* Allocate objects on osts with round-robin algorithm */ +static int alloc_rr(struct lov_obd *lov, int *idx_arr, int *stripe_cnt, + char *poolname, int flags) +{ + unsigned array_idx; + int i, rc, *idx_pos; + __u32 ost_idx; + int ost_start_idx_temp; + int speed = 0; + int stripe_cnt_min = min_stripe_count(*stripe_cnt, flags); + struct pool_desc *pool; + struct ost_pool *osts; + struct lov_qos_rr *lqr; + ENTRY; + + pool = lov_find_pool(lov, poolname); + if (pool == NULL) { + osts = &(lov->lov_packed); + lqr = &(lov->lov_qos.lq_rr); + } else { + cfs_down_read(&pool_tgt_rw_sem(pool)); + osts = &(pool->pool_obds); + lqr = &(pool->pool_rr); + } + + rc = qos_calc_rr(lov, osts, lqr); + if (rc) + GOTO(out, rc); + + if (--lqr->lqr_start_count <= 0) { + lqr->lqr_start_idx = ll_rand() % osts->op_count; + lqr->lqr_start_count = + (LOV_CREATE_RESEED_MIN / max(osts->op_count, 1U) + + LOV_CREATE_RESEED_MULT) * max(osts->op_count, 1U); + } else if (stripe_cnt_min >= osts->op_count || + lqr->lqr_start_idx > osts->op_count) { + /* If we have allocated from all of the OSTs, slowly + * precess the next start if the OST/stripe count isn't + * already doing this for us. */ + lqr->lqr_start_idx %= osts->op_count; + if (*stripe_cnt > 1 && (osts->op_count % (*stripe_cnt)) != 1) + ++lqr->lqr_offset_idx; + } + cfs_down_read(&lov->lov_qos.lq_rw_sem); + ost_start_idx_temp = lqr->lqr_start_idx; + +repeat_find: + array_idx = (lqr->lqr_start_idx + lqr->lqr_offset_idx) % osts->op_count; + idx_pos = idx_arr; +#ifdef QOS_DEBUG + CDEBUG(D_QOS, "pool '%s' want %d startidx %d startcnt %d offset %d " + "active %d count %d arrayidx %d\n", poolname, + *stripe_cnt, lqr->lqr_start_idx, lqr->lqr_start_count, + lqr->lqr_offset_idx, osts->op_count, osts->op_count, array_idx); +#endif + + for (i = 0; i < osts->op_count; + i++, array_idx=(array_idx + 1) % osts->op_count) { + ++lqr->lqr_start_idx; + ost_idx = lqr->lqr_pool.op_array[array_idx]; +#ifdef QOS_DEBUG + CDEBUG(D_QOS, "#%d strt %d act %d strp %d ary %d idx %d\n", + i, lqr->lqr_start_idx, + ((ost_idx != LOV_QOS_EMPTY) && lov->lov_tgts[ost_idx]) ? + lov->lov_tgts[ost_idx]->ltd_active : 0, + idx_pos - idx_arr, array_idx, ost_idx); +#endif + if ((ost_idx == LOV_QOS_EMPTY) || !lov->lov_tgts[ost_idx] || + !lov->lov_tgts[ost_idx]->ltd_active) + continue; + + /* Fail Check before osc_precreate() is called + so we can only 'fail' single OSC. */ + if (OBD_FAIL_CHECK(OBD_FAIL_MDS_OSC_PRECREATE) && ost_idx == 0) + continue; + + /* Drop slow OSCs if we can */ + if (obd_precreate(lov->lov_tgts[ost_idx]->ltd_exp) > speed) + continue; + + *idx_pos = ost_idx; + idx_pos++; + /* We have enough stripes */ + if (idx_pos - idx_arr == *stripe_cnt) + break; + } + if ((speed < 2) && (idx_pos - idx_arr < stripe_cnt_min)) { + /* Try again, allowing slower OSCs */ + speed++; + lqr->lqr_start_idx = ost_start_idx_temp; + goto repeat_find; + } + + cfs_up_read(&lov->lov_qos.lq_rw_sem); + + *stripe_cnt = idx_pos - idx_arr; +out: + if (pool != NULL) { + cfs_up_read(&pool_tgt_rw_sem(pool)); + /* put back ref got by lov_find_pool() */ + lov_pool_putref(pool); + } + + RETURN(rc); +} + +/* alloc objects on osts with specific stripe offset */ +static int alloc_specific(struct lov_obd *lov, struct lov_stripe_md *lsm, + int *idx_arr) +{ + unsigned ost_idx, array_idx, ost_count; + int i, rc, *idx_pos; + int speed = 0; + struct pool_desc *pool; + struct ost_pool *osts; + ENTRY; + + pool = lov_find_pool(lov, lsm->lsm_pool_name); + if (pool == NULL) { + osts = &(lov->lov_packed); } else { - CWARN("'leaking' %d bytes\n", oldsize - newsize); + cfs_down_read(&pool_tgt_rw_sem(pool)); + osts = &(pool->pool_obds); + } + + ost_count = osts->op_count; + +repeat_find: + /* search loi_ost_idx in ost array */ + array_idx = 0; + for (i = 0; i < ost_count; i++) { + if (osts->op_array[i] == lsm->lsm_oinfo[0]->loi_ost_idx) { + array_idx = i; + break; + } + } + if (i == ost_count) { + CERROR("Start index %d not found in pool '%s'\n", + lsm->lsm_oinfo[0]->loi_ost_idx, lsm->lsm_pool_name); + GOTO(out, rc = -EINVAL); + } + + idx_pos = idx_arr; + for (i = 0; i < ost_count; + i++, array_idx = (array_idx + 1) % ost_count) { + ost_idx = osts->op_array[array_idx]; + + if (!lov->lov_tgts[ost_idx] || + !lov->lov_tgts[ost_idx]->ltd_active) { + continue; + } + + /* Fail Check before osc_precreate() is called + so we can only 'fail' single OSC. */ + if (OBD_FAIL_CHECK(OBD_FAIL_MDS_OSC_PRECREATE) && ost_idx == 0) + continue; + + /* Drop slow OSCs if we can, but not for requested start idx. + * + * This means "if OSC is slow and it is not the requested + * start OST, then it can be skipped, otherwise skip it only + * if it is inactive/recovering/out-of-space." */ + if ((obd_precreate(lov->lov_tgts[ost_idx]->ltd_exp) > speed) && + (i != 0 || speed >= 2)) + continue; + + *idx_pos = ost_idx; + idx_pos++; + /* We have enough stripes */ + if (idx_pos - idx_arr == lsm->lsm_stripe_count) + GOTO(out, rc = 0); + } + if (speed < 2) { + /* Try again, allowing slower OSCs */ + speed++; + goto repeat_find; + } + + /* If we were passed specific striping params, then a failure to + * meet those requirements is an error, since we can't reallocate + * that memory (it might be part of a larger array or something). + * + * We can only get here if lsm_stripe_count was originally > 1. + */ + CERROR("can't lstripe objid "LPX64": have %d want %u\n", + lsm->lsm_object_id, (int)(idx_pos - idx_arr), + lsm->lsm_stripe_count); + rc = -EFBIG; +out: + if (pool != NULL) { + cfs_up_read(&pool_tgt_rw_sem(pool)); + /* put back ref got by lov_find_pool() */ + lov_pool_putref(pool); + } + + RETURN(rc); +} + +/* Alloc objects on osts with optimization based on: + - free space + - network resources (shared OSS's) +*/ +static int alloc_qos(struct obd_export *exp, int *idx_arr, int *stripe_cnt, + char *poolname, int flags) +{ + struct lov_obd *lov = &exp->exp_obd->u.lov; + __u64 total_weight = 0; + int nfound, good_osts, i, rc = 0; + int stripe_cnt_min = min_stripe_count(*stripe_cnt, flags); + struct pool_desc *pool; + struct ost_pool *osts; + struct lov_qos_rr *lqr; + ENTRY; + + if (stripe_cnt_min < 1) + RETURN(-EINVAL); + + pool = lov_find_pool(lov, poolname); + if (pool == NULL) { + osts = &(lov->lov_packed); + lqr = &(lov->lov_qos.lq_rr); + } else { + cfs_down_read(&pool_tgt_rw_sem(pool)); + osts = &(pool->pool_obds); + lqr = &(pool->pool_rr); + } + + obd_getref(exp->exp_obd); + + /* wait for fresh statfs info if needed, the rpcs are sent in + * lov_create() */ + qos_statfs_update(exp->exp_obd, + cfs_time_shift_64(-2 * lov->desc.ld_qos_maxage), 1); + + /* Detect -EAGAIN early, before expensive lock is taken. */ + if (!lov->lov_qos.lq_dirty && lov->lov_qos.lq_same_space) + GOTO(out_nolock, rc = -EAGAIN); + + /* Do actual allocation, use write lock here. */ + cfs_down_write(&lov->lov_qos.lq_rw_sem); + + /* + * Check again, while we were sleeping on @lq_rw_sem things could + * change. + */ + if (!lov->lov_qos.lq_dirty && lov->lov_qos.lq_same_space) + GOTO(out, rc = -EAGAIN); + + if (lov->desc.ld_active_tgt_count < 2) + GOTO(out, rc = -EAGAIN); + + rc = qos_calc_ppo(exp->exp_obd); + if (rc) + GOTO(out, rc); + + good_osts = 0; + /* Find all the OSTs that are valid stripe candidates */ + for (i = 0; i < osts->op_count; i++) { + if (!lov->lov_tgts[osts->op_array[i]] || + !lov->lov_tgts[osts->op_array[i]]->ltd_active) + continue; + + /* Fail Check before osc_precreate() is called + so we can only 'fail' single OSC. */ + if (OBD_FAIL_CHECK(OBD_FAIL_MDS_OSC_PRECREATE) && osts->op_array[i] == 0) + continue; + + if (obd_precreate(lov->lov_tgts[osts->op_array[i]]->ltd_exp) > 2) + continue; + + lov->lov_tgts[osts->op_array[i]]->ltd_qos.ltq_usable = 1; + qos_calc_weight(lov, osts->op_array[i]); + total_weight += lov->lov_tgts[osts->op_array[i]]->ltd_qos.ltq_weight; + + good_osts++; + } + +#ifdef QOS_DEBUG + CDEBUG(D_QOS, "found %d good osts\n", good_osts); +#endif + + if (good_osts < stripe_cnt_min) + GOTO(out, rc = -EAGAIN); + + /* We have enough osts */ + if (good_osts < *stripe_cnt) + *stripe_cnt = good_osts; + + if (!*stripe_cnt) + GOTO(out, rc = -EAGAIN); + + /* Find enough OSTs with weighted random allocation. */ + nfound = 0; + while (nfound < *stripe_cnt) { + __u64 rand, cur_weight; + + cur_weight = 0; + rc = -ENODEV; + + if (total_weight) { +#if BITS_PER_LONG == 32 + rand = ll_rand() % (unsigned)total_weight; + /* If total_weight > 32-bit, first generate the high + * 32 bits of the random number, then add in the low + * 32 bits (truncated to the upper limit, if needed) */ + if (total_weight > 0xffffffffULL) + rand = (__u64)(ll_rand() % + (unsigned)(total_weight >> 32)) << 32; + else + rand = 0; + + if (rand == (total_weight & 0xffffffff00000000ULL)) + rand |= ll_rand() % (unsigned)total_weight; + else + rand |= ll_rand(); + +#else + rand = ((__u64)ll_rand() << 32 | ll_rand()) % + total_weight; +#endif + } else { + rand = 0; + } + + /* On average, this will hit larger-weighted osts more often. + 0-weight osts will always get used last (only when rand=0).*/ + for (i = 0; i < osts->op_count; i++) { + if (!lov->lov_tgts[osts->op_array[i]] || + !lov->lov_tgts[osts->op_array[i]]->ltd_qos.ltq_usable) + continue; + + cur_weight += lov->lov_tgts[osts->op_array[i]]->ltd_qos.ltq_weight; +#ifdef QOS_DEBUG + CDEBUG(D_QOS, "stripe_cnt=%d nfound=%d cur_weight="LPU64 + " rand="LPU64" total_weight="LPU64"\n", + *stripe_cnt, nfound, cur_weight, rand, total_weight); +#endif + if (cur_weight >= rand) { +#ifdef QOS_DEBUG + CDEBUG(D_QOS, "assigned stripe=%d to idx=%d\n", + nfound, osts->op_array[i]); +#endif + idx_arr[nfound++] = osts->op_array[i]; + qos_used(lov, osts, osts->op_array[i], &total_weight); + rc = 0; + break; + } + } + /* should never satisfy below condition */ + if (rc) { + CERROR("Didn't find any OSTs?\n"); + break; + } } + LASSERT(nfound == *stripe_cnt); + +out: + cfs_up_write(&lov->lov_qos.lq_rw_sem); + +out_nolock: + if (pool != NULL) { + cfs_up_read(&pool_tgt_rw_sem(pool)); + /* put back ref got by lov_find_pool() */ + lov_pool_putref(pool); + } + + if (rc == -EAGAIN) + rc = alloc_rr(lov, idx_arr, stripe_cnt, poolname, flags); + + obd_putref(exp->exp_obd); + RETURN(rc); } -#define LOV_CREATE_RESEED_INTERVAL 1000 -/* FIXME use real qos data to prepare the lov create request */ -int qos_prep_create(struct lov_obd *lov, struct lov_request_set *set, int newea) +/* return new alloced stripe count on success */ +static int alloc_idx_array(struct obd_export *exp, struct lov_stripe_md *lsm, + int newea, int **idx_arr, int *arr_cnt, int flags) { - static int ost_start_idx, ost_start_count; - unsigned ost_idx, ost_count = lov->desc.ld_tgt_count; - struct lov_stripe_md *lsm = set->set_md; - struct obdo *src_oa = set->set_oa; + struct lov_obd *lov = &exp->exp_obd->u.lov; + int stripe_cnt = lsm->lsm_stripe_count; int i, rc = 0; + int *tmp_arr = NULL; + ENTRY; + + *arr_cnt = stripe_cnt; + OBD_ALLOC(tmp_arr, *arr_cnt * sizeof(int)); + if (tmp_arr == NULL) + RETURN(-ENOMEM); + for (i = 0; i < *arr_cnt; i++) + tmp_arr[i] = -1; + + if (newea || + lsm->lsm_oinfo[0]->loi_ost_idx >= lov->desc.ld_tgt_count) + rc = alloc_qos(exp, tmp_arr, &stripe_cnt, + lsm->lsm_pool_name, flags); + else + rc = alloc_specific(lov, lsm, tmp_arr); + + if (rc) + GOTO(out_arr, rc); + + *idx_arr = tmp_arr; + RETURN(stripe_cnt); +out_arr: + OBD_FREE(tmp_arr, *arr_cnt * sizeof(int)); + *arr_cnt = 0; + RETURN(rc); +} + +static void free_idx_array(int *idx_arr, int arr_cnt) +{ + if (arr_cnt) + OBD_FREE(idx_arr, arr_cnt * sizeof(int)); +} + +int qos_prep_create(struct obd_export *exp, struct lov_request_set *set) +{ + struct lov_obd *lov = &exp->exp_obd->u.lov; + struct lov_stripe_md *lsm; + struct obdo *src_oa = set->set_oi->oi_oa; + struct obd_trans_info *oti = set->set_oti; + int i, stripes, rc = 0, newea = 0; + int flag = LOV_USES_ASSIGNED_STRIPE; + int *idx_arr = NULL, idx_cnt = 0; ENTRY; LASSERT(src_oa->o_valid & OBD_MD_FLID); - + LASSERT(src_oa->o_valid & OBD_MD_FLGROUP); + + if (set->set_oi->oi_md == NULL) { + int stripes_def = lov_get_stripecnt(lov, 0); + + /* If the MDS file was truncated up to some size, stripe over + * enough OSTs to allow the file to be created at that size. + * This may mean we use more than the default # of stripes. */ + if (src_oa->o_valid & OBD_MD_FLSIZE) { + obd_size min_bavail = LUSTRE_STRIPE_MAXBYTES; + + /* Find a small number of stripes we can use + (up to # of active osts). */ + stripes = 1; + for (i = 0; i < lov->desc.ld_tgt_count; i++) { + if (!lov->lov_tgts[i] || + !lov->lov_tgts[i]->ltd_active) + continue; + min_bavail = min(min_bavail, TGT_BAVAIL(i)); + if (min_bavail * stripes > src_oa->o_size) + break; + stripes++; + } + + if (stripes < stripes_def) + stripes = stripes_def; + } else { + flag = LOV_USES_DEFAULT_STRIPE; + stripes = stripes_def; + } + + rc = lov_alloc_memmd(&set->set_oi->oi_md, stripes, + lov->desc.ld_pattern ? + lov->desc.ld_pattern : LOV_PATTERN_RAID0, + LOV_MAGIC); + if (rc < 0) + GOTO(out_err, rc); + newea = 1; + rc = 0; + } + + lsm = set->set_oi->oi_md; lsm->lsm_object_id = src_oa->o_id; - lsm->lsm_object_gr = src_oa->o_gr; + lsm->lsm_object_seq = src_oa->o_seq; + if (!lsm->lsm_stripe_size) lsm->lsm_stripe_size = lov->desc.ld_default_stripe_size; if (!lsm->lsm_pattern) { - lsm->lsm_pattern = lov->desc.ld_pattern ? - lov->desc.ld_pattern : LOV_PATTERN_RAID0; - } - - if (newea || lsm->lsm_oinfo[0].loi_ost_idx >= ost_count) { - if (--ost_start_count <= 0) { - ost_start_idx = ll_insecure_random_int(); - ost_start_count = LOV_CREATE_RESEED_INTERVAL; - } else if (lsm->lsm_stripe_count >= - lov->desc.ld_active_tgt_count) { - /* If we allocate from all of the stripes, make the - * next file start on the next OST. */ - ++ost_start_idx; - } - ost_idx = ost_start_idx % ost_count; - } else { - ost_idx = lsm->lsm_oinfo[0].loi_ost_idx; + LASSERT(lov->desc.ld_pattern); + lsm->lsm_pattern = lov->desc.ld_pattern; } - CDEBUG(D_INODE, "allocating %d subobjs for objid "LPX64" at idx %d\n", - lsm->lsm_stripe_count, lsm->lsm_object_id, ost_idx); + stripes = alloc_idx_array(exp, lsm, newea, &idx_arr, &idx_cnt, flag); + if (stripes <= 0) + GOTO(out_err, rc = stripes ? stripes : -EIO); + LASSERTF(stripes <= lsm->lsm_stripe_count,"requested %d allocated %d\n", + lsm->lsm_stripe_count, stripes); - for (i = 0; i < ost_count; i++, ost_idx = (ost_idx + 1) % ost_count) { + for (i = 0; i < stripes; i++) { struct lov_request *req; - - ++ost_start_idx; - if (lov->tgts[ost_idx].active == 0) { - CDEBUG(D_HA, "lov idx %d inactive\n", ost_idx); - continue; - } + int ost_idx = idx_arr[i]; + LASSERT(ost_idx >= 0); OBD_ALLOC(req, sizeof(*req)); if (req == NULL) - GOTO(out, rc = -ENOMEM); - - req->rq_buflen = sizeof(*req->rq_md); - OBD_ALLOC(req->rq_md, req->rq_buflen); - if (req->rq_md == NULL) - GOTO(out, rc = -ENOMEM); - - req->rq_oa = obdo_alloc(); - if (req->rq_oa == NULL) - GOTO(out, rc = -ENOMEM); - + GOTO(out_err, rc = -ENOMEM); + lov_set_add_req(req, set); + + req->rq_buflen = sizeof(*req->rq_oi.oi_md); + OBD_ALLOC(req->rq_oi.oi_md, req->rq_buflen); + if (req->rq_oi.oi_md == NULL) + GOTO(out_err, rc = -ENOMEM); + + OBDO_ALLOC(req->rq_oi.oi_oa); + if (req->rq_oi.oi_oa == NULL) + GOTO(out_err, rc = -ENOMEM); + req->rq_idx = ost_idx; req->rq_stripe = i; /* create data objects with "parent" OA */ - memcpy(req->rq_oa, src_oa, sizeof(*req->rq_oa)); + memcpy(req->rq_oi.oi_oa, src_oa, sizeof(*req->rq_oi.oi_oa)); + req->rq_oi.oi_cb_up = cb_create_update; /* XXX When we start creating objects on demand, we need to * make sure that we always create the object on the * stripe which holds the existing file size. */ if (src_oa->o_valid & OBD_MD_FLSIZE) { - if (lov_stripe_offset(lsm, src_oa->o_size, i, - &req->rq_oa->o_size) < 0 && - req->rq_oa->o_size) - req->rq_oa->o_size--; + req->rq_oi.oi_oa->o_size = + lov_size_to_stripe(lsm, src_oa->o_size, i); CDEBUG(D_INODE, "stripe %d has size "LPU64"/"LPU64"\n", - i, req->rq_oa->o_size, src_oa->o_size); + i, req->rq_oi.oi_oa->o_size, src_oa->o_size); } + } + LASSERT(set->set_count == stripes); - lov_set_add_req(req, set); + if (stripes < lsm->lsm_stripe_count) + qos_shrink_lsm(set); + if (OBD_FAIL_CHECK(OBD_FAIL_MDS_LOV_PREP_CREATE)) { + qos_shrink_lsm(set); + rc = -EIO; + } - /* If we have allocated enough objects, we are OK */ - if (set->set_count == lsm->lsm_stripe_count) - GOTO(out, rc = 0); + if (oti && (src_oa->o_valid & OBD_MD_FLCOOKIE)) { + oti_alloc_cookies(oti, set->set_count); + if (!oti->oti_logcookies) + GOTO(out_err, rc = -ENOMEM); + set->set_cookies = oti->oti_logcookies; } - - if (set->set_count == 0) - GOTO(out, rc = -EIO); - - /* If we were passed specific striping params, then a failure to - * meet those requirements is an error, since we can't reallocate - * that memory (it might be part of a larger array or something). - * - * We can only get here if lsm_stripe_count was originally > 1. - */ - if (!newea) { - CERROR("can't lstripe objid "LPX64": have %u want %u, rc %d\n", - lsm->lsm_object_id, set->set_count, - lsm->lsm_stripe_count, rc); - rc = rc ? rc : -EFBIG; - } else { - qos_shrink_lsm(set); - rc = 0; +out_err: + if (newea && rc) + obd_free_memmd(exp, &set->set_oi->oi_md); + if (idx_arr) + free_idx_array(idx_arr, idx_cnt); + EXIT; + return rc; +} + +void qos_update(struct lov_obd *lov) +{ + ENTRY; + lov->lov_qos.lq_dirty = 1; +} + +void qos_statfs_done(struct lov_obd *lov) +{ + LASSERT(lov->lov_qos.lq_statfs_in_progress); + cfs_down_write(&lov->lov_qos.lq_rw_sem); + lov->lov_qos.lq_statfs_in_progress = 0; + /* wake up any threads waiting for the statfs rpcs to complete */ + cfs_waitq_signal(&lov->lov_qos.lq_statfs_waitq); + cfs_up_write(&lov->lov_qos.lq_rw_sem); +} + +static int qos_statfs_ready(struct obd_device *obd, __u64 max_age) +{ + struct lov_obd *lov = &obd->u.lov; + int rc; + ENTRY; + cfs_down_read(&lov->lov_qos.lq_rw_sem); + rc = lov->lov_qos.lq_statfs_in_progress == 0 || + cfs_time_beforeq_64(max_age, obd->obd_osfs_age); + cfs_up_read(&lov->lov_qos.lq_rw_sem); + RETURN(rc); +} + +/* + * Update statfs data if the current osfs age is older than max_age. + * If wait is not set, it means that we are called from lov_create() + * and we should just issue the rpcs without waiting for them to complete. + * If wait is set, we are called from alloc_qos() and we just have + * to wait for the request set to complete. + */ +void qos_statfs_update(struct obd_device *obd, __u64 max_age, int wait) +{ + struct lov_obd *lov = &obd->u.lov; + struct obd_info *oinfo; + int rc = 0; + struct ptlrpc_request_set *set = NULL; + ENTRY; + + if (cfs_time_beforeq_64(max_age, obd->obd_osfs_age)) + /* statfs data are quite recent, don't need to refresh it */ + RETURN_EXIT; + + if (!wait && lov->lov_qos.lq_statfs_in_progress) + /* statfs already in progress */ + RETURN_EXIT; + + cfs_down_write(&lov->lov_qos.lq_rw_sem); + if (lov->lov_qos.lq_statfs_in_progress) { + cfs_up_write(&lov->lov_qos.lq_rw_sem); + GOTO(out, rc = 0); + } + /* no statfs in flight, send rpcs */ + lov->lov_qos.lq_statfs_in_progress = 1; + cfs_up_write(&lov->lov_qos.lq_rw_sem); + + if (wait) + CDEBUG(D_QOS, "%s: did not manage to get fresh statfs data " + "in a timely manner (osfs age "LPU64", max age "LPU64")" + ", sending new statfs rpcs\n", + obd_uuid2str(&lov->desc.ld_uuid), obd->obd_osfs_age, + max_age); + + /* need to send statfs rpcs */ + CDEBUG(D_QOS, "sending new statfs requests\n"); + memset(lov->lov_qos.lq_statfs_data, 0, + sizeof(*lov->lov_qos.lq_statfs_data)); + oinfo = &lov->lov_qos.lq_statfs_data->lsd_oi; + oinfo->oi_osfs = &lov->lov_qos.lq_statfs_data->lsd_statfs; + oinfo->oi_flags = OBD_STATFS_NODELAY; + set = ptlrpc_prep_set(); + if (!set) + GOTO(out_failed, rc = -ENOMEM); + + rc = obd_statfs_async(obd, oinfo, max_age, set); + if (rc || cfs_list_empty(&set->set_requests)) { + if (rc) + CWARN("statfs failed with %d\n", rc); + GOTO(out_failed, rc); } + /* send requests via ptlrpcd */ + oinfo->oi_flags |= OBD_STATFS_PTLRPCD; + ptlrpcd_add_rqset(set); + GOTO(out, rc); + +out_failed: + cfs_down_write(&lov->lov_qos.lq_rw_sem); + lov->lov_qos.lq_statfs_in_progress = 0; + /* wake up any threads waiting for the statfs rpcs to complete */ + cfs_waitq_signal(&lov->lov_qos.lq_statfs_waitq); + cfs_up_write(&lov->lov_qos.lq_rw_sem); + wait = 0; out: - RETURN(rc); + if (set) + ptlrpc_set_destroy(set); + if (wait) { + struct l_wait_info lwi = { 0 }; + CDEBUG(D_QOS, "waiting for statfs requests to complete\n"); + l_wait_event(lov->lov_qos.lq_statfs_waitq, + qos_statfs_ready(obd, max_age), &lwi); + if (cfs_time_before_64(obd->obd_osfs_age, max_age)) + CDEBUG(D_QOS, "%s: still no fresh statfs data after " + "waiting (osfs age "LPU64", max age " + LPU64")\n", + obd_uuid2str(&lov->desc.ld_uuid), + obd->obd_osfs_age, max_age); + } }