Reflow comments to use the full width.

src/IceSwitchLowering.cpp

Index: src/IceSwitchLowering.cpp
diff --git a/src/IceSwitchLowering.cpp b/src/IceSwitchLowering.cpp
index 620749519b4777c6d94e70809193d3b4821041d1..047aa91594a52970867cc09bc33dd361e845a44e 100644
--- a/src/IceSwitchLowering.cpp
+++ b/src/IceSwitchLowering.cpp
@@ -55,8 +55,8 @@ CaseClusterArray CaseCluster::clusterizeSwitch(Cfg *Func,
 
   // 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.