// 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.

class SsaCodeGeneratorTask extends CompilerTask {
  final JavaScriptBackend backend;
  SsaCodeGeneratorTask(JavaScriptBackend backend)
      : this.backend = backend,
        super(backend.compiler);
  String get name() => 'SSA code generator';
  NativeEmitter get nativeEmitter() => backend.emitter.nativeEmitter;


  CodeBlock buildJavaScriptFunction(FunctionElement element,
                                    String parameters,
                                    String body) {
    String extraSpace = "";
    // Members are emitted inside a JavaScript object literal. To line up the
    // indentation we want the closing curly brace to be indented by one space.
    // Example:
    // defineClass("A", "B", ... , {
    //  foo$1: function(..) {
    //  },  /* <========== indent by 1. */
    //  bar$2: function(..) {
    //  },  /* <========== indent by 1. */
    //
    // For static functions this is not necessary:
    // $.staticFun = function() {
    //   ...
    // };
    if (element.isInstanceMember() ||
        element.kind == ElementKind.GENERATIVE_CONSTRUCTOR_BODY) {
      extraSpace = " ";
    }

    String code = 'function($parameters) {\n$body$extraSpace}';
    List<SourceMappingEntry> sourceMappings = new List<SourceMappingEntry>();
    SourceFile sourceFile = element.getCompilationUnit().script.file;
    FunctionExpression expression = element.cachedNode;
    sourceMappings.add(new SourceMappingEntry(
      sourceFile, expression.getBeginToken().charOffset, 0));
    sourceMappings.add(new SourceMappingEntry(
      sourceFile, expression.getEndToken().charOffset, code.length - 1));
    return new CodeBlock(code, sourceMappings);
  }

  CodeBlock generateMethod(WorkItem work, HGraph graph) {
    return measure(() {
      compiler.tracer.traceGraph("codegen", graph);
      Map<Element, String> parameterNames = getParameterNames(work);
      parameterNames.forEach((element, name) {
        compiler.enqueuer.codegen.addToWorkList(element);
      });
      String parameters = Strings.join(parameterNames.getValues(), ', ');
      SsaOptimizedCodeGenerator codegen = new SsaOptimizedCodeGenerator(
          backend, work, parameters, parameterNames);
      codegen.visitGraph(graph);

      FunctionElement element = work.element;
      String code;
      if (element.isInstanceMember()
          && element.enclosingElement.isClass()
          && element.enclosingElement.isNative()
          && native.isOverriddenMethod(
              element, element.enclosingElement, nativeEmitter)) {
        // Record that this method is overridden. In case of optional
        // arguments, the emitter will generate stubs to handle them,
        // and needs to know if the method is overridden.
        nativeEmitter.overriddenMethods.add(element);
        StringBuffer buffer = new StringBuffer();
        native.generateMethodWithPrototypeCheckForElement(
            compiler, buffer, element, '${codegen.buffer}', parameters);
        code = buffer.toString();
      } else {
        code = codegen.buffer.toString();
      }
      return buildJavaScriptFunction(element, parameters, code);
    });
  }

  CodeBlock generateBailoutMethod(WorkItem work, HGraph graph) {
    return measure(() {
      compiler.tracer.traceGraph("codegen-bailout", graph);

      Map<Element, String> parameterNames = getParameterNames(work);
      String parameters = Strings.join(parameterNames.getValues(), ', ');
      SsaUnoptimizedCodeGenerator codegen = new SsaUnoptimizedCodeGenerator(
          backend, work, parameters, parameterNames);
      codegen.visitGraph(graph);

      String body = '${codegen.setup}${codegen.buffer}';
      return buildJavaScriptFunction(
          work.element, codegen.newParameters.toString(), body);
    });
  }

  Map<Element, String> getParameterNames(WorkItem work) {
    Map<Element, String> parameterNames = new LinkedHashMap<Element, String>();
    FunctionElement function = work.element;

    // The dom/html libraries have inline JS code that reference
    // parameter names directly. Long-term such code will be rejected.
    // Now, just don't mangle the parameter name.
    function.computeSignature(compiler).forEachParameter((Element element) {
      parameterNames[element] = function.isNative()
          ? element.name.slowToString()
          : JsNames.getValid('${element.name.slowToString()}');
    });
    return parameterNames;
  }
}

typedef void ElementAction(Element element);

class SsaCodeGenerator implements HVisitor, HBlockInformationVisitor {
  /**
   * Current state for generating simple (non-local-control) code.
   * It is generated as either statements (indented and ';'-terminated),
   * expressions (comma separated) or declarations (also comma separated,
   * but expected to be preceeded by a 'var' so it declares its variables);
   */
  static final int STATE_STATEMENT = 0;
  static final int STATE_FIRST_EXPRESSION = 1;
  static final int STATE_FIRST_DECLARATION = 2;
  static final int STATE_EXPRESSION = 3;
  static final int STATE_DECLARATION = 4;

  /**
   * When analyzing a [HStatementGraph] we try to recognize if it has
   * the following properties.
   */
  static final int ONE_STATEMENT = 0;
  static final int ONE_EXPRESSION = 1;
  static final int EMPTY = 2;
  static final int MULTIPLE_STATEMENTS = 3;

  /**
   * Returned by [expressionType] to tell how code can be generated for
   * a subgraph.
   * - [TYPE_STATEMENT] means that the graph must be generated as a statement,
   * which is always possible.
   * - [TYPE_EXPRESSION] means that the graph can be generated as an expression,
   * or possibly several comma-separated expressions.
   * - [TYPE_DECLARATION] means that the graph can be generated as an
   * expression, and that it only generates expressions of the form
   *   variable = expression
   * which are also valid as parts of a "var" declaration.
   */
  static final int TYPE_STATEMENT = 0;
  static final int TYPE_EXPRESSION = 1;
  static final int TYPE_DECLARATION = 2;

  final JavaScriptBackend backend;
  final WorkItem work;
  final StringBuffer buffer;
  final String parameters;

  final Set<HInstruction> generateAtUseSite;
  final Set<HInstruction> controlFlowOperators;
  final Map<Element, ElementAction> breakAction;
  final Map<Element, ElementAction> continueAction;
  final Map<Element, String> parameterNames;

  /**
   * Contains the names of the instructions, as well as the parallel
   * copies to perform on block transitioning.
   */
  VariableNames variableNames;

  /**
   * While generating expressions, we can't insert variable declarations.
   * Instead we declare them at the end of the function
   */
  final Set<String> delayedVariableDeclarations;

  /**
   * Set of variables that have already been declared.
   */
  final Set<String> declaredVariables;

  Element equalsNullElement;
  Element boolifiedEqualsNullElement;
  int indent = 0;
  int expectedPrecedence = JSPrecedence.STATEMENT_PRECEDENCE;
  JSBinaryOperatorPrecedence unsignedShiftPrecedences;
  HGraph currentGraph;
  /**
   * Whether the code-generation should try to generate an expression
   * instead of a sequence of statements.
   */
  int generationState = STATE_STATEMENT;
  HBasicBlock currentBlock;

  // Records a block-information that is being handled specially.
  // Used to break bad recursion.
  HBlockInformation currentBlockInformation;
  // The subgraph is used to delimit traversal for some constructions, e.g.,
  // if branches.
  SubGraph subGraph;

  LibraryElement get currentLibrary() => work.element.getLibrary();
  Compiler get compiler() => backend.compiler;
  NativeEmitter get nativeEmitter() => backend.emitter.nativeEmitter;
  Enqueuer get world() => backend.compiler.enqueuer.codegen;

  bool isGenerateAtUseSite(HInstruction instruction) {
    return generateAtUseSite.contains(instruction);
  }

  bool isNonNegativeInt32Constant(HInstruction instruction) {
    if (instruction.isConstantInteger()) {
      int value = instruction.constant.value;
      if (value >= 0 && value < (1 << 31)) {
        return true;
      }
    }
    return false;
  }

  bool hasNonBitOpUser(HInstruction instruction, Set<HPhi> phiSet) {
    for (HInstruction use in instruction.usedBy) {
      if (use is HPhi) {
        if (!phiSet.contains(use)) {
          phiSet.add(use);
          if (hasNonBitOpUser(use, phiSet)) return true;
        }
      } else if (use is! HBitNot && use is! HBinaryBitOp) {
        return true;
      }
    }
    return false;
  }

  // We want the outcome of bit-operations to be positive. However, if
  // the result of a bit-operation is only used by other bit
  // operations we do not have to convert to an unsigned
  // integer. Also, if we are using & with a positive constant we know
  // that the result is positive already and need no conversion.
  bool requiresUintConversion(HInstruction instruction) {
    if (instruction is HBitAnd &&
        (isNonNegativeInt32Constant(instruction.left) ||
         isNonNegativeInt32Constant(instruction.right))) {
      return false;
    }
    return hasNonBitOpUser(instruction, new Set<HPhi>());
  }

  SsaCodeGenerator(this.backend,
                   this.work,
                   this.parameters,
                   this.parameterNames)
    : declaredVariables = new Set<String>(),
      delayedVariableDeclarations = new Set<String>(),
      buffer = new StringBuffer(),
      generateAtUseSite = new Set<HInstruction>(),
      controlFlowOperators = new Set<HInstruction>(),
      breakAction = new Map<Element, ElementAction>(),
      continueAction = new Map<Element, ElementAction>(),
      unsignedShiftPrecedences = JSPrecedence.binary['>>>'] {
  }

  abstract visitTypeGuard(HTypeGuard node);

  abstract beginGraph(HGraph graph);
  abstract endGraph(HGraph graph);

  abstract beginLoop(HBasicBlock block);
  abstract endLoop(HBasicBlock block);
  abstract handleLoopCondition(HLoopBranch node);

  abstract preLabeledBlock(HLabeledBlockInformation labeledBlockInfo);
  abstract startLabeledBlock(HLabeledBlockInformation labeledBlockInfo);
  abstract endLabeledBlock(HLabeledBlockInformation labeledBlockInfo);

  void beginExpression(int precedence) {
    if (precedence < expectedPrecedence) {
      buffer.add('(');
    }
  }

  void endExpression(int precedence) {
    if (precedence < expectedPrecedence) {
      buffer.add(')');
    }
  }

  void withPrecedence(int precedence, void action()) {
    int oldPrecedence = expectedPrecedence;
    beginExpression(precedence);
    expectedPrecedence = precedence;
    action();
    expectedPrecedence = oldPrecedence;
    endExpression(precedence);
  }

  void preGenerateMethod(HGraph graph) {
    new SsaInstructionMerger(generateAtUseSite).visitGraph(graph);
    new SsaConditionMerger(generateAtUseSite,
                           controlFlowOperators).visitGraph(graph);
    SsaLiveIntervalBuilder intervalBuilder =
        new SsaLiveIntervalBuilder(compiler, generateAtUseSite);
    intervalBuilder.visitGraph(graph);
    SsaVariableAllocator allocator = new SsaVariableAllocator(
        compiler,
        intervalBuilder.liveInstructions,
        intervalBuilder.liveIntervals,
        generateAtUseSite,
        parameterNames);
    allocator.visitGraph(graph);
    variableNames = allocator.names;
  }

  visitGraph(HGraph graph) {
    preGenerateMethod(graph);
    currentGraph = graph;
    indent++;  // We are already inside a function.
    subGraph = new SubGraph(graph.entry, graph.exit);
    HBasicBlock start = beginGraph(graph);
    visitBasicBlock(start);
    if (!delayedVariableDeclarations.isEmpty()) {
      addIndented("var ");
      buffer.add(Strings.join(
          new List<String>.from(delayedVariableDeclarations), ', '));
      buffer.add(";\n");
    }
    endGraph(graph);
  }

  void visitSubGraph(SubGraph newSubGraph) {
    SubGraph oldSubGraph = subGraph;
    subGraph = newSubGraph;
    visitBasicBlock(subGraph.start);
    subGraph = oldSubGraph;
  }

  /**
   * Check whether a sub-graph can be generated as an expression, or even
   * as a declaration, or if it has to fall back to being generated as
   * a statement.
   * Expressions are anything that doesn't generate control flow constructs.
   * Declarations must only generate assignments on the form "id = expression",
   * and not, e.g., expressions where the value isn't assigned, or where it's
   * assigned to something that's not a simple variable.
   */
  int expressionType(HExpressionInformation info) {
    // The only HExpressionInformation used as part of a HBlockInformation is
    // current HSubExpressionBlockInformation, so it's the only one reaching
    // here. If we start using the other HExpressionInformation types too,
    // this code should be generalized.
    assert(info is HSubExpressionBlockInformation);
    HSubExpressionBlockInformation expressionInfo = info;
    SubGraph limits = expressionInfo.subExpression;

    // Start assuming that we can generate declarations. If we find a
    // counter-example, we degrade our assumption to either expression or
    // statement, and in the latter case, we can return immediately since
    // it can't get any worse. E.g., a function call where the return value
    // isn't used can't be in a declaration. A bailout can't be in an
    // expression.
    int result = TYPE_DECLARATION;
    HBasicBlock basicBlock = limits.start;
    do {
      HInstruction current = basicBlock.first;
      while (current != basicBlock.last) {
        // E.g, type guards.
        if (current.isControlFlow()) {
          return TYPE_STATEMENT;
        }
        // HFieldSet generates code on the form x.y = ..., which isn't
        // valid in a declaration, but it also always have no uses, so
        // it's caught by that test too.
        assert(current is! HFieldSet || current.usedBy.isEmpty());
        if (current.usedBy.isEmpty()) {
          result = TYPE_EXPRESSION;
        }
        current = current.next;
      }
      if (current is HGoto) {
        basicBlock = basicBlock.successors[0];
      } else if (current is HConditionalBranch) {
        if (generateAtUseSite.contains(current)) {
          // Short-circuit control flow operator trickery.
          // Check the second half, which will continue into the join.
          // (The first half is [inputs[0]], the second half is [successors[0]],
          // and [successors[1]] is the join-block).
          basicBlock = basicBlock.successors[0];
        } else {
          // We allow an expression to end on an HIf (a condition expression).
          return basicBlock === limits.end ? result : TYPE_STATEMENT;
        }
      } else {
        // Expression-incompatible control flow.
        return TYPE_STATEMENT;
      }
    } while (limits.contains(basicBlock));
    return result;
  }

