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
|
/**
* 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.
*/
#include "mongo/platform/basic.h"
#include "mongo/db/query/find_common.h"
#include "mongo/s/query/blocking_results_merger.h"
namespace mongo {
BlockingResultsMerger::BlockingResultsMerger(OperationContext* opCtx,
AsyncResultsMergerParams&& armParams,
executor::TaskExecutor* executor)
: _tailableMode(armParams.getTailableMode().value_or(TailableModeEnum::kNormal)),
_executor(executor),
_arm(opCtx, executor, std::move(armParams)) {}
StatusWith<ClusterQueryResult> BlockingResultsMerger::awaitNextWithTimeout(
OperationContext* opCtx, RouterExecStage::ExecContext execCtx) {
invariant(_tailableMode == TailableModeEnum::kTailableAndAwaitData);
// If we are in kInitialFind or kGetMoreWithAtLeastOneResultInBatch context and the ARM is not
// ready, we don't block. Fall straight through to the return statement.
while (!_arm.ready() && execCtx == RouterExecStage::ExecContext::kGetMoreNoResultsYet) {
auto nextEventStatus = getNextEvent();
if (!nextEventStatus.isOK()) {
return nextEventStatus.getStatus();
}
auto event = nextEventStatus.getValue();
// Block until there are further results to return, or our time limit is exceeded.
auto waitStatus =
_executor->waitForEvent(opCtx, event, awaitDataState(opCtx).waitForInsertsDeadline);
if (!waitStatus.isOK()) {
return waitStatus.getStatus();
}
// Swallow timeout errors for tailable awaitData cursors, stash the event that we were
// waiting on, and return EOF.
if (waitStatus == stdx::cv_status::timeout) {
_leftoverEventFromLastTimeout = std::move(event);
return ClusterQueryResult{};
}
}
// We reach this point either if the ARM is ready, or if the ARM is !ready and we are in
// kInitialFind or kGetMoreWithAtLeastOneResultInBatch ExecContext. In the latter case, we
// return EOF immediately rather than blocking for further results.
return _arm.ready() ? _arm.nextReady() : ClusterQueryResult{};
}
StatusWith<ClusterQueryResult> BlockingResultsMerger::blockUntilNext(OperationContext* opCtx) {
while (!_arm.ready()) {
auto nextEventStatus = _arm.nextEvent();
if (!nextEventStatus.isOK()) {
return nextEventStatus.getStatus();
}
auto event = nextEventStatus.getValue();
// Block until there are further results to return.
auto status = _executor->waitForEvent(opCtx, event);
if (!status.isOK()) {
return status.getStatus();
}
// We have not provided a deadline, so if the wait returns without interruption, we do not
// expect to have timed out.
invariant(status.getValue() == stdx::cv_status::no_timeout);
}
return _arm.nextReady();
}
StatusWith<ClusterQueryResult> BlockingResultsMerger::next(OperationContext* opCtx,
RouterExecStage::ExecContext execCtx) {
// Non-tailable and tailable non-awaitData cursors always block until ready(). AwaitData
// cursors wait for ready() only until a specified time limit is exceeded.
return (_tailableMode == TailableModeEnum::kTailableAndAwaitData
? awaitNextWithTimeout(opCtx, execCtx)
: blockUntilNext(opCtx));
}
StatusWith<executor::TaskExecutor::EventHandle> BlockingResultsMerger::getNextEvent() {
// If we abandoned a previous event due to a mongoS-side timeout, wait for it first.
if (_leftoverEventFromLastTimeout) {
invariant(_tailableMode == TailableModeEnum::kTailableAndAwaitData);
// If we have an outstanding event from last time, then we might have to manually schedule
// some getMores for the cursors. If a remote response came back while we were between
// getMores (from the user to mongos), the response may have been an empty batch, and the
// ARM would not be able to ask for the next batch immediately since it is not attached to
// an OperationContext. Now that we have a valid OperationContext, we schedule the getMores
// ourselves.
Status getMoreStatus = _arm.scheduleGetMores();
if (!getMoreStatus.isOK()) {
return getMoreStatus;
}
// Return the leftover event and clear '_leftoverEventFromLastTimeout'.
auto event = _leftoverEventFromLastTimeout;
_leftoverEventFromLastTimeout = executor::TaskExecutor::EventHandle();
return event;
}
return _arm.nextEvent();
}
void BlockingResultsMerger::kill(OperationContext* opCtx) {
auto killEvent = _arm.kill(opCtx);
if (!killEvent) {
// We are shutting down.
return;
}
_executor->waitForEvent(killEvent);
}
} // namespace mongo
|
