Removed loop depth info tracking at graph build time.

runtime/vm/flow_graph.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.h"
 
 #include "vm/bit_vector.h"
 #include "vm/flow_graph_builder.h"
 #include "vm/intermediate_language.h"
 #include "vm/longjump.h"
@@ skipping 907 matching lines @@
       caller_entry->ClearDominatedBlocks();
       for (intptr_t i = 0; i < callee_entry->dominated_blocks().length(); ++i) {
         BlockEntryInstr* block = callee_entry->dominated_blocks()[i];
         block->set_dominator(caller_entry);
         caller_entry->AddDominatedBlock(block);
       }
     }
   } else {
     // Create a join of the returns.
     JoinEntryInstr* join =
-        new JoinEntryInstr(++max_block_id_,
-                           CatchClauseNode::kInvalidTryIndex,
-                           caller_entry->loop_depth());
+        new JoinEntryInstr(++max_block_id_, CatchClauseNode::kInvalidTryIndex);
     intptr_t count = inlining_context->NumExits();
     for (intptr_t i = 0; i < count; ++i) {
       inlining_context->LastInstructionAt(i)->Goto(join);
       // Directly add the predecessors of the join in ascending block id order.
       join->predecessors_.Add(inlining_context->ExitBlockAt(i));
     }
     // If the call has uses, create a phi of the returns.
     if (call->HasUses()) {
       // Environment count: length before call - argument count (+ return)
       intptr_t env_count = call->env()->Length() - call->ArgumentCount();
@@ skipping 46 matching lines @@
          !it.Done();
          it.Advance()) {
       ++size;
     }
   }
   return size;
 }
 
 
 }  // namespace dart