275   assert(eq.size() == getNumCols());  in addEquality()
282   assert(inEq.size() == getNumCols());  in addInequality()
392   assert(offset + num < getNumCols() && "invalid range");  in getLowerAndUpperBoundIndices()
454   unsigned constantColPos = getNumCols() - 1;  in setAndEliminate()
471   assert(colIdx < getNumCols() && "position out of bounds");  in findConstraintWithNonZeroAt()
494     unsigned numCols = getNumCols();  in hasInvalidConstraint()
544   unsigned numCols = constraints->getNumCols();  in eliminateFromConstraint()
657   unsigned numCols = getNumCols();  in isEmptyByGCDTest()
698   unsigned dirsNumCols = getNumCols() - 1;  in getBoundedDirections()
959   unsigned numCols = getNumCols();  in gcdTightenInequalities()
962     int64_t gcd = inequalities.normalizeRow(i, getNumCols() - 1);  in gcdTightenInequalities()
1029     --tmpCst.atIneq(r, tmpCst.getNumCols() - 1);  in removeRedundantInequalities()
1037       ++tmpCst.atIneq(r, tmpCst.getNumCols() - 1);  in removeRedundantInequalities()
1285   assert(pos < getNumCols());  in addBound()
1289     equalities(row, getNumCols() - 1) = -value;  in addBound()
1293     inequalities(row, getNumCols() - 1) =  in addBound()
1301   assert(expr.size() == getNumCols());  in addBound()
1305   inequalities(inequalities.getNumRows() - 1, getNumCols() - 1) +=  in addBound()
1316   assert(dividend.size() == getNumCols() && "incorrect dividend size");  in addLocalFloorDiv()
1367   int64_t constVal = -atEq(rowIdx, getNumCols() - 1) / atEq(rowIdx, pos);  in constantFoldVar()
1470       for (j = 0, e = getNumCols() - 1; j < e; j++)  in getConstantBoundOnDimSize()
1474       if (j < getNumCols() - 1)  in getConstantBoundOnDimSize()
1476       int64_t diff = ceilDiv(atIneq(ubPos, getNumCols() - 1) +  in getConstantBoundOnDimSize()
1477                                  atIneq(lbPos, getNumCols() - 1) + 1,  in getConstantBoundOnDimSize()
1530     return -atEq(eqRowIdx, getNumCols() - 1) / atEq(eqRowIdx, 0);  in computeConstantLowerOrUpperBound()
1556     for (c = 0, f = getNumCols() - 1; c < f; c++)  in computeConstantLowerOrUpperBound()
1559     if (c < getNumCols() - 1)  in computeConstantLowerOrUpperBound()
1564         isLower ? mlir::ceilDiv(-atIneq(r, getNumCols() - 1), atIneq(r, 0))  in computeConstantLowerOrUpperBound()
1565                 : mlir::floorDiv(atIneq(r, getNumCols() - 1), -atIneq(r, 0));  in computeConstantLowerOrUpperBound()
1598   assert(pos < getNumCols() - 1);  in isHyperRectangular()
1641     for (unsigned c = 0, e = getNumCols() - 1; c < e; c++) {  in removeTrivialRedundancy()
1645     return atIneq(r, getNumCols() - 1) >= 0;  in removeTrivialRedundancy()
1652     auto row = ArrayRef<int64_t>(rowStart, getNumCols());  in removeTrivialRedundancy()
1662     int64_t constTerm = atIneq(r, getNumCols() - 1);  in removeTrivialRedundancy()
1663     auto rowWithoutConstTerm = ArrayRef<int64_t>(rowStart, getNumCols() - 1);  in removeTrivialRedundancy()
1802                          getNumEqualities(), getNumCols() - 1, newSpace);  in fourierMotzkinEliminate()
1820       ineq.reserve(newRel.getNumCols());  in fourierMotzkinEliminate()
1827       for (unsigned l = 0, e = getNumCols(); l < e; l++) {  in fourierMotzkinEliminate()
1855     ineq.reserve(getNumCols() - 1);  in fourierMotzkinEliminate()
1856     for (unsigned l = 0, e = getNumCols(); l < e; l++) {  in fourierMotzkinEliminate()
1870     eq.reserve(newRel.getNumCols());  in fourierMotzkinEliminate()
1871     for (unsigned l = 0, e = getNumCols(); l < e; l++) {  in fourierMotzkinEliminate()
1897   assert((getNumCols() < 2 || pos <= getNumCols() - 2) && "invalid position");  in projectOut()
1898   assert(pos + num < getNumCols() && "invalid range");  in projectOut()
1996   SmallVector<int64_t, 8> newLb(getNumCols()), newUb(getNumCols());  in unionBoundingBox()
2246     for (unsigned j = 0, f = getNumCols(); j < f; ++j) {  in print()
2252     for (unsigned j = 0, f = getNumCols(); j < f; ++j) {  in print()