1 // -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
2 // vim: ts=8 sw=2 smarttab
4 * Ceph - scalable distributed file system
6 * Copyright (C) 2004-2006 Sage Weil <sage@newdream.net>
8 * This is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU Lesser General Public
10 * License version 2.1, as published by the Free Software
11 * Foundation. See file COPYING.
15 #include "include/compat.h"
18 #include "MDBalancer.h"
20 #include "mon/MonClient.h"
28 #include "include/Context.h"
29 #include "msg/Messenger.h"
30 #include "messages/MHeartbeat.h"
39 #include "common/config.h"
40 #include "common/errno.h"
42 #define dout_context g_ceph_context
43 #define dout_subsys ceph_subsys_mds
45 #define dout_prefix *_dout << "mds." << mds->get_nodeid() << ".bal "
49 auto subsys = ceph_subsys_mds;\
50 if ((dout_context)->_conf->subsys.should_gather(ceph_subsys_mds_balancer, lvl)) {\
51 subsys = ceph_subsys_mds_balancer;\
53 dout_impl(dout_context, subsys, lvl) dout_prefix
55 #define dendl dendl_impl; } while (0)
58 #define MIN_LOAD 50 // ??
59 #define MIN_REEXPORT 5 // will automatically reexport
60 #define MIN_OFFLOAD 10 // point at which i stop trying, close enough
63 /* This function DOES put the passed message before returning */
64 int MDBalancer::proc_message(Message
*m
)
66 switch (m
->get_type()) {
68 case MSG_MDS_HEARTBEAT
:
69 handle_heartbeat(static_cast<MHeartbeat
*>(m
));
73 dout(0) << " balancer unknown message " << m
->get_type() << dendl
;
74 assert(0 == "balancer unknown message");
80 void MDBalancer::handle_export_pins(void)
82 auto &q
= mds
->mdcache
->export_pin_queue
;
84 dout(20) << "export_pin_queue size=" << q
.size() << dendl
;
85 while (it
!= q
.end()) {
89 mds_rank_t export_pin
= in
->get_export_pin(false);
93 in
->get_dirfrags(dfls
);
94 for (auto dir
: dfls
) {
98 if (export_pin
== MDS_RANK_NONE
) {
99 if (dir
->state_test(CDir::STATE_AUXSUBTREE
)) {
100 if (dir
->is_frozen() || dir
->is_freezing()) {
105 dout(10) << " clear auxsubtree on " << *dir
<< dendl
;
106 dir
->state_clear(CDir::STATE_AUXSUBTREE
);
107 mds
->mdcache
->try_subtree_merge(dir
);
109 } else if (export_pin
== mds
->get_nodeid()) {
110 if (dir
->state_test(CDir::STATE_CREATING
) ||
111 dir
->is_frozen() || dir
->is_freezing()) {
116 if (!dir
->is_subtree_root()) {
117 dir
->state_set(CDir::STATE_AUXSUBTREE
);
118 mds
->mdcache
->adjust_subtree_auth(dir
, mds
->get_nodeid());
119 dout(10) << " create aux subtree on " << *dir
<< dendl
;
120 } else if (!dir
->state_test(CDir::STATE_AUXSUBTREE
)) {
121 dout(10) << " set auxsubtree bit on " << *dir
<< dendl
;
122 dir
->state_set(CDir::STATE_AUXSUBTREE
);
125 mds
->mdcache
->migrator
->export_dir(dir
, export_pin
);
131 in
->state_clear(CInode::STATE_QUEUEDEXPORTPIN
);
136 set
<CDir
*> authsubs
;
137 mds
->mdcache
->get_auth_subtrees(authsubs
);
138 for (auto &cd
: authsubs
) {
139 mds_rank_t export_pin
= cd
->inode
->get_export_pin();
140 dout(10) << "auth tree " << *cd
<< " export_pin=" << export_pin
<< dendl
;
141 if (export_pin
>= 0 && export_pin
!= mds
->get_nodeid()) {
142 dout(10) << "exporting auth subtree " << *cd
->inode
<< " to " << export_pin
<< dendl
;
143 mds
->mdcache
->migrator
->export_dir(cd
, export_pin
);
148 void MDBalancer::tick()
150 static int num_bal_times
= g_conf
->mds_bal_max
;
151 static utime_t first
= ceph_clock_now();
152 utime_t now
= ceph_clock_now();
153 utime_t elapsed
= now
;
156 if (g_conf
->mds_bal_export_pin
) {
157 handle_export_pins();
161 if ((double)now
- (double)last_sample
> g_conf
->mds_bal_sample_interval
) {
162 dout(15) << "tick last_sample now " << now
<< dendl
;
167 if (last_heartbeat
== utime_t())
168 last_heartbeat
= now
;
169 if (mds
->get_nodeid() == 0 &&
170 g_conf
->mds_bal_interval
> 0 &&
172 (g_conf
->mds_bal_max_until
>= 0 &&
173 elapsed
.sec() > g_conf
->mds_bal_max_until
)) &&
175 now
.sec() - last_heartbeat
.sec() >= g_conf
->mds_bal_interval
) {
176 last_heartbeat
= now
;
185 class C_Bal_SendHeartbeat
: public MDSInternalContext
{
187 explicit C_Bal_SendHeartbeat(MDSRank
*mds_
) : MDSInternalContext(mds_
) { }
188 void finish(int f
) override
{
189 mds
->balancer
->send_heartbeat();
194 double mds_load_t::mds_load()
196 switch(g_conf
->mds_bal_mode
) {
199 .8 * auth
.meta_load() +
200 .2 * all
.meta_load() +
205 return req_rate
+ 10.0*queue_len
;
215 mds_load_t
MDBalancer::get_load(utime_t now
)
217 mds_load_t
load(now
);
219 if (mds
->mdcache
->get_root()) {
221 mds
->mdcache
->get_root()->get_dirfrags(ls
);
222 for (list
<CDir
*>::iterator p
= ls
.begin();
225 load
.auth
.add(now
, mds
->mdcache
->decayrate
, (*p
)->pop_auth_subtree_nested
);
226 load
.all
.add(now
, mds
->mdcache
->decayrate
, (*p
)->pop_nested
);
229 dout(20) << "get_load no root, no load" << dendl
;
232 load
.req_rate
= mds
->get_req_rate();
233 load
.queue_len
= messenger
->get_dispatch_queue_len();
235 ifstream
cpu(PROCPREFIX
"/proc/loadavg");
237 cpu
>> load
.cpu_load_avg
;
239 dout(0) << "input file " PROCPREFIX
"'/proc/loadavg' not found" << dendl
;
241 dout(15) << "get_load " << load
<< dendl
;
246 * Read synchronously from RADOS using a timeout. We cannot do daemon-local
247 * fallbacks (i.e. kick off async read when we are processing the map and
248 * check status when we get here) with the way the mds is structured.
250 int MDBalancer::localize_balancer()
252 /* reset everything */
259 /* we assume that balancer is in the metadata pool */
260 object_t oid
= object_t(mds
->mdsmap
->get_balancer());
261 object_locator_t
oloc(mds
->mdsmap
->get_metadata_pool());
262 ceph_tid_t tid
= mds
->objecter
->read(oid
, oloc
, 0, 0, CEPH_NOSNAP
, &lua_src
, 0,
263 new C_SafeCond(&lock
, &cond
, &ack
, &r
));
264 dout(15) << "launched non-blocking read tid=" << tid
265 << " oid=" << oid
<< " oloc=" << oloc
<< dendl
;
267 /* timeout: if we waste half our time waiting for RADOS, then abort! */
268 double t
= ceph_clock_now() + g_conf
->mds_bal_interval
/2;
270 timeout
.set_from_double(t
);
272 int ret_t
= cond
.WaitUntil(lock
, timeout
);
275 /* success: store the balancer in memory and set the version. */
277 if (ret_t
== ETIMEDOUT
) {
278 mds
->objecter
->op_cancel(tid
, -ECANCELED
);
281 bal_code
.assign(lua_src
.to_str());
282 bal_version
.assign(oid
.name
);
283 dout(0) << "localized balancer, bal_code=" << bal_code
<< dendl
;
288 void MDBalancer::send_heartbeat()
290 utime_t now
= ceph_clock_now();
292 if (mds
->is_cluster_degraded()) {
293 dout(10) << "send_heartbeat degraded" << dendl
;
297 if (!mds
->mdcache
->is_open()) {
298 dout(5) << "not open" << dendl
;
299 mds
->mdcache
->wait_for_open(new C_Bal_SendHeartbeat(mds
));
304 if (mds
->get_nodeid() == 0)
308 mds_load_t load
= get_load(now
);
309 map
<mds_rank_t
, mds_load_t
>::value_type
val(mds
->get_nodeid(), load
);
310 mds_load
.insert(val
);
312 // import_map -- how much do i import from whom
313 map
<mds_rank_t
, float> import_map
;
315 mds
->mdcache
->get_auth_subtrees(authsubs
);
316 for (set
<CDir
*>::iterator it
= authsubs
.begin();
317 it
!= authsubs
.end();
320 mds_rank_t from
= im
->inode
->authority().first
;
321 if (from
== mds
->get_nodeid()) continue;
322 if (im
->get_inode()->is_stray()) continue;
323 import_map
[from
] += im
->pop_auth_subtree
.meta_load(now
, mds
->mdcache
->decayrate
);
325 mds_import_map
[ mds
->get_nodeid() ] = import_map
;
328 dout(5) << "mds." << mds
->get_nodeid() << " epoch " << beat_epoch
<< " load " << load
<< dendl
;
329 for (map
<mds_rank_t
, float>::iterator it
= import_map
.begin();
330 it
!= import_map
.end();
332 dout(5) << " import_map from " << it
->first
<< " -> " << it
->second
<< dendl
;
337 mds
->get_mds_map()->get_up_mds_set(up
);
338 for (set
<mds_rank_t
>::iterator p
= up
.begin(); p
!= up
.end(); ++p
) {
339 if (*p
== mds
->get_nodeid())
341 MHeartbeat
*hb
= new MHeartbeat(load
, beat_epoch
);
342 hb
->get_import_map() = import_map
;
343 messenger
->send_message(hb
,
344 mds
->mdsmap
->get_inst(*p
));
348 /* This function DOES put the passed message before returning */
349 void MDBalancer::handle_heartbeat(MHeartbeat
*m
)
351 typedef map
<mds_rank_t
, mds_load_t
> mds_load_map_t
;
353 mds_rank_t who
= mds_rank_t(m
->get_source().num());
354 dout(25) << "=== got heartbeat " << m
->get_beat() << " from " << m
->get_source().num() << " " << m
->get_load() << dendl
;
356 if (!mds
->is_active())
359 if (!mds
->mdcache
->is_open()) {
360 dout(10) << "opening root on handle_heartbeat" << dendl
;
361 mds
->mdcache
->wait_for_open(new C_MDS_RetryMessage(mds
, m
));
365 if (mds
->is_cluster_degraded()) {
366 dout(10) << " degraded, ignoring" << dendl
;
371 dout(20) << " from mds0, new epoch" << dendl
;
372 beat_epoch
= m
->get_beat();
375 mds
->mdcache
->show_subtrees();
380 mds_load_map_t::value_type
val(who
, m
->get_load());
381 pair
< mds_load_map_t::iterator
, bool > rval (mds_load
.insert(val
));
383 rval
.first
->second
= val
.second
;
386 mds_import_map
[ who
] = m
->get_import_map();
388 //dout(0) << " load is " << load << " have " << mds_load.size() << dendl;
391 unsigned cluster_size
= mds
->get_mds_map()->get_num_in_mds();
392 if (mds_load
.size() == cluster_size
) {
394 //export_empties(); // no!
396 /* avoid spamming ceph -w if user does not turn mantle on */
397 if (mds
->mdsmap
->get_balancer() != "") {
398 int r
= mantle_prep_rebalance();
400 mds
->clog
->warn() << "using old balancer; mantle failed for "
401 << "balancer=" << mds
->mdsmap
->get_balancer()
402 << " : " << cpp_strerror(r
);
404 prep_rebalance(m
->get_beat());
414 void MDBalancer::export_empties()
416 dout(5) << "export_empties checking for empty imports" << dendl
;
418 std::set
<CDir
*> subtrees
;
419 mds
->mdcache
->get_fullauth_subtrees(subtrees
);
420 for (auto &dir
: subtrees
) {
421 if (dir
->is_freezing() || dir
->is_frozen())
424 if (!dir
->inode
->is_base() &&
425 !dir
->inode
->is_stray() &&
426 dir
->get_num_head_items() == 0)
427 mds
->mdcache
->migrator
->export_empty_import(dir
);
433 double MDBalancer::try_match(balance_state_t
& state
, mds_rank_t ex
, double& maxex
,
434 mds_rank_t im
, double& maxim
)
436 if (maxex
<= 0 || maxim
<= 0) return 0.0;
438 double howmuch
= MIN(maxex
, maxim
);
439 if (howmuch
<= 0) return 0.0;
441 dout(5) << " - mds." << ex
<< " exports " << howmuch
<< " to mds." << im
<< dendl
;
443 if (ex
== mds
->get_nodeid())
444 state
.targets
[im
] += howmuch
;
446 state
.exported
[ex
] += howmuch
;
447 state
.imported
[im
] += howmuch
;
455 void MDBalancer::queue_split(const CDir
*dir
, bool fast
)
457 dout(10) << __func__
<< " enqueuing " << *dir
458 << " (fast=" << fast
<< ")" << dendl
;
460 assert(mds
->mdsmap
->allows_dirfrags());
461 const dirfrag_t frag
= dir
->dirfrag();
463 auto callback
= [this, frag
](int r
) {
464 if (split_pending
.erase(frag
) == 0) {
465 // Someone beat me to it. This can happen in the fast splitting
466 // path, because we spawn two contexts, one with mds->timer and
467 // one with mds->queue_waiter. The loser can safely just drop
472 CDir
*split_dir
= mds
->mdcache
->get_dirfrag(frag
);
474 dout(10) << "drop split on " << frag
<< " because not in cache" << dendl
;
477 if (!split_dir
->is_auth()) {
478 dout(10) << "drop split on " << frag
<< " because non-auth" << dendl
;
482 // Pass on to MDCache: note that the split might still not
483 // happen if the checks in MDCache::can_fragment fail.
484 dout(10) << __func__
<< " splitting " << *split_dir
<< dendl
;
485 mds
->mdcache
->split_dir(split_dir
, g_conf
->mds_bal_split_bits
);
489 if (split_pending
.count(frag
) == 0) {
490 split_pending
.insert(frag
);
495 // Do the split ASAP: enqueue it in the MDSRank waiters which are
496 // run at the end of dispatching the current request
497 mds
->queue_waiter(new MDSInternalContextWrapper(mds
,
498 new FunctionContext(callback
)));
500 // Set a timer to really do the split: we don't do it immediately
501 // so that bursts of ops on a directory have a chance to go through
502 // before we freeze it.
503 mds
->timer
.add_event_after(g_conf
->mds_bal_fragment_interval
,
504 new FunctionContext(callback
));
508 void MDBalancer::queue_merge(CDir
*dir
)
510 const auto frag
= dir
->dirfrag();
511 auto callback
= [this, frag
](int r
) {
512 assert(frag
.frag
!= frag_t());
514 // frag must be in this set because only one context is in flight
515 // for a given frag at a time (because merge_pending is checked before
516 // starting one), and this context is the only one that erases it.
517 merge_pending
.erase(frag
);
519 CDir
*dir
= mds
->mdcache
->get_dirfrag(frag
);
521 dout(10) << "drop merge on " << frag
<< " because not in cache" << dendl
;
524 assert(dir
->dirfrag() == frag
);
526 if(!dir
->is_auth()) {
527 dout(10) << "drop merge on " << *dir
<< " because lost auth" << dendl
;
531 dout(10) << "merging " << *dir
<< dendl
;
533 CInode
*diri
= dir
->get_inode();
535 frag_t fg
= dir
->get_frag();
536 while (fg
!= frag_t()) {
537 frag_t sibfg
= fg
.get_sibling();
539 bool complete
= diri
->get_dirfrags_under(sibfg
, sibs
);
541 dout(10) << " not all sibs under " << sibfg
<< " in cache (have " << sibs
<< ")" << dendl
;
545 for (list
<CDir
*>::iterator p
= sibs
.begin(); p
!= sibs
.end(); ++p
) {
547 if (!sib
->is_auth() || !sib
->should_merge()) {
553 dout(10) << " not all sibs under " << sibfg
<< " " << sibs
<< " should_merge" << dendl
;
556 dout(10) << " all sibs under " << sibfg
<< " " << sibs
<< " should merge" << dendl
;
560 if (fg
!= dir
->get_frag())
561 mds
->mdcache
->merge_dir(diri
, fg
);
564 if (merge_pending
.count(frag
) == 0) {
565 dout(20) << __func__
<< " enqueued dir " << *dir
<< dendl
;
566 merge_pending
.insert(frag
);
567 mds
->timer
.add_event_after(g_conf
->mds_bal_fragment_interval
,
568 new FunctionContext(callback
));
570 dout(20) << __func__
<< " dir already in queue " << *dir
<< dendl
;
574 void MDBalancer::prep_rebalance(int beat
)
576 balance_state_t state
;
578 if (g_conf
->mds_thrash_exports
) {
579 //we're going to randomly export to all the mds in the cluster
580 set
<mds_rank_t
> up_mds
;
581 mds
->get_mds_map()->get_up_mds_set(up_mds
);
582 for (const auto &rank
: up_mds
) {
583 state
.targets
[rank
] = 0.0;
586 int cluster_size
= mds
->get_mds_map()->get_num_in_mds();
587 mds_rank_t whoami
= mds
->get_nodeid();
588 rebalance_time
= ceph_clock_now();
590 dout(5) << " prep_rebalance: cluster loads are" << dendl
;
592 mds
->mdcache
->migrator
->clear_export_queue();
594 // rescale! turn my mds_load back into meta_load units
595 double load_fac
= 1.0;
596 map
<mds_rank_t
, mds_load_t
>::iterator m
= mds_load
.find(whoami
);
597 if ((m
!= mds_load
.end()) && (m
->second
.mds_load() > 0)) {
598 double metald
= m
->second
.auth
.meta_load(rebalance_time
, mds
->mdcache
->decayrate
);
599 double mdsld
= m
->second
.mds_load();
600 load_fac
= metald
/ mdsld
;
601 dout(7) << " load_fac is " << load_fac
602 << " <- " << m
->second
.auth
<< " " << metald
607 double total_load
= 0.0;
608 multimap
<double,mds_rank_t
> load_map
;
609 for (mds_rank_t i
=mds_rank_t(0); i
< mds_rank_t(cluster_size
); i
++) {
610 map
<mds_rank_t
, mds_load_t
>::value_type
val(i
, mds_load_t(ceph_clock_now()));
611 std::pair
< map
<mds_rank_t
, mds_load_t
>::iterator
, bool > r(mds_load
.insert(val
));
612 mds_load_t
&load(r
.first
->second
);
614 double l
= load
.mds_load() * load_fac
;
615 mds_meta_load
[i
] = l
;
618 dout(0) << " mds." << i
620 << " = " << load
.mds_load()
621 << " ~ " << l
<< dendl
;
623 if (whoami
== i
) my_load
= l
;
626 load_map
.insert(pair
<double,mds_rank_t
>( l
, i
));
630 target_load
= total_load
/ (double)cluster_size
;
631 dout(5) << "prep_rebalance: my load " << my_load
632 << " target " << target_load
633 << " total " << total_load
637 if (my_load
< target_load
* (1.0 + g_conf
->mds_bal_min_rebalance
)) {
638 dout(5) << " i am underloaded or barely overloaded, doing nothing." << dendl
;
639 last_epoch_under
= beat_epoch
;
640 mds
->mdcache
->show_subtrees();
644 last_epoch_over
= beat_epoch
;
646 // am i over long enough?
647 if (last_epoch_under
&& beat_epoch
- last_epoch_under
< 2) {
648 dout(5) << " i am overloaded, but only for " << (beat_epoch
- last_epoch_under
) << " epochs" << dendl
;
652 dout(5) << " i am sufficiently overloaded" << dendl
;
655 // first separate exporters and importers
656 multimap
<double,mds_rank_t
> importers
;
657 multimap
<double,mds_rank_t
> exporters
;
658 set
<mds_rank_t
> importer_set
;
659 set
<mds_rank_t
> exporter_set
;
661 for (multimap
<double,mds_rank_t
>::iterator it
= load_map
.begin();
662 it
!= load_map
.end();
664 if (it
->first
< target_load
) {
665 dout(15) << " mds." << it
->second
<< " is importer" << dendl
;
666 importers
.insert(pair
<double,mds_rank_t
>(it
->first
,it
->second
));
667 importer_set
.insert(it
->second
);
669 dout(15) << " mds." << it
->second
<< " is exporter" << dendl
;
670 exporters
.insert(pair
<double,mds_rank_t
>(it
->first
,it
->second
));
671 exporter_set
.insert(it
->second
);
676 // determine load transfer mapping
679 // analyze import_map; do any matches i can
681 dout(15) << " matching exporters to import sources" << dendl
;
683 // big -> small exporters
684 for (multimap
<double,mds_rank_t
>::reverse_iterator ex
= exporters
.rbegin();
685 ex
!= exporters
.rend();
687 double maxex
= get_maxex(state
, ex
->second
);
688 if (maxex
<= .001) continue;
690 // check importers. for now, just in arbitrary order (no intelligent matching).
691 for (map
<mds_rank_t
, float>::iterator im
= mds_import_map
[ex
->second
].begin();
692 im
!= mds_import_map
[ex
->second
].end();
694 double maxim
= get_maxim(state
, im
->first
);
695 if (maxim
<= .001) continue;
696 try_match(state
, ex
->second
, maxex
, im
->first
, maxim
);
697 if (maxex
<= .001) break;
704 dout(15) << " matching big exporters to big importers" << dendl
;
705 // big exporters to big importers
706 multimap
<double,mds_rank_t
>::reverse_iterator ex
= exporters
.rbegin();
707 multimap
<double,mds_rank_t
>::iterator im
= importers
.begin();
708 while (ex
!= exporters
.rend() &&
709 im
!= importers
.end()) {
710 double maxex
= get_maxex(state
, ex
->second
);
711 double maxim
= get_maxim(state
, im
->second
);
712 if (maxex
< .001 || maxim
< .001) break;
713 try_match(state
, ex
->second
, maxex
, im
->second
, maxim
);
714 if (maxex
<= .001) ++ex
;
715 if (maxim
<= .001) ++im
;
718 dout(15) << " matching small exporters to big importers" << dendl
;
719 // small exporters to big importers
720 multimap
<double,mds_rank_t
>::iterator ex
= exporters
.begin();
721 multimap
<double,mds_rank_t
>::iterator im
= importers
.begin();
722 while (ex
!= exporters
.end() &&
723 im
!= importers
.end()) {
724 double maxex
= get_maxex(state
, ex
->second
);
725 double maxim
= get_maxim(state
, im
->second
);
726 if (maxex
< .001 || maxim
< .001) break;
727 try_match(state
, ex
->second
, maxex
, im
->second
, maxim
);
728 if (maxex
<= .001) ++ex
;
729 if (maxim
<= .001) ++im
;
733 try_rebalance(state
);
736 int MDBalancer::mantle_prep_rebalance()
738 balance_state_t state
;
740 /* refresh balancer if it has changed */
741 if (bal_version
!= mds
->mdsmap
->get_balancer()) {
742 bal_version
.assign("");
743 int r
= localize_balancer();
746 /* only spam the cluster log from 1 mds on version changes */
747 if (mds
->get_nodeid() == 0)
748 mds
->clog
->info() << "mantle balancer version changed: " << bal_version
;
751 /* prepare for balancing */
752 int cluster_size
= mds
->get_mds_map()->get_num_in_mds();
753 rebalance_time
= ceph_clock_now();
754 mds
->mdcache
->migrator
->clear_export_queue();
756 /* fill in the metrics for each mds by grabbing load struct */
757 vector
< map
<string
, double> > metrics (cluster_size
);
758 for (mds_rank_t i
=mds_rank_t(0);
759 i
< mds_rank_t(cluster_size
);
761 map
<mds_rank_t
, mds_load_t
>::value_type
val(i
, mds_load_t(ceph_clock_now()));
762 std::pair
< map
<mds_rank_t
, mds_load_t
>::iterator
, bool > r(mds_load
.insert(val
));
763 mds_load_t
&load(r
.first
->second
);
765 metrics
[i
] = {{"auth.meta_load", load
.auth
.meta_load()},
766 {"all.meta_load", load
.all
.meta_load()},
767 {"req_rate", load
.req_rate
},
768 {"queue_len", load
.queue_len
},
769 {"cpu_load_avg", load
.cpu_load_avg
}};
772 /* execute the balancer */
774 int ret
= mantle
.balance(bal_code
, mds
->get_nodeid(), metrics
, state
.targets
);
775 dout(2) << " mantle decided that new targets=" << state
.targets
<< dendl
;
777 /* mantle doesn't know about cluster size, so check target len here */
778 if ((int) state
.targets
.size() != cluster_size
)
783 try_rebalance(state
);
789 void MDBalancer::try_rebalance(balance_state_t
& state
)
791 if (g_conf
->mds_thrash_exports
) {
792 dout(5) << "mds_thrash is on; not performing standard rebalance operation!"
797 // make a sorted list of my imports
798 map
<double,CDir
*> import_pop_map
;
799 multimap
<mds_rank_t
,CDir
*> import_from_map
;
800 set
<CDir
*> fullauthsubs
;
802 mds
->mdcache
->get_fullauth_subtrees(fullauthsubs
);
803 for (set
<CDir
*>::iterator it
= fullauthsubs
.begin();
804 it
!= fullauthsubs
.end();
807 if (im
->get_inode()->is_stray()) continue;
809 double pop
= im
->pop_auth_subtree
.meta_load(rebalance_time
, mds
->mdcache
->decayrate
);
810 if (g_conf
->mds_bal_idle_threshold
> 0 &&
811 pop
< g_conf
->mds_bal_idle_threshold
&&
812 im
->inode
!= mds
->mdcache
->get_root() &&
813 im
->inode
->authority().first
!= mds
->get_nodeid()) {
814 dout(0) << " exporting idle (" << pop
<< ") import " << *im
815 << " back to mds." << im
->inode
->authority().first
817 mds
->mdcache
->migrator
->export_dir_nicely(im
, im
->inode
->authority().first
);
821 import_pop_map
[ pop
] = im
;
822 mds_rank_t from
= im
->inode
->authority().first
;
823 dout(15) << " map: i imported " << *im
<< " from " << from
<< dendl
;
824 import_from_map
.insert(pair
<mds_rank_t
,CDir
*>(from
, im
));
830 set
<CDir
*> already_exporting
;
832 for (auto &it
: state
.targets
) {
833 mds_rank_t target
= it
.first
;
834 double amount
= it
.second
;
836 if (amount
< MIN_OFFLOAD
) continue;
837 if (amount
/ target_load
< .2) continue;
839 dout(5) << "want to send " << amount
<< " to mds." << target
840 //<< " .. " << (*it).second << " * " << load_fac
842 << dendl
;//" .. fudge is " << fudge << dendl;
846 mds
->mdcache
->show_subtrees();
848 // search imports from target
849 if (import_from_map
.count(target
)) {
850 dout(5) << " aha, looking through imports from target mds." << target
<< dendl
;
851 pair
<multimap
<mds_rank_t
,CDir
*>::iterator
, multimap
<mds_rank_t
,CDir
*>::iterator
> p
=
852 import_from_map
.equal_range(target
);
853 while (p
.first
!= p
.second
) {
854 CDir
*dir
= (*p
.first
).second
;
855 dout(5) << "considering " << *dir
<< " from " << (*p
.first
).first
<< dendl
;
856 multimap
<mds_rank_t
,CDir
*>::iterator plast
= p
.first
++;
858 if (dir
->inode
->is_base() ||
859 dir
->inode
->is_stray())
861 if (dir
->is_freezing() || dir
->is_frozen()) continue; // export pbly already in progress
862 double pop
= dir
->pop_auth_subtree
.meta_load(rebalance_time
, mds
->mdcache
->decayrate
);
863 assert(dir
->inode
->authority().first
== target
); // cuz that's how i put it in the map, dummy
865 if (pop
<= amount
-have
) {
866 dout(0) << "reexporting " << *dir
868 << " back to mds." << target
<< dendl
;
869 mds
->mdcache
->migrator
->export_dir_nicely(dir
, target
);
871 import_from_map
.erase(plast
);
872 import_pop_map
.erase(pop
);
874 dout(5) << "can't reexport " << *dir
<< ", too big " << pop
<< dendl
;
876 if (amount
-have
< MIN_OFFLOAD
) break;
879 if (amount
-have
< MIN_OFFLOAD
) {
885 for (map
<double,CDir
*>::iterator import
= import_pop_map
.begin();
886 import
!= import_pop_map
.end();
888 CDir
*imp
= (*import
).second
;
889 if (imp
->inode
->is_base() ||
890 imp
->inode
->is_stray())
893 double pop
= (*import
).first
;
894 if (pop
< amount
-have
|| pop
< MIN_REEXPORT
) {
895 dout(0) << "reexporting " << *imp
897 << " back to mds." << imp
->inode
->authority()
900 mds
->mdcache
->migrator
->export_dir_nicely(imp
, imp
->inode
->authority().first
);
902 if (amount
-have
< MIN_OFFLOAD
) break;
904 if (amount
-have
< MIN_OFFLOAD
) {
905 //fudge = amount-have;
909 // okay, search for fragments of my workload
910 set
<CDir
*> candidates
;
911 mds
->mdcache
->get_fullauth_subtrees(candidates
);
915 for (set
<CDir
*>::iterator pot
= candidates
.begin();
916 pot
!= candidates
.end();
918 if ((*pot
)->get_inode()->is_stray()) continue;
919 find_exports(*pot
, amount
, exports
, have
, already_exporting
);
920 if (have
> amount
-MIN_OFFLOAD
)
923 //fudge = amount - have;
925 for (list
<CDir
*>::iterator it
= exports
.begin(); it
!= exports
.end(); ++it
) {
926 dout(0) << " - exporting "
927 << (*it
)->pop_auth_subtree
929 << (*it
)->pop_auth_subtree
.meta_load(rebalance_time
, mds
->mdcache
->decayrate
)
930 << " to mds." << target
933 mds
->mdcache
->migrator
->export_dir_nicely(*it
, target
);
937 dout(5) << "rebalance done" << dendl
;
938 mds
->mdcache
->show_subtrees();
941 void MDBalancer::find_exports(CDir
*dir
,
943 list
<CDir
*>& exports
,
945 set
<CDir
*>& already_exporting
)
947 double need
= amount
- have
;
948 if (need
< amount
* g_conf
->mds_bal_min_start
)
949 return; // good enough!
950 double needmax
= need
* g_conf
->mds_bal_need_max
;
951 double needmin
= need
* g_conf
->mds_bal_need_min
;
952 double midchunk
= need
* g_conf
->mds_bal_midchunk
;
953 double minchunk
= need
* g_conf
->mds_bal_minchunk
;
955 list
<CDir
*> bigger_rep
, bigger_unrep
;
956 multimap
<double, CDir
*> smaller
;
958 double dir_pop
= dir
->pop_auth_subtree
.meta_load(rebalance_time
, mds
->mdcache
->decayrate
);
959 dout(7) << " find_exports in " << dir_pop
<< " " << *dir
<< " need " << need
<< " (" << needmin
<< " - " << needmax
<< ")" << dendl
;
961 double subdir_sum
= 0;
962 for (CDir::map_t::iterator it
= dir
->begin();
965 CInode
*in
= it
->second
->get_linkage()->get_inode();
967 if (!in
->is_dir()) continue;
970 in
->get_dirfrags(dfls
);
971 for (list
<CDir
*>::iterator p
= dfls
.begin();
975 if (!subdir
->is_auth()) continue;
976 if (already_exporting
.count(subdir
)) continue;
978 if (subdir
->is_frozen()) continue; // can't export this right now!
981 double pop
= subdir
->pop_auth_subtree
.meta_load(rebalance_time
, mds
->mdcache
->decayrate
);
983 dout(15) << " subdir pop " << pop
<< " " << *subdir
<< dendl
;
985 if (pop
< minchunk
) continue;
988 if (pop
> needmin
&& pop
< needmax
) {
989 exports
.push_back(subdir
);
990 already_exporting
.insert(subdir
);
996 if (subdir
->is_rep())
997 bigger_rep
.push_back(subdir
);
999 bigger_unrep
.push_back(subdir
);
1001 smaller
.insert(pair
<double,CDir
*>(pop
, subdir
));
1004 dout(15) << " sum " << subdir_sum
<< " / " << dir_pop
<< dendl
;
1006 // grab some sufficiently big small items
1007 multimap
<double,CDir
*>::reverse_iterator it
;
1008 for (it
= smaller
.rbegin();
1009 it
!= smaller
.rend();
1012 if ((*it
).first
< midchunk
)
1015 dout(7) << " taking smaller " << *(*it
).second
<< dendl
;
1017 exports
.push_back((*it
).second
);
1018 already_exporting
.insert((*it
).second
);
1019 have
+= (*it
).first
;
1024 // apprently not enough; drill deeper into the hierarchy (if non-replicated)
1025 for (list
<CDir
*>::iterator it
= bigger_unrep
.begin();
1026 it
!= bigger_unrep
.end();
1028 dout(15) << " descending into " << **it
<< dendl
;
1029 find_exports(*it
, amount
, exports
, have
, already_exporting
);
1034 // ok fine, use smaller bits
1036 it
!= smaller
.rend();
1038 dout(7) << " taking (much) smaller " << it
->first
<< " " << *(*it
).second
<< dendl
;
1040 exports
.push_back((*it
).second
);
1041 already_exporting
.insert((*it
).second
);
1042 have
+= (*it
).first
;
1047 // ok fine, drill into replicated dirs
1048 for (list
<CDir
*>::iterator it
= bigger_rep
.begin();
1049 it
!= bigger_rep
.end();
1051 dout(7) << " descending into replicated " << **it
<< dendl
;
1052 find_exports(*it
, amount
, exports
, have
, already_exporting
);
1059 void MDBalancer::hit_inode(utime_t now
, CInode
*in
, int type
, int who
)
1062 in
->pop
.get(type
).hit(now
, mds
->mdcache
->decayrate
);
1064 if (in
->get_parent_dn())
1065 hit_dir(now
, in
->get_parent_dn()->get_dir(), type
, who
);
1068 void MDBalancer::maybe_fragment(CDir
*dir
, bool hot
)
1071 if (g_conf
->mds_bal_frag
&& g_conf
->mds_bal_fragment_interval
> 0 &&
1072 !dir
->inode
->is_base() && // not root/base (for now at least)
1076 if (g_conf
->mds_bal_split_size
> 0 &&
1077 mds
->mdsmap
->allows_dirfrags() &&
1078 (dir
->should_split() || hot
))
1080 if (split_pending
.count(dir
->dirfrag()) == 0) {
1081 queue_split(dir
, false);
1083 if (dir
->should_split_fast()) {
1084 queue_split(dir
, true);
1086 dout(10) << __func__
<< ": fragment already enqueued to split: "
1093 if (dir
->get_frag() != frag_t() && dir
->should_merge() &&
1094 merge_pending
.count(dir
->dirfrag()) == 0) {
1100 void MDBalancer::hit_dir(utime_t now
, CDir
*dir
, int type
, int who
, double amount
)
1103 double v
= dir
->pop_me
.get(type
).hit(now
, amount
);
1105 const bool hot
= (v
> g_conf
->mds_bal_split_rd
&& type
== META_POP_IRD
) ||
1106 (v
> g_conf
->mds_bal_split_wr
&& type
== META_POP_IWR
);
1108 dout(20) << "hit_dir " << type
<< " pop is " << v
<< ", frag " << dir
->get_frag()
1109 << " size " << dir
->get_frag_size() << dendl
;
1111 maybe_fragment(dir
, hot
);
1114 if (type
== META_POP_IRD
&& who
>= 0) {
1115 dir
->pop_spread
.hit(now
, mds
->mdcache
->decayrate
, who
);
1118 double rd_adj
= 0.0;
1119 if (type
== META_POP_IRD
&&
1120 dir
->last_popularity_sample
< last_sample
) {
1121 double dir_pop
= dir
->pop_auth_subtree
.get(type
).get(now
, mds
->mdcache
->decayrate
); // hmm??
1122 dir
->last_popularity_sample
= last_sample
;
1123 double pop_sp
= dir
->pop_spread
.get(now
, mds
->mdcache
->decayrate
);
1124 dir_pop
+= pop_sp
* 10;
1126 //if (dir->ino() == inodeno_t(0x10000000002))
1128 dout(20) << "hit_dir " << type
<< " pop " << dir_pop
<< " spread " << pop_sp
1129 << " " << dir
->pop_spread
.last
[0]
1130 << " " << dir
->pop_spread
.last
[1]
1131 << " " << dir
->pop_spread
.last
[2]
1132 << " " << dir
->pop_spread
.last
[3]
1133 << " in " << *dir
<< dendl
;
1136 if (dir
->is_auth() && !dir
->is_ambiguous_auth()) {
1137 if (!dir
->is_rep() &&
1138 dir_pop
>= g_conf
->mds_bal_replicate_threshold
) {
1140 double rdp
= dir
->pop_me
.get(META_POP_IRD
).get(now
, mds
->mdcache
->decayrate
);
1141 rd_adj
= rdp
/ mds
->get_mds_map()->get_num_in_mds() - rdp
;
1142 rd_adj
/= 2.0; // temper somewhat
1144 dout(0) << "replicating dir " << *dir
<< " pop " << dir_pop
<< " .. rdp " << rdp
<< " adj " << rd_adj
<< dendl
;
1146 dir
->dir_rep
= CDir::REP_ALL
;
1147 mds
->mdcache
->send_dir_updates(dir
, true);
1149 // fixme this should adjust the whole pop hierarchy
1150 dir
->pop_me
.get(META_POP_IRD
).adjust(rd_adj
);
1151 dir
->pop_auth_subtree
.get(META_POP_IRD
).adjust(rd_adj
);
1154 if (dir
->ino() != 1 &&
1156 dir_pop
< g_conf
->mds_bal_unreplicate_threshold
) {
1158 dout(0) << "unreplicating dir " << *dir
<< " pop " << dir_pop
<< dendl
;
1160 dir
->dir_rep
= CDir::REP_NONE
;
1161 mds
->mdcache
->send_dir_updates(dir
);
1167 bool hit_subtree
= dir
->is_auth(); // current auth subtree (if any)
1168 bool hit_subtree_nested
= dir
->is_auth(); // all nested auth subtrees
1171 dir
->pop_nested
.get(type
).hit(now
, amount
);
1173 dir
->pop_nested
.get(META_POP_IRD
).adjust(now
, mds
->mdcache
->decayrate
, rd_adj
);
1176 dir
->pop_auth_subtree
.get(type
).hit(now
, amount
);
1178 dir
->pop_auth_subtree
.get(META_POP_IRD
).adjust(now
, mds
->mdcache
->decayrate
, rd_adj
);
1181 if (hit_subtree_nested
) {
1182 dir
->pop_auth_subtree_nested
.get(type
).hit(now
, mds
->mdcache
->decayrate
, amount
);
1184 dir
->pop_auth_subtree_nested
.get(META_POP_IRD
).adjust(now
, mds
->mdcache
->decayrate
, rd_adj
);
1187 if (dir
->is_subtree_root())
1188 hit_subtree
= false; // end of auth domain, stop hitting auth counters.
1190 if (dir
->inode
->get_parent_dn() == 0) break;
1191 dir
= dir
->inode
->get_parent_dn()->get_dir();
1197 * subtract off an exported chunk.
1198 * this excludes *dir itself (encode_export_dir should have take care of that)
1199 * we _just_ do the parents' nested counters.
1201 * NOTE: call me _after_ forcing *dir into a subtree root,
1202 * but _before_ doing the encode_export_dirs.
1204 void MDBalancer::subtract_export(CDir
*dir
, utime_t now
)
1206 dirfrag_load_vec_t subload
= dir
->pop_auth_subtree
;
1209 dir
= dir
->inode
->get_parent_dir();
1212 dir
->pop_nested
.sub(now
, mds
->mdcache
->decayrate
, subload
);
1213 dir
->pop_auth_subtree_nested
.sub(now
, mds
->mdcache
->decayrate
, subload
);
1218 void MDBalancer::add_import(CDir
*dir
, utime_t now
)
1220 dirfrag_load_vec_t subload
= dir
->pop_auth_subtree
;
1223 dir
= dir
->inode
->get_parent_dir();
1226 dir
->pop_nested
.add(now
, mds
->mdcache
->decayrate
, subload
);
1227 dir
->pop_auth_subtree_nested
.add(now
, mds
->mdcache
->decayrate
, subload
);