Reflow comments to use the full width.

src/IceCfgNode.h

 //===- subzero/src/IceCfgNode.h - Control flow graph node -------*- C++ -*-===//
 //
 //                        The Subzero Code Generator
 //
 // This file is distributed under the University of Illinois Open Source
 // License. See LICENSE.TXT for details.
 //
 //===----------------------------------------------------------------------===//
 ///
 /// \file
-/// This file declares the CfgNode class, which represents a single
-/// basic block as its instruction list, in-edge list, and out-edge
-/// list.
+/// This file declares the CfgNode class, which represents a single basic block
+/// as its instruction list, in-edge list, and out-edge list.
 ///
 //===----------------------------------------------------------------------===//
 
 #ifndef SUBZERO_SRC_ICECFGNODE_H
 #define SUBZERO_SRC_ICECFGNODE_H
 
 #include "IceDefs.h"
 #include "IceInst.h" // InstList traits
 
 namespace Ice {
@@ skipping 19 matching lines @@
       NameIndex = Func->addIdentifierName(NewName);
   }
   IceString getAsmName() const {
     return ".L" + Func->getFunctionName() + "$" + getName();
   }
 
   void incrementLoopNestDepth() { ++LoopNestDepth; }
   void setLoopNestDepth(SizeT NewDepth) { LoopNestDepth = NewDepth; }
   SizeT getLoopNestDepth() const { return LoopNestDepth; }
 
-  /// The HasReturn flag indicates that this node contains a return
-  /// instruction and therefore needs an epilog.
+  /// The HasReturn flag indicates that this node contains a return instruction
+  /// and therefore needs an epilog.
   void setHasReturn() { HasReturn = true; }
   bool getHasReturn() const { return HasReturn; }
 
   void setNeedsPlacement(bool Value) { NeedsPlacement = Value; }
   bool needsPlacement() const { return NeedsPlacement; }
 
   void setNeedsAlignment() { NeedsAlignment = true; }
   bool needsAlignment() const { return NeedsAlignment; }
 
   /// \name Access predecessor and successor edge lists.
   /// @{
   const NodeList &getInEdges() const { return InEdges; }
   const NodeList &getOutEdges() const { return OutEdges; }
   /// @}
 
   /// \name Manage the instruction list.
   /// @{
   InstList &getInsts() { return Insts; }
   PhiList &getPhis() { return Phis; }
   void appendInst(Inst *Inst);
   void renumberInstructions();
-  /// Rough and generally conservative estimate of the number of
-  /// instructions in the block.  It is updated when an instruction is
-  /// added, but not when deleted.  It is recomputed during
-  /// renumberInstructions().
+  /// Rough and generally conservative estimate of the number of instructions in
+  /// the block. It is updated when an instruction is added, but not when
+  /// deleted. It is recomputed during renumberInstructions().
   InstNumberT getInstCountEstimate() const { return InstCountEstimate; }
   /// @}
 
   /// \name Manage predecessors and successors.
   /// @{
 
-  /// Add a predecessor edge to the InEdges list for each of this
-  /// node's successors.
+  /// Add a predecessor edge to the InEdges list for each of this node's
+  /// successors.
   void computePredecessors();
   void computeSuccessors();
   CfgNode *splitIncomingEdge(CfgNode *Pred, SizeT InEdgeIndex);
   /// @}
 
   void placePhiLoads();
   void placePhiStores();
   void deletePhis();
   void advancedPhiLowering();
   void doAddressOpt();
@@ skipping 24 matching lines @@
   InstNumberT InstCountEstimate = 0; /// rough instruction count estimate
   NodeList InEdges;                  /// in no particular order
   NodeList OutEdges;                 /// in no particular order
   PhiList Phis;                      /// unordered set of phi instructions
   InstList Insts;                    /// ordered list of non-phi instructions
 };
 
 } // end of namespace Ice
 
 #endif // SUBZERO_SRC_ICECFGNODE_H