HomeSort by: relevance | last modified time | path
    Searched defs:overlaps (Results 1 - 11 of 11) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
StackLifetime.h 73 bool overlaps(const LiveRange &Other) const { function in class:llvm::StackLifetime::LiveRange
152 /// that is large enough for LiveRange::Overlaps to be correct.
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
LiveInterval.cpp 386 // 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
  /src/external/gpl3/gdb/dist/gdb/
prologue-value.c 401 pv_area::overlaps (struct area_entry *entry, CORE_ADDR offset, CORE_ADDR size)
423 while (e && overlaps (e, offset, size))
397 pv_area::overlaps (struct area_entry *entry, CORE_ADDR offset, CORE_ADDR size) function in class:pv_area
  /src/external/gpl3/gdb.old/dist/gdb/
prologue-value.c 401 pv_area::overlaps (struct area_entry *entry, CORE_ADDR offset, CORE_ADDR size)
423 while (e && overlaps (e, offset, size))
397 pv_area::overlaps (struct area_entry *entry, CORE_ADDR offset, CORE_ADDR size) function in class:pv_area
  /src/sys/external/bsd/drm2/dist/drm/i915/
i915_buddy.c 329 static inline bool overlaps(u64 s1, u64 e1, u64 s2, u64 e2) function
390 if (!overlaps(start, end, block_start, block_end))
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonBlockRanges.cpp 34 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)) {
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
ScheduleDAG.h 129 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
  /src/external/apache2/llvm/dist/llvm/include/llvm/MCA/
Instruction.h 302 bool overlaps(const CycleSegment &CS) const { function in class:llvm::mca::CycleSegment
  /src/external/apache2/llvm/dist/llvm/lib/IR/
Attributes.cpp 787 if (!B.overlaps(Attrs))
2032 bool AttrBuilder::overlaps(const AttrBuilder &B) const { function in class:AttrBuilder
  /src/external/mit/isl/dist/
isl_transitive_closure.c 875 isl_bool overlaps; local
882 overlaps = isl_set_overlaps(domain, range);
883 if (overlaps < 0 || !overlaps) {
888 if (overlaps < 0)
1050 isl_bool overlaps, subset; local
1061 overlaps = isl_set_overlaps(ran[i], dom[j]);
1062 if (overlaps < 0)
1064 if (!overlaps)
1084 overlaps = isl_set_overlaps(dom[i], ran[j])
    [all...]
  /src/external/gpl2/groff/dist/src/roff/troff/
node.cpp 4627 int overlaps = n->overlaps_vertically(); local
4642 if (overlaps) {
4665 if (overlaps)

Completed in 38 milliseconds