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
|
/**
* Copyright (C) 2020-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/stage_builder_util.h"
#include "mongo/db/query/classic_stage_builder.h"
#include "mongo/db/query/plan_yield_policy.h"
#include "mongo/db/query/sbe_stage_builder.h"
#include "mongo/db/query/shard_filterer_factory_impl.h"
namespace mongo::stage_builder {
std::unique_ptr<PlanStage> buildClassicExecutableTree(OperationContext* opCtx,
const CollectionPtr& collection,
const CanonicalQuery& cq,
const QuerySolution& solution,
WorkingSet* ws) {
// Only QuerySolutions derived from queries parsed with context, or QuerySolutions derived from
// queries that disallow extensions, can be properly executed. If the query does not have
// $text/$where context (and $text/$where are allowed), then no attempt should be made to
// execute the query.
invariant(!cq.canHaveNoopMatchNodes());
invariant(solution.root());
invariant(ws);
auto builder = std::make_unique<ClassicStageBuilder>(opCtx, collection, cq, solution, ws);
return builder->build(solution.root());
}
std::pair<std::unique_ptr<sbe::PlanStage>, stage_builder::PlanStageData>
buildSlotBasedExecutableTree(OperationContext* opCtx,
const CollectionPtr& collection,
const CanonicalQuery& cq,
const QuerySolution& solution,
PlanYieldPolicy* yieldPolicy) {
// Only QuerySolutions derived from queries parsed with context, or QuerySolutions derived from
// queries that disallow extensions, can be properly executed. If the query does not have
// $text/$where context (and $text/$where are allowed), then no attempt should be made to
// execute the query.
invariant(!cq.canHaveNoopMatchNodes());
invariant(solution.root());
auto sbeYieldPolicy = dynamic_cast<PlanYieldPolicySBE*>(yieldPolicy);
invariant(sbeYieldPolicy);
auto shardFilterer = std::make_unique<ShardFiltererFactoryImpl>(collection);
auto builder = std::make_unique<SlotBasedStageBuilder>(
opCtx, collection, cq, solution, sbeYieldPolicy, shardFilterer.get());
auto root = builder->build(solution.root());
auto data = builder->getPlanStageData();
root->attachToOperationContext(opCtx);
auto expCtx = cq.getExpCtxRaw();
tassert(5327100, "No expression context", expCtx);
if (expCtx->explain || expCtx->mayDbProfile) {
root->markShouldCollectTimingInfo();
}
// Register this plan to yield according to the configured policy.
sbeYieldPolicy->registerPlan(root.get());
return {std::move(root), std::move(data)};
}
} // namespace mongo::stage_builder
|
