Many type fixes.

lib/compiler/implementation/ssa/builder.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 Interceptors {
   Compiler compiler;
   Interceptors(Compiler this.compiler);
 
   SourceString mapOperatorToMethodName(Operator op) {
     String name = op.source.stringValue;
@@ skipping 1871 matching lines @@
     addDynamicSendArgumentsToList(node, inputs);
     push(new HInvokeClosure(selector, inputs));
   }
 
   void handleForeignJs(Send node) {
     Link<Node> link = node.arguments;
     // If the invoke is on foreign code, don't visit the first
     // argument, which is the type, and the second argument,
     // which is the foreign code.
     if (link.isEmpty() || link.isEmpty()) {
-      compiler.cancel('At least two arguments expected', node: node.arguments);
+      compiler.cancel('At least two arguments expected',
+                      node: node.argumentsNode);
     }
     link = link.tail.tail;
     List<HInstruction> inputs = <HInstruction>[];
     addGenericSendArgumentsToList(link, inputs);
     Node type = node.arguments.head;
     Node literal = node.arguments.tail.head;
     if (literal is !StringNode || literal.dynamic.isInterpolation) {
       compiler.cancel('JS code must be a string literal', node: literal);
     }
     if (type is !LiteralString) {
@@ skipping 788 matching lines @@
                                node: node);
       }
       visit(node.statements);
       // This must be the final case (otherwise "default" would be invalid),
       // so we don't need to check for fallthrough.
       return;
     }
 
     // Recursively build the test conditions. Leaves the result on the
     // expression stack.
-    void buildTests(Link<Node> expressions) {
+    void buildTests(Link<Node> remainingExpressions) {
       // Build comparison for one case expression.
       void left() {
         Element equalsHelper = interceptors.getEqualsInterceptor();
         HInstruction target = new HStatic(equalsHelper);
         add(target);
-        visit(expressions.head);
+        visit(remainingExpressions.head);
         push(new HEquals(target, pop(), expression));
       }
 
       // If this is the last expression, just return it.
-      if (expressions.tail.isEmpty()) {
+      if (remainingExpressions.tail.isEmpty()) {
         left();
         return;
       }
 
       void right() {
-        buildTests(expressions.tail);
+        buildTests(remainingExpressions.tail);
       }
       handleLogicalAndOr(left, right, isAnd: false);
     }
 
     buildTests(expressions);
     HInstruction result = popBoolified();
 
     if (node.isDefaultCase) {
       // Don't actually use the condition result.
       // This must be final case, so don't check for abort.
@@ skipping 310 matching lines @@
                                         false,
                                         <HInstruction>[target, input]));
     return builder.pop();
   }
 
   HInstruction result() {
     flushLiterals();
     return prefix;
   }
 }