Get rid of the name in HInvokeDynamic (just use the selector instead).

lib/compiler/implementation/resolver.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.
 
 interface TreeElements {
   Element operator[](Node node);
   Selector getSelector(Send send);
   Type getType(TypeAnnotation annotation);
 }
 
 class TreeElementMapping implements TreeElements {
   Map<Node, Element> map;
-  Map<Send, Selector> selectors;
+  Map<Node, Selector> selectors;
   Map<TypeAnnotation, Type> types;
 
   TreeElementMapping()
     : map = new LinkedHashMap<Node, Element>(),
-      selectors = new LinkedHashMap<Send, Selector>(),
+      selectors = new LinkedHashMap<Node, Selector>(),
       types = new LinkedHashMap<TypeAnnotation, Type>();
 
   operator []=(Node node, Element element) => map[node] = element;
   operator [](Node node) => map[node];
   void remove(Node node) { map.remove(node); }
 
   void setType(TypeAnnotation annotation, Type type) {
     types[annotation] = type;
   }
 
   Type getType(TypeAnnotation annotation) => types[annotation];
 
-  void setSelector(Send send, Selector selector) {
-    selectors[send] = selector;
+  void setSelector(Node node, Selector selector) {
+    selectors[node] = selector;
   }
 
-  Selector getSelector(Send send) => selectors[send];
+  Selector getSelector(Node node) => selectors[node];
 }
 
 class ResolverTask extends CompilerTask {
   ResolverTask(Compiler compiler) : super(compiler);
 
   String get name() => 'Resolver';
 
   TreeElements resolve(Element element) {
     return measure(() {
       ElementKind kind = element.kind;
@@ skipping 1286 matching lines @@
 
     // TODO(ngeoffray): Check if the target can be assigned.
     // TODO(ngeoffray): Warn if target is null and the send is
     // unqualified.
 
     Selector selector = mapping.getSelector(node);
     String source = node.assignmentOperator.source.stringValue;
     bool isComplex = source !== '=';
     if (isComplex) {
       if (selector.isSetter()) {
+        // TODO(kasperl): We're registering the getter selector for
+        // compound assignments on the AST selector node. In the code
+        // generator, we then fetch it from there when generating the
+        // getter for a SendSet node.
+        Selector getterSelector = new Selector.getterFrom(selector);
+        registerSend(getterSelector, getter);
+        mapping.setSelector(node.selector, getterSelector);
         useElement(node.selector, getter);
-        registerSend(new Selector.getterFrom(selector), getter);
       } else {
         // TODO(kasperl): If [getter] is resolved, it will actually
         // refer to the []= operator which isn't the one we want to
         // register here. We should consider using some notion of
         // abstract indexable element that we can resolve to so we can
         // distinguish the two.
         assert(selector.isIndexSet());
         registerSend(new Selector.index(), null);
       }
 
@@ skipping 1154 matching lines @@
   TopScope(LibraryElement library) : super(null, library);
   Element lookup(SourceString name) {
     return library.find(name);
   }
 
   Element add(Element newElement) {
     throw "Cannot add an element in the top scope";
   }
   String toString() => '$element';
 }