blob: 89a3ec9d869bb37abe863857c848b6ea8713f78e (
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
|
//===- LowerAffineApply.cpp - Convert affine_apply to primitives ----------===//
//
// 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 defines an MLIR function pass that replaces affine_apply operations
// in CFGFunctions with sequences of corresponding elementary arithmetic
// operations.
//
//===----------------------------------------------------------------------===//
//
#include "mlir/IR/Builders.h"
#include "mlir/IR/BuiltinOps.h"
#include "mlir/IR/CFGFunction.h"
#include "mlir/IR/MLFunction.h"
#include "mlir/Pass.h"
#include "mlir/Transforms/LoweringUtils.h"
#include "mlir/Transforms/Passes.h"
using namespace mlir;
namespace {
struct LowerAffineApply : public FunctionPass {
explicit LowerAffineApply() : FunctionPass(&LowerAffineApply::passID) {}
PassResult runOnMLFunction(MLFunction *f) override;
PassResult runOnCFGFunction(CFGFunction *f) override;
static char passID;
};
} // end anonymous namespace
char LowerAffineApply::passID = 0;
PassResult LowerAffineApply::runOnMLFunction(MLFunction *f) {
f->emitError("ML Functions contain syntactically hidden affine_apply's that "
"cannot be expanded");
return failure();
}
PassResult LowerAffineApply::runOnCFGFunction(CFGFunction *f) {
for (BasicBlock &bb : *f) {
// Handle iterators with care because we erase in the same loop.
// In particular, step to the next element before erasing the current one.
for (auto it = bb.begin(); it != bb.end();) {
Instruction &inst = *it;
OpPointer<AffineApplyOp> affineApplyOp = inst.dyn_cast<AffineApplyOp>();
++it;
if (!affineApplyOp)
continue;
if (expandAffineApply(&*affineApplyOp))
return failure();
}
}
return success();
}
static PassRegistration<LowerAffineApply>
pass("lower-affine-apply",
"Decompose affine_applies into primitive operations");
FunctionPass *createLowerAffineApplyPass() { return new LowerAffineApply(); }
|
