forked from OSchip/llvm-project
LiveInterval: Add a 'covers' operation to LiveRange.
llvm-svn: 223876
This commit is contained in:
parent
e01cf6e4c0
commit
e62c207092
|
@ -405,6 +405,12 @@ namespace llvm {
|
|||
/// scanning the Other range starting at I.
|
||||
bool overlapsFrom(const LiveRange &Other, const_iterator I) const;
|
||||
|
||||
/// Returns true if all segments of the @p Other live range are completely
|
||||
/// covered by this live range.
|
||||
/// Adjacent live ranges do not affect the covering:the liverange
|
||||
/// [1,5](5,10] covers (3,7].
|
||||
bool covers(const LiveRange &Other) const;
|
||||
|
||||
/// Add the specified Segment to this range, merging segments as
|
||||
/// appropriate. This returns an iterator to the inserted segment (which
|
||||
/// may have grown since it was inserted).
|
||||
|
|
|
@ -185,6 +185,27 @@ bool LiveRange::overlaps(SlotIndex Start, SlotIndex End) const {
|
|||
return I != begin() && (--I)->end > Start;
|
||||
}
|
||||
|
||||
bool LiveRange::covers(const LiveRange &Other) const {
|
||||
if (empty())
|
||||
return Other.empty();
|
||||
|
||||
const_iterator I = begin();
|
||||
for (const_iterator O = Other.begin(), OE = Other.end(); O != OE; ++O) {
|
||||
I = advanceTo(I, O->start);
|
||||
if (I == end() || I->start > O->start)
|
||||
return false;
|
||||
|
||||
// Check adjacent live segments and see if we can get behind O->end.
|
||||
while (I->end < O->end) {
|
||||
const_iterator Last = I;
|
||||
// Get next segment and abort if it was not adjacent.
|
||||
++I;
|
||||
if (I == end() || Last->end != I->start)
|
||||
return false;
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
/// ValNo is dead, remove it. If it is the largest value number, just nuke it
|
||||
/// (and any other deleted values neighboring it), otherwise mark it as ~1U so
|
||||
|
|
Loading…
Reference in New Issue