Start supporting fixed length and immutable lists.

dart/frog/leg/ssa/codegen.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.
 
 class SsaCodeGeneratorTask extends CompilerTask {
   SsaCodeGeneratorTask(Compiler compiler) : super(compiler);
   String get name() => 'SSA code generator';
 
   String generate(WorkItem work, HGraph graph) {
     return measure(() {
@@ skipping 780 matching lines @@
 
   void visitLoad(HLoad node) {
     buffer.add('${local(node.local)}');
   }
 
   void visitLocal(HLocal node) {
     buffer.add('var ${local(node)}');
   }
 
   void visitLiteralList(HLiteralList node) {
+    if (node.isConst) {
+      // TODO(floitsch): Remove this when CTC handles arrays.
+      SourceString name = new SourceString('makeLiteralListConst');
+      Element helper = compiler.findHelper(name);
+      compiler.registerStaticUse(helper);
+      beginExpression(JSPrecedence.CALL_PRECEDENCE);
+      buffer.add(compiler.namer.isolateAccess(helper));
+      buffer.add('(');
+      generateArrayLiteral(node);
+      buffer.add(')');
+      endExpression(JSPrecedence.CALL_PRECEDENCE);
+    } else {
+      generateArrayLiteral(node);
+    }
+  }
+
+  void generateArrayLiteral(HLiteralList node) {
     buffer.add('[');
     int len = node.inputs.length;
     for (int i = 0; i < len; i++) {
       if (i != 0) buffer.add(', ');
       use(node.inputs[i], JSPrecedence.ASSIGNMENT_PRECEDENCE);
     }
     buffer.add(']');
   }
 
   void visitIndex(HIndex node) {
@@ skipping 518 matching lines @@
       startBailoutSwitch();
     }
   }
 
   void endElse(HIf node) {
     if (node.elseBlock.hasBailouts()) {
       endBailoutSwitch();
     }
   }
 }