  bool isJSExpression(HExpressionInformation info) {
    return expressionType(info) !== TYPE_STATEMENT;
  }

  bool isJSDeclaration(HExpressionInformation info) {
    return expressionType(info) === TYPE_DECLARATION;
  }

  bool isJSCondition(HExpressionInformation info) {
    HSubExpressionBlockInformation graph = info;
    SubExpression limits = graph.subExpression;
    return expressionType(info) !== TYPE_STATEMENT &&
       (limits.end.last is HConditionalBranch);
  }

  /**
   * Generate statements from block information.
   * If the block information contains expressions, generate only
   * assignments, and if it ends in a conditional branch, don't generate
   * the condition.
   */
  void generateStatements(HBlockInformation block) {
    int oldState = generationState;
    generationState = STATE_STATEMENT;
    if (block is HStatementInformation) {
      block.accept(this);
    } else {
      HSubExpressionBlockInformation expression = block;
      visitSubGraph(expression.subExpression);
    }
    generationState = oldState;
  }

  /**
   * Generate expressions from block information.
   */
  void generateExpression(HExpressionInformation expression) {
    // Currently we only handle sub-expression graphs.
    assert(expression is HSubExpressionBlockInformation);
    // [visitSubGraph] will reset the [expectedPrecedence]. Make sure we don't
    // need parenthesis. I.e., this only expects to be called for top-level
    // expressions, not sub-expressions.
    assert(expectedPrecedence == JSPrecedence.STATEMENT_PRECEDENCE
        || expectedPrecedence == JSPrecedence.EXPRESSION_PRECEDENCE);

    HSubExpressionBlockInformation expressionSubGraph = expression;

    int oldState = generationState;
    generationState = STATE_FIRST_EXPRESSION;
    visitSubGraph(expressionSubGraph.subExpression);
    generationState = oldState;
  }

  void generateDeclaration(HExpressionInformation expression) {
    // Currently we only handle sub-expression graphs.
    assert(expression is HSubExpressionBlockInformation);
    HSubExpressionBlockInformation expressionSubGraph = expression;

    int oldState = generationState;
    generationState = STATE_FIRST_DECLARATION;
    visitSubGraph(expressionSubGraph.subExpression);
    generationState = oldState;
  }

  void generateCondition(HBlockInformation condition) {
    generateExpression(condition);
  }

  /**
    * Only visits the arguments starting at inputs[HInvoke.ARGUMENTS_OFFSET].
    */
  void visitArguments(List<HInstruction> inputs) {
    assert(inputs.length >= HInvoke.ARGUMENTS_OFFSET);
    buffer.add('(');
    for (int i = HInvoke.ARGUMENTS_OFFSET; i < inputs.length; i++) {
      if (i != HInvoke.ARGUMENTS_OFFSET) buffer.add(', ');
      use(inputs[i], JSPrecedence.ASSIGNMENT_PRECEDENCE);
    }
    buffer.add(')');
  }

  /**
   * Whether we are currently generating expressions instead of statements.
   * This includes declarations, which are generated as expressions.
   */
  bool isGeneratingExpression() {
    return generationState != STATE_STATEMENT;
  }

  /**
   * Whether we are generating a declaration.
   */
  bool isGeneratingDeclaration() {
    return (generationState == STATE_DECLARATION ||
            generationState == STATE_FIRST_DECLARATION);
  }

  /**
   * Called before writing an expression.
   * Ensures that expressions are comma spearated.
   */
  void addExpressionSeparator() {
    if (generationState == STATE_FIRST_EXPRESSION) {
      generationState = STATE_EXPRESSION;
    } else if (generationState != STATE_FIRST_DECLARATION) {
      buffer.add(", ");
    }
    // If the state is [STATE_FIRST_DECLARATION] the potential
    // declaration of the variable will be done by the instruction.
  }

  bool isVariableDeclared(String variableName) {
    return declaredVariables.contains(variableName);
  }

  void declareVariable(String variableName) {
    if (isGeneratingExpression()) {
      if (generationState == STATE_FIRST_DECLARATION) {
        if (!isVariableDeclared(variableName)) {
          declaredVariables.add(variableName);
          buffer.add("var ");
          generationState = STATE_DECLARATION;
        } else {
          generationState = STATE_EXPRESSION;
        }

      } else if (!isVariableDeclared(variableName)) {
        if (!isGeneratingDeclaration()) {
          delayedVariableDeclarations.add(variableName);
        }
        // No matter if we are declaring the variable now or if we are
        // delaying the declaration we can treat the variable as
        // being declared from this point on.
        declaredVariables.add(variableName);
      }
    } else if (!isVariableDeclared(variableName)) {
      declaredVariables.add(variableName);
      buffer.add("var ");
    }
    buffer.add(variableName);
  }

  void declareInstruction(HInstruction instruction) {
    declareVariable(variableNames.getName(instruction));
  }

  // For simple updates of the form 'i = i op constant' generate
  // 'i op= constant' instead.
  bool handleSimpleUpdateDefinition(HInstruction instruction, String name) {
    // If the variable is not declared the short update syntax cannot
    // be used since it is a declaration and not an update.
    if (!isVariableDeclared(name)) return false;

    // Check that the operation is one of +, *, - or /. Record whether
    // or not the operation is commutative.
    var isCommutative = false;
    if (instruction is HAdd || instruction is HMultiply) {
      isCommutative = true;
    } else if (instruction is !HSubtract && instruction is !HDivide) {
      return false;
    }

    // Is it a builtin operation involving +, -, /, or *?
    HBinaryArithmetic binaryInstruction = instruction;
    assert(binaryInstruction.inputs.length == 3);
    if (binaryInstruction.builtin) {
      var left = binaryInstruction.left;
      var right = binaryInstruction.right;
      if (isCommutative && variableNames.getName(right) == name) {
        var tmp = right;
        right = left;
        left = tmp;
      }

      // Check that left has the same name as the definition and emit
      // the short update definition if it is.
      if (variableNames.getName(left) == name) {
        // Check if the right operand is constant one.
        bool rightIsOne = false;
        if (right.isConstantNumber()) {
          HConstant rightConstant = right;
          NumConstant numConstant = rightConstant.constant;
          rightIsOne = (numConstant.value == 1);
        }
        if (binaryInstruction is HAdd && rightIsOne) {
          beginExpression(JSPrecedence.PREFIX_PRECEDENCE);
          buffer.add('++');
          declareVariable(name);
          endExpression(JSPrecedence.PREFIX_PRECEDENCE);
        } else if (binaryInstruction is HSubtract && rightIsOne) {
          beginExpression(JSPrecedence.PREFIX_PRECEDENCE);
          buffer.add('--');
          declareVariable(name);
          endExpression(JSPrecedence.PREFIX_PRECEDENCE);
        } else {
          var operation = binaryInstruction.operation.name;
          beginExpression(JSPrecedence.ASSIGNMENT_PRECEDENCE);
          declareVariable(name);
          buffer.add(' ${operation}= ');
          use(right, JSPrecedence.ASSIGNMENT_PRECEDENCE);
          endExpression(JSPrecedence.ASSIGNMENT_PRECEDENCE);
        }
        return true;
      }
    }
    return false;
  }

  // For simple type checks like i = intTypeCheck(i), we don't have to
  // emit an assignment, because the intTypeCheck just returns its
  // argument.
  bool handleTypeConversion(instruction, name) {
    if (instruction is !HTypeConversion) return false;
    String inputName = variableNames.getName(instruction.checkedInput);
    if (name != inputName) return false;
    visit(instruction, JSPrecedence.STATEMENT_PRECEDENCE);
    return true;
  }

  void define(HInstruction instruction) {
    if (isGeneratingExpression()) {
      addExpressionSeparator();
    } else {
      assert(expectedPrecedence == JSPrecedence.STATEMENT_PRECEDENCE);
      addIndentation();
    }
    if (!instruction.isControlFlow() && variableNames.hasName(instruction)) {
      var name = variableNames.getName(instruction);
      if (!handleSimpleUpdateDefinition(instruction, name)
          && !handleTypeConversion(instruction, name)) {
        withPrecedence(JSPrecedence.ASSIGNMENT_PRECEDENCE, () {
          declareInstruction(instruction);
          buffer.add(" = ");
          visit(instruction, JSPrecedence.ASSIGNMENT_PRECEDENCE);
        });
      }
    } else {
      visit(instruction, expectedPrecedence);
    }
    if (!isGeneratingExpression()) buffer.add(';\n');
  }

  void use(HInstruction argument, int expectedPrecedenceForArgument) {
    if (isGenerateAtUseSite(argument)) {
      visit(argument, expectedPrecedenceForArgument);
    } else if (argument is HCheck && argument.isControlFlow()) {
      // A [HCheck] that has control flow can never be used as an
      // expression and may not have a name. Therefore we just use the
      // checked instruction.
      HCheck check = argument;
      use(check.checkedInput, expectedPrecedenceForArgument);
    } else {
      buffer.add(variableNames.getName(argument));
    }
  }

  visit(HInstruction node, int expectedPrecedenceForNode) {
    int oldPrecedence = this.expectedPrecedence;
    this.expectedPrecedence = expectedPrecedenceForNode;
    node.accept(this);
    this.expectedPrecedence = oldPrecedence;
  }

  void continueAsBreak(LabelElement target) {
    addIndented("break ");
    writeContinueLabel(target);
    buffer.add(";\n");
  }

  void implicitContinueAsBreak(TargetElement target) {
    addIndented("break ");
    writeImplicitContinueLabel(target);
    buffer.add(";\n");
  }

  void implicitBreakWithLabel(TargetElement target) {
    addIndented("break ");
    writeImplicitLabel(target);
    buffer.add(";\n");
  }

  // The regular [visitIf] method implements the needed logic.
  bool visitIfInfo(HIfBlockInformation info) => false;

  bool visitSwitchInfo(HSwitchBlockInformation info) {
    bool isExpression = isJSExpression(info.expression);
    if (!isExpression) {
      generateStatements(info.expression);
    }
    addIndentation();
    for (LabelElement label in info.labels) {
      if (label.isTarget) {
        writeLabel(label);
        buffer.add(":");
      }
    }
    buffer.add("switch (");
    if (isExpression) {
      generateExpression(info.expression);
    } else {
      use(info.expression.conditionExpression,
          JSPrecedence.EXPRESSION_PRECEDENCE);
    }
    buffer.add(") {\n");
    indent++;
    for (int i = 0; i < info.matchExpressions.length; i++) {
      for (Constant constant in info.matchExpressions[i]) {
        addIndented("case ");
        generateConstant(constant);
        buffer.add(":\n");
      }
      if (i == info.matchExpressions.length - 1 && info.hasDefault) {
        addIndented("default:\n");
      }
      indent++;
      generateStatements(info.statements[i]);
      indent--;
    }
    indent--;
    addIndented("}\n");
    return true;
  }

  bool visitSequenceInfo(HStatementSequenceInformation info) {
    return false;
  }

  bool visitSubGraphInfo(HSubGraphBlockInformation info) {
    visitSubGraph(info.subGraph);
    return true;
  }

  bool visitSubExpressionInfo(HSubExpressionBlockInformation info) {
    return false;
  }

  bool visitAndOrInfo(HAndOrBlockInformation info) {
    return false;
  }

  bool visitTryInfo(HTryBlockInformation info) {
    addIndented("try {\n");
    indent++;
    generateStatements(info.body);
    indent--;
    addIndented("}");
    if (info.catchBlock !== null) {
      // Printing the catch part.
      HParameterValue exception = info.catchVariable;
      String name = variableNames.getName(exception);
      parameterNames[exception.sourceElement] = name;
      buffer.add(' catch ($name) {\n');
      indent++;
      generateStatements(info.catchBlock);
      parameterNames.remove(exception.sourceElement);
      indent--;
      addIndented('}');
    }
    if (info.finallyBlock != null) {
      buffer.add(" finally {\n");
      indent++;
      generateStatements(info.finallyBlock);
      indent--;
      addIndented("}");
    }
    buffer.add("\n");
    return true;
  }

  void visitBodyIgnoreLabels(HLoopBlockInformation info) {
    if (info.body.start.isLabeledBlock()) {
      HBlockInformation oldInfo = currentBlockInformation;
      currentBlockInformation = info.body.start.blockFlow.body;
      generateStatements(info.body);
      currentBlockInformation = oldInfo;
    } else {
      generateStatements(info.body);
    }
  }

