dart2js cps: Do not count refinement nodes when measuring size.

pkg/compiler/lib/src/cps_ir/inline.dart

 // Copyright (c) 2015, 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.
 
 library cps_ir.optimization.inline;
 
 import 'cps_fragment.dart';
 import 'cps_ir_builder.dart' show ThisParameterLocal;
 import 'cps_ir_nodes.dart';
 import 'optimizers.dart';
@@ skipping 202 matching lines @@
     visitor.countArgument(invoke.receiver, function.thisParameter);
     for (int i = 0; i < invoke.arguments.length; ++i) {
       visitor.countArgument(invoke.arguments[i], function.parameters[i]);
     }
     return visitor.size;
   }
 
   // Inlining a function incurs a cost equal to the number of primitives and
   // non-jump tail expressions.
   // TODO(kmillikin): Tune the size computation and size bound.
-  processLetPrim(LetPrim node) => ++size;
+  processLetPrim(LetPrim node) {
+    if (node.primitive is! Refinement) {
+      ++size;
+    }
+  }
   processLetMutable(LetMutable node) => ++size;
   processBranch(Branch node) => ++size;
   processThrow(Throw nose) => ++size;
   processRethrow(Rethrow node) => ++size;
 }
 
 class InliningVisitor extends TrampolineRecursiveVisitor {
   final Inliner _inliner;
 
   // A successful inlining attempt returns the [Primitive] that represents the
@@ skipping 289 matching lines @@
       // We cannot inline a constructor invocation containing type arguments
       // because CreateInstance in the body does not know the type arguments.
       // We would incorrectly instantiate a class like A instead of A<B>.
       // TODO(kmillikin): try to fix this.
       GenericType generic = node.dartType;
       if (generic.typeArguments.any((DartType t) => !t.isDynamic)) return null;
     }
     return tryInlining(node, node.target, null);
   }
 }