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
|
/**
* 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/db/query/optimizer/utils/reftracker_utils.h"
#include "mongo/db/query/optimizer/reference_tracker.h"
namespace mongo::optimizer {
/**
* Helper class used to extract variable references from a node.
*/
class NodeVariableTracker {
public:
template <typename T, typename... Ts>
ProjectionNameSet walk(const T&, Ts&&...) {
static_assert(!std::is_base_of_v<Node, T>, "Nodes must implement variable tracking");
// Default case: no variables.
return {};
}
ProjectionNameSet walk(const ScanNode& /*node*/, const ABT& /*binds*/) {
return {};
}
ProjectionNameSet walk(const ValueScanNode& /*node*/, const ABT& /*binds*/) {
return {};
}
ProjectionNameSet walk(const PhysicalScanNode& /*node*/, const ABT& /*binds*/) {
return {};
}
ProjectionNameSet walk(const CoScanNode& /*node*/) {
return {};
}
ProjectionNameSet walk(const IndexScanNode& /*node*/, const ABT& /*binds*/) {
return {};
}
ProjectionNameSet walk(const SeekNode& /*node*/, const ABT& /*binds*/, const ABT& refs) {
return extractFromABT(refs);
}
ProjectionNameSet walk(const MemoLogicalDelegatorNode& /*node*/) {
return {};
}
ProjectionNameSet walk(const MemoPhysicalDelegatorNode& /*node*/) {
return {};
}
ProjectionNameSet walk(const FilterNode& /*node*/, const ABT& /*child*/, const ABT& expr) {
return extractFromABT(expr);
}
ProjectionNameSet walk(const EvaluationNode& /*node*/, const ABT& /*child*/, const ABT& expr) {
return extractFromABT(expr);
}
ProjectionNameSet walk(const SargableNode& /*node*/,
const ABT& /*child*/,
const ABT& /*binds*/,
const ABT& refs) {
return extractFromABT(refs);
}
ProjectionNameSet walk(const RIDIntersectNode& /*node*/,
const ABT& /*leftChild*/,
const ABT& /*rightChild*/) {
return {};
}
ProjectionNameSet walk(const RIDUnionNode& /*node*/,
const ABT& /*leftChild*/,
const ABT& /*rightChild*/) {
return {};
}
ProjectionNameSet walk(const BinaryJoinNode& /*node*/,
const ABT& /*leftChild*/,
const ABT& /*rightChild*/,
const ABT& expr) {
return extractFromABT(expr);
}
ProjectionNameSet walk(const HashJoinNode& /*node*/,
const ABT& /*leftChild*/,
const ABT& /*rightChild*/,
const ABT& refs) {
return extractFromABT(refs);
}
ProjectionNameSet walk(const MergeJoinNode& /*node*/,
const ABT& /*leftChild*/,
const ABT& /*rightChild*/,
const ABT& refs) {
return extractFromABT(refs);
}
ProjectionNameSet walk(const SortedMergeNode& /*node*/,
const ABTVector& /*children*/,
const ABT& /*binder*/,
const ABT& refs) {
return extractFromABT(refs);
}
ProjectionNameSet walk(const NestedLoopJoinNode& /*node*/,
const ABT& /*leftChild*/,
const ABT& /*rightChild*/,
const ABT& expr) {
return extractFromABT(expr);
}
ProjectionNameSet walk(const UnionNode& /*node*/,
const ABTVector& /*children*/,
const ABT& /*binder*/,
const ABT& refs) {
return extractFromABT(refs);
}
ProjectionNameSet walk(const GroupByNode& /*node*/,
const ABT& /*child*/,
const ABT& /*aggBinder*/,
const ABT& aggRefs,
const ABT& /*groupbyBinder*/,
const ABT& groupbyRefs) {
ProjectionNameSet result;
extractFromABT(result, aggRefs);
extractFromABT(result, groupbyRefs);
return result;
}
ProjectionNameSet walk(const UnwindNode& /*node*/,
const ABT& /*child*/,
const ABT& /*binds*/,
const ABT& refs) {
return extractFromABT(refs);
}
ProjectionNameSet walk(const UniqueNode& /*node*/, const ABT& /*child*/, const ABT& refs) {
return extractFromABT(refs);
}
ProjectionNameSet walk(const SpoolProducerNode& /*node*/,
const ABT& /*child*/,
const ABT& /*filter*/,
const ABT& /*binds*/,
const ABT& refs) {
return extractFromABT(refs);
}
ProjectionNameSet walk(const SpoolConsumerNode& /*node*/, const ABT& /*binds*/) {
return {};
}
ProjectionNameSet walk(const CollationNode& /*node*/, const ABT& /*child*/, const ABT& refs) {
return extractFromABT(refs);
}
ProjectionNameSet walk(const LimitSkipNode& /*node*/, const ABT& /*child*/) {
return {};
}
ProjectionNameSet walk(const ExchangeNode& /*node*/, const ABT& /*child*/, const ABT& refs) {
return extractFromABT(refs);
}
ProjectionNameSet walk(const RootNode& /*node*/, const ABT& /*child*/, const ABT& refs) {
return extractFromABT(refs);
}
static ProjectionNameSet collect(const ABT& n) {
NodeVariableTracker tracker;
return algebra::walk<false>(n, tracker);
}
private:
void extractFromABT(ProjectionNameSet& vars, const ABT& v) {
// Mark variables as defined or not in this subtree.
ProjectionNameMap<bool> varHasDefinitionMap;
VariableEnvironment::walkVariables(
v,
[&](const Variable& var) { varHasDefinitionMap.emplace(var.name(), false); },
[&](const ProjectionName& definedVar) { varHasDefinitionMap[definedVar] = true; });
for (const auto& varHasDefinition : varHasDefinitionMap) {
if (!varHasDefinition.second) {
// We are interested in when the variable has no definition in this subtree of the
// ABT: either free variables, or variables defined on other nodes.
vars.insert(varHasDefinition.first);
}
}
}
ProjectionNameSet extractFromABT(const ABT& v) {
ProjectionNameSet result;
extractFromABT(result, v);
return result;
}
};
ProjectionNameSet collectVariableReferences(const ABT& n) {
return NodeVariableTracker::collect(n);
}
} // namespace mongo::optimizer
|