  bool visitLoopInfo(HLoopBlockInformation info) {
    HExpressionInformation condition = info.condition;
    bool isConditionExpression = isJSCondition(condition);

    switch (info.kind) {
      // Treate all three "test-first" loops the same way.
      case HLoopBlockInformation.FOR_LOOP:
      case HLoopBlockInformation.WHILE_LOOP:
      case HLoopBlockInformation.FOR_IN_LOOP: {
        HBlockInformation initialization = info.initializer;
        int initializationType = TYPE_STATEMENT;
        if (initialization !== null) {
          initializationType = expressionType(initialization);
          if (initializationType == TYPE_STATEMENT) {
            generateStatements(initialization);
            initialization = null;
          }
        }
        for (LabelElement label in info.labels) {
          if (label.isTarget) {
            writeLabel(label);
            buffer.add(":");
          }
        }
        if (isConditionExpression &&
            info.updates !== null && isJSExpression(info.updates)) {
          // If we have an updates graph, and it's expressible as an
          // expression, generate a for-loop.
          addIndented("for (");
          if (initialization !== null) {
            if (initializationType != TYPE_DECLARATION) {
              generateExpression(initialization);
            } else {
              generateDeclaration(initialization);
            }
          }
          buffer.add("; ");
          generateCondition(condition);
          buffer.add("; ");
          generateExpression(info.updates);
          buffer.add(") {\n");
          indent++;
          // The body might be labeled. Ignore this when recursing on the
          // subgraph.
          // TODO(lrn): Remove this extra labeling when handling all loops
          // using subgraphs.
          visitBodyIgnoreLabels(info);

          indent--;
        } else {
          // We have either no update graph, or it's too complex to
          // put in an expression.
          if (initialization !== null) {
            generateStatements(initialization);
          }
          addIndented("while (");
          if (isConditionExpression) {
            generateCondition(condition);
            buffer.add(") {\n");
            indent++;
          } else {
            buffer.add("true) {\n");
            indent++;
            generateStatements(condition);
            addIndented("if (!");
            use(condition.conditionExpression, JSPrecedence.PREFIX_PRECEDENCE);
            buffer.add(") break;\n");
          }
          if (info.updates !== null) {
            wrapLoopBodyForContinue(info);
            generateStatements(info.updates);
          } else {
            visitBodyIgnoreLabels(info);
          }
          indent--;
        }
        addIndented("}\n");
        break;
      }
      case HLoopBlockInformation.DO_WHILE_LOOP: {
        // Generate do-while loop in all cases.
        if (info.initializer !== null) {
          generateStatements(info.initializer);
        }
        addIndentation();
        for (LabelElement label in info.labels) {
          if (label.isTarget) {
            writeLabel(label);
            buffer.add(":");
          }
        }
        buffer.add("do {\n");
        indent++;
        if (!isConditionExpression || info.updates !== null) {
          wrapLoopBodyForContinue(info);
        } else {
          visitBodyIgnoreLabels(info);
        }
        if (info.updates !== null) {
          generateStatements(info.updates);
        }
        if (isConditionExpression) {
          indent--;
          addIndented("} while (");
          generateExpression(condition);
          buffer.add(");\n");
        } else {
          generateStatements(condition);
          indent--;
          addIndented("} while (");
          use(condition.conditionExpression, JSPrecedence.PREFIX_PRECEDENCE);
          buffer.add(");\n");
        }
        break;
      }
      default:
        compiler.internalError(
          'Unexpected loop kind: ${info.kind}',
          instruction: condition.conditionExpression);
    }
    return true;
  }

  bool visitLabeledBlockInfo(HLabeledBlockInformation labeledBlockInfo) {
    preLabeledBlock(labeledBlockInfo);
    addIndentation();
    Link<Element> continueOverrides = const EmptyLink<Element>();
    // If [labeledBlockInfo.isContinue], the block is an artificial
    // block around the body of a loop with an update block, so that
    // continues of the loop can be written as breaks of the body
    // block.
    if (labeledBlockInfo.isContinue) {
      for (LabelElement label in labeledBlockInfo.labels) {
        if (label.isContinueTarget) {
          writeContinueLabel(label);
          buffer.add(':');
          continueAction[label] = continueAsBreak;
          continueOverrides = continueOverrides.prepend(label);
        }
      }
      // For handling unlabeled continues from the body of a loop.
      // TODO(lrn): Consider recording whether the target is in fact
      // a target of an unlabeled continue, and not generate this if it isn't.
      TargetElement target = labeledBlockInfo.target;
      writeImplicitContinueLabel(target);
      buffer.add(':');
      continueAction[target] = implicitContinueAsBreak;
      continueOverrides = continueOverrides.prepend(target);
    } else {
      for (LabelElement label in labeledBlockInfo.labels) {
        if (label.isBreakTarget) {
          writeLabel(label);
          buffer.add(':');
        }
      }
      TargetElement target = labeledBlockInfo.target;
      if (target.isSwitch) {
        // This is an extra block around a switch that is generated
        // as a nested if/else chain. We add an extra break target
        // so that case code can break.
        writeImplicitLabel(target);
        buffer.add(':');
        breakAction[target] = implicitBreakWithLabel;
      }
    }
    buffer.add('{\n');
    indent++;

    startLabeledBlock(labeledBlockInfo);
    generateStatements(labeledBlockInfo.body);
    endLabeledBlock(labeledBlockInfo);

    indent--;
    addIndented('}\n');

    if (labeledBlockInfo.isContinue) {
      while (!continueOverrides.isEmpty()) {
        continueAction.remove(continueOverrides.head);
        continueOverrides = continueOverrides.tail;
      }
    } else {
      breakAction.remove(labeledBlockInfo.target);
    }
    return true;
  }

  // Wraps a loop body in a block to make continues have a target to break
  // to (if necessary).
  void wrapLoopBodyForContinue(HLoopBlockInformation info) {
    TargetElement target = info.target;
    if (target !== null && target.isContinueTarget) {
      addIndentation();
      for (LabelElement label in info.labels) {
        if (label.isContinueTarget) {
          writeContinueLabel(label);
          buffer.add(":");
          continueAction[label] = continueAsBreak;
        }
      }
      writeImplicitContinueLabel(target);
      buffer.add(":{\n");
      continueAction[info.target] = implicitContinueAsBreak;
      indent++;
      visitBodyIgnoreLabels(info);
      indent--;
      addIndented("}\n");
      continueAction.remove(info.target);
      for (LabelElement label in info.labels) {
        if (label.isContinueTarget) {
          continueAction.remove(label);
        }
      }
    } else {
      // Loop body contains no continues, so we don't need a break target.
      generateStatements(info.body);
    }
  }

  bool handleBlockFlow(HBlockFlow block) {
    HBlockInformation info = block.body;
    // If we reach here again while handling the attached information,
    // e.g., because we call visitSubGraph on a subgraph starting on
    // the same block, don't handle it again.
    // When the structure graph is complete, we will be able to have
    // different structures starting on the same basic block (e.g., an
    // "if" and its condition).
    if (info === currentBlockInformation) return false;

    HBlockInformation oldBlockInformation = currentBlockInformation;
    currentBlockInformation = info;
    bool success = info.accept(this);
    currentBlockInformation = oldBlockInformation;
    if (success) {
      HBasicBlock continuation = block.continuation;
      if (continuation !== null) {
        visitBasicBlock(continuation);
      }
    }
    return success;
  }

  void visitBasicBlock(HBasicBlock node) {
    // Abort traversal if we are leaving the currently active sub-graph.
    if (!subGraph.contains(node)) return;

    currentBlock = node;
    // If this node has block-structure based information attached,
    // try using that to traverse from here.
    if (node.blockFlow !== null &&
        handleBlockFlow(node.blockFlow)) {
      return;
    }
    // Flow based traversal.
    if (node.isLoopHeader() &&
        node.loopInformation.loopBlockInformation !== currentBlockInformation) {
      beginLoop(node);
    }
    iterateBasicBlock(node);
  }

  void emitAssignment(String destination, String source) {
    if (isGeneratingExpression()) {
      addExpressionSeparator();
    } else {
      addIndentation();
    }
    declareVariable(destination);
    buffer.add(' = $source');
    if (!isGeneratingExpression()) {
      buffer.add(';\n');
    }
  }

  /**
   * Sequentialize a list of conceptually parallel copies. Parallel
   * copies may contain cycles, that this method breaks.
   */
  void sequentializeCopies(List<Copy> copies) {
    // Map to keep track of the current location (ie the variable that
    // holds the initial value) of a variable.
    Map<String, String> currentLocation = new Map<String, String>();

    // Map to keep track of the initial value of a variable.
    Map<String, String> initialValue = new Map<String, String>();

    // List of variables to assign a value.
    List<String> worklist = <String>[];

    // List of variables that we can assign a value to (ie are not
    // being used anymore).
    List<String> ready = <String>[];

    // Prune [copies] by removing self-copies.
    List<Copy> prunedCopies = <Copy>[];
    for (Copy copy in copies) {
      String sourceName = variableNames.getName(copy.source);
      String destinationName = variableNames.getName(copy.destination);
      if (sourceName != destinationName) {
        prunedCopies.add(new Copy(sourceName, destinationName));
      }
    }
    copies = prunedCopies;


    // For each copy, set the current location of the source to
    // itself, and the initial value of the destination to the source.
    // Add the destination to the list of copies to make.
    for (Copy copy in copies) {
      currentLocation[copy.source] = copy.source;
      initialValue[copy.destination] = copy.source;
      worklist.add(copy.destination);
    }

    // For each copy, if the destination does not have a current
    // location, then we can safely assign to it.
    for (Copy copy in copies) {
      if (currentLocation[copy.destination] === null) {
        ready.add(copy.destination);
      }
    }

    while (!worklist.isEmpty()) {
      while (!ready.isEmpty()) {
        String destination = ready.removeLast();
        String source = initialValue[destination];
        // Since [source] might have been updated, use the current
        // location of [source]
        String copy = currentLocation[source];
        emitAssignment(destination, copy);
        // Now [destination] is the current location of [source].
        currentLocation[source] = destination;
        // If [source] hasn't been updated and needs to have a value,
        // add it to the list of variables that can be updated. Copies
        // of [source] will now use [destination].
        if (source == copy && initialValue[source] !== null) {
          ready.add(source);
        }
      }

      // Check if we have a cycle.
      String current = worklist.removeLast();
      // If [current] is used as a source, and the assignment has been
      // done, we are done with this variable. Otherwise there is a
      // cycle that we break by using a temporary name.
      if (currentLocation[current] !== null
          && current != currentLocation[initialValue[current]]) {
        String tempName = variableNames.swapTemp;
        emitAssignment(tempName, current);
        currentLocation[current] = tempName;
        // [current] can now be safely updated. Copies of [current]
        // will now use [tempName].
        ready.add(current);
      }
    }
  }

  void assignPhisOfSuccessors(HBasicBlock node) {
    CopyHandler handler = variableNames.getCopyHandler(node);
    if (handler == null) return;

    sequentializeCopies(handler.copies);

    for (Copy copy in handler.assignments) {
      if (isGeneratingExpression()) {
        addExpressionSeparator();
      } else {
        addIndentation();
      }
      String name = variableNames.getName(copy.destination);
      if (!handleSimpleUpdateDefinition(copy.source, name)) {
        declareVariable(name);
        buffer.add(' = ');
        use(copy.source, JSPrecedence.ASSIGNMENT_PRECEDENCE);
      }
      if (!isGeneratingExpression()) {
        buffer.add(';\n');
      }
    }
  }

  void iterateBasicBlock(HBasicBlock node) {
    HInstruction instruction = node.first;
    while (instruction !== node.last) {
      if (instruction is HTypeGuard) {
        visit(instruction, JSPrecedence.STATEMENT_PRECEDENCE);
      } else if (!isGenerateAtUseSite(instruction)) {
        expectedPrecedence = JSPrecedence.STATEMENT_PRECEDENCE;
        define(instruction);
      }
      instruction = instruction.next;
    }
    assignPhisOfSuccessors(node);
    if (instruction is HLoopBranch && isGeneratingExpression()) {
      addExpressionSeparator();
    }
    visit(instruction, JSPrecedence.STATEMENT_PRECEDENCE);
  }

  visitInvokeBinary(HInvokeBinary node, String op) {
    if (node.builtin) {
      JSBinaryOperatorPrecedence operatorPrecedences = JSPrecedence.binary[op];
      beginExpression(operatorPrecedences.precedence);
      use(node.left, operatorPrecedences.left);
      buffer.add(' $op ');
      use(node.right, operatorPrecedences.right);
      endExpression(operatorPrecedences.precedence);
    } else {
      visitInvokeStatic(node);
    }
  }

  // We want the outcome of bit-operations to be positive. We use the unsigned
  // shift operator to achieve this.
  visitBitInvokeBinary(HBinaryBitOp node, String op) {
    if (node.builtin && requiresUintConversion(node)) {
      beginExpression(unsignedShiftPrecedences.precedence);
      int oldPrecedence = this.expectedPrecedence;
      this.expectedPrecedence = JSPrecedence.SHIFT_PRECEDENCE;
      visitInvokeBinary(node, op);
      buffer.add(' >>> 0');
      this.expectedPrecedence = oldPrecedence;
      endExpression(unsignedShiftPrecedences.precedence);
    } else {
      visitInvokeBinary(node, op);
    }
  }

  visitInvokeUnary(HInvokeUnary node, String op) {
    if (node.builtin) {
      beginExpression(JSPrecedence.PREFIX_PRECEDENCE);
      buffer.add('$op');
      use(node.operand, JSPrecedence.PREFIX_PRECEDENCE);
      endExpression(JSPrecedence.PREFIX_PRECEDENCE);
    } else {
      visitInvokeStatic(node);
    }
  }

  // We want the outcome of bit-operations to be positive. We use the unsigned
  // shift operator to achieve this.
  visitBitInvokeUnary(HInvokeUnary node, String op) {
    if (node.builtin && requiresUintConversion(node)) {
      beginExpression(unsignedShiftPrecedences.precedence);
      int oldPrecedence = this.expectedPrecedence;
      this.expectedPrecedence = JSPrecedence.SHIFT_PRECEDENCE;
      visitInvokeUnary(node, op);
      buffer.add(' >>> 0');
      this.expectedPrecedence = oldPrecedence;
      endExpression(unsignedShiftPrecedences.precedence);
    } else {
      visitInvokeUnary(node, op);
    }
  }

