Searched refs:overlaps (Results 1 - 25 of 25) sorted by relevance

/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonBlockRanges.cpp34 bool HexagonBlockRanges::IndexRange::overlaps(const IndexRange &A) const { function in class:HexagonBlockRanges::IndexRange
60 assert(end() == A.start() || overlaps(A));
95 if (Merge || Iter->overlaps(*Next)) {
109 if (!A.overlaps(B)) {
147 if (Rg.overlaps(Range)) {
H A DHexagonBlockRanges.h91 bool overlaps(const IndexRange &A) const;
H A DHexagonExpandCondsets.cpp1142 bool Overlap = L1.overlaps(L2);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyRegColoring.cpp148 if (!OtherLI->empty() && OtherLI->overlaps(*LI))
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DScheduleDAG.h129 bool overlaps(const SDep &Other) const;
132 return overlaps(Other) && Latency == Other.Latency;
465 inline bool SDep::overlaps(const SDep &Other) const { function in class:llvm::SUnit::SDep
H A DLiveInterval.h437 /// overlaps - Return true if the intersection of the two live ranges is
439 bool overlaps(const LiveRange &other) const {
445 /// overlaps - Return true if the two ranges have overlapping segments
450 bool overlaps(const LiveRange &Other, const CoalescerPair &CP,
453 /// overlaps - Return true if the live range overlaps an interval specified
455 bool overlaps(SlotIndex Start, SlotIndex End) const;
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64PBQPRegAlloc.cpp188 bool livesOverlap = ld.overlaps(la);
269 if (ld.overlaps(lr)) {
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DLiveRegMatrix.cpp173 return Range.overlaps(UnitRange, CP, *LIS->getSlotIndexes());
H A DStackSlotColoring.cpp255 /// OverlapWithAssignments - Return true if LiveInterval overlaps with any
262 if (OtherLI->overlaps(*li))
H A DScheduleDAG.cpp114 if (PredDep.overlaps(D)) {
H A DLiveInterval.cpp386 // overlaps - Return true if the intersection of the two live ranges is
389 // An example for overlaps():
401 // A->overlaps(C) should return false since we want to be able to join
445 bool LiveRange::overlaps(const LiveRange &Other, const CoalescerPair &CP, function in class:LiveRange
473 // Advance the iterator that ends first to check for more overlaps.
486 /// overlaps - Return true if the live range overlaps an interval specified
488 bool LiveRange::overlaps(SlotIndex Start, SlotIndex End) const { function in class:LiveRange
H A DRegisterCoalescer.cpp878 // If ALR and BLR overlaps and end of BLR extends beyond end of ALR, e.g.
1080 if (IntB.overlaps(LIS->getMBBStartIdx(&MBB), CopyIdx))
1144 if (IntB.overlaps(InsPosIdx, LIS->getMBBEndIdx(CopyLeftBB)))
2037 if (RHS.overlaps(LIS->getRegUnit(*UI))) {
2044 // We must also check for overlaps with regmask clobbers.
2154 // and can be merged into the value it overlaps. Like a coalescable copy, it
2172 // The live range of %src overlaps the %dst value defined by FOO, but
2279 /// Value in the other live range that overlaps this def, if any.
2592 // Find the value in Other that overlaps VNI->def, if any.
3739 if (LIS->getInterval(OtherReg).overlaps(DstL
[all...]
H A DRegAllocPBQP.cpp363 // At this point we know that Cur overlaps all active intervals. Add the
606 // Record any overlaps with regmask operands.
622 // vregLI overlaps fixed regunit interference.
625 if (VRegLI.overlaps(LIS.getRegUnit(*Units))) {
H A DRegAllocGreedy.cpp983 if (!Intf->overlaps(Start, End))
2175 // Interference that overlaps an instruction is counted in both gaps
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/MCA/
H A DInstruction.h302 bool overlaps(const CycleSegment &CS) const { function in class:llvm::mca::CycleSegment
/freebsd-11-stable/contrib/llvm-project/lld/lib/ReaderWriter/MachO/
H A DMachONormalizedFileBinaryWriter.cpp467 static bool overlaps(const Segment &s1, const Segment &s2) { function in namespace:lld::mach_o::normalized
475 static bool overlaps(const Section &s1, const Section &s2) { function in namespace:lld::mach_o::normalized
489 if (overlaps(sg1,sg2)) {
501 if (overlaps(s1,s2)) {
/freebsd-11-stable/contrib/gcc/
H A Dtree-ssa-alias.c2810 VEC (tree, heap) *overlaps = NULL;
2818 VEC_safe_push (tree, heap, overlaps, sv->var);
2820 len = VEC_length (tree, overlaps);
2826 ali = add_may_alias_for_new_tag (tag, VEC_index (tree, overlaps, 0));
2832 for (k = 0; VEC_iterate (tree, overlaps, k, sv_var); k++)
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/
H A DAttributes.h754 bool overlaps(const AttrBuilder &B) const;
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DDeadArgumentElimination.cpp844 assert(!RAttrs.overlaps(AttributeFuncs::typeIncompatible(NRetTy)) &&
/freebsd-11-stable/contrib/groff/src/roff/troff/
H A Dnode.cpp4624 int overlaps = n->overlaps_vertically(); local
4639 if (overlaps) {
4662 if (overlaps)
/freebsd-11-stable/contrib/llvm-project/llvm/lib/IR/
H A DAttributes.cpp1638 bool AttrBuilder::overlaps(const AttrBuilder &B) const { function in class:AttrBuilder
H A DVerifier.cpp1658 Assert(!AttrBuilder(Attrs).overlaps(IncompatibleAttrs),
/freebsd-11-stable/contrib/llvm-project/lldb/source/Plugins/ObjectFile/ELF/
H A DObjectFileELF.cpp1712 if (Segments.overlaps(H.p_vaddr, H.p_vaddr + H.p_memsz)) {
1738 Sections.overlaps(Range.GetRangeBase(), Range.GetRangeEnd())) {
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A DIntervalMap.h1137 /// overlaps(a, b) - Return true if the intervals in this map overlap with the
1139 bool overlaps(KeyT a, KeyT b) {
1556 /// checking for coalescing or overlaps.
1562 /// for coalescing or overlaps.
2045 /// IntervalMapOverlaps - Iterate over the overlaps of mapped intervals in two
2054 /// 2. Enumerate overlaps:
2099 /// IntervalMapOverlaps - Create an iterator for the overlaps of a and b.
2143 // Bump the iterator that ends first. The other one may have more overlaps.
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineCalls.cpp4588 if (RAttrs.overlaps(AttributeFuncs::typeIncompatible(NewRetTy)))
4633 .overlaps(AttributeFuncs::typeIncompatible(ParamTy)))

Completed in 634 milliseconds