forked from OSchip/llvm-project
Branch instructions don't produce values, so there's no need to generate a value number for them. This
avoids adding them to the various value numbering tables, resulting in a minor (~3%) speedup for GVN on 40.gcc. llvm-svn: 122819
This commit is contained in:
parent
35c7e84eb7
commit
41a1550ef5
|
@ -1670,14 +1670,9 @@ bool GVN::processInstruction(Instruction *I,
|
|||
return Changed;
|
||||
}
|
||||
|
||||
uint32_t NextNum = VN.getNextUnusedValueNumber();
|
||||
unsigned Num = VN.lookup_or_add(I);
|
||||
|
||||
// For conditions branches, we can perform simple conditional propagation on
|
||||
// the condition value itself.
|
||||
if (BranchInst *BI = dyn_cast<BranchInst>(I)) {
|
||||
insert_table(Num, I, I->getParent());
|
||||
|
||||
if (!BI->isConditional() || isa<Constant>(BI->getCondition()))
|
||||
return false;
|
||||
|
||||
|
@ -1699,6 +1694,9 @@ bool GVN::processInstruction(Instruction *I,
|
|||
return false;
|
||||
}
|
||||
|
||||
uint32_t NextNum = VN.getNextUnusedValueNumber();
|
||||
unsigned Num = VN.lookup_or_add(I);
|
||||
|
||||
// Allocations are always uniquely numbered, so we can save time and memory
|
||||
// by fast failing them.
|
||||
if (isa<AllocaInst>(I) || isa<TerminatorInst>(I) || isa<PHINode>(I)) {
|
||||
|
|
Loading…
Reference in New Issue