  void emitIdentityComparison(HInstruction left, HInstruction right) {
    String op = singleIdentityComparison(left, right);
    if (op != null) {
      beginExpression(JSPrecedence.EQUALITY_PRECEDENCE);
      use(left, JSPrecedence.EQUALITY_PRECEDENCE);
      buffer.add(' $op ');
      use(right, JSPrecedence.RELATIONAL_PRECEDENCE);
      endExpression(JSPrecedence.EQUALITY_PRECEDENCE);
    } else {
      assert(NullConstant.JsNull == 'null');
      withPrecedence(JSPrecedence.CONDITIONAL_PRECEDENCE, () {
        beginExpression(JSPrecedence.EQUALITY_PRECEDENCE);
        use(left, JSPrecedence.EQUALITY_PRECEDENCE);
        buffer.add(' == null');
        endExpression(JSPrecedence.EQUALITY_PRECEDENCE);
        buffer.add(' ? ');
        this.expectedPrecedence = JSPrecedence.ASSIGNMENT_PRECEDENCE;
        withPrecedence(JSPrecedence.LOGICAL_AND_PRECEDENCE, () {
          beginExpression(JSPrecedence.EQUALITY_PRECEDENCE);
          use(right, JSPrecedence.EQUALITY_PRECEDENCE);
          buffer.add(' == null');
          endExpression(JSPrecedence.EQUALITY_PRECEDENCE);
          buffer.add(" : ");
          beginExpression(JSPrecedence.EQUALITY_PRECEDENCE);
          use(left, JSPrecedence.EQUALITY_PRECEDENCE);
          buffer.add(' === ');
          use(right, JSPrecedence.EQUALITY_PRECEDENCE);
          endExpression(JSPrecedence.EQUALITY_PRECEDENCE);
        });
      });
    }
  }

  visitEquals(HEquals node) {
    if (node.builtin) {
      emitIdentityComparison(node.left, node.right);
    } else {
      visitInvokeStatic(node);
    }
  }

  visitIdentity(HIdentity node) {
    assert(node.builtin);
    emitIdentityComparison(node.left, node.right);
  }

  visitAdd(HAdd node)               => visitInvokeBinary(node, '+');
  visitDivide(HDivide node)         => visitInvokeBinary(node, '/');
  visitMultiply(HMultiply node)     => visitInvokeBinary(node, '*');
  visitSubtract(HSubtract node)     => visitInvokeBinary(node, '-');
  // Truncating divide does not have a JS equivalent.
  visitTruncatingDivide(HTruncatingDivide node) => visitInvokeStatic(node);
  // Modulo cannot be mapped to the native operator (different semantics).
  visitModulo(HModulo node)                     => visitInvokeStatic(node);

  visitBitAnd(HBitAnd node)         => visitBitInvokeBinary(node, '&');
  visitBitNot(HBitNot node)         => visitBitInvokeUnary(node, '~');
  visitBitOr(HBitOr node)           => visitBitInvokeBinary(node, '|');
  visitBitXor(HBitXor node)         => visitBitInvokeBinary(node, '^');
  visitShiftRight(HShiftRight node) => visitBitInvokeBinary(node, '>>');
  visitShiftLeft(HShiftLeft node)   => visitBitInvokeBinary(node, '<<');

  visitNegate(HNegate node)         => visitInvokeUnary(node, '-');

  visitLess(HLess node)                 => visitInvokeBinary(node, '<');
  visitLessEqual(HLessEqual node)       => visitInvokeBinary(node, '<=');
  visitGreater(HGreater node)           => visitInvokeBinary(node, '>');
  visitGreaterEqual(HGreaterEqual node) => visitInvokeBinary(node, '>=');

  visitBoolify(HBoolify node) {
    beginExpression(JSPrecedence.EQUALITY_PRECEDENCE);
    assert(node.inputs.length == 1);
    use(node.inputs[0], JSPrecedence.EQUALITY_PRECEDENCE);
    buffer.add(' === true');
    endExpression(JSPrecedence.EQUALITY_PRECEDENCE);
  }

  visitExit(HExit node) {
    // Don't do anything.
  }

  visitGoto(HGoto node) {
    assert(currentBlock.successors.length == 1);
    List<HBasicBlock> dominated = currentBlock.dominatedBlocks;
    // With the exception of the entry-node which dominates its successor
    // and the exit node, no block finishing with a 'goto' can have more than
    // one dominated block (since it has only one successor).
    // If the successor is dominated by another block, then the other block
    // is responsible for visiting the successor.
    if (dominated.isEmpty()) return;
    if (dominated.length > 2) {
      compiler.internalError('dominated.length = ${dominated.length}',
                             instruction: node);
    }
    if (dominated.length == 2 && currentBlock !== currentGraph.entry) {
      compiler.internalError('currentBlock !== currentGraph.entry',
                             instruction: node);
    }
    assert(dominated[0] == currentBlock.successors[0]);
    visitBasicBlock(dominated[0]);
  }

  // Used to write the name of labels.
  void writeLabel(LabelElement label) {
    buffer.add('\$${label.labelName}\$${label.target.nestingLevel}');
  }

  void writeImplicitLabel(TargetElement target) {
    buffer.add('\$${target.nestingLevel}');
  }

  // We sometimes handle continue targets differently from break targets,
  // so we have special continue-only labels.
  void writeContinueLabel(LabelElement label) {
    buffer.add('c\$${label.labelName}\$${label.target.nestingLevel}');
  }

  void writeImplicitContinueLabel(TargetElement target) {
    buffer.add('c\$${target.nestingLevel}');
  }

  /**
   * Checks if [map] contains an [ElementAction] for [element], and
   * if so calls that action and returns true.
   * Otherwise returns false.
   */
  bool tryCallAction(Map<Element, ElementAction> map, Element element) {
    ElementAction action = map[element];
    if (action === null) return false;
    action(element);
    return true;
  }

  visitBreak(HBreak node) {
    assert(currentBlock.successors.length == 1);
    if (node.label !== null) {
      LabelElement label = node.label;
      if (!tryCallAction(breakAction, label)) {
        addIndented("break ");
        writeLabel(label);
        buffer.add(";\n");
      }
    } else {
      TargetElement target = node.target;
      if (!tryCallAction(breakAction, target)) {
        addIndented("break;\n");
      }
    }
  }

  visitContinue(HContinue node) {
    assert(currentBlock.successors.length == 1);
    if (node.label !== null) {
      LabelElement label = node.label;
      if (!tryCallAction(continueAction, label)) {
        addIndented("continue ");
        writeLabel(label);
        buffer.add(";\n");
      }
    } else {
      TargetElement target = node.target;
      if (!tryCallAction(continueAction, target)) {
        addIndented("continue;\n");
      }
    }
  }

  visitTry(HTry node) {
    // We should never get here. Try/catch/finally is always handled using block
    // information in [visitTryInfo], or not at all, in the case of the bailout
    // generator.
    compiler.internalError('visitTry should not be called', instruction: node);
  }

  /**
   * Analyzes the given [graph] to know whether it is empty, or
   * contains one statement, one expression, or multiple statements.
   */
  int analyzeGraphForCodegen(HStatementInformation graph) {
    HBasicBlock start = graph.start;
    HBasicBlock end = graph.end;
    // Only deal with single blocks for now. TODO(ngeoffray): analyze
    // all blocks.
    if (start !== end) return MULTIPLE_STATEMENTS;

    int kind = EMPTY;
    bool updateKind(int newKind) {
      if (kind != EMPTY) return false;
      kind = newKind;
      return true;
    }

    for (HInstruction instruction = start.first;
         instruction != start.last;
         instruction = instruction.next) {
      if (instruction.isStatement) {
        if (!updateKind(ONE_STATEMENT)) return MULTIPLE_STATEMENTS;
      } else if (!isGenerateAtUseSite(instruction)) {
        if (!updateKind(ONE_EXPRESSION)) return MULTIPLE_STATEMENTS;
      }
    }

    HInstruction last = start.last;
    if (last is !HGoto) {
      if (!updateKind(last.isStatement ? ONE_STATEMENT : ONE_EXPRESSION)) {
        return MULTIPLE_STATEMENTS;
      }
    }

    CopyHandler handler = variableNames.getCopyHandler(start);
    if (handler !== null && !handler.isEmpty()) {
      if (handler.assignments.length > 1) return MULTIPLE_STATEMENTS;
      if (handler.assignments.length == 1) {
        if (!updateKind(ONE_STATEMENT)) return MULTIPLE_STATEMENTS;
      }
      // If the block has a copy where the destination and source are
      // different, we will emit that copy, and therefore the block is
      // not empty.
      for (Copy copy in handler.copies) {
        String sourceName = variableNames.getName(copy.source);
        String destinationName = variableNames.getName(copy.destination);
        if (sourceName != destinationName) {
          if (!updateKind(ONE_STATEMENT)) return MULTIPLE_STATEMENTS;
        }
      }
    }
    return kind;
  }

  bool tryControlFlowOperation(HIf node) {
    if (!controlFlowOperators.contains(node)) return false;
    HPhi phi = node.joinBlock.phis.first;
    bool atUseSite = isGenerateAtUseSite(phi);
    // Don't generate a conditional operator in this situation:
    // i = condition ? bar() : i;
    // But generate this instead:
    // if (condition) i = bar();
    // Usually, the variable name is longer than 'if' and it takes up
    // more space to duplicate the name.
    if (!atUseSite
        && variableNames.getName(phi) == variableNames.getName(phi.inputs[1])) {
      return false;
    }
    if (!atUseSite) define(phi);
    visitBasicBlock(node.joinBlock);
    return true;
  }

  void generateIf(HIf node, HIfBlockInformation info) {
    HStatementInformation thenGraph = info.thenGraph;
    HStatementInformation elseGraph = info.elseGraph;
    int thenKind = analyzeGraphForCodegen(thenGraph);
    int elseKind = analyzeGraphForCodegen(elseGraph);

    void visitWithoutIndent(HStatementInformation toVisit) {
      int oldIndent = indent;
      indent = 0;
      generateStatements(toVisit);
      indent = oldIndent;
    }

    void visitExpression(HStatementInformation toVisit) {
      // [generateExpression] only works if the [expectedPrecedence] is a
      // statement or an expression. We therefore have to duplicate some
      // work here.
      assert(toVisit.start == toVisit.end);
      assert(toVisit.start.last is HGoto);
      // Find the expression (there must only be one).
      HInstruction expression = toVisit.start.first;
      while (generateAtUseSite.contains(expression)) {
        expression = expression.next;
      }
      assert(() {
        HInstruction remaining = expression.next;
        while (remaining is !HGoto) {
          if (!generateAtUseSite.contains(remaining)) return false;
          remaining = remaining.next;
        }
        return true;
      });

      int oldState = generationState;
      generationState = STATE_FIRST_EXPRESSION;
      define(expression);
      generationState = oldState;
    }

    void visitWithIndent(HStatementInformation toVisit) {
      buffer.add('{\n');
      indent++;
      generateStatements(toVisit);
      indent--;
      addIndented('}');
    }

    void emitIf() {
      addIndented('if (');
      use(node.inputs[0], JSPrecedence.EXPRESSION_PRECEDENCE);
      buffer.add(') ');
    }

    JSBinaryOperatorPrecedence operatorPrecedence = JSPrecedence.binary['&&'];
    void generateAnd(HStatementInformation toVisit, Function condition) {
      addIndentation();
      beginExpression(operatorPrecedence.precedence);
      var oldPrecedence = expectedPrecedence;
      expectedPrecedence = operatorPrecedence.left;
      condition();
      buffer.add(" && ");
      expectedPrecedence = operatorPrecedence.right;
      visitExpression(toVisit);
      expectedPrecedence = oldPrecedence;
      endExpression(operatorPrecedence.precedence);
      buffer.add(";\n");
    }

    List<HBasicBlock> thenSuccessors = thenGraph.end.successors;
    bool thenGraphHasSuccessor = thenSuccessors.length != 0
        && thenSuccessors[0] !== currentGraph.exit;

    switch (thenKind) {
      case EMPTY:
        switch (elseKind) {
          case EMPTY:
            if (isGenerateAtUseSite(node.inputs[0])) {
              addIndentation();
              use(node.inputs[0], JSPrecedence.STATEMENT_PRECEDENCE);
              buffer.add(';\n');
            }
            break;

          case ONE_EXPRESSION:
            generateAnd(elseGraph, () { generateNot(node.inputs[0]); });
            break;

          case ONE_STATEMENT:
            addIndented('if (');
            generateNot(node.inputs[0]);
            buffer.add(') ');
            visitWithoutIndent(elseGraph);
            break;

          case MULTIPLE_STATEMENTS:
            addIndented('if (');
            generateNot(node.inputs[0]);
            buffer.add(') ');
            visitWithIndent(elseGraph);
            buffer.add('\n');
            break;
        }

        break;

      case ONE_EXPRESSION:
      case ONE_STATEMENT:
        switch (elseKind) {
          case EMPTY:
            if (thenKind == ONE_EXPRESSION) {
              int precedence = operatorPrecedence.left;
              generateAnd(thenGraph, () { use(node.inputs[0], precedence); });
            } else {
              emitIf();
              visitWithoutIndent(thenGraph);
            }
            break;

          case ONE_EXPRESSION:
          case ONE_STATEMENT:
            // TODO(ngeoffray): Generate a conditional.
            emitIf();
            visitWithoutIndent(thenGraph);
            if (thenGraphHasSuccessor) {
              addIndented('else ');
              visitWithoutIndent(elseGraph);
            } else {
              generateStatements(elseGraph);
            }
            break;

          case MULTIPLE_STATEMENTS:
            emitIf();
            visitWithoutIndent(thenGraph);
            if (thenGraphHasSuccessor) {
              addIndented('else ');
              visitWithIndent(elseGraph);
              buffer.add('\n');
            } else {
              generateStatements(elseGraph);
            }
            break;
        }
        break;

      case MULTIPLE_STATEMENTS:
        emitIf();
        visitWithIndent(thenGraph);

        switch (elseKind) {
          case EMPTY:
            buffer.add('\n');
            break;

          case ONE_EXPRESSION:
          case ONE_STATEMENT:
            if (thenGraphHasSuccessor) {
              buffer.add(' else ');
              visitWithoutIndent(elseGraph);
            } else {
              buffer.add('\n');
              generateStatements(elseGraph);
            }
            break;

          case MULTIPLE_STATEMENTS:
            if (thenGraphHasSuccessor) {
              buffer.add(' else ');
              visitWithIndent(elseGraph);
              buffer.add('\n');
            } else {
              buffer.add('\n');
              generateStatements(elseGraph);
            }
            break;
        }
        break;
    }
  }


