Add Uint32 representation

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 16 matching lines @@
   void ApplyICData();
 
   // Use propagated class ids to optimize, replace or eliminate instructions.
   void ApplyClassIds();
 
   // 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();
 
+
   // Returns true if any instructions were canonicalized away.
   bool Canonicalize();
 
   void EliminateDeadPhis();
 
   void SelectRepresentations();
 
   void InferIntRanges();
 
+  // Optimize mint operations using range analysis output.
+  void TryRangeDerivedOptimizations();
+
   void AnalyzeTryCatch();
 
   bool TryInlineRecognizedMethod(intptr_t receiver_cid,
                                  const Function& target,
                                  Instruction* call,
                                  Definition* receiver,
                                  intptr_t token_pos,
                                  const ICData& ic_data,
                                  TargetEntryInstr** entry,
                                  Definition** last);
@@ skipping 175 matching lines @@
   RawBool* InstanceOfAsBool(const ICData& ic_data,
                             const AbstractType& type,
                             ZoneGrowableArray<intptr_t>* results) const;
 
   void ReplaceWithMathCFunction(InstanceCallInstr* call,
                                 MethodRecognizer::Kind recognized_kind);
 
   void OptimizeLeftShiftBitAndSmiOp(Definition* bit_and_instr,
                                     Definition* left_instr,
                                     Definition* right_instr);
+  Definition* OptimizeMint32BitMasks(BinaryMintOpInstr* mask);
+  bool TryMarkMint32Bit(Definition* mintop);
   void TryMergeTruncDivMod(GrowableArray<BinarySmiOpInstr*>* merge_candidates);
   void TryMergeMathUnary(GrowableArray<MathUnaryInstr*>* merge_candidates);
 
   void AppendLoadIndexedForMerged(Definition* instr, intptr_t ix, intptr_t cid);
   void AppendExtractNthOutputForMerged(Definition* instr, intptr_t ix,
                                        Representation rep, intptr_t cid);
   bool TryStringLengthOneEquality(InstanceCallInstr* call, Token::Kind op_kind);
 
   Isolate* isolate() const { return flow_graph_->isolate(); }
 
@@ skipping 201 matching lines @@
 // Optimize spill stores inside try-blocks by identifying values that always
 // contain a single known constant at catch block entry.
 class TryCatchAnalyzer : public AllStatic {
  public:
   static void Optimize(FlowGraph* flow_graph);
 };
 
 }  // namespace dart
 
 #endif  // VM_FLOW_GRAPH_OPTIMIZER_H_