blob: bd39e47786ae5ac83b436036b7603890ef74b2f3 (
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
96
97
|
//===- SimplifyAffineStructures.cpp - ---------------------------*- 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 pass to simplify affine structures.
//
//===----------------------------------------------------------------------===//
#include "mlir/Analysis/AffineStructures.h"
#include "mlir/IR/Function.h"
#include "mlir/IR/Instructions.h"
#include "mlir/Pass.h"
#include "mlir/Transforms/Passes.h"
#define DEBUG_TYPE "simplify-affine-structure"
using namespace mlir;
using llvm::report_fatal_error;
namespace {
/// Simplifies all affine expressions appearing in the operation instructions of
/// the Function. This is mainly to test the simplifyAffineExpr method.
/// TODO(someone): This should just be defined as a canonicalization pattern
/// on AffineMap and driven from the existing canonicalization pass.
struct SimplifyAffineStructures : public FunctionPass {
explicit SimplifyAffineStructures()
: FunctionPass(&SimplifyAffineStructures::passID) {}
PassResult runOnFunction(Function *f) override;
void visitIfInst(IfInst *ifInst);
void visitOperationInst(OperationInst *opInst);
static char passID;
};
} // end anonymous namespace
char SimplifyAffineStructures::passID = 0;
FunctionPass *mlir::createSimplifyAffineStructuresPass() {
return new SimplifyAffineStructures();
}
/// Performs basic integer set simplifications. Checks if it's empty, and
/// replaces it with the canonical empty set if it is.
static IntegerSet simplifyIntegerSet(IntegerSet set) {
FlatAffineConstraints fac(set);
if (fac.isEmpty())
return IntegerSet::getEmptySet(set.getNumDims(), set.getNumSymbols(),
set.getContext());
return set;
}
void SimplifyAffineStructures::visitIfInst(IfInst *ifInst) {
auto set = ifInst->getCondition().getIntegerSet();
ifInst->setIntegerSet(simplifyIntegerSet(set));
}
void SimplifyAffineStructures::visitOperationInst(OperationInst *opInst) {
for (auto attr : opInst->getAttrs()) {
if (auto mapAttr = attr.second.dyn_cast<AffineMapAttr>()) {
MutableAffineMap mMap(mapAttr.getValue());
mMap.simplify();
auto map = mMap.getAffineMap();
opInst->setAttr(attr.first, AffineMapAttr::get(map));
}
}
}
PassResult SimplifyAffineStructures::runOnFunction(Function *f) {
f->walkInsts([&](Instruction *inst) {
if (auto *opInst = dyn_cast<OperationInst>(inst))
visitOperationInst(opInst);
if (auto *ifInst = dyn_cast<IfInst>(inst))
visitIfInst(ifInst);
});
return success();
}
static PassRegistration<SimplifyAffineStructures>
pass("simplify-affine-structures", "Simplify affine expressions");
|