  visitIf(HIf node) {
    if (tryControlFlowOperation(node)) return;

    if (subGraph !== null && node.block === subGraph.end) {
      if (isGeneratingExpression()) {
        use(node.inputs[0], JSPrecedence.EXPRESSION_PRECEDENCE);
      }
      return;
    }

    HInstruction condition = node.inputs[0];
    HIfBlockInformation info = node.blockInformation.body;

    if (condition.isConstant()) {
      HConstant constant = condition;
      if (constant.constant.isTrue()) {
        generateStatements(info.thenGraph);
      } else {
        generateStatements(info.elseGraph);
      }
    } else {
      generateIf(node, info);
    }

    HBasicBlock joinBlock = node.joinBlock;
    if (joinBlock !== null && joinBlock.dominator !== node.block) {
      // The join block is dominated by a block in one of the branches.
      // The subgraph traversal never reached it, so we visit it here
      // instead.
      visitBasicBlock(joinBlock);
    }

    // Visit all the dominated blocks that are not part of the then or else
    // branches, and is not the join block.
    // Depending on how the then/else branches terminate
    // (e.g., return/throw/break) there can be any number of these.
    List<HBasicBlock> dominated = node.block.dominatedBlocks;
    for (int i = 2; i < dominated.length; i++) {
      visitBasicBlock(dominated[i]);
    }
  }

  visitInvokeDynamicMethod(HInvokeDynamicMethod node) {
    beginExpression(JSPrecedence.CALL_PRECEDENCE);
    use(node.receiver, JSPrecedence.MEMBER_PRECEDENCE);
    buffer.add('.');
    // Avoid adding the generative constructor name to the list of
    // seen selectors.
    if (node.inputs[0] is HForeignNew) {
      HForeignNew foreignNew = node.inputs[0];
      // Remove 'this' from the number of arguments.
      int argumentCount = node.inputs.length - 1;

      // TODO(ahe): The constructor name was statically resolved in
      // SsaBuilder.buildFactory. Is there a cleaner way to do this?
      node.name.printOn(buffer);
      visitArguments(node.inputs);
    } else {
      buffer.add(compiler.namer.instanceMethodInvocationName(
          currentLibrary, node.name, node.selector));
      visitArguments(node.inputs);
      bool inLoop = node.block.enclosingLoopHeader !== null;
      if (node.element !== null) {
        // If we know we're calling a specific method, register that
        // method only.
        if (inLoop) {
          backend.builder.functionsCalledInLoop.add(node.element);
        }
        world.registerDynamicInvocationOf(node.element);
      } else {
        Selector selector = getOptimizedSelectorFor(node, node.selector);
        world.registerDynamicInvocation(node.name, selector);
        if (inLoop) backend.builder.selectorsCalledInLoop[node.name] = selector;
      }
    }
    endExpression(JSPrecedence.CALL_PRECEDENCE);
  }

  Selector getOptimizedSelectorFor(HInvoke node, Selector defaultSelector) {
    Type receiverType = node.inputs[0].propagatedType.computeType(compiler);
    if (receiverType !== null) {
      return new TypedSelector(receiverType, defaultSelector);
    } else {
      return defaultSelector;
    }
  }

  visitInvokeDynamicSetter(HInvokeDynamicSetter node) {
    beginExpression(JSPrecedence.CALL_PRECEDENCE);
    use(node.receiver, JSPrecedence.MEMBER_PRECEDENCE);
    buffer.add('.');
    buffer.add(compiler.namer.setterName(currentLibrary, node.name));
    visitArguments(node.inputs);
    world.registerDynamicSetter(
        node.name, getOptimizedSelectorFor(node, Selector.SETTER));
    endExpression(JSPrecedence.CALL_PRECEDENCE);
  }

  visitInvokeDynamicGetter(HInvokeDynamicGetter node) {
    beginExpression(JSPrecedence.CALL_PRECEDENCE);
    use(node.receiver, JSPrecedence.MEMBER_PRECEDENCE);
    buffer.add('.');
    buffer.add(compiler.namer.getterName(currentLibrary, node.name));
    visitArguments(node.inputs);
    world.registerDynamicGetter(
        node.name, getOptimizedSelectorFor(node, Selector.GETTER));
    endExpression(JSPrecedence.CALL_PRECEDENCE);
  }

  visitInvokeClosure(HInvokeClosure node) {
    beginExpression(JSPrecedence.CALL_PRECEDENCE);
    use(node.receiver, JSPrecedence.MEMBER_PRECEDENCE);
    buffer.add('.');
    buffer.add(compiler.namer.closureInvocationName(node.selector));
    visitArguments(node.inputs);
    // TODO(floitsch): we should have a separate list for closure invocations.
    world.registerDynamicInvocation(compiler.namer.CLOSURE_INVOCATION_NAME,
                                    node.selector);
    endExpression(JSPrecedence.CALL_PRECEDENCE);
  }

  visitInvokeStatic(HInvokeStatic node) {
    beginExpression(JSPrecedence.CALL_PRECEDENCE);
    use(node.target, JSPrecedence.CALL_PRECEDENCE);
    visitArguments(node.inputs);
    endExpression(JSPrecedence.CALL_PRECEDENCE);
  }

  visitInvokeSuper(HInvokeSuper node) {
    beginExpression(JSPrecedence.CALL_PRECEDENCE);
    Element superMethod = node.element;
    Element superClass = superMethod.enclosingElement;
    // Remove the element and 'this'.
    int argumentCount = node.inputs.length - 2;
    String className = compiler.namer.isolateAccess(superClass);
    if (superMethod.kind == ElementKind.FUNCTION ||
        superMethod.kind == ElementKind.GENERATIVE_CONSTRUCTOR) {
      String methodName = compiler.namer.instanceMethodName(
          currentLibrary, superMethod.name, argumentCount);
      buffer.add('$className.prototype.$methodName.call');
      visitArguments(node.inputs);
    } else if (superMethod.kind == ElementKind.FIELD) {
      buffer.add('this.${compiler.namer.getName(superMethod)}');
    } else {
      assert(superMethod.kind == ElementKind.GETTER ||
             superMethod.kind == ElementKind.SETTER);
      String methodName;
      if (superMethod.kind == ElementKind.GETTER) {
        methodName =
            compiler.namer.getterName(currentLibrary, superMethod.name);
      } else {
        methodName =
            compiler.namer.setterName(currentLibrary, superMethod.name);
      }
      buffer.add('$className.prototype.$methodName.call');
      visitArguments(node.inputs);
    }
    endExpression(JSPrecedence.CALL_PRECEDENCE);
    world.registerStaticUse(superMethod);
  }

  visitFieldGet(HFieldGet node) {
    String name = compiler.namer.getName(node.element);
    beginExpression(JSPrecedence.MEMBER_PRECEDENCE);
    use(node.receiver, JSPrecedence.MEMBER_PRECEDENCE);
    buffer.add('.');
    buffer.add(name);
    beginExpression(JSPrecedence.MEMBER_PRECEDENCE);
    Type type = node.receiver.propagatedType.computeType(compiler);
    if (type != null) {
      world.registerFieldGetter(node.element.name, type);
    }
  }

  visitFieldSet(HFieldSet node) {
    if (work.element.isGenerativeConstructorBody() &&
        node.element.enclosingElement.isClass() &&
        node.value.hasGuaranteedType() &&
        node.block.dominates(currentGraph.exit)) {
      backend.updateFieldConstructorSetters(node.element,
                                            node.value.guaranteedType);
    }
    String name = compiler.namer.getName(node.element);
    beginExpression(JSPrecedence.ASSIGNMENT_PRECEDENCE);
    use(node.receiver, JSPrecedence.MEMBER_PRECEDENCE);
    buffer.add('.');
    buffer.add(name);
    Type type = node.receiver.propagatedType.computeType(compiler);
    if (type != null) {
      if (!work.element.isGenerativeConstructorBody()) {
        world.registerFieldSetter(node.element.name, type);
      }
      backend.updateFieldSetters(node.element,
                                 node.value.propagatedType);
    }
    buffer.add(' = ');
    use(node.value, JSPrecedence.ASSIGNMENT_PRECEDENCE);
    endExpression(JSPrecedence.ASSIGNMENT_PRECEDENCE);
  }

  visitLocalGet(HLocalGet node) {
    use(node.receiver, JSPrecedence.EXPRESSION_PRECEDENCE);
  }

  visitLocalSet(HLocalSet node) {
    declareInstruction(node.receiver);
    buffer.add(' = ');
    use(node.value, JSPrecedence.ASSIGNMENT_PRECEDENCE);
  }

  visitForeign(HForeign node) {
    String code = node.code.slowToString();
    List<HInstruction> inputs = node.inputs;
    List<String> parts = code.split('#');
    if (parts.length != inputs.length + 1) {
      compiler.internalError(
          'Wrong number of arguments for JS', instruction: node);
    }
    beginExpression(JSPrecedence.EXPRESSION_PRECEDENCE);
    buffer.add(parts[0]);
    for (int i = 0; i < inputs.length; i++) {
      use(inputs[i], JSPrecedence.EXPRESSION_PRECEDENCE);
      buffer.add(parts[i + 1]);
    }
    endExpression(JSPrecedence.EXPRESSION_PRECEDENCE);
  }

  visitForeignNew(HForeignNew node) {
    int j = 0;
    node.element.forEachInstanceField(
      includeBackendMembers: true,
      includeSuperMembers: true,
      f: (ClassElement enclosingClass, Element member) {
        backend.updateFieldInitializers(member,
                                        node.inputs[j].propagatedType);
        j++;
      });
    String jsClassReference = compiler.namer.isolateAccess(node.element);
    beginExpression(JSPrecedence.MEMBER_PRECEDENCE);
    buffer.add('new $jsClassReference(');
    // We can't use 'visitArguments', since our arguments start at input[0].
    List<HInstruction> inputs = node.inputs;
    for (int i = 0; i < inputs.length; i++) {
      if (i != 0) buffer.add(', ');
      use(inputs[i], JSPrecedence.ASSIGNMENT_PRECEDENCE);
    }
    buffer.add(')');
    endExpression(JSPrecedence.MEMBER_PRECEDENCE);
  }

  void generateConstant(Constant constant) {
    // TODO(floitsch): the compile-time constant handler and the codegen
    // need to work together to avoid the parenthesis. See r4928 for an
    // implementation that still dealt with precedence.
    ConstantHandler handler = compiler.constantHandler;
    String name = handler.getNameForConstant(constant);
    if (name === null) {
      assert(!constant.isObject());
      if (constant.isNum()
          && expectedPrecedence == JSPrecedence.MEMBER_PRECEDENCE) {
        buffer.add('(');
        handler.writeConstant(buffer, constant);
        buffer.add(')');
      } else {
        handler.writeConstant(buffer, constant);
      }
    } else {
      buffer.add(compiler.namer.CURRENT_ISOLATE);
      buffer.add(".");
      buffer.add(name);
    }

  }

  visitConstant(HConstant node) {
    assert(isGenerateAtUseSite(node));
    generateConstant(node.constant);
  }

  visitLoopBranch(HLoopBranch node) {
    if (subGraph !== null && node.block === subGraph.end) {
      // We are generating code for a loop condition.
      // If doing this as part of a SubGraph traversal, the
      // calling code will handle the control flow logic.

      // If we are generating the subgraph as an expression, the
      // condition will be generated as the expression.
      // Otherwise, we don't generate the expression, and leave that
      // to the code that called [visitSubGraph].
      if (isGeneratingExpression()) {
        use(node.inputs[0], JSPrecedence.EXPRESSION_PRECEDENCE);
      }
      return;
    }
    HBasicBlock branchBlock = currentBlock;
    addIndentation();
    handleLoopCondition(node);
    List<HBasicBlock> dominated = currentBlock.dominatedBlocks;
    // For a do while loop, the body has already been visited.
    if (!node.isDoWhile()) {
      visitBasicBlock(dominated[0]);
    }
    endLoop(node.block);

    // If the branch does not dominate the code after the loop, the
    // dominator will visit it.
    if (branchBlock.successors[1].dominator !== branchBlock) return;

    visitBasicBlock(branchBlock.successors[1]);
    // With labeled breaks we can have more dominated blocks.
    if (dominated.length >= 3) {
      for (int i = 2; i < dominated.length; i++) {
        visitBasicBlock(dominated[i]);
      }
    }
  }

  visitNot(HNot node) {
    assert(node.inputs.length == 1);
    generateNot(node.inputs[0]);
  }


