llvm-project/mlir/test/Transforms/test-toposort.mlir

76 lines
1.9 KiB
MLIR

// RUN: mlir-opt -topological-sort %s | FileCheck %s
// Test producer is after user.
// CHECK-LABEL: test.graph_region
test.graph_region {
// CHECK-NEXT: test.foo
// CHECK-NEXT: test.baz
// CHECK-NEXT: test.bar
%0 = "test.foo"() : () -> i32
"test.bar"(%1, %0) : (i32, i32) -> ()
%1 = "test.baz"() : () -> i32
}
// Test cycles.
// CHECK-LABEL: test.graph_region
test.graph_region {
// CHECK-NEXT: test.d
// CHECK-NEXT: test.a
// CHECK-NEXT: test.c
// CHECK-NEXT: test.b
%2 = "test.c"(%1) : (i32) -> i32
%1 = "test.b"(%0, %2) : (i32, i32) -> i32
%0 = "test.a"(%3) : (i32) -> i32
%3 = "test.d"() : () -> i32
}
// Test block arguments.
// CHECK-LABEL: test.graph_region
test.graph_region {
// CHECK-NEXT: (%{{.*}}:
^entry(%arg0: i32):
// CHECK-NEXT: test.foo
// CHECK-NEXT: test.baz
// CHECK-NEXT: test.bar
%0 = "test.foo"(%arg0) : (i32) -> i32
"test.bar"(%1, %0) : (i32, i32) -> ()
%1 = "test.baz"(%arg0) : (i32) -> i32
}
// Test implicit block capture (and sort nested region).
// CHECK-LABEL: test.graph_region
func.func @test_graph_cfg() -> () {
%0 = "test.foo"() : () -> i32
cf.br ^next(%0 : i32)
^next(%1: i32):
test.graph_region {
// CHECK-NEXT: test.foo
// CHECK-NEXT: test.baz
// CHECK-NEXT: test.bar
%2 = "test.foo"(%1) : (i32) -> i32
"test.bar"(%3, %2) : (i32, i32) -> ()
%3 = "test.baz"(%0) : (i32) -> i32
}
return
}
// Test region ops (and recursive sort).
// CHECK-LABEL: test.graph_region
test.graph_region {
// CHECK-NEXT: test.baz
// CHECK-NEXT: test.graph_region attributes {a} {
// CHECK-NEXT: test.b
// CHECK-NEXT: test.a
// CHECK-NEXT: }
// CHECK-NEXT: test.bar
// CHECK-NEXT: test.foo
%0 = "test.foo"(%1) : (i32) -> i32
test.graph_region attributes {a} {
%a = "test.a"(%b) : (i32) -> i32
%b = "test.b"(%2) : (i32) -> i32
}
%1 = "test.bar"(%2) : (i32) -> i32
%2 = "test.baz"() : () -> i32
}