RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-19 11:02:59 +02:00
Code Issues Projects Releases Wiki Activity

Fix NASTY N^2 behavior that was causing the gzip benchmark to take forever to

Browse Source 
assemble.  Now we scan the use-list from the back when removing users instead
of from the front.

llvm-svn: 4086
This commit is contained in:
Chris Lattner 2002-10-08 23:46:55 +00:00
parent 4a72e094f9
commit 88de60dd26
1 changed files with 11 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
lib/VMCore/Value.cpp
View File

@ -77,12 +77,18 @@ void Value::refineAbstractType(const DerivedType *OldTy, const Type *NewTy) {
Ty = NewTy;
}
void Value::killUse(User *i) {
if (i == 0) return;
use_iterator I = find(Uses.begin(), Uses.end(), i);
void Value::killUse(User *U) {
if (U == 0) return;
unsigned i;
assert(I != Uses.end() && "Use not in uses list!!");
Uses.erase(I);
// Scan backwards through the uses list looking for the user. We do this
// because vectors like to be accessed on the end. This is incredibly
// important from a performance perspective.
for (i = Uses.size()-1; Uses[i] != U; --i)
/* empty */;
assert(i < Uses.size() && "Use not in uses list!!");
Uses.erase(Uses.begin()+i);
}
User *Value::use_remove(use_iterator &I) {