  void generateNot(HInstruction input) {
    bool isBuiltinRelational(HInstruction instruction) {
      if (instruction is !HRelational) return false;
      HRelational relational = instruction;
      return relational.builtin;
    }

    if (input is HBoolify && isGenerateAtUseSite(input)) {
      beginExpression(JSPrecedence.EQUALITY_PRECEDENCE);
      use(input.inputs[0], JSPrecedence.EQUALITY_PRECEDENCE);
      buffer.add(' !== true');
      endExpression(JSPrecedence.EQUALITY_PRECEDENCE);
    } else if (isBuiltinRelational(input) &&
               isGenerateAtUseSite(input) &&
               input.inputs[0].propagatedType.isUseful() &&
               !input.inputs[0].isDouble() &&
               input.inputs[1].propagatedType.isUseful() &&
               !input.inputs[1].isDouble()) {
      // This optimization doesn't work for NaN, so we only do it if the
      // type is known to be non-Double.
      Map<String, String> inverseOperator = const <String>{
        "==" : "!=",
        "!=" : "==",
        "===": "!==",
        "!==": "===",
        "<"  : ">=",
        "<=" : ">",
        ">"  : "<=",
        ">=" : "<"
      };
      HRelational relational = input;
      visitInvokeBinary(input,
                        inverseOperator[relational.operation.name.stringValue]);
    } else {
      beginExpression(JSPrecedence.PREFIX_PRECEDENCE);
      buffer.add('!');
      use(input, JSPrecedence.PREFIX_PRECEDENCE);
      endExpression(JSPrecedence.PREFIX_PRECEDENCE);
    }
  }

  visitParameterValue(HParameterValue node) => visitLocalValue(node);

  visitLocalValue(HLocalValue node) {
    assert(isGenerateAtUseSite(node));
    buffer.add(variableNames.getName(node));
  }

  visitPhi(HPhi node) {
    // This method is only called for phis that are generated at use
    // site. A phi can be generated at use site only if it is the
    // result of a control flow operation.
    HBasicBlock ifBlock = node.block.dominator;
    assert(controlFlowOperators.contains(ifBlock.last));
    HInstruction input = ifBlock.last.inputs[0];
    if (input.isConstantFalse()) {
      use(node.inputs[1], expectedPrecedence);
    } else if (input.isConstantTrue()) {
      use(node.inputs[0], expectedPrecedence);
    } else if (node.inputs[1].isConstantBoolean()) {
      String operation = node.inputs[1].isConstantFalse() ? '&&' : '||';
      JSBinaryOperatorPrecedence operatorPrecedence =
          JSPrecedence.binary[operation];
      beginExpression(operatorPrecedence.precedence);
      if (operation == '||') {
        if (input is HNot) {
          use(input.inputs[0], operatorPrecedence.left);
        } else {
          generateNot(input);
        }
      } else {
        use(input, operatorPrecedence.left);
      }
      buffer.add(" $operation ");
      use(node.inputs[0], operatorPrecedence.right);
      endExpression(operatorPrecedence.precedence);
    } else {
      beginExpression(JSPrecedence.CONDITIONAL_PRECEDENCE);
      use(input, JSPrecedence.LOGICAL_OR_PRECEDENCE);
      buffer.add(' ? ');
      use(node.inputs[0], JSPrecedence.ASSIGNMENT_PRECEDENCE);
      buffer.add(' : ');
      use(node.inputs[1], JSPrecedence.ASSIGNMENT_PRECEDENCE);
      endExpression(JSPrecedence.CONDITIONAL_PRECEDENCE);
    }
  }

  visitReturn(HReturn node) {
    addIndentation();
    assert(node.inputs.length == 1);
    HInstruction input = node.inputs[0];
    if (input.isConstantNull()) {
      buffer.add('return;\n');
    } else {
      buffer.add('return ');
      use(node.inputs[0], JSPrecedence.EXPRESSION_PRECEDENCE);
      buffer.add(';\n');
    }
  }

  visitThis(HThis node) {
    buffer.add('this');
  }

  visitThrow(HThrow node) {
    addIndentation();
    if (node.isRethrow) {
      buffer.add('throw ');
      use(node.inputs[0], JSPrecedence.EXPRESSION_PRECEDENCE);
    } else {
      generateThrowWithHelper('captureStackTrace', node.inputs[0]);
    }
    buffer.add(';\n');
  }

  visitBoundsCheck(HBoundsCheck node) {
    // TODO(ngeoffray): Separate the two checks of the bounds check, so,
    // e.g., the zero checks can be shared if possible.

    // If the checks always succeede, we would have removed the bounds check
    // completely.
    assert(node.staticChecks != HBoundsCheck.ALWAYS_TRUE);
    if (node.staticChecks != HBoundsCheck.ALWAYS_FALSE) {
      buffer.add('if (');
      if (node.staticChecks != HBoundsCheck.ALWAYS_ABOVE_ZERO) {
        assert(node.staticChecks == HBoundsCheck.FULL_CHECK);
        use(node.index, JSPrecedence.RELATIONAL_PRECEDENCE);
        buffer.add(' < 0 || ');
      }
      use(node.index, JSPrecedence.RELATIONAL_PRECEDENCE);
      buffer.add(' >= ');
      use(node.length, JSPrecedence.SHIFT_PRECEDENCE);
      buffer.add(") ");
    }
    generateThrowWithHelper('ioore', node.index);
  }

  visitIntegerCheck(HIntegerCheck node) {
    if (!node.alwaysFalse) {
      buffer.add('if (');
      checkInt(node.value, '!==');
      buffer.add(') ');
    }
    generateThrowWithHelper('iae', node.value);
  }

  void generateThrowWithHelper(String helperName, HInstruction argument) {
    Element helper = compiler.findHelper(new SourceString(helperName));
    world.registerStaticUse(helper);
    buffer.add('throw ');
    beginExpression(JSPrecedence.EXPRESSION_PRECEDENCE);
    beginExpression(JSPrecedence.CALL_PRECEDENCE);
    buffer.add(compiler.namer.isolateAccess(helper));
    visitArguments([null, argument]);
    endExpression(JSPrecedence.CALL_PRECEDENCE);
    endExpression(JSPrecedence.EXPRESSION_PRECEDENCE);
  }

  void addIndentation() {
    for (int i = 0; i < indent; i++) {
      buffer.add('  ');
    }
  }

  void addIndented(String text) {
    addIndentation();
    buffer.add(text);
  }

  void visitSwitch(HSwitch node) {
    // Switches are handled using [visitSwitchInfo].
  }

  void visitStatic(HStatic node) {
    world.registerStaticUse(node.element);
    buffer.add(compiler.namer.isolateAccess(node.element));
  }

  void visitStaticStore(HStaticStore node) {
    world.registerStaticUse(node.element);
    beginExpression(JSPrecedence.ASSIGNMENT_PRECEDENCE);
    buffer.add(compiler.namer.isolateAccess(node.element));
    buffer.add(' = ');
    use(node.inputs[0], JSPrecedence.ASSIGNMENT_PRECEDENCE);
    endExpression(JSPrecedence.ASSIGNMENT_PRECEDENCE);
  }

  void visitStringConcat(HStringConcat node) {
    if (isEmptyString(node.left)) {
      useStringified(node.right, expectedPrecedence);
   } else if (isEmptyString(node.right)) {
      useStringified(node.left, expectedPrecedence);
    } else {
      JSBinaryOperatorPrecedence operatorPrecedences = JSPrecedence.binary['+'];
      beginExpression(operatorPrecedences.precedence);
      useStringified(node.left, operatorPrecedences.left);
      buffer.add(' + ');
      // If the right hand side is a string concatenation itself it is
      // safe to make it left associative.
      int rightPrecedence = (node.right is HStringConcat)
          ? JSPrecedence.ADDITIVE_PRECEDENCE
          : operatorPrecedences.right;
      useStringified(node.right, rightPrecedence);
      endExpression(operatorPrecedences.precedence);
    }
  }

  bool isEmptyString(HInstruction node) {
    if (!node.isConstantString()) return false;
    HConstant constant = node;
    StringConstant string = constant.constant;
    return string.value.length == 0;
  }

  void useStringified(HInstruction node, int precedence) {
    if (node.isString()) {
      use(node, precedence);
    } else {
      Element convertToString = compiler.findHelper(const SourceString("S"));
      world.registerStaticUse(convertToString);
      buffer.add(compiler.namer.isolateAccess(convertToString));
      buffer.add('(');
      use(node, JSPrecedence.EXPRESSION_PRECEDENCE);
      buffer.add(')');
    }
  }

  void visitLiteralList(HLiteralList node) {
    generateArrayLiteral(node);
  }

  void generateArrayLiteral(HLiteralList node) {
    buffer.add('[');
    int len = node.inputs.length;
    for (int i = 0; i < len; i++) {
      if (i != 0) buffer.add(', ');
      use(node.inputs[i], JSPrecedence.ASSIGNMENT_PRECEDENCE);
    }
    buffer.add(']');
  }

  void visitIndex(HIndex node) {
    if (node.builtin) {
      beginExpression(JSPrecedence.MEMBER_PRECEDENCE);
      use(node.inputs[1], JSPrecedence.MEMBER_PRECEDENCE);
      buffer.add('[');
      use(node.inputs[2], JSPrecedence.EXPRESSION_PRECEDENCE);
      buffer.add(']');
      endExpression(JSPrecedence.MEMBER_PRECEDENCE);
    } else {
      visitInvokeStatic(node);
    }
  }

  void visitIndexAssign(HIndexAssign node) {
    if (node.builtin) {
      beginExpression(JSPrecedence.ASSIGNMENT_PRECEDENCE);
      use(node.inputs[1], JSPrecedence.MEMBER_PRECEDENCE);
      buffer.add('[');
      use(node.inputs[2], JSPrecedence.EXPRESSION_PRECEDENCE);
      buffer.add('] = ');
      use(node.inputs[3], JSPrecedence.ASSIGNMENT_PRECEDENCE);
      endExpression(JSPrecedence.ASSIGNMENT_PRECEDENCE);
    } else {
      visitInvokeStatic(node);
    }
  }

  String builtinJsName(HInvokeInterceptor interceptor) {
    // Don't count the target method or the receiver in the arity.
    int arity = interceptor.inputs.length - 2;
    HInstruction receiver = interceptor.inputs[1];
    bool getter = interceptor.getter;
    SourceString name = interceptor.name;

    if (interceptor.isLengthGetterOnStringOrArray()) {
      return 'length';
    } else if (receiver.isExtendableArray() && !getter) {
      if (name == const SourceString('add') && arity == 1) {
        return 'push';
      }
      if (name == const SourceString('removeLast') && arity == 0) {
        return 'pop';
      }
    } else if (receiver.isString() && !getter) {
      if (name == const SourceString('concat') &&
          arity == 1 &&
          interceptor.inputs[2].isString()) {
        return '+';
      }
    }

    return null;
  }

  void visitInvokeInterceptor(HInvokeInterceptor node) {
    String builtin = builtinJsName(node);
    if (builtin !== null) {
      if (builtin == '+') {
        beginExpression(JSPrecedence.ADDITIVE_PRECEDENCE);
        use(node.inputs[1], JSPrecedence.ADDITIVE_PRECEDENCE);
        buffer.add(' + ');
        use(node.inputs[2], JSPrecedence.MULTIPLICATIVE_PRECEDENCE);
        endExpression(JSPrecedence.ADDITIVE_PRECEDENCE);
      } else {
        beginExpression(JSPrecedence.CALL_PRECEDENCE);
        use(node.inputs[1], JSPrecedence.MEMBER_PRECEDENCE);
        buffer.add('.');
        buffer.add(builtin);
        if (node.getter) return;
        buffer.add('(');
        for (int i = 2; i < node.inputs.length; i++) {
          if (i != 2) buffer.add(', ');
          use(node.inputs[i], JSPrecedence.ASSIGNMENT_PRECEDENCE);
        }
        buffer.add(")");
        endExpression(JSPrecedence.CALL_PRECEDENCE);
      }
    } else {
      return visitInvokeStatic(node);
    }
  }

  void checkInt(HInstruction input, String cmp) {
    beginExpression(JSPrecedence.EQUALITY_PRECEDENCE);
    use(input, JSPrecedence.EQUALITY_PRECEDENCE);
    buffer.add(' $cmp (');
    use(input, JSPrecedence.BITWISE_OR_PRECEDENCE);
    buffer.add(' | 0)');
    endExpression(JSPrecedence.EQUALITY_PRECEDENCE);
  }

  void checkNum(HInstruction input, String cmp) {
    beginExpression(JSPrecedence.EQUALITY_PRECEDENCE);
    buffer.add('typeof ');
    use(input, JSPrecedence.PREFIX_PRECEDENCE);
    buffer.add(" $cmp 'number'");
    endExpression(JSPrecedence.EQUALITY_PRECEDENCE);
  }

  void checkDouble(HInstruction input, String cmp) {
    checkNum(input, cmp);
  }

  void checkString(HInstruction input, String cmp) {
    beginExpression(JSPrecedence.EQUALITY_PRECEDENCE);
    buffer.add('typeof ');
    use(input, JSPrecedence.PREFIX_PRECEDENCE);
    buffer.add(" $cmp 'string'");
    endExpression(JSPrecedence.EQUALITY_PRECEDENCE);
  }

  void checkBool(HInstruction input, String cmp) {
    beginExpression(JSPrecedence.EQUALITY_PRECEDENCE);
    buffer.add('typeof ');
    use(input, JSPrecedence.PREFIX_PRECEDENCE);
    buffer.add(" $cmp 'boolean'");
    endExpression(JSPrecedence.EQUALITY_PRECEDENCE);
  }

