Version 1.5.0-dev.4.5

dart/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 24 matching lines @@
     postorder_(),
     reverse_postorder_(),
     optimized_block_order_(),
     constant_null_(NULL),
     constant_dead_(NULL),
     block_effects_(NULL),
     licm_allowed_(true),
     use_far_branches_(false),
     loop_headers_(NULL),
     loop_invariant_loads_(NULL),
-    guarded_fields_(builder.guarded_fields()) {
+    guarded_fields_(builder.guarded_fields()),
+    deferred_prefixes_(builder.deferred_prefixes()) {
   DiscoverBlocks();
 }
 
 
 void FlowGraph::AddToGuardedFields(
     ZoneGrowableArray<const Field*>* array,
     const Field* field) {
   if ((field->guarded_cid() == kDynamicCid) ||
       (field->guarded_cid() == kIllegalCid)) {
     return;
   }
   for (intptr_t j = 0; j < array->length(); j++) {
     if ((*array)[j]->raw() == field->raw()) {
       return;
     }
   }
   array->Add(field);
 }
 
 
+void FlowGraph::AddToDeferredPrefixes(
+    ZoneGrowableArray<const LibraryPrefix*>* from) {
+  ZoneGrowableArray<const LibraryPrefix*>* to = deferred_prefixes();
+  for (intptr_t i = 0; i < from->length(); i++) {
+    const  LibraryPrefix* prefix = (*from)[i];
+    for (intptr_t j = 0; j < to->length(); j++) {
+      if ((*to)[j]->raw() == prefix->raw()) {
+        return;
+      }
+    }
+    to->Add(prefix);
+  }
+}
+
+
 bool FlowGraph::ShouldReorderBlocks(const Function& function,
                                     bool is_optimized) {
   return is_optimized && FLAG_reorder_basic_blocks && !function.is_intrinsic();
 }
 
 
 GrowableArray<BlockEntryInstr*>* FlowGraph::CodegenBlockOrder(
     bool is_optimized) {
   return ShouldReorderBlocks(parsed_function().function(), is_optimized)
       ? &optimized_block_order_
@@ skipping 1158 matching lines @@
 }
 
 
 bool BlockEffects::IsSideEffectFreePath(BlockEntryInstr* from,
                                         BlockEntryInstr* to) const {
   return available_at_[to->postorder_number()]->Contains(
       from->postorder_number());
 }
 
 }  // namespace dart