Don't search for 'declaration' of elements, just name is usually enough.

pkg/analysis_server/lib/src/services/search/search_engine_internal.dart

 // Copyright (c) 2016, 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 analysis_server.src.services.search.search_engine_internal;
 
 import 'dart:async';
 
 import 'package:analysis_server/src/services/correction/source_range.dart';
 import 'package:analysis_server/src/services/index/index.dart';
@@ skipping 244 matching lines @@
         }
       }
     }
     return matches;
   }
 
   Future<List<SearchMatch>> _searchReferences_Local(
       Element element, bool isRootNode(AstNode n)) async {
     _LocalReferencesVisitor visitor = new _LocalReferencesVisitor(element);
     AstProvider astProvider = _getAstProvider(element.source.fullName);
-    AstNode node = await astProvider.getResolvedNodeForElement(element);
-    AstNode enclosingNode = node?.getAncestor(isRootNode);
+    AstNode name = await astProvider.getResolvedNameForElement(element);
+    AstNode enclosingNode = name?.getAncestor(isRootNode);
     enclosingNode?.accept(visitor);
     return visitor.matches;
   }
 
   Future<List<SearchMatch>> _searchReferences_Parameter(
       ParameterElement parameter) async {
     List<SearchMatch> matches = <SearchMatch>[];
     matches.addAll(await _searchReferences(parameter));
     matches.addAll(await _searchReferences_Local(parameter, (AstNode node) {
       AstNode parent = node.parent;
@@ skipping 306 matching lines @@
       _addMatch(node, kind);
     }
   }
 
   void _addMatch(AstNode node, MatchKind kind) {
     bool isQualified = node.parent is Label;
     matches.add(new SearchMatchImpl(context, libraryUri, unitUri, kind,
         rangeNode(node), true, isQualified));
   }
 }