Lines Matching defs:poly
59 static void checkSample(bool hasSample, const IntegerPolyhedron &poly, in checkSample()
482 IntegerPolyhedron poly = in TEST() local
577 IntegerPolyhedron poly(PresburgerSpace::getSetSpace(2)); in TEST() local
590 IntegerPolyhedron poly(PresburgerSpace::getSetSpace(2)); in TEST() local
609 IntegerPolyhedron &poly, in checkDivisionRepresentation()
630 IntegerPolyhedron poly(PresburgerSpace::getSetSpace(1)); in TEST() local
645 IntegerPolyhedron poly(PresburgerSpace::getSetSpace(4)); in TEST() local
663 IntegerPolyhedron poly(PresburgerSpace::getSetSpace(4)); in TEST() local
688 IntegerPolyhedron poly = parsePoly("(i) : (i mod 3 - 1 >= 0)"); in TEST() local
708 IntegerPolyhedron poly = in TEST() local
723 IntegerPolyhedron poly = parsePoly("(i, j, q) : (-4*q + i + j == 0)"); in TEST() local
733 IntegerPolyhedron poly = parsePoly("(i, j, q) : (4*q - i - j == 0)"); in TEST() local
743 IntegerPolyhedron poly = parsePoly("(i, j, q) : (3*q + i + j - 2 == 0)"); in TEST() local
756 IntegerPolyhedron poly = in TEST() local
771 IntegerPolyhedron poly = in TEST() local
784 IntegerPolyhedron poly = in TEST() local
799 IntegerPolyhedron poly(PresburgerSpace::getSetSpace(1, 0, 1)); in TEST() local
1065 void expectRationalLexMin(const IntegerPolyhedron &poly, in expectRationalLexMin()
1072 void expectNoRationalLexMin(OptimumKind kind, const IntegerPolyhedron &poly) { in expectNoRationalLexMin()
1138 void expectIntegerLexMin(const IntegerPolyhedron &poly, ArrayRef<int64_t> min) { in expectIntegerLexMin()
1144 void expectNoIntegerLexMin(OptimumKind kind, const IntegerPolyhedron &poly) { in expectNoIntegerLexMin()
1165 IntegerPolyhedron poly = parsePoly(polyStr); in expectSymbolicIntegerLexMin() local
1388 expectComputedVolumeIsValidOverapprox(const IntegerPolyhedron &poly, in expectComputedVolumeIsValidOverapprox()