a54f4eae0e
Precursor: https://reviews.llvm.org/D110200 Removed redundant ops from the standard dialect that were moved to the `arith` or `math` dialects. Renamed all instances of operations in the codebase and in tests. Reviewed By: rriddle, jpienaar Differential Revision: https://reviews.llvm.org/D110797
187 lines
6.8 KiB
MLIR
187 lines
6.8 KiB
MLIR
// RUN: mlir-opt %s -test-vector-transferop-opt | FileCheck %s
|
|
|
|
// CHECK-LABEL: func @forward_dead_store
|
|
// CHECK-NOT: vector.transfer_write
|
|
// CHECK-NOT: vector.transfer_read
|
|
// CHECK: scf.for
|
|
// CHECK: }
|
|
// CHECK: vector.transfer_write
|
|
// CHECK: return
|
|
func @forward_dead_store(%arg0: i1, %arg1 : memref<4x4xf32>,
|
|
%v0 : vector<1x4xf32>, %v1 : vector<1x4xf32>, %i : index) {
|
|
%c1 = arith.constant 1 : index
|
|
%c4 = arith.constant 4 : index
|
|
%c0 = arith.constant 0 : index
|
|
%cf0 = arith.constant 0.0 : f32
|
|
vector.transfer_write %v0, %arg1[%c1, %c0] {in_bounds = [true, true]} :
|
|
vector<1x4xf32>, memref<4x4xf32>
|
|
%0 = vector.transfer_read %arg1[%c1, %c0], %cf0 {in_bounds = [true, true]} :
|
|
memref<4x4xf32>, vector<1x4xf32>
|
|
%x = scf.for %i0 = %c0 to %c4 step %c1 iter_args(%acc = %0)
|
|
-> (vector<1x4xf32>) {
|
|
%1 = arith.addf %acc, %acc : vector<1x4xf32>
|
|
scf.yield %1 : vector<1x4xf32>
|
|
}
|
|
vector.transfer_write %x, %arg1[%c1, %c0] {in_bounds = [true, true]} :
|
|
vector<1x4xf32>, memref<4x4xf32>
|
|
return
|
|
}
|
|
|
|
// CHECK-LABEL: func @forward_nested
|
|
// CHECK: vector.transfer_write
|
|
// CHECK: vector.transfer_write
|
|
// CHECK: scf.if
|
|
// CHECK-NOT: vector.transfer_read
|
|
// CHECK: }
|
|
// CHECK: vector.transfer_write
|
|
// CHECK: return
|
|
func @forward_nested(%arg0: i1, %arg1 : memref<4x4xf32>, %v0 : vector<1x4xf32>,
|
|
%v1 : vector<1x4xf32>, %i : index) {
|
|
%c0 = arith.constant 0 : index
|
|
%c1 = arith.constant 1 : index
|
|
%cf0 = arith.constant 0.0 : f32
|
|
vector.transfer_write %v1, %arg1[%i, %c0] {in_bounds = [true, true]} :
|
|
vector<1x4xf32>, memref<4x4xf32>
|
|
vector.transfer_write %v0, %arg1[%c1, %c0] {in_bounds = [true, true]} :
|
|
vector<1x4xf32>, memref<4x4xf32>
|
|
%x = scf.if %arg0 -> (vector<1x4xf32>) {
|
|
%0 = vector.transfer_read %arg1[%c1, %c0], %cf0 {in_bounds = [true, true]} :
|
|
memref<4x4xf32>, vector<1x4xf32>
|
|
scf.yield %0 : vector<1x4xf32>
|
|
} else {
|
|
scf.yield %v1 : vector<1x4xf32>
|
|
}
|
|
vector.transfer_write %x, %arg1[%c0, %c0] {in_bounds = [true, true]} :
|
|
vector<1x4xf32>, memref<4x4xf32>
|
|
return
|
|
}
|
|
|
|
// Negative test, the transfer_write in the scf.if region block the store to
|
|
// load forwarding because we don't recursively look into the region to realize
|
|
// that the transfer_write cannot reach the transfer_read.
|
|
// CHECK-LABEL: func @forward_nested_negative
|
|
// CHECK: vector.transfer_write
|
|
// CHECK: scf.if
|
|
// CHECK: vector.transfer_read
|
|
// CHECK: } else {
|
|
// CHECK: vector.transfer_write
|
|
// CHECK: }
|
|
// CHECK: vector.transfer_write
|
|
// CHECK: return
|
|
func @forward_nested_negative(%arg0: i1, %arg1 : memref<4x4xf32>,
|
|
%v0 : vector<1x4xf32>, %v1 : vector<1x4xf32>, %i : index) {
|
|
%c0 = arith.constant 0 : index
|
|
%c1 = arith.constant 1 : index
|
|
%cf0 = arith.constant 0.0 : f32
|
|
vector.transfer_write %v0, %arg1[%c1, %c0] {in_bounds = [true, true]} :
|
|
vector<1x4xf32>, memref<4x4xf32>
|
|
%x = scf.if %arg0 -> (vector<1x4xf32>) {
|
|
%0 = vector.transfer_read %arg1[%c1, %c0], %cf0 {in_bounds = [true, true]} :
|
|
memref<4x4xf32>, vector<1x4xf32>
|
|
scf.yield %0 : vector<1x4xf32>
|
|
} else {
|
|
vector.transfer_write %v1, %arg1[%i, %c0] {in_bounds = [true, true]} :
|
|
vector<1x4xf32>, memref<4x4xf32>
|
|
scf.yield %v1 : vector<1x4xf32>
|
|
}
|
|
vector.transfer_write %x, %arg1[%c0, %i] {in_bounds = [true, true]} :
|
|
vector<1x4xf32>, memref<4x4xf32>
|
|
return
|
|
}
|
|
|
|
// CHECK-LABEL: func @dead_store_region
|
|
// CHECK: vector.transfer_write
|
|
// CHECK: scf.if
|
|
// CHECK: } else {
|
|
// CHECK: vector.transfer_read
|
|
// CHECK: }
|
|
// CHECK: scf.if
|
|
// CHECK-NOT: vector.transfer_write
|
|
// CHECK: }
|
|
// CHECK: vector.transfer_write
|
|
// CHECK-NOT: vector.transfer_write
|
|
// CHECK: vector.transfer_read
|
|
// CHECK: return
|
|
func @dead_store_region(%arg0: i1, %arg1 : memref<4x4xf32>,
|
|
%v0 : vector<1x4xf32>, %v1 : vector<1x4xf32>, %i : index)
|
|
-> (vector<1x4xf32>) {
|
|
%c0 = arith.constant 0 : index
|
|
%c1 = arith.constant 1 : index
|
|
%cf0 = arith.constant 0.0 : f32
|
|
vector.transfer_write %v0, %arg1[%c1, %c0] {in_bounds = [true, true]} :
|
|
vector<1x4xf32>, memref<4x4xf32>
|
|
%x = scf.if %arg0 -> (vector<1x4xf32>) {
|
|
scf.yield %v1 : vector<1x4xf32>
|
|
} else {
|
|
%0 = vector.transfer_read %arg1[%i, %c0], %cf0 {in_bounds = [true, true]} :
|
|
memref<4x4xf32>, vector<1x4xf32>
|
|
scf.yield %0 : vector<1x4xf32>
|
|
}
|
|
scf.if %arg0 {
|
|
vector.transfer_write %v0, %arg1[%c1, %c0] {in_bounds = [true, true]} :
|
|
vector<1x4xf32>, memref<4x4xf32>
|
|
}
|
|
vector.transfer_write %x, %arg1[%c1, %c0] {in_bounds = [true, true]} :
|
|
vector<1x4xf32>, memref<4x4xf32>
|
|
vector.transfer_write %x, %arg1[%c1, %c0] {in_bounds = [true, true]} :
|
|
vector<1x4xf32>, memref<4x4xf32>
|
|
%1 = vector.transfer_read %arg1[%i, %c0], %cf0 {in_bounds = [true, true]} :
|
|
memref<4x4xf32>, vector<1x4xf32>
|
|
return %1 : vector<1x4xf32>
|
|
}
|
|
|
|
// CHECK-LABEL: func @dead_store_negative
|
|
// CHECK: scf.if
|
|
// CHECK: vector.transfer_write
|
|
// CHECK: vector.transfer_read
|
|
// CHECK: } else {
|
|
// CHECK: }
|
|
// CHECK: vector.transfer_write
|
|
// CHECK: return
|
|
func @dead_store_negative(%arg0: i1, %arg1 : memref<4x4xf32>,
|
|
%v0 :vector<1x4xf32>, %v1 : vector<1x4xf32>, %i : index) {
|
|
%c0 = arith.constant 0 : index
|
|
%c1 = arith.constant 1 : index
|
|
%cf0 = arith.constant 0.0 : f32
|
|
%x = scf.if %arg0 -> (vector<1x4xf32>) {
|
|
vector.transfer_write %v0, %arg1[%c1, %c0] {in_bounds = [true, true]} :
|
|
vector<1x4xf32>, memref<4x4xf32>
|
|
%0 = vector.transfer_read %arg1[%i, %c0], %cf0 {in_bounds = [true, true]} :
|
|
memref<4x4xf32>, vector<1x4xf32>
|
|
scf.yield %0 : vector<1x4xf32>
|
|
} else {
|
|
scf.yield %v1 : vector<1x4xf32>
|
|
}
|
|
vector.transfer_write %x, %arg1[%c1, %c0] {in_bounds = [true, true]} :
|
|
vector<1x4xf32>, memref<4x4xf32>
|
|
return
|
|
}
|
|
|
|
// CHECK-LABEL: func @dead_store_nested_region
|
|
// CHECK: scf.if
|
|
// CHECK: vector.transfer_read
|
|
// CHECK: scf.if
|
|
// CHECK-NOT: vector.transfer_write
|
|
// CHECK: }
|
|
// CHECK: vector.transfer_write
|
|
// CHECK: }
|
|
// CHECK: return
|
|
func @dead_store_nested_region(%arg0: i1, %arg1: i1, %arg2 : memref<4x4xf32>,
|
|
%v0 : vector<1x4xf32>, %v1 : vector<1x4xf32>, %i : index) {
|
|
%c0 = arith.constant 0 : index
|
|
%c1 = arith.constant 1 : index
|
|
%cf0 = arith.constant 0.0 : f32
|
|
scf.if %arg0 {
|
|
%0 = vector.transfer_read %arg2[%i, %c0], %cf0 {in_bounds = [true, true]} :
|
|
memref<4x4xf32>, vector<1x4xf32>
|
|
scf.if %arg1 {
|
|
vector.transfer_write %v1, %arg2[%c1, %c0] {in_bounds = [true, true]} :
|
|
vector<1x4xf32>, memref<4x4xf32>
|
|
}
|
|
vector.transfer_write %v0, %arg2[%c1, %c0] {in_bounds = [true, true]} :
|
|
vector<1x4xf32>, memref<4x4xf32>
|
|
}
|
|
return
|
|
}
|
|
|