dart2dart: Preserve variable names throughout the IR.

sdk/lib/_internal/compiler/implementation/ir/ir_builder.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_builder;
 
 import 'ir_nodes.dart' as ir;
 import '../elements/elements.dart';
 import '../dart2jslib.dart';
 import '../dart_types.dart';
@@ skipping 174 matching lines @@
   // list of references.  When the delimited subexpression is plugged into the
   // surrounding context, the free occurrences can be captured or become free
   // occurrences in the next outer delimited subexpression.
   //
   // Each nested visitor maintains a list that maps indexes of variables
   // assigned in the delimited subexpression to their reaching definition ---
   // that is, the definition in effect at the hole in 'current'.  These are
   // used to determine if a join-point continuation needs to be passed
   // arguments, and what the arguments are.
   final Map<Element, int> variableIndex;
+  final List<Element> index2variable;
   final List<ir.Parameter> freeVars;
   final List<ir.Primitive> assignedVars;
 
   /// Construct a top-level visitor.
   IrBuilder(TreeElements elements, Compiler compiler, this.sourceFile)
       : returnContinuation = new ir.Continuation.retrn(),
         parameters = <ir.Parameter>[],
         variableIndex = <Element, int>{},
         freeVars = null,
         assignedVars = <ir.Primitive>[],
+        index2variable = <Element>[],
         super(elements, compiler);
 
   /// Construct a delimited visitor.
   IrBuilder.delimited(IrBuilder parent)
       : sourceFile = parent.sourceFile,
         returnContinuation = parent.returnContinuation,
         parameters = parent.parameters,
         variableIndex = parent.variableIndex,
         freeVars = new List<ir.Parameter>.generate(
             parent.assignedVars.length, (_) => new ir.Parameter(null),
             growable: false),
         assignedVars = new List<ir.Primitive>.generate(
             parent.assignedVars.length, (_) => null),
+        index2variable = new List<Element>.from(parent.index2variable),
         super(parent.elements, parent.compiler);
 
   /**
    * Builds the [ir.FunctionDefinition] for a function element. In case the
    * function uses features that cannot be expressed in the IR, this function
    * returns `null`.
    */
   ir.FunctionDefinition buildFunction(FunctionElement functionElement) {
     return nullIfGiveup(() => buildFunctionInternal(functionElement));
   }
 
   ir.FunctionDefinition buildFunctionInternal(FunctionElement element) {
     assert(invariant(element, element.isImplementation));
     ast.FunctionExpression function = element.node;
     assert(function != null);
     assert(!function.modifiers.isExternal);
     assert(elements[function] != null);
 
     root = current = null;
 
     FunctionSignature signature = element.functionSignature;
     signature.orderedForEachParameter((parameterElement) {
       ir.Parameter parameter = new ir.Parameter(parameterElement);
       parameters.add(parameter);
       variableIndex[parameterElement] = assignedVars.length;
       assignedVars.add(parameter);
+      index2variable.add(parameterElement);
     });
 
     visit(function.body);
     ensureReturn(function);
     return new ir.FunctionDefinition(returnContinuation, parameters, root);
   }
 
   ConstantSystem get constantSystem => compiler.backend.constantSystem;
 
   bool get isOpen => root == null || current != null;
@@ skipping 85 matching lines @@
       // The last assignments, if any, reaching the end of the two subterms.
       ir.Primitive leftAssignment = leftBuilder.assignedVars[i];
       ir.Primitive rightAssignment = rightBuilder.assignedVars[i];
 
       if (leftAssignment != null || rightAssignment != null) {
         // The corresponsing argument is the reaching definition if any, or a
         // free occurrence.  In the case that control does not reach both the
         // left and right subterms we will still have a join continuation with
         // possibly arguments passed to it.  Such singly-used continuations
         // are eliminated by the shrinking conversions.
-        parameters.add(new ir.Parameter(null));
+        parameters.add(new ir.Parameter(index2variable[i]));
         ir.Primitive reachingDefinition =
             assignedVars[i] == null ? freeVars[i] : assignedVars[i];
         leftArguments.add(
             leftAssignment == null ? reachingDefinition : leftAssignment);
         rightArguments.add(
             rightAssignment == null ? reachingDefinition : rightAssignment);
       }
     }
     return parameters;
   }
