Make IL instructions a doubly-linked list within basic blocks.

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/bit_vector.h"
 #include "vm/code_descriptors.h"
 #include "vm/dart_entry.h"
@@ skipping 55 matching lines @@
   }
   if (is_empty()) {
     entry_ = exit_ = instruction;
   } else {
     exit()->SetSuccessor(instruction);
     exit_ = instruction;
   }
 }
 
 
+// Appends a graph fragment to a block entry instruction and returns the exit
+// of the resulting graph fragment.
+static Instruction* AppendFragment(BlockEntryInstr* entry,
+                                   const EffectGraphVisitor& fragment) {
+  if (fragment.is_empty()) return entry;
+  entry->SetSuccessor(fragment.entry());
+  return fragment.exit();
+}

[srdjan, 2012/06/25 15:57:16]

I like it a lot that we factor out the knowledge of how the IL nodes are
connected.

+
+
 void EffectGraphVisitor::Join(const TestGraphVisitor& test_fragment,
                               const EffectGraphVisitor& true_fragment,
                               const EffectGraphVisitor& false_fragment) {
   // We have: a test graph fragment with zero, one, or two available exits;
   // and a pair of effect graph fragments with zero or one available exits.
   // We want to append the branch and (if necessary) a join node to this
   // graph fragment.
   ASSERT(is_open());
 
   // 1. Connect the test to this graph.
   Append(test_fragment);
 
   // 2. Connect the true and false bodies to the test and record their exits
   // (if any).
-  Instruction* true_exit = NULL;
-  Instruction* false_exit = NULL;
   TargetEntryInstr* true_entry = new TargetEntryInstr();
   *test_fragment.true_successor_address() = true_entry;
-  true_entry->SetSuccessor(true_fragment.entry());
-  true_exit = true_fragment.is_empty() ? true_entry : true_fragment.exit();
+  Instruction* true_exit = AppendFragment(true_entry, true_fragment);
 
   TargetEntryInstr* false_entry = new TargetEntryInstr();
   *test_fragment.false_successor_address() = false_entry;
-  false_entry->SetSuccessor(false_fragment.entry());
-  false_exit = false_fragment.is_empty() ? false_entry : false_fragment.exit();
+  Instruction* false_exit = AppendFragment(false_entry, false_fragment);
 
   // 3. Add a join or select one (or neither) of the arms as exit.
   if (true_exit == NULL) {
     exit_ = false_exit;  // May be NULL.
     if (false_exit != NULL) temp_index_ = false_fragment.temp_index();
   } else if (false_exit == NULL) {
     exit_ = true_exit;
     temp_index_ = true_fragment.temp_index();
   } else {
     exit_ = new JoinEntryInstr();
     true_exit->SetSuccessor(exit_);
     false_exit->SetSuccessor(exit_);
     ASSERT(true_fragment.temp_index() == false_fragment.temp_index());
     temp_index_ = true_fragment.temp_index();
   }
 }
 
 
 void EffectGraphVisitor::TieLoop(const TestGraphVisitor& test_fragment,
                                  const EffectGraphVisitor& body_fragment) {
   // We have: a test graph fragment with zero, one, or two available exits;
   // and an effect graph fragment with zero or one available exits.  We want
   // to append the 'while loop' consisting of the test graph fragment as
   // condition and the effect graph fragment as body.
   ASSERT(is_open());
 
   // 1. Connect the body to the test if it is reachable, and if so record
   // its exit (if any).
-  Instruction* body_exit = NULL;
   TargetEntryInstr* body_entry = new TargetEntryInstr();
   *test_fragment.true_successor_address() = body_entry;
-  body_entry->SetSuccessor(body_fragment.entry());
-  body_exit = body_fragment.is_empty() ? body_entry : body_fragment.exit();
+  Instruction* body_exit = AppendFragment(body_entry, body_fragment);
 
   // 2. Connect the test to this graph, including the body if reachable and
   // using a fresh join node if the body is reachable and has an open exit.
   if (body_exit == NULL) {
     Append(test_fragment);
   } else {
     JoinEntryInstr* join = new JoinEntryInstr();
     AddInstruction(join);
     join->SetSuccessor(test_fragment.entry());
     body_exit->SetSuccessor(join);
@@ skipping 974 matching lines @@
 
   TestGraphVisitor for_test(owner(),
                             temp_index(),
                             node->condition()->token_pos());
   node->condition()->Visit(&for_test);
   ASSERT(is_open());
 
   // Tie do-while loop (test is after the body).
   JoinEntryInstr* body_entry_join = new JoinEntryInstr();
   AddInstruction(body_entry_join);
-  body_entry_join->SetSuccessor(for_body.entry());
-  Instruction* body_exit =
-      for_body.is_empty() ? body_entry_join : for_body.exit();
+  Instruction* body_exit = AppendFragment(body_entry_join, for_body);
 
   if (for_body.is_open() || (node->label()->join_for_continue() != NULL)) {
     BlockEntryInstr* test_entry = NULL;
     if (node->label()->join_for_continue() == NULL) {
       test_entry = new TargetEntryInstr();
     } else {
       test_entry = node->label()->join_for_continue();
     }
     test_entry->SetSuccessor(for_test.entry());
     if (body_exit != NULL) {
@@ skipping 1201 matching lines @@
                                &preorder_block_entries_,
                                &postorder_block_entries_,
                                &parent,
                                &assigned_vars,
                                variable_count);
   // Number blocks in reverse postorder.
   intptr_t block_count = postorder_block_entries_.length();
   for (intptr_t i = 0; i < block_count; ++i) {
     postorder_block_entries_[i]->set_block_id(block_count - i - 1);
   }
-  if (for_optimized && FLAG_use_ssa) {
-    GrowableArray<BitVector*> dominance_frontier;
-    ComputeDominators(&preorder_block_entries_, &parent, &dominance_frontier);
-    InsertPhis(preorder_block_entries_,
-               assigned_vars,
-               variable_count,
-               dominance_frontier);
-    Rename(variable_count);
+  if (for_optimized) {
+    // Link instructions backwards for optimized compilation.
+    for (intptr_t i = 0; i < block_count; ++i) {
+      Instruction* prev = postorder_block_entries_[i];
+      Instruction* current = prev->StraightLineSuccessor();
+      while (current != NULL && !current->IsBlockEntry()) {
+        current->SetPrevious(prev);
+        prev = current;
+        current = current->StraightLineSuccessor();
+      }
+    }
+
+    // Construct SSA form.
+    if (FLAG_use_ssa) {
+      GrowableArray<BitVector*> dominance_frontier;
+      ComputeDominators(&preorder_block_entries_, &parent, &dominance_frontier);
+      InsertPhis(preorder_block_entries_,
+                 assigned_vars,
+                 variable_count,
+                 dominance_frontier);
+      Rename(variable_count);
+    }
   }
   if (FLAG_print_flow_graph || (Dart::flow_graph_writer() != NULL)) {
     intptr_t length = postorder_block_entries_.length();
     GrowableArray<BlockEntryInstr*> reverse_postorder(length);
     for (intptr_t i = length - 1; i >= 0; --i) {
       reverse_postorder.Add(postorder_block_entries_[i]);
     }
     if (FLAG_print_flow_graph) {
       // Print flow graph to stdout.
       FlowGraphPrinter printer(function, reverse_postorder);
@@ skipping 241 matching lines @@
         if (phi != NULL) {
           (*env)[i] = new UseVal(phi);
           phi->set_ssa_temp_index(current_ssa_temp_index_++);  // New SSA temp.
         }
       }
     }
   }
 
   // 2. Process normal instructions.
   Instruction* current = block_entry->StraightLineSuccessor();
-  Instruction* prev = block_entry;
   while ((current != NULL) && !current->IsBlockEntry()) {
     // 2a. Handle uses of LoadLocal / StoreLocal
     // For each use of a LoadLocal or StoreLocal: Replace it with the value
     // from the environment.
     for (intptr_t i = 0; i < current->InputCount(); ++i) {
       Value* v = current->InputAt(i);
       if (v->IsUse() &&
           v->AsUse()->definition()->IsBind() &&
           v->AsUse()->definition()->AsBind()->computation()->IsLoadLocal()) {
         Computation* comp = v->AsUse()->definition()->AsBind()->computation();
@@ skipping 35 matching lines @@
     if (current->IsDo() &&
         current->AsDo()->computation()->IsStoreLocal()) {
       store = current->AsDo()->computation()->AsStoreLocal();
     } else if (current->IsBind() &&
                current->AsBind()->computation()->IsStoreLocal()) {
       store = current->AsBind()->computation()->AsStoreLocal();
     }
 
     if (load != NULL) {
       // Remove instruction.
-      prev->SetSuccessor(current->StraightLineSuccessor());
+      current->RemoveFromGraph();
     } else if (store != NULL) {
       // Remove instruction and update renaming environment.
-      prev->SetSuccessor(current->StraightLineSuccessor());
+      current->RemoveFromGraph();
       (*env)[store->local().BitIndexIn(var_count)] = store->value();
-    } else {
+    } else if (current->IsBind()) {
       // Assign new SSA temporary.
-      if (current->IsBind()) {
-        current->AsDefinition()->set_ssa_temp_index(current_ssa_temp_index_++);
-      }
-      // Update previous only if no instruction was removed from the graph.
-      prev = current;
+      current->AsDefinition()->set_ssa_temp_index(current_ssa_temp_index_++);
     }
     current = current->StraightLineSuccessor();
   }
 
   // 3. Process dominated blocks.
   for (intptr_t i = 0; i < block_entry->dominated_blocks().length(); ++i) {
     BlockEntryInstr* block = block_entry->dominated_blocks()[i];
     ZoneGrowableArray<Value*>* new_env =
         new ZoneGrowableArray<Value*>(var_count);
     new_env->AddArray(*env);
@@ skipping 30 matching lines @@
   char* chars = reinterpret_cast<char*>(
       Isolate::Current()->current_zone()->Allocate(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