Use off-heap data for class check instructions

runtime/vm/flow_graph_compiler.cc

 // 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.
 
 #include "vm/globals.h"  // Needed here to get TARGET_ARCH_XXX.
 
 #include "vm/flow_graph_compiler.h"
 
 #include "vm/bit_vector.h"
 #include "vm/cha.h"
@@ skipping 1616 matching lines @@
 }
 
 
 ParallelMoveResolver::ScratchRegisterScope::~ScratchRegisterScope() {
   if (spilled_) {
     resolver_->RestoreScratch(reg_);
   }
 }
 
 
-template <typename T>
-static int HighestCountFirst(const T* a, const T* b) {
-  // Negative if 'a' should sort before 'b'.
-  return b->count - a->count;
-}
-
-
-static int LowestCidFirst(const CidRangeTarget* a, const CidRangeTarget* b) {
-  // Negative if 'a' should sort before 'b'.
-  return a->cid_start - b->cid_start;
-}
-
-
-// Returns 'sorted' array in decreasing count order.
-// The expected number of elements to sort is less than 10.
-void FlowGraphCompiler::SortICDataByCount(
-    const ICData& ic_data,
-    GrowableArray<CidRangeTarget>* sorted_arg,
-    bool drop_smi) {
-  GrowableArray<CidRangeTarget>& sorted = *sorted_arg;
-  ASSERT(ic_data.NumArgsTested() == 1);
-  const intptr_t len = ic_data.NumberOfChecks();
-  sorted.Clear();
-
-  for (int i = 0; i < len; i++) {
-    intptr_t receiver_cid = ic_data.GetReceiverClassIdAt(i);
-    if (drop_smi && (receiver_cid == kSmiCid)) continue;
-    Function& target = Function::ZoneHandle(ic_data.GetTargetAt(i));
-    sorted.Add(CidRangeTarget(receiver_cid, receiver_cid, &target,
-                              ic_data.GetCountAt(i)));
-  }
-  sorted.Sort(LowestCidFirst);
-  int dest = 0;
-
-  // Merge adjacent ranges.
-  for (int src = 0; src < sorted.length(); src++) {
-    if (src > 0 && sorted[src - 1].cid_end + 1 == sorted[src].cid_start &&
-        sorted[src - 1].target->raw() == sorted[src].target->raw()) {
-      sorted[dest - 1].cid_end++;
-      sorted[dest - 1].count += sorted[dest].count;
-    } else {
-      sorted[dest++] = sorted[src];
-    }
-  }
-
-  sorted.SetLength(dest);
-  sorted.Sort(HighestCountFirst);
-}
-
-
 const ICData* FlowGraphCompiler::GetOrAddInstanceCallICData(
     intptr_t deopt_id,
     const String& target_name,
     const Array& arguments_descriptor,
     intptr_t num_args_tested) {
   if ((deopt_id_to_ic_data_ != NULL) &&
       ((*deopt_id_to_ic_data_)[deopt_id] != NULL)) {
     const ICData* res = (*deopt_id_to_ic_data_)[deopt_id];
     ASSERT(res->deopt_id() == deopt_id);
     ASSERT(res->target_name() == target_name.raw());
@@ skipping 372 matching lines @@
 
 
 void FlowGraphCompiler::FrameStateClear() {
   ASSERT(!is_optimizing());
   frame_state_.TruncateTo(0);
 }
 #endif  // defined(DEBUG) && !defined(TARGET_ARCH_DBC)
 
 
 }  // namespace dart