Enables per-function far-branches for ARM and MIPS.

runtime/vm/flow_graph.h

 // Copyright (c) 2013, 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.
 
 #ifndef VM_FLOW_GRAPH_H_
 #define VM_FLOW_GRAPH_H_
 
 #include "vm/growable_array.h"
 #include "vm/intermediate_language.h"
 #include "vm/parser.h"
@@ skipping 23 matching lines @@
   bool Done() const { return current_ >= block_order_.length(); }
 
   BlockEntryInstr* Current() const { return block_order_[current_]; }
 
  private:
   const GrowableArray<BlockEntryInstr*>& block_order_;
   intptr_t current_;
 };
 
 
-// Class to incapsulate the construction and manipulation of the flow graph.
+// Class to encapsulate the construction and manipulation of the flow graph.
 class FlowGraph : public ZoneAllocated {
  public:
   FlowGraph(const FlowGraphBuilder& builder,
             GraphEntryInstr* graph_entry,
             intptr_t max_block_id);
 
   // Function properties.
   const ParsedFunction& parsed_function() const {
     return parsed_function_;
   }
@@ skipping 101 matching lines @@
 
   // Returns true if every Goto in the graph is expected to have a
   // deoptimization environment and can be used as deoptimization target
   // for hoisted instructions.
   bool is_licm_allowed() const { return licm_allowed_; }
 
   // Stop preserving environments on Goto instructions. LICM is not allowed
   // after this point.
   void disallow_licm() { licm_allowed_ = false; }
 
+  bool use_far_branches() const { return use_far_branches_; }
+  void set_use_far_branches(bool value) {
+    use_far_branches_ = value;
+  }
+
   const ZoneGrowableArray<BlockEntryInstr*>& loop_headers() {
     if (loop_headers_ == NULL) {
       loop_headers_ = ComputeLoops();
     }
     return *loop_headers_;
   }
 
   // Per loop header invariant loads sets. Each set contains load id for
   // those loads that are not affected by anything in the loop and can be
   // hoisted out. Sets are computed by LoadOptimizer.
@@ skipping 66 matching lines @@
   const intptr_t num_stack_locals_;
   GraphEntryInstr* graph_entry_;
   GrowableArray<BlockEntryInstr*> preorder_;
   GrowableArray<BlockEntryInstr*> postorder_;
   GrowableArray<BlockEntryInstr*> reverse_postorder_;
   ConstantInstr* constant_null_;
 
   BlockEffects* block_effects_;
   bool licm_allowed_;
 
+  bool use_far_branches_;
+
   ZoneGrowableArray<BlockEntryInstr*>* loop_headers_;
   ZoneGrowableArray<BitVector*>* loop_invariant_loads_;
 };
 
 
 class LivenessAnalysis : public ValueObject {
  public:
   LivenessAnalysis(intptr_t variable_count,
                    const GrowableArray<BlockEntryInstr*>& postorder);
 
@@ skipping 87 matching lines @@
   // Per block sets of available blocks. Block A is available at the block B if
   // and only if A dominates B and all paths from A to B are free of side
   // effects.
   GrowableArray<BitVector*> available_at_;
 };
 
 
 }  // namespace dart
 
 #endif  // VM_FLOW_GRAPH_H_