mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-20 03:23:01 +02:00
There is no need to check to see if j overflowed in this loop as we're only
incrementing i. llvm-svn: 17944
This commit is contained in:
parent
2c16205a0d
commit
60c90d623f
@ -82,7 +82,9 @@ bool LiveInterval::overlapsFrom(const LiveInterval& other,
|
||||
return true;
|
||||
}
|
||||
|
||||
while (i != ie && j != je) {
|
||||
if (j == je) return false;
|
||||
|
||||
while (i != ie) {
|
||||
if (i->start > j->start) {
|
||||
std::swap(i, j);
|
||||
std::swap(ie, je);
|
||||
|
Loading…
Reference in New Issue
Block a user