]>
Commit | Line | Data |
---|---|---|
8546e572 | 1 | /* Definitions for C++ name lookup routines. |
83ae9f05 | 2 | Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012 |
aa139c3f | 3 | Free Software Foundation, Inc. |
8546e572 | 4 | Contributed by Gabriel Dos Reis <gdr@integrable-solutions.net> |
5 | ||
d36ac936 | 6 | This file is part of GCC. |
8546e572 | 7 | |
d36ac936 | 8 | GCC is free software; you can redistribute it and/or modify |
8546e572 | 9 | it under the terms of the GNU General Public License as published by |
aa139c3f | 10 | the Free Software Foundation; either version 3, or (at your option) |
8546e572 | 11 | any later version. |
12 | ||
d36ac936 | 13 | GCC is distributed in the hope that it will be useful, |
8546e572 | 14 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
16 | GNU General Public License for more details. | |
17 | ||
18 | You should have received a copy of the GNU General Public License | |
aa139c3f | 19 | along with GCC; see the file COPYING3. If not see |
20 | <http://www.gnu.org/licenses/>. */ | |
8546e572 | 21 | |
22 | #include "config.h" | |
23 | #include "system.h" | |
24 | #include "coretypes.h" | |
25 | #include "tm.h" | |
9a49d46b | 26 | #include "flags.h" |
8546e572 | 27 | #include "tree.h" |
28 | #include "cp-tree.h" | |
29 | #include "name-lookup.h" | |
d36ac936 | 30 | #include "timevar.h" |
852f689e | 31 | #include "diagnostic-core.h" |
f91726b4 | 32 | #include "intl.h" |
2b49746a | 33 | #include "debug.h" |
7bedc3a0 | 34 | #include "c-family/c-pragma.h" |
f91726b4 | 35 | #include "params.h" |
d9e82d44 | 36 | #include "pointer-set.h" |
836495aa | 37 | |
7d6057da | 38 | /* The bindings for a particular name in a particular scope. */ |
39 | ||
40 | struct scope_binding { | |
41 | tree value; | |
42 | tree type; | |
43 | }; | |
44 | #define EMPTY_SCOPE_BINDING { NULL_TREE, NULL_TREE } | |
45 | ||
d0ef83bc | 46 | static cp_binding_level *innermost_nonclass_level (void); |
47 | static cxx_binding *binding_for_name (cp_binding_level *, tree); | |
c1d4295f | 48 | static tree push_overloaded_decl (tree, int, bool); |
7d6057da | 49 | static bool lookup_using_namespace (tree, struct scope_binding *, tree, |
653e5405 | 50 | tree, int); |
7d6057da | 51 | static bool qualified_lookup_using_namespace (tree, tree, |
52 | struct scope_binding *, int); | |
9a49d46b | 53 | static tree lookup_type_current_level (tree); |
54 | static tree push_using_directive (tree); | |
27282252 | 55 | static tree lookup_extern_c_fun_in_all_ns (tree); |
807f85cf | 56 | static void diagnose_name_conflict (tree, tree); |
cc9a4194 | 57 | |
58 | /* The :: namespace. */ | |
59 | ||
60 | tree global_namespace; | |
836495aa | 61 | |
c2e83164 | 62 | /* The name of the anonymous namespace, throughout this translation |
63 | unit. */ | |
141efd27 | 64 | static GTY(()) tree anonymous_namespace_name; |
c2e83164 | 65 | |
0410c176 | 66 | /* Initialize anonymous_namespace_name if necessary, and return it. */ |
db85cc4f | 67 | |
ec46af50 | 68 | static tree |
62164d4c | 69 | get_anonymous_namespace_name (void) |
db85cc4f | 70 | { |
71 | if (!anonymous_namespace_name) | |
72 | { | |
73 | /* The anonymous namespace has to have a unique name | |
74 | if typeinfo objects are being compared by name. */ | |
ec46af50 | 75 | if (! flag_weak || ! SUPPORTS_ONE_ONLY) |
76 | anonymous_namespace_name = get_file_function_name ("N"); | |
77 | else | |
78 | /* The demangler expects anonymous namespaces to be called | |
79 | something starting with '_GLOBAL__N_'. */ | |
80 | anonymous_namespace_name = get_identifier ("_GLOBAL__N_1"); | |
db85cc4f | 81 | } |
82 | return anonymous_namespace_name; | |
83 | } | |
8546e572 | 84 | |
af694375 | 85 | /* Compute the chain index of a binding_entry given the HASH value of its |
86 | name and the total COUNT of chains. COUNT is assumed to be a power | |
87 | of 2. */ | |
0e1d7e20 | 88 | |
af694375 | 89 | #define ENTRY_INDEX(HASH, COUNT) (((HASH) >> 3) & ((COUNT) - 1)) |
90 | ||
91 | /* A free list of "binding_entry"s awaiting for re-use. */ | |
0e1d7e20 | 92 | |
7035b2ab | 93 | static GTY((deletable)) binding_entry free_binding_entry = NULL; |
af694375 | 94 | |
95 | /* Create a binding_entry object for (NAME, TYPE). */ | |
0e1d7e20 | 96 | |
af694375 | 97 | static inline binding_entry |
98 | binding_entry_make (tree name, tree type) | |
99 | { | |
100 | binding_entry entry; | |
101 | ||
102 | if (free_binding_entry) | |
103 | { | |
104 | entry = free_binding_entry; | |
105 | free_binding_entry = entry->chain; | |
106 | } | |
107 | else | |
ba72912a | 108 | entry = ggc_alloc_binding_entry_s (); |
af694375 | 109 | |
110 | entry->name = name; | |
111 | entry->type = type; | |
9449ebe7 | 112 | entry->chain = NULL; |
af694375 | 113 | |
114 | return entry; | |
115 | } | |
116 | ||
117 | /* Put ENTRY back on the free list. */ | |
fc64a85e | 118 | #if 0 |
af694375 | 119 | static inline void |
120 | binding_entry_free (binding_entry entry) | |
121 | { | |
4db06cad | 122 | entry->name = NULL; |
123 | entry->type = NULL; | |
af694375 | 124 | entry->chain = free_binding_entry; |
125 | free_binding_entry = entry; | |
126 | } | |
fc64a85e | 127 | #endif |
af694375 | 128 | |
129 | /* The datatype used to implement the mapping from names to types at | |
130 | a given scope. */ | |
fb1e4f4a | 131 | struct GTY(()) binding_table_s { |
af694375 | 132 | /* Array of chains of "binding_entry"s */ |
133 | binding_entry * GTY((length ("%h.chain_count"))) chain; | |
134 | ||
135 | /* The number of chains in this table. This is the length of the | |
08cc44e7 | 136 | member "chain" considered as an array. */ |
af694375 | 137 | size_t chain_count; |
138 | ||
139 | /* Number of "binding_entry"s in this table. */ | |
140 | size_t entry_count; | |
141 | }; | |
142 | ||
143 | /* Construct TABLE with an initial CHAIN_COUNT. */ | |
0e1d7e20 | 144 | |
af694375 | 145 | static inline void |
146 | binding_table_construct (binding_table table, size_t chain_count) | |
147 | { | |
148 | table->chain_count = chain_count; | |
149 | table->entry_count = 0; | |
ba72912a | 150 | table->chain = ggc_alloc_cleared_vec_binding_entry (table->chain_count); |
af694375 | 151 | } |
152 | ||
0e1d7e20 | 153 | /* Make TABLE's entries ready for reuse. */ |
fc64a85e | 154 | #if 0 |
836495aa | 155 | static void |
af694375 | 156 | binding_table_free (binding_table table) |
157 | { | |
158 | size_t i; | |
0e1d7e20 | 159 | size_t count; |
160 | ||
af694375 | 161 | if (table == NULL) |
162 | return; | |
163 | ||
0e1d7e20 | 164 | for (i = 0, count = table->chain_count; i < count; ++i) |
af694375 | 165 | { |
9449ebe7 | 166 | binding_entry temp = table->chain[i]; |
167 | while (temp != NULL) | |
653e5405 | 168 | { |
169 | binding_entry entry = temp; | |
170 | temp = entry->chain; | |
171 | binding_entry_free (entry); | |
172 | } | |
0e1d7e20 | 173 | table->chain[i] = NULL; |
af694375 | 174 | } |
175 | table->entry_count = 0; | |
176 | } | |
fc64a85e | 177 | #endif |
af694375 | 178 | |
179 | /* Allocate a table with CHAIN_COUNT, assumed to be a power of two. */ | |
0e1d7e20 | 180 | |
836495aa | 181 | static inline binding_table |
af694375 | 182 | binding_table_new (size_t chain_count) |
183 | { | |
ba72912a | 184 | binding_table table = ggc_alloc_binding_table_s (); |
9449ebe7 | 185 | table->chain = NULL; |
af694375 | 186 | binding_table_construct (table, chain_count); |
187 | return table; | |
188 | } | |
189 | ||
190 | /* Expand TABLE to twice its current chain_count. */ | |
0e1d7e20 | 191 | |
af694375 | 192 | static void |
193 | binding_table_expand (binding_table table) | |
194 | { | |
195 | const size_t old_chain_count = table->chain_count; | |
196 | const size_t old_entry_count = table->entry_count; | |
197 | const size_t new_chain_count = 2 * old_chain_count; | |
198 | binding_entry *old_chains = table->chain; | |
199 | size_t i; | |
200 | ||
201 | binding_table_construct (table, new_chain_count); | |
202 | for (i = 0; i < old_chain_count; ++i) | |
203 | { | |
204 | binding_entry entry = old_chains[i]; | |
205 | for (; entry != NULL; entry = old_chains[i]) | |
653e5405 | 206 | { |
207 | const unsigned int hash = IDENTIFIER_HASH_VALUE (entry->name); | |
208 | const size_t j = ENTRY_INDEX (hash, new_chain_count); | |
209 | ||
210 | old_chains[i] = entry->chain; | |
211 | entry->chain = table->chain[j]; | |
212 | table->chain[j] = entry; | |
213 | } | |
af694375 | 214 | } |
215 | table->entry_count = old_entry_count; | |
216 | } | |
217 | ||
0e1d7e20 | 218 | /* Insert a binding for NAME to TYPE into TABLE. */ |
219 | ||
836495aa | 220 | static void |
af694375 | 221 | binding_table_insert (binding_table table, tree name, tree type) |
222 | { | |
223 | const unsigned int hash = IDENTIFIER_HASH_VALUE (name); | |
224 | const size_t i = ENTRY_INDEX (hash, table->chain_count); | |
225 | binding_entry entry = binding_entry_make (name, type); | |
226 | ||
227 | entry->chain = table->chain[i]; | |
228 | table->chain[i] = entry; | |
229 | ++table->entry_count; | |
230 | ||
231 | if (3 * table->chain_count < 5 * table->entry_count) | |
232 | binding_table_expand (table); | |
233 | } | |
234 | ||
235 | /* Return the binding_entry, if any, that maps NAME. */ | |
0e1d7e20 | 236 | |
af694375 | 237 | binding_entry |
238 | binding_table_find (binding_table table, tree name) | |
239 | { | |
240 | const unsigned int hash = IDENTIFIER_HASH_VALUE (name); | |
241 | binding_entry entry = table->chain[ENTRY_INDEX (hash, table->chain_count)]; | |
242 | ||
243 | while (entry != NULL && entry->name != name) | |
244 | entry = entry->chain; | |
245 | ||
246 | return entry; | |
247 | } | |
248 | ||
af694375 | 249 | /* Apply PROC -- with DATA -- to all entries in TABLE. */ |
0e1d7e20 | 250 | |
af694375 | 251 | void |
252 | binding_table_foreach (binding_table table, bt_foreach_proc proc, void *data) | |
253 | { | |
254 | const size_t chain_count = table->chain_count; | |
255 | size_t i; | |
256 | ||
257 | for (i = 0; i < chain_count; ++i) | |
258 | { | |
259 | binding_entry entry = table->chain[i]; | |
260 | for (; entry != NULL; entry = entry->chain) | |
653e5405 | 261 | proc (entry, data); |
af694375 | 262 | } |
263 | } | |
264 | \f | |
836495aa | 265 | #ifndef ENABLE_SCOPE_CHECKING |
266 | # define ENABLE_SCOPE_CHECKING 0 | |
267 | #else | |
268 | # define ENABLE_SCOPE_CHECKING 1 | |
269 | #endif | |
af694375 | 270 | |
8546e572 | 271 | /* A free list of "cxx_binding"s, connected by their PREVIOUS. */ |
0e1d7e20 | 272 | |
7035b2ab | 273 | static GTY((deletable)) cxx_binding *free_bindings; |
8546e572 | 274 | |
598057ec | 275 | /* Initialize VALUE and TYPE field for BINDING, and set the PREVIOUS |
276 | field to NULL. */ | |
277 | ||
278 | static inline void | |
279 | cxx_binding_init (cxx_binding *binding, tree value, tree type) | |
280 | { | |
281 | binding->value = value; | |
282 | binding->type = type; | |
283 | binding->previous = NULL; | |
284 | } | |
285 | ||
8546e572 | 286 | /* (GC)-allocate a binding object with VALUE and TYPE member initialized. */ |
0e1d7e20 | 287 | |
836495aa | 288 | static cxx_binding * |
8546e572 | 289 | cxx_binding_make (tree value, tree type) |
290 | { | |
291 | cxx_binding *binding; | |
292 | if (free_bindings) | |
293 | { | |
294 | binding = free_bindings; | |
295 | free_bindings = binding->previous; | |
296 | } | |
297 | else | |
ba72912a | 298 | binding = ggc_alloc_cxx_binding (); |
8546e572 | 299 | |
598057ec | 300 | cxx_binding_init (binding, value, type); |
8546e572 | 301 | |
302 | return binding; | |
303 | } | |
304 | ||
305 | /* Put BINDING back on the free list. */ | |
0e1d7e20 | 306 | |
836495aa | 307 | static inline void |
8546e572 | 308 | cxx_binding_free (cxx_binding *binding) |
309 | { | |
0e1d7e20 | 310 | binding->scope = NULL; |
8546e572 | 311 | binding->previous = free_bindings; |
312 | free_bindings = binding; | |
313 | } | |
3bd975bc | 314 | |
d09ae6d5 | 315 | /* Create a new binding for NAME (with the indicated VALUE and TYPE |
316 | bindings) in the class scope indicated by SCOPE. */ | |
836495aa | 317 | |
d09ae6d5 | 318 | static cxx_binding * |
d0ef83bc | 319 | new_class_binding (tree name, tree value, tree type, cp_binding_level *scope) |
836495aa | 320 | { |
d09ae6d5 | 321 | cp_class_binding *cb; |
598057ec | 322 | cxx_binding *binding; |
9031d10b | 323 | |
046bfc77 | 324 | cb = VEC_safe_push (cp_class_binding, gc, scope->class_shadowed, NULL); |
9031d10b | 325 | |
d09ae6d5 | 326 | cb->identifier = name; |
939a5cb9 | 327 | cb->base = binding = cxx_binding_make (value, type); |
d09ae6d5 | 328 | binding->scope = scope; |
d09ae6d5 | 329 | return binding; |
330 | } | |
331 | ||
332 | /* Make DECL the innermost binding for ID. The LEVEL is the binding | |
333 | level at which this declaration is being bound. */ | |
334 | ||
335 | static void | |
d0ef83bc | 336 | push_binding (tree id, tree decl, cp_binding_level* level) |
d09ae6d5 | 337 | { |
338 | cxx_binding *binding; | |
78eb3a28 | 339 | |
d09ae6d5 | 340 | if (level != class_binding_level) |
341 | { | |
342 | binding = cxx_binding_make (decl, NULL_TREE); | |
343 | binding->scope = level; | |
598057ec | 344 | } |
d09ae6d5 | 345 | else |
346 | binding = new_class_binding (id, decl, /*type=*/NULL_TREE, level); | |
9031d10b | 347 | |
836495aa | 348 | /* Now, fill in the binding information. */ |
349 | binding->previous = IDENTIFIER_BINDING (id); | |
836495aa | 350 | INHERITED_VALUE_BINDING_P (binding) = 0; |
351 | LOCAL_BINDING_P (binding) = (level != class_binding_level); | |
352 | ||
353 | /* And put it on the front of the list of bindings for ID. */ | |
354 | IDENTIFIER_BINDING (id) = binding; | |
355 | } | |
356 | ||
357 | /* Remove the binding for DECL which should be the innermost binding | |
358 | for ID. */ | |
359 | ||
360 | void | |
361 | pop_binding (tree id, tree decl) | |
362 | { | |
363 | cxx_binding *binding; | |
364 | ||
365 | if (id == NULL_TREE) | |
366 | /* It's easiest to write the loops that call this function without | |
367 | checking whether or not the entities involved have names. We | |
368 | get here for such an entity. */ | |
369 | return; | |
370 | ||
371 | /* Get the innermost binding for ID. */ | |
372 | binding = IDENTIFIER_BINDING (id); | |
373 | ||
374 | /* The name should be bound. */ | |
b4df430b | 375 | gcc_assert (binding != NULL); |
836495aa | 376 | |
377 | /* The DECL will be either the ordinary binding or the type | |
378 | binding for this identifier. Remove that binding. */ | |
379 | if (binding->value == decl) | |
380 | binding->value = NULL_TREE; | |
836495aa | 381 | else |
2e3e31d2 | 382 | { |
383 | gcc_assert (binding->type == decl); | |
384 | binding->type = NULL_TREE; | |
385 | } | |
836495aa | 386 | |
387 | if (!binding->value && !binding->type) | |
388 | { | |
389 | /* We're completely done with the innermost binding for this | |
390 | identifier. Unhook it from the list of bindings. */ | |
391 | IDENTIFIER_BINDING (id) = binding->previous; | |
392 | ||
393 | /* Add it to the free list. */ | |
394 | cxx_binding_free (binding); | |
395 | } | |
396 | } | |
397 | ||
807f85cf | 398 | /* Strip non dependent using declarations. */ |
399 | ||
400 | tree | |
401 | strip_using_decl (tree decl) | |
402 | { | |
83ae9f05 | 403 | if (decl == NULL_TREE) |
404 | return NULL_TREE; | |
405 | ||
807f85cf | 406 | while (TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl)) |
407 | decl = USING_DECL_DECLS (decl); | |
408 | return decl; | |
409 | } | |
410 | ||
e4bc96e2 | 411 | /* BINDING records an existing declaration for a name in the current scope. |
3bd975bc | 412 | But, DECL is another declaration for that same identifier in the |
413 | same scope. This is the `struct stat' hack whereby a non-typedef | |
414 | class name or enum-name can be bound at the same level as some other | |
415 | kind of entity. | |
416 | 3.3.7/1 | |
417 | ||
418 | A class name (9.1) or enumeration name (7.2) can be hidden by the | |
419 | name of an object, function, or enumerator declared in the same scope. | |
420 | If a class or enumeration name and an object, function, or enumerator | |
421 | are declared in the same scope (in any order) with the same name, the | |
422 | class or enumeration name is hidden wherever the object, function, or | |
423 | enumerator name is visible. | |
424 | ||
425 | It's the responsibility of the caller to check that | |
426 | inserting this name is valid here. Returns nonzero if the new binding | |
427 | was successful. */ | |
428 | ||
836495aa | 429 | static bool |
6198e8f6 | 430 | supplement_binding_1 (cxx_binding *binding, tree decl) |
3bd975bc | 431 | { |
432 | tree bval = binding->value; | |
433 | bool ok = true; | |
807f85cf | 434 | tree target_bval = strip_using_decl (bval); |
435 | tree target_decl = strip_using_decl (decl); | |
436 | ||
437 | if (TREE_CODE (target_decl) == TYPE_DECL && DECL_ARTIFICIAL (target_decl) | |
438 | && target_decl != target_bval | |
439 | && (TREE_CODE (target_bval) != TYPE_DECL | |
440 | /* We allow pushing an enum multiple times in a class | |
441 | template in order to handle late matching of underlying | |
442 | type on an opaque-enum-declaration followed by an | |
443 | enum-specifier. */ | |
444 | || (TREE_CODE (TREE_TYPE (target_decl)) == ENUMERAL_TYPE | |
445 | && TREE_CODE (TREE_TYPE (target_bval)) == ENUMERAL_TYPE | |
446 | && (dependent_type_p (ENUM_UNDERLYING_TYPE | |
447 | (TREE_TYPE (target_decl))) | |
448 | || dependent_type_p (ENUM_UNDERLYING_TYPE | |
449 | (TREE_TYPE (target_bval))))))) | |
3bd975bc | 450 | /* The new name is the type name. */ |
451 | binding->type = decl; | |
807f85cf | 452 | else if (/* TARGET_BVAL is null when push_class_level_binding moves |
453 | an inherited type-binding out of the way to make room | |
454 | for a new value binding. */ | |
455 | !target_bval | |
456 | /* TARGET_BVAL is error_mark_node when TARGET_DECL's name | |
457 | has been used in a non-class scope prior declaration. | |
458 | In that case, we should have already issued a | |
459 | diagnostic; for graceful error recovery purpose, pretend | |
460 | this was the intended declaration for that name. */ | |
461 | || target_bval == error_mark_node | |
462 | /* If TARGET_BVAL is anticipated but has not yet been | |
463 | declared, pretend it is not there at all. */ | |
464 | || (TREE_CODE (target_bval) == FUNCTION_DECL | |
465 | && DECL_ANTICIPATED (target_bval) | |
466 | && !DECL_HIDDEN_FRIEND_P (target_bval))) | |
3bd975bc | 467 | binding->value = decl; |
807f85cf | 468 | else if (TREE_CODE (target_bval) == TYPE_DECL |
469 | && DECL_ARTIFICIAL (target_bval) | |
470 | && target_decl != target_bval | |
471 | && (TREE_CODE (target_decl) != TYPE_DECL | |
472 | || same_type_p (TREE_TYPE (target_decl), | |
473 | TREE_TYPE (target_bval)))) | |
3bd975bc | 474 | { |
475 | /* The old binding was a type name. It was placed in | |
76608a37 | 476 | VALUE field because it was thought, at the point it was |
3bd975bc | 477 | declared, to be the only entity with such a name. Move the |
478 | type name into the type slot; it is now hidden by the new | |
479 | binding. */ | |
480 | binding->type = bval; | |
481 | binding->value = decl; | |
482 | binding->value_is_inherited = false; | |
483 | } | |
807f85cf | 484 | else if (TREE_CODE (target_bval) == TYPE_DECL |
485 | && TREE_CODE (target_decl) == TYPE_DECL | |
486 | && DECL_NAME (target_decl) == DECL_NAME (target_bval) | |
263df831 | 487 | && binding->scope->kind != sk_class |
807f85cf | 488 | && (same_type_p (TREE_TYPE (target_decl), TREE_TYPE (target_bval)) |
3bd975bc | 489 | /* If either type involves template parameters, we must |
490 | wait until instantiation. */ | |
807f85cf | 491 | || uses_template_parms (TREE_TYPE (target_decl)) |
492 | || uses_template_parms (TREE_TYPE (target_bval)))) | |
3bd975bc | 493 | /* We have two typedef-names, both naming the same type to have |
263df831 | 494 | the same name. In general, this is OK because of: |
3bd975bc | 495 | |
653e5405 | 496 | [dcl.typedef] |
3bd975bc | 497 | |
498 | In a given scope, a typedef specifier can be used to redefine | |
499 | the name of any type declared in that scope to refer to the | |
9031d10b | 500 | type to which it already refers. |
263df831 | 501 | |
502 | However, in class scopes, this rule does not apply due to the | |
503 | stricter language in [class.mem] prohibiting redeclarations of | |
504 | members. */ | |
3bd975bc | 505 | ok = false; |
506 | /* There can be two block-scope declarations of the same variable, | |
507 | so long as they are `extern' declarations. However, there cannot | |
508 | be two declarations of the same static data member: | |
509 | ||
510 | [class.mem] | |
511 | ||
512 | A member shall not be declared twice in the | |
513 | member-specification. */ | |
807f85cf | 514 | else if (TREE_CODE (target_decl) == VAR_DECL |
515 | && TREE_CODE (target_bval) == VAR_DECL | |
516 | && DECL_EXTERNAL (target_decl) && DECL_EXTERNAL (target_bval) | |
517 | && !DECL_CLASS_SCOPE_P (target_decl)) | |
3bd975bc | 518 | { |
c1d4295f | 519 | duplicate_decls (decl, binding->value, /*newdecl_is_friend=*/false); |
3bd975bc | 520 | ok = false; |
521 | } | |
4ec378b6 | 522 | else if (TREE_CODE (decl) == NAMESPACE_DECL |
523 | && TREE_CODE (bval) == NAMESPACE_DECL | |
524 | && DECL_NAMESPACE_ALIAS (decl) | |
525 | && DECL_NAMESPACE_ALIAS (bval) | |
526 | && ORIGINAL_NAMESPACE (bval) == ORIGINAL_NAMESPACE (decl)) | |
527 | /* [namespace.alias] | |
9031d10b | 528 | |
4ec378b6 | 529 | In a declarative region, a namespace-alias-definition can be |
530 | used to redefine a namespace-alias declared in that declarative | |
531 | region to refer only to the namespace to which it already | |
532 | refers. */ | |
533 | ok = false; | |
3bd975bc | 534 | else |
535 | { | |
807f85cf | 536 | diagnose_name_conflict (decl, bval); |
3bd975bc | 537 | ok = false; |
538 | } | |
539 | ||
6198e8f6 | 540 | return ok; |
541 | } | |
542 | ||
807f85cf | 543 | /* Diagnose a name conflict between DECL and BVAL. */ |
544 | ||
545 | static void | |
546 | diagnose_name_conflict (tree decl, tree bval) | |
547 | { | |
548 | if (TREE_CODE (decl) == TREE_CODE (bval) | |
549 | && (TREE_CODE (decl) != TYPE_DECL | |
550 | || (DECL_ARTIFICIAL (decl) && DECL_ARTIFICIAL (bval)) | |
551 | || (!DECL_ARTIFICIAL (decl) && !DECL_ARTIFICIAL (bval))) | |
552 | && !is_overloaded_fn (decl)) | |
553 | error ("redeclaration of %q#D", decl); | |
554 | else | |
555 | error ("%q#D conflicts with a previous declaration", decl); | |
556 | ||
557 | inform (input_location, "previous declaration %q+#D", bval); | |
558 | } | |
559 | ||
6198e8f6 | 560 | /* Wrapper for supplement_binding_1. */ |
561 | ||
562 | static bool | |
563 | supplement_binding (cxx_binding *binding, tree decl) | |
564 | { | |
565 | bool ret; | |
566 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); | |
567 | ret = supplement_binding_1 (binding, decl); | |
568 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); | |
569 | return ret; | |
3bd975bc | 570 | } |
836495aa | 571 | |
572 | /* Add DECL to the list of things declared in B. */ | |
573 | ||
9a49d46b | 574 | static void |
d0ef83bc | 575 | add_decl_to_level (tree decl, cp_binding_level *b) |
836495aa | 576 | { |
08e8bd10 | 577 | /* We used to record virtual tables as if they were ordinary |
578 | variables, but no longer do so. */ | |
579 | gcc_assert (!(TREE_CODE (decl) == VAR_DECL && DECL_VIRTUAL_P (decl))); | |
580 | ||
9031d10b | 581 | if (TREE_CODE (decl) == NAMESPACE_DECL |
836495aa | 582 | && !DECL_NAMESPACE_ALIAS (decl)) |
583 | { | |
1767a056 | 584 | DECL_CHAIN (decl) = b->namespaces; |
836495aa | 585 | b->namespaces = decl; |
586 | } | |
9031d10b | 587 | else |
836495aa | 588 | { |
589 | /* We build up the list in reverse order, and reverse it later if | |
653e5405 | 590 | necessary. */ |
836495aa | 591 | TREE_CHAIN (decl) = b->names; |
592 | b->names = decl; | |
836495aa | 593 | |
a567ba1e | 594 | /* If appropriate, add decl to separate list of statics. We |
9031d10b | 595 | include extern variables because they might turn out to be |
a567ba1e | 596 | static later. It's OK for this list to contain a few false |
7677ebb9 | 597 | positives. */ |
836495aa | 598 | if (b->kind == sk_namespace) |
a567ba1e | 599 | if ((TREE_CODE (decl) == VAR_DECL |
600 | && (TREE_STATIC (decl) || DECL_EXTERNAL (decl))) | |
836495aa | 601 | || (TREE_CODE (decl) == FUNCTION_DECL |
602 | && (!TREE_PUBLIC (decl) || DECL_DECLARED_INLINE_P (decl)))) | |
1ae02380 | 603 | VEC_safe_push (tree, gc, b->static_decls, decl); |
836495aa | 604 | } |
605 | } | |
606 | ||
9a49d46b | 607 | /* Record a decl-node X as belonging to the current lexical scope. |
608 | Check for errors (such as an incompatible declaration for the same | |
c1d4295f | 609 | name already seen in the same scope). IS_FRIEND is true if X is |
610 | declared as a friend. | |
9a49d46b | 611 | |
612 | Returns either X or an old decl for the same name. | |
613 | If an old decl is returned, it may have been smashed | |
614 | to agree with what X says. */ | |
615 | ||
6198e8f6 | 616 | static tree |
617 | pushdecl_maybe_friend_1 (tree x, bool is_friend) | |
9a49d46b | 618 | { |
cd16867a | 619 | tree t; |
620 | tree name; | |
9a49d46b | 621 | int need_new_binding; |
622 | ||
68023786 | 623 | if (x == error_mark_node) |
6198e8f6 | 624 | return error_mark_node; |
68023786 | 625 | |
9a49d46b | 626 | need_new_binding = 1; |
627 | ||
628 | if (DECL_TEMPLATE_PARM_P (x)) | |
629 | /* Template parameters have no context; they are not X::T even | |
630 | when declared within a class or namespace. */ | |
631 | ; | |
632 | else | |
633 | { | |
634 | if (current_function_decl && x != current_function_decl | |
635 | /* A local declaration for a function doesn't constitute | |
653e5405 | 636 | nesting. */ |
c3932a15 | 637 | && TREE_CODE (x) != FUNCTION_DECL |
9a49d46b | 638 | /* A local declaration for an `extern' variable is in the |
639 | scope of the current namespace, not the current | |
640 | function. */ | |
641 | && !(TREE_CODE (x) == VAR_DECL && DECL_EXTERNAL (x)) | |
34eac767 | 642 | /* When parsing the parameter list of a function declarator, |
643 | don't set DECL_CONTEXT to an enclosing function. When we | |
644 | push the PARM_DECLs in order to process the function body, | |
645 | current_binding_level->this_entity will be set. */ | |
646 | && !(TREE_CODE (x) == PARM_DECL | |
647 | && current_binding_level->kind == sk_function_parms | |
648 | && current_binding_level->this_entity == NULL) | |
9a49d46b | 649 | && !DECL_CONTEXT (x)) |
650 | DECL_CONTEXT (x) = current_function_decl; | |
651 | ||
652 | /* If this is the declaration for a namespace-scope function, | |
653 | but the declaration itself is in a local scope, mark the | |
654 | declaration. */ | |
655 | if (TREE_CODE (x) == FUNCTION_DECL | |
656 | && DECL_NAMESPACE_SCOPE_P (x) | |
657 | && current_function_decl | |
658 | && x != current_function_decl) | |
659 | DECL_LOCAL_FUNCTION_P (x) = 1; | |
660 | } | |
661 | ||
662 | name = DECL_NAME (x); | |
663 | if (name) | |
664 | { | |
665 | int different_binding_level = 0; | |
666 | ||
667 | if (TREE_CODE (name) == TEMPLATE_ID_EXPR) | |
668 | name = TREE_OPERAND (name, 0); | |
669 | ||
670 | /* In case this decl was explicitly namespace-qualified, look it | |
671 | up in its namespace context. */ | |
c79f94a2 | 672 | if (DECL_NAMESPACE_SCOPE_P (x) && namespace_bindings_p ()) |
9a49d46b | 673 | t = namespace_binding (name, DECL_CONTEXT (x)); |
674 | else | |
e1316b34 | 675 | t = lookup_name_innermost_nonclass_level (name); |
9a49d46b | 676 | |
677 | /* [basic.link] If there is a visible declaration of an entity | |
678 | with linkage having the same name and type, ignoring entities | |
679 | declared outside the innermost enclosing namespace scope, the | |
680 | block scope declaration declares that same entity and | |
681 | receives the linkage of the previous declaration. */ | |
682 | if (! t && current_function_decl && x != current_function_decl | |
683 | && (TREE_CODE (x) == FUNCTION_DECL || TREE_CODE (x) == VAR_DECL) | |
684 | && DECL_EXTERNAL (x)) | |
685 | { | |
686 | /* Look in block scope. */ | |
d09ae6d5 | 687 | t = innermost_non_namespace_value (name); |
9a49d46b | 688 | /* Or in the innermost namespace. */ |
689 | if (! t) | |
690 | t = namespace_binding (name, DECL_CONTEXT (x)); | |
691 | /* Does it have linkage? Note that if this isn't a DECL, it's an | |
692 | OVERLOAD, which is OK. */ | |
693 | if (t && DECL_P (t) && ! (TREE_STATIC (t) || DECL_EXTERNAL (t))) | |
694 | t = NULL_TREE; | |
695 | if (t) | |
696 | different_binding_level = 1; | |
697 | } | |
698 | ||
699 | /* If we are declaring a function, and the result of name-lookup | |
700 | was an OVERLOAD, look for an overloaded instance that is | |
701 | actually the same as the function we are declaring. (If | |
702 | there is one, we have to merge our declaration with the | |
703 | previous declaration.) */ | |
704 | if (t && TREE_CODE (t) == OVERLOAD) | |
705 | { | |
706 | tree match; | |
707 | ||
708 | if (TREE_CODE (x) == FUNCTION_DECL) | |
709 | for (match = t; match; match = OVL_NEXT (match)) | |
710 | { | |
711 | if (decls_match (OVL_CURRENT (match), x)) | |
712 | break; | |
713 | } | |
714 | else | |
715 | /* Just choose one. */ | |
716 | match = t; | |
717 | ||
718 | if (match) | |
719 | t = OVL_CURRENT (match); | |
720 | else | |
721 | t = NULL_TREE; | |
722 | } | |
723 | ||
28bbd27a | 724 | if (t && t != error_mark_node) |
9a49d46b | 725 | { |
726 | if (different_binding_level) | |
727 | { | |
728 | if (decls_match (x, t)) | |
729 | /* The standard only says that the local extern | |
730 | inherits linkage from the previous decl; in | |
7db5a284 | 731 | particular, default args are not shared. Add |
732 | the decl into a hash table to make sure only | |
733 | the previous decl in this case is seen by the | |
734 | middle end. */ | |
146c1b4f | 735 | { |
7db5a284 | 736 | struct cxx_int_tree_map *h; |
737 | void **loc; | |
738 | ||
146c1b4f | 739 | TREE_PUBLIC (x) = TREE_PUBLIC (t); |
7db5a284 | 740 | |
741 | if (cp_function_chain->extern_decl_map == NULL) | |
742 | cp_function_chain->extern_decl_map | |
743 | = htab_create_ggc (20, cxx_int_tree_map_hash, | |
744 | cxx_int_tree_map_eq, NULL); | |
745 | ||
ba72912a | 746 | h = ggc_alloc_cxx_int_tree_map (); |
7db5a284 | 747 | h->uid = DECL_UID (x); |
748 | h->to = t; | |
749 | loc = htab_find_slot_with_hash | |
750 | (cp_function_chain->extern_decl_map, h, | |
751 | h->uid, INSERT); | |
752 | *(struct cxx_int_tree_map **) loc = h; | |
146c1b4f | 753 | } |
9a49d46b | 754 | } |
755 | else if (TREE_CODE (t) == PARM_DECL) | |
756 | { | |
9a49d46b | 757 | /* Check for duplicate params. */ |
4b0fe7e3 | 758 | tree d = duplicate_decls (x, t, is_friend); |
759 | if (d) | |
6198e8f6 | 760 | return d; |
9a49d46b | 761 | } |
762 | else if ((DECL_EXTERN_C_FUNCTION_P (x) | |
763 | || DECL_FUNCTION_TEMPLATE_P (x)) | |
764 | && is_overloaded_fn (t)) | |
765 | /* Don't do anything just yet. */; | |
766 | else if (t == wchar_decl_node) | |
767 | { | |
8864917d | 768 | if (! DECL_IN_SYSTEM_HEADER (x)) |
29438999 | 769 | pedwarn (input_location, OPT_Wpedantic, "redeclaration of %<wchar_t%> as %qT", |
653e5405 | 770 | TREE_TYPE (x)); |
8864917d | 771 | |
9a49d46b | 772 | /* Throw away the redeclaration. */ |
6198e8f6 | 773 | return t; |
9a49d46b | 774 | } |
947f430b | 775 | else |
9a49d46b | 776 | { |
c1d4295f | 777 | tree olddecl = duplicate_decls (x, t, is_friend); |
9031d10b | 778 | |
947f430b | 779 | /* If the redeclaration failed, we can stop at this |
780 | point. */ | |
781 | if (olddecl == error_mark_node) | |
6198e8f6 | 782 | return error_mark_node; |
947f430b | 783 | |
784 | if (olddecl) | |
785 | { | |
786 | if (TREE_CODE (t) == TYPE_DECL) | |
787 | SET_IDENTIFIER_TYPE_VALUE (name, TREE_TYPE (t)); | |
9a49d46b | 788 | |
6198e8f6 | 789 | return t; |
947f430b | 790 | } |
3180c04a | 791 | else if (DECL_MAIN_P (x) && TREE_CODE (t) == FUNCTION_DECL) |
947f430b | 792 | { |
793 | /* A redeclaration of main, but not a duplicate of the | |
794 | previous one. | |
9031d10b | 795 | |
947f430b | 796 | [basic.start.main] |
9031d10b | 797 | |
947f430b | 798 | This function shall not be overloaded. */ |
3cf8b391 | 799 | error ("invalid redeclaration of %q+D", t); |
a2c5b975 | 800 | error ("as %qD", x); |
947f430b | 801 | /* We don't try to push this declaration since that |
802 | causes a crash. */ | |
6198e8f6 | 803 | return x; |
947f430b | 804 | } |
9a49d46b | 805 | } |
806 | } | |
807 | ||
37d43944 | 808 | /* If x has C linkage-specification, (extern "C"), |
809 | lookup its binding, in case it's already bound to an object. | |
810 | The lookup is done in all namespaces. | |
811 | If we find an existing binding, make sure it has the same | |
812 | exception specification as x, otherwise, bail in error [7.5, 7.6]. */ | |
813 | if ((TREE_CODE (x) == FUNCTION_DECL) | |
814 | && DECL_EXTERN_C_P (x) | |
815 | /* We should ignore declarations happening in system headers. */ | |
2e37fcce | 816 | && !DECL_ARTIFICIAL (x) |
37d43944 | 817 | && !DECL_IN_SYSTEM_HEADER (x)) |
818 | { | |
27282252 | 819 | tree previous = lookup_extern_c_fun_in_all_ns (x); |
2e37fcce | 820 | if (previous |
821 | && !DECL_ARTIFICIAL (previous) | |
822 | && !DECL_IN_SYSTEM_HEADER (previous) | |
823 | && DECL_CONTEXT (previous) != DECL_CONTEXT (x)) | |
37d43944 | 824 | { |
37d43944 | 825 | /* In case either x or previous is declared to throw an exception, |
08cc44e7 | 826 | make sure both exception specifications are equal. */ |
37d43944 | 827 | if (decls_match (x, previous)) |
828 | { | |
829 | tree x_exception_spec = NULL_TREE; | |
830 | tree previous_exception_spec = NULL_TREE; | |
831 | ||
832 | x_exception_spec = | |
833 | TYPE_RAISES_EXCEPTIONS (TREE_TYPE (x)); | |
834 | previous_exception_spec = | |
835 | TYPE_RAISES_EXCEPTIONS (TREE_TYPE (previous)); | |
836 | if (!comp_except_specs (previous_exception_spec, | |
837 | x_exception_spec, | |
3644efa5 | 838 | ce_normal)) |
37d43944 | 839 | { |
6198e8f6 | 840 | pedwarn (input_location, 0, |
841 | "declaration of %q#D with C language linkage", | |
8864917d | 842 | x); |
6198e8f6 | 843 | pedwarn (input_location, 0, |
844 | "conflicts with previous declaration %q+#D", | |
8864917d | 845 | previous); |
6198e8f6 | 846 | pedwarn (input_location, 0, |
847 | "due to different exception specifications"); | |
848 | return error_mark_node; | |
37d43944 | 849 | } |
27282252 | 850 | if (DECL_ASSEMBLER_NAME_SET_P (previous)) |
851 | SET_DECL_ASSEMBLER_NAME (x, | |
852 | DECL_ASSEMBLER_NAME (previous)); | |
37d43944 | 853 | } |
2e37fcce | 854 | else |
855 | { | |
856 | pedwarn (input_location, 0, | |
857 | "declaration of %q#D with C language linkage", x); | |
858 | pedwarn (input_location, 0, | |
859 | "conflicts with previous declaration %q+#D", | |
860 | previous); | |
861 | } | |
37d43944 | 862 | } |
863 | } | |
864 | ||
9a49d46b | 865 | check_template_shadow (x); |
866 | ||
a17c2a3a | 867 | /* If this is a function conjured up by the back end, massage it |
9a49d46b | 868 | so it looks friendly. */ |
869 | if (DECL_NON_THUNK_FUNCTION_P (x) && ! DECL_LANG_SPECIFIC (x)) | |
870 | { | |
871 | retrofit_lang_decl (x); | |
872 | SET_DECL_LANGUAGE (x, lang_c); | |
873 | } | |
874 | ||
023e1e09 | 875 | t = x; |
9a49d46b | 876 | if (DECL_NON_THUNK_FUNCTION_P (x) && ! DECL_FUNCTION_MEMBER_P (x)) |
877 | { | |
c1d4295f | 878 | t = push_overloaded_decl (x, PUSH_LOCAL, is_friend); |
9a49d46b | 879 | if (!namespace_bindings_p ()) |
880 | /* We do not need to create a binding for this name; | |
881 | push_overloaded_decl will have already done so if | |
882 | necessary. */ | |
883 | need_new_binding = 0; | |
884 | } | |
885 | else if (DECL_FUNCTION_TEMPLATE_P (x) && DECL_NAMESPACE_SCOPE_P (x)) | |
886 | { | |
c1d4295f | 887 | t = push_overloaded_decl (x, PUSH_GLOBAL, is_friend); |
9a49d46b | 888 | if (t == x) |
889 | add_decl_to_level (x, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t))); | |
9a49d46b | 890 | } |
891 | ||
521facf3 | 892 | if (TREE_CODE (t) == FUNCTION_DECL || DECL_FUNCTION_TEMPLATE_P (t)) |
893 | check_default_args (t); | |
023e1e09 | 894 | |
895 | if (t != x || DECL_FUNCTION_TEMPLATE_P (t)) | |
6198e8f6 | 896 | return t; |
023e1e09 | 897 | |
9a49d46b | 898 | /* If declaring a type as a typedef, copy the type (unless we're |
899 | at line 0), and install this TYPE_DECL as the new type's typedef | |
41771881 | 900 | name. See the extensive comment of set_underlying_type (). */ |
9a49d46b | 901 | if (TREE_CODE (x) == TYPE_DECL) |
902 | { | |
903 | tree type = TREE_TYPE (x); | |
41771881 | 904 | |
905 | if (DECL_IS_BUILTIN (x) | |
906 | || (TREE_TYPE (x) != error_mark_node | |
907 | && TYPE_NAME (type) != x | |
908 | /* We don't want to copy the type when all we're | |
909 | doing is making a TYPE_DECL for the purposes of | |
910 | inlining. */ | |
911 | && (!TYPE_NAME (type) | |
912 | || TYPE_NAME (type) != DECL_ABSTRACT_ORIGIN (x)))) | |
0d432ee0 | 913 | set_underlying_type (x); |
9a49d46b | 914 | |
915 | if (type != error_mark_node | |
916 | && TYPE_NAME (type) | |
917 | && TYPE_IDENTIFIER (type)) | |
653e5405 | 918 | set_identifier_type_value (DECL_NAME (x), x); |
a4e3ffad | 919 | |
920 | /* If this is a locally defined typedef in a function that | |
921 | is not a template instantation, record it to implement | |
922 | -Wunused-local-typedefs. */ | |
923 | if (current_instantiation () == NULL | |
924 | || (current_instantiation ()->decl != current_function_decl)) | |
925 | record_locally_defined_typedef (x); | |
9a49d46b | 926 | } |
927 | ||
928 | /* Multiple external decls of the same identifier ought to match. | |
929 | ||
930 | We get warnings about inline functions where they are defined. | |
931 | We get warnings about other functions from push_overloaded_decl. | |
932 | ||
933 | Avoid duplicate warnings where they are used. */ | |
934 | if (TREE_PUBLIC (x) && TREE_CODE (x) != FUNCTION_DECL) | |
935 | { | |
936 | tree decl; | |
937 | ||
938 | decl = IDENTIFIER_NAMESPACE_VALUE (name); | |
939 | if (decl && TREE_CODE (decl) == OVERLOAD) | |
940 | decl = OVL_FUNCTION (decl); | |
941 | ||
942 | if (decl && decl != error_mark_node | |
943 | && (DECL_EXTERNAL (decl) || TREE_PUBLIC (decl)) | |
944 | /* If different sort of thing, we already gave an error. */ | |
945 | && TREE_CODE (decl) == TREE_CODE (x) | |
946 | && !same_type_p (TREE_TYPE (x), TREE_TYPE (decl))) | |
947 | { | |
2b9e3597 | 948 | permerror (input_location, "type mismatch with previous external decl of %q#D", x); |
949 | permerror (input_location, "previous external decl of %q+#D", decl); | |
9a49d46b | 950 | } |
951 | } | |
952 | ||
c1d4295f | 953 | if (TREE_CODE (x) == FUNCTION_DECL |
954 | && is_friend | |
955 | && !flag_friend_injection) | |
956 | { | |
957 | /* This is a new declaration of a friend function, so hide | |
958 | it from ordinary function lookup. */ | |
959 | DECL_ANTICIPATED (x) = 1; | |
960 | DECL_HIDDEN_FRIEND_P (x) = 1; | |
961 | } | |
962 | ||
9a49d46b | 963 | /* This name is new in its binding level. |
964 | Install the new declaration and return it. */ | |
965 | if (namespace_bindings_p ()) | |
966 | { | |
967 | /* Install a global value. */ | |
968 | ||
969 | /* If the first global decl has external linkage, | |
970 | warn if we later see static one. */ | |
971 | if (IDENTIFIER_GLOBAL_VALUE (name) == NULL_TREE && TREE_PUBLIC (x)) | |
972 | TREE_PUBLIC (name) = 1; | |
973 | ||
653e5405 | 974 | /* Bind the name for the entity. */ |
975 | if (!(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x) | |
976 | && t != NULL_TREE) | |
977 | && (TREE_CODE (x) == TYPE_DECL | |
978 | || TREE_CODE (x) == VAR_DECL | |
653e5405 | 979 | || TREE_CODE (x) == NAMESPACE_DECL |
980 | || TREE_CODE (x) == CONST_DECL | |
981 | || TREE_CODE (x) == TEMPLATE_DECL)) | |
982 | SET_IDENTIFIER_NAMESPACE_VALUE (name, x); | |
9a49d46b | 983 | |
9a49d46b | 984 | /* If new decl is `static' and an `extern' was seen previously, |
985 | warn about it. */ | |
986 | if (x != NULL_TREE && t != NULL_TREE && decls_match (x, t)) | |
987 | warn_extern_redeclared_static (x, t); | |
988 | } | |
989 | else | |
990 | { | |
991 | /* Here to install a non-global value. */ | |
9a49d46b | 992 | tree oldglobal = IDENTIFIER_NAMESPACE_VALUE (name); |
16878d88 | 993 | tree oldlocal = NULL_TREE; |
d0ef83bc | 994 | cp_binding_level *oldscope = NULL; |
16878d88 | 995 | cxx_binding *oldbinding = outer_binding (name, NULL, true); |
996 | if (oldbinding) | |
997 | { | |
998 | oldlocal = oldbinding->value; | |
999 | oldscope = oldbinding->scope; | |
1000 | } | |
9a49d46b | 1001 | |
1002 | if (need_new_binding) | |
1003 | { | |
1004 | push_local_binding (name, x, 0); | |
1005 | /* Because push_local_binding will hook X on to the | |
1006 | current_binding_level's name list, we don't want to | |
1007 | do that again below. */ | |
1008 | need_new_binding = 0; | |
1009 | } | |
1010 | ||
1011 | /* If this is a TYPE_DECL, push it into the type value slot. */ | |
1012 | if (TREE_CODE (x) == TYPE_DECL) | |
1013 | set_identifier_type_value (name, x); | |
1014 | ||
1015 | /* Clear out any TYPE_DECL shadowed by a namespace so that | |
1016 | we won't think this is a type. The C struct hack doesn't | |
1017 | go through namespaces. */ | |
1018 | if (TREE_CODE (x) == NAMESPACE_DECL) | |
1019 | set_identifier_type_value (name, NULL_TREE); | |
1020 | ||
1021 | if (oldlocal) | |
1022 | { | |
1023 | tree d = oldlocal; | |
1024 | ||
1025 | while (oldlocal | |
1026 | && TREE_CODE (oldlocal) == VAR_DECL | |
1027 | && DECL_DEAD_FOR_LOCAL (oldlocal)) | |
1028 | oldlocal = DECL_SHADOWED_FOR_VAR (oldlocal); | |
1029 | ||
1030 | if (oldlocal == NULL_TREE) | |
1031 | oldlocal = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d)); | |
1032 | } | |
1033 | ||
1034 | /* If this is an extern function declaration, see if we | |
1035 | have a global definition or declaration for the function. */ | |
1036 | if (oldlocal == NULL_TREE | |
1037 | && DECL_EXTERNAL (x) | |
1038 | && oldglobal != NULL_TREE | |
1039 | && TREE_CODE (x) == FUNCTION_DECL | |
1040 | && TREE_CODE (oldglobal) == FUNCTION_DECL) | |
1041 | { | |
1042 | /* We have one. Their types must agree. */ | |
1043 | if (decls_match (x, oldglobal)) | |
1044 | /* OK */; | |
1045 | else | |
1046 | { | |
bf776685 | 1047 | warning (0, "extern declaration of %q#D doesn%'t match", x); |
3cf8b391 | 1048 | warning (0, "global declaration %q+#D", oldglobal); |
9a49d46b | 1049 | } |
1050 | } | |
1051 | /* If we have a local external declaration, | |
1052 | and no file-scope declaration has yet been seen, | |
1053 | then if we later have a file-scope decl it must not be static. */ | |
1054 | if (oldlocal == NULL_TREE | |
1055 | && oldglobal == NULL_TREE | |
1056 | && DECL_EXTERNAL (x) | |
1057 | && TREE_PUBLIC (x)) | |
1058 | TREE_PUBLIC (name) = 1; | |
1059 | ||
18a20006 | 1060 | /* Don't complain about the parms we push and then pop |
1061 | while tentatively parsing a function declarator. */ | |
1062 | if (TREE_CODE (x) == PARM_DECL && DECL_CONTEXT (x) == NULL_TREE) | |
1063 | /* Ignore. */; | |
1064 | ||
9a49d46b | 1065 | /* Warn if shadowing an argument at the top level of the body. */ |
18a20006 | 1066 | else if (oldlocal != NULL_TREE && !DECL_EXTERNAL (x) |
1067 | /* Inline decls shadow nothing. */ | |
1068 | && !DECL_FROM_INLINE (x) | |
fe9885ed | 1069 | && (TREE_CODE (oldlocal) == PARM_DECL |
42ece02c | 1070 | || TREE_CODE (oldlocal) == VAR_DECL |
1071 | /* If the old decl is a type decl, only warn if the | |
1072 | old decl is an explicit typedef or if both the old | |
1073 | and new decls are type decls. */ | |
1074 | || (TREE_CODE (oldlocal) == TYPE_DECL | |
1075 | && (!DECL_ARTIFICIAL (oldlocal) | |
1076 | || TREE_CODE (x) == TYPE_DECL))) | |
42ece02c | 1077 | /* Don't check for internally generated vars unless |
1078 | it's an implicit typedef (see create_implicit_typedef | |
1079 | in decl.c). */ | |
1080 | && (!DECL_ARTIFICIAL (x) || DECL_IMPLICIT_TYPEDEF_P (x))) | |
9a49d46b | 1081 | { |
fe9885ed | 1082 | bool nowarn = false; |
9a49d46b | 1083 | |
1084 | /* Don't complain if it's from an enclosing function. */ | |
1085 | if (DECL_CONTEXT (oldlocal) == current_function_decl | |
fe9885ed | 1086 | && TREE_CODE (x) != PARM_DECL |
1087 | && TREE_CODE (oldlocal) == PARM_DECL) | |
9a49d46b | 1088 | { |
1089 | /* Go to where the parms should be and see if we find | |
1090 | them there. */ | |
d0ef83bc | 1091 | cp_binding_level *b = current_binding_level->level_chain; |
9a49d46b | 1092 | |
bc2b76e0 | 1093 | if (FUNCTION_NEEDS_BODY_BLOCK (current_function_decl)) |
1094 | /* Skip the ctor/dtor cleanup level. */ | |
1095 | b = b->level_chain; | |
9a49d46b | 1096 | |
1097 | /* ARM $8.3 */ | |
1098 | if (b->kind == sk_function_parms) | |
1099 | { | |
a2c5b975 | 1100 | error ("declaration of %q#D shadows a parameter", x); |
fe9885ed | 1101 | nowarn = true; |
9a49d46b | 1102 | } |
1103 | } | |
1104 | ||
fe9885ed | 1105 | /* The local structure or class can't use parameters of |
1106 | the containing function anyway. */ | |
1107 | if (DECL_CONTEXT (oldlocal) != current_function_decl) | |
a3ad3e27 | 1108 | { |
d0ef83bc | 1109 | cp_binding_level *scope = current_binding_level; |
fe9885ed | 1110 | tree context = DECL_CONTEXT (oldlocal); |
1111 | for (; scope; scope = scope->level_chain) | |
1112 | { | |
1113 | if (scope->kind == sk_function_parms | |
1114 | && scope->this_entity == context) | |
1115 | break; | |
1116 | if (scope->kind == sk_class | |
1117 | && !LAMBDA_TYPE_P (scope->this_entity)) | |
1118 | { | |
1119 | nowarn = true; | |
1120 | break; | |
1121 | } | |
1122 | } | |
1123 | } | |
16878d88 | 1124 | /* Error if redeclaring a local declared in a |
1125 | for-init-statement or in the condition of an if or | |
1126 | switch statement when the new declaration is in the | |
1127 | outermost block of the controlled statement. | |
1128 | Redeclaring a variable from a for or while condition is | |
1129 | detected elsewhere. */ | |
1130 | else if (TREE_CODE (oldlocal) == VAR_DECL | |
1131 | && oldscope == current_binding_level->level_chain | |
1132 | && (oldscope->kind == sk_cond | |
1133 | || oldscope->kind == sk_for)) | |
1134 | { | |
1135 | error ("redeclaration of %q#D", x); | |
1136 | error ("%q+#D previously declared here", oldlocal); | |
1137 | } | |
fe9885ed | 1138 | |
1139 | if (warn_shadow && !nowarn) | |
1140 | { | |
1141 | if (TREE_CODE (oldlocal) == PARM_DECL) | |
1142 | warning_at (input_location, OPT_Wshadow, | |
1143 | "declaration of %q#D shadows a parameter", x); | |
bcc4b4ea | 1144 | else if (is_capture_proxy (oldlocal)) |
1145 | warning_at (input_location, OPT_Wshadow, | |
1146 | "declaration of %qD shadows a lambda capture", | |
1147 | x); | |
fe9885ed | 1148 | else |
1149 | warning_at (input_location, OPT_Wshadow, | |
1150 | "declaration of %qD shadows a previous local", | |
1151 | x); | |
1152 | warning_at (DECL_SOURCE_LOCATION (oldlocal), OPT_Wshadow, | |
1153 | "shadowed declaration is here"); | |
a3ad3e27 | 1154 | } |
9a49d46b | 1155 | } |
1156 | ||
1157 | /* Maybe warn if shadowing something else. */ | |
1158 | else if (warn_shadow && !DECL_EXTERNAL (x) | |
42ece02c | 1159 | /* No shadow warnings for internally generated vars unless |
1160 | it's an implicit typedef (see create_implicit_typedef | |
1161 | in decl.c). */ | |
1162 | && (! DECL_ARTIFICIAL (x) || DECL_IMPLICIT_TYPEDEF_P (x)) | |
1163 | /* No shadow warnings for vars made for inlining. */ | |
1164 | && ! DECL_FROM_INLINE (x)) | |
9a49d46b | 1165 | { |
fa26c7a9 | 1166 | tree member; |
1167 | ||
1168 | if (current_class_ptr) | |
1169 | member = lookup_member (current_class_type, | |
1170 | name, | |
1171 | /*protect=*/0, | |
2cbaacd9 | 1172 | /*want_type=*/false, |
1173 | tf_warning_or_error); | |
fa26c7a9 | 1174 | else |
1175 | member = NULL_TREE; | |
9031d10b | 1176 | |
fa26c7a9 | 1177 | if (member && !TREE_STATIC (member)) |
a3ad3e27 | 1178 | { |
1179 | /* Location of previous decl is not useful in this case. */ | |
ced7c954 | 1180 | warning (OPT_Wshadow, "declaration of %qD shadows a member of 'this'", |
a3ad3e27 | 1181 | x); |
1182 | } | |
9a49d46b | 1183 | else if (oldglobal != NULL_TREE |
42ece02c | 1184 | && (TREE_CODE (oldglobal) == VAR_DECL |
1185 | /* If the old decl is a type decl, only warn if the | |
1186 | old decl is an explicit typedef or if both the | |
1187 | old and new decls are type decls. */ | |
1188 | || (TREE_CODE (oldglobal) == TYPE_DECL | |
1189 | && (!DECL_ARTIFICIAL (oldglobal) | |
1190 | || TREE_CODE (x) == TYPE_DECL)))) | |
9a49d46b | 1191 | /* XXX shadow warnings in outer-more namespaces */ |
a3ad3e27 | 1192 | { |
712d2297 | 1193 | warning_at (input_location, OPT_Wshadow, |
1194 | "declaration of %qD shadows a global declaration", x); | |
1195 | warning_at (DECL_SOURCE_LOCATION (oldglobal), OPT_Wshadow, | |
1196 | "shadowed declaration is here"); | |
a3ad3e27 | 1197 | } |
9a49d46b | 1198 | } |
1199 | } | |
1200 | ||
9a49d46b | 1201 | if (TREE_CODE (x) == VAR_DECL) |
1202 | maybe_register_incomplete_var (x); | |
1203 | } | |
1204 | ||
1205 | if (need_new_binding) | |
1206 | add_decl_to_level (x, | |
1207 | DECL_NAMESPACE_SCOPE_P (x) | |
1208 | ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x)) | |
1209 | : current_binding_level); | |
1210 | ||
6198e8f6 | 1211 | return x; |
1212 | } | |
1213 | ||
1214 | /* Wrapper for pushdecl_maybe_friend_1. */ | |
1215 | ||
1216 | tree | |
1217 | pushdecl_maybe_friend (tree x, bool is_friend) | |
1218 | { | |
1219 | tree ret; | |
1220 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); | |
1221 | ret = pushdecl_maybe_friend_1 (x, is_friend); | |
1222 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); | |
1223 | return ret; | |
9a49d46b | 1224 | } |
1225 | ||
c1d4295f | 1226 | /* Record a decl-node X as belonging to the current lexical scope. */ |
1227 | ||
1228 | tree | |
1229 | pushdecl (tree x) | |
1230 | { | |
1231 | return pushdecl_maybe_friend (x, false); | |
1232 | } | |
1233 | ||
9a49d46b | 1234 | /* Enter DECL into the symbol table, if that's appropriate. Returns |
1235 | DECL, or a modified version thereof. */ | |
1236 | ||
1237 | tree | |
1238 | maybe_push_decl (tree decl) | |
1239 | { | |
1240 | tree type = TREE_TYPE (decl); | |
1241 | ||
1242 | /* Add this decl to the current binding level, but not if it comes | |
1243 | from another scope, e.g. a static member variable. TEM may equal | |
1244 | DECL or it may be a previous decl of the same name. */ | |
1245 | if (decl == error_mark_node | |
1246 | || (TREE_CODE (decl) != PARM_DECL | |
1247 | && DECL_CONTEXT (decl) != NULL_TREE | |
1248 | /* Definitions of namespace members outside their namespace are | |
1249 | possible. */ | |
2108f7c0 | 1250 | && !DECL_NAMESPACE_SCOPE_P (decl)) |
9a49d46b | 1251 | || (TREE_CODE (decl) == TEMPLATE_DECL && !namespace_bindings_p ()) |
4fdaf896 | 1252 | || type == unknown_type_node |
9a49d46b | 1253 | /* The declaration of a template specialization does not affect |
1254 | the functions available for overload resolution, so we do not | |
1255 | call pushdecl. */ | |
1256 | || (TREE_CODE (decl) == FUNCTION_DECL | |
1257 | && DECL_TEMPLATE_SPECIALIZATION (decl))) | |
1258 | return decl; | |
1259 | else | |
1260 | return pushdecl (decl); | |
1261 | } | |
1262 | ||
836495aa | 1263 | /* Bind DECL to ID in the current_binding_level, assumed to be a local |
1264 | binding level. If PUSH_USING is set in FLAGS, we know that DECL | |
1265 | doesn't really belong to this binding level, that it got here | |
1266 | through a using-declaration. */ | |
1267 | ||
28bbd27a | 1268 | void |
836495aa | 1269 | push_local_binding (tree id, tree decl, int flags) |
1270 | { | |
d0ef83bc | 1271 | cp_binding_level *b; |
836495aa | 1272 | |
1273 | /* Skip over any local classes. This makes sense if we call | |
1274 | push_local_binding with a friend decl of a local class. */ | |
1275 | b = innermost_nonclass_level (); | |
1276 | ||
e1316b34 | 1277 | if (lookup_name_innermost_nonclass_level (id)) |
836495aa | 1278 | { |
1279 | /* Supplement the existing binding. */ | |
1280 | if (!supplement_binding (IDENTIFIER_BINDING (id), decl)) | |
1281 | /* It didn't work. Something else must be bound at this | |
1282 | level. Do not add DECL to the list of things to pop | |
1283 | later. */ | |
1284 | return; | |
1285 | } | |
1286 | else | |
1287 | /* Create a new binding. */ | |
1288 | push_binding (id, decl, b); | |
1289 | ||
1290 | if (TREE_CODE (decl) == OVERLOAD || (flags & PUSH_USING)) | |
1291 | /* We must put the OVERLOAD into a TREE_LIST since the | |
1292 | TREE_CHAIN of an OVERLOAD is already used. Similarly for | |
1293 | decls that got here through a using-declaration. */ | |
1294 | decl = build_tree_list (NULL_TREE, decl); | |
1295 | ||
1296 | /* And put DECL on the list of things declared by the current | |
1297 | binding level. */ | |
1298 | add_decl_to_level (decl, b); | |
1299 | } | |
9a49d46b | 1300 | |
9a49d46b | 1301 | /* Check to see whether or not DECL is a variable that would have been |
1302 | in scope under the ARM, but is not in scope under the ANSI/ISO | |
1303 | standard. If so, issue an error message. If name lookup would | |
1304 | work in both cases, but return a different result, this function | |
1305 | returns the result of ANSI/ISO lookup. Otherwise, it returns | |
1306 | DECL. */ | |
1307 | ||
1308 | tree | |
1309 | check_for_out_of_scope_variable (tree decl) | |
1310 | { | |
1311 | tree shadowed; | |
1312 | ||
1313 | /* We only care about out of scope variables. */ | |
1314 | if (!(TREE_CODE (decl) == VAR_DECL && DECL_DEAD_FOR_LOCAL (decl))) | |
1315 | return decl; | |
1316 | ||
074ab442 | 1317 | shadowed = DECL_HAS_SHADOWED_FOR_VAR_P (decl) |
5ded8c6f | 1318 | ? DECL_SHADOWED_FOR_VAR (decl) : NULL_TREE ; |
9a49d46b | 1319 | while (shadowed != NULL_TREE && TREE_CODE (shadowed) == VAR_DECL |
1320 | && DECL_DEAD_FOR_LOCAL (shadowed)) | |
074ab442 | 1321 | shadowed = DECL_HAS_SHADOWED_FOR_VAR_P (shadowed) |
5ded8c6f | 1322 | ? DECL_SHADOWED_FOR_VAR (shadowed) : NULL_TREE; |
9a49d46b | 1323 | if (!shadowed) |
1324 | shadowed = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (decl)); | |
1325 | if (shadowed) | |
1326 | { | |
1327 | if (!DECL_ERROR_REPORTED (decl)) | |
1328 | { | |
c3ceba8e | 1329 | warning (0, "name lookup of %qD changed", DECL_NAME (decl)); |
3cf8b391 | 1330 | warning (0, " matches this %q+D under ISO standard rules", |
1331 | shadowed); | |
1332 | warning (0, " matches this %q+D under old rules", decl); | |
9a49d46b | 1333 | DECL_ERROR_REPORTED (decl) = 1; |
1334 | } | |
1335 | return shadowed; | |
1336 | } | |
1337 | ||
1338 | /* If we have already complained about this declaration, there's no | |
1339 | need to do it again. */ | |
1340 | if (DECL_ERROR_REPORTED (decl)) | |
1341 | return decl; | |
1342 | ||
1343 | DECL_ERROR_REPORTED (decl) = 1; | |
8db6f235 | 1344 | |
1345 | if (TREE_TYPE (decl) == error_mark_node) | |
1346 | return decl; | |
1347 | ||
9a49d46b | 1348 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (decl))) |
1349 | { | |
561fec9d | 1350 | error ("name lookup of %qD changed for ISO %<for%> scoping", |
9a49d46b | 1351 | DECL_NAME (decl)); |
3cf8b391 | 1352 | error (" cannot use obsolete binding at %q+D because " |
1353 | "it has a destructor", decl); | |
9a49d46b | 1354 | return error_mark_node; |
1355 | } | |
1356 | else | |
1357 | { | |
2b9e3597 | 1358 | permerror (input_location, "name lookup of %qD changed for ISO %<for%> scoping", |
561fec9d | 1359 | DECL_NAME (decl)); |
1360 | if (flag_permissive) | |
2b9e3597 | 1361 | permerror (input_location, " using obsolete binding at %q+D", decl); |
561fec9d | 1362 | else |
1363 | { | |
1364 | static bool hint; | |
1365 | if (!hint) | |
1366 | { | |
5bcc316e | 1367 | inform (input_location, "(if you use %<-fpermissive%> G++ will accept your code)"); |
561fec9d | 1368 | hint = true; |
1369 | } | |
1370 | } | |
9a49d46b | 1371 | } |
1372 | ||
1373 | return decl; | |
1374 | } | |
836495aa | 1375 | \f |
1376 | /* true means unconditionally make a BLOCK for the next level pushed. */ | |
1377 | ||
1378 | static bool keep_next_level_flag; | |
1379 | ||
1380 | static int binding_depth = 0; | |
836495aa | 1381 | |
1382 | static void | |
1383 | indent (int depth) | |
1384 | { | |
1385 | int i; | |
1386 | ||
1387 | for (i = 0; i < depth * 2; i++) | |
1388 | putc (' ', stderr); | |
1389 | } | |
1390 | ||
1391 | /* Return a string describing the kind of SCOPE we have. */ | |
1392 | static const char * | |
d0ef83bc | 1393 | cp_binding_level_descriptor (cp_binding_level *scope) |
836495aa | 1394 | { |
1395 | /* The order of this table must match the "scope_kind" | |
1396 | enumerators. */ | |
1397 | static const char* scope_kind_names[] = { | |
1398 | "block-scope", | |
1399 | "cleanup-scope", | |
1400 | "try-scope", | |
1401 | "catch-scope", | |
1402 | "for-scope", | |
1403 | "function-parameter-scope", | |
1404 | "class-scope", | |
1405 | "namespace-scope", | |
1406 | "template-parameter-scope", | |
1407 | "template-explicit-spec-scope" | |
1408 | }; | |
1409 | const scope_kind kind = scope->explicit_spec_p | |
1410 | ? sk_template_spec : scope->kind; | |
1411 | ||
1412 | return scope_kind_names[kind]; | |
1413 | } | |
1414 | ||
63eff20d | 1415 | /* Output a debugging information about SCOPE when performing |
836495aa | 1416 | ACTION at LINE. */ |
1417 | static void | |
d0ef83bc | 1418 | cp_binding_level_debug (cp_binding_level *scope, int line, const char *action) |
836495aa | 1419 | { |
d0ef83bc | 1420 | const char *desc = cp_binding_level_descriptor (scope); |
836495aa | 1421 | if (scope->this_entity) |
1422 | verbatim ("%s %s(%E) %p %d\n", action, desc, | |
653e5405 | 1423 | scope->this_entity, (void *) scope, line); |
836495aa | 1424 | else |
1425 | verbatim ("%s %s %p %d\n", action, desc, (void *) scope, line); | |
1426 | } | |
1427 | ||
1428 | /* Return the estimated initial size of the hashtable of a NAMESPACE | |
1429 | scope. */ | |
1430 | ||
1431 | static inline size_t | |
1432 | namespace_scope_ht_size (tree ns) | |
1433 | { | |
1434 | tree name = DECL_NAME (ns); | |
1435 | ||
1436 | return name == std_identifier | |
1437 | ? NAMESPACE_STD_HT_SIZE | |
1438 | : (name == global_scope_name | |
1439 | ? GLOBAL_SCOPE_HT_SIZE | |
1440 | : NAMESPACE_ORDINARY_HT_SIZE); | |
1441 | } | |
1442 | ||
1443 | /* A chain of binding_level structures awaiting reuse. */ | |
1444 | ||
d0ef83bc | 1445 | static GTY((deletable)) cp_binding_level *free_binding_level; |
836495aa | 1446 | |
598057ec | 1447 | /* Insert SCOPE as the innermost binding level. */ |
1448 | ||
1449 | void | |
d0ef83bc | 1450 | push_binding_level (cp_binding_level *scope) |
598057ec | 1451 | { |
1452 | /* Add it to the front of currently active scopes stack. */ | |
1453 | scope->level_chain = current_binding_level; | |
1454 | current_binding_level = scope; | |
1455 | keep_next_level_flag = false; | |
1456 | ||
1457 | if (ENABLE_SCOPE_CHECKING) | |
1458 | { | |
1459 | scope->binding_depth = binding_depth; | |
1460 | indent (binding_depth); | |
d0ef83bc | 1461 | cp_binding_level_debug (scope, input_line, "push"); |
598057ec | 1462 | binding_depth++; |
1463 | } | |
1464 | } | |
1465 | ||
836495aa | 1466 | /* Create a new KIND scope and make it the top of the active scopes stack. |
1467 | ENTITY is the scope of the associated C++ entity (namespace, class, | |
3f00a6c0 | 1468 | function, C++0x enumeration); it is NULL otherwise. */ |
836495aa | 1469 | |
d0ef83bc | 1470 | cp_binding_level * |
836495aa | 1471 | begin_scope (scope_kind kind, tree entity) |
1472 | { | |
d0ef83bc | 1473 | cp_binding_level *scope; |
9031d10b | 1474 | |
836495aa | 1475 | /* Reuse or create a struct for this binding level. */ |
1476 | if (!ENABLE_SCOPE_CHECKING && free_binding_level) | |
1477 | { | |
1478 | scope = free_binding_level; | |
d0ef83bc | 1479 | memset (scope, 0, sizeof (cp_binding_level)); |
836495aa | 1480 | free_binding_level = scope->level_chain; |
1481 | } | |
1482 | else | |
d0ef83bc | 1483 | scope = ggc_alloc_cleared_cp_binding_level (); |
836495aa | 1484 | |
1485 | scope->this_entity = entity; | |
1486 | scope->more_cleanups_ok = true; | |
1487 | switch (kind) | |
1488 | { | |
1489 | case sk_cleanup: | |
1490 | scope->keep = true; | |
1491 | break; | |
9031d10b | 1492 | |
836495aa | 1493 | case sk_template_spec: |
1494 | scope->explicit_spec_p = true; | |
1495 | kind = sk_template_parms; | |
331bc0ad | 1496 | /* Fall through. */ |
836495aa | 1497 | case sk_template_parms: |
1498 | case sk_block: | |
1499 | case sk_try: | |
1500 | case sk_catch: | |
1501 | case sk_for: | |
16878d88 | 1502 | case sk_cond: |
836495aa | 1503 | case sk_class: |
3f00a6c0 | 1504 | case sk_scoped_enum: |
836495aa | 1505 | case sk_function_parms: |
8487df40 | 1506 | case sk_omp: |
836495aa | 1507 | scope->keep = keep_next_level_flag; |
1508 | break; | |
1509 | ||
1510 | case sk_namespace: | |
836495aa | 1511 | NAMESPACE_LEVEL (entity) = scope; |
1ae02380 | 1512 | scope->static_decls = |
1513 | VEC_alloc (tree, gc, | |
1514 | DECL_NAME (entity) == std_identifier | |
1515 | || DECL_NAME (entity) == global_scope_name | |
1516 | ? 200 : 10); | |
836495aa | 1517 | break; |
1518 | ||
1519 | default: | |
1520 | /* Should not happen. */ | |
b4df430b | 1521 | gcc_unreachable (); |
836495aa | 1522 | break; |
1523 | } | |
1524 | scope->kind = kind; | |
1525 | ||
598057ec | 1526 | push_binding_level (scope); |
836495aa | 1527 | |
1528 | return scope; | |
1529 | } | |
1530 | ||
1531 | /* We're about to leave current scope. Pop the top of the stack of | |
1532 | currently active scopes. Return the enclosing scope, now active. */ | |
1533 | ||
d0ef83bc | 1534 | cp_binding_level * |
836495aa | 1535 | leave_scope (void) |
1536 | { | |
d0ef83bc | 1537 | cp_binding_level *scope = current_binding_level; |
836495aa | 1538 | |
1539 | if (scope->kind == sk_namespace && class_binding_level) | |
1540 | current_binding_level = class_binding_level; | |
1541 | ||
1542 | /* We cannot leave a scope, if there are none left. */ | |
1543 | if (NAMESPACE_LEVEL (global_namespace)) | |
b4df430b | 1544 | gcc_assert (!global_scope_p (scope)); |
9031d10b | 1545 | |
836495aa | 1546 | if (ENABLE_SCOPE_CHECKING) |
1547 | { | |
1548 | indent (--binding_depth); | |
d0ef83bc | 1549 | cp_binding_level_debug (scope, input_line, "leave"); |
836495aa | 1550 | } |
1551 | ||
1552 | /* Move one nesting level up. */ | |
1553 | current_binding_level = scope->level_chain; | |
1554 | ||
598057ec | 1555 | /* Namespace-scopes are left most probably temporarily, not |
799435d8 | 1556 | completely; they can be reopened later, e.g. in namespace-extension |
598057ec | 1557 | or any name binding activity that requires us to resume a |
1558 | namespace. For classes, we cache some binding levels. For other | |
836495aa | 1559 | scopes, we just make the structure available for reuse. */ |
598057ec | 1560 | if (scope->kind != sk_namespace |
1561 | && scope->kind != sk_class) | |
836495aa | 1562 | { |
1563 | scope->level_chain = free_binding_level; | |
b4df430b | 1564 | gcc_assert (!ENABLE_SCOPE_CHECKING |
1565 | || scope->binding_depth == binding_depth); | |
836495aa | 1566 | free_binding_level = scope; |
1567 | } | |
1568 | ||
1569 | /* Find the innermost enclosing class scope, and reset | |
1570 | CLASS_BINDING_LEVEL appropriately. */ | |
b7412c2f | 1571 | if (scope->kind == sk_class) |
1572 | { | |
1573 | class_binding_level = NULL; | |
1574 | for (scope = current_binding_level; scope; scope = scope->level_chain) | |
1575 | if (scope->kind == sk_class) | |
1576 | { | |
1577 | class_binding_level = scope; | |
1578 | break; | |
1579 | } | |
1580 | } | |
836495aa | 1581 | |
1582 | return current_binding_level; | |
1583 | } | |
1584 | ||
1585 | static void | |
d0ef83bc | 1586 | resume_scope (cp_binding_level* b) |
836495aa | 1587 | { |
1588 | /* Resuming binding levels is meant only for namespaces, | |
1589 | and those cannot nest into classes. */ | |
b4df430b | 1590 | gcc_assert (!class_binding_level); |
836495aa | 1591 | /* Also, resuming a non-directly nested namespace is a no-no. */ |
b4df430b | 1592 | gcc_assert (b->level_chain == current_binding_level); |
836495aa | 1593 | current_binding_level = b; |
1594 | if (ENABLE_SCOPE_CHECKING) | |
1595 | { | |
1596 | b->binding_depth = binding_depth; | |
1597 | indent (binding_depth); | |
d0ef83bc | 1598 | cp_binding_level_debug (b, input_line, "resume"); |
836495aa | 1599 | binding_depth++; |
1600 | } | |
1601 | } | |
1602 | ||
1603 | /* Return the innermost binding level that is not for a class scope. */ | |
1604 | ||
d0ef83bc | 1605 | static cp_binding_level * |
836495aa | 1606 | innermost_nonclass_level (void) |
1607 | { | |
d0ef83bc | 1608 | cp_binding_level *b; |
836495aa | 1609 | |
1610 | b = current_binding_level; | |
1611 | while (b->kind == sk_class) | |
1612 | b = b->level_chain; | |
1613 | ||
1614 | return b; | |
1615 | } | |
1616 | ||
1617 | /* We're defining an object of type TYPE. If it needs a cleanup, but | |
1618 | we're not allowed to add any more objects with cleanups to the current | |
1619 | scope, create a new binding level. */ | |
1620 | ||
1621 | void | |
1622 | maybe_push_cleanup_level (tree type) | |
1623 | { | |
93850d73 | 1624 | if (type != error_mark_node |
1625 | && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type) | |
836495aa | 1626 | && current_binding_level->more_cleanups_ok == 0) |
1627 | { | |
1628 | begin_scope (sk_cleanup, NULL); | |
2363ef00 | 1629 | current_binding_level->statement_list = push_stmt_list (); |
836495aa | 1630 | } |
1631 | } | |
1632 | ||
1d2bb655 | 1633 | /* Return true if we are in the global binding level. */ |
836495aa | 1634 | |
1d2bb655 | 1635 | bool |
836495aa | 1636 | global_bindings_p (void) |
1637 | { | |
1638 | return global_scope_p (current_binding_level); | |
1639 | } | |
1640 | ||
1641 | /* True if we are currently in a toplevel binding level. This | |
1642 | means either the global binding level or a namespace in a toplevel | |
1643 | binding level. Since there are no non-toplevel namespace levels, | |
1644 | this really means any namespace or template parameter level. We | |
1645 | also include a class whose context is toplevel. */ | |
1646 | ||
1647 | bool | |
1648 | toplevel_bindings_p (void) | |
1649 | { | |
d0ef83bc | 1650 | cp_binding_level *b = innermost_nonclass_level (); |
836495aa | 1651 | |
1652 | return b->kind == sk_namespace || b->kind == sk_template_parms; | |
1653 | } | |
1654 | ||
1655 | /* True if this is a namespace scope, or if we are defining a class | |
1656 | which is itself at namespace scope, or whose enclosing class is | |
1657 | such a class, etc. */ | |
1658 | ||
1659 | bool | |
1660 | namespace_bindings_p (void) | |
1661 | { | |
d0ef83bc | 1662 | cp_binding_level *b = innermost_nonclass_level (); |
836495aa | 1663 | |
1664 | return b->kind == sk_namespace; | |
1665 | } | |
1666 | ||
fa8ed26b | 1667 | /* True if the innermost non-class scope is a block scope. */ |
1668 | ||
1669 | bool | |
1670 | local_bindings_p (void) | |
1671 | { | |
1672 | cp_binding_level *b = innermost_nonclass_level (); | |
1673 | return b->kind < sk_function_parms || b->kind == sk_omp; | |
1674 | } | |
1675 | ||
836495aa | 1676 | /* True if the current level needs to have a BLOCK made. */ |
1677 | ||
1678 | bool | |
1679 | kept_level_p (void) | |
1680 | { | |
1681 | return (current_binding_level->blocks != NULL_TREE | |
1682 | || current_binding_level->keep | |
653e5405 | 1683 | || current_binding_level->kind == sk_cleanup |
140597f8 | 1684 | || current_binding_level->names != NULL_TREE |
1685 | || current_binding_level->using_directives); | |
836495aa | 1686 | } |
1687 | ||
1688 | /* Returns the kind of the innermost scope. */ | |
1689 | ||
1690 | scope_kind | |
1691 | innermost_scope_kind (void) | |
1692 | { | |
1693 | return current_binding_level->kind; | |
1694 | } | |
1695 | ||
1696 | /* Returns true if this scope was created to store template parameters. */ | |
1697 | ||
1698 | bool | |
1699 | template_parm_scope_p (void) | |
1700 | { | |
1701 | return innermost_scope_kind () == sk_template_parms; | |
1702 | } | |
1703 | ||
1704 | /* If KEEP is true, make a BLOCK node for the next binding level, | |
1705 | unconditionally. Otherwise, use the normal logic to decide whether | |
1706 | or not to create a BLOCK. */ | |
1707 | ||
1708 | void | |
1709 | keep_next_level (bool keep) | |
1710 | { | |
1711 | keep_next_level_flag = keep; | |
1712 | } | |
1713 | ||
1714 | /* Return the list of declarations of the current level. | |
1715 | Note that this list is in reverse order unless/until | |
1716 | you nreverse it; and when you do nreverse it, you must | |
1717 | store the result back using `storedecls' or you will lose. */ | |
1718 | ||
1719 | tree | |
1720 | getdecls (void) | |
1721 | { | |
1722 | return current_binding_level->names; | |
1723 | } | |
1724 | ||
4d7aaf8e | 1725 | /* Return how many function prototypes we are currently nested inside. */ |
1726 | ||
1727 | int | |
1728 | function_parm_depth (void) | |
1729 | { | |
1730 | int level = 0; | |
d0ef83bc | 1731 | cp_binding_level *b; |
4d7aaf8e | 1732 | |
1733 | for (b = current_binding_level; | |
1734 | b->kind == sk_function_parms; | |
1735 | b = b->level_chain) | |
1736 | ++level; | |
1737 | ||
1738 | return level; | |
1739 | } | |
1740 | ||
836495aa | 1741 | /* For debugging. */ |
1742 | static int no_print_functions = 0; | |
1743 | static int no_print_builtins = 0; | |
1744 | ||
71e0dbd3 | 1745 | static void |
d0ef83bc | 1746 | print_binding_level (cp_binding_level* lvl) |
836495aa | 1747 | { |
1748 | tree t; | |
1749 | int i = 0, len; | |
ca0205ee | 1750 | fprintf (stderr, " blocks=%p", (void *) lvl->blocks); |
836495aa | 1751 | if (lvl->more_cleanups_ok) |
1752 | fprintf (stderr, " more-cleanups-ok"); | |
1753 | if (lvl->have_cleanups) | |
1754 | fprintf (stderr, " have-cleanups"); | |
1755 | fprintf (stderr, "\n"); | |
1756 | if (lvl->names) | |
1757 | { | |
1758 | fprintf (stderr, " names:\t"); | |
1759 | /* We can probably fit 3 names to a line? */ | |
1760 | for (t = lvl->names; t; t = TREE_CHAIN (t)) | |
1761 | { | |
1762 | if (no_print_functions && (TREE_CODE (t) == FUNCTION_DECL)) | |
1763 | continue; | |
1764 | if (no_print_builtins | |
1765 | && (TREE_CODE (t) == TYPE_DECL) | |
357f7efa | 1766 | && DECL_IS_BUILTIN (t)) |
836495aa | 1767 | continue; |
1768 | ||
1769 | /* Function decls tend to have longer names. */ | |
1770 | if (TREE_CODE (t) == FUNCTION_DECL) | |
1771 | len = 3; | |
1772 | else | |
1773 | len = 2; | |
1774 | i += len; | |
1775 | if (i > 6) | |
1776 | { | |
1777 | fprintf (stderr, "\n\t"); | |
1778 | i = len; | |
1779 | } | |
1780 | print_node_brief (stderr, "", t, 0); | |
1781 | if (t == error_mark_node) | |
1782 | break; | |
1783 | } | |
1784 | if (i) | |
653e5405 | 1785 | fprintf (stderr, "\n"); |
836495aa | 1786 | } |
598057ec | 1787 | if (VEC_length (cp_class_binding, lvl->class_shadowed)) |
836495aa | 1788 | { |
598057ec | 1789 | size_t i; |
1790 | cp_class_binding *b; | |
836495aa | 1791 | fprintf (stderr, " class-shadowed:"); |
48148244 | 1792 | FOR_EACH_VEC_ELT (cp_class_binding, lvl->class_shadowed, i, b) |
598057ec | 1793 | fprintf (stderr, " %s ", IDENTIFIER_POINTER (b->identifier)); |
836495aa | 1794 | fprintf (stderr, "\n"); |
1795 | } | |
1796 | if (lvl->type_shadowed) | |
1797 | { | |
1798 | fprintf (stderr, " type-shadowed:"); | |
1799 | for (t = lvl->type_shadowed; t; t = TREE_CHAIN (t)) | |
653e5405 | 1800 | { |
836495aa | 1801 | fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t))); |
653e5405 | 1802 | } |
836495aa | 1803 | fprintf (stderr, "\n"); |
1804 | } | |
1805 | } | |
1806 | ||
1807 | void | |
d0ef83bc | 1808 | print_other_binding_stack (cp_binding_level *stack) |
836495aa | 1809 | { |
d0ef83bc | 1810 | cp_binding_level *level; |
836495aa | 1811 | for (level = stack; !global_scope_p (level); level = level->level_chain) |
1812 | { | |
ca0205ee | 1813 | fprintf (stderr, "binding level %p\n", (void *) level); |
836495aa | 1814 | print_binding_level (level); |
1815 | } | |
1816 | } | |
1817 | ||
1818 | void | |
1819 | print_binding_stack (void) | |
1820 | { | |
d0ef83bc | 1821 | cp_binding_level *b; |
ca0205ee | 1822 | fprintf (stderr, "current_binding_level=%p\n" |
1823 | "class_binding_level=%p\n" | |
1824 | "NAMESPACE_LEVEL (global_namespace)=%p\n", | |
836495aa | 1825 | (void *) current_binding_level, (void *) class_binding_level, |
653e5405 | 1826 | (void *) NAMESPACE_LEVEL (global_namespace)); |
836495aa | 1827 | if (class_binding_level) |
1828 | { | |
1829 | for (b = class_binding_level; b; b = b->level_chain) | |
1830 | if (b == current_binding_level) | |
1831 | break; | |
1832 | if (b) | |
1833 | b = class_binding_level; | |
1834 | else | |
1835 | b = current_binding_level; | |
1836 | } | |
1837 | else | |
1838 | b = current_binding_level; | |
1839 | print_other_binding_stack (b); | |
1840 | fprintf (stderr, "global:\n"); | |
1841 | print_binding_level (NAMESPACE_LEVEL (global_namespace)); | |
1842 | } | |
d36ac936 | 1843 | \f |
6198e8f6 | 1844 | /* Return the type associated with ID. */ |
836495aa | 1845 | |
6198e8f6 | 1846 | static tree |
1847 | identifier_type_value_1 (tree id) | |
836495aa | 1848 | { |
836495aa | 1849 | /* There is no type with that name, anywhere. */ |
1850 | if (REAL_IDENTIFIER_TYPE_VALUE (id) == NULL_TREE) | |
6198e8f6 | 1851 | return NULL_TREE; |
836495aa | 1852 | /* This is not the type marker, but the real thing. */ |
1853 | if (REAL_IDENTIFIER_TYPE_VALUE (id) != global_type_node) | |
6198e8f6 | 1854 | return REAL_IDENTIFIER_TYPE_VALUE (id); |
836495aa | 1855 | /* Have to search for it. It must be on the global level, now. |
1856 | Ask lookup_name not to return non-types. */ | |
c4698a21 | 1857 | id = lookup_name_real (id, 2, 1, /*block_p=*/true, 0, 0); |
836495aa | 1858 | if (id) |
6198e8f6 | 1859 | return TREE_TYPE (id); |
1860 | return NULL_TREE; | |
836495aa | 1861 | } |
1862 | ||
6198e8f6 | 1863 | /* Wrapper for identifier_type_value_1. */ |
1864 | ||
1865 | tree | |
1866 | identifier_type_value (tree id) | |
1867 | { | |
1868 | tree ret; | |
1869 | timevar_start (TV_NAME_LOOKUP); | |
1870 | ret = identifier_type_value_1 (id); | |
1871 | timevar_stop (TV_NAME_LOOKUP); | |
1872 | return ret; | |
1873 | } | |
1874 | ||
1875 | ||
836495aa | 1876 | /* Return the IDENTIFIER_GLOBAL_VALUE of T, for use in common code, since |
1877 | the definition of IDENTIFIER_GLOBAL_VALUE is different for C and C++. */ | |
1878 | ||
1879 | tree | |
1880 | identifier_global_value (tree t) | |
1881 | { | |
1882 | return IDENTIFIER_GLOBAL_VALUE (t); | |
1883 | } | |
1884 | ||
1885 | /* Push a definition of struct, union or enum tag named ID. into | |
1886 | binding_level B. DECL is a TYPE_DECL for the type. We assume that | |
1887 | the tag ID is not already defined. */ | |
1888 | ||
1889 | static void | |
d0ef83bc | 1890 | set_identifier_type_value_with_scope (tree id, tree decl, cp_binding_level *b) |
836495aa | 1891 | { |
1892 | tree type; | |
1893 | ||
1894 | if (b->kind != sk_namespace) | |
1895 | { | |
1896 | /* Shadow the marker, not the real thing, so that the marker | |
1897 | gets restored later. */ | |
1898 | tree old_type_value = REAL_IDENTIFIER_TYPE_VALUE (id); | |
1899 | b->type_shadowed | |
1900 | = tree_cons (id, old_type_value, b->type_shadowed); | |
1901 | type = decl ? TREE_TYPE (decl) : NULL_TREE; | |
fa26c7a9 | 1902 | TREE_TYPE (b->type_shadowed) = type; |
836495aa | 1903 | } |
1904 | else | |
1905 | { | |
1906 | cxx_binding *binding = | |
1907 | binding_for_name (NAMESPACE_LEVEL (current_namespace), id); | |
2e3e31d2 | 1908 | gcc_assert (decl); |
1909 | if (binding->value) | |
1910 | supplement_binding (binding, decl); | |
836495aa | 1911 | else |
2e3e31d2 | 1912 | binding->value = decl; |
9031d10b | 1913 | |
836495aa | 1914 | /* Store marker instead of real type. */ |
1915 | type = global_type_node; | |
1916 | } | |
1917 | SET_IDENTIFIER_TYPE_VALUE (id, type); | |
1918 | } | |
1919 | ||
1920 | /* As set_identifier_type_value_with_scope, but using | |
1921 | current_binding_level. */ | |
1922 | ||
1923 | void | |
1924 | set_identifier_type_value (tree id, tree decl) | |
1925 | { | |
1926 | set_identifier_type_value_with_scope (id, decl, current_binding_level); | |
1927 | } | |
1928 | ||
cc9a4194 | 1929 | /* Return the name for the constructor (or destructor) for the |
1930 | specified class TYPE. When given a template, this routine doesn't | |
1931 | lose the specialization. */ | |
1932 | ||
71e0dbd3 | 1933 | static inline tree |
cc9a4194 | 1934 | constructor_name_full (tree type) |
1935 | { | |
1827796b | 1936 | return TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type)); |
cc9a4194 | 1937 | } |
1938 | ||
1939 | /* Return the name for the constructor (or destructor) for the | |
1940 | specified class. When given a template, return the plain | |
1941 | unspecialized name. */ | |
1942 | ||
1943 | tree | |
1944 | constructor_name (tree type) | |
1945 | { | |
1946 | tree name; | |
1947 | name = constructor_name_full (type); | |
1948 | if (IDENTIFIER_TEMPLATE (name)) | |
1949 | name = IDENTIFIER_TEMPLATE (name); | |
1950 | return name; | |
1951 | } | |
1952 | ||
e085f971 | 1953 | /* Returns TRUE if NAME is the name for the constructor for TYPE, |
1954 | which must be a class type. */ | |
cc9a4194 | 1955 | |
1956 | bool | |
1957 | constructor_name_p (tree name, tree type) | |
1958 | { | |
1959 | tree ctor_name; | |
1960 | ||
95397ff9 | 1961 | gcc_assert (MAYBE_CLASS_TYPE_P (type)); |
e085f971 | 1962 | |
cc9a4194 | 1963 | if (!name) |
1964 | return false; | |
9031d10b | 1965 | |
cc9a4194 | 1966 | if (TREE_CODE (name) != IDENTIFIER_NODE) |
1967 | return false; | |
9031d10b | 1968 | |
cc9a4194 | 1969 | ctor_name = constructor_name_full (type); |
1970 | if (name == ctor_name) | |
1971 | return true; | |
1972 | if (IDENTIFIER_TEMPLATE (ctor_name) | |
1973 | && name == IDENTIFIER_TEMPLATE (ctor_name)) | |
1974 | return true; | |
1975 | return false; | |
1976 | } | |
1977 | ||
9a49d46b | 1978 | /* Counter used to create anonymous type names. */ |
1979 | ||
1980 | static GTY(()) int anon_cnt; | |
1981 | ||
1982 | /* Return an IDENTIFIER which can be used as a name for | |
1983 | anonymous structs and unions. */ | |
1984 | ||
1985 | tree | |
1986 | make_anon_name (void) | |
1987 | { | |
1988 | char buf[32]; | |
1989 | ||
1990 | sprintf (buf, ANON_AGGRNAME_FORMAT, anon_cnt++); | |
1991 | return get_identifier (buf); | |
1992 | } | |
1993 | ||
a8b75081 | 1994 | /* This code is practically identical to that for creating |
1995 | anonymous names, but is just used for lambdas instead. This is necessary | |
1996 | because anonymous names are recognized and cannot be passed to template | |
1997 | functions. */ | |
1998 | /* FIXME is this still necessary? */ | |
1999 | ||
2000 | static GTY(()) int lambda_cnt = 0; | |
2001 | ||
2002 | tree | |
2003 | make_lambda_name (void) | |
2004 | { | |
2005 | char buf[32]; | |
2006 | ||
2007 | sprintf (buf, LAMBDANAME_FORMAT, lambda_cnt++); | |
2008 | return get_identifier (buf); | |
2009 | } | |
2010 | ||
9031d10b | 2011 | /* Return (from the stack of) the BINDING, if any, established at SCOPE. */ |
d36ac936 | 2012 | |
2013 | static inline cxx_binding * | |
d0ef83bc | 2014 | find_binding (cp_binding_level *scope, cxx_binding *binding) |
d36ac936 | 2015 | { |
d36ac936 | 2016 | for (; binding != NULL; binding = binding->previous) |
76608a37 | 2017 | if (binding->scope == scope) |
6198e8f6 | 2018 | return binding; |
d36ac936 | 2019 | |
6198e8f6 | 2020 | return (cxx_binding *)0; |
d36ac936 | 2021 | } |
2022 | ||
2023 | /* Return the binding for NAME in SCOPE, if any. Otherwise, return NULL. */ | |
0e1d7e20 | 2024 | |
cc9a4194 | 2025 | static inline cxx_binding * |
d0ef83bc | 2026 | cp_binding_level_find_binding_for_name (cp_binding_level *scope, tree name) |
d36ac936 | 2027 | { |
2028 | cxx_binding *b = IDENTIFIER_NAMESPACE_BINDINGS (name); | |
2029 | if (b) | |
2030 | { | |
2031 | /* Fold-in case where NAME is used only once. */ | |
76608a37 | 2032 | if (scope == b->scope && b->previous == NULL) |
653e5405 | 2033 | return b; |
d36ac936 | 2034 | return find_binding (scope, b); |
2035 | } | |
2036 | return NULL; | |
2037 | } | |
2038 | ||
2039 | /* Always returns a binding for name in scope. If no binding is | |
2040 | found, make a new one. */ | |
2041 | ||
cc9a4194 | 2042 | static cxx_binding * |
d0ef83bc | 2043 | binding_for_name (cp_binding_level *scope, tree name) |
d36ac936 | 2044 | { |
2045 | cxx_binding *result; | |
2046 | ||
d0ef83bc | 2047 | result = cp_binding_level_find_binding_for_name (scope, name); |
d36ac936 | 2048 | if (result) |
2049 | return result; | |
2050 | /* Not found, make a new one. */ | |
2051 | result = cxx_binding_make (NULL, NULL); | |
2052 | result->previous = IDENTIFIER_NAMESPACE_BINDINGS (name); | |
76608a37 | 2053 | result->scope = scope; |
d36ac936 | 2054 | result->is_local = false; |
2055 | result->value_is_inherited = false; | |
2056 | IDENTIFIER_NAMESPACE_BINDINGS (name) = result; | |
2057 | return result; | |
2058 | } | |
d36ac936 | 2059 | |
37d43944 | 2060 | /* Walk through the bindings associated to the name of FUNCTION, |
27282252 | 2061 | and return the first declaration of a function with a |
37d43944 | 2062 | "C" linkage specification, a.k.a 'extern "C"'. |
2063 | This function looks for the binding, regardless of which scope it | |
2064 | has been defined in. It basically looks in all the known scopes. | |
2065 | Note that this function does not lookup for bindings of builtin functions | |
2066 | or for functions declared in system headers. */ | |
27282252 | 2067 | static tree |
2068 | lookup_extern_c_fun_in_all_ns (tree function) | |
37d43944 | 2069 | { |
2070 | tree name; | |
2071 | cxx_binding *iter; | |
2072 | ||
2073 | gcc_assert (function && TREE_CODE (function) == FUNCTION_DECL); | |
2074 | ||
2075 | name = DECL_NAME (function); | |
2076 | gcc_assert (name && TREE_CODE (name) == IDENTIFIER_NODE); | |
2077 | ||
2078 | for (iter = IDENTIFIER_NAMESPACE_BINDINGS (name); | |
2079 | iter; | |
2080 | iter = iter->previous) | |
2081 | { | |
27282252 | 2082 | tree ovl; |
2083 | for (ovl = iter->value; ovl; ovl = OVL_NEXT (ovl)) | |
37d43944 | 2084 | { |
27282252 | 2085 | tree decl = OVL_CURRENT (ovl); |
2086 | if (decl | |
2087 | && TREE_CODE (decl) == FUNCTION_DECL | |
2088 | && DECL_EXTERN_C_P (decl) | |
2089 | && !DECL_ARTIFICIAL (decl)) | |
2090 | { | |
2091 | return decl; | |
2092 | } | |
37d43944 | 2093 | } |
2094 | } | |
2095 | return NULL; | |
2096 | } | |
2097 | ||
27282252 | 2098 | /* Returns a list of C-linkage decls with the name NAME. */ |
2099 | ||
2100 | tree | |
2101 | c_linkage_bindings (tree name) | |
2102 | { | |
2103 | tree decls = NULL_TREE; | |
2104 | cxx_binding *iter; | |
2105 | ||
2106 | for (iter = IDENTIFIER_NAMESPACE_BINDINGS (name); | |
2107 | iter; | |
2108 | iter = iter->previous) | |
2109 | { | |
2110 | tree ovl; | |
2111 | for (ovl = iter->value; ovl; ovl = OVL_NEXT (ovl)) | |
2112 | { | |
2113 | tree decl = OVL_CURRENT (ovl); | |
2114 | if (decl | |
2115 | && DECL_EXTERN_C_P (decl) | |
2116 | && !DECL_ARTIFICIAL (decl)) | |
2117 | { | |
2118 | if (decls == NULL_TREE) | |
2119 | decls = decl; | |
2120 | else | |
2121 | decls = tree_cons (NULL_TREE, decl, decls); | |
2122 | } | |
2123 | } | |
2124 | } | |
2125 | return decls; | |
2126 | } | |
2127 | ||
9a49d46b | 2128 | /* Insert another USING_DECL into the current binding level, returning |
2129 | this declaration. If this is a redeclaration, do nothing, and | |
2130 | return NULL_TREE if this not in namespace scope (in namespace | |
2131 | scope, a using decl might extend any previous bindings). */ | |
2132 | ||
e75bce43 | 2133 | static tree |
6198e8f6 | 2134 | push_using_decl_1 (tree scope, tree name) |
9a49d46b | 2135 | { |
2136 | tree decl; | |
2137 | ||
b4df430b | 2138 | gcc_assert (TREE_CODE (scope) == NAMESPACE_DECL); |
2139 | gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE); | |
1767a056 | 2140 | for (decl = current_binding_level->usings; decl; decl = DECL_CHAIN (decl)) |
094fb0d8 | 2141 | if (USING_DECL_SCOPE (decl) == scope && DECL_NAME (decl) == name) |
9a49d46b | 2142 | break; |
2143 | if (decl) | |
6198e8f6 | 2144 | return namespace_bindings_p () ? decl : NULL_TREE; |
094fb0d8 | 2145 | decl = build_lang_decl (USING_DECL, name, NULL_TREE); |
2146 | USING_DECL_SCOPE (decl) = scope; | |
1767a056 | 2147 | DECL_CHAIN (decl) = current_binding_level->usings; |
9a49d46b | 2148 | current_binding_level->usings = decl; |
6198e8f6 | 2149 | return decl; |
2150 | } | |
2151 | ||
2152 | /* Wrapper for push_using_decl_1. */ | |
2153 | ||
2154 | static tree | |
2155 | push_using_decl (tree scope, tree name) | |
2156 | { | |
2157 | tree ret; | |
2158 | timevar_start (TV_NAME_LOOKUP); | |
2159 | ret = push_using_decl_1 (scope, name); | |
2160 | timevar_stop (TV_NAME_LOOKUP); | |
2161 | return ret; | |
9a49d46b | 2162 | } |
2163 | ||
836495aa | 2164 | /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the |
8c23b4ad | 2165 | caller to set DECL_CONTEXT properly. |
2166 | ||
2167 | Note that this must only be used when X will be the new innermost | |
2168 | binding for its name, as we tack it onto the front of IDENTIFIER_BINDING | |
2169 | without checking to see if the current IDENTIFIER_BINDING comes from a | |
2170 | closer binding level than LEVEL. */ | |
d36ac936 | 2171 | |
6198e8f6 | 2172 | static tree |
d0ef83bc | 2173 | pushdecl_with_scope_1 (tree x, cp_binding_level *level, bool is_friend) |
d36ac936 | 2174 | { |
d0ef83bc | 2175 | cp_binding_level *b; |
836495aa | 2176 | tree function_decl = current_function_decl; |
d36ac936 | 2177 | |
836495aa | 2178 | current_function_decl = NULL_TREE; |
2179 | if (level->kind == sk_class) | |
2180 | { | |
2181 | b = class_binding_level; | |
2182 | class_binding_level = level; | |
2183 | pushdecl_class_level (x); | |
2184 | class_binding_level = b; | |
2185 | } | |
2186 | else | |
2187 | { | |
2188 | b = current_binding_level; | |
2189 | current_binding_level = level; | |
c1d4295f | 2190 | x = pushdecl_maybe_friend (x, is_friend); |
836495aa | 2191 | current_binding_level = b; |
2192 | } | |
2193 | current_function_decl = function_decl; | |
6198e8f6 | 2194 | return x; |
836495aa | 2195 | } |
6198e8f6 | 2196 | |
2197 | /* Wrapper for pushdecl_with_scope_1. */ | |
2198 | ||
2199 | tree | |
d0ef83bc | 2200 | pushdecl_with_scope (tree x, cp_binding_level *level, bool is_friend) |
6198e8f6 | 2201 | { |
2202 | tree ret; | |
2203 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); | |
2204 | ret = pushdecl_with_scope_1 (x, level, is_friend); | |
2205 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); | |
2206 | return ret; | |
2207 | } | |
2208 | ||
836495aa | 2209 | |
9a49d46b | 2210 | /* DECL is a FUNCTION_DECL for a non-member function, which may have |
2211 | other definitions already in place. We get around this by making | |
2212 | the value of the identifier point to a list of all the things that | |
2213 | want to be referenced by that name. It is then up to the users of | |
2214 | that name to decide what to do with that list. | |
2215 | ||
2216 | DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its | |
2217 | DECL_TEMPLATE_RESULT. It is dealt with the same way. | |
2218 | ||
2219 | FLAGS is a bitwise-or of the following values: | |
2220 | PUSH_LOCAL: Bind DECL in the current scope, rather than at | |
653e5405 | 2221 | namespace scope. |
9a49d46b | 2222 | PUSH_USING: DECL is being pushed as the result of a using |
653e5405 | 2223 | declaration. |
9a49d46b | 2224 | |
c1d4295f | 2225 | IS_FRIEND is true if this is a friend declaration. |
2226 | ||
9a49d46b | 2227 | The value returned may be a previous declaration if we guessed wrong |
2228 | about what language DECL should belong to (C or C++). Otherwise, | |
2229 | it's always DECL (and never something that's not a _DECL). */ | |
2230 | ||
2231 | static tree | |
6198e8f6 | 2232 | push_overloaded_decl_1 (tree decl, int flags, bool is_friend) |
9a49d46b | 2233 | { |
2234 | tree name = DECL_NAME (decl); | |
2235 | tree old; | |
2236 | tree new_binding; | |
2237 | int doing_global = (namespace_bindings_p () || !(flags & PUSH_LOCAL)); | |
2238 | ||
9a49d46b | 2239 | if (doing_global) |
2240 | old = namespace_binding (name, DECL_CONTEXT (decl)); | |
2241 | else | |
e1316b34 | 2242 | old = lookup_name_innermost_nonclass_level (name); |
9a49d46b | 2243 | |
2244 | if (old) | |
2245 | { | |
2246 | if (TREE_CODE (old) == TYPE_DECL && DECL_ARTIFICIAL (old)) | |
2247 | { | |
2248 | tree t = TREE_TYPE (old); | |
95397ff9 | 2249 | if (MAYBE_CLASS_TYPE_P (t) && warn_shadow |
9a49d46b | 2250 | && (! DECL_IN_SYSTEM_HEADER (decl) |
2251 | || ! DECL_IN_SYSTEM_HEADER (old))) | |
6cbbbc89 | 2252 | warning (OPT_Wshadow, "%q#D hides constructor for %q#T", decl, t); |
9a49d46b | 2253 | old = NULL_TREE; |
2254 | } | |
2255 | else if (is_overloaded_fn (old)) | |
653e5405 | 2256 | { |
2257 | tree tmp; | |
9a49d46b | 2258 | |
2259 | for (tmp = old; tmp; tmp = OVL_NEXT (tmp)) | |
2260 | { | |
2261 | tree fn = OVL_CURRENT (tmp); | |
d9db88e1 | 2262 | tree dup; |
9a49d46b | 2263 | |
2264 | if (TREE_CODE (tmp) == OVERLOAD && OVL_USED (tmp) | |
2265 | && !(flags & PUSH_USING) | |
2266 | && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)), | |
9a931ab2 | 2267 | TYPE_ARG_TYPES (TREE_TYPE (decl))) |
2268 | && ! decls_match (fn, decl)) | |
a2c5b975 | 2269 | error ("%q#D conflicts with previous using declaration %q#D", |
653e5405 | 2270 | decl, fn); |
9a49d46b | 2271 | |
d9db88e1 | 2272 | dup = duplicate_decls (decl, fn, is_friend); |
2273 | /* If DECL was a redeclaration of FN -- even an invalid | |
2274 | one -- pass that information along to our caller. */ | |
2275 | if (dup == fn || dup == error_mark_node) | |
6198e8f6 | 2276 | return dup; |
9a49d46b | 2277 | } |
f213de01 | 2278 | |
2279 | /* We don't overload implicit built-ins. duplicate_decls() | |
2280 | may fail to merge the decls if the new decl is e.g. a | |
2281 | template function. */ | |
2282 | if (TREE_CODE (old) == FUNCTION_DECL | |
c1d4295f | 2283 | && DECL_ANTICIPATED (old) |
2284 | && !DECL_HIDDEN_FRIEND_P (old)) | |
f213de01 | 2285 | old = NULL; |
9a49d46b | 2286 | } |
2287 | else if (old == error_mark_node) | |
2288 | /* Ignore the undefined symbol marker. */ | |
2289 | old = NULL_TREE; | |
2290 | else | |
2291 | { | |
3cf8b391 | 2292 | error ("previous non-function declaration %q+#D", old); |
a2c5b975 | 2293 | error ("conflicts with function declaration %q#D", decl); |
6198e8f6 | 2294 | return decl; |
9a49d46b | 2295 | } |
2296 | } | |
2297 | ||
c2f32ff6 | 2298 | if (old || TREE_CODE (decl) == TEMPLATE_DECL |
2299 | /* If it's a using declaration, we always need to build an OVERLOAD, | |
2300 | because it's the only way to remember that the declaration comes | |
2301 | from 'using', and have the lookup behave correctly. */ | |
2302 | || (flags & PUSH_USING)) | |
9a49d46b | 2303 | { |
2304 | if (old && TREE_CODE (old) != OVERLOAD) | |
2305 | new_binding = ovl_cons (decl, ovl_cons (old, NULL_TREE)); | |
2306 | else | |
2307 | new_binding = ovl_cons (decl, old); | |
2308 | if (flags & PUSH_USING) | |
2309 | OVL_USED (new_binding) = 1; | |
2310 | } | |
2311 | else | |
f9a802b1 | 2312 | /* NAME is not ambiguous. */ |
9a49d46b | 2313 | new_binding = decl; |
2314 | ||
2315 | if (doing_global) | |
2316 | set_namespace_binding (name, current_namespace, new_binding); | |
2317 | else | |
2318 | { | |
2319 | /* We only create an OVERLOAD if there was a previous binding at | |
2320 | this level, or if decl is a template. In the former case, we | |
2321 | need to remove the old binding and replace it with the new | |
2322 | binding. We must also run through the NAMES on the binding | |
2323 | level where the name was bound to update the chain. */ | |
2324 | ||
2325 | if (TREE_CODE (new_binding) == OVERLOAD && old) | |
2326 | { | |
2327 | tree *d; | |
2328 | ||
2329 | for (d = &IDENTIFIER_BINDING (name)->scope->names; | |
2330 | *d; | |
d7b0d4e7 | 2331 | d = &TREE_CHAIN (*d)) |
9a49d46b | 2332 | if (*d == old |
2333 | || (TREE_CODE (*d) == TREE_LIST | |
2334 | && TREE_VALUE (*d) == old)) | |
2335 | { | |
2336 | if (TREE_CODE (*d) == TREE_LIST) | |
2337 | /* Just replace the old binding with the new. */ | |
2338 | TREE_VALUE (*d) = new_binding; | |
2339 | else | |
2340 | /* Build a TREE_LIST to wrap the OVERLOAD. */ | |
2341 | *d = tree_cons (NULL_TREE, new_binding, | |
d7b0d4e7 | 2342 | TREE_CHAIN (*d)); |
9a49d46b | 2343 | |
2344 | /* And update the cxx_binding node. */ | |
2345 | IDENTIFIER_BINDING (name)->value = new_binding; | |
6198e8f6 | 2346 | return decl; |
9a49d46b | 2347 | } |
2348 | ||
2349 | /* We should always find a previous binding in this case. */ | |
2e3e31d2 | 2350 | gcc_unreachable (); |
9a49d46b | 2351 | } |
2352 | ||
2353 | /* Install the new binding. */ | |
2354 | push_local_binding (name, new_binding, flags); | |
2355 | } | |
2356 | ||
6198e8f6 | 2357 | return decl; |
2358 | } | |
2359 | ||
2360 | /* Wrapper for push_overloaded_decl_1. */ | |
2361 | ||
2362 | static tree | |
2363 | push_overloaded_decl (tree decl, int flags, bool is_friend) | |
2364 | { | |
2365 | tree ret; | |
2366 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); | |
2367 | ret = push_overloaded_decl_1 (decl, flags, is_friend); | |
2368 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); | |
2369 | return ret; | |
9a49d46b | 2370 | } |
2371 | ||
cc9a4194 | 2372 | /* Check a non-member using-declaration. Return the name and scope |
2373 | being used, and the USING_DECL, or NULL_TREE on failure. */ | |
2374 | ||
2375 | static tree | |
2c47ecdb | 2376 | validate_nonmember_using_decl (tree decl, tree scope, tree name) |
cc9a4194 | 2377 | { |
2b217005 | 2378 | /* [namespace.udecl] |
2379 | A using-declaration for a class member shall be a | |
2380 | member-declaration. */ | |
2381 | if (TYPE_P (scope)) | |
2382 | { | |
a2c5b975 | 2383 | error ("%qT is not a namespace", scope); |
2b217005 | 2384 | return NULL_TREE; |
2385 | } | |
2386 | else if (scope == error_mark_node) | |
2387 | return NULL_TREE; | |
2388 | ||
cc9a4194 | 2389 | if (TREE_CODE (decl) == TEMPLATE_ID_EXPR) |
2390 | { | |
cc9a4194 | 2391 | /* 7.3.3/5 |
2392 | A using-declaration shall not name a template-id. */ | |
a2c5b975 | 2393 | error ("a using-declaration cannot specify a template-id. " |
653e5405 | 2394 | "Try %<using %D%>", name); |
cc9a4194 | 2395 | return NULL_TREE; |
2396 | } | |
2397 | ||
2398 | if (TREE_CODE (decl) == NAMESPACE_DECL) | |
2399 | { | |
a2c5b975 | 2400 | error ("namespace %qD not allowed in using-declaration", decl); |
cc9a4194 | 2401 | return NULL_TREE; |
2402 | } | |
2403 | ||
2404 | if (TREE_CODE (decl) == SCOPE_REF) | |
2405 | { | |
2406 | /* It's a nested name with template parameter dependent scope. | |
2407 | This can only be using-declaration for class member. */ | |
a2c5b975 | 2408 | error ("%qT is not a namespace", TREE_OPERAND (decl, 0)); |
cc9a4194 | 2409 | return NULL_TREE; |
2410 | } | |
2411 | ||
2412 | if (is_overloaded_fn (decl)) | |
2413 | decl = get_first_fn (decl); | |
2414 | ||
b4df430b | 2415 | gcc_assert (DECL_P (decl)); |
cc9a4194 | 2416 | |
cc9a4194 | 2417 | /* Make a USING_DECL. */ |
2c47ecdb | 2418 | return push_using_decl (scope, name); |
cc9a4194 | 2419 | } |
2420 | ||
2421 | /* Process local and global using-declarations. */ | |
2422 | ||
2423 | static void | |
2424 | do_nonmember_using_decl (tree scope, tree name, tree oldval, tree oldtype, | |
653e5405 | 2425 | tree *newval, tree *newtype) |
cc9a4194 | 2426 | { |
7d6057da | 2427 | struct scope_binding decls = EMPTY_SCOPE_BINDING; |
cc9a4194 | 2428 | |
2429 | *newval = *newtype = NULL_TREE; | |
cc9a4194 | 2430 | if (!qualified_lookup_using_namespace (name, scope, &decls, 0)) |
2431 | /* Lookup error */ | |
2432 | return; | |
2433 | ||
2434 | if (!decls.value && !decls.type) | |
2435 | { | |
a2c5b975 | 2436 | error ("%qD not declared", name); |
cc9a4194 | 2437 | return; |
2438 | } | |
2439 | ||
69525376 | 2440 | /* Shift the old and new bindings around so we're comparing class and |
2441 | enumeration names to each other. */ | |
2442 | if (oldval && DECL_IMPLICIT_TYPEDEF_P (oldval)) | |
2443 | { | |
2444 | oldtype = oldval; | |
2445 | oldval = NULL_TREE; | |
2446 | } | |
2447 | ||
2448 | if (decls.value && DECL_IMPLICIT_TYPEDEF_P (decls.value)) | |
2449 | { | |
2450 | decls.type = decls.value; | |
2451 | decls.value = NULL_TREE; | |
2452 | } | |
2453 | ||
399ddb89 | 2454 | /* It is impossible to overload a built-in function; any explicit |
2455 | declaration eliminates the built-in declaration. So, if OLDVAL | |
2456 | is a built-in, then we can just pretend it isn't there. */ | |
9031d10b | 2457 | if (oldval |
399ddb89 | 2458 | && TREE_CODE (oldval) == FUNCTION_DECL |
c1d4295f | 2459 | && DECL_ANTICIPATED (oldval) |
2460 | && !DECL_HIDDEN_FRIEND_P (oldval)) | |
399ddb89 | 2461 | oldval = NULL_TREE; |
2462 | ||
69525376 | 2463 | if (decls.value) |
cc9a4194 | 2464 | { |
69525376 | 2465 | /* Check for using functions. */ |
2466 | if (is_overloaded_fn (decls.value)) | |
cc9a4194 | 2467 | { |
69525376 | 2468 | tree tmp, tmp1; |
cc9a4194 | 2469 | |
69525376 | 2470 | if (oldval && !is_overloaded_fn (oldval)) |
2471 | { | |
2472 | error ("%qD is already declared in this scope", name); | |
2473 | oldval = NULL_TREE; | |
2474 | } | |
cc9a4194 | 2475 | |
69525376 | 2476 | *newval = oldval; |
2477 | for (tmp = decls.value; tmp; tmp = OVL_NEXT (tmp)) | |
cc9a4194 | 2478 | { |
69525376 | 2479 | tree new_fn = OVL_CURRENT (tmp); |
2480 | ||
2481 | /* [namespace.udecl] | |
2482 | ||
2483 | If a function declaration in namespace scope or block | |
2484 | scope has the same name and the same parameter types as a | |
2485 | function introduced by a using declaration the program is | |
2486 | ill-formed. */ | |
2487 | for (tmp1 = oldval; tmp1; tmp1 = OVL_NEXT (tmp1)) | |
cc9a4194 | 2488 | { |
69525376 | 2489 | tree old_fn = OVL_CURRENT (tmp1); |
d612858d | 2490 | |
69525376 | 2491 | if (new_fn == old_fn) |
2492 | /* The function already exists in the current namespace. */ | |
d612858d | 2493 | break; |
69525376 | 2494 | else if (OVL_USED (tmp1)) |
2495 | continue; /* this is a using decl */ | |
2496 | else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (new_fn)), | |
2497 | TYPE_ARG_TYPES (TREE_TYPE (old_fn)))) | |
653e5405 | 2498 | { |
69525376 | 2499 | gcc_assert (!DECL_ANTICIPATED (old_fn) |
2500 | || DECL_HIDDEN_FRIEND_P (old_fn)); | |
2501 | ||
2502 | /* There was already a non-using declaration in | |
2503 | this scope with the same parameter types. If both | |
2504 | are the same extern "C" functions, that's ok. */ | |
2505 | if (decls_match (new_fn, old_fn)) | |
2506 | break; | |
2507 | else | |
2508 | { | |
2509 | error ("%qD is already declared in this scope", name); | |
2510 | break; | |
2511 | } | |
cc9a4194 | 2512 | } |
cc9a4194 | 2513 | } |
cc9a4194 | 2514 | |
69525376 | 2515 | /* If we broke out of the loop, there's no reason to add |
2516 | this function to the using declarations for this | |
2517 | scope. */ | |
2518 | if (tmp1) | |
2519 | continue; | |
2520 | ||
2521 | /* If we are adding to an existing OVERLOAD, then we no | |
2522 | longer know the type of the set of functions. */ | |
2523 | if (*newval && TREE_CODE (*newval) == OVERLOAD) | |
2524 | TREE_TYPE (*newval) = unknown_type_node; | |
2525 | /* Add this new function to the set. */ | |
2526 | *newval = build_overload (OVL_CURRENT (tmp), *newval); | |
2527 | /* If there is only one function, then we use its type. (A | |
2528 | using-declaration naming a single function can be used in | |
2529 | contexts where overload resolution cannot be | |
2530 | performed.) */ | |
2531 | if (TREE_CODE (*newval) != OVERLOAD) | |
2532 | { | |
2533 | *newval = ovl_cons (*newval, NULL_TREE); | |
2534 | TREE_TYPE (*newval) = TREE_TYPE (OVL_CURRENT (tmp)); | |
2535 | } | |
2536 | OVL_USED (*newval) = 1; | |
d45cef9b | 2537 | } |
69525376 | 2538 | } |
2539 | else | |
2540 | { | |
2541 | *newval = decls.value; | |
2542 | if (oldval && !decls_match (*newval, oldval)) | |
2543 | error ("%qD is already declared in this scope", name); | |
cc9a4194 | 2544 | } |
2545 | } | |
9031d10b | 2546 | else |
69525376 | 2547 | *newval = oldval; |
cc9a4194 | 2548 | |
f8be65bb | 2549 | if (decls.type && TREE_CODE (decls.type) == TREE_LIST) |
cc9a4194 | 2550 | { |
f8be65bb | 2551 | error ("reference to %qD is ambiguous", name); |
2552 | print_candidates (decls.type); | |
2553 | } | |
2554 | else | |
2555 | { | |
2556 | *newtype = decls.type; | |
69525376 | 2557 | if (oldtype && *newtype && !decls_match (oldtype, *newtype)) |
2558 | error ("%qD is already declared in this scope", name); | |
cc9a4194 | 2559 | } |
69525376 | 2560 | |
2561 | /* If *newval is empty, shift any class or enumeration name down. */ | |
2562 | if (!*newval) | |
2563 | { | |
2564 | *newval = *newtype; | |
2565 | *newtype = NULL_TREE; | |
2566 | } | |
cc9a4194 | 2567 | } |
2568 | ||
2569 | /* Process a using-declaration at function scope. */ | |
2570 | ||
2571 | void | |
2c47ecdb | 2572 | do_local_using_decl (tree decl, tree scope, tree name) |
cc9a4194 | 2573 | { |
cc9a4194 | 2574 | tree oldval, oldtype, newval, newtype; |
2b49746a | 2575 | tree orig_decl = decl; |
cc9a4194 | 2576 | |
2c47ecdb | 2577 | decl = validate_nonmember_using_decl (decl, scope, name); |
cc9a4194 | 2578 | if (decl == NULL_TREE) |
2579 | return; | |
2580 | ||
cacfdc02 | 2581 | if (building_stmt_list_p () |
cc9a4194 | 2582 | && at_function_scope_p ()) |
7dd37241 | 2583 | add_decl_expr (decl); |
cc9a4194 | 2584 | |
e1316b34 | 2585 | oldval = lookup_name_innermost_nonclass_level (name); |
cc9a4194 | 2586 | oldtype = lookup_type_current_level (name); |
2587 | ||
2588 | do_nonmember_using_decl (scope, name, oldval, oldtype, &newval, &newtype); | |
2589 | ||
2590 | if (newval) | |
2591 | { | |
2592 | if (is_overloaded_fn (newval)) | |
2593 | { | |
2594 | tree fn, term; | |
2595 | ||
2596 | /* We only need to push declarations for those functions | |
2597 | that were not already bound in the current level. | |
2598 | The old value might be NULL_TREE, it might be a single | |
2599 | function, or an OVERLOAD. */ | |
2600 | if (oldval && TREE_CODE (oldval) == OVERLOAD) | |
2601 | term = OVL_FUNCTION (oldval); | |
2602 | else | |
2603 | term = oldval; | |
9031d10b | 2604 | for (fn = newval; fn && OVL_CURRENT (fn) != term; |
cc9a4194 | 2605 | fn = OVL_NEXT (fn)) |
9031d10b | 2606 | push_overloaded_decl (OVL_CURRENT (fn), |
c1d4295f | 2607 | PUSH_LOCAL | PUSH_USING, |
2608 | false); | |
cc9a4194 | 2609 | } |
2610 | else | |
2611 | push_local_binding (name, newval, PUSH_USING); | |
2612 | } | |
2613 | if (newtype) | |
7ef14399 | 2614 | { |
2615 | push_local_binding (name, newtype, PUSH_USING); | |
2616 | set_identifier_type_value (name, newtype); | |
2617 | } | |
2b49746a | 2618 | |
2619 | /* Emit debug info. */ | |
2620 | if (!processing_template_decl) | |
2621 | cp_emit_debug_info_for_using (orig_decl, current_scope()); | |
cc9a4194 | 2622 | } |
2623 | ||
cc9a4194 | 2624 | /* Returns true if ROOT (a namespace, class, or function) encloses |
2625 | CHILD. CHILD may be either a class type or a namespace. */ | |
2626 | ||
2627 | bool | |
2628 | is_ancestor (tree root, tree child) | |
2629 | { | |
b4df430b | 2630 | gcc_assert ((TREE_CODE (root) == NAMESPACE_DECL |
2631 | || TREE_CODE (root) == FUNCTION_DECL | |
2632 | || CLASS_TYPE_P (root))); | |
2633 | gcc_assert ((TREE_CODE (child) == NAMESPACE_DECL | |
2634 | || CLASS_TYPE_P (child))); | |
9031d10b | 2635 | |
cc9a4194 | 2636 | /* The global namespace encloses everything. */ |
2637 | if (root == global_namespace) | |
2638 | return true; | |
2639 | ||
2640 | while (true) | |
2641 | { | |
2642 | /* If we've run out of scopes, stop. */ | |
2643 | if (!child) | |
2644 | return false; | |
2645 | /* If we've reached the ROOT, it encloses CHILD. */ | |
2646 | if (root == child) | |
2647 | return true; | |
2648 | /* Go out one level. */ | |
2649 | if (TYPE_P (child)) | |
2650 | child = TYPE_NAME (child); | |
2651 | child = DECL_CONTEXT (child); | |
2652 | } | |
2653 | } | |
2654 | ||
7f602bca | 2655 | /* Enter the class or namespace scope indicated by T suitable for name |
2656 | lookup. T can be arbitrary scope, not necessary nested inside the | |
2657 | current scope. Returns a non-null scope to pop iff pop_scope | |
2658 | should be called later to exit this scope. */ | |
cc9a4194 | 2659 | |
7f602bca | 2660 | tree |
cc9a4194 | 2661 | push_scope (tree t) |
2662 | { | |
2663 | if (TREE_CODE (t) == NAMESPACE_DECL) | |
2664 | push_decl_namespace (t); | |
1cbda81f | 2665 | else if (CLASS_TYPE_P (t)) |
2666 | { | |
2667 | if (!at_class_scope_p () | |
2668 | || !same_type_p (current_class_type, t)) | |
2669 | push_nested_class (t); | |
2670 | else | |
2671 | /* T is the same as the current scope. There is therefore no | |
2672 | need to re-enter the scope. Since we are not actually | |
2673 | pushing a new scope, our caller should not call | |
2674 | pop_scope. */ | |
7f602bca | 2675 | t = NULL_TREE; |
1cbda81f | 2676 | } |
2677 | ||
7f602bca | 2678 | return t; |
cc9a4194 | 2679 | } |
2680 | ||
2681 | /* Leave scope pushed by push_scope. */ | |
2682 | ||
2683 | void | |
2684 | pop_scope (tree t) | |
2685 | { | |
0f16033e | 2686 | if (t == NULL_TREE) |
2687 | return; | |
cc9a4194 | 2688 | if (TREE_CODE (t) == NAMESPACE_DECL) |
2689 | pop_decl_namespace (); | |
2690 | else if CLASS_TYPE_P (t) | |
2691 | pop_nested_class (); | |
2692 | } | |
352baa70 | 2693 | |
2694 | /* Subroutine of push_inner_scope. */ | |
2695 | ||
2696 | static void | |
2697 | push_inner_scope_r (tree outer, tree inner) | |
2698 | { | |
2699 | tree prev; | |
2700 | ||
2701 | if (outer == inner | |
2702 | || (TREE_CODE (inner) != NAMESPACE_DECL && !CLASS_TYPE_P (inner))) | |
2703 | return; | |
2704 | ||
2705 | prev = CP_DECL_CONTEXT (TREE_CODE (inner) == NAMESPACE_DECL ? inner : TYPE_NAME (inner)); | |
2706 | if (outer != prev) | |
2707 | push_inner_scope_r (outer, prev); | |
2708 | if (TREE_CODE (inner) == NAMESPACE_DECL) | |
2709 | { | |
d0ef83bc | 2710 | cp_binding_level *save_template_parm = 0; |
352baa70 | 2711 | /* Temporary take out template parameter scopes. They are saved |
2712 | in reversed order in save_template_parm. */ | |
2713 | while (current_binding_level->kind == sk_template_parms) | |
2714 | { | |
d0ef83bc | 2715 | cp_binding_level *b = current_binding_level; |
352baa70 | 2716 | current_binding_level = b->level_chain; |
2717 | b->level_chain = save_template_parm; | |
2718 | save_template_parm = b; | |
2719 | } | |
2720 | ||
2721 | resume_scope (NAMESPACE_LEVEL (inner)); | |
2722 | current_namespace = inner; | |
2723 | ||
2724 | /* Restore template parameter scopes. */ | |
2725 | while (save_template_parm) | |
2726 | { | |
d0ef83bc | 2727 | cp_binding_level *b = save_template_parm; |
352baa70 | 2728 | save_template_parm = b->level_chain; |
2729 | b->level_chain = current_binding_level; | |
2730 | current_binding_level = b; | |
2731 | } | |
2732 | } | |
2733 | else | |
2734 | pushclass (inner); | |
2735 | } | |
2736 | ||
2737 | /* Enter the scope INNER from current scope. INNER must be a scope | |
2738 | nested inside current scope. This works with both name lookup and | |
2739 | pushing name into scope. In case a template parameter scope is present, | |
2740 | namespace is pushed under the template parameter scope according to | |
2741 | name lookup rule in 14.6.1/6. | |
9031d10b | 2742 | |
352baa70 | 2743 | Return the former current scope suitable for pop_inner_scope. */ |
2744 | ||
2745 | tree | |
2746 | push_inner_scope (tree inner) | |
2747 | { | |
2748 | tree outer = current_scope (); | |
2749 | if (!outer) | |
2750 | outer = current_namespace; | |
2751 | ||
2752 | push_inner_scope_r (outer, inner); | |
2753 | return outer; | |
2754 | } | |
2755 | ||
2756 | /* Exit the current scope INNER back to scope OUTER. */ | |
2757 | ||
2758 | void | |
2759 | pop_inner_scope (tree outer, tree inner) | |
2760 | { | |
2761 | if (outer == inner | |
2762 | || (TREE_CODE (inner) != NAMESPACE_DECL && !CLASS_TYPE_P (inner))) | |
2763 | return; | |
2764 | ||
2765 | while (outer != inner) | |
2766 | { | |
2767 | if (TREE_CODE (inner) == NAMESPACE_DECL) | |
2768 | { | |
d0ef83bc | 2769 | cp_binding_level *save_template_parm = 0; |
352baa70 | 2770 | /* Temporary take out template parameter scopes. They are saved |
2771 | in reversed order in save_template_parm. */ | |
2772 | while (current_binding_level->kind == sk_template_parms) | |
2773 | { | |
d0ef83bc | 2774 | cp_binding_level *b = current_binding_level; |
352baa70 | 2775 | current_binding_level = b->level_chain; |
2776 | b->level_chain = save_template_parm; | |
2777 | save_template_parm = b; | |
2778 | } | |
2779 | ||
2780 | pop_namespace (); | |
2781 | ||
2782 | /* Restore template parameter scopes. */ | |
2783 | while (save_template_parm) | |
2784 | { | |
d0ef83bc | 2785 | cp_binding_level *b = save_template_parm; |
352baa70 | 2786 | save_template_parm = b->level_chain; |
2787 | b->level_chain = current_binding_level; | |
2788 | current_binding_level = b; | |
2789 | } | |
2790 | } | |
2791 | else | |
2792 | popclass (); | |
2793 | ||
2794 | inner = CP_DECL_CONTEXT (TREE_CODE (inner) == NAMESPACE_DECL ? inner : TYPE_NAME (inner)); | |
2795 | } | |
2796 | } | |
836495aa | 2797 | \f |
2798 | /* Do a pushlevel for class declarations. */ | |
2799 | ||
2800 | void | |
2801 | pushlevel_class (void) | |
2802 | { | |
836495aa | 2803 | class_binding_level = begin_scope (sk_class, current_class_type); |
2804 | } | |
2805 | ||
2806 | /* ...and a poplevel for class declarations. */ | |
2807 | ||
2808 | void | |
2809 | poplevel_class (void) | |
2810 | { | |
d0ef83bc | 2811 | cp_binding_level *level = class_binding_level; |
598057ec | 2812 | cp_class_binding *cb; |
2813 | size_t i; | |
836495aa | 2814 | tree shadowed; |
2815 | ||
6198e8f6 | 2816 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); |
b4df430b | 2817 | gcc_assert (level != 0); |
836495aa | 2818 | |
fa26c7a9 | 2819 | /* If we're leaving a toplevel class, cache its binding level. */ |
2820 | if (current_class_depth == 1) | |
598057ec | 2821 | previous_class_level = level; |
836495aa | 2822 | for (shadowed = level->type_shadowed; |
2823 | shadowed; | |
2824 | shadowed = TREE_CHAIN (shadowed)) | |
2825 | SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed), TREE_VALUE (shadowed)); | |
2826 | ||
2827 | /* Remove the bindings for all of the class-level declarations. */ | |
d09ae6d5 | 2828 | if (level->class_shadowed) |
2829 | { | |
48148244 | 2830 | FOR_EACH_VEC_ELT (cp_class_binding, level->class_shadowed, i, cb) |
939a5cb9 | 2831 | { |
2832 | IDENTIFIER_BINDING (cb->identifier) = cb->base->previous; | |
2833 | cxx_binding_free (cb->base); | |
2834 | } | |
d09ae6d5 | 2835 | ggc_free (level->class_shadowed); |
2836 | level->class_shadowed = NULL; | |
2837 | } | |
836495aa | 2838 | |
2839 | /* Now, pop out of the binding level which we created up in the | |
2840 | `pushlevel_class' routine. */ | |
96e0afde | 2841 | gcc_assert (current_binding_level == level); |
836495aa | 2842 | leave_scope (); |
6198e8f6 | 2843 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); |
836495aa | 2844 | } |
2845 | ||
d09ae6d5 | 2846 | /* Set INHERITED_VALUE_BINDING_P on BINDING to true or false, as |
2847 | appropriate. DECL is the value to which a name has just been | |
37b8cd7c | 2848 | bound. CLASS_TYPE is the class in which the lookup occurred. */ |
836495aa | 2849 | |
d09ae6d5 | 2850 | static void |
37b8cd7c | 2851 | set_inherited_value_binding_p (cxx_binding *binding, tree decl, |
2852 | tree class_type) | |
836495aa | 2853 | { |
836495aa | 2854 | if (binding->value == decl && TREE_CODE (decl) != TREE_LIST) |
2855 | { | |
d09ae6d5 | 2856 | tree context; |
2857 | ||
836495aa | 2858 | if (TREE_CODE (decl) == OVERLOAD) |
47744737 | 2859 | context = ovl_scope (decl); |
836495aa | 2860 | else |
2861 | { | |
b4df430b | 2862 | gcc_assert (DECL_P (decl)); |
836495aa | 2863 | context = context_for_name_lookup (decl); |
2864 | } | |
2865 | ||
37b8cd7c | 2866 | if (is_properly_derived_from (class_type, context)) |
836495aa | 2867 | INHERITED_VALUE_BINDING_P (binding) = 1; |
2868 | else | |
2869 | INHERITED_VALUE_BINDING_P (binding) = 0; | |
2870 | } | |
2871 | else if (binding->value == decl) | |
d09ae6d5 | 2872 | /* We only encounter a TREE_LIST when there is an ambiguity in the |
2873 | base classes. Such an ambiguity can be overridden by a | |
2874 | definition in this class. */ | |
836495aa | 2875 | INHERITED_VALUE_BINDING_P (binding) = 1; |
d09ae6d5 | 2876 | else |
2877 | INHERITED_VALUE_BINDING_P (binding) = 0; | |
836495aa | 2878 | } |
2879 | ||
836495aa | 2880 | /* Make the declaration of X appear in CLASS scope. */ |
2881 | ||
2882 | bool | |
2883 | pushdecl_class_level (tree x) | |
2884 | { | |
2885 | tree name; | |
2886 | bool is_valid = true; | |
6198e8f6 | 2887 | bool subtime; |
836495aa | 2888 | |
a8b75081 | 2889 | /* Do nothing if we're adding to an outer lambda closure type, |
2890 | outer_binding will add it later if it's needed. */ | |
2891 | if (current_class_type != class_binding_level->this_entity) | |
2892 | return true; | |
2893 | ||
6198e8f6 | 2894 | subtime = timevar_cond_start (TV_NAME_LOOKUP); |
836495aa | 2895 | /* Get the name of X. */ |
2896 | if (TREE_CODE (x) == OVERLOAD) | |
2897 | name = DECL_NAME (get_first_fn (x)); | |
2898 | else | |
2899 | name = DECL_NAME (x); | |
2900 | ||
2901 | if (name) | |
2902 | { | |
2903 | is_valid = push_class_level_binding (name, x); | |
2904 | if (TREE_CODE (x) == TYPE_DECL) | |
2905 | set_identifier_type_value (name, x); | |
2906 | } | |
2907 | else if (ANON_AGGR_TYPE_P (TREE_TYPE (x))) | |
2908 | { | |
2909 | /* If X is an anonymous aggregate, all of its members are | |
2910 | treated as if they were members of the class containing the | |
2911 | aggregate, for naming purposes. */ | |
2912 | tree f; | |
2913 | ||
1767a056 | 2914 | for (f = TYPE_FIELDS (TREE_TYPE (x)); f; f = DECL_CHAIN (f)) |
836495aa | 2915 | { |
2916 | location_t save_location = input_location; | |
2917 | input_location = DECL_SOURCE_LOCATION (f); | |
2918 | if (!pushdecl_class_level (f)) | |
2919 | is_valid = false; | |
2920 | input_location = save_location; | |
2921 | } | |
2922 | } | |
6198e8f6 | 2923 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); |
2924 | return is_valid; | |
836495aa | 2925 | } |
2926 | ||
d09ae6d5 | 2927 | /* Return the BINDING (if any) for NAME in SCOPE, which is a class |
2928 | scope. If the value returned is non-NULL, and the PREVIOUS field | |
2929 | is not set, callers must set the PREVIOUS field explicitly. */ | |
2930 | ||
2931 | static cxx_binding * | |
d0ef83bc | 2932 | get_class_binding (tree name, cp_binding_level *scope) |
d09ae6d5 | 2933 | { |
2934 | tree class_type; | |
2935 | tree type_binding; | |
2936 | tree value_binding; | |
2937 | cxx_binding *binding; | |
2938 | ||
2939 | class_type = scope->this_entity; | |
2940 | ||
2941 | /* Get the type binding. */ | |
2942 | type_binding = lookup_member (class_type, name, | |
2cbaacd9 | 2943 | /*protect=*/2, /*want_type=*/true, |
2944 | tf_warning_or_error); | |
d09ae6d5 | 2945 | /* Get the value binding. */ |
2946 | value_binding = lookup_member (class_type, name, | |
2cbaacd9 | 2947 | /*protect=*/2, /*want_type=*/false, |
2948 | tf_warning_or_error); | |
d09ae6d5 | 2949 | |
2950 | if (value_binding | |
2951 | && (TREE_CODE (value_binding) == TYPE_DECL | |
2952 | || DECL_CLASS_TEMPLATE_P (value_binding) | |
2953 | || (TREE_CODE (value_binding) == TREE_LIST | |
2954 | && TREE_TYPE (value_binding) == error_mark_node | |
2955 | && (TREE_CODE (TREE_VALUE (value_binding)) | |
2956 | == TYPE_DECL)))) | |
2957 | /* We found a type binding, even when looking for a non-type | |
2958 | binding. This means that we already processed this binding | |
2959 | above. */ | |
2960 | ; | |
2961 | else if (value_binding) | |
2962 | { | |
9031d10b | 2963 | if (TREE_CODE (value_binding) == TREE_LIST |
d09ae6d5 | 2964 | && TREE_TYPE (value_binding) == error_mark_node) |
2965 | /* NAME is ambiguous. */ | |
2966 | ; | |
2967 | else if (BASELINK_P (value_binding)) | |
2968 | /* NAME is some overloaded functions. */ | |
2969 | value_binding = BASELINK_FUNCTIONS (value_binding); | |
2970 | } | |
2971 | ||
2972 | /* If we found either a type binding or a value binding, create a | |
2973 | new binding object. */ | |
2974 | if (type_binding || value_binding) | |
2975 | { | |
9031d10b | 2976 | binding = new_class_binding (name, |
2977 | value_binding, | |
d09ae6d5 | 2978 | type_binding, |
2979 | scope); | |
2980 | /* This is a class-scope binding, not a block-scope binding. */ | |
2981 | LOCAL_BINDING_P (binding) = 0; | |
37b8cd7c | 2982 | set_inherited_value_binding_p (binding, value_binding, class_type); |
d09ae6d5 | 2983 | } |
2984 | else | |
2985 | binding = NULL; | |
2986 | ||
2987 | return binding; | |
2988 | } | |
9031d10b | 2989 | |
836495aa | 2990 | /* Make the declaration(s) of X appear in CLASS scope under the name |
2991 | NAME. Returns true if the binding is valid. */ | |
2992 | ||
6198e8f6 | 2993 | static bool |
2994 | push_class_level_binding_1 (tree name, tree x) | |
836495aa | 2995 | { |
2996 | cxx_binding *binding; | |
d09ae6d5 | 2997 | tree decl = x; |
2998 | bool ok; | |
836495aa | 2999 | |
836495aa | 3000 | /* The class_binding_level will be NULL if x is a template |
3001 | parameter name in a member template. */ | |
3002 | if (!class_binding_level) | |
6198e8f6 | 3003 | return true; |
836495aa | 3004 | |
4fef1bdd | 3005 | if (name == error_mark_node) |
6198e8f6 | 3006 | return false; |
4fef1bdd | 3007 | |
d09ae6d5 | 3008 | /* Check for invalid member names. */ |
b4df430b | 3009 | gcc_assert (TYPE_BEING_DEFINED (current_class_type)); |
11136a49 | 3010 | /* Check that we're pushing into the right binding level. */ |
3011 | gcc_assert (current_class_type == class_binding_level->this_entity); | |
3012 | ||
d09ae6d5 | 3013 | /* We could have been passed a tree list if this is an ambiguous |
3014 | declaration. If so, pull the declaration out because | |
93523877 | 3015 | check_template_shadow will not handle a TREE_LIST. */ |
9031d10b | 3016 | if (TREE_CODE (decl) == TREE_LIST |
d09ae6d5 | 3017 | && TREE_TYPE (decl) == error_mark_node) |
3018 | decl = TREE_VALUE (decl); | |
93ceb69b | 3019 | |
45fe0be6 | 3020 | if (!check_template_shadow (decl)) |
6198e8f6 | 3021 | return false; |
836495aa | 3022 | |
d09ae6d5 | 3023 | /* [class.mem] |
49babdb3 | 3024 | |
d09ae6d5 | 3025 | If T is the name of a class, then each of the following shall |
3026 | have a name different from T: | |
49babdb3 | 3027 | |
d09ae6d5 | 3028 | -- every static data member of class T; |
49babdb3 | 3029 | |
d09ae6d5 | 3030 | -- every member of class T that is itself a type; |
49babdb3 | 3031 | |
d09ae6d5 | 3032 | -- every enumerator of every member of class T that is an |
3033 | enumerated type; | |
49babdb3 | 3034 | |
d09ae6d5 | 3035 | -- every member of every anonymous union that is a member of |
3036 | class T. | |
49babdb3 | 3037 | |
d09ae6d5 | 3038 | (Non-static data members were also forbidden to have the same |
3039 | name as T until TC1.) */ | |
3040 | if ((TREE_CODE (x) == VAR_DECL | |
3041 | || TREE_CODE (x) == CONST_DECL | |
3042 | || (TREE_CODE (x) == TYPE_DECL | |
3043 | && !DECL_SELF_REFERENCE_P (x)) | |
3044 | /* A data member of an anonymous union. */ | |
3045 | || (TREE_CODE (x) == FIELD_DECL | |
3046 | && DECL_CONTEXT (x) != current_class_type)) | |
3047 | && DECL_NAME (x) == constructor_name (current_class_type)) | |
3048 | { | |
3049 | tree scope = context_for_name_lookup (x); | |
3050 | if (TYPE_P (scope) && same_type_p (scope, current_class_type)) | |
2c21a1c3 | 3051 | { |
a2c5b975 | 3052 | error ("%qD has the same name as the class in which it is " |
d09ae6d5 | 3053 | "declared", |
3054 | x); | |
6198e8f6 | 3055 | return false; |
2c21a1c3 | 3056 | } |
49babdb3 | 3057 | } |
3058 | ||
d09ae6d5 | 3059 | /* Get the current binding for NAME in this class, if any. */ |
836495aa | 3060 | binding = IDENTIFIER_BINDING (name); |
d09ae6d5 | 3061 | if (!binding || binding->scope != class_binding_level) |
3062 | { | |
3063 | binding = get_class_binding (name, class_binding_level); | |
3064 | /* If a new binding was created, put it at the front of the | |
3065 | IDENTIFIER_BINDING list. */ | |
3066 | if (binding) | |
3067 | { | |
3068 | binding->previous = IDENTIFIER_BINDING (name); | |
3069 | IDENTIFIER_BINDING (name) = binding; | |
3070 | } | |
3071 | } | |
3072 | ||
3073 | /* If there is already a binding, then we may need to update the | |
3074 | current value. */ | |
836495aa | 3075 | if (binding && binding->value) |
3076 | { | |
3077 | tree bval = binding->value; | |
3078 | tree old_decl = NULL_TREE; | |
807f85cf | 3079 | tree target_decl = strip_using_decl (decl); |
3080 | tree target_bval = strip_using_decl (bval); | |
836495aa | 3081 | |
3082 | if (INHERITED_VALUE_BINDING_P (binding)) | |
3083 | { | |
3084 | /* If the old binding was from a base class, and was for a | |
653e5405 | 3085 | tag name, slide it over to make room for the new binding. |
3086 | The old binding is still visible if explicitly qualified | |
3087 | with a class-key. */ | |
807f85cf | 3088 | if (TREE_CODE (target_bval) == TYPE_DECL |
3089 | && DECL_ARTIFICIAL (target_bval) | |
3090 | && !(TREE_CODE (target_decl) == TYPE_DECL | |
3091 | && DECL_ARTIFICIAL (target_decl))) | |
836495aa | 3092 | { |
3093 | old_decl = binding->type; | |
3094 | binding->type = bval; | |
3095 | binding->value = NULL_TREE; | |
3096 | INHERITED_VALUE_BINDING_P (binding) = 0; | |
3097 | } | |
3098 | else | |
b3cee199 | 3099 | { |
3100 | old_decl = bval; | |
3101 | /* Any inherited type declaration is hidden by the type | |
3102 | declaration in the derived class. */ | |
807f85cf | 3103 | if (TREE_CODE (target_decl) == TYPE_DECL |
3104 | && DECL_ARTIFICIAL (target_decl)) | |
b3cee199 | 3105 | binding->type = NULL_TREE; |
3106 | } | |
836495aa | 3107 | } |
807f85cf | 3108 | else if (TREE_CODE (target_decl) == OVERLOAD |
3109 | && is_overloaded_fn (target_bval)) | |
836495aa | 3110 | old_decl = bval; |
807f85cf | 3111 | else if (TREE_CODE (decl) == USING_DECL |
3112 | && TREE_CODE (bval) == USING_DECL | |
3113 | && same_type_p (USING_DECL_SCOPE (decl), | |
3114 | USING_DECL_SCOPE (bval))) | |
3115 | /* This is a using redeclaration that will be diagnosed later | |
3116 | in supplement_binding */ | |
3117 | ; | |
3118 | else if (TREE_CODE (decl) == USING_DECL | |
3119 | && TREE_CODE (bval) == USING_DECL | |
3120 | && DECL_DEPENDENT_P (decl) | |
3121 | && DECL_DEPENDENT_P (bval)) | |
6198e8f6 | 3122 | return true; |
807f85cf | 3123 | else if (TREE_CODE (decl) == USING_DECL |
3124 | && is_overloaded_fn (target_bval)) | |
836495aa | 3125 | old_decl = bval; |
807f85cf | 3126 | else if (TREE_CODE (bval) == USING_DECL |
3127 | && is_overloaded_fn (target_decl)) | |
6198e8f6 | 3128 | return true; |
598057ec | 3129 | |
d09ae6d5 | 3130 | if (old_decl && binding->scope == class_binding_level) |
836495aa | 3131 | { |
f75ee12a | 3132 | binding->value = x; |
3133 | /* It is always safe to clear INHERITED_VALUE_BINDING_P | |
37b8cd7c | 3134 | here. This function is only used to register bindings |
3135 | from with the class definition itself. */ | |
f75ee12a | 3136 | INHERITED_VALUE_BINDING_P (binding) = 0; |
6198e8f6 | 3137 | return true; |
836495aa | 3138 | } |
3139 | } | |
3140 | ||
d09ae6d5 | 3141 | /* Note that we declared this value so that we can issue an error if |
3142 | this is an invalid redeclaration of a name already used for some | |
3143 | other purpose. */ | |
3144 | note_name_declared_in_class (name, decl); | |
3145 | ||
836495aa | 3146 | /* If we didn't replace an existing binding, put the binding on the |
d09ae6d5 | 3147 | stack of bindings for the identifier, and update the shadowed |
3148 | list. */ | |
3149 | if (binding && binding->scope == class_binding_level) | |
3150 | /* Supplement the existing binding. */ | |
3151 | ok = supplement_binding (binding, decl); | |
3152 | else | |
3153 | { | |
3154 | /* Create a new binding. */ | |
3155 | push_binding (name, decl, class_binding_level); | |
3156 | ok = true; | |
3157 | } | |
836495aa | 3158 | |
6198e8f6 | 3159 | return ok; |
3160 | } | |
3161 | ||
3162 | /* Wrapper for push_class_level_binding_1. */ | |
3163 | ||
3164 | bool | |
3165 | push_class_level_binding (tree name, tree x) | |
3166 | { | |
3167 | bool ret; | |
3168 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); | |
3169 | ret = push_class_level_binding_1 (name, x); | |
3170 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); | |
3171 | return ret; | |
836495aa | 3172 | } |
3173 | ||
2ded3667 | 3174 | /* Process "using SCOPE::NAME" in a class scope. Return the |
3175 | USING_DECL created. */ | |
3176 | ||
cc9a4194 | 3177 | tree |
2ded3667 | 3178 | do_class_using_decl (tree scope, tree name) |
cc9a4194 | 3179 | { |
bbb1e488 | 3180 | /* The USING_DECL returned by this function. */ |
3181 | tree value; | |
3182 | /* The declaration (or declarations) name by this using | |
3183 | declaration. NULL if we are in a template and cannot figure out | |
3184 | what has been named. */ | |
3185 | tree decl; | |
3186 | /* True if SCOPE is a dependent type. */ | |
3187 | bool scope_dependent_p; | |
3188 | /* True if SCOPE::NAME is dependent. */ | |
3189 | bool name_dependent_p; | |
3190 | /* True if any of the bases of CURRENT_CLASS_TYPE are dependent. */ | |
3191 | bool bases_dependent_p; | |
3192 | tree binfo; | |
3193 | tree base_binfo; | |
3194 | int i; | |
9031d10b | 3195 | |
4fef1bdd | 3196 | if (name == error_mark_node) |
3197 | return NULL_TREE; | |
3198 | ||
2ded3667 | 3199 | if (!scope || !TYPE_P (scope)) |
cc9a4194 | 3200 | { |
3201 | error ("using-declaration for non-member at class scope"); | |
3202 | return NULL_TREE; | |
3203 | } | |
094fb0d8 | 3204 | |
094fb0d8 | 3205 | /* Make sure the name is not invalid */ |
cc9a4194 | 3206 | if (TREE_CODE (name) == BIT_NOT_EXPR) |
3207 | { | |
094fb0d8 | 3208 | error ("%<%T::%D%> names destructor", scope, name); |
3209 | return NULL_TREE; | |
3210 | } | |
95397ff9 | 3211 | if (MAYBE_CLASS_TYPE_P (scope) && constructor_name_p (name, scope)) |
094fb0d8 | 3212 | { |
3213 | error ("%<%T::%D%> names constructor", scope, name); | |
3214 | return NULL_TREE; | |
3215 | } | |
3216 | if (constructor_name_p (name, current_class_type)) | |
3217 | { | |
3218 | error ("%<%T::%D%> names constructor in %qT", | |
3219 | scope, name, current_class_type); | |
cc9a4194 | 3220 | return NULL_TREE; |
3221 | } | |
cc9a4194 | 3222 | |
9e92dfe5 | 3223 | scope_dependent_p = dependent_scope_p (scope); |
074ab442 | 3224 | name_dependent_p = (scope_dependent_p |
d7076663 | 3225 | || (IDENTIFIER_TYPENAME_P (name) |
bbb1e488 | 3226 | && dependent_type_p (TREE_TYPE (name)))); |
2b49746a | 3227 | |
bbb1e488 | 3228 | bases_dependent_p = false; |
3229 | if (processing_template_decl) | |
3230 | for (binfo = TYPE_BINFO (current_class_type), i = 0; | |
074ab442 | 3231 | BINFO_BASE_ITERATE (binfo, i, base_binfo); |
bbb1e488 | 3232 | i++) |
3233 | if (dependent_type_p (TREE_TYPE (base_binfo))) | |
3234 | { | |
3235 | bases_dependent_p = true; | |
3236 | break; | |
3237 | } | |
3238 | ||
3239 | decl = NULL_TREE; | |
3240 | ||
3241 | /* From [namespace.udecl]: | |
9031d10b | 3242 | |
bbb1e488 | 3243 | A using-declaration used as a member-declaration shall refer to a |
074ab442 | 3244 | member of a base class of the class being defined. |
3245 | ||
bbb1e488 | 3246 | In general, we cannot check this constraint in a template because |
3247 | we do not know the entire set of base classes of the current | |
9e92dfe5 | 3248 | class type. Morover, if SCOPE is dependent, it might match a |
3249 | non-dependent base. */ | |
3250 | ||
4a132a96 | 3251 | if (!scope_dependent_p) |
bbb1e488 | 3252 | { |
3253 | base_kind b_kind; | |
bbb1e488 | 3254 | binfo = lookup_base (current_class_type, scope, ba_any, &b_kind); |
3255 | if (b_kind < bk_proper_base) | |
094fb0d8 | 3256 | { |
4a132a96 | 3257 | if (!bases_dependent_p) |
3258 | { | |
3259 | error_not_base_type (scope, current_class_type); | |
3260 | return NULL_TREE; | |
3261 | } | |
094fb0d8 | 3262 | } |
4a132a96 | 3263 | else if (!name_dependent_p) |
bbb1e488 | 3264 | { |
2cbaacd9 | 3265 | decl = lookup_member (binfo, name, 0, false, tf_warning_or_error); |
bbb1e488 | 3266 | if (!decl) |
3267 | { | |
074ab442 | 3268 | error ("no members matching %<%T::%D%> in %q#T", scope, name, |
bbb1e488 | 3269 | scope); |
3270 | return NULL_TREE; | |
3271 | } | |
3272 | /* The binfo from which the functions came does not matter. */ | |
3273 | if (BASELINK_P (decl)) | |
3274 | decl = BASELINK_FUNCTIONS (decl); | |
3275 | } | |
9e92dfe5 | 3276 | } |
094fb0d8 | 3277 | |
3278 | value = build_lang_decl (USING_DECL, name, NULL_TREE); | |
3279 | USING_DECL_DECLS (value) = decl; | |
3280 | USING_DECL_SCOPE (value) = scope; | |
bbb1e488 | 3281 | DECL_DEPENDENT_P (value) = !decl; |
2b49746a | 3282 | |
cc9a4194 | 3283 | return value; |
3284 | } | |
3285 | ||
836495aa | 3286 | \f |
3287 | /* Return the binding value for name in scope. */ | |
3288 | ||
6198e8f6 | 3289 | |
3290 | static tree | |
3291 | namespace_binding_1 (tree name, tree scope) | |
836495aa | 3292 | { |
3293 | cxx_binding *binding; | |
3294 | ||
2108f7c0 | 3295 | if (SCOPE_FILE_SCOPE_P (scope)) |
836495aa | 3296 | scope = global_namespace; |
dc2a0613 | 3297 | else |
3298 | /* Unnecessary for the global namespace because it can't be an alias. */ | |
3299 | scope = ORIGINAL_NAMESPACE (scope); | |
3300 | ||
d0ef83bc | 3301 | binding = cp_binding_level_find_binding_for_name (NAMESPACE_LEVEL (scope), name); |
836495aa | 3302 | |
3303 | return binding ? binding->value : NULL_TREE; | |
3304 | } | |
3305 | ||
6198e8f6 | 3306 | tree |
3307 | namespace_binding (tree name, tree scope) | |
3308 | { | |
3309 | tree ret; | |
3310 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); | |
3311 | ret = namespace_binding_1 (name, scope); | |
3312 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); | |
3313 | return ret; | |
3314 | } | |
3315 | ||
836495aa | 3316 | /* Set the binding value for name in scope. */ |
d36ac936 | 3317 | |
6198e8f6 | 3318 | static void |
3319 | set_namespace_binding_1 (tree name, tree scope, tree val) | |
d36ac936 | 3320 | { |
3321 | cxx_binding *b; | |
3322 | ||
d36ac936 | 3323 | if (scope == NULL_TREE) |
3324 | scope = global_namespace; | |
3325 | b = binding_for_name (NAMESPACE_LEVEL (scope), name); | |
f9a802b1 | 3326 | if (!b->value || TREE_CODE (val) == OVERLOAD || val == error_mark_node) |
76608a37 | 3327 | b->value = val; |
b7d1e8ea | 3328 | else |
3bd975bc | 3329 | supplement_binding (b, val); |
6198e8f6 | 3330 | } |
3331 | ||
3332 | /* Wrapper for set_namespace_binding_1. */ | |
3333 | ||
3334 | void | |
3335 | set_namespace_binding (tree name, tree scope, tree val) | |
3336 | { | |
3337 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); | |
3338 | set_namespace_binding_1 (name, scope, val); | |
3339 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); | |
d36ac936 | 3340 | } |
3341 | ||
cc9a4194 | 3342 | /* Set the context of a declaration to scope. Complain if we are not |
3343 | outside scope. */ | |
3344 | ||
3345 | void | |
3346 | set_decl_namespace (tree decl, tree scope, bool friendp) | |
3347 | { | |
71893b0a | 3348 | tree old; |
9031d10b | 3349 | |
cc9a4194 | 3350 | /* Get rid of namespace aliases. */ |
3351 | scope = ORIGINAL_NAMESPACE (scope); | |
9031d10b | 3352 | |
cc9a4194 | 3353 | /* It is ok for friends to be qualified in parallel space. */ |
3354 | if (!friendp && !is_ancestor (current_namespace, scope)) | |
44ed1032 | 3355 | error ("declaration of %qD not in a namespace surrounding %qD", |
653e5405 | 3356 | decl, scope); |
cc9a4194 | 3357 | DECL_CONTEXT (decl) = FROB_CONTEXT (scope); |
ab6bb714 | 3358 | |
9031d10b | 3359 | /* Writing "int N::i" to declare a variable within "N" is invalid. */ |
3360 | if (scope == current_namespace) | |
ab6bb714 | 3361 | { |
3362 | if (at_namespace_scope_p ()) | |
3284a242 | 3363 | error ("explicit qualification in declaration of %qD", |
ab6bb714 | 3364 | decl); |
3365 | return; | |
cc9a4194 | 3366 | } |
ab6bb714 | 3367 | |
3368 | /* See whether this has been declared in the namespace. */ | |
ea4d28f3 | 3369 | old = lookup_qualified_name (scope, DECL_NAME (decl), false, true); |
786edca3 | 3370 | if (old == error_mark_node) |
ab6bb714 | 3371 | /* No old declaration at all. */ |
3372 | goto complain; | |
71893b0a | 3373 | /* If it's a TREE_LIST, the result of the lookup was ambiguous. */ |
3374 | if (TREE_CODE (old) == TREE_LIST) | |
3375 | { | |
3376 | error ("reference to %qD is ambiguous", decl); | |
3377 | print_candidates (old); | |
3378 | return; | |
3379 | } | |
ab6bb714 | 3380 | if (!is_overloaded_fn (decl)) |
71893b0a | 3381 | { |
3382 | /* We might have found OLD in an inline namespace inside SCOPE. */ | |
253cc498 | 3383 | if (TREE_CODE (decl) == TREE_CODE (old)) |
3384 | DECL_CONTEXT (decl) = DECL_CONTEXT (old); | |
71893b0a | 3385 | /* Don't compare non-function decls with decls_match here, since |
3386 | it can't check for the correct constness at this | |
3387 | point. pushdecl will find those errors later. */ | |
3388 | return; | |
3389 | } | |
ab6bb714 | 3390 | /* Since decl is a function, old should contain a function decl. */ |
3391 | if (!is_overloaded_fn (old)) | |
3392 | goto complain; | |
ea4d28f3 | 3393 | /* A template can be explicitly specialized in any namespace. */ |
3394 | if (processing_explicit_instantiation) | |
3395 | return; | |
ab6bb714 | 3396 | if (processing_template_decl || processing_specialization) |
3397 | /* We have not yet called push_template_decl to turn a | |
3398 | FUNCTION_DECL into a TEMPLATE_DECL, so the declarations won't | |
3399 | match. But, we'll check later, when we construct the | |
3400 | template. */ | |
cc9a4194 | 3401 | return; |
d9f07a8d | 3402 | /* Instantiations or specializations of templates may be declared as |
3403 | friends in any namespace. */ | |
3404 | if (friendp && DECL_USE_TEMPLATE (decl)) | |
3405 | return; | |
ab6bb714 | 3406 | if (is_overloaded_fn (old)) |
3407 | { | |
71893b0a | 3408 | tree found = NULL_TREE; |
3409 | tree elt = old; | |
3410 | for (; elt; elt = OVL_NEXT (elt)) | |
3411 | { | |
3412 | tree ofn = OVL_CURRENT (elt); | |
3413 | /* Adjust DECL_CONTEXT first so decls_match will return true | |
3414 | if DECL will match a declaration in an inline namespace. */ | |
3415 | DECL_CONTEXT (decl) = DECL_CONTEXT (ofn); | |
3416 | if (decls_match (decl, ofn)) | |
3417 | { | |
3418 | if (found && !decls_match (found, ofn)) | |
3419 | { | |
3420 | DECL_CONTEXT (decl) = FROB_CONTEXT (scope); | |
3421 | error ("reference to %qD is ambiguous", decl); | |
3422 | print_candidates (old); | |
3423 | return; | |
3424 | } | |
3425 | found = ofn; | |
3426 | } | |
3427 | } | |
3428 | if (found) | |
3429 | { | |
3430 | if (!is_associated_namespace (scope, CP_DECL_CONTEXT (found))) | |
3431 | goto complain; | |
3432 | DECL_CONTEXT (decl) = DECL_CONTEXT (found); | |
ab6bb714 | 3433 | return; |
71893b0a | 3434 | } |
ab6bb714 | 3435 | } |
71893b0a | 3436 | else |
3437 | { | |
3438 | DECL_CONTEXT (decl) = DECL_CONTEXT (old); | |
3439 | if (decls_match (decl, old)) | |
3440 | return; | |
3441 | } | |
3442 | ||
3443 | /* It didn't work, go back to the explicit scope. */ | |
3444 | DECL_CONTEXT (decl) = FROB_CONTEXT (scope); | |
cc9a4194 | 3445 | complain: |
a2c5b975 | 3446 | error ("%qD should have been declared inside %qD", decl, scope); |
9031d10b | 3447 | } |
cc9a4194 | 3448 | |
3449 | /* Return the namespace where the current declaration is declared. */ | |
3450 | ||
305104fd | 3451 | tree |
cc9a4194 | 3452 | current_decl_namespace (void) |
3453 | { | |
3454 | tree result; | |
3455 | /* If we have been pushed into a different namespace, use it. */ | |
eab615be | 3456 | if (!VEC_empty (tree, decl_namespace_list)) |
3457 | return VEC_last (tree, decl_namespace_list); | |
cc9a4194 | 3458 | |
3459 | if (current_class_type) | |
e4e8c884 | 3460 | result = decl_namespace_context (current_class_type); |
cc9a4194 | 3461 | else if (current_function_decl) |
e4e8c884 | 3462 | result = decl_namespace_context (current_function_decl); |
9031d10b | 3463 | else |
cc9a4194 | 3464 | result = current_namespace; |
3465 | return result; | |
3466 | } | |
3467 | ||
1fd77946 | 3468 | /* Process any ATTRIBUTES on a namespace definition. Currently only |
3469 | attribute visibility is meaningful, which is a property of the syntactic | |
3470 | block rather than the namespace as a whole, so we don't touch the | |
3471 | NAMESPACE_DECL at all. Returns true if attribute visibility is seen. */ | |
836495aa | 3472 | |
1fd77946 | 3473 | bool |
3474 | handle_namespace_attrs (tree ns, tree attributes) | |
799435d8 | 3475 | { |
1fd77946 | 3476 | tree d; |
3477 | bool saw_vis = false; | |
799435d8 | 3478 | |
1fd77946 | 3479 | for (d = attributes; d; d = TREE_CHAIN (d)) |
3480 | { | |
3481 | tree name = TREE_PURPOSE (d); | |
3482 | tree args = TREE_VALUE (d); | |
3483 | ||
1fd77946 | 3484 | if (is_attribute_p ("visibility", name)) |
3485 | { | |
3486 | tree x = args ? TREE_VALUE (args) : NULL_TREE; | |
3487 | if (x == NULL_TREE || TREE_CODE (x) != STRING_CST || TREE_CHAIN (args)) | |
3488 | { | |
3489 | warning (OPT_Wattributes, | |
3490 | "%qD attribute requires a single NTBS argument", | |
3491 | name); | |
3492 | continue; | |
3493 | } | |
3494 | ||
3495 | if (!TREE_PUBLIC (ns)) | |
3496 | warning (OPT_Wattributes, | |
3497 | "%qD attribute is meaningless since members of the " | |
3498 | "anonymous namespace get local symbols", name); | |
3499 | ||
f1658ae0 | 3500 | push_visibility (TREE_STRING_POINTER (x), 1); |
1fd77946 | 3501 | saw_vis = true; |
3502 | } | |
3503 | else | |
1fd77946 | 3504 | { |
3505 | warning (OPT_Wattributes, "%qD attribute directive ignored", | |
3506 | name); | |
3507 | continue; | |
3508 | } | |
3509 | } | |
3510 | ||
3511 | return saw_vis; | |
3512 | } | |
3513 | ||
3514 | /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we | |
3515 | select a name that is unique to this compilation unit. */ | |
799435d8 | 3516 | |
3517 | void | |
1fd77946 | 3518 | push_namespace (tree name) |
836495aa | 3519 | { |
3520 | tree d = NULL_TREE; | |
d8a1daa8 | 3521 | bool need_new = true; |
3522 | bool implicit_use = false; | |
c2e83164 | 3523 | bool anon = !name; |
836495aa | 3524 | |
6198e8f6 | 3525 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); |
9031d10b | 3526 | |
836495aa | 3527 | /* We should not get here if the global_namespace is not yet constructed |
3528 | nor if NAME designates the global namespace: The global scope is | |
3529 | constructed elsewhere. */ | |
b4df430b | 3530 | gcc_assert (global_namespace != NULL && name != global_scope_name); |
836495aa | 3531 | |
c2e83164 | 3532 | if (anon) |
836495aa | 3533 | { |
db85cc4f | 3534 | name = get_anonymous_namespace_name(); |
836495aa | 3535 | d = IDENTIFIER_NAMESPACE_VALUE (name); |
3536 | if (d) | |
653e5405 | 3537 | /* Reopening anonymous namespace. */ |
d8a1daa8 | 3538 | need_new = false; |
3539 | implicit_use = true; | |
836495aa | 3540 | } |
3541 | else | |
3542 | { | |
3543 | /* Check whether this is an extended namespace definition. */ | |
3544 | d = IDENTIFIER_NAMESPACE_VALUE (name); | |
3545 | if (d != NULL_TREE && TREE_CODE (d) == NAMESPACE_DECL) | |
653e5405 | 3546 | { |
d8a1daa8 | 3547 | tree dna = DECL_NAMESPACE_ALIAS (d); |
3548 | if (dna) | |
3549 | { | |
3550 | /* We do some error recovery for, eg, the redeclaration | |
3551 | of M here: | |
3552 | ||
3553 | namespace N {} | |
3554 | namespace M = N; | |
3555 | namespace M {} | |
3556 | ||
3557 | However, in nasty cases like: | |
3558 | ||
3559 | namespace N | |
3560 | { | |
3561 | namespace M = N; | |
3562 | namespace M {} | |
3563 | } | |
3564 | ||
3565 | we just error out below, in duplicate_decls. */ | |
3566 | if (NAMESPACE_LEVEL (dna)->level_chain | |
3567 | == current_binding_level) | |
3568 | { | |
3569 | error ("namespace alias %qD not allowed here, " | |
3570 | "assuming %qD", d, dna); | |
3571 | d = dna; | |
3572 | need_new = false; | |
3573 | } | |
653e5405 | 3574 | } |
d8a1daa8 | 3575 | else |
3576 | need_new = false; | |
653e5405 | 3577 | } |
836495aa | 3578 | } |
3579 | ||
3580 | if (need_new) | |
3581 | { | |
3582 | /* Make a new namespace, binding the name to it. */ | |
3583 | d = build_lang_decl (NAMESPACE_DECL, name, void_type_node); | |
3584 | DECL_CONTEXT (d) = FROB_CONTEXT (current_namespace); | |
4a2849cb | 3585 | /* The name of this namespace is not visible to other translation |
3586 | units if it is an anonymous namespace or member thereof. */ | |
3587 | if (anon || decl_anon_ns_mem_p (current_namespace)) | |
3588 | TREE_PUBLIC (d) = 0; | |
3589 | else | |
3590 | TREE_PUBLIC (d) = 1; | |
1940f978 | 3591 | pushdecl (d); |
c2e83164 | 3592 | if (anon) |
3593 | { | |
3594 | /* Clear DECL_NAME for the benefit of debugging back ends. */ | |
3595 | SET_DECL_ASSEMBLER_NAME (d, name); | |
3596 | DECL_NAME (d) = NULL_TREE; | |
3597 | } | |
836495aa | 3598 | begin_scope (sk_namespace, d); |
3599 | } | |
3600 | else | |
3601 | resume_scope (NAMESPACE_LEVEL (d)); | |
3602 | ||
3603 | if (implicit_use) | |
3604 | do_using_directive (d); | |
3605 | /* Enter the name space. */ | |
3606 | current_namespace = d; | |
3607 | ||
6198e8f6 | 3608 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); |
836495aa | 3609 | } |
3610 | ||
3611 | /* Pop from the scope of the current namespace. */ | |
3612 | ||
3613 | void | |
3614 | pop_namespace (void) | |
3615 | { | |
b4df430b | 3616 | gcc_assert (current_namespace != global_namespace); |
836495aa | 3617 | current_namespace = CP_DECL_CONTEXT (current_namespace); |
3618 | /* The binding level is not popped, as it might be re-opened later. */ | |
3619 | leave_scope (); | |
3620 | } | |
3621 | ||
3622 | /* Push into the scope of the namespace NS, even if it is deeply | |
3623 | nested within another namespace. */ | |
3624 | ||
3625 | void | |
3626 | push_nested_namespace (tree ns) | |
3627 | { | |
3628 | if (ns == global_namespace) | |
3629 | push_to_top_level (); | |
3630 | else | |
3631 | { | |
3632 | push_nested_namespace (CP_DECL_CONTEXT (ns)); | |
3633 | push_namespace (DECL_NAME (ns)); | |
3634 | } | |
3635 | } | |
3636 | ||
3637 | /* Pop back from the scope of the namespace NS, which was previously | |
3638 | entered with push_nested_namespace. */ | |
3639 | ||
3640 | void | |
3641 | pop_nested_namespace (tree ns) | |
3642 | { | |
6198e8f6 | 3643 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); |
305104fd | 3644 | gcc_assert (current_namespace == ns); |
836495aa | 3645 | while (ns != global_namespace) |
3646 | { | |
3647 | pop_namespace (); | |
3648 | ns = CP_DECL_CONTEXT (ns); | |
3649 | } | |
3650 | ||
3651 | pop_from_top_level (); | |
6198e8f6 | 3652 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); |
836495aa | 3653 | } |
3654 | ||
cc9a4194 | 3655 | /* Temporarily set the namespace for the current declaration. */ |
3656 | ||
3657 | void | |
3658 | push_decl_namespace (tree decl) | |
3659 | { | |
3660 | if (TREE_CODE (decl) != NAMESPACE_DECL) | |
e4e8c884 | 3661 | decl = decl_namespace_context (decl); |
eab615be | 3662 | VEC_safe_push (tree, gc, decl_namespace_list, ORIGINAL_NAMESPACE (decl)); |
cc9a4194 | 3663 | } |
3664 | ||
3665 | /* [namespace.memdef]/2 */ | |
3666 | ||
3667 | void | |
3668 | pop_decl_namespace (void) | |
3669 | { | |
eab615be | 3670 | VEC_pop (tree, decl_namespace_list); |
cc9a4194 | 3671 | } |
3672 | ||
9031d10b | 3673 | /* Return the namespace that is the common ancestor |
cc9a4194 | 3674 | of two given namespaces. */ |
3675 | ||
9a49d46b | 3676 | static tree |
6198e8f6 | 3677 | namespace_ancestor_1 (tree ns1, tree ns2) |
cc9a4194 | 3678 | { |
6198e8f6 | 3679 | tree nsr; |
cc9a4194 | 3680 | if (is_ancestor (ns1, ns2)) |
6198e8f6 | 3681 | nsr = ns1; |
3682 | else | |
3683 | nsr = namespace_ancestor_1 (CP_DECL_CONTEXT (ns1), ns2); | |
3684 | return nsr; | |
3685 | } | |
3686 | ||
3687 | /* Wrapper for namespace_ancestor_1. */ | |
3688 | ||
3689 | static tree | |
3690 | namespace_ancestor (tree ns1, tree ns2) | |
3691 | { | |
3692 | tree nsr; | |
3693 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); | |
3694 | nsr = namespace_ancestor_1 (ns1, ns2); | |
3695 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); | |
3696 | return nsr; | |
cc9a4194 | 3697 | } |
3698 | ||
3699 | /* Process a namespace-alias declaration. */ | |
3700 | ||
3701 | void | |
607a5d68 | 3702 | do_namespace_alias (tree alias, tree name_space) |
cc9a4194 | 3703 | { |
607a5d68 | 3704 | if (name_space == error_mark_node) |
f75d14ca | 3705 | return; |
3706 | ||
607a5d68 | 3707 | gcc_assert (TREE_CODE (name_space) == NAMESPACE_DECL); |
cc9a4194 | 3708 | |
607a5d68 | 3709 | name_space = ORIGINAL_NAMESPACE (name_space); |
cc9a4194 | 3710 | |
3711 | /* Build the alias. */ | |
9031d10b | 3712 | alias = build_lang_decl (NAMESPACE_DECL, alias, void_type_node); |
607a5d68 | 3713 | DECL_NAMESPACE_ALIAS (alias) = name_space; |
cc9a4194 | 3714 | DECL_EXTERNAL (alias) = 1; |
793a5b44 | 3715 | DECL_CONTEXT (alias) = FROB_CONTEXT (current_scope ()); |
cc9a4194 | 3716 | pushdecl (alias); |
2b49746a | 3717 | |
3718 | /* Emit debug info for namespace alias. */ | |
cacfdc02 | 3719 | if (!building_stmt_list_p ()) |
6ace4ee2 | 3720 | (*debug_hooks->global_decl) (alias); |
cc9a4194 | 3721 | } |
3722 | ||
836495aa | 3723 | /* Like pushdecl, only it places X in the current namespace, |
3724 | if appropriate. */ | |
3725 | ||
3726 | tree | |
c1d4295f | 3727 | pushdecl_namespace_level (tree x, bool is_friend) |
836495aa | 3728 | { |
d0ef83bc | 3729 | cp_binding_level *b = current_binding_level; |
cd16867a | 3730 | tree t; |
836495aa | 3731 | |
6198e8f6 | 3732 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); |
c1d4295f | 3733 | t = pushdecl_with_scope (x, NAMESPACE_LEVEL (current_namespace), is_friend); |
836495aa | 3734 | |
3735 | /* Now, the type_shadowed stack may screw us. Munge it so it does | |
3736 | what we want. */ | |
0a3a8a09 | 3737 | if (TREE_CODE (t) == TYPE_DECL) |
836495aa | 3738 | { |
0a3a8a09 | 3739 | tree name = DECL_NAME (t); |
836495aa | 3740 | tree newval; |
3741 | tree *ptr = (tree *)0; | |
3742 | for (; !global_scope_p (b); b = b->level_chain) | |
653e5405 | 3743 | { |
3744 | tree shadowed = b->type_shadowed; | |
3745 | for (; shadowed; shadowed = TREE_CHAIN (shadowed)) | |
3746 | if (TREE_PURPOSE (shadowed) == name) | |
3747 | { | |
836495aa | 3748 | ptr = &TREE_VALUE (shadowed); |
3749 | /* Can't break out of the loop here because sometimes | |
3750 | a binding level will have duplicate bindings for | |
3751 | PT names. It's gross, but I haven't time to fix it. */ | |
653e5405 | 3752 | } |
3753 | } | |
0a3a8a09 | 3754 | newval = TREE_TYPE (t); |
836495aa | 3755 | if (ptr == (tree *)0) |
653e5405 | 3756 | { |
3757 | /* @@ This shouldn't be needed. My test case "zstring.cc" trips | |
3758 | up here if this is changed to an assertion. --KR */ | |
0a3a8a09 | 3759 | SET_IDENTIFIER_TYPE_VALUE (name, t); |
836495aa | 3760 | } |
3761 | else | |
653e5405 | 3762 | { |
836495aa | 3763 | *ptr = newval; |
653e5405 | 3764 | } |
836495aa | 3765 | } |
6198e8f6 | 3766 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); |
3767 | return t; | |
836495aa | 3768 | } |
3769 | ||
cc9a4194 | 3770 | /* Insert USED into the using list of USER. Set INDIRECT_flag if this |
3771 | directive is not directly from the source. Also find the common | |
3772 | ancestor and let our users know about the new namespace */ | |
6198e8f6 | 3773 | |
9031d10b | 3774 | static void |
6198e8f6 | 3775 | add_using_namespace_1 (tree user, tree used, bool indirect) |
cc9a4194 | 3776 | { |
3777 | tree t; | |
cc9a4194 | 3778 | /* Using oneself is a no-op. */ |
3779 | if (user == used) | |
6198e8f6 | 3780 | return; |
b4df430b | 3781 | gcc_assert (TREE_CODE (user) == NAMESPACE_DECL); |
3782 | gcc_assert (TREE_CODE (used) == NAMESPACE_DECL); | |
cc9a4194 | 3783 | /* Check if we already have this. */ |
3784 | t = purpose_member (used, DECL_NAMESPACE_USING (user)); | |
3785 | if (t != NULL_TREE) | |
3786 | { | |
3787 | if (!indirect) | |
3788 | /* Promote to direct usage. */ | |
3789 | TREE_INDIRECT_USING (t) = 0; | |
cc9a4194 | 3790 | return; |
3791 | } | |
3792 | ||
3793 | /* Add used to the user's using list. */ | |
9031d10b | 3794 | DECL_NAMESPACE_USING (user) |
3795 | = tree_cons (used, namespace_ancestor (user, used), | |
cc9a4194 | 3796 | DECL_NAMESPACE_USING (user)); |
3797 | ||
3798 | TREE_INDIRECT_USING (DECL_NAMESPACE_USING (user)) = indirect; | |
3799 | ||
3800 | /* Add user to the used's users list. */ | |
3801 | DECL_NAMESPACE_USERS (used) | |
3802 | = tree_cons (user, 0, DECL_NAMESPACE_USERS (used)); | |
3803 | ||
3804 | /* Recursively add all namespaces used. */ | |
3805 | for (t = DECL_NAMESPACE_USING (used); t; t = TREE_CHAIN (t)) | |
3806 | /* indirect usage */ | |
6198e8f6 | 3807 | add_using_namespace_1 (user, TREE_PURPOSE (t), 1); |
cc9a4194 | 3808 | |
3809 | /* Tell everyone using us about the new used namespaces. */ | |
3810 | for (t = DECL_NAMESPACE_USERS (user); t; t = TREE_CHAIN (t)) | |
6198e8f6 | 3811 | add_using_namespace_1 (TREE_PURPOSE (t), used, 1); |
3812 | } | |
3813 | ||
3814 | /* Wrapper for add_using_namespace_1. */ | |
3815 | ||
3816 | static void | |
3817 | add_using_namespace (tree user, tree used, bool indirect) | |
3818 | { | |
3819 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); | |
3820 | add_using_namespace_1 (user, used, indirect); | |
3821 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); | |
cc9a4194 | 3822 | } |
3823 | ||
3824 | /* Process a using-declaration not appearing in class or local scope. */ | |
3825 | ||
3826 | void | |
2c47ecdb | 3827 | do_toplevel_using_decl (tree decl, tree scope, tree name) |
cc9a4194 | 3828 | { |
cc9a4194 | 3829 | tree oldval, oldtype, newval, newtype; |
2b49746a | 3830 | tree orig_decl = decl; |
cc9a4194 | 3831 | cxx_binding *binding; |
3832 | ||
2c47ecdb | 3833 | decl = validate_nonmember_using_decl (decl, scope, name); |
cc9a4194 | 3834 | if (decl == NULL_TREE) |
3835 | return; | |
9031d10b | 3836 | |
cc9a4194 | 3837 | binding = binding_for_name (NAMESPACE_LEVEL (current_namespace), name); |
3838 | ||
3839 | oldval = binding->value; | |
3840 | oldtype = binding->type; | |
3841 | ||
3842 | do_nonmember_using_decl (scope, name, oldval, oldtype, &newval, &newtype); | |
3843 | ||
2b49746a | 3844 | /* Emit debug info. */ |
3845 | if (!processing_template_decl) | |
3846 | cp_emit_debug_info_for_using (orig_decl, current_namespace); | |
3847 | ||
cc9a4194 | 3848 | /* Copy declarations found. */ |
3849 | if (newval) | |
3850 | binding->value = newval; | |
3851 | if (newtype) | |
3852 | binding->type = newtype; | |
cc9a4194 | 3853 | } |
3854 | ||
3855 | /* Process a using-directive. */ | |
3856 | ||
3857 | void | |
607a5d68 | 3858 | do_using_directive (tree name_space) |
cc9a4194 | 3859 | { |
2b49746a | 3860 | tree context = NULL_TREE; |
3861 | ||
607a5d68 | 3862 | if (name_space == error_mark_node) |
f75d14ca | 3863 | return; |
3864 | ||
607a5d68 | 3865 | gcc_assert (TREE_CODE (name_space) == NAMESPACE_DECL); |
f75d14ca | 3866 | |
cacfdc02 | 3867 | if (building_stmt_list_p ()) |
e60a6f7b | 3868 | add_stmt (build_stmt (input_location, USING_STMT, name_space)); |
607a5d68 | 3869 | name_space = ORIGINAL_NAMESPACE (name_space); |
f75d14ca | 3870 | |
cc9a4194 | 3871 | if (!toplevel_bindings_p ()) |
2b49746a | 3872 | { |
607a5d68 | 3873 | push_using_directive (name_space); |
2b49746a | 3874 | } |
cc9a4194 | 3875 | else |
2b49746a | 3876 | { |
3877 | /* direct usage */ | |
607a5d68 | 3878 | add_using_namespace (current_namespace, name_space, 0); |
2b49746a | 3879 | if (current_namespace != global_namespace) |
3880 | context = current_namespace; | |
9031d10b | 3881 | |
5d8a39b7 | 3882 | /* Emit debugging info. */ |
3883 | if (!processing_template_decl) | |
3884 | (*debug_hooks->imported_module_or_decl) (name_space, NULL_TREE, | |
3885 | context, false); | |
3886 | } | |
cc9a4194 | 3887 | } |
3888 | ||
a5ed46c9 | 3889 | /* Deal with a using-directive seen by the parser. Currently we only |
3890 | handle attributes here, since they cannot appear inside a template. */ | |
3891 | ||
3892 | void | |
607a5d68 | 3893 | parse_using_directive (tree name_space, tree attribs) |
a5ed46c9 | 3894 | { |
3895 | tree a; | |
3896 | ||
607a5d68 | 3897 | do_using_directive (name_space); |
a5ed46c9 | 3898 | |
3899 | for (a = attribs; a; a = TREE_CHAIN (a)) | |
3900 | { | |
3901 | tree name = TREE_PURPOSE (a); | |
3902 | if (is_attribute_p ("strong", name)) | |
3903 | { | |
3904 | if (!toplevel_bindings_p ()) | |
3905 | error ("strong using only meaningful at namespace scope"); | |
607a5d68 | 3906 | else if (name_space != error_mark_node) |
848bf3dc | 3907 | { |
607a5d68 | 3908 | if (!is_ancestor (current_namespace, name_space)) |
848bf3dc | 3909 | error ("current namespace %qD does not enclose strongly used namespace %qD", |
607a5d68 | 3910 | current_namespace, name_space); |
3911 | DECL_NAMESPACE_ASSOCIATIONS (name_space) | |
848bf3dc | 3912 | = tree_cons (current_namespace, 0, |
607a5d68 | 3913 | DECL_NAMESPACE_ASSOCIATIONS (name_space)); |
848bf3dc | 3914 | } |
a5ed46c9 | 3915 | } |
3916 | else | |
9b2d6d13 | 3917 | warning (OPT_Wattributes, "%qD attribute directive ignored", name); |
a5ed46c9 | 3918 | } |
3919 | } | |
3920 | ||
9a49d46b | 3921 | /* Like pushdecl, only it places X in the global scope if appropriate. |
3922 | Calls cp_finish_decl to register the variable, initializing it with | |
3923 | *INIT, if INIT is non-NULL. */ | |
3924 | ||
3925 | static tree | |
c1d4295f | 3926 | pushdecl_top_level_1 (tree x, tree *init, bool is_friend) |
9a49d46b | 3927 | { |
6198e8f6 | 3928 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); |
9a49d46b | 3929 | push_to_top_level (); |
c1d4295f | 3930 | x = pushdecl_namespace_level (x, is_friend); |
9a49d46b | 3931 | if (init) |
7f78414b | 3932 | cp_finish_decl (x, *init, false, NULL_TREE, 0); |
9a49d46b | 3933 | pop_from_top_level (); |
6198e8f6 | 3934 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); |
3935 | return x; | |
9a49d46b | 3936 | } |
3937 | ||
3938 | /* Like pushdecl, only it places X in the global scope if appropriate. */ | |
3939 | ||
3940 | tree | |
3941 | pushdecl_top_level (tree x) | |
3942 | { | |
c1d4295f | 3943 | return pushdecl_top_level_1 (x, NULL, false); |
3944 | } | |
3945 | ||
3946 | /* Like pushdecl_top_level, but adding the IS_FRIEND parameter. */ | |
3947 | ||
3948 | tree | |
3949 | pushdecl_top_level_maybe_friend (tree x, bool is_friend) | |
3950 | { | |
3951 | return pushdecl_top_level_1 (x, NULL, is_friend); | |
9a49d46b | 3952 | } |
3953 | ||
3954 | /* Like pushdecl, only it places X in the global scope if | |
3955 | appropriate. Calls cp_finish_decl to register the variable, | |
3956 | initializing it with INIT. */ | |
3957 | ||
3958 | tree | |
3959 | pushdecl_top_level_and_finish (tree x, tree init) | |
3960 | { | |
c1d4295f | 3961 | return pushdecl_top_level_1 (x, &init, false); |
9a49d46b | 3962 | } |
3963 | ||
cc9a4194 | 3964 | /* Combines two sets of overloaded functions into an OVERLOAD chain, removing |
3965 | duplicates. The first list becomes the tail of the result. | |
3966 | ||
3967 | The algorithm is O(n^2). We could get this down to O(n log n) by | |
3968 | doing a sort on the addresses of the functions, if that becomes | |
3969 | necessary. */ | |
3970 | ||
3971 | static tree | |
3972 | merge_functions (tree s1, tree s2) | |
3973 | { | |
3974 | for (; s2; s2 = OVL_NEXT (s2)) | |
3975 | { | |
3976 | tree fn2 = OVL_CURRENT (s2); | |
3977 | tree fns1; | |
3978 | ||
3979 | for (fns1 = s1; fns1; fns1 = OVL_NEXT (fns1)) | |
3980 | { | |
3981 | tree fn1 = OVL_CURRENT (fns1); | |
3982 | ||
3983 | /* If the function from S2 is already in S1, there is no | |
3984 | need to add it again. For `extern "C"' functions, we | |
3985 | might have two FUNCTION_DECLs for the same function, in | |
5412fedb | 3986 | different namespaces, but let's leave them in in case |
3987 | they have different default arguments. */ | |
3988 | if (fn1 == fn2) | |
cc9a4194 | 3989 | break; |
3990 | } | |
9031d10b | 3991 | |
cc9a4194 | 3992 | /* If we exhausted all of the functions in S1, FN2 is new. */ |
3993 | if (!fns1) | |
3994 | s1 = build_overload (fn2, s1); | |
3995 | } | |
3996 | return s1; | |
3997 | } | |
3998 | ||
64b38a2d | 3999 | /* Returns TRUE iff OLD and NEW are the same entity. |
4000 | ||
4001 | 3 [basic]/3: An entity is a value, object, reference, function, | |
4002 | enumerator, type, class member, template, template specialization, | |
4003 | namespace, parameter pack, or this. | |
4004 | ||
4005 | 7.3.4 [namespace.udir]/4: If name lookup finds a declaration for a name | |
4006 | in two different namespaces, and the declarations do not declare the | |
4007 | same entity and do not declare functions, the use of the name is | |
4008 | ill-formed. */ | |
4009 | ||
4010 | static bool | |
4011 | same_entity_p (tree one, tree two) | |
4012 | { | |
4013 | if (one == two) | |
4014 | return true; | |
4015 | if (!one || !two) | |
4016 | return false; | |
4017 | if (TREE_CODE (one) == TYPE_DECL | |
4018 | && TREE_CODE (two) == TYPE_DECL | |
4019 | && same_type_p (TREE_TYPE (one), TREE_TYPE (two))) | |
4020 | return true; | |
4021 | return false; | |
4022 | } | |
4023 | ||
cc9a4194 | 4024 | /* This should return an error not all definitions define functions. |
4025 | It is not an error if we find two functions with exactly the | |
4026 | same signature, only if these are selected in overload resolution. | |
607a5d68 | 4027 | old is the current set of bindings, new_binding the freshly-found binding. |
cc9a4194 | 4028 | XXX Do we want to give *all* candidates in case of ambiguity? |
4029 | XXX In what way should I treat extern declarations? | |
4030 | XXX I don't want to repeat the entire duplicate_decls here */ | |
4031 | ||
7d6057da | 4032 | static void |
607a5d68 | 4033 | ambiguous_decl (struct scope_binding *old, cxx_binding *new_binding, int flags) |
cc9a4194 | 4034 | { |
4035 | tree val, type; | |
b4df430b | 4036 | gcc_assert (old != NULL); |
8a58dc06 | 4037 | |
4038 | /* Copy the type. */ | |
607a5d68 | 4039 | type = new_binding->type; |
8a58dc06 | 4040 | if (LOOKUP_NAMESPACES_ONLY (flags) |
4041 | || (type && hidden_name_p (type) && !(flags & LOOKUP_HIDDEN))) | |
4042 | type = NULL_TREE; | |
4043 | ||
cc9a4194 | 4044 | /* Copy the value. */ |
607a5d68 | 4045 | val = new_binding->value; |
cc9a4194 | 4046 | if (val) |
8a58dc06 | 4047 | { |
4048 | if (hidden_name_p (val) && !(flags & LOOKUP_HIDDEN)) | |
4049 | val = NULL_TREE; | |
4050 | else | |
4051 | switch (TREE_CODE (val)) | |
4052 | { | |
4053 | case TEMPLATE_DECL: | |
4054 | /* If we expect types or namespaces, and not templates, | |
4055 | or this is not a template class. */ | |
4056 | if ((LOOKUP_QUALIFIERS_ONLY (flags) | |
4057 | && !DECL_CLASS_TEMPLATE_P (val))) | |
4058 | val = NULL_TREE; | |
4059 | break; | |
4060 | case TYPE_DECL: | |
4061 | if (LOOKUP_NAMESPACES_ONLY (flags) | |
4062 | || (type && (flags & LOOKUP_PREFER_TYPES))) | |
4063 | val = NULL_TREE; | |
4064 | break; | |
4065 | case NAMESPACE_DECL: | |
4066 | if (LOOKUP_TYPES_ONLY (flags)) | |
4067 | val = NULL_TREE; | |
4068 | break; | |
4069 | case FUNCTION_DECL: | |
4070 | /* Ignore built-in functions that are still anticipated. */ | |
4071 | if (LOOKUP_QUALIFIERS_ONLY (flags)) | |
4072 | val = NULL_TREE; | |
4073 | break; | |
4074 | default: | |
4075 | if (LOOKUP_QUALIFIERS_ONLY (flags)) | |
4076 | val = NULL_TREE; | |
4077 | } | |
4078 | } | |
4079 | ||
4080 | /* If val is hidden, shift down any class or enumeration name. */ | |
4081 | if (!val) | |
4082 | { | |
4083 | val = type; | |
4084 | type = NULL_TREE; | |
4085 | } | |
9031d10b | 4086 | |
cc9a4194 | 4087 | if (!old->value) |
4088 | old->value = val; | |
64b38a2d | 4089 | else if (val && !same_entity_p (val, old->value)) |
cc9a4194 | 4090 | { |
4091 | if (is_overloaded_fn (old->value) && is_overloaded_fn (val)) | |
653e5405 | 4092 | old->value = merge_functions (old->value, val); |
cc9a4194 | 4093 | else |
4094 | { | |
b62240d5 | 4095 | old->value = tree_cons (NULL_TREE, old->value, |
8a58dc06 | 4096 | build_tree_list (NULL_TREE, val)); |
b62240d5 | 4097 | TREE_TYPE (old->value) = error_mark_node; |
cc9a4194 | 4098 | } |
4099 | } | |
8a58dc06 | 4100 | |
cc9a4194 | 4101 | if (!old->type) |
4102 | old->type = type; | |
4103 | else if (type && old->type != type) | |
4104 | { | |
f8be65bb | 4105 | old->type = tree_cons (NULL_TREE, old->type, |
4106 | build_tree_list (NULL_TREE, type)); | |
4107 | TREE_TYPE (old->type) = error_mark_node; | |
cc9a4194 | 4108 | } |
cc9a4194 | 4109 | } |
4110 | ||
836495aa | 4111 | /* Return the declarations that are members of the namespace NS. */ |
4112 | ||
4113 | tree | |
4114 | cp_namespace_decls (tree ns) | |
4115 | { | |
4116 | return NAMESPACE_LEVEL (ns)->names; | |
4117 | } | |
4118 | ||
4119 | /* Combine prefer_type and namespaces_only into flags. */ | |
4120 | ||
4121 | static int | |
4122 | lookup_flags (int prefer_type, int namespaces_only) | |
4123 | { | |
4124 | if (namespaces_only) | |
4125 | return LOOKUP_PREFER_NAMESPACES; | |
4126 | if (prefer_type > 1) | |
4127 | return LOOKUP_PREFER_TYPES; | |
4128 | if (prefer_type > 0) | |
4129 | return LOOKUP_PREFER_BOTH; | |
4130 | return 0; | |
4131 | } | |
4132 | ||
4133 | /* Given a lookup that returned VAL, use FLAGS to decide if we want to | |
3f3fa556 | 4134 | ignore it or not. Subroutine of lookup_name_real and |
4135 | lookup_type_scope. */ | |
836495aa | 4136 | |
3f3fa556 | 4137 | static bool |
836495aa | 4138 | qualify_lookup (tree val, int flags) |
4139 | { | |
4140 | if (val == NULL_TREE) | |
3f3fa556 | 4141 | return false; |
836495aa | 4142 | if ((flags & LOOKUP_PREFER_NAMESPACES) && TREE_CODE (val) == NAMESPACE_DECL) |
3f3fa556 | 4143 | return true; |
83ae9f05 | 4144 | if (flags & LOOKUP_PREFER_TYPES) |
4145 | { | |
4146 | tree target_val = strip_using_decl (val); | |
4147 | if (TREE_CODE (target_val) == TYPE_DECL | |
4148 | || TREE_CODE (target_val) == TEMPLATE_DECL) | |
4149 | return true; | |
4150 | } | |
836495aa | 4151 | if (flags & (LOOKUP_PREFER_NAMESPACES | LOOKUP_PREFER_TYPES)) |
3f3fa556 | 4152 | return false; |
bcc4b4ea | 4153 | /* Look through lambda things that we shouldn't be able to see. */ |
4154 | if (is_lambda_ignored_entity (val)) | |
e97d2125 | 4155 | return false; |
3f3fa556 | 4156 | return true; |
4157 | } | |
4158 | ||
9031d10b | 4159 | /* Given a lookup that returned VAL, decide if we want to ignore it or |
c1d4295f | 4160 | not based on DECL_ANTICIPATED. */ |
3f3fa556 | 4161 | |
4162 | bool | |
4163 | hidden_name_p (tree val) | |
4164 | { | |
4165 | if (DECL_P (val) | |
4166 | && DECL_LANG_SPECIFIC (val) | |
4167 | && DECL_ANTICIPATED (val)) | |
4168 | return true; | |
4169 | return false; | |
836495aa | 4170 | } |
4171 | ||
c1d4295f | 4172 | /* Remove any hidden friend functions from a possibly overloaded set |
4173 | of functions. */ | |
4174 | ||
4175 | tree | |
4176 | remove_hidden_names (tree fns) | |
4177 | { | |
4178 | if (!fns) | |
4179 | return fns; | |
4180 | ||
4181 | if (TREE_CODE (fns) == FUNCTION_DECL && hidden_name_p (fns)) | |
4182 | fns = NULL_TREE; | |
4183 | else if (TREE_CODE (fns) == OVERLOAD) | |
4184 | { | |
4185 | tree o; | |
4186 | ||
4187 | for (o = fns; o; o = OVL_NEXT (o)) | |
4188 | if (hidden_name_p (OVL_CURRENT (o))) | |
4189 | break; | |
4190 | if (o) | |
4191 | { | |
4192 | tree n = NULL_TREE; | |
4193 | ||
4194 | for (o = fns; o; o = OVL_NEXT (o)) | |
4195 | if (!hidden_name_p (OVL_CURRENT (o))) | |
4196 | n = build_overload (OVL_CURRENT (o), n); | |
4197 | fns = n; | |
4198 | } | |
4199 | } | |
4200 | ||
4201 | return fns; | |
4202 | } | |
4203 | ||
f91726b4 | 4204 | /* Suggest alternatives for NAME, an IDENTIFIER_NODE for which name |
4205 | lookup failed. Search through all available namespaces and print out | |
4206 | possible candidates. */ | |
4207 | ||
4208 | void | |
d3c44c27 | 4209 | suggest_alternatives_for (location_t location, tree name) |
f91726b4 | 4210 | { |
4211 | VEC(tree,heap) *candidates = NULL; | |
4212 | VEC(tree,heap) *namespaces_to_search = NULL; | |
4213 | int max_to_search = PARAM_VALUE (CXX_MAX_NAMESPACES_FOR_DIAGNOSTIC_HELP); | |
4214 | int n_searched = 0; | |
4215 | tree t; | |
4216 | unsigned ix; | |
f91726b4 | 4217 | |
4218 | VEC_safe_push (tree, heap, namespaces_to_search, global_namespace); | |
4219 | ||
4220 | while (!VEC_empty (tree, namespaces_to_search) | |
4221 | && n_searched < max_to_search) | |
4222 | { | |
4223 | tree scope = VEC_pop (tree, namespaces_to_search); | |
4224 | struct scope_binding binding = EMPTY_SCOPE_BINDING; | |
d0ef83bc | 4225 | cp_binding_level *level = NAMESPACE_LEVEL (scope); |
f91726b4 | 4226 | |
4227 | /* Look in this namespace. */ | |
4228 | qualified_lookup_using_namespace (name, scope, &binding, 0); | |
4229 | ||
4230 | n_searched++; | |
4231 | ||
4232 | if (binding.value) | |
4233 | VEC_safe_push (tree, heap, candidates, binding.value); | |
4234 | ||
4235 | /* Add child namespaces. */ | |
4236 | for (t = level->namespaces; t; t = DECL_CHAIN (t)) | |
4237 | VEC_safe_push (tree, heap, namespaces_to_search, t); | |
4238 | } | |
4239 | ||
f91726b4 | 4240 | /* If we stopped before we could examine all namespaces, inform the |
4241 | user. Do this even if we don't have any candidates, since there | |
4242 | might be more candidates further down that we weren't able to | |
4243 | find. */ | |
4244 | if (n_searched >= max_to_search | |
4245 | && !VEC_empty (tree, namespaces_to_search)) | |
d3c44c27 | 4246 | inform (location, |
f91726b4 | 4247 | "maximum limit of %d namespaces searched for %qE", |
4248 | max_to_search, name); | |
4249 | ||
4250 | VEC_free (tree, heap, namespaces_to_search); | |
4251 | ||
4252 | /* Nothing useful to report. */ | |
4253 | if (VEC_empty (tree, candidates)) | |
4254 | return; | |
4255 | ||
d3c44c27 | 4256 | inform_n (location, VEC_length (tree, candidates), |
f91726b4 | 4257 | "suggested alternative:", |
4258 | "suggested alternatives:"); | |
4259 | ||
4260 | FOR_EACH_VEC_ELT (tree, candidates, ix, t) | |
4261 | inform (location_of (t), " %qE", t); | |
4262 | ||
4263 | VEC_free (tree, heap, candidates); | |
4264 | } | |
4265 | ||
836495aa | 4266 | /* Unscoped lookup of a global: iterate over current namespaces, |
f3ccd0ea | 4267 | considering using-directives. */ |
836495aa | 4268 | |
9a49d46b | 4269 | static tree |
6198e8f6 | 4270 | unqualified_namespace_lookup_1 (tree name, int flags) |
836495aa | 4271 | { |
4272 | tree initial = current_decl_namespace (); | |
4273 | tree scope = initial; | |
4274 | tree siter; | |
d0ef83bc | 4275 | cp_binding_level *level; |
836495aa | 4276 | tree val = NULL_TREE; |
836495aa | 4277 | |
836495aa | 4278 | for (; !val; scope = CP_DECL_CONTEXT (scope)) |
4279 | { | |
8a58dc06 | 4280 | struct scope_binding binding = EMPTY_SCOPE_BINDING; |
836495aa | 4281 | cxx_binding *b = |
d0ef83bc | 4282 | cp_binding_level_find_binding_for_name (NAMESPACE_LEVEL (scope), name); |
836495aa | 4283 | |
93dbdf3c | 4284 | if (b) |
f8be65bb | 4285 | ambiguous_decl (&binding, b, flags); |
836495aa | 4286 | |
4287 | /* Add all _DECLs seen through local using-directives. */ | |
4288 | for (level = current_binding_level; | |
4289 | level->kind != sk_namespace; | |
4290 | level = level->level_chain) | |
4291 | if (!lookup_using_namespace (name, &binding, level->using_directives, | |
653e5405 | 4292 | scope, flags)) |
836495aa | 4293 | /* Give up because of error. */ |
6198e8f6 | 4294 | return error_mark_node; |
836495aa | 4295 | |
4296 | /* Add all _DECLs seen through global using-directives. */ | |
4297 | /* XXX local and global using lists should work equally. */ | |
4298 | siter = initial; | |
4299 | while (1) | |
4300 | { | |
4301 | if (!lookup_using_namespace (name, &binding, | |
653e5405 | 4302 | DECL_NAMESPACE_USING (siter), |
f3ccd0ea | 4303 | scope, flags)) |
836495aa | 4304 | /* Give up because of error. */ |
6198e8f6 | 4305 | return error_mark_node; |
836495aa | 4306 | if (siter == scope) break; |
4307 | siter = CP_DECL_CONTEXT (siter); | |
4308 | } | |
4309 | ||
8a58dc06 | 4310 | val = binding.value; |
836495aa | 4311 | if (scope == global_namespace) |
4312 | break; | |
4313 | } | |
6198e8f6 | 4314 | return val; |
4315 | } | |
4316 | ||
4317 | /* Wrapper for unqualified_namespace_lookup_1. */ | |
4318 | ||
4319 | static tree | |
4320 | unqualified_namespace_lookup (tree name, int flags) | |
4321 | { | |
4322 | tree ret; | |
4323 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); | |
4324 | ret = unqualified_namespace_lookup_1 (name, flags); | |
4325 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); | |
4326 | return ret; | |
836495aa | 4327 | } |
4328 | ||
4329 | /* Look up NAME (an IDENTIFIER_NODE) in SCOPE (either a NAMESPACE_DECL | |
4330 | or a class TYPE). If IS_TYPE_P is TRUE, then ignore non-type | |
9031d10b | 4331 | bindings. |
836495aa | 4332 | |
4333 | Returns a DECL (or OVERLOAD, or BASELINK) representing the | |
4334 | declaration found. If no suitable declaration can be found, | |
2cdbcd51 | 4335 | ERROR_MARK_NODE is returned. If COMPLAIN is true and SCOPE is |
836495aa | 4336 | neither a class-type nor a namespace a diagnostic is issued. */ |
4337 | ||
4338 | tree | |
4339 | lookup_qualified_name (tree scope, tree name, bool is_type_p, bool complain) | |
4340 | { | |
4341 | int flags = 0; | |
9485ffb7 | 4342 | tree t = NULL_TREE; |
836495aa | 4343 | |
4344 | if (TREE_CODE (scope) == NAMESPACE_DECL) | |
4345 | { | |
7d6057da | 4346 | struct scope_binding binding = EMPTY_SCOPE_BINDING; |
836495aa | 4347 | |
836495aa | 4348 | if (is_type_p) |
4349 | flags |= LOOKUP_PREFER_TYPES; | |
f3ccd0ea | 4350 | if (qualified_lookup_using_namespace (name, scope, &binding, flags)) |
8a58dc06 | 4351 | t = binding.value; |
836495aa | 4352 | } |
3f00a6c0 | 4353 | else if (cxx_dialect != cxx98 && TREE_CODE (scope) == ENUMERAL_TYPE) |
4354 | t = lookup_enumerator (scope, name); | |
95397ff9 | 4355 | else if (is_class_type (scope, complain)) |
2cbaacd9 | 4356 | t = lookup_member (scope, name, 2, is_type_p, tf_warning_or_error); |
836495aa | 4357 | |
9485ffb7 | 4358 | if (!t) |
4359 | return error_mark_node; | |
4360 | return t; | |
836495aa | 4361 | } |
4362 | ||
63eff20d | 4363 | /* Subroutine of unqualified_namespace_lookup: |
cc9a4194 | 4364 | Add the bindings of NAME in used namespaces to VAL. |
4365 | We are currently looking for names in namespace SCOPE, so we | |
4366 | look through USINGS for using-directives of namespaces | |
4367 | which have SCOPE as a common ancestor with the current scope. | |
4368 | Returns false on errors. */ | |
4369 | ||
9a49d46b | 4370 | static bool |
7d6057da | 4371 | lookup_using_namespace (tree name, struct scope_binding *val, |
4372 | tree usings, tree scope, int flags) | |
cc9a4194 | 4373 | { |
4374 | tree iter; | |
6198e8f6 | 4375 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); |
cc9a4194 | 4376 | /* Iterate over all used namespaces in current, searching for using |
4377 | directives of scope. */ | |
4378 | for (iter = usings; iter; iter = TREE_CHAIN (iter)) | |
4379 | if (TREE_VALUE (iter) == scope) | |
4380 | { | |
653e5405 | 4381 | tree used = ORIGINAL_NAMESPACE (TREE_PURPOSE (iter)); |
4382 | cxx_binding *val1 = | |
d0ef83bc | 4383 | cp_binding_level_find_binding_for_name (NAMESPACE_LEVEL (used), name); |
653e5405 | 4384 | /* Resolve ambiguities. */ |
4385 | if (val1) | |
f8be65bb | 4386 | ambiguous_decl (val, val1, flags); |
cc9a4194 | 4387 | } |
6198e8f6 | 4388 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); |
4389 | return val->value != error_mark_node; | |
cc9a4194 | 4390 | } |
4391 | ||
71893b0a | 4392 | /* Returns true iff VEC contains TARGET. */ |
4393 | ||
4394 | static bool | |
4395 | tree_vec_contains (VEC(tree,gc)* vec, tree target) | |
4396 | { | |
4397 | unsigned int i; | |
4398 | tree elt; | |
48148244 | 4399 | FOR_EACH_VEC_ELT (tree,vec,i,elt) |
71893b0a | 4400 | if (elt == target) |
4401 | return true; | |
4402 | return false; | |
4403 | } | |
4404 | ||
cc9a4194 | 4405 | /* [namespace.qual] |
4406 | Accepts the NAME to lookup and its qualifying SCOPE. | |
4407 | Returns the name/type pair found into the cxx_binding *RESULT, | |
4408 | or false on error. */ | |
4409 | ||
9a49d46b | 4410 | static bool |
7d6057da | 4411 | qualified_lookup_using_namespace (tree name, tree scope, |
4412 | struct scope_binding *result, int flags) | |
cc9a4194 | 4413 | { |
4414 | /* Maintain a list of namespaces visited... */ | |
71893b0a | 4415 | VEC(tree,gc) *seen = NULL; |
4416 | VEC(tree,gc) *seen_inline = NULL; | |
cc9a4194 | 4417 | /* ... and a list of namespace yet to see. */ |
71893b0a | 4418 | VEC(tree,gc) *todo = NULL; |
4419 | VEC(tree,gc) *todo_maybe = NULL; | |
4420 | VEC(tree,gc) *todo_inline = NULL; | |
cc9a4194 | 4421 | tree usings; |
6198e8f6 | 4422 | timevar_start (TV_NAME_LOOKUP); |
cc9a4194 | 4423 | /* Look through namespace aliases. */ |
4424 | scope = ORIGINAL_NAMESPACE (scope); | |
71893b0a | 4425 | |
851d9296 | 4426 | /* Algorithm: Starting with SCOPE, walk through the set of used |
71893b0a | 4427 | namespaces. For each used namespace, look through its inline |
851d9296 | 4428 | namespace set for any bindings and usings. If no bindings are |
4429 | found, add any usings seen to the set of used namespaces. */ | |
71893b0a | 4430 | VEC_safe_push (tree, gc, todo, scope); |
4431 | ||
4432 | while (VEC_length (tree, todo)) | |
cc9a4194 | 4433 | { |
71893b0a | 4434 | bool found_here; |
4435 | scope = VEC_pop (tree, todo); | |
4436 | if (tree_vec_contains (seen, scope)) | |
4437 | continue; | |
4438 | VEC_safe_push (tree, gc, seen, scope); | |
4439 | VEC_safe_push (tree, gc, todo_inline, scope); | |
4440 | ||
4441 | found_here = false; | |
4442 | while (VEC_length (tree, todo_inline)) | |
f69cc1a1 | 4443 | { |
71893b0a | 4444 | cxx_binding *binding; |
4445 | ||
4446 | scope = VEC_pop (tree, todo_inline); | |
4447 | if (tree_vec_contains (seen_inline, scope)) | |
4448 | continue; | |
4449 | VEC_safe_push (tree, gc, seen_inline, scope); | |
4450 | ||
4451 | binding = | |
d0ef83bc | 4452 | cp_binding_level_find_binding_for_name (NAMESPACE_LEVEL (scope), name); |
71893b0a | 4453 | if (binding) |
4454 | { | |
4455 | found_here = true; | |
4456 | ambiguous_decl (result, binding, flags); | |
4457 | } | |
4458 | ||
4459 | for (usings = DECL_NAMESPACE_USING (scope); usings; | |
4460 | usings = TREE_CHAIN (usings)) | |
4461 | if (!TREE_INDIRECT_USING (usings)) | |
4462 | { | |
4463 | if (is_associated_namespace (scope, TREE_PURPOSE (usings))) | |
4464 | VEC_safe_push (tree, gc, todo_inline, TREE_PURPOSE (usings)); | |
4465 | else | |
4466 | VEC_safe_push (tree, gc, todo_maybe, TREE_PURPOSE (usings)); | |
4467 | } | |
f69cc1a1 | 4468 | } |
71893b0a | 4469 | |
4470 | if (found_here) | |
4471 | VEC_truncate (tree, todo_maybe, 0); | |
cc9a4194 | 4472 | else |
71893b0a | 4473 | while (VEC_length (tree, todo_maybe)) |
4474 | VEC_safe_push (tree, gc, todo, VEC_pop (tree, todo_maybe)); | |
4475 | } | |
4476 | VEC_free (tree,gc,todo); | |
4477 | VEC_free (tree,gc,todo_maybe); | |
4478 | VEC_free (tree,gc,todo_inline); | |
4479 | VEC_free (tree,gc,seen); | |
4480 | VEC_free (tree,gc,seen_inline); | |
6198e8f6 | 4481 | timevar_stop (TV_NAME_LOOKUP); |
4482 | return result->value != error_mark_node; | |
cc9a4194 | 4483 | } |
4484 | ||
d8ae6d22 | 4485 | /* Subroutine of outer_binding. |
93306221 | 4486 | |
4487 | Returns TRUE if BINDING is a binding to a template parameter of | |
4488 | SCOPE. In that case SCOPE is the scope of a primary template | |
4489 | parameter -- in the sense of G++, i.e, a template that has its own | |
4490 | template header. | |
4491 | ||
4492 | Returns FALSE otherwise. */ | |
d8ae6d22 | 4493 | |
4494 | static bool | |
4495 | binding_to_template_parms_of_scope_p (cxx_binding *binding, | |
d0ef83bc | 4496 | cp_binding_level *scope) |
d8ae6d22 | 4497 | { |
f5774b88 | 4498 | tree binding_value, tmpl, tinfo; |
4499 | int level; | |
d8ae6d22 | 4500 | |
19159b3e | 4501 | if (!binding || !scope || !scope->this_entity) |
d8ae6d22 | 4502 | return false; |
4503 | ||
4504 | binding_value = binding->value ? binding->value : binding->type; | |
19159b3e | 4505 | tinfo = get_template_info (scope->this_entity); |
d8ae6d22 | 4506 | |
f5774b88 | 4507 | /* BINDING_VALUE must be a template parm. */ |
4508 | if (binding_value == NULL_TREE | |
4509 | || (!DECL_P (binding_value) | |
4510 | || !DECL_TEMPLATE_PARM_P (binding_value))) | |
4511 | return false; | |
4512 | ||
4513 | /* The level of BINDING_VALUE. */ | |
4514 | level = | |
4515 | template_type_parameter_p (binding_value) | |
4516 | ? TEMPLATE_PARM_LEVEL (TEMPLATE_TYPE_PARM_INDEX | |
4517 | (TREE_TYPE (binding_value))) | |
4518 | : TEMPLATE_PARM_LEVEL (DECL_INITIAL (binding_value)); | |
4519 | ||
4520 | /* The template of the current scope, iff said scope is a primary | |
4521 | template. */ | |
4522 | tmpl = (tinfo | |
19159b3e | 4523 | && PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo)) |
f5774b88 | 4524 | ? TI_TEMPLATE (tinfo) |
4525 | : NULL_TREE); | |
4526 | ||
4527 | /* If the level of the parm BINDING_VALUE equals the depth of TMPL, | |
4528 | then BINDING_VALUE is a parameter of TMPL. */ | |
4529 | return (tmpl && level == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl))); | |
d8ae6d22 | 4530 | } |
4531 | ||
d09ae6d5 | 4532 | /* Return the innermost non-namespace binding for NAME from a scope |
d8ae6d22 | 4533 | containing BINDING, or, if BINDING is NULL, the current scope. |
4534 | Please note that for a given template, the template parameters are | |
4535 | considered to be in the scope containing the current scope. | |
4536 | If CLASS_P is false, then class bindings are ignored. */ | |
d09ae6d5 | 4537 | |
4538 | cxx_binding * | |
9031d10b | 4539 | outer_binding (tree name, |
d09ae6d5 | 4540 | cxx_binding *binding, |
4541 | bool class_p) | |
4542 | { | |
4543 | cxx_binding *outer; | |
d0ef83bc | 4544 | cp_binding_level *scope; |
4545 | cp_binding_level *outer_scope; | |
d09ae6d5 | 4546 | |
4547 | if (binding) | |
4548 | { | |
4549 | scope = binding->scope->level_chain; | |
4550 | outer = binding->previous; | |
4551 | } | |
4552 | else | |
4553 | { | |
4554 | scope = current_binding_level; | |
4555 | outer = IDENTIFIER_BINDING (name); | |
4556 | } | |
4557 | outer_scope = outer ? outer->scope : NULL; | |
4558 | ||
4559 | /* Because we create class bindings lazily, we might be missing a | |
4560 | class binding for NAME. If there are any class binding levels | |
4561 | between the LAST_BINDING_LEVEL and the scope in which OUTER was | |
4562 | declared, we must lookup NAME in those class scopes. */ | |
4563 | if (class_p) | |
4564 | while (scope && scope != outer_scope && scope->kind != sk_namespace) | |
4565 | { | |
9031d10b | 4566 | if (scope->kind == sk_class) |
d09ae6d5 | 4567 | { |
4568 | cxx_binding *class_binding; | |
9031d10b | 4569 | |
d09ae6d5 | 4570 | class_binding = get_class_binding (name, scope); |
4571 | if (class_binding) | |
4572 | { | |
4573 | /* Thread this new class-scope binding onto the | |
4574 | IDENTIFIER_BINDING list so that future lookups | |
4575 | find it quickly. */ | |
4576 | class_binding->previous = outer; | |
4577 | if (binding) | |
4578 | binding->previous = class_binding; | |
4579 | else | |
4580 | IDENTIFIER_BINDING (name) = class_binding; | |
4581 | return class_binding; | |
4582 | } | |
4583 | } | |
f0f118bd | 4584 | /* If we are in a member template, the template parms of the member |
4585 | template are considered to be inside the scope of the containing | |
4586 | class, but within G++ the class bindings are all pushed between the | |
4587 | template parms and the function body. So if the outer binding is | |
4588 | a template parm for the current scope, return it now rather than | |
4589 | look for a class binding. */ | |
d8ae6d22 | 4590 | if (outer_scope && outer_scope->kind == sk_template_parms |
4591 | && binding_to_template_parms_of_scope_p (outer, scope)) | |
4592 | return outer; | |
4593 | ||
d09ae6d5 | 4594 | scope = scope->level_chain; |
4595 | } | |
4596 | ||
4597 | return outer; | |
4598 | } | |
4599 | ||
4600 | /* Return the innermost block-scope or class-scope value binding for | |
4601 | NAME, or NULL_TREE if there is no such binding. */ | |
4602 | ||
4603 | tree | |
4604 | innermost_non_namespace_value (tree name) | |
4605 | { | |
4606 | cxx_binding *binding; | |
4607 | binding = outer_binding (name, /*binding=*/NULL, /*class_p=*/true); | |
4608 | return binding ? binding->value : NULL_TREE; | |
4609 | } | |
4610 | ||
836495aa | 4611 | /* Look up NAME in the current binding level and its superiors in the |
4612 | namespace of variables, functions and typedefs. Return a ..._DECL | |
4613 | node of some kind representing its definition if there is only one | |
4614 | such declaration, or return a TREE_LIST with all the overloaded | |
4615 | definitions if there are many, or return 0 if it is undefined. | |
3f3fa556 | 4616 | Hidden name, either friend declaration or built-in function, are |
4617 | not ignored. | |
836495aa | 4618 | |
4619 | If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces. | |
4620 | If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces). | |
4621 | Otherwise we prefer non-TYPE_DECLs. | |
4622 | ||
fa26c7a9 | 4623 | If NONCLASS is nonzero, bindings in class scopes are ignored. If |
4624 | BLOCK_P is false, bindings in block scopes are ignored. */ | |
836495aa | 4625 | |
6198e8f6 | 4626 | static tree |
4627 | lookup_name_real_1 (tree name, int prefer_type, int nonclass, bool block_p, | |
4628 | int namespaces_only, int flags) | |
836495aa | 4629 | { |
4630 | cxx_binding *iter; | |
4631 | tree val = NULL_TREE; | |
4632 | ||
836495aa | 4633 | /* Conversion operators are handled specially because ordinary |
4634 | unqualified name lookup will not find template conversion | |
4635 | operators. */ | |
22102476 | 4636 | if (IDENTIFIER_TYPENAME_P (name)) |
836495aa | 4637 | { |
d0ef83bc | 4638 | cp_binding_level *level; |
836495aa | 4639 | |
9031d10b | 4640 | for (level = current_binding_level; |
836495aa | 4641 | level && level->kind != sk_namespace; |
4642 | level = level->level_chain) | |
4643 | { | |
4644 | tree class_type; | |
4645 | tree operators; | |
9031d10b | 4646 | |
4647 | /* A conversion operator can only be declared in a class | |
836495aa | 4648 | scope. */ |
4649 | if (level->kind != sk_class) | |
4650 | continue; | |
9031d10b | 4651 | |
836495aa | 4652 | /* Lookup the conversion operator in the class. */ |
4653 | class_type = level->this_entity; | |
4654 | operators = lookup_fnfields (class_type, name, /*protect=*/0); | |
4655 | if (operators) | |
6198e8f6 | 4656 | return operators; |
836495aa | 4657 | } |
4658 | ||
6198e8f6 | 4659 | return NULL_TREE; |
836495aa | 4660 | } |
4661 | ||
4662 | flags |= lookup_flags (prefer_type, namespaces_only); | |
4663 | ||
4664 | /* First, look in non-namespace scopes. */ | |
4665 | ||
4666 | if (current_class_type == NULL_TREE) | |
4667 | nonclass = 1; | |
4668 | ||
614697c5 | 4669 | if (block_p || !nonclass) |
d09ae6d5 | 4670 | for (iter = outer_binding (name, NULL, !nonclass); |
4671 | iter; | |
4672 | iter = outer_binding (name, iter, !nonclass)) | |
614697c5 | 4673 | { |
4674 | tree binding; | |
9031d10b | 4675 | |
614697c5 | 4676 | /* Skip entities we don't want. */ |
4677 | if (LOCAL_BINDING_P (iter) ? !block_p : nonclass) | |
4678 | continue; | |
9031d10b | 4679 | |
614697c5 | 4680 | /* If this is the kind of thing we're looking for, we're done. */ |
1fb8fb56 | 4681 | if (qualify_lookup (iter->value, flags)) |
614697c5 | 4682 | binding = iter->value; |
4683 | else if ((flags & LOOKUP_PREFER_TYPES) | |
1fb8fb56 | 4684 | && qualify_lookup (iter->type, flags)) |
614697c5 | 4685 | binding = iter->type; |
4686 | else | |
4687 | binding = NULL_TREE; | |
9031d10b | 4688 | |
614697c5 | 4689 | if (binding) |
4690 | { | |
eca1687b | 4691 | if (hidden_name_p (binding)) |
4692 | { | |
f9769e4a | 4693 | /* A non namespace-scope binding can only be hidden in the |
4694 | presence of a local class, due to friend declarations. | |
4695 | ||
eca1687b | 4696 | In particular, consider: |
4697 | ||
f9769e4a | 4698 | struct C; |
eca1687b | 4699 | void f() { |
4700 | struct A { | |
4701 | friend struct B; | |
f9769e4a | 4702 | friend struct C; |
4703 | void g() { | |
4704 | B* b; // error: B is hidden | |
4705 | C* c; // OK, finds ::C | |
4706 | } | |
4707 | }; | |
4708 | B *b; // error: B is hidden | |
4709 | C *c; // OK, finds ::C | |
eca1687b | 4710 | struct B {}; |
f9769e4a | 4711 | B *bb; // OK |
eca1687b | 4712 | } |
4713 | ||
4714 | The standard says that "B" is a local class in "f" | |
4715 | (but not nested within "A") -- but that name lookup | |
4716 | for "B" does not find this declaration until it is | |
4717 | declared directly with "f". | |
4718 | ||
4719 | In particular: | |
4720 | ||
4721 | [class.friend] | |
4722 | ||
4723 | If a friend declaration appears in a local class and | |
4724 | the name specified is an unqualified name, a prior | |
4725 | declaration is looked up without considering scopes | |
4726 | that are outside the innermost enclosing non-class | |
f9769e4a | 4727 | scope. For a friend function declaration, if there is |
4728 | no prior declaration, the program is ill-formed. For a | |
4729 | friend class declaration, if there is no prior | |
4730 | declaration, the class that is specified belongs to the | |
4731 | innermost enclosing non-class scope, but if it is | |
4732 | subsequently referenced, its name is not found by name | |
4733 | lookup until a matching declaration is provided in the | |
4734 | innermost enclosing nonclass scope. | |
4735 | ||
4736 | So just keep looking for a non-hidden binding. | |
eca1687b | 4737 | */ |
f9769e4a | 4738 | gcc_assert (TREE_CODE (binding) == TYPE_DECL); |
4739 | continue; | |
eca1687b | 4740 | } |
614697c5 | 4741 | val = binding; |
4742 | break; | |
4743 | } | |
4744 | } | |
836495aa | 4745 | |
4746 | /* Now lookup in namespace scopes. */ | |
4747 | if (!val) | |
1fadf2c8 | 4748 | val = unqualified_namespace_lookup (name, flags); |
836495aa | 4749 | |
3f8400fa | 4750 | /* If we have a single function from a using decl, pull it out. */ |
4751 | if (val && TREE_CODE (val) == OVERLOAD && !really_overloaded_fn (val)) | |
4752 | val = OVL_FUNCTION (val); | |
836495aa | 4753 | |
6198e8f6 | 4754 | return val; |
4755 | } | |
4756 | ||
4757 | /* Wrapper for lookup_name_real_1. */ | |
4758 | ||
4759 | tree | |
4760 | lookup_name_real (tree name, int prefer_type, int nonclass, bool block_p, | |
4761 | int namespaces_only, int flags) | |
4762 | { | |
4763 | tree ret; | |
4764 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); | |
4765 | ret = lookup_name_real_1 (name, prefer_type, nonclass, block_p, | |
4766 | namespaces_only, flags); | |
4767 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); | |
4768 | return ret; | |
836495aa | 4769 | } |
4770 | ||
4771 | tree | |
4772 | lookup_name_nonclass (tree name) | |
4773 | { | |
c4698a21 | 4774 | return lookup_name_real (name, 0, 1, /*block_p=*/true, 0, 0); |
836495aa | 4775 | } |
4776 | ||
4777 | tree | |
f352a3fb | 4778 | lookup_function_nonclass (tree name, VEC(tree,gc) *args, bool block_p) |
836495aa | 4779 | { |
9031d10b | 4780 | return |
4781 | lookup_arg_dependent (name, | |
c4698a21 | 4782 | lookup_name_real (name, 0, 1, block_p, 0, 0), |
9dd72ec4 | 4783 | args, false); |
836495aa | 4784 | } |
4785 | ||
4786 | tree | |
d1c41717 | 4787 | lookup_name (tree name) |
836495aa | 4788 | { |
c4698a21 | 4789 | return lookup_name_real (name, 0, 0, /*block_p=*/true, 0, 0); |
836495aa | 4790 | } |
4791 | ||
799f877e | 4792 | tree |
d1c41717 | 4793 | lookup_name_prefer_type (tree name, int prefer_type) |
799f877e | 4794 | { |
c4698a21 | 4795 | return lookup_name_real (name, prefer_type, 0, /*block_p=*/true, 0, 0); |
799f877e | 4796 | } |
4797 | ||
e1316b34 | 4798 | /* Look up NAME for type used in elaborated name specifier in |
1fadf2c8 | 4799 | the scopes given by SCOPE. SCOPE can be either TS_CURRENT or |
352baa70 | 4800 | TS_WITHIN_ENCLOSING_NON_CLASS. Although not implied by the |
4801 | name, more scopes are checked if cleanup or template parameter | |
4802 | scope is encountered. | |
1fadf2c8 | 4803 | |
4804 | Unlike lookup_name_real, we make sure that NAME is actually | |
352baa70 | 4805 | declared in the desired scope, not from inheritance, nor using |
4806 | directive. For using declaration, there is DR138 still waiting | |
cd7043f9 | 4807 | to be resolved. Hidden name coming from an earlier friend |
3f3fa556 | 4808 | declaration is also returned. |
352baa70 | 4809 | |
4810 | A TYPE_DECL best matching the NAME is returned. Catching error | |
4811 | and issuing diagnostics are caller's responsibility. */ | |
e1316b34 | 4812 | |
6198e8f6 | 4813 | static tree |
4814 | lookup_type_scope_1 (tree name, tag_scope scope) | |
e1316b34 | 4815 | { |
4816 | cxx_binding *iter = NULL; | |
4817 | tree val = NULL_TREE; | |
4818 | ||
e1316b34 | 4819 | /* Look in non-namespace scope first. */ |
4820 | if (current_binding_level->kind != sk_namespace) | |
4821 | iter = outer_binding (name, NULL, /*class_p=*/ true); | |
4822 | for (; iter; iter = outer_binding (name, iter, /*class_p=*/ true)) | |
4823 | { | |
4824 | /* Check if this is the kind of thing we're looking for. | |
9031d10b | 4825 | If SCOPE is TS_CURRENT, also make sure it doesn't come from |
1fadf2c8 | 4826 | base class. For ITER->VALUE, we can simply use |
9031d10b | 4827 | INHERITED_VALUE_BINDING_P. For ITER->TYPE, we have to use |
1fadf2c8 | 4828 | our own check. |
e1316b34 | 4829 | |
4830 | We check ITER->TYPE before ITER->VALUE in order to handle | |
4831 | typedef struct C {} C; | |
4832 | correctly. */ | |
4833 | ||
4834 | if (qualify_lookup (iter->type, LOOKUP_PREFER_TYPES) | |
1fadf2c8 | 4835 | && (scope != ts_current |
4836 | || LOCAL_BINDING_P (iter) | |
e1316b34 | 4837 | || DECL_CONTEXT (iter->type) == iter->scope->this_entity)) |
4838 | val = iter->type; | |
1fadf2c8 | 4839 | else if ((scope != ts_current |
4840 | || !INHERITED_VALUE_BINDING_P (iter)) | |
e1316b34 | 4841 | && qualify_lookup (iter->value, LOOKUP_PREFER_TYPES)) |
4842 | val = iter->value; | |
4843 | ||
4844 | if (val) | |
4845 | break; | |
4846 | } | |
4847 | ||
4848 | /* Look in namespace scope. */ | |
4849 | if (!val) | |
4850 | { | |
d0ef83bc | 4851 | iter = cp_binding_level_find_binding_for_name |
e1316b34 | 4852 | (NAMESPACE_LEVEL (current_decl_namespace ()), name); |
4853 | ||
4854 | if (iter) | |
4855 | { | |
3f3fa556 | 4856 | /* If this is the kind of thing we're looking for, we're done. */ |
352baa70 | 4857 | if (qualify_lookup (iter->type, LOOKUP_PREFER_TYPES)) |
e1316b34 | 4858 | val = iter->type; |
352baa70 | 4859 | else if (qualify_lookup (iter->value, LOOKUP_PREFER_TYPES)) |
e1316b34 | 4860 | val = iter->value; |
4861 | } | |
9031d10b | 4862 | |
e1316b34 | 4863 | } |
4864 | ||
1fadf2c8 | 4865 | /* Type found, check if it is in the allowed scopes, ignoring cleanup |
e1316b34 | 4866 | and template parameter scopes. */ |
4867 | if (val) | |
4868 | { | |
d0ef83bc | 4869 | cp_binding_level *b = current_binding_level; |
e1316b34 | 4870 | while (b) |
4871 | { | |
4872 | if (iter->scope == b) | |
6198e8f6 | 4873 | return val; |
e1316b34 | 4874 | |
075c85d2 | 4875 | if (b->kind == sk_cleanup || b->kind == sk_template_parms |
4876 | || b->kind == sk_function_parms) | |
e1316b34 | 4877 | b = b->level_chain; |
1fadf2c8 | 4878 | else if (b->kind == sk_class |
4879 | && scope == ts_within_enclosing_non_class) | |
4880 | b = b->level_chain; | |
e1316b34 | 4881 | else |
4882 | break; | |
4883 | } | |
4884 | } | |
4885 | ||
6198e8f6 | 4886 | return NULL_TREE; |
e1316b34 | 4887 | } |
6198e8f6 | 4888 | |
4889 | /* Wrapper for lookup_type_scope_1. */ | |
4890 | ||
4891 | tree | |
4892 | lookup_type_scope (tree name, tag_scope scope) | |
4893 | { | |
4894 | tree ret; | |
4895 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); | |
4896 | ret = lookup_type_scope_1 (name, scope); | |
4897 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); | |
4898 | return ret; | |
4899 | } | |
4900 | ||
e1316b34 | 4901 | |
836495aa | 4902 | /* Similar to `lookup_name' but look only in the innermost non-class |
4903 | binding level. */ | |
4904 | ||
6198e8f6 | 4905 | static tree |
4906 | lookup_name_innermost_nonclass_level_1 (tree name) | |
836495aa | 4907 | { |
d0ef83bc | 4908 | cp_binding_level *b; |
836495aa | 4909 | tree t = NULL_TREE; |
4910 | ||
836495aa | 4911 | b = innermost_nonclass_level (); |
4912 | ||
4913 | if (b->kind == sk_namespace) | |
4914 | { | |
4915 | t = IDENTIFIER_NAMESPACE_VALUE (name); | |
4916 | ||
4917 | /* extern "C" function() */ | |
4918 | if (t != NULL_TREE && TREE_CODE (t) == TREE_LIST) | |
4919 | t = TREE_VALUE (t); | |
4920 | } | |
4921 | else if (IDENTIFIER_BINDING (name) | |
4922 | && LOCAL_BINDING_P (IDENTIFIER_BINDING (name))) | |
4923 | { | |
d09ae6d5 | 4924 | cxx_binding *binding; |
4925 | binding = IDENTIFIER_BINDING (name); | |
836495aa | 4926 | while (1) |
4927 | { | |
d09ae6d5 | 4928 | if (binding->scope == b |
4929 | && !(TREE_CODE (binding->value) == VAR_DECL | |
4930 | && DECL_DEAD_FOR_LOCAL (binding->value))) | |
6198e8f6 | 4931 | return binding->value; |
836495aa | 4932 | |
4933 | if (b->kind == sk_cleanup) | |
4934 | b = b->level_chain; | |
4935 | else | |
4936 | break; | |
4937 | } | |
4938 | } | |
4939 | ||
6198e8f6 | 4940 | return t; |
836495aa | 4941 | } |
4942 | ||
6198e8f6 | 4943 | /* Wrapper for lookup_name_innermost_nonclass_level_1. */ |
4944 | ||
4945 | tree | |
4946 | lookup_name_innermost_nonclass_level (tree name) | |
4947 | { | |
4948 | tree ret; | |
4949 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); | |
4950 | ret = lookup_name_innermost_nonclass_level_1 (name); | |
4951 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); | |
4952 | return ret; | |
4953 | } | |
4954 | ||
4955 | ||
74d6b34b | 4956 | /* Returns true iff DECL is a block-scope extern declaration of a function |
4957 | or variable. */ | |
4958 | ||
4959 | bool | |
4960 | is_local_extern (tree decl) | |
4961 | { | |
4962 | cxx_binding *binding; | |
4963 | ||
4964 | /* For functions, this is easy. */ | |
4965 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
4966 | return DECL_LOCAL_FUNCTION_P (decl); | |
4967 | ||
4968 | if (TREE_CODE (decl) != VAR_DECL) | |
4969 | return false; | |
4970 | if (!current_function_decl) | |
4971 | return false; | |
4972 | ||
4973 | /* For variables, this is not easy. We need to look at the binding stack | |
4974 | for the identifier to see whether the decl we have is a local. */ | |
4975 | for (binding = IDENTIFIER_BINDING (DECL_NAME (decl)); | |
4976 | binding && binding->scope->kind != sk_namespace; | |
4977 | binding = binding->previous) | |
4978 | if (binding->value == decl) | |
4979 | return LOCAL_BINDING_P (binding); | |
4980 | ||
4981 | return false; | |
4982 | } | |
4983 | ||
e1316b34 | 4984 | /* Like lookup_name_innermost_nonclass_level, but for types. */ |
836495aa | 4985 | |
9a49d46b | 4986 | static tree |
836495aa | 4987 | lookup_type_current_level (tree name) |
4988 | { | |
cd16867a | 4989 | tree t = NULL_TREE; |
836495aa | 4990 | |
6198e8f6 | 4991 | timevar_start (TV_NAME_LOOKUP); |
b4df430b | 4992 | gcc_assert (current_binding_level->kind != sk_namespace); |
836495aa | 4993 | |
4994 | if (REAL_IDENTIFIER_TYPE_VALUE (name) != NULL_TREE | |
4995 | && REAL_IDENTIFIER_TYPE_VALUE (name) != global_type_node) | |
4996 | { | |
d0ef83bc | 4997 | cp_binding_level *b = current_binding_level; |
836495aa | 4998 | while (1) |
4999 | { | |
5000 | if (purpose_member (name, b->type_shadowed)) | |
6198e8f6 | 5001 | { |
5002 | t = REAL_IDENTIFIER_TYPE_VALUE (name); | |
5003 | break; | |
5004 | } | |
836495aa | 5005 | if (b->kind == sk_cleanup) |
5006 | b = b->level_chain; | |
5007 | else | |
5008 | break; | |
5009 | } | |
5010 | } | |
5011 | ||
6198e8f6 | 5012 | timevar_stop (TV_NAME_LOOKUP); |
5013 | return t; | |
836495aa | 5014 | } |
5015 | ||
cc9a4194 | 5016 | /* [basic.lookup.koenig] */ |
5017 | /* A nonzero return value in the functions below indicates an error. */ | |
5018 | ||
5019 | struct arg_lookup | |
5020 | { | |
5021 | tree name; | |
f352a3fb | 5022 | VEC(tree,gc) *args; |
1df3c246 | 5023 | VEC(tree,gc) *namespaces; |
5024 | VEC(tree,gc) *classes; | |
cc9a4194 | 5025 | tree functions; |
d9e82d44 | 5026 | struct pointer_set_t *fn_set; |
cc9a4194 | 5027 | }; |
5028 | ||
5029 | static bool arg_assoc (struct arg_lookup*, tree); | |
5030 | static bool arg_assoc_args (struct arg_lookup*, tree); | |
f352a3fb | 5031 | static bool arg_assoc_args_vec (struct arg_lookup*, VEC(tree,gc) *); |
cc9a4194 | 5032 | static bool arg_assoc_type (struct arg_lookup*, tree); |
5033 | static bool add_function (struct arg_lookup *, tree); | |
5034 | static bool arg_assoc_namespace (struct arg_lookup *, tree); | |
8e31c186 | 5035 | static bool arg_assoc_class_only (struct arg_lookup *, tree); |
5036 | static bool arg_assoc_bases (struct arg_lookup *, tree); | |
cc9a4194 | 5037 | static bool arg_assoc_class (struct arg_lookup *, tree); |
5038 | static bool arg_assoc_template_arg (struct arg_lookup*, tree); | |
5039 | ||
5040 | /* Add a function to the lookup structure. | |
5041 | Returns true on error. */ | |
5042 | ||
5043 | static bool | |
5044 | add_function (struct arg_lookup *k, tree fn) | |
5045 | { | |
0e6beee6 | 5046 | if (!is_overloaded_fn (fn)) |
5047 | /* All names except those of (possibly overloaded) functions and | |
5048 | function templates are ignored. */; | |
d9e82d44 | 5049 | else if (k->fn_set && pointer_set_insert (k->fn_set, fn)) |
5050 | /* It's already in the list. */; | |
0e6beee6 | 5051 | else if (!k->functions) |
cc9a4194 | 5052 | k->functions = fn; |
5053 | else if (fn == k->functions) | |
5054 | ; | |
cc9a4194 | 5055 | else |
b75fa3a6 | 5056 | { |
5057 | k->functions = build_overload (fn, k->functions); | |
5058 | if (TREE_CODE (k->functions) == OVERLOAD) | |
5059 | OVL_ARG_DEPENDENT (k->functions) = true; | |
5060 | } | |
cc9a4194 | 5061 | |
5062 | return false; | |
5063 | } | |
5064 | ||
a5ed46c9 | 5065 | /* Returns true iff CURRENT has declared itself to be an associated |
5066 | namespace of SCOPE via a strong using-directive (or transitive chain | |
5067 | thereof). Both are namespaces. */ | |
5068 | ||
5069 | bool | |
5070 | is_associated_namespace (tree current, tree scope) | |
5071 | { | |
7c533e5e | 5072 | VEC(tree,gc) *seen = make_tree_vector (); |
5073 | VEC(tree,gc) *todo = make_tree_vector (); | |
a5ed46c9 | 5074 | tree t; |
7c533e5e | 5075 | bool ret; |
5076 | ||
a5ed46c9 | 5077 | while (1) |
5078 | { | |
5079 | if (scope == current) | |
7c533e5e | 5080 | { |
5081 | ret = true; | |
5082 | break; | |
5083 | } | |
5084 | VEC_safe_push (tree, gc, seen, scope); | |
a5ed46c9 | 5085 | for (t = DECL_NAMESPACE_ASSOCIATIONS (scope); t; t = TREE_CHAIN (t)) |
7c533e5e | 5086 | if (!vec_member (TREE_PURPOSE (t), seen)) |
5087 | VEC_safe_push (tree, gc, todo, TREE_PURPOSE (t)); | |
5088 | if (!VEC_empty (tree, todo)) | |
a5ed46c9 | 5089 | { |
7c533e5e | 5090 | scope = VEC_last (tree, todo); |
5091 | VEC_pop (tree, todo); | |
a5ed46c9 | 5092 | } |
5093 | else | |
7c533e5e | 5094 | { |
5095 | ret = false; | |
5096 | break; | |
5097 | } | |
a5ed46c9 | 5098 | } |
7c533e5e | 5099 | |
5100 | release_tree_vector (seen); | |
5101 | release_tree_vector (todo); | |
5102 | ||
5103 | return ret; | |
a5ed46c9 | 5104 | } |
5105 | ||
cc9a4194 | 5106 | /* Add functions of a namespace to the lookup structure. |
5107 | Returns true on error. */ | |
5108 | ||
5109 | static bool | |
5110 | arg_assoc_namespace (struct arg_lookup *k, tree scope) | |
5111 | { | |
5112 | tree value; | |
5113 | ||
1df3c246 | 5114 | if (vec_member (scope, k->namespaces)) |
5115 | return false; | |
5116 | VEC_safe_push (tree, gc, k->namespaces, scope); | |
a5ed46c9 | 5117 | |
5118 | /* Check out our super-users. */ | |
5119 | for (value = DECL_NAMESPACE_ASSOCIATIONS (scope); value; | |
5120 | value = TREE_CHAIN (value)) | |
5121 | if (arg_assoc_namespace (k, TREE_PURPOSE (value))) | |
5122 | return true; | |
9031d10b | 5123 | |
93635a8e | 5124 | /* Also look down into inline namespaces. */ |
5125 | for (value = DECL_NAMESPACE_USING (scope); value; | |
5126 | value = TREE_CHAIN (value)) | |
5127 | if (is_associated_namespace (scope, TREE_PURPOSE (value))) | |
5128 | if (arg_assoc_namespace (k, TREE_PURPOSE (value))) | |
5129 | return true; | |
5130 | ||
cc9a4194 | 5131 | value = namespace_binding (k->name, scope); |
5132 | if (!value) | |
5133 | return false; | |
5134 | ||
5135 | for (; value; value = OVL_NEXT (value)) | |
c1d4295f | 5136 | { |
5137 | /* We don't want to find arbitrary hidden functions via argument | |
5138 | dependent lookup. We only want to find friends of associated | |
8e31c186 | 5139 | classes, which we'll do via arg_assoc_class. */ |
c1d4295f | 5140 | if (hidden_name_p (OVL_CURRENT (value))) |
8e31c186 | 5141 | continue; |
c1d4295f | 5142 | |
5143 | if (add_function (k, OVL_CURRENT (value))) | |
5144 | return true; | |
5145 | } | |
9031d10b | 5146 | |
cc9a4194 | 5147 | return false; |
5148 | } | |
5149 | ||
5150 | /* Adds everything associated with a template argument to the lookup | |
5151 | structure. Returns true on error. */ | |
5152 | ||
5153 | static bool | |
5154 | arg_assoc_template_arg (struct arg_lookup *k, tree arg) | |
5155 | { | |
5156 | /* [basic.lookup.koenig] | |
5157 | ||
5158 | If T is a template-id, its associated namespaces and classes are | |
5159 | ... the namespaces and classes associated with the types of the | |
5160 | template arguments provided for template type parameters | |
5161 | (excluding template template parameters); the namespaces in which | |
5162 | any template template arguments are defined; and the classes in | |
5163 | which any member templates used as template template arguments | |
5164 | are defined. [Note: non-type template arguments do not | |
5165 | contribute to the set of associated namespaces. ] */ | |
5166 | ||
5167 | /* Consider first template template arguments. */ | |
5168 | if (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM | |
5169 | || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE) | |
5170 | return false; | |
5171 | else if (TREE_CODE (arg) == TEMPLATE_DECL) | |
5172 | { | |
5173 | tree ctx = CP_DECL_CONTEXT (arg); | |
5174 | ||
5175 | /* It's not a member template. */ | |
5176 | if (TREE_CODE (ctx) == NAMESPACE_DECL) | |
653e5405 | 5177 | return arg_assoc_namespace (k, ctx); |
cc9a4194 | 5178 | /* Otherwise, it must be member template. */ |
9031d10b | 5179 | else |
8e31c186 | 5180 | return arg_assoc_class_only (k, ctx); |
cc9a4194 | 5181 | } |
0423517a | 5182 | /* It's an argument pack; handle it recursively. */ |
5183 | else if (ARGUMENT_PACK_P (arg)) | |
5184 | { | |
5185 | tree args = ARGUMENT_PACK_ARGS (arg); | |
5186 | int i, len = TREE_VEC_LENGTH (args); | |
5187 | for (i = 0; i < len; ++i) | |
5188 | if (arg_assoc_template_arg (k, TREE_VEC_ELT (args, i))) | |
5189 | return true; | |
5190 | ||
5191 | return false; | |
5192 | } | |
cc9a4194 | 5193 | /* It's not a template template argument, but it is a type template |
5194 | argument. */ | |
5195 | else if (TYPE_P (arg)) | |
5196 | return arg_assoc_type (k, arg); | |
5197 | /* It's a non-type template argument. */ | |
5198 | else | |
5199 | return false; | |
5200 | } | |
5201 | ||
8e31c186 | 5202 | /* Adds the class and its friends to the lookup structure. |
cc9a4194 | 5203 | Returns true on error. */ |
5204 | ||
5205 | static bool | |
8e31c186 | 5206 | arg_assoc_class_only (struct arg_lookup *k, tree type) |
cc9a4194 | 5207 | { |
5208 | tree list, friends, context; | |
9031d10b | 5209 | |
8e31c186 | 5210 | /* Backend-built structures, such as __builtin_va_list, aren't |
cc9a4194 | 5211 | affected by all this. */ |
5212 | if (!CLASS_TYPE_P (type)) | |
5213 | return false; | |
5214 | ||
e4e8c884 | 5215 | context = decl_namespace_context (type); |
cc9a4194 | 5216 | if (arg_assoc_namespace (k, context)) |
5217 | return true; | |
46842e29 | 5218 | |
ad6d03bb | 5219 | complete_type (type); |
5220 | ||
cc9a4194 | 5221 | /* Process friends. */ |
9031d10b | 5222 | for (list = DECL_FRIENDLIST (TYPE_MAIN_DECL (type)); list; |
cc9a4194 | 5223 | list = TREE_CHAIN (list)) |
5224 | if (k->name == FRIEND_NAME (list)) | |
9031d10b | 5225 | for (friends = FRIEND_DECLS (list); friends; |
cc9a4194 | 5226 | friends = TREE_CHAIN (friends)) |
334f6ce1 | 5227 | { |
5228 | tree fn = TREE_VALUE (friends); | |
5229 | ||
5230 | /* Only interested in global functions with potentially hidden | |
5231 | (i.e. unqualified) declarations. */ | |
5232 | if (CP_DECL_CONTEXT (fn) != context) | |
5233 | continue; | |
5234 | /* Template specializations are never found by name lookup. | |
5235 | (Templates themselves can be found, but not template | |
5236 | specializations.) */ | |
5237 | if (TREE_CODE (fn) == FUNCTION_DECL && DECL_USE_TEMPLATE (fn)) | |
5238 | continue; | |
5239 | if (add_function (k, fn)) | |
cc9a4194 | 5240 | return true; |
334f6ce1 | 5241 | } |
cc9a4194 | 5242 | |
8e31c186 | 5243 | return false; |
5244 | } | |
5245 | ||
5246 | /* Adds the class and its bases to the lookup structure. | |
5247 | Returns true on error. */ | |
5248 | ||
5249 | static bool | |
5250 | arg_assoc_bases (struct arg_lookup *k, tree type) | |
5251 | { | |
5252 | if (arg_assoc_class_only (k, type)) | |
5253 | return true; | |
5254 | ||
5255 | if (TYPE_BINFO (type)) | |
5256 | { | |
5257 | /* Process baseclasses. */ | |
5258 | tree binfo, base_binfo; | |
5259 | int i; | |
5260 | ||
5261 | for (binfo = TYPE_BINFO (type), i = 0; | |
5262 | BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) | |
5263 | if (arg_assoc_bases (k, BINFO_TYPE (base_binfo))) | |
5264 | return true; | |
5265 | } | |
5266 | ||
5267 | return false; | |
5268 | } | |
5269 | ||
5270 | /* Adds everything associated with a class argument type to the lookup | |
5271 | structure. Returns true on error. | |
5272 | ||
5273 | If T is a class type (including unions), its associated classes are: the | |
5274 | class itself; the class of which it is a member, if any; and its direct | |
5275 | and indirect base classes. Its associated namespaces are the namespaces | |
5276 | of which its associated classes are members. Furthermore, if T is a | |
5277 | class template specialization, its associated namespaces and classes | |
5278 | also include: the namespaces and classes associated with the types of | |
5279 | the template arguments provided for template type parameters (excluding | |
5280 | template template parameters); the namespaces of which any template | |
5281 | template arguments are members; and the classes of which any member | |
5282 | templates used as template template arguments are members. [ Note: | |
5283 | non-type template arguments do not contribute to the set of associated | |
5284 | namespaces. --end note] */ | |
5285 | ||
5286 | static bool | |
5287 | arg_assoc_class (struct arg_lookup *k, tree type) | |
5288 | { | |
5289 | tree list; | |
5290 | int i; | |
5291 | ||
5292 | /* Backend build structures, such as __builtin_va_list, aren't | |
5293 | affected by all this. */ | |
5294 | if (!CLASS_TYPE_P (type)) | |
5295 | return false; | |
5296 | ||
1df3c246 | 5297 | if (vec_member (type, k->classes)) |
8e31c186 | 5298 | return false; |
1df3c246 | 5299 | VEC_safe_push (tree, gc, k->classes, type); |
8e31c186 | 5300 | |
5301 | if (TYPE_CLASS_SCOPE_P (type) | |
5302 | && arg_assoc_class_only (k, TYPE_CONTEXT (type))) | |
5303 | return true; | |
5304 | ||
5305 | if (arg_assoc_bases (k, type)) | |
5306 | return true; | |
5307 | ||
cc9a4194 | 5308 | /* Process template arguments. */ |
9031d10b | 5309 | if (CLASSTYPE_TEMPLATE_INFO (type) |
af7d81e3 | 5310 | && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type))) |
cc9a4194 | 5311 | { |
5312 | list = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type)); | |
9031d10b | 5313 | for (i = 0; i < TREE_VEC_LENGTH (list); ++i) |
8e31c186 | 5314 | if (arg_assoc_template_arg (k, TREE_VEC_ELT (list, i))) |
5315 | return true; | |
cc9a4194 | 5316 | } |
5317 | ||
5318 | return false; | |
5319 | } | |
5320 | ||
5321 | /* Adds everything associated with a given type. | |
5322 | Returns 1 on error. */ | |
5323 | ||
5324 | static bool | |
5325 | arg_assoc_type (struct arg_lookup *k, tree type) | |
5326 | { | |
5327 | /* As we do not get the type of non-type dependent expressions | |
5328 | right, we can end up with such things without a type. */ | |
5329 | if (!type) | |
5330 | return false; | |
5331 | ||
05765a91 | 5332 | if (TYPE_PTRDATAMEM_P (type)) |
cc9a4194 | 5333 | { |
5334 | /* Pointer to member: associate class type and value type. */ | |
5335 | if (arg_assoc_type (k, TYPE_PTRMEM_CLASS_TYPE (type))) | |
5336 | return true; | |
5337 | return arg_assoc_type (k, TYPE_PTRMEM_POINTED_TO_TYPE (type)); | |
5338 | } | |
5339 | else switch (TREE_CODE (type)) | |
5340 | { | |
5341 | case ERROR_MARK: | |
5342 | return false; | |
5343 | case VOID_TYPE: | |
5344 | case INTEGER_TYPE: | |
5345 | case REAL_TYPE: | |
5346 | case COMPLEX_TYPE: | |
5347 | case VECTOR_TYPE: | |
cc9a4194 | 5348 | case BOOLEAN_TYPE: |
2596ba69 | 5349 | case FIXED_POINT_TYPE: |
e6856fc1 | 5350 | case DECLTYPE_TYPE: |
fa67d8e8 | 5351 | case NULLPTR_TYPE: |
cc9a4194 | 5352 | return false; |
5353 | case RECORD_TYPE: | |
5354 | if (TYPE_PTRMEMFUNC_P (type)) | |
5355 | return arg_assoc_type (k, TYPE_PTRMEMFUNC_FN_TYPE (type)); | |
8e31c186 | 5356 | case UNION_TYPE: |
cc9a4194 | 5357 | return arg_assoc_class (k, type); |
5358 | case POINTER_TYPE: | |
5359 | case REFERENCE_TYPE: | |
5360 | case ARRAY_TYPE: | |
5361 | return arg_assoc_type (k, TREE_TYPE (type)); | |
cc9a4194 | 5362 | case ENUMERAL_TYPE: |
8e31c186 | 5363 | if (TYPE_CLASS_SCOPE_P (type) |
5364 | && arg_assoc_class_only (k, TYPE_CONTEXT (type))) | |
5365 | return true; | |
e4e8c884 | 5366 | return arg_assoc_namespace (k, decl_namespace_context (type)); |
cc9a4194 | 5367 | case METHOD_TYPE: |
5368 | /* The basetype is referenced in the first arg type, so just | |
5369 | fall through. */ | |
5370 | case FUNCTION_TYPE: | |
5371 | /* Associate the parameter types. */ | |
5372 | if (arg_assoc_args (k, TYPE_ARG_TYPES (type))) | |
5373 | return true; | |
5374 | /* Associate the return type. */ | |
5375 | return arg_assoc_type (k, TREE_TYPE (type)); | |
5376 | case TEMPLATE_TYPE_PARM: | |
5377 | case BOUND_TEMPLATE_TEMPLATE_PARM: | |
5378 | return false; | |
5379 | case TYPENAME_TYPE: | |
5380 | return false; | |
5381 | case LANG_TYPE: | |
f82f1250 | 5382 | gcc_assert (type == unknown_type_node |
5383 | || type == init_list_type_node); | |
2e3e31d2 | 5384 | return false; |
d95d815d | 5385 | case TYPE_PACK_EXPANSION: |
5386 | return arg_assoc_type (k, PACK_EXPANSION_PATTERN (type)); | |
d95d815d | 5387 | |
cc9a4194 | 5388 | default: |
2e3e31d2 | 5389 | gcc_unreachable (); |
cc9a4194 | 5390 | } |
5391 | return false; | |
5392 | } | |
5393 | ||
5394 | /* Adds everything associated with arguments. Returns true on error. */ | |
5395 | ||
5396 | static bool | |
5397 | arg_assoc_args (struct arg_lookup *k, tree args) | |
5398 | { | |
5399 | for (; args; args = TREE_CHAIN (args)) | |
5400 | if (arg_assoc (k, TREE_VALUE (args))) | |
5401 | return true; | |
5402 | return false; | |
5403 | } | |
5404 | ||
f352a3fb | 5405 | /* Adds everything associated with an argument vector. Returns true |
5406 | on error. */ | |
5407 | ||
5408 | static bool | |
5409 | arg_assoc_args_vec (struct arg_lookup *k, VEC(tree,gc) *args) | |
5410 | { | |
5411 | unsigned int ix; | |
5412 | tree arg; | |
5413 | ||
48148244 | 5414 | FOR_EACH_VEC_ELT (tree, args, ix, arg) |
f352a3fb | 5415 | if (arg_assoc (k, arg)) |
5416 | return true; | |
5417 | return false; | |
5418 | } | |
5419 | ||
cc9a4194 | 5420 | /* Adds everything associated with a given tree_node. Returns 1 on error. */ |
5421 | ||
5422 | static bool | |
5423 | arg_assoc (struct arg_lookup *k, tree n) | |
5424 | { | |
5425 | if (n == error_mark_node) | |
5426 | return false; | |
5427 | ||
5428 | if (TYPE_P (n)) | |
5429 | return arg_assoc_type (k, n); | |
5430 | ||
5431 | if (! type_unknown_p (n)) | |
5432 | return arg_assoc_type (k, TREE_TYPE (n)); | |
5433 | ||
5434 | if (TREE_CODE (n) == ADDR_EXPR) | |
5435 | n = TREE_OPERAND (n, 0); | |
5436 | if (TREE_CODE (n) == COMPONENT_REF) | |
5437 | n = TREE_OPERAND (n, 1); | |
5438 | if (TREE_CODE (n) == OFFSET_REF) | |
5439 | n = TREE_OPERAND (n, 1); | |
5440 | while (TREE_CODE (n) == TREE_LIST) | |
5441 | n = TREE_VALUE (n); | |
a00f651a | 5442 | if (BASELINK_P (n)) |
cc9a4194 | 5443 | n = BASELINK_FUNCTIONS (n); |
5444 | ||
5445 | if (TREE_CODE (n) == FUNCTION_DECL) | |
5446 | return arg_assoc_type (k, TREE_TYPE (n)); | |
5447 | if (TREE_CODE (n) == TEMPLATE_ID_EXPR) | |
5448 | { | |
8e31c186 | 5449 | /* The working paper doesn't currently say how to handle template-id |
5450 | arguments. The sensible thing would seem to be to handle the list | |
5451 | of template candidates like a normal overload set, and handle the | |
5452 | template arguments like we do for class template | |
5453 | specializations. */ | |
607a5d68 | 5454 | tree templ = TREE_OPERAND (n, 0); |
cc9a4194 | 5455 | tree args = TREE_OPERAND (n, 1); |
cc9a4194 | 5456 | int ix; |
5457 | ||
8e31c186 | 5458 | /* First the templates. */ |
5459 | if (arg_assoc (k, templ)) | |
cc9a4194 | 5460 | return true; |
5461 | ||
5462 | /* Now the arguments. */ | |
a37500ed | 5463 | if (args) |
5464 | for (ix = TREE_VEC_LENGTH (args); ix--;) | |
5465 | if (arg_assoc_template_arg (k, TREE_VEC_ELT (args, ix)) == 1) | |
5466 | return true; | |
cc9a4194 | 5467 | } |
a133b234 | 5468 | else if (TREE_CODE (n) == OVERLOAD) |
cc9a4194 | 5469 | { |
0a8b74e0 | 5470 | for (; n; n = OVL_NEXT (n)) |
5471 | if (arg_assoc_type (k, TREE_TYPE (OVL_CURRENT (n)))) | |
cc9a4194 | 5472 | return true; |
5473 | } | |
5474 | ||
5475 | return false; | |
5476 | } | |
5477 | ||
5478 | /* Performs Koenig lookup depending on arguments, where fns | |
5479 | are the functions found in normal lookup. */ | |
5480 | ||
6198e8f6 | 5481 | static tree |
5482 | lookup_arg_dependent_1 (tree name, tree fns, VEC(tree,gc) *args, | |
5483 | bool include_std) | |
cc9a4194 | 5484 | { |
5485 | struct arg_lookup k; | |
cc9a4194 | 5486 | |
c1d4295f | 5487 | /* Remove any hidden friend functions from the list of functions |
5488 | found so far. They will be added back by arg_assoc_class as | |
5489 | appropriate. */ | |
5490 | fns = remove_hidden_names (fns); | |
5491 | ||
cc9a4194 | 5492 | k.name = name; |
c1d4295f | 5493 | k.args = args; |
cc9a4194 | 5494 | k.functions = fns; |
1df3c246 | 5495 | k.classes = make_tree_vector (); |
cc9a4194 | 5496 | |
75916f64 | 5497 | /* We previously performed an optimization here by setting |
5498 | NAMESPACES to the current namespace when it was safe. However, DR | |
5499 | 164 says that namespaces that were already searched in the first | |
5500 | stage of template processing are searched again (potentially | |
5501 | picking up later definitions) in the second stage. */ | |
1df3c246 | 5502 | k.namespaces = make_tree_vector (); |
cc9a4194 | 5503 | |
d9e82d44 | 5504 | /* We used to allow duplicates and let joust discard them, but |
5505 | since the above change for DR 164 we end up with duplicates of | |
5506 | all the functions found by unqualified lookup. So keep track | |
5507 | of which ones we've seen. */ | |
5508 | if (fns) | |
5509 | { | |
5510 | tree ovl; | |
5511 | /* We shouldn't be here if lookup found something other than | |
5512 | namespace-scope functions. */ | |
5513 | gcc_assert (DECL_NAMESPACE_SCOPE_P (OVL_CURRENT (fns))); | |
5514 | k.fn_set = pointer_set_create (); | |
5515 | for (ovl = fns; ovl; ovl = OVL_NEXT (ovl)) | |
5516 | pointer_set_insert (k.fn_set, OVL_CURRENT (ovl)); | |
5517 | } | |
5518 | else | |
5519 | k.fn_set = NULL; | |
5520 | ||
9dd72ec4 | 5521 | if (include_std) |
5522 | arg_assoc_namespace (&k, std_node); | |
f352a3fb | 5523 | arg_assoc_args_vec (&k, args); |
1b8d97ae | 5524 | |
5525 | fns = k.functions; | |
5526 | ||
5527 | if (fns | |
5528 | && TREE_CODE (fns) != VAR_DECL | |
5529 | && !is_overloaded_fn (fns)) | |
5530 | { | |
5531 | error ("argument dependent lookup finds %q+D", fns); | |
5532 | error (" in call to %qD", name); | |
5533 | fns = error_mark_node; | |
5534 | } | |
1df3c246 | 5535 | |
5536 | release_tree_vector (k.classes); | |
5537 | release_tree_vector (k.namespaces); | |
d9e82d44 | 5538 | if (k.fn_set) |
5539 | pointer_set_destroy (k.fn_set); | |
1b8d97ae | 5540 | |
6198e8f6 | 5541 | return fns; |
cc9a4194 | 5542 | } |
5543 | ||
6198e8f6 | 5544 | /* Wrapper for lookup_arg_dependent_1. */ |
5545 | ||
5546 | tree | |
5547 | lookup_arg_dependent (tree name, tree fns, VEC(tree,gc) *args, | |
5548 | bool include_std) | |
5549 | { | |
5550 | tree ret; | |
5902c6c2 | 5551 | bool subtime; |
5552 | subtime = timevar_cond_start (TV_NAME_LOOKUP); | |
6198e8f6 | 5553 | ret = lookup_arg_dependent_1 (name, fns, args, include_std); |
5902c6c2 | 5554 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); |
6198e8f6 | 5555 | return ret; |
5556 | } | |
5557 | ||
5558 | ||
836495aa | 5559 | /* Add namespace to using_directives. Return NULL_TREE if nothing was |
5560 | changed (i.e. there was already a directive), or the fresh | |
5561 | TREE_LIST otherwise. */ | |
5562 | ||
9a49d46b | 5563 | static tree |
6198e8f6 | 5564 | push_using_directive_1 (tree used) |
836495aa | 5565 | { |
5566 | tree ud = current_binding_level->using_directives; | |
5567 | tree iter, ancestor; | |
5568 | ||
836495aa | 5569 | /* Check if we already have this. */ |
5570 | if (purpose_member (used, ud) != NULL_TREE) | |
6198e8f6 | 5571 | return NULL_TREE; |
836495aa | 5572 | |
5573 | ancestor = namespace_ancestor (current_decl_namespace (), used); | |
5574 | ud = current_binding_level->using_directives; | |
5575 | ud = tree_cons (used, ancestor, ud); | |
5576 | current_binding_level->using_directives = ud; | |
5577 | ||
5578 | /* Recursively add all namespaces used. */ | |
5579 | for (iter = DECL_NAMESPACE_USING (used); iter; iter = TREE_CHAIN (iter)) | |
5580 | push_using_directive (TREE_PURPOSE (iter)); | |
5581 | ||
6198e8f6 | 5582 | return ud; |
5583 | } | |
5584 | ||
5585 | /* Wrapper for push_using_directive_1. */ | |
5586 | ||
5587 | static tree | |
5588 | push_using_directive (tree used) | |
5589 | { | |
5590 | tree ret; | |
5591 | timevar_start (TV_NAME_LOOKUP); | |
5592 | ret = push_using_directive_1 (used); | |
5593 | timevar_stop (TV_NAME_LOOKUP); | |
5594 | return ret; | |
836495aa | 5595 | } |
5596 | ||
5597 | /* The type TYPE is being declared. If it is a class template, or a | |
5598 | specialization of a class template, do any processing required and | |
5599 | perform error-checking. If IS_FRIEND is nonzero, this TYPE is | |
5600 | being declared a friend. B is the binding level at which this TYPE | |
5601 | should be bound. | |
5602 | ||
5603 | Returns the TYPE_DECL for TYPE, which may have been altered by this | |
5604 | processing. */ | |
5605 | ||
5606 | static tree | |
3f3fa556 | 5607 | maybe_process_template_type_declaration (tree type, int is_friend, |
d0ef83bc | 5608 | cp_binding_level *b) |
836495aa | 5609 | { |
5610 | tree decl = TYPE_NAME (type); | |
5611 | ||
5612 | if (processing_template_parmlist) | |
5613 | /* You can't declare a new template type in a template parameter | |
5614 | list. But, you can declare a non-template type: | |
5615 | ||
653e5405 | 5616 | template <class A*> struct S; |
836495aa | 5617 | |
5618 | is a forward-declaration of `A'. */ | |
5619 | ; | |
439abd1d | 5620 | else if (b->kind == sk_namespace |
5621 | && current_binding_level->kind != sk_namespace) | |
5622 | /* If this new type is being injected into a containing scope, | |
5623 | then it's not a template type. */ | |
5624 | ; | |
836495aa | 5625 | else |
5626 | { | |
95397ff9 | 5627 | gcc_assert (MAYBE_CLASS_TYPE_P (type) |
5628 | || TREE_CODE (type) == ENUMERAL_TYPE); | |
836495aa | 5629 | |
5630 | if (processing_template_decl) | |
5631 | { | |
5632 | /* This may change after the call to | |
5633 | push_template_decl_real, but we want the original value. */ | |
5634 | tree name = DECL_NAME (decl); | |
5635 | ||
3f3fa556 | 5636 | decl = push_template_decl_real (decl, is_friend); |
0ea8c695 | 5637 | if (decl == error_mark_node) |
5638 | return error_mark_node; | |
5639 | ||
836495aa | 5640 | /* If the current binding level is the binding level for the |
5641 | template parameters (see the comment in | |
5642 | begin_template_parm_list) and the enclosing level is a class | |
5643 | scope, and we're not looking at a friend, push the | |
5644 | declaration of the member class into the class scope. In the | |
5645 | friend case, push_template_decl will already have put the | |
5646 | friend into global scope, if appropriate. */ | |
5647 | if (TREE_CODE (type) != ENUMERAL_TYPE | |
3f3fa556 | 5648 | && !is_friend && b->kind == sk_template_parms |
836495aa | 5649 | && b->level_chain->kind == sk_class) |
5650 | { | |
5651 | finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type)); | |
fc64a85e | 5652 | |
836495aa | 5653 | if (!COMPLETE_TYPE_P (current_class_type)) |
5654 | { | |
5655 | maybe_add_class_template_decl_list (current_class_type, | |
5656 | type, /*friend_p=*/0); | |
e4bc96e2 | 5657 | /* Put this UTD in the table of UTDs for the class. */ |
fc64a85e | 5658 | if (CLASSTYPE_NESTED_UTDS (current_class_type) == NULL) |
5659 | CLASSTYPE_NESTED_UTDS (current_class_type) = | |
5660 | binding_table_new (SCOPE_DEFAULT_HT_SIZE); | |
5661 | ||
5662 | binding_table_insert | |
5663 | (CLASSTYPE_NESTED_UTDS (current_class_type), name, type); | |
836495aa | 5664 | } |
5665 | } | |
5666 | } | |
5667 | } | |
5668 | ||
5669 | return decl; | |
5670 | } | |
5671 | ||
f4f11c20 | 5672 | /* Push a tag name NAME for struct/class/union/enum type TYPE. In case |
5673 | that the NAME is a class template, the tag is processed but not pushed. | |
5674 | ||
5675 | The pushed scope depend on the SCOPE parameter: | |
5676 | - When SCOPE is TS_CURRENT, put it into the inner-most non-sk_cleanup | |
5677 | scope. | |
5678 | - When SCOPE is TS_GLOBAL, put it in the inner-most non-class and | |
5679 | non-template-parameter scope. This case is needed for forward | |
5680 | declarations. | |
5681 | - When SCOPE is TS_WITHIN_ENCLOSING_NON_CLASS, this is similar to | |
5682 | TS_GLOBAL case except that names within template-parameter scopes | |
5683 | are not pushed at all. | |
5684 | ||
8aedf238 | 5685 | Returns TYPE upon success and ERROR_MARK_NODE otherwise. */ |
836495aa | 5686 | |
6198e8f6 | 5687 | static tree |
5688 | pushtag_1 (tree name, tree type, tag_scope scope) | |
836495aa | 5689 | { |
d0ef83bc | 5690 | cp_binding_level *b; |
d7323d26 | 5691 | tree decl; |
836495aa | 5692 | |
836495aa | 5693 | b = current_binding_level; |
2efe4daf | 5694 | while (/* Cleanup scopes are not scopes from the point of view of |
5695 | the language. */ | |
5696 | b->kind == sk_cleanup | |
34eac767 | 5697 | /* Neither are function parameter scopes. */ |
5698 | || b->kind == sk_function_parms | |
2efe4daf | 5699 | /* Neither are the scopes used to hold template parameters |
5700 | for an explicit specialization. For an ordinary template | |
5701 | declaration, these scopes are not scopes from the point of | |
f4f11c20 | 5702 | view of the language. */ |
5703 | || (b->kind == sk_template_parms | |
5704 | && (b->explicit_spec_p || scope == ts_global)) | |
836495aa | 5705 | || (b->kind == sk_class |
3f3fa556 | 5706 | && (scope != ts_current |
836495aa | 5707 | /* We may be defining a new type in the initializer |
5708 | of a static member variable. We allow this when | |
5709 | not pedantic, and it is particularly useful for | |
5710 | type punning via an anonymous union. */ | |
5711 | || COMPLETE_TYPE_P (b->this_entity)))) | |
5712 | b = b->level_chain; | |
5713 | ||
d7323d26 | 5714 | gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE); |
074ab442 | 5715 | |
d7323d26 | 5716 | /* Do C++ gratuitous typedefing. */ |
6198e8f6 | 5717 | if (identifier_type_value_1 (name) != type) |
836495aa | 5718 | { |
d7323d26 | 5719 | tree tdef; |
5720 | int in_class = 0; | |
5721 | tree context = TYPE_CONTEXT (type); | |
836495aa | 5722 | |
d7323d26 | 5723 | if (! context) |
5724 | { | |
5725 | tree cs = current_scope (); | |
074ab442 | 5726 | |
a8b75081 | 5727 | if (scope == ts_current |
5728 | || (cs && TREE_CODE (cs) == FUNCTION_DECL)) | |
d7323d26 | 5729 | context = cs; |
5730 | else if (cs != NULL_TREE && TYPE_P (cs)) | |
5731 | /* When declaring a friend class of a local class, we want | |
5732 | to inject the newly named class into the scope | |
5733 | containing the local class, not the namespace | |
5734 | scope. */ | |
5735 | context = decl_function_context (get_type_decl (cs)); | |
5736 | } | |
5737 | if (!context) | |
5738 | context = current_namespace; | |
3f3fa556 | 5739 | |
d7323d26 | 5740 | if (b->kind == sk_class |
5741 | || (b->kind == sk_template_parms | |
5742 | && b->level_chain->kind == sk_class)) | |
5743 | in_class = 1; | |
836495aa | 5744 | |
d7323d26 | 5745 | if (current_lang_name == lang_name_java) |
5746 | TYPE_FOR_JAVA (type) = 1; | |
836495aa | 5747 | |
d7323d26 | 5748 | tdef = create_implicit_typedef (name, type); |
5749 | DECL_CONTEXT (tdef) = FROB_CONTEXT (context); | |
5750 | if (scope == ts_within_enclosing_non_class) | |
836495aa | 5751 | { |
d7323d26 | 5752 | /* This is a friend. Make this TYPE_DECL node hidden from |
5753 | ordinary name lookup. Its corresponding TEMPLATE_DECL | |
5754 | will be marked in push_template_decl_real. */ | |
5755 | retrofit_lang_decl (tdef); | |
5756 | DECL_ANTICIPATED (tdef) = 1; | |
5757 | DECL_FRIEND_P (tdef) = 1; | |
5758 | } | |
fc64a85e | 5759 | |
d7323d26 | 5760 | decl = maybe_process_template_type_declaration |
5761 | (type, scope == ts_within_enclosing_non_class, b); | |
5762 | if (decl == error_mark_node) | |
6198e8f6 | 5763 | return decl; |
074ab442 | 5764 | |
d7323d26 | 5765 | if (b->kind == sk_class) |
5766 | { | |
c64e181a | 5767 | if (!TYPE_BEING_DEFINED (current_class_type)) |
6198e8f6 | 5768 | return error_mark_node; |
c64e181a | 5769 | |
d7323d26 | 5770 | if (!PROCESSING_REAL_TEMPLATE_DECL_P ()) |
5771 | /* Put this TYPE_DECL on the TYPE_FIELDS list for the | |
5772 | class. But if it's a member template class, we want | |
5773 | the TEMPLATE_DECL, not the TYPE_DECL, so this is done | |
5774 | later. */ | |
5775 | finish_member_declaration (decl); | |
5776 | else | |
5777 | pushdecl_class_level (decl); | |
836495aa | 5778 | } |
d7323d26 | 5779 | else if (b->kind != sk_template_parms) |
e0679c13 | 5780 | { |
6198e8f6 | 5781 | decl = pushdecl_with_scope_1 (decl, b, /*is_friend=*/false); |
e0679c13 | 5782 | if (decl == error_mark_node) |
6198e8f6 | 5783 | return decl; |
e0679c13 | 5784 | } |
d7323d26 | 5785 | |
1d3e301c | 5786 | if (! in_class) |
5787 | set_identifier_type_value_with_scope (name, tdef, b); | |
5788 | ||
d7323d26 | 5789 | TYPE_CONTEXT (type) = DECL_CONTEXT (decl); |
5790 | ||
5791 | /* If this is a local class, keep track of it. We need this | |
5792 | information for name-mangling, and so that it is possible to | |
5793 | find all function definitions in a translation unit in a | |
5794 | convenient way. (It's otherwise tricky to find a member | |
5795 | function definition it's only pointed to from within a local | |
5796 | class.) */ | |
5797 | if (TYPE_CONTEXT (type) | |
5798 | && TREE_CODE (TYPE_CONTEXT (type)) == FUNCTION_DECL) | |
5799 | VEC_safe_push (tree, gc, local_classes, type); | |
836495aa | 5800 | } |
d7323d26 | 5801 | if (b->kind == sk_class |
5802 | && !COMPLETE_TYPE_P (current_class_type)) | |
836495aa | 5803 | { |
d7323d26 | 5804 | maybe_add_class_template_decl_list (current_class_type, |
5805 | type, /*friend_p=*/0); | |
074ab442 | 5806 | |
d7323d26 | 5807 | if (CLASSTYPE_NESTED_UTDS (current_class_type) == NULL) |
5808 | CLASSTYPE_NESTED_UTDS (current_class_type) | |
5809 | = binding_table_new (SCOPE_DEFAULT_HT_SIZE); | |
074ab442 | 5810 | |
d7323d26 | 5811 | binding_table_insert |
5812 | (CLASSTYPE_NESTED_UTDS (current_class_type), name, type); | |
836495aa | 5813 | } |
d7323d26 | 5814 | |
5815 | decl = TYPE_NAME (type); | |
5816 | gcc_assert (TREE_CODE (decl) == TYPE_DECL); | |
d7323d26 | 5817 | |
4a2849cb | 5818 | /* Set type visibility now if this is a forward declaration. */ |
5819 | TREE_PUBLIC (decl) = 1; | |
5820 | determine_visibility (decl); | |
5821 | ||
6198e8f6 | 5822 | return type; |
5823 | } | |
5824 | ||
5825 | /* Wrapper for pushtag_1. */ | |
5826 | ||
5827 | tree | |
5828 | pushtag (tree name, tree type, tag_scope scope) | |
5829 | { | |
5830 | tree ret; | |
5831 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); | |
5832 | ret = pushtag_1 (name, type, scope); | |
5833 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); | |
5834 | return ret; | |
836495aa | 5835 | } |
5836 | \f | |
836495aa | 5837 | /* Subroutines for reverting temporarily to top-level for instantiation |
5838 | of templates and such. We actually need to clear out the class- and | |
5839 | local-value slots of all identifiers, so that only the global values | |
5840 | are at all visible. Simply setting current_binding_level to the global | |
5841 | scope isn't enough, because more binding levels may be pushed. */ | |
5842 | struct saved_scope *scope_chain; | |
5843 | ||
93c149df | 5844 | /* If ID has not already been marked, add an appropriate binding to |
5845 | *OLD_BINDINGS. */ | |
598057ec | 5846 | |
93c149df | 5847 | static void |
046bfc77 | 5848 | store_binding (tree id, VEC(cxx_saved_binding,gc) **old_bindings) |
598057ec | 5849 | { |
5850 | cxx_saved_binding *saved; | |
598057ec | 5851 | |
fa26c7a9 | 5852 | if (!id || !IDENTIFIER_BINDING (id)) |
93c149df | 5853 | return; |
598057ec | 5854 | |
93c149df | 5855 | if (IDENTIFIER_MARKED (id)) |
5856 | return; | |
9031d10b | 5857 | |
93c149df | 5858 | IDENTIFIER_MARKED (id) = 1; |
598057ec | 5859 | |
046bfc77 | 5860 | saved = VEC_safe_push (cxx_saved_binding, gc, *old_bindings, NULL); |
598057ec | 5861 | saved->identifier = id; |
5862 | saved->binding = IDENTIFIER_BINDING (id); | |
598057ec | 5863 | saved->real_type_value = REAL_IDENTIFIER_TYPE_VALUE (id); |
5864 | IDENTIFIER_BINDING (id) = NULL; | |
598057ec | 5865 | } |
5866 | ||
93c149df | 5867 | static void |
046bfc77 | 5868 | store_bindings (tree names, VEC(cxx_saved_binding,gc) **old_bindings) |
836495aa | 5869 | { |
5870 | tree t; | |
836495aa | 5871 | |
6198e8f6 | 5872 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); |
836495aa | 5873 | for (t = names; t; t = TREE_CHAIN (t)) |
5874 | { | |
5875 | tree id; | |
836495aa | 5876 | |
5877 | if (TREE_CODE (t) == TREE_LIST) | |
5878 | id = TREE_PURPOSE (t); | |
5879 | else | |
5880 | id = DECL_NAME (t); | |
5881 | ||
93c149df | 5882 | store_binding (id, old_bindings); |
836495aa | 5883 | } |
6198e8f6 | 5884 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); |
836495aa | 5885 | } |
5886 | ||
598057ec | 5887 | /* Like store_bindings, but NAMES is a vector of cp_class_binding |
5888 | objects, rather than a TREE_LIST. */ | |
5889 | ||
93c149df | 5890 | static void |
9031d10b | 5891 | store_class_bindings (VEC(cp_class_binding,gc) *names, |
046bfc77 | 5892 | VEC(cxx_saved_binding,gc) **old_bindings) |
598057ec | 5893 | { |
5894 | size_t i; | |
5895 | cp_class_binding *cb; | |
598057ec | 5896 | |
6198e8f6 | 5897 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); |
930bdacf | 5898 | for (i = 0; VEC_iterate(cp_class_binding, names, i, cb); ++i) |
93c149df | 5899 | store_binding (cb->identifier, old_bindings); |
6198e8f6 | 5900 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); |
598057ec | 5901 | } |
5902 | ||
836495aa | 5903 | void |
7f233616 | 5904 | push_to_top_level (void) |
836495aa | 5905 | { |
5906 | struct saved_scope *s; | |
d0ef83bc | 5907 | cp_binding_level *b; |
93c149df | 5908 | cxx_saved_binding *sb; |
5909 | size_t i; | |
855ed7a1 | 5910 | bool need_pop; |
836495aa | 5911 | |
6198e8f6 | 5912 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); |
ba72912a | 5913 | s = ggc_alloc_cleared_saved_scope (); |
836495aa | 5914 | |
5915 | b = scope_chain ? current_binding_level : 0; | |
5916 | ||
5917 | /* If we're in the middle of some function, save our state. */ | |
5918 | if (cfun) | |
5919 | { | |
855ed7a1 | 5920 | need_pop = true; |
d2764e2d | 5921 | push_function_context (); |
836495aa | 5922 | } |
5923 | else | |
855ed7a1 | 5924 | need_pop = false; |
836495aa | 5925 | |
598057ec | 5926 | if (scope_chain && previous_class_level) |
93c149df | 5927 | store_class_bindings (previous_class_level->class_shadowed, |
5928 | &s->old_bindings); | |
836495aa | 5929 | |
5930 | /* Have to include the global scope, because class-scope decls | |
5931 | aren't listed anywhere useful. */ | |
5932 | for (; b; b = b->level_chain) | |
5933 | { | |
5934 | tree t; | |
5935 | ||
5936 | /* Template IDs are inserted into the global level. If they were | |
5937 | inserted into namespace level, finish_file wouldn't find them | |
5938 | when doing pending instantiations. Therefore, don't stop at | |
5939 | namespace level, but continue until :: . */ | |
7f233616 | 5940 | if (global_scope_p (b)) |
836495aa | 5941 | break; |
5942 | ||
93c149df | 5943 | store_bindings (b->names, &s->old_bindings); |
836495aa | 5944 | /* We also need to check class_shadowed to save class-level type |
5945 | bindings, since pushclass doesn't fill in b->names. */ | |
5946 | if (b->kind == sk_class) | |
93c149df | 5947 | store_class_bindings (b->class_shadowed, &s->old_bindings); |
836495aa | 5948 | |
5949 | /* Unwind type-value slots back to top level. */ | |
5950 | for (t = b->type_shadowed; t; t = TREE_CHAIN (t)) | |
5951 | SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t), TREE_VALUE (t)); | |
5952 | } | |
93c149df | 5953 | |
48148244 | 5954 | FOR_EACH_VEC_ELT (cxx_saved_binding, s->old_bindings, i, sb) |
93c149df | 5955 | IDENTIFIER_MARKED (sb->identifier) = 0; |
5956 | ||
836495aa | 5957 | s->prev = scope_chain; |
836495aa | 5958 | s->bindings = b; |
5959 | s->need_pop_function_context = need_pop; | |
5960 | s->function_decl = current_function_decl; | |
48d94ede | 5961 | s->unevaluated_operand = cp_unevaluated_operand; |
5962 | s->inhibit_evaluation_warnings = c_inhibit_evaluation_warnings; | |
61e987fc | 5963 | s->x_stmt_tree.stmts_are_full_exprs_p = true; |
836495aa | 5964 | |
5965 | scope_chain = s; | |
5966 | current_function_decl = NULL_TREE; | |
b943ebc0 | 5967 | current_lang_base = VEC_alloc (tree, gc, 10); |
836495aa | 5968 | current_lang_name = lang_name_cplusplus; |
5969 | current_namespace = global_namespace; | |
637441cf | 5970 | push_class_stack (); |
48d94ede | 5971 | cp_unevaluated_operand = 0; |
5972 | c_inhibit_evaluation_warnings = 0; | |
6198e8f6 | 5973 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); |
836495aa | 5974 | } |
5975 | ||
6198e8f6 | 5976 | static void |
5977 | pop_from_top_level_1 (void) | |
836495aa | 5978 | { |
5979 | struct saved_scope *s = scope_chain; | |
5980 | cxx_saved_binding *saved; | |
93c149df | 5981 | size_t i; |
836495aa | 5982 | |
836495aa | 5983 | /* Clear out class-level bindings cache. */ |
598057ec | 5984 | if (previous_class_level) |
836495aa | 5985 | invalidate_class_lookup_cache (); |
637441cf | 5986 | pop_class_stack (); |
836495aa | 5987 | |
5988 | current_lang_base = 0; | |
5989 | ||
5990 | scope_chain = s->prev; | |
48148244 | 5991 | FOR_EACH_VEC_ELT (cxx_saved_binding, s->old_bindings, i, saved) |
836495aa | 5992 | { |
5993 | tree id = saved->identifier; | |
5994 | ||
5995 | IDENTIFIER_BINDING (id) = saved->binding; | |
836495aa | 5996 | SET_IDENTIFIER_TYPE_VALUE (id, saved->real_type_value); |
5997 | } | |
5998 | ||
5999 | /* If we were in the middle of compiling a function, restore our | |
6000 | state. */ | |
6001 | if (s->need_pop_function_context) | |
d2764e2d | 6002 | pop_function_context (); |
836495aa | 6003 | current_function_decl = s->function_decl; |
48d94ede | 6004 | cp_unevaluated_operand = s->unevaluated_operand; |
6005 | c_inhibit_evaluation_warnings = s->inhibit_evaluation_warnings; | |
836495aa | 6006 | } |
6007 | ||
6198e8f6 | 6008 | /* Wrapper for pop_from_top_level_1. */ |
6009 | ||
6010 | void | |
6011 | pop_from_top_level (void) | |
6012 | { | |
6013 | bool subtime = timevar_cond_start (TV_NAME_LOOKUP); | |
6014 | pop_from_top_level_1 (); | |
6015 | timevar_cond_stop (TV_NAME_LOOKUP, subtime); | |
6016 | } | |
6017 | ||
6018 | ||
836495aa | 6019 | /* Pop off extraneous binding levels left over due to syntax errors. |
6020 | ||
6021 | We don't pop past namespaces, as they might be valid. */ | |
6022 | ||
6023 | void | |
6024 | pop_everything (void) | |
6025 | { | |
6026 | if (ENABLE_SCOPE_CHECKING) | |
6027 | verbatim ("XXX entering pop_everything ()\n"); | |
6028 | while (!toplevel_bindings_p ()) | |
6029 | { | |
6030 | if (current_binding_level->kind == sk_class) | |
6031 | pop_nested_class (); | |
6032 | else | |
6033 | poplevel (0, 0, 0); | |
6034 | } | |
6035 | if (ENABLE_SCOPE_CHECKING) | |
6036 | verbatim ("XXX leaving pop_everything ()\n"); | |
6037 | } | |
6038 | ||
2b49746a | 6039 | /* Emit debugging information for using declarations and directives. |
9031d10b | 6040 | If input tree is overloaded fn then emit debug info for all |
2b49746a | 6041 | candidates. */ |
6042 | ||
094fb0d8 | 6043 | void |
2b49746a | 6044 | cp_emit_debug_info_for_using (tree t, tree context) |
6045 | { | |
05b01572 | 6046 | /* Don't try to emit any debug information if we have errors. */ |
852f689e | 6047 | if (seen_error ()) |
05b01572 | 6048 | return; |
6049 | ||
9031d10b | 6050 | /* Ignore this FUNCTION_DECL if it refers to a builtin declaration |
2b49746a | 6051 | of a builtin function. */ |
9031d10b | 6052 | if (TREE_CODE (t) == FUNCTION_DECL |
2b49746a | 6053 | && DECL_EXTERNAL (t) |
6054 | && DECL_BUILT_IN (t)) | |
6055 | return; | |
6056 | ||
6057 | /* Do not supply context to imported_module_or_decl, if | |
6058 | it is a global namespace. */ | |
6059 | if (context == global_namespace) | |
6060 | context = NULL_TREE; | |
9031d10b | 6061 | |
2b49746a | 6062 | if (BASELINK_P (t)) |
6063 | t = BASELINK_FUNCTIONS (t); | |
9031d10b | 6064 | |
2b49746a | 6065 | /* FIXME: Handle TEMPLATE_DECLs. */ |
6066 | for (t = OVL_CURRENT (t); t; t = OVL_NEXT (t)) | |
6067 | if (TREE_CODE (t) != TEMPLATE_DECL) | |
169f8686 | 6068 | { |
cacfdc02 | 6069 | if (building_stmt_list_p ()) |
e60a6f7b | 6070 | add_stmt (build_stmt (input_location, USING_STMT, t)); |
169f8686 | 6071 | else |
6072 | (*debug_hooks->imported_module_or_decl) (t, NULL_TREE, context, false); | |
6073 | } | |
094fb0d8 | 6074 | } |
2b49746a | 6075 | |
db90b1e5 | 6076 | #include "gt-cp-name-lookup.h" |