6edef13569
ListOption currently uses llvm:🆑:list under the hood, but the usages of ListOption are generally a tad different from llvm:🆑:list. This commit codifies this by making ListOption implicitly comma separated, and removes the explicit flag set for all of the current list options. The new parsing for comma separation of ListOption also adds in support for skipping over delimited sub-ranges (i.e. {}, [], (), "", ''). This more easily supports nested options that use those as part of the format, and this constraint (balanced delimiters) is already codified in the syntax of pass pipelines. See https://discourse.llvm.org/t/list-of-lists-pass-option/5950 for related discussion Differential Revision: https://reviews.llvm.org/D122879
70 lines
2.3 KiB
C++
70 lines
2.3 KiB
C++
//===- 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/Dialect/Affine/Analysis/Utils.h"
|
|
#include "mlir/Dialect/Affine/IR/AffineOps.h"
|
|
#include "mlir/Dialect/Affine/LoopUtils.h"
|
|
#include "mlir/Pass/Pass.h"
|
|
|
|
#define PASS_NAME "test-loop-permutation"
|
|
|
|
using namespace mlir;
|
|
|
|
namespace {
|
|
|
|
/// This pass applies the permutation on the first maximal perfect nest.
|
|
struct TestLoopPermutation
|
|
: public PassWrapper<TestLoopPermutation, OperationPass<>> {
|
|
StringRef getArgument() const final { return PASS_NAME; }
|
|
StringRef getDescription() const final {
|
|
return "Tests affine loop permutation utility";
|
|
}
|
|
TestLoopPermutation() = default;
|
|
TestLoopPermutation(const TestLoopPermutation &pass) : PassWrapper(pass){};
|
|
|
|
void runOnOperation() 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};
|
|
};
|
|
|
|
} // namespace
|
|
|
|
void TestLoopPermutation::runOnOperation() {
|
|
|
|
SmallVector<unsigned, 4> permMap(permList.begin(), permList.end());
|
|
|
|
SmallVector<AffineForOp, 2> forOps;
|
|
getOperation()->walk([&](AffineForOp forOp) { forOps.push_back(forOp); });
|
|
|
|
for (auto forOp : forOps) {
|
|
SmallVector<AffineForOp, 6> nest;
|
|
// Get the maximal perfect nest.
|
|
getPerfectlyNestedLoops(nest, forOp);
|
|
// Permute if the nest's size is consistent with the specified
|
|
// permutation.
|
|
if (nest.size() >= 2 && nest.size() == permMap.size()) {
|
|
permuteLoops(nest, permMap);
|
|
}
|
|
}
|
|
}
|
|
|
|
namespace mlir {
|
|
void registerTestLoopPermutationPass() {
|
|
PassRegistration<TestLoopPermutation>();
|
|
}
|
|
} // namespace mlir
|