Turn getters and setters that we know are not intercepted into regular getter and setter calls.

sdk/lib/_internal/compiler/implementation/universe/function_set.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.
 
 part of universe;
 
 // TODO(kasperl): This actually holds getters and setters just fine
 // too and stricly they aren't functions. Maybe this needs a better
 // name -- something like ElementSet seems a bit too generic.
 class FunctionSet extends PartialTypeTree {
@@ skipping 49 matching lines @@
         : hasAnyInHierarchy(selector);
   }
 
   Set<Element> filterAllBySelector(Selector selector) {
     Set<Element> result = new Set<Element>();
     if (root == null) return result;
     root.visitRecursively((FunctionSetNode node) {
       Element member = node.membersByName[selector.name];
       // Since we're running through the entire tree we have to use
       // the applies method that takes types into account.
-      if (member != null && selector.applies(member, compiler)) {
+      if (member != null && selector.appliesUnnamed(member, compiler)) {
         result.add(member);
       }
       return true;
     });
     return result;
   }
 
   Set<Element> filterHierarchyBySelector(Selector selector) {
     Set<Element> result = new Set<Element>();
     if (root == null) return result;
     visitHierarchy(selectorType(selector), (FunctionSetNode node) {
       Element member = node.membersByName[selector.name];
       if (member != null && selector.appliesUntyped(member, compiler)) {
         result.add(member);
       }
       return true;
     });
     return result;
   }
 
   bool hasAnyInAll(Selector selector) {
     bool result = false;
     if (root == null) return result;
     root.visitRecursively((FunctionSetNode node) {
       Element member = node.membersByName[selector.name];
       // Since we're running through the entire tree we have to use
       // the applies method that takes types into account.
-      if (member != null && selector.applies(member, compiler)) {
+      if (member != null && selector.appliesUnnamed(member, compiler)) {
         result = true;
         // End the traversal.
         return false;
       }
       return true;
     });
     return result;
   }
 
   bool hasAnyInHierarchy(Selector selector) {
@@ skipping 22 matching lines @@
 }
 
 class FunctionSetNode extends PartialTypeTreeNode {
 
   final Map<SourceString, Element> membersByName;
 
   FunctionSetNode(ClassElement type) : super(type),
       membersByName = new Map<SourceString, Element>();
 
 }