RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-21 03:53:04 +02:00
Code Issues Projects Releases Wiki Activity

Remove the last bit of constant folding from LinearizeExprTree (most of it was

Browse Source 
removed in commit 168035, but I missed this bit).

llvm-svn: 168292
This commit is contained in:
Duncan Sands 2012-11-18 20:15:36 +00:00
parent 2d43cbfea0
commit 666f7dee7a
1 changed files with 0 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
lib/Transforms/Scalar/Reassociate.cpp
View File

@ -423,10 +423,6 @@ static bool LinearizeExprTree(BinaryOperator *I,
assert(Instruction::isAssociative(Opcode) &&
Instruction::isCommutative(Opcode) &&
"Expected an associative and commutative operation!");
// If we see an absorbing element then the entire expression must be equal to
// it. For example, if this is a multiplication expression and zero occurs as
// an operand somewhere in it then the result of the expression must be zero.
Constant *Absorber = ConstantExpr::getBinOpAbsorber(Opcode, I->getType());
// Visit all operands of the expression, keeping track of their weight (the
// number of paths from the expression root to the operand, or if you like
@ -474,13 +470,6 @@ static bool LinearizeExprTree(BinaryOperator *I,
DEBUG(dbgs() << "OPERAND: " << *Op << " (" << Weight << ")\n");
assert(!Op->use_empty() && "No uses, so how did we get to it?!");
// If the expression contains an absorbing element then there is no need
// to analyze it further: it must evaluate to the absorbing element.
if (Op == Absorber && !Weight.isMinValue()) {
Ops.push_back(std::make_pair(Absorber, APInt(Bitwidth, 1)));
return MadeChange;
}
// If this is a binary operation of the right kind with only one use then
// add its operands to the expression.
if (BinaryOperator *BO = isReassociableOp(Op, Opcode)) {