Home
last modified time | relevance | path

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

12

/freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/DWARF/
H A DDWARFAddressRange.h43 bool intersects(const DWARFAddressRange &RHS) const { in intersects() function
64 if (!intersects(RHS)) in merge()
H A DDWARFVerifier.h90 bool intersects(const DieRangeInfo &RHS) const;
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSparseBitVector.h185 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 DAddressRanges.h36 bool intersects(const AddressRange &R) const { in intersects() function
H A DAPInt.h1229 bool intersects(const APInt &RHS) const { in intersects() function
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DBDCE.cpp144 CanBeSimplified = !Demanded.intersects(*Mask); in bitTrackingDCE()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/
H A DDbgEntityHistoryCalculator.cpp114 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 DHexagonGenExtract.cpp201 if (M.intersects(C) || !M.isMask(W)) in INITIALIZE_PASS_DEPENDENCY()
H A DHexagonGenInsert.cpp159 bool intersects(const RegisterSet &Rs) const { in intersects() function
H A DHexagonBitSimplify.cpp165 bool intersects(const RegisterSet &Rs) const { in intersects() function
3261 if (!Defs.intersects(Inputs)) in processLoop()
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DKnownBits.cpp491 if (LHS.One.intersects(RHS.Zero) || RHS.One.intersects(LHS.Zero)) in eq()
1071 if (LHS.isNegative() && LowBits.intersects(LHS.One)) in srem()
/freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/PDB/Native/
H A DHashTable.h137 if (Present.intersects(Deleted)) in load()
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DKnownBits.h47 bool hasConflict() const { return Zero.intersects(One); } in hasConflict()
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/
H A DDWARFVerifier.cpp79 if (Iter->intersects(RI)) in insert()
111 bool DWARFVerifier::DieRangeInfo::intersects(const DieRangeInfo &RHS) const { in intersects() function in DWARFVerifier::DieRangeInfo
115 if (I1->intersects(*I2)) in intersects()
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/GSYM/
H A DGsymCreator.cpp241 if (ranges_equal || Prev.Range.intersects(Curr.Range)) { in finalize()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h652 static bool intersects(IntervalTy A, IntervalTy B);
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineScheduler.cpp4482 if (!intersects(NewInterval, Interval)) in getFirstAvailableAt()
4509 return !intersects(A, Interval); in add()
4522 bool ResourceSegments::intersects(ResourceSegments::IntervalTy A, in intersects() function in ResourceSegments
/freebsd/contrib/llvm-project/lldb/source/Target/
H A DProcess.cpp2332 const bool intersects = bp->IntersectsRange( in WriteMemory() local
2334 UNUSED_IF_ASSERT_DISABLED(intersects); in WriteMemory()
2335 assert(intersects); in WriteMemory()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineSimplifyDemanded.cpp888 if (LHSKnown.isNegative() && LowBits.intersects(LHSKnown.One)) in SimplifyDemandedUseBits()
H A DInstCombineAndOrXor.cpp890 if (!UnsetBitsMask.intersects(SignBitsMask)) in foldSignedTruncationCheck()
H A DInstCombineCompares.cpp1942 !TC->isZero() && !FC->isZero() && !TC->intersects(*FC)) { in foldICmpAndConstant()
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DValueTracking.cpp2630 if (XKnown.One.intersects(Mask)) in isNonZeroAdd()
2634 if (YKnown.One.intersects(Mask)) in isNonZeroAdd()
3643 if (Known1.Zero.intersects(Known2.One) || in isKnownNonEqual()
3644 Known2.Zero.intersects(Known1.One)) in isKnownNonEqual()
H A DInstructionSimplify.cpp2202 if (EffBitsY.isSubsetOf(*Mask) && !EffBitsX.intersects(*Mask)) in simplifyAndInst()
2204 if (EffBitsX.isSubsetOf(*Mask) && !EffBitsY.intersects(*Mask)) in simplifyAndInst()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DTargetLowering.cpp1748 if (!DemandedBits.intersects(APInt::getLowBitsSet(BitWidth, ShAmt))) { in SimplifyDemandedBits()
1944 if (!DemandedBits.intersects(APInt::getHighBitsSet(BitWidth, ShAmt))) { in SimplifyDemandedBits()
4722 if (C1.intersects(APInt::getHighBitsSet(C1.getBitWidth(), in SimplifySetCC()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSimplifyCFG.cpp5672 if (Known.Zero.intersects(CaseVal) || !Known.One.isSubsetOf(CaseVal) || in eliminateDeadSwitchCases()

12