Remove support for optimized dart leaf functions.

runtime/vm/flow_graph_optimizer.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_optimizer.h"
 
 #include "vm/bit_vector.h"
 #include "vm/cha.h"
 #include "vm/flow_graph_builder.h"
 #include "vm/flow_graph_compiler.h"
@@ skipping 2146 matching lines @@
 void FlowGraphTypePropagator::PropagateTypes() {
   // TODO(regis): Is there a way to make this more efficient, e.g. by visiting
   // only blocks depending on blocks that have changed and not the whole graph.
   do {
     still_changing_ = false;
     VisitBlocks();
   } while (still_changing_);
 }
 
 
-void FlowGraphAnalyzer::Analyze() {
-  is_leaf_ = true;
-  for (intptr_t i = 0; i < blocks_.length(); ++i) {
-    BlockEntryInstr* entry = blocks_[i];
-    for (ForwardInstructionIterator it(entry); !it.Done(); it.Advance()) {
-      LocationSummary* locs = it.Current()->locs();
-      if ((locs != NULL) && locs->can_call()) {
-        is_leaf_ = false;
-        return;
-      }
-    }
-  }
-}
-
-
 static BlockEntryInstr* FindPreHeader(BlockEntryInstr* header) {
   for (intptr_t j = 0; j < header->PredecessorCount(); ++j) {
     BlockEntryInstr* candidate = header->PredecessorAt(j);
     if (header->dominator() == candidate) {
       return candidate;
     }
   }
   return NULL;
 }
 
@@ skipping 1101 matching lines @@
 
   if (FLAG_trace_constant_propagation) {
     OS::Print("\n==== After constant propagation ====\n");
     FlowGraphPrinter printer(*graph_);
     printer.PrintBlocks();
   }
 }
 
 
 }  // namespace dart