Searched refs:isMarkedRedundant (Results 1 – 5 of 5) sorted by relevance
226 EXPECT_TRUE(simplex.isMarkedRedundant(0)); in TEST()234 EXPECT_TRUE(simplex.isMarkedRedundant(0)); in TEST()243 EXPECT_FALSE(simplex.isMarkedRedundant(0)); in TEST()251 EXPECT_TRUE(simplex.isMarkedRedundant(0)); in TEST()259 EXPECT_FALSE(simplex.isMarkedRedundant(0)); in TEST()267 EXPECT_FALSE(simplex.isMarkedRedundant(0)); in TEST()275 EXPECT_TRUE(simplex.isMarkedRedundant(0)); in TEST()283 EXPECT_FALSE(simplex.isMarkedRedundant(0)); in TEST()299 EXPECT_FALSE(simplex.isMarkedRedundant(i)) << "i = " << i << "\n"; in TEST()318 EXPECT_EQ(simplex.isMarkedRedundant(0), true); in TEST()[all …]
185 llvm::SmallBitVector isMarkedRedundant; in subtractRecursively() local188 isMarkedRedundant.push_back(simplex.isMarkedRedundant(offset + j)); in subtractRecursively()223 if (isMarkedRedundant[j]) in subtractRecursively()233 if (!isMarkedRedundant[offset + 2 * j]) in subtractRecursively()235 if (!isMarkedRedundant[offset + 2 * j + 1]) in subtractRecursively()
1459 if (!simplex.isMarkedRedundant(r)) in removeRedundantConstraints()1476 if (!(simplex.isMarkedRedundant(numIneqs + 2 * r) && in removeRedundantConstraints()1477 simplex.isMarkedRedundant(numIneqs + 2 * r + 1))) in removeRedundantConstraints()
194 bool isMarkedRedundant(unsigned constraintIndex) const;
497 bool Simplex::isMarkedRedundant(unsigned constraintIndex) const { in isMarkedRedundant() function in mlir::Simplex