  void checkObject(HInstruction input, String cmp) {
    assert(NullConstant.JsNull == 'null');
    if (cmp == "===") {
      withPrecedence(JSPrecedence.LOGICAL_AND_PRECEDENCE, () {
        beginExpression(JSPrecedence.EQUALITY_PRECEDENCE);
        buffer.add('typeof ');
        use(input, JSPrecedence.PREFIX_PRECEDENCE);
        buffer.add(" === 'object'");
        endExpression(JSPrecedence.EQUALITY_PRECEDENCE);
        buffer.add(" && ");
        beginExpression(JSPrecedence.EQUALITY_PRECEDENCE);
        use(input, JSPrecedence.PREFIX_PRECEDENCE);
        buffer.add(" !== null");
        endExpression(JSPrecedence.EQUALITY_PRECEDENCE);
      });
    } else {
      assert(cmp == "!==");
      withPrecedence(JSPrecedence.LOGICAL_OR_PRECEDENCE, () {
        beginExpression(JSPrecedence.EQUALITY_PRECEDENCE);
        buffer.add('typeof ');
        use(input, JSPrecedence.PREFIX_PRECEDENCE);
        buffer.add(" !== 'object'");
        endExpression(JSPrecedence.EQUALITY_PRECEDENCE);
        buffer.add(" || ");
        beginExpression(JSPrecedence.EQUALITY_PRECEDENCE);
        use(input, JSPrecedence.PREFIX_PRECEDENCE);
        buffer.add(" === null");
        endExpression(JSPrecedence.EQUALITY_PRECEDENCE);
      });
    }
  }

  void checkArray(HInstruction input, String cmp) {
    beginExpression(JSPrecedence.EQUALITY_PRECEDENCE);
    use(input, JSPrecedence.MEMBER_PRECEDENCE);
    buffer.add('.constructor $cmp Array');
    endExpression(JSPrecedence.EQUALITY_PRECEDENCE);
  }

  void checkImmutableArray(HInstruction input) {
    beginExpression(JSPrecedence.PREFIX_PRECEDENCE);
    buffer.add('!!');
    use(input, JSPrecedence.MEMBER_PRECEDENCE);
    buffer.add('.immutable\$list');
    endExpression(JSPrecedence.PREFIX_PRECEDENCE);
  }

  void checkExtendableArray(HInstruction input) {
    beginExpression(JSPrecedence.PREFIX_PRECEDENCE);
    buffer.add('!!');
    use(input, JSPrecedence.MEMBER_PRECEDENCE);
    buffer.add('.fixed\$length');
    endExpression(JSPrecedence.PREFIX_PRECEDENCE);
  }

  void checkFixedArray(HInstruction input) {
    beginExpression(JSPrecedence.PREFIX_PRECEDENCE);
    use(input, JSPrecedence.MEMBER_PRECEDENCE);
    buffer.add('.fixed\$length');
    endExpression(JSPrecedence.PREFIX_PRECEDENCE);
  }

  void checkNull(HInstruction input) {
    beginExpression(JSPrecedence.EQUALITY_PRECEDENCE);
    use(input, JSPrecedence.EQUALITY_PRECEDENCE);
    buffer.add(" == null");
    endExpression(JSPrecedence.EQUALITY_PRECEDENCE);
  }

  void checkFunction(HInstruction input, Element element) {
    withPrecedence(JSPrecedence.LOGICAL_OR_PRECEDENCE, () {
      beginExpression(JSPrecedence.EQUALITY_PRECEDENCE);
      buffer.add('typeof ');
      use(input, JSPrecedence.PREFIX_PRECEDENCE);
      buffer.add(" === 'function'");
      endExpression(JSPrecedence.EQUALITY_PRECEDENCE);
      buffer.add(" || ");
      beginExpression(JSPrecedence.LOGICAL_AND_PRECEDENCE);
      checkObject(input, '===');
      buffer.add(" && ");
      checkType(input, element);
      endExpression(JSPrecedence.LOGICAL_AND_PRECEDENCE);
    });
  }

  void checkType(HInstruction input, Element element, [bool negative = false]) {
    world.registerIsCheck(element);
    bool requiresNativeIsCheck =
        backend.emitter.nativeEmitter.requiresNativeIsCheck(element);
    if (!requiresNativeIsCheck) {
      if (negative) {
        buffer.add('!');
      } else {
        buffer.add('!!');
      }
    } else if (negative) {
      buffer.add('!');
    }
    use(input, JSPrecedence.MEMBER_PRECEDENCE);
    buffer.add('.');
    buffer.add(compiler.namer.operatorIs(element));
    if (requiresNativeIsCheck) buffer.add('()');
  }

  void handleStringSupertypeCheck(HInstruction input, Element element) {
    // Make sure List and String don't share supertypes, otherwise we
    // would need to check for List too.
    assert(element !== compiler.listClass
           && !Elements.isListSupertype(element, compiler));
    withPrecedence(JSPrecedence.LOGICAL_OR_PRECEDENCE, () {
      checkString(input, '===');
      buffer.add(' || ');
      withPrecedence(JSPrecedence.LOGICAL_AND_PRECEDENCE, () {
        checkObject(input, '===');
        buffer.add(' && ');
        checkType(input, element);
      });
    });
  }

  void handleListOrSupertypeCheck(HInstruction input, Element element) {
    // Make sure List and String don't share supertypes, otherwise we
    // would need to check for String too.
    assert(element !== compiler.stringClass
           && !Elements.isStringSupertype(element, compiler));
    beginExpression(JSPrecedence.LOGICAL_AND_PRECEDENCE);
    checkObject(input, '===');
    buffer.add(' && (');
    beginExpression(JSPrecedence.LOGICAL_OR_PRECEDENCE);
    checkArray(input, '===');
    buffer.add(' || ');
    checkType(input, element);
    buffer.add(')');
    endExpression(JSPrecedence.LOGICAL_OR_PRECEDENCE);
    endExpression(JSPrecedence.LOGICAL_AND_PRECEDENCE);
  }

  void visitIs(HIs node) {
    Type type = node.typeExpression;
    Element element = type.element;
    if (element.kind === ElementKind.TYPE_VARIABLE) {
      compiler.unimplemented("visitIs for type variables", instruction: node);
    } else if (element.kind === ElementKind.TYPEDEF) {
      compiler.unimplemented("visitIs for typedefs", instruction: node);
    }
    LibraryElement coreLibrary = compiler.coreLibrary;
    ClassElement objectClass = compiler.objectClass;
    HInstruction input = node.expression;

    int oldPrecedence;
    if (node.nullOk) {
      oldPrecedence = expectedPrecedence;
      beginExpression(JSPrecedence.LOGICAL_OR_PRECEDENCE);
      expectedPrecedence = JSPrecedence.LOGICAL_OR_PRECEDENCE;
      checkNull(input);
      buffer.add(' || ');
    }
    if (element === objectClass || element === compiler.dynamicClass) {
      // The constant folder also does this optimization, but we make
      // it safe by assuming it may have not run.
      buffer.add('true');
    } else if (element == compiler.stringClass) {
      checkString(input, '===');
    } else if (element == compiler.doubleClass) {
      checkDouble(input, '===');
    } else if (element == compiler.numClass) {
      checkNum(input, '===');
    } else if (element == compiler.boolClass) {
      checkBool(input, '===');
    } else if (element == compiler.functionClass) {
      checkFunction(input, element);
    } else if (element == compiler.intClass) {
      beginExpression(JSPrecedence.LOGICAL_AND_PRECEDENCE);
      checkNum(input, '===');
      buffer.add(' && ');
      checkInt(input, '===');
      endExpression(JSPrecedence.LOGICAL_AND_PRECEDENCE);
    } else if (Elements.isStringSupertype(element, compiler)) {
      handleStringSupertypeCheck(input, element);
    } else if (element === compiler.listClass
               || Elements.isListSupertype(element, compiler)) {
      handleListOrSupertypeCheck(input, element);
    } else if (input.propagatedType.canBePrimitive()
               || input.propagatedType.canBeNull()) {
      beginExpression(JSPrecedence.LOGICAL_AND_PRECEDENCE);
      checkObject(input, '===');
      buffer.add(' && ');
      checkType(input, element);
      endExpression(JSPrecedence.LOGICAL_AND_PRECEDENCE);
    } else {
      checkType(input, element);
    }
    if (compiler.codegenWorld.rti.hasTypeArguments(type)) {
      InterfaceType interfaceType = type;
      ClassElement cls = type.element;
      Link<Type> arguments = interfaceType.arguments;
      buffer.add(' && ');
      checkObject(node.typeInfoCall, '===');
      cls.typeParameters.forEach((name, _) {
        buffer.add(' && ');
        beginExpression(JSPrecedence.LOGICAL_AND_PRECEDENCE);
        use(node.typeInfoCall, JSPrecedence.EQUALITY_PRECEDENCE);
        buffer.add(".${name.slowToString()} === '${arguments.head}'");
        endExpression(JSPrecedence.LOGICAL_AND_PRECEDENCE);
      });
    }
    if (node.nullOk) {
      expectedPrecedence = oldPrecedence;
      endExpression(JSPrecedence.LOGICAL_OR_PRECEDENCE);
    }
  }

  void visitTypeConversion(HTypeConversion node) {
    Map<String, SourceString> castNames = const <SourceString> {
      "stringTypeCheck":
          const SourceString("stringTypeCast"),
      "doubleTypeCheck":
          const SourceString("doubleTypeCast"),
      "numTypeCheck":
          const SourceString("numTypeCast"),
      "boolTypeCheck":
          const SourceString("boolTypeCast"),
      "functionTypeCheck":
          const SourceString("functionTypeCast"),
      "intTypeCheck":
          const SourceString("intTypeCast"),
      "stringSuperNativeTypeCheck":
          const SourceString("stringSuperNativeTypeCast"),
      "stringSuperTypeCheck":
          const SourceString("stringSuperTypeCast"),
      "listTypeCheck":
          const SourceString("listTypeCast"),
      "listSuperNativeTypeCheck":
          const SourceString("listSuperNativeTypeCast"),
      "listSuperTypeCheck":
          const SourceString("listSuperTypeCast"),
      "callTypeCheck":
          const SourceString("callTypeCast"),
      "propertyTypeCheck":
          const SourceString("propertyTypeCast")
    };

    if (node.isChecked) {
      Element element = node.type.computeType(compiler).element;
      world.registerIsCheck(element);
      SourceString helper;
      String additionalArgument;
      bool nativeCheck =
          backend.emitter.nativeEmitter.requiresNativeIsCheck(element);
      beginExpression(JSPrecedence.CALL_PRECEDENCE);

      if (node.isArgumentTypeCheck) {
        buffer.add('if (');
        if (element == compiler.intClass) {
          checkInt(node.checkedInput, '!==');
        } else {
          assert(element == compiler.numClass);
          checkNum(node.checkedInput, '!==');
        }
        buffer.add(') ');
        generateThrowWithHelper('iae', node.checkedInput);
        return;
      }

      assert(node.isCheckedModeCheck || node.isCastTypeCheck);
      if (element == compiler.stringClass) {
        helper = const SourceString('stringTypeCheck');
      } else if (element == compiler.doubleClass) {
        helper = const SourceString('doubleTypeCheck');
      } else if (element == compiler.numClass) {
        helper = const SourceString('numTypeCheck');
      } else if (element == compiler.boolClass) {
        helper = const SourceString('boolTypeCheck');
      } else if (element == compiler.functionClass || element.isTypedef()) {
        helper = const SourceString('functionTypeCheck');
      } else if (element == compiler.intClass) {
        helper = const SourceString('intTypeCheck');
      } else if (Elements.isStringSupertype(element, compiler)) {
        additionalArgument = compiler.namer.operatorIs(element);
        if (nativeCheck) {
          helper = const SourceString('stringSuperNativeTypeCheck');
        } else {
          helper = const SourceString('stringSuperTypeCheck');
        }
      } else if (element === compiler.listClass) {
        helper = const SourceString('listTypeCheck');
      } else {
        additionalArgument = compiler.namer.operatorIs(element);
        if (Elements.isListSupertype(element, compiler)) {
          if (nativeCheck) {
            helper = const SourceString('listSuperNativeTypeCheck');
          } else {
            helper = const SourceString('listSuperTypeCheck');
          }
        } else if (nativeCheck) {
          helper = const SourceString('callTypeCheck');
        } else {
          helper = const SourceString('propertyTypeCheck');
        }
      }
      if (node.isCastTypeCheck) {
        helper = castNames[helper.stringValue];
      }
      Element helperElement = compiler.findHelper(helper);
      world.registerStaticUse(helperElement);
      buffer.add(compiler.namer.isolateAccess(helperElement));
      buffer.add('(');
      use(node.checkedInput, JSPrecedence.EXPRESSION_PRECEDENCE);
      if (additionalArgument !== null) buffer.add(", '$additionalArgument'");
      buffer.add(')');
      endExpression(JSPrecedence.CALL_PRECEDENCE);
    } else {
      use(node.checkedInput, expectedPrecedence);
    }
  }
}

class SsaOptimizedCodeGenerator extends SsaCodeGenerator {
  SsaOptimizedCodeGenerator(backend, work, parameters, parameterNames)
    : super(backend, work, parameters, parameterNames) {
    // Declare the parameter names only for the optimized version. The
    // unoptimized version has different parameters.
    parameterNames.forEach((Element element, String name) {
      declaredVariables.add(name);
    });
  }

  int maxBailoutParameters;

  HBasicBlock beginGraph(HGraph graph) => graph.entry;
  void endGraph(HGraph graph) {}

