Pass isolate to BitVector constructor.

runtime/vm/flow_graph_range_analysis.cc

 // Copyright (c) 2014, 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_range_analysis.h"
 
 #include "vm/bit_vector.h"
 #include "vm/il_printer.h"
 
 namespace dart {
@@ skipping 560 matching lines @@
   } while (changed && (iteration < max_iterations));
 }
 
 
 void RangeAnalysis::InferRanges() {
   if (FLAG_trace_range_analysis) {
     FlowGraphPrinter::PrintGraph("Range Analysis (BEFORE)", flow_graph_);
   }
 
   // Initialize bitvector for quick filtering of int values.
-  BitVector* set = new(I) BitVector(flow_graph_->current_ssa_temp_index());
+  BitVector* set = new(I) BitVector(I, flow_graph_->current_ssa_temp_index());
   for (intptr_t i = 0; i < values_.length(); i++) {
     set->Add(values_[i]->ssa_temp_index());
   }
   for (intptr_t i = 0; i < constraints_.length(); i++) {
     set->Add(constraints_[i]->ssa_temp_index());
   }
 
   // Collect integer definitions (including constraints) in the reverse
   // postorder. This improves convergence speed compared to iterating
   // values_ and constraints_ array separately.
@@ skipping 147 matching lines @@
 }
 
 
 IntegerInstructionSelector::IntegerInstructionSelector(FlowGraph* flow_graph)
     : flow_graph_(flow_graph),
       isolate_(NULL) {
   ASSERT(flow_graph_ != NULL);
   isolate_ = flow_graph_->isolate();
   ASSERT(isolate_ != NULL);
   selected_uint32_defs_ =
-      new(I) BitVector(flow_graph_->current_ssa_temp_index());
+      new(I) BitVector(I, flow_graph_->current_ssa_temp_index());
 }
 
 
 void IntegerInstructionSelector::Select() {
   if (FLAG_trace_integer_ir_selection) {
     OS::Print("---- starting integer ir selection -------\n");
   }
   FindPotentialUint32Definitions();
   FindUint32NarrowingDefinitions();
   Propagate();
@@ skipping 1429 matching lines @@
     }
   } while (CanonicalizeMaxBoundary(&max) ||
            CanonicalizeMinBoundary(&canonical_length));
 
   // Failed to prove that maximum is bounded with array length.
   return false;
 }
 
 
 }  // namespace dart