remove some trailing whitespace while there.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@93008
91177308-0d34-0410-b5e6-
96231b3b80d8
// 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.