2012-03-08 22:50:46 +05:30
|
|
|
// Copyright (C) 2012 Red Hat, Inc. All rights reserved.
|
|
|
|
//
|
|
|
|
// 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/>.
|
|
|
|
|
|
|
|
#include <boost/algorithm/string/classification.hpp>
|
|
|
|
#include <boost/algorithm/string/split.hpp>
|
|
|
|
#include <boost/lexical_cast.hpp>
|
|
|
|
#include <boost/tuple/tuple.hpp>
|
2012-03-13 16:31:14 +05:30
|
|
|
#include <boost/variant.hpp>
|
2012-03-08 22:50:46 +05:30
|
|
|
#include <getopt.h>
|
|
|
|
#include <iostream>
|
|
|
|
#include <libgen.h>
|
|
|
|
#include <map>
|
|
|
|
#include <string>
|
|
|
|
#include <vector>
|
|
|
|
|
2013-01-12 00:56:51 +05:30
|
|
|
#include "persistent-data/data-structures/btree.h"
|
2013-01-02 18:25:41 +05:30
|
|
|
#include "thin-provisioning/metadata.h"
|
|
|
|
#include "thin-provisioning/metadata_checker.h"
|
2012-03-08 22:50:46 +05:30
|
|
|
#include "version.h"
|
|
|
|
|
|
|
|
using namespace boost;
|
|
|
|
using namespace persistent_data;
|
|
|
|
using namespace std;
|
|
|
|
using namespace thin_provisioning;
|
|
|
|
|
|
|
|
namespace {
|
|
|
|
typedef vector<string> strings;
|
|
|
|
|
2012-03-13 16:31:14 +05:30
|
|
|
class formatter {
|
2012-03-08 22:50:46 +05:30
|
|
|
public:
|
2012-03-13 16:31:14 +05:30
|
|
|
typedef shared_ptr<formatter> ptr;
|
|
|
|
|
|
|
|
virtual ~formatter() {}
|
2012-03-08 22:50:46 +05:30
|
|
|
|
|
|
|
typedef optional<string> maybe_string;
|
|
|
|
|
2012-03-13 16:31:14 +05:30
|
|
|
void field(string const &name, string const &value) {
|
|
|
|
fields_.push_back(field_type(name, value));
|
|
|
|
}
|
|
|
|
|
|
|
|
void child(string const &name, formatter::ptr t) {
|
|
|
|
fields_.push_back(field_type(name, t));
|
2012-03-08 22:50:46 +05:30
|
|
|
}
|
|
|
|
|
2012-03-13 16:31:14 +05:30
|
|
|
virtual void output(ostream &out, int depth = 0) = 0;
|
2012-03-08 22:50:46 +05:30
|
|
|
|
|
|
|
protected:
|
2012-03-13 16:31:14 +05:30
|
|
|
typedef variant<string, ptr> value;
|
|
|
|
typedef tuple<string, value> field_type;
|
2012-03-08 22:50:46 +05:30
|
|
|
|
|
|
|
vector<field_type> fields_;
|
|
|
|
};
|
|
|
|
|
|
|
|
template <typename T>
|
|
|
|
void
|
2012-03-13 16:31:14 +05:30
|
|
|
field(formatter &t, string const &name, T const &value) {
|
2012-03-08 22:50:46 +05:30
|
|
|
t.field(name, lexical_cast<string>(value));
|
|
|
|
}
|
|
|
|
|
|
|
|
//--------------------------------
|
|
|
|
|
2012-03-13 16:31:14 +05:30
|
|
|
class xml_formatter : public formatter {
|
2012-03-08 22:50:46 +05:30
|
|
|
public:
|
2012-03-13 16:31:14 +05:30
|
|
|
virtual void output(ostream &out, int depth) {
|
|
|
|
indent(depth, out);
|
|
|
|
out << "<fields>" << endl;
|
2012-03-08 22:50:46 +05:30
|
|
|
vector<field_type>::const_iterator it;
|
|
|
|
for (it = fields_.begin(); it != fields_.end(); ++it) {
|
2012-03-13 16:31:14 +05:30
|
|
|
if (string const *s = get<string>(&it->get<1>())) {
|
|
|
|
indent(depth + 1, out);
|
|
|
|
out << "<field key=\""
|
|
|
|
<< it->get<0>()
|
|
|
|
<< "\" value=\""
|
|
|
|
<< *s
|
|
|
|
<< "\"/>"
|
|
|
|
<< endl;
|
|
|
|
|
|
|
|
} else {
|
|
|
|
formatter::ptr f = get<formatter::ptr>(it->get<1>());
|
|
|
|
f->output(out, depth + 1);
|
|
|
|
}
|
2012-03-08 22:50:46 +05:30
|
|
|
}
|
2012-03-13 16:31:14 +05:30
|
|
|
|
|
|
|
indent(depth, out);
|
|
|
|
out << "</fields>" << endl;
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
void indent(int depth, ostream &out) const {
|
|
|
|
for (int i = 0; i < depth * 2; i++)
|
|
|
|
out << ' ';
|
2012-03-08 22:50:46 +05:30
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
//--------------------------------
|
|
|
|
|
|
|
|
class command {
|
|
|
|
public:
|
2020-04-30 19:32:43 +05:30
|
|
|
typedef std::shared_ptr<command> ptr;
|
2012-03-08 22:50:46 +05:30
|
|
|
|
|
|
|
virtual ~command() {}
|
|
|
|
virtual void exec(strings const &args, ostream &out) = 0;
|
|
|
|
};
|
|
|
|
|
|
|
|
class command_interpreter {
|
|
|
|
public:
|
|
|
|
command_interpreter(istream &in, ostream &out)
|
|
|
|
: in_(in),
|
|
|
|
out_(out) {
|
|
|
|
}
|
|
|
|
|
|
|
|
void register_command(string const &str, command::ptr cmd) {
|
|
|
|
commands_.insert(make_pair(str, cmd));
|
|
|
|
}
|
|
|
|
|
|
|
|
void enter_main_loop() {
|
|
|
|
while (true)
|
|
|
|
do_once();
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
strings read_input() {
|
|
|
|
using namespace boost::algorithm;
|
|
|
|
|
|
|
|
string input;
|
|
|
|
getline(in_, input);
|
|
|
|
|
|
|
|
strings toks;
|
|
|
|
split(toks, input, is_any_of(" \t"), token_compress_on);
|
|
|
|
|
|
|
|
return toks;
|
|
|
|
}
|
|
|
|
|
|
|
|
void do_once() {
|
|
|
|
if (in_.eof())
|
|
|
|
throw runtime_error("input closed");
|
|
|
|
|
|
|
|
out_ << "> ";
|
|
|
|
strings args = read_input();
|
|
|
|
|
|
|
|
map<string, command::ptr>::iterator it;
|
|
|
|
it = commands_.find(args[0]);
|
|
|
|
if (it == commands_.end())
|
|
|
|
out_ << "Unrecognised command" << endl;
|
|
|
|
else
|
|
|
|
it->second->exec(args, out_);
|
|
|
|
}
|
|
|
|
|
|
|
|
istream &in_;
|
|
|
|
ostream &out_;
|
|
|
|
map <string, command::ptr> commands_;
|
|
|
|
};
|
|
|
|
|
|
|
|
//--------------------------------
|
|
|
|
|
|
|
|
class hello : public command {
|
|
|
|
virtual void exec(strings const &args, ostream &out) {
|
|
|
|
out << "Hello, world!" << endl;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
class show_superblock : public command {
|
|
|
|
public:
|
|
|
|
explicit show_superblock(metadata::ptr md)
|
|
|
|
: md_(md) {
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual void exec(strings const &args, ostream &out) {
|
2012-03-13 16:31:14 +05:30
|
|
|
xml_formatter f;
|
2012-03-08 22:50:46 +05:30
|
|
|
|
|
|
|
superblock const &sb = md_->sb_;
|
|
|
|
|
|
|
|
field(f, "csum", sb.csum_);
|
|
|
|
field(f, "flags", sb.flags_);
|
|
|
|
field(f, "blocknr", sb.blocknr_);
|
|
|
|
field(f, "uuid", sb.uuid_); // FIXME: delimit, and handle non-printable chars
|
|
|
|
field(f, "magic", sb.magic_);
|
|
|
|
field(f, "version", sb.version_);
|
|
|
|
field(f, "time", sb.time_);
|
|
|
|
field(f, "trans id", sb.trans_id_);
|
2012-05-17 17:35:26 +05:30
|
|
|
field(f, "metadata snap", sb.metadata_snap_);
|
2012-03-08 22:50:46 +05:30
|
|
|
field(f, "data mapping root", sb.data_mapping_root_);
|
|
|
|
field(f, "device details root", sb.device_details_root_);
|
2012-03-13 16:31:14 +05:30
|
|
|
field(f, "data block size", sb.data_block_size_);
|
|
|
|
field(f, "metadata block size", sb.metadata_block_size_);
|
2012-03-08 22:50:46 +05:30
|
|
|
field(f, "metadata nr blocks", sb.metadata_nr_blocks_);
|
|
|
|
field(f, "compat flags", sb.compat_flags_);
|
|
|
|
field(f, "compat ro flags", sb.compat_ro_flags_);
|
|
|
|
field(f, "incompat flags", sb.incompat_flags_);
|
|
|
|
|
2012-03-13 16:31:14 +05:30
|
|
|
f.output(out, 0);
|
2012-03-08 22:50:46 +05:30
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
metadata::ptr md_;
|
|
|
|
};
|
|
|
|
|
2012-03-13 16:31:14 +05:30
|
|
|
class device_details_show_traits : public device_details_traits {
|
|
|
|
public:
|
|
|
|
static void show(formatter &f, string const &key, device_details const &value) {
|
|
|
|
field(f, "mapped blocks", value.mapped_blocks_);
|
|
|
|
field(f, "transaction id", value.transaction_id_);
|
|
|
|
field(f, "creation time", value.creation_time_);
|
|
|
|
field(f, "snap time", value.snapshotted_time_);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
class uint64_show_traits : public uint64_traits {
|
|
|
|
public:
|
|
|
|
static void show(formatter &f, string const &key, uint64_t const &value) {
|
|
|
|
field(f, key, lexical_cast<string>(value));
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
class block_show_traits : public block_traits {
|
|
|
|
public:
|
|
|
|
static void show(formatter &f, string const &key, block_time const &value) {
|
|
|
|
field(f, "block", value.block_);
|
|
|
|
field(f, "time", value.time_);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2012-03-08 22:50:46 +05:30
|
|
|
template <typename ValueTraits>
|
|
|
|
class show_btree_node : public command {
|
|
|
|
public:
|
|
|
|
explicit show_btree_node(metadata::ptr md)
|
|
|
|
: md_(md) {
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual void exec(strings const &args, ostream &out) {
|
|
|
|
using namespace persistent_data::btree_detail;
|
|
|
|
|
|
|
|
if (args.size() != 2)
|
|
|
|
throw runtime_error("incorrect number of arguments");
|
|
|
|
|
|
|
|
block_address block = lexical_cast<block_address>(args[1]);
|
|
|
|
block_manager<>::read_ref rr = md_->tm_->read_lock(block);
|
|
|
|
|
2012-03-13 16:31:14 +05:30
|
|
|
node_ref<uint64_show_traits> n = btree_detail::to_node<uint64_show_traits>(rr);
|
|
|
|
if (n.get_type() == INTERNAL)
|
|
|
|
show_node<uint64_show_traits>(n, out);
|
|
|
|
else {
|
|
|
|
node_ref<ValueTraits> n = btree_detail::to_node<ValueTraits>(rr);
|
|
|
|
show_node<ValueTraits>(n, out);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
template <typename VT>
|
|
|
|
void show_node(node_ref<VT> n, ostream &out) {
|
|
|
|
xml_formatter f;
|
2012-03-08 22:50:46 +05:30
|
|
|
|
|
|
|
field(f, "csum", n.get_checksum());
|
|
|
|
field(f, "blocknr", n.get_location());
|
|
|
|
field(f, "type", n.get_type() == INTERNAL ? "internal" : "leaf");
|
|
|
|
field(f, "nr entries", n.get_nr_entries());
|
|
|
|
field(f, "max entries", n.get_max_entries());
|
|
|
|
field(f, "value size", n.get_value_size());
|
|
|
|
|
2012-03-13 16:31:14 +05:30
|
|
|
for (unsigned i = 0; i < n.get_nr_entries(); i++) {
|
|
|
|
formatter::ptr f2(new xml_formatter);
|
|
|
|
field(*f2, "key", n.key_at(i));
|
|
|
|
VT::show(*f2, "value", n.value_at(i));
|
|
|
|
f.child("child", f2);
|
|
|
|
}
|
|
|
|
|
|
|
|
f.output(out, 0);
|
2012-03-08 22:50:46 +05:30
|
|
|
}
|
|
|
|
|
|
|
|
metadata::ptr md_;
|
|
|
|
};
|
|
|
|
|
|
|
|
//--------------------------------
|
|
|
|
|
|
|
|
int debug(string const &path) {
|
|
|
|
try {
|
|
|
|
metadata::ptr md(new metadata(path, metadata::OPEN));
|
|
|
|
command_interpreter interp(cin, cout);
|
|
|
|
interp.register_command("hello", command::ptr(new hello));
|
|
|
|
interp.register_command("superblock", command::ptr(new show_superblock(md)));
|
2012-03-13 16:31:14 +05:30
|
|
|
interp.register_command("m1_node", command::ptr(new show_btree_node<uint64_show_traits>(md)));
|
|
|
|
interp.register_command("m2_node", command::ptr(new show_btree_node<block_show_traits>(md)));
|
|
|
|
interp.register_command("detail_node", command::ptr(new show_btree_node<device_details_show_traits>(md)));
|
2012-03-08 22:50:46 +05:30
|
|
|
interp.enter_main_loop();
|
|
|
|
|
|
|
|
} catch (std::exception &e) {
|
|
|
|
cerr << e.what();
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void usage(string const &cmd) {
|
|
|
|
cerr << "Usage: " << cmd << " {device|file}" << endl
|
|
|
|
<< "Options:" << endl
|
|
|
|
<< " {-h|--help}" << endl
|
|
|
|
<< " {-V|--version}" << endl;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int main(int argc, char **argv)
|
|
|
|
{
|
|
|
|
int c;
|
|
|
|
const char shortopts[] = "hV";
|
|
|
|
const struct option longopts[] = {
|
|
|
|
{ "help", no_argument, NULL, 'h'},
|
|
|
|
{ "version", no_argument, NULL, 'V'},
|
|
|
|
{ NULL, no_argument, NULL, 0 }
|
|
|
|
};
|
|
|
|
|
|
|
|
while ((c = getopt_long(argc, argv, shortopts, longopts, NULL)) != -1) {
|
|
|
|
switch(c) {
|
|
|
|
case 'h':
|
|
|
|
usage(basename(argv[0]));
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
case 'V':
|
|
|
|
cerr << THIN_PROVISIONING_TOOLS_VERSION << endl;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (argc == optind) {
|
|
|
|
usage(basename(argv[0]));
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
|
|
|
|
return debug(argv[optind]);
|
|
|
|
}
|