157       inequalities(0, numIds + 1, set.getNumInequalities(), numIds + 1) {  in FlatAffineConstraints()
215                            other.getNumInequalities());  in append()
218   for (unsigned r = 0, e = other.getNumInequalities(); r < e; r++) {  in append()
728   unsigned e = isEq ? cst.getNumEqualities() : cst.getNumInequalities();  in findConstraintWithNonZeroAt()
763   for (unsigned i = 0, e = getNumInequalities(); i < e; ++i) {  in normalizeConstraintsByGCD()
791     unsigned numRows = isEq ? getNumEqualities() : getNumInequalities();  in hasInvalidConstraint()
903     for (unsigned r = 0, e = cst.getNumInequalities(); r < e; r++) {  in getBestIdToEliminate()
1021   for (unsigned i = 0, e = getNumInequalities(); i < e; ++i) {  in getBoundedDirections()
1071   for (unsigned i = fac.getNumInequalities(); i > 0; i--)  in removeConstraintsInvolvingSuffixDims()
1201   for (unsigned i = 0, e = cone.getNumInequalities(); i < e; ++i) {  in findIntegerSample()
1246   for (unsigned i = 0, e = getNumInequalities(); i < e; ++i) {  in containsPoint()
1263   for (unsigned i = 0, e = getNumInequalities(); i < e; ++i) {  in gcdTightenInequalities()
1315     for (unsigned i = 0, e = getNumInequalities(); i < e; ++i) {  in gaussianEliminateIds()
1480   for (unsigned r = 0, e = getNumInequalities(); r < e; r++) {  in getLowerAndUpperBoundIndices()
1603   SmallVector<bool, 32> redun(getNumInequalities(), false);  in removeRedundantInequalities()
1608   for (unsigned r = 0, e = getNumInequalities(); r < e; r++) {  in removeRedundantInequalities()
1633   for (unsigned r = 0, e = getNumInequalities(); r < e; r++) {  in removeRedundantInequalities()
1657   unsigned numIneqs = getNumInequalities();  in removeRedundantConstraints()
2180   for (unsigned r = 0, e = getNumInequalities(); r < e; r++)  in swapId()
2259   for (unsigned r = 0, e = getNumInequalities(); r < e; r++)  in setAndEliminate()
2349   for (r = 0, e = getNumInequalities(); r < e; r++) {  in getConstantBoundOnDimSize()
2443   for (r = 0, e = getNumInequalities(); r < e; r++) {  in computeConstantLowerOrUpperBound()
2455   for (unsigned r = 0, e = getNumInequalities(); r < e; r++) {  in computeConstantLowerOrUpperBound()
2503   for (unsigned r = 0, e = getNumInequalities(); r < e; r++) {  in isHyperRectangular()
2543   for (unsigned i = 0, e = getNumInequalities(); i < e; ++i) {  in print()
2582   SmallVector<bool, 256> redunIneq(getNumInequalities(), false);  in removeTrivialRedundancy()
2583   for (unsigned r = 0, e = getNumInequalities(); r < e; r++) {  in removeTrivialRedundancy()
2615   for (unsigned r = 0, e = getNumInequalities(); r < e; r++)  in removeTrivialRedundancy()
2726   for (r = 0, e = getNumInequalities(); r < e; r++) {  in fourierMotzkinEliminate()
2730   if (r == getNumInequalities()) {  in fourierMotzkinEliminate()
2745   nbIndices.reserve(getNumInequalities());  in fourierMotzkinEliminate()
2750   for (unsigned r = 0, e = getNumInequalities(); r < e; r++) {  in fourierMotzkinEliminate()
2946   for (unsigned r = 0, e = a.getNumInequalities(); r < e; ++r) {  in getCommonConstraints()
2947     for (unsigned s = 0, f = b.getNumInequalities(); s < f; ++s) {  in getCommonConstraints()
3131   assert(ineqPos < getNumInequalities() && "invalid inequality position");  in getIneqAsAffineValueMap()
3216   for (unsigned i = 0, e = getNumInequalities(); i < e; ++i)  in getAsIntegerSet()
3231   for (unsigned r = 0, e = cst.getNumInequalities(); r < e; r++) {  in getIndependentConstraints()