-
Notifications
You must be signed in to change notification settings - Fork 3.4k
/
dataflow_matcher.cc
758 lines (694 loc) · 26.3 KB
/
dataflow_matcher.cc
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
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*/
/*!
* \file src/tvm/relay/dataflow_matcher.cc
* \brief The dataflow pattern matcher for Relay.
*/
#include <tvm/relay/analysis.h>
#include <tvm/relay/dataflow_matcher.h>
#include <tvm/relay/expr_functor.h>
#include <tvm/relay/transform.h>
#include <stack>
#include "indexed_graph.h"
namespace tvm {
namespace relay {
// Pattern Matcher
class DominatorMatcher;
class DFPatternMatcher : public DFPatternFunctor<bool(const DFPattern&, const Expr&)> {
public:
explicit DFPatternMatcher(const Expr& root_expr) : expr_graph_(CreateIndexedGraph(root_expr)) {}
bool Match(const DFPattern& pattern, const Expr& expr);
Map<DFPattern, Array<Expr>> GetMemo() { return Map<DFPattern, Array<Expr>>(memo_); }
const IndexedGraph<Expr> expr_graph_;
protected:
bool VisitDFPattern(const DFPattern& pattern, const Expr& expr) override;
bool VisitDFPattern_(const AltPatternNode* op, const Expr& expr) override;
bool VisitDFPattern_(const AttrPatternNode* op, const Expr& expr) override;
bool VisitDFPattern_(const CallPatternNode* op, const Expr& expr) override;
bool VisitDFPattern_(const DominatorPatternNode* op, const Expr& expr) override;
bool VisitDFPattern_(const ExprPatternNode* op, const Expr& expr) override;
bool VisitDFPattern_(const TupleGetItemPatternNode* op, const Expr& expr) override;
bool VisitDFPattern_(const TuplePatternNode* op, const Expr& expr) override;
bool VisitDFPattern_(const TypePatternNode* op, const Expr& expr) override;
bool VisitDFPattern_(const VarPatternNode* op, const Expr& expr) override;
bool VisitDFPattern_(const WildcardPatternNode* op, const Expr& expr) override;
void ClearMap(size_t watermark);
bool MatchesPath(const DominatorPatternNode* op, const Expr& expr);
bool DominatesParent(const DominatorPatternNode* op, const Expr& expr);
std::unordered_map<DFPattern, Array<Expr>, ObjectHash, ObjectEqual> memo_;
std::vector<DFPattern> matched_nodes_;
bool memoize_ = true;
};
bool DFPatternMatcher::Match(const DFPattern& pattern, const Expr& expr) {
memo_.clear();
matched_nodes_.clear();
return VisitDFPattern(pattern, expr);
}
void DFPatternMatcher::ClearMap(size_t watermark) {
for (size_t i = watermark; i < matched_nodes_.size(); ++i) {
memo_.erase(matched_nodes_[i]);
}
matched_nodes_.erase(matched_nodes_.begin() + watermark, matched_nodes_.end());
}
bool DFPatternMatcher::VisitDFPattern(const DFPattern& pattern, const Expr& expr) {
if (memoize_ && memo_.count(pattern)) {
CHECK_EQ(memo_[pattern].size(), 1);
return expr.same_as(memo_[pattern][0]);
} else {
auto watermark = matched_nodes_.size();
auto out = DFPatternFunctor::VisitDFPattern(pattern, expr);
if (out) {
memo_[pattern].push_back(expr);
matched_nodes_.push_back(pattern);
} else {
ClearMap(watermark);
}
return out;
}
}
bool DFPatternMatcher::VisitDFPattern_(const AltPatternNode* op, const Expr& expr) {
return VisitDFPattern(op->left, expr) || VisitDFPattern(op->right, expr);
}
bool MatchRetValue(const ObjectRef& lhs, const TVMRetValue& rhs) {
switch (rhs.type_code()) {
case kDLInt:
if (auto* val = lhs.as<IntImmNode>()) {
return val->value == rhs.operator int64_t();
}
break;
case kDLFloat:
if (auto* val = lhs.as<FloatImmNode>()) {
return val->value == rhs.operator double();
}
break;
case kTVMStr:
if (auto* val = lhs.as<tir::StringImmNode>()) {
return val->value == rhs.operator std::string();
} else if (auto* val = lhs.as<StringObj>()) {
return val->data == rhs.operator std::string();
}
break;
default:
CHECK(false) << "Unsupported type code in Pattern Node " << rhs.type_code();
}
return false;
}
bool DFPatternMatcher::VisitDFPattern_(const AttrPatternNode* attr_pattern, const Expr& expr) {
bool matches = false;
auto attributes = attr_pattern->attrs.as<DictAttrsNode>()->dict;
if (const auto* op_node = expr.as<OpNode>()) {
Op op = GetRef<Op>(op_node);
for (auto kv : attributes) {
auto attr_name = kv.first;
auto attr_value = kv.second;
auto op_map = Op::GetAttrMap<TVMRetValue>(attr_name);
if (op_map.count(op)) {
matches = MatchRetValue(attr_value, op_map[op]);
}
}
} else if (auto* op = expr.as<CallNode>()) {
matches = true;
// TODO(mbrookhart): When OpNode Attrs move from TVMRetValue to the Object system, remove this
// and replace the whole thing with a Visitor-based approach
ReflectionVTable* reflection = ReflectionVTable::Global();
auto attrs_node = const_cast<Object*>(op->attrs.get());
auto attr_names = reflection->ListAttrNames(attrs_node);
for (auto kv : attributes) {
if (matches &&
std::find(attr_names.begin(), attr_names.end(), kv.first) != attr_names.end()) {
matches &= MatchRetValue(kv.second, reflection->GetAttr(attrs_node, kv.first));
} else {
matches = false;
break;
}
}
} else if (auto* op = expr.as<FunctionNode>()) {
matches = true;
for (auto kv : attributes) {
if (matches && op->attrs.defined() && op->attrs->dict.count(kv.first)) {
matches &= StructuralEqual()(kv.second, op->attrs->dict[kv.first]);
} else {
matches = false;
break;
}
}
}
return matches && VisitDFPattern(attr_pattern->pattern, expr);
}
Array<DFPattern> reverse(const Array<DFPattern>& args) {
Array<DFPattern> new_args;
for (auto it = args.rbegin(); it != args.rend(); ++it) {
new_args.push_back(*it);
}
return new_args;
}
bool DFPatternMatcher::VisitDFPattern_(const CallPatternNode* op, const Expr& expr) {
// utilities
auto get_op_node = [](const CallPatternNode* op) -> const tvm::OpNode* {
if (op) {
if (auto* expr_pattern = op->op.as<ExprPatternNode>()) {
return expr_pattern->expr.as<OpNode>();
}
}
return nullptr;
};
auto is_pattern_op = [&get_op_node](const CallPatternNode* op, std::string op_type) {
if (const auto* op_node = get_op_node(op)) {
if (op_node->name == op_type) {
return true;
}
}
return false;
};
auto is_expr_op = [](const Expr& expr, std::string op_type) {
if (const auto* call_node = expr.as<CallNode>()) {
if (const auto* op_node = call_node->op.as<OpNode>()) {
if (op_node->name == op_type) {
return true;
}
}
}
return false;
};
// logic
auto watermark = matched_nodes_.size();
if (const auto* call_node = expr.as<CallNode>()) {
auto matches_op = VisitDFPattern(op->op, call_node->op);
if (matches_op) {
auto watermark2 = matched_nodes_.size();
auto match_args = [this, &watermark2](const Array<DFPattern> pattern_args,
const Array<Expr> expr_args) {
bool matches = true;
size_t i = 0;
if (pattern_args.size() == expr_args.size()) {
while (matches && i < pattern_args.size()) {
matches &= VisitDFPattern(pattern_args[i], expr_args[i]);
++i;
}
} else {
matches = false;
}
if (!matches) {
ClearMap(watermark2);
}
return matches;
};
// Standard case
if (match_args(op->args, call_node->args)) {
return true;
}
// Commutative Matching
if (const OpNode* op_node = get_op_node(op)) {
if ((op_node->name == "add") || (op_node->name == "multiply")) {
if (match_args(reverse(op->args), call_node->args)) {
return true;
}
}
}
} else {
ClearMap(watermark);
// associate divide/multiply
if (is_pattern_op(op, "divide")) {
if (const auto* arg_node = op->args[0].as<CallPatternNode>()) {
if (is_pattern_op(arg_node, "multiply") && is_expr_op(expr, "multiply") &&
(is_expr_op(call_node->args[0], "divide") ||
is_expr_op(call_node->args[1], "divide"))) {
bool out = false;
for (size_t arg_id = 0; arg_id < 2; ++arg_id) {
auto div = CallPattern(op->op, {arg_node->args[arg_id], op->args[1]}, op->attrs,
op->type_args);
auto mul = CallPattern(arg_node->op, {arg_node->args[(arg_id + 1) % 2], div},
arg_node->attrs, arg_node->type_args);
out = VisitDFPattern(mul, expr);
if (out) {
return true;
} else {
ClearMap(watermark);
}
}
return out;
}
}
}
if (is_pattern_op(op, "multiply")) {
// associate multiply/divide
for (size_t arg_id = 0; arg_id < 2; ++arg_id) {
if (auto* arg_node = op->args[arg_id].as<CallPatternNode>()) {
if (is_pattern_op(arg_node, "divide") && is_expr_op(expr, "divide") &&
(is_expr_op(call_node->args[0], "multiply") ||
is_expr_op(call_node->args[1], "multiply"))) {
auto mul = CallPattern(op->op, {arg_node->args[0], op->args[(arg_id + 1) % 2]},
op->attrs, op->type_args);
auto div = CallPattern(arg_node->op, {mul, arg_node->args[1]}, arg_node->attrs,
arg_node->type_args);
return VisitDFPattern(div, expr);
}
}
}
}
}
}
return false;
}
// Recursively find the Dominator parent along all inputs paths.
bool DFPatternMatcher::MatchesPath(const DominatorPatternNode* op, const Expr& expr) {
auto call_node = expr.as<CallNode>();
for (auto node : expr_graph_.node_map_.at(expr)->inputs_) {
if (!(call_node && node->ref_ == call_node->op)) {
memoize_ = true;
if (VisitDFPattern(op->parent, node->ref_)) {
return true;
} else {
memoize_ = false;
if (!VisitDFPattern(op->path, node->ref_) || !MatchesPath(op, node->ref_)) {
return false;
}
}
}
}
return true;
}
// Iteratively ensure that the parent is dominated somewhere by the child or the path
bool DFPatternMatcher::DominatesParent(const DominatorPatternNode* op, const Expr& expr) {
std::stack<Expr> stack;
std::unordered_set<Expr, ObjectHash, ObjectEqual> visited;
stack.push(expr);
while (!stack.empty()) {
Expr current = stack.top();
stack.pop();
for (auto node : expr_graph_.node_map_.at(current)->dominator_children_) {
if (visited.count(node->ref_) == 0) {
if (VisitDFPattern(op->parent, node->ref_)) {
return true;
} else {
stack.push(node->ref_);
}
visited.insert(node->ref_);
}
}
}
return false;
}
bool DFPatternMatcher::VisitDFPattern_(const DominatorPatternNode* op, const Expr& expr) {
if (VisitDFPattern(op->child, expr)) {
bool matches_path = MatchesPath(op, expr);
memoize_ = true;
if (matches_path) {
return DominatesParent(op, expr);
}
}
return false;
}
bool DFPatternMatcher::VisitDFPattern_(const ExprPatternNode* op, const Expr& expr) {
return StructuralEqual()(op->expr, expr);
}
bool DFPatternMatcher::VisitDFPattern_(const TupleGetItemPatternNode* op, const Expr& expr) {
bool matches = false;
if (const auto* tuple_get_item_node = expr.as<TupleGetItemNode>()) {
matches = (op->index == tuple_get_item_node->index) &&
VisitDFPattern(op->tuple, tuple_get_item_node->tuple);
}
return matches;
}
bool DFPatternMatcher::VisitDFPattern_(const TuplePatternNode* op, const Expr& expr) {
bool matches = false;
if (const auto* tuple_node = expr.as<TupleNode>()) {
if (op->fields.size() == tuple_node->fields.size()) {
matches = true;
size_t i = 0;
while (matches && i < op->fields.size()) {
matches &= VisitDFPattern(op->fields[i], tuple_node->fields[i]);
++i;
}
}
}
return matches;
}
Expr InferType(const Expr& expr) {
auto mod = IRModule::FromExpr(expr);
mod = transform::InferType()(mod);
if (expr.as<FunctionNode>()) {
return mod->Lookup("main");
} else {
return mod->Lookup("main").as<FunctionNode>()->body;
}
}
bool DFPatternMatcher::VisitDFPattern_(const TypePatternNode* op, const Expr& expr) {
auto expr_type = InferType(expr).as<ExprNode>()->checked_type();
return (StructuralEqual()(op->type, expr_type)) && VisitDFPattern(op->pattern, expr);
}
bool DFPatternMatcher::VisitDFPattern_(const VarPatternNode* op, const Expr& expr) {
bool matches = false;
if (const auto* var_node = expr.as<VarNode>()) {
matches = true;
if (op->name_hint() != "") {
matches &= op->name_hint() == var_node->name_hint();
}
}
return matches;
}
bool DFPatternMatcher::VisitDFPattern_(const WildcardPatternNode* op, const Expr& expr) {
return true;
}
bool MatchPattern(DFPattern pattern, Expr expr) {
return DFPatternMatcher(expr).Match(pattern, expr);
}
TVM_REGISTER_GLOBAL("relay.dataflow_pattern.match").set_body_typed(MatchPattern);
/* \brief PatternGrouper does pre-rewriting pattern matching and analysis
*
* This class creates a number of groups of matched expressions, ensures they don't overlap, and
* returns them to the caller for post-analysis rewriting.
*
* This is primarily needed to support the post-dominator analysis required for dominator pattern
* matching.
*/
class PatternGrouper {
public:
/* \brief Internal Group class for storing analysis */
struct Group {
Expr root_node;
int gid;
Map<DFPattern, Array<Expr>> matched_nodes;
std::string name;
Function function;
Array<Expr> args;
};
/* \brief Return the group assignments of expressions */
const std::unordered_map<Expr, int, ObjectHash, ObjectEqual>& GetGIDAssignments() {
return gid_assignments_;
}
/* \brief Group expressions that match the pattern */
const std::vector<Group>& GroupMatches(const DFPattern& pattern, const Expr& pre) {
groups_ = {Group()};
gid_assignments_.clear();
pattern_ = pattern;
pattern_graph_ = CreateIndexedGraph(pattern_);
auto matcher = DFPatternMatcher(pre);
matcher_ = &matcher;
this->VisitExprs();
return this->groups_;
}
protected:
/* \brief Iteratively traverse the Expression in pre-order to find subgraphs
*
* If we traverse the graph in post-order, we can run into situtations where a small subgraph will
* match the pattern. Due to options like AltPattern, a larger subgraph with more nodes later in
* the graph may also match the pattern. With post-order traversal, we mark the smaller subgraph
* as matched and fail to catch the larger subgraph. This problem is fixed by using pre-order
* traversal.
*/
void VisitExprs() {
std::unordered_set<Expr, ObjectHash, ObjectEqual> pre_partitioned;
for (size_t i = matcher_->expr_graph_.topological_order_.size(); i != 0; --i) {
size_t index = i - 1;
Expr current = matcher_->expr_graph_.topological_order_.at(index)->ref_;
if (auto op = current.as<FunctionNode>()) {
if (op->attrs.defined() && op->attrs->dict.count(attr::kPartitionedFromPattern) != 0) {
pre_partitioned.insert(current);
PostOrderVisit(op->body,
[&pre_partitioned](const Expr& expr) { pre_partitioned.insert(expr); });
}
}
if (pre_partitioned.count(current) == 0 && matcher_->Match(pattern_, current)) {
CreateGroup(current);
}
}
}
/* \brief Creates a new set of nodes based on Group inputs, used to create functions and perform
* group overlap analysis */
class MatchExtractor : public ExprMutator {
public:
explicit MatchExtractor(const std::unordered_map<Expr, Var, ObjectHash, ObjectEqual>& inputs)
: inputs_(inputs) {}
const std::unordered_map<Expr, Expr, ObjectHash, ObjectEqual>& GetMemo() { return this->memo_; }
const std::string& GetName() { return name_; }
protected:
Expr VisitExpr(const Expr& pre) override {
if (inputs_.count(pre)) {
return inputs_.at(pre);
}
return ExprMutator::VisitExpr(pre);
}
Expr VisitExpr_(const TupleNode* op) override {
auto out = ExprMutator::VisitExpr_(op);
name_ += "Tuple_";
return out;
};
Expr VisitExpr_(const FunctionNode* op) override {
auto out = ExprMutator::VisitExpr_(op);
name_ += "Function";
return out;
};
Expr VisitExpr_(const CallNode* call_node) override {
auto out = ExprMutator::VisitExpr_(call_node);
if (auto operation = call_node->op.as<OpNode>()) {
name_ += operation->name + "_";
} else {
name_ += "Call_";
}
return out;
};
Expr VisitExpr_(const LetNode* op) override {
auto out = ExprMutator::VisitExpr_(op);
name_ += "Let_";
return out;
};
Expr VisitExpr_(const IfNode* op) override {
auto out = ExprMutator::VisitExpr_(op);
name_ += "If_";
return out;
};
Expr VisitExpr_(const TupleGetItemNode* op) override {
auto out = ExprMutator::VisitExpr_(op);
name_ += "TupleGetItem" + std::to_string(op->index) + "_";
return out;
};
Expr VisitExpr_(const MatchNode* op) override {
auto out = ExprMutator::VisitExpr_(op);
name_ += "Match_";
return out;
};
std::string name_;
const std::unordered_map<Expr, Var, ObjectHash, ObjectEqual> inputs_;
};
/* \brief Create a group based on a matched expression */
void CreateGroup(const Expr& expr) {
int var_number = 0;
auto node_map = matcher_->GetMemo();
// Get fuzzy patterns
std::unordered_set<Expr, ObjectHash, ObjectEqual> fuzzy_matches;
for (auto node : pattern_graph_.topological_order_) {
if (auto op = node->ref_.as<DominatorPatternNode>()) {
for (auto fuzzy_op : {op->parent, op->path}) {
for (auto match : node_map[fuzzy_op]) {
fuzzy_matches.insert(match);
}
}
}
}
// Create input variables
Group group;
group.root_node = expr;
group.matched_nodes = node_map;
std::unordered_map<Expr, Var, ObjectHash, ObjectEqual> inputs;
Array<Var> params;
for (auto node : pattern_graph_.topological_order_) {
if (node->inputs_.size() == 0) {
if (node_map.count(node->ref_)) {
auto matches = node_map[node->ref_];
for (auto match : matches) {
if (fuzzy_matches.count(match) == 0 && match.as<OpNode>() == nullptr &&
match.as<FunctionNode>() == nullptr) {
inputs[match] = Var(
"FunctionVar_" + std::to_string(graph_number_) + "_" + std::to_string(var_number),
NullValue<Type>());
group.args.push_back(match);
params.push_back(inputs[match]);
var_number++;
}
}
}
}
}
graph_number_++;
// Extract a Function. Used in Partition directly,
// used to determine Group overlap in other passes
auto extractor = MatchExtractor(inputs);
auto body = extractor.Mutate(expr);
// Verify the pattern still holds, no longer valid if we're not embedding constants in the
// graph, keep here for future debug CHECK(DFPatternMatcher(body).Match(pattern_, body));
group.function = Function(params, body, NullValue<Type>(), Array<TypeVar>());
group.name = extractor.GetName();
// Check to make sure we aren't overlapping with another group
// The MatchExtractor will create a new graph by replacing nodes that match the inputs of the
// pattern with the input FunctionVar* Variables. The resulting memoization map will only
// contain nodes in the expression that matched the pattern. If a non-input node of the pattern
// (i.e., some piece of computation) overlaps with the nodes in a previous group, we'll have a
// situation where we try to rewrite the same node twice in the second rewriting or parition
// pass. This isn't valid, so we check for it here. We ignore Ops, functions, and constants
// because they exist more globally outside of the fusion.
for (auto kv : extractor.GetMemo()) {
if (gid_assignments_.count(kv.first) != 0 && inputs.count(kv.first) == 0 &&
kv.first.as<OpNode>() == nullptr && kv.first.as<FunctionNode>() == nullptr &&
kv.first.as<ConstantNode>() == nullptr) {
// Exit due to overlapping partitions
return;
}
}
// Assign Group Ids
group.gid = ++gid_;
for (auto kv : extractor.GetMemo()) {
gid_assignments_[kv.first] = gid_;
}
// Save Group
groups_.emplace_back(std::move(group));
CHECK_EQ(groups_[gid_].gid, gid_);
}
// Internal State
DFPattern pattern_;
std::vector<Group> groups_;
std::unordered_map<Expr, int, ObjectHash, ObjectEqual> gid_assignments_;
DFPatternMatcher* matcher_ = nullptr;
IndexedGraph<DFPattern> pattern_graph_;
int gid_ = 0;
int graph_number_ = 0;
};
// Rewrite
DFPatternCallback::DFPatternCallback(DFPattern pattern, PackedFunc function) {
ObjectPtr<DFPatternCallbackNode> n = make_object<DFPatternCallbackNode>();
n->pattern_ = std::move(pattern);
n->function_ = std::move(function);
data_ = std::move(n);
}
TVM_REGISTER_NODE_TYPE(DFPatternCallbackNode);
TVM_REGISTER_GLOBAL("relay.dataflow_pattern.DFPatternCallback")
.set_body_typed([](DFPattern pattern, PackedFunc function) {
return DFPatternCallback(pattern, function);
});
/* \brief PatternRewriter rewrites the expression by finding matches and allowing user callback
* function to rewrite those matches
*
* The class uses PatternGrouper to support the dominator pattern.
*/
class PatternRewriter : protected MixedModeMutator {
public:
PatternRewriter() {}
/*! \brief Rewrite can take a number of callbacks and will repeatedly rewrite the graph with the
* callbacks until it stops changing */
Expr Rewrite(const Array<DFPatternCallback>& callbacks, const Expr& pre) {
auto post = pre;
auto last = post;
// rewrite the graph until it stops changing to make sure all rewrites are complete
int count = 0;
do {
last = post;
for (auto callback : callbacks) {
callback_ = callback;
auto grouper = PatternGrouper();
groups_ = grouper.GroupMatches(callback_->pattern_, post);
gid_assignments_ = grouper.GetGIDAssignments();
memo_.clear();
post = this->VisitExpr(post);
count++;
}
} while (last != post || count >= 100);
if (count >= 100) {
throw("Observed 100 rewrite passes, possible conflicting passes?");
}
return post;
}
protected:
Expr DispatchVisitExpr(const Expr& pre) override {
auto post = MixedModeMutator::DispatchVisitExpr(pre);
if (gid_assignments_.count(pre) && pre == groups_[gid_assignments_[pre]].root_node) {
// Convert the pre-rewrite node map to a post-rewrite node map
auto group = groups_[gid_assignments_[pre]];
std::unordered_map<DFPattern, Array<Expr>, ObjectHash, ObjectEqual> node_map;
for (auto kv : group.matched_nodes) {
Array<Expr> tmp;
for (size_t i = 0; i < kv.second.size(); ++i) {
tmp.push_back(this->memo_[kv.second[i]]);
}
node_map.insert({kv.first, tmp});
}
// run the user callback function
return callback_->function_(pre, post, Map<DFPattern, Array<Expr>>(node_map));
}
return post;
}
DFPatternCallback callback_;
std::vector<PatternGrouper::Group> groups_;
std::unordered_map<Expr, int, ObjectHash, ObjectEqual> gid_assignments_;
};
Expr RewritePatterns(Array<DFPatternCallback> callbacks, Expr expr) {
return PatternRewriter().Rewrite(callbacks, expr);
}
TVM_REGISTER_GLOBAL("relay.dataflow_pattern.rewrite").set_body_typed(RewritePatterns);
/* \brief PatternPartitioner replaces expressions that match a pattern with function call that
* perform the same computation but allow for further analysis and lowering.
*
* The class uses PatternGrouper to support the dominator pattern.
*/
class PatternPartitioner : protected MixedModeMutator {
public:
Expr Partition(const DFPattern& pattern, const Expr& pre,
const Map<std::string, ObjectRef>& attrs, PackedFunc check) {
auto grouper = PatternGrouper();
groups_ = grouper.GroupMatches(pattern, pre);
gid_assignments_ = grouper.GetGIDAssignments();
attrs_ = attrs;
check_ = check;
return this->VisitExpr(pre);
}
protected:
Expr RewritePartition(const PatternGrouper::Group& group) {
Array<Expr> args;
for (size_t i = 0; i < group.args.size(); ++i) {
args.push_back(memo_[group.args[i]]);
}
Function func = WithAttr(group.function, attr::kPartitionedFromPattern, String(group.name));
if (!attrs_.empty()) {
for (auto kv : attrs_) {
func = WithAttr(std::move(func), kv.first, kv.second);
}
}
return Call(func, args);
}
Expr DispatchVisitExpr(const Expr& pre) override {
auto post = MixedModeMutator::DispatchVisitExpr(pre);
if (gid_assignments_.count(pre) && pre == groups_[gid_assignments_[pre]].root_node &&
static_cast<bool>(check_(pre))) {
post = RewritePartition(groups_[gid_assignments_[pre]]);
}
return post;
}
Map<std::string, ObjectRef> attrs_;
std::vector<PatternGrouper::Group> groups_;
std::unordered_map<Expr, int, ObjectHash, ObjectEqual> gid_assignments_;
PackedFunc check_;
};
Expr PartitionPattern(DFPattern pattern, Expr expr, Map<std::string, ObjectRef> attrs,
PackedFunc check) {
return PatternPartitioner().Partition(pattern, expr, attrs, check);
}
TVM_REGISTER_GLOBAL("relay.dataflow_pattern.partition")
.set_body_typed([](DFPattern pattern, Expr expr, Map<std::string, ObjectRef> attrs,
PackedFunc check) { return PartitionPattern(pattern, expr, attrs, check); });
} // namespace relay
} // namespace tvm