Searched refs:isFullSet (Results 1 – 8 of 8) sorted by relevance
130 bool ConstantRange::isFullSet() const { in isFullSet() function in ConstantRange158 if (isFullSet()) { in getSetSize()172 if (isFullSet() || isWrappedSet()) in getUnsignedMax()181 if (isFullSet() || (isWrappedSet() && getUpper() != 0)) in getUnsignedMin()222 return isFullSet(); in contains()234 if (isFullSet() || Other.isEmptySet()) return true; in contains()235 if (isEmptySet() || Other.isFullSet()) return false; in contains()277 if ( isEmptySet() || CR.isFullSet()) return *this; in intersectWith()278 if (CR.isEmptySet() || isFullSet()) return CR; in intersectWith()357 if ( isFullSet() || CR.isEmptySet()) return *this; in unionWith()[all …]
933 if (Range.isFullSet()) in getMostGenericRange()
2600 Assert(!CurRange.isEmptySet() && !CurRange.isFullSet(), in visitRangeMetadata()
52 explicit ConstantRange(uint32_t BitWidth, bool isFullSet = true);100 bool isFullSet() const;
395 R.isFullSet() || R.isSignWrappedSet()) in validateAndTransform()
265 if (NewR.isFullSet()) in mergeIn()
2255 if (RHS_CR.isFullSet()) in SimplifyICmpInst()
7456 if (Range.isFullSet()) // Infinite loop. in getNumIterationsInRange()