Streamline code generator for branches and comparisons.

runtime/vm/flow_graph_compiler.cc

 // Copyright (c) 2013, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 #include "vm/globals.h"  // Needed here to get TARGET_ARCH_XXX.
 
 #include "vm/flow_graph_compiler.h"
 
 #include "vm/cha.h"
 #include "vm/dart_entry.h"
@@ skipping 299 matching lines @@
 }
 
 
 bool FlowGraphCompiler::WasCompacted(
     BlockEntryInstr* block_entry) const {
   const intptr_t block_index = block_entry->postorder_number();
   return block_info_[block_index]->WasCompacted();
 }
 
 
+Label* FlowGraphCompiler::NextNonEmptyLabel() const {
+  const intptr_t current_index = current_block()->postorder_number();
+  return block_info_[current_index]->next_nonempty_label();
+}
+
+
 bool FlowGraphCompiler::CanFallThroughTo(BlockEntryInstr* block_entry) const {
-  const intptr_t current_index = current_block()->postorder_number();
-  Label* next_nonempty = block_info_[current_index]->next_nonempty_label();
-  return next_nonempty == GetJumpLabel(block_entry);
+  return NextNonEmptyLabel() == GetJumpLabel(block_entry);
+}
+
+
+BranchLabels FlowGraphCompiler::CreateBranchLabels(BranchInstr* branch) const {
+  Label* true_label = GetJumpLabel(branch->true_successor());
+  Label* false_label = GetJumpLabel(branch->false_successor());
+  Label* fall_through = NextNonEmptyLabel();
+  BranchLabels result = { true_label, false_label, fall_through };
+  return result;
 }
 
 
 void FlowGraphCompiler::AddSlowPathCode(SlowPathCode* code) {
   slow_path_code_.Add(code);
 }
 
 
 void FlowGraphCompiler::GenerateDeferredCode() {
   for (intptr_t i = 0; i < slow_path_code_.length(); i++) {
@@ skipping 867 matching lines @@
 
   for (int i = 0; i < len; i++) {
     sorted->Add(CidTarget(ic_data.GetReceiverClassIdAt(i),
                           &Function::ZoneHandle(ic_data.GetTargetAt(i)),
                           ic_data.GetCountAt(i)));
   }
   sorted->Sort(HighestCountFirst);
 }
 
 }  // namespace dart