mirror of
https://github.com/RPCS3/llvm.git
synced 2024-12-24 21:14:56 +00:00
Two simplifications for token factor nodes: simplify tf(x,x) -> x.
simplify tf(x,y,y,z) -> tf(x,y,z). git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@28233 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
29225b1d32
commit
21a57dc751
@ -680,7 +680,8 @@ SDOperand DAGCombiner::visitTokenFactor(SDNode *N) {
|
||||
// If the token factor has two operands and one is the entry token, replace
|
||||
// the token factor with the other operand.
|
||||
if (N->getNumOperands() == 2) {
|
||||
if (N->getOperand(0).getOpcode() == ISD::EntryToken)
|
||||
if (N->getOperand(0).getOpcode() == ISD::EntryToken ||
|
||||
N->getOperand(0) == N->getOperand(1))
|
||||
return N->getOperand(1);
|
||||
if (N->getOperand(1).getOpcode() == ISD::EntryToken)
|
||||
return N->getOperand(0);
|
||||
@ -694,8 +695,11 @@ SDOperand DAGCombiner::visitTokenFactor(SDNode *N) {
|
||||
Changed = true;
|
||||
for (unsigned j = 0, e = Op.getNumOperands(); j != e; ++j)
|
||||
Ops.push_back(Op.getOperand(j));
|
||||
} else {
|
||||
} else if (i == 0 || N->getOperand(i) != N->getOperand(i-1)) {
|
||||
Ops.push_back(Op);
|
||||
} else {
|
||||
// Deleted an operand that was the same as the last one.
|
||||
Changed = true;
|
||||
}
|
||||
}
|
||||
if (Changed)
|
||||
|
Loading…
Reference in New Issue
Block a user