blob: cce5df983488c3efd2324834b55c2983fde5f9fb (
plain)
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
|
//===- ComposeAffineMaps.cpp - MLIR Affine Transform Class-----*- C++ -*-===//
//
// Copyright 2019 The MLIR Authors.
//
// Licensed 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.
// =============================================================================
//
// This file implements a testing pass which composes affine maps from
// AffineApplyOps in an MLFunction, by forward subtituting results from an
// AffineApplyOp into any of its users which are also AffineApplyOps.
//
//===----------------------------------------------------------------------===//
#include "mlir/IR/AffineMap.h"
#include "mlir/IR/Attributes.h"
#include "mlir/IR/Builders.h"
#include "mlir/IR/BuiltinOps.h"
#include "mlir/IR/StmtVisitor.h"
#include "mlir/StandardOps/StandardOps.h"
#include "mlir/Transforms/Pass.h"
#include "mlir/Transforms/Passes.h"
#include "mlir/Transforms/Utils.h"
#include "llvm/Support/CommandLine.h"
using namespace mlir;
namespace {
// ComposeAffineMaps walks stmt blocks in an MLFunction, and for each
// AffineApplyOp, forward substitutes its results into any users which are
// also AffineApplyOps. After forward subtituting its results, AffineApplyOps
// with no remaining uses are collected and erased after the walk.
// TODO(andydavis) Remove this when Chris adds instruction combiner pass.
struct ComposeAffineMaps : public MLFunctionPass,
StmtWalker<ComposeAffineMaps> {
std::vector<OperationStmt *> affineApplyOpsToErase;
explicit ComposeAffineMaps() {}
typedef llvm::iplist<Statement> StmtListType;
void walk(StmtListType::iterator Start, StmtListType::iterator End);
void visitOperationStmt(OperationStmt *stmt);
PassResult runOnMLFunction(MLFunction *f);
using StmtWalker<ComposeAffineMaps>::walk;
};
} // end anonymous namespace
MLFunctionPass *mlir::createComposeAffineMapsPass() {
return new ComposeAffineMaps();
}
void ComposeAffineMaps::walk(StmtListType::iterator Start,
StmtListType::iterator End) {
while (Start != End) {
walk(&(*Start));
// Increment iterator after walk as visit function can mutate stmt list
// ahead of 'Start'.
++Start;
}
}
void ComposeAffineMaps::visitOperationStmt(OperationStmt *opStmt) {
if (auto affineApplyOp = opStmt->getAs<AffineApplyOp>()) {
forwardSubstitute(affineApplyOp);
bool allUsesEmpty = true;
for (auto *result : affineApplyOp->getOperation()->getResults()) {
if (!result->use_empty()) {
allUsesEmpty = false;
break;
}
}
if (allUsesEmpty) {
affineApplyOpsToErase.push_back(opStmt);
}
}
}
PassResult ComposeAffineMaps::runOnMLFunction(MLFunction *f) {
affineApplyOpsToErase.clear();
walk(f);
for (auto *opStmt : affineApplyOpsToErase) {
opStmt->eraseFromBlock();
}
return success();
}
|
