6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-01-18 13:34:04 +00:00
Code Issues Projects Releases Wiki Activity

Load chain check is not needed

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@30613 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Jim Laskey 2006-09-26 17:44:58 +00:00
parent 79597d2af6
commit bb1518585b
1 changed files with 1 additions and 24 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

25
lib/CodeGen/SelectionDAG/DAGCombiner.cpp
View File

@ -240,10 +240,6 @@ class VISIBILITY_HIDDEN DAGCombiner {
SDOperand BuildUDIV(SDNode *N); SDOperand BuildUDIV(SDNode *N);
SDNode *MatchRotate(SDOperand LHS, SDOperand RHS); SDNode *MatchRotate(SDOperand LHS, SDOperand RHS);
/// hasChainUsers - Returns true if one of the users of a load node has the
/// chain result as an operand.
bool hasChainUsers(SDNode *Load);
/// FindBaseOffset - Return true if we can determine base and offset /// FindBaseOffset - Return true if we can determine base and offset
/// information from a given pointer operand. Provides base and offset as a /// information from a given pointer operand. Provides base and offset as a
/// result. /// result.
@ -2646,7 +2642,7 @@ SDOperand DAGCombiner::visitLOAD(SDNode *N) {
// We can only move the load if it has a user of it's chain result. Otherwise // We can only move the load if it has a user of it's chain result. Otherwise
// there is no place to attach it's old chain. // there is no place to attach it's old chain.
if (CombinerAA && hasChainUsers(N)) { if (CombinerAA) {
// Walk up chain skipping non-aliasing memory nodes. // Walk up chain skipping non-aliasing memory nodes.
SDOperand BetterChain = FindBetterChain(N, Chain); SDOperand BetterChain = FindBetterChain(N, Chain);
@ -3953,25 +3949,6 @@ SDOperand DAGCombiner::BuildUDIV(SDNode *N) {
return S; return S;
} }
/// hasChainUsers - Returns true if one of the users of a load node has the
/// chain result as an operand.
bool DAGCombiner::hasChainUsers(SDNode *Load) {
SDOperand Chain(Load, 1); // The load's chain result.
// For each user of the load.
for (SDNode::use_iterator UI = Load->use_begin(), UE = Load->use_end();
UI != UE; ++UI) {
const SDNode *User = *UI;
for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i) {
if (User->getOperand(i) == Chain) return true;
}
}
// No luck.
return false;
}
/// FindBaseOffset - Return true if we can determine base and offset information /// FindBaseOffset - Return true if we can determine base and offset information
/// from a given pointer operand. Provides base and offset as a result. /// from a given pointer operand. Provides base and offset as a result.
bool DAGCombiner::FindBaseOffset(SDOperand Ptr, bool DAGCombiner::FindBaseOffset(SDOperand Ptr,