2011-12-16 00:04:31 +05:30
|
|
|
// Copyright (C) 2011 Red Hat, Inc. All rights reserved.
|
2011-12-06 19:23:05 +05:30
|
|
|
//
|
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/>.
|
|
|
|
|
2011-11-09 15:51:25 +05:30
|
|
|
#ifndef BLOCK_COUNTER_H
|
|
|
|
#define BLOCK_COUNTER_H
|
|
|
|
|
2020-07-27 08:18:54 +05:30
|
|
|
#include "base/run_set.h"
|
2011-11-09 15:51:25 +05:30
|
|
|
#include "block.h"
|
|
|
|
|
|
|
|
//----------------------------------------------------------------
|
|
|
|
|
|
|
|
namespace persistent_data {
|
|
|
|
//----------------------------------------------------------------
|
|
|
|
// Little helper class that keeps track of how many times blocks
|
|
|
|
// are referenced.
|
|
|
|
//----------------------------------------------------------------
|
|
|
|
class block_counter {
|
|
|
|
public:
|
|
|
|
typedef std::map<block_address, unsigned> count_map;
|
|
|
|
|
2020-08-11 17:11:41 +05:30
|
|
|
block_counter(): stop_on_error_(false) {}
|
|
|
|
|
|
|
|
block_counter(bool stop_on_error)
|
|
|
|
: stop_on_error_(stop_on_error) {
|
|
|
|
}
|
|
|
|
|
2016-02-27 12:52:09 +05:30
|
|
|
virtual ~block_counter() {}
|
|
|
|
|
|
|
|
virtual void inc(block_address b) {
|
2011-11-09 15:51:25 +05:30
|
|
|
count_map::iterator it = counts_.find(b);
|
|
|
|
if (it == counts_.end())
|
2017-04-29 23:21:52 +05:30
|
|
|
counts_.insert(std::make_pair(b, 1));
|
2011-11-09 15:51:25 +05:30
|
|
|
else
|
|
|
|
it->second++;
|
|
|
|
}
|
|
|
|
|
2016-02-27 12:52:09 +05:30
|
|
|
virtual unsigned get_count(block_address b) const {
|
2011-11-09 15:51:25 +05:30
|
|
|
count_map::const_iterator it = counts_.find(b);
|
|
|
|
return (it == counts_.end()) ? 0 : it->second;
|
|
|
|
}
|
|
|
|
|
|
|
|
count_map const &get_counts() const {
|
|
|
|
return counts_;
|
|
|
|
}
|
|
|
|
|
2020-08-11 17:11:41 +05:30
|
|
|
virtual bool stop_on_error() {
|
|
|
|
return stop_on_error_;
|
|
|
|
}
|
|
|
|
|
2020-08-16 23:02:55 +05:30
|
|
|
virtual void clear() {
|
|
|
|
counts_.clear();
|
|
|
|
}
|
|
|
|
|
2011-11-09 15:51:25 +05:30
|
|
|
private:
|
|
|
|
count_map counts_;
|
2020-08-11 17:11:41 +05:30
|
|
|
bool stop_on_error_;
|
2011-11-09 15:51:25 +05:30
|
|
|
};
|
2016-02-27 12:52:09 +05:30
|
|
|
|
|
|
|
//----------------------------------------------------------------
|
|
|
|
// Little helper class that keeps track of which blocks
|
|
|
|
// are referenced.
|
|
|
|
//----------------------------------------------------------------
|
|
|
|
class binary_block_counter : public block_counter {
|
|
|
|
public:
|
|
|
|
virtual ~binary_block_counter() {}
|
|
|
|
|
|
|
|
virtual void inc(block_address b) {
|
|
|
|
visited_.add(b);
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual unsigned get_count(block_address b) const {
|
|
|
|
return visited_.member(b) ? 1 : 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
base::run_set<block_address> const& get_visited() const {
|
|
|
|
return visited_;
|
|
|
|
}
|
2020-08-16 23:02:55 +05:30
|
|
|
|
|
|
|
virtual void clear() {
|
|
|
|
visited_.clear();
|
|
|
|
}
|
|
|
|
|
2016-02-27 12:52:09 +05:30
|
|
|
private:
|
|
|
|
base::run_set<block_address> visited_;
|
|
|
|
};
|
2011-11-09 15:51:25 +05:30
|
|
|
}
|
|
|
|
|
|
|
|
//----------------------------------------------------------------
|
|
|
|
|
|
|
|
#endif
|