312         atIneq(r, c) = inequalities[r * oldNumReservedCols + c];  in addId()
314         atIneq(r, c + 1) = inequalities[r * oldNumReservedCols + c];  in addId()
316     atIneq(r, absolutePos) = 0;  in addId()
733     return isEq ? cst.atEq(rowIdx, colIdx) : cst.atIneq(rowIdx, colIdx);  in findConstraintWithNonZeroAt()
751                 : constraints->atIneq(rowIdx, colIdx);  in normalizeConstraintByGCD()
761            : constraints->atIneq(rowIdx, j) = v;  in normalizeConstraintByGCD()
802         int64_t v = isEq ? atEq(i, j) : atIneq(i, j);  in hasInvalidConstraint()
812       int64_t v = isEq ? atEq(i, numCols - 1) : atIneq(i, numCols - 1);  in hasInvalidConstraint()
835     return isEq ? constraints->atEq(i, j) : constraints->atIneq(i, j);  in eliminateFromConstraint()
855          : constraints->atIneq(rowIdx, j) = v;  in eliminateFromConstraint()
878         constraints->atIneq(r, c - numToEliminate) = constraints->atIneq(r, c);  in shiftColumnsToLeft()
940       if (cst.atIneq(r, pos) > 0) {  in getBestIdToEliminate()
942       } else if (cst.atIneq(r, pos) < 0) {  in getBestIdToEliminate()
1097     uint64_t gcd = std::abs(atIneq(i, 0));  in GCDTightenInequalities()
1099       gcd = llvm::GreatestCommonDivisor64(gcd, std::abs(atIneq(i, j)));  in GCDTightenInequalities()
1104       atIneq(i, numCols - 1) = mlir::floorDiv(atIneq(i, numCols - 1), gcdI);  in GCDTightenInequalities()
1106         atIneq(i, j) /= gcdI;  in GCDTightenInequalities()
1282     if (atIneq(r, pos) >= 1) {  in getLowerAndUpperBoundIndices()
1285     } else if (atIneq(r, pos) <= -1) {  in getLowerAndUpperBoundIndices()
1334       int64_t divisor = cst.atIneq(lbPos, pos);  in detectAsFloorDiv()
1335       int64_t lbConstTerm = cst.atIneq(lbPos, cst.getNumCols() - 1);  in detectAsFloorDiv()
1339       if (cst.atIneq(ubPos, cst.getNumCols() - 1) != 0)  in detectAsFloorDiv()
1345         if (cst.atIneq(lbPos, c) != -cst.atIneq(ubPos, c))  in detectAsFloorDiv()
1347         if (c != pos && cst.atIneq(lbPos, c) != 0)  in detectAsFloorDiv()
1361           int64_t ubVal = cst.atIneq(ubPos, c);  in detectAsFloorDiv()
1387     cst->atIneq(r, c) = val;  in fillInequality()
1394     cst->atIneq(r, c) = -cst->atIneq(r, c);  in negateInequality()
1409     tmpCst.atIneq(r, tmpCst.getNumCols() - 1)--;  in removeRedundantInequalities()
1417       tmpCst.atIneq(r, tmpCst.getNumCols() - 1)++;  in removeRedundantInequalities()
1427       atIneq(dest, c) = atIneq(src, c);  in removeRedundantInequalities()
1452       atIneq(dest, c) = atIneq(src, c);  in removeRedundantConstraints()
1985     std::swap(atIneq(r, posA), atIneq(r, posB));  in swapId()
2077     atIneq(r, getNumCols() - 1) += atIneq(r, pos) * constVal;  in setAndEliminate()
2166     if (atIneq(r, pos) != 0)  in getConstantBoundOnDimSize()
2196         if (atIneq(ubPos, j) != -atIneq(lbPos, j)) {  in getConstantBoundOnDimSize()
2201       int64_t diff = ceilDiv(atIneq(ubPos, getNumCols() - 1) +  in getConstantBoundOnDimSize()
2202                                  atIneq(lbPos, getNumCols() - 1) + 1,  in getConstantBoundOnDimSize()
2203                              atIneq(lbPos, pos));  in getConstantBoundOnDimSize()
2220     *boundFloorDivisor = atIneq(minLbPosition, pos);  in getConstantBoundOnDimSize()
2221     assert(*boundFloorDivisor == -atIneq(minUbPosition, pos));  in getConstantBoundOnDimSize()
2223       (*lb)[c] = -atIneq(minLbPosition, getNumDimIds() + c);  in getConstantBoundOnDimSize()
2227         (*ub)[c] = atIneq(minUbPosition, getNumDimIds() + c);  in getConstantBoundOnDimSize()
2233     (*lb)[getNumSymbolIds()] += atIneq(minLbPosition, pos) - 1;  in getConstantBoundOnDimSize()
2258     if (atIneq(r, 0) != 0)  in computeConstantLowerOrUpperBound()
2271       if (atIneq(r, 0) <= 0)  in computeConstantLowerOrUpperBound()
2274     } else if (atIneq(r, 0) >= 0) {  in computeConstantLowerOrUpperBound()
2280       if (c != 0 && atIneq(r, c) != 0)  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()
2320       if (atIneq(r, c) != 0)  in isHyperRectangular()
2359       os << atIneq(i, j) << " ";  in print()
2389       if (atIneq(r, c) != 0)  in removeTrivialRedundancy()
2392     return atIneq(r, getNumCols() - 1) >= 0;  in removeTrivialRedundancy()
2409     int64_t constTerm = atIneq(r, getNumCols() - 1);  in removeTrivialRedundancy()
2431       atIneq(dest, c) = atIneq(src, c);  in removeTrivialRedundancy()
2549     if (atIneq(r, pos) != 0)  in FourierMotzkinEliminate()
2573     if (atIneq(r, pos) == 0) {  in FourierMotzkinEliminate()
2576     } else if (atIneq(r, pos) >= 1) {  in FourierMotzkinEliminate()
2620       int64_t lbCoeff = atIneq(lbPos, pos);  in FourierMotzkinEliminate()
2624       int64_t ubCoeff = -atIneq(ubPos, pos);  in FourierMotzkinEliminate()
2631         ineq.push_back(atIneq(ubPos, l) * (lcm / ubCoeff) +  in FourierMotzkinEliminate()
2632                        atIneq(lbPos, l) * (lcm / lbCoeff));  in FourierMotzkinEliminate()
2658       ineq.push_back(atIneq(nbPos, l));  in FourierMotzkinEliminate()
3057       if (cst.atIneq(r, c) != 0)  in getIndependentConstraints()