Lines Matching refs:getNumCols
198 assert(flatExpr.size() == getNumCols()); in FlatAffineConstraints()
243 assert(other.getNumCols() == getNumCols()); in append()
285 if (getNumCols() + 1 > numReservedCols) { in addId()
286 equalities.resize(getNumEqualities() * (getNumCols() + 1)); in addId()
287 inequalities.resize(getNumInequalities() * (getNumCols() + 1)); in addId()
308 int numCols = static_cast<int>(getNumCols()); in addId()
502 SmallVector<int64_t, 8> eqToAdd(getNumCols(), 0); in composeMap()
523 eqToAdd[getNumCols() - 1] = -flatExpr[flatExpr.size() - 1]; in composeMap()
575 SmallVector<int64_t, 8> eqToAdd(getNumCols(), 0); in composeMatchingMap()
592 eqToAdd[getNumCols() - 1] = -flatExpr[flatExpr.size() - 1]; in composeMatchingMap()
674 SmallVector<int64_t, 8> dividend(getNumCols(), 0); in addAffineForOpDomain()
680 SmallVector<int64_t, 8> eq(getNumCols(), 0); in addAffineForOpDomain()
684 eq[getNumCols() - 2] = -step; in addAffineForOpDomain()
731 assert(colIdx < cst.getNumCols() && "position out of bounds"); in findConstraintWithNonZeroAt()
754 for (unsigned j = 1, e = constraints->getNumCols(); j < e; ++j) { in normalizeConstraintByGCD()
758 for (unsigned j = 0, e = constraints->getNumCols(); j < e; ++j) { in normalizeConstraintByGCD()
797 unsigned numCols = getNumCols(); in hasInvalidConstraint()
847 unsigned numCols = constraints->getNumCols(); in eliminateFromConstraint()
869 unsigned numCols = constraints->getNumCols(); in shiftColumnsToLeft()
887 assert(idLimit < getNumCols() && "invalid id limit"); in removeIdRange()
1023 unsigned numCols = getNumCols(); in isEmptyByGCDTest()
1095 unsigned numCols = getNumCols(); in GCDTightenInequalities()
1193 if (cst.atEq(r, cst.getNumCols() - 1) != 0) in detectAsMod()
1259 assert(offset + num < getNumCols() && "invalid range"); in getLowerAndUpperBoundIndices()
1335 int64_t lbConstTerm = cst.atIneq(lbPos, cst.getNumCols() - 1); in detectAsFloorDiv()
1339 if (cst.atIneq(ubPos, cst.getNumCols() - 1) != 0) in detectAsFloorDiv()
1344 for (c = 0, f = cst.getNumCols() - 1; c < f; c++) { in detectAsFloorDiv()
1358 for (c = 0, f = cst.getNumCols() - 1; c < f; c++) { in detectAsFloorDiv()
1386 for (unsigned c = 0, f = cst->getNumCols(); c < f; c++) { in fillInequality()
1393 for (unsigned c = 0, f = cst->getNumCols(); c < f; c++) { in negateInequality()
1409 tmpCst.atIneq(r, tmpCst.getNumCols() - 1)--; in removeRedundantInequalities()
1417 tmpCst.atIneq(r, tmpCst.getNumCols() - 1)++; in removeRedundantInequalities()
1426 for (unsigned c = 0, e = getNumCols(); c < e; c++) { in removeRedundantInequalities()
1451 for (unsigned c = 0, e = getNumCols(); c < e; c++) in removeRedundantConstraints()
1471 for (unsigned c = 0, e = getNumCols(); c < e; c++) in removeRedundantConstraints()
1802 SmallVector<int64_t, 4> ineq(getNumCols(), 0); in addLowerOrUpperBound()
1816 ineq[getNumCols() - 1] = in addLowerOrUpperBound()
1873 assert(eq.size() == getNumCols()); in addEquality()
1880 assert(inEq.size() == getNumCols()); in addInequality()
1887 assert(pos < getNumCols()); in addConstantLowerBound()
1891 inequalities.begin() + offset + getNumCols(), 0); in addConstantLowerBound()
1893 inequalities[offset + getNumCols() - 1] = -lb; in addConstantLowerBound()
1897 assert(pos < getNumCols()); in addConstantUpperBound()
1901 inequalities.begin() + offset + getNumCols(), 0); in addConstantUpperBound()
1903 inequalities[offset + getNumCols() - 1] = ub; in addConstantUpperBound()
1908 assert(expr.size() == getNumCols()); in addConstantLowerBound()
1912 inequalities.begin() + offset + getNumCols(), 0); in addConstantLowerBound()
1914 inequalities[offset + getNumCols() - 1] += -lb; in addConstantLowerBound()
1919 assert(expr.size() == getNumCols()); in addConstantUpperBound()
1923 inequalities.begin() + offset + getNumCols(), 0); in addConstantUpperBound()
1924 for (unsigned i = 0, e = getNumCols(); i < e; i++) { in addConstantUpperBound()
1927 inequalities[offset + getNumCols() - 1] += ub; in addConstantUpperBound()
1937 assert(dividend.size() == getNumCols() && "incorrect dividend size"); in addLocalFloorDiv()
2003 equalities.begin() + offset + getNumCols(), 0); in setIdToConstant()
2005 equalities[offset + getNumCols() - 1] = -val; in setIdToConstant()
2077 atIneq(r, getNumCols() - 1) += atIneq(r, pos) * constVal; in setAndEliminate()
2080 atEq(r, getNumCols() - 1) += atEq(r, pos) * constVal; in setAndEliminate()
2093 int64_t constVal = -atEq(rowIdx, getNumCols() - 1) / atEq(rowIdx, pos); in constantFoldId()
2195 for (j = 0, e = getNumCols() - 1; j < e; j++) in getConstantBoundOnDimSize()
2199 if (j < getNumCols() - 1) in getConstantBoundOnDimSize()
2201 int64_t diff = ceilDiv(atIneq(ubPos, getNumCols() - 1) + in getConstantBoundOnDimSize()
2202 atIneq(lbPos, getNumCols() - 1) + 1, in getConstantBoundOnDimSize()
2253 return -atEq(eqRowIdx, getNumCols() - 1) / atEq(eqRowIdx, 0); in computeConstantLowerOrUpperBound()
2279 for (c = 0, f = getNumCols() - 1; c < f; c++) in computeConstantLowerOrUpperBound()
2282 if (c < getNumCols() - 1) in computeConstantLowerOrUpperBound()
2287 isLower ? mlir::ceilDiv(-atIneq(r, getNumCols() - 1), atIneq(r, 0)) in computeConstantLowerOrUpperBound()
2288 : mlir::floorDiv(atIneq(r, getNumCols() - 1), -atIneq(r, 0)); in computeConstantLowerOrUpperBound()
2315 assert(pos < getNumCols() - 1); in isHyperRectangular()
2352 for (unsigned j = 0, f = getNumCols(); j < f; ++j) { in print()
2358 for (unsigned j = 0, f = getNumCols(); j < f; ++j) { in print()
2388 for (unsigned c = 0, e = getNumCols() - 1; c < e; c++) { in removeTrivialRedundancy()
2392 return atIneq(r, getNumCols() - 1) >= 0; in removeTrivialRedundancy()
2399 auto row = ArrayRef<int64_t>(rowStart, getNumCols()); in removeTrivialRedundancy()
2409 int64_t constTerm = atIneq(r, getNumCols() - 1); in removeTrivialRedundancy()
2410 auto rowWithoutConstTerm = ArrayRef<int64_t>(rowStart, getNumCols() - 1); in removeTrivialRedundancy()
2430 for (unsigned c = 0, e = getNumCols(); c < e; c++) { in removeTrivialRedundancy()
2598 getNumEqualities(), getNumCols() - 1, newNumDims, newNumSymbols, in FourierMotzkinEliminate()
2619 ineq.reserve(newFac.getNumCols()); in FourierMotzkinEliminate()
2626 for (unsigned l = 0, e = getNumCols(); l < e; l++) { in FourierMotzkinEliminate()
2654 ineq.reserve(getNumCols() - 1); in FourierMotzkinEliminate()
2655 for (unsigned l = 0, e = getNumCols(); l < e; l++) { in FourierMotzkinEliminate()
2669 eq.reserve(newFac.getNumCols()); in FourierMotzkinEliminate()
2670 for (unsigned l = 0, e = getNumCols(); l < e; l++) { in FourierMotzkinEliminate()
2696 assert((getNumCols() < 2 || pos <= getNumCols() - 2) && "invalid position"); in projectOut()
2697 assert(pos + num < getNumCols() && "invalid range"); in projectOut()
2823 SmallVector<int64_t, 8> newLb(getNumCols()), newUb(getNumCols()); in unionBoundingBox()
2965 bound.reserve(getNumCols() - 1); in getIneqAsAffineValueMap()