1 /* Definitions for C++ name lookup routines.
2 Copyright (C) 2003, 2004, 2005 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, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, 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);
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);
54 static void cp_emit_debug_info_for_using (tree, tree);
56 /* The :: namespace. */
58 tree global_namespace;
60 /* The name of the anonymous namespace, throughout this translation
62 static GTY(()) tree anonymous_namespace_name;
65 /* Compute the chain index of a binding_entry given the HASH value of its
66 name and the total COUNT of chains. COUNT is assumed to be a power
69 #define ENTRY_INDEX(HASH, COUNT) (((HASH) >> 3) & ((COUNT) - 1))
71 /* A free list of "binding_entry"s awaiting for re-use. */
73 static GTY((deletable)) binding_entry free_binding_entry = NULL;
75 /* Create a binding_entry object for (NAME, TYPE). */
77 static inline binding_entry
78 binding_entry_make (tree name, tree type)
82 if (free_binding_entry)
84 entry = free_binding_entry;
85 free_binding_entry = entry->chain;
88 entry = GGC_NEW (struct binding_entry_s);
97 /* Put ENTRY back on the free list. */
100 binding_entry_free (binding_entry entry)
104 entry->chain = free_binding_entry;
105 free_binding_entry = entry;
109 /* The datatype used to implement the mapping from names to types at
111 struct binding_table_s GTY(())
113 /* Array of chains of "binding_entry"s */
114 binding_entry * GTY((length ("%h.chain_count"))) chain;
116 /* The number of chains in this table. This is the length of the
117 the member "chain" considered as an array. */
120 /* Number of "binding_entry"s in this table. */
124 /* Construct TABLE with an initial CHAIN_COUNT. */
127 binding_table_construct (binding_table table, size_t chain_count)
129 table->chain_count = chain_count;
130 table->entry_count = 0;
131 table->chain = GGC_CNEWVEC (binding_entry, table->chain_count);
134 /* Make TABLE's entries ready for reuse. */
137 binding_table_free (binding_table table)
145 for (i = 0, count = table->chain_count; i < count; ++i)
147 binding_entry temp = table->chain[i];
150 binding_entry entry = temp;
152 binding_entry_free (entry);
154 table->chain[i] = NULL;
156 table->entry_count = 0;
160 /* Allocate a table with CHAIN_COUNT, assumed to be a power of two. */
162 static inline binding_table
163 binding_table_new (size_t chain_count)
165 binding_table table = GGC_NEW (struct binding_table_s);
167 binding_table_construct (table, chain_count);
171 /* Expand TABLE to twice its current chain_count. */
174 binding_table_expand (binding_table table)
176 const size_t old_chain_count = table->chain_count;
177 const size_t old_entry_count = table->entry_count;
178 const size_t new_chain_count = 2 * old_chain_count;
179 binding_entry *old_chains = table->chain;
182 binding_table_construct (table, new_chain_count);
183 for (i = 0; i < old_chain_count; ++i)
185 binding_entry entry = old_chains[i];
186 for (; entry != NULL; entry = old_chains[i])
188 const unsigned int hash = IDENTIFIER_HASH_VALUE (entry->name);
189 const size_t j = ENTRY_INDEX (hash, new_chain_count);
191 old_chains[i] = entry->chain;
192 entry->chain = table->chain[j];
193 table->chain[j] = entry;
196 table->entry_count = old_entry_count;
199 /* Insert a binding for NAME to TYPE into TABLE. */
202 binding_table_insert (binding_table table, tree name, tree type)
204 const unsigned int hash = IDENTIFIER_HASH_VALUE (name);
205 const size_t i = ENTRY_INDEX (hash, table->chain_count);
206 binding_entry entry = binding_entry_make (name, type);
208 entry->chain = table->chain[i];
209 table->chain[i] = entry;
210 ++table->entry_count;
212 if (3 * table->chain_count < 5 * table->entry_count)
213 binding_table_expand (table);
216 /* Return the binding_entry, if any, that maps NAME. */
219 binding_table_find (binding_table table, tree name)
221 const unsigned int hash = IDENTIFIER_HASH_VALUE (name);
222 binding_entry entry = table->chain[ENTRY_INDEX (hash, table->chain_count)];
224 while (entry != NULL && entry->name != name)
225 entry = entry->chain;
230 /* Apply PROC -- with DATA -- to all entries in TABLE. */
233 binding_table_foreach (binding_table table, bt_foreach_proc proc, void *data)
235 const size_t chain_count = table->chain_count;
238 for (i = 0; i < chain_count; ++i)
240 binding_entry entry = table->chain[i];
241 for (; entry != NULL; entry = entry->chain)
246 #ifndef ENABLE_SCOPE_CHECKING
247 # define ENABLE_SCOPE_CHECKING 0
249 # define ENABLE_SCOPE_CHECKING 1
252 /* A free list of "cxx_binding"s, connected by their PREVIOUS. */
254 static GTY((deletable)) cxx_binding *free_bindings;
256 /* Initialize VALUE and TYPE field for BINDING, and set the PREVIOUS
260 cxx_binding_init (cxx_binding *binding, tree value, tree type)
262 binding->value = value;
263 binding->type = type;
264 binding->previous = NULL;
267 /* (GC)-allocate a binding object with VALUE and TYPE member initialized. */
270 cxx_binding_make (tree value, tree type)
272 cxx_binding *binding;
275 binding = free_bindings;
276 free_bindings = binding->previous;
279 binding = GGC_NEW (cxx_binding);
281 cxx_binding_init (binding, value, type);
286 /* Put BINDING back on the free list. */
289 cxx_binding_free (cxx_binding *binding)
291 binding->scope = NULL;
292 binding->previous = free_bindings;
293 free_bindings = binding;
296 /* Create a new binding for NAME (with the indicated VALUE and TYPE
297 bindings) in the class scope indicated by SCOPE. */
300 new_class_binding (tree name, tree value, tree type, cxx_scope *scope)
302 cp_class_binding *cb;
303 cxx_binding *binding;
305 if (VEC_length (cp_class_binding, scope->class_shadowed))
307 cp_class_binding *old_base;
308 old_base = VEC_index (cp_class_binding, scope->class_shadowed, 0);
309 if (VEC_reserve (cp_class_binding, scope->class_shadowed, -1))
311 /* Fixup the current bindings, as they might have moved. */
315 VEC_iterate (cp_class_binding, scope->class_shadowed, i, cb);
319 b = &IDENTIFIER_BINDING (cb->identifier);
320 while (*b != &old_base[i].base)
321 b = &((*b)->previous);
325 cb = VEC_quick_push (cp_class_binding, scope->class_shadowed, NULL);
328 cb = VEC_safe_push (cp_class_binding, scope->class_shadowed, NULL);
330 cb->identifier = name;
332 binding->scope = scope;
333 cxx_binding_init (binding, value, type);
337 /* Make DECL the innermost binding for ID. The LEVEL is the binding
338 level at which this declaration is being bound. */
341 push_binding (tree id, tree decl, cxx_scope* level)
343 cxx_binding *binding;
345 if (level != class_binding_level)
347 binding = cxx_binding_make (decl, NULL_TREE);
348 binding->scope = level;
351 binding = new_class_binding (id, decl, /*type=*/NULL_TREE, level);
353 /* Now, fill in the binding information. */
354 binding->previous = IDENTIFIER_BINDING (id);
355 INHERITED_VALUE_BINDING_P (binding) = 0;
356 LOCAL_BINDING_P (binding) = (level != class_binding_level);
358 /* And put it on the front of the list of bindings for ID. */
359 IDENTIFIER_BINDING (id) = binding;
362 /* Remove the binding for DECL which should be the innermost binding
366 pop_binding (tree id, tree decl)
368 cxx_binding *binding;
371 /* It's easiest to write the loops that call this function without
372 checking whether or not the entities involved have names. We
373 get here for such an entity. */
376 /* Get the innermost binding for ID. */
377 binding = IDENTIFIER_BINDING (id);
379 /* The name should be bound. */
380 gcc_assert (binding != NULL);
382 /* The DECL will be either the ordinary binding or the type
383 binding for this identifier. Remove that binding. */
384 if (binding->value == decl)
385 binding->value = NULL_TREE;
388 gcc_assert (binding->type == decl);
389 binding->type = NULL_TREE;
392 if (!binding->value && !binding->type)
394 /* We're completely done with the innermost binding for this
395 identifier. Unhook it from the list of bindings. */
396 IDENTIFIER_BINDING (id) = binding->previous;
398 /* Add it to the free list. */
399 cxx_binding_free (binding);
403 /* BINDING records an existing declaration for a namein the current scope.
404 But, DECL is another declaration for that same identifier in the
405 same scope. This is the `struct stat' hack whereby a non-typedef
406 class name or enum-name can be bound at the same level as some other
410 A class name (9.1) or enumeration name (7.2) can be hidden by the
411 name of an object, function, or enumerator declared in the same scope.
412 If a class or enumeration name and an object, function, or enumerator
413 are declared in the same scope (in any order) with the same name, the
414 class or enumeration name is hidden wherever the object, function, or
415 enumerator name is visible.
417 It's the responsibility of the caller to check that
418 inserting this name is valid here. Returns nonzero if the new binding
422 supplement_binding (cxx_binding *binding, tree decl)
424 tree bval = binding->value;
427 timevar_push (TV_NAME_LOOKUP);
428 if (TREE_CODE (decl) == TYPE_DECL && DECL_ARTIFICIAL (decl))
429 /* The new name is the type name. */
430 binding->type = decl;
431 else if (/* BVAL is null when push_class_level_binding moves an
432 inherited type-binding out of the way to make room for a
433 new value binding. */
435 /* BVAL is error_mark_node when DECL's name has been used
436 in a non-class scope prior declaration. In that case,
437 we should have already issued a diagnostic; for graceful
438 error recovery purpose, pretend this was the intended
439 declaration for that name. */
440 || bval == error_mark_node
441 /* If BVAL is a built-in that has not yet been declared,
442 pretend it is not there at all. */
443 || (TREE_CODE (bval) == FUNCTION_DECL
444 && DECL_ANTICIPATED (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);
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 cp_error_at ("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 VARRAY_PUSH_TREE (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).
557 Returns either X or an old decl for the same name.
558 If an old decl is returned, it may have been smashed
559 to agree with what X says. */
566 int need_new_binding;
568 timevar_push (TV_NAME_LOOKUP);
570 need_new_binding = 1;
572 if (DECL_TEMPLATE_PARM_P (x))
573 /* Template parameters have no context; they are not X::T even
574 when declared within a class or namespace. */
578 if (current_function_decl && x != current_function_decl
579 /* A local declaration for a function doesn't constitute
581 && TREE_CODE (x) != FUNCTION_DECL
582 /* A local declaration for an `extern' variable is in the
583 scope of the current namespace, not the current
585 && !(TREE_CODE (x) == VAR_DECL && DECL_EXTERNAL (x))
586 && !DECL_CONTEXT (x))
587 DECL_CONTEXT (x) = current_function_decl;
589 /* If this is the declaration for a namespace-scope function,
590 but the declaration itself is in a local scope, mark the
592 if (TREE_CODE (x) == FUNCTION_DECL
593 && DECL_NAMESPACE_SCOPE_P (x)
594 && current_function_decl
595 && x != current_function_decl)
596 DECL_LOCAL_FUNCTION_P (x) = 1;
599 name = DECL_NAME (x);
602 int different_binding_level = 0;
604 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
605 name = TREE_OPERAND (name, 0);
607 /* In case this decl was explicitly namespace-qualified, look it
608 up in its namespace context. */
609 if (DECL_NAMESPACE_SCOPE_P (x) && namespace_bindings_p ())
610 t = namespace_binding (name, DECL_CONTEXT (x));
612 t = lookup_name_innermost_nonclass_level (name);
614 /* [basic.link] If there is a visible declaration of an entity
615 with linkage having the same name and type, ignoring entities
616 declared outside the innermost enclosing namespace scope, the
617 block scope declaration declares that same entity and
618 receives the linkage of the previous declaration. */
619 if (! t && current_function_decl && x != current_function_decl
620 && (TREE_CODE (x) == FUNCTION_DECL || TREE_CODE (x) == VAR_DECL)
621 && DECL_EXTERNAL (x))
623 /* Look in block scope. */
624 t = innermost_non_namespace_value (name);
625 /* Or in the innermost namespace. */
627 t = namespace_binding (name, DECL_CONTEXT (x));
628 /* Does it have linkage? Note that if this isn't a DECL, it's an
629 OVERLOAD, which is OK. */
630 if (t && DECL_P (t) && ! (TREE_STATIC (t) || DECL_EXTERNAL (t)))
633 different_binding_level = 1;
636 /* If we are declaring a function, and the result of name-lookup
637 was an OVERLOAD, look for an overloaded instance that is
638 actually the same as the function we are declaring. (If
639 there is one, we have to merge our declaration with the
640 previous declaration.) */
641 if (t && TREE_CODE (t) == OVERLOAD)
645 if (TREE_CODE (x) == FUNCTION_DECL)
646 for (match = t; match; match = OVL_NEXT (match))
648 if (decls_match (OVL_CURRENT (match), x))
652 /* Just choose one. */
656 t = OVL_CURRENT (match);
661 if (t && t != error_mark_node)
663 if (different_binding_level)
665 if (decls_match (x, t))
666 /* The standard only says that the local extern
667 inherits linkage from the previous decl; in
668 particular, default args are not shared. We must
669 also tell cgraph to treat these decls as the same,
670 or we may neglect to emit an "unused" static - we
671 do this by making the DECL_UIDs equal, which should
672 be viewed as a kludge. FIXME. */
674 TREE_PUBLIC (x) = TREE_PUBLIC (t);
675 DECL_UID (x) = DECL_UID (t);
678 else if (TREE_CODE (t) == PARM_DECL)
680 gcc_assert (DECL_CONTEXT (t));
682 /* Check for duplicate params. */
683 if (duplicate_decls (x, t))
684 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
686 else if ((DECL_EXTERN_C_FUNCTION_P (x)
687 || DECL_FUNCTION_TEMPLATE_P (x))
688 && is_overloaded_fn (t))
689 /* Don't do anything just yet. */;
690 else if (t == wchar_decl_node)
692 if (pedantic && ! DECL_IN_SYSTEM_HEADER (x))
693 pedwarn ("redeclaration of %<wchar_t%> as %qT",
696 /* Throw away the redeclaration. */
697 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
701 tree olddecl = duplicate_decls (x, t);
703 /* If the redeclaration failed, we can stop at this
705 if (olddecl == error_mark_node)
706 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
710 if (TREE_CODE (t) == TYPE_DECL)
711 SET_IDENTIFIER_TYPE_VALUE (name, TREE_TYPE (t));
712 else if (TREE_CODE (t) == FUNCTION_DECL)
713 check_default_args (t);
715 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
717 else if (DECL_MAIN_P (x) && TREE_CODE (t) == FUNCTION_DECL)
719 /* A redeclaration of main, but not a duplicate of the
724 This function shall not be overloaded. */
725 cp_error_at ("invalid redeclaration of %qD", t);
727 /* We don't try to push this declaration since that
729 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, x);
734 check_template_shadow (x);
736 /* If this is a function conjured up by the backend, massage it
737 so it looks friendly. */
738 if (DECL_NON_THUNK_FUNCTION_P (x) && ! DECL_LANG_SPECIFIC (x))
740 retrofit_lang_decl (x);
741 SET_DECL_LANGUAGE (x, lang_c);
744 if (DECL_NON_THUNK_FUNCTION_P (x) && ! DECL_FUNCTION_MEMBER_P (x))
746 t = push_overloaded_decl (x, PUSH_LOCAL);
748 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
749 if (!namespace_bindings_p ())
750 /* We do not need to create a binding for this name;
751 push_overloaded_decl will have already done so if
753 need_new_binding = 0;
755 else if (DECL_FUNCTION_TEMPLATE_P (x) && DECL_NAMESPACE_SCOPE_P (x))
757 t = push_overloaded_decl (x, PUSH_GLOBAL);
759 add_decl_to_level (x, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t)));
760 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
763 /* If declaring a type as a typedef, copy the type (unless we're
764 at line 0), and install this TYPE_DECL as the new type's typedef
765 name. See the extensive comment in ../c-decl.c (pushdecl). */
766 if (TREE_CODE (x) == TYPE_DECL)
768 tree type = TREE_TYPE (x);
769 if (DECL_IS_BUILTIN (x))
771 if (TYPE_NAME (type) == 0)
772 TYPE_NAME (type) = x;
774 else if (type != error_mark_node && TYPE_NAME (type) != x
775 /* We don't want to copy the type when all we're
776 doing is making a TYPE_DECL for the purposes of
778 && (!TYPE_NAME (type)
779 || TYPE_NAME (type) != DECL_ABSTRACT_ORIGIN (x)))
781 DECL_ORIGINAL_TYPE (x) = type;
782 type = build_variant_type_copy (type);
783 TYPE_STUB_DECL (type) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x));
784 TYPE_NAME (type) = x;
785 TREE_TYPE (x) = type;
788 if (type != error_mark_node
790 && TYPE_IDENTIFIER (type))
791 set_identifier_type_value (DECL_NAME (x), x);
794 /* Multiple external decls of the same identifier ought to match.
796 We get warnings about inline functions where they are defined.
797 We get warnings about other functions from push_overloaded_decl.
799 Avoid duplicate warnings where they are used. */
800 if (TREE_PUBLIC (x) && TREE_CODE (x) != FUNCTION_DECL)
804 decl = IDENTIFIER_NAMESPACE_VALUE (name);
805 if (decl && TREE_CODE (decl) == OVERLOAD)
806 decl = OVL_FUNCTION (decl);
808 if (decl && decl != error_mark_node
809 && (DECL_EXTERNAL (decl) || TREE_PUBLIC (decl))
810 /* If different sort of thing, we already gave an error. */
811 && TREE_CODE (decl) == TREE_CODE (x)
812 && !same_type_p (TREE_TYPE (x), TREE_TYPE (decl)))
814 pedwarn ("type mismatch with previous external decl of %q#D", x);
815 cp_pedwarn_at ("previous external decl of %q#D", decl);
819 /* This name is new in its binding level.
820 Install the new declaration and return it. */
821 if (namespace_bindings_p ())
823 /* Install a global value. */
825 /* If the first global decl has external linkage,
826 warn if we later see static one. */
827 if (IDENTIFIER_GLOBAL_VALUE (name) == NULL_TREE && TREE_PUBLIC (x))
828 TREE_PUBLIC (name) = 1;
830 /* Bind the name for the entity. */
831 if (!(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)
833 && (TREE_CODE (x) == TYPE_DECL
834 || TREE_CODE (x) == VAR_DECL
835 || TREE_CODE (x) == ALIAS_DECL
836 || TREE_CODE (x) == NAMESPACE_DECL
837 || TREE_CODE (x) == CONST_DECL
838 || TREE_CODE (x) == TEMPLATE_DECL))
839 SET_IDENTIFIER_NAMESPACE_VALUE (name, x);
841 /* If new decl is `static' and an `extern' was seen previously,
843 if (x != NULL_TREE && t != NULL_TREE && decls_match (x, t))
844 warn_extern_redeclared_static (x, t);
848 /* Here to install a non-global value. */
849 tree oldlocal = innermost_non_namespace_value (name);
850 tree oldglobal = IDENTIFIER_NAMESPACE_VALUE (name);
852 if (need_new_binding)
854 push_local_binding (name, x, 0);
855 /* Because push_local_binding will hook X on to the
856 current_binding_level's name list, we don't want to
857 do that again below. */
858 need_new_binding = 0;
861 /* If this is a TYPE_DECL, push it into the type value slot. */
862 if (TREE_CODE (x) == TYPE_DECL)
863 set_identifier_type_value (name, x);
865 /* Clear out any TYPE_DECL shadowed by a namespace so that
866 we won't think this is a type. The C struct hack doesn't
867 go through namespaces. */
868 if (TREE_CODE (x) == NAMESPACE_DECL)
869 set_identifier_type_value (name, NULL_TREE);
876 && TREE_CODE (oldlocal) == VAR_DECL
877 && DECL_DEAD_FOR_LOCAL (oldlocal))
878 oldlocal = DECL_SHADOWED_FOR_VAR (oldlocal);
880 if (oldlocal == NULL_TREE)
881 oldlocal = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d));
884 /* If this is an extern function declaration, see if we
885 have a global definition or declaration for the function. */
886 if (oldlocal == NULL_TREE
888 && oldglobal != NULL_TREE
889 && TREE_CODE (x) == FUNCTION_DECL
890 && TREE_CODE (oldglobal) == FUNCTION_DECL)
892 /* We have one. Their types must agree. */
893 if (decls_match (x, oldglobal))
897 warning ("extern declaration of %q#D doesn't match", x);
898 cp_warning_at ("global declaration %q#D", oldglobal);
901 /* If we have a local external declaration,
902 and no file-scope declaration has yet been seen,
903 then if we later have a file-scope decl it must not be static. */
904 if (oldlocal == NULL_TREE
905 && oldglobal == NULL_TREE
908 TREE_PUBLIC (name) = 1;
910 /* Warn if shadowing an argument at the top level of the body. */
911 if (oldlocal != NULL_TREE && !DECL_EXTERNAL (x)
912 /* Inline decls shadow nothing. */
913 && !DECL_FROM_INLINE (x)
914 && TREE_CODE (oldlocal) == PARM_DECL
915 /* Don't check the `this' parameter. */
916 && !DECL_ARTIFICIAL (oldlocal))
920 /* Don't complain if it's from an enclosing function. */
921 if (DECL_CONTEXT (oldlocal) == current_function_decl
922 && TREE_CODE (x) != PARM_DECL)
924 /* Go to where the parms should be and see if we find
926 struct cp_binding_level *b = current_binding_level->level_chain;
928 /* Skip the ctor/dtor cleanup level. */
932 if (b->kind == sk_function_parms)
934 error ("declaration of %q#D shadows a parameter", x);
939 if (warn_shadow && !err)
941 warning ("declaration of %q#D shadows a parameter", x);
942 warning ("%Jshadowed declaration is here", oldlocal);
946 /* Maybe warn if shadowing something else. */
947 else if (warn_shadow && !DECL_EXTERNAL (x)
948 /* No shadow warnings for internally generated vars. */
949 && ! DECL_ARTIFICIAL (x)
950 /* No shadow warnings for vars made for inlining. */
951 && ! DECL_FROM_INLINE (x))
955 if (current_class_ptr)
956 member = lookup_member (current_class_type,
959 /*want_type=*/false);
963 if (member && !TREE_STATIC (member))
965 /* Location of previous decl is not useful in this case. */
966 warning ("declaration of %qD shadows a member of 'this'",
969 else if (oldlocal != NULL_TREE
970 && TREE_CODE (oldlocal) == VAR_DECL)
972 warning ("declaration of %qD shadows a previous local", x);
973 warning ("%Jshadowed declaration is here", oldlocal);
975 else if (oldglobal != NULL_TREE
976 && TREE_CODE (oldglobal) == VAR_DECL)
977 /* XXX shadow warnings in outer-more namespaces */
979 warning ("declaration of %qD shadows a global declaration",
981 warning ("%Jshadowed declaration is here", oldglobal);
986 if (TREE_CODE (x) == FUNCTION_DECL)
987 check_default_args (x);
989 if (TREE_CODE (x) == VAR_DECL)
990 maybe_register_incomplete_var (x);
993 if (need_new_binding)
994 add_decl_to_level (x,
995 DECL_NAMESPACE_SCOPE_P (x)
996 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x))
997 : current_binding_level);
999 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, x);
1002 /* Enter DECL into the symbol table, if that's appropriate. Returns
1003 DECL, or a modified version thereof. */
1006 maybe_push_decl (tree decl)
1008 tree type = TREE_TYPE (decl);
1010 /* Add this decl to the current binding level, but not if it comes
1011 from another scope, e.g. a static member variable. TEM may equal
1012 DECL or it may be a previous decl of the same name. */
1013 if (decl == error_mark_node
1014 || (TREE_CODE (decl) != PARM_DECL
1015 && DECL_CONTEXT (decl) != NULL_TREE
1016 /* Definitions of namespace members outside their namespace are
1018 && TREE_CODE (DECL_CONTEXT (decl)) != NAMESPACE_DECL)
1019 || (TREE_CODE (decl) == TEMPLATE_DECL && !namespace_bindings_p ())
1020 || TREE_CODE (type) == UNKNOWN_TYPE
1021 /* The declaration of a template specialization does not affect
1022 the functions available for overload resolution, so we do not
1024 || (TREE_CODE (decl) == FUNCTION_DECL
1025 && DECL_TEMPLATE_SPECIALIZATION (decl)))
1028 return pushdecl (decl);
1031 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1032 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1033 doesn't really belong to this binding level, that it got here
1034 through a using-declaration. */
1037 push_local_binding (tree id, tree decl, int flags)
1039 struct cp_binding_level *b;
1041 /* Skip over any local classes. This makes sense if we call
1042 push_local_binding with a friend decl of a local class. */
1043 b = innermost_nonclass_level ();
1045 if (lookup_name_innermost_nonclass_level (id))
1047 /* Supplement the existing binding. */
1048 if (!supplement_binding (IDENTIFIER_BINDING (id), decl))
1049 /* It didn't work. Something else must be bound at this
1050 level. Do not add DECL to the list of things to pop
1055 /* Create a new binding. */
1056 push_binding (id, decl, b);
1058 if (TREE_CODE (decl) == OVERLOAD || (flags & PUSH_USING))
1059 /* We must put the OVERLOAD into a TREE_LIST since the
1060 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1061 decls that got here through a using-declaration. */
1062 decl = build_tree_list (NULL_TREE, decl);
1064 /* And put DECL on the list of things declared by the current
1066 add_decl_to_level (decl, b);
1069 /* Check to see whether or not DECL is a variable that would have been
1070 in scope under the ARM, but is not in scope under the ANSI/ISO
1071 standard. If so, issue an error message. If name lookup would
1072 work in both cases, but return a different result, this function
1073 returns the result of ANSI/ISO lookup. Otherwise, it returns
1077 check_for_out_of_scope_variable (tree decl)
1081 /* We only care about out of scope variables. */
1082 if (!(TREE_CODE (decl) == VAR_DECL && DECL_DEAD_FOR_LOCAL (decl)))
1085 shadowed = DECL_SHADOWED_FOR_VAR (decl);
1086 while (shadowed != NULL_TREE && TREE_CODE (shadowed) == VAR_DECL
1087 && DECL_DEAD_FOR_LOCAL (shadowed))
1088 shadowed = DECL_SHADOWED_FOR_VAR (shadowed);
1090 shadowed = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (decl));
1093 if (!DECL_ERROR_REPORTED (decl))
1095 warning ("name lookup of %qD changed", DECL_NAME (decl));
1096 cp_warning_at (" matches this %qD under ISO standard rules",
1098 cp_warning_at (" matches this %qD under old rules", decl);
1099 DECL_ERROR_REPORTED (decl) = 1;
1104 /* If we have already complained about this declaration, there's no
1105 need to do it again. */
1106 if (DECL_ERROR_REPORTED (decl))
1109 DECL_ERROR_REPORTED (decl) = 1;
1111 if (TREE_TYPE (decl) == error_mark_node)
1114 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
1116 error ("name lookup of %qD changed for new ISO %<for%> scoping",
1118 cp_error_at (" cannot use obsolete binding at %qD because "
1119 "it has a destructor", decl);
1120 return error_mark_node;
1124 pedwarn ("name lookup of %qD changed for new ISO %<for%> scoping",
1126 cp_pedwarn_at (" using obsolete binding at %qD", decl);
1132 /* true means unconditionally make a BLOCK for the next level pushed. */
1134 static bool keep_next_level_flag;
1136 static int binding_depth = 0;
1137 static int is_class_level = 0;
1144 for (i = 0; i < depth * 2; i++)
1148 /* Return a string describing the kind of SCOPE we have. */
1150 cxx_scope_descriptor (cxx_scope *scope)
1152 /* The order of this table must match the "scope_kind"
1154 static const char* scope_kind_names[] = {
1160 "function-parameter-scope",
1163 "template-parameter-scope",
1164 "template-explicit-spec-scope"
1166 const scope_kind kind = scope->explicit_spec_p
1167 ? sk_template_spec : scope->kind;
1169 return scope_kind_names[kind];
1172 /* Output a debugging information about SCOPE when performing
1175 cxx_scope_debug (cxx_scope *scope, int line, const char *action)
1177 const char *desc = cxx_scope_descriptor (scope);
1178 if (scope->this_entity)
1179 verbatim ("%s %s(%E) %p %d\n", action, desc,
1180 scope->this_entity, (void *) scope, line);
1182 verbatim ("%s %s %p %d\n", action, desc, (void *) scope, line);
1185 /* Return the estimated initial size of the hashtable of a NAMESPACE
1188 static inline size_t
1189 namespace_scope_ht_size (tree ns)
1191 tree name = DECL_NAME (ns);
1193 return name == std_identifier
1194 ? NAMESPACE_STD_HT_SIZE
1195 : (name == global_scope_name
1196 ? GLOBAL_SCOPE_HT_SIZE
1197 : NAMESPACE_ORDINARY_HT_SIZE);
1200 /* A chain of binding_level structures awaiting reuse. */
1202 static GTY((deletable)) struct cp_binding_level *free_binding_level;
1204 /* Insert SCOPE as the innermost binding level. */
1207 push_binding_level (struct cp_binding_level *scope)
1209 /* Add it to the front of currently active scopes stack. */
1210 scope->level_chain = current_binding_level;
1211 current_binding_level = scope;
1212 keep_next_level_flag = false;
1214 if (ENABLE_SCOPE_CHECKING)
1216 scope->binding_depth = binding_depth;
1217 indent (binding_depth);
1218 cxx_scope_debug (scope, input_line, "push");
1224 /* Create a new KIND scope and make it the top of the active scopes stack.
1225 ENTITY is the scope of the associated C++ entity (namespace, class,
1226 function); it is NULL otherwise. */
1229 begin_scope (scope_kind kind, tree entity)
1233 /* Reuse or create a struct for this binding level. */
1234 if (!ENABLE_SCOPE_CHECKING && free_binding_level)
1236 scope = free_binding_level;
1237 free_binding_level = scope->level_chain;
1240 scope = GGC_NEW (cxx_scope);
1241 memset (scope, 0, sizeof (cxx_scope));
1243 scope->this_entity = entity;
1244 scope->more_cleanups_ok = true;
1251 case sk_template_spec:
1252 scope->explicit_spec_p = true;
1253 kind = sk_template_parms;
1255 case sk_template_parms:
1261 case sk_function_parms:
1262 scope->keep = keep_next_level_flag;
1266 NAMESPACE_LEVEL (entity) = scope;
1267 VARRAY_TREE_INIT (scope->static_decls,
1268 DECL_NAME (entity) == std_identifier
1269 || DECL_NAME (entity) == global_scope_name
1271 "Static declarations");
1275 /* Should not happen. */
1281 push_binding_level (scope);
1286 /* We're about to leave current scope. Pop the top of the stack of
1287 currently active scopes. Return the enclosing scope, now active. */
1292 cxx_scope *scope = current_binding_level;
1294 if (scope->kind == sk_namespace && class_binding_level)
1295 current_binding_level = class_binding_level;
1297 /* We cannot leave a scope, if there are none left. */
1298 if (NAMESPACE_LEVEL (global_namespace))
1299 gcc_assert (!global_scope_p (scope));
1301 if (ENABLE_SCOPE_CHECKING)
1303 indent (--binding_depth);
1304 cxx_scope_debug (scope, input_line, "leave");
1305 if (is_class_level != (scope == class_binding_level))
1307 indent (binding_depth);
1308 verbatim ("XXX is_class_level != (current_scope == class_scope)\n");
1313 /* Move one nesting level up. */
1314 current_binding_level = scope->level_chain;
1316 /* Namespace-scopes are left most probably temporarily, not
1317 completely; they can be reopen later, e.g. in namespace-extension
1318 or any name binding activity that requires us to resume a
1319 namespace. For classes, we cache some binding levels. For other
1320 scopes, we just make the structure available for reuse. */
1321 if (scope->kind != sk_namespace
1322 && scope->kind != sk_class)
1324 scope->level_chain = free_binding_level;
1325 gcc_assert (!ENABLE_SCOPE_CHECKING
1326 || scope->binding_depth == binding_depth);
1327 free_binding_level = scope;
1330 /* Find the innermost enclosing class scope, and reset
1331 CLASS_BINDING_LEVEL appropriately. */
1332 if (scope->kind == sk_class)
1334 class_binding_level = NULL;
1335 for (scope = current_binding_level; scope; scope = scope->level_chain)
1336 if (scope->kind == sk_class)
1338 class_binding_level = scope;
1343 return current_binding_level;
1347 resume_scope (struct cp_binding_level* b)
1349 /* Resuming binding levels is meant only for namespaces,
1350 and those cannot nest into classes. */
1351 gcc_assert (!class_binding_level);
1352 /* Also, resuming a non-directly nested namespace is a no-no. */
1353 gcc_assert (b->level_chain == current_binding_level);
1354 current_binding_level = b;
1355 if (ENABLE_SCOPE_CHECKING)
1357 b->binding_depth = binding_depth;
1358 indent (binding_depth);
1359 cxx_scope_debug (b, input_line, "resume");
1365 /* Return the innermost binding level that is not for a class scope. */
1368 innermost_nonclass_level (void)
1372 b = current_binding_level;
1373 while (b->kind == sk_class)
1379 /* We're defining an object of type TYPE. If it needs a cleanup, but
1380 we're not allowed to add any more objects with cleanups to the current
1381 scope, create a new binding level. */
1384 maybe_push_cleanup_level (tree type)
1386 if (type != error_mark_node
1387 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
1388 && current_binding_level->more_cleanups_ok == 0)
1390 begin_scope (sk_cleanup, NULL);
1391 current_binding_level->statement_list = push_stmt_list ();
1395 /* Nonzero if we are currently in the global binding level. */
1398 global_bindings_p (void)
1400 return global_scope_p (current_binding_level);
1403 /* True if we are currently in a toplevel binding level. This
1404 means either the global binding level or a namespace in a toplevel
1405 binding level. Since there are no non-toplevel namespace levels,
1406 this really means any namespace or template parameter level. We
1407 also include a class whose context is toplevel. */
1410 toplevel_bindings_p (void)
1412 struct cp_binding_level *b = innermost_nonclass_level ();
1414 return b->kind == sk_namespace || b->kind == sk_template_parms;
1417 /* True if this is a namespace scope, or if we are defining a class
1418 which is itself at namespace scope, or whose enclosing class is
1419 such a class, etc. */
1422 namespace_bindings_p (void)
1424 struct cp_binding_level *b = innermost_nonclass_level ();
1426 return b->kind == sk_namespace;
1429 /* True if the current level needs to have a BLOCK made. */
1434 return (current_binding_level->blocks != NULL_TREE
1435 || current_binding_level->keep
1436 || current_binding_level->kind == sk_cleanup
1437 || current_binding_level->names != NULL_TREE);
1440 /* Returns the kind of the innermost scope. */
1443 innermost_scope_kind (void)
1445 return current_binding_level->kind;
1448 /* Returns true if this scope was created to store template parameters. */
1451 template_parm_scope_p (void)
1453 return innermost_scope_kind () == sk_template_parms;
1456 /* If KEEP is true, make a BLOCK node for the next binding level,
1457 unconditionally. Otherwise, use the normal logic to decide whether
1458 or not to create a BLOCK. */
1461 keep_next_level (bool keep)
1463 keep_next_level_flag = keep;
1466 /* Return the list of declarations of the current level.
1467 Note that this list is in reverse order unless/until
1468 you nreverse it; and when you do nreverse it, you must
1469 store the result back using `storedecls' or you will lose. */
1474 return current_binding_level->names;
1477 /* For debugging. */
1478 static int no_print_functions = 0;
1479 static int no_print_builtins = 0;
1482 print_binding_level (struct cp_binding_level* lvl)
1486 fprintf (stderr, " blocks=" HOST_PTR_PRINTF, (void *) lvl->blocks);
1487 if (lvl->more_cleanups_ok)
1488 fprintf (stderr, " more-cleanups-ok");
1489 if (lvl->have_cleanups)
1490 fprintf (stderr, " have-cleanups");
1491 fprintf (stderr, "\n");
1494 fprintf (stderr, " names:\t");
1495 /* We can probably fit 3 names to a line? */
1496 for (t = lvl->names; t; t = TREE_CHAIN (t))
1498 if (no_print_functions && (TREE_CODE (t) == FUNCTION_DECL))
1500 if (no_print_builtins
1501 && (TREE_CODE (t) == TYPE_DECL)
1502 && DECL_IS_BUILTIN (t))
1505 /* Function decls tend to have longer names. */
1506 if (TREE_CODE (t) == FUNCTION_DECL)
1513 fprintf (stderr, "\n\t");
1516 print_node_brief (stderr, "", t, 0);
1517 if (t == error_mark_node)
1521 fprintf (stderr, "\n");
1523 if (VEC_length (cp_class_binding, lvl->class_shadowed))
1526 cp_class_binding *b;
1527 fprintf (stderr, " class-shadowed:");
1529 VEC_iterate(cp_class_binding, lvl->class_shadowed, i, b);
1531 fprintf (stderr, " %s ", IDENTIFIER_POINTER (b->identifier));
1532 fprintf (stderr, "\n");
1534 if (lvl->type_shadowed)
1536 fprintf (stderr, " type-shadowed:");
1537 for (t = lvl->type_shadowed; t; t = TREE_CHAIN (t))
1539 fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t)));
1541 fprintf (stderr, "\n");
1546 print_other_binding_stack (struct cp_binding_level *stack)
1548 struct cp_binding_level *level;
1549 for (level = stack; !global_scope_p (level); level = level->level_chain)
1551 fprintf (stderr, "binding level " HOST_PTR_PRINTF "\n", (void *) level);
1552 print_binding_level (level);
1557 print_binding_stack (void)
1559 struct cp_binding_level *b;
1560 fprintf (stderr, "current_binding_level=" HOST_PTR_PRINTF
1561 "\nclass_binding_level=" HOST_PTR_PRINTF
1562 "\nNAMESPACE_LEVEL (global_namespace)=" HOST_PTR_PRINTF "\n",
1563 (void *) current_binding_level, (void *) class_binding_level,
1564 (void *) NAMESPACE_LEVEL (global_namespace));
1565 if (class_binding_level)
1567 for (b = class_binding_level; b; b = b->level_chain)
1568 if (b == current_binding_level)
1571 b = class_binding_level;
1573 b = current_binding_level;
1576 b = current_binding_level;
1577 print_other_binding_stack (b);
1578 fprintf (stderr, "global:\n");
1579 print_binding_level (NAMESPACE_LEVEL (global_namespace));
1582 /* Return the type associated with id. */
1585 identifier_type_value (tree id)
1587 timevar_push (TV_NAME_LOOKUP);
1588 /* There is no type with that name, anywhere. */
1589 if (REAL_IDENTIFIER_TYPE_VALUE (id) == NULL_TREE)
1590 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
1591 /* This is not the type marker, but the real thing. */
1592 if (REAL_IDENTIFIER_TYPE_VALUE (id) != global_type_node)
1593 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, REAL_IDENTIFIER_TYPE_VALUE (id));
1594 /* Have to search for it. It must be on the global level, now.
1595 Ask lookup_name not to return non-types. */
1596 id = lookup_name_real (id, 2, 1, /*block_p=*/true, 0, LOOKUP_COMPLAIN);
1598 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, TREE_TYPE (id));
1599 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
1602 /* Return the IDENTIFIER_GLOBAL_VALUE of T, for use in common code, since
1603 the definition of IDENTIFIER_GLOBAL_VALUE is different for C and C++. */
1606 identifier_global_value (tree t)
1608 return IDENTIFIER_GLOBAL_VALUE (t);
1611 /* Push a definition of struct, union or enum tag named ID. into
1612 binding_level B. DECL is a TYPE_DECL for the type. We assume that
1613 the tag ID is not already defined. */
1616 set_identifier_type_value_with_scope (tree id, tree decl, cxx_scope *b)
1620 if (b->kind != sk_namespace)
1622 /* Shadow the marker, not the real thing, so that the marker
1623 gets restored later. */
1624 tree old_type_value = REAL_IDENTIFIER_TYPE_VALUE (id);
1626 = tree_cons (id, old_type_value, b->type_shadowed);
1627 type = decl ? TREE_TYPE (decl) : NULL_TREE;
1628 TREE_TYPE (b->type_shadowed) = type;
1632 cxx_binding *binding =
1633 binding_for_name (NAMESPACE_LEVEL (current_namespace), id);
1636 supplement_binding (binding, decl);
1638 binding->value = decl;
1640 /* Store marker instead of real type. */
1641 type = global_type_node;
1643 SET_IDENTIFIER_TYPE_VALUE (id, type);
1646 /* As set_identifier_type_value_with_scope, but using
1647 current_binding_level. */
1650 set_identifier_type_value (tree id, tree decl)
1652 set_identifier_type_value_with_scope (id, decl, current_binding_level);
1655 /* Return the name for the constructor (or destructor) for the
1656 specified class TYPE. When given a template, this routine doesn't
1657 lose the specialization. */
1660 constructor_name_full (tree type)
1662 return TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type));
1665 /* Return the name for the constructor (or destructor) for the
1666 specified class. When given a template, return the plain
1667 unspecialized name. */
1670 constructor_name (tree type)
1673 name = constructor_name_full (type);
1674 if (IDENTIFIER_TEMPLATE (name))
1675 name = IDENTIFIER_TEMPLATE (name);
1679 /* Returns TRUE if NAME is the name for the constructor for TYPE. */
1682 constructor_name_p (tree name, tree type)
1689 if (TREE_CODE (name) != IDENTIFIER_NODE)
1692 ctor_name = constructor_name_full (type);
1693 if (name == ctor_name)
1695 if (IDENTIFIER_TEMPLATE (ctor_name)
1696 && name == IDENTIFIER_TEMPLATE (ctor_name))
1701 /* Counter used to create anonymous type names. */
1703 static GTY(()) int anon_cnt;
1705 /* Return an IDENTIFIER which can be used as a name for
1706 anonymous structs and unions. */
1709 make_anon_name (void)
1713 sprintf (buf, ANON_AGGRNAME_FORMAT, anon_cnt++);
1714 return get_identifier (buf);
1717 /* Return (from the stack of) the BINDING, if any, established at SCOPE. */
1719 static inline cxx_binding *
1720 find_binding (cxx_scope *scope, cxx_binding *binding)
1722 timevar_push (TV_NAME_LOOKUP);
1724 for (; binding != NULL; binding = binding->previous)
1725 if (binding->scope == scope)
1726 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, binding);
1728 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, (cxx_binding *)0);
1731 /* Return the binding for NAME in SCOPE, if any. Otherwise, return NULL. */
1733 static inline cxx_binding *
1734 cxx_scope_find_binding_for_name (cxx_scope *scope, tree name)
1736 cxx_binding *b = IDENTIFIER_NAMESPACE_BINDINGS (name);
1739 /* Fold-in case where NAME is used only once. */
1740 if (scope == b->scope && b->previous == NULL)
1742 return find_binding (scope, b);
1747 /* Always returns a binding for name in scope. If no binding is
1748 found, make a new one. */
1750 static cxx_binding *
1751 binding_for_name (cxx_scope *scope, tree name)
1753 cxx_binding *result;
1755 result = cxx_scope_find_binding_for_name (scope, name);
1758 /* Not found, make a new one. */
1759 result = cxx_binding_make (NULL, NULL);
1760 result->previous = IDENTIFIER_NAMESPACE_BINDINGS (name);
1761 result->scope = scope;
1762 result->is_local = false;
1763 result->value_is_inherited = false;
1764 IDENTIFIER_NAMESPACE_BINDINGS (name) = result;
1768 /* Insert another USING_DECL into the current binding level, returning
1769 this declaration. If this is a redeclaration, do nothing, and
1770 return NULL_TREE if this not in namespace scope (in namespace
1771 scope, a using decl might extend any previous bindings). */
1774 push_using_decl (tree scope, tree name)
1778 timevar_push (TV_NAME_LOOKUP);
1779 gcc_assert (TREE_CODE (scope) == NAMESPACE_DECL);
1780 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
1781 for (decl = current_binding_level->usings; decl; decl = TREE_CHAIN (decl))
1782 if (DECL_INITIAL (decl) == scope && DECL_NAME (decl) == name)
1785 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP,
1786 namespace_bindings_p () ? decl : NULL_TREE);
1787 decl = build_lang_decl (USING_DECL, name, void_type_node);
1788 DECL_INITIAL (decl) = scope;
1789 TREE_CHAIN (decl) = current_binding_level->usings;
1790 current_binding_level->usings = decl;
1791 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl);
1794 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
1795 caller to set DECL_CONTEXT properly. */
1798 pushdecl_with_scope (tree x, cxx_scope *level)
1800 struct cp_binding_level *b;
1801 tree function_decl = current_function_decl;
1803 timevar_push (TV_NAME_LOOKUP);
1804 current_function_decl = NULL_TREE;
1805 if (level->kind == sk_class)
1807 b = class_binding_level;
1808 class_binding_level = level;
1809 pushdecl_class_level (x);
1810 class_binding_level = b;
1814 b = current_binding_level;
1815 current_binding_level = level;
1817 current_binding_level = b;
1819 current_function_decl = function_decl;
1820 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, x);
1823 /* DECL is a FUNCTION_DECL for a non-member function, which may have
1824 other definitions already in place. We get around this by making
1825 the value of the identifier point to a list of all the things that
1826 want to be referenced by that name. It is then up to the users of
1827 that name to decide what to do with that list.
1829 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
1830 DECL_TEMPLATE_RESULT. It is dealt with the same way.
1832 FLAGS is a bitwise-or of the following values:
1833 PUSH_LOCAL: Bind DECL in the current scope, rather than at
1835 PUSH_USING: DECL is being pushed as the result of a using
1838 The value returned may be a previous declaration if we guessed wrong
1839 about what language DECL should belong to (C or C++). Otherwise,
1840 it's always DECL (and never something that's not a _DECL). */
1843 push_overloaded_decl (tree decl, int flags)
1845 tree name = DECL_NAME (decl);
1848 int doing_global = (namespace_bindings_p () || !(flags & PUSH_LOCAL));
1850 timevar_push (TV_NAME_LOOKUP);
1852 old = namespace_binding (name, DECL_CONTEXT (decl));
1854 old = lookup_name_innermost_nonclass_level (name);
1858 if (TREE_CODE (old) == TYPE_DECL && DECL_ARTIFICIAL (old))
1860 tree t = TREE_TYPE (old);
1861 if (IS_AGGR_TYPE (t) && warn_shadow
1862 && (! DECL_IN_SYSTEM_HEADER (decl)
1863 || ! DECL_IN_SYSTEM_HEADER (old)))
1864 warning ("%q#D hides constructor for %q#T", decl, t);
1867 else if (is_overloaded_fn (old))
1871 for (tmp = old; tmp; tmp = OVL_NEXT (tmp))
1873 tree fn = OVL_CURRENT (tmp);
1875 if (TREE_CODE (tmp) == OVERLOAD && OVL_USED (tmp)
1876 && !(flags & PUSH_USING)
1877 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)),
1878 TYPE_ARG_TYPES (TREE_TYPE (decl)))
1879 && ! decls_match (fn, decl))
1880 error ("%q#D conflicts with previous using declaration %q#D",
1883 if (duplicate_decls (decl, fn) == fn)
1884 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, fn);
1887 else if (old == error_mark_node)
1888 /* Ignore the undefined symbol marker. */
1892 cp_error_at ("previous non-function declaration %q#D", old);
1893 error ("conflicts with function declaration %q#D", decl);
1894 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl);
1898 if (old || TREE_CODE (decl) == TEMPLATE_DECL
1899 /* If it's a using declaration, we always need to build an OVERLOAD,
1900 because it's the only way to remember that the declaration comes
1901 from 'using', and have the lookup behave correctly. */
1902 || (flags & PUSH_USING))
1904 if (old && TREE_CODE (old) != OVERLOAD)
1905 new_binding = ovl_cons (decl, ovl_cons (old, NULL_TREE));
1907 new_binding = ovl_cons (decl, old);
1908 if (flags & PUSH_USING)
1909 OVL_USED (new_binding) = 1;
1912 /* NAME is not ambiguous. */
1916 set_namespace_binding (name, current_namespace, new_binding);
1919 /* We only create an OVERLOAD if there was a previous binding at
1920 this level, or if decl is a template. In the former case, we
1921 need to remove the old binding and replace it with the new
1922 binding. We must also run through the NAMES on the binding
1923 level where the name was bound to update the chain. */
1925 if (TREE_CODE (new_binding) == OVERLOAD && old)
1929 for (d = &IDENTIFIER_BINDING (name)->scope->names;
1931 d = &TREE_CHAIN (*d))
1933 || (TREE_CODE (*d) == TREE_LIST
1934 && TREE_VALUE (*d) == old))
1936 if (TREE_CODE (*d) == TREE_LIST)
1937 /* Just replace the old binding with the new. */
1938 TREE_VALUE (*d) = new_binding;
1940 /* Build a TREE_LIST to wrap the OVERLOAD. */
1941 *d = tree_cons (NULL_TREE, new_binding,
1944 /* And update the cxx_binding node. */
1945 IDENTIFIER_BINDING (name)->value = new_binding;
1946 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl);
1949 /* We should always find a previous binding in this case. */
1953 /* Install the new binding. */
1954 push_local_binding (name, new_binding, flags);
1957 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl);
1960 /* Check a non-member using-declaration. Return the name and scope
1961 being used, and the USING_DECL, or NULL_TREE on failure. */
1964 validate_nonmember_using_decl (tree decl, tree scope, tree name)
1966 /* [namespace.udecl]
1967 A using-declaration for a class member shall be a
1968 member-declaration. */
1971 error ("%qT is not a namespace", scope);
1974 else if (scope == error_mark_node)
1977 if (TREE_CODE (decl) == TEMPLATE_ID_EXPR)
1980 A using-declaration shall not name a template-id. */
1981 error ("a using-declaration cannot specify a template-id. "
1982 "Try %<using %D%>", name);
1986 if (TREE_CODE (decl) == NAMESPACE_DECL)
1988 error ("namespace %qD not allowed in using-declaration", decl);
1992 if (TREE_CODE (decl) == SCOPE_REF)
1994 /* It's a nested name with template parameter dependent scope.
1995 This can only be using-declaration for class member. */
1996 error ("%qT is not a namespace", TREE_OPERAND (decl, 0));
2000 if (is_overloaded_fn (decl))
2001 decl = get_first_fn (decl);
2003 gcc_assert (DECL_P (decl));
2005 /* Make a USING_DECL. */
2006 return push_using_decl (scope, name);
2009 /* Process local and global using-declarations. */
2012 do_nonmember_using_decl (tree scope, tree name, tree oldval, tree oldtype,
2013 tree *newval, tree *newtype)
2015 struct scope_binding decls = EMPTY_SCOPE_BINDING;
2017 *newval = *newtype = NULL_TREE;
2018 if (!qualified_lookup_using_namespace (name, scope, &decls, 0))
2022 if (!decls.value && !decls.type)
2024 error ("%qD not declared", name);
2028 /* Check for using functions. */
2029 if (decls.value && is_overloaded_fn (decls.value))
2033 if (oldval && !is_overloaded_fn (oldval))
2035 if (!DECL_IMPLICIT_TYPEDEF_P (oldval))
2036 error ("%qD is already declared in this scope", name);
2040 /* It is impossible to overload a built-in function; any
2041 explicit declaration eliminates the built-in declaration.
2042 So, if OLDVAL is a built-in, then we can just pretend it
2045 && TREE_CODE (oldval) == FUNCTION_DECL
2046 && DECL_ANTICIPATED (oldval))
2050 for (tmp = decls.value; tmp; tmp = OVL_NEXT (tmp))
2052 tree new_fn = OVL_CURRENT (tmp);
2054 /* [namespace.udecl]
2056 If a function declaration in namespace scope or block
2057 scope has the same name and the same parameter types as a
2058 function introduced by a using declaration the program is
2060 for (tmp1 = oldval; tmp1; tmp1 = OVL_NEXT (tmp1))
2062 tree old_fn = OVL_CURRENT (tmp1);
2064 if (new_fn == old_fn)
2065 /* The function already exists in the current namespace. */
2067 else if (OVL_USED (tmp1))
2068 continue; /* this is a using decl */
2069 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (new_fn)),
2070 TYPE_ARG_TYPES (TREE_TYPE (old_fn))))
2072 gcc_assert (!DECL_ANTICIPATED (old_fn));
2074 /* There was already a non-using declaration in
2075 this scope with the same parameter types. If both
2076 are the same extern "C" functions, that's ok. */
2077 if (decls_match (new_fn, old_fn))
2081 error ("%qD is already declared in this scope", name);
2087 /* If we broke out of the loop, there's no reason to add
2088 this function to the using declarations for this
2093 /* If we are adding to an existing OVERLOAD, then we no
2094 longer know the type of the set of functions. */
2095 if (*newval && TREE_CODE (*newval) == OVERLOAD)
2096 TREE_TYPE (*newval) = unknown_type_node;
2097 /* Add this new function to the set. */
2098 *newval = build_overload (OVL_CURRENT (tmp), *newval);
2099 /* If there is only one function, then we use its type. (A
2100 using-declaration naming a single function can be used in
2101 contexts where overload resolution cannot be
2103 if (TREE_CODE (*newval) != OVERLOAD)
2105 *newval = ovl_cons (*newval, NULL_TREE);
2106 TREE_TYPE (*newval) = TREE_TYPE (OVL_CURRENT (tmp));
2108 OVL_USED (*newval) = 1;
2113 *newval = decls.value;
2114 if (oldval && !decls_match (*newval, oldval))
2115 error ("%qD is already declared in this scope", name);
2118 *newtype = decls.type;
2119 if (oldtype && *newtype && !same_type_p (oldtype, *newtype))
2121 error ("using declaration %qD introduced ambiguous type %qT",
2127 /* Process a using-declaration at function scope. */
2130 do_local_using_decl (tree decl, tree scope, tree name)
2132 tree oldval, oldtype, newval, newtype;
2133 tree orig_decl = decl;
2135 decl = validate_nonmember_using_decl (decl, scope, name);
2136 if (decl == NULL_TREE)
2139 if (building_stmt_tree ()
2140 && at_function_scope_p ())
2141 add_decl_expr (decl);
2143 oldval = lookup_name_innermost_nonclass_level (name);
2144 oldtype = lookup_type_current_level (name);
2146 do_nonmember_using_decl (scope, name, oldval, oldtype, &newval, &newtype);
2150 if (is_overloaded_fn (newval))
2154 /* We only need to push declarations for those functions
2155 that were not already bound in the current level.
2156 The old value might be NULL_TREE, it might be a single
2157 function, or an OVERLOAD. */
2158 if (oldval && TREE_CODE (oldval) == OVERLOAD)
2159 term = OVL_FUNCTION (oldval);
2162 for (fn = newval; fn && OVL_CURRENT (fn) != term;
2164 push_overloaded_decl (OVL_CURRENT (fn),
2165 PUSH_LOCAL | PUSH_USING);
2168 push_local_binding (name, newval, PUSH_USING);
2172 push_local_binding (name, newtype, PUSH_USING);
2173 set_identifier_type_value (name, newtype);
2176 /* Emit debug info. */
2177 if (!processing_template_decl)
2178 cp_emit_debug_info_for_using (orig_decl, current_scope());
2181 /* Returns true if ROOT (a namespace, class, or function) encloses
2182 CHILD. CHILD may be either a class type or a namespace. */
2185 is_ancestor (tree root, tree child)
2187 gcc_assert ((TREE_CODE (root) == NAMESPACE_DECL
2188 || TREE_CODE (root) == FUNCTION_DECL
2189 || CLASS_TYPE_P (root)));
2190 gcc_assert ((TREE_CODE (child) == NAMESPACE_DECL
2191 || CLASS_TYPE_P (child)));
2193 /* The global namespace encloses everything. */
2194 if (root == global_namespace)
2199 /* If we've run out of scopes, stop. */
2202 /* If we've reached the ROOT, it encloses CHILD. */
2205 /* Go out one level. */
2207 child = TYPE_NAME (child);
2208 child = DECL_CONTEXT (child);
2212 /* Enter the class or namespace scope indicated by T suitable for name
2213 lookup. T can be arbitrary scope, not necessary nested inside the
2214 current scope. Returns a non-null scope to pop iff pop_scope
2215 should be called later to exit this scope. */
2220 if (TREE_CODE (t) == NAMESPACE_DECL)
2221 push_decl_namespace (t);
2222 else if (CLASS_TYPE_P (t))
2224 if (!at_class_scope_p ()
2225 || !same_type_p (current_class_type, t))
2226 push_nested_class (t);
2228 /* T is the same as the current scope. There is therefore no
2229 need to re-enter the scope. Since we are not actually
2230 pushing a new scope, our caller should not call
2238 /* Leave scope pushed by push_scope. */
2243 if (TREE_CODE (t) == NAMESPACE_DECL)
2244 pop_decl_namespace ();
2245 else if CLASS_TYPE_P (t)
2246 pop_nested_class ();
2249 /* Subroutine of push_inner_scope. */
2252 push_inner_scope_r (tree outer, tree inner)
2257 || (TREE_CODE (inner) != NAMESPACE_DECL && !CLASS_TYPE_P (inner)))
2260 prev = CP_DECL_CONTEXT (TREE_CODE (inner) == NAMESPACE_DECL ? inner : TYPE_NAME (inner));
2262 push_inner_scope_r (outer, prev);
2263 if (TREE_CODE (inner) == NAMESPACE_DECL)
2265 struct cp_binding_level *save_template_parm = 0;
2266 /* Temporary take out template parameter scopes. They are saved
2267 in reversed order in save_template_parm. */
2268 while (current_binding_level->kind == sk_template_parms)
2270 struct cp_binding_level *b = current_binding_level;
2271 current_binding_level = b->level_chain;
2272 b->level_chain = save_template_parm;
2273 save_template_parm = b;
2276 resume_scope (NAMESPACE_LEVEL (inner));
2277 current_namespace = inner;
2279 /* Restore template parameter scopes. */
2280 while (save_template_parm)
2282 struct cp_binding_level *b = save_template_parm;
2283 save_template_parm = b->level_chain;
2284 b->level_chain = current_binding_level;
2285 current_binding_level = b;
2292 /* Enter the scope INNER from current scope. INNER must be a scope
2293 nested inside current scope. This works with both name lookup and
2294 pushing name into scope. In case a template parameter scope is present,
2295 namespace is pushed under the template parameter scope according to
2296 name lookup rule in 14.6.1/6.
2298 Return the former current scope suitable for pop_inner_scope. */
2301 push_inner_scope (tree inner)
2303 tree outer = current_scope ();
2305 outer = current_namespace;
2307 push_inner_scope_r (outer, inner);
2311 /* Exit the current scope INNER back to scope OUTER. */
2314 pop_inner_scope (tree outer, tree inner)
2317 || (TREE_CODE (inner) != NAMESPACE_DECL && !CLASS_TYPE_P (inner)))
2320 while (outer != inner)
2322 if (TREE_CODE (inner) == NAMESPACE_DECL)
2324 struct cp_binding_level *save_template_parm = 0;
2325 /* Temporary take out template parameter scopes. They are saved
2326 in reversed order in save_template_parm. */
2327 while (current_binding_level->kind == sk_template_parms)
2329 struct cp_binding_level *b = current_binding_level;
2330 current_binding_level = b->level_chain;
2331 b->level_chain = save_template_parm;
2332 save_template_parm = b;
2337 /* Restore template parameter scopes. */
2338 while (save_template_parm)
2340 struct cp_binding_level *b = save_template_parm;
2341 save_template_parm = b->level_chain;
2342 b->level_chain = current_binding_level;
2343 current_binding_level = b;
2349 inner = CP_DECL_CONTEXT (TREE_CODE (inner) == NAMESPACE_DECL ? inner : TYPE_NAME (inner));
2353 /* Do a pushlevel for class declarations. */
2356 pushlevel_class (void)
2358 if (ENABLE_SCOPE_CHECKING)
2361 class_binding_level = begin_scope (sk_class, current_class_type);
2364 /* ...and a poplevel for class declarations. */
2367 poplevel_class (void)
2369 struct cp_binding_level *level = class_binding_level;
2370 cp_class_binding *cb;
2374 timevar_push (TV_NAME_LOOKUP);
2375 gcc_assert (level != 0);
2377 /* If we're leaving a toplevel class, cache its binding level. */
2378 if (current_class_depth == 1)
2379 previous_class_level = level;
2380 for (shadowed = level->type_shadowed;
2382 shadowed = TREE_CHAIN (shadowed))
2383 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed), TREE_VALUE (shadowed));
2385 /* Remove the bindings for all of the class-level declarations. */
2386 if (level->class_shadowed)
2389 VEC_iterate (cp_class_binding, level->class_shadowed, i, cb);
2391 IDENTIFIER_BINDING (cb->identifier) = cb->base.previous;
2392 ggc_free (level->class_shadowed);
2393 level->class_shadowed = NULL;
2396 /* Now, pop out of the binding level which we created up in the
2397 `pushlevel_class' routine. */
2398 if (ENABLE_SCOPE_CHECKING)
2402 timevar_pop (TV_NAME_LOOKUP);
2405 /* Set INHERITED_VALUE_BINDING_P on BINDING to true or false, as
2406 appropriate. DECL is the value to which a name has just been
2407 bound. CLASS_TYPE is the class in which the lookup occurred. */
2410 set_inherited_value_binding_p (cxx_binding *binding, tree decl,
2413 if (binding->value == decl && TREE_CODE (decl) != TREE_LIST)
2417 if (TREE_CODE (decl) == OVERLOAD)
2418 context = CP_DECL_CONTEXT (OVL_CURRENT (decl));
2421 gcc_assert (DECL_P (decl));
2422 context = context_for_name_lookup (decl);
2425 if (is_properly_derived_from (class_type, context))
2426 INHERITED_VALUE_BINDING_P (binding) = 1;
2428 INHERITED_VALUE_BINDING_P (binding) = 0;
2430 else if (binding->value == decl)
2431 /* We only encounter a TREE_LIST when there is an ambiguity in the
2432 base classes. Such an ambiguity can be overridden by a
2433 definition in this class. */
2434 INHERITED_VALUE_BINDING_P (binding) = 1;
2436 INHERITED_VALUE_BINDING_P (binding) = 0;
2439 /* Make the declaration of X appear in CLASS scope. */
2442 pushdecl_class_level (tree x)
2445 bool is_valid = true;
2447 timevar_push (TV_NAME_LOOKUP);
2448 /* Get the name of X. */
2449 if (TREE_CODE (x) == OVERLOAD)
2450 name = DECL_NAME (get_first_fn (x));
2452 name = DECL_NAME (x);
2456 is_valid = push_class_level_binding (name, x);
2457 if (TREE_CODE (x) == TYPE_DECL)
2458 set_identifier_type_value (name, x);
2460 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x)))
2462 /* If X is an anonymous aggregate, all of its members are
2463 treated as if they were members of the class containing the
2464 aggregate, for naming purposes. */
2467 for (f = TYPE_FIELDS (TREE_TYPE (x)); f; f = TREE_CHAIN (f))
2469 location_t save_location = input_location;
2470 input_location = DECL_SOURCE_LOCATION (f);
2471 if (!pushdecl_class_level (f))
2473 input_location = save_location;
2476 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, is_valid);
2479 /* Return the BINDING (if any) for NAME in SCOPE, which is a class
2480 scope. If the value returned is non-NULL, and the PREVIOUS field
2481 is not set, callers must set the PREVIOUS field explicitly. */
2483 static cxx_binding *
2484 get_class_binding (tree name, cxx_scope *scope)
2489 cxx_binding *binding;
2491 class_type = scope->this_entity;
2493 /* Get the type binding. */
2494 type_binding = lookup_member (class_type, name,
2495 /*protect=*/2, /*want_type=*/true);
2496 /* Get the value binding. */
2497 value_binding = lookup_member (class_type, name,
2498 /*protect=*/2, /*want_type=*/false);
2501 && (TREE_CODE (value_binding) == TYPE_DECL
2502 || DECL_CLASS_TEMPLATE_P (value_binding)
2503 || (TREE_CODE (value_binding) == TREE_LIST
2504 && TREE_TYPE (value_binding) == error_mark_node
2505 && (TREE_CODE (TREE_VALUE (value_binding))
2507 /* We found a type binding, even when looking for a non-type
2508 binding. This means that we already processed this binding
2511 else if (value_binding)
2513 if (TREE_CODE (value_binding) == TREE_LIST
2514 && TREE_TYPE (value_binding) == error_mark_node)
2515 /* NAME is ambiguous. */
2517 else if (BASELINK_P (value_binding))
2518 /* NAME is some overloaded functions. */
2519 value_binding = BASELINK_FUNCTIONS (value_binding);
2522 /* If we found either a type binding or a value binding, create a
2523 new binding object. */
2524 if (type_binding || value_binding)
2526 binding = new_class_binding (name,
2530 /* This is a class-scope binding, not a block-scope binding. */
2531 LOCAL_BINDING_P (binding) = 0;
2532 set_inherited_value_binding_p (binding, value_binding, class_type);
2540 /* Make the declaration(s) of X appear in CLASS scope under the name
2541 NAME. Returns true if the binding is valid. */
2544 push_class_level_binding (tree name, tree x)
2546 cxx_binding *binding;
2550 timevar_push (TV_NAME_LOOKUP);
2551 /* The class_binding_level will be NULL if x is a template
2552 parameter name in a member template. */
2553 if (!class_binding_level)
2554 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, true);
2556 /* Check for invalid member names. */
2557 gcc_assert (TYPE_BEING_DEFINED (current_class_type));
2558 /* We could have been passed a tree list if this is an ambiguous
2559 declaration. If so, pull the declaration out because
2560 check_template_shadow will not handle a TREE_LIST. */
2561 if (TREE_CODE (decl) == TREE_LIST
2562 && TREE_TYPE (decl) == error_mark_node)
2563 decl = TREE_VALUE (decl);
2565 check_template_shadow (decl);
2569 If T is the name of a class, then each of the following shall
2570 have a name different from T:
2572 -- every static data member of class T;
2574 -- every member of class T that is itself a type;
2576 -- every enumerator of every member of class T that is an
2579 -- every member of every anonymous union that is a member of
2582 (Non-static data members were also forbidden to have the same
2583 name as T until TC1.) */
2584 if ((TREE_CODE (x) == VAR_DECL
2585 || TREE_CODE (x) == CONST_DECL
2586 || (TREE_CODE (x) == TYPE_DECL
2587 && !DECL_SELF_REFERENCE_P (x))
2588 /* A data member of an anonymous union. */
2589 || (TREE_CODE (x) == FIELD_DECL
2590 && DECL_CONTEXT (x) != current_class_type))
2591 && DECL_NAME (x) == constructor_name (current_class_type))
2593 tree scope = context_for_name_lookup (x);
2594 if (TYPE_P (scope) && same_type_p (scope, current_class_type))
2596 error ("%qD has the same name as the class in which it is "
2599 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, false);
2603 /* Get the current binding for NAME in this class, if any. */
2604 binding = IDENTIFIER_BINDING (name);
2605 if (!binding || binding->scope != class_binding_level)
2607 binding = get_class_binding (name, class_binding_level);
2608 /* If a new binding was created, put it at the front of the
2609 IDENTIFIER_BINDING list. */
2612 binding->previous = IDENTIFIER_BINDING (name);
2613 IDENTIFIER_BINDING (name) = binding;
2617 /* If there is already a binding, then we may need to update the
2619 if (binding && binding->value)
2621 tree bval = binding->value;
2622 tree old_decl = NULL_TREE;
2624 if (INHERITED_VALUE_BINDING_P (binding))
2626 /* If the old binding was from a base class, and was for a
2627 tag name, slide it over to make room for the new binding.
2628 The old binding is still visible if explicitly qualified
2629 with a class-key. */
2630 if (TREE_CODE (bval) == TYPE_DECL && DECL_ARTIFICIAL (bval)
2631 && !(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)))
2633 old_decl = binding->type;
2634 binding->type = bval;
2635 binding->value = NULL_TREE;
2636 INHERITED_VALUE_BINDING_P (binding) = 0;
2641 else if (TREE_CODE (x) == OVERLOAD && is_overloaded_fn (bval))
2643 else if (TREE_CODE (x) == USING_DECL && TREE_CODE (bval) == USING_DECL)
2644 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, true);
2645 else if (TREE_CODE (x) == USING_DECL && is_overloaded_fn (bval))
2647 else if (TREE_CODE (bval) == USING_DECL && is_overloaded_fn (x))
2648 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, true);
2650 if (old_decl && binding->scope == class_binding_level)
2653 /* It is always safe to clear INHERITED_VALUE_BINDING_P
2654 here. This function is only used to register bindings
2655 from with the class definition itself. */
2656 INHERITED_VALUE_BINDING_P (binding) = 0;
2657 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, true);
2661 /* Note that we declared this value so that we can issue an error if
2662 this is an invalid redeclaration of a name already used for some
2664 note_name_declared_in_class (name, decl);
2666 /* If we didn't replace an existing binding, put the binding on the
2667 stack of bindings for the identifier, and update the shadowed
2669 if (binding && binding->scope == class_binding_level)
2670 /* Supplement the existing binding. */
2671 ok = supplement_binding (binding, decl);
2674 /* Create a new binding. */
2675 push_binding (name, decl, class_binding_level);
2679 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, ok);
2682 /* Process "using SCOPE::NAME" in a class scope. Return the
2683 USING_DECL created. */
2686 do_class_using_decl (tree scope, tree name)
2690 if (!scope || !TYPE_P (scope))
2692 error ("using-declaration for non-member at class scope");
2695 if (TREE_CODE (name) == BIT_NOT_EXPR)
2697 error ("using-declaration cannot name destructor");
2701 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
2703 /* Dependent using decls have a NULL type, non-dependent ones have a
2705 type = dependent_type_p (scope) ? NULL_TREE : void_type_node;
2706 value = build_lang_decl (USING_DECL, name, type);
2707 DECL_INITIAL (value) = scope;
2709 if (scope && !processing_template_decl)
2713 r = lookup_qualified_name (scope, name, false, false);
2714 if (r && (DECL_P (r) || TREE_CODE (r) == OVERLOAD))
2715 cp_emit_debug_info_for_using (r, scope);
2721 /* Return the binding value for name in scope. */
2724 namespace_binding (tree name, tree scope)
2726 cxx_binding *binding;
2729 scope = global_namespace;
2731 /* Unnecessary for the global namespace because it can't be an alias. */
2732 scope = ORIGINAL_NAMESPACE (scope);
2734 binding = cxx_scope_find_binding_for_name (NAMESPACE_LEVEL (scope), name);
2736 return binding ? binding->value : NULL_TREE;
2739 /* Set the binding value for name in scope. */
2742 set_namespace_binding (tree name, tree scope, tree val)
2746 timevar_push (TV_NAME_LOOKUP);
2747 if (scope == NULL_TREE)
2748 scope = global_namespace;
2749 b = binding_for_name (NAMESPACE_LEVEL (scope), name);
2750 if (!b->value || TREE_CODE (val) == OVERLOAD || val == error_mark_node)
2753 supplement_binding (b, val);
2754 timevar_pop (TV_NAME_LOOKUP);
2757 /* Set the context of a declaration to scope. Complain if we are not
2761 set_decl_namespace (tree decl, tree scope, bool friendp)
2765 /* Get rid of namespace aliases. */
2766 scope = ORIGINAL_NAMESPACE (scope);
2768 /* It is ok for friends to be qualified in parallel space. */
2769 if (!friendp && !is_ancestor (current_namespace, scope))
2770 error ("declaration of %qD not in a namespace surrounding %qD",
2772 DECL_CONTEXT (decl) = FROB_CONTEXT (scope);
2774 /* Writing "int N::i" to declare a variable within "N" is invalid. */
2775 if (scope == current_namespace)
2777 if (at_namespace_scope_p ())
2778 error ("explicit qualification in declaration of `%D'",
2783 /* See whether this has been declared in the namespace. */
2784 old = namespace_binding (DECL_NAME (decl), scope);
2786 /* No old declaration at all. */
2788 /* A template can be explicitly specialized in any namespace. */
2789 if (processing_explicit_instantiation)
2791 if (!is_overloaded_fn (decl))
2792 /* Don't compare non-function decls with decls_match here, since
2793 it can't check for the correct constness at this
2794 point. pushdecl will find those errors later. */
2796 /* Since decl is a function, old should contain a function decl. */
2797 if (!is_overloaded_fn (old))
2799 if (processing_template_decl || processing_specialization)
2800 /* We have not yet called push_template_decl to turn a
2801 FUNCTION_DECL into a TEMPLATE_DECL, so the declarations won't
2802 match. But, we'll check later, when we construct the
2805 if (is_overloaded_fn (old))
2807 for (; old; old = OVL_NEXT (old))
2808 if (decls_match (decl, OVL_CURRENT (old)))
2811 else if (decls_match (decl, old))
2814 error ("%qD should have been declared inside %qD", decl, scope);
2817 /* Return the namespace where the current declaration is declared. */
2820 current_decl_namespace (void)
2823 /* If we have been pushed into a different namespace, use it. */
2824 if (decl_namespace_list)
2825 return TREE_PURPOSE (decl_namespace_list);
2827 if (current_class_type)
2828 result = decl_namespace_context (current_class_type);
2829 else if (current_function_decl)
2830 result = decl_namespace_context (current_function_decl);
2832 result = current_namespace;
2836 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2837 select a name that is unique to this compilation unit. */
2840 push_namespace (tree name)
2844 int implicit_use = 0;
2847 timevar_push (TV_NAME_LOOKUP);
2849 /* We should not get here if the global_namespace is not yet constructed
2850 nor if NAME designates the global namespace: The global scope is
2851 constructed elsewhere. */
2852 gcc_assert (global_namespace != NULL && name != global_scope_name);
2856 /* The name of anonymous namespace is unique for the translation
2858 if (!anonymous_namespace_name)
2859 anonymous_namespace_name = get_file_function_name ('N');
2860 name = anonymous_namespace_name;
2861 d = IDENTIFIER_NAMESPACE_VALUE (name);
2863 /* Reopening anonymous namespace. */
2869 /* Check whether this is an extended namespace definition. */
2870 d = IDENTIFIER_NAMESPACE_VALUE (name);
2871 if (d != NULL_TREE && TREE_CODE (d) == NAMESPACE_DECL)
2874 if (DECL_NAMESPACE_ALIAS (d))
2876 error ("namespace alias %qD not allowed here, assuming %qD",
2877 d, DECL_NAMESPACE_ALIAS (d));
2878 d = DECL_NAMESPACE_ALIAS (d);
2885 /* Make a new namespace, binding the name to it. */
2886 d = build_lang_decl (NAMESPACE_DECL, name, void_type_node);
2887 DECL_CONTEXT (d) = FROB_CONTEXT (current_namespace);
2891 /* Clear DECL_NAME for the benefit of debugging back ends. */
2892 SET_DECL_ASSEMBLER_NAME (d, name);
2893 DECL_NAME (d) = NULL_TREE;
2895 begin_scope (sk_namespace, d);
2898 resume_scope (NAMESPACE_LEVEL (d));
2901 do_using_directive (d);
2902 /* Enter the name space. */
2903 current_namespace = d;
2905 timevar_pop (TV_NAME_LOOKUP);
2908 /* Pop from the scope of the current namespace. */
2911 pop_namespace (void)
2913 gcc_assert (current_namespace != global_namespace);
2914 current_namespace = CP_DECL_CONTEXT (current_namespace);
2915 /* The binding level is not popped, as it might be re-opened later. */
2919 /* Push into the scope of the namespace NS, even if it is deeply
2920 nested within another namespace. */
2923 push_nested_namespace (tree ns)
2925 if (ns == global_namespace)
2926 push_to_top_level ();
2929 push_nested_namespace (CP_DECL_CONTEXT (ns));
2930 push_namespace (DECL_NAME (ns));
2934 /* Pop back from the scope of the namespace NS, which was previously
2935 entered with push_nested_namespace. */
2938 pop_nested_namespace (tree ns)
2940 timevar_push (TV_NAME_LOOKUP);
2941 while (ns != global_namespace)
2944 ns = CP_DECL_CONTEXT (ns);
2947 pop_from_top_level ();
2948 timevar_pop (TV_NAME_LOOKUP);
2951 /* Temporarily set the namespace for the current declaration. */
2954 push_decl_namespace (tree decl)
2956 if (TREE_CODE (decl) != NAMESPACE_DECL)
2957 decl = decl_namespace_context (decl);
2958 decl_namespace_list = tree_cons (ORIGINAL_NAMESPACE (decl),
2959 NULL_TREE, decl_namespace_list);
2962 /* [namespace.memdef]/2 */
2965 pop_decl_namespace (void)
2967 decl_namespace_list = TREE_CHAIN (decl_namespace_list);
2970 /* Return the namespace that is the common ancestor
2971 of two given namespaces. */
2974 namespace_ancestor (tree ns1, tree ns2)
2976 timevar_push (TV_NAME_LOOKUP);
2977 if (is_ancestor (ns1, ns2))
2978 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, ns1);
2979 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP,
2980 namespace_ancestor (CP_DECL_CONTEXT (ns1), ns2));
2983 /* Process a namespace-alias declaration. */
2986 do_namespace_alias (tree alias, tree namespace)
2988 if (TREE_CODE (namespace) != NAMESPACE_DECL)
2990 /* The parser did not find it, so it's not there. */
2991 error ("unknown namespace %qD", namespace);
2995 namespace = ORIGINAL_NAMESPACE (namespace);
2997 /* Build the alias. */
2998 alias = build_lang_decl (NAMESPACE_DECL, alias, void_type_node);
2999 DECL_NAMESPACE_ALIAS (alias) = namespace;
3000 DECL_EXTERNAL (alias) = 1;
3001 DECL_CONTEXT (alias) = FROB_CONTEXT (current_scope ());
3004 /* Emit debug info for namespace alias. */
3005 (*debug_hooks->global_decl) (alias);
3008 /* Like pushdecl, only it places X in the current namespace,
3012 pushdecl_namespace_level (tree x)
3014 struct cp_binding_level *b = current_binding_level;
3017 timevar_push (TV_NAME_LOOKUP);
3018 t = pushdecl_with_scope (x, NAMESPACE_LEVEL (current_namespace));
3020 /* Now, the type_shadowed stack may screw us. Munge it so it does
3022 if (TREE_CODE (t) == TYPE_DECL)
3024 tree name = DECL_NAME (t);
3026 tree *ptr = (tree *)0;
3027 for (; !global_scope_p (b); b = b->level_chain)
3029 tree shadowed = b->type_shadowed;
3030 for (; shadowed; shadowed = TREE_CHAIN (shadowed))
3031 if (TREE_PURPOSE (shadowed) == name)
3033 ptr = &TREE_VALUE (shadowed);
3034 /* Can't break out of the loop here because sometimes
3035 a binding level will have duplicate bindings for
3036 PT names. It's gross, but I haven't time to fix it. */
3039 newval = TREE_TYPE (t);
3040 if (ptr == (tree *)0)
3042 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
3043 up here if this is changed to an assertion. --KR */
3044 SET_IDENTIFIER_TYPE_VALUE (name, t);
3051 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
3054 /* Insert USED into the using list of USER. Set INDIRECT_flag if this
3055 directive is not directly from the source. Also find the common
3056 ancestor and let our users know about the new namespace */
3058 add_using_namespace (tree user, tree used, bool indirect)
3061 timevar_push (TV_NAME_LOOKUP);
3062 /* Using oneself is a no-op. */
3065 timevar_pop (TV_NAME_LOOKUP);
3068 gcc_assert (TREE_CODE (user) == NAMESPACE_DECL);
3069 gcc_assert (TREE_CODE (used) == NAMESPACE_DECL);
3070 /* Check if we already have this. */
3071 t = purpose_member (used, DECL_NAMESPACE_USING (user));
3075 /* Promote to direct usage. */
3076 TREE_INDIRECT_USING (t) = 0;
3077 timevar_pop (TV_NAME_LOOKUP);
3081 /* Add used to the user's using list. */
3082 DECL_NAMESPACE_USING (user)
3083 = tree_cons (used, namespace_ancestor (user, used),
3084 DECL_NAMESPACE_USING (user));
3086 TREE_INDIRECT_USING (DECL_NAMESPACE_USING (user)) = indirect;
3088 /* Add user to the used's users list. */
3089 DECL_NAMESPACE_USERS (used)
3090 = tree_cons (user, 0, DECL_NAMESPACE_USERS (used));
3092 /* Recursively add all namespaces used. */
3093 for (t = DECL_NAMESPACE_USING (used); t; t = TREE_CHAIN (t))
3094 /* indirect usage */
3095 add_using_namespace (user, TREE_PURPOSE (t), 1);
3097 /* Tell everyone using us about the new used namespaces. */
3098 for (t = DECL_NAMESPACE_USERS (user); t; t = TREE_CHAIN (t))
3099 add_using_namespace (TREE_PURPOSE (t), used, 1);
3100 timevar_pop (TV_NAME_LOOKUP);
3103 /* Process a using-declaration not appearing in class or local scope. */
3106 do_toplevel_using_decl (tree decl, tree scope, tree name)
3108 tree oldval, oldtype, newval, newtype;
3109 tree orig_decl = decl;
3110 cxx_binding *binding;
3112 decl = validate_nonmember_using_decl (decl, scope, name);
3113 if (decl == NULL_TREE)
3116 binding = binding_for_name (NAMESPACE_LEVEL (current_namespace), name);
3118 oldval = binding->value;
3119 oldtype = binding->type;
3121 do_nonmember_using_decl (scope, name, oldval, oldtype, &newval, &newtype);
3123 /* Emit debug info. */
3124 if (!processing_template_decl)
3125 cp_emit_debug_info_for_using (orig_decl, current_namespace);
3127 /* Copy declarations found. */
3129 binding->value = newval;
3131 binding->type = newtype;
3135 /* Process a using-directive. */
3138 do_using_directive (tree namespace)
3140 tree context = NULL_TREE;
3142 if (building_stmt_tree ())
3143 add_stmt (build_stmt (USING_STMT, namespace));
3145 /* using namespace A::B::C; */
3146 if (TREE_CODE (namespace) == SCOPE_REF)
3147 namespace = TREE_OPERAND (namespace, 1);
3148 if (TREE_CODE (namespace) == IDENTIFIER_NODE)
3150 /* Lookup in lexer did not find a namespace. */
3151 if (!processing_template_decl)
3152 error ("namespace %qT undeclared", namespace);
3155 if (TREE_CODE (namespace) != NAMESPACE_DECL)
3157 if (!processing_template_decl)
3158 error ("%qT is not a namespace", namespace);
3161 namespace = ORIGINAL_NAMESPACE (namespace);
3162 if (!toplevel_bindings_p ())
3164 push_using_directive (namespace);
3165 context = current_scope ();
3170 add_using_namespace (current_namespace, namespace, 0);
3171 if (current_namespace != global_namespace)
3172 context = current_namespace;
3175 /* Emit debugging info. */
3176 if (!processing_template_decl)
3177 (*debug_hooks->imported_module_or_decl) (namespace, context);
3180 /* Deal with a using-directive seen by the parser. Currently we only
3181 handle attributes here, since they cannot appear inside a template. */
3184 parse_using_directive (tree namespace, tree attribs)
3188 do_using_directive (namespace);
3190 for (a = attribs; a; a = TREE_CHAIN (a))
3192 tree name = TREE_PURPOSE (a);
3193 if (is_attribute_p ("strong", name))
3195 if (!toplevel_bindings_p ())
3196 error ("strong using only meaningful at namespace scope");
3197 else if (namespace != error_mark_node)
3198 DECL_NAMESPACE_ASSOCIATIONS (namespace)
3199 = tree_cons (current_namespace, 0,
3200 DECL_NAMESPACE_ASSOCIATIONS (namespace));
3203 warning ("%qD attribute directive ignored", name);
3207 /* Like pushdecl, only it places X in the global scope if appropriate.
3208 Calls cp_finish_decl to register the variable, initializing it with
3209 *INIT, if INIT is non-NULL. */
3212 pushdecl_top_level_1 (tree x, tree *init)
3214 timevar_push (TV_NAME_LOOKUP);
3215 push_to_top_level ();
3216 x = pushdecl_namespace_level (x);
3218 cp_finish_decl (x, *init, NULL_TREE, 0);
3219 pop_from_top_level ();
3220 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, x);
3223 /* Like pushdecl, only it places X in the global scope if appropriate. */
3226 pushdecl_top_level (tree x)
3228 return pushdecl_top_level_1 (x, NULL);
3231 /* Like pushdecl, only it places X in the global scope if
3232 appropriate. Calls cp_finish_decl to register the variable,
3233 initializing it with INIT. */
3236 pushdecl_top_level_and_finish (tree x, tree init)
3238 return pushdecl_top_level_1 (x, &init);
3241 /* Combines two sets of overloaded functions into an OVERLOAD chain, removing
3242 duplicates. The first list becomes the tail of the result.
3244 The algorithm is O(n^2). We could get this down to O(n log n) by
3245 doing a sort on the addresses of the functions, if that becomes
3249 merge_functions (tree s1, tree s2)
3251 for (; s2; s2 = OVL_NEXT (s2))
3253 tree fn2 = OVL_CURRENT (s2);
3256 for (fns1 = s1; fns1; fns1 = OVL_NEXT (fns1))
3258 tree fn1 = OVL_CURRENT (fns1);
3260 /* If the function from S2 is already in S1, there is no
3261 need to add it again. For `extern "C"' functions, we
3262 might have two FUNCTION_DECLs for the same function, in
3263 different namespaces; again, we only need one of them. */
3265 || (DECL_EXTERN_C_P (fn1) && DECL_EXTERN_C_P (fn2)
3266 && DECL_NAME (fn1) == DECL_NAME (fn2)))
3270 /* If we exhausted all of the functions in S1, FN2 is new. */
3272 s1 = build_overload (fn2, s1);
3277 /* This should return an error not all definitions define functions.
3278 It is not an error if we find two functions with exactly the
3279 same signature, only if these are selected in overload resolution.
3280 old is the current set of bindings, new the freshly-found binding.
3281 XXX Do we want to give *all* candidates in case of ambiguity?
3282 XXX In what way should I treat extern declarations?
3283 XXX I don't want to repeat the entire duplicate_decls here */
3286 ambiguous_decl (tree name, struct scope_binding *old, cxx_binding *new,
3290 gcc_assert (old != NULL);
3291 /* Copy the value. */
3294 switch (TREE_CODE (val))
3297 /* If we expect types or namespaces, and not templates,
3298 or this is not a template class. */
3299 if (LOOKUP_QUALIFIERS_ONLY (flags)
3300 && !DECL_CLASS_TEMPLATE_P (val))
3304 if (LOOKUP_NAMESPACES_ONLY (flags))
3307 case NAMESPACE_DECL:
3308 if (LOOKUP_TYPES_ONLY (flags))
3312 /* Ignore built-in functions that are still anticipated. */
3313 if (LOOKUP_QUALIFIERS_ONLY (flags) || DECL_ANTICIPATED (val))
3317 if (LOOKUP_QUALIFIERS_ONLY (flags))
3323 else if (val && val != old->value)
3325 if (is_overloaded_fn (old->value) && is_overloaded_fn (val))
3326 old->value = merge_functions (old->value, val);
3329 /* Some declarations are functions, some are not. */
3330 if (flags & LOOKUP_COMPLAIN)
3332 /* If we've already given this error for this lookup,
3333 old->value is error_mark_node, so let's not
3334 repeat ourselves. */
3335 if (old->value != error_mark_node)
3337 error ("use of %qD is ambiguous", name);
3338 cp_error_at (" first declared as %q#D here", old->value);
3340 cp_error_at (" also declared as %q#D here", val);
3342 old->value = error_mark_node;
3345 /* ... and copy the type. */
3347 if (LOOKUP_NAMESPACES_ONLY (flags))
3351 else if (type && old->type != type)
3353 if (flags & LOOKUP_COMPLAIN)
3355 error ("%qD denotes an ambiguous type",name);
3356 error ("%J first type here", TYPE_MAIN_DECL (old->type));
3357 error ("%J other type here", TYPE_MAIN_DECL (type));
3362 /* Return the declarations that are members of the namespace NS. */
3365 cp_namespace_decls (tree ns)
3367 return NAMESPACE_LEVEL (ns)->names;
3370 /* Combine prefer_type and namespaces_only into flags. */
3373 lookup_flags (int prefer_type, int namespaces_only)
3375 if (namespaces_only)
3376 return LOOKUP_PREFER_NAMESPACES;
3377 if (prefer_type > 1)
3378 return LOOKUP_PREFER_TYPES;
3379 if (prefer_type > 0)
3380 return LOOKUP_PREFER_BOTH;
3384 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
3385 ignore it or not. Subroutine of lookup_name_real. */
3388 qualify_lookup (tree val, int flags)
3390 if (val == NULL_TREE)
3392 if ((flags & LOOKUP_PREFER_NAMESPACES) && TREE_CODE (val) == NAMESPACE_DECL)
3394 if ((flags & LOOKUP_PREFER_TYPES)
3395 && (TREE_CODE (val) == TYPE_DECL || TREE_CODE (val) == TEMPLATE_DECL))
3397 if (flags & (LOOKUP_PREFER_NAMESPACES | LOOKUP_PREFER_TYPES))
3402 /* Look up NAME in the NAMESPACE. */
3405 lookup_namespace_name (tree namespace, tree name)
3408 tree template_id = NULL_TREE;
3409 struct scope_binding binding = EMPTY_SCOPE_BINDING;
3411 timevar_push (TV_NAME_LOOKUP);
3412 gcc_assert (TREE_CODE (namespace) == NAMESPACE_DECL);
3414 if (TREE_CODE (name) == NAMESPACE_DECL)
3415 /* This happens for A::B<int> when B is a namespace. */
3416 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, name);
3417 else if (TREE_CODE (name) == TEMPLATE_DECL)
3419 /* This happens for A::B where B is a template, and there are no
3420 template arguments. */
3421 error ("invalid use of %qD", name);
3422 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
3425 namespace = ORIGINAL_NAMESPACE (namespace);
3427 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
3430 name = TREE_OPERAND (name, 0);
3431 if (TREE_CODE (name) == OVERLOAD)
3432 name = DECL_NAME (OVL_CURRENT (name));
3433 else if (DECL_P (name))
3434 name = DECL_NAME (name);
3437 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
3439 if (!qualified_lookup_using_namespace (name, namespace, &binding, 0))
3440 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
3444 val = binding.value;
3448 if (DECL_CLASS_TEMPLATE_P (val))
3449 val = lookup_template_class (val,
3450 TREE_OPERAND (template_id, 1),
3451 /*in_decl=*/NULL_TREE,
3452 /*context=*/NULL_TREE,
3453 /*entering_scope=*/0,
3454 tf_error | tf_warning);
3455 else if (DECL_FUNCTION_TEMPLATE_P (val)
3456 || TREE_CODE (val) == OVERLOAD)
3457 val = lookup_template_function (val,
3458 TREE_OPERAND (template_id, 1));
3461 error ("%<%D::%D%> is not a template", namespace, name);
3462 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
3466 /* If we have a single function from a using decl, pull it out. */
3467 if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val))
3468 val = OVL_FUNCTION (val);
3470 /* Ignore built-in functions that haven't been prototyped yet. */
3471 if (!val || !DECL_P(val)
3472 || !DECL_LANG_SPECIFIC(val)
3473 || !DECL_ANTICIPATED (val))
3474 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, val);
3477 error ("%qD undeclared in namespace %qD", name, namespace);
3478 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
3481 /* Select the right _DECL from multiple choices. */
3484 select_decl (const struct scope_binding *binding, int flags)
3487 val = binding->value;
3489 timevar_push (TV_NAME_LOOKUP);
3490 if (LOOKUP_NAMESPACES_ONLY (flags))
3492 /* We are not interested in types. */
3493 if (val && TREE_CODE (val) == NAMESPACE_DECL)
3494 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, val);
3495 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
3498 /* If looking for a type, or if there is no non-type binding, select
3499 the value binding. */
3500 if (binding->type && (!val || (flags & LOOKUP_PREFER_TYPES)))
3501 val = binding->type;
3502 /* Don't return non-types if we really prefer types. */
3503 else if (val && LOOKUP_TYPES_ONLY (flags)
3504 && ! DECL_DECLARES_TYPE_P (val))
3507 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, val);
3510 /* Unscoped lookup of a global: iterate over current namespaces,
3511 considering using-directives. */
3514 unqualified_namespace_lookup (tree name, int flags)
3516 tree initial = current_decl_namespace ();
3517 tree scope = initial;
3519 struct cp_binding_level *level;
3520 tree val = NULL_TREE;
3521 struct scope_binding binding = EMPTY_SCOPE_BINDING;
3523 timevar_push (TV_NAME_LOOKUP);
3525 for (; !val; scope = CP_DECL_CONTEXT (scope))
3528 cxx_scope_find_binding_for_name (NAMESPACE_LEVEL (scope), name);
3532 if (b->value && DECL_P (b->value)
3533 && DECL_LANG_SPECIFIC (b->value)
3534 && DECL_ANTICIPATED (b->value))
3535 /* Ignore anticipated built-in functions. */
3538 binding.value = b->value;
3539 binding.type = b->type;
3542 /* Add all _DECLs seen through local using-directives. */
3543 for (level = current_binding_level;
3544 level->kind != sk_namespace;
3545 level = level->level_chain)
3546 if (!lookup_using_namespace (name, &binding, level->using_directives,
3548 /* Give up because of error. */
3549 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
3551 /* Add all _DECLs seen through global using-directives. */
3552 /* XXX local and global using lists should work equally. */
3556 if (!lookup_using_namespace (name, &binding,
3557 DECL_NAMESPACE_USING (siter),
3559 /* Give up because of error. */
3560 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
3561 if (siter == scope) break;
3562 siter = CP_DECL_CONTEXT (siter);
3565 val = select_decl (&binding, flags);
3566 if (scope == global_namespace)
3569 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, val);
3572 /* Look up NAME (an IDENTIFIER_NODE) in SCOPE (either a NAMESPACE_DECL
3573 or a class TYPE). If IS_TYPE_P is TRUE, then ignore non-type
3576 Returns a DECL (or OVERLOAD, or BASELINK) representing the
3577 declaration found. If no suitable declaration can be found,
3578 ERROR_MARK_NODE is returned. If COMPLAIN is true and SCOPE is
3579 neither a class-type nor a namespace a diagnostic is issued. */
3582 lookup_qualified_name (tree scope, tree name, bool is_type_p, bool complain)
3586 if (TREE_CODE (scope) == NAMESPACE_DECL)
3588 struct scope_binding binding = EMPTY_SCOPE_BINDING;
3590 flags |= LOOKUP_COMPLAIN;
3592 flags |= LOOKUP_PREFER_TYPES;
3593 if (qualified_lookup_using_namespace (name, scope, &binding, flags))
3594 return select_decl (&binding, flags);
3596 else if (is_aggr_type (scope, complain))
3599 t = lookup_member (scope, name, 2, is_type_p);
3604 return error_mark_node;
3607 /* Subroutine of unqualified_namespace_lookup:
3608 Add the bindings of NAME in used namespaces to VAL.
3609 We are currently looking for names in namespace SCOPE, so we
3610 look through USINGS for using-directives of namespaces
3611 which have SCOPE as a common ancestor with the current scope.
3612 Returns false on errors. */
3615 lookup_using_namespace (tree name, struct scope_binding *val,
3616 tree usings, tree scope, int flags)
3619 timevar_push (TV_NAME_LOOKUP);
3620 /* Iterate over all used namespaces in current, searching for using
3621 directives of scope. */
3622 for (iter = usings; iter; iter = TREE_CHAIN (iter))
3623 if (TREE_VALUE (iter) == scope)
3625 tree used = ORIGINAL_NAMESPACE (TREE_PURPOSE (iter));
3627 cxx_scope_find_binding_for_name (NAMESPACE_LEVEL (used), name);
3628 /* Resolve ambiguities. */
3630 ambiguous_decl (name, val, val1, flags);
3632 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, val->value != error_mark_node);
3636 Accepts the NAME to lookup and its qualifying SCOPE.
3637 Returns the name/type pair found into the cxx_binding *RESULT,
3638 or false on error. */
3641 qualified_lookup_using_namespace (tree name, tree scope,
3642 struct scope_binding *result, int flags)
3644 /* Maintain a list of namespaces visited... */
3645 tree seen = NULL_TREE;
3646 /* ... and a list of namespace yet to see. */
3647 tree todo = NULL_TREE;
3648 tree todo_maybe = NULL_TREE;
3650 timevar_push (TV_NAME_LOOKUP);
3651 /* Look through namespace aliases. */
3652 scope = ORIGINAL_NAMESPACE (scope);
3653 while (scope && result->value != error_mark_node)
3655 cxx_binding *binding =
3656 cxx_scope_find_binding_for_name (NAMESPACE_LEVEL (scope), name);
3657 seen = tree_cons (scope, NULL_TREE, seen);
3659 ambiguous_decl (name, result, binding, flags);
3661 /* Consider strong using directives always, and non-strong ones
3662 if we haven't found a binding yet. ??? Shouldn't we consider
3663 non-strong ones if the initial RESULT is non-NULL, but the
3664 binding in the given namespace is? */
3665 for (usings = DECL_NAMESPACE_USING (scope); usings;
3666 usings = TREE_CHAIN (usings))
3667 /* If this was a real directive, and we have not seen it. */
3668 if (!TREE_INDIRECT_USING (usings))
3670 /* Try to avoid queuing the same namespace more than once,
3671 the exception being when a namespace was already
3672 enqueued for todo_maybe and then a strong using is
3673 found for it. We could try to remove it from
3674 todo_maybe, but it's probably not worth the effort. */
3675 if (is_associated_namespace (scope, TREE_PURPOSE (usings))
3676 && !purpose_member (TREE_PURPOSE (usings), seen)
3677 && !purpose_member (TREE_PURPOSE (usings), todo))
3678 todo = tree_cons (TREE_PURPOSE (usings), NULL_TREE, todo);
3679 else if ((!result->value && !result->type)
3680 && !purpose_member (TREE_PURPOSE (usings), seen)
3681 && !purpose_member (TREE_PURPOSE (usings), todo)
3682 && !purpose_member (TREE_PURPOSE (usings), todo_maybe))
3683 todo_maybe = tree_cons (TREE_PURPOSE (usings), NULL_TREE,
3688 scope = TREE_PURPOSE (todo);
3689 todo = TREE_CHAIN (todo);
3692 && (!result->value && !result->type))
3694 scope = TREE_PURPOSE (todo_maybe);
3695 todo = TREE_CHAIN (todo_maybe);
3696 todo_maybe = NULL_TREE;
3699 scope = NULL_TREE; /* If there never was a todo list. */
3701 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, result->value != error_mark_node);
3704 /* Return the innermost non-namespace binding for NAME from a scope
3705 containing BINDING, or, if BINDING is NULL, the current scope. If
3706 CLASS_P is false, then class bindings are ignored. */
3709 outer_binding (tree name,
3710 cxx_binding *binding,
3715 cxx_scope *outer_scope;
3719 scope = binding->scope->level_chain;
3720 outer = binding->previous;
3724 scope = current_binding_level;
3725 outer = IDENTIFIER_BINDING (name);
3727 outer_scope = outer ? outer->scope : NULL;
3729 /* Because we create class bindings lazily, we might be missing a
3730 class binding for NAME. If there are any class binding levels
3731 between the LAST_BINDING_LEVEL and the scope in which OUTER was
3732 declared, we must lookup NAME in those class scopes. */
3734 while (scope && scope != outer_scope && scope->kind != sk_namespace)
3736 if (scope->kind == sk_class)
3738 cxx_binding *class_binding;
3740 class_binding = get_class_binding (name, scope);
3743 /* Thread this new class-scope binding onto the
3744 IDENTIFIER_BINDING list so that future lookups
3746 class_binding->previous = outer;
3748 binding->previous = class_binding;
3750 IDENTIFIER_BINDING (name) = class_binding;
3751 return class_binding;
3754 scope = scope->level_chain;
3760 /* Return the innermost block-scope or class-scope value binding for
3761 NAME, or NULL_TREE if there is no such binding. */
3764 innermost_non_namespace_value (tree name)
3766 cxx_binding *binding;
3767 binding = outer_binding (name, /*binding=*/NULL, /*class_p=*/true);
3768 return binding ? binding->value : NULL_TREE;
3771 /* Look up NAME in the current binding level and its superiors in the
3772 namespace of variables, functions and typedefs. Return a ..._DECL
3773 node of some kind representing its definition if there is only one
3774 such declaration, or return a TREE_LIST with all the overloaded
3775 definitions if there are many, or return 0 if it is undefined.
3777 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
3778 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
3779 Otherwise we prefer non-TYPE_DECLs.
3781 If NONCLASS is nonzero, bindings in class scopes are ignored. If
3782 BLOCK_P is false, bindings in block scopes are ignored. */
3785 lookup_name_real (tree name, int prefer_type, int nonclass, bool block_p,
3786 int namespaces_only, int flags)
3789 tree val = NULL_TREE;
3791 timevar_push (TV_NAME_LOOKUP);
3792 /* Conversion operators are handled specially because ordinary
3793 unqualified name lookup will not find template conversion
3795 if (IDENTIFIER_TYPENAME_P (name))
3797 struct cp_binding_level *level;
3799 for (level = current_binding_level;
3800 level && level->kind != sk_namespace;
3801 level = level->level_chain)
3806 /* A conversion operator can only be declared in a class
3808 if (level->kind != sk_class)
3811 /* Lookup the conversion operator in the class. */
3812 class_type = level->this_entity;
3813 operators = lookup_fnfields (class_type, name, /*protect=*/0);
3815 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, operators);
3818 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
3821 flags |= lookup_flags (prefer_type, namespaces_only);
3823 /* First, look in non-namespace scopes. */
3825 if (current_class_type == NULL_TREE)
3828 if (block_p || !nonclass)
3829 for (iter = outer_binding (name, NULL, !nonclass);
3831 iter = outer_binding (name, iter, !nonclass))
3835 /* Skip entities we don't want. */
3836 if (LOCAL_BINDING_P (iter) ? !block_p : nonclass)
3839 /* If this is the kind of thing we're looking for, we're done. */
3840 if (qualify_lookup (iter->value, flags))
3841 binding = iter->value;
3842 else if ((flags & LOOKUP_PREFER_TYPES)
3843 && qualify_lookup (iter->type, flags))
3844 binding = iter->type;
3846 binding = NULL_TREE;
3855 /* Now lookup in namespace scopes. */
3857 val = unqualified_namespace_lookup (name, flags);
3861 /* If we have a single function from a using decl, pull it out. */
3862 if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val))
3863 val = OVL_FUNCTION (val);
3866 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, val);
3870 lookup_name_nonclass (tree name)
3872 return lookup_name_real (name, 0, 1, /*block_p=*/true, 0, LOOKUP_COMPLAIN);
3876 lookup_function_nonclass (tree name, tree args, bool block_p)
3879 lookup_arg_dependent (name,
3880 lookup_name_real (name, 0, 1, block_p, 0,
3886 lookup_name (tree name, int prefer_type)
3888 return lookup_name_real (name, prefer_type, 0, /*block_p=*/true,
3889 0, LOOKUP_COMPLAIN);
3892 /* Look up NAME for type used in elaborated name specifier in
3893 the scopes given by SCOPE. SCOPE can be either TS_CURRENT or
3894 TS_WITHIN_ENCLOSING_NON_CLASS. Although not implied by the
3895 name, more scopes are checked if cleanup or template parameter
3896 scope is encountered.
3898 Unlike lookup_name_real, we make sure that NAME is actually
3899 declared in the desired scope, not from inheritance, nor using
3900 directive. For using declaration, there is DR138 still waiting
3903 A TYPE_DECL best matching the NAME is returned. Catching error
3904 and issuing diagnostics are caller's responsibility. */
3907 lookup_type_scope (tree name, tag_scope scope)
3909 cxx_binding *iter = NULL;
3910 tree val = NULL_TREE;
3912 timevar_push (TV_NAME_LOOKUP);
3914 /* Look in non-namespace scope first. */
3915 if (current_binding_level->kind != sk_namespace)
3916 iter = outer_binding (name, NULL, /*class_p=*/ true);
3917 for (; iter; iter = outer_binding (name, iter, /*class_p=*/ true))
3919 /* Check if this is the kind of thing we're looking for.
3920 If SCOPE is TS_CURRENT, also make sure it doesn't come from
3921 base class. For ITER->VALUE, we can simply use
3922 INHERITED_VALUE_BINDING_P. For ITER->TYPE, we have to use
3925 We check ITER->TYPE before ITER->VALUE in order to handle
3926 typedef struct C {} C;
3929 if (qualify_lookup (iter->type, LOOKUP_PREFER_TYPES)
3930 && (scope != ts_current
3931 || LOCAL_BINDING_P (iter)
3932 || DECL_CONTEXT (iter->type) == iter->scope->this_entity))
3934 else if ((scope != ts_current
3935 || !INHERITED_VALUE_BINDING_P (iter))
3936 && qualify_lookup (iter->value, LOOKUP_PREFER_TYPES))
3943 /* Look in namespace scope. */
3946 iter = cxx_scope_find_binding_for_name
3947 (NAMESPACE_LEVEL (current_decl_namespace ()), name);
3951 /* If this is the kind of thing we're looking for, we're done.
3952 Ignore names found via using declaration. See DR138 for
3954 if (qualify_lookup (iter->type, LOOKUP_PREFER_TYPES))
3956 else if (qualify_lookup (iter->value, LOOKUP_PREFER_TYPES))
3962 /* Type found, check if it is in the allowed scopes, ignoring cleanup
3963 and template parameter scopes. */
3966 struct cp_binding_level *b = current_binding_level;
3969 if (iter->scope == b)
3970 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, val);
3972 if (b->kind == sk_cleanup || b->kind == sk_template_parms)
3974 else if (b->kind == sk_class
3975 && scope == ts_within_enclosing_non_class)
3982 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
3985 /* Similar to `lookup_name' but look only in the innermost non-class
3989 lookup_name_innermost_nonclass_level (tree name)
3991 struct cp_binding_level *b;
3994 timevar_push (TV_NAME_LOOKUP);
3995 b = innermost_nonclass_level ();
3997 if (b->kind == sk_namespace)
3999 t = IDENTIFIER_NAMESPACE_VALUE (name);
4001 /* extern "C" function() */
4002 if (t != NULL_TREE && TREE_CODE (t) == TREE_LIST)
4005 else if (IDENTIFIER_BINDING (name)
4006 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name)))
4008 cxx_binding *binding;
4009 binding = IDENTIFIER_BINDING (name);
4012 if (binding->scope == b
4013 && !(TREE_CODE (binding->value) == VAR_DECL
4014 && DECL_DEAD_FOR_LOCAL (binding->value)))
4015 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, binding->value);
4017 if (b->kind == sk_cleanup)
4024 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
4027 /* Like lookup_name_innermost_nonclass_level, but for types. */
4030 lookup_type_current_level (tree name)
4034 timevar_push (TV_NAME_LOOKUP);
4035 gcc_assert (current_binding_level->kind != sk_namespace);
4037 if (REAL_IDENTIFIER_TYPE_VALUE (name) != NULL_TREE
4038 && REAL_IDENTIFIER_TYPE_VALUE (name) != global_type_node)
4040 struct cp_binding_level *b = current_binding_level;
4043 if (purpose_member (name, b->type_shadowed))
4044 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP,
4045 REAL_IDENTIFIER_TYPE_VALUE (name));
4046 if (b->kind == sk_cleanup)
4053 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
4056 /* [basic.lookup.koenig] */
4057 /* A nonzero return value in the functions below indicates an error. */
4067 static bool arg_assoc (struct arg_lookup*, tree);
4068 static bool arg_assoc_args (struct arg_lookup*, tree);
4069 static bool arg_assoc_type (struct arg_lookup*, tree);
4070 static bool add_function (struct arg_lookup *, tree);
4071 static bool arg_assoc_namespace (struct arg_lookup *, tree);
4072 static bool arg_assoc_class (struct arg_lookup *, tree);
4073 static bool arg_assoc_template_arg (struct arg_lookup*, tree);
4075 /* Add a function to the lookup structure.
4076 Returns true on error. */
4079 add_function (struct arg_lookup *k, tree fn)
4081 /* We used to check here to see if the function was already in the list,
4082 but that's O(n^2), which is just too expensive for function lookup.
4083 Now we deal with the occasional duplicate in joust. In doing this, we
4084 assume that the number of duplicates will be small compared to the
4085 total number of functions being compared, which should usually be the
4088 /* We must find only functions, or exactly one non-function. */
4091 else if (fn == k->functions)
4093 else if (is_overloaded_fn (k->functions) && is_overloaded_fn (fn))
4094 k->functions = build_overload (fn, k->functions);
4097 tree f1 = OVL_CURRENT (k->functions);
4099 if (is_overloaded_fn (f1))
4101 fn = f1; f1 = f2; f2 = fn;
4103 cp_error_at ("%qD is not a function,", f1);
4104 cp_error_at (" conflict with %qD", f2);
4105 error (" in call to %qD", k->name);
4112 /* Returns true iff CURRENT has declared itself to be an associated
4113 namespace of SCOPE via a strong using-directive (or transitive chain
4114 thereof). Both are namespaces. */
4117 is_associated_namespace (tree current, tree scope)
4119 tree seen = NULL_TREE;
4120 tree todo = NULL_TREE;
4124 if (scope == current)
4126 seen = tree_cons (scope, NULL_TREE, seen);
4127 for (t = DECL_NAMESPACE_ASSOCIATIONS (scope); t; t = TREE_CHAIN (t))
4128 if (!purpose_member (TREE_PURPOSE (t), seen))
4129 todo = tree_cons (TREE_PURPOSE (t), NULL_TREE, todo);
4132 scope = TREE_PURPOSE (todo);
4133 todo = TREE_CHAIN (todo);
4140 /* Add functions of a namespace to the lookup structure.
4141 Returns true on error. */
4144 arg_assoc_namespace (struct arg_lookup *k, tree scope)
4148 if (purpose_member (scope, k->namespaces))
4150 k->namespaces = tree_cons (scope, NULL_TREE, k->namespaces);
4152 /* Check out our super-users. */
4153 for (value = DECL_NAMESPACE_ASSOCIATIONS (scope); value;
4154 value = TREE_CHAIN (value))
4155 if (arg_assoc_namespace (k, TREE_PURPOSE (value)))
4158 value = namespace_binding (k->name, scope);
4162 for (; value; value = OVL_NEXT (value))
4163 if (add_function (k, OVL_CURRENT (value)))
4169 /* Adds everything associated with a template argument to the lookup
4170 structure. Returns true on error. */
4173 arg_assoc_template_arg (struct arg_lookup *k, tree arg)
4175 /* [basic.lookup.koenig]
4177 If T is a template-id, its associated namespaces and classes are
4178 ... the namespaces and classes associated with the types of the
4179 template arguments provided for template type parameters
4180 (excluding template template parameters); the namespaces in which
4181 any template template arguments are defined; and the classes in
4182 which any member templates used as template template arguments
4183 are defined. [Note: non-type template arguments do not
4184 contribute to the set of associated namespaces. ] */
4186 /* Consider first template template arguments. */
4187 if (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM
4188 || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE)
4190 else if (TREE_CODE (arg) == TEMPLATE_DECL)
4192 tree ctx = CP_DECL_CONTEXT (arg);
4194 /* It's not a member template. */
4195 if (TREE_CODE (ctx) == NAMESPACE_DECL)
4196 return arg_assoc_namespace (k, ctx);
4197 /* Otherwise, it must be member template. */
4199 return arg_assoc_class (k, ctx);
4201 /* It's not a template template argument, but it is a type template
4203 else if (TYPE_P (arg))
4204 return arg_assoc_type (k, arg);
4205 /* It's a non-type template argument. */
4210 /* Adds everything associated with class to the lookup structure.
4211 Returns true on error. */
4214 arg_assoc_class (struct arg_lookup *k, tree type)
4216 tree list, friends, context;
4219 /* Backend build structures, such as __builtin_va_list, aren't
4220 affected by all this. */
4221 if (!CLASS_TYPE_P (type))
4224 if (purpose_member (type, k->classes))
4226 k->classes = tree_cons (type, NULL_TREE, k->classes);
4228 context = decl_namespace_context (type);
4229 if (arg_assoc_namespace (k, context))
4232 if (TYPE_BINFO (type))
4234 /* Process baseclasses. */
4235 tree binfo, base_binfo;
4237 for (binfo = TYPE_BINFO (type), i = 0;
4238 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
4239 if (arg_assoc_class (k, BINFO_TYPE (base_binfo)))
4243 /* Process friends. */
4244 for (list = DECL_FRIENDLIST (TYPE_MAIN_DECL (type)); list;
4245 list = TREE_CHAIN (list))
4246 if (k->name == FRIEND_NAME (list))
4247 for (friends = FRIEND_DECLS (list); friends;
4248 friends = TREE_CHAIN (friends))
4250 tree fn = TREE_VALUE (friends);
4252 /* Only interested in global functions with potentially hidden
4253 (i.e. unqualified) declarations. */
4254 if (CP_DECL_CONTEXT (fn) != context)
4256 /* Template specializations are never found by name lookup.
4257 (Templates themselves can be found, but not template
4258 specializations.) */
4259 if (TREE_CODE (fn) == FUNCTION_DECL && DECL_USE_TEMPLATE (fn))
4261 if (add_function (k, fn))
4265 /* Process template arguments. */
4266 if (CLASSTYPE_TEMPLATE_INFO (type)
4267 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type)))
4269 list = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type));
4270 for (i = 0; i < TREE_VEC_LENGTH (list); ++i)
4271 arg_assoc_template_arg (k, TREE_VEC_ELT (list, i));
4277 /* Adds everything associated with a given type.
4278 Returns 1 on error. */
4281 arg_assoc_type (struct arg_lookup *k, tree type)
4283 /* As we do not get the type of non-type dependent expressions
4284 right, we can end up with such things without a type. */
4288 if (TYPE_PTRMEM_P (type))
4290 /* Pointer to member: associate class type and value type. */
4291 if (arg_assoc_type (k, TYPE_PTRMEM_CLASS_TYPE (type)))
4293 return arg_assoc_type (k, TYPE_PTRMEM_POINTED_TO_TYPE (type));
4295 else switch (TREE_CODE (type))
4308 if (TYPE_PTRMEMFUNC_P (type))
4309 return arg_assoc_type (k, TYPE_PTRMEMFUNC_FN_TYPE (type));
4310 return arg_assoc_class (k, type);
4312 case REFERENCE_TYPE:
4314 return arg_assoc_type (k, TREE_TYPE (type));
4317 return arg_assoc_namespace (k, decl_namespace_context (type));
4319 /* The basetype is referenced in the first arg type, so just
4322 /* Associate the parameter types. */
4323 if (arg_assoc_args (k, TYPE_ARG_TYPES (type)))
4325 /* Associate the return type. */
4326 return arg_assoc_type (k, TREE_TYPE (type));
4327 case TEMPLATE_TYPE_PARM:
4328 case BOUND_TEMPLATE_TEMPLATE_PARM:
4333 gcc_assert (type == unknown_type_node);
4341 /* Adds everything associated with arguments. Returns true on error. */
4344 arg_assoc_args (struct arg_lookup *k, tree args)
4346 for (; args; args = TREE_CHAIN (args))
4347 if (arg_assoc (k, TREE_VALUE (args)))
4352 /* Adds everything associated with a given tree_node. Returns 1 on error. */
4355 arg_assoc (struct arg_lookup *k, tree n)
4357 if (n == error_mark_node)
4361 return arg_assoc_type (k, n);
4363 if (! type_unknown_p (n))
4364 return arg_assoc_type (k, TREE_TYPE (n));
4366 if (TREE_CODE (n) == ADDR_EXPR)
4367 n = TREE_OPERAND (n, 0);
4368 if (TREE_CODE (n) == COMPONENT_REF)
4369 n = TREE_OPERAND (n, 1);
4370 if (TREE_CODE (n) == OFFSET_REF)
4371 n = TREE_OPERAND (n, 1);
4372 while (TREE_CODE (n) == TREE_LIST)
4374 if (TREE_CODE (n) == BASELINK)
4375 n = BASELINK_FUNCTIONS (n);
4377 if (TREE_CODE (n) == FUNCTION_DECL)
4378 return arg_assoc_type (k, TREE_TYPE (n));
4379 if (TREE_CODE (n) == TEMPLATE_ID_EXPR)
4381 /* [basic.lookup.koenig]
4383 If T is a template-id, its associated namespaces and classes
4384 are the namespace in which the template is defined; for
4385 member templates, the member template's class... */
4386 tree template = TREE_OPERAND (n, 0);
4387 tree args = TREE_OPERAND (n, 1);
4391 if (TREE_CODE (template) == COMPONENT_REF)
4392 template = TREE_OPERAND (template, 1);
4394 /* First, the template. There may actually be more than one if
4395 this is an overloaded function template. But, in that case,
4396 we only need the first; all the functions will be in the same
4398 template = OVL_CURRENT (template);
4400 ctx = CP_DECL_CONTEXT (template);
4402 if (TREE_CODE (ctx) == NAMESPACE_DECL)
4404 if (arg_assoc_namespace (k, ctx) == 1)
4407 /* It must be a member template. */
4408 else if (arg_assoc_class (k, ctx) == 1)
4411 /* Now the arguments. */
4412 for (ix = TREE_VEC_LENGTH (args); ix--;)
4413 if (arg_assoc_template_arg (k, TREE_VEC_ELT (args, ix)) == 1)
4416 else if (TREE_CODE (n) == OVERLOAD)
4418 for (; n; n = OVL_CHAIN (n))
4419 if (arg_assoc_type (k, TREE_TYPE (OVL_FUNCTION (n))))
4426 /* Performs Koenig lookup depending on arguments, where fns
4427 are the functions found in normal lookup. */
4430 lookup_arg_dependent (tree name, tree fns, tree args)
4432 struct arg_lookup k;
4433 tree fn = NULL_TREE;
4435 timevar_push (TV_NAME_LOOKUP);
4438 k.classes = NULL_TREE;
4440 /* We've already looked at some namespaces during normal unqualified
4441 lookup -- but we don't know exactly which ones. If the functions
4442 we found were brought into the current namespace via a using
4443 declaration, we have not really checked the namespace from which
4444 they came. Therefore, we check all namespaces here -- unless the
4445 function we have is from the current namespace. Even then, we
4446 must check all namespaces if the function is a local
4447 declaration; any other declarations present at namespace scope
4448 should be visible during argument-dependent lookup. */
4450 fn = OVL_CURRENT (fns);
4451 if (fn && TREE_CODE (fn) == FUNCTION_DECL
4452 && (CP_DECL_CONTEXT (fn) != current_decl_namespace ()
4453 || DECL_LOCAL_FUNCTION_P (fn)))
4454 k.namespaces = NULL_TREE;
4456 /* Setting NAMESPACES is purely an optimization; it prevents
4457 adding functions which are already in FNS. Adding them would
4458 be safe -- "joust" will eliminate the duplicates -- but
4460 k.namespaces = build_tree_list (current_decl_namespace (), NULL_TREE);
4462 arg_assoc_args (&k, args);
4463 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, k.functions);
4466 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4467 changed (i.e. there was already a directive), or the fresh
4468 TREE_LIST otherwise. */
4471 push_using_directive (tree used)
4473 tree ud = current_binding_level->using_directives;
4474 tree iter, ancestor;
4476 timevar_push (TV_NAME_LOOKUP);
4477 /* Check if we already have this. */
4478 if (purpose_member (used, ud) != NULL_TREE)
4479 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
4481 ancestor = namespace_ancestor (current_decl_namespace (), used);
4482 ud = current_binding_level->using_directives;
4483 ud = tree_cons (used, ancestor, ud);
4484 current_binding_level->using_directives = ud;
4486 /* Recursively add all namespaces used. */
4487 for (iter = DECL_NAMESPACE_USING (used); iter; iter = TREE_CHAIN (iter))
4488 push_using_directive (TREE_PURPOSE (iter));
4490 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, ud);
4493 /* The type TYPE is being declared. If it is a class template, or a
4494 specialization of a class template, do any processing required and
4495 perform error-checking. If IS_FRIEND is nonzero, this TYPE is
4496 being declared a friend. B is the binding level at which this TYPE
4499 Returns the TYPE_DECL for TYPE, which may have been altered by this
4503 maybe_process_template_type_declaration (tree type, int globalize,
4506 tree decl = TYPE_NAME (type);
4508 if (processing_template_parmlist)
4509 /* You can't declare a new template type in a template parameter
4510 list. But, you can declare a non-template type:
4512 template <class A*> struct S;
4514 is a forward-declaration of `A'. */
4518 gcc_assert (IS_AGGR_TYPE (type) || TREE_CODE (type) == ENUMERAL_TYPE);
4520 if (processing_template_decl)
4522 /* This may change after the call to
4523 push_template_decl_real, but we want the original value. */
4524 tree name = DECL_NAME (decl);
4526 decl = push_template_decl_real (decl, globalize);
4527 /* If the current binding level is the binding level for the
4528 template parameters (see the comment in
4529 begin_template_parm_list) and the enclosing level is a class
4530 scope, and we're not looking at a friend, push the
4531 declaration of the member class into the class scope. In the
4532 friend case, push_template_decl will already have put the
4533 friend into global scope, if appropriate. */
4534 if (TREE_CODE (type) != ENUMERAL_TYPE
4535 && !globalize && b->kind == sk_template_parms
4536 && b->level_chain->kind == sk_class)
4538 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type));
4540 if (!COMPLETE_TYPE_P (current_class_type))
4542 maybe_add_class_template_decl_list (current_class_type,
4543 type, /*friend_p=*/0);
4544 /* Put this UDT in the table of UDTs for the class. */
4545 if (CLASSTYPE_NESTED_UTDS (current_class_type) == NULL)
4546 CLASSTYPE_NESTED_UTDS (current_class_type) =
4547 binding_table_new (SCOPE_DEFAULT_HT_SIZE);
4549 binding_table_insert
4550 (CLASSTYPE_NESTED_UTDS (current_class_type), name, type);
4559 /* Push a tag name NAME for struct/class/union/enum type TYPE.
4560 Normally put it into the inner-most non-sk_cleanup scope,
4561 but if GLOBALIZE is true, put it in the inner-most non-class scope.
4562 The latter is needed for implicit declarations.
4563 Returns TYPE upon success and ERROR_MARK_NODE otherwise. */
4566 pushtag (tree name, tree type, int globalize)
4568 struct cp_binding_level *b;
4570 timevar_push (TV_NAME_LOOKUP);
4571 b = current_binding_level;
4572 while (/* Cleanup scopes are not scopes from the point of view of
4574 b->kind == sk_cleanup
4575 /* Neither are the scopes used to hold template parameters
4576 for an explicit specialization. For an ordinary template
4577 declaration, these scopes are not scopes from the point of
4578 view of the language -- but we need a place to stash
4579 things that will go in the containing namespace when the
4580 template is instantiated. */
4581 || (b->kind == sk_template_parms && b->explicit_spec_p)
4582 || (b->kind == sk_class
4584 /* We may be defining a new type in the initializer
4585 of a static member variable. We allow this when
4586 not pedantic, and it is particularly useful for
4587 type punning via an anonymous union. */
4588 || COMPLETE_TYPE_P (b->this_entity))))
4593 /* Do C++ gratuitous typedefing. */
4594 if (IDENTIFIER_TYPE_VALUE (name) != type)
4598 tree context = TYPE_CONTEXT (type);
4602 tree cs = current_scope ();
4606 else if (cs != NULL_TREE && TYPE_P (cs))
4607 /* When declaring a friend class of a local class, we want
4608 to inject the newly named class into the scope
4609 containing the local class, not the namespace scope. */
4610 context = decl_function_context (get_type_decl (cs));
4613 context = current_namespace;
4615 if (b->kind == sk_class
4616 || (b->kind == sk_template_parms
4617 && b->level_chain->kind == sk_class))
4620 if (current_lang_name == lang_name_java)
4621 TYPE_FOR_JAVA (type) = 1;
4623 d = create_implicit_typedef (name, type);
4624 DECL_CONTEXT (d) = FROB_CONTEXT (context);
4626 set_identifier_type_value_with_scope (name, d, b);
4628 d = maybe_process_template_type_declaration (type,
4630 if (d == error_mark_node)
4631 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4633 if (b->kind == sk_class)
4635 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
4636 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
4637 class. But if it's a member template class, we
4638 want the TEMPLATE_DECL, not the TYPE_DECL, so this
4640 finish_member_declaration (d);
4642 pushdecl_class_level (d);
4645 d = pushdecl_with_scope (d, b);
4647 if (d == error_mark_node)
4648 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4650 /* FIXME what if it gets a name from typedef? */
4651 if (ANON_AGGRNAME_P (name))
4652 DECL_IGNORED_P (d) = 1;
4654 TYPE_CONTEXT (type) = DECL_CONTEXT (d);
4656 /* If this is a local class, keep track of it. We need this
4657 information for name-mangling, and so that it is possible to find
4658 all function definitions in a translation unit in a convenient
4659 way. (It's otherwise tricky to find a member function definition
4660 it's only pointed to from within a local class.) */
4661 if (TYPE_CONTEXT (type)
4662 && TREE_CODE (TYPE_CONTEXT (type)) == FUNCTION_DECL
4663 && !processing_template_decl)
4664 VARRAY_PUSH_TREE (local_classes, type);
4666 if (b->kind == sk_class
4667 && !COMPLETE_TYPE_P (current_class_type))
4669 maybe_add_class_template_decl_list (current_class_type,
4670 type, /*friend_p=*/0);
4672 if (CLASSTYPE_NESTED_UTDS (current_class_type) == NULL)
4673 CLASSTYPE_NESTED_UTDS (current_class_type)
4674 = binding_table_new (SCOPE_DEFAULT_HT_SIZE);
4676 binding_table_insert
4677 (CLASSTYPE_NESTED_UTDS (current_class_type), name, type);
4681 if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL)
4682 /* Use the canonical TYPE_DECL for this node. */
4683 TYPE_STUB_DECL (type) = TYPE_NAME (type);
4686 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
4687 will be the tagged type we just added to the current
4688 binding level. This fake NULL-named TYPE_DECL node helps
4689 dwarfout.c to know when it needs to output a
4690 representation of a tagged type, and it also gives us a
4691 convenient place to record the "scope start" address for
4694 tree d = build_decl (TYPE_DECL, NULL_TREE, type);
4695 TYPE_STUB_DECL (type) = pushdecl_with_scope (d, b);
4697 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, type);
4700 /* Subroutines for reverting temporarily to top-level for instantiation
4701 of templates and such. We actually need to clear out the class- and
4702 local-value slots of all identifiers, so that only the global values
4703 are at all visible. Simply setting current_binding_level to the global
4704 scope isn't enough, because more binding levels may be pushed. */
4705 struct saved_scope *scope_chain;
4707 /* If ID has not already been marked, add an appropriate binding to
4711 store_binding (tree id, VEC(cxx_saved_binding) **old_bindings)
4713 cxx_saved_binding *saved;
4715 if (!id || !IDENTIFIER_BINDING (id))
4718 if (IDENTIFIER_MARKED (id))
4721 IDENTIFIER_MARKED (id) = 1;
4723 saved = VEC_safe_push (cxx_saved_binding, *old_bindings, NULL);
4724 saved->identifier = id;
4725 saved->binding = IDENTIFIER_BINDING (id);
4726 saved->real_type_value = REAL_IDENTIFIER_TYPE_VALUE (id);
4727 IDENTIFIER_BINDING (id) = NULL;
4731 store_bindings (tree names, VEC(cxx_saved_binding) **old_bindings)
4735 timevar_push (TV_NAME_LOOKUP);
4736 for (t = names; t; t = TREE_CHAIN (t))
4740 if (TREE_CODE (t) == TREE_LIST)
4741 id = TREE_PURPOSE (t);
4745 store_binding (id, old_bindings);
4747 timevar_pop (TV_NAME_LOOKUP);
4750 /* Like store_bindings, but NAMES is a vector of cp_class_binding
4751 objects, rather than a TREE_LIST. */
4754 store_class_bindings (VEC(cp_class_binding) *names,
4755 VEC(cxx_saved_binding) **old_bindings)
4758 cp_class_binding *cb;
4760 timevar_push (TV_NAME_LOOKUP);
4761 for (i = 0; VEC_iterate(cp_class_binding, names, i, cb); ++i)
4762 store_binding (cb->identifier, old_bindings);
4763 timevar_pop (TV_NAME_LOOKUP);
4767 push_to_top_level (void)
4769 struct saved_scope *s;
4770 struct cp_binding_level *b;
4771 cxx_saved_binding *sb;
4775 timevar_push (TV_NAME_LOOKUP);
4776 s = GGC_CNEW (struct saved_scope);
4778 b = scope_chain ? current_binding_level : 0;
4780 /* If we're in the middle of some function, save our state. */
4784 push_function_context_to (NULL_TREE);
4789 if (scope_chain && previous_class_level)
4790 store_class_bindings (previous_class_level->class_shadowed,
4793 /* Have to include the global scope, because class-scope decls
4794 aren't listed anywhere useful. */
4795 for (; b; b = b->level_chain)
4799 /* Template IDs are inserted into the global level. If they were
4800 inserted into namespace level, finish_file wouldn't find them
4801 when doing pending instantiations. Therefore, don't stop at
4802 namespace level, but continue until :: . */
4803 if (global_scope_p (b))
4806 store_bindings (b->names, &s->old_bindings);
4807 /* We also need to check class_shadowed to save class-level type
4808 bindings, since pushclass doesn't fill in b->names. */
4809 if (b->kind == sk_class)
4810 store_class_bindings (b->class_shadowed, &s->old_bindings);
4812 /* Unwind type-value slots back to top level. */
4813 for (t = b->type_shadowed; t; t = TREE_CHAIN (t))
4814 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t), TREE_VALUE (t));
4817 for (i = 0; VEC_iterate (cxx_saved_binding, s->old_bindings, i, sb); ++i)
4818 IDENTIFIER_MARKED (sb->identifier) = 0;
4820 s->prev = scope_chain;
4822 s->need_pop_function_context = need_pop;
4823 s->function_decl = current_function_decl;
4826 current_function_decl = NULL_TREE;
4827 VARRAY_TREE_INIT (current_lang_base, 10, "current_lang_base");
4828 current_lang_name = lang_name_cplusplus;
4829 current_namespace = global_namespace;
4830 timevar_pop (TV_NAME_LOOKUP);
4834 pop_from_top_level (void)
4836 struct saved_scope *s = scope_chain;
4837 cxx_saved_binding *saved;
4840 timevar_push (TV_NAME_LOOKUP);
4841 /* Clear out class-level bindings cache. */
4842 if (previous_class_level)
4843 invalidate_class_lookup_cache ();
4845 current_lang_base = 0;
4847 scope_chain = s->prev;
4848 for (i = 0; VEC_iterate (cxx_saved_binding, s->old_bindings, i, saved); ++i)
4850 tree id = saved->identifier;
4852 IDENTIFIER_BINDING (id) = saved->binding;
4853 SET_IDENTIFIER_TYPE_VALUE (id, saved->real_type_value);
4856 /* If we were in the middle of compiling a function, restore our
4858 if (s->need_pop_function_context)
4859 pop_function_context_from (NULL_TREE);
4860 current_function_decl = s->function_decl;
4861 timevar_pop (TV_NAME_LOOKUP);
4864 /* Pop off extraneous binding levels left over due to syntax errors.
4866 We don't pop past namespaces, as they might be valid. */
4869 pop_everything (void)
4871 if (ENABLE_SCOPE_CHECKING)
4872 verbatim ("XXX entering pop_everything ()\n");
4873 while (!toplevel_bindings_p ())
4875 if (current_binding_level->kind == sk_class)
4876 pop_nested_class ();
4880 if (ENABLE_SCOPE_CHECKING)
4881 verbatim ("XXX leaving pop_everything ()\n");
4884 /* Emit debugging information for using declarations and directives.
4885 If input tree is overloaded fn then emit debug info for all
4889 cp_emit_debug_info_for_using (tree t, tree context)
4891 /* Ignore this FUNCTION_DECL if it refers to a builtin declaration
4892 of a builtin function. */
4893 if (TREE_CODE (t) == FUNCTION_DECL
4894 && DECL_EXTERNAL (t)
4895 && DECL_BUILT_IN (t))
4898 /* Do not supply context to imported_module_or_decl, if
4899 it is a global namespace. */
4900 if (context == global_namespace)
4901 context = NULL_TREE;
4904 t = BASELINK_FUNCTIONS (t);
4906 /* FIXME: Handle TEMPLATE_DECLs. */
4907 for (t = OVL_CURRENT (t); t; t = OVL_NEXT (t))
4908 if (TREE_CODE (t) != TEMPLATE_DECL)
4909 (*debug_hooks->imported_module_or_decl) (t, context);
4912 #include "gt-cp-name-lookup.h"