Repair flow graph printing after graph refactoring.

runtime/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"
 #include "vm/parser.h"
 
@@ skipping 59 matching lines @@
   instr->PrintTo(&f);
   if (FLAG_print_environments && (instr->env() != NULL)) {
     instr->env()->PrintTo(&f);
   }
   if (print_locations && (instr->locs() != NULL)) {
     instr->locs()->PrintTo(&f);
   }
   if (instr->lifetime_position() != -1) {
     OS::Print("%3"Pd": ", instr->lifetime_position());
   }
+  if (!instr->IsBlockEntry()) OS::Print("    ");
   OS::Print("%s", str);
 }
 
 
 void FlowGraphPrinter::PrintTypeCheck(const ParsedFunction& parsed_function,
                                       intptr_t token_pos,
                                       Value* value,
                                       const AbstractType& dst_type,
                                       const String& dst_name,
                                       bool eliminated) {
@@ skipping 31 matching lines @@
       }
       const Class& cls =
           Class::Handle(Isolate::Current()->class_table()->At(class_ids[k]));
       f->Print("%s", String::Handle(cls.Name()).ToCString());
     }
   }
   f->Print("]");
 }
 
 
+static void PrintPropagatedType(BufferFormatter* f, const Definition& def) {
+  if (def.HasPropagatedType()) {
+    String& name = String::Handle();
+    name = AbstractType::Handle(def.PropagatedType()).Name();
+    f->Print(" {PT: %s}", name.ToCString());
+  }
+  if (def.has_propagated_cid()) {
+    const Class& cls = Class::Handle(
+        Isolate::Current()->class_table()->At(def.propagated_cid()));
+    f->Print(" {PCid: %s}", String::Handle(cls.Name()).ToCString());
+  }
+}
+
+
+static void PrintUse(BufferFormatter* f, const Definition& definition) {
+  if (definition.is_used()) {
+    if (definition.HasSSATemp()) {
+      f->Print("v%"Pd, definition.ssa_temp_index());
+    } else if (definition.temp_index() != -1) {
+      f->Print("t%"Pd, definition.temp_index());
+    }
+  }
+}
+
+
 void Definition::PrintTo(BufferFormatter* f) const {
-  // Do not access 'deopt_id()' as it asserts that the computation can
-  // deoptimize.
-  if (HasSSATemp()) {
-    f->Print("v%"Pd" <- ", ssa_temp_index());
+  PrintUse(f, *this);
+  if (is_used()) {
+    if (HasSSATemp() || (temp_index() != -1)) f->Print(" <- ");
   }
-  f->Print("%s:%"Pd"(", DebugName(), deopt_id_);
+  f->Print("%s:%"Pd"(", DebugName(), GetDeoptId());
   PrintOperandsTo(f);
   f->Print(")");
+  PrintPropagatedType(f, *this);
 }
 
 
 void Definition::PrintOperandsTo(BufferFormatter* f) const {
   for (int i = 0; i < InputCount(); ++i) {
     if (i > 0) f->Print(", ");
     if (InputAt(i) != NULL) InputAt(i)->PrintTo(f);
   }
 }
 
 
 void Definition::PrintToVisualizer(BufferFormatter* f) const {
   PrintTo(f);
 }
 
 
 void Value::PrintTo(BufferFormatter* f) const {
-  if (definition()->HasSSATemp()) {
-    f->Print("v%"Pd"", definition()->ssa_temp_index());
-  } else {
-    f->Print("t%"Pd"", definition()->temp_index());
-  }
+  PrintUse(f, *definition());
 }
 
 
 void ConstantInstr::PrintOperandsTo(BufferFormatter* f) const {
   f->Print("#%s", value().ToCString());
 }
 
 
 void AssertAssignableInstr::PrintOperandsTo(BufferFormatter* f) const {
   value()->PrintTo(f);
@@ skipping 37 matching lines @@
   for (intptr_t i = 0; i < ArgumentCount(); ++i) {
     f->Print(", ");
     ArgumentAt(i)->value()->PrintTo(f);
   }
   if (HasICData()) {
     PrintICData(f, *ic_data());
   }
 }
 
 
-void PolymorphicInstanceCallInstr::PrintTo(BufferFormatter* f) const {
-  f->Print("%s(", DebugName());
+void PolymorphicInstanceCallInstr::PrintOperandsTo(BufferFormatter* f) const {
   instance_call()->PrintOperandsTo(f);
-  f->Print(") ");
   PrintICData(f, ic_data());
 }
 
 
 void StrictCompareInstr::PrintOperandsTo(BufferFormatter* f) const {
   f->Print("%s, ", Token::Str(kind()));
   left()->PrintTo(f);
   f->Print(", ");
   right()->PrintTo(f);
 }
@@ skipping 193 matching lines @@
 }
 
 
 void CheckClassInstr::PrintOperandsTo(BufferFormatter* f) const {
   value()->PrintTo(f);
   PrintICData(f, unary_checks());
 }
 
 
 void GraphEntryInstr::PrintTo(BufferFormatter* f) const {
-  f->Print("%2"Pd": [graph]", block_id());
-  if (start_env_ != NULL) {
-    f->Print("\n{\n");
-    const GrowableArray<Value*>& values = start_env_->values();
-    for (intptr_t i = 0; i < values.length(); i++) {
-      Definition* def = values[i]->definition();
-      f->Print("  ");
-      def->PrintTo(f);
-      f->Print("\n");
+  f->Print("B%"Pd"[graph]", block_id());
+  if ((constant_null() != NULL) || (start_env() != NULL)) {
+    f->Print(" {");
+    if (constant_null() != NULL) {
+      f->Print("\n      ");
+      constant_null()->PrintTo(f);
     }
-    f->Print("} ");
-    start_env_->PrintTo(f);
+    if (start_env() != NULL) {
+      for (intptr_t i = 0; i < start_env()->values().length(); ++i) {
+        Definition* def = start_env()->values()[i]->definition();
+        if (def->IsParameter()) {
+          f->Print("\n      ");
+          def->PrintTo(f);
+        }
+      }
+    }
+    f->Print("\n}");
   }
 }
 
 
 void JoinEntryInstr::PrintTo(BufferFormatter* f) const {
-  f->Print("%2"Pd": [join]", block_id());
+  f->Print("B%"Pd"[join]", block_id());
   if (phis_ != NULL) {
+    f->Print(" {");
     for (intptr_t i = 0; i < phis_->length(); ++i) {
       if ((*phis_)[i] == NULL) continue;
-      f->Print("\n");
+      f->Print("\n      ");
       (*phis_)[i]->PrintTo(f);
     }
+    f->Print("\n}");
   }
   if (HasParallelMove()) {
-    f->Print("\n");
+    f->Print(" ");
     parallel_move()->PrintTo(f);
   }
 }
 
 
-static void PrintPropagatedType(BufferFormatter* f, const Definition& def) {
-  if (def.HasPropagatedType()) {
-    String& name = String::Handle();
-    name = AbstractType::Handle(def.PropagatedType()).Name();
-    f->Print(" {PT: %s}", name.ToCString());
-  }
-  if (def.has_propagated_cid()) {
-    const Class& cls = Class::Handle(
-        Isolate::Current()->class_table()->At(def.propagated_cid()));
-    f->Print(" {PCid: %s}", String::Handle(cls.Name()).ToCString());
-  }
-}
-
-
 void PhiInstr::PrintTo(BufferFormatter* f) const {
-  f->Print("     v%"Pd" <- phi(", ssa_temp_index());
+  f->Print("v%"Pd" <- phi(", ssa_temp_index());
   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(")");
   PrintPropagatedType(f, *this);
 }
 
 
-void ParameterInstr::PrintTo(BufferFormatter* f) const {
-  f->Print("    v%"Pd" <- parameter(%"Pd")",
-           HasSSATemp() ? ssa_temp_index() : temp_index(),
-           index());
-  PrintPropagatedType(f, *this);
+void ParameterInstr::PrintOperandsTo(BufferFormatter* f) const {
+  f->Print("%"Pd, index());
 }
 
 
 void TargetEntryInstr::PrintTo(BufferFormatter* f) const {
-  f->Print("%2"Pd": [target", block_id());
+  f->Print("B%"Pd"[target", block_id());
   if (IsCatchEntry()) {
     f->Print(" catch %"Pd"]", catch_try_index());
   } else {
     f->Print("]");
   }
   if (HasParallelMove()) {
-    f->Print("\n");
+    f->Print(" ");
     parallel_move()->PrintTo(f);
   }
 }
 
 
-void PushArgumentInstr::PrintTo(BufferFormatter* f) const {
-  f->Print("    %s ", DebugName());
+void PushArgumentInstr::PrintOperandsTo(BufferFormatter* f) const {
   value()->PrintTo(f);
 }
 
 
 void ReturnInstr::PrintTo(BufferFormatter* f) const {
-  f->Print("    %s ", DebugName());
+  f->Print("%s ", DebugName());
   value()->PrintTo(f);
 }
 
 
 void ThrowInstr::PrintTo(BufferFormatter* f) const {
-  f->Print("    %s" , DebugName());
+  f->Print("%s" , DebugName());
 }
 
 
 void ReThrowInstr::PrintTo(BufferFormatter* f) const {
-  f->Print("    %s ", DebugName());
+  f->Print("%s ", DebugName());
 }
 
 
 void GotoInstr::PrintTo(BufferFormatter* f) const {
   if (HasParallelMove()) {
     parallel_move()->PrintTo(f);
-  } else {
-    f->Print("    ");
+    f->Print(" ");
   }
-  f->Print(" goto:%"Pd" %"Pd"", GetDeoptId(), successor()->block_id());
+  f->Print("goto:%"Pd" %"Pd"", GetDeoptId(), successor()->block_id());
 }
 
 
 void BranchInstr::PrintTo(BufferFormatter* f) const {
-  f->Print("    %s ", DebugName());
+  f->Print("%s ", DebugName());
   f->Print("if ");
   comparison()->PrintTo(f);
 
   f->Print(" goto (%"Pd", %"Pd")",
             true_successor()->block_id(),
             false_successor()->block_id());
 }
 
 
 void ParallelMoveInstr::PrintTo(BufferFormatter* f) const {
-  f->Print("    %s ", DebugName());
+  f->Print("%s ", DebugName());
   for (intptr_t i = 0; i < moves_.length(); i++) {
     if (i != 0) f->Print(", ");
     moves_[i]->dest().PrintTo(f);
     f->Print(" <- ");
     moves_[i]->src().PrintTo(f);
   }
 }
 
 
 void FlowGraphVisualizer::Print(const char* format, ...) {
@@ skipping 222 matching lines @@
     if ((locations_ != NULL) && !locations_[i].IsInvalid()) {
       f->Print(" [");
       locations_[i].PrintTo(f);
       f->Print("]");
     }
   }
   f->Print(" }");
 }
 
 }  // namespace dart