thin-provisioning-tools/space_map_core.h

105 lines
2.3 KiB
C
Raw Normal View History

2011-12-06 19:23:05 +05:30
// Copyright (C) 20011 Red Hat, Inc. All rights reserved.
//
2011-12-06 19:13:56 +05:30
// This file is part of the thin-provisioning-tools source.
//
// thin-provisioning-tools is free software: you can redistribute it
// and/or modify it under the terms of the GNU General Public License
// as published by the Free Software Foundation, either version 3 of
// the License, or (at your option) any later version.
//
// thin-provisioning-tools is distributed in the hope that it will be
// useful, but WITHOUT ANY WARRANTY; without even the implied warranty
// of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License along
// with thin-provisioning-tools. If not, see
// <http://www.gnu.org/licenses/>.
#ifndef CORE_MAP_H
#define CORE_MAP_H
#include "space_map.h"
//----------------------------------------------------------------
namespace persistent_data {
class core_map : public space_map {
public:
core_map(block_address nr_blocks)
2011-07-13 21:29:12 +05:30
: counts_(nr_blocks, 0),
nr_free_(nr_blocks) {
}
block_address get_nr_blocks() const {
2011-07-13 21:29:12 +05:30
return counts_.size();
}
block_address get_nr_free() const {
2011-07-13 21:29:12 +05:30
return nr_free_;
}
ref_t get_count(block_address b) const {
return counts_[b];
}
void set_count(block_address b, ref_t c) {
2011-07-13 21:29:12 +05:30
if (counts_[b] == 0 && c > 0)
nr_free_--;
else if (counts_[b] > 0 && c == 0)
nr_free_++;
counts_[b] = c;
}
void commit() {
}
2011-07-13 21:29:12 +05:30
void inc(block_address b) {
if (counts_[b] == 0)
nr_free_--;
counts_[b]++;
}
2011-07-13 21:29:12 +05:30
void dec(block_address b) {
counts_[b]--;
2011-07-13 21:29:12 +05:30
if (counts_[b] == 0)
nr_free_++;
}
maybe_block new_block() {
return new_block(0, counts_.size());
}
maybe_block new_block(block_address begin, block_address end) {
for (block_address i = begin; i < min(end, counts_.size()); i++)
if (counts_[i] == 0) {
counts_[i] = 1;
2011-07-13 21:29:12 +05:30
nr_free_--;
return i;
}
2011-07-13 21:29:12 +05:30
return maybe_block();
}
bool count_possibly_greater_than_one(block_address b) const {
2011-07-13 21:29:12 +05:30
return counts_[b] > 1;
}
void extend(block_address extra_blocks) {
throw std::runtime_error("not implemented");
}
private:
std::vector<ref_t> counts_;
2011-07-13 21:29:12 +05:30
unsigned nr_free_;
};
}
//----------------------------------------------------------------
#endif