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
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
|
/**
* Copyright (C) 2018-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.
*/
#define MONGO_LOG_DEFAULT_COMPONENT ::mongo::logger::LogComponent::kDefault
#include "mongo/platform/basic.h"
#include "mongo/util/concurrency/ticketholder.h"
#include <iostream>
#include "mongo/util/log.h"
#include "mongo/util/str.h"
namespace mongo {
#if defined(__linux__)
namespace {
/**
* Accepts an errno code, prints its error message, and exits.
*/
void failWithErrno(int err) {
severe() << "error in Ticketholder: " << errnoWithDescription(err);
fassertFailed(28604);
}
/*
* Checks the return value from a Linux semaphore function call, and fails with the set errno if the
* call was unsucessful.
*/
void check(int ret) {
if (ret == 0)
return;
failWithErrno(errno);
}
/**
* Takes a Date_t deadline and sets the appropriate values in a timespec structure.
*/
void tsFromDate(const Date_t& deadline, struct timespec& ts) {
ts.tv_sec = deadline.toTimeT();
ts.tv_nsec = (deadline.toMillisSinceEpoch() % 1000) * 1'000'000;
}
} // namespace
TicketHolder::TicketHolder(int num) : _outof(num) {
check(sem_init(&_sem, 0, num));
}
TicketHolder::~TicketHolder() {
check(sem_destroy(&_sem));
}
bool TicketHolder::tryAcquire() {
while (0 != sem_trywait(&_sem)) {
if (errno == EAGAIN)
return false;
if (errno != EINTR)
failWithErrno(errno);
}
return true;
}
void TicketHolder::waitForTicket(OperationContext* opCtx) {
waitForTicketUntil(opCtx, Date_t::max());
}
bool TicketHolder::waitForTicketUntil(OperationContext* opCtx, Date_t until) {
const Milliseconds intervalMs(500);
struct timespec ts;
// To support interrupting ticket acquisition while still benefiting from semaphores, we do a
// timed wait on an interval to periodically check for interrupts.
// The wait period interval is the smaller of the default interval and the provided
// deadline.
Date_t deadline = std::min(until, Date_t::now() + intervalMs);
tsFromDate(deadline, ts);
while (0 != sem_timedwait(&_sem, &ts)) {
if (errno == ETIMEDOUT) {
// If we reached the deadline without being interrupted, we have completely timed out.
if (deadline == until)
return false;
deadline = std::min(until, Date_t::now() + intervalMs);
tsFromDate(deadline, ts);
} else if (errno != EINTR) {
failWithErrno(errno);
}
// To correctly handle errors from sem_timedwait, we should check for interrupts last.
// It is possible to unset 'errno' after a call to checkForInterrupt().
if (opCtx)
opCtx->checkForInterrupt();
}
return true;
}
void TicketHolder::release() {
check(sem_post(&_sem));
}
Status TicketHolder::resize(int newSize) {
stdx::lock_guard<Latch> lk(_resizeMutex);
if (newSize < 5)
return Status(ErrorCodes::BadValue,
str::stream() << "Minimum value for semaphore is 5; given " << newSize);
if (newSize > SEM_VALUE_MAX)
return Status(ErrorCodes::BadValue,
str::stream() << "Maximum value for semaphore is " << SEM_VALUE_MAX
<< "; given " << newSize);
while (_outof.load() < newSize) {
release();
_outof.fetchAndAdd(1);
}
while (_outof.load() > newSize) {
waitForTicket();
_outof.subtractAndFetch(1);
}
invariant(_outof.load() == newSize);
return Status::OK();
}
int TicketHolder::available() const {
int val = 0;
check(sem_getvalue(&_sem, &val));
return val;
}
int TicketHolder::used() const {
return outof() - available();
}
int TicketHolder::outof() const {
return _outof.load();
}
#else
TicketHolder::TicketHolder(int num) : _outof(num), _num(num) {}
TicketHolder::~TicketHolder() = default;
bool TicketHolder::tryAcquire() {
stdx::lock_guard<Latch> lk(_mutex);
return _tryAcquire();
}
void TicketHolder::waitForTicket(OperationContext* opCtx) {
stdx::unique_lock<Latch> lk(_mutex);
if (opCtx) {
opCtx->waitForConditionOrInterrupt(_newTicket, lk, [this] { return _tryAcquire(); });
} else {
_newTicket.wait(lk, [this] { return _tryAcquire(); });
}
}
bool TicketHolder::waitForTicketUntil(OperationContext* opCtx, Date_t until) {
stdx::unique_lock<Latch> lk(_mutex);
if (opCtx) {
return opCtx->waitForConditionOrInterruptUntil(
_newTicket, lk, until, [this] { return _tryAcquire(); });
} else {
return _newTicket.wait_until(
lk, until.toSystemTimePoint(), [this] { return _tryAcquire(); });
}
}
void TicketHolder::release() {
{
stdx::lock_guard<Latch> lk(_mutex);
_num++;
}
_newTicket.notify_one();
}
Status TicketHolder::resize(int newSize) {
stdx::lock_guard<Latch> lk(_mutex);
int used = _outof.load() - _num;
if (used > newSize) {
std::stringstream ss;
ss << "can't resize since we're using (" << used << ") "
<< "more than newSize(" << newSize << ")";
std::string errmsg = ss.str();
log() << errmsg;
return Status(ErrorCodes::BadValue, errmsg);
}
_outof.store(newSize);
_num = _outof.load() - used;
// Potentially wasteful, but easier to see is correct
_newTicket.notify_all();
return Status::OK();
}
int TicketHolder::available() const {
return _num;
}
int TicketHolder::used() const {
return outof() - _num;
}
int TicketHolder::outof() const {
return _outof.load();
}
bool TicketHolder::_tryAcquire() {
if (_num <= 0) {
if (_num < 0) {
std::cerr << "DISASTER! in TicketHolder" << std::endl;
}
return false;
}
_num--;
return true;
}
#endif
} // namespace mongo
|