diff options
author | dmalcolm <dmalcolm@138bc75d-0d04-0410-961f-82ee72b054a4> | 2017-04-25 13:34:50 +0000 |
---|---|---|
committer | dmalcolm <dmalcolm@138bc75d-0d04-0410-961f-82ee72b054a4> | 2017-04-25 13:34:50 +0000 |
commit | 945c615989cddb36a8426a8cd66c3fa058d7128e (patch) | |
tree | cb97cfa4afc5343f61e406a573fd5fe602802a4e /gcc/cp/name-lookup.c | |
parent | 5e67c1f83f36d04eda9e8c7538e56497b0700e5c (diff) | |
download | gcc-945c615989cddb36a8426a8cd66c3fa058d7128e.tar.gz |
Fix spelling suggestions for reserved words (PR c++/80177)
gcc/cp/ChangeLog:
PR c++/80177
* name-lookup.c (suggest_alternative_in_explicit_scope): Convert
candidate type of bm from tree to const char *.
(consider_binding_level): Likewise.
(lookup_name_fuzzy): Likewise, using this to merge the best
result from the preprocessor into bm, rather than immediately
returning, so that better matches from reserved words can "win".
Guard the rejection of keywords that don't start decl-specifiers
so it only happens for FUZZY_LOOKUP_TYPENAME.
gcc/testsuite/ChangeLog:
PR c++/80177
* g++.dg/spellcheck-pr80177.C: New test case.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@247233 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/cp/name-lookup.c')
-rw-r--r-- | gcc/cp/name-lookup.c | 37 |
1 files changed, 16 insertions, 21 deletions
diff --git a/gcc/cp/name-lookup.c b/gcc/cp/name-lookup.c index 9dedad4e181..eda6db22a32 100644 --- a/gcc/cp/name-lookup.c +++ b/gcc/cp/name-lookup.c @@ -48,7 +48,8 @@ static bool lookup_using_namespace (tree, struct scope_binding *, tree, tree, int); static bool qualified_lookup_using_namespace (tree, tree, struct scope_binding *, int); -static void consider_binding_level (tree name, best_match <tree, tree> &bm, +static void consider_binding_level (tree name, + best_match <tree, const char *> &bm, cp_binding_level *lvl, bool look_within_fields, enum lookup_name_fuzzy_kind kind); @@ -4550,14 +4551,13 @@ suggest_alternative_in_explicit_scope (location_t location, tree name, cp_binding_level *level = NAMESPACE_LEVEL (scope); - best_match <tree, tree> bm (name); + best_match <tree, const char *> bm (name); consider_binding_level (name, bm, level, false, FUZZY_LOOKUP_NAME); /* See if we have a good suggesion for the user. */ - tree best_id = bm.get_best_meaningful_candidate (); - if (best_id) + const char *fuzzy_name = bm.get_best_meaningful_candidate (); + if (fuzzy_name) { - const char *fuzzy_name = IDENTIFIER_POINTER (best_id); gcc_rich_location richloc (location); richloc.add_fixit_replace (fuzzy_name); inform_at_rich_loc (&richloc, "suggested alternative: %qs", @@ -4797,7 +4797,7 @@ qualified_lookup_using_namespace (tree name, tree scope, Traverse binding level LVL, looking for good name matches for NAME (and BM). */ static void -consider_binding_level (tree name, best_match <tree, tree> &bm, +consider_binding_level (tree name, best_match <tree, const char *> &bm, cp_binding_level *lvl, bool look_within_fields, enum lookup_name_fuzzy_kind kind) { @@ -4809,7 +4809,7 @@ consider_binding_level (tree name, best_match <tree, tree> &bm, tree best_matching_field = lookup_member_fuzzy (type, name, want_type_p); if (best_matching_field) - bm.consider (best_matching_field); + bm.consider (IDENTIFIER_POINTER (best_matching_field)); } for (tree t = lvl->names; t; t = TREE_CHAIN (t)) @@ -4838,7 +4838,7 @@ consider_binding_level (tree name, best_match <tree, tree> &bm, if (tree name = DECL_NAME (d)) /* Ignore internal names with spaces in them. */ if (!strchr (IDENTIFIER_POINTER (name), ' ')) - bm.consider (DECL_NAME (d)); + bm.consider (IDENTIFIER_POINTER (name)); } } @@ -4851,7 +4851,7 @@ lookup_name_fuzzy (tree name, enum lookup_name_fuzzy_kind kind) { gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE); - best_match <tree, tree> bm (name); + best_match <tree, const char *> bm (name); cp_binding_level *lvl; for (lvl = scope_chain->class_bindings; lvl; lvl = lvl->level_chain) @@ -4874,9 +4874,9 @@ lookup_name_fuzzy (tree name, enum lookup_name_fuzzy_kind kind) the identifiers already checked. */ best_macro_match bmm (name, bm.get_best_distance (), parse_in); cpp_hashnode *best_macro = bmm.get_best_meaningful_candidate (); - /* If a macro is the closest so far to NAME, suggest it. */ + /* If a macro is the closest so far to NAME, consider it. */ if (best_macro) - return (const char *)best_macro->ident.str; + bm.consider ((const char *)best_macro->ident.str); /* Try the "starts_decl_specifier_p" keywords to detect "singed" vs "signed" typos. */ @@ -4884,8 +4884,9 @@ lookup_name_fuzzy (tree name, enum lookup_name_fuzzy_kind kind) { const c_common_resword *resword = &c_common_reswords[i]; - if (!cp_keyword_starts_decl_specifier_p (resword->rid)) - continue; + if (kind == FUZZY_LOOKUP_TYPENAME) + if (!cp_keyword_starts_decl_specifier_p (resword->rid)) + continue; tree resword_identifier = ridpointers [resword->rid]; if (!resword_identifier) @@ -4897,16 +4898,10 @@ lookup_name_fuzzy (tree name, enum lookup_name_fuzzy_kind kind) if (!C_IS_RESERVED_WORD (resword_identifier)) continue; - bm.consider (resword_identifier); + bm.consider (IDENTIFIER_POINTER (resword_identifier)); } - /* See if we have a good suggesion for the user. */ - tree best_id = bm.get_best_meaningful_candidate (); - if (best_id) - return IDENTIFIER_POINTER (best_id); - - /* No meaningful suggestion available. */ - return NULL; + return bm.get_best_meaningful_candidate (); } /* Subroutine of outer_binding. |