AOT: Use a cid range check when possible to implement type tests.

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/bit_vector.h"
 #include "vm/growable_array.h"
 #include "vm/hash_map.h"
@@ skipping 297 matching lines @@
   // Optimize (a << b) & c pattern: if c is a positive Smi or zero, then the
   // shift can be a truncating Smi shift-left and result is always Smi.
   // Merge instructions (only per basic-block).
   void TryOptimizePatterns();
 
  private:
   friend class IfConverter;
   friend class BranchSimplifier;
   friend class ConstantPropagator;
   friend class DeadCodeElimination;
+  friend class AotOptimizer;

[rmacnak, 2016/09/07 01:20:27]

ComputeDominators

 
   // SSA transformation methods and fields.
   void ComputeDominators(GrowableArray<BitVector*>* dominance_frontier);
 
   void CompressPath(
       intptr_t start_index,
       intptr_t current_index,
       GrowableArray<intptr_t>* parent,
       GrowableArray<intptr_t>* label);
 
@@ skipping 232 matching lines @@
 
  private:
   GrowableArray<Definition*> defs_;
   BitVector* contains_vector_;
 };
 
 
 }  // namespace dart
 
 #endif  // VM_FLOW_GRAPH_H_