mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-24 19:52:54 +01:00
Eliminate a redundant check. This speeds up optimization of 253.perlbmk from 13.5 seconds to 10.9 seconds.
llvm-svn: 37683
This commit is contained in:
parent
b06cc18b7c
commit
a783224b25
@ -887,13 +887,9 @@ bool GVNPRE::buildsets_anticin(BasicBlock* BB,
|
||||
// However, for opaques, such as constants within PHI nodes, it is
|
||||
// possible that they have not yet received a number. Make sure they do
|
||||
// so now.
|
||||
uint32_t valNum = 0;
|
||||
if (isa<BinaryOperator>(*I) || isa<CmpInst>(*I))
|
||||
valNum = VN.lookup(*I);
|
||||
else
|
||||
valNum = VN.lookup_or_add(*I);
|
||||
if (find_leader(anticIn, valNum) == 0)
|
||||
val_insert(anticIn, *I);
|
||||
if (!isa<BinaryOperator>(*I) && !isa<CmpInst>(*I))
|
||||
VN.lookup_or_add(*I);
|
||||
val_insert(anticIn, *I);
|
||||
}
|
||||
|
||||
clean(anticIn);
|
||||
|
Loading…
Reference in New Issue
Block a user