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
|
// -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
// vim: ts=8 sw=2 smarttab
#include "crimson/common/log.h"
#include "crimson/os/seastore/lba_manager/btree/btree_range_pin.h"
namespace {
seastar::logger& logger() {
return crimson::get_logger(ceph_subsys_filestore);
}
}
namespace crimson::os::seastore::lba_manager::btree {
void btree_range_pin_t::take_pin(btree_range_pin_t &other)
{
assert(other.extent);
assert(other.pins);
other.pins->replace_pin(*this, other);
pins = other.pins;
other.pins = nullptr;
if (other.has_ref()) {
other.drop_ref();
acquire_ref();
}
}
btree_range_pin_t::~btree_range_pin_t()
{
assert(!pins == !is_linked());
assert(!ref);
if (pins) {
logger().debug("{}: removing {}", __func__, *this);
pins->remove_pin(*this, true);
}
extent = nullptr;
}
void btree_pin_set_t::replace_pin(btree_range_pin_t &to, btree_range_pin_t &from)
{
pins.replace_node(pins.iterator_to(from), to);
}
void btree_pin_set_t::remove_pin(btree_range_pin_t &pin, bool do_check_parent)
{
logger().debug("{}: {}", __func__, pin);
assert(pin.is_linked());
assert(pin.pins);
assert(!pin.ref);
pins.erase(pin);
pin.pins = nullptr;
if (do_check_parent) {
check_parent(pin);
}
}
btree_range_pin_t *btree_pin_set_t::maybe_get_parent(
const lba_node_meta_t &meta)
{
auto cmeta = meta;
cmeta.depth++;
auto iter = pins.upper_bound(cmeta, btree_range_pin_t::meta_cmp_t());
if (iter == pins.begin()) {
return nullptr;
} else {
--iter;
if (iter->range.is_parent_of(meta)) {
return &*iter;
} else {
return nullptr;
}
}
}
const btree_range_pin_t *btree_pin_set_t::maybe_get_first_child(
const lba_node_meta_t &meta) const
{
if (meta.depth == 0) {
return nullptr;
}
auto cmeta = meta;
cmeta.depth--;
auto iter = pins.lower_bound(cmeta, btree_range_pin_t::meta_cmp_t());
if (iter == pins.end()) {
return nullptr;
} else if (meta.is_parent_of(iter->range)) {
return &*iter;
} else {
return nullptr;
}
}
void btree_pin_set_t::release_if_no_children(btree_range_pin_t &pin)
{
assert(pin.is_linked());
if (maybe_get_first_child(pin.range) == nullptr) {
pin.drop_ref();
}
}
void btree_pin_set_t::add_pin(btree_range_pin_t &pin)
{
assert(!pin.is_linked());
assert(!pin.pins);
assert(!pin.ref);
auto [prev, inserted] = pins.insert(pin);
if (!inserted) {
logger().error("{}: unable to add {}, found {}", __func__, pin, *prev);
assert(0 == "impossible");
return;
}
pin.pins = this;
if (!pin.is_root()) {
auto *parent = maybe_get_parent(pin.range);
assert(parent);
if (!parent->has_ref()) {
logger().debug("{}: acquiring parent {}", __func__,
static_cast<void*>(parent));
parent->acquire_ref();
} else {
logger().debug("{}: parent has ref {}", __func__,
static_cast<void*>(parent));
}
}
if (maybe_get_first_child(pin.range) != nullptr) {
logger().debug("{}: acquiring self {}", __func__, pin);
pin.acquire_ref();
}
}
void btree_pin_set_t::retire(btree_range_pin_t &pin)
{
pin.drop_ref();
remove_pin(pin, false);
}
void btree_pin_set_t::check_parent(btree_range_pin_t &pin)
{
auto parent = maybe_get_parent(pin.range);
if (parent) {
logger().debug("{}: releasing parent {}", __func__, *parent);
release_if_no_children(*parent);
}
}
}
|
