]>
Commit | Line | Data |
---|---|---|
aed81407 | 1 | /* Definitions for C++ name lookup routines. |
a5544970 | 2 | Copyright (C) 2003-2019 Free Software Foundation, Inc. |
aed81407 GDR |
3 | Contributed by Gabriel Dos Reis <gdr@integrable-solutions.net> |
4 | ||
ed3cf953 | 5 | This file is part of GCC. |
aed81407 | 6 | |
ed3cf953 | 7 | GCC is free software; you can redistribute it and/or modify |
aed81407 | 8 | it under the terms of the GNU General Public License as published by |
e77f031d | 9 | the Free Software Foundation; either version 3, or (at your option) |
aed81407 GDR |
10 | any later version. |
11 | ||
ed3cf953 | 12 | GCC is distributed in the hope that it will be useful, |
aed81407 GDR |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
e77f031d NC |
18 | along with GCC; see the file COPYING3. If not see |
19 | <http://www.gnu.org/licenses/>. */ | |
aed81407 GDR |
20 | |
21 | #include "config.h" | |
6c7a259b | 22 | #define INCLUDE_UNIQUE_PTR |
aed81407 GDR |
23 | #include "system.h" |
24 | #include "coretypes.h" | |
2adfab87 AM |
25 | #include "cp-tree.h" |
26 | #include "timevar.h" | |
d8a2d370 DN |
27 | #include "stringpool.h" |
28 | #include "print-tree.h" | |
29 | #include "attribs.h" | |
6097b0c3 | 30 | #include "debug.h" |
39dabefd | 31 | #include "c-family/c-pragma.h" |
501c95ff | 32 | #include "params.h" |
52ed68f7 DM |
33 | #include "gcc-rich-location.h" |
34 | #include "spellcheck-tree.h" | |
35 | #include "parser.h" | |
6c7a259b | 36 | #include "c-family/name-hint.h" |
26edace6 | 37 | #include "c-family/known-headers.h" |
613bc14f | 38 | #include "c-family/c-spellcheck.h" |
00e8de68 | 39 | |
b655c310 NS |
40 | static cxx_binding *cxx_binding_make (tree value, tree type); |
41 | static cp_binding_level *innermost_nonclass_level (void); | |
42 | static void set_identifier_type_value_with_scope (tree id, tree decl, | |
43 | cp_binding_level *b); | |
7e2de6df DM |
44 | static name_hint maybe_suggest_missing_std_header (location_t location, |
45 | tree name); | |
46 | static name_hint suggest_alternatives_for_1 (location_t location, tree name, | |
47 | bool suggest_misspellings); | |
15f8ac7f | 48 | |
3c9cca88 NS |
49 | /* Create an overload suitable for recording an artificial TYPE_DECL |
50 | and another decl. We use this machanism to implement the struct | |
51 | stat hack within a namespace. It'd be nice to use it everywhere. */ | |
52 | ||
53 | #define STAT_HACK_P(N) ((N) && TREE_CODE (N) == OVERLOAD && OVL_LOOKUP_P (N)) | |
54 | #define STAT_TYPE(N) TREE_TYPE (N) | |
55 | #define STAT_DECL(N) OVL_FUNCTION (N) | |
56 | #define MAYBE_STAT_DECL(N) (STAT_HACK_P (N) ? STAT_DECL (N) : N) | |
57 | #define MAYBE_STAT_TYPE(N) (STAT_HACK_P (N) ? STAT_TYPE (N) : NULL_TREE) | |
58 | ||
3d7ff728 NS |
59 | /* Create a STAT_HACK node with DECL as the value binding and TYPE as |
60 | the type binding. */ | |
61 | ||
62 | static tree | |
63 | stat_hack (tree decl = NULL_TREE, tree type = NULL_TREE) | |
3c9cca88 NS |
64 | { |
65 | tree result = make_node (OVERLOAD); | |
66 | ||
67 | /* Mark this as a lookup, so we can tell this is a stat hack. */ | |
68 | OVL_LOOKUP_P (result) = true; | |
69 | STAT_DECL (result) = decl; | |
70 | STAT_TYPE (result) = type; | |
71 | return result; | |
72 | } | |
73 | ||
3a9cc685 NS |
74 | /* Create a local binding level for NAME. */ |
75 | ||
76 | static cxx_binding * | |
77 | create_local_binding (cp_binding_level *level, tree name) | |
78 | { | |
79 | cxx_binding *binding = cxx_binding_make (NULL, NULL); | |
80 | ||
81 | INHERITED_VALUE_BINDING_P (binding) = false; | |
82 | LOCAL_BINDING_P (binding) = true; | |
83 | binding->scope = level; | |
84 | binding->previous = IDENTIFIER_BINDING (name); | |
85 | ||
86 | IDENTIFIER_BINDING (name) = binding; | |
87 | ||
88 | return binding; | |
89 | } | |
90 | ||
aa7bda5f NS |
91 | /* Find the binding for NAME in namespace NS. If CREATE_P is true, |
92 | make an empty binding if there wasn't one. */ | |
93 | ||
3c9cca88 NS |
94 | static tree * |
95 | find_namespace_slot (tree ns, tree name, bool create_p = false) | |
aa7bda5f | 96 | { |
e833f686 NS |
97 | tree *slot = DECL_NAMESPACE_BINDINGS (ns) |
98 | ->find_slot_with_hash (name, name ? IDENTIFIER_HASH_VALUE (name) : 0, | |
99 | create_p ? INSERT : NO_INSERT); | |
98c28dd4 | 100 | return slot; |
3c9cca88 NS |
101 | } |
102 | ||
103 | static tree | |
104 | find_namespace_value (tree ns, tree name) | |
105 | { | |
106 | tree *b = find_namespace_slot (ns, name); | |
107 | ||
108 | return b ? MAYBE_STAT_DECL (*b) : NULL_TREE; | |
aa7bda5f NS |
109 | } |
110 | ||
b655c310 | 111 | /* Add DECL to the list of things declared in B. */ |
5880f14f | 112 | |
b655c310 | 113 | static void |
9d029ddf | 114 | add_decl_to_level (cp_binding_level *b, tree decl) |
5880f14f | 115 | { |
5256a7f5 | 116 | gcc_assert (b->kind != sk_class); |
b655c310 | 117 | |
c957e9c0 NS |
118 | /* Make sure we don't create a circular list. xref_tag can end |
119 | up pushing the same artificial decl more than once. We | |
120 | should have already detected that in update_binding. */ | |
121 | gcc_assert (b->names != decl); | |
122 | ||
123 | /* We build up the list in reverse order, and reverse it later if | |
124 | necessary. */ | |
125 | TREE_CHAIN (decl) = b->names; | |
126 | b->names = decl; | |
127 | ||
128 | /* If appropriate, add decl to separate list of statics. We | |
129 | include extern variables because they might turn out to be | |
130 | static later. It's OK for this list to contain a few false | |
131 | positives. */ | |
132 | if (b->kind == sk_namespace | |
133 | && ((VAR_P (decl) | |
134 | && (TREE_STATIC (decl) || DECL_EXTERNAL (decl))) | |
135 | || (TREE_CODE (decl) == FUNCTION_DECL | |
136 | && (!TREE_PUBLIC (decl) | |
137 | || decl_anon_ns_mem_p (decl) | |
138 | || DECL_DECLARED_INLINE_P (decl))))) | |
139 | vec_safe_push (static_decls, decl); | |
b655c310 | 140 | } |
daafa301 | 141 | |
59a4ede9 NS |
142 | /* Find the binding for NAME in the local binding level B. */ |
143 | ||
144 | static cxx_binding * | |
145 | find_local_binding (cp_binding_level *b, tree name) | |
146 | { | |
147 | if (cxx_binding *binding = IDENTIFIER_BINDING (name)) | |
148 | for (;; b = b->level_chain) | |
149 | { | |
ee336e84 | 150 | if (binding->scope == b) |
59a4ede9 NS |
151 | return binding; |
152 | ||
153 | /* Cleanup contours are transparent to the language. */ | |
154 | if (b->kind != sk_cleanup) | |
155 | break; | |
156 | } | |
157 | return NULL; | |
158 | } | |
159 | ||
6c1dae73 | 160 | class name_lookup |
b655c310 | 161 | { |
932f48ac NS |
162 | public: |
163 | typedef std::pair<tree, tree> using_pair; | |
164 | typedef vec<using_pair, va_heap, vl_embed> using_queue; | |
165 | ||
f35a733d NS |
166 | public: |
167 | tree name; /* The identifier being looked for. */ | |
168 | tree value; /* A (possibly ambiguous) set of things found. */ | |
169 | tree type; /* A type that has been found. */ | |
9dda0ace | 170 | int flags; /* Lookup flags. */ |
3d7ff728 NS |
171 | bool deduping; /* Full deduping is needed because using declarations |
172 | are in play. */ | |
f35a733d NS |
173 | vec<tree, va_heap, vl_embed> *scopes; |
174 | name_lookup *previous; /* Previously active lookup. */ | |
f35a733d NS |
175 | |
176 | protected: | |
177 | /* Marked scope stack for outermost name lookup. */ | |
178 | static vec<tree, va_heap, vl_embed> *shared_scopes; | |
179 | /* Currently active lookup. */ | |
180 | static name_lookup *active; | |
181 | ||
182 | public: | |
9dda0ace NS |
183 | name_lookup (tree n, int f = 0) |
184 | : name (n), value (NULL_TREE), type (NULL_TREE), flags (f), | |
3d7ff728 | 185 | deduping (false), scopes (NULL), previous (NULL) |
f35a733d NS |
186 | { |
187 | preserve_state (); | |
188 | } | |
189 | ~name_lookup () | |
190 | { | |
f35a733d NS |
191 | restore_state (); |
192 | } | |
193 | ||
194 | private: /* Uncopyable, unmovable, unassignable. I am a rock. */ | |
195 | name_lookup (const name_lookup &); | |
196 | name_lookup &operator= (const name_lookup &); | |
197 | ||
198 | protected: | |
199 | static bool seen_p (tree scope) | |
200 | { | |
201 | return LOOKUP_SEEN_P (scope); | |
202 | } | |
203 | static bool found_p (tree scope) | |
204 | { | |
205 | return LOOKUP_FOUND_P (scope); | |
206 | } | |
207 | ||
208 | void mark_seen (tree scope); /* Mark and add to scope vector. */ | |
209 | static void mark_found (tree scope) | |
210 | { | |
211 | gcc_checking_assert (seen_p (scope)); | |
212 | LOOKUP_FOUND_P (scope) = true; | |
213 | } | |
214 | bool see_and_mark (tree scope) | |
215 | { | |
216 | bool ret = seen_p (scope); | |
217 | if (!ret) | |
218 | mark_seen (scope); | |
219 | return ret; | |
220 | } | |
221 | bool find_and_mark (tree scope); | |
222 | ||
223 | private: | |
224 | void preserve_state (); | |
225 | void restore_state (); | |
226 | ||
9dda0ace NS |
227 | private: |
228 | static tree ambiguous (tree thing, tree current); | |
3d7ff728 | 229 | void add_overload (tree fns); |
9dda0ace NS |
230 | void add_value (tree new_val); |
231 | void add_type (tree new_type); | |
232 | bool process_binding (tree val_bind, tree type_bind); | |
233 | ||
234 | /* Look in only namespace. */ | |
235 | bool search_namespace_only (tree scope); | |
236 | /* Look in namespace and its (recursive) inlines. Ignore using | |
237 | directives. Return true if something found (inc dups). */ | |
238 | bool search_namespace (tree scope); | |
239 | /* Look in the using directives of namespace + inlines using | |
240 | qualified lookup rules. */ | |
241 | bool search_usings (tree scope); | |
242 | ||
932f48ac NS |
243 | private: |
244 | using_queue *queue_namespace (using_queue *queue, int depth, tree scope); | |
3c9feefc NS |
245 | using_queue *do_queue_usings (using_queue *queue, int depth, |
246 | vec<tree, va_gc> *usings); | |
247 | using_queue *queue_usings (using_queue *queue, int depth, | |
248 | vec<tree, va_gc> *usings) | |
932f48ac NS |
249 | { |
250 | if (usings) | |
251 | queue = do_queue_usings (queue, depth, usings); | |
252 | return queue; | |
253 | } | |
254 | ||
9dda0ace | 255 | private: |
f35a733d NS |
256 | void add_fns (tree); |
257 | ||
258 | void adl_expr (tree); | |
259 | void adl_type (tree); | |
260 | void adl_template_arg (tree); | |
261 | void adl_class (tree); | |
262 | void adl_bases (tree); | |
263 | void adl_class_only (tree); | |
264 | void adl_namespace (tree); | |
265 | void adl_namespace_only (tree); | |
266 | ||
267 | public: | |
9dda0ace NS |
268 | /* Search namespace + inlines + maybe usings as qualified lookup. */ |
269 | bool search_qualified (tree scope, bool usings = true); | |
270 | ||
932f48ac NS |
271 | /* Search namespace + inlines + usings as unqualified lookup. */ |
272 | bool search_unqualified (tree scope, cp_binding_level *); | |
273 | ||
9dda0ace | 274 | /* ADL lookup of ARGS. */ |
f35a733d | 275 | tree search_adl (tree fns, vec<tree, va_gc> *args); |
b655c310 | 276 | }; |
8db29d88 | 277 | |
f35a733d NS |
278 | /* Scope stack shared by all outermost lookups. This avoids us |
279 | allocating and freeing on every single lookup. */ | |
280 | vec<tree, va_heap, vl_embed> *name_lookup::shared_scopes; | |
8db29d88 | 281 | |
f35a733d NS |
282 | /* Currently active lookup. */ |
283 | name_lookup *name_lookup::active; | |
284 | ||
285 | /* Name lookup is recursive, becase ADL can cause template | |
286 | instatiation. This is of course a rare event, so we optimize for | |
287 | it not happening. When we discover an active name-lookup, which | |
288 | must be an ADL lookup, we need to unmark the marked scopes and also | |
289 | unmark the lookup we might have been accumulating. */ | |
290 | ||
291 | void | |
292 | name_lookup::preserve_state () | |
8db29d88 | 293 | { |
f35a733d NS |
294 | previous = active; |
295 | if (previous) | |
296 | { | |
297 | unsigned length = vec_safe_length (previous->scopes); | |
298 | vec_safe_reserve (previous->scopes, length * 2); | |
299 | for (unsigned ix = length; ix--;) | |
300 | { | |
301 | tree decl = (*previous->scopes)[ix]; | |
302 | ||
303 | gcc_checking_assert (LOOKUP_SEEN_P (decl)); | |
304 | LOOKUP_SEEN_P (decl) = false; | |
305 | ||
306 | /* Preserve the FOUND_P state on the interrupted lookup's | |
307 | stack. */ | |
308 | if (LOOKUP_FOUND_P (decl)) | |
309 | { | |
310 | LOOKUP_FOUND_P (decl) = false; | |
311 | previous->scopes->quick_push (decl); | |
312 | } | |
313 | } | |
32196b87 NS |
314 | |
315 | /* Unmark the outer partial lookup. */ | |
3d7ff728 NS |
316 | if (previous->deduping) |
317 | lookup_mark (previous->value, false); | |
f35a733d | 318 | } |
b655c310 | 319 | else |
f35a733d NS |
320 | scopes = shared_scopes; |
321 | active = this; | |
8db29d88 AO |
322 | } |
323 | ||
f35a733d | 324 | /* Restore the marking state of a lookup we interrupted. */ |
daafa301 | 325 | |
f35a733d NS |
326 | void |
327 | name_lookup::restore_state () | |
5e0c54e5 | 328 | { |
3d7ff728 NS |
329 | if (deduping) |
330 | lookup_mark (value, false); | |
331 | ||
f35a733d NS |
332 | /* Unmark and empty this lookup's scope stack. */ |
333 | for (unsigned ix = vec_safe_length (scopes); ix--;) | |
334 | { | |
335 | tree decl = scopes->pop (); | |
336 | gcc_checking_assert (LOOKUP_SEEN_P (decl)); | |
337 | LOOKUP_SEEN_P (decl) = false; | |
338 | LOOKUP_FOUND_P (decl) = false; | |
339 | } | |
5e0c54e5 | 340 | |
f35a733d NS |
341 | active = previous; |
342 | if (previous) | |
5e0c54e5 | 343 | { |
32196b87 NS |
344 | free (scopes); |
345 | ||
f35a733d NS |
346 | unsigned length = vec_safe_length (previous->scopes); |
347 | for (unsigned ix = 0; ix != length; ix++) | |
b655c310 | 348 | { |
f35a733d NS |
349 | tree decl = (*previous->scopes)[ix]; |
350 | if (LOOKUP_SEEN_P (decl)) | |
351 | { | |
352 | /* The remainder of the scope stack must be recording | |
353 | FOUND_P decls, which we want to pop off. */ | |
354 | do | |
355 | { | |
356 | tree decl = previous->scopes->pop (); | |
357 | gcc_checking_assert (LOOKUP_SEEN_P (decl) | |
358 | && !LOOKUP_FOUND_P (decl)); | |
359 | LOOKUP_FOUND_P (decl) = true; | |
360 | } | |
361 | while (++ix != length); | |
362 | break; | |
363 | } | |
364 | ||
365 | gcc_checking_assert (!LOOKUP_FOUND_P (decl)); | |
366 | LOOKUP_SEEN_P (decl) = true; | |
b655c310 | 367 | } |
5e0c54e5 | 368 | |
32196b87 | 369 | /* Remark the outer partial lookup. */ |
3d7ff728 NS |
370 | if (previous->deduping) |
371 | lookup_mark (previous->value, true); | |
f35a733d NS |
372 | } |
373 | else | |
374 | shared_scopes = scopes; | |
5e0c54e5 | 375 | } |
5e0c54e5 | 376 | |
f35a733d NS |
377 | void |
378 | name_lookup::mark_seen (tree scope) | |
b655c310 | 379 | { |
f35a733d NS |
380 | gcc_checking_assert (!seen_p (scope)); |
381 | LOOKUP_SEEN_P (scope) = true; | |
382 | vec_safe_push (scopes, scope); | |
383 | } | |
daafa301 | 384 | |
f35a733d NS |
385 | bool |
386 | name_lookup::find_and_mark (tree scope) | |
387 | { | |
388 | bool result = LOOKUP_FOUND_P (scope); | |
389 | if (!result) | |
390 | { | |
391 | LOOKUP_FOUND_P (scope) = true; | |
392 | if (!LOOKUP_SEEN_P (scope)) | |
393 | vec_safe_push (scopes, scope); | |
394 | } | |
5e0c54e5 | 395 | |
f35a733d NS |
396 | return result; |
397 | } | |
daafa301 | 398 | |
9dda0ace NS |
399 | /* THING and CURRENT are ambiguous, concatenate them. */ |
400 | ||
401 | tree | |
402 | name_lookup::ambiguous (tree thing, tree current) | |
403 | { | |
404 | if (TREE_CODE (current) != TREE_LIST) | |
405 | { | |
406 | current = build_tree_list (NULL_TREE, current); | |
407 | TREE_TYPE (current) = error_mark_node; | |
408 | } | |
409 | current = tree_cons (NULL_TREE, thing, current); | |
410 | TREE_TYPE (current) = error_mark_node; | |
411 | ||
412 | return current; | |
413 | } | |
414 | ||
3d7ff728 NS |
415 | /* FNS is a new overload set to add to the exising set. */ |
416 | ||
417 | void | |
418 | name_lookup::add_overload (tree fns) | |
419 | { | |
420 | if (!deduping && TREE_CODE (fns) == OVERLOAD) | |
421 | { | |
422 | tree probe = fns; | |
423 | if (flags & LOOKUP_HIDDEN) | |
424 | probe = ovl_skip_hidden (probe); | |
8e82c473 NS |
425 | if (probe && TREE_CODE (probe) == OVERLOAD |
426 | && OVL_DEDUP_P (probe)) | |
3d7ff728 NS |
427 | { |
428 | /* We're about to add something found by a using | |
429 | declaration, so need to engage deduping mode. */ | |
430 | lookup_mark (value, true); | |
431 | deduping = true; | |
432 | } | |
433 | } | |
434 | ||
435 | value = lookup_maybe_add (fns, value, deduping); | |
436 | } | |
437 | ||
9dda0ace NS |
438 | /* Add a NEW_VAL, a found value binding into the current value binding. */ |
439 | ||
440 | void | |
441 | name_lookup::add_value (tree new_val) | |
442 | { | |
3d7ff728 NS |
443 | if (OVL_P (new_val) && (!value || OVL_P (value))) |
444 | add_overload (new_val); | |
445 | else if (!value) | |
9dda0ace NS |
446 | value = new_val; |
447 | else if (value == new_val) | |
448 | ; | |
449 | else if ((TREE_CODE (value) == TYPE_DECL | |
450 | && TREE_CODE (new_val) == TYPE_DECL | |
451 | && same_type_p (TREE_TYPE (value), TREE_TYPE (new_val)))) | |
71bbbd13 NS |
452 | /* Typedefs to the same type. */; |
453 | else if (TREE_CODE (value) == NAMESPACE_DECL | |
454 | && TREE_CODE (new_val) == NAMESPACE_DECL | |
455 | && ORIGINAL_NAMESPACE (value) == ORIGINAL_NAMESPACE (new_val)) | |
456 | /* Namespace (possibly aliased) to the same namespace. Locate | |
457 | the namespace*/ | |
458 | value = ORIGINAL_NAMESPACE (value); | |
9dda0ace | 459 | else |
3d7ff728 NS |
460 | { |
461 | if (deduping) | |
462 | { | |
463 | /* Disengage deduping mode. */ | |
464 | lookup_mark (value, false); | |
465 | deduping = false; | |
466 | } | |
467 | value = ambiguous (new_val, value); | |
468 | } | |
9dda0ace NS |
469 | } |
470 | ||
471 | /* Add a NEW_TYPE, a found type binding into the current type binding. */ | |
472 | ||
473 | void | |
474 | name_lookup::add_type (tree new_type) | |
475 | { | |
476 | if (!type) | |
477 | type = new_type; | |
478 | else if (TREE_CODE (type) == TREE_LIST | |
479 | || !same_type_p (TREE_TYPE (type), TREE_TYPE (new_type))) | |
480 | type = ambiguous (new_type, type); | |
481 | } | |
482 | ||
483 | /* Process a found binding containing NEW_VAL and NEW_TYPE. Returns | |
484 | true if we actually found something noteworthy. */ | |
485 | ||
486 | bool | |
487 | name_lookup::process_binding (tree new_val, tree new_type) | |
488 | { | |
489 | /* Did we really see a type? */ | |
490 | if (new_type | |
491 | && (LOOKUP_NAMESPACES_ONLY (flags) | |
492 | || (!(flags & LOOKUP_HIDDEN) | |
493 | && DECL_LANG_SPECIFIC (new_type) | |
494 | && DECL_ANTICIPATED (new_type)))) | |
495 | new_type = NULL_TREE; | |
496 | ||
497 | if (new_val && !(flags & LOOKUP_HIDDEN)) | |
498 | new_val = ovl_skip_hidden (new_val); | |
499 | ||
500 | /* Do we really see a value? */ | |
501 | if (new_val) | |
502 | switch (TREE_CODE (new_val)) | |
503 | { | |
504 | case TEMPLATE_DECL: | |
505 | /* If we expect types or namespaces, and not templates, | |
506 | or this is not a template class. */ | |
507 | if ((LOOKUP_QUALIFIERS_ONLY (flags) | |
508 | && !DECL_TYPE_TEMPLATE_P (new_val))) | |
509 | new_val = NULL_TREE; | |
510 | break; | |
511 | case TYPE_DECL: | |
512 | if (LOOKUP_NAMESPACES_ONLY (flags) | |
513 | || (new_type && (flags & LOOKUP_PREFER_TYPES))) | |
514 | new_val = NULL_TREE; | |
515 | break; | |
516 | case NAMESPACE_DECL: | |
517 | if (LOOKUP_TYPES_ONLY (flags)) | |
518 | new_val = NULL_TREE; | |
519 | break; | |
520 | default: | |
521 | if (LOOKUP_QUALIFIERS_ONLY (flags)) | |
522 | new_val = NULL_TREE; | |
523 | } | |
524 | ||
525 | if (!new_val) | |
526 | { | |
527 | new_val = new_type; | |
528 | new_type = NULL_TREE; | |
529 | } | |
530 | ||
531 | /* Merge into the lookup */ | |
532 | if (new_val) | |
533 | add_value (new_val); | |
534 | if (new_type) | |
535 | add_type (new_type); | |
536 | ||
537 | return new_val != NULL_TREE; | |
538 | } | |
539 | ||
540 | /* Look in exactly namespace SCOPE. */ | |
541 | ||
542 | bool | |
543 | name_lookup::search_namespace_only (tree scope) | |
544 | { | |
545 | bool found = false; | |
546 | ||
3c9cca88 NS |
547 | if (tree *binding = find_namespace_slot (scope, name)) |
548 | found |= process_binding (MAYBE_STAT_DECL (*binding), | |
549 | MAYBE_STAT_TYPE (*binding)); | |
9dda0ace NS |
550 | |
551 | return found; | |
552 | } | |
553 | ||
554 | /* Conditionally look in namespace SCOPE and inline children. */ | |
555 | ||
556 | bool | |
557 | name_lookup::search_namespace (tree scope) | |
558 | { | |
559 | if (see_and_mark (scope)) | |
560 | /* We've visited this scope before. Return what we found then. */ | |
561 | return found_p (scope); | |
562 | ||
563 | /* Look in exactly namespace. */ | |
564 | bool found = search_namespace_only (scope); | |
7a4e1f7d NS |
565 | |
566 | /* Don't look into inline children, if we're looking for an | |
567 | anonymous name -- it must be in the current scope, if anywhere. */ | |
568 | if (name) | |
569 | /* Recursively look in its inline children. */ | |
570 | if (vec<tree, va_gc> *inlinees = DECL_NAMESPACE_INLINEES (scope)) | |
571 | for (unsigned ix = inlinees->length (); ix--;) | |
572 | found |= search_namespace ((*inlinees)[ix]); | |
9dda0ace NS |
573 | |
574 | if (found) | |
575 | mark_found (scope); | |
576 | ||
577 | return found; | |
578 | } | |
579 | ||
580 | /* Recursively follow using directives of SCOPE & its inline children. | |
581 | Such following is essentially a flood-fill algorithm. */ | |
582 | ||
583 | bool | |
584 | name_lookup::search_usings (tree scope) | |
585 | { | |
586 | /* We do not check seen_p here, as that was already set during the | |
587 | namespace_only walk. */ | |
588 | if (found_p (scope)) | |
589 | return true; | |
590 | ||
591 | bool found = false; | |
0841bc15 | 592 | if (vec<tree, va_gc> *usings = NAMESPACE_LEVEL (scope)->using_directives) |
3c9feefc NS |
593 | for (unsigned ix = usings->length (); ix--;) |
594 | found |= search_qualified ((*usings)[ix], true); | |
9dda0ace NS |
595 | |
596 | /* Look in its inline children. */ | |
3c9feefc NS |
597 | if (vec<tree, va_gc> *inlinees = DECL_NAMESPACE_INLINEES (scope)) |
598 | for (unsigned ix = inlinees->length (); ix--;) | |
599 | found |= search_usings ((*inlinees)[ix]); | |
9dda0ace NS |
600 | |
601 | if (found) | |
602 | mark_found (scope); | |
603 | ||
604 | return found; | |
605 | } | |
606 | ||
607 | /* Qualified namespace lookup in SCOPE. | |
608 | 1) Look in SCOPE (+inlines). If found, we're done. | |
609 | 2) Otherwise, if USINGS is true, | |
610 | recurse for every using directive of SCOPE (+inlines). | |
611 | ||
612 | Trickiness is (a) loops and (b) multiple paths to same namespace. | |
613 | In both cases we want to not repeat any lookups, and know whether | |
614 | to stop the caller's step #2. Do this via the FOUND_P marker. */ | |
615 | ||
616 | bool | |
617 | name_lookup::search_qualified (tree scope, bool usings) | |
618 | { | |
619 | bool found = false; | |
620 | ||
621 | if (seen_p (scope)) | |
622 | found = found_p (scope); | |
623 | else | |
624 | { | |
625 | found = search_namespace (scope); | |
626 | if (!found && usings) | |
627 | found = search_usings (scope); | |
628 | } | |
629 | ||
630 | return found; | |
631 | } | |
632 | ||
932f48ac NS |
633 | /* Add SCOPE to the unqualified search queue, recursively add its |
634 | inlines and those via using directives. */ | |
635 | ||
636 | name_lookup::using_queue * | |
637 | name_lookup::queue_namespace (using_queue *queue, int depth, tree scope) | |
638 | { | |
639 | if (see_and_mark (scope)) | |
640 | return queue; | |
641 | ||
642 | /* Record it. */ | |
643 | tree common = scope; | |
644 | while (SCOPE_DEPTH (common) > depth) | |
645 | common = CP_DECL_CONTEXT (common); | |
646 | vec_safe_push (queue, using_pair (common, scope)); | |
647 | ||
648 | /* Queue its inline children. */ | |
3c9feefc NS |
649 | if (vec<tree, va_gc> *inlinees = DECL_NAMESPACE_INLINEES (scope)) |
650 | for (unsigned ix = inlinees->length (); ix--;) | |
651 | queue = queue_namespace (queue, depth, (*inlinees)[ix]); | |
932f48ac NS |
652 | |
653 | /* Queue its using targets. */ | |
0841bc15 | 654 | queue = queue_usings (queue, depth, NAMESPACE_LEVEL (scope)->using_directives); |
932f48ac NS |
655 | |
656 | return queue; | |
657 | } | |
658 | ||
659 | /* Add the namespaces in USINGS to the unqualified search queue. */ | |
660 | ||
661 | name_lookup::using_queue * | |
3c9feefc NS |
662 | name_lookup::do_queue_usings (using_queue *queue, int depth, |
663 | vec<tree, va_gc> *usings) | |
932f48ac | 664 | { |
3c9feefc NS |
665 | for (unsigned ix = usings->length (); ix--;) |
666 | queue = queue_namespace (queue, depth, (*usings)[ix]); | |
932f48ac NS |
667 | |
668 | return queue; | |
669 | } | |
670 | ||
671 | /* Unqualified namespace lookup in SCOPE. | |
672 | 1) add scope+inlins to worklist. | |
673 | 2) recursively add target of every using directive | |
674 | 3) for each worklist item where SCOPE is common ancestor, search it | |
675 | 4) if nothing find, scope=parent, goto 1. */ | |
676 | ||
677 | bool | |
678 | name_lookup::search_unqualified (tree scope, cp_binding_level *level) | |
679 | { | |
680 | /* Make static to avoid continual reallocation. We're not | |
681 | recursive. */ | |
682 | static using_queue *queue = NULL; | |
683 | bool found = false; | |
684 | int length = vec_safe_length (queue); | |
685 | ||
686 | /* Queue local using-directives. */ | |
687 | for (; level->kind != sk_namespace; level = level->level_chain) | |
688 | queue = queue_usings (queue, SCOPE_DEPTH (scope), level->using_directives); | |
689 | ||
690 | for (; !found; scope = CP_DECL_CONTEXT (scope)) | |
691 | { | |
692 | gcc_assert (!DECL_NAMESPACE_ALIAS (scope)); | |
693 | int depth = SCOPE_DEPTH (scope); | |
694 | ||
695 | /* Queue namespaces reachable from SCOPE. */ | |
696 | queue = queue_namespace (queue, depth, scope); | |
697 | ||
698 | /* Search every queued namespace where SCOPE is the common | |
699 | ancestor. Adjust the others. */ | |
700 | unsigned ix = length; | |
701 | do | |
702 | { | |
703 | using_pair &pair = (*queue)[ix]; | |
704 | while (pair.first == scope) | |
705 | { | |
706 | found |= search_namespace_only (pair.second); | |
707 | pair = queue->pop (); | |
708 | if (ix == queue->length ()) | |
709 | goto done; | |
710 | } | |
711 | /* The depth is the same as SCOPE, find the parent scope. */ | |
712 | if (SCOPE_DEPTH (pair.first) == depth) | |
713 | pair.first = CP_DECL_CONTEXT (pair.first); | |
714 | ix++; | |
715 | } | |
716 | while (ix < queue->length ()); | |
717 | done:; | |
718 | if (scope == global_namespace) | |
719 | break; | |
02c7dd78 NS |
720 | |
721 | /* If looking for hidden names, we only look in the innermost | |
722 | namespace scope. [namespace.memdef]/3 If a friend | |
723 | declaration in a non-local class first declares a class, | |
724 | function, class template or function template the friend is a | |
725 | member of the innermost enclosing namespace. See also | |
726 | [basic.lookup.unqual]/7 */ | |
727 | if (flags & LOOKUP_HIDDEN) | |
728 | break; | |
932f48ac NS |
729 | } |
730 | ||
731 | vec_safe_truncate (queue, length); | |
732 | ||
733 | return found; | |
734 | } | |
735 | ||
f35a733d NS |
736 | /* FNS is a value binding. If it is a (set of overloaded) functions, |
737 | add them into the current value. */ | |
5e0c54e5 | 738 | |
f35a733d NS |
739 | void |
740 | name_lookup::add_fns (tree fns) | |
741 | { | |
742 | if (!fns) | |
743 | return; | |
744 | else if (TREE_CODE (fns) == OVERLOAD) | |
5e0c54e5 | 745 | { |
f35a733d NS |
746 | if (TREE_TYPE (fns) != unknown_type_node) |
747 | fns = OVL_FUNCTION (fns); | |
b655c310 | 748 | } |
f35a733d NS |
749 | else if (!DECL_DECLARES_FUNCTION_P (fns)) |
750 | return; | |
daafa301 | 751 | |
3d7ff728 | 752 | add_overload (fns); |
5e0c54e5 GDR |
753 | } |
754 | ||
f35a733d | 755 | /* Add functions of a namespace to the lookup structure. */ |
daafa301 | 756 | |
f35a733d NS |
757 | void |
758 | name_lookup::adl_namespace_only (tree scope) | |
5e0c54e5 | 759 | { |
f35a733d | 760 | mark_seen (scope); |
5e0c54e5 | 761 | |
f35a733d | 762 | /* Look down into inline namespaces. */ |
3c9feefc NS |
763 | if (vec<tree, va_gc> *inlinees = DECL_NAMESPACE_INLINEES (scope)) |
764 | for (unsigned ix = inlinees->length (); ix--;) | |
765 | adl_namespace_only ((*inlinees)[ix]); | |
b655c310 | 766 | |
3c9cca88 NS |
767 | if (tree fns = find_namespace_value (scope, name)) |
768 | add_fns (ovl_skip_hidden (fns)); | |
f35a733d | 769 | } |
0cbd7506 | 770 | |
f35a733d NS |
771 | /* Find the containing non-inlined namespace, add it and all its |
772 | inlinees. */ | |
b655c310 | 773 | |
f35a733d NS |
774 | void |
775 | name_lookup::adl_namespace (tree scope) | |
776 | { | |
777 | if (seen_p (scope)) | |
778 | return; | |
779 | ||
780 | /* Find the containing non-inline namespace. */ | |
781 | while (DECL_NAMESPACE_INLINE_P (scope)) | |
782 | scope = CP_DECL_CONTEXT (scope); | |
783 | ||
784 | adl_namespace_only (scope); | |
5e0c54e5 GDR |
785 | } |
786 | ||
f35a733d | 787 | /* Adds the class and its friends to the lookup structure. */ |
daafa301 | 788 | |
f35a733d NS |
789 | void |
790 | name_lookup::adl_class_only (tree type) | |
5e0c54e5 | 791 | { |
b655c310 NS |
792 | /* Backend-built structures, such as __builtin_va_list, aren't |
793 | affected by all this. */ | |
794 | if (!CLASS_TYPE_P (type)) | |
f35a733d NS |
795 | return; |
796 | ||
797 | type = TYPE_MAIN_VARIANT (type); | |
5e0c54e5 | 798 | |
f35a733d NS |
799 | if (see_and_mark (type)) |
800 | return; | |
801 | ||
802 | tree context = decl_namespace_context (type); | |
803 | adl_namespace (context); | |
5e0c54e5 | 804 | |
b655c310 | 805 | complete_type (type); |
daafa301 | 806 | |
f35a733d NS |
807 | /* Add friends. */ |
808 | for (tree list = DECL_FRIENDLIST (TYPE_MAIN_DECL (type)); list; | |
b655c310 | 809 | list = TREE_CHAIN (list)) |
f35a733d NS |
810 | if (name == FRIEND_NAME (list)) |
811 | for (tree friends = FRIEND_DECLS (list); friends; | |
b655c310 NS |
812 | friends = TREE_CHAIN (friends)) |
813 | { | |
814 | tree fn = TREE_VALUE (friends); | |
5e0c54e5 | 815 | |
b655c310 NS |
816 | /* Only interested in global functions with potentially hidden |
817 | (i.e. unqualified) declarations. */ | |
818 | if (CP_DECL_CONTEXT (fn) != context) | |
819 | continue; | |
f35a733d | 820 | |
25d446fd NS |
821 | /* Only interested in anticipated friends. (Non-anticipated |
822 | ones will have been inserted during the namespace | |
823 | adl.) */ | |
824 | if (!DECL_ANTICIPATED (fn)) | |
825 | continue; | |
826 | ||
b655c310 NS |
827 | /* Template specializations are never found by name lookup. |
828 | (Templates themselves can be found, but not template | |
829 | specializations.) */ | |
830 | if (TREE_CODE (fn) == FUNCTION_DECL && DECL_USE_TEMPLATE (fn)) | |
831 | continue; | |
5e0c54e5 | 832 | |
f35a733d NS |
833 | add_fns (fn); |
834 | } | |
5e0c54e5 GDR |
835 | } |
836 | ||
b655c310 NS |
837 | /* Adds the class and its bases to the lookup structure. |
838 | Returns true on error. */ | |
daafa301 | 839 | |
f35a733d NS |
840 | void |
841 | name_lookup::adl_bases (tree type) | |
5e0c54e5 | 842 | { |
f35a733d | 843 | adl_class_only (type); |
82f2836c | 844 | |
f35a733d NS |
845 | /* Process baseclasses. */ |
846 | if (tree binfo = TYPE_BINFO (type)) | |
5e0c54e5 | 847 | { |
f35a733d | 848 | tree base_binfo; |
b655c310 | 849 | int i; |
aed81407 | 850 | |
f35a733d NS |
851 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) |
852 | adl_bases (BINFO_TYPE (base_binfo)); | |
b655c310 | 853 | } |
89b578be MM |
854 | } |
855 | ||
b655c310 NS |
856 | /* Adds everything associated with a class argument type to the lookup |
857 | structure. Returns true on error. | |
daafa301 | 858 | |
b655c310 NS |
859 | If T is a class type (including unions), its associated classes are: the |
860 | class itself; the class of which it is a member, if any; and its direct | |
861 | and indirect base classes. Its associated namespaces are the namespaces | |
862 | of which its associated classes are members. Furthermore, if T is a | |
863 | class template specialization, its associated namespaces and classes | |
864 | also include: the namespaces and classes associated with the types of | |
865 | the template arguments provided for template type parameters (excluding | |
866 | template template parameters); the namespaces of which any template | |
867 | template arguments are members; and the classes of which any member | |
868 | templates used as template template arguments are members. [ Note: | |
869 | non-type template arguments do not contribute to the set of associated | |
870 | namespaces. --end note] */ | |
871 | ||
f35a733d NS |
872 | void |
873 | name_lookup::adl_class (tree type) | |
aed81407 | 874 | { |
b655c310 NS |
875 | /* Backend build structures, such as __builtin_va_list, aren't |
876 | affected by all this. */ | |
877 | if (!CLASS_TYPE_P (type)) | |
f35a733d | 878 | return; |
aed81407 | 879 | |
f35a733d NS |
880 | type = TYPE_MAIN_VARIANT (type); |
881 | /* We don't set found here because we have to have set seen first, | |
882 | which is done in the adl_bases walk. */ | |
883 | if (found_p (type)) | |
884 | return; | |
aed81407 | 885 | |
f35a733d NS |
886 | adl_bases (type); |
887 | mark_found (type); | |
daafa301 | 888 | |
f35a733d NS |
889 | if (TYPE_CLASS_SCOPE_P (type)) |
890 | adl_class_only (TYPE_CONTEXT (type)); | |
c87ceb13 | 891 | |
b655c310 NS |
892 | /* Process template arguments. */ |
893 | if (CLASSTYPE_TEMPLATE_INFO (type) | |
894 | && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type))) | |
895 | { | |
f35a733d NS |
896 | tree list = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type)); |
897 | for (int i = 0; i < TREE_VEC_LENGTH (list); ++i) | |
898 | adl_template_arg (TREE_VEC_ELT (list, i)); | |
b655c310 | 899 | } |
90ea9897 MM |
900 | } |
901 | ||
f35a733d NS |
902 | void |
903 | name_lookup::adl_expr (tree expr) | |
904 | { | |
905 | if (!expr) | |
906 | return; | |
90ea9897 | 907 | |
f35a733d NS |
908 | gcc_assert (!TYPE_P (expr)); |
909 | ||
910 | if (TREE_TYPE (expr) != unknown_type_node) | |
911 | { | |
912 | adl_type (TREE_TYPE (expr)); | |
913 | return; | |
914 | } | |
915 | ||
916 | if (TREE_CODE (expr) == ADDR_EXPR) | |
917 | expr = TREE_OPERAND (expr, 0); | |
918 | if (TREE_CODE (expr) == COMPONENT_REF | |
919 | || TREE_CODE (expr) == OFFSET_REF) | |
920 | expr = TREE_OPERAND (expr, 1); | |
921 | expr = MAYBE_BASELINK_FUNCTIONS (expr); | |
922 | ||
923 | if (OVL_P (expr)) | |
924 | for (lkp_iterator iter (expr); iter; ++iter) | |
925 | adl_type (TREE_TYPE (*iter)); | |
926 | else if (TREE_CODE (expr) == TEMPLATE_ID_EXPR) | |
927 | { | |
928 | /* The working paper doesn't currently say how to handle | |
929 | template-id arguments. The sensible thing would seem to be | |
930 | to handle the list of template candidates like a normal | |
931 | overload set, and handle the template arguments like we do | |
932 | for class template specializations. */ | |
933 | ||
934 | /* First the templates. */ | |
935 | adl_expr (TREE_OPERAND (expr, 0)); | |
936 | ||
937 | /* Now the arguments. */ | |
938 | if (tree args = TREE_OPERAND (expr, 1)) | |
939 | for (int ix = TREE_VEC_LENGTH (args); ix--;) | |
940 | adl_template_arg (TREE_VEC_ELT (args, ix)); | |
941 | } | |
942 | } | |
943 | ||
944 | void | |
945 | name_lookup::adl_type (tree type) | |
90ea9897 | 946 | { |
b655c310 | 947 | if (!type) |
f35a733d | 948 | return; |
7de5bccc | 949 | |
b655c310 | 950 | if (TYPE_PTRDATAMEM_P (type)) |
90ea9897 | 951 | { |
b655c310 | 952 | /* Pointer to member: associate class type and value type. */ |
f35a733d NS |
953 | adl_type (TYPE_PTRMEM_CLASS_TYPE (type)); |
954 | adl_type (TYPE_PTRMEM_POINTED_TO_TYPE (type)); | |
955 | return; | |
89b578be | 956 | } |
f35a733d NS |
957 | |
958 | switch (TREE_CODE (type)) | |
b655c310 | 959 | { |
b655c310 NS |
960 | case RECORD_TYPE: |
961 | if (TYPE_PTRMEMFUNC_P (type)) | |
f35a733d NS |
962 | { |
963 | adl_type (TYPE_PTRMEMFUNC_FN_TYPE (type)); | |
964 | return; | |
965 | } | |
b655c310 NS |
966 | /* FALLTHRU */ |
967 | case UNION_TYPE: | |
f35a733d NS |
968 | adl_class (type); |
969 | return; | |
970 | ||
b655c310 NS |
971 | case METHOD_TYPE: |
972 | /* The basetype is referenced in the first arg type, so just | |
973 | fall through. */ | |
974 | case FUNCTION_TYPE: | |
975 | /* Associate the parameter types. */ | |
f35a733d NS |
976 | for (tree args = TYPE_ARG_TYPES (type); args; args = TREE_CHAIN (args)) |
977 | adl_type (TREE_VALUE (args)); | |
978 | /* FALLTHROUGH */ | |
979 | ||
980 | case POINTER_TYPE: | |
981 | case REFERENCE_TYPE: | |
982 | case ARRAY_TYPE: | |
983 | adl_type (TREE_TYPE (type)); | |
984 | return; | |
985 | ||
986 | case ENUMERAL_TYPE: | |
987 | if (TYPE_CLASS_SCOPE_P (type)) | |
988 | adl_class_only (TYPE_CONTEXT (type)); | |
989 | adl_namespace (decl_namespace_context (type)); | |
990 | return; | |
991 | ||
b655c310 NS |
992 | case LANG_TYPE: |
993 | gcc_assert (type == unknown_type_node | |
994 | || type == init_list_type_node); | |
f35a733d NS |
995 | return; |
996 | ||
b655c310 | 997 | case TYPE_PACK_EXPANSION: |
f35a733d NS |
998 | adl_type (PACK_EXPANSION_PATTERN (type)); |
999 | return; | |
c8094d83 | 1000 | |
b655c310 | 1001 | default: |
f35a733d | 1002 | break; |
b655c310 | 1003 | } |
00e8de68 GDR |
1004 | } |
1005 | ||
f35a733d NS |
1006 | /* Adds everything associated with a template argument to the lookup |
1007 | structure. */ | |
00e8de68 | 1008 | |
f35a733d NS |
1009 | void |
1010 | name_lookup::adl_template_arg (tree arg) | |
00e8de68 | 1011 | { |
f35a733d | 1012 | /* [basic.lookup.koenig] |
00e8de68 | 1013 | |
f35a733d NS |
1014 | If T is a template-id, its associated namespaces and classes are |
1015 | ... the namespaces and classes associated with the types of the | |
1016 | template arguments provided for template type parameters | |
1017 | (excluding template template parameters); the namespaces in which | |
1018 | any template template arguments are defined; and the classes in | |
1019 | which any member templates used as template template arguments | |
1020 | are defined. [Note: non-type template arguments do not | |
1021 | contribute to the set of associated namespaces. ] */ | |
00e8de68 | 1022 | |
f35a733d NS |
1023 | /* Consider first template template arguments. */ |
1024 | if (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM | |
1025 | || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE) | |
1026 | ; | |
1027 | else if (TREE_CODE (arg) == TEMPLATE_DECL) | |
00e8de68 | 1028 | { |
f35a733d | 1029 | tree ctx = CP_DECL_CONTEXT (arg); |
b655c310 | 1030 | |
f35a733d NS |
1031 | /* It's not a member template. */ |
1032 | if (TREE_CODE (ctx) == NAMESPACE_DECL) | |
1033 | adl_namespace (ctx); | |
1034 | /* Otherwise, it must be member template. */ | |
1035 | else | |
1036 | adl_class_only (ctx); | |
00e8de68 | 1037 | } |
f35a733d NS |
1038 | /* It's an argument pack; handle it recursively. */ |
1039 | else if (ARGUMENT_PACK_P (arg)) | |
b655c310 | 1040 | { |
f35a733d NS |
1041 | tree args = ARGUMENT_PACK_ARGS (arg); |
1042 | int i, len = TREE_VEC_LENGTH (args); | |
1043 | for (i = 0; i < len; ++i) | |
1044 | adl_template_arg (TREE_VEC_ELT (args, i)); | |
b655c310 | 1045 | } |
f35a733d NS |
1046 | /* It's not a template template argument, but it is a type template |
1047 | argument. */ | |
1048 | else if (TYPE_P (arg)) | |
1049 | adl_type (arg); | |
00e8de68 GDR |
1050 | } |
1051 | ||
f35a733d NS |
1052 | /* Perform ADL lookup. FNS is the existing lookup result and ARGS are |
1053 | the call arguments. */ | |
9485d254 | 1054 | |
f35a733d NS |
1055 | tree |
1056 | name_lookup::search_adl (tree fns, vec<tree, va_gc> *args) | |
9485d254 | 1057 | { |
3d7ff728 NS |
1058 | if (fns) |
1059 | { | |
1060 | deduping = true; | |
1061 | lookup_mark (fns, true); | |
1062 | } | |
f35a733d | 1063 | value = fns; |
7f82286e | 1064 | |
f35a733d NS |
1065 | unsigned ix; |
1066 | tree arg; | |
1067 | ||
1068 | FOR_EACH_VEC_ELT_REVERSE (*args, ix, arg) | |
b67b23f0 NS |
1069 | /* OMP reduction operators put an ADL-significant type as the |
1070 | first arg. */ | |
1071 | if (TYPE_P (arg)) | |
1072 | adl_type (arg); | |
1073 | else | |
f35a733d NS |
1074 | adl_expr (arg); |
1075 | ||
f35a733d | 1076 | fns = value; |
c87ceb13 | 1077 | |
b655c310 NS |
1078 | return fns; |
1079 | } | |
c87ceb13 | 1080 | |
9dda0ace NS |
1081 | static bool qualified_namespace_lookup (tree, name_lookup *); |
1082 | static void consider_binding_level (tree name, | |
1083 | best_match <tree, const char *> &bm, | |
1084 | cp_binding_level *lvl, | |
1085 | bool look_within_fields, | |
1086 | enum lookup_name_fuzzy_kind kind); | |
9dda0ace NS |
1087 | static void diagnose_name_conflict (tree, tree); |
1088 | ||
f35a733d NS |
1089 | /* ADL lookup of NAME. FNS is the result of regular lookup, and we |
1090 | don't add duplicates to it. ARGS is the vector of call | |
1091 | arguments (which will not be empty). */ | |
c87ceb13 | 1092 | |
f35a733d | 1093 | tree |
b655c310 | 1094 | lookup_arg_dependent (tree name, tree fns, vec<tree, va_gc> *args) |
c87ceb13 | 1095 | { |
f35a733d NS |
1096 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); |
1097 | name_lookup lookup (name); | |
1098 | fns = lookup.search_adl (fns, args); | |
b655c310 | 1099 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); |
f35a733d NS |
1100 | return fns; |
1101 | } | |
1102 | ||
bff8b385 NS |
1103 | /* FNS is an overload set of conversion functions. Return the |
1104 | overloads converting to TYPE. */ | |
9e931c2a NS |
1105 | |
1106 | static tree | |
bff8b385 | 1107 | extract_conversion_operator (tree fns, tree type) |
9e931c2a | 1108 | { |
2e12a855 | 1109 | tree convs = NULL_TREE; |
bff8b385 | 1110 | tree tpls = NULL_TREE; |
9e931c2a | 1111 | |
bff8b385 | 1112 | for (ovl_iterator iter (fns); iter; ++iter) |
9e931c2a | 1113 | { |
bff8b385 NS |
1114 | if (same_type_p (DECL_CONV_FN_TYPE (*iter), type)) |
1115 | convs = lookup_add (*iter, convs); | |
2e12a855 | 1116 | |
bff8b385 NS |
1117 | if (TREE_CODE (*iter) == TEMPLATE_DECL) |
1118 | tpls = lookup_add (*iter, tpls); | |
9e931c2a NS |
1119 | } |
1120 | ||
bff8b385 NS |
1121 | if (!convs) |
1122 | convs = tpls; | |
1123 | ||
2e12a855 | 1124 | return convs; |
9e931c2a NS |
1125 | } |
1126 | ||
783dc739 | 1127 | /* Binary search of (ordered) MEMBER_VEC for NAME. */ |
9e931c2a | 1128 | |
b991151b | 1129 | static tree |
783dc739 | 1130 | member_vec_binary_search (vec<tree, va_gc> *member_vec, tree name) |
9e931c2a | 1131 | { |
783dc739 | 1132 | for (unsigned lo = 0, hi = member_vec->length (); lo < hi;) |
9e931c2a | 1133 | { |
b991151b | 1134 | unsigned mid = (lo + hi) / 2; |
783dc739 | 1135 | tree binding = (*member_vec)[mid]; |
b991151b NS |
1136 | tree binding_name = OVL_NAME (binding); |
1137 | ||
1138 | if (binding_name > name) | |
1139 | hi = mid; | |
1140 | else if (binding_name < name) | |
1141 | lo = mid + 1; | |
1142 | else | |
1143 | return binding; | |
9e931c2a | 1144 | } |
9e931c2a | 1145 | |
b991151b NS |
1146 | return NULL_TREE; |
1147 | } | |
bff8b385 | 1148 | |
783dc739 | 1149 | /* Linear search of (unordered) MEMBER_VEC for NAME. */ |
b991151b NS |
1150 | |
1151 | static tree | |
783dc739 | 1152 | member_vec_linear_search (vec<tree, va_gc> *member_vec, tree name) |
b991151b | 1153 | { |
783dc739 | 1154 | for (int ix = member_vec->length (); ix--;) |
783dc739 | 1155 | if (tree binding = (*member_vec)[ix]) |
10b5c982 NS |
1156 | if (OVL_NAME (binding) == name) |
1157 | return binding; | |
b991151b NS |
1158 | |
1159 | return NULL_TREE; | |
9e931c2a NS |
1160 | } |
1161 | ||
45e3a33d | 1162 | /* Linear search of (partially ordered) fields of KLASS for NAME. */ |
9e931c2a | 1163 | |
b991151b | 1164 | static tree |
45e3a33d | 1165 | fields_linear_search (tree klass, tree name, bool want_type) |
9e931c2a | 1166 | { |
45e3a33d | 1167 | for (tree fields = TYPE_FIELDS (klass); fields; fields = DECL_CHAIN (fields)) |
9e931c2a | 1168 | { |
45e3a33d | 1169 | tree decl = fields; |
9e931c2a | 1170 | |
35129fd3 | 1171 | if (TREE_CODE (decl) == FIELD_DECL |
45e3a33d | 1172 | && ANON_AGGR_TYPE_P (TREE_TYPE (decl))) |
9e931c2a | 1173 | { |
35129fd3 | 1174 | if (tree temp = search_anon_aggr (TREE_TYPE (decl), name, want_type)) |
d68ddd2b | 1175 | return temp; |
9e931c2a | 1176 | } |
9e931c2a | 1177 | |
45e3a33d | 1178 | if (DECL_NAME (decl) != name) |
9e931c2a | 1179 | continue; |
45e3a33d NS |
1180 | |
1181 | if (TREE_CODE (decl) == USING_DECL) | |
9e931c2a NS |
1182 | { |
1183 | decl = strip_using_decl (decl); | |
1184 | if (is_overloaded_fn (decl)) | |
1185 | continue; | |
1186 | } | |
1187 | ||
45e3a33d NS |
1188 | if (DECL_DECLARES_FUNCTION_P (decl)) |
1189 | /* Functions are found separately. */ | |
1190 | continue; | |
1191 | ||
1192 | if (!want_type || DECL_DECLARES_TYPE_P (decl)) | |
9e931c2a NS |
1193 | return decl; |
1194 | } | |
1195 | ||
9e931c2a NS |
1196 | return NULL_TREE; |
1197 | } | |
1198 | ||
35129fd3 NS |
1199 | /* Look for NAME member inside of anonymous aggregate ANON. Although |
1200 | such things should only contain FIELD_DECLs, we check that too | |
1201 | late, and would give very confusing errors if we weren't | |
1202 | permissive here. */ | |
d68ddd2b JJ |
1203 | |
1204 | tree | |
35129fd3 | 1205 | search_anon_aggr (tree anon, tree name, bool want_type) |
d68ddd2b JJ |
1206 | { |
1207 | gcc_assert (COMPLETE_TYPE_P (anon)); | |
35129fd3 NS |
1208 | tree ret = get_class_binding_direct (anon, name, want_type); |
1209 | return ret; | |
d68ddd2b JJ |
1210 | } |
1211 | ||
b991151b NS |
1212 | /* Look for NAME as an immediate member of KLASS (including |
1213 | anon-members or unscoped enum member). TYPE_OR_FNS is zero for | |
1214 | regular search. >0 to get a type binding (if there is one) and <0 | |
1215 | if you want (just) the member function binding. | |
1216 | ||
1217 | Use this if you do not want lazy member creation. */ | |
1218 | ||
1219 | tree | |
9a54a0d9 | 1220 | get_class_binding_direct (tree klass, tree name, bool want_type) |
b991151b NS |
1221 | { |
1222 | gcc_checking_assert (RECORD_OR_UNION_TYPE_P (klass)); | |
1223 | ||
1224 | /* Conversion operators can only be found by the marker conversion | |
1225 | operator name. */ | |
1226 | bool conv_op = IDENTIFIER_CONV_OP_P (name); | |
1227 | tree lookup = conv_op ? conv_op_identifier : name; | |
1228 | tree val = NULL_TREE; | |
783dc739 | 1229 | vec<tree, va_gc> *member_vec = CLASSTYPE_MEMBER_VEC (klass); |
b991151b | 1230 | |
783dc739 | 1231 | if (COMPLETE_TYPE_P (klass) && member_vec) |
b991151b | 1232 | { |
783dc739 | 1233 | val = member_vec_binary_search (member_vec, lookup); |
45e3a33d NS |
1234 | if (!val) |
1235 | ; | |
45e3a33d | 1236 | else if (STAT_HACK_P (val)) |
9a54a0d9 NS |
1237 | val = want_type ? STAT_TYPE (val) : STAT_DECL (val); |
1238 | else if (want_type && !DECL_DECLARES_TYPE_P (val)) | |
1239 | val = NULL_TREE; | |
b991151b | 1240 | } |
45e3a33d NS |
1241 | else |
1242 | { | |
9a54a0d9 | 1243 | if (member_vec && !want_type) |
783dc739 | 1244 | val = member_vec_linear_search (member_vec, lookup); |
b991151b | 1245 | |
9a54a0d9 | 1246 | if (!val || (TREE_CODE (val) == OVERLOAD && OVL_DEDUP_P (val))) |
45e3a33d NS |
1247 | /* Dependent using declarations are a 'field', make sure we |
1248 | return that even if we saw an overload already. */ | |
9a54a0d9 NS |
1249 | if (tree field_val = fields_linear_search (klass, lookup, want_type)) |
1250 | { | |
1251 | if (!val) | |
1252 | val = field_val; | |
1253 | else if (TREE_CODE (field_val) == USING_DECL) | |
1254 | val = ovl_make (field_val, val); | |
1255 | } | |
45e3a33d | 1256 | } |
b991151b NS |
1257 | |
1258 | /* Extract the conversion operators asked for, unless the general | |
1259 | conversion operator was requested. */ | |
1260 | if (val && conv_op) | |
1261 | { | |
1262 | gcc_checking_assert (OVL_FUNCTION (val) == conv_op_marker); | |
1263 | val = OVL_CHAIN (val); | |
1264 | if (tree type = TREE_TYPE (name)) | |
1265 | val = extract_conversion_operator (val, type); | |
1266 | } | |
1267 | ||
1268 | return val; | |
1269 | } | |
1270 | ||
1271 | /* Look for NAME's binding in exactly KLASS. See | |
1272 | get_class_binding_direct for argument description. Does lazy | |
1273 | special function creation as necessary. */ | |
9e931c2a NS |
1274 | |
1275 | tree | |
9a54a0d9 | 1276 | get_class_binding (tree klass, tree name, bool want_type) |
9e931c2a | 1277 | { |
20614c86 | 1278 | klass = complete_type (klass); |
9e931c2a | 1279 | |
20614c86 | 1280 | if (COMPLETE_TYPE_P (klass)) |
9e931c2a | 1281 | { |
20614c86 | 1282 | /* Lazily declare functions, if we're going to search these. */ |
9e931c2a NS |
1283 | if (IDENTIFIER_CTOR_P (name)) |
1284 | { | |
20614c86 NS |
1285 | if (CLASSTYPE_LAZY_DEFAULT_CTOR (klass)) |
1286 | lazily_declare_fn (sfk_constructor, klass); | |
1287 | if (CLASSTYPE_LAZY_COPY_CTOR (klass)) | |
1288 | lazily_declare_fn (sfk_copy_constructor, klass); | |
1289 | if (CLASSTYPE_LAZY_MOVE_CTOR (klass)) | |
1290 | lazily_declare_fn (sfk_move_constructor, klass); | |
9e931c2a | 1291 | } |
20614c86 | 1292 | else if (IDENTIFIER_DTOR_P (name)) |
9e931c2a | 1293 | { |
20614c86 NS |
1294 | if (CLASSTYPE_LAZY_DESTRUCTOR (klass)) |
1295 | lazily_declare_fn (sfk_destructor, klass); | |
9e931c2a | 1296 | } |
88a819be | 1297 | else if (name == assign_op_identifier) |
9e931c2a | 1298 | { |
20614c86 NS |
1299 | if (CLASSTYPE_LAZY_COPY_ASSIGN (klass)) |
1300 | lazily_declare_fn (sfk_copy_assignment, klass); | |
1301 | if (CLASSTYPE_LAZY_MOVE_ASSIGN (klass)) | |
1302 | lazily_declare_fn (sfk_move_assignment, klass); | |
9e931c2a NS |
1303 | } |
1304 | } | |
1305 | ||
9a54a0d9 | 1306 | return get_class_binding_direct (klass, name, want_type); |
9e931c2a NS |
1307 | } |
1308 | ||
fcaf3065 | 1309 | /* Find the slot containing overloads called 'NAME'. If there is no |
10b5c982 NS |
1310 | such slot and the class is complete, create an empty one, at the |
1311 | correct point in the sorted member vector. Otherwise return NULL. | |
1312 | Deals with conv_op marker handling. */ | |
fcaf3065 NS |
1313 | |
1314 | tree * | |
10b5c982 | 1315 | find_member_slot (tree klass, tree name) |
fcaf3065 NS |
1316 | { |
1317 | bool complete_p = COMPLETE_TYPE_P (klass); | |
10b5c982 | 1318 | |
783dc739 NS |
1319 | vec<tree, va_gc> *member_vec = CLASSTYPE_MEMBER_VEC (klass); |
1320 | if (!member_vec) | |
fcaf3065 | 1321 | { |
783dc739 NS |
1322 | vec_alloc (member_vec, 8); |
1323 | CLASSTYPE_MEMBER_VEC (klass) = member_vec; | |
45e3a33d NS |
1324 | if (complete_p) |
1325 | { | |
783dc739 | 1326 | /* If the class is complete but had no member_vec, we need |
45e3a33d NS |
1327 | to add the TYPE_FIELDS into it. We're also most likely |
1328 | to be adding ctors & dtors, so ask for 6 spare slots (the | |
1329 | abstract cdtors and their clones). */ | |
1330 | set_class_bindings (klass, 6); | |
783dc739 | 1331 | member_vec = CLASSTYPE_MEMBER_VEC (klass); |
45e3a33d | 1332 | } |
fcaf3065 NS |
1333 | } |
1334 | ||
1335 | if (IDENTIFIER_CONV_OP_P (name)) | |
1336 | name = conv_op_identifier; | |
1337 | ||
783dc739 | 1338 | unsigned ix, length = member_vec->length (); |
fcaf3065 NS |
1339 | for (ix = 0; ix < length; ix++) |
1340 | { | |
783dc739 | 1341 | tree *slot = &(*member_vec)[ix]; |
fcaf3065 NS |
1342 | tree fn_name = OVL_NAME (*slot); |
1343 | ||
1344 | if (fn_name == name) | |
1345 | { | |
45e3a33d NS |
1346 | /* If we found an existing slot, it must be a function set. |
1347 | Even with insertion after completion, because those only | |
1348 | happen with artificial fns that have unspellable names. | |
1349 | This means we do not have to deal with the stat hack | |
1350 | either. */ | |
1351 | gcc_checking_assert (OVL_P (*slot)); | |
fcaf3065 NS |
1352 | if (name == conv_op_identifier) |
1353 | { | |
1354 | gcc_checking_assert (OVL_FUNCTION (*slot) == conv_op_marker); | |
1355 | /* Skip the conv-op marker. */ | |
1356 | slot = &OVL_CHAIN (*slot); | |
1357 | } | |
1358 | return slot; | |
1359 | } | |
1360 | ||
1361 | if (complete_p && fn_name > name) | |
1362 | break; | |
1363 | } | |
1364 | ||
10b5c982 | 1365 | /* No slot found, add one if the class is complete. */ |
fcaf3065 NS |
1366 | if (complete_p) |
1367 | { | |
10b5c982 NS |
1368 | /* Do exact allocation, as we don't expect to add many. */ |
1369 | gcc_assert (name != conv_op_identifier); | |
783dc739 | 1370 | vec_safe_reserve_exact (member_vec, 1); |
10b5c982 | 1371 | CLASSTYPE_MEMBER_VEC (klass) = member_vec; |
783dc739 | 1372 | member_vec->quick_insert (ix, NULL_TREE); |
10b5c982 | 1373 | return &(*member_vec)[ix]; |
fcaf3065 | 1374 | } |
10b5c982 NS |
1375 | |
1376 | return NULL; | |
1377 | } | |
1378 | ||
1379 | /* KLASS is an incomplete class to which we're adding a method NAME. | |
1380 | Add a slot and deal with conv_op marker handling. */ | |
1381 | ||
1382 | tree * | |
1383 | add_member_slot (tree klass, tree name) | |
1384 | { | |
1385 | gcc_assert (!COMPLETE_TYPE_P (klass)); | |
1386 | ||
1387 | vec<tree, va_gc> *member_vec = CLASSTYPE_MEMBER_VEC (klass); | |
1388 | vec_safe_push (member_vec, NULL_TREE); | |
783dc739 | 1389 | CLASSTYPE_MEMBER_VEC (klass) = member_vec; |
fcaf3065 | 1390 | |
10b5c982 NS |
1391 | tree *slot = &member_vec->last (); |
1392 | if (IDENTIFIER_CONV_OP_P (name)) | |
fcaf3065 NS |
1393 | { |
1394 | /* Install the marker prefix. */ | |
1395 | *slot = ovl_make (conv_op_marker, NULL_TREE); | |
1396 | slot = &OVL_CHAIN (*slot); | |
1397 | } | |
1398 | ||
1399 | return slot; | |
1400 | } | |
1401 | ||
783dc739 NS |
1402 | /* Comparison function to compare two MEMBER_VEC entries by name. |
1403 | Because we can have duplicates during insertion of TYPE_FIELDS, we | |
1404 | do extra checking so deduping doesn't have to deal with so many | |
1405 | cases. */ | |
20614c86 NS |
1406 | |
1407 | static int | |
783dc739 | 1408 | member_name_cmp (const void *a_p, const void *b_p) |
20614c86 NS |
1409 | { |
1410 | tree a = *(const tree *)a_p; | |
1411 | tree b = *(const tree *)b_p; | |
1412 | tree name_a = DECL_NAME (TREE_CODE (a) == OVERLOAD ? OVL_FUNCTION (a) : a); | |
1413 | tree name_b = DECL_NAME (TREE_CODE (b) == OVERLOAD ? OVL_FUNCTION (b) : b); | |
1414 | ||
45e3a33d NS |
1415 | gcc_checking_assert (name_a && name_b); |
1416 | if (name_a != name_b) | |
1417 | return name_a < name_b ? -1 : +1; | |
1418 | ||
1419 | if (name_a == conv_op_identifier) | |
1420 | { | |
1421 | /* Strip the conv-op markers. */ | |
1422 | gcc_checking_assert (OVL_FUNCTION (a) == conv_op_marker | |
1423 | && OVL_FUNCTION (b) == conv_op_marker); | |
1424 | a = OVL_CHAIN (a); | |
1425 | b = OVL_CHAIN (b); | |
1426 | } | |
1427 | ||
1428 | if (TREE_CODE (a) == OVERLOAD) | |
1429 | a = OVL_FUNCTION (a); | |
1430 | if (TREE_CODE (b) == OVERLOAD) | |
1431 | b = OVL_FUNCTION (b); | |
1432 | ||
1433 | /* We're in STAT_HACK or USING_DECL territory (or possibly error-land). */ | |
12f71313 NS |
1434 | if (TREE_CODE (a) != TREE_CODE (b)) |
1435 | { | |
1436 | /* If one of them is a TYPE_DECL, it loses. */ | |
1437 | if (TREE_CODE (a) == TYPE_DECL) | |
1438 | return +1; | |
1439 | else if (TREE_CODE (b) == TYPE_DECL) | |
1440 | return -1; | |
1441 | ||
1442 | /* If one of them is a USING_DECL, it loses. */ | |
1443 | if (TREE_CODE (a) == USING_DECL) | |
1444 | return +1; | |
1445 | else if (TREE_CODE (b) == USING_DECL) | |
1446 | return -1; | |
1447 | ||
1448 | /* There are no other cases with different kinds of decls, as | |
1449 | duplicate detection should have kicked in earlier. However, | |
1450 | some erroneous cases get though. */ | |
1451 | gcc_assert (errorcount); | |
1452 | } | |
1453 | ||
1454 | /* Using source location would be the best thing here, but we can | |
1455 | get identically-located decls in the following circumstances: | |
1456 | ||
1457 | 1) duplicate artificial type-decls for the same type. | |
1458 | ||
1459 | 2) pack expansions of using-decls. | |
1460 | ||
1461 | We should not be doing #1, but in either case it doesn't matter | |
1462 | how we order these. Use UID as a proxy for source ordering, so | |
1463 | that identically-located decls still have a well-defined stable | |
1464 | ordering. */ | |
6c19e703 JJ |
1465 | if (DECL_UID (a) != DECL_UID (b)) |
1466 | return DECL_UID (a) < DECL_UID (b) ? -1 : +1; | |
1467 | gcc_assert (a == b); | |
1468 | return 0; | |
20614c86 NS |
1469 | } |
1470 | ||
fe920c2d NS |
1471 | static struct { |
1472 | gt_pointer_operator new_value; | |
1473 | void *cookie; | |
1474 | } resort_data; | |
1475 | ||
783dc739 | 1476 | /* This routine compares two fields like member_name_cmp but using the |
20614c86 NS |
1477 | pointer operator in resort_field_decl_data. We don't have to deal |
1478 | with duplicates here. */ | |
fe920c2d NS |
1479 | |
1480 | static int | |
783dc739 | 1481 | resort_member_name_cmp (const void *a_p, const void *b_p) |
fe920c2d | 1482 | { |
20614c86 NS |
1483 | tree a = *(const tree *)a_p; |
1484 | tree b = *(const tree *)b_p; | |
1485 | tree name_a = OVL_NAME (a); | |
1486 | tree name_b = OVL_NAME (b); | |
fe920c2d | 1487 | |
20614c86 NS |
1488 | resort_data.new_value (&name_a, resort_data.cookie); |
1489 | resort_data.new_value (&name_b, resort_data.cookie); | |
fe920c2d | 1490 | |
20614c86 | 1491 | gcc_checking_assert (name_a != name_b); |
fe920c2d | 1492 | |
20614c86 | 1493 | return name_a < name_b ? -1 : +1; |
fe920c2d NS |
1494 | } |
1495 | ||
783dc739 | 1496 | /* Resort CLASSTYPE_MEMBER_VEC because pointers have been reordered. */ |
fe920c2d NS |
1497 | |
1498 | void | |
783dc739 | 1499 | resort_type_member_vec (void *obj, void */*orig_obj*/, |
20614c86 | 1500 | gt_pointer_operator new_value, void* cookie) |
fe920c2d | 1501 | { |
783dc739 | 1502 | if (vec<tree, va_gc> *member_vec = (vec<tree, va_gc> *) obj) |
fe920c2d NS |
1503 | { |
1504 | resort_data.new_value = new_value; | |
1505 | resort_data.cookie = cookie; | |
774ae645 | 1506 | member_vec->qsort (resort_member_name_cmp); |
fe920c2d NS |
1507 | } |
1508 | } | |
1509 | ||
1887fb46 NS |
1510 | /* Recursively count the number of fields in KLASS, including anonymous |
1511 | union members. */ | |
41970ff1 | 1512 | |
1887fb46 NS |
1513 | static unsigned |
1514 | count_class_fields (tree klass) | |
41970ff1 | 1515 | { |
1887fb46 NS |
1516 | unsigned n_fields = 0; |
1517 | ||
1518 | for (tree fields = TYPE_FIELDS (klass); fields; fields = DECL_CHAIN (fields)) | |
1519 | if (DECL_DECLARES_FUNCTION_P (fields)) | |
1520 | /* Functions are dealt with separately. */; | |
1521 | else if (TREE_CODE (fields) == FIELD_DECL | |
1522 | && ANON_AGGR_TYPE_P (TREE_TYPE (fields))) | |
1523 | n_fields += count_class_fields (TREE_TYPE (fields)); | |
1524 | else if (DECL_NAME (fields)) | |
1525 | n_fields += 1; | |
1526 | ||
18a01e85 | 1527 | return n_fields; |
41970ff1 NS |
1528 | } |
1529 | ||
783dc739 NS |
1530 | /* Append all the nonfunction members fields of KLASS to MEMBER_VEC. |
1531 | Recurse for anonymous members. MEMBER_VEC must have space. */ | |
18a01e85 | 1532 | |
45e3a33d | 1533 | static void |
783dc739 | 1534 | member_vec_append_class_fields (vec<tree, va_gc> *member_vec, tree klass) |
18a01e85 | 1535 | { |
1887fb46 NS |
1536 | for (tree fields = TYPE_FIELDS (klass); fields; fields = DECL_CHAIN (fields)) |
1537 | if (DECL_DECLARES_FUNCTION_P (fields)) | |
1538 | /* Functions are handled separately. */; | |
1539 | else if (TREE_CODE (fields) == FIELD_DECL | |
1540 | && ANON_AGGR_TYPE_P (TREE_TYPE (fields))) | |
783dc739 | 1541 | member_vec_append_class_fields (member_vec, TREE_TYPE (fields)); |
1887fb46 | 1542 | else if (DECL_NAME (fields)) |
45e3a33d NS |
1543 | { |
1544 | tree field = fields; | |
1545 | /* Mark a conv-op USING_DECL with the conv-op-marker. */ | |
1546 | if (TREE_CODE (field) == USING_DECL | |
1547 | && IDENTIFIER_CONV_OP_P (DECL_NAME (field))) | |
1548 | field = ovl_make (conv_op_marker, field); | |
783dc739 | 1549 | member_vec->quick_push (field); |
45e3a33d | 1550 | } |
18a01e85 NS |
1551 | } |
1552 | ||
783dc739 NS |
1553 | /* Append all of the enum values of ENUMTYPE to MEMBER_VEC. |
1554 | MEMBER_VEC must have space. */ | |
18a01e85 | 1555 | |
45e3a33d | 1556 | static void |
783dc739 | 1557 | member_vec_append_enum_values (vec<tree, va_gc> *member_vec, tree enumtype) |
18a01e85 | 1558 | { |
1887fb46 NS |
1559 | for (tree values = TYPE_VALUES (enumtype); |
1560 | values; values = TREE_CHAIN (values)) | |
783dc739 | 1561 | member_vec->quick_push (TREE_VALUE (values)); |
45e3a33d NS |
1562 | } |
1563 | ||
783dc739 | 1564 | /* MEMBER_VEC has just had new DECLs added to it, but is sorted. |
45e3a33d NS |
1565 | DeDup adjacent DECLS of the same name. We already dealt with |
1566 | conflict resolution when adding the fields or methods themselves. | |
1567 | There are three cases (which could all be combined): | |
1568 | 1) a TYPE_DECL and non TYPE_DECL. Deploy STAT_HACK as appropriate. | |
1569 | 2) a USING_DECL and an overload. If the USING_DECL is dependent, | |
1570 | it wins. Otherwise the OVERLOAD does. | |
1571 | 3) two USING_DECLS. ... | |
1572 | ||
783dc739 | 1573 | member_name_cmp will have ordered duplicates as |
45e3a33d NS |
1574 | <fns><using><type> */ |
1575 | ||
1576 | static void | |
783dc739 | 1577 | member_vec_dedup (vec<tree, va_gc> *member_vec) |
45e3a33d | 1578 | { |
783dc739 | 1579 | unsigned len = member_vec->length (); |
45e3a33d NS |
1580 | unsigned store = 0; |
1581 | ||
774ae645 JJ |
1582 | if (!len) |
1583 | return; | |
1584 | ||
303f4850 NS |
1585 | tree name = OVL_NAME ((*member_vec)[0]); |
1586 | for (unsigned jx, ix = 0; ix < len; ix = jx) | |
45e3a33d | 1587 | { |
303f4850 | 1588 | tree current = NULL_TREE; |
45e3a33d NS |
1589 | tree to_type = NULL_TREE; |
1590 | tree to_using = NULL_TREE; | |
1591 | tree marker = NULL_TREE; | |
45e3a33d | 1592 | |
303f4850 | 1593 | for (jx = ix; jx < len; jx++) |
45e3a33d | 1594 | { |
303f4850 NS |
1595 | tree next = (*member_vec)[jx]; |
1596 | if (jx != ix) | |
45e3a33d | 1597 | { |
303f4850 NS |
1598 | tree next_name = OVL_NAME (next); |
1599 | if (next_name != name) | |
1600 | { | |
1601 | name = next_name; | |
1602 | break; | |
1603 | } | |
45e3a33d | 1604 | } |
45e3a33d | 1605 | |
303f4850 | 1606 | if (IDENTIFIER_CONV_OP_P (name)) |
45e3a33d | 1607 | { |
303f4850 | 1608 | marker = next; |
45e3a33d NS |
1609 | next = OVL_CHAIN (next); |
1610 | } | |
1611 | ||
1612 | if (TREE_CODE (next) == USING_DECL) | |
1613 | { | |
303f4850 NS |
1614 | if (IDENTIFIER_CTOR_P (name)) |
1615 | /* Dependent inherited ctor. */ | |
1616 | continue; | |
1617 | ||
45e3a33d | 1618 | next = strip_using_decl (next); |
303f4850 | 1619 | if (TREE_CODE (next) == USING_DECL) |
45e3a33d NS |
1620 | { |
1621 | to_using = next; | |
303f4850 | 1622 | continue; |
45e3a33d | 1623 | } |
303f4850 NS |
1624 | |
1625 | if (is_overloaded_fn (next)) | |
1626 | continue; | |
45e3a33d NS |
1627 | } |
1628 | ||
303f4850 NS |
1629 | if (DECL_DECLARES_TYPE_P (next)) |
1630 | { | |
1631 | to_type = next; | |
1632 | continue; | |
1633 | } | |
1634 | ||
1635 | if (!current) | |
1636 | current = next; | |
45e3a33d NS |
1637 | } |
1638 | ||
1639 | if (to_using) | |
1640 | { | |
1641 | if (!current) | |
1642 | current = to_using; | |
1643 | else | |
1644 | current = ovl_make (to_using, current); | |
1645 | } | |
1646 | ||
1647 | if (to_type) | |
1648 | { | |
1649 | if (!current) | |
1650 | current = to_type; | |
1651 | else | |
1652 | current = stat_hack (current, to_type); | |
1653 | } | |
1654 | ||
303f4850 | 1655 | if (current) |
45e3a33d | 1656 | { |
303f4850 NS |
1657 | if (marker) |
1658 | { | |
1659 | OVL_CHAIN (marker) = current; | |
1660 | current = marker; | |
1661 | } | |
1662 | (*member_vec)[store++] = current; | |
45e3a33d | 1663 | } |
45e3a33d NS |
1664 | } |
1665 | ||
1666 | while (store++ < len) | |
783dc739 | 1667 | member_vec->pop (); |
18a01e85 NS |
1668 | } |
1669 | ||
783dc739 NS |
1670 | /* Add the non-function members to CLASSTYPE_MEMBER_VEC. If there is |
1671 | no existing MEMBER_VEC and fewer than 8 fields, do nothing. We | |
45e3a33d NS |
1672 | know there must be at least 1 field -- the self-reference |
1673 | TYPE_DECL, except for anon aggregates, which will have at least | |
1674 | one field. */ | |
41970ff1 NS |
1675 | |
1676 | void | |
45e3a33d | 1677 | set_class_bindings (tree klass, unsigned extra) |
41970ff1 | 1678 | { |
45e3a33d | 1679 | unsigned n_fields = count_class_fields (klass); |
783dc739 | 1680 | vec<tree, va_gc> *member_vec = CLASSTYPE_MEMBER_VEC (klass); |
fe920c2d | 1681 | |
783dc739 | 1682 | if (member_vec || n_fields >= 8) |
18a01e85 | 1683 | { |
45e3a33d | 1684 | /* Append the new fields. */ |
783dc739 NS |
1685 | vec_safe_reserve_exact (member_vec, extra + n_fields); |
1686 | member_vec_append_class_fields (member_vec, klass); | |
45e3a33d NS |
1687 | } |
1688 | ||
783dc739 | 1689 | if (member_vec) |
45e3a33d | 1690 | { |
783dc739 | 1691 | CLASSTYPE_MEMBER_VEC (klass) = member_vec; |
774ae645 | 1692 | member_vec->qsort (member_name_cmp); |
783dc739 | 1693 | member_vec_dedup (member_vec); |
18a01e85 | 1694 | } |
41970ff1 NS |
1695 | } |
1696 | ||
18a01e85 | 1697 | /* Insert lately defined enum ENUMTYPE into KLASS for the sorted case. */ |
41970ff1 NS |
1698 | |
1699 | void | |
d876eb05 | 1700 | insert_late_enum_def_bindings (tree klass, tree enumtype) |
41970ff1 | 1701 | { |
45e3a33d | 1702 | int n_fields; |
783dc739 | 1703 | vec<tree, va_gc> *member_vec = CLASSTYPE_MEMBER_VEC (klass); |
1887fb46 | 1704 | |
45e3a33d | 1705 | /* The enum bindings will already be on the TYPE_FIELDS, so don't |
1887fb46 | 1706 | count them twice. */ |
783dc739 | 1707 | if (!member_vec) |
1887fb46 | 1708 | n_fields = count_class_fields (klass); |
45e3a33d NS |
1709 | else |
1710 | n_fields = list_length (TYPE_VALUES (enumtype)); | |
1887fb46 | 1711 | |
783dc739 | 1712 | if (member_vec || n_fields >= 8) |
18a01e85 | 1713 | { |
783dc739 NS |
1714 | vec_safe_reserve_exact (member_vec, n_fields); |
1715 | if (CLASSTYPE_MEMBER_VEC (klass)) | |
1716 | member_vec_append_enum_values (member_vec, enumtype); | |
1887fb46 | 1717 | else |
783dc739 NS |
1718 | member_vec_append_class_fields (member_vec, klass); |
1719 | CLASSTYPE_MEMBER_VEC (klass) = member_vec; | |
774ae645 | 1720 | member_vec->qsort (member_name_cmp); |
783dc739 | 1721 | member_vec_dedup (member_vec); |
18a01e85 | 1722 | } |
41970ff1 NS |
1723 | } |
1724 | ||
b655c310 NS |
1725 | /* Compute the chain index of a binding_entry given the HASH value of its |
1726 | name and the total COUNT of chains. COUNT is assumed to be a power | |
1727 | of 2. */ | |
9306cccb | 1728 | |
b655c310 | 1729 | #define ENTRY_INDEX(HASH, COUNT) (((HASH) >> 3) & ((COUNT) - 1)) |
c87ceb13 | 1730 | |
b655c310 | 1731 | /* A free list of "binding_entry"s awaiting for re-use. */ |
c87ceb13 | 1732 | |
b655c310 | 1733 | static GTY((deletable)) binding_entry free_binding_entry = NULL; |
c8094d83 | 1734 | |
b655c310 | 1735 | /* The binding oracle; see cp-tree.h. */ |
c87ceb13 | 1736 | |
b655c310 | 1737 | cp_binding_oracle_function *cp_binding_oracle; |
575bfb00 | 1738 | |
b655c310 NS |
1739 | /* If we have a binding oracle, ask it for all namespace-scoped |
1740 | definitions of NAME. */ | |
557831a9 | 1741 | |
b655c310 NS |
1742 | static inline void |
1743 | query_oracle (tree name) | |
557831a9 | 1744 | { |
b655c310 NS |
1745 | if (!cp_binding_oracle) |
1746 | return; | |
557831a9 | 1747 | |
b655c310 NS |
1748 | /* LOOKED_UP holds the set of identifiers that we have already |
1749 | looked up with the oracle. */ | |
1750 | static hash_set<tree> looked_up; | |
1751 | if (looked_up.add (name)) | |
1752 | return; | |
575bfb00 | 1753 | |
b655c310 | 1754 | cp_binding_oracle (CP_ORACLE_IDENTIFIER, name); |
c87ceb13 | 1755 | } |
00e8de68 | 1756 | |
b655c310 | 1757 | /* Create a binding_entry object for (NAME, TYPE). */ |
00e8de68 | 1758 | |
b655c310 NS |
1759 | static inline binding_entry |
1760 | binding_entry_make (tree name, tree type) | |
00e8de68 | 1761 | { |
b655c310 | 1762 | binding_entry entry; |
89bd2c03 | 1763 | |
b655c310 | 1764 | if (free_binding_entry) |
00e8de68 | 1765 | { |
b655c310 NS |
1766 | entry = free_binding_entry; |
1767 | free_binding_entry = entry->chain; | |
00e8de68 | 1768 | } |
c8094d83 | 1769 | else |
b655c310 | 1770 | entry = ggc_alloc<binding_entry_s> (); |
00e8de68 | 1771 | |
b655c310 NS |
1772 | entry->name = name; |
1773 | entry->type = type; | |
1774 | entry->chain = NULL; | |
a5e6b29b | 1775 | |
b655c310 NS |
1776 | return entry; |
1777 | } | |
a5e6b29b | 1778 | |
b655c310 NS |
1779 | /* Put ENTRY back on the free list. */ |
1780 | #if 0 | |
1781 | static inline void | |
1782 | binding_entry_free (binding_entry entry) | |
a5e6b29b | 1783 | { |
b655c310 NS |
1784 | entry->name = NULL; |
1785 | entry->type = NULL; | |
1786 | entry->chain = free_binding_entry; | |
1787 | free_binding_entry = entry; | |
1788 | } | |
1789 | #endif | |
a5e6b29b | 1790 | |
b655c310 NS |
1791 | /* The datatype used to implement the mapping from names to types at |
1792 | a given scope. */ | |
1793 | struct GTY(()) binding_table_s { | |
1794 | /* Array of chains of "binding_entry"s */ | |
1795 | binding_entry * GTY((length ("%h.chain_count"))) chain; | |
2a50edcd | 1796 | |
b655c310 NS |
1797 | /* The number of chains in this table. This is the length of the |
1798 | member "chain" considered as an array. */ | |
1799 | size_t chain_count; | |
a5e6b29b | 1800 | |
b655c310 NS |
1801 | /* Number of "binding_entry"s in this table. */ |
1802 | size_t entry_count; | |
1803 | }; | |
a5e6b29b | 1804 | |
b655c310 | 1805 | /* Construct TABLE with an initial CHAIN_COUNT. */ |
a5e6b29b | 1806 | |
b655c310 NS |
1807 | static inline void |
1808 | binding_table_construct (binding_table table, size_t chain_count) | |
1809 | { | |
1810 | table->chain_count = chain_count; | |
1811 | table->entry_count = 0; | |
1812 | table->chain = ggc_cleared_vec_alloc<binding_entry> (table->chain_count); | |
1813 | } | |
a5e6b29b | 1814 | |
b655c310 NS |
1815 | /* Make TABLE's entries ready for reuse. */ |
1816 | #if 0 | |
1817 | static void | |
1818 | binding_table_free (binding_table table) | |
1819 | { | |
1820 | size_t i; | |
1821 | size_t count; | |
a5e6b29b | 1822 | |
b655c310 NS |
1823 | if (table == NULL) |
1824 | return; | |
a5e6b29b | 1825 | |
b655c310 NS |
1826 | for (i = 0, count = table->chain_count; i < count; ++i) |
1827 | { | |
1828 | binding_entry temp = table->chain[i]; | |
1829 | while (temp != NULL) | |
a5e6b29b | 1830 | { |
b655c310 NS |
1831 | binding_entry entry = temp; |
1832 | temp = entry->chain; | |
1833 | binding_entry_free (entry); | |
a5e6b29b | 1834 | } |
b655c310 NS |
1835 | table->chain[i] = NULL; |
1836 | } | |
1837 | table->entry_count = 0; | |
1838 | } | |
1839 | #endif | |
a5e6b29b | 1840 | |
b655c310 | 1841 | /* Allocate a table with CHAIN_COUNT, assumed to be a power of two. */ |
a5e6b29b | 1842 | |
b655c310 NS |
1843 | static inline binding_table |
1844 | binding_table_new (size_t chain_count) | |
1845 | { | |
1846 | binding_table table = ggc_alloc<binding_table_s> (); | |
1847 | table->chain = NULL; | |
1848 | binding_table_construct (table, chain_count); | |
1849 | return table; | |
1850 | } | |
a5e6b29b | 1851 | |
b655c310 | 1852 | /* Expand TABLE to twice its current chain_count. */ |
a5e6b29b | 1853 | |
b655c310 NS |
1854 | static void |
1855 | binding_table_expand (binding_table table) | |
1856 | { | |
1857 | const size_t old_chain_count = table->chain_count; | |
1858 | const size_t old_entry_count = table->entry_count; | |
1859 | const size_t new_chain_count = 2 * old_chain_count; | |
1860 | binding_entry *old_chains = table->chain; | |
1861 | size_t i; | |
1862 | ||
1863 | binding_table_construct (table, new_chain_count); | |
1864 | for (i = 0; i < old_chain_count; ++i) | |
1865 | { | |
1866 | binding_entry entry = old_chains[i]; | |
1867 | for (; entry != NULL; entry = old_chains[i]) | |
a5e6b29b | 1868 | { |
b655c310 NS |
1869 | const unsigned int hash = IDENTIFIER_HASH_VALUE (entry->name); |
1870 | const size_t j = ENTRY_INDEX (hash, new_chain_count); | |
10827cd8 | 1871 | |
b655c310 NS |
1872 | old_chains[i] = entry->chain; |
1873 | entry->chain = table->chain[j]; | |
1874 | table->chain[j] = entry; | |
1875 | } | |
1876 | } | |
1877 | table->entry_count = old_entry_count; | |
1878 | } | |
10827cd8 | 1879 | |
b655c310 | 1880 | /* Insert a binding for NAME to TYPE into TABLE. */ |
10827cd8 | 1881 | |
b655c310 NS |
1882 | static void |
1883 | binding_table_insert (binding_table table, tree name, tree type) | |
1884 | { | |
1885 | const unsigned int hash = IDENTIFIER_HASH_VALUE (name); | |
1886 | const size_t i = ENTRY_INDEX (hash, table->chain_count); | |
1887 | binding_entry entry = binding_entry_make (name, type); | |
c8094d83 | 1888 | |
b655c310 NS |
1889 | entry->chain = table->chain[i]; |
1890 | table->chain[i] = entry; | |
1891 | ++table->entry_count; | |
b1a19c7c | 1892 | |
b655c310 NS |
1893 | if (3 * table->chain_count < 5 * table->entry_count) |
1894 | binding_table_expand (table); | |
1895 | } | |
a5e6b29b | 1896 | |
b655c310 | 1897 | /* Return the binding_entry, if any, that maps NAME. */ |
c8094d83 | 1898 | |
b655c310 NS |
1899 | binding_entry |
1900 | binding_table_find (binding_table table, tree name) | |
1901 | { | |
1902 | const unsigned int hash = IDENTIFIER_HASH_VALUE (name); | |
1903 | binding_entry entry = table->chain[ENTRY_INDEX (hash, table->chain_count)]; | |
c8094d83 | 1904 | |
b655c310 NS |
1905 | while (entry != NULL && entry->name != name) |
1906 | entry = entry->chain; | |
a5e6b29b | 1907 | |
b655c310 NS |
1908 | return entry; |
1909 | } | |
ecba6c56 | 1910 | |
b655c310 | 1911 | /* Apply PROC -- with DATA -- to all entries in TABLE. */ |
a5e6b29b | 1912 | |
b655c310 NS |
1913 | void |
1914 | binding_table_foreach (binding_table table, bt_foreach_proc proc, void *data) | |
1915 | { | |
1916 | size_t chain_count; | |
1917 | size_t i; | |
a5e6b29b | 1918 | |
b655c310 NS |
1919 | if (!table) |
1920 | return; | |
a5e6b29b | 1921 | |
b655c310 NS |
1922 | chain_count = table->chain_count; |
1923 | for (i = 0; i < chain_count; ++i) | |
1924 | { | |
1925 | binding_entry entry = table->chain[i]; | |
1926 | for (; entry != NULL; entry = entry->chain) | |
1927 | proc (entry, data); | |
1928 | } | |
1929 | } | |
1930 | \f | |
1931 | #ifndef ENABLE_SCOPE_CHECKING | |
1932 | # define ENABLE_SCOPE_CHECKING 0 | |
1933 | #else | |
1934 | # define ENABLE_SCOPE_CHECKING 1 | |
1935 | #endif | |
199b7a35 | 1936 | |
b655c310 | 1937 | /* A free list of "cxx_binding"s, connected by their PREVIOUS. */ |
f7cbd40e | 1938 | |
b655c310 | 1939 | static GTY((deletable)) cxx_binding *free_bindings; |
f7cbd40e | 1940 | |
b655c310 NS |
1941 | /* Initialize VALUE and TYPE field for BINDING, and set the PREVIOUS |
1942 | field to NULL. */ | |
d0940d56 | 1943 | |
b655c310 NS |
1944 | static inline void |
1945 | cxx_binding_init (cxx_binding *binding, tree value, tree type) | |
1946 | { | |
1947 | binding->value = value; | |
1948 | binding->type = type; | |
1949 | binding->previous = NULL; | |
1950 | } | |
a5e6b29b | 1951 | |
b655c310 | 1952 | /* (GC)-allocate a binding object with VALUE and TYPE member initialized. */ |
3797cb21 | 1953 | |
b655c310 NS |
1954 | static cxx_binding * |
1955 | cxx_binding_make (tree value, tree type) | |
1956 | { | |
1957 | cxx_binding *binding; | |
1958 | if (free_bindings) | |
1959 | { | |
1960 | binding = free_bindings; | |
1961 | free_bindings = binding->previous; | |
1962 | } | |
1963 | else | |
1964 | binding = ggc_alloc<cxx_binding> (); | |
a5e6b29b | 1965 | |
b655c310 | 1966 | cxx_binding_init (binding, value, type); |
a5e6b29b | 1967 | |
b655c310 NS |
1968 | return binding; |
1969 | } | |
a5e6b29b | 1970 | |
b655c310 | 1971 | /* Put BINDING back on the free list. */ |
a5e6b29b | 1972 | |
b655c310 NS |
1973 | static inline void |
1974 | cxx_binding_free (cxx_binding *binding) | |
1975 | { | |
1976 | binding->scope = NULL; | |
1977 | binding->previous = free_bindings; | |
1978 | free_bindings = binding; | |
1979 | } | |
a5e6b29b | 1980 | |
b655c310 NS |
1981 | /* Create a new binding for NAME (with the indicated VALUE and TYPE |
1982 | bindings) in the class scope indicated by SCOPE. */ | |
a5e6b29b | 1983 | |
b655c310 NS |
1984 | static cxx_binding * |
1985 | new_class_binding (tree name, tree value, tree type, cp_binding_level *scope) | |
1986 | { | |
1987 | cp_class_binding cb = {cxx_binding_make (value, type), name}; | |
1988 | cxx_binding *binding = cb.base; | |
1989 | vec_safe_push (scope->class_shadowed, cb); | |
1990 | binding->scope = scope; | |
1991 | return binding; | |
1992 | } | |
a5e6b29b | 1993 | |
b655c310 NS |
1994 | /* Make DECL the innermost binding for ID. The LEVEL is the binding |
1995 | level at which this declaration is being bound. */ | |
a5e6b29b | 1996 | |
b655c310 NS |
1997 | void |
1998 | push_binding (tree id, tree decl, cp_binding_level* level) | |
1999 | { | |
2000 | cxx_binding *binding; | |
a5e6b29b | 2001 | |
b655c310 NS |
2002 | if (level != class_binding_level) |
2003 | { | |
2004 | binding = cxx_binding_make (decl, NULL_TREE); | |
2005 | binding->scope = level; | |
2006 | } | |
2007 | else | |
2008 | binding = new_class_binding (id, decl, /*type=*/NULL_TREE, level); | |
a5e6b29b | 2009 | |
b655c310 NS |
2010 | /* Now, fill in the binding information. */ |
2011 | binding->previous = IDENTIFIER_BINDING (id); | |
2012 | INHERITED_VALUE_BINDING_P (binding) = 0; | |
2013 | LOCAL_BINDING_P (binding) = (level != class_binding_level); | |
a5e6b29b | 2014 | |
b655c310 NS |
2015 | /* And put it on the front of the list of bindings for ID. */ |
2016 | IDENTIFIER_BINDING (id) = binding; | |
575bfb00 LC |
2017 | } |
2018 | ||
b655c310 NS |
2019 | /* Remove the binding for DECL which should be the innermost binding |
2020 | for ID. */ | |
575bfb00 | 2021 | |
b655c310 | 2022 | void |
9c82d7b6 | 2023 | pop_local_binding (tree id, tree decl) |
575bfb00 | 2024 | { |
b655c310 | 2025 | cxx_binding *binding; |
d63d5d0c | 2026 | |
b655c310 NS |
2027 | if (id == NULL_TREE) |
2028 | /* It's easiest to write the loops that call this function without | |
2029 | checking whether or not the entities involved have names. We | |
2030 | get here for such an entity. */ | |
2031 | return; | |
d63d5d0c | 2032 | |
b655c310 NS |
2033 | /* Get the innermost binding for ID. */ |
2034 | binding = IDENTIFIER_BINDING (id); | |
a5e6b29b | 2035 | |
b655c310 NS |
2036 | /* The name should be bound. */ |
2037 | gcc_assert (binding != NULL); | |
a5e6b29b | 2038 | |
b655c310 NS |
2039 | /* The DECL will be either the ordinary binding or the type |
2040 | binding for this identifier. Remove that binding. */ | |
2041 | if (binding->value == decl) | |
2042 | binding->value = NULL_TREE; | |
a5e6b29b | 2043 | else |
b655c310 NS |
2044 | { |
2045 | gcc_assert (binding->type == decl); | |
2046 | binding->type = NULL_TREE; | |
2047 | } | |
00e8de68 | 2048 | |
b655c310 | 2049 | if (!binding->value && !binding->type) |
00e8de68 | 2050 | { |
b655c310 NS |
2051 | /* We're completely done with the innermost binding for this |
2052 | identifier. Unhook it from the list of bindings. */ | |
2053 | IDENTIFIER_BINDING (id) = binding->previous; | |
2054 | ||
2055 | /* Add it to the free list. */ | |
2056 | cxx_binding_free (binding); | |
00e8de68 | 2057 | } |
b655c310 | 2058 | } |
00e8de68 | 2059 | |
b655c310 NS |
2060 | /* Remove the bindings for the decls of the current level and leave |
2061 | the current scope. */ | |
00e8de68 | 2062 | |
b655c310 NS |
2063 | void |
2064 | pop_bindings_and_leave_scope (void) | |
2065 | { | |
9c82d7b6 | 2066 | for (tree t = get_local_decls (); t; t = DECL_CHAIN (t)) |
9d029ddf NS |
2067 | { |
2068 | tree decl = TREE_CODE (t) == TREE_LIST ? TREE_VALUE (t) : t; | |
2069 | tree name = OVL_NAME (decl); | |
2070 | ||
2071 | pop_local_binding (name, decl); | |
2072 | } | |
2073 | ||
b655c310 | 2074 | leave_scope (); |
00e8de68 | 2075 | } |
a5e6b29b | 2076 | |
b655c310 NS |
2077 | /* Strip non dependent using declarations. If DECL is dependent, |
2078 | surreptitiously create a typename_type and return it. */ | |
a5e6b29b GDR |
2079 | |
2080 | tree | |
b655c310 | 2081 | strip_using_decl (tree decl) |
a5e6b29b | 2082 | { |
b655c310 NS |
2083 | if (decl == NULL_TREE) |
2084 | return NULL_TREE; | |
a5e6b29b | 2085 | |
b655c310 NS |
2086 | while (TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl)) |
2087 | decl = USING_DECL_DECLS (decl); | |
a5e6b29b | 2088 | |
b655c310 NS |
2089 | if (TREE_CODE (decl) == USING_DECL && DECL_DEPENDENT_P (decl) |
2090 | && USING_DECL_TYPENAME_P (decl)) | |
a5e6b29b | 2091 | { |
b655c310 NS |
2092 | /* We have found a type introduced by a using |
2093 | declaration at class scope that refers to a dependent | |
2094 | type. | |
2095 | ||
2096 | using typename :: [opt] nested-name-specifier unqualified-id ; | |
2097 | */ | |
10839133 | 2098 | decl = make_typename_type (USING_DECL_SCOPE (decl), |
b655c310 NS |
2099 | DECL_NAME (decl), |
2100 | typename_type, tf_error); | |
2101 | if (decl != error_mark_node) | |
2102 | decl = TYPE_NAME (decl); | |
a5e6b29b GDR |
2103 | } |
2104 | ||
b655c310 NS |
2105 | return decl; |
2106 | } | |
a5e6b29b | 2107 | |
ef4c5e78 NS |
2108 | /* Return true if OVL is an overload for an anticipated builtin. */ |
2109 | ||
2110 | static bool | |
2111 | anticipated_builtin_p (tree ovl) | |
2112 | { | |
2113 | if (TREE_CODE (ovl) != OVERLOAD) | |
2114 | return false; | |
2115 | ||
2116 | if (!OVL_HIDDEN_P (ovl)) | |
2117 | return false; | |
2118 | ||
2119 | tree fn = OVL_FUNCTION (ovl); | |
2120 | gcc_checking_assert (DECL_ANTICIPATED (fn)); | |
2121 | ||
2122 | if (DECL_HIDDEN_FRIEND_P (fn)) | |
2123 | return false; | |
2124 | ||
2125 | return true; | |
2126 | } | |
2127 | ||
b655c310 NS |
2128 | /* BINDING records an existing declaration for a name in the current scope. |
2129 | But, DECL is another declaration for that same identifier in the | |
2130 | same scope. This is the `struct stat' hack whereby a non-typedef | |
2131 | class name or enum-name can be bound at the same level as some other | |
2132 | kind of entity. | |
2133 | 3.3.7/1 | |
ae5cbc33 | 2134 | |
b655c310 NS |
2135 | A class name (9.1) or enumeration name (7.2) can be hidden by the |
2136 | name of an object, function, or enumerator declared in the same scope. | |
2137 | If a class or enumeration name and an object, function, or enumerator | |
2138 | are declared in the same scope (in any order) with the same name, the | |
2139 | class or enumeration name is hidden wherever the object, function, or | |
2140 | enumerator name is visible. | |
ae5cbc33 | 2141 | |
b655c310 NS |
2142 | It's the responsibility of the caller to check that |
2143 | inserting this name is valid here. Returns nonzero if the new binding | |
2144 | was successful. */ | |
2145 | ||
2146 | static bool | |
2147 | supplement_binding_1 (cxx_binding *binding, tree decl) | |
2148 | { | |
2149 | tree bval = binding->value; | |
2150 | bool ok = true; | |
2151 | tree target_bval = strip_using_decl (bval); | |
2152 | tree target_decl = strip_using_decl (decl); | |
2153 | ||
2154 | if (TREE_CODE (target_decl) == TYPE_DECL && DECL_ARTIFICIAL (target_decl) | |
2155 | && target_decl != target_bval | |
2156 | && (TREE_CODE (target_bval) != TYPE_DECL | |
2157 | /* We allow pushing an enum multiple times in a class | |
2158 | template in order to handle late matching of underlying | |
2159 | type on an opaque-enum-declaration followed by an | |
2160 | enum-specifier. */ | |
2161 | || (processing_template_decl | |
2162 | && TREE_CODE (TREE_TYPE (target_decl)) == ENUMERAL_TYPE | |
2163 | && TREE_CODE (TREE_TYPE (target_bval)) == ENUMERAL_TYPE | |
2164 | && (dependent_type_p (ENUM_UNDERLYING_TYPE | |
2165 | (TREE_TYPE (target_decl))) | |
2166 | || dependent_type_p (ENUM_UNDERLYING_TYPE | |
2167 | (TREE_TYPE (target_bval))))))) | |
2168 | /* The new name is the type name. */ | |
2169 | binding->type = decl; | |
2170 | else if (/* TARGET_BVAL is null when push_class_level_binding moves | |
2171 | an inherited type-binding out of the way to make room | |
2172 | for a new value binding. */ | |
2173 | !target_bval | |
2174 | /* TARGET_BVAL is error_mark_node when TARGET_DECL's name | |
2175 | has been used in a non-class scope prior declaration. | |
2176 | In that case, we should have already issued a | |
2177 | diagnostic; for graceful error recovery purpose, pretend | |
2178 | this was the intended declaration for that name. */ | |
2179 | || target_bval == error_mark_node | |
2180 | /* If TARGET_BVAL is anticipated but has not yet been | |
2181 | declared, pretend it is not there at all. */ | |
ef4c5e78 | 2182 | || anticipated_builtin_p (target_bval)) |
b655c310 NS |
2183 | binding->value = decl; |
2184 | else if (TREE_CODE (target_bval) == TYPE_DECL | |
2185 | && DECL_ARTIFICIAL (target_bval) | |
2186 | && target_decl != target_bval | |
2187 | && (TREE_CODE (target_decl) != TYPE_DECL | |
2188 | || same_type_p (TREE_TYPE (target_decl), | |
2189 | TREE_TYPE (target_bval)))) | |
a5e6b29b | 2190 | { |
b655c310 NS |
2191 | /* The old binding was a type name. It was placed in |
2192 | VALUE field because it was thought, at the point it was | |
2193 | declared, to be the only entity with such a name. Move the | |
2194 | type name into the type slot; it is now hidden by the new | |
2195 | binding. */ | |
2196 | binding->type = bval; | |
2197 | binding->value = decl; | |
2198 | binding->value_is_inherited = false; | |
a5e6b29b | 2199 | } |
b655c310 NS |
2200 | else if (TREE_CODE (target_bval) == TYPE_DECL |
2201 | && TREE_CODE (target_decl) == TYPE_DECL | |
2202 | && DECL_NAME (target_decl) == DECL_NAME (target_bval) | |
2203 | && binding->scope->kind != sk_class | |
2204 | && (same_type_p (TREE_TYPE (target_decl), TREE_TYPE (target_bval)) | |
2205 | /* If either type involves template parameters, we must | |
2206 | wait until instantiation. */ | |
2207 | || uses_template_parms (TREE_TYPE (target_decl)) | |
2208 | || uses_template_parms (TREE_TYPE (target_bval)))) | |
2209 | /* We have two typedef-names, both naming the same type to have | |
2210 | the same name. In general, this is OK because of: | |
a5e6b29b | 2211 | |
b655c310 | 2212 | [dcl.typedef] |
00e8de68 | 2213 | |
b655c310 NS |
2214 | In a given scope, a typedef specifier can be used to redefine |
2215 | the name of any type declared in that scope to refer to the | |
2216 | type to which it already refers. | |
00e8de68 | 2217 | |
b655c310 NS |
2218 | However, in class scopes, this rule does not apply due to the |
2219 | stricter language in [class.mem] prohibiting redeclarations of | |
2220 | members. */ | |
2221 | ok = false; | |
2222 | /* There can be two block-scope declarations of the same variable, | |
2223 | so long as they are `extern' declarations. However, there cannot | |
2224 | be two declarations of the same static data member: | |
00e8de68 | 2225 | |
b655c310 | 2226 | [class.mem] |
00e8de68 | 2227 | |
b655c310 NS |
2228 | A member shall not be declared twice in the |
2229 | member-specification. */ | |
2230 | else if (VAR_P (target_decl) | |
2231 | && VAR_P (target_bval) | |
2232 | && DECL_EXTERNAL (target_decl) && DECL_EXTERNAL (target_bval) | |
2233 | && !DECL_CLASS_SCOPE_P (target_decl)) | |
2234 | { | |
2235 | duplicate_decls (decl, binding->value, /*newdecl_is_friend=*/false); | |
2236 | ok = false; | |
2237 | } | |
2238 | else if (TREE_CODE (decl) == NAMESPACE_DECL | |
2239 | && TREE_CODE (bval) == NAMESPACE_DECL | |
2240 | && DECL_NAMESPACE_ALIAS (decl) | |
2241 | && DECL_NAMESPACE_ALIAS (bval) | |
2242 | && ORIGINAL_NAMESPACE (bval) == ORIGINAL_NAMESPACE (decl)) | |
2243 | /* [namespace.alias] | |
00e8de68 | 2244 | |
b655c310 NS |
2245 | In a declarative region, a namespace-alias-definition can be |
2246 | used to redefine a namespace-alias declared in that declarative | |
2247 | region to refer only to the namespace to which it already | |
2248 | refers. */ | |
2249 | ok = false; | |
b655c310 NS |
2250 | else |
2251 | { | |
2252 | if (!error_operand_p (bval)) | |
2253 | diagnose_name_conflict (decl, bval); | |
2254 | ok = false; | |
2255 | } | |
00e8de68 | 2256 | |
b655c310 | 2257 | return ok; |
00e8de68 GDR |
2258 | } |
2259 | ||
b655c310 NS |
2260 | /* Diagnose a name conflict between DECL and BVAL. */ |
2261 | ||
00e8de68 | 2262 | static void |
b655c310 NS |
2263 | diagnose_name_conflict (tree decl, tree bval) |
2264 | { | |
2265 | if (TREE_CODE (decl) == TREE_CODE (bval) | |
71bbbd13 | 2266 | && TREE_CODE (decl) != NAMESPACE_DECL |
9d029ddf | 2267 | && !DECL_DECLARES_FUNCTION_P (decl) |
71bbbd13 NS |
2268 | && (TREE_CODE (decl) != TYPE_DECL |
2269 | || DECL_ARTIFICIAL (decl) == DECL_ARTIFICIAL (bval)) | |
9d029ddf | 2270 | && CP_DECL_CONTEXT (decl) == CP_DECL_CONTEXT (bval)) |
cb57504a JM |
2271 | { |
2272 | if (concept_definition_p (decl)) | |
2273 | error ("redeclaration of %q#D with different template parameters", | |
2274 | decl); | |
2275 | else | |
2276 | error ("redeclaration of %q#D", decl); | |
2277 | } | |
00e8de68 | 2278 | else |
b655c310 NS |
2279 | error ("%q#D conflicts with a previous declaration", decl); |
2280 | ||
2281 | inform (location_of (bval), "previous declaration %q#D", bval); | |
00e8de68 GDR |
2282 | } |
2283 | ||
b655c310 | 2284 | /* Wrapper for supplement_binding_1. */ |
00e8de68 | 2285 | |
b655c310 NS |
2286 | static bool |
2287 | supplement_binding (cxx_binding *binding, tree decl) | |
00e8de68 | 2288 | { |
b655c310 NS |
2289 | bool ret; |
2290 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); | |
2291 | ret = supplement_binding_1 (binding, decl); | |
2292 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); | |
2293 | return ret; | |
00e8de68 GDR |
2294 | } |
2295 | ||
9d029ddf NS |
2296 | /* Replace BINDING's current value on its scope's name list with |
2297 | NEWVAL. */ | |
2298 | ||
2299 | static void | |
2300 | update_local_overload (cxx_binding *binding, tree newval) | |
2301 | { | |
2302 | tree *d; | |
2303 | ||
2304 | for (d = &binding->scope->names; ; d = &TREE_CHAIN (*d)) | |
2305 | if (*d == binding->value) | |
2306 | { | |
2307 | /* Stitch new list node in. */ | |
2308 | *d = tree_cons (NULL_TREE, NULL_TREE, TREE_CHAIN (*d)); | |
2309 | break; | |
2310 | } | |
2311 | else if (TREE_CODE (*d) == TREE_LIST && TREE_VALUE (*d) == binding->value) | |
2312 | break; | |
2313 | ||
2314 | TREE_VALUE (*d) = newval; | |
2315 | } | |
2316 | ||
2317 | /* Compares the parameter-type-lists of ONE and TWO and | |
2318 | returns false if they are different. If the DECLs are template | |
2319 | functions, the return types and the template parameter lists are | |
2320 | compared too (DR 565). */ | |
2321 | ||
2322 | static bool | |
2323 | matching_fn_p (tree one, tree two) | |
2324 | { | |
2325 | if (!compparms (TYPE_ARG_TYPES (TREE_TYPE (one)), | |
2326 | TYPE_ARG_TYPES (TREE_TYPE (two)))) | |
2327 | return false; | |
2328 | ||
2329 | if (TREE_CODE (one) == TEMPLATE_DECL | |
2330 | && TREE_CODE (two) == TEMPLATE_DECL) | |
2331 | { | |
2332 | /* Compare template parms. */ | |
2333 | if (!comp_template_parms (DECL_TEMPLATE_PARMS (one), | |
2334 | DECL_TEMPLATE_PARMS (two))) | |
2335 | return false; | |
2336 | ||
2337 | /* And return type. */ | |
2338 | if (!same_type_p (TREE_TYPE (TREE_TYPE (one)), | |
2339 | TREE_TYPE (TREE_TYPE (two)))) | |
2340 | return false; | |
2341 | } | |
2342 | ||
cb57504a JM |
2343 | if (!equivalently_constrained (one, two)) |
2344 | return false; | |
2345 | ||
9d029ddf NS |
2346 | return true; |
2347 | } | |
2348 | ||
3c9cca88 | 2349 | /* Push DECL into nonclass LEVEL BINDING or SLOT. OLD is the current |
3a9cc685 NS |
2350 | binding value (possibly with anticipated builtins stripped). |
2351 | Diagnose conflicts and return updated decl. */ | |
2352 | ||
2353 | static tree | |
3c9cca88 | 2354 | update_binding (cp_binding_level *level, cxx_binding *binding, tree *slot, |
3a9cc685 NS |
2355 | tree old, tree decl, bool is_friend) |
2356 | { | |
2357 | tree to_val = decl; | |
e2f35333 NS |
2358 | tree old_type = slot ? MAYBE_STAT_TYPE (*slot) : binding->type; |
2359 | tree to_type = old_type; | |
3a9cc685 | 2360 | |
3c9cca88 NS |
2361 | gcc_assert (level->kind == sk_namespace ? !binding |
2362 | : level->kind != sk_class && !slot); | |
3a9cc685 NS |
2363 | if (old == error_mark_node) |
2364 | old = NULL_TREE; | |
2365 | ||
e2f35333 NS |
2366 | if (TREE_CODE (decl) == TYPE_DECL && DECL_ARTIFICIAL (decl)) |
2367 | { | |
2368 | tree other = to_type; | |
2369 | ||
2370 | if (old && TREE_CODE (old) == TYPE_DECL && DECL_ARTIFICIAL (old)) | |
2371 | other = old; | |
2372 | ||
2373 | /* Pushing an artificial typedef. See if this matches either | |
2374 | the type slot or the old value slot. */ | |
2375 | if (!other) | |
2376 | ; | |
2377 | else if (same_type_p (TREE_TYPE (other), TREE_TYPE (decl))) | |
2378 | /* Two artificial decls to same type. Do nothing. */ | |
2379 | return other; | |
2380 | else | |
2381 | goto conflict; | |
2382 | ||
2383 | if (old) | |
2384 | { | |
2385 | /* Slide decl into the type slot, keep old unaltered */ | |
2386 | to_type = decl; | |
2387 | to_val = old; | |
2388 | goto done; | |
2389 | } | |
2390 | } | |
2391 | ||
3a9cc685 NS |
2392 | if (old && TREE_CODE (old) == TYPE_DECL && DECL_ARTIFICIAL (old)) |
2393 | { | |
e2f35333 | 2394 | /* Slide old into the type slot. */ |
3a9cc685 NS |
2395 | to_type = old; |
2396 | old = NULL_TREE; | |
2397 | } | |
2398 | ||
2399 | if (DECL_DECLARES_FUNCTION_P (decl)) | |
2400 | { | |
2401 | if (!old) | |
2402 | ; | |
2403 | else if (OVL_P (old)) | |
2404 | { | |
2405 | for (ovl_iterator iter (old); iter; ++iter) | |
2406 | { | |
2407 | tree fn = *iter; | |
2408 | ||
2409 | if (iter.using_p () && matching_fn_p (fn, decl)) | |
2410 | { | |
2411 | /* If a function declaration in namespace scope or | |
2412 | block scope has the same name and the same | |
2413 | parameter-type- list (8.3.5) as a function | |
2414 | introduced by a using-declaration, and the | |
2415 | declarations do not declare the same function, | |
2416 | the program is ill-formed. [namespace.udecl]/14 */ | |
2417 | if (tree match = duplicate_decls (decl, fn, is_friend)) | |
2418 | return match; | |
2419 | else | |
2420 | /* FIXME: To preserve existing error behavior, we | |
2421 | still push the decl. This might change. */ | |
2422 | diagnose_name_conflict (decl, fn); | |
2423 | } | |
2424 | } | |
2425 | } | |
2426 | else | |
2427 | goto conflict; | |
2428 | ||
c14c0b15 NS |
2429 | if (to_type != old_type |
2430 | && warn_shadow | |
2431 | && MAYBE_CLASS_TYPE_P (TREE_TYPE (to_type)) | |
2432 | && !(DECL_IN_SYSTEM_HEADER (decl) | |
2433 | && DECL_IN_SYSTEM_HEADER (to_type))) | |
2434 | warning (OPT_Wshadow, "%q#D hides constructor for %q#D", | |
2435 | decl, to_type); | |
2436 | ||
3a9cc685 NS |
2437 | to_val = ovl_insert (decl, old); |
2438 | } | |
3a9cc685 NS |
2439 | else if (!old) |
2440 | ; | |
3a9cc685 NS |
2441 | else if (TREE_CODE (old) != TREE_CODE (decl)) |
2442 | /* Different kinds of decls conflict. */ | |
2443 | goto conflict; | |
2444 | else if (TREE_CODE (old) == TYPE_DECL) | |
2445 | { | |
e2f35333 | 2446 | if (same_type_p (TREE_TYPE (old), TREE_TYPE (decl))) |
3a9cc685 NS |
2447 | /* Two type decls to the same type. Do nothing. */ |
2448 | return old; | |
2449 | else | |
2450 | goto conflict; | |
2451 | } | |
2452 | else if (TREE_CODE (old) == NAMESPACE_DECL) | |
2453 | { | |
71bbbd13 NS |
2454 | /* Two maybe-aliased namespaces. If they're to the same target |
2455 | namespace, that's ok. */ | |
2456 | if (ORIGINAL_NAMESPACE (old) != ORIGINAL_NAMESPACE (decl)) | |
3a9cc685 | 2457 | goto conflict; |
71bbbd13 NS |
2458 | |
2459 | /* The new one must be an alias at this point. */ | |
2460 | gcc_assert (DECL_NAMESPACE_ALIAS (decl)); | |
2461 | return old; | |
3a9cc685 NS |
2462 | } |
2463 | else if (TREE_CODE (old) == VAR_DECL) | |
2464 | { | |
2465 | /* There can be two block-scope declarations of the same | |
2466 | variable, so long as they are `extern' declarations. */ | |
2467 | if (!DECL_EXTERNAL (old) || !DECL_EXTERNAL (decl)) | |
2468 | goto conflict; | |
2469 | else if (tree match = duplicate_decls (decl, old, false)) | |
2470 | return match; | |
2471 | else | |
2472 | goto conflict; | |
2473 | } | |
2474 | else | |
2475 | { | |
2476 | conflict: | |
2477 | diagnose_name_conflict (decl, old); | |
2478 | to_val = NULL_TREE; | |
2479 | } | |
2480 | ||
e2f35333 | 2481 | done: |
3a9cc685 NS |
2482 | if (to_val) |
2483 | { | |
7cd9cf2f NS |
2484 | if (level->kind == sk_namespace || to_type == decl || to_val == decl) |
2485 | add_decl_to_level (level, decl); | |
3a9cc685 NS |
2486 | else |
2487 | { | |
7cd9cf2f NS |
2488 | gcc_checking_assert (binding->value && OVL_P (binding->value)); |
2489 | update_local_overload (binding, to_val); | |
3a9cc685 NS |
2490 | } |
2491 | ||
3c9cca88 NS |
2492 | if (slot) |
2493 | { | |
2494 | if (STAT_HACK_P (*slot)) | |
2495 | { | |
e2f35333 | 2496 | STAT_TYPE (*slot) = to_type; |
3c9cca88 NS |
2497 | STAT_DECL (*slot) = to_val; |
2498 | } | |
2499 | else if (to_type) | |
2500 | *slot = stat_hack (to_val, to_type); | |
2501 | else | |
2502 | *slot = to_val; | |
2503 | } | |
2504 | else | |
2505 | { | |
e2f35333 | 2506 | binding->type = to_type; |
3c9cca88 NS |
2507 | binding->value = to_val; |
2508 | } | |
3a9cc685 NS |
2509 | } |
2510 | ||
2511 | return decl; | |
2512 | } | |
2513 | ||
7cd6ea64 | 2514 | /* Table of identifiers to extern C declarations (or LISTS thereof). */ |
539f481a | 2515 | |
7cd6ea64 | 2516 | static GTY(()) hash_table<named_decl_hash> *extern_c_decls; |
539f481a | 2517 | |
7cd6ea64 NS |
2518 | /* DECL has C linkage. If we have an existing instance, make sure the |
2519 | new one is compatible. Make sure it has the same exception | |
2520 | specification [7.5, 7.6]. Add DECL to the map. */ | |
539f481a NS |
2521 | |
2522 | static void | |
2523 | check_extern_c_conflict (tree decl) | |
2524 | { | |
2525 | /* Ignore artificial or system header decls. */ | |
2526 | if (DECL_ARTIFICIAL (decl) || DECL_IN_SYSTEM_HEADER (decl)) | |
2527 | return; | |
2528 | ||
38dff921 JM |
2529 | /* This only applies to decls at namespace scope. */ |
2530 | if (!DECL_NAMESPACE_SCOPE_P (decl)) | |
2531 | return; | |
2532 | ||
7cd6ea64 NS |
2533 | if (!extern_c_decls) |
2534 | extern_c_decls = hash_table<named_decl_hash>::create_ggc (127); | |
539f481a | 2535 | |
7cd6ea64 | 2536 | tree *slot = extern_c_decls |
9bc3f420 NS |
2537 | ->find_slot_with_hash (DECL_NAME (decl), |
2538 | IDENTIFIER_HASH_VALUE (DECL_NAME (decl)), INSERT); | |
2539 | if (tree old = *slot) | |
539f481a | 2540 | { |
9bc3f420 NS |
2541 | if (TREE_CODE (old) == OVERLOAD) |
2542 | old = OVL_FUNCTION (old); | |
539f481a NS |
2543 | |
2544 | int mismatch = 0; | |
2545 | if (DECL_CONTEXT (old) == DECL_CONTEXT (decl)) | |
2546 | ; /* If they're in the same context, we'll have already complained | |
2547 | about a (possible) mismatch, when inserting the decl. */ | |
2548 | else if (!decls_match (decl, old)) | |
2549 | mismatch = 1; | |
7cd6ea64 NS |
2550 | else if (TREE_CODE (decl) == FUNCTION_DECL |
2551 | && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (old)), | |
2552 | TYPE_RAISES_EXCEPTIONS (TREE_TYPE (decl)), | |
2553 | ce_normal)) | |
539f481a NS |
2554 | mismatch = -1; |
2555 | else if (DECL_ASSEMBLER_NAME_SET_P (old)) | |
2556 | SET_DECL_ASSEMBLER_NAME (decl, DECL_ASSEMBLER_NAME (old)); | |
2557 | ||
2558 | if (mismatch) | |
2559 | { | |
097f82ec | 2560 | auto_diagnostic_group d; |
a4cd9ac5 | 2561 | pedwarn (DECL_SOURCE_LOCATION (decl), 0, |
7cd6ea64 NS |
2562 | "conflicting C language linkage declaration %q#D", decl); |
2563 | inform (DECL_SOURCE_LOCATION (old), | |
2564 | "previous declaration %q#D", old); | |
539f481a | 2565 | if (mismatch < 0) |
a4cd9ac5 | 2566 | inform (DECL_SOURCE_LOCATION (decl), |
7cd6ea64 | 2567 | "due to different exception specifications"); |
539f481a NS |
2568 | } |
2569 | else | |
9bc3f420 NS |
2570 | { |
2571 | if (old == *slot) | |
2572 | /* The hash table expects OVERLOADS, so construct one with | |
2573 | OLD as both the function and the chain. This allocate | |
2574 | an excess OVERLOAD node, but it's rare to have multiple | |
2575 | extern "C" decls of the same name. And we save | |
2576 | complicating the hash table logic (which is used | |
2577 | elsewhere). */ | |
2578 | *slot = ovl_make (old, old); | |
2579 | ||
2580 | slot = &OVL_CHAIN (*slot); | |
2581 | ||
2582 | /* Chain it on for c_linkage_binding's use. */ | |
2583 | *slot = tree_cons (NULL_TREE, decl, *slot); | |
2584 | } | |
539f481a | 2585 | } |
9bc3f420 NS |
2586 | else |
2587 | *slot = decl; | |
539f481a NS |
2588 | } |
2589 | ||
2590 | /* Returns a list of C-linkage decls with the name NAME. Used in | |
2591 | c-family/c-pragma.c to implement redefine_extname pragma. */ | |
2592 | ||
2593 | tree | |
2594 | c_linkage_bindings (tree name) | |
2595 | { | |
7cd6ea64 NS |
2596 | if (extern_c_decls) |
2597 | if (tree *slot = extern_c_decls | |
9bc3f420 NS |
2598 | ->find_slot_with_hash (name, IDENTIFIER_HASH_VALUE (name), NO_INSERT)) |
2599 | { | |
2600 | tree result = *slot; | |
2601 | if (TREE_CODE (result) == OVERLOAD) | |
2602 | result = OVL_CHAIN (result); | |
2603 | return result; | |
2604 | } | |
2605 | ||
539f481a NS |
2606 | return NULL_TREE; |
2607 | } | |
2608 | ||
097f82ec DM |
2609 | /* Subroutine of check_local_shadow. */ |
2610 | ||
2611 | static void | |
2612 | inform_shadowed (tree shadowed) | |
2613 | { | |
2614 | inform (DECL_SOURCE_LOCATION (shadowed), | |
2615 | "shadowed declaration is here"); | |
2616 | } | |
2617 | ||
c0c24822 NS |
2618 | /* DECL is being declared at a local scope. Emit suitable shadow |
2619 | warnings. */ | |
2620 | ||
2621 | static void | |
2622 | check_local_shadow (tree decl) | |
2623 | { | |
2624 | /* Don't complain about the parms we push and then pop | |
2625 | while tentatively parsing a function declarator. */ | |
2626 | if (TREE_CODE (decl) == PARM_DECL && !DECL_CONTEXT (decl)) | |
2627 | return; | |
2628 | ||
c0c24822 NS |
2629 | /* External decls are something else. */ |
2630 | if (DECL_EXTERNAL (decl)) | |
2631 | return; | |
2632 | ||
2633 | tree old = NULL_TREE; | |
2634 | cp_binding_level *old_scope = NULL; | |
2635 | if (cxx_binding *binding = outer_binding (DECL_NAME (decl), NULL, true)) | |
2636 | { | |
2637 | old = binding->value; | |
2638 | old_scope = binding->scope; | |
2639 | } | |
c0c24822 | 2640 | |
c0c24822 NS |
2641 | if (old |
2642 | && (TREE_CODE (old) == PARM_DECL | |
2643 | || VAR_P (old) | |
2644 | || (TREE_CODE (old) == TYPE_DECL | |
2645 | && (!DECL_ARTIFICIAL (old) | |
2646 | || TREE_CODE (decl) == TYPE_DECL))) | |
006fbbe9 | 2647 | && DECL_FUNCTION_SCOPE_P (old) |
c0c24822 | 2648 | && (!DECL_ARTIFICIAL (decl) |
63b48839 | 2649 | || is_capture_proxy (decl) |
c0c24822 NS |
2650 | || DECL_IMPLICIT_TYPEDEF_P (decl) |
2651 | || (VAR_P (decl) && DECL_ANON_UNION_VAR_P (decl)))) | |
2652 | { | |
2653 | /* DECL shadows a local thing possibly of interest. */ | |
2654 | ||
63b48839 VV |
2655 | /* DR 2211: check that captures and parameters |
2656 | do not have the same name. */ | |
2657 | if (is_capture_proxy (decl)) | |
2658 | { | |
2659 | if (current_lambda_expr () | |
2660 | && DECL_CONTEXT (old) == lambda_function (current_lambda_expr ()) | |
2661 | && TREE_CODE (old) == PARM_DECL | |
2662 | && DECL_NAME (decl) != this_identifier) | |
2663 | { | |
2664 | error_at (DECL_SOURCE_LOCATION (old), | |
2665 | "lambda parameter %qD " | |
2666 | "previously declared as a capture", old); | |
2667 | } | |
2668 | return; | |
2669 | } | |
c0c24822 | 2670 | /* Don't complain if it's from an enclosing function. */ |
63b48839 | 2671 | else if (DECL_CONTEXT (old) == current_function_decl |
c0c24822 NS |
2672 | && TREE_CODE (decl) != PARM_DECL |
2673 | && TREE_CODE (old) == PARM_DECL) | |
2674 | { | |
2675 | /* Go to where the parms should be and see if we find | |
2676 | them there. */ | |
2677 | cp_binding_level *b = current_binding_level->level_chain; | |
2678 | ||
2679 | if (FUNCTION_NEEDS_BODY_BLOCK (current_function_decl)) | |
2680 | /* Skip the ctor/dtor cleanup level. */ | |
2681 | b = b->level_chain; | |
2682 | ||
2683 | /* ARM $8.3 */ | |
2684 | if (b->kind == sk_function_parms) | |
2685 | { | |
a4cd9ac5 PC |
2686 | error_at (DECL_SOURCE_LOCATION (decl), |
2687 | "declaration of %q#D shadows a parameter", decl); | |
c0c24822 NS |
2688 | return; |
2689 | } | |
2690 | } | |
2691 | ||
2692 | /* The local structure or class can't use parameters of | |
2693 | the containing function anyway. */ | |
2694 | if (DECL_CONTEXT (old) != current_function_decl) | |
2695 | { | |
2696 | for (cp_binding_level *scope = current_binding_level; | |
2697 | scope != old_scope; scope = scope->level_chain) | |
2698 | if (scope->kind == sk_class | |
2699 | && !LAMBDA_TYPE_P (scope->this_entity)) | |
2700 | return; | |
2701 | } | |
2702 | /* Error if redeclaring a local declared in a | |
2703 | init-statement or in the condition of an if or | |
2704 | switch statement when the new declaration is in the | |
2705 | outermost block of the controlled statement. | |
2706 | Redeclaring a variable from a for or while condition is | |
2707 | detected elsewhere. */ | |
2708 | else if (VAR_P (old) | |
2709 | && old_scope == current_binding_level->level_chain | |
2710 | && (old_scope->kind == sk_cond || old_scope->kind == sk_for)) | |
2711 | { | |
097f82ec | 2712 | auto_diagnostic_group d; |
a4cd9ac5 PC |
2713 | error_at (DECL_SOURCE_LOCATION (decl), |
2714 | "redeclaration of %q#D", decl); | |
c0c24822 NS |
2715 | inform (DECL_SOURCE_LOCATION (old), |
2716 | "%q#D previously declared here", old); | |
2717 | return; | |
2718 | } | |
2719 | /* C++11: | |
2720 | 3.3.3/3: The name declared in an exception-declaration (...) | |
2721 | shall not be redeclared in the outermost block of the handler. | |
2722 | 3.3.3/2: A parameter name shall not be redeclared (...) in | |
2723 | the outermost block of any handler associated with a | |
2724 | function-try-block. | |
2725 | 3.4.1/15: The function parameter names shall not be redeclared | |
2726 | in the exception-declaration nor in the outermost block of a | |
2727 | handler for the function-try-block. */ | |
2728 | else if ((TREE_CODE (old) == VAR_DECL | |
2729 | && old_scope == current_binding_level->level_chain | |
2730 | && old_scope->kind == sk_catch) | |
2731 | || (TREE_CODE (old) == PARM_DECL | |
2732 | && (current_binding_level->kind == sk_catch | |
2733 | || current_binding_level->level_chain->kind == sk_catch) | |
2734 | && in_function_try_handler)) | |
2735 | { | |
097f82ec | 2736 | auto_diagnostic_group d; |
a4cd9ac5 PC |
2737 | if (permerror (DECL_SOURCE_LOCATION (decl), |
2738 | "redeclaration of %q#D", decl)) | |
c0c24822 NS |
2739 | inform (DECL_SOURCE_LOCATION (old), |
2740 | "%q#D previously declared here", old); | |
2741 | return; | |
2742 | } | |
2743 | ||
2744 | /* If '-Wshadow=compatible-local' is specified without other | |
2745 | -Wshadow= flags, we will warn only when the type of the | |
2746 | shadowing variable (DECL) can be converted to that of the | |
2747 | shadowed parameter (OLD_LOCAL). The reason why we only check | |
2748 | if DECL's type can be converted to OLD_LOCAL's type (but not the | |
2749 | other way around) is because when users accidentally shadow a | |
2750 | parameter, more than often they would use the variable | |
2751 | thinking (mistakenly) it's still the parameter. It would be | |
2752 | rare that users would use the variable in the place that | |
2753 | expects the parameter but thinking it's a new decl. */ | |
2754 | ||
2755 | enum opt_code warning_code; | |
2756 | if (warn_shadow) | |
2757 | warning_code = OPT_Wshadow; | |
2758 | else if (warn_shadow_local) | |
2759 | warning_code = OPT_Wshadow_local; | |
2760 | else if (warn_shadow_compatible_local | |
9db84ece NS |
2761 | && (same_type_p (TREE_TYPE (old), TREE_TYPE (decl)) |
2762 | || (!dependent_type_p (TREE_TYPE (decl)) | |
2763 | && !dependent_type_p (TREE_TYPE (old)) | |
3897f134 NS |
2764 | /* If the new decl uses auto, we don't yet know |
2765 | its type (the old type cannot be using auto | |
2766 | at this point, without also being | |
2767 | dependent). This is an indication we're | |
2768 | (now) doing the shadow checking too | |
2769 | early. */ | |
2770 | && !type_uses_auto (TREE_TYPE (decl)) | |
9db84ece NS |
2771 | && can_convert (TREE_TYPE (old), TREE_TYPE (decl), |
2772 | tf_none)))) | |
c0c24822 NS |
2773 | warning_code = OPT_Wshadow_compatible_local; |
2774 | else | |
2775 | return; | |
2776 | ||
2777 | const char *msg; | |
2778 | if (TREE_CODE (old) == PARM_DECL) | |
2779 | msg = "declaration of %q#D shadows a parameter"; | |
2780 | else if (is_capture_proxy (old)) | |
2781 | msg = "declaration of %qD shadows a lambda capture"; | |
2782 | else | |
2783 | msg = "declaration of %qD shadows a previous local"; | |
2784 | ||
097f82ec | 2785 | auto_diagnostic_group d; |
a0aedc7a | 2786 | if (warning_at (DECL_SOURCE_LOCATION (decl), warning_code, msg, decl)) |
097f82ec | 2787 | inform_shadowed (old); |
c0c24822 NS |
2788 | return; |
2789 | } | |
2790 | ||
2791 | if (!warn_shadow) | |
2792 | return; | |
2793 | ||
2794 | /* Don't warn for artificial things that are not implicit typedefs. */ | |
2795 | if (DECL_ARTIFICIAL (decl) && !DECL_IMPLICIT_TYPEDEF_P (decl)) | |
2796 | return; | |
2797 | ||
2798 | if (nonlambda_method_basetype ()) | |
2799 | if (tree member = lookup_member (current_nonlambda_class_type (), | |
2800 | DECL_NAME (decl), /*protect=*/0, | |
2801 | /*want_type=*/false, tf_warning_or_error)) | |
2802 | { | |
2803 | member = MAYBE_BASELINK_FUNCTIONS (member); | |
2804 | ||
2805 | /* Warn if a variable shadows a non-function, or the variable | |
2806 | is a function or a pointer-to-function. */ | |
5256a7f5 | 2807 | if (!OVL_P (member) |
c0c24822 NS |
2808 | || TREE_CODE (decl) == FUNCTION_DECL |
2809 | || TYPE_PTRFN_P (TREE_TYPE (decl)) | |
2810 | || TYPE_PTRMEMFUNC_P (TREE_TYPE (decl))) | |
2811 | { | |
097f82ec | 2812 | auto_diagnostic_group d; |
a0aedc7a | 2813 | if (warning_at (DECL_SOURCE_LOCATION (decl), OPT_Wshadow, |
c0c24822 NS |
2814 | "declaration of %qD shadows a member of %qT", |
2815 | decl, current_nonlambda_class_type ()) | |
2816 | && DECL_P (member)) | |
097f82ec | 2817 | inform_shadowed (member); |
c0c24822 NS |
2818 | } |
2819 | return; | |
2820 | } | |
2821 | ||
2822 | /* Now look for a namespace shadow. */ | |
3c9cca88 | 2823 | old = find_namespace_value (current_namespace, DECL_NAME (decl)); |
c0c24822 NS |
2824 | if (old |
2825 | && (VAR_P (old) | |
2826 | || (TREE_CODE (old) == TYPE_DECL | |
2827 | && (!DECL_ARTIFICIAL (old) | |
2828 | || TREE_CODE (decl) == TYPE_DECL))) | |
2829 | && !instantiating_current_function_p ()) | |
2830 | /* XXX shadow warnings in outer-more namespaces */ | |
2831 | { | |
097f82ec | 2832 | auto_diagnostic_group d; |
a0aedc7a | 2833 | if (warning_at (DECL_SOURCE_LOCATION (decl), OPT_Wshadow, |
c0c24822 NS |
2834 | "declaration of %qD shadows a global declaration", |
2835 | decl)) | |
097f82ec | 2836 | inform_shadowed (old); |
c0c24822 NS |
2837 | return; |
2838 | } | |
2839 | ||
2840 | return; | |
c0c24822 NS |
2841 | } |
2842 | ||
e4ea7a4c NS |
2843 | /* DECL is being pushed inside function CTX. Set its context, if |
2844 | needed. */ | |
2845 | ||
2846 | static void | |
2847 | set_decl_context_in_fn (tree ctx, tree decl) | |
2848 | { | |
2849 | if (!DECL_CONTEXT (decl) | |
2850 | /* A local declaration for a function doesn't constitute | |
2851 | nesting. */ | |
2852 | && TREE_CODE (decl) != FUNCTION_DECL | |
2853 | /* A local declaration for an `extern' variable is in the | |
2854 | scope of the current namespace, not the current | |
2855 | function. */ | |
2856 | && !(VAR_P (decl) && DECL_EXTERNAL (decl)) | |
2857 | /* When parsing the parameter list of a function declarator, | |
2858 | don't set DECL_CONTEXT to an enclosing function. When we | |
2859 | push the PARM_DECLs in order to process the function body, | |
2860 | current_binding_level->this_entity will be set. */ | |
2861 | && !(TREE_CODE (decl) == PARM_DECL | |
2862 | && current_binding_level->kind == sk_function_parms | |
2863 | && current_binding_level->this_entity == NULL)) | |
2864 | DECL_CONTEXT (decl) = ctx; | |
2865 | ||
2866 | /* If this is the declaration for a namespace-scope function, | |
2867 | but the declaration itself is in a local scope, mark the | |
2868 | declaration. */ | |
2869 | if (TREE_CODE (decl) == FUNCTION_DECL && DECL_NAMESPACE_SCOPE_P (decl)) | |
2870 | DECL_LOCAL_FUNCTION_P (decl) = 1; | |
2871 | } | |
2872 | ||
2873 | /* DECL is a local-scope decl with linkage. SHADOWED is true if the | |
2874 | name is already bound at the current level. | |
2875 | ||
2876 | [basic.link] If there is a visible declaration of an entity with | |
2877 | linkage having the same name and type, ignoring entities declared | |
2878 | outside the innermost enclosing namespace scope, the block scope | |
2879 | declaration declares that same entity and receives the linkage of | |
2880 | the previous declaration. | |
2881 | ||
2882 | Also, make sure that this decl matches any existing external decl | |
2883 | in the enclosing namespace. */ | |
2884 | ||
2885 | static void | |
2886 | set_local_extern_decl_linkage (tree decl, bool shadowed) | |
2887 | { | |
2888 | tree ns_value = decl; /* Unique marker. */ | |
2889 | ||
2890 | if (!shadowed) | |
2891 | { | |
2892 | tree loc_value = innermost_non_namespace_value (DECL_NAME (decl)); | |
2893 | if (!loc_value) | |
2894 | { | |
2895 | ns_value | |
3c9cca88 | 2896 | = find_namespace_value (current_namespace, DECL_NAME (decl)); |
e4ea7a4c NS |
2897 | loc_value = ns_value; |
2898 | } | |
8f3284a4 NS |
2899 | if (loc_value == error_mark_node |
2900 | /* An ambiguous lookup. */ | |
2901 | || (loc_value && TREE_CODE (loc_value) == TREE_LIST)) | |
e4ea7a4c NS |
2902 | loc_value = NULL_TREE; |
2903 | ||
2904 | for (ovl_iterator iter (loc_value); iter; ++iter) | |
ef4c5e78 | 2905 | if (!iter.hidden_p () |
e4ea7a4c NS |
2906 | && (TREE_STATIC (*iter) || DECL_EXTERNAL (*iter)) |
2907 | && decls_match (*iter, decl)) | |
2908 | { | |
2909 | /* The standard only says that the local extern inherits | |
2910 | linkage from the previous decl; in particular, default | |
2911 | args are not shared. Add the decl into a hash table to | |
2912 | make sure only the previous decl in this case is seen | |
2913 | by the middle end. */ | |
2914 | struct cxx_int_tree_map *h; | |
2915 | ||
2916 | /* We inherit the outer decl's linkage. But we're a | |
2917 | different decl. */ | |
2918 | TREE_PUBLIC (decl) = TREE_PUBLIC (*iter); | |
2919 | ||
2920 | if (cp_function_chain->extern_decl_map == NULL) | |
2921 | cp_function_chain->extern_decl_map | |
2922 | = hash_table<cxx_int_tree_map_hasher>::create_ggc (20); | |
2923 | ||
2924 | h = ggc_alloc<cxx_int_tree_map> (); | |
2925 | h->uid = DECL_UID (decl); | |
2926 | h->to = *iter; | |
2927 | cxx_int_tree_map **loc = cp_function_chain->extern_decl_map | |
2928 | ->find_slot (h, INSERT); | |
2929 | *loc = h; | |
2930 | break; | |
2931 | } | |
2932 | } | |
2933 | ||
2934 | if (TREE_PUBLIC (decl)) | |
2935 | { | |
2936 | /* DECL is externally visible. Make sure it matches a matching | |
3c9cca88 | 2937 | decl in the namespace scope. We only really need to check |
e4ea7a4c NS |
2938 | this when inserting the decl, not when we find an existing |
2939 | match in the current scope. However, in practice we're | |
2940 | going to be inserting a new decl in the majority of cases -- | |
2941 | who writes multiple extern decls for the same thing in the | |
2942 | same local scope? Doing it here often avoids a duplicate | |
2943 | namespace lookup. */ | |
2944 | ||
2945 | /* Avoid repeating a lookup. */ | |
2946 | if (ns_value == decl) | |
3c9cca88 | 2947 | ns_value = find_namespace_value (current_namespace, DECL_NAME (decl)); |
e4ea7a4c | 2948 | |
8f3284a4 NS |
2949 | if (ns_value == error_mark_node |
2950 | || (ns_value && TREE_CODE (ns_value) == TREE_LIST)) | |
e4ea7a4c NS |
2951 | ns_value = NULL_TREE; |
2952 | ||
2953 | for (ovl_iterator iter (ns_value); iter; ++iter) | |
2954 | { | |
2955 | tree other = *iter; | |
2956 | ||
2957 | if (!(TREE_PUBLIC (other) || DECL_EXTERNAL (other))) | |
2958 | ; /* Not externally visible. */ | |
2959 | else if (DECL_EXTERN_C_P (decl) && DECL_EXTERN_C_P (other)) | |
2960 | ; /* Both are extern "C", we'll check via that mechanism. */ | |
2961 | else if (TREE_CODE (other) != TREE_CODE (decl) | |
2962 | || ((VAR_P (decl) || matching_fn_p (other, decl)) | |
2963 | && !comptypes (TREE_TYPE (decl), TREE_TYPE (other), | |
2964 | COMPARE_REDECLARATION))) | |
2965 | { | |
097f82ec | 2966 | auto_diagnostic_group d; |
e4ea7a4c NS |
2967 | if (permerror (DECL_SOURCE_LOCATION (decl), |
2968 | "local external declaration %q#D", decl)) | |
2969 | inform (DECL_SOURCE_LOCATION (other), | |
2970 | "does not match previous declaration %q#D", other); | |
2971 | break; | |
2972 | } | |
2973 | } | |
2974 | } | |
2975 | } | |
2976 | ||
3a9cc685 NS |
2977 | /* Record DECL as belonging to the current lexical scope. Check for |
2978 | errors (such as an incompatible declaration for the same name | |
2979 | already seen in the same scope). IS_FRIEND is true if DECL is | |
b655c310 | 2980 | declared as a friend. |
00e8de68 | 2981 | |
3a9cc685 NS |
2982 | Returns either DECL or an old decl for the same name. If an old |
2983 | decl is returned, it may have been smashed to agree with what DECL | |
2984 | says. */ | |
89b578be | 2985 | |
b655c310 | 2986 | static tree |
3a9cc685 | 2987 | do_pushdecl (tree decl, bool is_friend) |
89b578be | 2988 | { |
3a9cc685 | 2989 | if (decl == error_mark_node) |
b655c310 | 2990 | return error_mark_node; |
00e8de68 | 2991 | |
3a9cc685 NS |
2992 | if (!DECL_TEMPLATE_PARM_P (decl) && current_function_decl) |
2993 | set_decl_context_in_fn (current_function_decl, decl); | |
c8094d83 | 2994 | |
3a9cc685 NS |
2995 | /* The binding level we will be pushing into. During local class |
2996 | pushing, we want to push to the containing scope. */ | |
2997 | cp_binding_level *level = current_binding_level; | |
2998 | while (level->kind == sk_class) | |
2999 | level = level->level_chain; | |
00e8de68 | 3000 | |
e833f686 NS |
3001 | /* An anonymous namespace has a NULL DECL_NAME, but we still want to |
3002 | insert it. Other NULL-named decls, not so much. */ | |
3003 | tree name = DECL_NAME (decl); | |
3004 | if (name || TREE_CODE (decl) == NAMESPACE_DECL) | |
00e8de68 | 3005 | { |
3c9cca88 | 3006 | cxx_binding *binding = NULL; /* Local scope binding. */ |
3a9cc685 | 3007 | tree ns = NULL_TREE; /* Searched namespace. */ |
3c9cca88 | 3008 | tree *slot = NULL; /* Binding slot in namespace. */ |
3a9cc685 | 3009 | tree old = NULL_TREE; |
00e8de68 | 3010 | |
3a9cc685 | 3011 | if (level->kind == sk_namespace) |
b655c310 | 3012 | { |
3a9cc685 NS |
3013 | /* We look in the decl's namespace for an existing |
3014 | declaration, even though we push into the current | |
3015 | namespace. */ | |
3016 | ns = (DECL_NAMESPACE_SCOPE_P (decl) | |
3017 | ? CP_DECL_CONTEXT (decl) : current_namespace); | |
3018 | /* Create the binding, if this is current namespace, because | |
3019 | that's where we'll be pushing anyway. */ | |
3c9cca88 NS |
3020 | slot = find_namespace_slot (ns, name, ns == current_namespace); |
3021 | if (slot) | |
3022 | old = MAYBE_STAT_DECL (*slot); | |
b655c310 | 3023 | } |
3a9cc685 | 3024 | else |
3c9cca88 NS |
3025 | { |
3026 | binding = find_local_binding (level, name); | |
3027 | if (binding) | |
3028 | old = binding->value; | |
3029 | } | |
00e8de68 | 3030 | |
3a9cc685 NS |
3031 | if (current_function_decl && VAR_OR_FUNCTION_DECL_P (decl) |
3032 | && DECL_EXTERNAL (decl)) | |
3033 | set_local_extern_decl_linkage (decl, old != NULL_TREE); | |
00e8de68 | 3034 | |
3a9cc685 NS |
3035 | if (old == error_mark_node) |
3036 | old = NULL_TREE; | |
00e8de68 | 3037 | |
3a9cc685 NS |
3038 | for (ovl_iterator iter (old); iter; ++iter) |
3039 | if (iter.using_p ()) | |
3040 | ; /* Ignore using decls here. */ | |
3041 | else if (tree match = duplicate_decls (decl, *iter, is_friend)) | |
ef4c5e78 | 3042 | { |
274c1516 NS |
3043 | if (match == error_mark_node) |
3044 | ; | |
3045 | else if (TREE_CODE (match) == TYPE_DECL) | |
3046 | /* The IDENTIFIER will have the type referring to the | |
3047 | now-smashed TYPE_DECL, because ...? Reset it. */ | |
3048 | SET_IDENTIFIER_TYPE_VALUE (name, TREE_TYPE (match)); | |
3049 | else if (iter.hidden_p () && !DECL_HIDDEN_P (match)) | |
ef4c5e78 NS |
3050 | { |
3051 | /* Unhiding a previously hidden decl. */ | |
3052 | tree head = iter.reveal_node (old); | |
3053 | if (head != old) | |
3054 | { | |
3055 | if (!ns) | |
3c9cca88 NS |
3056 | { |
3057 | update_local_overload (binding, head); | |
3058 | binding->value = head; | |
3059 | } | |
3060 | else if (STAT_HACK_P (*slot)) | |
3061 | STAT_DECL (*slot) = head; | |
3062 | else | |
3063 | *slot = head; | |
ef4c5e78 | 3064 | } |
7cd6ea64 NS |
3065 | if (DECL_EXTERN_C_P (match)) |
3066 | /* We need to check and register the decl now. */ | |
ef4c5e78 NS |
3067 | check_extern_c_conflict (match); |
3068 | } | |
3069 | return match; | |
3070 | } | |
c8094d83 | 3071 | |
3a9cc685 | 3072 | /* We are pushing a new decl. */ |
00e8de68 | 3073 | |
ef4c5e78 NS |
3074 | /* Skip a hidden builtin we failed to match already. There can |
3075 | only be one. */ | |
3076 | if (old && anticipated_builtin_p (old)) | |
3077 | old = OVL_CHAIN (old); | |
5294e4c3 | 3078 | |
3a9cc685 | 3079 | check_template_shadow (decl); |
00e8de68 | 3080 | |
3a9cc685 | 3081 | if (DECL_DECLARES_FUNCTION_P (decl)) |
b655c310 | 3082 | { |
3a9cc685 | 3083 | check_default_args (decl); |
00e8de68 | 3084 | |
3a9cc685 | 3085 | if (is_friend) |
b655c310 | 3086 | { |
3a9cc685 | 3087 | if (level->kind != sk_namespace) |
b1a7e33d NS |
3088 | { |
3089 | /* In a local class, a friend function declaration must | |
3090 | find a matching decl in the innermost non-class scope. | |
3091 | [class.friend/11] */ | |
f5fc32e4 PC |
3092 | error_at (DECL_SOURCE_LOCATION (decl), |
3093 | "friend declaration %qD in local class without " | |
3094 | "prior local declaration", decl); | |
b1a7e33d NS |
3095 | /* Don't attempt to push it. */ |
3096 | return error_mark_node; | |
3097 | } | |
6c072e21 NS |
3098 | /* Hide it from ordinary lookup. */ |
3099 | DECL_ANTICIPATED (decl) = DECL_HIDDEN_FRIEND_P (decl) = true; | |
b655c310 NS |
3100 | } |
3101 | } | |
00e8de68 | 3102 | |
3a9cc685 | 3103 | if (level->kind != sk_namespace) |
b655c310 | 3104 | { |
3a9cc685 | 3105 | check_local_shadow (decl); |
00e8de68 | 3106 | |
3a9cc685 NS |
3107 | if (TREE_CODE (decl) == NAMESPACE_DECL) |
3108 | /* A local namespace alias. */ | |
3109 | set_identifier_type_value (name, NULL_TREE); | |
00e8de68 | 3110 | |
3a9cc685 NS |
3111 | if (!binding) |
3112 | binding = create_local_binding (level, name); | |
b655c310 | 3113 | } |
3c9cca88 | 3114 | else if (!slot) |
b655c310 | 3115 | { |
3a9cc685 | 3116 | ns = current_namespace; |
3c9cca88 | 3117 | slot = find_namespace_slot (ns, name, true); |
be3b7dcf NS |
3118 | /* Update OLD to reflect the namespace we're going to be |
3119 | pushing into. */ | |
3120 | old = MAYBE_STAT_DECL (*slot); | |
b655c310 | 3121 | } |
fdf03377 | 3122 | |
3c9cca88 | 3123 | old = update_binding (level, binding, slot, old, decl, is_friend); |
fdf03377 | 3124 | |
3a9cc685 NS |
3125 | if (old != decl) |
3126 | /* An existing decl matched, use it. */ | |
3127 | decl = old; | |
3128 | else if (TREE_CODE (decl) == TYPE_DECL) | |
3129 | { | |
3130 | tree type = TREE_TYPE (decl); | |
00e8de68 | 3131 | |
3a9cc685 | 3132 | if (type != error_mark_node) |
b655c310 | 3133 | { |
3a9cc685 NS |
3134 | if (TYPE_NAME (type) != decl) |
3135 | set_underlying_type (decl); | |
00e8de68 | 3136 | |
3a9cc685 NS |
3137 | if (!ns) |
3138 | set_identifier_type_value_with_scope (name, decl, level); | |
b655c310 | 3139 | else |
3a9cc685 | 3140 | SET_IDENTIFIER_TYPE_VALUE (name, global_type_node); |
b655c310 | 3141 | } |
7b3b6ae4 | 3142 | |
3a9cc685 NS |
3143 | /* If this is a locally defined typedef in a function that |
3144 | is not a template instantation, record it to implement | |
3145 | -Wunused-local-typedefs. */ | |
3146 | if (!instantiating_current_function_p ()) | |
3147 | record_locally_defined_typedef (decl); | |
3148 | } | |
3149 | else if (VAR_P (decl)) | |
3150 | maybe_register_incomplete_var (decl); | |
7cd6ea64 NS |
3151 | |
3152 | if ((VAR_P (decl) || TREE_CODE (decl) == FUNCTION_DECL) | |
3153 | && DECL_EXTERN_C_P (decl)) | |
3a9cc685 | 3154 | check_extern_c_conflict (decl); |
00e8de68 | 3155 | } |
3a9cc685 NS |
3156 | else |
3157 | add_decl_to_level (level, decl); | |
00e8de68 | 3158 | |
3a9cc685 | 3159 | return decl; |
00e8de68 GDR |
3160 | } |
3161 | ||
4f15a5da | 3162 | /* Record a decl-node X as belonging to the current lexical scope. |
32196b87 NS |
3163 | It's a friend if IS_FRIEND is true -- which affects exactly where |
3164 | we push it. */ | |
575bfb00 LC |
3165 | |
3166 | tree | |
4f15a5da | 3167 | pushdecl (tree x, bool is_friend) |
575bfb00 | 3168 | { |
b655c310 | 3169 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); |
32196b87 | 3170 | tree ret = do_pushdecl (x, is_friend); |
b655c310 | 3171 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); |
575bfb00 LC |
3172 | return ret; |
3173 | } | |
3174 | ||
b655c310 NS |
3175 | /* Enter DECL into the symbol table, if that's appropriate. Returns |
3176 | DECL, or a modified version thereof. */ | |
00e8de68 | 3177 | |
b655c310 NS |
3178 | tree |
3179 | maybe_push_decl (tree decl) | |
00e8de68 | 3180 | { |
b655c310 | 3181 | tree type = TREE_TYPE (decl); |
00e8de68 | 3182 | |
b655c310 NS |
3183 | /* Add this decl to the current binding level, but not if it comes |
3184 | from another scope, e.g. a static member variable. TEM may equal | |
3185 | DECL or it may be a previous decl of the same name. */ | |
3186 | if (decl == error_mark_node | |
3187 | || (TREE_CODE (decl) != PARM_DECL | |
3188 | && DECL_CONTEXT (decl) != NULL_TREE | |
3189 | /* Definitions of namespace members outside their namespace are | |
3190 | possible. */ | |
3191 | && !DECL_NAMESPACE_SCOPE_P (decl)) | |
3192 | || (TREE_CODE (decl) == TEMPLATE_DECL && !namespace_bindings_p ()) | |
3193 | || type == unknown_type_node | |
3194 | /* The declaration of a template specialization does not affect | |
3195 | the functions available for overload resolution, so we do not | |
3196 | call pushdecl. */ | |
3197 | || (TREE_CODE (decl) == FUNCTION_DECL | |
3198 | && DECL_TEMPLATE_SPECIALIZATION (decl))) | |
3199 | return decl; | |
00e8de68 | 3200 | else |
b655c310 | 3201 | return pushdecl (decl); |
00e8de68 GDR |
3202 | } |
3203 | ||
b655c310 | 3204 | /* Bind DECL to ID in the current_binding_level, assumed to be a local |
9d029ddf NS |
3205 | binding level. If IS_USING is true, DECL got here through a |
3206 | using-declaration. */ | |
00e8de68 | 3207 | |
9d029ddf NS |
3208 | static void |
3209 | push_local_binding (tree id, tree decl, bool is_using) | |
00e8de68 | 3210 | { |
b655c310 NS |
3211 | /* Skip over any local classes. This makes sense if we call |
3212 | push_local_binding with a friend decl of a local class. */ | |
3c9cca88 | 3213 | cp_binding_level *b = innermost_nonclass_level (); |
5ad4f1c8 | 3214 | |
3c9cca88 NS |
3215 | gcc_assert (b->kind != sk_namespace); |
3216 | if (find_local_binding (b, id)) | |
b655c310 NS |
3217 | { |
3218 | /* Supplement the existing binding. */ | |
3219 | if (!supplement_binding (IDENTIFIER_BINDING (id), decl)) | |
3220 | /* It didn't work. Something else must be bound at this | |
3221 | level. Do not add DECL to the list of things to pop | |
3222 | later. */ | |
3223 | return; | |
3224 | } | |
3225 | else | |
3226 | /* Create a new binding. */ | |
3227 | push_binding (id, decl, b); | |
5a167978 | 3228 | |
9d029ddf NS |
3229 | if (TREE_CODE (decl) == OVERLOAD || is_using) |
3230 | /* We must put the OVERLOAD or using into a TREE_LIST since we | |
3231 | cannot use the decl's chain itself. */ | |
b655c310 | 3232 | decl = build_tree_list (NULL_TREE, decl); |
5a167978 | 3233 | |
b655c310 NS |
3234 | /* And put DECL on the list of things declared by the current |
3235 | binding level. */ | |
9d029ddf | 3236 | add_decl_to_level (b, decl); |
5a167978 GDR |
3237 | } |
3238 | ||
b655c310 NS |
3239 | \f |
3240 | /* true means unconditionally make a BLOCK for the next level pushed. */ | |
a5e6b29b | 3241 | |
b655c310 | 3242 | static bool keep_next_level_flag; |
d5f4eddd | 3243 | |
b655c310 | 3244 | static int binding_depth = 0; |
d5f4eddd | 3245 | |
b655c310 NS |
3246 | static void |
3247 | indent (int depth) | |
d5f4eddd | 3248 | { |
b655c310 | 3249 | int i; |
d5f4eddd | 3250 | |
b655c310 NS |
3251 | for (i = 0; i < depth * 2; i++) |
3252 | putc (' ', stderr); | |
d5f4eddd JM |
3253 | } |
3254 | ||
b655c310 NS |
3255 | /* Return a string describing the kind of SCOPE we have. */ |
3256 | static const char * | |
3257 | cp_binding_level_descriptor (cp_binding_level *scope) | |
ed3cf953 | 3258 | { |
b655c310 NS |
3259 | /* The order of this table must match the "scope_kind" |
3260 | enumerators. */ | |
3261 | static const char* scope_kind_names[] = { | |
3262 | "block-scope", | |
3263 | "cleanup-scope", | |
3264 | "try-scope", | |
3265 | "catch-scope", | |
3266 | "for-scope", | |
3267 | "function-parameter-scope", | |
3268 | "class-scope", | |
3269 | "namespace-scope", | |
3270 | "template-parameter-scope", | |
3271 | "template-explicit-spec-scope" | |
3272 | }; | |
3273 | const scope_kind kind = scope->explicit_spec_p | |
3274 | ? sk_template_spec : scope->kind; | |
ed3cf953 | 3275 | |
b655c310 | 3276 | return scope_kind_names[kind]; |
ed3cf953 GDR |
3277 | } |
3278 | ||
b655c310 NS |
3279 | /* Output a debugging information about SCOPE when performing |
3280 | ACTION at LINE. */ | |
3281 | static void | |
3282 | cp_binding_level_debug (cp_binding_level *scope, int line, const char *action) | |
ed3cf953 | 3283 | { |
b655c310 NS |
3284 | const char *desc = cp_binding_level_descriptor (scope); |
3285 | if (scope->this_entity) | |
a9c697b8 | 3286 | verbatim ("%s %<%s(%E)%> %p %d", action, desc, |
b655c310 NS |
3287 | scope->this_entity, (void *) scope, line); |
3288 | else | |
a9c697b8 | 3289 | verbatim ("%s %s %p %d", action, desc, (void *) scope, line); |
ed3cf953 GDR |
3290 | } |
3291 | ||
b655c310 | 3292 | /* A chain of binding_level structures awaiting reuse. */ |
ecba6c56 | 3293 | |
b655c310 | 3294 | static GTY((deletable)) cp_binding_level *free_binding_level; |
ecba6c56 | 3295 | |
b655c310 | 3296 | /* Insert SCOPE as the innermost binding level. */ |
ecba6c56 | 3297 | |
b655c310 NS |
3298 | void |
3299 | push_binding_level (cp_binding_level *scope) | |
3300 | { | |
3301 | /* Add it to the front of currently active scopes stack. */ | |
3302 | scope->level_chain = current_binding_level; | |
3303 | current_binding_level = scope; | |
3304 | keep_next_level_flag = false; | |
3305 | ||
3306 | if (ENABLE_SCOPE_CHECKING) | |
ecba6c56 | 3307 | { |
b655c310 NS |
3308 | scope->binding_depth = binding_depth; |
3309 | indent (binding_depth); | |
3310 | cp_binding_level_debug (scope, LOCATION_LINE (input_location), | |
3311 | "push"); | |
3312 | binding_depth++; | |
ecba6c56 | 3313 | } |
ecba6c56 DS |
3314 | } |
3315 | ||
b655c310 NS |
3316 | /* Create a new KIND scope and make it the top of the active scopes stack. |
3317 | ENTITY is the scope of the associated C++ entity (namespace, class, | |
3318 | function, C++0x enumeration); it is NULL otherwise. */ | |
3a636414 | 3319 | |
b655c310 NS |
3320 | cp_binding_level * |
3321 | begin_scope (scope_kind kind, tree entity) | |
3a636414 | 3322 | { |
b655c310 | 3323 | cp_binding_level *scope; |
3a636414 | 3324 | |
b655c310 NS |
3325 | /* Reuse or create a struct for this binding level. */ |
3326 | if (!ENABLE_SCOPE_CHECKING && free_binding_level) | |
3a636414 | 3327 | { |
b655c310 NS |
3328 | scope = free_binding_level; |
3329 | free_binding_level = scope->level_chain; | |
3330 | memset (scope, 0, sizeof (cp_binding_level)); | |
3a636414 | 3331 | } |
b655c310 NS |
3332 | else |
3333 | scope = ggc_cleared_alloc<cp_binding_level> (); | |
3a636414 | 3334 | |
b655c310 NS |
3335 | scope->this_entity = entity; |
3336 | scope->more_cleanups_ok = true; | |
3337 | switch (kind) | |
3338 | { | |
3339 | case sk_cleanup: | |
3340 | scope->keep = true; | |
3341 | break; | |
a5e6b29b | 3342 | |
b655c310 NS |
3343 | case sk_template_spec: |
3344 | scope->explicit_spec_p = true; | |
3345 | kind = sk_template_parms; | |
3346 | /* Fall through. */ | |
3347 | case sk_template_parms: | |
3348 | case sk_block: | |
3349 | case sk_try: | |
3350 | case sk_catch: | |
3351 | case sk_for: | |
3352 | case sk_cond: | |
3353 | case sk_class: | |
3354 | case sk_scoped_enum: | |
3355 | case sk_function_parms: | |
3356 | case sk_transaction: | |
3357 | case sk_omp: | |
3358 | scope->keep = keep_next_level_flag; | |
3359 | break; | |
a5e6b29b | 3360 | |
b655c310 NS |
3361 | case sk_namespace: |
3362 | NAMESPACE_LEVEL (entity) = scope; | |
a5e6b29b | 3363 | break; |
b655c310 NS |
3364 | |
3365 | default: | |
3366 | /* Should not happen. */ | |
3367 | gcc_unreachable (); | |
3368 | break; | |
3369 | } | |
3370 | scope->kind = kind; | |
3371 | ||
3372 | push_binding_level (scope); | |
3373 | ||
3374 | return scope; | |
575bfb00 LC |
3375 | } |
3376 | ||
b655c310 NS |
3377 | /* We're about to leave current scope. Pop the top of the stack of |
3378 | currently active scopes. Return the enclosing scope, now active. */ | |
575bfb00 | 3379 | |
b655c310 NS |
3380 | cp_binding_level * |
3381 | leave_scope (void) | |
575bfb00 | 3382 | { |
b655c310 | 3383 | cp_binding_level *scope = current_binding_level; |
a5e6b29b | 3384 | |
b655c310 NS |
3385 | if (scope->kind == sk_namespace && class_binding_level) |
3386 | current_binding_level = class_binding_level; | |
2b8dfc07 | 3387 | |
b655c310 NS |
3388 | /* We cannot leave a scope, if there are none left. */ |
3389 | if (NAMESPACE_LEVEL (global_namespace)) | |
3390 | gcc_assert (!global_scope_p (scope)); | |
ed3cf953 | 3391 | |
b655c310 NS |
3392 | if (ENABLE_SCOPE_CHECKING) |
3393 | { | |
3394 | indent (--binding_depth); | |
3395 | cp_binding_level_debug (scope, LOCATION_LINE (input_location), | |
3396 | "leave"); | |
3397 | } | |
ed3cf953 | 3398 | |
b655c310 NS |
3399 | /* Move one nesting level up. */ |
3400 | current_binding_level = scope->level_chain; | |
3401 | ||
3402 | /* Namespace-scopes are left most probably temporarily, not | |
3403 | completely; they can be reopened later, e.g. in namespace-extension | |
3404 | or any name binding activity that requires us to resume a | |
3405 | namespace. For classes, we cache some binding levels. For other | |
3406 | scopes, we just make the structure available for reuse. */ | |
3407 | if (scope->kind != sk_namespace | |
1ab1f350 | 3408 | && scope != previous_class_level) |
00e8de68 | 3409 | { |
b655c310 NS |
3410 | scope->level_chain = free_binding_level; |
3411 | gcc_assert (!ENABLE_SCOPE_CHECKING | |
3412 | || scope->binding_depth == binding_depth); | |
3413 | free_binding_level = scope; | |
00e8de68 | 3414 | } |
b655c310 NS |
3415 | |
3416 | if (scope->kind == sk_class) | |
00e8de68 | 3417 | { |
b655c310 NS |
3418 | /* Reset DEFINING_CLASS_P to allow for reuse of a |
3419 | class-defining scope in a non-defining context. */ | |
3420 | scope->defining_class_p = 0; | |
3421 | ||
3422 | /* Find the innermost enclosing class scope, and reset | |
3423 | CLASS_BINDING_LEVEL appropriately. */ | |
3424 | class_binding_level = NULL; | |
3425 | for (scope = current_binding_level; scope; scope = scope->level_chain) | |
3426 | if (scope->kind == sk_class) | |
3427 | { | |
3428 | class_binding_level = scope; | |
3429 | break; | |
3430 | } | |
00e8de68 | 3431 | } |
b655c310 NS |
3432 | |
3433 | return current_binding_level; | |
00e8de68 | 3434 | } |
575bfb00 | 3435 | |
1ab1f350 JM |
3436 | /* When we exit a toplevel class scope, we save its binding level so |
3437 | that we can restore it quickly. Here, we've entered some other | |
3438 | class, so we must invalidate our cache. */ | |
3439 | ||
3440 | void | |
3441 | invalidate_class_lookup_cache (void) | |
3442 | { | |
3443 | previous_class_level->level_chain = free_binding_level; | |
3444 | free_binding_level = previous_class_level; | |
3445 | previous_class_level = NULL; | |
3446 | } | |
3447 | ||
b655c310 NS |
3448 | static void |
3449 | resume_scope (cp_binding_level* b) | |
575bfb00 | 3450 | { |
b655c310 NS |
3451 | /* Resuming binding levels is meant only for namespaces, |
3452 | and those cannot nest into classes. */ | |
3453 | gcc_assert (!class_binding_level); | |
3454 | /* Also, resuming a non-directly nested namespace is a no-no. */ | |
3455 | gcc_assert (b->level_chain == current_binding_level); | |
3456 | current_binding_level = b; | |
3457 | if (ENABLE_SCOPE_CHECKING) | |
3458 | { | |
3459 | b->binding_depth = binding_depth; | |
3460 | indent (binding_depth); | |
3461 | cp_binding_level_debug (b, LOCATION_LINE (input_location), "resume"); | |
3462 | binding_depth++; | |
3463 | } | |
575bfb00 LC |
3464 | } |
3465 | ||
b655c310 | 3466 | /* Return the innermost binding level that is not for a class scope. */ |
fde6f97e | 3467 | |
b655c310 NS |
3468 | static cp_binding_level * |
3469 | innermost_nonclass_level (void) | |
fde6f97e | 3470 | { |
b655c310 | 3471 | cp_binding_level *b; |
fde6f97e | 3472 | |
b655c310 NS |
3473 | b = current_binding_level; |
3474 | while (b->kind == sk_class) | |
3475 | b = b->level_chain; | |
fde6f97e | 3476 | |
b655c310 | 3477 | return b; |
fde6f97e | 3478 | } |
00e8de68 | 3479 | |
b655c310 NS |
3480 | /* We're defining an object of type TYPE. If it needs a cleanup, but |
3481 | we're not allowed to add any more objects with cleanups to the current | |
3482 | scope, create a new binding level. */ | |
a5e6b29b | 3483 | |
b655c310 NS |
3484 | void |
3485 | maybe_push_cleanup_level (tree type) | |
a5e6b29b | 3486 | { |
b655c310 NS |
3487 | if (type != error_mark_node |
3488 | && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type) | |
3489 | && current_binding_level->more_cleanups_ok == 0) | |
a5e6b29b | 3490 | { |
b655c310 NS |
3491 | begin_scope (sk_cleanup, NULL); |
3492 | current_binding_level->statement_list = push_stmt_list (); | |
3493 | } | |
3494 | } | |
a5e6b29b | 3495 | |
b655c310 | 3496 | /* Return true if we are in the global binding level. */ |
a5e6b29b | 3497 | |
b655c310 NS |
3498 | bool |
3499 | global_bindings_p (void) | |
3500 | { | |
3501 | return global_scope_p (current_binding_level); | |
3502 | } | |
a5e6b29b | 3503 | |
b655c310 NS |
3504 | /* True if we are currently in a toplevel binding level. This |
3505 | means either the global binding level or a namespace in a toplevel | |
3506 | binding level. Since there are no non-toplevel namespace levels, | |
3507 | this really means any namespace or template parameter level. We | |
3508 | also include a class whose context is toplevel. */ | |
1a32490a | 3509 | |
b655c310 NS |
3510 | bool |
3511 | toplevel_bindings_p (void) | |
3512 | { | |
3513 | cp_binding_level *b = innermost_nonclass_level (); | |
a5e6b29b | 3514 | |
b655c310 NS |
3515 | return b->kind == sk_namespace || b->kind == sk_template_parms; |
3516 | } | |
a5e6b29b | 3517 | |
b655c310 NS |
3518 | /* True if this is a namespace scope, or if we are defining a class |
3519 | which is itself at namespace scope, or whose enclosing class is | |
3520 | such a class, etc. */ | |
a5e6b29b | 3521 | |
b655c310 NS |
3522 | bool |
3523 | namespace_bindings_p (void) | |
3524 | { | |
3525 | cp_binding_level *b = innermost_nonclass_level (); | |
a5e6b29b | 3526 | |
b655c310 NS |
3527 | return b->kind == sk_namespace; |
3528 | } | |
a5e6b29b | 3529 | |
b655c310 | 3530 | /* True if the innermost non-class scope is a block scope. */ |
a5e6b29b | 3531 | |
b655c310 NS |
3532 | bool |
3533 | local_bindings_p (void) | |
3534 | { | |
3535 | cp_binding_level *b = innermost_nonclass_level (); | |
3536 | return b->kind < sk_function_parms || b->kind == sk_omp; | |
3537 | } | |
a5e6b29b | 3538 | |
b655c310 | 3539 | /* True if the current level needs to have a BLOCK made. */ |
a5e6b29b | 3540 | |
b655c310 NS |
3541 | bool |
3542 | kept_level_p (void) | |
3543 | { | |
3544 | return (current_binding_level->blocks != NULL_TREE | |
3545 | || current_binding_level->keep | |
3546 | || current_binding_level->kind == sk_cleanup | |
3547 | || current_binding_level->names != NULL_TREE | |
3548 | || current_binding_level->using_directives); | |
575bfb00 LC |
3549 | } |
3550 | ||
b655c310 | 3551 | /* Returns the kind of the innermost scope. */ |
575bfb00 | 3552 | |
b655c310 NS |
3553 | scope_kind |
3554 | innermost_scope_kind (void) | |
575bfb00 | 3555 | { |
b655c310 | 3556 | return current_binding_level->kind; |
a5e6b29b GDR |
3557 | } |
3558 | ||
b655c310 | 3559 | /* Returns true if this scope was created to store template parameters. */ |
5a167978 | 3560 | |
b655c310 NS |
3561 | bool |
3562 | template_parm_scope_p (void) | |
5a167978 | 3563 | { |
b655c310 NS |
3564 | return innermost_scope_kind () == sk_template_parms; |
3565 | } | |
7756db03 | 3566 | |
b655c310 NS |
3567 | /* If KEEP is true, make a BLOCK node for the next binding level, |
3568 | unconditionally. Otherwise, use the normal logic to decide whether | |
3569 | or not to create a BLOCK. */ | |
5a167978 | 3570 | |
b655c310 NS |
3571 | void |
3572 | keep_next_level (bool keep) | |
3573 | { | |
3574 | keep_next_level_flag = keep; | |
3575 | } | |
5a167978 | 3576 | |
9c82d7b6 | 3577 | /* Return the list of declarations of the current local scope. */ |
5a167978 | 3578 | |
b655c310 | 3579 | tree |
9c82d7b6 | 3580 | get_local_decls (void) |
b655c310 | 3581 | { |
9c82d7b6 NS |
3582 | gcc_assert (current_binding_level->kind != sk_namespace |
3583 | && current_binding_level->kind != sk_class); | |
b655c310 NS |
3584 | return current_binding_level->names; |
3585 | } | |
5a167978 | 3586 | |
b655c310 | 3587 | /* Return how many function prototypes we are currently nested inside. */ |
5a167978 | 3588 | |
b655c310 NS |
3589 | int |
3590 | function_parm_depth (void) | |
3591 | { | |
3592 | int level = 0; | |
3593 | cp_binding_level *b; | |
8597cab1 | 3594 | |
b655c310 NS |
3595 | for (b = current_binding_level; |
3596 | b->kind == sk_function_parms; | |
3597 | b = b->level_chain) | |
3598 | ++level; | |
3599 | ||
3600 | return level; | |
5a167978 GDR |
3601 | } |
3602 | ||
b655c310 NS |
3603 | /* For debugging. */ |
3604 | static int no_print_functions = 0; | |
3605 | static int no_print_builtins = 0; | |
5a167978 GDR |
3606 | |
3607 | static void | |
b655c310 | 3608 | print_binding_level (cp_binding_level* lvl) |
5a167978 | 3609 | { |
b655c310 NS |
3610 | tree t; |
3611 | int i = 0, len; | |
fbfef506 JM |
3612 | if (lvl->this_entity) |
3613 | print_node_brief (stderr, "entity=", lvl->this_entity, 1); | |
b655c310 NS |
3614 | fprintf (stderr, " blocks=%p", (void *) lvl->blocks); |
3615 | if (lvl->more_cleanups_ok) | |
3616 | fprintf (stderr, " more-cleanups-ok"); | |
3617 | if (lvl->have_cleanups) | |
3618 | fprintf (stderr, " have-cleanups"); | |
3619 | fprintf (stderr, "\n"); | |
3620 | if (lvl->names) | |
3621 | { | |
3622 | fprintf (stderr, " names:\t"); | |
3623 | /* We can probably fit 3 names to a line? */ | |
3624 | for (t = lvl->names; t; t = TREE_CHAIN (t)) | |
3625 | { | |
3626 | if (no_print_functions && (TREE_CODE (t) == FUNCTION_DECL)) | |
3627 | continue; | |
3628 | if (no_print_builtins | |
3629 | && (TREE_CODE (t) == TYPE_DECL) | |
3630 | && DECL_IS_BUILTIN (t)) | |
3631 | continue; | |
5a167978 | 3632 | |
b655c310 NS |
3633 | /* Function decls tend to have longer names. */ |
3634 | if (TREE_CODE (t) == FUNCTION_DECL) | |
3635 | len = 3; | |
3636 | else | |
3637 | len = 2; | |
3638 | i += len; | |
3639 | if (i > 6) | |
3640 | { | |
3641 | fprintf (stderr, "\n\t"); | |
3642 | i = len; | |
3643 | } | |
3644 | print_node_brief (stderr, "", t, 0); | |
3645 | if (t == error_mark_node) | |
3646 | break; | |
3647 | } | |
3648 | if (i) | |
3649 | fprintf (stderr, "\n"); | |
3650 | } | |
3651 | if (vec_safe_length (lvl->class_shadowed)) | |
5a167978 | 3652 | { |
b655c310 NS |
3653 | size_t i; |
3654 | cp_class_binding *b; | |
3655 | fprintf (stderr, " class-shadowed:"); | |
3656 | FOR_EACH_VEC_ELT (*lvl->class_shadowed, i, b) | |
3657 | fprintf (stderr, " %s ", IDENTIFIER_POINTER (b->identifier)); | |
3658 | fprintf (stderr, "\n"); | |
5a167978 | 3659 | } |
b655c310 | 3660 | if (lvl->type_shadowed) |
44fd0e80 | 3661 | { |
b655c310 NS |
3662 | fprintf (stderr, " type-shadowed:"); |
3663 | for (t = lvl->type_shadowed; t; t = TREE_CHAIN (t)) | |
3664 | { | |
3665 | fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t))); | |
3666 | } | |
3667 | fprintf (stderr, "\n"); | |
44fd0e80 | 3668 | } |
b655c310 | 3669 | } |
44fd0e80 | 3670 | |
b655c310 NS |
3671 | DEBUG_FUNCTION void |
3672 | debug (cp_binding_level &ref) | |
3673 | { | |
3674 | print_binding_level (&ref); | |
3675 | } | |
3676 | ||
3677 | DEBUG_FUNCTION void | |
3678 | debug (cp_binding_level *ptr) | |
3679 | { | |
3680 | if (ptr) | |
3681 | debug (*ptr); | |
3682 | else | |
3683 | fprintf (stderr, "<nil>\n"); | |
3684 | } | |
3685 | ||
3686 | ||
d4e15523 | 3687 | static void |
b655c310 NS |
3688 | print_other_binding_stack (cp_binding_level *stack) |
3689 | { | |
3690 | cp_binding_level *level; | |
3691 | for (level = stack; !global_scope_p (level); level = level->level_chain) | |
44fd0e80 | 3692 | { |
b655c310 NS |
3693 | fprintf (stderr, "binding level %p\n", (void *) level); |
3694 | print_binding_level (level); | |
44fd0e80 | 3695 | } |
b655c310 | 3696 | } |
44fd0e80 | 3697 | |
b655c310 NS |
3698 | void |
3699 | print_binding_stack (void) | |
3700 | { | |
3701 | cp_binding_level *b; | |
3702 | fprintf (stderr, "current_binding_level=%p\n" | |
3703 | "class_binding_level=%p\n" | |
3704 | "NAMESPACE_LEVEL (global_namespace)=%p\n", | |
3705 | (void *) current_binding_level, (void *) class_binding_level, | |
3706 | (void *) NAMESPACE_LEVEL (global_namespace)); | |
3707 | if (class_binding_level) | |
5a167978 | 3708 | { |
b655c310 NS |
3709 | for (b = class_binding_level; b; b = b->level_chain) |
3710 | if (b == current_binding_level) | |
3711 | break; | |
3712 | if (b) | |
3713 | b = class_binding_level; | |
3714 | else | |
3715 | b = current_binding_level; | |
3716 | } | |
3717 | else | |
3718 | b = current_binding_level; | |
3719 | print_other_binding_stack (b); | |
3720 | fprintf (stderr, "global:\n"); | |
3721 | print_binding_level (NAMESPACE_LEVEL (global_namespace)); | |
3722 | } | |
3723 | \f | |
3724 | /* Return the type associated with ID. */ | |
5a167978 | 3725 | |
b655c310 NS |
3726 | static tree |
3727 | identifier_type_value_1 (tree id) | |
3728 | { | |
3729 | /* There is no type with that name, anywhere. */ | |
3730 | if (REAL_IDENTIFIER_TYPE_VALUE (id) == NULL_TREE) | |
3731 | return NULL_TREE; | |
3732 | /* This is not the type marker, but the real thing. */ | |
3733 | if (REAL_IDENTIFIER_TYPE_VALUE (id) != global_type_node) | |
3734 | return REAL_IDENTIFIER_TYPE_VALUE (id); | |
3735 | /* Have to search for it. It must be on the global level, now. | |
3736 | Ask lookup_name not to return non-types. */ | |
3737 | id = lookup_name_real (id, 2, 1, /*block_p=*/true, 0, 0); | |
3738 | if (id) | |
3739 | return TREE_TYPE (id); | |
3740 | return NULL_TREE; | |
3741 | } | |
44fd0e80 | 3742 | |
b655c310 | 3743 | /* Wrapper for identifier_type_value_1. */ |
1374a761 | 3744 | |
b655c310 NS |
3745 | tree |
3746 | identifier_type_value (tree id) | |
3747 | { | |
3748 | tree ret; | |
3749 | timevar_start (TV_NAME_LOOKUP); | |
3750 | ret = identifier_type_value_1 (id); | |
3751 | timevar_stop (TV_NAME_LOOKUP); | |
3752 | return ret; | |
3753 | } | |
44fd0e80 | 3754 | |
b655c310 NS |
3755 | /* Push a definition of struct, union or enum tag named ID. into |
3756 | binding_level B. DECL is a TYPE_DECL for the type. We assume that | |
3757 | the tag ID is not already defined. */ | |
1374a761 | 3758 | |
b655c310 NS |
3759 | static void |
3760 | set_identifier_type_value_with_scope (tree id, tree decl, cp_binding_level *b) | |
3761 | { | |
3762 | tree type; | |
5a167978 | 3763 | |
b655c310 | 3764 | if (b->kind != sk_namespace) |
5a167978 | 3765 | { |
b655c310 NS |
3766 | /* Shadow the marker, not the real thing, so that the marker |
3767 | gets restored later. */ | |
3768 | tree old_type_value = REAL_IDENTIFIER_TYPE_VALUE (id); | |
3769 | b->type_shadowed | |
3770 | = tree_cons (id, old_type_value, b->type_shadowed); | |
3771 | type = decl ? TREE_TYPE (decl) : NULL_TREE; | |
3772 | TREE_TYPE (b->type_shadowed) = type; | |
19831e2b OW |
3773 | } |
3774 | else | |
3775 | { | |
3c9cca88 NS |
3776 | tree *slot = find_namespace_slot (current_namespace, id, true); |
3777 | gcc_assert (decl); | |
3778 | update_binding (b, NULL, slot, MAYBE_STAT_DECL (*slot), decl, false); | |
44fd0e80 | 3779 | |
b655c310 NS |
3780 | /* Store marker instead of real type. */ |
3781 | type = global_type_node; | |
3782 | } | |
3783 | SET_IDENTIFIER_TYPE_VALUE (id, type); | |
5a167978 GDR |
3784 | } |
3785 | ||
b655c310 NS |
3786 | /* As set_identifier_type_value_with_scope, but using |
3787 | current_binding_level. */ | |
5a167978 GDR |
3788 | |
3789 | void | |
b655c310 | 3790 | set_identifier_type_value (tree id, tree decl) |
5a167978 | 3791 | { |
b655c310 NS |
3792 | set_identifier_type_value_with_scope (id, decl, current_binding_level); |
3793 | } | |
5a167978 | 3794 | |
b655c310 | 3795 | /* Return the name for the constructor (or destructor) for the |
5fee5eca | 3796 | specified class. */ |
5a167978 | 3797 | |
b655c310 NS |
3798 | tree |
3799 | constructor_name (tree type) | |
3800 | { | |
56b2a94b NS |
3801 | tree decl = TYPE_NAME (TYPE_MAIN_VARIANT (type)); |
3802 | ||
3803 | return decl ? DECL_NAME (decl) : NULL_TREE; | |
b655c310 | 3804 | } |
5a167978 | 3805 | |
b655c310 NS |
3806 | /* Returns TRUE if NAME is the name for the constructor for TYPE, |
3807 | which must be a class type. */ | |
5a167978 | 3808 | |
b655c310 NS |
3809 | bool |
3810 | constructor_name_p (tree name, tree type) | |
3811 | { | |
b655c310 NS |
3812 | gcc_assert (MAYBE_CLASS_TYPE_P (type)); |
3813 | ||
b655c310 NS |
3814 | /* These don't have names. */ |
3815 | if (TREE_CODE (type) == DECLTYPE_TYPE | |
3816 | || TREE_CODE (type) == TYPEOF_TYPE) | |
3817 | return false; | |
3818 | ||
56b2a94b | 3819 | if (name && name == constructor_name (type)) |
b655c310 | 3820 | return true; |
5fee5eca | 3821 | |
b655c310 | 3822 | return false; |
5a167978 GDR |
3823 | } |
3824 | ||
b655c310 NS |
3825 | /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the |
3826 | caller to set DECL_CONTEXT properly. | |
87c465f5 | 3827 | |
b655c310 NS |
3828 | Note that this must only be used when X will be the new innermost |
3829 | binding for its name, as we tack it onto the front of IDENTIFIER_BINDING | |
3830 | without checking to see if the current IDENTIFIER_BINDING comes from a | |
3831 | closer binding level than LEVEL. */ | |
87c465f5 | 3832 | |
b655c310 | 3833 | static tree |
5256a7f5 | 3834 | do_pushdecl_with_scope (tree x, cp_binding_level *level, bool is_friend) |
b655c310 NS |
3835 | { |
3836 | cp_binding_level *b; | |
87c465f5 | 3837 | |
b655c310 NS |
3838 | if (level->kind == sk_class) |
3839 | { | |
3840 | b = class_binding_level; | |
3841 | class_binding_level = level; | |
3842 | pushdecl_class_level (x); | |
3843 | class_binding_level = b; | |
3844 | } | |
3845 | else | |
3846 | { | |
d04e6ed5 NS |
3847 | tree function_decl = current_function_decl; |
3848 | if (level->kind == sk_namespace) | |
3849 | current_function_decl = NULL_TREE; | |
b655c310 NS |
3850 | b = current_binding_level; |
3851 | current_binding_level = level; | |
4f15a5da | 3852 | x = pushdecl (x, is_friend); |
b655c310 | 3853 | current_binding_level = b; |
d04e6ed5 | 3854 | current_function_decl = function_decl; |
87c465f5 | 3855 | } |
b655c310 | 3856 | return x; |
87c465f5 | 3857 | } |
9e931c2a | 3858 | |
d16d5eac | 3859 | /* Inject X into the local scope just before the function parms. */ |
00e8de68 | 3860 | |
b655c310 | 3861 | tree |
d16d5eac | 3862 | pushdecl_outermost_localscope (tree x) |
00e8de68 | 3863 | { |
c8634a1a | 3864 | cp_binding_level *b = NULL; |
b655c310 | 3865 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); |
d16d5eac | 3866 | |
c8634a1a NS |
3867 | /* Find the scope just inside the function parms. */ |
3868 | for (cp_binding_level *n = current_binding_level; | |
3869 | n->kind != sk_function_parms; n = b->level_chain) | |
3870 | b = n; | |
3871 | ||
5256a7f5 | 3872 | tree ret = b ? do_pushdecl_with_scope (x, b, false) : error_mark_node; |
b655c310 | 3873 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); |
c8634a1a | 3874 | |
b655c310 | 3875 | return ret; |
00e8de68 GDR |
3876 | } |
3877 | ||
1c4320eb NS |
3878 | /* Process a local-scope or namespace-scope using declaration. LOOKUP |
3879 | is the result of qualified lookup (both value & type are | |
3880 | significant). FN_SCOPE_P indicates if we're at function-scope (as | |
3881 | opposed to namespace-scope). *VALUE_P and *TYPE_P are the current | |
3882 | bindings, which are altered to reflect the newly brought in | |
3883 | declarations. */ | |
1d786913 | 3884 | |
692af872 NS |
3885 | static bool |
3886 | do_nonmember_using_decl (name_lookup &lookup, bool fn_scope_p, | |
1c4320eb | 3887 | tree *value_p, tree *type_p) |
5a167978 | 3888 | { |
9d029ddf NS |
3889 | tree value = *value_p; |
3890 | tree type = *type_p; | |
692af872 | 3891 | bool failed = false; |
98ed9dae | 3892 | |
b655c310 NS |
3893 | /* Shift the old and new bindings around so we're comparing class and |
3894 | enumeration names to each other. */ | |
9d029ddf | 3895 | if (value && DECL_IMPLICIT_TYPEDEF_P (value)) |
5a167978 | 3896 | { |
9d029ddf NS |
3897 | type = value; |
3898 | value = NULL_TREE; | |
98ed9dae | 3899 | } |
b655c310 | 3900 | |
9d029ddf | 3901 | if (lookup.value && DECL_IMPLICIT_TYPEDEF_P (lookup.value)) |
140bec21 | 3902 | { |
9d029ddf NS |
3903 | lookup.type = lookup.value; |
3904 | lookup.value = NULL_TREE; | |
140bec21 | 3905 | } |
b655c310 | 3906 | |
692af872 NS |
3907 | if (!lookup.value) |
3908 | /* Nothing. */; | |
3909 | else if (OVL_P (lookup.value) && (!value || OVL_P (value))) | |
98ed9dae | 3910 | { |
692af872 | 3911 | for (lkp_iterator usings (lookup.value); usings; ++usings) |
b655c310 | 3912 | { |
692af872 | 3913 | tree new_fn = *usings; |
577b02d8 | 3914 | |
692af872 | 3915 | /* [namespace.udecl] |
c8094d83 | 3916 | |
692af872 NS |
3917 | If a function declaration in namespace scope or block |
3918 | scope has the same name and the same parameter types as a | |
3919 | function introduced by a using declaration the program is | |
3920 | ill-formed. */ | |
3921 | bool found = false; | |
3922 | for (ovl_iterator old (value); !found && old; ++old) | |
3923 | { | |
3924 | tree old_fn = *old; | |
3925 | ||
3926 | if (new_fn == old_fn) | |
b655c310 | 3927 | { |
692af872 NS |
3928 | /* The function already exists in the current |
3929 | namespace. */ | |
3930 | found = true; | |
3931 | break; | |
3932 | } | |
3933 | else if (old.using_p ()) | |
3934 | continue; /* This is a using decl. */ | |
3935 | else if (old.hidden_p () && !DECL_HIDDEN_FRIEND_P (old_fn)) | |
3936 | continue; /* This is an anticipated builtin. */ | |
3937 | else if (!matching_fn_p (new_fn, old_fn)) | |
3938 | continue; /* Parameters do not match. */ | |
3939 | else if (decls_match (new_fn, old_fn)) | |
3940 | { | |
3941 | /* Extern "C" in different namespaces. */ | |
3942 | found = true; | |
3943 | break; | |
3944 | } | |
3945 | else | |
3946 | { | |
3947 | diagnose_name_conflict (new_fn, old_fn); | |
3948 | failed = true; | |
3949 | found = true; | |
3950 | break; | |
b655c310 | 3951 | } |
b01e6d2b | 3952 | } |
692af872 | 3953 | |
1c4320eb | 3954 | if (!found) |
692af872 NS |
3955 | /* Unlike the decl-pushing case we don't drop anticipated |
3956 | builtins here. They don't cause a problem, and we'd | |
3957 | like to match them with a future declaration. */ | |
3958 | value = ovl_insert (new_fn, value, true); | |
98ed9dae | 3959 | } |
b655c310 | 3960 | } |
692af872 NS |
3961 | else if (value |
3962 | /* Ignore anticipated builtins. */ | |
3963 | && !anticipated_builtin_p (value) | |
3964 | && (fn_scope_p || !decls_match (lookup.value, value))) | |
3965 | { | |
3966 | diagnose_name_conflict (lookup.value, value); | |
3967 | failed = true; | |
3968 | } | |
1c4320eb | 3969 | else |
692af872 | 3970 | value = lookup.value; |
b655c310 | 3971 | |
9d029ddf | 3972 | if (lookup.type && lookup.type != type) |
b655c310 | 3973 | { |
9d029ddf | 3974 | if (type && !decls_match (lookup.type, type)) |
692af872 NS |
3975 | { |
3976 | diagnose_name_conflict (lookup.type, type); | |
3977 | failed = true; | |
3978 | } | |
1c4320eb | 3979 | else |
9d029ddf | 3980 | type = lookup.type; |
b655c310 | 3981 | } |
9d029ddf | 3982 | |
1c4320eb NS |
3983 | /* If value is empty, shift any class or enumeration name back. */ |
3984 | if (!value) | |
b655c310 | 3985 | { |
1c4320eb NS |
3986 | value = type; |
3987 | type = NULL_TREE; | |
1e9f5818 | 3988 | } |
1c4320eb NS |
3989 | *value_p = value; |
3990 | *type_p = type; | |
98ed9dae | 3991 | |
692af872 | 3992 | return failed; |
5a167978 GDR |
3993 | } |
3994 | ||
322763f5 NS |
3995 | /* Returns true if ANCESTOR encloses DESCENDANT, including matching. |
3996 | Both are namespaces. */ | |
3997 | ||
3998 | bool | |
3999 | is_nested_namespace (tree ancestor, tree descendant, bool inline_only) | |
4000 | { | |
4001 | int depth = SCOPE_DEPTH (ancestor); | |
4002 | ||
4003 | if (!depth && !inline_only) | |
4004 | /* The global namespace encloses everything. */ | |
4005 | return true; | |
4006 | ||
4007 | while (SCOPE_DEPTH (descendant) > depth | |
4008 | && (!inline_only || DECL_NAMESPACE_INLINE_P (descendant))) | |
4009 | descendant = CP_DECL_CONTEXT (descendant); | |
4010 | ||
4011 | return ancestor == descendant; | |
4012 | } | |
4013 | ||
b655c310 NS |
4014 | /* Returns true if ROOT (a namespace, class, or function) encloses |
4015 | CHILD. CHILD may be either a class type or a namespace. */ | |
575bfb00 | 4016 | |
b655c310 NS |
4017 | bool |
4018 | is_ancestor (tree root, tree child) | |
00e8de68 | 4019 | { |
b655c310 NS |
4020 | gcc_assert ((TREE_CODE (root) == NAMESPACE_DECL |
4021 | || TREE_CODE (root) == FUNCTION_DECL | |
4022 | || CLASS_TYPE_P (root))); | |
4023 | gcc_assert ((TREE_CODE (child) == NAMESPACE_DECL | |
4024 | || CLASS_TYPE_P (child))); | |
00e8de68 | 4025 | |
b655c310 NS |
4026 | /* The global namespace encloses everything. */ |
4027 | if (root == global_namespace) | |
4028 | return true; | |
00e8de68 | 4029 | |
322763f5 NS |
4030 | /* Search until we reach namespace scope. */ |
4031 | while (TREE_CODE (child) != NAMESPACE_DECL) | |
b655c310 | 4032 | { |
b655c310 NS |
4033 | /* If we've reached the ROOT, it encloses CHILD. */ |
4034 | if (root == child) | |
4035 | return true; | |
4036 | /* Go out one level. */ | |
4037 | if (TYPE_P (child)) | |
4038 | child = TYPE_NAME (child); | |
322763f5 | 4039 | child = CP_DECL_CONTEXT (child); |
b655c310 | 4040 | } |
322763f5 NS |
4041 | |
4042 | if (TREE_CODE (root) == NAMESPACE_DECL) | |
4043 | return is_nested_namespace (root, child); | |
4044 | ||
4045 | return false; | |
575bfb00 LC |
4046 | } |
4047 | ||
b655c310 NS |
4048 | /* Enter the class or namespace scope indicated by T suitable for name |
4049 | lookup. T can be arbitrary scope, not necessary nested inside the | |
4050 | current scope. Returns a non-null scope to pop iff pop_scope | |
4051 | should be called later to exit this scope. */ | |
ed3cf953 | 4052 | |
b655c310 NS |
4053 | tree |
4054 | push_scope (tree t) | |
ed3cf953 | 4055 | { |
b655c310 NS |
4056 | if (TREE_CODE (t) == NAMESPACE_DECL) |
4057 | push_decl_namespace (t); | |
4058 | else if (CLASS_TYPE_P (t)) | |
4059 | { | |
4060 | if (!at_class_scope_p () | |
4061 | || !same_type_p (current_class_type, t)) | |
4062 | push_nested_class (t); | |
4063 | else | |
4064 | /* T is the same as the current scope. There is therefore no | |
4065 | need to re-enter the scope. Since we are not actually | |
4066 | pushing a new scope, our caller should not call | |
4067 | pop_scope. */ | |
4068 | t = NULL_TREE; | |
4069 | } | |
ed3cf953 | 4070 | |
b655c310 | 4071 | return t; |
575bfb00 LC |
4072 | } |
4073 | ||
b655c310 | 4074 | /* Leave scope pushed by push_scope. */ |
575bfb00 LC |
4075 | |
4076 | void | |
b655c310 | 4077 | pop_scope (tree t) |
575bfb00 | 4078 | { |
b655c310 NS |
4079 | if (t == NULL_TREE) |
4080 | return; | |
4081 | if (TREE_CODE (t) == NAMESPACE_DECL) | |
4082 | pop_decl_namespace (); | |
4083 | else if CLASS_TYPE_P (t) | |
4084 | pop_nested_class (); | |
ed3cf953 GDR |
4085 | } |
4086 | ||
b655c310 | 4087 | /* Subroutine of push_inner_scope. */ |
5a167978 | 4088 | |
b655c310 NS |
4089 | static void |
4090 | push_inner_scope_r (tree outer, tree inner) | |
5a167978 | 4091 | { |
b655c310 | 4092 | tree prev; |
5ae9ba3e | 4093 | |
b655c310 NS |
4094 | if (outer == inner |
4095 | || (TREE_CODE (inner) != NAMESPACE_DECL && !CLASS_TYPE_P (inner))) | |
abc088aa | 4096 | return; |
b655c310 NS |
4097 | |
4098 | prev = CP_DECL_CONTEXT (TREE_CODE (inner) == NAMESPACE_DECL ? inner : TYPE_NAME (inner)); | |
4099 | if (outer != prev) | |
4100 | push_inner_scope_r (outer, prev); | |
4101 | if (TREE_CODE (inner) == NAMESPACE_DECL) | |
5ae9ba3e | 4102 | { |
b655c310 NS |
4103 | cp_binding_level *save_template_parm = 0; |
4104 | /* Temporary take out template parameter scopes. They are saved | |
4105 | in reversed order in save_template_parm. */ | |
4106 | while (current_binding_level->kind == sk_template_parms) | |
160594b0 | 4107 | { |
b655c310 NS |
4108 | cp_binding_level *b = current_binding_level; |
4109 | current_binding_level = b->level_chain; | |
4110 | b->level_chain = save_template_parm; | |
4111 | save_template_parm = b; | |
160594b0 | 4112 | } |
b655c310 NS |
4113 | |
4114 | resume_scope (NAMESPACE_LEVEL (inner)); | |
4115 | current_namespace = inner; | |
4116 | ||
4117 | /* Restore template parameter scopes. */ | |
4118 | while (save_template_parm) | |
160594b0 | 4119 | { |
b655c310 NS |
4120 | cp_binding_level *b = save_template_parm; |
4121 | save_template_parm = b->level_chain; | |
4122 | b->level_chain = current_binding_level; | |
4123 | current_binding_level = b; | |
160594b0 | 4124 | } |
5ae9ba3e | 4125 | } |
b655c310 NS |
4126 | else |
4127 | pushclass (inner); | |
c8094d83 | 4128 | } |
5a167978 | 4129 | |
b655c310 NS |
4130 | /* Enter the scope INNER from current scope. INNER must be a scope |
4131 | nested inside current scope. This works with both name lookup and | |
4132 | pushing name into scope. In case a template parameter scope is present, | |
4133 | namespace is pushed under the template parameter scope according to | |
4134 | name lookup rule in 14.6.1/6. | |
4135 | ||
4136 | Return the former current scope suitable for pop_inner_scope. */ | |
5a167978 | 4137 | |
ae099258 | 4138 | tree |
b655c310 | 4139 | push_inner_scope (tree inner) |
5a167978 | 4140 | { |
b655c310 NS |
4141 | tree outer = current_scope (); |
4142 | if (!outer) | |
4143 | outer = current_namespace; | |
5a167978 | 4144 | |
b655c310 NS |
4145 | push_inner_scope_r (outer, inner); |
4146 | return outer; | |
5a167978 GDR |
4147 | } |
4148 | ||
b655c310 | 4149 | /* Exit the current scope INNER back to scope OUTER. */ |
00e8de68 | 4150 | |
b655c310 NS |
4151 | void |
4152 | pop_inner_scope (tree outer, tree inner) | |
0ed5edac | 4153 | { |
b655c310 NS |
4154 | if (outer == inner |
4155 | || (TREE_CODE (inner) != NAMESPACE_DECL && !CLASS_TYPE_P (inner))) | |
4156 | return; | |
0ed5edac | 4157 | |
b655c310 | 4158 | while (outer != inner) |
65567efa | 4159 | { |
b655c310 | 4160 | if (TREE_CODE (inner) == NAMESPACE_DECL) |
65567efa | 4161 | { |
b655c310 NS |
4162 | cp_binding_level *save_template_parm = 0; |
4163 | /* Temporary take out template parameter scopes. They are saved | |
4164 | in reversed order in save_template_parm. */ | |
4165 | while (current_binding_level->kind == sk_template_parms) | |
65567efa | 4166 | { |
b655c310 NS |
4167 | cp_binding_level *b = current_binding_level; |
4168 | current_binding_level = b->level_chain; | |
4169 | b->level_chain = save_template_parm; | |
4170 | save_template_parm = b; | |
65567efa JM |
4171 | } |
4172 | ||
b655c310 | 4173 | pop_namespace (); |
65567efa | 4174 | |
b655c310 NS |
4175 | /* Restore template parameter scopes. */ |
4176 | while (save_template_parm) | |
7cb73573 | 4177 | { |
b655c310 NS |
4178 | cp_binding_level *b = save_template_parm; |
4179 | save_template_parm = b->level_chain; | |
4180 | b->level_chain = current_binding_level; | |
4181 | current_binding_level = b; | |
7cb73573 | 4182 | } |
e3501bab | 4183 | } |
65567efa | 4184 | else |
b655c310 NS |
4185 | popclass (); |
4186 | ||
4187 | inner = CP_DECL_CONTEXT (TREE_CODE (inner) == NAMESPACE_DECL ? inner : TYPE_NAME (inner)); | |
65567efa | 4188 | } |
b655c310 NS |
4189 | } |
4190 | \f | |
4191 | /* Do a pushlevel for class declarations. */ | |
65567efa | 4192 | |
b655c310 NS |
4193 | void |
4194 | pushlevel_class (void) | |
4195 | { | |
4196 | class_binding_level = begin_scope (sk_class, current_class_type); | |
65567efa | 4197 | } |
0ed5edac | 4198 | |
b655c310 NS |
4199 | /* ...and a poplevel for class declarations. */ |
4200 | ||
4201 | void | |
4202 | poplevel_class (void) | |
00e8de68 | 4203 | { |
b655c310 NS |
4204 | cp_binding_level *level = class_binding_level; |
4205 | cp_class_binding *cb; | |
4206 | size_t i; | |
4207 | tree shadowed; | |
00e8de68 | 4208 | |
575bfb00 | 4209 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); |
b655c310 | 4210 | gcc_assert (level != 0); |
c8094d83 | 4211 | |
b655c310 NS |
4212 | /* If we're leaving a toplevel class, cache its binding level. */ |
4213 | if (current_class_depth == 1) | |
4214 | previous_class_level = level; | |
4215 | for (shadowed = level->type_shadowed; | |
4216 | shadowed; | |
4217 | shadowed = TREE_CHAIN (shadowed)) | |
4218 | SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed), TREE_VALUE (shadowed)); | |
00e8de68 | 4219 | |
b655c310 NS |
4220 | /* Remove the bindings for all of the class-level declarations. */ |
4221 | if (level->class_shadowed) | |
00e8de68 | 4222 | { |
b655c310 | 4223 | FOR_EACH_VEC_ELT (*level->class_shadowed, i, cb) |
0cbd7506 | 4224 | { |
b655c310 NS |
4225 | IDENTIFIER_BINDING (cb->identifier) = cb->base->previous; |
4226 | cxx_binding_free (cb->base); | |
0cbd7506 | 4227 | } |
b655c310 NS |
4228 | ggc_free (level->class_shadowed); |
4229 | level->class_shadowed = NULL; | |
00e8de68 GDR |
4230 | } |
4231 | ||
b655c310 NS |
4232 | /* Now, pop out of the binding level which we created up in the |
4233 | `pushlevel_class' routine. */ | |
4234 | gcc_assert (current_binding_level == level); | |
4235 | leave_scope (); | |
4236 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); | |
4237 | } | |
4238 | ||
4239 | /* Set INHERITED_VALUE_BINDING_P on BINDING to true or false, as | |
4240 | appropriate. DECL is the value to which a name has just been | |
4241 | bound. CLASS_TYPE is the class in which the lookup occurred. */ | |
4242 | ||
4243 | static void | |
4244 | set_inherited_value_binding_p (cxx_binding *binding, tree decl, | |
4245 | tree class_type) | |
4246 | { | |
4247 | if (binding->value == decl && TREE_CODE (decl) != TREE_LIST) | |
00e8de68 | 4248 | { |
b655c310 NS |
4249 | tree context; |
4250 | ||
4251 | if (TREE_CODE (decl) == OVERLOAD) | |
4252 | context = ovl_scope (decl); | |
b9e75696 | 4253 | else |
ed36980c | 4254 | { |
b655c310 NS |
4255 | gcc_assert (DECL_P (decl)); |
4256 | context = context_for_name_lookup (decl); | |
ed36980c | 4257 | } |
00e8de68 | 4258 | |
b655c310 NS |
4259 | if (is_properly_derived_from (class_type, context)) |
4260 | INHERITED_VALUE_BINDING_P (binding) = 1; | |
4261 | else | |
4262 | INHERITED_VALUE_BINDING_P (binding) = 0; | |
4263 | } | |
4264 | else if (binding->value == decl) | |
4265 | /* We only encounter a TREE_LIST when there is an ambiguity in the | |
4266 | base classes. Such an ambiguity can be overridden by a | |
4267 | definition in this class. */ | |
4268 | INHERITED_VALUE_BINDING_P (binding) = 1; | |
4269 | else | |
4270 | INHERITED_VALUE_BINDING_P (binding) = 0; | |
00e8de68 GDR |
4271 | } |
4272 | ||
b655c310 | 4273 | /* Make the declaration of X appear in CLASS scope. */ |
00e8de68 | 4274 | |
b655c310 NS |
4275 | bool |
4276 | pushdecl_class_level (tree x) | |
00e8de68 | 4277 | { |
b655c310 NS |
4278 | bool is_valid = true; |
4279 | bool subtime; | |
00e8de68 | 4280 | |
b655c310 NS |
4281 | /* Do nothing if we're adding to an outer lambda closure type, |
4282 | outer_binding will add it later if it's needed. */ | |
4283 | if (current_class_type != class_binding_level->this_entity) | |
4284 | return true; | |
00e8de68 | 4285 | |
b655c310 NS |
4286 | subtime = timevar_cond_start (TV_NAME_LOOKUP); |
4287 | /* Get the name of X. */ | |
848bf88d | 4288 | tree name = OVL_NAME (x); |
00e8de68 | 4289 | |
b655c310 | 4290 | if (name) |
00e8de68 | 4291 | { |
b655c310 NS |
4292 | is_valid = push_class_level_binding (name, x); |
4293 | if (TREE_CODE (x) == TYPE_DECL) | |
4294 | set_identifier_type_value (name, x); | |
00e8de68 | 4295 | } |
b655c310 NS |
4296 | else if (ANON_AGGR_TYPE_P (TREE_TYPE (x))) |
4297 | { | |
4298 | /* If X is an anonymous aggregate, all of its members are | |
4299 | treated as if they were members of the class containing the | |
4300 | aggregate, for naming purposes. */ | |
6f87580f NS |
4301 | location_t save_location = input_location; |
4302 | tree anon = TREE_TYPE (x); | |
4303 | if (vec<tree, va_gc> *member_vec = CLASSTYPE_MEMBER_VEC (anon)) | |
4304 | for (unsigned ix = member_vec->length (); ix--;) | |
4305 | { | |
4306 | tree binding = (*member_vec)[ix]; | |
4307 | if (STAT_HACK_P (binding)) | |
4308 | { | |
4309 | if (!pushdecl_class_level (STAT_TYPE (binding))) | |
4310 | is_valid = false; | |
4311 | binding = STAT_DECL (binding); | |
4312 | } | |
4313 | if (!pushdecl_class_level (binding)) | |
4314 | is_valid = false; | |
b655c310 | 4315 | } |
6f87580f NS |
4316 | else |
4317 | for (tree f = TYPE_FIELDS (anon); f; f = DECL_CHAIN (f)) | |
4318 | if (TREE_CODE (f) == FIELD_DECL) | |
4319 | { | |
4320 | input_location = DECL_SOURCE_LOCATION (f); | |
4321 | if (!pushdecl_class_level (f)) | |
4322 | is_valid = false; | |
4323 | } | |
4324 | input_location = save_location; | |
b655c310 | 4325 | } |
575bfb00 | 4326 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); |
b655c310 | 4327 | return is_valid; |
00e8de68 GDR |
4328 | } |
4329 | ||
b655c310 NS |
4330 | /* Return the BINDING (if any) for NAME in SCOPE, which is a class |
4331 | scope. If the value returned is non-NULL, and the PREVIOUS field | |
4332 | is not set, callers must set the PREVIOUS field explicitly. */ | |
5a167978 | 4333 | |
b655c310 NS |
4334 | static cxx_binding * |
4335 | get_class_binding (tree name, cp_binding_level *scope) | |
5a167978 | 4336 | { |
b655c310 NS |
4337 | tree class_type; |
4338 | tree type_binding; | |
4339 | tree value_binding; | |
4340 | cxx_binding *binding; | |
5a167978 | 4341 | |
b655c310 | 4342 | class_type = scope->this_entity; |
5a167978 | 4343 | |
b655c310 NS |
4344 | /* Get the type binding. */ |
4345 | type_binding = lookup_member (class_type, name, | |
4346 | /*protect=*/2, /*want_type=*/true, | |
4347 | tf_warning_or_error); | |
4348 | /* Get the value binding. */ | |
4349 | value_binding = lookup_member (class_type, name, | |
4350 | /*protect=*/2, /*want_type=*/false, | |
4351 | tf_warning_or_error); | |
5a167978 | 4352 | |
b655c310 NS |
4353 | if (value_binding |
4354 | && (TREE_CODE (value_binding) == TYPE_DECL | |
4355 | || DECL_CLASS_TEMPLATE_P (value_binding) | |
4356 | || (TREE_CODE (value_binding) == TREE_LIST | |
4357 | && TREE_TYPE (value_binding) == error_mark_node | |
4358 | && (TREE_CODE (TREE_VALUE (value_binding)) | |
4359 | == TYPE_DECL)))) | |
4360 | /* We found a type binding, even when looking for a non-type | |
4361 | binding. This means that we already processed this binding | |
4362 | above. */ | |
4363 | ; | |
4364 | else if (value_binding) | |
4365 | { | |
4366 | if (TREE_CODE (value_binding) == TREE_LIST | |
4367 | && TREE_TYPE (value_binding) == error_mark_node) | |
4368 | /* NAME is ambiguous. */ | |
4369 | ; | |
4370 | else if (BASELINK_P (value_binding)) | |
4371 | /* NAME is some overloaded functions. */ | |
4372 | value_binding = BASELINK_FUNCTIONS (value_binding); | |
4373 | } | |
5a167978 | 4374 | |
b655c310 NS |
4375 | /* If we found either a type binding or a value binding, create a |
4376 | new binding object. */ | |
4377 | if (type_binding || value_binding) | |
4378 | { | |
4379 | binding = new_class_binding (name, | |
4380 | value_binding, | |
4381 | type_binding, | |
4382 | scope); | |
4383 | /* This is a class-scope binding, not a block-scope binding. */ | |
4384 | LOCAL_BINDING_P (binding) = 0; | |
4385 | set_inherited_value_binding_p (binding, value_binding, class_type); | |
4386 | } | |
575bfb00 | 4387 | else |
b655c310 NS |
4388 | binding = NULL; |
4389 | ||
4390 | return binding; | |
575bfb00 LC |
4391 | } |
4392 | ||
b655c310 NS |
4393 | /* Make the declaration(s) of X appear in CLASS scope under the name |
4394 | NAME. Returns true if the binding is valid. */ | |
575bfb00 | 4395 | |
b655c310 NS |
4396 | static bool |
4397 | push_class_level_binding_1 (tree name, tree x) | |
575bfb00 | 4398 | { |
b655c310 NS |
4399 | cxx_binding *binding; |
4400 | tree decl = x; | |
4401 | bool ok; | |
5a167978 | 4402 | |
b655c310 NS |
4403 | /* The class_binding_level will be NULL if x is a template |
4404 | parameter name in a member template. */ | |
4405 | if (!class_binding_level) | |
4406 | return true; | |
5a167978 | 4407 | |
b655c310 NS |
4408 | if (name == error_mark_node) |
4409 | return false; | |
166206ce | 4410 | |
b655c310 NS |
4411 | /* Can happen for an erroneous declaration (c++/60384). */ |
4412 | if (!identifier_p (name)) | |
4413 | { | |
4414 | gcc_assert (errorcount || sorrycount); | |
4415 | return false; | |
4416 | } | |
5a167978 | 4417 | |
b655c310 NS |
4418 | /* Check for invalid member names. But don't worry about a default |
4419 | argument-scope lambda being pushed after the class is complete. */ | |
4420 | gcc_assert (TYPE_BEING_DEFINED (current_class_type) | |
4421 | || LAMBDA_TYPE_P (TREE_TYPE (decl))); | |
4422 | /* Check that we're pushing into the right binding level. */ | |
4423 | gcc_assert (current_class_type == class_binding_level->this_entity); | |
5a167978 | 4424 | |
b655c310 NS |
4425 | /* We could have been passed a tree list if this is an ambiguous |
4426 | declaration. If so, pull the declaration out because | |
4427 | check_template_shadow will not handle a TREE_LIST. */ | |
4428 | if (TREE_CODE (decl) == TREE_LIST | |
4429 | && TREE_TYPE (decl) == error_mark_node) | |
4430 | decl = TREE_VALUE (decl); | |
6097b0c3 | 4431 | |
b655c310 NS |
4432 | if (!check_template_shadow (decl)) |
4433 | return false; | |
5a167978 | 4434 | |
b655c310 | 4435 | /* [class.mem] |
00e8de68 | 4436 | |
b655c310 NS |
4437 | If T is the name of a class, then each of the following shall |
4438 | have a name different from T: | |
00e8de68 | 4439 | |
b655c310 | 4440 | -- every static data member of class T; |
00e8de68 | 4441 | |
b655c310 NS |
4442 | -- every member of class T that is itself a type; |
4443 | ||
4444 | -- every enumerator of every member of class T that is an | |
4445 | enumerated type; | |
4446 | ||
4447 | -- every member of every anonymous union that is a member of | |
4448 | class T. | |
4449 | ||
4450 | (Non-static data members were also forbidden to have the same | |
4451 | name as T until TC1.) */ | |
4452 | if ((VAR_P (x) | |
4453 | || TREE_CODE (x) == CONST_DECL | |
4454 | || (TREE_CODE (x) == TYPE_DECL | |
4455 | && !DECL_SELF_REFERENCE_P (x)) | |
4456 | /* A data member of an anonymous union. */ | |
4457 | || (TREE_CODE (x) == FIELD_DECL | |
4458 | && DECL_CONTEXT (x) != current_class_type)) | |
56b2a94b | 4459 | && DECL_NAME (x) == DECL_NAME (TYPE_NAME (current_class_type))) |
b655c310 NS |
4460 | { |
4461 | tree scope = context_for_name_lookup (x); | |
4462 | if (TYPE_P (scope) && same_type_p (scope, current_class_type)) | |
4463 | { | |
f5fc32e4 PC |
4464 | error_at (DECL_SOURCE_LOCATION (x), |
4465 | "%qD has the same name as the class in which it is " | |
4466 | "declared", x); | |
b655c310 NS |
4467 | return false; |
4468 | } | |
4469 | } | |
4470 | ||
4471 | /* Get the current binding for NAME in this class, if any. */ | |
4472 | binding = IDENTIFIER_BINDING (name); | |
4473 | if (!binding || binding->scope != class_binding_level) | |
00e8de68 | 4474 | { |
b655c310 NS |
4475 | binding = get_class_binding (name, class_binding_level); |
4476 | /* If a new binding was created, put it at the front of the | |
4477 | IDENTIFIER_BINDING list. */ | |
4478 | if (binding) | |
0cbd7506 | 4479 | { |
b655c310 NS |
4480 | binding->previous = IDENTIFIER_BINDING (name); |
4481 | IDENTIFIER_BINDING (name) = binding; | |
0cbd7506 | 4482 | } |
b655c310 NS |
4483 | } |
4484 | ||
4485 | /* If there is already a binding, then we may need to update the | |
4486 | current value. */ | |
4487 | if (binding && binding->value) | |
4488 | { | |
4489 | tree bval = binding->value; | |
4490 | tree old_decl = NULL_TREE; | |
4491 | tree target_decl = strip_using_decl (decl); | |
4492 | tree target_bval = strip_using_decl (bval); | |
4493 | ||
4494 | if (INHERITED_VALUE_BINDING_P (binding)) | |
0cbd7506 | 4495 | { |
b655c310 NS |
4496 | /* If the old binding was from a base class, and was for a |
4497 | tag name, slide it over to make room for the new binding. | |
4498 | The old binding is still visible if explicitly qualified | |
4499 | with a class-key. */ | |
4500 | if (TREE_CODE (target_bval) == TYPE_DECL | |
4501 | && DECL_ARTIFICIAL (target_bval) | |
4502 | && !(TREE_CODE (target_decl) == TYPE_DECL | |
4503 | && DECL_ARTIFICIAL (target_decl))) | |
4504 | { | |
4505 | old_decl = binding->type; | |
4506 | binding->type = bval; | |
4507 | binding->value = NULL_TREE; | |
4508 | INHERITED_VALUE_BINDING_P (binding) = 0; | |
4509 | } | |
4510 | else | |
4511 | { | |
4512 | old_decl = bval; | |
4513 | /* Any inherited type declaration is hidden by the type | |
4514 | declaration in the derived class. */ | |
4515 | if (TREE_CODE (target_decl) == TYPE_DECL | |
4516 | && DECL_ARTIFICIAL (target_decl)) | |
4517 | binding->type = NULL_TREE; | |
4518 | } | |
00e8de68 | 4519 | } |
b655c310 NS |
4520 | else if (TREE_CODE (decl) == USING_DECL |
4521 | && TREE_CODE (bval) == USING_DECL | |
4522 | && same_type_p (USING_DECL_SCOPE (decl), | |
4523 | USING_DECL_SCOPE (bval))) | |
4524 | /* This is a using redeclaration that will be diagnosed later | |
4525 | in supplement_binding */ | |
4526 | ; | |
4527 | else if (TREE_CODE (decl) == USING_DECL | |
4528 | && TREE_CODE (bval) == USING_DECL | |
4529 | && DECL_DEPENDENT_P (decl) | |
4530 | && DECL_DEPENDENT_P (bval)) | |
4531 | return true; | |
4532 | else if (TREE_CODE (decl) == USING_DECL | |
5256a7f5 | 4533 | && OVL_P (target_bval)) |
b655c310 NS |
4534 | old_decl = bval; |
4535 | else if (TREE_CODE (bval) == USING_DECL | |
5256a7f5 | 4536 | && OVL_P (target_decl)) |
b655c310 | 4537 | return true; |
c735f8f1 JM |
4538 | else if (OVL_P (target_decl) |
4539 | && OVL_P (target_bval)) | |
4540 | old_decl = bval; | |
b655c310 NS |
4541 | |
4542 | if (old_decl && binding->scope == class_binding_level) | |
0cbd7506 | 4543 | { |
b655c310 NS |
4544 | binding->value = x; |
4545 | /* It is always safe to clear INHERITED_VALUE_BINDING_P | |
4546 | here. This function is only used to register bindings | |
4547 | from with the class definition itself. */ | |
4548 | INHERITED_VALUE_BINDING_P (binding) = 0; | |
4549 | return true; | |
0cbd7506 | 4550 | } |
00e8de68 | 4551 | } |
00e8de68 | 4552 | |
b655c310 NS |
4553 | /* Note that we declared this value so that we can issue an error if |
4554 | this is an invalid redeclaration of a name already used for some | |
4555 | other purpose. */ | |
4556 | note_name_declared_in_class (name, decl); | |
575bfb00 | 4557 | |
b655c310 NS |
4558 | /* If we didn't replace an existing binding, put the binding on the |
4559 | stack of bindings for the identifier, and update the shadowed | |
4560 | list. */ | |
4561 | if (binding && binding->scope == class_binding_level) | |
4562 | /* Supplement the existing binding. */ | |
4563 | ok = supplement_binding (binding, decl); | |
4564 | else | |
5a167978 | 4565 | { |
b655c310 NS |
4566 | /* Create a new binding. */ |
4567 | push_binding (name, decl, class_binding_level); | |
4568 | ok = true; | |
5a167978 GDR |
4569 | } |
4570 | ||
b655c310 | 4571 | return ok; |
575bfb00 LC |
4572 | } |
4573 | ||
b655c310 | 4574 | /* Wrapper for push_class_level_binding_1. */ |
575bfb00 | 4575 | |
b655c310 NS |
4576 | bool |
4577 | push_class_level_binding (tree name, tree x) | |
575bfb00 | 4578 | { |
b655c310 | 4579 | bool ret; |
575bfb00 | 4580 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); |
b655c310 | 4581 | ret = push_class_level_binding_1 (name, x); |
575bfb00 | 4582 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); |
b655c310 | 4583 | return ret; |
5a167978 GDR |
4584 | } |
4585 | ||
b655c310 NS |
4586 | /* Process "using SCOPE::NAME" in a class scope. Return the |
4587 | USING_DECL created. */ | |
5a167978 | 4588 | |
b655c310 NS |
4589 | tree |
4590 | do_class_using_decl (tree scope, tree name) | |
5a167978 | 4591 | { |
b655c310 NS |
4592 | if (name == error_mark_node) |
4593 | return NULL_TREE; | |
166206ce | 4594 | |
b655c310 NS |
4595 | if (!scope || !TYPE_P (scope)) |
4596 | { | |
4597 | error ("using-declaration for non-member at class scope"); | |
4598 | return NULL_TREE; | |
4599 | } | |
166206ce | 4600 | |
b655c310 NS |
4601 | /* Make sure the name is not invalid */ |
4602 | if (TREE_CODE (name) == BIT_NOT_EXPR) | |
6097b0c3 | 4603 | { |
b655c310 NS |
4604 | error ("%<%T::%D%> names destructor", scope, name); |
4605 | return NULL_TREE; | |
6097b0c3 | 4606 | } |
0c29f2a2 | 4607 | |
b655c310 NS |
4608 | /* Using T::T declares inheriting ctors, even if T is a typedef. */ |
4609 | if (MAYBE_CLASS_TYPE_P (scope) | |
4610 | && (name == TYPE_IDENTIFIER (scope) | |
4611 | || constructor_name_p (name, scope))) | |
6097b0c3 | 4612 | { |
b655c310 NS |
4613 | maybe_warn_cpp0x (CPP0X_INHERITING_CTORS); |
4614 | name = ctor_identifier; | |
4615 | CLASSTYPE_NON_AGGREGATE (current_class_type) = true; | |
ac308262 | 4616 | TYPE_HAS_USER_CONSTRUCTOR (current_class_type) = true; |
d19c0f4b | 4617 | } |
0c29f2a2 NS |
4618 | |
4619 | /* Cannot introduce a constructor name. */ | |
b655c310 NS |
4620 | if (constructor_name_p (name, current_class_type)) |
4621 | { | |
4622 | error ("%<%T::%D%> names constructor in %qT", | |
4623 | scope, name, current_class_type); | |
4624 | return NULL_TREE; | |
4625 | } | |
4626 | ||
b655c310 | 4627 | /* From [namespace.udecl]: |
1b255e8f | 4628 | |
b655c310 NS |
4629 | A using-declaration used as a member-declaration shall refer to a |
4630 | member of a base class of the class being defined. | |
4631 | ||
4632 | In general, we cannot check this constraint in a template because | |
4633 | we do not know the entire set of base classes of the current | |
4634 | class type. Morover, if SCOPE is dependent, it might match a | |
4635 | non-dependent base. */ | |
4636 | ||
0c29f2a2 NS |
4637 | tree decl = NULL_TREE; |
4638 | if (!dependent_scope_p (scope)) | |
86098eb8 | 4639 | { |
b655c310 | 4640 | base_kind b_kind; |
0c29f2a2 NS |
4641 | tree binfo = lookup_base (current_class_type, scope, ba_any, &b_kind, |
4642 | tf_warning_or_error); | |
b655c310 | 4643 | if (b_kind < bk_proper_base) |
86098eb8 | 4644 | { |
0c29f2a2 NS |
4645 | /* If there are dependent bases, scope might resolve at |
4646 | instantiation time, even if it isn't exactly one of the | |
4647 | dependent bases. */ | |
4648 | if (b_kind == bk_same_type || !any_dependent_bases_p ()) | |
9deb204a | 4649 | { |
b655c310 NS |
4650 | error_not_base_type (scope, current_class_type); |
4651 | return NULL_TREE; | |
9deb204a | 4652 | } |
86098eb8 | 4653 | } |
84eb0f1a | 4654 | else if (name == ctor_identifier && !binfo_direct_p (binfo)) |
b655c310 NS |
4655 | { |
4656 | error ("cannot inherit constructors from indirect base %qT", scope); | |
4657 | return NULL_TREE; | |
4658 | } | |
0c29f2a2 NS |
4659 | else if (!IDENTIFIER_CONV_OP_P (name) |
4660 | || !dependent_type_p (TREE_TYPE (name))) | |
b655c310 NS |
4661 | { |
4662 | decl = lookup_member (binfo, name, 0, false, tf_warning_or_error); | |
4663 | if (!decl) | |
4664 | { | |
4665 | error ("no members matching %<%T::%D%> in %q#T", scope, name, | |
4666 | scope); | |
4667 | return NULL_TREE; | |
4668 | } | |
0c29f2a2 | 4669 | |
b655c310 NS |
4670 | /* The binfo from which the functions came does not matter. */ |
4671 | if (BASELINK_P (decl)) | |
4672 | decl = BASELINK_FUNCTIONS (decl); | |
4673 | } | |
86098eb8 | 4674 | } |
86098eb8 | 4675 | |
0c29f2a2 | 4676 | tree value = build_lang_decl (USING_DECL, name, NULL_TREE); |
b655c310 NS |
4677 | USING_DECL_DECLS (value) = decl; |
4678 | USING_DECL_SCOPE (value) = scope; | |
4679 | DECL_DEPENDENT_P (value) = !decl; | |
a5e6b29b | 4680 | |
b655c310 | 4681 | return value; |
a5e6b29b GDR |
4682 | } |
4683 | ||
b655c310 | 4684 | \f |
4b4b2e58 NS |
4685 | /* Return the binding for NAME in NS. If NS is NULL, look in |
4686 | global_namespace. */ | |
4687 | ||
a5e6b29b | 4688 | tree |
06aa5490 | 4689 | get_namespace_binding (tree ns, tree name) |
a5e6b29b | 4690 | { |
b655c310 | 4691 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); |
4b4b2e58 NS |
4692 | if (!ns) |
4693 | ns = global_namespace; | |
3c9cca88 NS |
4694 | gcc_checking_assert (!DECL_NAMESPACE_ALIAS (ns)); |
4695 | tree ret = find_namespace_value (ns, name); | |
b655c310 | 4696 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); |
3c9cca88 | 4697 | return ret; |
5a167978 GDR |
4698 | } |
4699 | ||
87e3d7cf NS |
4700 | /* Push internal DECL into the global namespace. Does not do the |
4701 | full overload fn handling and does not add it to the list of things | |
4702 | in the namespace. */ | |
1e003829 | 4703 | |
b655c310 | 4704 | void |
87e3d7cf | 4705 | set_global_binding (tree decl) |
1e003829 | 4706 | { |
b655c310 | 4707 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); |
4b4b2e58 | 4708 | |
87e3d7cf | 4709 | tree *slot = find_namespace_slot (global_namespace, DECL_NAME (decl), true); |
3c9cca88 | 4710 | |
a6a5091a NS |
4711 | if (*slot) |
4712 | /* The user's placed something in the implementor's namespace. */ | |
4713 | diagnose_name_conflict (decl, MAYBE_STAT_DECL (*slot)); | |
4714 | ||
4715 | /* Force the binding, so compiler internals continue to work. */ | |
4716 | *slot = decl; | |
4b4b2e58 | 4717 | |
b655c310 | 4718 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); |
1e003829 JM |
4719 | } |
4720 | ||
b655c310 NS |
4721 | /* Set the context of a declaration to scope. Complain if we are not |
4722 | outside scope. */ | |
5a167978 | 4723 | |
b655c310 NS |
4724 | void |
4725 | set_decl_namespace (tree decl, tree scope, bool friendp) | |
5a167978 | 4726 | { |
b655c310 NS |
4727 | /* Get rid of namespace aliases. */ |
4728 | scope = ORIGINAL_NAMESPACE (scope); | |
af92ab36 | 4729 | |
b655c310 | 4730 | /* It is ok for friends to be qualified in parallel space. */ |
322763f5 | 4731 | if (!friendp && !is_nested_namespace (current_namespace, scope)) |
b655c310 NS |
4732 | error ("declaration of %qD not in a namespace surrounding %qD", |
4733 | decl, scope); | |
4734 | DECL_CONTEXT (decl) = FROB_CONTEXT (scope); | |
af92ab36 | 4735 | |
5ec046c0 NS |
4736 | /* See whether this has been declared in the namespace or inline |
4737 | children. */ | |
4738 | tree old = NULL_TREE; | |
4739 | { | |
4740 | name_lookup lookup (DECL_NAME (decl), LOOKUP_HIDDEN); | |
4741 | if (!lookup.search_qualified (scope, /*usings=*/false)) | |
4742 | /* No old declaration at all. */ | |
4743 | goto not_found; | |
4744 | old = lookup.value; | |
4745 | } | |
c8094d83 | 4746 | |
b655c310 NS |
4747 | /* If it's a TREE_LIST, the result of the lookup was ambiguous. */ |
4748 | if (TREE_CODE (old) == TREE_LIST) | |
5a167978 | 4749 | { |
5ec046c0 NS |
4750 | ambiguous: |
4751 | DECL_CONTEXT (decl) = FROB_CONTEXT (scope); | |
b655c310 NS |
4752 | error ("reference to %qD is ambiguous", decl); |
4753 | print_candidates (old); | |
4754 | return; | |
4755 | } | |
5ec046c0 NS |
4756 | |
4757 | if (!DECL_DECLARES_FUNCTION_P (decl)) | |
b655c310 | 4758 | { |
b655c310 NS |
4759 | /* Don't compare non-function decls with decls_match here, since |
4760 | it can't check for the correct constness at this | |
5ec046c0 NS |
4761 | point. pushdecl will find those errors later. */ |
4762 | ||
4763 | /* We might have found it in an inline namespace child of SCOPE. */ | |
4764 | if (TREE_CODE (decl) == TREE_CODE (old)) | |
4765 | DECL_CONTEXT (decl) = DECL_CONTEXT (old); | |
4766 | ||
4767 | found: | |
4768 | /* Writing "N::i" to declare something directly in "N" is invalid. */ | |
4769 | if (CP_DECL_CONTEXT (decl) == current_namespace | |
4770 | && at_namespace_scope_p ()) | |
f5fc32e4 PC |
4771 | error_at (DECL_SOURCE_LOCATION (decl), |
4772 | "explicit qualification in declaration of %qD", decl); | |
b655c310 NS |
4773 | return; |
4774 | } | |
5ec046c0 | 4775 | |
b655c310 | 4776 | /* Since decl is a function, old should contain a function decl. */ |
e1cad930 | 4777 | if (!OVL_P (old)) |
5ec046c0 NS |
4778 | goto not_found; |
4779 | ||
b655c310 NS |
4780 | /* We handle these in check_explicit_instantiation_namespace. */ |
4781 | if (processing_explicit_instantiation) | |
4782 | return; | |
4783 | if (processing_template_decl || processing_specialization) | |
4784 | /* We have not yet called push_template_decl to turn a | |
4785 | FUNCTION_DECL into a TEMPLATE_DECL, so the declarations won't | |
4786 | match. But, we'll check later, when we construct the | |
4787 | template. */ | |
4788 | return; | |
4789 | /* Instantiations or specializations of templates may be declared as | |
4790 | friends in any namespace. */ | |
4791 | if (friendp && DECL_USE_TEMPLATE (decl)) | |
4792 | return; | |
5ec046c0 NS |
4793 | |
4794 | tree found; | |
4795 | found = NULL_TREE; | |
4796 | ||
4797 | for (lkp_iterator iter (old); iter; ++iter) | |
b655c310 | 4798 | { |
5ec046c0 NS |
4799 | if (iter.using_p ()) |
4800 | continue; | |
87c976ae | 4801 | |
5ec046c0 NS |
4802 | tree ofn = *iter; |
4803 | ||
4804 | /* Adjust DECL_CONTEXT first so decls_match will return true | |
4805 | if DECL will match a declaration in an inline namespace. */ | |
4806 | DECL_CONTEXT (decl) = DECL_CONTEXT (ofn); | |
4807 | if (decls_match (decl, ofn)) | |
b655c310 | 4808 | { |
5ec046c0 | 4809 | if (found) |
b655c310 | 4810 | { |
5ec046c0 NS |
4811 | /* We found more than one matching declaration. */ |
4812 | DECL_CONTEXT (decl) = FROB_CONTEXT (scope); | |
4813 | goto ambiguous; | |
b655c310 | 4814 | } |
5ec046c0 | 4815 | found = ofn; |
5a167978 GDR |
4816 | } |
4817 | } | |
5ec046c0 NS |
4818 | |
4819 | if (found) | |
5a167978 | 4820 | { |
5ec046c0 NS |
4821 | if (DECL_HIDDEN_FRIEND_P (found)) |
4822 | { | |
4823 | pedwarn (DECL_SOURCE_LOCATION (decl), 0, | |
4824 | "%qD has not been declared within %qD", decl, scope); | |
4825 | inform (DECL_SOURCE_LOCATION (found), | |
4826 | "only here as a %<friend%>"); | |
4827 | } | |
4828 | DECL_CONTEXT (decl) = DECL_CONTEXT (found); | |
4829 | goto found; | |
5a167978 | 4830 | } |
b655c310 | 4831 | |
5ec046c0 | 4832 | not_found: |
b655c310 NS |
4833 | /* It didn't work, go back to the explicit scope. */ |
4834 | DECL_CONTEXT (decl) = FROB_CONTEXT (scope); | |
b655c310 | 4835 | error ("%qD should have been declared inside %qD", decl, scope); |
5a167978 GDR |
4836 | } |
4837 | ||
b655c310 | 4838 | /* Return the namespace where the current declaration is declared. */ |
00e8de68 GDR |
4839 | |
4840 | tree | |
b655c310 | 4841 | current_decl_namespace (void) |
00e8de68 | 4842 | { |
b655c310 NS |
4843 | tree result; |
4844 | /* If we have been pushed into a different namespace, use it. */ | |
4845 | if (!vec_safe_is_empty (decl_namespace_list)) | |
4846 | return decl_namespace_list->last (); | |
00e8de68 | 4847 | |
b655c310 NS |
4848 | if (current_class_type) |
4849 | result = decl_namespace_context (current_class_type); | |
4850 | else if (current_function_decl) | |
4851 | result = decl_namespace_context (current_function_decl); | |
4852 | else | |
4853 | result = current_namespace; | |
4854 | return result; | |
00e8de68 GDR |
4855 | } |
4856 | ||
b655c310 NS |
4857 | /* Process any ATTRIBUTES on a namespace definition. Returns true if |
4858 | attribute visibility is seen. */ | |
00e8de68 | 4859 | |
b655c310 NS |
4860 | bool |
4861 | handle_namespace_attrs (tree ns, tree attributes) | |
00e8de68 | 4862 | { |
b655c310 NS |
4863 | tree d; |
4864 | bool saw_vis = false; | |
4865 | ||
93e544c1 JJ |
4866 | if (attributes == error_mark_node) |
4867 | return false; | |
4868 | ||
b655c310 | 4869 | for (d = attributes; d; d = TREE_CHAIN (d)) |
af79925b | 4870 | { |
b655c310 NS |
4871 | tree name = get_attribute_name (d); |
4872 | tree args = TREE_VALUE (d); | |
4873 | ||
4874 | if (is_attribute_p ("visibility", name)) | |
4875 | { | |
4876 | /* attribute visibility is a property of the syntactic block | |
4877 | rather than the namespace as a whole, so we don't touch the | |
4878 | NAMESPACE_DECL at all. */ | |
4879 | tree x = args ? TREE_VALUE (args) : NULL_TREE; | |
4880 | if (x == NULL_TREE || TREE_CODE (x) != STRING_CST || TREE_CHAIN (args)) | |
4881 | { | |
4882 | warning (OPT_Wattributes, | |
4883 | "%qD attribute requires a single NTBS argument", | |
4884 | name); | |
4885 | continue; | |
4886 | } | |
4887 | ||
4888 | if (!TREE_PUBLIC (ns)) | |
4889 | warning (OPT_Wattributes, | |
4890 | "%qD attribute is meaningless since members of the " | |
4891 | "anonymous namespace get local symbols", name); | |
4892 | ||
4893 | push_visibility (TREE_STRING_POINTER (x), 1); | |
4894 | saw_vis = true; | |
4895 | } | |
4896 | else if (is_attribute_p ("abi_tag", name)) | |
4897 | { | |
44e00a7a | 4898 | if (!DECL_NAME (ns)) |
b655c310 | 4899 | { |
44e00a7a | 4900 | warning (OPT_Wattributes, "ignoring %qD attribute on anonymous " |
b655c310 NS |
4901 | "namespace", name); |
4902 | continue; | |
4903 | } | |
44e00a7a | 4904 | if (!DECL_NAMESPACE_INLINE_P (ns)) |
b655c310 | 4905 | { |
44e00a7a | 4906 | warning (OPT_Wattributes, "ignoring %qD attribute on non-inline " |
b655c310 NS |
4907 | "namespace", name); |
4908 | continue; | |
4909 | } | |
4910 | if (!args) | |
4911 | { | |
4912 | tree dn = DECL_NAME (ns); | |
4913 | args = build_string (IDENTIFIER_LENGTH (dn) + 1, | |
4914 | IDENTIFIER_POINTER (dn)); | |
4915 | TREE_TYPE (args) = char_array_type_node; | |
4916 | args = fix_string_type (args); | |
4917 | args = build_tree_list (NULL_TREE, args); | |
4918 | } | |
4919 | if (check_abi_tag_args (args, name)) | |
4920 | DECL_ATTRIBUTES (ns) = tree_cons (name, args, | |
4921 | DECL_ATTRIBUTES (ns)); | |
4922 | } | |
5857042a MP |
4923 | else if (is_attribute_p ("deprecated", name)) |
4924 | { | |
4925 | if (!DECL_NAME (ns)) | |
4926 | { | |
4927 | warning (OPT_Wattributes, "ignoring %qD attribute on anonymous " | |
4928 | "namespace", name); | |
4929 | continue; | |
4930 | } | |
4931 | if (args && TREE_CODE (TREE_VALUE (args)) != STRING_CST) | |
4932 | { | |
4933 | error ("deprecated message is not a string"); | |
4934 | continue; | |
4935 | } | |
4936 | TREE_DEPRECATED (ns) = 1; | |
4937 | if (args) | |
4938 | DECL_ATTRIBUTES (ns) = tree_cons (name, args, | |
4939 | DECL_ATTRIBUTES (ns)); | |
4940 | } | |
b655c310 NS |
4941 | else |
4942 | { | |
4943 | warning (OPT_Wattributes, "%qD attribute directive ignored", | |
4944 | name); | |
4945 | continue; | |
4946 | } | |
af79925b | 4947 | } |
bd3d082e | 4948 | |
b655c310 NS |
4949 | return saw_vis; |
4950 | } | |
e1cad930 | 4951 | |
b655c310 | 4952 | /* Temporarily set the namespace for the current declaration. */ |
bd3d082e | 4953 | |
b655c310 NS |
4954 | void |
4955 | push_decl_namespace (tree decl) | |
bd3d082e | 4956 | { |
b655c310 NS |
4957 | if (TREE_CODE (decl) != NAMESPACE_DECL) |
4958 | decl = decl_namespace_context (decl); | |
4959 | vec_safe_push (decl_namespace_list, ORIGINAL_NAMESPACE (decl)); | |
00e8de68 GDR |
4960 | } |
4961 | ||
b655c310 | 4962 | /* [namespace.memdef]/2 */ |
d63d5d0c | 4963 | |
b655c310 NS |
4964 | void |
4965 | pop_decl_namespace (void) | |
d63d5d0c | 4966 | { |
b655c310 NS |
4967 | decl_namespace_list->pop (); |
4968 | } | |
d63d5d0c | 4969 | |
b655c310 | 4970 | /* Process a namespace-alias declaration. */ |
501c95ff NF |
4971 | |
4972 | void | |
b655c310 | 4973 | do_namespace_alias (tree alias, tree name_space) |
501c95ff | 4974 | { |
b655c310 NS |
4975 | if (name_space == error_mark_node) |
4976 | return; | |
501c95ff | 4977 | |
b655c310 | 4978 | gcc_assert (TREE_CODE (name_space) == NAMESPACE_DECL); |
501c95ff | 4979 | |
b655c310 | 4980 | name_space = ORIGINAL_NAMESPACE (name_space); |
501c95ff | 4981 | |
b655c310 NS |
4982 | /* Build the alias. */ |
4983 | alias = build_lang_decl (NAMESPACE_DECL, alias, void_type_node); | |
4984 | DECL_NAMESPACE_ALIAS (alias) = name_space; | |
4985 | DECL_EXTERNAL (alias) = 1; | |
4986 | DECL_CONTEXT (alias) = FROB_CONTEXT (current_scope ()); | |
4987 | pushdecl (alias); | |
501c95ff | 4988 | |
b655c310 NS |
4989 | /* Emit debug info for namespace alias. */ |
4990 | if (!building_stmt_list_p ()) | |
4991 | (*debug_hooks->early_global_decl) (alias); | |
4992 | } | |
501c95ff | 4993 | |
b655c310 NS |
4994 | /* Like pushdecl, only it places X in the current namespace, |
4995 | if appropriate. */ | |
501c95ff | 4996 | |
b655c310 NS |
4997 | tree |
4998 | pushdecl_namespace_level (tree x, bool is_friend) | |
4999 | { | |
5000 | cp_binding_level *b = current_binding_level; | |
5001 | tree t; | |
501c95ff | 5002 | |
b655c310 | 5003 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); |
5256a7f5 | 5004 | t = do_pushdecl_with_scope |
d16d5eac | 5005 | (x, NAMESPACE_LEVEL (current_namespace), is_friend); |
501c95ff | 5006 | |
b655c310 NS |
5007 | /* Now, the type_shadowed stack may screw us. Munge it so it does |
5008 | what we want. */ | |
5009 | if (TREE_CODE (t) == TYPE_DECL) | |
52ed68f7 | 5010 | { |
b655c310 NS |
5011 | tree name = DECL_NAME (t); |
5012 | tree newval; | |
5013 | tree *ptr = (tree *)0; | |
5014 | for (; !global_scope_p (b); b = b->level_chain) | |
52ed68f7 | 5015 | { |
b655c310 NS |
5016 | tree shadowed = b->type_shadowed; |
5017 | for (; shadowed; shadowed = TREE_CHAIN (shadowed)) | |
5018 | if (TREE_PURPOSE (shadowed) == name) | |
5019 | { | |
5020 | ptr = &TREE_VALUE (shadowed); | |
5021 | /* Can't break out of the loop here because sometimes | |
5022 | a binding level will have duplicate bindings for | |
5023 | PT names. It's gross, but I haven't time to fix it. */ | |
5024 | } | |
5025 | } | |
5026 | newval = TREE_TYPE (t); | |
5027 | if (ptr == (tree *)0) | |
5028 | { | |
5029 | /* @@ This shouldn't be needed. My test case "zstring.cc" trips | |
5030 | up here if this is changed to an assertion. --KR */ | |
5031 | SET_IDENTIFIER_TYPE_VALUE (name, t); | |
5032 | } | |
5033 | else | |
5034 | { | |
5035 | *ptr = newval; | |
52ed68f7 | 5036 | } |
52ed68f7 | 5037 | } |
b655c310 NS |
5038 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); |
5039 | return t; | |
501c95ff NF |
5040 | } |
5041 | ||
692af872 | 5042 | /* Process a using declaration in non-class scope. */ |
ebed7175 | 5043 | |
b655c310 | 5044 | void |
692af872 | 5045 | finish_nonmember_using_decl (tree scope, tree name) |
ebed7175 | 5046 | { |
692af872 NS |
5047 | gcc_checking_assert (current_binding_level->kind != sk_class); |
5048 | gcc_checking_assert (identifier_p (name)); | |
fcb2cdfc | 5049 | |
692af872 | 5050 | name_lookup lookup (name, 0); |
ebed7175 | 5051 | |
692af872 | 5052 | if (TREE_CODE (scope) != NAMESPACE_DECL) |
3c9cca88 | 5053 | { |
692af872 NS |
5054 | error ("%qE is not a namespace or unscoped enum", scope); |
5055 | return; | |
3c9cca88 | 5056 | } |
b655c310 | 5057 | |
692af872 | 5058 | qualified_namespace_lookup (scope, &lookup); |
b655c310 | 5059 | |
692af872 NS |
5060 | if (!lookup.value) |
5061 | { | |
5062 | error ("%qD has not been declared in %qE", name, scope); | |
5063 | return; | |
5064 | } | |
9d029ddf | 5065 | |
692af872 NS |
5066 | if (TREE_CODE (lookup.value) == TREE_LIST |
5067 | /* But we can (independently) have ambiguous implicit typedefs. */ | |
5068 | || (lookup.type && TREE_CODE (lookup.type) == TREE_LIST)) | |
5069 | { | |
5070 | error ("reference to %qD is ambiguous", name); | |
5071 | print_candidates (TREE_CODE (lookup.value) == TREE_LIST | |
5072 | ? lookup.value : lookup.type); | |
5073 | return; | |
5074 | } | |
9d029ddf | 5075 | |
692af872 NS |
5076 | if (TREE_CODE (lookup.value) == NAMESPACE_DECL) |
5077 | { | |
5078 | error ("using-declaration may not name namespace %qD", lookup.value); | |
5079 | return; | |
5080 | } | |
9d029ddf | 5081 | |
692af872 NS |
5082 | /* Emit debug info. */ |
5083 | if (!processing_template_decl) | |
5084 | cp_emit_debug_info_for_using (lookup.value, | |
5085 | current_binding_level->this_entity); | |
9d029ddf | 5086 | |
692af872 NS |
5087 | if (current_binding_level->kind == sk_namespace) |
5088 | { | |
5089 | tree *slot = find_namespace_slot (current_namespace, name, true); | |
9d029ddf | 5090 | |
692af872 NS |
5091 | tree value = MAYBE_STAT_DECL (*slot); |
5092 | tree type = MAYBE_STAT_TYPE (*slot); | |
9d029ddf | 5093 | |
1c4320eb | 5094 | do_nonmember_using_decl (lookup, false, &value, &type); |
9d029ddf | 5095 | |
692af872 NS |
5096 | if (STAT_HACK_P (*slot)) |
5097 | { | |
5098 | STAT_DECL (*slot) = value; | |
5099 | STAT_TYPE (*slot) = type; | |
5100 | } | |
5101 | else if (type) | |
5102 | *slot = stat_hack (value, type); | |
5103 | else | |
5104 | *slot = value; | |
5105 | } | |
9d029ddf NS |
5106 | else |
5107 | { | |
692af872 NS |
5108 | tree using_decl = build_lang_decl (USING_DECL, name, NULL_TREE); |
5109 | USING_DECL_SCOPE (using_decl) = scope; | |
5110 | add_decl_expr (using_decl); | |
5111 | ||
5112 | cxx_binding *binding = find_local_binding (current_binding_level, name); | |
5113 | tree value = NULL; | |
5114 | tree type = NULL; | |
5115 | if (binding) | |
5116 | { | |
5117 | value = binding->value; | |
5118 | type = binding->type; | |
5119 | } | |
5120 | ||
5121 | /* DR 36 questions why using-decls at function scope may not be | |
5122 | duplicates. Disallow it, as C++11 claimed and PR 20420 | |
5123 | implemented. */ | |
1c4320eb | 5124 | do_nonmember_using_decl (lookup, true, &value, &type); |
692af872 NS |
5125 | |
5126 | if (!value) | |
5127 | ; | |
5128 | else if (binding && value == binding->value) | |
5129 | ; | |
5130 | else if (binding && binding->value && TREE_CODE (value) == OVERLOAD) | |
5131 | { | |
5132 | update_local_overload (IDENTIFIER_BINDING (name), value); | |
5133 | IDENTIFIER_BINDING (name)->value = value; | |
5134 | } | |
5135 | else | |
5136 | /* Install the new binding. */ | |
692af872 NS |
5137 | push_local_binding (name, value, true); |
5138 | ||
5139 | if (!type) | |
5140 | ; | |
5141 | else if (binding && type == binding->type) | |
5142 | ; | |
5143 | else | |
5144 | { | |
5145 | push_local_binding (name, type, true); | |
5146 | set_identifier_type_value (name, type); | |
5147 | } | |
9d029ddf NS |
5148 | } |
5149 | ||
ebed7175 DM |
5150 | } |
5151 | ||
b655c310 NS |
5152 | /* Return the declarations that are members of the namespace NS. */ |
5153 | ||
5154 | tree | |
5155 | cp_namespace_decls (tree ns) | |
5156 | { | |
5157 | return NAMESPACE_LEVEL (ns)->names; | |
52ed68f7 DM |
5158 | } |
5159 | ||
b655c310 | 5160 | /* Combine prefer_type and namespaces_only into flags. */ |
9ca6556e | 5161 | |
b655c310 NS |
5162 | static int |
5163 | lookup_flags (int prefer_type, int namespaces_only) | |
5164 | { | |
5165 | if (namespaces_only) | |
5166 | return LOOKUP_PREFER_NAMESPACES; | |
5167 | if (prefer_type > 1) | |
5168 | return LOOKUP_PREFER_TYPES; | |
5169 | if (prefer_type > 0) | |
5170 | return LOOKUP_PREFER_BOTH; | |
5171 | return 0; | |
5172 | } | |
9ca6556e | 5173 | |
b655c310 NS |
5174 | /* Given a lookup that returned VAL, use FLAGS to decide if we want to |
5175 | ignore it or not. Subroutine of lookup_name_real and | |
5176 | lookup_type_scope. */ | |
172a4594 DS |
5177 | |
5178 | static bool | |
b655c310 | 5179 | qualify_lookup (tree val, int flags) |
172a4594 | 5180 | { |
b655c310 | 5181 | if (val == NULL_TREE) |
172a4594 | 5182 | return false; |
b655c310 NS |
5183 | if ((flags & LOOKUP_PREFER_NAMESPACES) && TREE_CODE (val) == NAMESPACE_DECL) |
5184 | return true; | |
5185 | if (flags & LOOKUP_PREFER_TYPES) | |
5186 | { | |
5187 | tree target_val = strip_using_decl (val); | |
5188 | if (TREE_CODE (target_val) == TYPE_DECL | |
5189 | || TREE_CODE (target_val) == TEMPLATE_DECL) | |
5190 | return true; | |
5191 | } | |
5192 | if (flags & (LOOKUP_PREFER_NAMESPACES | LOOKUP_PREFER_TYPES)) | |
74788b80 | 5193 | return false; |
b655c310 | 5194 | /* Look through lambda things that we shouldn't be able to see. */ |
5c263e84 | 5195 | if (!(flags & LOOKUP_HIDDEN) && is_lambda_ignored_entity (val)) |
b655c310 NS |
5196 | return false; |
5197 | return true; | |
5198 | } | |
74788b80 | 5199 | |
cb731872 DM |
5200 | /* Is there a "using namespace std;" directive within USINGS? */ |
5201 | ||
5202 | static bool | |
5203 | using_directives_contain_std_p (vec<tree, va_gc> *usings) | |
5204 | { | |
5205 | if (!usings) | |
5206 | return false; | |
5207 | ||
5208 | for (unsigned ix = usings->length (); ix--;) | |
5209 | if ((*usings)[ix] == std_node) | |
5210 | return true; | |
5211 | ||
5212 | return false; | |
5213 | } | |
5214 | ||
5215 | /* Is there a "using namespace std;" directive within the current | |
5216 | namespace (or its ancestors)? | |
5217 | Compare with name_lookup::search_unqualified. */ | |
5218 | ||
5219 | static bool | |
5220 | has_using_namespace_std_directive_p () | |
5221 | { | |
5222 | /* Look at local using-directives. */ | |
5223 | for (cp_binding_level *level = current_binding_level; | |
0841bc15 | 5224 | level; |
cb731872 DM |
5225 | level = level->level_chain) |
5226 | if (using_directives_contain_std_p (level->using_directives)) | |
5227 | return true; | |
5228 | ||
cb731872 DM |
5229 | return false; |
5230 | } | |
5231 | ||
7e2de6df DM |
5232 | /* Subclass of deferred_diagnostic, for issuing a note when |
5233 | --param cxx-max-namespaces-for-diagnostic-help is reached. | |
90ea9897 | 5234 | |
7e2de6df DM |
5235 | The note should be issued after the error, but before any other |
5236 | deferred diagnostics. This is handled by decorating a wrapped | |
5237 | deferred_diagnostic, and emitting a note before that wrapped note is | |
5238 | deleted. */ | |
5239 | ||
5240 | class namespace_limit_reached : public deferred_diagnostic | |
5241 | { | |
5242 | public: | |
5243 | namespace_limit_reached (location_t loc, unsigned limit, tree name, | |
5244 | gnu::unique_ptr<deferred_diagnostic> wrapped) | |
5245 | : deferred_diagnostic (loc), | |
5246 | m_limit (limit), m_name (name), | |
5247 | m_wrapped (move (wrapped)) | |
5248 | { | |
5249 | } | |
5250 | ||
5251 | ~namespace_limit_reached () | |
5252 | { | |
5253 | /* Unconditionally warn that the search was truncated. */ | |
5254 | inform (get_location (), | |
5255 | "maximum limit of %d namespaces searched for %qE", | |
5256 | m_limit, m_name); | |
5257 | /* m_wrapped will be implicitly deleted after this, emitting any followup | |
5258 | diagnostic after the above note. */ | |
5259 | } | |
5260 | ||
5261 | private: | |
5262 | unsigned m_limit; | |
5263 | tree m_name; | |
5264 | gnu::unique_ptr<deferred_diagnostic> m_wrapped; | |
5265 | }; | |
5266 | ||
5267 | /* Subclass of deferred_diagnostic, for use when issuing a single suggestion. | |
5268 | Emit a note showing the location of the declaration of the suggestion. */ | |
5269 | ||
5270 | class show_candidate_location : public deferred_diagnostic | |
5271 | { | |
5272 | public: | |
5273 | show_candidate_location (location_t loc, tree candidate) | |
5274 | : deferred_diagnostic (loc), | |
5275 | m_candidate (candidate) | |
5276 | { | |
5277 | } | |
5278 | ||
5279 | ~show_candidate_location () | |
5280 | { | |
5281 | inform (location_of (m_candidate), "%qE declared here", m_candidate); | |
5282 | } | |
5283 | ||
5284 | private: | |
5285 | tree m_candidate; | |
5286 | }; | |
5287 | ||
5288 | /* Subclass of deferred_diagnostic, for use when there are multiple candidates | |
5289 | to be suggested by suggest_alternatives_for. | |
5290 | ||
5291 | Emit a series of notes showing the various suggestions. */ | |
5292 | ||
5293 | class suggest_alternatives : public deferred_diagnostic | |
90ea9897 | 5294 | { |
7e2de6df DM |
5295 | public: |
5296 | suggest_alternatives (location_t loc, vec<tree> candidates) | |
5297 | : deferred_diagnostic (loc), | |
5298 | m_candidates (candidates) | |
5299 | { | |
5300 | } | |
5301 | ||
5302 | ~suggest_alternatives () | |
5303 | { | |
5304 | if (m_candidates.length ()) | |
5305 | { | |
5306 | inform_n (get_location (), m_candidates.length (), | |
5307 | "suggested alternative:", | |
5308 | "suggested alternatives:"); | |
5309 | for (unsigned ix = 0; ix != m_candidates.length (); ix++) | |
5310 | { | |
5311 | tree val = m_candidates[ix]; | |
5312 | ||
5313 | inform (location_of (val), " %qE", val); | |
5314 | } | |
5315 | } | |
5316 | m_candidates.release (); | |
5317 | } | |
5318 | ||
5319 | private: | |
5320 | vec<tree> m_candidates; | |
5321 | }; | |
5322 | ||
5323 | /* A class for encapsulating the result of a search across | |
3ded6ffd DM |
5324 | multiple namespaces (and scoped enums within them) for an |
5325 | unrecognized name seen at a given source location. */ | |
7e2de6df DM |
5326 | |
5327 | class namespace_hints | |
5328 | { | |
5329 | public: | |
5330 | namespace_hints (location_t loc, tree name); | |
5331 | ||
5332 | name_hint convert_candidates_to_name_hint (); | |
5333 | name_hint maybe_decorate_with_limit (name_hint); | |
5334 | ||
5335 | private: | |
3ded6ffd DM |
5336 | void maybe_add_candidate_for_scoped_enum (tree scoped_enum, tree name); |
5337 | ||
7e2de6df DM |
5338 | location_t m_loc; |
5339 | tree m_name; | |
5340 | vec<tree> m_candidates; | |
5341 | ||
5342 | /* Value of "--param cxx-max-namespaces-for-diagnostic-help". */ | |
5343 | unsigned m_limit; | |
5344 | ||
5345 | /* Was the limit reached? */ | |
5346 | bool m_limited; | |
5347 | }; | |
5348 | ||
3ded6ffd DM |
5349 | /* Constructor for namespace_hints. Search namespaces and scoped enums, |
5350 | looking for an exact match for unrecognized NAME seen at LOC. */ | |
7e2de6df DM |
5351 | |
5352 | namespace_hints::namespace_hints (location_t loc, tree name) | |
5353 | : m_loc(loc), m_name (name) | |
5354 | { | |
5355 | auto_vec<tree> worklist; | |
5356 | ||
5357 | m_candidates = vNULL; | |
5358 | m_limited = false; | |
5359 | m_limit = PARAM_VALUE (CXX_MAX_NAMESPACES_FOR_DIAGNOSTIC_HELP); | |
c957e9c0 NS |
5360 | |
5361 | /* Breadth-first search of namespaces. Up to limit namespaces | |
5362 | searched (limit zero == unlimited). */ | |
5363 | worklist.safe_push (global_namespace); | |
5364 | for (unsigned ix = 0; ix != worklist.length (); ix++) | |
b655c310 | 5365 | { |
c957e9c0 | 5366 | tree ns = worklist[ix]; |
25396db9 | 5367 | name_lookup lookup (name); |
90ea9897 | 5368 | |
25396db9 | 5369 | if (lookup.search_qualified (ns, false)) |
7e2de6df | 5370 | m_candidates.safe_push (lookup.value); |
00e8de68 | 5371 | |
7e2de6df | 5372 | if (!m_limited) |
00e8de68 | 5373 | { |
c957e9c0 NS |
5374 | /* Look for child namespaces. We have to do this |
5375 | indirectly because they are chained in reverse order, | |
5376 | which is confusing to the user. */ | |
7e2de6df | 5377 | auto_vec<tree> children; |
c957e9c0 NS |
5378 | |
5379 | for (tree decl = NAMESPACE_LEVEL (ns)->names; | |
5380 | decl; decl = TREE_CHAIN (decl)) | |
3ded6ffd DM |
5381 | { |
5382 | if (TREE_CODE (decl) == NAMESPACE_DECL | |
5383 | && !DECL_NAMESPACE_ALIAS (decl) | |
5384 | && !DECL_NAMESPACE_INLINE_P (decl)) | |
5385 | children.safe_push (decl); | |
5386 | ||
5387 | /* Look for exact matches for NAME within scoped enums. | |
5388 | These aren't added to the worklist, and so don't count | |
5389 | against the search limit. */ | |
5390 | if (TREE_CODE (decl) == TYPE_DECL) | |
5391 | { | |
5392 | tree type = TREE_TYPE (decl); | |
5393 | if (SCOPED_ENUM_P (type)) | |
5394 | maybe_add_candidate_for_scoped_enum (type, name); | |
5395 | } | |
5396 | } | |
c957e9c0 | 5397 | |
7e2de6df | 5398 | while (!m_limited && !children.is_empty ()) |
b655c310 | 5399 | { |
7e2de6df DM |
5400 | if (worklist.length () == m_limit) |
5401 | m_limited = true; | |
c957e9c0 NS |
5402 | else |
5403 | worklist.safe_push (children.pop ()); | |
b655c310 NS |
5404 | } |
5405 | } | |
b655c310 | 5406 | } |
7e2de6df | 5407 | } |
c8094d83 | 5408 | |
7e2de6df DM |
5409 | /* Drop ownership of m_candidates, using it to generate a name_hint at m_loc |
5410 | for m_name, an IDENTIFIER_NODE for which name lookup failed. | |
c8094d83 | 5411 | |
7e2de6df DM |
5412 | If m_candidates is non-empty, use it to generate a suggestion and/or |
5413 | a deferred diagnostic that lists the possible candidate(s). | |
5414 | */ | |
5415 | ||
5416 | name_hint | |
5417 | namespace_hints::convert_candidates_to_name_hint () | |
5418 | { | |
5419 | /* How many candidates do we have? */ | |
5420 | ||
5421 | /* If we have just one candidate, issue a name_hint with it as a suggestion | |
5422 | (so that consumers are able to suggest it within the error message and emit | |
5423 | it as a fix-it hint), and with a note showing the candidate's location. */ | |
5424 | if (m_candidates.length () == 1) | |
5425 | { | |
5426 | tree candidate = m_candidates[0]; | |
5427 | /* Clean up CANDIDATES. */ | |
5428 | m_candidates.release (); | |
5429 | return name_hint (expr_to_string (candidate), | |
5430 | new show_candidate_location (m_loc, candidate)); | |
c957e9c0 | 5431 | } |
7e2de6df DM |
5432 | else if (m_candidates.length () > 1) |
5433 | /* If we have more than one candidate, issue a name_hint without a single | |
5434 | "suggestion", but with a deferred diagnostic that lists the | |
5435 | various candidates. This takes ownership of m_candidates. */ | |
5436 | return name_hint (NULL, new suggest_alternatives (m_loc, m_candidates)); | |
5437 | ||
5438 | /* Otherwise, m_candidates ought to be empty, so no cleanup is necessary. */ | |
5439 | gcc_assert (m_candidates.length () == 0); | |
5440 | gcc_assert (m_candidates == vNULL); | |
5441 | ||
5442 | return name_hint (); | |
5443 | } | |
5444 | ||
5445 | /* If --param cxx-max-namespaces-for-diagnostic-help was reached, | |
5446 | then we want to emit a note about after the error, but before | |
5447 | any other deferred diagnostics. | |
5448 | ||
5449 | Handle this by figuring out what hint is needed, then optionally | |
5450 | decorating HINT with a namespace_limit_reached wrapper. */ | |
5451 | ||
5452 | name_hint | |
5453 | namespace_hints::maybe_decorate_with_limit (name_hint hint) | |
5454 | { | |
5455 | if (m_limited) | |
5456 | return name_hint (hint.suggestion (), | |
5457 | new namespace_limit_reached (m_loc, m_limit, | |
5458 | m_name, | |
5459 | hint.take_deferred ())); | |
5460 | else | |
5461 | return hint; | |
5462 | } | |
5463 | ||
3ded6ffd DM |
5464 | /* Look inside SCOPED_ENUM for exact matches for NAME. |
5465 | If one is found, add its CONST_DECL to m_candidates. */ | |
5466 | ||
5467 | void | |
5468 | namespace_hints::maybe_add_candidate_for_scoped_enum (tree scoped_enum, | |
5469 | tree name) | |
5470 | { | |
5471 | gcc_assert (SCOPED_ENUM_P (scoped_enum)); | |
5472 | ||
5473 | for (tree iter = TYPE_VALUES (scoped_enum); iter; iter = TREE_CHAIN (iter)) | |
5474 | { | |
5475 | tree id = TREE_PURPOSE (iter); | |
5476 | if (id == name) | |
5477 | { | |
5478 | m_candidates.safe_push (TREE_VALUE (iter)); | |
5479 | return; | |
5480 | } | |
5481 | } | |
5482 | } | |
5483 | ||
7e2de6df DM |
5484 | /* Generate a name_hint at LOCATION for NAME, an IDENTIFIER_NODE for which |
5485 | name lookup failed. | |
5486 | ||
3ded6ffd DM |
5487 | Search through all available namespaces and any scoped enums within them |
5488 | and generate a suggestion and/or a deferred diagnostic that lists possible | |
5489 | candidate(s). | |
7e2de6df DM |
5490 | |
5491 | If no exact matches are found, and SUGGEST_MISSPELLINGS is true, then also | |
5492 | look for near-matches and suggest the best near-match, if there is one. | |
cb731872 | 5493 | |
7e2de6df DM |
5494 | If nothing is found, then an empty name_hint is returned. */ |
5495 | ||
5496 | name_hint | |
5497 | suggest_alternatives_for (location_t location, tree name, | |
5498 | bool suggest_misspellings) | |
5499 | { | |
5500 | /* First, search for exact matches in other namespaces. */ | |
5501 | namespace_hints ns_hints (location, name); | |
5502 | name_hint result = ns_hints.convert_candidates_to_name_hint (); | |
5503 | ||
5504 | /* Otherwise, try other approaches. */ | |
5505 | if (!result) | |
5506 | result = suggest_alternatives_for_1 (location, name, suggest_misspellings); | |
5507 | ||
5508 | return ns_hints.maybe_decorate_with_limit (gnu::move (result)); | |
5509 | } | |
5510 | ||
5511 | /* The second half of suggest_alternatives_for, for when no exact matches | |
5512 | were found in other namespaces. */ | |
5513 | ||
5514 | static name_hint | |
5515 | suggest_alternatives_for_1 (location_t location, tree name, | |
5516 | bool suggest_misspellings) | |
5517 | { | |
cb731872 DM |
5518 | /* No candidates were found in the available namespaces. */ |
5519 | ||
5520 | /* If there's a "using namespace std;" active, and this | |
5521 | is one of the most common "std::" names, then it's probably a | |
5522 | missing #include. */ | |
5523 | if (has_using_namespace_std_directive_p ()) | |
7e2de6df DM |
5524 | { |
5525 | name_hint hint = maybe_suggest_missing_std_header (location, name); | |
5526 | if (hint) | |
5527 | return hint; | |
5528 | } | |
cb731872 DM |
5529 | |
5530 | /* Otherwise, consider misspellings. */ | |
5531 | if (!suggest_misspellings) | |
7e2de6df | 5532 | return name_hint (); |
00e8de68 | 5533 | |
7e2de6df DM |
5534 | return lookup_name_fuzzy (name, FUZZY_LOOKUP_NAME, location); |
5535 | } | |
5536 | ||
5537 | /* Generate a name_hint at LOCATION for NAME, an IDENTIFIER_NODE for which | |
5538 | name lookup failed. | |
5539 | ||
5540 | Search through all available namespaces and generate a suggestion and/or | |
5541 | a deferred diagnostic that lists possible candidate(s). | |
5542 | ||
5543 | This is similiar to suggest_alternatives_for, but doesn't fallback to | |
5544 | the other approaches used by that function. */ | |
5545 | ||
5546 | name_hint | |
5547 | suggest_alternatives_in_other_namespaces (location_t location, tree name) | |
5548 | { | |
5549 | namespace_hints ns_hints (location, name); | |
5550 | ||
5551 | name_hint result = ns_hints.convert_candidates_to_name_hint (); | |
5552 | ||
5553 | return ns_hints.maybe_decorate_with_limit (gnu::move (result)); | |
b655c310 | 5554 | } |
00e8de68 | 5555 | |
e1c7971b DM |
5556 | /* A well-known name within the C++ standard library, returned by |
5557 | get_std_name_hint. */ | |
5558 | ||
5559 | struct std_name_hint | |
5560 | { | |
5561 | /* A name within "std::". */ | |
5562 | const char *name; | |
5563 | ||
5564 | /* The header name defining it within the C++ Standard Library | |
5565 | (with '<' and '>'). */ | |
5566 | const char *header; | |
5567 | ||
5568 | /* The dialect of C++ in which this was added. */ | |
5569 | enum cxx_dialect min_dialect; | |
5570 | }; | |
5571 | ||
b655c310 NS |
5572 | /* Subroutine of maybe_suggest_missing_header for handling unrecognized names |
5573 | for some of the most common names within "std::". | |
e1c7971b | 5574 | Given non-NULL NAME, return the std_name_hint for it, or NULL. */ |
00e8de68 | 5575 | |
e1c7971b | 5576 | static const std_name_hint * |
b655c310 NS |
5577 | get_std_name_hint (const char *name) |
5578 | { | |
b655c310 | 5579 | static const std_name_hint hints[] = { |
e1c7971b DM |
5580 | /* <any>. */ |
5581 | {"any", "<any>", cxx17}, | |
5582 | {"any_cast", "<any>", cxx17}, | |
5583 | {"make_any", "<any>", cxx17}, | |
b655c310 | 5584 | /* <array>. */ |
e1c7971b | 5585 | {"array", "<array>", cxx11}, |
7eeb5982 | 5586 | {"to_array", "<array>", cxx2a}, |
e1c7971b DM |
5587 | /* <atomic>. */ |
5588 | {"atomic", "<atomic>", cxx11}, | |
5589 | {"atomic_flag", "<atomic>", cxx11}, | |
7eeb5982 | 5590 | {"atomic_ref", "<atomic>", cxx2a}, |
e1c7971b DM |
5591 | /* <bitset>. */ |
5592 | {"bitset", "<bitset>", cxx11}, | |
b3e862e0 | 5593 | /* <complex>. */ |
e1c7971b | 5594 | {"complex", "<complex>", cxx98}, |
07ee5924 | 5595 | {"complex_literals", "<complex>", cxx14}, |
e1c7971b DM |
5596 | /* <condition_variable>. */ |
5597 | {"condition_variable", "<condition_variable>", cxx11}, | |
5598 | {"condition_variable_any", "<condition_variable>", cxx11}, | |
b655c310 | 5599 | /* <deque>. */ |
e1c7971b | 5600 | {"deque", "<deque>", cxx98}, |
b655c310 | 5601 | /* <forward_list>. */ |
e1c7971b | 5602 | {"forward_list", "<forward_list>", cxx11}, |
b655c310 | 5603 | /* <fstream>. */ |
e1c7971b DM |
5604 | {"basic_filebuf", "<fstream>", cxx98}, |
5605 | {"basic_ifstream", "<fstream>", cxx98}, | |
5606 | {"basic_ofstream", "<fstream>", cxx98}, | |
5607 | {"basic_fstream", "<fstream>", cxx98}, | |
5608 | {"fstream", "<fstream>", cxx98}, | |
5609 | {"ifstream", "<fstream>", cxx98}, | |
5610 | {"ofstream", "<fstream>", cxx98}, | |
5611 | /* <functional>. */ | |
5612 | {"bind", "<functional>", cxx11}, | |
7eeb5982 | 5613 | {"bind_front", "<functional>", cxx2a}, |
e1c7971b DM |
5614 | {"function", "<functional>", cxx11}, |
5615 | {"hash", "<functional>", cxx11}, | |
7eeb5982 | 5616 | {"invoke", "<functional>", cxx17}, |
e1c7971b | 5617 | {"mem_fn", "<functional>", cxx11}, |
7eeb5982 JW |
5618 | {"not_fn", "<functional>", cxx17}, |
5619 | {"reference_wrapper", "<functional>", cxx11}, | |
5620 | {"unwrap_reference", "<functional>", cxx2a}, | |
5621 | {"unwrap_reference_t", "<functional>", cxx2a}, | |
5622 | {"unwrap_ref_decay", "<functional>", cxx2a}, | |
5623 | {"unwrap_ref_decay_t", "<functional>", cxx2a}, | |
e1c7971b DM |
5624 | /* <future>. */ |
5625 | {"async", "<future>", cxx11}, | |
5626 | {"future", "<future>", cxx11}, | |
5627 | {"packaged_task", "<future>", cxx11}, | |
5628 | {"promise", "<future>", cxx11}, | |
b655c310 | 5629 | /* <iostream>. */ |
e1c7971b DM |
5630 | {"cin", "<iostream>", cxx98}, |
5631 | {"cout", "<iostream>", cxx98}, | |
5632 | {"cerr", "<iostream>", cxx98}, | |
5633 | {"clog", "<iostream>", cxx98}, | |
5634 | {"wcin", "<iostream>", cxx98}, | |
5635 | {"wcout", "<iostream>", cxx98}, | |
5636 | {"wclog", "<iostream>", cxx98}, | |
5637 | /* <istream>. */ | |
5638 | {"istream", "<istream>", cxx98}, | |
5639 | /* <iterator>. */ | |
5640 | {"advance", "<iterator>", cxx98}, | |
5641 | {"back_inserter", "<iterator>", cxx98}, | |
5642 | {"begin", "<iterator>", cxx11}, | |
5643 | {"distance", "<iterator>", cxx98}, | |
5644 | {"end", "<iterator>", cxx11}, | |
5645 | {"front_inserter", "<iterator>", cxx98}, | |
5646 | {"inserter", "<iterator>", cxx98}, | |
5647 | {"istream_iterator", "<iterator>", cxx98}, | |
5648 | {"istreambuf_iterator", "<iterator>", cxx98}, | |
5649 | {"iterator_traits", "<iterator>", cxx98}, | |
5650 | {"move_iterator", "<iterator>", cxx11}, | |
5651 | {"next", "<iterator>", cxx11}, | |
5652 | {"ostream_iterator", "<iterator>", cxx98}, | |
5653 | {"ostreambuf_iterator", "<iterator>", cxx98}, | |
5654 | {"prev", "<iterator>", cxx11}, | |
5655 | {"reverse_iterator", "<iterator>", cxx98}, | |
5656 | /* <ostream>. */ | |
5657 | {"ostream", "<ostream>", cxx98}, | |
b655c310 | 5658 | /* <list>. */ |
e1c7971b | 5659 | {"list", "<list>", cxx98}, |
b655c310 | 5660 | /* <map>. */ |
e1c7971b DM |
5661 | {"map", "<map>", cxx98}, |
5662 | {"multimap", "<map>", cxx98}, | |
62e98ef1 | 5663 | /* <memory>. */ |
7eeb5982 JW |
5664 | {"allocate_shared", "<memory>", cxx11}, |
5665 | {"allocator", "<memory>", cxx98}, | |
5666 | {"allocator_traits", "<memory>", cxx11}, | |
e1c7971b | 5667 | {"make_shared", "<memory>", cxx11}, |
07ee5924 | 5668 | {"make_unique", "<memory>", cxx14}, |
e1c7971b DM |
5669 | {"shared_ptr", "<memory>", cxx11}, |
5670 | {"unique_ptr", "<memory>", cxx11}, | |
5671 | {"weak_ptr", "<memory>", cxx11}, | |
7eeb5982 JW |
5672 | /* <memory_resource>. */ |
5673 | {"pmr", "<memory_resource>", cxx17}, | |
e1c7971b DM |
5674 | /* <mutex>. */ |
5675 | {"mutex", "<mutex>", cxx11}, | |
5676 | {"timed_mutex", "<mutex>", cxx11}, | |
5677 | {"recursive_mutex", "<mutex>", cxx11}, | |
5678 | {"recursive_timed_mutex", "<mutex>", cxx11}, | |
5679 | {"once_flag", "<mutex>", cxx11}, | |
5680 | {"call_once,", "<mutex>", cxx11}, | |
5681 | {"lock", "<mutex>", cxx11}, | |
5682 | {"scoped_lock", "<mutex>", cxx17}, | |
5683 | {"try_lock", "<mutex>", cxx11}, | |
5684 | {"lock_guard", "<mutex>", cxx11}, | |
5685 | {"unique_lock", "<mutex>", cxx11}, | |
5686 | /* <optional>. */ | |
5687 | {"optional", "<optional>", cxx17}, | |
5688 | {"make_optional", "<optional>", cxx17}, | |
b655c310 | 5689 | /* <ostream>. */ |
e1c7971b DM |
5690 | {"ostream", "<ostream>", cxx98}, |
5691 | {"wostream", "<ostream>", cxx98}, | |
5692 | {"ends", "<ostream>", cxx98}, | |
5693 | {"flush", "<ostream>", cxx98}, | |
5694 | {"endl", "<ostream>", cxx98}, | |
5695 | /* <queue>. */ | |
5696 | {"queue", "<queue>", cxx98}, | |
5697 | {"priority_queue", "<queue>", cxx98}, | |
b655c310 | 5698 | /* <set>. */ |
e1c7971b DM |
5699 | {"set", "<set>", cxx98}, |
5700 | {"multiset", "<set>", cxx98}, | |
5701 | /* <shared_mutex>. */ | |
5702 | {"shared_lock", "<shared_mutex>", cxx14}, | |
5703 | {"shared_mutex", "<shared_mutex>", cxx17}, | |
5704 | {"shared_timed_mutex", "<shared_mutex>", cxx14}, | |
b655c310 | 5705 | /* <sstream>. */ |
e1c7971b DM |
5706 | {"basic_stringbuf", "<sstream>", cxx98}, |
5707 | {"basic_istringstream", "<sstream>", cxx98}, | |
5708 | {"basic_ostringstream", "<sstream>", cxx98}, | |
5709 | {"basic_stringstream", "<sstream>", cxx98}, | |
5710 | {"istringstream", "<sstream>", cxx98}, | |
5711 | {"ostringstream", "<sstream>", cxx98}, | |
5712 | {"stringstream", "<sstream>", cxx98}, | |
b655c310 | 5713 | /* <stack>. */ |
e1c7971b | 5714 | {"stack", "<stack>", cxx98}, |
b655c310 | 5715 | /* <string>. */ |
e1c7971b DM |
5716 | {"basic_string", "<string>", cxx98}, |
5717 | {"string", "<string>", cxx98}, | |
5718 | {"wstring", "<string>", cxx98}, | |
c124af93 | 5719 | {"u8string", "<string>", cxx2a}, |
e1c7971b DM |
5720 | {"u16string", "<string>", cxx11}, |
5721 | {"u32string", "<string>", cxx11}, | |
5722 | /* <string_view>. */ | |
7eeb5982 | 5723 | {"basic_string_view", "<string_view>", cxx17}, |
e1c7971b DM |
5724 | {"string_view", "<string_view>", cxx17}, |
5725 | /* <thread>. */ | |
5726 | {"thread", "<thread>", cxx11}, | |
7eeb5982 | 5727 | {"this_thread", "<thread>", cxx11}, |
e1c7971b | 5728 | /* <tuple>. */ |
7eeb5982 JW |
5729 | {"apply", "<tuple>", cxx17}, |
5730 | {"forward_as_tuple", "<tuple>", cxx11}, | |
5731 | {"make_from_tuple", "<tuple>", cxx17}, | |
e1c7971b | 5732 | {"make_tuple", "<tuple>", cxx11}, |
7eeb5982 | 5733 | {"tie", "<tuple>", cxx11}, |
e1c7971b | 5734 | {"tuple", "<tuple>", cxx11}, |
7eeb5982 | 5735 | {"tuple_cat", "<tuple>", cxx11}, |
e1c7971b | 5736 | {"tuple_element", "<tuple>", cxx11}, |
7eeb5982 | 5737 | {"tuple_element_t", "<tuple>", cxx14}, |
e1c7971b | 5738 | {"tuple_size", "<tuple>", cxx11}, |
7eeb5982 JW |
5739 | {"tuple_size_v", "<tuple>", cxx17}, |
5740 | /* <type_traits>. */ | |
5741 | {"enable_if", "<type_traits>", cxx11}, | |
5742 | {"enable_if_t", "<type_traits>", cxx14}, | |
5743 | {"invoke_result", "<type_traits>", cxx17}, | |
5744 | {"invoke_result_t", "<type_traits>", cxx17}, | |
5745 | {"remove_cvref", "<type_traits>", cxx2a}, | |
5746 | {"remove_cvref_t", "<type_traits>", cxx2a}, | |
5747 | {"type_identity", "<type_traits>", cxx2a}, | |
5748 | {"type_identity_t", "<type_traits>", cxx2a}, | |
5749 | {"void_t", "<type_traits>", cxx17}, | |
5750 | {"conjunction", "<type_traits>", cxx17}, | |
5751 | {"conjunction_v", "<type_traits>", cxx17}, | |
5752 | {"disjunction", "<type_traits>", cxx17}, | |
5753 | {"disjunction_v", "<type_traits>", cxx17}, | |
5754 | {"negation", "<type_traits>", cxx17}, | |
5755 | {"negation_v", "<type_traits>", cxx17}, | |
b655c310 | 5756 | /* <unordered_map>. */ |
e1c7971b DM |
5757 | {"unordered_map", "<unordered_map>", cxx11}, |
5758 | {"unordered_multimap", "<unordered_map>", cxx11}, | |
b655c310 | 5759 | /* <unordered_set>. */ |
e1c7971b DM |
5760 | {"unordered_set", "<unordered_set>", cxx11}, |
5761 | {"unordered_multiset", "<unordered_set>", cxx11}, | |
62e98ef1 | 5762 | /* <utility>. */ |
e1c7971b DM |
5763 | {"declval", "<utility>", cxx11}, |
5764 | {"forward", "<utility>", cxx11}, | |
5765 | {"make_pair", "<utility>", cxx98}, | |
5766 | {"move", "<utility>", cxx11}, | |
5767 | {"pair", "<utility>", cxx98}, | |
5768 | /* <variant>. */ | |
5769 | {"variant", "<variant>", cxx17}, | |
5770 | {"visit", "<variant>", cxx17}, | |
b655c310 | 5771 | /* <vector>. */ |
e1c7971b | 5772 | {"vector", "<vector>", cxx98}, |
b655c310 NS |
5773 | }; |
5774 | const size_t num_hints = sizeof (hints) / sizeof (hints[0]); | |
5775 | for (size_t i = 0; i < num_hints; i++) | |
5776 | { | |
01512446 | 5777 | if (strcmp (name, hints[i].name) == 0) |
e1c7971b | 5778 | return &hints[i]; |
b655c310 NS |
5779 | } |
5780 | return NULL; | |
5781 | } | |
00e8de68 | 5782 | |
e1c7971b DM |
5783 | /* Describe DIALECT. */ |
5784 | ||
5785 | static const char * | |
5786 | get_cxx_dialect_name (enum cxx_dialect dialect) | |
5787 | { | |
5788 | switch (dialect) | |
5789 | { | |
5790 | default: | |
5791 | gcc_unreachable (); | |
5792 | case cxx98: | |
5793 | return "C++98"; | |
5794 | case cxx11: | |
5795 | return "C++11"; | |
5796 | case cxx14: | |
5797 | return "C++14"; | |
5798 | case cxx17: | |
5799 | return "C++17"; | |
5800 | case cxx2a: | |
5801 | return "C++2a"; | |
5802 | } | |
5803 | } | |
5804 | ||
7e2de6df DM |
5805 | /* Subclass of deferred_diagnostic for use for names in the "std" namespace |
5806 | that weren't recognized, but for which we know which header it ought to be | |
5807 | in. | |
00e8de68 | 5808 | |
7e2de6df DM |
5809 | Emit a note either suggesting the header to be included, or noting that |
5810 | the current dialect is too early for the given name. */ | |
5811 | ||
5812 | class missing_std_header : public deferred_diagnostic | |
5813 | { | |
5814 | public: | |
5815 | missing_std_header (location_t loc, | |
5816 | const char *name_str, | |
5817 | const std_name_hint *header_hint) | |
5818 | : deferred_diagnostic (loc), | |
5819 | m_name_str (name_str), | |
5820 | m_header_hint (header_hint) | |
5821 | {} | |
5822 | ~missing_std_header () | |
5823 | { | |
5824 | gcc_rich_location richloc (get_location ()); | |
5825 | if (cxx_dialect >= m_header_hint->min_dialect) | |
5826 | { | |
5827 | const char *header = m_header_hint->header; | |
5828 | maybe_add_include_fixit (&richloc, header, true); | |
5829 | inform (&richloc, | |
5830 | "%<std::%s%> is defined in header %qs;" | |
5831 | " did you forget to %<#include %s%>?", | |
5832 | m_name_str, header, header); | |
5833 | } | |
5834 | else | |
5835 | inform (&richloc, | |
5836 | "%<std::%s%> is only available from %s onwards", | |
5837 | m_name_str, get_cxx_dialect_name (m_header_hint->min_dialect)); | |
5838 | } | |
5839 | ||
5840 | private: | |
5841 | const char *m_name_str; | |
5842 | const std_name_hint *m_header_hint; | |
5843 | }; | |
5844 | ||
5845 | /* Attempt to generate a name_hint that suggests pertinent header files | |
5846 | for NAME at LOCATION, for common names within the "std" namespace, | |
5847 | or an empty name_hint if this isn't applicable. */ | |
5848 | ||
5849 | static name_hint | |
cb731872 | 5850 | maybe_suggest_missing_std_header (location_t location, tree name) |
b655c310 | 5851 | { |
b655c310 | 5852 | gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE); |
c8094d83 | 5853 | |
b655c310 | 5854 | const char *name_str = IDENTIFIER_POINTER (name); |
e1c7971b | 5855 | const std_name_hint *header_hint = get_std_name_hint (name_str); |
f661e57e | 5856 | if (!header_hint) |
7e2de6df | 5857 | return name_hint (); |
f661e57e | 5858 | |
7e2de6df DM |
5859 | return name_hint (NULL, new missing_std_header (location, name_str, |
5860 | header_hint)); | |
b655c310 | 5861 | } |
c8094d83 | 5862 | |
7e2de6df DM |
5863 | /* Attempt to generate a name_hint that suggests a missing header file |
5864 | for NAME within SCOPE at LOCATION, or an empty name_hint if this isn't | |
5865 | applicable. */ | |
cb731872 | 5866 | |
7e2de6df | 5867 | static name_hint |
cb731872 DM |
5868 | maybe_suggest_missing_header (location_t location, tree name, tree scope) |
5869 | { | |
5870 | if (scope == NULL_TREE) | |
7e2de6df | 5871 | return name_hint (); |
cb731872 | 5872 | if (TREE_CODE (scope) != NAMESPACE_DECL) |
7e2de6df | 5873 | return name_hint (); |
cb731872 DM |
5874 | /* We only offer suggestions for the "std" namespace. */ |
5875 | if (scope != std_node) | |
7e2de6df | 5876 | return name_hint (); |
cb731872 DM |
5877 | return maybe_suggest_missing_std_header (location, name); |
5878 | } | |
5879 | ||
7e2de6df DM |
5880 | /* Generate a name_hint at LOCATION for NAME, an IDENTIFIER_NODE for which name |
5881 | lookup failed within the explicitly provided SCOPE. | |
c8094d83 | 5882 | |
7e2de6df DM |
5883 | Suggest the the best meaningful candidates (if any), otherwise |
5884 | an empty name_hint is returned. */ | |
5885 | ||
5886 | name_hint | |
b655c310 NS |
5887 | suggest_alternative_in_explicit_scope (location_t location, tree name, |
5888 | tree scope) | |
5889 | { | |
7518398d MP |
5890 | /* Something went very wrong; don't suggest anything. */ |
5891 | if (name == error_mark_node) | |
7e2de6df | 5892 | return name_hint (); |
7518398d | 5893 | |
b655c310 NS |
5894 | /* Resolve any namespace aliases. */ |
5895 | scope = ORIGINAL_NAMESPACE (scope); | |
b9f673eb | 5896 | |
7e2de6df DM |
5897 | name_hint hint = maybe_suggest_missing_header (location, name, scope); |
5898 | if (hint) | |
5899 | return hint; | |
f661e57e | 5900 | |
b655c310 | 5901 | cp_binding_level *level = NAMESPACE_LEVEL (scope); |
d4d8c232 | 5902 | |
b655c310 NS |
5903 | best_match <tree, const char *> bm (name); |
5904 | consider_binding_level (name, bm, level, false, FUZZY_LOOKUP_NAME); | |
d4d8c232 | 5905 | |
b655c310 NS |
5906 | /* See if we have a good suggesion for the user. */ |
5907 | const char *fuzzy_name = bm.get_best_meaningful_candidate (); | |
5908 | if (fuzzy_name) | |
7e2de6df | 5909 | return name_hint (fuzzy_name, NULL); |
d4d8c232 | 5910 | |
7e2de6df | 5911 | return name_hint (); |
b655c310 | 5912 | } |
d4d8c232 | 5913 | |
3ded6ffd DM |
5914 | /* Given NAME, look within SCOPED_ENUM for possible spell-correction |
5915 | candidates. */ | |
5916 | ||
5917 | name_hint | |
5918 | suggest_alternative_in_scoped_enum (tree name, tree scoped_enum) | |
5919 | { | |
5920 | gcc_assert (SCOPED_ENUM_P (scoped_enum)); | |
5921 | ||
5922 | best_match <tree, const char *> bm (name); | |
5923 | for (tree iter = TYPE_VALUES (scoped_enum); iter; iter = TREE_CHAIN (iter)) | |
5924 | { | |
5925 | tree id = TREE_PURPOSE (iter); | |
5926 | bm.consider (IDENTIFIER_POINTER (id)); | |
5927 | } | |
5928 | return name_hint (bm.get_best_meaningful_candidate (), NULL); | |
5929 | } | |
5930 | ||
b655c310 NS |
5931 | /* Look up NAME (an IDENTIFIER_NODE) in SCOPE (either a NAMESPACE_DECL |
5932 | or a class TYPE). | |
00e8de68 | 5933 | |
b655c310 NS |
5934 | If PREFER_TYPE is > 0, we only return TYPE_DECLs or namespaces. |
5935 | If PREFER_TYPE is > 1, we only return TYPE_DECLs. | |
00e8de68 | 5936 | |
b655c310 NS |
5937 | Returns a DECL (or OVERLOAD, or BASELINK) representing the |
5938 | declaration found. If no suitable declaration can be found, | |
5939 | ERROR_MARK_NODE is returned. If COMPLAIN is true and SCOPE is | |
5940 | neither a class-type nor a namespace a diagnostic is issued. */ | |
00e8de68 | 5941 | |
98803730 | 5942 | tree |
b655c310 NS |
5943 | lookup_qualified_name (tree scope, tree name, int prefer_type, bool complain, |
5944 | bool find_hidden) | |
98803730 | 5945 | { |
b655c310 NS |
5946 | tree t = NULL_TREE; |
5947 | ||
5948 | if (TREE_CODE (scope) == NAMESPACE_DECL) | |
5949 | { | |
b655c310 NS |
5950 | int flags = lookup_flags (prefer_type, /*namespaces_only*/false); |
5951 | if (find_hidden) | |
5952 | flags |= LOOKUP_HIDDEN; | |
9dda0ace NS |
5953 | name_lookup lookup (name, flags); |
5954 | ||
5955 | if (qualified_namespace_lookup (scope, &lookup)) | |
5956 | t = lookup.value; | |
b655c310 NS |
5957 | } |
5958 | else if (cxx_dialect != cxx98 && TREE_CODE (scope) == ENUMERAL_TYPE) | |
5959 | t = lookup_enumerator (scope, name); | |
5960 | else if (is_class_type (scope, complain)) | |
5961 | t = lookup_member (scope, name, 2, prefer_type, tf_warning_or_error); | |
5962 | ||
5963 | if (!t) | |
5964 | return error_mark_node; | |
5965 | return t; | |
98803730 MS |
5966 | } |
5967 | ||
b655c310 NS |
5968 | /* [namespace.qual] |
5969 | Accepts the NAME to lookup and its qualifying SCOPE. | |
5970 | Returns the name/type pair found into the cxx_binding *RESULT, | |
5971 | or false on error. */ | |
461c6fce | 5972 | |
b655c310 | 5973 | static bool |
9dda0ace NS |
5974 | qualified_namespace_lookup (tree scope, name_lookup *lookup) |
5975 | { | |
b655c310 | 5976 | timevar_start (TV_NAME_LOOKUP); |
9dda0ace NS |
5977 | query_oracle (lookup->name); |
5978 | bool found = lookup->search_qualified (ORIGINAL_NAMESPACE (scope)); | |
b655c310 | 5979 | timevar_stop (TV_NAME_LOOKUP); |
9dda0ace | 5980 | return found; |
575bfb00 LC |
5981 | } |
5982 | ||
b655c310 NS |
5983 | /* Helper function for lookup_name_fuzzy. |
5984 | Traverse binding level LVL, looking for good name matches for NAME | |
5985 | (and BM). */ | |
5986 | static void | |
5987 | consider_binding_level (tree name, best_match <tree, const char *> &bm, | |
5988 | cp_binding_level *lvl, bool look_within_fields, | |
5989 | enum lookup_name_fuzzy_kind kind) | |
00e8de68 | 5990 | { |
b655c310 NS |
5991 | if (look_within_fields) |
5992 | if (lvl->this_entity && TREE_CODE (lvl->this_entity) == RECORD_TYPE) | |
5993 | { | |
5994 | tree type = lvl->this_entity; | |
5995 | bool want_type_p = (kind == FUZZY_LOOKUP_TYPENAME); | |
5996 | tree best_matching_field | |
5997 | = lookup_member_fuzzy (type, name, want_type_p); | |
5998 | if (best_matching_field) | |
5999 | bm.consider (IDENTIFIER_POINTER (best_matching_field)); | |
6000 | } | |
00e8de68 | 6001 | |
c79144f8 DM |
6002 | /* Only suggest names reserved for the implementation if NAME begins |
6003 | with an underscore. */ | |
6004 | bool consider_implementation_names = (IDENTIFIER_POINTER (name)[0] == '_'); | |
6005 | ||
b655c310 | 6006 | for (tree t = lvl->names; t; t = TREE_CHAIN (t)) |
00e8de68 | 6007 | { |
b655c310 | 6008 | tree d = t; |
00e8de68 | 6009 | |
b655c310 NS |
6010 | /* OVERLOADs or decls from using declaration are wrapped into |
6011 | TREE_LIST. */ | |
6012 | if (TREE_CODE (d) == TREE_LIST) | |
87c976ae | 6013 | d = OVL_FIRST (TREE_VALUE (d)); |
00e8de68 | 6014 | |
b655c310 NS |
6015 | /* Don't use bindings from implicitly declared functions, |
6016 | as they were likely misspellings themselves. */ | |
6017 | if (TREE_TYPE (d) == error_mark_node) | |
6018 | continue; | |
00e8de68 | 6019 | |
b655c310 NS |
6020 | /* Skip anticipated decls of builtin functions. */ |
6021 | if (TREE_CODE (d) == FUNCTION_DECL | |
3d78e008 | 6022 | && fndecl_built_in_p (d) |
b655c310 NS |
6023 | && DECL_ANTICIPATED (d)) |
6024 | continue; | |
575bfb00 | 6025 | |
66bd3086 DM |
6026 | /* Skip compiler-generated variables (e.g. __for_begin/__for_end |
6027 | within range for). */ | |
6028 | if (TREE_CODE (d) == VAR_DECL | |
6029 | && DECL_ARTIFICIAL (d)) | |
6030 | continue; | |
6031 | ||
c79144f8 DM |
6032 | tree suggestion = DECL_NAME (d); |
6033 | if (!suggestion) | |
6034 | continue; | |
6035 | ||
5da1234b DM |
6036 | /* Don't suggest names that are for anonymous aggregate types, as |
6037 | they are an implementation detail generated by the compiler. */ | |
7daef9ac | 6038 | if (IDENTIFIER_ANON_P (suggestion)) |
5da1234b DM |
6039 | continue; |
6040 | ||
c79144f8 DM |
6041 | const char *suggestion_str = IDENTIFIER_POINTER (suggestion); |
6042 | ||
6043 | /* Ignore internal names with spaces in them. */ | |
6044 | if (strchr (suggestion_str, ' ')) | |
6045 | continue; | |
6046 | ||
6047 | /* Don't suggest names that are reserved for use by the | |
6048 | implementation, unless NAME began with an underscore. */ | |
6049 | if (name_reserved_for_implementation_p (suggestion_str) | |
6050 | && !consider_implementation_names) | |
6051 | continue; | |
6052 | ||
6053 | bm.consider (suggestion_str); | |
b655c310 | 6054 | } |
575bfb00 LC |
6055 | } |
6056 | ||
01ada121 DM |
6057 | /* Subclass of deferred_diagnostic. Notify the user that the |
6058 | given macro was used before it was defined. | |
6059 | This can be done in the C++ frontend since tokenization happens | |
6060 | upfront. */ | |
6061 | ||
6062 | class macro_use_before_def : public deferred_diagnostic | |
6063 | { | |
6064 | public: | |
b0cc1e53 DM |
6065 | /* Factory function. Return a new macro_use_before_def instance if |
6066 | appropriate, or return NULL. */ | |
6067 | static macro_use_before_def * | |
6068 | maybe_make (location_t use_loc, cpp_hashnode *macro) | |
6069 | { | |
620e594b | 6070 | location_t def_loc = cpp_macro_definition_location (macro); |
b0cc1e53 DM |
6071 | if (def_loc == UNKNOWN_LOCATION) |
6072 | return NULL; | |
6073 | ||
6074 | /* We only want to issue a note if the macro was used *before* it was | |
6075 | defined. | |
6076 | We don't want to issue a note for cases where a macro was incorrectly | |
6077 | used, leaving it unexpanded (e.g. by using the wrong argument | |
6078 | count). */ | |
6079 | if (!linemap_location_before_p (line_table, use_loc, def_loc)) | |
6080 | return NULL; | |
6081 | ||
6082 | return new macro_use_before_def (use_loc, macro); | |
6083 | } | |
6084 | ||
6085 | private: | |
01ada121 DM |
6086 | /* Ctor. LOC is the location of the usage. MACRO is the |
6087 | macro that was used. */ | |
6088 | macro_use_before_def (location_t loc, cpp_hashnode *macro) | |
6089 | : deferred_diagnostic (loc), m_macro (macro) | |
6090 | { | |
6091 | gcc_assert (macro); | |
6092 | } | |
6093 | ||
6094 | ~macro_use_before_def () | |
6095 | { | |
6096 | if (is_suppressed_p ()) | |
6097 | return; | |
6098 | ||
b0cc1e53 DM |
6099 | inform (get_location (), "the macro %qs had not yet been defined", |
6100 | (const char *)m_macro->ident.str); | |
6101 | inform (cpp_macro_definition_location (m_macro), | |
6102 | "it was later defined here"); | |
01ada121 DM |
6103 | } |
6104 | ||
6105 | private: | |
6106 | cpp_hashnode *m_macro; | |
6107 | }; | |
6108 | ||
0d7d8e66 DM |
6109 | /* Determine if it can ever make sense to offer RID as a suggestion for |
6110 | a misspelling. | |
6111 | ||
6112 | Subroutine of lookup_name_fuzzy. */ | |
6113 | ||
6114 | static bool | |
6115 | suggest_rid_p (enum rid rid) | |
6116 | { | |
6117 | switch (rid) | |
6118 | { | |
6119 | /* Support suggesting function-like keywords. */ | |
6120 | case RID_STATIC_ASSERT: | |
6121 | return true; | |
6122 | ||
6123 | default: | |
6124 | /* Support suggesting the various decl-specifier words, to handle | |
6125 | e.g. "singed" vs "signed" typos. */ | |
6126 | if (cp_keyword_starts_decl_specifier_p (rid)) | |
6127 | return true; | |
6128 | ||
6129 | /* Otherwise, don't offer it. This avoids suggesting e.g. "if" | |
6130 | and "do" for short misspellings, which are likely to lead to | |
6131 | nonsensical results. */ | |
6132 | return false; | |
6133 | } | |
6134 | } | |
01ada121 | 6135 | |
b655c310 NS |
6136 | /* Search for near-matches for NAME within the current bindings, and within |
6137 | macro names, returning the best match as a const char *, or NULL if | |
01ada121 DM |
6138 | no reasonable match is found. |
6139 | ||
6140 | Use LOC for any deferred diagnostics. */ | |
575bfb00 | 6141 | |
6c7a259b | 6142 | name_hint |
01ada121 | 6143 | lookup_name_fuzzy (tree name, enum lookup_name_fuzzy_kind kind, location_t loc) |
e8f43da6 | 6144 | { |
b655c310 | 6145 | gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE); |
e8f43da6 | 6146 | |
26edace6 DM |
6147 | /* First, try some well-known names in the C++ standard library, in case |
6148 | the user forgot a #include. */ | |
6149 | const char *header_hint | |
6150 | = get_cp_stdlib_header_for_name (IDENTIFIER_POINTER (name)); | |
6151 | if (header_hint) | |
6152 | return name_hint (NULL, | |
6153 | new suggest_missing_header (loc, | |
6154 | IDENTIFIER_POINTER (name), | |
6155 | header_hint)); | |
6156 | ||
b655c310 | 6157 | best_match <tree, const char *> bm (name); |
e8f43da6 | 6158 | |
b655c310 NS |
6159 | cp_binding_level *lvl; |
6160 | for (lvl = scope_chain->class_bindings; lvl; lvl = lvl->level_chain) | |
6161 | consider_binding_level (name, bm, lvl, true, kind); | |
e8f43da6 | 6162 | |
b655c310 NS |
6163 | for (lvl = current_binding_level; lvl; lvl = lvl->level_chain) |
6164 | consider_binding_level (name, bm, lvl, false, kind); | |
e8f43da6 | 6165 | |
b655c310 NS |
6166 | /* Consider macros: if the user misspelled a macro name e.g. "SOME_MACRO" |
6167 | as: | |
6168 | x = SOME_OTHER_MACRO (y); | |
6169 | then "SOME_OTHER_MACRO" will survive to the frontend and show up | |
6170 | as a misspelled identifier. | |
e8f43da6 | 6171 | |
b655c310 NS |
6172 | Use the best distance so far so that a candidate is only set if |
6173 | a macro is better than anything so far. This allows early rejection | |
6174 | (without calculating the edit distance) of macro names that must have | |
6175 | distance >= bm.get_best_distance (), and means that we only get a | |
6176 | non-NULL result for best_macro_match if it's better than any of | |
6177 | the identifiers already checked. */ | |
6178 | best_macro_match bmm (name, bm.get_best_distance (), parse_in); | |
6179 | cpp_hashnode *best_macro = bmm.get_best_meaningful_candidate (); | |
6180 | /* If a macro is the closest so far to NAME, consider it. */ | |
6181 | if (best_macro) | |
6182 | bm.consider ((const char *)best_macro->ident.str); | |
01ada121 DM |
6183 | else if (bmm.get_best_distance () == 0) |
6184 | { | |
b0cc1e53 DM |
6185 | /* If we have an exact match for a macro name, then either the |
6186 | macro was used with the wrong argument count, or the macro | |
6187 | has been used before it was defined. */ | |
3f6677f4 NS |
6188 | if (cpp_hashnode *macro = bmm.blithely_get_best_candidate ()) |
6189 | if (cpp_user_macro_p (macro)) | |
6190 | return name_hint (NULL, | |
6191 | macro_use_before_def::maybe_make (loc, macro)); | |
01ada121 | 6192 | } |
00e8de68 | 6193 | |
b655c310 NS |
6194 | /* Try the "starts_decl_specifier_p" keywords to detect |
6195 | "singed" vs "signed" typos. */ | |
6196 | for (unsigned i = 0; i < num_c_common_reswords; i++) | |
6197 | { | |
6198 | const c_common_resword *resword = &c_common_reswords[i]; | |
00e8de68 | 6199 | |
0d7d8e66 DM |
6200 | if (!suggest_rid_p (resword->rid)) |
6201 | continue; | |
00e8de68 | 6202 | |
b655c310 NS |
6203 | tree resword_identifier = ridpointers [resword->rid]; |
6204 | if (!resword_identifier) | |
6205 | continue; | |
6206 | gcc_assert (TREE_CODE (resword_identifier) == IDENTIFIER_NODE); | |
00e8de68 | 6207 | |
b655c310 NS |
6208 | /* Only consider reserved words that survived the |
6209 | filtering in init_reswords (e.g. for -std). */ | |
84c0088f | 6210 | if (!IDENTIFIER_KEYWORD_P (resword_identifier)) |
b655c310 | 6211 | continue; |
00e8de68 | 6212 | |
b655c310 NS |
6213 | bm.consider (IDENTIFIER_POINTER (resword_identifier)); |
6214 | } | |
6215 | ||
6c7a259b | 6216 | return name_hint (bm.get_best_meaningful_candidate (), NULL); |
b655c310 | 6217 | } |
5a167978 | 6218 | |
b655c310 | 6219 | /* Subroutine of outer_binding. |
5a167978 | 6220 | |
b655c310 NS |
6221 | Returns TRUE if BINDING is a binding to a template parameter of |
6222 | SCOPE. In that case SCOPE is the scope of a primary template | |
6223 | parameter -- in the sense of G++, i.e, a template that has its own | |
6224 | template header. | |
5a167978 | 6225 | |
b655c310 | 6226 | Returns FALSE otherwise. */ |
5a167978 GDR |
6227 | |
6228 | static bool | |
b655c310 NS |
6229 | binding_to_template_parms_of_scope_p (cxx_binding *binding, |
6230 | cp_binding_level *scope) | |
5a167978 | 6231 | { |
b655c310 NS |
6232 | tree binding_value, tmpl, tinfo; |
6233 | int level; | |
5a167978 | 6234 | |
b655c310 NS |
6235 | if (!binding || !scope || !scope->this_entity) |
6236 | return false; | |
6237 | ||
6238 | binding_value = binding->value ? binding->value : binding->type; | |
6239 | tinfo = get_template_info (scope->this_entity); | |
6240 | ||
6241 | /* BINDING_VALUE must be a template parm. */ | |
6242 | if (binding_value == NULL_TREE | |
6243 | || (!DECL_P (binding_value) | |
6244 | || !DECL_TEMPLATE_PARM_P (binding_value))) | |
6245 | return false; | |
6246 | ||
6247 | /* The level of BINDING_VALUE. */ | |
6248 | level = | |
6249 | template_type_parameter_p (binding_value) | |
6250 | ? TEMPLATE_PARM_LEVEL (TEMPLATE_TYPE_PARM_INDEX | |
6251 | (TREE_TYPE (binding_value))) | |
6252 | : TEMPLATE_PARM_LEVEL (DECL_INITIAL (binding_value)); | |
6253 | ||
6254 | /* The template of the current scope, iff said scope is a primary | |
6255 | template. */ | |
6256 | tmpl = (tinfo | |
6257 | && PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo)) | |
6258 | ? TI_TEMPLATE (tinfo) | |
6259 | : NULL_TREE); | |
6260 | ||
6261 | /* If the level of the parm BINDING_VALUE equals the depth of TMPL, | |
6262 | then BINDING_VALUE is a parameter of TMPL. */ | |
6263 | return (tmpl && level == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl))); | |
5a167978 GDR |
6264 | } |
6265 | ||
b655c310 NS |
6266 | /* Return the innermost non-namespace binding for NAME from a scope |
6267 | containing BINDING, or, if BINDING is NULL, the current scope. | |
6268 | Please note that for a given template, the template parameters are | |
6269 | considered to be in the scope containing the current scope. | |
6270 | If CLASS_P is false, then class bindings are ignored. */ | |
86098eb8 | 6271 | |
b655c310 NS |
6272 | cxx_binding * |
6273 | outer_binding (tree name, | |
6274 | cxx_binding *binding, | |
6275 | bool class_p) | |
86098eb8 | 6276 | { |
b655c310 NS |
6277 | cxx_binding *outer; |
6278 | cp_binding_level *scope; | |
6279 | cp_binding_level *outer_scope; | |
d4ccba66 | 6280 | |
b655c310 | 6281 | if (binding) |
86098eb8 | 6282 | { |
b655c310 NS |
6283 | scope = binding->scope->level_chain; |
6284 | outer = binding->previous; | |
6285 | } | |
6286 | else | |
6287 | { | |
6288 | scope = current_binding_level; | |
6289 | outer = IDENTIFIER_BINDING (name); | |
86098eb8 | 6290 | } |
b655c310 | 6291 | outer_scope = outer ? outer->scope : NULL; |
d4ccba66 | 6292 | |
b655c310 NS |
6293 | /* Because we create class bindings lazily, we might be missing a |
6294 | class binding for NAME. If there are any class binding levels | |
6295 | between the LAST_BINDING_LEVEL and the scope in which OUTER was | |
6296 | declared, we must lookup NAME in those class scopes. */ | |
6297 | if (class_p) | |
6298 | while (scope && scope != outer_scope && scope->kind != sk_namespace) | |
6299 | { | |
6300 | if (scope->kind == sk_class) | |
6301 | { | |
6302 | cxx_binding *class_binding; | |
d4ccba66 | 6303 | |
b655c310 NS |
6304 | class_binding = get_class_binding (name, scope); |
6305 | if (class_binding) | |
6306 | { | |
6307 | /* Thread this new class-scope binding onto the | |
6308 | IDENTIFIER_BINDING list so that future lookups | |
6309 | find it quickly. */ | |
6310 | class_binding->previous = outer; | |
6311 | if (binding) | |
6312 | binding->previous = class_binding; | |
6313 | else | |
6314 | IDENTIFIER_BINDING (name) = class_binding; | |
6315 | return class_binding; | |
6316 | } | |
6317 | } | |
6318 | /* If we are in a member template, the template parms of the member | |
6319 | template are considered to be inside the scope of the containing | |
6320 | class, but within G++ the class bindings are all pushed between the | |
6321 | template parms and the function body. So if the outer binding is | |
6322 | a template parm for the current scope, return it now rather than | |
6323 | look for a class binding. */ | |
6324 | if (outer_scope && outer_scope->kind == sk_template_parms | |
6325 | && binding_to_template_parms_of_scope_p (outer, scope)) | |
6326 | return outer; | |
6327 | ||
6328 | scope = scope->level_chain; | |
6329 | } | |
6330 | ||
6331 | return outer; | |
86098eb8 JM |
6332 | } |
6333 | ||
b655c310 NS |
6334 | /* Return the innermost block-scope or class-scope value binding for |
6335 | NAME, or NULL_TREE if there is no such binding. */ | |
5a167978 | 6336 | |
b655c310 NS |
6337 | tree |
6338 | innermost_non_namespace_value (tree name) | |
5a167978 | 6339 | { |
b655c310 NS |
6340 | cxx_binding *binding; |
6341 | binding = outer_binding (name, /*binding=*/NULL, /*class_p=*/true); | |
6342 | return binding ? binding->value : NULL_TREE; | |
6343 | } | |
5a167978 | 6344 | |
b655c310 NS |
6345 | /* Look up NAME in the current binding level and its superiors in the |
6346 | namespace of variables, functions and typedefs. Return a ..._DECL | |
6347 | node of some kind representing its definition if there is only one | |
6348 | such declaration, or return a TREE_LIST with all the overloaded | |
6349 | definitions if there are many, or return 0 if it is undefined. | |
6350 | Hidden name, either friend declaration or built-in function, are | |
6351 | not ignored. | |
86098eb8 | 6352 | |
b655c310 NS |
6353 | If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces. |
6354 | If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces). | |
6355 | Otherwise we prefer non-TYPE_DECLs. | |
c8094d83 | 6356 | |
b655c310 NS |
6357 | If NONCLASS is nonzero, bindings in class scopes are ignored. If |
6358 | BLOCK_P is false, bindings in block scopes are ignored. */ | |
4cfaec1c | 6359 | |
b655c310 NS |
6360 | static tree |
6361 | lookup_name_real_1 (tree name, int prefer_type, int nonclass, bool block_p, | |
6362 | int namespaces_only, int flags) | |
6363 | { | |
6364 | cxx_binding *iter; | |
6365 | tree val = NULL_TREE; | |
5a167978 | 6366 | |
b655c310 NS |
6367 | query_oracle (name); |
6368 | ||
6369 | /* Conversion operators are handled specially because ordinary | |
6370 | unqualified name lookup will not find template conversion | |
6371 | operators. */ | |
84c0088f | 6372 | if (IDENTIFIER_CONV_OP_P (name)) |
d63d5d0c | 6373 | { |
b655c310 | 6374 | cp_binding_level *level; |
d63d5d0c | 6375 | |
b655c310 NS |
6376 | for (level = current_binding_level; |
6377 | level && level->kind != sk_namespace; | |
6378 | level = level->level_chain) | |
6379 | { | |
6380 | tree class_type; | |
6381 | tree operators; | |
6382 | ||
6383 | /* A conversion operator can only be declared in a class | |
6384 | scope. */ | |
6385 | if (level->kind != sk_class) | |
6386 | continue; | |
6387 | ||
6388 | /* Lookup the conversion operator in the class. */ | |
6389 | class_type = level->this_entity; | |
6390 | operators = lookup_fnfields (class_type, name, /*protect=*/0); | |
6391 | if (operators) | |
6392 | return operators; | |
6393 | } | |
6394 | ||
6395 | return NULL_TREE; | |
d63d5d0c | 6396 | } |
c8094d83 | 6397 | |
b655c310 NS |
6398 | flags |= lookup_flags (prefer_type, namespaces_only); |
6399 | ||
6400 | /* First, look in non-namespace scopes. */ | |
6401 | ||
6402 | if (current_class_type == NULL_TREE) | |
6403 | nonclass = 1; | |
5a167978 | 6404 | |
b655c310 NS |
6405 | if (block_p || !nonclass) |
6406 | for (iter = outer_binding (name, NULL, !nonclass); | |
6407 | iter; | |
6408 | iter = outer_binding (name, iter, !nonclass)) | |
6409 | { | |
6410 | tree binding; | |
5a167978 | 6411 | |
b655c310 NS |
6412 | /* Skip entities we don't want. */ |
6413 | if (LOCAL_BINDING_P (iter) ? !block_p : nonclass) | |
6414 | continue; | |
5a167978 | 6415 | |
b655c310 NS |
6416 | /* If this is the kind of thing we're looking for, we're done. */ |
6417 | if (qualify_lookup (iter->value, flags)) | |
6418 | binding = iter->value; | |
6419 | else if ((flags & LOOKUP_PREFER_TYPES) | |
6420 | && qualify_lookup (iter->type, flags)) | |
6421 | binding = iter->type; | |
6422 | else | |
6423 | binding = NULL_TREE; | |
5a167978 | 6424 | |
b655c310 NS |
6425 | if (binding) |
6426 | { | |
ef4c5e78 | 6427 | if (TREE_CODE (binding) == TYPE_DECL && DECL_HIDDEN_P (binding)) |
b655c310 NS |
6428 | { |
6429 | /* A non namespace-scope binding can only be hidden in the | |
6430 | presence of a local class, due to friend declarations. | |
5a167978 | 6431 | |
b655c310 | 6432 | In particular, consider: |
ba796308 | 6433 | |
b655c310 NS |
6434 | struct C; |
6435 | void f() { | |
6436 | struct A { | |
6437 | friend struct B; | |
6438 | friend struct C; | |
6439 | void g() { | |
6440 | B* b; // error: B is hidden | |
6441 | C* c; // OK, finds ::C | |
6442 | } | |
6443 | }; | |
6444 | B *b; // error: B is hidden | |
6445 | C *c; // OK, finds ::C | |
6446 | struct B {}; | |
6447 | B *bb; // OK | |
6448 | } | |
5a167978 | 6449 | |
b655c310 NS |
6450 | The standard says that "B" is a local class in "f" |
6451 | (but not nested within "A") -- but that name lookup | |
6452 | for "B" does not find this declaration until it is | |
6453 | declared directly with "f". | |
5a167978 | 6454 | |
b655c310 | 6455 | In particular: |
c8094d83 | 6456 | |
b655c310 | 6457 | [class.friend] |
5a167978 | 6458 | |
b655c310 NS |
6459 | If a friend declaration appears in a local class and |
6460 | the name specified is an unqualified name, a prior | |
6461 | declaration is looked up without considering scopes | |
6462 | that are outside the innermost enclosing non-class | |
6463 | scope. For a friend function declaration, if there is | |
6464 | no prior declaration, the program is ill-formed. For a | |
6465 | friend class declaration, if there is no prior | |
6466 | declaration, the class that is specified belongs to the | |
6467 | innermost enclosing non-class scope, but if it is | |
6468 | subsequently referenced, its name is not found by name | |
6469 | lookup until a matching declaration is provided in the | |
6470 | innermost enclosing nonclass scope. | |
ccb14335 | 6471 | |
b655c310 NS |
6472 | So just keep looking for a non-hidden binding. |
6473 | */ | |
6474 | gcc_assert (TREE_CODE (binding) == TYPE_DECL); | |
6475 | continue; | |
6476 | } | |
6477 | val = binding; | |
6478 | break; | |
6479 | } | |
6480 | } | |
2395cd2e | 6481 | |
b655c310 NS |
6482 | /* Now lookup in namespace scopes. */ |
6483 | if (!val) | |
932f48ac NS |
6484 | { |
6485 | name_lookup lookup (name, flags); | |
6486 | if (lookup.search_unqualified | |
6487 | (current_decl_namespace (), current_binding_level)) | |
6488 | val = lookup.value; | |
6489 | } | |
c8b2e872 | 6490 | |
b655c310 NS |
6491 | /* If we have a single function from a using decl, pull it out. */ |
6492 | if (val && TREE_CODE (val) == OVERLOAD && !really_overloaded_fn (val)) | |
6493 | val = OVL_FUNCTION (val); | |
6494 | ||
6495 | return val; | |
db10df3d JM |
6496 | } |
6497 | ||
b655c310 | 6498 | /* Wrapper for lookup_name_real_1. */ |
db10df3d | 6499 | |
b655c310 NS |
6500 | tree |
6501 | lookup_name_real (tree name, int prefer_type, int nonclass, bool block_p, | |
6502 | int namespaces_only, int flags) | |
db10df3d | 6503 | { |
b655c310 NS |
6504 | tree ret; |
6505 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); | |
6506 | ret = lookup_name_real_1 (name, prefer_type, nonclass, block_p, | |
6507 | namespaces_only, flags); | |
6508 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); | |
6509 | return ret; | |
6510 | } | |
db10df3d | 6511 | |
b655c310 NS |
6512 | tree |
6513 | lookup_name_nonclass (tree name) | |
6514 | { | |
6515 | return lookup_name_real (name, 0, 1, /*block_p=*/true, 0, 0); | |
db10df3d JM |
6516 | } |
6517 | ||
b655c310 NS |
6518 | tree |
6519 | lookup_name (tree name) | |
6520 | { | |
6521 | return lookup_name_real (name, 0, 0, /*block_p=*/true, 0, 0); | |
6522 | } | |
db10df3d | 6523 | |
b655c310 NS |
6524 | tree |
6525 | lookup_name_prefer_type (tree name, int prefer_type) | |
db10df3d | 6526 | { |
b655c310 NS |
6527 | return lookup_name_real (name, prefer_type, 0, /*block_p=*/true, 0, 0); |
6528 | } | |
db10df3d | 6529 | |
b655c310 NS |
6530 | /* Look up NAME for type used in elaborated name specifier in |
6531 | the scopes given by SCOPE. SCOPE can be either TS_CURRENT or | |
6532 | TS_WITHIN_ENCLOSING_NON_CLASS. Although not implied by the | |
6533 | name, more scopes are checked if cleanup or template parameter | |
6534 | scope is encountered. | |
db10df3d | 6535 | |
b655c310 NS |
6536 | Unlike lookup_name_real, we make sure that NAME is actually |
6537 | declared in the desired scope, not from inheritance, nor using | |
6538 | directive. For using declaration, there is DR138 still waiting | |
6539 | to be resolved. Hidden name coming from an earlier friend | |
6540 | declaration is also returned. | |
db10df3d | 6541 | |
b655c310 NS |
6542 | A TYPE_DECL best matching the NAME is returned. Catching error |
6543 | and issuing diagnostics are caller's responsibility. */ | |
db10df3d | 6544 | |
b655c310 NS |
6545 | static tree |
6546 | lookup_type_scope_1 (tree name, tag_scope scope) | |
6547 | { | |
4ebcf1c2 | 6548 | cp_binding_level *b = current_binding_level; |
5a167978 | 6549 | |
4ebcf1c2 NS |
6550 | if (b->kind != sk_namespace) |
6551 | /* Look in non-namespace scopes. */ | |
6552 | for (cxx_binding *iter = NULL; | |
6553 | (iter = outer_binding (name, iter, /*class_p=*/ true)); ) | |
6554 | { | |
6555 | /* First check we're supposed to be looking in this scope -- | |
6556 | if we're not, we're done. */ | |
6557 | for (; b != iter->scope; b = b->level_chain) | |
6558 | if (!(b->kind == sk_cleanup | |
6559 | || b->kind == sk_template_parms | |
6560 | || b->kind == sk_function_parms | |
6561 | || (b->kind == sk_class | |
6562 | && scope == ts_within_enclosing_non_class))) | |
6563 | return NULL_TREE; | |
6564 | ||
6565 | /* Check if this is the kind of thing we're looking for. If | |
6566 | SCOPE is TS_CURRENT, also make sure it doesn't come from | |
6567 | base class. For ITER->VALUE, we can simply use | |
6568 | INHERITED_VALUE_BINDING_P. For ITER->TYPE, we have to | |
6569 | use our own check. | |
6570 | ||
6571 | We check ITER->TYPE before ITER->VALUE in order to handle | |
6572 | typedef struct C {} C; | |
6573 | correctly. */ | |
6574 | if (tree type = iter->type) | |
41d93b16 NS |
6575 | if (qualify_lookup (type, LOOKUP_PREFER_TYPES) |
6576 | && (scope != ts_current | |
6577 | || LOCAL_BINDING_P (iter) | |
6578 | || DECL_CONTEXT (type) == iter->scope->this_entity)) | |
6579 | return type; | |
6580 | ||
6581 | if (qualify_lookup (iter->value, LOOKUP_PREFER_TYPES) | |
6582 | && (scope != ts_current | |
6583 | || !INHERITED_VALUE_BINDING_P (iter))) | |
4ebcf1c2 NS |
6584 | return iter->value; |
6585 | } | |
b655c310 | 6586 | |
4ebcf1c2 NS |
6587 | /* Now check if we can look in namespace scope. */ |
6588 | for (; b->kind != sk_namespace; b = b->level_chain) | |
6589 | if (!(b->kind == sk_cleanup | |
6590 | || b->kind == sk_template_parms | |
6591 | || b->kind == sk_function_parms | |
6592 | || (b->kind == sk_class | |
6593 | && scope == ts_within_enclosing_non_class))) | |
6594 | return NULL_TREE; | |
b655c310 | 6595 | |
4ebcf1c2 NS |
6596 | /* Look in the innermost namespace. */ |
6597 | tree ns = b->this_entity; | |
6598 | if (tree *slot = find_namespace_slot (ns, name)) | |
5a167978 | 6599 | { |
4ebcf1c2 NS |
6600 | /* If this is the kind of thing we're looking for, we're done. */ |
6601 | if (tree type = MAYBE_STAT_TYPE (*slot)) | |
6602 | if (qualify_lookup (type, LOOKUP_PREFER_TYPES)) | |
6603 | return type; | |
5d80a306 | 6604 | |
4ebcf1c2 NS |
6605 | if (tree decl = MAYBE_STAT_DECL (*slot)) |
6606 | if (qualify_lookup (decl, LOOKUP_PREFER_TYPES)) | |
6607 | return decl; | |
5a167978 | 6608 | } |
5a167978 | 6609 | |
b655c310 | 6610 | return NULL_TREE; |
5a167978 | 6611 | } |
b655c310 NS |
6612 | |
6613 | /* Wrapper for lookup_type_scope_1. */ | |
5a167978 | 6614 | |
b655c310 NS |
6615 | tree |
6616 | lookup_type_scope (tree name, tag_scope scope) | |
c166b898 | 6617 | { |
b655c310 NS |
6618 | tree ret; |
6619 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); | |
6620 | ret = lookup_type_scope_1 (name, scope); | |
6621 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); | |
6622 | return ret; | |
c166b898 ILT |
6623 | } |
6624 | ||
b655c310 NS |
6625 | /* Returns true iff DECL is a block-scope extern declaration of a function |
6626 | or variable. */ | |
6627 | ||
6628 | bool | |
6629 | is_local_extern (tree decl) | |
5a167978 | 6630 | { |
b655c310 | 6631 | cxx_binding *binding; |
5a167978 | 6632 | |
b655c310 NS |
6633 | /* For functions, this is easy. */ |
6634 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
6635 | return DECL_LOCAL_FUNCTION_P (decl); | |
d63d5d0c | 6636 | |
b655c310 NS |
6637 | if (!VAR_P (decl)) |
6638 | return false; | |
6639 | if (!current_function_decl) | |
6640 | return false; | |
5a167978 | 6641 | |
b655c310 NS |
6642 | /* For variables, this is not easy. We need to look at the binding stack |
6643 | for the identifier to see whether the decl we have is a local. */ | |
6644 | for (binding = IDENTIFIER_BINDING (DECL_NAME (decl)); | |
6645 | binding && binding->scope->kind != sk_namespace; | |
6646 | binding = binding->previous) | |
6647 | if (binding->value == decl) | |
6648 | return LOCAL_BINDING_P (binding); | |
5a167978 | 6649 | |
b655c310 NS |
6650 | return false; |
6651 | } | |
ca1085f0 | 6652 | |
00e8de68 GDR |
6653 | /* The type TYPE is being declared. If it is a class template, or a |
6654 | specialization of a class template, do any processing required and | |
6655 | perform error-checking. If IS_FRIEND is nonzero, this TYPE is | |
6656 | being declared a friend. B is the binding level at which this TYPE | |
6657 | should be bound. | |
6658 | ||
6659 | Returns the TYPE_DECL for TYPE, which may have been altered by this | |
6660 | processing. */ | |
6661 | ||
6662 | static tree | |
bd3d082e | 6663 | maybe_process_template_type_declaration (tree type, int is_friend, |
2c140474 | 6664 | cp_binding_level *b) |
00e8de68 GDR |
6665 | { |
6666 | tree decl = TYPE_NAME (type); | |
6667 | ||
6668 | if (processing_template_parmlist) | |
6669 | /* You can't declare a new template type in a template parameter | |
6670 | list. But, you can declare a non-template type: | |
6671 | ||
0cbd7506 | 6672 | template <class A*> struct S; |
00e8de68 GDR |
6673 | |
6674 | is a forward-declaration of `A'. */ | |
6675 | ; | |
c43e95f8 MM |
6676 | else if (b->kind == sk_namespace |
6677 | && current_binding_level->kind != sk_namespace) | |
6678 | /* If this new type is being injected into a containing scope, | |
6679 | then it's not a template type. */ | |
6680 | ; | |
00e8de68 GDR |
6681 | else |
6682 | { | |
9e1e64ec PC |
6683 | gcc_assert (MAYBE_CLASS_TYPE_P (type) |
6684 | || TREE_CODE (type) == ENUMERAL_TYPE); | |
00e8de68 GDR |
6685 | |
6686 | if (processing_template_decl) | |
6687 | { | |
6688 | /* This may change after the call to | |
6689 | push_template_decl_real, but we want the original value. */ | |
6690 | tree name = DECL_NAME (decl); | |
6691 | ||
bd3d082e | 6692 | decl = push_template_decl_real (decl, is_friend); |
79faac54 PC |
6693 | if (decl == error_mark_node) |
6694 | return error_mark_node; | |
6695 | ||
00e8de68 GDR |
6696 | /* If the current binding level is the binding level for the |
6697 | template parameters (see the comment in | |
6698 | begin_template_parm_list) and the enclosing level is a class | |
6699 | scope, and we're not looking at a friend, push the | |
6700 | declaration of the member class into the class scope. In the | |
6701 | friend case, push_template_decl will already have put the | |
6702 | friend into global scope, if appropriate. */ | |
6703 | if (TREE_CODE (type) != ENUMERAL_TYPE | |
bd3d082e | 6704 | && !is_friend && b->kind == sk_template_parms |
00e8de68 GDR |
6705 | && b->level_chain->kind == sk_class) |
6706 | { | |
6707 | finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type)); | |
e57df6fe | 6708 | |
00e8de68 GDR |
6709 | if (!COMPLETE_TYPE_P (current_class_type)) |
6710 | { | |
6711 | maybe_add_class_template_decl_list (current_class_type, | |
6712 | type, /*friend_p=*/0); | |
c72a1a86 | 6713 | /* Put this UTD in the table of UTDs for the class. */ |
e57df6fe KL |
6714 | if (CLASSTYPE_NESTED_UTDS (current_class_type) == NULL) |
6715 | CLASSTYPE_NESTED_UTDS (current_class_type) = | |
6716 | binding_table_new (SCOPE_DEFAULT_HT_SIZE); | |
6717 | ||
6718 | binding_table_insert | |
6719 | (CLASSTYPE_NESTED_UTDS (current_class_type), name, type); | |
00e8de68 GDR |
6720 | } |
6721 | } | |
6722 | } | |
6723 | } | |
6724 | ||
6725 | return decl; | |
6726 | } | |
6727 | ||
5a24482e KL |
6728 | /* Push a tag name NAME for struct/class/union/enum type TYPE. In case |
6729 | that the NAME is a class template, the tag is processed but not pushed. | |
6730 | ||
6731 | The pushed scope depend on the SCOPE parameter: | |
6732 | - When SCOPE is TS_CURRENT, put it into the inner-most non-sk_cleanup | |
6733 | scope. | |
6734 | - When SCOPE is TS_GLOBAL, put it in the inner-most non-class and | |
6735 | non-template-parameter scope. This case is needed for forward | |
6736 | declarations. | |
6737 | - When SCOPE is TS_WITHIN_ENCLOSING_NON_CLASS, this is similar to | |
6738 | TS_GLOBAL case except that names within template-parameter scopes | |
6739 | are not pushed at all. | |
6740 | ||
c6f9f83b | 6741 | Returns TYPE upon success and ERROR_MARK_NODE otherwise. */ |
00e8de68 | 6742 | |
575bfb00 | 6743 | static tree |
5256a7f5 | 6744 | do_pushtag (tree name, tree type, tag_scope scope) |
00e8de68 | 6745 | { |
6a000704 | 6746 | tree decl; |
00e8de68 | 6747 | |
5256a7f5 | 6748 | cp_binding_level *b = current_binding_level; |
8945521a JM |
6749 | while (true) |
6750 | { | |
6751 | if (/* Cleanup scopes are not scopes from the point of view of | |
6752 | the language. */ | |
6753 | b->kind == sk_cleanup | |
6754 | /* Neither are function parameter scopes. */ | |
6755 | || b->kind == sk_function_parms | |
6756 | /* Neither are the scopes used to hold template parameters | |
6757 | for an explicit specialization. For an ordinary template | |
6758 | declaration, these scopes are not scopes from the point of | |
6759 | view of the language. */ | |
6760 | || (b->kind == sk_template_parms | |
6761 | && (b->explicit_spec_p || scope == ts_global))) | |
6762 | b = b->level_chain; | |
6763 | else if (b->kind == sk_class | |
6764 | && scope != ts_current) | |
6765 | { | |
6766 | b = b->level_chain; | |
6767 | if (b->kind == sk_template_parms) | |
6768 | b = b->level_chain; | |
6769 | } | |
6770 | else | |
6771 | break; | |
6772 | } | |
00e8de68 | 6773 | |
9dc6f476 | 6774 | gcc_assert (identifier_p (name)); |
3db45ab5 | 6775 | |
6a000704 | 6776 | /* Do C++ gratuitous typedefing. */ |
575bfb00 | 6777 | if (identifier_type_value_1 (name) != type) |
00e8de68 | 6778 | { |
6a000704 NS |
6779 | tree tdef; |
6780 | int in_class = 0; | |
6781 | tree context = TYPE_CONTEXT (type); | |
00e8de68 | 6782 | |
6a000704 NS |
6783 | if (! context) |
6784 | { | |
fe7a23a6 JM |
6785 | cp_binding_level *cb = b; |
6786 | while (cb->kind != sk_namespace | |
6787 | && cb->kind != sk_class | |
6788 | && (cb->kind != sk_function_parms | |
6789 | || !cb->this_entity)) | |
6790 | cb = cb->level_chain; | |
6791 | tree cs = cb->this_entity; | |
6792 | ||
6793 | gcc_checking_assert (TREE_CODE (cs) == FUNCTION_DECL | |
6794 | ? cs == current_function_decl | |
6795 | : TYPE_P (cs) ? cs == current_class_type | |
6796 | : cs == current_namespace); | |
582f844c | 6797 | |
d5f4eddd JM |
6798 | if (scope == ts_current |
6799 | || (cs && TREE_CODE (cs) == FUNCTION_DECL)) | |
6a000704 | 6800 | context = cs; |
c443f3d5 | 6801 | else if (cs && TYPE_P (cs)) |
6a000704 NS |
6802 | /* When declaring a friend class of a local class, we want |
6803 | to inject the newly named class into the scope | |
6804 | containing the local class, not the namespace | |
6805 | scope. */ | |
6806 | context = decl_function_context (get_type_decl (cs)); | |
6807 | } | |
6808 | if (!context) | |
6809 | context = current_namespace; | |
bd3d082e | 6810 | |
6a000704 NS |
6811 | if (b->kind == sk_class |
6812 | || (b->kind == sk_template_parms | |
6813 | && b->level_chain->kind == sk_class)) | |
6814 | in_class = 1; | |
00e8de68 | 6815 | |
6a000704 NS |
6816 | tdef = create_implicit_typedef (name, type); |
6817 | DECL_CONTEXT (tdef) = FROB_CONTEXT (context); | |
6818 | if (scope == ts_within_enclosing_non_class) | |
00e8de68 | 6819 | { |
6a000704 NS |
6820 | /* This is a friend. Make this TYPE_DECL node hidden from |
6821 | ordinary name lookup. Its corresponding TEMPLATE_DECL | |
6822 | will be marked in push_template_decl_real. */ | |
6823 | retrofit_lang_decl (tdef); | |
6824 | DECL_ANTICIPATED (tdef) = 1; | |
6825 | DECL_FRIEND_P (tdef) = 1; | |
6826 | } | |
e57df6fe | 6827 | |
6a000704 NS |
6828 | decl = maybe_process_template_type_declaration |
6829 | (type, scope == ts_within_enclosing_non_class, b); | |
6830 | if (decl == error_mark_node) | |
575bfb00 | 6831 | return decl; |
3db45ab5 | 6832 | |
6a000704 NS |
6833 | if (b->kind == sk_class) |
6834 | { | |
fe7a23a6 JM |
6835 | if (!TYPE_BEING_DEFINED (current_class_type)) |
6836 | /* Don't push anywhere if the class is complete; a lambda in an | |
6837 | NSDMI is not a member of the class. */ | |
6838 | ; | |
6839 | else if (!PROCESSING_REAL_TEMPLATE_DECL_P ()) | |
6a000704 NS |
6840 | /* Put this TYPE_DECL on the TYPE_FIELDS list for the |
6841 | class. But if it's a member template class, we want | |
6842 | the TEMPLATE_DECL, not the TYPE_DECL, so this is done | |
6843 | later. */ | |
6844 | finish_member_declaration (decl); | |
6845 | else | |
6846 | pushdecl_class_level (decl); | |
00e8de68 | 6847 | } |
6a000704 | 6848 | else if (b->kind != sk_template_parms) |
c5f8391c | 6849 | { |
5256a7f5 | 6850 | decl = do_pushdecl_with_scope (decl, b, /*is_friend=*/false); |
c5f8391c | 6851 | if (decl == error_mark_node) |
575bfb00 | 6852 | return decl; |
d3e19c2c PC |
6853 | |
6854 | if (DECL_CONTEXT (decl) == std_node | |
ad9870f2 | 6855 | && init_list_identifier == DECL_NAME (TYPE_NAME (type)) |
d3e19c2c PC |
6856 | && !CLASSTYPE_TEMPLATE_INFO (type)) |
6857 | { | |
61f84e25 | 6858 | error ("declaration of %<std::initializer_list%> does not match " |
93964ebd | 6859 | "%<#include <initializer_list>%>, isn%'t a template"); |
d3e19c2c PC |
6860 | return error_mark_node; |
6861 | } | |
c5f8391c | 6862 | } |
6a000704 | 6863 | |
dc3ca06f SM |
6864 | if (! in_class) |
6865 | set_identifier_type_value_with_scope (name, tdef, b); | |
6866 | ||
6a000704 NS |
6867 | TYPE_CONTEXT (type) = DECL_CONTEXT (decl); |
6868 | ||
6869 | /* If this is a local class, keep track of it. We need this | |
6870 | information for name-mangling, and so that it is possible to | |
6871 | find all function definitions in a translation unit in a | |
6872 | convenient way. (It's otherwise tricky to find a member | |
6873 | function definition it's only pointed to from within a local | |
6874 | class.) */ | |
9ededfc5 | 6875 | if (TYPE_FUNCTION_SCOPE_P (type)) |
fdaf2f48 JM |
6876 | { |
6877 | if (processing_template_decl) | |
6878 | { | |
6879 | /* Push a DECL_EXPR so we call pushtag at the right time in | |
6880 | template instantiation rather than in some nested context. */ | |
6881 | add_decl_expr (decl); | |
6882 | } | |
373d1f5f JM |
6883 | /* Lambdas use LAMBDA_EXPR_DISCRIMINATOR instead. */ |
6884 | else if (!LAMBDA_TYPE_P (type)) | |
41f927f4 | 6885 | determine_local_discriminator (TYPE_NAME (type)); |
fdaf2f48 | 6886 | } |
00e8de68 | 6887 | } |
c443f3d5 | 6888 | |
6a000704 NS |
6889 | if (b->kind == sk_class |
6890 | && !COMPLETE_TYPE_P (current_class_type)) | |
00e8de68 | 6891 | { |
6a000704 NS |
6892 | maybe_add_class_template_decl_list (current_class_type, |
6893 | type, /*friend_p=*/0); | |
3db45ab5 | 6894 | |
6a000704 NS |
6895 | if (CLASSTYPE_NESTED_UTDS (current_class_type) == NULL) |
6896 | CLASSTYPE_NESTED_UTDS (current_class_type) | |
6897 | = binding_table_new (SCOPE_DEFAULT_HT_SIZE); | |
3db45ab5 | 6898 | |
6a000704 NS |
6899 | binding_table_insert |
6900 | (CLASSTYPE_NESTED_UTDS (current_class_type), name, type); | |
00e8de68 | 6901 | } |
6a000704 NS |
6902 | |
6903 | decl = TYPE_NAME (type); | |
6904 | gcc_assert (TREE_CODE (decl) == TYPE_DECL); | |
6a000704 | 6905 | |
b9e75696 JM |
6906 | /* Set type visibility now if this is a forward declaration. */ |
6907 | TREE_PUBLIC (decl) = 1; | |
6908 | determine_visibility (decl); | |
6909 | ||
575bfb00 LC |
6910 | return type; |
6911 | } | |
6912 | ||
5256a7f5 | 6913 | /* Wrapper for do_pushtag. */ |
575bfb00 LC |
6914 | |
6915 | tree | |
6916 | pushtag (tree name, tree type, tag_scope scope) | |
6917 | { | |
6918 | tree ret; | |
6919 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); | |
5256a7f5 | 6920 | ret = do_pushtag (name, type, scope); |
575bfb00 LC |
6921 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); |
6922 | return ret; | |
00e8de68 | 6923 | } |
8db29d88 | 6924 | |
00e8de68 | 6925 | \f |
00e8de68 GDR |
6926 | /* Subroutines for reverting temporarily to top-level for instantiation |
6927 | of templates and such. We actually need to clear out the class- and | |
6928 | local-value slots of all identifiers, so that only the global values | |
6929 | are at all visible. Simply setting current_binding_level to the global | |
6930 | scope isn't enough, because more binding levels may be pushed. */ | |
6931 | struct saved_scope *scope_chain; | |
6932 | ||
71f15f31 RG |
6933 | /* Return true if ID has not already been marked. */ |
6934 | ||
6935 | static inline bool | |
6936 | store_binding_p (tree id) | |
6937 | { | |
6938 | if (!id || !IDENTIFIER_BINDING (id)) | |
6939 | return false; | |
6940 | ||
6941 | if (IDENTIFIER_MARKED (id)) | |
6942 | return false; | |
6943 | ||
6944 | return true; | |
6945 | } | |
6946 | ||
6947 | /* Add an appropriate binding to *OLD_BINDINGS which needs to already | |
6948 | have enough space reserved. */ | |
89b578be | 6949 | |
f44b0c8e | 6950 | static void |
9771b263 | 6951 | store_binding (tree id, vec<cxx_saved_binding, va_gc> **old_bindings) |
89b578be | 6952 | { |
f32682ca | 6953 | cxx_saved_binding saved; |
89b578be | 6954 | |
71f15f31 | 6955 | gcc_checking_assert (store_binding_p (id)); |
c8094d83 | 6956 | |
f44b0c8e | 6957 | IDENTIFIER_MARKED (id) = 1; |
89b578be | 6958 | |
f32682ca DN |
6959 | saved.identifier = id; |
6960 | saved.binding = IDENTIFIER_BINDING (id); | |
6961 | saved.real_type_value = REAL_IDENTIFIER_TYPE_VALUE (id); | |
9771b263 | 6962 | (*old_bindings)->quick_push (saved); |
89b578be | 6963 | IDENTIFIER_BINDING (id) = NULL; |
89b578be MM |
6964 | } |
6965 | ||
f44b0c8e | 6966 | static void |
9771b263 | 6967 | store_bindings (tree names, vec<cxx_saved_binding, va_gc> **old_bindings) |
00e8de68 | 6968 | { |
199d1d48 | 6969 | static vec<tree> bindings_need_stored; |
71f15f31 RG |
6970 | tree t, id; |
6971 | size_t i; | |
00e8de68 | 6972 | |
575bfb00 | 6973 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); |
00e8de68 GDR |
6974 | for (t = names; t; t = TREE_CHAIN (t)) |
6975 | { | |
00e8de68 GDR |
6976 | if (TREE_CODE (t) == TREE_LIST) |
6977 | id = TREE_PURPOSE (t); | |
6978 | else | |
6979 | id = DECL_NAME (t); | |
6980 | ||
71f15f31 | 6981 | if (store_binding_p (id)) |
9771b263 | 6982 | bindings_need_stored.safe_push (id); |
71f15f31 | 6983 | } |
9771b263 | 6984 | if (!bindings_need_stored.is_empty ()) |
71f15f31 | 6985 | { |
9771b263 DN |
6986 | vec_safe_reserve_exact (*old_bindings, bindings_need_stored.length ()); |
6987 | for (i = 0; bindings_need_stored.iterate (i, &id); ++i) | |
71f15f31 | 6988 | { |
5764ee3c | 6989 | /* We can apparently have duplicates in NAMES. */ |
71f15f31 RG |
6990 | if (store_binding_p (id)) |
6991 | store_binding (id, old_bindings); | |
6992 | } | |
9771b263 | 6993 | bindings_need_stored.truncate (0); |
00e8de68 | 6994 | } |
575bfb00 | 6995 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); |
00e8de68 GDR |
6996 | } |
6997 | ||
89b578be MM |
6998 | /* Like store_bindings, but NAMES is a vector of cp_class_binding |
6999 | objects, rather than a TREE_LIST. */ | |
7000 | ||
f44b0c8e | 7001 | static void |
9771b263 DN |
7002 | store_class_bindings (vec<cp_class_binding, va_gc> *names, |
7003 | vec<cxx_saved_binding, va_gc> **old_bindings) | |
89b578be | 7004 | { |
199d1d48 | 7005 | static vec<tree> bindings_need_stored; |
89b578be MM |
7006 | size_t i; |
7007 | cp_class_binding *cb; | |
89b578be | 7008 | |
9771b263 | 7009 | for (i = 0; vec_safe_iterate (names, i, &cb); ++i) |
71f15f31 | 7010 | if (store_binding_p (cb->identifier)) |
9771b263 DN |
7011 | bindings_need_stored.safe_push (cb->identifier); |
7012 | if (!bindings_need_stored.is_empty ()) | |
71f15f31 RG |
7013 | { |
7014 | tree id; | |
9771b263 DN |
7015 | vec_safe_reserve_exact (*old_bindings, bindings_need_stored.length ()); |
7016 | for (i = 0; bindings_need_stored.iterate (i, &id); ++i) | |
71f15f31 | 7017 | store_binding (id, old_bindings); |
9771b263 | 7018 | bindings_need_stored.truncate (0); |
71f15f31 | 7019 | } |
89b578be MM |
7020 | } |
7021 | ||
5c712250 PP |
7022 | /* A chain of saved_scope structures awaiting reuse. */ |
7023 | ||
7024 | static GTY((deletable)) struct saved_scope *free_saved_scope; | |
7025 | ||
c405923d NS |
7026 | static void |
7027 | do_push_to_top_level (void) | |
00e8de68 GDR |
7028 | { |
7029 | struct saved_scope *s; | |
2c140474 | 7030 | cp_binding_level *b; |
f44b0c8e MM |
7031 | cxx_saved_binding *sb; |
7032 | size_t i; | |
30bcc028 | 7033 | bool need_pop; |
00e8de68 | 7034 | |
5c712250 PP |
7035 | /* Reuse or create a new structure for this saved scope. */ |
7036 | if (free_saved_scope != NULL) | |
7037 | { | |
7038 | s = free_saved_scope; | |
7039 | free_saved_scope = s->prev; | |
7040 | ||
7041 | vec<cxx_saved_binding, va_gc> *old_bindings = s->old_bindings; | |
7042 | memset (s, 0, sizeof (*s)); | |
7043 | /* Also reuse the structure's old_bindings vector. */ | |
7044 | vec_safe_truncate (old_bindings, 0); | |
7045 | s->old_bindings = old_bindings; | |
7046 | } | |
7047 | else | |
7048 | s = ggc_cleared_alloc<saved_scope> (); | |
00e8de68 GDR |
7049 | |
7050 | b = scope_chain ? current_binding_level : 0; | |
7051 | ||
7052 | /* If we're in the middle of some function, save our state. */ | |
7053 | if (cfun) | |
7054 | { | |
30bcc028 | 7055 | need_pop = true; |
d2784db4 | 7056 | push_function_context (); |
00e8de68 GDR |
7057 | } |
7058 | else | |
30bcc028 | 7059 | need_pop = false; |
00e8de68 | 7060 | |
89b578be | 7061 | if (scope_chain && previous_class_level) |
f44b0c8e MM |
7062 | store_class_bindings (previous_class_level->class_shadowed, |
7063 | &s->old_bindings); | |
00e8de68 GDR |
7064 | |
7065 | /* Have to include the global scope, because class-scope decls | |
7066 | aren't listed anywhere useful. */ | |
7067 | for (; b; b = b->level_chain) | |
7068 | { | |
7069 | tree t; | |
7070 | ||
7071 | /* Template IDs are inserted into the global level. If they were | |
7072 | inserted into namespace level, finish_file wouldn't find them | |
7073 | when doing pending instantiations. Therefore, don't stop at | |
7074 | namespace level, but continue until :: . */ | |
c353b8e3 | 7075 | if (global_scope_p (b)) |
00e8de68 GDR |
7076 | break; |
7077 | ||
f44b0c8e | 7078 | store_bindings (b->names, &s->old_bindings); |
00e8de68 GDR |
7079 | /* We also need to check class_shadowed to save class-level type |
7080 | bindings, since pushclass doesn't fill in b->names. */ | |
7081 | if (b->kind == sk_class) | |
f44b0c8e | 7082 | store_class_bindings (b->class_shadowed, &s->old_bindings); |
00e8de68 GDR |
7083 | |
7084 | /* Unwind type-value slots back to top level. */ | |
7085 | for (t = b->type_shadowed; t; t = TREE_CHAIN (t)) | |
7086 | SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t), TREE_VALUE (t)); | |
7087 | } | |
f44b0c8e | 7088 | |
9771b263 | 7089 | FOR_EACH_VEC_SAFE_ELT (s->old_bindings, i, sb) |
f44b0c8e MM |
7090 | IDENTIFIER_MARKED (sb->identifier) = 0; |
7091 | ||
00e8de68 | 7092 | s->prev = scope_chain; |
00e8de68 GDR |
7093 | s->bindings = b; |
7094 | s->need_pop_function_context = need_pop; | |
7095 | s->function_decl = current_function_decl; | |
7d882b83 ILT |
7096 | s->unevaluated_operand = cp_unevaluated_operand; |
7097 | s->inhibit_evaluation_warnings = c_inhibit_evaluation_warnings; | |
b00e9be0 | 7098 | s->suppress_location_wrappers = suppress_location_wrappers; |
04f7a48e | 7099 | s->x_stmt_tree.stmts_are_full_exprs_p = true; |
00e8de68 GDR |
7100 | |
7101 | scope_chain = s; | |
7102 | current_function_decl = NULL_TREE; | |
50200c65 | 7103 | current_lang_base = NULL; |
00e8de68 GDR |
7104 | current_lang_name = lang_name_cplusplus; |
7105 | current_namespace = global_namespace; | |
c888c93b | 7106 | push_class_stack (); |
7d882b83 ILT |
7107 | cp_unevaluated_operand = 0; |
7108 | c_inhibit_evaluation_warnings = 0; | |
b00e9be0 | 7109 | suppress_location_wrappers = 0; |
00e8de68 GDR |
7110 | } |
7111 | ||
575bfb00 | 7112 | static void |
c405923d | 7113 | do_pop_from_top_level (void) |
00e8de68 GDR |
7114 | { |
7115 | struct saved_scope *s = scope_chain; | |
7116 | cxx_saved_binding *saved; | |
f44b0c8e | 7117 | size_t i; |
00e8de68 | 7118 | |
00e8de68 | 7119 | /* Clear out class-level bindings cache. */ |
89b578be | 7120 | if (previous_class_level) |
00e8de68 | 7121 | invalidate_class_lookup_cache (); |
c888c93b | 7122 | pop_class_stack (); |
00e8de68 | 7123 | |
50200c65 | 7124 | release_tree_vector (current_lang_base); |
00e8de68 GDR |
7125 | |
7126 | scope_chain = s->prev; | |
9771b263 | 7127 | FOR_EACH_VEC_SAFE_ELT (s->old_bindings, i, saved) |
00e8de68 GDR |
7128 | { |
7129 | tree id = saved->identifier; | |
7130 | ||
7131 | IDENTIFIER_BINDING (id) = saved->binding; | |
00e8de68 GDR |
7132 | SET_IDENTIFIER_TYPE_VALUE (id, saved->real_type_value); |
7133 | } | |
7134 | ||
7135 | /* If we were in the middle of compiling a function, restore our | |
7136 | state. */ | |
7137 | if (s->need_pop_function_context) | |
d2784db4 | 7138 | pop_function_context (); |
00e8de68 | 7139 | current_function_decl = s->function_decl; |
7d882b83 ILT |
7140 | cp_unevaluated_operand = s->unevaluated_operand; |
7141 | c_inhibit_evaluation_warnings = s->inhibit_evaluation_warnings; | |
b00e9be0 | 7142 | suppress_location_wrappers = s->suppress_location_wrappers; |
5c712250 PP |
7143 | |
7144 | /* Make this saved_scope structure available for reuse by | |
7145 | push_to_top_level. */ | |
7146 | s->prev = free_saved_scope; | |
7147 | free_saved_scope = s; | |
00e8de68 GDR |
7148 | } |
7149 | ||
c405923d NS |
7150 | /* Push into the scope of the namespace NS, even if it is deeply |
7151 | nested within another namespace. */ | |
575bfb00 | 7152 | |
c405923d NS |
7153 | static void |
7154 | do_push_nested_namespace (tree ns) | |
7155 | { | |
7156 | if (ns == global_namespace) | |
7157 | do_push_to_top_level (); | |
7158 | else | |
7159 | { | |
7160 | do_push_nested_namespace (CP_DECL_CONTEXT (ns)); | |
7161 | gcc_checking_assert | |
e833f686 | 7162 | (find_namespace_value (current_namespace, DECL_NAME (ns)) == ns); |
c405923d NS |
7163 | resume_scope (NAMESPACE_LEVEL (ns)); |
7164 | current_namespace = ns; | |
7165 | } | |
7166 | } | |
7167 | ||
7168 | /* Pop back from the scope of the namespace NS, which was previously | |
7169 | entered with push_nested_namespace. */ | |
7170 | ||
7171 | static void | |
7172 | do_pop_nested_namespace (tree ns) | |
7173 | { | |
7174 | while (ns != global_namespace) | |
7175 | { | |
7176 | ns = CP_DECL_CONTEXT (ns); | |
7177 | current_namespace = ns; | |
7178 | leave_scope (); | |
7179 | } | |
7180 | ||
7181 | do_pop_from_top_level (); | |
7182 | } | |
7183 | ||
44e00a7a NS |
7184 | /* Add TARGET to USINGS, if it does not already exist there. |
7185 | We used to build the complete graph of usings at this point, from | |
7186 | the POV of the source namespaces. Now we build that as we perform | |
7187 | the unqualified search. */ | |
65cc1407 NS |
7188 | |
7189 | static void | |
3c9feefc | 7190 | add_using_namespace (vec<tree, va_gc> *&usings, tree target) |
65cc1407 | 7191 | { |
3c9feefc NS |
7192 | if (usings) |
7193 | for (unsigned ix = usings->length (); ix--;) | |
7194 | if ((*usings)[ix] == target) | |
7195 | return; | |
65cc1407 | 7196 | |
3c9feefc | 7197 | vec_safe_push (usings, target); |
65cc1407 NS |
7198 | } |
7199 | ||
44e00a7a | 7200 | /* Tell the debug system of a using directive. */ |
65cc1407 NS |
7201 | |
7202 | static void | |
e071b767 | 7203 | emit_debug_info_using_namespace (tree from, tree target, bool implicit) |
65cc1407 | 7204 | { |
44e00a7a NS |
7205 | /* Emit debugging info. */ |
7206 | tree context = from != global_namespace ? from : NULL_TREE; | |
e071b767 JJ |
7207 | debug_hooks->imported_module_or_decl (target, NULL_TREE, context, false, |
7208 | implicit); | |
65cc1407 NS |
7209 | } |
7210 | ||
6db76e48 | 7211 | /* Process a using directive. */ |
65cc1407 NS |
7212 | |
7213 | void | |
6db76e48 | 7214 | finish_using_directive (tree target, tree attribs) |
65cc1407 | 7215 | { |
65cc1407 NS |
7216 | if (target == error_mark_node) |
7217 | return; | |
7218 | ||
6db76e48 NS |
7219 | if (current_binding_level->kind != sk_namespace) |
7220 | add_stmt (build_stmt (input_location, USING_STMT, target)); | |
7221 | else | |
7222 | emit_debug_info_using_namespace (current_binding_level->this_entity, | |
7223 | ORIGINAL_NAMESPACE (target), false); | |
65cc1407 | 7224 | |
44e00a7a NS |
7225 | add_using_namespace (current_binding_level->using_directives, |
7226 | ORIGINAL_NAMESPACE (target)); | |
6db76e48 NS |
7227 | |
7228 | if (attribs != error_mark_node) | |
7229 | for (tree a = attribs; a; a = TREE_CHAIN (a)) | |
7230 | { | |
7231 | tree name = get_attribute_name (a); | |
7232 | if (current_binding_level->kind == sk_namespace | |
7233 | && is_attribute_p ("strong", name)) | |
7234 | { | |
f12ea6ac MP |
7235 | if (warning (0, "%<strong%> using directive no longer supported") |
7236 | && CP_DECL_CONTEXT (target) == current_namespace) | |
6db76e48 | 7237 | inform (DECL_SOURCE_LOCATION (target), |
f12ea6ac | 7238 | "you can use an inline namespace instead"); |
6db76e48 NS |
7239 | } |
7240 | else | |
7241 | warning (OPT_Wattributes, "%qD attribute directive ignored", name); | |
7242 | } | |
65cc1407 NS |
7243 | } |
7244 | ||
c405923d NS |
7245 | /* Pushes X into the global namespace. */ |
7246 | ||
7247 | tree | |
7248 | pushdecl_top_level (tree x, bool is_friend) | |
575bfb00 LC |
7249 | { |
7250 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); | |
c405923d NS |
7251 | do_push_to_top_level (); |
7252 | x = pushdecl_namespace_level (x, is_friend); | |
7253 | do_pop_from_top_level (); | |
575bfb00 | 7254 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); |
c405923d NS |
7255 | return x; |
7256 | } | |
7257 | ||
7258 | /* Pushes X into the global namespace and calls cp_finish_decl to | |
7259 | register the variable, initializing it with INIT. */ | |
7260 | ||
7261 | tree | |
7262 | pushdecl_top_level_and_finish (tree x, tree init) | |
7263 | { | |
7264 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); | |
7265 | do_push_to_top_level (); | |
7266 | x = pushdecl_namespace_level (x, false); | |
7267 | cp_finish_decl (x, init, false, NULL_TREE, 0); | |
7268 | do_pop_from_top_level (); | |
7269 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); | |
7270 | return x; | |
575bfb00 LC |
7271 | } |
7272 | ||
945bf9e1 NS |
7273 | /* Enter the namespaces from current_namerspace to NS. */ |
7274 | ||
7275 | static int | |
7276 | push_inline_namespaces (tree ns) | |
7277 | { | |
7278 | int count = 0; | |
7279 | if (ns != current_namespace) | |
7280 | { | |
7281 | gcc_assert (ns != global_namespace); | |
7282 | count += push_inline_namespaces (CP_DECL_CONTEXT (ns)); | |
7283 | resume_scope (NAMESPACE_LEVEL (ns)); | |
7284 | current_namespace = ns; | |
7285 | count++; | |
7286 | } | |
7287 | return count; | |
7288 | } | |
7289 | ||
3a77e7cc NS |
7290 | /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, |
7291 | then we enter an anonymous namespace. If MAKE_INLINE is true, then | |
7292 | we create an inline namespace (it is up to the caller to check upon | |
7293 | redefinition). Return the number of namespaces entered. */ | |
b655c310 | 7294 | |
3a77e7cc NS |
7295 | int |
7296 | push_namespace (tree name, bool make_inline) | |
b655c310 | 7297 | { |
b655c310 | 7298 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); |
3a77e7cc | 7299 | int count = 0; |
b655c310 NS |
7300 | |
7301 | /* We should not get here if the global_namespace is not yet constructed | |
7302 | nor if NAME designates the global namespace: The global scope is | |
7303 | constructed elsewhere. */ | |
e833f686 | 7304 | gcc_checking_assert (global_namespace != NULL && name != global_identifier); |
3a77e7cc | 7305 | |
945bf9e1 NS |
7306 | tree ns = NULL_TREE; |
7307 | { | |
7308 | name_lookup lookup (name, 0); | |
7309 | if (!lookup.search_qualified (current_namespace, /*usings=*/false)) | |
7310 | ; | |
7311 | else if (TREE_CODE (lookup.value) != NAMESPACE_DECL) | |
7312 | ; | |
7313 | else if (tree dna = DECL_NAMESPACE_ALIAS (lookup.value)) | |
7314 | { | |
7315 | /* A namespace alias is not allowed here, but if the alias | |
7316 | is for a namespace also inside the current scope, | |
7317 | accept it with a diagnostic. That's better than dying | |
7318 | horribly. */ | |
7319 | if (is_nested_namespace (current_namespace, CP_DECL_CONTEXT (dna))) | |
7320 | { | |
7321 | error ("namespace alias %qD not allowed here, " | |
7322 | "assuming %qD", lookup.value, dna); | |
7323 | ns = dna; | |
7324 | } | |
7325 | } | |
7326 | else | |
7327 | ns = lookup.value; | |
7328 | } | |
b655c310 | 7329 | |
3a77e7cc | 7330 | bool new_ns = false; |
945bf9e1 NS |
7331 | if (ns) |
7332 | /* DR2061. NS might be a member of an inline namespace. We | |
7333 | need to push into those namespaces. */ | |
7334 | count += push_inline_namespaces (CP_DECL_CONTEXT (ns)); | |
7335 | else | |
b655c310 | 7336 | { |
3a77e7cc | 7337 | ns = build_lang_decl (NAMESPACE_DECL, name, void_type_node); |
322763f5 NS |
7338 | SCOPE_DEPTH (ns) = SCOPE_DEPTH (current_namespace) + 1; |
7339 | if (!SCOPE_DEPTH (ns)) | |
7340 | /* We only allow depth 255. */ | |
7341 | sorry ("cannot nest more than %d namespaces", | |
7342 | SCOPE_DEPTH (current_namespace)); | |
3a77e7cc NS |
7343 | DECL_CONTEXT (ns) = FROB_CONTEXT (current_namespace); |
7344 | new_ns = true; | |
7345 | ||
7346 | if (pushdecl (ns) == error_mark_node) | |
7347 | ns = NULL_TREE; | |
b655c310 | 7348 | else |
b655c310 | 7349 | { |
e833f686 | 7350 | if (!name) |
3a77e7cc | 7351 | { |
e833f686 | 7352 | SET_DECL_ASSEMBLER_NAME (ns, anon_identifier); |
3a77e7cc NS |
7353 | |
7354 | if (!make_inline) | |
0841bc15 | 7355 | add_using_namespace (current_binding_level->using_directives, |
44e00a7a | 7356 | ns); |
3a77e7cc NS |
7357 | } |
7358 | else if (TREE_PUBLIC (current_namespace)) | |
7359 | TREE_PUBLIC (ns) = 1; | |
7360 | ||
7361 | if (make_inline) | |
3c9feefc NS |
7362 | { |
7363 | DECL_NAMESPACE_INLINE_P (ns) = true; | |
7364 | vec_safe_push (DECL_NAMESPACE_INLINEES (current_namespace), ns); | |
7365 | } | |
e071b767 | 7366 | |
e833f686 | 7367 | if (!name || make_inline) |
e071b767 | 7368 | emit_debug_info_using_namespace (current_namespace, ns, true); |
b655c310 | 7369 | } |
3a77e7cc NS |
7370 | } |
7371 | ||
7372 | if (ns) | |
7373 | { | |
7374 | if (make_inline && !DECL_NAMESPACE_INLINE_P (ns)) | |
b655c310 | 7375 | { |
3a77e7cc NS |
7376 | error ("inline namespace must be specified at initial definition"); |
7377 | inform (DECL_SOURCE_LOCATION (ns), "%qD defined here", ns); | |
b655c310 | 7378 | } |
3a77e7cc NS |
7379 | if (new_ns) |
7380 | begin_scope (sk_namespace, ns); | |
7381 | else | |
7382 | resume_scope (NAMESPACE_LEVEL (ns)); | |
7383 | current_namespace = ns; | |
7384 | count++; | |
b655c310 | 7385 | } |
b655c310 NS |
7386 | |
7387 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); | |
3a77e7cc | 7388 | return count; |
b655c310 NS |
7389 | } |
7390 | ||
7391 | /* Pop from the scope of the current namespace. */ | |
7392 | ||
7393 | void | |
7394 | pop_namespace (void) | |
7395 | { | |
3c9feefc NS |
7396 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); |
7397 | ||
b655c310 NS |
7398 | gcc_assert (current_namespace != global_namespace); |
7399 | current_namespace = CP_DECL_CONTEXT (current_namespace); | |
7400 | /* The binding level is not popped, as it might be re-opened later. */ | |
7401 | leave_scope (); | |
3c9feefc NS |
7402 | |
7403 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); | |
b655c310 NS |
7404 | } |
7405 | ||
c405923d | 7406 | /* External entry points for do_{push_to/pop_from}_top_level. */ |
b655c310 NS |
7407 | |
7408 | void | |
c405923d | 7409 | push_to_top_level (void) |
b655c310 | 7410 | { |
c405923d NS |
7411 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); |
7412 | do_push_to_top_level (); | |
7413 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); | |
b655c310 NS |
7414 | } |
7415 | ||
c405923d NS |
7416 | void |
7417 | pop_from_top_level (void) | |
7418 | { | |
7419 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); | |
7420 | do_pop_from_top_level (); | |
7421 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); | |
7422 | } | |
7423 | ||
7424 | /* External entry points for do_{push,pop}_nested_namespace. */ | |
7425 | ||
7426 | void | |
7427 | push_nested_namespace (tree ns) | |
7428 | { | |
7429 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); | |
7430 | do_push_nested_namespace (ns); | |
7431 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); | |
7432 | } | |
b655c310 NS |
7433 | |
7434 | void | |
7435 | pop_nested_namespace (tree ns) | |
7436 | { | |
7437 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); | |
7438 | gcc_assert (current_namespace == ns); | |
c405923d | 7439 | do_pop_nested_namespace (ns); |
b655c310 NS |
7440 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); |
7441 | } | |
575bfb00 | 7442 | |
00e8de68 | 7443 | /* Pop off extraneous binding levels left over due to syntax errors. |
00e8de68 GDR |
7444 | We don't pop past namespaces, as they might be valid. */ |
7445 | ||
7446 | void | |
7447 | pop_everything (void) | |
7448 | { | |
7449 | if (ENABLE_SCOPE_CHECKING) | |
a9c697b8 | 7450 | verbatim ("XXX entering %<pop_everything ()%>"); |
056a17ee | 7451 | while (!namespace_bindings_p ()) |
00e8de68 GDR |
7452 | { |
7453 | if (current_binding_level->kind == sk_class) | |
7454 | pop_nested_class (); | |
7455 | else | |
7456 | poplevel (0, 0, 0); | |
7457 | } | |
7458 | if (ENABLE_SCOPE_CHECKING) | |
a9c697b8 | 7459 | verbatim ("XXX leaving %<pop_everything ()%>"); |
00e8de68 GDR |
7460 | } |
7461 | ||
6097b0c3 | 7462 | /* Emit debugging information for using declarations and directives. |
c8094d83 | 7463 | If input tree is overloaded fn then emit debug info for all |
6097b0c3 DP |
7464 | candidates. */ |
7465 | ||
98ed9dae | 7466 | void |
6097b0c3 DP |
7467 | cp_emit_debug_info_for_using (tree t, tree context) |
7468 | { | |
099f36ab | 7469 | /* Don't try to emit any debug information if we have errors. */ |
1da2ed5f | 7470 | if (seen_error ()) |
099f36ab JM |
7471 | return; |
7472 | ||
6097b0c3 DP |
7473 | /* Do not supply context to imported_module_or_decl, if |
7474 | it is a global namespace. */ | |
7475 | if (context == global_namespace) | |
7476 | context = NULL_TREE; | |
c8094d83 | 7477 | |
e1cad930 | 7478 | t = MAYBE_BASELINK_FUNCTIONS (t); |
c8094d83 | 7479 | |
87c976ae NS |
7480 | for (lkp_iterator iter (t); iter; ++iter) |
7481 | { | |
7482 | tree fn = *iter; | |
a09b09cc NS |
7483 | |
7484 | if (TREE_CODE (fn) == TEMPLATE_DECL) | |
7485 | /* FIXME: Handle TEMPLATE_DECLs. */ | |
7486 | continue; | |
7487 | ||
7488 | /* Ignore this FUNCTION_DECL if it refers to a builtin declaration | |
7489 | of a builtin function. */ | |
7490 | if (TREE_CODE (fn) == FUNCTION_DECL | |
7491 | && DECL_EXTERNAL (fn) | |
7492 | && fndecl_built_in_p (fn)) | |
7493 | continue; | |
7494 | ||
7495 | if (building_stmt_list_p ()) | |
7496 | add_stmt (build_stmt (input_location, USING_STMT, fn)); | |
7497 | else | |
7498 | debug_hooks->imported_module_or_decl (fn, NULL_TREE, context, | |
7499 | false, false); | |
87c976ae | 7500 | } |
98ed9dae | 7501 | } |
6097b0c3 | 7502 | |
bddee796 JM |
7503 | /* Return the result of unqualified lookup for the overloaded operator |
7504 | designated by CODE, if we are in a template and the binding we find is | |
7505 | not. */ | |
7506 | ||
7507 | static tree | |
7508 | op_unqualified_lookup (tree fnname) | |
7509 | { | |
7510 | if (cxx_binding *binding = IDENTIFIER_BINDING (fnname)) | |
7511 | { | |
7512 | cp_binding_level *l = binding->scope; | |
7513 | while (l && !l->this_entity) | |
7514 | l = l->level_chain; | |
7515 | if (l && uses_template_parms (l->this_entity)) | |
7516 | /* Don't preserve decls from an uninstantiated template, | |
7517 | wait until that template is instantiated. */ | |
7518 | return NULL_TREE; | |
7519 | } | |
7520 | tree fns = lookup_name (fnname); | |
7521 | if (fns && fns == get_global_binding (fnname)) | |
7522 | /* The instantiation can find these. */ | |
7523 | return NULL_TREE; | |
7524 | return fns; | |
7525 | } | |
7526 | ||
7527 | /* E is an expression representing an operation with dependent type, so we | |
7528 | don't know yet whether it will use the built-in meaning of the operator or a | |
7529 | function. Remember declarations of that operator in scope. */ | |
7530 | ||
7531 | const char *const op_bind_attrname = "operator bindings"; | |
7532 | ||
7533 | void | |
7534 | maybe_save_operator_binding (tree e) | |
7535 | { | |
7536 | /* This is only useful in a generic lambda. */ | |
7537 | if (!processing_template_decl) | |
7538 | return; | |
7539 | tree cfn = current_function_decl; | |
7540 | if (!cfn) | |
7541 | return; | |
7542 | ||
7543 | /* Let's only do this for generic lambdas for now, we could do it for all | |
7544 | function templates if we wanted to. */ | |
7545 | if (!current_lambda_expr()) | |
7546 | return; | |
7547 | ||
7548 | tree fnname = ovl_op_identifier (false, TREE_CODE (e)); | |
7549 | if (!fnname) | |
7550 | return; | |
7551 | ||
7552 | tree attributes = DECL_ATTRIBUTES (cfn); | |
7553 | tree attr = lookup_attribute (op_bind_attrname, attributes); | |
7554 | tree bindings = NULL_TREE; | |
7555 | tree fns = NULL_TREE; | |
7556 | if (attr) | |
7557 | { | |
7558 | bindings = TREE_VALUE (attr); | |
7559 | if (tree elt = purpose_member (fnname, bindings)) | |
7560 | fns = TREE_VALUE (elt); | |
7561 | } | |
7562 | ||
7563 | if (!fns && (fns = op_unqualified_lookup (fnname))) | |
7564 | { | |
7565 | bindings = tree_cons (fnname, fns, bindings); | |
7566 | if (attr) | |
7567 | TREE_VALUE (attr) = bindings; | |
7568 | else | |
7569 | DECL_ATTRIBUTES (cfn) | |
7570 | = tree_cons (get_identifier (op_bind_attrname), | |
7571 | bindings, | |
7572 | attributes); | |
7573 | } | |
7574 | } | |
7575 | ||
7576 | /* Called from cp_free_lang_data so we don't put this into LTO. */ | |
7577 | ||
7578 | void | |
7579 | discard_operator_bindings (tree decl) | |
7580 | { | |
7581 | DECL_ATTRIBUTES (decl) = remove_attribute (op_bind_attrname, | |
7582 | DECL_ATTRIBUTES (decl)); | |
7583 | } | |
7584 | ||
7585 | /* Subroutine of start_preparsed_function: push the bindings we saved away in | |
7586 | maybe_save_op_lookup into the function parameter binding level. */ | |
7587 | ||
7588 | void | |
7589 | push_operator_bindings () | |
7590 | { | |
7591 | tree decl1 = current_function_decl; | |
7592 | if (tree attr = lookup_attribute (op_bind_attrname, | |
7593 | DECL_ATTRIBUTES (decl1))) | |
7594 | for (tree binds = TREE_VALUE (attr); binds; binds = TREE_CHAIN (binds)) | |
7595 | { | |
7596 | tree name = TREE_PURPOSE (binds); | |
7597 | tree val = TREE_VALUE (binds); | |
7598 | push_local_binding (name, val, /*using*/true); | |
7599 | } | |
7600 | } | |
7601 | ||
28ea4c88 | 7602 | #include "gt-cp-name-lookup.h" |