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
|
#include <Processors/QueryPlan/Optimizations/actionsDAGUtils.h>
#include <Core/Field.h>
#include <Functions/IFunction.h>
#include <Columns/ColumnConst.h>
#include <stack>
namespace DB
{
MatchedTrees::Matches matchTrees(const ActionsDAG & inner_dag, const ActionsDAG & outer_dag, bool check_monotonicity)
{
using Parents = std::set<const ActionsDAG::Node *>;
std::unordered_map<const ActionsDAG::Node *, Parents> inner_parents;
std::unordered_map<std::string_view, const ActionsDAG::Node *> inner_inputs;
{
std::stack<const ActionsDAG::Node *> stack;
for (const auto * out : inner_dag.getOutputs())
{
if (inner_parents.contains(out))
continue;
stack.push(out);
inner_parents.emplace(out, Parents());
while (!stack.empty())
{
const auto * node = stack.top();
stack.pop();
if (node->type == ActionsDAG::ActionType::INPUT)
inner_inputs.emplace(node->result_name, node);
for (const auto * child : node->children)
{
auto [it, inserted] = inner_parents.emplace(child, Parents());
it->second.emplace(node);
if (inserted)
stack.push(child);
}
}
}
}
struct Frame
{
const ActionsDAG::Node * node;
ActionsDAG::NodeRawConstPtrs mapped_children;
};
MatchedTrees::Matches matches;
std::stack<Frame> stack;
for (const auto & node : outer_dag.getNodes())
{
if (matches.contains(&node))
continue;
stack.push(Frame{&node, {}});
while (!stack.empty())
{
auto & frame = stack.top();
frame.mapped_children.reserve(frame.node->children.size());
while (frame.mapped_children.size() < frame.node->children.size())
{
const auto * child = frame.node->children[frame.mapped_children.size()];
auto it = matches.find(child);
if (it == matches.end())
{
/// If match map does not contain a child, it was not visited.
stack.push(Frame{child, {}});
break;
}
/// A node from found match may be nullptr.
/// It means that node is visited, but no match was found.
if (it->second.monotonicity)
/// Ignore a match with monotonicity.
frame.mapped_children.push_back(nullptr);
else
frame.mapped_children.push_back(it->second.node);
}
if (frame.mapped_children.size() < frame.node->children.size())
continue;
/// Create an empty match for current node.
/// match.node will be set if match is found.
auto & match = matches[frame.node];
if (frame.node->type == ActionsDAG::ActionType::INPUT)
{
const ActionsDAG::Node * mapped = nullptr;
if (auto it = inner_inputs.find(frame.node->result_name); it != inner_inputs.end())
mapped = it->second;
match.node = mapped;
}
else if (frame.node->type == ActionsDAG::ActionType::ALIAS)
{
match = matches[frame.node->children.at(0)];
}
else if (frame.node->type == ActionsDAG::ActionType::FUNCTION)
{
//std::cerr << "... Processing " << frame.node->function_base->getName() << std::endl;
bool found_all_children = true;
const ActionsDAG::Node * any_child = nullptr;
size_t num_children = frame.node->children.size();
for (size_t i = 0; i < num_children; ++i)
{
if (frame.mapped_children[i])
any_child = frame.mapped_children[i];
else if (!frame.node->children[i]->column || !isColumnConst(*frame.node->children[i]->column))
found_all_children = false;
}
if (found_all_children && any_child)
{
Parents container;
Parents * intersection = &inner_parents[any_child];
if (frame.mapped_children.size() > 1)
{
std::vector<Parents *> other_parents;
size_t mapped_children_size = frame.mapped_children.size();
other_parents.reserve(mapped_children_size);
for (size_t i = 1; i < mapped_children_size; ++i)
if (frame.mapped_children[i])
other_parents.push_back(&inner_parents[frame.mapped_children[i]]);
for (const auto * parent : *intersection)
{
bool is_common = true;
for (const auto * set : other_parents)
{
if (!set->contains(parent))
{
is_common = false;
break;
}
}
if (is_common)
container.insert(parent);
}
intersection = &container;
}
//std::cerr << ".. Candidate parents " << intersection->size() << std::endl;
if (!intersection->empty())
{
auto func_name = frame.node->function_base->getName();
for (const auto * parent : *intersection)
{
//std::cerr << ".. candidate " << parent->result_name << std::endl;
if (parent->type == ActionsDAG::ActionType::FUNCTION && func_name == parent->function_base->getName())
{
const auto & children = parent->children;
if (children.size() == num_children)
{
bool all_children_matched = true;
for (size_t i = 0; all_children_matched && i < num_children; ++i)
{
if (frame.mapped_children[i] == nullptr)
{
all_children_matched = children[i]->column && isColumnConst(*children[i]->column)
&& children[i]->result_type->equals(*frame.node->children[i]->result_type)
&& assert_cast<const ColumnConst &>(*children[i]->column).getField() == assert_cast<const ColumnConst &>(*frame.node->children[i]->column).getField();
}
else
all_children_matched = frame.mapped_children[i] == children[i];
}
if (all_children_matched)
{
match.node = parent;
break;
}
}
}
}
}
}
if (!match.node && check_monotonicity && frame.node->function_base->hasInformationAboutMonotonicity())
{
size_t num_const_args = 0;
const ActionsDAG::Node * monotonic_child = nullptr;
for (const auto * child : frame.node->children)
{
if (child->column)
++num_const_args;
else
monotonic_child = child;
}
if (monotonic_child && num_const_args + 1 == frame.node->children.size())
{
const auto & child_match = matches[monotonic_child];
if (child_match.node)
{
auto info = frame.node->function_base->getMonotonicityForRange(*monotonic_child->result_type, {}, {});
if (info.is_monotonic)
{
MatchedTrees::Monotonicity monotonicity;
monotonicity.direction *= info.is_positive ? 1 : -1;
monotonicity.strict = info.is_strict;
if (child_match.monotonicity)
{
monotonicity.direction *= child_match.monotonicity->direction;
if (!child_match.monotonicity->strict)
monotonicity.strict = false;
}
match.node = child_match.node;
match.monotonicity = monotonicity;
}
}
}
}
}
stack.pop();
}
}
return matches;
}
}
|
