Separate branch on strict compare into a new IL instruction.

runtime/vm/flow_graph_builder.cc

 // 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.
 
 #include "vm/flow_graph_builder.h"
 
 #include "vm/ast_printer.h"
 #include "vm/code_descriptors.h"
 #include "vm/dart_entry.h"
 #include "vm/flags.h"
@@ skipping 258 matching lines @@
 
 
 void TestGraphVisitor::ReturnValue(Value* value) {
   if (FLAG_enable_type_checks) {
     value = Bind(new AssertBooleanComp(condition_token_pos(),
                                        owner()->try_index(),
                                        value));
   }
   const Bool& bool_true = Bool::ZoneHandle(Bool::True());
   Value* constant_true = Bind(Constant(bool_true));
-  BranchInstr* branch = new BranchInstr(condition_token_pos(),
-                                        owner()->try_index(),
-                                        value,
-                                        constant_true,
-                                        Token::kEQ_STRICT);
+  StrictCompareAndBranchInstr* branch =
+      new StrictCompareAndBranchInstr(value, constant_true, Token::kEQ_STRICT);
   AddInstruction(branch);
   CloseFragment();
   true_successor_address_ = branch->true_successor_address();
   false_successor_address_ = branch->false_successor_address();
 }
 
 
 void TestGraphVisitor::MergeBranchWithComparison(ComparisonComp* comp) {
   ASSERT(!FLAG_enable_type_checks);
   BranchInstr* branch = new BranchInstr(condition_token_pos(),
                                         owner()->try_index(),
                                         comp->left(),
                                         comp->right(),
                                         comp->kind());
   AddInstruction(branch);
   CloseFragment();
   true_successor_address_ = branch->true_successor_address();
   false_successor_address_ = branch->false_successor_address();
 }
 
 
 void TestGraphVisitor::MergeBranchWithNegate(BooleanNegateComp* comp) {
   ASSERT(!FLAG_enable_type_checks);
   const Bool& bool_true = Bool::ZoneHandle(Bool::True());
   Value* constant_true = Bind(Constant(bool_true));
-  BranchInstr* branch = new BranchInstr(condition_token_pos(),
-                                        owner()->try_index(),
-                                        comp->value(),
-                                        constant_true,
-                                        Token::kNE_STRICT);
+  StrictCompareAndBranchInstr* branch =
+      new StrictCompareAndBranchInstr(comp->value(),
+                                      constant_true,
+                                      Token::kNE_STRICT);
   AddInstruction(branch);
   CloseFragment();
   true_successor_address_ = branch->true_successor_address();
   false_successor_address_ = branch->false_successor_address();
 }
 
 
 void TestGraphVisitor::ReturnComputation(Computation* computation) {
   if (!FLAG_enable_type_checks) {
     if (computation->AsComparison() != NULL) {
@@ skipping 2089 matching lines @@
   intptr_t len = OS::SNPrint(NULL, 0, kFormat, function_name, reason) + 1;
   char* chars = Isolate::Current()->current_zone()->Alloc<char>(len);
   OS::SNPrint(chars, len, kFormat, function_name, reason);
   const Error& error = Error::Handle(
       LanguageError::New(String::Handle(String::New(chars))));
   Isolate::Current()->long_jump_base()->Jump(1, error);
 }
 
 
 }  // namespace dart