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
|
/**
* Copyright (C) 2022-present MongoDB, Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the Server Side Public License, version 1,
* as published by MongoDB, Inc.
*
* This program 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
* Server Side Public License for more details.
*
* You should have received a copy of the Server Side Public License
* along with this program. If not, see
* <http://www.mongodb.com/licensing/server-side-public-license>.
*
* As a special exception, the copyright holders give permission to link the
* code of portions of this program with the OpenSSL library under certain
* conditions as described in each individual source file and distribute
* linked combinations including the program with the OpenSSL library. You
* must comply with the Server Side Public License in all respects for
* all of the code used other than as permitted herein. If you modify file(s)
* with this exception, you may extend this exception to your version of the
* file(s), but you are not obligated to do so. If you do not wish to do so,
* delete this exception statement from your version. If you delete this
* exception statement from all source files in the program, then also delete
* it in the license file.
*/
#include "mongo/platform/basic.h"
#include "mongo/db/service_context.h"
#include "mongo/util/concurrency/admission_context.h"
#include "mongo/util/concurrency/priority_ticketholder.h"
#include <iostream>
#include "mongo/logv2/log.h"
#include "mongo/util/str.h"
#define MONGO_LOGV2_DEFAULT_COMPONENT ::mongo::logv2::LogComponent::kDefault
namespace mongo {
PriorityTicketHolder::PriorityTicketHolder(int32_t numTickets,
int32_t lowPriorityBypassThreshold,
ServiceContext* serviceContext)
: TicketHolder(numTickets, serviceContext),
_serviceContext(serviceContext),
_pool(numTickets, lowPriorityBypassThreshold) {}
int32_t PriorityTicketHolder::available() const {
return _pool.available();
}
int64_t PriorityTicketHolder::queued() const {
return _pool.queued();
}
int64_t PriorityTicketHolder::numFinishedProcessing() const {
return _stats[_enumToInt(QueueType::kLowPriority)].totalFinishedProcessing.load() +
_stats[_enumToInt(QueueType::kNormalPriority)].totalFinishedProcessing.load();
}
int64_t PriorityTicketHolder::expedited() const {
return _pool.getQueue().expedited();
}
int64_t PriorityTicketHolder::bypassed() const {
return _pool.getQueue().bypassed();
}
void PriorityTicketHolder::updateLowPriorityAdmissionBypassThreshold(int32_t newBypassThreshold) {
auto& queue = _pool.getQueue();
queue.updateLowPriorityAdmissionBypassThreshold(newBypassThreshold);
}
boost::optional<Ticket> PriorityTicketHolder::_tryAcquireImpl(AdmissionContext* admCtx) {
invariant(admCtx);
if (_pool.tryAcquire()) {
return Ticket(this, admCtx);
}
return boost::none;
}
boost::optional<Ticket> PriorityTicketHolder::_waitForTicketUntilImpl(OperationContext* opCtx,
AdmissionContext* admCtx,
Date_t until) {
invariant(admCtx);
while (true) {
// To support interruptibility of ticket acquisition, we attempt to acquire a ticket for a
// maximum period of time. This may or may not succeed, in which case we will retry until
// timing out or getting interrupted.
auto maxUntil = std::min(until, Date_t::now() + Milliseconds(500));
auto acquired = _pool.acquire(admCtx, maxUntil);
ScopeGuard rereleaseIfTimedOutOrInterrupted([&] {
// We may have gotten a ticket that we can't use, release it back to the ticket pool.
if (acquired) {
_pool.release();
}
});
if (opCtx) {
opCtx->checkForInterrupt();
}
if (acquired) {
rereleaseIfTimedOutOrInterrupted.dismiss();
return Ticket(this, admCtx);
} else if (maxUntil == until) {
// We hit the end of our deadline, so return nothing.
return boost::none;
}
// We hit the periodic deadline, but are still within the caller's deadline, so retry.
}
return boost::none;
}
void PriorityTicketHolder::_releaseToTicketPoolImpl(AdmissionContext* admCtx) noexcept {
// 'Immediate' priority operations should bypass the ticketing system completely.
invariant(admCtx && admCtx->getPriority() != AdmissionContext::Priority::kImmediate);
_pool.release();
}
void PriorityTicketHolder::_resize(int32_t newSize, int32_t oldSize) noexcept {
auto difference = newSize - oldSize;
if (difference > 0) {
// Hand out tickets one-by-one until we've given them all out.
for (auto remaining = difference; remaining > 0; remaining--) {
_pool.release();
}
} else {
AdmissionContext admCtx;
// Take tickets one-by-one without releasing.
for (auto remaining = -difference; remaining > 0; remaining--) {
_pool.acquire(&admCtx, Date_t::max());
}
}
}
TicketHolder::QueueStats& PriorityTicketHolder::_getQueueStatsToUse(
const AdmissionContext* admCtx) noexcept {
auto queueType = _getQueueType(admCtx);
return _stats[_enumToInt(queueType)];
}
void PriorityTicketHolder::_appendImplStats(BSONObjBuilder& b) const {
{
BSONObjBuilder bbb(b.subobjStart("lowPriority"));
const auto& lowPriorityTicketStats = _stats[_enumToInt(QueueType::kLowPriority)];
_appendCommonQueueImplStats(bbb, lowPriorityTicketStats);
bbb.append("expedited", expedited());
bbb.append("bypassed", bypassed());
bbb.done();
}
{
BSONObjBuilder bbb(b.subobjStart("normalPriority"));
const auto& normalPriorityTicketStats = _stats[_enumToInt(QueueType::kNormalPriority)];
_appendCommonQueueImplStats(bbb, normalPriorityTicketStats);
bbb.done();
}
}
} // namespace mongo
|
