diff options
| author | Duncan Sands <baldrick@free.fr> | 2010-01-08 17:51:48 +0000 |
|---|---|---|
| committer | Duncan Sands <baldrick@free.fr> | 2010-01-08 17:51:48 +0000 |
| commit | 4a8b15dc742dd74008becf657acfd6601c3b7bae (patch) | |
| tree | cdee763d37616afad2f5992360d3c06d632a959f /llvm/lib | |
| parent | 8c92b57df9ef746cb399e5a96e0febf3c9c3c344 (diff) | |
| download | bcm5719-llvm-4a8b15dc742dd74008becf657acfd6601c3b7bae.tar.gz bcm5719-llvm-4a8b15dc742dd74008becf657acfd6601c3b7bae.zip | |
Suppress an unused variable warning when assertions are off;
remove some trailing whitespace while there.
llvm-svn: 93008
Diffstat (limited to 'llvm/lib')
| -rw-r--r-- | llvm/lib/Transforms/Scalar/Reassociate.cpp | 5 |
1 files changed, 3 insertions, 2 deletions
diff --git a/llvm/lib/Transforms/Scalar/Reassociate.cpp b/llvm/lib/Transforms/Scalar/Reassociate.cpp index f2a8633f97a..3cc380a0e4b 100644 --- a/llvm/lib/Transforms/Scalar/Reassociate.cpp +++ b/llvm/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. |

