6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-01-21 19:32:16 +00:00
Code Issues Projects Releases Wiki Activity

if we have two elements, insert both, don't use std::sort.

Browse Source 
This speeds up the new GVN by another 3%


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@60747 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2008-12-09 07:05:45 +00:00
parent 1aeadacdad
commit ba4dacc875
1 changed files with 16 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
lib/Analysis/MemoryDependenceAnalysis.cpp
View File

@ -621,16 +621,29 @@ getNonLocalPointerDepInternal(Value *Pointer, uint64_t PointeeSize,
}
// If we computed new values, re-sort Cache.
if (NumSortedEntries == Cache->size()) {
switch (Cache->size()-NumSortedEntries) {
case 0:
// done, no new entries.
} else if (NumSortedEntries+1 == Cache->size()) {
break;
case 2: {
// Two new entries, insert the last one into place.
NonLocalDepEntry Val = Cache->back();
Cache->pop_back();
NonLocalDepInfo::iterator Entry =
std::upper_bound(Cache->begin(), Cache->end()-1, Val);
Cache->insert(Entry, Val);
// FALL THROUGH.
}
case 1: {
// 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 {
break;
}
default:
// Added many values, do a full scale sort.
std::sort(Cache->begin(), Cache->end());
}