@@ skipping 29 matching lines @@
     for (int i = 0; i < assignedVars.length; ++i) {
       // Was there an assignment in the body?
       ir.Definition reachingAssignment = bodyBuilder.assignedVars[i];
       // If not, was there an assignment in the condition?
       if (reachingAssignment == null) {
         reachingAssignment = condBuilder.assignedVars[i];
       }
       // If not, no value needs to be passed to the join point.
       if (reachingAssignment == null) continue;
 
-      parameters.add(new ir.Parameter(null));
+      parameters.add(new ir.Parameter(index2variable[i]));
       ir.Definition entryAssignment = assignedVars[i];
       entryArguments.add(
           entryAssignment == null ? freeVars[i] : entryAssignment);
       loopArguments.add(reachingAssignment);
     }
     return parameters;
   }
 
   /// Capture free variables in the arms of a branch.
   ///
@@ skipping 212 matching lines @@
   ir.Primitive visitVariableDefinitions(ast.VariableDefinitions node) {
     assert(isOpen);
     for (ast.Node definition in node.definitions.nodes) {
       Element element = elements[definition];
       // Definitions are either SendSets if there is an initializer, or
       // Identifiers if there is no initializer.
       if (definition is ast.SendSet) {
         assert(!definition.arguments.isEmpty);
         assert(definition.arguments.tail.isEmpty);
         ir.Primitive initialValue = visit(definition.arguments.head);
+        // In case a primitive was introduced for the initializer expression,
+        // use this variable element to help derive a good name for it.
+        initialValue.useElementAsHint(element);
         variableIndex[element] = assignedVars.length;
         assignedVars.add(initialValue);
+        index2variable.add(element);
       } else {
         assert(definition is ast.Identifier);
         // The initial value is null.
         // TODO(kmillikin): Consider pooling constants.
         ir.Constant constant = new ir.Constant(constantSystem.createNull());
+        constant.useElementAsHint(element);
         add(new ir.LetPrim(constant));
         variableIndex[element] = assignedVars.length;
         assignedVars.add(constant);
+        index2variable.add(element);
       }
     }
     return null;
   }
 
   // Build(Return(e), C) = C'[InvokeContinuation(return, x)]
   //   where (C', x) = Build(e, C)
   //
   // Return without a subexpression is translated as if it were return null.
   ir.Primitive visitReturn(ast.Return node) {
@@ skipping 435 matching lines @@
     Element element = elements[node];
     ast.Operator op = node.assignmentOperator;
     ir.Primitive result;
     ir.Primitive getter;
     if (op.source == '=') {
       if (Elements.isLocal(element)) {
         // Exactly one argument expected for a simple assignment.
         assert(!node.arguments.isEmpty);
         assert(node.arguments.tail.isEmpty);
         result = visit(node.arguments.head);
+        result.useElementAsHint(element);
         assignedVars[variableIndex[element]] = result;
         return result;
       } else if (Elements.isStaticOrTopLevel(element)) {
         assert(element.isField || element.isSetter);
         assert(!node.arguments.isEmpty && node.arguments.tail.isEmpty);
         ir.Parameter v = new ir.Parameter(null);
         ir.Continuation k = new ir.Continuation([v]);
         Selector selector = elements.getSelector(node);
         ir.Definition arg = visit(node.arguments.head);
         ir.InvokeStatic invoke =
@@ skipping 36 matching lines @@
       ir.Primitive arg;
       if (ast.Operator.INCREMENT_OPERATORS.contains(op.source)) {
         assert(node.arguments.isEmpty);
         arg = new ir.Constant(constantSystem.createInt(1));
         add(new ir.LetPrim(arg));
       } else {
         assert(!node.arguments.isEmpty);
         assert(node.arguments.tail.isEmpty);
         arg = visit(node.arguments.head);
       }
+      arg.useElementAsHint(element);
       result = new ir.Parameter(null);
       ir.Continuation k = new ir.Continuation([result]);
       ir.Expression invoke = new ir.InvokeMethod(getter, selector, k, [arg]);
       add(new ir.LetCont(k, invoke));
 
       assignedVars[variableIndex[element]] = result;
 
       if (ast.Operator.INCREMENT_OPERATORS.contains(op.source) &&
           !node.isPrefix) {
         assert(getter != null);
@@ skipping 118 matching lines @@
   bool visitType(DartType type, Null _) => false;
 
   bool visitDynamicType(DynamicType type, Null _) => true;
 
   bool visitVoidType(VoidType type, Null _) => true;
 
   // Currently, InterfaceType and TypedefType are supported so long as they
   // do not have type parameters.  They are subclasses of GenericType.
   bool visitGenericType(GenericType type, Null _) => !type.isGeneric;
 }