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
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
|
// -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
// vim: ts=8 sw=2 smarttab
#pragma once
#include <iostream>
#include <boost/intrusive_ptr.hpp>
#include <boost/smart_ptr/intrusive_ref_counter.hpp>
#include <seastar/core/future.hh>
#include "include/ceph_assert.h"
#include "include/buffer_fwd.h"
#include "include/interval_set.h"
#include "common/interval_map.h"
#include "crimson/osd/exceptions.h"
#include "crimson/os/seastore/seastore_types.h"
#include "crimson/os/seastore/lba_manager.h"
#include "crimson/os/seastore/cache.h"
#include "crimson/os/seastore/segment_manager.h"
#include "crimson/os/seastore/lba_manager/btree/lba_btree_node.h"
namespace crimson::os::seastore::lba_manager::btree {
/**
* BtreeLBAManager
*
* Uses a wandering btree to track two things:
* 1) lba state including laddr_t -> paddr_t mapping
* 2) reverse paddr_t -> laddr_t mapping for gc (TODO)
*
* Generally, any transaction will involve
* 1) deltas against lba tree nodes
* 2) new lba tree nodes
* - Note, there must necessarily be a delta linking
* these new nodes into the tree -- might be a
* bootstrap_state_t delta if new root
*
* get_mappings, alloc_extent_*, etc populate a Transaction
* which then gets submitted
*/
class BtreeLBAManager : public LBAManager {
public:
BtreeLBAManager(
SegmentManager &segment_manager,
Cache &cache);
mkfs_ret mkfs(
Transaction &t) final;
get_mapping_ret get_mapping(
Transaction &t,
laddr_t offset, extent_len_t length) final;
get_mappings_ret get_mappings(
Transaction &t,
laddr_list_t &&list) final;
alloc_extent_ret alloc_extent(
Transaction &t,
laddr_t hint,
extent_len_t len,
paddr_t addr) final;
set_extent_ret set_extent(
Transaction &t,
laddr_t off, extent_len_t len, paddr_t addr) final;
ref_ret decref_extent(
Transaction &t,
laddr_t addr) final {
return update_refcount(t, addr, -1);
}
ref_ret incref_extent(
Transaction &t,
laddr_t addr) final {
return update_refcount(t, addr, 1);
}
complete_transaction_ret complete_transaction(
Transaction &t) final;
init_cached_extent_ret init_cached_extent(
Transaction &t,
CachedExtentRef e) final;
scan_mappings_ret scan_mappings(
Transaction &t,
laddr_t begin,
laddr_t end,
scan_mappings_func_t &&f) final;
scan_mapped_space_ret scan_mapped_space(
Transaction &t,
scan_mapped_space_func_t &&f) final;
rewrite_extent_ret rewrite_extent(
Transaction &t,
CachedExtentRef extent);
get_physical_extent_if_live_ret get_physical_extent_if_live(
Transaction &t,
extent_types_t type,
paddr_t addr,
laddr_t laddr,
segment_off_t len) final;
void add_pin(LBAPin &pin) final {
auto *bpin = reinterpret_cast<BtreeLBAPin*>(&pin);
pin_set.add_pin(bpin->pin);
bpin->parent = nullptr;
}
private:
SegmentManager &segment_manager;
Cache &cache;
btree_pin_set_t pin_set;
op_context_t get_context(Transaction &t) {
return op_context_t{cache, pin_set, t};
}
static btree_range_pin_t &get_pin(CachedExtent &e);
/**
* get_root
*
* Get a reference to the root LBANode.
*/
using get_root_ertr = Cache::get_extent_ertr;
using get_root_ret = get_root_ertr::future<LBANodeRef>;
get_root_ret get_root(Transaction &);
/**
* insert_mapping
*
* Insert a lba mapping into the tree
*/
using insert_mapping_ertr = crimson::errorator<
crimson::ct_error::input_output_error>;
using insert_mapping_ret = insert_mapping_ertr::future<LBAPinRef>;
insert_mapping_ret insert_mapping(
Transaction &t, ///< [in,out] transaction
LBANodeRef root, ///< [in] root node
laddr_t laddr, ///< [in] logical addr to insert
lba_map_val_t val ///< [in] mapping to insert
);
/**
* update_refcount
*
* Updates refcount, returns resulting refcount
*/
using update_refcount_ret = ref_ret;
update_refcount_ret update_refcount(
Transaction &t,
laddr_t addr,
int delta);
/**
* update_mapping
*
* Updates mapping, removes if f returns nullopt
*/
using update_mapping_ertr = ref_ertr;
using update_mapping_ret = ref_ertr::future<lba_map_val_t>;
using update_func_t = LBANode::mutate_func_t;
update_mapping_ret update_mapping(
Transaction &t,
laddr_t addr,
update_func_t &&f);
using update_internal_mapping_ertr = LBANode::mutate_internal_address_ertr;
using update_internal_mapping_ret = LBANode::mutate_internal_address_ret;
update_internal_mapping_ret update_internal_mapping(
Transaction &t,
depth_t depth,
laddr_t laddr,
paddr_t paddr);
};
using BtreeLBAManagerRef = std::unique_ptr<BtreeLBAManager>;
}
|
