Nested deoptimization environments.

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 418 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();
+    for (intptr_t i = 0; i < start_env_->Length(); i++) {
+      Definition* def = start_env_->ValueAt(i)->definition();
       f->Print("  ");
       def->PrintTo(f);
       f->Print("\n");
     }
     f->Print("} ");
     start_env_->PrintTo(f);
   }
 }
 
 
@@ skipping 337 matching lines @@
   for (intptr_t i = 0; i < values_.length(); ++i) {
     if (i > 0) f->Print(", ");
     values_[i]->PrintTo(f);
     if ((locations_ != NULL) && !locations_[i].IsInvalid()) {
       f->Print(" [");
       locations_[i].PrintTo(f);
       f->Print("]");
     }
   }
   f->Print(" }");
+  if (outer_ != NULL) outer_->PrintTo(f);
 }
 
 }  // namespace dart