Reflow comments to use the full width.

src/IceSwitchLowering.cpp

 //===- subzero/src/IceSwitchLowering.cpp - Switch lowering ----------------===//
 //
 //                        The Subzero Code Generator
 //
 // This file is distributed under the University of Illinois Open Source
 // License. See LICENSE.TXT for details.
 //
 //===----------------------------------------------------------------------===//
 ///
 /// \file
@@ skipping 37 matching lines @@
 
   // TODO(ascull): Merge in a cycle i.e. -1(=UINTXX_MAX) to 0. This depends on
   // the types for correct wrap around behavior.
 
   // A small number of cases is more efficient without a jump table
   if (CaseClusters.size() < Func->getTarget()->getMinJumpTableSize())
     return CaseClusters;
 
   // Test for a single jump table. This can be done in constant time whereas
   // finding the best set of jump table would be quadratic, too slow(?). If
-  // jump tables were included in the search tree we'd first have to traverse to
-  // them. Ideally we would have an unbalanced tree which is biased towards
+  // jump tables were included in the search tree we'd first have to traverse
+  // to them. Ideally we would have an unbalanced tree which is biased towards
   // frequently executed code but we can't do this well without profiling data.
   // So, this single jump table is a good starting point where you can get to
   // the jump table quickly without figuring out how to unbalance the tree.
   uint64_t MaxValue = CaseClusters.back().High;
   uint64_t MinValue = CaseClusters.front().Low;
   // Don't +1 yet to avoid (INT64_MAX-0)+1 overflow
   uint64_t TotalRange = MaxValue - MinValue;
 
   // Might be too sparse for the jump table
   if (NumCases * 2 <= TotalRange)
@@ skipping 24 matching lines @@
 
 bool CaseCluster::tryAppend(const CaseCluster &New) {
   // Can only append ranges with the same target and are adjacent
   bool CanAppend = this->Target == New.Target && this->High + 1 == New.Low;
   if (CanAppend)
     this->High = New.High;
   return CanAppend;
 }
 
 } // end of namespace Ice