Skeleton of a linear scan register allocator.

runtime/vm/growable_array.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.
 // Defines growable array classes, that differ where they are allocated:
 // - GrowableArray: allocate on stack.
 // - ZoneGrowableArray: allocated in the zone.
 
 #ifndef VM_GROWABLE_ARRAY_H_
 #define VM_GROWABLE_ARRAY_H_
 
@@ skipping 41 matching lines @@
     ASSERT(length_ <= capacity_);
     return data_[index];
   }
 
   T& Last() const {
     ASSERT(length_ > 0);
     return operator[](length_ - 1);
   }
 
   void AddArray(const BaseGrowableArray<T, B>& src) {
-    for (int i = 0; i < src.length(); i++) {
+    for (intptr_t i = 0; i < src.length(); i++) {
       Add(src[i]);
     }
   }
 
   void Clear() {
     length_ = 0;
   }
 
   void RemoveFirst() {
     ASSERT(length_ > 0);
     length_--;
     for (int i = 0; i < length_; i++) {
       data_[i] = data_[i + 1];
     }
   }
 
+  void InsertAt(intptr_t idx, const T& value) {
+    Resize(length() + 1);
+    for (intptr_t i = length_ - 2; i >= idx; i--) {
+      data_[i + 1] = data_[i];
+    }
+    data_[idx] = value;
+  }
+
   // Sort the array in place.
   inline void Sort(int compare(const T*, const T*));
 
  private:
   int length_;
   int capacity_;
   T* data_;
   BaseZone* zone_;  // Zone in which we are allocating the array.
 
   void Resize(int new_length);
@@ skipping 47 matching lines @@
           initial_capacity,
           Isolate::Current()->current_zone()->GetBaseZone()) {}
   ZoneGrowableArray() :
       BaseGrowableArray<T, ZoneAllocated>(
           Isolate::Current()->current_zone()->GetBaseZone()) {}
 };
 
 }  // namespace dart
 
 #endif  // VM_GROWABLE_ARRAY_H_