Rerun formatter

pkg/compiler/lib/src/cps_ir/cps_ir_nodes.dart

 // Copyright (c) 2013, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 library dart2js.ir_nodes;
 
 import 'dart:collection';
 import 'cps_fragment.dart' show CpsFragment;
 import 'cps_ir_nodes_sexpr.dart';
 import '../constants/values.dart' as values;
 import '../dart_types.dart' show DartType, InterfaceType, TypeVariableType;
@@ skipping 2164 matching lines @@
       while (node.next != null) {
         if (node is LetCont) {
           stack.addAll(node.continuations);
         } else if (node is LetHandler) {
           stack.add(node.handler);
         }
         node = node.next;
         nodes.add(node);
       }
     }
+
     walkBlock(root);
     while (stack.isNotEmpty) {
       walkBlock(stack.removeLast());
     }
     nodes.reversed.forEach(v.visit);
   }
 
   /// Visits block-level nodes in lexical pre-order.
   ///
   /// Traversal continues at the original success for the current node, so:
@@ skipping 10 matching lines @@
         if (node is LetCont) {
           stack.addAll(node.continuations);
         } else if (node is LetHandler) {
           stack.add(node.handler);
         }
         Expression next = node.next;
         v.visit(node);
         node = next;
       }
     }
+
     walkBlock(root);
     while (stack.isNotEmpty) {
       walkBlock(stack.removeLast());
     }
   }
 }
 
 abstract class Visitor<T> implements BlockVisitor<T> {
   const Visitor();
 
@@ skipping 889 matching lines @@
         _definitions.getCopy(node.conditionRef),
         _copies[node.trueContinuation],
         _copies[node.falseContinuation],
         node.sourceInformation)..isStrictCheck = node.isStrictCheck);
   }
 
   visitUnreachable(Unreachable node) {
     plug(new Unreachable());
   }
 }