Collect type feedback for fields.

runtime/vm/flow_graph_optimizer.h

 // 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.
 
 #ifndef VM_FLOW_GRAPH_OPTIMIZER_H_
 #define VM_FLOW_GRAPH_OPTIMIZER_H_
 
 #include "vm/intermediate_language.h"
 #include "vm/flow_graph.h"
 
@@ skipping 21 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.
   void TryOptimizeLeftShiftWithBitAndPattern();
 
   void Canonicalize();
 
   void EliminateDeadPhis();
 
   void SelectRepresentations();
 
-  void PropagateSminess();
-
   void InferSmiRanges();
 
   virtual void VisitStaticCall(StaticCallInstr* instr);
   virtual void VisitInstanceCall(InstanceCallInstr* instr);
   virtual void VisitRelationalOp(RelationalOpInstr* instr);
   virtual void VisitEqualityCompare(EqualityCompareInstr* instr);
   virtual void VisitBranch(BranchInstr* instr);
   virtual void VisitStrictCompare(StrictCompareInstr* instr);
+  virtual void VisitStoreInstanceField(StoreInstanceFieldInstr* instr);
 
   void InsertBefore(Instruction* next,
                     Instruction* instr,
                     Environment* env,
                     Definition::UseKind use_kind) {
     flow_graph_->InsertBefore(next, instr, env, use_kind);
   }
 
  private:
   // Attempt to build ICData for call using propagated class-ids.
@@ skipping 229 matching lines @@
   // inputs.
   static BranchInstr* CloneBranch(BranchInstr* branch,
                                   Value* left,
                                   Value* right);
 };
 
 
 }  // namespace dart
 
 #endif  // VM_FLOW_GRAPH_OPTIMIZER_H_