Minor simplification/speedup. Replaces a set lookup with a pointer comparison.

This speeds up 176.gcc from 25.73s to 23.48s, which is 9.5%


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@19907 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2005-01-29 06:20:55 +00:00
parent e233b8c64b
commit e212d62a34

View File

@ -285,7 +285,6 @@ void LoadVN::getEqualNumberNodes(Value *V,
return getAnalysis<ValueNumbering>().getEqualNumberNodes(V, RetVals);
Value *PointerSource = LI->getOperand(0);
BasicBlock *LoadBB = LI->getParent();
Function *F = LoadBB->getParent();
@ -333,7 +332,7 @@ void LoadVN::getEqualNumberNodes(Value *V,
// If this instruction is a candidate load before LI, we know there are no
// invalidating instructions between it and LI, so they have the same value
// number.
if (isa<LoadInst>(I) && Instrs.count(I)) {
if (isa<LoadInst>(I) && cast<LoadInst>(I)->getOperand(0) == PointerSource) {
RetVals.push_back(I);
Instrs.erase(I);
} else if (AllocationInst *AI = dyn_cast<AllocationInst>(I)) {
@ -350,7 +349,7 @@ void LoadVN::getEqualNumberNodes(Value *V,
// If the invalidating instruction is a store, and its in our candidate
// set, then we can do store-load forwarding: the load has the same value
// # as the stored value.
if (isa<StoreInst>(I) && Instrs.count(I)) {
if (isa<StoreInst>(I) && I->getOperand(1) == PointerSource) {
Instrs.erase(I);
RetVals.push_back(I->getOperand(0));
}
@ -368,7 +367,7 @@ void LoadVN::getEqualNumberNodes(Value *V,
for (BasicBlock::iterator I = LI->getNext(); I != LoadBB->end(); ++I) {
// If this instruction is a load, then this instruction returns the same
// value as LI.
if (isa<LoadInst>(I) && Instrs.count(I)) {
if (isa<LoadInst>(I) && cast<LoadInst>(I)->getOperand(0) == PointerSource) {
RetVals.push_back(I);
Instrs.erase(I);
}