Create a Tree IR builder for JavaScript specific nodes.

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 145 matching lines @@
     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(cpsDefinition);
 
     tree_builder.Builder builder = new tree_builder.Builder(
-        new Glue(compiler), compiler.internalError, compiler.identicalFunction);
+        compiler.internalError, compiler.identicalFunction);
     tree_ir.ExecutableDefinition treeDefinition = builder.build(cpsDefinition);
     assert(treeDefinition != null);
     traceGraph('Tree builder', treeDefinition);
 
     // Transformations on the Tree IR.
     new StatementRewriter().rewrite(treeDefinition);
     traceGraph('Statement rewriter', treeDefinition);
     new CopyPropagator().rewrite(treeDefinition);
     traceGraph('Copy propagation', treeDefinition);
     new LoopRewriter().rewrite(treeDefinition);
@@ skipping 344 matching lines @@
   }
 
   ConstantExpression compileMetadata(MetadataAnnotation metadata,
                            Node node,
                            TreeElements elements) {
     return measure(() {
       return constantCompiler.compileMetadata(metadata, node, elements);
     });
   }
 }