llvm-project/mlir/integration_test/Dialect/Vector/CPU/test-flat-transpose-row.mlir
aartbik 91801a7c34 [mlir] [integration-test] [VectorOps] Start an integration test directory for MLIR
Summary:
This CL introduces an integration test directory for MLIR in general, with
vector dialect integration tests in particular as a first working suite. To
run all the integration tests (and currently just the vector suite):

$ cmake --build . --target check-mlir-integration
[0/1] Running the MLIR integration tests
Testing Time: 0.24s
Passed: 22

The general call is to contribute to this integration test directory with more
tests and other suites, running end-to-end examples that may be too heavy for
the regular test directory, but should be tested occasionally to verify the
health of MLIR.

Background discussion at:
https://llvm.discourse.group/t/vectorops-rfc-add-suite-of-integration-tests-for-vector-dialect-operations/1213/

Reviewers: nicolasvasilache, reidtatge, andydavis1, rriddle, ftynse, mehdi_amini, jpienaar, stephenneuendorffer

Reviewed By: nicolasvasilache, stephenneuendorffer

Subscribers: mgorny, mehdi_amini, rriddle, jpienaar, shauheen, antiagainst, nicolasvasilache, arpith-jacob, mgester, lucyrfox, liufengdb, stephenneuendorffer, Joonsoo, grosul1, frgossen, Kayjukh, jurahul, msifontes

Tags: #mlir

Differential Revision: https://reviews.llvm.org/D81626
2020-06-15 11:05:58 -07:00

79 lines
2.7 KiB
MLIR

// RUN: mlir-opt %s -convert-scf-to-std -convert-vector-to-llvm -convert-std-to-llvm | \
// RUN: mlir-cpu-runner -e entry -entry-point-result=void \
// RUN: -lower-matrix-intrinsics -matrix-allow-contract -matrix-default-layout=row-major \
// RUN: -shared-libs=%mlir_integration_test_dir/libmlir_c_runner_utils%shlibext | \
// RUN: FileCheck %s
func @entry() {
%f0 = constant 0.0: f64
%f1 = constant 1.0: f64
%f2 = constant 2.0: f64
%f3 = constant 3.0: f64
%f4 = constant 4.0: f64
%f5 = constant 5.0: f64
%f6 = constant 6.0: f64
%f7 = constant 7.0: f64
// Construct test vectors.
%0 = vector.broadcast %f0 : f64 to vector<4xf64>
%1 = vector.insert %f1, %0[1] : f64 into vector<4xf64>
%2 = vector.insert %f2, %1[2] : f64 into vector<4xf64>
%a = vector.insert %f3, %2[3] : f64 into vector<4xf64>
%3 = vector.broadcast %f4 : f64 to vector<4xf64>
%4 = vector.insert %f5, %3[1] : f64 into vector<4xf64>
%5 = vector.insert %f6, %4[2] : f64 into vector<4xf64>
%b = vector.insert %f7, %5[3] : f64 into vector<4xf64>
%6 = vector.broadcast %f0 : f64 to vector<6xf64>
%7 = vector.insert %f1, %6[1] : f64 into vector<6xf64>
%8 = vector.insert %f2, %7[2] : f64 into vector<6xf64>
%9 = vector.insert %f3, %8[3] : f64 into vector<6xf64>
%10 = vector.insert %f4, %9[4] : f64 into vector<6xf64>
%c = vector.insert %f5, %10[5] : f64 into vector<6xf64>
vector.print %a : vector<4xf64>
vector.print %b : vector<4xf64>
vector.print %c : vector<6xf64>
//
// Test vectors:
//
// CHECK: ( 0, 1, 2, 3 )
// CHECK: ( 4, 5, 6, 7 )
// CHECK: ( 0, 1, 2, 3, 4, 5 )
// Performs matrix transpositions interpreting the vectors as
// flattened row-major 2-D matrices.
//
// ( 0, 1 ) ( 0, 2 )
// ( 2, 3 ) -> ( 1, 3 )
//
// ( 4, 5 ) ( 4, 6 )
// ( 6, 7 ) -> ( 5, 7 )
//
// ( 0, 1, 2 ) ( 0, 3 )
// ( 3, 4, 5 ) -> ( 1, 4 )
// ( 2, 5 )
//
// ( 0, 1 ) ( 0, 2, 4 )
// ( 2, 3 ) -> ( 1, 3, 5 )
// ( 4, 5 )
//
%d = vector.flat_transpose %a { rows = 2: i32, columns = 2: i32 } : vector<4xf64> -> vector<4xf64>
%e = vector.flat_transpose %b { rows = 2: i32, columns = 2: i32 } : vector<4xf64> -> vector<4xf64>
%f = vector.flat_transpose %c { rows = 2: i32, columns = 3: i32 } : vector<6xf64> -> vector<6xf64>
%g = vector.flat_transpose %c { rows = 3: i32, columns = 2: i32 } : vector<6xf64> -> vector<6xf64>
vector.print %d : vector<4xf64>
vector.print %e : vector<4xf64>
vector.print %f : vector<6xf64>
vector.print %g : vector<6xf64>
//
// Transposed results:
//
// CHECK: ( 0, 2, 1, 3 )
// CHECK: ( 4, 6, 5, 7 )
// CHECK: ( 0, 3, 1, 4, 2, 5 )
// CHECK: ( 0, 2, 4, 1, 3, 5 )
return
}