Optimize indexed store for growable array (intrinsification and inlined optimized).

tests/language/src/OptimizationTest.dart

 // Copyright (c) 2011, 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.
 // Test various optimizations and deoptimizations of optimizing compiler..
 
 addThem(a, b) {
   return a + b;
 }
 
 isItInt(a) {
   return a is int;
 }
 
 doNeg(a) {
   return -a;
 }
 
 doNeg2(a) {
   return -a;
 }
 
 doNot(a) {
   return !a;
 }
 
 doBitNot(a) {
   return ~a;
 }
 
+doStore1(a, v) {
+  a[1] = v;
+}
+
+doStore2(a, v) {
+  a[2] = v;
+}
+
 main() {
   for (int i = 0; i < 2000; i++) {
     Expect.stringEquals("HI 5", addThem("HI ", 5));
     Expect.equals(true, isItInt(5));
   }
   Expect.equals(8, addThem(3, 5));
   for (int i = 0; i < 2000; i++) {
     Expect.stringEquals("HI 5", addThem("HI ", 5));
     Expect.equals(8, addThem(3, 5));
   }
@@ skipping 15 matching lines @@
   for (int i = 0; i < 1000; i++) {
     Expect.equals(-57, doBitNot(56));
     Expect.equals(55, doBitNot(-56));
   }
 
   for (int i = 0; i < 2000; i++) {
     Expect.equals(-2.2, doNeg2(2.2));
   }
   // Deoptimize.
   Expect.equals(-5, doNeg2(5));
+
+  var fixed = new List(10);
+  var growable = [1, 2, 3, 4, 5];
+
+  for (int i = 0; i < 2000; i++) {
+    doStore1(fixed, 7);
+    Expect.equals(7, fixed[1]);
+    doStore2(growable, 12);
+    Expect.equals(12, growable[2]);
+  }
+
+  // Deoptimize.
+  doStore1(growable, 8);
+  Expect.equals(8, growable[1]);
+  doStore2(fixed, 101);
+  Expect.equals(101, fixed[2]);
 }