TestLoopPermutation.cpp
2.12 KB
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
//===- TestLoopPermutation.cpp - Test affine loop permutation -------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
//
// This file implements a pass to test the affine for op permutation utility.
//
//===----------------------------------------------------------------------===//
#include "mlir/Analysis/Utils.h"
#include "mlir/Dialect/Affine/IR/AffineOps.h"
#include "mlir/Pass/Pass.h"
#include "mlir/Transforms/LoopUtils.h"
#include "mlir/Transforms/Passes.h"
#define PASS_NAME "test-loop-permutation"
using namespace mlir;
static llvm::cl::OptionCategory clOptionsCategory(PASS_NAME " options");
namespace {
/// This pass applies the permutation on the first maximal perfect nest.
struct TestLoopPermutation
: public PassWrapper<TestLoopPermutation, FunctionPass> {
TestLoopPermutation() = default;
TestLoopPermutation(const TestLoopPermutation &pass){};
void runOnFunction() override;
private:
/// Permutation specifying loop i is mapped to permList[i] in
/// transformed nest (with i going from outermost to innermost).
ListOption<unsigned> permList{*this, "permutation-map",
llvm::cl::desc("Specify the loop permutation"),
llvm::cl::OneOrMore, llvm::cl::CommaSeparated};
};
} // end anonymous namespace
void TestLoopPermutation::runOnFunction() {
// Get the first maximal perfect nest.
SmallVector<AffineForOp, 6> nest;
for (auto &op : getFunction().front()) {
if (auto forOp = dyn_cast<AffineForOp>(op)) {
getPerfectlyNestedLoops(nest, forOp);
break;
}
}
// Nothing to do.
if (nest.size() < 2)
return;
SmallVector<unsigned, 4> permMap(permList.begin(), permList.end());
permuteLoops(nest, permMap);
}
namespace mlir {
void registerTestLoopPermutationPass() {
PassRegistration<TestLoopPermutation>(
PASS_NAME, "Tests affine loop permutation utility");
}
} // namespace mlir