-
Notifications
You must be signed in to change notification settings - Fork 183
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
[examples] Add conv2d-nhwc-fhwc manual vectorization.
- Loading branch information
Showing
4 changed files
with
291 additions
and
1 deletion.
There are no files selected for viewing
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 |
|---|---|---|
| @@ -1,3 +1,4 @@ | ||
| log.mlir | ||
| log.ll | ||
| log.s | ||
| a.out |
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,137 @@ | ||
| // RUN: buddy-opt %s \ | ||
| // RUN: -convert-vector-to-scf \ | ||
| // RUN: -lower-affine \ | ||
| // RUN: -arith-bufferize \ | ||
| // RUN: -convert-scf-to-cf \ | ||
| // RUN: -convert-vector-to-llvm \ | ||
| // RUN: -convert-arith-to-llvm \ | ||
| // RUN: -finalize-memref-to-llvm \ | ||
| // RUN: -convert-func-to-llvm \ | ||
| // RUN: -reconcile-unrealized-casts \ | ||
| // RUN: | mlir-cpu-runner -O3 -e main -entry-point-result=void \ | ||
| // RUN: -shared-libs=%mlir_runner_utils_dir/libmlir_runner_utils%shlibext \ | ||
| // RUN: -shared-libs=%mlir_runner_utils_dir/libmlir_c_runner_utils%shlibext \ | ||
| // RUN: | FileCheck %s | ||
|
|
||
| // Using `8` as the vector size. | ||
| #map = affine_map<(d0) -> (d0 floordiv 8)> | ||
| #map0 = affine_map<(d0, d1, d2, d3) -> (d2)> | ||
| #map1 = affine_map<(d0, d1) -> (d0 + d1)> | ||
| #map2 = affine_map<(d0, d1) -> (d0 + d1 * 8)> | ||
| #map3 = affine_map<(d0) -> (d0 * 8)> | ||
|
|
||
| module { | ||
| func.func private @printMemrefF32(memref<*xf32>) | ||
| func.func private @rtclock() -> f64 | ||
|
|
||
| func.func @conv_2d_nhwc_fhwc(%arg0: memref<?x?x?x?xf32>, %arg1: memref<?x?x?x?xf32>, %arg2: memref<?x?x?x?xf32>) { | ||
| %f0 = arith.constant 0. : f32 | ||
| %c0 = arith.constant 0 : index | ||
| %c1 = arith.constant 1 : index | ||
| %c2 = arith.constant 2 : index | ||
| %c3 = arith.constant 3 : index | ||
| %n = memref.dim %arg0, %c0 : memref<?x?x?x?xf32> | ||
| %h_i = memref.dim %arg0, %c1 : memref<?x?x?x?xf32> | ||
| %w_i = memref.dim %arg0, %c2 : memref<?x?x?x?xf32> | ||
| %c = memref.dim %arg0, %c3 : memref<?x?x?x?xf32> | ||
| %f = memref.dim %arg1, %c0 : memref<?x?x?x?xf32> | ||
| %h_k = memref.dim %arg1, %c1 : memref<?x?x?x?xf32> | ||
| %w_k = memref.dim %arg1, %c2 : memref<?x?x?x?xf32> | ||
| %h_o = memref.dim %arg2, %c1 : memref<?x?x?x?xf32> | ||
| %w_o = memref.dim %arg2, %c2 : memref<?x?x?x?xf32> | ||
|
|
||
| // Output is NHoWoF | ||
| affine.for %idx_n = %c0 to %n { | ||
| affine.for %idx_f = %c0 to %f { | ||
| affine.for %idx_c = %c0 to %c { | ||
| affine.for %idx_h_o = %c0 to %h_o { | ||
| affine.for %idx_h_k = %c0 to %h_k { | ||
| affine.for %idx_w_k = %c0 to %w_k { | ||
| affine.for %idx_w_o = %c0 to #map(%w_o) { | ||
| %kernel_ele = memref.load %arg1[%idx_f, %idx_h_k, %idx_w_k, %idx_c] : memref<?x?x?x?xf32> | ||
| %kernel_vec = vector.broadcast %kernel_ele : f32 to vector<8xf32> | ||
| %in_iter_h = affine.apply #map1 (%idx_h_k, %idx_h_o) | ||
| %in_iter_w = affine.apply #map2 (%idx_w_k, %idx_w_o) | ||
| %out_iter_w = affine.apply #map3 (%idx_w_o) | ||
| %input_vec = vector.transfer_read %arg0[%idx_n, %in_iter_h, %in_iter_w, %idx_c], %f0 | ||
| { permutation_map = #map0 } : memref<?x?x?x?xf32>, vector<8xf32> | ||
| %output_vec = vector.transfer_read %arg2[%idx_n, %idx_h_o, %out_iter_w, %idx_f], %f0 | ||
| { permutation_map = #map0 } : memref<?x?x?x?xf32>, vector<8xf32> | ||
| %res_vec = vector.fma %kernel_vec, %input_vec, %output_vec : vector<8xf32> | ||
| vector.transfer_write %res_vec, %arg2[%idx_n, %idx_h_o, %out_iter_w, %idx_f] | ||
| { permutation_map = #map0 } : vector<8xf32>, memref<?x?x?x?xf32> | ||
| } | ||
| } | ||
| } | ||
| } | ||
| } | ||
| } | ||
| } | ||
|
|
||
| return | ||
| } | ||
|
|
||
| func.func @alloc_f32(%arg0: index, %arg1: index, %arg2: index, %arg3: index, %arg4: f32) -> memref<?x?x?x?xf32> { | ||
| %c0 = arith.constant 0 : index | ||
| %c1 = arith.constant 1 : index | ||
| %0 = memref.alloc(%arg0, %arg1, %arg2, %arg3) : memref<?x?x?x?xf32> | ||
| scf.for %idx0 = %c0 to %arg0 step %c1 { | ||
| scf.for %idx1 = %c0 to %arg1 step %c1 { | ||
| scf.for %idx2 = %c0 to %arg2 step %c1 { | ||
| scf.for %idx3 = %c0 to %arg3 step %c1 { | ||
| memref.store %arg4, %0[%idx0, %idx1, %idx2, %idx3] : memref<?x?x?x?xf32> | ||
| } | ||
| } | ||
| } | ||
| } | ||
| return %0 : memref<?x?x?x?xf32> | ||
| } | ||
|
|
||
| func.func @main() { | ||
| %f0 = arith.constant 0.000000e+00 : f32 | ||
| %f2 = arith.constant 2.000000e+00 : f32 | ||
| %f3 = arith.constant 3.000000e+00 : f32 | ||
|
|
||
| %c1 = arith.constant 1 : index | ||
| %c2 = arith.constant 2 : index | ||
| %c3 = arith.constant 3 : index | ||
| %c5 = arith.constant 5 : index | ||
| %c6 = arith.constant 6 : index | ||
| %c8 = arith.constant 8 : index | ||
| %c12 = arith.constant 12 : index | ||
| %c16 = arith.constant 16 : index | ||
| %c24 = arith.constant 24 : index | ||
| %c28 = arith.constant 28 : index | ||
|
|
||
| // %v0 = call @alloc_f32(%c1, %c12, %c12, %c6, %f2) : (index, index, index, index, f32) -> memref<?x?x?x?xf32> | ||
| // %v1 = call @alloc_f32(%c16, %c5, %c5, %c6, %f3) : (index, index, index, index, f32) -> memref<?x?x?x?xf32> | ||
| // %v2 = call @alloc_f32(%c1, %c8, %c8, %c16, %f0) : (index, index, index, index, f32) -> memref<?x?x?x?xf32> | ||
|
|
||
| %v0 = call @alloc_f32(%c1, %c28, %c28, %c1, %f2) : (index, index, index, index, f32) -> memref<?x?x?x?xf32> | ||
| %v1 = call @alloc_f32(%c6, %c5, %c5, %c1, %f3) : (index, index, index, index, f32) -> memref<?x?x?x?xf32> | ||
| %v2 = call @alloc_f32(%c1, %c24, %c24, %c6, %f0) : (index, index, index, index, f32) -> memref<?x?x?x?xf32> | ||
|
|
||
| %t_start = call @rtclock() : () -> f64 | ||
| call @conv_2d_nhwc_fhwc(%v0, %v1, %v2) : (memref<?x?x?x?xf32>, memref<?x?x?x?xf32>, memref<?x?x?x?xf32>) -> () | ||
| %t_end = call @rtclock() : () -> f64 | ||
|
|
||
| // All the elements of the MemRef are the same, | ||
| // only check the first line to verify the correctness. | ||
| // CHECK: Unranked Memref | ||
| // CHECK: [ | ||
| // CHECK: [ | ||
| // CHECK: [ | ||
| // CHECK: [150{{(, 150)*}}], | ||
| %print_v2 = memref.cast %v2 : memref<?x?x?x?xf32> to memref<*xf32> | ||
| call @printMemrefF32(%print_v2) : (memref<*xf32>) -> () | ||
|
|
||
| %time = arith.subf %t_end, %t_start : f64 | ||
| vector.print %time : f64 | ||
|
|
||
| memref.dealloc %v0 : memref<?x?x?x?xf32> | ||
| memref.dealloc %v1 : memref<?x?x?x?xf32> | ||
| memref.dealloc %v2 : memref<?x?x?x?xf32> | ||
|
|
||
| return | ||
| } | ||
| } |
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,88 @@ | ||
| // RUN: buddy-opt %s \ | ||
| // RUN: -convert-linalg-to-loops \ | ||
| // RUN: -lower-affine \ | ||
| // RUN: -arith-bufferize \ | ||
| // RUN: -convert-scf-to-cf \ | ||
| // RUN: -convert-vector-to-llvm \ | ||
| // RUN: -convert-arith-to-llvm \ | ||
| // RUN: -finalize-memref-to-llvm \ | ||
| // RUN: -convert-func-to-llvm \ | ||
| // RUN: -reconcile-unrealized-casts \ | ||
| // RUN: | mlir-cpu-runner -e main -entry-point-result=void \ | ||
| // RUN: -shared-libs=%mlir_runner_utils_dir/libmlir_runner_utils%shlibext \ | ||
| // RUN: -shared-libs=%mlir_runner_utils_dir/libmlir_c_runner_utils%shlibext \ | ||
| // RUN: | FileCheck %s | ||
|
|
||
| module { | ||
| func.func private @printMemrefF32(memref<*xf32>) | ||
| func.func private @rtclock() -> f64 | ||
|
|
||
| func.func @conv_2d_nhwc_fhwc(%arg0: memref<?x?x?x?xf32>, %arg1: memref<?x?x?x?xf32>, %arg2: memref<?x?x?x?xf32>) { | ||
| linalg.conv_2d_nhwc_fhwc ins (%arg0, %arg1: memref<?x?x?x?xf32>, memref<?x?x?x?xf32>) | ||
| outs (%arg2: memref<?x?x?x?xf32>) | ||
| return | ||
| } | ||
|
|
||
| func.func @alloc_f32(%arg0: index, %arg1: index, %arg2: index, %arg3: index, %arg4: f32) -> memref<?x?x?x?xf32> { | ||
| %c0 = arith.constant 0 : index | ||
| %c1 = arith.constant 1 : index | ||
| %0 = memref.alloc(%arg0, %arg1, %arg2, %arg3) : memref<?x?x?x?xf32> | ||
| scf.for %idx0 = %c0 to %arg0 step %c1 { | ||
| scf.for %idx1 = %c0 to %arg1 step %c1 { | ||
| scf.for %idx2 = %c0 to %arg2 step %c1 { | ||
| scf.for %idx3 = %c0 to %arg3 step %c1 { | ||
| memref.store %arg4, %0[%idx0, %idx1, %idx2, %idx3] : memref<?x?x?x?xf32> | ||
| } | ||
| } | ||
| } | ||
| } | ||
| return %0 : memref<?x?x?x?xf32> | ||
| } | ||
|
|
||
| func.func @main() { | ||
| %f0 = arith.constant 0.000000e+00 : f32 | ||
| %f2 = arith.constant 2.000000e+00 : f32 | ||
| %f3 = arith.constant 3.000000e+00 : f32 | ||
|
|
||
| %c1 = arith.constant 1 : index | ||
| %c2 = arith.constant 2 : index | ||
| %c3 = arith.constant 3 : index | ||
| %c5 = arith.constant 5 : index | ||
| %c6 = arith.constant 6 : index | ||
| %c8 = arith.constant 8 : index | ||
| %c12 = arith.constant 12 : index | ||
| %c16 = arith.constant 16 : index | ||
| %c24 = arith.constant 24 : index | ||
| %c28 = arith.constant 28 : index | ||
|
|
||
| // %v0 = call @alloc_f32(%c1, %c12, %c12, %c6, %f2) : (index, index, index, index, f32) -> memref<?x?x?x?xf32> | ||
| // %v1 = call @alloc_f32(%c16, %c5, %c5, %c6, %f3) : (index, index, index, index, f32) -> memref<?x?x?x?xf32> | ||
| // %v2 = call @alloc_f32(%c1, %c8, %c8, %c16, %f0) : (index, index, index, index, f32) -> memref<?x?x?x?xf32> | ||
|
|
||
| %v0 = call @alloc_f32(%c1, %c28, %c28, %c1, %f2) : (index, index, index, index, f32) -> memref<?x?x?x?xf32> | ||
| %v1 = call @alloc_f32(%c6, %c5, %c5, %c1, %f3) : (index, index, index, index, f32) -> memref<?x?x?x?xf32> | ||
| %v2 = call @alloc_f32(%c1, %c24, %c24, %c6, %f0) : (index, index, index, index, f32) -> memref<?x?x?x?xf32> | ||
|
|
||
| %t_start = call @rtclock() : () -> f64 | ||
| call @conv_2d_nhwc_fhwc(%v0, %v1, %v2) : (memref<?x?x?x?xf32>, memref<?x?x?x?xf32>, memref<?x?x?x?xf32>) -> () | ||
| %t_end = call @rtclock() : () -> f64 | ||
|
|
||
| // All the elements of the MemRef are the same, | ||
| // only check the first line to verify the correctness. | ||
| // CHECK: Unranked Memref | ||
| // CHECK: [ | ||
| // CHECK: [ | ||
| // CHECK: [ | ||
| // CHECK: [150{{(, 150)*}}], | ||
| %print_v2 = memref.cast %v2 : memref<?x?x?x?xf32> to memref<*xf32> | ||
| call @printMemrefF32(%print_v2) : (memref<*xf32>) -> () | ||
|
|
||
| %time = arith.subf %t_end, %t_start : f64 | ||
| vector.print %time : f64 | ||
|
|
||
| memref.dealloc %v0 : memref<?x?x?x?xf32> | ||
| memref.dealloc %v1 : memref<?x?x?x?xf32> | ||
| memref.dealloc %v2 : memref<?x?x?x?xf32> | ||
| return | ||
| } | ||
| } |
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