Clean up LoadInstanceField and StoreInstanceField.

runtime/vm/intermediate_language.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/intermediate_language.h"
 
 #include "vm/bit_vector.h"
 #include "vm/dart_entry.h"
 #include "vm/flow_graph_allocator.h"
 #include "vm/flow_graph_builder.h"
@@ skipping 1112 matching lines @@
     if (right != NULL) {
       right->RemoveFromGraph();
     }
     // Return left subexpression as the replacement for this instruction.
     return left;
   }
   return instr;
 }
 
 
+Definition* CheckClassComp::TryReplace(BindInstr* instr) const {
+  const intptr_t v_cid = value()->ResultCid();
+  const intptr_t num_checks = ic_data()->NumberOfChecks();
+  if ((num_checks == 1) &&
+      (v_cid == ic_data()->GetReceiverClassIdAt(0))) {
+    // No checks needed.
+    return NULL;
+  }
+  return instr;
+}
+
+
 Definition* CheckSmiComp::TryReplace(BindInstr* instr) const {
   return (value()->ResultCid() == kSmiCid) ?  NULL : instr;
 }
 
 
 Definition* CheckEitherNonSmiComp::TryReplace(BindInstr* instr) const {
   if ((left()->ResultCid() == kDoubleCid) ||
       (right()->ResultCid() == kDoubleCid)) {
     return NULL;  // Remove from the graph.
   }
@@ skipping 396 matching lines @@
                      ? UseDefinition(values()[i]->AsUse()->definition())
                      : val);
   }
   return copy;
 }
 
 
 #undef __
 
 }  // namespace dart