1 /* Definitions for C++ name lookup routines.
2 Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009
3 Free Software Foundation, Inc.
4 Contributed by Gabriel Dos Reis <gdr@integrable-solutions.net>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
29 #include "name-lookup.h"
32 #include "diagnostic.h"
36 /* The bindings for a particular name in a particular scope. */
38 struct scope_binding {
42 #define EMPTY_SCOPE_BINDING { NULL_TREE, NULL_TREE }
44 static cxx_scope *innermost_nonclass_level (void);
45 static cxx_binding *binding_for_name (cxx_scope *, tree);
46 static tree push_overloaded_decl (tree, int, bool);
47 static bool lookup_using_namespace (tree, struct scope_binding *, tree,
49 static bool qualified_lookup_using_namespace (tree, tree,
50 struct scope_binding *, int);
51 static tree lookup_type_current_level (tree);
52 static tree push_using_directive (tree);
53 static cxx_binding* lookup_extern_c_fun_binding_in_all_ns (tree);
55 /* The :: namespace. */
57 tree global_namespace;
59 /* The name of the anonymous namespace, throughout this translation
61 static GTY(()) tree anonymous_namespace_name;
63 /* Initialize anonymous_namespace_name if necessary, and return it. */
66 get_anonymous_namespace_name (void)
68 if (!anonymous_namespace_name)
70 /* The anonymous namespace has to have a unique name
71 if typeinfo objects are being compared by name. */
72 anonymous_namespace_name = get_file_function_name ("N");
74 return anonymous_namespace_name;
77 /* Compute the chain index of a binding_entry given the HASH value of its
78 name and the total COUNT of chains. COUNT is assumed to be a power
81 #define ENTRY_INDEX(HASH, COUNT) (((HASH) >> 3) & ((COUNT) - 1))
83 /* A free list of "binding_entry"s awaiting for re-use. */
85 static GTY((deletable)) binding_entry free_binding_entry = NULL;
87 /* Create a binding_entry object for (NAME, TYPE). */
89 static inline binding_entry
90 binding_entry_make (tree name, tree type)
94 if (free_binding_entry)
96 entry = free_binding_entry;
97 free_binding_entry = entry->chain;
100 entry = GGC_NEW (struct binding_entry_s);
109 /* Put ENTRY back on the free list. */
112 binding_entry_free (binding_entry entry)
116 entry->chain = free_binding_entry;
117 free_binding_entry = entry;
121 /* The datatype used to implement the mapping from names to types at
123 struct GTY(()) binding_table_s {
124 /* Array of chains of "binding_entry"s */
125 binding_entry * GTY((length ("%h.chain_count"))) chain;
127 /* The number of chains in this table. This is the length of the
128 member "chain" considered as an array. */
131 /* Number of "binding_entry"s in this table. */
135 /* Construct TABLE with an initial CHAIN_COUNT. */
138 binding_table_construct (binding_table table, size_t chain_count)
140 table->chain_count = chain_count;
141 table->entry_count = 0;
142 table->chain = GGC_CNEWVEC (binding_entry, table->chain_count);
145 /* Make TABLE's entries ready for reuse. */
148 binding_table_free (binding_table table)
156 for (i = 0, count = table->chain_count; i < count; ++i)
158 binding_entry temp = table->chain[i];
161 binding_entry entry = temp;
163 binding_entry_free (entry);
165 table->chain[i] = NULL;
167 table->entry_count = 0;
171 /* Allocate a table with CHAIN_COUNT, assumed to be a power of two. */
173 static inline binding_table
174 binding_table_new (size_t chain_count)
176 binding_table table = GGC_NEW (struct binding_table_s);
178 binding_table_construct (table, chain_count);
182 /* Expand TABLE to twice its current chain_count. */
185 binding_table_expand (binding_table table)
187 const size_t old_chain_count = table->chain_count;
188 const size_t old_entry_count = table->entry_count;
189 const size_t new_chain_count = 2 * old_chain_count;
190 binding_entry *old_chains = table->chain;
193 binding_table_construct (table, new_chain_count);
194 for (i = 0; i < old_chain_count; ++i)
196 binding_entry entry = old_chains[i];
197 for (; entry != NULL; entry = old_chains[i])
199 const unsigned int hash = IDENTIFIER_HASH_VALUE (entry->name);
200 const size_t j = ENTRY_INDEX (hash, new_chain_count);
202 old_chains[i] = entry->chain;
203 entry->chain = table->chain[j];
204 table->chain[j] = entry;
207 table->entry_count = old_entry_count;
210 /* Insert a binding for NAME to TYPE into TABLE. */
213 binding_table_insert (binding_table table, tree name, tree type)
215 const unsigned int hash = IDENTIFIER_HASH_VALUE (name);
216 const size_t i = ENTRY_INDEX (hash, table->chain_count);
217 binding_entry entry = binding_entry_make (name, type);
219 entry->chain = table->chain[i];
220 table->chain[i] = entry;
221 ++table->entry_count;
223 if (3 * table->chain_count < 5 * table->entry_count)
224 binding_table_expand (table);
227 /* Return the binding_entry, if any, that maps NAME. */
230 binding_table_find (binding_table table, tree name)
232 const unsigned int hash = IDENTIFIER_HASH_VALUE (name);
233 binding_entry entry = table->chain[ENTRY_INDEX (hash, table->chain_count)];
235 while (entry != NULL && entry->name != name)
236 entry = entry->chain;
241 /* Apply PROC -- with DATA -- to all entries in TABLE. */
244 binding_table_foreach (binding_table table, bt_foreach_proc proc, void *data)
246 const size_t chain_count = table->chain_count;
249 for (i = 0; i < chain_count; ++i)
251 binding_entry entry = table->chain[i];
252 for (; entry != NULL; entry = entry->chain)
257 #ifndef ENABLE_SCOPE_CHECKING
258 # define ENABLE_SCOPE_CHECKING 0
260 # define ENABLE_SCOPE_CHECKING 1
263 /* A free list of "cxx_binding"s, connected by their PREVIOUS. */
265 static GTY((deletable)) cxx_binding *free_bindings;
267 /* Initialize VALUE and TYPE field for BINDING, and set the PREVIOUS
271 cxx_binding_init (cxx_binding *binding, tree value, tree type)
273 binding->value = value;
274 binding->type = type;
275 binding->previous = NULL;
278 /* (GC)-allocate a binding object with VALUE and TYPE member initialized. */
281 cxx_binding_make (tree value, tree type)
283 cxx_binding *binding;
286 binding = free_bindings;
287 free_bindings = binding->previous;
290 binding = GGC_NEW (cxx_binding);
292 cxx_binding_init (binding, value, type);
297 /* Put BINDING back on the free list. */
300 cxx_binding_free (cxx_binding *binding)
302 binding->scope = NULL;
303 binding->previous = free_bindings;
304 free_bindings = binding;
307 /* Create a new binding for NAME (with the indicated VALUE and TYPE
308 bindings) in the class scope indicated by SCOPE. */
311 new_class_binding (tree name, tree value, tree type, cxx_scope *scope)
313 cp_class_binding *cb;
314 cxx_binding *binding;
316 if (VEC_length (cp_class_binding, scope->class_shadowed))
318 cp_class_binding *old_base;
319 old_base = VEC_index (cp_class_binding, scope->class_shadowed, 0);
320 if (VEC_reserve (cp_class_binding, gc, scope->class_shadowed, 1))
322 /* Fixup the current bindings, as they might have moved. */
326 VEC_iterate (cp_class_binding, scope->class_shadowed, i, cb);
330 b = &IDENTIFIER_BINDING (cb->identifier);
331 while (*b != &old_base[i].base)
332 b = &((*b)->previous);
336 cb = VEC_quick_push (cp_class_binding, scope->class_shadowed, NULL);
339 cb = VEC_safe_push (cp_class_binding, gc, scope->class_shadowed, NULL);
341 cb->identifier = name;
343 binding->scope = scope;
344 cxx_binding_init (binding, value, type);
348 /* Make DECL the innermost binding for ID. The LEVEL is the binding
349 level at which this declaration is being bound. */
352 push_binding (tree id, tree decl, cxx_scope* level)
354 cxx_binding *binding;
356 if (level != class_binding_level)
358 binding = cxx_binding_make (decl, NULL_TREE);
359 binding->scope = level;
362 binding = new_class_binding (id, decl, /*type=*/NULL_TREE, level);
364 /* Now, fill in the binding information. */
365 binding->previous = IDENTIFIER_BINDING (id);
366 INHERITED_VALUE_BINDING_P (binding) = 0;
367 LOCAL_BINDING_P (binding) = (level != class_binding_level);
369 /* And put it on the front of the list of bindings for ID. */
370 IDENTIFIER_BINDING (id) = binding;
373 /* Remove the binding for DECL which should be the innermost binding
377 pop_binding (tree id, tree decl)
379 cxx_binding *binding;
382 /* It's easiest to write the loops that call this function without
383 checking whether or not the entities involved have names. We
384 get here for such an entity. */
387 /* Get the innermost binding for ID. */
388 binding = IDENTIFIER_BINDING (id);
390 /* The name should be bound. */
391 gcc_assert (binding != NULL);
393 /* The DECL will be either the ordinary binding or the type
394 binding for this identifier. Remove that binding. */
395 if (binding->value == decl)
396 binding->value = NULL_TREE;
399 gcc_assert (binding->type == decl);
400 binding->type = NULL_TREE;
403 if (!binding->value && !binding->type)
405 /* We're completely done with the innermost binding for this
406 identifier. Unhook it from the list of bindings. */
407 IDENTIFIER_BINDING (id) = binding->previous;
409 /* Add it to the free list. */
410 cxx_binding_free (binding);
414 /* BINDING records an existing declaration for a name in the current scope.
415 But, DECL is another declaration for that same identifier in the
416 same scope. This is the `struct stat' hack whereby a non-typedef
417 class name or enum-name can be bound at the same level as some other
421 A class name (9.1) or enumeration name (7.2) can be hidden by the
422 name of an object, function, or enumerator declared in the same scope.
423 If a class or enumeration name and an object, function, or enumerator
424 are declared in the same scope (in any order) with the same name, the
425 class or enumeration name is hidden wherever the object, function, or
426 enumerator name is visible.
428 It's the responsibility of the caller to check that
429 inserting this name is valid here. Returns nonzero if the new binding
433 supplement_binding (cxx_binding *binding, tree decl)
435 tree bval = binding->value;
438 timevar_push (TV_NAME_LOOKUP);
439 if (TREE_CODE (decl) == TYPE_DECL && DECL_ARTIFICIAL (decl))
440 /* The new name is the type name. */
441 binding->type = decl;
442 else if (/* BVAL is null when push_class_level_binding moves an
443 inherited type-binding out of the way to make room for a
444 new value binding. */
446 /* BVAL is error_mark_node when DECL's name has been used
447 in a non-class scope prior declaration. In that case,
448 we should have already issued a diagnostic; for graceful
449 error recovery purpose, pretend this was the intended
450 declaration for that name. */
451 || bval == error_mark_node
452 /* If BVAL is anticipated but has not yet been declared,
453 pretend it is not there at all. */
454 || (TREE_CODE (bval) == FUNCTION_DECL
455 && DECL_ANTICIPATED (bval)
456 && !DECL_HIDDEN_FRIEND_P (bval)))
457 binding->value = decl;
458 else if (TREE_CODE (bval) == TYPE_DECL && DECL_ARTIFICIAL (bval))
460 /* The old binding was a type name. It was placed in
461 VALUE field because it was thought, at the point it was
462 declared, to be the only entity with such a name. Move the
463 type name into the type slot; it is now hidden by the new
465 binding->type = bval;
466 binding->value = decl;
467 binding->value_is_inherited = false;
469 else if (TREE_CODE (bval) == TYPE_DECL
470 && TREE_CODE (decl) == TYPE_DECL
471 && DECL_NAME (decl) == DECL_NAME (bval)
472 && binding->scope->kind != sk_class
473 && (same_type_p (TREE_TYPE (decl), TREE_TYPE (bval))
474 /* If either type involves template parameters, we must
475 wait until instantiation. */
476 || uses_template_parms (TREE_TYPE (decl))
477 || uses_template_parms (TREE_TYPE (bval))))
478 /* We have two typedef-names, both naming the same type to have
479 the same name. In general, this is OK because of:
483 In a given scope, a typedef specifier can be used to redefine
484 the name of any type declared in that scope to refer to the
485 type to which it already refers.
487 However, in class scopes, this rule does not apply due to the
488 stricter language in [class.mem] prohibiting redeclarations of
491 /* There can be two block-scope declarations of the same variable,
492 so long as they are `extern' declarations. However, there cannot
493 be two declarations of the same static data member:
497 A member shall not be declared twice in the
498 member-specification. */
499 else if (TREE_CODE (decl) == VAR_DECL && TREE_CODE (bval) == VAR_DECL
500 && DECL_EXTERNAL (decl) && DECL_EXTERNAL (bval)
501 && !DECL_CLASS_SCOPE_P (decl))
503 duplicate_decls (decl, binding->value, /*newdecl_is_friend=*/false);
506 else if (TREE_CODE (decl) == NAMESPACE_DECL
507 && TREE_CODE (bval) == NAMESPACE_DECL
508 && DECL_NAMESPACE_ALIAS (decl)
509 && DECL_NAMESPACE_ALIAS (bval)
510 && ORIGINAL_NAMESPACE (bval) == ORIGINAL_NAMESPACE (decl))
513 In a declarative region, a namespace-alias-definition can be
514 used to redefine a namespace-alias declared in that declarative
515 region to refer only to the namespace to which it already
520 error ("declaration of %q#D", decl);
521 error ("conflicts with previous declaration %q+#D", bval);
525 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, ok);
528 /* Add DECL to the list of things declared in B. */
531 add_decl_to_level (tree decl, cxx_scope *b)
533 /* We used to record virtual tables as if they were ordinary
534 variables, but no longer do so. */
535 gcc_assert (!(TREE_CODE (decl) == VAR_DECL && DECL_VIRTUAL_P (decl)));
537 if (TREE_CODE (decl) == NAMESPACE_DECL
538 && !DECL_NAMESPACE_ALIAS (decl))
540 TREE_CHAIN (decl) = b->namespaces;
541 b->namespaces = decl;
545 /* We build up the list in reverse order, and reverse it later if
547 TREE_CHAIN (decl) = b->names;
551 /* If appropriate, add decl to separate list of statics. We
552 include extern variables because they might turn out to be
553 static later. It's OK for this list to contain a few false
555 if (b->kind == sk_namespace)
556 if ((TREE_CODE (decl) == VAR_DECL
557 && (TREE_STATIC (decl) || DECL_EXTERNAL (decl)))
558 || (TREE_CODE (decl) == FUNCTION_DECL
559 && (!TREE_PUBLIC (decl) || DECL_DECLARED_INLINE_P (decl))))
560 VEC_safe_push (tree, gc, b->static_decls, decl);
564 /* Record a decl-node X as belonging to the current lexical scope.
565 Check for errors (such as an incompatible declaration for the same
566 name already seen in the same scope). IS_FRIEND is true if X is
567 declared as a friend.
569 Returns either X or an old decl for the same name.
570 If an old decl is returned, it may have been smashed
571 to agree with what X says. */
574 pushdecl_maybe_friend (tree x, bool is_friend)
578 int need_new_binding;
580 timevar_push (TV_NAME_LOOKUP);
582 if (x == error_mark_node)
583 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
585 need_new_binding = 1;
587 if (DECL_TEMPLATE_PARM_P (x))
588 /* Template parameters have no context; they are not X::T even
589 when declared within a class or namespace. */
593 if (current_function_decl && x != current_function_decl
594 /* A local declaration for a function doesn't constitute
596 && TREE_CODE (x) != FUNCTION_DECL
597 /* A local declaration for an `extern' variable is in the
598 scope of the current namespace, not the current
600 && !(TREE_CODE (x) == VAR_DECL && DECL_EXTERNAL (x))
601 /* When parsing the parameter list of a function declarator,
602 don't set DECL_CONTEXT to an enclosing function. When we
603 push the PARM_DECLs in order to process the function body,
604 current_binding_level->this_entity will be set. */
605 && !(TREE_CODE (x) == PARM_DECL
606 && current_binding_level->kind == sk_function_parms
607 && current_binding_level->this_entity == NULL)
608 && !DECL_CONTEXT (x))
609 DECL_CONTEXT (x) = current_function_decl;
611 /* If this is the declaration for a namespace-scope function,
612 but the declaration itself is in a local scope, mark the
614 if (TREE_CODE (x) == FUNCTION_DECL
615 && DECL_NAMESPACE_SCOPE_P (x)
616 && current_function_decl
617 && x != current_function_decl)
618 DECL_LOCAL_FUNCTION_P (x) = 1;
621 name = DECL_NAME (x);
624 int different_binding_level = 0;
626 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
627 name = TREE_OPERAND (name, 0);
629 /* In case this decl was explicitly namespace-qualified, look it
630 up in its namespace context. */
631 if (DECL_NAMESPACE_SCOPE_P (x) && namespace_bindings_p ())
632 t = namespace_binding (name, DECL_CONTEXT (x));
634 t = lookup_name_innermost_nonclass_level (name);
636 /* [basic.link] If there is a visible declaration of an entity
637 with linkage having the same name and type, ignoring entities
638 declared outside the innermost enclosing namespace scope, the
639 block scope declaration declares that same entity and
640 receives the linkage of the previous declaration. */
641 if (! t && current_function_decl && x != current_function_decl
642 && (TREE_CODE (x) == FUNCTION_DECL || TREE_CODE (x) == VAR_DECL)
643 && DECL_EXTERNAL (x))
645 /* Look in block scope. */
646 t = innermost_non_namespace_value (name);
647 /* Or in the innermost namespace. */
649 t = namespace_binding (name, DECL_CONTEXT (x));
650 /* Does it have linkage? Note that if this isn't a DECL, it's an
651 OVERLOAD, which is OK. */
652 if (t && DECL_P (t) && ! (TREE_STATIC (t) || DECL_EXTERNAL (t)))
655 different_binding_level = 1;
658 /* If we are declaring a function, and the result of name-lookup
659 was an OVERLOAD, look for an overloaded instance that is
660 actually the same as the function we are declaring. (If
661 there is one, we have to merge our declaration with the
662 previous declaration.) */
663 if (t && TREE_CODE (t) == OVERLOAD)
667 if (TREE_CODE (x) == FUNCTION_DECL)
668 for (match = t; match; match = OVL_NEXT (match))
670 if (decls_match (OVL_CURRENT (match), x))
674 /* Just choose one. */
678 t = OVL_CURRENT (match);
683 if (t && t != error_mark_node)
685 if (different_binding_level)
687 if (decls_match (x, t))
688 /* The standard only says that the local extern
689 inherits linkage from the previous decl; in
690 particular, default args are not shared. Add
691 the decl into a hash table to make sure only
692 the previous decl in this case is seen by the
695 struct cxx_int_tree_map *h;
698 TREE_PUBLIC (x) = TREE_PUBLIC (t);
700 if (cp_function_chain->extern_decl_map == NULL)
701 cp_function_chain->extern_decl_map
702 = htab_create_ggc (20, cxx_int_tree_map_hash,
703 cxx_int_tree_map_eq, NULL);
705 h = GGC_NEW (struct cxx_int_tree_map);
706 h->uid = DECL_UID (x);
708 loc = htab_find_slot_with_hash
709 (cp_function_chain->extern_decl_map, h,
711 *(struct cxx_int_tree_map **) loc = h;
714 else if (TREE_CODE (t) == PARM_DECL)
716 /* Check for duplicate params. */
717 tree d = duplicate_decls (x, t, is_friend);
719 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, d);
721 else if ((DECL_EXTERN_C_FUNCTION_P (x)
722 || DECL_FUNCTION_TEMPLATE_P (x))
723 && is_overloaded_fn (t))
724 /* Don't do anything just yet. */;
725 else if (t == wchar_decl_node)
727 if (! DECL_IN_SYSTEM_HEADER (x))
728 pedwarn (input_location, OPT_pedantic, "redeclaration of %<wchar_t%> as %qT",
731 /* Throw away the redeclaration. */
732 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
736 tree olddecl = duplicate_decls (x, t, is_friend);
738 /* If the redeclaration failed, we can stop at this
740 if (olddecl == error_mark_node)
741 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
745 if (TREE_CODE (t) == TYPE_DECL)
746 SET_IDENTIFIER_TYPE_VALUE (name, TREE_TYPE (t));
748 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
750 else if (DECL_MAIN_P (x) && TREE_CODE (t) == FUNCTION_DECL)
752 /* A redeclaration of main, but not a duplicate of the
757 This function shall not be overloaded. */
758 error ("invalid redeclaration of %q+D", t);
760 /* We don't try to push this declaration since that
762 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, x);
767 /* If x has C linkage-specification, (extern "C"),
768 lookup its binding, in case it's already bound to an object.
769 The lookup is done in all namespaces.
770 If we find an existing binding, make sure it has the same
771 exception specification as x, otherwise, bail in error [7.5, 7.6]. */
772 if ((TREE_CODE (x) == FUNCTION_DECL)
773 && DECL_EXTERN_C_P (x)
774 /* We should ignore declarations happening in system headers. */
775 && !DECL_ARTIFICIAL (x)
776 && !DECL_IN_SYSTEM_HEADER (x))
778 cxx_binding *function_binding =
779 lookup_extern_c_fun_binding_in_all_ns (x);
780 tree previous = (function_binding
781 ? function_binding->value
784 && !DECL_ARTIFICIAL (previous)
785 && !DECL_IN_SYSTEM_HEADER (previous)
786 && DECL_CONTEXT (previous) != DECL_CONTEXT (x))
788 tree previous = function_binding->value;
790 /* In case either x or previous is declared to throw an exception,
791 make sure both exception specifications are equal. */
792 if (decls_match (x, previous))
794 tree x_exception_spec = NULL_TREE;
795 tree previous_exception_spec = NULL_TREE;
798 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (x));
799 previous_exception_spec =
800 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (previous));
801 if (!comp_except_specs (previous_exception_spec,
805 pedwarn (input_location, 0, "declaration of %q#D with C language linkage",
807 pedwarn (input_location, 0, "conflicts with previous declaration %q+#D",
809 pedwarn (input_location, 0, "due to different exception specifications");
810 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
815 pedwarn (input_location, 0,
816 "declaration of %q#D with C language linkage", x);
817 pedwarn (input_location, 0,
818 "conflicts with previous declaration %q+#D",
824 check_template_shadow (x);
826 /* If this is a function conjured up by the back end, massage it
827 so it looks friendly. */
828 if (DECL_NON_THUNK_FUNCTION_P (x) && ! DECL_LANG_SPECIFIC (x))
830 retrofit_lang_decl (x);
831 SET_DECL_LANGUAGE (x, lang_c);
835 if (DECL_NON_THUNK_FUNCTION_P (x) && ! DECL_FUNCTION_MEMBER_P (x))
837 t = push_overloaded_decl (x, PUSH_LOCAL, is_friend);
838 if (!namespace_bindings_p ())
839 /* We do not need to create a binding for this name;
840 push_overloaded_decl will have already done so if
842 need_new_binding = 0;
844 else if (DECL_FUNCTION_TEMPLATE_P (x) && DECL_NAMESPACE_SCOPE_P (x))
846 t = push_overloaded_decl (x, PUSH_GLOBAL, is_friend);
848 add_decl_to_level (x, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t)));
851 if (TREE_CODE (x) == FUNCTION_DECL || DECL_FUNCTION_TEMPLATE_P (x))
852 check_default_args (x);
854 if (t != x || DECL_FUNCTION_TEMPLATE_P (t))
855 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
857 /* If declaring a type as a typedef, copy the type (unless we're
858 at line 0), and install this TYPE_DECL as the new type's typedef
859 name. See the extensive comment of set_underlying_type (). */
860 if (TREE_CODE (x) == TYPE_DECL)
862 tree type = TREE_TYPE (x);
864 if (DECL_IS_BUILTIN (x)
865 || (TREE_TYPE (x) != error_mark_node
866 && TYPE_NAME (type) != x
867 /* We don't want to copy the type when all we're
868 doing is making a TYPE_DECL for the purposes of
870 && (!TYPE_NAME (type)
871 || TYPE_NAME (type) != DECL_ABSTRACT_ORIGIN (x))))
872 set_underlying_type (x);
874 if (type != error_mark_node
876 && TYPE_IDENTIFIER (type))
877 set_identifier_type_value (DECL_NAME (x), x);
880 /* Multiple external decls of the same identifier ought to match.
882 We get warnings about inline functions where they are defined.
883 We get warnings about other functions from push_overloaded_decl.
885 Avoid duplicate warnings where they are used. */
886 if (TREE_PUBLIC (x) && TREE_CODE (x) != FUNCTION_DECL)
890 decl = IDENTIFIER_NAMESPACE_VALUE (name);
891 if (decl && TREE_CODE (decl) == OVERLOAD)
892 decl = OVL_FUNCTION (decl);
894 if (decl && decl != error_mark_node
895 && (DECL_EXTERNAL (decl) || TREE_PUBLIC (decl))
896 /* If different sort of thing, we already gave an error. */
897 && TREE_CODE (decl) == TREE_CODE (x)
898 && !same_type_p (TREE_TYPE (x), TREE_TYPE (decl)))
900 permerror (input_location, "type mismatch with previous external decl of %q#D", x);
901 permerror (input_location, "previous external decl of %q+#D", decl);
905 if (TREE_CODE (x) == FUNCTION_DECL
907 && !flag_friend_injection)
909 /* This is a new declaration of a friend function, so hide
910 it from ordinary function lookup. */
911 DECL_ANTICIPATED (x) = 1;
912 DECL_HIDDEN_FRIEND_P (x) = 1;
915 /* This name is new in its binding level.
916 Install the new declaration and return it. */
917 if (namespace_bindings_p ())
919 /* Install a global value. */
921 /* If the first global decl has external linkage,
922 warn if we later see static one. */
923 if (IDENTIFIER_GLOBAL_VALUE (name) == NULL_TREE && TREE_PUBLIC (x))
924 TREE_PUBLIC (name) = 1;
926 /* Bind the name for the entity. */
927 if (!(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)
929 && (TREE_CODE (x) == TYPE_DECL
930 || TREE_CODE (x) == VAR_DECL
931 || TREE_CODE (x) == NAMESPACE_DECL
932 || TREE_CODE (x) == CONST_DECL
933 || TREE_CODE (x) == TEMPLATE_DECL))
934 SET_IDENTIFIER_NAMESPACE_VALUE (name, x);
936 /* If new decl is `static' and an `extern' was seen previously,
938 if (x != NULL_TREE && t != NULL_TREE && decls_match (x, t))
939 warn_extern_redeclared_static (x, t);
943 /* Here to install a non-global value. */
944 tree oldlocal = innermost_non_namespace_value (name);
945 tree oldglobal = IDENTIFIER_NAMESPACE_VALUE (name);
947 if (need_new_binding)
949 push_local_binding (name, x, 0);
950 /* Because push_local_binding will hook X on to the
951 current_binding_level's name list, we don't want to
952 do that again below. */
953 need_new_binding = 0;
956 /* If this is a TYPE_DECL, push it into the type value slot. */
957 if (TREE_CODE (x) == TYPE_DECL)
958 set_identifier_type_value (name, x);
960 /* Clear out any TYPE_DECL shadowed by a namespace so that
961 we won't think this is a type. The C struct hack doesn't
962 go through namespaces. */
963 if (TREE_CODE (x) == NAMESPACE_DECL)
964 set_identifier_type_value (name, NULL_TREE);
971 && TREE_CODE (oldlocal) == VAR_DECL
972 && DECL_DEAD_FOR_LOCAL (oldlocal))
973 oldlocal = DECL_SHADOWED_FOR_VAR (oldlocal);
975 if (oldlocal == NULL_TREE)
976 oldlocal = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d));
979 /* If this is an extern function declaration, see if we
980 have a global definition or declaration for the function. */
981 if (oldlocal == NULL_TREE
983 && oldglobal != NULL_TREE
984 && TREE_CODE (x) == FUNCTION_DECL
985 && TREE_CODE (oldglobal) == FUNCTION_DECL)
987 /* We have one. Their types must agree. */
988 if (decls_match (x, oldglobal))
992 warning (0, "extern declaration of %q#D doesn't match", x);
993 warning (0, "global declaration %q+#D", oldglobal);
996 /* If we have a local external declaration,
997 and no file-scope declaration has yet been seen,
998 then if we later have a file-scope decl it must not be static. */
999 if (oldlocal == NULL_TREE
1000 && oldglobal == NULL_TREE
1001 && DECL_EXTERNAL (x)
1003 TREE_PUBLIC (name) = 1;
1005 /* Don't complain about the parms we push and then pop
1006 while tentatively parsing a function declarator. */
1007 if (TREE_CODE (x) == PARM_DECL && DECL_CONTEXT (x) == NULL_TREE)
1010 /* Warn if shadowing an argument at the top level of the body. */
1011 else if (oldlocal != NULL_TREE && !DECL_EXTERNAL (x)
1012 /* Inline decls shadow nothing. */
1013 && !DECL_FROM_INLINE (x)
1014 && TREE_CODE (oldlocal) == PARM_DECL
1015 /* Don't check the `this' parameter. */
1016 && !DECL_ARTIFICIAL (oldlocal))
1020 /* Don't complain if it's from an enclosing function. */
1021 if (DECL_CONTEXT (oldlocal) == current_function_decl
1022 && TREE_CODE (x) != PARM_DECL)
1024 /* Go to where the parms should be and see if we find
1026 struct cp_binding_level *b = current_binding_level->level_chain;
1028 if (FUNCTION_NEEDS_BODY_BLOCK (current_function_decl))
1029 /* Skip the ctor/dtor cleanup level. */
1033 if (b->kind == sk_function_parms)
1035 error ("declaration of %q#D shadows a parameter", x);
1040 if (warn_shadow && !err)
1042 warning_at (input_location, OPT_Wshadow,
1043 "declaration of %q#D shadows a parameter", x);
1044 warning_at (DECL_SOURCE_LOCATION (oldlocal), OPT_Wshadow,
1045 "shadowed declaration is here");
1049 /* Maybe warn if shadowing something else. */
1050 else if (warn_shadow && !DECL_EXTERNAL (x)
1051 /* No shadow warnings for internally generated vars. */
1052 && ! DECL_ARTIFICIAL (x)
1053 /* No shadow warnings for vars made for inlining. */
1054 && ! DECL_FROM_INLINE (x))
1058 if (current_class_ptr)
1059 member = lookup_member (current_class_type,
1062 /*want_type=*/false);
1066 if (member && !TREE_STATIC (member))
1068 /* Location of previous decl is not useful in this case. */
1069 warning (OPT_Wshadow, "declaration of %qD shadows a member of 'this'",
1072 else if (oldlocal != NULL_TREE
1073 && TREE_CODE (oldlocal) == VAR_DECL)
1075 warning_at (input_location, OPT_Wshadow,
1076 "declaration of %qD shadows a previous local", x);
1077 warning_at (DECL_SOURCE_LOCATION (oldlocal), OPT_Wshadow,
1078 "shadowed declaration is here");
1080 else if (oldglobal != NULL_TREE
1081 && TREE_CODE (oldglobal) == VAR_DECL)
1082 /* XXX shadow warnings in outer-more namespaces */
1084 warning_at (input_location, OPT_Wshadow,
1085 "declaration of %qD shadows a global declaration", x);
1086 warning_at (DECL_SOURCE_LOCATION (oldglobal), OPT_Wshadow,
1087 "shadowed declaration is here");
1092 if (TREE_CODE (x) == VAR_DECL)
1093 maybe_register_incomplete_var (x);
1096 if (need_new_binding)
1097 add_decl_to_level (x,
1098 DECL_NAMESPACE_SCOPE_P (x)
1099 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x))
1100 : current_binding_level);
1102 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, x);
1105 /* Record a decl-node X as belonging to the current lexical scope. */
1110 return pushdecl_maybe_friend (x, false);
1113 /* Enter DECL into the symbol table, if that's appropriate. Returns
1114 DECL, or a modified version thereof. */
1117 maybe_push_decl (tree decl)
1119 tree type = TREE_TYPE (decl);
1121 /* Add this decl to the current binding level, but not if it comes
1122 from another scope, e.g. a static member variable. TEM may equal
1123 DECL or it may be a previous decl of the same name. */
1124 if (decl == error_mark_node
1125 || (TREE_CODE (decl) != PARM_DECL
1126 && DECL_CONTEXT (decl) != NULL_TREE
1127 /* Definitions of namespace members outside their namespace are
1129 && TREE_CODE (DECL_CONTEXT (decl)) != NAMESPACE_DECL)
1130 || (TREE_CODE (decl) == TEMPLATE_DECL && !namespace_bindings_p ())
1131 || TREE_CODE (type) == UNKNOWN_TYPE
1132 /* The declaration of a template specialization does not affect
1133 the functions available for overload resolution, so we do not
1135 || (TREE_CODE (decl) == FUNCTION_DECL
1136 && DECL_TEMPLATE_SPECIALIZATION (decl)))
1139 return pushdecl (decl);
1142 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1143 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1144 doesn't really belong to this binding level, that it got here
1145 through a using-declaration. */
1148 push_local_binding (tree id, tree decl, int flags)
1150 struct cp_binding_level *b;
1152 /* Skip over any local classes. This makes sense if we call
1153 push_local_binding with a friend decl of a local class. */
1154 b = innermost_nonclass_level ();
1156 if (lookup_name_innermost_nonclass_level (id))
1158 /* Supplement the existing binding. */
1159 if (!supplement_binding (IDENTIFIER_BINDING (id), decl))
1160 /* It didn't work. Something else must be bound at this
1161 level. Do not add DECL to the list of things to pop
1166 /* Create a new binding. */
1167 push_binding (id, decl, b);
1169 if (TREE_CODE (decl) == OVERLOAD || (flags & PUSH_USING))
1170 /* We must put the OVERLOAD into a TREE_LIST since the
1171 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1172 decls that got here through a using-declaration. */
1173 decl = build_tree_list (NULL_TREE, decl);
1175 /* And put DECL on the list of things declared by the current
1177 add_decl_to_level (decl, b);
1180 /* Check to see whether or not DECL is a variable that would have been
1181 in scope under the ARM, but is not in scope under the ANSI/ISO
1182 standard. If so, issue an error message. If name lookup would
1183 work in both cases, but return a different result, this function
1184 returns the result of ANSI/ISO lookup. Otherwise, it returns
1188 check_for_out_of_scope_variable (tree decl)
1192 /* We only care about out of scope variables. */
1193 if (!(TREE_CODE (decl) == VAR_DECL && DECL_DEAD_FOR_LOCAL (decl)))
1196 shadowed = DECL_HAS_SHADOWED_FOR_VAR_P (decl)
1197 ? DECL_SHADOWED_FOR_VAR (decl) : NULL_TREE ;
1198 while (shadowed != NULL_TREE && TREE_CODE (shadowed) == VAR_DECL
1199 && DECL_DEAD_FOR_LOCAL (shadowed))
1200 shadowed = DECL_HAS_SHADOWED_FOR_VAR_P (shadowed)
1201 ? DECL_SHADOWED_FOR_VAR (shadowed) : NULL_TREE;
1203 shadowed = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (decl));
1206 if (!DECL_ERROR_REPORTED (decl))
1208 warning (0, "name lookup of %qD changed", DECL_NAME (decl));
1209 warning (0, " matches this %q+D under ISO standard rules",
1211 warning (0, " matches this %q+D under old rules", decl);
1212 DECL_ERROR_REPORTED (decl) = 1;
1217 /* If we have already complained about this declaration, there's no
1218 need to do it again. */
1219 if (DECL_ERROR_REPORTED (decl))
1222 DECL_ERROR_REPORTED (decl) = 1;
1224 if (TREE_TYPE (decl) == error_mark_node)
1227 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
1229 error ("name lookup of %qD changed for ISO %<for%> scoping",
1231 error (" cannot use obsolete binding at %q+D because "
1232 "it has a destructor", decl);
1233 return error_mark_node;
1237 permerror (input_location, "name lookup of %qD changed for ISO %<for%> scoping",
1239 if (flag_permissive)
1240 permerror (input_location, " using obsolete binding at %q+D", decl);
1246 inform (input_location, "(if you use %<-fpermissive%> G++ will accept your code)");
1255 /* true means unconditionally make a BLOCK for the next level pushed. */
1257 static bool keep_next_level_flag;
1259 static int binding_depth = 0;
1266 for (i = 0; i < depth * 2; i++)
1270 /* Return a string describing the kind of SCOPE we have. */
1272 cxx_scope_descriptor (cxx_scope *scope)
1274 /* The order of this table must match the "scope_kind"
1276 static const char* scope_kind_names[] = {
1282 "function-parameter-scope",
1285 "template-parameter-scope",
1286 "template-explicit-spec-scope"
1288 const scope_kind kind = scope->explicit_spec_p
1289 ? sk_template_spec : scope->kind;
1291 return scope_kind_names[kind];
1294 /* Output a debugging information about SCOPE when performing
1297 cxx_scope_debug (cxx_scope *scope, int line, const char *action)
1299 const char *desc = cxx_scope_descriptor (scope);
1300 if (scope->this_entity)
1301 verbatim ("%s %s(%E) %p %d\n", action, desc,
1302 scope->this_entity, (void *) scope, line);
1304 verbatim ("%s %s %p %d\n", action, desc, (void *) scope, line);
1307 /* Return the estimated initial size of the hashtable of a NAMESPACE
1310 static inline size_t
1311 namespace_scope_ht_size (tree ns)
1313 tree name = DECL_NAME (ns);
1315 return name == std_identifier
1316 ? NAMESPACE_STD_HT_SIZE
1317 : (name == global_scope_name
1318 ? GLOBAL_SCOPE_HT_SIZE
1319 : NAMESPACE_ORDINARY_HT_SIZE);
1322 /* A chain of binding_level structures awaiting reuse. */
1324 static GTY((deletable)) struct cp_binding_level *free_binding_level;
1326 /* Insert SCOPE as the innermost binding level. */
1329 push_binding_level (struct cp_binding_level *scope)
1331 /* Add it to the front of currently active scopes stack. */
1332 scope->level_chain = current_binding_level;
1333 current_binding_level = scope;
1334 keep_next_level_flag = false;
1336 if (ENABLE_SCOPE_CHECKING)
1338 scope->binding_depth = binding_depth;
1339 indent (binding_depth);
1340 cxx_scope_debug (scope, input_line, "push");
1345 /* Create a new KIND scope and make it the top of the active scopes stack.
1346 ENTITY is the scope of the associated C++ entity (namespace, class,
1347 function, C++0x enumeration); it is NULL otherwise. */
1350 begin_scope (scope_kind kind, tree entity)
1354 /* Reuse or create a struct for this binding level. */
1355 if (!ENABLE_SCOPE_CHECKING && free_binding_level)
1357 scope = free_binding_level;
1358 memset (scope, 0, sizeof (cxx_scope));
1359 free_binding_level = scope->level_chain;
1362 scope = GGC_CNEW (cxx_scope);
1364 scope->this_entity = entity;
1365 scope->more_cleanups_ok = true;
1372 case sk_template_spec:
1373 scope->explicit_spec_p = true;
1374 kind = sk_template_parms;
1376 case sk_template_parms:
1382 case sk_scoped_enum:
1383 case sk_function_parms:
1385 scope->keep = keep_next_level_flag;
1389 NAMESPACE_LEVEL (entity) = scope;
1390 scope->static_decls =
1391 VEC_alloc (tree, gc,
1392 DECL_NAME (entity) == std_identifier
1393 || DECL_NAME (entity) == global_scope_name
1398 /* Should not happen. */
1404 push_binding_level (scope);
1409 /* We're about to leave current scope. Pop the top of the stack of
1410 currently active scopes. Return the enclosing scope, now active. */
1415 cxx_scope *scope = current_binding_level;
1417 if (scope->kind == sk_namespace && class_binding_level)
1418 current_binding_level = class_binding_level;
1420 /* We cannot leave a scope, if there are none left. */
1421 if (NAMESPACE_LEVEL (global_namespace))
1422 gcc_assert (!global_scope_p (scope));
1424 if (ENABLE_SCOPE_CHECKING)
1426 indent (--binding_depth);
1427 cxx_scope_debug (scope, input_line, "leave");
1430 /* Move one nesting level up. */
1431 current_binding_level = scope->level_chain;
1433 /* Namespace-scopes are left most probably temporarily, not
1434 completely; they can be reopened later, e.g. in namespace-extension
1435 or any name binding activity that requires us to resume a
1436 namespace. For classes, we cache some binding levels. For other
1437 scopes, we just make the structure available for reuse. */
1438 if (scope->kind != sk_namespace
1439 && scope->kind != sk_class)
1441 scope->level_chain = free_binding_level;
1442 gcc_assert (!ENABLE_SCOPE_CHECKING
1443 || scope->binding_depth == binding_depth);
1444 free_binding_level = scope;
1447 /* Find the innermost enclosing class scope, and reset
1448 CLASS_BINDING_LEVEL appropriately. */
1449 if (scope->kind == sk_class)
1451 class_binding_level = NULL;
1452 for (scope = current_binding_level; scope; scope = scope->level_chain)
1453 if (scope->kind == sk_class)
1455 class_binding_level = scope;
1460 return current_binding_level;
1464 resume_scope (struct cp_binding_level* b)
1466 /* Resuming binding levels is meant only for namespaces,
1467 and those cannot nest into classes. */
1468 gcc_assert (!class_binding_level);
1469 /* Also, resuming a non-directly nested namespace is a no-no. */
1470 gcc_assert (b->level_chain == current_binding_level);
1471 current_binding_level = b;
1472 if (ENABLE_SCOPE_CHECKING)
1474 b->binding_depth = binding_depth;
1475 indent (binding_depth);
1476 cxx_scope_debug (b, input_line, "resume");
1481 /* Return the innermost binding level that is not for a class scope. */
1484 innermost_nonclass_level (void)
1488 b = current_binding_level;
1489 while (b->kind == sk_class)
1495 /* We're defining an object of type TYPE. If it needs a cleanup, but
1496 we're not allowed to add any more objects with cleanups to the current
1497 scope, create a new binding level. */
1500 maybe_push_cleanup_level (tree type)
1502 if (type != error_mark_node
1503 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
1504 && current_binding_level->more_cleanups_ok == 0)
1506 begin_scope (sk_cleanup, NULL);
1507 current_binding_level->statement_list = push_stmt_list ();
1511 /* Nonzero if we are currently in the global binding level. */
1514 global_bindings_p (void)
1516 return global_scope_p (current_binding_level);
1519 /* True if we are currently in a toplevel binding level. This
1520 means either the global binding level or a namespace in a toplevel
1521 binding level. Since there are no non-toplevel namespace levels,
1522 this really means any namespace or template parameter level. We
1523 also include a class whose context is toplevel. */
1526 toplevel_bindings_p (void)
1528 struct cp_binding_level *b = innermost_nonclass_level ();
1530 return b->kind == sk_namespace || b->kind == sk_template_parms;
1533 /* True if this is a namespace scope, or if we are defining a class
1534 which is itself at namespace scope, or whose enclosing class is
1535 such a class, etc. */
1538 namespace_bindings_p (void)
1540 struct cp_binding_level *b = innermost_nonclass_level ();
1542 return b->kind == sk_namespace;
1545 /* True if the current level needs to have a BLOCK made. */
1550 return (current_binding_level->blocks != NULL_TREE
1551 || current_binding_level->keep
1552 || current_binding_level->kind == sk_cleanup
1553 || current_binding_level->names != NULL_TREE
1554 || current_binding_level->using_directives);
1557 /* Returns the kind of the innermost scope. */
1560 innermost_scope_kind (void)
1562 return current_binding_level->kind;
1565 /* Returns true if this scope was created to store template parameters. */
1568 template_parm_scope_p (void)
1570 return innermost_scope_kind () == sk_template_parms;
1573 /* If KEEP is true, make a BLOCK node for the next binding level,
1574 unconditionally. Otherwise, use the normal logic to decide whether
1575 or not to create a BLOCK. */
1578 keep_next_level (bool keep)
1580 keep_next_level_flag = keep;
1583 /* Return the list of declarations of the current level.
1584 Note that this list is in reverse order unless/until
1585 you nreverse it; and when you do nreverse it, you must
1586 store the result back using `storedecls' or you will lose. */
1591 return current_binding_level->names;
1594 /* For debugging. */
1595 static int no_print_functions = 0;
1596 static int no_print_builtins = 0;
1599 print_binding_level (struct cp_binding_level* lvl)
1603 fprintf (stderr, " blocks=%p", (void *) lvl->blocks);
1604 if (lvl->more_cleanups_ok)
1605 fprintf (stderr, " more-cleanups-ok");
1606 if (lvl->have_cleanups)
1607 fprintf (stderr, " have-cleanups");
1608 fprintf (stderr, "\n");
1611 fprintf (stderr, " names:\t");
1612 /* We can probably fit 3 names to a line? */
1613 for (t = lvl->names; t; t = TREE_CHAIN (t))
1615 if (no_print_functions && (TREE_CODE (t) == FUNCTION_DECL))
1617 if (no_print_builtins
1618 && (TREE_CODE (t) == TYPE_DECL)
1619 && DECL_IS_BUILTIN (t))
1622 /* Function decls tend to have longer names. */
1623 if (TREE_CODE (t) == FUNCTION_DECL)
1630 fprintf (stderr, "\n\t");
1633 print_node_brief (stderr, "", t, 0);
1634 if (t == error_mark_node)
1638 fprintf (stderr, "\n");
1640 if (VEC_length (cp_class_binding, lvl->class_shadowed))
1643 cp_class_binding *b;
1644 fprintf (stderr, " class-shadowed:");
1646 VEC_iterate(cp_class_binding, lvl->class_shadowed, i, b);
1648 fprintf (stderr, " %s ", IDENTIFIER_POINTER (b->identifier));
1649 fprintf (stderr, "\n");
1651 if (lvl->type_shadowed)
1653 fprintf (stderr, " type-shadowed:");
1654 for (t = lvl->type_shadowed; t; t = TREE_CHAIN (t))
1656 fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t)));
1658 fprintf (stderr, "\n");
1663 print_other_binding_stack (struct cp_binding_level *stack)
1665 struct cp_binding_level *level;
1666 for (level = stack; !global_scope_p (level); level = level->level_chain)
1668 fprintf (stderr, "binding level %p\n", (void *) level);
1669 print_binding_level (level);
1674 print_binding_stack (void)
1676 struct cp_binding_level *b;
1677 fprintf (stderr, "current_binding_level=%p\n"
1678 "class_binding_level=%p\n"
1679 "NAMESPACE_LEVEL (global_namespace)=%p\n",
1680 (void *) current_binding_level, (void *) class_binding_level,
1681 (void *) NAMESPACE_LEVEL (global_namespace));
1682 if (class_binding_level)
1684 for (b = class_binding_level; b; b = b->level_chain)
1685 if (b == current_binding_level)
1688 b = class_binding_level;
1690 b = current_binding_level;
1693 b = current_binding_level;
1694 print_other_binding_stack (b);
1695 fprintf (stderr, "global:\n");
1696 print_binding_level (NAMESPACE_LEVEL (global_namespace));
1699 /* Return the type associated with id. */
1702 identifier_type_value (tree id)
1704 timevar_push (TV_NAME_LOOKUP);
1705 /* There is no type with that name, anywhere. */
1706 if (REAL_IDENTIFIER_TYPE_VALUE (id) == NULL_TREE)
1707 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
1708 /* This is not the type marker, but the real thing. */
1709 if (REAL_IDENTIFIER_TYPE_VALUE (id) != global_type_node)
1710 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, REAL_IDENTIFIER_TYPE_VALUE (id));
1711 /* Have to search for it. It must be on the global level, now.
1712 Ask lookup_name not to return non-types. */
1713 id = lookup_name_real (id, 2, 1, /*block_p=*/true, 0, LOOKUP_COMPLAIN);
1715 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, TREE_TYPE (id));
1716 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
1719 /* Return the IDENTIFIER_GLOBAL_VALUE of T, for use in common code, since
1720 the definition of IDENTIFIER_GLOBAL_VALUE is different for C and C++. */
1723 identifier_global_value (tree t)
1725 return IDENTIFIER_GLOBAL_VALUE (t);
1728 /* Push a definition of struct, union or enum tag named ID. into
1729 binding_level B. DECL is a TYPE_DECL for the type. We assume that
1730 the tag ID is not already defined. */
1733 set_identifier_type_value_with_scope (tree id, tree decl, cxx_scope *b)
1737 if (b->kind != sk_namespace)
1739 /* Shadow the marker, not the real thing, so that the marker
1740 gets restored later. */
1741 tree old_type_value = REAL_IDENTIFIER_TYPE_VALUE (id);
1743 = tree_cons (id, old_type_value, b->type_shadowed);
1744 type = decl ? TREE_TYPE (decl) : NULL_TREE;
1745 TREE_TYPE (b->type_shadowed) = type;
1749 cxx_binding *binding =
1750 binding_for_name (NAMESPACE_LEVEL (current_namespace), id);
1753 supplement_binding (binding, decl);
1755 binding->value = decl;
1757 /* Store marker instead of real type. */
1758 type = global_type_node;
1760 SET_IDENTIFIER_TYPE_VALUE (id, type);
1763 /* As set_identifier_type_value_with_scope, but using
1764 current_binding_level. */
1767 set_identifier_type_value (tree id, tree decl)
1769 set_identifier_type_value_with_scope (id, decl, current_binding_level);
1772 /* Return the name for the constructor (or destructor) for the
1773 specified class TYPE. When given a template, this routine doesn't
1774 lose the specialization. */
1777 constructor_name_full (tree type)
1779 return TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type));
1782 /* Return the name for the constructor (or destructor) for the
1783 specified class. When given a template, return the plain
1784 unspecialized name. */
1787 constructor_name (tree type)
1790 name = constructor_name_full (type);
1791 if (IDENTIFIER_TEMPLATE (name))
1792 name = IDENTIFIER_TEMPLATE (name);
1796 /* Returns TRUE if NAME is the name for the constructor for TYPE,
1797 which must be a class type. */
1800 constructor_name_p (tree name, tree type)
1804 gcc_assert (MAYBE_CLASS_TYPE_P (type));
1809 if (TREE_CODE (name) != IDENTIFIER_NODE)
1812 ctor_name = constructor_name_full (type);
1813 if (name == ctor_name)
1815 if (IDENTIFIER_TEMPLATE (ctor_name)
1816 && name == IDENTIFIER_TEMPLATE (ctor_name))
1821 /* Counter used to create anonymous type names. */
1823 static GTY(()) int anon_cnt;
1825 /* Return an IDENTIFIER which can be used as a name for
1826 anonymous structs and unions. */
1829 make_anon_name (void)
1833 sprintf (buf, ANON_AGGRNAME_FORMAT, anon_cnt++);
1834 return get_identifier (buf);
1837 /* Return (from the stack of) the BINDING, if any, established at SCOPE. */
1839 static inline cxx_binding *
1840 find_binding (cxx_scope *scope, cxx_binding *binding)
1842 timevar_push (TV_NAME_LOOKUP);
1844 for (; binding != NULL; binding = binding->previous)
1845 if (binding->scope == scope)
1846 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, binding);
1848 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, (cxx_binding *)0);
1851 /* Return the binding for NAME in SCOPE, if any. Otherwise, return NULL. */
1853 static inline cxx_binding *
1854 cxx_scope_find_binding_for_name (cxx_scope *scope, tree name)
1856 cxx_binding *b = IDENTIFIER_NAMESPACE_BINDINGS (name);
1859 /* Fold-in case where NAME is used only once. */
1860 if (scope == b->scope && b->previous == NULL)
1862 return find_binding (scope, b);
1867 /* Always returns a binding for name in scope. If no binding is
1868 found, make a new one. */
1870 static cxx_binding *
1871 binding_for_name (cxx_scope *scope, tree name)
1873 cxx_binding *result;
1875 result = cxx_scope_find_binding_for_name (scope, name);
1878 /* Not found, make a new one. */
1879 result = cxx_binding_make (NULL, NULL);
1880 result->previous = IDENTIFIER_NAMESPACE_BINDINGS (name);
1881 result->scope = scope;
1882 result->is_local = false;
1883 result->value_is_inherited = false;
1884 IDENTIFIER_NAMESPACE_BINDINGS (name) = result;
1888 /* Walk through the bindings associated to the name of FUNCTION,
1889 and return the first binding that declares a function with a
1890 "C" linkage specification, a.k.a 'extern "C"'.
1891 This function looks for the binding, regardless of which scope it
1892 has been defined in. It basically looks in all the known scopes.
1893 Note that this function does not lookup for bindings of builtin functions
1894 or for functions declared in system headers. */
1896 lookup_extern_c_fun_binding_in_all_ns (tree function)
1901 gcc_assert (function && TREE_CODE (function) == FUNCTION_DECL);
1903 name = DECL_NAME (function);
1904 gcc_assert (name && TREE_CODE (name) == IDENTIFIER_NODE);
1906 for (iter = IDENTIFIER_NAMESPACE_BINDINGS (name);
1908 iter = iter->previous)
1911 && TREE_CODE (iter->value) == FUNCTION_DECL
1912 && DECL_EXTERN_C_P (iter->value)
1913 && !DECL_ARTIFICIAL (iter->value))
1921 /* Insert another USING_DECL into the current binding level, returning
1922 this declaration. If this is a redeclaration, do nothing, and
1923 return NULL_TREE if this not in namespace scope (in namespace
1924 scope, a using decl might extend any previous bindings). */
1927 push_using_decl (tree scope, tree name)
1931 timevar_push (TV_NAME_LOOKUP);
1932 gcc_assert (TREE_CODE (scope) == NAMESPACE_DECL);
1933 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
1934 for (decl = current_binding_level->usings; decl; decl = TREE_CHAIN (decl))
1935 if (USING_DECL_SCOPE (decl) == scope && DECL_NAME (decl) == name)
1938 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP,
1939 namespace_bindings_p () ? decl : NULL_TREE);
1940 decl = build_lang_decl (USING_DECL, name, NULL_TREE);
1941 USING_DECL_SCOPE (decl) = scope;
1942 TREE_CHAIN (decl) = current_binding_level->usings;
1943 current_binding_level->usings = decl;
1944 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl);
1947 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
1948 caller to set DECL_CONTEXT properly. */
1951 pushdecl_with_scope (tree x, cxx_scope *level, bool is_friend)
1953 struct cp_binding_level *b;
1954 tree function_decl = current_function_decl;
1956 timevar_push (TV_NAME_LOOKUP);
1957 current_function_decl = NULL_TREE;
1958 if (level->kind == sk_class)
1960 b = class_binding_level;
1961 class_binding_level = level;
1962 pushdecl_class_level (x);
1963 class_binding_level = b;
1967 b = current_binding_level;
1968 current_binding_level = level;
1969 x = pushdecl_maybe_friend (x, is_friend);
1970 current_binding_level = b;
1972 current_function_decl = function_decl;
1973 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, x);
1976 /* DECL is a FUNCTION_DECL for a non-member function, which may have
1977 other definitions already in place. We get around this by making
1978 the value of the identifier point to a list of all the things that
1979 want to be referenced by that name. It is then up to the users of
1980 that name to decide what to do with that list.
1982 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
1983 DECL_TEMPLATE_RESULT. It is dealt with the same way.
1985 FLAGS is a bitwise-or of the following values:
1986 PUSH_LOCAL: Bind DECL in the current scope, rather than at
1988 PUSH_USING: DECL is being pushed as the result of a using
1991 IS_FRIEND is true if this is a friend declaration.
1993 The value returned may be a previous declaration if we guessed wrong
1994 about what language DECL should belong to (C or C++). Otherwise,
1995 it's always DECL (and never something that's not a _DECL). */
1998 push_overloaded_decl (tree decl, int flags, bool is_friend)
2000 tree name = DECL_NAME (decl);
2003 int doing_global = (namespace_bindings_p () || !(flags & PUSH_LOCAL));
2005 timevar_push (TV_NAME_LOOKUP);
2007 old = namespace_binding (name, DECL_CONTEXT (decl));
2009 old = lookup_name_innermost_nonclass_level (name);
2013 if (TREE_CODE (old) == TYPE_DECL && DECL_ARTIFICIAL (old))
2015 tree t = TREE_TYPE (old);
2016 if (MAYBE_CLASS_TYPE_P (t) && warn_shadow
2017 && (! DECL_IN_SYSTEM_HEADER (decl)
2018 || ! DECL_IN_SYSTEM_HEADER (old)))
2019 warning (OPT_Wshadow, "%q#D hides constructor for %q#T", decl, t);
2022 else if (is_overloaded_fn (old))
2026 for (tmp = old; tmp; tmp = OVL_NEXT (tmp))
2028 tree fn = OVL_CURRENT (tmp);
2031 if (TREE_CODE (tmp) == OVERLOAD && OVL_USED (tmp)
2032 && !(flags & PUSH_USING)
2033 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)),
2034 TYPE_ARG_TYPES (TREE_TYPE (decl)))
2035 && ! decls_match (fn, decl))
2036 error ("%q#D conflicts with previous using declaration %q#D",
2039 dup = duplicate_decls (decl, fn, is_friend);
2040 /* If DECL was a redeclaration of FN -- even an invalid
2041 one -- pass that information along to our caller. */
2042 if (dup == fn || dup == error_mark_node)
2043 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, dup);
2046 /* We don't overload implicit built-ins. duplicate_decls()
2047 may fail to merge the decls if the new decl is e.g. a
2048 template function. */
2049 if (TREE_CODE (old) == FUNCTION_DECL
2050 && DECL_ANTICIPATED (old)
2051 && !DECL_HIDDEN_FRIEND_P (old))
2054 else if (old == error_mark_node)
2055 /* Ignore the undefined symbol marker. */
2059 error ("previous non-function declaration %q+#D", old);
2060 error ("conflicts with function declaration %q#D", decl);
2061 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl);
2065 if (old || TREE_CODE (decl) == TEMPLATE_DECL
2066 /* If it's a using declaration, we always need to build an OVERLOAD,
2067 because it's the only way to remember that the declaration comes
2068 from 'using', and have the lookup behave correctly. */
2069 || (flags & PUSH_USING))
2071 if (old && TREE_CODE (old) != OVERLOAD)
2072 new_binding = ovl_cons (decl, ovl_cons (old, NULL_TREE));
2074 new_binding = ovl_cons (decl, old);
2075 if (flags & PUSH_USING)
2076 OVL_USED (new_binding) = 1;
2079 /* NAME is not ambiguous. */
2083 set_namespace_binding (name, current_namespace, new_binding);
2086 /* We only create an OVERLOAD if there was a previous binding at
2087 this level, or if decl is a template. In the former case, we
2088 need to remove the old binding and replace it with the new
2089 binding. We must also run through the NAMES on the binding
2090 level where the name was bound to update the chain. */
2092 if (TREE_CODE (new_binding) == OVERLOAD && old)
2096 for (d = &IDENTIFIER_BINDING (name)->scope->names;
2098 d = &TREE_CHAIN (*d))
2100 || (TREE_CODE (*d) == TREE_LIST
2101 && TREE_VALUE (*d) == old))
2103 if (TREE_CODE (*d) == TREE_LIST)
2104 /* Just replace the old binding with the new. */
2105 TREE_VALUE (*d) = new_binding;
2107 /* Build a TREE_LIST to wrap the OVERLOAD. */
2108 *d = tree_cons (NULL_TREE, new_binding,
2111 /* And update the cxx_binding node. */
2112 IDENTIFIER_BINDING (name)->value = new_binding;
2113 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl);
2116 /* We should always find a previous binding in this case. */
2120 /* Install the new binding. */
2121 push_local_binding (name, new_binding, flags);
2124 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl);
2127 /* Check a non-member using-declaration. Return the name and scope
2128 being used, and the USING_DECL, or NULL_TREE on failure. */
2131 validate_nonmember_using_decl (tree decl, tree scope, tree name)
2133 /* [namespace.udecl]
2134 A using-declaration for a class member shall be a
2135 member-declaration. */
2138 error ("%qT is not a namespace", scope);
2141 else if (scope == error_mark_node)
2144 if (TREE_CODE (decl) == TEMPLATE_ID_EXPR)
2147 A using-declaration shall not name a template-id. */
2148 error ("a using-declaration cannot specify a template-id. "
2149 "Try %<using %D%>", name);
2153 if (TREE_CODE (decl) == NAMESPACE_DECL)
2155 error ("namespace %qD not allowed in using-declaration", decl);
2159 if (TREE_CODE (decl) == SCOPE_REF)
2161 /* It's a nested name with template parameter dependent scope.
2162 This can only be using-declaration for class member. */
2163 error ("%qT is not a namespace", TREE_OPERAND (decl, 0));
2167 if (is_overloaded_fn (decl))
2168 decl = get_first_fn (decl);
2170 gcc_assert (DECL_P (decl));
2172 /* Make a USING_DECL. */
2173 return push_using_decl (scope, name);
2176 /* Process local and global using-declarations. */
2179 do_nonmember_using_decl (tree scope, tree name, tree oldval, tree oldtype,
2180 tree *newval, tree *newtype)
2182 struct scope_binding decls = EMPTY_SCOPE_BINDING;
2184 *newval = *newtype = NULL_TREE;
2185 if (!qualified_lookup_using_namespace (name, scope, &decls, 0))
2189 if (!decls.value && !decls.type)
2191 error ("%qD not declared", name);
2195 /* Shift the old and new bindings around so we're comparing class and
2196 enumeration names to each other. */
2197 if (oldval && DECL_IMPLICIT_TYPEDEF_P (oldval))
2203 if (decls.value && DECL_IMPLICIT_TYPEDEF_P (decls.value))
2205 decls.type = decls.value;
2206 decls.value = NULL_TREE;
2209 /* It is impossible to overload a built-in function; any explicit
2210 declaration eliminates the built-in declaration. So, if OLDVAL
2211 is a built-in, then we can just pretend it isn't there. */
2213 && TREE_CODE (oldval) == FUNCTION_DECL
2214 && DECL_ANTICIPATED (oldval)
2215 && !DECL_HIDDEN_FRIEND_P (oldval))
2220 /* Check for using functions. */
2221 if (is_overloaded_fn (decls.value))
2225 if (oldval && !is_overloaded_fn (oldval))
2227 error ("%qD is already declared in this scope", name);
2232 for (tmp = decls.value; tmp; tmp = OVL_NEXT (tmp))
2234 tree new_fn = OVL_CURRENT (tmp);
2236 /* [namespace.udecl]
2238 If a function declaration in namespace scope or block
2239 scope has the same name and the same parameter types as a
2240 function introduced by a using declaration the program is
2242 for (tmp1 = oldval; tmp1; tmp1 = OVL_NEXT (tmp1))
2244 tree old_fn = OVL_CURRENT (tmp1);
2246 if (new_fn == old_fn)
2247 /* The function already exists in the current namespace. */
2249 else if (OVL_USED (tmp1))
2250 continue; /* this is a using decl */
2251 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (new_fn)),
2252 TYPE_ARG_TYPES (TREE_TYPE (old_fn))))
2254 gcc_assert (!DECL_ANTICIPATED (old_fn)
2255 || DECL_HIDDEN_FRIEND_P (old_fn));
2257 /* There was already a non-using declaration in
2258 this scope with the same parameter types. If both
2259 are the same extern "C" functions, that's ok. */
2260 if (decls_match (new_fn, old_fn))
2264 error ("%qD is already declared in this scope", name);
2270 /* If we broke out of the loop, there's no reason to add
2271 this function to the using declarations for this
2276 /* If we are adding to an existing OVERLOAD, then we no
2277 longer know the type of the set of functions. */
2278 if (*newval && TREE_CODE (*newval) == OVERLOAD)
2279 TREE_TYPE (*newval) = unknown_type_node;
2280 /* Add this new function to the set. */
2281 *newval = build_overload (OVL_CURRENT (tmp), *newval);
2282 /* If there is only one function, then we use its type. (A
2283 using-declaration naming a single function can be used in
2284 contexts where overload resolution cannot be
2286 if (TREE_CODE (*newval) != OVERLOAD)
2288 *newval = ovl_cons (*newval, NULL_TREE);
2289 TREE_TYPE (*newval) = TREE_TYPE (OVL_CURRENT (tmp));
2291 OVL_USED (*newval) = 1;
2296 *newval = decls.value;
2297 if (oldval && !decls_match (*newval, oldval))
2298 error ("%qD is already declared in this scope", name);
2304 if (decls.type && TREE_CODE (decls.type) == TREE_LIST)
2306 error ("reference to %qD is ambiguous", name);
2307 print_candidates (decls.type);
2311 *newtype = decls.type;
2312 if (oldtype && *newtype && !decls_match (oldtype, *newtype))
2313 error ("%qD is already declared in this scope", name);
2316 /* If *newval is empty, shift any class or enumeration name down. */
2320 *newtype = NULL_TREE;
2324 /* Process a using-declaration at function scope. */
2327 do_local_using_decl (tree decl, tree scope, tree name)
2329 tree oldval, oldtype, newval, newtype;
2330 tree orig_decl = decl;
2332 decl = validate_nonmember_using_decl (decl, scope, name);
2333 if (decl == NULL_TREE)
2336 if (building_stmt_tree ()
2337 && at_function_scope_p ())
2338 add_decl_expr (decl);
2340 oldval = lookup_name_innermost_nonclass_level (name);
2341 oldtype = lookup_type_current_level (name);
2343 do_nonmember_using_decl (scope, name, oldval, oldtype, &newval, &newtype);
2347 if (is_overloaded_fn (newval))
2351 /* We only need to push declarations for those functions
2352 that were not already bound in the current level.
2353 The old value might be NULL_TREE, it might be a single
2354 function, or an OVERLOAD. */
2355 if (oldval && TREE_CODE (oldval) == OVERLOAD)
2356 term = OVL_FUNCTION (oldval);
2359 for (fn = newval; fn && OVL_CURRENT (fn) != term;
2361 push_overloaded_decl (OVL_CURRENT (fn),
2362 PUSH_LOCAL | PUSH_USING,
2366 push_local_binding (name, newval, PUSH_USING);
2370 push_local_binding (name, newtype, PUSH_USING);
2371 set_identifier_type_value (name, newtype);
2374 /* Emit debug info. */
2375 if (!processing_template_decl)
2376 cp_emit_debug_info_for_using (orig_decl, current_scope());
2379 /* Returns true if ROOT (a namespace, class, or function) encloses
2380 CHILD. CHILD may be either a class type or a namespace. */
2383 is_ancestor (tree root, tree child)
2385 gcc_assert ((TREE_CODE (root) == NAMESPACE_DECL
2386 || TREE_CODE (root) == FUNCTION_DECL
2387 || CLASS_TYPE_P (root)));
2388 gcc_assert ((TREE_CODE (child) == NAMESPACE_DECL
2389 || CLASS_TYPE_P (child)));
2391 /* The global namespace encloses everything. */
2392 if (root == global_namespace)
2397 /* If we've run out of scopes, stop. */
2400 /* If we've reached the ROOT, it encloses CHILD. */
2403 /* Go out one level. */
2405 child = TYPE_NAME (child);
2406 child = DECL_CONTEXT (child);
2410 /* Enter the class or namespace scope indicated by T suitable for name
2411 lookup. T can be arbitrary scope, not necessary nested inside the
2412 current scope. Returns a non-null scope to pop iff pop_scope
2413 should be called later to exit this scope. */
2418 if (TREE_CODE (t) == NAMESPACE_DECL)
2419 push_decl_namespace (t);
2420 else if (CLASS_TYPE_P (t))
2422 if (!at_class_scope_p ()
2423 || !same_type_p (current_class_type, t))
2424 push_nested_class (t);
2426 /* T is the same as the current scope. There is therefore no
2427 need to re-enter the scope. Since we are not actually
2428 pushing a new scope, our caller should not call
2436 /* Leave scope pushed by push_scope. */
2441 if (TREE_CODE (t) == NAMESPACE_DECL)
2442 pop_decl_namespace ();
2443 else if CLASS_TYPE_P (t)
2444 pop_nested_class ();
2447 /* Subroutine of push_inner_scope. */
2450 push_inner_scope_r (tree outer, tree inner)
2455 || (TREE_CODE (inner) != NAMESPACE_DECL && !CLASS_TYPE_P (inner)))
2458 prev = CP_DECL_CONTEXT (TREE_CODE (inner) == NAMESPACE_DECL ? inner : TYPE_NAME (inner));
2460 push_inner_scope_r (outer, prev);
2461 if (TREE_CODE (inner) == NAMESPACE_DECL)
2463 struct cp_binding_level *save_template_parm = 0;
2464 /* Temporary take out template parameter scopes. They are saved
2465 in reversed order in save_template_parm. */
2466 while (current_binding_level->kind == sk_template_parms)
2468 struct cp_binding_level *b = current_binding_level;
2469 current_binding_level = b->level_chain;
2470 b->level_chain = save_template_parm;
2471 save_template_parm = b;
2474 resume_scope (NAMESPACE_LEVEL (inner));
2475 current_namespace = inner;
2477 /* Restore template parameter scopes. */
2478 while (save_template_parm)
2480 struct cp_binding_level *b = save_template_parm;
2481 save_template_parm = b->level_chain;
2482 b->level_chain = current_binding_level;
2483 current_binding_level = b;
2490 /* Enter the scope INNER from current scope. INNER must be a scope
2491 nested inside current scope. This works with both name lookup and
2492 pushing name into scope. In case a template parameter scope is present,
2493 namespace is pushed under the template parameter scope according to
2494 name lookup rule in 14.6.1/6.
2496 Return the former current scope suitable for pop_inner_scope. */
2499 push_inner_scope (tree inner)
2501 tree outer = current_scope ();
2503 outer = current_namespace;
2505 push_inner_scope_r (outer, inner);
2509 /* Exit the current scope INNER back to scope OUTER. */
2512 pop_inner_scope (tree outer, tree inner)
2515 || (TREE_CODE (inner) != NAMESPACE_DECL && !CLASS_TYPE_P (inner)))
2518 while (outer != inner)
2520 if (TREE_CODE (inner) == NAMESPACE_DECL)
2522 struct cp_binding_level *save_template_parm = 0;
2523 /* Temporary take out template parameter scopes. They are saved
2524 in reversed order in save_template_parm. */
2525 while (current_binding_level->kind == sk_template_parms)
2527 struct cp_binding_level *b = current_binding_level;
2528 current_binding_level = b->level_chain;
2529 b->level_chain = save_template_parm;
2530 save_template_parm = b;
2535 /* Restore template parameter scopes. */
2536 while (save_template_parm)
2538 struct cp_binding_level *b = save_template_parm;
2539 save_template_parm = b->level_chain;
2540 b->level_chain = current_binding_level;
2541 current_binding_level = b;
2547 inner = CP_DECL_CONTEXT (TREE_CODE (inner) == NAMESPACE_DECL ? inner : TYPE_NAME (inner));
2551 /* Do a pushlevel for class declarations. */
2554 pushlevel_class (void)
2556 class_binding_level = begin_scope (sk_class, current_class_type);
2559 /* ...and a poplevel for class declarations. */
2562 poplevel_class (void)
2564 struct cp_binding_level *level = class_binding_level;
2565 cp_class_binding *cb;
2569 timevar_push (TV_NAME_LOOKUP);
2570 gcc_assert (level != 0);
2572 /* If we're leaving a toplevel class, cache its binding level. */
2573 if (current_class_depth == 1)
2574 previous_class_level = level;
2575 for (shadowed = level->type_shadowed;
2577 shadowed = TREE_CHAIN (shadowed))
2578 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed), TREE_VALUE (shadowed));
2580 /* Remove the bindings for all of the class-level declarations. */
2581 if (level->class_shadowed)
2584 VEC_iterate (cp_class_binding, level->class_shadowed, i, cb);
2586 IDENTIFIER_BINDING (cb->identifier) = cb->base.previous;
2587 ggc_free (level->class_shadowed);
2588 level->class_shadowed = NULL;
2591 /* Now, pop out of the binding level which we created up in the
2592 `pushlevel_class' routine. */
2593 gcc_assert (current_binding_level == level);
2595 timevar_pop (TV_NAME_LOOKUP);
2598 /* Set INHERITED_VALUE_BINDING_P on BINDING to true or false, as
2599 appropriate. DECL is the value to which a name has just been
2600 bound. CLASS_TYPE is the class in which the lookup occurred. */
2603 set_inherited_value_binding_p (cxx_binding *binding, tree decl,
2606 if (binding->value == decl && TREE_CODE (decl) != TREE_LIST)
2610 if (TREE_CODE (decl) == OVERLOAD)
2611 context = CP_DECL_CONTEXT (OVL_CURRENT (decl));
2614 gcc_assert (DECL_P (decl));
2615 context = context_for_name_lookup (decl);
2618 if (is_properly_derived_from (class_type, context))
2619 INHERITED_VALUE_BINDING_P (binding) = 1;
2621 INHERITED_VALUE_BINDING_P (binding) = 0;
2623 else if (binding->value == decl)
2624 /* We only encounter a TREE_LIST when there is an ambiguity in the
2625 base classes. Such an ambiguity can be overridden by a
2626 definition in this class. */
2627 INHERITED_VALUE_BINDING_P (binding) = 1;
2629 INHERITED_VALUE_BINDING_P (binding) = 0;
2632 /* Make the declaration of X appear in CLASS scope. */
2635 pushdecl_class_level (tree x)
2638 bool is_valid = true;
2640 timevar_push (TV_NAME_LOOKUP);
2641 /* Get the name of X. */
2642 if (TREE_CODE (x) == OVERLOAD)
2643 name = DECL_NAME (get_first_fn (x));
2645 name = DECL_NAME (x);
2649 is_valid = push_class_level_binding (name, x);
2650 if (TREE_CODE (x) == TYPE_DECL)
2651 set_identifier_type_value (name, x);
2653 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x)))
2655 /* If X is an anonymous aggregate, all of its members are
2656 treated as if they were members of the class containing the
2657 aggregate, for naming purposes. */
2660 for (f = TYPE_FIELDS (TREE_TYPE (x)); f; f = TREE_CHAIN (f))
2662 location_t save_location = input_location;
2663 input_location = DECL_SOURCE_LOCATION (f);
2664 if (!pushdecl_class_level (f))
2666 input_location = save_location;
2669 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, is_valid);
2672 /* Return the BINDING (if any) for NAME in SCOPE, which is a class
2673 scope. If the value returned is non-NULL, and the PREVIOUS field
2674 is not set, callers must set the PREVIOUS field explicitly. */
2676 static cxx_binding *
2677 get_class_binding (tree name, cxx_scope *scope)
2682 cxx_binding *binding;
2684 class_type = scope->this_entity;
2686 /* Get the type binding. */
2687 type_binding = lookup_member (class_type, name,
2688 /*protect=*/2, /*want_type=*/true);
2689 /* Get the value binding. */
2690 value_binding = lookup_member (class_type, name,
2691 /*protect=*/2, /*want_type=*/false);
2694 && (TREE_CODE (value_binding) == TYPE_DECL
2695 || DECL_CLASS_TEMPLATE_P (value_binding)
2696 || (TREE_CODE (value_binding) == TREE_LIST
2697 && TREE_TYPE (value_binding) == error_mark_node
2698 && (TREE_CODE (TREE_VALUE (value_binding))
2700 /* We found a type binding, even when looking for a non-type
2701 binding. This means that we already processed this binding
2704 else if (value_binding)
2706 if (TREE_CODE (value_binding) == TREE_LIST
2707 && TREE_TYPE (value_binding) == error_mark_node)
2708 /* NAME is ambiguous. */
2710 else if (BASELINK_P (value_binding))
2711 /* NAME is some overloaded functions. */
2712 value_binding = BASELINK_FUNCTIONS (value_binding);
2715 /* If we found either a type binding or a value binding, create a
2716 new binding object. */
2717 if (type_binding || value_binding)
2719 binding = new_class_binding (name,
2723 /* This is a class-scope binding, not a block-scope binding. */
2724 LOCAL_BINDING_P (binding) = 0;
2725 set_inherited_value_binding_p (binding, value_binding, class_type);
2733 /* Make the declaration(s) of X appear in CLASS scope under the name
2734 NAME. Returns true if the binding is valid. */
2737 push_class_level_binding (tree name, tree x)
2739 cxx_binding *binding;
2743 timevar_push (TV_NAME_LOOKUP);
2744 /* The class_binding_level will be NULL if x is a template
2745 parameter name in a member template. */
2746 if (!class_binding_level)
2747 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, true);
2749 if (name == error_mark_node)
2750 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, false);
2752 /* Check for invalid member names. */
2753 gcc_assert (TYPE_BEING_DEFINED (current_class_type));
2754 /* Check that we're pushing into the right binding level. */
2755 gcc_assert (current_class_type == class_binding_level->this_entity);
2757 /* We could have been passed a tree list if this is an ambiguous
2758 declaration. If so, pull the declaration out because
2759 check_template_shadow will not handle a TREE_LIST. */
2760 if (TREE_CODE (decl) == TREE_LIST
2761 && TREE_TYPE (decl) == error_mark_node)
2762 decl = TREE_VALUE (decl);
2764 if (!check_template_shadow (decl))
2765 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, false);
2769 If T is the name of a class, then each of the following shall
2770 have a name different from T:
2772 -- every static data member of class T;
2774 -- every member of class T that is itself a type;
2776 -- every enumerator of every member of class T that is an
2779 -- every member of every anonymous union that is a member of
2782 (Non-static data members were also forbidden to have the same
2783 name as T until TC1.) */
2784 if ((TREE_CODE (x) == VAR_DECL
2785 || TREE_CODE (x) == CONST_DECL
2786 || (TREE_CODE (x) == TYPE_DECL
2787 && !DECL_SELF_REFERENCE_P (x))
2788 /* A data member of an anonymous union. */
2789 || (TREE_CODE (x) == FIELD_DECL
2790 && DECL_CONTEXT (x) != current_class_type))
2791 && DECL_NAME (x) == constructor_name (current_class_type))
2793 tree scope = context_for_name_lookup (x);
2794 if (TYPE_P (scope) && same_type_p (scope, current_class_type))
2796 error ("%qD has the same name as the class in which it is "
2799 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, false);
2803 /* Get the current binding for NAME in this class, if any. */
2804 binding = IDENTIFIER_BINDING (name);
2805 if (!binding || binding->scope != class_binding_level)
2807 binding = get_class_binding (name, class_binding_level);
2808 /* If a new binding was created, put it at the front of the
2809 IDENTIFIER_BINDING list. */
2812 binding->previous = IDENTIFIER_BINDING (name);
2813 IDENTIFIER_BINDING (name) = binding;
2817 /* If there is already a binding, then we may need to update the
2819 if (binding && binding->value)
2821 tree bval = binding->value;
2822 tree old_decl = NULL_TREE;
2824 if (INHERITED_VALUE_BINDING_P (binding))
2826 /* If the old binding was from a base class, and was for a
2827 tag name, slide it over to make room for the new binding.
2828 The old binding is still visible if explicitly qualified
2829 with a class-key. */
2830 if (TREE_CODE (bval) == TYPE_DECL && DECL_ARTIFICIAL (bval)
2831 && !(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)))
2833 old_decl = binding->type;
2834 binding->type = bval;
2835 binding->value = NULL_TREE;
2836 INHERITED_VALUE_BINDING_P (binding) = 0;
2841 /* Any inherited type declaration is hidden by the type
2842 declaration in the derived class. */
2843 if (TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x))
2844 binding->type = NULL_TREE;
2847 else if (TREE_CODE (x) == OVERLOAD && is_overloaded_fn (bval))
2849 else if (TREE_CODE (x) == USING_DECL && TREE_CODE (bval) == USING_DECL)
2850 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, true);
2851 else if (TREE_CODE (x) == USING_DECL && is_overloaded_fn (bval))
2853 else if (TREE_CODE (bval) == USING_DECL && is_overloaded_fn (x))
2854 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, true);
2856 if (old_decl && binding->scope == class_binding_level)
2859 /* It is always safe to clear INHERITED_VALUE_BINDING_P
2860 here. This function is only used to register bindings
2861 from with the class definition itself. */
2862 INHERITED_VALUE_BINDING_P (binding) = 0;
2863 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, true);
2867 /* Note that we declared this value so that we can issue an error if
2868 this is an invalid redeclaration of a name already used for some
2870 note_name_declared_in_class (name, decl);
2872 /* If we didn't replace an existing binding, put the binding on the
2873 stack of bindings for the identifier, and update the shadowed
2875 if (binding && binding->scope == class_binding_level)
2876 /* Supplement the existing binding. */
2877 ok = supplement_binding (binding, decl);
2880 /* Create a new binding. */
2881 push_binding (name, decl, class_binding_level);
2885 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, ok);
2888 /* Process "using SCOPE::NAME" in a class scope. Return the
2889 USING_DECL created. */
2892 do_class_using_decl (tree scope, tree name)
2894 /* The USING_DECL returned by this function. */
2896 /* The declaration (or declarations) name by this using
2897 declaration. NULL if we are in a template and cannot figure out
2898 what has been named. */
2900 /* True if SCOPE is a dependent type. */
2901 bool scope_dependent_p;
2902 /* True if SCOPE::NAME is dependent. */
2903 bool name_dependent_p;
2904 /* True if any of the bases of CURRENT_CLASS_TYPE are dependent. */
2905 bool bases_dependent_p;
2910 if (name == error_mark_node)
2913 if (!scope || !TYPE_P (scope))
2915 error ("using-declaration for non-member at class scope");
2919 /* Make sure the name is not invalid */
2920 if (TREE_CODE (name) == BIT_NOT_EXPR)
2922 error ("%<%T::%D%> names destructor", scope, name);
2925 if (MAYBE_CLASS_TYPE_P (scope) && constructor_name_p (name, scope))
2927 error ("%<%T::%D%> names constructor", scope, name);
2930 if (constructor_name_p (name, current_class_type))
2932 error ("%<%T::%D%> names constructor in %qT",
2933 scope, name, current_class_type);
2937 scope_dependent_p = dependent_type_p (scope);
2938 name_dependent_p = (scope_dependent_p
2939 || (IDENTIFIER_TYPENAME_P (name)
2940 && dependent_type_p (TREE_TYPE (name))));
2942 bases_dependent_p = false;
2943 if (processing_template_decl)
2944 for (binfo = TYPE_BINFO (current_class_type), i = 0;
2945 BINFO_BASE_ITERATE (binfo, i, base_binfo);
2947 if (dependent_type_p (TREE_TYPE (base_binfo)))
2949 bases_dependent_p = true;
2955 /* From [namespace.udecl]:
2957 A using-declaration used as a member-declaration shall refer to a
2958 member of a base class of the class being defined.
2960 In general, we cannot check this constraint in a template because
2961 we do not know the entire set of base classes of the current
2962 class type. However, if all of the base classes are
2963 non-dependent, then we can avoid delaying the check until
2965 if (!scope_dependent_p)
2968 binfo = lookup_base (current_class_type, scope, ba_any, &b_kind);
2969 if (b_kind < bk_proper_base)
2971 if (!bases_dependent_p)
2973 error_not_base_type (scope, current_class_type);
2977 else if (!name_dependent_p)
2979 decl = lookup_member (binfo, name, 0, false);
2982 error ("no members matching %<%T::%D%> in %q#T", scope, name,
2986 /* The binfo from which the functions came does not matter. */
2987 if (BASELINK_P (decl))
2988 decl = BASELINK_FUNCTIONS (decl);
2992 value = build_lang_decl (USING_DECL, name, NULL_TREE);
2993 USING_DECL_DECLS (value) = decl;
2994 USING_DECL_SCOPE (value) = scope;
2995 DECL_DEPENDENT_P (value) = !decl;
3001 /* Return the binding value for name in scope. */
3004 namespace_binding (tree name, tree scope)
3006 cxx_binding *binding;
3009 scope = global_namespace;
3011 /* Unnecessary for the global namespace because it can't be an alias. */
3012 scope = ORIGINAL_NAMESPACE (scope);
3014 binding = cxx_scope_find_binding_for_name (NAMESPACE_LEVEL (scope), name);
3016 return binding ? binding->value : NULL_TREE;
3019 /* Set the binding value for name in scope. */
3022 set_namespace_binding (tree name, tree scope, tree val)
3026 timevar_push (TV_NAME_LOOKUP);
3027 if (scope == NULL_TREE)
3028 scope = global_namespace;
3029 b = binding_for_name (NAMESPACE_LEVEL (scope), name);
3030 if (!b->value || TREE_CODE (val) == OVERLOAD || val == error_mark_node)
3033 supplement_binding (b, val);
3034 timevar_pop (TV_NAME_LOOKUP);
3037 /* Set the context of a declaration to scope. Complain if we are not
3041 set_decl_namespace (tree decl, tree scope, bool friendp)
3045 /* Get rid of namespace aliases. */
3046 scope = ORIGINAL_NAMESPACE (scope);
3048 /* It is ok for friends to be qualified in parallel space. */
3049 if (!friendp && !is_ancestor (current_namespace, scope))
3050 error ("declaration of %qD not in a namespace surrounding %qD",
3052 DECL_CONTEXT (decl) = FROB_CONTEXT (scope);
3054 /* Writing "int N::i" to declare a variable within "N" is invalid. */
3055 if (scope == current_namespace)
3057 if (at_namespace_scope_p ())
3058 error ("explicit qualification in declaration of %qD",
3063 /* See whether this has been declared in the namespace. */
3064 old = lookup_qualified_name (scope, DECL_NAME (decl), false, true);
3065 if (old == error_mark_node)
3066 /* No old declaration at all. */
3068 if (!is_overloaded_fn (decl))
3069 /* Don't compare non-function decls with decls_match here, since
3070 it can't check for the correct constness at this
3071 point. pushdecl will find those errors later. */
3073 /* Since decl is a function, old should contain a function decl. */
3074 if (!is_overloaded_fn (old))
3076 fn = OVL_CURRENT (old);
3077 if (!is_associated_namespace (scope, CP_DECL_CONTEXT (fn)))
3079 /* A template can be explicitly specialized in any namespace. */
3080 if (processing_explicit_instantiation)
3082 if (processing_template_decl || processing_specialization)
3083 /* We have not yet called push_template_decl to turn a
3084 FUNCTION_DECL into a TEMPLATE_DECL, so the declarations won't
3085 match. But, we'll check later, when we construct the
3088 /* Instantiations or specializations of templates may be declared as
3089 friends in any namespace. */
3090 if (friendp && DECL_USE_TEMPLATE (decl))
3092 if (is_overloaded_fn (old))
3094 for (; old; old = OVL_NEXT (old))
3095 if (decls_match (decl, OVL_CURRENT (old)))
3098 else if (decls_match (decl, old))
3101 error ("%qD should have been declared inside %qD", decl, scope);
3104 /* Return the namespace where the current declaration is declared. */
3107 current_decl_namespace (void)
3110 /* If we have been pushed into a different namespace, use it. */
3111 if (decl_namespace_list)
3112 return TREE_PURPOSE (decl_namespace_list);
3114 if (current_class_type)
3115 result = decl_namespace_context (current_class_type);
3116 else if (current_function_decl)
3117 result = decl_namespace_context (current_function_decl);
3119 result = current_namespace;
3123 /* Process any ATTRIBUTES on a namespace definition. Currently only
3124 attribute visibility is meaningful, which is a property of the syntactic
3125 block rather than the namespace as a whole, so we don't touch the
3126 NAMESPACE_DECL at all. Returns true if attribute visibility is seen. */
3129 handle_namespace_attrs (tree ns, tree attributes)
3132 bool saw_vis = false;
3134 for (d = attributes; d; d = TREE_CHAIN (d))
3136 tree name = TREE_PURPOSE (d);
3137 tree args = TREE_VALUE (d);
3139 #ifdef HANDLE_PRAGMA_VISIBILITY
3140 if (is_attribute_p ("visibility", name))
3142 tree x = args ? TREE_VALUE (args) : NULL_TREE;
3143 if (x == NULL_TREE || TREE_CODE (x) != STRING_CST || TREE_CHAIN (args))
3145 warning (OPT_Wattributes,
3146 "%qD attribute requires a single NTBS argument",
3151 if (!TREE_PUBLIC (ns))
3152 warning (OPT_Wattributes,
3153 "%qD attribute is meaningless since members of the "
3154 "anonymous namespace get local symbols", name);
3156 push_visibility (TREE_STRING_POINTER (x));
3162 warning (OPT_Wattributes, "%qD attribute directive ignored",
3171 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
3172 select a name that is unique to this compilation unit. */
3175 push_namespace (tree name)
3179 int implicit_use = 0;
3182 timevar_push (TV_NAME_LOOKUP);
3184 /* We should not get here if the global_namespace is not yet constructed
3185 nor if NAME designates the global namespace: The global scope is
3186 constructed elsewhere. */
3187 gcc_assert (global_namespace != NULL && name != global_scope_name);
3191 name = get_anonymous_namespace_name();
3192 d = IDENTIFIER_NAMESPACE_VALUE (name);
3194 /* Reopening anonymous namespace. */
3200 /* Check whether this is an extended namespace definition. */
3201 d = IDENTIFIER_NAMESPACE_VALUE (name);
3202 if (d != NULL_TREE && TREE_CODE (d) == NAMESPACE_DECL)
3205 if (DECL_NAMESPACE_ALIAS (d))
3207 error ("namespace alias %qD not allowed here, assuming %qD",
3208 d, DECL_NAMESPACE_ALIAS (d));
3209 d = DECL_NAMESPACE_ALIAS (d);
3216 /* Make a new namespace, binding the name to it. */
3217 d = build_lang_decl (NAMESPACE_DECL, name, void_type_node);
3218 DECL_CONTEXT (d) = FROB_CONTEXT (current_namespace);
3219 /* The name of this namespace is not visible to other translation
3220 units if it is an anonymous namespace or member thereof. */
3221 if (anon || decl_anon_ns_mem_p (current_namespace))
3222 TREE_PUBLIC (d) = 0;
3224 TREE_PUBLIC (d) = 1;
3228 /* Clear DECL_NAME for the benefit of debugging back ends. */
3229 SET_DECL_ASSEMBLER_NAME (d, name);
3230 DECL_NAME (d) = NULL_TREE;
3232 begin_scope (sk_namespace, d);
3235 resume_scope (NAMESPACE_LEVEL (d));
3238 do_using_directive (d);
3239 /* Enter the name space. */
3240 current_namespace = d;
3242 timevar_pop (TV_NAME_LOOKUP);
3245 /* Pop from the scope of the current namespace. */
3248 pop_namespace (void)
3250 gcc_assert (current_namespace != global_namespace);
3251 current_namespace = CP_DECL_CONTEXT (current_namespace);
3252 /* The binding level is not popped, as it might be re-opened later. */
3256 /* Push into the scope of the namespace NS, even if it is deeply
3257 nested within another namespace. */
3260 push_nested_namespace (tree ns)
3262 if (ns == global_namespace)
3263 push_to_top_level ();
3266 push_nested_namespace (CP_DECL_CONTEXT (ns));
3267 push_namespace (DECL_NAME (ns));
3271 /* Pop back from the scope of the namespace NS, which was previously
3272 entered with push_nested_namespace. */
3275 pop_nested_namespace (tree ns)
3277 timevar_push (TV_NAME_LOOKUP);
3278 while (ns != global_namespace)
3281 ns = CP_DECL_CONTEXT (ns);
3284 pop_from_top_level ();
3285 timevar_pop (TV_NAME_LOOKUP);
3288 /* Temporarily set the namespace for the current declaration. */
3291 push_decl_namespace (tree decl)
3293 if (TREE_CODE (decl) != NAMESPACE_DECL)
3294 decl = decl_namespace_context (decl);
3295 decl_namespace_list = tree_cons (ORIGINAL_NAMESPACE (decl),
3296 NULL_TREE, decl_namespace_list);
3299 /* [namespace.memdef]/2 */
3302 pop_decl_namespace (void)
3304 decl_namespace_list = TREE_CHAIN (decl_namespace_list);
3307 /* Return the namespace that is the common ancestor
3308 of two given namespaces. */
3311 namespace_ancestor (tree ns1, tree ns2)
3313 timevar_push (TV_NAME_LOOKUP);
3314 if (is_ancestor (ns1, ns2))
3315 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, ns1);
3316 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP,
3317 namespace_ancestor (CP_DECL_CONTEXT (ns1), ns2));
3320 /* Process a namespace-alias declaration. */
3323 do_namespace_alias (tree alias, tree name_space)
3325 if (name_space == error_mark_node)
3328 gcc_assert (TREE_CODE (name_space) == NAMESPACE_DECL);
3330 name_space = ORIGINAL_NAMESPACE (name_space);
3332 /* Build the alias. */
3333 alias = build_lang_decl (NAMESPACE_DECL, alias, void_type_node);
3334 DECL_NAMESPACE_ALIAS (alias) = name_space;
3335 DECL_EXTERNAL (alias) = 1;
3336 DECL_CONTEXT (alias) = FROB_CONTEXT (current_scope ());
3339 /* Emit debug info for namespace alias. */
3340 if (!building_stmt_tree ())
3341 (*debug_hooks->global_decl) (alias);
3344 /* Like pushdecl, only it places X in the current namespace,
3348 pushdecl_namespace_level (tree x, bool is_friend)
3350 struct cp_binding_level *b = current_binding_level;
3353 timevar_push (TV_NAME_LOOKUP);
3354 t = pushdecl_with_scope (x, NAMESPACE_LEVEL (current_namespace), is_friend);
3356 /* Now, the type_shadowed stack may screw us. Munge it so it does
3358 if (TREE_CODE (t) == TYPE_DECL)
3360 tree name = DECL_NAME (t);
3362 tree *ptr = (tree *)0;
3363 for (; !global_scope_p (b); b = b->level_chain)
3365 tree shadowed = b->type_shadowed;
3366 for (; shadowed; shadowed = TREE_CHAIN (shadowed))
3367 if (TREE_PURPOSE (shadowed) == name)
3369 ptr = &TREE_VALUE (shadowed);
3370 /* Can't break out of the loop here because sometimes
3371 a binding level will have duplicate bindings for
3372 PT names. It's gross, but I haven't time to fix it. */
3375 newval = TREE_TYPE (t);
3376 if (ptr == (tree *)0)
3378 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
3379 up here if this is changed to an assertion. --KR */
3380 SET_IDENTIFIER_TYPE_VALUE (name, t);
3387 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
3390 /* Insert USED into the using list of USER. Set INDIRECT_flag if this
3391 directive is not directly from the source. Also find the common
3392 ancestor and let our users know about the new namespace */
3394 add_using_namespace (tree user, tree used, bool indirect)
3397 timevar_push (TV_NAME_LOOKUP);
3398 /* Using oneself is a no-op. */
3401 timevar_pop (TV_NAME_LOOKUP);
3404 gcc_assert (TREE_CODE (user) == NAMESPACE_DECL);
3405 gcc_assert (TREE_CODE (used) == NAMESPACE_DECL);
3406 /* Check if we already have this. */
3407 t = purpose_member (used, DECL_NAMESPACE_USING (user));
3411 /* Promote to direct usage. */
3412 TREE_INDIRECT_USING (t) = 0;
3413 timevar_pop (TV_NAME_LOOKUP);
3417 /* Add used to the user's using list. */
3418 DECL_NAMESPACE_USING (user)
3419 = tree_cons (used, namespace_ancestor (user, used),
3420 DECL_NAMESPACE_USING (user));
3422 TREE_INDIRECT_USING (DECL_NAMESPACE_USING (user)) = indirect;
3424 /* Add user to the used's users list. */
3425 DECL_NAMESPACE_USERS (used)
3426 = tree_cons (user, 0, DECL_NAMESPACE_USERS (used));
3428 /* Recursively add all namespaces used. */
3429 for (t = DECL_NAMESPACE_USING (used); t; t = TREE_CHAIN (t))
3430 /* indirect usage */
3431 add_using_namespace (user, TREE_PURPOSE (t), 1);
3433 /* Tell everyone using us about the new used namespaces. */
3434 for (t = DECL_NAMESPACE_USERS (user); t; t = TREE_CHAIN (t))
3435 add_using_namespace (TREE_PURPOSE (t), used, 1);
3436 timevar_pop (TV_NAME_LOOKUP);
3439 /* Process a using-declaration not appearing in class or local scope. */
3442 do_toplevel_using_decl (tree decl, tree scope, tree name)
3444 tree oldval, oldtype, newval, newtype;
3445 tree orig_decl = decl;
3446 cxx_binding *binding;
3448 decl = validate_nonmember_using_decl (decl, scope, name);
3449 if (decl == NULL_TREE)
3452 binding = binding_for_name (NAMESPACE_LEVEL (current_namespace), name);
3454 oldval = binding->value;
3455 oldtype = binding->type;
3457 do_nonmember_using_decl (scope, name, oldval, oldtype, &newval, &newtype);
3459 /* Emit debug info. */
3460 if (!processing_template_decl)
3461 cp_emit_debug_info_for_using (orig_decl, current_namespace);
3463 /* Copy declarations found. */
3465 binding->value = newval;
3467 binding->type = newtype;
3470 /* Process a using-directive. */
3473 do_using_directive (tree name_space)
3475 tree context = NULL_TREE;
3477 if (name_space == error_mark_node)
3480 gcc_assert (TREE_CODE (name_space) == NAMESPACE_DECL);
3482 if (building_stmt_tree ())
3483 add_stmt (build_stmt (input_location, USING_STMT, name_space));
3484 name_space = ORIGINAL_NAMESPACE (name_space);
3486 if (!toplevel_bindings_p ())
3488 push_using_directive (name_space);
3493 add_using_namespace (current_namespace, name_space, 0);
3494 if (current_namespace != global_namespace)
3495 context = current_namespace;
3497 /* Emit debugging info. */
3498 if (!processing_template_decl)
3499 (*debug_hooks->imported_module_or_decl) (name_space, NULL_TREE,
3504 /* Deal with a using-directive seen by the parser. Currently we only
3505 handle attributes here, since they cannot appear inside a template. */
3508 parse_using_directive (tree name_space, tree attribs)
3512 do_using_directive (name_space);
3514 for (a = attribs; a; a = TREE_CHAIN (a))
3516 tree name = TREE_PURPOSE (a);
3517 if (is_attribute_p ("strong", name))
3519 if (!toplevel_bindings_p ())
3520 error ("strong using only meaningful at namespace scope");
3521 else if (name_space != error_mark_node)
3523 if (!is_ancestor (current_namespace, name_space))
3524 error ("current namespace %qD does not enclose strongly used namespace %qD",
3525 current_namespace, name_space);
3526 DECL_NAMESPACE_ASSOCIATIONS (name_space)
3527 = tree_cons (current_namespace, 0,
3528 DECL_NAMESPACE_ASSOCIATIONS (name_space));
3532 warning (OPT_Wattributes, "%qD attribute directive ignored", name);
3536 /* Like pushdecl, only it places X in the global scope if appropriate.
3537 Calls cp_finish_decl to register the variable, initializing it with
3538 *INIT, if INIT is non-NULL. */
3541 pushdecl_top_level_1 (tree x, tree *init, bool is_friend)
3543 timevar_push (TV_NAME_LOOKUP);
3544 push_to_top_level ();
3545 x = pushdecl_namespace_level (x, is_friend);
3547 cp_finish_decl (x, *init, false, NULL_TREE, 0);
3548 pop_from_top_level ();
3549 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, x);
3552 /* Like pushdecl, only it places X in the global scope if appropriate. */
3555 pushdecl_top_level (tree x)
3557 return pushdecl_top_level_1 (x, NULL, false);
3560 /* Like pushdecl_top_level, but adding the IS_FRIEND parameter. */
3563 pushdecl_top_level_maybe_friend (tree x, bool is_friend)
3565 return pushdecl_top_level_1 (x, NULL, is_friend);
3568 /* Like pushdecl, only it places X in the global scope if
3569 appropriate. Calls cp_finish_decl to register the variable,
3570 initializing it with INIT. */
3573 pushdecl_top_level_and_finish (tree x, tree init)
3575 return pushdecl_top_level_1 (x, &init, false);
3578 /* Combines two sets of overloaded functions into an OVERLOAD chain, removing
3579 duplicates. The first list becomes the tail of the result.
3581 The algorithm is O(n^2). We could get this down to O(n log n) by
3582 doing a sort on the addresses of the functions, if that becomes
3586 merge_functions (tree s1, tree s2)
3588 for (; s2; s2 = OVL_NEXT (s2))
3590 tree fn2 = OVL_CURRENT (s2);
3593 for (fns1 = s1; fns1; fns1 = OVL_NEXT (fns1))
3595 tree fn1 = OVL_CURRENT (fns1);
3597 /* If the function from S2 is already in S1, there is no
3598 need to add it again. For `extern "C"' functions, we
3599 might have two FUNCTION_DECLs for the same function, in
3600 different namespaces, but let's leave them in in case
3601 they have different default arguments. */
3606 /* If we exhausted all of the functions in S1, FN2 is new. */
3608 s1 = build_overload (fn2, s1);
3613 /* This should return an error not all definitions define functions.
3614 It is not an error if we find two functions with exactly the
3615 same signature, only if these are selected in overload resolution.
3616 old is the current set of bindings, new_binding the freshly-found binding.
3617 XXX Do we want to give *all* candidates in case of ambiguity?
3618 XXX In what way should I treat extern declarations?
3619 XXX I don't want to repeat the entire duplicate_decls here */
3622 ambiguous_decl (struct scope_binding *old, cxx_binding *new_binding, int flags)
3625 gcc_assert (old != NULL);
3627 /* Copy the type. */
3628 type = new_binding->type;
3629 if (LOOKUP_NAMESPACES_ONLY (flags)
3630 || (type && hidden_name_p (type) && !(flags & LOOKUP_HIDDEN)))
3633 /* Copy the value. */
3634 val = new_binding->value;
3637 if (hidden_name_p (val) && !(flags & LOOKUP_HIDDEN))
3640 switch (TREE_CODE (val))
3643 /* If we expect types or namespaces, and not templates,
3644 or this is not a template class. */
3645 if ((LOOKUP_QUALIFIERS_ONLY (flags)
3646 && !DECL_CLASS_TEMPLATE_P (val)))
3650 if (LOOKUP_NAMESPACES_ONLY (flags)
3651 || (type && (flags & LOOKUP_PREFER_TYPES)))
3654 case NAMESPACE_DECL:
3655 if (LOOKUP_TYPES_ONLY (flags))
3659 /* Ignore built-in functions that are still anticipated. */
3660 if (LOOKUP_QUALIFIERS_ONLY (flags))
3664 if (LOOKUP_QUALIFIERS_ONLY (flags))
3669 /* If val is hidden, shift down any class or enumeration name. */
3678 else if (val && val != old->value)
3680 if (is_overloaded_fn (old->value) && is_overloaded_fn (val))
3681 old->value = merge_functions (old->value, val);
3684 old->value = tree_cons (NULL_TREE, old->value,
3685 build_tree_list (NULL_TREE, val));
3686 TREE_TYPE (old->value) = error_mark_node;
3692 else if (type && old->type != type)
3694 old->type = tree_cons (NULL_TREE, old->type,
3695 build_tree_list (NULL_TREE, type));
3696 TREE_TYPE (old->type) = error_mark_node;
3700 /* Return the declarations that are members of the namespace NS. */
3703 cp_namespace_decls (tree ns)
3705 return NAMESPACE_LEVEL (ns)->names;
3708 /* Combine prefer_type and namespaces_only into flags. */
3711 lookup_flags (int prefer_type, int namespaces_only)
3713 if (namespaces_only)
3714 return LOOKUP_PREFER_NAMESPACES;
3715 if (prefer_type > 1)
3716 return LOOKUP_PREFER_TYPES;
3717 if (prefer_type > 0)
3718 return LOOKUP_PREFER_BOTH;
3722 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
3723 ignore it or not. Subroutine of lookup_name_real and
3724 lookup_type_scope. */
3727 qualify_lookup (tree val, int flags)
3729 if (val == NULL_TREE)
3731 if ((flags & LOOKUP_PREFER_NAMESPACES) && TREE_CODE (val) == NAMESPACE_DECL)
3733 if ((flags & LOOKUP_PREFER_TYPES)
3734 && (TREE_CODE (val) == TYPE_DECL || TREE_CODE (val) == TEMPLATE_DECL))
3736 if (flags & (LOOKUP_PREFER_NAMESPACES | LOOKUP_PREFER_TYPES))
3741 /* Given a lookup that returned VAL, decide if we want to ignore it or
3742 not based on DECL_ANTICIPATED. */
3745 hidden_name_p (tree val)
3748 && DECL_LANG_SPECIFIC (val)
3749 && DECL_ANTICIPATED (val))
3754 /* Remove any hidden friend functions from a possibly overloaded set
3758 remove_hidden_names (tree fns)
3763 if (TREE_CODE (fns) == FUNCTION_DECL && hidden_name_p (fns))
3765 else if (TREE_CODE (fns) == OVERLOAD)
3769 for (o = fns; o; o = OVL_NEXT (o))
3770 if (hidden_name_p (OVL_CURRENT (o)))
3776 for (o = fns; o; o = OVL_NEXT (o))
3777 if (!hidden_name_p (OVL_CURRENT (o)))
3778 n = build_overload (OVL_CURRENT (o), n);
3786 /* Unscoped lookup of a global: iterate over current namespaces,
3787 considering using-directives. */
3790 unqualified_namespace_lookup (tree name, int flags)
3792 tree initial = current_decl_namespace ();
3793 tree scope = initial;
3795 struct cp_binding_level *level;
3796 tree val = NULL_TREE;
3798 timevar_push (TV_NAME_LOOKUP);
3800 for (; !val; scope = CP_DECL_CONTEXT (scope))
3802 struct scope_binding binding = EMPTY_SCOPE_BINDING;
3804 cxx_scope_find_binding_for_name (NAMESPACE_LEVEL (scope), name);
3807 ambiguous_decl (&binding, b, flags);
3809 /* Add all _DECLs seen through local using-directives. */
3810 for (level = current_binding_level;
3811 level->kind != sk_namespace;
3812 level = level->level_chain)
3813 if (!lookup_using_namespace (name, &binding, level->using_directives,
3815 /* Give up because of error. */
3816 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
3818 /* Add all _DECLs seen through global using-directives. */
3819 /* XXX local and global using lists should work equally. */
3823 if (!lookup_using_namespace (name, &binding,
3824 DECL_NAMESPACE_USING (siter),
3826 /* Give up because of error. */
3827 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
3828 if (siter == scope) break;
3829 siter = CP_DECL_CONTEXT (siter);
3832 val = binding.value;
3833 if (scope == global_namespace)
3836 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, val);
3839 /* Look up NAME (an IDENTIFIER_NODE) in SCOPE (either a NAMESPACE_DECL
3840 or a class TYPE). If IS_TYPE_P is TRUE, then ignore non-type
3843 Returns a DECL (or OVERLOAD, or BASELINK) representing the
3844 declaration found. If no suitable declaration can be found,
3845 ERROR_MARK_NODE is returned. If COMPLAIN is true and SCOPE is
3846 neither a class-type nor a namespace a diagnostic is issued. */
3849 lookup_qualified_name (tree scope, tree name, bool is_type_p, bool complain)
3854 if (TREE_CODE (scope) == NAMESPACE_DECL)
3856 struct scope_binding binding = EMPTY_SCOPE_BINDING;
3858 flags |= LOOKUP_COMPLAIN;
3860 flags |= LOOKUP_PREFER_TYPES;
3861 if (qualified_lookup_using_namespace (name, scope, &binding, flags))
3864 else if (cxx_dialect != cxx98 && TREE_CODE (scope) == ENUMERAL_TYPE)
3865 t = lookup_enumerator (scope, name);
3866 else if (is_class_type (scope, complain))
3867 t = lookup_member (scope, name, 2, is_type_p);
3870 return error_mark_node;
3874 /* Subroutine of unqualified_namespace_lookup:
3875 Add the bindings of NAME in used namespaces to VAL.
3876 We are currently looking for names in namespace SCOPE, so we
3877 look through USINGS for using-directives of namespaces
3878 which have SCOPE as a common ancestor with the current scope.
3879 Returns false on errors. */
3882 lookup_using_namespace (tree name, struct scope_binding *val,
3883 tree usings, tree scope, int flags)
3886 timevar_push (TV_NAME_LOOKUP);
3887 /* Iterate over all used namespaces in current, searching for using
3888 directives of scope. */
3889 for (iter = usings; iter; iter = TREE_CHAIN (iter))
3890 if (TREE_VALUE (iter) == scope)
3892 tree used = ORIGINAL_NAMESPACE (TREE_PURPOSE (iter));
3894 cxx_scope_find_binding_for_name (NAMESPACE_LEVEL (used), name);
3895 /* Resolve ambiguities. */
3897 ambiguous_decl (val, val1, flags);
3899 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, val->value != error_mark_node);
3903 Accepts the NAME to lookup and its qualifying SCOPE.
3904 Returns the name/type pair found into the cxx_binding *RESULT,
3905 or false on error. */
3908 qualified_lookup_using_namespace (tree name, tree scope,
3909 struct scope_binding *result, int flags)
3911 /* Maintain a list of namespaces visited... */
3912 tree seen = NULL_TREE;
3913 /* ... and a list of namespace yet to see. */
3914 tree todo = NULL_TREE;
3915 tree todo_maybe = NULL_TREE;
3916 tree *todo_weak = &todo_maybe;
3918 timevar_push (TV_NAME_LOOKUP);
3919 /* Look through namespace aliases. */
3920 scope = ORIGINAL_NAMESPACE (scope);
3921 while (scope && result->value != error_mark_node)
3923 cxx_binding *binding =
3924 cxx_scope_find_binding_for_name (NAMESPACE_LEVEL (scope), name);
3925 seen = tree_cons (scope, NULL_TREE, seen);
3927 ambiguous_decl (result, binding, flags);
3929 /* Consider strong using directives always, and non-strong ones
3930 if we haven't found a binding yet. */
3931 for (usings = DECL_NAMESPACE_USING (scope); usings;
3932 usings = TREE_CHAIN (usings))
3933 /* If this was a real directive, and we have not seen it. */
3934 if (!TREE_INDIRECT_USING (usings))
3936 /* Try to avoid queuing the same namespace more than once,
3937 the exception being when a namespace was already
3938 enqueued for todo_maybe and then a strong using is
3939 found for it. We could try to remove it from
3940 todo_maybe, but it's probably not worth the effort. */
3941 if (is_associated_namespace (scope, TREE_PURPOSE (usings))
3942 && !purpose_member (TREE_PURPOSE (usings), seen)
3943 && !purpose_member (TREE_PURPOSE (usings), todo))
3944 todo = tree_cons (TREE_PURPOSE (usings), NULL_TREE, todo);
3946 && !purpose_member (TREE_PURPOSE (usings), seen)
3947 && !purpose_member (TREE_PURPOSE (usings), todo)
3948 && !purpose_member (TREE_PURPOSE (usings), todo_maybe))
3949 *todo_weak = tree_cons (TREE_PURPOSE (usings), NULL_TREE,
3954 scope = TREE_PURPOSE (todo);
3955 todo = TREE_CHAIN (todo);
3958 && (!result->value && !result->type))
3960 scope = TREE_PURPOSE (todo_maybe);
3961 todo = TREE_CHAIN (todo_maybe);
3962 todo_maybe = NULL_TREE;
3966 scope = NULL_TREE; /* If there never was a todo list. */
3968 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, result->value != error_mark_node);
3971 /* Subroutine of outer_binding.
3972 Returns TRUE if BINDING is a binding to a template parameter of SCOPE,
3976 binding_to_template_parms_of_scope_p (cxx_binding *binding,
3981 if (!binding || !scope)
3984 binding_value = binding->value ? binding->value : binding->type;
3987 && scope->this_entity
3988 && get_template_info (scope->this_entity)
3989 && parameter_of_template_p (binding_value,
3990 TI_TEMPLATE (get_template_info \
3991 (scope->this_entity))));
3994 /* Return the innermost non-namespace binding for NAME from a scope
3995 containing BINDING, or, if BINDING is NULL, the current scope.
3996 Please note that for a given template, the template parameters are
3997 considered to be in the scope containing the current scope.
3998 If CLASS_P is false, then class bindings are ignored. */
4001 outer_binding (tree name,
4002 cxx_binding *binding,
4007 cxx_scope *outer_scope;
4011 scope = binding->scope->level_chain;
4012 outer = binding->previous;
4016 scope = current_binding_level;
4017 outer = IDENTIFIER_BINDING (name);
4019 outer_scope = outer ? outer->scope : NULL;
4021 /* Because we create class bindings lazily, we might be missing a
4022 class binding for NAME. If there are any class binding levels
4023 between the LAST_BINDING_LEVEL and the scope in which OUTER was
4024 declared, we must lookup NAME in those class scopes. */
4026 while (scope && scope != outer_scope && scope->kind != sk_namespace)
4028 if (scope->kind == sk_class)
4030 cxx_binding *class_binding;
4032 class_binding = get_class_binding (name, scope);
4035 /* Thread this new class-scope binding onto the
4036 IDENTIFIER_BINDING list so that future lookups
4038 class_binding->previous = outer;
4040 binding->previous = class_binding;
4042 IDENTIFIER_BINDING (name) = class_binding;
4043 return class_binding;
4046 /* If we are in a member template, the template parms of the member
4047 template are considered to be inside the scope of the containing
4048 class, but within G++ the class bindings are all pushed between the
4049 template parms and the function body. So if the outer binding is
4050 a template parm for the current scope, return it now rather than
4051 look for a class binding. */
4052 if (outer_scope && outer_scope->kind == sk_template_parms
4053 && binding_to_template_parms_of_scope_p (outer, scope))
4056 scope = scope->level_chain;
4062 /* Return the innermost block-scope or class-scope value binding for
4063 NAME, or NULL_TREE if there is no such binding. */
4066 innermost_non_namespace_value (tree name)
4068 cxx_binding *binding;
4069 binding = outer_binding (name, /*binding=*/NULL, /*class_p=*/true);
4070 return binding ? binding->value : NULL_TREE;
4073 /* Look up NAME in the current binding level and its superiors in the
4074 namespace of variables, functions and typedefs. Return a ..._DECL
4075 node of some kind representing its definition if there is only one
4076 such declaration, or return a TREE_LIST with all the overloaded
4077 definitions if there are many, or return 0 if it is undefined.
4078 Hidden name, either friend declaration or built-in function, are
4081 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
4082 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
4083 Otherwise we prefer non-TYPE_DECLs.
4085 If NONCLASS is nonzero, bindings in class scopes are ignored. If
4086 BLOCK_P is false, bindings in block scopes are ignored. */
4089 lookup_name_real (tree name, int prefer_type, int nonclass, bool block_p,
4090 int namespaces_only, int flags)
4093 tree val = NULL_TREE;
4095 timevar_push (TV_NAME_LOOKUP);
4096 /* Conversion operators are handled specially because ordinary
4097 unqualified name lookup will not find template conversion
4099 if (IDENTIFIER_TYPENAME_P (name))
4101 struct cp_binding_level *level;
4103 for (level = current_binding_level;
4104 level && level->kind != sk_namespace;
4105 level = level->level_chain)
4110 /* A conversion operator can only be declared in a class
4112 if (level->kind != sk_class)
4115 /* Lookup the conversion operator in the class. */
4116 class_type = level->this_entity;
4117 operators = lookup_fnfields (class_type, name, /*protect=*/0);
4119 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, operators);
4122 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
4125 flags |= lookup_flags (prefer_type, namespaces_only);
4127 /* First, look in non-namespace scopes. */
4129 if (current_class_type == NULL_TREE)
4132 if (block_p || !nonclass)
4133 for (iter = outer_binding (name, NULL, !nonclass);
4135 iter = outer_binding (name, iter, !nonclass))
4139 /* Skip entities we don't want. */
4140 if (LOCAL_BINDING_P (iter) ? !block_p : nonclass)
4143 /* If this is the kind of thing we're looking for, we're done. */
4144 if (qualify_lookup (iter->value, flags))
4145 binding = iter->value;
4146 else if ((flags & LOOKUP_PREFER_TYPES)
4147 && qualify_lookup (iter->type, flags))
4148 binding = iter->type;
4150 binding = NULL_TREE;
4154 if (hidden_name_p (binding))
4156 /* A non namespace-scope binding can only be hidden in the
4157 presence of a local class, due to friend declarations.
4159 In particular, consider:
4167 B* b; // error: B is hidden
4168 C* c; // OK, finds ::C
4171 B *b; // error: B is hidden
4172 C *c; // OK, finds ::C
4177 The standard says that "B" is a local class in "f"
4178 (but not nested within "A") -- but that name lookup
4179 for "B" does not find this declaration until it is
4180 declared directly with "f".
4186 If a friend declaration appears in a local class and
4187 the name specified is an unqualified name, a prior
4188 declaration is looked up without considering scopes
4189 that are outside the innermost enclosing non-class
4190 scope. For a friend function declaration, if there is
4191 no prior declaration, the program is ill-formed. For a
4192 friend class declaration, if there is no prior
4193 declaration, the class that is specified belongs to the
4194 innermost enclosing non-class scope, but if it is
4195 subsequently referenced, its name is not found by name
4196 lookup until a matching declaration is provided in the
4197 innermost enclosing nonclass scope.
4199 So just keep looking for a non-hidden binding.
4201 gcc_assert (TREE_CODE (binding) == TYPE_DECL);
4209 /* Now lookup in namespace scopes. */
4211 val = unqualified_namespace_lookup (name, flags);
4213 /* If we have a single function from a using decl, pull it out. */
4214 if (val && TREE_CODE (val) == OVERLOAD && !really_overloaded_fn (val))
4215 val = OVL_FUNCTION (val);
4217 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, val);
4221 lookup_name_nonclass (tree name)
4223 return lookup_name_real (name, 0, 1, /*block_p=*/true, 0, LOOKUP_COMPLAIN);
4227 lookup_function_nonclass (tree name, VEC(tree,gc) *args, bool block_p)
4230 lookup_arg_dependent (name,
4231 lookup_name_real (name, 0, 1, block_p, 0,
4237 lookup_name (tree name)
4239 return lookup_name_real (name, 0, 0, /*block_p=*/true, 0, LOOKUP_COMPLAIN);
4243 lookup_name_prefer_type (tree name, int prefer_type)
4245 return lookup_name_real (name, prefer_type, 0, /*block_p=*/true,
4246 0, LOOKUP_COMPLAIN);
4249 /* Look up NAME for type used in elaborated name specifier in
4250 the scopes given by SCOPE. SCOPE can be either TS_CURRENT or
4251 TS_WITHIN_ENCLOSING_NON_CLASS. Although not implied by the
4252 name, more scopes are checked if cleanup or template parameter
4253 scope is encountered.
4255 Unlike lookup_name_real, we make sure that NAME is actually
4256 declared in the desired scope, not from inheritance, nor using
4257 directive. For using declaration, there is DR138 still waiting
4258 to be resolved. Hidden name coming from an earlier friend
4259 declaration is also returned.
4261 A TYPE_DECL best matching the NAME is returned. Catching error
4262 and issuing diagnostics are caller's responsibility. */
4265 lookup_type_scope (tree name, tag_scope scope)
4267 cxx_binding *iter = NULL;
4268 tree val = NULL_TREE;
4270 timevar_push (TV_NAME_LOOKUP);
4272 /* Look in non-namespace scope first. */
4273 if (current_binding_level->kind != sk_namespace)
4274 iter = outer_binding (name, NULL, /*class_p=*/ true);
4275 for (; iter; iter = outer_binding (name, iter, /*class_p=*/ true))
4277 /* Check if this is the kind of thing we're looking for.
4278 If SCOPE is TS_CURRENT, also make sure it doesn't come from
4279 base class. For ITER->VALUE, we can simply use
4280 INHERITED_VALUE_BINDING_P. For ITER->TYPE, we have to use
4283 We check ITER->TYPE before ITER->VALUE in order to handle
4284 typedef struct C {} C;
4287 if (qualify_lookup (iter->type, LOOKUP_PREFER_TYPES)
4288 && (scope != ts_current
4289 || LOCAL_BINDING_P (iter)
4290 || DECL_CONTEXT (iter->type) == iter->scope->this_entity))
4292 else if ((scope != ts_current
4293 || !INHERITED_VALUE_BINDING_P (iter))
4294 && qualify_lookup (iter->value, LOOKUP_PREFER_TYPES))
4301 /* Look in namespace scope. */
4304 iter = cxx_scope_find_binding_for_name
4305 (NAMESPACE_LEVEL (current_decl_namespace ()), name);
4309 /* If this is the kind of thing we're looking for, we're done. */
4310 if (qualify_lookup (iter->type, LOOKUP_PREFER_TYPES))
4312 else if (qualify_lookup (iter->value, LOOKUP_PREFER_TYPES))
4318 /* Type found, check if it is in the allowed scopes, ignoring cleanup
4319 and template parameter scopes. */
4322 struct cp_binding_level *b = current_binding_level;
4325 if (iter->scope == b)
4326 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, val);
4328 if (b->kind == sk_cleanup || b->kind == sk_template_parms
4329 || b->kind == sk_function_parms)
4331 else if (b->kind == sk_class
4332 && scope == ts_within_enclosing_non_class)
4339 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
4342 /* Similar to `lookup_name' but look only in the innermost non-class
4346 lookup_name_innermost_nonclass_level (tree name)
4348 struct cp_binding_level *b;
4351 timevar_push (TV_NAME_LOOKUP);
4352 b = innermost_nonclass_level ();
4354 if (b->kind == sk_namespace)
4356 t = IDENTIFIER_NAMESPACE_VALUE (name);
4358 /* extern "C" function() */
4359 if (t != NULL_TREE && TREE_CODE (t) == TREE_LIST)
4362 else if (IDENTIFIER_BINDING (name)
4363 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name)))
4365 cxx_binding *binding;
4366 binding = IDENTIFIER_BINDING (name);
4369 if (binding->scope == b
4370 && !(TREE_CODE (binding->value) == VAR_DECL
4371 && DECL_DEAD_FOR_LOCAL (binding->value)))
4372 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, binding->value);
4374 if (b->kind == sk_cleanup)
4381 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
4384 /* Returns true iff DECL is a block-scope extern declaration of a function
4388 is_local_extern (tree decl)
4390 cxx_binding *binding;
4392 /* For functions, this is easy. */
4393 if (TREE_CODE (decl) == FUNCTION_DECL)
4394 return DECL_LOCAL_FUNCTION_P (decl);
4396 if (TREE_CODE (decl) != VAR_DECL)
4398 if (!current_function_decl)
4401 /* For variables, this is not easy. We need to look at the binding stack
4402 for the identifier to see whether the decl we have is a local. */
4403 for (binding = IDENTIFIER_BINDING (DECL_NAME (decl));
4404 binding && binding->scope->kind != sk_namespace;
4405 binding = binding->previous)
4406 if (binding->value == decl)
4407 return LOCAL_BINDING_P (binding);
4412 /* Like lookup_name_innermost_nonclass_level, but for types. */
4415 lookup_type_current_level (tree name)
4419 timevar_push (TV_NAME_LOOKUP);
4420 gcc_assert (current_binding_level->kind != sk_namespace);
4422 if (REAL_IDENTIFIER_TYPE_VALUE (name) != NULL_TREE
4423 && REAL_IDENTIFIER_TYPE_VALUE (name) != global_type_node)
4425 struct cp_binding_level *b = current_binding_level;
4428 if (purpose_member (name, b->type_shadowed))
4429 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP,
4430 REAL_IDENTIFIER_TYPE_VALUE (name));
4431 if (b->kind == sk_cleanup)
4438 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
4441 /* [basic.lookup.koenig] */
4442 /* A nonzero return value in the functions below indicates an error. */
4453 static bool arg_assoc (struct arg_lookup*, tree);
4454 static bool arg_assoc_args (struct arg_lookup*, tree);
4455 static bool arg_assoc_args_vec (struct arg_lookup*, VEC(tree,gc) *);
4456 static bool arg_assoc_type (struct arg_lookup*, tree);
4457 static bool add_function (struct arg_lookup *, tree);
4458 static bool arg_assoc_namespace (struct arg_lookup *, tree);
4459 static bool arg_assoc_class (struct arg_lookup *, tree);
4460 static bool arg_assoc_template_arg (struct arg_lookup*, tree);
4462 /* Add a function to the lookup structure.
4463 Returns true on error. */
4466 add_function (struct arg_lookup *k, tree fn)
4468 /* We used to check here to see if the function was already in the list,
4469 but that's O(n^2), which is just too expensive for function lookup.
4470 Now we deal with the occasional duplicate in joust. In doing this, we
4471 assume that the number of duplicates will be small compared to the
4472 total number of functions being compared, which should usually be the
4475 /* We must find only functions, or exactly one non-function. */
4478 else if (fn == k->functions)
4480 else if (is_overloaded_fn (k->functions) && is_overloaded_fn (fn))
4481 k->functions = build_overload (fn, k->functions);
4484 tree f1 = OVL_CURRENT (k->functions);
4486 if (is_overloaded_fn (f1))
4488 fn = f1; f1 = f2; f2 = fn;
4490 error ("%q+D is not a function,", f1);
4491 error (" conflict with %q+D", f2);
4492 error (" in call to %qD", k->name);
4499 /* Returns true iff CURRENT has declared itself to be an associated
4500 namespace of SCOPE via a strong using-directive (or transitive chain
4501 thereof). Both are namespaces. */
4504 is_associated_namespace (tree current, tree scope)
4506 tree seen = NULL_TREE;
4507 tree todo = NULL_TREE;
4511 if (scope == current)
4513 seen = tree_cons (scope, NULL_TREE, seen);
4514 for (t = DECL_NAMESPACE_ASSOCIATIONS (scope); t; t = TREE_CHAIN (t))
4515 if (!purpose_member (TREE_PURPOSE (t), seen))
4516 todo = tree_cons (TREE_PURPOSE (t), NULL_TREE, todo);
4519 scope = TREE_PURPOSE (todo);
4520 todo = TREE_CHAIN (todo);
4527 /* Return whether FN is a friend of an associated class of ARG. */
4530 friend_of_associated_class_p (tree arg, tree fn)
4536 else if (type_unknown_p (arg))
4539 type = TREE_TYPE (arg);
4541 /* If TYPE is a class, the class itself and all base classes are
4542 associated classes. */
4543 if (CLASS_TYPE_P (type))
4545 if (is_friend (type, fn))
4548 if (TYPE_BINFO (type))
4550 tree binfo, base_binfo;
4553 for (binfo = TYPE_BINFO (type), i = 0;
4554 BINFO_BASE_ITERATE (binfo, i, base_binfo);
4556 if (is_friend (BINFO_TYPE (base_binfo), fn))
4561 /* If TYPE is a class member, the class of which it is a member is
4562 an associated class. */
4563 if ((CLASS_TYPE_P (type)
4564 || TREE_CODE (type) == UNION_TYPE
4565 || TREE_CODE (type) == ENUMERAL_TYPE)
4566 && TYPE_CONTEXT (type)
4567 && CLASS_TYPE_P (TYPE_CONTEXT (type))
4568 && is_friend (TYPE_CONTEXT (type), fn))
4574 /* Add functions of a namespace to the lookup structure.
4575 Returns true on error. */
4578 arg_assoc_namespace (struct arg_lookup *k, tree scope)
4582 if (purpose_member (scope, k->namespaces))
4584 k->namespaces = tree_cons (scope, NULL_TREE, k->namespaces);
4586 /* Check out our super-users. */
4587 for (value = DECL_NAMESPACE_ASSOCIATIONS (scope); value;
4588 value = TREE_CHAIN (value))
4589 if (arg_assoc_namespace (k, TREE_PURPOSE (value)))
4592 /* Also look down into inline namespaces. */
4593 for (value = DECL_NAMESPACE_USING (scope); value;
4594 value = TREE_CHAIN (value))
4595 if (is_associated_namespace (scope, TREE_PURPOSE (value)))
4596 if (arg_assoc_namespace (k, TREE_PURPOSE (value)))
4599 value = namespace_binding (k->name, scope);
4603 for (; value; value = OVL_NEXT (value))
4605 /* We don't want to find arbitrary hidden functions via argument
4606 dependent lookup. We only want to find friends of associated
4608 if (hidden_name_p (OVL_CURRENT (value)))
4613 for (ix = 0; VEC_iterate (tree, k->args, ix, arg); ++ix)
4614 if (friend_of_associated_class_p (arg, OVL_CURRENT (value)))
4616 if (ix >= VEC_length (tree, k->args))
4620 if (add_function (k, OVL_CURRENT (value)))
4627 /* Adds everything associated with a template argument to the lookup
4628 structure. Returns true on error. */
4631 arg_assoc_template_arg (struct arg_lookup *k, tree arg)
4633 /* [basic.lookup.koenig]
4635 If T is a template-id, its associated namespaces and classes are
4636 ... the namespaces and classes associated with the types of the
4637 template arguments provided for template type parameters
4638 (excluding template template parameters); the namespaces in which
4639 any template template arguments are defined; and the classes in
4640 which any member templates used as template template arguments
4641 are defined. [Note: non-type template arguments do not
4642 contribute to the set of associated namespaces. ] */
4644 /* Consider first template template arguments. */
4645 if (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM
4646 || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE)
4648 else if (TREE_CODE (arg) == TEMPLATE_DECL)
4650 tree ctx = CP_DECL_CONTEXT (arg);
4652 /* It's not a member template. */
4653 if (TREE_CODE (ctx) == NAMESPACE_DECL)
4654 return arg_assoc_namespace (k, ctx);
4655 /* Otherwise, it must be member template. */
4657 return arg_assoc_class (k, ctx);
4659 /* It's an argument pack; handle it recursively. */
4660 else if (ARGUMENT_PACK_P (arg))
4662 tree args = ARGUMENT_PACK_ARGS (arg);
4663 int i, len = TREE_VEC_LENGTH (args);
4664 for (i = 0; i < len; ++i)
4665 if (arg_assoc_template_arg (k, TREE_VEC_ELT (args, i)))
4670 /* It's not a template template argument, but it is a type template
4672 else if (TYPE_P (arg))
4673 return arg_assoc_type (k, arg);
4674 /* It's a non-type template argument. */
4679 /* Adds everything associated with class to the lookup structure.
4680 Returns true on error. */
4683 arg_assoc_class (struct arg_lookup *k, tree type)
4685 tree list, friends, context;
4688 /* Backend build structures, such as __builtin_va_list, aren't
4689 affected by all this. */
4690 if (!CLASS_TYPE_P (type))
4693 if (purpose_member (type, k->classes))
4695 k->classes = tree_cons (type, NULL_TREE, k->classes);
4697 context = decl_namespace_context (type);
4698 if (arg_assoc_namespace (k, context))
4701 if (TYPE_BINFO (type))
4703 /* Process baseclasses. */
4704 tree binfo, base_binfo;
4706 for (binfo = TYPE_BINFO (type), i = 0;
4707 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
4708 if (arg_assoc_class (k, BINFO_TYPE (base_binfo)))
4712 /* Process friends. */
4713 for (list = DECL_FRIENDLIST (TYPE_MAIN_DECL (type)); list;
4714 list = TREE_CHAIN (list))
4715 if (k->name == FRIEND_NAME (list))
4716 for (friends = FRIEND_DECLS (list); friends;
4717 friends = TREE_CHAIN (friends))
4719 tree fn = TREE_VALUE (friends);
4721 /* Only interested in global functions with potentially hidden
4722 (i.e. unqualified) declarations. */
4723 if (CP_DECL_CONTEXT (fn) != context)
4725 /* Template specializations are never found by name lookup.
4726 (Templates themselves can be found, but not template
4727 specializations.) */
4728 if (TREE_CODE (fn) == FUNCTION_DECL && DECL_USE_TEMPLATE (fn))
4730 if (add_function (k, fn))
4734 /* Process template arguments. */
4735 if (CLASSTYPE_TEMPLATE_INFO (type)
4736 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type)))
4738 list = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type));
4739 for (i = 0; i < TREE_VEC_LENGTH (list); ++i)
4740 arg_assoc_template_arg (k, TREE_VEC_ELT (list, i));
4746 /* Adds everything associated with a given type.
4747 Returns 1 on error. */
4750 arg_assoc_type (struct arg_lookup *k, tree type)
4752 /* As we do not get the type of non-type dependent expressions
4753 right, we can end up with such things without a type. */
4757 if (TYPE_PTRMEM_P (type))
4759 /* Pointer to member: associate class type and value type. */
4760 if (arg_assoc_type (k, TYPE_PTRMEM_CLASS_TYPE (type)))
4762 return arg_assoc_type (k, TYPE_PTRMEM_POINTED_TO_TYPE (type));
4764 else switch (TREE_CODE (type))
4774 case FIXED_POINT_TYPE:
4778 if (TYPE_PTRMEMFUNC_P (type))
4779 return arg_assoc_type (k, TYPE_PTRMEMFUNC_FN_TYPE (type));
4780 return arg_assoc_class (k, type);
4782 case REFERENCE_TYPE:
4784 return arg_assoc_type (k, TREE_TYPE (type));
4787 return arg_assoc_namespace (k, decl_namespace_context (type));
4789 /* The basetype is referenced in the first arg type, so just
4792 /* Associate the parameter types. */
4793 if (arg_assoc_args (k, TYPE_ARG_TYPES (type)))
4795 /* Associate the return type. */
4796 return arg_assoc_type (k, TREE_TYPE (type));
4797 case TEMPLATE_TYPE_PARM:
4798 case BOUND_TEMPLATE_TEMPLATE_PARM:
4803 gcc_assert (type == unknown_type_node
4804 || type == init_list_type_node);
4806 case TYPE_PACK_EXPANSION:
4807 return arg_assoc_type (k, PACK_EXPANSION_PATTERN (type));
4815 /* Adds everything associated with arguments. Returns true on error. */
4818 arg_assoc_args (struct arg_lookup *k, tree args)
4820 for (; args; args = TREE_CHAIN (args))
4821 if (arg_assoc (k, TREE_VALUE (args)))
4826 /* Adds everything associated with an argument vector. Returns true
4830 arg_assoc_args_vec (struct arg_lookup *k, VEC(tree,gc) *args)
4835 for (ix = 0; VEC_iterate (tree, args, ix, arg); ++ix)
4836 if (arg_assoc (k, arg))
4841 /* Adds everything associated with a given tree_node. Returns 1 on error. */
4844 arg_assoc (struct arg_lookup *k, tree n)
4846 if (n == error_mark_node)
4850 return arg_assoc_type (k, n);
4852 if (! type_unknown_p (n))
4853 return arg_assoc_type (k, TREE_TYPE (n));
4855 if (TREE_CODE (n) == ADDR_EXPR)
4856 n = TREE_OPERAND (n, 0);
4857 if (TREE_CODE (n) == COMPONENT_REF)
4858 n = TREE_OPERAND (n, 1);
4859 if (TREE_CODE (n) == OFFSET_REF)
4860 n = TREE_OPERAND (n, 1);
4861 while (TREE_CODE (n) == TREE_LIST)
4863 if (TREE_CODE (n) == BASELINK)
4864 n = BASELINK_FUNCTIONS (n);
4866 if (TREE_CODE (n) == FUNCTION_DECL)
4867 return arg_assoc_type (k, TREE_TYPE (n));
4868 if (TREE_CODE (n) == TEMPLATE_ID_EXPR)
4870 /* [basic.lookup.koenig]
4872 If T is a template-id, its associated namespaces and classes
4873 are the namespace in which the template is defined; for
4874 member templates, the member template's class... */
4875 tree templ = TREE_OPERAND (n, 0);
4876 tree args = TREE_OPERAND (n, 1);
4880 if (TREE_CODE (templ) == COMPONENT_REF)
4881 templ = TREE_OPERAND (templ, 1);
4883 /* First, the template. There may actually be more than one if
4884 this is an overloaded function template. But, in that case,
4885 we only need the first; all the functions will be in the same
4887 templ = OVL_CURRENT (templ);
4889 ctx = CP_DECL_CONTEXT (templ);
4891 if (TREE_CODE (ctx) == NAMESPACE_DECL)
4893 if (arg_assoc_namespace (k, ctx) == 1)
4896 /* It must be a member template. */
4897 else if (arg_assoc_class (k, ctx) == 1)
4900 /* Now the arguments. */
4902 for (ix = TREE_VEC_LENGTH (args); ix--;)
4903 if (arg_assoc_template_arg (k, TREE_VEC_ELT (args, ix)) == 1)
4906 else if (TREE_CODE (n) == OVERLOAD)
4908 for (; n; n = OVL_CHAIN (n))
4909 if (arg_assoc_type (k, TREE_TYPE (OVL_FUNCTION (n))))
4916 /* Performs Koenig lookup depending on arguments, where fns
4917 are the functions found in normal lookup. */
4920 lookup_arg_dependent (tree name, tree fns, VEC(tree,gc) *args)
4922 struct arg_lookup k;
4924 timevar_push (TV_NAME_LOOKUP);
4926 /* Remove any hidden friend functions from the list of functions
4927 found so far. They will be added back by arg_assoc_class as
4929 fns = remove_hidden_names (fns);
4934 k.classes = NULL_TREE;
4936 /* We previously performed an optimization here by setting
4937 NAMESPACES to the current namespace when it was safe. However, DR
4938 164 says that namespaces that were already searched in the first
4939 stage of template processing are searched again (potentially
4940 picking up later definitions) in the second stage. */
4941 k.namespaces = NULL_TREE;
4943 arg_assoc_args_vec (&k, args);
4948 && TREE_CODE (fns) != VAR_DECL
4949 && !is_overloaded_fn (fns))
4951 error ("argument dependent lookup finds %q+D", fns);
4952 error (" in call to %qD", name);
4953 fns = error_mark_node;
4956 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, fns);
4959 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4960 changed (i.e. there was already a directive), or the fresh
4961 TREE_LIST otherwise. */
4964 push_using_directive (tree used)
4966 tree ud = current_binding_level->using_directives;
4967 tree iter, ancestor;
4969 timevar_push (TV_NAME_LOOKUP);
4970 /* Check if we already have this. */
4971 if (purpose_member (used, ud) != NULL_TREE)
4972 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
4974 ancestor = namespace_ancestor (current_decl_namespace (), used);
4975 ud = current_binding_level->using_directives;
4976 ud = tree_cons (used, ancestor, ud);
4977 current_binding_level->using_directives = ud;
4979 /* Recursively add all namespaces used. */
4980 for (iter = DECL_NAMESPACE_USING (used); iter; iter = TREE_CHAIN (iter))
4981 push_using_directive (TREE_PURPOSE (iter));
4983 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, ud);
4986 /* The type TYPE is being declared. If it is a class template, or a
4987 specialization of a class template, do any processing required and
4988 perform error-checking. If IS_FRIEND is nonzero, this TYPE is
4989 being declared a friend. B is the binding level at which this TYPE
4992 Returns the TYPE_DECL for TYPE, which may have been altered by this
4996 maybe_process_template_type_declaration (tree type, int is_friend,
4999 tree decl = TYPE_NAME (type);
5001 if (processing_template_parmlist)
5002 /* You can't declare a new template type in a template parameter
5003 list. But, you can declare a non-template type:
5005 template <class A*> struct S;
5007 is a forward-declaration of `A'. */
5009 else if (b->kind == sk_namespace
5010 && current_binding_level->kind != sk_namespace)
5011 /* If this new type is being injected into a containing scope,
5012 then it's not a template type. */
5016 gcc_assert (MAYBE_CLASS_TYPE_P (type)
5017 || TREE_CODE (type) == ENUMERAL_TYPE);
5019 if (processing_template_decl)
5021 /* This may change after the call to
5022 push_template_decl_real, but we want the original value. */
5023 tree name = DECL_NAME (decl);
5025 decl = push_template_decl_real (decl, is_friend);
5026 if (decl == error_mark_node)
5027 return error_mark_node;
5029 /* If the current binding level is the binding level for the
5030 template parameters (see the comment in
5031 begin_template_parm_list) and the enclosing level is a class
5032 scope, and we're not looking at a friend, push the
5033 declaration of the member class into the class scope. In the
5034 friend case, push_template_decl will already have put the
5035 friend into global scope, if appropriate. */
5036 if (TREE_CODE (type) != ENUMERAL_TYPE
5037 && !is_friend && b->kind == sk_template_parms
5038 && b->level_chain->kind == sk_class)
5040 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type));
5042 if (!COMPLETE_TYPE_P (current_class_type))
5044 maybe_add_class_template_decl_list (current_class_type,
5045 type, /*friend_p=*/0);
5046 /* Put this UTD in the table of UTDs for the class. */
5047 if (CLASSTYPE_NESTED_UTDS (current_class_type) == NULL)
5048 CLASSTYPE_NESTED_UTDS (current_class_type) =
5049 binding_table_new (SCOPE_DEFAULT_HT_SIZE);
5051 binding_table_insert
5052 (CLASSTYPE_NESTED_UTDS (current_class_type), name, type);
5061 /* Push a tag name NAME for struct/class/union/enum type TYPE. In case
5062 that the NAME is a class template, the tag is processed but not pushed.
5064 The pushed scope depend on the SCOPE parameter:
5065 - When SCOPE is TS_CURRENT, put it into the inner-most non-sk_cleanup
5067 - When SCOPE is TS_GLOBAL, put it in the inner-most non-class and
5068 non-template-parameter scope. This case is needed for forward
5070 - When SCOPE is TS_WITHIN_ENCLOSING_NON_CLASS, this is similar to
5071 TS_GLOBAL case except that names within template-parameter scopes
5072 are not pushed at all.
5074 Returns TYPE upon success and ERROR_MARK_NODE otherwise. */
5077 pushtag (tree name, tree type, tag_scope scope)
5079 struct cp_binding_level *b;
5082 timevar_push (TV_NAME_LOOKUP);
5083 b = current_binding_level;
5084 while (/* Cleanup scopes are not scopes from the point of view of
5086 b->kind == sk_cleanup
5087 /* Neither are function parameter scopes. */
5088 || b->kind == sk_function_parms
5089 /* Neither are the scopes used to hold template parameters
5090 for an explicit specialization. For an ordinary template
5091 declaration, these scopes are not scopes from the point of
5092 view of the language. */
5093 || (b->kind == sk_template_parms
5094 && (b->explicit_spec_p || scope == ts_global))
5095 || (b->kind == sk_class
5096 && (scope != ts_current
5097 /* We may be defining a new type in the initializer
5098 of a static member variable. We allow this when
5099 not pedantic, and it is particularly useful for
5100 type punning via an anonymous union. */
5101 || COMPLETE_TYPE_P (b->this_entity))))
5104 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
5106 /* Do C++ gratuitous typedefing. */
5107 if (IDENTIFIER_TYPE_VALUE (name) != type)
5111 tree context = TYPE_CONTEXT (type);
5115 tree cs = current_scope ();
5117 if (scope == ts_current)
5119 else if (cs != NULL_TREE && TYPE_P (cs))
5120 /* When declaring a friend class of a local class, we want
5121 to inject the newly named class into the scope
5122 containing the local class, not the namespace
5124 context = decl_function_context (get_type_decl (cs));
5127 context = current_namespace;
5129 if (b->kind == sk_class
5130 || (b->kind == sk_template_parms
5131 && b->level_chain->kind == sk_class))
5134 if (current_lang_name == lang_name_java)
5135 TYPE_FOR_JAVA (type) = 1;
5137 tdef = create_implicit_typedef (name, type);
5138 DECL_CONTEXT (tdef) = FROB_CONTEXT (context);
5139 if (scope == ts_within_enclosing_non_class)
5141 /* This is a friend. Make this TYPE_DECL node hidden from
5142 ordinary name lookup. Its corresponding TEMPLATE_DECL
5143 will be marked in push_template_decl_real. */
5144 retrofit_lang_decl (tdef);
5145 DECL_ANTICIPATED (tdef) = 1;
5146 DECL_FRIEND_P (tdef) = 1;
5149 decl = maybe_process_template_type_declaration
5150 (type, scope == ts_within_enclosing_non_class, b);
5151 if (decl == error_mark_node)
5152 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl);
5154 if (b->kind == sk_class)
5156 if (!TYPE_BEING_DEFINED (current_class_type))
5157 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
5159 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
5160 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
5161 class. But if it's a member template class, we want
5162 the TEMPLATE_DECL, not the TYPE_DECL, so this is done
5164 finish_member_declaration (decl);
5166 pushdecl_class_level (decl);
5168 else if (b->kind != sk_template_parms)
5170 decl = pushdecl_with_scope (decl, b, /*is_friend=*/false);
5171 if (decl == error_mark_node)
5172 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl);
5176 set_identifier_type_value_with_scope (name, tdef, b);
5178 TYPE_CONTEXT (type) = DECL_CONTEXT (decl);
5180 /* If this is a local class, keep track of it. We need this
5181 information for name-mangling, and so that it is possible to
5182 find all function definitions in a translation unit in a
5183 convenient way. (It's otherwise tricky to find a member
5184 function definition it's only pointed to from within a local
5186 if (TYPE_CONTEXT (type)
5187 && TREE_CODE (TYPE_CONTEXT (type)) == FUNCTION_DECL)
5188 VEC_safe_push (tree, gc, local_classes, type);
5190 if (b->kind == sk_class
5191 && !COMPLETE_TYPE_P (current_class_type))
5193 maybe_add_class_template_decl_list (current_class_type,
5194 type, /*friend_p=*/0);
5196 if (CLASSTYPE_NESTED_UTDS (current_class_type) == NULL)
5197 CLASSTYPE_NESTED_UTDS (current_class_type)
5198 = binding_table_new (SCOPE_DEFAULT_HT_SIZE);
5200 binding_table_insert
5201 (CLASSTYPE_NESTED_UTDS (current_class_type), name, type);
5204 decl = TYPE_NAME (type);
5205 gcc_assert (TREE_CODE (decl) == TYPE_DECL);
5206 TYPE_STUB_DECL (type) = decl;
5208 /* Set type visibility now if this is a forward declaration. */
5209 TREE_PUBLIC (decl) = 1;
5210 determine_visibility (decl);
5212 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, type);
5215 /* Subroutines for reverting temporarily to top-level for instantiation
5216 of templates and such. We actually need to clear out the class- and
5217 local-value slots of all identifiers, so that only the global values
5218 are at all visible. Simply setting current_binding_level to the global
5219 scope isn't enough, because more binding levels may be pushed. */
5220 struct saved_scope *scope_chain;
5222 /* If ID has not already been marked, add an appropriate binding to
5226 store_binding (tree id, VEC(cxx_saved_binding,gc) **old_bindings)
5228 cxx_saved_binding *saved;
5230 if (!id || !IDENTIFIER_BINDING (id))
5233 if (IDENTIFIER_MARKED (id))
5236 IDENTIFIER_MARKED (id) = 1;
5238 saved = VEC_safe_push (cxx_saved_binding, gc, *old_bindings, NULL);
5239 saved->identifier = id;
5240 saved->binding = IDENTIFIER_BINDING (id);
5241 saved->real_type_value = REAL_IDENTIFIER_TYPE_VALUE (id);
5242 IDENTIFIER_BINDING (id) = NULL;
5246 store_bindings (tree names, VEC(cxx_saved_binding,gc) **old_bindings)
5250 timevar_push (TV_NAME_LOOKUP);
5251 for (t = names; t; t = TREE_CHAIN (t))
5255 if (TREE_CODE (t) == TREE_LIST)
5256 id = TREE_PURPOSE (t);
5260 store_binding (id, old_bindings);
5262 timevar_pop (TV_NAME_LOOKUP);
5265 /* Like store_bindings, but NAMES is a vector of cp_class_binding
5266 objects, rather than a TREE_LIST. */
5269 store_class_bindings (VEC(cp_class_binding,gc) *names,
5270 VEC(cxx_saved_binding,gc) **old_bindings)
5273 cp_class_binding *cb;
5275 timevar_push (TV_NAME_LOOKUP);
5276 for (i = 0; VEC_iterate(cp_class_binding, names, i, cb); ++i)
5277 store_binding (cb->identifier, old_bindings);
5278 timevar_pop (TV_NAME_LOOKUP);
5282 push_to_top_level (void)
5284 struct saved_scope *s;
5285 struct cp_binding_level *b;
5286 cxx_saved_binding *sb;
5290 timevar_push (TV_NAME_LOOKUP);
5291 s = GGC_CNEW (struct saved_scope);
5293 b = scope_chain ? current_binding_level : 0;
5295 /* If we're in the middle of some function, save our state. */
5299 push_function_context ();
5304 if (scope_chain && previous_class_level)
5305 store_class_bindings (previous_class_level->class_shadowed,
5308 /* Have to include the global scope, because class-scope decls
5309 aren't listed anywhere useful. */
5310 for (; b; b = b->level_chain)
5314 /* Template IDs are inserted into the global level. If they were
5315 inserted into namespace level, finish_file wouldn't find them
5316 when doing pending instantiations. Therefore, don't stop at
5317 namespace level, but continue until :: . */
5318 if (global_scope_p (b))
5321 store_bindings (b->names, &s->old_bindings);
5322 /* We also need to check class_shadowed to save class-level type
5323 bindings, since pushclass doesn't fill in b->names. */
5324 if (b->kind == sk_class)
5325 store_class_bindings (b->class_shadowed, &s->old_bindings);
5327 /* Unwind type-value slots back to top level. */
5328 for (t = b->type_shadowed; t; t = TREE_CHAIN (t))
5329 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t), TREE_VALUE (t));
5332 for (i = 0; VEC_iterate (cxx_saved_binding, s->old_bindings, i, sb); ++i)
5333 IDENTIFIER_MARKED (sb->identifier) = 0;
5335 s->prev = scope_chain;
5337 s->need_pop_function_context = need_pop;
5338 s->function_decl = current_function_decl;
5339 s->unevaluated_operand = cp_unevaluated_operand;
5340 s->inhibit_evaluation_warnings = c_inhibit_evaluation_warnings;
5343 current_function_decl = NULL_TREE;
5344 current_lang_base = VEC_alloc (tree, gc, 10);
5345 current_lang_name = lang_name_cplusplus;
5346 current_namespace = global_namespace;
5347 push_class_stack ();
5348 cp_unevaluated_operand = 0;
5349 c_inhibit_evaluation_warnings = 0;
5350 timevar_pop (TV_NAME_LOOKUP);
5354 pop_from_top_level (void)
5356 struct saved_scope *s = scope_chain;
5357 cxx_saved_binding *saved;
5360 timevar_push (TV_NAME_LOOKUP);
5361 /* Clear out class-level bindings cache. */
5362 if (previous_class_level)
5363 invalidate_class_lookup_cache ();
5366 current_lang_base = 0;
5368 scope_chain = s->prev;
5369 for (i = 0; VEC_iterate (cxx_saved_binding, s->old_bindings, i, saved); ++i)
5371 tree id = saved->identifier;
5373 IDENTIFIER_BINDING (id) = saved->binding;
5374 SET_IDENTIFIER_TYPE_VALUE (id, saved->real_type_value);
5377 /* If we were in the middle of compiling a function, restore our
5379 if (s->need_pop_function_context)
5380 pop_function_context ();
5381 current_function_decl = s->function_decl;
5382 cp_unevaluated_operand = s->unevaluated_operand;
5383 c_inhibit_evaluation_warnings = s->inhibit_evaluation_warnings;
5384 timevar_pop (TV_NAME_LOOKUP);
5387 /* Pop off extraneous binding levels left over due to syntax errors.
5389 We don't pop past namespaces, as they might be valid. */
5392 pop_everything (void)
5394 if (ENABLE_SCOPE_CHECKING)
5395 verbatim ("XXX entering pop_everything ()\n");
5396 while (!toplevel_bindings_p ())
5398 if (current_binding_level->kind == sk_class)
5399 pop_nested_class ();
5403 if (ENABLE_SCOPE_CHECKING)
5404 verbatim ("XXX leaving pop_everything ()\n");
5407 /* Emit debugging information for using declarations and directives.
5408 If input tree is overloaded fn then emit debug info for all
5412 cp_emit_debug_info_for_using (tree t, tree context)
5414 /* Don't try to emit any debug information if we have errors. */
5415 if (sorrycount || errorcount)
5418 /* Ignore this FUNCTION_DECL if it refers to a builtin declaration
5419 of a builtin function. */
5420 if (TREE_CODE (t) == FUNCTION_DECL
5421 && DECL_EXTERNAL (t)
5422 && DECL_BUILT_IN (t))
5425 /* Do not supply context to imported_module_or_decl, if
5426 it is a global namespace. */
5427 if (context == global_namespace)
5428 context = NULL_TREE;
5431 t = BASELINK_FUNCTIONS (t);
5433 /* FIXME: Handle TEMPLATE_DECLs. */
5434 for (t = OVL_CURRENT (t); t; t = OVL_NEXT (t))
5435 if (TREE_CODE (t) != TEMPLATE_DECL)
5437 if (building_stmt_tree ())
5438 add_stmt (build_stmt (input_location, USING_STMT, t));
5440 (*debug_hooks->imported_module_or_decl) (t, NULL_TREE, context, false);
5444 #include "gt-cp-name-lookup.h"