1 /* Definitions for C++ name lookup routines.
2 Copyright (C) 2003, 2004, 2005, 2006 Free Software Foundation, Inc.
3 Contributed by Gabriel Dos Reis <gdr@integrable-solutions.net>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to
19 the Free Software Foundation, 51 Franklin Street, Fifth Floor,
20 Boston, MA 02110-1301, USA. */
24 #include "coretypes.h"
29 #include "name-lookup.h"
32 #include "diagnostic.h"
35 /* The bindings for a particular name in a particular scope. */
37 struct scope_binding {
41 #define EMPTY_SCOPE_BINDING { NULL_TREE, NULL_TREE }
43 static cxx_scope *innermost_nonclass_level (void);
44 static tree select_decl (const struct scope_binding *, int);
45 static cxx_binding *binding_for_name (cxx_scope *, tree);
46 static tree lookup_name_innermost_nonclass_level (tree);
47 static tree push_overloaded_decl (tree, int, bool);
48 static bool lookup_using_namespace (tree, struct scope_binding *, tree,
50 static bool qualified_lookup_using_namespace (tree, tree,
51 struct scope_binding *, int);
52 static tree lookup_type_current_level (tree);
53 static tree push_using_directive (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;
64 /* Compute the chain index of a binding_entry given the HASH value of its
65 name and the total COUNT of chains. COUNT is assumed to be a power
68 #define ENTRY_INDEX(HASH, COUNT) (((HASH) >> 3) & ((COUNT) - 1))
70 /* A free list of "binding_entry"s awaiting for re-use. */
72 static GTY((deletable)) binding_entry free_binding_entry = NULL;
74 /* Create a binding_entry object for (NAME, TYPE). */
76 static inline binding_entry
77 binding_entry_make (tree name, tree type)
81 if (free_binding_entry)
83 entry = free_binding_entry;
84 free_binding_entry = entry->chain;
87 entry = GGC_NEW (struct binding_entry_s);
96 /* Put ENTRY back on the free list. */
99 binding_entry_free (binding_entry entry)
103 entry->chain = free_binding_entry;
104 free_binding_entry = entry;
108 /* The datatype used to implement the mapping from names to types at
110 struct binding_table_s GTY(())
112 /* Array of chains of "binding_entry"s */
113 binding_entry * GTY((length ("%h.chain_count"))) chain;
115 /* The number of chains in this table. This is the length of the
116 the member "chain" considered as an array. */
119 /* Number of "binding_entry"s in this table. */
123 /* Construct TABLE with an initial CHAIN_COUNT. */
126 binding_table_construct (binding_table table, size_t chain_count)
128 table->chain_count = chain_count;
129 table->entry_count = 0;
130 table->chain = GGC_CNEWVEC (binding_entry, table->chain_count);
133 /* Make TABLE's entries ready for reuse. */
136 binding_table_free (binding_table table)
144 for (i = 0, count = table->chain_count; i < count; ++i)
146 binding_entry temp = table->chain[i];
149 binding_entry entry = temp;
151 binding_entry_free (entry);
153 table->chain[i] = NULL;
155 table->entry_count = 0;
159 /* Allocate a table with CHAIN_COUNT, assumed to be a power of two. */
161 static inline binding_table
162 binding_table_new (size_t chain_count)
164 binding_table table = GGC_NEW (struct binding_table_s);
166 binding_table_construct (table, chain_count);
170 /* Expand TABLE to twice its current chain_count. */
173 binding_table_expand (binding_table table)
175 const size_t old_chain_count = table->chain_count;
176 const size_t old_entry_count = table->entry_count;
177 const size_t new_chain_count = 2 * old_chain_count;
178 binding_entry *old_chains = table->chain;
181 binding_table_construct (table, new_chain_count);
182 for (i = 0; i < old_chain_count; ++i)
184 binding_entry entry = old_chains[i];
185 for (; entry != NULL; entry = old_chains[i])
187 const unsigned int hash = IDENTIFIER_HASH_VALUE (entry->name);
188 const size_t j = ENTRY_INDEX (hash, new_chain_count);
190 old_chains[i] = entry->chain;
191 entry->chain = table->chain[j];
192 table->chain[j] = entry;
195 table->entry_count = old_entry_count;
198 /* Insert a binding for NAME to TYPE into TABLE. */
201 binding_table_insert (binding_table table, tree name, tree type)
203 const unsigned int hash = IDENTIFIER_HASH_VALUE (name);
204 const size_t i = ENTRY_INDEX (hash, table->chain_count);
205 binding_entry entry = binding_entry_make (name, type);
207 entry->chain = table->chain[i];
208 table->chain[i] = entry;
209 ++table->entry_count;
211 if (3 * table->chain_count < 5 * table->entry_count)
212 binding_table_expand (table);
215 /* Return the binding_entry, if any, that maps NAME. */
218 binding_table_find (binding_table table, tree name)
220 const unsigned int hash = IDENTIFIER_HASH_VALUE (name);
221 binding_entry entry = table->chain[ENTRY_INDEX (hash, table->chain_count)];
223 while (entry != NULL && entry->name != name)
224 entry = entry->chain;
229 /* Apply PROC -- with DATA -- to all entries in TABLE. */
232 binding_table_foreach (binding_table table, bt_foreach_proc proc, void *data)
234 const size_t chain_count = table->chain_count;
237 for (i = 0; i < chain_count; ++i)
239 binding_entry entry = table->chain[i];
240 for (; entry != NULL; entry = entry->chain)
245 #ifndef ENABLE_SCOPE_CHECKING
246 # define ENABLE_SCOPE_CHECKING 0
248 # define ENABLE_SCOPE_CHECKING 1
251 /* A free list of "cxx_binding"s, connected by their PREVIOUS. */
253 static GTY((deletable)) cxx_binding *free_bindings;
255 /* Initialize VALUE and TYPE field for BINDING, and set the PREVIOUS
259 cxx_binding_init (cxx_binding *binding, tree value, tree type)
261 binding->value = value;
262 binding->type = type;
263 binding->previous = NULL;
266 /* (GC)-allocate a binding object with VALUE and TYPE member initialized. */
269 cxx_binding_make (tree value, tree type)
271 cxx_binding *binding;
274 binding = free_bindings;
275 free_bindings = binding->previous;
278 binding = GGC_NEW (cxx_binding);
280 cxx_binding_init (binding, value, type);
285 /* Put BINDING back on the free list. */
288 cxx_binding_free (cxx_binding *binding)
290 binding->scope = NULL;
291 binding->previous = free_bindings;
292 free_bindings = binding;
295 /* Create a new binding for NAME (with the indicated VALUE and TYPE
296 bindings) in the class scope indicated by SCOPE. */
299 new_class_binding (tree name, tree value, tree type, cxx_scope *scope)
301 cp_class_binding *cb;
302 cxx_binding *binding;
304 if (VEC_length (cp_class_binding, scope->class_shadowed))
306 cp_class_binding *old_base;
307 old_base = VEC_index (cp_class_binding, scope->class_shadowed, 0);
308 if (VEC_reserve (cp_class_binding, gc, scope->class_shadowed, 1))
310 /* Fixup the current bindings, as they might have moved. */
314 VEC_iterate (cp_class_binding, scope->class_shadowed, i, cb);
318 b = &IDENTIFIER_BINDING (cb->identifier);
319 while (*b != &old_base[i].base)
320 b = &((*b)->previous);
324 cb = VEC_quick_push (cp_class_binding, scope->class_shadowed, NULL);
327 cb = VEC_safe_push (cp_class_binding, gc, scope->class_shadowed, NULL);
329 cb->identifier = name;
331 binding->scope = scope;
332 cxx_binding_init (binding, value, type);
336 /* Make DECL the innermost binding for ID. The LEVEL is the binding
337 level at which this declaration is being bound. */
340 push_binding (tree id, tree decl, cxx_scope* level)
342 cxx_binding *binding;
344 if (level != class_binding_level)
346 binding = cxx_binding_make (decl, NULL_TREE);
347 binding->scope = level;
350 binding = new_class_binding (id, decl, /*type=*/NULL_TREE, level);
352 /* Now, fill in the binding information. */
353 binding->previous = IDENTIFIER_BINDING (id);
354 INHERITED_VALUE_BINDING_P (binding) = 0;
355 LOCAL_BINDING_P (binding) = (level != class_binding_level);
357 /* And put it on the front of the list of bindings for ID. */
358 IDENTIFIER_BINDING (id) = binding;
361 /* Remove the binding for DECL which should be the innermost binding
365 pop_binding (tree id, tree decl)
367 cxx_binding *binding;
370 /* It's easiest to write the loops that call this function without
371 checking whether or not the entities involved have names. We
372 get here for such an entity. */
375 /* Get the innermost binding for ID. */
376 binding = IDENTIFIER_BINDING (id);
378 /* The name should be bound. */
379 gcc_assert (binding != NULL);
381 /* The DECL will be either the ordinary binding or the type
382 binding for this identifier. Remove that binding. */
383 if (binding->value == decl)
384 binding->value = NULL_TREE;
387 gcc_assert (binding->type == decl);
388 binding->type = NULL_TREE;
391 if (!binding->value && !binding->type)
393 /* We're completely done with the innermost binding for this
394 identifier. Unhook it from the list of bindings. */
395 IDENTIFIER_BINDING (id) = binding->previous;
397 /* Add it to the free list. */
398 cxx_binding_free (binding);
402 /* BINDING records an existing declaration for a name in the current scope.
403 But, DECL is another declaration for that same identifier in the
404 same scope. This is the `struct stat' hack whereby a non-typedef
405 class name or enum-name can be bound at the same level as some other
409 A class name (9.1) or enumeration name (7.2) can be hidden by the
410 name of an object, function, or enumerator declared in the same scope.
411 If a class or enumeration name and an object, function, or enumerator
412 are declared in the same scope (in any order) with the same name, the
413 class or enumeration name is hidden wherever the object, function, or
414 enumerator name is visible.
416 It's the responsibility of the caller to check that
417 inserting this name is valid here. Returns nonzero if the new binding
421 supplement_binding (cxx_binding *binding, tree decl)
423 tree bval = binding->value;
426 timevar_push (TV_NAME_LOOKUP);
427 if (TREE_CODE (decl) == TYPE_DECL && DECL_ARTIFICIAL (decl))
428 /* The new name is the type name. */
429 binding->type = decl;
430 else if (/* BVAL is null when push_class_level_binding moves an
431 inherited type-binding out of the way to make room for a
432 new value binding. */
434 /* BVAL is error_mark_node when DECL's name has been used
435 in a non-class scope prior declaration. In that case,
436 we should have already issued a diagnostic; for graceful
437 error recovery purpose, pretend this was the intended
438 declaration for that name. */
439 || bval == error_mark_node
440 /* If BVAL is anticipated but has not yet been declared,
441 pretend it is not there at all. */
442 || (TREE_CODE (bval) == FUNCTION_DECL
443 && DECL_ANTICIPATED (bval)
444 && !DECL_HIDDEN_FRIEND_P (bval)))
445 binding->value = decl;
446 else if (TREE_CODE (bval) == TYPE_DECL && DECL_ARTIFICIAL (bval))
448 /* The old binding was a type name. It was placed in
449 VALUE field because it was thought, at the point it was
450 declared, to be the only entity with such a name. Move the
451 type name into the type slot; it is now hidden by the new
453 binding->type = bval;
454 binding->value = decl;
455 binding->value_is_inherited = false;
457 else if (TREE_CODE (bval) == TYPE_DECL
458 && TREE_CODE (decl) == TYPE_DECL
459 && DECL_NAME (decl) == DECL_NAME (bval)
460 && binding->scope->kind != sk_class
461 && (same_type_p (TREE_TYPE (decl), TREE_TYPE (bval))
462 /* If either type involves template parameters, we must
463 wait until instantiation. */
464 || uses_template_parms (TREE_TYPE (decl))
465 || uses_template_parms (TREE_TYPE (bval))))
466 /* We have two typedef-names, both naming the same type to have
467 the same name. In general, this is OK because of:
471 In a given scope, a typedef specifier can be used to redefine
472 the name of any type declared in that scope to refer to the
473 type to which it already refers.
475 However, in class scopes, this rule does not apply due to the
476 stricter language in [class.mem] prohibiting redeclarations of
479 /* There can be two block-scope declarations of the same variable,
480 so long as they are `extern' declarations. However, there cannot
481 be two declarations of the same static data member:
485 A member shall not be declared twice in the
486 member-specification. */
487 else if (TREE_CODE (decl) == VAR_DECL && TREE_CODE (bval) == VAR_DECL
488 && DECL_EXTERNAL (decl) && DECL_EXTERNAL (bval)
489 && !DECL_CLASS_SCOPE_P (decl))
491 duplicate_decls (decl, binding->value, /*newdecl_is_friend=*/false);
494 else if (TREE_CODE (decl) == NAMESPACE_DECL
495 && TREE_CODE (bval) == NAMESPACE_DECL
496 && DECL_NAMESPACE_ALIAS (decl)
497 && DECL_NAMESPACE_ALIAS (bval)
498 && ORIGINAL_NAMESPACE (bval) == ORIGINAL_NAMESPACE (decl))
501 In a declarative region, a namespace-alias-definition can be
502 used to redefine a namespace-alias declared in that declarative
503 region to refer only to the namespace to which it already
508 error ("declaration of %q#D", decl);
509 error ("conflicts with previous declaration %q+#D", bval);
513 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, ok);
516 /* Add DECL to the list of things declared in B. */
519 add_decl_to_level (tree decl, cxx_scope *b)
521 if (TREE_CODE (decl) == NAMESPACE_DECL
522 && !DECL_NAMESPACE_ALIAS (decl))
524 TREE_CHAIN (decl) = b->namespaces;
525 b->namespaces = decl;
527 else if (TREE_CODE (decl) == VAR_DECL && DECL_VIRTUAL_P (decl))
529 TREE_CHAIN (decl) = b->vtables;
534 /* We build up the list in reverse order, and reverse it later if
536 TREE_CHAIN (decl) = b->names;
540 /* If appropriate, add decl to separate list of statics. We
541 include extern variables because they might turn out to be
542 static later. It's OK for this list to contain a few false
544 if (b->kind == sk_namespace)
545 if ((TREE_CODE (decl) == VAR_DECL
546 && (TREE_STATIC (decl) || DECL_EXTERNAL (decl)))
547 || (TREE_CODE (decl) == FUNCTION_DECL
548 && (!TREE_PUBLIC (decl) || DECL_DECLARED_INLINE_P (decl))))
549 VEC_safe_push (tree, gc, b->static_decls, decl);
553 /* Record a decl-node X as belonging to the current lexical scope.
554 Check for errors (such as an incompatible declaration for the same
555 name already seen in the same scope). IS_FRIEND is true if X is
556 declared as a friend.
558 Returns either X or an old decl for the same name.
559 If an old decl is returned, it may have been smashed
560 to agree with what X says. */
563 pushdecl_maybe_friend (tree x, bool is_friend)
567 int need_new_binding;
569 timevar_push (TV_NAME_LOOKUP);
571 need_new_binding = 1;
573 if (DECL_TEMPLATE_PARM_P (x))
574 /* Template parameters have no context; they are not X::T even
575 when declared within a class or namespace. */
579 if (current_function_decl && x != current_function_decl
580 /* A local declaration for a function doesn't constitute
582 && TREE_CODE (x) != FUNCTION_DECL
583 /* A local declaration for an `extern' variable is in the
584 scope of the current namespace, not the current
586 && !(TREE_CODE (x) == VAR_DECL && DECL_EXTERNAL (x))
587 && !DECL_CONTEXT (x))
588 DECL_CONTEXT (x) = current_function_decl;
590 /* If this is the declaration for a namespace-scope function,
591 but the declaration itself is in a local scope, mark the
593 if (TREE_CODE (x) == FUNCTION_DECL
594 && DECL_NAMESPACE_SCOPE_P (x)
595 && current_function_decl
596 && x != current_function_decl)
597 DECL_LOCAL_FUNCTION_P (x) = 1;
600 name = DECL_NAME (x);
603 int different_binding_level = 0;
605 if (TREE_CODE (x) == FUNCTION_DECL || DECL_FUNCTION_TEMPLATE_P (x))
606 check_default_args (x);
608 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
609 name = TREE_OPERAND (name, 0);
611 /* In case this decl was explicitly namespace-qualified, look it
612 up in its namespace context. */
613 if (DECL_NAMESPACE_SCOPE_P (x) && namespace_bindings_p ())
614 t = namespace_binding (name, DECL_CONTEXT (x));
616 t = lookup_name_innermost_nonclass_level (name);
618 /* [basic.link] If there is a visible declaration of an entity
619 with linkage having the same name and type, ignoring entities
620 declared outside the innermost enclosing namespace scope, the
621 block scope declaration declares that same entity and
622 receives the linkage of the previous declaration. */
623 if (! t && current_function_decl && x != current_function_decl
624 && (TREE_CODE (x) == FUNCTION_DECL || TREE_CODE (x) == VAR_DECL)
625 && DECL_EXTERNAL (x))
627 /* Look in block scope. */
628 t = innermost_non_namespace_value (name);
629 /* Or in the innermost namespace. */
631 t = namespace_binding (name, DECL_CONTEXT (x));
632 /* Does it have linkage? Note that if this isn't a DECL, it's an
633 OVERLOAD, which is OK. */
634 if (t && DECL_P (t) && ! (TREE_STATIC (t) || DECL_EXTERNAL (t)))
637 different_binding_level = 1;
640 /* If we are declaring a function, and the result of name-lookup
641 was an OVERLOAD, look for an overloaded instance that is
642 actually the same as the function we are declaring. (If
643 there is one, we have to merge our declaration with the
644 previous declaration.) */
645 if (t && TREE_CODE (t) == OVERLOAD)
649 if (TREE_CODE (x) == FUNCTION_DECL)
650 for (match = t; match; match = OVL_NEXT (match))
652 if (decls_match (OVL_CURRENT (match), x))
656 /* Just choose one. */
660 t = OVL_CURRENT (match);
665 if (t && t != error_mark_node)
667 if (different_binding_level)
669 if (decls_match (x, t))
670 /* The standard only says that the local extern
671 inherits linkage from the previous decl; in
672 particular, default args are not shared. We must
673 also tell cgraph to treat these decls as the same,
674 or we may neglect to emit an "unused" static - we
675 do this by making the DECL_UIDs equal, which should
676 be viewed as a kludge. FIXME. */
678 TREE_PUBLIC (x) = TREE_PUBLIC (t);
679 DECL_UID (x) = DECL_UID (t);
682 else if (TREE_CODE (t) == PARM_DECL)
684 gcc_assert (DECL_CONTEXT (t));
686 /* Check for duplicate params. */
687 if (duplicate_decls (x, t, is_friend))
688 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
690 else if ((DECL_EXTERN_C_FUNCTION_P (x)
691 || DECL_FUNCTION_TEMPLATE_P (x))
692 && is_overloaded_fn (t))
693 /* Don't do anything just yet. */;
694 else if (t == wchar_decl_node)
696 if (pedantic && ! DECL_IN_SYSTEM_HEADER (x))
697 pedwarn ("redeclaration of %<wchar_t%> as %qT",
700 /* Throw away the redeclaration. */
701 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
705 tree olddecl = duplicate_decls (x, t, is_friend);
707 /* If the redeclaration failed, we can stop at this
709 if (olddecl == error_mark_node)
710 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
714 if (TREE_CODE (t) == TYPE_DECL)
715 SET_IDENTIFIER_TYPE_VALUE (name, TREE_TYPE (t));
717 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
719 else if (DECL_MAIN_P (x) && TREE_CODE (t) == FUNCTION_DECL)
721 /* A redeclaration of main, but not a duplicate of the
726 This function shall not be overloaded. */
727 error ("invalid redeclaration of %q+D", t);
729 /* We don't try to push this declaration since that
731 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, x);
736 check_template_shadow (x);
738 /* If this is a function conjured up by the backend, massage it
739 so it looks friendly. */
740 if (DECL_NON_THUNK_FUNCTION_P (x) && ! DECL_LANG_SPECIFIC (x))
742 retrofit_lang_decl (x);
743 SET_DECL_LANGUAGE (x, lang_c);
746 if (DECL_NON_THUNK_FUNCTION_P (x) && ! DECL_FUNCTION_MEMBER_P (x))
748 t = push_overloaded_decl (x, PUSH_LOCAL, is_friend);
750 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
751 if (!namespace_bindings_p ())
752 /* We do not need to create a binding for this name;
753 push_overloaded_decl will have already done so if
755 need_new_binding = 0;
757 else if (DECL_FUNCTION_TEMPLATE_P (x) && DECL_NAMESPACE_SCOPE_P (x))
759 t = push_overloaded_decl (x, PUSH_GLOBAL, is_friend);
761 add_decl_to_level (x, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t)));
762 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
765 /* If declaring a type as a typedef, copy the type (unless we're
766 at line 0), and install this TYPE_DECL as the new type's typedef
767 name. See the extensive comment in ../c-decl.c (pushdecl). */
768 if (TREE_CODE (x) == TYPE_DECL)
770 tree type = TREE_TYPE (x);
771 if (DECL_IS_BUILTIN (x))
773 if (TYPE_NAME (type) == 0)
774 TYPE_NAME (type) = x;
776 else if (type != error_mark_node && TYPE_NAME (type) != x
777 /* We don't want to copy the type when all we're
778 doing is making a TYPE_DECL for the purposes of
780 && (!TYPE_NAME (type)
781 || TYPE_NAME (type) != DECL_ABSTRACT_ORIGIN (x)))
783 DECL_ORIGINAL_TYPE (x) = type;
784 type = build_variant_type_copy (type);
785 TYPE_STUB_DECL (type) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x));
786 TYPE_NAME (type) = x;
787 TREE_TYPE (x) = type;
790 if (type != error_mark_node
792 && TYPE_IDENTIFIER (type))
793 set_identifier_type_value (DECL_NAME (x), x);
796 /* Multiple external decls of the same identifier ought to match.
798 We get warnings about inline functions where they are defined.
799 We get warnings about other functions from push_overloaded_decl.
801 Avoid duplicate warnings where they are used. */
802 if (TREE_PUBLIC (x) && TREE_CODE (x) != FUNCTION_DECL)
806 decl = IDENTIFIER_NAMESPACE_VALUE (name);
807 if (decl && TREE_CODE (decl) == OVERLOAD)
808 decl = OVL_FUNCTION (decl);
810 if (decl && decl != error_mark_node
811 && (DECL_EXTERNAL (decl) || TREE_PUBLIC (decl))
812 /* If different sort of thing, we already gave an error. */
813 && TREE_CODE (decl) == TREE_CODE (x)
814 && !same_type_p (TREE_TYPE (x), TREE_TYPE (decl)))
816 pedwarn ("type mismatch with previous external decl of %q#D", x);
817 pedwarn ("previous external decl of %q+#D", decl);
821 if (TREE_CODE (x) == FUNCTION_DECL
823 && !flag_friend_injection)
825 /* This is a new declaration of a friend function, so hide
826 it from ordinary function lookup. */
827 DECL_ANTICIPATED (x) = 1;
828 DECL_HIDDEN_FRIEND_P (x) = 1;
831 /* This name is new in its binding level.
832 Install the new declaration and return it. */
833 if (namespace_bindings_p ())
835 /* Install a global value. */
837 /* If the first global decl has external linkage,
838 warn if we later see static one. */
839 if (IDENTIFIER_GLOBAL_VALUE (name) == NULL_TREE && TREE_PUBLIC (x))
840 TREE_PUBLIC (name) = 1;
842 /* Bind the name for the entity. */
843 if (!(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)
845 && (TREE_CODE (x) == TYPE_DECL
846 || TREE_CODE (x) == VAR_DECL
847 || TREE_CODE (x) == NAMESPACE_DECL
848 || TREE_CODE (x) == CONST_DECL
849 || TREE_CODE (x) == TEMPLATE_DECL))
850 SET_IDENTIFIER_NAMESPACE_VALUE (name, x);
852 /* If new decl is `static' and an `extern' was seen previously,
854 if (x != NULL_TREE && t != NULL_TREE && decls_match (x, t))
855 warn_extern_redeclared_static (x, t);
859 /* Here to install a non-global value. */
860 tree oldlocal = innermost_non_namespace_value (name);
861 tree oldglobal = IDENTIFIER_NAMESPACE_VALUE (name);
863 if (need_new_binding)
865 push_local_binding (name, x, 0);
866 /* Because push_local_binding will hook X on to the
867 current_binding_level's name list, we don't want to
868 do that again below. */
869 need_new_binding = 0;
872 /* If this is a TYPE_DECL, push it into the type value slot. */
873 if (TREE_CODE (x) == TYPE_DECL)
874 set_identifier_type_value (name, x);
876 /* Clear out any TYPE_DECL shadowed by a namespace so that
877 we won't think this is a type. The C struct hack doesn't
878 go through namespaces. */
879 if (TREE_CODE (x) == NAMESPACE_DECL)
880 set_identifier_type_value (name, NULL_TREE);
887 && TREE_CODE (oldlocal) == VAR_DECL
888 && DECL_DEAD_FOR_LOCAL (oldlocal))
889 oldlocal = DECL_SHADOWED_FOR_VAR (oldlocal);
891 if (oldlocal == NULL_TREE)
892 oldlocal = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d));
895 /* If this is an extern function declaration, see if we
896 have a global definition or declaration for the function. */
897 if (oldlocal == NULL_TREE
899 && oldglobal != NULL_TREE
900 && TREE_CODE (x) == FUNCTION_DECL
901 && TREE_CODE (oldglobal) == FUNCTION_DECL)
903 /* We have one. Their types must agree. */
904 if (decls_match (x, oldglobal))
908 warning (0, "extern declaration of %q#D doesn't match", x);
909 warning (0, "global declaration %q+#D", oldglobal);
912 /* If we have a local external declaration,
913 and no file-scope declaration has yet been seen,
914 then if we later have a file-scope decl it must not be static. */
915 if (oldlocal == NULL_TREE
916 && oldglobal == NULL_TREE
919 TREE_PUBLIC (name) = 1;
921 /* Warn if shadowing an argument at the top level of the body. */
922 if (oldlocal != NULL_TREE && !DECL_EXTERNAL (x)
923 /* Inline decls shadow nothing. */
924 && !DECL_FROM_INLINE (x)
925 && TREE_CODE (oldlocal) == PARM_DECL
926 /* Don't check the `this' parameter. */
927 && !DECL_ARTIFICIAL (oldlocal))
931 /* Don't complain if it's from an enclosing function. */
932 if (DECL_CONTEXT (oldlocal) == current_function_decl
933 && TREE_CODE (x) != PARM_DECL)
935 /* Go to where the parms should be and see if we find
937 struct cp_binding_level *b = current_binding_level->level_chain;
939 if (FUNCTION_NEEDS_BODY_BLOCK (current_function_decl))
940 /* Skip the ctor/dtor cleanup level. */
944 if (b->kind == sk_function_parms)
946 error ("declaration of %q#D shadows a parameter", x);
951 if (warn_shadow && !err)
953 warning (OPT_Wshadow, "declaration of %q#D shadows a parameter", x);
954 warning (OPT_Wshadow, "%Jshadowed declaration is here", oldlocal);
958 /* Maybe warn if shadowing something else. */
959 else if (warn_shadow && !DECL_EXTERNAL (x)
960 /* No shadow warnings for internally generated vars. */
961 && ! DECL_ARTIFICIAL (x)
962 /* No shadow warnings for vars made for inlining. */
963 && ! DECL_FROM_INLINE (x))
967 if (current_class_ptr)
968 member = lookup_member (current_class_type,
971 /*want_type=*/false);
975 if (member && !TREE_STATIC (member))
977 /* Location of previous decl is not useful in this case. */
978 warning (OPT_Wshadow, "declaration of %qD shadows a member of 'this'",
981 else if (oldlocal != NULL_TREE
982 && TREE_CODE (oldlocal) == VAR_DECL)
984 warning (OPT_Wshadow, "declaration of %qD shadows a previous local", x);
985 warning (OPT_Wshadow, "%Jshadowed declaration is here", oldlocal);
987 else if (oldglobal != NULL_TREE
988 && TREE_CODE (oldglobal) == VAR_DECL)
989 /* XXX shadow warnings in outer-more namespaces */
991 warning (OPT_Wshadow, "declaration of %qD shadows a global declaration",
993 warning (OPT_Wshadow, "%Jshadowed declaration is here", oldglobal);
998 if (TREE_CODE (x) == VAR_DECL)
999 maybe_register_incomplete_var (x);
1002 if (need_new_binding)
1003 add_decl_to_level (x,
1004 DECL_NAMESPACE_SCOPE_P (x)
1005 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x))
1006 : current_binding_level);
1008 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, x);
1011 /* Record a decl-node X as belonging to the current lexical scope. */
1016 return pushdecl_maybe_friend (x, false);
1019 /* Enter DECL into the symbol table, if that's appropriate. Returns
1020 DECL, or a modified version thereof. */
1023 maybe_push_decl (tree decl)
1025 tree type = TREE_TYPE (decl);
1027 /* Add this decl to the current binding level, but not if it comes
1028 from another scope, e.g. a static member variable. TEM may equal
1029 DECL or it may be a previous decl of the same name. */
1030 if (decl == error_mark_node
1031 || (TREE_CODE (decl) != PARM_DECL
1032 && DECL_CONTEXT (decl) != NULL_TREE
1033 /* Definitions of namespace members outside their namespace are
1035 && TREE_CODE (DECL_CONTEXT (decl)) != NAMESPACE_DECL)
1036 || (TREE_CODE (decl) == TEMPLATE_DECL && !namespace_bindings_p ())
1037 || TREE_CODE (type) == UNKNOWN_TYPE
1038 /* The declaration of a template specialization does not affect
1039 the functions available for overload resolution, so we do not
1041 || (TREE_CODE (decl) == FUNCTION_DECL
1042 && DECL_TEMPLATE_SPECIALIZATION (decl)))
1045 return pushdecl (decl);
1048 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1049 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1050 doesn't really belong to this binding level, that it got here
1051 through a using-declaration. */
1054 push_local_binding (tree id, tree decl, int flags)
1056 struct cp_binding_level *b;
1058 /* Skip over any local classes. This makes sense if we call
1059 push_local_binding with a friend decl of a local class. */
1060 b = innermost_nonclass_level ();
1062 if (lookup_name_innermost_nonclass_level (id))
1064 /* Supplement the existing binding. */
1065 if (!supplement_binding (IDENTIFIER_BINDING (id), decl))
1066 /* It didn't work. Something else must be bound at this
1067 level. Do not add DECL to the list of things to pop
1072 /* Create a new binding. */
1073 push_binding (id, decl, b);
1075 if (TREE_CODE (decl) == OVERLOAD || (flags & PUSH_USING))
1076 /* We must put the OVERLOAD into a TREE_LIST since the
1077 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1078 decls that got here through a using-declaration. */
1079 decl = build_tree_list (NULL_TREE, decl);
1081 /* And put DECL on the list of things declared by the current
1083 add_decl_to_level (decl, b);
1086 /* Check to see whether or not DECL is a variable that would have been
1087 in scope under the ARM, but is not in scope under the ANSI/ISO
1088 standard. If so, issue an error message. If name lookup would
1089 work in both cases, but return a different result, this function
1090 returns the result of ANSI/ISO lookup. Otherwise, it returns
1094 check_for_out_of_scope_variable (tree decl)
1098 /* We only care about out of scope variables. */
1099 if (!(TREE_CODE (decl) == VAR_DECL && DECL_DEAD_FOR_LOCAL (decl)))
1102 shadowed = DECL_HAS_SHADOWED_FOR_VAR_P (decl)
1103 ? DECL_SHADOWED_FOR_VAR (decl) : NULL_TREE ;
1104 while (shadowed != NULL_TREE && TREE_CODE (shadowed) == VAR_DECL
1105 && DECL_DEAD_FOR_LOCAL (shadowed))
1106 shadowed = DECL_HAS_SHADOWED_FOR_VAR_P (shadowed)
1107 ? DECL_SHADOWED_FOR_VAR (shadowed) : NULL_TREE;
1109 shadowed = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (decl));
1112 if (!DECL_ERROR_REPORTED (decl))
1114 warning (0, "name lookup of %qD changed", DECL_NAME (decl));
1115 warning (0, " matches this %q+D under ISO standard rules",
1117 warning (0, " matches this %q+D under old rules", decl);
1118 DECL_ERROR_REPORTED (decl) = 1;
1123 /* If we have already complained about this declaration, there's no
1124 need to do it again. */
1125 if (DECL_ERROR_REPORTED (decl))
1128 DECL_ERROR_REPORTED (decl) = 1;
1130 if (TREE_TYPE (decl) == error_mark_node)
1133 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
1135 error ("name lookup of %qD changed for new ISO %<for%> scoping",
1137 error (" cannot use obsolete binding at %q+D because "
1138 "it has a destructor", decl);
1139 return error_mark_node;
1143 pedwarn ("name lookup of %qD changed for new ISO %<for%> scoping",
1145 pedwarn (" using obsolete binding at %q+D", decl);
1151 /* true means unconditionally make a BLOCK for the next level pushed. */
1153 static bool keep_next_level_flag;
1155 static int binding_depth = 0;
1156 static int is_class_level = 0;
1163 for (i = 0; i < depth * 2; i++)
1167 /* Return a string describing the kind of SCOPE we have. */
1169 cxx_scope_descriptor (cxx_scope *scope)
1171 /* The order of this table must match the "scope_kind"
1173 static const char* scope_kind_names[] = {
1179 "function-parameter-scope",
1182 "template-parameter-scope",
1183 "template-explicit-spec-scope"
1185 const scope_kind kind = scope->explicit_spec_p
1186 ? sk_template_spec : scope->kind;
1188 return scope_kind_names[kind];
1191 /* Output a debugging information about SCOPE when performing
1194 cxx_scope_debug (cxx_scope *scope, int line, const char *action)
1196 const char *desc = cxx_scope_descriptor (scope);
1197 if (scope->this_entity)
1198 verbatim ("%s %s(%E) %p %d\n", action, desc,
1199 scope->this_entity, (void *) scope, line);
1201 verbatim ("%s %s %p %d\n", action, desc, (void *) scope, line);
1204 /* Return the estimated initial size of the hashtable of a NAMESPACE
1207 static inline size_t
1208 namespace_scope_ht_size (tree ns)
1210 tree name = DECL_NAME (ns);
1212 return name == std_identifier
1213 ? NAMESPACE_STD_HT_SIZE
1214 : (name == global_scope_name
1215 ? GLOBAL_SCOPE_HT_SIZE
1216 : NAMESPACE_ORDINARY_HT_SIZE);
1219 /* A chain of binding_level structures awaiting reuse. */
1221 static GTY((deletable)) struct cp_binding_level *free_binding_level;
1223 /* Insert SCOPE as the innermost binding level. */
1226 push_binding_level (struct cp_binding_level *scope)
1228 /* Add it to the front of currently active scopes stack. */
1229 scope->level_chain = current_binding_level;
1230 current_binding_level = scope;
1231 keep_next_level_flag = false;
1233 if (ENABLE_SCOPE_CHECKING)
1235 scope->binding_depth = binding_depth;
1236 indent (binding_depth);
1237 cxx_scope_debug (scope, input_line, "push");
1243 /* Create a new KIND scope and make it the top of the active scopes stack.
1244 ENTITY is the scope of the associated C++ entity (namespace, class,
1245 function); it is NULL otherwise. */
1248 begin_scope (scope_kind kind, tree entity)
1252 /* Reuse or create a struct for this binding level. */
1253 if (!ENABLE_SCOPE_CHECKING && free_binding_level)
1255 scope = free_binding_level;
1256 free_binding_level = scope->level_chain;
1259 scope = GGC_NEW (cxx_scope);
1260 memset (scope, 0, sizeof (cxx_scope));
1262 scope->this_entity = entity;
1263 scope->more_cleanups_ok = true;
1270 case sk_template_spec:
1271 scope->explicit_spec_p = true;
1272 kind = sk_template_parms;
1274 case sk_template_parms:
1280 case sk_function_parms:
1281 scope->keep = keep_next_level_flag;
1285 NAMESPACE_LEVEL (entity) = scope;
1286 scope->static_decls =
1287 VEC_alloc (tree, gc,
1288 DECL_NAME (entity) == std_identifier
1289 || DECL_NAME (entity) == global_scope_name
1294 /* Should not happen. */
1300 push_binding_level (scope);
1305 /* We're about to leave current scope. Pop the top of the stack of
1306 currently active scopes. Return the enclosing scope, now active. */
1311 cxx_scope *scope = current_binding_level;
1313 if (scope->kind == sk_namespace && class_binding_level)
1314 current_binding_level = class_binding_level;
1316 /* We cannot leave a scope, if there are none left. */
1317 if (NAMESPACE_LEVEL (global_namespace))
1318 gcc_assert (!global_scope_p (scope));
1320 if (ENABLE_SCOPE_CHECKING)
1322 indent (--binding_depth);
1323 cxx_scope_debug (scope, input_line, "leave");
1324 if (is_class_level != (scope == class_binding_level))
1326 indent (binding_depth);
1327 verbatim ("XXX is_class_level != (current_scope == class_scope)\n");
1332 /* Move one nesting level up. */
1333 current_binding_level = scope->level_chain;
1335 /* Namespace-scopes are left most probably temporarily, not
1336 completely; they can be reopen later, e.g. in namespace-extension
1337 or any name binding activity that requires us to resume a
1338 namespace. For classes, we cache some binding levels. For other
1339 scopes, we just make the structure available for reuse. */
1340 if (scope->kind != sk_namespace
1341 && scope->kind != sk_class)
1343 scope->level_chain = free_binding_level;
1344 gcc_assert (!ENABLE_SCOPE_CHECKING
1345 || scope->binding_depth == binding_depth);
1346 free_binding_level = scope;
1349 /* Find the innermost enclosing class scope, and reset
1350 CLASS_BINDING_LEVEL appropriately. */
1351 if (scope->kind == sk_class)
1353 class_binding_level = NULL;
1354 for (scope = current_binding_level; scope; scope = scope->level_chain)
1355 if (scope->kind == sk_class)
1357 class_binding_level = scope;
1362 return current_binding_level;
1366 resume_scope (struct cp_binding_level* b)
1368 /* Resuming binding levels is meant only for namespaces,
1369 and those cannot nest into classes. */
1370 gcc_assert (!class_binding_level);
1371 /* Also, resuming a non-directly nested namespace is a no-no. */
1372 gcc_assert (b->level_chain == current_binding_level);
1373 current_binding_level = b;
1374 if (ENABLE_SCOPE_CHECKING)
1376 b->binding_depth = binding_depth;
1377 indent (binding_depth);
1378 cxx_scope_debug (b, input_line, "resume");
1384 /* Return the innermost binding level that is not for a class scope. */
1387 innermost_nonclass_level (void)
1391 b = current_binding_level;
1392 while (b->kind == sk_class)
1398 /* We're defining an object of type TYPE. If it needs a cleanup, but
1399 we're not allowed to add any more objects with cleanups to the current
1400 scope, create a new binding level. */
1403 maybe_push_cleanup_level (tree type)
1405 if (type != error_mark_node
1406 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
1407 && current_binding_level->more_cleanups_ok == 0)
1409 begin_scope (sk_cleanup, NULL);
1410 current_binding_level->statement_list = push_stmt_list ();
1414 /* Nonzero if we are currently in the global binding level. */
1417 global_bindings_p (void)
1419 return global_scope_p (current_binding_level);
1422 /* True if we are currently in a toplevel binding level. This
1423 means either the global binding level or a namespace in a toplevel
1424 binding level. Since there are no non-toplevel namespace levels,
1425 this really means any namespace or template parameter level. We
1426 also include a class whose context is toplevel. */
1429 toplevel_bindings_p (void)
1431 struct cp_binding_level *b = innermost_nonclass_level ();
1433 return b->kind == sk_namespace || b->kind == sk_template_parms;
1436 /* True if this is a namespace scope, or if we are defining a class
1437 which is itself at namespace scope, or whose enclosing class is
1438 such a class, etc. */
1441 namespace_bindings_p (void)
1443 struct cp_binding_level *b = innermost_nonclass_level ();
1445 return b->kind == sk_namespace;
1448 /* True if the current level needs to have a BLOCK made. */
1453 return (current_binding_level->blocks != NULL_TREE
1454 || current_binding_level->keep
1455 || current_binding_level->kind == sk_cleanup
1456 || current_binding_level->names != NULL_TREE);
1459 /* Returns the kind of the innermost scope. */
1462 innermost_scope_kind (void)
1464 return current_binding_level->kind;
1467 /* Returns true if this scope was created to store template parameters. */
1470 template_parm_scope_p (void)
1472 return innermost_scope_kind () == sk_template_parms;
1475 /* If KEEP is true, make a BLOCK node for the next binding level,
1476 unconditionally. Otherwise, use the normal logic to decide whether
1477 or not to create a BLOCK. */
1480 keep_next_level (bool keep)
1482 keep_next_level_flag = keep;
1485 /* Return the list of declarations of the current level.
1486 Note that this list is in reverse order unless/until
1487 you nreverse it; and when you do nreverse it, you must
1488 store the result back using `storedecls' or you will lose. */
1493 return current_binding_level->names;
1496 /* For debugging. */
1497 static int no_print_functions = 0;
1498 static int no_print_builtins = 0;
1501 print_binding_level (struct cp_binding_level* lvl)
1505 fprintf (stderr, " blocks=%p", (void *) lvl->blocks);
1506 if (lvl->more_cleanups_ok)
1507 fprintf (stderr, " more-cleanups-ok");
1508 if (lvl->have_cleanups)
1509 fprintf (stderr, " have-cleanups");
1510 fprintf (stderr, "\n");
1513 fprintf (stderr, " names:\t");
1514 /* We can probably fit 3 names to a line? */
1515 for (t = lvl->names; t; t = TREE_CHAIN (t))
1517 if (no_print_functions && (TREE_CODE (t) == FUNCTION_DECL))
1519 if (no_print_builtins
1520 && (TREE_CODE (t) == TYPE_DECL)
1521 && DECL_IS_BUILTIN (t))
1524 /* Function decls tend to have longer names. */
1525 if (TREE_CODE (t) == FUNCTION_DECL)
1532 fprintf (stderr, "\n\t");
1535 print_node_brief (stderr, "", t, 0);
1536 if (t == error_mark_node)
1540 fprintf (stderr, "\n");
1542 if (VEC_length (cp_class_binding, lvl->class_shadowed))
1545 cp_class_binding *b;
1546 fprintf (stderr, " class-shadowed:");
1548 VEC_iterate(cp_class_binding, lvl->class_shadowed, i, b);
1550 fprintf (stderr, " %s ", IDENTIFIER_POINTER (b->identifier));
1551 fprintf (stderr, "\n");
1553 if (lvl->type_shadowed)
1555 fprintf (stderr, " type-shadowed:");
1556 for (t = lvl->type_shadowed; t; t = TREE_CHAIN (t))
1558 fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t)));
1560 fprintf (stderr, "\n");
1565 print_other_binding_stack (struct cp_binding_level *stack)
1567 struct cp_binding_level *level;
1568 for (level = stack; !global_scope_p (level); level = level->level_chain)
1570 fprintf (stderr, "binding level %p\n", (void *) level);
1571 print_binding_level (level);
1576 print_binding_stack (void)
1578 struct cp_binding_level *b;
1579 fprintf (stderr, "current_binding_level=%p\n"
1580 "class_binding_level=%p\n"
1581 "NAMESPACE_LEVEL (global_namespace)=%p\n",
1582 (void *) current_binding_level, (void *) class_binding_level,
1583 (void *) NAMESPACE_LEVEL (global_namespace));
1584 if (class_binding_level)
1586 for (b = class_binding_level; b; b = b->level_chain)
1587 if (b == current_binding_level)
1590 b = class_binding_level;
1592 b = current_binding_level;
1595 b = current_binding_level;
1596 print_other_binding_stack (b);
1597 fprintf (stderr, "global:\n");
1598 print_binding_level (NAMESPACE_LEVEL (global_namespace));
1601 /* Return the type associated with id. */
1604 identifier_type_value (tree id)
1606 timevar_push (TV_NAME_LOOKUP);
1607 /* There is no type with that name, anywhere. */
1608 if (REAL_IDENTIFIER_TYPE_VALUE (id) == NULL_TREE)
1609 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
1610 /* This is not the type marker, but the real thing. */
1611 if (REAL_IDENTIFIER_TYPE_VALUE (id) != global_type_node)
1612 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, REAL_IDENTIFIER_TYPE_VALUE (id));
1613 /* Have to search for it. It must be on the global level, now.
1614 Ask lookup_name not to return non-types. */
1615 id = lookup_name_real (id, 2, 1, /*block_p=*/true, 0, LOOKUP_COMPLAIN);
1617 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, TREE_TYPE (id));
1618 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
1621 /* Return the IDENTIFIER_GLOBAL_VALUE of T, for use in common code, since
1622 the definition of IDENTIFIER_GLOBAL_VALUE is different for C and C++. */
1625 identifier_global_value (tree t)
1627 return IDENTIFIER_GLOBAL_VALUE (t);
1630 /* Push a definition of struct, union or enum tag named ID. into
1631 binding_level B. DECL is a TYPE_DECL for the type. We assume that
1632 the tag ID is not already defined. */
1635 set_identifier_type_value_with_scope (tree id, tree decl, cxx_scope *b)
1639 if (b->kind != sk_namespace)
1641 /* Shadow the marker, not the real thing, so that the marker
1642 gets restored later. */
1643 tree old_type_value = REAL_IDENTIFIER_TYPE_VALUE (id);
1645 = tree_cons (id, old_type_value, b->type_shadowed);
1646 type = decl ? TREE_TYPE (decl) : NULL_TREE;
1647 TREE_TYPE (b->type_shadowed) = type;
1651 cxx_binding *binding =
1652 binding_for_name (NAMESPACE_LEVEL (current_namespace), id);
1655 supplement_binding (binding, decl);
1657 binding->value = decl;
1659 /* Store marker instead of real type. */
1660 type = global_type_node;
1662 SET_IDENTIFIER_TYPE_VALUE (id, type);
1665 /* As set_identifier_type_value_with_scope, but using
1666 current_binding_level. */
1669 set_identifier_type_value (tree id, tree decl)
1671 set_identifier_type_value_with_scope (id, decl, current_binding_level);
1674 /* Return the name for the constructor (or destructor) for the
1675 specified class TYPE. When given a template, this routine doesn't
1676 lose the specialization. */
1679 constructor_name_full (tree type)
1681 return TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type));
1684 /* Return the name for the constructor (or destructor) for the
1685 specified class. When given a template, return the plain
1686 unspecialized name. */
1689 constructor_name (tree type)
1692 name = constructor_name_full (type);
1693 if (IDENTIFIER_TEMPLATE (name))
1694 name = IDENTIFIER_TEMPLATE (name);
1698 /* Returns TRUE if NAME is the name for the constructor for TYPE. */
1701 constructor_name_p (tree name, tree type)
1708 if (TREE_CODE (name) != IDENTIFIER_NODE)
1711 ctor_name = constructor_name_full (type);
1712 if (name == ctor_name)
1714 if (IDENTIFIER_TEMPLATE (ctor_name)
1715 && name == IDENTIFIER_TEMPLATE (ctor_name))
1720 /* Counter used to create anonymous type names. */
1722 static GTY(()) int anon_cnt;
1724 /* Return an IDENTIFIER which can be used as a name for
1725 anonymous structs and unions. */
1728 make_anon_name (void)
1732 sprintf (buf, ANON_AGGRNAME_FORMAT, anon_cnt++);
1733 return get_identifier (buf);
1736 /* Return (from the stack of) the BINDING, if any, established at SCOPE. */
1738 static inline cxx_binding *
1739 find_binding (cxx_scope *scope, cxx_binding *binding)
1741 timevar_push (TV_NAME_LOOKUP);
1743 for (; binding != NULL; binding = binding->previous)
1744 if (binding->scope == scope)
1745 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, binding);
1747 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, (cxx_binding *)0);
1750 /* Return the binding for NAME in SCOPE, if any. Otherwise, return NULL. */
1752 static inline cxx_binding *
1753 cxx_scope_find_binding_for_name (cxx_scope *scope, tree name)
1755 cxx_binding *b = IDENTIFIER_NAMESPACE_BINDINGS (name);
1758 /* Fold-in case where NAME is used only once. */
1759 if (scope == b->scope && b->previous == NULL)
1761 return find_binding (scope, b);
1766 /* Always returns a binding for name in scope. If no binding is
1767 found, make a new one. */
1769 static cxx_binding *
1770 binding_for_name (cxx_scope *scope, tree name)
1772 cxx_binding *result;
1774 result = cxx_scope_find_binding_for_name (scope, name);
1777 /* Not found, make a new one. */
1778 result = cxx_binding_make (NULL, NULL);
1779 result->previous = IDENTIFIER_NAMESPACE_BINDINGS (name);
1780 result->scope = scope;
1781 result->is_local = false;
1782 result->value_is_inherited = false;
1783 IDENTIFIER_NAMESPACE_BINDINGS (name) = result;
1787 /* Insert another USING_DECL into the current binding level, returning
1788 this declaration. If this is a redeclaration, do nothing, and
1789 return NULL_TREE if this not in namespace scope (in namespace
1790 scope, a using decl might extend any previous bindings). */
1793 push_using_decl (tree scope, tree name)
1797 timevar_push (TV_NAME_LOOKUP);
1798 gcc_assert (TREE_CODE (scope) == NAMESPACE_DECL);
1799 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
1800 for (decl = current_binding_level->usings; decl; decl = TREE_CHAIN (decl))
1801 if (USING_DECL_SCOPE (decl) == scope && DECL_NAME (decl) == name)
1804 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP,
1805 namespace_bindings_p () ? decl : NULL_TREE);
1806 decl = build_lang_decl (USING_DECL, name, NULL_TREE);
1807 USING_DECL_SCOPE (decl) = scope;
1808 TREE_CHAIN (decl) = current_binding_level->usings;
1809 current_binding_level->usings = decl;
1810 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl);
1813 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
1814 caller to set DECL_CONTEXT properly. */
1817 pushdecl_with_scope (tree x, cxx_scope *level, bool is_friend)
1819 struct cp_binding_level *b;
1820 tree function_decl = current_function_decl;
1822 timevar_push (TV_NAME_LOOKUP);
1823 current_function_decl = NULL_TREE;
1824 if (level->kind == sk_class)
1826 b = class_binding_level;
1827 class_binding_level = level;
1828 pushdecl_class_level (x);
1829 class_binding_level = b;
1833 b = current_binding_level;
1834 current_binding_level = level;
1835 x = pushdecl_maybe_friend (x, is_friend);
1836 current_binding_level = b;
1838 current_function_decl = function_decl;
1839 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, x);
1842 /* DECL is a FUNCTION_DECL for a non-member function, which may have
1843 other definitions already in place. We get around this by making
1844 the value of the identifier point to a list of all the things that
1845 want to be referenced by that name. It is then up to the users of
1846 that name to decide what to do with that list.
1848 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
1849 DECL_TEMPLATE_RESULT. It is dealt with the same way.
1851 FLAGS is a bitwise-or of the following values:
1852 PUSH_LOCAL: Bind DECL in the current scope, rather than at
1854 PUSH_USING: DECL is being pushed as the result of a using
1857 IS_FRIEND is true if this is a friend declaration.
1859 The value returned may be a previous declaration if we guessed wrong
1860 about what language DECL should belong to (C or C++). Otherwise,
1861 it's always DECL (and never something that's not a _DECL). */
1864 push_overloaded_decl (tree decl, int flags, bool is_friend)
1866 tree name = DECL_NAME (decl);
1869 int doing_global = (namespace_bindings_p () || !(flags & PUSH_LOCAL));
1871 timevar_push (TV_NAME_LOOKUP);
1873 old = namespace_binding (name, DECL_CONTEXT (decl));
1875 old = lookup_name_innermost_nonclass_level (name);
1879 if (TREE_CODE (old) == TYPE_DECL && DECL_ARTIFICIAL (old))
1881 tree t = TREE_TYPE (old);
1882 if (IS_AGGR_TYPE (t) && warn_shadow
1883 && (! DECL_IN_SYSTEM_HEADER (decl)
1884 || ! DECL_IN_SYSTEM_HEADER (old)))
1885 warning (0, "%q#D hides constructor for %q#T", decl, t);
1888 else if (is_overloaded_fn (old))
1892 for (tmp = old; tmp; tmp = OVL_NEXT (tmp))
1894 tree fn = OVL_CURRENT (tmp);
1897 if (TREE_CODE (tmp) == OVERLOAD && OVL_USED (tmp)
1898 && !(flags & PUSH_USING)
1899 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)),
1900 TYPE_ARG_TYPES (TREE_TYPE (decl)))
1901 && ! decls_match (fn, decl))
1902 error ("%q#D conflicts with previous using declaration %q#D",
1905 dup = duplicate_decls (decl, fn, is_friend);
1906 /* If DECL was a redeclaration of FN -- even an invalid
1907 one -- pass that information along to our caller. */
1908 if (dup == fn || dup == error_mark_node)
1909 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, dup);
1912 /* We don't overload implicit built-ins. duplicate_decls()
1913 may fail to merge the decls if the new decl is e.g. a
1914 template function. */
1915 if (TREE_CODE (old) == FUNCTION_DECL
1916 && DECL_ANTICIPATED (old)
1917 && !DECL_HIDDEN_FRIEND_P (old))
1920 else if (old == error_mark_node)
1921 /* Ignore the undefined symbol marker. */
1925 error ("previous non-function declaration %q+#D", old);
1926 error ("conflicts with function declaration %q#D", decl);
1927 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl);
1931 if (old || TREE_CODE (decl) == TEMPLATE_DECL
1932 /* If it's a using declaration, we always need to build an OVERLOAD,
1933 because it's the only way to remember that the declaration comes
1934 from 'using', and have the lookup behave correctly. */
1935 || (flags & PUSH_USING))
1937 if (old && TREE_CODE (old) != OVERLOAD)
1938 new_binding = ovl_cons (decl, ovl_cons (old, NULL_TREE));
1940 new_binding = ovl_cons (decl, old);
1941 if (flags & PUSH_USING)
1942 OVL_USED (new_binding) = 1;
1945 /* NAME is not ambiguous. */
1949 set_namespace_binding (name, current_namespace, new_binding);
1952 /* We only create an OVERLOAD if there was a previous binding at
1953 this level, or if decl is a template. In the former case, we
1954 need to remove the old binding and replace it with the new
1955 binding. We must also run through the NAMES on the binding
1956 level where the name was bound to update the chain. */
1958 if (TREE_CODE (new_binding) == OVERLOAD && old)
1962 for (d = &IDENTIFIER_BINDING (name)->scope->names;
1964 d = &TREE_CHAIN (*d))
1966 || (TREE_CODE (*d) == TREE_LIST
1967 && TREE_VALUE (*d) == old))
1969 if (TREE_CODE (*d) == TREE_LIST)
1970 /* Just replace the old binding with the new. */
1971 TREE_VALUE (*d) = new_binding;
1973 /* Build a TREE_LIST to wrap the OVERLOAD. */
1974 *d = tree_cons (NULL_TREE, new_binding,
1977 /* And update the cxx_binding node. */
1978 IDENTIFIER_BINDING (name)->value = new_binding;
1979 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl);
1982 /* We should always find a previous binding in this case. */
1986 /* Install the new binding. */
1987 push_local_binding (name, new_binding, flags);
1990 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl);
1993 /* Check a non-member using-declaration. Return the name and scope
1994 being used, and the USING_DECL, or NULL_TREE on failure. */
1997 validate_nonmember_using_decl (tree decl, tree scope, tree name)
1999 /* [namespace.udecl]
2000 A using-declaration for a class member shall be a
2001 member-declaration. */
2004 error ("%qT is not a namespace", scope);
2007 else if (scope == error_mark_node)
2010 if (TREE_CODE (decl) == TEMPLATE_ID_EXPR)
2013 A using-declaration shall not name a template-id. */
2014 error ("a using-declaration cannot specify a template-id. "
2015 "Try %<using %D%>", name);
2019 if (TREE_CODE (decl) == NAMESPACE_DECL)
2021 error ("namespace %qD not allowed in using-declaration", decl);
2025 if (TREE_CODE (decl) == SCOPE_REF)
2027 /* It's a nested name with template parameter dependent scope.
2028 This can only be using-declaration for class member. */
2029 error ("%qT is not a namespace", TREE_OPERAND (decl, 0));
2033 if (is_overloaded_fn (decl))
2034 decl = get_first_fn (decl);
2036 gcc_assert (DECL_P (decl));
2038 /* Make a USING_DECL. */
2039 return push_using_decl (scope, name);
2042 /* Process local and global using-declarations. */
2045 do_nonmember_using_decl (tree scope, tree name, tree oldval, tree oldtype,
2046 tree *newval, tree *newtype)
2048 struct scope_binding decls = EMPTY_SCOPE_BINDING;
2050 *newval = *newtype = NULL_TREE;
2051 if (!qualified_lookup_using_namespace (name, scope, &decls, 0))
2055 if (!decls.value && !decls.type)
2057 error ("%qD not declared", name);
2061 /* It is impossible to overload a built-in function; any explicit
2062 declaration eliminates the built-in declaration. So, if OLDVAL
2063 is a built-in, then we can just pretend it isn't there. */
2065 && TREE_CODE (oldval) == FUNCTION_DECL
2066 && DECL_ANTICIPATED (oldval)
2067 && !DECL_HIDDEN_FRIEND_P (oldval))
2070 /* Check for using functions. */
2071 if (decls.value && is_overloaded_fn (decls.value))
2075 if (oldval && !is_overloaded_fn (oldval))
2077 if (!DECL_IMPLICIT_TYPEDEF_P (oldval))
2078 error ("%qD is already declared in this scope", name);
2083 for (tmp = decls.value; tmp; tmp = OVL_NEXT (tmp))
2085 tree new_fn = OVL_CURRENT (tmp);
2087 /* [namespace.udecl]
2089 If a function declaration in namespace scope or block
2090 scope has the same name and the same parameter types as a
2091 function introduced by a using declaration the program is
2093 for (tmp1 = oldval; tmp1; tmp1 = OVL_NEXT (tmp1))
2095 tree old_fn = OVL_CURRENT (tmp1);
2097 if (new_fn == old_fn)
2098 /* The function already exists in the current namespace. */
2100 else if (OVL_USED (tmp1))
2101 continue; /* this is a using decl */
2102 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (new_fn)),
2103 TYPE_ARG_TYPES (TREE_TYPE (old_fn))))
2105 gcc_assert (!DECL_ANTICIPATED (old_fn)
2106 || DECL_HIDDEN_FRIEND_P (old_fn));
2108 /* There was already a non-using declaration in
2109 this scope with the same parameter types. If both
2110 are the same extern "C" functions, that's ok. */
2111 if (decls_match (new_fn, old_fn))
2115 error ("%qD is already declared in this scope", name);
2121 /* If we broke out of the loop, there's no reason to add
2122 this function to the using declarations for this
2127 /* If we are adding to an existing OVERLOAD, then we no
2128 longer know the type of the set of functions. */
2129 if (*newval && TREE_CODE (*newval) == OVERLOAD)
2130 TREE_TYPE (*newval) = unknown_type_node;
2131 /* Add this new function to the set. */
2132 *newval = build_overload (OVL_CURRENT (tmp), *newval);
2133 /* If there is only one function, then we use its type. (A
2134 using-declaration naming a single function can be used in
2135 contexts where overload resolution cannot be
2137 if (TREE_CODE (*newval) != OVERLOAD)
2139 *newval = ovl_cons (*newval, NULL_TREE);
2140 TREE_TYPE (*newval) = TREE_TYPE (OVL_CURRENT (tmp));
2142 OVL_USED (*newval) = 1;
2147 *newval = decls.value;
2148 if (oldval && !decls_match (*newval, oldval))
2149 error ("%qD is already declared in this scope", name);
2152 *newtype = decls.type;
2153 if (oldtype && *newtype && !same_type_p (oldtype, *newtype))
2155 error ("using declaration %qD introduced ambiguous type %qT",
2161 /* Process a using-declaration at function scope. */
2164 do_local_using_decl (tree decl, tree scope, tree name)
2166 tree oldval, oldtype, newval, newtype;
2167 tree orig_decl = decl;
2169 decl = validate_nonmember_using_decl (decl, scope, name);
2170 if (decl == NULL_TREE)
2173 if (building_stmt_tree ()
2174 && at_function_scope_p ())
2175 add_decl_expr (decl);
2177 oldval = lookup_name_innermost_nonclass_level (name);
2178 oldtype = lookup_type_current_level (name);
2180 do_nonmember_using_decl (scope, name, oldval, oldtype, &newval, &newtype);
2184 if (is_overloaded_fn (newval))
2188 /* We only need to push declarations for those functions
2189 that were not already bound in the current level.
2190 The old value might be NULL_TREE, it might be a single
2191 function, or an OVERLOAD. */
2192 if (oldval && TREE_CODE (oldval) == OVERLOAD)
2193 term = OVL_FUNCTION (oldval);
2196 for (fn = newval; fn && OVL_CURRENT (fn) != term;
2198 push_overloaded_decl (OVL_CURRENT (fn),
2199 PUSH_LOCAL | PUSH_USING,
2203 push_local_binding (name, newval, PUSH_USING);
2207 push_local_binding (name, newtype, PUSH_USING);
2208 set_identifier_type_value (name, newtype);
2211 /* Emit debug info. */
2212 if (!processing_template_decl)
2213 cp_emit_debug_info_for_using (orig_decl, current_scope());
2216 /* Returns true if ROOT (a namespace, class, or function) encloses
2217 CHILD. CHILD may be either a class type or a namespace. */
2220 is_ancestor (tree root, tree child)
2222 gcc_assert ((TREE_CODE (root) == NAMESPACE_DECL
2223 || TREE_CODE (root) == FUNCTION_DECL
2224 || CLASS_TYPE_P (root)));
2225 gcc_assert ((TREE_CODE (child) == NAMESPACE_DECL
2226 || CLASS_TYPE_P (child)));
2228 /* The global namespace encloses everything. */
2229 if (root == global_namespace)
2234 /* If we've run out of scopes, stop. */
2237 /* If we've reached the ROOT, it encloses CHILD. */
2240 /* Go out one level. */
2242 child = TYPE_NAME (child);
2243 child = DECL_CONTEXT (child);
2247 /* Enter the class or namespace scope indicated by T suitable for name
2248 lookup. T can be arbitrary scope, not necessary nested inside the
2249 current scope. Returns a non-null scope to pop iff pop_scope
2250 should be called later to exit this scope. */
2255 if (TREE_CODE (t) == NAMESPACE_DECL)
2256 push_decl_namespace (t);
2257 else if (CLASS_TYPE_P (t))
2259 if (!at_class_scope_p ()
2260 || !same_type_p (current_class_type, t))
2261 push_nested_class (t);
2263 /* T is the same as the current scope. There is therefore no
2264 need to re-enter the scope. Since we are not actually
2265 pushing a new scope, our caller should not call
2273 /* Leave scope pushed by push_scope. */
2278 if (TREE_CODE (t) == NAMESPACE_DECL)
2279 pop_decl_namespace ();
2280 else if CLASS_TYPE_P (t)
2281 pop_nested_class ();
2284 /* Subroutine of push_inner_scope. */
2287 push_inner_scope_r (tree outer, tree inner)
2292 || (TREE_CODE (inner) != NAMESPACE_DECL && !CLASS_TYPE_P (inner)))
2295 prev = CP_DECL_CONTEXT (TREE_CODE (inner) == NAMESPACE_DECL ? inner : TYPE_NAME (inner));
2297 push_inner_scope_r (outer, prev);
2298 if (TREE_CODE (inner) == NAMESPACE_DECL)
2300 struct cp_binding_level *save_template_parm = 0;
2301 /* Temporary take out template parameter scopes. They are saved
2302 in reversed order in save_template_parm. */
2303 while (current_binding_level->kind == sk_template_parms)
2305 struct cp_binding_level *b = current_binding_level;
2306 current_binding_level = b->level_chain;
2307 b->level_chain = save_template_parm;
2308 save_template_parm = b;
2311 resume_scope (NAMESPACE_LEVEL (inner));
2312 current_namespace = inner;
2314 /* Restore template parameter scopes. */
2315 while (save_template_parm)
2317 struct cp_binding_level *b = save_template_parm;
2318 save_template_parm = b->level_chain;
2319 b->level_chain = current_binding_level;
2320 current_binding_level = b;
2327 /* Enter the scope INNER from current scope. INNER must be a scope
2328 nested inside current scope. This works with both name lookup and
2329 pushing name into scope. In case a template parameter scope is present,
2330 namespace is pushed under the template parameter scope according to
2331 name lookup rule in 14.6.1/6.
2333 Return the former current scope suitable for pop_inner_scope. */
2336 push_inner_scope (tree inner)
2338 tree outer = current_scope ();
2340 outer = current_namespace;
2342 push_inner_scope_r (outer, inner);
2346 /* Exit the current scope INNER back to scope OUTER. */
2349 pop_inner_scope (tree outer, tree inner)
2352 || (TREE_CODE (inner) != NAMESPACE_DECL && !CLASS_TYPE_P (inner)))
2355 while (outer != inner)
2357 if (TREE_CODE (inner) == NAMESPACE_DECL)
2359 struct cp_binding_level *save_template_parm = 0;
2360 /* Temporary take out template parameter scopes. They are saved
2361 in reversed order in save_template_parm. */
2362 while (current_binding_level->kind == sk_template_parms)
2364 struct cp_binding_level *b = current_binding_level;
2365 current_binding_level = b->level_chain;
2366 b->level_chain = save_template_parm;
2367 save_template_parm = b;
2372 /* Restore template parameter scopes. */
2373 while (save_template_parm)
2375 struct cp_binding_level *b = save_template_parm;
2376 save_template_parm = b->level_chain;
2377 b->level_chain = current_binding_level;
2378 current_binding_level = b;
2384 inner = CP_DECL_CONTEXT (TREE_CODE (inner) == NAMESPACE_DECL ? inner : TYPE_NAME (inner));
2388 /* Do a pushlevel for class declarations. */
2391 pushlevel_class (void)
2393 if (ENABLE_SCOPE_CHECKING)
2396 class_binding_level = begin_scope (sk_class, current_class_type);
2399 /* ...and a poplevel for class declarations. */
2402 poplevel_class (void)
2404 struct cp_binding_level *level = class_binding_level;
2405 cp_class_binding *cb;
2409 timevar_push (TV_NAME_LOOKUP);
2410 gcc_assert (level != 0);
2412 /* If we're leaving a toplevel class, cache its binding level. */
2413 if (current_class_depth == 1)
2414 previous_class_level = level;
2415 for (shadowed = level->type_shadowed;
2417 shadowed = TREE_CHAIN (shadowed))
2418 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed), TREE_VALUE (shadowed));
2420 /* Remove the bindings for all of the class-level declarations. */
2421 if (level->class_shadowed)
2424 VEC_iterate (cp_class_binding, level->class_shadowed, i, cb);
2426 IDENTIFIER_BINDING (cb->identifier) = cb->base.previous;
2427 ggc_free (level->class_shadowed);
2428 level->class_shadowed = NULL;
2431 /* Now, pop out of the binding level which we created up in the
2432 `pushlevel_class' routine. */
2433 if (ENABLE_SCOPE_CHECKING)
2437 timevar_pop (TV_NAME_LOOKUP);
2440 /* Set INHERITED_VALUE_BINDING_P on BINDING to true or false, as
2441 appropriate. DECL is the value to which a name has just been
2442 bound. CLASS_TYPE is the class in which the lookup occurred. */
2445 set_inherited_value_binding_p (cxx_binding *binding, tree decl,
2448 if (binding->value == decl && TREE_CODE (decl) != TREE_LIST)
2452 if (TREE_CODE (decl) == OVERLOAD)
2453 context = CP_DECL_CONTEXT (OVL_CURRENT (decl));
2456 gcc_assert (DECL_P (decl));
2457 context = context_for_name_lookup (decl);
2460 if (is_properly_derived_from (class_type, context))
2461 INHERITED_VALUE_BINDING_P (binding) = 1;
2463 INHERITED_VALUE_BINDING_P (binding) = 0;
2465 else if (binding->value == decl)
2466 /* We only encounter a TREE_LIST when there is an ambiguity in the
2467 base classes. Such an ambiguity can be overridden by a
2468 definition in this class. */
2469 INHERITED_VALUE_BINDING_P (binding) = 1;
2471 INHERITED_VALUE_BINDING_P (binding) = 0;
2474 /* Make the declaration of X appear in CLASS scope. */
2477 pushdecl_class_level (tree x)
2480 bool is_valid = true;
2482 timevar_push (TV_NAME_LOOKUP);
2483 /* Get the name of X. */
2484 if (TREE_CODE (x) == OVERLOAD)
2485 name = DECL_NAME (get_first_fn (x));
2487 name = DECL_NAME (x);
2491 is_valid = push_class_level_binding (name, x);
2492 if (TREE_CODE (x) == TYPE_DECL)
2493 set_identifier_type_value (name, x);
2495 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x)))
2497 /* If X is an anonymous aggregate, all of its members are
2498 treated as if they were members of the class containing the
2499 aggregate, for naming purposes. */
2502 for (f = TYPE_FIELDS (TREE_TYPE (x)); f; f = TREE_CHAIN (f))
2504 location_t save_location = input_location;
2505 input_location = DECL_SOURCE_LOCATION (f);
2506 if (!pushdecl_class_level (f))
2508 input_location = save_location;
2511 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, is_valid);
2514 /* Return the BINDING (if any) for NAME in SCOPE, which is a class
2515 scope. If the value returned is non-NULL, and the PREVIOUS field
2516 is not set, callers must set the PREVIOUS field explicitly. */
2518 static cxx_binding *
2519 get_class_binding (tree name, cxx_scope *scope)
2524 cxx_binding *binding;
2526 class_type = scope->this_entity;
2528 /* Get the type binding. */
2529 type_binding = lookup_member (class_type, name,
2530 /*protect=*/2, /*want_type=*/true);
2531 /* Get the value binding. */
2532 value_binding = lookup_member (class_type, name,
2533 /*protect=*/2, /*want_type=*/false);
2536 && (TREE_CODE (value_binding) == TYPE_DECL
2537 || DECL_CLASS_TEMPLATE_P (value_binding)
2538 || (TREE_CODE (value_binding) == TREE_LIST
2539 && TREE_TYPE (value_binding) == error_mark_node
2540 && (TREE_CODE (TREE_VALUE (value_binding))
2542 /* We found a type binding, even when looking for a non-type
2543 binding. This means that we already processed this binding
2546 else if (value_binding)
2548 if (TREE_CODE (value_binding) == TREE_LIST
2549 && TREE_TYPE (value_binding) == error_mark_node)
2550 /* NAME is ambiguous. */
2552 else if (BASELINK_P (value_binding))
2553 /* NAME is some overloaded functions. */
2554 value_binding = BASELINK_FUNCTIONS (value_binding);
2557 /* If we found either a type binding or a value binding, create a
2558 new binding object. */
2559 if (type_binding || value_binding)
2561 binding = new_class_binding (name,
2565 /* This is a class-scope binding, not a block-scope binding. */
2566 LOCAL_BINDING_P (binding) = 0;
2567 set_inherited_value_binding_p (binding, value_binding, class_type);
2575 /* Make the declaration(s) of X appear in CLASS scope under the name
2576 NAME. Returns true if the binding is valid. */
2579 push_class_level_binding (tree name, tree x)
2581 cxx_binding *binding;
2585 timevar_push (TV_NAME_LOOKUP);
2586 /* The class_binding_level will be NULL if x is a template
2587 parameter name in a member template. */
2588 if (!class_binding_level)
2589 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, true);
2591 /* Check for invalid member names. */
2592 gcc_assert (TYPE_BEING_DEFINED (current_class_type));
2593 /* We could have been passed a tree list if this is an ambiguous
2594 declaration. If so, pull the declaration out because
2595 check_template_shadow will not handle a TREE_LIST. */
2596 if (TREE_CODE (decl) == TREE_LIST
2597 && TREE_TYPE (decl) == error_mark_node)
2598 decl = TREE_VALUE (decl);
2600 check_template_shadow (decl);
2604 If T is the name of a class, then each of the following shall
2605 have a name different from T:
2607 -- every static data member of class T;
2609 -- every member of class T that is itself a type;
2611 -- every enumerator of every member of class T that is an
2614 -- every member of every anonymous union that is a member of
2617 (Non-static data members were also forbidden to have the same
2618 name as T until TC1.) */
2619 if ((TREE_CODE (x) == VAR_DECL
2620 || TREE_CODE (x) == CONST_DECL
2621 || (TREE_CODE (x) == TYPE_DECL
2622 && !DECL_SELF_REFERENCE_P (x))
2623 /* A data member of an anonymous union. */
2624 || (TREE_CODE (x) == FIELD_DECL
2625 && DECL_CONTEXT (x) != current_class_type))
2626 && DECL_NAME (x) == constructor_name (current_class_type))
2628 tree scope = context_for_name_lookup (x);
2629 if (TYPE_P (scope) && same_type_p (scope, current_class_type))
2631 error ("%qD has the same name as the class in which it is "
2634 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, false);
2638 /* Get the current binding for NAME in this class, if any. */
2639 binding = IDENTIFIER_BINDING (name);
2640 if (!binding || binding->scope != class_binding_level)
2642 binding = get_class_binding (name, class_binding_level);
2643 /* If a new binding was created, put it at the front of the
2644 IDENTIFIER_BINDING list. */
2647 binding->previous = IDENTIFIER_BINDING (name);
2648 IDENTIFIER_BINDING (name) = binding;
2652 /* If there is already a binding, then we may need to update the
2654 if (binding && binding->value)
2656 tree bval = binding->value;
2657 tree old_decl = NULL_TREE;
2659 if (INHERITED_VALUE_BINDING_P (binding))
2661 /* If the old binding was from a base class, and was for a
2662 tag name, slide it over to make room for the new binding.
2663 The old binding is still visible if explicitly qualified
2664 with a class-key. */
2665 if (TREE_CODE (bval) == TYPE_DECL && DECL_ARTIFICIAL (bval)
2666 && !(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)))
2668 old_decl = binding->type;
2669 binding->type = bval;
2670 binding->value = NULL_TREE;
2671 INHERITED_VALUE_BINDING_P (binding) = 0;
2676 /* Any inherited type declaration is hidden by the type
2677 declaration in the derived class. */
2678 if (TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x))
2679 binding->type = NULL_TREE;
2682 else if (TREE_CODE (x) == OVERLOAD && is_overloaded_fn (bval))
2684 else if (TREE_CODE (x) == USING_DECL && TREE_CODE (bval) == USING_DECL)
2685 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, true);
2686 else if (TREE_CODE (x) == USING_DECL && is_overloaded_fn (bval))
2688 else if (TREE_CODE (bval) == USING_DECL && is_overloaded_fn (x))
2689 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, true);
2691 if (old_decl && binding->scope == class_binding_level)
2694 /* It is always safe to clear INHERITED_VALUE_BINDING_P
2695 here. This function is only used to register bindings
2696 from with the class definition itself. */
2697 INHERITED_VALUE_BINDING_P (binding) = 0;
2698 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, true);
2702 /* Note that we declared this value so that we can issue an error if
2703 this is an invalid redeclaration of a name already used for some
2705 note_name_declared_in_class (name, decl);
2707 /* If we didn't replace an existing binding, put the binding on the
2708 stack of bindings for the identifier, and update the shadowed
2710 if (binding && binding->scope == class_binding_level)
2711 /* Supplement the existing binding. */
2712 ok = supplement_binding (binding, decl);
2715 /* Create a new binding. */
2716 push_binding (name, decl, class_binding_level);
2720 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, ok);
2723 /* Process "using SCOPE::NAME" in a class scope. Return the
2724 USING_DECL created. */
2727 do_class_using_decl (tree scope, tree name)
2729 /* The USING_DECL returned by this function. */
2731 /* The declaration (or declarations) name by this using
2732 declaration. NULL if we are in a template and cannot figure out
2733 what has been named. */
2735 /* True if SCOPE is a dependent type. */
2736 bool scope_dependent_p;
2737 /* True if SCOPE::NAME is dependent. */
2738 bool name_dependent_p;
2739 /* True if any of the bases of CURRENT_CLASS_TYPE are dependent. */
2740 bool bases_dependent_p;
2745 if (!scope || !TYPE_P (scope))
2747 error ("using-declaration for non-member at class scope");
2751 /* Make sure the name is not invalid */
2752 if (TREE_CODE (name) == BIT_NOT_EXPR)
2754 error ("%<%T::%D%> names destructor", scope, name);
2757 if (constructor_name_p (name, scope))
2759 error ("%<%T::%D%> names constructor", scope, name);
2762 if (constructor_name_p (name, current_class_type))
2764 error ("%<%T::%D%> names constructor in %qT",
2765 scope, name, current_class_type);
2769 scope_dependent_p = dependent_type_p (scope);
2770 name_dependent_p = (scope_dependent_p
2771 || (IDENTIFIER_TYPENAME_P (name)
2772 && dependent_type_p (TREE_TYPE (name))));
2774 bases_dependent_p = false;
2775 if (processing_template_decl)
2776 for (binfo = TYPE_BINFO (current_class_type), i = 0;
2777 BINFO_BASE_ITERATE (binfo, i, base_binfo);
2779 if (dependent_type_p (TREE_TYPE (base_binfo)))
2781 bases_dependent_p = true;
2787 /* From [namespace.udecl]:
2789 A using-declaration used as a member-declaration shall refer to a
2790 member of a base class of the class being defined.
2792 In general, we cannot check this constraint in a template because
2793 we do not know the entire set of base classes of the current
2794 class type. However, if all of the base classes are
2795 non-dependent, then we can avoid delaying the check until
2797 if (!scope_dependent_p && !bases_dependent_p)
2801 binfo = lookup_base (current_class_type, scope, ba_any, &b_kind);
2802 if (b_kind < bk_proper_base)
2804 error_not_base_type (scope, current_class_type);
2808 if (!name_dependent_p)
2810 decl = lookup_member (binfo, name, 0, false);
2813 error ("no members matching %<%T::%D%> in %q#T", scope, name,
2817 /* The binfo from which the functions came does not matter. */
2818 if (BASELINK_P (decl))
2819 decl = BASELINK_FUNCTIONS (decl);
2823 value = build_lang_decl (USING_DECL, name, NULL_TREE);
2824 USING_DECL_DECLS (value) = decl;
2825 USING_DECL_SCOPE (value) = scope;
2826 DECL_DEPENDENT_P (value) = !decl;
2832 /* Return the binding value for name in scope. */
2835 namespace_binding (tree name, tree scope)
2837 cxx_binding *binding;
2840 scope = global_namespace;
2842 /* Unnecessary for the global namespace because it can't be an alias. */
2843 scope = ORIGINAL_NAMESPACE (scope);
2845 binding = cxx_scope_find_binding_for_name (NAMESPACE_LEVEL (scope), name);
2847 return binding ? binding->value : NULL_TREE;
2850 /* Set the binding value for name in scope. */
2853 set_namespace_binding (tree name, tree scope, tree val)
2857 timevar_push (TV_NAME_LOOKUP);
2858 if (scope == NULL_TREE)
2859 scope = global_namespace;
2860 b = binding_for_name (NAMESPACE_LEVEL (scope), name);
2861 if (!b->value || TREE_CODE (val) == OVERLOAD || val == error_mark_node)
2864 supplement_binding (b, val);
2865 timevar_pop (TV_NAME_LOOKUP);
2868 /* Set the context of a declaration to scope. Complain if we are not
2872 set_decl_namespace (tree decl, tree scope, bool friendp)
2876 /* Get rid of namespace aliases. */
2877 scope = ORIGINAL_NAMESPACE (scope);
2879 /* It is ok for friends to be qualified in parallel space. */
2880 if (!friendp && !is_ancestor (current_namespace, scope))
2881 error ("declaration of %qD not in a namespace surrounding %qD",
2883 DECL_CONTEXT (decl) = FROB_CONTEXT (scope);
2885 /* Writing "int N::i" to declare a variable within "N" is invalid. */
2886 if (scope == current_namespace)
2888 if (at_namespace_scope_p ())
2889 error ("explicit qualification in declaration of %qD",
2894 /* See whether this has been declared in the namespace. */
2895 old = lookup_qualified_name (scope, DECL_NAME (decl), false, true);
2897 /* No old declaration at all. */
2899 if (!is_overloaded_fn (decl))
2900 /* Don't compare non-function decls with decls_match here, since
2901 it can't check for the correct constness at this
2902 point. pushdecl will find those errors later. */
2904 /* Since decl is a function, old should contain a function decl. */
2905 if (!is_overloaded_fn (old))
2907 fn = OVL_CURRENT (old);
2908 if (!is_associated_namespace (scope, CP_DECL_CONTEXT (fn)))
2910 /* A template can be explicitly specialized in any namespace. */
2911 if (processing_explicit_instantiation)
2913 if (processing_template_decl || processing_specialization)
2914 /* We have not yet called push_template_decl to turn a
2915 FUNCTION_DECL into a TEMPLATE_DECL, so the declarations won't
2916 match. But, we'll check later, when we construct the
2919 /* Instantiations or specializations of templates may be declared as
2920 friends in any namespace. */
2921 if (friendp && DECL_USE_TEMPLATE (decl))
2923 if (is_overloaded_fn (old))
2925 for (; old; old = OVL_NEXT (old))
2926 if (decls_match (decl, OVL_CURRENT (old)))
2929 else if (decls_match (decl, old))
2932 error ("%qD should have been declared inside %qD", decl, scope);
2935 /* Return the namespace where the current declaration is declared. */
2938 current_decl_namespace (void)
2941 /* If we have been pushed into a different namespace, use it. */
2942 if (decl_namespace_list)
2943 return TREE_PURPOSE (decl_namespace_list);
2945 if (current_class_type)
2946 result = decl_namespace_context (current_class_type);
2947 else if (current_function_decl)
2948 result = decl_namespace_context (current_function_decl);
2950 result = current_namespace;
2954 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2955 select a name that is unique to this compilation unit. */
2958 push_namespace (tree name)
2962 int implicit_use = 0;
2965 timevar_push (TV_NAME_LOOKUP);
2967 /* We should not get here if the global_namespace is not yet constructed
2968 nor if NAME designates the global namespace: The global scope is
2969 constructed elsewhere. */
2970 gcc_assert (global_namespace != NULL && name != global_scope_name);
2974 /* The name of anonymous namespace is unique for the translation
2976 if (!anonymous_namespace_name)
2977 anonymous_namespace_name = get_file_function_name ('N');
2978 name = anonymous_namespace_name;
2979 d = IDENTIFIER_NAMESPACE_VALUE (name);
2981 /* Reopening anonymous namespace. */
2987 /* Check whether this is an extended namespace definition. */
2988 d = IDENTIFIER_NAMESPACE_VALUE (name);
2989 if (d != NULL_TREE && TREE_CODE (d) == NAMESPACE_DECL)
2992 if (DECL_NAMESPACE_ALIAS (d))
2994 error ("namespace alias %qD not allowed here, assuming %qD",
2995 d, DECL_NAMESPACE_ALIAS (d));
2996 d = DECL_NAMESPACE_ALIAS (d);
3003 /* Make a new namespace, binding the name to it. */
3004 d = build_lang_decl (NAMESPACE_DECL, name, void_type_node);
3005 DECL_CONTEXT (d) = FROB_CONTEXT (current_namespace);
3009 /* Clear DECL_NAME for the benefit of debugging back ends. */
3010 SET_DECL_ASSEMBLER_NAME (d, name);
3011 DECL_NAME (d) = NULL_TREE;
3013 begin_scope (sk_namespace, d);
3016 resume_scope (NAMESPACE_LEVEL (d));
3019 do_using_directive (d);
3020 /* Enter the name space. */
3021 current_namespace = d;
3023 timevar_pop (TV_NAME_LOOKUP);
3026 /* Pop from the scope of the current namespace. */
3029 pop_namespace (void)
3031 gcc_assert (current_namespace != global_namespace);
3032 current_namespace = CP_DECL_CONTEXT (current_namespace);
3033 /* The binding level is not popped, as it might be re-opened later. */
3037 /* Push into the scope of the namespace NS, even if it is deeply
3038 nested within another namespace. */
3041 push_nested_namespace (tree ns)
3043 if (ns == global_namespace)
3044 push_to_top_level ();
3047 push_nested_namespace (CP_DECL_CONTEXT (ns));
3048 push_namespace (DECL_NAME (ns));
3052 /* Pop back from the scope of the namespace NS, which was previously
3053 entered with push_nested_namespace. */
3056 pop_nested_namespace (tree ns)
3058 timevar_push (TV_NAME_LOOKUP);
3059 while (ns != global_namespace)
3062 ns = CP_DECL_CONTEXT (ns);
3065 pop_from_top_level ();
3066 timevar_pop (TV_NAME_LOOKUP);
3069 /* Temporarily set the namespace for the current declaration. */
3072 push_decl_namespace (tree decl)
3074 if (TREE_CODE (decl) != NAMESPACE_DECL)
3075 decl = decl_namespace_context (decl);
3076 decl_namespace_list = tree_cons (ORIGINAL_NAMESPACE (decl),
3077 NULL_TREE, decl_namespace_list);
3080 /* [namespace.memdef]/2 */
3083 pop_decl_namespace (void)
3085 decl_namespace_list = TREE_CHAIN (decl_namespace_list);
3088 /* Return the namespace that is the common ancestor
3089 of two given namespaces. */
3092 namespace_ancestor (tree ns1, tree ns2)
3094 timevar_push (TV_NAME_LOOKUP);
3095 if (is_ancestor (ns1, ns2))
3096 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, ns1);
3097 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP,
3098 namespace_ancestor (CP_DECL_CONTEXT (ns1), ns2));
3101 /* Process a namespace-alias declaration. */
3104 do_namespace_alias (tree alias, tree namespace)
3106 if (namespace == error_mark_node)
3109 gcc_assert (TREE_CODE (namespace) == NAMESPACE_DECL);
3111 namespace = ORIGINAL_NAMESPACE (namespace);
3113 /* Build the alias. */
3114 alias = build_lang_decl (NAMESPACE_DECL, alias, void_type_node);
3115 DECL_NAMESPACE_ALIAS (alias) = namespace;
3116 DECL_EXTERNAL (alias) = 1;
3117 DECL_CONTEXT (alias) = FROB_CONTEXT (current_scope ());
3120 /* Emit debug info for namespace alias. */
3121 (*debug_hooks->global_decl) (alias);
3124 /* Like pushdecl, only it places X in the current namespace,
3128 pushdecl_namespace_level (tree x, bool is_friend)
3130 struct cp_binding_level *b = current_binding_level;
3133 timevar_push (TV_NAME_LOOKUP);
3134 t = pushdecl_with_scope (x, NAMESPACE_LEVEL (current_namespace), is_friend);
3136 /* Now, the type_shadowed stack may screw us. Munge it so it does
3138 if (TREE_CODE (t) == TYPE_DECL)
3140 tree name = DECL_NAME (t);
3142 tree *ptr = (tree *)0;
3143 for (; !global_scope_p (b); b = b->level_chain)
3145 tree shadowed = b->type_shadowed;
3146 for (; shadowed; shadowed = TREE_CHAIN (shadowed))
3147 if (TREE_PURPOSE (shadowed) == name)
3149 ptr = &TREE_VALUE (shadowed);
3150 /* Can't break out of the loop here because sometimes
3151 a binding level will have duplicate bindings for
3152 PT names. It's gross, but I haven't time to fix it. */
3155 newval = TREE_TYPE (t);
3156 if (ptr == (tree *)0)
3158 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
3159 up here if this is changed to an assertion. --KR */
3160 SET_IDENTIFIER_TYPE_VALUE (name, t);
3167 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
3170 /* Insert USED into the using list of USER. Set INDIRECT_flag if this
3171 directive is not directly from the source. Also find the common
3172 ancestor and let our users know about the new namespace */
3174 add_using_namespace (tree user, tree used, bool indirect)
3177 timevar_push (TV_NAME_LOOKUP);
3178 /* Using oneself is a no-op. */
3181 timevar_pop (TV_NAME_LOOKUP);
3184 gcc_assert (TREE_CODE (user) == NAMESPACE_DECL);
3185 gcc_assert (TREE_CODE (used) == NAMESPACE_DECL);
3186 /* Check if we already have this. */
3187 t = purpose_member (used, DECL_NAMESPACE_USING (user));
3191 /* Promote to direct usage. */
3192 TREE_INDIRECT_USING (t) = 0;
3193 timevar_pop (TV_NAME_LOOKUP);
3197 /* Add used to the user's using list. */
3198 DECL_NAMESPACE_USING (user)
3199 = tree_cons (used, namespace_ancestor (user, used),
3200 DECL_NAMESPACE_USING (user));
3202 TREE_INDIRECT_USING (DECL_NAMESPACE_USING (user)) = indirect;
3204 /* Add user to the used's users list. */
3205 DECL_NAMESPACE_USERS (used)
3206 = tree_cons (user, 0, DECL_NAMESPACE_USERS (used));
3208 /* Recursively add all namespaces used. */
3209 for (t = DECL_NAMESPACE_USING (used); t; t = TREE_CHAIN (t))
3210 /* indirect usage */
3211 add_using_namespace (user, TREE_PURPOSE (t), 1);
3213 /* Tell everyone using us about the new used namespaces. */
3214 for (t = DECL_NAMESPACE_USERS (user); t; t = TREE_CHAIN (t))
3215 add_using_namespace (TREE_PURPOSE (t), used, 1);
3216 timevar_pop (TV_NAME_LOOKUP);
3219 /* Process a using-declaration not appearing in class or local scope. */
3222 do_toplevel_using_decl (tree decl, tree scope, tree name)
3224 tree oldval, oldtype, newval, newtype;
3225 tree orig_decl = decl;
3226 cxx_binding *binding;
3228 decl = validate_nonmember_using_decl (decl, scope, name);
3229 if (decl == NULL_TREE)
3232 binding = binding_for_name (NAMESPACE_LEVEL (current_namespace), name);
3234 oldval = binding->value;
3235 oldtype = binding->type;
3237 do_nonmember_using_decl (scope, name, oldval, oldtype, &newval, &newtype);
3239 /* Emit debug info. */
3240 if (!processing_template_decl)
3241 cp_emit_debug_info_for_using (orig_decl, current_namespace);
3243 /* Copy declarations found. */
3245 binding->value = newval;
3247 binding->type = newtype;
3250 /* Process a using-directive. */
3253 do_using_directive (tree namespace)
3255 tree context = NULL_TREE;
3257 if (namespace == error_mark_node)
3260 gcc_assert (TREE_CODE (namespace) == NAMESPACE_DECL);
3262 if (building_stmt_tree ())
3263 add_stmt (build_stmt (USING_STMT, namespace));
3264 namespace = ORIGINAL_NAMESPACE (namespace);
3266 if (!toplevel_bindings_p ())
3268 push_using_directive (namespace);
3269 context = current_scope ();
3274 add_using_namespace (current_namespace, namespace, 0);
3275 if (current_namespace != global_namespace)
3276 context = current_namespace;
3279 /* Emit debugging info. */
3280 if (!processing_template_decl)
3281 (*debug_hooks->imported_module_or_decl) (namespace, context);
3284 /* Deal with a using-directive seen by the parser. Currently we only
3285 handle attributes here, since they cannot appear inside a template. */
3288 parse_using_directive (tree namespace, tree attribs)
3292 do_using_directive (namespace);
3294 for (a = attribs; a; a = TREE_CHAIN (a))
3296 tree name = TREE_PURPOSE (a);
3297 if (is_attribute_p ("strong", name))
3299 if (!toplevel_bindings_p ())
3300 error ("strong using only meaningful at namespace scope");
3301 else if (namespace != error_mark_node)
3303 if (!is_ancestor (current_namespace, namespace))
3304 error ("current namespace %qD does not enclose strongly used namespace %qD",
3305 current_namespace, namespace);
3306 DECL_NAMESPACE_ASSOCIATIONS (namespace)
3307 = tree_cons (current_namespace, 0,
3308 DECL_NAMESPACE_ASSOCIATIONS (namespace));
3312 warning (OPT_Wattributes, "%qD attribute directive ignored", name);
3316 /* Like pushdecl, only it places X in the global scope if appropriate.
3317 Calls cp_finish_decl to register the variable, initializing it with
3318 *INIT, if INIT is non-NULL. */
3321 pushdecl_top_level_1 (tree x, tree *init, bool is_friend)
3323 timevar_push (TV_NAME_LOOKUP);
3324 push_to_top_level ();
3325 x = pushdecl_namespace_level (x, is_friend);
3327 finish_decl (x, *init, NULL_TREE);
3328 pop_from_top_level ();
3329 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, x);
3332 /* Like pushdecl, only it places X in the global scope if appropriate. */
3335 pushdecl_top_level (tree x)
3337 return pushdecl_top_level_1 (x, NULL, false);
3340 /* Like pushdecl_top_level, but adding the IS_FRIEND parameter. */
3343 pushdecl_top_level_maybe_friend (tree x, bool is_friend)
3345 return pushdecl_top_level_1 (x, NULL, is_friend);
3348 /* Like pushdecl, only it places X in the global scope if
3349 appropriate. Calls cp_finish_decl to register the variable,
3350 initializing it with INIT. */
3353 pushdecl_top_level_and_finish (tree x, tree init)
3355 return pushdecl_top_level_1 (x, &init, false);
3358 /* Combines two sets of overloaded functions into an OVERLOAD chain, removing
3359 duplicates. The first list becomes the tail of the result.
3361 The algorithm is O(n^2). We could get this down to O(n log n) by
3362 doing a sort on the addresses of the functions, if that becomes
3366 merge_functions (tree s1, tree s2)
3368 for (; s2; s2 = OVL_NEXT (s2))
3370 tree fn2 = OVL_CURRENT (s2);
3373 for (fns1 = s1; fns1; fns1 = OVL_NEXT (fns1))
3375 tree fn1 = OVL_CURRENT (fns1);
3377 /* If the function from S2 is already in S1, there is no
3378 need to add it again. For `extern "C"' functions, we
3379 might have two FUNCTION_DECLs for the same function, in
3380 different namespaces; again, we only need one of them. */
3382 || (DECL_EXTERN_C_P (fn1) && DECL_EXTERN_C_P (fn2)
3383 && DECL_NAME (fn1) == DECL_NAME (fn2)))
3387 /* If we exhausted all of the functions in S1, FN2 is new. */
3389 s1 = build_overload (fn2, s1);
3394 /* This should return an error not all definitions define functions.
3395 It is not an error if we find two functions with exactly the
3396 same signature, only if these are selected in overload resolution.
3397 old is the current set of bindings, new the freshly-found binding.
3398 XXX Do we want to give *all* candidates in case of ambiguity?
3399 XXX In what way should I treat extern declarations?
3400 XXX I don't want to repeat the entire duplicate_decls here */
3403 ambiguous_decl (tree name, struct scope_binding *old, cxx_binding *new,
3407 gcc_assert (old != NULL);
3408 /* Copy the value. */
3411 switch (TREE_CODE (val))
3414 /* If we expect types or namespaces, and not templates,
3415 or this is not a template class. */
3416 if ((LOOKUP_QUALIFIERS_ONLY (flags)
3417 && !DECL_CLASS_TEMPLATE_P (val))
3418 || hidden_name_p (val))
3422 if (LOOKUP_NAMESPACES_ONLY (flags) || hidden_name_p (val))
3425 case NAMESPACE_DECL:
3426 if (LOOKUP_TYPES_ONLY (flags))
3430 /* Ignore built-in functions that are still anticipated. */
3431 if (LOOKUP_QUALIFIERS_ONLY (flags) || hidden_name_p (val))
3435 if (LOOKUP_QUALIFIERS_ONLY (flags))
3441 else if (val && val != old->value)
3443 if (is_overloaded_fn (old->value) && is_overloaded_fn (val))
3444 old->value = merge_functions (old->value, val);
3447 old->value = tree_cons (NULL_TREE, old->value,
3448 build_tree_list (NULL_TREE, new->value));
3449 TREE_TYPE (old->value) = error_mark_node;
3452 /* ... and copy the type. */
3454 if (LOOKUP_NAMESPACES_ONLY (flags))
3458 else if (type && old->type != type)
3460 if (flags & LOOKUP_COMPLAIN)
3462 error ("%qD denotes an ambiguous type",name);
3463 error ("%J first type here", TYPE_MAIN_DECL (old->type));
3464 error ("%J other type here", TYPE_MAIN_DECL (type));
3469 /* Return the declarations that are members of the namespace NS. */
3472 cp_namespace_decls (tree ns)
3474 return NAMESPACE_LEVEL (ns)->names;
3477 /* Combine prefer_type and namespaces_only into flags. */
3480 lookup_flags (int prefer_type, int namespaces_only)
3482 if (namespaces_only)
3483 return LOOKUP_PREFER_NAMESPACES;
3484 if (prefer_type > 1)
3485 return LOOKUP_PREFER_TYPES;
3486 if (prefer_type > 0)
3487 return LOOKUP_PREFER_BOTH;
3491 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
3492 ignore it or not. Subroutine of lookup_name_real and
3493 lookup_type_scope. */
3496 qualify_lookup (tree val, int flags)
3498 if (val == NULL_TREE)
3500 if ((flags & LOOKUP_PREFER_NAMESPACES) && TREE_CODE (val) == NAMESPACE_DECL)
3502 if ((flags & LOOKUP_PREFER_TYPES)
3503 && (TREE_CODE (val) == TYPE_DECL || TREE_CODE (val) == TEMPLATE_DECL))
3505 if (flags & (LOOKUP_PREFER_NAMESPACES | LOOKUP_PREFER_TYPES))
3510 /* Given a lookup that returned VAL, decide if we want to ignore it or
3511 not based on DECL_ANTICIPATED. */
3514 hidden_name_p (tree val)
3517 && DECL_LANG_SPECIFIC (val)
3518 && DECL_ANTICIPATED (val))
3523 /* Remove any hidden friend functions from a possibly overloaded set
3527 remove_hidden_names (tree fns)
3532 if (TREE_CODE (fns) == FUNCTION_DECL && hidden_name_p (fns))
3534 else if (TREE_CODE (fns) == OVERLOAD)
3538 for (o = fns; o; o = OVL_NEXT (o))
3539 if (hidden_name_p (OVL_CURRENT (o)))
3545 for (o = fns; o; o = OVL_NEXT (o))
3546 if (!hidden_name_p (OVL_CURRENT (o)))
3547 n = build_overload (OVL_CURRENT (o), n);
3555 /* Select the right _DECL from multiple choices. */
3558 select_decl (const struct scope_binding *binding, int flags)
3561 val = binding->value;
3563 timevar_push (TV_NAME_LOOKUP);
3564 if (LOOKUP_NAMESPACES_ONLY (flags))
3566 /* We are not interested in types. */
3567 if (val && (TREE_CODE (val) == NAMESPACE_DECL
3568 || TREE_CODE (val) == TREE_LIST))
3569 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, val);
3570 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
3573 /* If looking for a type, or if there is no non-type binding, select
3574 the value binding. */
3575 if (binding->type && (!val || (flags & LOOKUP_PREFER_TYPES)))
3576 val = binding->type;
3577 /* Don't return non-types if we really prefer types. */
3578 else if (val && LOOKUP_TYPES_ONLY (flags)
3579 && ! DECL_DECLARES_TYPE_P (val))
3582 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, val);
3585 /* Unscoped lookup of a global: iterate over current namespaces,
3586 considering using-directives. */
3589 unqualified_namespace_lookup (tree name, int flags)
3591 tree initial = current_decl_namespace ();
3592 tree scope = initial;
3594 struct cp_binding_level *level;
3595 tree val = NULL_TREE;
3596 struct scope_binding binding = EMPTY_SCOPE_BINDING;
3598 timevar_push (TV_NAME_LOOKUP);
3600 for (; !val; scope = CP_DECL_CONTEXT (scope))
3603 cxx_scope_find_binding_for_name (NAMESPACE_LEVEL (scope), name);
3607 if (b->value && hidden_name_p (b->value))
3608 /* Ignore anticipated built-in functions and friends. */
3611 binding.value = b->value;
3612 binding.type = b->type;
3615 /* Add all _DECLs seen through local using-directives. */
3616 for (level = current_binding_level;
3617 level->kind != sk_namespace;
3618 level = level->level_chain)
3619 if (!lookup_using_namespace (name, &binding, level->using_directives,
3621 /* Give up because of error. */
3622 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
3624 /* Add all _DECLs seen through global using-directives. */
3625 /* XXX local and global using lists should work equally. */
3629 if (!lookup_using_namespace (name, &binding,
3630 DECL_NAMESPACE_USING (siter),
3632 /* Give up because of error. */
3633 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
3634 if (siter == scope) break;
3635 siter = CP_DECL_CONTEXT (siter);
3638 val = select_decl (&binding, flags);
3639 if (scope == global_namespace)
3642 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, val);
3645 /* Look up NAME (an IDENTIFIER_NODE) in SCOPE (either a NAMESPACE_DECL
3646 or a class TYPE). If IS_TYPE_P is TRUE, then ignore non-type
3649 Returns a DECL (or OVERLOAD, or BASELINK) representing the
3650 declaration found. If no suitable declaration can be found,
3651 ERROR_MARK_NODE is returned. If COMPLAIN is true and SCOPE is
3652 neither a class-type nor a namespace a diagnostic is issued. */
3655 lookup_qualified_name (tree scope, tree name, bool is_type_p, bool complain)
3659 if (TREE_CODE (scope) == NAMESPACE_DECL)
3661 struct scope_binding binding = EMPTY_SCOPE_BINDING;
3663 flags |= LOOKUP_COMPLAIN;
3665 flags |= LOOKUP_PREFER_TYPES;
3666 if (qualified_lookup_using_namespace (name, scope, &binding, flags))
3667 return select_decl (&binding, flags);
3669 else if (is_aggr_type (scope, complain))
3672 t = lookup_member (scope, name, 2, is_type_p);
3677 return error_mark_node;
3680 /* Subroutine of unqualified_namespace_lookup:
3681 Add the bindings of NAME in used namespaces to VAL.
3682 We are currently looking for names in namespace SCOPE, so we
3683 look through USINGS for using-directives of namespaces
3684 which have SCOPE as a common ancestor with the current scope.
3685 Returns false on errors. */
3688 lookup_using_namespace (tree name, struct scope_binding *val,
3689 tree usings, tree scope, int flags)
3692 timevar_push (TV_NAME_LOOKUP);
3693 /* Iterate over all used namespaces in current, searching for using
3694 directives of scope. */
3695 for (iter = usings; iter; iter = TREE_CHAIN (iter))
3696 if (TREE_VALUE (iter) == scope)
3698 tree used = ORIGINAL_NAMESPACE (TREE_PURPOSE (iter));
3700 cxx_scope_find_binding_for_name (NAMESPACE_LEVEL (used), name);
3701 /* Resolve ambiguities. */
3703 ambiguous_decl (name, val, val1, flags);
3705 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, val->value != error_mark_node);
3709 Accepts the NAME to lookup and its qualifying SCOPE.
3710 Returns the name/type pair found into the cxx_binding *RESULT,
3711 or false on error. */
3714 qualified_lookup_using_namespace (tree name, tree scope,
3715 struct scope_binding *result, int flags)
3717 /* Maintain a list of namespaces visited... */
3718 tree seen = NULL_TREE;
3719 /* ... and a list of namespace yet to see. */
3720 tree todo = NULL_TREE;
3721 tree todo_maybe = NULL_TREE;
3723 timevar_push (TV_NAME_LOOKUP);
3724 /* Look through namespace aliases. */
3725 scope = ORIGINAL_NAMESPACE (scope);
3726 while (scope && result->value != error_mark_node)
3728 cxx_binding *binding =
3729 cxx_scope_find_binding_for_name (NAMESPACE_LEVEL (scope), name);
3730 seen = tree_cons (scope, NULL_TREE, seen);
3732 ambiguous_decl (name, result, binding, flags);
3734 /* Consider strong using directives always, and non-strong ones
3735 if we haven't found a binding yet. ??? Shouldn't we consider
3736 non-strong ones if the initial RESULT is non-NULL, but the
3737 binding in the given namespace is? */
3738 for (usings = DECL_NAMESPACE_USING (scope); usings;
3739 usings = TREE_CHAIN (usings))
3740 /* If this was a real directive, and we have not seen it. */
3741 if (!TREE_INDIRECT_USING (usings))
3743 /* Try to avoid queuing the same namespace more than once,
3744 the exception being when a namespace was already
3745 enqueued for todo_maybe and then a strong using is
3746 found for it. We could try to remove it from
3747 todo_maybe, but it's probably not worth the effort. */
3748 if (is_associated_namespace (scope, TREE_PURPOSE (usings))
3749 && !purpose_member (TREE_PURPOSE (usings), seen)
3750 && !purpose_member (TREE_PURPOSE (usings), todo))
3751 todo = tree_cons (TREE_PURPOSE (usings), NULL_TREE, todo);
3752 else if ((!result->value && !result->type)
3753 && !purpose_member (TREE_PURPOSE (usings), seen)
3754 && !purpose_member (TREE_PURPOSE (usings), todo)
3755 && !purpose_member (TREE_PURPOSE (usings), todo_maybe))
3756 todo_maybe = tree_cons (TREE_PURPOSE (usings), NULL_TREE,
3761 scope = TREE_PURPOSE (todo);
3762 todo = TREE_CHAIN (todo);
3765 && (!result->value && !result->type))
3767 scope = TREE_PURPOSE (todo_maybe);
3768 todo = TREE_CHAIN (todo_maybe);
3769 todo_maybe = NULL_TREE;
3772 scope = NULL_TREE; /* If there never was a todo list. */
3774 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, result->value != error_mark_node);
3777 /* Return the innermost non-namespace binding for NAME from a scope
3778 containing BINDING, or, if BINDING is NULL, the current scope. If
3779 CLASS_P is false, then class bindings are ignored. */
3782 outer_binding (tree name,
3783 cxx_binding *binding,
3788 cxx_scope *outer_scope;
3792 scope = binding->scope->level_chain;
3793 outer = binding->previous;
3797 scope = current_binding_level;
3798 outer = IDENTIFIER_BINDING (name);
3800 outer_scope = outer ? outer->scope : NULL;
3802 /* Because we create class bindings lazily, we might be missing a
3803 class binding for NAME. If there are any class binding levels
3804 between the LAST_BINDING_LEVEL and the scope in which OUTER was
3805 declared, we must lookup NAME in those class scopes. */
3807 while (scope && scope != outer_scope && scope->kind != sk_namespace)
3809 if (scope->kind == sk_class)
3811 cxx_binding *class_binding;
3813 class_binding = get_class_binding (name, scope);
3816 /* Thread this new class-scope binding onto the
3817 IDENTIFIER_BINDING list so that future lookups
3819 class_binding->previous = outer;
3821 binding->previous = class_binding;
3823 IDENTIFIER_BINDING (name) = class_binding;
3824 return class_binding;
3827 scope = scope->level_chain;
3833 /* Return the innermost block-scope or class-scope value binding for
3834 NAME, or NULL_TREE if there is no such binding. */
3837 innermost_non_namespace_value (tree name)
3839 cxx_binding *binding;
3840 binding = outer_binding (name, /*binding=*/NULL, /*class_p=*/true);
3841 return binding ? binding->value : NULL_TREE;
3844 /* Look up NAME in the current binding level and its superiors in the
3845 namespace of variables, functions and typedefs. Return a ..._DECL
3846 node of some kind representing its definition if there is only one
3847 such declaration, or return a TREE_LIST with all the overloaded
3848 definitions if there are many, or return 0 if it is undefined.
3849 Hidden name, either friend declaration or built-in function, are
3852 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
3853 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
3854 Otherwise we prefer non-TYPE_DECLs.
3856 If NONCLASS is nonzero, bindings in class scopes are ignored. If
3857 BLOCK_P is false, bindings in block scopes are ignored. */
3860 lookup_name_real (tree name, int prefer_type, int nonclass, bool block_p,
3861 int namespaces_only, int flags)
3864 tree val = NULL_TREE;
3866 timevar_push (TV_NAME_LOOKUP);
3867 /* Conversion operators are handled specially because ordinary
3868 unqualified name lookup will not find template conversion
3870 if (IDENTIFIER_TYPENAME_P (name))
3872 struct cp_binding_level *level;
3874 for (level = current_binding_level;
3875 level && level->kind != sk_namespace;
3876 level = level->level_chain)
3881 /* A conversion operator can only be declared in a class
3883 if (level->kind != sk_class)
3886 /* Lookup the conversion operator in the class. */
3887 class_type = level->this_entity;
3888 operators = lookup_fnfields (class_type, name, /*protect=*/0);
3890 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, operators);
3893 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
3896 flags |= lookup_flags (prefer_type, namespaces_only);
3898 /* First, look in non-namespace scopes. */
3900 if (current_class_type == NULL_TREE)
3903 if (block_p || !nonclass)
3904 for (iter = outer_binding (name, NULL, !nonclass);
3906 iter = outer_binding (name, iter, !nonclass))
3910 /* Skip entities we don't want. */
3911 if (LOCAL_BINDING_P (iter) ? !block_p : nonclass)
3914 /* If this is the kind of thing we're looking for, we're done. */
3915 if (qualify_lookup (iter->value, flags)
3916 && !hidden_name_p (iter->value))
3917 binding = iter->value;
3918 else if ((flags & LOOKUP_PREFER_TYPES)
3919 && qualify_lookup (iter->type, flags)
3920 && !hidden_name_p (iter->type))
3921 binding = iter->type;
3923 binding = NULL_TREE;
3932 /* Now lookup in namespace scopes. */
3934 val = unqualified_namespace_lookup (name, flags);
3936 /* If we have a single function from a using decl, pull it out. */
3937 if (val && TREE_CODE (val) == OVERLOAD && !really_overloaded_fn (val))
3938 val = OVL_FUNCTION (val);
3940 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, val);
3944 lookup_name_nonclass (tree name)
3946 return lookup_name_real (name, 0, 1, /*block_p=*/true, 0, LOOKUP_COMPLAIN);
3950 lookup_function_nonclass (tree name, tree args, bool block_p)
3953 lookup_arg_dependent (name,
3954 lookup_name_real (name, 0, 1, block_p, 0,
3960 lookup_name (tree name)
3962 return lookup_name_real (name, 0, 0, /*block_p=*/true, 0, LOOKUP_COMPLAIN);
3966 lookup_name_prefer_type (tree name, int prefer_type)
3968 return lookup_name_real (name, prefer_type, 0, /*block_p=*/true,
3969 0, LOOKUP_COMPLAIN);
3972 /* Look up NAME for type used in elaborated name specifier in
3973 the scopes given by SCOPE. SCOPE can be either TS_CURRENT or
3974 TS_WITHIN_ENCLOSING_NON_CLASS. Although not implied by the
3975 name, more scopes are checked if cleanup or template parameter
3976 scope is encountered.
3978 Unlike lookup_name_real, we make sure that NAME is actually
3979 declared in the desired scope, not from inheritance, nor using
3980 directive. For using declaration, there is DR138 still waiting
3981 to be resolved. Hidden name coming from an earlier friend
3982 declaration is also returned.
3984 A TYPE_DECL best matching the NAME is returned. Catching error
3985 and issuing diagnostics are caller's responsibility. */
3988 lookup_type_scope (tree name, tag_scope scope)
3990 cxx_binding *iter = NULL;
3991 tree val = NULL_TREE;
3993 timevar_push (TV_NAME_LOOKUP);
3995 /* Look in non-namespace scope first. */
3996 if (current_binding_level->kind != sk_namespace)
3997 iter = outer_binding (name, NULL, /*class_p=*/ true);
3998 for (; iter; iter = outer_binding (name, iter, /*class_p=*/ true))
4000 /* Check if this is the kind of thing we're looking for.
4001 If SCOPE is TS_CURRENT, also make sure it doesn't come from
4002 base class. For ITER->VALUE, we can simply use
4003 INHERITED_VALUE_BINDING_P. For ITER->TYPE, we have to use
4006 We check ITER->TYPE before ITER->VALUE in order to handle
4007 typedef struct C {} C;
4010 if (qualify_lookup (iter->type, LOOKUP_PREFER_TYPES)
4011 && (scope != ts_current
4012 || LOCAL_BINDING_P (iter)
4013 || DECL_CONTEXT (iter->type) == iter->scope->this_entity))
4015 else if ((scope != ts_current
4016 || !INHERITED_VALUE_BINDING_P (iter))
4017 && qualify_lookup (iter->value, LOOKUP_PREFER_TYPES))
4024 /* Look in namespace scope. */
4027 iter = cxx_scope_find_binding_for_name
4028 (NAMESPACE_LEVEL (current_decl_namespace ()), name);
4032 /* If this is the kind of thing we're looking for, we're done. */
4033 if (qualify_lookup (iter->type, LOOKUP_PREFER_TYPES))
4035 else if (qualify_lookup (iter->value, LOOKUP_PREFER_TYPES))
4041 /* Type found, check if it is in the allowed scopes, ignoring cleanup
4042 and template parameter scopes. */
4045 struct cp_binding_level *b = current_binding_level;
4048 if (iter->scope == b)
4049 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, val);
4051 if (b->kind == sk_cleanup || b->kind == sk_template_parms)
4053 else if (b->kind == sk_class
4054 && scope == ts_within_enclosing_non_class)
4061 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
4064 /* Similar to `lookup_name' but look only in the innermost non-class
4068 lookup_name_innermost_nonclass_level (tree name)
4070 struct cp_binding_level *b;
4073 timevar_push (TV_NAME_LOOKUP);
4074 b = innermost_nonclass_level ();
4076 if (b->kind == sk_namespace)
4078 t = IDENTIFIER_NAMESPACE_VALUE (name);
4080 /* extern "C" function() */
4081 if (t != NULL_TREE && TREE_CODE (t) == TREE_LIST)
4084 else if (IDENTIFIER_BINDING (name)
4085 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name)))
4087 cxx_binding *binding;
4088 binding = IDENTIFIER_BINDING (name);
4091 if (binding->scope == b
4092 && !(TREE_CODE (binding->value) == VAR_DECL
4093 && DECL_DEAD_FOR_LOCAL (binding->value)))
4094 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, binding->value);
4096 if (b->kind == sk_cleanup)
4103 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
4106 /* Like lookup_name_innermost_nonclass_level, but for types. */
4109 lookup_type_current_level (tree name)
4113 timevar_push (TV_NAME_LOOKUP);
4114 gcc_assert (current_binding_level->kind != sk_namespace);
4116 if (REAL_IDENTIFIER_TYPE_VALUE (name) != NULL_TREE
4117 && REAL_IDENTIFIER_TYPE_VALUE (name) != global_type_node)
4119 struct cp_binding_level *b = current_binding_level;
4122 if (purpose_member (name, b->type_shadowed))
4123 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP,
4124 REAL_IDENTIFIER_TYPE_VALUE (name));
4125 if (b->kind == sk_cleanup)
4132 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
4135 /* [basic.lookup.koenig] */
4136 /* A nonzero return value in the functions below indicates an error. */
4147 static bool arg_assoc (struct arg_lookup*, tree);
4148 static bool arg_assoc_args (struct arg_lookup*, tree);
4149 static bool arg_assoc_type (struct arg_lookup*, tree);
4150 static bool add_function (struct arg_lookup *, tree);
4151 static bool arg_assoc_namespace (struct arg_lookup *, tree);
4152 static bool arg_assoc_class (struct arg_lookup *, tree);
4153 static bool arg_assoc_template_arg (struct arg_lookup*, tree);
4155 /* Add a function to the lookup structure.
4156 Returns true on error. */
4159 add_function (struct arg_lookup *k, tree fn)
4161 /* We used to check here to see if the function was already in the list,
4162 but that's O(n^2), which is just too expensive for function lookup.
4163 Now we deal with the occasional duplicate in joust. In doing this, we
4164 assume that the number of duplicates will be small compared to the
4165 total number of functions being compared, which should usually be the
4168 /* We must find only functions, or exactly one non-function. */
4171 else if (fn == k->functions)
4173 else if (is_overloaded_fn (k->functions) && is_overloaded_fn (fn))
4174 k->functions = build_overload (fn, k->functions);
4177 tree f1 = OVL_CURRENT (k->functions);
4179 if (is_overloaded_fn (f1))
4181 fn = f1; f1 = f2; f2 = fn;
4183 error ("%q+D is not a function,", f1);
4184 error (" conflict with %q+D", f2);
4185 error (" in call to %qD", k->name);
4192 /* Returns true iff CURRENT has declared itself to be an associated
4193 namespace of SCOPE via a strong using-directive (or transitive chain
4194 thereof). Both are namespaces. */
4197 is_associated_namespace (tree current, tree scope)
4199 tree seen = NULL_TREE;
4200 tree todo = NULL_TREE;
4204 if (scope == current)
4206 seen = tree_cons (scope, NULL_TREE, seen);
4207 for (t = DECL_NAMESPACE_ASSOCIATIONS (scope); t; t = TREE_CHAIN (t))
4208 if (!purpose_member (TREE_PURPOSE (t), seen))
4209 todo = tree_cons (TREE_PURPOSE (t), NULL_TREE, todo);
4212 scope = TREE_PURPOSE (todo);
4213 todo = TREE_CHAIN (todo);
4220 /* Return whether FN is a friend of an associated class of ARG. */
4223 friend_of_associated_class_p (tree arg, tree fn)
4229 else if (type_unknown_p (arg))
4232 type = TREE_TYPE (arg);
4234 /* If TYPE is a class, the class itself and all base classes are
4235 associated classes. */
4236 if (CLASS_TYPE_P (type))
4238 if (is_friend (type, fn))
4241 if (TYPE_BINFO (type))
4243 tree binfo, base_binfo;
4246 for (binfo = TYPE_BINFO (type), i = 0;
4247 BINFO_BASE_ITERATE (binfo, i, base_binfo);
4249 if (is_friend (BINFO_TYPE (base_binfo), fn))
4254 /* If TYPE is a class member, the class of which it is a member is
4255 an associated class. */
4256 if ((CLASS_TYPE_P (type)
4257 || TREE_CODE (type) == UNION_TYPE
4258 || TREE_CODE (type) == ENUMERAL_TYPE)
4259 && TYPE_CONTEXT (type)
4260 && CLASS_TYPE_P (TYPE_CONTEXT (type))
4261 && is_friend (TYPE_CONTEXT (type), fn))
4267 /* Add functions of a namespace to the lookup structure.
4268 Returns true on error. */
4271 arg_assoc_namespace (struct arg_lookup *k, tree scope)
4275 if (purpose_member (scope, k->namespaces))
4277 k->namespaces = tree_cons (scope, NULL_TREE, k->namespaces);
4279 /* Check out our super-users. */
4280 for (value = DECL_NAMESPACE_ASSOCIATIONS (scope); value;
4281 value = TREE_CHAIN (value))
4282 if (arg_assoc_namespace (k, TREE_PURPOSE (value)))
4285 value = namespace_binding (k->name, scope);
4289 for (; value; value = OVL_NEXT (value))
4291 /* We don't want to find arbitrary hidden functions via argument
4292 dependent lookup. We only want to find friends of associated
4294 if (hidden_name_p (OVL_CURRENT (value)))
4298 for (args = k->args; args; args = TREE_CHAIN (args))
4299 if (friend_of_associated_class_p (TREE_VALUE (args),
4300 OVL_CURRENT (value)))
4306 if (add_function (k, OVL_CURRENT (value)))
4313 /* Adds everything associated with a template argument to the lookup
4314 structure. Returns true on error. */
4317 arg_assoc_template_arg (struct arg_lookup *k, tree arg)
4319 /* [basic.lookup.koenig]
4321 If T is a template-id, its associated namespaces and classes are
4322 ... the namespaces and classes associated with the types of the
4323 template arguments provided for template type parameters
4324 (excluding template template parameters); the namespaces in which
4325 any template template arguments are defined; and the classes in
4326 which any member templates used as template template arguments
4327 are defined. [Note: non-type template arguments do not
4328 contribute to the set of associated namespaces. ] */
4330 /* Consider first template template arguments. */
4331 if (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM
4332 || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE)
4334 else if (TREE_CODE (arg) == TEMPLATE_DECL)
4336 tree ctx = CP_DECL_CONTEXT (arg);
4338 /* It's not a member template. */
4339 if (TREE_CODE (ctx) == NAMESPACE_DECL)
4340 return arg_assoc_namespace (k, ctx);
4341 /* Otherwise, it must be member template. */
4343 return arg_assoc_class (k, ctx);
4345 /* It's not a template template argument, but it is a type template
4347 else if (TYPE_P (arg))
4348 return arg_assoc_type (k, arg);
4349 /* It's a non-type template argument. */
4354 /* Adds everything associated with class to the lookup structure.
4355 Returns true on error. */
4358 arg_assoc_class (struct arg_lookup *k, tree type)
4360 tree list, friends, context;
4363 /* Backend build structures, such as __builtin_va_list, aren't
4364 affected by all this. */
4365 if (!CLASS_TYPE_P (type))
4368 if (purpose_member (type, k->classes))
4370 k->classes = tree_cons (type, NULL_TREE, k->classes);
4372 context = decl_namespace_context (type);
4373 if (arg_assoc_namespace (k, context))
4376 if (TYPE_BINFO (type))
4378 /* Process baseclasses. */
4379 tree binfo, base_binfo;
4381 for (binfo = TYPE_BINFO (type), i = 0;
4382 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
4383 if (arg_assoc_class (k, BINFO_TYPE (base_binfo)))
4387 /* Process friends. */
4388 for (list = DECL_FRIENDLIST (TYPE_MAIN_DECL (type)); list;
4389 list = TREE_CHAIN (list))
4390 if (k->name == FRIEND_NAME (list))
4391 for (friends = FRIEND_DECLS (list); friends;
4392 friends = TREE_CHAIN (friends))
4394 tree fn = TREE_VALUE (friends);
4396 /* Only interested in global functions with potentially hidden
4397 (i.e. unqualified) declarations. */
4398 if (CP_DECL_CONTEXT (fn) != context)
4400 /* Template specializations are never found by name lookup.
4401 (Templates themselves can be found, but not template
4402 specializations.) */
4403 if (TREE_CODE (fn) == FUNCTION_DECL && DECL_USE_TEMPLATE (fn))
4405 if (add_function (k, fn))
4409 /* Process template arguments. */
4410 if (CLASSTYPE_TEMPLATE_INFO (type)
4411 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type)))
4413 list = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type));
4414 for (i = 0; i < TREE_VEC_LENGTH (list); ++i)
4415 arg_assoc_template_arg (k, TREE_VEC_ELT (list, i));
4421 /* Adds everything associated with a given type.
4422 Returns 1 on error. */
4425 arg_assoc_type (struct arg_lookup *k, tree type)
4427 /* As we do not get the type of non-type dependent expressions
4428 right, we can end up with such things without a type. */
4432 if (TYPE_PTRMEM_P (type))
4434 /* Pointer to member: associate class type and value type. */
4435 if (arg_assoc_type (k, TYPE_PTRMEM_CLASS_TYPE (type)))
4437 return arg_assoc_type (k, TYPE_PTRMEM_POINTED_TO_TYPE (type));
4439 else switch (TREE_CODE (type))
4451 if (TYPE_PTRMEMFUNC_P (type))
4452 return arg_assoc_type (k, TYPE_PTRMEMFUNC_FN_TYPE (type));
4453 return arg_assoc_class (k, type);
4455 case REFERENCE_TYPE:
4457 return arg_assoc_type (k, TREE_TYPE (type));
4460 return arg_assoc_namespace (k, decl_namespace_context (type));
4462 /* The basetype is referenced in the first arg type, so just
4465 /* Associate the parameter types. */
4466 if (arg_assoc_args (k, TYPE_ARG_TYPES (type)))
4468 /* Associate the return type. */
4469 return arg_assoc_type (k, TREE_TYPE (type));
4470 case TEMPLATE_TYPE_PARM:
4471 case BOUND_TEMPLATE_TEMPLATE_PARM:
4476 gcc_assert (type == unknown_type_node);
4484 /* Adds everything associated with arguments. Returns true on error. */
4487 arg_assoc_args (struct arg_lookup *k, tree args)
4489 for (; args; args = TREE_CHAIN (args))
4490 if (arg_assoc (k, TREE_VALUE (args)))
4495 /* Adds everything associated with a given tree_node. Returns 1 on error. */
4498 arg_assoc (struct arg_lookup *k, tree n)
4500 if (n == error_mark_node)
4504 return arg_assoc_type (k, n);
4506 if (! type_unknown_p (n))
4507 return arg_assoc_type (k, TREE_TYPE (n));
4509 if (TREE_CODE (n) == ADDR_EXPR)
4510 n = TREE_OPERAND (n, 0);
4511 if (TREE_CODE (n) == COMPONENT_REF)
4512 n = TREE_OPERAND (n, 1);
4513 if (TREE_CODE (n) == OFFSET_REF)
4514 n = TREE_OPERAND (n, 1);
4515 while (TREE_CODE (n) == TREE_LIST)
4517 if (TREE_CODE (n) == BASELINK)
4518 n = BASELINK_FUNCTIONS (n);
4520 if (TREE_CODE (n) == FUNCTION_DECL)
4521 return arg_assoc_type (k, TREE_TYPE (n));
4522 if (TREE_CODE (n) == TEMPLATE_ID_EXPR)
4524 /* [basic.lookup.koenig]
4526 If T is a template-id, its associated namespaces and classes
4527 are the namespace in which the template is defined; for
4528 member templates, the member template's class... */
4529 tree template = TREE_OPERAND (n, 0);
4530 tree args = TREE_OPERAND (n, 1);
4534 if (TREE_CODE (template) == COMPONENT_REF)
4535 template = TREE_OPERAND (template, 1);
4537 /* First, the template. There may actually be more than one if
4538 this is an overloaded function template. But, in that case,
4539 we only need the first; all the functions will be in the same
4541 template = OVL_CURRENT (template);
4543 ctx = CP_DECL_CONTEXT (template);
4545 if (TREE_CODE (ctx) == NAMESPACE_DECL)
4547 if (arg_assoc_namespace (k, ctx) == 1)
4550 /* It must be a member template. */
4551 else if (arg_assoc_class (k, ctx) == 1)
4554 /* Now the arguments. */
4556 for (ix = TREE_VEC_LENGTH (args); ix--;)
4557 if (arg_assoc_template_arg (k, TREE_VEC_ELT (args, ix)) == 1)
4560 else if (TREE_CODE (n) == OVERLOAD)
4562 for (; n; n = OVL_CHAIN (n))
4563 if (arg_assoc_type (k, TREE_TYPE (OVL_FUNCTION (n))))
4570 /* Performs Koenig lookup depending on arguments, where fns
4571 are the functions found in normal lookup. */
4574 lookup_arg_dependent (tree name, tree fns, tree args)
4576 struct arg_lookup k;
4578 timevar_push (TV_NAME_LOOKUP);
4580 /* Remove any hidden friend functions from the list of functions
4581 found so far. They will be added back by arg_assoc_class as
4583 fns = remove_hidden_names (fns);
4588 k.classes = NULL_TREE;
4590 /* We previously performed an optimization here by setting
4591 NAMESPACES to the current namespace when it was safe. However, DR
4592 164 says that namespaces that were already searched in the first
4593 stage of template processing are searched again (potentially
4594 picking up later definitions) in the second stage. */
4595 k.namespaces = NULL_TREE;
4597 arg_assoc_args (&k, args);
4598 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, k.functions);
4601 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4602 changed (i.e. there was already a directive), or the fresh
4603 TREE_LIST otherwise. */
4606 push_using_directive (tree used)
4608 tree ud = current_binding_level->using_directives;
4609 tree iter, ancestor;
4611 timevar_push (TV_NAME_LOOKUP);
4612 /* Check if we already have this. */
4613 if (purpose_member (used, ud) != NULL_TREE)
4614 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
4616 ancestor = namespace_ancestor (current_decl_namespace (), used);
4617 ud = current_binding_level->using_directives;
4618 ud = tree_cons (used, ancestor, ud);
4619 current_binding_level->using_directives = ud;
4621 /* Recursively add all namespaces used. */
4622 for (iter = DECL_NAMESPACE_USING (used); iter; iter = TREE_CHAIN (iter))
4623 push_using_directive (TREE_PURPOSE (iter));
4625 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, ud);
4628 /* The type TYPE is being declared. If it is a class template, or a
4629 specialization of a class template, do any processing required and
4630 perform error-checking. If IS_FRIEND is nonzero, this TYPE is
4631 being declared a friend. B is the binding level at which this TYPE
4634 Returns the TYPE_DECL for TYPE, which may have been altered by this
4638 maybe_process_template_type_declaration (tree type, int is_friend,
4641 tree decl = TYPE_NAME (type);
4643 if (processing_template_parmlist)
4644 /* You can't declare a new template type in a template parameter
4645 list. But, you can declare a non-template type:
4647 template <class A*> struct S;
4649 is a forward-declaration of `A'. */
4651 else if (b->kind == sk_namespace
4652 && current_binding_level->kind != sk_namespace)
4653 /* If this new type is being injected into a containing scope,
4654 then it's not a template type. */
4658 gcc_assert (IS_AGGR_TYPE (type) || TREE_CODE (type) == ENUMERAL_TYPE);
4660 if (processing_template_decl)
4662 /* This may change after the call to
4663 push_template_decl_real, but we want the original value. */
4664 tree name = DECL_NAME (decl);
4666 decl = push_template_decl_real (decl, is_friend);
4667 /* If the current binding level is the binding level for the
4668 template parameters (see the comment in
4669 begin_template_parm_list) and the enclosing level is a class
4670 scope, and we're not looking at a friend, push the
4671 declaration of the member class into the class scope. In the
4672 friend case, push_template_decl will already have put the
4673 friend into global scope, if appropriate. */
4674 if (TREE_CODE (type) != ENUMERAL_TYPE
4675 && !is_friend && b->kind == sk_template_parms
4676 && b->level_chain->kind == sk_class)
4678 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type));
4680 if (!COMPLETE_TYPE_P (current_class_type))
4682 maybe_add_class_template_decl_list (current_class_type,
4683 type, /*friend_p=*/0);
4684 /* Put this UTD in the table of UTDs for the class. */
4685 if (CLASSTYPE_NESTED_UTDS (current_class_type) == NULL)
4686 CLASSTYPE_NESTED_UTDS (current_class_type) =
4687 binding_table_new (SCOPE_DEFAULT_HT_SIZE);
4689 binding_table_insert
4690 (CLASSTYPE_NESTED_UTDS (current_class_type), name, type);
4699 /* Push a tag name NAME for struct/class/union/enum type TYPE. In case
4700 that the NAME is a class template, the tag is processed but not pushed.
4702 The pushed scope depend on the SCOPE parameter:
4703 - When SCOPE is TS_CURRENT, put it into the inner-most non-sk_cleanup
4705 - When SCOPE is TS_GLOBAL, put it in the inner-most non-class and
4706 non-template-parameter scope. This case is needed for forward
4708 - When SCOPE is TS_WITHIN_ENCLOSING_NON_CLASS, this is similar to
4709 TS_GLOBAL case except that names within template-parameter scopes
4710 are not pushed at all.
4712 Returns TYPE upon success and ERROR_MARK_NODE otherwise. */
4715 pushtag (tree name, tree type, tag_scope scope)
4717 struct cp_binding_level *b;
4720 timevar_push (TV_NAME_LOOKUP);
4721 b = current_binding_level;
4722 while (/* Cleanup scopes are not scopes from the point of view of
4724 b->kind == sk_cleanup
4725 /* Neither are the scopes used to hold template parameters
4726 for an explicit specialization. For an ordinary template
4727 declaration, these scopes are not scopes from the point of
4728 view of the language. */
4729 || (b->kind == sk_template_parms
4730 && (b->explicit_spec_p || scope == ts_global))
4731 || (b->kind == sk_class
4732 && (scope != ts_current
4733 /* We may be defining a new type in the initializer
4734 of a static member variable. We allow this when
4735 not pedantic, and it is particularly useful for
4736 type punning via an anonymous union. */
4737 || COMPLETE_TYPE_P (b->this_entity))))
4740 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
4742 /* Do C++ gratuitous typedefing. */
4743 if (IDENTIFIER_TYPE_VALUE (name) != type)
4747 tree context = TYPE_CONTEXT (type);
4751 tree cs = current_scope ();
4753 if (scope == ts_current)
4755 else if (cs != NULL_TREE && TYPE_P (cs))
4756 /* When declaring a friend class of a local class, we want
4757 to inject the newly named class into the scope
4758 containing the local class, not the namespace
4760 context = decl_function_context (get_type_decl (cs));
4763 context = current_namespace;
4765 if (b->kind == sk_class
4766 || (b->kind == sk_template_parms
4767 && b->level_chain->kind == sk_class))
4770 if (current_lang_name == lang_name_java)
4771 TYPE_FOR_JAVA (type) = 1;
4773 tdef = create_implicit_typedef (name, type);
4774 DECL_CONTEXT (tdef) = FROB_CONTEXT (context);
4775 if (scope == ts_within_enclosing_non_class)
4777 /* This is a friend. Make this TYPE_DECL node hidden from
4778 ordinary name lookup. Its corresponding TEMPLATE_DECL
4779 will be marked in push_template_decl_real. */
4780 retrofit_lang_decl (tdef);
4781 DECL_ANTICIPATED (tdef) = 1;
4782 DECL_FRIEND_P (tdef) = 1;
4785 decl = maybe_process_template_type_declaration
4786 (type, scope == ts_within_enclosing_non_class, b);
4787 if (decl == error_mark_node)
4788 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl);
4791 set_identifier_type_value_with_scope (name, tdef, b);
4793 if (b->kind == sk_class)
4795 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
4796 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
4797 class. But if it's a member template class, we want
4798 the TEMPLATE_DECL, not the TYPE_DECL, so this is done
4800 finish_member_declaration (decl);
4802 pushdecl_class_level (decl);
4804 else if (b->kind != sk_template_parms)
4805 decl = pushdecl_with_scope (decl, b, /*is_friend=*/false);
4807 TYPE_CONTEXT (type) = DECL_CONTEXT (decl);
4809 /* If this is a local class, keep track of it. We need this
4810 information for name-mangling, and so that it is possible to
4811 find all function definitions in a translation unit in a
4812 convenient way. (It's otherwise tricky to find a member
4813 function definition it's only pointed to from within a local
4815 if (TYPE_CONTEXT (type)
4816 && TREE_CODE (TYPE_CONTEXT (type)) == FUNCTION_DECL)
4817 VEC_safe_push (tree, gc, local_classes, type);
4819 if (b->kind == sk_class
4820 && !COMPLETE_TYPE_P (current_class_type))
4822 maybe_add_class_template_decl_list (current_class_type,
4823 type, /*friend_p=*/0);
4825 if (CLASSTYPE_NESTED_UTDS (current_class_type) == NULL)
4826 CLASSTYPE_NESTED_UTDS (current_class_type)
4827 = binding_table_new (SCOPE_DEFAULT_HT_SIZE);
4829 binding_table_insert
4830 (CLASSTYPE_NESTED_UTDS (current_class_type), name, type);
4833 decl = TYPE_NAME (type);
4834 gcc_assert (TREE_CODE (decl) == TYPE_DECL);
4835 TYPE_STUB_DECL (type) = decl;
4837 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, type);
4840 /* Subroutines for reverting temporarily to top-level for instantiation
4841 of templates and such. We actually need to clear out the class- and
4842 local-value slots of all identifiers, so that only the global values
4843 are at all visible. Simply setting current_binding_level to the global
4844 scope isn't enough, because more binding levels may be pushed. */
4845 struct saved_scope *scope_chain;
4847 /* If ID has not already been marked, add an appropriate binding to
4851 store_binding (tree id, VEC(cxx_saved_binding,gc) **old_bindings)
4853 cxx_saved_binding *saved;
4855 if (!id || !IDENTIFIER_BINDING (id))
4858 if (IDENTIFIER_MARKED (id))
4861 IDENTIFIER_MARKED (id) = 1;
4863 saved = VEC_safe_push (cxx_saved_binding, gc, *old_bindings, NULL);
4864 saved->identifier = id;
4865 saved->binding = IDENTIFIER_BINDING (id);
4866 saved->real_type_value = REAL_IDENTIFIER_TYPE_VALUE (id);
4867 IDENTIFIER_BINDING (id) = NULL;
4871 store_bindings (tree names, VEC(cxx_saved_binding,gc) **old_bindings)
4875 timevar_push (TV_NAME_LOOKUP);
4876 for (t = names; t; t = TREE_CHAIN (t))
4880 if (TREE_CODE (t) == TREE_LIST)
4881 id = TREE_PURPOSE (t);
4885 store_binding (id, old_bindings);
4887 timevar_pop (TV_NAME_LOOKUP);
4890 /* Like store_bindings, but NAMES is a vector of cp_class_binding
4891 objects, rather than a TREE_LIST. */
4894 store_class_bindings (VEC(cp_class_binding,gc) *names,
4895 VEC(cxx_saved_binding,gc) **old_bindings)
4898 cp_class_binding *cb;
4900 timevar_push (TV_NAME_LOOKUP);
4901 for (i = 0; VEC_iterate(cp_class_binding, names, i, cb); ++i)
4902 store_binding (cb->identifier, old_bindings);
4903 timevar_pop (TV_NAME_LOOKUP);
4907 push_to_top_level (void)
4909 struct saved_scope *s;
4910 struct cp_binding_level *b;
4911 cxx_saved_binding *sb;
4915 timevar_push (TV_NAME_LOOKUP);
4916 s = GGC_CNEW (struct saved_scope);
4918 b = scope_chain ? current_binding_level : 0;
4920 /* If we're in the middle of some function, save our state. */
4924 push_function_context_to (NULL_TREE);
4929 if (scope_chain && previous_class_level)
4930 store_class_bindings (previous_class_level->class_shadowed,
4933 /* Have to include the global scope, because class-scope decls
4934 aren't listed anywhere useful. */
4935 for (; b; b = b->level_chain)
4939 /* Template IDs are inserted into the global level. If they were
4940 inserted into namespace level, finish_file wouldn't find them
4941 when doing pending instantiations. Therefore, don't stop at
4942 namespace level, but continue until :: . */
4943 if (global_scope_p (b))
4946 store_bindings (b->names, &s->old_bindings);
4947 /* We also need to check class_shadowed to save class-level type
4948 bindings, since pushclass doesn't fill in b->names. */
4949 if (b->kind == sk_class)
4950 store_class_bindings (b->class_shadowed, &s->old_bindings);
4952 /* Unwind type-value slots back to top level. */
4953 for (t = b->type_shadowed; t; t = TREE_CHAIN (t))
4954 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t), TREE_VALUE (t));
4957 for (i = 0; VEC_iterate (cxx_saved_binding, s->old_bindings, i, sb); ++i)
4958 IDENTIFIER_MARKED (sb->identifier) = 0;
4960 s->prev = scope_chain;
4962 s->need_pop_function_context = need_pop;
4963 s->function_decl = current_function_decl;
4964 s->skip_evaluation = skip_evaluation;
4967 current_function_decl = NULL_TREE;
4968 current_lang_base = VEC_alloc (tree, gc, 10);
4969 current_lang_name = lang_name_cplusplus;
4970 current_namespace = global_namespace;
4971 push_class_stack ();
4972 skip_evaluation = 0;
4973 timevar_pop (TV_NAME_LOOKUP);
4977 pop_from_top_level (void)
4979 struct saved_scope *s = scope_chain;
4980 cxx_saved_binding *saved;
4983 timevar_push (TV_NAME_LOOKUP);
4984 /* Clear out class-level bindings cache. */
4985 if (previous_class_level)
4986 invalidate_class_lookup_cache ();
4989 current_lang_base = 0;
4991 scope_chain = s->prev;
4992 for (i = 0; VEC_iterate (cxx_saved_binding, s->old_bindings, i, saved); ++i)
4994 tree id = saved->identifier;
4996 IDENTIFIER_BINDING (id) = saved->binding;
4997 SET_IDENTIFIER_TYPE_VALUE (id, saved->real_type_value);
5000 /* If we were in the middle of compiling a function, restore our
5002 if (s->need_pop_function_context)
5003 pop_function_context_from (NULL_TREE);
5004 current_function_decl = s->function_decl;
5005 skip_evaluation = s->skip_evaluation;
5006 timevar_pop (TV_NAME_LOOKUP);
5009 /* Pop off extraneous binding levels left over due to syntax errors.
5011 We don't pop past namespaces, as they might be valid. */
5014 pop_everything (void)
5016 if (ENABLE_SCOPE_CHECKING)
5017 verbatim ("XXX entering pop_everything ()\n");
5018 while (!toplevel_bindings_p ())
5020 if (current_binding_level->kind == sk_class)
5021 pop_nested_class ();
5025 if (ENABLE_SCOPE_CHECKING)
5026 verbatim ("XXX leaving pop_everything ()\n");
5029 /* Emit debugging information for using declarations and directives.
5030 If input tree is overloaded fn then emit debug info for all
5034 cp_emit_debug_info_for_using (tree t, tree context)
5036 /* Don't try to emit any debug information if we have errors. */
5037 if (sorrycount || errorcount)
5040 /* Ignore this FUNCTION_DECL if it refers to a builtin declaration
5041 of a builtin function. */
5042 if (TREE_CODE (t) == FUNCTION_DECL
5043 && DECL_EXTERNAL (t)
5044 && DECL_BUILT_IN (t))
5047 /* Do not supply context to imported_module_or_decl, if
5048 it is a global namespace. */
5049 if (context == global_namespace)
5050 context = NULL_TREE;
5053 t = BASELINK_FUNCTIONS (t);
5055 /* FIXME: Handle TEMPLATE_DECLs. */
5056 for (t = OVL_CURRENT (t); t; t = OVL_NEXT (t))
5057 if (TREE_CODE (t) != TEMPLATE_DECL)
5058 (*debug_hooks->imported_module_or_decl) (t, context);
5061 #include "gt-cp-name-lookup.h"