Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
[mlir][sparse] Add complex number reading from files.
Support complex numbers for Matrix Market Exchange Formats. Add a test case. Reviewed By: aartbik Differential Revision: https://reviews.llvm.org/D127138
- Loading branch information
Showing
5 changed files
with
201 additions
and
29 deletions.
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
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
86 changes: 86 additions & 0 deletions
86
mlir/test/Integration/Dialect/SparseTensor/CPU/sparse_sum_c32.mlir
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,86 @@ | ||
| // RUN: mlir-opt %s --sparse-compiler | \ | ||
| // RUN: TENSOR0="%mlir_integration_test_dir/data/test_symmetric_complex.mtx" \ | ||
| // RUN: mlir-cpu-runner \ | ||
| // RUN: -e entry -entry-point-result=void \ | ||
| // RUN: -shared-libs=%mlir_integration_test_dir/libmlir_c_runner_utils%shlibext | \ | ||
| // RUN: FileCheck %s | ||
|
|
||
| !Filename = !llvm.ptr<i8> | ||
|
|
||
| #SparseMatrix = #sparse_tensor.encoding<{ | ||
| dimLevelType = [ "compressed", "compressed" ] | ||
| }> | ||
|
|
||
| #trait_sum_reduce = { | ||
| indexing_maps = [ | ||
| affine_map<(i,j) -> (i,j)>, // A | ||
| affine_map<(i,j) -> ()> // x (out) | ||
| ], | ||
| iterator_types = ["reduction", "reduction"], | ||
| doc = "x += A(i,j)" | ||
| } | ||
|
|
||
| // | ||
| // Integration test that lowers a kernel annotated as sparse to | ||
| // actual sparse code, initializes a matching sparse storage scheme | ||
| // from file, and runs the resulting code with the JIT compiler. | ||
| // | ||
| module { | ||
| // | ||
| // A kernel that sum-reduces a matrix to a single scalar. | ||
| // | ||
| func.func @kernel_sum_reduce(%arga: tensor<?x?xcomplex<f64>, #SparseMatrix>, | ||
| %argx: tensor<complex<f64>> {linalg.inplaceable = true}) -> tensor<complex<f64>> { | ||
| %0 = linalg.generic #trait_sum_reduce | ||
| ins(%arga: tensor<?x?xcomplex<f64>, #SparseMatrix>) | ||
| outs(%argx: tensor<complex<f64>>) { | ||
| ^bb(%a: complex<f64>, %x: complex<f64>): | ||
| %0 = complex.add %x, %a : complex<f64> | ||
| linalg.yield %0 : complex<f64> | ||
| } -> tensor<complex<f64>> | ||
| return %0 : tensor<complex<f64>> | ||
| } | ||
|
|
||
| func.func private @getTensorFilename(index) -> (!Filename) | ||
|
|
||
| // | ||
| // Main driver that reads matrix from file and calls the sparse kernel. | ||
| // | ||
| func.func @entry() { | ||
| //%d0 = arith.constant 0.0 : complex<f64> | ||
| %d0 = complex.constant [0.0 : f64, 0.0 : f64] : complex<f64> | ||
| %c0 = arith.constant 0 : index | ||
|
|
||
| // Setup memory for a single reduction scalar, | ||
| // initialized to zero. | ||
| %xdata = memref.alloc() : memref<complex<f64>> | ||
| memref.store %d0, %xdata[] : memref<complex<f64>> | ||
| %x = bufferization.to_tensor %xdata : memref<complex<f64>> | ||
|
|
||
| // Read the sparse matrix from file, construct sparse storage. | ||
| %fileName = call @getTensorFilename(%c0) : (index) -> (!Filename) | ||
| %a = sparse_tensor.new %fileName : !Filename to tensor<?x?xcomplex<f64>, #SparseMatrix> | ||
|
|
||
| // Call the kernel. | ||
| %0 = call @kernel_sum_reduce(%a, %x) | ||
| : (tensor<?x?xcomplex<f64>, #SparseMatrix>, tensor<complex<f64>>) -> tensor<complex<f64>> | ||
|
|
||
| // Print the result for verification. | ||
| // | ||
| // CHECK: 30.2 | ||
| // CHECK-NEXT: 22.2 | ||
| // | ||
| %m = bufferization.to_memref %0 : memref<complex<f64>> | ||
| %v = memref.load %m[] : memref<complex<f64>> | ||
| %real = complex.re %v : complex<f64> | ||
| %imag = complex.im %v : complex<f64> | ||
| vector.print %real : f64 | ||
| vector.print %imag : f64 | ||
|
|
||
| // Release the resources. | ||
| memref.dealloc %xdata : memref<complex<f64>> | ||
| sparse_tensor.release %a : tensor<?x?xcomplex<f64>, #SparseMatrix> | ||
|
|
||
| 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,13 @@ | ||
| %%MatrixMarket matrix coordinate complex symmetric | ||
| % | ||
| % This is a test sparse matrix in Matrix Market Exchange Format. | ||
| % see https://math.nist.gov/MatrixMarket | ||
| % | ||
| 5 5 7 | ||
| 1 1 5.0 1.0 | ||
| 1 3 4.1 2.1 | ||
| 2 2 3.0 3.0 | ||
| 2 4 2.0 4.0 | ||
| 3 3 1.0 3.0 | ||
| 4 4 4.0 2.0 | ||
| 5 5 5.0 1.0 |
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