aboutsummaryrefslogtreecommitdiff
path: root/lib/Transforms/Scalar/Reassociate.cpp
diff options
context:
space:
mode:
authorDuncan Sands <baldrick@free.fr>2010-01-08 17:51:48 +0000
committerDuncan Sands <baldrick@free.fr>2010-01-08 17:51:48 +0000
commit54a57045ebcf8e31b1542098d1cd2bda9a718725 (patch)
treee6c66ae8fb8e48448140262d424d3ad42cafd2bd /lib/Transforms/Scalar/Reassociate.cpp
parent9aa1e246dd15dfc73a2f6f44766ca97ba9573c9d (diff)
Suppress an unused variable warning when assertions are off;
remove some trailing whitespace while there. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@93008 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Transforms/Scalar/Reassociate.cpp')
-rw-r--r--lib/Transforms/Scalar/Reassociate.cpp5
1 files changed, 3 insertions, 2 deletions
diff --git a/lib/Transforms/Scalar/Reassociate.cpp b/lib/Transforms/Scalar/Reassociate.cpp
index f2a8633f97..3cc380a0e4 100644
--- a/lib/Transforms/Scalar/Reassociate.cpp
+++ b/lib/Transforms/Scalar/Reassociate.cpp
@@ -801,14 +801,15 @@ Value *Reassociate::OptimizeAdd(Instruction *I,
// No need for extra uses anymore.
delete DummyInst;
-
+
unsigned NumAddedValues = NewMulOps.size();
Value *V = EmitAddTreeOfValues(I, NewMulOps);
-
+
// Now that we have inserted the add tree, optimize it. This allows us to
// handle cases that require multiple factoring steps, such as this:
// A*A*B + A*A*C --> A*(A*B+A*C) --> A*(A*(B+C))
assert(NumAddedValues > 1 && "Each occurrence should contribute a value");
+ (void)NumAddedValues;
V = ReassociateExpression(cast<BinaryOperator>(V));
// Create the multiply.