| /llvm-project-15.0.7/llvm/unittests/Support/ |
| H A D | AddressRangeTest.cpp | 70 EXPECT_FALSE(Range.intersects(EndsBeforeRangeStart)); in TEST()
71 EXPECT_FALSE(Range.intersects(EndsAtRangeStart)); in TEST()
72 EXPECT_TRUE(Range.intersects(OverlapsRangeStart)); in TEST()
73 EXPECT_TRUE(Range.intersects(InsideRange)); in TEST()
74 EXPECT_TRUE(Range.intersects(OverlapsRangeEnd)); in TEST()
75 EXPECT_FALSE(Range.intersects(StartsAtRangeEnd)); in TEST()
76 EXPECT_FALSE(Range.intersects(StartsAfterRangeEnd)); in TEST()
|
| H A D | KnownBitsTest.cpp | 502 HasCommonBitsSet |= N1.intersects(N2); in TEST()
|
| /llvm-project-15.0.7/llvm/include/llvm/DebugInfo/DWARF/ |
| H A D | DWARFAddressRange.h | 43 bool intersects(const DWARFAddressRange &RHS) const { in intersects() function
64 if (!intersects(RHS)) in merge()
|
| H A D | DWARFVerifier.h | 77 bool intersects(const DieRangeInfo &RHS) const;
|
| /llvm-project-15.0.7/llvm/include/llvm/ADT/ |
| H A D | SparseBitVector.h | 185 bool intersects(const SparseBitVectorElement &RHS) const { in intersects() function
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 | 32 bool intersects(const AddressRange &R) const { in intersects() function
|
| H A D | APInt.h | 1199 bool intersects(const APInt &RHS) const { in intersects() function
|
| /llvm-project-15.0.7/llvm/lib/Support/ |
| H A D | KnownBits.cpp | 336 if (LHS.One.intersects(RHS.Zero) || RHS.One.intersects(LHS.Zero)) in eq()
588 if (LHS.isNegative() && LowBits.intersects(LHS.One)) in srem()
|
| /llvm-project-15.0.7/llvm/unittests/DebugInfo/DWARF/ |
| H A D | DWARFDebugInfoTest.cpp | 2001 ASSERT_TRUE(LHS.intersects(RHS));
2002 ASSERT_TRUE(RHS.intersects(LHS));
2006 ASSERT_FALSE(LHS.intersects(RHS));
2007 ASSERT_FALSE(RHS.intersects(LHS));
2013 ASSERT_TRUE(LHS.intersects(RHS));
2014 ASSERT_TRUE(RHS.intersects(LHS));
2020 ASSERT_FALSE(LHS.intersects(RHS));
2021 ASSERT_FALSE(RHS.intersects(LHS));
|
| /llvm-project-15.0.7/mlir/lib/Dialect/Affine/Transforms/ |
| H A D | SuperVectorize.cpp | 1621 bool intersects = false; in computeIntersectionBuckets() local
1627 intersects = true; in computeIntersectionBuckets()
1635 intersects = true; in computeIntersectionBuckets()
1642 if (!intersects) { in computeIntersectionBuckets()
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/AsmPrinter/ |
| H A D | DbgEntityHistoryCalculator.cpp | 114 intersects(const MachineInstr *StartMI, const MachineInstr *EndMI, in intersects() function
203 if (auto R = intersects(StartMI, EndMI, ScopeRanges, Ordering)) { in trimLocationRanges()
|
| /llvm-project-15.0.7/llvm/lib/Target/Hexagon/ |
| H A D | HexagonGenExtract.cpp | 201 if (M.intersects(C) || !M.isMask(W)) in INITIALIZE_PASS_DEPENDENCY()
|
| H A D | HexagonGenInsert.cpp | 159 bool intersects(const RegisterSet &Rs) const { in intersects() function
|
| H A D | HexagonBitSimplify.cpp | 165 bool intersects(const RegisterSet &Rs) const { in intersects() function
3261 if (!Defs.intersects(Inputs)) in processLoop()
|
| /llvm-project-15.0.7/llvm/include/llvm/Support/ |
| H A D | KnownBits.h | 47 bool hasConflict() const { return Zero.intersects(One); } in hasConflict()
|
| /llvm-project-15.0.7/llvm/include/llvm/DebugInfo/PDB/Native/ |
| H A D | HashTable.h | 137 if (Present.intersects(Deleted)) in load()
|
| /llvm-project-15.0.7/llvm/lib/DebugInfo/GSYM/ |
| H A D | GsymCreator.cpp | 231 if (ranges_equal || Prev.Range.intersects(Curr.Range)) { in finalize()
|
| /llvm-project-15.0.7/llvm/lib/DebugInfo/DWARF/ |
| H A D | DWARFVerifier.cpp | 76 if (Iter->intersects(RI)) in insert()
108 bool DWARFVerifier::DieRangeInfo::intersects(const DieRangeInfo &RHS) const { in intersects() function in DWARFVerifier::DieRangeInfo
112 if (I1->intersects(*I2)) in intersects()
|
| /llvm-project-15.0.7/llvm/test/TableGen/ |
| H A D | SetTheory.td | 62 // The 'and' operator intersects two sets. The result has the same order as the
|
| /llvm-project-15.0.7/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineSimplifyDemanded.cpp | 733 !DemandedMask.intersects(HighBits)) { in SimplifyDemandedUseBits()
797 if (LHSKnown.isNegative() && LowBits.intersects(LHSKnown.One)) in SimplifyDemandedUseBits()
|
| /llvm-project-15.0.7/llvm/test/Transforms/InstCombine/ |
| H A D | add2.ll | 325 ; llvm.cttz, ValueTracking correctly intersects the range specified by the
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | ValueTracking.cpp | 983 if (Known.Zero.intersects(Known.One)) { in computeKnownBitsFromAssume()
2635 if (XKnown.One.intersects(Mask)) in isKnownNonZero()
2639 if (YKnown.One.intersects(Mask)) in isKnownNonZero()
2947 if (Known1.Zero.intersects(Known2.One) || in isKnownNonEqual()
2948 Known2.Zero.intersects(Known1.One)) in isKnownNonEqual()
|
| H A D | InstructionSimplify.cpp | 2206 if (EffBitsY.isSubsetOf(*Mask) && !EffBitsX.intersects(*Mask)) in simplifyAndInst()
2208 if (EffBitsX.isSubsetOf(*Mask) && !EffBitsY.intersects(*Mask)) in simplifyAndInst()
|
| /llvm-project-15.0.7/lldb/source/Target/ |
| H A D | Process.cpp | 2161 const bool intersects = bp->IntersectsRange( in WriteMemory() local
2163 UNUSED_IF_ASSERT_DISABLED(intersects); in WriteMemory()
2164 assert(intersects); in WriteMemory()
|
| /llvm-project-15.0.7/lldb/tools/debugserver/source/MacOSX/ |
| H A D | MachProcess.mm | 1724 const bool intersects = bp->IntersectsRange(
1726 UNUSED_IF_ASSERT_DISABLED(intersects);
1727 assert(intersects);
|