RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2025-02-11 05:17:36 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Add 'landingpad' instructions to the list of instructions to ignore.

Browse Source 
Also combine the code in the 'assert' statement.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@156155 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Bill Wendling 2012-05-04 04:22:32 +00:00
parent 11ac1f81a8
commit 98bda3dfef
1 changed files with 8 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -175,6 +175,7 @@ void Reassociate::RemoveDeadBinaryOp(Value *V) {
static bool isUnmovableInstruction(Instruction *I) {
if (I->getOpcode() == Instruction::PHI ||
I->getOpcode() == Instruction::LandingPad ||
I->getOpcode() == Instruction::Alloca ||
I->getOpcode() == Instruction::Load ||
I->getOpcode() == Instruction::Invoke ||
@ -272,13 +273,14 @@ static Instruction *LowerNegateToMultiply(Instruction *Neg,
// linearize it as well. Besides that case, this does not recurse into A,B, or
// C.
void Reassociate::LinearizeExpr(BinaryOperator *I) {
BinaryOperator *LHS = cast<BinaryOperator>(I->getOperand(0));
BinaryOperator *RHS = cast<BinaryOperator>(I->getOperand(1));
assert(isReassociableOp(LHS, I->getOpcode()) &&
isReassociableOp(RHS, I->getOpcode()) &&
"Not an expression that needs linearization?");
BinaryOperator *LHS = isReassociableOp(I->getOperand(0), I->getOpcode());
BinaryOperator *RHS = isReassociableOp(I->getOperand(1), I->getOpcode());
assert(LHS && RHS && "Not an expression that needs linearization?");
DEBUG(dbgs() << "Linear" << *LHS << '\n' << *RHS << '\n' << *I << '\n');
DEBUG({
dbgs() << "Linear:\n";
dbgs() << '\t' << *LHS << "\t\n" << *RHS << "\t\n" << *I << '\n';
});
// Move the RHS instruction to live immediately before I, avoiding breaking
// dominator properties.