72 lines
2.5 KiB
MLIR
72 lines
2.5 KiB
MLIR
|
// RUN: mlir-opt -lower-affine --split-input-file %s | FileCheck %s
|
||
|
|
|
||
|
|
// CHECK-LABEL: func @affine_vector_load
|
||
|
|
func.func @affine_vector_load(%arg0 : index) {
|
||
|
|
%0 = memref.alloc() : memref<100xf32>
|
||
|
|
affine.for %i0 = 0 to 16 {
|
||
|
|
%1 = affine.vector_load %0[%i0 + symbol(%arg0) + 7] : memref<100xf32>, vector<8xf32>
|
||
|
|
}
|
||
|
|
// CHECK: %[[buf:.*]] = memref.alloc
|
||
|
|
// CHECK: %[[a:.*]] = arith.addi %{{.*}}, %{{.*}} : index
|
||
|
|
// CHECK-NEXT: %[[c7:.*]] = arith.constant 7 : index
|
||
|
|
// CHECK-NEXT: %[[b:.*]] = arith.addi %[[a]], %[[c7]] : index
|
||
|
|
// CHECK-NEXT: vector.load %[[buf]][%[[b]]] : memref<100xf32>, vector<8xf32>
|
||
|
|
return
|
||
|
|
}
|
||
|
|
|
||
|
|
// -----
|
||
|
|
|
||
|
|
// CHECK-LABEL: func @affine_vector_store
|
||
|
|
func.func @affine_vector_store(%arg0 : index) {
|
||
|
|
%0 = memref.alloc() : memref<100xf32>
|
||
|
|
%1 = arith.constant dense<11.0> : vector<4xf32>
|
||
|
|
affine.for %i0 = 0 to 16 {
|
||
|
|
affine.vector_store %1, %0[%i0 - symbol(%arg0) + 7] : memref<100xf32>, vector<4xf32>
|
||
|
|
}
|
||
|
|
// CHECK: %[[buf:.*]] = memref.alloc
|
||
|
|
// CHECK: %[[val:.*]] = arith.constant dense
|
||
|
|
// CHECK: %[[c_1:.*]] = arith.constant -1 : index
|
||
|
|
// CHECK-NEXT: %[[a:.*]] = arith.muli %arg0, %[[c_1]] : index
|
||
|
|
// CHECK-NEXT: %[[b:.*]] = arith.addi %{{.*}}, %[[a]] : index
|
||
|
|
// CHECK-NEXT: %[[c7:.*]] = arith.constant 7 : index
|
||
|
|
// CHECK-NEXT: %[[c:.*]] = arith.addi %[[b]], %[[c7]] : index
|
||
|
|
// CHECK-NEXT: vector.store %[[val]], %[[buf]][%[[c]]] : memref<100xf32>, vector<4xf32>
|
||
|
|
return
|
||
|
|
}
|
||
|
|
|
||
|
|
// -----
|
||
|
|
|
||
|
|
// CHECK-LABEL: func @vector_load_2d
|
||
|
|
func.func @vector_load_2d() {
|
||
|
|
%0 = memref.alloc() : memref<100x100xf32>
|
||
|
|
affine.for %i0 = 0 to 16 step 2{
|
||
|
|
affine.for %i1 = 0 to 16 step 8 {
|
||
|
|
%1 = affine.vector_load %0[%i0, %i1] : memref<100x100xf32>, vector<2x8xf32>
|
||
|
|
// CHECK: %[[buf:.*]] = memref.alloc
|
||
|
|
// CHECK: scf.for %[[i0:.*]] =
|
||
|
|
// CHECK: scf.for %[[i1:.*]] =
|
||
|
|
// CHECK-NEXT: vector.load %[[buf]][%[[i0]], %[[i1]]] : memref<100x100xf32>, vector<2x8xf32>
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return
|
||
|
|
}
|
||
|
|
|
||
|
|
// -----
|
||
|
|
|
||
|
|
// CHECK-LABEL: func @vector_store_2d
|
||
|
|
func.func @vector_store_2d() {
|
||
|
|
%0 = memref.alloc() : memref<100x100xf32>
|
||
|
|
%1 = arith.constant dense<11.0> : vector<2x8xf32>
|
||
|
|
affine.for %i0 = 0 to 16 step 2{
|
||
|
|
affine.for %i1 = 0 to 16 step 8 {
|
||
|
|
affine.vector_store %1, %0[%i0, %i1] : memref<100x100xf32>, vector<2x8xf32>
|
||
|
|
// CHECK: %[[buf:.*]] = memref.alloc
|
||
|
|
// CHECK: %[[val:.*]] = arith.constant dense
|
||
|
|
// CHECK: scf.for %[[i0:.*]] =
|
||
|
|
// CHECK: scf.for %[[i1:.*]] =
|
||
|
|
// CHECK-NEXT: vector.store %[[val]], %[[buf]][%[[i0]], %[[i1]]] : memref<100x100xf32>, vector<2x8xf32>
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return
|
||
|
|
}
|