mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-08-21 18:29:46 +00:00
If we're only adding one new element to 'Cache', insert it into its known
position instead of using a full sort. This speeds up GVN by ~4% with the new memdep stuff. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@60746 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
511b36c00f
commit
1aeadacdad
@ -621,8 +621,19 @@ getNonLocalPointerDepInternal(Value *Pointer, uint64_t PointeeSize,
|
||||
}
|
||||
|
||||
// If we computed new values, re-sort Cache.
|
||||
if (NumSortedEntries != Cache->size())
|
||||
if (NumSortedEntries == Cache->size()) {
|
||||
// done, no new entries.
|
||||
} else if (NumSortedEntries+1 == Cache->size()) {
|
||||
// One new entry, Just insert the new value at the appropriate position.
|
||||
NonLocalDepEntry Val = Cache->back();
|
||||
Cache->pop_back();
|
||||
NonLocalDepInfo::iterator Entry =
|
||||
std::upper_bound(Cache->begin(), Cache->end(), Val);
|
||||
Cache->insert(Entry, Val);
|
||||
} else {
|
||||
// Added many values, do a full scale sort.
|
||||
std::sort(Cache->begin(), Cache->end());
|
||||
}
|
||||
}
|
||||
|
||||
/// RemoveCachedNonLocalPointerDependencies - If P exists in
|
||||
|
Loading…
Reference in New Issue
Block a user