| /llvm-project-15.0.7/polly/lib/External/isl/ |
| H A D | isl_sample.c | 289 tab->basis->row[1 + level][0], 2); in greedy_search() 291 tab->basis->row[1 + level][0]); in greedy_search() 397 if (!tab->basis) in isl_tab_sample() 398 tab->basis = initial_basis(tab); in isl_tab_sample() 399 if (!tab->basis) in isl_tab_sample() 475 if (!tab || !tab->basis) in isl_tab_sample() 514 isl_mat_copy(tab->basis), sample); in isl_tab_sample() 1096 tab->basis = initial_basis(tab); in isl_tab_set_initial_basis_with_cone() 1097 return tab->basis ? 0 : -1; in isl_tab_set_initial_basis_with_cone() 1113 tab->basis = isl_mat_lin_to_aff(Q); in isl_tab_set_initial_basis_with_cone() [all …]
|
| H A D | basis_reduction_templ.c | 85 B = tab->basis; in isl_tab_compute_reduced_basis() 303 tab->basis = B; in isl_tab_compute_reduced_basis() 319 struct isl_mat *basis; in isl_basic_set_reduced_basis() local 331 tab->basis = isl_mat_identity(bset->ctx, 1 + tab->n_var); in isl_basic_set_reduced_basis() 339 eq = isl_mat_left_hermite(eq, 0, NULL, &tab->basis); in isl_basic_set_reduced_basis() 340 tab->basis = isl_mat_lin_to_aff(tab->basis); in isl_basic_set_reduced_basis() 348 basis = isl_mat_copy(tab->basis); in isl_basic_set_reduced_basis() 352 return basis; in isl_basic_set_reduced_basis()
|
| H A D | isl_scan.c | 137 tab->basis = isl_mat_identity(bset->ctx, 1 + dim); in isl_basic_set_scan() 142 B = isl_mat_copy(tab->basis); in isl_basic_set_scan()
|
| H A D | isl_affine_hull.c | 598 isl_seq_cpy(bset->eq[k] + 1, tab->basis->row[1 + i] + 1, in initial_hull() 637 isl_mat_free(tab->basis); in isl_tab_detect_equalities() 638 tab->basis = NULL; in isl_tab_detect_equalities()
|
| H A D | isl_tab.h | 168 struct isl_mat *basis; member
|
| /llvm-project-15.0.7/mlir/lib/Dialect/Utils/ |
| H A D | IndexingUtils.cpp | 13 int64_t mlir::linearize(ArrayRef<int64_t> offsets, ArrayRef<int64_t> basis) { in linearize() argument 14 assert(offsets.size() == basis.size()); in linearize() 16 for (unsigned idx = 0, e = basis.size(); idx < e; ++idx) in linearize() 17 linearIndex += offsets[idx] * basis[idx]; in linearize()
|
| /llvm-project-15.0.7/mlir/lib/Analysis/Presburger/ |
| H A D | Simplex.cpp | 1108 SmallVector<int, 8> basis; in getSnapshotBasis() local 1111 basis.push_back(index); in getSnapshotBasis() 1232 for (int index : basis) { in undo() 1240 if (std::find(basis.begin(), basis.end(), colUnknown[col]) != in undo() 1241 basis.end()) in undo() 1823 basis.addToRow(i, i + 1, u); in reduceBasis() 1835 basis.addToRow(i, i + 1, 1); in reduceBasis() 1853 basis.getRow(i + 1), -1, basis.getRow(i))) >= widthI[j] && in reduceBasis() 1857 basis.getRow(i + 1), +1, basis.getRow(i))) >= widthI[j] && in reduceBasis() 1907 basis.swapRows(i, i + 1); in reduceBasis() [all …]
|
| /llvm-project-15.0.7/mlir/lib/Dialect/Vector/Utils/ |
| H A D | VectorUtils.cpp | 47 int64_t mlir::computeMaxLinearIndex(ArrayRef<int64_t> basis) { in computeMaxLinearIndex() argument 48 if (basis.empty()) in computeMaxLinearIndex() 50 return std::accumulate(basis.begin(), basis.end(), 1, in computeMaxLinearIndex()
|
| /llvm-project-15.0.7/mlir/lib/Conversion/LLVMCommon/ |
| H A D | VectorPattern.cpp | 48 SmallVector<int64_t, 4> LLVM::detail::getCoordinates(ArrayRef<int64_t> basis, in getCoordinates() argument 51 res.reserve(basis.size()); in getCoordinates() 52 for (unsigned basisElement : llvm::reverse(basis)) { in getCoordinates()
|
| /llvm-project-15.0.7/mlir/include/mlir/Dialect/Utils/ |
| H A D | IndexingUtils.h | 25 int64_t linearize(ArrayRef<int64_t> offsets, ArrayRef<int64_t> basis);
|
| /llvm-project-15.0.7/llvm/test/CodeGen/MIR/Generic/ |
| H A D | machine-basic-block-unknown-name.mir | 3 # a basic block with the machine basis block's name.
|
| /llvm-project-15.0.7/llvm/test/Transforms/InstCombine/ |
| H A D | memrchr-7.ll | 59 ; Fold memrchr(a5 + 5, c, n) == null to true on the basis that n must 73 ; Fold memrchr(a5 + 5, '\0', n) == null to true again on the basis that
|
| H A D | memchr-10.ll | 59 ; Fold memchr(a5 + 5, c, n) == null to true on the basis that n must 73 ; Fold memchr(a5 + 5, '\0', n) == null to true on the basis that n must
|
| H A D | memcmp-8.ll | 40 ; TODO: Likewise, fold memcmp(a5 + i, a5 + 5, n) to 0 on same basis.
|
| /llvm-project-15.0.7/mlir/include/mlir/Dialect/Vector/Utils/ |
| H A D | VectorUtils.h | 40 int64_t computeMaxLinearIndex(ArrayRef<int64_t> basis);
|
| /llvm-project-15.0.7/mlir/include/mlir/Conversion/LLVMCommon/ |
| H A D | VectorPattern.h | 44 SmallVector<int64_t, 4> getCoordinates(ArrayRef<int64_t> basis,
|
| /llvm-project-15.0.7/llvm/test/CodeGen/X86/ |
| H A D | sunkaddr-ext.ll | 4 ; use the potential overflow as the basis for an address calculation later by
|
| H A D | statepoint-duplicates-export.ll | 7 ; cases, but it incorrectly handled exports across basis block boundaries
|
| /llvm-project-15.0.7/llvm/test/DebugInfo/RISCV/ |
| H A D | eh-frame.s | 17 # do so on the basis that on RV64F, F registers may only be 4 bytes
|
| /llvm-project-15.0.7/libc/src/__support/CPP/ |
| H A D | README.md | 5 More utilities will be added on an as needed basis. There are certain rules to
|
| /llvm-project-15.0.7/libc/utils/UnitTest/ |
| H A D | README.md | 22 intend to extend it on an _as needed_ basis. Hence, it might never be as
|
| /llvm-project-15.0.7/llvm/test/CodeGen/PowerPC/ |
| H A D | debuginfo-split-int.ll | 14 ; This basis of this ll file was created by running:
|
| /llvm-project-15.0.7/libc/docs/ |
| H A D | clang_tidy_checks.rst | 10 provided headers to prevent code duplication on a per platform basis. This
|
| /llvm-project-15.0.7/llvm/test/Transforms/StraightLineStrengthReduce/ |
| H A D | slsr-mul.ll | 124 ; Do not rewrite a candidate if its potential basis does not dominate it.
|
| /llvm-project-15.0.7/mlir/include/mlir/Analysis/Presburger/ |
| H A D | Simplex.h | 862 void reduceBasis(Matrix &basis, unsigned level);
|