Big merge from experimental to bleeding edge.

sdk/lib/_internal/compiler/implementation/ssa/value_set.dart

 // 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.
 
 part of ssa;
 
 class ValueSet {
   int size = 0;
   List<HInstruction> table;
   ValueSetNode collisions;
-  ValueSet() : table = new List<HInstruction>(8);
+  ValueSet() : table = new List<HInstruction>.fixedLength(8);
 
   bool get isEmpty => size == 0;
   int get length => size;
 
   void add(HInstruction instruction) {
     assert(lookup(instruction) == null);
     int hashCode = instruction.gvnHashCode();
     int capacity = table.length;
     // Resize when half of the hash table is in use.
     if (size >= capacity >> 1) {
@@ skipping 108 matching lines @@
     return result;
   }
 
   void resize(int capacity) {
     var oldSize = size;
     var oldTable = table;
     var oldCollisions = collisions;
     // Reset the table with a bigger capacity.
     assert(capacity > table.length);
     size = 0;
-    table = new List<HInstruction>(capacity);
+    table = new List<HInstruction>.fixedLength(capacity);
     collisions = null;
     // Add the old instructions to the new table.
     copyTo(this, oldTable, oldCollisions);
     // Make sure we preserved all elements and that no resizing
     // happened as part of this resizing.
     assert(size == oldSize);
     assert(table.length == capacity);
   }
 }
 
 class ValueSetNode {
   final HInstruction value;
   final int hash;
   int get hashCode => hash;
   ValueSetNode next;
   ValueSetNode(this.value, this.hash, this.next);
 }