Home
last modified time | relevance | path

Searched refs:intersects (Results 1 – 24 of 24) sorted by relevance

/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/DebugInfo/DWARF/
H A DDWARFAddressRange.h40 bool intersects(const DWARFAddressRange &RHS) const { in intersects() function
59 if (!intersects(RHS)) in merge()
H A DDWARFVerifier.h87 bool intersects(const DieRangeInfo &RHS) const;
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSparseBitVector.h184 bool intersects(const SparseBitVectorElement &RHS) const { in intersects() function
738 bool intersects(const SparseBitVector<ElementSize> *RHS) const { in intersects() function
739 return intersects(*RHS); in intersects()
743 bool intersects(const SparseBitVector<ElementSize> &RHS) const { in intersects() function
759 if (Iter1->intersects(*Iter2)) in intersects()
H A DAPInt.h1341 bool intersects(const APInt &RHS) const {
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/DebugInfo/GSYM/
H A DRange.h40 bool intersects(const AddressRange &R) const { in intersects() function
/freebsd-13.1/contrib/llvm-project/llvm/lib/Support/
H A DKnownBits.cpp336 if (LHS.One.intersects(RHS.Zero) || RHS.One.intersects(LHS.Zero)) in eq()
570 if (LHS.isNegative() && LowBits.intersects(LHS.One)) in srem()
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/
H A DDbgEntityHistoryCalculator.cpp115 intersects(const MachineInstr *StartMI, const MachineInstr *EndMI, in intersects() function
204 if (auto R = intersects(StartMI, EndMI, ScopeRanges, Ordering)) { in trimLocationRanges()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonGenExtract.cpp201 if (M.intersects(C) || !M.isMask(W)) in INITIALIZE_PASS_DEPENDENCY()
H A DHexagonBitSimplify.cpp140 bool intersects(const RegisterSet &Rs) const { in intersects() function
3238 if (!Defs.intersects(Inputs)) in processLoop()
H A DHexagonGenInsert.cpp160 bool intersects(const RegisterSet &Rs) const { in intersects() function
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Support/
H A DKnownBits.h47 bool hasConflict() const { return Zero.intersects(One); } in hasConflict()
/freebsd-13.1/contrib/llvm-project/llvm/lib/DebugInfo/GSYM/
H A DGsymCreator.cpp231 if (ranges_equal || Prev.Range.intersects(Curr.Range)) { in finalize()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/DebugInfo/PDB/Native/
H A DHashTable.h141 if (Present.intersects(Deleted)) in load()
/freebsd-13.1/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/
H A DDWARFVerifier.cpp56 if (Iter->intersects(RI)) in insert()
88 bool DWARFVerifier::DieRangeInfo::intersects(const DieRangeInfo &RHS) const { in intersects() function in DWARFVerifier::DieRangeInfo
92 if (I1->intersects(*I2)) in intersects()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineSimplifyDemanded.cpp662 !DemandedMask.intersects(HighBits)) { in SimplifyDemandedUseBits()
726 if (LHSKnown.isNegative() && LowBits.intersects(LHSKnown.One)) in SimplifyDemandedUseBits()
H A DInstCombineAndOrXor.cpp944 if (!UnsetBitsMask.intersects(SignBitsMask)) in foldSignedTruncationCheck()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/
H A DValueTracking.cpp938 if (Known.Zero.intersects(Known.One)) { in computeKnownBitsFromAssume()
2481 if (XKnown.One.intersects(Mask)) in isKnownNonZero()
2485 if (YKnown.One.intersects(Mask)) in isKnownNonZero()
2791 if (Known1.Zero.intersects(Known2.One) || in isKnownNonEqual()
2792 Known2.Zero.intersects(Known1.One)) in isKnownNonEqual()
H A DInstructionSimplify.cpp2161 if (EffBitsY.isSubsetOf(*Mask) && !EffBitsX.intersects(*Mask)) in SimplifyAndInst()
2163 if (EffBitsX.isSubsetOf(*Mask) && !EffBitsY.intersects(*Mask)) in SimplifyAndInst()
/freebsd-13.1/contrib/llvm-project/lldb/source/Target/
H A DProcess.cpp2176 const bool intersects = bp->IntersectsRange( in WriteMemory() local
2178 UNUSED_IF_ASSERT_DISABLED(intersects); in WriteMemory()
2179 assert(intersects); in WriteMemory()
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DTargetLowering.cpp1448 if (!DemandedBits.intersects(APInt::getLowBitsSet(BitWidth, ShAmt))) { in SimplifyDemandedBits()
1556 if (!DemandedBits.intersects(APInt::getHighBitsSet(BitWidth, ShAmt))) { in SimplifyDemandedBits()
3731 if (C1.intersects(APInt::getHighBitsSet(C1.getBitWidth(), in SimplifySetCC()
H A DLegalizeIntegerTypes.cpp2400 if (Known.One.intersects(HighBitMask)) { in ExpandShiftWithKnownAmountBit()
H A DDAGCombiner.cpp6512 return !C1 || !C2 || C1->getAPIntValue().intersects(C2->getAPIntValue()); in visitOR()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSimplifyCFG.cpp4905 if (Known.Zero.intersects(CaseVal) || !Known.One.isSubsetOf(CaseVal) || in eliminateDeadSwitchCases()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86ISelLowering.cpp38733 if (!DemandedElts.intersects(APInt::getLowBitsSet(NumElts, ShiftAmt))) { in SimplifyDemandedVectorEltsForTargetNode()
38772 if (!DemandedElts.intersects(APInt::getHighBitsSet(NumElts, ShiftAmt))) { in SimplifyDemandedVectorEltsForTargetNode()