Home
last modified time | relevance | path

Searched refs:getNumCols (Results 1 – 10 of 10) sorted by relevance

/llvm-project-15.0.7/mlir/lib/Analysis/Presburger/
H A DIntegerRelation.cpp275 assert(eq.size() == getNumCols()); in addEquality()
494 unsigned numCols = getNumCols(); in hasInvalidConstraint()
657 unsigned numCols = getNumCols(); in isEmptyByGCDTest()
959 unsigned numCols = getNumCols(); in gcdTightenInequalities()
1285 assert(pos < getNumCols()); in addBound()
1474 if (j < getNumCols() - 1) in getConstantBoundOnDimSize()
1559 if (c < getNumCols() - 1) in computeConstantLowerOrUpperBound()
1598 assert(pos < getNumCols() - 1); in isHyperRectangular()
1855 ineq.reserve(getNumCols() - 1); in fourierMotzkinEliminate()
1897 assert((getNumCols() < 2 || pos <= getNumCols() - 2) && "invalid position"); in projectOut()
[all …]
H A DUtils.cpp100 assert(expr.size() == cst.getNumCols() && "Invalid expression size"); in getDivRepr()
118 int64_t constantSum = cst.atIneq(lbIneq, cst.getNumCols() - 1) + in getDivRepr()
119 cst.atIneq(ubIneq, cst.getNumCols() - 1); in getDivRepr()
137 expr.back() = cst.atIneq(ubIneq, cst.getNumCols() - 1) + c; in getDivRepr()
160 assert(expr.size() == cst.getNumCols() && "Invalid expression size"); in getDivRepr()
177 expr.back() = -signDiv * cst.atEq(eqInd, cst.getNumCols() - 1); in getDivRepr()
222 assert(dividend.size() == cst.getNumCols() && "Invalid dividend size"); in computeSingleVarRepr()
/llvm-project-15.0.7/mlir/lib/Dialect/SCF/Utils/
H A DAffineCanonicalizationUtils.cpp173 SmallVector<int64_t> ineq(newConstr.getNumCols(), 0); in canonicalizeMinMaxOp()
176 ineq[newConstr.getNumCols() - 1] = -1; in canonicalizeMinMaxOp()
229 SmallVector<int64_t> ineqLb(constraints.getNumCols(), 0); in addLoopRangeConstraints()
/llvm-project-15.0.7/mlir/lib/Dialect/Affine/Analysis/
H A DAffineStructures.cpp175 assert(flatExpr.size() == getNumCols()); in FlatAffineValueConstraints()
481 SmallVector<int64_t, 8> eqToAdd(getNumCols(), 0); in composeMatchingMap()
611 SmallVector<int64_t, 8> dividend(getNumCols(), 0); in addAffineForOpDomain()
617 SmallVector<int64_t, 8> eq(getNumCols(), 0); in addAffineForOpDomain()
621 eq[getNumCols() - 2] = -step; in addAffineForOpDomain()
767 if (cst.atEq(curEquality, cst.getNumCols() - 1) != 0) in detectAsMod()
867 SmallVector<int64_t, 8> dividend(cst.getNumCols()); in detectAsFloorDiv()
1194 SmallVector<int64_t> ineq(getNumCols(), 0); in addBound()
1493 bound.reserve(getNumCols() - 1); in getIneqAsAffineValueMap()
1763 unsigned oldCols = localVarCst.getNumCols(); in getRelationFromMap()
[all …]
H A DAffineAnalysis.cpp383 unsigned numCols = dependenceDomain->getNumCols(); in addOrderingConstraints()
425 eq.resize(dependenceDomain->getNumCols()); in computeDirectionVector()
/llvm-project-15.0.7/mlir/include/mlir/IR/
H A DAffineExprVisitor.h335 inline unsigned getNumCols() const { in getNumCols() function
338 inline unsigned getConstantIndex() const { return getNumCols() - 1; } in getConstantIndex()
/llvm-project-15.0.7/mlir/include/mlir/Analysis/Presburger/
H A DIntegerRelation.h161 inline unsigned getNumCols() const { return space.getNumVars() + 1; } in getNumCols() function
/llvm-project-15.0.7/mlir/lib/IR/
H A DAffineExpr.cpp1237 operandExprStack.emplace_back(SmallVector<int64_t, 32>(getNumCols(), 0)); in visitDimExpr()
1244 operandExprStack.emplace_back(SmallVector<int64_t, 32>(getNumCols(), 0)); in visitSymbolExpr()
1251 operandExprStack.emplace_back(SmallVector<int64_t, 32>(getNumCols(), 0)); in visitConstantExpr()
/llvm-project-15.0.7/mlir/lib/Dialect/Affine/Transforms/
H A DLoopFusion.cpp931 assert(lbs[d].size() == cst->getNumCols() - rank && "incorrect bound size"); in createPrivateMemRef()
934 for (unsigned j = 0, e = cst->getNumCols() - rank - 1; j < e; j++) { in createPrivateMemRef()
939 (offset + lbs[d][cst->getNumCols() - 1 - rank]).floorDiv(lbDivisors[d]); in createPrivateMemRef()
/llvm-project-15.0.7/mlir/lib/Dialect/Affine/Utils/
H A DLoopUtils.cpp2123 assert(lbs[d].size() == cst->getNumCols() - rank && "incorrect bound size"); in generateCopy()
2126 for (unsigned j = 0, e = cst->getNumCols() - rank - 1; j < e; j++) in generateCopy()
2130 (offset + lbs[d][cst->getNumCols() - 1 - rank]).floorDiv(lbDivisors[d]); in generateCopy()
2694 for (unsigned i = 0, e = cst.getNumCols(); i < e; ++i) in createSeparationCondition()
2699 for (unsigned i = 0, e = cst.getNumCols(); i < e; ++i) in createSeparationCondition()