Magic-Mirror/llvm-capstone
1
0
Fork 0
mirror of https://github.com/capstone-engine/llvm-capstone.git synced 2024-11-25 23:00:15 +00:00
Code Issues Actions 2 Packages Projects Releases Wiki Activity

Update examples post OwningRewritePatternList change

Browse Source
This commit is contained in:
Jacques Pienaar 2021-03-21 15:15:34 -07:00
parent 2554b95db5
commit 113baa2b9f
5 changed files with 9 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
mlir/examples/toy/Ch5/mlir/LowerToAffineLoops.cpp
View File

@ -297,7 +297,7 @@ void ToyToAffineLoweringPass::runOnFunction() {
// Now that the conversion target has been defined, we just need to provide
// the set of patterns that will lower the Toy operations.
OwningRewritePatternList patterns;
OwningRewritePatternList patterns(&getContext());
patterns.insert<AddOpLowering, ConstantOpLowering, MulOpLowering,
ReturnOpLowering, TransposeOpLowering>(&getContext());

2
mlir/examples/toy/Ch6/mlir/LowerToAffineLoops.cpp
View File

@ -296,7 +296,7 @@ void ToyToAffineLoweringPass::runOnFunction() {
// Now that the conversion target has been defined, we just need to provide
// the set of patterns that will lower the Toy operations.
OwningRewritePatternList patterns;
OwningRewritePatternList patterns(&getContext());
patterns.insert<AddOpLowering, ConstantOpLowering, MulOpLowering,
ReturnOpLowering, TransposeOpLowering>(&getContext());

6
mlir/examples/toy/Ch6/mlir/LowerToLLVM.cpp
View File

@ -191,9 +191,9 @@ void ToyToLLVMLoweringPass::runOnOperation() {
// lowerings. Transitive lowering, or A->B->C lowering, is when multiple
// patterns must be applied to fully transform an illegal operation into a
// set of legal ones.
OwningRewritePatternList patterns;
populateAffineToStdConversionPatterns(patterns, &getContext());
populateLoopToStdConversionPatterns(patterns, &getContext());
OwningRewritePatternList patterns(&getContext());
populateAffineToStdConversionPatterns(patterns);
populateLoopToStdConversionPatterns(patterns);
populateStdToLLVMConversionPatterns(typeConverter, patterns);
// The only remaining operation to lower from the `toy` dialect, is the

2
mlir/examples/toy/Ch7/mlir/LowerToAffineLoops.cpp
View File

@ -297,7 +297,7 @@ void ToyToAffineLoweringPass::runOnFunction() {
// Now that the conversion target has been defined, we just need to provide
// the set of patterns that will lower the Toy operations.
OwningRewritePatternList patterns;
OwningRewritePatternList patterns(&getContext());
patterns.insert<AddOpLowering, ConstantOpLowering, MulOpLowering,
ReturnOpLowering, TransposeOpLowering>(&getContext());

6
mlir/examples/toy/Ch7/mlir/LowerToLLVM.cpp
View File

@ -191,9 +191,9 @@ void ToyToLLVMLoweringPass::runOnOperation() {
// lowerings. Transitive lowering, or A->B->C lowering, is when multiple
// patterns must be applied to fully transform an illegal operation into a
// set of legal ones.
OwningRewritePatternList patterns;
populateAffineToStdConversionPatterns(patterns, &getContext());
populateLoopToStdConversionPatterns(patterns, &getContext());
OwningRewritePatternList patterns(&getContext());
populateAffineToStdConversionPatterns(patterns);
populateLoopToStdConversionPatterns(patterns);
populateStdToLLVMConversionPatterns(typeConverter, patterns);
// The only remaining operation to lower from the `toy` dialect, is the