1 /* Definitions for C++ name lookup routines.
2 Copyright (C) 2003-2024 Free Software Foundation, Inc.
3 Contributed by Gabriel Dos Reis <gdr@integrable-solutions.net>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
22 #define INCLUDE_MEMORY
24 #include "coretypes.h"
27 #include "stringpool.h"
28 #include "print-tree.h"
31 #include "c-family/c-pragma.h"
32 #include "gcc-rich-location.h"
33 #include "spellcheck-tree.h"
35 #include "c-family/name-hint.h"
36 #include "c-family/known-headers.h"
37 #include "c-family/c-spellcheck.h"
40 static cxx_binding
*cxx_binding_make (tree value
, tree type
);
41 static cp_binding_level
*innermost_nonclass_level (void);
42 static void set_identifier_type_value_with_scope (tree id
, tree decl
,
44 static name_hint
maybe_suggest_missing_std_header (location_t location
,
46 static name_hint
suggest_alternatives_for_1 (location_t location
, tree name
,
47 bool suggest_misspellings
);
49 /* Slots in BINDING_VECTOR. */
52 BINDING_SLOT_CURRENT
, /* Slot for current TU. */
53 BINDING_SLOT_GLOBAL
, /* Slot for merged global module. */
54 BINDING_SLOT_PARTITION
, /* Slot for merged partition entities
57 /* Number of always-allocated slots. */
58 BINDING_SLOTS_FIXED
= BINDING_SLOT_GLOBAL
+ 1
61 /* Create an overload suitable for recording an artificial TYPE_DECL
62 and another decl. We use this machanism to implement the struct
65 #define STAT_HACK_P(N) ((N) && TREE_CODE (N) == OVERLOAD && OVL_LOOKUP_P (N))
66 #define STAT_TYPE_VISIBLE_P(N) TREE_USED (OVERLOAD_CHECK (N))
67 #define STAT_TYPE(N) TREE_TYPE (N)
68 #define STAT_DECL(N) OVL_FUNCTION (N)
69 #define STAT_VISIBLE(N) OVL_CHAIN (N)
70 #define MAYBE_STAT_DECL(N) (STAT_HACK_P (N) ? STAT_DECL (N) : N)
71 #define MAYBE_STAT_TYPE(N) (STAT_HACK_P (N) ? STAT_TYPE (N) : NULL_TREE)
73 /* When a STAT_HACK_P is true, OVL_USING_P and OVL_EXPORT_P are valid
74 and apply to the hacked type. */
76 /* For regular (maybe) overloaded functions, we have OVL_HIDDEN_P.
77 But we also need to indicate hiddenness on implicit type decls
78 (injected friend classes), and (coming soon) decls injected from
79 block-scope externs. It is too awkward to press the existing
80 overload marking for that. If we have a hidden non-function, we
81 always create a STAT_HACK, and use these two markers as needed. */
82 #define STAT_TYPE_HIDDEN_P(N) OVL_HIDDEN_P (N)
83 #define STAT_DECL_HIDDEN_P(N) OVL_DEDUP_P (N)
85 /* Create a STAT_HACK node with DECL as the value binding and TYPE as
89 stat_hack (tree decl
= NULL_TREE
, tree type
= NULL_TREE
)
91 tree result
= make_node (OVERLOAD
);
93 /* Mark this as a lookup, so we can tell this is a stat hack. */
94 OVL_LOOKUP_P (result
) = true;
95 STAT_DECL (result
) = decl
;
96 STAT_TYPE (result
) = type
;
100 /* Create a local binding level for NAME. */
103 create_local_binding (cp_binding_level
*level
, tree name
)
105 cxx_binding
*binding
= cxx_binding_make (NULL
, NULL
);
107 LOCAL_BINDING_P (binding
) = true;
108 binding
->scope
= level
;
109 binding
->previous
= IDENTIFIER_BINDING (name
);
111 IDENTIFIER_BINDING (name
) = binding
;
116 /* Find the binding for NAME in namespace NS. If CREATE_P is true,
117 make an empty binding if there wasn't one. */
120 find_namespace_slot (tree ns
, tree name
, bool create_p
= false)
122 tree
*slot
= DECL_NAMESPACE_BINDINGS (ns
)
123 ->find_slot_with_hash (name
, name
? IDENTIFIER_HASH_VALUE (name
) : 0,
124 create_p
? INSERT
: NO_INSERT
);
129 find_namespace_value (tree ns
, tree name
)
131 tree
*b
= find_namespace_slot (ns
, name
);
133 return b
? MAYBE_STAT_DECL (*b
) : NULL_TREE
;
136 /* Look in *SLOT for a the binding of NAME in imported module IX.
137 Returns pointer to binding's slot, or NULL if not found. Does a
138 binary search, as this is mainly used for random access during
139 importing. Do not use for the fixed slots. */
141 static binding_slot
*
142 search_imported_binding_slot (tree
*slot
, unsigned ix
)
149 if (TREE_CODE (*slot
) != BINDING_VECTOR
)
152 unsigned clusters
= BINDING_VECTOR_NUM_CLUSTERS (*slot
);
153 binding_cluster
*cluster
= BINDING_VECTOR_CLUSTER_BASE (*slot
);
155 if (BINDING_VECTOR_SLOTS_PER_CLUSTER
== BINDING_SLOTS_FIXED
)
163 unsigned half
= clusters
/ 2;
164 gcc_checking_assert (cluster
[half
].indices
[0].span
);
165 if (cluster
[half
].indices
[0].base
> ix
)
175 /* Is it in this cluster? */
176 for (unsigned off
= 0; off
!= BINDING_VECTOR_SLOTS_PER_CLUSTER
; off
++)
178 if (!cluster
->indices
[off
].span
)
180 if (cluster
->indices
[off
].base
> ix
)
183 if (cluster
->indices
[off
].base
+ cluster
->indices
[off
].span
> ix
)
184 return &cluster
->slots
[off
];
191 init_global_partition (binding_cluster
*cluster
, tree decl
)
195 if (header_module_p ())
197 else if (TREE_PUBLIC (decl
)
198 && TREE_CODE (decl
) == NAMESPACE_DECL
199 && !DECL_NAMESPACE_ALIAS (decl
))
201 else if (!get_originating_module (decl
))
206 mslot
= &cluster
[BINDING_SLOT_PARTITION
207 / BINDING_VECTOR_SLOTS_PER_CLUSTER
]
208 .slots
[BINDING_SLOT_PARTITION
209 % BINDING_VECTOR_SLOTS_PER_CLUSTER
];
211 mslot
= &cluster
[0].slots
[BINDING_SLOT_GLOBAL
];
214 decl
= ovl_make (decl
, *mslot
);
217 if (TREE_CODE (decl
) == CONST_DECL
)
219 tree type
= TREE_TYPE (decl
);
220 if (TREE_CODE (type
) == ENUMERAL_TYPE
221 && IDENTIFIER_ANON_P (DECL_NAME (TYPE_NAME (type
)))
222 && decl
== TREE_VALUE (TYPE_VALUES (type
)))
223 /* Anonymous enums are keyed by their first enumerator, put
224 the TYPE_DECL here too. */
225 *mslot
= ovl_make (TYPE_NAME (type
), *mslot
);
229 /* Get the fixed binding slot IX. Creating the vector if CREATE is
230 non-zero. If CREATE is < 0, make sure there is at least 1 spare
231 slot for an import. (It is an error for CREATE < 0 and the slot to
235 get_fixed_binding_slot (tree
*slot
, tree name
, unsigned ix
, int create
)
237 gcc_checking_assert (ix
<= BINDING_SLOT_PARTITION
);
239 /* An assumption is that the fixed slots all reside in one cluster. */
240 gcc_checking_assert (BINDING_VECTOR_SLOTS_PER_CLUSTER
>= BINDING_SLOTS_FIXED
);
242 if (!*slot
|| TREE_CODE (*slot
) != BINDING_VECTOR
)
244 if (ix
== BINDING_SLOT_CURRENT
)
245 /* The current TU can just use slot directly. */
251 /* The partition slot is only needed when we're a named
253 bool partition_slot
= named_module_p ();
254 unsigned want
= ((BINDING_SLOTS_FIXED
+ partition_slot
+ (create
< 0)
255 + BINDING_VECTOR_SLOTS_PER_CLUSTER
- 1)
256 / BINDING_VECTOR_SLOTS_PER_CLUSTER
);
257 tree new_vec
= make_binding_vec (name
, want
);
258 BINDING_VECTOR_NUM_CLUSTERS (new_vec
) = want
;
259 binding_cluster
*cluster
= BINDING_VECTOR_CLUSTER_BASE (new_vec
);
261 /* Initialize the fixed slots. */
262 for (unsigned jx
= BINDING_SLOTS_FIXED
; jx
--;)
264 cluster
[0].indices
[jx
].base
= 0;
265 cluster
[0].indices
[jx
].span
= 1;
266 cluster
[0].slots
[jx
] = NULL_TREE
;
271 unsigned off
= BINDING_SLOT_PARTITION
% BINDING_VECTOR_SLOTS_PER_CLUSTER
;
272 unsigned ind
= BINDING_SLOT_PARTITION
/ BINDING_VECTOR_SLOTS_PER_CLUSTER
;
273 cluster
[ind
].indices
[off
].base
= 0;
274 cluster
[ind
].indices
[off
].span
= 1;
275 cluster
[ind
].slots
[off
] = NULL_TREE
;
278 if (tree orig
= *slot
)
280 /* Propagate existing value to current slot. */
282 /* Propagate global & module entities to the global and
284 if (tree type
= MAYBE_STAT_TYPE (orig
))
285 init_global_partition (cluster
, type
);
287 for (ovl_iterator
iter (MAYBE_STAT_DECL (orig
)); iter
; ++iter
)
291 /* Internal linkage entities are in deduplicateable. */
292 init_global_partition (cluster
, decl
);
295 if (cluster
[0].slots
[BINDING_SLOT_GLOBAL
]
296 && !(TREE_CODE (orig
) == NAMESPACE_DECL
297 && !DECL_NAMESPACE_ALIAS (orig
)))
299 /* Note that we had some GMF entries. */
300 if (!STAT_HACK_P (orig
))
301 orig
= stat_hack (orig
);
303 MODULE_BINDING_GLOBAL_P (orig
) = true;
306 cluster
[0].slots
[BINDING_SLOT_CURRENT
] = orig
;
312 gcc_checking_assert (create
>= 0);
314 unsigned off
= ix
% BINDING_VECTOR_SLOTS_PER_CLUSTER
;
315 binding_cluster
&cluster
316 = BINDING_VECTOR_CLUSTER (*slot
, ix
/ BINDING_VECTOR_SLOTS_PER_CLUSTER
);
318 /* There must always be slots for these indices */
319 gcc_checking_assert (cluster
.indices
[off
].span
== 1
320 && !cluster
.indices
[off
].base
321 && !cluster
.slots
[off
].is_lazy ());
323 return reinterpret_cast<tree
*> (&cluster
.slots
[off
]);
326 /* *SLOT is a namespace binding slot. Append a slot for imported
329 static binding_slot
*
330 append_imported_binding_slot (tree
*slot
, tree name
, unsigned ix
)
332 gcc_checking_assert (ix
);
334 if (!*slot
|| TREE_CODE (*slot
) != BINDING_VECTOR
)
335 /* Make an initial module vector. */
336 get_fixed_binding_slot (slot
, name
, BINDING_SLOT_GLOBAL
, -1);
337 else if (!BINDING_VECTOR_CLUSTER_LAST (*slot
)
338 ->indices
[BINDING_VECTOR_SLOTS_PER_CLUSTER
- 1].span
)
339 /* There is space in the last cluster. */;
340 else if (BINDING_VECTOR_NUM_CLUSTERS (*slot
)
341 != BINDING_VECTOR_ALLOC_CLUSTERS (*slot
))
342 /* There is space in the vector. */
343 BINDING_VECTOR_NUM_CLUSTERS (*slot
)++;
346 /* Extend the vector. */
347 unsigned have
= BINDING_VECTOR_NUM_CLUSTERS (*slot
);
348 unsigned want
= (have
* 3 + 1) / 2;
350 if (want
> (unsigned short)~0)
351 want
= (unsigned short)~0;
353 tree new_vec
= make_binding_vec (name
, want
);
354 BINDING_VECTOR_NUM_CLUSTERS (new_vec
) = have
+ 1;
355 memcpy (BINDING_VECTOR_CLUSTER_BASE (new_vec
),
356 BINDING_VECTOR_CLUSTER_BASE (*slot
),
357 have
* sizeof (binding_cluster
));
361 binding_cluster
*last
= BINDING_VECTOR_CLUSTER_LAST (*slot
);
362 for (unsigned off
= 0; off
!= BINDING_VECTOR_SLOTS_PER_CLUSTER
; off
++)
363 if (!last
->indices
[off
].span
)
365 /* Fill the free slot of the cluster. */
366 last
->indices
[off
].base
= ix
;
367 last
->indices
[off
].span
= 1;
368 last
->slots
[off
] = NULL_TREE
;
369 /* Check monotonicity. */
370 gcc_checking_assert (last
[off
? 0 : -1]
371 .indices
[off
? off
- 1
372 : BINDING_VECTOR_SLOTS_PER_CLUSTER
- 1]
374 return &last
->slots
[off
];
380 /* Add DECL to the list of things declared in binding level B. */
383 add_decl_to_level (cp_binding_level
*b
, tree decl
)
385 gcc_assert (b
->kind
!= sk_class
);
387 /* Make sure we don't create a circular list. xref_tag can end
388 up pushing the same artificial decl more than once. We
389 should have already detected that in update_binding. (This isn't a
390 complete verification of non-circularity.) */
391 gcc_assert (b
->names
!= decl
);
393 /* We build up the list in reverse order, and reverse it later if
395 TREE_CHAIN (decl
) = b
->names
;
398 /* If appropriate, add decl to separate list of statics. We include
399 extern variables because they might turn out to be static later.
400 It's OK for this list to contain a few false positives. */
401 if (b
->kind
== sk_namespace
402 && ((VAR_P (decl
) && (TREE_STATIC (decl
) || DECL_EXTERNAL (decl
)))
403 || (TREE_CODE (decl
) == FUNCTION_DECL
404 && (!TREE_PUBLIC (decl
)
405 || decl_internal_context_p (decl
)
406 || DECL_DECLARED_INLINE_P (decl
)))))
407 vec_safe_push (static_decls
, decl
);
410 /* Find the binding for NAME in the local binding level B. */
413 find_local_binding (cp_binding_level
*b
, tree name
)
415 if (cxx_binding
*binding
= IDENTIFIER_BINDING (name
))
416 for (;; b
= b
->level_chain
)
418 if (binding
->scope
== b
)
421 /* Cleanup contours are transparent to the language. */
422 if (b
->kind
!= sk_cleanup
)
431 typedef std::pair
<tree
, tree
> using_pair
;
432 typedef auto_vec
<using_pair
, 16> using_queue
;
435 tree name
; /* The identifier being looked for. */
437 /* Usually we just add things to the VALUE binding, but we record
438 (hidden) IMPLICIT_TYPEDEFs on the type binding, which is used for
439 using-decl resolution. */
440 tree value
; /* A (possibly ambiguous) set of things found. */
441 tree type
; /* A type that has been found. */
443 LOOK_want want
; /* What kind of entity we want. */
445 bool deduping
; /* Full deduping is needed because using declarations
447 vec
<tree
, va_heap
, vl_embed
> *scopes
;
448 name_lookup
*previous
; /* Previously active lookup. */
451 /* Marked scope stack for outermost name lookup. */
452 static vec
<tree
, va_heap
, vl_embed
> *shared_scopes
;
453 /* Currently active lookup. */
454 static name_lookup
*active
;
457 name_lookup (tree n
, LOOK_want w
= LOOK_want::NORMAL
)
458 : name (n
), value (NULL_TREE
), type (NULL_TREE
),
460 deduping (false), scopes (NULL
), previous (NULL
)
466 gcc_checking_assert (!deduping
);
470 private: /* Uncopyable, unmovable, unassignable. I am a rock. */
471 name_lookup (const name_lookup
&);
472 name_lookup
&operator= (const name_lookup
&);
475 /* Turn on or off deduping mode. */
476 void dedup (bool state
)
478 if (deduping
!= state
)
481 lookup_mark (value
, state
);
486 static bool seen_p (tree scope
)
488 return LOOKUP_SEEN_P (scope
);
490 static bool found_p (tree scope
)
492 return LOOKUP_FOUND_P (scope
);
495 void mark_seen (tree scope
); /* Mark and add to scope vector. */
496 static void mark_found (tree scope
)
498 gcc_checking_assert (seen_p (scope
));
499 LOOKUP_FOUND_P (scope
) = true;
501 bool see_and_mark (tree scope
)
503 bool ret
= seen_p (scope
);
508 bool find_and_mark (tree scope
);
511 void preserve_state ();
512 void restore_state ();
515 static tree
ambiguous (tree thing
, tree current
);
516 void add_value (tree new_val
);
518 void add_overload (tree fns
);
519 void add_type (tree new_type
);
520 bool process_binding (tree val_bind
, tree type_bind
);
521 unsigned process_module_binding (tree val_bind
, tree type_bind
, unsigned);
522 /* Look in only namespace. */
523 bool search_namespace_only (tree scope
);
524 /* Look in namespace and its (recursive) inlines. Ignore using
525 directives. Return true if something found (inc dups). */
526 bool search_namespace (tree scope
);
527 /* Look in the using directives of namespace + inlines using
528 qualified lookup rules. */
529 bool search_usings (tree scope
);
532 void queue_namespace (using_queue
& queue
, int depth
, tree scope
);
533 void queue_usings (using_queue
& queue
, int depth
, vec
<tree
, va_gc
> *usings
);
539 void adl_expr (tree
);
540 void adl_type (tree
);
541 void adl_template_arg (tree
);
542 void adl_class (tree
);
543 void adl_enum (tree
);
544 void adl_bases (tree
);
545 void adl_class_only (tree
);
546 void adl_namespace (tree
);
547 void adl_class_fns (tree
);
548 void adl_namespace_fns (tree
, bitmap
);
551 /* Search namespace + inlines + maybe usings as qualified lookup. */
552 bool search_qualified (tree scope
, bool usings
= true);
554 /* Search namespace + inlines + usings as unqualified lookup. */
555 bool search_unqualified (tree scope
, cp_binding_level
*);
557 /* ADL lookup of ARGS. */
558 tree
search_adl (tree fns
, vec
<tree
, va_gc
> *args
);
561 /* Scope stack shared by all outermost lookups. This avoids us
562 allocating and freeing on every single lookup. */
563 vec
<tree
, va_heap
, vl_embed
> *name_lookup::shared_scopes
;
565 /* Currently active lookup. */
566 name_lookup
*name_lookup::active
;
568 /* Name lookup is recursive, becase ADL can cause template
569 instatiation. This is of course a rare event, so we optimize for
570 it not happening. When we discover an active name-lookup, which
571 must be an ADL lookup, we need to unmark the marked scopes and also
572 unmark the lookup we might have been accumulating. */
575 name_lookup::preserve_state ()
580 unsigned length
= vec_safe_length (previous
->scopes
);
581 vec_safe_reserve (previous
->scopes
, length
* 2);
582 for (unsigned ix
= length
; ix
--;)
584 tree decl
= (*previous
->scopes
)[ix
];
586 gcc_checking_assert (LOOKUP_SEEN_P (decl
));
587 LOOKUP_SEEN_P (decl
) = false;
589 /* Preserve the FOUND_P state on the interrupted lookup's
591 if (LOOKUP_FOUND_P (decl
))
593 LOOKUP_FOUND_P (decl
) = false;
594 previous
->scopes
->quick_push (decl
);
598 /* Unmark the outer partial lookup. */
599 if (previous
->deduping
)
600 lookup_mark (previous
->value
, false);
603 scopes
= shared_scopes
;
607 /* Restore the marking state of a lookup we interrupted. */
610 name_lookup::restore_state ()
612 gcc_checking_assert (!deduping
);
614 /* Unmark and empty this lookup's scope stack. */
615 for (unsigned ix
= vec_safe_length (scopes
); ix
--;)
617 tree decl
= scopes
->pop ();
618 gcc_checking_assert (LOOKUP_SEEN_P (decl
));
619 LOOKUP_SEEN_P (decl
) = false;
620 LOOKUP_FOUND_P (decl
) = false;
628 unsigned length
= vec_safe_length (previous
->scopes
);
629 for (unsigned ix
= 0; ix
!= length
; ix
++)
631 tree decl
= (*previous
->scopes
)[ix
];
632 if (LOOKUP_SEEN_P (decl
))
634 /* The remainder of the scope stack must be recording
635 FOUND_P decls, which we want to pop off. */
638 tree decl
= previous
->scopes
->pop ();
639 gcc_checking_assert (LOOKUP_SEEN_P (decl
)
640 && !LOOKUP_FOUND_P (decl
));
641 LOOKUP_FOUND_P (decl
) = true;
643 while (++ix
!= length
);
647 gcc_checking_assert (!LOOKUP_FOUND_P (decl
));
648 LOOKUP_SEEN_P (decl
) = true;
651 /* Remark the outer partial lookup. */
652 if (previous
->deduping
)
653 lookup_mark (previous
->value
, true);
656 shared_scopes
= scopes
;
660 name_lookup::mark_seen (tree scope
)
662 gcc_checking_assert (!seen_p (scope
));
663 LOOKUP_SEEN_P (scope
) = true;
664 vec_safe_push (scopes
, scope
);
668 name_lookup::find_and_mark (tree scope
)
670 bool result
= LOOKUP_FOUND_P (scope
);
673 LOOKUP_FOUND_P (scope
) = true;
674 if (!LOOKUP_SEEN_P (scope
))
675 vec_safe_push (scopes
, scope
);
681 /* THING and CURRENT are ambiguous, concatenate them. */
684 name_lookup::ambiguous (tree thing
, tree current
)
686 if (TREE_CODE (current
) != TREE_LIST
)
688 current
= build_tree_list (NULL_TREE
, current
);
689 TREE_TYPE (current
) = error_mark_node
;
691 current
= tree_cons (NULL_TREE
, thing
, current
);
692 TREE_TYPE (current
) = error_mark_node
;
697 /* FNS is a new overload set to add to the exising set. */
700 name_lookup::add_overload (tree fns
)
702 if (!deduping
&& TREE_CODE (fns
) == OVERLOAD
)
705 if (!bool (want
& LOOK_want::HIDDEN_FRIEND
))
706 probe
= ovl_skip_hidden (probe
);
707 if (probe
&& TREE_CODE (probe
) == OVERLOAD
708 && OVL_DEDUP_P (probe
))
709 /* We're about to add something found by multiple paths, so need to
710 engage deduping mode. */
714 value
= lookup_maybe_add (fns
, value
, deduping
);
717 /* Add a NEW_VAL, a found value binding into the current value binding. */
720 name_lookup::add_value (tree new_val
)
722 if (OVL_P (new_val
) && (!value
|| OVL_P (value
)))
723 add_overload (new_val
);
726 else if (value
== new_val
)
728 else if ((TREE_CODE (value
) == TYPE_DECL
729 && TREE_CODE (new_val
) == TYPE_DECL
730 && same_type_p (TREE_TYPE (value
), TREE_TYPE (new_val
))))
731 /* Typedefs to the same type. */;
732 else if (TREE_CODE (value
) == NAMESPACE_DECL
733 && TREE_CODE (new_val
) == NAMESPACE_DECL
734 && ORIGINAL_NAMESPACE (value
) == ORIGINAL_NAMESPACE (new_val
))
735 /* Namespace (possibly aliased) to the same namespace. Locate
737 value
= ORIGINAL_NAMESPACE (value
);
740 /* Disengage deduping mode. */
742 value
= ambiguous (new_val
, value
);
746 /* Add a NEW_TYPE, a found type binding into the current type binding. */
749 name_lookup::add_type (tree new_type
)
753 else if (TREE_CODE (type
) == TREE_LIST
754 || !same_type_p (TREE_TYPE (type
), TREE_TYPE (new_type
)))
755 type
= ambiguous (new_type
, type
);
758 /* Process a found binding containing NEW_VAL and NEW_TYPE. Returns
759 true if we actually found something noteworthy. Hiddenness has
760 already been handled in the caller. */
763 name_lookup::process_binding (tree new_val
, tree new_type
)
765 /* Did we really see a type? */
767 && (want
& LOOK_want::TYPE_NAMESPACE
) == LOOK_want::NAMESPACE
)
768 new_type
= NULL_TREE
;
770 /* Do we really see a value? */
772 switch (TREE_CODE (new_val
))
775 /* If we expect types or namespaces, and not templates,
776 or this is not a template class. */
777 if (bool (want
& LOOK_want::TYPE_NAMESPACE
)
778 && !DECL_TYPE_TEMPLATE_P (new_val
))
782 if ((want
& LOOK_want::TYPE_NAMESPACE
) == LOOK_want::NAMESPACE
783 || (new_type
&& bool (want
& LOOK_want::TYPE
)))
787 if ((want
& LOOK_want::TYPE_NAMESPACE
) == LOOK_want::TYPE
)
791 if (bool (want
& LOOK_want::TYPE_NAMESPACE
))
798 new_type
= NULL_TREE
;
801 /* Merge into the lookup */
807 return new_val
!= NULL_TREE
;
810 /* If we're importing a module containing this binding, add it to the
811 lookup set. The trickiness is with namespaces, we only want to
815 name_lookup::process_module_binding (tree new_val
, tree new_type
,
818 /* Optimize for (re-)finding a public namespace. We only need to
820 if (new_val
&& !new_type
821 && TREE_CODE (new_val
) == NAMESPACE_DECL
822 && TREE_PUBLIC (new_val
)
823 && !DECL_NAMESPACE_ALIAS (new_val
))
830 if (new_type
|| new_val
)
831 marker
|= process_binding (new_val
, new_type
);
836 /* Look in exactly namespace SCOPE. */
839 name_lookup::search_namespace_only (tree scope
)
842 if (tree
*binding
= find_namespace_slot (scope
, name
))
845 if (TREE_CODE (val
) == BINDING_VECTOR
)
847 /* I presume the binding list is going to be sparser than
848 the import bitmap. Hence iterate over the former
849 checking for bits set in the bitmap. */
850 bitmap imports
= get_import_bitmap ();
851 binding_cluster
*cluster
= BINDING_VECTOR_CLUSTER_BASE (val
);
855 if (tree bind
= cluster
->slots
[BINDING_SLOT_CURRENT
])
859 if (named_module_purview_p ())
863 if (STAT_HACK_P (bind
) && MODULE_BINDING_GLOBAL_P (bind
))
869 tree type
= NULL_TREE
;
872 if (STAT_HACK_P (bind
))
874 type
= STAT_TYPE (bind
);
875 value
= STAT_DECL (bind
);
877 if (!bool (want
& LOOK_want::HIDDEN_FRIEND
))
879 if (STAT_TYPE_HIDDEN_P (bind
))
881 if (STAT_DECL_HIDDEN_P (bind
))
884 value
= ovl_skip_hidden (value
);
887 else if (!bool (want
& LOOK_want::HIDDEN_FRIEND
))
888 value
= ovl_skip_hidden (value
);
890 marker
= process_module_binding (value
, type
, marker
);
893 /* Scan the imported bindings. */
894 unsigned ix
= BINDING_VECTOR_NUM_CLUSTERS (val
);
895 if (BINDING_VECTOR_SLOTS_PER_CLUSTER
== BINDING_SLOTS_FIXED
)
901 /* Do this in forward order, so we load modules in an order
903 for (; ix
--; cluster
++)
904 for (unsigned jx
= 0; jx
!= BINDING_VECTOR_SLOTS_PER_CLUSTER
; jx
++)
906 /* Are we importing this module? */
907 if (unsigned base
= cluster
->indices
[jx
].base
)
908 if (unsigned span
= cluster
->indices
[jx
].span
)
910 if (bitmap_bit_p (imports
, base
))
912 while (++base
, --span
);
917 if (cluster
->slots
[jx
].is_lazy ())
919 gcc_assert (cluster
->indices
[jx
].span
== 1);
920 lazy_load_binding (cluster
->indices
[jx
].base
,
921 scope
, name
, &cluster
->slots
[jx
]);
923 tree bind
= cluster
->slots
[jx
];
925 /* Load errors could mean there's nothing here. */
928 /* Extract what we can see from here. If there's no
929 stat_hack, then everything was exported. */
930 tree type
= NULL_TREE
;
933 /* If STAT_HACK_P is false, everything is visible, and
934 there's no duplication possibilities. */
935 if (STAT_HACK_P (bind
))
939 /* Do we need to engage deduplication? */
941 if (MODULE_BINDING_GLOBAL_P (bind
))
943 else if (MODULE_BINDING_PARTITION_P (bind
))
945 if (unsigned hit
= dup_detect
& dup
)
947 if ((hit
& 1 && BINDING_VECTOR_GLOBAL_DUPS_P (val
))
949 && BINDING_VECTOR_PARTITION_DUPS_P (val
)))
955 if (STAT_TYPE_VISIBLE_P (bind
))
956 type
= STAT_TYPE (bind
);
957 bind
= STAT_VISIBLE (bind
);
960 /* And process it. */
961 marker
= process_module_binding (bind
, type
, marker
);
967 /* Only a current module binding, visible from the current module. */
968 tree bind
= *binding
;
969 tree value
= bind
, type
= NULL_TREE
;
971 if (STAT_HACK_P (bind
))
973 type
= STAT_TYPE (bind
);
974 value
= STAT_DECL (bind
);
976 if (!bool (want
& LOOK_want::HIDDEN_FRIEND
))
978 if (STAT_TYPE_HIDDEN_P (bind
))
980 if (STAT_DECL_HIDDEN_P (bind
))
983 value
= ovl_skip_hidden (value
);
986 else if (!bool (want
& LOOK_want::HIDDEN_FRIEND
))
987 value
= ovl_skip_hidden (value
);
989 found
|= process_binding (value
, type
);
996 /* Conditionally look in namespace SCOPE and inline children. */
999 name_lookup::search_namespace (tree scope
)
1001 if (see_and_mark (scope
))
1002 /* We've visited this scope before. Return what we found then. */
1003 return found_p (scope
);
1005 /* Look in exactly namespace. */
1006 bool found
= search_namespace_only (scope
);
1008 /* Don't look into inline children, if we're looking for an
1009 anonymous name -- it must be in the current scope, if anywhere. */
1011 /* Recursively look in its inline children. */
1012 if (vec
<tree
, va_gc
> *inlinees
= DECL_NAMESPACE_INLINEES (scope
))
1013 for (unsigned ix
= inlinees
->length (); ix
--;)
1014 found
|= search_namespace ((*inlinees
)[ix
]);
1022 /* Recursively follow using directives of SCOPE & its inline children.
1023 Such following is essentially a flood-fill algorithm. */
1026 name_lookup::search_usings (tree scope
)
1028 /* We do not check seen_p here, as that was already set during the
1029 namespace_only walk. */
1030 if (found_p (scope
))
1034 if (vec
<tree
, va_gc
> *usings
= NAMESPACE_LEVEL (scope
)->using_directives
)
1035 for (unsigned ix
= usings
->length (); ix
--;)
1036 found
|= search_qualified ((*usings
)[ix
], true);
1038 /* Look in its inline children. */
1039 if (vec
<tree
, va_gc
> *inlinees
= DECL_NAMESPACE_INLINEES (scope
))
1040 for (unsigned ix
= inlinees
->length (); ix
--;)
1041 found
|= search_usings ((*inlinees
)[ix
]);
1049 /* Qualified namespace lookup in SCOPE.
1050 1) Look in SCOPE (+inlines). If found, we're done.
1051 2) Otherwise, if USINGS is true,
1052 recurse for every using directive of SCOPE (+inlines).
1054 Trickiness is (a) loops and (b) multiple paths to same namespace.
1055 In both cases we want to not repeat any lookups, and know whether
1056 to stop the caller's step #2. Do this via the FOUND_P marker. */
1059 name_lookup::search_qualified (tree scope
, bool usings
)
1064 found
= found_p (scope
);
1067 found
= search_namespace (scope
);
1068 if (!found
&& usings
)
1069 found
= search_usings (scope
);
1077 /* Add SCOPE to the unqualified search queue, recursively add its
1078 inlines and those via using directives. */
1081 name_lookup::queue_namespace (using_queue
& queue
, int depth
, tree scope
)
1083 if (see_and_mark (scope
))
1087 tree common
= scope
;
1088 while (SCOPE_DEPTH (common
) > depth
)
1089 common
= CP_DECL_CONTEXT (common
);
1090 queue
.safe_push (using_pair (common
, scope
));
1092 /* Queue its inline children. */
1093 if (vec
<tree
, va_gc
> *inlinees
= DECL_NAMESPACE_INLINEES (scope
))
1094 for (unsigned ix
= inlinees
->length (); ix
--;)
1095 queue_namespace (queue
, depth
, (*inlinees
)[ix
]);
1097 /* Queue its using targets. */
1098 queue_usings (queue
, depth
, NAMESPACE_LEVEL (scope
)->using_directives
);
1101 /* Add the namespaces in USINGS to the unqualified search queue. */
1104 name_lookup::queue_usings (using_queue
& queue
, int depth
, vec
<tree
, va_gc
> *usings
)
1107 for (unsigned ix
= usings
->length (); ix
--;)
1108 queue_namespace (queue
, depth
, (*usings
)[ix
]);
1111 /* Unqualified namespace lookup in SCOPE.
1112 1) add scope+inlins to worklist.
1113 2) recursively add target of every using directive
1114 3) for each worklist item where SCOPE is common ancestor, search it
1115 4) if nothing find, scope=parent, goto 1. */
1118 name_lookup::search_unqualified (tree scope
, cp_binding_level
*level
)
1123 /* Queue local using-directives. */
1124 for (; level
->kind
!= sk_namespace
; level
= level
->level_chain
)
1125 queue_usings (queue
, SCOPE_DEPTH (scope
), level
->using_directives
);
1127 for (; !found
; scope
= CP_DECL_CONTEXT (scope
))
1129 gcc_assert (!DECL_NAMESPACE_ALIAS (scope
));
1130 int depth
= SCOPE_DEPTH (scope
);
1132 /* Queue namespaces reachable from SCOPE. */
1133 queue_namespace (queue
, depth
, scope
);
1135 /* Search every queued namespace where SCOPE is the common
1136 ancestor. Adjust the others. */
1140 using_pair
&pair
= queue
[ix
];
1141 while (pair
.first
== scope
)
1143 found
|= search_namespace_only (pair
.second
);
1144 pair
= queue
.pop ();
1145 if (ix
== queue
.length ())
1148 /* The depth is the same as SCOPE, find the parent scope. */
1149 if (SCOPE_DEPTH (pair
.first
) == depth
)
1150 pair
.first
= CP_DECL_CONTEXT (pair
.first
);
1153 while (ix
< queue
.length ());
1155 if (scope
== global_namespace
)
1158 /* If looking for hidden friends, we only look in the innermost
1159 namespace scope. [namespace.memdef]/3 If a friend
1160 declaration in a non-local class first declares a class,
1161 function, class template or function template the friend is a
1162 member of the innermost enclosing namespace. See also
1163 [basic.lookup.unqual]/7 */
1164 if (bool (want
& LOOK_want::HIDDEN_FRIEND
))
1173 /* FNS is a value binding. If it is a (set of overloaded) functions,
1174 add them into the current value. */
1177 name_lookup::add_fns (tree fns
)
1181 else if (TREE_CODE (fns
) == OVERLOAD
)
1183 if (TREE_TYPE (fns
) != unknown_type_node
)
1184 fns
= OVL_FUNCTION (fns
);
1186 else if (!DECL_DECLARES_FUNCTION_P (fns
))
1192 /* Add the overloaded fns of SCOPE. */
1195 name_lookup::adl_namespace_fns (tree scope
, bitmap imports
)
1197 if (tree
*binding
= find_namespace_slot (scope
, name
))
1199 tree val
= *binding
;
1200 if (TREE_CODE (val
) != BINDING_VECTOR
)
1201 add_fns (ovl_skip_hidden (MAYBE_STAT_DECL (val
)));
1204 /* I presume the binding list is going to be sparser than
1205 the import bitmap. Hence iterate over the former
1206 checking for bits set in the bitmap. */
1207 binding_cluster
*cluster
= BINDING_VECTOR_CLUSTER_BASE (val
);
1210 if (tree bind
= cluster
->slots
[BINDING_SLOT_CURRENT
])
1212 /* The current TU's bindings must be visible, we don't
1213 need to check the bitmaps. */
1217 if (named_module_purview_p ())
1221 if (STAT_HACK_P (bind
) && MODULE_BINDING_GLOBAL_P (bind
))
1228 add_fns (ovl_skip_hidden (MAYBE_STAT_DECL (bind
)));
1231 /* Scan the imported bindings. */
1232 unsigned ix
= BINDING_VECTOR_NUM_CLUSTERS (val
);
1233 if (BINDING_VECTOR_SLOTS_PER_CLUSTER
== BINDING_SLOTS_FIXED
)
1239 /* Do this in forward order, so we load modules in an order
1240 the user expects. */
1241 for (; ix
--; cluster
++)
1242 for (unsigned jx
= 0; jx
!= BINDING_VECTOR_SLOTS_PER_CLUSTER
; jx
++)
1244 /* Functions are never on merged slots. */
1245 if (!cluster
->indices
[jx
].base
1246 || cluster
->indices
[jx
].span
!= 1)
1249 /* Is this slot visible? */
1250 if (!bitmap_bit_p (imports
, cluster
->indices
[jx
].base
))
1254 if (cluster
->slots
[jx
].is_lazy ())
1255 lazy_load_binding (cluster
->indices
[jx
].base
,
1256 scope
, name
, &cluster
->slots
[jx
]);
1258 tree bind
= cluster
->slots
[jx
];
1260 /* Load errors could mean there's nothing here. */
1263 if (STAT_HACK_P (bind
))
1267 /* Do we need to engage deduplication? */
1269 if (MODULE_BINDING_GLOBAL_P (bind
))
1271 else if (MODULE_BINDING_PARTITION_P (bind
))
1273 if (unsigned hit
= dup_detect
& dup
)
1274 if ((hit
& 1 && BINDING_VECTOR_GLOBAL_DUPS_P (val
))
1276 && BINDING_VECTOR_PARTITION_DUPS_P (val
)))
1281 bind
= STAT_VISIBLE (bind
);
1290 /* Add the hidden friends of SCOPE. */
1293 name_lookup::adl_class_fns (tree type
)
1296 for (tree list
= DECL_FRIENDLIST (TYPE_MAIN_DECL (type
));
1297 list
; list
= TREE_CHAIN (list
))
1298 if (name
== FRIEND_NAME (list
))
1300 tree context
= NULL_TREE
; /* Lazily computed. */
1301 for (tree friends
= FRIEND_DECLS (list
); friends
;
1302 friends
= TREE_CHAIN (friends
))
1304 tree fn
= TREE_VALUE (friends
);
1306 /* Only interested in global functions with potentially hidden
1307 (i.e. unqualified) declarations. */
1309 context
= decl_namespace_context (type
);
1310 if (CP_DECL_CONTEXT (fn
) != context
)
1315 /* Template specializations are never found by name lookup.
1316 (Templates themselves can be found, but not template
1317 specializations.) */
1318 if (TREE_CODE (fn
) == FUNCTION_DECL
&& DECL_USE_TEMPLATE (fn
))
1326 /* Find the containing non-inlined namespace, add it and all its
1330 name_lookup::adl_namespace (tree scope
)
1332 if (see_and_mark (scope
))
1335 /* Look down into inline namespaces. */
1336 if (vec
<tree
, va_gc
> *inlinees
= DECL_NAMESPACE_INLINEES (scope
))
1337 for (unsigned ix
= inlinees
->length (); ix
--;)
1338 adl_namespace ((*inlinees
)[ix
]);
1340 if (DECL_NAMESPACE_INLINE_P (scope
))
1342 adl_namespace (CP_DECL_CONTEXT (scope
));
1345 /* Adds the class and its friends to the lookup structure. */
1348 name_lookup::adl_class_only (tree type
)
1350 /* Backend-built structures, such as __builtin_va_list, aren't
1351 affected by all this. */
1352 if (!CLASS_TYPE_P (type
))
1355 type
= TYPE_MAIN_VARIANT (type
);
1357 if (see_and_mark (type
))
1360 tree context
= decl_namespace_context (type
);
1361 adl_namespace (context
);
1364 /* Adds the class and its bases to the lookup structure.
1365 Returns true on error. */
1368 name_lookup::adl_bases (tree type
)
1370 adl_class_only (type
);
1372 /* Process baseclasses. */
1373 if (tree binfo
= TYPE_BINFO (type
))
1378 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
1379 adl_bases (BINFO_TYPE (base_binfo
));
1383 /* Adds everything associated with a class argument type to the lookup
1386 If T is a class type (including unions), its associated classes are: the
1387 class itself; the class of which it is a member, if any; and its direct
1388 and indirect base classes. Its associated namespaces are the namespaces
1389 of which its associated classes are members. Furthermore, if T is a
1390 class template specialization, its associated namespaces and classes
1391 also include: the namespaces and classes associated with the types of
1392 the template arguments provided for template type parameters (excluding
1393 template template parameters); the namespaces of which any template
1394 template arguments are members; and the classes of which any member
1395 templates used as template template arguments are members. [ Note:
1396 non-type template arguments do not contribute to the set of associated
1397 namespaces. --end note] */
1400 name_lookup::adl_class (tree type
)
1402 /* Backend build structures, such as __builtin_va_list, aren't
1403 affected by all this. */
1404 if (!CLASS_TYPE_P (type
))
1407 type
= TYPE_MAIN_VARIANT (type
);
1409 /* We don't set found here because we have to have set seen first,
1410 which is done in the adl_bases walk. */
1414 complete_type (type
);
1418 if (TYPE_CLASS_SCOPE_P (type
))
1419 adl_class_only (TYPE_CONTEXT (type
));
1421 /* Process template arguments. */
1422 if (CLASSTYPE_TEMPLATE_INFO (type
)
1423 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
1425 tree list
= INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
1426 for (int i
= 0; i
< TREE_VEC_LENGTH (list
); ++i
)
1427 adl_template_arg (TREE_VEC_ELT (list
, i
));
1432 name_lookup::adl_enum (tree type
)
1434 type
= TYPE_MAIN_VARIANT (type
);
1435 if (see_and_mark (type
))
1438 if (TYPE_CLASS_SCOPE_P (type
))
1439 adl_class_only (TYPE_CONTEXT (type
));
1441 adl_namespace (decl_namespace_context (type
));
1445 name_lookup::adl_expr (tree expr
)
1450 gcc_assert (!TYPE_P (expr
));
1452 if (TREE_TYPE (expr
) != unknown_type_node
)
1454 adl_type (unlowered_expr_type (expr
));
1458 if (TREE_CODE (expr
) == ADDR_EXPR
)
1459 expr
= TREE_OPERAND (expr
, 0);
1460 if (TREE_CODE (expr
) == COMPONENT_REF
1461 || TREE_CODE (expr
) == OFFSET_REF
)
1462 expr
= TREE_OPERAND (expr
, 1);
1463 expr
= MAYBE_BASELINK_FUNCTIONS (expr
);
1466 for (lkp_iterator
iter (expr
); iter
; ++iter
)
1467 adl_type (TREE_TYPE (*iter
));
1468 else if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
1470 /* The working paper doesn't currently say how to handle
1471 template-id arguments. The sensible thing would seem to be
1472 to handle the list of template candidates like a normal
1473 overload set, and handle the template arguments like we do
1474 for class template specializations. */
1476 /* First the templates. */
1477 adl_expr (TREE_OPERAND (expr
, 0));
1479 /* Now the arguments. */
1480 if (tree args
= TREE_OPERAND (expr
, 1))
1481 for (int ix
= TREE_VEC_LENGTH (args
); ix
--;)
1482 adl_template_arg (TREE_VEC_ELT (args
, ix
));
1487 name_lookup::adl_type (tree type
)
1492 if (TYPE_PTRDATAMEM_P (type
))
1494 /* Pointer to member: associate class type and value type. */
1495 adl_type (TYPE_PTRMEM_CLASS_TYPE (type
));
1496 adl_type (TYPE_PTRMEM_POINTED_TO_TYPE (type
));
1500 switch (TREE_CODE (type
))
1503 if (TYPE_PTRMEMFUNC_P (type
))
1505 adl_type (TYPE_PTRMEMFUNC_FN_TYPE (type
));
1514 /* The basetype is referenced in the first arg type, so just
1517 /* Associate the parameter types. */
1518 for (tree args
= TYPE_ARG_TYPES (type
); args
; args
= TREE_CHAIN (args
))
1519 adl_type (TREE_VALUE (args
));
1523 case REFERENCE_TYPE
:
1525 adl_type (TREE_TYPE (type
));
1533 gcc_assert (type
== unknown_type_node
1534 || type
== init_list_type_node
);
1537 case TYPE_PACK_EXPANSION
:
1538 adl_type (PACK_EXPANSION_PATTERN (type
));
1546 /* Adds everything associated with a template argument to the lookup
1550 name_lookup::adl_template_arg (tree arg
)
1552 /* [basic.lookup.koenig]
1554 If T is a template-id, its associated namespaces and classes are
1555 ... the namespaces and classes associated with the types of the
1556 template arguments provided for template type parameters
1557 (excluding template template parameters); the namespaces in which
1558 any template template arguments are defined; and the classes in
1559 which any member templates used as template template arguments
1560 are defined. [Note: non-type template arguments do not
1561 contribute to the set of associated namespaces. ] */
1563 /* Consider first template template arguments. */
1564 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
1565 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
1567 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
1569 tree ctx
= CP_DECL_CONTEXT (arg
);
1571 /* It's not a member template. */
1572 if (TREE_CODE (ctx
) == NAMESPACE_DECL
)
1573 adl_namespace (ctx
);
1574 /* Otherwise, it must be member template. */
1576 adl_class_only (ctx
);
1578 /* It's an argument pack; handle it recursively. */
1579 else if (ARGUMENT_PACK_P (arg
))
1581 tree args
= ARGUMENT_PACK_ARGS (arg
);
1582 int i
, len
= TREE_VEC_LENGTH (args
);
1583 for (i
= 0; i
< len
; ++i
)
1584 adl_template_arg (TREE_VEC_ELT (args
, i
));
1586 /* It's not a template template argument, but it is a type template
1588 else if (TYPE_P (arg
))
1592 /* Perform ADL lookup. FNS is the existing lookup result and ARGS are
1593 the call arguments. */
1596 name_lookup::search_adl (tree fns
, vec
<tree
, va_gc
> *args
)
1598 gcc_checking_assert (!vec_safe_length (scopes
));
1600 /* Gather each associated entity onto the lookup's scope list. */
1604 FOR_EACH_VEC_ELT_REVERSE (*args
, ix
, arg
)
1605 /* OMP reduction operators put an ADL-significant type as the
1612 if (vec_safe_length (scopes
))
1614 /* Now do the lookups. */
1619 /* INST_PATH will be NULL, if this is /not/ 2nd-phase ADL. */
1620 bitmap inst_path
= NULL
;
1621 /* VISIBLE is the regular import bitmap. */
1622 bitmap visible
= visible_instantiation_path (&inst_path
);
1624 for (unsigned ix
= scopes
->length (); ix
--;)
1626 tree scope
= (*scopes
)[ix
];
1627 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
1628 adl_namespace_fns (scope
, visible
);
1631 if (RECORD_OR_UNION_TYPE_P (scope
))
1632 adl_class_fns (scope
);
1634 /* During 2nd phase ADL: Any exported declaration D in N
1635 declared within the purview of a named module M
1636 (10.2) is visible if there is an associated entity
1637 attached to M with the same innermost enclosing
1638 non-inline namespace as D.
1639 [basic.lookup.argdep]/4.4 */
1642 /* Not 2nd phase. */
1645 tree ctx
= CP_DECL_CONTEXT (TYPE_NAME (scope
));
1646 if (TREE_CODE (ctx
) != NAMESPACE_DECL
)
1647 /* Not namespace-scope class. */
1650 tree origin
= get_originating_module_decl (TYPE_NAME (scope
));
1651 tree not_tmpl
= STRIP_TEMPLATE (origin
);
1652 if (!DECL_LANG_SPECIFIC (not_tmpl
)
1653 || !DECL_MODULE_IMPORT_P (not_tmpl
))
1657 unsigned module
= get_importing_module (origin
);
1659 if (!bitmap_bit_p (inst_path
, module
))
1660 /* Not on path of instantiation. */
1663 if (bitmap_bit_p (visible
, module
))
1664 /* If the module was in the visible set, we'll look at
1665 its namespace partition anyway. */
1668 if (tree
*slot
= find_namespace_slot (ctx
, name
, false))
1669 if (binding_slot
*mslot
= search_imported_binding_slot (slot
, module
))
1671 if (mslot
->is_lazy ())
1672 lazy_load_binding (module
, ctx
, name
, mslot
);
1674 if (tree bind
= *mslot
)
1676 /* We must turn on deduping, because some other class
1677 from this module might also be in this namespace. */
1680 /* Add the exported fns */
1681 if (STAT_HACK_P (bind
))
1682 add_fns (STAT_VISIBLE (bind
));
1695 static bool qualified_namespace_lookup (tree
, name_lookup
*);
1696 static void consider_binding_level (tree name
,
1697 best_match
<tree
, const char *> &bm
,
1698 cp_binding_level
*lvl
,
1699 bool look_within_fields
,
1700 enum lookup_name_fuzzy_kind kind
);
1702 /* ADL lookup of NAME. FNS is the result of regular lookup, and we
1703 don't add duplicates to it. ARGS is the vector of call
1704 arguments (which will not be empty). */
1707 lookup_arg_dependent (tree name
, tree fns
, vec
<tree
, va_gc
> *args
)
1709 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
1710 name_lookup
lookup (name
);
1711 return lookup
.search_adl (fns
, args
);
1714 /* FNS is an overload set of conversion functions. Return the
1715 overloads converting to TYPE. */
1718 extract_conversion_operator (tree fns
, tree type
)
1720 tree convs
= NULL_TREE
;
1721 tree tpls
= NULL_TREE
;
1723 for (ovl_iterator
iter (fns
); iter
; ++iter
)
1725 if (same_type_p (DECL_CONV_FN_TYPE (*iter
), type
))
1726 convs
= lookup_add (*iter
, convs
);
1728 if (TREE_CODE (*iter
) == TEMPLATE_DECL
)
1729 tpls
= lookup_add (*iter
, tpls
);
1738 /* Binary search of (ordered) MEMBER_VEC for NAME. */
1741 member_vec_binary_search (vec
<tree
, va_gc
> *member_vec
, tree name
)
1743 for (unsigned lo
= 0, hi
= member_vec
->length (); lo
< hi
;)
1745 unsigned mid
= (lo
+ hi
) / 2;
1746 tree binding
= (*member_vec
)[mid
];
1747 tree binding_name
= OVL_NAME (binding
);
1749 if (binding_name
> name
)
1751 else if (binding_name
< name
)
1760 /* Linear search of (unordered) MEMBER_VEC for NAME. */
1763 member_vec_linear_search (vec
<tree
, va_gc
> *member_vec
, tree name
)
1765 for (int ix
= member_vec
->length (); ix
--;)
1766 if (tree binding
= (*member_vec
)[ix
])
1767 if (OVL_NAME (binding
) == name
)
1773 /* Linear search of (partially ordered) fields of KLASS for NAME. */
1776 fields_linear_search (tree klass
, tree name
, bool want_type
)
1778 for (tree fields
= TYPE_FIELDS (klass
); fields
; fields
= DECL_CHAIN (fields
))
1782 if (TREE_CODE (decl
) == FIELD_DECL
1783 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
1785 if (tree temp
= search_anon_aggr (TREE_TYPE (decl
), name
, want_type
))
1789 if (DECL_NAME (decl
) != name
)
1792 if (TREE_CODE (decl
) == USING_DECL
)
1794 decl
= strip_using_decl (decl
);
1795 if (is_overloaded_fn (decl
))
1799 if (DECL_DECLARES_FUNCTION_P (decl
))
1800 /* Functions are found separately. */
1803 if (!want_type
|| DECL_DECLARES_TYPE_P (decl
))
1810 /* Like fields_linear_search, but specific for "_" name. There can be multiple
1811 name-independent non-static data members and in that case a TREE_LIST with the
1812 ambiguous decls should be returned. */
1815 name_independent_linear_search (tree val
, tree klass
, tree name
)
1817 for (tree fields
= TYPE_FIELDS (klass
); fields
; fields
= DECL_CHAIN (fields
))
1821 if (TREE_CODE (decl
) == FIELD_DECL
1822 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
1824 if (tree temp
= search_anon_aggr (TREE_TYPE (decl
), name
, false))
1831 if (DECL_NAME (decl
) != name
)
1834 if (TREE_CODE (decl
) == USING_DECL
)
1836 decl
= strip_using_decl (decl
);
1837 if (is_overloaded_fn (decl
))
1841 if (DECL_DECLARES_FUNCTION_P (decl
))
1842 /* Functions are found separately. */
1846 if (val
== NULL_TREE
)
1850 if (TREE_CODE (val
) != TREE_LIST
)
1852 if (TREE_CODE (val
) == OVERLOAD
1853 && OVL_DEDUP_P (val
)
1854 && TREE_CODE (decl
) == USING_DECL
)
1856 val
= ovl_make (decl
, val
);
1859 val
= tree_cons (NULL_TREE
, val
, NULL_TREE
);
1860 TREE_TYPE (val
) = error_mark_node
;
1862 if (TREE_CODE (decl
) == TREE_LIST
)
1863 val
= chainon (decl
, val
);
1866 val
= tree_cons (NULL_TREE
, decl
, val
);
1867 TREE_TYPE (val
) = error_mark_node
;
1875 /* Look for NAME member inside of anonymous aggregate ANON. Although
1876 such things should only contain FIELD_DECLs, we check that too
1877 late, and would give very confusing errors if we weren't
1881 search_anon_aggr (tree anon
, tree name
, bool want_type
)
1883 gcc_assert (COMPLETE_TYPE_P (anon
));
1884 tree ret
= get_class_binding_direct (anon
, name
, want_type
);
1888 /* Look for NAME as an immediate member of KLASS (including
1889 anon-members or unscoped enum member). TYPE_OR_FNS is zero for
1890 regular search. >0 to get a type binding (if there is one) and <0
1891 if you want (just) the member function binding.
1893 Use this if you do not want lazy member creation. */
1896 get_class_binding_direct (tree klass
, tree name
, bool want_type
)
1898 gcc_checking_assert (RECORD_OR_UNION_TYPE_P (klass
));
1900 /* Conversion operators can only be found by the marker conversion
1902 bool conv_op
= IDENTIFIER_CONV_OP_P (name
);
1903 tree lookup
= conv_op
? conv_op_identifier
: name
;
1904 tree val
= NULL_TREE
;
1905 vec
<tree
, va_gc
> *member_vec
= CLASSTYPE_MEMBER_VEC (klass
);
1907 if (COMPLETE_TYPE_P (klass
) && member_vec
)
1909 val
= member_vec_binary_search (member_vec
, lookup
);
1912 else if (TREE_CODE (val
) == OVERLOAD
1913 && OVL_NAME_INDEPENDENT_DECL_P (val
))
1917 while (TREE_CODE (val
) == OVERLOAD
1918 && OVL_NAME_INDEPENDENT_DECL_P (val
))
1919 val
= OVL_CHAIN (val
);
1920 if (STAT_HACK_P (val
))
1921 val
= STAT_TYPE (val
);
1922 else if (!DECL_DECLARES_TYPE_P (val
))
1927 /* OVERLOAD with a special OVL_NAME_INDEPENDENT_DECL_P
1928 flag is used under the hood to represent lookup
1929 results which include name-independent declarations,
1930 and get_class_binding_direct is turning that into
1931 TREE_LIST representation (which the callers expect for
1932 ambiguous lookups) instead.
1933 There are 2 reasons for that:
1934 1) in order to keep the member_vec binary search fast, I
1935 think it is better to keep OVL_NAME usable on all elements
1936 because having to special case TREE_LIST would slow
1938 2) the callers need to be able to chain the results anyway
1939 and so need an unshared TREE_LIST they can tweak/destroy. */
1942 while (TREE_CODE (ovl
) == OVERLOAD
1943 && OVL_NAME_INDEPENDENT_DECL_P (ovl
))
1945 val
= tree_cons (NULL_TREE
, OVL_FUNCTION (ovl
), val
);
1946 TREE_TYPE (val
) = error_mark_node
;
1947 ovl
= OVL_CHAIN (ovl
);
1949 if (STAT_HACK_P (ovl
))
1950 val
= tree_cons (NULL_TREE
, STAT_DECL (ovl
), val
);
1952 val
= tree_cons (NULL_TREE
, ovl
, val
);
1953 TREE_TYPE (val
) = error_mark_node
;
1956 else if (STAT_HACK_P (val
))
1957 val
= want_type
? STAT_TYPE (val
) : STAT_DECL (val
);
1958 else if (want_type
&& !DECL_DECLARES_TYPE_P (val
))
1963 if (member_vec
&& !want_type
)
1964 val
= member_vec_linear_search (member_vec
, lookup
);
1966 if (id_equal (lookup
, "_") && !want_type
)
1967 val
= name_independent_linear_search (val
, klass
, lookup
);
1968 else if (!val
|| (TREE_CODE (val
) == OVERLOAD
&& OVL_DEDUP_P (val
)))
1969 /* Dependent using declarations are a 'field', make sure we
1970 return that even if we saw an overload already. */
1971 if (tree field_val
= fields_linear_search (klass
, lookup
, want_type
))
1975 else if (TREE_CODE (field_val
) == USING_DECL
)
1976 val
= ovl_make (field_val
, val
);
1980 /* Extract the conversion operators asked for, unless the general
1981 conversion operator was requested. */
1984 gcc_checking_assert (OVL_FUNCTION (val
) == conv_op_marker
);
1985 val
= OVL_CHAIN (val
);
1986 if (tree type
= TREE_TYPE (name
))
1987 val
= extract_conversion_operator (val
, type
);
1993 /* We're about to lookup NAME in KLASS. Make sure any lazily declared
1994 members are now declared. */
1997 maybe_lazily_declare (tree klass
, tree name
)
1999 /* See big comment anout module_state::write_pendings regarding adding a check
2002 lazy_load_pendings (TYPE_NAME (klass
));
2004 /* Lazily declare functions, if we're going to search these. */
2005 if (IDENTIFIER_CTOR_P (name
))
2007 if (CLASSTYPE_LAZY_DEFAULT_CTOR (klass
))
2008 lazily_declare_fn (sfk_constructor
, klass
);
2009 if (CLASSTYPE_LAZY_COPY_CTOR (klass
))
2010 lazily_declare_fn (sfk_copy_constructor
, klass
);
2011 if (CLASSTYPE_LAZY_MOVE_CTOR (klass
))
2012 lazily_declare_fn (sfk_move_constructor
, klass
);
2014 else if (IDENTIFIER_DTOR_P (name
))
2016 if (CLASSTYPE_LAZY_DESTRUCTOR (klass
))
2017 lazily_declare_fn (sfk_destructor
, klass
);
2019 else if (name
== assign_op_identifier
)
2021 if (CLASSTYPE_LAZY_COPY_ASSIGN (klass
))
2022 lazily_declare_fn (sfk_copy_assignment
, klass
);
2023 if (CLASSTYPE_LAZY_MOVE_ASSIGN (klass
))
2024 lazily_declare_fn (sfk_move_assignment
, klass
);
2028 /* Look for NAME's binding in exactly KLASS. See
2029 get_class_binding_direct for argument description. Does lazy
2030 special function creation as necessary. */
2033 get_class_binding (tree klass
, tree name
, bool want_type
/*=false*/)
2035 klass
= complete_type (klass
);
2037 if (COMPLETE_TYPE_P (klass
))
2038 maybe_lazily_declare (klass
, name
);
2040 return get_class_binding_direct (klass
, name
, want_type
);
2043 /* Find the slot containing overloads called 'NAME'. If there is no
2044 such slot and the class is complete, create an empty one, at the
2045 correct point in the sorted member vector. Otherwise return NULL.
2046 Deals with conv_op marker handling. */
2049 find_member_slot (tree klass
, tree name
)
2051 bool complete_p
= COMPLETE_TYPE_P (klass
);
2053 vec
<tree
, va_gc
> *member_vec
= CLASSTYPE_MEMBER_VEC (klass
);
2056 vec_alloc (member_vec
, 8);
2057 CLASSTYPE_MEMBER_VEC (klass
) = member_vec
;
2059 /* If the class is complete but had no member_vec, we need to
2060 add the TYPE_FIELDS into it. We're also most likely to be
2061 adding ctors & dtors, so ask for 6 spare slots (the
2062 abstract cdtors and their clones). */
2063 member_vec
= set_class_bindings (klass
, 6);
2066 if (IDENTIFIER_CONV_OP_P (name
))
2067 name
= conv_op_identifier
;
2069 unsigned ix
, length
= member_vec
->length ();
2070 for (ix
= 0; ix
< length
; ix
++)
2072 tree
*slot
= &(*member_vec
)[ix
];
2073 tree fn_name
= OVL_NAME (*slot
);
2075 if (fn_name
== name
)
2077 /* If we found an existing slot, it must be a function set.
2078 Even with insertion after completion, because those only
2079 happen with artificial fns that have unspellable names.
2080 This means we do not have to deal with the stat hack
2082 gcc_checking_assert (OVL_P (*slot
));
2083 if (name
== conv_op_identifier
)
2085 gcc_checking_assert (OVL_FUNCTION (*slot
) == conv_op_marker
);
2086 /* Skip the conv-op marker. */
2087 slot
= &OVL_CHAIN (*slot
);
2092 if (complete_p
&& fn_name
> name
)
2096 /* No slot found, add one if the class is complete. */
2099 /* Do exact allocation, as we don't expect to add many. */
2100 gcc_assert (name
!= conv_op_identifier
);
2101 vec_safe_reserve_exact (member_vec
, 1);
2102 CLASSTYPE_MEMBER_VEC (klass
) = member_vec
;
2103 member_vec
->quick_insert (ix
, NULL_TREE
);
2104 return &(*member_vec
)[ix
];
2110 /* KLASS is an incomplete class to which we're adding a method NAME.
2111 Add a slot and deal with conv_op marker handling. */
2114 add_member_slot (tree klass
, tree name
)
2116 gcc_assert (!COMPLETE_TYPE_P (klass
));
2118 vec
<tree
, va_gc
> *member_vec
= CLASSTYPE_MEMBER_VEC (klass
);
2119 vec_safe_push (member_vec
, NULL_TREE
);
2120 CLASSTYPE_MEMBER_VEC (klass
) = member_vec
;
2122 tree
*slot
= &member_vec
->last ();
2123 if (IDENTIFIER_CONV_OP_P (name
))
2125 /* Install the marker prefix. */
2126 *slot
= ovl_make (conv_op_marker
, NULL_TREE
);
2127 slot
= &OVL_CHAIN (*slot
);
2133 /* Comparison function to compare two MEMBER_VEC entries by name.
2134 Because we can have duplicates during insertion of TYPE_FIELDS, we
2135 do extra checking so deduping doesn't have to deal with so many
2139 member_name_cmp (const void *a_p
, const void *b_p
)
2141 tree a
= *(const tree
*)a_p
;
2142 tree b
= *(const tree
*)b_p
;
2143 tree name_a
= DECL_NAME (TREE_CODE (a
) == OVERLOAD
? OVL_FUNCTION (a
) : a
);
2144 tree name_b
= DECL_NAME (TREE_CODE (b
) == OVERLOAD
? OVL_FUNCTION (b
) : b
);
2146 gcc_checking_assert (name_a
&& name_b
);
2147 if (name_a
!= name_b
)
2148 return name_a
< name_b
? -1 : +1;
2150 if (name_a
== conv_op_identifier
)
2152 /* Strip the conv-op markers. */
2153 gcc_checking_assert (OVL_FUNCTION (a
) == conv_op_marker
2154 && OVL_FUNCTION (b
) == conv_op_marker
);
2159 if (TREE_CODE (a
) == OVERLOAD
)
2160 a
= OVL_FUNCTION (a
);
2161 if (TREE_CODE (b
) == OVERLOAD
)
2162 b
= OVL_FUNCTION (b
);
2164 if (id_equal (name_a
, "_"))
2166 /* Sort name-independent members first. */
2167 if (name_independent_decl_p (a
))
2169 if (name_independent_decl_p (b
))
2171 if (DECL_UID (a
) != DECL_UID (b
))
2172 return DECL_UID (a
) < DECL_UID (b
) ? -1 : +1;
2173 gcc_assert (a
== b
);
2179 else if (name_independent_decl_p (b
))
2183 /* We're in STAT_HACK or USING_DECL territory (or possibly error-land). */
2184 if (TREE_CODE (a
) != TREE_CODE (b
))
2186 /* If one of them is a TYPE_DECL, it loses. */
2187 if (TREE_CODE (a
) == TYPE_DECL
)
2189 else if (TREE_CODE (b
) == TYPE_DECL
)
2192 /* If one of them is a USING_DECL, it loses. */
2193 if (TREE_CODE (a
) == USING_DECL
)
2195 else if (TREE_CODE (b
) == USING_DECL
)
2198 /* There are no other cases with different kinds of decls, as
2199 duplicate detection should have kicked in earlier. However,
2200 some erroneous cases get though. */
2201 gcc_assert (errorcount
);
2204 /* Using source location would be the best thing here, but we can
2205 get identically-located decls in the following circumstances:
2207 1) duplicate artificial type-decls for the same type.
2209 2) pack expansions of using-decls.
2211 We should not be doing #1, but in either case it doesn't matter
2212 how we order these. Use UID as a proxy for source ordering, so
2213 that identically-located decls still have a well-defined stable
2215 if (DECL_UID (a
) != DECL_UID (b
))
2216 return DECL_UID (a
) < DECL_UID (b
) ? -1 : +1;
2217 gcc_assert (a
== b
);
2222 gt_pointer_operator new_value
;
2226 /* This routine compares two fields like member_name_cmp but using the
2227 pointer operator in resort_field_decl_data. We don't have to deal
2228 with duplicates here. */
2231 resort_member_name_cmp (const void *a_p
, const void *b_p
)
2233 tree a
= *(const tree
*)a_p
;
2234 tree b
= *(const tree
*)b_p
;
2235 tree name_a
= OVL_NAME (a
);
2236 tree name_b
= OVL_NAME (b
);
2238 resort_data
.new_value (&name_a
, &name_a
, resort_data
.cookie
);
2239 resort_data
.new_value (&name_b
, &name_b
, resort_data
.cookie
);
2241 gcc_checking_assert (name_a
!= name_b
);
2243 return name_a
< name_b
? -1 : +1;
2246 /* Resort CLASSTYPE_MEMBER_VEC because pointers have been reordered. */
2249 resort_type_member_vec (void *obj
, void */
*orig_obj*/
,
2250 gt_pointer_operator new_value
, void* cookie
)
2252 if (vec
<tree
, va_gc
> *member_vec
= (vec
<tree
, va_gc
> *) obj
)
2254 resort_data
.new_value
= new_value
;
2255 resort_data
.cookie
= cookie
;
2256 member_vec
->qsort (resort_member_name_cmp
);
2260 /* Recursively count the number of fields in KLASS, including anonymous
2264 count_class_fields (tree klass
)
2266 unsigned n_fields
= 0;
2268 for (tree fields
= TYPE_FIELDS (klass
); fields
; fields
= DECL_CHAIN (fields
))
2269 if (DECL_DECLARES_FUNCTION_P (fields
))
2270 /* Functions are dealt with separately. */;
2271 else if (TREE_CODE (fields
) == FIELD_DECL
2272 && ANON_AGGR_TYPE_P (TREE_TYPE (fields
)))
2273 n_fields
+= count_class_fields (TREE_TYPE (fields
));
2274 else if (DECL_NAME (fields
))
2280 /* Append all the nonfunction members fields of KLASS to MEMBER_VEC.
2281 Recurse for anonymous members. MEMBER_VEC must have space. */
2284 member_vec_append_class_fields (vec
<tree
, va_gc
> *member_vec
, tree klass
)
2286 for (tree fields
= TYPE_FIELDS (klass
); fields
; fields
= DECL_CHAIN (fields
))
2287 if (DECL_DECLARES_FUNCTION_P (fields
))
2288 /* Functions are handled separately. */;
2289 else if (TREE_CODE (fields
) == FIELD_DECL
2290 && ANON_AGGR_TYPE_P (TREE_TYPE (fields
)))
2291 member_vec_append_class_fields (member_vec
, TREE_TYPE (fields
));
2292 else if (DECL_NAME (fields
))
2294 tree field
= fields
;
2295 /* Mark a conv-op USING_DECL with the conv-op-marker. */
2296 if (TREE_CODE (field
) == USING_DECL
2297 && IDENTIFIER_CONV_OP_P (DECL_NAME (field
)))
2298 field
= ovl_make (conv_op_marker
, field
);
2299 member_vec
->quick_push (field
);
2303 /* Append all of the enum values of ENUMTYPE to MEMBER_VEC.
2304 MEMBER_VEC must have space. */
2307 member_vec_append_enum_values (vec
<tree
, va_gc
> *member_vec
, tree enumtype
)
2309 for (tree values
= TYPE_VALUES (enumtype
);
2310 values
; values
= TREE_CHAIN (values
))
2311 member_vec
->quick_push (TREE_VALUE (values
));
2314 /* MEMBER_VEC has just had new DECLs added to it, but is sorted.
2315 DeDup adjacent DECLS of the same name. We already dealt with
2316 conflict resolution when adding the fields or methods themselves.
2317 There are four cases (which could all be combined):
2318 1) a TYPE_DECL and non TYPE_DECL. Deploy STAT_HACK as appropriate.
2319 2) a USING_DECL and an overload. If the USING_DECL is dependent,
2320 it wins. Otherwise the OVERLOAD does.
2322 4) name-independent members plus others. ...
2324 member_name_cmp will have ordered duplicates as
2325 <name_independent><fns><using><type> */
2328 member_vec_dedup (vec
<tree
, va_gc
> *member_vec
)
2330 unsigned len
= member_vec
->length ();
2336 tree name
= OVL_NAME ((*member_vec
)[0]);
2337 for (unsigned jx
, ix
= 0; ix
< len
; ix
= jx
)
2339 tree current
= NULL_TREE
;
2340 tree to_type
= NULL_TREE
;
2341 tree to_using
= NULL_TREE
;
2342 tree marker
= NULL_TREE
;
2343 unsigned name_independent
= ix
;
2345 for (jx
= ix
; jx
< len
; jx
++)
2347 tree next
= (*member_vec
)[jx
];
2350 tree next_name
= OVL_NAME (next
);
2351 if (next_name
!= name
)
2358 if (IDENTIFIER_CONV_OP_P (name
))
2361 next
= OVL_CHAIN (next
);
2364 if (TREE_CODE (next
) == USING_DECL
)
2366 if (IDENTIFIER_CTOR_P (name
))
2367 /* Dependent inherited ctor. */
2370 next
= strip_using_decl (next
);
2371 if (TREE_CODE (next
) == USING_DECL
)
2377 if (is_overloaded_fn (next
))
2381 if (DECL_DECLARES_TYPE_P (next
))
2387 if (name_independent_decl_p (next
))
2388 name_independent
= jx
+ 1;
2398 current
= ovl_make (to_using
, current
);
2406 current
= stat_hack (current
, to_type
);
2409 for (unsigned kx
= name_independent
; kx
> ix
; --kx
)
2411 current
= (*member_vec
)[kx
- 1];
2412 else if (current
== to_type
)
2413 current
= stat_hack ((*member_vec
)[kx
- 1], to_type
);
2416 current
= ovl_make ((*member_vec
)[kx
- 1], current
);
2417 OVL_NAME_INDEPENDENT_DECL_P (current
) = 1;
2424 OVL_CHAIN (marker
) = current
;
2427 (*member_vec
)[store
++] = current
;
2431 while (store
++ < len
)
2435 /* Add the non-function members to CLASSTYPE_MEMBER_VEC. If there is
2436 no existing MEMBER_VEC and fewer than 8 fields, do nothing. We
2437 know there must be at least 1 field -- the self-reference
2438 TYPE_DECL, except for anon aggregates, which will have at least
2439 one field anyway. If EXTRA < 0, always create the vector. */
2442 set_class_bindings (tree klass
, int extra
)
2444 unsigned n_fields
= count_class_fields (klass
);
2445 vec
<tree
, va_gc
> *member_vec
= CLASSTYPE_MEMBER_VEC (klass
);
2447 if (member_vec
|| n_fields
>= 8 || extra
< 0)
2449 /* Append the new fields. */
2450 vec_safe_reserve_exact (member_vec
, n_fields
+ (extra
>= 0 ? extra
: 0));
2451 member_vec_append_class_fields (member_vec
, klass
);
2456 CLASSTYPE_MEMBER_VEC (klass
) = member_vec
;
2457 member_vec
->qsort (member_name_cmp
);
2458 member_vec_dedup (member_vec
);
2464 /* Insert lately defined enum ENUMTYPE into KLASS for the sorted case. */
2467 insert_late_enum_def_bindings (tree klass
, tree enumtype
)
2470 vec
<tree
, va_gc
> *member_vec
= CLASSTYPE_MEMBER_VEC (klass
);
2472 /* The enum bindings will already be on the TYPE_FIELDS, so don't
2473 count them twice. */
2475 n_fields
= count_class_fields (klass
);
2477 n_fields
= list_length (TYPE_VALUES (enumtype
));
2479 if (member_vec
|| n_fields
>= 8)
2481 vec_safe_reserve_exact (member_vec
, n_fields
);
2482 if (CLASSTYPE_MEMBER_VEC (klass
))
2483 member_vec_append_enum_values (member_vec
, enumtype
);
2485 member_vec_append_class_fields (member_vec
, klass
);
2486 CLASSTYPE_MEMBER_VEC (klass
) = member_vec
;
2487 member_vec
->qsort (member_name_cmp
);
2488 member_vec_dedup (member_vec
);
2492 /* The binding oracle; see cp-tree.h. */
2494 cp_binding_oracle_function
*cp_binding_oracle
;
2496 /* If we have a binding oracle, ask it for all namespace-scoped
2497 definitions of NAME. */
2500 query_oracle (tree name
)
2502 if (!cp_binding_oracle
)
2505 /* LOOKED_UP holds the set of identifiers that we have already
2506 looked up with the oracle. */
2507 static hash_set
<tree
> looked_up
;
2508 if (looked_up
.add (name
))
2511 cp_binding_oracle (CP_ORACLE_IDENTIFIER
, name
);
2514 #ifndef ENABLE_SCOPE_CHECKING
2515 # define ENABLE_SCOPE_CHECKING 0
2517 # define ENABLE_SCOPE_CHECKING 1
2520 /* A free list of "cxx_binding"s, connected by their PREVIOUS. */
2522 static GTY((deletable
)) cxx_binding
*free_bindings
;
2524 /* Initialize VALUE and TYPE field for BINDING, and set the PREVIOUS
2528 cxx_binding_init (cxx_binding
*binding
, tree value
, tree type
)
2530 binding
->value
= value
;
2531 binding
->type
= type
;
2532 binding
->previous
= NULL
;
2535 /* (GC)-allocate a binding object with VALUE and TYPE member initialized. */
2537 static cxx_binding
*
2538 cxx_binding_make (tree value
, tree type
)
2540 cxx_binding
*binding
= free_bindings
;
2543 free_bindings
= binding
->previous
;
2545 binding
= ggc_alloc
<cxx_binding
> ();
2547 /* Clear flags by default. */
2548 LOCAL_BINDING_P (binding
) = false;
2549 INHERITED_VALUE_BINDING_P (binding
) = false;
2550 HIDDEN_TYPE_BINDING_P (binding
) = false;
2552 cxx_binding_init (binding
, value
, type
);
2557 /* Put BINDING back on the free list. */
2560 cxx_binding_free (cxx_binding
*binding
)
2562 binding
->scope
= NULL
;
2563 binding
->previous
= free_bindings
;
2564 free_bindings
= binding
;
2567 /* Create a new binding for NAME (with the indicated VALUE and TYPE
2568 bindings) in the class scope indicated by SCOPE. */
2570 static cxx_binding
*
2571 new_class_binding (tree name
, tree value
, tree type
, cp_binding_level
*scope
)
2573 cp_class_binding cb
= {cxx_binding_make (value
, type
), name
};
2574 cxx_binding
*binding
= cb
.base
;
2575 vec_safe_push (scope
->class_shadowed
, cb
);
2576 binding
->scope
= scope
;
2580 /* Make DECL the innermost binding for ID. The LEVEL is the binding
2581 level at which this declaration is being bound. */
2584 push_binding (tree id
, tree decl
, cp_binding_level
* level
)
2586 cxx_binding
*binding
;
2588 if (level
!= class_binding_level
)
2590 binding
= cxx_binding_make (decl
, NULL_TREE
);
2591 binding
->scope
= level
;
2594 binding
= new_class_binding (id
, decl
, /*type=*/NULL_TREE
, level
);
2596 /* Now, fill in the binding information. */
2597 binding
->previous
= IDENTIFIER_BINDING (id
);
2598 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
2600 /* And put it on the front of the list of bindings for ID. */
2601 IDENTIFIER_BINDING (id
) = binding
;
2604 /* Remove the binding for DECL which should be the innermost binding
2608 pop_local_binding (tree id
, tree decl
)
2610 if (!id
|| IDENTIFIER_ANON_P (id
))
2611 /* It's easiest to write the loops that call this function without
2612 checking whether or not the entities involved have names. We
2613 get here for such an entity. */
2616 /* Get the innermost binding for ID. */
2617 cxx_binding
*binding
= IDENTIFIER_BINDING (id
);
2619 /* The name should be bound. */
2620 gcc_assert (binding
!= NULL
);
2622 /* The DECL will be either the ordinary binding or the type binding
2623 for this identifier. Remove that binding. We don't have to
2624 clear HIDDEN_TYPE_BINDING_P, as the whole binding will be going
2626 if (binding
->value
== decl
)
2627 binding
->value
= NULL_TREE
;
2628 else if (binding
->type
== decl
)
2629 binding
->type
= NULL_TREE
;
2632 /* Name-independent variable was found after at least one declaration
2633 with the same name. */
2634 gcc_assert (TREE_CODE (binding
->value
) == TREE_LIST
);
2635 if (TREE_VALUE (binding
->value
) != decl
)
2637 binding
->value
= nreverse (binding
->value
);
2638 /* Skip over TREE_LISTs added in pushdecl for check_local_shadow
2639 detected declarations, formerly at the tail, now at the start
2641 while (TREE_PURPOSE (binding
->value
) == error_mark_node
)
2642 binding
->value
= TREE_CHAIN (binding
->value
);
2644 gcc_assert (TREE_VALUE (binding
->value
) == decl
);
2645 binding
->value
= TREE_CHAIN (binding
->value
);
2646 while (binding
->value
2647 && TREE_PURPOSE (binding
->value
) == error_mark_node
)
2648 binding
->value
= TREE_CHAIN (binding
->value
);
2651 if (!binding
->value
&& !binding
->type
)
2653 /* We're completely done with the innermost binding for this
2654 identifier. Unhook it from the list of bindings. */
2655 IDENTIFIER_BINDING (id
) = binding
->previous
;
2657 /* Add it to the free list. */
2658 cxx_binding_free (binding
);
2662 /* Remove the bindings for the decls of the current level and leave
2663 the current scope. */
2666 pop_bindings_and_leave_scope (void)
2668 for (tree t
= get_local_decls (); t
; t
= DECL_CHAIN (t
))
2670 tree decl
= TREE_CODE (t
) == TREE_LIST
? TREE_VALUE (t
) : t
;
2671 tree name
= OVL_NAME (decl
);
2673 pop_local_binding (name
, decl
);
2679 /* Strip non dependent using declarations. If DECL is dependent,
2680 surreptitiously create a typename_type and return it. */
2683 strip_using_decl (tree decl
)
2685 if (decl
== NULL_TREE
)
2688 while (TREE_CODE (decl
) == USING_DECL
&& !DECL_DEPENDENT_P (decl
))
2689 decl
= USING_DECL_DECLS (decl
);
2691 if (TREE_CODE (decl
) == USING_DECL
&& DECL_DEPENDENT_P (decl
)
2692 && USING_DECL_TYPENAME_P (decl
))
2694 /* We have found a type introduced by a using
2695 declaration at class scope that refers to a dependent
2698 using typename :: [opt] nested-name-specifier unqualified-id ;
2700 decl
= make_typename_type (USING_DECL_SCOPE (decl
),
2702 typename_type
, tf_error
);
2703 if (decl
!= error_mark_node
)
2704 decl
= TYPE_NAME (decl
);
2710 /* Return true if OVL is an overload for an anticipated builtin. */
2713 anticipated_builtin_p (tree ovl
)
2715 return (TREE_CODE (ovl
) == OVERLOAD
2716 && OVL_HIDDEN_P (ovl
)
2717 && DECL_IS_UNDECLARED_BUILTIN (OVL_FUNCTION (ovl
)));
2720 /* BINDING records an existing declaration for a name in the current scope.
2721 But, DECL is another declaration for that same identifier in the
2722 same scope. This is the `struct stat' hack whereby a non-typedef
2723 class name or enum-name can be bound at the same level as some other
2727 A class name (9.1) or enumeration name (7.2) can be hidden by the
2728 name of an object, function, or enumerator declared in the same scope.
2729 If a class or enumeration name and an object, function, or enumerator
2730 are declared in the same scope (in any order) with the same name, the
2731 class or enumeration name is hidden wherever the object, function, or
2732 enumerator name is visible.
2734 It's the responsibility of the caller to check that
2735 inserting this name is valid here. Returns nonzero if the new binding
2739 supplement_binding (cxx_binding
*binding
, tree decl
)
2741 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
2743 tree bval
= binding
->value
;
2746 && TREE_CODE (bval
) == TREE_LIST
2747 && name_independent_decl_p (TREE_VALUE (bval
)))
2748 bval
= TREE_VALUE (bval
);
2749 tree target_bval
= strip_using_decl (bval
);
2750 tree target_decl
= strip_using_decl (decl
);
2752 if (TREE_CODE (target_decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (target_decl
)
2753 && target_decl
!= target_bval
2754 && (TREE_CODE (target_bval
) != TYPE_DECL
2755 /* We allow pushing an enum multiple times in a class
2756 template in order to handle late matching of underlying
2757 type on an opaque-enum-declaration followed by an
2759 || (processing_template_decl
2760 && TREE_CODE (TREE_TYPE (target_decl
)) == ENUMERAL_TYPE
2761 && TREE_CODE (TREE_TYPE (target_bval
)) == ENUMERAL_TYPE
2762 && (dependent_type_p (ENUM_UNDERLYING_TYPE
2763 (TREE_TYPE (target_decl
)))
2764 || dependent_type_p (ENUM_UNDERLYING_TYPE
2765 (TREE_TYPE (target_bval
)))))))
2766 /* The new name is the type name. */
2767 binding
->type
= decl
;
2768 else if (/* TARGET_BVAL is null when push_class_level_binding moves
2769 an inherited type-binding out of the way to make room
2770 for a new value binding. */
2772 /* TARGET_BVAL is error_mark_node when TARGET_DECL's name
2773 has been used in a non-class scope prior declaration.
2774 In that case, we should have already issued a
2775 diagnostic; for graceful error recovery purpose, pretend
2776 this was the intended declaration for that name. */
2777 || target_bval
== error_mark_node
2778 /* If TARGET_BVAL is anticipated but has not yet been
2779 declared, pretend it is not there at all. */
2780 || anticipated_builtin_p (target_bval
))
2781 binding
->value
= decl
;
2782 else if (TREE_CODE (target_bval
) == TYPE_DECL
2783 && DECL_ARTIFICIAL (target_bval
)
2784 && target_decl
!= target_bval
2785 && (TREE_CODE (target_decl
) != TYPE_DECL
2786 || same_type_p (TREE_TYPE (target_decl
),
2787 TREE_TYPE (target_bval
))))
2789 /* The old binding was a type name. It was placed in
2790 VALUE field because it was thought, at the point it was
2791 declared, to be the only entity with such a name. Move the
2792 type name into the type slot; it is now hidden by the new
2794 binding
->type
= bval
;
2795 binding
->value
= decl
;
2796 binding
->value_is_inherited
= false;
2798 else if (TREE_CODE (target_bval
) == TYPE_DECL
2799 && TREE_CODE (target_decl
) == TYPE_DECL
2800 && DECL_NAME (target_decl
) == DECL_NAME (target_bval
)
2801 && binding
->scope
->kind
!= sk_class
2802 && (same_type_p (TREE_TYPE (target_decl
), TREE_TYPE (target_bval
))
2803 /* If either type involves template parameters, we must
2804 wait until instantiation. */
2805 || uses_template_parms (TREE_TYPE (target_decl
))
2806 || uses_template_parms (TREE_TYPE (target_bval
))))
2807 /* We have two typedef-names, both naming the same type to have
2808 the same name. In general, this is OK because of:
2812 In a given scope, a typedef specifier can be used to redefine
2813 the name of any type declared in that scope to refer to the
2814 type to which it already refers.
2816 However, in class scopes, this rule does not apply due to the
2817 stricter language in [class.mem] prohibiting redeclarations of
2820 /* There can be two block-scope declarations of the same variable,
2821 so long as they are `extern' declarations. However, there cannot
2822 be two declarations of the same static data member:
2826 A member shall not be declared twice in the
2827 member-specification. */
2828 else if (VAR_P (target_decl
)
2829 && VAR_P (target_bval
)
2830 && DECL_EXTERNAL (target_decl
) && DECL_EXTERNAL (target_bval
)
2831 && !DECL_CLASS_SCOPE_P (target_decl
))
2833 duplicate_decls (decl
, binding
->value
);
2836 else if (TREE_CODE (decl
) == NAMESPACE_DECL
2837 && TREE_CODE (bval
) == NAMESPACE_DECL
2838 && DECL_NAMESPACE_ALIAS (decl
)
2839 && DECL_NAMESPACE_ALIAS (bval
)
2840 && ORIGINAL_NAMESPACE (bval
) == ORIGINAL_NAMESPACE (decl
))
2841 /* [namespace.alias]
2843 In a declarative region, a namespace-alias-definition can be
2844 used to redefine a namespace-alias declared in that declarative
2845 region to refer only to the namespace to which it already
2848 else if (TREE_CODE (bval
) == USING_DECL
2849 && CONST_DECL_USING_P (decl
))
2850 /* Let the clone hide the using-decl that introduced it. */
2851 binding
->value
= decl
;
2852 else if (name_independent_decl_p (decl
))
2854 if (cxx_dialect
< cxx26
)
2855 pedwarn (DECL_SOURCE_LOCATION (decl
), OPT_Wc__26_extensions
,
2856 "name-independent declarations only available with "
2857 "%<-std=c++2c%> or %<-std=gnu++2c%>");
2858 binding
->value
= name_lookup::ambiguous (decl
, binding
->value
);
2862 if (!error_operand_p (bval
))
2863 diagnose_name_conflict (decl
, bval
);
2870 /* Diagnose a name conflict between DECL and BVAL.
2872 This is non-static so maybe_push_used_methods can use it and avoid changing
2873 the diagnostic for inherit/using4.C; otherwise it should not be used from
2874 outside this file. */
2877 diagnose_name_conflict (tree decl
, tree bval
)
2879 if (TREE_CODE (decl
) == TREE_CODE (bval
)
2880 && TREE_CODE (decl
) != NAMESPACE_DECL
2881 && !DECL_DECLARES_FUNCTION_P (decl
)
2882 && (TREE_CODE (decl
) != TYPE_DECL
2883 || DECL_ARTIFICIAL (decl
) == DECL_ARTIFICIAL (bval
))
2884 && CP_DECL_CONTEXT (decl
) == CP_DECL_CONTEXT (bval
))
2886 if (concept_definition_p (decl
))
2887 error ("redeclaration of %q#D with different template parameters",
2890 error ("redeclaration of %q#D", decl
);
2893 error ("%q#D conflicts with a previous declaration", decl
);
2895 inform (location_of (bval
), "previous declaration %q#D", bval
);
2898 /* Replace BINDING's current value on its scope's name list with
2902 update_local_overload (cxx_binding
*binding
, tree newval
)
2906 for (d
= &binding
->scope
->names
; ; d
= &TREE_CHAIN (*d
))
2907 if (*d
== binding
->value
)
2909 /* Stitch new list node in. */
2910 *d
= tree_cons (DECL_NAME (*d
), NULL_TREE
, TREE_CHAIN (*d
));
2913 else if (TREE_CODE (*d
) == TREE_LIST
&& TREE_VALUE (*d
) == binding
->value
)
2916 TREE_VALUE (*d
) = newval
;
2919 /* Compares the parameter-type-lists of ONE and TWO and
2920 returns false if they are different. If the DECLs are template
2921 functions, the return types and the template parameter lists are
2922 compared too (DR 565). */
2925 matching_fn_p (tree one
, tree two
)
2927 if (TREE_CODE (one
) != TREE_CODE (two
))
2930 if (!compparms (TYPE_ARG_TYPES (TREE_TYPE (one
)),
2931 TYPE_ARG_TYPES (TREE_TYPE (two
))))
2934 if (TREE_CODE (one
) == TEMPLATE_DECL
)
2936 /* Compare template parms. */
2937 if (!comp_template_parms (DECL_TEMPLATE_PARMS (one
),
2938 DECL_TEMPLATE_PARMS (two
)))
2941 /* And return type. */
2942 if (!same_type_p (TREE_TYPE (TREE_TYPE (one
)),
2943 TREE_TYPE (TREE_TYPE (two
))))
2947 if (!equivalently_constrained (one
, two
))
2953 /* Push DECL into nonclass LEVEL BINDING or SLOT. OLD is the current
2954 binding value (possibly with anticipated builtins stripped).
2955 Diagnose conflicts and return updated decl. */
2958 update_binding (cp_binding_level
*level
, cxx_binding
*binding
, tree
*slot
,
2959 tree old
, tree decl
, bool hiding
= false)
2961 tree old_type
= NULL_TREE
;
2962 bool hide_type
= false;
2963 bool hide_value
= false;
2964 bool name_independent_p
= false;
2968 old_type
= binding
->type
;
2969 hide_type
= HIDDEN_TYPE_BINDING_P (binding
);
2971 hide_value
= hide_type
, hide_type
= false;
2972 name_independent_p
= name_independent_decl_p (decl
);
2974 else if (STAT_HACK_P (*slot
))
2976 old_type
= STAT_TYPE (*slot
);
2977 hide_type
= STAT_TYPE_HIDDEN_P (*slot
);
2978 hide_value
= STAT_DECL_HIDDEN_P (*slot
);
2982 tree to_type
= old_type
;
2983 bool local_overload
= false;
2985 gcc_assert (!level
|| level
->kind
== sk_namespace
? !binding
2986 : level
->kind
!= sk_class
&& !slot
);
2988 if (old
== error_mark_node
)
2991 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
2993 /* Pushing an artificial decl. We should not find another
2994 artificial decl here already -- lookup_elaborated_type will
2995 have already found it. */
2996 gcc_checking_assert (!to_type
2997 && !(old
&& DECL_IMPLICIT_TYPEDEF_P (old
)));
3001 /* Put DECL into the type slot. */
3002 gcc_checking_assert (!to_type
);
3008 hide_value
= hiding
;
3013 if (old
&& DECL_IMPLICIT_TYPEDEF_P (old
))
3015 /* OLD is an implicit typedef. Move it to to_type. */
3016 gcc_checking_assert (!to_type
);
3019 hide_type
= hide_value
;
3024 if (DECL_DECLARES_FUNCTION_P (decl
))
3028 else if (OVL_P (old
))
3030 for (ovl_iterator
iter (old
); iter
; ++iter
)
3034 if (iter
.using_p () && matching_fn_p (fn
, decl
))
3036 gcc_checking_assert (!iter
.hidden_p ());
3037 /* If a function declaration in namespace scope or
3038 block scope has the same name and the same
3039 parameter-type- list (8.3.5) as a function
3040 introduced by a using-declaration, and the
3041 declarations do not declare the same function,
3042 the program is ill-formed. [namespace.udecl]/14 */
3043 if (tree match
= duplicate_decls (decl
, fn
, hiding
))
3046 /* FIXME: To preserve existing error behavior, we
3047 still push the decl. This might change. */
3048 diagnose_name_conflict (decl
, fn
);
3055 if (to_type
!= old_type
3057 && MAYBE_CLASS_TYPE_P (TREE_TYPE (to_type
))
3058 && !(DECL_IN_SYSTEM_HEADER (decl
)
3059 && DECL_IN_SYSTEM_HEADER (to_type
)))
3060 warning (OPT_Wshadow
, "%q#D hides constructor for %q#D",
3063 local_overload
= old
&& level
&& level
->kind
!= sk_namespace
;
3064 to_val
= ovl_insert (decl
, old
, -int (hiding
));
3068 if (name_independent_p
)
3069 to_val
= name_lookup::ambiguous (decl
, old
);
3070 else if (TREE_CODE (old
) != TREE_CODE (decl
))
3071 /* Different kinds of decls conflict. */
3073 else if (TREE_CODE (old
) == TYPE_DECL
)
3075 if (same_type_p (TREE_TYPE (old
), TREE_TYPE (decl
)))
3076 /* Two type decls to the same type. Do nothing. */
3081 else if (TREE_CODE (old
) == NAMESPACE_DECL
)
3083 /* Two maybe-aliased namespaces. If they're to the same target
3084 namespace, that's ok. */
3085 if (ORIGINAL_NAMESPACE (old
) != ORIGINAL_NAMESPACE (decl
))
3088 /* The new one must be an alias at this point. */
3089 gcc_assert (DECL_NAMESPACE_ALIAS (decl
));
3092 else if (TREE_CODE (old
) == VAR_DECL
)
3094 /* There can be two block-scope declarations of the same
3095 variable, so long as they are `extern' declarations. */
3096 if (!DECL_EXTERNAL (old
) || !DECL_EXTERNAL (decl
))
3098 else if (tree match
= duplicate_decls (decl
, old
))
3100 gcc_checking_assert (!hide_value
&& !hiding
);
3109 diagnose_name_conflict (decl
, old
);
3121 gcc_checking_assert (binding
->value
&& OVL_P (binding
->value
));
3122 update_local_overload (binding
, to_val
);
3125 && !(TREE_CODE (decl
) == NAMESPACE_DECL
3126 && !DECL_NAMESPACE_ALIAS (decl
)))
3127 /* Don't add namespaces here. They're done in
3129 add_decl_to_level (level
, decl
);
3133 if (STAT_HACK_P (*slot
))
3135 STAT_TYPE (*slot
) = to_type
;
3136 STAT_DECL (*slot
) = to_val
;
3137 STAT_TYPE_HIDDEN_P (*slot
) = hide_type
;
3138 STAT_DECL_HIDDEN_P (*slot
) = hide_value
;
3140 else if (to_type
|| hide_value
)
3142 *slot
= stat_hack (to_val
, to_type
);
3143 STAT_TYPE_HIDDEN_P (*slot
) = hide_type
;
3144 STAT_DECL_HIDDEN_P (*slot
) = hide_value
;
3148 gcc_checking_assert (!hide_type
);
3154 binding
->type
= to_type
;
3155 binding
->value
= to_val
;
3156 HIDDEN_TYPE_BINDING_P (binding
) = hide_type
|| hide_value
;
3163 /* Table of identifiers to extern C declarations (or LISTS thereof). */
3165 static GTY(()) hash_table
<named_decl_hash
> *extern_c_decls
;
3167 /* DECL has C linkage. If we have an existing instance, make sure the
3168 new one is compatible. Make sure it has the same exception
3169 specification [7.5, 7.6]. Add DECL to the map. */
3172 check_extern_c_conflict (tree decl
)
3174 /* Ignore artificial or system header decls. */
3175 if (DECL_ARTIFICIAL (decl
) || DECL_IN_SYSTEM_HEADER (decl
))
3178 /* This only applies to decls at namespace scope. */
3179 if (!DECL_NAMESPACE_SCOPE_P (decl
))
3182 if (!extern_c_decls
)
3183 extern_c_decls
= hash_table
<named_decl_hash
>::create_ggc (127);
3185 tree
*slot
= extern_c_decls
3186 ->find_slot_with_hash (DECL_NAME (decl
),
3187 IDENTIFIER_HASH_VALUE (DECL_NAME (decl
)), INSERT
);
3188 if (tree old
= *slot
)
3190 if (TREE_CODE (old
) == OVERLOAD
)
3191 old
= OVL_FUNCTION (old
);
3194 if (DECL_CONTEXT (old
) == DECL_CONTEXT (decl
))
3195 ; /* If they're in the same context, we'll have already complained
3196 about a (possible) mismatch, when inserting the decl. */
3197 else if (!decls_match (decl
, old
))
3199 else if (TREE_CODE (decl
) == FUNCTION_DECL
3200 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (old
)),
3201 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (decl
)),
3204 else if (DECL_ASSEMBLER_NAME_SET_P (old
))
3205 SET_DECL_ASSEMBLER_NAME (decl
, DECL_ASSEMBLER_NAME (old
));
3209 auto_diagnostic_group d
;
3210 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
3211 "conflicting C language linkage declaration %q#D", decl
);
3212 inform (DECL_SOURCE_LOCATION (old
),
3213 "previous declaration %q#D", old
);
3215 inform (DECL_SOURCE_LOCATION (decl
),
3216 "due to different exception specifications");
3221 /* The hash table expects OVERLOADS, so construct one with
3222 OLD as both the function and the chain. This allocate
3223 an excess OVERLOAD node, but it's rare to have multiple
3224 extern "C" decls of the same name. And we save
3225 complicating the hash table logic (which is used
3227 *slot
= ovl_make (old
, old
);
3229 slot
= &OVL_CHAIN (*slot
);
3231 /* Chain it on for c_linkage_binding's use. */
3232 *slot
= tree_cons (NULL_TREE
, decl
, *slot
);
3239 /* Returns a list of C-linkage decls with the name NAME. Used in
3240 c-family/c-pragma.cc to implement redefine_extname pragma. */
3243 c_linkage_bindings (tree name
)
3246 if (tree
*slot
= extern_c_decls
3247 ->find_slot_with_hash (name
, IDENTIFIER_HASH_VALUE (name
), NO_INSERT
))
3249 tree result
= *slot
;
3250 if (TREE_CODE (result
) == OVERLOAD
)
3251 result
= OVL_CHAIN (result
);
3258 /* Subroutine of check_local_shadow. */
3261 inform_shadowed (tree shadowed
)
3263 inform (DECL_SOURCE_LOCATION (shadowed
),
3264 "shadowed declaration is here");
3267 /* DECL is being declared at a local scope. Emit suitable shadow
3271 check_local_shadow (tree decl
)
3273 /* Don't complain about the parms we push and then pop
3274 while tentatively parsing a function declarator. */
3275 if (TREE_CODE (decl
) == PARM_DECL
&& !DECL_CONTEXT (decl
))
3278 tree old
= NULL_TREE
;
3279 cp_binding_level
*old_scope
= NULL
;
3280 if (cxx_binding
*binding
= outer_binding (DECL_NAME (decl
), NULL
, true))
3282 old
= binding
->value
;
3283 old_scope
= binding
->scope
;
3287 && (TREE_CODE (old
) == PARM_DECL
3289 || (TREE_CODE (old
) == TYPE_DECL
3290 && (!DECL_ARTIFICIAL (old
)
3291 || TREE_CODE (decl
) == TYPE_DECL
)))
3292 && DECL_FUNCTION_SCOPE_P (old
)
3293 && (!DECL_ARTIFICIAL (decl
)
3294 || is_capture_proxy (decl
)
3295 || DECL_IMPLICIT_TYPEDEF_P (decl
)
3296 || (VAR_P (decl
) && DECL_ANON_UNION_VAR_P (decl
))))
3298 /* DECL shadows a local thing possibly of interest. */
3300 /* DR 2211: check that captures and parameters
3301 do not have the same name. */
3302 if (is_capture_proxy (decl
))
3304 if (current_lambda_expr ()
3305 && DECL_CONTEXT (old
) == lambda_function (current_lambda_expr ())
3306 && TREE_CODE (old
) == PARM_DECL
3307 && DECL_NAME (decl
) != this_identifier
)
3308 error_at (DECL_SOURCE_LOCATION (old
),
3309 "lambda parameter %qD "
3310 "previously declared as a capture", old
);
3313 /* Don't complain if it's from an enclosing function. */
3314 else if (DECL_CONTEXT (old
) == current_function_decl
3315 && TREE_CODE (decl
) != PARM_DECL
3316 && TREE_CODE (old
) == PARM_DECL
)
3318 /* Go to where the parms should be and see if we find
3320 cp_binding_level
*b
= current_binding_level
->level_chain
;
3322 if (in_function_try_handler
&& b
->kind
== sk_catch
)
3325 /* Skip artificially added scopes which aren't present
3326 in the C++ standard, e.g. for function-try-block or
3327 ctor/dtor cleanups. */
3328 while (b
->artificial
)
3331 /* [basic.scope.param] A parameter name shall not be redeclared
3332 in the outermost block of the function definition. */
3333 if (b
->kind
== sk_function_parms
)
3335 if (name_independent_decl_p (decl
))
3338 auto_diagnostic_group d
;
3340 if (DECL_EXTERNAL (decl
))
3341 emit
= pedwarn (DECL_SOURCE_LOCATION (decl
), OPT_Wpedantic
,
3342 "declaration of %q#D shadows a parameter",
3345 error_at (DECL_SOURCE_LOCATION (decl
),
3346 "declaration of %q#D shadows a parameter", decl
);
3348 inform (DECL_SOURCE_LOCATION (old
),
3349 "%q#D previously declared here", old
);
3354 /* The local structure or class can't use parameters of
3355 the containing function anyway. */
3356 if (DECL_CONTEXT (old
) != current_function_decl
)
3358 for (cp_binding_level
*scope
= current_binding_level
;
3359 scope
!= old_scope
; scope
= scope
->level_chain
)
3360 if (scope
->kind
== sk_class
3361 && !LAMBDA_TYPE_P (scope
->this_entity
))
3364 /* Error if redeclaring a local declared in a
3365 init-statement or in the condition of an if or
3366 switch statement when the new declaration is in the
3367 outermost block of the controlled statement.
3368 Redeclaring a variable from a for or while condition is
3369 detected elsewhere. */
3370 else if (VAR_P (old
)
3371 && old_scope
== current_binding_level
->level_chain
3372 && (old_scope
->kind
== sk_cond
|| old_scope
->kind
== sk_for
))
3374 if (name_independent_decl_p (decl
))
3377 auto_diagnostic_group d
;
3379 if (DECL_EXTERNAL (decl
))
3380 emit
= pedwarn (DECL_SOURCE_LOCATION (decl
), OPT_Wpedantic
,
3381 "redeclaration of %q#D", decl
);
3383 error_at (DECL_SOURCE_LOCATION (decl
),
3384 "redeclaration of %q#D", decl
);
3386 inform (DECL_SOURCE_LOCATION (old
),
3387 "%q#D previously declared here", old
);
3391 3.3.3/3: The name declared in an exception-declaration (...)
3392 shall not be redeclared in the outermost block of the handler.
3393 3.3.3/2: A parameter name shall not be redeclared (...) in
3394 the outermost block of any handler associated with a
3395 function-try-block. */
3396 else if (TREE_CODE (old
) == VAR_DECL
3397 && old_scope
== current_binding_level
->level_chain
3398 && old_scope
->kind
== sk_catch
)
3400 if (name_independent_decl_p (decl
))
3403 auto_diagnostic_group d
;
3405 if (DECL_EXTERNAL (decl
))
3406 emit
= pedwarn (DECL_SOURCE_LOCATION (decl
), OPT_Wpedantic
,
3407 "redeclaration of %q#D", decl
);
3409 emit
= permerror (DECL_SOURCE_LOCATION (decl
),
3410 "redeclaration of %q#D", decl
);
3412 inform (DECL_SOURCE_LOCATION (old
),
3413 "%q#D previously declared here", old
);
3417 /* Don't emit -Wshadow* warnings for name-independent decls. */
3418 if (name_independent_decl_p (decl
) || name_independent_decl_p (old
))
3421 /* If '-Wshadow=compatible-local' is specified without other
3422 -Wshadow= flags, we will warn only when the type of the
3423 shadowing variable (DECL) can be converted to that of the
3424 shadowed parameter (OLD_LOCAL). The reason why we only check
3425 if DECL's type can be converted to OLD_LOCAL's type (but not the
3426 other way around) is because when users accidentally shadow a
3427 parameter, more than often they would use the variable
3428 thinking (mistakenly) it's still the parameter. It would be
3429 rare that users would use the variable in the place that
3430 expects the parameter but thinking it's a new decl.
3431 If either object is a TYPE_DECL, '-Wshadow=compatible-local'
3432 warns regardless of whether one of the types involved
3433 is a subclass of the other, since that is never okay. */
3435 enum opt_code warning_code
;
3437 warning_code
= OPT_Wshadow
;
3438 else if ((TREE_CODE (decl
) == TYPE_DECL
)
3439 ^ (TREE_CODE (old
) == TYPE_DECL
))
3440 /* If exactly one is a type, they aren't compatible. */
3441 warning_code
= OPT_Wshadow_local
;
3442 else if ((TREE_TYPE (old
)
3444 && same_type_p (TREE_TYPE (old
), TREE_TYPE (decl
)))
3445 || TREE_CODE (decl
) == TYPE_DECL
3446 || TREE_CODE (old
) == TYPE_DECL
3447 || (!dependent_type_p (TREE_TYPE (decl
))
3448 && !dependent_type_p (TREE_TYPE (old
))
3449 /* If the new decl uses auto, we don't yet know
3450 its type (the old type cannot be using auto
3451 at this point, without also being
3452 dependent). This is an indication we're
3453 (now) doing the shadow checking too
3455 && !type_uses_auto (TREE_TYPE (decl
))
3456 && can_convert_arg (TREE_TYPE (old
), TREE_TYPE (decl
),
3457 decl
, LOOKUP_IMPLICIT
, tf_none
)))
3458 warning_code
= OPT_Wshadow_compatible_local
;
3460 warning_code
= OPT_Wshadow_local
;
3463 if (TREE_CODE (old
) == PARM_DECL
)
3464 msg
= "declaration of %q#D shadows a parameter";
3465 else if (is_capture_proxy (old
))
3466 msg
= "declaration of %qD shadows a lambda capture";
3468 msg
= "declaration of %qD shadows a previous local";
3470 auto_diagnostic_group d
;
3471 if (warning_at (DECL_SOURCE_LOCATION (decl
), warning_code
, msg
, decl
))
3472 inform_shadowed (old
);
3479 /* Don't emit -Wshadow for name-independent decls. */
3480 if (name_independent_decl_p (decl
))
3483 /* Don't warn for artificial things that are not implicit typedefs. */
3484 if (DECL_ARTIFICIAL (decl
) && !DECL_IMPLICIT_TYPEDEF_P (decl
))
3487 if (nonlambda_method_basetype ())
3488 if (tree member
= lookup_member (current_nonlambda_class_type (),
3489 DECL_NAME (decl
), /*protect=*/0,
3490 /*want_type=*/false, tf_warning_or_error
))
3492 member
= MAYBE_BASELINK_FUNCTIONS (member
);
3494 /* Warn if a variable shadows a non-function, or the variable
3495 is a function or a pointer-to-function. */
3496 if ((!OVL_P (member
)
3497 || TREE_CODE (decl
) == FUNCTION_DECL
3498 || (TREE_TYPE (decl
)
3499 && (TYPE_PTRFN_P (TREE_TYPE (decl
))
3500 || TYPE_PTRMEMFUNC_P (TREE_TYPE (decl
)))))
3501 && !warning_suppressed_p (decl
, OPT_Wshadow
))
3503 auto_diagnostic_group d
;
3504 if (warning_at (DECL_SOURCE_LOCATION (decl
), OPT_Wshadow
,
3505 "declaration of %qD shadows a member of %qT",
3506 decl
, current_nonlambda_class_type ())
3509 inform_shadowed (member
);
3510 suppress_warning (decl
, OPT_Wshadow
);
3516 /* Now look for a namespace shadow. */
3517 old
= find_namespace_value (current_namespace
, DECL_NAME (decl
));
3520 || (TREE_CODE (old
) == TYPE_DECL
3521 && (!DECL_ARTIFICIAL (old
)
3522 || TREE_CODE (decl
) == TYPE_DECL
)))
3523 && !DECL_EXTERNAL (decl
)
3524 && !instantiating_current_function_p ()
3525 && !warning_suppressed_p (decl
, OPT_Wshadow
))
3526 /* XXX shadow warnings in outer-more namespaces */
3528 auto_diagnostic_group d
;
3529 if (warning_at (DECL_SOURCE_LOCATION (decl
), OPT_Wshadow
,
3530 "declaration of %qD shadows a global declaration",
3533 inform_shadowed (old
);
3534 suppress_warning (decl
, OPT_Wshadow
);
3542 /* DECL is being pushed inside function CTX. Set its context, if
3546 set_decl_context_in_fn (tree ctx
, tree decl
)
3548 if (TREE_CODE (decl
) == FUNCTION_DECL
3549 || (VAR_P (decl
) && DECL_EXTERNAL (decl
)))
3550 /* Make sure local externs are marked as such. OMP UDRs really
3551 are nested functions. */
3552 gcc_checking_assert (DECL_LOCAL_DECL_P (decl
)
3553 && (DECL_NAMESPACE_SCOPE_P (decl
)
3554 || (TREE_CODE (decl
) == FUNCTION_DECL
3555 && DECL_OMP_DECLARE_REDUCTION_P (decl
))));
3557 if (!DECL_CONTEXT (decl
)
3558 /* When parsing the parameter list of a function declarator,
3559 don't set DECL_CONTEXT to an enclosing function. */
3560 && !(TREE_CODE (decl
) == PARM_DECL
3561 && parsing_function_declarator ()))
3562 DECL_CONTEXT (decl
) = ctx
;
3565 /* DECL is a local extern decl. Find or create the namespace-scope
3566 decl that it aliases. Also, determines the linkage of DECL. */
3569 push_local_extern_decl_alias (tree decl
)
3571 if (dependent_type_p (TREE_TYPE (decl
))
3572 || (processing_template_decl
3574 && CP_DECL_THREAD_LOCAL_P (decl
)))
3576 /* EH specs were not part of the function type prior to c++17, but
3577 we still can't go pushing dependent eh specs into the namespace. */
3578 if (cxx_dialect
< cxx17
3579 && TREE_CODE (decl
) == FUNCTION_DECL
3580 && (value_dependent_expression_p
3581 (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (decl
)))))
3584 gcc_checking_assert (!DECL_LANG_SPECIFIC (decl
)
3585 || !DECL_TEMPLATE_INFO (decl
));
3586 if (DECL_LANG_SPECIFIC (decl
) && DECL_LOCAL_DECL_ALIAS (decl
))
3587 /* We're instantiating a non-dependent local decl, it already
3591 tree alias
= NULL_TREE
;
3593 if (DECL_SIZE (decl
) && !TREE_CONSTANT (DECL_SIZE (decl
)))
3594 /* Do not let a VLA creep into a namespace. Diagnostic will be
3595 emitted in layout_var_decl later. */
3596 alias
= error_mark_node
;
3599 /* First look for a decl that matches. */
3600 tree ns
= CP_DECL_CONTEXT (decl
);
3601 tree binding
= find_namespace_value (ns
, DECL_NAME (decl
));
3603 if (binding
&& TREE_CODE (binding
) != TREE_LIST
)
3604 for (ovl_iterator
iter (binding
); iter
; ++iter
)
3605 if (decls_match (decl
, *iter
, /*record_versions*/false))
3613 /* No existing namespace-scope decl. Make one. */
3614 alias
= copy_decl (decl
);
3615 if (TREE_CODE (alias
) == FUNCTION_DECL
)
3617 /* Recontextualize the parms. */
3618 for (tree
*chain
= &DECL_ARGUMENTS (alias
);
3619 *chain
; chain
= &DECL_CHAIN (*chain
))
3621 *chain
= copy_decl (*chain
);
3622 DECL_CONTEXT (*chain
) = alias
;
3625 tree type
= TREE_TYPE (alias
);
3626 for (tree args
= TYPE_ARG_TYPES (type
);
3627 args
; args
= TREE_CHAIN (args
))
3628 if (TREE_PURPOSE (args
))
3630 /* There are default args. Lose them. */
3631 tree nargs
= NULL_TREE
;
3632 tree
*chain
= &nargs
;
3633 for (args
= TYPE_ARG_TYPES (type
);
3634 args
; args
= TREE_CHAIN (args
))
3635 if (args
== void_list_node
)
3643 = build_tree_list (NULL_TREE
, TREE_VALUE (args
));
3644 chain
= &TREE_CHAIN (*chain
);
3647 tree fn_type
= build_function_type (TREE_TYPE (type
), nargs
);
3649 fn_type
= apply_memfn_quals
3650 (fn_type
, type_memfn_quals (type
));
3652 fn_type
= build_cp_fntype_variant
3653 (fn_type
, type_memfn_rqual (type
),
3654 TYPE_RAISES_EXCEPTIONS (type
),
3655 TYPE_HAS_LATE_RETURN_TYPE (type
));
3657 TREE_TYPE (alias
) = fn_type
;
3662 /* This is the real thing. */
3663 DECL_LOCAL_DECL_P (alias
) = false;
3665 /* Expected default linkage is from the namespace. */
3666 TREE_PUBLIC (alias
) = TREE_PUBLIC (ns
);
3667 push_nested_namespace (ns
);
3668 alias
= pushdecl (alias
, /* hiding= */true);
3669 pop_nested_namespace (ns
);
3671 && CP_DECL_THREAD_LOCAL_P (decl
)
3672 && alias
!= error_mark_node
)
3673 set_decl_tls_model (alias
, DECL_TLS_MODEL (decl
));
3675 /* Adjust visibility. */
3676 determine_visibility (alias
);
3680 retrofit_lang_decl (decl
);
3681 DECL_LOCAL_DECL_ALIAS (decl
) = alias
;
3684 /* If DECL has non-internal linkage, and we have a module vector,
3685 record it in the appropriate slot. We have already checked for
3689 maybe_record_mergeable_decl (tree
*slot
, tree name
, tree decl
)
3691 if (TREE_CODE (*slot
) != BINDING_VECTOR
)
3694 if (!TREE_PUBLIC (CP_DECL_CONTEXT (decl
)))
3695 /* Member of internal namespace. */
3698 tree not_tmpl
= STRIP_TEMPLATE (decl
);
3699 if ((TREE_CODE (not_tmpl
) == FUNCTION_DECL
3700 || VAR_P (not_tmpl
))
3701 && DECL_THIS_STATIC (not_tmpl
))
3702 /* Internal linkage. */
3705 bool is_attached
= (DECL_LANG_SPECIFIC (not_tmpl
)
3706 && DECL_MODULE_ATTACH_P (not_tmpl
));
3707 tree
*gslot
= get_fixed_binding_slot
3708 (slot
, name
, is_attached
? BINDING_SLOT_PARTITION
: BINDING_SLOT_GLOBAL
,
3714 = BINDING_VECTOR_CLUSTER (*slot
, 0).slots
[BINDING_SLOT_CURRENT
];
3716 if (!STAT_HACK_P (tree (orig
)))
3717 orig
= stat_hack (tree (orig
));
3719 MODULE_BINDING_GLOBAL_P (tree (orig
)) = true;
3722 add_mergeable_namespace_entity (gslot
, decl
);
3725 /* DECL is being pushed. Check whether it hides or ambiguates
3726 something seen as an import. This include decls seen in our own
3727 interface, which is OK. Also, check for merging a
3728 global/partition decl. */
3731 check_module_override (tree decl
, tree mvec
, bool hiding
,
3732 tree scope
, tree name
)
3734 tree match
= NULL_TREE
;
3735 bitmap imports
= get_import_bitmap ();
3736 binding_cluster
*cluster
= BINDING_VECTOR_CLUSTER_BASE (mvec
);
3737 unsigned ix
= BINDING_VECTOR_NUM_CLUSTERS (mvec
);
3739 if (BINDING_VECTOR_SLOTS_PER_CLUSTER
== BINDING_SLOTS_FIXED
)
3745 for (; ix
--; cluster
++)
3746 for (unsigned jx
= 0; jx
!= BINDING_VECTOR_SLOTS_PER_CLUSTER
; jx
++)
3748 /* Are we importing this module? */
3749 if (cluster
->indices
[jx
].span
!= 1)
3751 if (!cluster
->indices
[jx
].base
)
3753 if (!bitmap_bit_p (imports
, cluster
->indices
[jx
].base
))
3756 if (cluster
->slots
[jx
].is_lazy ())
3758 gcc_assert (cluster
->indices
[jx
].span
== 1);
3759 lazy_load_binding (cluster
->indices
[jx
].base
,
3760 scope
, name
, &cluster
->slots
[jx
]);
3762 tree bind
= cluster
->slots
[jx
];
3764 /* Errors could cause there to be nothing. */
3767 if (STAT_HACK_P (bind
))
3768 /* We do not have to check STAT_TYPE here, the xref_tag
3769 machinery deals with that problem. */
3770 bind
= STAT_VISIBLE (bind
);
3772 for (ovl_iterator
iter (bind
); iter
; ++iter
)
3773 if (!iter
.using_p ())
3775 match
= duplicate_decls (decl
, *iter
, hiding
);
3781 if (TREE_PUBLIC (scope
) && TREE_PUBLIC (STRIP_TEMPLATE (decl
))
3782 /* Namespaces are dealt with specially in
3783 make_namespace_finish. */
3784 && !(TREE_CODE (decl
) == NAMESPACE_DECL
&& !DECL_NAMESPACE_ALIAS (decl
)))
3786 /* Look in the appropriate mergeable decl slot. */
3787 tree mergeable
= NULL_TREE
;
3788 if (named_module_p ())
3789 mergeable
= BINDING_VECTOR_CLUSTER (mvec
, BINDING_SLOT_PARTITION
3790 / BINDING_VECTOR_SLOTS_PER_CLUSTER
)
3791 .slots
[BINDING_SLOT_PARTITION
% BINDING_VECTOR_SLOTS_PER_CLUSTER
];
3793 mergeable
= BINDING_VECTOR_CLUSTER (mvec
, 0).slots
[BINDING_SLOT_GLOBAL
];
3795 for (ovl_iterator
iter (mergeable
); iter
; ++iter
)
3797 match
= duplicate_decls (decl
, *iter
, hiding
);
3806 if (match
!= error_mark_node
)
3808 if (named_module_p ())
3809 BINDING_VECTOR_PARTITION_DUPS_P (mvec
) = true;
3811 BINDING_VECTOR_GLOBAL_DUPS_P (mvec
) = true;
3819 /* Record DECL as belonging to the current lexical scope. Check for
3820 errors (such as an incompatible declaration for the same name
3821 already seen in the same scope).
3823 The new binding is hidden if HIDING is true (an anticipated builtin
3826 Returns either DECL or an old decl for the same name. If an old
3827 decl is returned, it may have been smashed to agree with what DECL
3831 pushdecl (tree decl
, bool hiding
)
3833 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
3835 if (decl
== error_mark_node
)
3836 return error_mark_node
;
3838 if (!DECL_TEMPLATE_PARM_P (decl
) && current_function_decl
&& !hiding
)
3839 set_decl_context_in_fn (current_function_decl
, decl
);
3841 /* The binding level we will be pushing into. During local class
3842 pushing, we want to push to the containing scope. */
3843 cp_binding_level
*level
= current_binding_level
;
3844 while (level
->kind
== sk_class
3845 || level
->kind
== sk_cleanup
)
3846 level
= level
->level_chain
;
3848 /* An anonymous namespace has a NULL DECL_NAME, but we still want to
3849 insert it. Other NULL-named decls, not so much. */
3850 tree name
= DECL_NAME (decl
);
3851 if (name
? !IDENTIFIER_ANON_P (name
) : TREE_CODE (decl
) == NAMESPACE_DECL
)
3853 cxx_binding
*binding
= NULL
; /* Local scope binding. */
3854 tree ns
= NULL_TREE
; /* Searched namespace. */
3855 tree
*slot
= NULL
; /* Binding slot in namespace. */
3856 tree
*mslot
= NULL
; /* Current module slot in namespace. */
3857 tree old
= NULL_TREE
;
3858 bool name_independent_p
= false;
3859 bool name_independent_diagnosed_p
= false;
3861 if (level
->kind
== sk_namespace
)
3863 /* We look in the decl's namespace for an existing
3864 declaration, even though we push into the current
3866 ns
= (DECL_NAMESPACE_SCOPE_P (decl
)
3867 ? CP_DECL_CONTEXT (decl
) : current_namespace
);
3868 /* Create the binding, if this is current namespace, because
3869 that's where we'll be pushing anyway. */
3870 slot
= find_namespace_slot (ns
, name
, ns
== current_namespace
);
3873 mslot
= get_fixed_binding_slot (slot
, name
, BINDING_SLOT_CURRENT
,
3874 ns
== current_namespace
);
3875 old
= MAYBE_STAT_DECL (*mslot
);
3880 binding
= find_local_binding (level
, name
);
3882 old
= binding
->value
;
3883 name_independent_p
= name_independent_decl_p (decl
);
3886 if (old
== error_mark_node
)
3890 for (oldi
= old
; oldi
; oldi
= oldn
)
3892 if (TREE_CODE (oldi
) == TREE_LIST
)
3894 gcc_checking_assert (level
->kind
!= sk_namespace
3895 && name_independent_decl_p
3896 (TREE_VALUE (old
)));
3897 oldn
= TREE_CHAIN (oldi
);
3898 oldi
= TREE_VALUE (oldi
);
3902 for (ovl_iterator
iter (oldi
); iter
; ++iter
)
3903 if (iter
.using_p ())
3904 ; /* Ignore using decls here. */
3905 else if (iter
.hidden_p ()
3906 && TREE_CODE (*iter
) == FUNCTION_DECL
3907 && DECL_LANG_SPECIFIC (*iter
)
3908 && DECL_MODULE_IMPORT_P (*iter
))
3909 ; /* An undeclared builtin imported from elsewhere. */
3910 else if (name_independent_p
)
3912 /* Ignore name-independent declarations. */
3913 if (cxx_dialect
< cxx26
&& !name_independent_diagnosed_p
)
3914 pedwarn (DECL_SOURCE_LOCATION (decl
), OPT_Wc__26_extensions
,
3915 "name-independent declarations only available with "
3916 "%<-std=c++2c%> or %<-std=gnu++2c%>");
3917 name_independent_diagnosed_p
= true;
3920 = duplicate_decls (decl
, *iter
, hiding
, iter
.hidden_p ()))
3922 if (match
== error_mark_node
)
3924 else if (TREE_CODE (match
) == TYPE_DECL
)
3925 gcc_checking_assert (REAL_IDENTIFIER_TYPE_VALUE (name
)
3926 == (level
->kind
== sk_namespace
3927 ? NULL_TREE
: TREE_TYPE (match
)));
3928 else if (iter
.hidden_p () && !hiding
)
3930 /* Unhiding a previously hidden decl. */
3931 tree head
= iter
.reveal_node (oldi
);
3934 gcc_checking_assert (ns
);
3935 if (STAT_HACK_P (*slot
))
3936 STAT_DECL (*slot
) = head
;
3940 if (DECL_EXTERN_C_P (match
))
3941 /* We need to check and register the decl now. */
3942 check_extern_c_conflict (match
);
3946 && STAT_HACK_P (*slot
)
3947 && STAT_DECL_HIDDEN_P (*slot
))
3949 /* Unhide the non-function. */
3950 gcc_checking_assert (oldi
== match
);
3951 if (!STAT_TYPE (*slot
))
3954 STAT_DECL (*slot
) = match
;
3960 /* Check for redeclaring an import. */
3961 if (slot
&& *slot
&& TREE_CODE (*slot
) == BINDING_VECTOR
)
3963 = check_module_override (decl
, *slot
, hiding
, ns
, name
))
3965 if (match
== error_mark_node
)
3968 /* We found a decl in an interface, push it into this
3970 decl
= update_binding (NULL
, binding
, mslot
, old
,
3976 /* We are pushing a new decl. */
3978 /* Skip a hidden builtin we failed to match already. There can
3980 if (old
&& anticipated_builtin_p (old
))
3981 old
= OVL_CHAIN (old
);
3983 check_template_shadow (decl
);
3985 if (DECL_DECLARES_FUNCTION_P (decl
))
3987 check_default_args (decl
);
3991 if (level
->kind
!= sk_namespace
)
3993 /* In a local class, a friend function declaration must
3994 find a matching decl in the innermost non-class scope.
3995 [class.friend/11] */
3996 error_at (DECL_SOURCE_LOCATION (decl
),
3997 "friend declaration %qD in local class without "
3998 "prior local declaration", decl
);
3999 /* Don't attempt to push it. */
4000 return error_mark_node
;
4005 if (level
->kind
!= sk_namespace
)
4007 tree local_shadow
= check_local_shadow (decl
);
4008 if (name_independent_p
&& local_shadow
)
4010 if (cxx_dialect
< cxx26
&& !name_independent_diagnosed_p
)
4011 pedwarn (DECL_SOURCE_LOCATION (decl
), OPT_Wc__26_extensions
,
4012 "name-independent declarations only available with "
4013 "%<-std=c++2c%> or %<-std=gnu++2c%>");
4014 name_independent_diagnosed_p
= true;
4015 /* When a name-independent declaration is pushed into a scope
4016 which itself does not contain a _ named declaration yet (so
4017 _ name lookups wouldn't be normally ambiguous), but it
4018 shadows a _ declaration in some outer scope in cases
4019 described in [basic.scope.block]/2 where if the names of
4020 the shadowed and shadowing declarations were different it
4021 would be ill-formed program, arrange for _ name lookups
4022 in this scope to be ambiguous. */
4023 if (old
== NULL_TREE
)
4025 old
= build_tree_list (error_mark_node
, local_shadow
);
4026 TREE_TYPE (old
) = error_mark_node
;
4030 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
4031 /* A local namespace alias. */
4032 set_identifier_type_value_with_scope (name
, NULL_TREE
, level
);
4035 binding
= create_local_binding (level
, name
);
4039 ns
= current_namespace
;
4040 slot
= find_namespace_slot (ns
, name
, true);
4041 mslot
= get_fixed_binding_slot (slot
, name
, BINDING_SLOT_CURRENT
, true);
4042 /* Update OLD to reflect the namespace we're going to be
4044 old
= MAYBE_STAT_DECL (*mslot
);
4047 old
= update_binding (level
, binding
, mslot
, old
, decl
, hiding
);
4050 /* An existing decl matched, use it. */
4054 if (TREE_CODE (decl
) == TYPE_DECL
)
4056 tree type
= TREE_TYPE (decl
);
4058 if (type
!= error_mark_node
)
4060 if (TYPE_NAME (type
) != decl
)
4061 set_underlying_type (decl
);
4063 set_identifier_type_value_with_scope (name
, decl
, level
);
4065 if (level
->kind
!= sk_namespace
4066 && !instantiating_current_function_p ())
4067 /* This is a locally defined typedef in a function that
4068 is not a template instantation, record it to implement
4069 -Wunused-local-typedefs. */
4070 record_locally_defined_typedef (decl
);
4073 else if (VAR_OR_FUNCTION_DECL_P (decl
))
4075 if (DECL_EXTERN_C_P (decl
))
4076 check_extern_c_conflict (decl
);
4078 if (!DECL_LOCAL_DECL_P (decl
)
4080 maybe_register_incomplete_var (decl
);
4082 if (DECL_LOCAL_DECL_P (decl
)
4083 && NAMESPACE_SCOPE_P (decl
))
4084 push_local_extern_decl_alias (decl
);
4087 if (level
->kind
== sk_namespace
4088 && TREE_PUBLIC (level
->this_entity
)
4090 maybe_record_mergeable_decl (slot
, name
, decl
);
4094 add_decl_to_level (level
, decl
);
4099 /* A mergeable entity is being loaded into namespace NS slot NAME.
4100 Create and return the appropriate vector slot for that. Either a
4101 GMF slot or a module-specific one. */
4104 mergeable_namespace_slots (tree ns
, tree name
, bool is_attached
, tree
*vec
)
4106 tree
*mslot
= find_namespace_slot (ns
, name
, true);
4107 tree
*vslot
= get_fixed_binding_slot
4108 (mslot
, name
, is_attached
? BINDING_SLOT_PARTITION
: BINDING_SLOT_GLOBAL
,
4111 gcc_checking_assert (TREE_CODE (*mslot
) == BINDING_VECTOR
);
4117 /* DECL is a new mergeable namespace-scope decl. Add it to the
4118 mergeable entities on GSLOT. */
4121 add_mergeable_namespace_entity (tree
*gslot
, tree decl
)
4123 *gslot
= ovl_make (decl
, *gslot
);
4126 /* A mergeable entity of KLASS called NAME is being loaded. Return
4127 the set of things it could be. All such non-as_base classes have
4128 been given a member vec. */
4131 lookup_class_binding (tree klass
, tree name
)
4133 tree found
= NULL_TREE
;
4135 if (!COMPLETE_TYPE_P (klass
))
4137 else if (TYPE_LANG_SPECIFIC (klass
))
4139 vec
<tree
, va_gc
> *member_vec
= CLASSTYPE_MEMBER_VEC (klass
);
4141 found
= member_vec_binary_search (member_vec
, name
);
4144 else if (STAT_HACK_P (found
))
4145 /* Rearrange the stat hack so that we don't need to expose that
4147 found
= ovl_make (STAT_TYPE (found
), STAT_DECL (found
));
4148 else if (IDENTIFIER_CONV_OP_P (name
))
4150 gcc_checking_assert (name
== conv_op_identifier
);
4151 found
= OVL_CHAIN (found
);
4156 gcc_checking_assert (IS_FAKE_BASE_TYPE (klass
)
4157 || TYPE_PTRMEMFUNC_P (klass
));
4158 found
= fields_linear_search (klass
, name
, false);
4164 /* Given a namespace-level binding BINDING, walk it, calling CALLBACK
4165 for all decls of the current module. When partitions are involved,
4166 decls might be mentioned more than once. Return the accumulation of
4167 CALLBACK results. */
4170 walk_module_binding (tree binding
, bitmap partitions
,
4171 bool (*callback
) (tree decl
, WMB_Flags
, void *data
),
4174 // FIXME: We don't quite deal with using decls naming stat hack
4175 // type. Also using decls exporting something from the same scope.
4176 tree current
= binding
;
4179 if (TREE_CODE (binding
) == BINDING_VECTOR
)
4180 current
= BINDING_VECTOR_CLUSTER (binding
, 0).slots
[BINDING_SLOT_CURRENT
];
4182 bool decl_hidden
= false;
4183 if (tree type
= MAYBE_STAT_TYPE (current
))
4185 WMB_Flags flags
= WMB_None
;
4186 if (STAT_TYPE_HIDDEN_P (current
))
4187 flags
= WMB_Flags (flags
| WMB_Hidden
);
4188 count
+= callback (type
, flags
, data
);
4189 decl_hidden
= STAT_DECL_HIDDEN_P (current
);
4192 for (ovl_iterator
iter (MAYBE_STAT_DECL (current
)); iter
; ++iter
)
4194 if (iter
.hidden_p ())
4196 if (!(decl_hidden
&& DECL_IS_UNDECLARED_BUILTIN (*iter
)))
4198 WMB_Flags flags
= WMB_None
;
4200 flags
= WMB_Flags (flags
| WMB_Hidden
);
4201 if (iter
.using_p ())
4203 flags
= WMB_Flags (flags
| WMB_Using
);
4204 if (iter
.exporting_p ())
4205 flags
= WMB_Flags (flags
| WMB_Export
);
4207 count
+= callback (*iter
, flags
, data
);
4209 decl_hidden
= false;
4212 if (partitions
&& TREE_CODE (binding
) == BINDING_VECTOR
)
4214 /* Process partition slots. */
4215 binding_cluster
*cluster
= BINDING_VECTOR_CLUSTER_BASE (binding
);
4216 unsigned ix
= BINDING_VECTOR_NUM_CLUSTERS (binding
);
4217 if (BINDING_VECTOR_SLOTS_PER_CLUSTER
== BINDING_SLOTS_FIXED
)
4223 bool maybe_dups
= BINDING_VECTOR_PARTITION_DUPS_P (binding
);
4225 for (; ix
--; cluster
++)
4226 for (unsigned jx
= 0; jx
!= BINDING_VECTOR_SLOTS_PER_CLUSTER
; jx
++)
4227 if (!cluster
->slots
[jx
].is_lazy ())
4228 if (tree bind
= cluster
->slots
[jx
])
4230 if (TREE_CODE (bind
) == NAMESPACE_DECL
4231 && !DECL_NAMESPACE_ALIAS (bind
))
4233 if (unsigned base
= cluster
->indices
[jx
].base
)
4234 if (unsigned span
= cluster
->indices
[jx
].span
)
4236 if (bitmap_bit_p (partitions
, base
))
4238 while (++base
, --span
);
4239 /* Not a partition's namespace. */
4243 WMB_Flags flags
= WMB_None
;
4245 flags
= WMB_Flags (flags
| WMB_Dups
);
4246 count
+= callback (bind
, flags
, data
);
4248 else if (STAT_HACK_P (bind
) && MODULE_BINDING_PARTITION_P (bind
))
4250 if (tree btype
= STAT_TYPE (bind
))
4252 WMB_Flags flags
= WMB_None
;
4254 flags
= WMB_Flags (flags
| WMB_Dups
);
4255 if (STAT_TYPE_HIDDEN_P (bind
))
4256 flags
= WMB_Flags (flags
| WMB_Hidden
);
4258 count
+= callback (btype
, flags
, data
);
4260 bool hidden
= STAT_DECL_HIDDEN_P (bind
);
4261 for (ovl_iterator
iter (MAYBE_STAT_DECL (STAT_DECL (bind
)));
4264 if (iter
.hidden_p ())
4267 (!(hidden
&& DECL_IS_UNDECLARED_BUILTIN (*iter
)));
4269 WMB_Flags flags
= WMB_None
;
4271 flags
= WMB_Flags (flags
| WMB_Dups
);
4273 flags
= WMB_Flags (flags
| WMB_Hidden
);
4274 if (iter
.using_p ())
4276 flags
= WMB_Flags (flags
| WMB_Using
);
4277 if (iter
.exporting_p ())
4278 flags
= WMB_Flags (flags
| WMB_Export
);
4280 count
+= callback (*iter
, flags
, data
);
4290 /* Imported module MOD has a binding to NS::NAME, stored in section
4294 import_module_binding (tree ns
, tree name
, unsigned mod
, unsigned snum
)
4296 tree
*slot
= find_namespace_slot (ns
, name
, true);
4297 binding_slot
*mslot
= append_imported_binding_slot (slot
, name
, mod
);
4299 if (mslot
->is_lazy () || *mslot
)
4300 /* Oops, something was already there. */
4303 mslot
->set_lazy (snum
);
4307 /* An import of MODULE is binding NS::NAME. There should be no
4308 existing binding for >= MODULE. MOD_GLOB indicates whether MODULE
4309 is a header_unit (-1) or part of the current module (+1). VALUE
4310 and TYPE are the value and type bindings. VISIBLE are the value
4311 bindings being exported. */
4314 set_module_binding (tree ns
, tree name
, unsigned mod
, int mod_glob
,
4315 tree value
, tree type
, tree visible
)
4318 /* Bogus BMIs could give rise to nothing to bind. */
4321 gcc_assert (TREE_CODE (value
) != NAMESPACE_DECL
4322 || DECL_NAMESPACE_ALIAS (value
));
4323 gcc_checking_assert (mod
);
4325 tree
*slot
= find_namespace_slot (ns
, name
, true);
4326 binding_slot
*mslot
= search_imported_binding_slot (slot
, mod
);
4328 if (!mslot
|| !mslot
->is_lazy ())
4329 /* Again, bogus BMI could give find to missing or already loaded slot. */
4333 if (type
|| visible
!= bind
|| mod_glob
)
4335 bind
= stat_hack (bind
, type
);
4336 STAT_VISIBLE (bind
) = visible
;
4337 if ((mod_glob
> 0 && TREE_PUBLIC (ns
))
4338 || (type
&& DECL_MODULE_EXPORT_P (type
)))
4339 STAT_TYPE_VISIBLE_P (bind
) = true;
4342 /* Note if this is this-module or global binding. */
4344 MODULE_BINDING_PARTITION_P (bind
) = true;
4345 else if (mod_glob
< 0)
4346 MODULE_BINDING_GLOBAL_P (bind
) = true;
4354 add_module_namespace_decl (tree ns
, tree decl
)
4356 gcc_assert (!DECL_CHAIN (decl
));
4357 gcc_checking_assert (!(VAR_OR_FUNCTION_DECL_P (decl
)
4358 && DECL_LOCAL_DECL_P (decl
)));
4360 /* Expensive already-there? check. */
4361 for (auto probe
= NAMESPACE_LEVEL (ns
)->names
; probe
;
4362 probe
= DECL_CHAIN (probe
))
4363 gcc_assert (decl
!= probe
);
4365 add_decl_to_level (NAMESPACE_LEVEL (ns
), decl
);
4368 maybe_register_incomplete_var (decl
);
4370 if (VAR_OR_FUNCTION_DECL_P (decl
)
4371 && DECL_EXTERN_C_P (decl
))
4372 check_extern_c_conflict (decl
);
4375 /* Enter DECL into the symbol table, if that's appropriate. Returns
4376 DECL, or a modified version thereof. */
4379 maybe_push_decl (tree decl
)
4381 tree type
= TREE_TYPE (decl
);
4383 /* Add this decl to the current binding level, but not if it comes
4384 from another scope, e.g. a static member variable. TEM may equal
4385 DECL or it may be a previous decl of the same name. */
4386 if (decl
== error_mark_node
4387 || (TREE_CODE (decl
) != PARM_DECL
4388 && DECL_CONTEXT (decl
) != NULL_TREE
4389 /* Definitions of namespace members outside their namespace are
4391 && !DECL_NAMESPACE_SCOPE_P (decl
))
4392 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4393 || type
== unknown_type_node
4394 /* The declaration of a template specialization does not affect
4395 the functions available for overload resolution, so we do not
4397 || (TREE_CODE (decl
) == FUNCTION_DECL
4398 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4401 return pushdecl (decl
);
4404 /* Bind DECL to ID in the current_binding_level, assumed to be a local
4405 binding level. If IS_USING is true, DECL got here through a
4406 using-declaration. */
4409 push_local_binding (tree id
, tree decl
, bool is_using
)
4411 /* Skip over any local classes. This makes sense if we call
4412 push_local_binding with a friend decl of a local class. */
4413 cp_binding_level
*b
= innermost_nonclass_level ();
4415 gcc_assert (b
->kind
!= sk_namespace
);
4416 if (find_local_binding (b
, id
))
4418 /* Supplement the existing binding. */
4419 if (!supplement_binding (IDENTIFIER_BINDING (id
), decl
))
4420 /* It didn't work. Something else must be bound at this
4421 level. Do not add DECL to the list of things to pop
4426 /* Create a new binding. */
4427 push_binding (id
, decl
, b
);
4429 if (TREE_CODE (decl
) == OVERLOAD
|| is_using
)
4430 /* We must put the OVERLOAD or using into a TREE_LIST since we
4431 cannot use the decl's chain itself. */
4432 decl
= build_tree_list (id
, decl
);
4434 /* And put DECL on the list of things declared by the current
4436 add_decl_to_level (b
, decl
);
4440 /* true means unconditionally make a BLOCK for the next level pushed. */
4442 static bool keep_next_level_flag
;
4444 static int binding_depth
= 0;
4451 for (i
= 0; i
< depth
* 2; i
++)
4455 /* Return a string describing the kind of SCOPE we have. */
4457 cp_binding_level_descriptor (cp_binding_level
*scope
)
4459 /* The order of this table must match the "scope_kind"
4461 static const char* scope_kind_names
[] = {
4469 "function-parameter-scope",
4473 "template-parameter-scope",
4474 "template-explicit-spec-scope",
4475 "transaction-scope",
4478 static_assert (ARRAY_SIZE (scope_kind_names
) == sk_count
,
4479 "must keep names aligned with scope_kind enum");
4481 scope_kind kind
= scope
->kind
;
4482 if (kind
== sk_template_parms
&& scope
->explicit_spec_p
)
4483 kind
= sk_template_spec
;
4485 return scope_kind_names
[kind
];
4488 /* Output a debugging information about SCOPE when performing
4491 cp_binding_level_debug (cp_binding_level
*scope
, int line
, const char *action
)
4493 const char *desc
= cp_binding_level_descriptor (scope
);
4494 if (scope
->this_entity
)
4495 verbatim ("%s %<%s(%E)%> %p %d", action
, desc
,
4496 scope
->this_entity
, (void *) scope
, line
);
4498 verbatim ("%s %s %p %d", action
, desc
, (void *) scope
, line
);
4501 /* A chain of binding_level structures awaiting reuse. */
4503 static GTY((deletable
)) cp_binding_level
*free_binding_level
;
4505 /* Insert SCOPE as the innermost binding level. */
4508 push_binding_level (cp_binding_level
*scope
)
4510 /* Add it to the front of currently active scopes stack. */
4511 scope
->level_chain
= current_binding_level
;
4512 current_binding_level
= scope
;
4513 keep_next_level_flag
= false;
4515 if (ENABLE_SCOPE_CHECKING
)
4517 scope
->binding_depth
= binding_depth
;
4518 indent (binding_depth
);
4519 cp_binding_level_debug (scope
, LOCATION_LINE (input_location
),
4525 /* Create a new KIND scope and make it the top of the active scopes stack.
4526 ENTITY is the scope of the associated C++ entity (namespace, class,
4527 function, C++0x enumeration); it is NULL otherwise. */
4530 begin_scope (scope_kind kind
, tree entity
)
4532 cp_binding_level
*scope
;
4534 /* Reuse or create a struct for this binding level. */
4535 if (!ENABLE_SCOPE_CHECKING
&& free_binding_level
)
4537 scope
= free_binding_level
;
4538 free_binding_level
= scope
->level_chain
;
4539 memset (scope
, 0, sizeof (cp_binding_level
));
4542 scope
= ggc_cleared_alloc
<cp_binding_level
> ();
4544 scope
->this_entity
= entity
;
4545 scope
->more_cleanups_ok
= true;
4552 case sk_template_spec
:
4553 scope
->explicit_spec_p
= true;
4554 kind
= sk_template_parms
;
4556 case sk_template_parms
:
4563 case sk_scoped_enum
:
4564 case sk_transaction
:
4567 scope
->keep
= keep_next_level_flag
;
4570 case sk_function_parms
:
4571 scope
->keep
= keep_next_level_flag
;
4575 NAMESPACE_LEVEL (entity
) = scope
;
4579 /* Should not happen. */
4585 push_binding_level (scope
);
4590 /* We're about to leave current scope. Pop the top of the stack of
4591 currently active scopes. Return the enclosing scope, now active. */
4596 cp_binding_level
*scope
= current_binding_level
;
4598 if (scope
->kind
== sk_namespace
&& class_binding_level
)
4599 current_binding_level
= class_binding_level
;
4601 /* We cannot leave a scope, if there are none left. */
4602 if (NAMESPACE_LEVEL (global_namespace
))
4603 gcc_assert (!global_scope_p (scope
));
4605 if (ENABLE_SCOPE_CHECKING
)
4607 indent (--binding_depth
);
4608 cp_binding_level_debug (scope
, LOCATION_LINE (input_location
),
4612 /* Move one nesting level up. */
4613 current_binding_level
= scope
->level_chain
;
4615 /* Namespace-scopes are left most probably temporarily, not
4616 completely; they can be reopened later, e.g. in namespace-extension
4617 or any name binding activity that requires us to resume a
4618 namespace. For classes, we cache some binding levels. For other
4619 scopes, we just make the structure available for reuse. */
4620 if (scope
->kind
!= sk_namespace
4621 && scope
!= previous_class_level
)
4623 scope
->level_chain
= free_binding_level
;
4624 gcc_assert (!ENABLE_SCOPE_CHECKING
4625 || scope
->binding_depth
== binding_depth
);
4626 free_binding_level
= scope
;
4629 if (scope
->kind
== sk_class
)
4631 /* Reset DEFINING_CLASS_P to allow for reuse of a
4632 class-defining scope in a non-defining context. */
4633 scope
->defining_class_p
= 0;
4635 /* Find the innermost enclosing class scope, and reset
4636 CLASS_BINDING_LEVEL appropriately. */
4637 class_binding_level
= NULL
;
4638 for (scope
= current_binding_level
; scope
; scope
= scope
->level_chain
)
4639 if (scope
->kind
== sk_class
)
4641 class_binding_level
= scope
;
4646 return current_binding_level
;
4649 /* When we exit a toplevel class scope, we save its binding level so
4650 that we can restore it quickly. Here, we've entered some other
4651 class, so we must invalidate our cache. */
4654 invalidate_class_lookup_cache (void)
4656 previous_class_level
->level_chain
= free_binding_level
;
4657 free_binding_level
= previous_class_level
;
4658 previous_class_level
= NULL
;
4662 resume_scope (cp_binding_level
* b
)
4664 /* Resuming binding levels is meant only for namespaces,
4665 and those cannot nest into classes. */
4666 gcc_assert (!class_binding_level
);
4667 /* Also, resuming a non-directly nested namespace is a no-no. */
4668 gcc_assert (b
->level_chain
== current_binding_level
);
4669 current_binding_level
= b
;
4670 if (ENABLE_SCOPE_CHECKING
)
4672 b
->binding_depth
= binding_depth
;
4673 indent (binding_depth
);
4674 cp_binding_level_debug (b
, LOCATION_LINE (input_location
), "resume");
4679 /* Return the innermost binding level that is not for a class scope. */
4681 static cp_binding_level
*
4682 innermost_nonclass_level (void)
4684 cp_binding_level
*b
;
4686 b
= current_binding_level
;
4687 while (b
->kind
== sk_class
)
4693 /* We're defining an object of type TYPE. If it needs a cleanup, but
4694 we're not allowed to add any more objects with cleanups to the current
4695 scope, create a new binding level. */
4698 maybe_push_cleanup_level (tree type
)
4700 if (type
!= error_mark_node
4701 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
4702 && current_binding_level
->more_cleanups_ok
== 0)
4704 begin_scope (sk_cleanup
, NULL
);
4705 current_binding_level
->statement_list
= push_stmt_list ();
4709 /* Return true if we are in the global binding level. */
4712 global_bindings_p (void)
4714 return global_scope_p (current_binding_level
);
4717 /* True if we are currently in a toplevel binding level. This
4718 means either the global binding level or a namespace in a toplevel
4719 binding level. Since there are no non-toplevel namespace levels,
4720 this really means any namespace or template parameter level. We
4721 also include a class whose context is toplevel. */
4724 toplevel_bindings_p (void)
4726 cp_binding_level
*b
= innermost_nonclass_level ();
4728 return b
->kind
== sk_namespace
|| b
->kind
== sk_template_parms
;
4731 /* True if this is a namespace scope, or if we are defining a class
4732 which is itself at namespace scope, or whose enclosing class is
4733 such a class, etc. */
4736 namespace_bindings_p (void)
4738 cp_binding_level
*b
= innermost_nonclass_level ();
4740 return b
->kind
== sk_namespace
;
4743 /* True if the innermost non-class scope is a block scope. */
4746 local_bindings_p (void)
4748 cp_binding_level
*b
= innermost_nonclass_level ();
4749 return b
->kind
< sk_function_parms
|| b
->kind
== sk_omp
;
4752 /* True if the current level needs to have a BLOCK made. */
4757 return (current_binding_level
->blocks
!= NULL_TREE
4758 || current_binding_level
->keep
4759 || current_binding_level
->kind
== sk_cleanup
4760 || current_binding_level
->names
!= NULL_TREE
4761 || current_binding_level
->using_directives
);
4764 /* Returns the kind of the innermost scope. */
4767 innermost_scope_kind (void)
4769 return current_binding_level
->kind
;
4772 /* Returns true if this scope was created to store template parameters. */
4775 template_parm_scope_p (void)
4777 return innermost_scope_kind () == sk_template_parms
;
4780 /* If KEEP is true, make a BLOCK node for the next binding level,
4781 unconditionally. Otherwise, use the normal logic to decide whether
4782 or not to create a BLOCK. */
4785 keep_next_level (bool keep
)
4787 keep_next_level_flag
= keep
;
4790 /* Return the list of declarations of the current local scope. */
4793 get_local_decls (void)
4795 gcc_assert (current_binding_level
->kind
!= sk_namespace
4796 && current_binding_level
->kind
!= sk_class
);
4797 return current_binding_level
->names
;
4800 /* Return how many function prototypes we are currently nested inside. */
4803 function_parm_depth (void)
4806 cp_binding_level
*b
;
4808 for (b
= current_binding_level
;
4809 b
->kind
== sk_function_parms
;
4816 /* For debugging. */
4817 static int no_print_functions
= 0;
4818 static int no_print_builtins
= 0;
4821 print_binding_level (cp_binding_level
* lvl
)
4825 if (lvl
->this_entity
)
4826 print_node_brief (stderr
, "entity=", lvl
->this_entity
, 1);
4827 fprintf (stderr
, " blocks=%p", (void *) lvl
->blocks
);
4828 if (lvl
->more_cleanups_ok
)
4829 fprintf (stderr
, " more-cleanups-ok");
4830 if (lvl
->have_cleanups
)
4831 fprintf (stderr
, " have-cleanups");
4832 fprintf (stderr
, "\n");
4835 fprintf (stderr
, " names:\t");
4836 /* We can probably fit 3 names to a line? */
4837 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
4839 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
4841 if (no_print_builtins
4842 && (TREE_CODE (t
) == TYPE_DECL
)
4843 && DECL_IS_UNDECLARED_BUILTIN (t
))
4846 /* Function decls tend to have longer names. */
4847 if (TREE_CODE (t
) == FUNCTION_DECL
)
4854 fprintf (stderr
, "\n\t");
4857 print_node_brief (stderr
, "", t
, 0);
4858 if (t
== error_mark_node
)
4862 fprintf (stderr
, "\n");
4864 if (vec_safe_length (lvl
->class_shadowed
))
4867 cp_class_binding
*b
;
4868 fprintf (stderr
, " class-shadowed:");
4869 FOR_EACH_VEC_ELT (*lvl
->class_shadowed
, i
, b
)
4870 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (b
->identifier
));
4871 fprintf (stderr
, "\n");
4873 if (lvl
->type_shadowed
)
4875 fprintf (stderr
, " type-shadowed:");
4876 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
4878 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
4880 fprintf (stderr
, "\n");
4885 debug (cp_binding_level
&ref
)
4887 print_binding_level (&ref
);
4891 debug (cp_binding_level
*ptr
)
4896 fprintf (stderr
, "<nil>\n");
4900 print_other_binding_stack (cp_binding_level
*stack
)
4902 cp_binding_level
*level
;
4903 for (level
= stack
; !global_scope_p (level
); level
= level
->level_chain
)
4905 fprintf (stderr
, "binding level %p\n", (void *) level
);
4906 print_binding_level (level
);
4911 print_binding_stack (void)
4913 cp_binding_level
*b
;
4914 fprintf (stderr
, "current_binding_level=%p\n"
4915 "class_binding_level=%p\n"
4916 "NAMESPACE_LEVEL (global_namespace)=%p\n",
4917 (void *) current_binding_level
, (void *) class_binding_level
,
4918 (void *) NAMESPACE_LEVEL (global_namespace
));
4919 if (class_binding_level
)
4921 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
4922 if (b
== current_binding_level
)
4925 b
= class_binding_level
;
4927 b
= current_binding_level
;
4930 b
= current_binding_level
;
4931 print_other_binding_stack (b
);
4932 fprintf (stderr
, "global:\n");
4933 print_binding_level (NAMESPACE_LEVEL (global_namespace
));
4936 /* Push a definition of struct, union or enum tag named ID. into
4937 binding_level B. DECL is a TYPE_DECL for the type. DECL has
4938 already been pushed into its binding level. This is bookkeeping to
4942 set_identifier_type_value_with_scope (tree id
, tree decl
, cp_binding_level
*b
)
4944 if (b
->kind
== sk_namespace
)
4945 /* At namespace scope we should not see an identifier type value. */
4946 gcc_checking_assert (!REAL_IDENTIFIER_TYPE_VALUE (id
)
4947 /* We could be pushing a friend underneath a template
4948 parm (ill-formed). */
4950 (TYPE_NAME (REAL_IDENTIFIER_TYPE_VALUE (id
)))));
4953 /* Push the current type value, so we can restore it later */
4954 tree old
= REAL_IDENTIFIER_TYPE_VALUE (id
);
4955 b
->type_shadowed
= tree_cons (id
, old
, b
->type_shadowed
);
4956 tree type
= decl
? TREE_TYPE (decl
) : NULL_TREE
;
4957 TREE_TYPE (b
->type_shadowed
) = type
;
4958 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
4962 /* As set_identifier_type_value_with_scope, but using
4963 current_binding_level. */
4966 set_identifier_type_value (tree id
, tree decl
)
4968 set_identifier_type_value_with_scope (id
, decl
, current_binding_level
);
4971 /* Return the name for the constructor (or destructor) for the
4975 constructor_name (tree type
)
4977 tree decl
= TYPE_NAME (TYPE_MAIN_VARIANT (type
));
4979 return decl
? DECL_NAME (decl
) : NULL_TREE
;
4982 /* Returns TRUE if NAME is the name for the constructor for TYPE,
4983 which must be a class type. */
4986 constructor_name_p (tree name
, tree type
)
4988 gcc_assert (MAYBE_CLASS_TYPE_P (type
));
4990 /* These don't have names. */
4991 if (TREE_CODE (type
) == DECLTYPE_TYPE
4992 || TREE_CODE (type
) == TYPEOF_TYPE
)
4995 if (name
&& name
== constructor_name (type
))
5001 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
5002 caller to set DECL_CONTEXT properly.
5004 Warning: For class and block-scope this must only be used when X
5005 will be the new innermost binding for its name, as we tack it onto
5006 the front of IDENTIFIER_BINDING without checking to see if the
5007 current IDENTIFIER_BINDING comes from a closer binding level than
5010 Warning: For namespace scope, this will look in LEVEL for an
5011 existing binding to match, but if not found will push the decl into
5012 CURRENT_NAMESPACE. Use push_nested_namespace/pushdecl/
5013 pop_nested_namespace if you really need to push it into a foreign
5017 do_pushdecl_with_scope (tree x
, cp_binding_level
*level
, bool hiding
= false)
5019 cp_binding_level
*b
;
5021 if (level
->kind
== sk_class
)
5023 gcc_checking_assert (!hiding
);
5024 b
= class_binding_level
;
5025 class_binding_level
= level
;
5026 pushdecl_class_level (x
);
5027 class_binding_level
= b
;
5031 tree function_decl
= current_function_decl
;
5032 if (level
->kind
== sk_namespace
)
5033 current_function_decl
= NULL_TREE
;
5034 b
= current_binding_level
;
5035 current_binding_level
= level
;
5036 x
= pushdecl (x
, hiding
);
5037 current_binding_level
= b
;
5038 current_function_decl
= function_decl
;
5043 /* Inject X into the local scope just before the function parms. */
5046 pushdecl_outermost_localscope (tree x
)
5048 cp_binding_level
*b
= NULL
;
5049 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
5051 /* Find the scope just inside the function parms. */
5052 for (cp_binding_level
*n
= current_binding_level
;
5053 n
->kind
!= sk_function_parms
; n
= b
->level_chain
)
5056 return b
? do_pushdecl_with_scope (x
, b
) : error_mark_node
;
5059 /* Checks if BINDING is a binding that we can export. */
5062 check_can_export_using_decl (tree binding
)
5064 tree decl
= STRIP_TEMPLATE (binding
);
5066 /* Linkage is determined by the owner of an enumerator. */
5067 if (TREE_CODE (decl
) == CONST_DECL
)
5068 decl
= TYPE_NAME (DECL_CONTEXT (decl
));
5070 /* If the using decl is exported, the things it refers
5071 to must also be exported (or not have module attachment). */
5072 if (!DECL_MODULE_EXPORT_P (decl
)
5073 && (DECL_LANG_SPECIFIC (decl
)
5074 && DECL_MODULE_ATTACH_P (decl
)))
5076 bool internal_p
= !TREE_PUBLIC (decl
);
5078 /* A template in an anonymous namespace doesn't constrain TREE_PUBLIC
5079 until it's instantiated, so double-check its context. */
5080 if (!internal_p
&& TREE_CODE (binding
) == TEMPLATE_DECL
)
5081 internal_p
= decl_internal_context_p (decl
);
5083 auto_diagnostic_group d
;
5084 error ("exporting %q#D that does not have external linkage",
5086 if (TREE_CODE (decl
) == TYPE_DECL
&& !DECL_IMPLICIT_TYPEDEF_P (decl
))
5087 /* An un-exported explicit type alias has no linkage. */
5088 inform (DECL_SOURCE_LOCATION (binding
),
5089 "%q#D declared here with no linkage", binding
);
5090 else if (internal_p
)
5091 inform (DECL_SOURCE_LOCATION (binding
),
5092 "%q#D declared here with internal linkage", binding
);
5094 inform (DECL_SOURCE_LOCATION (binding
),
5095 "%q#D declared here with module linkage", binding
);
5102 /* Process a local-scope or namespace-scope using declaration. LOOKUP
5103 is the result of qualified lookup (both value & type are
5104 significant). FN_SCOPE_P indicates if we're at function-scope (as
5105 opposed to namespace-scope). *VALUE_P and *TYPE_P are the current
5106 bindings, which are altered to reflect the newly brought in
5110 do_nonmember_using_decl (name_lookup
&lookup
, bool fn_scope_p
,
5111 bool insert_p
, tree
*value_p
, tree
*type_p
)
5113 tree value
= *value_p
;
5114 tree type
= *type_p
;
5115 bool failed
= false;
5117 /* Shift the old and new bindings around so we're comparing class and
5118 enumeration names to each other. */
5119 if (value
&& DECL_IMPLICIT_TYPEDEF_P (value
))
5125 if (lookup
.value
&& DECL_IMPLICIT_TYPEDEF_P (lookup
.value
))
5127 lookup
.type
= lookup
.value
;
5128 lookup
.value
= NULL_TREE
;
5131 /* Only process exporting if we're going to be inserting. */
5132 bool revealing_p
= insert_p
&& !fn_scope_p
&& module_has_cmi_p ();
5134 /* First do the value binding. */
5136 /* Nothing (only implicit typedef found). */
5137 gcc_checking_assert (lookup
.type
);
5138 else if (OVL_P (lookup
.value
) && (!value
|| OVL_P (value
)))
5140 for (lkp_iterator
usings (lookup
.value
); usings
; ++usings
)
5142 tree new_fn
= *usings
;
5143 bool exporting
= revealing_p
&& module_exporting_p ();
5145 exporting
= check_can_export_using_decl (new_fn
);
5147 /* [namespace.udecl]
5149 If a function declaration in namespace scope or block
5150 scope has the same name and the same parameter types as a
5151 function introduced by a using declaration the program is
5153 /* This seems overreaching, asking core -- why do we care
5154 about decls in the namespace that we cannot name (because
5155 they are not transitively imported. We just check the
5156 decls that are in this TU. */
5158 for (ovl_iterator
old (value
); !found
&& old
; ++old
)
5162 if (new_fn
== old_fn
)
5164 /* The function already exists in the current
5165 namespace. We will still want to insert it if
5166 it is revealing a not-revealed thing. */
5170 else if (old
.using_p ())
5173 /* Update in place. 'tis ok. */
5174 OVL_EXPORT_P (old
.get_using ()) = true;
5177 else if (DECL_MODULE_EXPORT_P (new_fn
))
5181 value
= old
.remove_node (value
);
5186 else if (old
.using_p ())
5187 continue; /* This is a using decl. */
5188 else if (old
.hidden_p () && DECL_IS_UNDECLARED_BUILTIN (old_fn
))
5189 continue; /* This is an anticipated builtin. */
5190 else if (!matching_fn_p (new_fn
, old_fn
))
5191 continue; /* Parameters do not match. */
5192 else if (decls_match (new_fn
, old_fn
))
5194 /* Extern "C" in different namespaces. */
5200 diagnose_name_conflict (new_fn
, old_fn
);
5207 if (!found
&& insert_p
)
5208 /* Unlike the decl-pushing case we don't drop anticipated
5209 builtins here. They don't cause a problem, and we'd
5210 like to match them with a future declaration. */
5211 value
= ovl_insert (new_fn
, value
, 1 + exporting
);
5215 /* Ignore anticipated builtins. */
5216 && !anticipated_builtin_p (value
)
5217 && (fn_scope_p
|| !decls_match (lookup
.value
, value
)))
5219 diagnose_name_conflict (lookup
.value
, value
);
5224 value
= lookup
.value
;
5225 if (revealing_p
&& module_exporting_p ())
5226 check_can_export_using_decl (value
);
5229 /* Now the type binding. */
5230 if (lookup
.type
&& lookup
.type
!= type
)
5232 if (type
&& !decls_match (lookup
.type
, type
))
5234 diagnose_name_conflict (lookup
.type
, type
);
5240 if (revealing_p
&& module_exporting_p ())
5241 check_can_export_using_decl (type
);
5247 /* If value is empty, shift any class or enumeration name back. */
5260 /* Returns true if ANCESTOR encloses DESCENDANT, including matching.
5261 Both are namespaces. */
5264 is_nested_namespace (tree ancestor
, tree descendant
, bool inline_only
)
5266 int depth
= SCOPE_DEPTH (ancestor
);
5268 if (!depth
&& !inline_only
)
5269 /* The global namespace encloses everything. */
5272 while (SCOPE_DEPTH (descendant
) > depth
5273 && (!inline_only
|| DECL_NAMESPACE_INLINE_P (descendant
)))
5274 descendant
= CP_DECL_CONTEXT (descendant
);
5276 return ancestor
== descendant
;
5279 /* Returns true if ROOT (a non-alias namespace, class, or function)
5280 encloses CHILD. CHILD may be either a class type or a namespace
5284 is_ancestor (tree root
, tree child
)
5286 gcc_checking_assert ((TREE_CODE (root
) == NAMESPACE_DECL
5287 && !DECL_NAMESPACE_ALIAS (root
))
5288 || TREE_CODE (root
) == FUNCTION_DECL
5289 || CLASS_TYPE_P (root
));
5290 gcc_checking_assert (TREE_CODE (child
) == NAMESPACE_DECL
5291 || CLASS_TYPE_P (child
));
5293 /* The global namespace encloses everything. Early-out for the
5295 if (root
== global_namespace
)
5298 /* Search CHILD until we reach namespace scope. */
5299 while (TREE_CODE (child
) != NAMESPACE_DECL
)
5301 /* If we've reached the ROOT, it encloses CHILD. */
5305 /* Go out one level. */
5307 child
= TYPE_NAME (child
);
5308 child
= CP_DECL_CONTEXT (child
);
5311 if (TREE_CODE (root
) != NAMESPACE_DECL
)
5312 /* Failed to meet the non-namespace we were looking for. */
5315 if (tree alias
= DECL_NAMESPACE_ALIAS (child
))
5318 return is_nested_namespace (root
, child
);
5321 /* Enter the class or namespace scope indicated by T suitable for name
5322 lookup. T can be arbitrary scope, not necessary nested inside the
5323 current scope. Returns a non-null scope to pop iff pop_scope
5324 should be called later to exit this scope. */
5329 if (TREE_CODE (t
) == NAMESPACE_DECL
)
5330 push_decl_namespace (t
);
5331 else if (CLASS_TYPE_P (t
))
5333 if (!at_class_scope_p ()
5334 || !same_type_p (current_class_type
, t
))
5335 push_nested_class (t
);
5337 /* T is the same as the current scope. There is therefore no
5338 need to re-enter the scope. Since we are not actually
5339 pushing a new scope, our caller should not call
5347 /* Leave scope pushed by push_scope. */
5354 if (TREE_CODE (t
) == NAMESPACE_DECL
)
5355 pop_decl_namespace ();
5356 else if CLASS_TYPE_P (t
)
5357 pop_nested_class ();
5360 /* Subroutine of push_inner_scope. */
5363 push_inner_scope_r (tree outer
, tree inner
)
5368 || (TREE_CODE (inner
) != NAMESPACE_DECL
&& !CLASS_TYPE_P (inner
)))
5371 prev
= CP_DECL_CONTEXT (TREE_CODE (inner
) == NAMESPACE_DECL
? inner
: TYPE_NAME (inner
));
5373 push_inner_scope_r (outer
, prev
);
5374 if (TREE_CODE (inner
) == NAMESPACE_DECL
)
5376 cp_binding_level
*save_template_parm
= 0;
5377 /* Temporary take out template parameter scopes. They are saved
5378 in reversed order in save_template_parm. */
5379 while (current_binding_level
->kind
== sk_template_parms
)
5381 cp_binding_level
*b
= current_binding_level
;
5382 current_binding_level
= b
->level_chain
;
5383 b
->level_chain
= save_template_parm
;
5384 save_template_parm
= b
;
5387 resume_scope (NAMESPACE_LEVEL (inner
));
5388 current_namespace
= inner
;
5390 /* Restore template parameter scopes. */
5391 while (save_template_parm
)
5393 cp_binding_level
*b
= save_template_parm
;
5394 save_template_parm
= b
->level_chain
;
5395 b
->level_chain
= current_binding_level
;
5396 current_binding_level
= b
;
5403 /* Enter the scope INNER from current scope. INNER must be a scope
5404 nested inside current scope. This works with both name lookup and
5405 pushing name into scope. In case a template parameter scope is present,
5406 namespace is pushed under the template parameter scope according to
5407 name lookup rule in 14.6.1/6.
5409 Return the former current scope suitable for pop_inner_scope. */
5412 push_inner_scope (tree inner
)
5414 tree outer
= current_scope ();
5416 outer
= current_namespace
;
5418 push_inner_scope_r (outer
, inner
);
5422 /* Exit the current scope INNER back to scope OUTER. */
5425 pop_inner_scope (tree outer
, tree inner
)
5428 || (TREE_CODE (inner
) != NAMESPACE_DECL
&& !CLASS_TYPE_P (inner
)))
5431 while (outer
!= inner
)
5433 if (TREE_CODE (inner
) == NAMESPACE_DECL
)
5435 cp_binding_level
*save_template_parm
= 0;
5436 /* Temporary take out template parameter scopes. They are saved
5437 in reversed order in save_template_parm. */
5438 while (current_binding_level
->kind
== sk_template_parms
)
5440 cp_binding_level
*b
= current_binding_level
;
5441 current_binding_level
= b
->level_chain
;
5442 b
->level_chain
= save_template_parm
;
5443 save_template_parm
= b
;
5448 /* Restore template parameter scopes. */
5449 while (save_template_parm
)
5451 cp_binding_level
*b
= save_template_parm
;
5452 save_template_parm
= b
->level_chain
;
5453 b
->level_chain
= current_binding_level
;
5454 current_binding_level
= b
;
5460 inner
= CP_DECL_CONTEXT (TREE_CODE (inner
) == NAMESPACE_DECL
? inner
: TYPE_NAME (inner
));
5464 /* Do a pushlevel for class declarations. */
5467 pushlevel_class (void)
5469 class_binding_level
= begin_scope (sk_class
, current_class_type
);
5472 /* ...and a poplevel for class declarations. */
5475 poplevel_class (void)
5477 cp_binding_level
*level
= class_binding_level
;
5478 cp_class_binding
*cb
;
5482 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
5483 gcc_assert (level
!= 0);
5485 /* If we're leaving a toplevel class, cache its binding level. */
5486 if (current_class_depth
== 1)
5487 previous_class_level
= level
;
5488 for (shadowed
= level
->type_shadowed
;
5490 shadowed
= TREE_CHAIN (shadowed
))
5491 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
5493 /* Remove the bindings for all of the class-level declarations. */
5494 if (level
->class_shadowed
)
5496 FOR_EACH_VEC_ELT (*level
->class_shadowed
, i
, cb
)
5498 IDENTIFIER_BINDING (cb
->identifier
) = cb
->base
->previous
;
5499 cxx_binding_free (cb
->base
);
5501 ggc_free (level
->class_shadowed
);
5502 level
->class_shadowed
= NULL
;
5505 /* Now, pop out of the binding level which we created up in the
5506 `pushlevel_class' routine. */
5507 gcc_assert (current_binding_level
== level
);
5511 /* Set INHERITED_VALUE_BINDING_P on BINDING to true or false, as
5512 appropriate. DECL is the value to which a name has just been
5513 bound. CLASS_TYPE is the class in which the lookup occurred. */
5516 set_inherited_value_binding_p (cxx_binding
*binding
, tree decl
,
5519 if (binding
->value
== decl
&& TREE_CODE (decl
) != TREE_LIST
)
5523 if (is_overloaded_fn (decl
))
5524 context
= ovl_scope (decl
);
5527 gcc_assert (DECL_P (decl
));
5528 context
= context_for_name_lookup (decl
);
5531 if (is_properly_derived_from (class_type
, context
))
5532 INHERITED_VALUE_BINDING_P (binding
) = 1;
5534 INHERITED_VALUE_BINDING_P (binding
) = 0;
5536 else if (binding
->value
== decl
)
5537 /* We only encounter a TREE_LIST when there is an ambiguity in the
5538 base classes. Such an ambiguity can be overridden by a
5539 definition in this class. */
5540 INHERITED_VALUE_BINDING_P (binding
) = 1;
5542 INHERITED_VALUE_BINDING_P (binding
) = 0;
5545 /* Make the declaration of X appear in CLASS scope. */
5548 pushdecl_class_level (tree x
)
5550 bool is_valid
= true;
5552 /* Do nothing if we're adding to an outer lambda closure type,
5553 outer_binding will add it later if it's needed. */
5554 if (current_class_type
!= class_binding_level
->this_entity
)
5557 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
5558 /* Get the name of X. */
5559 tree name
= OVL_NAME (x
);
5563 is_valid
= push_class_level_binding (name
, x
);
5564 if (TREE_CODE (x
) == TYPE_DECL
)
5565 set_identifier_type_value (name
, x
);
5567 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
5569 /* If X is an anonymous aggregate, all of its members are
5570 treated as if they were members of the class containing the
5571 aggregate, for naming purposes. */
5572 location_t save_location
= input_location
;
5573 tree anon
= TREE_TYPE (x
);
5574 if (vec
<tree
, va_gc
> *member_vec
= CLASSTYPE_MEMBER_VEC (anon
))
5575 for (unsigned ix
= member_vec
->length (); ix
--;)
5577 tree binding
= (*member_vec
)[ix
];
5578 if (STAT_HACK_P (binding
))
5580 if (!pushdecl_class_level (STAT_TYPE (binding
)))
5582 binding
= STAT_DECL (binding
);
5584 if (!pushdecl_class_level (binding
))
5588 for (tree f
= TYPE_FIELDS (anon
); f
; f
= DECL_CHAIN (f
))
5589 if (TREE_CODE (f
) == FIELD_DECL
)
5591 input_location
= DECL_SOURCE_LOCATION (f
);
5592 if (!pushdecl_class_level (f
))
5595 input_location
= save_location
;
5600 /* Return the BINDING (if any) for NAME in SCOPE, which is a class
5601 scope. If the value returned is non-NULL, and the PREVIOUS field
5602 is not set, callers must set the PREVIOUS field explicitly. */
5604 static cxx_binding
*
5605 get_class_binding (tree name
, cp_binding_level
*scope
)
5610 cxx_binding
*binding
;
5612 class_type
= scope
->this_entity
;
5614 /* Get the type binding. */
5615 type_binding
= lookup_member (class_type
, name
,
5616 /*protect=*/2, /*want_type=*/true,
5617 tf_warning_or_error
);
5618 /* Get the value binding. */
5619 value_binding
= lookup_member (class_type
, name
,
5620 /*protect=*/2, /*want_type=*/false,
5621 tf_warning_or_error
);
5623 /* If we found either a type binding or a value binding, create a
5624 new binding object. */
5625 if (type_binding
|| value_binding
)
5627 binding
= new_class_binding (name
,
5631 set_inherited_value_binding_p (binding
, value_binding
, class_type
);
5639 /* Make the declaration(s) of X appear in CLASS scope under the name
5640 NAME. Returns true if the binding is valid. */
5643 push_class_level_binding (tree name
, tree x
)
5645 cxx_binding
*binding
;
5649 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
5651 /* The class_binding_level will be NULL if x is a template
5652 parameter name in a member template. */
5653 if (!class_binding_level
)
5656 if (name
== error_mark_node
)
5659 /* Can happen for an erroneous declaration (c++/60384). */
5660 if (!identifier_p (name
))
5662 gcc_assert (errorcount
|| sorrycount
);
5666 /* Check for invalid member names. But don't worry about a default
5667 argument-scope lambda being pushed after the class is complete. */
5668 gcc_assert (TYPE_BEING_DEFINED (current_class_type
)
5669 || LAMBDA_TYPE_P (TREE_TYPE (decl
)));
5670 /* Check that we're pushing into the right binding level. */
5671 gcc_assert (current_class_type
== class_binding_level
->this_entity
);
5673 /* We could have been passed a tree list if this is an ambiguous
5674 declaration. If so, pull the declaration out because
5675 check_template_shadow will not handle a TREE_LIST. */
5676 if (TREE_CODE (decl
) == TREE_LIST
5677 && TREE_TYPE (decl
) == error_mark_node
)
5678 decl
= TREE_VALUE (decl
);
5680 if (!check_template_shadow (decl
))
5685 If T is the name of a class, then each of the following shall
5686 have a name different from T:
5688 -- every static data member of class T;
5690 -- every member of class T that is itself a type;
5692 -- every enumerator of every member of class T that is an
5695 -- every member of every anonymous union that is a member of
5698 (Non-static data members were also forbidden to have the same
5699 name as T until TC1.) */
5701 || TREE_CODE (x
) == CONST_DECL
5702 || (TREE_CODE (x
) == TYPE_DECL
5703 && !DECL_SELF_REFERENCE_P (x
))
5704 /* A data member of an anonymous union. */
5705 || (TREE_CODE (x
) == FIELD_DECL
5706 && DECL_CONTEXT (x
) != current_class_type
))
5707 && DECL_NAME (x
) == DECL_NAME (TYPE_NAME (current_class_type
)))
5709 tree scope
= context_for_name_lookup (x
);
5710 if (TYPE_P (scope
) && same_type_p (scope
, current_class_type
))
5712 error_at (DECL_SOURCE_LOCATION (x
),
5713 "%qD has the same name as the class in which it is "
5719 /* Get the current binding for NAME in this class, if any. */
5720 binding
= IDENTIFIER_BINDING (name
);
5721 if (!binding
|| binding
->scope
!= class_binding_level
)
5723 binding
= get_class_binding (name
, class_binding_level
);
5724 /* If a new binding was created, put it at the front of the
5725 IDENTIFIER_BINDING list. */
5728 binding
->previous
= IDENTIFIER_BINDING (name
);
5729 IDENTIFIER_BINDING (name
) = binding
;
5733 /* If there is already a binding, then we may need to update the
5735 if (binding
&& binding
->value
)
5737 tree bval
= binding
->value
;
5738 tree old_decl
= NULL_TREE
;
5739 tree target_decl
= strip_using_decl (decl
);
5740 tree target_bval
= strip_using_decl (bval
);
5742 if (INHERITED_VALUE_BINDING_P (binding
))
5744 /* If the old binding was from a base class, and was for a
5745 tag name, slide it over to make room for the new binding.
5746 The old binding is still visible if explicitly qualified
5747 with a class-key. */
5748 if (TREE_CODE (target_bval
) == TYPE_DECL
5749 && DECL_ARTIFICIAL (target_bval
)
5750 && !(TREE_CODE (target_decl
) == TYPE_DECL
5751 && DECL_ARTIFICIAL (target_decl
)))
5753 old_decl
= binding
->type
;
5754 binding
->type
= bval
;
5755 binding
->value
= NULL_TREE
;
5756 INHERITED_VALUE_BINDING_P (binding
) = 0;
5761 /* Any inherited type declaration is hidden by the type
5762 declaration in the derived class. */
5763 if (TREE_CODE (target_decl
) == TYPE_DECL
5764 && DECL_ARTIFICIAL (target_decl
))
5765 binding
->type
= NULL_TREE
;
5768 else if (TREE_CODE (decl
) == USING_DECL
5769 && TREE_CODE (bval
) == USING_DECL
5770 && same_type_p (USING_DECL_SCOPE (decl
),
5771 USING_DECL_SCOPE (bval
)))
5772 /* This is a using redeclaration that will be diagnosed later
5773 in supplement_binding */
5775 else if (TREE_CODE (decl
) == USING_DECL
5776 && TREE_CODE (bval
) == USING_DECL
5777 && DECL_DEPENDENT_P (decl
)
5778 && DECL_DEPENDENT_P (bval
))
5780 else if (TREE_CODE (decl
) == USING_DECL
5781 && DECL_DEPENDENT_P (decl
)
5782 && OVL_P (target_bval
))
5783 /* The new dependent using beats an old overload. */
5785 else if (TREE_CODE (bval
) == USING_DECL
5786 && DECL_DEPENDENT_P (bval
)
5787 && OVL_P (target_decl
))
5788 /* The old dependent using beats a new overload. */
5790 else if (OVL_P (target_decl
)
5791 && OVL_P (target_bval
))
5792 /* The new overload set contains the old one. */
5795 if (old_decl
&& binding
->scope
== class_binding_level
)
5798 /* It is always safe to clear INHERITED_VALUE_BINDING_P
5799 here. This function is only used to register bindings
5800 from with the class definition itself. */
5801 INHERITED_VALUE_BINDING_P (binding
) = 0;
5806 /* Note that we declared this value so that we can issue an error if
5807 this is an invalid redeclaration of a name already used for some
5809 note_name_declared_in_class (name
, decl
);
5811 /* If we didn't replace an existing binding, put the binding on the
5812 stack of bindings for the identifier, and update the shadowed
5814 if (binding
&& binding
->scope
== class_binding_level
)
5815 /* Supplement the existing binding. */
5816 ok
= supplement_binding (binding
, decl
);
5819 /* Create a new binding. */
5820 push_binding (name
, decl
, class_binding_level
);
5827 /* Process and lookup a using decl SCOPE::lookup.name, filling in
5828 lookup.values & lookup.type. Return a USING_DECL, or NULL_TREE on
5832 lookup_using_decl (tree scope
, name_lookup
&lookup
)
5834 tree current
= current_scope ();
5835 bool dependent_p
= false;
5836 tree binfo
= NULL_TREE
;
5837 base_kind b_kind
= bk_not_base
;
5839 /* Because C++20 breaks the invariant that only member using-decls
5840 refer to members and only non-member using-decls refer to
5841 non-members, we first do the lookups, and then do validation that
5842 what we found is ok. */
5844 if (TREE_CODE (scope
) == ENUMERAL_TYPE
5845 && cxx_dialect
< cxx20
5846 && UNSCOPED_ENUM_P (scope
)
5847 && !TYPE_FUNCTION_SCOPE_P (scope
))
5849 /* PR c++/60265 argued that since C++11 added explicit enum scope, we
5850 should allow it as meaning the enclosing scope. I don't see any
5851 justification for this in C++11, but let's keep allowing it. */
5852 tree ctx
= CP_TYPE_CONTEXT (scope
);
5853 if (CLASS_TYPE_P (ctx
) == CLASS_TYPE_P (current
))
5857 /* You cannot using-decl a destructor. */
5858 if (TREE_CODE (lookup
.name
) == BIT_NOT_EXPR
)
5860 error ("%<%T%s%D%> names destructor", scope
,
5861 &"::"[scope
== global_namespace
? 2 : 0], lookup
.name
);
5865 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
5867 /* Naming a namespace member. */
5868 qualified_namespace_lookup (scope
, &lookup
);
5870 if (TYPE_P (current
)
5873 || cxx_dialect
< cxx20
5874 || TREE_CODE (lookup
.value
) != CONST_DECL
))
5876 error ("using-declaration for non-member at class scope");
5880 else if (TREE_CODE (scope
) == ENUMERAL_TYPE
)
5882 /* Naming an enumeration member. */
5883 if (cxx_dialect
< cxx20
)
5884 error ("%<using%> with enumeration scope %q#T "
5885 "only available with %<-std=c++20%> or %<-std=gnu++20%>",
5887 lookup
.value
= lookup_enumerator (scope
, lookup
.name
);
5891 /* Naming a class member. This is awkward in C++20, because we
5892 might be naming an enumerator of an unrelated class. */
5894 tree npscope
= scope
;
5895 if (PACK_EXPANSION_P (scope
))
5896 npscope
= PACK_EXPANSION_PATTERN (scope
);
5898 if (!MAYBE_CLASS_TYPE_P (npscope
))
5900 error ("%qT is not a class, namespace, or enumeration", npscope
);
5904 /* Using T::T declares inheriting ctors, even if T is a typedef. */
5905 if (lookup
.name
== TYPE_IDENTIFIER (npscope
)
5906 || constructor_name_p (lookup
.name
, npscope
))
5908 if (!TYPE_P (current
))
5910 error ("non-member using-declaration names constructor of %qT",
5914 maybe_warn_cpp0x (CPP0X_INHERITING_CTORS
);
5915 lookup
.name
= ctor_identifier
;
5916 CLASSTYPE_NON_AGGREGATE (current
) = true;
5919 if (!TYPE_P (current
) && cxx_dialect
< cxx20
)
5921 error ("using-declaration for member at non-class scope");
5925 bool depscope
= dependent_scope_p (scope
);
5928 /* Leave binfo null. */;
5929 else if (TYPE_P (current
))
5931 binfo
= lookup_base (current
, scope
, ba_any
, &b_kind
, tf_none
);
5932 gcc_checking_assert (b_kind
>= bk_not_base
);
5934 if (b_kind
== bk_not_base
&& any_dependent_bases_p ())
5935 /* Treat as-if dependent. */
5937 else if (lookup
.name
== ctor_identifier
5938 && (b_kind
< bk_proper_base
|| !binfo_direct_p (binfo
)))
5940 if (any_dependent_bases_p ())
5944 error ("%qT is not a direct base of %qT", scope
, current
);
5949 if (b_kind
< bk_proper_base
)
5950 binfo
= TYPE_BINFO (scope
);
5953 binfo
= TYPE_BINFO (scope
);
5955 dependent_p
= (depscope
5956 || (IDENTIFIER_CONV_OP_P (lookup
.name
)
5957 && dependent_type_p (TREE_TYPE (lookup
.name
))));
5960 lookup
.value
= lookup_member (binfo
, lookup
.name
, /*protect=*/2,
5961 /*want_type=*/false, tf_none
);
5963 /* If the lookup in the base contains a dependent using, this
5964 using is also dependent. */
5965 if (!dependent_p
&& lookup
.value
&& dependent_type_p (scope
))
5967 tree val
= lookup
.value
;
5968 if (tree fns
= maybe_get_fns (val
))
5970 for (tree f
: lkp_range (val
))
5971 if (TREE_CODE (f
) == USING_DECL
&& DECL_DEPENDENT_P (f
))
5978 if (!depscope
&& b_kind
< bk_proper_base
)
5980 if (cxx_dialect
>= cxx20
&& lookup
.value
5981 && TREE_CODE (lookup
.value
) == CONST_DECL
)
5983 /* Using an unrelated enum; check access here rather
5984 than separately for class and non-class using. */
5985 perform_or_defer_access_check
5986 (binfo
, lookup
.value
, lookup
.value
, tf_warning_or_error
);
5987 /* And then if this is a copy from handle_using_decl, look
5988 through to the original enumerator. */
5989 if (CONST_DECL_USING_P (lookup
.value
))
5990 lookup
.value
= DECL_ABSTRACT_ORIGIN (lookup
.value
);
5992 else if (!TYPE_P (current
))
5994 error ("using-declaration for member at non-class scope");
5999 auto_diagnostic_group g
;
6000 error_not_base_type (scope
, current
);
6001 if (lookup
.value
&& DECL_IMPLICIT_TYPEDEF_P (lookup
.value
)
6002 && TREE_CODE (TREE_TYPE (lookup
.value
)) == ENUMERAL_TYPE
)
6003 inform (input_location
,
6004 "did you mean %<using enum %T::%D%>?",
6005 scope
, lookup
.name
);
6011 /* Did we find anything sane? */
6014 else if (!lookup
.value
)
6016 error ("%qD has not been declared in %qD", lookup
.name
, scope
);
6019 else if (TREE_CODE (lookup
.value
) == TREE_LIST
6020 /* We can (independently) have ambiguous implicit typedefs. */
6021 || (lookup
.type
&& TREE_CODE (lookup
.type
) == TREE_LIST
))
6023 error ("reference to %qD is ambiguous", lookup
.name
);
6024 print_candidates (TREE_CODE (lookup
.value
) == TREE_LIST
6025 ? lookup
.value
: lookup
.type
);
6028 else if (TREE_CODE (lookup
.value
) == NAMESPACE_DECL
)
6030 error ("using-declaration may not name namespace %qD", lookup
.value
);
6034 if (TYPE_P (current
))
6036 /* In class scope. */
6038 /* Cannot introduce a constructor name. */
6039 if (constructor_name_p (lookup
.name
, current
))
6041 error ("%<%T::%D%> names constructor in %qT",
6042 scope
, lookup
.name
, current
);
6046 if (lookup
.value
&& BASELINK_P (lookup
.value
))
6047 /* The binfo from which the functions came does not matter. */
6048 lookup
.value
= BASELINK_FUNCTIONS (lookup
.value
);
6051 tree using_decl
= build_lang_decl (USING_DECL
, lookup
.name
, NULL_TREE
);
6052 USING_DECL_SCOPE (using_decl
) = scope
;
6053 USING_DECL_DECLS (using_decl
) = lookup
.value
;
6054 DECL_DEPENDENT_P (using_decl
) = dependent_p
;
6055 DECL_CONTEXT (using_decl
) = current
;
6056 if (TYPE_P (current
) && b_kind
== bk_not_base
)
6057 USING_DECL_UNRELATED_P (using_decl
) = true;
6062 /* Process "using SCOPE::NAME" in a class scope. Return the
6063 USING_DECL created. */
6066 do_class_using_decl (tree scope
, tree name
)
6068 if (name
== error_mark_node
6069 || scope
== error_mark_node
)
6072 name_lookup
lookup (name
);
6073 return lookup_using_decl (scope
, lookup
);
6077 /* Return the binding for NAME in NS in the current TU. If NS is
6078 NULL, look in global_namespace. We will not find declarations
6079 from imports. Users of this who, having found nothing, push a new
6080 decl must be prepared for that pushing to match an existing decl. */
6083 get_namespace_binding (tree ns
, tree name
)
6085 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
6087 ns
= global_namespace
;
6088 gcc_checking_assert (!DECL_NAMESPACE_ALIAS (ns
));
6089 tree ret
= NULL_TREE
;
6091 if (tree
*b
= find_namespace_slot (ns
, name
))
6095 if (TREE_CODE (ret
) == BINDING_VECTOR
)
6096 ret
= BINDING_VECTOR_CLUSTER (ret
, 0).slots
[0];
6098 ret
= MAYBE_STAT_DECL (ret
);
6104 /* Push internal DECL into the global namespace. Does not do the
6105 full overload fn handling and does not add it to the list of things
6106 in the namespace. */
6109 set_global_binding (tree decl
)
6111 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
6113 tree
*slot
= find_namespace_slot (global_namespace
, DECL_NAME (decl
), true);
6116 /* The user's placed something in the implementor's namespace. */
6117 diagnose_name_conflict (decl
, MAYBE_STAT_DECL (*slot
));
6119 /* Force the binding, so compiler internals continue to work. */
6123 /* Set the context of a declaration to scope. Complain if we are not
6127 set_decl_namespace (tree decl
, tree scope
, bool friendp
)
6129 /* Get rid of namespace aliases. */
6130 scope
= ORIGINAL_NAMESPACE (scope
);
6132 /* It is ok for friends to be qualified in parallel space. */
6133 if (!friendp
&& !is_nested_namespace (current_namespace
, scope
))
6134 error ("declaration of %qD not in a namespace surrounding %qD",
6136 DECL_CONTEXT (decl
) = FROB_CONTEXT (scope
);
6138 /* See whether this has been declared in the namespace or inline
6140 tree old
= NULL_TREE
;
6142 name_lookup
lookup (DECL_NAME (decl
),
6143 LOOK_want::NORMAL
| LOOK_want::HIDDEN_FRIEND
);
6144 if (!lookup
.search_qualified (scope
, /*usings=*/false))
6145 /* No old declaration at all. */
6150 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
6151 if (TREE_CODE (old
) == TREE_LIST
)
6154 DECL_CONTEXT (decl
) = FROB_CONTEXT (scope
);
6155 error ("reference to %qD is ambiguous", decl
);
6156 print_candidates (old
);
6160 if (!DECL_DECLARES_FUNCTION_P (decl
))
6162 /* Don't compare non-function decls with decls_match here, since
6163 it can't check for the correct constness at this
6164 point. pushdecl will find those errors later. */
6166 /* We might have found it in an inline namespace child of SCOPE. */
6167 if (TREE_CODE (decl
) == TREE_CODE (old
))
6168 DECL_CONTEXT (decl
) = DECL_CONTEXT (old
);
6171 /* Writing "N::i" to declare something directly in "N" is invalid. */
6172 if (CP_DECL_CONTEXT (decl
) == current_namespace
6173 && at_namespace_scope_p ())
6174 error_at (DECL_SOURCE_LOCATION (decl
),
6175 "explicit qualification in declaration of %qD", decl
);
6179 /* Since decl is a function, old should contain a function decl. */
6183 /* It didn't work, go back to the explicit scope. */
6184 DECL_CONTEXT (decl
) = FROB_CONTEXT (scope
);
6185 error ("%qD should have been declared inside %qD", decl
, scope
);
6190 /* We handle these in check_explicit_instantiation_namespace. */
6191 if (processing_explicit_instantiation
)
6193 if (processing_template_decl
|| processing_specialization
)
6194 /* We have not yet called push_template_decl to turn a
6195 FUNCTION_DECL into a TEMPLATE_DECL, so the declarations won't
6196 match. But, we'll check later, when we construct the
6200 /* Instantiations or specializations of templates may be declared as
6201 friends in any namespace. */
6202 if (friendp
&& DECL_USE_TEMPLATE (decl
))
6205 tree found
= NULL_TREE
;
6206 bool hidden_p
= false;
6207 bool saw_template
= false;
6209 for (lkp_iterator
iter (old
); iter
; ++iter
)
6211 if (iter
.using_p ())
6216 /* Adjust DECL_CONTEXT first so decls_match will return true
6217 if DECL will match a declaration in an inline namespace. */
6218 DECL_CONTEXT (decl
) = DECL_CONTEXT (ofn
);
6219 if (decls_match (decl
, ofn
))
6223 /* We found more than one matching declaration. This
6224 can happen if we have two inline namespace children,
6225 each containing a suitable declaration. */
6226 DECL_CONTEXT (decl
) = FROB_CONTEXT (scope
);
6230 hidden_p
= iter
.hidden_p ();
6232 else if (TREE_CODE (decl
) == FUNCTION_DECL
6233 && TREE_CODE (ofn
) == TEMPLATE_DECL
)
6234 saw_template
= true;
6237 if (!found
&& friendp
&& saw_template
)
6239 /* "[if no non-template match is found,] each remaining function template
6240 is replaced with the specialization chosen by deduction from the
6241 friend declaration or discarded if deduction fails."
6243 So tell check_explicit_specialization to look for a match. */
6244 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
6245 DECL_TEMPLATE_INFO (decl
) = build_template_info (old
, NULL_TREE
);
6253 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
6254 "%qD has not been declared within %qD", decl
, scope
);
6255 inform (DECL_SOURCE_LOCATION (found
),
6256 "only here as a %<friend%>");
6258 DECL_CONTEXT (decl
) = DECL_CONTEXT (found
);
6265 /* Return the namespace where the current declaration is declared. */
6268 current_decl_namespace (void)
6271 /* If we have been pushed into a different namespace, use it. */
6272 if (!vec_safe_is_empty (decl_namespace_list
))
6273 return decl_namespace_list
->last ();
6275 if (current_class_type
)
6276 result
= decl_namespace_context (current_class_type
);
6277 else if (current_function_decl
)
6278 result
= decl_namespace_context (current_function_decl
);
6280 result
= current_namespace
;
6284 /* Process any ATTRIBUTES on a namespace definition. Returns true if
6285 attribute visibility is seen. */
6288 handle_namespace_attrs (tree ns
, tree attributes
)
6291 bool saw_vis
= false;
6293 if (attributes
== error_mark_node
)
6296 for (d
= attributes
; d
; d
= TREE_CHAIN (d
))
6298 tree name
= get_attribute_name (d
);
6299 tree args
= TREE_VALUE (d
);
6301 if (is_attribute_p ("visibility", name
))
6303 /* attribute visibility is a property of the syntactic block
6304 rather than the namespace as a whole, so we don't touch the
6305 NAMESPACE_DECL at all. */
6306 tree x
= args
? TREE_VALUE (args
) : NULL_TREE
;
6307 if (x
== NULL_TREE
|| TREE_CODE (x
) != STRING_CST
|| TREE_CHAIN (args
))
6309 warning (OPT_Wattributes
,
6310 "%qD attribute requires a single NTBS argument",
6315 if (!TREE_PUBLIC (ns
))
6316 warning (OPT_Wattributes
,
6317 "%qD attribute is meaningless since members of the "
6318 "anonymous namespace get local symbols", name
);
6320 push_visibility (TREE_STRING_POINTER (x
), 1);
6323 else if (is_attribute_p ("abi_tag", name
))
6325 if (!DECL_NAME (ns
))
6327 warning (OPT_Wattributes
, "ignoring %qD attribute on anonymous "
6331 if (!DECL_NAMESPACE_INLINE_P (ns
))
6333 warning (OPT_Wattributes
, "ignoring %qD attribute on non-inline "
6339 tree dn
= DECL_NAME (ns
);
6340 args
= build_string (IDENTIFIER_LENGTH (dn
) + 1,
6341 IDENTIFIER_POINTER (dn
));
6342 TREE_TYPE (args
) = char_array_type_node
;
6343 args
= fix_string_type (args
);
6344 args
= build_tree_list (NULL_TREE
, args
);
6346 if (check_abi_tag_args (args
, name
))
6347 DECL_ATTRIBUTES (ns
) = tree_cons (name
, args
,
6348 DECL_ATTRIBUTES (ns
));
6350 else if (is_attribute_p ("deprecated", name
))
6352 if (!DECL_NAME (ns
))
6354 warning (OPT_Wattributes
, "ignoring %qD attribute on anonymous "
6358 if (args
&& TREE_CODE (TREE_VALUE (args
)) != STRING_CST
)
6360 error ("deprecated message is not a string");
6363 TREE_DEPRECATED (ns
) = 1;
6365 DECL_ATTRIBUTES (ns
) = tree_cons (name
, args
,
6366 DECL_ATTRIBUTES (ns
));
6368 else if (!attribute_ignored_p (d
))
6370 warning (OPT_Wattributes
, "%qD attribute directive ignored",
6379 /* Temporarily set the namespace for the current declaration. */
6382 push_decl_namespace (tree decl
)
6384 if (TREE_CODE (decl
) != NAMESPACE_DECL
)
6385 decl
= decl_namespace_context (decl
);
6386 vec_safe_push (decl_namespace_list
, ORIGINAL_NAMESPACE (decl
));
6389 /* [namespace.memdef]/2 */
6392 pop_decl_namespace (void)
6394 decl_namespace_list
->pop ();
6397 /* Process a namespace-alias declaration. */
6400 do_namespace_alias (tree alias
, tree name_space
)
6402 if (name_space
== error_mark_node
)
6405 gcc_assert (TREE_CODE (name_space
) == NAMESPACE_DECL
);
6407 name_space
= ORIGINAL_NAMESPACE (name_space
);
6409 /* Build the alias. */
6410 alias
= build_lang_decl (NAMESPACE_DECL
, alias
, void_type_node
);
6411 DECL_NAMESPACE_ALIAS (alias
) = name_space
;
6412 DECL_EXTERNAL (alias
) = 1;
6413 DECL_CONTEXT (alias
) = FROB_CONTEXT (current_scope ());
6414 set_originating_module (alias
);
6418 /* Emit debug info for namespace alias. */
6419 if (!building_stmt_list_p ())
6420 (*debug_hooks
->early_global_decl
) (alias
);
6423 /* Like pushdecl, only it places DECL in the current namespace,
6427 pushdecl_namespace_level (tree decl
, bool hiding
)
6429 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
6430 return do_pushdecl_with_scope (decl
, NAMESPACE_LEVEL (current_namespace
),
6434 /* Wrapper around push_local_binding to push the bindings for
6435 a non-member USING_DECL with NAME and VALUE. LOOKUP, if non-null,
6436 is the result of name lookup during template parsing. */
6439 push_using_decl_bindings (name_lookup
*lookup
, tree name
, tree value
)
6441 tree type
= NULL_TREE
;
6443 cxx_binding
*binding
= find_local_binding (current_binding_level
, name
);
6446 value
= binding
->value
;
6447 type
= binding
->type
;
6450 /* DR 36 questions why using-decls at function scope may not be
6451 duplicates. Disallow it, as C++11 claimed and PR 20420
6454 do_nonmember_using_decl (*lookup
, true, true, &value
, &type
);
6458 else if (binding
&& value
== binding
->value
)
6459 /* Redeclaration of this USING_DECL. */;
6460 else if (binding
&& binding
->value
&& TREE_CODE (value
) == OVERLOAD
)
6462 /* We already have this binding, so replace it. */
6463 update_local_overload (IDENTIFIER_BINDING (name
), value
);
6464 IDENTIFIER_BINDING (name
)->value
= value
;
6467 /* Install the new binding. */
6468 push_local_binding (name
, value
, /*using=*/true);
6472 else if (binding
&& type
== binding
->type
)
6476 push_local_binding (name
, type
, /*using=*/true);
6477 set_identifier_type_value (name
, type
);
6481 /* Overload for push_using_decl_bindings that doesn't take a name_lookup. */
6484 push_using_decl_bindings (tree name
, tree value
)
6486 push_using_decl_bindings (nullptr, name
, value
);
6489 /* Process a using declaration in non-class scope. */
6492 finish_nonmember_using_decl (tree scope
, tree name
)
6494 gcc_checking_assert (current_binding_level
->kind
!= sk_class
);
6496 if (scope
== error_mark_node
|| name
== error_mark_node
)
6499 name_lookup
lookup (name
);
6501 tree using_decl
= lookup_using_decl (scope
, lookup
);
6505 /* Emit debug info. */
6506 if (!processing_template_decl
)
6507 cp_emit_debug_info_for_using (lookup
.value
,
6508 current_binding_level
->this_entity
);
6510 if (current_binding_level
->kind
== sk_namespace
)
6512 tree
*slot
= find_namespace_slot (current_namespace
, name
, true);
6513 tree
*mslot
= get_fixed_binding_slot (slot
, name
,
6514 BINDING_SLOT_CURRENT
, true);
6515 bool failed
= false;
6519 /* A module vector. I presume the binding list is going to
6520 be sparser than the import bitmap. Hence iterate over
6521 the former checking for bits set in the bitmap. */
6522 bitmap imports
= get_import_bitmap ();
6523 binding_cluster
*cluster
= BINDING_VECTOR_CLUSTER_BASE (*slot
);
6525 /* Scan the imported bindings. */
6526 unsigned ix
= BINDING_VECTOR_NUM_CLUSTERS (*slot
);
6527 if (BINDING_VECTOR_SLOTS_PER_CLUSTER
== BINDING_SLOTS_FIXED
)
6533 /* Do this in forward order, so we load modules in an order
6534 the user expects. */
6535 for (; ix
--; cluster
++)
6536 for (unsigned jx
= 0; jx
!= BINDING_VECTOR_SLOTS_PER_CLUSTER
; jx
++)
6538 /* Are we importing this module? */
6539 if (unsigned base
= cluster
->indices
[jx
].base
)
6540 if (unsigned span
= cluster
->indices
[jx
].span
)
6542 if (bitmap_bit_p (imports
, base
))
6544 while (++base
, --span
);
6549 if (cluster
->slots
[jx
].is_lazy ())
6551 gcc_assert (cluster
->indices
[jx
].span
== 1);
6552 lazy_load_binding (cluster
->indices
[jx
].base
,
6553 scope
, name
, &cluster
->slots
[jx
]);
6556 tree value
= cluster
->slots
[jx
];
6558 /* Load errors could mean there's nothing here. */
6561 /* Extract what we can see from here. If there's no
6562 stat_hack, then everything was exported. */
6563 tree type
= NULL_TREE
;
6565 /* If no stat hack, everything is visible. */
6566 if (STAT_HACK_P (value
))
6568 if (STAT_TYPE_VISIBLE_P (value
))
6569 type
= STAT_TYPE (value
);
6570 value
= STAT_VISIBLE (value
);
6573 if (do_nonmember_using_decl (lookup
, false, false,
6584 /* Now do the current slot. */
6585 tree value
= MAYBE_STAT_DECL (*mslot
);
6586 tree type
= MAYBE_STAT_TYPE (*mslot
);
6588 do_nonmember_using_decl (lookup
, false, true, &value
, &type
);
6590 // FIXME: Partition mergeableness?
6591 if (STAT_HACK_P (*mslot
))
6593 STAT_DECL (*mslot
) = value
;
6594 STAT_TYPE (*mslot
) = type
;
6597 *mslot
= stat_hack (value
, type
);
6604 add_decl_expr (using_decl
);
6605 if (DECL_DEPENDENT_P (using_decl
))
6606 lookup
.value
= using_decl
;
6607 push_using_decl_bindings (&lookup
, name
, NULL_TREE
);
6611 /* Return the declarations that are members of the namespace NS. */
6614 cp_namespace_decls (tree ns
)
6616 return NAMESPACE_LEVEL (ns
)->names
;
6619 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
6620 ignore it or not. Subroutine of lookup_name_1 and lookup_type_scope. */
6623 qualify_lookup (tree val
, LOOK_want want
)
6625 if (val
== NULL_TREE
)
6628 if (bool (want
& LOOK_want::TYPE
))
6630 tree target_val
= strip_using_decl (val
);
6632 if (TREE_CODE (STRIP_TEMPLATE (target_val
)) == TYPE_DECL
)
6636 if (bool (want
& LOOK_want::TYPE_NAMESPACE
))
6637 return TREE_CODE (val
) == NAMESPACE_DECL
;
6642 /* Is there a "using namespace std;" directive within USINGS? */
6645 using_directives_contain_std_p (vec
<tree
, va_gc
> *usings
)
6650 for (unsigned ix
= usings
->length (); ix
--;)
6651 if ((*usings
)[ix
] == std_node
)
6657 /* Is there a "using namespace std;" directive within the current
6658 namespace (or its ancestors)?
6659 Compare with name_lookup::search_unqualified. */
6662 has_using_namespace_std_directive_p ()
6664 for (cp_binding_level
*level
= current_binding_level
;
6666 level
= level
->level_chain
)
6667 if (using_directives_contain_std_p (level
->using_directives
))
6673 /* Subclass of deferred_diagnostic, for issuing a note when
6674 --param cxx-max-namespaces-for-diagnostic-help is reached.
6676 The note should be issued after the error, but before any other
6677 deferred diagnostics. This is handled by decorating a wrapped
6678 deferred_diagnostic, and emitting a note before that wrapped note is
6681 class namespace_limit_reached
: public deferred_diagnostic
6684 namespace_limit_reached (location_t loc
, unsigned limit
, tree name
,
6685 std::unique_ptr
<deferred_diagnostic
> wrapped
)
6686 : deferred_diagnostic (loc
),
6687 m_limit (limit
), m_name (name
),
6688 m_wrapped (std::move (wrapped
))
6692 ~namespace_limit_reached ()
6694 /* Unconditionally warn that the search was truncated. */
6695 inform (get_location (),
6696 "maximum limit of %d namespaces searched for %qE",
6698 /* m_wrapped will be implicitly deleted after this, emitting any followup
6699 diagnostic after the above note. */
6705 std::unique_ptr
<deferred_diagnostic
> m_wrapped
;
6708 /* Subclass of deferred_diagnostic, for use when issuing a single suggestion.
6709 Emit a note showing the location of the declaration of the suggestion. */
6711 class show_candidate_location
: public deferred_diagnostic
6714 show_candidate_location (location_t loc
, tree candidate
)
6715 : deferred_diagnostic (loc
),
6716 m_candidate (candidate
)
6720 ~show_candidate_location ()
6722 inform (location_of (m_candidate
), "%qE declared here", m_candidate
);
6729 /* Subclass of deferred_diagnostic, for use when there are multiple candidates
6730 to be suggested by suggest_alternatives_for.
6732 Emit a series of notes showing the various suggestions. */
6734 class suggest_alternatives
: public deferred_diagnostic
6737 suggest_alternatives (location_t loc
, vec
<tree
> candidates
)
6738 : deferred_diagnostic (loc
),
6739 m_candidates (candidates
)
6743 ~suggest_alternatives ()
6745 if (m_candidates
.length ())
6747 inform_n (get_location (), m_candidates
.length (),
6748 "suggested alternative:",
6749 "suggested alternatives:");
6750 for (unsigned ix
= 0; ix
!= m_candidates
.length (); ix
++)
6752 tree val
= m_candidates
[ix
];
6754 inform (location_of (val
), " %qE", val
);
6757 m_candidates
.release ();
6761 vec
<tree
> m_candidates
;
6764 /* A class for encapsulating the result of a search across
6765 multiple namespaces (and scoped enums within them) for an
6766 unrecognized name seen at a given source location. */
6768 class namespace_hints
6771 namespace_hints (location_t loc
, tree name
);
6773 name_hint
convert_candidates_to_name_hint ();
6774 name_hint
maybe_decorate_with_limit (name_hint
);
6777 void maybe_add_candidate_for_scoped_enum (tree scoped_enum
, tree name
);
6781 vec
<tree
> m_candidates
;
6783 /* Value of "--param cxx-max-namespaces-for-diagnostic-help". */
6786 /* Was the limit reached? */
6790 /* Constructor for namespace_hints. Search namespaces and scoped enums,
6791 looking for an exact match for unrecognized NAME seen at LOC. */
6793 namespace_hints::namespace_hints (location_t loc
, tree name
)
6794 : m_loc(loc
), m_name (name
)
6796 auto_vec
<tree
> worklist
;
6798 m_candidates
= vNULL
;
6800 m_limit
= param_cxx_max_namespaces_for_diagnostic_help
;
6802 /* Breadth-first search of namespaces. Up to limit namespaces
6803 searched (limit zero == unlimited). */
6804 worklist
.safe_push (global_namespace
);
6805 for (unsigned ix
= 0; ix
!= worklist
.length (); ix
++)
6807 tree ns
= worklist
[ix
];
6808 name_lookup
lookup (name
);
6810 if (lookup
.search_qualified (ns
, false))
6811 m_candidates
.safe_push (lookup
.value
);
6815 /* Look for child namespaces. We have to do this
6816 indirectly because they are chained in reverse order,
6817 which is confusing to the user. */
6818 auto_vec
<tree
> children
;
6820 for (tree decl
= NAMESPACE_LEVEL (ns
)->names
;
6821 decl
; decl
= TREE_CHAIN (decl
))
6823 if (TREE_CODE (decl
) == NAMESPACE_DECL
6824 && !DECL_NAMESPACE_ALIAS (decl
)
6825 && !DECL_NAMESPACE_INLINE_P (decl
))
6826 children
.safe_push (decl
);
6828 /* Look for exact matches for NAME within scoped enums.
6829 These aren't added to the worklist, and so don't count
6830 against the search limit. */
6831 if (TREE_CODE (decl
) == TYPE_DECL
)
6833 tree type
= TREE_TYPE (decl
);
6834 if (SCOPED_ENUM_P (type
))
6835 maybe_add_candidate_for_scoped_enum (type
, name
);
6839 while (!m_limited
&& !children
.is_empty ())
6841 if (worklist
.length () == m_limit
)
6844 worklist
.safe_push (children
.pop ());
6850 /* Drop ownership of m_candidates, using it to generate a name_hint at m_loc
6851 for m_name, an IDENTIFIER_NODE for which name lookup failed.
6853 If m_candidates is non-empty, use it to generate a suggestion and/or
6854 a deferred diagnostic that lists the possible candidate(s).
6858 namespace_hints::convert_candidates_to_name_hint ()
6860 /* How many candidates do we have? */
6862 /* If we have just one candidate, issue a name_hint with it as a suggestion
6863 (so that consumers are able to suggest it within the error message and emit
6864 it as a fix-it hint), and with a note showing the candidate's location. */
6865 if (m_candidates
.length () == 1)
6867 tree candidate
= m_candidates
[0];
6868 /* Clean up CANDIDATES. */
6869 m_candidates
.release ();
6870 return name_hint (expr_to_string (candidate
),
6871 new show_candidate_location (m_loc
, candidate
));
6873 else if (m_candidates
.length () > 1)
6874 /* If we have more than one candidate, issue a name_hint without a single
6875 "suggestion", but with a deferred diagnostic that lists the
6876 various candidates. This takes ownership of m_candidates. */
6877 return name_hint (NULL
, new suggest_alternatives (m_loc
, m_candidates
));
6879 /* Otherwise, m_candidates ought to be empty, so no cleanup is necessary. */
6880 gcc_assert (m_candidates
.length () == 0);
6881 gcc_assert (m_candidates
== vNULL
);
6883 return name_hint ();
6886 /* If --param cxx-max-namespaces-for-diagnostic-help was reached,
6887 then we want to emit a note about after the error, but before
6888 any other deferred diagnostics.
6890 Handle this by figuring out what hint is needed, then optionally
6891 decorating HINT with a namespace_limit_reached wrapper. */
6894 namespace_hints::maybe_decorate_with_limit (name_hint hint
)
6897 return name_hint (hint
.suggestion (),
6898 new namespace_limit_reached (m_loc
, m_limit
,
6900 hint
.take_deferred ()));
6905 /* Look inside SCOPED_ENUM for exact matches for NAME.
6906 If one is found, add its CONST_DECL to m_candidates. */
6909 namespace_hints::maybe_add_candidate_for_scoped_enum (tree scoped_enum
,
6912 gcc_assert (SCOPED_ENUM_P (scoped_enum
));
6914 for (tree iter
= TYPE_VALUES (scoped_enum
); iter
; iter
= TREE_CHAIN (iter
))
6916 tree id
= TREE_PURPOSE (iter
);
6919 m_candidates
.safe_push (TREE_VALUE (iter
));
6925 /* Generate a name_hint at LOCATION for NAME, an IDENTIFIER_NODE for which
6928 Search through all available namespaces and any scoped enums within them
6929 and generate a suggestion and/or a deferred diagnostic that lists possible
6932 If no exact matches are found, and SUGGEST_MISSPELLINGS is true, then also
6933 look for near-matches and suggest the best near-match, if there is one.
6935 If nothing is found, then an empty name_hint is returned. */
6938 suggest_alternatives_for (location_t location
, tree name
,
6939 bool suggest_misspellings
)
6941 /* First, search for exact matches in other namespaces. */
6942 namespace_hints
ns_hints (location
, name
);
6943 name_hint result
= ns_hints
.convert_candidates_to_name_hint ();
6945 /* Otherwise, try other approaches. */
6947 result
= suggest_alternatives_for_1 (location
, name
, suggest_misspellings
);
6949 return ns_hints
.maybe_decorate_with_limit (std::move (result
));
6952 /* The second half of suggest_alternatives_for, for when no exact matches
6953 were found in other namespaces. */
6956 suggest_alternatives_for_1 (location_t location
, tree name
,
6957 bool suggest_misspellings
)
6959 /* No candidates were found in the available namespaces. */
6961 /* If there's a "using namespace std;" active, and this
6962 is one of the most common "std::" names, then it's probably a
6963 missing #include. */
6964 if (has_using_namespace_std_directive_p ())
6966 name_hint hint
= maybe_suggest_missing_std_header (location
, name
);
6971 /* Otherwise, consider misspellings. */
6972 if (!suggest_misspellings
)
6973 return name_hint ();
6975 return lookup_name_fuzzy (name
, FUZZY_LOOKUP_NAME
, location
);
6978 /* Generate a name_hint at LOCATION for NAME, an IDENTIFIER_NODE for which
6981 Search through all available namespaces and generate a suggestion and/or
6982 a deferred diagnostic that lists possible candidate(s).
6984 This is similiar to suggest_alternatives_for, but doesn't fallback to
6985 the other approaches used by that function. */
6988 suggest_alternatives_in_other_namespaces (location_t location
, tree name
)
6990 namespace_hints
ns_hints (location
, name
);
6992 name_hint result
= ns_hints
.convert_candidates_to_name_hint ();
6994 return ns_hints
.maybe_decorate_with_limit (std::move (result
));
6997 /* A well-known name within the C++ standard library, returned by
7000 The gperf-generated file contains the definition of the class
7001 "std_name_hint_lookup" with a static member function which
7002 returns the pointer to a structure "std_name_hint" which
7003 is also defined in that file. */
7005 #include "std-name-hint.h"
7007 /* Subroutine of maybe_suggest_missing_header for handling unrecognized names
7008 for some of the most common names within "std::".
7009 Given non-NULL NAME, return the std_name_hint for it, or NULL. */
7011 static const std_name_hint
*
7012 get_std_name_hint (const char *name
)
7014 return std_name_hint_lookup::find(name
, strlen(name
));
7017 /* Describe DIALECT. */
7020 get_cxx_dialect_name (enum cxx_dialect dialect
)
7043 /* Subclass of deferred_diagnostic for use for names in the "std" namespace
7044 that weren't recognized, but for which we know which header it ought to be
7047 Emit a note either suggesting the header to be included, or noting that
7048 the current dialect is too early for the given name. */
7050 class missing_std_header
: public deferred_diagnostic
7053 missing_std_header (location_t loc
,
7054 const char *name_str
,
7055 const std_name_hint
*header_hint
)
7056 : deferred_diagnostic (loc
),
7057 m_name_str (name_str
),
7058 m_header_hint (header_hint
)
7060 ~missing_std_header ()
7062 gcc_rich_location
richloc (get_location ());
7063 if (cxx_dialect
>= m_header_hint
->min_dialect
)
7065 const char *header
= m_header_hint
->header
;
7066 maybe_add_include_fixit (&richloc
, header
, true);
7068 "%<std::%s%> is defined in header %qs;"
7069 " this is probably fixable by adding %<#include %s%>",
7070 m_name_str
, header
, header
);
7074 "%<std::%s%> is only available from %s onwards",
7075 m_name_str
, get_cxx_dialect_name (m_header_hint
->min_dialect
));
7079 const char *m_name_str
;
7080 const std_name_hint
*m_header_hint
;
7083 /* Attempt to generate a name_hint that suggests pertinent header files
7084 for NAME at LOCATION, for common names within the "std" namespace,
7085 or an empty name_hint if this isn't applicable. */
7088 maybe_suggest_missing_std_header (location_t location
, tree name
)
7090 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
);
7092 const char *name_str
= IDENTIFIER_POINTER (name
);
7093 const std_name_hint
*header_hint
= get_std_name_hint (name_str
);
7095 return name_hint ();
7097 return name_hint (NULL
, new missing_std_header (location
, name_str
,
7101 /* Attempt to generate a name_hint that suggests a missing header file
7102 for NAME within SCOPE at LOCATION, or an empty name_hint if this isn't
7106 maybe_suggest_missing_header (location_t location
, tree name
, tree scope
)
7108 if (scope
== NULL_TREE
)
7109 return name_hint ();
7110 if (TREE_CODE (scope
) != NAMESPACE_DECL
)
7111 return name_hint ();
7112 /* We only offer suggestions for the "std" namespace. */
7113 if (scope
!= std_node
)
7114 return name_hint ();
7115 return maybe_suggest_missing_std_header (location
, name
);
7118 /* Generate a name_hint at LOCATION for NAME, an IDENTIFIER_NODE for which name
7119 lookup failed within the explicitly provided SCOPE.
7121 Suggest the best meaningful candidates (if any), otherwise
7122 an empty name_hint is returned. */
7125 suggest_alternative_in_explicit_scope (location_t location
, tree name
,
7128 /* Something went very wrong; don't suggest anything. */
7129 if (name
== error_mark_node
)
7130 return name_hint ();
7132 /* Resolve any namespace aliases. */
7133 scope
= ORIGINAL_NAMESPACE (scope
);
7135 name_hint hint
= maybe_suggest_missing_header (location
, name
, scope
);
7139 cp_binding_level
*level
= NAMESPACE_LEVEL (scope
);
7141 best_match
<tree
, const char *> bm (name
);
7142 consider_binding_level (name
, bm
, level
, false, FUZZY_LOOKUP_NAME
);
7144 /* See if we have a good suggesion for the user. */
7145 const char *fuzzy_name
= bm
.get_best_meaningful_candidate ();
7147 return name_hint (fuzzy_name
, NULL
);
7149 return name_hint ();
7152 /* Given NAME, look within SCOPED_ENUM for possible spell-correction
7156 suggest_alternative_in_scoped_enum (tree name
, tree scoped_enum
)
7158 gcc_assert (SCOPED_ENUM_P (scoped_enum
));
7160 best_match
<tree
, const char *> bm (name
);
7161 for (tree iter
= TYPE_VALUES (scoped_enum
); iter
; iter
= TREE_CHAIN (iter
))
7163 tree id
= TREE_PURPOSE (iter
);
7164 bm
.consider (IDENTIFIER_POINTER (id
));
7166 return name_hint (bm
.get_best_meaningful_candidate (), NULL
);
7169 /* Look up NAME (an IDENTIFIER_NODE) in SCOPE (either a NAMESPACE_DECL
7172 WANT as for lookup_name_1.
7174 Returns a DECL (or OVERLOAD, or BASELINK) representing the
7175 declaration found. If no suitable declaration can be found,
7176 ERROR_MARK_NODE is returned. If COMPLAIN is true and SCOPE is
7177 neither a class-type nor a namespace a diagnostic is issued. */
7180 lookup_qualified_name (tree scope
, tree name
, LOOK_want want
, bool complain
)
7184 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
7186 name_lookup
lookup (name
, want
);
7188 if (qualified_namespace_lookup (scope
, &lookup
))
7192 /* If we have a known type overload, pull it out. This can happen
7194 if (TREE_CODE (t
) == OVERLOAD
&& TREE_TYPE (t
) != unknown_type_node
)
7195 t
= OVL_FUNCTION (t
);
7198 else if (cxx_dialect
!= cxx98
&& TREE_CODE (scope
) == ENUMERAL_TYPE
)
7199 t
= lookup_enumerator (scope
, name
);
7200 else if (is_class_type (scope
, complain
))
7201 t
= lookup_member (scope
, name
, 2, bool (want
& LOOK_want::TYPE
),
7202 tf_warning_or_error
);
7205 return error_mark_node
;
7209 /* Wrapper for the above that takes a string argument. The function name is
7210 not at the beginning of the line to keep this wrapper out of etags. */
7212 tree
lookup_qualified_name (tree t
, const char *p
, LOOK_want w
, bool c
)
7214 return lookup_qualified_name (t
, get_identifier (p
), w
, c
);
7218 Accepts the NAME to lookup and its qualifying SCOPE.
7219 Returns the name/type pair found into the cxx_binding *RESULT,
7220 or false on error. */
7223 qualified_namespace_lookup (tree scope
, name_lookup
*lookup
)
7225 timevar_start (TV_NAME_LOOKUP
);
7226 query_oracle (lookup
->name
);
7227 bool found
= lookup
->search_qualified (ORIGINAL_NAMESPACE (scope
));
7228 timevar_stop (TV_NAME_LOOKUP
);
7232 /* If DECL is suitably visible to the user, consider its name for
7233 spelling correction. */
7236 consider_decl (tree decl
, best_match
<tree
, const char *> &bm
,
7237 bool consider_impl_names
)
7239 /* Skip compiler-generated variables (e.g. __for_begin/__for_end
7240 within range for). */
7241 if (VAR_P (decl
) && DECL_ARTIFICIAL (decl
))
7244 tree suggestion
= DECL_NAME (decl
);
7248 /* Don't suggest names that are for anonymous aggregate types, as
7249 they are an implementation detail generated by the compiler. */
7250 if (IDENTIFIER_ANON_P (suggestion
))
7253 const char *suggestion_str
= IDENTIFIER_POINTER (suggestion
);
7255 /* Ignore internal names with spaces in them. */
7256 if (strchr (suggestion_str
, ' '))
7259 /* Don't suggest names that are reserved for use by the
7260 implementation, unless NAME began with an underscore. */
7261 if (!consider_impl_names
7262 && name_reserved_for_implementation_p (suggestion_str
))
7265 bm
.consider (suggestion_str
);
7268 /* If DECL is suitably visible to the user, add its name to VEC and
7269 return true. Otherwise return false. */
7272 maybe_add_fuzzy_decl (auto_vec
<tree
> &vec
, tree decl
)
7274 /* Skip compiler-generated variables (e.g. __for_begin/__for_end
7275 within range for). */
7276 if (VAR_P (decl
) && DECL_ARTIFICIAL (decl
))
7279 tree suggestion
= DECL_NAME (decl
);
7283 /* Don't suggest names that are for anonymous aggregate types, as
7284 they are an implementation detail generated by the compiler. */
7285 if (IDENTIFIER_ANON_P (suggestion
))
7288 vec
.safe_push (suggestion
);
7293 /* Examing the namespace binding BINDING, and add at most one instance
7294 of the name, if it contains a visible entity of interest. Return
7295 true if we added something. */
7298 maybe_add_fuzzy_binding (auto_vec
<tree
> &vec
, tree binding
,
7299 lookup_name_fuzzy_kind kind
)
7301 tree value
= NULL_TREE
;
7303 if (STAT_HACK_P (binding
))
7305 if (!STAT_TYPE_HIDDEN_P (binding
)
7306 && STAT_TYPE (binding
))
7308 if (maybe_add_fuzzy_decl (vec
, STAT_TYPE (binding
)))
7311 else if (!STAT_DECL_HIDDEN_P (binding
))
7312 value
= STAT_DECL (binding
);
7317 value
= ovl_skip_hidden (value
);
7320 value
= OVL_FIRST (value
);
7321 if (kind
!= FUZZY_LOOKUP_TYPENAME
7322 || TREE_CODE (STRIP_TEMPLATE (value
)) == TYPE_DECL
)
7323 if (maybe_add_fuzzy_decl (vec
, value
))
7327 /* Nothing found. */
7331 /* Helper function for lookup_name_fuzzy.
7332 Traverse binding level LVL, looking for good name matches for NAME
7335 consider_binding_level (tree name
, best_match
<tree
, const char *> &bm
,
7336 cp_binding_level
*lvl
, bool look_within_fields
,
7337 enum lookup_name_fuzzy_kind kind
)
7339 if (look_within_fields
)
7340 if (lvl
->this_entity
&& TREE_CODE (lvl
->this_entity
) == RECORD_TYPE
)
7342 tree type
= lvl
->this_entity
;
7343 bool want_type_p
= (kind
== FUZZY_LOOKUP_TYPENAME
);
7344 tree best_matching_field
7345 = lookup_member_fuzzy (type
, name
, want_type_p
);
7346 if (best_matching_field
)
7347 bm
.consider (IDENTIFIER_POINTER (best_matching_field
));
7350 /* Only suggest names reserved for the implementation if NAME begins
7351 with an underscore. */
7352 bool consider_implementation_names
= (IDENTIFIER_POINTER (name
)[0] == '_');
7354 if (lvl
->kind
!= sk_namespace
)
7355 for (tree t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
7359 /* OVERLOADs or decls from using declaration are wrapped into
7361 if (TREE_CODE (d
) == TREE_LIST
)
7362 d
= OVL_FIRST (TREE_VALUE (d
));
7364 /* Don't use bindings from implicitly declared functions,
7365 as they were likely misspellings themselves. */
7366 if (TREE_TYPE (d
) == error_mark_node
)
7369 /* If we want a typename, ignore non-types. */
7370 if (kind
== FUZZY_LOOKUP_TYPENAME
7371 && TREE_CODE (STRIP_TEMPLATE (d
)) != TYPE_DECL
)
7374 consider_decl (d
, bm
, consider_implementation_names
);
7378 /* We need to iterate over the namespace hash table, in order to
7379 not mention hidden entities. But hash table iteration is
7380 (essentially) unpredictable, our correction-distance measure
7381 is very granular, and we pick the first of equal distances.
7382 Hence, we need to call the distance-measurer in a predictable
7383 order. So, iterate over the namespace hash, inserting
7384 visible names into a vector. Then sort the vector. Then
7385 determine spelling distance. */
7387 tree ns
= lvl
->this_entity
;
7390 hash_table
<named_decl_hash
>::iterator end
7391 (DECL_NAMESPACE_BINDINGS (ns
)->end ());
7392 for (hash_table
<named_decl_hash
>::iterator iter
7393 (DECL_NAMESPACE_BINDINGS (ns
)->begin ()); iter
!= end
; ++iter
)
7395 tree binding
= *iter
;
7397 if (TREE_CODE (binding
) == BINDING_VECTOR
)
7399 bitmap imports
= get_import_bitmap ();
7400 binding_cluster
*cluster
= BINDING_VECTOR_CLUSTER_BASE (binding
);
7402 if (tree bind
= cluster
->slots
[BINDING_SLOT_CURRENT
])
7403 if (maybe_add_fuzzy_binding (vec
, bind
, kind
))
7406 /* Scan the imported bindings. */
7407 unsigned ix
= BINDING_VECTOR_NUM_CLUSTERS (binding
);
7408 if (BINDING_VECTOR_SLOTS_PER_CLUSTER
== BINDING_SLOTS_FIXED
)
7414 for (; ix
--; cluster
++)
7415 for (unsigned jx
= 0; jx
!= BINDING_VECTOR_SLOTS_PER_CLUSTER
;
7418 /* Are we importing this module? */
7419 if (unsigned base
= cluster
->indices
[jx
].base
)
7420 if (unsigned span
= cluster
->indices
[jx
].span
)
7422 if (bitmap_bit_p (imports
, base
))
7424 while (++base
, --span
);
7429 if (cluster
->slots
[jx
].is_lazy ())
7430 /* Let's not read in everything on the first
7433 if (tree bind
= cluster
->slots
[jx
])
7434 if (maybe_add_fuzzy_binding (vec
, bind
, kind
))
7439 maybe_add_fuzzy_binding (vec
, binding
, kind
);
7442 vec
.qsort ([] (const void *a_
, const void *b_
)
7444 return strcmp (IDENTIFIER_POINTER (*(const tree
*)a_
),
7445 IDENTIFIER_POINTER (*(const tree
*)b_
));
7448 /* Examine longest to shortest. */
7449 for (unsigned ix
= vec
.length (); ix
--;)
7451 const char *str
= IDENTIFIER_POINTER (vec
[ix
]);
7453 /* Ignore internal names with spaces in them. */
7454 if (strchr (str
, ' '))
7457 /* Don't suggest names that are reserved for use by the
7458 implementation, unless NAME began with an underscore. */
7459 if (!consider_implementation_names
7460 && name_reserved_for_implementation_p (str
))
7468 /* Subclass of deferred_diagnostic. Notify the user that the
7469 given macro was used before it was defined.
7470 This can be done in the C++ frontend since tokenization happens
7473 class macro_use_before_def
: public deferred_diagnostic
7476 /* Factory function. Return a new macro_use_before_def instance if
7477 appropriate, or return NULL. */
7478 static macro_use_before_def
*
7479 maybe_make (location_t use_loc
, cpp_hashnode
*macro
)
7481 location_t def_loc
= cpp_macro_definition_location (macro
);
7482 if (def_loc
== UNKNOWN_LOCATION
)
7485 /* We only want to issue a note if the macro was used *before* it was
7487 We don't want to issue a note for cases where a macro was incorrectly
7488 used, leaving it unexpanded (e.g. by using the wrong argument
7490 if (!linemap_location_before_p (line_table
, use_loc
, def_loc
))
7493 return new macro_use_before_def (use_loc
, macro
);
7497 /* Ctor. LOC is the location of the usage. MACRO is the
7498 macro that was used. */
7499 macro_use_before_def (location_t loc
, cpp_hashnode
*macro
)
7500 : deferred_diagnostic (loc
), m_macro (macro
)
7505 ~macro_use_before_def ()
7507 if (is_suppressed_p ())
7510 inform (get_location (), "the macro %qs had not yet been defined",
7511 (const char *)m_macro
->ident
.str
);
7512 inform (cpp_macro_definition_location (m_macro
),
7513 "it was later defined here");
7517 cpp_hashnode
*m_macro
;
7520 /* Determine if it can ever make sense to offer RID as a suggestion for
7523 Subroutine of lookup_name_fuzzy. */
7526 suggest_rid_p (enum rid rid
)
7530 /* Support suggesting function-like keywords. */
7531 case RID_STATIC_ASSERT
:
7535 /* Support suggesting the various decl-specifier words, to handle
7536 e.g. "singed" vs "signed" typos. */
7537 if (cp_keyword_starts_decl_specifier_p (rid
))
7540 /* Otherwise, don't offer it. This avoids suggesting e.g. "if"
7541 and "do" for short misspellings, which are likely to lead to
7542 nonsensical results. */
7547 /* Search for near-matches for NAME within the current bindings, and within
7548 macro names, returning the best match as a const char *, or NULL if
7549 no reasonable match is found.
7551 Use LOC for any deferred diagnostics. */
7554 lookup_name_fuzzy (tree name
, enum lookup_name_fuzzy_kind kind
, location_t loc
)
7556 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
);
7558 /* First, try some well-known names in the C++ standard library, in case
7559 the user forgot a #include. */
7560 const char *header_hint
7561 = get_cp_stdlib_header_for_name (IDENTIFIER_POINTER (name
));
7563 return name_hint (NULL
,
7564 new suggest_missing_header (loc
,
7565 IDENTIFIER_POINTER (name
),
7568 best_match
<tree
, const char *> bm (name
);
7570 cp_binding_level
*lvl
;
7571 for (lvl
= scope_chain
->class_bindings
; lvl
; lvl
= lvl
->level_chain
)
7572 consider_binding_level (name
, bm
, lvl
, true, kind
);
7574 for (lvl
= current_binding_level
; lvl
; lvl
= lvl
->level_chain
)
7575 consider_binding_level (name
, bm
, lvl
, false, kind
);
7577 /* Consider macros: if the user misspelled a macro name e.g. "SOME_MACRO"
7579 x = SOME_OTHER_MACRO (y);
7580 then "SOME_OTHER_MACRO" will survive to the frontend and show up
7581 as a misspelled identifier.
7583 Use the best distance so far so that a candidate is only set if
7584 a macro is better than anything so far. This allows early rejection
7585 (without calculating the edit distance) of macro names that must have
7586 distance >= bm.get_best_distance (), and means that we only get a
7587 non-NULL result for best_macro_match if it's better than any of
7588 the identifiers already checked. */
7589 best_macro_match
bmm (name
, bm
.get_best_distance (), parse_in
);
7590 cpp_hashnode
*best_macro
= bmm
.get_best_meaningful_candidate ();
7591 /* If a macro is the closest so far to NAME, consider it. */
7593 bm
.consider ((const char *)best_macro
->ident
.str
);
7594 else if (bmm
.get_best_distance () == 0)
7596 /* If we have an exact match for a macro name, then either the
7597 macro was used with the wrong argument count, or the macro
7598 has been used before it was defined. */
7599 if (cpp_hashnode
*macro
= bmm
.blithely_get_best_candidate ())
7600 if (cpp_user_macro_p (macro
))
7601 return name_hint (NULL
,
7602 macro_use_before_def::maybe_make (loc
, macro
));
7605 /* Try the "starts_decl_specifier_p" keywords to detect
7606 "singed" vs "signed" typos. */
7607 for (unsigned i
= 0; i
< num_c_common_reswords
; i
++)
7609 const c_common_resword
*resword
= &c_common_reswords
[i
];
7611 if (!suggest_rid_p (resword
->rid
))
7614 tree resword_identifier
= ridpointers
[resword
->rid
];
7615 if (!resword_identifier
)
7617 gcc_assert (TREE_CODE (resword_identifier
) == IDENTIFIER_NODE
);
7619 /* Only consider reserved words that survived the
7620 filtering in init_reswords (e.g. for -std). */
7621 if (!IDENTIFIER_KEYWORD_P (resword_identifier
))
7624 bm
.consider (IDENTIFIER_POINTER (resword_identifier
));
7627 return name_hint (bm
.get_best_meaningful_candidate (), NULL
);
7630 /* Subroutine of outer_binding.
7632 Returns TRUE if BINDING is a binding to a template parameter of
7633 SCOPE. In that case SCOPE is the scope of a primary template
7634 parameter -- in the sense of G++, i.e, a template that has its own
7637 Returns FALSE otherwise. */
7640 binding_to_template_parms_of_scope_p (cxx_binding
*binding
,
7641 cp_binding_level
*scope
)
7643 tree binding_value
, tmpl
, tinfo
;
7646 if (!binding
|| !scope
|| !scope
->this_entity
)
7649 binding_value
= binding
->value
? binding
->value
: binding
->type
;
7650 tinfo
= get_template_info (scope
->this_entity
);
7652 /* BINDING_VALUE must be a template parm. */
7653 if (binding_value
== NULL_TREE
7654 || (!DECL_P (binding_value
)
7655 || !DECL_TEMPLATE_PARM_P (binding_value
)))
7658 /* The level of BINDING_VALUE. */
7660 template_type_parameter_p (binding_value
)
7661 ? TEMPLATE_PARM_LEVEL (TEMPLATE_TYPE_PARM_INDEX
7662 (TREE_TYPE (binding_value
)))
7663 : TEMPLATE_PARM_LEVEL (DECL_INITIAL (binding_value
));
7665 /* The template of the current scope, iff said scope is a primary
7668 && PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
7669 ? TI_TEMPLATE (tinfo
)
7672 /* If the level of the parm BINDING_VALUE equals the depth of TMPL,
7673 then BINDING_VALUE is a parameter of TMPL. */
7674 return (tmpl
&& level
== TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)));
7677 /* Return the innermost non-namespace binding for NAME from a scope
7678 containing BINDING, or, if BINDING is NULL, the current scope.
7679 Please note that for a given template, the template parameters are
7680 considered to be in the scope containing the current scope.
7681 If CLASS_P is false, then class bindings are ignored. */
7684 outer_binding (tree name
,
7685 cxx_binding
*binding
,
7689 cp_binding_level
*scope
;
7690 cp_binding_level
*outer_scope
;
7694 scope
= binding
->scope
->level_chain
;
7695 outer
= binding
->previous
;
7699 scope
= current_binding_level
;
7700 outer
= IDENTIFIER_BINDING (name
);
7702 outer_scope
= outer
? outer
->scope
: NULL
;
7704 /* Because we create class bindings lazily, we might be missing a
7705 class binding for NAME. If there are any class binding levels
7706 between the LAST_BINDING_LEVEL and the scope in which OUTER was
7707 declared, we must lookup NAME in those class scopes. */
7709 while (scope
&& scope
!= outer_scope
&& scope
->kind
!= sk_namespace
)
7711 if (scope
->kind
== sk_class
)
7713 cxx_binding
*class_binding
;
7715 class_binding
= get_class_binding (name
, scope
);
7718 /* Thread this new class-scope binding onto the
7719 IDENTIFIER_BINDING list so that future lookups
7721 if (BASELINK_P (class_binding
->value
))
7722 /* Don't put a BASELINK in IDENTIFIER_BINDING. */
7723 class_binding
->value
7724 = BASELINK_FUNCTIONS (class_binding
->value
);
7725 class_binding
->previous
= outer
;
7727 binding
->previous
= class_binding
;
7729 IDENTIFIER_BINDING (name
) = class_binding
;
7730 return class_binding
;
7733 /* If we are in a member template, the template parms of the member
7734 template are considered to be inside the scope of the containing
7735 class, but within G++ the class bindings are all pushed between the
7736 template parms and the function body. So if the outer binding is
7737 a template parm for the current scope, return it now rather than
7738 look for a class binding. */
7739 if (outer_scope
&& outer_scope
->kind
== sk_template_parms
7740 && binding_to_template_parms_of_scope_p (outer
, scope
))
7743 scope
= scope
->level_chain
;
7749 /* Return the innermost block-scope or class-scope value binding for
7750 NAME, or NULL_TREE if there is no such binding. */
7753 innermost_non_namespace_value (tree name
)
7755 cxx_binding
*binding
;
7756 binding
= outer_binding (name
, /*binding=*/NULL
, /*class_p=*/true);
7757 return binding
? binding
->value
: NULL_TREE
;
7760 /* True iff current_binding_level is within the potential scope of local
7764 decl_in_scope_p (tree decl
)
7766 gcc_checking_assert (DECL_FUNCTION_SCOPE_P (decl
));
7768 tree name
= DECL_NAME (decl
);
7770 for (cxx_binding
*iter
= NULL
;
7771 (iter
= outer_binding (name
, iter
, /*class_p=*/false)); )
7773 if (!LOCAL_BINDING_P (iter
))
7775 if (iter
->value
== decl
)
7782 /* Look up NAME in the current binding level and its superiors in the
7783 namespace of variables, functions and typedefs. Return a ..._DECL
7784 node of some kind representing its definition if there is only one
7785 such declaration, or return a TREE_LIST with all the overloaded
7786 definitions if there are many, or return NULL_TREE if it is undefined.
7787 Hidden name, either friend declaration or built-in function, are
7790 WHERE controls which scopes are considered. It is a bit mask of
7791 LOOK_where::BLOCK (look in block scope), LOOK_where::CLASS
7792 (look in class scopes) & LOOK_where::NAMESPACE (look in namespace
7793 scopes). It is an error for no bits to be set. These scopes are
7794 searched from innermost to outermost.
7796 WANT controls what kind of entity we'd happy with.
7797 LOOK_want::NORMAL for normal lookup (implicit typedefs can be
7798 hidden). LOOK_want::TYPE for only TYPE_DECLS, LOOK_want::NAMESPACE
7799 for only NAMESPACE_DECLS. These two can be bit-ored to find
7802 WANT can also have LOOK_want::HIDDEN_FRIEND or
7803 LOOK_want::HIDDEN_LAMBDa added to it. */
7806 lookup_name (tree name
, LOOK_where where
, LOOK_want want
)
7808 tree val
= NULL_TREE
;
7810 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
7812 gcc_checking_assert (unsigned (where
) != 0);
7813 /* If we're looking for hidden lambda things, we shouldn't be
7814 looking in namespace scope. */
7815 gcc_checking_assert (!bool (want
& LOOK_want::HIDDEN_LAMBDA
)
7816 || !bool (where
& LOOK_where::NAMESPACE
));
7817 query_oracle (name
);
7819 /* Conversion operators are handled specially because ordinary
7820 unqualified name lookup will not find template conversion
7822 if (IDENTIFIER_CONV_OP_P (name
))
7824 cp_binding_level
*level
;
7826 for (level
= current_binding_level
;
7827 level
&& level
->kind
!= sk_namespace
;
7828 level
= level
->level_chain
)
7833 /* A conversion operator can only be declared in a class
7835 if (level
->kind
!= sk_class
)
7838 /* Lookup the conversion operator in the class. */
7839 class_type
= level
->this_entity
;
7840 operators
= lookup_fnfields (class_type
, name
, /*protect=*/0,
7841 tf_warning_or_error
);
7849 /* First, look in non-namespace scopes. */
7851 if (current_class_type
== NULL_TREE
)
7852 /* Maybe avoid searching the binding stack at all. */
7853 where
= LOOK_where (unsigned (where
) & ~unsigned (LOOK_where::CLASS
));
7855 if (bool (where
& (LOOK_where::BLOCK
| LOOK_where::CLASS
)))
7856 for (cxx_binding
*iter
= nullptr;
7857 (iter
= outer_binding (name
, iter
, bool (where
& LOOK_where::CLASS
)));)
7859 /* Skip entities we don't want. */
7860 if (!bool (where
& (LOCAL_BINDING_P (iter
)
7861 ? LOOK_where::BLOCK
: LOOK_where::CLASS
)))
7864 /* If this is the kind of thing we're looking for, we're done. */
7867 tree binding
= NULL_TREE
;
7869 if (!(!iter
->type
&& HIDDEN_TYPE_BINDING_P (iter
))
7870 && (bool (want
& LOOK_want::HIDDEN_LAMBDA
)
7871 || !is_lambda_ignored_entity (iter
->value
))
7872 && qualify_lookup (iter
->value
, want
))
7873 binding
= iter
->value
;
7874 else if (bool (want
& LOOK_want::TYPE
)
7875 && !HIDDEN_TYPE_BINDING_P (iter
)
7877 binding
= iter
->type
;
7887 /* Now lookup in namespace scopes. */
7888 if (!val
&& bool (where
& LOOK_where::NAMESPACE
))
7890 name_lookup
lookup (name
, want
);
7891 if (lookup
.search_unqualified
7892 (current_decl_namespace (), current_binding_level
))
7896 /* If we have a known type overload, pull it out. This can happen
7897 for both using decls and unhidden functions. */
7898 if (val
&& TREE_CODE (val
) == OVERLOAD
&& TREE_TYPE (val
) != unknown_type_node
)
7899 val
= OVL_FUNCTION (val
);
7905 lookup_name (tree name
)
7907 return lookup_name (name
, LOOK_where::ALL
, LOOK_want::NORMAL
);
7910 /* Look up NAME for type used in elaborated name specifier in
7911 the scopes given by HOW.
7913 Unlike lookup_name_1, we make sure that NAME is actually
7914 declared in the desired scope, not from inheritance, nor using
7915 directive. For using declaration, there is DR138 still waiting
7916 to be resolved. Hidden name coming from an earlier friend
7917 declaration is also returned, and will be made visible unless HOW
7918 is TAG_how::HIDDEN_FRIEND.
7920 A TYPE_DECL best matching the NAME is returned. Catching error
7921 and issuing diagnostics are caller's responsibility. */
7924 lookup_elaborated_type (tree name
, TAG_how how
)
7926 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
7928 cp_binding_level
*b
= current_binding_level
;
7930 if (b
->kind
!= sk_namespace
)
7931 /* Look in non-namespace scopes. */
7932 for (cxx_binding
*iter
= NULL
;
7933 (iter
= outer_binding (name
, iter
, /*class_p=*/ true)); )
7935 /* First check we're supposed to be looking in this scope --
7936 if we're not, we're done. */
7937 for (; b
!= iter
->scope
; b
= b
->level_chain
)
7938 if (!(b
->kind
== sk_cleanup
7939 || b
->kind
== sk_template_parms
7940 || b
->kind
== sk_function_parms
7941 || (b
->kind
== sk_class
&& how
!= TAG_how::CURRENT_ONLY
)))
7944 /* Check if this is the kind of thing we're looking for. If
7945 HOW is TAG_how::CURRENT_ONLY, also make sure it doesn't
7946 come from base class. For ITER->VALUE, we can simply use
7947 INHERITED_VALUE_BINDING_P. For ITER->TYPE, we have to use
7950 We check ITER->TYPE before ITER->VALUE in order to handle
7951 typedef struct C {} C;
7954 if (tree type
= iter
->type
)
7956 if (qualify_lookup (type
, LOOK_want::TYPE
)
7957 && (how
!= TAG_how::CURRENT_ONLY
7958 || LOCAL_BINDING_P (iter
)
7959 || DECL_CONTEXT (type
) == iter
->scope
->this_entity
))
7961 if (how
!= TAG_how::HIDDEN_FRIEND
)
7962 /* It is no longer a hidden binding. */
7963 HIDDEN_TYPE_BINDING_P (iter
) = false;
7970 if (qualify_lookup (iter
->value
, LOOK_want::TYPE
)
7971 && (how
!= TAG_how::CURRENT_ONLY
7972 || !INHERITED_VALUE_BINDING_P (iter
)))
7974 if (how
!= TAG_how::HIDDEN_FRIEND
&& !iter
->type
)
7975 /* It is no longer a hidden binding. */
7976 HIDDEN_TYPE_BINDING_P (iter
) = false;
7983 /* Now check if we can look in namespace scope. */
7984 for (; b
->kind
!= sk_namespace
; b
= b
->level_chain
)
7985 if (!(b
->kind
== sk_cleanup
7986 || b
->kind
== sk_template_parms
7987 || b
->kind
== sk_function_parms
7988 || (b
->kind
== sk_class
&& how
!= TAG_how::CURRENT_ONLY
)))
7991 /* Look in the innermost namespace. */
7992 tree ns
= b
->this_entity
;
7993 if (tree
*slot
= find_namespace_slot (ns
, name
))
7996 if (TREE_CODE (bind
) == BINDING_VECTOR
)
7997 bind
= BINDING_VECTOR_CLUSTER (bind
, 0).slots
[BINDING_SLOT_CURRENT
];
8001 /* If this is the kind of thing we're looking for, we're done. */
8002 if (tree type
= MAYBE_STAT_TYPE (bind
))
8004 if (how
!= TAG_how::HIDDEN_FRIEND
)
8005 /* No longer hidden. */
8006 STAT_TYPE_HIDDEN_P (*slot
) = false;
8010 else if (tree decl
= MAYBE_STAT_DECL (bind
))
8012 if (qualify_lookup (decl
, LOOK_want::TYPE
))
8014 if (how
!= TAG_how::HIDDEN_FRIEND
&& STAT_HACK_P (bind
)
8015 && STAT_DECL_HIDDEN_P (bind
))
8017 if (STAT_TYPE (bind
))
8018 STAT_DECL_HIDDEN_P (bind
) = false;
8021 /* There is no type, just remove the stat
8026 BINDING_VECTOR_CLUSTER (*slot
, 0)
8027 .slots
[BINDING_SLOT_CURRENT
] = decl
;
8035 if (TREE_CODE (*slot
) == BINDING_VECTOR
)
8037 /* We could be redeclaring a global module entity, (from GMF
8038 or header unit), or from another partition, or
8039 specializing an imported template. */
8040 bitmap imports
= get_import_bitmap ();
8041 binding_cluster
*cluster
= BINDING_VECTOR_CLUSTER_BASE (*slot
);
8043 /* Scan the imported bindings. */
8044 unsigned ix
= BINDING_VECTOR_NUM_CLUSTERS (*slot
);
8045 if (BINDING_VECTOR_SLOTS_PER_CLUSTER
== BINDING_SLOTS_FIXED
)
8051 /* Do this in forward order, so we load modules in an order
8052 the user expects. */
8053 for (; ix
--; cluster
++)
8054 for (unsigned jx
= 0; jx
!= BINDING_VECTOR_SLOTS_PER_CLUSTER
; jx
++)
8056 /* Are we importing this module? */
8057 if (unsigned base
= cluster
->indices
[jx
].base
)
8058 if (unsigned span
= cluster
->indices
[jx
].span
)
8060 if (bitmap_bit_p (imports
, base
))
8062 while (++base
, --span
);
8067 if (cluster
->slots
[jx
].is_lazy ())
8069 gcc_assert (cluster
->indices
[jx
].span
== 1);
8070 lazy_load_binding (cluster
->indices
[jx
].base
,
8071 ns
, name
, &cluster
->slots
[jx
]);
8073 tree bind
= cluster
->slots
[jx
];
8075 /* Load errors could mean there's nothing here. */
8078 /* Extract what we can see from here. If there's no
8079 stat_hack, then everything was exported. */
8080 tree type
= NULL_TREE
;
8082 /* If no stat hack, everything is visible. */
8083 if (STAT_HACK_P (bind
))
8085 if (STAT_TYPE_VISIBLE_P (bind
))
8086 type
= STAT_TYPE (bind
);
8087 bind
= STAT_VISIBLE (bind
);
8090 if (type
&& qualify_lookup (type
, LOOK_want::TYPE
))
8093 if (bind
&& qualify_lookup (bind
, LOOK_want::TYPE
))
8097 if (!module_purview_p ())
8099 /* We're in the global module, perhaps there's a tag
8102 /* FIXME: In general we should probably merge global module
8103 classes in check_module_override rather than here, but for
8104 GCC14 let's just fix lazy declarations of __class_type_info in
8105 build_dynamic_cast_1. */
8106 if (current_namespace
== abi_node
)
8108 tree g
= (BINDING_VECTOR_CLUSTER (*slot
, 0)
8109 .slots
[BINDING_SLOT_GLOBAL
]);
8110 for (ovl_iterator
iter (g
); iter
; ++iter
)
8111 if (qualify_lookup (*iter
, LOOK_want::TYPE
))
8121 /* The type TYPE is being declared. If it is a class template, or a
8122 specialization of a class template, do any processing required and
8123 perform error-checking. If IS_FRIEND is nonzero, this TYPE is
8124 being declared a friend. B is the binding level at which this TYPE
8127 Returns the TYPE_DECL for TYPE, which may have been altered by this
8131 maybe_process_template_type_declaration (tree type
, int is_friend
,
8132 cp_binding_level
*b
)
8134 tree decl
= TYPE_NAME (type
);
8136 if (processing_template_parmlist
)
8137 /* You can't declare a new template type in a template parameter
8138 list. But, you can declare a non-template type:
8140 template <class A*> struct S;
8142 is a forward-declaration of `A'. */
8144 else if (b
->kind
== sk_namespace
8145 && current_binding_level
->kind
!= sk_namespace
)
8146 /* If this new type is being injected into a containing scope,
8147 then it's not a template type. */
8151 gcc_assert (MAYBE_CLASS_TYPE_P (type
)
8152 || TREE_CODE (type
) == ENUMERAL_TYPE
);
8154 if (processing_template_decl
)
8156 decl
= push_template_decl (decl
, is_friend
);
8157 if (decl
== error_mark_node
)
8158 return error_mark_node
;
8160 /* If the current binding level is the binding level for the
8161 template parameters (see the comment in
8162 begin_template_parm_list) and the enclosing level is a class
8163 scope, and we're not looking at a friend, push the
8164 declaration of the member class into the class scope. In the
8165 friend case, push_template_decl will already have put the
8166 friend into global scope, if appropriate. */
8167 if (TREE_CODE (type
) != ENUMERAL_TYPE
8168 && !is_friend
&& b
->kind
== sk_template_parms
8169 && b
->level_chain
->kind
== sk_class
)
8171 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
8173 if (!COMPLETE_TYPE_P (current_class_type
))
8174 maybe_add_class_template_decl_list (current_class_type
,
8175 type
, /*friend_p=*/0);
8183 /* Push a tag name NAME for struct/class/union/enum type TYPE. In case
8184 that the NAME is a class template, the tag is processed but not pushed.
8186 The pushed scope depend on the SCOPE parameter:
8187 - When SCOPE is TS_CURRENT, put it into the inner-most non-sk_cleanup
8189 - When SCOPE is TS_GLOBAL, put it in the inner-most non-class and
8190 non-template-parameter scope. This case is needed for forward
8192 - When SCOPE is TS_WITHIN_ENCLOSING_NON_CLASS, this is similar to
8193 TS_GLOBAL case except that names within template-parameter scopes
8194 are not pushed at all.
8196 Returns TYPE upon success and ERROR_MARK_NODE otherwise. */
8199 pushtag (tree name
, tree type
, TAG_how how
)
8203 gcc_assert (identifier_p (name
));
8205 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
8207 cp_binding_level
*b
= current_binding_level
;
8210 if (/* Cleanup scopes are not scopes from the point of view of
8212 b
->kind
== sk_cleanup
8213 /* Neither are function parameter scopes. */
8214 || b
->kind
== sk_function_parms
8215 /* Neither are the scopes used to hold template parameters
8216 for an explicit specialization. For an ordinary template
8217 declaration, these scopes are not scopes from the point of
8218 view of the language. */
8219 || (b
->kind
== sk_template_parms
8220 && (b
->explicit_spec_p
|| how
== TAG_how::GLOBAL
)))
8222 else if (b
->kind
== sk_class
&& how
!= TAG_how::CURRENT_ONLY
)
8225 if (b
->kind
== sk_template_parms
)
8232 /* Do C++ gratuitous typedefing. */
8233 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != type
)
8236 tree context
= TYPE_CONTEXT (type
);
8240 cp_binding_level
*cb
= b
;
8241 while (cb
->kind
!= sk_namespace
8242 && cb
->kind
!= sk_class
8243 && (cb
->kind
!= sk_function_parms
8244 || !cb
->this_entity
))
8245 cb
= cb
->level_chain
;
8246 tree cs
= cb
->this_entity
;
8248 gcc_checking_assert (TREE_CODE (cs
) == FUNCTION_DECL
8249 ? cs
== current_function_decl
8250 : TYPE_P (cs
) ? cs
== current_class_type
8251 : cs
== current_namespace
);
8253 if (how
== TAG_how::CURRENT_ONLY
8254 || (cs
&& TREE_CODE (cs
) == FUNCTION_DECL
))
8256 else if (cs
&& TYPE_P (cs
))
8257 /* When declaring a friend class of a local class, we want
8258 to inject the newly named class into the scope
8259 containing the local class, not the namespace
8261 context
= decl_function_context (get_type_decl (cs
));
8264 context
= current_namespace
;
8266 tdef
= create_implicit_typedef (name
, type
);
8267 DECL_CONTEXT (tdef
) = FROB_CONTEXT (context
);
8268 set_originating_module (tdef
);
8270 decl
= maybe_process_template_type_declaration
8271 (type
, how
== TAG_how::HIDDEN_FRIEND
, b
);
8272 if (decl
== error_mark_node
)
8275 if (b
->kind
== sk_class
)
8277 if (!TYPE_BEING_DEFINED (current_class_type
))
8278 /* Don't push anywhere if the class is complete; a lambda in an
8279 NSDMI is not a member of the class. */
8281 else if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
8282 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
8283 class. But if it's a member template class, we want
8284 the TEMPLATE_DECL, not the TYPE_DECL, so this is done
8286 finish_member_declaration (decl
);
8288 pushdecl_class_level (decl
);
8290 else if (b
->kind
== sk_template_parms
)
8292 /* Do not push the tag here -- we'll want to push the
8294 if (b
->level_chain
->kind
!= sk_class
)
8295 set_identifier_type_value_with_scope (name
, tdef
, b
->level_chain
);
8299 decl
= do_pushdecl_with_scope
8300 (decl
, b
, /*hiding=*/(how
== TAG_how::HIDDEN_FRIEND
));
8301 if (decl
== error_mark_node
)
8304 if (DECL_CONTEXT (decl
) == std_node
8305 && init_list_identifier
== DECL_NAME (TYPE_NAME (type
))
8306 && !CLASSTYPE_TEMPLATE_INFO (type
))
8308 error ("declaration of %<std::initializer_list%> does not match "
8309 "%<#include <initializer_list>%>, isn%'t a template");
8310 return error_mark_node
;
8314 TYPE_CONTEXT (type
) = DECL_CONTEXT (decl
);
8316 /* If this is a local class, keep track of it. We need this
8317 information for name-mangling, and so that it is possible to
8318 find all function definitions in a translation unit in a
8319 convenient way. (It's otherwise tricky to find a member
8320 function definition it's only pointed to from within a local
8322 if (TYPE_FUNCTION_SCOPE_P (type
))
8324 if (processing_template_decl
)
8326 /* Push a DECL_EXPR so we call pushtag at the right time in
8327 template instantiation rather than in some nested context. */
8328 add_decl_expr (decl
);
8330 /* Lambdas use LAMBDA_EXPR_DISCRIMINATOR instead. */
8331 else if (!LAMBDA_TYPE_P (type
))
8332 determine_local_discriminator (TYPE_NAME (type
));
8336 if (b
->kind
== sk_class
8337 && !COMPLETE_TYPE_P (current_class_type
))
8338 maybe_add_class_template_decl_list (current_class_type
,
8339 type
, /*friend_p=*/0);
8341 decl
= TYPE_NAME (type
);
8342 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
8344 /* Set type visibility now if this is a forward declaration. */
8345 TREE_PUBLIC (decl
) = 1;
8346 determine_visibility (decl
);
8351 /* Subroutines for reverting temporarily to top-level for instantiation
8352 of templates and such. We actually need to clear out the class- and
8353 local-value slots of all identifiers, so that only the global values
8354 are at all visible. Simply setting current_binding_level to the global
8355 scope isn't enough, because more binding levels may be pushed. */
8356 struct saved_scope
*scope_chain
;
8358 /* Return true if ID has not already been marked. */
8361 store_binding_p (tree id
)
8363 if (!id
|| !IDENTIFIER_BINDING (id
))
8366 if (IDENTIFIER_MARKED (id
))
8372 /* Add an appropriate binding to *OLD_BINDINGS which needs to already
8373 have enough space reserved. */
8376 store_binding (tree id
, vec
<cxx_saved_binding
, va_gc
> **old_bindings
)
8378 cxx_saved_binding saved
;
8380 gcc_checking_assert (store_binding_p (id
));
8382 IDENTIFIER_MARKED (id
) = 1;
8384 saved
.identifier
= id
;
8385 saved
.binding
= IDENTIFIER_BINDING (id
);
8386 saved
.real_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
8387 (*old_bindings
)->quick_push (saved
);
8388 IDENTIFIER_BINDING (id
) = NULL
;
8392 store_bindings (tree names
, vec
<cxx_saved_binding
, va_gc
> **old_bindings
)
8394 static vec
<tree
> bindings_need_stored
;
8398 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
8399 for (t
= names
; t
; t
= TREE_CHAIN (t
))
8401 if (TREE_CODE (t
) == TREE_LIST
)
8402 id
= TREE_PURPOSE (t
);
8406 if (store_binding_p (id
))
8407 bindings_need_stored
.safe_push (id
);
8409 if (!bindings_need_stored
.is_empty ())
8411 vec_safe_reserve_exact (*old_bindings
, bindings_need_stored
.length ());
8412 for (i
= 0; bindings_need_stored
.iterate (i
, &id
); ++i
)
8414 /* We can apparently have duplicates in NAMES. */
8415 if (store_binding_p (id
))
8416 store_binding (id
, old_bindings
);
8418 bindings_need_stored
.truncate (0);
8422 /* Like store_bindings, but NAMES is a vector of cp_class_binding
8423 objects, rather than a TREE_LIST. */
8426 store_class_bindings (vec
<cp_class_binding
, va_gc
> *names
,
8427 vec
<cxx_saved_binding
, va_gc
> **old_bindings
)
8429 static vec
<tree
> bindings_need_stored
;
8431 cp_class_binding
*cb
;
8433 for (i
= 0; vec_safe_iterate (names
, i
, &cb
); ++i
)
8434 if (store_binding_p (cb
->identifier
))
8435 bindings_need_stored
.safe_push (cb
->identifier
);
8436 if (!bindings_need_stored
.is_empty ())
8439 vec_safe_reserve_exact (*old_bindings
, bindings_need_stored
.length ());
8440 for (i
= 0; bindings_need_stored
.iterate (i
, &id
); ++i
)
8441 store_binding (id
, old_bindings
);
8442 bindings_need_stored
.truncate (0);
8446 /* A chain of saved_scope structures awaiting reuse. */
8448 static GTY((deletable
)) struct saved_scope
*free_saved_scope
;
8451 push_to_top_level (void)
8453 struct saved_scope
*s
;
8454 cp_binding_level
*b
;
8455 cxx_saved_binding
*sb
;
8459 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
8461 /* Reuse or create a new structure for this saved scope. */
8462 if (free_saved_scope
!= NULL
)
8464 s
= free_saved_scope
;
8465 free_saved_scope
= s
->prev
;
8467 vec
<cxx_saved_binding
, va_gc
> *old_bindings
= s
->old_bindings
;
8468 memset (s
, 0, sizeof (*s
));
8469 /* Also reuse the structure's old_bindings vector. */
8470 vec_safe_truncate (old_bindings
, 0);
8471 s
->old_bindings
= old_bindings
;
8474 s
= ggc_cleared_alloc
<saved_scope
> ();
8476 b
= scope_chain
? current_binding_level
: 0;
8478 /* If we're in the middle of some function, save our state. */
8482 push_function_context ();
8487 if (scope_chain
&& previous_class_level
)
8488 store_class_bindings (previous_class_level
->class_shadowed
,
8491 /* Have to include the global scope, because class-scope decls
8492 aren't listed anywhere useful. */
8493 for (; b
; b
= b
->level_chain
)
8497 /* Template IDs are inserted into the global level. If they were
8498 inserted into namespace level, finish_file wouldn't find them
8499 when doing pending instantiations. Therefore, don't stop at
8500 namespace level, but continue until :: . */
8501 if (global_scope_p (b
))
8504 store_bindings (b
->names
, &s
->old_bindings
);
8505 /* We also need to check class_shadowed to save class-level type
8506 bindings, since pushclass doesn't fill in b->names. */
8507 if (b
->kind
== sk_class
)
8508 store_class_bindings (b
->class_shadowed
, &s
->old_bindings
);
8510 /* Unwind type-value slots back to top level. */
8511 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
8512 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
8515 FOR_EACH_VEC_SAFE_ELT (s
->old_bindings
, i
, sb
)
8516 IDENTIFIER_MARKED (sb
->identifier
) = 0;
8518 s
->prev
= scope_chain
;
8520 s
->need_pop_function_context
= need_pop
;
8521 s
->function_decl
= current_function_decl
;
8522 s
->unevaluated_operand
= cp_unevaluated_operand
;
8523 s
->inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
8524 s
->suppress_location_wrappers
= suppress_location_wrappers
;
8525 s
->x_stmt_tree
.stmts_are_full_exprs_p
= true;
8528 current_function_decl
= NULL_TREE
;
8529 current_lang_base
= NULL
;
8530 current_lang_name
= lang_name_cplusplus
;
8531 current_namespace
= global_namespace
;
8532 push_class_stack ();
8533 cp_unevaluated_operand
= 0;
8534 c_inhibit_evaluation_warnings
= 0;
8535 suppress_location_wrappers
= 0;
8539 pop_from_top_level (void)
8541 struct saved_scope
*s
= scope_chain
;
8542 cxx_saved_binding
*saved
;
8545 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
8549 release_tree_vector (current_lang_base
);
8551 scope_chain
= s
->prev
;
8552 FOR_EACH_VEC_SAFE_ELT (s
->old_bindings
, i
, saved
)
8554 tree id
= saved
->identifier
;
8556 IDENTIFIER_BINDING (id
) = saved
->binding
;
8557 SET_IDENTIFIER_TYPE_VALUE (id
, saved
->real_type_value
);
8560 /* If we were in the middle of compiling a function, restore our
8562 if (s
->need_pop_function_context
)
8563 pop_function_context ();
8564 current_function_decl
= s
->function_decl
;
8565 cp_unevaluated_operand
= s
->unevaluated_operand
;
8566 c_inhibit_evaluation_warnings
= s
->inhibit_evaluation_warnings
;
8567 suppress_location_wrappers
= s
->suppress_location_wrappers
;
8569 /* Make this saved_scope structure available for reuse by
8570 push_to_top_level. */
8571 s
->prev
= free_saved_scope
;
8572 free_saved_scope
= s
;
8577 /* Helper class for saving/restoring relevant global flags for the
8578 function-local case of maybe_push_to_top_level. */
8580 struct local_state_t
8582 int cp_unevaluated_operand
;
8583 int c_inhibit_evaluation_warnings
;
8585 static local_state_t
8589 s
.cp_unevaluated_operand
= ::cp_unevaluated_operand
;
8590 ::cp_unevaluated_operand
= 0;
8591 s
.c_inhibit_evaluation_warnings
= ::c_inhibit_evaluation_warnings
;
8592 ::c_inhibit_evaluation_warnings
= 0;
8599 ::cp_unevaluated_operand
= this->cp_unevaluated_operand
;
8600 ::c_inhibit_evaluation_warnings
= this->c_inhibit_evaluation_warnings
;
8604 vec
<local_state_t
> local_state_stack
;
8608 /* Like push_to_top_level, but not if D is function-local. Returns whether we
8612 maybe_push_to_top_level (tree d
)
8614 /* Push if D isn't function-local, or is a lambda function, for which name
8615 resolution is already done. */
8617 = !(current_function_decl
8618 && !LAMBDA_FUNCTION_P (d
)
8619 && decl_function_context (d
) == current_function_decl
);
8622 push_to_top_level ();
8625 gcc_assert (!processing_template_decl
);
8626 push_function_context ();
8627 local_state_stack
.safe_push (local_state_t::save_and_clear ());
8633 /* Return from whatever maybe_push_to_top_level did. */
8636 maybe_pop_from_top_level (bool push_to_top
)
8639 pop_from_top_level ();
8642 local_state_stack
.pop ().restore ();
8643 pop_function_context ();
8647 /* Push into the scope of the namespace NS, even if it is deeply
8648 nested within another namespace. */
8651 push_nested_namespace (tree ns
)
8653 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
8654 if (ns
== global_namespace
)
8655 push_to_top_level ();
8658 push_nested_namespace (CP_DECL_CONTEXT (ns
));
8659 resume_scope (NAMESPACE_LEVEL (ns
));
8660 current_namespace
= ns
;
8664 /* Pop back from the scope of the namespace NS, which was previously
8665 entered with push_nested_namespace. */
8668 pop_nested_namespace (tree ns
)
8670 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
8671 while (ns
!= global_namespace
)
8673 ns
= CP_DECL_CONTEXT (ns
);
8674 current_namespace
= ns
;
8678 pop_from_top_level ();
8681 /* Add TARGET to USINGS, if it does not already exist there. We used
8682 to build the complete graph of usings at this point, from the POV
8683 of the source namespaces. Now we build that as we perform the
8684 unqualified search. */
8687 add_using_namespace (vec
<tree
, va_gc
> *&usings
, tree target
)
8690 for (unsigned ix
= usings
->length (); ix
--;)
8691 if ((*usings
)[ix
] == target
)
8694 vec_safe_push (usings
, target
);
8697 /* Tell the debug system of a using directive. */
8700 emit_debug_info_using_namespace (tree from
, tree target
, bool implicit
)
8702 /* Emit debugging info. */
8703 tree context
= from
!= global_namespace
? from
: NULL_TREE
;
8704 debug_hooks
->imported_module_or_decl (target
, NULL_TREE
, context
, false,
8708 /* Process a using directive. */
8711 finish_using_directive (tree target
, tree attribs
)
8713 if (target
== error_mark_node
)
8716 if (current_binding_level
->kind
!= sk_namespace
)
8717 add_stmt (build_stmt (input_location
, USING_STMT
, target
));
8719 emit_debug_info_using_namespace (current_binding_level
->this_entity
,
8720 ORIGINAL_NAMESPACE (target
), false);
8722 add_using_namespace (current_binding_level
->using_directives
,
8723 ORIGINAL_NAMESPACE (target
));
8725 bool diagnosed
= false;
8726 if (attribs
!= error_mark_node
)
8727 for (tree a
= attribs
; a
; a
= TREE_CHAIN (a
))
8729 tree name
= get_attribute_name (a
);
8730 if (current_binding_level
->kind
== sk_namespace
8731 && is_attribute_p ("strong", name
))
8733 if (warning (0, "%<strong%> using directive no longer supported")
8734 && CP_DECL_CONTEXT (target
) == current_namespace
)
8735 inform (DECL_SOURCE_LOCATION (target
),
8736 "you can use an inline namespace instead");
8738 else if ((flag_openmp
|| flag_openmp_simd
)
8739 && get_attribute_namespace (a
) == omp_identifier
8740 && (is_attribute_p ("directive", name
)
8741 || is_attribute_p ("sequence", name
)
8742 || is_attribute_p ("decl", name
)))
8746 if (tree ar
= TREE_VALUE (a
))
8748 tree d
= TREE_VALUE (ar
);
8749 gcc_assert (TREE_CODE (d
) == DEFERRED_PARSE
);
8750 error ("%<omp::%s%> not allowed to be specified in "
8752 TREE_PUBLIC (d
) ? "decl" : "directive");
8755 error ("%<omp::%E%> not allowed to be specified in this "
8760 else if (!attribute_ignored_p (a
))
8761 warning (OPT_Wattributes
, "%qD attribute directive ignored", name
);
8765 /* Pushes X into the global namespace. */
8768 pushdecl_top_level (tree x
)
8770 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
8771 push_to_top_level ();
8772 gcc_checking_assert (!DECL_CONTEXT (x
));
8773 DECL_CONTEXT (x
) = FROB_CONTEXT (global_namespace
);
8774 x
= pushdecl_namespace_level (x
);
8775 pop_from_top_level ();
8779 /* Pushes X into the global namespace and calls cp_finish_decl to
8780 register the variable, initializing it with INIT. */
8783 pushdecl_top_level_and_finish (tree x
, tree init
)
8785 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
8786 push_to_top_level ();
8787 gcc_checking_assert (!DECL_CONTEXT (x
));
8788 DECL_CONTEXT (x
) = FROB_CONTEXT (global_namespace
);
8789 x
= pushdecl_namespace_level (x
);
8790 cp_finish_decl (x
, init
, false, NULL_TREE
, 0);
8791 pop_from_top_level ();
8795 /* Enter the namespaces from current_namerspace to NS. */
8798 push_inline_namespaces (tree ns
)
8801 if (ns
!= current_namespace
)
8803 gcc_assert (ns
!= global_namespace
);
8804 count
+= push_inline_namespaces (CP_DECL_CONTEXT (ns
));
8805 resume_scope (NAMESPACE_LEVEL (ns
));
8806 current_namespace
= ns
;
8812 /* SLOT is the (possibly empty) binding slot for NAME in CTX.
8813 Reuse or create a namespace NAME. NAME is null for the anonymous
8817 reuse_namespace (tree
*slot
, tree ctx
, tree name
)
8819 if (modules_p () && *slot
&& TREE_PUBLIC (ctx
) && name
)
8821 /* Public namespace. Shared. */
8822 tree
*global_slot
= slot
;
8823 if (TREE_CODE (*slot
) == BINDING_VECTOR
)
8824 global_slot
= get_fixed_binding_slot (slot
, name
,
8825 BINDING_SLOT_GLOBAL
, false);
8827 for (ovl_iterator
iter (*global_slot
); iter
; ++iter
)
8831 if (TREE_CODE (decl
) == NAMESPACE_DECL
&& !DECL_NAMESPACE_ALIAS (decl
))
8839 make_namespace (tree ctx
, tree name
, location_t loc
, bool inline_p
)
8841 /* Create the namespace. */
8842 tree ns
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
8843 DECL_SOURCE_LOCATION (ns
) = loc
;
8844 SCOPE_DEPTH (ns
) = SCOPE_DEPTH (ctx
) + 1;
8845 if (!SCOPE_DEPTH (ns
))
8846 /* We only allow depth 255. */
8847 sorry ("cannot nest more than %d namespaces", SCOPE_DEPTH (ctx
));
8848 DECL_CONTEXT (ns
) = FROB_CONTEXT (ctx
);
8851 /* Anon-namespaces in different header-unit imports are distinct.
8852 But that's ok as their contents all have internal linkage.
8853 (This is different to how they'd behave as textual includes,
8854 but doing this at all is really odd source.) */
8855 SET_DECL_ASSEMBLER_NAME (ns
, anon_identifier
);
8856 else if (TREE_PUBLIC (ctx
))
8857 TREE_PUBLIC (ns
) = true;
8860 DECL_NAMESPACE_INLINE_P (ns
) = true;
8865 /* NS was newly created, finish off making it. */
8868 make_namespace_finish (tree ns
, tree
*slot
, bool from_import
= false)
8870 if (modules_p () && TREE_PUBLIC (ns
) && (from_import
|| *slot
!= ns
))
8872 /* Merge into global slot. */
8873 tree
*gslot
= get_fixed_binding_slot (slot
, DECL_NAME (ns
),
8874 BINDING_SLOT_GLOBAL
, true);
8878 tree ctx
= CP_DECL_CONTEXT (ns
);
8879 cp_binding_level
*scope
= ggc_cleared_alloc
<cp_binding_level
> ();
8880 scope
->this_entity
= ns
;
8881 scope
->more_cleanups_ok
= true;
8882 scope
->kind
= sk_namespace
;
8883 scope
->level_chain
= NAMESPACE_LEVEL (ctx
);
8884 NAMESPACE_LEVEL (ns
) = scope
;
8886 if (DECL_NAMESPACE_INLINE_P (ns
))
8887 vec_safe_push (DECL_NAMESPACE_INLINEES (ctx
), ns
);
8889 if (DECL_NAMESPACE_INLINE_P (ns
) || !DECL_NAME (ns
))
8890 emit_debug_info_using_namespace (ctx
, ns
, true);
8893 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE,
8894 then we enter an anonymous namespace. If MAKE_INLINE is true, then
8895 we create an inline namespace (it is up to the caller to check upon
8896 redefinition). Return the number of namespaces entered. */
8899 push_namespace (tree name
, bool make_inline
)
8901 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
8904 /* We should not get here if the global_namespace is not yet constructed
8905 nor if NAME designates the global namespace: The global scope is
8906 constructed elsewhere. */
8907 gcc_checking_assert (global_namespace
!= NULL
&& name
!= global_identifier
);
8909 tree ns
= NULL_TREE
;
8911 name_lookup
lookup (name
);
8912 if (!lookup
.search_qualified (current_namespace
, /*usings=*/false))
8914 else if (TREE_CODE (lookup
.value
) == TREE_LIST
)
8916 /* An ambiguous lookup. If exactly one is a namespace, we
8917 want that. If more than one is a namespace, error, but
8918 pick one of them. */
8919 /* DR2061 can cause us to find multiple namespaces of the same
8920 name. We must treat that carefully and avoid thinking we
8921 need to push a new (possibly) duplicate namespace. Hey,
8922 if you want to use the same identifier within an inline
8923 nest, knock yourself out. */
8924 for (tree
*chain
= &lookup
.value
, next
; (next
= *chain
);)
8926 tree decl
= TREE_VALUE (next
);
8927 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
8931 else if (SCOPE_DEPTH (ns
) >= SCOPE_DEPTH (decl
))
8935 chain
= &TREE_CHAIN (next
);
8939 *chain
= TREE_CHAIN (next
);
8942 if (TREE_CHAIN (lookup
.value
))
8944 error ("%<namespace %E%> is ambiguous", name
);
8945 print_candidates (lookup
.value
);
8948 else if (TREE_CODE (lookup
.value
) == NAMESPACE_DECL
)
8952 if (tree dna
= DECL_NAMESPACE_ALIAS (ns
))
8954 /* A namespace alias is not allowed here, but if the alias
8955 is for a namespace also inside the current scope,
8956 accept it with a diagnostic. That's better than dying
8958 if (is_nested_namespace (current_namespace
, CP_DECL_CONTEXT (dna
)))
8960 error ("namespace alias %qD not allowed here, "
8961 "assuming %qD", ns
, dna
);
8971 /* DR2061. NS might be a member of an inline namespace. We
8972 need to push into those namespaces. */
8975 for (tree parent
, ctx
= ns
; ctx
!= current_namespace
;
8978 parent
= CP_DECL_CONTEXT (ctx
);
8980 tree bind
= *find_namespace_slot (parent
, DECL_NAME (ctx
), false);
8983 auto &cluster
= BINDING_VECTOR_CLUSTER (bind
, 0);
8984 binding_slot
&slot
= cluster
.slots
[BINDING_SLOT_CURRENT
];
8985 gcc_checking_assert (!(tree
)slot
|| (tree
)slot
== ctx
);
8991 count
+= push_inline_namespaces (CP_DECL_CONTEXT (ns
));
8992 if (DECL_SOURCE_LOCATION (ns
) == BUILTINS_LOCATION
)
8993 /* It's not builtin now. */
8994 DECL_SOURCE_LOCATION (ns
) = input_location
;
8998 /* Before making a new namespace, see if we already have one in
8999 the existing partitions of the current namespace. */
9000 tree
*slot
= find_namespace_slot (current_namespace
, name
, false);
9002 ns
= reuse_namespace (slot
, current_namespace
, name
);
9004 ns
= make_namespace (current_namespace
, name
,
9005 input_location
, make_inline
);
9007 if (pushdecl (ns
) == error_mark_node
)
9011 /* Finish up making the namespace. */
9012 add_decl_to_level (NAMESPACE_LEVEL (current_namespace
), ns
);
9015 slot
= find_namespace_slot (current_namespace
, name
);
9016 /* This should find the slot created by pushdecl. */
9017 gcc_checking_assert (slot
&& *slot
== ns
);
9021 /* pushdecl could have expanded the hash table, so
9022 slot might be invalid. */
9023 slot
= find_namespace_slot (current_namespace
, name
);
9024 gcc_checking_assert (slot
);
9026 make_namespace_finish (ns
, slot
);
9028 /* Add the anon using-directive here, we don't do it in
9029 make_namespace_finish. */
9030 if (!DECL_NAMESPACE_INLINE_P (ns
) && !name
)
9031 add_using_namespace (current_binding_level
->using_directives
, ns
);
9037 /* A public namespace is exported only if explicitly marked, or
9038 it contains exported entities. */
9039 if (TREE_PUBLIC (ns
) && module_exporting_p ())
9040 DECL_MODULE_EXPORT_P (ns
) = true;
9041 if (module_purview_p ())
9042 DECL_MODULE_PURVIEW_P (ns
) = true;
9044 if (make_inline
&& !DECL_NAMESPACE_INLINE_P (ns
))
9046 error_at (input_location
,
9047 "inline namespace must be specified at initial definition");
9048 inform (DECL_SOURCE_LOCATION (ns
), "%qD defined here", ns
);
9050 resume_scope (NAMESPACE_LEVEL (ns
));
9051 current_namespace
= ns
;
9058 /* Pop from the scope of the current namespace. */
9061 pop_namespace (void)
9063 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
9065 gcc_assert (current_namespace
!= global_namespace
);
9066 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
9067 /* The binding level is not popped, as it might be re-opened later. */
9071 /* An IMPORT is an import that is defining namespace NAME inside CTX. Find or
9072 create that namespace and add it to the container's binding-vector. */
9075 add_imported_namespace (tree ctx
, tree name
, location_t loc
, unsigned import
,
9076 bool inline_p
, bool visible_p
)
9078 // FIXME: Something is not correct about the VISIBLE_P handling. We
9079 // need to insert this namespace into
9080 // (a) the GLOBAL or PARTITION slot, if it is TREE_PUBLIC
9081 // (b) The importing module's slot (always)
9082 // (c) Do we need to put it in the CURRENT slot? This is the
9085 tree
*slot
= find_namespace_slot (ctx
, name
, true);
9086 tree decl
= reuse_namespace (slot
, ctx
, name
);
9088 /* Creating and binding. */
9091 decl
= make_namespace (ctx
, name
, loc
, inline_p
);
9092 make_namespace_finish (decl
, slot
, true);
9094 else if (DECL_NAMESPACE_INLINE_P (decl
) != inline_p
)
9096 error_at (loc
, "%s namespace %qD conflicts with reachable definition",
9097 inline_p
? "inline" : "non-inline", decl
);
9098 inform (DECL_SOURCE_LOCATION (decl
), "reachable %s definition here",
9099 inline_p
? "non-inline" : "inline");
9102 if (TREE_PUBLIC (decl
) && TREE_CODE (*slot
) == BINDING_VECTOR
)
9104 /* See if we can extend the final slot. */
9105 binding_cluster
*last
= BINDING_VECTOR_CLUSTER_LAST (*slot
);
9106 gcc_checking_assert (last
->indices
[0].span
);
9107 unsigned jx
= BINDING_VECTOR_SLOTS_PER_CLUSTER
;
9110 if (last
->indices
[jx
].span
)
9112 tree final
= last
->slots
[jx
];
9113 if (visible_p
== !STAT_HACK_P (final
)
9114 && MAYBE_STAT_DECL (final
) == decl
9115 && last
->indices
[jx
].base
+ last
->indices
[jx
].span
== import
9116 && (BINDING_VECTOR_NUM_CLUSTERS (*slot
) > 1
9117 || (BINDING_VECTOR_SLOTS_PER_CLUSTER
> BINDING_SLOTS_FIXED
9118 && jx
>= BINDING_SLOTS_FIXED
)))
9120 last
->indices
[jx
].span
++;
9125 /* Append a new slot. */
9126 tree
*mslot
= &(tree
&)*append_imported_binding_slot (slot
, name
, import
);
9128 gcc_assert (!*mslot
);
9129 *mslot
= visible_p
? decl
: stat_hack (decl
, NULL_TREE
);
9134 /* Pop off extraneous binding levels left over due to syntax errors.
9135 We don't pop past namespaces, as they might be valid. */
9138 pop_everything (void)
9140 if (ENABLE_SCOPE_CHECKING
)
9141 verbatim ("XXX entering %<pop_everything ()%>");
9142 while (!namespace_bindings_p ())
9144 if (current_binding_level
->kind
== sk_class
)
9145 pop_nested_class ();
9149 if (ENABLE_SCOPE_CHECKING
)
9150 verbatim ("XXX leaving %<pop_everything ()%>");
9153 /* Emit debugging information for using declarations and directives.
9154 If input tree is overloaded fn then emit debug info for all
9158 cp_emit_debug_info_for_using (tree t
, tree context
)
9160 /* Don't try to emit any debug information if we have errors. */
9164 /* Do not supply context to imported_module_or_decl, if
9165 it is a global namespace. */
9166 if (context
== global_namespace
)
9167 context
= NULL_TREE
;
9169 t
= MAYBE_BASELINK_FUNCTIONS (t
);
9171 for (lkp_iterator
iter (t
); iter
; ++iter
)
9175 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
9176 /* FIXME: Handle TEMPLATE_DECLs. */
9179 /* Ignore this FUNCTION_DECL if it refers to a builtin declaration
9180 of a builtin function. */
9181 if (TREE_CODE (fn
) == FUNCTION_DECL
9182 && DECL_EXTERNAL (fn
)
9183 && fndecl_built_in_p (fn
))
9186 if (building_stmt_list_p ())
9187 add_stmt (build_stmt (input_location
, USING_STMT
, fn
));
9189 debug_hooks
->imported_module_or_decl (fn
, NULL_TREE
, context
,
9194 /* True if D is a local declaration in dependent scope. Assumes that it is
9195 (part of) the current lookup result for its name. */
9198 dependent_local_decl_p (tree d
)
9200 if (!DECL_LOCAL_DECL_P (d
))
9203 cxx_binding
*b
= IDENTIFIER_BINDING (DECL_NAME (d
));
9204 cp_binding_level
*l
= b
->scope
;
9205 while (!l
->this_entity
)
9207 return uses_template_parms (l
->this_entity
);
9212 #include "gt-cp-name-lookup.h"