kernel->ssa: Implement for-loops and while-loops

pkg/compiler/lib/src/ssa/graph_builder.dart

 // Copyright (c) 2016, 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.
 
+import '../compiler.dart';
 import '../elements/elements.dart';
+import '../resolution/tree_elements.dart';
 import '../types/types.dart';
 
+import 'jump_handler.dart';
 import 'locals_handler.dart';
 import 'nodes.dart';
 
 /// Base class for objects that build up an SSA graph.
 ///
 /// This contains helpers for building the graph and tracking information about
 /// the current state of the graph being built.
 abstract class GraphBuilder {
   /// Holds the resulting SSA graph.
   final HGraph graph = new HGraph();
 
+  // TODO(het): remove this
+  /// A reference to the compiler.
+  Compiler compiler;
+
+  /// The tree elements for the element being built into an SSA graph.
+  TreeElements get elements;
+
   /// Used to track the locals while building the graph.
   LocalsHandler localsHandler;
 
   /// A stack of instructions.
   ///
   /// We build the SSA graph by simulating a stack machine.
   List<HInstruction> stack = <HInstruction>[];
 
+  /// The count of nested loops we are currently building.
+  ///
+  /// The loop nesting is consulted when inlining a function invocation. The
+  /// inlining heuristics take this information into account.
+  int loopDepth = 0;
+
+  /// A mapping from jump targets to their handlers.
+  Map<JumpTarget, JumpHandler> jumpTargets = <JumpTarget, JumpHandler>{};
+
   void push(HInstruction instruction) {
     add(instruction);
     stack.add(instruction);
   }
 
   HInstruction pop() {
     return stack.removeLast();
   }
 
   /// Pops the most recent instruction from the stack and 'boolifies' it.
@@ skipping 89 matching lines @@
   HParameterValue addParameter(Entity parameter, TypeMask type) {
     HParameterValue result = new HParameterValue(parameter, type);
     if (lastAddedParameter == null) {
       graph.entry.addBefore(graph.entry.first, result);
     } else {
       graph.entry.addAfter(lastAddedParameter, result);
     }
     lastAddedParameter = result;
     return result;
   }
+
+  HSubGraphBlockInformation wrapStatementGraph(SubGraph statements) {
+    if (statements == null) return null;
+    return new HSubGraphBlockInformation(statements);
+  }
+
+  HSubExpressionBlockInformation wrapExpressionGraph(SubExpression expression) {
+    if (expression == null) return null;
+    return new HSubExpressionBlockInformation(expression);
+  }
 }