| /freebsd-13.1/contrib/llvm-project/llvm/lib/IR/ |
| H A D | ConstantRange.cpp | 282 ConstantRange ShAmt = Other.intersectWith( in makeGuaranteedNoWrapRegion()
445 return intersectWith(CR.inverse()); in difference()
478 return CR.intersectWith(*this, Type); in intersectWith()
946 Result = Result.intersectWith(sadd_sat(Other), RangeType); in addWithNoWrap()
949 Result = Result.intersectWith(uadd_sat(Other), RangeType); in addWithNoWrap()
993 Result = Result.intersectWith(ssub_sat(Other), RangeType); in subWithNoWrap()
998 Result = Result.intersectWith(usub_sat(Other), RangeType); in subWithNoWrap()
1143 ConstantRange PosL = intersectWith(PosFilter); in sdiv()
1144 ConstantRange NegL = intersectWith(NegFilter); in sdiv()
1145 ConstantRange PosR = RHS.intersectWith(PosFilter); in sdiv()
[all …]
|
| H A D | Metadata.cpp | 989 return !A.intersectWith(B).isEmptySet() || isContiguous(A, B); in canBeMerged()
|
| H A D | Verifier.cpp | 3664 Assert(CurRange.intersectWith(LastRange).isEmptySet(), in visitRangeMetadata()
3679 Assert(FirstRange.intersectWith(LastRange).isEmptySet(), in visitRangeMetadata()
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | ConstantRange.h | 297 ConstantRange intersectWith(const ConstantRange &CR,
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | SparseBitVector.h | 194 bool intersectWith(const SparseBitVectorElement &RHS, in intersectWith() function
610 changed |= Iter1->intersectWith(*Iter2, BecameZero);
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | RDFRegisters.h | 194 RegisterRef intersectWith(RegisterRef RR) const;
|
| H A D | SelectionDAGNodes.h | 438 void intersectWith(const SDNodeFlags Flags) {
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | RDFRegisters.cpp | 310 RegisterRef RegisterAggr::intersectWith(RegisterRef RR) const { in intersectWith() function in RegisterAggr
|
| H A D | RDFLiveness.cpp | 704 R = PRI.mapTo(DRs.intersectWith(R), T.first); in computePhiInfo()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | ScalarEvolution.cpp | 6031 ConservativeResult.intersectWith(X, RangeType)); in getRangeRef()
6039 ConservativeResult.intersectWith(X, RangeType)); in getRangeRef()
6047 ConservativeResult.intersectWith(X, RangeType)); in getRangeRef()
6055 ConservativeResult.intersectWith(X, RangeType)); in getRangeRef()
6113 ConservativeResult = ConservativeResult.intersectWith( in getRangeRef()
6132 ConservativeResult = ConservativeResult.intersectWith( in getRangeRef()
6137 ConservativeResult = ConservativeResult.intersectWith( in getRangeRef()
6192 ConservativeResult = ConservativeResult.intersectWith(CR); in getRangeRef()
6221 ConservativeResult = ConservativeResult.intersectWith( in getRangeRef()
6225 ConservativeResult = ConservativeResult.intersectWith( in getRangeRef()
[all …]
|
| H A D | Loads.cpp | 468 return LoadRange.intersectWith(StoreRange).isEmptySet(); in areNonOverlapSameBaseLoadAndStore()
|
| H A D | ValueTracking.cpp | 4698 return CR1.intersectWith(CR2, RangeType); in computeConstantRangeIncludingKnownBits()
6496 ConstantRange Intersection = DomCR.intersectWith(CR); in isImpliedCondMatchingImmOperands()
7027 CR = CR.intersectWith(getConstantRangeFromMetadata(*Range)); in computeConstantRange()
7049 CR = CR.intersectWith( in computeConstantRange()
|
| H A D | LazyValueInfo.cpp | 125 A.getConstantRange().intersectWith(B.getConstantRange()); in intersect()
|
| H A D | InstructionSimplify.cpp | 1635 if (IsAnd && Range0.intersectWith(Range1).isEmptySet()) in simplifyAndOrOfICmpsWithConstants()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | LowerSwitch.cpp | 404 ConstantRange ValRange = KnownBitsRange.intersectWith(LVIRange); in ProcessSwitchInst()
|
| H A D | SCCPSolver.cpp | 1304 auto NewCR = ImposedCR.intersectWith(CopyOfCR); in handleCallResult()
|
| H A D | SimplifyIndVar.cpp | 1013 It->second = R.intersectWith(It->second); in updatePostIncRangeInfo()
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/ |
| H A D | Attributor.h | 2463 Assumed = Assumed.unionWith(R).intersectWith(Known);
2483 Assumed = Assumed.intersectWith(R);
2484 Known = Known.intersectWith(R);
4130 void intersectWith(const PotentialValuesState &R) {
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | GuardWidening.cpp | 527 auto SupersetIntersect = CR0.intersectWith(CR1); in widenCondCommon()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | AttributorAttributes.cpp | 8061 return getKnown().intersectWith(SCEVR).intersectWith(LVIR); in getKnownConstantRange()
8078 return getAssumed().intersectWith(SCEVR).intersectWith(LVIR); in getAssumedConstantRange()
8387 if (AllowedRegion.intersectWith(LHSAARange).isEmptySet()) in calculateCmpInst()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineCompares.cpp | 1509 ConstantRange Intersection = DominatingCR.intersectWith(CR); in foldICmpWithDominatingICmp()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | SelectionDAG.cpp | 9884 this->Flags.intersectWith(Flags); in intersectFlagsWith()
|