First step to SSA construction: Phi insertion.

vm/il_printer.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/il_printer.h"
 
 #include "vm/intermediate_language.h"
 #include "vm/os.h"
 
 namespace dart {
@@ skipping 312 matching lines @@
 }
 
 
 void GraphEntryInstr::PrintTo(BufferFormatter* f) const {
   f->Print("%2d: [graph]", block_id());
 }
 
 
 void JoinEntryInstr::PrintTo(BufferFormatter* f) const {
   f->Print("%2d: [join]", block_id());
+  if (phis_ != NULL) {
+    for (intptr_t i = 0; i < phis_->length(); ++i) {
+      if ((*phis_)[i] == NULL) continue;
+      f->Print("\n");
+      (*phis_)[i]->PrintTo(f);
+    }
+  }
+}
+
+
+void PhiInstr::PrintTo(BufferFormatter* f) const {
+  f->Print("     phi(");
+  for (intptr_t i = 0; i < inputs_.length(); ++i) {
+    if (inputs_[i] != NULL) inputs_[i]->PrintTo(f);
+    if (i < inputs_.length() - 1) f->Print(",");
+  }
+  f->Print(")");
 }
 
 
 void TargetEntryInstr::PrintTo(BufferFormatter* f) const {
   f->Print("%2d: [target", block_id());
   if (HasTryIndex()) {
     f->Print(" catch %d]", try_index());
   } else {
     f->Print("]");
   }
@@ skipping 116 matching lines @@
         Print("%s \"B%d\"\n", "dominator", entry->dominator()->block_id());
       }
 
       // TODO(fschneider): Mark blocks with loop nesting level.
       Print("%s %d\n", "loop_depth", 0);
 
       {
         BEGIN("states");  // Required section.
         {
           BEGIN("locals");  // Required section.
-          // TODO(fschneider): Insert phi-instructions here.
-          intptr_t num_phis = 0;
+          JoinEntryInstr* join = entry->AsJoinEntry();
+          intptr_t num_phis = (join != NULL && join->phi_count())
+              ? join->phis()->length()
+              : 0;
           Print("%s %d\n", "size", num_phis);
+          for (intptr_t j = 0; j < num_phis; ++j) {
+            PhiInstr* phi = (*join->phis())[j];
+            if (phi != NULL) {
+              Print("%d ", j);  // Print variable index.
+              char buffer[120];
+              BufferFormatter formatter(buffer, sizeof(buffer));
+              phi->PrintToVisualizer(&formatter);
+              Print("%s\n", buffer);
+            }
+          }
           END("locals");
         }
         END("states");
       }
 
       {
         BEGIN("HIR");
         // Print the block entry.
         Print("0 0 ");  // Required fields "bci" and "use". Unused.
         Instruction* current = block_order_[i];
@@ skipping 27 matching lines @@
 void GraphEntryInstr::PrintToVisualizer(BufferFormatter* f) const {
   f->Print("_ [graph]");
 }
 
 
 void JoinEntryInstr::PrintToVisualizer(BufferFormatter* f) const {
   f->Print("_ [join]");
 }
 
 
+void PhiInstr::PrintToVisualizer(BufferFormatter* f) const {
+  // TODO(fschneider): Print operands when SSA renaming is implemented.
+  f->Print("v [");
+  for (intptr_t i = 0; i < InputCount(); ++i) {
+    f->Print(" v ");
+  }
+  f->Print("]");
+}
+
+
 void TargetEntryInstr::PrintToVisualizer(BufferFormatter* f) const {
   f->Print("_ [target");
   if (HasTryIndex()) {
     f->Print(" catch %d]", try_index());
   } else {
     f->Print("]");
   }
 }
 
 
@@ skipping 33 matching lines @@
   f->Print("_ %s ", DebugName());
   f->Print("if ");
   value()->PrintTo(f);
   f->Print(" goto (B%d, B%d)",
             true_successor()->block_id(),
             false_successor()->block_id());
 }
 
 
 }  // namespace dart