Reduce the workload by not adding chain users to work list.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@30948 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Jim Laskey
2006-10-13 23:32:28 +00:00
parent dc78cbf457
commit 274062c172

View File

@@ -85,7 +85,8 @@ namespace {
WorkList.push_back(N); WorkList.push_back(N);
} }
SDOperand CombineTo(SDNode *N, const SDOperand *To, unsigned NumTo) { SDOperand CombineTo(SDNode *N, const SDOperand *To, unsigned NumTo,
bool AddTo = true) {
assert(N->getNumValues() == NumTo && "Broken CombineTo call!"); assert(N->getNumValues() == NumTo && "Broken CombineTo call!");
++NodesCombined; ++NodesCombined;
DEBUG(std::cerr << "\nReplacing.1 "; N->dump(); DEBUG(std::cerr << "\nReplacing.1 "; N->dump();
@@ -94,10 +95,12 @@ namespace {
std::vector<SDNode*> NowDead; std::vector<SDNode*> NowDead;
DAG.ReplaceAllUsesWith(N, To, &NowDead); DAG.ReplaceAllUsesWith(N, To, &NowDead);
// Push the new nodes and any users onto the worklist if (AddTo) {
for (unsigned i = 0, e = NumTo; i != e; ++i) { // Push the new nodes and any users onto the worklist
AddToWorkList(To[i].Val); for (unsigned i = 0, e = NumTo; i != e; ++i) {
AddUsersToWorkList(To[i].Val); AddToWorkList(To[i].Val);
AddUsersToWorkList(To[i].Val);
}
} }
// Nodes can be reintroduced into the worklist. Make sure we do not // Nodes can be reintroduced into the worklist. Make sure we do not
@@ -111,13 +114,14 @@ namespace {
return SDOperand(N, 0); return SDOperand(N, 0);
} }
SDOperand CombineTo(SDNode *N, SDOperand Res) { SDOperand CombineTo(SDNode *N, SDOperand Res, bool AddTo = true) {
return CombineTo(N, &Res, 1); return CombineTo(N, &Res, 1, AddTo);
} }
SDOperand CombineTo(SDNode *N, SDOperand Res0, SDOperand Res1) { SDOperand CombineTo(SDNode *N, SDOperand Res0, SDOperand Res1,
bool AddTo = true) {
SDOperand To[] = { Res0, Res1 }; SDOperand To[] = { Res0, Res1 };
return CombineTo(N, To, 2); return CombineTo(N, To, 2, AddTo);
} }
private: private:
@@ -602,6 +606,9 @@ SDOperand DAGCombiner::visitTokenFactor(SDNode *N) {
// New and improved token factor. // New and improved token factor.
Result = DAG.getNode(ISD::TokenFactor, MVT::Other, &Ops[0], Ops.size()); Result = DAG.getNode(ISD::TokenFactor, MVT::Other, &Ops[0], Ops.size());
} }
// Don't add users to work list.
return CombineTo(N, Result, false);
} }
return Result; return Result;
@@ -2717,8 +2724,9 @@ SDOperand DAGCombiner::visitLOAD(SDNode *N) {
SDOperand Token = DAG.getNode(ISD::TokenFactor, MVT::Other, SDOperand Token = DAG.getNode(ISD::TokenFactor, MVT::Other,
Chain, ReplLoad.getValue(1)); Chain, ReplLoad.getValue(1));
// Replace uses with load result and token factor. // Replace uses with load result and token factor. Don't add users
return CombineTo(N, ReplLoad.getValue(0), Token); // to work list.
return CombineTo(N, ReplLoad.getValue(0), Token, false);
} }
} }
@@ -2745,7 +2753,11 @@ SDOperand DAGCombiner::visitSTORE(SDNode *N) {
ST->getSrcValueOffset(), ST->getStoredVT()); ST->getSrcValueOffset(), ST->getStoredVT());
// Create token to keep both nodes around. // Create token to keep both nodes around.
return DAG.getNode(ISD::TokenFactor, MVT::Other, Chain, ReplTStore); SDOperand Token =
DAG.getNode(ISD::TokenFactor, MVT::Other, Chain, ReplTStore);
// Don't add users to work list.
return CombineTo(N, Token, false);
} }
} }
@@ -2796,7 +2808,11 @@ SDOperand DAGCombiner::visitSTORE(SDNode *N) {
SDOperand ReplStore = DAG.getStore(BetterChain, Value, Ptr, SDOperand ReplStore = DAG.getStore(BetterChain, Value, Ptr,
ST->getSrcValue(), ST->getSrcValueOffset()); ST->getSrcValue(), ST->getSrcValueOffset());
// Create token to keep both nodes around. // Create token to keep both nodes around.
return DAG.getNode(ISD::TokenFactor, MVT::Other, Chain, ReplStore); SDOperand Token =
DAG.getNode(ISD::TokenFactor, MVT::Other, Chain, ReplStore);
// Don't add users to work list.
return CombineTo(N, Token, false);
} }
} }