162   for (unsigned r = 0, e = other.getNumInequalities(); r < e; r++) {  in FlatAffineConstraints()
181   inequalities.reserve(set.getNumInequalities() * numReservedCols);  in FlatAffineConstraints()
248                        other.getNumInequalities() * numReservedCols);  in append()
252   for (unsigned r = 0, e = other.getNumInequalities(); r < e; r++) {  in append()
287     inequalities.resize(getNumInequalities() * (getNumCols() + 1));  in addId()
306   int numInequalities = static_cast<int>(getNumInequalities());  in addId()
735   unsigned e = isEq ? cst.getNumEqualities() : cst.getNumInequalities();  in findConstraintWithNonZeroAt()
770   for (unsigned i = 0, e = getNumInequalities(); i < e; ++i) {  in normalizeConstraintsByGCD()
776   if (inequalities.size() != getNumInequalities() * numReservedCols)  in hasConsistentState()
798     unsigned numRows = isEq ? getNumEqualities() : getNumInequalities();  in hasInvalidConstraint()
871                           : constraints->getNumInequalities();  in shiftColumnsToLeft()
939     for (unsigned r = 0, e = cst.getNumInequalities(); r < e; r++) {  in getBestIdToEliminate()
1079   for (unsigned i = 0, e = getNumInequalities(); i < e; ++i) {  in containsPoint()
1096   for (unsigned i = 0, e = getNumInequalities(); i < e; ++i) {  in GCDTightenInequalities()
1148     for (unsigned i = 0, e = getNumInequalities(); i < e; ++i) {  in gaussianEliminateIds()
1278   for (unsigned r = 0, e = getNumInequalities(); r < e; r++) {  in getLowerAndUpperBoundIndices()
1401   SmallVector<bool, 32> redun(getNumInequalities(), false);  in removeRedundantInequalities()
1406   for (unsigned r = 0, e = getNumInequalities(); r < e; r++) {  in removeRedundantInequalities()
1431   for (unsigned r = 0, e = getNumInequalities(); r < e; r++) {  in removeRedundantInequalities()
1455   unsigned numIneqs = getNumInequalities();  in removeRedundantConstraints()
1984   for (unsigned r = 0, e = getNumInequalities(); r < e; r++)  in swapId()
2032   unsigned numInequalities = getNumInequalities();  in removeInequality()
2076   for (unsigned r = 0, e = getNumInequalities(); r < e; r++) {  in setAndEliminate()
2165   for (r = 0, e = getNumInequalities(); r < e; r++) {  in getConstantBoundOnDimSize()
2257   for (r = 0, e = getNumInequalities(); r < e; r++) {  in computeConstantLowerOrUpperBound()
2269   for (unsigned r = 0, e = getNumInequalities(); r < e; r++) {  in computeConstantLowerOrUpperBound()
2317   for (unsigned r = 0, e = getNumInequalities(); r < e; r++) {  in isHyperRectangular()
2357   for (unsigned i = 0, e = getNumInequalities(); i < e; ++i) {  in print()
2396   SmallVector<bool, 256> redunIneq(getNumInequalities(), false);  in removeTrivialRedundancy()
2397   for (unsigned r = 0, e = getNumInequalities(); r < e; r++) {  in removeTrivialRedundancy()
2437   for (unsigned r = 0, e = getNumInequalities(); r < e; r++) {  in removeTrivialRedundancy()
2548   for (r = 0, e = getNumInequalities(); r < e; r++) {  in FourierMotzkinEliminate()
2552   if (r == getNumInequalities()) {  in FourierMotzkinEliminate()
2567   nbIndices.reserve(getNumInequalities());  in FourierMotzkinEliminate()
2572   for (unsigned r = 0, e = getNumInequalities(); r < e; r++) {  in FourierMotzkinEliminate()
2768   for (unsigned r = 0, e = A.getNumInequalities(); r < e; ++r) {  in getCommonConstraints()
2769     for (unsigned s = 0, f = B.getNumInequalities(); s < f; ++s) {  in getCommonConstraints()
2953   assert(ineqPos < getNumInequalities() && "invalid inequality position");  in getIneqAsAffineValueMap()
3038   for (unsigned i = 0, e = getNumInequalities(); i < e; ++i)  in getAsIntegerSet()
3053   for (unsigned r = 0, e = cst.getNumInequalities(); r < e; r++) {  in getIndependentConstraints()