Searched refs:equalities (Results 1 – 16 of 16) sorted by relevance
187 SDBM SDBM::get(ArrayRef<SDBMExpr> inequalities, ArrayRef<SDBMExpr> equalities) { in get() argument208 for (auto expr : equalities) in get()247 for (auto eq : equalities) { in get()310 for (auto eq : equalities) { in get()350 SmallVectorImpl<SDBMExpr> &equalities) { in convertDBMElement() argument360 equalities.push_back(rowExpr - colExpr - diffIJValue.getValue()); in convertDBMElement()423 SmallVectorImpl<SDBMExpr> &equalities) { in getSDBMExpressions() argument455 equalities.push_back(inputExpr - upperBound.getValue()); in getSDBMExpressions()468 equalities); in getSDBMExpressions()478 equalities.push_back(getInput(position - 1) - stripePair.second); in getSDBMExpressions()[all …]
73 equalities.reserve(numReservedCols * numReservedEqualities); in numReservedCols()172 return equalities[i * numReservedCols + j]; in atEq()175 return equalities[i * numReservedCols + j]; in atEq()190 assert(equalities.size() % numReservedCols == 0 && in getNumEqualities()192 return equalities.size() / numReservedCols; in getNumEqualities()202 return equalities.capacity() / numReservedCols; in getNumReservedEqualities()210 return ArrayRef<int64_t>(&equalities[idx * numReservedCols], getNumCols()); in getEquality()632 SmallVector<int64_t, 64> equalities; variable
103 ArrayRef<SDBMExpr> equalities);107 SmallVectorImpl<SDBMExpr> &equalities);127 SmallVectorImpl<SDBMExpr> &equalities);
159 equalities.reserve(numReservedEqualities * numReservedCols); in FlatAffineConstraints()180 equalities.reserve(set.getNumEqualities() * numReservedCols); in FlatAffineConstraints()225 equalities.reserve(newNumReservedCols * numReservedEqualities); in reset()249 equalities.reserve(equalities.size() + in append()286 equalities.resize(getNumEqualities() * (getNumCols() + 1)); in addId()324 atEq(r, c) = equalities[r * oldNumReservedCols + c]; in addId()328 atEq(r, c + 1) = equalities[r * oldNumReservedCols + c]; in addId()778 if (equalities.size() != getNumEqualities() * numReservedCols) in hasConsistentState()1480 equalities.resize(numReservedCols * pos); in removeRedundantConstraints()1874 unsigned offset = equalities.size(); in addEquality()[all …]
205 // Same as above but with equalities and inequalities.218 // Same as above but with equalities added into the mix.
380 check for implicit equalities among the integer points by computing384 bring huge benefits if any equalities can be found or if the problem397 \subsubsection{Exploiting Equalities}\label{s:equalities}399 If there are any (explicit) equalities in the input description,401 It is also possible to write $r$ equalities as $r+1$ inequalities403 equalities to reduce the dimensionality of the problem.443 Currently, {\tt isl} also eliminates equalities involving only parameters446 would obviate the need for removing parametric equalities.490 It may in some cases be apparent from the equalities in the problem503 of equalities described above there should be
219 title = {Solving systems of affine (in)equalities},
2191 describing the equalities and the inequalities.5847 =item * Detecting equalities5863 equalities.
169 comparison type. The GVN pass *will* optimize redundant equalities even if
170 comparison type. The GVN pass *will* optimize redundant equalities even if
516 // Check that we can infer type equalities from certain traits.
516 2. Relaxing the conditions on the indexing map equalities on the each pair and
1a 2A 3Aaron 4AARON 5abaissiez 6abandon 7abandoned 8abase 9Abase 10 ...
23562 …abstract = "A simple technique for reasoning about equalities that is fast and complete for gr…24684 …he conditions in the decision tables are assumed to be inequalities or equalities relating linear …
64570 equalities %9198