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
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
|
/**
* 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::kCommand
#include "mongo/platform/basic.h"
#include "mongo/util/background.h"
#include <functional>
#include "mongo/config.h"
#include "mongo/stdx/condition_variable.h"
#include "mongo/stdx/mutex.h"
#include "mongo/stdx/thread.h"
#include "mongo/util/concurrency/idle_thread_block.h"
#include "mongo/util/concurrency/mutex.h"
#include "mongo/util/concurrency/spin_lock.h"
#include "mongo/util/concurrency/thread_name.h"
#include "mongo/util/debug_util.h"
#include "mongo/util/log.h"
#include "mongo/util/str.h"
#include "mongo/util/timer.h"
namespace mongo {
namespace {
class PeriodicTaskRunner : public BackgroundJob {
public:
PeriodicTaskRunner() : _shutdownRequested(false) {}
void add(PeriodicTask* task);
void remove(PeriodicTask* task);
Status stop(int gracePeriodMillis);
private:
virtual std::string name() const {
return "PeriodicTaskRunner";
}
virtual void run();
// Returns true if shutdown has been requested. You must hold _mutex to call this
// function.
bool _isShutdownRequested() const;
// Runs all registered tasks. You must hold _mutex to call this function.
void _runTasks();
// Runs one task to completion, and optionally reports timing. You must hold _mutex
// to call this function.
void _runTask(PeriodicTask* task);
// _mutex protects the _shutdownRequested flag and the _tasks vector.
stdx::mutex _mutex;
// The condition variable is used to sleep for the interval between task
// executions, and is notified when the _shutdownRequested flag is toggled.
stdx::condition_variable _cond;
// Used to break the loop. You should notify _cond after changing this to true
// so that shutdown proceeds promptly.
bool _shutdownRequested;
// The PeriodicTasks contained in this vector are NOT owned by the
// PeriodicTaskRunner, and are not deleted. The vector never shrinks, removed Tasks
// have their entry overwritten with NULL.
std::vector<PeriodicTask*> _tasks;
};
SimpleMutex* runnerMutex() {
static SimpleMutex mutex;
return &mutex;
}
// A scoped lock like object that only locks/unlocks the mutex if it exists.
class ConditionalScopedLock {
public:
ConditionalScopedLock(SimpleMutex* mutex) : _mutex(mutex) {
if (_mutex)
_mutex->lock();
}
~ConditionalScopedLock() {
if (_mutex)
_mutex->unlock();
}
private:
SimpleMutex* const _mutex;
};
// The unique PeriodicTaskRunner, also zero-initialized.
PeriodicTaskRunner* runner = nullptr;
// The runner is never re-created once it has been destroyed.
bool runnerDestroyed = false;
} // namespace
// both the BackgroundJob and the internal thread point to JobStatus
struct BackgroundJob::JobStatus {
JobStatus() : state(NotStarted) {}
stdx::mutex mutex;
stdx::condition_variable done;
State state;
};
BackgroundJob::BackgroundJob(bool selfDelete) : _selfDelete(selfDelete), _status(new JobStatus) {}
BackgroundJob::~BackgroundJob() {}
void BackgroundJob::jobBody() {
const std::string threadName = name();
if (!threadName.empty()) {
setThreadName(threadName);
}
LOG(1) << "BackgroundJob starting: " << threadName;
run();
// We must cache this value so that we can use it after we leave the following scope.
const bool selfDelete = _selfDelete;
{
// It is illegal to access any state owned by this BackgroundJob after leaving this
// scope, with the exception of the call to 'delete this' below.
stdx::unique_lock<stdx::mutex> l(_status->mutex);
_status->state = Done;
_status->done.notify_all();
}
if (selfDelete)
delete this;
}
void BackgroundJob::go() {
stdx::unique_lock<stdx::mutex> l(_status->mutex);
massert(17234,
str::stream() << "backgroundJob already running: " << name(),
_status->state != Running);
// If the job is already 'done', for instance because it was cancelled or already
// finished, ignore additional requests to run the job.
if (_status->state == NotStarted) {
stdx::thread{[this] { jobBody(); }}.detach();
_status->state = Running;
}
}
Status BackgroundJob::cancel() {
stdx::unique_lock<stdx::mutex> l(_status->mutex);
if (_status->state == Running)
return Status(ErrorCodes::IllegalOperation, "Cannot cancel a running BackgroundJob");
if (_status->state == NotStarted) {
_status->state = Done;
_status->done.notify_all();
}
return Status::OK();
}
bool BackgroundJob::wait(unsigned msTimeOut) {
verify(!_selfDelete); // you cannot call wait on a self-deleting job
const auto deadline = Date_t::now() + Milliseconds(msTimeOut);
stdx::unique_lock<stdx::mutex> l(_status->mutex);
while (_status->state != Done) {
if (msTimeOut) {
if (stdx::cv_status::timeout ==
_status->done.wait_until(l, deadline.toSystemTimePoint()))
return false;
} else {
_status->done.wait(l);
}
}
return true;
}
BackgroundJob::State BackgroundJob::getState() const {
stdx::unique_lock<stdx::mutex> l(_status->mutex);
return _status->state;
}
bool BackgroundJob::running() const {
stdx::unique_lock<stdx::mutex> l(_status->mutex);
return _status->state == Running;
}
// -------------------------
PeriodicTask::PeriodicTask() {
ConditionalScopedLock lock(runnerMutex());
if (runnerDestroyed)
return;
if (!runner)
runner = new PeriodicTaskRunner;
runner->add(this);
}
PeriodicTask::~PeriodicTask() {
ConditionalScopedLock lock(runnerMutex());
if (runnerDestroyed || !runner)
return;
runner->remove(this);
}
void PeriodicTask::startRunningPeriodicTasks() {
ConditionalScopedLock lock(runnerMutex());
if (runnerDestroyed)
return;
if (!runner)
runner = new PeriodicTaskRunner;
runner->go();
}
Status PeriodicTask::stopRunningPeriodicTasks(int gracePeriodMillis) {
ConditionalScopedLock lock(runnerMutex());
Status status = Status::OK();
if (runnerDestroyed || !runner)
return status;
runner->cancel().transitional_ignore();
status = runner->stop(gracePeriodMillis);
if (status.isOK()) {
delete runner;
runnerDestroyed = true;
}
return status;
}
void PeriodicTaskRunner::add(PeriodicTask* task) {
stdx::lock_guard<stdx::mutex> lock(_mutex);
_tasks.push_back(task);
}
void PeriodicTaskRunner::remove(PeriodicTask* task) {
stdx::lock_guard<stdx::mutex> lock(_mutex);
for (size_t i = 0; i != _tasks.size(); i++) {
if (_tasks[i] == task) {
_tasks[i] = NULL;
break;
}
}
}
Status PeriodicTaskRunner::stop(int gracePeriodMillis) {
{
stdx::lock_guard<stdx::mutex> lock(_mutex);
_shutdownRequested = true;
_cond.notify_one();
}
if (!wait(gracePeriodMillis)) {
return Status(ErrorCodes::ExceededTimeLimit,
"Grace period expired while waiting for PeriodicTasks to terminate");
}
return Status::OK();
}
void PeriodicTaskRunner::run() {
// Use a shorter cycle time in debug mode to help catch race conditions.
const Seconds waitTime(kDebugBuild ? 5 : 60);
stdx::unique_lock<stdx::mutex> lock(_mutex);
while (!_shutdownRequested) {
{
MONGO_IDLE_THREAD_BLOCK;
if (stdx::cv_status::timeout != _cond.wait_for(lock, waitTime.toSystemDuration()))
continue;
}
_runTasks();
}
}
bool PeriodicTaskRunner::_isShutdownRequested() const {
return _shutdownRequested;
}
void PeriodicTaskRunner::_runTasks() {
const size_t size = _tasks.size();
for (size_t i = 0; i != size; ++i)
if (PeriodicTask* const task = _tasks[i])
_runTask(task);
}
void PeriodicTaskRunner::_runTask(PeriodicTask* const task) {
Timer timer;
const std::string taskName = task->taskName();
try {
task->taskDoWork();
} catch (const std::exception& e) {
error() << "task: " << taskName << " failed: " << redact(e.what());
} catch (...) {
error() << "task: " << taskName << " failed with unknown error";
}
const int ms = timer.millis();
const int kMinLogMs = 100;
LOG(ms <= kMinLogMs ? 3 : 0) << "task: " << taskName << " took: " << ms << "ms";
}
} // namespace mongo
|