| /llvm-project-15.0.7/mlir/lib/Analysis/Presburger/ |
| H A D | IntegerRelation.cpp | 42 assert(space.getNumVars() == oSpace.getNumVars() && "invalid space!"); in setSpace() 48 assert(oSpace.getNumVars() <= getNumVars() && "invalid space!"); in setSpaceExceptLocals() 49 unsigned newNumLocals = getNumVars() - oSpace.getNumVars(); in setSpaceExceptLocals() 100 assert(maybeLexMin->size() == getNumVars() && in findRationalLexMin() 120 assert(maybeLexMin->size() == getNumVars() && in findIntegerLexMin() 311 assert(varLimit <= getNumVars()); in removeVarRange() 563 assert(start < cst.getNumVars() && end < cst.getNumVars() + 1); in getBestVarToEliminate() 607 while (currentPos < tmpCst.getNumVars()) { in isEmpty() 973 assert(posLimit <= getNumVars()); in gaussianEliminateVars() 1525 projectOut(1, getNumVars() - 1); in computeConstantLowerOrUpperBound() [all …]
|
| H A D | Utils.cpp | 95 assert(pos <= cst.getNumVars() && "Invalid variable position"); in getDivRepr() 108 for (i = 0, e = cst.getNumVars(); i < e; ++i) in getDivRepr() 130 for (i = 0, e = cst.getNumVars(); i < e; ++i) in getDivRepr() 158 assert(pos <= cst.getNumVars() && "Invalid variable position"); in getDivRepr() 173 for (unsigned i = 0, e = cst.getNumVars(); i < e; ++i) in getDivRepr() 190 for (unsigned c = 0, e = cst.getNumVars(); c < e; ++c) { in checkExplicitRepresentation() 219 assert(pos < cst.getNumVars() && "invalid position"); in computeSingleVarRepr() 220 assert(foundRepr.size() == cst.getNumVars() && in computeSingleVarRepr()
|
| H A D | PresburgerSpace.cpp | 60 assert(pos < getNumVars() && "`pos` should represent a valid var position"); in getVarKindAt()
|
| H A D | PWMAFunction.cpp | 317 /*numReservedCols=*/space.getNumVars() + 1, space); in tiebreakLex()
|
| H A D | Simplex.cpp | 437 Matrix output(0, domainPoly.getNumVars() + 1); in recordOutput() 1303 assert(rel.getNumVars() == getNumVariables() && in intersectIntegerRelation()
|
| /llvm-project-15.0.7/mlir/include/mlir/Analysis/Presburger/ |
| H A D | IntegerRelation.h | 67 : space(space), equalities(0, space.getNumVars() + 1, in IntegerRelation() 69 inequalities(0, space.getNumVars() + 1, numReservedInequalities, in IntegerRelation() 71 assert(numReservedCols >= space.getNumVars() + 1); in IntegerRelation() 78 /*numReservedCols=*/space.getNumVars() + 1, space) {} in IntegerRelation() 158 unsigned getNumVars() const { return space.getNumVars(); } in getNumVars() function 161 inline unsigned getNumCols() const { return space.getNumVars() + 1; } in getNumCols() 753 /*numReservedCols=*/space.getNumVars() + 1, space) {} in IntegerPolyhedron()
|
| H A D | Simplex.h | 434 : LexSimplexBase(constraints.getNumVars()) { in LexSimplexBase() 439 : LexSimplexBase(constraints.getNumVars(), isSymbol) { in LexSimplexBase() 591 assert(domainPoly.getNumVars() > 0 && in SymbolicLexSimplex() 601 getSubrangeBitVector(constraints.getNumVars(), in SymbolicLexSimplex() 603 symbolDomain.getNumVars())) {} in SymbolicLexSimplex() 611 assert(constraints.getNumSymbolVars() == symbolDomain.getNumVars() && in SymbolicLexSimplex() 700 : Simplex(constraints.getNumVars()) { in Simplex()
|
| H A D | Utils.h | 123 unsigned getNumVars() const { return dividends.getNumColumns() - 1; } in getNumVars() function 125 unsigned getNumNonDivs() const { return getNumVars() - getNumDivs(); } in getNumNonDivs() 127 unsigned getDivOffset() const { return getNumVars() - getNumDivs(); } in getDivOffset()
|
| H A D | PresburgerRelation.h | 51 unsigned getNumVars() const { return space.getNumVars(); } in getNumVars() function
|
| H A D | PWMAFunction.h | 55 return output.getNumColumns() == domainSet.getNumVars() + 1; in isConsistent() 153 unsigned getNumInputs() const { return space.getNumVars(); } in getNumInputs()
|
| H A D | PresburgerSpace.h | 103 unsigned getNumVars() const { in getNumVars() function
|
| /llvm-project-15.0.7/mlir/lib/Dialect/Affine/Analysis/ |
| H A D | AffineStructures.cpp | 334 a.getNumVars() == b.getNumVars() && in areVarsAligned() 749 assert(pos < cst.getNumVars() && "invalid position"); in detectAsMod() 859 assert(pos < cst.getNumVars() && "invalid position"); in detectAsFloorDiv() 862 SmallVector<bool, 8> foundRepr(cst.getNumVars(), false); in detectAsFloorDiv() 863 for (unsigned i = 0, e = cst.getNumVars(); i < e; ++i) in detectAsFloorDiv() 877 for (unsigned c = 0, f = cst.getNumVars(); c < f; c++) in detectAsFloorDiv() 989 SmallVector<AffineExpr, 8> memo(getNumVars()); in getSliceBounds() 1005 for (unsigned pos = 0; pos < getNumVars(); pos++) { in getSliceBounds() 1044 for (j = 0, e = getNumVars(); j < e; ++j) { in getSliceBounds() 1061 expr = expr + atEq(idx, getNumVars()); in getSliceBounds() [all …]
|
| H A D | AffineAnalysis.cpp | 417 unsigned numIdsToEliminate = dependenceDomain->getNumVars(); in computeDirectionVector()
|
| H A D | Utils.cpp | 268 sliceConstraints.getNumVars() - ivs.size()); in isSliceValid()
|
| /llvm-project-15.0.7/mlir/unittests/Analysis/Presburger/ |
| H A D | Utils.h | 83 domain, makeMatrix(numOutputs, domain.getNumVars() + 1, pair.second));
|
| H A D | IntegerPolyhedronTest.cpp | 622 for (unsigned j = 0, f = divs.getNumVars() + 1; j < f; ++j) { in checkDivisionRepresentation()
|
| /llvm-project-15.0.7/mlir/include/mlir/Dialect/Affine/Analysis/ |
| H A D | AffineStructures.h | 50 assert(numReservedCols >= getNumVars() + 1); in IntegerPolyhedron() 450 assert(end <= getNumVars() && "invalid end position"); in setValues()
|
| /llvm-project-15.0.7/mlir/lib/Dialect/SCF/Utils/ |
| H A D | AffineCanonicalizationUtils.cpp | 188 for (int64_t i = 0, e = constraints.getNumVars(); i < e; ++i) { in canonicalizeMinMaxOp()
|
| /llvm-project-15.0.7/mlir/lib/Dialect/Affine/Transforms/ |
| H A D | LoopFusion.cpp | 925 cst->getValues(rank, cst->getNumVars(), &outerIVs); in createPrivateMemRef()
|
| /llvm-project-15.0.7/mlir/lib/Dialect/Affine/Utils/ |
| H A D | Utils.cpp | 1781 fac.projectOut(newRank, fac.getNumVars() - newRank - fac.getNumLocalVars()); in normalizeMemRefType()
|
| H A D | LoopUtils.cpp | 2112 cst->getValues(rank, cst->getNumVars(), ®ionSymbols); in generateCopy()
|