thin-provisioning-tools/persistent-data/transaction_manager.h

85 lines
2.5 KiB
C
Raw Normal View History

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/>.
#ifndef TRANSACTION_MANAGER_H
#define TRANSACTION_MANAGER_H
#include "block.h"
#include "space_map.h"
#include <set>
#include <boost/shared_ptr.hpp>
//----------------------------------------------------------------
namespace persistent_data {
2011-07-22 20:39:56 +05:30
class transaction_manager : boost::noncopyable {
public:
typedef boost::shared_ptr<transaction_manager> ptr;
2011-09-01 15:12:57 +05:30
typedef block_manager<>::read_ref read_ref;
typedef block_manager<>::write_ref write_ref;
2014-07-25 19:16:51 +05:30
typedef bcache::validator::ptr validator;
// If the space map is persistent, then the caller should
// hold onto a reference and remember to call sm_->commit()
// and update the superblock before dropping the superblock
// reference.
2011-09-01 15:12:57 +05:30
transaction_manager(block_manager<>::ptr bm,
space_map::ptr sm);
~transaction_manager();
// Drop the superblock reference to commit
write_ref begin(block_address superblock, validator v);
write_ref new_block(validator v);
// shadowing returns a new write_ref, and a boolean which
// indicates whether the children should be incremented.
std::pair<write_ref, bool> shadow(block_address orig, validator v);
read_ref read_lock(block_address b);
read_ref read_lock(block_address b, validator v);
space_map::ptr get_sm() {
return sm_;
}
void set_sm(space_map::ptr sm) {
sm_ = sm;
}
2011-09-01 15:12:57 +05:30
block_manager<>::ptr get_bm() {
2011-07-22 20:39:56 +05:30
return bm_;
}
private:
void add_shadow(block_address b);
void remove_shadow(block_address b);
bool is_shadow(block_address b) const;
void wipe_shadow_table();
2011-09-01 15:12:57 +05:30
block_manager<>::ptr bm_;
space_map::ptr sm_;
std::set<block_address> shadows_;
};
}
//----------------------------------------------------------------
#endif