Fix vm code base so that it can be built for --arch=simarm (no snapshot yet).

runtime/vm/flow_graph_optimizer.cc

-// Copyright (c) 2012, the Dart project authors.  Please see the AUTHORS file
+// 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/flow_graph_optimizer.h"
 
 #include "vm/bit_vector.h"
 #include "vm/cha.h"
 #include "vm/flow_graph_builder.h"
 #include "vm/flow_graph_compiler.h"
 #include "vm/hash_map.h"
@@ skipping 1292 matching lines @@
       } else {
         // Optimistically assume result fits into Smi.
         d2i_instr = new DoubleToSmiInstr(call->ArgumentAt(0)->value(), call);
       }
       call->ReplaceWith(d2i_instr, current_iterator());
       RemovePushArguments(call);
       return true;
     }
     if ((recognized_kind == MethodRecognizer::kDoubleTruncate) ||
         (recognized_kind == MethodRecognizer::kDoubleRound)) {
-      if (!CPUFeatures::sse4_1_supported()) {
+      if (!CPUFeatures::double_truncate_round_supported()) {
         return false;
       }
       AddCheckClass(call, call->ArgumentAt(0)->value()->Copy());
       DoubleToDoubleInstr* d2d_instr =
           new DoubleToDoubleInstr(call->ArgumentAt(0)->value(),
                                   call,
                                   recognized_kind);
       call->ReplaceWith(d2d_instr, current_iterator());
       RemovePushArguments(call);
       return true;
@@ skipping 669 matching lines @@
   // as smi values.
   GrowableArray<ConstraintInstr*> constraints_;
 
   // Bitvector for a quick filtering of known smi values.
   BitVector* smi_definitions_;
 
   // Worklist for induction variables analysis.
   GrowableArray<Definition*> worklist_;
   BitVector* marked_defns_;
 
-  class ArrayLengthData : public ValueObject {
+  class ArrayLengthData {
    public:
     ArrayLengthData(Definition* array, Definition* array_length)
         : array_(array), array_length_(array_length) { }
 
+    ArrayLengthData(const ArrayLengthData& other)
+        : array_(other.array_), array_length_(other.array_length_) { }
+
+    ArrayLengthData& operator=(const ArrayLengthData& other) {
+      array_ = other.array_;
+      array_length_ = other.array_length_;
+      return *this;
+    }
+
     Definition* array() const { return array_; }
     Definition* array_length() const { return array_length_; }
 
     typedef Definition* Value;
     typedef Definition* Key;
     typedef class ArrayLengthData Pair;
 
     // KeyValueTrait members.
     static Key KeyOf(const ArrayLengthData& data) {
       return data.array();
@@ skipping 2480 matching lines @@
 
   if (FLAG_trace_constant_propagation) {
     OS::Print("\n==== After constant propagation ====\n");
     FlowGraphPrinter printer(*graph_);
     printer.PrintBlocks();
   }
 }
 
 
 }  // namespace dart