*
*/
-#define DEBUG_SUBSYSTEM S_CLASS
+#define DEBUG_SUBSYSTEM S_LOV
#include <linux/module.h>
#include <linux/list.h>
+#include <linux/random.h>
#include <libcfs/libcfs.h>
-#include <libcfs/libcfs_hash.h> /* hash_long() */
#include <libcfs/linux/linux-mem.h>
#include <obd_class.h>
#include <obd_support.h>
#include <lu_object.h>
/**
+ * lu_prandom_u64_max - returns a pseudo-random u64 number in interval
+ * [0, ep_ro)
+ *
+ * \param[in] ep_ro right open interval endpoint
+ *
+ * \retval a pseudo-random 64-bit number that is in interval [0, ep_ro).
+ */
+u64 lu_prandom_u64_max(u64 ep_ro)
+{
+ u64 rand = 0;
+
+ if (ep_ro) {
+#ifdef HAVE_GET_RANDOM_U32_AND_U64
+ rand = get_random_u64() % ep_ro;
+#elif BITS_PER_LONG == 32
+ /*
+ * If ep_ro > 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 (ep_ro > 0xffffffffULL)
+ rand = (u64)get_random_u32_below((u32)(ep_ro >> 32)) << 32;
+
+ if (rand == (ep_ro & 0xffffffff00000000ULL))
+ rand |= get_random_u32_below((u32)ep_ro);
+ else
+ rand |= get_random_u32();
+#else
+ rand = ((u64)get_random_u32() << 32 | get_random_u32()) % ep_ro;
+#endif
+ }
+
+ return rand;
+}
+EXPORT_SYMBOL(lu_prandom_u64_max);
+
+/**
+ * Add a new target to Quality of Service (QoS) target table.
+ *
+ * Add a new MDT/OST target to the structure representing an OSS. Resort the
+ * list of known MDSs/OSSs by the number of MDTs/OSTs attached to each MDS/OSS.
+ * The MDS/OSS list is protected internally and no external locking is required.
+ *
+ * \param[in] qos lu_qos data
+ * \param[in] tgt target description
+ *
+ * \retval 0 on success
+ * \retval -ENOMEM on error
+ */
+int lu_qos_add_tgt(struct lu_qos *qos, struct lu_tgt_desc *tgt)
+{
+ struct lu_svr_qos *svr = NULL;
+ struct lu_svr_qos *tempsvr;
+ struct obd_export *exp = tgt->ltd_exp;
+ int found = 0;
+ __u32 id = 0;
+ int rc = 0;
+
+ ENTRY;
+
+ down_write(&qos->lq_rw_sem);
+ /*
+ * a bit hacky approach to learn NID of corresponding connection
+ * but there is no official API to access information like this
+ * with OSD API.
+ */
+ list_for_each_entry(svr, &qos->lq_svr_list, lsq_svr_list) {
+ if (obd_uuid_equals(&svr->lsq_uuid,
+ &exp->exp_connection->c_remote_uuid)) {
+ found++;
+ break;
+ }
+ if (svr->lsq_id > id)
+ id = svr->lsq_id;
+ }
+
+ if (!found) {
+ OBD_ALLOC_PTR(svr);
+ if (!svr)
+ GOTO(out, rc = -ENOMEM);
+ memcpy(&svr->lsq_uuid, &exp->exp_connection->c_remote_uuid,
+ sizeof(svr->lsq_uuid));
+ ++id;
+ svr->lsq_id = id;
+ } else {
+ /* Assume we have to move this one */
+ list_del(&svr->lsq_svr_list);
+ }
+
+ svr->lsq_tgt_count++;
+ tgt->ltd_qos.ltq_svr = svr;
+
+ CDEBUG(D_OTHER, "add tgt %s to server %s (%d targets)\n",
+ obd_uuid2str(&tgt->ltd_uuid), obd_uuid2str(&svr->lsq_uuid),
+ svr->lsq_tgt_count);
+
+ /*
+ * Add sorted by # of tgts. Find the first entry that we're
+ * bigger than...
+ */
+ list_for_each_entry(tempsvr, &qos->lq_svr_list, lsq_svr_list) {
+ if (svr->lsq_tgt_count > tempsvr->lsq_tgt_count)
+ break;
+ }
+ /*
+ * ...and add before it. If we're the first or smallest, tempsvr
+ * points to the list head, and we add to the end.
+ */
+ list_add_tail(&svr->lsq_svr_list, &tempsvr->lsq_svr_list);
+
+ set_bit(LQ_DIRTY, &qos->lq_flags);
+#ifdef HAVE_SERVER_SUPPORT
+ set_bit(LQ_DIRTY, &qos->lq_rr.lqr_flags);
+#endif
+out:
+ up_write(&qos->lq_rw_sem);
+ RETURN(rc);
+}
+EXPORT_SYMBOL(lu_qos_add_tgt);
+
+/**
+ * Remove MDT/OST target from QoS table.
+ *
+ * Removes given MDT/OST target from QoS table and releases related
+ * MDS/OSS structure if no target remain on the MDS/OSS.
+ *
+ * \param[in] qos lu_qos data
+ * \param[in] ltd target description
+ *
+ * \retval 0 on success
+ * \retval -ENOENT if no server was found
+ */
+int lu_qos_del_tgt(struct lu_qos *qos, struct lu_tgt_desc *ltd)
+{
+ struct lu_svr_qos *svr;
+ int rc = 0;
+
+ ENTRY;
+
+ down_write(&qos->lq_rw_sem);
+ svr = ltd->ltd_qos.ltq_svr;
+ if (!svr)
+ GOTO(out, rc = -ENOENT);
+
+ ltd->ltd_qos.ltq_svr = NULL;
+ svr->lsq_tgt_count--;
+ if (svr->lsq_tgt_count == 0) {
+ CDEBUG(D_OTHER, "removing server %s\n",
+ obd_uuid2str(&svr->lsq_uuid));
+ list_del(&svr->lsq_svr_list);
+ OBD_FREE_PTR(svr);
+ }
+
+ set_bit(LQ_DIRTY, &qos->lq_flags);
+#ifdef HAVE_SERVER_SUPPORT
+ set_bit(LQ_DIRTY, &qos->lq_rr.lqr_flags);
+#endif
+out:
+ up_write(&qos->lq_rw_sem);
+ RETURN(rc);
+}
+EXPORT_SYMBOL(lu_qos_del_tgt);
+
+/**
+ * Calculate weight for a given tgt.
+ *
+ * The final tgt weight uses only free space for OSTs, but combines
+ * both free space and inodes for MDTs, minus tgt and server penalties.
+ * See ltd_qos_penalties_calc() for how penalties are calculated.
+ *
+ * \param[in] tgt target descriptor
+ * \param[in] is_mdt target table is for MDT selection (use inodes)
+ */
+void lu_tgt_qos_weight_calc(struct lu_tgt_desc *tgt, bool is_mdt)
+{
+ struct lu_tgt_qos *ltq = &tgt->ltd_qos;
+ __u64 penalty;
+
+ if (is_mdt)
+ ltq->ltq_avail = (tgt_statfs_bavail(tgt) >> 16) *
+ (tgt_statfs_iavail(tgt) >> 8);
+ else
+ ltq->ltq_avail = tgt_statfs_bavail(tgt) >> 8;
+ penalty = ltq->ltq_penalty + ltq->ltq_svr->lsq_penalty;
+ CDEBUG(D_OTHER, "ltq_penalty: %llu lsq_penalty: %llu tgt_bavail: %llu\n",
+ ltq->ltq_penalty, ltq->ltq_svr->lsq_penalty, ltq->ltq_avail);
+ if (ltq->ltq_avail < penalty)
+ ltq->ltq_weight = 0;
+ else
+ ltq->ltq_weight = ltq->ltq_avail - penalty;
+}
+EXPORT_SYMBOL(lu_tgt_qos_weight_calc);
+
+/**
* Allocate and initialize target table.
*
* A helper function to initialize the target table and allocate
* a bitmap of the available targets.
*
* \param[in] ltd target's table to initialize
+ * \param[in] is_mdt target table for MDTs
*
* \retval 0 on success
* \retval negative negated errno on error
**/
-int lu_tgt_descs_init(struct lu_tgt_descs *ltd)
+int lu_tgt_descs_init(struct lu_tgt_descs *ltd, bool is_mdt)
{
mutex_init(<d->ltd_mutex);
init_rwsem(<d->ltd_rw_sem);
* the tgt array and bitmap are allocated/grown dynamically as tgts are
* added to the LOD/LMV, see lu_tgt_descs_add()
*/
- ltd->ltd_tgt_bitmap = CFS_ALLOCATE_BITMAP(BITS_PER_LONG);
+ ltd->ltd_tgt_bitmap = bitmap_zalloc(BITS_PER_LONG, GFP_NOFS);
if (!ltd->ltd_tgt_bitmap)
return -ENOMEM;
ltd->ltd_tgts_size = BITS_PER_LONG;
- ltd->ltd_tgtnr = 0;
-
ltd->ltd_death_row = 0;
ltd->ltd_refcount = 0;
+ /* Set up allocation policy (QoS and RR) */
+ INIT_LIST_HEAD(<d->ltd_qos.lq_svr_list);
+ init_rwsem(<d->ltd_qos.lq_rw_sem);
+ set_bit(LQ_DIRTY, <d->ltd_qos.lq_flags);
+ set_bit(LQ_RESET, <d->ltd_qos.lq_flags);
+ ltd->ltd_is_mdt = is_mdt;
+ /* MDT imbalance threshold is low to balance across MDTs
+ * relatively quickly, because each directory may result
+ * in a large number of files/subdirs created therein.
+ */
+ if (is_mdt) {
+ ltd->ltd_lmv_desc.ld_pattern = LMV_HASH_TYPE_DEFAULT;
+ ltd->ltd_qos.lq_prio_free = LMV_QOS_DEF_PRIO_FREE * 256 / 100;
+ ltd->ltd_qos.lq_threshold_rr =
+ LMV_QOS_DEF_THRESHOLD_RR_PCT *
+ QOS_THRESHOLD_MAX / 100;
+ } else {
+ ltd->ltd_qos.lq_prio_free = LOV_QOS_DEF_PRIO_FREE * 256 / 100;
+ ltd->ltd_qos.lq_threshold_rr =
+ LOV_QOS_DEF_THRESHOLD_RR_PCT *
+ QOS_THRESHOLD_MAX / 100;
+ }
+
return 0;
}
EXPORT_SYMBOL(lu_tgt_descs_init);
{
int i;
- CFS_FREE_BITMAP(ltd->ltd_tgt_bitmap);
- for (i = 0; i < TGT_PTRS; i++) {
+ bitmap_free(ltd->ltd_tgt_bitmap);
+ for (i = 0; i < ARRAY_SIZE(ltd->ltd_tgt_idx); i++) {
if (ltd->ltd_tgt_idx[i])
OBD_FREE_PTR(ltd->ltd_tgt_idx[i]);
}
*/
static int lu_tgt_descs_resize(struct lu_tgt_descs *ltd, __u32 newsize)
{
- struct cfs_bitmap *new_bitmap, *old_bitmap = NULL;
+ unsigned long *new_bitmap, *old_bitmap = NULL;
/* someone else has already resize the array */
if (newsize <= ltd->ltd_tgts_size)
return 0;
- new_bitmap = CFS_ALLOCATE_BITMAP(newsize);
+ new_bitmap = bitmap_zalloc(newsize, GFP_NOFS);
if (!new_bitmap)
return -ENOMEM;
if (ltd->ltd_tgts_size > 0) {
/* the bitmap already exists, copy data from old one */
- cfs_bitmap_copy(new_bitmap, ltd->ltd_tgt_bitmap);
+ bitmap_copy(new_bitmap, ltd->ltd_tgt_bitmap,
+ ltd->ltd_tgts_size);
old_bitmap = ltd->ltd_tgt_bitmap;
}
ltd->ltd_tgts_size = newsize;
ltd->ltd_tgt_bitmap = new_bitmap;
- if (old_bitmap)
- CFS_FREE_BITMAP(old_bitmap);
+ bitmap_free(old_bitmap);
CDEBUG(D_CONFIG, "tgt size: %d\n", ltd->ltd_tgts_size);
* \retval -ENOMEM if reallocation failed
* -EEXIST if target existed
*/
-int lu_tgt_descs_add(struct lu_tgt_descs *ltd, struct lu_tgt_desc *tgt)
+int ltd_add_tgt(struct lu_tgt_descs *ltd, struct lu_tgt_desc *tgt)
{
__u32 index = tgt->ltd_index;
int rc;
if (index >= ltd->ltd_tgts_size) {
__u32 newsize = 1;
+ if (index > TGT_PTRS * TGT_PTRS_PER_BLOCK)
+ RETURN(-ENFILE);
+
while (newsize < index + 1)
newsize = newsize << 1;
rc = lu_tgt_descs_resize(ltd, newsize);
if (rc)
RETURN(rc);
- } else if (cfs_bitmap_check(ltd->ltd_tgt_bitmap, index)) {
+ } else if (test_bit(index, ltd->ltd_tgt_bitmap)) {
RETURN(-EEXIST);
}
}
LTD_TGT(ltd, tgt->ltd_index) = tgt;
- cfs_bitmap_set(ltd->ltd_tgt_bitmap, tgt->ltd_index);
- ltd->ltd_tgtnr++;
+ set_bit(tgt->ltd_index, ltd->ltd_tgt_bitmap);
+
+ ltd->ltd_lov_desc.ld_tgt_count++;
+ if (tgt->ltd_active)
+ ltd->ltd_lov_desc.ld_active_tgt_count++;
RETURN(0);
}
-EXPORT_SYMBOL(lu_tgt_descs_add);
+EXPORT_SYMBOL(ltd_add_tgt);
/**
* Delete target from target table
*/
-void lu_tgt_descs_del(struct lu_tgt_descs *ltd, struct lu_tgt_desc *tgt)
+void ltd_del_tgt(struct lu_tgt_descs *ltd, struct lu_tgt_desc *tgt)
{
+ lu_qos_del_tgt(<d->ltd_qos, tgt);
LTD_TGT(ltd, tgt->ltd_index) = NULL;
- cfs_bitmap_clear(ltd->ltd_tgt_bitmap, tgt->ltd_index);
- ltd->ltd_tgtnr--;
+ clear_bit(tgt->ltd_index, ltd->ltd_tgt_bitmap);
+ ltd->ltd_lov_desc.ld_tgt_count--;
+ if (tgt->ltd_active)
+ ltd->ltd_lov_desc.ld_active_tgt_count--;
+}
+EXPORT_SYMBOL(ltd_del_tgt);
+
+/**
+ * Calculate penalties per-tgt and per-server
+ *
+ * Re-calculate penalties when the configuration changes, active targets
+ * change and after statfs refresh (all these are reflected by LQ_DIRTY flag).
+ * On every tgt and server: 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 server/tgt under light load.
+ * See lu_qos_tgt_weight_calc() for how penalties are factored into the weight.
+ *
+ * \param[in] ltd lu_tgt_descs
+ *
+ * \retval 0 on success
+ * \retval -EAGAIN the number of tgt isn't enough or all tgt spaces are
+ * almost the same
+ */
+int ltd_qos_penalties_calc(struct lu_tgt_descs *ltd)
+{
+ struct lu_qos *qos = <d->ltd_qos;
+ struct lov_desc *desc = <d->ltd_lov_desc;
+ struct lu_tgt_desc *tgt;
+ struct lu_svr_qos *svr;
+ __u64 ba_max, ba_min, ba;
+ __u64 ia_max, ia_min, ia = 1;
+ __u32 num_active;
+ int prio_wide;
+ time64_t now, age;
+ int rc;
+
+ ENTRY;
+
+ if (!test_bit(LQ_DIRTY, &qos->lq_flags))
+ GOTO(out, rc = 0);
+
+ num_active = desc->ld_active_tgt_count - 1;
+ if (num_active < 1)
+ GOTO(out, rc = -EAGAIN);
+
+ /* find bavail on each server */
+ list_for_each_entry(svr, &qos->lq_svr_list, lsq_svr_list) {
+ svr->lsq_bavail = 0;
+ /* if inode is not counted, set to 1 to ignore */
+ svr->lsq_iavail = ltd->ltd_is_mdt ? 0 : 1;
+ }
+ qos->lq_active_svr_count = 0;
+
+ /*
+ * How badly user wants to select targets "widely" (not recently chosen
+ * and not on recent MDS's). As opposed to "freely" (free space avail.)
+ * 0-256
+ */
+ prio_wide = 256 - qos->lq_prio_free;
+
+ ba_min = (__u64)(-1);
+ ba_max = 0;
+ ia_min = (__u64)(-1);
+ ia_max = 0;
+ now = ktime_get_real_seconds();
+
+ /* Calculate server penalty per object */
+ ltd_foreach_tgt(ltd, tgt) {
+ if (!tgt->ltd_active)
+ continue;
+
+ /* when inode is counted, bavail >> 16 to avoid overflow */
+ ba = tgt_statfs_bavail(tgt);
+ if (ltd->ltd_is_mdt)
+ ba >>= 16;
+ else
+ ba >>= 8;
+ if (!ba)
+ continue;
+
+ ba_min = min(ba, ba_min);
+ ba_max = max(ba, ba_max);
+
+ /* Count the number of usable servers */
+ if (tgt->ltd_qos.ltq_svr->lsq_bavail == 0)
+ qos->lq_active_svr_count++;
+ tgt->ltd_qos.ltq_svr->lsq_bavail += ba;
+
+ if (ltd->ltd_is_mdt) {
+ /* iavail >> 8 to avoid overflow */
+ ia = tgt_statfs_iavail(tgt) >> 8;
+ if (!ia)
+ continue;
+
+ ia_min = min(ia, ia_min);
+ ia_max = max(ia, ia_max);
+
+ tgt->ltd_qos.ltq_svr->lsq_iavail += ia;
+ }
+
+ /*
+ * per-tgt penalty is
+ * prio * bavail * iavail / (num_tgt - 1) / prio_max / 2
+ */
+ tgt->ltd_qos.ltq_penalty_per_obj = prio_wide * ba * ia >> 9;
+ do_div(tgt->ltd_qos.ltq_penalty_per_obj, num_active);
+
+ age = (now - tgt->ltd_qos.ltq_used) >> 3;
+ if (test_bit(LQ_RESET, &qos->lq_flags) ||
+ age > 32 * desc->ld_qos_maxage)
+ tgt->ltd_qos.ltq_penalty = 0;
+ else if (age > desc->ld_qos_maxage)
+ /* Decay tgt penalty. */
+ tgt->ltd_qos.ltq_penalty >>= age / desc->ld_qos_maxage;
+ }
+
+ num_active = qos->lq_active_svr_count - 1;
+ if (num_active < 1) {
+ /*
+ * If there's only 1 server, we can't penalize it, so instead
+ * we have to double the tgt penalty
+ */
+ num_active = 1;
+ ltd_foreach_tgt(ltd, tgt) {
+ if (!tgt->ltd_active)
+ continue;
+
+ tgt->ltd_qos.ltq_penalty_per_obj <<= 1;
+ }
+ }
+
+ /*
+ * Per-server penalty is
+ * prio * bavail * iavail / server_tgts / (num_svr - 1) / 2
+ */
+ list_for_each_entry(svr, &qos->lq_svr_list, lsq_svr_list) {
+ ba = svr->lsq_bavail;
+ ia = svr->lsq_iavail;
+ svr->lsq_penalty_per_obj = prio_wide * ba * ia >> 8;
+ do_div(svr->lsq_penalty_per_obj,
+ svr->lsq_tgt_count * num_active);
+ svr->lsq_penalty_per_obj >>= 1;
+
+ age = (now - svr->lsq_used) >> 3;
+ if (test_bit(LQ_RESET, &qos->lq_flags) ||
+ age > 32 * desc->ld_qos_maxage)
+ svr->lsq_penalty = 0;
+ else if (age > desc->ld_qos_maxage)
+ /* Decay server penalty. */
+ svr->lsq_penalty >>= age / desc->ld_qos_maxage;
+ }
+
+
+ /*
+ * If each tgt has almost same free space, do rr allocation for better
+ * creation performance
+ */
+ if (((ba_max * (QOS_THRESHOLD_MAX - qos->lq_threshold_rr)) /
+ QOS_THRESHOLD_MAX) < ba_min &&
+ ((ia_max * (QOS_THRESHOLD_MAX - qos->lq_threshold_rr)) /
+ QOS_THRESHOLD_MAX) < ia_min) {
+ set_bit(LQ_SAME_SPACE, &qos->lq_flags);
+ /* Reset weights for the next time we enter qos mode */
+ set_bit(LQ_RESET, &qos->lq_flags);
+ } else {
+ clear_bit(LQ_SAME_SPACE, &qos->lq_flags);
+ clear_bit(LQ_RESET, &qos->lq_flags);
+ }
+ clear_bit(LQ_DIRTY, &qos->lq_flags);
+ rc = 0;
+
+out:
+ if (!rc && test_bit(LQ_SAME_SPACE, &qos->lq_flags))
+ RETURN(-EAGAIN);
+
+ RETURN(rc);
+}
+EXPORT_SYMBOL(ltd_qos_penalties_calc);
+
+/**
+ * Re-calculate penalties and weights of all tgts.
+ *
+ * The function is called when some target was used for a new object. In
+ * this case we should re-calculate all the weights to keep new allocations
+ * balanced well.
+ *
+ * \param[in] ltd lu_tgt_descs
+ * \param[in] tgt recently used tgt
+ * \param[out] total_wt new total weight for the pool
+ *
+ * \retval 0
+ */
+int ltd_qos_update(struct lu_tgt_descs *ltd, struct lu_tgt_desc *tgt,
+ __u64 *total_wt)
+{
+ struct lu_qos *qos = <d->ltd_qos;
+ struct lu_tgt_qos *ltq;
+ struct lu_svr_qos *svr;
+
+ ENTRY;
+
+ ltq = &tgt->ltd_qos;
+ LASSERT(ltq);
+
+ /* Don't allocate on this device anymore, until the next alloc_qos */
+ ltq->ltq_usable = 0;
+
+ svr = ltq->ltq_svr;
+
+ /*
+ * Decay old penalty by half (we're adding max penalty, and don't
+ * want it to run away.)
+ */
+ ltq->ltq_penalty >>= 1;
+ svr->lsq_penalty >>= 1;
+
+ /* mark the server and tgt as recently used */
+ ltq->ltq_used = svr->lsq_used = ktime_get_real_seconds();
+
+ /* Set max penalties for this tgt and server */
+ ltq->ltq_penalty += ltq->ltq_penalty_per_obj *
+ ltd->ltd_lov_desc.ld_active_tgt_count;
+ CDEBUG(D_OTHER, "ltq_penalty: %llu per_obj: %llu tgt_count: %d\n",
+ ltq->ltq_penalty, ltq->ltq_penalty_per_obj,
+ ltd->ltd_lov_desc.ld_active_tgt_count);
+ svr->lsq_penalty += svr->lsq_penalty_per_obj *
+ qos->lq_active_svr_count;
+ CDEBUG(D_OTHER, "lsq_penalty: %llu per_obj: %llu srv_count: %d\n",
+ svr->lsq_penalty, svr->lsq_penalty_per_obj,
+ qos->lq_active_svr_count);
+
+
+ /* Decrease all MDS penalties */
+ list_for_each_entry(svr, &qos->lq_svr_list, lsq_svr_list) {
+ if (svr->lsq_penalty < svr->lsq_penalty_per_obj)
+ svr->lsq_penalty = 0;
+ else
+ svr->lsq_penalty -= svr->lsq_penalty_per_obj;
+ }
+
+ *total_wt = 0;
+ /* Decrease all tgt penalties */
+ ltd_foreach_tgt(ltd, tgt) {
+ if (!tgt->ltd_active)
+ continue;
+
+ ltq = &tgt->ltd_qos;
+ if (ltq->ltq_penalty < ltq->ltq_penalty_per_obj)
+ ltq->ltq_penalty = 0;
+ else
+ ltq->ltq_penalty -= ltq->ltq_penalty_per_obj;
+
+ lu_tgt_qos_weight_calc(tgt, ltd->ltd_is_mdt);
+
+ /* Recalc the total weight of usable osts */
+ if (ltq->ltq_usable)
+ *total_wt += ltq->ltq_weight;
+
+ CDEBUG(D_OTHER, "recalc tgt %d usable=%d bavail=%llu ffree=%llu tgtppo=%llu tgtp=%llu svrppo=%llu svrp=%llu wt=%llu\n",
+ tgt->ltd_index, ltq->ltq_usable,
+ tgt_statfs_bavail(tgt) >> 16,
+ tgt_statfs_iavail(tgt) >> 8,
+ ltq->ltq_penalty_per_obj >> 10,
+ ltq->ltq_penalty >> 10,
+ ltq->ltq_svr->lsq_penalty_per_obj >> 10,
+ ltq->ltq_svr->lsq_penalty >> 10,
+ ltq->ltq_weight >> 10);
+ }
+
+ RETURN(0);
}
-EXPORT_SYMBOL(lu_tgt_descs_del);
+EXPORT_SYMBOL(ltd_qos_update);