Searched refs:getSpace (Results 1 – 14 of 14) sorted by relevance
47 assert(space.isCompatible(disjunct.getSpace()) && "Spaces should match"); in unionInPlace()56 assert(space.isCompatible(set.getSpace()) && "Spaces should match"); in unionInPlace()64 assert(space.isCompatible(set.getSpace()) && "Spaces should match"); in unionSet()97 assert(space.isCompatible(set.getSpace()) && "Spaces should match"); in intersect()99 PresburgerRelation result(getSpace()); in intersect()144 PresburgerRelation result(getSpace()); in computeReprWithOnlyDivLocals()184 assert(b.getSpace().isCompatible(s.getSpace()) && "Spaces should match"); in getSetDifference()263 for (unsigned i = initBCounts.getSpace().getNumLocalVars(), in getSetDifference()434 assert(space.isCompatible(set.getSpace()) && "Spaces should match"); in subtract()435 PresburgerRelation result(getSpace()); in subtract()[all …]
30 PresburgerSet domain = PresburgerSet::getEmpty(getSpace()); in getDomain()234 assert(getSpace().isCompatible(func.getSpace()) && in unionFunction()246 PWMAFunction result(getSpace(), getNumOutputs()); in unionFunction()294 const PresburgerSpace &space = mafA.getDomain().getSpace(); in tiebreakLex()
55 assert(space.isEqual(other.getSpace()) && "Spaces must be equal."); in append()77 assert(space.isCompatible(other.getSpace()) && "Spaces must be compatible."); in isEqual()145 return {getSpace(), getNumInequalities(), getNumEqualities()}; in getCounts()156 truncateVarKind(kind, counts.getSpace().getNumVarKind(kind)); in truncateVarKind()223 PresburgerSpace space = getSpace(); in computeReprWithOnlyDivLocals()1795 PresburgerSpace newSpace = getSpace(); in fourierMotzkinEliminate()1953 c = IntegerRelation(a.getSpace()); in getCommonConstraints()1977 assert(space.isEqual(otherCst.getSpace()) && "Spaces should match."); in unionBoundingBox()2168 assert(getDomainSet().getSpace().isCompatible(poly.getSpace()) && in intersectDomain()2184 assert(getRangeSet().getSpace().isCompatible(poly.getSpace()) && in intersectRange()[all …]
268 assert(relA.getSpace().isCompatible(relB.getSpace()) && in mergeLocalVars()
116 IntegerRelation result(rel.getSpace()); in applyTo()
510 SymbolicLexMin result(domainPoly.getSpace(), var.size() - nSymbol); in computeSymbolicIntegerLexMin()
59 const PresburgerSpace &getDomainSpace() const { return domainSet.getSpace(); } in getDomainSpace()144 const PresburgerSpace &getSpace() const { return space; } in getSpace() function
56 const PresburgerSpace &getSpace() const { return space; } in getSpace() function
97 const PresburgerSpace &getSpace() const { return space; } in getSpace() function223 const PresburgerSpace &getSpace() const { return space; }; in getSpace() function
845 EXPECT_TRUE(repr.getSpace().isCompatible(poly.getSpace())); in testComputeReprAtPoints()858 EXPECT_TRUE(repr.getSpace().isCompatible(poly.getSpace())); in testComputeRepr()
2864 return isl::set::universe(Array->getSpace()); in getExtent()2873 return isl::set::empty(Array->getSpace()); in getExtent()2875 isl::set AccessSet = AccessUSet.extract_set(Array->getSpace()); in getExtent()2877 isl::local_space LS = isl::local_space(Array->getSpace()); in getExtent()2889 isl::set Extent = isl::set::universe(Array->getSpace()); in getExtent()2908 isl::local_space(Array->getSpace()), isl::dim::set, i); in getExtent()3034 PPCGArray.space = Array->getSpace().release(); in createArrays()3070 isl_space *Space = Array->getSpace().release(); in getArrayIdentity()
254 isl::space ScopArrayInfo::getSpace() const { in getSpace() function in ScopArrayInfo262 isl::space Space = getSpace(); in isReadOnly()389 isl::space ArraySpace = SAI->getSpace(); in wrapConstantDimensions()441 isl::space ArraySpace = SAI->getSpace(); in updateDimensionality()
2193 isl::space Space = Array->getSpace(); in foldSizeConstantsToRight()2200 isl::map Transform = isl::map::universe(Array->getSpace().map_from_set()); in foldSizeConstantsToRight()
368 isl::space getSpace() const;