-
Notifications
You must be signed in to change notification settings - Fork 83
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Provide testing and explanatory filecheck.
- Loading branch information
1 parent
9f04c56
commit 39aaff2
Showing
1 changed file
with
65 additions
and
0 deletions.
There are no files selected for viewing
65 changes: 65 additions & 0 deletions
65
tests/filecheck/mlir-conversion/with-mlir/control_flow_hoist_collab.mlir
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,65 @@ | ||
// RUN: xdsl-opt -p "mlir-opt[loop-invariant-code-motion]" %s | filecheck %s --check-prefix WITHOUT | ||
// RUN: xdsl-opt -p "control-flow-hoist,mlir-opt[loop-invariant-code-motion]" %s | filecheck %s --check-prefix WITH | ||
|
||
func.func @nested_loop_invariant(%n : index) { | ||
%0 = arith.constant 0 : index | ||
%1 = arith.constant 1 : index | ||
%100 = arith.constant 100 : index | ||
scf.for %i = %0 to %100 step %1 { | ||
%cond = "test.op"() : () -> (i1) | ||
%thing = "scf.if"(%cond) ({ | ||
// This is loop invariant | ||
// Also is nested in conditional | ||
// Contradictory local intuitions :S | ||
// MLIR really want to keep operations nested if they only occur on one | ||
// branch, which locally makes sense! | ||
%n100 = arith.muli %n, %100 : index | ||
scf.yield %n100 :index | ||
}, { | ||
scf.yield %n : index | ||
}) : (i1) -> index | ||
"test.op"(%thing) : (index) -> () | ||
scf.yield | ||
} | ||
return | ||
} | ||
|
||
// Currently, loop-invariant-code-motion does not help. | ||
|
||
// WITHOUT: func.func @nested_loop_invariant(%arg0 : index) { | ||
// WITHOUT-NEXT: %0 = arith.constant 0 : index | ||
// WITHOUT-NEXT: %1 = arith.constant 1 : index | ||
// WITHOUT-NEXT: %2 = arith.constant 100 : index | ||
// WITHOUT-NEXT: scf.for %arg1 = %0 to %2 step %1 { | ||
// WITHOUT-NEXT: %3 = "test.op"() : () -> i1 | ||
// WITHOUT-NEXT: %4 = "scf.if"(%3) ({ | ||
// WITHOUT-NEXT: %5 = arith.muli %arg0, %2 : index | ||
// WITHOUT-NEXT: scf.yield %5 : index | ||
// WITHOUT-NEXT: }, { | ||
// WITHOUT-NEXT: scf.yield %arg0 : index | ||
// WITHOUT-NEXT: }) : (i1) -> index | ||
// WITHOUT-NEXT: "test.op"(%4) : (index) -> () | ||
// WITHOUT-NEXT: } | ||
// WITHOUT-NEXT: func.return | ||
// WITHOUT-NEXT: } | ||
|
||
// With control-flow-hoist, we force things to bubble up at loop-level, to get further hoisted as loop invariant. | ||
// MLIR already provides the opposit control-flow-sink to put whatever was *invariant* back in the right branches | ||
// if so desired | ||
|
||
// WITH: func.func @nested_loop_invariant(%arg0 : index) { | ||
// WITH-NEXT: %0 = arith.constant 0 : index | ||
// WITH-NEXT: %1 = arith.constant 1 : index | ||
// WITH-NEXT: %2 = arith.constant 100 : index | ||
// WITH-NEXT: %3 = arith.muli %arg0, %2 : index | ||
// WITH-NEXT: scf.for %arg1 = %0 to %2 step %1 { | ||
// WITH-NEXT: %4 = "test.op"() : () -> i1 | ||
// WITH-NEXT: %5 = "scf.if"(%4) ({ | ||
// WITH-NEXT: scf.yield %3 : index | ||
// WITH-NEXT: }, { | ||
// WITH-NEXT: scf.yield %arg0 : index | ||
// WITH-NEXT: }) : (i1) -> index | ||
// WITH-NEXT: "test.op"(%5) : (index) -> () | ||
// WITH-NEXT: } | ||
// WITH-NEXT: func.return | ||
// WITH-NEXT: } |