dart2js cps: Remove dart2dart from cps pipeline and clean up.

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

 // Copyright (c) 2014, 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.
 
-part of dart2js.cps_ir.optimizers;
+library dart2js.cps_ir.shrinking_reductions;
+
+import 'cps_ir_nodes.dart';
+import 'optimizers.dart';
 
 /**
  * [ShrinkingReducer] applies shrinking reductions to CPS terms as described
  * in 'Compiling with Continuations, Continued' by Andrew Kennedy.
  */
 class ShrinkingReducer extends Pass {
   String get passName => 'Shrinking reductions';
 
   Set<_ReductionTask> _worklist;
 
   static final _DeletedNode _DELETED = new _DeletedNode();
 
   /// Applies shrinking reductions to root, mutating root in the process.
   @override
-  void rewrite(RootNode root) {
-    if (root.isEmpty) return;
-
+  void rewrite(FunctionDefinition root) {
     _worklist = new Set<_ReductionTask>();
     _RedexVisitor redexVisitor = new _RedexVisitor(_worklist);
 
     // Set all parent pointers.
     new ParentVisitor().visit(root);
 
     // Sweep over the term, collecting redexes into the worklist.
     redexVisitor.visit(root);
 
     // Process the worklist.
@@ skipping 454 matching lines @@
 /// Traverses the CPS term and sets node.parent for each visited node.
 class ParentVisitor extends RecursiveVisitor {
   processFunctionDefinition(FunctionDefinition node) {
     node.body.parent = node;
     if (node.thisParameter != null) node.thisParameter.parent = node;
     int index = 0;
     node.parameters.forEach((Definition parameter) {
       parameter.parent = node;
       if (parameter is Parameter) parameter.parentIndex = index++;
     });
-  }
-
-  processBody(Body node) {
     node.returnContinuation.parent = node;
     node.body.parent = node;
   }
 
-  processConstructorDefinition(ConstructorDefinition node) {
-    node.body.parent = node;
-    int index = 0;
-    node.parameters.forEach((Definition parameter) {
-      parameter.parent = node;
-      if (parameter is Parameter) parameter.parentIndex = index++;
-    });
-    node.initializers.forEach((Initializer i) => i.parent = node);
-  }
-
-  // Expressions.
-
-  processFieldInitializer(FieldInitializer node) {
-    node.body.parent = node;
-  }
-
-  processSuperInitializer(SuperInitializer node) {
-    node.arguments.forEach((Body argument) => argument.parent = node);
-  }
-
   processLetPrim(LetPrim node) {
     node.primitive.parent = node;
     node.body.parent = node;
   }
 
   processLetCont(LetCont node) {
     int index = 0;
     node.continuations.forEach((Continuation continuation) {
       continuation.parent = node;
       continuation.parent_index = index++;
@@ skipping 55 matching lines @@
     node.continuation.parent = node;
     node.value.parent = node;
   }
 
   processSetMutableVariable(SetMutableVariable node) {
     node.variable.parent = node;
     node.body.parent = node;
     node.value.parent = node;
   }
 
-  processDeclareFunction(DeclareFunction node) {
-    node.variable.parent = node;
-    node.definition.parent = node;
-    node.body.parent = node;
-  }
-
   processThrow(Throw node) {
     node.value.parent = node;
   }
 
   processGetLazyStatic(GetLazyStatic node) {
     node.continuation.parent = node;
   }
 
-  // Definitions.
-
   processLiteralList(LiteralList node) {
     node.values.forEach((Reference ref) => ref.parent = node);
   }
 
   processLiteralMap(LiteralMap node) {
     node.entries.forEach((LiteralMapEntry entry) {
       entry.key.parent = node;
       entry.value.parent = node;
     });
   }
 
   processCreateFunction(CreateFunction node) {
     node.definition.parent = node;
   }
 
   processContinuation(Continuation node) {
     if (node.body != null) node.body.parent = node;
     int index = 0;
     node.parameters.forEach((Parameter parameter) {
       parameter.parent = node;
       parameter.parentIndex = index++;
     });
   }
 
-  // Conditions.
-
   processIsTrue(IsTrue node) {
     node.value.parent = node;
   }
 
-  // JavaScript specific nodes.
-
   processIdentical(Identical node) {
     node.left.parent = node;
     node.right.parent = node;
   }
 
   processInterceptor(Interceptor node) {
     node.input.parent = node;
   }
 
   processSetField(SetField node) {
@@ skipping 80 matching lines @@
   }
 
   String toString() => "$kind: $node";
 }
 
 /// A dummy class used solely to mark nodes as deleted once they are removed
 /// from a term.
 class _DeletedNode extends Node {
   accept(_) => null;
 }