{
if (pg_log.get_missing().missing.count(soid))
return true;
- assert(actingbackfill.size() > 0);
+ assert(!actingbackfill.empty());
for (set<pg_shard_t>::iterator i = actingbackfill.begin();
i != actingbackfill.end();
++i) {
<< ", recovering"
<< dendl;
eversion_t v;
- assert(actingbackfill.size() > 0);
+ assert(!actingbackfill.empty());
for (set<pg_shard_t>::iterator i = actingbackfill.begin();
i != actingbackfill.end();
++i) {
for (vector<int>::iterator p = acting.begin(); p != acting.end(); ++p)
f->dump_unsigned("osd", *p);
f->close_section();
- if (backfill_targets.size() > 0) {
+ if (!backfill_targets.empty()) {
f->open_array_section("backfill_targets");
for (set<pg_shard_t>::iterator p = backfill_targets.begin();
p != backfill_targets.end();
f->dump_stream("shard") << *p;
f->close_section();
}
- if (actingbackfill.size() > 0) {
+ if (!actingbackfill.empty()) {
f->open_array_section("actingbackfill");
for (set<pg_shard_t>::iterator p = actingbackfill.begin();
p != actingbackfill.end();
v = pg_log.get_missing().missing.find(oid)->second.have;
dout(10) << "pick_newest_available " << oid << " " << v << " on osd." << osd->whoami << " (local)" << dendl;
- assert(actingbackfill.size() > 0);
+ assert(!actingbackfill.empty());
for (set<pg_shard_t>::iterator i = actingbackfill.begin();
i != actingbackfill.end();
++i) {
pg_log.missing_add(soid, v, eversion_t());
missing_loc.remove_location(soid, pg_whoami);
bool uhoh = true;
- assert(actingbackfill.size() > 0);
+ assert(!actingbackfill.empty());
for (set<pg_shard_t>::iterator i = actingbackfill.begin();
i != actingbackfill.end();
++i) {
PGBackend::RecoveryHandle *h = pgbackend->open_recovery_op();
// this is FAR from an optimal recovery order. pretty lame, really.
- assert(actingbackfill.size() > 0);
+ assert(!actingbackfill.empty());
for (set<pg_shard_t>::iterator i = actingbackfill.begin();
i != actingbackfill.end();
++i) {