Simplify HInvokeInterceptor.

lib/compiler/implementation/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 {
   final JavaScriptBackend backend;
   SsaCodeGeneratorTask(JavaScriptBackend backend)
       : this.backend = backend,
         super(backend.compiler);
   String get name => 'SSA code generator';
@@ skipping 2010 matching lines @@
            node);
     } else {
       visitInvokeStatic(node);
     }
   }
 
   String builtinJsName(HInvokeInterceptor interceptor) {
     // Don't count the target method or the receiver in the arity.
     int arity = interceptor.inputs.length - 2;
     HInstruction receiver = interceptor.inputs[1];
-    bool getter = interceptor.getter;
-    SourceString name = interceptor.name;
+    bool isCall = interceptor.selector.isCall();
+    SourceString name = interceptor.selector.name;
 
     if (interceptor.isLengthGetterOnStringOrArray(types)) {
       return 'length';
-    } else if (receiver.isExtendableArray(types) && !getter) {
+    } else if (receiver.isExtendableArray(types) && isCall) {
       if (name == const SourceString('add') && arity == 1) {
         return 'push';
       }
       if (name == const SourceString('removeLast') && arity == 0) {
         return 'pop';
       }
-    } else if (receiver.isString(types) && !getter) {
+    } else if (receiver.isString(types) && isCall) {
       if (name == const SourceString('concat') &&
           arity == 1 &&
           interceptor.inputs[2].isString(types)) {
         return '+';
       }
     }
 
     return null;
   }
 
   void visitInvokeInterceptor(HInvokeInterceptor node) {
     String builtin = builtinJsName(node);
     if (builtin !== null) {
       if (builtin == '+') {
         use(node.inputs[1]);
         js.Expression left = pop();
         use(node.inputs[2]);
         push(new js.Binary("+", left, pop()), node);
       } else {
         use(node.inputs[1]);
         js.PropertyAccess access = new js.PropertyAccess.field(pop(), builtin);
-        if (node.getter) {
+        if (node.selector.isGetter()) {
           push(access, node);
           return;
         }
         List<js.Expression> arguments = <js.Expression>[];
         for (int i = 2; i < node.inputs.length; i++) {
           use(node.inputs[i]);
           arguments.add(pop());
         }
         push(new js.Call(access, arguments), node);
       }
@@ skipping 831 matching lines @@
   if (leftType.canBeNull() && rightType.canBeNull()) {
     if (left.isConstantNull() || right.isConstantNull() ||
         (leftType.isPrimitive() && leftType == rightType)) {
       return '==';
     }
     return null;
   } else {
     return '===';
   }
 }