Add support for fields to the new dart backend.

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.optimizers;
 
 /**
  * [[ShrinkingReducer]] applies shrinking reductions to CPS terms as described
  * in 'Compiling with Continuations, Continued' by Andrew Kennedy.
  */
-class ShrinkingReducer implements Pass {
+class ShrinkingReducer extends Pass {
   _RedexVisitor _redexVisitor;
   Set<_ReductionTask> _worklist;
 
   static final _DeletedNode _DELETED = new _DeletedNode();
 
-  /// Applies shrinking reductions to root, mutating root in the process.
-  void rewrite(FunctionDefinition root) {
-    if (root.isAbstract) return;
-
+  void rewriteExecutableDefinition(ExecutableDefinition root) {
     _worklist = new Set<_ReductionTask>();
     _redexVisitor = new _RedexVisitor(_worklist);
 
     // Set all parent pointers.
     new ParentVisitor().visit(root);
 
     // Sweep over the term, collecting redexes into the worklist.
-    _redexVisitor.visitFunctionDefinition(root);
+    _redexVisitor.visit(root);
 
     // Process the worklist.
     while (_worklist.isNotEmpty) {
       _ReductionTask task = _worklist.first;
       _worklist.remove(task);
       _processTask(task);
     }
   }
 
+  /// Applies shrinking reductions to root, mutating root in the process.
+  void rewriteFieldDefinition(FieldDefinition root) {
+    rewriteExecutableDefinition(root);
+  }
+
+  /// Applies shrinking reductions to root, mutating root in the process.
+  void rewriteFunctionDefinition(FunctionDefinition root) {
+    if (root.isAbstract) return;
+    rewriteExecutableDefinition(root);
+  }
+
   /// Removes the given node from the CPS graph, replacing it with its body
   /// and marking it as deleted. The node's parent must be a [[InteriorNode]].
   void _removeNode(InteriorNode node) {
     Node body           = node.body;
     InteriorNode parent = node.parent;
     assert(parent.body == node);
 
     body.parent = parent;
     parent.body = body;
     node.parent = _DELETED;
@@ skipping 240 matching lines @@
       if (parent is LetCont && _isDeadCont(parent)) {
         worklist.add(new _ReductionTask(_ReductionKind.DEAD_CONT, parent));
       }
     }
   }
 }
 
 /// Traverses the CPS term and sets node.parent for each visited node.
 class ParentVisitor extends RecursiveVisitor {
 
+  processFieldDefinition(FieldDefinition node) {
+    node.body.parent = node;
+  }
+
   processFunctionDefinition(FunctionDefinition node) {
     node.body.parent = node;
     node.parameters.forEach((Parameter p) => p.parent = node);
   }
 
   // Expressions.
 
   processLetPrim(LetPrim node) {
     node.primitive.parent = node;
     node.body.parent = node;
@@ skipping 129 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;
 }