ebcc022507
This revision refactors the way that attributes/types are considered when generating aliases. Instead of considering all of the attributes/types of every operation, we perform a "fake" print step that prints the operations using a dummy printer to collect the attributes and types that would actually be printed during the real process. This removes a lot of attributes/types from consideration that generally won't end up in the final output, e.g. affine map attributes in an `affine.apply`/`affine.for`. This resolves a long standing TODO w.r.t aliases, and helps to have a much cleaner textual output format. As a datapoint to the latter, as part of this change several tests were identified as testing for the presence of attributes aliases that weren't actually referenced by the custom form of any operation. To ensure that this wouldn't cause a large degradation in compile time due to the second full print, I benchmarked this change on a very large module with a lot of operations(The file is ~673M/~4.7 million lines long). This file before this change take ~6.9 seconds to print in the custom form, and ~7 seconds after this change. In the custom assembly case, this added an average of a little over ~100 miliseconds to the compile time. This increase was due to the way that argument attributes on functions are structured and how they get printed; i.e. with a better representation the negative impact here can be greatly decreased. When printing in the generic form, this revision had no observable impact on the compile time. This benchmarking leads me to believe that the impact of this change on compile time w.r.t printing is closely related to `print` methods that perform a lot of additional/complex processing outside of the OpAsmPrinter. Differential Revision: https://reviews.llvm.org/D90512
616 lines
17 KiB
MLIR
616 lines
17 KiB
MLIR
// RUN: mlir-opt %s -affine-loop-invariant-code-motion -split-input-file | FileCheck %s
|
|
|
|
func @nested_loops_both_having_invariant_code() {
|
|
%m = alloc() : memref<10xf32>
|
|
%cf7 = constant 7.0 : f32
|
|
%cf8 = constant 8.0 : f32
|
|
|
|
affine.for %arg0 = 0 to 10 {
|
|
%v0 = addf %cf7, %cf8 : f32
|
|
affine.for %arg1 = 0 to 10 {
|
|
affine.store %v0, %m[%arg0] : memref<10xf32>
|
|
}
|
|
}
|
|
|
|
// CHECK: %0 = alloc() : memref<10xf32>
|
|
// CHECK-NEXT: %cst = constant 7.000000e+00 : f32
|
|
// CHECK-NEXT: %cst_0 = constant 8.000000e+00 : f32
|
|
// CHECK-NEXT: %1 = addf %cst, %cst_0 : f32
|
|
// CHECK-NEXT: affine.for %arg0 = 0 to 10 {
|
|
// CHECK-NEXT: affine.store %1, %0[%arg0] : memref<10xf32>
|
|
|
|
return
|
|
}
|
|
|
|
// -----
|
|
|
|
// The store-load forwarding can see through affine apply's since it relies on
|
|
// dependence information.
|
|
// CHECK-LABEL: func @store_affine_apply
|
|
func @store_affine_apply() -> memref<10xf32> {
|
|
%cf7 = constant 7.0 : f32
|
|
%m = alloc() : memref<10xf32>
|
|
affine.for %arg0 = 0 to 10 {
|
|
%t0 = affine.apply affine_map<(d1) -> (d1 + 1)>(%arg0)
|
|
affine.store %cf7, %m[%t0] : memref<10xf32>
|
|
}
|
|
return %m : memref<10xf32>
|
|
// CHECK: %cst = constant 7.000000e+00 : f32
|
|
// CHECK-NEXT: %0 = alloc() : memref<10xf32>
|
|
// CHECK-NEXT: affine.for %arg0 = 0 to 10 {
|
|
// CHECK-NEXT: %1 = affine.apply #map{{[0-9]*}}(%arg0)
|
|
// CHECK-NEXT: affine.store %cst, %0[%1] : memref<10xf32>
|
|
// CHECK-NEXT: }
|
|
// CHECK-NEXT: return %0 : memref<10xf32>
|
|
}
|
|
|
|
// -----
|
|
|
|
func @nested_loops_code_invariant_to_both() {
|
|
%m = alloc() : memref<10xf32>
|
|
%cf7 = constant 7.0 : f32
|
|
%cf8 = constant 8.0 : f32
|
|
|
|
affine.for %arg0 = 0 to 10 {
|
|
affine.for %arg1 = 0 to 10 {
|
|
%v0 = addf %cf7, %cf8 : f32
|
|
}
|
|
}
|
|
|
|
// CHECK: %0 = alloc() : memref<10xf32>
|
|
// CHECK-NEXT: %cst = constant 7.000000e+00 : f32
|
|
// CHECK-NEXT: %cst_0 = constant 8.000000e+00 : f32
|
|
// CHECK-NEXT: %1 = addf %cst, %cst_0 : f32
|
|
|
|
return
|
|
}
|
|
|
|
// -----
|
|
|
|
func @single_loop_nothing_invariant() {
|
|
%m1 = alloc() : memref<10xf32>
|
|
%m2 = alloc() : memref<10xf32>
|
|
affine.for %arg0 = 0 to 10 {
|
|
%v0 = affine.load %m1[%arg0] : memref<10xf32>
|
|
%v1 = affine.load %m2[%arg0] : memref<10xf32>
|
|
%v2 = addf %v0, %v1 : f32
|
|
affine.store %v2, %m1[%arg0] : memref<10xf32>
|
|
}
|
|
|
|
// CHECK: %0 = alloc() : memref<10xf32>
|
|
// CHECK-NEXT: %1 = alloc() : memref<10xf32>
|
|
// CHECK-NEXT: affine.for %arg0 = 0 to 10 {
|
|
// CHECK-NEXT: %2 = affine.load %0[%arg0] : memref<10xf32>
|
|
// CHECK-NEXT: %3 = affine.load %1[%arg0] : memref<10xf32>
|
|
// CHECK-NEXT: %4 = addf %2, %3 : f32
|
|
// CHECK-NEXT: affine.store %4, %0[%arg0] : memref<10xf32>
|
|
|
|
return
|
|
}
|
|
|
|
// -----
|
|
|
|
func @invariant_code_inside_affine_if() {
|
|
%m = alloc() : memref<10xf32>
|
|
%cf8 = constant 8.0 : f32
|
|
|
|
affine.for %arg0 = 0 to 10 {
|
|
%t0 = affine.apply affine_map<(d1) -> (d1 + 1)>(%arg0)
|
|
affine.if affine_set<(d0, d1) : (d1 - d0 >= 0)> (%arg0, %t0) {
|
|
%cf9 = addf %cf8, %cf8 : f32
|
|
affine.store %cf9, %m[%arg0] : memref<10xf32>
|
|
|
|
}
|
|
}
|
|
|
|
// CHECK: %0 = alloc() : memref<10xf32>
|
|
// CHECK-NEXT: %cst = constant 8.000000e+00 : f32
|
|
// CHECK-NEXT: affine.for %arg0 = 0 to 10 {
|
|
// CHECK-NEXT: %1 = affine.apply #map{{[0-9]*}}(%arg0)
|
|
// CHECK-NEXT: affine.if #set(%arg0, %1) {
|
|
// CHECK-NEXT: %2 = addf %cst, %cst : f32
|
|
// CHECK-NEXT: affine.store %2, %0[%arg0] : memref<10xf32>
|
|
// CHECK-NEXT: }
|
|
|
|
|
|
return
|
|
}
|
|
|
|
// -----
|
|
|
|
func @dependent_stores() {
|
|
%m = alloc() : memref<10xf32>
|
|
%cf7 = constant 7.0 : f32
|
|
%cf8 = constant 8.0 : f32
|
|
|
|
affine.for %arg0 = 0 to 10 {
|
|
%v0 = addf %cf7, %cf8 : f32
|
|
affine.for %arg1 = 0 to 10 {
|
|
%v1 = addf %cf7, %cf7 : f32
|
|
affine.store %v1, %m[%arg1] : memref<10xf32>
|
|
affine.store %v0, %m[%arg0] : memref<10xf32>
|
|
}
|
|
}
|
|
|
|
// CHECK: %0 = alloc() : memref<10xf32>
|
|
// CHECK-NEXT: %cst = constant 7.000000e+00 : f32
|
|
// CHECK-NEXT: %cst_0 = constant 8.000000e+00 : f32
|
|
// CHECK-NEXT: %1 = addf %cst, %cst_0 : f32
|
|
// CHECK-NEXT: %2 = addf %cst, %cst : f32
|
|
// CHECK-NEXT: affine.for %arg0 = 0 to 10 {
|
|
|
|
// CHECK-NEXT: affine.for %arg1 = 0 to 10 {
|
|
// CHECK-NEXT: affine.store %2, %0[%arg1] : memref<10xf32>
|
|
// CHECK-NEXT: affine.store %1, %0[%arg0] : memref<10xf32>
|
|
|
|
return
|
|
}
|
|
|
|
// -----
|
|
|
|
func @independent_stores() {
|
|
%m = alloc() : memref<10xf32>
|
|
%cf7 = constant 7.0 : f32
|
|
%cf8 = constant 8.0 : f32
|
|
|
|
affine.for %arg0 = 0 to 10 {
|
|
%v0 = addf %cf7, %cf8 : f32
|
|
affine.for %arg1 = 0 to 10 {
|
|
%v1 = addf %cf7, %cf7 : f32
|
|
affine.store %v0, %m[%arg0] : memref<10xf32>
|
|
affine.store %v1, %m[%arg1] : memref<10xf32>
|
|
}
|
|
}
|
|
|
|
// CHECK: %0 = alloc() : memref<10xf32>
|
|
// CHECK-NEXT: %cst = constant 7.000000e+00 : f32
|
|
// CHECK-NEXT: %cst_0 = constant 8.000000e+00 : f32
|
|
// CHECK-NEXT: %1 = addf %cst, %cst_0 : f32
|
|
// CHECK-NEXT: %2 = addf %cst, %cst : f32
|
|
// CHECK-NEXT: affine.for %arg0 = 0 to 10 {
|
|
// CHECK-NEXT: affine.for %arg1 = 0 to 10 {
|
|
// CHECK-NEXT: affine.store %1, %0[%arg0] : memref<10xf32>
|
|
// CHECK-NEXT: affine.store %2, %0[%arg1] : memref<10xf32>
|
|
// CHECK-NEXT: }
|
|
|
|
return
|
|
}
|
|
|
|
// -----
|
|
|
|
func @load_dependent_store() {
|
|
%m = alloc() : memref<10xf32>
|
|
%cf7 = constant 7.0 : f32
|
|
%cf8 = constant 8.0 : f32
|
|
|
|
affine.for %arg0 = 0 to 10 {
|
|
%v0 = addf %cf7, %cf8 : f32
|
|
affine.for %arg1 = 0 to 10 {
|
|
%v1 = addf %cf7, %cf7 : f32
|
|
affine.store %v0, %m[%arg1] : memref<10xf32>
|
|
%v2 = affine.load %m[%arg0] : memref<10xf32>
|
|
}
|
|
}
|
|
|
|
// CHECK: %0 = alloc() : memref<10xf32>
|
|
// CHECK-NEXT: %cst = constant 7.000000e+00 : f32
|
|
// CHECK-NEXT: %cst_0 = constant 8.000000e+00 : f32
|
|
// CHECK-NEXT: %1 = addf %cst, %cst_0 : f32
|
|
// CHECK-NEXT: %2 = addf %cst, %cst : f32
|
|
// CHECK-NEXT: affine.for %arg0 = 0 to 10 {
|
|
// CHECK-NEXT: affine.for %arg1 = 0 to 10 {
|
|
// CHECK-NEXT: affine.store %1, %0[%arg1] : memref<10xf32>
|
|
// CHECK-NEXT: %3 = affine.load %0[%arg0] : memref<10xf32>
|
|
|
|
return
|
|
}
|
|
|
|
// -----
|
|
|
|
func @load_after_load() {
|
|
%m = alloc() : memref<10xf32>
|
|
%cf7 = constant 7.0 : f32
|
|
%cf8 = constant 8.0 : f32
|
|
|
|
affine.for %arg0 = 0 to 10 {
|
|
%v0 = addf %cf7, %cf8 : f32
|
|
affine.for %arg1 = 0 to 10 {
|
|
%v1 = addf %cf7, %cf7 : f32
|
|
%v3 = affine.load %m[%arg1] : memref<10xf32>
|
|
%v2 = affine.load %m[%arg0] : memref<10xf32>
|
|
}
|
|
}
|
|
|
|
// CHECK: %0 = alloc() : memref<10xf32>
|
|
// CHECK-NEXT: %cst = constant 7.000000e+00 : f32
|
|
// CHECK-NEXT: %cst_0 = constant 8.000000e+00 : f32
|
|
// CHECK-NEXT: %1 = addf %cst, %cst_0 : f32
|
|
// CHECK-NEXT: %2 = addf %cst, %cst : f32
|
|
// CHECK-NEXT: affine.for %arg0 = 0 to 10 {
|
|
// CHECK-NEXT: %3 = affine.load %0[%arg0] : memref<10xf32>
|
|
// CHECK-NEXT: affine.for %arg1 = 0 to 10 {
|
|
// CHECK-NEXT: %4 = affine.load %0[%arg1] : memref<10xf32>
|
|
|
|
return
|
|
}
|
|
|
|
// -----
|
|
|
|
func @invariant_affine_if() {
|
|
%m = alloc() : memref<10xf32>
|
|
%cf8 = constant 8.0 : f32
|
|
affine.for %arg0 = 0 to 10 {
|
|
affine.for %arg1 = 0 to 10 {
|
|
affine.if affine_set<(d0, d1) : (d1 - d0 >= 0)> (%arg0, %arg0) {
|
|
%cf9 = addf %cf8, %cf8 : f32
|
|
affine.store %cf9, %m[%arg0] : memref<10xf32>
|
|
|
|
}
|
|
}
|
|
}
|
|
|
|
// CHECK: %0 = alloc() : memref<10xf32>
|
|
// CHECK-NEXT: %cst = constant 8.000000e+00 : f32
|
|
// CHECK-NEXT: affine.for %arg0 = 0 to 10 {
|
|
// CHECK-NEXT: affine.if #set(%arg0, %arg0) {
|
|
// CHECK-NEXT: %1 = addf %cst, %cst : f32
|
|
// CHECK-NEXT: affine.store %1, %0[%arg0] : memref<10xf32>
|
|
// CHECK-NEXT: }
|
|
|
|
|
|
return
|
|
}
|
|
|
|
// -----
|
|
|
|
func @invariant_affine_if2() {
|
|
%m = alloc() : memref<10xf32>
|
|
%cf8 = constant 8.0 : f32
|
|
affine.for %arg0 = 0 to 10 {
|
|
affine.for %arg1 = 0 to 10 {
|
|
affine.if affine_set<(d0, d1) : (d1 - d0 >= 0)> (%arg0, %arg0) {
|
|
%cf9 = addf %cf8, %cf8 : f32
|
|
affine.store %cf9, %m[%arg1] : memref<10xf32>
|
|
|
|
}
|
|
}
|
|
}
|
|
|
|
// CHECK: %0 = alloc() : memref<10xf32>
|
|
// CHECK-NEXT: %cst = constant 8.000000e+00 : f32
|
|
// CHECK-NEXT: affine.for %arg0 = 0 to 10 {
|
|
// CHECK-NEXT: affine.for %arg1 = 0 to 10 {
|
|
// CHECK-NEXT: affine.if #set(%arg0, %arg0) {
|
|
// CHECK-NEXT: %1 = addf %cst, %cst : f32
|
|
// CHECK-NEXT: affine.store %1, %0[%arg1] : memref<10xf32>
|
|
// CHECK-NEXT: }
|
|
// CHECK-NEXT: }
|
|
|
|
|
|
return
|
|
}
|
|
|
|
// -----
|
|
|
|
func @invariant_affine_nested_if() {
|
|
%m = alloc() : memref<10xf32>
|
|
%cf8 = constant 8.0 : f32
|
|
affine.for %arg0 = 0 to 10 {
|
|
affine.for %arg1 = 0 to 10 {
|
|
affine.if affine_set<(d0, d1) : (d1 - d0 >= 0)> (%arg0, %arg0) {
|
|
%cf9 = addf %cf8, %cf8 : f32
|
|
affine.store %cf9, %m[%arg0] : memref<10xf32>
|
|
affine.if affine_set<(d0, d1) : (d1 - d0 >= 0)> (%arg0, %arg0) {
|
|
affine.store %cf9, %m[%arg1] : memref<10xf32>
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
// CHECK: %0 = alloc() : memref<10xf32>
|
|
// CHECK-NEXT: %cst = constant 8.000000e+00 : f32
|
|
// CHECK-NEXT: affine.for %arg0 = 0 to 10 {
|
|
// CHECK-NEXT: affine.for %arg1 = 0 to 10 {
|
|
// CHECK-NEXT: affine.if #set(%arg0, %arg0) {
|
|
// CHECK-NEXT: %1 = addf %cst, %cst : f32
|
|
// CHECK-NEXT: affine.store %1, %0[%arg0] : memref<10xf32>
|
|
// CHECK-NEXT: affine.if #set(%arg0, %arg0) {
|
|
// CHECK-NEXT: affine.store %1, %0[%arg1] : memref<10xf32>
|
|
// CHECK-NEXT: }
|
|
// CHECK-NEXT: }
|
|
// CHECK-NEXT: }
|
|
|
|
|
|
return
|
|
}
|
|
|
|
// -----
|
|
|
|
func @invariant_affine_nested_if_else() {
|
|
%m = alloc() : memref<10xf32>
|
|
%cf8 = constant 8.0 : f32
|
|
affine.for %arg0 = 0 to 10 {
|
|
affine.for %arg1 = 0 to 10 {
|
|
affine.if affine_set<(d0, d1) : (d1 - d0 >= 0)> (%arg0, %arg0) {
|
|
%cf9 = addf %cf8, %cf8 : f32
|
|
affine.store %cf9, %m[%arg0] : memref<10xf32>
|
|
affine.if affine_set<(d0, d1) : (d1 - d0 >= 0)> (%arg0, %arg0) {
|
|
affine.store %cf9, %m[%arg0] : memref<10xf32>
|
|
} else {
|
|
affine.store %cf9, %m[%arg1] : memref<10xf32>
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
// CHECK: %0 = alloc() : memref<10xf32>
|
|
// CHECK-NEXT: %cst = constant 8.000000e+00 : f32
|
|
// CHECK-NEXT: affine.for %arg0 = 0 to 10 {
|
|
// CHECK-NEXT: affine.for %arg1 = 0 to 10 {
|
|
// CHECK-NEXT: affine.if #set(%arg0, %arg0) {
|
|
// CHECK-NEXT: %1 = addf %cst, %cst : f32
|
|
// CHECK-NEXT: affine.store %1, %0[%arg0] : memref<10xf32>
|
|
// CHECK-NEXT: affine.if #set(%arg0, %arg0) {
|
|
// CHECK-NEXT: affine.store %1, %0[%arg0] : memref<10xf32>
|
|
// CHECK-NEXT: } else {
|
|
// CHECK-NEXT: affine.store %1, %0[%arg1] : memref<10xf32>
|
|
// CHECK-NEXT: }
|
|
// CHECK-NEXT: }
|
|
// CHECK-NEXT: }
|
|
|
|
|
|
return
|
|
}
|
|
|
|
// -----
|
|
|
|
func @invariant_affine_nested_if_else2() {
|
|
%m = alloc() : memref<10xf32>
|
|
%m2 = alloc() : memref<10xf32>
|
|
%cf8 = constant 8.0 : f32
|
|
affine.for %arg0 = 0 to 10 {
|
|
affine.for %arg1 = 0 to 10 {
|
|
affine.if affine_set<(d0, d1) : (d1 - d0 >= 0)> (%arg0, %arg0) {
|
|
%cf9 = addf %cf8, %cf8 : f32
|
|
%tload1 = affine.load %m[%arg0] : memref<10xf32>
|
|
affine.if affine_set<(d0, d1) : (d1 - d0 >= 0)> (%arg0, %arg0) {
|
|
affine.store %cf9, %m2[%arg0] : memref<10xf32>
|
|
} else {
|
|
%tload2 = affine.load %m[%arg0] : memref<10xf32>
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
// CHECK: %0 = alloc() : memref<10xf32>
|
|
// CHECK-NEXT: %1 = alloc() : memref<10xf32>
|
|
// CHECK-NEXT: %cst = constant 8.000000e+00 : f32
|
|
// CHECK-NEXT: affine.for %arg0 = 0 to 10 {
|
|
// CHECK-NEXT: affine.if #set(%arg0, %arg0) {
|
|
// CHECK-NEXT: %2 = addf %cst, %cst : f32
|
|
// CHECK-NEXT: %3 = affine.load %0[%arg0] : memref<10xf32>
|
|
// CHECK-NEXT: affine.if #set(%arg0, %arg0) {
|
|
// CHECK-NEXT: affine.store %2, %1[%arg0] : memref<10xf32>
|
|
// CHECK-NEXT: } else {
|
|
// CHECK-NEXT: %4 = affine.load %0[%arg0] : memref<10xf32>
|
|
// CHECK-NEXT: }
|
|
// CHECK-NEXT: }
|
|
|
|
|
|
return
|
|
}
|
|
|
|
// -----
|
|
|
|
func @invariant_affine_nested_if2() {
|
|
%m = alloc() : memref<10xf32>
|
|
%cf8 = constant 8.0 : f32
|
|
affine.for %arg0 = 0 to 10 {
|
|
affine.for %arg1 = 0 to 10 {
|
|
affine.if affine_set<(d0, d1) : (d1 - d0 >= 0)> (%arg0, %arg0) {
|
|
%cf9 = addf %cf8, %cf8 : f32
|
|
%v1 = affine.load %m[%arg0] : memref<10xf32>
|
|
affine.if affine_set<(d0, d1) : (d1 - d0 >= 0)> (%arg0, %arg0) {
|
|
%v2 = affine.load %m[%arg0] : memref<10xf32>
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
// CHECK: %0 = alloc() : memref<10xf32>
|
|
// CHECK-NEXT: %cst = constant 8.000000e+00 : f32
|
|
// CHECK-NEXT: affine.for %arg0 = 0 to 10 {
|
|
// CHECK-NEXT: affine.if #set(%arg0, %arg0) {
|
|
// CHECK-NEXT: %1 = addf %cst, %cst : f32
|
|
// CHECK-NEXT: %2 = affine.load %0[%arg0] : memref<10xf32>
|
|
// CHECK-NEXT: affine.if #set(%arg0, %arg0) {
|
|
// CHECK-NEXT: %3 = affine.load %0[%arg0] : memref<10xf32>
|
|
// CHECK-NEXT: }
|
|
// CHECK-NEXT: }
|
|
|
|
|
|
return
|
|
}
|
|
|
|
// -----
|
|
|
|
func @invariant_affine_for_inside_affine_if() {
|
|
%m = alloc() : memref<10xf32>
|
|
%cf8 = constant 8.0 : f32
|
|
affine.for %arg0 = 0 to 10 {
|
|
affine.for %arg1 = 0 to 10 {
|
|
affine.if affine_set<(d0, d1) : (d1 - d0 >= 0)> (%arg0, %arg0) {
|
|
%cf9 = addf %cf8, %cf8 : f32
|
|
affine.store %cf9, %m[%arg0] : memref<10xf32>
|
|
affine.for %arg2 = 0 to 10 {
|
|
affine.store %cf9, %m[%arg2] : memref<10xf32>
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
// CHECK: %0 = alloc() : memref<10xf32>
|
|
// CHECK-NEXT: %cst = constant 8.000000e+00 : f32
|
|
// CHECK-NEXT: affine.for %arg0 = 0 to 10 {
|
|
// CHECK-NEXT: affine.for %arg1 = 0 to 10 {
|
|
// CHECK-NEXT: affine.if #set(%arg0, %arg0) {
|
|
// CHECK-NEXT: %1 = addf %cst, %cst : f32
|
|
// CHECK-NEXT: affine.store %1, %0[%arg0] : memref<10xf32>
|
|
// CHECK-NEXT: affine.for %arg2 = 0 to 10 {
|
|
// CHECK-NEXT: affine.store %1, %0[%arg2] : memref<10xf32>
|
|
// CHECK-NEXT: }
|
|
// CHECK-NEXT: }
|
|
// CHECK-NEXT: }
|
|
|
|
|
|
return
|
|
}
|
|
|
|
// -----
|
|
|
|
func @invariant_constant_and_load() {
|
|
%m = alloc() : memref<100xf32>
|
|
%m2 = alloc() : memref<100xf32>
|
|
affine.for %arg0 = 0 to 5 {
|
|
%c0 = constant 0 : index
|
|
%v = affine.load %m2[%c0] : memref<100xf32>
|
|
affine.store %v, %m[%arg0] : memref<100xf32>
|
|
}
|
|
|
|
// CHECK: %0 = alloc() : memref<100xf32>
|
|
// CHECK-NEXT: %1 = alloc() : memref<100xf32>
|
|
// CHECK-NEXT: %c0 = constant 0 : index
|
|
// CHECK-NEXT: %2 = affine.load %1[%c0] : memref<100xf32>
|
|
// CHECK-NEXT: affine.for %arg0 = 0 to 5 {
|
|
// CHECK-NEXT: affine.store %2, %0[%arg0] : memref<100xf32>
|
|
|
|
|
|
return
|
|
}
|
|
|
|
// -----
|
|
|
|
func @nested_load_store_same_memref() {
|
|
%m = alloc() : memref<10xf32>
|
|
%cst = constant 8.0 : f32
|
|
%c0 = constant 0 : index
|
|
affine.for %arg0 = 0 to 10 {
|
|
%v0 = affine.load %m[%c0] : memref<10xf32>
|
|
affine.for %arg1 = 0 to 10 {
|
|
affine.store %cst, %m[%arg1] : memref<10xf32>
|
|
}
|
|
}
|
|
|
|
// CHECK: %0 = alloc() : memref<10xf32>
|
|
// CHECK-NEXT: %cst = constant 8.000000e+00 : f32
|
|
// CHECK-NEXT: %c0 = constant 0 : index
|
|
// CHECK-NEXT: affine.for %arg0 = 0 to 10 {
|
|
// CHECK-NEXT: %1 = affine.load %0[%c0] : memref<10xf32>
|
|
// CHECK-NEXT: affine.for %arg1 = 0 to 10 {
|
|
// CHECK-NEXT: affine.store %cst, %0[%arg1] : memref<10xf32>
|
|
|
|
|
|
return
|
|
}
|
|
|
|
// -----
|
|
|
|
func @nested_load_store_same_memref2() {
|
|
%m = alloc() : memref<10xf32>
|
|
%cst = constant 8.0 : f32
|
|
%c0 = constant 0 : index
|
|
affine.for %arg0 = 0 to 10 {
|
|
affine.store %cst, %m[%c0] : memref<10xf32>
|
|
affine.for %arg1 = 0 to 10 {
|
|
%v0 = affine.load %m[%arg0] : memref<10xf32>
|
|
}
|
|
}
|
|
|
|
// CHECK: %0 = alloc() : memref<10xf32>
|
|
// CHECK-NEXT: %cst = constant 8.000000e+00 : f32
|
|
// CHECK-NEXT: %c0 = constant 0 : index
|
|
// CHECK-NEXT: affine.for %arg0 = 0 to 10 {
|
|
// CHECK-NEXT: affine.store %cst, %0[%c0] : memref<10xf32>
|
|
// CHECK-NEXT: %1 = affine.load %0[%arg0] : memref<10xf32>
|
|
|
|
|
|
return
|
|
}
|
|
|
|
// -----
|
|
|
|
// CHECK-LABEL: func @do_not_hoist_dependent_side_effect_free_op
|
|
func @do_not_hoist_dependent_side_effect_free_op(%arg0: memref<10x512xf32>) {
|
|
%0 = alloca() : memref<1xf32>
|
|
%cst = constant 8.0 : f32
|
|
affine.for %i = 0 to 512 {
|
|
affine.for %j = 0 to 10 {
|
|
%5 = affine.load %arg0[%i, %j] : memref<10x512xf32>
|
|
%6 = affine.load %0[0] : memref<1xf32>
|
|
%add = addf %5, %6 : f32
|
|
affine.store %add, %0[0] : memref<1xf32>
|
|
}
|
|
%3 = affine.load %0[0] : memref<1xf32>
|
|
%4 = mulf %3, %cst : f32 // It shouldn't be hoisted.
|
|
}
|
|
return
|
|
}
|
|
|
|
// CHECK: affine.for
|
|
// CHECK-NEXT: affine.for
|
|
// CHECK-NEXT: affine.load
|
|
// CHECK-NEXT: affine.load
|
|
// CHECK-NEXT: addf
|
|
// CHECK-NEXT: affine.store
|
|
// CHECK-NEXT: }
|
|
// CHECK-NEXT: affine.load
|
|
// CHECK-NEXT: mulf
|
|
// CHECK-NEXT: }
|
|
|
|
// -----
|
|
|
|
// CHECK-LABEL: func @vector_loop_nothing_invariant
|
|
func @vector_loop_nothing_invariant() {
|
|
%m1 = alloc() : memref<40xf32>
|
|
%m2 = alloc() : memref<40xf32>
|
|
affine.for %arg0 = 0 to 10 {
|
|
%v0 = affine.vector_load %m1[%arg0*4] : memref<40xf32>, vector<4xf32>
|
|
%v1 = affine.vector_load %m2[%arg0*4] : memref<40xf32>, vector<4xf32>
|
|
%v2 = addf %v0, %v1 : vector<4xf32>
|
|
affine.vector_store %v2, %m1[%arg0*4] : memref<40xf32>, vector<4xf32>
|
|
}
|
|
return
|
|
}
|
|
|
|
// CHECK: affine.for
|
|
// CHECK-NEXT: affine.vector_load
|
|
// CHECK-NEXT: affine.vector_load
|
|
// CHECK-NEXT: addf
|
|
// CHECK-NEXT: affine.vector_store
|
|
// CHECK-NEXT: }
|
|
|
|
// -----
|
|
|
|
// CHECK-LABEL: func @vector_loop_all_invariant
|
|
func @vector_loop_all_invariant() {
|
|
%m1 = alloc() : memref<4xf32>
|
|
%m2 = alloc() : memref<4xf32>
|
|
%m3 = alloc() : memref<4xf32>
|
|
affine.for %arg0 = 0 to 10 {
|
|
%v0 = affine.vector_load %m1[0] : memref<4xf32>, vector<4xf32>
|
|
%v1 = affine.vector_load %m2[0] : memref<4xf32>, vector<4xf32>
|
|
%v2 = addf %v0, %v1 : vector<4xf32>
|
|
affine.vector_store %v2, %m3[0] : memref<4xf32>, vector<4xf32>
|
|
}
|
|
return
|
|
}
|
|
|
|
// CHECK: alloc()
|
|
// CHECK-NEXT: alloc()
|
|
// CHECK-NEXT: alloc()
|
|
// CHECK-NEXT: affine.vector_load
|
|
// CHECK-NEXT: affine.vector_load
|
|
// CHECK-NEXT: addf
|
|
// CHECK-NEXT: affine.vector_store
|
|
// CHECK-NEXT: affine.for
|