| /llvm-project-15.0.7/llvm/include/llvm/ADT/ |
| H A D | SparseSet.h | 133 SparseT *Sparse = nullptr; 148 ~SparseSet() { free(Sparse); } 163 free(Sparse); 167 Sparse = static_cast<SparseT*>(safe_calloc(U, sizeof(SparseT))); 208 for (unsigned i = Sparse[Idx], e = size(); i < e; i += Stride) { 258 Sparse[Idx] = size(); 295 Sparse[BackIdx] = I - begin();
|
| H A D | SparseMultiSet.h | 124 SparseT *Sparse = nullptr; variable 196 ~SparseMultiSet() { free(Sparse); } in ~SparseMultiSet() 210 free(Sparse); in setUniverse() 214 Sparse = static_cast<SparseT*>(safe_calloc(U, sizeof(SparseT))); in setUniverse() 358 for (unsigned i = Sparse[Idx], e = Dense.size(); i < e; i += Stride) { in findIndex() 428 Sparse[Idx] = NodeIdx; in insert() 499 Sparse[sparseIndex(N)] = N.Next; in unlink()
|
| /llvm-project-15.0.7/mlir/include/mlir/Dialect/SparseTensor/IR/ |
| H A D | SparseTensorBase.td | 1 //===- SparseTensorBase.td - Sparse tensor dialect base ----*- tablegen -*-===// 31 to tensor algebra by [Kjolstad17,Kjolstad20] in the Sparse Tensor 51 to combinations of for-loops, while-loops, and if-statements. Sparse 57 * [Bik96] Aart J.C. Bik. Compiler Support for Sparse Matrix Computations. 60 Format Abstraction for Sparse Tensor Algebra Compilers. Proceedings of 63 sparse systems of linear equations. In Sparse Matrices and Their 72 * [Kjolstad20] Fredrik Berg Kjolstad. Sparse Tensor Algebra Compilation.
|
| H A D | SparseTensorAttrDefs.td | 21 // Sparse tensor encoding attribute.
|
| H A D | SparseTensorOps.td | 1 //===- SparseTensorOps.td - Sparse tensor dialect ops ------*- tablegen -*-===// 25 // Sparse Tensor Operations. 167 // Sparse Tensor Management Operations. These operations are "impure" in the 330 // Sparse Tensor Custom Linalg.Generic Operations.
|
| /llvm-project-15.0.7/llvm/include/llvm/ProfileData/ |
| H A D | InstrProfWriter.h | 41 bool Sparse; 59 InstrProfWriter(bool Sparse = false); 143 void setOutputSparse(bool Sparse);
|
| /llvm-project-15.0.7/llvm/test/ThinLTO/X86/ |
| H A D | newpm-basic.ll | 14 ; CHECK-NOT: Interprocedural Sparse Conditional Constant Propagation 16 ; CHECK-NOT: Interprocedural Sparse Conditional Constant Propagation
|
| /llvm-project-15.0.7/llvm/lib/ProfileData/ |
| H A D | InstrProfWriter.cpp | 173 InstrProfWriter::InstrProfWriter(bool Sparse) in InstrProfWriter() argument 174 : Sparse(Sparse), InfoObj(new InstrProfRecordWriterTrait()) {} in InstrProfWriter() 184 void InstrProfWriter::setOutputSparse(bool Sparse) { in setOutputSparse() argument 185 this->Sparse = Sparse; in setOutputSparse() 304 if (!Sparse) in shouldEncodeData()
|
| /llvm-project-15.0.7/mlir/test/Integration/Dialect/SparseTensor/CPU/ |
| H A D | sparse_dot.mlir | 11 // Sparse kernel.
|
| H A D | sparse_out_mult_elt.mlir | 22 // Sparse kernel.
|
| H A D | sparse_conversion_ptr.mlir | 79 // Sparse to sparse.
|
| /llvm-project-15.0.7/mlir/include/mlir/Dialect/SparseTensor/Transforms/ |
| H A D | Passes.td | 1 //===-- Passes.td - Sparse tensor pass definition file -----*- tablegen -*-===//
|
| /llvm-project-15.0.7/llvm/test/Feature/ |
| H A D | optnone-opt.ll | 53 ; O1-DAG: Skipping pass 'Sparse Conditional Constant Propagation'
|
| /llvm-project-15.0.7/mlir/test/Integration/Dialect/Vector/CPU/ |
| H A D | test-sparse-saxpy-jagged-matvec.mlir | 6 // Illustrates an 8x8 Sparse Matrix x Vector implemented with only operations
|
| H A D | test-sparse-dot-matvec.mlir | 6 // Illustrates an 8x8 Sparse Matrix x Vector implemented with only operations
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/ |
| H A D | MachineVerifier.cpp | 2510 unsigned SparseUniverse = Sparse.size(); in filterAndAdd() 2519 if (Index < SparseUniverse && Sparse.test(Index)) in filterAndAdd() 2536 Sparse.resize(NewSparseUniverse); in filterAndAdd() 2542 Sparse.set(Index); in filterAndAdd() 2560 BitVector Sparse; member
|
| /llvm-project-15.0.7/mlir/include/mlir/Transforms/ |
| H A D | Passes.td | 155 let summary = "Sparse Conditional Constant Propagation";
|
| /llvm-project-15.0.7/llvm/docs/ |
| H A D | OptBisect.rst | 121 …BISECT: running pass (5) Interprocedural Sparse Conditional Constant Propagation on module (test.l…
|
| H A D | Lexicon.rst | 295 Sparse Conditional Constant Propagation
|
| H A D | Passes.rst | 664 ``-ipsccp``: Interprocedural Sparse Conditional Constant Propagation 667 An interprocedural variant of :ref:`Sparse Conditional Constant Propagation 1017 ``-sccp``: Sparse Conditional Constant Propagation 1020 Sparse conditional constant propagation and merging, which can be summarized
|
| /llvm-project-15.0.7/mlir/include/mlir/Dialect/Bufferization/IR/ |
| H A D | BufferizationOps.td | 57 another op. Sparse tensor allocations should always be used in a local
|
| /llvm-project-15.0.7/cross-project-tests/debuginfo-tests/dexter/ |
| H A D | README.md | 273 …pass 8/211 = (0.7611) (0.0000) [Interprocedural Sparse Conditional Constant Propagation on modul…
|
| /llvm-project-15.0.7/mlir/test/Integration/Dialect/Vector/CPU/X86Vector/ |
| H A D | test-sparse-dot-product.mlir | 34 // Sparse vector dot product of two vectors.
|
| /llvm-project-15.0.7/llvm/ |
| H A D | CREDITS.TXT | 37 D: Sparse bitmap
|
| /llvm-project-15.0.7/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPU.td | 765 // Sparse texture support requires that all result registers are zeroed when
|