down_cache = &local_down_cache;
}
- if (!subtree_is_down(id, down_cache)) {
- ldout(cct, 30) << "containing_subtree_is_down(" << id << ") = false" << dendl;
- return false;
- }
-
int current = id;
while (true) {
- // invariant: current subtree is known to be down.
int type;
if (current >= 0) {
type = 0;
}
assert(type >= 0);
+ if (!subtree_is_down(current, down_cache)) {
+ ldout(cct, 30) << "containing_subtree_is_down(" << id << ") = false" << dendl;
+ return false;
+ }
+
// is this a big enough subtree to be done?
if (type >= subtree_type) {
ldout(cct, 30) << "containing_subtree_is_down(" << id << ") = true ... " << type << " >= " << subtree_type << dendl;