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-06-23 19:17:08 +05:30
|
|
|
#ifndef SPACE_MAP_H
|
|
|
|
#define SPACE_MAP_H
|
|
|
|
|
2013-12-11 22:58:14 +05:30
|
|
|
#include "persistent-data/block.h"
|
|
|
|
#include "persistent-data/block_counter.h"
|
|
|
|
#include "persistent-data/run.h"
|
2011-06-23 19:17:08 +05:30
|
|
|
|
2011-11-16 18:23:37 +05:30
|
|
|
#include <boost/optional.hpp>
|
2013-01-11 02:35:10 +05:30
|
|
|
#include <functional>
|
2011-06-23 19:17:08 +05:30
|
|
|
|
|
|
|
//----------------------------------------------------------------
|
|
|
|
|
|
|
|
namespace persistent_data {
|
|
|
|
typedef uint32_t ref_t;
|
|
|
|
|
2013-01-11 02:35:10 +05:30
|
|
|
// FIXME: document these methods
|
|
|
|
|
2011-06-23 19:17:08 +05:30
|
|
|
class space_map {
|
|
|
|
public:
|
2020-04-30 19:32:43 +05:30
|
|
|
typedef std::shared_ptr<space_map> ptr;
|
2011-06-23 19:17:08 +05:30
|
|
|
|
|
|
|
virtual ~space_map() {};
|
|
|
|
|
|
|
|
virtual block_address get_nr_blocks() const = 0;
|
|
|
|
virtual block_address get_nr_free() const = 0;
|
|
|
|
virtual ref_t get_count(block_address b) const = 0;
|
|
|
|
virtual void set_count(block_address b, ref_t c) = 0;
|
|
|
|
virtual void commit() = 0;
|
|
|
|
|
2011-07-13 21:29:12 +05:30
|
|
|
virtual void inc(block_address b) = 0;
|
|
|
|
virtual void dec(block_address b) = 0;
|
2011-11-16 18:23:37 +05:30
|
|
|
|
2020-05-26 12:59:52 +05:30
|
|
|
// slow default implementation
|
|
|
|
virtual void inc(block_address b, uint32_t count) {
|
|
|
|
for (uint32_t i = 0; i < count; i++)
|
|
|
|
inc(b);
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual void dec(block_address b, uint32_t count) {
|
|
|
|
for (uint32_t i = 0; i < count; i++)
|
|
|
|
dec(b);
|
|
|
|
}
|
|
|
|
|
2011-11-16 18:23:37 +05:30
|
|
|
// FIXME: change these to return an optional, failure is
|
|
|
|
// not that rare if we're restricting the area that's
|
|
|
|
// searched.
|
|
|
|
typedef boost::optional<block_address> maybe_block;
|
|
|
|
|
2013-01-11 02:35:10 +05:30
|
|
|
typedef std::pair<block_address, block_address> span;
|
|
|
|
typedef boost::optional<span> maybe_span;
|
|
|
|
|
|
|
|
struct span_iterator {
|
|
|
|
typedef boost::optional<span> maybe_span;
|
|
|
|
|
|
|
|
virtual maybe_span first() = 0;
|
|
|
|
virtual maybe_span next() = 0;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct single_span_iterator : public span_iterator {
|
|
|
|
single_span_iterator(span const &s)
|
|
|
|
: s_(s) {
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual maybe_span first() {
|
|
|
|
return maybe_span(s_);
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual maybe_span next() {
|
|
|
|
return maybe_span();
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
span s_;
|
|
|
|
};
|
|
|
|
|
|
|
|
// deliberately not virtual
|
|
|
|
maybe_block new_block() {
|
|
|
|
single_span_iterator it(span(0, get_nr_blocks()));
|
|
|
|
return new_block(it);
|
|
|
|
}
|
|
|
|
|
2013-04-23 15:27:47 +05:30
|
|
|
virtual maybe_block find_free(span_iterator &it) = 0;
|
2011-06-23 19:17:08 +05:30
|
|
|
|
|
|
|
virtual bool count_possibly_greater_than_one(block_address b) const = 0;
|
2011-08-15 16:21:49 +05:30
|
|
|
|
|
|
|
virtual void extend(block_address extra_blocks) = 0;
|
2011-10-25 15:57:59 +05:30
|
|
|
|
|
|
|
struct iterator {
|
|
|
|
virtual ~iterator() {}
|
|
|
|
|
|
|
|
virtual void operator() (block_address b, ref_t c) = 0;
|
|
|
|
};
|
|
|
|
|
|
|
|
virtual void iterate(iterator &it) const {
|
2013-01-11 02:35:10 +05:30
|
|
|
throw std::runtime_error("iterate() not implemented");
|
2011-10-25 15:57:59 +05:30
|
|
|
}
|
2013-04-23 15:27:47 +05:30
|
|
|
|
|
|
|
|
|
|
|
// This is a concrete method
|
|
|
|
maybe_block new_block(span_iterator &it) {
|
|
|
|
maybe_block mb = find_free(it);
|
|
|
|
|
|
|
|
if (mb)
|
|
|
|
inc(*mb);
|
|
|
|
|
|
|
|
return mb;
|
|
|
|
}
|
2011-06-23 19:17:08 +05:30
|
|
|
};
|
|
|
|
|
2013-12-11 22:58:14 +05:30
|
|
|
//--------------------------------
|
|
|
|
|
|
|
|
namespace space_map_detail {
|
|
|
|
class damage {
|
2014-11-15 18:15:14 +05:30
|
|
|
public:
|
2013-12-11 22:58:14 +05:30
|
|
|
virtual ~damage() {}
|
|
|
|
};
|
|
|
|
|
|
|
|
class missing_counts : public damage {
|
|
|
|
public:
|
|
|
|
missing_counts(base::run<block_address> &lost);
|
|
|
|
};
|
|
|
|
|
|
|
|
class visitor {
|
|
|
|
public:
|
|
|
|
virtual ~visitor() {}
|
|
|
|
virtual void visit(missing_counts const &mc) = 0;
|
|
|
|
virtual void visit(block_address b, uint32_t count) = 0;
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
|
|
|
//--------------------------------
|
|
|
|
|
2011-07-22 20:39:56 +05:30
|
|
|
class persistent_space_map : public space_map {
|
2011-06-23 19:17:08 +05:30
|
|
|
public:
|
2020-04-30 19:32:43 +05:30
|
|
|
typedef std::shared_ptr<persistent_space_map> ptr;
|
2011-07-22 20:39:56 +05:30
|
|
|
|
2014-02-19 21:38:05 +05:30
|
|
|
virtual void count_metadata(block_counter &bc) const = 0;
|
2011-11-16 18:47:23 +05:30
|
|
|
virtual size_t root_size() const = 0;
|
|
|
|
virtual void copy_root(void *dest, size_t len) const = 0;
|
2011-06-23 19:17:08 +05:30
|
|
|
};
|
2011-11-08 16:38:16 +05:30
|
|
|
|
2011-11-09 15:51:25 +05:30
|
|
|
class checked_space_map : public persistent_space_map {
|
|
|
|
public:
|
2020-04-30 19:32:43 +05:30
|
|
|
typedef std::shared_ptr<checked_space_map> ptr;
|
2011-11-09 15:51:25 +05:30
|
|
|
|
2013-12-11 22:58:14 +05:30
|
|
|
virtual void visit(space_map_detail::visitor &v) const {
|
|
|
|
throw std::runtime_error("space_map.visit not implemented");
|
2011-11-09 15:51:25 +05:30
|
|
|
}
|
2011-11-16 18:45:32 +05:30
|
|
|
|
2013-01-11 02:35:10 +05:30
|
|
|
// FIXME: should this be in the base space_map class?
|
2011-11-16 18:45:32 +05:30
|
|
|
virtual ptr clone() const = 0;
|
2011-11-09 15:51:25 +05:30
|
|
|
};
|
|
|
|
|
2011-11-08 16:38:16 +05:30
|
|
|
class sm_adjust {
|
|
|
|
public:
|
|
|
|
sm_adjust(space_map::ptr sm, block_address b, int delta)
|
|
|
|
: sm_(sm),
|
|
|
|
b_(b),
|
|
|
|
delta_(delta) {
|
|
|
|
|
|
|
|
adjust_count(delta_);
|
|
|
|
}
|
|
|
|
|
|
|
|
~sm_adjust() {
|
|
|
|
adjust_count(-delta_);
|
|
|
|
}
|
|
|
|
|
|
|
|
void release() {
|
|
|
|
delta_ = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
void adjust_count(int delta) {
|
|
|
|
if (delta == 1)
|
|
|
|
sm_->inc(b_);
|
|
|
|
|
|
|
|
else if (delta == -1)
|
|
|
|
sm_->dec(b_);
|
|
|
|
|
|
|
|
else
|
|
|
|
sm_->set_count(b_, sm_->get_count(b_) + delta);
|
|
|
|
}
|
|
|
|
|
|
|
|
space_map::ptr sm_;
|
|
|
|
block_address b_;
|
|
|
|
int delta_;
|
|
|
|
};
|
|
|
|
|
|
|
|
class sm_decrementer {
|
|
|
|
public:
|
|
|
|
sm_decrementer(space_map::ptr sm, block_address b);
|
|
|
|
~sm_decrementer();
|
|
|
|
void dont_bother();
|
|
|
|
|
|
|
|
private:
|
|
|
|
space_map::ptr sm_;
|
|
|
|
block_address b_;
|
|
|
|
bool released_;
|
|
|
|
};
|
2011-06-23 19:17:08 +05:30
|
|
|
}
|
|
|
|
|
|
|
|
//----------------------------------------------------------------
|
|
|
|
|
|
|
|
#endif
|