1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
|
// -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
// vim: ts=8 sw=2 smarttab
/*
* Ceph - scalable distributed file system
*
* Copyright (C) 2020 Red Hat <contact@redhat.com>
* Author: Adam C. Emerson
*
* This is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software
* Foundation. See file COPYING.
*
*/
#ifndef NEORADOS_RADOS_DECODABLE_HPP
#define NEORADOS_RADOS_DECODABLE_HPP
#include <cstdint>
#include <cstdlib>
#include <string>
#include <iostream>
#include <tuple>
#include <utility>
#include <vector>
#include <fmt/core.h>
#if FMT_VERSION >= 90000
#include <fmt/ostream.h>
#endif
namespace neorados {
struct Entry {
std::string nspace;
std::string oid;
std::string locator;
Entry() {}
Entry(std::string nspace, std::string oid, std::string locator) :
nspace(std::move(nspace)), oid(std::move(oid)), locator(locator) {}
};
inline bool operator ==(const Entry& l, const Entry r) {
return std::tie(l.nspace, l.oid, l.locator) ==
std::tie(r.nspace, r.oid, r.locator);
}
inline bool operator !=(const Entry& l, const Entry r) {
return std::tie(l.nspace, l.oid, l.locator) !=
std::tie(r.nspace, r.oid, r.locator);
}
inline bool operator <(const Entry& l, const Entry r) {
return std::tie(l.nspace, l.oid, l.locator) <
std::tie(r.nspace, r.oid, r.locator);
}
inline bool operator <=(const Entry& l, const Entry r) {
return std::tie(l.nspace, l.oid, l.locator) <=
std::tie(r.nspace, r.oid, r.locator);
}
inline bool operator >=(const Entry& l, const Entry r) {
return std::tie(l.nspace, l.oid, l.locator) >=
std::tie(r.nspace, r.oid, r.locator);
}
inline bool operator >(const Entry& l, const Entry r) {
return std::tie(l.nspace, l.oid, l.locator) >
std::tie(r.nspace, r.oid, r.locator);
}
inline std::ostream& operator <<(std::ostream& out, const Entry& entry) {
if (!entry.nspace.empty())
out << entry.nspace << '/';
out << entry.oid;
if (!entry.locator.empty())
out << '@' << entry.locator;
return out;
}
struct CloneInfo {
uint64_t cloneid = 0;
std::vector<uint64_t> snaps; // ascending
std::vector<std::pair<uint64_t, uint64_t>> overlap;// with next newest
uint64_t size = 0;
CloneInfo() = default;
};
struct SnapSet {
std::vector<CloneInfo> clones; // ascending
std::uint64_t seq = 0; // newest snapid seen by the object
SnapSet() = default;
};
struct ObjWatcher {
/// Address of the Watcher
std::string addr;
/// Watcher ID
std::int64_t watcher_id;
/// Cookie
std::uint64_t cookie;
/// Timeout in Seconds
std::uint32_t timeout_seconds;
};
}
namespace std {
template<>
struct hash<::neorados::Entry> {
std::size_t operator ()(::neorados::Entry e) const {
hash<std::string> h;
return (h(e.nspace) << 2) ^ (h(e.oid) << 1) ^ h(e.locator);
}
};
}
#if FMT_VERSION >= 90000
template <> struct fmt::formatter<neorados::Entry> : ostream_formatter {};
#endif
#endif // RADOS_DECODABLE_HPP
|
