// FIXME: this is ok in some situations, but let's not bother with that
// complexity now.
int ruleset = newcrush.get_rule_mask_ruleset(ruleno);
- if (osdmap.crush_ruleset_in_use(ruleset)) {
+ if (osdmap.crush_rule_in_use(ruleset)) {
ss << "crush ruleset " << name << " " << ruleset << " is in use";
err = -EBUSY;
goto reply;
out << " nearfull";
}
-bool OSDMap::crush_ruleset_in_use(int ruleset) const
+bool OSDMap::crush_rule_in_use(int rule_id) const
{
for (const auto &pool : pools) {
- if (pool.second.crush_rule == ruleset)
+ if (pool.second.crush_rule == rule_id)
return true;
}
return false;
set<int> rules;
for (auto &i: raw_rules) {
// exclude any dead rule
- if (crush_ruleset_in_use(i)) {
+ if (crush_rule_in_use(i)) {
rules.insert(i);
}
}
const string& root,
ostream *ss);
- bool crush_ruleset_in_use(int ruleset) const;
+ bool crush_rule_in_use(int rule_id) const;
void clear_temp() {
pg_temp->clear();