4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.gnu.org/licenses/gpl-2.0.html
23 * This file is part of Lustre, http://www.lustre.org/
25 * lustre/obdclass/lu_tgt_descs.c
27 * Lustre target descriptions
28 * These are the only exported functions, they provide some generic
29 * infrastructure for target description management used by LOD/LMV
33 #define DEBUG_SUBSYSTEM S_CLASS
35 #include <linux/module.h>
36 #include <linux/list.h>
37 #include <linux/random.h>
38 #include <libcfs/libcfs.h>
39 #include <libcfs/libcfs_hash.h> /* hash_long() */
40 #include <libcfs/linux/linux-mem.h>
41 #include <obd_class.h>
42 #include <obd_support.h>
43 #include <lustre_disk.h>
44 #include <lustre_fid.h>
45 #include <lu_object.h>
48 * lu_prandom_u64_max - returns a pseudo-random u64 number in interval
51 * \param[in] ep_ro right open interval endpoint
53 * \retval a pseudo-random 64-bit number that is in interval [0, ep_ro).
55 u64 lu_prandom_u64_max(u64 ep_ro)
60 #if BITS_PER_LONG == 32
62 * If ep_ro > 32-bit, first generate the high
63 * 32 bits of the random number, then add in the low
64 * 32 bits (truncated to the upper limit, if needed)
66 if (ep_ro > 0xffffffffULL)
67 rand = (u64)prandom_u32_max((u32)(ep_ro >> 32)) << 32;
69 if (rand == (ep_ro & 0xffffffff00000000ULL))
70 rand |= prandom_u32_max((u32)ep_ro);
72 rand |= prandom_u32();
74 rand = ((u64)prandom_u32() << 32 | prandom_u32()) % ep_ro;
80 EXPORT_SYMBOL(lu_prandom_u64_max);
83 * Add a new target to Quality of Service (QoS) target table.
85 * Add a new MDT/OST target to the structure representing an OSS. Resort the
86 * list of known MDSs/OSSs by the number of MDTs/OSTs attached to each MDS/OSS.
87 * The MDS/OSS list is protected internally and no external locking is required.
89 * \param[in] qos lu_qos data
90 * \param[in] tgt target description
92 * \retval 0 on success
93 * \retval -ENOMEM on error
95 int lu_qos_add_tgt(struct lu_qos *qos, struct lu_tgt_desc *tgt)
97 struct lu_svr_qos *svr = NULL;
98 struct lu_svr_qos *tempsvr;
99 struct obd_export *exp = tgt->ltd_exp;
106 down_write(&qos->lq_rw_sem);
108 * a bit hacky approach to learn NID of corresponding connection
109 * but there is no official API to access information like this
112 list_for_each_entry(svr, &qos->lq_svr_list, lsq_svr_list) {
113 if (obd_uuid_equals(&svr->lsq_uuid,
114 &exp->exp_connection->c_remote_uuid)) {
118 if (svr->lsq_id > id)
125 GOTO(out, rc = -ENOMEM);
126 memcpy(&svr->lsq_uuid, &exp->exp_connection->c_remote_uuid,
127 sizeof(svr->lsq_uuid));
131 /* Assume we have to move this one */
132 list_del(&svr->lsq_svr_list);
135 svr->lsq_tgt_count++;
136 tgt->ltd_qos.ltq_svr = svr;
138 CDEBUG(D_OTHER, "add tgt %s to server %s (%d targets)\n",
139 obd_uuid2str(&tgt->ltd_uuid), obd_uuid2str(&svr->lsq_uuid),
143 * Add sorted by # of tgts. Find the first entry that we're
146 list_for_each_entry(tempsvr, &qos->lq_svr_list, lsq_svr_list) {
147 if (svr->lsq_tgt_count > tempsvr->lsq_tgt_count)
151 * ...and add before it. If we're the first or smallest, tempsvr
152 * points to the list head, and we add to the end.
154 list_add_tail(&svr->lsq_svr_list, &tempsvr->lsq_svr_list);
156 set_bit(LQ_DIRTY, &qos->lq_flags);
157 #ifdef HAVE_SERVER_SUPPORT
158 set_bit(LQ_DIRTY, &qos->lq_rr.lqr_flags);
161 up_write(&qos->lq_rw_sem);
164 EXPORT_SYMBOL(lu_qos_add_tgt);
167 * Remove MDT/OST target from QoS table.
169 * Removes given MDT/OST target from QoS table and releases related
170 * MDS/OSS structure if no target remain on the MDS/OSS.
172 * \param[in] qos lu_qos data
173 * \param[in] ltd target description
175 * \retval 0 on success
176 * \retval -ENOENT if no server was found
178 static int lu_qos_del_tgt(struct lu_qos *qos, struct lu_tgt_desc *ltd)
180 struct lu_svr_qos *svr;
185 down_write(&qos->lq_rw_sem);
186 svr = ltd->ltd_qos.ltq_svr;
188 GOTO(out, rc = -ENOENT);
190 svr->lsq_tgt_count--;
191 if (svr->lsq_tgt_count == 0) {
192 CDEBUG(D_OTHER, "removing server %s\n",
193 obd_uuid2str(&svr->lsq_uuid));
194 list_del(&svr->lsq_svr_list);
195 ltd->ltd_qos.ltq_svr = NULL;
199 set_bit(LQ_DIRTY, &qos->lq_flags);
200 #ifdef HAVE_SERVER_SUPPORT
201 set_bit(LQ_DIRTY, &qos->lq_rr.lqr_flags);
204 up_write(&qos->lq_rw_sem);
208 static inline __u64 tgt_statfs_bavail(struct lu_tgt_desc *tgt)
210 struct obd_statfs *statfs = &tgt->ltd_statfs;
212 return statfs->os_bavail * statfs->os_bsize;
215 static inline __u64 tgt_statfs_iavail(struct lu_tgt_desc *tgt)
217 return tgt->ltd_statfs.os_ffree;
221 * Calculate weight for a given tgt.
223 * The final tgt weight is bavail >> 16 * iavail >> 8 minus the tgt and server
224 * penalties. See ltd_qos_penalties_calc() for how penalties are calculated.
226 * \param[in] tgt target descriptor
228 void lu_tgt_qos_weight_calc(struct lu_tgt_desc *tgt)
230 struct lu_tgt_qos *ltq = &tgt->ltd_qos;
233 temp = (tgt_statfs_bavail(tgt) >> 16) * (tgt_statfs_iavail(tgt) >> 8);
234 temp2 = ltq->ltq_penalty + ltq->ltq_svr->lsq_penalty;
238 ltq->ltq_weight = temp - temp2;
240 EXPORT_SYMBOL(lu_tgt_qos_weight_calc);
243 * Allocate and initialize target table.
245 * A helper function to initialize the target table and allocate
246 * a bitmap of the available targets.
248 * \param[in] ltd target's table to initialize
249 * \param[in] is_mdt target table for MDTs
251 * \retval 0 on success
252 * \retval negative negated errno on error
254 int lu_tgt_descs_init(struct lu_tgt_descs *ltd, bool is_mdt)
256 mutex_init(<d->ltd_mutex);
257 init_rwsem(<d->ltd_rw_sem);
260 * the tgt array and bitmap are allocated/grown dynamically as tgts are
261 * added to the LOD/LMV, see lu_tgt_descs_add()
263 ltd->ltd_tgt_bitmap = bitmap_zalloc(BITS_PER_LONG, GFP_NOFS);
264 if (!ltd->ltd_tgt_bitmap)
267 ltd->ltd_tgts_size = BITS_PER_LONG;
268 ltd->ltd_death_row = 0;
269 ltd->ltd_refcount = 0;
271 /* Set up allocation policy (QoS and RR) */
272 INIT_LIST_HEAD(<d->ltd_qos.lq_svr_list);
273 init_rwsem(<d->ltd_qos.lq_rw_sem);
274 set_bit(LQ_DIRTY, <d->ltd_qos.lq_flags);
275 set_bit(LQ_RESET, <d->ltd_qos.lq_flags);
276 /* Default priority is toward free space balance */
277 ltd->ltd_qos.lq_prio_free = 232;
278 /* Default threshold for rr (roughly 17%) */
279 ltd->ltd_qos.lq_threshold_rr = 43;
280 ltd->ltd_is_mdt = is_mdt;
282 ltd->ltd_lmv_desc.ld_pattern = LMV_HASH_TYPE_DEFAULT;
286 EXPORT_SYMBOL(lu_tgt_descs_init);
289 * Free bitmap and target table pages.
291 * \param[in] ltd target table
293 void lu_tgt_descs_fini(struct lu_tgt_descs *ltd)
297 bitmap_free(ltd->ltd_tgt_bitmap);
298 for (i = 0; i < ARRAY_SIZE(ltd->ltd_tgt_idx); i++) {
299 if (ltd->ltd_tgt_idx[i])
300 OBD_FREE_PTR(ltd->ltd_tgt_idx[i]);
302 ltd->ltd_tgts_size = 0;
304 EXPORT_SYMBOL(lu_tgt_descs_fini);
307 * Expand size of target table.
309 * When the target table is full, we have to extend the table. To do so,
310 * we allocate new memory with some reserve, move data from the old table
311 * to the new one and release memory consumed by the old table.
313 * \param[in] ltd target table
314 * \param[in] newsize new size of the table
316 * \retval 0 on success
317 * \retval -ENOMEM if reallocation failed
319 static int lu_tgt_descs_resize(struct lu_tgt_descs *ltd, __u32 newsize)
321 unsigned long *new_bitmap, *old_bitmap = NULL;
323 /* someone else has already resize the array */
324 if (newsize <= ltd->ltd_tgts_size)
327 new_bitmap = bitmap_zalloc(newsize, GFP_NOFS);
331 if (ltd->ltd_tgts_size > 0) {
332 /* the bitmap already exists, copy data from old one */
333 bitmap_copy(new_bitmap, ltd->ltd_tgt_bitmap,
335 old_bitmap = ltd->ltd_tgt_bitmap;
338 ltd->ltd_tgts_size = newsize;
339 ltd->ltd_tgt_bitmap = new_bitmap;
341 bitmap_free(old_bitmap);
343 CDEBUG(D_CONFIG, "tgt size: %d\n", ltd->ltd_tgts_size);
349 * Add new target to target table.
351 * Extend target table if it's full, update target table and bitmap.
352 * Notice we need to take ltd_rw_sem exclusively before entry to ensure
355 * \param[in] ltd target table
356 * \param[in] tgt new target desc
358 * \retval 0 on success
359 * \retval -ENOMEM if reallocation failed
360 * -EEXIST if target existed
362 int ltd_add_tgt(struct lu_tgt_descs *ltd, struct lu_tgt_desc *tgt)
364 __u32 index = tgt->ltd_index;
369 if (index >= ltd->ltd_tgts_size) {
372 if (index > TGT_PTRS * TGT_PTRS_PER_BLOCK)
375 while (newsize < index + 1)
376 newsize = newsize << 1;
378 rc = lu_tgt_descs_resize(ltd, newsize);
381 } else if (test_bit(index, ltd->ltd_tgt_bitmap)) {
385 if (ltd->ltd_tgt_idx[index / TGT_PTRS_PER_BLOCK] == NULL) {
386 OBD_ALLOC_PTR(ltd->ltd_tgt_idx[index / TGT_PTRS_PER_BLOCK]);
387 if (ltd->ltd_tgt_idx[index / TGT_PTRS_PER_BLOCK] == NULL)
391 LTD_TGT(ltd, tgt->ltd_index) = tgt;
392 set_bit(tgt->ltd_index, ltd->ltd_tgt_bitmap);
394 ltd->ltd_lov_desc.ld_tgt_count++;
396 ltd->ltd_lov_desc.ld_active_tgt_count++;
400 EXPORT_SYMBOL(ltd_add_tgt);
403 * Delete target from target table
405 void ltd_del_tgt(struct lu_tgt_descs *ltd, struct lu_tgt_desc *tgt)
407 lu_qos_del_tgt(<d->ltd_qos, tgt);
408 LTD_TGT(ltd, tgt->ltd_index) = NULL;
409 clear_bit(tgt->ltd_index, ltd->ltd_tgt_bitmap);
410 ltd->ltd_lov_desc.ld_tgt_count--;
412 ltd->ltd_lov_desc.ld_active_tgt_count--;
414 EXPORT_SYMBOL(ltd_del_tgt);
417 * Calculate penalties per-tgt and per-server
419 * Re-calculate penalties when the configuration changes, active targets
420 * change and after statfs refresh (all these are reflected by lq_dirty flag).
421 * On every tgt and server: decay the penalty by half for every 8x the update
422 * interval that the device has been idle. That gives lots of time for the
423 * statfs information to be updated (which the penalty is only a proxy for),
424 * and avoids penalizing server/tgt under light load.
425 * See lu_qos_tgt_weight_calc() for how penalties are factored into the weight.
427 * \param[in] ltd lu_tgt_descs
429 * \retval 0 on success
430 * \retval -EAGAIN the number of tgt isn't enough or all tgt spaces are
433 int ltd_qos_penalties_calc(struct lu_tgt_descs *ltd)
435 struct lu_qos *qos = <d->ltd_qos;
436 struct lov_desc *desc = <d->ltd_lov_desc;
437 struct lu_tgt_desc *tgt;
438 struct lu_svr_qos *svr;
439 __u64 ba_max, ba_min, ba;
440 __u64 ia_max, ia_min, ia = 1;
448 if (!test_bit(LQ_DIRTY, &qos->lq_flags))
451 num_active = desc->ld_active_tgt_count - 1;
453 GOTO(out, rc = -EAGAIN);
455 /* find bavail on each server */
456 list_for_each_entry(svr, &qos->lq_svr_list, lsq_svr_list) {
458 /* if inode is not counted, set to 1 to ignore */
459 svr->lsq_iavail = ltd->ltd_is_mdt ? 0 : 1;
461 qos->lq_active_svr_count = 0;
464 * How badly user wants to select targets "widely" (not recently chosen
465 * and not on recent MDS's). As opposed to "freely" (free space avail.)
468 prio_wide = 256 - qos->lq_prio_free;
470 ba_min = (__u64)(-1);
472 ia_min = (__u64)(-1);
474 now = ktime_get_real_seconds();
476 /* Calculate server penalty per object */
477 ltd_foreach_tgt(ltd, tgt) {
478 if (!tgt->ltd_active)
481 /* when inode is counted, bavail >> 16 to avoid overflow */
482 ba = tgt_statfs_bavail(tgt);
490 ba_min = min(ba, ba_min);
491 ba_max = max(ba, ba_max);
493 /* Count the number of usable servers */
494 if (tgt->ltd_qos.ltq_svr->lsq_bavail == 0)
495 qos->lq_active_svr_count++;
496 tgt->ltd_qos.ltq_svr->lsq_bavail += ba;
498 if (ltd->ltd_is_mdt) {
499 /* iavail >> 8 to avoid overflow */
500 ia = tgt_statfs_iavail(tgt) >> 8;
504 ia_min = min(ia, ia_min);
505 ia_max = max(ia, ia_max);
507 tgt->ltd_qos.ltq_svr->lsq_iavail += ia;
512 * prio * bavail * iavail / (num_tgt - 1) / 2
514 tgt->ltd_qos.ltq_penalty_per_obj = prio_wide * ba * ia >> 8;
515 do_div(tgt->ltd_qos.ltq_penalty_per_obj, num_active);
516 tgt->ltd_qos.ltq_penalty_per_obj >>= 1;
518 age = (now - tgt->ltd_qos.ltq_used) >> 3;
519 if (test_bit(LQ_RESET, &qos->lq_flags) ||
520 age > 32 * desc->ld_qos_maxage)
521 tgt->ltd_qos.ltq_penalty = 0;
522 else if (age > desc->ld_qos_maxage)
523 /* Decay tgt penalty. */
524 tgt->ltd_qos.ltq_penalty >>= age / desc->ld_qos_maxage;
527 num_active = qos->lq_active_svr_count - 1;
528 if (num_active < 1) {
530 * If there's only 1 server, we can't penalize it, so instead
531 * we have to double the tgt penalty
534 ltd_foreach_tgt(ltd, tgt) {
535 if (!tgt->ltd_active)
538 tgt->ltd_qos.ltq_penalty_per_obj <<= 1;
543 * Per-server penalty is
544 * prio * bavail * iavail / server_tgts / (num_svr - 1) / 2
546 list_for_each_entry(svr, &qos->lq_svr_list, lsq_svr_list) {
547 ba = svr->lsq_bavail;
548 ia = svr->lsq_iavail;
549 svr->lsq_penalty_per_obj = prio_wide * ba * ia >> 8;
550 do_div(svr->lsq_penalty_per_obj,
551 svr->lsq_tgt_count * num_active);
552 svr->lsq_penalty_per_obj >>= 1;
554 age = (now - svr->lsq_used) >> 3;
555 if (test_bit(LQ_RESET, &qos->lq_flags) ||
556 age > 32 * desc->ld_qos_maxage)
557 svr->lsq_penalty = 0;
558 else if (age > desc->ld_qos_maxage)
559 /* Decay server penalty. */
560 svr->lsq_penalty >>= age / desc->ld_qos_maxage;
563 clear_bit(LQ_DIRTY, &qos->lq_flags);
564 clear_bit(LQ_RESET, &qos->lq_flags);
567 * If each tgt has almost same free space, do rr allocation for better
568 * creation performance
570 clear_bit(LQ_SAME_SPACE, &qos->lq_flags);
571 if ((ba_max * (256 - qos->lq_threshold_rr)) >> 8 < ba_min &&
572 (ia_max * (256 - qos->lq_threshold_rr)) >> 8 < ia_min) {
573 set_bit(LQ_SAME_SPACE, &qos->lq_flags);
574 /* Reset weights for the next time we enter qos mode */
575 set_bit(LQ_RESET, &qos->lq_flags);
580 if (!rc && test_bit(LQ_SAME_SPACE, &qos->lq_flags))
585 EXPORT_SYMBOL(ltd_qos_penalties_calc);
588 * Re-calculate penalties and weights of all tgts.
590 * The function is called when some target was used for a new object. In
591 * this case we should re-calculate all the weights to keep new allocations
594 * \param[in] ltd lu_tgt_descs
595 * \param[in] tgt recently used tgt
596 * \param[out] total_wt new total weight for the pool
600 int ltd_qos_update(struct lu_tgt_descs *ltd, struct lu_tgt_desc *tgt,
603 struct lu_qos *qos = <d->ltd_qos;
604 struct lu_tgt_qos *ltq;
605 struct lu_svr_qos *svr;
612 /* Don't allocate on this device anymore, until the next alloc_qos */
618 * Decay old penalty by half (we're adding max penalty, and don't
619 * want it to run away.)
621 ltq->ltq_penalty >>= 1;
622 svr->lsq_penalty >>= 1;
624 /* mark the server and tgt as recently used */
625 ltq->ltq_used = svr->lsq_used = ktime_get_real_seconds();
627 /* Set max penalties for this tgt and server */
628 ltq->ltq_penalty += ltq->ltq_penalty_per_obj *
629 ltd->ltd_lov_desc.ld_active_tgt_count;
630 svr->lsq_penalty += svr->lsq_penalty_per_obj *
631 qos->lq_active_svr_count;
633 /* Decrease all MDS penalties */
634 list_for_each_entry(svr, &qos->lq_svr_list, lsq_svr_list) {
635 if (svr->lsq_penalty < svr->lsq_penalty_per_obj)
636 svr->lsq_penalty = 0;
638 svr->lsq_penalty -= svr->lsq_penalty_per_obj;
642 /* Decrease all tgt penalties */
643 ltd_foreach_tgt(ltd, tgt) {
644 if (!tgt->ltd_active)
648 if (ltq->ltq_penalty < ltq->ltq_penalty_per_obj)
649 ltq->ltq_penalty = 0;
651 ltq->ltq_penalty -= ltq->ltq_penalty_per_obj;
653 lu_tgt_qos_weight_calc(tgt);
655 /* Recalc the total weight of usable osts */
657 *total_wt += ltq->ltq_weight;
659 CDEBUG(D_OTHER, "recalc tgt %d usable=%d bavail=%llu ffree=%llu tgtppo=%llu tgtp=%llu svrppo=%llu svrp=%llu wt=%llu\n",
660 tgt->ltd_index, ltq->ltq_usable,
661 tgt_statfs_bavail(tgt) >> 16,
662 tgt_statfs_iavail(tgt) >> 8,
663 ltq->ltq_penalty_per_obj >> 10,
664 ltq->ltq_penalty >> 10,
665 ltq->ltq_svr->lsq_penalty_per_obj >> 10,
666 ltq->ltq_svr->lsq_penalty >> 10,
667 ltq->ltq_weight >> 10);
672 EXPORT_SYMBOL(ltd_qos_update);