1 /* Definitions for C++ name lookup routines.
2 Copyright (C) 2003-2015 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 3, 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 COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
23 #include "coretypes.h"
29 #include "double-int.h"
36 #include "stringpool.h"
37 #include "print-tree.h"
40 #include "name-lookup.h"
42 #include "diagnostic-core.h"
45 #include "c-family/c-pragma.h"
48 /* The bindings for a particular name in a particular scope. */
50 struct scope_binding
{
54 #define EMPTY_SCOPE_BINDING { NULL_TREE, NULL_TREE }
56 static cp_binding_level
*innermost_nonclass_level (void);
57 static cxx_binding
*binding_for_name (cp_binding_level
*, tree
);
58 static tree
push_overloaded_decl (tree
, int, bool);
59 static bool lookup_using_namespace (tree
, struct scope_binding
*, tree
,
61 static bool qualified_lookup_using_namespace (tree
, tree
,
62 struct scope_binding
*, int);
63 static tree
lookup_type_current_level (tree
);
64 static tree
push_using_directive (tree
);
65 static tree
lookup_extern_c_fun_in_all_ns (tree
);
66 static void diagnose_name_conflict (tree
, tree
);
68 /* The :: namespace. */
70 tree global_namespace
;
72 /* The name of the anonymous namespace, throughout this translation
74 static GTY(()) tree anonymous_namespace_name
;
76 /* Initialize anonymous_namespace_name if necessary, and return it. */
79 get_anonymous_namespace_name (void)
81 if (!anonymous_namespace_name
)
83 /* We used to use get_file_function_name here, but that isn't
84 necessary now that anonymous namespace typeinfos
85 are !TREE_PUBLIC, and thus compared by address. */
86 /* The demangler expects anonymous namespaces to be called
87 something starting with '_GLOBAL__N_'. */
88 anonymous_namespace_name
= get_identifier ("_GLOBAL__N_1");
90 return anonymous_namespace_name
;
93 /* Compute the chain index of a binding_entry given the HASH value of its
94 name and the total COUNT of chains. COUNT is assumed to be a power
97 #define ENTRY_INDEX(HASH, COUNT) (((HASH) >> 3) & ((COUNT) - 1))
99 /* A free list of "binding_entry"s awaiting for re-use. */
101 static GTY((deletable
)) binding_entry free_binding_entry
= NULL
;
103 /* Create a binding_entry object for (NAME, TYPE). */
105 static inline binding_entry
106 binding_entry_make (tree name
, tree type
)
110 if (free_binding_entry
)
112 entry
= free_binding_entry
;
113 free_binding_entry
= entry
->chain
;
116 entry
= ggc_alloc
<binding_entry_s
> ();
125 /* Put ENTRY back on the free list. */
128 binding_entry_free (binding_entry entry
)
132 entry
->chain
= free_binding_entry
;
133 free_binding_entry
= entry
;
137 /* The datatype used to implement the mapping from names to types at
139 struct GTY(()) binding_table_s
{
140 /* Array of chains of "binding_entry"s */
141 binding_entry
* GTY((length ("%h.chain_count"))) chain
;
143 /* The number of chains in this table. This is the length of the
144 member "chain" considered as an array. */
147 /* Number of "binding_entry"s in this table. */
151 /* Construct TABLE with an initial CHAIN_COUNT. */
154 binding_table_construct (binding_table table
, size_t chain_count
)
156 table
->chain_count
= chain_count
;
157 table
->entry_count
= 0;
158 table
->chain
= ggc_cleared_vec_alloc
<binding_entry
> (table
->chain_count
);
161 /* Make TABLE's entries ready for reuse. */
164 binding_table_free (binding_table table
)
172 for (i
= 0, count
= table
->chain_count
; i
< count
; ++i
)
174 binding_entry temp
= table
->chain
[i
];
177 binding_entry entry
= temp
;
179 binding_entry_free (entry
);
181 table
->chain
[i
] = NULL
;
183 table
->entry_count
= 0;
187 /* Allocate a table with CHAIN_COUNT, assumed to be a power of two. */
189 static inline binding_table
190 binding_table_new (size_t chain_count
)
192 binding_table table
= ggc_alloc
<binding_table_s
> ();
194 binding_table_construct (table
, chain_count
);
198 /* Expand TABLE to twice its current chain_count. */
201 binding_table_expand (binding_table table
)
203 const size_t old_chain_count
= table
->chain_count
;
204 const size_t old_entry_count
= table
->entry_count
;
205 const size_t new_chain_count
= 2 * old_chain_count
;
206 binding_entry
*old_chains
= table
->chain
;
209 binding_table_construct (table
, new_chain_count
);
210 for (i
= 0; i
< old_chain_count
; ++i
)
212 binding_entry entry
= old_chains
[i
];
213 for (; entry
!= NULL
; entry
= old_chains
[i
])
215 const unsigned int hash
= IDENTIFIER_HASH_VALUE (entry
->name
);
216 const size_t j
= ENTRY_INDEX (hash
, new_chain_count
);
218 old_chains
[i
] = entry
->chain
;
219 entry
->chain
= table
->chain
[j
];
220 table
->chain
[j
] = entry
;
223 table
->entry_count
= old_entry_count
;
226 /* Insert a binding for NAME to TYPE into TABLE. */
229 binding_table_insert (binding_table table
, tree name
, tree type
)
231 const unsigned int hash
= IDENTIFIER_HASH_VALUE (name
);
232 const size_t i
= ENTRY_INDEX (hash
, table
->chain_count
);
233 binding_entry entry
= binding_entry_make (name
, type
);
235 entry
->chain
= table
->chain
[i
];
236 table
->chain
[i
] = entry
;
237 ++table
->entry_count
;
239 if (3 * table
->chain_count
< 5 * table
->entry_count
)
240 binding_table_expand (table
);
243 /* Return the binding_entry, if any, that maps NAME. */
246 binding_table_find (binding_table table
, tree name
)
248 const unsigned int hash
= IDENTIFIER_HASH_VALUE (name
);
249 binding_entry entry
= table
->chain
[ENTRY_INDEX (hash
, table
->chain_count
)];
251 while (entry
!= NULL
&& entry
->name
!= name
)
252 entry
= entry
->chain
;
257 /* Apply PROC -- with DATA -- to all entries in TABLE. */
260 binding_table_foreach (binding_table table
, bt_foreach_proc proc
, void *data
)
268 chain_count
= table
->chain_count
;
269 for (i
= 0; i
< chain_count
; ++i
)
271 binding_entry entry
= table
->chain
[i
];
272 for (; entry
!= NULL
; entry
= entry
->chain
)
277 #ifndef ENABLE_SCOPE_CHECKING
278 # define ENABLE_SCOPE_CHECKING 0
280 # define ENABLE_SCOPE_CHECKING 1
283 /* A free list of "cxx_binding"s, connected by their PREVIOUS. */
285 static GTY((deletable
)) cxx_binding
*free_bindings
;
287 /* Initialize VALUE and TYPE field for BINDING, and set the PREVIOUS
291 cxx_binding_init (cxx_binding
*binding
, tree value
, tree type
)
293 binding
->value
= value
;
294 binding
->type
= type
;
295 binding
->previous
= NULL
;
298 /* (GC)-allocate a binding object with VALUE and TYPE member initialized. */
301 cxx_binding_make (tree value
, tree type
)
303 cxx_binding
*binding
;
306 binding
= free_bindings
;
307 free_bindings
= binding
->previous
;
310 binding
= ggc_alloc
<cxx_binding
> ();
312 cxx_binding_init (binding
, value
, type
);
317 /* Put BINDING back on the free list. */
320 cxx_binding_free (cxx_binding
*binding
)
322 binding
->scope
= NULL
;
323 binding
->previous
= free_bindings
;
324 free_bindings
= binding
;
327 /* Create a new binding for NAME (with the indicated VALUE and TYPE
328 bindings) in the class scope indicated by SCOPE. */
331 new_class_binding (tree name
, tree value
, tree type
, cp_binding_level
*scope
)
333 cp_class_binding cb
= {cxx_binding_make (value
, type
), name
};
334 cxx_binding
*binding
= cb
.base
;
335 vec_safe_push (scope
->class_shadowed
, cb
);
336 binding
->scope
= scope
;
340 /* Make DECL the innermost binding for ID. The LEVEL is the binding
341 level at which this declaration is being bound. */
344 push_binding (tree id
, tree decl
, cp_binding_level
* level
)
346 cxx_binding
*binding
;
348 if (level
!= class_binding_level
)
350 binding
= cxx_binding_make (decl
, NULL_TREE
);
351 binding
->scope
= level
;
354 binding
= new_class_binding (id
, decl
, /*type=*/NULL_TREE
, level
);
356 /* Now, fill in the binding information. */
357 binding
->previous
= IDENTIFIER_BINDING (id
);
358 INHERITED_VALUE_BINDING_P (binding
) = 0;
359 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
361 /* And put it on the front of the list of bindings for ID. */
362 IDENTIFIER_BINDING (id
) = binding
;
365 /* Remove the binding for DECL which should be the innermost binding
369 pop_binding (tree id
, tree decl
)
371 cxx_binding
*binding
;
374 /* It's easiest to write the loops that call this function without
375 checking whether or not the entities involved have names. We
376 get here for such an entity. */
379 /* Get the innermost binding for ID. */
380 binding
= IDENTIFIER_BINDING (id
);
382 /* The name should be bound. */
383 gcc_assert (binding
!= NULL
);
385 /* The DECL will be either the ordinary binding or the type
386 binding for this identifier. Remove that binding. */
387 if (binding
->value
== decl
)
388 binding
->value
= NULL_TREE
;
391 gcc_assert (binding
->type
== decl
);
392 binding
->type
= NULL_TREE
;
395 if (!binding
->value
&& !binding
->type
)
397 /* We're completely done with the innermost binding for this
398 identifier. Unhook it from the list of bindings. */
399 IDENTIFIER_BINDING (id
) = binding
->previous
;
401 /* Add it to the free list. */
402 cxx_binding_free (binding
);
406 /* Remove the bindings for the decls of the current level and leave
407 the current scope. */
410 pop_bindings_and_leave_scope (void)
412 for (tree t
= getdecls (); t
; t
= DECL_CHAIN (t
))
413 pop_binding (DECL_NAME (t
), t
);
417 /* Strip non dependent using declarations. If DECL is dependent,
418 surreptitiously create a typename_type and return it. */
421 strip_using_decl (tree decl
)
423 if (decl
== NULL_TREE
)
426 while (TREE_CODE (decl
) == USING_DECL
&& !DECL_DEPENDENT_P (decl
))
427 decl
= USING_DECL_DECLS (decl
);
429 if (TREE_CODE (decl
) == USING_DECL
&& DECL_DEPENDENT_P (decl
)
430 && USING_DECL_TYPENAME_P (decl
))
432 /* We have found a type introduced by a using
433 declaration at class scope that refers to a dependent
436 using typename :: [opt] nested-name-specifier unqualified-id ;
438 decl
= make_typename_type (TREE_TYPE (decl
),
440 typename_type
, tf_error
);
441 if (decl
!= error_mark_node
)
442 decl
= TYPE_NAME (decl
);
448 /* BINDING records an existing declaration for a name in the current scope.
449 But, DECL is another declaration for that same identifier in the
450 same scope. This is the `struct stat' hack whereby a non-typedef
451 class name or enum-name can be bound at the same level as some other
455 A class name (9.1) or enumeration name (7.2) can be hidden by the
456 name of an object, function, or enumerator declared in the same scope.
457 If a class or enumeration name and an object, function, or enumerator
458 are declared in the same scope (in any order) with the same name, the
459 class or enumeration name is hidden wherever the object, function, or
460 enumerator name is visible.
462 It's the responsibility of the caller to check that
463 inserting this name is valid here. Returns nonzero if the new binding
467 supplement_binding_1 (cxx_binding
*binding
, tree decl
)
469 tree bval
= binding
->value
;
471 tree target_bval
= strip_using_decl (bval
);
472 tree target_decl
= strip_using_decl (decl
);
474 if (TREE_CODE (target_decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (target_decl
)
475 && target_decl
!= target_bval
476 && (TREE_CODE (target_bval
) != TYPE_DECL
477 /* We allow pushing an enum multiple times in a class
478 template in order to handle late matching of underlying
479 type on an opaque-enum-declaration followed by an
481 || (processing_template_decl
482 && TREE_CODE (TREE_TYPE (target_decl
)) == ENUMERAL_TYPE
483 && TREE_CODE (TREE_TYPE (target_bval
)) == ENUMERAL_TYPE
484 && (dependent_type_p (ENUM_UNDERLYING_TYPE
485 (TREE_TYPE (target_decl
)))
486 || dependent_type_p (ENUM_UNDERLYING_TYPE
487 (TREE_TYPE (target_bval
)))))))
488 /* The new name is the type name. */
489 binding
->type
= decl
;
490 else if (/* TARGET_BVAL is null when push_class_level_binding moves
491 an inherited type-binding out of the way to make room
492 for a new value binding. */
494 /* TARGET_BVAL is error_mark_node when TARGET_DECL's name
495 has been used in a non-class scope prior declaration.
496 In that case, we should have already issued a
497 diagnostic; for graceful error recovery purpose, pretend
498 this was the intended declaration for that name. */
499 || target_bval
== error_mark_node
500 /* If TARGET_BVAL is anticipated but has not yet been
501 declared, pretend it is not there at all. */
502 || (TREE_CODE (target_bval
) == FUNCTION_DECL
503 && DECL_ANTICIPATED (target_bval
)
504 && !DECL_HIDDEN_FRIEND_P (target_bval
)))
505 binding
->value
= decl
;
506 else if (TREE_CODE (target_bval
) == TYPE_DECL
507 && DECL_ARTIFICIAL (target_bval
)
508 && target_decl
!= target_bval
509 && (TREE_CODE (target_decl
) != TYPE_DECL
510 || same_type_p (TREE_TYPE (target_decl
),
511 TREE_TYPE (target_bval
))))
513 /* The old binding was a type name. It was placed in
514 VALUE field because it was thought, at the point it was
515 declared, to be the only entity with such a name. Move the
516 type name into the type slot; it is now hidden by the new
518 binding
->type
= bval
;
519 binding
->value
= decl
;
520 binding
->value_is_inherited
= false;
522 else if (TREE_CODE (target_bval
) == TYPE_DECL
523 && TREE_CODE (target_decl
) == TYPE_DECL
524 && DECL_NAME (target_decl
) == DECL_NAME (target_bval
)
525 && binding
->scope
->kind
!= sk_class
526 && (same_type_p (TREE_TYPE (target_decl
), TREE_TYPE (target_bval
))
527 /* If either type involves template parameters, we must
528 wait until instantiation. */
529 || uses_template_parms (TREE_TYPE (target_decl
))
530 || uses_template_parms (TREE_TYPE (target_bval
))))
531 /* We have two typedef-names, both naming the same type to have
532 the same name. In general, this is OK because of:
536 In a given scope, a typedef specifier can be used to redefine
537 the name of any type declared in that scope to refer to the
538 type to which it already refers.
540 However, in class scopes, this rule does not apply due to the
541 stricter language in [class.mem] prohibiting redeclarations of
544 /* There can be two block-scope declarations of the same variable,
545 so long as they are `extern' declarations. However, there cannot
546 be two declarations of the same static data member:
550 A member shall not be declared twice in the
551 member-specification. */
552 else if (VAR_P (target_decl
)
553 && VAR_P (target_bval
)
554 && DECL_EXTERNAL (target_decl
) && DECL_EXTERNAL (target_bval
)
555 && !DECL_CLASS_SCOPE_P (target_decl
))
557 duplicate_decls (decl
, binding
->value
, /*newdecl_is_friend=*/false);
560 else if (TREE_CODE (decl
) == NAMESPACE_DECL
561 && TREE_CODE (bval
) == NAMESPACE_DECL
562 && DECL_NAMESPACE_ALIAS (decl
)
563 && DECL_NAMESPACE_ALIAS (bval
)
564 && ORIGINAL_NAMESPACE (bval
) == ORIGINAL_NAMESPACE (decl
))
567 In a declarative region, a namespace-alias-definition can be
568 used to redefine a namespace-alias declared in that declarative
569 region to refer only to the namespace to which it already
572 else if (maybe_remove_implicit_alias (bval
))
574 /* There was a mangling compatibility alias using this mangled name,
575 but now we have a real decl that wants to use it instead. */
576 binding
->value
= decl
;
580 diagnose_name_conflict (decl
, bval
);
587 /* Diagnose a name conflict between DECL and BVAL. */
590 diagnose_name_conflict (tree decl
, tree bval
)
592 if (TREE_CODE (decl
) == TREE_CODE (bval
)
593 && (TREE_CODE (decl
) != TYPE_DECL
594 || (DECL_ARTIFICIAL (decl
) && DECL_ARTIFICIAL (bval
))
595 || (!DECL_ARTIFICIAL (decl
) && !DECL_ARTIFICIAL (bval
)))
596 && !is_overloaded_fn (decl
))
597 error ("redeclaration of %q#D", decl
);
599 error ("%q#D conflicts with a previous declaration", decl
);
601 inform (input_location
, "previous declaration %q+#D", bval
);
604 /* Wrapper for supplement_binding_1. */
607 supplement_binding (cxx_binding
*binding
, tree decl
)
610 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
611 ret
= supplement_binding_1 (binding
, decl
);
612 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
616 /* Add DECL to the list of things declared in B. */
619 add_decl_to_level (tree decl
, cp_binding_level
*b
)
621 /* We used to record virtual tables as if they were ordinary
622 variables, but no longer do so. */
623 gcc_assert (!(VAR_P (decl
) && DECL_VIRTUAL_P (decl
)));
625 if (TREE_CODE (decl
) == NAMESPACE_DECL
626 && !DECL_NAMESPACE_ALIAS (decl
))
628 DECL_CHAIN (decl
) = b
->namespaces
;
629 b
->namespaces
= decl
;
633 /* We build up the list in reverse order, and reverse it later if
635 TREE_CHAIN (decl
) = b
->names
;
638 /* If appropriate, add decl to separate list of statics. We
639 include extern variables because they might turn out to be
640 static later. It's OK for this list to contain a few false
642 if (b
->kind
== sk_namespace
)
644 && (TREE_STATIC (decl
) || DECL_EXTERNAL (decl
)))
645 || (TREE_CODE (decl
) == FUNCTION_DECL
646 && (!TREE_PUBLIC (decl
)
647 || decl_anon_ns_mem_p (decl
)
648 || DECL_DECLARED_INLINE_P (decl
))))
649 vec_safe_push (b
->static_decls
, decl
);
653 /* Record a decl-node X as belonging to the current lexical scope.
654 Check for errors (such as an incompatible declaration for the same
655 name already seen in the same scope). IS_FRIEND is true if X is
656 declared as a friend.
658 Returns either X or an old decl for the same name.
659 If an old decl is returned, it may have been smashed
660 to agree with what X says. */
663 pushdecl_maybe_friend_1 (tree x
, bool is_friend
)
667 int need_new_binding
;
669 if (x
== error_mark_node
)
670 return error_mark_node
;
672 need_new_binding
= 1;
674 if (DECL_TEMPLATE_PARM_P (x
))
675 /* Template parameters have no context; they are not X::T even
676 when declared within a class or namespace. */
680 if (current_function_decl
&& x
!= current_function_decl
681 /* A local declaration for a function doesn't constitute
683 && TREE_CODE (x
) != FUNCTION_DECL
684 /* A local declaration for an `extern' variable is in the
685 scope of the current namespace, not the current
687 && !(VAR_P (x
) && DECL_EXTERNAL (x
))
688 /* When parsing the parameter list of a function declarator,
689 don't set DECL_CONTEXT to an enclosing function. When we
690 push the PARM_DECLs in order to process the function body,
691 current_binding_level->this_entity will be set. */
692 && !(TREE_CODE (x
) == PARM_DECL
693 && current_binding_level
->kind
== sk_function_parms
694 && current_binding_level
->this_entity
== NULL
)
695 && !DECL_CONTEXT (x
))
696 DECL_CONTEXT (x
) = current_function_decl
;
698 /* If this is the declaration for a namespace-scope function,
699 but the declaration itself is in a local scope, mark the
701 if (TREE_CODE (x
) == FUNCTION_DECL
702 && DECL_NAMESPACE_SCOPE_P (x
)
703 && current_function_decl
704 && x
!= current_function_decl
)
705 DECL_LOCAL_FUNCTION_P (x
) = 1;
708 name
= DECL_NAME (x
);
711 int different_binding_level
= 0;
713 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
714 name
= TREE_OPERAND (name
, 0);
716 /* In case this decl was explicitly namespace-qualified, look it
717 up in its namespace context. */
718 if (DECL_NAMESPACE_SCOPE_P (x
) && namespace_bindings_p ())
719 t
= namespace_binding (name
, DECL_CONTEXT (x
));
721 t
= lookup_name_innermost_nonclass_level (name
);
723 /* [basic.link] If there is a visible declaration of an entity
724 with linkage having the same name and type, ignoring entities
725 declared outside the innermost enclosing namespace scope, the
726 block scope declaration declares that same entity and
727 receives the linkage of the previous declaration. */
728 if (! t
&& current_function_decl
&& x
!= current_function_decl
729 && VAR_OR_FUNCTION_DECL_P (x
)
730 && DECL_EXTERNAL (x
))
732 /* Look in block scope. */
733 t
= innermost_non_namespace_value (name
);
734 /* Or in the innermost namespace. */
736 t
= namespace_binding (name
, DECL_CONTEXT (x
));
737 /* Does it have linkage? Note that if this isn't a DECL, it's an
738 OVERLOAD, which is OK. */
739 if (t
&& DECL_P (t
) && ! (TREE_STATIC (t
) || DECL_EXTERNAL (t
)))
742 different_binding_level
= 1;
745 /* If we are declaring a function, and the result of name-lookup
746 was an OVERLOAD, look for an overloaded instance that is
747 actually the same as the function we are declaring. (If
748 there is one, we have to merge our declaration with the
749 previous declaration.) */
750 if (t
&& TREE_CODE (t
) == OVERLOAD
)
754 if (TREE_CODE (x
) == FUNCTION_DECL
)
755 for (match
= t
; match
; match
= OVL_NEXT (match
))
757 if (decls_match (OVL_CURRENT (match
), x
))
761 /* Just choose one. */
765 t
= OVL_CURRENT (match
);
770 if (t
&& t
!= error_mark_node
)
772 if (different_binding_level
)
774 if (decls_match (x
, t
))
775 /* The standard only says that the local extern
776 inherits linkage from the previous decl; in
777 particular, default args are not shared. Add
778 the decl into a hash table to make sure only
779 the previous decl in this case is seen by the
782 struct cxx_int_tree_map
*h
;
784 TREE_PUBLIC (x
) = TREE_PUBLIC (t
);
786 if (cp_function_chain
->extern_decl_map
== NULL
)
787 cp_function_chain
->extern_decl_map
788 = hash_table
<cxx_int_tree_map_hasher
>::create_ggc (20);
790 h
= ggc_alloc
<cxx_int_tree_map
> ();
791 h
->uid
= DECL_UID (x
);
793 cxx_int_tree_map
**loc
= cp_function_chain
->extern_decl_map
794 ->find_slot (h
, INSERT
);
798 else if (TREE_CODE (t
) == PARM_DECL
)
800 /* Check for duplicate params. */
801 tree d
= duplicate_decls (x
, t
, is_friend
);
805 else if ((DECL_EXTERN_C_FUNCTION_P (x
)
806 || DECL_FUNCTION_TEMPLATE_P (x
))
807 && is_overloaded_fn (t
))
808 /* Don't do anything just yet. */;
809 else if (t
== wchar_decl_node
)
811 if (! DECL_IN_SYSTEM_HEADER (x
))
812 pedwarn (input_location
, OPT_Wpedantic
, "redeclaration of %<wchar_t%> as %qT",
815 /* Throw away the redeclaration. */
820 tree olddecl
= duplicate_decls (x
, t
, is_friend
);
822 /* If the redeclaration failed, we can stop at this
824 if (olddecl
== error_mark_node
)
825 return error_mark_node
;
829 if (TREE_CODE (t
) == TYPE_DECL
)
830 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
834 else if (DECL_MAIN_P (x
) && TREE_CODE (t
) == FUNCTION_DECL
)
836 /* A redeclaration of main, but not a duplicate of the
841 This function shall not be overloaded. */
842 error ("invalid redeclaration of %q+D", t
);
844 /* We don't try to push this declaration since that
851 /* If x has C linkage-specification, (extern "C"),
852 lookup its binding, in case it's already bound to an object.
853 The lookup is done in all namespaces.
854 If we find an existing binding, make sure it has the same
855 exception specification as x, otherwise, bail in error [7.5, 7.6]. */
856 if ((TREE_CODE (x
) == FUNCTION_DECL
)
857 && DECL_EXTERN_C_P (x
)
858 /* We should ignore declarations happening in system headers. */
859 && !DECL_ARTIFICIAL (x
)
860 && !DECL_IN_SYSTEM_HEADER (x
))
862 tree previous
= lookup_extern_c_fun_in_all_ns (x
);
864 && !DECL_ARTIFICIAL (previous
)
865 && !DECL_IN_SYSTEM_HEADER (previous
)
866 && DECL_CONTEXT (previous
) != DECL_CONTEXT (x
))
868 /* In case either x or previous is declared to throw an exception,
869 make sure both exception specifications are equal. */
870 if (decls_match (x
, previous
))
872 tree x_exception_spec
= NULL_TREE
;
873 tree previous_exception_spec
= NULL_TREE
;
876 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (x
));
877 previous_exception_spec
=
878 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (previous
));
879 if (!comp_except_specs (previous_exception_spec
,
883 pedwarn (input_location
, 0,
884 "declaration of %q#D with C language linkage",
886 pedwarn (input_location
, 0,
887 "conflicts with previous declaration %q+#D",
889 pedwarn (input_location
, 0,
890 "due to different exception specifications");
891 return error_mark_node
;
893 if (DECL_ASSEMBLER_NAME_SET_P (previous
))
894 SET_DECL_ASSEMBLER_NAME (x
,
895 DECL_ASSEMBLER_NAME (previous
));
899 pedwarn (input_location
, 0,
900 "declaration of %q#D with C language linkage", x
);
901 pedwarn (input_location
, 0,
902 "conflicts with previous declaration %q+#D",
908 check_template_shadow (x
);
910 /* If this is a function conjured up by the back end, massage it
911 so it looks friendly. */
912 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_LANG_SPECIFIC (x
))
914 retrofit_lang_decl (x
);
915 SET_DECL_LANGUAGE (x
, lang_c
);
919 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_FUNCTION_MEMBER_P (x
))
921 t
= push_overloaded_decl (x
, PUSH_LOCAL
, is_friend
);
922 if (!namespace_bindings_p ())
923 /* We do not need to create a binding for this name;
924 push_overloaded_decl will have already done so if
926 need_new_binding
= 0;
928 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
930 t
= push_overloaded_decl (x
, PUSH_GLOBAL
, is_friend
);
932 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
935 if (DECL_DECLARES_FUNCTION_P (t
))
937 check_default_args (t
);
939 if (is_friend
&& t
== x
&& !flag_friend_injection
)
941 /* This is a new friend declaration of a function or a
942 function template, so hide it from ordinary function
944 DECL_ANTICIPATED (t
) = 1;
945 DECL_HIDDEN_FRIEND_P (t
) = 1;
949 if (t
!= x
|| DECL_FUNCTION_TEMPLATE_P (t
))
952 /* If declaring a type as a typedef, copy the type (unless we're
953 at line 0), and install this TYPE_DECL as the new type's typedef
954 name. See the extensive comment of set_underlying_type (). */
955 if (TREE_CODE (x
) == TYPE_DECL
)
957 tree type
= TREE_TYPE (x
);
959 if (DECL_IS_BUILTIN (x
)
960 || (TREE_TYPE (x
) != error_mark_node
961 && TYPE_NAME (type
) != x
962 /* We don't want to copy the type when all we're
963 doing is making a TYPE_DECL for the purposes of
965 && (!TYPE_NAME (type
)
966 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
))))
967 set_underlying_type (x
);
969 if (type
!= error_mark_node
970 && TYPE_IDENTIFIER (type
))
971 set_identifier_type_value (DECL_NAME (x
), x
);
973 /* If this is a locally defined typedef in a function that
974 is not a template instantation, record it to implement
975 -Wunused-local-typedefs. */
976 if (!instantiating_current_function_p ())
977 record_locally_defined_typedef (x
);
980 /* Multiple external decls of the same identifier ought to match.
982 We get warnings about inline functions where they are defined.
983 We get warnings about other functions from push_overloaded_decl.
985 Avoid duplicate warnings where they are used. */
986 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
990 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
991 if (decl
&& TREE_CODE (decl
) == OVERLOAD
)
992 decl
= OVL_FUNCTION (decl
);
994 if (decl
&& decl
!= error_mark_node
995 && (DECL_EXTERNAL (decl
) || TREE_PUBLIC (decl
))
996 /* If different sort of thing, we already gave an error. */
997 && TREE_CODE (decl
) == TREE_CODE (x
)
998 && !comptypes (TREE_TYPE (x
), TREE_TYPE (decl
),
999 COMPARE_REDECLARATION
))
1001 if (permerror (input_location
, "type mismatch with previous "
1002 "external decl of %q#D", x
))
1003 inform (input_location
, "previous external decl of %q+#D",
1008 /* This name is new in its binding level.
1009 Install the new declaration and return it. */
1010 if (namespace_bindings_p ())
1012 /* Install a global value. */
1014 /* If the first global decl has external linkage,
1015 warn if we later see static one. */
1016 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
1017 TREE_PUBLIC (name
) = 1;
1019 /* Bind the name for the entity. */
1020 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
1022 && (TREE_CODE (x
) == TYPE_DECL
1024 || TREE_CODE (x
) == NAMESPACE_DECL
1025 || TREE_CODE (x
) == CONST_DECL
1026 || TREE_CODE (x
) == TEMPLATE_DECL
))
1027 SET_IDENTIFIER_NAMESPACE_VALUE (name
, x
);
1029 /* If new decl is `static' and an `extern' was seen previously,
1031 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
1032 warn_extern_redeclared_static (x
, t
);
1036 /* Here to install a non-global value. */
1037 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
1038 tree oldlocal
= NULL_TREE
;
1039 cp_binding_level
*oldscope
= NULL
;
1040 cxx_binding
*oldbinding
= outer_binding (name
, NULL
, true);
1043 oldlocal
= oldbinding
->value
;
1044 oldscope
= oldbinding
->scope
;
1047 if (need_new_binding
)
1049 push_local_binding (name
, x
, 0);
1050 /* Because push_local_binding will hook X on to the
1051 current_binding_level's name list, we don't want to
1052 do that again below. */
1053 need_new_binding
= 0;
1056 /* If this is a TYPE_DECL, push it into the type value slot. */
1057 if (TREE_CODE (x
) == TYPE_DECL
)
1058 set_identifier_type_value (name
, x
);
1060 /* Clear out any TYPE_DECL shadowed by a namespace so that
1061 we won't think this is a type. The C struct hack doesn't
1062 go through namespaces. */
1063 if (TREE_CODE (x
) == NAMESPACE_DECL
)
1064 set_identifier_type_value (name
, NULL_TREE
);
1072 && DECL_DEAD_FOR_LOCAL (oldlocal
))
1073 oldlocal
= DECL_SHADOWED_FOR_VAR (oldlocal
);
1075 if (oldlocal
== NULL_TREE
)
1076 oldlocal
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d
));
1079 /* If this is an extern function declaration, see if we
1080 have a global definition or declaration for the function. */
1081 if (oldlocal
== NULL_TREE
1082 && DECL_EXTERNAL (x
)
1083 && oldglobal
!= NULL_TREE
1084 && TREE_CODE (x
) == FUNCTION_DECL
1085 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
1087 /* We have one. Their types must agree. */
1088 if (decls_match (x
, oldglobal
))
1092 warning (0, "extern declaration of %q#D doesn%'t match", x
);
1093 warning (0, "global declaration %q+#D", oldglobal
);
1096 /* If we have a local external declaration,
1097 and no file-scope declaration has yet been seen,
1098 then if we later have a file-scope decl it must not be static. */
1099 if (oldlocal
== NULL_TREE
1100 && oldglobal
== NULL_TREE
1101 && DECL_EXTERNAL (x
)
1103 TREE_PUBLIC (name
) = 1;
1105 /* Don't complain about the parms we push and then pop
1106 while tentatively parsing a function declarator. */
1107 if (TREE_CODE (x
) == PARM_DECL
&& DECL_CONTEXT (x
) == NULL_TREE
)
1110 /* Warn if shadowing an argument at the top level of the body. */
1111 else if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
1112 /* Inline decls shadow nothing. */
1113 && !DECL_FROM_INLINE (x
)
1114 && (TREE_CODE (oldlocal
) == PARM_DECL
1116 /* If the old decl is a type decl, only warn if the
1117 old decl is an explicit typedef or if both the old
1118 and new decls are type decls. */
1119 || (TREE_CODE (oldlocal
) == TYPE_DECL
1120 && (!DECL_ARTIFICIAL (oldlocal
)
1121 || TREE_CODE (x
) == TYPE_DECL
)))
1122 /* Don't check for internally generated vars unless
1123 it's an implicit typedef (see create_implicit_typedef
1125 && (!DECL_ARTIFICIAL (x
) || DECL_IMPLICIT_TYPEDEF_P (x
)))
1127 bool nowarn
= false;
1129 /* Don't complain if it's from an enclosing function. */
1130 if (DECL_CONTEXT (oldlocal
) == current_function_decl
1131 && TREE_CODE (x
) != PARM_DECL
1132 && TREE_CODE (oldlocal
) == PARM_DECL
)
1134 /* Go to where the parms should be and see if we find
1136 cp_binding_level
*b
= current_binding_level
->level_chain
;
1138 if (FUNCTION_NEEDS_BODY_BLOCK (current_function_decl
))
1139 /* Skip the ctor/dtor cleanup level. */
1143 if (b
->kind
== sk_function_parms
)
1145 error ("declaration of %q#D shadows a parameter", x
);
1150 /* The local structure or class can't use parameters of
1151 the containing function anyway. */
1152 if (DECL_CONTEXT (oldlocal
) != current_function_decl
)
1154 cp_binding_level
*scope
= current_binding_level
;
1155 tree context
= DECL_CONTEXT (oldlocal
);
1156 for (; scope
; scope
= scope
->level_chain
)
1158 if (scope
->kind
== sk_function_parms
1159 && scope
->this_entity
== context
)
1161 if (scope
->kind
== sk_class
1162 && !LAMBDA_TYPE_P (scope
->this_entity
))
1169 /* Error if redeclaring a local declared in a
1170 for-init-statement or in the condition of an if or
1171 switch statement when the new declaration is in the
1172 outermost block of the controlled statement.
1173 Redeclaring a variable from a for or while condition is
1174 detected elsewhere. */
1175 else if (VAR_P (oldlocal
)
1176 && oldscope
== current_binding_level
->level_chain
1177 && (oldscope
->kind
== sk_cond
1178 || oldscope
->kind
== sk_for
))
1180 error ("redeclaration of %q#D", x
);
1181 inform (input_location
, "%q+#D previously declared here",
1186 3.3.3/3: The name declared in an exception-declaration (...)
1187 shall not be redeclared in the outermost block of the handler.
1188 3.3.3/2: A parameter name shall not be redeclared (...) in
1189 the outermost block of any handler associated with a
1191 3.4.1/15: The function parameter names shall not be redeclared
1192 in the exception-declaration nor in the outermost block of a
1193 handler for the function-try-block. */
1194 else if ((VAR_P (oldlocal
)
1195 && oldscope
== current_binding_level
->level_chain
1196 && oldscope
->kind
== sk_catch
)
1197 || (TREE_CODE (oldlocal
) == PARM_DECL
1198 && (current_binding_level
->kind
== sk_catch
1199 || (current_binding_level
->level_chain
->kind
1201 && in_function_try_handler
))
1203 if (permerror (input_location
, "redeclaration of %q#D", x
))
1204 inform (input_location
, "%q+#D previously declared here",
1209 if (warn_shadow
&& !nowarn
)
1213 if (TREE_CODE (oldlocal
) == PARM_DECL
)
1214 warned
= warning_at (input_location
, OPT_Wshadow
,
1215 "declaration of %q#D shadows a parameter", x
);
1216 else if (is_capture_proxy (oldlocal
))
1217 warned
= warning_at (input_location
, OPT_Wshadow
,
1218 "declaration of %qD shadows a lambda capture",
1221 warned
= warning_at (input_location
, OPT_Wshadow
,
1222 "declaration of %qD shadows a previous local",
1226 inform (DECL_SOURCE_LOCATION (oldlocal
),
1227 "shadowed declaration is here");
1231 /* Maybe warn if shadowing something else. */
1232 else if (warn_shadow
&& !DECL_EXTERNAL (x
)
1233 /* No shadow warnings for internally generated vars unless
1234 it's an implicit typedef (see create_implicit_typedef
1236 && (! DECL_ARTIFICIAL (x
) || DECL_IMPLICIT_TYPEDEF_P (x
))
1237 /* No shadow warnings for vars made for inlining. */
1238 && ! DECL_FROM_INLINE (x
))
1242 if (nonlambda_method_basetype ())
1243 member
= lookup_member (current_nonlambda_class_type (),
1246 /*want_type=*/false,
1247 tf_warning_or_error
);
1251 if (member
&& !TREE_STATIC (member
))
1253 if (BASELINK_P (member
))
1254 member
= BASELINK_FUNCTIONS (member
);
1255 member
= OVL_CURRENT (member
);
1257 /* Do not warn if a variable shadows a function, unless
1258 the variable is a function or a pointer-to-function. */
1259 if (TREE_CODE (member
) != FUNCTION_DECL
1260 || TREE_CODE (x
) == FUNCTION_DECL
1261 || TYPE_PTRFN_P (TREE_TYPE (x
))
1262 || TYPE_PTRMEMFUNC_P (TREE_TYPE (x
)))
1264 if (warning_at (input_location
, OPT_Wshadow
,
1265 "declaration of %qD shadows a member of %qT",
1266 x
, current_nonlambda_class_type ())
1268 inform (DECL_SOURCE_LOCATION (member
),
1269 "shadowed declaration is here");
1272 else if (oldglobal
!= NULL_TREE
1273 && (VAR_P (oldglobal
)
1274 /* If the old decl is a type decl, only warn if the
1275 old decl is an explicit typedef or if both the
1276 old and new decls are type decls. */
1277 || (TREE_CODE (oldglobal
) == TYPE_DECL
1278 && (!DECL_ARTIFICIAL (oldglobal
)
1279 || TREE_CODE (x
) == TYPE_DECL
)))
1280 && !instantiating_current_function_p ())
1281 /* XXX shadow warnings in outer-more namespaces */
1283 if (warning_at (input_location
, OPT_Wshadow
,
1284 "declaration of %qD shadows a "
1285 "global declaration", x
))
1286 inform (DECL_SOURCE_LOCATION (oldglobal
),
1287 "shadowed declaration is here");
1293 maybe_register_incomplete_var (x
);
1296 if (need_new_binding
)
1297 add_decl_to_level (x
,
1298 DECL_NAMESPACE_SCOPE_P (x
)
1299 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x
))
1300 : current_binding_level
);
1305 /* Wrapper for pushdecl_maybe_friend_1. */
1308 pushdecl_maybe_friend (tree x
, bool is_friend
)
1311 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
1312 ret
= pushdecl_maybe_friend_1 (x
, is_friend
);
1313 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
1317 /* Record a decl-node X as belonging to the current lexical scope. */
1322 return pushdecl_maybe_friend (x
, false);
1325 /* Enter DECL into the symbol table, if that's appropriate. Returns
1326 DECL, or a modified version thereof. */
1329 maybe_push_decl (tree decl
)
1331 tree type
= TREE_TYPE (decl
);
1333 /* Add this decl to the current binding level, but not if it comes
1334 from another scope, e.g. a static member variable. TEM may equal
1335 DECL or it may be a previous decl of the same name. */
1336 if (decl
== error_mark_node
1337 || (TREE_CODE (decl
) != PARM_DECL
1338 && DECL_CONTEXT (decl
) != NULL_TREE
1339 /* Definitions of namespace members outside their namespace are
1341 && !DECL_NAMESPACE_SCOPE_P (decl
))
1342 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
1343 || type
== unknown_type_node
1344 /* The declaration of a template specialization does not affect
1345 the functions available for overload resolution, so we do not
1347 || (TREE_CODE (decl
) == FUNCTION_DECL
1348 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
1351 return pushdecl (decl
);
1354 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1355 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1356 doesn't really belong to this binding level, that it got here
1357 through a using-declaration. */
1360 push_local_binding (tree id
, tree decl
, int flags
)
1362 cp_binding_level
*b
;
1364 /* Skip over any local classes. This makes sense if we call
1365 push_local_binding with a friend decl of a local class. */
1366 b
= innermost_nonclass_level ();
1368 if (lookup_name_innermost_nonclass_level (id
))
1370 /* Supplement the existing binding. */
1371 if (!supplement_binding (IDENTIFIER_BINDING (id
), decl
))
1372 /* It didn't work. Something else must be bound at this
1373 level. Do not add DECL to the list of things to pop
1378 /* Create a new binding. */
1379 push_binding (id
, decl
, b
);
1381 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
1382 /* We must put the OVERLOAD into a TREE_LIST since the
1383 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1384 decls that got here through a using-declaration. */
1385 decl
= build_tree_list (NULL_TREE
, decl
);
1387 /* And put DECL on the list of things declared by the current
1389 add_decl_to_level (decl
, b
);
1392 /* Check to see whether or not DECL is a variable that would have been
1393 in scope under the ARM, but is not in scope under the ANSI/ISO
1394 standard. If so, issue an error message. If name lookup would
1395 work in both cases, but return a different result, this function
1396 returns the result of ANSI/ISO lookup. Otherwise, it returns
1400 check_for_out_of_scope_variable (tree decl
)
1404 /* We only care about out of scope variables. */
1405 if (!(VAR_P (decl
) && DECL_DEAD_FOR_LOCAL (decl
)))
1408 shadowed
= DECL_HAS_SHADOWED_FOR_VAR_P (decl
)
1409 ? DECL_SHADOWED_FOR_VAR (decl
) : NULL_TREE
;
1410 while (shadowed
!= NULL_TREE
&& VAR_P (shadowed
)
1411 && DECL_DEAD_FOR_LOCAL (shadowed
))
1412 shadowed
= DECL_HAS_SHADOWED_FOR_VAR_P (shadowed
)
1413 ? DECL_SHADOWED_FOR_VAR (shadowed
) : NULL_TREE
;
1415 shadowed
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (decl
));
1418 if (!DECL_ERROR_REPORTED (decl
))
1420 warning (0, "name lookup of %qD changed", DECL_NAME (decl
));
1421 warning (0, " matches this %q+D under ISO standard rules",
1423 warning (0, " matches this %q+D under old rules", decl
);
1424 DECL_ERROR_REPORTED (decl
) = 1;
1429 /* If we have already complained about this declaration, there's no
1430 need to do it again. */
1431 if (DECL_ERROR_REPORTED (decl
))
1434 DECL_ERROR_REPORTED (decl
) = 1;
1436 if (TREE_TYPE (decl
) == error_mark_node
)
1439 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
1441 error ("name lookup of %qD changed for ISO %<for%> scoping",
1443 error (" cannot use obsolete binding at %q+D because "
1444 "it has a destructor", decl
);
1445 return error_mark_node
;
1449 permerror (input_location
, "name lookup of %qD changed for ISO %<for%> scoping",
1451 if (flag_permissive
)
1452 permerror (input_location
, " using obsolete binding at %q+D", decl
);
1458 inform (input_location
, "(if you use %<-fpermissive%> G++ will accept your code)");
1467 /* true means unconditionally make a BLOCK for the next level pushed. */
1469 static bool keep_next_level_flag
;
1471 static int binding_depth
= 0;
1478 for (i
= 0; i
< depth
* 2; i
++)
1482 /* Return a string describing the kind of SCOPE we have. */
1484 cp_binding_level_descriptor (cp_binding_level
*scope
)
1486 /* The order of this table must match the "scope_kind"
1488 static const char* scope_kind_names
[] = {
1494 "function-parameter-scope",
1497 "template-parameter-scope",
1498 "template-explicit-spec-scope"
1500 const scope_kind kind
= scope
->explicit_spec_p
1501 ? sk_template_spec
: scope
->kind
;
1503 return scope_kind_names
[kind
];
1506 /* Output a debugging information about SCOPE when performing
1509 cp_binding_level_debug (cp_binding_level
*scope
, int line
, const char *action
)
1511 const char *desc
= cp_binding_level_descriptor (scope
);
1512 if (scope
->this_entity
)
1513 verbatim ("%s %s(%E) %p %d\n", action
, desc
,
1514 scope
->this_entity
, (void *) scope
, line
);
1516 verbatim ("%s %s %p %d\n", action
, desc
, (void *) scope
, line
);
1519 /* Return the estimated initial size of the hashtable of a NAMESPACE
1522 static inline size_t
1523 namespace_scope_ht_size (tree ns
)
1525 tree name
= DECL_NAME (ns
);
1527 return name
== std_identifier
1528 ? NAMESPACE_STD_HT_SIZE
1529 : (name
== global_scope_name
1530 ? GLOBAL_SCOPE_HT_SIZE
1531 : NAMESPACE_ORDINARY_HT_SIZE
);
1534 /* A chain of binding_level structures awaiting reuse. */
1536 static GTY((deletable
)) cp_binding_level
*free_binding_level
;
1538 /* Insert SCOPE as the innermost binding level. */
1541 push_binding_level (cp_binding_level
*scope
)
1543 /* Add it to the front of currently active scopes stack. */
1544 scope
->level_chain
= current_binding_level
;
1545 current_binding_level
= scope
;
1546 keep_next_level_flag
= false;
1548 if (ENABLE_SCOPE_CHECKING
)
1550 scope
->binding_depth
= binding_depth
;
1551 indent (binding_depth
);
1552 cp_binding_level_debug (scope
, LOCATION_LINE (input_location
),
1558 /* Create a new KIND scope and make it the top of the active scopes stack.
1559 ENTITY is the scope of the associated C++ entity (namespace, class,
1560 function, C++0x enumeration); it is NULL otherwise. */
1563 begin_scope (scope_kind kind
, tree entity
)
1565 cp_binding_level
*scope
;
1567 /* Reuse or create a struct for this binding level. */
1568 if (!ENABLE_SCOPE_CHECKING
&& free_binding_level
)
1570 scope
= free_binding_level
;
1571 memset (scope
, 0, sizeof (cp_binding_level
));
1572 free_binding_level
= scope
->level_chain
;
1575 scope
= ggc_cleared_alloc
<cp_binding_level
> ();
1577 scope
->this_entity
= entity
;
1578 scope
->more_cleanups_ok
= true;
1585 case sk_template_spec
:
1586 scope
->explicit_spec_p
= true;
1587 kind
= sk_template_parms
;
1589 case sk_template_parms
:
1596 case sk_scoped_enum
:
1597 case sk_function_parms
:
1599 scope
->keep
= keep_next_level_flag
;
1603 NAMESPACE_LEVEL (entity
) = scope
;
1604 vec_alloc (scope
->static_decls
,
1605 (DECL_NAME (entity
) == std_identifier
1606 || DECL_NAME (entity
) == global_scope_name
) ? 200 : 10);
1610 /* Should not happen. */
1616 push_binding_level (scope
);
1621 /* We're about to leave current scope. Pop the top of the stack of
1622 currently active scopes. Return the enclosing scope, now active. */
1627 cp_binding_level
*scope
= current_binding_level
;
1629 if (scope
->kind
== sk_namespace
&& class_binding_level
)
1630 current_binding_level
= class_binding_level
;
1632 /* We cannot leave a scope, if there are none left. */
1633 if (NAMESPACE_LEVEL (global_namespace
))
1634 gcc_assert (!global_scope_p (scope
));
1636 if (ENABLE_SCOPE_CHECKING
)
1638 indent (--binding_depth
);
1639 cp_binding_level_debug (scope
, LOCATION_LINE (input_location
),
1643 /* Move one nesting level up. */
1644 current_binding_level
= scope
->level_chain
;
1646 /* Namespace-scopes are left most probably temporarily, not
1647 completely; they can be reopened later, e.g. in namespace-extension
1648 or any name binding activity that requires us to resume a
1649 namespace. For classes, we cache some binding levels. For other
1650 scopes, we just make the structure available for reuse. */
1651 if (scope
->kind
!= sk_namespace
1652 && scope
->kind
!= sk_class
)
1654 scope
->level_chain
= free_binding_level
;
1655 gcc_assert (!ENABLE_SCOPE_CHECKING
1656 || scope
->binding_depth
== binding_depth
);
1657 free_binding_level
= scope
;
1660 if (scope
->kind
== sk_class
)
1662 /* Reset DEFINING_CLASS_P to allow for reuse of a
1663 class-defining scope in a non-defining context. */
1664 scope
->defining_class_p
= 0;
1666 /* Find the innermost enclosing class scope, and reset
1667 CLASS_BINDING_LEVEL appropriately. */
1668 class_binding_level
= NULL
;
1669 for (scope
= current_binding_level
; scope
; scope
= scope
->level_chain
)
1670 if (scope
->kind
== sk_class
)
1672 class_binding_level
= scope
;
1677 return current_binding_level
;
1681 resume_scope (cp_binding_level
* b
)
1683 /* Resuming binding levels is meant only for namespaces,
1684 and those cannot nest into classes. */
1685 gcc_assert (!class_binding_level
);
1686 /* Also, resuming a non-directly nested namespace is a no-no. */
1687 gcc_assert (b
->level_chain
== current_binding_level
);
1688 current_binding_level
= b
;
1689 if (ENABLE_SCOPE_CHECKING
)
1691 b
->binding_depth
= binding_depth
;
1692 indent (binding_depth
);
1693 cp_binding_level_debug (b
, LOCATION_LINE (input_location
), "resume");
1698 /* Return the innermost binding level that is not for a class scope. */
1700 static cp_binding_level
*
1701 innermost_nonclass_level (void)
1703 cp_binding_level
*b
;
1705 b
= current_binding_level
;
1706 while (b
->kind
== sk_class
)
1712 /* We're defining an object of type TYPE. If it needs a cleanup, but
1713 we're not allowed to add any more objects with cleanups to the current
1714 scope, create a new binding level. */
1717 maybe_push_cleanup_level (tree type
)
1719 if (type
!= error_mark_node
1720 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
1721 && current_binding_level
->more_cleanups_ok
== 0)
1723 begin_scope (sk_cleanup
, NULL
);
1724 current_binding_level
->statement_list
= push_stmt_list ();
1728 /* Return true if we are in the global binding level. */
1731 global_bindings_p (void)
1733 return global_scope_p (current_binding_level
);
1736 /* True if we are currently in a toplevel binding level. This
1737 means either the global binding level or a namespace in a toplevel
1738 binding level. Since there are no non-toplevel namespace levels,
1739 this really means any namespace or template parameter level. We
1740 also include a class whose context is toplevel. */
1743 toplevel_bindings_p (void)
1745 cp_binding_level
*b
= innermost_nonclass_level ();
1747 return b
->kind
== sk_namespace
|| b
->kind
== sk_template_parms
;
1750 /* True if this is a namespace scope, or if we are defining a class
1751 which is itself at namespace scope, or whose enclosing class is
1752 such a class, etc. */
1755 namespace_bindings_p (void)
1757 cp_binding_level
*b
= innermost_nonclass_level ();
1759 return b
->kind
== sk_namespace
;
1762 /* True if the innermost non-class scope is a block scope. */
1765 local_bindings_p (void)
1767 cp_binding_level
*b
= innermost_nonclass_level ();
1768 return b
->kind
< sk_function_parms
|| b
->kind
== sk_omp
;
1771 /* True if the current level needs to have a BLOCK made. */
1776 return (current_binding_level
->blocks
!= NULL_TREE
1777 || current_binding_level
->keep
1778 || current_binding_level
->kind
== sk_cleanup
1779 || current_binding_level
->names
!= NULL_TREE
1780 || current_binding_level
->using_directives
);
1783 /* Returns the kind of the innermost scope. */
1786 innermost_scope_kind (void)
1788 return current_binding_level
->kind
;
1791 /* Returns true if this scope was created to store template parameters. */
1794 template_parm_scope_p (void)
1796 return innermost_scope_kind () == sk_template_parms
;
1799 /* If KEEP is true, make a BLOCK node for the next binding level,
1800 unconditionally. Otherwise, use the normal logic to decide whether
1801 or not to create a BLOCK. */
1804 keep_next_level (bool keep
)
1806 keep_next_level_flag
= keep
;
1809 /* Return the list of declarations of the current level.
1810 Note that this list is in reverse order unless/until
1811 you nreverse it; and when you do nreverse it, you must
1812 store the result back using `storedecls' or you will lose. */
1817 return current_binding_level
->names
;
1820 /* Return how many function prototypes we are currently nested inside. */
1823 function_parm_depth (void)
1826 cp_binding_level
*b
;
1828 for (b
= current_binding_level
;
1829 b
->kind
== sk_function_parms
;
1836 /* For debugging. */
1837 static int no_print_functions
= 0;
1838 static int no_print_builtins
= 0;
1841 print_binding_level (cp_binding_level
* lvl
)
1845 fprintf (stderr
, " blocks=%p", (void *) lvl
->blocks
);
1846 if (lvl
->more_cleanups_ok
)
1847 fprintf (stderr
, " more-cleanups-ok");
1848 if (lvl
->have_cleanups
)
1849 fprintf (stderr
, " have-cleanups");
1850 fprintf (stderr
, "\n");
1853 fprintf (stderr
, " names:\t");
1854 /* We can probably fit 3 names to a line? */
1855 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
1857 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
1859 if (no_print_builtins
1860 && (TREE_CODE (t
) == TYPE_DECL
)
1861 && DECL_IS_BUILTIN (t
))
1864 /* Function decls tend to have longer names. */
1865 if (TREE_CODE (t
) == FUNCTION_DECL
)
1872 fprintf (stderr
, "\n\t");
1875 print_node_brief (stderr
, "", t
, 0);
1876 if (t
== error_mark_node
)
1880 fprintf (stderr
, "\n");
1882 if (vec_safe_length (lvl
->class_shadowed
))
1885 cp_class_binding
*b
;
1886 fprintf (stderr
, " class-shadowed:");
1887 FOR_EACH_VEC_ELT (*lvl
->class_shadowed
, i
, b
)
1888 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (b
->identifier
));
1889 fprintf (stderr
, "\n");
1891 if (lvl
->type_shadowed
)
1893 fprintf (stderr
, " type-shadowed:");
1894 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
1896 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1898 fprintf (stderr
, "\n");
1903 debug (cp_binding_level
&ref
)
1905 print_binding_level (&ref
);
1909 debug (cp_binding_level
*ptr
)
1914 fprintf (stderr
, "<nil>\n");
1919 print_other_binding_stack (cp_binding_level
*stack
)
1921 cp_binding_level
*level
;
1922 for (level
= stack
; !global_scope_p (level
); level
= level
->level_chain
)
1924 fprintf (stderr
, "binding level %p\n", (void *) level
);
1925 print_binding_level (level
);
1930 print_binding_stack (void)
1932 cp_binding_level
*b
;
1933 fprintf (stderr
, "current_binding_level=%p\n"
1934 "class_binding_level=%p\n"
1935 "NAMESPACE_LEVEL (global_namespace)=%p\n",
1936 (void *) current_binding_level
, (void *) class_binding_level
,
1937 (void *) NAMESPACE_LEVEL (global_namespace
));
1938 if (class_binding_level
)
1940 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
1941 if (b
== current_binding_level
)
1944 b
= class_binding_level
;
1946 b
= current_binding_level
;
1949 b
= current_binding_level
;
1950 print_other_binding_stack (b
);
1951 fprintf (stderr
, "global:\n");
1952 print_binding_level (NAMESPACE_LEVEL (global_namespace
));
1955 /* Return the type associated with ID. */
1958 identifier_type_value_1 (tree id
)
1960 /* There is no type with that name, anywhere. */
1961 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
1963 /* This is not the type marker, but the real thing. */
1964 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
1965 return REAL_IDENTIFIER_TYPE_VALUE (id
);
1966 /* Have to search for it. It must be on the global level, now.
1967 Ask lookup_name not to return non-types. */
1968 id
= lookup_name_real (id
, 2, 1, /*block_p=*/true, 0, 0);
1970 return TREE_TYPE (id
);
1974 /* Wrapper for identifier_type_value_1. */
1977 identifier_type_value (tree id
)
1980 timevar_start (TV_NAME_LOOKUP
);
1981 ret
= identifier_type_value_1 (id
);
1982 timevar_stop (TV_NAME_LOOKUP
);
1987 /* Return the IDENTIFIER_GLOBAL_VALUE of T, for use in common code, since
1988 the definition of IDENTIFIER_GLOBAL_VALUE is different for C and C++. */
1991 identifier_global_value (tree t
)
1993 return IDENTIFIER_GLOBAL_VALUE (t
);
1996 /* Push a definition of struct, union or enum tag named ID. into
1997 binding_level B. DECL is a TYPE_DECL for the type. We assume that
1998 the tag ID is not already defined. */
2001 set_identifier_type_value_with_scope (tree id
, tree decl
, cp_binding_level
*b
)
2005 if (b
->kind
!= sk_namespace
)
2007 /* Shadow the marker, not the real thing, so that the marker
2008 gets restored later. */
2009 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2011 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2012 type
= decl
? TREE_TYPE (decl
) : NULL_TREE
;
2013 TREE_TYPE (b
->type_shadowed
) = type
;
2017 cxx_binding
*binding
=
2018 binding_for_name (NAMESPACE_LEVEL (current_namespace
), id
);
2021 supplement_binding (binding
, decl
);
2023 binding
->value
= decl
;
2025 /* Store marker instead of real type. */
2026 type
= global_type_node
;
2028 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2031 /* As set_identifier_type_value_with_scope, but using
2032 current_binding_level. */
2035 set_identifier_type_value (tree id
, tree decl
)
2037 set_identifier_type_value_with_scope (id
, decl
, current_binding_level
);
2040 /* Return the name for the constructor (or destructor) for the
2041 specified class TYPE. When given a template, this routine doesn't
2042 lose the specialization. */
2045 constructor_name_full (tree type
)
2047 return TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
2050 /* Return the name for the constructor (or destructor) for the
2051 specified class. When given a template, return the plain
2052 unspecialized name. */
2055 constructor_name (tree type
)
2058 name
= constructor_name_full (type
);
2059 if (IDENTIFIER_TEMPLATE (name
))
2060 name
= IDENTIFIER_TEMPLATE (name
);
2064 /* Returns TRUE if NAME is the name for the constructor for TYPE,
2065 which must be a class type. */
2068 constructor_name_p (tree name
, tree type
)
2072 gcc_assert (MAYBE_CLASS_TYPE_P (type
));
2077 if (!identifier_p (name
))
2080 /* These don't have names. */
2081 if (TREE_CODE (type
) == DECLTYPE_TYPE
2082 || TREE_CODE (type
) == TYPEOF_TYPE
)
2085 ctor_name
= constructor_name_full (type
);
2086 if (name
== ctor_name
)
2088 if (IDENTIFIER_TEMPLATE (ctor_name
)
2089 && name
== IDENTIFIER_TEMPLATE (ctor_name
))
2094 /* Counter used to create anonymous type names. */
2096 static GTY(()) int anon_cnt
;
2098 /* Return an IDENTIFIER which can be used as a name for
2099 anonymous structs and unions. */
2102 make_anon_name (void)
2106 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2107 return get_identifier (buf
);
2110 /* This code is practically identical to that for creating
2111 anonymous names, but is just used for lambdas instead. This isn't really
2112 necessary, but it's convenient to avoid treating lambdas like other
2115 static GTY(()) int lambda_cnt
= 0;
2118 make_lambda_name (void)
2122 sprintf (buf
, LAMBDANAME_FORMAT
, lambda_cnt
++);
2123 return get_identifier (buf
);
2126 /* Return (from the stack of) the BINDING, if any, established at SCOPE. */
2128 static inline cxx_binding
*
2129 find_binding (cp_binding_level
*scope
, cxx_binding
*binding
)
2131 for (; binding
!= NULL
; binding
= binding
->previous
)
2132 if (binding
->scope
== scope
)
2135 return (cxx_binding
*)0;
2138 /* Return the binding for NAME in SCOPE, if any. Otherwise, return NULL. */
2140 static inline cxx_binding
*
2141 cp_binding_level_find_binding_for_name (cp_binding_level
*scope
, tree name
)
2143 cxx_binding
*b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2146 /* Fold-in case where NAME is used only once. */
2147 if (scope
== b
->scope
&& b
->previous
== NULL
)
2149 return find_binding (scope
, b
);
2154 /* Always returns a binding for name in scope. If no binding is
2155 found, make a new one. */
2157 static cxx_binding
*
2158 binding_for_name (cp_binding_level
*scope
, tree name
)
2160 cxx_binding
*result
;
2162 result
= cp_binding_level_find_binding_for_name (scope
, name
);
2165 /* Not found, make a new one. */
2166 result
= cxx_binding_make (NULL
, NULL
);
2167 result
->previous
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2168 result
->scope
= scope
;
2169 result
->is_local
= false;
2170 result
->value_is_inherited
= false;
2171 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2175 /* Walk through the bindings associated to the name of FUNCTION,
2176 and return the first declaration of a function with a
2177 "C" linkage specification, a.k.a 'extern "C"'.
2178 This function looks for the binding, regardless of which scope it
2179 has been defined in. It basically looks in all the known scopes.
2180 Note that this function does not lookup for bindings of builtin functions
2181 or for functions declared in system headers. */
2183 lookup_extern_c_fun_in_all_ns (tree function
)
2188 gcc_assert (function
&& TREE_CODE (function
) == FUNCTION_DECL
);
2190 name
= DECL_NAME (function
);
2191 gcc_assert (name
&& identifier_p (name
));
2193 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2195 iter
= iter
->previous
)
2198 for (ovl
= iter
->value
; ovl
; ovl
= OVL_NEXT (ovl
))
2200 tree decl
= OVL_CURRENT (ovl
);
2202 && TREE_CODE (decl
) == FUNCTION_DECL
2203 && DECL_EXTERN_C_P (decl
)
2204 && !DECL_ARTIFICIAL (decl
))
2213 /* Returns a list of C-linkage decls with the name NAME. */
2216 c_linkage_bindings (tree name
)
2218 tree decls
= NULL_TREE
;
2221 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2223 iter
= iter
->previous
)
2226 for (ovl
= iter
->value
; ovl
; ovl
= OVL_NEXT (ovl
))
2228 tree decl
= OVL_CURRENT (ovl
);
2230 && DECL_EXTERN_C_P (decl
)
2231 && !DECL_ARTIFICIAL (decl
))
2233 if (decls
== NULL_TREE
)
2236 decls
= tree_cons (NULL_TREE
, decl
, decls
);
2243 /* Insert another USING_DECL into the current binding level, returning
2244 this declaration. If this is a redeclaration, do nothing, and
2245 return NULL_TREE if this not in namespace scope (in namespace
2246 scope, a using decl might extend any previous bindings). */
2249 push_using_decl_1 (tree scope
, tree name
)
2253 gcc_assert (TREE_CODE (scope
) == NAMESPACE_DECL
);
2254 gcc_assert (identifier_p (name
));
2255 for (decl
= current_binding_level
->usings
; decl
; decl
= DECL_CHAIN (decl
))
2256 if (USING_DECL_SCOPE (decl
) == scope
&& DECL_NAME (decl
) == name
)
2259 return namespace_bindings_p () ? decl
: NULL_TREE
;
2260 decl
= build_lang_decl (USING_DECL
, name
, NULL_TREE
);
2261 USING_DECL_SCOPE (decl
) = scope
;
2262 DECL_CHAIN (decl
) = current_binding_level
->usings
;
2263 current_binding_level
->usings
= decl
;
2267 /* Wrapper for push_using_decl_1. */
2270 push_using_decl (tree scope
, tree name
)
2273 timevar_start (TV_NAME_LOOKUP
);
2274 ret
= push_using_decl_1 (scope
, name
);
2275 timevar_stop (TV_NAME_LOOKUP
);
2279 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
2280 caller to set DECL_CONTEXT properly.
2282 Note that this must only be used when X will be the new innermost
2283 binding for its name, as we tack it onto the front of IDENTIFIER_BINDING
2284 without checking to see if the current IDENTIFIER_BINDING comes from a
2285 closer binding level than LEVEL. */
2288 pushdecl_with_scope_1 (tree x
, cp_binding_level
*level
, bool is_friend
)
2290 cp_binding_level
*b
;
2291 tree function_decl
= current_function_decl
;
2293 current_function_decl
= NULL_TREE
;
2294 if (level
->kind
== sk_class
)
2296 b
= class_binding_level
;
2297 class_binding_level
= level
;
2298 pushdecl_class_level (x
);
2299 class_binding_level
= b
;
2303 b
= current_binding_level
;
2304 current_binding_level
= level
;
2305 x
= pushdecl_maybe_friend (x
, is_friend
);
2306 current_binding_level
= b
;
2308 current_function_decl
= function_decl
;
2312 /* Wrapper for pushdecl_with_scope_1. */
2315 pushdecl_with_scope (tree x
, cp_binding_level
*level
, bool is_friend
)
2318 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
2319 ret
= pushdecl_with_scope_1 (x
, level
, is_friend
);
2320 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
2324 /* Helper function for push_overloaded_decl_1 and do_nonmember_using_decl.
2325 Compares the parameter-type-lists of DECL1 and DECL2 and returns false
2326 if they are different. If the DECLs are template functions, the return
2327 types and the template parameter lists are compared too (DR 565). */
2330 compparms_for_decl_and_using_decl (tree decl1
, tree decl2
)
2332 if (!compparms (TYPE_ARG_TYPES (TREE_TYPE (decl1
)),
2333 TYPE_ARG_TYPES (TREE_TYPE (decl2
))))
2336 if (! DECL_FUNCTION_TEMPLATE_P (decl1
)
2337 || ! DECL_FUNCTION_TEMPLATE_P (decl2
))
2340 return (comp_template_parms (DECL_TEMPLATE_PARMS (decl1
),
2341 DECL_TEMPLATE_PARMS (decl2
))
2342 && same_type_p (TREE_TYPE (TREE_TYPE (decl1
)),
2343 TREE_TYPE (TREE_TYPE (decl2
))));
2346 /* DECL is a FUNCTION_DECL for a non-member function, which may have
2347 other definitions already in place. We get around this by making
2348 the value of the identifier point to a list of all the things that
2349 want to be referenced by that name. It is then up to the users of
2350 that name to decide what to do with that list.
2352 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
2353 DECL_TEMPLATE_RESULT. It is dealt with the same way.
2355 FLAGS is a bitwise-or of the following values:
2356 PUSH_LOCAL: Bind DECL in the current scope, rather than at
2358 PUSH_USING: DECL is being pushed as the result of a using
2361 IS_FRIEND is true if this is a friend declaration.
2363 The value returned may be a previous declaration if we guessed wrong
2364 about what language DECL should belong to (C or C++). Otherwise,
2365 it's always DECL (and never something that's not a _DECL). */
2368 push_overloaded_decl_1 (tree decl
, int flags
, bool is_friend
)
2370 tree name
= DECL_NAME (decl
);
2373 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
2376 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
2378 old
= lookup_name_innermost_nonclass_level (name
);
2382 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
2384 tree t
= TREE_TYPE (old
);
2385 if (MAYBE_CLASS_TYPE_P (t
) && warn_shadow
2386 && (! DECL_IN_SYSTEM_HEADER (decl
)
2387 || ! DECL_IN_SYSTEM_HEADER (old
)))
2388 warning (OPT_Wshadow
, "%q#D hides constructor for %q#T", decl
, t
);
2391 else if (is_overloaded_fn (old
))
2395 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
2397 tree fn
= OVL_CURRENT (tmp
);
2400 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
2401 && !(flags
& PUSH_USING
)
2402 && compparms_for_decl_and_using_decl (fn
, decl
)
2403 && ! decls_match (fn
, decl
))
2404 diagnose_name_conflict (decl
, fn
);
2406 dup
= duplicate_decls (decl
, fn
, is_friend
);
2407 /* If DECL was a redeclaration of FN -- even an invalid
2408 one -- pass that information along to our caller. */
2409 if (dup
== fn
|| dup
== error_mark_node
)
2413 /* We don't overload implicit built-ins. duplicate_decls()
2414 may fail to merge the decls if the new decl is e.g. a
2415 template function. */
2416 if (TREE_CODE (old
) == FUNCTION_DECL
2417 && DECL_ANTICIPATED (old
)
2418 && !DECL_HIDDEN_FRIEND_P (old
))
2421 else if (old
== error_mark_node
)
2422 /* Ignore the undefined symbol marker. */
2426 error ("previous non-function declaration %q+#D", old
);
2427 error ("conflicts with function declaration %q#D", decl
);
2432 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
2433 /* If it's a using declaration, we always need to build an OVERLOAD,
2434 because it's the only way to remember that the declaration comes
2435 from 'using', and have the lookup behave correctly. */
2436 || (flags
& PUSH_USING
))
2438 if (old
&& TREE_CODE (old
) != OVERLOAD
)
2439 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
2441 new_binding
= ovl_cons (decl
, old
);
2442 if (flags
& PUSH_USING
)
2443 OVL_USED (new_binding
) = 1;
2446 /* NAME is not ambiguous. */
2450 set_namespace_binding (name
, current_namespace
, new_binding
);
2453 /* We only create an OVERLOAD if there was a previous binding at
2454 this level, or if decl is a template. In the former case, we
2455 need to remove the old binding and replace it with the new
2456 binding. We must also run through the NAMES on the binding
2457 level where the name was bound to update the chain. */
2459 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
2463 for (d
= &IDENTIFIER_BINDING (name
)->scope
->names
;
2465 d
= &TREE_CHAIN (*d
))
2467 || (TREE_CODE (*d
) == TREE_LIST
2468 && TREE_VALUE (*d
) == old
))
2470 if (TREE_CODE (*d
) == TREE_LIST
)
2471 /* Just replace the old binding with the new. */
2472 TREE_VALUE (*d
) = new_binding
;
2474 /* Build a TREE_LIST to wrap the OVERLOAD. */
2475 *d
= tree_cons (NULL_TREE
, new_binding
,
2478 /* And update the cxx_binding node. */
2479 IDENTIFIER_BINDING (name
)->value
= new_binding
;
2483 /* We should always find a previous binding in this case. */
2487 /* Install the new binding. */
2488 push_local_binding (name
, new_binding
, flags
);
2494 /* Wrapper for push_overloaded_decl_1. */
2497 push_overloaded_decl (tree decl
, int flags
, bool is_friend
)
2500 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
2501 ret
= push_overloaded_decl_1 (decl
, flags
, is_friend
);
2502 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
2506 /* Check a non-member using-declaration. Return the name and scope
2507 being used, and the USING_DECL, or NULL_TREE on failure. */
2510 validate_nonmember_using_decl (tree decl
, tree scope
, tree name
)
2512 /* [namespace.udecl]
2513 A using-declaration for a class member shall be a
2514 member-declaration. */
2517 error ("%qT is not a namespace or unscoped enum", scope
);
2520 else if (scope
== error_mark_node
)
2523 if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
)
2526 A using-declaration shall not name a template-id. */
2527 error ("a using-declaration cannot specify a template-id. "
2528 "Try %<using %D%>", name
);
2532 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
2534 error ("namespace %qD not allowed in using-declaration", decl
);
2538 if (TREE_CODE (decl
) == SCOPE_REF
)
2540 /* It's a nested name with template parameter dependent scope.
2541 This can only be using-declaration for class member. */
2542 error ("%qT is not a namespace", TREE_OPERAND (decl
, 0));
2546 if (is_overloaded_fn (decl
))
2547 decl
= get_first_fn (decl
);
2549 gcc_assert (DECL_P (decl
));
2551 /* Make a USING_DECL. */
2552 tree using_decl
= push_using_decl (scope
, name
);
2554 if (using_decl
== NULL_TREE
2555 && at_function_scope_p ()
2557 /* C++11 7.3.3/10. */
2558 error ("%qD is already declared in this scope", name
);
2563 /* Process local and global using-declarations. */
2566 do_nonmember_using_decl (tree scope
, tree name
, tree oldval
, tree oldtype
,
2567 tree
*newval
, tree
*newtype
)
2569 struct scope_binding decls
= EMPTY_SCOPE_BINDING
;
2571 *newval
= *newtype
= NULL_TREE
;
2572 if (!qualified_lookup_using_namespace (name
, scope
, &decls
, 0))
2576 if (!decls
.value
&& !decls
.type
)
2578 error ("%qD not declared", name
);
2582 /* Shift the old and new bindings around so we're comparing class and
2583 enumeration names to each other. */
2584 if (oldval
&& DECL_IMPLICIT_TYPEDEF_P (oldval
))
2590 if (decls
.value
&& DECL_IMPLICIT_TYPEDEF_P (decls
.value
))
2592 decls
.type
= decls
.value
;
2593 decls
.value
= NULL_TREE
;
2596 /* It is impossible to overload a built-in function; any explicit
2597 declaration eliminates the built-in declaration. So, if OLDVAL
2598 is a built-in, then we can just pretend it isn't there. */
2600 && TREE_CODE (oldval
) == FUNCTION_DECL
2601 && DECL_ANTICIPATED (oldval
)
2602 && !DECL_HIDDEN_FRIEND_P (oldval
))
2607 /* Check for using functions. */
2608 if (is_overloaded_fn (decls
.value
))
2612 if (oldval
&& !is_overloaded_fn (oldval
))
2614 error ("%qD is already declared in this scope", name
);
2619 for (tmp
= decls
.value
; tmp
; tmp
= OVL_NEXT (tmp
))
2621 tree new_fn
= OVL_CURRENT (tmp
);
2623 /* [namespace.udecl]
2625 If a function declaration in namespace scope or block
2626 scope has the same name and the same parameter types as a
2627 function introduced by a using declaration the program is
2629 for (tmp1
= oldval
; tmp1
; tmp1
= OVL_NEXT (tmp1
))
2631 tree old_fn
= OVL_CURRENT (tmp1
);
2633 if (new_fn
== old_fn
)
2634 /* The function already exists in the current namespace. */
2636 else if (TREE_CODE (tmp1
) == OVERLOAD
&& OVL_USED (tmp1
))
2637 continue; /* this is a using decl */
2638 else if (compparms_for_decl_and_using_decl (new_fn
, old_fn
))
2640 gcc_assert (!DECL_ANTICIPATED (old_fn
)
2641 || DECL_HIDDEN_FRIEND_P (old_fn
));
2643 /* There was already a non-using declaration in
2644 this scope with the same parameter types. If both
2645 are the same extern "C" functions, that's ok. */
2646 if (decls_match (new_fn
, old_fn
))
2650 diagnose_name_conflict (new_fn
, old_fn
);
2656 /* If we broke out of the loop, there's no reason to add
2657 this function to the using declarations for this
2662 /* If we are adding to an existing OVERLOAD, then we no
2663 longer know the type of the set of functions. */
2664 if (*newval
&& TREE_CODE (*newval
) == OVERLOAD
)
2665 TREE_TYPE (*newval
) = unknown_type_node
;
2666 /* Add this new function to the set. */
2667 *newval
= build_overload (OVL_CURRENT (tmp
), *newval
);
2668 /* If there is only one function, then we use its type. (A
2669 using-declaration naming a single function can be used in
2670 contexts where overload resolution cannot be
2672 if (TREE_CODE (*newval
) != OVERLOAD
)
2674 *newval
= ovl_cons (*newval
, NULL_TREE
);
2675 TREE_TYPE (*newval
) = TREE_TYPE (OVL_CURRENT (tmp
));
2677 OVL_USED (*newval
) = 1;
2682 *newval
= decls
.value
;
2683 if (oldval
&& !decls_match (*newval
, oldval
))
2684 error ("%qD is already declared in this scope", name
);
2690 if (decls
.type
&& TREE_CODE (decls
.type
) == TREE_LIST
)
2692 error ("reference to %qD is ambiguous", name
);
2693 print_candidates (decls
.type
);
2697 *newtype
= decls
.type
;
2698 if (oldtype
&& *newtype
&& !decls_match (oldtype
, *newtype
))
2699 error ("%qD is already declared in this scope", name
);
2702 /* If *newval is empty, shift any class or enumeration name down. */
2706 *newtype
= NULL_TREE
;
2710 /* Process a using-declaration at function scope. */
2713 do_local_using_decl (tree decl
, tree scope
, tree name
)
2715 tree oldval
, oldtype
, newval
, newtype
;
2716 tree orig_decl
= decl
;
2718 decl
= validate_nonmember_using_decl (decl
, scope
, name
);
2719 if (decl
== NULL_TREE
)
2722 if (building_stmt_list_p ()
2723 && at_function_scope_p ())
2724 add_decl_expr (decl
);
2726 oldval
= lookup_name_innermost_nonclass_level (name
);
2727 oldtype
= lookup_type_current_level (name
);
2729 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, &newval
, &newtype
);
2733 if (is_overloaded_fn (newval
))
2737 /* We only need to push declarations for those functions
2738 that were not already bound in the current level.
2739 The old value might be NULL_TREE, it might be a single
2740 function, or an OVERLOAD. */
2741 if (oldval
&& TREE_CODE (oldval
) == OVERLOAD
)
2742 term
= OVL_FUNCTION (oldval
);
2745 for (fn
= newval
; fn
&& OVL_CURRENT (fn
) != term
;
2747 push_overloaded_decl (OVL_CURRENT (fn
),
2748 PUSH_LOCAL
| PUSH_USING
,
2752 push_local_binding (name
, newval
, PUSH_USING
);
2756 push_local_binding (name
, newtype
, PUSH_USING
);
2757 set_identifier_type_value (name
, newtype
);
2760 /* Emit debug info. */
2761 if (!processing_template_decl
)
2762 cp_emit_debug_info_for_using (orig_decl
, current_scope());
2765 /* Returns true if ROOT (a namespace, class, or function) encloses
2766 CHILD. CHILD may be either a class type or a namespace. */
2769 is_ancestor (tree root
, tree child
)
2771 gcc_assert ((TREE_CODE (root
) == NAMESPACE_DECL
2772 || TREE_CODE (root
) == FUNCTION_DECL
2773 || CLASS_TYPE_P (root
)));
2774 gcc_assert ((TREE_CODE (child
) == NAMESPACE_DECL
2775 || CLASS_TYPE_P (child
)));
2777 /* The global namespace encloses everything. */
2778 if (root
== global_namespace
)
2783 /* If we've run out of scopes, stop. */
2786 /* If we've reached the ROOT, it encloses CHILD. */
2789 /* Go out one level. */
2791 child
= TYPE_NAME (child
);
2792 child
= DECL_CONTEXT (child
);
2796 /* Enter the class or namespace scope indicated by T suitable for name
2797 lookup. T can be arbitrary scope, not necessary nested inside the
2798 current scope. Returns a non-null scope to pop iff pop_scope
2799 should be called later to exit this scope. */
2804 if (TREE_CODE (t
) == NAMESPACE_DECL
)
2805 push_decl_namespace (t
);
2806 else if (CLASS_TYPE_P (t
))
2808 if (!at_class_scope_p ()
2809 || !same_type_p (current_class_type
, t
))
2810 push_nested_class (t
);
2812 /* T is the same as the current scope. There is therefore no
2813 need to re-enter the scope. Since we are not actually
2814 pushing a new scope, our caller should not call
2822 /* Leave scope pushed by push_scope. */
2829 if (TREE_CODE (t
) == NAMESPACE_DECL
)
2830 pop_decl_namespace ();
2831 else if CLASS_TYPE_P (t
)
2832 pop_nested_class ();
2835 /* Subroutine of push_inner_scope. */
2838 push_inner_scope_r (tree outer
, tree inner
)
2843 || (TREE_CODE (inner
) != NAMESPACE_DECL
&& !CLASS_TYPE_P (inner
)))
2846 prev
= CP_DECL_CONTEXT (TREE_CODE (inner
) == NAMESPACE_DECL
? inner
: TYPE_NAME (inner
));
2848 push_inner_scope_r (outer
, prev
);
2849 if (TREE_CODE (inner
) == NAMESPACE_DECL
)
2851 cp_binding_level
*save_template_parm
= 0;
2852 /* Temporary take out template parameter scopes. They are saved
2853 in reversed order in save_template_parm. */
2854 while (current_binding_level
->kind
== sk_template_parms
)
2856 cp_binding_level
*b
= current_binding_level
;
2857 current_binding_level
= b
->level_chain
;
2858 b
->level_chain
= save_template_parm
;
2859 save_template_parm
= b
;
2862 resume_scope (NAMESPACE_LEVEL (inner
));
2863 current_namespace
= inner
;
2865 /* Restore template parameter scopes. */
2866 while (save_template_parm
)
2868 cp_binding_level
*b
= save_template_parm
;
2869 save_template_parm
= b
->level_chain
;
2870 b
->level_chain
= current_binding_level
;
2871 current_binding_level
= b
;
2878 /* Enter the scope INNER from current scope. INNER must be a scope
2879 nested inside current scope. This works with both name lookup and
2880 pushing name into scope. In case a template parameter scope is present,
2881 namespace is pushed under the template parameter scope according to
2882 name lookup rule in 14.6.1/6.
2884 Return the former current scope suitable for pop_inner_scope. */
2887 push_inner_scope (tree inner
)
2889 tree outer
= current_scope ();
2891 outer
= current_namespace
;
2893 push_inner_scope_r (outer
, inner
);
2897 /* Exit the current scope INNER back to scope OUTER. */
2900 pop_inner_scope (tree outer
, tree inner
)
2903 || (TREE_CODE (inner
) != NAMESPACE_DECL
&& !CLASS_TYPE_P (inner
)))
2906 while (outer
!= inner
)
2908 if (TREE_CODE (inner
) == NAMESPACE_DECL
)
2910 cp_binding_level
*save_template_parm
= 0;
2911 /* Temporary take out template parameter scopes. They are saved
2912 in reversed order in save_template_parm. */
2913 while (current_binding_level
->kind
== sk_template_parms
)
2915 cp_binding_level
*b
= current_binding_level
;
2916 current_binding_level
= b
->level_chain
;
2917 b
->level_chain
= save_template_parm
;
2918 save_template_parm
= b
;
2923 /* Restore template parameter scopes. */
2924 while (save_template_parm
)
2926 cp_binding_level
*b
= save_template_parm
;
2927 save_template_parm
= b
->level_chain
;
2928 b
->level_chain
= current_binding_level
;
2929 current_binding_level
= b
;
2935 inner
= CP_DECL_CONTEXT (TREE_CODE (inner
) == NAMESPACE_DECL
? inner
: TYPE_NAME (inner
));
2939 /* Do a pushlevel for class declarations. */
2942 pushlevel_class (void)
2944 class_binding_level
= begin_scope (sk_class
, current_class_type
);
2947 /* ...and a poplevel for class declarations. */
2950 poplevel_class (void)
2952 cp_binding_level
*level
= class_binding_level
;
2953 cp_class_binding
*cb
;
2957 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
2958 gcc_assert (level
!= 0);
2960 /* If we're leaving a toplevel class, cache its binding level. */
2961 if (current_class_depth
== 1)
2962 previous_class_level
= level
;
2963 for (shadowed
= level
->type_shadowed
;
2965 shadowed
= TREE_CHAIN (shadowed
))
2966 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
2968 /* Remove the bindings for all of the class-level declarations. */
2969 if (level
->class_shadowed
)
2971 FOR_EACH_VEC_ELT (*level
->class_shadowed
, i
, cb
)
2973 IDENTIFIER_BINDING (cb
->identifier
) = cb
->base
->previous
;
2974 cxx_binding_free (cb
->base
);
2976 ggc_free (level
->class_shadowed
);
2977 level
->class_shadowed
= NULL
;
2980 /* Now, pop out of the binding level which we created up in the
2981 `pushlevel_class' routine. */
2982 gcc_assert (current_binding_level
== level
);
2984 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
2987 /* Set INHERITED_VALUE_BINDING_P on BINDING to true or false, as
2988 appropriate. DECL is the value to which a name has just been
2989 bound. CLASS_TYPE is the class in which the lookup occurred. */
2992 set_inherited_value_binding_p (cxx_binding
*binding
, tree decl
,
2995 if (binding
->value
== decl
&& TREE_CODE (decl
) != TREE_LIST
)
2999 if (TREE_CODE (decl
) == OVERLOAD
)
3000 context
= ovl_scope (decl
);
3003 gcc_assert (DECL_P (decl
));
3004 context
= context_for_name_lookup (decl
);
3007 if (is_properly_derived_from (class_type
, context
))
3008 INHERITED_VALUE_BINDING_P (binding
) = 1;
3010 INHERITED_VALUE_BINDING_P (binding
) = 0;
3012 else if (binding
->value
== decl
)
3013 /* We only encounter a TREE_LIST when there is an ambiguity in the
3014 base classes. Such an ambiguity can be overridden by a
3015 definition in this class. */
3016 INHERITED_VALUE_BINDING_P (binding
) = 1;
3018 INHERITED_VALUE_BINDING_P (binding
) = 0;
3021 /* Make the declaration of X appear in CLASS scope. */
3024 pushdecl_class_level (tree x
)
3027 bool is_valid
= true;
3030 /* Do nothing if we're adding to an outer lambda closure type,
3031 outer_binding will add it later if it's needed. */
3032 if (current_class_type
!= class_binding_level
->this_entity
)
3035 subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
3036 /* Get the name of X. */
3037 if (TREE_CODE (x
) == OVERLOAD
)
3038 name
= DECL_NAME (get_first_fn (x
));
3040 name
= DECL_NAME (x
);
3044 is_valid
= push_class_level_binding (name
, x
);
3045 if (TREE_CODE (x
) == TYPE_DECL
)
3046 set_identifier_type_value (name
, x
);
3048 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
3050 /* If X is an anonymous aggregate, all of its members are
3051 treated as if they were members of the class containing the
3052 aggregate, for naming purposes. */
3055 for (f
= TYPE_FIELDS (TREE_TYPE (x
)); f
; f
= DECL_CHAIN (f
))
3057 location_t save_location
= input_location
;
3058 input_location
= DECL_SOURCE_LOCATION (f
);
3059 if (!pushdecl_class_level (f
))
3061 input_location
= save_location
;
3064 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
3068 /* Return the BINDING (if any) for NAME in SCOPE, which is a class
3069 scope. If the value returned is non-NULL, and the PREVIOUS field
3070 is not set, callers must set the PREVIOUS field explicitly. */
3072 static cxx_binding
*
3073 get_class_binding (tree name
, cp_binding_level
*scope
)
3078 cxx_binding
*binding
;
3080 class_type
= scope
->this_entity
;
3082 /* Get the type binding. */
3083 type_binding
= lookup_member (class_type
, name
,
3084 /*protect=*/2, /*want_type=*/true,
3085 tf_warning_or_error
);
3086 /* Get the value binding. */
3087 value_binding
= lookup_member (class_type
, name
,
3088 /*protect=*/2, /*want_type=*/false,
3089 tf_warning_or_error
);
3092 && (TREE_CODE (value_binding
) == TYPE_DECL
3093 || DECL_CLASS_TEMPLATE_P (value_binding
)
3094 || (TREE_CODE (value_binding
) == TREE_LIST
3095 && TREE_TYPE (value_binding
) == error_mark_node
3096 && (TREE_CODE (TREE_VALUE (value_binding
))
3098 /* We found a type binding, even when looking for a non-type
3099 binding. This means that we already processed this binding
3102 else if (value_binding
)
3104 if (TREE_CODE (value_binding
) == TREE_LIST
3105 && TREE_TYPE (value_binding
) == error_mark_node
)
3106 /* NAME is ambiguous. */
3108 else if (BASELINK_P (value_binding
))
3109 /* NAME is some overloaded functions. */
3110 value_binding
= BASELINK_FUNCTIONS (value_binding
);
3113 /* If we found either a type binding or a value binding, create a
3114 new binding object. */
3115 if (type_binding
|| value_binding
)
3117 binding
= new_class_binding (name
,
3121 /* This is a class-scope binding, not a block-scope binding. */
3122 LOCAL_BINDING_P (binding
) = 0;
3123 set_inherited_value_binding_p (binding
, value_binding
, class_type
);
3131 /* Make the declaration(s) of X appear in CLASS scope under the name
3132 NAME. Returns true if the binding is valid. */
3135 push_class_level_binding_1 (tree name
, tree x
)
3137 cxx_binding
*binding
;
3141 /* The class_binding_level will be NULL if x is a template
3142 parameter name in a member template. */
3143 if (!class_binding_level
)
3146 if (name
== error_mark_node
)
3149 /* Can happen for an erroneous declaration (c++/60384). */
3150 if (!identifier_p (name
))
3152 gcc_assert (errorcount
|| sorrycount
);
3156 /* Check for invalid member names. But don't worry about a default
3157 argument-scope lambda being pushed after the class is complete. */
3158 gcc_assert (TYPE_BEING_DEFINED (current_class_type
)
3159 || LAMBDA_TYPE_P (TREE_TYPE (decl
)));
3160 /* Check that we're pushing into the right binding level. */
3161 gcc_assert (current_class_type
== class_binding_level
->this_entity
);
3163 /* We could have been passed a tree list if this is an ambiguous
3164 declaration. If so, pull the declaration out because
3165 check_template_shadow will not handle a TREE_LIST. */
3166 if (TREE_CODE (decl
) == TREE_LIST
3167 && TREE_TYPE (decl
) == error_mark_node
)
3168 decl
= TREE_VALUE (decl
);
3170 if (!check_template_shadow (decl
))
3175 If T is the name of a class, then each of the following shall
3176 have a name different from T:
3178 -- every static data member of class T;
3180 -- every member of class T that is itself a type;
3182 -- every enumerator of every member of class T that is an
3185 -- every member of every anonymous union that is a member of
3188 (Non-static data members were also forbidden to have the same
3189 name as T until TC1.) */
3191 || TREE_CODE (x
) == CONST_DECL
3192 || (TREE_CODE (x
) == TYPE_DECL
3193 && !DECL_SELF_REFERENCE_P (x
))
3194 /* A data member of an anonymous union. */
3195 || (TREE_CODE (x
) == FIELD_DECL
3196 && DECL_CONTEXT (x
) != current_class_type
))
3197 && DECL_NAME (x
) == constructor_name (current_class_type
))
3199 tree scope
= context_for_name_lookup (x
);
3200 if (TYPE_P (scope
) && same_type_p (scope
, current_class_type
))
3202 error ("%qD has the same name as the class in which it is "
3209 /* Get the current binding for NAME in this class, if any. */
3210 binding
= IDENTIFIER_BINDING (name
);
3211 if (!binding
|| binding
->scope
!= class_binding_level
)
3213 binding
= get_class_binding (name
, class_binding_level
);
3214 /* If a new binding was created, put it at the front of the
3215 IDENTIFIER_BINDING list. */
3218 binding
->previous
= IDENTIFIER_BINDING (name
);
3219 IDENTIFIER_BINDING (name
) = binding
;
3223 /* If there is already a binding, then we may need to update the
3225 if (binding
&& binding
->value
)
3227 tree bval
= binding
->value
;
3228 tree old_decl
= NULL_TREE
;
3229 tree target_decl
= strip_using_decl (decl
);
3230 tree target_bval
= strip_using_decl (bval
);
3232 if (INHERITED_VALUE_BINDING_P (binding
))
3234 /* If the old binding was from a base class, and was for a
3235 tag name, slide it over to make room for the new binding.
3236 The old binding is still visible if explicitly qualified
3237 with a class-key. */
3238 if (TREE_CODE (target_bval
) == TYPE_DECL
3239 && DECL_ARTIFICIAL (target_bval
)
3240 && !(TREE_CODE (target_decl
) == TYPE_DECL
3241 && DECL_ARTIFICIAL (target_decl
)))
3243 old_decl
= binding
->type
;
3244 binding
->type
= bval
;
3245 binding
->value
= NULL_TREE
;
3246 INHERITED_VALUE_BINDING_P (binding
) = 0;
3251 /* Any inherited type declaration is hidden by the type
3252 declaration in the derived class. */
3253 if (TREE_CODE (target_decl
) == TYPE_DECL
3254 && DECL_ARTIFICIAL (target_decl
))
3255 binding
->type
= NULL_TREE
;
3258 else if (TREE_CODE (target_decl
) == OVERLOAD
3259 && is_overloaded_fn (target_bval
))
3261 else if (TREE_CODE (decl
) == USING_DECL
3262 && TREE_CODE (bval
) == USING_DECL
3263 && same_type_p (USING_DECL_SCOPE (decl
),
3264 USING_DECL_SCOPE (bval
)))
3265 /* This is a using redeclaration that will be diagnosed later
3266 in supplement_binding */
3268 else if (TREE_CODE (decl
) == USING_DECL
3269 && TREE_CODE (bval
) == USING_DECL
3270 && DECL_DEPENDENT_P (decl
)
3271 && DECL_DEPENDENT_P (bval
))
3273 else if (TREE_CODE (decl
) == USING_DECL
3274 && is_overloaded_fn (target_bval
))
3276 else if (TREE_CODE (bval
) == USING_DECL
3277 && is_overloaded_fn (target_decl
))
3280 if (old_decl
&& binding
->scope
== class_binding_level
)
3283 /* It is always safe to clear INHERITED_VALUE_BINDING_P
3284 here. This function is only used to register bindings
3285 from with the class definition itself. */
3286 INHERITED_VALUE_BINDING_P (binding
) = 0;
3291 /* Note that we declared this value so that we can issue an error if
3292 this is an invalid redeclaration of a name already used for some
3294 note_name_declared_in_class (name
, decl
);
3296 /* If we didn't replace an existing binding, put the binding on the
3297 stack of bindings for the identifier, and update the shadowed
3299 if (binding
&& binding
->scope
== class_binding_level
)
3300 /* Supplement the existing binding. */
3301 ok
= supplement_binding (binding
, decl
);
3304 /* Create a new binding. */
3305 push_binding (name
, decl
, class_binding_level
);
3312 /* Wrapper for push_class_level_binding_1. */
3315 push_class_level_binding (tree name
, tree x
)
3318 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
3319 ret
= push_class_level_binding_1 (name
, x
);
3320 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
3324 /* Process "using SCOPE::NAME" in a class scope. Return the
3325 USING_DECL created. */
3328 do_class_using_decl (tree scope
, tree name
)
3330 /* The USING_DECL returned by this function. */
3332 /* The declaration (or declarations) name by this using
3333 declaration. NULL if we are in a template and cannot figure out
3334 what has been named. */
3336 /* True if SCOPE is a dependent type. */
3337 bool scope_dependent_p
;
3338 /* True if SCOPE::NAME is dependent. */
3339 bool name_dependent_p
;
3340 /* True if any of the bases of CURRENT_CLASS_TYPE are dependent. */
3341 bool bases_dependent_p
;
3346 if (name
== error_mark_node
)
3349 if (!scope
|| !TYPE_P (scope
))
3351 error ("using-declaration for non-member at class scope");
3355 /* Make sure the name is not invalid */
3356 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
3358 error ("%<%T::%D%> names destructor", scope
, name
);
3361 /* Using T::T declares inheriting ctors, even if T is a typedef. */
3362 if (MAYBE_CLASS_TYPE_P (scope
)
3363 && (name
== TYPE_IDENTIFIER (scope
)
3364 || constructor_name_p (name
, scope
)))
3366 maybe_warn_cpp0x (CPP0X_INHERITING_CTORS
);
3367 name
= ctor_identifier
;
3369 if (constructor_name_p (name
, current_class_type
))
3371 error ("%<%T::%D%> names constructor in %qT",
3372 scope
, name
, current_class_type
);
3376 scope_dependent_p
= dependent_scope_p (scope
);
3377 name_dependent_p
= (scope_dependent_p
3378 || (IDENTIFIER_TYPENAME_P (name
)
3379 && dependent_type_p (TREE_TYPE (name
))));
3381 bases_dependent_p
= false;
3382 if (processing_template_decl
)
3383 for (binfo
= TYPE_BINFO (current_class_type
), i
= 0;
3384 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
);
3386 if (dependent_type_p (TREE_TYPE (base_binfo
)))
3388 bases_dependent_p
= true;
3394 /* From [namespace.udecl]:
3396 A using-declaration used as a member-declaration shall refer to a
3397 member of a base class of the class being defined.
3399 In general, we cannot check this constraint in a template because
3400 we do not know the entire set of base classes of the current
3401 class type. Morover, if SCOPE is dependent, it might match a
3402 non-dependent base. */
3404 if (!scope_dependent_p
)
3407 binfo
= lookup_base (current_class_type
, scope
, ba_any
, &b_kind
,
3408 tf_warning_or_error
);
3409 if (b_kind
< bk_proper_base
)
3411 if (!bases_dependent_p
|| b_kind
== bk_same_type
)
3413 error_not_base_type (scope
, current_class_type
);
3417 else if (!name_dependent_p
)
3419 decl
= lookup_member (binfo
, name
, 0, false, tf_warning_or_error
);
3422 error ("no members matching %<%T::%D%> in %q#T", scope
, name
,
3426 /* The binfo from which the functions came does not matter. */
3427 if (BASELINK_P (decl
))
3428 decl
= BASELINK_FUNCTIONS (decl
);
3432 value
= build_lang_decl (USING_DECL
, name
, NULL_TREE
);
3433 USING_DECL_DECLS (value
) = decl
;
3434 USING_DECL_SCOPE (value
) = scope
;
3435 DECL_DEPENDENT_P (value
) = !decl
;
3441 /* Return the binding value for name in scope. */
3445 namespace_binding_1 (tree name
, tree scope
)
3447 cxx_binding
*binding
;
3449 if (SCOPE_FILE_SCOPE_P (scope
))
3450 scope
= global_namespace
;
3452 /* Unnecessary for the global namespace because it can't be an alias. */
3453 scope
= ORIGINAL_NAMESPACE (scope
);
3455 binding
= cp_binding_level_find_binding_for_name (NAMESPACE_LEVEL (scope
), name
);
3457 return binding
? binding
->value
: NULL_TREE
;
3461 namespace_binding (tree name
, tree scope
)
3464 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
3465 ret
= namespace_binding_1 (name
, scope
);
3466 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
3470 /* Set the binding value for name in scope. */
3473 set_namespace_binding_1 (tree name
, tree scope
, tree val
)
3477 if (scope
== NULL_TREE
)
3478 scope
= global_namespace
;
3479 b
= binding_for_name (NAMESPACE_LEVEL (scope
), name
);
3480 if (!b
->value
|| TREE_CODE (val
) == OVERLOAD
|| val
== error_mark_node
)
3483 supplement_binding (b
, val
);
3486 /* Wrapper for set_namespace_binding_1. */
3489 set_namespace_binding (tree name
, tree scope
, tree val
)
3491 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
3492 set_namespace_binding_1 (name
, scope
, val
);
3493 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
3496 /* Set the context of a declaration to scope. Complain if we are not
3500 set_decl_namespace (tree decl
, tree scope
, bool friendp
)
3504 /* Get rid of namespace aliases. */
3505 scope
= ORIGINAL_NAMESPACE (scope
);
3507 /* It is ok for friends to be qualified in parallel space. */
3508 if (!friendp
&& !is_ancestor (current_namespace
, scope
))
3509 error ("declaration of %qD not in a namespace surrounding %qD",
3511 DECL_CONTEXT (decl
) = FROB_CONTEXT (scope
);
3513 /* Writing "int N::i" to declare a variable within "N" is invalid. */
3514 if (scope
== current_namespace
)
3516 if (at_namespace_scope_p ())
3517 error ("explicit qualification in declaration of %qD",
3522 /* See whether this has been declared in the namespace. */
3523 old
= lookup_qualified_name (scope
, DECL_NAME (decl
), false, true);
3524 if (old
== error_mark_node
)
3525 /* No old declaration at all. */
3527 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
3528 if (TREE_CODE (old
) == TREE_LIST
)
3530 error ("reference to %qD is ambiguous", decl
);
3531 print_candidates (old
);
3534 if (!is_overloaded_fn (decl
))
3536 /* We might have found OLD in an inline namespace inside SCOPE. */
3537 if (TREE_CODE (decl
) == TREE_CODE (old
))
3538 DECL_CONTEXT (decl
) = DECL_CONTEXT (old
);
3539 /* Don't compare non-function decls with decls_match here, since
3540 it can't check for the correct constness at this
3541 point. pushdecl will find those errors later. */
3544 /* Since decl is a function, old should contain a function decl. */
3545 if (!is_overloaded_fn (old
))
3547 /* A template can be explicitly specialized in any namespace. */
3548 if (processing_explicit_instantiation
)
3550 if (processing_template_decl
|| processing_specialization
)
3551 /* We have not yet called push_template_decl to turn a
3552 FUNCTION_DECL into a TEMPLATE_DECL, so the declarations won't
3553 match. But, we'll check later, when we construct the
3556 /* Instantiations or specializations of templates may be declared as
3557 friends in any namespace. */
3558 if (friendp
&& DECL_USE_TEMPLATE (decl
))
3560 if (is_overloaded_fn (old
))
3562 tree found
= NULL_TREE
;
3564 for (; elt
; elt
= OVL_NEXT (elt
))
3566 tree ofn
= OVL_CURRENT (elt
);
3567 /* Adjust DECL_CONTEXT first so decls_match will return true
3568 if DECL will match a declaration in an inline namespace. */
3569 DECL_CONTEXT (decl
) = DECL_CONTEXT (ofn
);
3570 if (decls_match (decl
, ofn
))
3572 if (found
&& !decls_match (found
, ofn
))
3574 DECL_CONTEXT (decl
) = FROB_CONTEXT (scope
);
3575 error ("reference to %qD is ambiguous", decl
);
3576 print_candidates (old
);
3584 if (!is_associated_namespace (scope
, CP_DECL_CONTEXT (found
)))
3586 DECL_CONTEXT (decl
) = DECL_CONTEXT (found
);
3592 DECL_CONTEXT (decl
) = DECL_CONTEXT (old
);
3593 if (decls_match (decl
, old
))
3597 /* It didn't work, go back to the explicit scope. */
3598 DECL_CONTEXT (decl
) = FROB_CONTEXT (scope
);
3600 error ("%qD should have been declared inside %qD", decl
, scope
);
3603 /* Return the namespace where the current declaration is declared. */
3606 current_decl_namespace (void)
3609 /* If we have been pushed into a different namespace, use it. */
3610 if (!vec_safe_is_empty (decl_namespace_list
))
3611 return decl_namespace_list
->last ();
3613 if (current_class_type
)
3614 result
= decl_namespace_context (current_class_type
);
3615 else if (current_function_decl
)
3616 result
= decl_namespace_context (current_function_decl
);
3618 result
= current_namespace
;
3622 /* Process any ATTRIBUTES on a namespace definition. Returns true if
3623 attribute visibility is seen. */
3626 handle_namespace_attrs (tree ns
, tree attributes
)
3629 bool saw_vis
= false;
3631 for (d
= attributes
; d
; d
= TREE_CHAIN (d
))
3633 tree name
= get_attribute_name (d
);
3634 tree args
= TREE_VALUE (d
);
3636 if (is_attribute_p ("visibility", name
))
3638 /* attribute visibility is a property of the syntactic block
3639 rather than the namespace as a whole, so we don't touch the
3640 NAMESPACE_DECL at all. */
3641 tree x
= args
? TREE_VALUE (args
) : NULL_TREE
;
3642 if (x
== NULL_TREE
|| TREE_CODE (x
) != STRING_CST
|| TREE_CHAIN (args
))
3644 warning (OPT_Wattributes
,
3645 "%qD attribute requires a single NTBS argument",
3650 if (!TREE_PUBLIC (ns
))
3651 warning (OPT_Wattributes
,
3652 "%qD attribute is meaningless since members of the "
3653 "anonymous namespace get local symbols", name
);
3655 push_visibility (TREE_STRING_POINTER (x
), 1);
3658 else if (is_attribute_p ("abi_tag", name
))
3660 if (!DECL_NAMESPACE_ASSOCIATIONS (ns
))
3662 warning (OPT_Wattributes
, "ignoring %qD attribute on non-inline "
3666 if (!DECL_NAME (ns
))
3668 warning (OPT_Wattributes
, "ignoring %qD attribute on anonymous "
3674 tree dn
= DECL_NAME (ns
);
3675 args
= build_string (IDENTIFIER_LENGTH (dn
) + 1,
3676 IDENTIFIER_POINTER (dn
));
3677 TREE_TYPE (args
) = char_array_type_node
;
3678 args
= fix_string_type (args
);
3679 args
= build_tree_list (NULL_TREE
, args
);
3681 if (check_abi_tag_args (args
, name
))
3682 DECL_ATTRIBUTES (ns
) = tree_cons (name
, args
,
3683 DECL_ATTRIBUTES (ns
));
3687 warning (OPT_Wattributes
, "%qD attribute directive ignored",
3696 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
3697 select a name that is unique to this compilation unit. */
3700 push_namespace (tree name
)
3703 bool need_new
= true;
3704 bool implicit_use
= false;
3707 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
3709 /* We should not get here if the global_namespace is not yet constructed
3710 nor if NAME designates the global namespace: The global scope is
3711 constructed elsewhere. */
3712 gcc_assert (global_namespace
!= NULL
&& name
!= global_scope_name
);
3716 name
= get_anonymous_namespace_name();
3717 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
3719 /* Reopening anonymous namespace. */
3721 implicit_use
= true;
3725 /* Check whether this is an extended namespace definition. */
3726 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
3727 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
3729 tree dna
= DECL_NAMESPACE_ALIAS (d
);
3732 /* We do some error recovery for, eg, the redeclaration
3739 However, in nasty cases like:
3747 we just error out below, in duplicate_decls. */
3748 if (NAMESPACE_LEVEL (dna
)->level_chain
3749 == current_binding_level
)
3751 error ("namespace alias %qD not allowed here, "
3752 "assuming %qD", d
, dna
);
3764 /* Make a new namespace, binding the name to it. */
3765 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
3766 DECL_CONTEXT (d
) = FROB_CONTEXT (current_namespace
);
3767 /* The name of this namespace is not visible to other translation
3768 units if it is an anonymous namespace or member thereof. */
3769 if (anon
|| decl_anon_ns_mem_p (current_namespace
))
3770 TREE_PUBLIC (d
) = 0;
3772 TREE_PUBLIC (d
) = 1;
3776 /* Clear DECL_NAME for the benefit of debugging back ends. */
3777 SET_DECL_ASSEMBLER_NAME (d
, name
);
3778 DECL_NAME (d
) = NULL_TREE
;
3780 begin_scope (sk_namespace
, d
);
3783 resume_scope (NAMESPACE_LEVEL (d
));
3786 do_using_directive (d
);
3787 /* Enter the name space. */
3788 current_namespace
= d
;
3790 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
3793 /* Pop from the scope of the current namespace. */
3796 pop_namespace (void)
3798 gcc_assert (current_namespace
!= global_namespace
);
3799 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
3800 /* The binding level is not popped, as it might be re-opened later. */
3804 /* Push into the scope of the namespace NS, even if it is deeply
3805 nested within another namespace. */
3808 push_nested_namespace (tree ns
)
3810 if (ns
== global_namespace
)
3811 push_to_top_level ();
3814 push_nested_namespace (CP_DECL_CONTEXT (ns
));
3815 push_namespace (DECL_NAME (ns
));
3819 /* Pop back from the scope of the namespace NS, which was previously
3820 entered with push_nested_namespace. */
3823 pop_nested_namespace (tree ns
)
3825 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
3826 gcc_assert (current_namespace
== ns
);
3827 while (ns
!= global_namespace
)
3830 ns
= CP_DECL_CONTEXT (ns
);
3833 pop_from_top_level ();
3834 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
3837 /* Temporarily set the namespace for the current declaration. */
3840 push_decl_namespace (tree decl
)
3842 if (TREE_CODE (decl
) != NAMESPACE_DECL
)
3843 decl
= decl_namespace_context (decl
);
3844 vec_safe_push (decl_namespace_list
, ORIGINAL_NAMESPACE (decl
));
3847 /* [namespace.memdef]/2 */
3850 pop_decl_namespace (void)
3852 decl_namespace_list
->pop ();
3855 /* Return the namespace that is the common ancestor
3856 of two given namespaces. */
3859 namespace_ancestor_1 (tree ns1
, tree ns2
)
3862 if (is_ancestor (ns1
, ns2
))
3865 nsr
= namespace_ancestor_1 (CP_DECL_CONTEXT (ns1
), ns2
);
3869 /* Wrapper for namespace_ancestor_1. */
3872 namespace_ancestor (tree ns1
, tree ns2
)
3875 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
3876 nsr
= namespace_ancestor_1 (ns1
, ns2
);
3877 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
3881 /* Process a namespace-alias declaration. */
3884 do_namespace_alias (tree alias
, tree name_space
)
3886 if (name_space
== error_mark_node
)
3889 gcc_assert (TREE_CODE (name_space
) == NAMESPACE_DECL
);
3891 name_space
= ORIGINAL_NAMESPACE (name_space
);
3893 /* Build the alias. */
3894 alias
= build_lang_decl (NAMESPACE_DECL
, alias
, void_type_node
);
3895 DECL_NAMESPACE_ALIAS (alias
) = name_space
;
3896 DECL_EXTERNAL (alias
) = 1;
3897 DECL_CONTEXT (alias
) = FROB_CONTEXT (current_scope ());
3900 /* Emit debug info for namespace alias. */
3901 if (!building_stmt_list_p ())
3902 (*debug_hooks
->global_decl
) (alias
);
3905 /* Like pushdecl, only it places X in the current namespace,
3909 pushdecl_namespace_level (tree x
, bool is_friend
)
3911 cp_binding_level
*b
= current_binding_level
;
3914 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
3915 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
), is_friend
);
3917 /* Now, the type_shadowed stack may screw us. Munge it so it does
3919 if (TREE_CODE (t
) == TYPE_DECL
)
3921 tree name
= DECL_NAME (t
);
3923 tree
*ptr
= (tree
*)0;
3924 for (; !global_scope_p (b
); b
= b
->level_chain
)
3926 tree shadowed
= b
->type_shadowed
;
3927 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
3928 if (TREE_PURPOSE (shadowed
) == name
)
3930 ptr
= &TREE_VALUE (shadowed
);
3931 /* Can't break out of the loop here because sometimes
3932 a binding level will have duplicate bindings for
3933 PT names. It's gross, but I haven't time to fix it. */
3936 newval
= TREE_TYPE (t
);
3937 if (ptr
== (tree
*)0)
3939 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
3940 up here if this is changed to an assertion. --KR */
3941 SET_IDENTIFIER_TYPE_VALUE (name
, t
);
3948 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
3952 /* Insert USED into the using list of USER. Set INDIRECT_flag if this
3953 directive is not directly from the source. Also find the common
3954 ancestor and let our users know about the new namespace */
3957 add_using_namespace_1 (tree user
, tree used
, bool indirect
)
3960 /* Using oneself is a no-op. */
3963 gcc_assert (TREE_CODE (user
) == NAMESPACE_DECL
);
3964 gcc_assert (TREE_CODE (used
) == NAMESPACE_DECL
);
3965 /* Check if we already have this. */
3966 t
= purpose_member (used
, DECL_NAMESPACE_USING (user
));
3970 /* Promote to direct usage. */
3971 TREE_INDIRECT_USING (t
) = 0;
3975 /* Add used to the user's using list. */
3976 DECL_NAMESPACE_USING (user
)
3977 = tree_cons (used
, namespace_ancestor (user
, used
),
3978 DECL_NAMESPACE_USING (user
));
3980 TREE_INDIRECT_USING (DECL_NAMESPACE_USING (user
)) = indirect
;
3982 /* Add user to the used's users list. */
3983 DECL_NAMESPACE_USERS (used
)
3984 = tree_cons (user
, 0, DECL_NAMESPACE_USERS (used
));
3986 /* Recursively add all namespaces used. */
3987 for (t
= DECL_NAMESPACE_USING (used
); t
; t
= TREE_CHAIN (t
))
3988 /* indirect usage */
3989 add_using_namespace_1 (user
, TREE_PURPOSE (t
), 1);
3991 /* Tell everyone using us about the new used namespaces. */
3992 for (t
= DECL_NAMESPACE_USERS (user
); t
; t
= TREE_CHAIN (t
))
3993 add_using_namespace_1 (TREE_PURPOSE (t
), used
, 1);
3996 /* Wrapper for add_using_namespace_1. */
3999 add_using_namespace (tree user
, tree used
, bool indirect
)
4001 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
4002 add_using_namespace_1 (user
, used
, indirect
);
4003 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
4006 /* Process a using-declaration not appearing in class or local scope. */
4009 do_toplevel_using_decl (tree decl
, tree scope
, tree name
)
4011 tree oldval
, oldtype
, newval
, newtype
;
4012 tree orig_decl
= decl
;
4013 cxx_binding
*binding
;
4015 decl
= validate_nonmember_using_decl (decl
, scope
, name
);
4016 if (decl
== NULL_TREE
)
4019 binding
= binding_for_name (NAMESPACE_LEVEL (current_namespace
), name
);
4021 oldval
= binding
->value
;
4022 oldtype
= binding
->type
;
4024 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, &newval
, &newtype
);
4026 /* Emit debug info. */
4027 if (!processing_template_decl
)
4028 cp_emit_debug_info_for_using (orig_decl
, current_namespace
);
4030 /* Copy declarations found. */
4032 binding
->value
= newval
;
4034 binding
->type
= newtype
;
4037 /* Process a using-directive. */
4040 do_using_directive (tree name_space
)
4042 tree context
= NULL_TREE
;
4044 if (name_space
== error_mark_node
)
4047 gcc_assert (TREE_CODE (name_space
) == NAMESPACE_DECL
);
4049 if (building_stmt_list_p ())
4050 add_stmt (build_stmt (input_location
, USING_STMT
, name_space
));
4051 name_space
= ORIGINAL_NAMESPACE (name_space
);
4053 if (!toplevel_bindings_p ())
4055 push_using_directive (name_space
);
4060 add_using_namespace (current_namespace
, name_space
, 0);
4061 if (current_namespace
!= global_namespace
)
4062 context
= current_namespace
;
4064 /* Emit debugging info. */
4065 if (!processing_template_decl
)
4066 (*debug_hooks
->imported_module_or_decl
) (name_space
, NULL_TREE
,
4071 /* Deal with a using-directive seen by the parser. Currently we only
4072 handle attributes here, since they cannot appear inside a template. */
4075 parse_using_directive (tree name_space
, tree attribs
)
4077 do_using_directive (name_space
);
4079 if (attribs
== error_mark_node
)
4082 for (tree a
= attribs
; a
; a
= TREE_CHAIN (a
))
4084 tree name
= get_attribute_name (a
);
4085 if (is_attribute_p ("strong", name
))
4087 if (!toplevel_bindings_p ())
4088 error ("strong using only meaningful at namespace scope");
4089 else if (name_space
!= error_mark_node
)
4091 if (!is_ancestor (current_namespace
, name_space
))
4092 error ("current namespace %qD does not enclose strongly used namespace %qD",
4093 current_namespace
, name_space
);
4094 DECL_NAMESPACE_ASSOCIATIONS (name_space
)
4095 = tree_cons (current_namespace
, 0,
4096 DECL_NAMESPACE_ASSOCIATIONS (name_space
));
4100 warning (OPT_Wattributes
, "%qD attribute directive ignored", name
);
4104 /* Like pushdecl, only it places X in the global scope if appropriate.
4105 Calls cp_finish_decl to register the variable, initializing it with
4106 *INIT, if INIT is non-NULL. */
4109 pushdecl_top_level_1 (tree x
, tree
*init
, bool is_friend
)
4111 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
4112 push_to_top_level ();
4113 x
= pushdecl_namespace_level (x
, is_friend
);
4115 cp_finish_decl (x
, *init
, false, NULL_TREE
, 0);
4116 pop_from_top_level ();
4117 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
4121 /* Like pushdecl, only it places X in the global scope if appropriate. */
4124 pushdecl_top_level (tree x
)
4126 return pushdecl_top_level_1 (x
, NULL
, false);
4129 /* Like pushdecl_top_level, but adding the IS_FRIEND parameter. */
4132 pushdecl_top_level_maybe_friend (tree x
, bool is_friend
)
4134 return pushdecl_top_level_1 (x
, NULL
, is_friend
);
4137 /* Like pushdecl, only it places X in the global scope if
4138 appropriate. Calls cp_finish_decl to register the variable,
4139 initializing it with INIT. */
4142 pushdecl_top_level_and_finish (tree x
, tree init
)
4144 return pushdecl_top_level_1 (x
, &init
, false);
4147 /* Combines two sets of overloaded functions into an OVERLOAD chain, removing
4148 duplicates. The first list becomes the tail of the result.
4150 The algorithm is O(n^2). We could get this down to O(n log n) by
4151 doing a sort on the addresses of the functions, if that becomes
4155 merge_functions (tree s1
, tree s2
)
4157 for (; s2
; s2
= OVL_NEXT (s2
))
4159 tree fn2
= OVL_CURRENT (s2
);
4162 for (fns1
= s1
; fns1
; fns1
= OVL_NEXT (fns1
))
4164 tree fn1
= OVL_CURRENT (fns1
);
4166 /* If the function from S2 is already in S1, there is no
4167 need to add it again. For `extern "C"' functions, we
4168 might have two FUNCTION_DECLs for the same function, in
4169 different namespaces, but let's leave them in in case
4170 they have different default arguments. */
4175 /* If we exhausted all of the functions in S1, FN2 is new. */
4177 s1
= build_overload (fn2
, s1
);
4182 /* Returns TRUE iff OLD and NEW are the same entity.
4184 3 [basic]/3: An entity is a value, object, reference, function,
4185 enumerator, type, class member, template, template specialization,
4186 namespace, parameter pack, or this.
4188 7.3.4 [namespace.udir]/4: If name lookup finds a declaration for a name
4189 in two different namespaces, and the declarations do not declare the
4190 same entity and do not declare functions, the use of the name is
4194 same_entity_p (tree one
, tree two
)
4200 if (TREE_CODE (one
) == TYPE_DECL
4201 && TREE_CODE (two
) == TYPE_DECL
4202 && same_type_p (TREE_TYPE (one
), TREE_TYPE (two
)))
4207 /* This should return an error not all definitions define functions.
4208 It is not an error if we find two functions with exactly the
4209 same signature, only if these are selected in overload resolution.
4210 old is the current set of bindings, new_binding the freshly-found binding.
4211 XXX Do we want to give *all* candidates in case of ambiguity?
4212 XXX In what way should I treat extern declarations?
4213 XXX I don't want to repeat the entire duplicate_decls here */
4216 ambiguous_decl (struct scope_binding
*old
, cxx_binding
*new_binding
, int flags
)
4219 gcc_assert (old
!= NULL
);
4221 /* Copy the type. */
4222 type
= new_binding
->type
;
4223 if (LOOKUP_NAMESPACES_ONLY (flags
)
4224 || (type
&& hidden_name_p (type
) && !(flags
& LOOKUP_HIDDEN
)))
4227 /* Copy the value. */
4228 val
= new_binding
->value
;
4231 if (hidden_name_p (val
) && !(flags
& LOOKUP_HIDDEN
))
4234 switch (TREE_CODE (val
))
4237 /* If we expect types or namespaces, and not templates,
4238 or this is not a template class. */
4239 if ((LOOKUP_QUALIFIERS_ONLY (flags
)
4240 && !DECL_TYPE_TEMPLATE_P (val
)))
4244 if (LOOKUP_NAMESPACES_ONLY (flags
)
4245 || (type
&& (flags
& LOOKUP_PREFER_TYPES
)))
4248 case NAMESPACE_DECL
:
4249 if (LOOKUP_TYPES_ONLY (flags
))
4253 /* Ignore built-in functions that are still anticipated. */
4254 if (LOOKUP_QUALIFIERS_ONLY (flags
))
4258 if (LOOKUP_QUALIFIERS_ONLY (flags
))
4263 /* If val is hidden, shift down any class or enumeration name. */
4272 else if (val
&& !same_entity_p (val
, old
->value
))
4274 if (is_overloaded_fn (old
->value
) && is_overloaded_fn (val
))
4275 old
->value
= merge_functions (old
->value
, val
);
4278 old
->value
= tree_cons (NULL_TREE
, old
->value
,
4279 build_tree_list (NULL_TREE
, val
));
4280 TREE_TYPE (old
->value
) = error_mark_node
;
4286 else if (type
&& old
->type
!= type
)
4288 old
->type
= tree_cons (NULL_TREE
, old
->type
,
4289 build_tree_list (NULL_TREE
, type
));
4290 TREE_TYPE (old
->type
) = error_mark_node
;
4294 /* Return the declarations that are members of the namespace NS. */
4297 cp_namespace_decls (tree ns
)
4299 return NAMESPACE_LEVEL (ns
)->names
;
4302 /* Combine prefer_type and namespaces_only into flags. */
4305 lookup_flags (int prefer_type
, int namespaces_only
)
4307 if (namespaces_only
)
4308 return LOOKUP_PREFER_NAMESPACES
;
4309 if (prefer_type
> 1)
4310 return LOOKUP_PREFER_TYPES
;
4311 if (prefer_type
> 0)
4312 return LOOKUP_PREFER_BOTH
;
4316 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
4317 ignore it or not. Subroutine of lookup_name_real and
4318 lookup_type_scope. */
4321 qualify_lookup (tree val
, int flags
)
4323 if (val
== NULL_TREE
)
4325 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
4327 if (flags
& LOOKUP_PREFER_TYPES
)
4329 tree target_val
= strip_using_decl (val
);
4330 if (TREE_CODE (target_val
) == TYPE_DECL
4331 || TREE_CODE (target_val
) == TEMPLATE_DECL
)
4334 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
4336 /* Look through lambda things that we shouldn't be able to see. */
4337 if (is_lambda_ignored_entity (val
))
4342 /* Given a lookup that returned VAL, decide if we want to ignore it or
4343 not based on DECL_ANTICIPATED. */
4346 hidden_name_p (tree val
)
4349 && DECL_LANG_SPECIFIC (val
)
4350 && TYPE_FUNCTION_OR_TEMPLATE_DECL_P (val
)
4351 && DECL_ANTICIPATED (val
))
4356 /* Remove any hidden friend functions from a possibly overloaded set
4360 remove_hidden_names (tree fns
)
4365 if (TREE_CODE (fns
) == FUNCTION_DECL
&& hidden_name_p (fns
))
4367 else if (TREE_CODE (fns
) == OVERLOAD
)
4371 for (o
= fns
; o
; o
= OVL_NEXT (o
))
4372 if (hidden_name_p (OVL_CURRENT (o
)))
4378 for (o
= fns
; o
; o
= OVL_NEXT (o
))
4379 if (!hidden_name_p (OVL_CURRENT (o
)))
4380 n
= build_overload (OVL_CURRENT (o
), n
);
4388 /* Suggest alternatives for NAME, an IDENTIFIER_NODE for which name
4389 lookup failed. Search through all available namespaces and print out
4390 possible candidates. */
4393 suggest_alternatives_for (location_t location
, tree name
)
4395 vec
<tree
> candidates
= vNULL
;
4396 vec
<tree
> namespaces_to_search
= vNULL
;
4397 int max_to_search
= PARAM_VALUE (CXX_MAX_NAMESPACES_FOR_DIAGNOSTIC_HELP
);
4402 namespaces_to_search
.safe_push (global_namespace
);
4404 while (!namespaces_to_search
.is_empty ()
4405 && n_searched
< max_to_search
)
4407 tree scope
= namespaces_to_search
.pop ();
4408 struct scope_binding binding
= EMPTY_SCOPE_BINDING
;
4409 cp_binding_level
*level
= NAMESPACE_LEVEL (scope
);
4411 /* Look in this namespace. */
4412 qualified_lookup_using_namespace (name
, scope
, &binding
, 0);
4417 candidates
.safe_push (binding
.value
);
4419 /* Add child namespaces. */
4420 for (t
= level
->namespaces
; t
; t
= DECL_CHAIN (t
))
4421 namespaces_to_search
.safe_push (t
);
4424 /* If we stopped before we could examine all namespaces, inform the
4425 user. Do this even if we don't have any candidates, since there
4426 might be more candidates further down that we weren't able to
4428 if (n_searched
>= max_to_search
4429 && !namespaces_to_search
.is_empty ())
4431 "maximum limit of %d namespaces searched for %qE",
4432 max_to_search
, name
);
4434 namespaces_to_search
.release ();
4436 /* Nothing useful to report. */
4437 if (candidates
.is_empty ())
4440 inform_n (location
, candidates
.length (),
4441 "suggested alternative:",
4442 "suggested alternatives:");
4444 FOR_EACH_VEC_ELT (candidates
, ix
, t
)
4445 inform (location_of (t
), " %qE", t
);
4447 candidates
.release ();
4450 /* Unscoped lookup of a global: iterate over current namespaces,
4451 considering using-directives. */
4454 unqualified_namespace_lookup_1 (tree name
, int flags
)
4456 tree initial
= current_decl_namespace ();
4457 tree scope
= initial
;
4459 cp_binding_level
*level
;
4460 tree val
= NULL_TREE
;
4462 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
4464 struct scope_binding binding
= EMPTY_SCOPE_BINDING
;
4466 cp_binding_level_find_binding_for_name (NAMESPACE_LEVEL (scope
), name
);
4469 ambiguous_decl (&binding
, b
, flags
);
4471 /* Add all _DECLs seen through local using-directives. */
4472 for (level
= current_binding_level
;
4473 level
->kind
!= sk_namespace
;
4474 level
= level
->level_chain
)
4475 if (!lookup_using_namespace (name
, &binding
, level
->using_directives
,
4477 /* Give up because of error. */
4478 return error_mark_node
;
4480 /* Add all _DECLs seen through global using-directives. */
4481 /* XXX local and global using lists should work equally. */
4485 if (!lookup_using_namespace (name
, &binding
,
4486 DECL_NAMESPACE_USING (siter
),
4488 /* Give up because of error. */
4489 return error_mark_node
;
4490 if (siter
== scope
) break;
4491 siter
= CP_DECL_CONTEXT (siter
);
4494 val
= binding
.value
;
4495 if (scope
== global_namespace
)
4501 /* Wrapper for unqualified_namespace_lookup_1. */
4504 unqualified_namespace_lookup (tree name
, int flags
)
4507 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
4508 ret
= unqualified_namespace_lookup_1 (name
, flags
);
4509 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
4513 /* Look up NAME (an IDENTIFIER_NODE) in SCOPE (either a NAMESPACE_DECL
4514 or a class TYPE). If IS_TYPE_P is TRUE, then ignore non-type
4517 Returns a DECL (or OVERLOAD, or BASELINK) representing the
4518 declaration found. If no suitable declaration can be found,
4519 ERROR_MARK_NODE is returned. If COMPLAIN is true and SCOPE is
4520 neither a class-type nor a namespace a diagnostic is issued. */
4523 lookup_qualified_name (tree scope
, tree name
, bool is_type_p
, bool complain
)
4528 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
4530 struct scope_binding binding
= EMPTY_SCOPE_BINDING
;
4533 flags
|= LOOKUP_PREFER_TYPES
;
4534 if (qualified_lookup_using_namespace (name
, scope
, &binding
, flags
))
4537 else if (cxx_dialect
!= cxx98
&& TREE_CODE (scope
) == ENUMERAL_TYPE
)
4538 t
= lookup_enumerator (scope
, name
);
4539 else if (is_class_type (scope
, complain
))
4540 t
= lookup_member (scope
, name
, 2, is_type_p
, tf_warning_or_error
);
4543 return error_mark_node
;
4547 /* Subroutine of unqualified_namespace_lookup:
4548 Add the bindings of NAME in used namespaces to VAL.
4549 We are currently looking for names in namespace SCOPE, so we
4550 look through USINGS for using-directives of namespaces
4551 which have SCOPE as a common ancestor with the current scope.
4552 Returns false on errors. */
4555 lookup_using_namespace (tree name
, struct scope_binding
*val
,
4556 tree usings
, tree scope
, int flags
)
4559 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
4560 /* Iterate over all used namespaces in current, searching for using
4561 directives of scope. */
4562 for (iter
= usings
; iter
; iter
= TREE_CHAIN (iter
))
4563 if (TREE_VALUE (iter
) == scope
)
4565 tree used
= ORIGINAL_NAMESPACE (TREE_PURPOSE (iter
));
4567 cp_binding_level_find_binding_for_name (NAMESPACE_LEVEL (used
), name
);
4568 /* Resolve ambiguities. */
4570 ambiguous_decl (val
, val1
, flags
);
4572 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
4573 return val
->value
!= error_mark_node
;
4576 /* Returns true iff VEC contains TARGET. */
4579 tree_vec_contains (vec
<tree
, va_gc
> *vec
, tree target
)
4583 FOR_EACH_VEC_SAFE_ELT (vec
,i
,elt
)
4590 Accepts the NAME to lookup and its qualifying SCOPE.
4591 Returns the name/type pair found into the cxx_binding *RESULT,
4592 or false on error. */
4595 qualified_lookup_using_namespace (tree name
, tree scope
,
4596 struct scope_binding
*result
, int flags
)
4598 /* Maintain a list of namespaces visited... */
4599 vec
<tree
, va_gc
> *seen
= NULL
;
4600 vec
<tree
, va_gc
> *seen_inline
= NULL
;
4601 /* ... and a list of namespace yet to see. */
4602 vec
<tree
, va_gc
> *todo
= NULL
;
4603 vec
<tree
, va_gc
> *todo_maybe
= NULL
;
4604 vec
<tree
, va_gc
> *todo_inline
= NULL
;
4606 timevar_start (TV_NAME_LOOKUP
);
4607 /* Look through namespace aliases. */
4608 scope
= ORIGINAL_NAMESPACE (scope
);
4610 /* Algorithm: Starting with SCOPE, walk through the set of used
4611 namespaces. For each used namespace, look through its inline
4612 namespace set for any bindings and usings. If no bindings are
4613 found, add any usings seen to the set of used namespaces. */
4614 vec_safe_push (todo
, scope
);
4616 while (todo
->length ())
4619 scope
= todo
->pop ();
4620 if (tree_vec_contains (seen
, scope
))
4622 vec_safe_push (seen
, scope
);
4623 vec_safe_push (todo_inline
, scope
);
4626 while (todo_inline
->length ())
4628 cxx_binding
*binding
;
4630 scope
= todo_inline
->pop ();
4631 if (tree_vec_contains (seen_inline
, scope
))
4633 vec_safe_push (seen_inline
, scope
);
4636 cp_binding_level_find_binding_for_name (NAMESPACE_LEVEL (scope
), name
);
4640 ambiguous_decl (result
, binding
, flags
);
4643 for (usings
= DECL_NAMESPACE_USING (scope
); usings
;
4644 usings
= TREE_CHAIN (usings
))
4645 if (!TREE_INDIRECT_USING (usings
))
4647 if (is_associated_namespace (scope
, TREE_PURPOSE (usings
)))
4648 vec_safe_push (todo_inline
, TREE_PURPOSE (usings
));
4650 vec_safe_push (todo_maybe
, TREE_PURPOSE (usings
));
4655 vec_safe_truncate (todo_maybe
, 0);
4657 while (vec_safe_length (todo_maybe
))
4658 vec_safe_push (todo
, todo_maybe
->pop ());
4661 vec_free (todo_maybe
);
4662 vec_free (todo_inline
);
4664 vec_free (seen_inline
);
4665 timevar_stop (TV_NAME_LOOKUP
);
4666 return result
->value
!= error_mark_node
;
4669 /* Subroutine of outer_binding.
4671 Returns TRUE if BINDING is a binding to a template parameter of
4672 SCOPE. In that case SCOPE is the scope of a primary template
4673 parameter -- in the sense of G++, i.e, a template that has its own
4676 Returns FALSE otherwise. */
4679 binding_to_template_parms_of_scope_p (cxx_binding
*binding
,
4680 cp_binding_level
*scope
)
4682 tree binding_value
, tmpl
, tinfo
;
4685 if (!binding
|| !scope
|| !scope
->this_entity
)
4688 binding_value
= binding
->value
? binding
->value
: binding
->type
;
4689 tinfo
= get_template_info (scope
->this_entity
);
4691 /* BINDING_VALUE must be a template parm. */
4692 if (binding_value
== NULL_TREE
4693 || (!DECL_P (binding_value
)
4694 || !DECL_TEMPLATE_PARM_P (binding_value
)))
4697 /* The level of BINDING_VALUE. */
4699 template_type_parameter_p (binding_value
)
4700 ? TEMPLATE_PARM_LEVEL (TEMPLATE_TYPE_PARM_INDEX
4701 (TREE_TYPE (binding_value
)))
4702 : TEMPLATE_PARM_LEVEL (DECL_INITIAL (binding_value
));
4704 /* The template of the current scope, iff said scope is a primary
4707 && PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
4708 ? TI_TEMPLATE (tinfo
)
4711 /* If the level of the parm BINDING_VALUE equals the depth of TMPL,
4712 then BINDING_VALUE is a parameter of TMPL. */
4713 return (tmpl
&& level
== TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)));
4716 /* Return the innermost non-namespace binding for NAME from a scope
4717 containing BINDING, or, if BINDING is NULL, the current scope.
4718 Please note that for a given template, the template parameters are
4719 considered to be in the scope containing the current scope.
4720 If CLASS_P is false, then class bindings are ignored. */
4723 outer_binding (tree name
,
4724 cxx_binding
*binding
,
4728 cp_binding_level
*scope
;
4729 cp_binding_level
*outer_scope
;
4733 scope
= binding
->scope
->level_chain
;
4734 outer
= binding
->previous
;
4738 scope
= current_binding_level
;
4739 outer
= IDENTIFIER_BINDING (name
);
4741 outer_scope
= outer
? outer
->scope
: NULL
;
4743 /* Because we create class bindings lazily, we might be missing a
4744 class binding for NAME. If there are any class binding levels
4745 between the LAST_BINDING_LEVEL and the scope in which OUTER was
4746 declared, we must lookup NAME in those class scopes. */
4748 while (scope
&& scope
!= outer_scope
&& scope
->kind
!= sk_namespace
)
4750 if (scope
->kind
== sk_class
)
4752 cxx_binding
*class_binding
;
4754 class_binding
= get_class_binding (name
, scope
);
4757 /* Thread this new class-scope binding onto the
4758 IDENTIFIER_BINDING list so that future lookups
4760 class_binding
->previous
= outer
;
4762 binding
->previous
= class_binding
;
4764 IDENTIFIER_BINDING (name
) = class_binding
;
4765 return class_binding
;
4768 /* If we are in a member template, the template parms of the member
4769 template are considered to be inside the scope of the containing
4770 class, but within G++ the class bindings are all pushed between the
4771 template parms and the function body. So if the outer binding is
4772 a template parm for the current scope, return it now rather than
4773 look for a class binding. */
4774 if (outer_scope
&& outer_scope
->kind
== sk_template_parms
4775 && binding_to_template_parms_of_scope_p (outer
, scope
))
4778 scope
= scope
->level_chain
;
4784 /* Return the innermost block-scope or class-scope value binding for
4785 NAME, or NULL_TREE if there is no such binding. */
4788 innermost_non_namespace_value (tree name
)
4790 cxx_binding
*binding
;
4791 binding
= outer_binding (name
, /*binding=*/NULL
, /*class_p=*/true);
4792 return binding
? binding
->value
: NULL_TREE
;
4795 /* Look up NAME in the current binding level and its superiors in the
4796 namespace of variables, functions and typedefs. Return a ..._DECL
4797 node of some kind representing its definition if there is only one
4798 such declaration, or return a TREE_LIST with all the overloaded
4799 definitions if there are many, or return 0 if it is undefined.
4800 Hidden name, either friend declaration or built-in function, are
4803 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
4804 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
4805 Otherwise we prefer non-TYPE_DECLs.
4807 If NONCLASS is nonzero, bindings in class scopes are ignored. If
4808 BLOCK_P is false, bindings in block scopes are ignored. */
4811 lookup_name_real_1 (tree name
, int prefer_type
, int nonclass
, bool block_p
,
4812 int namespaces_only
, int flags
)
4815 tree val
= NULL_TREE
;
4817 /* Conversion operators are handled specially because ordinary
4818 unqualified name lookup will not find template conversion
4820 if (IDENTIFIER_TYPENAME_P (name
))
4822 cp_binding_level
*level
;
4824 for (level
= current_binding_level
;
4825 level
&& level
->kind
!= sk_namespace
;
4826 level
= level
->level_chain
)
4831 /* A conversion operator can only be declared in a class
4833 if (level
->kind
!= sk_class
)
4836 /* Lookup the conversion operator in the class. */
4837 class_type
= level
->this_entity
;
4838 operators
= lookup_fnfields (class_type
, name
, /*protect=*/0);
4846 flags
|= lookup_flags (prefer_type
, namespaces_only
);
4848 /* First, look in non-namespace scopes. */
4850 if (current_class_type
== NULL_TREE
)
4853 if (block_p
|| !nonclass
)
4854 for (iter
= outer_binding (name
, NULL
, !nonclass
);
4856 iter
= outer_binding (name
, iter
, !nonclass
))
4860 /* Skip entities we don't want. */
4861 if (LOCAL_BINDING_P (iter
) ? !block_p
: nonclass
)
4864 /* If this is the kind of thing we're looking for, we're done. */
4865 if (qualify_lookup (iter
->value
, flags
))
4866 binding
= iter
->value
;
4867 else if ((flags
& LOOKUP_PREFER_TYPES
)
4868 && qualify_lookup (iter
->type
, flags
))
4869 binding
= iter
->type
;
4871 binding
= NULL_TREE
;
4875 if (hidden_name_p (binding
))
4877 /* A non namespace-scope binding can only be hidden in the
4878 presence of a local class, due to friend declarations.
4880 In particular, consider:
4888 B* b; // error: B is hidden
4889 C* c; // OK, finds ::C
4892 B *b; // error: B is hidden
4893 C *c; // OK, finds ::C
4898 The standard says that "B" is a local class in "f"
4899 (but not nested within "A") -- but that name lookup
4900 for "B" does not find this declaration until it is
4901 declared directly with "f".
4907 If a friend declaration appears in a local class and
4908 the name specified is an unqualified name, a prior
4909 declaration is looked up without considering scopes
4910 that are outside the innermost enclosing non-class
4911 scope. For a friend function declaration, if there is
4912 no prior declaration, the program is ill-formed. For a
4913 friend class declaration, if there is no prior
4914 declaration, the class that is specified belongs to the
4915 innermost enclosing non-class scope, but if it is
4916 subsequently referenced, its name is not found by name
4917 lookup until a matching declaration is provided in the
4918 innermost enclosing nonclass scope.
4920 So just keep looking for a non-hidden binding.
4922 gcc_assert (TREE_CODE (binding
) == TYPE_DECL
);
4930 /* Now lookup in namespace scopes. */
4932 val
= unqualified_namespace_lookup (name
, flags
);
4934 /* If we have a single function from a using decl, pull it out. */
4935 if (val
&& TREE_CODE (val
) == OVERLOAD
&& !really_overloaded_fn (val
))
4936 val
= OVL_FUNCTION (val
);
4941 /* Wrapper for lookup_name_real_1. */
4944 lookup_name_real (tree name
, int prefer_type
, int nonclass
, bool block_p
,
4945 int namespaces_only
, int flags
)
4948 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
4949 ret
= lookup_name_real_1 (name
, prefer_type
, nonclass
, block_p
,
4950 namespaces_only
, flags
);
4951 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
4956 lookup_name_nonclass (tree name
)
4958 return lookup_name_real (name
, 0, 1, /*block_p=*/true, 0, 0);
4962 lookup_function_nonclass (tree name
, vec
<tree
, va_gc
> *args
, bool block_p
)
4965 lookup_arg_dependent (name
,
4966 lookup_name_real (name
, 0, 1, block_p
, 0, 0),
4971 lookup_name (tree name
)
4973 return lookup_name_real (name
, 0, 0, /*block_p=*/true, 0, 0);
4977 lookup_name_prefer_type (tree name
, int prefer_type
)
4979 return lookup_name_real (name
, prefer_type
, 0, /*block_p=*/true, 0, 0);
4982 /* Look up NAME for type used in elaborated name specifier in
4983 the scopes given by SCOPE. SCOPE can be either TS_CURRENT or
4984 TS_WITHIN_ENCLOSING_NON_CLASS. Although not implied by the
4985 name, more scopes are checked if cleanup or template parameter
4986 scope is encountered.
4988 Unlike lookup_name_real, we make sure that NAME is actually
4989 declared in the desired scope, not from inheritance, nor using
4990 directive. For using declaration, there is DR138 still waiting
4991 to be resolved. Hidden name coming from an earlier friend
4992 declaration is also returned.
4994 A TYPE_DECL best matching the NAME is returned. Catching error
4995 and issuing diagnostics are caller's responsibility. */
4998 lookup_type_scope_1 (tree name
, tag_scope scope
)
5000 cxx_binding
*iter
= NULL
;
5001 tree val
= NULL_TREE
;
5003 /* Look in non-namespace scope first. */
5004 if (current_binding_level
->kind
!= sk_namespace
)
5005 iter
= outer_binding (name
, NULL
, /*class_p=*/ true);
5006 for (; iter
; iter
= outer_binding (name
, iter
, /*class_p=*/ true))
5008 /* Check if this is the kind of thing we're looking for.
5009 If SCOPE is TS_CURRENT, also make sure it doesn't come from
5010 base class. For ITER->VALUE, we can simply use
5011 INHERITED_VALUE_BINDING_P. For ITER->TYPE, we have to use
5014 We check ITER->TYPE before ITER->VALUE in order to handle
5015 typedef struct C {} C;
5018 if (qualify_lookup (iter
->type
, LOOKUP_PREFER_TYPES
)
5019 && (scope
!= ts_current
5020 || LOCAL_BINDING_P (iter
)
5021 || DECL_CONTEXT (iter
->type
) == iter
->scope
->this_entity
))
5023 else if ((scope
!= ts_current
5024 || !INHERITED_VALUE_BINDING_P (iter
))
5025 && qualify_lookup (iter
->value
, LOOKUP_PREFER_TYPES
))
5032 /* Look in namespace scope. */
5035 iter
= cp_binding_level_find_binding_for_name
5036 (NAMESPACE_LEVEL (current_decl_namespace ()), name
);
5040 /* If this is the kind of thing we're looking for, we're done. */
5041 if (qualify_lookup (iter
->type
, LOOKUP_PREFER_TYPES
))
5043 else if (qualify_lookup (iter
->value
, LOOKUP_PREFER_TYPES
))
5049 /* Type found, check if it is in the allowed scopes, ignoring cleanup
5050 and template parameter scopes. */
5053 cp_binding_level
*b
= current_binding_level
;
5056 if (iter
->scope
== b
)
5059 if (b
->kind
== sk_cleanup
|| b
->kind
== sk_template_parms
5060 || b
->kind
== sk_function_parms
)
5062 else if (b
->kind
== sk_class
5063 && scope
== ts_within_enclosing_non_class
)
5073 /* Wrapper for lookup_type_scope_1. */
5076 lookup_type_scope (tree name
, tag_scope scope
)
5079 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
5080 ret
= lookup_type_scope_1 (name
, scope
);
5081 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
5086 /* Similar to `lookup_name' but look only in the innermost non-class
5090 lookup_name_innermost_nonclass_level_1 (tree name
)
5092 cp_binding_level
*b
;
5095 b
= innermost_nonclass_level ();
5097 if (b
->kind
== sk_namespace
)
5099 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
5101 /* extern "C" function() */
5102 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
5105 else if (IDENTIFIER_BINDING (name
)
5106 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
5108 cxx_binding
*binding
;
5109 binding
= IDENTIFIER_BINDING (name
);
5112 if (binding
->scope
== b
5113 && !(VAR_P (binding
->value
)
5114 && DECL_DEAD_FOR_LOCAL (binding
->value
)))
5115 return binding
->value
;
5117 if (b
->kind
== sk_cleanup
)
5127 /* Wrapper for lookup_name_innermost_nonclass_level_1. */
5130 lookup_name_innermost_nonclass_level (tree name
)
5133 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
5134 ret
= lookup_name_innermost_nonclass_level_1 (name
);
5135 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
5140 /* Returns true iff DECL is a block-scope extern declaration of a function
5144 is_local_extern (tree decl
)
5146 cxx_binding
*binding
;
5148 /* For functions, this is easy. */
5149 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5150 return DECL_LOCAL_FUNCTION_P (decl
);
5154 if (!current_function_decl
)
5157 /* For variables, this is not easy. We need to look at the binding stack
5158 for the identifier to see whether the decl we have is a local. */
5159 for (binding
= IDENTIFIER_BINDING (DECL_NAME (decl
));
5160 binding
&& binding
->scope
->kind
!= sk_namespace
;
5161 binding
= binding
->previous
)
5162 if (binding
->value
== decl
)
5163 return LOCAL_BINDING_P (binding
);
5168 /* Like lookup_name_innermost_nonclass_level, but for types. */
5171 lookup_type_current_level (tree name
)
5175 timevar_start (TV_NAME_LOOKUP
);
5176 gcc_assert (current_binding_level
->kind
!= sk_namespace
);
5178 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
5179 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
5181 cp_binding_level
*b
= current_binding_level
;
5184 if (purpose_member (name
, b
->type_shadowed
))
5186 t
= REAL_IDENTIFIER_TYPE_VALUE (name
);
5189 if (b
->kind
== sk_cleanup
)
5196 timevar_stop (TV_NAME_LOOKUP
);
5200 /* [basic.lookup.koenig] */
5201 /* A nonzero return value in the functions below indicates an error. */
5206 vec
<tree
, va_gc
> *args
;
5207 vec
<tree
, va_gc
> *namespaces
;
5208 vec
<tree
, va_gc
> *classes
;
5210 hash_set
<tree
> *fn_set
;
5213 static bool arg_assoc (struct arg_lookup
*, tree
);
5214 static bool arg_assoc_args (struct arg_lookup
*, tree
);
5215 static bool arg_assoc_args_vec (struct arg_lookup
*, vec
<tree
, va_gc
> *);
5216 static bool arg_assoc_type (struct arg_lookup
*, tree
);
5217 static bool add_function (struct arg_lookup
*, tree
);
5218 static bool arg_assoc_namespace (struct arg_lookup
*, tree
);
5219 static bool arg_assoc_class_only (struct arg_lookup
*, tree
);
5220 static bool arg_assoc_bases (struct arg_lookup
*, tree
);
5221 static bool arg_assoc_class (struct arg_lookup
*, tree
);
5222 static bool arg_assoc_template_arg (struct arg_lookup
*, tree
);
5224 /* Add a function to the lookup structure.
5225 Returns true on error. */
5228 add_function (struct arg_lookup
*k
, tree fn
)
5230 if (!is_overloaded_fn (fn
))
5231 /* All names except those of (possibly overloaded) functions and
5232 function templates are ignored. */;
5233 else if (k
->fn_set
&& k
->fn_set
->add (fn
))
5234 /* It's already in the list. */;
5235 else if (!k
->functions
)
5237 else if (fn
== k
->functions
)
5241 k
->functions
= build_overload (fn
, k
->functions
);
5242 if (TREE_CODE (k
->functions
) == OVERLOAD
)
5243 OVL_ARG_DEPENDENT (k
->functions
) = true;
5249 /* Returns true iff CURRENT has declared itself to be an associated
5250 namespace of SCOPE via a strong using-directive (or transitive chain
5251 thereof). Both are namespaces. */
5254 is_associated_namespace (tree current
, tree scope
)
5256 vec
<tree
, va_gc
> *seen
= make_tree_vector ();
5257 vec
<tree
, va_gc
> *todo
= make_tree_vector ();
5263 if (scope
== current
)
5268 vec_safe_push (seen
, scope
);
5269 for (t
= DECL_NAMESPACE_ASSOCIATIONS (scope
); t
; t
= TREE_CHAIN (t
))
5270 if (!vec_member (TREE_PURPOSE (t
), seen
))
5271 vec_safe_push (todo
, TREE_PURPOSE (t
));
5272 if (!todo
->is_empty ())
5274 scope
= todo
->last ();
5284 release_tree_vector (seen
);
5285 release_tree_vector (todo
);
5290 /* Add functions of a namespace to the lookup structure.
5291 Returns true on error. */
5294 arg_assoc_namespace (struct arg_lookup
*k
, tree scope
)
5298 if (vec_member (scope
, k
->namespaces
))
5300 vec_safe_push (k
->namespaces
, scope
);
5302 /* Check out our super-users. */
5303 for (value
= DECL_NAMESPACE_ASSOCIATIONS (scope
); value
;
5304 value
= TREE_CHAIN (value
))
5305 if (arg_assoc_namespace (k
, TREE_PURPOSE (value
)))
5308 /* Also look down into inline namespaces. */
5309 for (value
= DECL_NAMESPACE_USING (scope
); value
;
5310 value
= TREE_CHAIN (value
))
5311 if (is_associated_namespace (scope
, TREE_PURPOSE (value
)))
5312 if (arg_assoc_namespace (k
, TREE_PURPOSE (value
)))
5315 value
= namespace_binding (k
->name
, scope
);
5319 for (; value
; value
= OVL_NEXT (value
))
5321 /* We don't want to find arbitrary hidden functions via argument
5322 dependent lookup. We only want to find friends of associated
5323 classes, which we'll do via arg_assoc_class. */
5324 if (hidden_name_p (OVL_CURRENT (value
)))
5327 if (add_function (k
, OVL_CURRENT (value
)))
5334 /* Adds everything associated with a template argument to the lookup
5335 structure. Returns true on error. */
5338 arg_assoc_template_arg (struct arg_lookup
*k
, tree arg
)
5340 /* [basic.lookup.koenig]
5342 If T is a template-id, its associated namespaces and classes are
5343 ... the namespaces and classes associated with the types of the
5344 template arguments provided for template type parameters
5345 (excluding template template parameters); the namespaces in which
5346 any template template arguments are defined; and the classes in
5347 which any member templates used as template template arguments
5348 are defined. [Note: non-type template arguments do not
5349 contribute to the set of associated namespaces. ] */
5351 /* Consider first template template arguments. */
5352 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
5353 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
5355 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
5357 tree ctx
= CP_DECL_CONTEXT (arg
);
5359 /* It's not a member template. */
5360 if (TREE_CODE (ctx
) == NAMESPACE_DECL
)
5361 return arg_assoc_namespace (k
, ctx
);
5362 /* Otherwise, it must be member template. */
5364 return arg_assoc_class_only (k
, ctx
);
5366 /* It's an argument pack; handle it recursively. */
5367 else if (ARGUMENT_PACK_P (arg
))
5369 tree args
= ARGUMENT_PACK_ARGS (arg
);
5370 int i
, len
= TREE_VEC_LENGTH (args
);
5371 for (i
= 0; i
< len
; ++i
)
5372 if (arg_assoc_template_arg (k
, TREE_VEC_ELT (args
, i
)))
5377 /* It's not a template template argument, but it is a type template
5379 else if (TYPE_P (arg
))
5380 return arg_assoc_type (k
, arg
);
5381 /* It's a non-type template argument. */
5386 /* Adds the class and its friends to the lookup structure.
5387 Returns true on error. */
5390 arg_assoc_class_only (struct arg_lookup
*k
, tree type
)
5392 tree list
, friends
, context
;
5394 /* Backend-built structures, such as __builtin_va_list, aren't
5395 affected by all this. */
5396 if (!CLASS_TYPE_P (type
))
5399 context
= decl_namespace_context (type
);
5400 if (arg_assoc_namespace (k
, context
))
5403 complete_type (type
);
5405 /* Process friends. */
5406 for (list
= DECL_FRIENDLIST (TYPE_MAIN_DECL (type
)); list
;
5407 list
= TREE_CHAIN (list
))
5408 if (k
->name
== FRIEND_NAME (list
))
5409 for (friends
= FRIEND_DECLS (list
); friends
;
5410 friends
= TREE_CHAIN (friends
))
5412 tree fn
= TREE_VALUE (friends
);
5414 /* Only interested in global functions with potentially hidden
5415 (i.e. unqualified) declarations. */
5416 if (CP_DECL_CONTEXT (fn
) != context
)
5418 /* Template specializations are never found by name lookup.
5419 (Templates themselves can be found, but not template
5420 specializations.) */
5421 if (TREE_CODE (fn
) == FUNCTION_DECL
&& DECL_USE_TEMPLATE (fn
))
5423 if (add_function (k
, fn
))
5430 /* Adds the class and its bases to the lookup structure.
5431 Returns true on error. */
5434 arg_assoc_bases (struct arg_lookup
*k
, tree type
)
5436 if (arg_assoc_class_only (k
, type
))
5439 if (TYPE_BINFO (type
))
5441 /* Process baseclasses. */
5442 tree binfo
, base_binfo
;
5445 for (binfo
= TYPE_BINFO (type
), i
= 0;
5446 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
5447 if (arg_assoc_bases (k
, BINFO_TYPE (base_binfo
)))
5454 /* Adds everything associated with a class argument type to the lookup
5455 structure. Returns true on error.
5457 If T is a class type (including unions), its associated classes are: the
5458 class itself; the class of which it is a member, if any; and its direct
5459 and indirect base classes. Its associated namespaces are the namespaces
5460 of which its associated classes are members. Furthermore, if T is a
5461 class template specialization, its associated namespaces and classes
5462 also include: the namespaces and classes associated with the types of
5463 the template arguments provided for template type parameters (excluding
5464 template template parameters); the namespaces of which any template
5465 template arguments are members; and the classes of which any member
5466 templates used as template template arguments are members. [ Note:
5467 non-type template arguments do not contribute to the set of associated
5468 namespaces. --end note] */
5471 arg_assoc_class (struct arg_lookup
*k
, tree type
)
5476 /* Backend build structures, such as __builtin_va_list, aren't
5477 affected by all this. */
5478 if (!CLASS_TYPE_P (type
))
5481 if (vec_member (type
, k
->classes
))
5483 vec_safe_push (k
->classes
, type
);
5485 if (TYPE_CLASS_SCOPE_P (type
)
5486 && arg_assoc_class_only (k
, TYPE_CONTEXT (type
)))
5489 if (arg_assoc_bases (k
, type
))
5492 /* Process template arguments. */
5493 if (CLASSTYPE_TEMPLATE_INFO (type
)
5494 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
5496 list
= INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
5497 for (i
= 0; i
< TREE_VEC_LENGTH (list
); ++i
)
5498 if (arg_assoc_template_arg (k
, TREE_VEC_ELT (list
, i
)))
5505 /* Adds everything associated with a given type.
5506 Returns 1 on error. */
5509 arg_assoc_type (struct arg_lookup
*k
, tree type
)
5511 /* As we do not get the type of non-type dependent expressions
5512 right, we can end up with such things without a type. */
5516 if (TYPE_PTRDATAMEM_P (type
))
5518 /* Pointer to member: associate class type and value type. */
5519 if (arg_assoc_type (k
, TYPE_PTRMEM_CLASS_TYPE (type
)))
5521 return arg_assoc_type (k
, TYPE_PTRMEM_POINTED_TO_TYPE (type
));
5523 else switch (TREE_CODE (type
))
5533 case FIXED_POINT_TYPE
:
5538 if (TYPE_PTRMEMFUNC_P (type
))
5539 return arg_assoc_type (k
, TYPE_PTRMEMFUNC_FN_TYPE (type
));
5541 return arg_assoc_class (k
, type
);
5543 case REFERENCE_TYPE
:
5545 return arg_assoc_type (k
, TREE_TYPE (type
));
5547 if (TYPE_CLASS_SCOPE_P (type
)
5548 && arg_assoc_class_only (k
, TYPE_CONTEXT (type
)))
5550 return arg_assoc_namespace (k
, decl_namespace_context (type
));
5552 /* The basetype is referenced in the first arg type, so just
5555 /* Associate the parameter types. */
5556 if (arg_assoc_args (k
, TYPE_ARG_TYPES (type
)))
5558 /* Associate the return type. */
5559 return arg_assoc_type (k
, TREE_TYPE (type
));
5560 case TEMPLATE_TYPE_PARM
:
5561 case BOUND_TEMPLATE_TEMPLATE_PARM
:
5566 gcc_assert (type
== unknown_type_node
5567 || type
== init_list_type_node
);
5569 case TYPE_PACK_EXPANSION
:
5570 return arg_assoc_type (k
, PACK_EXPANSION_PATTERN (type
));
5578 /* Adds everything associated with arguments. Returns true on error. */
5581 arg_assoc_args (struct arg_lookup
*k
, tree args
)
5583 for (; args
; args
= TREE_CHAIN (args
))
5584 if (arg_assoc (k
, TREE_VALUE (args
)))
5589 /* Adds everything associated with an argument vector. Returns true
5593 arg_assoc_args_vec (struct arg_lookup
*k
, vec
<tree
, va_gc
> *args
)
5598 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
5599 if (arg_assoc (k
, arg
))
5604 /* Adds everything associated with a given tree_node. Returns 1 on error. */
5607 arg_assoc (struct arg_lookup
*k
, tree n
)
5609 if (n
== error_mark_node
)
5613 return arg_assoc_type (k
, n
);
5615 if (! type_unknown_p (n
))
5616 return arg_assoc_type (k
, TREE_TYPE (n
));
5618 if (TREE_CODE (n
) == ADDR_EXPR
)
5619 n
= TREE_OPERAND (n
, 0);
5620 if (TREE_CODE (n
) == COMPONENT_REF
)
5621 n
= TREE_OPERAND (n
, 1);
5622 if (TREE_CODE (n
) == OFFSET_REF
)
5623 n
= TREE_OPERAND (n
, 1);
5624 while (TREE_CODE (n
) == TREE_LIST
)
5627 n
= BASELINK_FUNCTIONS (n
);
5629 if (TREE_CODE (n
) == FUNCTION_DECL
)
5630 return arg_assoc_type (k
, TREE_TYPE (n
));
5631 if (TREE_CODE (n
) == TEMPLATE_ID_EXPR
)
5633 /* The working paper doesn't currently say how to handle template-id
5634 arguments. The sensible thing would seem to be to handle the list
5635 of template candidates like a normal overload set, and handle the
5636 template arguments like we do for class template
5638 tree templ
= TREE_OPERAND (n
, 0);
5639 tree args
= TREE_OPERAND (n
, 1);
5642 /* First the templates. */
5643 if (arg_assoc (k
, templ
))
5646 /* Now the arguments. */
5648 for (ix
= TREE_VEC_LENGTH (args
); ix
--;)
5649 if (arg_assoc_template_arg (k
, TREE_VEC_ELT (args
, ix
)) == 1)
5652 else if (TREE_CODE (n
) == OVERLOAD
)
5654 for (; n
; n
= OVL_NEXT (n
))
5655 if (arg_assoc_type (k
, TREE_TYPE (OVL_CURRENT (n
))))
5662 /* Performs Koenig lookup depending on arguments, where fns
5663 are the functions found in normal lookup. */
5666 lookup_arg_dependent_1 (tree name
, tree fns
, vec
<tree
, va_gc
> *args
)
5668 struct arg_lookup k
;
5670 /* Remove any hidden friend functions from the list of functions
5671 found so far. They will be added back by arg_assoc_class as
5673 fns
= remove_hidden_names (fns
);
5678 k
.classes
= make_tree_vector ();
5680 /* We previously performed an optimization here by setting
5681 NAMESPACES to the current namespace when it was safe. However, DR
5682 164 says that namespaces that were already searched in the first
5683 stage of template processing are searched again (potentially
5684 picking up later definitions) in the second stage. */
5685 k
.namespaces
= make_tree_vector ();
5687 /* We used to allow duplicates and let joust discard them, but
5688 since the above change for DR 164 we end up with duplicates of
5689 all the functions found by unqualified lookup. So keep track
5690 of which ones we've seen. */
5694 /* We shouldn't be here if lookup found something other than
5695 namespace-scope functions. */
5696 gcc_assert (DECL_NAMESPACE_SCOPE_P (OVL_CURRENT (fns
)));
5697 k
.fn_set
= new hash_set
<tree
>;
5698 for (ovl
= fns
; ovl
; ovl
= OVL_NEXT (ovl
))
5699 k
.fn_set
->add (OVL_CURRENT (ovl
));
5704 arg_assoc_args_vec (&k
, args
);
5710 && !is_overloaded_fn (fns
))
5712 error ("argument dependent lookup finds %q+D", fns
);
5713 error (" in call to %qD", name
);
5714 fns
= error_mark_node
;
5717 release_tree_vector (k
.classes
);
5718 release_tree_vector (k
.namespaces
);
5724 /* Wrapper for lookup_arg_dependent_1. */
5727 lookup_arg_dependent (tree name
, tree fns
, vec
<tree
, va_gc
> *args
)
5731 subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
5732 ret
= lookup_arg_dependent_1 (name
, fns
, args
);
5733 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
5738 /* Add namespace to using_directives. Return NULL_TREE if nothing was
5739 changed (i.e. there was already a directive), or the fresh
5740 TREE_LIST otherwise. */
5743 push_using_directive_1 (tree used
)
5745 tree ud
= current_binding_level
->using_directives
;
5746 tree iter
, ancestor
;
5748 /* Check if we already have this. */
5749 if (purpose_member (used
, ud
) != NULL_TREE
)
5752 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
5753 ud
= current_binding_level
->using_directives
;
5754 ud
= tree_cons (used
, ancestor
, ud
);
5755 current_binding_level
->using_directives
= ud
;
5757 /* Recursively add all namespaces used. */
5758 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
5759 push_using_directive (TREE_PURPOSE (iter
));
5764 /* Wrapper for push_using_directive_1. */
5767 push_using_directive (tree used
)
5770 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
5771 ret
= push_using_directive_1 (used
);
5772 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
5776 /* The type TYPE is being declared. If it is a class template, or a
5777 specialization of a class template, do any processing required and
5778 perform error-checking. If IS_FRIEND is nonzero, this TYPE is
5779 being declared a friend. B is the binding level at which this TYPE
5782 Returns the TYPE_DECL for TYPE, which may have been altered by this
5786 maybe_process_template_type_declaration (tree type
, int is_friend
,
5787 cp_binding_level
*b
)
5789 tree decl
= TYPE_NAME (type
);
5791 if (processing_template_parmlist
)
5792 /* You can't declare a new template type in a template parameter
5793 list. But, you can declare a non-template type:
5795 template <class A*> struct S;
5797 is a forward-declaration of `A'. */
5799 else if (b
->kind
== sk_namespace
5800 && current_binding_level
->kind
!= sk_namespace
)
5801 /* If this new type is being injected into a containing scope,
5802 then it's not a template type. */
5806 gcc_assert (MAYBE_CLASS_TYPE_P (type
)
5807 || TREE_CODE (type
) == ENUMERAL_TYPE
);
5809 if (processing_template_decl
)
5811 /* This may change after the call to
5812 push_template_decl_real, but we want the original value. */
5813 tree name
= DECL_NAME (decl
);
5815 decl
= push_template_decl_real (decl
, is_friend
);
5816 if (decl
== error_mark_node
)
5817 return error_mark_node
;
5819 /* If the current binding level is the binding level for the
5820 template parameters (see the comment in
5821 begin_template_parm_list) and the enclosing level is a class
5822 scope, and we're not looking at a friend, push the
5823 declaration of the member class into the class scope. In the
5824 friend case, push_template_decl will already have put the
5825 friend into global scope, if appropriate. */
5826 if (TREE_CODE (type
) != ENUMERAL_TYPE
5827 && !is_friend
&& b
->kind
== sk_template_parms
5828 && b
->level_chain
->kind
== sk_class
)
5830 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
5832 if (!COMPLETE_TYPE_P (current_class_type
))
5834 maybe_add_class_template_decl_list (current_class_type
,
5835 type
, /*friend_p=*/0);
5836 /* Put this UTD in the table of UTDs for the class. */
5837 if (CLASSTYPE_NESTED_UTDS (current_class_type
) == NULL
)
5838 CLASSTYPE_NESTED_UTDS (current_class_type
) =
5839 binding_table_new (SCOPE_DEFAULT_HT_SIZE
);
5841 binding_table_insert
5842 (CLASSTYPE_NESTED_UTDS (current_class_type
), name
, type
);
5851 /* Push a tag name NAME for struct/class/union/enum type TYPE. In case
5852 that the NAME is a class template, the tag is processed but not pushed.
5854 The pushed scope depend on the SCOPE parameter:
5855 - When SCOPE is TS_CURRENT, put it into the inner-most non-sk_cleanup
5857 - When SCOPE is TS_GLOBAL, put it in the inner-most non-class and
5858 non-template-parameter scope. This case is needed for forward
5860 - When SCOPE is TS_WITHIN_ENCLOSING_NON_CLASS, this is similar to
5861 TS_GLOBAL case except that names within template-parameter scopes
5862 are not pushed at all.
5864 Returns TYPE upon success and ERROR_MARK_NODE otherwise. */
5867 pushtag_1 (tree name
, tree type
, tag_scope scope
)
5869 cp_binding_level
*b
;
5872 b
= current_binding_level
;
5873 while (/* Cleanup scopes are not scopes from the point of view of
5875 b
->kind
== sk_cleanup
5876 /* Neither are function parameter scopes. */
5877 || b
->kind
== sk_function_parms
5878 /* Neither are the scopes used to hold template parameters
5879 for an explicit specialization. For an ordinary template
5880 declaration, these scopes are not scopes from the point of
5881 view of the language. */
5882 || (b
->kind
== sk_template_parms
5883 && (b
->explicit_spec_p
|| scope
== ts_global
))
5884 || (b
->kind
== sk_class
5885 && (scope
!= ts_current
5886 /* We may be defining a new type in the initializer
5887 of a static member variable. We allow this when
5888 not pedantic, and it is particularly useful for
5889 type punning via an anonymous union. */
5890 || COMPLETE_TYPE_P (b
->this_entity
))))
5893 gcc_assert (identifier_p (name
));
5895 /* Do C++ gratuitous typedefing. */
5896 if (identifier_type_value_1 (name
) != type
)
5900 tree context
= TYPE_CONTEXT (type
);
5904 tree cs
= current_scope ();
5906 if (scope
== ts_current
5907 || (cs
&& TREE_CODE (cs
) == FUNCTION_DECL
))
5909 else if (cs
!= NULL_TREE
&& TYPE_P (cs
))
5910 /* When declaring a friend class of a local class, we want
5911 to inject the newly named class into the scope
5912 containing the local class, not the namespace
5914 context
= decl_function_context (get_type_decl (cs
));
5917 context
= current_namespace
;
5919 if (b
->kind
== sk_class
5920 || (b
->kind
== sk_template_parms
5921 && b
->level_chain
->kind
== sk_class
))
5924 if (current_lang_name
== lang_name_java
)
5925 TYPE_FOR_JAVA (type
) = 1;
5927 tdef
= create_implicit_typedef (name
, type
);
5928 DECL_CONTEXT (tdef
) = FROB_CONTEXT (context
);
5929 if (scope
== ts_within_enclosing_non_class
)
5931 /* This is a friend. Make this TYPE_DECL node hidden from
5932 ordinary name lookup. Its corresponding TEMPLATE_DECL
5933 will be marked in push_template_decl_real. */
5934 retrofit_lang_decl (tdef
);
5935 DECL_ANTICIPATED (tdef
) = 1;
5936 DECL_FRIEND_P (tdef
) = 1;
5939 decl
= maybe_process_template_type_declaration
5940 (type
, scope
== ts_within_enclosing_non_class
, b
);
5941 if (decl
== error_mark_node
)
5944 if (b
->kind
== sk_class
)
5946 if (!TYPE_BEING_DEFINED (current_class_type
))
5947 return error_mark_node
;
5949 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
5950 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
5951 class. But if it's a member template class, we want
5952 the TEMPLATE_DECL, not the TYPE_DECL, so this is done
5954 finish_member_declaration (decl
);
5956 pushdecl_class_level (decl
);
5958 else if (b
->kind
!= sk_template_parms
)
5960 decl
= pushdecl_with_scope_1 (decl
, b
, /*is_friend=*/false);
5961 if (decl
== error_mark_node
)
5966 set_identifier_type_value_with_scope (name
, tdef
, b
);
5968 TYPE_CONTEXT (type
) = DECL_CONTEXT (decl
);
5970 /* If this is a local class, keep track of it. We need this
5971 information for name-mangling, and so that it is possible to
5972 find all function definitions in a translation unit in a
5973 convenient way. (It's otherwise tricky to find a member
5974 function definition it's only pointed to from within a local
5976 if (TYPE_FUNCTION_SCOPE_P (type
))
5978 if (processing_template_decl
)
5980 /* Push a DECL_EXPR so we call pushtag at the right time in
5981 template instantiation rather than in some nested context. */
5982 add_decl_expr (decl
);
5985 vec_safe_push (local_classes
, type
);
5988 if (b
->kind
== sk_class
5989 && !COMPLETE_TYPE_P (current_class_type
))
5991 maybe_add_class_template_decl_list (current_class_type
,
5992 type
, /*friend_p=*/0);
5994 if (CLASSTYPE_NESTED_UTDS (current_class_type
) == NULL
)
5995 CLASSTYPE_NESTED_UTDS (current_class_type
)
5996 = binding_table_new (SCOPE_DEFAULT_HT_SIZE
);
5998 binding_table_insert
5999 (CLASSTYPE_NESTED_UTDS (current_class_type
), name
, type
);
6002 decl
= TYPE_NAME (type
);
6003 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
6005 /* Set type visibility now if this is a forward declaration. */
6006 TREE_PUBLIC (decl
) = 1;
6007 determine_visibility (decl
);
6012 /* Wrapper for pushtag_1. */
6015 pushtag (tree name
, tree type
, tag_scope scope
)
6018 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
6019 ret
= pushtag_1 (name
, type
, scope
);
6020 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
6024 /* Subroutines for reverting temporarily to top-level for instantiation
6025 of templates and such. We actually need to clear out the class- and
6026 local-value slots of all identifiers, so that only the global values
6027 are at all visible. Simply setting current_binding_level to the global
6028 scope isn't enough, because more binding levels may be pushed. */
6029 struct saved_scope
*scope_chain
;
6031 /* Return true if ID has not already been marked. */
6034 store_binding_p (tree id
)
6036 if (!id
|| !IDENTIFIER_BINDING (id
))
6039 if (IDENTIFIER_MARKED (id
))
6045 /* Add an appropriate binding to *OLD_BINDINGS which needs to already
6046 have enough space reserved. */
6049 store_binding (tree id
, vec
<cxx_saved_binding
, va_gc
> **old_bindings
)
6051 cxx_saved_binding saved
;
6053 gcc_checking_assert (store_binding_p (id
));
6055 IDENTIFIER_MARKED (id
) = 1;
6057 saved
.identifier
= id
;
6058 saved
.binding
= IDENTIFIER_BINDING (id
);
6059 saved
.real_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
6060 (*old_bindings
)->quick_push (saved
);
6061 IDENTIFIER_BINDING (id
) = NULL
;
6065 store_bindings (tree names
, vec
<cxx_saved_binding
, va_gc
> **old_bindings
)
6067 static vec
<tree
> bindings_need_stored
= vNULL
;
6071 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
6072 for (t
= names
; t
; t
= TREE_CHAIN (t
))
6074 if (TREE_CODE (t
) == TREE_LIST
)
6075 id
= TREE_PURPOSE (t
);
6079 if (store_binding_p (id
))
6080 bindings_need_stored
.safe_push (id
);
6082 if (!bindings_need_stored
.is_empty ())
6084 vec_safe_reserve_exact (*old_bindings
, bindings_need_stored
.length ());
6085 for (i
= 0; bindings_need_stored
.iterate (i
, &id
); ++i
)
6087 /* We can appearantly have duplicates in NAMES. */
6088 if (store_binding_p (id
))
6089 store_binding (id
, old_bindings
);
6091 bindings_need_stored
.truncate (0);
6093 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
6096 /* Like store_bindings, but NAMES is a vector of cp_class_binding
6097 objects, rather than a TREE_LIST. */
6100 store_class_bindings (vec
<cp_class_binding
, va_gc
> *names
,
6101 vec
<cxx_saved_binding
, va_gc
> **old_bindings
)
6103 static vec
<tree
> bindings_need_stored
= vNULL
;
6105 cp_class_binding
*cb
;
6107 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
6108 for (i
= 0; vec_safe_iterate (names
, i
, &cb
); ++i
)
6109 if (store_binding_p (cb
->identifier
))
6110 bindings_need_stored
.safe_push (cb
->identifier
);
6111 if (!bindings_need_stored
.is_empty ())
6114 vec_safe_reserve_exact (*old_bindings
, bindings_need_stored
.length ());
6115 for (i
= 0; bindings_need_stored
.iterate (i
, &id
); ++i
)
6116 store_binding (id
, old_bindings
);
6117 bindings_need_stored
.truncate (0);
6119 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
6123 push_to_top_level (void)
6125 struct saved_scope
*s
;
6126 cp_binding_level
*b
;
6127 cxx_saved_binding
*sb
;
6131 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
6132 s
= ggc_cleared_alloc
<saved_scope
> ();
6134 b
= scope_chain
? current_binding_level
: 0;
6136 /* If we're in the middle of some function, save our state. */
6140 push_function_context ();
6145 if (scope_chain
&& previous_class_level
)
6146 store_class_bindings (previous_class_level
->class_shadowed
,
6149 /* Have to include the global scope, because class-scope decls
6150 aren't listed anywhere useful. */
6151 for (; b
; b
= b
->level_chain
)
6155 /* Template IDs are inserted into the global level. If they were
6156 inserted into namespace level, finish_file wouldn't find them
6157 when doing pending instantiations. Therefore, don't stop at
6158 namespace level, but continue until :: . */
6159 if (global_scope_p (b
))
6162 store_bindings (b
->names
, &s
->old_bindings
);
6163 /* We also need to check class_shadowed to save class-level type
6164 bindings, since pushclass doesn't fill in b->names. */
6165 if (b
->kind
== sk_class
)
6166 store_class_bindings (b
->class_shadowed
, &s
->old_bindings
);
6168 /* Unwind type-value slots back to top level. */
6169 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
6170 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
6173 FOR_EACH_VEC_SAFE_ELT (s
->old_bindings
, i
, sb
)
6174 IDENTIFIER_MARKED (sb
->identifier
) = 0;
6176 s
->prev
= scope_chain
;
6178 s
->need_pop_function_context
= need_pop
;
6179 s
->function_decl
= current_function_decl
;
6180 s
->unevaluated_operand
= cp_unevaluated_operand
;
6181 s
->inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
6182 s
->x_stmt_tree
.stmts_are_full_exprs_p
= true;
6185 current_function_decl
= NULL_TREE
;
6186 vec_alloc (current_lang_base
, 10);
6187 current_lang_name
= lang_name_cplusplus
;
6188 current_namespace
= global_namespace
;
6189 push_class_stack ();
6190 cp_unevaluated_operand
= 0;
6191 c_inhibit_evaluation_warnings
= 0;
6192 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
6196 pop_from_top_level_1 (void)
6198 struct saved_scope
*s
= scope_chain
;
6199 cxx_saved_binding
*saved
;
6202 /* Clear out class-level bindings cache. */
6203 if (previous_class_level
)
6204 invalidate_class_lookup_cache ();
6207 current_lang_base
= 0;
6209 scope_chain
= s
->prev
;
6210 FOR_EACH_VEC_SAFE_ELT (s
->old_bindings
, i
, saved
)
6212 tree id
= saved
->identifier
;
6214 IDENTIFIER_BINDING (id
) = saved
->binding
;
6215 SET_IDENTIFIER_TYPE_VALUE (id
, saved
->real_type_value
);
6218 /* If we were in the middle of compiling a function, restore our
6220 if (s
->need_pop_function_context
)
6221 pop_function_context ();
6222 current_function_decl
= s
->function_decl
;
6223 cp_unevaluated_operand
= s
->unevaluated_operand
;
6224 c_inhibit_evaluation_warnings
= s
->inhibit_evaluation_warnings
;
6227 /* Wrapper for pop_from_top_level_1. */
6230 pop_from_top_level (void)
6232 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
6233 pop_from_top_level_1 ();
6234 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
6238 /* Pop off extraneous binding levels left over due to syntax errors.
6240 We don't pop past namespaces, as they might be valid. */
6243 pop_everything (void)
6245 if (ENABLE_SCOPE_CHECKING
)
6246 verbatim ("XXX entering pop_everything ()\n");
6247 while (!toplevel_bindings_p ())
6249 if (current_binding_level
->kind
== sk_class
)
6250 pop_nested_class ();
6254 if (ENABLE_SCOPE_CHECKING
)
6255 verbatim ("XXX leaving pop_everything ()\n");
6258 /* Emit debugging information for using declarations and directives.
6259 If input tree is overloaded fn then emit debug info for all
6263 cp_emit_debug_info_for_using (tree t
, tree context
)
6265 /* Don't try to emit any debug information if we have errors. */
6269 /* Ignore this FUNCTION_DECL if it refers to a builtin declaration
6270 of a builtin function. */
6271 if (TREE_CODE (t
) == FUNCTION_DECL
6272 && DECL_EXTERNAL (t
)
6273 && DECL_BUILT_IN (t
))
6276 /* Do not supply context to imported_module_or_decl, if
6277 it is a global namespace. */
6278 if (context
== global_namespace
)
6279 context
= NULL_TREE
;
6282 t
= BASELINK_FUNCTIONS (t
);
6284 /* FIXME: Handle TEMPLATE_DECLs. */
6285 for (t
= OVL_CURRENT (t
); t
; t
= OVL_NEXT (t
))
6286 if (TREE_CODE (t
) != TEMPLATE_DECL
)
6288 if (building_stmt_list_p ())
6289 add_stmt (build_stmt (input_location
, USING_STMT
, t
));
6291 (*debug_hooks
->imported_module_or_decl
) (t
, NULL_TREE
, context
, false);
6295 #include "gt-cp-name-lookup.h"