1 /* Definitions for C++ name lookup routines.
2 Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012
3 Free Software Foundation, Inc.
4 Contributed by Gabriel Dos Reis <gdr@integrable-solutions.net>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
29 #include "name-lookup.h"
31 #include "diagnostic-core.h"
34 #include "c-family/c-pragma.h"
36 #include "pointer-set.h"
38 /* The bindings for a particular name in a particular scope. */
40 struct scope_binding
{
44 #define EMPTY_SCOPE_BINDING { NULL_TREE, NULL_TREE }
46 static cp_binding_level
*innermost_nonclass_level (void);
47 static cxx_binding
*binding_for_name (cp_binding_level
*, tree
);
48 static tree
push_overloaded_decl (tree
, int, bool);
49 static bool lookup_using_namespace (tree
, struct scope_binding
*, tree
,
51 static bool qualified_lookup_using_namespace (tree
, tree
,
52 struct scope_binding
*, int);
53 static tree
lookup_type_current_level (tree
);
54 static tree
push_using_directive (tree
);
55 static tree
lookup_extern_c_fun_in_all_ns (tree
);
56 static void diagnose_name_conflict (tree
, tree
);
58 /* The :: namespace. */
60 tree global_namespace
;
62 /* The name of the anonymous namespace, throughout this translation
64 static GTY(()) tree anonymous_namespace_name
;
66 /* Initialize anonymous_namespace_name if necessary, and return it. */
69 get_anonymous_namespace_name (void)
71 if (!anonymous_namespace_name
)
73 /* The anonymous namespace has to have a unique name
74 if typeinfo objects are being compared by name. */
75 if (! flag_weak
|| ! SUPPORTS_ONE_ONLY
)
76 anonymous_namespace_name
= get_file_function_name ("N");
78 /* The demangler expects anonymous namespaces to be called
79 something starting with '_GLOBAL__N_'. */
80 anonymous_namespace_name
= get_identifier ("_GLOBAL__N_1");
82 return anonymous_namespace_name
;
85 /* Compute the chain index of a binding_entry given the HASH value of its
86 name and the total COUNT of chains. COUNT is assumed to be a power
89 #define ENTRY_INDEX(HASH, COUNT) (((HASH) >> 3) & ((COUNT) - 1))
91 /* A free list of "binding_entry"s awaiting for re-use. */
93 static GTY((deletable
)) binding_entry free_binding_entry
= NULL
;
95 /* Create a binding_entry object for (NAME, TYPE). */
97 static inline binding_entry
98 binding_entry_make (tree name
, tree type
)
102 if (free_binding_entry
)
104 entry
= free_binding_entry
;
105 free_binding_entry
= entry
->chain
;
108 entry
= ggc_alloc_binding_entry_s ();
117 /* Put ENTRY back on the free list. */
120 binding_entry_free (binding_entry entry
)
124 entry
->chain
= free_binding_entry
;
125 free_binding_entry
= entry
;
129 /* The datatype used to implement the mapping from names to types at
131 struct GTY(()) binding_table_s
{
132 /* Array of chains of "binding_entry"s */
133 binding_entry
* GTY((length ("%h.chain_count"))) chain
;
135 /* The number of chains in this table. This is the length of the
136 member "chain" considered as an array. */
139 /* Number of "binding_entry"s in this table. */
143 /* Construct TABLE with an initial CHAIN_COUNT. */
146 binding_table_construct (binding_table table
, size_t chain_count
)
148 table
->chain_count
= chain_count
;
149 table
->entry_count
= 0;
150 table
->chain
= ggc_alloc_cleared_vec_binding_entry (table
->chain_count
);
153 /* Make TABLE's entries ready for reuse. */
156 binding_table_free (binding_table table
)
164 for (i
= 0, count
= table
->chain_count
; i
< count
; ++i
)
166 binding_entry temp
= table
->chain
[i
];
169 binding_entry entry
= temp
;
171 binding_entry_free (entry
);
173 table
->chain
[i
] = NULL
;
175 table
->entry_count
= 0;
179 /* Allocate a table with CHAIN_COUNT, assumed to be a power of two. */
181 static inline binding_table
182 binding_table_new (size_t chain_count
)
184 binding_table table
= ggc_alloc_binding_table_s ();
186 binding_table_construct (table
, chain_count
);
190 /* Expand TABLE to twice its current chain_count. */
193 binding_table_expand (binding_table table
)
195 const size_t old_chain_count
= table
->chain_count
;
196 const size_t old_entry_count
= table
->entry_count
;
197 const size_t new_chain_count
= 2 * old_chain_count
;
198 binding_entry
*old_chains
= table
->chain
;
201 binding_table_construct (table
, new_chain_count
);
202 for (i
= 0; i
< old_chain_count
; ++i
)
204 binding_entry entry
= old_chains
[i
];
205 for (; entry
!= NULL
; entry
= old_chains
[i
])
207 const unsigned int hash
= IDENTIFIER_HASH_VALUE (entry
->name
);
208 const size_t j
= ENTRY_INDEX (hash
, new_chain_count
);
210 old_chains
[i
] = entry
->chain
;
211 entry
->chain
= table
->chain
[j
];
212 table
->chain
[j
] = entry
;
215 table
->entry_count
= old_entry_count
;
218 /* Insert a binding for NAME to TYPE into TABLE. */
221 binding_table_insert (binding_table table
, tree name
, tree type
)
223 const unsigned int hash
= IDENTIFIER_HASH_VALUE (name
);
224 const size_t i
= ENTRY_INDEX (hash
, table
->chain_count
);
225 binding_entry entry
= binding_entry_make (name
, type
);
227 entry
->chain
= table
->chain
[i
];
228 table
->chain
[i
] = entry
;
229 ++table
->entry_count
;
231 if (3 * table
->chain_count
< 5 * table
->entry_count
)
232 binding_table_expand (table
);
235 /* Return the binding_entry, if any, that maps NAME. */
238 binding_table_find (binding_table table
, tree name
)
240 const unsigned int hash
= IDENTIFIER_HASH_VALUE (name
);
241 binding_entry entry
= table
->chain
[ENTRY_INDEX (hash
, table
->chain_count
)];
243 while (entry
!= NULL
&& entry
->name
!= name
)
244 entry
= entry
->chain
;
249 /* Apply PROC -- with DATA -- to all entries in TABLE. */
252 binding_table_foreach (binding_table table
, bt_foreach_proc proc
, void *data
)
254 const size_t chain_count
= table
->chain_count
;
257 for (i
= 0; i
< chain_count
; ++i
)
259 binding_entry entry
= table
->chain
[i
];
260 for (; entry
!= NULL
; entry
= entry
->chain
)
265 #ifndef ENABLE_SCOPE_CHECKING
266 # define ENABLE_SCOPE_CHECKING 0
268 # define ENABLE_SCOPE_CHECKING 1
271 /* A free list of "cxx_binding"s, connected by their PREVIOUS. */
273 static GTY((deletable
)) cxx_binding
*free_bindings
;
275 /* Initialize VALUE and TYPE field for BINDING, and set the PREVIOUS
279 cxx_binding_init (cxx_binding
*binding
, tree value
, tree type
)
281 binding
->value
= value
;
282 binding
->type
= type
;
283 binding
->previous
= NULL
;
286 /* (GC)-allocate a binding object with VALUE and TYPE member initialized. */
289 cxx_binding_make (tree value
, tree type
)
291 cxx_binding
*binding
;
294 binding
= free_bindings
;
295 free_bindings
= binding
->previous
;
298 binding
= ggc_alloc_cxx_binding ();
300 cxx_binding_init (binding
, value
, type
);
305 /* Put BINDING back on the free list. */
308 cxx_binding_free (cxx_binding
*binding
)
310 binding
->scope
= NULL
;
311 binding
->previous
= free_bindings
;
312 free_bindings
= binding
;
315 /* Create a new binding for NAME (with the indicated VALUE and TYPE
316 bindings) in the class scope indicated by SCOPE. */
319 new_class_binding (tree name
, tree value
, tree type
, cp_binding_level
*scope
)
321 cp_class_binding cb
= {cxx_binding_make (value
, type
), name
};
322 cxx_binding
*binding
= cb
.base
;
323 vec_safe_push (scope
->class_shadowed
, cb
);
324 binding
->scope
= scope
;
328 /* Make DECL the innermost binding for ID. The LEVEL is the binding
329 level at which this declaration is being bound. */
332 push_binding (tree id
, tree decl
, cp_binding_level
* level
)
334 cxx_binding
*binding
;
336 if (level
!= class_binding_level
)
338 binding
= cxx_binding_make (decl
, NULL_TREE
);
339 binding
->scope
= level
;
342 binding
= new_class_binding (id
, decl
, /*type=*/NULL_TREE
, level
);
344 /* Now, fill in the binding information. */
345 binding
->previous
= IDENTIFIER_BINDING (id
);
346 INHERITED_VALUE_BINDING_P (binding
) = 0;
347 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
349 /* And put it on the front of the list of bindings for ID. */
350 IDENTIFIER_BINDING (id
) = binding
;
353 /* Remove the binding for DECL which should be the innermost binding
357 pop_binding (tree id
, tree decl
)
359 cxx_binding
*binding
;
362 /* It's easiest to write the loops that call this function without
363 checking whether or not the entities involved have names. We
364 get here for such an entity. */
367 /* Get the innermost binding for ID. */
368 binding
= IDENTIFIER_BINDING (id
);
370 /* The name should be bound. */
371 gcc_assert (binding
!= NULL
);
373 /* The DECL will be either the ordinary binding or the type
374 binding for this identifier. Remove that binding. */
375 if (binding
->value
== decl
)
376 binding
->value
= NULL_TREE
;
379 gcc_assert (binding
->type
== decl
);
380 binding
->type
= NULL_TREE
;
383 if (!binding
->value
&& !binding
->type
)
385 /* We're completely done with the innermost binding for this
386 identifier. Unhook it from the list of bindings. */
387 IDENTIFIER_BINDING (id
) = binding
->previous
;
389 /* Add it to the free list. */
390 cxx_binding_free (binding
);
394 /* Strip non dependent using declarations. */
397 strip_using_decl (tree decl
)
399 if (decl
== NULL_TREE
)
402 while (TREE_CODE (decl
) == USING_DECL
&& !DECL_DEPENDENT_P (decl
))
403 decl
= USING_DECL_DECLS (decl
);
407 /* BINDING records an existing declaration for a name in the current scope.
408 But, DECL is another declaration for that same identifier in the
409 same scope. This is the `struct stat' hack whereby a non-typedef
410 class name or enum-name can be bound at the same level as some other
414 A class name (9.1) or enumeration name (7.2) can be hidden by the
415 name of an object, function, or enumerator declared in the same scope.
416 If a class or enumeration name and an object, function, or enumerator
417 are declared in the same scope (in any order) with the same name, the
418 class or enumeration name is hidden wherever the object, function, or
419 enumerator name is visible.
421 It's the responsibility of the caller to check that
422 inserting this name is valid here. Returns nonzero if the new binding
426 supplement_binding_1 (cxx_binding
*binding
, tree decl
)
428 tree bval
= binding
->value
;
430 tree target_bval
= strip_using_decl (bval
);
431 tree target_decl
= strip_using_decl (decl
);
433 if (TREE_CODE (target_decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (target_decl
)
434 && target_decl
!= target_bval
435 && (TREE_CODE (target_bval
) != TYPE_DECL
436 /* We allow pushing an enum multiple times in a class
437 template in order to handle late matching of underlying
438 type on an opaque-enum-declaration followed by an
440 || (processing_template_decl
441 && TREE_CODE (TREE_TYPE (target_decl
)) == ENUMERAL_TYPE
442 && TREE_CODE (TREE_TYPE (target_bval
)) == ENUMERAL_TYPE
443 && (dependent_type_p (ENUM_UNDERLYING_TYPE
444 (TREE_TYPE (target_decl
)))
445 || dependent_type_p (ENUM_UNDERLYING_TYPE
446 (TREE_TYPE (target_bval
)))))))
447 /* The new name is the type name. */
448 binding
->type
= decl
;
449 else if (/* TARGET_BVAL is null when push_class_level_binding moves
450 an inherited type-binding out of the way to make room
451 for a new value binding. */
453 /* TARGET_BVAL is error_mark_node when TARGET_DECL's name
454 has been used in a non-class scope prior declaration.
455 In that case, we should have already issued a
456 diagnostic; for graceful error recovery purpose, pretend
457 this was the intended declaration for that name. */
458 || target_bval
== error_mark_node
459 /* If TARGET_BVAL is anticipated but has not yet been
460 declared, pretend it is not there at all. */
461 || (TREE_CODE (target_bval
) == FUNCTION_DECL
462 && DECL_ANTICIPATED (target_bval
)
463 && !DECL_HIDDEN_FRIEND_P (target_bval
)))
464 binding
->value
= decl
;
465 else if (TREE_CODE (target_bval
) == TYPE_DECL
466 && DECL_ARTIFICIAL (target_bval
)
467 && target_decl
!= target_bval
468 && (TREE_CODE (target_decl
) != TYPE_DECL
469 || same_type_p (TREE_TYPE (target_decl
),
470 TREE_TYPE (target_bval
))))
472 /* The old binding was a type name. It was placed in
473 VALUE field because it was thought, at the point it was
474 declared, to be the only entity with such a name. Move the
475 type name into the type slot; it is now hidden by the new
477 binding
->type
= bval
;
478 binding
->value
= decl
;
479 binding
->value_is_inherited
= false;
481 else if (TREE_CODE (target_bval
) == TYPE_DECL
482 && TREE_CODE (target_decl
) == TYPE_DECL
483 && DECL_NAME (target_decl
) == DECL_NAME (target_bval
)
484 && binding
->scope
->kind
!= sk_class
485 && (same_type_p (TREE_TYPE (target_decl
), TREE_TYPE (target_bval
))
486 /* If either type involves template parameters, we must
487 wait until instantiation. */
488 || uses_template_parms (TREE_TYPE (target_decl
))
489 || uses_template_parms (TREE_TYPE (target_bval
))))
490 /* We have two typedef-names, both naming the same type to have
491 the same name. In general, this is OK because of:
495 In a given scope, a typedef specifier can be used to redefine
496 the name of any type declared in that scope to refer to the
497 type to which it already refers.
499 However, in class scopes, this rule does not apply due to the
500 stricter language in [class.mem] prohibiting redeclarations of
503 /* There can be two block-scope declarations of the same variable,
504 so long as they are `extern' declarations. However, there cannot
505 be two declarations of the same static data member:
509 A member shall not be declared twice in the
510 member-specification. */
511 else if (TREE_CODE (target_decl
) == VAR_DECL
512 && TREE_CODE (target_bval
) == VAR_DECL
513 && DECL_EXTERNAL (target_decl
) && DECL_EXTERNAL (target_bval
)
514 && !DECL_CLASS_SCOPE_P (target_decl
))
516 duplicate_decls (decl
, binding
->value
, /*newdecl_is_friend=*/false);
519 else if (TREE_CODE (decl
) == NAMESPACE_DECL
520 && TREE_CODE (bval
) == NAMESPACE_DECL
521 && DECL_NAMESPACE_ALIAS (decl
)
522 && DECL_NAMESPACE_ALIAS (bval
)
523 && ORIGINAL_NAMESPACE (bval
) == ORIGINAL_NAMESPACE (decl
))
526 In a declarative region, a namespace-alias-definition can be
527 used to redefine a namespace-alias declared in that declarative
528 region to refer only to the namespace to which it already
533 diagnose_name_conflict (decl
, bval
);
540 /* Diagnose a name conflict between DECL and BVAL. */
543 diagnose_name_conflict (tree decl
, tree bval
)
545 if (TREE_CODE (decl
) == TREE_CODE (bval
)
546 && (TREE_CODE (decl
) != TYPE_DECL
547 || (DECL_ARTIFICIAL (decl
) && DECL_ARTIFICIAL (bval
))
548 || (!DECL_ARTIFICIAL (decl
) && !DECL_ARTIFICIAL (bval
)))
549 && !is_overloaded_fn (decl
))
550 error ("redeclaration of %q#D", decl
);
552 error ("%q#D conflicts with a previous declaration", decl
);
554 inform (input_location
, "previous declaration %q+#D", bval
);
557 /* Wrapper for supplement_binding_1. */
560 supplement_binding (cxx_binding
*binding
, tree decl
)
563 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
564 ret
= supplement_binding_1 (binding
, decl
);
565 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
569 /* Add DECL to the list of things declared in B. */
572 add_decl_to_level (tree decl
, cp_binding_level
*b
)
574 /* We used to record virtual tables as if they were ordinary
575 variables, but no longer do so. */
576 gcc_assert (!(TREE_CODE (decl
) == VAR_DECL
&& DECL_VIRTUAL_P (decl
)));
578 if (TREE_CODE (decl
) == NAMESPACE_DECL
579 && !DECL_NAMESPACE_ALIAS (decl
))
581 DECL_CHAIN (decl
) = b
->namespaces
;
582 b
->namespaces
= decl
;
586 /* We build up the list in reverse order, and reverse it later if
588 TREE_CHAIN (decl
) = b
->names
;
591 /* If appropriate, add decl to separate list of statics. We
592 include extern variables because they might turn out to be
593 static later. It's OK for this list to contain a few false
595 if (b
->kind
== sk_namespace
)
596 if ((TREE_CODE (decl
) == VAR_DECL
597 && (TREE_STATIC (decl
) || DECL_EXTERNAL (decl
)))
598 || (TREE_CODE (decl
) == FUNCTION_DECL
599 && (!TREE_PUBLIC (decl
) || DECL_DECLARED_INLINE_P (decl
))))
600 vec_safe_push (b
->static_decls
, decl
);
604 /* Record a decl-node X as belonging to the current lexical scope.
605 Check for errors (such as an incompatible declaration for the same
606 name already seen in the same scope). IS_FRIEND is true if X is
607 declared as a friend.
609 Returns either X or an old decl for the same name.
610 If an old decl is returned, it may have been smashed
611 to agree with what X says. */
614 pushdecl_maybe_friend_1 (tree x
, bool is_friend
)
618 int need_new_binding
;
620 if (x
== error_mark_node
)
621 return error_mark_node
;
623 need_new_binding
= 1;
625 if (DECL_TEMPLATE_PARM_P (x
))
626 /* Template parameters have no context; they are not X::T even
627 when declared within a class or namespace. */
631 if (current_function_decl
&& x
!= current_function_decl
632 /* A local declaration for a function doesn't constitute
634 && TREE_CODE (x
) != FUNCTION_DECL
635 /* A local declaration for an `extern' variable is in the
636 scope of the current namespace, not the current
638 && !(TREE_CODE (x
) == VAR_DECL
&& DECL_EXTERNAL (x
))
639 /* When parsing the parameter list of a function declarator,
640 don't set DECL_CONTEXT to an enclosing function. When we
641 push the PARM_DECLs in order to process the function body,
642 current_binding_level->this_entity will be set. */
643 && !(TREE_CODE (x
) == PARM_DECL
644 && current_binding_level
->kind
== sk_function_parms
645 && current_binding_level
->this_entity
== NULL
)
646 && !DECL_CONTEXT (x
))
647 DECL_CONTEXT (x
) = current_function_decl
;
649 /* If this is the declaration for a namespace-scope function,
650 but the declaration itself is in a local scope, mark the
652 if (TREE_CODE (x
) == FUNCTION_DECL
653 && DECL_NAMESPACE_SCOPE_P (x
)
654 && current_function_decl
655 && x
!= current_function_decl
)
656 DECL_LOCAL_FUNCTION_P (x
) = 1;
659 name
= DECL_NAME (x
);
662 int different_binding_level
= 0;
664 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
665 name
= TREE_OPERAND (name
, 0);
667 /* In case this decl was explicitly namespace-qualified, look it
668 up in its namespace context. */
669 if (DECL_NAMESPACE_SCOPE_P (x
) && namespace_bindings_p ())
670 t
= namespace_binding (name
, DECL_CONTEXT (x
));
672 t
= lookup_name_innermost_nonclass_level (name
);
674 /* [basic.link] If there is a visible declaration of an entity
675 with linkage having the same name and type, ignoring entities
676 declared outside the innermost enclosing namespace scope, the
677 block scope declaration declares that same entity and
678 receives the linkage of the previous declaration. */
679 if (! t
&& current_function_decl
&& x
!= current_function_decl
680 && (TREE_CODE (x
) == FUNCTION_DECL
|| TREE_CODE (x
) == VAR_DECL
)
681 && DECL_EXTERNAL (x
))
683 /* Look in block scope. */
684 t
= innermost_non_namespace_value (name
);
685 /* Or in the innermost namespace. */
687 t
= namespace_binding (name
, DECL_CONTEXT (x
));
688 /* Does it have linkage? Note that if this isn't a DECL, it's an
689 OVERLOAD, which is OK. */
690 if (t
&& DECL_P (t
) && ! (TREE_STATIC (t
) || DECL_EXTERNAL (t
)))
693 different_binding_level
= 1;
696 /* If we are declaring a function, and the result of name-lookup
697 was an OVERLOAD, look for an overloaded instance that is
698 actually the same as the function we are declaring. (If
699 there is one, we have to merge our declaration with the
700 previous declaration.) */
701 if (t
&& TREE_CODE (t
) == OVERLOAD
)
705 if (TREE_CODE (x
) == FUNCTION_DECL
)
706 for (match
= t
; match
; match
= OVL_NEXT (match
))
708 if (decls_match (OVL_CURRENT (match
), x
))
712 /* Just choose one. */
716 t
= OVL_CURRENT (match
);
721 if (t
&& t
!= error_mark_node
)
723 if (different_binding_level
)
725 if (decls_match (x
, t
))
726 /* The standard only says that the local extern
727 inherits linkage from the previous decl; in
728 particular, default args are not shared. Add
729 the decl into a hash table to make sure only
730 the previous decl in this case is seen by the
733 struct cxx_int_tree_map
*h
;
736 TREE_PUBLIC (x
) = TREE_PUBLIC (t
);
738 if (cp_function_chain
->extern_decl_map
== NULL
)
739 cp_function_chain
->extern_decl_map
740 = htab_create_ggc (20, cxx_int_tree_map_hash
,
741 cxx_int_tree_map_eq
, NULL
);
743 h
= ggc_alloc_cxx_int_tree_map ();
744 h
->uid
= DECL_UID (x
);
746 loc
= htab_find_slot_with_hash
747 (cp_function_chain
->extern_decl_map
, h
,
749 *(struct cxx_int_tree_map
**) loc
= h
;
752 else if (TREE_CODE (t
) == PARM_DECL
)
754 /* Check for duplicate params. */
755 tree d
= duplicate_decls (x
, t
, is_friend
);
759 else if ((DECL_EXTERN_C_FUNCTION_P (x
)
760 || DECL_FUNCTION_TEMPLATE_P (x
))
761 && is_overloaded_fn (t
))
762 /* Don't do anything just yet. */;
763 else if (t
== wchar_decl_node
)
765 if (! DECL_IN_SYSTEM_HEADER (x
))
766 pedwarn (input_location
, OPT_Wpedantic
, "redeclaration of %<wchar_t%> as %qT",
769 /* Throw away the redeclaration. */
774 tree olddecl
= duplicate_decls (x
, t
, is_friend
);
776 /* If the redeclaration failed, we can stop at this
778 if (olddecl
== error_mark_node
)
779 return error_mark_node
;
783 if (TREE_CODE (t
) == TYPE_DECL
)
784 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
788 else if (DECL_MAIN_P (x
) && TREE_CODE (t
) == FUNCTION_DECL
)
790 /* A redeclaration of main, but not a duplicate of the
795 This function shall not be overloaded. */
796 error ("invalid redeclaration of %q+D", t
);
798 /* We don't try to push this declaration since that
805 /* If x has C linkage-specification, (extern "C"),
806 lookup its binding, in case it's already bound to an object.
807 The lookup is done in all namespaces.
808 If we find an existing binding, make sure it has the same
809 exception specification as x, otherwise, bail in error [7.5, 7.6]. */
810 if ((TREE_CODE (x
) == FUNCTION_DECL
)
811 && DECL_EXTERN_C_P (x
)
812 /* We should ignore declarations happening in system headers. */
813 && !DECL_ARTIFICIAL (x
)
814 && !DECL_IN_SYSTEM_HEADER (x
))
816 tree previous
= lookup_extern_c_fun_in_all_ns (x
);
818 && !DECL_ARTIFICIAL (previous
)
819 && !DECL_IN_SYSTEM_HEADER (previous
)
820 && DECL_CONTEXT (previous
) != DECL_CONTEXT (x
))
822 /* In case either x or previous is declared to throw an exception,
823 make sure both exception specifications are equal. */
824 if (decls_match (x
, previous
))
826 tree x_exception_spec
= NULL_TREE
;
827 tree previous_exception_spec
= NULL_TREE
;
830 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (x
));
831 previous_exception_spec
=
832 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (previous
));
833 if (!comp_except_specs (previous_exception_spec
,
837 pedwarn (input_location
, 0,
838 "declaration of %q#D with C language linkage",
840 pedwarn (input_location
, 0,
841 "conflicts with previous declaration %q+#D",
843 pedwarn (input_location
, 0,
844 "due to different exception specifications");
845 return error_mark_node
;
847 if (DECL_ASSEMBLER_NAME_SET_P (previous
))
848 SET_DECL_ASSEMBLER_NAME (x
,
849 DECL_ASSEMBLER_NAME (previous
));
853 pedwarn (input_location
, 0,
854 "declaration of %q#D with C language linkage", x
);
855 pedwarn (input_location
, 0,
856 "conflicts with previous declaration %q+#D",
862 check_template_shadow (x
);
864 /* If this is a function conjured up by the back end, massage it
865 so it looks friendly. */
866 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_LANG_SPECIFIC (x
))
868 retrofit_lang_decl (x
);
869 SET_DECL_LANGUAGE (x
, lang_c
);
873 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_FUNCTION_MEMBER_P (x
))
875 t
= push_overloaded_decl (x
, PUSH_LOCAL
, is_friend
);
876 if (!namespace_bindings_p ())
877 /* We do not need to create a binding for this name;
878 push_overloaded_decl will have already done so if
880 need_new_binding
= 0;
882 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
884 t
= push_overloaded_decl (x
, PUSH_GLOBAL
, is_friend
);
886 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
889 if (TREE_CODE (t
) == FUNCTION_DECL
|| DECL_FUNCTION_TEMPLATE_P (t
))
890 check_default_args (t
);
892 if (t
!= x
|| DECL_FUNCTION_TEMPLATE_P (t
))
895 /* If declaring a type as a typedef, copy the type (unless we're
896 at line 0), and install this TYPE_DECL as the new type's typedef
897 name. See the extensive comment of set_underlying_type (). */
898 if (TREE_CODE (x
) == TYPE_DECL
)
900 tree type
= TREE_TYPE (x
);
902 if (DECL_IS_BUILTIN (x
)
903 || (TREE_TYPE (x
) != error_mark_node
904 && TYPE_NAME (type
) != x
905 /* We don't want to copy the type when all we're
906 doing is making a TYPE_DECL for the purposes of
908 && (!TYPE_NAME (type
)
909 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
))))
910 set_underlying_type (x
);
912 if (type
!= error_mark_node
914 && TYPE_IDENTIFIER (type
))
915 set_identifier_type_value (DECL_NAME (x
), x
);
917 /* If this is a locally defined typedef in a function that
918 is not a template instantation, record it to implement
919 -Wunused-local-typedefs. */
920 if (current_instantiation () == NULL
921 || (current_instantiation ()->decl
!= current_function_decl
))
922 record_locally_defined_typedef (x
);
925 /* Multiple external decls of the same identifier ought to match.
927 We get warnings about inline functions where they are defined.
928 We get warnings about other functions from push_overloaded_decl.
930 Avoid duplicate warnings where they are used. */
931 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
935 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
936 if (decl
&& TREE_CODE (decl
) == OVERLOAD
)
937 decl
= OVL_FUNCTION (decl
);
939 if (decl
&& decl
!= error_mark_node
940 && (DECL_EXTERNAL (decl
) || TREE_PUBLIC (decl
))
941 /* If different sort of thing, we already gave an error. */
942 && TREE_CODE (decl
) == TREE_CODE (x
)
943 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
945 permerror (input_location
, "type mismatch with previous external decl of %q#D", x
);
946 permerror (input_location
, "previous external decl of %q+#D", decl
);
950 if (TREE_CODE (x
) == FUNCTION_DECL
952 && !flag_friend_injection
)
954 /* This is a new declaration of a friend function, so hide
955 it from ordinary function lookup. */
956 DECL_ANTICIPATED (x
) = 1;
957 DECL_HIDDEN_FRIEND_P (x
) = 1;
960 /* This name is new in its binding level.
961 Install the new declaration and return it. */
962 if (namespace_bindings_p ())
964 /* Install a global value. */
966 /* If the first global decl has external linkage,
967 warn if we later see static one. */
968 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
969 TREE_PUBLIC (name
) = 1;
971 /* Bind the name for the entity. */
972 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
974 && (TREE_CODE (x
) == TYPE_DECL
975 || TREE_CODE (x
) == VAR_DECL
976 || TREE_CODE (x
) == NAMESPACE_DECL
977 || TREE_CODE (x
) == CONST_DECL
978 || TREE_CODE (x
) == TEMPLATE_DECL
))
979 SET_IDENTIFIER_NAMESPACE_VALUE (name
, x
);
981 /* If new decl is `static' and an `extern' was seen previously,
983 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
984 warn_extern_redeclared_static (x
, t
);
988 /* Here to install a non-global value. */
989 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
990 tree oldlocal
= NULL_TREE
;
991 cp_binding_level
*oldscope
= NULL
;
992 cxx_binding
*oldbinding
= outer_binding (name
, NULL
, true);
995 oldlocal
= oldbinding
->value
;
996 oldscope
= oldbinding
->scope
;
999 if (need_new_binding
)
1001 push_local_binding (name
, x
, 0);
1002 /* Because push_local_binding will hook X on to the
1003 current_binding_level's name list, we don't want to
1004 do that again below. */
1005 need_new_binding
= 0;
1008 /* If this is a TYPE_DECL, push it into the type value slot. */
1009 if (TREE_CODE (x
) == TYPE_DECL
)
1010 set_identifier_type_value (name
, x
);
1012 /* Clear out any TYPE_DECL shadowed by a namespace so that
1013 we won't think this is a type. The C struct hack doesn't
1014 go through namespaces. */
1015 if (TREE_CODE (x
) == NAMESPACE_DECL
)
1016 set_identifier_type_value (name
, NULL_TREE
);
1023 && TREE_CODE (oldlocal
) == VAR_DECL
1024 && DECL_DEAD_FOR_LOCAL (oldlocal
))
1025 oldlocal
= DECL_SHADOWED_FOR_VAR (oldlocal
);
1027 if (oldlocal
== NULL_TREE
)
1028 oldlocal
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d
));
1031 /* If this is an extern function declaration, see if we
1032 have a global definition or declaration for the function. */
1033 if (oldlocal
== NULL_TREE
1034 && DECL_EXTERNAL (x
)
1035 && oldglobal
!= NULL_TREE
1036 && TREE_CODE (x
) == FUNCTION_DECL
1037 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
1039 /* We have one. Their types must agree. */
1040 if (decls_match (x
, oldglobal
))
1044 warning (0, "extern declaration of %q#D doesn%'t match", x
);
1045 warning (0, "global declaration %q+#D", oldglobal
);
1048 /* If we have a local external declaration,
1049 and no file-scope declaration has yet been seen,
1050 then if we later have a file-scope decl it must not be static. */
1051 if (oldlocal
== NULL_TREE
1052 && oldglobal
== NULL_TREE
1053 && DECL_EXTERNAL (x
)
1055 TREE_PUBLIC (name
) = 1;
1057 /* Don't complain about the parms we push and then pop
1058 while tentatively parsing a function declarator. */
1059 if (TREE_CODE (x
) == PARM_DECL
&& DECL_CONTEXT (x
) == NULL_TREE
)
1062 /* Warn if shadowing an argument at the top level of the body. */
1063 else if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
1064 /* Inline decls shadow nothing. */
1065 && !DECL_FROM_INLINE (x
)
1066 && (TREE_CODE (oldlocal
) == PARM_DECL
1067 || TREE_CODE (oldlocal
) == VAR_DECL
1068 /* If the old decl is a type decl, only warn if the
1069 old decl is an explicit typedef or if both the old
1070 and new decls are type decls. */
1071 || (TREE_CODE (oldlocal
) == TYPE_DECL
1072 && (!DECL_ARTIFICIAL (oldlocal
)
1073 || TREE_CODE (x
) == TYPE_DECL
)))
1074 /* Don't check for internally generated vars unless
1075 it's an implicit typedef (see create_implicit_typedef
1077 && (!DECL_ARTIFICIAL (x
) || DECL_IMPLICIT_TYPEDEF_P (x
)))
1079 bool nowarn
= false;
1081 /* Don't complain if it's from an enclosing function. */
1082 if (DECL_CONTEXT (oldlocal
) == current_function_decl
1083 && TREE_CODE (x
) != PARM_DECL
1084 && TREE_CODE (oldlocal
) == PARM_DECL
)
1086 /* Go to where the parms should be and see if we find
1088 cp_binding_level
*b
= current_binding_level
->level_chain
;
1090 if (FUNCTION_NEEDS_BODY_BLOCK (current_function_decl
))
1091 /* Skip the ctor/dtor cleanup level. */
1095 if (b
->kind
== sk_function_parms
)
1097 error ("declaration of %q#D shadows a parameter", x
);
1102 /* The local structure or class can't use parameters of
1103 the containing function anyway. */
1104 if (DECL_CONTEXT (oldlocal
) != current_function_decl
)
1106 cp_binding_level
*scope
= current_binding_level
;
1107 tree context
= DECL_CONTEXT (oldlocal
);
1108 for (; scope
; scope
= scope
->level_chain
)
1110 if (scope
->kind
== sk_function_parms
1111 && scope
->this_entity
== context
)
1113 if (scope
->kind
== sk_class
1114 && !LAMBDA_TYPE_P (scope
->this_entity
))
1121 /* Error if redeclaring a local declared in a
1122 for-init-statement or in the condition of an if or
1123 switch statement when the new declaration is in the
1124 outermost block of the controlled statement.
1125 Redeclaring a variable from a for or while condition is
1126 detected elsewhere. */
1127 else if (TREE_CODE (oldlocal
) == VAR_DECL
1128 && oldscope
== current_binding_level
->level_chain
1129 && (oldscope
->kind
== sk_cond
1130 || oldscope
->kind
== sk_for
))
1132 error ("redeclaration of %q#D", x
);
1133 error ("%q+#D previously declared here", oldlocal
);
1136 if (warn_shadow
&& !nowarn
)
1138 if (TREE_CODE (oldlocal
) == PARM_DECL
)
1139 warning_at (input_location
, OPT_Wshadow
,
1140 "declaration of %q#D shadows a parameter", x
);
1141 else if (is_capture_proxy (oldlocal
))
1142 warning_at (input_location
, OPT_Wshadow
,
1143 "declaration of %qD shadows a lambda capture",
1146 warning_at (input_location
, OPT_Wshadow
,
1147 "declaration of %qD shadows a previous local",
1149 warning_at (DECL_SOURCE_LOCATION (oldlocal
), OPT_Wshadow
,
1150 "shadowed declaration is here");
1154 /* Maybe warn if shadowing something else. */
1155 else if (warn_shadow
&& !DECL_EXTERNAL (x
)
1156 /* No shadow warnings for internally generated vars unless
1157 it's an implicit typedef (see create_implicit_typedef
1159 && (! DECL_ARTIFICIAL (x
) || DECL_IMPLICIT_TYPEDEF_P (x
))
1160 /* No shadow warnings for vars made for inlining. */
1161 && ! DECL_FROM_INLINE (x
))
1165 if (current_class_ptr
)
1166 member
= lookup_member (current_class_type
,
1169 /*want_type=*/false,
1170 tf_warning_or_error
);
1174 if (member
&& !TREE_STATIC (member
))
1176 /* Location of previous decl is not useful in this case. */
1177 warning (OPT_Wshadow
, "declaration of %qD shadows a member of 'this'",
1180 else if (oldglobal
!= NULL_TREE
1181 && (TREE_CODE (oldglobal
) == VAR_DECL
1182 /* If the old decl is a type decl, only warn if the
1183 old decl is an explicit typedef or if both the
1184 old and new decls are type decls. */
1185 || (TREE_CODE (oldglobal
) == TYPE_DECL
1186 && (!DECL_ARTIFICIAL (oldglobal
)
1187 || TREE_CODE (x
) == TYPE_DECL
))))
1188 /* XXX shadow warnings in outer-more namespaces */
1190 warning_at (input_location
, OPT_Wshadow
,
1191 "declaration of %qD shadows a global declaration", x
);
1192 warning_at (DECL_SOURCE_LOCATION (oldglobal
), OPT_Wshadow
,
1193 "shadowed declaration is here");
1198 if (TREE_CODE (x
) == VAR_DECL
)
1199 maybe_register_incomplete_var (x
);
1202 if (need_new_binding
)
1203 add_decl_to_level (x
,
1204 DECL_NAMESPACE_SCOPE_P (x
)
1205 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x
))
1206 : current_binding_level
);
1211 /* Wrapper for pushdecl_maybe_friend_1. */
1214 pushdecl_maybe_friend (tree x
, bool is_friend
)
1217 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
1218 ret
= pushdecl_maybe_friend_1 (x
, is_friend
);
1219 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
1223 /* Record a decl-node X as belonging to the current lexical scope. */
1228 return pushdecl_maybe_friend (x
, false);
1231 /* Enter DECL into the symbol table, if that's appropriate. Returns
1232 DECL, or a modified version thereof. */
1235 maybe_push_decl (tree decl
)
1237 tree type
= TREE_TYPE (decl
);
1239 /* Add this decl to the current binding level, but not if it comes
1240 from another scope, e.g. a static member variable. TEM may equal
1241 DECL or it may be a previous decl of the same name. */
1242 if (decl
== error_mark_node
1243 || (TREE_CODE (decl
) != PARM_DECL
1244 && DECL_CONTEXT (decl
) != NULL_TREE
1245 /* Definitions of namespace members outside their namespace are
1247 && !DECL_NAMESPACE_SCOPE_P (decl
))
1248 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
1249 || type
== unknown_type_node
1250 /* The declaration of a template specialization does not affect
1251 the functions available for overload resolution, so we do not
1253 || (TREE_CODE (decl
) == FUNCTION_DECL
1254 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
1257 return pushdecl (decl
);
1260 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1261 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1262 doesn't really belong to this binding level, that it got here
1263 through a using-declaration. */
1266 push_local_binding (tree id
, tree decl
, int flags
)
1268 cp_binding_level
*b
;
1270 /* Skip over any local classes. This makes sense if we call
1271 push_local_binding with a friend decl of a local class. */
1272 b
= innermost_nonclass_level ();
1274 if (lookup_name_innermost_nonclass_level (id
))
1276 /* Supplement the existing binding. */
1277 if (!supplement_binding (IDENTIFIER_BINDING (id
), decl
))
1278 /* It didn't work. Something else must be bound at this
1279 level. Do not add DECL to the list of things to pop
1284 /* Create a new binding. */
1285 push_binding (id
, decl
, b
);
1287 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
1288 /* We must put the OVERLOAD into a TREE_LIST since the
1289 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1290 decls that got here through a using-declaration. */
1291 decl
= build_tree_list (NULL_TREE
, decl
);
1293 /* And put DECL on the list of things declared by the current
1295 add_decl_to_level (decl
, b
);
1298 /* Check to see whether or not DECL is a variable that would have been
1299 in scope under the ARM, but is not in scope under the ANSI/ISO
1300 standard. If so, issue an error message. If name lookup would
1301 work in both cases, but return a different result, this function
1302 returns the result of ANSI/ISO lookup. Otherwise, it returns
1306 check_for_out_of_scope_variable (tree decl
)
1310 /* We only care about out of scope variables. */
1311 if (!(TREE_CODE (decl
) == VAR_DECL
&& DECL_DEAD_FOR_LOCAL (decl
)))
1314 shadowed
= DECL_HAS_SHADOWED_FOR_VAR_P (decl
)
1315 ? DECL_SHADOWED_FOR_VAR (decl
) : NULL_TREE
;
1316 while (shadowed
!= NULL_TREE
&& TREE_CODE (shadowed
) == VAR_DECL
1317 && DECL_DEAD_FOR_LOCAL (shadowed
))
1318 shadowed
= DECL_HAS_SHADOWED_FOR_VAR_P (shadowed
)
1319 ? DECL_SHADOWED_FOR_VAR (shadowed
) : NULL_TREE
;
1321 shadowed
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (decl
));
1324 if (!DECL_ERROR_REPORTED (decl
))
1326 warning (0, "name lookup of %qD changed", DECL_NAME (decl
));
1327 warning (0, " matches this %q+D under ISO standard rules",
1329 warning (0, " matches this %q+D under old rules", decl
);
1330 DECL_ERROR_REPORTED (decl
) = 1;
1335 /* If we have already complained about this declaration, there's no
1336 need to do it again. */
1337 if (DECL_ERROR_REPORTED (decl
))
1340 DECL_ERROR_REPORTED (decl
) = 1;
1342 if (TREE_TYPE (decl
) == error_mark_node
)
1345 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
1347 error ("name lookup of %qD changed for ISO %<for%> scoping",
1349 error (" cannot use obsolete binding at %q+D because "
1350 "it has a destructor", decl
);
1351 return error_mark_node
;
1355 permerror (input_location
, "name lookup of %qD changed for ISO %<for%> scoping",
1357 if (flag_permissive
)
1358 permerror (input_location
, " using obsolete binding at %q+D", decl
);
1364 inform (input_location
, "(if you use %<-fpermissive%> G++ will accept your code)");
1373 /* true means unconditionally make a BLOCK for the next level pushed. */
1375 static bool keep_next_level_flag
;
1377 static int binding_depth
= 0;
1384 for (i
= 0; i
< depth
* 2; i
++)
1388 /* Return a string describing the kind of SCOPE we have. */
1390 cp_binding_level_descriptor (cp_binding_level
*scope
)
1392 /* The order of this table must match the "scope_kind"
1394 static const char* scope_kind_names
[] = {
1400 "function-parameter-scope",
1403 "template-parameter-scope",
1404 "template-explicit-spec-scope"
1406 const scope_kind kind
= scope
->explicit_spec_p
1407 ? sk_template_spec
: scope
->kind
;
1409 return scope_kind_names
[kind
];
1412 /* Output a debugging information about SCOPE when performing
1415 cp_binding_level_debug (cp_binding_level
*scope
, int line
, const char *action
)
1417 const char *desc
= cp_binding_level_descriptor (scope
);
1418 if (scope
->this_entity
)
1419 verbatim ("%s %s(%E) %p %d\n", action
, desc
,
1420 scope
->this_entity
, (void *) scope
, line
);
1422 verbatim ("%s %s %p %d\n", action
, desc
, (void *) scope
, line
);
1425 /* Return the estimated initial size of the hashtable of a NAMESPACE
1428 static inline size_t
1429 namespace_scope_ht_size (tree ns
)
1431 tree name
= DECL_NAME (ns
);
1433 return name
== std_identifier
1434 ? NAMESPACE_STD_HT_SIZE
1435 : (name
== global_scope_name
1436 ? GLOBAL_SCOPE_HT_SIZE
1437 : NAMESPACE_ORDINARY_HT_SIZE
);
1440 /* A chain of binding_level structures awaiting reuse. */
1442 static GTY((deletable
)) cp_binding_level
*free_binding_level
;
1444 /* Insert SCOPE as the innermost binding level. */
1447 push_binding_level (cp_binding_level
*scope
)
1449 /* Add it to the front of currently active scopes stack. */
1450 scope
->level_chain
= current_binding_level
;
1451 current_binding_level
= scope
;
1452 keep_next_level_flag
= false;
1454 if (ENABLE_SCOPE_CHECKING
)
1456 scope
->binding_depth
= binding_depth
;
1457 indent (binding_depth
);
1458 cp_binding_level_debug (scope
, input_line
, "push");
1463 /* Create a new KIND scope and make it the top of the active scopes stack.
1464 ENTITY is the scope of the associated C++ entity (namespace, class,
1465 function, C++0x enumeration); it is NULL otherwise. */
1468 begin_scope (scope_kind kind
, tree entity
)
1470 cp_binding_level
*scope
;
1472 /* Reuse or create a struct for this binding level. */
1473 if (!ENABLE_SCOPE_CHECKING
&& free_binding_level
)
1475 scope
= free_binding_level
;
1476 memset (scope
, 0, sizeof (cp_binding_level
));
1477 free_binding_level
= scope
->level_chain
;
1480 scope
= ggc_alloc_cleared_cp_binding_level ();
1482 scope
->this_entity
= entity
;
1483 scope
->more_cleanups_ok
= true;
1490 case sk_template_spec
:
1491 scope
->explicit_spec_p
= true;
1492 kind
= sk_template_parms
;
1494 case sk_template_parms
:
1501 case sk_scoped_enum
:
1502 case sk_function_parms
:
1504 scope
->keep
= keep_next_level_flag
;
1508 NAMESPACE_LEVEL (entity
) = scope
;
1509 vec_alloc (scope
->static_decls
,
1510 (DECL_NAME (entity
) == std_identifier
1511 || DECL_NAME (entity
) == global_scope_name
) ? 200 : 10);
1515 /* Should not happen. */
1521 push_binding_level (scope
);
1526 /* We're about to leave current scope. Pop the top of the stack of
1527 currently active scopes. Return the enclosing scope, now active. */
1532 cp_binding_level
*scope
= current_binding_level
;
1534 if (scope
->kind
== sk_namespace
&& class_binding_level
)
1535 current_binding_level
= class_binding_level
;
1537 /* We cannot leave a scope, if there are none left. */
1538 if (NAMESPACE_LEVEL (global_namespace
))
1539 gcc_assert (!global_scope_p (scope
));
1541 if (ENABLE_SCOPE_CHECKING
)
1543 indent (--binding_depth
);
1544 cp_binding_level_debug (scope
, input_line
, "leave");
1547 /* Move one nesting level up. */
1548 current_binding_level
= scope
->level_chain
;
1550 /* Namespace-scopes are left most probably temporarily, not
1551 completely; they can be reopened later, e.g. in namespace-extension
1552 or any name binding activity that requires us to resume a
1553 namespace. For classes, we cache some binding levels. For other
1554 scopes, we just make the structure available for reuse. */
1555 if (scope
->kind
!= sk_namespace
1556 && scope
->kind
!= sk_class
)
1558 scope
->level_chain
= free_binding_level
;
1559 gcc_assert (!ENABLE_SCOPE_CHECKING
1560 || scope
->binding_depth
== binding_depth
);
1561 free_binding_level
= scope
;
1564 /* Find the innermost enclosing class scope, and reset
1565 CLASS_BINDING_LEVEL appropriately. */
1566 if (scope
->kind
== sk_class
)
1568 class_binding_level
= NULL
;
1569 for (scope
= current_binding_level
; scope
; scope
= scope
->level_chain
)
1570 if (scope
->kind
== sk_class
)
1572 class_binding_level
= scope
;
1577 return current_binding_level
;
1581 resume_scope (cp_binding_level
* b
)
1583 /* Resuming binding levels is meant only for namespaces,
1584 and those cannot nest into classes. */
1585 gcc_assert (!class_binding_level
);
1586 /* Also, resuming a non-directly nested namespace is a no-no. */
1587 gcc_assert (b
->level_chain
== current_binding_level
);
1588 current_binding_level
= b
;
1589 if (ENABLE_SCOPE_CHECKING
)
1591 b
->binding_depth
= binding_depth
;
1592 indent (binding_depth
);
1593 cp_binding_level_debug (b
, input_line
, "resume");
1598 /* Return the innermost binding level that is not for a class scope. */
1600 static cp_binding_level
*
1601 innermost_nonclass_level (void)
1603 cp_binding_level
*b
;
1605 b
= current_binding_level
;
1606 while (b
->kind
== sk_class
)
1612 /* We're defining an object of type TYPE. If it needs a cleanup, but
1613 we're not allowed to add any more objects with cleanups to the current
1614 scope, create a new binding level. */
1617 maybe_push_cleanup_level (tree type
)
1619 if (type
!= error_mark_node
1620 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
1621 && current_binding_level
->more_cleanups_ok
== 0)
1623 begin_scope (sk_cleanup
, NULL
);
1624 current_binding_level
->statement_list
= push_stmt_list ();
1628 /* Return true if we are in the global binding level. */
1631 global_bindings_p (void)
1633 return global_scope_p (current_binding_level
);
1636 /* True if we are currently in a toplevel binding level. This
1637 means either the global binding level or a namespace in a toplevel
1638 binding level. Since there are no non-toplevel namespace levels,
1639 this really means any namespace or template parameter level. We
1640 also include a class whose context is toplevel. */
1643 toplevel_bindings_p (void)
1645 cp_binding_level
*b
= innermost_nonclass_level ();
1647 return b
->kind
== sk_namespace
|| b
->kind
== sk_template_parms
;
1650 /* True if this is a namespace scope, or if we are defining a class
1651 which is itself at namespace scope, or whose enclosing class is
1652 such a class, etc. */
1655 namespace_bindings_p (void)
1657 cp_binding_level
*b
= innermost_nonclass_level ();
1659 return b
->kind
== sk_namespace
;
1662 /* True if the innermost non-class scope is a block scope. */
1665 local_bindings_p (void)
1667 cp_binding_level
*b
= innermost_nonclass_level ();
1668 return b
->kind
< sk_function_parms
|| b
->kind
== sk_omp
;
1671 /* True if the current level needs to have a BLOCK made. */
1676 return (current_binding_level
->blocks
!= NULL_TREE
1677 || current_binding_level
->keep
1678 || current_binding_level
->kind
== sk_cleanup
1679 || current_binding_level
->names
!= NULL_TREE
1680 || current_binding_level
->using_directives
);
1683 /* Returns the kind of the innermost scope. */
1686 innermost_scope_kind (void)
1688 return current_binding_level
->kind
;
1691 /* Returns true if this scope was created to store template parameters. */
1694 template_parm_scope_p (void)
1696 return innermost_scope_kind () == sk_template_parms
;
1699 /* If KEEP is true, make a BLOCK node for the next binding level,
1700 unconditionally. Otherwise, use the normal logic to decide whether
1701 or not to create a BLOCK. */
1704 keep_next_level (bool keep
)
1706 keep_next_level_flag
= keep
;
1709 /* Return the list of declarations of the current level.
1710 Note that this list is in reverse order unless/until
1711 you nreverse it; and when you do nreverse it, you must
1712 store the result back using `storedecls' or you will lose. */
1717 return current_binding_level
->names
;
1720 /* Return how many function prototypes we are currently nested inside. */
1723 function_parm_depth (void)
1726 cp_binding_level
*b
;
1728 for (b
= current_binding_level
;
1729 b
->kind
== sk_function_parms
;
1736 /* For debugging. */
1737 static int no_print_functions
= 0;
1738 static int no_print_builtins
= 0;
1741 print_binding_level (cp_binding_level
* lvl
)
1745 fprintf (stderr
, " blocks=%p", (void *) lvl
->blocks
);
1746 if (lvl
->more_cleanups_ok
)
1747 fprintf (stderr
, " more-cleanups-ok");
1748 if (lvl
->have_cleanups
)
1749 fprintf (stderr
, " have-cleanups");
1750 fprintf (stderr
, "\n");
1753 fprintf (stderr
, " names:\t");
1754 /* We can probably fit 3 names to a line? */
1755 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
1757 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
1759 if (no_print_builtins
1760 && (TREE_CODE (t
) == TYPE_DECL
)
1761 && DECL_IS_BUILTIN (t
))
1764 /* Function decls tend to have longer names. */
1765 if (TREE_CODE (t
) == FUNCTION_DECL
)
1772 fprintf (stderr
, "\n\t");
1775 print_node_brief (stderr
, "", t
, 0);
1776 if (t
== error_mark_node
)
1780 fprintf (stderr
, "\n");
1782 if (vec_safe_length (lvl
->class_shadowed
))
1785 cp_class_binding
*b
;
1786 fprintf (stderr
, " class-shadowed:");
1787 FOR_EACH_VEC_ELT (*lvl
->class_shadowed
, i
, b
)
1788 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (b
->identifier
));
1789 fprintf (stderr
, "\n");
1791 if (lvl
->type_shadowed
)
1793 fprintf (stderr
, " type-shadowed:");
1794 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
1796 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1798 fprintf (stderr
, "\n");
1803 print_other_binding_stack (cp_binding_level
*stack
)
1805 cp_binding_level
*level
;
1806 for (level
= stack
; !global_scope_p (level
); level
= level
->level_chain
)
1808 fprintf (stderr
, "binding level %p\n", (void *) level
);
1809 print_binding_level (level
);
1814 print_binding_stack (void)
1816 cp_binding_level
*b
;
1817 fprintf (stderr
, "current_binding_level=%p\n"
1818 "class_binding_level=%p\n"
1819 "NAMESPACE_LEVEL (global_namespace)=%p\n",
1820 (void *) current_binding_level
, (void *) class_binding_level
,
1821 (void *) NAMESPACE_LEVEL (global_namespace
));
1822 if (class_binding_level
)
1824 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
1825 if (b
== current_binding_level
)
1828 b
= class_binding_level
;
1830 b
= current_binding_level
;
1833 b
= current_binding_level
;
1834 print_other_binding_stack (b
);
1835 fprintf (stderr
, "global:\n");
1836 print_binding_level (NAMESPACE_LEVEL (global_namespace
));
1839 /* Return the type associated with ID. */
1842 identifier_type_value_1 (tree id
)
1844 /* There is no type with that name, anywhere. */
1845 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
1847 /* This is not the type marker, but the real thing. */
1848 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
1849 return REAL_IDENTIFIER_TYPE_VALUE (id
);
1850 /* Have to search for it. It must be on the global level, now.
1851 Ask lookup_name not to return non-types. */
1852 id
= lookup_name_real (id
, 2, 1, /*block_p=*/true, 0, 0);
1854 return TREE_TYPE (id
);
1858 /* Wrapper for identifier_type_value_1. */
1861 identifier_type_value (tree id
)
1864 timevar_start (TV_NAME_LOOKUP
);
1865 ret
= identifier_type_value_1 (id
);
1866 timevar_stop (TV_NAME_LOOKUP
);
1871 /* Return the IDENTIFIER_GLOBAL_VALUE of T, for use in common code, since
1872 the definition of IDENTIFIER_GLOBAL_VALUE is different for C and C++. */
1875 identifier_global_value (tree t
)
1877 return IDENTIFIER_GLOBAL_VALUE (t
);
1880 /* Push a definition of struct, union or enum tag named ID. into
1881 binding_level B. DECL is a TYPE_DECL for the type. We assume that
1882 the tag ID is not already defined. */
1885 set_identifier_type_value_with_scope (tree id
, tree decl
, cp_binding_level
*b
)
1889 if (b
->kind
!= sk_namespace
)
1891 /* Shadow the marker, not the real thing, so that the marker
1892 gets restored later. */
1893 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
1895 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
1896 type
= decl
? TREE_TYPE (decl
) : NULL_TREE
;
1897 TREE_TYPE (b
->type_shadowed
) = type
;
1901 cxx_binding
*binding
=
1902 binding_for_name (NAMESPACE_LEVEL (current_namespace
), id
);
1905 supplement_binding (binding
, decl
);
1907 binding
->value
= decl
;
1909 /* Store marker instead of real type. */
1910 type
= global_type_node
;
1912 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
1915 /* As set_identifier_type_value_with_scope, but using
1916 current_binding_level. */
1919 set_identifier_type_value (tree id
, tree decl
)
1921 set_identifier_type_value_with_scope (id
, decl
, current_binding_level
);
1924 /* Return the name for the constructor (or destructor) for the
1925 specified class TYPE. When given a template, this routine doesn't
1926 lose the specialization. */
1929 constructor_name_full (tree type
)
1931 return TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
1934 /* Return the name for the constructor (or destructor) for the
1935 specified class. When given a template, return the plain
1936 unspecialized name. */
1939 constructor_name (tree type
)
1942 name
= constructor_name_full (type
);
1943 if (IDENTIFIER_TEMPLATE (name
))
1944 name
= IDENTIFIER_TEMPLATE (name
);
1948 /* Returns TRUE if NAME is the name for the constructor for TYPE,
1949 which must be a class type. */
1952 constructor_name_p (tree name
, tree type
)
1956 gcc_assert (MAYBE_CLASS_TYPE_P (type
));
1961 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
1964 /* These don't have names. */
1965 if (TREE_CODE (type
) == DECLTYPE_TYPE
1966 || TREE_CODE (type
) == TYPEOF_TYPE
)
1969 ctor_name
= constructor_name_full (type
);
1970 if (name
== ctor_name
)
1972 if (IDENTIFIER_TEMPLATE (ctor_name
)
1973 && name
== IDENTIFIER_TEMPLATE (ctor_name
))
1978 /* Counter used to create anonymous type names. */
1980 static GTY(()) int anon_cnt
;
1982 /* Return an IDENTIFIER which can be used as a name for
1983 anonymous structs and unions. */
1986 make_anon_name (void)
1990 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
1991 return get_identifier (buf
);
1994 /* This code is practically identical to that for creating
1995 anonymous names, but is just used for lambdas instead. This isn't really
1996 necessary, but it's convenient to avoid treating lambdas like other
1999 static GTY(()) int lambda_cnt
= 0;
2002 make_lambda_name (void)
2006 sprintf (buf
, LAMBDANAME_FORMAT
, lambda_cnt
++);
2007 return get_identifier (buf
);
2010 /* Return (from the stack of) the BINDING, if any, established at SCOPE. */
2012 static inline cxx_binding
*
2013 find_binding (cp_binding_level
*scope
, cxx_binding
*binding
)
2015 for (; binding
!= NULL
; binding
= binding
->previous
)
2016 if (binding
->scope
== scope
)
2019 return (cxx_binding
*)0;
2022 /* Return the binding for NAME in SCOPE, if any. Otherwise, return NULL. */
2024 static inline cxx_binding
*
2025 cp_binding_level_find_binding_for_name (cp_binding_level
*scope
, tree name
)
2027 cxx_binding
*b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2030 /* Fold-in case where NAME is used only once. */
2031 if (scope
== b
->scope
&& b
->previous
== NULL
)
2033 return find_binding (scope
, b
);
2038 /* Always returns a binding for name in scope. If no binding is
2039 found, make a new one. */
2041 static cxx_binding
*
2042 binding_for_name (cp_binding_level
*scope
, tree name
)
2044 cxx_binding
*result
;
2046 result
= cp_binding_level_find_binding_for_name (scope
, name
);
2049 /* Not found, make a new one. */
2050 result
= cxx_binding_make (NULL
, NULL
);
2051 result
->previous
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2052 result
->scope
= scope
;
2053 result
->is_local
= false;
2054 result
->value_is_inherited
= false;
2055 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2059 /* Walk through the bindings associated to the name of FUNCTION,
2060 and return the first declaration of a function with a
2061 "C" linkage specification, a.k.a 'extern "C"'.
2062 This function looks for the binding, regardless of which scope it
2063 has been defined in. It basically looks in all the known scopes.
2064 Note that this function does not lookup for bindings of builtin functions
2065 or for functions declared in system headers. */
2067 lookup_extern_c_fun_in_all_ns (tree function
)
2072 gcc_assert (function
&& TREE_CODE (function
) == FUNCTION_DECL
);
2074 name
= DECL_NAME (function
);
2075 gcc_assert (name
&& TREE_CODE (name
) == IDENTIFIER_NODE
);
2077 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2079 iter
= iter
->previous
)
2082 for (ovl
= iter
->value
; ovl
; ovl
= OVL_NEXT (ovl
))
2084 tree decl
= OVL_CURRENT (ovl
);
2086 && TREE_CODE (decl
) == FUNCTION_DECL
2087 && DECL_EXTERN_C_P (decl
)
2088 && !DECL_ARTIFICIAL (decl
))
2097 /* Returns a list of C-linkage decls with the name NAME. */
2100 c_linkage_bindings (tree name
)
2102 tree decls
= NULL_TREE
;
2105 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2107 iter
= iter
->previous
)
2110 for (ovl
= iter
->value
; ovl
; ovl
= OVL_NEXT (ovl
))
2112 tree decl
= OVL_CURRENT (ovl
);
2114 && DECL_EXTERN_C_P (decl
)
2115 && !DECL_ARTIFICIAL (decl
))
2117 if (decls
== NULL_TREE
)
2120 decls
= tree_cons (NULL_TREE
, decl
, decls
);
2127 /* Insert another USING_DECL into the current binding level, returning
2128 this declaration. If this is a redeclaration, do nothing, and
2129 return NULL_TREE if this not in namespace scope (in namespace
2130 scope, a using decl might extend any previous bindings). */
2133 push_using_decl_1 (tree scope
, tree name
)
2137 gcc_assert (TREE_CODE (scope
) == NAMESPACE_DECL
);
2138 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
);
2139 for (decl
= current_binding_level
->usings
; decl
; decl
= DECL_CHAIN (decl
))
2140 if (USING_DECL_SCOPE (decl
) == scope
&& DECL_NAME (decl
) == name
)
2143 return namespace_bindings_p () ? decl
: NULL_TREE
;
2144 decl
= build_lang_decl (USING_DECL
, name
, NULL_TREE
);
2145 USING_DECL_SCOPE (decl
) = scope
;
2146 DECL_CHAIN (decl
) = current_binding_level
->usings
;
2147 current_binding_level
->usings
= decl
;
2151 /* Wrapper for push_using_decl_1. */
2154 push_using_decl (tree scope
, tree name
)
2157 timevar_start (TV_NAME_LOOKUP
);
2158 ret
= push_using_decl_1 (scope
, name
);
2159 timevar_stop (TV_NAME_LOOKUP
);
2163 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
2164 caller to set DECL_CONTEXT properly.
2166 Note that this must only be used when X will be the new innermost
2167 binding for its name, as we tack it onto the front of IDENTIFIER_BINDING
2168 without checking to see if the current IDENTIFIER_BINDING comes from a
2169 closer binding level than LEVEL. */
2172 pushdecl_with_scope_1 (tree x
, cp_binding_level
*level
, bool is_friend
)
2174 cp_binding_level
*b
;
2175 tree function_decl
= current_function_decl
;
2177 current_function_decl
= NULL_TREE
;
2178 if (level
->kind
== sk_class
)
2180 b
= class_binding_level
;
2181 class_binding_level
= level
;
2182 pushdecl_class_level (x
);
2183 class_binding_level
= b
;
2187 b
= current_binding_level
;
2188 current_binding_level
= level
;
2189 x
= pushdecl_maybe_friend (x
, is_friend
);
2190 current_binding_level
= b
;
2192 current_function_decl
= function_decl
;
2196 /* Wrapper for pushdecl_with_scope_1. */
2199 pushdecl_with_scope (tree x
, cp_binding_level
*level
, bool is_friend
)
2202 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
2203 ret
= pushdecl_with_scope_1 (x
, level
, is_friend
);
2204 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
2209 /* DECL is a FUNCTION_DECL for a non-member function, which may have
2210 other definitions already in place. We get around this by making
2211 the value of the identifier point to a list of all the things that
2212 want to be referenced by that name. It is then up to the users of
2213 that name to decide what to do with that list.
2215 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
2216 DECL_TEMPLATE_RESULT. It is dealt with the same way.
2218 FLAGS is a bitwise-or of the following values:
2219 PUSH_LOCAL: Bind DECL in the current scope, rather than at
2221 PUSH_USING: DECL is being pushed as the result of a using
2224 IS_FRIEND is true if this is a friend declaration.
2226 The value returned may be a previous declaration if we guessed wrong
2227 about what language DECL should belong to (C or C++). Otherwise,
2228 it's always DECL (and never something that's not a _DECL). */
2231 push_overloaded_decl_1 (tree decl
, int flags
, bool is_friend
)
2233 tree name
= DECL_NAME (decl
);
2236 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
2239 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
2241 old
= lookup_name_innermost_nonclass_level (name
);
2245 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
2247 tree t
= TREE_TYPE (old
);
2248 if (MAYBE_CLASS_TYPE_P (t
) && warn_shadow
2249 && (! DECL_IN_SYSTEM_HEADER (decl
)
2250 || ! DECL_IN_SYSTEM_HEADER (old
)))
2251 warning (OPT_Wshadow
, "%q#D hides constructor for %q#T", decl
, t
);
2254 else if (is_overloaded_fn (old
))
2258 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
2260 tree fn
= OVL_CURRENT (tmp
);
2263 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
2264 && !(flags
& PUSH_USING
)
2265 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
2266 TYPE_ARG_TYPES (TREE_TYPE (decl
)))
2267 && ! decls_match (fn
, decl
))
2268 error ("%q#D conflicts with previous using declaration %q#D",
2271 dup
= duplicate_decls (decl
, fn
, is_friend
);
2272 /* If DECL was a redeclaration of FN -- even an invalid
2273 one -- pass that information along to our caller. */
2274 if (dup
== fn
|| dup
== error_mark_node
)
2278 /* We don't overload implicit built-ins. duplicate_decls()
2279 may fail to merge the decls if the new decl is e.g. a
2280 template function. */
2281 if (TREE_CODE (old
) == FUNCTION_DECL
2282 && DECL_ANTICIPATED (old
)
2283 && !DECL_HIDDEN_FRIEND_P (old
))
2286 else if (old
== error_mark_node
)
2287 /* Ignore the undefined symbol marker. */
2291 error ("previous non-function declaration %q+#D", old
);
2292 error ("conflicts with function declaration %q#D", decl
);
2297 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
2298 /* If it's a using declaration, we always need to build an OVERLOAD,
2299 because it's the only way to remember that the declaration comes
2300 from 'using', and have the lookup behave correctly. */
2301 || (flags
& PUSH_USING
))
2303 if (old
&& TREE_CODE (old
) != OVERLOAD
)
2304 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
2306 new_binding
= ovl_cons (decl
, old
);
2307 if (flags
& PUSH_USING
)
2308 OVL_USED (new_binding
) = 1;
2311 /* NAME is not ambiguous. */
2315 set_namespace_binding (name
, current_namespace
, new_binding
);
2318 /* We only create an OVERLOAD if there was a previous binding at
2319 this level, or if decl is a template. In the former case, we
2320 need to remove the old binding and replace it with the new
2321 binding. We must also run through the NAMES on the binding
2322 level where the name was bound to update the chain. */
2324 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
2328 for (d
= &IDENTIFIER_BINDING (name
)->scope
->names
;
2330 d
= &TREE_CHAIN (*d
))
2332 || (TREE_CODE (*d
) == TREE_LIST
2333 && TREE_VALUE (*d
) == old
))
2335 if (TREE_CODE (*d
) == TREE_LIST
)
2336 /* Just replace the old binding with the new. */
2337 TREE_VALUE (*d
) = new_binding
;
2339 /* Build a TREE_LIST to wrap the OVERLOAD. */
2340 *d
= tree_cons (NULL_TREE
, new_binding
,
2343 /* And update the cxx_binding node. */
2344 IDENTIFIER_BINDING (name
)->value
= new_binding
;
2348 /* We should always find a previous binding in this case. */
2352 /* Install the new binding. */
2353 push_local_binding (name
, new_binding
, flags
);
2359 /* Wrapper for push_overloaded_decl_1. */
2362 push_overloaded_decl (tree decl
, int flags
, bool is_friend
)
2365 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
2366 ret
= push_overloaded_decl_1 (decl
, flags
, is_friend
);
2367 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
2371 /* Check a non-member using-declaration. Return the name and scope
2372 being used, and the USING_DECL, or NULL_TREE on failure. */
2375 validate_nonmember_using_decl (tree decl
, tree scope
, tree name
)
2377 /* [namespace.udecl]
2378 A using-declaration for a class member shall be a
2379 member-declaration. */
2382 error ("%qT is not a namespace", scope
);
2385 else if (scope
== error_mark_node
)
2388 if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
)
2391 A using-declaration shall not name a template-id. */
2392 error ("a using-declaration cannot specify a template-id. "
2393 "Try %<using %D%>", name
);
2397 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
2399 error ("namespace %qD not allowed in using-declaration", decl
);
2403 if (TREE_CODE (decl
) == SCOPE_REF
)
2405 /* It's a nested name with template parameter dependent scope.
2406 This can only be using-declaration for class member. */
2407 error ("%qT is not a namespace", TREE_OPERAND (decl
, 0));
2411 if (is_overloaded_fn (decl
))
2412 decl
= get_first_fn (decl
);
2414 gcc_assert (DECL_P (decl
));
2416 /* Make a USING_DECL. */
2417 tree using_decl
= push_using_decl (scope
, name
);
2419 if (using_decl
== NULL_TREE
2420 && at_function_scope_p ()
2421 && TREE_CODE (decl
) == VAR_DECL
)
2422 /* C++11 7.3.3/10. */
2423 error ("%qD is already declared in this scope", name
);
2428 /* Process local and global using-declarations. */
2431 do_nonmember_using_decl (tree scope
, tree name
, tree oldval
, tree oldtype
,
2432 tree
*newval
, tree
*newtype
)
2434 struct scope_binding decls
= EMPTY_SCOPE_BINDING
;
2436 *newval
= *newtype
= NULL_TREE
;
2437 if (!qualified_lookup_using_namespace (name
, scope
, &decls
, 0))
2441 if (!decls
.value
&& !decls
.type
)
2443 error ("%qD not declared", name
);
2447 /* Shift the old and new bindings around so we're comparing class and
2448 enumeration names to each other. */
2449 if (oldval
&& DECL_IMPLICIT_TYPEDEF_P (oldval
))
2455 if (decls
.value
&& DECL_IMPLICIT_TYPEDEF_P (decls
.value
))
2457 decls
.type
= decls
.value
;
2458 decls
.value
= NULL_TREE
;
2461 /* It is impossible to overload a built-in function; any explicit
2462 declaration eliminates the built-in declaration. So, if OLDVAL
2463 is a built-in, then we can just pretend it isn't there. */
2465 && TREE_CODE (oldval
) == FUNCTION_DECL
2466 && DECL_ANTICIPATED (oldval
)
2467 && !DECL_HIDDEN_FRIEND_P (oldval
))
2472 /* Check for using functions. */
2473 if (is_overloaded_fn (decls
.value
))
2477 if (oldval
&& !is_overloaded_fn (oldval
))
2479 error ("%qD is already declared in this scope", name
);
2484 for (tmp
= decls
.value
; tmp
; tmp
= OVL_NEXT (tmp
))
2486 tree new_fn
= OVL_CURRENT (tmp
);
2488 /* [namespace.udecl]
2490 If a function declaration in namespace scope or block
2491 scope has the same name and the same parameter types as a
2492 function introduced by a using declaration the program is
2494 for (tmp1
= oldval
; tmp1
; tmp1
= OVL_NEXT (tmp1
))
2496 tree old_fn
= OVL_CURRENT (tmp1
);
2498 if (new_fn
== old_fn
)
2499 /* The function already exists in the current namespace. */
2501 else if (OVL_USED (tmp1
))
2502 continue; /* this is a using decl */
2503 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (new_fn
)),
2504 TYPE_ARG_TYPES (TREE_TYPE (old_fn
))))
2506 gcc_assert (!DECL_ANTICIPATED (old_fn
)
2507 || DECL_HIDDEN_FRIEND_P (old_fn
));
2509 /* There was already a non-using declaration in
2510 this scope with the same parameter types. If both
2511 are the same extern "C" functions, that's ok. */
2512 if (decls_match (new_fn
, old_fn
))
2516 error ("%qD is already declared in this scope", name
);
2522 /* If we broke out of the loop, there's no reason to add
2523 this function to the using declarations for this
2528 /* If we are adding to an existing OVERLOAD, then we no
2529 longer know the type of the set of functions. */
2530 if (*newval
&& TREE_CODE (*newval
) == OVERLOAD
)
2531 TREE_TYPE (*newval
) = unknown_type_node
;
2532 /* Add this new function to the set. */
2533 *newval
= build_overload (OVL_CURRENT (tmp
), *newval
);
2534 /* If there is only one function, then we use its type. (A
2535 using-declaration naming a single function can be used in
2536 contexts where overload resolution cannot be
2538 if (TREE_CODE (*newval
) != OVERLOAD
)
2540 *newval
= ovl_cons (*newval
, NULL_TREE
);
2541 TREE_TYPE (*newval
) = TREE_TYPE (OVL_CURRENT (tmp
));
2543 OVL_USED (*newval
) = 1;
2548 *newval
= decls
.value
;
2549 if (oldval
&& !decls_match (*newval
, oldval
))
2550 error ("%qD is already declared in this scope", name
);
2556 if (decls
.type
&& TREE_CODE (decls
.type
) == TREE_LIST
)
2558 error ("reference to %qD is ambiguous", name
);
2559 print_candidates (decls
.type
);
2563 *newtype
= decls
.type
;
2564 if (oldtype
&& *newtype
&& !decls_match (oldtype
, *newtype
))
2565 error ("%qD is already declared in this scope", name
);
2568 /* If *newval is empty, shift any class or enumeration name down. */
2572 *newtype
= NULL_TREE
;
2576 /* Process a using-declaration at function scope. */
2579 do_local_using_decl (tree decl
, tree scope
, tree name
)
2581 tree oldval
, oldtype
, newval
, newtype
;
2582 tree orig_decl
= decl
;
2584 decl
= validate_nonmember_using_decl (decl
, scope
, name
);
2585 if (decl
== NULL_TREE
)
2588 if (building_stmt_list_p ()
2589 && at_function_scope_p ())
2590 add_decl_expr (decl
);
2592 oldval
= lookup_name_innermost_nonclass_level (name
);
2593 oldtype
= lookup_type_current_level (name
);
2595 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, &newval
, &newtype
);
2599 if (is_overloaded_fn (newval
))
2603 /* We only need to push declarations for those functions
2604 that were not already bound in the current level.
2605 The old value might be NULL_TREE, it might be a single
2606 function, or an OVERLOAD. */
2607 if (oldval
&& TREE_CODE (oldval
) == OVERLOAD
)
2608 term
= OVL_FUNCTION (oldval
);
2611 for (fn
= newval
; fn
&& OVL_CURRENT (fn
) != term
;
2613 push_overloaded_decl (OVL_CURRENT (fn
),
2614 PUSH_LOCAL
| PUSH_USING
,
2618 push_local_binding (name
, newval
, PUSH_USING
);
2622 push_local_binding (name
, newtype
, PUSH_USING
);
2623 set_identifier_type_value (name
, newtype
);
2626 /* Emit debug info. */
2627 if (!processing_template_decl
)
2628 cp_emit_debug_info_for_using (orig_decl
, current_scope());
2631 /* Returns true if ROOT (a namespace, class, or function) encloses
2632 CHILD. CHILD may be either a class type or a namespace. */
2635 is_ancestor (tree root
, tree child
)
2637 gcc_assert ((TREE_CODE (root
) == NAMESPACE_DECL
2638 || TREE_CODE (root
) == FUNCTION_DECL
2639 || CLASS_TYPE_P (root
)));
2640 gcc_assert ((TREE_CODE (child
) == NAMESPACE_DECL
2641 || CLASS_TYPE_P (child
)));
2643 /* The global namespace encloses everything. */
2644 if (root
== global_namespace
)
2649 /* If we've run out of scopes, stop. */
2652 /* If we've reached the ROOT, it encloses CHILD. */
2655 /* Go out one level. */
2657 child
= TYPE_NAME (child
);
2658 child
= DECL_CONTEXT (child
);
2662 /* Enter the class or namespace scope indicated by T suitable for name
2663 lookup. T can be arbitrary scope, not necessary nested inside the
2664 current scope. Returns a non-null scope to pop iff pop_scope
2665 should be called later to exit this scope. */
2670 if (TREE_CODE (t
) == NAMESPACE_DECL
)
2671 push_decl_namespace (t
);
2672 else if (CLASS_TYPE_P (t
))
2674 if (!at_class_scope_p ()
2675 || !same_type_p (current_class_type
, t
))
2676 push_nested_class (t
);
2678 /* T is the same as the current scope. There is therefore no
2679 need to re-enter the scope. Since we are not actually
2680 pushing a new scope, our caller should not call
2688 /* Leave scope pushed by push_scope. */
2695 if (TREE_CODE (t
) == NAMESPACE_DECL
)
2696 pop_decl_namespace ();
2697 else if CLASS_TYPE_P (t
)
2698 pop_nested_class ();
2701 /* Subroutine of push_inner_scope. */
2704 push_inner_scope_r (tree outer
, tree inner
)
2709 || (TREE_CODE (inner
) != NAMESPACE_DECL
&& !CLASS_TYPE_P (inner
)))
2712 prev
= CP_DECL_CONTEXT (TREE_CODE (inner
) == NAMESPACE_DECL
? inner
: TYPE_NAME (inner
));
2714 push_inner_scope_r (outer
, prev
);
2715 if (TREE_CODE (inner
) == NAMESPACE_DECL
)
2717 cp_binding_level
*save_template_parm
= 0;
2718 /* Temporary take out template parameter scopes. They are saved
2719 in reversed order in save_template_parm. */
2720 while (current_binding_level
->kind
== sk_template_parms
)
2722 cp_binding_level
*b
= current_binding_level
;
2723 current_binding_level
= b
->level_chain
;
2724 b
->level_chain
= save_template_parm
;
2725 save_template_parm
= b
;
2728 resume_scope (NAMESPACE_LEVEL (inner
));
2729 current_namespace
= inner
;
2731 /* Restore template parameter scopes. */
2732 while (save_template_parm
)
2734 cp_binding_level
*b
= save_template_parm
;
2735 save_template_parm
= b
->level_chain
;
2736 b
->level_chain
= current_binding_level
;
2737 current_binding_level
= b
;
2744 /* Enter the scope INNER from current scope. INNER must be a scope
2745 nested inside current scope. This works with both name lookup and
2746 pushing name into scope. In case a template parameter scope is present,
2747 namespace is pushed under the template parameter scope according to
2748 name lookup rule in 14.6.1/6.
2750 Return the former current scope suitable for pop_inner_scope. */
2753 push_inner_scope (tree inner
)
2755 tree outer
= current_scope ();
2757 outer
= current_namespace
;
2759 push_inner_scope_r (outer
, inner
);
2763 /* Exit the current scope INNER back to scope OUTER. */
2766 pop_inner_scope (tree outer
, tree inner
)
2769 || (TREE_CODE (inner
) != NAMESPACE_DECL
&& !CLASS_TYPE_P (inner
)))
2772 while (outer
!= inner
)
2774 if (TREE_CODE (inner
) == NAMESPACE_DECL
)
2776 cp_binding_level
*save_template_parm
= 0;
2777 /* Temporary take out template parameter scopes. They are saved
2778 in reversed order in save_template_parm. */
2779 while (current_binding_level
->kind
== sk_template_parms
)
2781 cp_binding_level
*b
= current_binding_level
;
2782 current_binding_level
= b
->level_chain
;
2783 b
->level_chain
= save_template_parm
;
2784 save_template_parm
= b
;
2789 /* Restore template parameter scopes. */
2790 while (save_template_parm
)
2792 cp_binding_level
*b
= save_template_parm
;
2793 save_template_parm
= b
->level_chain
;
2794 b
->level_chain
= current_binding_level
;
2795 current_binding_level
= b
;
2801 inner
= CP_DECL_CONTEXT (TREE_CODE (inner
) == NAMESPACE_DECL
? inner
: TYPE_NAME (inner
));
2805 /* Do a pushlevel for class declarations. */
2808 pushlevel_class (void)
2810 class_binding_level
= begin_scope (sk_class
, current_class_type
);
2813 /* ...and a poplevel for class declarations. */
2816 poplevel_class (void)
2818 cp_binding_level
*level
= class_binding_level
;
2819 cp_class_binding
*cb
;
2823 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
2824 gcc_assert (level
!= 0);
2826 /* If we're leaving a toplevel class, cache its binding level. */
2827 if (current_class_depth
== 1)
2828 previous_class_level
= level
;
2829 for (shadowed
= level
->type_shadowed
;
2831 shadowed
= TREE_CHAIN (shadowed
))
2832 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
2834 /* Remove the bindings for all of the class-level declarations. */
2835 if (level
->class_shadowed
)
2837 FOR_EACH_VEC_ELT (*level
->class_shadowed
, i
, cb
)
2839 IDENTIFIER_BINDING (cb
->identifier
) = cb
->base
->previous
;
2840 cxx_binding_free (cb
->base
);
2842 ggc_free (level
->class_shadowed
);
2843 level
->class_shadowed
= NULL
;
2846 /* Now, pop out of the binding level which we created up in the
2847 `pushlevel_class' routine. */
2848 gcc_assert (current_binding_level
== level
);
2850 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
2853 /* Set INHERITED_VALUE_BINDING_P on BINDING to true or false, as
2854 appropriate. DECL is the value to which a name has just been
2855 bound. CLASS_TYPE is the class in which the lookup occurred. */
2858 set_inherited_value_binding_p (cxx_binding
*binding
, tree decl
,
2861 if (binding
->value
== decl
&& TREE_CODE (decl
) != TREE_LIST
)
2865 if (TREE_CODE (decl
) == OVERLOAD
)
2866 context
= ovl_scope (decl
);
2869 gcc_assert (DECL_P (decl
));
2870 context
= context_for_name_lookup (decl
);
2873 if (is_properly_derived_from (class_type
, context
))
2874 INHERITED_VALUE_BINDING_P (binding
) = 1;
2876 INHERITED_VALUE_BINDING_P (binding
) = 0;
2878 else if (binding
->value
== decl
)
2879 /* We only encounter a TREE_LIST when there is an ambiguity in the
2880 base classes. Such an ambiguity can be overridden by a
2881 definition in this class. */
2882 INHERITED_VALUE_BINDING_P (binding
) = 1;
2884 INHERITED_VALUE_BINDING_P (binding
) = 0;
2887 /* Make the declaration of X appear in CLASS scope. */
2890 pushdecl_class_level (tree x
)
2893 bool is_valid
= true;
2896 /* Do nothing if we're adding to an outer lambda closure type,
2897 outer_binding will add it later if it's needed. */
2898 if (current_class_type
!= class_binding_level
->this_entity
)
2901 subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
2902 /* Get the name of X. */
2903 if (TREE_CODE (x
) == OVERLOAD
)
2904 name
= DECL_NAME (get_first_fn (x
));
2906 name
= DECL_NAME (x
);
2910 is_valid
= push_class_level_binding (name
, x
);
2911 if (TREE_CODE (x
) == TYPE_DECL
)
2912 set_identifier_type_value (name
, x
);
2914 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
2916 /* If X is an anonymous aggregate, all of its members are
2917 treated as if they were members of the class containing the
2918 aggregate, for naming purposes. */
2921 for (f
= TYPE_FIELDS (TREE_TYPE (x
)); f
; f
= DECL_CHAIN (f
))
2923 location_t save_location
= input_location
;
2924 input_location
= DECL_SOURCE_LOCATION (f
);
2925 if (!pushdecl_class_level (f
))
2927 input_location
= save_location
;
2930 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
2934 /* Return the BINDING (if any) for NAME in SCOPE, which is a class
2935 scope. If the value returned is non-NULL, and the PREVIOUS field
2936 is not set, callers must set the PREVIOUS field explicitly. */
2938 static cxx_binding
*
2939 get_class_binding (tree name
, cp_binding_level
*scope
)
2944 cxx_binding
*binding
;
2946 class_type
= scope
->this_entity
;
2948 /* Get the type binding. */
2949 type_binding
= lookup_member (class_type
, name
,
2950 /*protect=*/2, /*want_type=*/true,
2951 tf_warning_or_error
);
2952 /* Get the value binding. */
2953 value_binding
= lookup_member (class_type
, name
,
2954 /*protect=*/2, /*want_type=*/false,
2955 tf_warning_or_error
);
2958 && (TREE_CODE (value_binding
) == TYPE_DECL
2959 || DECL_CLASS_TEMPLATE_P (value_binding
)
2960 || (TREE_CODE (value_binding
) == TREE_LIST
2961 && TREE_TYPE (value_binding
) == error_mark_node
2962 && (TREE_CODE (TREE_VALUE (value_binding
))
2964 /* We found a type binding, even when looking for a non-type
2965 binding. This means that we already processed this binding
2968 else if (value_binding
)
2970 if (TREE_CODE (value_binding
) == TREE_LIST
2971 && TREE_TYPE (value_binding
) == error_mark_node
)
2972 /* NAME is ambiguous. */
2974 else if (BASELINK_P (value_binding
))
2975 /* NAME is some overloaded functions. */
2976 value_binding
= BASELINK_FUNCTIONS (value_binding
);
2979 /* If we found either a type binding or a value binding, create a
2980 new binding object. */
2981 if (type_binding
|| value_binding
)
2983 binding
= new_class_binding (name
,
2987 /* This is a class-scope binding, not a block-scope binding. */
2988 LOCAL_BINDING_P (binding
) = 0;
2989 set_inherited_value_binding_p (binding
, value_binding
, class_type
);
2997 /* Make the declaration(s) of X appear in CLASS scope under the name
2998 NAME. Returns true if the binding is valid. */
3001 push_class_level_binding_1 (tree name
, tree x
)
3003 cxx_binding
*binding
;
3007 /* The class_binding_level will be NULL if x is a template
3008 parameter name in a member template. */
3009 if (!class_binding_level
)
3012 if (name
== error_mark_node
)
3015 /* Check for invalid member names. */
3016 gcc_assert (TYPE_BEING_DEFINED (current_class_type
));
3017 /* Check that we're pushing into the right binding level. */
3018 gcc_assert (current_class_type
== class_binding_level
->this_entity
);
3020 /* We could have been passed a tree list if this is an ambiguous
3021 declaration. If so, pull the declaration out because
3022 check_template_shadow will not handle a TREE_LIST. */
3023 if (TREE_CODE (decl
) == TREE_LIST
3024 && TREE_TYPE (decl
) == error_mark_node
)
3025 decl
= TREE_VALUE (decl
);
3027 if (TREE_CODE (decl
) == USING_DECL
3028 && TREE_CODE (USING_DECL_SCOPE (decl
)) == TEMPLATE_TYPE_PARM
3029 && DECL_NAME (decl
) == TYPE_IDENTIFIER (USING_DECL_SCOPE (decl
)))
3030 /* This using-declaration declares constructors that inherit from the
3031 constructors for the template parameter. It does not redeclare the
3032 name of the template parameter. */
3035 if (!check_template_shadow (decl
))
3040 If T is the name of a class, then each of the following shall
3041 have a name different from T:
3043 -- every static data member of class T;
3045 -- every member of class T that is itself a type;
3047 -- every enumerator of every member of class T that is an
3050 -- every member of every anonymous union that is a member of
3053 (Non-static data members were also forbidden to have the same
3054 name as T until TC1.) */
3055 if ((TREE_CODE (x
) == VAR_DECL
3056 || TREE_CODE (x
) == CONST_DECL
3057 || (TREE_CODE (x
) == TYPE_DECL
3058 && !DECL_SELF_REFERENCE_P (x
))
3059 /* A data member of an anonymous union. */
3060 || (TREE_CODE (x
) == FIELD_DECL
3061 && DECL_CONTEXT (x
) != current_class_type
))
3062 && DECL_NAME (x
) == constructor_name (current_class_type
))
3064 tree scope
= context_for_name_lookup (x
);
3065 if (TYPE_P (scope
) && same_type_p (scope
, current_class_type
))
3067 error ("%qD has the same name as the class in which it is "
3074 /* Get the current binding for NAME in this class, if any. */
3075 binding
= IDENTIFIER_BINDING (name
);
3076 if (!binding
|| binding
->scope
!= class_binding_level
)
3078 binding
= get_class_binding (name
, class_binding_level
);
3079 /* If a new binding was created, put it at the front of the
3080 IDENTIFIER_BINDING list. */
3083 binding
->previous
= IDENTIFIER_BINDING (name
);
3084 IDENTIFIER_BINDING (name
) = binding
;
3088 /* If there is already a binding, then we may need to update the
3090 if (binding
&& binding
->value
)
3092 tree bval
= binding
->value
;
3093 tree old_decl
= NULL_TREE
;
3094 tree target_decl
= strip_using_decl (decl
);
3095 tree target_bval
= strip_using_decl (bval
);
3097 if (INHERITED_VALUE_BINDING_P (binding
))
3099 /* If the old binding was from a base class, and was for a
3100 tag name, slide it over to make room for the new binding.
3101 The old binding is still visible if explicitly qualified
3102 with a class-key. */
3103 if (TREE_CODE (target_bval
) == TYPE_DECL
3104 && DECL_ARTIFICIAL (target_bval
)
3105 && !(TREE_CODE (target_decl
) == TYPE_DECL
3106 && DECL_ARTIFICIAL (target_decl
)))
3108 old_decl
= binding
->type
;
3109 binding
->type
= bval
;
3110 binding
->value
= NULL_TREE
;
3111 INHERITED_VALUE_BINDING_P (binding
) = 0;
3116 /* Any inherited type declaration is hidden by the type
3117 declaration in the derived class. */
3118 if (TREE_CODE (target_decl
) == TYPE_DECL
3119 && DECL_ARTIFICIAL (target_decl
))
3120 binding
->type
= NULL_TREE
;
3123 else if (TREE_CODE (target_decl
) == OVERLOAD
3124 && is_overloaded_fn (target_bval
))
3126 else if (TREE_CODE (decl
) == USING_DECL
3127 && TREE_CODE (bval
) == USING_DECL
3128 && same_type_p (USING_DECL_SCOPE (decl
),
3129 USING_DECL_SCOPE (bval
)))
3130 /* This is a using redeclaration that will be diagnosed later
3131 in supplement_binding */
3133 else if (TREE_CODE (decl
) == USING_DECL
3134 && TREE_CODE (bval
) == USING_DECL
3135 && DECL_DEPENDENT_P (decl
)
3136 && DECL_DEPENDENT_P (bval
))
3138 else if (TREE_CODE (decl
) == USING_DECL
3139 && is_overloaded_fn (target_bval
))
3141 else if (TREE_CODE (bval
) == USING_DECL
3142 && is_overloaded_fn (target_decl
))
3145 if (old_decl
&& binding
->scope
== class_binding_level
)
3148 /* It is always safe to clear INHERITED_VALUE_BINDING_P
3149 here. This function is only used to register bindings
3150 from with the class definition itself. */
3151 INHERITED_VALUE_BINDING_P (binding
) = 0;
3156 /* Note that we declared this value so that we can issue an error if
3157 this is an invalid redeclaration of a name already used for some
3159 note_name_declared_in_class (name
, decl
);
3161 /* If we didn't replace an existing binding, put the binding on the
3162 stack of bindings for the identifier, and update the shadowed
3164 if (binding
&& binding
->scope
== class_binding_level
)
3165 /* Supplement the existing binding. */
3166 ok
= supplement_binding (binding
, decl
);
3169 /* Create a new binding. */
3170 push_binding (name
, decl
, class_binding_level
);
3177 /* Wrapper for push_class_level_binding_1. */
3180 push_class_level_binding (tree name
, tree x
)
3183 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
3184 ret
= push_class_level_binding_1 (name
, x
);
3185 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
3189 /* Process "using SCOPE::NAME" in a class scope. Return the
3190 USING_DECL created. */
3193 do_class_using_decl (tree scope
, tree name
)
3195 /* The USING_DECL returned by this function. */
3197 /* The declaration (or declarations) name by this using
3198 declaration. NULL if we are in a template and cannot figure out
3199 what has been named. */
3201 /* True if SCOPE is a dependent type. */
3202 bool scope_dependent_p
;
3203 /* True if SCOPE::NAME is dependent. */
3204 bool name_dependent_p
;
3205 /* True if any of the bases of CURRENT_CLASS_TYPE are dependent. */
3206 bool bases_dependent_p
;
3211 if (name
== error_mark_node
)
3214 if (!scope
|| !TYPE_P (scope
))
3216 error ("using-declaration for non-member at class scope");
3220 /* Make sure the name is not invalid */
3221 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
3223 error ("%<%T::%D%> names destructor", scope
, name
);
3226 if (MAYBE_CLASS_TYPE_P (scope
) && constructor_name_p (name
, scope
))
3227 maybe_warn_cpp0x (CPP0X_INHERITING_CTORS
);
3228 if (constructor_name_p (name
, current_class_type
))
3230 error ("%<%T::%D%> names constructor in %qT",
3231 scope
, name
, current_class_type
);
3235 scope_dependent_p
= dependent_scope_p (scope
);
3236 name_dependent_p
= (scope_dependent_p
3237 || (IDENTIFIER_TYPENAME_P (name
)
3238 && dependent_type_p (TREE_TYPE (name
))));
3240 bases_dependent_p
= false;
3241 if (processing_template_decl
)
3242 for (binfo
= TYPE_BINFO (current_class_type
), i
= 0;
3243 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
);
3245 if (dependent_type_p (TREE_TYPE (base_binfo
)))
3247 bases_dependent_p
= true;
3253 /* From [namespace.udecl]:
3255 A using-declaration used as a member-declaration shall refer to a
3256 member of a base class of the class being defined.
3258 In general, we cannot check this constraint in a template because
3259 we do not know the entire set of base classes of the current
3260 class type. Morover, if SCOPE is dependent, it might match a
3261 non-dependent base. */
3263 if (!scope_dependent_p
)
3266 binfo
= lookup_base (current_class_type
, scope
, ba_any
, &b_kind
,
3267 tf_warning_or_error
);
3268 if (b_kind
< bk_proper_base
)
3270 if (!bases_dependent_p
)
3272 error_not_base_type (scope
, current_class_type
);
3276 else if (!name_dependent_p
)
3278 decl
= lookup_member (binfo
, name
, 0, false, tf_warning_or_error
);
3281 error ("no members matching %<%T::%D%> in %q#T", scope
, name
,
3285 /* The binfo from which the functions came does not matter. */
3286 if (BASELINK_P (decl
))
3287 decl
= BASELINK_FUNCTIONS (decl
);
3291 value
= build_lang_decl (USING_DECL
, name
, NULL_TREE
);
3292 USING_DECL_DECLS (value
) = decl
;
3293 USING_DECL_SCOPE (value
) = scope
;
3294 DECL_DEPENDENT_P (value
) = !decl
;
3300 /* Return the binding value for name in scope. */
3304 namespace_binding_1 (tree name
, tree scope
)
3306 cxx_binding
*binding
;
3308 if (SCOPE_FILE_SCOPE_P (scope
))
3309 scope
= global_namespace
;
3311 /* Unnecessary for the global namespace because it can't be an alias. */
3312 scope
= ORIGINAL_NAMESPACE (scope
);
3314 binding
= cp_binding_level_find_binding_for_name (NAMESPACE_LEVEL (scope
), name
);
3316 return binding
? binding
->value
: NULL_TREE
;
3320 namespace_binding (tree name
, tree scope
)
3323 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
3324 ret
= namespace_binding_1 (name
, scope
);
3325 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
3329 /* Set the binding value for name in scope. */
3332 set_namespace_binding_1 (tree name
, tree scope
, tree val
)
3336 if (scope
== NULL_TREE
)
3337 scope
= global_namespace
;
3338 b
= binding_for_name (NAMESPACE_LEVEL (scope
), name
);
3339 if (!b
->value
|| TREE_CODE (val
) == OVERLOAD
|| val
== error_mark_node
)
3342 supplement_binding (b
, val
);
3345 /* Wrapper for set_namespace_binding_1. */
3348 set_namespace_binding (tree name
, tree scope
, tree val
)
3350 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
3351 set_namespace_binding_1 (name
, scope
, val
);
3352 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
3355 /* Set the context of a declaration to scope. Complain if we are not
3359 set_decl_namespace (tree decl
, tree scope
, bool friendp
)
3363 /* Get rid of namespace aliases. */
3364 scope
= ORIGINAL_NAMESPACE (scope
);
3366 /* It is ok for friends to be qualified in parallel space. */
3367 if (!friendp
&& !is_ancestor (current_namespace
, scope
))
3368 error ("declaration of %qD not in a namespace surrounding %qD",
3370 DECL_CONTEXT (decl
) = FROB_CONTEXT (scope
);
3372 /* Writing "int N::i" to declare a variable within "N" is invalid. */
3373 if (scope
== current_namespace
)
3375 if (at_namespace_scope_p ())
3376 error ("explicit qualification in declaration of %qD",
3381 /* See whether this has been declared in the namespace. */
3382 old
= lookup_qualified_name (scope
, DECL_NAME (decl
), false, true);
3383 if (old
== error_mark_node
)
3384 /* No old declaration at all. */
3386 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
3387 if (TREE_CODE (old
) == TREE_LIST
)
3389 error ("reference to %qD is ambiguous", decl
);
3390 print_candidates (old
);
3393 if (!is_overloaded_fn (decl
))
3395 /* We might have found OLD in an inline namespace inside SCOPE. */
3396 if (TREE_CODE (decl
) == TREE_CODE (old
))
3397 DECL_CONTEXT (decl
) = DECL_CONTEXT (old
);
3398 /* Don't compare non-function decls with decls_match here, since
3399 it can't check for the correct constness at this
3400 point. pushdecl will find those errors later. */
3403 /* Since decl is a function, old should contain a function decl. */
3404 if (!is_overloaded_fn (old
))
3406 /* A template can be explicitly specialized in any namespace. */
3407 if (processing_explicit_instantiation
)
3409 if (processing_template_decl
|| processing_specialization
)
3410 /* We have not yet called push_template_decl to turn a
3411 FUNCTION_DECL into a TEMPLATE_DECL, so the declarations won't
3412 match. But, we'll check later, when we construct the
3415 /* Instantiations or specializations of templates may be declared as
3416 friends in any namespace. */
3417 if (friendp
&& DECL_USE_TEMPLATE (decl
))
3419 if (is_overloaded_fn (old
))
3421 tree found
= NULL_TREE
;
3423 for (; elt
; elt
= OVL_NEXT (elt
))
3425 tree ofn
= OVL_CURRENT (elt
);
3426 /* Adjust DECL_CONTEXT first so decls_match will return true
3427 if DECL will match a declaration in an inline namespace. */
3428 DECL_CONTEXT (decl
) = DECL_CONTEXT (ofn
);
3429 if (decls_match (decl
, ofn
))
3431 if (found
&& !decls_match (found
, ofn
))
3433 DECL_CONTEXT (decl
) = FROB_CONTEXT (scope
);
3434 error ("reference to %qD is ambiguous", decl
);
3435 print_candidates (old
);
3443 if (!is_associated_namespace (scope
, CP_DECL_CONTEXT (found
)))
3445 DECL_CONTEXT (decl
) = DECL_CONTEXT (found
);
3451 DECL_CONTEXT (decl
) = DECL_CONTEXT (old
);
3452 if (decls_match (decl
, old
))
3456 /* It didn't work, go back to the explicit scope. */
3457 DECL_CONTEXT (decl
) = FROB_CONTEXT (scope
);
3459 error ("%qD should have been declared inside %qD", decl
, scope
);
3462 /* Return the namespace where the current declaration is declared. */
3465 current_decl_namespace (void)
3468 /* If we have been pushed into a different namespace, use it. */
3469 if (!vec_safe_is_empty (decl_namespace_list
))
3470 return decl_namespace_list
->last ();
3472 if (current_class_type
)
3473 result
= decl_namespace_context (current_class_type
);
3474 else if (current_function_decl
)
3475 result
= decl_namespace_context (current_function_decl
);
3477 result
= current_namespace
;
3481 /* Process any ATTRIBUTES on a namespace definition. Currently only
3482 attribute visibility is meaningful, which is a property of the syntactic
3483 block rather than the namespace as a whole, so we don't touch the
3484 NAMESPACE_DECL at all. Returns true if attribute visibility is seen. */
3487 handle_namespace_attrs (tree ns
, tree attributes
)
3490 bool saw_vis
= false;
3492 for (d
= attributes
; d
; d
= TREE_CHAIN (d
))
3494 tree name
= TREE_PURPOSE (d
);
3495 tree args
= TREE_VALUE (d
);
3497 if (is_attribute_p ("visibility", name
))
3499 tree x
= args
? TREE_VALUE (args
) : NULL_TREE
;
3500 if (x
== NULL_TREE
|| TREE_CODE (x
) != STRING_CST
|| TREE_CHAIN (args
))
3502 warning (OPT_Wattributes
,
3503 "%qD attribute requires a single NTBS argument",
3508 if (!TREE_PUBLIC (ns
))
3509 warning (OPT_Wattributes
,
3510 "%qD attribute is meaningless since members of the "
3511 "anonymous namespace get local symbols", name
);
3513 push_visibility (TREE_STRING_POINTER (x
), 1);
3518 warning (OPT_Wattributes
, "%qD attribute directive ignored",
3527 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
3528 select a name that is unique to this compilation unit. */
3531 push_namespace (tree name
)
3534 bool need_new
= true;
3535 bool implicit_use
= false;
3538 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
3540 /* We should not get here if the global_namespace is not yet constructed
3541 nor if NAME designates the global namespace: The global scope is
3542 constructed elsewhere. */
3543 gcc_assert (global_namespace
!= NULL
&& name
!= global_scope_name
);
3547 name
= get_anonymous_namespace_name();
3548 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
3550 /* Reopening anonymous namespace. */
3552 implicit_use
= true;
3556 /* Check whether this is an extended namespace definition. */
3557 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
3558 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
3560 tree dna
= DECL_NAMESPACE_ALIAS (d
);
3563 /* We do some error recovery for, eg, the redeclaration
3570 However, in nasty cases like:
3578 we just error out below, in duplicate_decls. */
3579 if (NAMESPACE_LEVEL (dna
)->level_chain
3580 == current_binding_level
)
3582 error ("namespace alias %qD not allowed here, "
3583 "assuming %qD", d
, dna
);
3595 /* Make a new namespace, binding the name to it. */
3596 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
3597 DECL_CONTEXT (d
) = FROB_CONTEXT (current_namespace
);
3598 /* The name of this namespace is not visible to other translation
3599 units if it is an anonymous namespace or member thereof. */
3600 if (anon
|| decl_anon_ns_mem_p (current_namespace
))
3601 TREE_PUBLIC (d
) = 0;
3603 TREE_PUBLIC (d
) = 1;
3607 /* Clear DECL_NAME for the benefit of debugging back ends. */
3608 SET_DECL_ASSEMBLER_NAME (d
, name
);
3609 DECL_NAME (d
) = NULL_TREE
;
3611 begin_scope (sk_namespace
, d
);
3614 resume_scope (NAMESPACE_LEVEL (d
));
3617 do_using_directive (d
);
3618 /* Enter the name space. */
3619 current_namespace
= d
;
3621 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
3624 /* Pop from the scope of the current namespace. */
3627 pop_namespace (void)
3629 gcc_assert (current_namespace
!= global_namespace
);
3630 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
3631 /* The binding level is not popped, as it might be re-opened later. */
3635 /* Push into the scope of the namespace NS, even if it is deeply
3636 nested within another namespace. */
3639 push_nested_namespace (tree ns
)
3641 if (ns
== global_namespace
)
3642 push_to_top_level ();
3645 push_nested_namespace (CP_DECL_CONTEXT (ns
));
3646 push_namespace (DECL_NAME (ns
));
3650 /* Pop back from the scope of the namespace NS, which was previously
3651 entered with push_nested_namespace. */
3654 pop_nested_namespace (tree ns
)
3656 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
3657 gcc_assert (current_namespace
== ns
);
3658 while (ns
!= global_namespace
)
3661 ns
= CP_DECL_CONTEXT (ns
);
3664 pop_from_top_level ();
3665 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
3668 /* Temporarily set the namespace for the current declaration. */
3671 push_decl_namespace (tree decl
)
3673 if (TREE_CODE (decl
) != NAMESPACE_DECL
)
3674 decl
= decl_namespace_context (decl
);
3675 vec_safe_push (decl_namespace_list
, ORIGINAL_NAMESPACE (decl
));
3678 /* [namespace.memdef]/2 */
3681 pop_decl_namespace (void)
3683 decl_namespace_list
->pop ();
3686 /* Return the namespace that is the common ancestor
3687 of two given namespaces. */
3690 namespace_ancestor_1 (tree ns1
, tree ns2
)
3693 if (is_ancestor (ns1
, ns2
))
3696 nsr
= namespace_ancestor_1 (CP_DECL_CONTEXT (ns1
), ns2
);
3700 /* Wrapper for namespace_ancestor_1. */
3703 namespace_ancestor (tree ns1
, tree ns2
)
3706 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
3707 nsr
= namespace_ancestor_1 (ns1
, ns2
);
3708 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
3712 /* Process a namespace-alias declaration. */
3715 do_namespace_alias (tree alias
, tree name_space
)
3717 if (name_space
== error_mark_node
)
3720 gcc_assert (TREE_CODE (name_space
) == NAMESPACE_DECL
);
3722 name_space
= ORIGINAL_NAMESPACE (name_space
);
3724 /* Build the alias. */
3725 alias
= build_lang_decl (NAMESPACE_DECL
, alias
, void_type_node
);
3726 DECL_NAMESPACE_ALIAS (alias
) = name_space
;
3727 DECL_EXTERNAL (alias
) = 1;
3728 DECL_CONTEXT (alias
) = FROB_CONTEXT (current_scope ());
3731 /* Emit debug info for namespace alias. */
3732 if (!building_stmt_list_p ())
3733 (*debug_hooks
->global_decl
) (alias
);
3736 /* Like pushdecl, only it places X in the current namespace,
3740 pushdecl_namespace_level (tree x
, bool is_friend
)
3742 cp_binding_level
*b
= current_binding_level
;
3745 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
3746 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
), is_friend
);
3748 /* Now, the type_shadowed stack may screw us. Munge it so it does
3750 if (TREE_CODE (t
) == TYPE_DECL
)
3752 tree name
= DECL_NAME (t
);
3754 tree
*ptr
= (tree
*)0;
3755 for (; !global_scope_p (b
); b
= b
->level_chain
)
3757 tree shadowed
= b
->type_shadowed
;
3758 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
3759 if (TREE_PURPOSE (shadowed
) == name
)
3761 ptr
= &TREE_VALUE (shadowed
);
3762 /* Can't break out of the loop here because sometimes
3763 a binding level will have duplicate bindings for
3764 PT names. It's gross, but I haven't time to fix it. */
3767 newval
= TREE_TYPE (t
);
3768 if (ptr
== (tree
*)0)
3770 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
3771 up here if this is changed to an assertion. --KR */
3772 SET_IDENTIFIER_TYPE_VALUE (name
, t
);
3779 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
3783 /* Insert USED into the using list of USER. Set INDIRECT_flag if this
3784 directive is not directly from the source. Also find the common
3785 ancestor and let our users know about the new namespace */
3788 add_using_namespace_1 (tree user
, tree used
, bool indirect
)
3791 /* Using oneself is a no-op. */
3794 gcc_assert (TREE_CODE (user
) == NAMESPACE_DECL
);
3795 gcc_assert (TREE_CODE (used
) == NAMESPACE_DECL
);
3796 /* Check if we already have this. */
3797 t
= purpose_member (used
, DECL_NAMESPACE_USING (user
));
3801 /* Promote to direct usage. */
3802 TREE_INDIRECT_USING (t
) = 0;
3806 /* Add used to the user's using list. */
3807 DECL_NAMESPACE_USING (user
)
3808 = tree_cons (used
, namespace_ancestor (user
, used
),
3809 DECL_NAMESPACE_USING (user
));
3811 TREE_INDIRECT_USING (DECL_NAMESPACE_USING (user
)) = indirect
;
3813 /* Add user to the used's users list. */
3814 DECL_NAMESPACE_USERS (used
)
3815 = tree_cons (user
, 0, DECL_NAMESPACE_USERS (used
));
3817 /* Recursively add all namespaces used. */
3818 for (t
= DECL_NAMESPACE_USING (used
); t
; t
= TREE_CHAIN (t
))
3819 /* indirect usage */
3820 add_using_namespace_1 (user
, TREE_PURPOSE (t
), 1);
3822 /* Tell everyone using us about the new used namespaces. */
3823 for (t
= DECL_NAMESPACE_USERS (user
); t
; t
= TREE_CHAIN (t
))
3824 add_using_namespace_1 (TREE_PURPOSE (t
), used
, 1);
3827 /* Wrapper for add_using_namespace_1. */
3830 add_using_namespace (tree user
, tree used
, bool indirect
)
3832 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
3833 add_using_namespace_1 (user
, used
, indirect
);
3834 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
3837 /* Process a using-declaration not appearing in class or local scope. */
3840 do_toplevel_using_decl (tree decl
, tree scope
, tree name
)
3842 tree oldval
, oldtype
, newval
, newtype
;
3843 tree orig_decl
= decl
;
3844 cxx_binding
*binding
;
3846 decl
= validate_nonmember_using_decl (decl
, scope
, name
);
3847 if (decl
== NULL_TREE
)
3850 binding
= binding_for_name (NAMESPACE_LEVEL (current_namespace
), name
);
3852 oldval
= binding
->value
;
3853 oldtype
= binding
->type
;
3855 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, &newval
, &newtype
);
3857 /* Emit debug info. */
3858 if (!processing_template_decl
)
3859 cp_emit_debug_info_for_using (orig_decl
, current_namespace
);
3861 /* Copy declarations found. */
3863 binding
->value
= newval
;
3865 binding
->type
= newtype
;
3868 /* Process a using-directive. */
3871 do_using_directive (tree name_space
)
3873 tree context
= NULL_TREE
;
3875 if (name_space
== error_mark_node
)
3878 gcc_assert (TREE_CODE (name_space
) == NAMESPACE_DECL
);
3880 if (building_stmt_list_p ())
3881 add_stmt (build_stmt (input_location
, USING_STMT
, name_space
));
3882 name_space
= ORIGINAL_NAMESPACE (name_space
);
3884 if (!toplevel_bindings_p ())
3886 push_using_directive (name_space
);
3891 add_using_namespace (current_namespace
, name_space
, 0);
3892 if (current_namespace
!= global_namespace
)
3893 context
= current_namespace
;
3895 /* Emit debugging info. */
3896 if (!processing_template_decl
)
3897 (*debug_hooks
->imported_module_or_decl
) (name_space
, NULL_TREE
,
3902 /* Deal with a using-directive seen by the parser. Currently we only
3903 handle attributes here, since they cannot appear inside a template. */
3906 parse_using_directive (tree name_space
, tree attribs
)
3910 do_using_directive (name_space
);
3912 for (a
= attribs
; a
; a
= TREE_CHAIN (a
))
3914 tree name
= TREE_PURPOSE (a
);
3915 if (is_attribute_p ("strong", name
))
3917 if (!toplevel_bindings_p ())
3918 error ("strong using only meaningful at namespace scope");
3919 else if (name_space
!= error_mark_node
)
3921 if (!is_ancestor (current_namespace
, name_space
))
3922 error ("current namespace %qD does not enclose strongly used namespace %qD",
3923 current_namespace
, name_space
);
3924 DECL_NAMESPACE_ASSOCIATIONS (name_space
)
3925 = tree_cons (current_namespace
, 0,
3926 DECL_NAMESPACE_ASSOCIATIONS (name_space
));
3930 warning (OPT_Wattributes
, "%qD attribute directive ignored", name
);
3934 /* Like pushdecl, only it places X in the global scope if appropriate.
3935 Calls cp_finish_decl to register the variable, initializing it with
3936 *INIT, if INIT is non-NULL. */
3939 pushdecl_top_level_1 (tree x
, tree
*init
, bool is_friend
)
3941 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
3942 push_to_top_level ();
3943 x
= pushdecl_namespace_level (x
, is_friend
);
3945 cp_finish_decl (x
, *init
, false, NULL_TREE
, 0);
3946 pop_from_top_level ();
3947 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
3951 /* Like pushdecl, only it places X in the global scope if appropriate. */
3954 pushdecl_top_level (tree x
)
3956 return pushdecl_top_level_1 (x
, NULL
, false);
3959 /* Like pushdecl_top_level, but adding the IS_FRIEND parameter. */
3962 pushdecl_top_level_maybe_friend (tree x
, bool is_friend
)
3964 return pushdecl_top_level_1 (x
, NULL
, is_friend
);
3967 /* Like pushdecl, only it places X in the global scope if
3968 appropriate. Calls cp_finish_decl to register the variable,
3969 initializing it with INIT. */
3972 pushdecl_top_level_and_finish (tree x
, tree init
)
3974 return pushdecl_top_level_1 (x
, &init
, false);
3977 /* Combines two sets of overloaded functions into an OVERLOAD chain, removing
3978 duplicates. The first list becomes the tail of the result.
3980 The algorithm is O(n^2). We could get this down to O(n log n) by
3981 doing a sort on the addresses of the functions, if that becomes
3985 merge_functions (tree s1
, tree s2
)
3987 for (; s2
; s2
= OVL_NEXT (s2
))
3989 tree fn2
= OVL_CURRENT (s2
);
3992 for (fns1
= s1
; fns1
; fns1
= OVL_NEXT (fns1
))
3994 tree fn1
= OVL_CURRENT (fns1
);
3996 /* If the function from S2 is already in S1, there is no
3997 need to add it again. For `extern "C"' functions, we
3998 might have two FUNCTION_DECLs for the same function, in
3999 different namespaces, but let's leave them in in case
4000 they have different default arguments. */
4005 /* If we exhausted all of the functions in S1, FN2 is new. */
4007 s1
= build_overload (fn2
, s1
);
4012 /* Returns TRUE iff OLD and NEW are the same entity.
4014 3 [basic]/3: An entity is a value, object, reference, function,
4015 enumerator, type, class member, template, template specialization,
4016 namespace, parameter pack, or this.
4018 7.3.4 [namespace.udir]/4: If name lookup finds a declaration for a name
4019 in two different namespaces, and the declarations do not declare the
4020 same entity and do not declare functions, the use of the name is
4024 same_entity_p (tree one
, tree two
)
4030 if (TREE_CODE (one
) == TYPE_DECL
4031 && TREE_CODE (two
) == TYPE_DECL
4032 && same_type_p (TREE_TYPE (one
), TREE_TYPE (two
)))
4037 /* This should return an error not all definitions define functions.
4038 It is not an error if we find two functions with exactly the
4039 same signature, only if these are selected in overload resolution.
4040 old is the current set of bindings, new_binding the freshly-found binding.
4041 XXX Do we want to give *all* candidates in case of ambiguity?
4042 XXX In what way should I treat extern declarations?
4043 XXX I don't want to repeat the entire duplicate_decls here */
4046 ambiguous_decl (struct scope_binding
*old
, cxx_binding
*new_binding
, int flags
)
4049 gcc_assert (old
!= NULL
);
4051 /* Copy the type. */
4052 type
= new_binding
->type
;
4053 if (LOOKUP_NAMESPACES_ONLY (flags
)
4054 || (type
&& hidden_name_p (type
) && !(flags
& LOOKUP_HIDDEN
)))
4057 /* Copy the value. */
4058 val
= new_binding
->value
;
4061 if (hidden_name_p (val
) && !(flags
& LOOKUP_HIDDEN
))
4064 switch (TREE_CODE (val
))
4067 /* If we expect types or namespaces, and not templates,
4068 or this is not a template class. */
4069 if ((LOOKUP_QUALIFIERS_ONLY (flags
)
4070 && !DECL_TYPE_TEMPLATE_P (val
)))
4074 if (LOOKUP_NAMESPACES_ONLY (flags
)
4075 || (type
&& (flags
& LOOKUP_PREFER_TYPES
)))
4078 case NAMESPACE_DECL
:
4079 if (LOOKUP_TYPES_ONLY (flags
))
4083 /* Ignore built-in functions that are still anticipated. */
4084 if (LOOKUP_QUALIFIERS_ONLY (flags
))
4088 if (LOOKUP_QUALIFIERS_ONLY (flags
))
4093 /* If val is hidden, shift down any class or enumeration name. */
4102 else if (val
&& !same_entity_p (val
, old
->value
))
4104 if (is_overloaded_fn (old
->value
) && is_overloaded_fn (val
))
4105 old
->value
= merge_functions (old
->value
, val
);
4108 old
->value
= tree_cons (NULL_TREE
, old
->value
,
4109 build_tree_list (NULL_TREE
, val
));
4110 TREE_TYPE (old
->value
) = error_mark_node
;
4116 else if (type
&& old
->type
!= type
)
4118 old
->type
= tree_cons (NULL_TREE
, old
->type
,
4119 build_tree_list (NULL_TREE
, type
));
4120 TREE_TYPE (old
->type
) = error_mark_node
;
4124 /* Return the declarations that are members of the namespace NS. */
4127 cp_namespace_decls (tree ns
)
4129 return NAMESPACE_LEVEL (ns
)->names
;
4132 /* Combine prefer_type and namespaces_only into flags. */
4135 lookup_flags (int prefer_type
, int namespaces_only
)
4137 if (namespaces_only
)
4138 return LOOKUP_PREFER_NAMESPACES
;
4139 if (prefer_type
> 1)
4140 return LOOKUP_PREFER_TYPES
;
4141 if (prefer_type
> 0)
4142 return LOOKUP_PREFER_BOTH
;
4146 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
4147 ignore it or not. Subroutine of lookup_name_real and
4148 lookup_type_scope. */
4151 qualify_lookup (tree val
, int flags
)
4153 if (val
== NULL_TREE
)
4155 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
4157 if (flags
& LOOKUP_PREFER_TYPES
)
4159 tree target_val
= strip_using_decl (val
);
4160 if (TREE_CODE (target_val
) == TYPE_DECL
4161 || TREE_CODE (target_val
) == TEMPLATE_DECL
)
4164 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
4166 /* Look through lambda things that we shouldn't be able to see. */
4167 if (is_lambda_ignored_entity (val
))
4172 /* Given a lookup that returned VAL, decide if we want to ignore it or
4173 not based on DECL_ANTICIPATED. */
4176 hidden_name_p (tree val
)
4179 && DECL_LANG_SPECIFIC (val
)
4180 && TYPE_FUNCTION_OR_TEMPLATE_DECL_P (val
)
4181 && DECL_ANTICIPATED (val
))
4186 /* Remove any hidden friend functions from a possibly overloaded set
4190 remove_hidden_names (tree fns
)
4195 if (TREE_CODE (fns
) == FUNCTION_DECL
&& hidden_name_p (fns
))
4197 else if (TREE_CODE (fns
) == OVERLOAD
)
4201 for (o
= fns
; o
; o
= OVL_NEXT (o
))
4202 if (hidden_name_p (OVL_CURRENT (o
)))
4208 for (o
= fns
; o
; o
= OVL_NEXT (o
))
4209 if (!hidden_name_p (OVL_CURRENT (o
)))
4210 n
= build_overload (OVL_CURRENT (o
), n
);
4218 /* Suggest alternatives for NAME, an IDENTIFIER_NODE for which name
4219 lookup failed. Search through all available namespaces and print out
4220 possible candidates. */
4223 suggest_alternatives_for (location_t location
, tree name
)
4225 vec
<tree
> candidates
= vNULL
;
4226 vec
<tree
> namespaces_to_search
= vNULL
;
4227 int max_to_search
= PARAM_VALUE (CXX_MAX_NAMESPACES_FOR_DIAGNOSTIC_HELP
);
4232 namespaces_to_search
.safe_push (global_namespace
);
4234 while (!namespaces_to_search
.is_empty ()
4235 && n_searched
< max_to_search
)
4237 tree scope
= namespaces_to_search
.pop ();
4238 struct scope_binding binding
= EMPTY_SCOPE_BINDING
;
4239 cp_binding_level
*level
= NAMESPACE_LEVEL (scope
);
4241 /* Look in this namespace. */
4242 qualified_lookup_using_namespace (name
, scope
, &binding
, 0);
4247 candidates
.safe_push (binding
.value
);
4249 /* Add child namespaces. */
4250 for (t
= level
->namespaces
; t
; t
= DECL_CHAIN (t
))
4251 namespaces_to_search
.safe_push (t
);
4254 /* If we stopped before we could examine all namespaces, inform the
4255 user. Do this even if we don't have any candidates, since there
4256 might be more candidates further down that we weren't able to
4258 if (n_searched
>= max_to_search
4259 && !namespaces_to_search
.is_empty ())
4261 "maximum limit of %d namespaces searched for %qE",
4262 max_to_search
, name
);
4264 namespaces_to_search
.release ();
4266 /* Nothing useful to report. */
4267 if (candidates
.is_empty ())
4270 inform_n (location
, candidates
.length (),
4271 "suggested alternative:",
4272 "suggested alternatives:");
4274 FOR_EACH_VEC_ELT (candidates
, ix
, t
)
4275 inform (location_of (t
), " %qE", t
);
4277 candidates
.release ();
4280 /* Unscoped lookup of a global: iterate over current namespaces,
4281 considering using-directives. */
4284 unqualified_namespace_lookup_1 (tree name
, int flags
)
4286 tree initial
= current_decl_namespace ();
4287 tree scope
= initial
;
4289 cp_binding_level
*level
;
4290 tree val
= NULL_TREE
;
4292 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
4294 struct scope_binding binding
= EMPTY_SCOPE_BINDING
;
4296 cp_binding_level_find_binding_for_name (NAMESPACE_LEVEL (scope
), name
);
4299 ambiguous_decl (&binding
, b
, flags
);
4301 /* Add all _DECLs seen through local using-directives. */
4302 for (level
= current_binding_level
;
4303 level
->kind
!= sk_namespace
;
4304 level
= level
->level_chain
)
4305 if (!lookup_using_namespace (name
, &binding
, level
->using_directives
,
4307 /* Give up because of error. */
4308 return error_mark_node
;
4310 /* Add all _DECLs seen through global using-directives. */
4311 /* XXX local and global using lists should work equally. */
4315 if (!lookup_using_namespace (name
, &binding
,
4316 DECL_NAMESPACE_USING (siter
),
4318 /* Give up because of error. */
4319 return error_mark_node
;
4320 if (siter
== scope
) break;
4321 siter
= CP_DECL_CONTEXT (siter
);
4324 val
= binding
.value
;
4325 if (scope
== global_namespace
)
4331 /* Wrapper for unqualified_namespace_lookup_1. */
4334 unqualified_namespace_lookup (tree name
, int flags
)
4337 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
4338 ret
= unqualified_namespace_lookup_1 (name
, flags
);
4339 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
4343 /* Look up NAME (an IDENTIFIER_NODE) in SCOPE (either a NAMESPACE_DECL
4344 or a class TYPE). If IS_TYPE_P is TRUE, then ignore non-type
4347 Returns a DECL (or OVERLOAD, or BASELINK) representing the
4348 declaration found. If no suitable declaration can be found,
4349 ERROR_MARK_NODE is returned. If COMPLAIN is true and SCOPE is
4350 neither a class-type nor a namespace a diagnostic is issued. */
4353 lookup_qualified_name (tree scope
, tree name
, bool is_type_p
, bool complain
)
4358 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
4360 struct scope_binding binding
= EMPTY_SCOPE_BINDING
;
4363 flags
|= LOOKUP_PREFER_TYPES
;
4364 if (qualified_lookup_using_namespace (name
, scope
, &binding
, flags
))
4367 else if (cxx_dialect
!= cxx98
&& TREE_CODE (scope
) == ENUMERAL_TYPE
)
4368 t
= lookup_enumerator (scope
, name
);
4369 else if (is_class_type (scope
, complain
))
4370 t
= lookup_member (scope
, name
, 2, is_type_p
, tf_warning_or_error
);
4373 return error_mark_node
;
4377 /* Subroutine of unqualified_namespace_lookup:
4378 Add the bindings of NAME in used namespaces to VAL.
4379 We are currently looking for names in namespace SCOPE, so we
4380 look through USINGS for using-directives of namespaces
4381 which have SCOPE as a common ancestor with the current scope.
4382 Returns false on errors. */
4385 lookup_using_namespace (tree name
, struct scope_binding
*val
,
4386 tree usings
, tree scope
, int flags
)
4389 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
4390 /* Iterate over all used namespaces in current, searching for using
4391 directives of scope. */
4392 for (iter
= usings
; iter
; iter
= TREE_CHAIN (iter
))
4393 if (TREE_VALUE (iter
) == scope
)
4395 tree used
= ORIGINAL_NAMESPACE (TREE_PURPOSE (iter
));
4397 cp_binding_level_find_binding_for_name (NAMESPACE_LEVEL (used
), name
);
4398 /* Resolve ambiguities. */
4400 ambiguous_decl (val
, val1
, flags
);
4402 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
4403 return val
->value
!= error_mark_node
;
4406 /* Returns true iff VEC contains TARGET. */
4409 tree_vec_contains (vec
<tree
, va_gc
> *vec
, tree target
)
4413 FOR_EACH_VEC_SAFE_ELT (vec
,i
,elt
)
4420 Accepts the NAME to lookup and its qualifying SCOPE.
4421 Returns the name/type pair found into the cxx_binding *RESULT,
4422 or false on error. */
4425 qualified_lookup_using_namespace (tree name
, tree scope
,
4426 struct scope_binding
*result
, int flags
)
4428 /* Maintain a list of namespaces visited... */
4429 vec
<tree
, va_gc
> *seen
= NULL
;
4430 vec
<tree
, va_gc
> *seen_inline
= NULL
;
4431 /* ... and a list of namespace yet to see. */
4432 vec
<tree
, va_gc
> *todo
= NULL
;
4433 vec
<tree
, va_gc
> *todo_maybe
= NULL
;
4434 vec
<tree
, va_gc
> *todo_inline
= NULL
;
4436 timevar_start (TV_NAME_LOOKUP
);
4437 /* Look through namespace aliases. */
4438 scope
= ORIGINAL_NAMESPACE (scope
);
4440 /* Algorithm: Starting with SCOPE, walk through the set of used
4441 namespaces. For each used namespace, look through its inline
4442 namespace set for any bindings and usings. If no bindings are
4443 found, add any usings seen to the set of used namespaces. */
4444 vec_safe_push (todo
, scope
);
4446 while (todo
->length ())
4449 scope
= todo
->pop ();
4450 if (tree_vec_contains (seen
, scope
))
4452 vec_safe_push (seen
, scope
);
4453 vec_safe_push (todo_inline
, scope
);
4456 while (todo_inline
->length ())
4458 cxx_binding
*binding
;
4460 scope
= todo_inline
->pop ();
4461 if (tree_vec_contains (seen_inline
, scope
))
4463 vec_safe_push (seen_inline
, scope
);
4466 cp_binding_level_find_binding_for_name (NAMESPACE_LEVEL (scope
), name
);
4470 ambiguous_decl (result
, binding
, flags
);
4473 for (usings
= DECL_NAMESPACE_USING (scope
); usings
;
4474 usings
= TREE_CHAIN (usings
))
4475 if (!TREE_INDIRECT_USING (usings
))
4477 if (is_associated_namespace (scope
, TREE_PURPOSE (usings
)))
4478 vec_safe_push (todo_inline
, TREE_PURPOSE (usings
));
4480 vec_safe_push (todo_maybe
, TREE_PURPOSE (usings
));
4485 vec_safe_truncate (todo_maybe
, 0);
4487 while (vec_safe_length (todo_maybe
))
4488 vec_safe_push (todo
, todo_maybe
->pop ());
4491 vec_free (todo_maybe
);
4492 vec_free (todo_inline
);
4494 vec_free (seen_inline
);
4495 timevar_stop (TV_NAME_LOOKUP
);
4496 return result
->value
!= error_mark_node
;
4499 /* Subroutine of outer_binding.
4501 Returns TRUE if BINDING is a binding to a template parameter of
4502 SCOPE. In that case SCOPE is the scope of a primary template
4503 parameter -- in the sense of G++, i.e, a template that has its own
4506 Returns FALSE otherwise. */
4509 binding_to_template_parms_of_scope_p (cxx_binding
*binding
,
4510 cp_binding_level
*scope
)
4512 tree binding_value
, tmpl
, tinfo
;
4515 if (!binding
|| !scope
|| !scope
->this_entity
)
4518 binding_value
= binding
->value
? binding
->value
: binding
->type
;
4519 tinfo
= get_template_info (scope
->this_entity
);
4521 /* BINDING_VALUE must be a template parm. */
4522 if (binding_value
== NULL_TREE
4523 || (!DECL_P (binding_value
)
4524 || !DECL_TEMPLATE_PARM_P (binding_value
)))
4527 /* The level of BINDING_VALUE. */
4529 template_type_parameter_p (binding_value
)
4530 ? TEMPLATE_PARM_LEVEL (TEMPLATE_TYPE_PARM_INDEX
4531 (TREE_TYPE (binding_value
)))
4532 : TEMPLATE_PARM_LEVEL (DECL_INITIAL (binding_value
));
4534 /* The template of the current scope, iff said scope is a primary
4537 && PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
4538 ? TI_TEMPLATE (tinfo
)
4541 /* If the level of the parm BINDING_VALUE equals the depth of TMPL,
4542 then BINDING_VALUE is a parameter of TMPL. */
4543 return (tmpl
&& level
== TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)));
4546 /* Return the innermost non-namespace binding for NAME from a scope
4547 containing BINDING, or, if BINDING is NULL, the current scope.
4548 Please note that for a given template, the template parameters are
4549 considered to be in the scope containing the current scope.
4550 If CLASS_P is false, then class bindings are ignored. */
4553 outer_binding (tree name
,
4554 cxx_binding
*binding
,
4558 cp_binding_level
*scope
;
4559 cp_binding_level
*outer_scope
;
4563 scope
= binding
->scope
->level_chain
;
4564 outer
= binding
->previous
;
4568 scope
= current_binding_level
;
4569 outer
= IDENTIFIER_BINDING (name
);
4571 outer_scope
= outer
? outer
->scope
: NULL
;
4573 /* Because we create class bindings lazily, we might be missing a
4574 class binding for NAME. If there are any class binding levels
4575 between the LAST_BINDING_LEVEL and the scope in which OUTER was
4576 declared, we must lookup NAME in those class scopes. */
4578 while (scope
&& scope
!= outer_scope
&& scope
->kind
!= sk_namespace
)
4580 if (scope
->kind
== sk_class
)
4582 cxx_binding
*class_binding
;
4584 class_binding
= get_class_binding (name
, scope
);
4587 /* Thread this new class-scope binding onto the
4588 IDENTIFIER_BINDING list so that future lookups
4590 class_binding
->previous
= outer
;
4592 binding
->previous
= class_binding
;
4594 IDENTIFIER_BINDING (name
) = class_binding
;
4595 return class_binding
;
4598 /* If we are in a member template, the template parms of the member
4599 template are considered to be inside the scope of the containing
4600 class, but within G++ the class bindings are all pushed between the
4601 template parms and the function body. So if the outer binding is
4602 a template parm for the current scope, return it now rather than
4603 look for a class binding. */
4604 if (outer_scope
&& outer_scope
->kind
== sk_template_parms
4605 && binding_to_template_parms_of_scope_p (outer
, scope
))
4608 scope
= scope
->level_chain
;
4614 /* Return the innermost block-scope or class-scope value binding for
4615 NAME, or NULL_TREE if there is no such binding. */
4618 innermost_non_namespace_value (tree name
)
4620 cxx_binding
*binding
;
4621 binding
= outer_binding (name
, /*binding=*/NULL
, /*class_p=*/true);
4622 return binding
? binding
->value
: NULL_TREE
;
4625 /* Look up NAME in the current binding level and its superiors in the
4626 namespace of variables, functions and typedefs. Return a ..._DECL
4627 node of some kind representing its definition if there is only one
4628 such declaration, or return a TREE_LIST with all the overloaded
4629 definitions if there are many, or return 0 if it is undefined.
4630 Hidden name, either friend declaration or built-in function, are
4633 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
4634 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
4635 Otherwise we prefer non-TYPE_DECLs.
4637 If NONCLASS is nonzero, bindings in class scopes are ignored. If
4638 BLOCK_P is false, bindings in block scopes are ignored. */
4641 lookup_name_real_1 (tree name
, int prefer_type
, int nonclass
, bool block_p
,
4642 int namespaces_only
, int flags
)
4645 tree val
= NULL_TREE
;
4647 /* Conversion operators are handled specially because ordinary
4648 unqualified name lookup will not find template conversion
4650 if (IDENTIFIER_TYPENAME_P (name
))
4652 cp_binding_level
*level
;
4654 for (level
= current_binding_level
;
4655 level
&& level
->kind
!= sk_namespace
;
4656 level
= level
->level_chain
)
4661 /* A conversion operator can only be declared in a class
4663 if (level
->kind
!= sk_class
)
4666 /* Lookup the conversion operator in the class. */
4667 class_type
= level
->this_entity
;
4668 operators
= lookup_fnfields (class_type
, name
, /*protect=*/0);
4676 flags
|= lookup_flags (prefer_type
, namespaces_only
);
4678 /* First, look in non-namespace scopes. */
4680 if (current_class_type
== NULL_TREE
)
4683 if (block_p
|| !nonclass
)
4684 for (iter
= outer_binding (name
, NULL
, !nonclass
);
4686 iter
= outer_binding (name
, iter
, !nonclass
))
4690 /* Skip entities we don't want. */
4691 if (LOCAL_BINDING_P (iter
) ? !block_p
: nonclass
)
4694 /* If this is the kind of thing we're looking for, we're done. */
4695 if (qualify_lookup (iter
->value
, flags
))
4696 binding
= iter
->value
;
4697 else if ((flags
& LOOKUP_PREFER_TYPES
)
4698 && qualify_lookup (iter
->type
, flags
))
4699 binding
= iter
->type
;
4701 binding
= NULL_TREE
;
4705 if (hidden_name_p (binding
))
4707 /* A non namespace-scope binding can only be hidden in the
4708 presence of a local class, due to friend declarations.
4710 In particular, consider:
4718 B* b; // error: B is hidden
4719 C* c; // OK, finds ::C
4722 B *b; // error: B is hidden
4723 C *c; // OK, finds ::C
4728 The standard says that "B" is a local class in "f"
4729 (but not nested within "A") -- but that name lookup
4730 for "B" does not find this declaration until it is
4731 declared directly with "f".
4737 If a friend declaration appears in a local class and
4738 the name specified is an unqualified name, a prior
4739 declaration is looked up without considering scopes
4740 that are outside the innermost enclosing non-class
4741 scope. For a friend function declaration, if there is
4742 no prior declaration, the program is ill-formed. For a
4743 friend class declaration, if there is no prior
4744 declaration, the class that is specified belongs to the
4745 innermost enclosing non-class scope, but if it is
4746 subsequently referenced, its name is not found by name
4747 lookup until a matching declaration is provided in the
4748 innermost enclosing nonclass scope.
4750 So just keep looking for a non-hidden binding.
4752 gcc_assert (TREE_CODE (binding
) == TYPE_DECL
);
4760 /* Now lookup in namespace scopes. */
4762 val
= unqualified_namespace_lookup (name
, flags
);
4764 /* If we have a single function from a using decl, pull it out. */
4765 if (val
&& TREE_CODE (val
) == OVERLOAD
&& !really_overloaded_fn (val
))
4766 val
= OVL_FUNCTION (val
);
4771 /* Wrapper for lookup_name_real_1. */
4774 lookup_name_real (tree name
, int prefer_type
, int nonclass
, bool block_p
,
4775 int namespaces_only
, int flags
)
4778 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
4779 ret
= lookup_name_real_1 (name
, prefer_type
, nonclass
, block_p
,
4780 namespaces_only
, flags
);
4781 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
4786 lookup_name_nonclass (tree name
)
4788 return lookup_name_real (name
, 0, 1, /*block_p=*/true, 0, 0);
4792 lookup_function_nonclass (tree name
, vec
<tree
, va_gc
> *args
, bool block_p
)
4795 lookup_arg_dependent (name
,
4796 lookup_name_real (name
, 0, 1, block_p
, 0, 0),
4801 lookup_name (tree name
)
4803 return lookup_name_real (name
, 0, 0, /*block_p=*/true, 0, 0);
4807 lookup_name_prefer_type (tree name
, int prefer_type
)
4809 return lookup_name_real (name
, prefer_type
, 0, /*block_p=*/true, 0, 0);
4812 /* Look up NAME for type used in elaborated name specifier in
4813 the scopes given by SCOPE. SCOPE can be either TS_CURRENT or
4814 TS_WITHIN_ENCLOSING_NON_CLASS. Although not implied by the
4815 name, more scopes are checked if cleanup or template parameter
4816 scope is encountered.
4818 Unlike lookup_name_real, we make sure that NAME is actually
4819 declared in the desired scope, not from inheritance, nor using
4820 directive. For using declaration, there is DR138 still waiting
4821 to be resolved. Hidden name coming from an earlier friend
4822 declaration is also returned.
4824 A TYPE_DECL best matching the NAME is returned. Catching error
4825 and issuing diagnostics are caller's responsibility. */
4828 lookup_type_scope_1 (tree name
, tag_scope scope
)
4830 cxx_binding
*iter
= NULL
;
4831 tree val
= NULL_TREE
;
4833 /* Look in non-namespace scope first. */
4834 if (current_binding_level
->kind
!= sk_namespace
)
4835 iter
= outer_binding (name
, NULL
, /*class_p=*/ true);
4836 for (; iter
; iter
= outer_binding (name
, iter
, /*class_p=*/ true))
4838 /* Check if this is the kind of thing we're looking for.
4839 If SCOPE is TS_CURRENT, also make sure it doesn't come from
4840 base class. For ITER->VALUE, we can simply use
4841 INHERITED_VALUE_BINDING_P. For ITER->TYPE, we have to use
4844 We check ITER->TYPE before ITER->VALUE in order to handle
4845 typedef struct C {} C;
4848 if (qualify_lookup (iter
->type
, LOOKUP_PREFER_TYPES
)
4849 && (scope
!= ts_current
4850 || LOCAL_BINDING_P (iter
)
4851 || DECL_CONTEXT (iter
->type
) == iter
->scope
->this_entity
))
4853 else if ((scope
!= ts_current
4854 || !INHERITED_VALUE_BINDING_P (iter
))
4855 && qualify_lookup (iter
->value
, LOOKUP_PREFER_TYPES
))
4862 /* Look in namespace scope. */
4865 iter
= cp_binding_level_find_binding_for_name
4866 (NAMESPACE_LEVEL (current_decl_namespace ()), name
);
4870 /* If this is the kind of thing we're looking for, we're done. */
4871 if (qualify_lookup (iter
->type
, LOOKUP_PREFER_TYPES
))
4873 else if (qualify_lookup (iter
->value
, LOOKUP_PREFER_TYPES
))
4879 /* Type found, check if it is in the allowed scopes, ignoring cleanup
4880 and template parameter scopes. */
4883 cp_binding_level
*b
= current_binding_level
;
4886 if (iter
->scope
== b
)
4889 if (b
->kind
== sk_cleanup
|| b
->kind
== sk_template_parms
4890 || b
->kind
== sk_function_parms
)
4892 else if (b
->kind
== sk_class
4893 && scope
== ts_within_enclosing_non_class
)
4903 /* Wrapper for lookup_type_scope_1. */
4906 lookup_type_scope (tree name
, tag_scope scope
)
4909 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
4910 ret
= lookup_type_scope_1 (name
, scope
);
4911 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
4916 /* Similar to `lookup_name' but look only in the innermost non-class
4920 lookup_name_innermost_nonclass_level_1 (tree name
)
4922 cp_binding_level
*b
;
4925 b
= innermost_nonclass_level ();
4927 if (b
->kind
== sk_namespace
)
4929 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
4931 /* extern "C" function() */
4932 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
4935 else if (IDENTIFIER_BINDING (name
)
4936 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
4938 cxx_binding
*binding
;
4939 binding
= IDENTIFIER_BINDING (name
);
4942 if (binding
->scope
== b
4943 && !(TREE_CODE (binding
->value
) == VAR_DECL
4944 && DECL_DEAD_FOR_LOCAL (binding
->value
)))
4945 return binding
->value
;
4947 if (b
->kind
== sk_cleanup
)
4957 /* Wrapper for lookup_name_innermost_nonclass_level_1. */
4960 lookup_name_innermost_nonclass_level (tree name
)
4963 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
4964 ret
= lookup_name_innermost_nonclass_level_1 (name
);
4965 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
4970 /* Returns true iff DECL is a block-scope extern declaration of a function
4974 is_local_extern (tree decl
)
4976 cxx_binding
*binding
;
4978 /* For functions, this is easy. */
4979 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4980 return DECL_LOCAL_FUNCTION_P (decl
);
4982 if (TREE_CODE (decl
) != VAR_DECL
)
4984 if (!current_function_decl
)
4987 /* For variables, this is not easy. We need to look at the binding stack
4988 for the identifier to see whether the decl we have is a local. */
4989 for (binding
= IDENTIFIER_BINDING (DECL_NAME (decl
));
4990 binding
&& binding
->scope
->kind
!= sk_namespace
;
4991 binding
= binding
->previous
)
4992 if (binding
->value
== decl
)
4993 return LOCAL_BINDING_P (binding
);
4998 /* Like lookup_name_innermost_nonclass_level, but for types. */
5001 lookup_type_current_level (tree name
)
5005 timevar_start (TV_NAME_LOOKUP
);
5006 gcc_assert (current_binding_level
->kind
!= sk_namespace
);
5008 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
5009 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
5011 cp_binding_level
*b
= current_binding_level
;
5014 if (purpose_member (name
, b
->type_shadowed
))
5016 t
= REAL_IDENTIFIER_TYPE_VALUE (name
);
5019 if (b
->kind
== sk_cleanup
)
5026 timevar_stop (TV_NAME_LOOKUP
);
5030 /* [basic.lookup.koenig] */
5031 /* A nonzero return value in the functions below indicates an error. */
5036 vec
<tree
, va_gc
> *args
;
5037 vec
<tree
, va_gc
> *namespaces
;
5038 vec
<tree
, va_gc
> *classes
;
5040 struct pointer_set_t
*fn_set
;
5043 static bool arg_assoc (struct arg_lookup
*, tree
);
5044 static bool arg_assoc_args (struct arg_lookup
*, tree
);
5045 static bool arg_assoc_args_vec (struct arg_lookup
*, vec
<tree
, va_gc
> *);
5046 static bool arg_assoc_type (struct arg_lookup
*, tree
);
5047 static bool add_function (struct arg_lookup
*, tree
);
5048 static bool arg_assoc_namespace (struct arg_lookup
*, tree
);
5049 static bool arg_assoc_class_only (struct arg_lookup
*, tree
);
5050 static bool arg_assoc_bases (struct arg_lookup
*, tree
);
5051 static bool arg_assoc_class (struct arg_lookup
*, tree
);
5052 static bool arg_assoc_template_arg (struct arg_lookup
*, tree
);
5054 /* Add a function to the lookup structure.
5055 Returns true on error. */
5058 add_function (struct arg_lookup
*k
, tree fn
)
5060 if (!is_overloaded_fn (fn
))
5061 /* All names except those of (possibly overloaded) functions and
5062 function templates are ignored. */;
5063 else if (k
->fn_set
&& pointer_set_insert (k
->fn_set
, fn
))
5064 /* It's already in the list. */;
5065 else if (!k
->functions
)
5067 else if (fn
== k
->functions
)
5071 k
->functions
= build_overload (fn
, k
->functions
);
5072 if (TREE_CODE (k
->functions
) == OVERLOAD
)
5073 OVL_ARG_DEPENDENT (k
->functions
) = true;
5079 /* Returns true iff CURRENT has declared itself to be an associated
5080 namespace of SCOPE via a strong using-directive (or transitive chain
5081 thereof). Both are namespaces. */
5084 is_associated_namespace (tree current
, tree scope
)
5086 vec
<tree
, va_gc
> *seen
= make_tree_vector ();
5087 vec
<tree
, va_gc
> *todo
= make_tree_vector ();
5093 if (scope
== current
)
5098 vec_safe_push (seen
, scope
);
5099 for (t
= DECL_NAMESPACE_ASSOCIATIONS (scope
); t
; t
= TREE_CHAIN (t
))
5100 if (!vec_member (TREE_PURPOSE (t
), seen
))
5101 vec_safe_push (todo
, TREE_PURPOSE (t
));
5102 if (!todo
->is_empty ())
5104 scope
= todo
->last ();
5114 release_tree_vector (seen
);
5115 release_tree_vector (todo
);
5120 /* Add functions of a namespace to the lookup structure.
5121 Returns true on error. */
5124 arg_assoc_namespace (struct arg_lookup
*k
, tree scope
)
5128 if (vec_member (scope
, k
->namespaces
))
5130 vec_safe_push (k
->namespaces
, scope
);
5132 /* Check out our super-users. */
5133 for (value
= DECL_NAMESPACE_ASSOCIATIONS (scope
); value
;
5134 value
= TREE_CHAIN (value
))
5135 if (arg_assoc_namespace (k
, TREE_PURPOSE (value
)))
5138 /* Also look down into inline namespaces. */
5139 for (value
= DECL_NAMESPACE_USING (scope
); value
;
5140 value
= TREE_CHAIN (value
))
5141 if (is_associated_namespace (scope
, TREE_PURPOSE (value
)))
5142 if (arg_assoc_namespace (k
, TREE_PURPOSE (value
)))
5145 value
= namespace_binding (k
->name
, scope
);
5149 for (; value
; value
= OVL_NEXT (value
))
5151 /* We don't want to find arbitrary hidden functions via argument
5152 dependent lookup. We only want to find friends of associated
5153 classes, which we'll do via arg_assoc_class. */
5154 if (hidden_name_p (OVL_CURRENT (value
)))
5157 if (add_function (k
, OVL_CURRENT (value
)))
5164 /* Adds everything associated with a template argument to the lookup
5165 structure. Returns true on error. */
5168 arg_assoc_template_arg (struct arg_lookup
*k
, tree arg
)
5170 /* [basic.lookup.koenig]
5172 If T is a template-id, its associated namespaces and classes are
5173 ... the namespaces and classes associated with the types of the
5174 template arguments provided for template type parameters
5175 (excluding template template parameters); the namespaces in which
5176 any template template arguments are defined; and the classes in
5177 which any member templates used as template template arguments
5178 are defined. [Note: non-type template arguments do not
5179 contribute to the set of associated namespaces. ] */
5181 /* Consider first template template arguments. */
5182 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
5183 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
5185 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
5187 tree ctx
= CP_DECL_CONTEXT (arg
);
5189 /* It's not a member template. */
5190 if (TREE_CODE (ctx
) == NAMESPACE_DECL
)
5191 return arg_assoc_namespace (k
, ctx
);
5192 /* Otherwise, it must be member template. */
5194 return arg_assoc_class_only (k
, ctx
);
5196 /* It's an argument pack; handle it recursively. */
5197 else if (ARGUMENT_PACK_P (arg
))
5199 tree args
= ARGUMENT_PACK_ARGS (arg
);
5200 int i
, len
= TREE_VEC_LENGTH (args
);
5201 for (i
= 0; i
< len
; ++i
)
5202 if (arg_assoc_template_arg (k
, TREE_VEC_ELT (args
, i
)))
5207 /* It's not a template template argument, but it is a type template
5209 else if (TYPE_P (arg
))
5210 return arg_assoc_type (k
, arg
);
5211 /* It's a non-type template argument. */
5216 /* Adds the class and its friends to the lookup structure.
5217 Returns true on error. */
5220 arg_assoc_class_only (struct arg_lookup
*k
, tree type
)
5222 tree list
, friends
, context
;
5224 /* Backend-built structures, such as __builtin_va_list, aren't
5225 affected by all this. */
5226 if (!CLASS_TYPE_P (type
))
5229 context
= decl_namespace_context (type
);
5230 if (arg_assoc_namespace (k
, context
))
5233 complete_type (type
);
5235 /* Process friends. */
5236 for (list
= DECL_FRIENDLIST (TYPE_MAIN_DECL (type
)); list
;
5237 list
= TREE_CHAIN (list
))
5238 if (k
->name
== FRIEND_NAME (list
))
5239 for (friends
= FRIEND_DECLS (list
); friends
;
5240 friends
= TREE_CHAIN (friends
))
5242 tree fn
= TREE_VALUE (friends
);
5244 /* Only interested in global functions with potentially hidden
5245 (i.e. unqualified) declarations. */
5246 if (CP_DECL_CONTEXT (fn
) != context
)
5248 /* Template specializations are never found by name lookup.
5249 (Templates themselves can be found, but not template
5250 specializations.) */
5251 if (TREE_CODE (fn
) == FUNCTION_DECL
&& DECL_USE_TEMPLATE (fn
))
5253 if (add_function (k
, fn
))
5260 /* Adds the class and its bases to the lookup structure.
5261 Returns true on error. */
5264 arg_assoc_bases (struct arg_lookup
*k
, tree type
)
5266 if (arg_assoc_class_only (k
, type
))
5269 if (TYPE_BINFO (type
))
5271 /* Process baseclasses. */
5272 tree binfo
, base_binfo
;
5275 for (binfo
= TYPE_BINFO (type
), i
= 0;
5276 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
5277 if (arg_assoc_bases (k
, BINFO_TYPE (base_binfo
)))
5284 /* Adds everything associated with a class argument type to the lookup
5285 structure. Returns true on error.
5287 If T is a class type (including unions), its associated classes are: the
5288 class itself; the class of which it is a member, if any; and its direct
5289 and indirect base classes. Its associated namespaces are the namespaces
5290 of which its associated classes are members. Furthermore, if T is a
5291 class template specialization, its associated namespaces and classes
5292 also include: the namespaces and classes associated with the types of
5293 the template arguments provided for template type parameters (excluding
5294 template template parameters); the namespaces of which any template
5295 template arguments are members; and the classes of which any member
5296 templates used as template template arguments are members. [ Note:
5297 non-type template arguments do not contribute to the set of associated
5298 namespaces. --end note] */
5301 arg_assoc_class (struct arg_lookup
*k
, tree type
)
5306 /* Backend build structures, such as __builtin_va_list, aren't
5307 affected by all this. */
5308 if (!CLASS_TYPE_P (type
))
5311 if (vec_member (type
, k
->classes
))
5313 vec_safe_push (k
->classes
, type
);
5315 if (TYPE_CLASS_SCOPE_P (type
)
5316 && arg_assoc_class_only (k
, TYPE_CONTEXT (type
)))
5319 if (arg_assoc_bases (k
, type
))
5322 /* Process template arguments. */
5323 if (CLASSTYPE_TEMPLATE_INFO (type
)
5324 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
5326 list
= INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
5327 for (i
= 0; i
< TREE_VEC_LENGTH (list
); ++i
)
5328 if (arg_assoc_template_arg (k
, TREE_VEC_ELT (list
, i
)))
5335 /* Adds everything associated with a given type.
5336 Returns 1 on error. */
5339 arg_assoc_type (struct arg_lookup
*k
, tree type
)
5341 /* As we do not get the type of non-type dependent expressions
5342 right, we can end up with such things without a type. */
5346 if (TYPE_PTRDATAMEM_P (type
))
5348 /* Pointer to member: associate class type and value type. */
5349 if (arg_assoc_type (k
, TYPE_PTRMEM_CLASS_TYPE (type
)))
5351 return arg_assoc_type (k
, TYPE_PTRMEM_POINTED_TO_TYPE (type
));
5353 else switch (TREE_CODE (type
))
5363 case FIXED_POINT_TYPE
:
5368 if (TYPE_PTRMEMFUNC_P (type
))
5369 return arg_assoc_type (k
, TYPE_PTRMEMFUNC_FN_TYPE (type
));
5371 return arg_assoc_class (k
, type
);
5373 case REFERENCE_TYPE
:
5375 return arg_assoc_type (k
, TREE_TYPE (type
));
5377 if (TYPE_CLASS_SCOPE_P (type
)
5378 && arg_assoc_class_only (k
, TYPE_CONTEXT (type
)))
5380 return arg_assoc_namespace (k
, decl_namespace_context (type
));
5382 /* The basetype is referenced in the first arg type, so just
5385 /* Associate the parameter types. */
5386 if (arg_assoc_args (k
, TYPE_ARG_TYPES (type
)))
5388 /* Associate the return type. */
5389 return arg_assoc_type (k
, TREE_TYPE (type
));
5390 case TEMPLATE_TYPE_PARM
:
5391 case BOUND_TEMPLATE_TEMPLATE_PARM
:
5396 gcc_assert (type
== unknown_type_node
5397 || type
== init_list_type_node
);
5399 case TYPE_PACK_EXPANSION
:
5400 return arg_assoc_type (k
, PACK_EXPANSION_PATTERN (type
));
5408 /* Adds everything associated with arguments. Returns true on error. */
5411 arg_assoc_args (struct arg_lookup
*k
, tree args
)
5413 for (; args
; args
= TREE_CHAIN (args
))
5414 if (arg_assoc (k
, TREE_VALUE (args
)))
5419 /* Adds everything associated with an argument vector. Returns true
5423 arg_assoc_args_vec (struct arg_lookup
*k
, vec
<tree
, va_gc
> *args
)
5428 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
5429 if (arg_assoc (k
, arg
))
5434 /* Adds everything associated with a given tree_node. Returns 1 on error. */
5437 arg_assoc (struct arg_lookup
*k
, tree n
)
5439 if (n
== error_mark_node
)
5443 return arg_assoc_type (k
, n
);
5445 if (! type_unknown_p (n
))
5446 return arg_assoc_type (k
, TREE_TYPE (n
));
5448 if (TREE_CODE (n
) == ADDR_EXPR
)
5449 n
= TREE_OPERAND (n
, 0);
5450 if (TREE_CODE (n
) == COMPONENT_REF
)
5451 n
= TREE_OPERAND (n
, 1);
5452 if (TREE_CODE (n
) == OFFSET_REF
)
5453 n
= TREE_OPERAND (n
, 1);
5454 while (TREE_CODE (n
) == TREE_LIST
)
5457 n
= BASELINK_FUNCTIONS (n
);
5459 if (TREE_CODE (n
) == FUNCTION_DECL
)
5460 return arg_assoc_type (k
, TREE_TYPE (n
));
5461 if (TREE_CODE (n
) == TEMPLATE_ID_EXPR
)
5463 /* The working paper doesn't currently say how to handle template-id
5464 arguments. The sensible thing would seem to be to handle the list
5465 of template candidates like a normal overload set, and handle the
5466 template arguments like we do for class template
5468 tree templ
= TREE_OPERAND (n
, 0);
5469 tree args
= TREE_OPERAND (n
, 1);
5472 /* First the templates. */
5473 if (arg_assoc (k
, templ
))
5476 /* Now the arguments. */
5478 for (ix
= TREE_VEC_LENGTH (args
); ix
--;)
5479 if (arg_assoc_template_arg (k
, TREE_VEC_ELT (args
, ix
)) == 1)
5482 else if (TREE_CODE (n
) == OVERLOAD
)
5484 for (; n
; n
= OVL_NEXT (n
))
5485 if (arg_assoc_type (k
, TREE_TYPE (OVL_CURRENT (n
))))
5492 /* Performs Koenig lookup depending on arguments, where fns
5493 are the functions found in normal lookup. */
5496 lookup_arg_dependent_1 (tree name
, tree fns
, vec
<tree
, va_gc
> *args
,
5499 struct arg_lookup k
;
5501 /* Remove any hidden friend functions from the list of functions
5502 found so far. They will be added back by arg_assoc_class as
5504 fns
= remove_hidden_names (fns
);
5509 k
.classes
= make_tree_vector ();
5511 /* We previously performed an optimization here by setting
5512 NAMESPACES to the current namespace when it was safe. However, DR
5513 164 says that namespaces that were already searched in the first
5514 stage of template processing are searched again (potentially
5515 picking up later definitions) in the second stage. */
5516 k
.namespaces
= make_tree_vector ();
5518 /* We used to allow duplicates and let joust discard them, but
5519 since the above change for DR 164 we end up with duplicates of
5520 all the functions found by unqualified lookup. So keep track
5521 of which ones we've seen. */
5525 /* We shouldn't be here if lookup found something other than
5526 namespace-scope functions. */
5527 gcc_assert (DECL_NAMESPACE_SCOPE_P (OVL_CURRENT (fns
)));
5528 k
.fn_set
= pointer_set_create ();
5529 for (ovl
= fns
; ovl
; ovl
= OVL_NEXT (ovl
))
5530 pointer_set_insert (k
.fn_set
, OVL_CURRENT (ovl
));
5536 arg_assoc_namespace (&k
, std_node
);
5537 arg_assoc_args_vec (&k
, args
);
5542 && TREE_CODE (fns
) != VAR_DECL
5543 && !is_overloaded_fn (fns
))
5545 error ("argument dependent lookup finds %q+D", fns
);
5546 error (" in call to %qD", name
);
5547 fns
= error_mark_node
;
5550 release_tree_vector (k
.classes
);
5551 release_tree_vector (k
.namespaces
);
5553 pointer_set_destroy (k
.fn_set
);
5558 /* Wrapper for lookup_arg_dependent_1. */
5561 lookup_arg_dependent (tree name
, tree fns
, vec
<tree
, va_gc
> *args
,
5566 subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
5567 ret
= lookup_arg_dependent_1 (name
, fns
, args
, include_std
);
5568 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
5573 /* Add namespace to using_directives. Return NULL_TREE if nothing was
5574 changed (i.e. there was already a directive), or the fresh
5575 TREE_LIST otherwise. */
5578 push_using_directive_1 (tree used
)
5580 tree ud
= current_binding_level
->using_directives
;
5581 tree iter
, ancestor
;
5583 /* Check if we already have this. */
5584 if (purpose_member (used
, ud
) != NULL_TREE
)
5587 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
5588 ud
= current_binding_level
->using_directives
;
5589 ud
= tree_cons (used
, ancestor
, ud
);
5590 current_binding_level
->using_directives
= ud
;
5592 /* Recursively add all namespaces used. */
5593 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
5594 push_using_directive (TREE_PURPOSE (iter
));
5599 /* Wrapper for push_using_directive_1. */
5602 push_using_directive (tree used
)
5605 timevar_start (TV_NAME_LOOKUP
);
5606 ret
= push_using_directive_1 (used
);
5607 timevar_stop (TV_NAME_LOOKUP
);
5611 /* The type TYPE is being declared. If it is a class template, or a
5612 specialization of a class template, do any processing required and
5613 perform error-checking. If IS_FRIEND is nonzero, this TYPE is
5614 being declared a friend. B is the binding level at which this TYPE
5617 Returns the TYPE_DECL for TYPE, which may have been altered by this
5621 maybe_process_template_type_declaration (tree type
, int is_friend
,
5622 cp_binding_level
*b
)
5624 tree decl
= TYPE_NAME (type
);
5626 if (processing_template_parmlist
)
5627 /* You can't declare a new template type in a template parameter
5628 list. But, you can declare a non-template type:
5630 template <class A*> struct S;
5632 is a forward-declaration of `A'. */
5634 else if (b
->kind
== sk_namespace
5635 && current_binding_level
->kind
!= sk_namespace
)
5636 /* If this new type is being injected into a containing scope,
5637 then it's not a template type. */
5641 gcc_assert (MAYBE_CLASS_TYPE_P (type
)
5642 || TREE_CODE (type
) == ENUMERAL_TYPE
);
5644 if (processing_template_decl
)
5646 /* This may change after the call to
5647 push_template_decl_real, but we want the original value. */
5648 tree name
= DECL_NAME (decl
);
5650 decl
= push_template_decl_real (decl
, is_friend
);
5651 if (decl
== error_mark_node
)
5652 return error_mark_node
;
5654 /* If the current binding level is the binding level for the
5655 template parameters (see the comment in
5656 begin_template_parm_list) and the enclosing level is a class
5657 scope, and we're not looking at a friend, push the
5658 declaration of the member class into the class scope. In the
5659 friend case, push_template_decl will already have put the
5660 friend into global scope, if appropriate. */
5661 if (TREE_CODE (type
) != ENUMERAL_TYPE
5662 && !is_friend
&& b
->kind
== sk_template_parms
5663 && b
->level_chain
->kind
== sk_class
)
5665 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
5667 if (!COMPLETE_TYPE_P (current_class_type
))
5669 maybe_add_class_template_decl_list (current_class_type
,
5670 type
, /*friend_p=*/0);
5671 /* Put this UTD in the table of UTDs for the class. */
5672 if (CLASSTYPE_NESTED_UTDS (current_class_type
) == NULL
)
5673 CLASSTYPE_NESTED_UTDS (current_class_type
) =
5674 binding_table_new (SCOPE_DEFAULT_HT_SIZE
);
5676 binding_table_insert
5677 (CLASSTYPE_NESTED_UTDS (current_class_type
), name
, type
);
5686 /* Push a tag name NAME for struct/class/union/enum type TYPE. In case
5687 that the NAME is a class template, the tag is processed but not pushed.
5689 The pushed scope depend on the SCOPE parameter:
5690 - When SCOPE is TS_CURRENT, put it into the inner-most non-sk_cleanup
5692 - When SCOPE is TS_GLOBAL, put it in the inner-most non-class and
5693 non-template-parameter scope. This case is needed for forward
5695 - When SCOPE is TS_WITHIN_ENCLOSING_NON_CLASS, this is similar to
5696 TS_GLOBAL case except that names within template-parameter scopes
5697 are not pushed at all.
5699 Returns TYPE upon success and ERROR_MARK_NODE otherwise. */
5702 pushtag_1 (tree name
, tree type
, tag_scope scope
)
5704 cp_binding_level
*b
;
5707 b
= current_binding_level
;
5708 while (/* Cleanup scopes are not scopes from the point of view of
5710 b
->kind
== sk_cleanup
5711 /* Neither are function parameter scopes. */
5712 || b
->kind
== sk_function_parms
5713 /* Neither are the scopes used to hold template parameters
5714 for an explicit specialization. For an ordinary template
5715 declaration, these scopes are not scopes from the point of
5716 view of the language. */
5717 || (b
->kind
== sk_template_parms
5718 && (b
->explicit_spec_p
|| scope
== ts_global
))
5719 || (b
->kind
== sk_class
5720 && (scope
!= ts_current
5721 /* We may be defining a new type in the initializer
5722 of a static member variable. We allow this when
5723 not pedantic, and it is particularly useful for
5724 type punning via an anonymous union. */
5725 || COMPLETE_TYPE_P (b
->this_entity
))))
5728 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
);
5730 /* Do C++ gratuitous typedefing. */
5731 if (identifier_type_value_1 (name
) != type
)
5735 tree context
= TYPE_CONTEXT (type
);
5739 tree cs
= current_scope ();
5741 if (scope
== ts_current
5742 || (cs
&& TREE_CODE (cs
) == FUNCTION_DECL
))
5744 else if (cs
!= NULL_TREE
&& TYPE_P (cs
))
5745 /* When declaring a friend class of a local class, we want
5746 to inject the newly named class into the scope
5747 containing the local class, not the namespace
5749 context
= decl_function_context (get_type_decl (cs
));
5752 context
= current_namespace
;
5754 if (b
->kind
== sk_class
5755 || (b
->kind
== sk_template_parms
5756 && b
->level_chain
->kind
== sk_class
))
5759 if (current_lang_name
== lang_name_java
)
5760 TYPE_FOR_JAVA (type
) = 1;
5762 tdef
= create_implicit_typedef (name
, type
);
5763 DECL_CONTEXT (tdef
) = FROB_CONTEXT (context
);
5764 if (scope
== ts_within_enclosing_non_class
)
5766 /* This is a friend. Make this TYPE_DECL node hidden from
5767 ordinary name lookup. Its corresponding TEMPLATE_DECL
5768 will be marked in push_template_decl_real. */
5769 retrofit_lang_decl (tdef
);
5770 DECL_ANTICIPATED (tdef
) = 1;
5771 DECL_FRIEND_P (tdef
) = 1;
5774 decl
= maybe_process_template_type_declaration
5775 (type
, scope
== ts_within_enclosing_non_class
, b
);
5776 if (decl
== error_mark_node
)
5779 if (b
->kind
== sk_class
)
5781 if (!TYPE_BEING_DEFINED (current_class_type
))
5782 return error_mark_node
;
5784 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
5785 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
5786 class. But if it's a member template class, we want
5787 the TEMPLATE_DECL, not the TYPE_DECL, so this is done
5789 finish_member_declaration (decl
);
5791 pushdecl_class_level (decl
);
5793 else if (b
->kind
!= sk_template_parms
)
5795 decl
= pushdecl_with_scope_1 (decl
, b
, /*is_friend=*/false);
5796 if (decl
== error_mark_node
)
5801 set_identifier_type_value_with_scope (name
, tdef
, b
);
5803 TYPE_CONTEXT (type
) = DECL_CONTEXT (decl
);
5805 /* If this is a local class, keep track of it. We need this
5806 information for name-mangling, and so that it is possible to
5807 find all function definitions in a translation unit in a
5808 convenient way. (It's otherwise tricky to find a member
5809 function definition it's only pointed to from within a local
5811 if (TYPE_CONTEXT (type
)
5812 && TREE_CODE (TYPE_CONTEXT (type
)) == FUNCTION_DECL
)
5814 if (processing_template_decl
)
5816 /* Push a DECL_EXPR so we call pushtag at the right time in
5817 template instantiation rather than in some nested context. */
5818 add_decl_expr (decl
);
5821 vec_safe_push (local_classes
, type
);
5824 if (b
->kind
== sk_class
5825 && !COMPLETE_TYPE_P (current_class_type
))
5827 maybe_add_class_template_decl_list (current_class_type
,
5828 type
, /*friend_p=*/0);
5830 if (CLASSTYPE_NESTED_UTDS (current_class_type
) == NULL
)
5831 CLASSTYPE_NESTED_UTDS (current_class_type
)
5832 = binding_table_new (SCOPE_DEFAULT_HT_SIZE
);
5834 binding_table_insert
5835 (CLASSTYPE_NESTED_UTDS (current_class_type
), name
, type
);
5838 decl
= TYPE_NAME (type
);
5839 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
5841 /* Set type visibility now if this is a forward declaration. */
5842 TREE_PUBLIC (decl
) = 1;
5843 determine_visibility (decl
);
5848 /* Wrapper for pushtag_1. */
5851 pushtag (tree name
, tree type
, tag_scope scope
)
5854 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
5855 ret
= pushtag_1 (name
, type
, scope
);
5856 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
5860 /* Subroutines for reverting temporarily to top-level for instantiation
5861 of templates and such. We actually need to clear out the class- and
5862 local-value slots of all identifiers, so that only the global values
5863 are at all visible. Simply setting current_binding_level to the global
5864 scope isn't enough, because more binding levels may be pushed. */
5865 struct saved_scope
*scope_chain
;
5867 /* Return true if ID has not already been marked. */
5870 store_binding_p (tree id
)
5872 if (!id
|| !IDENTIFIER_BINDING (id
))
5875 if (IDENTIFIER_MARKED (id
))
5881 /* Add an appropriate binding to *OLD_BINDINGS which needs to already
5882 have enough space reserved. */
5885 store_binding (tree id
, vec
<cxx_saved_binding
, va_gc
> **old_bindings
)
5887 cxx_saved_binding saved
;
5889 gcc_checking_assert (store_binding_p (id
));
5891 IDENTIFIER_MARKED (id
) = 1;
5893 saved
.identifier
= id
;
5894 saved
.binding
= IDENTIFIER_BINDING (id
);
5895 saved
.real_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
5896 (*old_bindings
)->quick_push (saved
);
5897 IDENTIFIER_BINDING (id
) = NULL
;
5901 store_bindings (tree names
, vec
<cxx_saved_binding
, va_gc
> **old_bindings
)
5903 static vec
<tree
> bindings_need_stored
= vNULL
;
5907 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
5908 for (t
= names
; t
; t
= TREE_CHAIN (t
))
5910 if (TREE_CODE (t
) == TREE_LIST
)
5911 id
= TREE_PURPOSE (t
);
5915 if (store_binding_p (id
))
5916 bindings_need_stored
.safe_push (id
);
5918 if (!bindings_need_stored
.is_empty ())
5920 vec_safe_reserve_exact (*old_bindings
, bindings_need_stored
.length ());
5921 for (i
= 0; bindings_need_stored
.iterate (i
, &id
); ++i
)
5923 /* We can appearantly have duplicates in NAMES. */
5924 if (store_binding_p (id
))
5925 store_binding (id
, old_bindings
);
5927 bindings_need_stored
.truncate (0);
5929 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
5932 /* Like store_bindings, but NAMES is a vector of cp_class_binding
5933 objects, rather than a TREE_LIST. */
5936 store_class_bindings (vec
<cp_class_binding
, va_gc
> *names
,
5937 vec
<cxx_saved_binding
, va_gc
> **old_bindings
)
5939 static vec
<tree
> bindings_need_stored
= vNULL
;
5941 cp_class_binding
*cb
;
5943 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
5944 for (i
= 0; vec_safe_iterate (names
, i
, &cb
); ++i
)
5945 if (store_binding_p (cb
->identifier
))
5946 bindings_need_stored
.safe_push (cb
->identifier
);
5947 if (!bindings_need_stored
.is_empty ())
5950 vec_safe_reserve_exact (*old_bindings
, bindings_need_stored
.length ());
5951 for (i
= 0; bindings_need_stored
.iterate (i
, &id
); ++i
)
5952 store_binding (id
, old_bindings
);
5953 bindings_need_stored
.truncate (0);
5955 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
5959 push_to_top_level (void)
5961 struct saved_scope
*s
;
5962 cp_binding_level
*b
;
5963 cxx_saved_binding
*sb
;
5967 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
5968 s
= ggc_alloc_cleared_saved_scope ();
5970 b
= scope_chain
? current_binding_level
: 0;
5972 /* If we're in the middle of some function, save our state. */
5976 push_function_context ();
5981 if (scope_chain
&& previous_class_level
)
5982 store_class_bindings (previous_class_level
->class_shadowed
,
5985 /* Have to include the global scope, because class-scope decls
5986 aren't listed anywhere useful. */
5987 for (; b
; b
= b
->level_chain
)
5991 /* Template IDs are inserted into the global level. If they were
5992 inserted into namespace level, finish_file wouldn't find them
5993 when doing pending instantiations. Therefore, don't stop at
5994 namespace level, but continue until :: . */
5995 if (global_scope_p (b
))
5998 store_bindings (b
->names
, &s
->old_bindings
);
5999 /* We also need to check class_shadowed to save class-level type
6000 bindings, since pushclass doesn't fill in b->names. */
6001 if (b
->kind
== sk_class
)
6002 store_class_bindings (b
->class_shadowed
, &s
->old_bindings
);
6004 /* Unwind type-value slots back to top level. */
6005 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
6006 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
6009 FOR_EACH_VEC_SAFE_ELT (s
->old_bindings
, i
, sb
)
6010 IDENTIFIER_MARKED (sb
->identifier
) = 0;
6012 s
->prev
= scope_chain
;
6014 s
->need_pop_function_context
= need_pop
;
6015 s
->function_decl
= current_function_decl
;
6016 s
->unevaluated_operand
= cp_unevaluated_operand
;
6017 s
->inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
6018 s
->x_stmt_tree
.stmts_are_full_exprs_p
= true;
6021 current_function_decl
= NULL_TREE
;
6022 vec_alloc (current_lang_base
, 10);
6023 current_lang_name
= lang_name_cplusplus
;
6024 current_namespace
= global_namespace
;
6025 push_class_stack ();
6026 cp_unevaluated_operand
= 0;
6027 c_inhibit_evaluation_warnings
= 0;
6028 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
6032 pop_from_top_level_1 (void)
6034 struct saved_scope
*s
= scope_chain
;
6035 cxx_saved_binding
*saved
;
6038 /* Clear out class-level bindings cache. */
6039 if (previous_class_level
)
6040 invalidate_class_lookup_cache ();
6043 current_lang_base
= 0;
6045 scope_chain
= s
->prev
;
6046 FOR_EACH_VEC_SAFE_ELT (s
->old_bindings
, i
, saved
)
6048 tree id
= saved
->identifier
;
6050 IDENTIFIER_BINDING (id
) = saved
->binding
;
6051 SET_IDENTIFIER_TYPE_VALUE (id
, saved
->real_type_value
);
6054 /* If we were in the middle of compiling a function, restore our
6056 if (s
->need_pop_function_context
)
6057 pop_function_context ();
6058 current_function_decl
= s
->function_decl
;
6059 cp_unevaluated_operand
= s
->unevaluated_operand
;
6060 c_inhibit_evaluation_warnings
= s
->inhibit_evaluation_warnings
;
6063 /* Wrapper for pop_from_top_level_1. */
6066 pop_from_top_level (void)
6068 bool subtime
= timevar_cond_start (TV_NAME_LOOKUP
);
6069 pop_from_top_level_1 ();
6070 timevar_cond_stop (TV_NAME_LOOKUP
, subtime
);
6074 /* Pop off extraneous binding levels left over due to syntax errors.
6076 We don't pop past namespaces, as they might be valid. */
6079 pop_everything (void)
6081 if (ENABLE_SCOPE_CHECKING
)
6082 verbatim ("XXX entering pop_everything ()\n");
6083 while (!toplevel_bindings_p ())
6085 if (current_binding_level
->kind
== sk_class
)
6086 pop_nested_class ();
6090 if (ENABLE_SCOPE_CHECKING
)
6091 verbatim ("XXX leaving pop_everything ()\n");
6094 /* Emit debugging information for using declarations and directives.
6095 If input tree is overloaded fn then emit debug info for all
6099 cp_emit_debug_info_for_using (tree t
, tree context
)
6101 /* Don't try to emit any debug information if we have errors. */
6105 /* Ignore this FUNCTION_DECL if it refers to a builtin declaration
6106 of a builtin function. */
6107 if (TREE_CODE (t
) == FUNCTION_DECL
6108 && DECL_EXTERNAL (t
)
6109 && DECL_BUILT_IN (t
))
6112 /* Do not supply context to imported_module_or_decl, if
6113 it is a global namespace. */
6114 if (context
== global_namespace
)
6115 context
= NULL_TREE
;
6118 t
= BASELINK_FUNCTIONS (t
);
6120 /* FIXME: Handle TEMPLATE_DECLs. */
6121 for (t
= OVL_CURRENT (t
); t
; t
= OVL_NEXT (t
))
6122 if (TREE_CODE (t
) != TEMPLATE_DECL
)
6124 if (building_stmt_list_p ())
6125 add_stmt (build_stmt (input_location
, USING_STMT
, t
));
6127 (*debug_hooks
->imported_module_or_decl
) (t
, NULL_TREE
, context
, false);
6131 #include "gt-cp-name-lookup.h"