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