1 /* Definitions for C++ name lookup routines.
2 Copyright (C) 2003-2023 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_overload (tree fns
);
517 void add_value (tree new_val
);
518 void add_type (tree new_type
);
519 bool process_binding (tree val_bind
, tree type_bind
);
520 unsigned process_module_binding (tree val_bind
, tree type_bind
, unsigned);
521 /* Look in only namespace. */
522 bool search_namespace_only (tree scope
);
523 /* Look in namespace and its (recursive) inlines. Ignore using
524 directives. Return true if something found (inc dups). */
525 bool search_namespace (tree scope
);
526 /* Look in the using directives of namespace + inlines using
527 qualified lookup rules. */
528 bool search_usings (tree scope
);
531 void queue_namespace (using_queue
& queue
, int depth
, tree scope
);
532 void queue_usings (using_queue
& queue
, int depth
, vec
<tree
, va_gc
> *usings
);
538 void adl_expr (tree
);
539 void adl_type (tree
);
540 void adl_template_arg (tree
);
541 void adl_class (tree
);
542 void adl_enum (tree
);
543 void adl_bases (tree
);
544 void adl_class_only (tree
);
545 void adl_namespace (tree
);
546 void adl_class_fns (tree
);
547 void adl_namespace_fns (tree
, bitmap
);
550 /* Search namespace + inlines + maybe usings as qualified lookup. */
551 bool search_qualified (tree scope
, bool usings
= true);
553 /* Search namespace + inlines + usings as unqualified lookup. */
554 bool search_unqualified (tree scope
, cp_binding_level
*);
556 /* ADL lookup of ARGS. */
557 tree
search_adl (tree fns
, vec
<tree
, va_gc
> *args
);
560 /* Scope stack shared by all outermost lookups. This avoids us
561 allocating and freeing on every single lookup. */
562 vec
<tree
, va_heap
, vl_embed
> *name_lookup::shared_scopes
;
564 /* Currently active lookup. */
565 name_lookup
*name_lookup::active
;
567 /* Name lookup is recursive, becase ADL can cause template
568 instatiation. This is of course a rare event, so we optimize for
569 it not happening. When we discover an active name-lookup, which
570 must be an ADL lookup, we need to unmark the marked scopes and also
571 unmark the lookup we might have been accumulating. */
574 name_lookup::preserve_state ()
579 unsigned length
= vec_safe_length (previous
->scopes
);
580 vec_safe_reserve (previous
->scopes
, length
* 2);
581 for (unsigned ix
= length
; ix
--;)
583 tree decl
= (*previous
->scopes
)[ix
];
585 gcc_checking_assert (LOOKUP_SEEN_P (decl
));
586 LOOKUP_SEEN_P (decl
) = false;
588 /* Preserve the FOUND_P state on the interrupted lookup's
590 if (LOOKUP_FOUND_P (decl
))
592 LOOKUP_FOUND_P (decl
) = false;
593 previous
->scopes
->quick_push (decl
);
597 /* Unmark the outer partial lookup. */
598 if (previous
->deduping
)
599 lookup_mark (previous
->value
, false);
602 scopes
= shared_scopes
;
606 /* Restore the marking state of a lookup we interrupted. */
609 name_lookup::restore_state ()
611 gcc_checking_assert (!deduping
);
613 /* Unmark and empty this lookup's scope stack. */
614 for (unsigned ix
= vec_safe_length (scopes
); ix
--;)
616 tree decl
= scopes
->pop ();
617 gcc_checking_assert (LOOKUP_SEEN_P (decl
));
618 LOOKUP_SEEN_P (decl
) = false;
619 LOOKUP_FOUND_P (decl
) = false;
627 unsigned length
= vec_safe_length (previous
->scopes
);
628 for (unsigned ix
= 0; ix
!= length
; ix
++)
630 tree decl
= (*previous
->scopes
)[ix
];
631 if (LOOKUP_SEEN_P (decl
))
633 /* The remainder of the scope stack must be recording
634 FOUND_P decls, which we want to pop off. */
637 tree decl
= previous
->scopes
->pop ();
638 gcc_checking_assert (LOOKUP_SEEN_P (decl
)
639 && !LOOKUP_FOUND_P (decl
));
640 LOOKUP_FOUND_P (decl
) = true;
642 while (++ix
!= length
);
646 gcc_checking_assert (!LOOKUP_FOUND_P (decl
));
647 LOOKUP_SEEN_P (decl
) = true;
650 /* Remark the outer partial lookup. */
651 if (previous
->deduping
)
652 lookup_mark (previous
->value
, true);
655 shared_scopes
= scopes
;
659 name_lookup::mark_seen (tree scope
)
661 gcc_checking_assert (!seen_p (scope
));
662 LOOKUP_SEEN_P (scope
) = true;
663 vec_safe_push (scopes
, scope
);
667 name_lookup::find_and_mark (tree scope
)
669 bool result
= LOOKUP_FOUND_P (scope
);
672 LOOKUP_FOUND_P (scope
) = true;
673 if (!LOOKUP_SEEN_P (scope
))
674 vec_safe_push (scopes
, scope
);
680 /* THING and CURRENT are ambiguous, concatenate them. */
683 name_lookup::ambiguous (tree thing
, tree current
)
685 if (TREE_CODE (current
) != TREE_LIST
)
687 current
= build_tree_list (NULL_TREE
, current
);
688 TREE_TYPE (current
) = error_mark_node
;
690 current
= tree_cons (NULL_TREE
, thing
, current
);
691 TREE_TYPE (current
) = error_mark_node
;
696 /* FNS is a new overload set to add to the exising set. */
699 name_lookup::add_overload (tree fns
)
701 if (!deduping
&& TREE_CODE (fns
) == OVERLOAD
)
704 if (!bool (want
& LOOK_want::HIDDEN_FRIEND
))
705 probe
= ovl_skip_hidden (probe
);
706 if (probe
&& TREE_CODE (probe
) == OVERLOAD
707 && OVL_DEDUP_P (probe
))
708 /* We're about to add something found by multiple paths, so need to
709 engage deduping mode. */
713 value
= lookup_maybe_add (fns
, value
, deduping
);
716 /* Add a NEW_VAL, a found value binding into the current value binding. */
719 name_lookup::add_value (tree new_val
)
721 if (OVL_P (new_val
) && (!value
|| OVL_P (value
)))
722 add_overload (new_val
);
725 else if (value
== new_val
)
727 else if ((TREE_CODE (value
) == TYPE_DECL
728 && TREE_CODE (new_val
) == TYPE_DECL
729 && same_type_p (TREE_TYPE (value
), TREE_TYPE (new_val
))))
730 /* Typedefs to the same type. */;
731 else if (TREE_CODE (value
) == NAMESPACE_DECL
732 && TREE_CODE (new_val
) == NAMESPACE_DECL
733 && ORIGINAL_NAMESPACE (value
) == ORIGINAL_NAMESPACE (new_val
))
734 /* Namespace (possibly aliased) to the same namespace. Locate
736 value
= ORIGINAL_NAMESPACE (value
);
739 /* Disengage deduping mode. */
741 value
= ambiguous (new_val
, value
);
745 /* Add a NEW_TYPE, a found type binding into the current type binding. */
748 name_lookup::add_type (tree new_type
)
752 else if (TREE_CODE (type
) == TREE_LIST
753 || !same_type_p (TREE_TYPE (type
), TREE_TYPE (new_type
)))
754 type
= ambiguous (new_type
, type
);
757 /* Process a found binding containing NEW_VAL and NEW_TYPE. Returns
758 true if we actually found something noteworthy. Hiddenness has
759 already been handled in the caller. */
762 name_lookup::process_binding (tree new_val
, tree new_type
)
764 /* Did we really see a type? */
766 && (want
& LOOK_want::TYPE_NAMESPACE
) == LOOK_want::NAMESPACE
)
767 new_type
= NULL_TREE
;
769 /* Do we really see a value? */
771 switch (TREE_CODE (new_val
))
774 /* If we expect types or namespaces, and not templates,
775 or this is not a template class. */
776 if (bool (want
& LOOK_want::TYPE_NAMESPACE
)
777 && !DECL_TYPE_TEMPLATE_P (new_val
))
781 if ((want
& LOOK_want::TYPE_NAMESPACE
) == LOOK_want::NAMESPACE
782 || (new_type
&& bool (want
& LOOK_want::TYPE
)))
786 if ((want
& LOOK_want::TYPE_NAMESPACE
) == LOOK_want::TYPE
)
790 if (bool (want
& LOOK_want::TYPE_NAMESPACE
))
797 new_type
= NULL_TREE
;
800 /* Merge into the lookup */
806 return new_val
!= NULL_TREE
;
809 /* If we're importing a module containing this binding, add it to the
810 lookup set. The trickiness is with namespaces, we only want to
814 name_lookup::process_module_binding (tree new_val
, tree new_type
,
817 /* Optimize for (re-)finding a public namespace. We only need to
819 if (new_val
&& !new_type
820 && TREE_CODE (new_val
) == NAMESPACE_DECL
821 && TREE_PUBLIC (new_val
)
822 && !DECL_NAMESPACE_ALIAS (new_val
))
829 if (new_type
|| new_val
)
830 marker
|= process_binding (new_val
, new_type
);
835 /* Look in exactly namespace SCOPE. */
838 name_lookup::search_namespace_only (tree scope
)
841 if (tree
*binding
= find_namespace_slot (scope
, name
))
844 if (TREE_CODE (val
) == BINDING_VECTOR
)
846 /* I presume the binding list is going to be sparser than
847 the import bitmap. Hence iterate over the former
848 checking for bits set in the bitmap. */
849 bitmap imports
= get_import_bitmap ();
850 binding_cluster
*cluster
= BINDING_VECTOR_CLUSTER_BASE (val
);
854 if (tree bind
= cluster
->slots
[BINDING_SLOT_CURRENT
])
858 if (named_module_purview_p ())
862 if (STAT_HACK_P (bind
) && MODULE_BINDING_GLOBAL_P (bind
))
868 tree type
= NULL_TREE
;
871 if (STAT_HACK_P (bind
))
873 type
= STAT_TYPE (bind
);
874 value
= STAT_DECL (bind
);
876 if (!bool (want
& LOOK_want::HIDDEN_FRIEND
))
878 if (STAT_TYPE_HIDDEN_P (bind
))
880 if (STAT_DECL_HIDDEN_P (bind
))
883 value
= ovl_skip_hidden (value
);
886 else if (!bool (want
& LOOK_want::HIDDEN_FRIEND
))
887 value
= ovl_skip_hidden (value
);
889 marker
= process_module_binding (value
, type
, marker
);
892 /* Scan the imported bindings. */
893 unsigned ix
= BINDING_VECTOR_NUM_CLUSTERS (val
);
894 if (BINDING_VECTOR_SLOTS_PER_CLUSTER
== BINDING_SLOTS_FIXED
)
900 /* Do this in forward order, so we load modules in an order
902 for (; ix
--; cluster
++)
903 for (unsigned jx
= 0; jx
!= BINDING_VECTOR_SLOTS_PER_CLUSTER
; jx
++)
905 /* Are we importing this module? */
906 if (unsigned base
= cluster
->indices
[jx
].base
)
907 if (unsigned span
= cluster
->indices
[jx
].span
)
909 if (bitmap_bit_p (imports
, base
))
911 while (++base
, --span
);
916 if (cluster
->slots
[jx
].is_lazy ())
918 gcc_assert (cluster
->indices
[jx
].span
== 1);
919 lazy_load_binding (cluster
->indices
[jx
].base
,
920 scope
, name
, &cluster
->slots
[jx
]);
922 tree bind
= cluster
->slots
[jx
];
924 /* Load errors could mean there's nothing here. */
927 /* Extract what we can see from here. If there's no
928 stat_hack, then everything was exported. */
929 tree type
= NULL_TREE
;
932 /* If STAT_HACK_P is false, everything is visible, and
933 there's no duplication possibilities. */
934 if (STAT_HACK_P (bind
))
938 /* Do we need to engage deduplication? */
940 if (MODULE_BINDING_GLOBAL_P (bind
))
942 else if (MODULE_BINDING_PARTITION_P (bind
))
944 if (unsigned hit
= dup_detect
& dup
)
946 if ((hit
& 1 && BINDING_VECTOR_GLOBAL_DUPS_P (val
))
948 && BINDING_VECTOR_PARTITION_DUPS_P (val
)))
954 if (STAT_TYPE_VISIBLE_P (bind
))
955 type
= STAT_TYPE (bind
);
956 bind
= STAT_VISIBLE (bind
);
959 /* And process it. */
960 marker
= process_module_binding (bind
, type
, marker
);
966 /* Only a current module binding, visible from the current module. */
967 tree bind
= *binding
;
968 tree value
= bind
, type
= NULL_TREE
;
970 if (STAT_HACK_P (bind
))
972 type
= STAT_TYPE (bind
);
973 value
= STAT_DECL (bind
);
975 if (!bool (want
& LOOK_want::HIDDEN_FRIEND
))
977 if (STAT_TYPE_HIDDEN_P (bind
))
979 if (STAT_DECL_HIDDEN_P (bind
))
982 value
= ovl_skip_hidden (value
);
985 else if (!bool (want
& LOOK_want::HIDDEN_FRIEND
))
986 value
= ovl_skip_hidden (value
);
988 found
|= process_binding (value
, type
);
995 /* Conditionally look in namespace SCOPE and inline children. */
998 name_lookup::search_namespace (tree scope
)
1000 if (see_and_mark (scope
))
1001 /* We've visited this scope before. Return what we found then. */
1002 return found_p (scope
);
1004 /* Look in exactly namespace. */
1005 bool found
= search_namespace_only (scope
);
1007 /* Don't look into inline children, if we're looking for an
1008 anonymous name -- it must be in the current scope, if anywhere. */
1010 /* Recursively look in its inline children. */
1011 if (vec
<tree
, va_gc
> *inlinees
= DECL_NAMESPACE_INLINEES (scope
))
1012 for (unsigned ix
= inlinees
->length (); ix
--;)
1013 found
|= search_namespace ((*inlinees
)[ix
]);
1021 /* Recursively follow using directives of SCOPE & its inline children.
1022 Such following is essentially a flood-fill algorithm. */
1025 name_lookup::search_usings (tree scope
)
1027 /* We do not check seen_p here, as that was already set during the
1028 namespace_only walk. */
1029 if (found_p (scope
))
1033 if (vec
<tree
, va_gc
> *usings
= NAMESPACE_LEVEL (scope
)->using_directives
)
1034 for (unsigned ix
= usings
->length (); ix
--;)
1035 found
|= search_qualified ((*usings
)[ix
], true);
1037 /* Look in its inline children. */
1038 if (vec
<tree
, va_gc
> *inlinees
= DECL_NAMESPACE_INLINEES (scope
))
1039 for (unsigned ix
= inlinees
->length (); ix
--;)
1040 found
|= search_usings ((*inlinees
)[ix
]);
1048 /* Qualified namespace lookup in SCOPE.
1049 1) Look in SCOPE (+inlines). If found, we're done.
1050 2) Otherwise, if USINGS is true,
1051 recurse for every using directive of SCOPE (+inlines).
1053 Trickiness is (a) loops and (b) multiple paths to same namespace.
1054 In both cases we want to not repeat any lookups, and know whether
1055 to stop the caller's step #2. Do this via the FOUND_P marker. */
1058 name_lookup::search_qualified (tree scope
, bool usings
)
1063 found
= found_p (scope
);
1066 found
= search_namespace (scope
);
1067 if (!found
&& usings
)
1068 found
= search_usings (scope
);
1076 /* Add SCOPE to the unqualified search queue, recursively add its
1077 inlines and those via using directives. */
1080 name_lookup::queue_namespace (using_queue
& queue
, int depth
, tree scope
)
1082 if (see_and_mark (scope
))
1086 tree common
= scope
;
1087 while (SCOPE_DEPTH (common
) > depth
)
1088 common
= CP_DECL_CONTEXT (common
);
1089 queue
.safe_push (using_pair (common
, scope
));
1091 /* Queue its inline children. */
1092 if (vec
<tree
, va_gc
> *inlinees
= DECL_NAMESPACE_INLINEES (scope
))
1093 for (unsigned ix
= inlinees
->length (); ix
--;)
1094 queue_namespace (queue
, depth
, (*inlinees
)[ix
]);
1096 /* Queue its using targets. */
1097 queue_usings (queue
, depth
, NAMESPACE_LEVEL (scope
)->using_directives
);
1100 /* Add the namespaces in USINGS to the unqualified search queue. */
1103 name_lookup::queue_usings (using_queue
& queue
, int depth
, vec
<tree
, va_gc
> *usings
)
1106 for (unsigned ix
= usings
->length (); ix
--;)
1107 queue_namespace (queue
, depth
, (*usings
)[ix
]);
1110 /* Unqualified namespace lookup in SCOPE.
1111 1) add scope+inlins to worklist.
1112 2) recursively add target of every using directive
1113 3) for each worklist item where SCOPE is common ancestor, search it
1114 4) if nothing find, scope=parent, goto 1. */
1117 name_lookup::search_unqualified (tree scope
, cp_binding_level
*level
)
1122 /* Queue local using-directives. */
1123 for (; level
->kind
!= sk_namespace
; level
= level
->level_chain
)
1124 queue_usings (queue
, SCOPE_DEPTH (scope
), level
->using_directives
);
1126 for (; !found
; scope
= CP_DECL_CONTEXT (scope
))
1128 gcc_assert (!DECL_NAMESPACE_ALIAS (scope
));
1129 int depth
= SCOPE_DEPTH (scope
);
1131 /* Queue namespaces reachable from SCOPE. */
1132 queue_namespace (queue
, depth
, scope
);
1134 /* Search every queued namespace where SCOPE is the common
1135 ancestor. Adjust the others. */
1139 using_pair
&pair
= queue
[ix
];
1140 while (pair
.first
== scope
)
1142 found
|= search_namespace_only (pair
.second
);
1143 pair
= queue
.pop ();
1144 if (ix
== queue
.length ())
1147 /* The depth is the same as SCOPE, find the parent scope. */
1148 if (SCOPE_DEPTH (pair
.first
) == depth
)
1149 pair
.first
= CP_DECL_CONTEXT (pair
.first
);
1152 while (ix
< queue
.length ());
1154 if (scope
== global_namespace
)
1157 /* If looking for hidden friends, we only look in the innermost
1158 namespace scope. [namespace.memdef]/3 If a friend
1159 declaration in a non-local class first declares a class,
1160 function, class template or function template the friend is a
1161 member of the innermost enclosing namespace. See also
1162 [basic.lookup.unqual]/7 */
1163 if (bool (want
& LOOK_want::HIDDEN_FRIEND
))
1172 /* FNS is a value binding. If it is a (set of overloaded) functions,
1173 add them into the current value. */
1176 name_lookup::add_fns (tree fns
)
1180 else if (TREE_CODE (fns
) == OVERLOAD
)
1182 if (TREE_TYPE (fns
) != unknown_type_node
)
1183 fns
= OVL_FUNCTION (fns
);
1185 else if (!DECL_DECLARES_FUNCTION_P (fns
))
1191 /* Add the overloaded fns of SCOPE. */
1194 name_lookup::adl_namespace_fns (tree scope
, bitmap imports
)
1196 if (tree
*binding
= find_namespace_slot (scope
, name
))
1198 tree val
= *binding
;
1199 if (TREE_CODE (val
) != BINDING_VECTOR
)
1200 add_fns (ovl_skip_hidden (MAYBE_STAT_DECL (val
)));
1203 /* I presume the binding list is going to be sparser than
1204 the import bitmap. Hence iterate over the former
1205 checking for bits set in the bitmap. */
1206 binding_cluster
*cluster
= BINDING_VECTOR_CLUSTER_BASE (val
);
1209 if (tree bind
= cluster
->slots
[BINDING_SLOT_CURRENT
])
1211 /* The current TU's bindings must be visible, we don't
1212 need to check the bitmaps. */
1216 if (named_module_purview_p ())
1220 if (STAT_HACK_P (bind
) && MODULE_BINDING_GLOBAL_P (bind
))
1227 add_fns (ovl_skip_hidden (MAYBE_STAT_DECL (bind
)));
1230 /* Scan the imported bindings. */
1231 unsigned ix
= BINDING_VECTOR_NUM_CLUSTERS (val
);
1232 if (BINDING_VECTOR_SLOTS_PER_CLUSTER
== BINDING_SLOTS_FIXED
)
1238 /* Do this in forward order, so we load modules in an order
1239 the user expects. */
1240 for (; ix
--; cluster
++)
1241 for (unsigned jx
= 0; jx
!= BINDING_VECTOR_SLOTS_PER_CLUSTER
; jx
++)
1243 /* Functions are never on merged slots. */
1244 if (!cluster
->indices
[jx
].base
1245 || cluster
->indices
[jx
].span
!= 1)
1248 /* Is this slot visible? */
1249 if (!bitmap_bit_p (imports
, cluster
->indices
[jx
].base
))
1253 if (cluster
->slots
[jx
].is_lazy ())
1254 lazy_load_binding (cluster
->indices
[jx
].base
,
1255 scope
, name
, &cluster
->slots
[jx
]);
1257 tree bind
= cluster
->slots
[jx
];
1259 /* Load errors could mean there's nothing here. */
1262 if (STAT_HACK_P (bind
))
1266 /* Do we need to engage deduplication? */
1268 if (MODULE_BINDING_GLOBAL_P (bind
))
1270 else if (MODULE_BINDING_PARTITION_P (bind
))
1272 if (unsigned hit
= dup_detect
& dup
)
1273 if ((hit
& 1 && BINDING_VECTOR_GLOBAL_DUPS_P (val
))
1275 && BINDING_VECTOR_PARTITION_DUPS_P (val
)))
1280 bind
= STAT_VISIBLE (bind
);
1289 /* Add the hidden friends of SCOPE. */
1292 name_lookup::adl_class_fns (tree type
)
1295 for (tree list
= DECL_FRIENDLIST (TYPE_MAIN_DECL (type
));
1296 list
; list
= TREE_CHAIN (list
))
1297 if (name
== FRIEND_NAME (list
))
1299 tree context
= NULL_TREE
; /* Lazily computed. */
1300 for (tree friends
= FRIEND_DECLS (list
); friends
;
1301 friends
= TREE_CHAIN (friends
))
1303 tree fn
= TREE_VALUE (friends
);
1305 /* Only interested in global functions with potentially hidden
1306 (i.e. unqualified) declarations. */
1308 context
= decl_namespace_context (type
);
1309 if (CP_DECL_CONTEXT (fn
) != context
)
1314 /* Template specializations are never found by name lookup.
1315 (Templates themselves can be found, but not template
1316 specializations.) */
1317 if (TREE_CODE (fn
) == FUNCTION_DECL
&& DECL_USE_TEMPLATE (fn
))
1325 /* Find the containing non-inlined namespace, add it and all its
1329 name_lookup::adl_namespace (tree scope
)
1331 if (see_and_mark (scope
))
1334 /* Look down into inline namespaces. */
1335 if (vec
<tree
, va_gc
> *inlinees
= DECL_NAMESPACE_INLINEES (scope
))
1336 for (unsigned ix
= inlinees
->length (); ix
--;)
1337 adl_namespace ((*inlinees
)[ix
]);
1339 if (DECL_NAMESPACE_INLINE_P (scope
))
1341 adl_namespace (CP_DECL_CONTEXT (scope
));
1344 /* Adds the class and its friends to the lookup structure. */
1347 name_lookup::adl_class_only (tree type
)
1349 /* Backend-built structures, such as __builtin_va_list, aren't
1350 affected by all this. */
1351 if (!CLASS_TYPE_P (type
))
1354 type
= TYPE_MAIN_VARIANT (type
);
1356 if (see_and_mark (type
))
1359 tree context
= decl_namespace_context (type
);
1360 adl_namespace (context
);
1363 /* Adds the class and its bases to the lookup structure.
1364 Returns true on error. */
1367 name_lookup::adl_bases (tree type
)
1369 adl_class_only (type
);
1371 /* Process baseclasses. */
1372 if (tree binfo
= TYPE_BINFO (type
))
1377 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
1378 adl_bases (BINFO_TYPE (base_binfo
));
1382 /* Adds everything associated with a class argument type to the lookup
1385 If T is a class type (including unions), its associated classes are: the
1386 class itself; the class of which it is a member, if any; and its direct
1387 and indirect base classes. Its associated namespaces are the namespaces
1388 of which its associated classes are members. Furthermore, if T is a
1389 class template specialization, its associated namespaces and classes
1390 also include: the namespaces and classes associated with the types of
1391 the template arguments provided for template type parameters (excluding
1392 template template parameters); the namespaces of which any template
1393 template arguments are members; and the classes of which any member
1394 templates used as template template arguments are members. [ Note:
1395 non-type template arguments do not contribute to the set of associated
1396 namespaces. --end note] */
1399 name_lookup::adl_class (tree type
)
1401 /* Backend build structures, such as __builtin_va_list, aren't
1402 affected by all this. */
1403 if (!CLASS_TYPE_P (type
))
1406 type
= TYPE_MAIN_VARIANT (type
);
1408 /* We don't set found here because we have to have set seen first,
1409 which is done in the adl_bases walk. */
1413 complete_type (type
);
1417 if (TYPE_CLASS_SCOPE_P (type
))
1418 adl_class_only (TYPE_CONTEXT (type
));
1420 /* Process template arguments. */
1421 if (CLASSTYPE_TEMPLATE_INFO (type
)
1422 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
1424 tree list
= INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
1425 for (int i
= 0; i
< TREE_VEC_LENGTH (list
); ++i
)
1426 adl_template_arg (TREE_VEC_ELT (list
, i
));
1431 name_lookup::adl_enum (tree type
)
1433 type
= TYPE_MAIN_VARIANT (type
);
1434 if (see_and_mark (type
))
1437 if (TYPE_CLASS_SCOPE_P (type
))
1438 adl_class_only (TYPE_CONTEXT (type
));
1440 adl_namespace (decl_namespace_context (type
));
1444 name_lookup::adl_expr (tree expr
)
1449 gcc_assert (!TYPE_P (expr
));
1451 if (TREE_TYPE (expr
) != unknown_type_node
)
1453 adl_type (unlowered_expr_type (expr
));
1457 if (TREE_CODE (expr
) == ADDR_EXPR
)
1458 expr
= TREE_OPERAND (expr
, 0);
1459 if (TREE_CODE (expr
) == COMPONENT_REF
1460 || TREE_CODE (expr
) == OFFSET_REF
)
1461 expr
= TREE_OPERAND (expr
, 1);
1462 expr
= MAYBE_BASELINK_FUNCTIONS (expr
);
1465 for (lkp_iterator
iter (expr
); iter
; ++iter
)
1466 adl_type (TREE_TYPE (*iter
));
1467 else if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
1469 /* The working paper doesn't currently say how to handle
1470 template-id arguments. The sensible thing would seem to be
1471 to handle the list of template candidates like a normal
1472 overload set, and handle the template arguments like we do
1473 for class template specializations. */
1475 /* First the templates. */
1476 adl_expr (TREE_OPERAND (expr
, 0));
1478 /* Now the arguments. */
1479 if (tree args
= TREE_OPERAND (expr
, 1))
1480 for (int ix
= TREE_VEC_LENGTH (args
); ix
--;)
1481 adl_template_arg (TREE_VEC_ELT (args
, ix
));
1486 name_lookup::adl_type (tree type
)
1491 if (TYPE_PTRDATAMEM_P (type
))
1493 /* Pointer to member: associate class type and value type. */
1494 adl_type (TYPE_PTRMEM_CLASS_TYPE (type
));
1495 adl_type (TYPE_PTRMEM_POINTED_TO_TYPE (type
));
1499 switch (TREE_CODE (type
))
1502 if (TYPE_PTRMEMFUNC_P (type
))
1504 adl_type (TYPE_PTRMEMFUNC_FN_TYPE (type
));
1513 /* The basetype is referenced in the first arg type, so just
1516 /* Associate the parameter types. */
1517 for (tree args
= TYPE_ARG_TYPES (type
); args
; args
= TREE_CHAIN (args
))
1518 adl_type (TREE_VALUE (args
));
1522 case REFERENCE_TYPE
:
1524 adl_type (TREE_TYPE (type
));
1532 gcc_assert (type
== unknown_type_node
1533 || type
== init_list_type_node
);
1536 case TYPE_PACK_EXPANSION
:
1537 adl_type (PACK_EXPANSION_PATTERN (type
));
1545 /* Adds everything associated with a template argument to the lookup
1549 name_lookup::adl_template_arg (tree arg
)
1551 /* [basic.lookup.koenig]
1553 If T is a template-id, its associated namespaces and classes are
1554 ... the namespaces and classes associated with the types of the
1555 template arguments provided for template type parameters
1556 (excluding template template parameters); the namespaces in which
1557 any template template arguments are defined; and the classes in
1558 which any member templates used as template template arguments
1559 are defined. [Note: non-type template arguments do not
1560 contribute to the set of associated namespaces. ] */
1562 /* Consider first template template arguments. */
1563 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
1564 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
1566 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
1568 tree ctx
= CP_DECL_CONTEXT (arg
);
1570 /* It's not a member template. */
1571 if (TREE_CODE (ctx
) == NAMESPACE_DECL
)
1572 adl_namespace (ctx
);
1573 /* Otherwise, it must be member template. */
1575 adl_class_only (ctx
);
1577 /* It's an argument pack; handle it recursively. */
1578 else if (ARGUMENT_PACK_P (arg
))
1580 tree args
= ARGUMENT_PACK_ARGS (arg
);
1581 int i
, len
= TREE_VEC_LENGTH (args
);
1582 for (i
= 0; i
< len
; ++i
)
1583 adl_template_arg (TREE_VEC_ELT (args
, i
));
1585 /* It's not a template template argument, but it is a type template
1587 else if (TYPE_P (arg
))
1591 /* Perform ADL lookup. FNS is the existing lookup result and ARGS are
1592 the call arguments. */
1595 name_lookup::search_adl (tree fns
, vec
<tree
, va_gc
> *args
)
1597 gcc_checking_assert (!vec_safe_length (scopes
));
1599 /* Gather each associated entity onto the lookup's scope list. */
1603 FOR_EACH_VEC_ELT_REVERSE (*args
, ix
, arg
)
1604 /* OMP reduction operators put an ADL-significant type as the
1611 if (vec_safe_length (scopes
))
1613 /* Now do the lookups. */
1618 /* INST_PATH will be NULL, if this is /not/ 2nd-phase ADL. */
1619 bitmap inst_path
= NULL
;
1620 /* VISIBLE is the regular import bitmap. */
1621 bitmap visible
= visible_instantiation_path (&inst_path
);
1623 for (unsigned ix
= scopes
->length (); ix
--;)
1625 tree scope
= (*scopes
)[ix
];
1626 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
1627 adl_namespace_fns (scope
, visible
);
1630 if (RECORD_OR_UNION_TYPE_P (scope
))
1631 adl_class_fns (scope
);
1633 /* During 2nd phase ADL: Any exported declaration D in N
1634 declared within the purview of a named module M
1635 (10.2) is visible if there is an associated entity
1636 attached to M with the same innermost enclosing
1637 non-inline namespace as D.
1638 [basic.lookup.argdep]/4.4 */
1641 /* Not 2nd phase. */
1644 tree ctx
= CP_DECL_CONTEXT (TYPE_NAME (scope
));
1645 if (TREE_CODE (ctx
) != NAMESPACE_DECL
)
1646 /* Not namespace-scope class. */
1649 tree origin
= get_originating_module_decl (TYPE_NAME (scope
));
1650 tree not_tmpl
= STRIP_TEMPLATE (origin
);
1651 if (!DECL_LANG_SPECIFIC (not_tmpl
)
1652 || !DECL_MODULE_IMPORT_P (not_tmpl
))
1656 unsigned module
= get_importing_module (origin
);
1658 if (!bitmap_bit_p (inst_path
, module
))
1659 /* Not on path of instantiation. */
1662 if (bitmap_bit_p (visible
, module
))
1663 /* If the module was in the visible set, we'll look at
1664 its namespace partition anyway. */
1667 if (tree
*slot
= find_namespace_slot (ctx
, name
, false))
1668 if (binding_slot
*mslot
= search_imported_binding_slot (slot
, module
))
1670 if (mslot
->is_lazy ())
1671 lazy_load_binding (module
, ctx
, name
, mslot
);
1673 if (tree bind
= *mslot
)
1675 /* We must turn on deduping, because some other class
1676 from this module might also be in this namespace. */
1679 /* Add the exported fns */
1680 if (STAT_HACK_P (bind
))
1681 add_fns (STAT_VISIBLE (bind
));
1694 static bool qualified_namespace_lookup (tree
, name_lookup
*);
1695 static void consider_binding_level (tree name
,
1696 best_match
<tree
, const char *> &bm
,
1697 cp_binding_level
*lvl
,
1698 bool look_within_fields
,
1699 enum lookup_name_fuzzy_kind kind
);
1701 /* ADL lookup of NAME. FNS is the result of regular lookup, and we
1702 don't add duplicates to it. ARGS is the vector of call
1703 arguments (which will not be empty). */
1706 lookup_arg_dependent (tree name
, tree fns
, vec
<tree
, va_gc
> *args
)
1708 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
1709 name_lookup
lookup (name
);
1710 return lookup
.search_adl (fns
, args
);
1713 /* FNS is an overload set of conversion functions. Return the
1714 overloads converting to TYPE. */
1717 extract_conversion_operator (tree fns
, tree type
)
1719 tree convs
= NULL_TREE
;
1720 tree tpls
= NULL_TREE
;
1722 for (ovl_iterator
iter (fns
); iter
; ++iter
)
1724 if (same_type_p (DECL_CONV_FN_TYPE (*iter
), type
))
1725 convs
= lookup_add (*iter
, convs
);
1727 if (TREE_CODE (*iter
) == TEMPLATE_DECL
)
1728 tpls
= lookup_add (*iter
, tpls
);
1737 /* Binary search of (ordered) MEMBER_VEC for NAME. */
1740 member_vec_binary_search (vec
<tree
, va_gc
> *member_vec
, tree name
)
1742 for (unsigned lo
= 0, hi
= member_vec
->length (); lo
< hi
;)
1744 unsigned mid
= (lo
+ hi
) / 2;
1745 tree binding
= (*member_vec
)[mid
];
1746 tree binding_name
= OVL_NAME (binding
);
1748 if (binding_name
> name
)
1750 else if (binding_name
< name
)
1759 /* Linear search of (unordered) MEMBER_VEC for NAME. */
1762 member_vec_linear_search (vec
<tree
, va_gc
> *member_vec
, tree name
)
1764 for (int ix
= member_vec
->length (); ix
--;)
1765 if (tree binding
= (*member_vec
)[ix
])
1766 if (OVL_NAME (binding
) == name
)
1772 /* Linear search of (partially ordered) fields of KLASS for NAME. */
1775 fields_linear_search (tree klass
, tree name
, bool want_type
)
1777 for (tree fields
= TYPE_FIELDS (klass
); fields
; fields
= DECL_CHAIN (fields
))
1781 if (TREE_CODE (decl
) == FIELD_DECL
1782 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
1784 if (tree temp
= search_anon_aggr (TREE_TYPE (decl
), name
, want_type
))
1788 if (DECL_NAME (decl
) != name
)
1791 if (TREE_CODE (decl
) == USING_DECL
)
1793 decl
= strip_using_decl (decl
);
1794 if (is_overloaded_fn (decl
))
1798 if (DECL_DECLARES_FUNCTION_P (decl
))
1799 /* Functions are found separately. */
1802 if (!want_type
|| DECL_DECLARES_TYPE_P (decl
))
1809 /* Look for NAME member inside of anonymous aggregate ANON. Although
1810 such things should only contain FIELD_DECLs, we check that too
1811 late, and would give very confusing errors if we weren't
1815 search_anon_aggr (tree anon
, tree name
, bool want_type
)
1817 gcc_assert (COMPLETE_TYPE_P (anon
));
1818 tree ret
= get_class_binding_direct (anon
, name
, want_type
);
1822 /* Look for NAME as an immediate member of KLASS (including
1823 anon-members or unscoped enum member). TYPE_OR_FNS is zero for
1824 regular search. >0 to get a type binding (if there is one) and <0
1825 if you want (just) the member function binding.
1827 Use this if you do not want lazy member creation. */
1830 get_class_binding_direct (tree klass
, tree name
, bool want_type
)
1832 gcc_checking_assert (RECORD_OR_UNION_TYPE_P (klass
));
1834 /* Conversion operators can only be found by the marker conversion
1836 bool conv_op
= IDENTIFIER_CONV_OP_P (name
);
1837 tree lookup
= conv_op
? conv_op_identifier
: name
;
1838 tree val
= NULL_TREE
;
1839 vec
<tree
, va_gc
> *member_vec
= CLASSTYPE_MEMBER_VEC (klass
);
1841 if (COMPLETE_TYPE_P (klass
) && member_vec
)
1843 val
= member_vec_binary_search (member_vec
, lookup
);
1846 else if (STAT_HACK_P (val
))
1847 val
= want_type
? STAT_TYPE (val
) : STAT_DECL (val
);
1848 else if (want_type
&& !DECL_DECLARES_TYPE_P (val
))
1853 if (member_vec
&& !want_type
)
1854 val
= member_vec_linear_search (member_vec
, lookup
);
1856 if (!val
|| (TREE_CODE (val
) == OVERLOAD
&& OVL_DEDUP_P (val
)))
1857 /* Dependent using declarations are a 'field', make sure we
1858 return that even if we saw an overload already. */
1859 if (tree field_val
= fields_linear_search (klass
, lookup
, want_type
))
1863 else if (TREE_CODE (field_val
) == USING_DECL
)
1864 val
= ovl_make (field_val
, val
);
1868 /* Extract the conversion operators asked for, unless the general
1869 conversion operator was requested. */
1872 gcc_checking_assert (OVL_FUNCTION (val
) == conv_op_marker
);
1873 val
= OVL_CHAIN (val
);
1874 if (tree type
= TREE_TYPE (name
))
1875 val
= extract_conversion_operator (val
, type
);
1881 /* We're about to lookup NAME in KLASS. Make sure any lazily declared
1882 members are now declared. */
1885 maybe_lazily_declare (tree klass
, tree name
)
1887 /* See big comment anout module_state::write_pendings regarding adding a check
1890 lazy_load_pendings (TYPE_NAME (klass
));
1892 /* Lazily declare functions, if we're going to search these. */
1893 if (IDENTIFIER_CTOR_P (name
))
1895 if (CLASSTYPE_LAZY_DEFAULT_CTOR (klass
))
1896 lazily_declare_fn (sfk_constructor
, klass
);
1897 if (CLASSTYPE_LAZY_COPY_CTOR (klass
))
1898 lazily_declare_fn (sfk_copy_constructor
, klass
);
1899 if (CLASSTYPE_LAZY_MOVE_CTOR (klass
))
1900 lazily_declare_fn (sfk_move_constructor
, klass
);
1902 else if (IDENTIFIER_DTOR_P (name
))
1904 if (CLASSTYPE_LAZY_DESTRUCTOR (klass
))
1905 lazily_declare_fn (sfk_destructor
, klass
);
1907 else if (name
== assign_op_identifier
)
1909 if (CLASSTYPE_LAZY_COPY_ASSIGN (klass
))
1910 lazily_declare_fn (sfk_copy_assignment
, klass
);
1911 if (CLASSTYPE_LAZY_MOVE_ASSIGN (klass
))
1912 lazily_declare_fn (sfk_move_assignment
, klass
);
1916 /* Look for NAME's binding in exactly KLASS. See
1917 get_class_binding_direct for argument description. Does lazy
1918 special function creation as necessary. */
1921 get_class_binding (tree klass
, tree name
, bool want_type
/*=false*/)
1923 klass
= complete_type (klass
);
1925 if (COMPLETE_TYPE_P (klass
))
1926 maybe_lazily_declare (klass
, name
);
1928 return get_class_binding_direct (klass
, name
, want_type
);
1931 /* Find the slot containing overloads called 'NAME'. If there is no
1932 such slot and the class is complete, create an empty one, at the
1933 correct point in the sorted member vector. Otherwise return NULL.
1934 Deals with conv_op marker handling. */
1937 find_member_slot (tree klass
, tree name
)
1939 bool complete_p
= COMPLETE_TYPE_P (klass
);
1941 vec
<tree
, va_gc
> *member_vec
= CLASSTYPE_MEMBER_VEC (klass
);
1944 vec_alloc (member_vec
, 8);
1945 CLASSTYPE_MEMBER_VEC (klass
) = member_vec
;
1947 /* If the class is complete but had no member_vec, we need to
1948 add the TYPE_FIELDS into it. We're also most likely to be
1949 adding ctors & dtors, so ask for 6 spare slots (the
1950 abstract cdtors and their clones). */
1951 member_vec
= set_class_bindings (klass
, 6);
1954 if (IDENTIFIER_CONV_OP_P (name
))
1955 name
= conv_op_identifier
;
1957 unsigned ix
, length
= member_vec
->length ();
1958 for (ix
= 0; ix
< length
; ix
++)
1960 tree
*slot
= &(*member_vec
)[ix
];
1961 tree fn_name
= OVL_NAME (*slot
);
1963 if (fn_name
== name
)
1965 /* If we found an existing slot, it must be a function set.
1966 Even with insertion after completion, because those only
1967 happen with artificial fns that have unspellable names.
1968 This means we do not have to deal with the stat hack
1970 gcc_checking_assert (OVL_P (*slot
));
1971 if (name
== conv_op_identifier
)
1973 gcc_checking_assert (OVL_FUNCTION (*slot
) == conv_op_marker
);
1974 /* Skip the conv-op marker. */
1975 slot
= &OVL_CHAIN (*slot
);
1980 if (complete_p
&& fn_name
> name
)
1984 /* No slot found, add one if the class is complete. */
1987 /* Do exact allocation, as we don't expect to add many. */
1988 gcc_assert (name
!= conv_op_identifier
);
1989 vec_safe_reserve_exact (member_vec
, 1);
1990 CLASSTYPE_MEMBER_VEC (klass
) = member_vec
;
1991 member_vec
->quick_insert (ix
, NULL_TREE
);
1992 return &(*member_vec
)[ix
];
1998 /* KLASS is an incomplete class to which we're adding a method NAME.
1999 Add a slot and deal with conv_op marker handling. */
2002 add_member_slot (tree klass
, tree name
)
2004 gcc_assert (!COMPLETE_TYPE_P (klass
));
2006 vec
<tree
, va_gc
> *member_vec
= CLASSTYPE_MEMBER_VEC (klass
);
2007 vec_safe_push (member_vec
, NULL_TREE
);
2008 CLASSTYPE_MEMBER_VEC (klass
) = member_vec
;
2010 tree
*slot
= &member_vec
->last ();
2011 if (IDENTIFIER_CONV_OP_P (name
))
2013 /* Install the marker prefix. */
2014 *slot
= ovl_make (conv_op_marker
, NULL_TREE
);
2015 slot
= &OVL_CHAIN (*slot
);
2021 /* Comparison function to compare two MEMBER_VEC entries by name.
2022 Because we can have duplicates during insertion of TYPE_FIELDS, we
2023 do extra checking so deduping doesn't have to deal with so many
2027 member_name_cmp (const void *a_p
, const void *b_p
)
2029 tree a
= *(const tree
*)a_p
;
2030 tree b
= *(const tree
*)b_p
;
2031 tree name_a
= DECL_NAME (TREE_CODE (a
) == OVERLOAD
? OVL_FUNCTION (a
) : a
);
2032 tree name_b
= DECL_NAME (TREE_CODE (b
) == OVERLOAD
? OVL_FUNCTION (b
) : b
);
2034 gcc_checking_assert (name_a
&& name_b
);
2035 if (name_a
!= name_b
)
2036 return name_a
< name_b
? -1 : +1;
2038 if (name_a
== conv_op_identifier
)
2040 /* Strip the conv-op markers. */
2041 gcc_checking_assert (OVL_FUNCTION (a
) == conv_op_marker
2042 && OVL_FUNCTION (b
) == conv_op_marker
);
2047 if (TREE_CODE (a
) == OVERLOAD
)
2048 a
= OVL_FUNCTION (a
);
2049 if (TREE_CODE (b
) == OVERLOAD
)
2050 b
= OVL_FUNCTION (b
);
2052 /* We're in STAT_HACK or USING_DECL territory (or possibly error-land). */
2053 if (TREE_CODE (a
) != TREE_CODE (b
))
2055 /* If one of them is a TYPE_DECL, it loses. */
2056 if (TREE_CODE (a
) == TYPE_DECL
)
2058 else if (TREE_CODE (b
) == TYPE_DECL
)
2061 /* If one of them is a USING_DECL, it loses. */
2062 if (TREE_CODE (a
) == USING_DECL
)
2064 else if (TREE_CODE (b
) == USING_DECL
)
2067 /* There are no other cases with different kinds of decls, as
2068 duplicate detection should have kicked in earlier. However,
2069 some erroneous cases get though. */
2070 gcc_assert (errorcount
);
2073 /* Using source location would be the best thing here, but we can
2074 get identically-located decls in the following circumstances:
2076 1) duplicate artificial type-decls for the same type.
2078 2) pack expansions of using-decls.
2080 We should not be doing #1, but in either case it doesn't matter
2081 how we order these. Use UID as a proxy for source ordering, so
2082 that identically-located decls still have a well-defined stable
2084 if (DECL_UID (a
) != DECL_UID (b
))
2085 return DECL_UID (a
) < DECL_UID (b
) ? -1 : +1;
2086 gcc_assert (a
== b
);
2091 gt_pointer_operator new_value
;
2095 /* This routine compares two fields like member_name_cmp but using the
2096 pointer operator in resort_field_decl_data. We don't have to deal
2097 with duplicates here. */
2100 resort_member_name_cmp (const void *a_p
, const void *b_p
)
2102 tree a
= *(const tree
*)a_p
;
2103 tree b
= *(const tree
*)b_p
;
2104 tree name_a
= OVL_NAME (a
);
2105 tree name_b
= OVL_NAME (b
);
2107 resort_data
.new_value (&name_a
, &name_a
, resort_data
.cookie
);
2108 resort_data
.new_value (&name_b
, &name_b
, resort_data
.cookie
);
2110 gcc_checking_assert (name_a
!= name_b
);
2112 return name_a
< name_b
? -1 : +1;
2115 /* Resort CLASSTYPE_MEMBER_VEC because pointers have been reordered. */
2118 resort_type_member_vec (void *obj
, void */
*orig_obj*/
,
2119 gt_pointer_operator new_value
, void* cookie
)
2121 if (vec
<tree
, va_gc
> *member_vec
= (vec
<tree
, va_gc
> *) obj
)
2123 resort_data
.new_value
= new_value
;
2124 resort_data
.cookie
= cookie
;
2125 member_vec
->qsort (resort_member_name_cmp
);
2129 /* Recursively count the number of fields in KLASS, including anonymous
2133 count_class_fields (tree klass
)
2135 unsigned n_fields
= 0;
2137 for (tree fields
= TYPE_FIELDS (klass
); fields
; fields
= DECL_CHAIN (fields
))
2138 if (DECL_DECLARES_FUNCTION_P (fields
))
2139 /* Functions are dealt with separately. */;
2140 else if (TREE_CODE (fields
) == FIELD_DECL
2141 && ANON_AGGR_TYPE_P (TREE_TYPE (fields
)))
2142 n_fields
+= count_class_fields (TREE_TYPE (fields
));
2143 else if (DECL_NAME (fields
))
2149 /* Append all the nonfunction members fields of KLASS to MEMBER_VEC.
2150 Recurse for anonymous members. MEMBER_VEC must have space. */
2153 member_vec_append_class_fields (vec
<tree
, va_gc
> *member_vec
, tree klass
)
2155 for (tree fields
= TYPE_FIELDS (klass
); fields
; fields
= DECL_CHAIN (fields
))
2156 if (DECL_DECLARES_FUNCTION_P (fields
))
2157 /* Functions are handled separately. */;
2158 else if (TREE_CODE (fields
) == FIELD_DECL
2159 && ANON_AGGR_TYPE_P (TREE_TYPE (fields
)))
2160 member_vec_append_class_fields (member_vec
, TREE_TYPE (fields
));
2161 else if (DECL_NAME (fields
))
2163 tree field
= fields
;
2164 /* Mark a conv-op USING_DECL with the conv-op-marker. */
2165 if (TREE_CODE (field
) == USING_DECL
2166 && IDENTIFIER_CONV_OP_P (DECL_NAME (field
)))
2167 field
= ovl_make (conv_op_marker
, field
);
2168 member_vec
->quick_push (field
);
2172 /* Append all of the enum values of ENUMTYPE to MEMBER_VEC.
2173 MEMBER_VEC must have space. */
2176 member_vec_append_enum_values (vec
<tree
, va_gc
> *member_vec
, tree enumtype
)
2178 for (tree values
= TYPE_VALUES (enumtype
);
2179 values
; values
= TREE_CHAIN (values
))
2180 member_vec
->quick_push (TREE_VALUE (values
));
2183 /* MEMBER_VEC has just had new DECLs added to it, but is sorted.
2184 DeDup adjacent DECLS of the same name. We already dealt with
2185 conflict resolution when adding the fields or methods themselves.
2186 There are three cases (which could all be combined):
2187 1) a TYPE_DECL and non TYPE_DECL. Deploy STAT_HACK as appropriate.
2188 2) a USING_DECL and an overload. If the USING_DECL is dependent,
2189 it wins. Otherwise the OVERLOAD does.
2190 3) two USING_DECLS. ...
2192 member_name_cmp will have ordered duplicates as
2193 <fns><using><type> */
2196 member_vec_dedup (vec
<tree
, va_gc
> *member_vec
)
2198 unsigned len
= member_vec
->length ();
2204 tree name
= OVL_NAME ((*member_vec
)[0]);
2205 for (unsigned jx
, ix
= 0; ix
< len
; ix
= jx
)
2207 tree current
= NULL_TREE
;
2208 tree to_type
= NULL_TREE
;
2209 tree to_using
= NULL_TREE
;
2210 tree marker
= NULL_TREE
;
2212 for (jx
= ix
; jx
< len
; jx
++)
2214 tree next
= (*member_vec
)[jx
];
2217 tree next_name
= OVL_NAME (next
);
2218 if (next_name
!= name
)
2225 if (IDENTIFIER_CONV_OP_P (name
))
2228 next
= OVL_CHAIN (next
);
2231 if (TREE_CODE (next
) == USING_DECL
)
2233 if (IDENTIFIER_CTOR_P (name
))
2234 /* Dependent inherited ctor. */
2237 next
= strip_using_decl (next
);
2238 if (TREE_CODE (next
) == USING_DECL
)
2244 if (is_overloaded_fn (next
))
2248 if (DECL_DECLARES_TYPE_P (next
))
2263 current
= ovl_make (to_using
, current
);
2271 current
= stat_hack (current
, to_type
);
2278 OVL_CHAIN (marker
) = current
;
2281 (*member_vec
)[store
++] = current
;
2285 while (store
++ < len
)
2289 /* Add the non-function members to CLASSTYPE_MEMBER_VEC. If there is
2290 no existing MEMBER_VEC and fewer than 8 fields, do nothing. We
2291 know there must be at least 1 field -- the self-reference
2292 TYPE_DECL, except for anon aggregates, which will have at least
2293 one field anyway. If EXTRA < 0, always create the vector. */
2296 set_class_bindings (tree klass
, int extra
)
2298 unsigned n_fields
= count_class_fields (klass
);
2299 vec
<tree
, va_gc
> *member_vec
= CLASSTYPE_MEMBER_VEC (klass
);
2301 if (member_vec
|| n_fields
>= 8 || extra
< 0)
2303 /* Append the new fields. */
2304 vec_safe_reserve_exact (member_vec
, n_fields
+ (extra
>= 0 ? extra
: 0));
2305 member_vec_append_class_fields (member_vec
, klass
);
2310 CLASSTYPE_MEMBER_VEC (klass
) = member_vec
;
2311 member_vec
->qsort (member_name_cmp
);
2312 member_vec_dedup (member_vec
);
2318 /* Insert lately defined enum ENUMTYPE into KLASS for the sorted case. */
2321 insert_late_enum_def_bindings (tree klass
, tree enumtype
)
2324 vec
<tree
, va_gc
> *member_vec
= CLASSTYPE_MEMBER_VEC (klass
);
2326 /* The enum bindings will already be on the TYPE_FIELDS, so don't
2327 count them twice. */
2329 n_fields
= count_class_fields (klass
);
2331 n_fields
= list_length (TYPE_VALUES (enumtype
));
2333 if (member_vec
|| n_fields
>= 8)
2335 vec_safe_reserve_exact (member_vec
, n_fields
);
2336 if (CLASSTYPE_MEMBER_VEC (klass
))
2337 member_vec_append_enum_values (member_vec
, enumtype
);
2339 member_vec_append_class_fields (member_vec
, klass
);
2340 CLASSTYPE_MEMBER_VEC (klass
) = member_vec
;
2341 member_vec
->qsort (member_name_cmp
);
2342 member_vec_dedup (member_vec
);
2346 /* The binding oracle; see cp-tree.h. */
2348 cp_binding_oracle_function
*cp_binding_oracle
;
2350 /* If we have a binding oracle, ask it for all namespace-scoped
2351 definitions of NAME. */
2354 query_oracle (tree name
)
2356 if (!cp_binding_oracle
)
2359 /* LOOKED_UP holds the set of identifiers that we have already
2360 looked up with the oracle. */
2361 static hash_set
<tree
> looked_up
;
2362 if (looked_up
.add (name
))
2365 cp_binding_oracle (CP_ORACLE_IDENTIFIER
, name
);
2368 #ifndef ENABLE_SCOPE_CHECKING
2369 # define ENABLE_SCOPE_CHECKING 0
2371 # define ENABLE_SCOPE_CHECKING 1
2374 /* A free list of "cxx_binding"s, connected by their PREVIOUS. */
2376 static GTY((deletable
)) cxx_binding
*free_bindings
;
2378 /* Initialize VALUE and TYPE field for BINDING, and set the PREVIOUS
2382 cxx_binding_init (cxx_binding
*binding
, tree value
, tree type
)
2384 binding
->value
= value
;
2385 binding
->type
= type
;
2386 binding
->previous
= NULL
;
2389 /* (GC)-allocate a binding object with VALUE and TYPE member initialized. */
2391 static cxx_binding
*
2392 cxx_binding_make (tree value
, tree type
)
2394 cxx_binding
*binding
= free_bindings
;
2397 free_bindings
= binding
->previous
;
2399 binding
= ggc_alloc
<cxx_binding
> ();
2401 /* Clear flags by default. */
2402 LOCAL_BINDING_P (binding
) = false;
2403 INHERITED_VALUE_BINDING_P (binding
) = false;
2404 HIDDEN_TYPE_BINDING_P (binding
) = false;
2406 cxx_binding_init (binding
, value
, type
);
2411 /* Put BINDING back on the free list. */
2414 cxx_binding_free (cxx_binding
*binding
)
2416 binding
->scope
= NULL
;
2417 binding
->previous
= free_bindings
;
2418 free_bindings
= binding
;
2421 /* Create a new binding for NAME (with the indicated VALUE and TYPE
2422 bindings) in the class scope indicated by SCOPE. */
2424 static cxx_binding
*
2425 new_class_binding (tree name
, tree value
, tree type
, cp_binding_level
*scope
)
2427 cp_class_binding cb
= {cxx_binding_make (value
, type
), name
};
2428 cxx_binding
*binding
= cb
.base
;
2429 vec_safe_push (scope
->class_shadowed
, cb
);
2430 binding
->scope
= scope
;
2434 /* Make DECL the innermost binding for ID. The LEVEL is the binding
2435 level at which this declaration is being bound. */
2438 push_binding (tree id
, tree decl
, cp_binding_level
* level
)
2440 cxx_binding
*binding
;
2442 if (level
!= class_binding_level
)
2444 binding
= cxx_binding_make (decl
, NULL_TREE
);
2445 binding
->scope
= level
;
2448 binding
= new_class_binding (id
, decl
, /*type=*/NULL_TREE
, level
);
2450 /* Now, fill in the binding information. */
2451 binding
->previous
= IDENTIFIER_BINDING (id
);
2452 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
2454 /* And put it on the front of the list of bindings for ID. */
2455 IDENTIFIER_BINDING (id
) = binding
;
2458 /* Remove the binding for DECL which should be the innermost binding
2462 pop_local_binding (tree id
, tree decl
)
2464 if (!id
|| IDENTIFIER_ANON_P (id
))
2465 /* It's easiest to write the loops that call this function without
2466 checking whether or not the entities involved have names. We
2467 get here for such an entity. */
2470 /* Get the innermost binding for ID. */
2471 cxx_binding
*binding
= IDENTIFIER_BINDING (id
);
2473 /* The name should be bound. */
2474 gcc_assert (binding
!= NULL
);
2476 /* The DECL will be either the ordinary binding or the type binding
2477 for this identifier. Remove that binding. We don't have to
2478 clear HIDDEN_TYPE_BINDING_P, as the whole binding will be going
2480 if (binding
->value
== decl
)
2481 binding
->value
= NULL_TREE
;
2484 gcc_checking_assert (binding
->type
== decl
);
2485 binding
->type
= NULL_TREE
;
2488 if (!binding
->value
&& !binding
->type
)
2490 /* We're completely done with the innermost binding for this
2491 identifier. Unhook it from the list of bindings. */
2492 IDENTIFIER_BINDING (id
) = binding
->previous
;
2494 /* Add it to the free list. */
2495 cxx_binding_free (binding
);
2499 /* Remove the bindings for the decls of the current level and leave
2500 the current scope. */
2503 pop_bindings_and_leave_scope (void)
2505 for (tree t
= get_local_decls (); t
; t
= DECL_CHAIN (t
))
2507 tree decl
= TREE_CODE (t
) == TREE_LIST
? TREE_VALUE (t
) : t
;
2508 tree name
= OVL_NAME (decl
);
2510 pop_local_binding (name
, decl
);
2516 /* Strip non dependent using declarations. If DECL is dependent,
2517 surreptitiously create a typename_type and return it. */
2520 strip_using_decl (tree decl
)
2522 if (decl
== NULL_TREE
)
2525 while (TREE_CODE (decl
) == USING_DECL
&& !DECL_DEPENDENT_P (decl
))
2526 decl
= USING_DECL_DECLS (decl
);
2528 if (TREE_CODE (decl
) == USING_DECL
&& DECL_DEPENDENT_P (decl
)
2529 && USING_DECL_TYPENAME_P (decl
))
2531 /* We have found a type introduced by a using
2532 declaration at class scope that refers to a dependent
2535 using typename :: [opt] nested-name-specifier unqualified-id ;
2537 decl
= make_typename_type (USING_DECL_SCOPE (decl
),
2539 typename_type
, tf_error
);
2540 if (decl
!= error_mark_node
)
2541 decl
= TYPE_NAME (decl
);
2547 /* Return true if OVL is an overload for an anticipated builtin. */
2550 anticipated_builtin_p (tree ovl
)
2552 return (TREE_CODE (ovl
) == OVERLOAD
2553 && OVL_HIDDEN_P (ovl
)
2554 && DECL_IS_UNDECLARED_BUILTIN (OVL_FUNCTION (ovl
)));
2557 /* BINDING records an existing declaration for a name in the current scope.
2558 But, DECL is another declaration for that same identifier in the
2559 same scope. This is the `struct stat' hack whereby a non-typedef
2560 class name or enum-name can be bound at the same level as some other
2564 A class name (9.1) or enumeration name (7.2) can be hidden by the
2565 name of an object, function, or enumerator declared in the same scope.
2566 If a class or enumeration name and an object, function, or enumerator
2567 are declared in the same scope (in any order) with the same name, the
2568 class or enumeration name is hidden wherever the object, function, or
2569 enumerator name is visible.
2571 It's the responsibility of the caller to check that
2572 inserting this name is valid here. Returns nonzero if the new binding
2576 supplement_binding (cxx_binding
*binding
, tree decl
)
2578 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
2580 tree bval
= binding
->value
;
2582 tree target_bval
= strip_using_decl (bval
);
2583 tree target_decl
= strip_using_decl (decl
);
2585 if (TREE_CODE (target_decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (target_decl
)
2586 && target_decl
!= target_bval
2587 && (TREE_CODE (target_bval
) != TYPE_DECL
2588 /* We allow pushing an enum multiple times in a class
2589 template in order to handle late matching of underlying
2590 type on an opaque-enum-declaration followed by an
2592 || (processing_template_decl
2593 && TREE_CODE (TREE_TYPE (target_decl
)) == ENUMERAL_TYPE
2594 && TREE_CODE (TREE_TYPE (target_bval
)) == ENUMERAL_TYPE
2595 && (dependent_type_p (ENUM_UNDERLYING_TYPE
2596 (TREE_TYPE (target_decl
)))
2597 || dependent_type_p (ENUM_UNDERLYING_TYPE
2598 (TREE_TYPE (target_bval
)))))))
2599 /* The new name is the type name. */
2600 binding
->type
= decl
;
2601 else if (/* TARGET_BVAL is null when push_class_level_binding moves
2602 an inherited type-binding out of the way to make room
2603 for a new value binding. */
2605 /* TARGET_BVAL is error_mark_node when TARGET_DECL's name
2606 has been used in a non-class scope prior declaration.
2607 In that case, we should have already issued a
2608 diagnostic; for graceful error recovery purpose, pretend
2609 this was the intended declaration for that name. */
2610 || target_bval
== error_mark_node
2611 /* If TARGET_BVAL is anticipated but has not yet been
2612 declared, pretend it is not there at all. */
2613 || anticipated_builtin_p (target_bval
))
2614 binding
->value
= decl
;
2615 else if (TREE_CODE (target_bval
) == TYPE_DECL
2616 && DECL_ARTIFICIAL (target_bval
)
2617 && target_decl
!= target_bval
2618 && (TREE_CODE (target_decl
) != TYPE_DECL
2619 || same_type_p (TREE_TYPE (target_decl
),
2620 TREE_TYPE (target_bval
))))
2622 /* The old binding was a type name. It was placed in
2623 VALUE field because it was thought, at the point it was
2624 declared, to be the only entity with such a name. Move the
2625 type name into the type slot; it is now hidden by the new
2627 binding
->type
= bval
;
2628 binding
->value
= decl
;
2629 binding
->value_is_inherited
= false;
2631 else if (TREE_CODE (target_bval
) == TYPE_DECL
2632 && TREE_CODE (target_decl
) == TYPE_DECL
2633 && DECL_NAME (target_decl
) == DECL_NAME (target_bval
)
2634 && binding
->scope
->kind
!= sk_class
2635 && (same_type_p (TREE_TYPE (target_decl
), TREE_TYPE (target_bval
))
2636 /* If either type involves template parameters, we must
2637 wait until instantiation. */
2638 || uses_template_parms (TREE_TYPE (target_decl
))
2639 || uses_template_parms (TREE_TYPE (target_bval
))))
2640 /* We have two typedef-names, both naming the same type to have
2641 the same name. In general, this is OK because of:
2645 In a given scope, a typedef specifier can be used to redefine
2646 the name of any type declared in that scope to refer to the
2647 type to which it already refers.
2649 However, in class scopes, this rule does not apply due to the
2650 stricter language in [class.mem] prohibiting redeclarations of
2653 /* There can be two block-scope declarations of the same variable,
2654 so long as they are `extern' declarations. However, there cannot
2655 be two declarations of the same static data member:
2659 A member shall not be declared twice in the
2660 member-specification. */
2661 else if (VAR_P (target_decl
)
2662 && VAR_P (target_bval
)
2663 && DECL_EXTERNAL (target_decl
) && DECL_EXTERNAL (target_bval
)
2664 && !DECL_CLASS_SCOPE_P (target_decl
))
2666 duplicate_decls (decl
, binding
->value
);
2669 else if (TREE_CODE (decl
) == NAMESPACE_DECL
2670 && TREE_CODE (bval
) == NAMESPACE_DECL
2671 && DECL_NAMESPACE_ALIAS (decl
)
2672 && DECL_NAMESPACE_ALIAS (bval
)
2673 && ORIGINAL_NAMESPACE (bval
) == ORIGINAL_NAMESPACE (decl
))
2674 /* [namespace.alias]
2676 In a declarative region, a namespace-alias-definition can be
2677 used to redefine a namespace-alias declared in that declarative
2678 region to refer only to the namespace to which it already
2681 else if (TREE_CODE (bval
) == USING_DECL
2682 && CONST_DECL_USING_P (decl
))
2683 /* Let the clone hide the using-decl that introduced it. */
2684 binding
->value
= decl
;
2687 if (!error_operand_p (bval
))
2688 diagnose_name_conflict (decl
, bval
);
2695 /* Diagnose a name conflict between DECL and BVAL.
2697 This is non-static so maybe_push_used_methods can use it and avoid changing
2698 the diagnostic for inherit/using4.C; otherwise it should not be used from
2699 outside this file. */
2702 diagnose_name_conflict (tree decl
, tree bval
)
2704 if (TREE_CODE (decl
) == TREE_CODE (bval
)
2705 && TREE_CODE (decl
) != NAMESPACE_DECL
2706 && !DECL_DECLARES_FUNCTION_P (decl
)
2707 && (TREE_CODE (decl
) != TYPE_DECL
2708 || DECL_ARTIFICIAL (decl
) == DECL_ARTIFICIAL (bval
))
2709 && CP_DECL_CONTEXT (decl
) == CP_DECL_CONTEXT (bval
))
2711 if (concept_definition_p (decl
))
2712 error ("redeclaration of %q#D with different template parameters",
2715 error ("redeclaration of %q#D", decl
);
2718 error ("%q#D conflicts with a previous declaration", decl
);
2720 inform (location_of (bval
), "previous declaration %q#D", bval
);
2723 /* Replace BINDING's current value on its scope's name list with
2727 update_local_overload (cxx_binding
*binding
, tree newval
)
2731 for (d
= &binding
->scope
->names
; ; d
= &TREE_CHAIN (*d
))
2732 if (*d
== binding
->value
)
2734 /* Stitch new list node in. */
2735 *d
= tree_cons (DECL_NAME (*d
), NULL_TREE
, TREE_CHAIN (*d
));
2738 else if (TREE_CODE (*d
) == TREE_LIST
&& TREE_VALUE (*d
) == binding
->value
)
2741 TREE_VALUE (*d
) = newval
;
2744 /* Compares the parameter-type-lists of ONE and TWO and
2745 returns false if they are different. If the DECLs are template
2746 functions, the return types and the template parameter lists are
2747 compared too (DR 565). */
2750 matching_fn_p (tree one
, tree two
)
2752 if (TREE_CODE (one
) != TREE_CODE (two
))
2755 if (!compparms (TYPE_ARG_TYPES (TREE_TYPE (one
)),
2756 TYPE_ARG_TYPES (TREE_TYPE (two
))))
2759 if (TREE_CODE (one
) == TEMPLATE_DECL
)
2761 /* Compare template parms. */
2762 if (!comp_template_parms (DECL_TEMPLATE_PARMS (one
),
2763 DECL_TEMPLATE_PARMS (two
)))
2766 /* And return type. */
2767 if (!same_type_p (TREE_TYPE (TREE_TYPE (one
)),
2768 TREE_TYPE (TREE_TYPE (two
))))
2772 if (!equivalently_constrained (one
, two
))
2778 /* Push DECL into nonclass LEVEL BINDING or SLOT. OLD is the current
2779 binding value (possibly with anticipated builtins stripped).
2780 Diagnose conflicts and return updated decl. */
2783 update_binding (cp_binding_level
*level
, cxx_binding
*binding
, tree
*slot
,
2784 tree old
, tree decl
, bool hiding
= false)
2786 tree old_type
= NULL_TREE
;
2787 bool hide_type
= false;
2788 bool hide_value
= false;
2792 old_type
= binding
->type
;
2793 hide_type
= HIDDEN_TYPE_BINDING_P (binding
);
2795 hide_value
= hide_type
, hide_type
= false;
2797 else if (STAT_HACK_P (*slot
))
2799 old_type
= STAT_TYPE (*slot
);
2800 hide_type
= STAT_TYPE_HIDDEN_P (*slot
);
2801 hide_value
= STAT_DECL_HIDDEN_P (*slot
);
2805 tree to_type
= old_type
;
2806 bool local_overload
= false;
2808 gcc_assert (!level
|| level
->kind
== sk_namespace
? !binding
2809 : level
->kind
!= sk_class
&& !slot
);
2811 if (old
== error_mark_node
)
2814 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
2816 /* Pushing an artificial decl. We should not find another
2817 artificial decl here already -- lookup_elaborated_type will
2818 have already found it. */
2819 gcc_checking_assert (!to_type
2820 && !(old
&& DECL_IMPLICIT_TYPEDEF_P (old
)));
2824 /* Put DECL into the type slot. */
2825 gcc_checking_assert (!to_type
);
2831 hide_value
= hiding
;
2836 if (old
&& DECL_IMPLICIT_TYPEDEF_P (old
))
2838 /* OLD is an implicit typedef. Move it to to_type. */
2839 gcc_checking_assert (!to_type
);
2842 hide_type
= hide_value
;
2847 if (DECL_DECLARES_FUNCTION_P (decl
))
2851 else if (OVL_P (old
))
2853 for (ovl_iterator
iter (old
); iter
; ++iter
)
2857 if (iter
.using_p () && matching_fn_p (fn
, decl
))
2859 gcc_checking_assert (!iter
.hidden_p ());
2860 /* If a function declaration in namespace scope or
2861 block scope has the same name and the same
2862 parameter-type- list (8.3.5) as a function
2863 introduced by a using-declaration, and the
2864 declarations do not declare the same function,
2865 the program is ill-formed. [namespace.udecl]/14 */
2866 if (tree match
= duplicate_decls (decl
, fn
, hiding
))
2869 /* FIXME: To preserve existing error behavior, we
2870 still push the decl. This might change. */
2871 diagnose_name_conflict (decl
, fn
);
2878 if (to_type
!= old_type
2880 && MAYBE_CLASS_TYPE_P (TREE_TYPE (to_type
))
2881 && !(DECL_IN_SYSTEM_HEADER (decl
)
2882 && DECL_IN_SYSTEM_HEADER (to_type
)))
2883 warning (OPT_Wshadow
, "%q#D hides constructor for %q#D",
2886 local_overload
= old
&& level
&& level
->kind
!= sk_namespace
;
2887 to_val
= ovl_insert (decl
, old
, -int (hiding
));
2891 if (TREE_CODE (old
) != TREE_CODE (decl
))
2892 /* Different kinds of decls conflict. */
2894 else if (TREE_CODE (old
) == TYPE_DECL
)
2896 if (same_type_p (TREE_TYPE (old
), TREE_TYPE (decl
)))
2897 /* Two type decls to the same type. Do nothing. */
2902 else if (TREE_CODE (old
) == NAMESPACE_DECL
)
2904 /* Two maybe-aliased namespaces. If they're to the same target
2905 namespace, that's ok. */
2906 if (ORIGINAL_NAMESPACE (old
) != ORIGINAL_NAMESPACE (decl
))
2909 /* The new one must be an alias at this point. */
2910 gcc_assert (DECL_NAMESPACE_ALIAS (decl
));
2913 else if (TREE_CODE (old
) == VAR_DECL
)
2915 /* There can be two block-scope declarations of the same
2916 variable, so long as they are `extern' declarations. */
2917 if (!DECL_EXTERNAL (old
) || !DECL_EXTERNAL (decl
))
2919 else if (tree match
= duplicate_decls (decl
, old
))
2921 gcc_checking_assert (!hide_value
&& !hiding
);
2930 diagnose_name_conflict (decl
, old
);
2942 gcc_checking_assert (binding
->value
&& OVL_P (binding
->value
));
2943 update_local_overload (binding
, to_val
);
2946 && !(TREE_CODE (decl
) == NAMESPACE_DECL
2947 && !DECL_NAMESPACE_ALIAS (decl
)))
2948 /* Don't add namespaces here. They're done in
2950 add_decl_to_level (level
, decl
);
2954 if (STAT_HACK_P (*slot
))
2956 STAT_TYPE (*slot
) = to_type
;
2957 STAT_DECL (*slot
) = to_val
;
2958 STAT_TYPE_HIDDEN_P (*slot
) = hide_type
;
2959 STAT_DECL_HIDDEN_P (*slot
) = hide_value
;
2961 else if (to_type
|| hide_value
)
2963 *slot
= stat_hack (to_val
, to_type
);
2964 STAT_TYPE_HIDDEN_P (*slot
) = hide_type
;
2965 STAT_DECL_HIDDEN_P (*slot
) = hide_value
;
2969 gcc_checking_assert (!hide_type
);
2975 binding
->type
= to_type
;
2976 binding
->value
= to_val
;
2977 HIDDEN_TYPE_BINDING_P (binding
) = hide_type
|| hide_value
;
2984 /* Table of identifiers to extern C declarations (or LISTS thereof). */
2986 static GTY(()) hash_table
<named_decl_hash
> *extern_c_decls
;
2988 /* DECL has C linkage. If we have an existing instance, make sure the
2989 new one is compatible. Make sure it has the same exception
2990 specification [7.5, 7.6]. Add DECL to the map. */
2993 check_extern_c_conflict (tree decl
)
2995 /* Ignore artificial or system header decls. */
2996 if (DECL_ARTIFICIAL (decl
) || DECL_IN_SYSTEM_HEADER (decl
))
2999 /* This only applies to decls at namespace scope. */
3000 if (!DECL_NAMESPACE_SCOPE_P (decl
))
3003 if (!extern_c_decls
)
3004 extern_c_decls
= hash_table
<named_decl_hash
>::create_ggc (127);
3006 tree
*slot
= extern_c_decls
3007 ->find_slot_with_hash (DECL_NAME (decl
),
3008 IDENTIFIER_HASH_VALUE (DECL_NAME (decl
)), INSERT
);
3009 if (tree old
= *slot
)
3011 if (TREE_CODE (old
) == OVERLOAD
)
3012 old
= OVL_FUNCTION (old
);
3015 if (DECL_CONTEXT (old
) == DECL_CONTEXT (decl
))
3016 ; /* If they're in the same context, we'll have already complained
3017 about a (possible) mismatch, when inserting the decl. */
3018 else if (!decls_match (decl
, old
))
3020 else if (TREE_CODE (decl
) == FUNCTION_DECL
3021 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (old
)),
3022 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (decl
)),
3025 else if (DECL_ASSEMBLER_NAME_SET_P (old
))
3026 SET_DECL_ASSEMBLER_NAME (decl
, DECL_ASSEMBLER_NAME (old
));
3030 auto_diagnostic_group d
;
3031 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
3032 "conflicting C language linkage declaration %q#D", decl
);
3033 inform (DECL_SOURCE_LOCATION (old
),
3034 "previous declaration %q#D", old
);
3036 inform (DECL_SOURCE_LOCATION (decl
),
3037 "due to different exception specifications");
3042 /* The hash table expects OVERLOADS, so construct one with
3043 OLD as both the function and the chain. This allocate
3044 an excess OVERLOAD node, but it's rare to have multiple
3045 extern "C" decls of the same name. And we save
3046 complicating the hash table logic (which is used
3048 *slot
= ovl_make (old
, old
);
3050 slot
= &OVL_CHAIN (*slot
);
3052 /* Chain it on for c_linkage_binding's use. */
3053 *slot
= tree_cons (NULL_TREE
, decl
, *slot
);
3060 /* Returns a list of C-linkage decls with the name NAME. Used in
3061 c-family/c-pragma.cc to implement redefine_extname pragma. */
3064 c_linkage_bindings (tree name
)
3067 if (tree
*slot
= extern_c_decls
3068 ->find_slot_with_hash (name
, IDENTIFIER_HASH_VALUE (name
), NO_INSERT
))
3070 tree result
= *slot
;
3071 if (TREE_CODE (result
) == OVERLOAD
)
3072 result
= OVL_CHAIN (result
);
3079 /* Subroutine of check_local_shadow. */
3082 inform_shadowed (tree shadowed
)
3084 inform (DECL_SOURCE_LOCATION (shadowed
),
3085 "shadowed declaration is here");
3088 /* DECL is being declared at a local scope. Emit suitable shadow
3092 check_local_shadow (tree decl
)
3094 /* Don't complain about the parms we push and then pop
3095 while tentatively parsing a function declarator. */
3096 if (TREE_CODE (decl
) == PARM_DECL
&& !DECL_CONTEXT (decl
))
3099 /* External decls are something else. */
3100 if (DECL_EXTERNAL (decl
))
3103 tree old
= NULL_TREE
;
3104 cp_binding_level
*old_scope
= NULL
;
3105 if (cxx_binding
*binding
= outer_binding (DECL_NAME (decl
), NULL
, true))
3107 old
= binding
->value
;
3108 old_scope
= binding
->scope
;
3112 && (TREE_CODE (old
) == PARM_DECL
3114 || (TREE_CODE (old
) == TYPE_DECL
3115 && (!DECL_ARTIFICIAL (old
)
3116 || TREE_CODE (decl
) == TYPE_DECL
)))
3117 && DECL_FUNCTION_SCOPE_P (old
)
3118 && (!DECL_ARTIFICIAL (decl
)
3119 || is_capture_proxy (decl
)
3120 || DECL_IMPLICIT_TYPEDEF_P (decl
)
3121 || (VAR_P (decl
) && DECL_ANON_UNION_VAR_P (decl
))))
3123 /* DECL shadows a local thing possibly of interest. */
3125 /* DR 2211: check that captures and parameters
3126 do not have the same name. */
3127 if (is_capture_proxy (decl
))
3129 if (current_lambda_expr ()
3130 && DECL_CONTEXT (old
) == lambda_function (current_lambda_expr ())
3131 && TREE_CODE (old
) == PARM_DECL
3132 && DECL_NAME (decl
) != this_identifier
)
3134 error_at (DECL_SOURCE_LOCATION (old
),
3135 "lambda parameter %qD "
3136 "previously declared as a capture", old
);
3140 /* Don't complain if it's from an enclosing function. */
3141 else if (DECL_CONTEXT (old
) == current_function_decl
3142 && TREE_CODE (decl
) != PARM_DECL
3143 && TREE_CODE (old
) == PARM_DECL
)
3145 /* Go to where the parms should be and see if we find
3147 cp_binding_level
*b
= current_binding_level
->level_chain
;
3149 if (FUNCTION_NEEDS_BODY_BLOCK (current_function_decl
))
3150 /* Skip the ctor/dtor cleanup level. */
3153 /* [basic.scope.param] A parameter name shall not be redeclared
3154 in the outermost block of the function definition. */
3155 if (b
->kind
== sk_function_parms
)
3157 error_at (DECL_SOURCE_LOCATION (decl
),
3158 "declaration of %q#D shadows a parameter", decl
);
3159 inform (DECL_SOURCE_LOCATION (old
),
3160 "%q#D previously declared here", old
);
3165 /* The local structure or class can't use parameters of
3166 the containing function anyway. */
3167 if (DECL_CONTEXT (old
) != current_function_decl
)
3169 for (cp_binding_level
*scope
= current_binding_level
;
3170 scope
!= old_scope
; scope
= scope
->level_chain
)
3171 if (scope
->kind
== sk_class
3172 && !LAMBDA_TYPE_P (scope
->this_entity
))
3175 /* Error if redeclaring a local declared in a
3176 init-statement or in the condition of an if or
3177 switch statement when the new declaration is in the
3178 outermost block of the controlled statement.
3179 Redeclaring a variable from a for or while condition is
3180 detected elsewhere. */
3181 else if (VAR_P (old
)
3182 && old_scope
== current_binding_level
->level_chain
3183 && (old_scope
->kind
== sk_cond
|| old_scope
->kind
== sk_for
))
3185 auto_diagnostic_group d
;
3186 error_at (DECL_SOURCE_LOCATION (decl
),
3187 "redeclaration of %q#D", decl
);
3188 inform (DECL_SOURCE_LOCATION (old
),
3189 "%q#D previously declared here", old
);
3193 3.3.3/3: The name declared in an exception-declaration (...)
3194 shall not be redeclared in the outermost block of the handler.
3195 3.3.3/2: A parameter name shall not be redeclared (...) in
3196 the outermost block of any handler associated with a
3198 3.4.1/15: The function parameter names shall not be redeclared
3199 in the exception-declaration nor in the outermost block of a
3200 handler for the function-try-block. */
3201 else if ((TREE_CODE (old
) == VAR_DECL
3202 && old_scope
== current_binding_level
->level_chain
3203 && old_scope
->kind
== sk_catch
)
3204 || (TREE_CODE (old
) == PARM_DECL
3205 && (current_binding_level
->kind
== sk_catch
3206 || current_binding_level
->level_chain
->kind
== sk_catch
)
3207 && in_function_try_handler
))
3209 auto_diagnostic_group d
;
3210 if (permerror (DECL_SOURCE_LOCATION (decl
),
3211 "redeclaration of %q#D", decl
))
3212 inform (DECL_SOURCE_LOCATION (old
),
3213 "%q#D previously declared here", old
);
3217 /* If '-Wshadow=compatible-local' is specified without other
3218 -Wshadow= flags, we will warn only when the type of the
3219 shadowing variable (DECL) can be converted to that of the
3220 shadowed parameter (OLD_LOCAL). The reason why we only check
3221 if DECL's type can be converted to OLD_LOCAL's type (but not the
3222 other way around) is because when users accidentally shadow a
3223 parameter, more than often they would use the variable
3224 thinking (mistakenly) it's still the parameter. It would be
3225 rare that users would use the variable in the place that
3226 expects the parameter but thinking it's a new decl.
3227 If either object is a TYPE_DECL, '-Wshadow=compatible-local'
3228 warns regardless of whether one of the types involved
3229 is a subclass of the other, since that is never okay. */
3231 enum opt_code warning_code
;
3233 warning_code
= OPT_Wshadow
;
3234 else if ((TREE_CODE (decl
) == TYPE_DECL
)
3235 ^ (TREE_CODE (old
) == TYPE_DECL
))
3236 /* If exactly one is a type, they aren't compatible. */
3237 warning_code
= OPT_Wshadow_local
;
3238 else if ((TREE_TYPE (old
)
3240 && same_type_p (TREE_TYPE (old
), TREE_TYPE (decl
)))
3241 || TREE_CODE (decl
) == TYPE_DECL
3242 || TREE_CODE (old
) == TYPE_DECL
3243 || (!dependent_type_p (TREE_TYPE (decl
))
3244 && !dependent_type_p (TREE_TYPE (old
))
3245 /* If the new decl uses auto, we don't yet know
3246 its type (the old type cannot be using auto
3247 at this point, without also being
3248 dependent). This is an indication we're
3249 (now) doing the shadow checking too
3251 && !type_uses_auto (TREE_TYPE (decl
))
3252 && can_convert_arg (TREE_TYPE (old
), TREE_TYPE (decl
),
3253 decl
, LOOKUP_IMPLICIT
, tf_none
)))
3254 warning_code
= OPT_Wshadow_compatible_local
;
3256 warning_code
= OPT_Wshadow_local
;
3259 if (TREE_CODE (old
) == PARM_DECL
)
3260 msg
= "declaration of %q#D shadows a parameter";
3261 else if (is_capture_proxy (old
))
3262 msg
= "declaration of %qD shadows a lambda capture";
3264 msg
= "declaration of %qD shadows a previous local";
3266 auto_diagnostic_group d
;
3267 if (warning_at (DECL_SOURCE_LOCATION (decl
), warning_code
, msg
, decl
))
3268 inform_shadowed (old
);
3275 /* Don't warn for artificial things that are not implicit typedefs. */
3276 if (DECL_ARTIFICIAL (decl
) && !DECL_IMPLICIT_TYPEDEF_P (decl
))
3279 if (nonlambda_method_basetype ())
3280 if (tree member
= lookup_member (current_nonlambda_class_type (),
3281 DECL_NAME (decl
), /*protect=*/0,
3282 /*want_type=*/false, tf_warning_or_error
))
3284 member
= MAYBE_BASELINK_FUNCTIONS (member
);
3286 /* Warn if a variable shadows a non-function, or the variable
3287 is a function or a pointer-to-function. */
3288 if ((!OVL_P (member
)
3289 || TREE_CODE (decl
) == FUNCTION_DECL
3290 || (TREE_TYPE (decl
)
3291 && (TYPE_PTRFN_P (TREE_TYPE (decl
))
3292 || TYPE_PTRMEMFUNC_P (TREE_TYPE (decl
)))))
3293 && !warning_suppressed_p (decl
, OPT_Wshadow
))
3295 auto_diagnostic_group d
;
3296 if (warning_at (DECL_SOURCE_LOCATION (decl
), OPT_Wshadow
,
3297 "declaration of %qD shadows a member of %qT",
3298 decl
, current_nonlambda_class_type ())
3301 inform_shadowed (member
);
3302 suppress_warning (decl
, OPT_Wshadow
);
3308 /* Now look for a namespace shadow. */
3309 old
= find_namespace_value (current_namespace
, DECL_NAME (decl
));
3312 || (TREE_CODE (old
) == TYPE_DECL
3313 && (!DECL_ARTIFICIAL (old
)
3314 || TREE_CODE (decl
) == TYPE_DECL
)))
3315 && !instantiating_current_function_p ()
3316 && !warning_suppressed_p (decl
, OPT_Wshadow
))
3317 /* XXX shadow warnings in outer-more namespaces */
3319 auto_diagnostic_group d
;
3320 if (warning_at (DECL_SOURCE_LOCATION (decl
), OPT_Wshadow
,
3321 "declaration of %qD shadows a global declaration",
3324 inform_shadowed (old
);
3325 suppress_warning (decl
, OPT_Wshadow
);
3333 /* DECL is being pushed inside function CTX. Set its context, if
3337 set_decl_context_in_fn (tree ctx
, tree decl
)
3339 if (TREE_CODE (decl
) == FUNCTION_DECL
3340 || (VAR_P (decl
) && DECL_EXTERNAL (decl
)))
3341 /* Make sure local externs are marked as such. OMP UDRs really
3342 are nested functions. */
3343 gcc_checking_assert (DECL_LOCAL_DECL_P (decl
)
3344 && (DECL_NAMESPACE_SCOPE_P (decl
)
3345 || (TREE_CODE (decl
) == FUNCTION_DECL
3346 && DECL_OMP_DECLARE_REDUCTION_P (decl
))));
3348 if (!DECL_CONTEXT (decl
)
3349 /* When parsing the parameter list of a function declarator,
3350 don't set DECL_CONTEXT to an enclosing function. */
3351 && !(TREE_CODE (decl
) == PARM_DECL
3352 && parsing_function_declarator ()))
3353 DECL_CONTEXT (decl
) = ctx
;
3356 /* DECL is a local extern decl. Find or create the namespace-scope
3357 decl that it aliases. Also, determines the linkage of DECL. */
3360 push_local_extern_decl_alias (tree decl
)
3362 if (dependent_type_p (TREE_TYPE (decl
))
3363 || (processing_template_decl
3365 && CP_DECL_THREAD_LOCAL_P (decl
)))
3367 /* EH specs were not part of the function type prior to c++17, but
3368 we still can't go pushing dependent eh specs into the namespace. */
3369 if (cxx_dialect
< cxx17
3370 && TREE_CODE (decl
) == FUNCTION_DECL
3371 && (value_dependent_expression_p
3372 (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (decl
)))))
3375 gcc_checking_assert (!DECL_LANG_SPECIFIC (decl
)
3376 || !DECL_TEMPLATE_INFO (decl
));
3377 if (DECL_LANG_SPECIFIC (decl
) && DECL_LOCAL_DECL_ALIAS (decl
))
3378 /* We're instantiating a non-dependent local decl, it already
3382 tree alias
= NULL_TREE
;
3384 if (DECL_SIZE (decl
) && !TREE_CONSTANT (DECL_SIZE (decl
)))
3385 /* Do not let a VLA creep into a namespace. Diagnostic will be
3386 emitted in layout_var_decl later. */
3387 alias
= error_mark_node
;
3390 /* First look for a decl that matches. */
3391 tree ns
= CP_DECL_CONTEXT (decl
);
3392 tree binding
= find_namespace_value (ns
, DECL_NAME (decl
));
3394 if (binding
&& TREE_CODE (binding
) != TREE_LIST
)
3395 for (ovl_iterator
iter (binding
); iter
; ++iter
)
3396 if (decls_match (decl
, *iter
, /*record_versions*/false))
3404 /* No existing namespace-scope decl. Make one. */
3405 alias
= copy_decl (decl
);
3406 if (TREE_CODE (alias
) == FUNCTION_DECL
)
3408 /* Recontextualize the parms. */
3409 for (tree
*chain
= &DECL_ARGUMENTS (alias
);
3410 *chain
; chain
= &DECL_CHAIN (*chain
))
3412 *chain
= copy_decl (*chain
);
3413 DECL_CONTEXT (*chain
) = alias
;
3416 tree type
= TREE_TYPE (alias
);
3417 for (tree args
= TYPE_ARG_TYPES (type
);
3418 args
; args
= TREE_CHAIN (args
))
3419 if (TREE_PURPOSE (args
))
3421 /* There are default args. Lose them. */
3422 tree nargs
= NULL_TREE
;
3423 tree
*chain
= &nargs
;
3424 for (args
= TYPE_ARG_TYPES (type
);
3425 args
; args
= TREE_CHAIN (args
))
3426 if (args
== void_list_node
)
3434 = build_tree_list (NULL_TREE
, TREE_VALUE (args
));
3435 chain
= &TREE_CHAIN (*chain
);
3438 tree fn_type
= build_function_type (TREE_TYPE (type
), nargs
);
3440 fn_type
= apply_memfn_quals
3441 (fn_type
, type_memfn_quals (type
));
3443 fn_type
= build_cp_fntype_variant
3444 (fn_type
, type_memfn_rqual (type
),
3445 TYPE_RAISES_EXCEPTIONS (type
),
3446 TYPE_HAS_LATE_RETURN_TYPE (type
));
3448 TREE_TYPE (alias
) = fn_type
;
3453 /* This is the real thing. */
3454 DECL_LOCAL_DECL_P (alias
) = false;
3456 /* Expected default linkage is from the namespace. */
3457 TREE_PUBLIC (alias
) = TREE_PUBLIC (ns
);
3458 push_nested_namespace (ns
);
3459 alias
= pushdecl (alias
, /* hiding= */true);
3460 pop_nested_namespace (ns
);
3462 && CP_DECL_THREAD_LOCAL_P (decl
)
3463 && alias
!= error_mark_node
)
3464 set_decl_tls_model (alias
, DECL_TLS_MODEL (decl
));
3466 /* Adjust visibility. */
3467 determine_visibility (alias
);
3471 retrofit_lang_decl (decl
);
3472 DECL_LOCAL_DECL_ALIAS (decl
) = alias
;
3475 /* If DECL has non-internal linkage, and we have a module vector,
3476 record it in the appropriate slot. We have already checked for
3480 maybe_record_mergeable_decl (tree
*slot
, tree name
, tree decl
)
3482 if (TREE_CODE (*slot
) != BINDING_VECTOR
)
3485 if (!TREE_PUBLIC (CP_DECL_CONTEXT (decl
)))
3486 /* Member of internal namespace. */
3489 tree not_tmpl
= STRIP_TEMPLATE (decl
);
3490 if ((TREE_CODE (not_tmpl
) == FUNCTION_DECL
3491 || TREE_CODE (not_tmpl
) == VAR_DECL
)
3492 && DECL_THIS_STATIC (not_tmpl
))
3493 /* Internal linkage. */
3496 bool is_attached
= (DECL_LANG_SPECIFIC (not_tmpl
)
3497 && DECL_MODULE_ATTACH_P (not_tmpl
));
3498 tree
*gslot
= get_fixed_binding_slot
3499 (slot
, name
, is_attached
? BINDING_SLOT_PARTITION
: BINDING_SLOT_GLOBAL
,
3505 = BINDING_VECTOR_CLUSTER (*slot
, 0).slots
[BINDING_SLOT_CURRENT
];
3507 if (!STAT_HACK_P (tree (orig
)))
3508 orig
= stat_hack (tree (orig
));
3510 MODULE_BINDING_GLOBAL_P (tree (orig
)) = true;
3513 add_mergeable_namespace_entity (gslot
, decl
);
3516 /* DECL is being pushed. Check whether it hides or ambiguates
3517 something seen as an import. This include decls seen in our own
3518 interface, which is OK. Also, check for merging a
3519 global/partition decl. */
3522 check_module_override (tree decl
, tree mvec
, bool hiding
,
3523 tree scope
, tree name
)
3525 tree match
= NULL_TREE
;
3526 bitmap imports
= get_import_bitmap ();
3527 binding_cluster
*cluster
= BINDING_VECTOR_CLUSTER_BASE (mvec
);
3528 unsigned ix
= BINDING_VECTOR_NUM_CLUSTERS (mvec
);
3530 if (BINDING_VECTOR_SLOTS_PER_CLUSTER
== BINDING_SLOTS_FIXED
)
3536 for (; ix
--; cluster
++)
3537 for (unsigned jx
= 0; jx
!= BINDING_VECTOR_SLOTS_PER_CLUSTER
; jx
++)
3539 /* Are we importing this module? */
3540 if (cluster
->indices
[jx
].span
!= 1)
3542 if (!cluster
->indices
[jx
].base
)
3544 if (!bitmap_bit_p (imports
, cluster
->indices
[jx
].base
))
3547 if (cluster
->slots
[jx
].is_lazy ())
3549 gcc_assert (cluster
->indices
[jx
].span
== 1);
3550 lazy_load_binding (cluster
->indices
[jx
].base
,
3551 scope
, name
, &cluster
->slots
[jx
]);
3553 tree bind
= cluster
->slots
[jx
];
3555 /* Errors could cause there to be nothing. */
3558 if (STAT_HACK_P (bind
))
3559 /* We do not have to check STAT_TYPE here, the xref_tag
3560 machinery deals with that problem. */
3561 bind
= STAT_VISIBLE (bind
);
3563 for (ovl_iterator
iter (bind
); iter
; ++iter
)
3564 if (!iter
.using_p ())
3566 match
= duplicate_decls (decl
, *iter
, hiding
);
3572 if (TREE_PUBLIC (scope
) && TREE_PUBLIC (STRIP_TEMPLATE (decl
))
3573 /* Namespaces are dealt with specially in
3574 make_namespace_finish. */
3575 && !(TREE_CODE (decl
) == NAMESPACE_DECL
&& !DECL_NAMESPACE_ALIAS (decl
)))
3577 /* Look in the appropriate mergeable decl slot. */
3578 tree mergeable
= NULL_TREE
;
3579 if (named_module_p ())
3580 mergeable
= BINDING_VECTOR_CLUSTER (mvec
, BINDING_SLOT_PARTITION
3581 / BINDING_VECTOR_SLOTS_PER_CLUSTER
)
3582 .slots
[BINDING_SLOT_PARTITION
% BINDING_VECTOR_SLOTS_PER_CLUSTER
];
3584 mergeable
= BINDING_VECTOR_CLUSTER (mvec
, 0).slots
[BINDING_SLOT_GLOBAL
];
3586 for (ovl_iterator
iter (mergeable
); iter
; ++iter
)
3588 match
= duplicate_decls (decl
, *iter
, hiding
);
3597 if (match
!= error_mark_node
)
3599 if (named_module_p ())
3600 BINDING_VECTOR_PARTITION_DUPS_P (mvec
) = true;
3602 BINDING_VECTOR_GLOBAL_DUPS_P (mvec
) = true;
3610 /* Record DECL as belonging to the current lexical scope. Check for
3611 errors (such as an incompatible declaration for the same name
3612 already seen in the same scope).
3614 The new binding is hidden if HIDING is true (an anticipated builtin
3617 Returns either DECL or an old decl for the same name. If an old
3618 decl is returned, it may have been smashed to agree with what DECL
3622 pushdecl (tree decl
, bool hiding
)
3624 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
3626 if (decl
== error_mark_node
)
3627 return error_mark_node
;
3629 if (!DECL_TEMPLATE_PARM_P (decl
) && current_function_decl
&& !hiding
)
3630 set_decl_context_in_fn (current_function_decl
, decl
);
3632 /* The binding level we will be pushing into. During local class
3633 pushing, we want to push to the containing scope. */
3634 cp_binding_level
*level
= current_binding_level
;
3635 while (level
->kind
== sk_class
3636 || level
->kind
== sk_cleanup
)
3637 level
= level
->level_chain
;
3639 /* An anonymous namespace has a NULL DECL_NAME, but we still want to
3640 insert it. Other NULL-named decls, not so much. */
3641 tree name
= DECL_NAME (decl
);
3642 if (name
? !IDENTIFIER_ANON_P (name
) : TREE_CODE (decl
) == NAMESPACE_DECL
)
3644 cxx_binding
*binding
= NULL
; /* Local scope binding. */
3645 tree ns
= NULL_TREE
; /* Searched namespace. */
3646 tree
*slot
= NULL
; /* Binding slot in namespace. */
3647 tree
*mslot
= NULL
; /* Current module slot in namespace. */
3648 tree old
= NULL_TREE
;
3650 if (level
->kind
== sk_namespace
)
3652 /* We look in the decl's namespace for an existing
3653 declaration, even though we push into the current
3655 ns
= (DECL_NAMESPACE_SCOPE_P (decl
)
3656 ? CP_DECL_CONTEXT (decl
) : current_namespace
);
3657 /* Create the binding, if this is current namespace, because
3658 that's where we'll be pushing anyway. */
3659 slot
= find_namespace_slot (ns
, name
, ns
== current_namespace
);
3662 mslot
= get_fixed_binding_slot (slot
, name
, BINDING_SLOT_CURRENT
,
3663 ns
== current_namespace
);
3664 old
= MAYBE_STAT_DECL (*mslot
);
3669 binding
= find_local_binding (level
, name
);
3671 old
= binding
->value
;
3674 if (old
== error_mark_node
)
3677 for (ovl_iterator
iter (old
); iter
; ++iter
)
3678 if (iter
.using_p ())
3679 ; /* Ignore using decls here. */
3680 else if (iter
.hidden_p ()
3681 && TREE_CODE (*iter
) == FUNCTION_DECL
3682 && DECL_LANG_SPECIFIC (*iter
)
3683 && DECL_MODULE_IMPORT_P (*iter
))
3684 ; /* An undeclared builtin imported from elsewhere. */
3686 = duplicate_decls (decl
, *iter
, hiding
, iter
.hidden_p ()))
3688 if (match
== error_mark_node
)
3690 else if (TREE_CODE (match
) == TYPE_DECL
)
3691 gcc_checking_assert (REAL_IDENTIFIER_TYPE_VALUE (name
)
3692 == (level
->kind
== sk_namespace
3693 ? NULL_TREE
: TREE_TYPE (match
)));
3694 else if (iter
.hidden_p () && !hiding
)
3696 /* Unhiding a previously hidden decl. */
3697 tree head
= iter
.reveal_node (old
);
3700 gcc_checking_assert (ns
);
3701 if (STAT_HACK_P (*slot
))
3702 STAT_DECL (*slot
) = head
;
3706 if (DECL_EXTERN_C_P (match
))
3707 /* We need to check and register the decl now. */
3708 check_extern_c_conflict (match
);
3710 else if (slot
&& !hiding
3711 && STAT_HACK_P (*slot
) && STAT_DECL_HIDDEN_P (*slot
))
3713 /* Unhide the non-function. */
3714 gcc_checking_assert (old
== match
);
3715 if (!STAT_TYPE (*slot
))
3718 STAT_DECL (*slot
) = match
;
3723 /* Check for redeclaring an import. */
3724 if (slot
&& *slot
&& TREE_CODE (*slot
) == BINDING_VECTOR
)
3726 = check_module_override (decl
, *slot
, hiding
, ns
, name
))
3728 if (match
== error_mark_node
)
3731 /* We found a decl in an interface, push it into this
3733 decl
= update_binding (NULL
, binding
, mslot
, old
,
3739 /* We are pushing a new decl. */
3741 /* Skip a hidden builtin we failed to match already. There can
3743 if (old
&& anticipated_builtin_p (old
))
3744 old
= OVL_CHAIN (old
);
3746 check_template_shadow (decl
);
3748 if (DECL_DECLARES_FUNCTION_P (decl
))
3750 check_default_args (decl
);
3754 if (level
->kind
!= sk_namespace
)
3756 /* In a local class, a friend function declaration must
3757 find a matching decl in the innermost non-class scope.
3758 [class.friend/11] */
3759 error_at (DECL_SOURCE_LOCATION (decl
),
3760 "friend declaration %qD in local class without "
3761 "prior local declaration", decl
);
3762 /* Don't attempt to push it. */
3763 return error_mark_node
;
3768 if (level
->kind
!= sk_namespace
)
3770 check_local_shadow (decl
);
3772 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3773 /* A local namespace alias. */
3774 set_identifier_type_value_with_scope (name
, NULL_TREE
, level
);
3777 binding
= create_local_binding (level
, name
);
3781 ns
= current_namespace
;
3782 slot
= find_namespace_slot (ns
, name
, true);
3783 mslot
= get_fixed_binding_slot (slot
, name
, BINDING_SLOT_CURRENT
, true);
3784 /* Update OLD to reflect the namespace we're going to be
3786 old
= MAYBE_STAT_DECL (*mslot
);
3789 old
= update_binding (level
, binding
, mslot
, old
, decl
, hiding
);
3792 /* An existing decl matched, use it. */
3796 if (TREE_CODE (decl
) == TYPE_DECL
)
3798 tree type
= TREE_TYPE (decl
);
3800 if (type
!= error_mark_node
)
3802 if (TYPE_NAME (type
) != decl
)
3803 set_underlying_type (decl
);
3805 set_identifier_type_value_with_scope (name
, decl
, level
);
3807 if (level
->kind
!= sk_namespace
3808 && !instantiating_current_function_p ())
3809 /* This is a locally defined typedef in a function that
3810 is not a template instantation, record it to implement
3811 -Wunused-local-typedefs. */
3812 record_locally_defined_typedef (decl
);
3815 else if (VAR_OR_FUNCTION_DECL_P (decl
))
3817 if (DECL_EXTERN_C_P (decl
))
3818 check_extern_c_conflict (decl
);
3820 if (!DECL_LOCAL_DECL_P (decl
)
3822 maybe_register_incomplete_var (decl
);
3824 if (DECL_LOCAL_DECL_P (decl
)
3825 && NAMESPACE_SCOPE_P (decl
))
3826 push_local_extern_decl_alias (decl
);
3829 if (level
->kind
== sk_namespace
3830 && TREE_PUBLIC (level
->this_entity
)
3832 maybe_record_mergeable_decl (slot
, name
, decl
);
3836 add_decl_to_level (level
, decl
);
3841 /* A mergeable entity is being loaded into namespace NS slot NAME.
3842 Create and return the appropriate vector slot for that. Either a
3843 GMF slot or a module-specific one. */
3846 mergeable_namespace_slots (tree ns
, tree name
, bool is_attached
, tree
*vec
)
3848 tree
*mslot
= find_namespace_slot (ns
, name
, true);
3849 tree
*vslot
= get_fixed_binding_slot
3850 (mslot
, name
, is_attached
? BINDING_SLOT_PARTITION
: BINDING_SLOT_GLOBAL
,
3853 gcc_checking_assert (TREE_CODE (*mslot
) == BINDING_VECTOR
);
3859 /* DECL is a new mergeable namespace-scope decl. Add it to the
3860 mergeable entities on GSLOT. */
3863 add_mergeable_namespace_entity (tree
*gslot
, tree decl
)
3865 *gslot
= ovl_make (decl
, *gslot
);
3868 /* A mergeable entity of KLASS called NAME is being loaded. Return
3869 the set of things it could be. All such non-as_base classes have
3870 been given a member vec. */
3873 lookup_class_binding (tree klass
, tree name
)
3875 tree found
= NULL_TREE
;
3877 if (!COMPLETE_TYPE_P (klass
))
3879 else if (TYPE_LANG_SPECIFIC (klass
))
3881 vec
<tree
, va_gc
> *member_vec
= CLASSTYPE_MEMBER_VEC (klass
);
3883 found
= member_vec_binary_search (member_vec
, name
);
3886 else if (STAT_HACK_P (found
))
3887 /* Rearrange the stat hack so that we don't need to expose that
3889 found
= ovl_make (STAT_TYPE (found
), STAT_DECL (found
));
3890 else if (IDENTIFIER_CONV_OP_P (name
))
3892 gcc_checking_assert (name
== conv_op_identifier
);
3893 found
= OVL_CHAIN (found
);
3898 gcc_checking_assert (IS_FAKE_BASE_TYPE (klass
)
3899 || TYPE_PTRMEMFUNC_P (klass
));
3900 found
= fields_linear_search (klass
, name
, false);
3906 /* Given a namespace-level binding BINDING, walk it, calling CALLBACK
3907 for all decls of the current module. When partitions are involved,
3908 decls might be mentioned more than once. Return the accumulation of
3909 CALLBACK results. */
3912 walk_module_binding (tree binding
, bitmap partitions
,
3913 bool (*callback
) (tree decl
, WMB_Flags
, void *data
),
3916 // FIXME: We don't quite deal with using decls naming stat hack
3917 // type. Also using decls exporting something from the same scope.
3918 tree current
= binding
;
3921 if (TREE_CODE (binding
) == BINDING_VECTOR
)
3922 current
= BINDING_VECTOR_CLUSTER (binding
, 0).slots
[BINDING_SLOT_CURRENT
];
3924 bool decl_hidden
= false;
3925 if (tree type
= MAYBE_STAT_TYPE (current
))
3927 WMB_Flags flags
= WMB_None
;
3928 if (STAT_TYPE_HIDDEN_P (current
))
3929 flags
= WMB_Flags (flags
| WMB_Hidden
);
3930 count
+= callback (type
, flags
, data
);
3931 decl_hidden
= STAT_DECL_HIDDEN_P (current
);
3934 for (ovl_iterator
iter (MAYBE_STAT_DECL (current
)); iter
; ++iter
)
3936 if (iter
.hidden_p ())
3938 if (!(decl_hidden
&& DECL_IS_UNDECLARED_BUILTIN (*iter
)))
3940 WMB_Flags flags
= WMB_None
;
3942 flags
= WMB_Flags (flags
| WMB_Hidden
);
3943 if (iter
.using_p ())
3945 flags
= WMB_Flags (flags
| WMB_Using
);
3946 if (iter
.exporting_p ())
3947 flags
= WMB_Flags (flags
| WMB_Export
);
3949 count
+= callback (*iter
, flags
, data
);
3951 decl_hidden
= false;
3954 if (partitions
&& TREE_CODE (binding
) == BINDING_VECTOR
)
3956 /* Process partition slots. */
3957 binding_cluster
*cluster
= BINDING_VECTOR_CLUSTER_BASE (binding
);
3958 unsigned ix
= BINDING_VECTOR_NUM_CLUSTERS (binding
);
3959 if (BINDING_VECTOR_SLOTS_PER_CLUSTER
== BINDING_SLOTS_FIXED
)
3965 bool maybe_dups
= BINDING_VECTOR_PARTITION_DUPS_P (binding
);
3967 for (; ix
--; cluster
++)
3968 for (unsigned jx
= 0; jx
!= BINDING_VECTOR_SLOTS_PER_CLUSTER
; jx
++)
3969 if (!cluster
->slots
[jx
].is_lazy ())
3970 if (tree bind
= cluster
->slots
[jx
])
3972 if (TREE_CODE (bind
) == NAMESPACE_DECL
3973 && !DECL_NAMESPACE_ALIAS (bind
))
3975 if (unsigned base
= cluster
->indices
[jx
].base
)
3976 if (unsigned span
= cluster
->indices
[jx
].span
)
3978 if (bitmap_bit_p (partitions
, base
))
3980 while (++base
, --span
);
3981 /* Not a partition's namespace. */
3985 WMB_Flags flags
= WMB_None
;
3987 flags
= WMB_Flags (flags
| WMB_Dups
);
3988 count
+= callback (bind
, flags
, data
);
3990 else if (STAT_HACK_P (bind
) && MODULE_BINDING_PARTITION_P (bind
))
3992 if (tree btype
= STAT_TYPE (bind
))
3994 WMB_Flags flags
= WMB_None
;
3996 flags
= WMB_Flags (flags
| WMB_Dups
);
3997 if (STAT_TYPE_HIDDEN_P (bind
))
3998 flags
= WMB_Flags (flags
| WMB_Hidden
);
4000 count
+= callback (btype
, flags
, data
);
4002 bool hidden
= STAT_DECL_HIDDEN_P (bind
);
4003 for (ovl_iterator
iter (MAYBE_STAT_DECL (STAT_DECL (bind
)));
4006 if (iter
.hidden_p ())
4009 (!(hidden
&& DECL_IS_UNDECLARED_BUILTIN (*iter
)));
4011 WMB_Flags flags
= WMB_None
;
4013 flags
= WMB_Flags (flags
| WMB_Dups
);
4015 flags
= WMB_Flags (flags
| WMB_Hidden
);
4016 if (iter
.using_p ())
4018 flags
= WMB_Flags (flags
| WMB_Using
);
4019 if (iter
.exporting_p ())
4020 flags
= WMB_Flags (flags
| WMB_Export
);
4022 count
+= callback (*iter
, flags
, data
);
4032 /* Imported module MOD has a binding to NS::NAME, stored in section
4036 import_module_binding (tree ns
, tree name
, unsigned mod
, unsigned snum
)
4038 tree
*slot
= find_namespace_slot (ns
, name
, true);
4039 binding_slot
*mslot
= append_imported_binding_slot (slot
, name
, mod
);
4041 if (mslot
->is_lazy () || *mslot
)
4042 /* Oops, something was already there. */
4045 mslot
->set_lazy (snum
);
4049 /* An import of MODULE is binding NS::NAME. There should be no
4050 existing binding for >= MODULE. MOD_GLOB indicates whether MODULE
4051 is a header_unit (-1) or part of the current module (+1). VALUE
4052 and TYPE are the value and type bindings. VISIBLE are the value
4053 bindings being exported. */
4056 set_module_binding (tree ns
, tree name
, unsigned mod
, int mod_glob
,
4057 tree value
, tree type
, tree visible
)
4060 /* Bogus BMIs could give rise to nothing to bind. */
4063 gcc_assert (TREE_CODE (value
) != NAMESPACE_DECL
4064 || DECL_NAMESPACE_ALIAS (value
));
4065 gcc_checking_assert (mod
);
4067 tree
*slot
= find_namespace_slot (ns
, name
, true);
4068 binding_slot
*mslot
= search_imported_binding_slot (slot
, mod
);
4070 if (!mslot
|| !mslot
->is_lazy ())
4071 /* Again, bogus BMI could give find to missing or already loaded slot. */
4075 if (type
|| visible
!= bind
|| mod_glob
)
4077 bind
= stat_hack (bind
, type
);
4078 STAT_VISIBLE (bind
) = visible
;
4079 if ((mod_glob
> 0 && TREE_PUBLIC (ns
))
4080 || (type
&& DECL_MODULE_EXPORT_P (type
)))
4081 STAT_TYPE_VISIBLE_P (bind
) = true;
4084 /* Note if this is this-module or global binding. */
4086 MODULE_BINDING_PARTITION_P (bind
) = true;
4087 else if (mod_glob
< 0)
4088 MODULE_BINDING_GLOBAL_P (bind
) = true;
4096 add_module_namespace_decl (tree ns
, tree decl
)
4098 gcc_assert (!DECL_CHAIN (decl
));
4099 gcc_checking_assert (!(VAR_OR_FUNCTION_DECL_P (decl
)
4100 && DECL_LOCAL_DECL_P (decl
)));
4102 /* Expensive already-there? check. */
4103 for (auto probe
= NAMESPACE_LEVEL (ns
)->names
; probe
;
4104 probe
= DECL_CHAIN (probe
))
4105 gcc_assert (decl
!= probe
);
4107 add_decl_to_level (NAMESPACE_LEVEL (ns
), decl
);
4110 maybe_register_incomplete_var (decl
);
4112 if (VAR_OR_FUNCTION_DECL_P (decl
)
4113 && DECL_EXTERN_C_P (decl
))
4114 check_extern_c_conflict (decl
);
4117 /* Enter DECL into the symbol table, if that's appropriate. Returns
4118 DECL, or a modified version thereof. */
4121 maybe_push_decl (tree decl
)
4123 tree type
= TREE_TYPE (decl
);
4125 /* Add this decl to the current binding level, but not if it comes
4126 from another scope, e.g. a static member variable. TEM may equal
4127 DECL or it may be a previous decl of the same name. */
4128 if (decl
== error_mark_node
4129 || (TREE_CODE (decl
) != PARM_DECL
4130 && DECL_CONTEXT (decl
) != NULL_TREE
4131 /* Definitions of namespace members outside their namespace are
4133 && !DECL_NAMESPACE_SCOPE_P (decl
))
4134 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4135 || type
== unknown_type_node
4136 /* The declaration of a template specialization does not affect
4137 the functions available for overload resolution, so we do not
4139 || (TREE_CODE (decl
) == FUNCTION_DECL
4140 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4143 return pushdecl (decl
);
4146 /* Bind DECL to ID in the current_binding_level, assumed to be a local
4147 binding level. If IS_USING is true, DECL got here through a
4148 using-declaration. */
4151 push_local_binding (tree id
, tree decl
, bool is_using
)
4153 /* Skip over any local classes. This makes sense if we call
4154 push_local_binding with a friend decl of a local class. */
4155 cp_binding_level
*b
= innermost_nonclass_level ();
4157 gcc_assert (b
->kind
!= sk_namespace
);
4158 if (find_local_binding (b
, id
))
4160 /* Supplement the existing binding. */
4161 if (!supplement_binding (IDENTIFIER_BINDING (id
), decl
))
4162 /* It didn't work. Something else must be bound at this
4163 level. Do not add DECL to the list of things to pop
4168 /* Create a new binding. */
4169 push_binding (id
, decl
, b
);
4171 if (TREE_CODE (decl
) == OVERLOAD
|| is_using
)
4172 /* We must put the OVERLOAD or using into a TREE_LIST since we
4173 cannot use the decl's chain itself. */
4174 decl
= build_tree_list (id
, decl
);
4176 /* And put DECL on the list of things declared by the current
4178 add_decl_to_level (b
, decl
);
4182 /* true means unconditionally make a BLOCK for the next level pushed. */
4184 static bool keep_next_level_flag
;
4186 static int binding_depth
= 0;
4193 for (i
= 0; i
< depth
* 2; i
++)
4197 /* Return a string describing the kind of SCOPE we have. */
4199 cp_binding_level_descriptor (cp_binding_level
*scope
)
4201 /* The order of this table must match the "scope_kind"
4203 static const char* scope_kind_names
[] = {
4209 "function-parameter-scope",
4212 "template-parameter-scope",
4213 "template-explicit-spec-scope"
4215 const scope_kind kind
= scope
->explicit_spec_p
4216 ? sk_template_spec
: scope
->kind
;
4218 return scope_kind_names
[kind
];
4221 /* Output a debugging information about SCOPE when performing
4224 cp_binding_level_debug (cp_binding_level
*scope
, int line
, const char *action
)
4226 const char *desc
= cp_binding_level_descriptor (scope
);
4227 if (scope
->this_entity
)
4228 verbatim ("%s %<%s(%E)%> %p %d", action
, desc
,
4229 scope
->this_entity
, (void *) scope
, line
);
4231 verbatim ("%s %s %p %d", action
, desc
, (void *) scope
, line
);
4234 /* A chain of binding_level structures awaiting reuse. */
4236 static GTY((deletable
)) cp_binding_level
*free_binding_level
;
4238 /* Insert SCOPE as the innermost binding level. */
4241 push_binding_level (cp_binding_level
*scope
)
4243 /* Add it to the front of currently active scopes stack. */
4244 scope
->level_chain
= current_binding_level
;
4245 current_binding_level
= scope
;
4246 keep_next_level_flag
= false;
4248 if (ENABLE_SCOPE_CHECKING
)
4250 scope
->binding_depth
= binding_depth
;
4251 indent (binding_depth
);
4252 cp_binding_level_debug (scope
, LOCATION_LINE (input_location
),
4258 /* Create a new KIND scope and make it the top of the active scopes stack.
4259 ENTITY is the scope of the associated C++ entity (namespace, class,
4260 function, C++0x enumeration); it is NULL otherwise. */
4263 begin_scope (scope_kind kind
, tree entity
)
4265 cp_binding_level
*scope
;
4267 /* Reuse or create a struct for this binding level. */
4268 if (!ENABLE_SCOPE_CHECKING
&& free_binding_level
)
4270 scope
= free_binding_level
;
4271 free_binding_level
= scope
->level_chain
;
4272 memset (scope
, 0, sizeof (cp_binding_level
));
4275 scope
= ggc_cleared_alloc
<cp_binding_level
> ();
4277 scope
->this_entity
= entity
;
4278 scope
->more_cleanups_ok
= true;
4285 case sk_template_spec
:
4286 scope
->explicit_spec_p
= true;
4287 kind
= sk_template_parms
;
4289 case sk_template_parms
:
4296 case sk_scoped_enum
:
4297 case sk_transaction
:
4300 scope
->keep
= keep_next_level_flag
;
4303 case sk_function_parms
:
4304 scope
->keep
= keep_next_level_flag
;
4308 NAMESPACE_LEVEL (entity
) = scope
;
4312 /* Should not happen. */
4318 push_binding_level (scope
);
4323 /* We're about to leave current scope. Pop the top of the stack of
4324 currently active scopes. Return the enclosing scope, now active. */
4329 cp_binding_level
*scope
= current_binding_level
;
4331 if (scope
->kind
== sk_namespace
&& class_binding_level
)
4332 current_binding_level
= class_binding_level
;
4334 /* We cannot leave a scope, if there are none left. */
4335 if (NAMESPACE_LEVEL (global_namespace
))
4336 gcc_assert (!global_scope_p (scope
));
4338 if (ENABLE_SCOPE_CHECKING
)
4340 indent (--binding_depth
);
4341 cp_binding_level_debug (scope
, LOCATION_LINE (input_location
),
4345 /* Move one nesting level up. */
4346 current_binding_level
= scope
->level_chain
;
4348 /* Namespace-scopes are left most probably temporarily, not
4349 completely; they can be reopened later, e.g. in namespace-extension
4350 or any name binding activity that requires us to resume a
4351 namespace. For classes, we cache some binding levels. For other
4352 scopes, we just make the structure available for reuse. */
4353 if (scope
->kind
!= sk_namespace
4354 && scope
!= previous_class_level
)
4356 scope
->level_chain
= free_binding_level
;
4357 gcc_assert (!ENABLE_SCOPE_CHECKING
4358 || scope
->binding_depth
== binding_depth
);
4359 free_binding_level
= scope
;
4362 if (scope
->kind
== sk_class
)
4364 /* Reset DEFINING_CLASS_P to allow for reuse of a
4365 class-defining scope in a non-defining context. */
4366 scope
->defining_class_p
= 0;
4368 /* Find the innermost enclosing class scope, and reset
4369 CLASS_BINDING_LEVEL appropriately. */
4370 class_binding_level
= NULL
;
4371 for (scope
= current_binding_level
; scope
; scope
= scope
->level_chain
)
4372 if (scope
->kind
== sk_class
)
4374 class_binding_level
= scope
;
4379 return current_binding_level
;
4382 /* When we exit a toplevel class scope, we save its binding level so
4383 that we can restore it quickly. Here, we've entered some other
4384 class, so we must invalidate our cache. */
4387 invalidate_class_lookup_cache (void)
4389 previous_class_level
->level_chain
= free_binding_level
;
4390 free_binding_level
= previous_class_level
;
4391 previous_class_level
= NULL
;
4395 resume_scope (cp_binding_level
* b
)
4397 /* Resuming binding levels is meant only for namespaces,
4398 and those cannot nest into classes. */
4399 gcc_assert (!class_binding_level
);
4400 /* Also, resuming a non-directly nested namespace is a no-no. */
4401 gcc_assert (b
->level_chain
== current_binding_level
);
4402 current_binding_level
= b
;
4403 if (ENABLE_SCOPE_CHECKING
)
4405 b
->binding_depth
= binding_depth
;
4406 indent (binding_depth
);
4407 cp_binding_level_debug (b
, LOCATION_LINE (input_location
), "resume");
4412 /* Return the innermost binding level that is not for a class scope. */
4414 static cp_binding_level
*
4415 innermost_nonclass_level (void)
4417 cp_binding_level
*b
;
4419 b
= current_binding_level
;
4420 while (b
->kind
== sk_class
)
4426 /* We're defining an object of type TYPE. If it needs a cleanup, but
4427 we're not allowed to add any more objects with cleanups to the current
4428 scope, create a new binding level. */
4431 maybe_push_cleanup_level (tree type
)
4433 if (type
!= error_mark_node
4434 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
4435 && current_binding_level
->more_cleanups_ok
== 0)
4437 begin_scope (sk_cleanup
, NULL
);
4438 current_binding_level
->statement_list
= push_stmt_list ();
4442 /* Return true if we are in the global binding level. */
4445 global_bindings_p (void)
4447 return global_scope_p (current_binding_level
);
4450 /* True if we are currently in a toplevel binding level. This
4451 means either the global binding level or a namespace in a toplevel
4452 binding level. Since there are no non-toplevel namespace levels,
4453 this really means any namespace or template parameter level. We
4454 also include a class whose context is toplevel. */
4457 toplevel_bindings_p (void)
4459 cp_binding_level
*b
= innermost_nonclass_level ();
4461 return b
->kind
== sk_namespace
|| b
->kind
== sk_template_parms
;
4464 /* True if this is a namespace scope, or if we are defining a class
4465 which is itself at namespace scope, or whose enclosing class is
4466 such a class, etc. */
4469 namespace_bindings_p (void)
4471 cp_binding_level
*b
= innermost_nonclass_level ();
4473 return b
->kind
== sk_namespace
;
4476 /* True if the innermost non-class scope is a block scope. */
4479 local_bindings_p (void)
4481 cp_binding_level
*b
= innermost_nonclass_level ();
4482 return b
->kind
< sk_function_parms
|| b
->kind
== sk_omp
;
4485 /* True if the current level needs to have a BLOCK made. */
4490 return (current_binding_level
->blocks
!= NULL_TREE
4491 || current_binding_level
->keep
4492 || current_binding_level
->kind
== sk_cleanup
4493 || current_binding_level
->names
!= NULL_TREE
4494 || current_binding_level
->using_directives
);
4497 /* Returns the kind of the innermost scope. */
4500 innermost_scope_kind (void)
4502 return current_binding_level
->kind
;
4505 /* Returns true if this scope was created to store template parameters. */
4508 template_parm_scope_p (void)
4510 return innermost_scope_kind () == sk_template_parms
;
4513 /* If KEEP is true, make a BLOCK node for the next binding level,
4514 unconditionally. Otherwise, use the normal logic to decide whether
4515 or not to create a BLOCK. */
4518 keep_next_level (bool keep
)
4520 keep_next_level_flag
= keep
;
4523 /* Return the list of declarations of the current local scope. */
4526 get_local_decls (void)
4528 gcc_assert (current_binding_level
->kind
!= sk_namespace
4529 && current_binding_level
->kind
!= sk_class
);
4530 return current_binding_level
->names
;
4533 /* Return how many function prototypes we are currently nested inside. */
4536 function_parm_depth (void)
4539 cp_binding_level
*b
;
4541 for (b
= current_binding_level
;
4542 b
->kind
== sk_function_parms
;
4549 /* For debugging. */
4550 static int no_print_functions
= 0;
4551 static int no_print_builtins
= 0;
4554 print_binding_level (cp_binding_level
* lvl
)
4558 if (lvl
->this_entity
)
4559 print_node_brief (stderr
, "entity=", lvl
->this_entity
, 1);
4560 fprintf (stderr
, " blocks=%p", (void *) lvl
->blocks
);
4561 if (lvl
->more_cleanups_ok
)
4562 fprintf (stderr
, " more-cleanups-ok");
4563 if (lvl
->have_cleanups
)
4564 fprintf (stderr
, " have-cleanups");
4565 fprintf (stderr
, "\n");
4568 fprintf (stderr
, " names:\t");
4569 /* We can probably fit 3 names to a line? */
4570 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
4572 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
4574 if (no_print_builtins
4575 && (TREE_CODE (t
) == TYPE_DECL
)
4576 && DECL_IS_UNDECLARED_BUILTIN (t
))
4579 /* Function decls tend to have longer names. */
4580 if (TREE_CODE (t
) == FUNCTION_DECL
)
4587 fprintf (stderr
, "\n\t");
4590 print_node_brief (stderr
, "", t
, 0);
4591 if (t
== error_mark_node
)
4595 fprintf (stderr
, "\n");
4597 if (vec_safe_length (lvl
->class_shadowed
))
4600 cp_class_binding
*b
;
4601 fprintf (stderr
, " class-shadowed:");
4602 FOR_EACH_VEC_ELT (*lvl
->class_shadowed
, i
, b
)
4603 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (b
->identifier
));
4604 fprintf (stderr
, "\n");
4606 if (lvl
->type_shadowed
)
4608 fprintf (stderr
, " type-shadowed:");
4609 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
4611 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
4613 fprintf (stderr
, "\n");
4618 debug (cp_binding_level
&ref
)
4620 print_binding_level (&ref
);
4624 debug (cp_binding_level
*ptr
)
4629 fprintf (stderr
, "<nil>\n");
4633 print_other_binding_stack (cp_binding_level
*stack
)
4635 cp_binding_level
*level
;
4636 for (level
= stack
; !global_scope_p (level
); level
= level
->level_chain
)
4638 fprintf (stderr
, "binding level %p\n", (void *) level
);
4639 print_binding_level (level
);
4644 print_binding_stack (void)
4646 cp_binding_level
*b
;
4647 fprintf (stderr
, "current_binding_level=%p\n"
4648 "class_binding_level=%p\n"
4649 "NAMESPACE_LEVEL (global_namespace)=%p\n",
4650 (void *) current_binding_level
, (void *) class_binding_level
,
4651 (void *) NAMESPACE_LEVEL (global_namespace
));
4652 if (class_binding_level
)
4654 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
4655 if (b
== current_binding_level
)
4658 b
= class_binding_level
;
4660 b
= current_binding_level
;
4663 b
= current_binding_level
;
4664 print_other_binding_stack (b
);
4665 fprintf (stderr
, "global:\n");
4666 print_binding_level (NAMESPACE_LEVEL (global_namespace
));
4669 /* Push a definition of struct, union or enum tag named ID. into
4670 binding_level B. DECL is a TYPE_DECL for the type. DECL has
4671 already been pushed into its binding level. This is bookkeeping to
4675 set_identifier_type_value_with_scope (tree id
, tree decl
, cp_binding_level
*b
)
4677 if (b
->kind
== sk_namespace
)
4678 /* At namespace scope we should not see an identifier type value. */
4679 gcc_checking_assert (!REAL_IDENTIFIER_TYPE_VALUE (id
)
4680 /* We could be pushing a friend underneath a template
4681 parm (ill-formed). */
4683 (TYPE_NAME (REAL_IDENTIFIER_TYPE_VALUE (id
)))));
4686 /* Push the current type value, so we can restore it later */
4687 tree old
= REAL_IDENTIFIER_TYPE_VALUE (id
);
4688 b
->type_shadowed
= tree_cons (id
, old
, b
->type_shadowed
);
4689 tree type
= decl
? TREE_TYPE (decl
) : NULL_TREE
;
4690 TREE_TYPE (b
->type_shadowed
) = type
;
4691 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
4695 /* As set_identifier_type_value_with_scope, but using
4696 current_binding_level. */
4699 set_identifier_type_value (tree id
, tree decl
)
4701 set_identifier_type_value_with_scope (id
, decl
, current_binding_level
);
4704 /* Return the name for the constructor (or destructor) for the
4708 constructor_name (tree type
)
4710 tree decl
= TYPE_NAME (TYPE_MAIN_VARIANT (type
));
4712 return decl
? DECL_NAME (decl
) : NULL_TREE
;
4715 /* Returns TRUE if NAME is the name for the constructor for TYPE,
4716 which must be a class type. */
4719 constructor_name_p (tree name
, tree type
)
4721 gcc_assert (MAYBE_CLASS_TYPE_P (type
));
4723 /* These don't have names. */
4724 if (TREE_CODE (type
) == DECLTYPE_TYPE
4725 || TREE_CODE (type
) == TYPEOF_TYPE
)
4728 if (name
&& name
== constructor_name (type
))
4734 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4735 caller to set DECL_CONTEXT properly.
4737 Warning: For class and block-scope this must only be used when X
4738 will be the new innermost binding for its name, as we tack it onto
4739 the front of IDENTIFIER_BINDING without checking to see if the
4740 current IDENTIFIER_BINDING comes from a closer binding level than
4743 Warning: For namespace scope, this will look in LEVEL for an
4744 existing binding to match, but if not found will push the decl into
4745 CURRENT_NAMESPACE. Use push_nested_namespace/pushdecl/
4746 pop_nested_namespace if you really need to push it into a foreign
4750 do_pushdecl_with_scope (tree x
, cp_binding_level
*level
, bool hiding
= false)
4752 cp_binding_level
*b
;
4754 if (level
->kind
== sk_class
)
4756 gcc_checking_assert (!hiding
);
4757 b
= class_binding_level
;
4758 class_binding_level
= level
;
4759 pushdecl_class_level (x
);
4760 class_binding_level
= b
;
4764 tree function_decl
= current_function_decl
;
4765 if (level
->kind
== sk_namespace
)
4766 current_function_decl
= NULL_TREE
;
4767 b
= current_binding_level
;
4768 current_binding_level
= level
;
4769 x
= pushdecl (x
, hiding
);
4770 current_binding_level
= b
;
4771 current_function_decl
= function_decl
;
4776 /* Inject X into the local scope just before the function parms. */
4779 pushdecl_outermost_localscope (tree x
)
4781 cp_binding_level
*b
= NULL
;
4782 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
4784 /* Find the scope just inside the function parms. */
4785 for (cp_binding_level
*n
= current_binding_level
;
4786 n
->kind
!= sk_function_parms
; n
= b
->level_chain
)
4789 return b
? do_pushdecl_with_scope (x
, b
) : error_mark_node
;
4792 /* Process a local-scope or namespace-scope using declaration. LOOKUP
4793 is the result of qualified lookup (both value & type are
4794 significant). FN_SCOPE_P indicates if we're at function-scope (as
4795 opposed to namespace-scope). *VALUE_P and *TYPE_P are the current
4796 bindings, which are altered to reflect the newly brought in
4800 do_nonmember_using_decl (name_lookup
&lookup
, bool fn_scope_p
,
4801 bool insert_p
, tree
*value_p
, tree
*type_p
)
4803 tree value
= *value_p
;
4804 tree type
= *type_p
;
4805 bool failed
= false;
4807 /* Shift the old and new bindings around so we're comparing class and
4808 enumeration names to each other. */
4809 if (value
&& DECL_IMPLICIT_TYPEDEF_P (value
))
4815 if (lookup
.value
&& DECL_IMPLICIT_TYPEDEF_P (lookup
.value
))
4817 lookup
.type
= lookup
.value
;
4818 lookup
.value
= NULL_TREE
;
4821 /* Only process exporting if we're going to be inserting. */
4822 bool revealing_p
= insert_p
&& !fn_scope_p
&& module_has_cmi_p ();
4824 /* First do the value binding. */
4826 /* Nothing (only implicit typedef found). */
4827 gcc_checking_assert (lookup
.type
);
4828 else if (OVL_P (lookup
.value
) && (!value
|| OVL_P (value
)))
4830 for (lkp_iterator
usings (lookup
.value
); usings
; ++usings
)
4832 tree new_fn
= *usings
;
4833 bool exporting
= revealing_p
&& module_exporting_p ();
4836 /* If the using decl is exported, the things it refers
4837 to must also be exported (or not habve module attachment). */
4838 if (!DECL_MODULE_EXPORT_P (new_fn
)
4839 && (DECL_LANG_SPECIFIC (new_fn
)
4840 && DECL_MODULE_ATTACH_P (new_fn
)))
4842 error ("%q#D does not have external linkage", new_fn
);
4843 inform (DECL_SOURCE_LOCATION (new_fn
),
4844 "%q#D declared here", new_fn
);
4849 /* [namespace.udecl]
4851 If a function declaration in namespace scope or block
4852 scope has the same name and the same parameter types as a
4853 function introduced by a using declaration the program is
4855 /* This seems overreaching, asking core -- why do we care
4856 about decls in the namespace that we cannot name (because
4857 they are not transitively imported. We just check the
4858 decls that are in this TU. */
4860 for (ovl_iterator
old (value
); !found
&& old
; ++old
)
4864 if (new_fn
== old_fn
)
4866 /* The function already exists in the current
4867 namespace. We will still want to insert it if
4868 it is revealing a not-revealed thing. */
4872 else if (old
.using_p ())
4875 /* Update in place. 'tis ok. */
4876 OVL_EXPORT_P (old
.get_using ()) = true;
4879 else if (DECL_MODULE_EXPORT_P (new_fn
))
4883 value
= old
.remove_node (value
);
4888 else if (old
.using_p ())
4889 continue; /* This is a using decl. */
4890 else if (old
.hidden_p () && DECL_IS_UNDECLARED_BUILTIN (old_fn
))
4891 continue; /* This is an anticipated builtin. */
4892 else if (!matching_fn_p (new_fn
, old_fn
))
4893 continue; /* Parameters do not match. */
4894 else if (decls_match (new_fn
, old_fn
))
4896 /* Extern "C" in different namespaces. */
4902 diagnose_name_conflict (new_fn
, old_fn
);
4909 if (!found
&& insert_p
)
4910 /* Unlike the decl-pushing case we don't drop anticipated
4911 builtins here. They don't cause a problem, and we'd
4912 like to match them with a future declaration. */
4913 value
= ovl_insert (new_fn
, value
, 1 + exporting
);
4917 /* Ignore anticipated builtins. */
4918 && !anticipated_builtin_p (value
)
4919 && (fn_scope_p
|| !decls_match (lookup
.value
, value
)))
4921 diagnose_name_conflict (lookup
.value
, value
);
4925 // FIXME:what if we're newly exporting lookup.value
4926 value
= lookup
.value
;
4928 /* Now the type binding. */
4929 if (lookup
.type
&& lookup
.type
!= type
)
4931 // FIXME: What if we're exporting lookup.type?
4932 if (type
&& !decls_match (lookup
.type
, type
))
4934 diagnose_name_conflict (lookup
.type
, type
);
4943 /* If value is empty, shift any class or enumeration name back. */
4956 /* Returns true if ANCESTOR encloses DESCENDANT, including matching.
4957 Both are namespaces. */
4960 is_nested_namespace (tree ancestor
, tree descendant
, bool inline_only
)
4962 int depth
= SCOPE_DEPTH (ancestor
);
4964 if (!depth
&& !inline_only
)
4965 /* The global namespace encloses everything. */
4968 while (SCOPE_DEPTH (descendant
) > depth
4969 && (!inline_only
|| DECL_NAMESPACE_INLINE_P (descendant
)))
4970 descendant
= CP_DECL_CONTEXT (descendant
);
4972 return ancestor
== descendant
;
4975 /* Returns true if ROOT (a non-alias namespace, class, or function)
4976 encloses CHILD. CHILD may be either a class type or a namespace
4980 is_ancestor (tree root
, tree child
)
4982 gcc_checking_assert ((TREE_CODE (root
) == NAMESPACE_DECL
4983 && !DECL_NAMESPACE_ALIAS (root
))
4984 || TREE_CODE (root
) == FUNCTION_DECL
4985 || CLASS_TYPE_P (root
));
4986 gcc_checking_assert (TREE_CODE (child
) == NAMESPACE_DECL
4987 || CLASS_TYPE_P (child
));
4989 /* The global namespace encloses everything. Early-out for the
4991 if (root
== global_namespace
)
4994 /* Search CHILD until we reach namespace scope. */
4995 while (TREE_CODE (child
) != NAMESPACE_DECL
)
4997 /* If we've reached the ROOT, it encloses CHILD. */
5001 /* Go out one level. */
5003 child
= TYPE_NAME (child
);
5004 child
= CP_DECL_CONTEXT (child
);
5007 if (TREE_CODE (root
) != NAMESPACE_DECL
)
5008 /* Failed to meet the non-namespace we were looking for. */
5011 if (tree alias
= DECL_NAMESPACE_ALIAS (child
))
5014 return is_nested_namespace (root
, child
);
5017 /* Enter the class or namespace scope indicated by T suitable for name
5018 lookup. T can be arbitrary scope, not necessary nested inside the
5019 current scope. Returns a non-null scope to pop iff pop_scope
5020 should be called later to exit this scope. */
5025 if (TREE_CODE (t
) == NAMESPACE_DECL
)
5026 push_decl_namespace (t
);
5027 else if (CLASS_TYPE_P (t
))
5029 if (!at_class_scope_p ()
5030 || !same_type_p (current_class_type
, t
))
5031 push_nested_class (t
);
5033 /* T is the same as the current scope. There is therefore no
5034 need to re-enter the scope. Since we are not actually
5035 pushing a new scope, our caller should not call
5043 /* Leave scope pushed by push_scope. */
5050 if (TREE_CODE (t
) == NAMESPACE_DECL
)
5051 pop_decl_namespace ();
5052 else if CLASS_TYPE_P (t
)
5053 pop_nested_class ();
5056 /* Subroutine of push_inner_scope. */
5059 push_inner_scope_r (tree outer
, tree inner
)
5064 || (TREE_CODE (inner
) != NAMESPACE_DECL
&& !CLASS_TYPE_P (inner
)))
5067 prev
= CP_DECL_CONTEXT (TREE_CODE (inner
) == NAMESPACE_DECL
? inner
: TYPE_NAME (inner
));
5069 push_inner_scope_r (outer
, prev
);
5070 if (TREE_CODE (inner
) == NAMESPACE_DECL
)
5072 cp_binding_level
*save_template_parm
= 0;
5073 /* Temporary take out template parameter scopes. They are saved
5074 in reversed order in save_template_parm. */
5075 while (current_binding_level
->kind
== sk_template_parms
)
5077 cp_binding_level
*b
= current_binding_level
;
5078 current_binding_level
= b
->level_chain
;
5079 b
->level_chain
= save_template_parm
;
5080 save_template_parm
= b
;
5083 resume_scope (NAMESPACE_LEVEL (inner
));
5084 current_namespace
= inner
;
5086 /* Restore template parameter scopes. */
5087 while (save_template_parm
)
5089 cp_binding_level
*b
= save_template_parm
;
5090 save_template_parm
= b
->level_chain
;
5091 b
->level_chain
= current_binding_level
;
5092 current_binding_level
= b
;
5099 /* Enter the scope INNER from current scope. INNER must be a scope
5100 nested inside current scope. This works with both name lookup and
5101 pushing name into scope. In case a template parameter scope is present,
5102 namespace is pushed under the template parameter scope according to
5103 name lookup rule in 14.6.1/6.
5105 Return the former current scope suitable for pop_inner_scope. */
5108 push_inner_scope (tree inner
)
5110 tree outer
= current_scope ();
5112 outer
= current_namespace
;
5114 push_inner_scope_r (outer
, inner
);
5118 /* Exit the current scope INNER back to scope OUTER. */
5121 pop_inner_scope (tree outer
, tree inner
)
5124 || (TREE_CODE (inner
) != NAMESPACE_DECL
&& !CLASS_TYPE_P (inner
)))
5127 while (outer
!= inner
)
5129 if (TREE_CODE (inner
) == NAMESPACE_DECL
)
5131 cp_binding_level
*save_template_parm
= 0;
5132 /* Temporary take out template parameter scopes. They are saved
5133 in reversed order in save_template_parm. */
5134 while (current_binding_level
->kind
== sk_template_parms
)
5136 cp_binding_level
*b
= current_binding_level
;
5137 current_binding_level
= b
->level_chain
;
5138 b
->level_chain
= save_template_parm
;
5139 save_template_parm
= b
;
5144 /* Restore template parameter scopes. */
5145 while (save_template_parm
)
5147 cp_binding_level
*b
= save_template_parm
;
5148 save_template_parm
= b
->level_chain
;
5149 b
->level_chain
= current_binding_level
;
5150 current_binding_level
= b
;
5156 inner
= CP_DECL_CONTEXT (TREE_CODE (inner
) == NAMESPACE_DECL
? inner
: TYPE_NAME (inner
));
5160 /* Do a pushlevel for class declarations. */
5163 pushlevel_class (void)
5165 class_binding_level
= begin_scope (sk_class
, current_class_type
);
5168 /* ...and a poplevel for class declarations. */
5171 poplevel_class (void)
5173 cp_binding_level
*level
= class_binding_level
;
5174 cp_class_binding
*cb
;
5178 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
5179 gcc_assert (level
!= 0);
5181 /* If we're leaving a toplevel class, cache its binding level. */
5182 if (current_class_depth
== 1)
5183 previous_class_level
= level
;
5184 for (shadowed
= level
->type_shadowed
;
5186 shadowed
= TREE_CHAIN (shadowed
))
5187 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
5189 /* Remove the bindings for all of the class-level declarations. */
5190 if (level
->class_shadowed
)
5192 FOR_EACH_VEC_ELT (*level
->class_shadowed
, i
, cb
)
5194 IDENTIFIER_BINDING (cb
->identifier
) = cb
->base
->previous
;
5195 cxx_binding_free (cb
->base
);
5197 ggc_free (level
->class_shadowed
);
5198 level
->class_shadowed
= NULL
;
5201 /* Now, pop out of the binding level which we created up in the
5202 `pushlevel_class' routine. */
5203 gcc_assert (current_binding_level
== level
);
5207 /* Set INHERITED_VALUE_BINDING_P on BINDING to true or false, as
5208 appropriate. DECL is the value to which a name has just been
5209 bound. CLASS_TYPE is the class in which the lookup occurred. */
5212 set_inherited_value_binding_p (cxx_binding
*binding
, tree decl
,
5215 if (binding
->value
== decl
&& TREE_CODE (decl
) != TREE_LIST
)
5219 if (is_overloaded_fn (decl
))
5220 context
= ovl_scope (decl
);
5223 gcc_assert (DECL_P (decl
));
5224 context
= context_for_name_lookup (decl
);
5227 if (is_properly_derived_from (class_type
, context
))
5228 INHERITED_VALUE_BINDING_P (binding
) = 1;
5230 INHERITED_VALUE_BINDING_P (binding
) = 0;
5232 else if (binding
->value
== decl
)
5233 /* We only encounter a TREE_LIST when there is an ambiguity in the
5234 base classes. Such an ambiguity can be overridden by a
5235 definition in this class. */
5236 INHERITED_VALUE_BINDING_P (binding
) = 1;
5238 INHERITED_VALUE_BINDING_P (binding
) = 0;
5241 /* Make the declaration of X appear in CLASS scope. */
5244 pushdecl_class_level (tree x
)
5246 bool is_valid
= true;
5248 /* Do nothing if we're adding to an outer lambda closure type,
5249 outer_binding will add it later if it's needed. */
5250 if (current_class_type
!= class_binding_level
->this_entity
)
5253 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
5254 /* Get the name of X. */
5255 tree name
= OVL_NAME (x
);
5259 is_valid
= push_class_level_binding (name
, x
);
5260 if (TREE_CODE (x
) == TYPE_DECL
)
5261 set_identifier_type_value (name
, x
);
5263 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
5265 /* If X is an anonymous aggregate, all of its members are
5266 treated as if they were members of the class containing the
5267 aggregate, for naming purposes. */
5268 location_t save_location
= input_location
;
5269 tree anon
= TREE_TYPE (x
);
5270 if (vec
<tree
, va_gc
> *member_vec
= CLASSTYPE_MEMBER_VEC (anon
))
5271 for (unsigned ix
= member_vec
->length (); ix
--;)
5273 tree binding
= (*member_vec
)[ix
];
5274 if (STAT_HACK_P (binding
))
5276 if (!pushdecl_class_level (STAT_TYPE (binding
)))
5278 binding
= STAT_DECL (binding
);
5280 if (!pushdecl_class_level (binding
))
5284 for (tree f
= TYPE_FIELDS (anon
); f
; f
= DECL_CHAIN (f
))
5285 if (TREE_CODE (f
) == FIELD_DECL
)
5287 input_location
= DECL_SOURCE_LOCATION (f
);
5288 if (!pushdecl_class_level (f
))
5291 input_location
= save_location
;
5296 /* Return the BINDING (if any) for NAME in SCOPE, which is a class
5297 scope. If the value returned is non-NULL, and the PREVIOUS field
5298 is not set, callers must set the PREVIOUS field explicitly. */
5300 static cxx_binding
*
5301 get_class_binding (tree name
, cp_binding_level
*scope
)
5306 cxx_binding
*binding
;
5308 class_type
= scope
->this_entity
;
5310 /* Get the type binding. */
5311 type_binding
= lookup_member (class_type
, name
,
5312 /*protect=*/2, /*want_type=*/true,
5313 tf_warning_or_error
);
5314 /* Get the value binding. */
5315 value_binding
= lookup_member (class_type
, name
,
5316 /*protect=*/2, /*want_type=*/false,
5317 tf_warning_or_error
);
5319 /* If we found either a type binding or a value binding, create a
5320 new binding object. */
5321 if (type_binding
|| value_binding
)
5323 binding
= new_class_binding (name
,
5327 set_inherited_value_binding_p (binding
, value_binding
, class_type
);
5335 /* Make the declaration(s) of X appear in CLASS scope under the name
5336 NAME. Returns true if the binding is valid. */
5339 push_class_level_binding (tree name
, tree x
)
5341 cxx_binding
*binding
;
5345 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
5347 /* The class_binding_level will be NULL if x is a template
5348 parameter name in a member template. */
5349 if (!class_binding_level
)
5352 if (name
== error_mark_node
)
5355 /* Can happen for an erroneous declaration (c++/60384). */
5356 if (!identifier_p (name
))
5358 gcc_assert (errorcount
|| sorrycount
);
5362 /* Check for invalid member names. But don't worry about a default
5363 argument-scope lambda being pushed after the class is complete. */
5364 gcc_assert (TYPE_BEING_DEFINED (current_class_type
)
5365 || LAMBDA_TYPE_P (TREE_TYPE (decl
)));
5366 /* Check that we're pushing into the right binding level. */
5367 gcc_assert (current_class_type
== class_binding_level
->this_entity
);
5369 /* We could have been passed a tree list if this is an ambiguous
5370 declaration. If so, pull the declaration out because
5371 check_template_shadow will not handle a TREE_LIST. */
5372 if (TREE_CODE (decl
) == TREE_LIST
5373 && TREE_TYPE (decl
) == error_mark_node
)
5374 decl
= TREE_VALUE (decl
);
5376 if (!check_template_shadow (decl
))
5381 If T is the name of a class, then each of the following shall
5382 have a name different from T:
5384 -- every static data member of class T;
5386 -- every member of class T that is itself a type;
5388 -- every enumerator of every member of class T that is an
5391 -- every member of every anonymous union that is a member of
5394 (Non-static data members were also forbidden to have the same
5395 name as T until TC1.) */
5397 || TREE_CODE (x
) == CONST_DECL
5398 || (TREE_CODE (x
) == TYPE_DECL
5399 && !DECL_SELF_REFERENCE_P (x
))
5400 /* A data member of an anonymous union. */
5401 || (TREE_CODE (x
) == FIELD_DECL
5402 && DECL_CONTEXT (x
) != current_class_type
))
5403 && DECL_NAME (x
) == DECL_NAME (TYPE_NAME (current_class_type
)))
5405 tree scope
= context_for_name_lookup (x
);
5406 if (TYPE_P (scope
) && same_type_p (scope
, current_class_type
))
5408 error_at (DECL_SOURCE_LOCATION (x
),
5409 "%qD has the same name as the class in which it is "
5415 /* Get the current binding for NAME in this class, if any. */
5416 binding
= IDENTIFIER_BINDING (name
);
5417 if (!binding
|| binding
->scope
!= class_binding_level
)
5419 binding
= get_class_binding (name
, class_binding_level
);
5420 /* If a new binding was created, put it at the front of the
5421 IDENTIFIER_BINDING list. */
5424 binding
->previous
= IDENTIFIER_BINDING (name
);
5425 IDENTIFIER_BINDING (name
) = binding
;
5429 /* If there is already a binding, then we may need to update the
5431 if (binding
&& binding
->value
)
5433 tree bval
= binding
->value
;
5434 tree old_decl
= NULL_TREE
;
5435 tree target_decl
= strip_using_decl (decl
);
5436 tree target_bval
= strip_using_decl (bval
);
5438 if (INHERITED_VALUE_BINDING_P (binding
))
5440 /* If the old binding was from a base class, and was for a
5441 tag name, slide it over to make room for the new binding.
5442 The old binding is still visible if explicitly qualified
5443 with a class-key. */
5444 if (TREE_CODE (target_bval
) == TYPE_DECL
5445 && DECL_ARTIFICIAL (target_bval
)
5446 && !(TREE_CODE (target_decl
) == TYPE_DECL
5447 && DECL_ARTIFICIAL (target_decl
)))
5449 old_decl
= binding
->type
;
5450 binding
->type
= bval
;
5451 binding
->value
= NULL_TREE
;
5452 INHERITED_VALUE_BINDING_P (binding
) = 0;
5457 /* Any inherited type declaration is hidden by the type
5458 declaration in the derived class. */
5459 if (TREE_CODE (target_decl
) == TYPE_DECL
5460 && DECL_ARTIFICIAL (target_decl
))
5461 binding
->type
= NULL_TREE
;
5464 else if (TREE_CODE (decl
) == USING_DECL
5465 && TREE_CODE (bval
) == USING_DECL
5466 && same_type_p (USING_DECL_SCOPE (decl
),
5467 USING_DECL_SCOPE (bval
)))
5468 /* This is a using redeclaration that will be diagnosed later
5469 in supplement_binding */
5471 else if (TREE_CODE (decl
) == USING_DECL
5472 && TREE_CODE (bval
) == USING_DECL
5473 && DECL_DEPENDENT_P (decl
)
5474 && DECL_DEPENDENT_P (bval
))
5476 else if (TREE_CODE (decl
) == USING_DECL
5477 && DECL_DEPENDENT_P (decl
)
5478 && OVL_P (target_bval
))
5479 /* The new dependent using beats an old overload. */
5481 else if (TREE_CODE (bval
) == USING_DECL
5482 && DECL_DEPENDENT_P (bval
)
5483 && OVL_P (target_decl
))
5484 /* The old dependent using beats a new overload. */
5486 else if (OVL_P (target_decl
)
5487 && OVL_P (target_bval
))
5488 /* The new overload set contains the old one. */
5491 if (old_decl
&& binding
->scope
== class_binding_level
)
5494 /* It is always safe to clear INHERITED_VALUE_BINDING_P
5495 here. This function is only used to register bindings
5496 from with the class definition itself. */
5497 INHERITED_VALUE_BINDING_P (binding
) = 0;
5502 /* Note that we declared this value so that we can issue an error if
5503 this is an invalid redeclaration of a name already used for some
5505 note_name_declared_in_class (name
, decl
);
5507 /* If we didn't replace an existing binding, put the binding on the
5508 stack of bindings for the identifier, and update the shadowed
5510 if (binding
&& binding
->scope
== class_binding_level
)
5511 /* Supplement the existing binding. */
5512 ok
= supplement_binding (binding
, decl
);
5515 /* Create a new binding. */
5516 push_binding (name
, decl
, class_binding_level
);
5523 /* Process and lookup a using decl SCOPE::lookup.name, filling in
5524 lookup.values & lookup.type. Return a USING_DECL, or NULL_TREE on
5528 lookup_using_decl (tree scope
, name_lookup
&lookup
)
5530 tree current
= current_scope ();
5531 bool dependent_p
= false;
5532 tree binfo
= NULL_TREE
;
5533 base_kind b_kind
= bk_not_base
;
5535 /* Because C++20 breaks the invariant that only member using-decls
5536 refer to members and only non-member using-decls refer to
5537 non-members, we first do the lookups, and then do validation that
5538 what we found is ok. */
5540 if (TREE_CODE (scope
) == ENUMERAL_TYPE
5541 && cxx_dialect
< cxx20
5542 && UNSCOPED_ENUM_P (scope
)
5543 && !TYPE_FUNCTION_SCOPE_P (scope
))
5545 /* PR c++/60265 argued that since C++11 added explicit enum scope, we
5546 should allow it as meaning the enclosing scope. I don't see any
5547 justification for this in C++11, but let's keep allowing it. */
5548 tree ctx
= CP_TYPE_CONTEXT (scope
);
5549 if (CLASS_TYPE_P (ctx
) == CLASS_TYPE_P (current
))
5553 /* You cannot using-decl a destructor. */
5554 if (TREE_CODE (lookup
.name
) == BIT_NOT_EXPR
)
5556 error ("%<%T%s%D%> names destructor", scope
,
5557 &"::"[scope
== global_namespace
? 2 : 0], lookup
.name
);
5561 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
5563 /* Naming a namespace member. */
5564 qualified_namespace_lookup (scope
, &lookup
);
5566 if (TYPE_P (current
)
5569 || cxx_dialect
< cxx20
5570 || TREE_CODE (lookup
.value
) != CONST_DECL
))
5572 error ("using-declaration for non-member at class scope");
5576 else if (TREE_CODE (scope
) == ENUMERAL_TYPE
)
5578 /* Naming an enumeration member. */
5579 if (cxx_dialect
< cxx20
)
5580 error ("%<using%> with enumeration scope %q#T "
5581 "only available with %<-std=c++20%> or %<-std=gnu++20%>",
5583 lookup
.value
= lookup_enumerator (scope
, lookup
.name
);
5587 /* Naming a class member. This is awkward in C++20, because we
5588 might be naming an enumerator of an unrelated class. */
5590 tree npscope
= scope
;
5591 if (PACK_EXPANSION_P (scope
))
5592 npscope
= PACK_EXPANSION_PATTERN (scope
);
5594 if (!MAYBE_CLASS_TYPE_P (npscope
))
5596 error ("%qT is not a class, namespace, or enumeration", npscope
);
5600 /* Using T::T declares inheriting ctors, even if T is a typedef. */
5601 if (lookup
.name
== TYPE_IDENTIFIER (npscope
)
5602 || constructor_name_p (lookup
.name
, npscope
))
5604 if (!TYPE_P (current
))
5606 error ("non-member using-declaration names constructor of %qT",
5610 maybe_warn_cpp0x (CPP0X_INHERITING_CTORS
);
5611 lookup
.name
= ctor_identifier
;
5612 CLASSTYPE_NON_AGGREGATE (current
) = true;
5615 if (!TYPE_P (current
) && cxx_dialect
< cxx20
)
5617 error ("using-declaration for member at non-class scope");
5621 bool depscope
= dependent_scope_p (scope
);
5624 /* Leave binfo null. */;
5625 else if (TYPE_P (current
))
5627 binfo
= lookup_base (current
, scope
, ba_any
, &b_kind
, tf_none
);
5628 gcc_checking_assert (b_kind
>= bk_not_base
);
5630 if (b_kind
== bk_not_base
&& any_dependent_bases_p ())
5631 /* Treat as-if dependent. */
5633 else if (lookup
.name
== ctor_identifier
5634 && (b_kind
< bk_proper_base
|| !binfo_direct_p (binfo
)))
5636 if (any_dependent_bases_p ())
5640 error ("%qT is not a direct base of %qT", scope
, current
);
5645 if (b_kind
< bk_proper_base
)
5646 binfo
= TYPE_BINFO (scope
);
5649 binfo
= TYPE_BINFO (scope
);
5651 dependent_p
= (depscope
5652 || (IDENTIFIER_CONV_OP_P (lookup
.name
)
5653 && dependent_type_p (TREE_TYPE (lookup
.name
))));
5656 lookup
.value
= lookup_member (binfo
, lookup
.name
, /*protect=*/2,
5657 /*want_type=*/false, tf_none
);
5659 /* If the lookup in the base contains a dependent using, this
5660 using is also dependent. */
5661 if (!dependent_p
&& lookup
.value
&& dependent_type_p (scope
))
5663 tree val
= lookup
.value
;
5664 if (tree fns
= maybe_get_fns (val
))
5666 for (tree f
: lkp_range (val
))
5667 if (TREE_CODE (f
) == USING_DECL
&& DECL_DEPENDENT_P (f
))
5674 if (!depscope
&& b_kind
< bk_proper_base
)
5676 if (cxx_dialect
>= cxx20
&& lookup
.value
5677 && TREE_CODE (lookup
.value
) == CONST_DECL
)
5679 /* Using an unrelated enum; check access here rather
5680 than separately for class and non-class using. */
5681 perform_or_defer_access_check
5682 (binfo
, lookup
.value
, lookup
.value
, tf_warning_or_error
);
5683 /* And then if this is a copy from handle_using_decl, look
5684 through to the original enumerator. */
5685 if (CONST_DECL_USING_P (lookup
.value
))
5686 lookup
.value
= DECL_ABSTRACT_ORIGIN (lookup
.value
);
5688 else if (!TYPE_P (current
))
5690 error ("using-declaration for member at non-class scope");
5695 auto_diagnostic_group g
;
5696 error_not_base_type (scope
, current
);
5697 if (lookup
.value
&& DECL_IMPLICIT_TYPEDEF_P (lookup
.value
)
5698 && TREE_CODE (TREE_TYPE (lookup
.value
)) == ENUMERAL_TYPE
)
5699 inform (input_location
,
5700 "did you mean %<using enum %T::%D%>?",
5701 scope
, lookup
.name
);
5707 /* Did we find anything sane? */
5710 else if (!lookup
.value
)
5712 error ("%qD has not been declared in %qD", lookup
.name
, scope
);
5715 else if (TREE_CODE (lookup
.value
) == TREE_LIST
5716 /* We can (independently) have ambiguous implicit typedefs. */
5717 || (lookup
.type
&& TREE_CODE (lookup
.type
) == TREE_LIST
))
5719 error ("reference to %qD is ambiguous", lookup
.name
);
5720 print_candidates (TREE_CODE (lookup
.value
) == TREE_LIST
5721 ? lookup
.value
: lookup
.type
);
5724 else if (TREE_CODE (lookup
.value
) == NAMESPACE_DECL
)
5726 error ("using-declaration may not name namespace %qD", lookup
.value
);
5730 if (TYPE_P (current
))
5732 /* In class scope. */
5734 /* Cannot introduce a constructor name. */
5735 if (constructor_name_p (lookup
.name
, current
))
5737 error ("%<%T::%D%> names constructor in %qT",
5738 scope
, lookup
.name
, current
);
5742 if (lookup
.value
&& BASELINK_P (lookup
.value
))
5743 /* The binfo from which the functions came does not matter. */
5744 lookup
.value
= BASELINK_FUNCTIONS (lookup
.value
);
5747 tree using_decl
= build_lang_decl (USING_DECL
, lookup
.name
, NULL_TREE
);
5748 USING_DECL_SCOPE (using_decl
) = scope
;
5749 USING_DECL_DECLS (using_decl
) = lookup
.value
;
5750 DECL_DEPENDENT_P (using_decl
) = dependent_p
;
5751 DECL_CONTEXT (using_decl
) = current
;
5752 if (TYPE_P (current
) && b_kind
== bk_not_base
)
5753 USING_DECL_UNRELATED_P (using_decl
) = true;
5758 /* Process "using SCOPE::NAME" in a class scope. Return the
5759 USING_DECL created. */
5762 do_class_using_decl (tree scope
, tree name
)
5764 if (name
== error_mark_node
5765 || scope
== error_mark_node
)
5768 name_lookup
lookup (name
);
5769 return lookup_using_decl (scope
, lookup
);
5773 /* Return the binding for NAME in NS in the current TU. If NS is
5774 NULL, look in global_namespace. We will not find declarations
5775 from imports. Users of this who, having found nothing, push a new
5776 decl must be prepared for that pushing to match an existing decl. */
5779 get_namespace_binding (tree ns
, tree name
)
5781 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
5783 ns
= global_namespace
;
5784 gcc_checking_assert (!DECL_NAMESPACE_ALIAS (ns
));
5785 tree ret
= NULL_TREE
;
5787 if (tree
*b
= find_namespace_slot (ns
, name
))
5791 if (TREE_CODE (ret
) == BINDING_VECTOR
)
5792 ret
= BINDING_VECTOR_CLUSTER (ret
, 0).slots
[0];
5794 ret
= MAYBE_STAT_DECL (ret
);
5800 /* Push internal DECL into the global namespace. Does not do the
5801 full overload fn handling and does not add it to the list of things
5802 in the namespace. */
5805 set_global_binding (tree decl
)
5807 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
5809 tree
*slot
= find_namespace_slot (global_namespace
, DECL_NAME (decl
), true);
5812 /* The user's placed something in the implementor's namespace. */
5813 diagnose_name_conflict (decl
, MAYBE_STAT_DECL (*slot
));
5815 /* Force the binding, so compiler internals continue to work. */
5819 /* Set the context of a declaration to scope. Complain if we are not
5823 set_decl_namespace (tree decl
, tree scope
, bool friendp
)
5825 /* Get rid of namespace aliases. */
5826 scope
= ORIGINAL_NAMESPACE (scope
);
5828 /* It is ok for friends to be qualified in parallel space. */
5829 if (!friendp
&& !is_nested_namespace (current_namespace
, scope
))
5830 error ("declaration of %qD not in a namespace surrounding %qD",
5832 DECL_CONTEXT (decl
) = FROB_CONTEXT (scope
);
5834 /* See whether this has been declared in the namespace or inline
5836 tree old
= NULL_TREE
;
5838 name_lookup
lookup (DECL_NAME (decl
),
5839 LOOK_want::NORMAL
| LOOK_want::HIDDEN_FRIEND
);
5840 if (!lookup
.search_qualified (scope
, /*usings=*/false))
5841 /* No old declaration at all. */
5846 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
5847 if (TREE_CODE (old
) == TREE_LIST
)
5850 DECL_CONTEXT (decl
) = FROB_CONTEXT (scope
);
5851 error ("reference to %qD is ambiguous", decl
);
5852 print_candidates (old
);
5856 if (!DECL_DECLARES_FUNCTION_P (decl
))
5858 /* Don't compare non-function decls with decls_match here, since
5859 it can't check for the correct constness at this
5860 point. pushdecl will find those errors later. */
5862 /* We might have found it in an inline namespace child of SCOPE. */
5863 if (TREE_CODE (decl
) == TREE_CODE (old
))
5864 DECL_CONTEXT (decl
) = DECL_CONTEXT (old
);
5867 /* Writing "N::i" to declare something directly in "N" is invalid. */
5868 if (CP_DECL_CONTEXT (decl
) == current_namespace
5869 && at_namespace_scope_p ())
5870 error_at (DECL_SOURCE_LOCATION (decl
),
5871 "explicit qualification in declaration of %qD", decl
);
5875 /* Since decl is a function, old should contain a function decl. */
5879 /* It didn't work, go back to the explicit scope. */
5880 DECL_CONTEXT (decl
) = FROB_CONTEXT (scope
);
5881 error ("%qD should have been declared inside %qD", decl
, scope
);
5886 /* We handle these in check_explicit_instantiation_namespace. */
5887 if (processing_explicit_instantiation
)
5889 if (processing_template_decl
|| processing_specialization
)
5890 /* We have not yet called push_template_decl to turn a
5891 FUNCTION_DECL into a TEMPLATE_DECL, so the declarations won't
5892 match. But, we'll check later, when we construct the
5896 /* Instantiations or specializations of templates may be declared as
5897 friends in any namespace. */
5898 if (friendp
&& DECL_USE_TEMPLATE (decl
))
5901 tree found
= NULL_TREE
;
5902 bool hidden_p
= false;
5903 bool saw_template
= false;
5905 for (lkp_iterator
iter (old
); iter
; ++iter
)
5907 if (iter
.using_p ())
5912 /* Adjust DECL_CONTEXT first so decls_match will return true
5913 if DECL will match a declaration in an inline namespace. */
5914 DECL_CONTEXT (decl
) = DECL_CONTEXT (ofn
);
5915 if (decls_match (decl
, ofn
))
5919 /* We found more than one matching declaration. This
5920 can happen if we have two inline namespace children,
5921 each containing a suitable declaration. */
5922 DECL_CONTEXT (decl
) = FROB_CONTEXT (scope
);
5926 hidden_p
= iter
.hidden_p ();
5928 else if (TREE_CODE (decl
) == FUNCTION_DECL
5929 && TREE_CODE (ofn
) == TEMPLATE_DECL
)
5930 saw_template
= true;
5933 if (!found
&& friendp
&& saw_template
)
5935 /* "[if no non-template match is found,] each remaining function template
5936 is replaced with the specialization chosen by deduction from the
5937 friend declaration or discarded if deduction fails."
5939 So tell check_explicit_specialization to look for a match. */
5940 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
5948 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
5949 "%qD has not been declared within %qD", decl
, scope
);
5950 inform (DECL_SOURCE_LOCATION (found
),
5951 "only here as a %<friend%>");
5953 DECL_CONTEXT (decl
) = DECL_CONTEXT (found
);
5960 /* Return the namespace where the current declaration is declared. */
5963 current_decl_namespace (void)
5966 /* If we have been pushed into a different namespace, use it. */
5967 if (!vec_safe_is_empty (decl_namespace_list
))
5968 return decl_namespace_list
->last ();
5970 if (current_class_type
)
5971 result
= decl_namespace_context (current_class_type
);
5972 else if (current_function_decl
)
5973 result
= decl_namespace_context (current_function_decl
);
5975 result
= current_namespace
;
5979 /* Process any ATTRIBUTES on a namespace definition. Returns true if
5980 attribute visibility is seen. */
5983 handle_namespace_attrs (tree ns
, tree attributes
)
5986 bool saw_vis
= false;
5988 if (attributes
== error_mark_node
)
5991 for (d
= attributes
; d
; d
= TREE_CHAIN (d
))
5993 tree name
= get_attribute_name (d
);
5994 tree args
= TREE_VALUE (d
);
5996 if (is_attribute_p ("visibility", name
))
5998 /* attribute visibility is a property of the syntactic block
5999 rather than the namespace as a whole, so we don't touch the
6000 NAMESPACE_DECL at all. */
6001 tree x
= args
? TREE_VALUE (args
) : NULL_TREE
;
6002 if (x
== NULL_TREE
|| TREE_CODE (x
) != STRING_CST
|| TREE_CHAIN (args
))
6004 warning (OPT_Wattributes
,
6005 "%qD attribute requires a single NTBS argument",
6010 if (!TREE_PUBLIC (ns
))
6011 warning (OPT_Wattributes
,
6012 "%qD attribute is meaningless since members of the "
6013 "anonymous namespace get local symbols", name
);
6015 push_visibility (TREE_STRING_POINTER (x
), 1);
6018 else if (is_attribute_p ("abi_tag", name
))
6020 if (!DECL_NAME (ns
))
6022 warning (OPT_Wattributes
, "ignoring %qD attribute on anonymous "
6026 if (!DECL_NAMESPACE_INLINE_P (ns
))
6028 warning (OPT_Wattributes
, "ignoring %qD attribute on non-inline "
6034 tree dn
= DECL_NAME (ns
);
6035 args
= build_string (IDENTIFIER_LENGTH (dn
) + 1,
6036 IDENTIFIER_POINTER (dn
));
6037 TREE_TYPE (args
) = char_array_type_node
;
6038 args
= fix_string_type (args
);
6039 args
= build_tree_list (NULL_TREE
, args
);
6041 if (check_abi_tag_args (args
, name
))
6042 DECL_ATTRIBUTES (ns
) = tree_cons (name
, args
,
6043 DECL_ATTRIBUTES (ns
));
6045 else if (is_attribute_p ("deprecated", name
))
6047 if (!DECL_NAME (ns
))
6049 warning (OPT_Wattributes
, "ignoring %qD attribute on anonymous "
6053 if (args
&& TREE_CODE (TREE_VALUE (args
)) != STRING_CST
)
6055 error ("deprecated message is not a string");
6058 TREE_DEPRECATED (ns
) = 1;
6060 DECL_ATTRIBUTES (ns
) = tree_cons (name
, args
,
6061 DECL_ATTRIBUTES (ns
));
6065 warning (OPT_Wattributes
, "%qD attribute directive ignored",
6074 /* Temporarily set the namespace for the current declaration. */
6077 push_decl_namespace (tree decl
)
6079 if (TREE_CODE (decl
) != NAMESPACE_DECL
)
6080 decl
= decl_namespace_context (decl
);
6081 vec_safe_push (decl_namespace_list
, ORIGINAL_NAMESPACE (decl
));
6084 /* [namespace.memdef]/2 */
6087 pop_decl_namespace (void)
6089 decl_namespace_list
->pop ();
6092 /* Process a namespace-alias declaration. */
6095 do_namespace_alias (tree alias
, tree name_space
)
6097 if (name_space
== error_mark_node
)
6100 gcc_assert (TREE_CODE (name_space
) == NAMESPACE_DECL
);
6102 name_space
= ORIGINAL_NAMESPACE (name_space
);
6104 /* Build the alias. */
6105 alias
= build_lang_decl (NAMESPACE_DECL
, alias
, void_type_node
);
6106 DECL_NAMESPACE_ALIAS (alias
) = name_space
;
6107 DECL_EXTERNAL (alias
) = 1;
6108 DECL_CONTEXT (alias
) = FROB_CONTEXT (current_scope ());
6109 set_originating_module (alias
);
6113 /* Emit debug info for namespace alias. */
6114 if (!building_stmt_list_p ())
6115 (*debug_hooks
->early_global_decl
) (alias
);
6118 /* Like pushdecl, only it places DECL in the current namespace,
6122 pushdecl_namespace_level (tree decl
, bool hiding
)
6124 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
6125 return do_pushdecl_with_scope (decl
, NAMESPACE_LEVEL (current_namespace
),
6129 /* Wrapper around push_local_binding to push the bindings for
6130 a non-member USING_DECL with NAME and VALUE. LOOKUP, if non-null,
6131 is the result of name lookup during template parsing. */
6134 push_using_decl_bindings (name_lookup
*lookup
, tree name
, tree value
)
6136 tree type
= NULL_TREE
;
6138 cxx_binding
*binding
= find_local_binding (current_binding_level
, name
);
6141 value
= binding
->value
;
6142 type
= binding
->type
;
6145 /* DR 36 questions why using-decls at function scope may not be
6146 duplicates. Disallow it, as C++11 claimed and PR 20420
6149 do_nonmember_using_decl (*lookup
, true, true, &value
, &type
);
6153 else if (binding
&& value
== binding
->value
)
6154 /* Redeclaration of this USING_DECL. */;
6155 else if (binding
&& binding
->value
&& TREE_CODE (value
) == OVERLOAD
)
6157 /* We already have this binding, so replace it. */
6158 update_local_overload (IDENTIFIER_BINDING (name
), value
);
6159 IDENTIFIER_BINDING (name
)->value
= value
;
6162 /* Install the new binding. */
6163 push_local_binding (name
, value
, /*using=*/true);
6167 else if (binding
&& type
== binding
->type
)
6171 push_local_binding (name
, type
, /*using=*/true);
6172 set_identifier_type_value (name
, type
);
6176 /* Overload for push_using_decl_bindings that doesn't take a name_lookup. */
6179 push_using_decl_bindings (tree name
, tree value
)
6181 push_using_decl_bindings (nullptr, name
, value
);
6184 /* Process a using declaration in non-class scope. */
6187 finish_nonmember_using_decl (tree scope
, tree name
)
6189 gcc_checking_assert (current_binding_level
->kind
!= sk_class
);
6191 if (scope
== error_mark_node
|| name
== error_mark_node
)
6194 name_lookup
lookup (name
);
6196 tree using_decl
= lookup_using_decl (scope
, lookup
);
6200 /* Emit debug info. */
6201 if (!processing_template_decl
)
6202 cp_emit_debug_info_for_using (lookup
.value
,
6203 current_binding_level
->this_entity
);
6205 if (current_binding_level
->kind
== sk_namespace
)
6207 tree
*slot
= find_namespace_slot (current_namespace
, name
, true);
6208 tree
*mslot
= get_fixed_binding_slot (slot
, name
,
6209 BINDING_SLOT_CURRENT
, true);
6210 bool failed
= false;
6214 /* A module vector. I presume the binding list is going to
6215 be sparser than the import bitmap. Hence iterate over
6216 the former checking for bits set in the bitmap. */
6217 bitmap imports
= get_import_bitmap ();
6218 binding_cluster
*cluster
= BINDING_VECTOR_CLUSTER_BASE (*slot
);
6220 /* Scan the imported bindings. */
6221 unsigned ix
= BINDING_VECTOR_NUM_CLUSTERS (*slot
);
6222 if (BINDING_VECTOR_SLOTS_PER_CLUSTER
== BINDING_SLOTS_FIXED
)
6228 /* Do this in forward order, so we load modules in an order
6229 the user expects. */
6230 for (; ix
--; cluster
++)
6231 for (unsigned jx
= 0; jx
!= BINDING_VECTOR_SLOTS_PER_CLUSTER
; jx
++)
6233 /* Are we importing this module? */
6234 if (unsigned base
= cluster
->indices
[jx
].base
)
6235 if (unsigned span
= cluster
->indices
[jx
].span
)
6237 if (bitmap_bit_p (imports
, base
))
6239 while (++base
, --span
);
6244 if (cluster
->slots
[jx
].is_lazy ())
6246 gcc_assert (cluster
->indices
[jx
].span
== 1);
6247 lazy_load_binding (cluster
->indices
[jx
].base
,
6248 scope
, name
, &cluster
->slots
[jx
]);
6251 tree value
= cluster
->slots
[jx
];
6253 /* Load errors could mean there's nothing here. */
6256 /* Extract what we can see from here. If there's no
6257 stat_hack, then everything was exported. */
6258 tree type
= NULL_TREE
;
6260 /* If no stat hack, everything is visible. */
6261 if (STAT_HACK_P (value
))
6263 if (STAT_TYPE_VISIBLE_P (value
))
6264 type
= STAT_TYPE (value
);
6265 value
= STAT_VISIBLE (value
);
6268 if (do_nonmember_using_decl (lookup
, false, false,
6279 /* Now do the current slot. */
6280 tree value
= MAYBE_STAT_DECL (*mslot
);
6281 tree type
= MAYBE_STAT_TYPE (*mslot
);
6283 do_nonmember_using_decl (lookup
, false, true, &value
, &type
);
6285 // FIXME: Partition mergeableness?
6286 if (STAT_HACK_P (*mslot
))
6288 STAT_DECL (*mslot
) = value
;
6289 STAT_TYPE (*mslot
) = type
;
6292 *mslot
= stat_hack (value
, type
);
6299 add_decl_expr (using_decl
);
6300 if (DECL_DEPENDENT_P (using_decl
))
6301 lookup
.value
= using_decl
;
6302 push_using_decl_bindings (&lookup
, name
, NULL_TREE
);
6306 /* Return the declarations that are members of the namespace NS. */
6309 cp_namespace_decls (tree ns
)
6311 return NAMESPACE_LEVEL (ns
)->names
;
6314 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
6315 ignore it or not. Subroutine of lookup_name_1 and lookup_type_scope. */
6318 qualify_lookup (tree val
, LOOK_want want
)
6320 if (val
== NULL_TREE
)
6323 if (bool (want
& LOOK_want::TYPE
))
6325 tree target_val
= strip_using_decl (val
);
6327 if (TREE_CODE (STRIP_TEMPLATE (target_val
)) == TYPE_DECL
)
6331 if (bool (want
& LOOK_want::TYPE_NAMESPACE
))
6332 return TREE_CODE (val
) == NAMESPACE_DECL
;
6337 /* Is there a "using namespace std;" directive within USINGS? */
6340 using_directives_contain_std_p (vec
<tree
, va_gc
> *usings
)
6345 for (unsigned ix
= usings
->length (); ix
--;)
6346 if ((*usings
)[ix
] == std_node
)
6352 /* Is there a "using namespace std;" directive within the current
6353 namespace (or its ancestors)?
6354 Compare with name_lookup::search_unqualified. */
6357 has_using_namespace_std_directive_p ()
6359 for (cp_binding_level
*level
= current_binding_level
;
6361 level
= level
->level_chain
)
6362 if (using_directives_contain_std_p (level
->using_directives
))
6368 /* Subclass of deferred_diagnostic, for issuing a note when
6369 --param cxx-max-namespaces-for-diagnostic-help is reached.
6371 The note should be issued after the error, but before any other
6372 deferred diagnostics. This is handled by decorating a wrapped
6373 deferred_diagnostic, and emitting a note before that wrapped note is
6376 class namespace_limit_reached
: public deferred_diagnostic
6379 namespace_limit_reached (location_t loc
, unsigned limit
, tree name
,
6380 std::unique_ptr
<deferred_diagnostic
> wrapped
)
6381 : deferred_diagnostic (loc
),
6382 m_limit (limit
), m_name (name
),
6383 m_wrapped (std::move (wrapped
))
6387 ~namespace_limit_reached ()
6389 /* Unconditionally warn that the search was truncated. */
6390 inform (get_location (),
6391 "maximum limit of %d namespaces searched for %qE",
6393 /* m_wrapped will be implicitly deleted after this, emitting any followup
6394 diagnostic after the above note. */
6400 std::unique_ptr
<deferred_diagnostic
> m_wrapped
;
6403 /* Subclass of deferred_diagnostic, for use when issuing a single suggestion.
6404 Emit a note showing the location of the declaration of the suggestion. */
6406 class show_candidate_location
: public deferred_diagnostic
6409 show_candidate_location (location_t loc
, tree candidate
)
6410 : deferred_diagnostic (loc
),
6411 m_candidate (candidate
)
6415 ~show_candidate_location ()
6417 inform (location_of (m_candidate
), "%qE declared here", m_candidate
);
6424 /* Subclass of deferred_diagnostic, for use when there are multiple candidates
6425 to be suggested by suggest_alternatives_for.
6427 Emit a series of notes showing the various suggestions. */
6429 class suggest_alternatives
: public deferred_diagnostic
6432 suggest_alternatives (location_t loc
, vec
<tree
> candidates
)
6433 : deferred_diagnostic (loc
),
6434 m_candidates (candidates
)
6438 ~suggest_alternatives ()
6440 if (m_candidates
.length ())
6442 inform_n (get_location (), m_candidates
.length (),
6443 "suggested alternative:",
6444 "suggested alternatives:");
6445 for (unsigned ix
= 0; ix
!= m_candidates
.length (); ix
++)
6447 tree val
= m_candidates
[ix
];
6449 inform (location_of (val
), " %qE", val
);
6452 m_candidates
.release ();
6456 vec
<tree
> m_candidates
;
6459 /* A class for encapsulating the result of a search across
6460 multiple namespaces (and scoped enums within them) for an
6461 unrecognized name seen at a given source location. */
6463 class namespace_hints
6466 namespace_hints (location_t loc
, tree name
);
6468 name_hint
convert_candidates_to_name_hint ();
6469 name_hint
maybe_decorate_with_limit (name_hint
);
6472 void maybe_add_candidate_for_scoped_enum (tree scoped_enum
, tree name
);
6476 vec
<tree
> m_candidates
;
6478 /* Value of "--param cxx-max-namespaces-for-diagnostic-help". */
6481 /* Was the limit reached? */
6485 /* Constructor for namespace_hints. Search namespaces and scoped enums,
6486 looking for an exact match for unrecognized NAME seen at LOC. */
6488 namespace_hints::namespace_hints (location_t loc
, tree name
)
6489 : m_loc(loc
), m_name (name
)
6491 auto_vec
<tree
> worklist
;
6493 m_candidates
= vNULL
;
6495 m_limit
= param_cxx_max_namespaces_for_diagnostic_help
;
6497 /* Breadth-first search of namespaces. Up to limit namespaces
6498 searched (limit zero == unlimited). */
6499 worklist
.safe_push (global_namespace
);
6500 for (unsigned ix
= 0; ix
!= worklist
.length (); ix
++)
6502 tree ns
= worklist
[ix
];
6503 name_lookup
lookup (name
);
6505 if (lookup
.search_qualified (ns
, false))
6506 m_candidates
.safe_push (lookup
.value
);
6510 /* Look for child namespaces. We have to do this
6511 indirectly because they are chained in reverse order,
6512 which is confusing to the user. */
6513 auto_vec
<tree
> children
;
6515 for (tree decl
= NAMESPACE_LEVEL (ns
)->names
;
6516 decl
; decl
= TREE_CHAIN (decl
))
6518 if (TREE_CODE (decl
) == NAMESPACE_DECL
6519 && !DECL_NAMESPACE_ALIAS (decl
)
6520 && !DECL_NAMESPACE_INLINE_P (decl
))
6521 children
.safe_push (decl
);
6523 /* Look for exact matches for NAME within scoped enums.
6524 These aren't added to the worklist, and so don't count
6525 against the search limit. */
6526 if (TREE_CODE (decl
) == TYPE_DECL
)
6528 tree type
= TREE_TYPE (decl
);
6529 if (SCOPED_ENUM_P (type
))
6530 maybe_add_candidate_for_scoped_enum (type
, name
);
6534 while (!m_limited
&& !children
.is_empty ())
6536 if (worklist
.length () == m_limit
)
6539 worklist
.safe_push (children
.pop ());
6545 /* Drop ownership of m_candidates, using it to generate a name_hint at m_loc
6546 for m_name, an IDENTIFIER_NODE for which name lookup failed.
6548 If m_candidates is non-empty, use it to generate a suggestion and/or
6549 a deferred diagnostic that lists the possible candidate(s).
6553 namespace_hints::convert_candidates_to_name_hint ()
6555 /* How many candidates do we have? */
6557 /* If we have just one candidate, issue a name_hint with it as a suggestion
6558 (so that consumers are able to suggest it within the error message and emit
6559 it as a fix-it hint), and with a note showing the candidate's location. */
6560 if (m_candidates
.length () == 1)
6562 tree candidate
= m_candidates
[0];
6563 /* Clean up CANDIDATES. */
6564 m_candidates
.release ();
6565 return name_hint (expr_to_string (candidate
),
6566 new show_candidate_location (m_loc
, candidate
));
6568 else if (m_candidates
.length () > 1)
6569 /* If we have more than one candidate, issue a name_hint without a single
6570 "suggestion", but with a deferred diagnostic that lists the
6571 various candidates. This takes ownership of m_candidates. */
6572 return name_hint (NULL
, new suggest_alternatives (m_loc
, m_candidates
));
6574 /* Otherwise, m_candidates ought to be empty, so no cleanup is necessary. */
6575 gcc_assert (m_candidates
.length () == 0);
6576 gcc_assert (m_candidates
== vNULL
);
6578 return name_hint ();
6581 /* If --param cxx-max-namespaces-for-diagnostic-help was reached,
6582 then we want to emit a note about after the error, but before
6583 any other deferred diagnostics.
6585 Handle this by figuring out what hint is needed, then optionally
6586 decorating HINT with a namespace_limit_reached wrapper. */
6589 namespace_hints::maybe_decorate_with_limit (name_hint hint
)
6592 return name_hint (hint
.suggestion (),
6593 new namespace_limit_reached (m_loc
, m_limit
,
6595 hint
.take_deferred ()));
6600 /* Look inside SCOPED_ENUM for exact matches for NAME.
6601 If one is found, add its CONST_DECL to m_candidates. */
6604 namespace_hints::maybe_add_candidate_for_scoped_enum (tree scoped_enum
,
6607 gcc_assert (SCOPED_ENUM_P (scoped_enum
));
6609 for (tree iter
= TYPE_VALUES (scoped_enum
); iter
; iter
= TREE_CHAIN (iter
))
6611 tree id
= TREE_PURPOSE (iter
);
6614 m_candidates
.safe_push (TREE_VALUE (iter
));
6620 /* Generate a name_hint at LOCATION for NAME, an IDENTIFIER_NODE for which
6623 Search through all available namespaces and any scoped enums within them
6624 and generate a suggestion and/or a deferred diagnostic that lists possible
6627 If no exact matches are found, and SUGGEST_MISSPELLINGS is true, then also
6628 look for near-matches and suggest the best near-match, if there is one.
6630 If nothing is found, then an empty name_hint is returned. */
6633 suggest_alternatives_for (location_t location
, tree name
,
6634 bool suggest_misspellings
)
6636 /* First, search for exact matches in other namespaces. */
6637 namespace_hints
ns_hints (location
, name
);
6638 name_hint result
= ns_hints
.convert_candidates_to_name_hint ();
6640 /* Otherwise, try other approaches. */
6642 result
= suggest_alternatives_for_1 (location
, name
, suggest_misspellings
);
6644 return ns_hints
.maybe_decorate_with_limit (std::move (result
));
6647 /* The second half of suggest_alternatives_for, for when no exact matches
6648 were found in other namespaces. */
6651 suggest_alternatives_for_1 (location_t location
, tree name
,
6652 bool suggest_misspellings
)
6654 /* No candidates were found in the available namespaces. */
6656 /* If there's a "using namespace std;" active, and this
6657 is one of the most common "std::" names, then it's probably a
6658 missing #include. */
6659 if (has_using_namespace_std_directive_p ())
6661 name_hint hint
= maybe_suggest_missing_std_header (location
, name
);
6666 /* Otherwise, consider misspellings. */
6667 if (!suggest_misspellings
)
6668 return name_hint ();
6670 return lookup_name_fuzzy (name
, FUZZY_LOOKUP_NAME
, location
);
6673 /* Generate a name_hint at LOCATION for NAME, an IDENTIFIER_NODE for which
6676 Search through all available namespaces and generate a suggestion and/or
6677 a deferred diagnostic that lists possible candidate(s).
6679 This is similiar to suggest_alternatives_for, but doesn't fallback to
6680 the other approaches used by that function. */
6683 suggest_alternatives_in_other_namespaces (location_t location
, tree name
)
6685 namespace_hints
ns_hints (location
, name
);
6687 name_hint result
= ns_hints
.convert_candidates_to_name_hint ();
6689 return ns_hints
.maybe_decorate_with_limit (std::move (result
));
6692 /* A well-known name within the C++ standard library, returned by
6695 The gperf-generated file contains the definition of the class
6696 "std_name_hint_lookup" with a static member function which
6697 returns the pointer to a structure "std_name_hint" which
6698 is also defined in that file. */
6700 #include "std-name-hint.h"
6702 /* Subroutine of maybe_suggest_missing_header for handling unrecognized names
6703 for some of the most common names within "std::".
6704 Given non-NULL NAME, return the std_name_hint for it, or NULL. */
6706 static const std_name_hint
*
6707 get_std_name_hint (const char *name
)
6709 return std_name_hint_lookup::find(name
, strlen(name
));
6712 /* Describe DIALECT. */
6715 get_cxx_dialect_name (enum cxx_dialect dialect
)
6736 /* Subclass of deferred_diagnostic for use for names in the "std" namespace
6737 that weren't recognized, but for which we know which header it ought to be
6740 Emit a note either suggesting the header to be included, or noting that
6741 the current dialect is too early for the given name. */
6743 class missing_std_header
: public deferred_diagnostic
6746 missing_std_header (location_t loc
,
6747 const char *name_str
,
6748 const std_name_hint
*header_hint
)
6749 : deferred_diagnostic (loc
),
6750 m_name_str (name_str
),
6751 m_header_hint (header_hint
)
6753 ~missing_std_header ()
6755 gcc_rich_location
richloc (get_location ());
6756 if (cxx_dialect
>= m_header_hint
->min_dialect
)
6758 const char *header
= m_header_hint
->header
;
6759 maybe_add_include_fixit (&richloc
, header
, true);
6761 "%<std::%s%> is defined in header %qs;"
6762 " did you forget to %<#include %s%>?",
6763 m_name_str
, header
, header
);
6767 "%<std::%s%> is only available from %s onwards",
6768 m_name_str
, get_cxx_dialect_name (m_header_hint
->min_dialect
));
6772 const char *m_name_str
;
6773 const std_name_hint
*m_header_hint
;
6776 /* Attempt to generate a name_hint that suggests pertinent header files
6777 for NAME at LOCATION, for common names within the "std" namespace,
6778 or an empty name_hint if this isn't applicable. */
6781 maybe_suggest_missing_std_header (location_t location
, tree name
)
6783 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
);
6785 const char *name_str
= IDENTIFIER_POINTER (name
);
6786 const std_name_hint
*header_hint
= get_std_name_hint (name_str
);
6788 return name_hint ();
6790 return name_hint (NULL
, new missing_std_header (location
, name_str
,
6794 /* Attempt to generate a name_hint that suggests a missing header file
6795 for NAME within SCOPE at LOCATION, or an empty name_hint if this isn't
6799 maybe_suggest_missing_header (location_t location
, tree name
, tree scope
)
6801 if (scope
== NULL_TREE
)
6802 return name_hint ();
6803 if (TREE_CODE (scope
) != NAMESPACE_DECL
)
6804 return name_hint ();
6805 /* We only offer suggestions for the "std" namespace. */
6806 if (scope
!= std_node
)
6807 return name_hint ();
6808 return maybe_suggest_missing_std_header (location
, name
);
6811 /* Generate a name_hint at LOCATION for NAME, an IDENTIFIER_NODE for which name
6812 lookup failed within the explicitly provided SCOPE.
6814 Suggest the best meaningful candidates (if any), otherwise
6815 an empty name_hint is returned. */
6818 suggest_alternative_in_explicit_scope (location_t location
, tree name
,
6821 /* Something went very wrong; don't suggest anything. */
6822 if (name
== error_mark_node
)
6823 return name_hint ();
6825 /* Resolve any namespace aliases. */
6826 scope
= ORIGINAL_NAMESPACE (scope
);
6828 name_hint hint
= maybe_suggest_missing_header (location
, name
, scope
);
6832 cp_binding_level
*level
= NAMESPACE_LEVEL (scope
);
6834 best_match
<tree
, const char *> bm (name
);
6835 consider_binding_level (name
, bm
, level
, false, FUZZY_LOOKUP_NAME
);
6837 /* See if we have a good suggesion for the user. */
6838 const char *fuzzy_name
= bm
.get_best_meaningful_candidate ();
6840 return name_hint (fuzzy_name
, NULL
);
6842 return name_hint ();
6845 /* Given NAME, look within SCOPED_ENUM for possible spell-correction
6849 suggest_alternative_in_scoped_enum (tree name
, tree scoped_enum
)
6851 gcc_assert (SCOPED_ENUM_P (scoped_enum
));
6853 best_match
<tree
, const char *> bm (name
);
6854 for (tree iter
= TYPE_VALUES (scoped_enum
); iter
; iter
= TREE_CHAIN (iter
))
6856 tree id
= TREE_PURPOSE (iter
);
6857 bm
.consider (IDENTIFIER_POINTER (id
));
6859 return name_hint (bm
.get_best_meaningful_candidate (), NULL
);
6862 /* Look up NAME (an IDENTIFIER_NODE) in SCOPE (either a NAMESPACE_DECL
6865 WANT as for lookup_name_1.
6867 Returns a DECL (or OVERLOAD, or BASELINK) representing the
6868 declaration found. If no suitable declaration can be found,
6869 ERROR_MARK_NODE is returned. If COMPLAIN is true and SCOPE is
6870 neither a class-type nor a namespace a diagnostic is issued. */
6873 lookup_qualified_name (tree scope
, tree name
, LOOK_want want
, bool complain
)
6877 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
6879 name_lookup
lookup (name
, want
);
6881 if (qualified_namespace_lookup (scope
, &lookup
))
6885 /* If we have a known type overload, pull it out. This can happen
6887 if (TREE_CODE (t
) == OVERLOAD
&& TREE_TYPE (t
) != unknown_type_node
)
6888 t
= OVL_FUNCTION (t
);
6891 else if (cxx_dialect
!= cxx98
&& TREE_CODE (scope
) == ENUMERAL_TYPE
)
6892 t
= lookup_enumerator (scope
, name
);
6893 else if (is_class_type (scope
, complain
))
6894 t
= lookup_member (scope
, name
, 2, bool (want
& LOOK_want::TYPE
),
6895 tf_warning_or_error
);
6898 return error_mark_node
;
6902 /* Wrapper for the above that takes a string argument. The function name is
6903 not at the beginning of the line to keep this wrapper out of etags. */
6905 tree
lookup_qualified_name (tree t
, const char *p
, LOOK_want w
, bool c
)
6907 return lookup_qualified_name (t
, get_identifier (p
), w
, c
);
6911 Accepts the NAME to lookup and its qualifying SCOPE.
6912 Returns the name/type pair found into the cxx_binding *RESULT,
6913 or false on error. */
6916 qualified_namespace_lookup (tree scope
, name_lookup
*lookup
)
6918 timevar_start (TV_NAME_LOOKUP
);
6919 query_oracle (lookup
->name
);
6920 bool found
= lookup
->search_qualified (ORIGINAL_NAMESPACE (scope
));
6921 timevar_stop (TV_NAME_LOOKUP
);
6925 /* If DECL is suitably visible to the user, consider its name for
6926 spelling correction. */
6929 consider_decl (tree decl
, best_match
<tree
, const char *> &bm
,
6930 bool consider_impl_names
)
6932 /* Skip compiler-generated variables (e.g. __for_begin/__for_end
6933 within range for). */
6934 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_ARTIFICIAL (decl
))
6937 tree suggestion
= DECL_NAME (decl
);
6941 /* Don't suggest names that are for anonymous aggregate types, as
6942 they are an implementation detail generated by the compiler. */
6943 if (IDENTIFIER_ANON_P (suggestion
))
6946 const char *suggestion_str
= IDENTIFIER_POINTER (suggestion
);
6948 /* Ignore internal names with spaces in them. */
6949 if (strchr (suggestion_str
, ' '))
6952 /* Don't suggest names that are reserved for use by the
6953 implementation, unless NAME began with an underscore. */
6954 if (!consider_impl_names
6955 && name_reserved_for_implementation_p (suggestion_str
))
6958 bm
.consider (suggestion_str
);
6961 /* If DECL is suitably visible to the user, add its name to VEC and
6962 return true. Otherwise return false. */
6965 maybe_add_fuzzy_decl (auto_vec
<tree
> &vec
, tree decl
)
6967 /* Skip compiler-generated variables (e.g. __for_begin/__for_end
6968 within range for). */
6969 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_ARTIFICIAL (decl
))
6972 tree suggestion
= DECL_NAME (decl
);
6976 /* Don't suggest names that are for anonymous aggregate types, as
6977 they are an implementation detail generated by the compiler. */
6978 if (IDENTIFIER_ANON_P (suggestion
))
6981 vec
.safe_push (suggestion
);
6986 /* Examing the namespace binding BINDING, and add at most one instance
6987 of the name, if it contains a visible entity of interest. Return
6988 true if we added something. */
6991 maybe_add_fuzzy_binding (auto_vec
<tree
> &vec
, tree binding
,
6992 lookup_name_fuzzy_kind kind
)
6994 tree value
= NULL_TREE
;
6996 if (STAT_HACK_P (binding
))
6998 if (!STAT_TYPE_HIDDEN_P (binding
)
6999 && STAT_TYPE (binding
))
7001 if (maybe_add_fuzzy_decl (vec
, STAT_TYPE (binding
)))
7004 else if (!STAT_DECL_HIDDEN_P (binding
))
7005 value
= STAT_DECL (binding
);
7010 value
= ovl_skip_hidden (value
);
7013 value
= OVL_FIRST (value
);
7014 if (kind
!= FUZZY_LOOKUP_TYPENAME
7015 || TREE_CODE (STRIP_TEMPLATE (value
)) == TYPE_DECL
)
7016 if (maybe_add_fuzzy_decl (vec
, value
))
7020 /* Nothing found. */
7024 /* Helper function for lookup_name_fuzzy.
7025 Traverse binding level LVL, looking for good name matches for NAME
7028 consider_binding_level (tree name
, best_match
<tree
, const char *> &bm
,
7029 cp_binding_level
*lvl
, bool look_within_fields
,
7030 enum lookup_name_fuzzy_kind kind
)
7032 if (look_within_fields
)
7033 if (lvl
->this_entity
&& TREE_CODE (lvl
->this_entity
) == RECORD_TYPE
)
7035 tree type
= lvl
->this_entity
;
7036 bool want_type_p
= (kind
== FUZZY_LOOKUP_TYPENAME
);
7037 tree best_matching_field
7038 = lookup_member_fuzzy (type
, name
, want_type_p
);
7039 if (best_matching_field
)
7040 bm
.consider (IDENTIFIER_POINTER (best_matching_field
));
7043 /* Only suggest names reserved for the implementation if NAME begins
7044 with an underscore. */
7045 bool consider_implementation_names
= (IDENTIFIER_POINTER (name
)[0] == '_');
7047 if (lvl
->kind
!= sk_namespace
)
7048 for (tree t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
7052 /* OVERLOADs or decls from using declaration are wrapped into
7054 if (TREE_CODE (d
) == TREE_LIST
)
7055 d
= OVL_FIRST (TREE_VALUE (d
));
7057 /* Don't use bindings from implicitly declared functions,
7058 as they were likely misspellings themselves. */
7059 if (TREE_TYPE (d
) == error_mark_node
)
7062 /* If we want a typename, ignore non-types. */
7063 if (kind
== FUZZY_LOOKUP_TYPENAME
7064 && TREE_CODE (STRIP_TEMPLATE (d
)) != TYPE_DECL
)
7067 consider_decl (d
, bm
, consider_implementation_names
);
7071 /* We need to iterate over the namespace hash table, in order to
7072 not mention hidden entities. But hash table iteration is
7073 (essentially) unpredictable, our correction-distance measure
7074 is very granular, and we pick the first of equal distances.
7075 Hence, we need to call the distance-measurer in a predictable
7076 order. So, iterate over the namespace hash, inserting
7077 visible names into a vector. Then sort the vector. Then
7078 determine spelling distance. */
7080 tree ns
= lvl
->this_entity
;
7083 hash_table
<named_decl_hash
>::iterator end
7084 (DECL_NAMESPACE_BINDINGS (ns
)->end ());
7085 for (hash_table
<named_decl_hash
>::iterator iter
7086 (DECL_NAMESPACE_BINDINGS (ns
)->begin ()); iter
!= end
; ++iter
)
7088 tree binding
= *iter
;
7090 if (TREE_CODE (binding
) == BINDING_VECTOR
)
7092 bitmap imports
= get_import_bitmap ();
7093 binding_cluster
*cluster
= BINDING_VECTOR_CLUSTER_BASE (binding
);
7095 if (tree bind
= cluster
->slots
[BINDING_SLOT_CURRENT
])
7096 if (maybe_add_fuzzy_binding (vec
, bind
, kind
))
7099 /* Scan the imported bindings. */
7100 unsigned ix
= BINDING_VECTOR_NUM_CLUSTERS (binding
);
7101 if (BINDING_VECTOR_SLOTS_PER_CLUSTER
== BINDING_SLOTS_FIXED
)
7107 for (; ix
--; cluster
++)
7108 for (unsigned jx
= 0; jx
!= BINDING_VECTOR_SLOTS_PER_CLUSTER
;
7111 /* Are we importing this module? */
7112 if (unsigned base
= cluster
->indices
[jx
].base
)
7113 if (unsigned span
= cluster
->indices
[jx
].span
)
7115 if (bitmap_bit_p (imports
, base
))
7117 while (++base
, --span
);
7122 if (cluster
->slots
[jx
].is_lazy ())
7123 /* Let's not read in everything on the first
7126 if (tree bind
= cluster
->slots
[jx
])
7127 if (maybe_add_fuzzy_binding (vec
, bind
, kind
))
7132 maybe_add_fuzzy_binding (vec
, binding
, kind
);
7135 vec
.qsort ([] (const void *a_
, const void *b_
)
7137 return strcmp (IDENTIFIER_POINTER (*(const tree
*)a_
),
7138 IDENTIFIER_POINTER (*(const tree
*)b_
));
7141 /* Examine longest to shortest. */
7142 for (unsigned ix
= vec
.length (); ix
--;)
7144 const char *str
= IDENTIFIER_POINTER (vec
[ix
]);
7146 /* Ignore internal names with spaces in them. */
7147 if (strchr (str
, ' '))
7150 /* Don't suggest names that are reserved for use by the
7151 implementation, unless NAME began with an underscore. */
7152 if (!consider_implementation_names
7153 && name_reserved_for_implementation_p (str
))
7161 /* Subclass of deferred_diagnostic. Notify the user that the
7162 given macro was used before it was defined.
7163 This can be done in the C++ frontend since tokenization happens
7166 class macro_use_before_def
: public deferred_diagnostic
7169 /* Factory function. Return a new macro_use_before_def instance if
7170 appropriate, or return NULL. */
7171 static macro_use_before_def
*
7172 maybe_make (location_t use_loc
, cpp_hashnode
*macro
)
7174 location_t def_loc
= cpp_macro_definition_location (macro
);
7175 if (def_loc
== UNKNOWN_LOCATION
)
7178 /* We only want to issue a note if the macro was used *before* it was
7180 We don't want to issue a note for cases where a macro was incorrectly
7181 used, leaving it unexpanded (e.g. by using the wrong argument
7183 if (!linemap_location_before_p (line_table
, use_loc
, def_loc
))
7186 return new macro_use_before_def (use_loc
, macro
);
7190 /* Ctor. LOC is the location of the usage. MACRO is the
7191 macro that was used. */
7192 macro_use_before_def (location_t loc
, cpp_hashnode
*macro
)
7193 : deferred_diagnostic (loc
), m_macro (macro
)
7198 ~macro_use_before_def ()
7200 if (is_suppressed_p ())
7203 inform (get_location (), "the macro %qs had not yet been defined",
7204 (const char *)m_macro
->ident
.str
);
7205 inform (cpp_macro_definition_location (m_macro
),
7206 "it was later defined here");
7210 cpp_hashnode
*m_macro
;
7213 /* Determine if it can ever make sense to offer RID as a suggestion for
7216 Subroutine of lookup_name_fuzzy. */
7219 suggest_rid_p (enum rid rid
)
7223 /* Support suggesting function-like keywords. */
7224 case RID_STATIC_ASSERT
:
7228 /* Support suggesting the various decl-specifier words, to handle
7229 e.g. "singed" vs "signed" typos. */
7230 if (cp_keyword_starts_decl_specifier_p (rid
))
7233 /* Otherwise, don't offer it. This avoids suggesting e.g. "if"
7234 and "do" for short misspellings, which are likely to lead to
7235 nonsensical results. */
7240 /* Search for near-matches for NAME within the current bindings, and within
7241 macro names, returning the best match as a const char *, or NULL if
7242 no reasonable match is found.
7244 Use LOC for any deferred diagnostics. */
7247 lookup_name_fuzzy (tree name
, enum lookup_name_fuzzy_kind kind
, location_t loc
)
7249 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
);
7251 /* First, try some well-known names in the C++ standard library, in case
7252 the user forgot a #include. */
7253 const char *header_hint
7254 = get_cp_stdlib_header_for_name (IDENTIFIER_POINTER (name
));
7256 return name_hint (NULL
,
7257 new suggest_missing_header (loc
,
7258 IDENTIFIER_POINTER (name
),
7261 best_match
<tree
, const char *> bm (name
);
7263 cp_binding_level
*lvl
;
7264 for (lvl
= scope_chain
->class_bindings
; lvl
; lvl
= lvl
->level_chain
)
7265 consider_binding_level (name
, bm
, lvl
, true, kind
);
7267 for (lvl
= current_binding_level
; lvl
; lvl
= lvl
->level_chain
)
7268 consider_binding_level (name
, bm
, lvl
, false, kind
);
7270 /* Consider macros: if the user misspelled a macro name e.g. "SOME_MACRO"
7272 x = SOME_OTHER_MACRO (y);
7273 then "SOME_OTHER_MACRO" will survive to the frontend and show up
7274 as a misspelled identifier.
7276 Use the best distance so far so that a candidate is only set if
7277 a macro is better than anything so far. This allows early rejection
7278 (without calculating the edit distance) of macro names that must have
7279 distance >= bm.get_best_distance (), and means that we only get a
7280 non-NULL result for best_macro_match if it's better than any of
7281 the identifiers already checked. */
7282 best_macro_match
bmm (name
, bm
.get_best_distance (), parse_in
);
7283 cpp_hashnode
*best_macro
= bmm
.get_best_meaningful_candidate ();
7284 /* If a macro is the closest so far to NAME, consider it. */
7286 bm
.consider ((const char *)best_macro
->ident
.str
);
7287 else if (bmm
.get_best_distance () == 0)
7289 /* If we have an exact match for a macro name, then either the
7290 macro was used with the wrong argument count, or the macro
7291 has been used before it was defined. */
7292 if (cpp_hashnode
*macro
= bmm
.blithely_get_best_candidate ())
7293 if (cpp_user_macro_p (macro
))
7294 return name_hint (NULL
,
7295 macro_use_before_def::maybe_make (loc
, macro
));
7298 /* Try the "starts_decl_specifier_p" keywords to detect
7299 "singed" vs "signed" typos. */
7300 for (unsigned i
= 0; i
< num_c_common_reswords
; i
++)
7302 const c_common_resword
*resword
= &c_common_reswords
[i
];
7304 if (!suggest_rid_p (resword
->rid
))
7307 tree resword_identifier
= ridpointers
[resword
->rid
];
7308 if (!resword_identifier
)
7310 gcc_assert (TREE_CODE (resword_identifier
) == IDENTIFIER_NODE
);
7312 /* Only consider reserved words that survived the
7313 filtering in init_reswords (e.g. for -std). */
7314 if (!IDENTIFIER_KEYWORD_P (resword_identifier
))
7317 bm
.consider (IDENTIFIER_POINTER (resword_identifier
));
7320 return name_hint (bm
.get_best_meaningful_candidate (), NULL
);
7323 /* Subroutine of outer_binding.
7325 Returns TRUE if BINDING is a binding to a template parameter of
7326 SCOPE. In that case SCOPE is the scope of a primary template
7327 parameter -- in the sense of G++, i.e, a template that has its own
7330 Returns FALSE otherwise. */
7333 binding_to_template_parms_of_scope_p (cxx_binding
*binding
,
7334 cp_binding_level
*scope
)
7336 tree binding_value
, tmpl
, tinfo
;
7339 if (!binding
|| !scope
|| !scope
->this_entity
)
7342 binding_value
= binding
->value
? binding
->value
: binding
->type
;
7343 tinfo
= get_template_info (scope
->this_entity
);
7345 /* BINDING_VALUE must be a template parm. */
7346 if (binding_value
== NULL_TREE
7347 || (!DECL_P (binding_value
)
7348 || !DECL_TEMPLATE_PARM_P (binding_value
)))
7351 /* The level of BINDING_VALUE. */
7353 template_type_parameter_p (binding_value
)
7354 ? TEMPLATE_PARM_LEVEL (TEMPLATE_TYPE_PARM_INDEX
7355 (TREE_TYPE (binding_value
)))
7356 : TEMPLATE_PARM_LEVEL (DECL_INITIAL (binding_value
));
7358 /* The template of the current scope, iff said scope is a primary
7361 && PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
7362 ? TI_TEMPLATE (tinfo
)
7365 /* If the level of the parm BINDING_VALUE equals the depth of TMPL,
7366 then BINDING_VALUE is a parameter of TMPL. */
7367 return (tmpl
&& level
== TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)));
7370 /* Return the innermost non-namespace binding for NAME from a scope
7371 containing BINDING, or, if BINDING is NULL, the current scope.
7372 Please note that for a given template, the template parameters are
7373 considered to be in the scope containing the current scope.
7374 If CLASS_P is false, then class bindings are ignored. */
7377 outer_binding (tree name
,
7378 cxx_binding
*binding
,
7382 cp_binding_level
*scope
;
7383 cp_binding_level
*outer_scope
;
7387 scope
= binding
->scope
->level_chain
;
7388 outer
= binding
->previous
;
7392 scope
= current_binding_level
;
7393 outer
= IDENTIFIER_BINDING (name
);
7395 outer_scope
= outer
? outer
->scope
: NULL
;
7397 /* Because we create class bindings lazily, we might be missing a
7398 class binding for NAME. If there are any class binding levels
7399 between the LAST_BINDING_LEVEL and the scope in which OUTER was
7400 declared, we must lookup NAME in those class scopes. */
7402 while (scope
&& scope
!= outer_scope
&& scope
->kind
!= sk_namespace
)
7404 if (scope
->kind
== sk_class
)
7406 cxx_binding
*class_binding
;
7408 class_binding
= get_class_binding (name
, scope
);
7411 /* Thread this new class-scope binding onto the
7412 IDENTIFIER_BINDING list so that future lookups
7414 if (BASELINK_P (class_binding
->value
))
7415 /* Don't put a BASELINK in IDENTIFIER_BINDING. */
7416 class_binding
->value
7417 = BASELINK_FUNCTIONS (class_binding
->value
);
7418 class_binding
->previous
= outer
;
7420 binding
->previous
= class_binding
;
7422 IDENTIFIER_BINDING (name
) = class_binding
;
7423 return class_binding
;
7426 /* If we are in a member template, the template parms of the member
7427 template are considered to be inside the scope of the containing
7428 class, but within G++ the class bindings are all pushed between the
7429 template parms and the function body. So if the outer binding is
7430 a template parm for the current scope, return it now rather than
7431 look for a class binding. */
7432 if (outer_scope
&& outer_scope
->kind
== sk_template_parms
7433 && binding_to_template_parms_of_scope_p (outer
, scope
))
7436 scope
= scope
->level_chain
;
7442 /* Return the innermost block-scope or class-scope value binding for
7443 NAME, or NULL_TREE if there is no such binding. */
7446 innermost_non_namespace_value (tree name
)
7448 cxx_binding
*binding
;
7449 binding
= outer_binding (name
, /*binding=*/NULL
, /*class_p=*/true);
7450 return binding
? binding
->value
: NULL_TREE
;
7453 /* Look up NAME in the current binding level and its superiors in the
7454 namespace of variables, functions and typedefs. Return a ..._DECL
7455 node of some kind representing its definition if there is only one
7456 such declaration, or return a TREE_LIST with all the overloaded
7457 definitions if there are many, or return NULL_TREE if it is undefined.
7458 Hidden name, either friend declaration or built-in function, are
7461 WHERE controls which scopes are considered. It is a bit mask of
7462 LOOK_where::BLOCK (look in block scope), LOOK_where::CLASS
7463 (look in class scopes) & LOOK_where::NAMESPACE (look in namespace
7464 scopes). It is an error for no bits to be set. These scopes are
7465 searched from innermost to outermost.
7467 WANT controls what kind of entity we'd happy with.
7468 LOOK_want::NORMAL for normal lookup (implicit typedefs can be
7469 hidden). LOOK_want::TYPE for only TYPE_DECLS, LOOK_want::NAMESPACE
7470 for only NAMESPACE_DECLS. These two can be bit-ored to find
7473 WANT can also have LOOK_want::HIDDEN_FRIEND or
7474 LOOK_want::HIDDEN_LAMBDa added to it. */
7477 lookup_name (tree name
, LOOK_where where
, LOOK_want want
)
7479 tree val
= NULL_TREE
;
7481 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
7483 gcc_checking_assert (unsigned (where
) != 0);
7484 /* If we're looking for hidden lambda things, we shouldn't be
7485 looking in namespace scope. */
7486 gcc_checking_assert (!bool (want
& LOOK_want::HIDDEN_LAMBDA
)
7487 || !bool (where
& LOOK_where::NAMESPACE
));
7488 query_oracle (name
);
7490 /* Conversion operators are handled specially because ordinary
7491 unqualified name lookup will not find template conversion
7493 if (IDENTIFIER_CONV_OP_P (name
))
7495 cp_binding_level
*level
;
7497 for (level
= current_binding_level
;
7498 level
&& level
->kind
!= sk_namespace
;
7499 level
= level
->level_chain
)
7504 /* A conversion operator can only be declared in a class
7506 if (level
->kind
!= sk_class
)
7509 /* Lookup the conversion operator in the class. */
7510 class_type
= level
->this_entity
;
7511 operators
= lookup_fnfields (class_type
, name
, /*protect=*/0,
7512 tf_warning_or_error
);
7520 /* First, look in non-namespace scopes. */
7522 if (current_class_type
== NULL_TREE
)
7523 /* Maybe avoid searching the binding stack at all. */
7524 where
= LOOK_where (unsigned (where
) & ~unsigned (LOOK_where::CLASS
));
7526 if (bool (where
& (LOOK_where::BLOCK
| LOOK_where::CLASS
)))
7527 for (cxx_binding
*iter
= nullptr;
7528 (iter
= outer_binding (name
, iter
, bool (where
& LOOK_where::CLASS
)));)
7530 /* Skip entities we don't want. */
7531 if (!bool (where
& (LOCAL_BINDING_P (iter
)
7532 ? LOOK_where::BLOCK
: LOOK_where::CLASS
)))
7535 /* If this is the kind of thing we're looking for, we're done. */
7538 tree binding
= NULL_TREE
;
7540 if (!(!iter
->type
&& HIDDEN_TYPE_BINDING_P (iter
))
7541 && (bool (want
& LOOK_want::HIDDEN_LAMBDA
)
7542 || !is_lambda_ignored_entity (iter
->value
))
7543 && qualify_lookup (iter
->value
, want
))
7544 binding
= iter
->value
;
7545 else if (bool (want
& LOOK_want::TYPE
)
7546 && !HIDDEN_TYPE_BINDING_P (iter
)
7548 binding
= iter
->type
;
7558 /* Now lookup in namespace scopes. */
7559 if (!val
&& bool (where
& LOOK_where::NAMESPACE
))
7561 name_lookup
lookup (name
, want
);
7562 if (lookup
.search_unqualified
7563 (current_decl_namespace (), current_binding_level
))
7567 /* If we have a known type overload, pull it out. This can happen
7568 for both using decls and unhidden functions. */
7569 if (val
&& TREE_CODE (val
) == OVERLOAD
&& TREE_TYPE (val
) != unknown_type_node
)
7570 val
= OVL_FUNCTION (val
);
7576 lookup_name (tree name
)
7578 return lookup_name (name
, LOOK_where::ALL
, LOOK_want::NORMAL
);
7581 /* Look up NAME for type used in elaborated name specifier in
7582 the scopes given by HOW.
7584 Unlike lookup_name_1, we make sure that NAME is actually
7585 declared in the desired scope, not from inheritance, nor using
7586 directive. For using declaration, there is DR138 still waiting
7587 to be resolved. Hidden name coming from an earlier friend
7588 declaration is also returned, and will be made visible unless HOW
7589 is TAG_how::HIDDEN_FRIEND.
7591 A TYPE_DECL best matching the NAME is returned. Catching error
7592 and issuing diagnostics are caller's responsibility. */
7595 lookup_elaborated_type (tree name
, TAG_how how
)
7597 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
7599 cp_binding_level
*b
= current_binding_level
;
7601 if (b
->kind
!= sk_namespace
)
7602 /* Look in non-namespace scopes. */
7603 for (cxx_binding
*iter
= NULL
;
7604 (iter
= outer_binding (name
, iter
, /*class_p=*/ true)); )
7606 /* First check we're supposed to be looking in this scope --
7607 if we're not, we're done. */
7608 for (; b
!= iter
->scope
; b
= b
->level_chain
)
7609 if (!(b
->kind
== sk_cleanup
7610 || b
->kind
== sk_template_parms
7611 || b
->kind
== sk_function_parms
7612 || (b
->kind
== sk_class
&& how
!= TAG_how::CURRENT_ONLY
)))
7615 /* Check if this is the kind of thing we're looking for. If
7616 HOW is TAG_how::CURRENT_ONLY, also make sure it doesn't
7617 come from base class. For ITER->VALUE, we can simply use
7618 INHERITED_VALUE_BINDING_P. For ITER->TYPE, we have to use
7621 We check ITER->TYPE before ITER->VALUE in order to handle
7622 typedef struct C {} C;
7625 if (tree type
= iter
->type
)
7627 if (qualify_lookup (type
, LOOK_want::TYPE
)
7628 && (how
!= TAG_how::CURRENT_ONLY
7629 || LOCAL_BINDING_P (iter
)
7630 || DECL_CONTEXT (type
) == iter
->scope
->this_entity
))
7632 if (how
!= TAG_how::HIDDEN_FRIEND
)
7633 /* It is no longer a hidden binding. */
7634 HIDDEN_TYPE_BINDING_P (iter
) = false;
7641 if (qualify_lookup (iter
->value
, LOOK_want::TYPE
)
7642 && (how
!= TAG_how::CURRENT_ONLY
7643 || !INHERITED_VALUE_BINDING_P (iter
)))
7645 if (how
!= TAG_how::HIDDEN_FRIEND
&& !iter
->type
)
7646 /* It is no longer a hidden binding. */
7647 HIDDEN_TYPE_BINDING_P (iter
) = false;
7654 /* Now check if we can look in namespace scope. */
7655 for (; b
->kind
!= sk_namespace
; b
= b
->level_chain
)
7656 if (!(b
->kind
== sk_cleanup
7657 || b
->kind
== sk_template_parms
7658 || b
->kind
== sk_function_parms
7659 || (b
->kind
== sk_class
&& how
!= TAG_how::CURRENT_ONLY
)))
7662 /* Look in the innermost namespace. */
7663 tree ns
= b
->this_entity
;
7664 if (tree
*slot
= find_namespace_slot (ns
, name
))
7667 if (TREE_CODE (bind
) == BINDING_VECTOR
)
7668 bind
= BINDING_VECTOR_CLUSTER (bind
, 0).slots
[BINDING_SLOT_CURRENT
];
7672 /* If this is the kind of thing we're looking for, we're done. */
7673 if (tree type
= MAYBE_STAT_TYPE (bind
))
7675 if (how
!= TAG_how::HIDDEN_FRIEND
)
7676 /* No longer hidden. */
7677 STAT_TYPE_HIDDEN_P (*slot
) = false;
7681 else if (tree decl
= MAYBE_STAT_DECL (bind
))
7683 if (qualify_lookup (decl
, LOOK_want::TYPE
))
7685 if (how
!= TAG_how::HIDDEN_FRIEND
&& STAT_HACK_P (bind
)
7686 && STAT_DECL_HIDDEN_P (bind
))
7688 if (STAT_TYPE (bind
))
7689 STAT_DECL_HIDDEN_P (bind
) = false;
7692 /* There is no type, just remove the stat
7697 BINDING_VECTOR_CLUSTER (*slot
, 0)
7698 .slots
[BINDING_SLOT_CURRENT
] = decl
;
7706 if (TREE_CODE (*slot
) == BINDING_VECTOR
)
7708 /* We could be redeclaring a global module entity, (from GMF
7709 or header unit), or from another partition, or
7710 specializing an imported template. */
7711 bitmap imports
= get_import_bitmap ();
7712 binding_cluster
*cluster
= BINDING_VECTOR_CLUSTER_BASE (*slot
);
7714 /* Scan the imported bindings. */
7715 unsigned ix
= BINDING_VECTOR_NUM_CLUSTERS (*slot
);
7716 if (BINDING_VECTOR_SLOTS_PER_CLUSTER
== BINDING_SLOTS_FIXED
)
7722 /* Do this in forward order, so we load modules in an order
7723 the user expects. */
7724 for (; ix
--; cluster
++)
7725 for (unsigned jx
= 0; jx
!= BINDING_VECTOR_SLOTS_PER_CLUSTER
; jx
++)
7727 /* Are we importing this module? */
7728 if (unsigned base
= cluster
->indices
[jx
].base
)
7729 if (unsigned span
= cluster
->indices
[jx
].span
)
7731 if (bitmap_bit_p (imports
, base
))
7733 while (++base
, --span
);
7738 if (cluster
->slots
[jx
].is_lazy ())
7740 gcc_assert (cluster
->indices
[jx
].span
== 1);
7741 lazy_load_binding (cluster
->indices
[jx
].base
,
7742 ns
, name
, &cluster
->slots
[jx
]);
7744 tree bind
= cluster
->slots
[jx
];
7746 /* Load errors could mean there's nothing here. */
7749 /* Extract what we can see from here. If there's no
7750 stat_hack, then everything was exported. */
7751 tree type
= NULL_TREE
;
7753 /* If no stat hack, everything is visible. */
7754 if (STAT_HACK_P (bind
))
7756 if (STAT_TYPE_VISIBLE_P (bind
))
7757 type
= STAT_TYPE (bind
);
7758 bind
= STAT_VISIBLE (bind
);
7761 if (type
&& qualify_lookup (type
, LOOK_want::TYPE
))
7764 if (bind
&& qualify_lookup (bind
, LOOK_want::TYPE
))
7768 if (!module_purview_p ())
7770 /* We're in the global module, perhaps there's a tag
7772 // FIXME: This isn't quite right, if we find something
7773 // here, from the language PoV we're not supposed to
7782 /* The type TYPE is being declared. If it is a class template, or a
7783 specialization of a class template, do any processing required and
7784 perform error-checking. If IS_FRIEND is nonzero, this TYPE is
7785 being declared a friend. B is the binding level at which this TYPE
7788 Returns the TYPE_DECL for TYPE, which may have been altered by this
7792 maybe_process_template_type_declaration (tree type
, int is_friend
,
7793 cp_binding_level
*b
)
7795 tree decl
= TYPE_NAME (type
);
7797 if (processing_template_parmlist
)
7798 /* You can't declare a new template type in a template parameter
7799 list. But, you can declare a non-template type:
7801 template <class A*> struct S;
7803 is a forward-declaration of `A'. */
7805 else if (b
->kind
== sk_namespace
7806 && current_binding_level
->kind
!= sk_namespace
)
7807 /* If this new type is being injected into a containing scope,
7808 then it's not a template type. */
7812 gcc_assert (MAYBE_CLASS_TYPE_P (type
)
7813 || TREE_CODE (type
) == ENUMERAL_TYPE
);
7815 if (processing_template_decl
)
7817 decl
= push_template_decl (decl
, is_friend
);
7818 if (decl
== error_mark_node
)
7819 return error_mark_node
;
7821 /* If the current binding level is the binding level for the
7822 template parameters (see the comment in
7823 begin_template_parm_list) and the enclosing level is a class
7824 scope, and we're not looking at a friend, push the
7825 declaration of the member class into the class scope. In the
7826 friend case, push_template_decl will already have put the
7827 friend into global scope, if appropriate. */
7828 if (TREE_CODE (type
) != ENUMERAL_TYPE
7829 && !is_friend
&& b
->kind
== sk_template_parms
7830 && b
->level_chain
->kind
== sk_class
)
7832 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
7834 if (!COMPLETE_TYPE_P (current_class_type
))
7835 maybe_add_class_template_decl_list (current_class_type
,
7836 type
, /*friend_p=*/0);
7844 /* Push a tag name NAME for struct/class/union/enum type TYPE. In case
7845 that the NAME is a class template, the tag is processed but not pushed.
7847 The pushed scope depend on the SCOPE parameter:
7848 - When SCOPE is TS_CURRENT, put it into the inner-most non-sk_cleanup
7850 - When SCOPE is TS_GLOBAL, put it in the inner-most non-class and
7851 non-template-parameter scope. This case is needed for forward
7853 - When SCOPE is TS_WITHIN_ENCLOSING_NON_CLASS, this is similar to
7854 TS_GLOBAL case except that names within template-parameter scopes
7855 are not pushed at all.
7857 Returns TYPE upon success and ERROR_MARK_NODE otherwise. */
7860 pushtag (tree name
, tree type
, TAG_how how
)
7864 gcc_assert (identifier_p (name
));
7866 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
7868 cp_binding_level
*b
= current_binding_level
;
7871 if (/* Cleanup scopes are not scopes from the point of view of
7873 b
->kind
== sk_cleanup
7874 /* Neither are function parameter scopes. */
7875 || b
->kind
== sk_function_parms
7876 /* Neither are the scopes used to hold template parameters
7877 for an explicit specialization. For an ordinary template
7878 declaration, these scopes are not scopes from the point of
7879 view of the language. */
7880 || (b
->kind
== sk_template_parms
7881 && (b
->explicit_spec_p
|| how
== TAG_how::GLOBAL
)))
7883 else if (b
->kind
== sk_class
&& how
!= TAG_how::CURRENT_ONLY
)
7886 if (b
->kind
== sk_template_parms
)
7893 /* Do C++ gratuitous typedefing. */
7894 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != type
)
7897 tree context
= TYPE_CONTEXT (type
);
7901 cp_binding_level
*cb
= b
;
7902 while (cb
->kind
!= sk_namespace
7903 && cb
->kind
!= sk_class
7904 && (cb
->kind
!= sk_function_parms
7905 || !cb
->this_entity
))
7906 cb
= cb
->level_chain
;
7907 tree cs
= cb
->this_entity
;
7909 gcc_checking_assert (TREE_CODE (cs
) == FUNCTION_DECL
7910 ? cs
== current_function_decl
7911 : TYPE_P (cs
) ? cs
== current_class_type
7912 : cs
== current_namespace
);
7914 if (how
== TAG_how::CURRENT_ONLY
7915 || (cs
&& TREE_CODE (cs
) == FUNCTION_DECL
))
7917 else if (cs
&& TYPE_P (cs
))
7918 /* When declaring a friend class of a local class, we want
7919 to inject the newly named class into the scope
7920 containing the local class, not the namespace
7922 context
= decl_function_context (get_type_decl (cs
));
7925 context
= current_namespace
;
7927 tdef
= create_implicit_typedef (name
, type
);
7928 DECL_CONTEXT (tdef
) = FROB_CONTEXT (context
);
7929 set_originating_module (tdef
);
7931 decl
= maybe_process_template_type_declaration
7932 (type
, how
== TAG_how::HIDDEN_FRIEND
, b
);
7933 if (decl
== error_mark_node
)
7936 if (b
->kind
== sk_class
)
7938 if (!TYPE_BEING_DEFINED (current_class_type
))
7939 /* Don't push anywhere if the class is complete; a lambda in an
7940 NSDMI is not a member of the class. */
7942 else if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
7943 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
7944 class. But if it's a member template class, we want
7945 the TEMPLATE_DECL, not the TYPE_DECL, so this is done
7947 finish_member_declaration (decl
);
7949 pushdecl_class_level (decl
);
7951 else if (b
->kind
== sk_template_parms
)
7953 /* Do not push the tag here -- we'll want to push the
7955 if (b
->level_chain
->kind
!= sk_class
)
7956 set_identifier_type_value_with_scope (name
, tdef
, b
->level_chain
);
7960 decl
= do_pushdecl_with_scope
7961 (decl
, b
, /*hiding=*/(how
== TAG_how::HIDDEN_FRIEND
));
7962 if (decl
== error_mark_node
)
7965 if (DECL_CONTEXT (decl
) == std_node
7966 && init_list_identifier
== DECL_NAME (TYPE_NAME (type
))
7967 && !CLASSTYPE_TEMPLATE_INFO (type
))
7969 error ("declaration of %<std::initializer_list%> does not match "
7970 "%<#include <initializer_list>%>, isn%'t a template");
7971 return error_mark_node
;
7975 TYPE_CONTEXT (type
) = DECL_CONTEXT (decl
);
7977 /* If this is a local class, keep track of it. We need this
7978 information for name-mangling, and so that it is possible to
7979 find all function definitions in a translation unit in a
7980 convenient way. (It's otherwise tricky to find a member
7981 function definition it's only pointed to from within a local
7983 if (TYPE_FUNCTION_SCOPE_P (type
))
7985 if (processing_template_decl
)
7987 /* Push a DECL_EXPR so we call pushtag at the right time in
7988 template instantiation rather than in some nested context. */
7989 add_decl_expr (decl
);
7991 /* Lambdas use LAMBDA_EXPR_DISCRIMINATOR instead. */
7992 else if (!LAMBDA_TYPE_P (type
))
7993 determine_local_discriminator (TYPE_NAME (type
));
7997 if (b
->kind
== sk_class
7998 && !COMPLETE_TYPE_P (current_class_type
))
7999 maybe_add_class_template_decl_list (current_class_type
,
8000 type
, /*friend_p=*/0);
8002 decl
= TYPE_NAME (type
);
8003 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
8005 /* Set type visibility now if this is a forward declaration. */
8006 TREE_PUBLIC (decl
) = 1;
8007 determine_visibility (decl
);
8012 /* Subroutines for reverting temporarily to top-level for instantiation
8013 of templates and such. We actually need to clear out the class- and
8014 local-value slots of all identifiers, so that only the global values
8015 are at all visible. Simply setting current_binding_level to the global
8016 scope isn't enough, because more binding levels may be pushed. */
8017 struct saved_scope
*scope_chain
;
8019 /* Return true if ID has not already been marked. */
8022 store_binding_p (tree id
)
8024 if (!id
|| !IDENTIFIER_BINDING (id
))
8027 if (IDENTIFIER_MARKED (id
))
8033 /* Add an appropriate binding to *OLD_BINDINGS which needs to already
8034 have enough space reserved. */
8037 store_binding (tree id
, vec
<cxx_saved_binding
, va_gc
> **old_bindings
)
8039 cxx_saved_binding saved
;
8041 gcc_checking_assert (store_binding_p (id
));
8043 IDENTIFIER_MARKED (id
) = 1;
8045 saved
.identifier
= id
;
8046 saved
.binding
= IDENTIFIER_BINDING (id
);
8047 saved
.real_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
8048 (*old_bindings
)->quick_push (saved
);
8049 IDENTIFIER_BINDING (id
) = NULL
;
8053 store_bindings (tree names
, vec
<cxx_saved_binding
, va_gc
> **old_bindings
)
8055 static vec
<tree
> bindings_need_stored
;
8059 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
8060 for (t
= names
; t
; t
= TREE_CHAIN (t
))
8062 if (TREE_CODE (t
) == TREE_LIST
)
8063 id
= TREE_PURPOSE (t
);
8067 if (store_binding_p (id
))
8068 bindings_need_stored
.safe_push (id
);
8070 if (!bindings_need_stored
.is_empty ())
8072 vec_safe_reserve_exact (*old_bindings
, bindings_need_stored
.length ());
8073 for (i
= 0; bindings_need_stored
.iterate (i
, &id
); ++i
)
8075 /* We can apparently have duplicates in NAMES. */
8076 if (store_binding_p (id
))
8077 store_binding (id
, old_bindings
);
8079 bindings_need_stored
.truncate (0);
8083 /* Like store_bindings, but NAMES is a vector of cp_class_binding
8084 objects, rather than a TREE_LIST. */
8087 store_class_bindings (vec
<cp_class_binding
, va_gc
> *names
,
8088 vec
<cxx_saved_binding
, va_gc
> **old_bindings
)
8090 static vec
<tree
> bindings_need_stored
;
8092 cp_class_binding
*cb
;
8094 for (i
= 0; vec_safe_iterate (names
, i
, &cb
); ++i
)
8095 if (store_binding_p (cb
->identifier
))
8096 bindings_need_stored
.safe_push (cb
->identifier
);
8097 if (!bindings_need_stored
.is_empty ())
8100 vec_safe_reserve_exact (*old_bindings
, bindings_need_stored
.length ());
8101 for (i
= 0; bindings_need_stored
.iterate (i
, &id
); ++i
)
8102 store_binding (id
, old_bindings
);
8103 bindings_need_stored
.truncate (0);
8107 /* A chain of saved_scope structures awaiting reuse. */
8109 static GTY((deletable
)) struct saved_scope
*free_saved_scope
;
8112 push_to_top_level (void)
8114 struct saved_scope
*s
;
8115 cp_binding_level
*b
;
8116 cxx_saved_binding
*sb
;
8120 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
8122 /* Reuse or create a new structure for this saved scope. */
8123 if (free_saved_scope
!= NULL
)
8125 s
= free_saved_scope
;
8126 free_saved_scope
= s
->prev
;
8128 vec
<cxx_saved_binding
, va_gc
> *old_bindings
= s
->old_bindings
;
8129 memset (s
, 0, sizeof (*s
));
8130 /* Also reuse the structure's old_bindings vector. */
8131 vec_safe_truncate (old_bindings
, 0);
8132 s
->old_bindings
= old_bindings
;
8135 s
= ggc_cleared_alloc
<saved_scope
> ();
8137 b
= scope_chain
? current_binding_level
: 0;
8139 /* If we're in the middle of some function, save our state. */
8143 push_function_context ();
8148 if (scope_chain
&& previous_class_level
)
8149 store_class_bindings (previous_class_level
->class_shadowed
,
8152 /* Have to include the global scope, because class-scope decls
8153 aren't listed anywhere useful. */
8154 for (; b
; b
= b
->level_chain
)
8158 /* Template IDs are inserted into the global level. If they were
8159 inserted into namespace level, finish_file wouldn't find them
8160 when doing pending instantiations. Therefore, don't stop at
8161 namespace level, but continue until :: . */
8162 if (global_scope_p (b
))
8165 store_bindings (b
->names
, &s
->old_bindings
);
8166 /* We also need to check class_shadowed to save class-level type
8167 bindings, since pushclass doesn't fill in b->names. */
8168 if (b
->kind
== sk_class
)
8169 store_class_bindings (b
->class_shadowed
, &s
->old_bindings
);
8171 /* Unwind type-value slots back to top level. */
8172 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
8173 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
8176 FOR_EACH_VEC_SAFE_ELT (s
->old_bindings
, i
, sb
)
8177 IDENTIFIER_MARKED (sb
->identifier
) = 0;
8179 s
->prev
= scope_chain
;
8181 s
->need_pop_function_context
= need_pop
;
8182 s
->function_decl
= current_function_decl
;
8183 s
->unevaluated_operand
= cp_unevaluated_operand
;
8184 s
->inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
8185 s
->suppress_location_wrappers
= suppress_location_wrappers
;
8186 s
->x_stmt_tree
.stmts_are_full_exprs_p
= true;
8189 current_function_decl
= NULL_TREE
;
8190 current_lang_base
= NULL
;
8191 current_lang_name
= lang_name_cplusplus
;
8192 current_namespace
= global_namespace
;
8193 push_class_stack ();
8194 cp_unevaluated_operand
= 0;
8195 c_inhibit_evaluation_warnings
= 0;
8196 suppress_location_wrappers
= 0;
8200 pop_from_top_level (void)
8202 struct saved_scope
*s
= scope_chain
;
8203 cxx_saved_binding
*saved
;
8206 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
8208 /* Clear out class-level bindings cache. */
8209 if (previous_class_level
)
8210 invalidate_class_lookup_cache ();
8213 release_tree_vector (current_lang_base
);
8215 scope_chain
= s
->prev
;
8216 FOR_EACH_VEC_SAFE_ELT (s
->old_bindings
, i
, saved
)
8218 tree id
= saved
->identifier
;
8220 IDENTIFIER_BINDING (id
) = saved
->binding
;
8221 SET_IDENTIFIER_TYPE_VALUE (id
, saved
->real_type_value
);
8224 /* If we were in the middle of compiling a function, restore our
8226 if (s
->need_pop_function_context
)
8227 pop_function_context ();
8228 current_function_decl
= s
->function_decl
;
8229 cp_unevaluated_operand
= s
->unevaluated_operand
;
8230 c_inhibit_evaluation_warnings
= s
->inhibit_evaluation_warnings
;
8231 suppress_location_wrappers
= s
->suppress_location_wrappers
;
8233 /* Make this saved_scope structure available for reuse by
8234 push_to_top_level. */
8235 s
->prev
= free_saved_scope
;
8236 free_saved_scope
= s
;
8239 /* Push into the scope of the namespace NS, even if it is deeply
8240 nested within another namespace. */
8243 push_nested_namespace (tree ns
)
8245 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
8246 if (ns
== global_namespace
)
8247 push_to_top_level ();
8250 push_nested_namespace (CP_DECL_CONTEXT (ns
));
8251 resume_scope (NAMESPACE_LEVEL (ns
));
8252 current_namespace
= ns
;
8256 /* Pop back from the scope of the namespace NS, which was previously
8257 entered with push_nested_namespace. */
8260 pop_nested_namespace (tree ns
)
8262 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
8263 while (ns
!= global_namespace
)
8265 ns
= CP_DECL_CONTEXT (ns
);
8266 current_namespace
= ns
;
8270 pop_from_top_level ();
8273 /* Add TARGET to USINGS, if it does not already exist there. We used
8274 to build the complete graph of usings at this point, from the POV
8275 of the source namespaces. Now we build that as we perform the
8276 unqualified search. */
8279 add_using_namespace (vec
<tree
, va_gc
> *&usings
, tree target
)
8282 for (unsigned ix
= usings
->length (); ix
--;)
8283 if ((*usings
)[ix
] == target
)
8286 vec_safe_push (usings
, target
);
8289 /* Tell the debug system of a using directive. */
8292 emit_debug_info_using_namespace (tree from
, tree target
, bool implicit
)
8294 /* Emit debugging info. */
8295 tree context
= from
!= global_namespace
? from
: NULL_TREE
;
8296 debug_hooks
->imported_module_or_decl (target
, NULL_TREE
, context
, false,
8300 /* Process a using directive. */
8303 finish_using_directive (tree target
, tree attribs
)
8305 if (target
== error_mark_node
)
8308 if (current_binding_level
->kind
!= sk_namespace
)
8309 add_stmt (build_stmt (input_location
, USING_STMT
, target
));
8311 emit_debug_info_using_namespace (current_binding_level
->this_entity
,
8312 ORIGINAL_NAMESPACE (target
), false);
8314 add_using_namespace (current_binding_level
->using_directives
,
8315 ORIGINAL_NAMESPACE (target
));
8317 bool diagnosed
= false;
8318 if (attribs
!= error_mark_node
)
8319 for (tree a
= attribs
; a
; a
= TREE_CHAIN (a
))
8321 tree name
= get_attribute_name (a
);
8322 if (current_binding_level
->kind
== sk_namespace
8323 && is_attribute_p ("strong", name
))
8325 if (warning (0, "%<strong%> using directive no longer supported")
8326 && CP_DECL_CONTEXT (target
) == current_namespace
)
8327 inform (DECL_SOURCE_LOCATION (target
),
8328 "you can use an inline namespace instead");
8330 else if ((flag_openmp
|| flag_openmp_simd
)
8331 && get_attribute_namespace (a
) == omp_identifier
8332 && (is_attribute_p ("directive", name
)
8333 || is_attribute_p ("sequence", name
)))
8336 error ("%<omp::%E%> not allowed to be specified in this "
8341 warning (OPT_Wattributes
, "%qD attribute directive ignored", name
);
8345 /* Pushes X into the global namespace. */
8348 pushdecl_top_level (tree x
)
8350 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
8351 push_to_top_level ();
8352 gcc_checking_assert (!DECL_CONTEXT (x
));
8353 DECL_CONTEXT (x
) = FROB_CONTEXT (global_namespace
);
8354 x
= pushdecl_namespace_level (x
);
8355 pop_from_top_level ();
8359 /* Pushes X into the global namespace and calls cp_finish_decl to
8360 register the variable, initializing it with INIT. */
8363 pushdecl_top_level_and_finish (tree x
, tree init
)
8365 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
8366 push_to_top_level ();
8367 gcc_checking_assert (!DECL_CONTEXT (x
));
8368 DECL_CONTEXT (x
) = FROB_CONTEXT (global_namespace
);
8369 x
= pushdecl_namespace_level (x
);
8370 cp_finish_decl (x
, init
, false, NULL_TREE
, 0);
8371 pop_from_top_level ();
8375 /* Enter the namespaces from current_namerspace to NS. */
8378 push_inline_namespaces (tree ns
)
8381 if (ns
!= current_namespace
)
8383 gcc_assert (ns
!= global_namespace
);
8384 count
+= push_inline_namespaces (CP_DECL_CONTEXT (ns
));
8385 resume_scope (NAMESPACE_LEVEL (ns
));
8386 current_namespace
= ns
;
8392 /* SLOT is the (possibly empty) binding slot for NAME in CTX.
8393 Reuse or create a namespace NAME. NAME is null for the anonymous
8397 reuse_namespace (tree
*slot
, tree ctx
, tree name
)
8399 if (modules_p () && *slot
&& TREE_PUBLIC (ctx
) && name
)
8401 /* Public namespace. Shared. */
8402 tree
*global_slot
= slot
;
8403 if (TREE_CODE (*slot
) == BINDING_VECTOR
)
8404 global_slot
= get_fixed_binding_slot (slot
, name
,
8405 BINDING_SLOT_GLOBAL
, false);
8407 for (ovl_iterator
iter (*global_slot
); iter
; ++iter
)
8411 if (TREE_CODE (decl
) == NAMESPACE_DECL
&& !DECL_NAMESPACE_ALIAS (decl
))
8419 make_namespace (tree ctx
, tree name
, location_t loc
, bool inline_p
)
8421 /* Create the namespace. */
8422 tree ns
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
8423 DECL_SOURCE_LOCATION (ns
) = loc
;
8424 SCOPE_DEPTH (ns
) = SCOPE_DEPTH (ctx
) + 1;
8425 if (!SCOPE_DEPTH (ns
))
8426 /* We only allow depth 255. */
8427 sorry ("cannot nest more than %d namespaces", SCOPE_DEPTH (ctx
));
8428 DECL_CONTEXT (ns
) = FROB_CONTEXT (ctx
);
8431 /* Anon-namespaces in different header-unit imports are distinct.
8432 But that's ok as their contents all have internal linkage.
8433 (This is different to how they'd behave as textual includes,
8434 but doing this at all is really odd source.) */
8435 SET_DECL_ASSEMBLER_NAME (ns
, anon_identifier
);
8436 else if (TREE_PUBLIC (ctx
))
8437 TREE_PUBLIC (ns
) = true;
8440 DECL_NAMESPACE_INLINE_P (ns
) = true;
8445 /* NS was newly created, finish off making it. */
8448 make_namespace_finish (tree ns
, tree
*slot
, bool from_import
= false)
8450 if (modules_p () && TREE_PUBLIC (ns
) && (from_import
|| *slot
!= ns
))
8452 /* Merge into global slot. */
8453 tree
*gslot
= get_fixed_binding_slot (slot
, DECL_NAME (ns
),
8454 BINDING_SLOT_GLOBAL
, true);
8458 tree ctx
= CP_DECL_CONTEXT (ns
);
8459 cp_binding_level
*scope
= ggc_cleared_alloc
<cp_binding_level
> ();
8460 scope
->this_entity
= ns
;
8461 scope
->more_cleanups_ok
= true;
8462 scope
->kind
= sk_namespace
;
8463 scope
->level_chain
= NAMESPACE_LEVEL (ctx
);
8464 NAMESPACE_LEVEL (ns
) = scope
;
8466 if (DECL_NAMESPACE_INLINE_P (ns
))
8467 vec_safe_push (DECL_NAMESPACE_INLINEES (ctx
), ns
);
8469 if (DECL_NAMESPACE_INLINE_P (ns
) || !DECL_NAME (ns
))
8470 emit_debug_info_using_namespace (ctx
, ns
, true);
8473 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE,
8474 then we enter an anonymous namespace. If MAKE_INLINE is true, then
8475 we create an inline namespace (it is up to the caller to check upon
8476 redefinition). Return the number of namespaces entered. */
8479 push_namespace (tree name
, bool make_inline
)
8481 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
8484 /* We should not get here if the global_namespace is not yet constructed
8485 nor if NAME designates the global namespace: The global scope is
8486 constructed elsewhere. */
8487 gcc_checking_assert (global_namespace
!= NULL
&& name
!= global_identifier
);
8489 tree ns
= NULL_TREE
;
8491 name_lookup
lookup (name
);
8492 if (!lookup
.search_qualified (current_namespace
, /*usings=*/false))
8494 else if (TREE_CODE (lookup
.value
) == TREE_LIST
)
8496 /* An ambiguous lookup. If exactly one is a namespace, we
8497 want that. If more than one is a namespace, error, but
8498 pick one of them. */
8499 /* DR2061 can cause us to find multiple namespaces of the same
8500 name. We must treat that carefully and avoid thinking we
8501 need to push a new (possibly) duplicate namespace. Hey,
8502 if you want to use the same identifier within an inline
8503 nest, knock yourself out. */
8504 for (tree
*chain
= &lookup
.value
, next
; (next
= *chain
);)
8506 tree decl
= TREE_VALUE (next
);
8507 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
8511 else if (SCOPE_DEPTH (ns
) >= SCOPE_DEPTH (decl
))
8515 chain
= &TREE_CHAIN (next
);
8519 *chain
= TREE_CHAIN (next
);
8522 if (TREE_CHAIN (lookup
.value
))
8524 error ("%<namespace %E%> is ambiguous", name
);
8525 print_candidates (lookup
.value
);
8528 else if (TREE_CODE (lookup
.value
) == NAMESPACE_DECL
)
8532 if (tree dna
= DECL_NAMESPACE_ALIAS (ns
))
8534 /* A namespace alias is not allowed here, but if the alias
8535 is for a namespace also inside the current scope,
8536 accept it with a diagnostic. That's better than dying
8538 if (is_nested_namespace (current_namespace
, CP_DECL_CONTEXT (dna
)))
8540 error ("namespace alias %qD not allowed here, "
8541 "assuming %qD", ns
, dna
);
8551 /* DR2061. NS might be a member of an inline namespace. We
8552 need to push into those namespaces. */
8555 for (tree parent
, ctx
= ns
; ctx
!= current_namespace
;
8558 parent
= CP_DECL_CONTEXT (ctx
);
8560 tree bind
= *find_namespace_slot (parent
, DECL_NAME (ctx
), false);
8563 auto &cluster
= BINDING_VECTOR_CLUSTER (bind
, 0);
8564 binding_slot
&slot
= cluster
.slots
[BINDING_SLOT_CURRENT
];
8565 gcc_checking_assert (!(tree
)slot
|| (tree
)slot
== ctx
);
8571 count
+= push_inline_namespaces (CP_DECL_CONTEXT (ns
));
8572 if (DECL_SOURCE_LOCATION (ns
) == BUILTINS_LOCATION
)
8573 /* It's not builtin now. */
8574 DECL_SOURCE_LOCATION (ns
) = input_location
;
8578 /* Before making a new namespace, see if we already have one in
8579 the existing partitions of the current namespace. */
8580 tree
*slot
= find_namespace_slot (current_namespace
, name
, false);
8582 ns
= reuse_namespace (slot
, current_namespace
, name
);
8584 ns
= make_namespace (current_namespace
, name
,
8585 input_location
, make_inline
);
8587 if (pushdecl (ns
) == error_mark_node
)
8591 /* Finish up making the namespace. */
8592 add_decl_to_level (NAMESPACE_LEVEL (current_namespace
), ns
);
8595 slot
= find_namespace_slot (current_namespace
, name
);
8596 /* This should find the slot created by pushdecl. */
8597 gcc_checking_assert (slot
&& *slot
== ns
);
8601 /* pushdecl could have expanded the hash table, so
8602 slot might be invalid. */
8603 slot
= find_namespace_slot (current_namespace
, name
);
8604 gcc_checking_assert (slot
);
8606 make_namespace_finish (ns
, slot
);
8608 /* Add the anon using-directive here, we don't do it in
8609 make_namespace_finish. */
8610 if (!DECL_NAMESPACE_INLINE_P (ns
) && !name
)
8611 add_using_namespace (current_binding_level
->using_directives
, ns
);
8617 /* A public namespace is exported only if explicitly marked, or
8618 it contains exported entities. */
8619 if (TREE_PUBLIC (ns
) && module_exporting_p ())
8620 DECL_MODULE_EXPORT_P (ns
) = true;
8621 if (module_purview_p ())
8622 DECL_MODULE_PURVIEW_P (ns
) = true;
8624 if (make_inline
&& !DECL_NAMESPACE_INLINE_P (ns
))
8626 error_at (input_location
,
8627 "inline namespace must be specified at initial definition");
8628 inform (DECL_SOURCE_LOCATION (ns
), "%qD defined here", ns
);
8630 resume_scope (NAMESPACE_LEVEL (ns
));
8631 current_namespace
= ns
;
8638 /* Pop from the scope of the current namespace. */
8641 pop_namespace (void)
8643 auto_cond_timevar
tv (TV_NAME_LOOKUP
);
8645 gcc_assert (current_namespace
!= global_namespace
);
8646 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
8647 /* The binding level is not popped, as it might be re-opened later. */
8651 /* An IMPORT is an import that is defining namespace NAME inside CTX. Find or
8652 create that namespace and add it to the container's binding-vector. */
8655 add_imported_namespace (tree ctx
, tree name
, location_t loc
, unsigned import
,
8656 bool inline_p
, bool visible_p
)
8658 // FIXME: Something is not correct about the VISIBLE_P handling. We
8659 // need to insert this namespace into
8660 // (a) the GLOBAL or PARTITION slot, if it is TREE_PUBLIC
8661 // (b) The importing module's slot (always)
8662 // (c) Do we need to put it in the CURRENT slot? This is the
8665 tree
*slot
= find_namespace_slot (ctx
, name
, true);
8666 tree decl
= reuse_namespace (slot
, ctx
, name
);
8668 /* Creating and binding. */
8671 decl
= make_namespace (ctx
, name
, loc
, inline_p
);
8672 DECL_MODULE_IMPORT_P (decl
) = true;
8673 make_namespace_finish (decl
, slot
, true);
8675 else if (DECL_NAMESPACE_INLINE_P (decl
) != inline_p
)
8677 error_at (loc
, "%s namespace %qD conflicts with reachable definition",
8678 inline_p
? "inline" : "non-inline", decl
);
8679 inform (DECL_SOURCE_LOCATION (decl
), "reachable %s definition here",
8680 inline_p
? "non-inline" : "inline");
8683 if (TREE_PUBLIC (decl
) && TREE_CODE (*slot
) == BINDING_VECTOR
)
8685 /* See if we can extend the final slot. */
8686 binding_cluster
*last
= BINDING_VECTOR_CLUSTER_LAST (*slot
);
8687 gcc_checking_assert (last
->indices
[0].span
);
8688 unsigned jx
= BINDING_VECTOR_SLOTS_PER_CLUSTER
;
8691 if (last
->indices
[jx
].span
)
8693 tree final
= last
->slots
[jx
];
8694 if (visible_p
== !STAT_HACK_P (final
)
8695 && MAYBE_STAT_DECL (final
) == decl
8696 && last
->indices
[jx
].base
+ last
->indices
[jx
].span
== import
8697 && (BINDING_VECTOR_NUM_CLUSTERS (*slot
) > 1
8698 || (BINDING_VECTOR_SLOTS_PER_CLUSTER
> BINDING_SLOTS_FIXED
8699 && jx
>= BINDING_SLOTS_FIXED
)))
8701 last
->indices
[jx
].span
++;
8706 /* Append a new slot. */
8707 tree
*mslot
= &(tree
&)*append_imported_binding_slot (slot
, name
, import
);
8709 gcc_assert (!*mslot
);
8710 *mslot
= visible_p
? decl
: stat_hack (decl
, NULL_TREE
);
8715 /* Pop off extraneous binding levels left over due to syntax errors.
8716 We don't pop past namespaces, as they might be valid. */
8719 pop_everything (void)
8721 if (ENABLE_SCOPE_CHECKING
)
8722 verbatim ("XXX entering %<pop_everything ()%>");
8723 while (!namespace_bindings_p ())
8725 if (current_binding_level
->kind
== sk_class
)
8726 pop_nested_class ();
8730 if (ENABLE_SCOPE_CHECKING
)
8731 verbatim ("XXX leaving %<pop_everything ()%>");
8734 /* Emit debugging information for using declarations and directives.
8735 If input tree is overloaded fn then emit debug info for all
8739 cp_emit_debug_info_for_using (tree t
, tree context
)
8741 /* Don't try to emit any debug information if we have errors. */
8745 /* Do not supply context to imported_module_or_decl, if
8746 it is a global namespace. */
8747 if (context
== global_namespace
)
8748 context
= NULL_TREE
;
8750 t
= MAYBE_BASELINK_FUNCTIONS (t
);
8752 for (lkp_iterator
iter (t
); iter
; ++iter
)
8756 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
8757 /* FIXME: Handle TEMPLATE_DECLs. */
8760 /* Ignore this FUNCTION_DECL if it refers to a builtin declaration
8761 of a builtin function. */
8762 if (TREE_CODE (fn
) == FUNCTION_DECL
8763 && DECL_EXTERNAL (fn
)
8764 && fndecl_built_in_p (fn
))
8767 if (building_stmt_list_p ())
8768 add_stmt (build_stmt (input_location
, USING_STMT
, fn
));
8770 debug_hooks
->imported_module_or_decl (fn
, NULL_TREE
, context
,
8775 /* True if D is a local declaration in dependent scope. Assumes that it is
8776 (part of) the current lookup result for its name. */
8779 dependent_local_decl_p (tree d
)
8781 if (!DECL_LOCAL_DECL_P (d
))
8784 cxx_binding
*b
= IDENTIFIER_BINDING (DECL_NAME (d
));
8785 cp_binding_level
*l
= b
->scope
;
8786 while (!l
->this_entity
)
8788 return uses_template_parms (l
->this_entity
);
8793 #include "gt-cp-name-lookup.h"