Add support for fields to the new dart backend.

pkg/compiler/lib/src/dart_backend/backend.dart

 // Copyright (c) 2012, 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 dart_backend;
 
 // TODO(ahe): This class is simply wrong.  This backend should use
 // elements when it can, not AST nodes.  Perhaps a [Map<Element,
 // TreeElements>] is what is needed.
 class ElementAst {
@@ skipping 116 matching lines @@
     world.registerInvocation(new Selector.call("toString", null, 0));
     world.registerInvokedGetter(new Selector.getter("hashCode", null));
     world.registerInvocation(new Selector.binaryOperator("=="));
     world.registerInvocation(new Selector.call("compareTo", null, 1));
   }
 
   void codegen(CodegenWorkItem work) { }
 
   /// Create an [ElementAst] from the CPS IR.
   static ElementAst createElementAst(Compiler compiler,
-                                     Tracer tracer,
-                                     ConstantSystem constantSystem,
-                                     Element element,
-                                     cps_ir.FunctionDefinition function) {
+       Tracer tracer,
+       ConstantSystem constantSystem,
+       Element element,
+       cps_ir.ExecutableDefinition cpsDefinition) {
     // Transformations on the CPS IR.
     if (tracer != null) {
       tracer.traceCompilation(element.name, null);
     }
 
     void traceGraph(String title, var irObject) {
       if (tracer != null) {
         tracer.traceGraph(title, irObject);
       }
     }
 
-    new ConstantPropagator(compiler, constantSystem).rewrite(function);
-    traceGraph("Sparse constant propagation", function);
-    new RedundantPhiEliminator().rewrite(function);
-    traceGraph("Redundant phi elimination", function);
-    new ShrinkingReducer().rewrite(function);
-    traceGraph("Shrinking reductions", function);
+    new ConstantPropagator(compiler, constantSystem).rewrite(cpsDefinition);
+    traceGraph("Sparse constant propagation", cpsDefinition);
+    new RedundantPhiEliminator().rewrite(cpsDefinition);
+    traceGraph("Redundant phi elimination", cpsDefinition);
+    new ShrinkingReducer().rewrite(cpsDefinition);
+    traceGraph("Shrinking reductions", cpsDefinition);
 
     // Do not rewrite the IR after variable allocation.  Allocation
     // makes decisions based on an approximation of IR variable live
     // ranges that can be invalidated by transforming the IR.
-    new cps_ir.RegisterAllocator().visit(function);
+    new cps_ir.RegisterAllocator().visit(cpsDefinition);
 
     tree_builder.Builder builder = new tree_builder.Builder(compiler);
-    tree_ir.FunctionDefinition definition = builder.build(function);
-    assert(definition != null);
-    traceGraph('Tree builder', definition);
+    tree_ir.ExecutableDefinition treeDefinition = builder.build(cpsDefinition);
+    assert(treeDefinition != null);
+    traceGraph('Tree builder', treeDefinition);
 
     // Transformations on the Tree IR.
-    new StatementRewriter().rewrite(definition);
-    traceGraph('Statement rewriter', definition);
-    new CopyPropagator().rewrite(definition);
-    traceGraph('Copy propagation', definition);
-    new LoopRewriter().rewrite(definition);
-    traceGraph('Loop rewriter', definition);
-    new LogicalRewriter().rewrite(definition);
-    traceGraph('Logical rewriter', definition);
-    new backend_ast_emitter.UnshadowParameters().unshadow(definition);
-    traceGraph('Unshadow parameters', definition);
+    new StatementRewriter().rewrite(treeDefinition);
+    traceGraph('Statement rewriter', treeDefinition);
+    new CopyPropagator().rewrite(treeDefinition);
+    traceGraph('Copy propagation', treeDefinition);
+    new LoopRewriter().rewrite(treeDefinition);
+    traceGraph('Loop rewriter', treeDefinition);
+    new LogicalRewriter().rewrite(treeDefinition);
+    traceGraph('Logical rewriter', treeDefinition);
+    new backend_ast_emitter.UnshadowParameters().unshadow(treeDefinition);
+    traceGraph('Unshadow parameters', treeDefinition);
 
     TreeElementMapping treeElements = new TreeElementMapping(element);
-    backend_ast.Node backendAst =
-        backend_ast_emitter.emit(definition);
+    backend_ast.ExecutableDefinition backendAst =
+        backend_ast_emitter.emit(treeDefinition);
     Node frontend_ast = backend2frontend.emit(treeElements, backendAst);
     return new ElementAst.internal(frontend_ast, treeElements);
 
   }
 
   /**
    * Tells whether we should output given element. Corelib classes like
    * Object should not be in the resulting code.
    */
   @override
   bool shouldOutput(Element element) {
     return (!element.library.isPlatformLibrary &&
             !element.isSynthesized &&
             element is! AbstractFieldElement)
         || mirrorRenamer.isMirrorHelperLibrary(element.library);
   }
 
   void assembleProgram() {
 
     ElementAst computeElementAst(AstElement element) {
       if (!compiler.irBuilder.hasIr(element)) {
         return new ElementAst(element);
       } else {
-        cps_ir.FunctionDefinition function = compiler.irBuilder.getIr(element);
+        cps_ir.ExecutableDefinition definition =
+            compiler.irBuilder.getIr(element);
         return createElementAst(compiler,
-            compiler.tracer, constantSystem, element, function);
+            compiler.tracer, constantSystem, element, definition);
       }
     }
 
     // TODO(johnniwinther): Remove the need for this method.
     void postProcessElementAst(
         AstElement element, ElementAst elementAst,
         newTypedefElementCallback,
         newClassElementCallback) {
       ReferencedElementCollector collector =
           new ReferencedElementCollector(compiler,
@@ skipping 297 matching lines @@
   }
 
   ConstantExpression compileMetadata(MetadataAnnotation metadata,
                            Node node,
                            TreeElements elements) {
     return measure(() {
       return constantCompiler.compileMetadata(metadata, node, elements);
     });
   }
 }