| /freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/DWARF/ |
| H A D | DWARFAddressRange.h | 44 bool intersects(const DWARFAddressRange &RHS) const { in intersects() function
65 if (!intersects(RHS)) in merge()
|
| H A D | DWARFVerifier.h | 115 LLVM_ABI bool intersects(const DieRangeInfo &RHS) const;
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | SparseBitVector.h | 185 bool intersects(const SparseBitVectorElement &RHS) const { in intersects() function
238 // Three argument version of intersectWithComplement that intersects
739 bool intersects(const SparseBitVector<ElementSize> *RHS) const { in intersects() function
740 return intersects(*RHS); in intersects()
744 bool intersects(const SparseBitVector<ElementSize> &RHS) const { in intersects() function
760 if (Iter1->intersects(*Iter2)) in intersects()
|
| H A D | AddressRanges.h | 36 bool intersects(const AddressRange &R) const { in intersects() function
|
| H A D | APInt.h | 1249 bool intersects(const APInt &RHS) const { in intersects() function
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | BDCE.cpp | 144 CanBeSimplified = !Demanded.intersects(*Mask); in bitTrackingDCE()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/ |
| H A D | DbgEntityHistoryCalculator.cpp | 114 intersects(const MachineInstr *StartMI, const MachineInstr *EndMI, in intersects() function
206 if (auto R = intersects(StartMI, EndMI, ScopeRanges, Ordering)) { in trimLocationRanges()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonGenExtract.cpp | 190 if (M.intersects(C) || !M.isMask(W)) in INITIALIZE_PASS_DEPENDENCY()
|
| H A D | HexagonGenInsert.cpp | 160 bool intersects(const RegisterSet &Rs) const { in intersects() function
|
| H A D | HexagonBitSimplify.cpp | 143 bool intersects(const RegisterSet &Rs) const { in intersects() function
3230 if (!Defs.intersects(Inputs)) in processLoop()
|
| /freebsd/contrib/llvm-project/llvm/lib/Support/ |
| H A D | KnownBits.cpp | 491 if (LHS.One.intersects(RHS.Zero) || RHS.One.intersects(LHS.Zero)) in eq()
1078 if (LHS.isNegative() && LowBits.intersects(LHS.One)) in srem()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/PDB/Native/ |
| H A D | HashTable.h | 140 if (Present.intersects(Deleted)) in load()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | KnownBits.h | 51 bool hasConflict() const { return Zero.intersects(One); } in hasConflict()
|
| /freebsd/contrib/llvm-project/llvm/lib/DebugInfo/GSYM/ |
| H A D | GsymCreator.cpp | 291 if (ranges_equal || Prev.Range.intersects(Curr.Range)) { in finalize()
|
| /freebsd/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/ |
| H A D | DWARFVerifier.cpp | 86 if (Iter->intersects(RI)) in insert()
118 bool DWARFVerifier::DieRangeInfo::intersects(const DieRangeInfo &RHS) const { in intersects() function in DWARFVerifier::DieRangeInfo
122 if (I1->intersects(*I2)) { in intersects()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | MachineScheduler.h | 660 LLVM_ABI static bool intersects(IntervalTy A, IntervalTy B);
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | MachineScheduler.cpp | 4929 if (!intersects(NewInterval, Interval)) in getFirstAvailableAt()
4956 return !intersects(A, Interval); in add()
4969 bool ResourceSegments::intersects(ResourceSegments::IntervalTy A, in intersects() function in ResourceSegments
|
| /freebsd/contrib/llvm-project/lldb/source/Target/ |
| H A D | Process.cpp | 2323 const bool intersects = bp->IntersectsRange( in WriteMemory() local
2325 UNUSED_IF_ASSERT_DISABLED(intersects); in WriteMemory()
2326 assert(intersects); in WriteMemory()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineAndOrXor.cpp | 384 if (!BCst->intersects(*DCst)) { in foldLogOpOfMaskedICmps_NotAllZeros_BMask_Mixed()
915 if (!UnsetBitsMask.intersects(SignBitsMask)) in foldSignedTruncationCheck()
3607 return X == Other.X && !Mask.intersects(Other.Mask) && in isCombineableWith()
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | ValueTracking.cpp | 2856 if (XKnown.One.intersects(Mask)) in isNonZeroAdd()
2860 if (YKnown.One.intersects(Mask)) in isNonZeroAdd()
3930 if (Known1.Zero.intersects(Known2.One) || in isKnownNonEqual()
3931 Known2.Zero.intersects(Known1.One)) in isKnownNonEqual()
|
| H A D | InstructionSimplify.cpp | 2156 if (EffBitsY.isSubsetOf(*Mask) && !EffBitsX.intersects(*Mask)) in simplifyAndInst()
2158 if (EffBitsX.isSubsetOf(*Mask) && !EffBitsY.intersects(*Mask)) in simplifyAndInst()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | TargetLowering.cpp | 1795 if (!DemandedBits.intersects(APInt::getLowBitsSet(BitWidth, ShAmt))) { in SimplifyDemandedBits()
1981 if (!DemandedBits.intersects(APInt::getHighBitsSet(BitWidth, ShAmt))) { in SimplifyDemandedBits()
2001 if (!DemandedBits.intersects(APInt::getHighBitsSet(BitWidth, ShAmt))) { in SimplifyDemandedBits()
2991 if (!DemandedBits.intersects(SignMask)) in SimplifyDemandedBits()
3018 if (!DemandedBits.intersects(SignMask0)) in SimplifyDemandedBits()
3044 if (!DemandedBits.intersects(SignMask)) in SimplifyDemandedBits()
4936 if (C1.intersects(APInt::getHighBitsSet(C1.getBitWidth(), in SimplifySetCC()
|
| H A D | LegalizeIntegerTypes.cpp | 3283 if (Known.One.intersects(HighBitMask)) { in ExpandShiftWithKnownAmountBit()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | SimplifyCFG.cpp | 5822 if (Known.Zero.intersects(CaseVal) || !Known.One.isSubsetOf(CaseVal) || in eliminateDeadSwitchCases()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/X86/ |
| H A D | X86ISelLowering.cpp | 41900 DemandedLHS0.intersects(DemandedLHS1)) in combineBlendOfPermutes()
43667 if (!DemandedElts.intersects(APInt::getLowBitsSet(NumElts, ShiftAmt))) { in SimplifyDemandedVectorEltsForTargetNode()
43706 if (!DemandedElts.intersects(APInt::getHighBitsSet(NumElts, ShiftAmt))) { in SimplifyDemandedVectorEltsForTargetNode()
|