Reformat blank lines.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@209106 91177308-0d34-0410-b5e6-96231b3b80d8

include/llvm/Transforms/Utils/BasicBlockUtils.h

@@ -34,7 +34,6 @@ class TerminatorInst;
 /// predecessors.
 void DeleteDeadBlock(BasicBlock *BB);
 
-
 /// FoldSingleEntryPHINodes - We know that BB has one predecessor.  If there are
 /// any single-entry PHI nodes in it, fold them away.  This handles the case
 /// when all entries to the PHI nodes in a block are guaranteed equal, such as
@@ -207,7 +206,6 @@ TerminatorInst *SplitBlockAndInsertIfThen(Value *Cond, Instruction *SplitBefore,
                                           bool Unreachable,
                                           MDNode *BranchWeights = nullptr);
 
-
 /// SplitBlockAndInsertIfThenElse is similar to SplitBlockAndInsertIfThen,
 /// but also creates the ElseBlock.
 /// Before:

include/llvm/Transforms/Utils/BuildLibCalls.h

@@ -124,6 +124,7 @@ namespace llvm {
     virtual void replaceCall(Value *With) = 0;
     virtual bool isFoldable(unsigned SizeCIOp, unsigned SizeArgOp,
                             bool isString) const = 0;
+
   public:
     virtual ~SimplifyFortifiedLibCalls();
     bool fold(CallInst *CI, const DataLayout *TD, const TargetLibraryInfo *TLI);

include/llvm/Transforms/Utils/Cloning.h

@@ -65,7 +65,6 @@ struct ClonedCodeInfo {
   ClonedCodeInfo() : ContainsCalls(false), ContainsDynamicAllocas(false) {}
 };
 
-
 /// CloneBasicBlock - Return a copy of the specified basic block, but without
 /// embedding the block into a particular function.  The block returned is an
 /// exact copy of the specified basic block, without any remapping having been
@@ -154,7 +153,6 @@ void CloneAndPruneFunctionInto(Function *NewFunc, const Function *OldFunc,
                                const DataLayout *DL = nullptr,
                                Instruction *TheCall = nullptr);
 
-
 /// InlineFunctionInfo - This class captures the data input to the
 /// InlineFunction call, and records the auxiliary results produced by it.
 class InlineFunctionInfo {

include/llvm/Transforms/Utils/CodeExtractor.h

@@ -120,7 +120,6 @@ namespace llvm {
                                     BasicBlock *newHeader,
                                     ValueSet &inputs,
                                     ValueSet &outputs);
-
   };
 }
 

include/llvm/Transforms/Utils/Local.h

@@ -82,7 +82,6 @@ bool RecursivelyDeleteTriviallyDeadInstructions(Value *V,
 bool RecursivelyDeleteDeadPHINode(PHINode *PN,
                                   const TargetLibraryInfo *TLI = nullptr);
 
-
 /// SimplifyInstructionsInBlock - Scan the specified basic block and try to
 /// simplify any instructions in it and recursively delete dead instructions.
 ///
@@ -109,7 +108,6 @@ bool SimplifyInstructionsInBlock(BasicBlock *BB, const DataLayout *TD = nullptr,
 void RemovePredecessorAndSimplify(BasicBlock *BB, BasicBlock *Pred,
                                   DataLayout *TD = nullptr);
 
-
 /// MergeBasicBlockIntoOnlyPred - BB is a block with one predecessor and its
 /// predecessor is known to have one successor (BB!).  Eliminate the edge
 /// between them, moving the instructions in the predecessor into BB.  This
@@ -117,7 +115,6 @@ void RemovePredecessorAndSimplify(BasicBlock *BB, BasicBlock *Pred,
 ///
 void MergeBasicBlockIntoOnlyPred(BasicBlock *BB, Pass *P = nullptr);
 
-
 /// TryToSimplifyUncondBranchFromEmptyBlock - BB is known to contain an
 /// unconditional branch, and contains no instructions other than PHI nodes,
 /// potential debug intrinsics and the branch.  If possible, eliminate BB by

include/llvm/Transforms/Utils/LoopUtils.h

@@ -58,7 +58,6 @@ bool formLCSSA(Loop &L, DominatorTree &DT, ScalarEvolution *SE = nullptr);
 /// Returns true if any modifications are made to the loop.
 bool formLCSSARecursively(Loop &L, DominatorTree &DT,
                           ScalarEvolution *SE = nullptr);
-
 }
 
 #endif

include/llvm/Transforms/Utils/SSAUpdater.h

@@ -133,6 +133,7 @@ private:
 class LoadAndStorePromoter {
 protected:
   SSAUpdater &SSA;
+
 public:
   LoadAndStorePromoter(const SmallVectorImpl<Instruction*> &Insts,
                        SSAUpdater &S, StringRef Name = StringRef());
@@ -145,7 +146,6 @@ public:
   /// removed from the code.
   void run(const SmallVectorImpl<Instruction*> &Insts) const;
 
-
   /// \brief Return true if the specified instruction is in the Inst list.
   ///
   /// The Insts list is the one passed into the constructor. Clients should

include/llvm/Transforms/Utils/SimplifyIndVar.h

@@ -37,6 +37,7 @@ protected:
   bool ShouldSplitOverflowIntrinsics;
 
   virtual void anchor();
+
 public:
   IVVisitor(): DT(nullptr), ShouldSplitOverflowIntrinsics(false) {}
   virtual ~IVVisitor() {}

include/llvm/Transforms/Utils/SimplifyLibCalls.h

@@ -30,6 +30,7 @@ namespace llvm {
     /// Impl - A pointer to the actual implementation of the library call
     /// simplifier.
     LibCallSimplifierImpl *Impl;
+
   public:
     LibCallSimplifier(const DataLayout *TD, const TargetLibraryInfo *TLI,
                       bool UnsafeFPShrink);

include/llvm/Transforms/Utils/UnifyFunctionExitNodes.h

@@ -24,6 +24,7 @@ namespace llvm {
 
 struct UnifyFunctionExitNodes : public FunctionPass {
   BasicBlock *ReturnBlock, *UnwindBlock, *UnreachableBlock;
+
 public:
   static char ID; // Pass identification, replacement for typeid
   UnifyFunctionExitNodes() : FunctionPass(ID),

include/llvm/Transforms/Utils/UnrollLoop.h

@@ -29,7 +29,6 @@ bool UnrollLoop(Loop *L, unsigned Count, unsigned TripCount, bool AllowRuntime,
 
 bool UnrollRuntimeLoopProlog(Loop *L, unsigned Count, LoopInfo *LI,
                              LPPassManager* LPM);
-
 }
 
 #endif

include/llvm/Transforms/Utils/ValueMapper.h

@@ -93,7 +93,6 @@ namespace llvm {
                                    Materializer));
   }
 
-
 } // End llvm namespace
 
 #endif

include/llvm/Transforms/Utils/VectorUtils.h

@@ -53,7 +53,6 @@ static inline bool isTriviallyVectorizable(Intrinsic::ID ID) {
   }
 }
 
-
 static Intrinsic::ID checkUnaryFloatSignature(const CallInst &I,
                                               Intrinsic::ID ValidIntrinsicID) {
   if (I.getNumArgOperands() != 1 ||
@@ -175,7 +174,6 @@ getIntrinsicIDForCall(CallInst *CI, const TargetLibraryInfo *TLI) {
   return Intrinsic::not_intrinsic;
 }
 
-
 } // llvm namespace
 
 #endif