Added LoadLiteralComp, StrictCompareComp; implement InstanceCallNode.

runtime/vm/flow_graph_builder.h

 // 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.
 
 #ifndef VM_FLOW_GRAPH_BUILDER_H_
 #define VM_FLOW_GRAPH_BUILDER_H_
 
 #include "vm/allocation.h"
 #include "vm/ast.h"
 #include "vm/growable_array.h"
@@ skipping 71 matching lines @@
   // which parts are reachable.  Afterward, the graph exit is the false
   // successor of the loop condition.
   void TieLoop(const TestGraphVisitor& test_fragment,
                const EffectGraphVisitor& body_fragment);
 
  protected:
   // Implement the core part of the translation of expression node types.
   AssertAssignableComp* TranslateAssignable(const AssignableNode& node);
   InstanceCallComp* TranslateBinaryOp(const BinaryOpNode& node);
   InstanceCallComp* TranslateUnaryOp(const UnaryOpNode& node);
-  InstanceCallComp* TranslateComparison(const ComparisonNode& node);
+  Computation* TranslateComparison(const ComparisonNode& node);
   StoreLocalComp* TranslateStoreLocal(const StoreLocalNode& node);
   StaticCallComp* TranslateStaticCall(const StaticCallNode& node);
+  InstanceCallComp* TranslateInstanceCall(const InstanceCallNode& node);
 
   void CloseFragment() { exit_ = NULL; }
   intptr_t AllocateTempIndex() { return temp_index_++; }
 
  private:
   // Helper to append a Do instruction to the graph.
   void DoComputation(Computation* computation) {
     AddInstruction(new DoInstr(computation));
   }
 
@@ skipping 100 matching lines @@
   TargetEntryInstr** true_successor_address_;
   TargetEntryInstr** false_successor_address_;
 };
 
 #undef DEFINE_VISIT
 
 
 }  // namespace dart
 
 #endif  // VM_FLOW_GRAPH_BUILDER_H_