[llvm] r291334 - NewGVN: Reformat and fix a few newlines

[Daniel Berlin via llvm-commits]

Author: dannyb
Date: Fri Jan  6 21:23:47 2017
New Revision: 291334

URL: http://llvm.org/viewvc/llvm-project?rev=291334&view=rev
Log:
NewGVN: Reformat and fix a few newlines

Modified:
    llvm/trunk/lib/Transforms/Scalar/NewGVN.cpp

Modified: llvm/trunk/lib/Transforms/Scalar/NewGVN.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Transforms/Scalar/NewGVN.cpp?rev=291334&r1=291333&r2=291334&view=diff
==============================================================================
--- llvm/trunk/lib/Transforms/Scalar/NewGVN.cpp (original)
+++ llvm/trunk/lib/Transforms/Scalar/NewGVN.cpp Fri Jan  6 21:23:47 2017
@@ -79,7 +79,8 @@ STATISTIC(NumGVNInstrDeleted, "Number of
 STATISTIC(NumGVNBlocksDeleted, "Number of blocks deleted");
 STATISTIC(NumGVNOpsSimplified, "Number of Expressions simplified");
 STATISTIC(NumGVNPhisAllSame, "Number of PHIs whos arguments are all the same");
-STATISTIC(NumGVNMaxIterations, "Maximum Number of iterations it took to converge GVN");
+STATISTIC(NumGVNMaxIterations,
+          "Maximum Number of iterations it took to converge GVN");
 
 //===----------------------------------------------------------------------===//
 //                                GVN Pass
@@ -1023,7 +1024,6 @@ void NewGVN::markMemoryUsersTouched(Memo
 
 // Perform congruence finding on a given value numbering expression.
 void NewGVN::performCongruenceFinding(Value *V, const Expression *E) {
-
   ValueToExpression[V] = E;
   // This is guaranteed to return something, since it will at least find
   // INITIAL.
@@ -1881,6 +1881,7 @@ private:
   SmallVector<std::pair<int, int>, 8> DFSStack;
 };
 }
+
 bool NewGVN::eliminateInstructions(Function &F) {
   // This is a non-standard eliminator. The normal way to eliminate is
   // to walk the dominator tree in order, keeping track of available