  void bailout(HTypeGuard guard, String reason) {
    if (maxBailoutParameters === null) {
      maxBailoutParameters = 0;
      work.guards.forEach((HTypeGuard workGuard) {
        int inputLength = workGuard.inputs.length;
        if (inputLength > maxBailoutParameters) {
          maxBailoutParameters = inputLength;
        }
      });
    }
    HInstruction input = guard.guarded;
    Namer namer = compiler.namer;
    Element element = work.element;
    buffer.add('return ');
    if (element.isInstanceMember()) {
      // TODO(ngeoffray): This does not work in case we come from a
      // super call. We must make bailout names unique.
      buffer.add('this.${namer.getBailoutName(element)}');
    } else {
      buffer.add(namer.isolateBailoutAccess(element));
    }
    buffer.add('(${guard.state}');
    // TODO(ngeoffray): try to put a variable at a deterministic
    // location, so that multiple bailout calls put the variable at
    // the same parameter index.
    int i = 0;
    for (; i < guard.inputs.length; i++) {
      buffer.add(', ');
      use(guard.inputs[i], JSPrecedence.ASSIGNMENT_PRECEDENCE);
    }
    // Make sure we call the bailout method with the number of
    // arguments it expects. This avoids having the underlying
    // JS engine fill them in for us.
    for (; i < maxBailoutParameters; i++) {
      buffer.add(', 0');
    }
    buffer.add(')');
  }

  void visitTypeGuard(HTypeGuard node) {
    addIndentation();
    HInstruction input = node.guarded;
    Element indexingBehavior = compiler.jsIndexingBehaviorInterface;
    if (node.isInteger()) {
      // if (input is !int) bailout
      buffer.add('if (');
      checkInt(input, '!==');
      buffer.add(') ');
      bailout(node, 'Not an integer');
    } else if (node.isNumber()) {
      // if (input is !num) bailout
      buffer.add('if (');
      checkNum(input, '!==');
      buffer.add(') ');
      bailout(node, 'Not a number');
    } else if (node.isBoolean()) {
      // if (input is !bool) bailout
      buffer.add('if (');
      checkBool(input, '!==');
      buffer.add(') ');
      bailout(node, 'Not a boolean');
    } else if (node.isString()) {
      // if (input is !string) bailout
      buffer.add('if (');
      checkString(input, '!==');
      buffer.add(') ');
      bailout(node, 'Not a string');
    } else if (node.isExtendableArray()) {
      // if (input is !Object || input is !Array || input.isFixed) bailout
      buffer.add('if (');
      checkObject(input, '!==');
      buffer.add('||');
      checkArray(input, '!==');
      buffer.add('||');
      checkFixedArray(input);
      buffer.add(') ');
      bailout(node, 'Not an extendable array');
    } else if (node.isMutableArray()) {
      // if (input is !Object
      //     || ((input is !Array || input.isImmutable)
      //         && input is !JsIndexingBehavior)) bailout
      buffer.add('if (');
      checkObject(input, '!==');
      buffer.add(' || ((');
      checkArray(input, '!==');
      buffer.add(' || ');
      checkImmutableArray(input);
      buffer.add(') && ');
      checkType(input, indexingBehavior, negative: true);
      buffer.add(')) ');
      bailout(node, 'Not a mutable array');
    } else if (node.isReadableArray()) {
      // if (input is !Object
      //     || (input is !Array && input is !JsIndexingBehavior)) bailout
      buffer.add('if (');
      checkObject(input, '!==');
      buffer.add(' || (');
      checkArray(input, '!==');
      buffer.add(' && ');
      checkType(input, indexingBehavior, negative: true);
      buffer.add(')) ');
      bailout(node, 'Not an array');
    } else if (node.isIndexablePrimitive()) {
      // if (input is !String
      //     && (input is !Object
      //         || (input is !Array && input is !JsIndexingBehavior))) bailout
      buffer.add('if (');
      checkString(input, '!==');
      buffer.add(' && (');
      checkObject(input, '!==');
      buffer.add(' || (');
      checkArray(input, '!==');
      buffer.add(' && ');
      checkType(input, indexingBehavior, negative: true);
      buffer.add('))) ');
      bailout(node, 'Not a string or array');
    } else {
      compiler.internalError('Unexpected type guard', instruction: input);
    }
    buffer.add(';\n');
  }

  void beginLoop(HBasicBlock block) {
    addIndentation();
    HLoopInformation info = block.loopInformation;
    for (LabelElement label in info.labels) {
      writeLabel(label);
      buffer.add(":");
    }
    buffer.add('while (true) {\n');
    indent++;
  }

  void endLoop(HBasicBlock block) {
    indent--;
    addIndented('}\n');  // Close 'while' loop.
  }

  void handleLoopCondition(HLoopBranch node) {
    buffer.add('if (!');
    use(node.inputs[0], JSPrecedence.PREFIX_PRECEDENCE);
    buffer.add(') break;\n');
  }


  void preLabeledBlock(HLabeledBlockInformation labeledBlockInfo) {
  }

  void startLabeledBlock(HLabeledBlockInformation labeledBlockInfo) {
  }

  void endLabeledBlock(HLabeledBlockInformation labeledBlockInfo) {
  }
}

class SsaUnoptimizedCodeGenerator extends SsaCodeGenerator {

  final StringBuffer setup;
  final StringBuffer newParameters;
  final List<String> labels;
  int labelId = 0;

  SsaBailoutPropagator propagator;
  HInstruction savedFirstInstruction;

  SsaUnoptimizedCodeGenerator(backend, work, parameters, parameterNames)
    : super(backend, work, parameters, parameterNames),
      setup = new StringBuffer(),
      newParameters = new StringBuffer(),
      labels = <String>[];

  String pushLabel() {
    String label = 'L${labelId++}';
    labels.addLast(label);
    return label;
  }

  String popLabel() {
    return labels.removeLast();
  }

  String currentLabel() {
    return labels.last();
  }

  HBasicBlock beginGraph(HGraph graph) {
    propagator = new SsaBailoutPropagator(compiler, generateAtUseSite);
    propagator.visitGraph(graph);
    // TODO(ngeoffray): We could avoid generating the state at the
    // call site for non-complex bailout methods.
    newParameters.add('state');

    if (propagator.hasComplexTypeGuards) {
      // Use generic parameters that will be assigned to
      // the right variables in the setup phase.
      for (int i = 0; i < propagator.maxBailoutParameters; i++) {
        String name = 'env$i';
        declaredVariables.add(name);
        newParameters.add(', $name');
      }

      startBailoutSwitch();

      // The setup phase of a bailout function sets up the environment for
      // each bailout target. Each bailout target will populate this
      // setup phase. It is put at the beginning of the function.
      setup.add('  switch (state) {\n');
      return graph.entry;
    } else {
      // We have a simple type guard, so we can reuse the names that
      // the type guard expects.
      for (HInstruction input in propagator.firstTypeGuard.inputs) {
        input = unwrap(input);
        String name = variableNames.getName(input);
        declaredVariables.add(name);
        newParameters.add(', $name');
      }

      // We change the first instruction of the first guard to be the
      // guard. We will change it back in the call to [endGraph].
      HBasicBlock block = propagator.firstTypeGuard.block;
      savedFirstInstruction = block.first;
      block.first = propagator.firstTypeGuard;
      return block;
    }
  }

  // If argument is a [HCheck] and it does not have a name, we try to
  // find the name of its checked input. Note that there must be a
  // name, otherwise the instruction would not be in the live
  // environment.
  HInstruction unwrap(HInstruction argument) {
    while (argument is HCheck && !variableNames.hasName(argument)) {
      argument = argument.checkedInput;
    }
    assert(variableNames.hasName(argument));
    return argument;
  }

  void endGraph(HGraph graph) {
    if (propagator.hasComplexTypeGuards) {
      indent--; // Close original case.
      indent--;
      addIndented('}\n');  // Close 'switch'.
      setup.add('  }\n');
    } else {
      // Put back the original first instruction of the block.
      propagator.firstTypeGuard.block.first = savedFirstInstruction;
    }
  }

  bool visitAndOrInfo(HAndOrBlockInformation info) => false;

  bool visitIfInfo(HIfBlockInformation info) {
    if (info.thenGraph.start.hasGuards()) return false;
    if (info.elseGraph.start.hasGuards()) return false;
    return super.visitIfInfo(info);
  }

  bool visitLoopInfo(HLoopBlockInformation info) {
    if (info.start.hasGuards()) return false;
    if (info.loopHeader.hasGuards()) return false;
    return super.visitLoopInfo(info);
  }

  bool visitTryInfo(HTryBlockInformation info) => false;
  bool visitSequenceInfo(HStatementSequenceInformation info) => false;

  void visitTypeGuard(HTypeGuard node) {
    if (!propagator.hasComplexTypeGuards) return;

    indent--;
    addIndented('case ${node.state}:\n');
    indent++;
    addIndented('state = 0;\n');

    setup.add('    case ${node.state}:\n');
    int i = 0;
    for (HInstruction input in node.inputs) {
      input = unwrap(input);
      String name = variableNames.getName(input);
      setup.add('      ');
      if (!isVariableDeclared(name)) {
        declaredVariables.add(name);
        setup.add('var ');
      }
      setup.add('$name = env$i;\n');
      i++;
    }
    setup.add('      break;\n');
  }

  void startBailoutCase(List<HTypeGuard> bailouts1,
                        List<HTypeGuard> bailouts2) {
    indent--;
    handleBailoutCase(bailouts1);
    handleBailoutCase(bailouts2);
    indent++;
  }

  void handleBailoutCase(List<HTypeGuard> guards) {
    for (int i = 0, len = guards.length; i < len; i++) {
      addIndented('case ${guards[i].state}:\n');
    }
  }

  void startBailoutSwitch() {
    addIndented('switch (state) {\n');
    indent++;
    addIndented('case 0:\n');
    indent++;
  }

  void endBailoutSwitch() {
    indent--; // Close 'case'.
    indent--;
    addIndented('}\n');  // Close 'switch'.
  }

  void beginLoop(HBasicBlock block) {
    String newLabel = pushLabel();
    if (block.hasGuards()) {
      startBailoutCase(block.guards, const <HTypeGuard>[]);
    }

    addIndentation();
    HLoopInformation loopInformation = block.loopInformation;
    for (LabelElement label in loopInformation.labels) {
      writeLabel(label);
      buffer.add(":");
    }
    buffer.add('$newLabel: while (true) {\n');
    indent++;

    if (block.hasGuards()) {
      startBailoutSwitch();
      if (loopInformation.target !== null) {
        breakAction[loopInformation.target] = (TargetElement target) {
          addIndented("break $newLabel;\n");
        };
      }
    }
  }

  void endLoop(HBasicBlock block) {
    popLabel();
    HBasicBlock header = block.isLoopHeader() ? block : block.parentLoopHeader;
    if (header.hasGuards()) {
      endBailoutSwitch();
      HLoopInformation info = header.loopInformation;
      if (info.target != null) breakAction.remove(info.target);
    }
    indent--;
    addIndented('}\n');  // Close 'while'.
  }

  void handleLoopCondition(HLoopBranch node) {
    buffer.add('if (!');
    use(node.inputs[0], JSPrecedence.PREFIX_PRECEDENCE);
    buffer.add(') break ${currentLabel()};\n');
  }

  void generateIf(HIf node, HIfBlockInformation info) {
    HStatementInformation thenGraph = info.thenGraph;
    HStatementInformation elseGraph = info.elseGraph;
    bool thenHasGuards = thenGraph.start.hasGuards();
    bool elseHasGuards = elseGraph.start.hasGuards();
    bool hasGuards = thenHasGuards || elseHasGuards;
    if (!hasGuards) return super.generateIf(node, info);

    int elseKind = analyzeGraphForCodegen(elseGraph);
    bool emptyElse = elseKind == SsaCodeGenerator.EMPTY;

    startBailoutCase(thenGraph.start.guards,
        emptyElse ? const <HTypeGuard>[] : elseGraph.start.guards);

    addIndented('if (');
    int precedence = JSPrecedence.EXPRESSION_PRECEDENCE;
    // TODO(ngeoffray): Put the condition initialization in the
    // [setup] buffer.
    List<HTypeGuard> guards = node.thenBlock.guards;
    for (int i = 0, len = guards.length; i < len; i++) {
      buffer.add('state == ${guards[i].state} || ');
    }
    buffer.add('(state == 0 && ');
    precedence = JSPrecedence.BITWISE_OR_PRECEDENCE;
    use(node.inputs[0], precedence);

    buffer.add(')) {\n');

    indent++;
    if (thenHasGuards) startBailoutSwitch();
    generateStatements(thenGraph);
    if (thenHasGuards) endBailoutSwitch();
    indent--;

    if (!emptyElse) {
      addIndented('} else {\n');
      indent++;
      if (elseHasGuards) startBailoutSwitch();
      generateStatements(elseGraph);
      if (elseHasGuards) endBailoutSwitch();
      indent--;
    }

    addIndented('}\n');
  }

  void preLabeledBlock(HLabeledBlockInformation labeledBlockInfo) {
    if (labeledBlockInfo.body.start.hasGuards()) {
      indent--;
      handleBailoutCase(labeledBlockInfo.body.start.guards);
      indent++;
    }
  }

  void startLabeledBlock(HLabeledBlockInformation labeledBlockInfo) {
    if (labeledBlockInfo.body.start.hasGuards()) {
      startBailoutSwitch();
    }
  }

  void endLabeledBlock(HLabeledBlockInformation labeledBlockInfo) {
    if (labeledBlockInfo.body.start.hasGuards()) {
      endBailoutSwitch();
    }
  }
}

String singleIdentityComparison(HInstruction left, HInstruction right) {
  // Returns the single identity comparison (== or ===) or null if a more
  // complex expression is required.
  HType leftType = left.propagatedType;
  HType rightType = right.propagatedType;
  if (leftType.canBeNull() && rightType.canBeNull()) {
    if (left.isConstantNull() || right.isConstantNull() ||
        (leftType.isPrimitive() && leftType == rightType)) {
      return '==';
    }
    return null;
  } else {
    return '===';
  }
}