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
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
|
// -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
// vim: ts=8 sw=2 smarttab
#include "osd_operation.h"
#include "common/Formatter.h"
#include "crimson/common/log.h"
#include "crimson/osd/osd_operations/client_request.h"
namespace {
seastar::logger& logger() {
return crimson::get_logger(ceph_subsys_osd);
}
}
namespace crimson::osd {
void OSDOperationRegistry::do_stop()
{
logger().info("OSDOperationRegistry::{}", __func__);
// we need to decouple visiting the registry from destructing
// ops because of the auto-unlink feature of boost::intrusive.
// the list shouldn't change while iterating due to constrains
// on iterator's validity.
constexpr auto historic_reg_index =
static_cast<size_t>(OperationTypeCode::historic_client_request);
auto& historic_registry = get_registry<historic_reg_index>();
std::vector<ClientRequest::ICRef> to_ref_down;
std::transform(std::begin(historic_registry), std::end(historic_registry),
std::back_inserter(to_ref_down),
[] (const Operation& op) {
return ClientRequest::ICRef{
static_cast<const ClientRequest*>(&op),
/* add_ref= */ false
};
});
last_of_recents = std::end(historic_registry);
// to_ref_down is going off
}
OSDOperationRegistry::OSDOperationRegistry()
: OperationRegistryT(seastar::this_shard_id())
{
constexpr auto historic_reg_index =
static_cast<size_t>(OperationTypeCode::historic_client_request);
auto& historic_registry = get_registry<historic_reg_index>();
last_of_recents = std::begin(historic_registry);
}
static auto get_duration(const ClientRequest& client_request)
{
// TODO: consider enhancing `CompletionEvent` with computing duration
// once -- when it's enetered.
return client_request.get_completed() - client_request.get_started();
}
void OSDOperationRegistry::put_historic(const ClientRequest& op)
{
// unlink the op from the client request registry. this is a part of
// the re-link procedure. finally it will be in historic registry.
constexpr auto client_reg_index =
static_cast<size_t>(OperationTypeCode::client_request);
constexpr auto historic_reg_index =
static_cast<size_t>(OperationTypeCode::historic_client_request);
auto& client_registry = get_registry<client_reg_index>();
auto& historic_registry = get_registry<historic_reg_index>();
historic_registry.splice(std::end(historic_registry),
client_registry,
client_registry.iterator_to(op));
ClientRequest::ICRef(
&op, /* add_ref= */true
).detach(); // yes, "leak" it for now!
// check whether the history size limit is not exceeded; if so, then
// purge the oldest op.
// NOTE: Operation uses the auto-unlink feature of boost::intrusive.
// NOTE: the cleaning happens in OSDOperationRegistry::do_stop()
using crimson::common::local_conf;
if (num_recent_ops >= local_conf()->osd_op_history_size) {
++last_of_recents;
++num_slow_ops;
} else {
++num_recent_ops;
}
if (num_slow_ops > local_conf()->osd_op_history_slow_op_size) {
// we're interested in keeping slowest ops. if the slow op history
// is disabled, the list will have only one element, so the full-blown
// search will boil down into `.front()`.
const auto fastest_historic_iter = std::min_element(
std::cbegin(historic_registry), last_of_recents,
[] (const auto& lop, const auto& rop) {
const auto& lclient_request = static_cast<const ClientRequest&>(lop);
const auto& rclient_request = static_cast<const ClientRequest&>(rop);
return get_duration(lclient_request) < get_duration(rclient_request);
});
assert(fastest_historic_iter != std::end(historic_registry));
const auto& fastest_historic_op =
static_cast<const ClientRequest&>(*fastest_historic_iter);
historic_registry.erase(fastest_historic_iter);
// clear a previously "leaked" op
ClientRequest::ICRef(&fastest_historic_op, /* add_ref= */false);
--num_slow_ops;
}
}
size_t OSDOperationRegistry::dump_historic_client_requests(ceph::Formatter* f) const
{
const auto& historic_client_registry =
get_registry<static_cast<size_t>(OperationTypeCode::historic_client_request)>(); //ClientRequest::type)>();
f->open_object_section("op_history");
f->dump_int("size", historic_client_registry.size());
// TODO: f->dump_int("duration", history_duration.load());
// the intrusive list is configured to not store the size
size_t ops_count = 0;
{
f->open_array_section("ops");
for (const auto& op : historic_client_registry) {
op.dump(f);
++ops_count;
}
f->close_section();
}
f->close_section();
return ops_count;
}
size_t OSDOperationRegistry::dump_slowest_historic_client_requests(ceph::Formatter* f) const
{
const auto& historic_client_registry =
get_registry<static_cast<size_t>(OperationTypeCode::historic_client_request)>(); //ClientRequest::type)>();
f->open_object_section("op_history");
f->dump_int("size", historic_client_registry.size());
// TODO: f->dump_int("duration", history_duration.load());
// the intrusive list is configured to not store the size
std::multimap<utime_t,
const ClientRequest*,
std::greater<utime_t>> sorted_slowest_ops;
// iterating over the entire registry as a slow op could be also
// in the "recently added" part.
std::transform(std::begin(historic_client_registry),
std::end(historic_client_registry),
std::inserter(sorted_slowest_ops, std::end(sorted_slowest_ops)),
[] (const Operation& op) {
const auto& cop = static_cast<const ClientRequest&>(op);
return std::make_pair(get_duration(cop), &cop);
});
f->open_array_section("ops");
using crimson::common::local_conf;
size_t ops_count = 0;
for (auto it = std::begin(sorted_slowest_ops);
ops_count < local_conf()->osd_op_history_slow_op_size
&& it != std::end(sorted_slowest_ops);
++it, ++ops_count)
{
it->second->dump(f);
}
f->close_section();
return ops_count;
}
OperationThrottler::OperationThrottler(ConfigProxy &conf)
: scheduler(crimson::osd::scheduler::make_scheduler(conf))
{
conf.add_observer(this);
update_from_config(conf);
}
void OperationThrottler::wake()
{
while ((!max_in_progress || in_progress < max_in_progress) &&
!scheduler->empty()) {
auto item = scheduler->dequeue();
item.wake.set_value();
++in_progress;
--pending;
}
}
void OperationThrottler::release_throttle()
{
ceph_assert(in_progress > 0);
--in_progress;
wake();
}
seastar::future<> OperationThrottler::acquire_throttle(
crimson::osd::scheduler::params_t params)
{
crimson::osd::scheduler::item_t item{params, seastar::promise<>()};
auto fut = item.wake.get_future();
scheduler->enqueue(std::move(item));
return fut;
}
void OperationThrottler::dump_detail(Formatter *f) const
{
f->dump_unsigned("max_in_progress", max_in_progress);
f->dump_unsigned("in_progress", in_progress);
f->open_object_section("scheduler");
{
scheduler->dump(*f);
}
f->close_section();
}
void OperationThrottler::update_from_config(const ConfigProxy &conf)
{
max_in_progress = conf.get_val<uint64_t>("crimson_osd_scheduler_concurrency");
wake();
}
const char** OperationThrottler::get_tracked_conf_keys() const
{
static const char* KEYS[] = {
"crimson_osd_scheduler_concurrency",
NULL
};
return KEYS;
}
void OperationThrottler::handle_conf_change(
const ConfigProxy& conf,
const std::set<std::string> &changed)
{
update_from_config(conf);
}
}
|
