alloc = Allocator::create("stupid");
uint64_t num = 0, bytes = 0;
- const map<uint64_t,uint64_t>& fl = fm->get_freelist();
+ const auto& fl = fm->get_freelist();
for (auto& p : fl) {
alloc->init_add_free(p.first, p.second);
++num;
dout(1) << __func__ << " checking freelist vs allocated" << dendl;
{
- const map<uint64_t,uint64_t>& free = fm->get_freelist();
- for (map<uint64_t,uint64_t>::const_iterator p = free.begin();
+ const auto& free = fm->get_freelist();
+ for (auto p = free.begin();
p != free.end(); ++p) {
if (used_blocks.intersects(p->first, p->second)) {
derr << __func__ << " free extent " << p->first << "~" << p->second
Mutex::Locker l(lock);
dout(30) << __func__ << " " << total_free
<< " in " << kv_free.size() << " extents" << dendl;
- for (std::map<uint64_t,uint64_t>::iterator p = kv_free.begin();
+ for (auto p = kv_free.begin();
p != kv_free.end();
++p) {
dout(30) << __func__ << " " << p->first << "~" << p->second << dendl;
Mutex::Locker l(lock);
dout(10) << __func__ << " " << offset << "~" << length << dendl;
total_free -= length;
- map<uint64_t,uint64_t>::iterator p = kv_free.lower_bound(offset);
+ auto p = kv_free.lower_bound(offset);
if ((p == kv_free.end() || p->first > offset) &&
p != kv_free.begin()) {
--p;
Mutex::Locker l(lock);
dout(10) << __func__ << " " << offset << "~" << length << dendl;
total_free += length;
- map<uint64_t,uint64_t>::iterator p = kv_free.lower_bound(offset);
+ auto p = kv_free.lower_bound(offset);
// contiguous with previous extent?
if (p != kv_free.begin()) {