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