1 /* Handle parameterized types (templates) for GNU -*- C++ -*-.
2 Copyright (C) 1992-2020 Free Software Foundation, Inc.
3 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
4 Rewritten by Jason Merrill (jason@cygnus.com).
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* Known bugs or deficiencies include:
24 all methods must be provided in header files; can't use a source
25 file that contains only the method templates and "just win". */
29 #include "coretypes.h"
32 #include "stringpool.h"
35 #include "stor-layout.h"
37 #include "c-family/c-objc.h"
38 #include "cp-objcp-common.h"
40 #include "tree-iterator.h"
41 #include "type-utils.h"
43 #include "gcc-rich-location.h"
47 /* The type of functions taking a tree, and some additional data, and
49 typedef int (*tree_fn_t
) (tree
, void*);
51 /* The PENDING_TEMPLATES is a list of templates whose instantiations
52 have been deferred, either because their definitions were not yet
53 available, or because we were putting off doing the work. */
54 struct GTY ((chain_next ("%h.next"))) pending_template
56 struct pending_template
*next
;
57 struct tinst_level
*tinst
;
60 static GTY(()) struct pending_template
*pending_templates
;
61 static GTY(()) struct pending_template
*last_pending_template
;
63 int processing_template_parmlist
;
64 static int template_header_count
;
66 static GTY(()) tree saved_trees
;
67 static vec
<int> inline_parm_levels
;
69 static GTY(()) struct tinst_level
*current_tinst_level
;
71 static GTY(()) vec
<tree
, va_gc
> *saved_access_scope
;
73 /* Live only within one (recursive) call to tsubst_expr. We use
74 this to pass the statement expression node from the STMT_EXPR
75 to the EXPR_STMT that is its result. */
76 static tree cur_stmt_expr
;
78 // -------------------------------------------------------------------------- //
79 // Local Specialization Stack
81 // Implementation of the RAII helper for creating new local
83 local_specialization_stack::local_specialization_stack (lss_policy policy
)
84 : saved (local_specializations
)
86 if (policy
== lss_nop
)
88 else if (policy
== lss_blank
|| !saved
)
89 local_specializations
= new hash_map
<tree
, tree
>;
91 local_specializations
= new hash_map
<tree
, tree
>(*saved
);
94 local_specialization_stack::~local_specialization_stack ()
96 if (local_specializations
!= saved
)
98 delete local_specializations
;
99 local_specializations
= saved
;
103 /* True if we've recursed into fn_type_unification too many times. */
104 static bool excessive_deduction_depth
;
106 struct GTY((for_user
)) spec_entry
113 struct spec_hasher
: ggc_ptr_hash
<spec_entry
>
115 static hashval_t
hash (spec_entry
*);
116 static bool equal (spec_entry
*, spec_entry
*);
119 /* The general template is not in these tables. */
120 typedef hash_table
<spec_hasher
> spec_hash_table
;
121 static GTY (()) spec_hash_table
*decl_specializations
;
122 static GTY (()) spec_hash_table
*type_specializations
;
124 /* Contains canonical template parameter types. The vector is indexed by
125 the TEMPLATE_TYPE_IDX of the template parameter. Each element is a
126 TREE_LIST, whose TREE_VALUEs contain the canonical template
127 parameters of various types and levels. */
128 static GTY(()) vec
<tree
, va_gc
> *canonical_template_parms
;
130 #define UNIFY_ALLOW_NONE 0
131 #define UNIFY_ALLOW_MORE_CV_QUAL 1
132 #define UNIFY_ALLOW_LESS_CV_QUAL 2
133 #define UNIFY_ALLOW_DERIVED 4
134 #define UNIFY_ALLOW_INTEGER 8
135 #define UNIFY_ALLOW_OUTER_LEVEL 16
136 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
137 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
139 enum template_base_result
{
141 tbr_ambiguous_baseclass
,
145 static bool resolve_overloaded_unification (tree
, tree
, tree
, tree
,
146 unification_kind_t
, int,
148 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
149 unification_kind_t
, int, bool, bool);
150 static int unify (tree
, tree
, tree
, tree
, int, bool);
151 static void add_pending_template (tree
);
152 static tree
reopen_tinst_level (struct tinst_level
*);
153 static tree
tsubst_initializer_list (tree
, tree
);
154 static tree
get_partial_spec_bindings (tree
, tree
, tree
);
155 static tree
coerce_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
157 static tree
coerce_innermost_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
159 static void tsubst_enum (tree
, tree
, tree
);
160 static tree
add_to_template_args (tree
, tree
);
161 static bool check_instantiated_args (tree
, tree
, tsubst_flags_t
);
162 static int check_non_deducible_conversion (tree
, tree
, int, int,
163 struct conversion
**, bool);
164 static int maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*,
166 static int type_unification_real (tree
, tree
, tree
, const tree
*,
167 unsigned int, int, unification_kind_t
,
168 vec
<deferred_access_check
, va_gc
> **,
170 static void note_template_header (int);
171 static tree
convert_nontype_argument_function (tree
, tree
, tsubst_flags_t
);
172 static tree
convert_nontype_argument (tree
, tree
, tsubst_flags_t
);
173 static tree
convert_template_argument (tree
, tree
, tree
,
174 tsubst_flags_t
, int, tree
);
175 static tree
for_each_template_parm (tree
, tree_fn_t
, void*,
176 hash_set
<tree
> *, bool, tree_fn_t
= NULL
);
177 static tree
expand_template_argument_pack (tree
);
178 static tree
build_template_parm_index (int, int, int, tree
, tree
);
179 static bool inline_needs_template_parms (tree
, bool);
180 static void push_inline_template_parms_recursive (tree
, int);
181 static tree
reduce_template_parm_level (tree
, tree
, int, tree
, tsubst_flags_t
);
182 static int mark_template_parm (tree
, void *);
183 static int template_parm_this_level_p (tree
, void *);
184 static tree
tsubst_friend_function (tree
, tree
);
185 static tree
tsubst_friend_class (tree
, tree
);
186 static int can_complete_type_without_circularity (tree
);
187 static tree
get_bindings (tree
, tree
, tree
, bool);
188 static int template_decl_level (tree
);
189 static int check_cv_quals_for_unify (int, tree
, tree
);
190 static int unify_pack_expansion (tree
, tree
, tree
,
191 tree
, unification_kind_t
, bool, bool);
192 static tree
copy_template_args (tree
);
193 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
194 tree
most_specialized_partial_spec (tree
, tsubst_flags_t
);
195 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
196 static tree
tsubst_arg_types (tree
, tree
, tree
, tsubst_flags_t
, tree
);
197 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
198 static bool check_specialization_scope (void);
199 static tree
process_partial_specialization (tree
);
200 static void set_current_access_from_decl (tree
);
201 static enum template_base_result
get_template_base (tree
, tree
, tree
, tree
,
203 static tree
try_class_unification (tree
, tree
, tree
, tree
, bool);
204 static bool class_nttp_const_wrapper_p (tree t
);
205 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
207 static bool template_template_parm_bindings_ok_p (tree
, tree
);
208 static void tsubst_default_arguments (tree
, tsubst_flags_t
);
209 static tree
for_each_template_parm_r (tree
*, int *, void *);
210 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
211 static void copy_default_args_to_explicit_spec (tree
);
212 static bool invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
213 static bool dependent_template_arg_p (tree
);
214 static bool any_template_arguments_need_structural_equality_p (tree
);
215 static bool dependent_type_p_r (tree
);
216 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
217 static tree
tsubst_decl (tree
, tree
, tsubst_flags_t
);
218 static void perform_instantiation_time_access_checks (tree
, tree
);
219 static tree
listify (tree
);
220 static tree
listify_autos (tree
, tree
);
221 static tree
tsubst_template_parm (tree
, tree
, tsubst_flags_t
);
222 static tree
instantiate_alias_template (tree
, tree
, tsubst_flags_t
);
223 static bool complex_alias_template_p (const_tree tmpl
);
224 static tree
get_underlying_template (tree
);
225 static tree
tsubst_attributes (tree
, tree
, tsubst_flags_t
, tree
);
226 static tree
canonicalize_expr_argument (tree
, tsubst_flags_t
);
227 static tree
make_argument_pack (tree
);
228 static void register_parameter_specializations (tree
, tree
);
229 static tree
enclosing_instantiation_of (tree tctx
);
230 static void instantiate_body (tree pattern
, tree args
, tree d
, bool nested
);
232 /* Make the current scope suitable for access checking when we are
233 processing T. T can be FUNCTION_DECL for instantiated function
234 template, VAR_DECL for static member variable, or TYPE_DECL for
235 alias template (needed by instantiate_decl). */
238 push_access_scope (tree t
)
240 gcc_assert (VAR_OR_FUNCTION_DECL_P (t
)
241 || TREE_CODE (t
) == TYPE_DECL
);
243 if (DECL_FRIEND_CONTEXT (t
))
244 push_nested_class (DECL_FRIEND_CONTEXT (t
));
245 else if (DECL_CLASS_SCOPE_P (t
))
246 push_nested_class (DECL_CONTEXT (t
));
248 push_to_top_level ();
250 if (TREE_CODE (t
) == FUNCTION_DECL
)
252 vec_safe_push (saved_access_scope
, current_function_decl
);
253 current_function_decl
= t
;
257 /* Restore the scope set up by push_access_scope. T is the node we
261 pop_access_scope (tree t
)
263 if (TREE_CODE (t
) == FUNCTION_DECL
)
264 current_function_decl
= saved_access_scope
->pop();
266 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
269 pop_from_top_level ();
272 /* Do any processing required when DECL (a member template
273 declaration) is finished. Returns the TEMPLATE_DECL corresponding
274 to DECL, unless it is a specialization, in which case the DECL
275 itself is returned. */
278 finish_member_template_decl (tree decl
)
280 if (decl
== error_mark_node
)
281 return error_mark_node
;
283 gcc_assert (DECL_P (decl
));
285 if (TREE_CODE (decl
) == TYPE_DECL
)
289 type
= TREE_TYPE (decl
);
290 if (type
== error_mark_node
)
291 return error_mark_node
;
292 if (MAYBE_CLASS_TYPE_P (type
)
293 && CLASSTYPE_TEMPLATE_INFO (type
)
294 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
296 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
297 check_member_template (tmpl
);
302 else if (TREE_CODE (decl
) == FIELD_DECL
)
303 error_at (DECL_SOURCE_LOCATION (decl
),
304 "data member %qD cannot be a member template", decl
);
305 else if (DECL_TEMPLATE_INFO (decl
))
307 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
309 check_member_template (DECL_TI_TEMPLATE (decl
));
310 return DECL_TI_TEMPLATE (decl
);
316 error_at (DECL_SOURCE_LOCATION (decl
),
317 "invalid member template declaration %qD", decl
);
319 return error_mark_node
;
322 /* Create a template info node. */
325 build_template_info (tree template_decl
, tree template_args
)
327 tree result
= make_node (TEMPLATE_INFO
);
328 TI_TEMPLATE (result
) = template_decl
;
329 TI_ARGS (result
) = template_args
;
333 /* Return the template info node corresponding to T, whatever T is. */
336 get_template_info (const_tree t
)
338 tree tinfo
= NULL_TREE
;
340 if (!t
|| t
== error_mark_node
)
343 if (TREE_CODE (t
) == NAMESPACE_DECL
344 || TREE_CODE (t
) == PARM_DECL
)
347 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
348 tinfo
= DECL_TEMPLATE_INFO (t
);
350 if (!tinfo
&& DECL_IMPLICIT_TYPEDEF_P (t
))
353 if (OVERLOAD_TYPE_P (t
))
354 tinfo
= TYPE_TEMPLATE_INFO (t
);
355 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
356 tinfo
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
);
361 /* Returns the template nesting level of the indicated class TYPE.
371 A<T>::B<U> has depth two, while A<T> has depth one.
372 Both A<T>::B<int> and A<int>::B<U> have depth one, if
373 they are instantiations, not specializations.
375 This function is guaranteed to return 0 if passed NULL_TREE so
376 that, for example, `template_class_depth (current_class_type)' is
380 template_class_depth (tree type
)
384 for (depth
= 0; type
&& TREE_CODE (type
) != NAMESPACE_DECL
; )
386 tree tinfo
= get_template_info (type
);
388 if (tinfo
&& PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
389 && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
))))
394 if (tree fctx
= DECL_FRIEND_CONTEXT (type
))
397 type
= CP_DECL_CONTEXT (type
);
399 else if (LAMBDA_TYPE_P (type
) && LAMBDA_TYPE_EXTRA_SCOPE (type
))
400 type
= LAMBDA_TYPE_EXTRA_SCOPE (type
);
402 type
= CP_TYPE_CONTEXT (type
);
408 /* Return TRUE if NODE instantiates a template that has arguments of
409 its own, be it directly a primary template or indirectly through a
410 partial specializations. */
412 instantiates_primary_template_p (tree node
)
414 tree tinfo
= get_template_info (node
);
418 tree tmpl
= TI_TEMPLATE (tinfo
);
419 if (PRIMARY_TEMPLATE_P (tmpl
))
422 if (!DECL_TEMPLATE_SPECIALIZATION (tmpl
))
425 /* So now we know we have a specialization, but it could be a full
426 or a partial specialization. To tell which, compare the depth of
427 its template arguments with those of its context. */
429 tree ctxt
= DECL_CONTEXT (tmpl
);
430 tree ctinfo
= get_template_info (ctxt
);
434 return (TMPL_ARGS_DEPTH (TI_ARGS (tinfo
))
435 > TMPL_ARGS_DEPTH (TI_ARGS (ctinfo
)));
438 /* Subroutine of maybe_begin_member_template_processing.
439 Returns true if processing DECL needs us to push template parms. */
442 inline_needs_template_parms (tree decl
, bool nsdmi
)
444 if (!decl
|| (!nsdmi
&& ! DECL_TEMPLATE_INFO (decl
)))
447 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
448 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
451 /* Subroutine of maybe_begin_member_template_processing.
452 Push the template parms in PARMS, starting from LEVELS steps into the
453 chain, and ending at the beginning, since template parms are listed
457 push_inline_template_parms_recursive (tree parmlist
, int levels
)
459 tree parms
= TREE_VALUE (parmlist
);
463 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
465 ++processing_template_decl
;
466 current_template_parms
467 = tree_cons (size_int (processing_template_decl
),
468 parms
, current_template_parms
);
469 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
471 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
473 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
475 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
477 if (error_operand_p (parm
))
480 gcc_assert (DECL_P (parm
));
482 switch (TREE_CODE (parm
))
490 /* Push the CONST_DECL. */
491 pushdecl (TEMPLATE_PARM_DECL (DECL_INITIAL (parm
)));
500 /* Restore the template parameter context for a member template, a
501 friend template defined in a class definition, or a non-template
502 member of template class. */
505 maybe_begin_member_template_processing (tree decl
)
509 bool nsdmi
= TREE_CODE (decl
) == FIELD_DECL
;
513 tree ctx
= DECL_CONTEXT (decl
);
514 decl
= (CLASSTYPE_TEMPLATE_INFO (ctx
)
515 /* Disregard full specializations (c++/60999). */
516 && uses_template_parms (ctx
)
517 ? CLASSTYPE_TI_TEMPLATE (ctx
) : NULL_TREE
);
520 if (inline_needs_template_parms (decl
, nsdmi
))
522 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
523 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
525 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
528 parms
= TREE_CHAIN (parms
);
531 push_inline_template_parms_recursive (parms
, levels
);
534 /* Remember how many levels of template parameters we pushed so that
535 we can pop them later. */
536 inline_parm_levels
.safe_push (levels
);
539 /* Undo the effects of maybe_begin_member_template_processing. */
542 maybe_end_member_template_processing (void)
547 if (inline_parm_levels
.length () == 0)
550 last
= inline_parm_levels
.pop ();
551 for (i
= 0; i
< last
; ++i
)
553 --processing_template_decl
;
554 current_template_parms
= TREE_CHAIN (current_template_parms
);
559 /* Return a new template argument vector which contains all of ARGS,
560 but has as its innermost set of arguments the EXTRA_ARGS. */
563 add_to_template_args (tree args
, tree extra_args
)
570 if (args
== NULL_TREE
|| extra_args
== error_mark_node
)
573 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
574 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
576 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
577 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
579 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
580 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
585 /* Like add_to_template_args, but only the outermost ARGS are added to
586 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
587 (EXTRA_ARGS) levels are added. This function is used to combine
588 the template arguments from a partial instantiation with the
589 template arguments used to attain the full instantiation from the
590 partial instantiation.
592 If ARGS is a TEMPLATE_DECL, use its parameters as args. */
595 add_outermost_template_args (tree args
, tree extra_args
)
601 if (TREE_CODE (args
) == TEMPLATE_DECL
)
603 tree ti
= get_template_info (DECL_TEMPLATE_RESULT (args
));
607 /* If there are more levels of EXTRA_ARGS than there are ARGS,
608 something very fishy is going on. */
609 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
611 /* If *all* the new arguments will be the EXTRA_ARGS, just return
613 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
616 /* For the moment, we make ARGS look like it contains fewer levels. */
617 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
619 new_args
= add_to_template_args (args
, extra_args
);
621 /* Now, we restore ARGS to its full dimensions. */
622 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
627 /* Return the N levels of innermost template arguments from the ARGS. */
630 get_innermost_template_args (tree args
, int n
)
638 /* If N is 1, just return the innermost set of template arguments. */
640 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
642 /* If we're not removing anything, just return the arguments we were
644 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
645 gcc_assert (extra_levels
>= 0);
646 if (extra_levels
== 0)
649 /* Make a new set of arguments, not containing the outer arguments. */
650 new_args
= make_tree_vec (n
);
651 for (i
= 1; i
<= n
; ++i
)
652 SET_TMPL_ARGS_LEVEL (new_args
, i
,
653 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
658 /* The inverse of get_innermost_template_args: Return all but the innermost
659 EXTRA_LEVELS levels of template arguments from the ARGS. */
662 strip_innermost_template_args (tree args
, int extra_levels
)
665 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
670 /* If N is 1, just return the outermost set of template arguments. */
672 return TMPL_ARGS_LEVEL (args
, 1);
674 /* If we're not removing anything, just return the arguments we were
676 gcc_assert (extra_levels
>= 0);
677 if (extra_levels
== 0)
680 /* Make a new set of arguments, not containing the inner arguments. */
681 new_args
= make_tree_vec (n
);
682 for (i
= 1; i
<= n
; ++i
)
683 SET_TMPL_ARGS_LEVEL (new_args
, i
,
684 TMPL_ARGS_LEVEL (args
, i
));
689 /* We've got a template header coming up; push to a new level for storing
693 begin_template_parm_list (void)
695 /* We use a non-tag-transparent scope here, which causes pushtag to
696 put tags in this scope, rather than in the enclosing class or
697 namespace scope. This is the right thing, since we want
698 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
699 global template class, push_template_decl handles putting the
700 TEMPLATE_DECL into top-level scope. For a nested template class,
703 template <class T> struct S1 {
704 template <class T> struct S2 {};
707 pushtag contains special code to insert the TEMPLATE_DECL for S2
708 at the right scope. */
709 begin_scope (sk_template_parms
, NULL
);
710 ++processing_template_decl
;
711 ++processing_template_parmlist
;
712 note_template_header (0);
714 /* Add a dummy parameter level while we process the parameter list. */
715 current_template_parms
716 = tree_cons (size_int (processing_template_decl
),
718 current_template_parms
);
721 /* This routine is called when a specialization is declared. If it is
722 invalid to declare a specialization here, an error is reported and
723 false is returned, otherwise this routine will return true. */
726 check_specialization_scope (void)
728 tree scope
= current_scope ();
732 An explicit specialization shall be declared in the namespace of
733 which the template is a member, or, for member templates, in the
734 namespace of which the enclosing class or enclosing class
735 template is a member. An explicit specialization of a member
736 function, member class or static data member of a class template
737 shall be declared in the namespace of which the class template
739 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
741 error ("explicit specialization in non-namespace scope %qD", scope
);
747 In an explicit specialization declaration for a member of a class
748 template or a member template that appears in namespace scope,
749 the member template and some of its enclosing class templates may
750 remain unspecialized, except that the declaration shall not
751 explicitly specialize a class member template if its enclosing
752 class templates are not explicitly specialized as well. */
753 if (current_template_parms
)
755 error ("enclosing class templates are not explicitly specialized");
762 /* We've just seen template <>. */
765 begin_specialization (void)
767 begin_scope (sk_template_spec
, NULL
);
768 note_template_header (1);
769 return check_specialization_scope ();
772 /* Called at then end of processing a declaration preceded by
776 end_specialization (void)
779 reset_specialization ();
782 /* Any template <>'s that we have seen thus far are not referring to a
783 function specialization. */
786 reset_specialization (void)
788 processing_specialization
= 0;
789 template_header_count
= 0;
792 /* We've just seen a template header. If SPECIALIZATION is nonzero,
793 it was of the form template <>. */
796 note_template_header (int specialization
)
798 processing_specialization
= specialization
;
799 template_header_count
++;
802 /* We're beginning an explicit instantiation. */
805 begin_explicit_instantiation (void)
807 gcc_assert (!processing_explicit_instantiation
);
808 processing_explicit_instantiation
= true;
813 end_explicit_instantiation (void)
815 gcc_assert (processing_explicit_instantiation
);
816 processing_explicit_instantiation
= false;
819 /* An explicit specialization or partial specialization of TMPL is being
820 declared. Check that the namespace in which the specialization is
821 occurring is permissible. Returns false iff it is invalid to
822 specialize TMPL in the current namespace. */
825 check_specialization_namespace (tree tmpl
)
827 tree tpl_ns
= decl_namespace_context (tmpl
);
831 An explicit specialization shall be declared in a namespace enclosing the
832 specialized template. An explicit specialization whose declarator-id is
833 not qualified shall be declared in the nearest enclosing namespace of the
834 template, or, if the namespace is inline (7.3.1), any namespace from its
835 enclosing namespace set. */
836 if (current_scope() != DECL_CONTEXT (tmpl
)
837 && !at_namespace_scope_p ())
839 error ("specialization of %qD must appear at namespace scope", tmpl
);
843 if (is_nested_namespace (current_namespace
, tpl_ns
, cxx_dialect
< cxx11
))
844 /* Same or enclosing namespace. */
848 auto_diagnostic_group d
;
849 if (permerror (input_location
,
850 "specialization of %qD in different namespace", tmpl
))
851 inform (DECL_SOURCE_LOCATION (tmpl
),
852 " from definition of %q#D", tmpl
);
857 /* SPEC is an explicit instantiation. Check that it is valid to
858 perform this explicit instantiation in the current namespace. */
861 check_explicit_instantiation_namespace (tree spec
)
865 /* DR 275: An explicit instantiation shall appear in an enclosing
866 namespace of its template. */
867 ns
= decl_namespace_context (spec
);
868 if (!is_nested_namespace (current_namespace
, ns
))
869 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
870 "(which does not enclose namespace %qD)",
871 spec
, current_namespace
, ns
);
874 /* Returns the type of a template specialization only if that
875 specialization needs to be defined. Otherwise (e.g., if the type has
876 already been defined), the function returns NULL_TREE. */
879 maybe_new_partial_specialization (tree type
)
881 /* An implicit instantiation of an incomplete type implies
882 the definition of a new class template.
890 Here, S<T*> is an implicit instantiation of S whose type
892 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
) && !COMPLETE_TYPE_P (type
))
895 /* It can also be the case that TYPE is a completed specialization.
896 Continuing the previous example, suppose we also declare:
902 Here, S<T*> refers to the specialization S<T*> defined
903 above. However, we need to differentiate definitions because
904 we intend to define a new partial specialization. In this case,
905 we rely on the fact that the constraints are different for
906 this declaration than that above.
908 Note that we also get here for injected class names and
909 late-parsed template definitions. We must ensure that we
910 do not create new type declarations for those cases. */
911 if (flag_concepts
&& CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
913 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
914 tree args
= CLASSTYPE_TI_ARGS (type
);
916 /* If there are no template parameters, this cannot be a new
917 partial template specialization? */
918 if (!current_template_parms
)
921 /* The injected-class-name is not a new partial specialization. */
922 if (DECL_SELF_REFERENCE_P (TYPE_NAME (type
)))
925 /* If the constraints are not the same as those of the primary
926 then, we can probably create a new specialization. */
927 tree type_constr
= current_template_constraints ();
929 if (type
== TREE_TYPE (tmpl
))
931 tree main_constr
= get_constraints (tmpl
);
932 if (equivalent_constraints (type_constr
, main_constr
))
936 /* Also, if there's a pre-existing specialization with matching
937 constraints, then this also isn't new. */
938 tree specs
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
941 tree spec_tmpl
= TREE_VALUE (specs
);
942 tree spec_args
= TREE_PURPOSE (specs
);
943 tree spec_constr
= get_constraints (spec_tmpl
);
944 if (comp_template_args (args
, spec_args
)
945 && equivalent_constraints (type_constr
, spec_constr
))
947 specs
= TREE_CHAIN (specs
);
950 /* Create a new type node (and corresponding type decl)
951 for the newly declared specialization. */
952 tree t
= make_class_type (TREE_CODE (type
));
953 CLASSTYPE_DECLARED_CLASS (t
) = CLASSTYPE_DECLARED_CLASS (type
);
954 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (tmpl
, args
));
956 /* We only need a separate type node for storing the definition of this
957 partial specialization; uses of S<T*> are unconstrained, so all are
958 equivalent. So keep TYPE_CANONICAL the same. */
959 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
961 /* Build the corresponding type decl. */
962 tree d
= create_implicit_typedef (DECL_NAME (tmpl
), t
);
963 DECL_CONTEXT (d
) = TYPE_CONTEXT (t
);
964 DECL_SOURCE_LOCATION (d
) = input_location
;
965 TREE_PRIVATE (d
) = (current_access_specifier
== access_private_node
);
966 TREE_PROTECTED (d
) = (current_access_specifier
== access_protected_node
);
974 /* The TYPE is being declared. If it is a template type, that means it
975 is a partial specialization. Do appropriate error-checking. */
978 maybe_process_partial_specialization (tree type
)
982 if (type
== error_mark_node
)
983 return error_mark_node
;
985 /* A lambda that appears in specialization context is not itself a
987 if (CLASS_TYPE_P (type
) && CLASSTYPE_LAMBDA_EXPR (type
))
990 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
992 error ("name of class shadows template template parameter %qD",
994 return error_mark_node
;
997 context
= TYPE_CONTEXT (type
);
999 if (TYPE_ALIAS_P (type
))
1001 tree tinfo
= TYPE_ALIAS_TEMPLATE_INFO (type
);
1003 if (tinfo
&& DECL_ALIAS_TEMPLATE_P (TI_TEMPLATE (tinfo
)))
1004 error ("specialization of alias template %qD",
1005 TI_TEMPLATE (tinfo
));
1007 error ("explicit specialization of non-template %qT", type
);
1008 return error_mark_node
;
1010 else if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
1012 /* This is for ordinary explicit specialization and partial
1013 specialization of a template class such as:
1015 template <> class C<int>;
1019 template <class T> class C<T*>;
1021 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
1023 if (tree t
= maybe_new_partial_specialization (type
))
1025 if (!check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (t
))
1026 && !at_namespace_scope_p ())
1027 return error_mark_node
;
1028 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (t
);
1029 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (t
)) = input_location
;
1030 if (processing_template_decl
)
1032 tree decl
= push_template_decl (TYPE_MAIN_DECL (t
));
1033 if (decl
== error_mark_node
)
1034 return error_mark_node
;
1035 return TREE_TYPE (decl
);
1038 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
1039 error ("specialization of %qT after instantiation", type
);
1040 else if (errorcount
&& !processing_specialization
1041 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
)
1042 && !uses_template_parms (CLASSTYPE_TI_ARGS (type
)))
1043 /* Trying to define a specialization either without a template<> header
1044 or in an inappropriate place. We've already given an error, so just
1045 bail now so we don't actually define the specialization. */
1046 return error_mark_node
;
1048 else if (CLASS_TYPE_P (type
)
1049 && !CLASSTYPE_USE_TEMPLATE (type
)
1050 && CLASSTYPE_TEMPLATE_INFO (type
)
1051 && context
&& CLASS_TYPE_P (context
)
1052 && CLASSTYPE_TEMPLATE_INFO (context
))
1054 /* This is for an explicit specialization of member class
1055 template according to [temp.expl.spec/18]:
1057 template <> template <class U> class C<int>::D;
1059 The context `C<int>' must be an implicit instantiation.
1060 Otherwise this is just a member class template declared
1063 template <> class C<int> { template <class U> class D; };
1064 template <> template <class U> class C<int>::D;
1066 In the first case, `C<int>::D' is a specialization of `C<T>::D'
1067 while in the second case, `C<int>::D' is a primary template
1068 and `C<T>::D' may not exist. */
1070 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
1071 && !COMPLETE_TYPE_P (type
))
1074 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
1076 if (current_namespace
1077 != decl_namespace_context (tmpl
))
1079 if (permerror (input_location
,
1080 "specialization of %qD in different namespace",
1082 inform (DECL_SOURCE_LOCATION (tmpl
),
1083 "from definition of %q#D", tmpl
);
1086 /* Check for invalid specialization after instantiation:
1088 template <> template <> class C<int>::D<int>;
1089 template <> template <class U> class C<int>::D; */
1091 for (t
= DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
1092 t
; t
= TREE_CHAIN (t
))
1094 tree inst
= TREE_VALUE (t
);
1095 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (inst
)
1096 || !COMPLETE_OR_OPEN_TYPE_P (inst
))
1098 /* We already have a full specialization of this partial
1099 instantiation, or a full specialization has been
1100 looked up but not instantiated. Reassign it to the
1101 new member specialization template. */
1105 elt
.tmpl
= most_general_template (tmpl
);
1106 elt
.args
= CLASSTYPE_TI_ARGS (inst
);
1109 type_specializations
->remove_elt (&elt
);
1112 CLASSTYPE_TI_ARGS (inst
)
1113 = elt
.args
= INNERMOST_TEMPLATE_ARGS (elt
.args
);
1116 = type_specializations
->find_slot (&elt
, INSERT
);
1117 entry
= ggc_alloc
<spec_entry
> ();
1122 /* But if we've had an implicit instantiation, that's a
1123 problem ([temp.expl.spec]/6). */
1124 error ("specialization %qT after instantiation %qT",
1128 /* Mark TYPE as a specialization. And as a result, we only
1129 have one level of template argument for the innermost
1131 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
1132 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
1133 CLASSTYPE_TI_ARGS (type
)
1134 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
1137 else if (processing_specialization
)
1139 /* Someday C++0x may allow for enum template specialization. */
1140 if (cxx_dialect
> cxx98
&& TREE_CODE (type
) == ENUMERAL_TYPE
1141 && CLASS_TYPE_P (context
) && CLASSTYPE_USE_TEMPLATE (context
))
1142 pedwarn (input_location
, OPT_Wpedantic
, "template specialization "
1143 "of %qD not allowed by ISO C++", type
);
1146 error ("explicit specialization of non-template %qT", type
);
1147 return error_mark_node
;
1154 /* Returns nonzero if we can optimize the retrieval of specializations
1155 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
1156 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
1159 optimize_specialization_lookup_p (tree tmpl
)
1161 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
1162 && DECL_CLASS_SCOPE_P (tmpl
)
1163 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
1165 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
1166 /* The optimized lookup depends on the fact that the
1167 template arguments for the member function template apply
1168 purely to the containing class, which is not true if the
1169 containing class is an explicit or partial
1171 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
1172 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
1173 && !DECL_CONV_FN_P (tmpl
)
1174 /* It is possible to have a template that is not a member
1175 template and is not a member of a template class:
1177 template <typename T>
1178 struct S { friend A::f(); };
1180 Here, the friend function is a template, but the context does
1181 not have template information. The optimized lookup relies
1182 on having ARGS be the template arguments for both the class
1183 and the function template. */
1184 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
1187 /* Make sure ARGS doesn't use any inappropriate typedefs; we should have
1188 gone through coerce_template_parms by now. */
1191 verify_unstripped_args_1 (tree inner
)
1193 for (int i
= 0; i
< TREE_VEC_LENGTH (inner
); ++i
)
1195 tree arg
= TREE_VEC_ELT (inner
, i
);
1196 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
1198 else if (TYPE_P (arg
))
1199 gcc_assert (strip_typedefs (arg
, NULL
) == arg
);
1200 else if (ARGUMENT_PACK_P (arg
))
1201 verify_unstripped_args_1 (ARGUMENT_PACK_ARGS (arg
));
1202 else if (strip_typedefs (TREE_TYPE (arg
), NULL
) != TREE_TYPE (arg
))
1203 /* Allow typedefs on the type of a non-type argument, since a
1204 parameter can have them. */;
1206 gcc_assert (strip_typedefs_expr (arg
, NULL
) == arg
);
1211 verify_unstripped_args (tree args
)
1213 ++processing_template_decl
;
1214 if (!any_dependent_template_arguments_p (args
))
1215 verify_unstripped_args_1 (INNERMOST_TEMPLATE_ARGS (args
));
1216 --processing_template_decl
;
1219 /* Retrieve the specialization (in the sense of [temp.spec] - a
1220 specialization is either an instantiation or an explicit
1221 specialization) of TMPL for the given template ARGS. If there is
1222 no such specialization, return NULL_TREE. The ARGS are a vector of
1223 arguments, or a vector of vectors of arguments, in the case of
1224 templates with more than one level of parameters.
1226 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1227 then we search for a partial specialization matching ARGS. This
1228 parameter is ignored if TMPL is not a class template.
1230 We can also look up a FIELD_DECL, if it is a lambda capture pack; the
1231 result is a NONTYPE_ARGUMENT_PACK. */
1234 retrieve_specialization (tree tmpl
, tree args
, hashval_t hash
)
1236 if (tmpl
== NULL_TREE
)
1239 if (args
== error_mark_node
)
1242 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
1243 || TREE_CODE (tmpl
) == FIELD_DECL
);
1245 /* There should be as many levels of arguments as there are
1246 levels of parameters. */
1247 gcc_assert (TMPL_ARGS_DEPTH (args
)
1248 == (TREE_CODE (tmpl
) == TEMPLATE_DECL
1249 ? TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
))
1250 : template_class_depth (DECL_CONTEXT (tmpl
))));
1253 verify_unstripped_args (args
);
1255 /* Lambda functions in templates aren't instantiated normally, but through
1256 tsubst_lambda_expr. */
1257 if (lambda_fn_in_template_p (tmpl
))
1260 if (optimize_specialization_lookup_p (tmpl
))
1262 /* The template arguments actually apply to the containing
1263 class. Find the class specialization with those
1265 tree class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
1266 tree class_specialization
1267 = retrieve_specialization (class_template
, args
, 0);
1268 if (!class_specialization
)
1271 /* Find the instance of TMPL. */
1272 tree fns
= get_class_binding (class_specialization
, DECL_NAME (tmpl
));
1273 for (ovl_iterator
iter (fns
); iter
; ++iter
)
1276 if (tree ti
= get_template_info (fn
))
1277 if (TI_TEMPLATE (ti
) == tmpl
1278 /* using-declarations can bring in a different
1279 instantiation of tmpl as a member of a different
1280 instantiation of tmpl's class. We don't want those
1282 && DECL_CONTEXT (fn
) == class_specialization
)
1291 spec_hash_table
*specializations
;
1295 elt
.spec
= NULL_TREE
;
1297 if (DECL_CLASS_TEMPLATE_P (tmpl
))
1298 specializations
= type_specializations
;
1300 specializations
= decl_specializations
;
1303 hash
= spec_hasher::hash (&elt
);
1304 found
= specializations
->find_with_hash (&elt
, hash
);
1312 /* Like retrieve_specialization, but for local declarations. */
1315 retrieve_local_specialization (tree tmpl
)
1317 if (local_specializations
== NULL
)
1320 tree
*slot
= local_specializations
->get (tmpl
);
1321 return slot
? *slot
: NULL_TREE
;
1324 /* Returns nonzero iff DECL is a specialization of TMPL. */
1327 is_specialization_of (tree decl
, tree tmpl
)
1331 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1335 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1341 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1343 for (t
= TREE_TYPE (decl
);
1345 t
= CLASSTYPE_USE_TEMPLATE (t
)
1346 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1347 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1354 /* Returns nonzero iff DECL is a specialization of friend declaration
1355 FRIEND_DECL according to [temp.friend]. */
1358 is_specialization_of_friend (tree decl
, tree friend_decl
)
1360 bool need_template
= true;
1363 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1364 || TREE_CODE (decl
) == TYPE_DECL
);
1366 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1367 of a template class, we want to check if DECL is a specialization
1369 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1370 && DECL_TEMPLATE_INFO (friend_decl
)
1371 && !DECL_USE_TEMPLATE (friend_decl
))
1373 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1374 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1375 need_template
= false;
1377 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1378 && !PRIMARY_TEMPLATE_P (friend_decl
))
1379 need_template
= false;
1381 /* There is nothing to do if this is not a template friend. */
1382 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1385 if (is_specialization_of (decl
, friend_decl
))
1389 A member of a class template may be declared to be a friend of a
1390 non-template class. In this case, the corresponding member of
1391 every specialization of the class template is a friend of the
1392 class granting friendship.
1394 For example, given a template friend declaration
1396 template <class T> friend void A<T>::f();
1398 the member function below is considered a friend
1400 template <> struct A<int> {
1404 For this type of template friend, TEMPLATE_DEPTH below will be
1405 nonzero. To determine if DECL is a friend of FRIEND, we first
1406 check if the enclosing class is a specialization of another. */
1408 template_depth
= template_class_depth (CP_DECL_CONTEXT (friend_decl
));
1410 && DECL_CLASS_SCOPE_P (decl
)
1411 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1412 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1414 /* Next, we check the members themselves. In order to handle
1415 a few tricky cases, such as when FRIEND_DECL's are
1417 template <class T> friend void A<T>::g(T t);
1418 template <class T> template <T t> friend void A<T>::h();
1422 void A<int>::g(int);
1423 template <int> void A<int>::h();
1425 we need to figure out ARGS, the template arguments from
1426 the context of DECL. This is required for template substitution
1427 of `T' in the function parameter of `g' and template parameter
1428 of `h' in the above examples. Here ARGS corresponds to `int'. */
1430 tree context
= DECL_CONTEXT (decl
);
1431 tree args
= NULL_TREE
;
1432 int current_depth
= 0;
1434 while (current_depth
< template_depth
)
1436 if (CLASSTYPE_TEMPLATE_INFO (context
))
1438 if (current_depth
== 0)
1439 args
= TYPE_TI_ARGS (context
);
1441 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1444 context
= TYPE_CONTEXT (context
);
1447 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1452 tree friend_args_type
;
1453 tree decl_args_type
;
1455 /* Make sure that both DECL and FRIEND_DECL are templates or
1457 is_template
= DECL_TEMPLATE_INFO (decl
)
1458 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1459 if (need_template
^ is_template
)
1461 else if (is_template
)
1463 /* If both are templates, check template parameter list. */
1465 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1467 if (!comp_template_parms
1468 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1472 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1475 decl_type
= TREE_TYPE (decl
);
1477 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1478 tf_none
, NULL_TREE
);
1479 if (friend_type
== error_mark_node
)
1482 /* Check if return types match. */
1483 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1486 /* Check if function parameter types match, ignoring the
1487 `this' parameter. */
1488 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1489 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1490 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1491 friend_args_type
= TREE_CHAIN (friend_args_type
);
1492 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1493 decl_args_type
= TREE_CHAIN (decl_args_type
);
1495 return compparms (decl_args_type
, friend_args_type
);
1499 /* DECL is a TYPE_DECL */
1501 tree decl_type
= TREE_TYPE (decl
);
1503 /* Make sure that both DECL and FRIEND_DECL are templates or
1506 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1507 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1509 if (need_template
^ is_template
)
1511 else if (is_template
)
1514 /* If both are templates, check the name of the two
1515 TEMPLATE_DECL's first because is_friend didn't. */
1516 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1517 != DECL_NAME (friend_decl
))
1520 /* Now check template parameter list. */
1522 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1524 return comp_template_parms
1525 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1529 return (DECL_NAME (decl
)
1530 == DECL_NAME (friend_decl
));
1536 /* Register the specialization SPEC as a specialization of TMPL with
1537 the indicated ARGS. IS_FRIEND indicates whether the specialization
1538 is actually just a friend declaration. ATTRLIST is the list of
1539 attributes that the specialization is declared with or NULL when
1540 it isn't. Returns SPEC, or an equivalent prior declaration, if
1543 We also store instantiations of field packs in the hash table, even
1544 though they are not themselves templates, to make lookup easier. */
1547 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
,
1551 spec_entry
**slot
= NULL
;
1554 gcc_assert ((TREE_CODE (tmpl
) == TEMPLATE_DECL
&& DECL_P (spec
))
1555 || (TREE_CODE (tmpl
) == FIELD_DECL
1556 && TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
));
1558 if (TREE_CODE (spec
) == FUNCTION_DECL
1559 && uses_template_parms (DECL_TI_ARGS (spec
)))
1560 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1561 register it; we want the corresponding TEMPLATE_DECL instead.
1562 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1563 the more obvious `uses_template_parms (spec)' to avoid problems
1564 with default function arguments. In particular, given
1565 something like this:
1567 template <class T> void f(T t1, T t = T())
1569 the default argument expression is not substituted for in an
1570 instantiation unless and until it is actually needed. */
1573 if (optimize_specialization_lookup_p (tmpl
))
1574 /* We don't put these specializations in the hash table, but we might
1575 want to give an error about a mismatch. */
1576 fn
= retrieve_specialization (tmpl
, args
, 0);
1584 hash
= spec_hasher::hash (&elt
);
1586 slot
= decl_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
1593 /* We can sometimes try to re-register a specialization that we've
1594 already got. In particular, regenerate_decl_from_template calls
1595 duplicate_decls which will update the specialization list. But,
1596 we'll still get called again here anyhow. It's more convenient
1597 to simply allow this than to try to prevent it. */
1600 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1602 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1604 if (DECL_ODR_USED (fn
)
1605 || DECL_EXPLICIT_INSTANTIATION (fn
))
1607 error ("specialization of %qD after instantiation",
1609 return error_mark_node
;
1614 /* This situation should occur only if the first
1615 specialization is an implicit instantiation, the
1616 second is an explicit specialization, and the
1617 implicit instantiation has not yet been used. That
1618 situation can occur if we have implicitly
1619 instantiated a member function and then specialized
1622 We can also wind up here if a friend declaration that
1623 looked like an instantiation turns out to be a
1626 template <class T> void foo(T);
1627 class S { friend void foo<>(int) };
1628 template <> void foo(int);
1630 We transform the existing DECL in place so that any
1631 pointers to it become pointers to the updated
1634 If there was a definition for the template, but not
1635 for the specialization, we want this to look as if
1636 there were no definition, and vice versa. */
1637 DECL_INITIAL (fn
) = NULL_TREE
;
1638 duplicate_decls (spec
, fn
, is_friend
);
1639 /* The call to duplicate_decls will have applied
1642 An explicit specialization of a function template
1643 is inline only if it is explicitly declared to be,
1644 and independently of whether its function template
1647 to the primary function; now copy the inline bits to
1648 the various clones. */
1649 FOR_EACH_CLONE (clone
, fn
)
1651 DECL_DECLARED_INLINE_P (clone
)
1652 = DECL_DECLARED_INLINE_P (fn
);
1653 DECL_SOURCE_LOCATION (clone
)
1654 = DECL_SOURCE_LOCATION (fn
);
1655 DECL_DELETED_FN (clone
)
1656 = DECL_DELETED_FN (fn
);
1658 check_specialization_namespace (tmpl
);
1663 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1665 tree dd
= duplicate_decls (spec
, fn
, is_friend
);
1666 if (dd
== error_mark_node
)
1667 /* We've already complained in duplicate_decls. */
1668 return error_mark_node
;
1670 if (dd
== NULL_TREE
&& DECL_INITIAL (spec
))
1671 /* Dup decl failed, but this is a new definition. Set the
1672 line number so any errors match this new
1674 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1680 return duplicate_decls (spec
, fn
, is_friend
);
1682 /* A specialization must be declared in the same namespace as the
1683 template it is specializing. */
1684 if (DECL_P (spec
) && DECL_TEMPLATE_SPECIALIZATION (spec
)
1685 && !check_specialization_namespace (tmpl
))
1686 DECL_CONTEXT (spec
) = DECL_CONTEXT (tmpl
);
1688 if (slot
!= NULL
/* !optimize_specialization_lookup_p (tmpl) */)
1690 spec_entry
*entry
= ggc_alloc
<spec_entry
> ();
1691 gcc_assert (tmpl
&& args
&& spec
);
1694 if ((TREE_CODE (spec
) == FUNCTION_DECL
&& DECL_NAMESPACE_SCOPE_P (spec
)
1695 && PRIMARY_TEMPLATE_P (tmpl
)
1696 && DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (tmpl
)) == NULL_TREE
)
1697 || variable_template_p (tmpl
))
1698 /* If TMPL is a forward declaration of a template function, keep a list
1699 of all specializations in case we need to reassign them to a friend
1700 template later in tsubst_friend_function.
1702 Also keep a list of all variable template instantiations so that
1703 process_partial_specialization can check whether a later partial
1704 specialization would have used it. */
1705 DECL_TEMPLATE_INSTANTIATIONS (tmpl
)
1706 = tree_cons (args
, spec
, DECL_TEMPLATE_INSTANTIATIONS (tmpl
));
1712 /* Returns true iff two spec_entry nodes are equivalent. */
1714 int comparing_specializations
;
1717 spec_hasher::equal (spec_entry
*e1
, spec_entry
*e2
)
1721 ++comparing_specializations
;
1722 equal
= (e1
->tmpl
== e2
->tmpl
1723 && comp_template_args (e1
->args
, e2
->args
));
1724 if (equal
&& flag_concepts
1725 /* tmpl could be a FIELD_DECL for a capture pack. */
1726 && TREE_CODE (e1
->tmpl
) == TEMPLATE_DECL
1727 && VAR_P (DECL_TEMPLATE_RESULT (e1
->tmpl
))
1728 && uses_template_parms (e1
->args
))
1730 /* Partial specializations of a variable template can be distinguished by
1732 tree c1
= e1
->spec
? get_constraints (e1
->spec
) : NULL_TREE
;
1733 tree c2
= e2
->spec
? get_constraints (e2
->spec
) : NULL_TREE
;
1734 equal
= equivalent_constraints (c1
, c2
);
1736 --comparing_specializations
;
1741 /* Returns a hash for a template TMPL and template arguments ARGS. */
1744 hash_tmpl_and_args (tree tmpl
, tree args
)
1746 hashval_t val
= iterative_hash_object (DECL_UID (tmpl
), 0);
1747 return iterative_hash_template_arg (args
, val
);
1750 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1754 spec_hasher::hash (spec_entry
*e
)
1756 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
1759 /* Recursively calculate a hash value for a template argument ARG, for use
1760 in the hash tables of template specializations. We must be
1761 careful to (at least) skip the same entities template_args_equal
1765 iterative_hash_template_arg (tree arg
, hashval_t val
)
1767 if (arg
== NULL_TREE
)
1768 return iterative_hash_object (arg
, val
);
1771 /* Strip nop-like things, but not the same as STRIP_NOPS. */
1772 while (CONVERT_EXPR_P (arg
)
1773 || TREE_CODE (arg
) == NON_LVALUE_EXPR
1774 || class_nttp_const_wrapper_p (arg
))
1775 arg
= TREE_OPERAND (arg
, 0);
1777 enum tree_code code
= TREE_CODE (arg
);
1779 val
= iterative_hash_object (code
, val
);
1783 case ARGUMENT_PACK_SELECT
:
1789 case IDENTIFIER_NODE
:
1790 return iterative_hash_object (IDENTIFIER_HASH_VALUE (arg
), val
);
1793 for (int i
= 0, len
= TREE_VEC_LENGTH (arg
); i
< len
; ++i
)
1794 val
= iterative_hash_template_arg (TREE_VEC_ELT (arg
, i
), val
);
1797 case TYPE_PACK_EXPANSION
:
1798 case EXPR_PACK_EXPANSION
:
1799 val
= iterative_hash_template_arg (PACK_EXPANSION_PATTERN (arg
), val
);
1800 return iterative_hash_template_arg (PACK_EXPANSION_EXTRA_ARGS (arg
), val
);
1802 case TYPE_ARGUMENT_PACK
:
1803 case NONTYPE_ARGUMENT_PACK
:
1804 return iterative_hash_template_arg (ARGUMENT_PACK_ARGS (arg
), val
);
1807 for (; arg
; arg
= TREE_CHAIN (arg
))
1808 val
= iterative_hash_template_arg (TREE_VALUE (arg
), val
);
1812 for (lkp_iterator
iter (arg
); iter
; ++iter
)
1813 val
= iterative_hash_template_arg (*iter
, val
);
1820 iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1821 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg
), i
, field
, value
)
1823 val
= iterative_hash_template_arg (field
, val
);
1824 val
= iterative_hash_template_arg (value
, val
);
1830 if (!DECL_ARTIFICIAL (arg
))
1832 val
= iterative_hash_object (DECL_PARM_INDEX (arg
), val
);
1833 val
= iterative_hash_object (DECL_PARM_LEVEL (arg
), val
);
1835 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1838 return iterative_hash_template_arg (TARGET_EXPR_INITIAL (arg
), val
);
1841 val
= iterative_hash_template_arg (PTRMEM_CST_CLASS (arg
), val
);
1842 return iterative_hash_template_arg (PTRMEM_CST_MEMBER (arg
), val
);
1844 case TEMPLATE_PARM_INDEX
:
1845 val
= iterative_hash_template_arg
1846 (TREE_TYPE (TEMPLATE_PARM_DECL (arg
)), val
);
1847 val
= iterative_hash_object (TEMPLATE_PARM_LEVEL (arg
), val
);
1848 return iterative_hash_object (TEMPLATE_PARM_IDX (arg
), val
);
1851 val
= iterative_hash_object (TRAIT_EXPR_KIND (arg
), val
);
1852 val
= iterative_hash_template_arg (TRAIT_EXPR_TYPE1 (arg
), val
);
1853 return iterative_hash_template_arg (TRAIT_EXPR_TYPE2 (arg
), val
);
1856 val
= iterative_hash_template_arg (BINFO_TYPE (BASELINK_BINFO (arg
)),
1858 return iterative_hash_template_arg (DECL_NAME (get_first_fn (arg
)),
1862 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, 0), val
);
1863 code
= TREE_CODE (TREE_OPERAND (arg
, 1));
1864 val
= iterative_hash_object (code
, val
);
1865 return iterative_hash_template_arg (TREE_OPERAND (arg
, 2), val
);
1868 /* [temp.over.link] Two lambda-expressions are never considered
1871 So just hash the closure type. */
1872 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1875 case IMPLICIT_CONV_EXPR
:
1876 case STATIC_CAST_EXPR
:
1877 case REINTERPRET_CAST_EXPR
:
1878 case CONST_CAST_EXPR
:
1879 case DYNAMIC_CAST_EXPR
:
1881 val
= iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1882 /* Now hash operands as usual. */
1887 tree fn
= CALL_EXPR_FN (arg
);
1888 if (tree name
= dependent_name (fn
))
1890 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
1891 val
= iterative_hash_template_arg (TREE_OPERAND (fn
, 1), val
);
1894 val
= iterative_hash_template_arg (fn
, val
);
1895 call_expr_arg_iterator ai
;
1896 for (tree x
= first_call_expr_arg (arg
, &ai
); x
;
1897 x
= next_call_expr_arg (&ai
))
1898 val
= iterative_hash_template_arg (x
, val
);
1906 char tclass
= TREE_CODE_CLASS (code
);
1910 if (tree ats
= alias_template_specialization_p (arg
, nt_transparent
))
1912 // We want an alias specialization that survived strip_typedefs
1913 // to hash differently from its TYPE_CANONICAL, to avoid hash
1914 // collisions that compare as different in template_args_equal.
1915 // These could be dependent specializations that strip_typedefs
1916 // left alone, or untouched specializations because
1917 // coerce_template_parms returns the unconverted template
1918 // arguments if it sees incomplete argument packs.
1919 tree ti
= TYPE_ALIAS_TEMPLATE_INFO (ats
);
1920 return hash_tmpl_and_args (TI_TEMPLATE (ti
), TI_ARGS (ti
));
1923 switch (TREE_CODE (arg
))
1925 case TEMPLATE_TEMPLATE_PARM
:
1927 tree tpi
= TEMPLATE_TYPE_PARM_INDEX (arg
);
1929 /* Do not recurse with TPI directly, as that is unbounded
1931 val
= iterative_hash_object (TEMPLATE_PARM_LEVEL (tpi
), val
);
1932 val
= iterative_hash_object (TEMPLATE_PARM_IDX (tpi
), val
);
1937 val
= iterative_hash_template_arg (DECLTYPE_TYPE_EXPR (arg
), val
);
1941 if (tree canonical
= TYPE_CANONICAL (arg
))
1942 val
= iterative_hash_object (TYPE_HASH (canonical
), val
);
1948 case tcc_declaration
:
1950 return iterative_hash_expr (arg
, val
);
1953 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
1954 for (int i
= 0, n
= cp_tree_operand_length (arg
); i
< n
; ++i
)
1955 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, i
), val
);
1963 /* Unregister the specialization SPEC as a specialization of TMPL.
1964 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1965 if the SPEC was listed as a specialization of TMPL.
1967 Note that SPEC has been ggc_freed, so we can't look inside it. */
1970 reregister_specialization (tree spec
, tree tinfo
, tree new_spec
)
1975 elt
.tmpl
= most_general_template (TI_TEMPLATE (tinfo
));
1976 elt
.args
= TI_ARGS (tinfo
);
1977 elt
.spec
= NULL_TREE
;
1979 entry
= decl_specializations
->find (&elt
);
1982 gcc_assert (entry
->spec
== spec
|| entry
->spec
== new_spec
);
1983 gcc_assert (new_spec
!= NULL_TREE
);
1984 entry
->spec
= new_spec
;
1991 /* Like register_specialization, but for local declarations. We are
1992 registering SPEC, an instantiation of TMPL. */
1995 register_local_specialization (tree spec
, tree tmpl
)
1997 gcc_assert (tmpl
!= spec
);
1998 local_specializations
->put (tmpl
, spec
);
2001 /* TYPE is a class type. Returns true if TYPE is an explicitly
2002 specialized class. */
2005 explicit_class_specialization_p (tree type
)
2007 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
2009 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
2012 /* Print the list of functions at FNS, going through all the overloads
2013 for each element of the list. Alternatively, FNS cannot be a
2014 TREE_LIST, in which case it will be printed together with all the
2017 MORE and *STR should respectively be FALSE and NULL when the function
2018 is called from the outside. They are used internally on recursive
2019 calls. print_candidates manages the two parameters and leaves NULL
2020 in *STR when it ends. */
2023 print_candidates_1 (tree fns
, char **str
, bool more
= false)
2025 if (TREE_CODE (fns
) == TREE_LIST
)
2026 for (; fns
; fns
= TREE_CHAIN (fns
))
2027 print_candidates_1 (TREE_VALUE (fns
), str
, more
|| TREE_CHAIN (fns
));
2029 for (lkp_iterator
iter (fns
); iter
;)
2034 const char *pfx
= *str
;
2038 pfx
= _("candidates are:");
2040 pfx
= _("candidate is:");
2041 *str
= get_spaces (pfx
);
2043 inform (DECL_SOURCE_LOCATION (cand
), "%s %#qD", pfx
, cand
);
2047 /* Print the list of candidate FNS in an error message. FNS can also
2048 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
2051 print_candidates (tree fns
)
2054 print_candidates_1 (fns
, &str
);
2058 /* Get a (possibly) constrained template declaration for the
2059 purpose of ordering candidates. */
2061 get_template_for_ordering (tree list
)
2063 gcc_assert (TREE_CODE (list
) == TREE_LIST
);
2064 tree f
= TREE_VALUE (list
);
2065 if (tree ti
= DECL_TEMPLATE_INFO (f
))
2066 return TI_TEMPLATE (ti
);
2070 /* Among candidates having the same signature, return the
2071 most constrained or NULL_TREE if there is no best candidate.
2072 If the signatures of candidates vary (e.g., template
2073 specialization vs. member function), then there can be no
2076 Note that we don't compare constraints on the functions
2077 themselves, but rather those of their templates. */
2079 most_constrained_function (tree candidates
)
2081 // Try to find the best candidate in a first pass.
2082 tree champ
= candidates
;
2083 for (tree c
= TREE_CHAIN (champ
); c
; c
= TREE_CHAIN (c
))
2085 int winner
= more_constrained (get_template_for_ordering (champ
),
2086 get_template_for_ordering (c
));
2088 champ
= c
; // The candidate is more constrained
2089 else if (winner
== 0)
2090 return NULL_TREE
; // Neither is more constrained
2093 // Verify that the champ is better than previous candidates.
2094 for (tree c
= candidates
; c
!= champ
; c
= TREE_CHAIN (c
)) {
2095 if (!more_constrained (get_template_for_ordering (champ
),
2096 get_template_for_ordering (c
)))
2104 /* Returns the template (one of the functions given by TEMPLATE_ID)
2105 which can be specialized to match the indicated DECL with the
2106 explicit template args given in TEMPLATE_ID. The DECL may be
2107 NULL_TREE if none is available. In that case, the functions in
2108 TEMPLATE_ID are non-members.
2110 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
2111 specialization of a member template.
2113 The TEMPLATE_COUNT is the number of references to qualifying
2114 template classes that appeared in the name of the function. See
2115 check_explicit_specialization for a more accurate description.
2117 TSK indicates what kind of template declaration (if any) is being
2118 declared. TSK_TEMPLATE indicates that the declaration given by
2119 DECL, though a FUNCTION_DECL, has template parameters, and is
2120 therefore a template function.
2122 The template args (those explicitly specified and those deduced)
2123 are output in a newly created vector *TARGS_OUT.
2125 If it is impossible to determine the result, an error message is
2126 issued. The error_mark_node is returned to indicate failure. */
2129 determine_specialization (tree template_id
,
2132 int need_member_template
,
2138 tree explicit_targs
;
2139 tree candidates
= NULL_TREE
;
2141 /* A TREE_LIST of templates of which DECL may be a specialization.
2142 The TREE_VALUE of each node is a TEMPLATE_DECL. The
2143 corresponding TREE_PURPOSE is the set of template arguments that,
2144 when used to instantiate the template, would produce a function
2145 with the signature of DECL. */
2146 tree templates
= NULL_TREE
;
2148 cp_binding_level
*b
;
2150 *targs_out
= NULL_TREE
;
2152 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
2153 return error_mark_node
;
2155 /* We shouldn't be specializing a member template of an
2156 unspecialized class template; we already gave an error in
2157 check_specialization_scope, now avoid crashing. */
2159 && template_count
&& DECL_CLASS_SCOPE_P (decl
)
2160 && template_class_depth (DECL_CONTEXT (decl
)) > 0)
2162 gcc_assert (errorcount
);
2163 return error_mark_node
;
2166 fns
= TREE_OPERAND (template_id
, 0);
2167 explicit_targs
= TREE_OPERAND (template_id
, 1);
2169 if (fns
== error_mark_node
)
2170 return error_mark_node
;
2172 /* Check for baselinks. */
2173 if (BASELINK_P (fns
))
2174 fns
= BASELINK_FUNCTIONS (fns
);
2176 if (TREE_CODE (decl
) == FUNCTION_DECL
&& !is_overloaded_fn (fns
))
2178 error_at (DECL_SOURCE_LOCATION (decl
),
2179 "%qD is not a function template", fns
);
2180 return error_mark_node
;
2182 else if (VAR_P (decl
) && !variable_template_p (fns
))
2184 error ("%qD is not a variable template", fns
);
2185 return error_mark_node
;
2188 /* Count the number of template headers specified for this
2191 for (b
= current_binding_level
;
2192 b
->kind
== sk_template_parms
;
2196 tree orig_fns
= fns
;
2198 if (variable_template_p (fns
))
2200 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (fns
));
2201 targs
= coerce_template_parms (parms
, explicit_targs
, fns
,
2202 tf_warning_or_error
,
2203 /*req_all*/true, /*use_defarg*/true);
2204 if (targs
!= error_mark_node
)
2205 templates
= tree_cons (targs
, fns
, templates
);
2207 else for (lkp_iterator
iter (fns
); iter
; ++iter
)
2211 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2213 tree decl_arg_types
;
2217 /* In case of explicit specialization, we need to check if
2218 the number of template headers appearing in the specialization
2219 is correct. This is usually done in check_explicit_specialization,
2220 but the check done there cannot be exhaustive when specializing
2221 member functions. Consider the following code:
2223 template <> void A<int>::f(int);
2224 template <> template <> void A<int>::f(int);
2226 Assuming that A<int> is not itself an explicit specialization
2227 already, the first line specializes "f" which is a non-template
2228 member function, whilst the second line specializes "f" which
2229 is a template member function. So both lines are syntactically
2230 correct, and check_explicit_specialization does not reject
2233 Here, we can do better, as we are matching the specialization
2234 against the declarations. We count the number of template
2235 headers, and we check if they match TEMPLATE_COUNT + 1
2236 (TEMPLATE_COUNT is the number of qualifying template classes,
2237 plus there must be another header for the member template
2240 Notice that if header_count is zero, this is not a
2241 specialization but rather a template instantiation, so there
2242 is no check we can perform here. */
2243 if (header_count
&& header_count
!= template_count
+ 1)
2246 /* Check that the number of template arguments at the
2247 innermost level for DECL is the same as for FN. */
2248 if (current_binding_level
->kind
== sk_template_parms
2249 && !current_binding_level
->explicit_spec_p
2250 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
2251 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
2252 (current_template_parms
))))
2255 /* DECL might be a specialization of FN. */
2256 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2257 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
2259 /* For a non-static member function, we need to make sure
2260 that the const qualification is the same. Since
2261 get_bindings does not try to merge the "this" parameter,
2262 we must do the comparison explicitly. */
2263 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
2265 if (!same_type_p (TREE_VALUE (fn_arg_types
),
2266 TREE_VALUE (decl_arg_types
)))
2269 /* And the ref-qualification. */
2270 if (type_memfn_rqual (TREE_TYPE (decl
))
2271 != type_memfn_rqual (TREE_TYPE (fn
)))
2275 /* Skip the "this" parameter and, for constructors of
2276 classes with virtual bases, the VTT parameter. A
2277 full specialization of a constructor will have a VTT
2278 parameter, but a template never will. */
2280 = skip_artificial_parms_for (decl
, decl_arg_types
);
2282 = skip_artificial_parms_for (fn
, fn_arg_types
);
2284 /* Function templates cannot be specializations; there are
2285 no partial specializations of functions. Therefore, if
2286 the type of DECL does not match FN, there is no
2289 Note that it should never be the case that we have both
2290 candidates added here, and for regular member functions
2292 if (tsk
== tsk_template
)
2294 if (!comp_template_parms (DECL_TEMPLATE_PARMS (fn
),
2295 current_template_parms
))
2297 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
2298 TREE_TYPE (TREE_TYPE (fn
))))
2300 if (!compparms (fn_arg_types
, decl_arg_types
))
2303 tree freq
= get_trailing_function_requirements (fn
);
2304 tree dreq
= get_trailing_function_requirements (decl
);
2309 tree fargs
= DECL_TI_ARGS (fn
);
2310 tsubst_flags_t complain
= tf_none
;
2311 freq
= tsubst_constraint (freq
, fargs
, complain
, fn
);
2312 if (!cp_tree_equal (freq
, dreq
))
2316 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2320 /* See whether this function might be a specialization of this
2321 template. Suppress access control because we might be trying
2322 to make this specialization a friend, and we have already done
2323 access control for the declaration of the specialization. */
2324 push_deferring_access_checks (dk_no_check
);
2325 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
2326 pop_deferring_access_checks ();
2329 /* We cannot deduce template arguments that when used to
2330 specialize TMPL will produce DECL. */
2333 if (uses_template_parms (targs
))
2334 /* We deduced something involving 'auto', which isn't a valid
2335 template argument. */
2338 /* Remove, from the set of candidates, all those functions
2339 whose constraints are not satisfied. */
2340 if (flag_concepts
&& !constraints_satisfied_p (fn
, targs
))
2343 // Then, try to form the new function type.
2344 insttype
= tsubst (TREE_TYPE (fn
), targs
, tf_fndecl_type
, NULL_TREE
);
2345 if (insttype
== error_mark_node
)
2348 = skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (insttype
));
2349 if (!compparms (fn_arg_types
, decl_arg_types
))
2352 /* Save this template, and the arguments deduced. */
2353 templates
= tree_cons (targs
, fn
, templates
);
2355 else if (need_member_template
)
2356 /* FN is an ordinary member function, and we need a
2357 specialization of a member template. */
2359 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
2360 /* We can get IDENTIFIER_NODEs here in certain erroneous
2363 else if (!DECL_FUNCTION_MEMBER_P (fn
))
2364 /* This is just an ordinary non-member function. Nothing can
2365 be a specialization of that. */
2367 else if (DECL_ARTIFICIAL (fn
))
2368 /* Cannot specialize functions that are created implicitly. */
2372 tree decl_arg_types
;
2374 /* This is an ordinary member function. However, since
2375 we're here, we can assume its enclosing class is a
2376 template class. For example,
2378 template <typename T> struct S { void f(); };
2379 template <> void S<int>::f() {}
2381 Here, S<int>::f is a non-template, but S<int> is a
2382 template class. If FN has the same type as DECL, we
2383 might be in business. */
2385 if (!DECL_TEMPLATE_INFO (fn
))
2386 /* Its enclosing class is an explicit specialization
2387 of a template class. This is not a candidate. */
2390 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
2391 TREE_TYPE (TREE_TYPE (fn
))))
2392 /* The return types differ. */
2395 /* Adjust the type of DECL in case FN is a static member. */
2396 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2397 if (DECL_STATIC_FUNCTION_P (fn
)
2398 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2399 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
2401 if (!compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
2405 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2406 && (type_memfn_rqual (TREE_TYPE (decl
))
2407 != type_memfn_rqual (TREE_TYPE (fn
))))
2410 // If the deduced arguments do not satisfy the constraints,
2411 // this is not a candidate.
2412 if (flag_concepts
&& !constraints_satisfied_p (fn
))
2415 // Add the candidate.
2416 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2420 if (templates
&& TREE_CHAIN (templates
))
2426 It is possible for a specialization with a given function
2427 signature to be instantiated from more than one function
2428 template. In such cases, explicit specification of the
2429 template arguments must be used to uniquely identify the
2430 function template specialization being specialized.
2432 Note that here, there's no suggestion that we're supposed to
2433 determine which of the candidate templates is most
2434 specialized. However, we, also have:
2438 Partial ordering of overloaded function template
2439 declarations is used in the following contexts to select
2440 the function template to which a function template
2441 specialization refers:
2443 -- when an explicit specialization refers to a function
2446 So, we do use the partial ordering rules, at least for now.
2447 This extension can only serve to make invalid programs valid,
2448 so it's safe. And, there is strong anecdotal evidence that
2449 the committee intended the partial ordering rules to apply;
2450 the EDG front end has that behavior, and John Spicer claims
2451 that the committee simply forgot to delete the wording in
2452 [temp.expl.spec]. */
2453 tree tmpl
= most_specialized_instantiation (templates
);
2454 if (tmpl
!= error_mark_node
)
2457 TREE_CHAIN (templates
) = NULL_TREE
;
2461 // Concepts allows multiple declarations of member functions
2462 // with the same signature. Like above, we need to rely on
2463 // on the partial ordering of those candidates to determine which
2465 if (flag_concepts
&& candidates
&& TREE_CHAIN (candidates
))
2467 if (tree cand
= most_constrained_function (candidates
))
2470 TREE_CHAIN (cand
) = NULL_TREE
;
2474 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
2476 error ("template-id %qD for %q+D does not match any template "
2477 "declaration", template_id
, decl
);
2478 if (header_count
&& header_count
!= template_count
+ 1)
2479 inform (DECL_SOURCE_LOCATION (decl
),
2480 "saw %d %<template<>%>, need %d for "
2481 "specializing a member function template",
2482 header_count
, template_count
+ 1);
2484 print_candidates (orig_fns
);
2485 return error_mark_node
;
2487 else if ((templates
&& TREE_CHAIN (templates
))
2488 || (candidates
&& TREE_CHAIN (candidates
))
2489 || (templates
&& candidates
))
2491 error ("ambiguous template specialization %qD for %q+D",
2493 candidates
= chainon (candidates
, templates
);
2494 print_candidates (candidates
);
2495 return error_mark_node
;
2498 /* We have one, and exactly one, match. */
2501 tree fn
= TREE_VALUE (candidates
);
2502 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
2504 /* Propagate the candidate's constraints to the declaration. */
2505 if (tsk
!= tsk_template
)
2506 set_constraints (decl
, get_constraints (fn
));
2508 /* DECL is a re-declaration or partial instantiation of a template
2510 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2512 /* It was a specialization of an ordinary member function in a
2514 return DECL_TI_TEMPLATE (fn
);
2517 /* It was a specialization of a template. */
2518 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
2519 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
2521 *targs_out
= copy_node (targs
);
2522 SET_TMPL_ARGS_LEVEL (*targs_out
,
2523 TMPL_ARGS_DEPTH (*targs_out
),
2524 TREE_PURPOSE (templates
));
2527 *targs_out
= TREE_PURPOSE (templates
);
2528 return TREE_VALUE (templates
);
2531 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2532 but with the default argument values filled in from those in the
2536 copy_default_args_to_explicit_spec_1 (tree spec_types
,
2539 tree new_spec_types
;
2544 if (spec_types
== void_list_node
)
2545 return void_list_node
;
2547 /* Substitute into the rest of the list. */
2549 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
2550 TREE_CHAIN (tmpl_types
));
2552 /* Add the default argument for this parameter. */
2553 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
2554 TREE_VALUE (spec_types
),
2558 /* DECL is an explicit specialization. Replicate default arguments
2559 from the template it specializes. (That way, code like:
2561 template <class T> void f(T = 3);
2562 template <> void f(double);
2565 works, as required.) An alternative approach would be to look up
2566 the correct default arguments at the call-site, but this approach
2567 is consistent with how implicit instantiations are handled. */
2570 copy_default_args_to_explicit_spec (tree decl
)
2575 tree new_spec_types
;
2579 tree object_type
= NULL_TREE
;
2580 tree in_charge
= NULL_TREE
;
2581 tree vtt
= NULL_TREE
;
2583 /* See if there's anything we need to do. */
2584 tmpl
= DECL_TI_TEMPLATE (decl
);
2585 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
2586 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
2587 if (TREE_PURPOSE (t
))
2592 old_type
= TREE_TYPE (decl
);
2593 spec_types
= TYPE_ARG_TYPES (old_type
);
2595 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2597 /* Remove the this pointer, but remember the object's type for
2599 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
2600 spec_types
= TREE_CHAIN (spec_types
);
2601 tmpl_types
= TREE_CHAIN (tmpl_types
);
2603 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
2605 /* DECL may contain more parameters than TMPL due to the extra
2606 in-charge parameter in constructors and destructors. */
2607 in_charge
= spec_types
;
2608 spec_types
= TREE_CHAIN (spec_types
);
2610 if (DECL_HAS_VTT_PARM_P (decl
))
2613 spec_types
= TREE_CHAIN (spec_types
);
2617 /* Compute the merged default arguments. */
2619 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
2621 /* Compute the new FUNCTION_TYPE. */
2625 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
2630 /* Put the in-charge parameter back. */
2631 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
2632 TREE_VALUE (in_charge
),
2635 new_type
= build_method_type_directly (object_type
,
2636 TREE_TYPE (old_type
),
2640 new_type
= build_function_type (TREE_TYPE (old_type
),
2642 new_type
= cp_build_type_attribute_variant (new_type
,
2643 TYPE_ATTRIBUTES (old_type
));
2644 new_type
= cxx_copy_lang_qualifiers (new_type
, old_type
);
2646 TREE_TYPE (decl
) = new_type
;
2649 /* Return the number of template headers we expect to see for a definition
2650 or specialization of CTYPE or one of its non-template members. */
2653 num_template_headers_for_class (tree ctype
)
2655 int num_templates
= 0;
2657 while (ctype
&& CLASS_TYPE_P (ctype
))
2659 /* You're supposed to have one `template <...>' for every
2660 template class, but you don't need one for a full
2661 specialization. For example:
2663 template <class T> struct S{};
2664 template <> struct S<int> { void f(); };
2665 void S<int>::f () {}
2667 is correct; there shouldn't be a `template <>' for the
2668 definition of `S<int>::f'. */
2669 if (!CLASSTYPE_TEMPLATE_INFO (ctype
))
2670 /* If CTYPE does not have template information of any
2671 kind, then it is not a template, nor is it nested
2672 within a template. */
2674 if (explicit_class_specialization_p (ctype
))
2676 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (ctype
)))
2679 ctype
= TYPE_CONTEXT (ctype
);
2682 return num_templates
;
2685 /* Do a simple sanity check on the template headers that precede the
2686 variable declaration DECL. */
2689 check_template_variable (tree decl
)
2691 tree ctx
= CP_DECL_CONTEXT (decl
);
2692 int wanted
= num_template_headers_for_class (ctx
);
2693 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
2694 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
2696 if (cxx_dialect
< cxx14
)
2697 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2698 "variable templates only available with "
2699 "%<-std=c++14%> or %<-std=gnu++14%>");
2701 // Namespace-scope variable templates should have a template header.
2704 if (template_header_count
> wanted
)
2706 auto_diagnostic_group d
;
2707 bool warned
= pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2708 "too many template headers for %qD "
2711 if (warned
&& CLASS_TYPE_P (ctx
)
2712 && CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2713 inform (DECL_SOURCE_LOCATION (decl
),
2714 "members of an explicitly specialized class are defined "
2715 "without a template header");
2719 /* An explicit specialization whose declarator-id or class-head-name is not
2720 qualified shall be declared in the nearest enclosing namespace of the
2721 template, or, if the namespace is inline (7.3.1), any namespace from its
2722 enclosing namespace set.
2724 If the name declared in the explicit instantiation is an unqualified name,
2725 the explicit instantiation shall appear in the namespace where its template
2726 is declared or, if that namespace is inline (7.3.1), any namespace from its
2727 enclosing namespace set. */
2730 check_unqualified_spec_or_inst (tree t
, location_t loc
)
2732 tree tmpl
= most_general_template (t
);
2733 if (DECL_NAMESPACE_SCOPE_P (tmpl
)
2734 && !is_nested_namespace (current_namespace
,
2735 CP_DECL_CONTEXT (tmpl
), true))
2737 if (processing_specialization
)
2738 permerror (loc
, "explicit specialization of %qD outside its "
2739 "namespace must use a nested-name-specifier", tmpl
);
2740 else if (processing_explicit_instantiation
2741 && cxx_dialect
>= cxx11
)
2742 /* This was allowed in C++98, so only pedwarn. */
2743 pedwarn (loc
, OPT_Wpedantic
, "explicit instantiation of %qD "
2744 "outside its namespace must use a nested-name-"
2749 /* Warn for a template specialization SPEC that is missing some of a set
2750 of function or type attributes that the template TEMPL is declared with.
2751 ATTRLIST is a list of additional attributes that SPEC should be taken
2752 to ultimately be declared with. */
2755 warn_spec_missing_attributes (tree tmpl
, tree spec
, tree attrlist
)
2757 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
2758 tmpl
= DECL_TEMPLATE_RESULT (tmpl
);
2760 /* Avoid warning if the difference between the primary and
2761 the specialization is not in one of the attributes below. */
2762 const char* const blacklist
[] = {
2763 "alloc_align", "alloc_size", "assume_aligned", "format",
2764 "format_arg", "malloc", "nonnull", NULL
2767 /* Put together a list of the black listed attributes that the primary
2768 template is declared with that the specialization is not, in case
2769 it's not apparent from the most recent declaration of the primary. */
2771 unsigned nattrs
= decls_mismatched_attributes (tmpl
, spec
, attrlist
,
2777 auto_diagnostic_group d
;
2778 if (warning_at (DECL_SOURCE_LOCATION (spec
), OPT_Wmissing_attributes
,
2779 "explicit specialization %q#D may be missing attributes",
2781 inform (DECL_SOURCE_LOCATION (tmpl
),
2783 ? G_("missing primary template attributes %s")
2784 : G_("missing primary template attribute %s"),
2785 pp_formatted_text (&str
));
2788 /* Check to see if the function just declared, as indicated in
2789 DECLARATOR, and in DECL, is a specialization of a function
2790 template. We may also discover that the declaration is an explicit
2791 instantiation at this point.
2793 Returns DECL, or an equivalent declaration that should be used
2794 instead if all goes well. Issues an error message if something is
2795 amiss. Returns error_mark_node if the error is not easily
2798 FLAGS is a bitmask consisting of the following flags:
2800 2: The function has a definition.
2801 4: The function is a friend.
2803 The TEMPLATE_COUNT is the number of references to qualifying
2804 template classes that appeared in the name of the function. For
2807 template <class T> struct S { void f(); };
2810 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2811 classes are not counted in the TEMPLATE_COUNT, so that in
2813 template <class T> struct S {};
2814 template <> struct S<int> { void f(); }
2815 template <> void S<int>::f();
2817 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2818 invalid; there should be no template <>.)
2820 If the function is a specialization, it is marked as such via
2821 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2822 is set up correctly, and it is added to the list of specializations
2823 for that template. */
2826 check_explicit_specialization (tree declarator
,
2832 int have_def
= flags
& 2;
2833 int is_friend
= flags
& 4;
2834 bool is_concept
= flags
& 8;
2835 int specialization
= 0;
2836 int explicit_instantiation
= 0;
2837 int member_specialization
= 0;
2838 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2839 tree dname
= DECL_NAME (decl
);
2844 if (!processing_specialization
)
2847 tsk
= tsk_excessive_parms
;
2850 tsk
= current_tmpl_spec_kind (template_count
);
2855 if (processing_specialization
&& !VAR_P (decl
))
2858 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2860 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2863 /* This could be something like:
2865 template <class T> void f(T);
2866 class S { friend void f<>(int); } */
2870 /* This case handles bogus declarations like template <>
2871 template <class T> void f<int>(); */
2873 error_at (cp_expr_loc_or_input_loc (declarator
),
2874 "template-id %qE in declaration of primary template",
2881 case tsk_invalid_member_spec
:
2882 /* The error has already been reported in
2883 check_specialization_scope. */
2884 return error_mark_node
;
2886 case tsk_invalid_expl_inst
:
2887 error ("template parameter list used in explicit instantiation");
2893 error ("definition provided for explicit instantiation");
2895 explicit_instantiation
= 1;
2898 case tsk_excessive_parms
:
2899 case tsk_insufficient_parms
:
2900 if (tsk
== tsk_excessive_parms
)
2901 error ("too many template parameter lists in declaration of %qD",
2903 else if (template_header_count
)
2904 error("too few template parameter lists in declaration of %qD", decl
);
2906 error("explicit specialization of %qD must be introduced by "
2907 "%<template <>%>", decl
);
2912 error ("explicit specialization declared %<concept%>");
2914 if (VAR_P (decl
) && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2915 /* In cases like template<> constexpr bool v = true;
2916 We'll give an error in check_template_variable. */
2919 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2921 member_specialization
= 1;
2927 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2929 /* This case handles bogus declarations like template <>
2930 template <class T> void f<int>(); */
2932 if (!uses_template_parms (TREE_OPERAND (declarator
, 1)))
2933 error_at (cp_expr_loc_or_input_loc (declarator
),
2934 "template-id %qE in declaration of primary template",
2936 else if (variable_template_p (TREE_OPERAND (declarator
, 0)))
2938 /* Partial specialization of variable template. */
2939 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2943 else if (cxx_dialect
< cxx14
)
2944 error_at (cp_expr_loc_or_input_loc (declarator
),
2945 "non-type partial specialization %qE "
2946 "is not allowed", declarator
);
2948 error_at (cp_expr_loc_or_input_loc (declarator
),
2949 "non-class, non-variable partial specialization %qE "
2950 "is not allowed", declarator
);
2955 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2956 /* This is a specialization of a member template, without
2957 specialization the containing class. Something like:
2959 template <class T> struct S {
2960 template <class U> void f (U);
2962 template <> template <class U> void S<int>::f(U) {}
2964 That's a specialization -- but of the entire template. */
2972 if ((specialization
|| member_specialization
)
2973 /* This doesn't apply to variable templates. */
2974 && FUNC_OR_METHOD_TYPE_P (TREE_TYPE (decl
)))
2976 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2977 for (; t
; t
= TREE_CHAIN (t
))
2978 if (TREE_PURPOSE (t
))
2980 permerror (input_location
,
2981 "default argument specified in explicit specialization");
2986 if (specialization
|| member_specialization
|| explicit_instantiation
)
2988 tree tmpl
= NULL_TREE
;
2989 tree targs
= NULL_TREE
;
2990 bool was_template_id
= (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
);
2992 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2993 if (!was_template_id
)
2997 gcc_assert (identifier_p (declarator
));
3002 /* If there is no class context, the explicit instantiation
3003 must be at namespace scope. */
3004 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
3006 /* Find the namespace binding, using the declaration
3008 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
3009 LOOK_want::NORMAL
, true);
3010 if (fns
== error_mark_node
)
3011 /* If lookup fails, look for a friend declaration so we can
3012 give a better diagnostic. */
3013 fns
= (lookup_qualified_name
3014 (CP_DECL_CONTEXT (decl
), dname
,
3015 LOOK_want::NORMAL
| LOOK_want::HIDDEN_FRIEND
,
3018 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
3020 error ("%qD is not a template function", dname
);
3021 fns
= error_mark_node
;
3025 declarator
= lookup_template_function (fns
, NULL_TREE
);
3028 if (declarator
== error_mark_node
)
3029 return error_mark_node
;
3031 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
3033 if (!explicit_instantiation
)
3034 /* A specialization in class scope. This is invalid,
3035 but the error will already have been flagged by
3036 check_specialization_scope. */
3037 return error_mark_node
;
3040 /* It's not valid to write an explicit instantiation in
3043 class C { template void f(); }
3045 This case is caught by the parser. However, on
3048 template class C { void f(); };
3050 (which is invalid) we can get here. The error will be
3057 else if (ctype
!= NULL_TREE
3058 && (identifier_p (TREE_OPERAND (declarator
, 0))))
3060 // We'll match variable templates in start_decl.
3064 /* Find the list of functions in ctype that have the same
3065 name as the declared function. */
3066 tree name
= TREE_OPERAND (declarator
, 0);
3068 if (constructor_name_p (name
, ctype
))
3070 if (DECL_CONSTRUCTOR_P (decl
)
3071 ? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
3072 : !CLASSTYPE_DESTRUCTOR (ctype
))
3074 /* From [temp.expl.spec]:
3076 If such an explicit specialization for the member
3077 of a class template names an implicitly-declared
3078 special member function (clause _special_), the
3079 program is ill-formed.
3081 Similar language is found in [temp.explicit]. */
3082 error ("specialization of implicitly-declared special member function");
3083 return error_mark_node
;
3086 name
= DECL_NAME (decl
);
3089 /* For a type-conversion operator, We might be looking for
3090 `operator int' which will be a specialization of
3091 `operator T'. Grab all the conversion operators, and
3092 then select from them. */
3093 tree fns
= get_class_binding (ctype
, IDENTIFIER_CONV_OP_P (name
)
3094 ? conv_op_identifier
: name
);
3096 if (fns
== NULL_TREE
)
3098 error ("no member function %qD declared in %qT", name
, ctype
);
3099 return error_mark_node
;
3102 TREE_OPERAND (declarator
, 0) = fns
;
3105 /* Figure out what exactly is being specialized at this point.
3106 Note that for an explicit instantiation, even one for a
3107 member function, we cannot tell a priori whether the
3108 instantiation is for a member template, or just a member
3109 function of a template class. Even if a member template is
3110 being instantiated, the member template arguments may be
3111 elided if they can be deduced from the rest of the
3113 tmpl
= determine_specialization (declarator
, decl
,
3115 member_specialization
,
3119 if (!tmpl
|| tmpl
== error_mark_node
)
3120 /* We couldn't figure out what this declaration was
3122 return error_mark_node
;
3125 if (TREE_CODE (decl
) == FUNCTION_DECL
3126 && DECL_HIDDEN_FRIEND_P (tmpl
))
3128 auto_diagnostic_group d
;
3129 if (pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
3130 "friend declaration %qD is not visible to "
3131 "explicit specialization", tmpl
))
3132 inform (DECL_SOURCE_LOCATION (tmpl
),
3133 "friend declaration here");
3135 else if (!ctype
&& !is_friend
3136 && CP_DECL_CONTEXT (decl
) == current_namespace
)
3137 check_unqualified_spec_or_inst (tmpl
, DECL_SOURCE_LOCATION (decl
));
3139 tree gen_tmpl
= most_general_template (tmpl
);
3141 if (explicit_instantiation
)
3143 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
3144 is done by do_decl_instantiation later. */
3146 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
3147 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
3149 if (arg_depth
> parm_depth
)
3151 /* If TMPL is not the most general template (for
3152 example, if TMPL is a friend template that is
3153 injected into namespace scope), then there will
3154 be too many levels of TARGS. Remove some of them
3159 new_targs
= make_tree_vec (parm_depth
);
3160 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
3161 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
3162 = TREE_VEC_ELT (targs
, i
);
3166 return instantiate_template (tmpl
, targs
, tf_error
);
3169 /* If we thought that the DECL was a member function, but it
3170 turns out to be specializing a static member function,
3171 make DECL a static member function as well. */
3172 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
3173 && DECL_STATIC_FUNCTION_P (tmpl
)
3174 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
3175 revert_static_member_fn (decl
);
3177 /* If this is a specialization of a member template of a
3178 template class, we want to return the TEMPLATE_DECL, not
3179 the specialization of it. */
3180 if (tsk
== tsk_template
&& !was_template_id
)
3182 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
3183 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
3184 DECL_INITIAL (result
) = NULL_TREE
;
3188 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
3189 DECL_SOURCE_LOCATION (result
)
3190 = DECL_SOURCE_LOCATION (decl
);
3191 /* We want to use the argument list specified in the
3192 definition, not in the original declaration. */
3193 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
3194 for (parm
= DECL_ARGUMENTS (result
); parm
;
3195 parm
= DECL_CHAIN (parm
))
3196 DECL_CONTEXT (parm
) = result
;
3198 return register_specialization (tmpl
, gen_tmpl
, targs
,
3202 /* Set up the DECL_TEMPLATE_INFO for DECL. */
3203 DECL_TEMPLATE_INFO (decl
) = build_template_info (tmpl
, targs
);
3205 if (was_template_id
)
3206 TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
)) = true;
3208 /* Inherit default function arguments from the template
3209 DECL is specializing. */
3210 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
3211 copy_default_args_to_explicit_spec (decl
);
3213 /* This specialization has the same protection as the
3214 template it specializes. */
3215 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
3216 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
3218 /* 7.1.1-1 [dcl.stc]
3220 A storage-class-specifier shall not be specified in an
3221 explicit specialization...
3223 The parser rejects these, so unless action is taken here,
3224 explicit function specializations will always appear with
3227 The action recommended by the C++ CWG in response to C++
3228 defect report 605 is to make the storage class and linkage
3229 of the explicit specialization match the templated function:
3231 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
3233 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
3235 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
3236 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
3238 /* A concept cannot be specialized. */
3239 if (DECL_DECLARED_CONCEPT_P (tmpl_func
))
3241 error ("explicit specialization of function concept %qD",
3243 return error_mark_node
;
3246 /* This specialization has the same linkage and visibility as
3247 the function template it specializes. */
3248 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
3249 if (! TREE_PUBLIC (decl
))
3251 DECL_INTERFACE_KNOWN (decl
) = 1;
3252 DECL_NOT_REALLY_EXTERN (decl
) = 1;
3254 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
3255 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
3257 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
3258 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
3262 /* If DECL is a friend declaration, declared using an
3263 unqualified name, the namespace associated with DECL may
3264 have been set incorrectly. For example, in:
3266 template <typename T> void f(T);
3268 struct S { friend void f<int>(int); }
3271 we will have set the DECL_CONTEXT for the friend
3272 declaration to N, rather than to the global namespace. */
3273 if (DECL_NAMESPACE_SCOPE_P (decl
))
3274 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
3276 if (is_friend
&& !have_def
)
3277 /* This is not really a declaration of a specialization.
3278 It's just the name of an instantiation. But, it's not
3279 a request for an instantiation, either. */
3280 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
3281 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
3282 /* A specialization is not necessarily COMDAT. */
3283 DECL_COMDAT (decl
) = (TREE_PUBLIC (decl
)
3284 && DECL_DECLARED_INLINE_P (decl
));
3285 else if (VAR_P (decl
))
3286 DECL_COMDAT (decl
) = false;
3288 /* If this is a full specialization, register it so that we can find
3289 it again. Partial specializations will be registered in
3290 process_partial_specialization. */
3291 if (!processing_template_decl
)
3293 warn_spec_missing_attributes (gen_tmpl
, decl
, attrlist
);
3295 decl
= register_specialization (decl
, gen_tmpl
, targs
,
3300 /* A 'structor should already have clones. */
3301 gcc_assert (decl
== error_mark_node
3302 || variable_template_p (tmpl
)
3303 || !(DECL_CONSTRUCTOR_P (decl
)
3304 || DECL_DESTRUCTOR_P (decl
))
3305 || DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)));
3312 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
3313 parameters. These are represented in the same format used for
3314 DECL_TEMPLATE_PARMS. */
3317 comp_template_parms (const_tree parms1
, const_tree parms2
)
3322 if (parms1
== parms2
)
3325 for (p1
= parms1
, p2
= parms2
;
3326 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
3327 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
3329 tree t1
= TREE_VALUE (p1
);
3330 tree t2
= TREE_VALUE (p2
);
3333 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
3334 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
3336 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
3339 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
3341 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
3342 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
3344 /* If either of the template parameters are invalid, assume
3345 they match for the sake of error recovery. */
3346 if (error_operand_p (parm1
) || error_operand_p (parm2
))
3349 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
3352 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
3353 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
3354 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
3356 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
3361 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
3362 /* One set of parameters has more parameters lists than the
3369 /* Returns true if two template parameters are declared with
3370 equivalent constraints. */
3373 template_parameter_constraints_equivalent_p (const_tree parm1
, const_tree parm2
)
3375 tree req1
= TREE_TYPE (parm1
);
3376 tree req2
= TREE_TYPE (parm2
);
3380 return cp_tree_equal (req1
, req2
);
3384 /* Returns true when two template parameters are equivalent. */
3387 template_parameters_equivalent_p (const_tree parm1
, const_tree parm2
)
3389 tree decl1
= TREE_VALUE (parm1
);
3390 tree decl2
= TREE_VALUE (parm2
);
3392 /* If either of the template parameters are invalid, assume
3393 they match for the sake of error recovery. */
3394 if (error_operand_p (decl1
) || error_operand_p (decl2
))
3397 /* ... they declare parameters of the same kind. */
3398 if (TREE_CODE (decl1
) != TREE_CODE (decl2
))
3401 /* ... one parameter was introduced by a parameter declaration, then
3402 both are. This case arises as a result of eagerly rewriting declarations
3404 if (DECL_VIRTUAL_P (decl1
) != DECL_VIRTUAL_P (decl2
))
3407 /* ... if either declares a pack, they both do. */
3408 if (template_parameter_pack_p (decl1
) != template_parameter_pack_p (decl2
))
3411 if (TREE_CODE (decl1
) == PARM_DECL
)
3413 /* ... if they declare non-type parameters, the types are equivalent. */
3414 if (!same_type_p (TREE_TYPE (decl1
), TREE_TYPE (decl2
)))
3417 else if (TREE_CODE (decl2
) == TEMPLATE_DECL
)
3419 /* ... if they declare template template parameters, their template
3420 parameter lists are equivalent. */
3421 if (!template_heads_equivalent_p (decl1
, decl2
))
3425 /* ... if they are declared with a qualified-concept name, they both
3426 are, and those names are equivalent. */
3427 return template_parameter_constraints_equivalent_p (parm1
, parm2
);
3430 /* Returns true if two template parameters lists are equivalent.
3431 Two template parameter lists are equivalent if they have the
3432 same length and their corresponding parameters are equivalent.
3434 PARMS1 and PARMS2 are TREE_LISTs containing TREE_VECs: the
3435 data structure returned by DECL_TEMPLATE_PARMS.
3437 This is generally the same implementation as comp_template_parms
3438 except that it also the concept names and arguments used to
3439 introduce parameters. */
3442 template_parameter_lists_equivalent_p (const_tree parms1
, const_tree parms2
)
3444 if (parms1
== parms2
)
3447 const_tree p1
= parms1
;
3448 const_tree p2
= parms2
;
3449 while (p1
!= NULL_TREE
&& p2
!= NULL_TREE
)
3451 tree list1
= TREE_VALUE (p1
);
3452 tree list2
= TREE_VALUE (p2
);
3454 if (TREE_VEC_LENGTH (list1
) != TREE_VEC_LENGTH (list2
))
3457 for (int i
= 0; i
< TREE_VEC_LENGTH (list2
); ++i
)
3459 tree parm1
= TREE_VEC_ELT (list1
, i
);
3460 tree parm2
= TREE_VEC_ELT (list2
, i
);
3461 if (!template_parameters_equivalent_p (parm1
, parm2
))
3465 p1
= TREE_CHAIN (p1
);
3466 p2
= TREE_CHAIN (p2
);
3469 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
3475 /* Return true if the requires-clause of the template parameter lists are
3476 equivalent and false otherwise. */
3478 template_requirements_equivalent_p (const_tree parms1
, const_tree parms2
)
3480 tree req1
= TEMPLATE_PARMS_CONSTRAINTS (parms1
);
3481 tree req2
= TEMPLATE_PARMS_CONSTRAINTS (parms2
);
3482 if ((req1
!= NULL_TREE
) != (req2
!= NULL_TREE
))
3484 if (!cp_tree_equal (req1
, req2
))
3489 /* Returns true if two template heads are equivalent. 17.6.6.1p6:
3490 Two template heads are equivalent if their template parameter
3491 lists are equivalent and their requires clauses are equivalent.
3493 In pre-C++20, this is equivalent to calling comp_template_parms
3494 for the template parameters of TMPL1 and TMPL2. */
3497 template_heads_equivalent_p (const_tree tmpl1
, const_tree tmpl2
)
3499 tree parms1
= DECL_TEMPLATE_PARMS (tmpl1
);
3500 tree parms2
= DECL_TEMPLATE_PARMS (tmpl2
);
3502 /* Don't change the matching rules for pre-C++20. */
3503 if (cxx_dialect
< cxx20
)
3504 return comp_template_parms (parms1
, parms2
);
3506 /* ... have the same number of template parameters, and their
3507 corresponding parameters are equivalent. */
3508 if (!template_parameter_lists_equivalent_p (parms1
, parms2
))
3511 /* ... if either has a requires-clause, they both do and their
3512 corresponding constraint-expressions are equivalent. */
3513 return template_requirements_equivalent_p (parms1
, parms2
);
3516 /* Determine whether PARM is a parameter pack. */
3519 template_parameter_pack_p (const_tree parm
)
3521 /* Determine if we have a non-type template parameter pack. */
3522 if (TREE_CODE (parm
) == PARM_DECL
)
3523 return (DECL_TEMPLATE_PARM_P (parm
)
3524 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
3525 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
3526 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
3528 /* If this is a list of template parameters, we could get a
3529 TYPE_DECL or a TEMPLATE_DECL. */
3530 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
3531 parm
= TREE_TYPE (parm
);
3533 /* Otherwise it must be a type template parameter. */
3534 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
3535 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
3536 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
3539 /* Determine if T is a function parameter pack. */
3542 function_parameter_pack_p (const_tree t
)
3544 if (t
&& TREE_CODE (t
) == PARM_DECL
)
3545 return DECL_PACK_P (t
);
3549 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
3550 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
3553 get_function_template_decl (const_tree primary_func_tmpl_inst
)
3555 if (! primary_func_tmpl_inst
3556 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
3557 || ! primary_template_specialization_p (primary_func_tmpl_inst
))
3560 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
3563 /* Return true iff the function parameter PARAM_DECL was expanded
3564 from the function parameter pack PACK. */
3567 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
3569 if (DECL_ARTIFICIAL (param_decl
)
3570 || !function_parameter_pack_p (pack
))
3573 /* The parameter pack and its pack arguments have the same
3575 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
3578 /* Determine whether ARGS describes a variadic template args list,
3579 i.e., one that is terminated by a template argument pack. */
3582 template_args_variadic_p (tree args
)
3587 if (args
== NULL_TREE
)
3590 args
= INNERMOST_TEMPLATE_ARGS (args
);
3591 nargs
= TREE_VEC_LENGTH (args
);
3596 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
3598 return ARGUMENT_PACK_P (last_parm
);
3601 /* Generate a new name for the parameter pack name NAME (an
3602 IDENTIFIER_NODE) that incorporates its */
3605 make_ith_pack_parameter_name (tree name
, int i
)
3607 /* Munge the name to include the parameter index. */
3608 #define NUMBUF_LEN 128
3609 char numbuf
[NUMBUF_LEN
];
3613 if (name
== NULL_TREE
)
3615 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
3616 newname_len
= IDENTIFIER_LENGTH (name
)
3617 + strlen (numbuf
) + 2;
3618 newname
= (char*)alloca (newname_len
);
3619 snprintf (newname
, newname_len
,
3620 "%s#%i", IDENTIFIER_POINTER (name
), i
);
3621 return get_identifier (newname
);
3624 /* Return true if T is a primary function, class or alias template
3625 specialization, not including the template pattern. */
3628 primary_template_specialization_p (const_tree t
)
3633 if (TREE_CODE (t
) == FUNCTION_DECL
|| VAR_P (t
))
3634 return (DECL_LANG_SPECIFIC (t
)
3635 && DECL_USE_TEMPLATE (t
)
3636 && DECL_TEMPLATE_INFO (t
)
3637 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
)));
3638 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
3639 return (CLASSTYPE_TEMPLATE_INFO (t
)
3640 && CLASSTYPE_USE_TEMPLATE (t
)
3641 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
)));
3642 else if (alias_template_specialization_p (t
, nt_transparent
))
3647 /* Return true if PARM is a template template parameter. */
3650 template_template_parameter_p (const_tree parm
)
3652 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
3655 /* Return true iff PARM is a DECL representing a type template
3659 template_type_parameter_p (const_tree parm
)
3662 && (TREE_CODE (parm
) == TYPE_DECL
3663 || TREE_CODE (parm
) == TEMPLATE_DECL
)
3664 && DECL_TEMPLATE_PARM_P (parm
));
3667 /* Return the template parameters of T if T is a
3668 primary template instantiation, NULL otherwise. */
3671 get_primary_template_innermost_parameters (const_tree t
)
3673 tree parms
= NULL
, template_info
= NULL
;
3675 if ((template_info
= get_template_info (t
))
3676 && primary_template_specialization_p (t
))
3677 parms
= INNERMOST_TEMPLATE_PARMS
3678 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
3683 /* Return the template parameters of the LEVELth level from the full list
3684 of template parameters PARMS. */
3687 get_template_parms_at_level (tree parms
, int level
)
3691 || TREE_CODE (parms
) != TREE_LIST
3692 || level
> TMPL_PARMS_DEPTH (parms
))
3695 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
3696 if (TMPL_PARMS_DEPTH (p
) == level
)
3702 /* Returns the template arguments of T if T is a template instantiation,
3706 get_template_innermost_arguments (const_tree t
)
3708 tree args
= NULL
, template_info
= NULL
;
3710 if ((template_info
= get_template_info (t
))
3711 && TI_ARGS (template_info
))
3712 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
3717 /* Return the argument pack elements of T if T is a template argument pack,
3721 get_template_argument_pack_elems (const_tree t
)
3723 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
3724 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
3727 return ARGUMENT_PACK_ARGS (t
);
3730 /* In an ARGUMENT_PACK_SELECT, the actual underlying argument that the
3731 ARGUMENT_PACK_SELECT represents. */
3734 argument_pack_select_arg (tree t
)
3736 tree args
= ARGUMENT_PACK_ARGS (ARGUMENT_PACK_SELECT_FROM_PACK (t
));
3737 tree arg
= TREE_VEC_ELT (args
, ARGUMENT_PACK_SELECT_INDEX (t
));
3739 /* If the selected argument is an expansion E, that most likely means we were
3740 called from gen_elem_of_pack_expansion_instantiation during the
3741 substituting of an argument pack (of which the Ith element is a pack
3742 expansion, where I is ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
3743 In this case, the Ith element resulting from this substituting is going to
3744 be a pack expansion, which pattern is the pattern of E. Let's return the
3745 pattern of E, and gen_elem_of_pack_expansion_instantiation will build the
3746 resulting pack expansion from it. */
3747 if (PACK_EXPANSION_P (arg
))
3749 /* Make sure we aren't throwing away arg info. */
3750 gcc_assert (!PACK_EXPANSION_EXTRA_ARGS (arg
));
3751 arg
= PACK_EXPANSION_PATTERN (arg
);
3758 /* True iff FN is a function representing a built-in variadic parameter
3762 builtin_pack_fn_p (tree fn
)
3765 || TREE_CODE (fn
) != FUNCTION_DECL
3766 || !DECL_IS_BUILTIN (fn
))
3769 if (id_equal (DECL_NAME (fn
), "__integer_pack"))
3775 /* True iff CALL is a call to a function representing a built-in variadic
3779 builtin_pack_call_p (tree call
)
3781 if (TREE_CODE (call
) != CALL_EXPR
)
3783 return builtin_pack_fn_p (CALL_EXPR_FN (call
));
3786 /* Return a TREE_VEC for the expansion of __integer_pack(HI). */
3789 expand_integer_pack (tree call
, tree args
, tsubst_flags_t complain
,
3792 tree ohi
= CALL_EXPR_ARG (call
, 0);
3793 tree hi
= tsubst_copy_and_build (ohi
, args
, complain
, in_decl
,
3794 false/*fn*/, true/*int_cst*/);
3796 if (value_dependent_expression_p (hi
))
3800 call
= copy_node (call
);
3801 CALL_EXPR_ARG (call
, 0) = hi
;
3803 tree ex
= make_pack_expansion (call
, complain
);
3804 tree vec
= make_tree_vec (1);
3805 TREE_VEC_ELT (vec
, 0) = ex
;
3810 hi
= cxx_constant_value (hi
);
3811 int len
= valid_constant_size_p (hi
) ? tree_to_shwi (hi
) : -1;
3813 /* Calculate the largest value of len that won't make the size of the vec
3814 overflow an int. The compiler will exceed resource limits long before
3815 this, but it seems a decent place to diagnose. */
3816 int max
= ((INT_MAX
- sizeof (tree_vec
)) / sizeof (tree
)) + 1;
3818 if (len
< 0 || len
> max
)
3820 if ((complain
& tf_error
)
3821 && hi
!= error_mark_node
)
3822 error ("argument to %<__integer_pack%> must be between 0 and %d",
3824 return error_mark_node
;
3827 tree vec
= make_tree_vec (len
);
3829 for (int i
= 0; i
< len
; ++i
)
3830 TREE_VEC_ELT (vec
, i
) = size_int (i
);
3836 /* Return a TREE_VEC for the expansion of built-in template parameter pack
3840 expand_builtin_pack_call (tree call
, tree args
, tsubst_flags_t complain
,
3843 if (!builtin_pack_call_p (call
))
3846 tree fn
= CALL_EXPR_FN (call
);
3848 if (id_equal (DECL_NAME (fn
), "__integer_pack"))
3849 return expand_integer_pack (call
, args
, complain
, in_decl
);
3854 /* Structure used to track the progress of find_parameter_packs_r. */
3855 struct find_parameter_pack_data
3857 /* TREE_LIST that will contain all of the parameter packs found by
3859 tree
* parameter_packs
;
3861 /* Set of AST nodes that have been visited by the traversal. */
3862 hash_set
<tree
> *visited
;
3864 /* True iff we're making a type pack expansion. */
3865 bool type_pack_expansion_p
;
3868 /* Identifies all of the argument packs that occur in a template
3869 argument and appends them to the TREE_LIST inside DATA, which is a
3870 find_parameter_pack_data structure. This is a subroutine of
3871 make_pack_expansion and uses_parameter_packs. */
3873 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3876 struct find_parameter_pack_data
* ppd
=
3877 (struct find_parameter_pack_data
*)data
;
3878 bool parameter_pack_p
= false;
3880 /* Don't look through typedefs; we are interested in whether a
3881 parameter pack is actually written in the expression/type we're
3882 looking at, not the target type. */
3883 if (TYPE_P (t
) && typedef_variant_p (t
))
3885 /* But do look at arguments for an alias template. */
3886 if (tree tinfo
= TYPE_ALIAS_TEMPLATE_INFO (t
))
3887 cp_walk_tree (&TI_ARGS (tinfo
),
3888 &find_parameter_packs_r
,
3894 /* Identify whether this is a parameter pack or not. */
3895 switch (TREE_CODE (t
))
3897 case TEMPLATE_PARM_INDEX
:
3898 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3899 parameter_pack_p
= true;
3902 case TEMPLATE_TYPE_PARM
:
3903 t
= TYPE_MAIN_VARIANT (t
);
3905 case TEMPLATE_TEMPLATE_PARM
:
3906 /* If the placeholder appears in the decl-specifier-seq of a function
3907 parameter pack (14.6.3), or the type-specifier-seq of a type-id that
3908 is a pack expansion, the invented template parameter is a template
3910 if (ppd
->type_pack_expansion_p
&& is_auto (t
))
3911 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
3912 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3913 parameter_pack_p
= true;
3918 if (DECL_PACK_P (t
))
3920 /* We don't want to walk into the type of a PARM_DECL,
3921 because we don't want to see the type parameter pack. */
3923 parameter_pack_p
= true;
3928 if (DECL_PACK_P (t
))
3930 /* We don't want to walk into the type of a variadic capture proxy,
3931 because we don't want to see the type parameter pack. */
3933 parameter_pack_p
= true;
3935 else if (variable_template_specialization_p (t
))
3937 cp_walk_tree (&DECL_TI_ARGS (t
),
3938 find_parameter_packs_r
,
3945 if (builtin_pack_call_p (t
))
3946 parameter_pack_p
= true;
3950 parameter_pack_p
= true;
3953 /* Not a parameter pack. */
3957 if (parameter_pack_p
)
3959 /* Add this parameter pack to the list. */
3960 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3964 cp_walk_tree (&TYPE_CONTEXT (t
),
3965 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3967 /* This switch statement will return immediately if we don't find a
3968 parameter pack. ??? Should some of these be in cp_walk_subtrees? */
3969 switch (TREE_CODE (t
))
3971 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3972 /* Check the template itself. */
3973 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3974 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3979 tree decl
= DECL_EXPR_DECL (t
);
3980 /* Ignore the declaration of a capture proxy for a parameter pack. */
3981 if (is_capture_proxy (decl
))
3983 if (is_typedef_decl (decl
))
3984 /* Since we stop at typedefs above, we need to look through them at
3985 the point of the DECL_EXPR. */
3986 cp_walk_tree (&DECL_ORIGINAL_TYPE (decl
),
3987 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3992 if (!DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
3994 cp_walk_tree (&TREE_TYPE (t
),
3995 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3998 case TYPE_PACK_EXPANSION
:
3999 case EXPR_PACK_EXPANSION
:
4004 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
4009 case IDENTIFIER_NODE
:
4010 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
4017 /* Since we defer implicit capture, look in the parms and body. */
4018 tree fn
= lambda_function (t
);
4019 cp_walk_tree (&TREE_TYPE (fn
), &find_parameter_packs_r
, ppd
,
4021 cp_walk_tree (&DECL_SAVED_TREE (fn
), &find_parameter_packs_r
, ppd
,
4028 /* When traversing a DECLTYPE_TYPE_EXPR, we need to set
4029 type_pack_expansion_p to false so that any placeholders
4030 within the expression don't get marked as parameter packs. */
4031 bool type_pack_expansion_p
= ppd
->type_pack_expansion_p
;
4032 ppd
->type_pack_expansion_p
= false;
4033 cp_walk_tree (&DECLTYPE_TYPE_EXPR (t
), &find_parameter_packs_r
,
4035 ppd
->type_pack_expansion_p
= type_pack_expansion_p
;
4041 cp_walk_tree (&IF_COND (t
), &find_parameter_packs_r
,
4043 cp_walk_tree (&THEN_CLAUSE (t
), &find_parameter_packs_r
,
4045 cp_walk_tree (&ELSE_CLAUSE (t
), &find_parameter_packs_r
,
4047 /* Don't walk into IF_STMT_EXTRA_ARGS. */
4058 /* Determines if the expression or type T uses any parameter packs. */
4060 uses_parameter_packs (tree t
)
4062 tree parameter_packs
= NULL_TREE
;
4063 struct find_parameter_pack_data ppd
;
4064 ppd
.parameter_packs
= ¶meter_packs
;
4065 ppd
.visited
= new hash_set
<tree
>;
4066 ppd
.type_pack_expansion_p
= false;
4067 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
4069 return parameter_packs
;
4072 /* Turn ARG, which may be an expression, type, or a TREE_LIST
4073 representation a base-class initializer into a parameter pack
4074 expansion. If all goes well, the resulting node will be an
4075 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
4078 make_pack_expansion (tree arg
, tsubst_flags_t complain
)
4081 tree parameter_packs
= NULL_TREE
;
4082 bool for_types
= false;
4083 struct find_parameter_pack_data ppd
;
4085 if (!arg
|| arg
== error_mark_node
)
4088 if (TREE_CODE (arg
) == TREE_LIST
&& TREE_PURPOSE (arg
))
4090 /* A TREE_LIST with a non-null TREE_PURPOSE is for a base
4091 class initializer. In this case, the TREE_PURPOSE will be a
4092 _TYPE node (representing the base class expansion we're
4093 initializing) and the TREE_VALUE will be a TREE_LIST
4094 containing the initialization arguments.
4096 The resulting expansion looks somewhat different from most
4097 expansions. Rather than returning just one _EXPANSION, we
4098 return a TREE_LIST whose TREE_PURPOSE is a
4099 TYPE_PACK_EXPANSION containing the bases that will be
4100 initialized. The TREE_VALUE will be identical to the
4101 original TREE_VALUE, which is a list of arguments that will
4102 be passed to each base. We do not introduce any new pack
4103 expansion nodes into the TREE_VALUE (although it is possible
4104 that some already exist), because the TREE_PURPOSE and
4105 TREE_VALUE all need to be expanded together with the same
4106 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
4107 resulting TREE_PURPOSE will mention the parameter packs in
4108 both the bases and the arguments to the bases. */
4111 tree parameter_packs
= NULL_TREE
;
4113 /* Determine which parameter packs will be used by the base
4115 ppd
.visited
= new hash_set
<tree
>;
4116 ppd
.parameter_packs
= ¶meter_packs
;
4117 ppd
.type_pack_expansion_p
= false;
4118 gcc_assert (TYPE_P (TREE_PURPOSE (arg
)));
4119 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
4122 if (parameter_packs
== NULL_TREE
)
4124 if (complain
& tf_error
)
4125 error ("base initializer expansion %qT contains no parameter packs",
4128 return error_mark_node
;
4131 if (TREE_VALUE (arg
) != void_type_node
)
4133 /* Collect the sets of parameter packs used in each of the
4134 initialization arguments. */
4135 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
4137 /* Determine which parameter packs will be expanded in this
4139 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
4146 /* Create the pack expansion type for the base type. */
4147 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
4148 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
4149 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
4150 PACK_EXPANSION_LOCAL_P (purpose
) = at_function_scope_p ();
4152 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
4153 they will rarely be compared to anything. */
4154 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
4156 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
4159 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
4162 /* Build the PACK_EXPANSION_* node. */
4164 ? cxx_make_type (TYPE_PACK_EXPANSION
)
4165 : make_node (EXPR_PACK_EXPANSION
);
4166 SET_PACK_EXPANSION_PATTERN (result
, arg
);
4167 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
4169 /* Propagate type and const-expression information. */
4170 TREE_TYPE (result
) = TREE_TYPE (arg
);
4171 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
4172 /* Mark this read now, since the expansion might be length 0. */
4173 mark_exp_read (arg
);
4176 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
4177 they will rarely be compared to anything. */
4178 SET_TYPE_STRUCTURAL_EQUALITY (result
);
4180 /* Determine which parameter packs will be expanded. */
4181 ppd
.parameter_packs
= ¶meter_packs
;
4182 ppd
.visited
= new hash_set
<tree
>;
4183 ppd
.type_pack_expansion_p
= TYPE_P (arg
);
4184 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
4187 /* Make sure we found some parameter packs. */
4188 if (parameter_packs
== NULL_TREE
)
4190 if (complain
& tf_error
)
4193 error ("expansion pattern %qT contains no parameter packs", arg
);
4195 error ("expansion pattern %qE contains no parameter packs", arg
);
4197 return error_mark_node
;
4199 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
4201 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
4206 /* Checks T for any "bare" parameter packs, which have not yet been
4207 expanded, and issues an error if any are found. This operation can
4208 only be done on full expressions or types (e.g., an expression
4209 statement, "if" condition, etc.), because we could have expressions like:
4211 foo(f(g(h(args)))...)
4213 where "args" is a parameter pack. check_for_bare_parameter_packs
4214 should not be called for the subexpressions args, h(args),
4215 g(h(args)), or f(g(h(args))), because we would produce erroneous
4218 Returns TRUE and emits an error if there were bare parameter packs,
4219 returns FALSE otherwise. */
4221 check_for_bare_parameter_packs (tree t
, location_t loc
/* = UNKNOWN_LOCATION */)
4223 tree parameter_packs
= NULL_TREE
;
4224 struct find_parameter_pack_data ppd
;
4226 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
4229 /* A lambda might use a parameter pack from the containing context. */
4230 if (current_class_type
&& LAMBDA_TYPE_P (current_class_type
)
4231 && CLASSTYPE_TEMPLATE_INFO (current_class_type
))
4234 if (TREE_CODE (t
) == TYPE_DECL
)
4237 ppd
.parameter_packs
= ¶meter_packs
;
4238 ppd
.visited
= new hash_set
<tree
>;
4239 ppd
.type_pack_expansion_p
= false;
4240 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
4243 if (parameter_packs
)
4245 if (loc
== UNKNOWN_LOCATION
)
4246 loc
= cp_expr_loc_or_input_loc (t
);
4247 error_at (loc
, "parameter packs not expanded with %<...%>:");
4248 while (parameter_packs
)
4250 tree pack
= TREE_VALUE (parameter_packs
);
4251 tree name
= NULL_TREE
;
4253 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
4254 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
4255 name
= TYPE_NAME (pack
);
4256 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
4257 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
4258 else if (TREE_CODE (pack
) == CALL_EXPR
)
4259 name
= DECL_NAME (CALL_EXPR_FN (pack
));
4261 name
= DECL_NAME (pack
);
4264 inform (loc
, " %qD", name
);
4266 inform (loc
, " %s", "<anonymous>");
4268 parameter_packs
= TREE_CHAIN (parameter_packs
);
4277 /* Expand any parameter packs that occur in the template arguments in
4280 expand_template_argument_pack (tree args
)
4282 if (args
== error_mark_node
)
4283 return error_mark_node
;
4285 tree result_args
= NULL_TREE
;
4286 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
4287 int num_result_args
= -1;
4288 int non_default_args_count
= -1;
4290 /* First, determine if we need to expand anything, and the number of
4291 slots we'll need. */
4292 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
4294 tree arg
= TREE_VEC_ELT (args
, in_arg
);
4295 if (arg
== NULL_TREE
)
4297 if (ARGUMENT_PACK_P (arg
))
4299 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
4300 if (num_result_args
< 0)
4301 num_result_args
= in_arg
+ num_packed
;
4303 num_result_args
+= num_packed
;
4307 if (num_result_args
>= 0)
4312 /* If no expansion is necessary, we're done. */
4313 if (num_result_args
< 0)
4316 /* Expand arguments. */
4317 result_args
= make_tree_vec (num_result_args
);
4318 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
4319 non_default_args_count
=
4320 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
4321 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
4323 tree arg
= TREE_VEC_ELT (args
, in_arg
);
4324 if (ARGUMENT_PACK_P (arg
))
4326 tree packed
= ARGUMENT_PACK_ARGS (arg
);
4327 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
4328 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
4329 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
4330 if (non_default_args_count
> 0)
4331 non_default_args_count
+= num_packed
- 1;
4335 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
4339 if (non_default_args_count
>= 0)
4340 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
4344 /* Checks if DECL shadows a template parameter.
4346 [temp.local]: A template-parameter shall not be redeclared within its
4347 scope (including nested scopes).
4349 Emits an error and returns TRUE if the DECL shadows a parameter,
4350 returns FALSE otherwise. */
4353 check_template_shadow (tree decl
)
4357 /* If we're not in a template, we can't possibly shadow a template
4359 if (!current_template_parms
)
4362 /* Figure out what we're shadowing. */
4363 decl
= OVL_FIRST (decl
);
4364 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
4366 /* If there's no previous binding for this name, we're not shadowing
4367 anything, let alone a template parameter. */
4371 /* If we're not shadowing a template parameter, we're done. Note
4372 that OLDDECL might be an OVERLOAD (or perhaps even an
4373 ERROR_MARK), so we can't just blithely assume it to be a _DECL
4375 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
4378 /* We check for decl != olddecl to avoid bogus errors for using a
4379 name inside a class. We check TPFI to avoid duplicate errors for
4380 inline member templates. */
4382 || (DECL_TEMPLATE_PARM_P (decl
)
4383 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
)))
4386 /* Don't complain about the injected class name, as we've already
4387 complained about the class itself. */
4388 if (DECL_SELF_REFERENCE_P (decl
))
4391 if (DECL_TEMPLATE_PARM_P (decl
))
4392 error ("declaration of template parameter %q+D shadows "
4393 "template parameter", decl
);
4395 error ("declaration of %q+#D shadows template parameter", decl
);
4396 inform (DECL_SOURCE_LOCATION (olddecl
),
4397 "template parameter %qD declared here", olddecl
);
4401 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
4402 ORIG_LEVEL, DECL, and TYPE. */
4405 build_template_parm_index (int index
,
4411 tree t
= make_node (TEMPLATE_PARM_INDEX
);
4412 TEMPLATE_PARM_IDX (t
) = index
;
4413 TEMPLATE_PARM_LEVEL (t
) = level
;
4414 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
4415 TEMPLATE_PARM_DECL (t
) = decl
;
4416 TREE_TYPE (t
) = type
;
4417 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
4418 TREE_READONLY (t
) = TREE_READONLY (decl
);
4423 /* Find the canonical type parameter for the given template type
4424 parameter. Returns the canonical type parameter, which may be TYPE
4425 if no such parameter existed. */
4428 canonical_type_parameter (tree type
)
4430 int idx
= TEMPLATE_TYPE_IDX (type
);
4432 gcc_assert (TREE_CODE (type
) != TEMPLATE_TEMPLATE_PARM
);
4434 if (vec_safe_length (canonical_template_parms
) <= (unsigned) idx
)
4435 vec_safe_grow_cleared (canonical_template_parms
, idx
+ 1, true);
4437 for (tree list
= (*canonical_template_parms
)[idx
];
4438 list
; list
= TREE_CHAIN (list
))
4439 if (comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
4440 return TREE_VALUE (list
);
4442 (*canonical_template_parms
)[idx
]
4443 = tree_cons (NULL_TREE
, type
, (*canonical_template_parms
)[idx
]);
4447 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
4448 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
4449 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
4450 new one is created. */
4453 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
4454 tsubst_flags_t complain
)
4456 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
4457 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
4458 != TEMPLATE_PARM_LEVEL (index
) - levels
)
4459 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
4461 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
4463 tree decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
4464 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
),
4466 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
4467 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
4468 DECL_VIRTUAL_P (decl
) = DECL_VIRTUAL_P (orig_decl
);
4469 DECL_ARTIFICIAL (decl
) = 1;
4470 SET_DECL_TEMPLATE_PARM_P (decl
);
4472 tree tpi
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
4473 TEMPLATE_PARM_LEVEL (index
) - levels
,
4474 TEMPLATE_PARM_ORIG_LEVEL (index
),
4476 TEMPLATE_PARM_DESCENDANTS (index
) = tpi
;
4477 TEMPLATE_PARM_PARAMETER_PACK (tpi
)
4478 = TEMPLATE_PARM_PARAMETER_PACK (index
);
4480 /* Template template parameters need this. */
4482 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4484 inner
= build_decl (DECL_SOURCE_LOCATION (decl
),
4485 TYPE_DECL
, DECL_NAME (decl
), type
);
4486 DECL_TEMPLATE_RESULT (decl
) = inner
;
4487 DECL_ARTIFICIAL (inner
) = true;
4488 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
4489 (DECL_TEMPLATE_PARMS (orig_decl
), args
, complain
);
4492 /* Attach the TPI to the decl. */
4493 if (TREE_CODE (inner
) == TYPE_DECL
)
4494 TEMPLATE_TYPE_PARM_INDEX (type
) = tpi
;
4496 DECL_INITIAL (decl
) = tpi
;
4499 return TEMPLATE_PARM_DESCENDANTS (index
);
4502 /* Process information from new template parameter PARM and append it
4503 to the LIST being built. This new parameter is a non-type
4504 parameter iff IS_NON_TYPE is true. This new parameter is a
4505 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
4509 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
4510 bool is_non_type
, bool is_parameter_pack
)
4512 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
4513 tree prev
= NULL_TREE
;
4518 prev
= tree_last (list
);
4520 tree p
= TREE_VALUE (prev
);
4521 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
4522 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
4523 else if (TREE_CODE (p
) == PARM_DECL
)
4524 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
4529 tree decl
= NULL_TREE
;
4530 tree defval
= TREE_PURPOSE (parm
);
4531 tree constr
= TREE_TYPE (parm
);
4535 parm
= TREE_VALUE (parm
);
4537 SET_DECL_TEMPLATE_PARM_P (parm
);
4539 if (TREE_TYPE (parm
) != error_mark_node
)
4543 The top-level cv-qualifiers on the template-parameter are
4544 ignored when determining its type. */
4545 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
4546 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
4547 TREE_TYPE (parm
) = error_mark_node
;
4548 else if (uses_parameter_packs (TREE_TYPE (parm
))
4549 && !is_parameter_pack
4550 /* If we're in a nested template parameter list, the template
4551 template parameter could be a parameter pack. */
4552 && processing_template_parmlist
== 1)
4554 /* This template parameter is not a parameter pack, but it
4555 should be. Complain about "bare" parameter packs. */
4556 check_for_bare_parameter_packs (TREE_TYPE (parm
));
4558 /* Recover by calling this a parameter pack. */
4559 is_parameter_pack
= true;
4563 /* A template parameter is not modifiable. */
4564 TREE_CONSTANT (parm
) = 1;
4565 TREE_READONLY (parm
) = 1;
4566 decl
= build_decl (parm_loc
,
4567 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
4568 TREE_CONSTANT (decl
) = 1;
4569 TREE_READONLY (decl
) = 1;
4570 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
4571 = build_template_parm_index (idx
, processing_template_decl
,
4572 processing_template_decl
,
4573 decl
, TREE_TYPE (parm
));
4575 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
4576 = is_parameter_pack
;
4581 parm
= TREE_VALUE (TREE_VALUE (parm
));
4583 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
4585 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
4586 /* This is for distinguishing between real templates and template
4587 template parameters */
4588 TREE_TYPE (parm
) = t
;
4590 /* any_template_parm_r expects to be able to get the targs of a
4591 DECL_TEMPLATE_RESULT. */
4592 tree result
= DECL_TEMPLATE_RESULT (parm
);
4593 TREE_TYPE (result
) = t
;
4594 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (parm
));
4595 tree tinfo
= build_template_info (parm
, args
);
4596 retrofit_lang_decl (result
);
4597 DECL_TEMPLATE_INFO (result
) = tinfo
;
4603 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
4604 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
4605 decl
= build_decl (parm_loc
,
4606 TYPE_DECL
, parm
, t
);
4609 TYPE_NAME (t
) = decl
;
4610 TYPE_STUB_DECL (t
) = decl
;
4612 TEMPLATE_TYPE_PARM_INDEX (t
)
4613 = build_template_parm_index (idx
, processing_template_decl
,
4614 processing_template_decl
,
4615 decl
, TREE_TYPE (parm
));
4616 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
4617 if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
4618 SET_TYPE_STRUCTURAL_EQUALITY (t
);
4620 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
4622 DECL_ARTIFICIAL (decl
) = 1;
4623 SET_DECL_TEMPLATE_PARM_P (decl
);
4625 /* Build requirements for the type/template parameter.
4626 This must be done after SET_DECL_TEMPLATE_PARM_P or
4627 process_template_parm could fail. */
4628 tree reqs
= finish_shorthand_constraint (parm
, constr
);
4630 decl
= pushdecl (decl
);
4634 /* Build the parameter node linking the parameter declaration,
4635 its default argument (if any), and its constraints (if any). */
4636 parm
= build_tree_list (defval
, parm
);
4637 TEMPLATE_PARM_CONSTRAINTS (parm
) = reqs
;
4640 TREE_CHAIN (prev
) = parm
;
4647 /* The end of a template parameter list has been reached. Process the
4648 tree list into a parameter vector, converting each parameter into a more
4649 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
4653 end_template_parm_list (tree parms
)
4655 tree saved_parmlist
= make_tree_vec (list_length (parms
));
4657 /* Pop the dummy parameter level and add the real one. We do not
4658 morph the dummy parameter in place, as it might have been
4659 captured by a (nested) template-template-parm. */
4660 current_template_parms
= TREE_CHAIN (current_template_parms
);
4662 current_template_parms
4663 = tree_cons (size_int (processing_template_decl
),
4664 saved_parmlist
, current_template_parms
);
4666 for (unsigned ix
= 0; parms
; ix
++)
4669 parms
= TREE_CHAIN (parms
);
4670 TREE_CHAIN (parm
) = NULL_TREE
;
4672 TREE_VEC_ELT (saved_parmlist
, ix
) = parm
;
4675 --processing_template_parmlist
;
4677 return saved_parmlist
;
4680 // Explicitly indicate the end of the template parameter list. We assume
4681 // that the current template parameters have been constructed and/or
4682 // managed explicitly, as when creating new template template parameters
4683 // from a shorthand constraint.
4685 end_template_parm_list ()
4687 --processing_template_parmlist
;
4690 /* end_template_decl is called after a template declaration is seen. */
4693 end_template_decl (void)
4695 reset_specialization ();
4697 if (! processing_template_decl
)
4700 /* This matches the pushlevel in begin_template_parm_list. */
4703 --processing_template_decl
;
4704 current_template_parms
= TREE_CHAIN (current_template_parms
);
4707 /* Takes a TREE_LIST representing a template parameter and convert it
4708 into an argument suitable to be passed to the type substitution
4709 functions. Note that If the TREE_LIST contains an error_mark
4710 node, the returned argument is error_mark_node. */
4713 template_parm_to_arg (tree t
)
4717 || TREE_CODE (t
) != TREE_LIST
)
4720 if (error_operand_p (TREE_VALUE (t
)))
4721 return error_mark_node
;
4725 if (TREE_CODE (t
) == TYPE_DECL
4726 || TREE_CODE (t
) == TEMPLATE_DECL
)
4730 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
4732 /* Turn this argument into a TYPE_ARGUMENT_PACK
4733 with a single element, which expands T. */
4734 tree vec
= make_tree_vec (1);
4736 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
4738 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4740 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
4741 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4746 t
= DECL_INITIAL (t
);
4748 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
4750 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
4751 with a single element, which expands T. */
4752 tree vec
= make_tree_vec (1);
4754 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
4756 t
= convert_from_reference (t
);
4757 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4759 t
= make_node (NONTYPE_ARGUMENT_PACK
);
4760 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4763 t
= convert_from_reference (t
);
4768 /* Given a single level of template parameters (a TREE_VEC), return it
4769 as a set of template arguments. */
4772 template_parms_level_to_args (tree parms
)
4774 tree a
= copy_node (parms
);
4775 TREE_TYPE (a
) = NULL_TREE
;
4776 for (int i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
4777 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
4780 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
4785 /* Given a set of template parameters, return them as a set of template
4786 arguments. The template parameters are represented as a TREE_VEC, in
4787 the form documented in cp-tree.h for template arguments. */
4790 template_parms_to_args (tree parms
)
4793 tree args
= NULL_TREE
;
4794 int length
= TMPL_PARMS_DEPTH (parms
);
4797 /* If there is only one level of template parameters, we do not
4798 create a TREE_VEC of TREE_VECs. Instead, we return a single
4799 TREE_VEC containing the arguments. */
4801 args
= make_tree_vec (length
);
4803 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
4805 tree a
= template_parms_level_to_args (TREE_VALUE (header
));
4808 TREE_VEC_ELT (args
, --l
) = a
;
4816 /* Within the declaration of a template, return the currently active
4817 template parameters as an argument TREE_VEC. */
4820 current_template_args (void)
4822 return template_parms_to_args (current_template_parms
);
4825 /* Return the fully generic arguments for of TMPL, i.e. what
4826 current_template_args would be while parsing it. */
4829 generic_targs_for (tree tmpl
)
4831 if (tmpl
== NULL_TREE
)
4833 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
4834 || DECL_TEMPLATE_SPECIALIZATION (tmpl
))
4835 /* DECL_TEMPLATE_RESULT doesn't have the arguments we want. For a template
4836 template parameter, it has no TEMPLATE_INFO; for a partial
4837 specialization, it has the arguments for the primary template, and we
4838 want the arguments for the partial specialization. */;
4839 else if (tree result
= DECL_TEMPLATE_RESULT (tmpl
))
4840 if (tree ti
= get_template_info (result
))
4841 return TI_ARGS (ti
);
4842 return template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
));
4845 /* Update the declared TYPE by doing any lookups which were thought to be
4846 dependent, but are not now that we know the SCOPE of the declarator. */
4849 maybe_update_decl_type (tree orig_type
, tree scope
)
4851 tree type
= orig_type
;
4853 if (type
== NULL_TREE
)
4856 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4857 type
= TREE_TYPE (type
);
4859 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
4860 && dependent_type_p (type
)
4861 /* Don't bother building up the args in this case. */
4862 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
4864 /* tsubst in the args corresponding to the template parameters,
4865 including auto if present. Most things will be unchanged, but
4866 make_typename_type and tsubst_qualified_id will resolve
4867 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
4868 tree args
= current_template_args ();
4869 tree auto_node
= type_uses_auto (type
);
4873 tree auto_vec
= make_tree_vec (1);
4874 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
4875 args
= add_to_template_args (args
, auto_vec
);
4877 pushed
= push_scope (scope
);
4878 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
4883 if (type
== error_mark_node
)
4886 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4888 if (same_type_p (type
, TREE_TYPE (orig_type
)))
4891 type
= TYPE_NAME (type
);
4896 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4897 template PARMS and constraints, CONSTR. If MEMBER_TEMPLATE_P is true,
4898 the new template is a member template. */
4901 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
4903 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
4904 SET_DECL_LANGUAGE (tmpl
, DECL_LANGUAGE (decl
));
4905 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
4906 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4907 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
4908 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
4909 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
4910 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
4915 struct template_parm_data
4917 /* The level of the template parameters we are currently
4921 /* The index of the specialization argument we are currently
4925 /* An array whose size is the number of template parameters. The
4926 elements are nonzero if the parameter has been used in any one
4927 of the arguments processed so far. */
4930 /* An array whose size is the number of template arguments. The
4931 elements are nonzero if the argument makes use of template
4932 parameters of this level. */
4933 int* arg_uses_template_parms
;
4936 /* Subroutine of push_template_decl used to see if each template
4937 parameter in a partial specialization is used in the explicit
4938 argument list. If T is of the LEVEL given in DATA (which is
4939 treated as a template_parm_data*), then DATA->PARMS is marked
4943 mark_template_parm (tree t
, void* data
)
4947 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4949 template_parm_level_and_index (t
, &level
, &idx
);
4951 if (level
== tpd
->level
)
4953 tpd
->parms
[idx
] = 1;
4954 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4957 /* In C++17 the type of a non-type argument is a deduced context. */
4958 if (cxx_dialect
>= cxx17
4959 && TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
4960 for_each_template_parm (TREE_TYPE (t
),
4961 &mark_template_parm
,
4964 /*include_nondeduced_p=*/false);
4966 /* Return zero so that for_each_template_parm will continue the
4967 traversal of the tree; we want to mark *every* template parm. */
4971 /* Process the partial specialization DECL. */
4974 process_partial_specialization (tree decl
)
4976 tree type
= TREE_TYPE (decl
);
4977 tree tinfo
= get_template_info (decl
);
4978 tree maintmpl
= TI_TEMPLATE (tinfo
);
4979 tree specargs
= TI_ARGS (tinfo
);
4980 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4981 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4984 int nargs
= TREE_VEC_LENGTH (inner_args
);
4987 bool did_error_intro
= false;
4988 struct template_parm_data tpd
;
4989 struct template_parm_data tpd2
;
4991 gcc_assert (current_template_parms
);
4993 /* A concept cannot be specialized. */
4994 if (flag_concepts
&& variable_concept_p (maintmpl
))
4996 error ("specialization of variable concept %q#D", maintmpl
);
4997 return error_mark_node
;
5000 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
5001 ntparms
= TREE_VEC_LENGTH (inner_parms
);
5003 /* We check that each of the template parameters given in the
5004 partial specialization is used in the argument list to the
5005 specialization. For example:
5007 template <class T> struct S;
5008 template <class T> struct S<T*>;
5010 The second declaration is OK because `T*' uses the template
5011 parameter T, whereas
5013 template <class T> struct S<int>;
5015 is no good. Even trickier is:
5026 The S2<T> declaration is actually invalid; it is a
5027 full-specialization. Of course,
5030 struct S2<T (*)(U)>;
5032 or some such would have been OK. */
5033 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
5034 tpd
.parms
= XALLOCAVEC (int, ntparms
);
5035 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
5037 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
5038 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
5039 for (i
= 0; i
< nargs
; ++i
)
5041 tpd
.current_arg
= i
;
5042 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
5043 &mark_template_parm
,
5046 /*include_nondeduced_p=*/false);
5048 for (i
= 0; i
< ntparms
; ++i
)
5049 if (tpd
.parms
[i
] == 0)
5051 /* One of the template parms was not used in a deduced context in the
5053 if (!did_error_intro
)
5055 error ("template parameters not deducible in "
5056 "partial specialization:");
5057 did_error_intro
= true;
5060 inform (input_location
, " %qD",
5061 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
5064 if (did_error_intro
)
5065 return error_mark_node
;
5067 /* [temp.class.spec]
5069 The argument list of the specialization shall not be identical to
5070 the implicit argument list of the primary template. */
5072 = TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (maintmpl
)));
5073 if (comp_template_args (inner_args
, INNERMOST_TEMPLATE_ARGS (main_args
))
5075 || !strictly_subsumes (current_template_constraints (),
5076 main_args
, maintmpl
)))
5079 error ("partial specialization %q+D does not specialize "
5080 "any template arguments; to define the primary template, "
5081 "remove the template argument list", decl
);
5083 error ("partial specialization %q+D does not specialize any "
5084 "template arguments and is not more constrained than "
5085 "the primary template; to define the primary template, "
5086 "remove the template argument list", decl
);
5087 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
5090 /* A partial specialization that replaces multiple parameters of the
5091 primary template with a pack expansion is less specialized for those
5093 if (nargs
< DECL_NTPARMS (maintmpl
))
5095 error ("partial specialization is not more specialized than the "
5096 "primary template because it replaces multiple parameters "
5097 "with a pack expansion");
5098 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
5099 /* Avoid crash in process_partial_specialization. */
5103 else if (nargs
> DECL_NTPARMS (maintmpl
))
5105 error ("too many arguments for partial specialization %qT", type
);
5106 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
5107 /* Avoid crash below. */
5111 /* If we aren't in a dependent class, we can actually try deduction. */
5112 else if (tpd
.level
== 1
5113 /* FIXME we should be able to handle a partial specialization of a
5114 partial instantiation, but currently we can't (c++/41727). */
5115 && TMPL_ARGS_DEPTH (specargs
) == 1
5116 && !get_partial_spec_bindings (maintmpl
, maintmpl
, specargs
))
5118 auto_diagnostic_group d
;
5119 if (permerror (input_location
, "partial specialization %qD is not "
5120 "more specialized than", decl
))
5121 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template %qD",
5125 /* [temp.class.spec]
5127 A partially specialized non-type argument expression shall not
5128 involve template parameters of the partial specialization except
5129 when the argument expression is a simple identifier.
5131 The type of a template parameter corresponding to a specialized
5132 non-type argument shall not be dependent on a parameter of the
5135 Also, we verify that pack expansions only occur at the
5136 end of the argument list. */
5138 for (i
= 0; i
< nargs
; ++i
)
5140 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
5141 tree arg
= TREE_VEC_ELT (inner_args
, i
);
5142 tree packed_args
= NULL_TREE
;
5145 if (ARGUMENT_PACK_P (arg
))
5147 /* Extract the arguments from the argument pack. We'll be
5148 iterating over these in the following loop. */
5149 packed_args
= ARGUMENT_PACK_ARGS (arg
);
5150 len
= TREE_VEC_LENGTH (packed_args
);
5153 for (j
= 0; j
< len
; j
++)
5156 /* Get the Jth argument in the parameter pack. */
5157 arg
= TREE_VEC_ELT (packed_args
, j
);
5159 if (PACK_EXPANSION_P (arg
))
5161 /* Pack expansions must come at the end of the
5163 if ((packed_args
&& j
< len
- 1)
5164 || (!packed_args
&& i
< nargs
- 1))
5166 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
5167 error ("parameter pack argument %qE must be at the "
5168 "end of the template argument list", arg
);
5170 error ("parameter pack argument %qT must be at the "
5171 "end of the template argument list", arg
);
5175 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
5176 /* We only care about the pattern. */
5177 arg
= PACK_EXPANSION_PATTERN (arg
);
5179 if (/* These first two lines are the `non-type' bit. */
5181 && TREE_CODE (arg
) != TEMPLATE_DECL
5182 /* This next two lines are the `argument expression is not just a
5183 simple identifier' condition and also the `specialized
5184 non-type argument' bit. */
5185 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
5186 && !((REFERENCE_REF_P (arg
)
5187 || TREE_CODE (arg
) == VIEW_CONVERT_EXPR
)
5188 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_PARM_INDEX
))
5190 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
5191 || (packed_args
&& uses_template_parms (arg
)))
5192 error_at (cp_expr_loc_or_input_loc (arg
),
5193 "template argument %qE involves template "
5194 "parameter(s)", arg
);
5197 /* Look at the corresponding template parameter,
5198 marking which template parameters its type depends
5200 tree type
= TREE_TYPE (parm
);
5204 /* We haven't yet initialized TPD2. Do so now. */
5205 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
5206 /* The number of parameters here is the number in the
5207 main template, which, as checked in the assertion
5209 tpd2
.parms
= XALLOCAVEC (int, nargs
);
5211 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
5214 /* Mark the template parameters. But this time, we're
5215 looking for the template parameters of the main
5216 template, not in the specialization. */
5217 tpd2
.current_arg
= i
;
5218 tpd2
.arg_uses_template_parms
[i
] = 0;
5219 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
5220 for_each_template_parm (type
,
5221 &mark_template_parm
,
5224 /*include_nondeduced_p=*/false);
5226 if (tpd2
.arg_uses_template_parms
[i
])
5228 /* The type depended on some template parameters.
5229 If they are fully specialized in the
5230 specialization, that's OK. */
5233 for (j
= 0; j
< nargs
; ++j
)
5234 if (tpd2
.parms
[j
] != 0
5235 && tpd
.arg_uses_template_parms
[j
])
5238 error_n (input_location
, count
,
5239 "type %qT of template argument %qE depends "
5240 "on a template parameter",
5241 "type %qT of template argument %qE depends "
5242 "on template parameters",
5251 /* We should only get here once. */
5252 if (TREE_CODE (decl
) == TYPE_DECL
)
5253 gcc_assert (!COMPLETE_TYPE_P (type
));
5255 // Build the template decl.
5256 tree tmpl
= build_template_decl (decl
, current_template_parms
,
5257 DECL_MEMBER_TEMPLATE_P (maintmpl
));
5258 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
5259 DECL_TEMPLATE_INFO (tmpl
) = build_template_info (maintmpl
, specargs
);
5260 DECL_PRIMARY_TEMPLATE (tmpl
) = maintmpl
;
5262 /* Give template template parms a DECL_CONTEXT of the template
5263 for which they are a parameter. */
5264 for (i
= 0; i
< ntparms
; ++i
)
5266 tree parm
= TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
));
5267 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5268 DECL_CONTEXT (parm
) = tmpl
;
5272 /* We didn't register this in check_explicit_specialization so we could
5273 wait until the constraints were set. */
5274 decl
= register_specialization (decl
, maintmpl
, specargs
, false, 0);
5276 associate_classtype_constraints (type
);
5278 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
5279 = tree_cons (specargs
, tmpl
,
5280 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
5281 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
5283 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
5284 inst
= TREE_CHAIN (inst
))
5286 tree instance
= TREE_VALUE (inst
);
5287 if (TYPE_P (instance
)
5288 ? (COMPLETE_TYPE_P (instance
)
5289 && CLASSTYPE_IMPLICIT_INSTANTIATION (instance
))
5290 : DECL_TEMPLATE_INSTANTIATION (instance
))
5292 tree spec
= most_specialized_partial_spec (instance
, tf_none
);
5293 tree inst_decl
= (DECL_P (instance
)
5294 ? instance
: TYPE_NAME (instance
));
5297 else if (spec
== error_mark_node
)
5298 permerror (input_location
,
5299 "declaration of %qD ambiguates earlier template "
5300 "instantiation for %qD", decl
, inst_decl
);
5301 else if (TREE_VALUE (spec
) == tmpl
)
5302 permerror (input_location
,
5303 "partial specialization of %qD after instantiation "
5304 "of %qD", decl
, inst_decl
);
5311 /* PARM is a template parameter of some form; return the corresponding
5312 TEMPLATE_PARM_INDEX. */
5315 get_template_parm_index (tree parm
)
5317 if (TREE_CODE (parm
) == PARM_DECL
5318 || TREE_CODE (parm
) == CONST_DECL
)
5319 parm
= DECL_INITIAL (parm
);
5320 else if (TREE_CODE (parm
) == TYPE_DECL
5321 || TREE_CODE (parm
) == TEMPLATE_DECL
)
5322 parm
= TREE_TYPE (parm
);
5323 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
5324 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
5325 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
5326 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
5327 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
5331 /* Subroutine of fixed_parameter_pack_p below. Look for any template
5332 parameter packs used by the template parameter PARM. */
5335 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
5337 /* A type parm can't refer to another parm. */
5338 if (TREE_CODE (parm
) == TYPE_DECL
|| parm
== error_mark_node
)
5340 else if (TREE_CODE (parm
) == PARM_DECL
)
5342 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
5347 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
5349 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
5350 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
5352 tree p
= TREE_VALUE (TREE_VEC_ELT (vec
, i
));
5353 if (template_parameter_pack_p (p
))
5354 /* Any packs in the type are expanded by this parameter. */;
5356 fixed_parameter_pack_p_1 (p
, ppd
);
5360 /* PARM is a template parameter pack. Return any parameter packs used in
5361 its type or the type of any of its template parameters. If there are
5362 any such packs, it will be instantiated into a fixed template parameter
5363 list by partial instantiation rather than be fully deduced. */
5366 fixed_parameter_pack_p (tree parm
)
5368 /* This can only be true in a member template. */
5369 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
5371 /* This can only be true for a parameter pack. */
5372 if (!template_parameter_pack_p (parm
))
5374 /* A type parm can't refer to another parm. */
5375 if (TREE_CODE (parm
) == TYPE_DECL
)
5378 tree parameter_packs
= NULL_TREE
;
5379 struct find_parameter_pack_data ppd
;
5380 ppd
.parameter_packs
= ¶meter_packs
;
5381 ppd
.visited
= new hash_set
<tree
>;
5382 ppd
.type_pack_expansion_p
= false;
5384 fixed_parameter_pack_p_1 (parm
, &ppd
);
5387 return parameter_packs
;
5390 /* Check that a template declaration's use of default arguments and
5391 parameter packs is not invalid. Here, PARMS are the template
5392 parameters. IS_PRIMARY is true if DECL is the thing declared by
5393 a primary template. IS_PARTIAL is true if DECL is a partial
5396 IS_FRIEND_DECL is nonzero if DECL is either a non-defining friend
5397 function template declaration or a friend class template
5398 declaration. In the function case, 1 indicates a declaration, 2
5399 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
5400 emitted for extraneous default arguments.
5402 Returns TRUE if there were no errors found, FALSE otherwise. */
5405 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
5406 bool is_partial
, int is_friend_decl
)
5409 int last_level_to_check
;
5411 bool no_errors
= true;
5415 A default template-argument shall not be specified in a
5416 function template declaration or a function template definition, nor
5417 in the template-parameter-list of the definition of a member of a
5420 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
5421 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_LOCAL_DECL_P (decl
)))
5422 /* You can't have a function template declaration in a local
5423 scope, nor you can you define a member of a class template in a
5427 if ((TREE_CODE (decl
) == TYPE_DECL
5429 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5430 || (TREE_CODE (decl
) == FUNCTION_DECL
5431 && LAMBDA_FUNCTION_P (decl
)))
5432 /* A lambda doesn't have an explicit declaration; don't complain
5433 about the parms of the enclosing class. */
5436 if (current_class_type
5437 && !TYPE_BEING_DEFINED (current_class_type
)
5438 && DECL_LANG_SPECIFIC (decl
)
5439 && DECL_DECLARES_FUNCTION_P (decl
)
5440 /* If this is either a friend defined in the scope of the class
5441 or a member function. */
5442 && (DECL_FUNCTION_MEMBER_P (decl
)
5443 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
5444 : DECL_FRIEND_CONTEXT (decl
)
5445 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
5447 /* And, if it was a member function, it really was defined in
5448 the scope of the class. */
5449 && (!DECL_FUNCTION_MEMBER_P (decl
)
5450 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
5451 /* We already checked these parameters when the template was
5452 declared, so there's no need to do it again now. This function
5453 was defined in class scope, but we're processing its body now
5454 that the class is complete. */
5457 /* Core issue 226 (C++0x only): the following only applies to class
5460 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
5464 If a template-parameter has a default template-argument, all
5465 subsequent template-parameters shall have a default
5466 template-argument supplied. */
5467 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
5469 tree inner_parms
= TREE_VALUE (parm_level
);
5470 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
5471 int seen_def_arg_p
= 0;
5474 for (i
= 0; i
< ntparms
; ++i
)
5476 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
5478 if (parm
== error_mark_node
)
5481 if (TREE_PURPOSE (parm
))
5483 else if (seen_def_arg_p
5484 && !template_parameter_pack_p (TREE_VALUE (parm
)))
5486 error ("no default argument for %qD", TREE_VALUE (parm
));
5487 /* For better subsequent error-recovery, we indicate that
5488 there should have been a default argument. */
5489 TREE_PURPOSE (parm
) = error_mark_node
;
5492 else if (!is_partial
5494 /* Don't complain about an enclosing partial
5496 && parm_level
== parms
5497 && (TREE_CODE (decl
) == TYPE_DECL
|| VAR_P (decl
))
5499 && template_parameter_pack_p (TREE_VALUE (parm
))
5500 /* A fixed parameter pack will be partially
5501 instantiated into a fixed length list. */
5502 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
5504 /* A primary class template, primary variable template
5505 (DR 2032), or alias template can only have one
5506 parameter pack, at the end of the template
5509 error ("parameter pack %q+D must be at the end of the"
5510 " template parameter list", TREE_VALUE (parm
));
5512 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
5520 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
5524 /* For an ordinary class template, default template arguments are
5525 allowed at the innermost level, e.g.:
5526 template <class T = int>
5528 but, in a partial specialization, they're not allowed even
5529 there, as we have in [temp.class.spec]:
5531 The template parameter list of a specialization shall not
5532 contain default template argument values.
5534 So, for a partial specialization, or for a function template
5535 (in C++98/C++03), we look at all of them. */
5538 /* But, for a primary class template that is not a partial
5539 specialization we look at all template parameters except the
5541 parms
= TREE_CHAIN (parms
);
5543 /* Figure out what error message to issue. */
5544 if (is_friend_decl
== 2)
5545 msg
= G_("default template arguments may not be used in function template "
5546 "friend re-declaration");
5547 else if (is_friend_decl
)
5548 msg
= G_("default template arguments may not be used in template "
5549 "friend declarations");
5550 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
5551 msg
= G_("default template arguments may not be used in function templates "
5552 "without %<-std=c++11%> or %<-std=gnu++11%>");
5553 else if (is_partial
)
5554 msg
= G_("default template arguments may not be used in "
5555 "partial specializations");
5556 else if (current_class_type
&& CLASSTYPE_IS_TEMPLATE (current_class_type
))
5557 msg
= G_("default argument for template parameter for class enclosing %qD");
5559 /* Per [temp.param]/9, "A default template-argument shall not be
5560 specified in the template-parameter-lists of the definition of
5561 a member of a class template that appears outside of the member's
5562 class.", thus if we aren't handling a member of a class template
5563 there is no need to examine the parameters. */
5566 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
5567 /* If we're inside a class definition, there's no need to
5568 examine the parameters to the class itself. On the one
5569 hand, they will be checked when the class is defined, and,
5570 on the other, default arguments are valid in things like:
5571 template <class T = double>
5572 struct S { template <class U> void f(U); };
5573 Here the default argument for `S' has no bearing on the
5574 declaration of `f'. */
5575 last_level_to_check
= template_class_depth (current_class_type
) + 1;
5577 /* Check everything. */
5578 last_level_to_check
= 0;
5580 for (parm_level
= parms
;
5581 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
5582 parm_level
= TREE_CHAIN (parm_level
))
5584 tree inner_parms
= TREE_VALUE (parm_level
);
5588 ntparms
= TREE_VEC_LENGTH (inner_parms
);
5589 for (i
= 0; i
< ntparms
; ++i
)
5591 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
5594 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
5599 if (is_friend_decl
== 2)
5606 /* Clear out the default argument so that we are not
5608 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
5612 /* At this point, if we're still interested in issuing messages,
5613 they must apply to classes surrounding the object declared. */
5615 msg
= G_("default argument for template parameter for class "
5622 /* Worker for push_template_decl_real, called via
5623 for_each_template_parm. DATA is really an int, indicating the
5624 level of the parameters we are interested in. If T is a template
5625 parameter of that level, return nonzero. */
5628 template_parm_this_level_p (tree t
, void* data
)
5630 int this_level
= *(int *)data
;
5633 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
5634 level
= TEMPLATE_PARM_LEVEL (t
);
5636 level
= TEMPLATE_TYPE_LEVEL (t
);
5637 return level
== this_level
;
5640 /* Worker for uses_outer_template_parms, called via for_each_template_parm.
5641 DATA is really an int, indicating the innermost outer level of parameters.
5642 If T is a template parameter of that level or further out, return
5646 template_parm_outer_level (tree t
, void *data
)
5648 int this_level
= *(int *)data
;
5651 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
5652 level
= TEMPLATE_PARM_LEVEL (t
);
5654 level
= TEMPLATE_TYPE_LEVEL (t
);
5655 return level
<= this_level
;
5658 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
5659 parameters given by current_template_args, or reuses a
5660 previously existing one, if appropriate. Returns the DECL, or an
5661 equivalent one, if it is replaced via a call to duplicate_decls.
5663 If IS_FRIEND is true, DECL is a friend declaration. */
5666 push_template_decl_real (tree decl
, bool is_friend
)
5674 int new_template_p
= 0;
5675 /* True if the template is a member template, in the sense of
5677 bool member_template_p
= false;
5679 if (decl
== error_mark_node
|| !current_template_parms
)
5680 return error_mark_node
;
5682 /* See if this is a partial specialization. */
5683 is_partial
= ((DECL_IMPLICIT_TYPEDEF_P (decl
)
5684 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
5685 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
5687 && DECL_LANG_SPECIFIC (decl
)
5688 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5689 && TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
))));
5691 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
5695 /* For a friend, we want the context of the friend, not
5696 the type of which it is a friend. */
5697 ctx
= CP_DECL_CONTEXT (decl
);
5698 else if (CP_DECL_CONTEXT (decl
)
5699 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
5700 /* In the case of a virtual function, we want the class in which
5702 ctx
= CP_DECL_CONTEXT (decl
);
5704 /* Otherwise, if we're currently defining some class, the DECL
5705 is assumed to be a member of the class. */
5706 ctx
= current_scope ();
5708 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
5711 if (!DECL_CONTEXT (decl
))
5712 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
5714 /* See if this is a primary template. */
5715 if (is_friend
&& ctx
5716 && uses_template_parms_level (ctx
, processing_template_decl
))
5717 /* A friend template that specifies a class context, i.e.
5718 template <typename T> friend void A<T>::f();
5721 else if (TREE_CODE (decl
) == TYPE_DECL
&& LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5724 is_primary
= template_parm_scope_p ();
5728 warning (OPT_Wtemplates
, "template %qD declared", decl
);
5730 if (DECL_CLASS_SCOPE_P (decl
))
5731 member_template_p
= true;
5732 if (TREE_CODE (decl
) == TYPE_DECL
5733 && IDENTIFIER_ANON_P (DECL_NAME (decl
)))
5735 error ("template class without a name");
5736 return error_mark_node
;
5738 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
5740 if (member_template_p
)
5742 if (DECL_OVERRIDE_P (decl
) || DECL_FINAL_P (decl
))
5743 error ("member template %qD may not have virt-specifiers", decl
);
5745 if (DECL_DESTRUCTOR_P (decl
))
5749 A destructor shall not be a member template. */
5750 error_at (DECL_SOURCE_LOCATION (decl
),
5751 "destructor %qD declared as member template", decl
);
5752 return error_mark_node
;
5754 if (IDENTIFIER_NEWDEL_OP_P (DECL_NAME (decl
))
5755 && (!prototype_p (TREE_TYPE (decl
))
5756 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
5757 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
5758 || (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
5759 == void_list_node
)))
5761 /* [basic.stc.dynamic.allocation]
5763 An allocation function can be a function
5764 template. ... Template allocation functions shall
5765 have two or more parameters. */
5766 error ("invalid template declaration of %qD", decl
);
5767 return error_mark_node
;
5770 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5771 && CLASS_TYPE_P (TREE_TYPE (decl
)))
5773 /* Class template, set TEMPLATE_TYPE_PARM_FOR_CLASS. */
5774 tree parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
5775 for (int i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
5777 tree t
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5778 if (TREE_CODE (t
) == TYPE_DECL
)
5780 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
5781 TEMPLATE_TYPE_PARM_FOR_CLASS (t
) = true;
5784 else if (TREE_CODE (decl
) == TYPE_DECL
5785 && TYPE_DECL_ALIAS_P (decl
))
5786 /* alias-declaration */
5787 gcc_assert (!DECL_ARTIFICIAL (decl
));
5788 else if (VAR_P (decl
))
5789 /* C++14 variable template. */;
5790 else if (TREE_CODE (decl
) == CONCEPT_DECL
)
5791 /* C++20 concept definitions. */;
5794 error ("template declaration of %q#D", decl
);
5795 return error_mark_node
;
5799 /* Check to see that the rules regarding the use of default
5800 arguments are not being violated. We check args for a friend
5801 functions when we know whether it's a definition, introducing
5802 declaration or re-declaration. */
5803 if (!is_friend
|| TREE_CODE (decl
) != FUNCTION_DECL
)
5804 check_default_tmpl_args (decl
, current_template_parms
,
5805 is_primary
, is_partial
, is_friend
);
5807 /* Ensure that there are no parameter packs in the type of this
5808 declaration that have not been expanded. */
5809 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5811 /* Check each of the arguments individually to see if there are
5812 any bare parameter packs. */
5813 tree type
= TREE_TYPE (decl
);
5814 tree arg
= DECL_ARGUMENTS (decl
);
5815 tree argtype
= TYPE_ARG_TYPES (type
);
5817 while (arg
&& argtype
)
5819 if (!DECL_PACK_P (arg
)
5820 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
5822 /* This is a PARM_DECL that contains unexpanded parameter
5823 packs. We have already complained about this in the
5824 check_for_bare_parameter_packs call, so just replace
5825 these types with ERROR_MARK_NODE. */
5826 TREE_TYPE (arg
) = error_mark_node
;
5827 TREE_VALUE (argtype
) = error_mark_node
;
5830 arg
= DECL_CHAIN (arg
);
5831 argtype
= TREE_CHAIN (argtype
);
5834 /* Check for bare parameter packs in the return type and the
5835 exception specifiers. */
5836 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
5837 /* Errors were already issued, set return type to int
5838 as the frontend doesn't expect error_mark_node as
5840 TREE_TYPE (type
) = integer_type_node
;
5841 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
5842 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
5844 else if (check_for_bare_parameter_packs (is_typedef_decl (decl
)
5845 ? DECL_ORIGINAL_TYPE (decl
)
5846 : TREE_TYPE (decl
)))
5848 TREE_TYPE (decl
) = error_mark_node
;
5849 return error_mark_node
;
5853 return process_partial_specialization (decl
);
5855 args
= current_template_args ();
5858 || TREE_CODE (ctx
) == FUNCTION_DECL
5859 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
5860 || (TREE_CODE (decl
) == TYPE_DECL
&& LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5861 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
5863 if (DECL_LANG_SPECIFIC (decl
)
5864 && DECL_TEMPLATE_INFO (decl
)
5865 && DECL_TI_TEMPLATE (decl
))
5866 tmpl
= DECL_TI_TEMPLATE (decl
);
5867 /* If DECL is a TYPE_DECL for a class-template, then there won't
5868 be DECL_LANG_SPECIFIC. The information equivalent to
5869 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
5870 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5871 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
5872 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
5874 /* Since a template declaration already existed for this
5875 class-type, we must be redeclaring it here. Make sure
5876 that the redeclaration is valid. */
5877 redeclare_class_template (TREE_TYPE (decl
),
5878 current_template_parms
,
5879 current_template_constraints ());
5880 /* We don't need to create a new TEMPLATE_DECL; just use the
5881 one we already had. */
5882 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
5886 tmpl
= build_template_decl (decl
, current_template_parms
,
5890 if (DECL_LANG_SPECIFIC (decl
)
5891 && DECL_TEMPLATE_SPECIALIZATION (decl
))
5893 /* A specialization of a member template of a template
5895 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
5896 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
5897 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
5903 tree a
, t
, current
, parms
;
5905 tree tinfo
= get_template_info (decl
);
5909 error ("template definition of non-template %q#D", decl
);
5910 return error_mark_node
;
5913 tmpl
= TI_TEMPLATE (tinfo
);
5915 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
5916 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
5917 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5918 && DECL_MEMBER_TEMPLATE_P (tmpl
))
5922 /* The declaration is a specialization of a member
5923 template, declared outside the class. Therefore, the
5924 innermost template arguments will be NULL, so we
5925 replace them with the arguments determined by the
5926 earlier call to check_explicit_specialization. */
5927 args
= DECL_TI_ARGS (decl
);
5930 = build_template_decl (decl
, current_template_parms
,
5932 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
5933 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
5934 DECL_TEMPLATE_INFO (new_tmpl
)
5935 = build_template_info (tmpl
, args
);
5937 register_specialization (new_tmpl
,
5938 most_general_template (tmpl
),
5944 /* Make sure the template headers we got make sense. */
5946 parms
= DECL_TEMPLATE_PARMS (tmpl
);
5947 i
= TMPL_PARMS_DEPTH (parms
);
5948 if (TMPL_ARGS_DEPTH (args
) != i
)
5950 error ("expected %d levels of template parms for %q#D, got %d",
5951 i
, decl
, TMPL_ARGS_DEPTH (args
));
5952 DECL_INTERFACE_KNOWN (decl
) = 1;
5953 return error_mark_node
;
5956 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
5958 a
= TMPL_ARGS_LEVEL (args
, i
);
5959 t
= INNERMOST_TEMPLATE_PARMS (parms
);
5961 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
5963 if (current
== decl
)
5964 error ("got %d template parameters for %q#D",
5965 TREE_VEC_LENGTH (a
), decl
);
5967 error ("got %d template parameters for %q#T",
5968 TREE_VEC_LENGTH (a
), current
);
5969 error (" but %d required", TREE_VEC_LENGTH (t
));
5970 /* Avoid crash in import_export_decl. */
5971 DECL_INTERFACE_KNOWN (decl
) = 1;
5972 return error_mark_node
;
5975 if (current
== decl
)
5977 else if (current
== NULL_TREE
)
5978 /* Can happen in erroneous input. */
5981 current
= get_containing_scope (current
);
5984 /* Check that the parms are used in the appropriate qualifying scopes
5985 in the declarator. */
5986 if (!comp_template_args
5988 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
5990 error ("template arguments to %qD do not match original "
5991 "template %qD", decl
, DECL_TEMPLATE_RESULT (tmpl
));
5992 if (!uses_template_parms (TI_ARGS (tinfo
)))
5993 inform (input_location
, "use %<template<>%> for"
5994 " an explicit specialization");
5995 /* Avoid crash in import_export_decl. */
5996 DECL_INTERFACE_KNOWN (decl
) = 1;
5997 return error_mark_node
;
6001 gcc_checking_assert (DECL_TEMPLATE_RESULT (tmpl
) == decl
);
6005 /* Push template declarations for global functions and types.
6006 Note that we do not try to push a global template friend
6007 declared in a template class; such a thing may well depend on
6008 the template parameters of the class and we'll push it when
6009 instantiating the befriending class. */
6011 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
6013 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
6014 if (tmpl
== error_mark_node
)
6015 return error_mark_node
;
6017 /* Hide template friend classes that haven't been declared yet. */
6018 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
6020 DECL_ANTICIPATED (tmpl
) = 1;
6021 DECL_FRIEND_P (tmpl
) = 1;
6026 /* The type may have been completed, or (erroneously) changed. */
6027 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
6031 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
6033 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
6035 /* Give template template parms a DECL_CONTEXT of the template
6036 for which they are a parameter. */
6037 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
6038 for (int i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
6040 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
6041 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
6042 DECL_CONTEXT (parm
) = tmpl
;
6045 if (TREE_CODE (decl
) == TYPE_DECL
6046 && TYPE_DECL_ALIAS_P (decl
))
6049 = TEMPLATE_PARMS_CONSTRAINTS (DECL_TEMPLATE_PARMS (tmpl
)))
6051 /* ??? Why don't we do this here for all templates? */
6052 constr
= build_constraints (constr
, NULL_TREE
);
6053 set_constraints (decl
, constr
);
6055 if (complex_alias_template_p (tmpl
))
6056 TEMPLATE_DECL_COMPLEX_ALIAS_P (tmpl
) = true;
6060 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
6061 back to its most general template. If TMPL is a specialization,
6062 ARGS may only have the innermost set of arguments. Add the missing
6063 argument levels if necessary. */
6064 if (DECL_TEMPLATE_INFO (tmpl
))
6065 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
6067 info
= build_template_info (tmpl
, args
);
6069 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
6070 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
6074 retrofit_lang_decl (decl
);
6075 if (DECL_LANG_SPECIFIC (decl
)
6076 && !(VAR_OR_FUNCTION_DECL_P (decl
)
6077 && DECL_LOCAL_DECL_P (decl
)))
6078 DECL_TEMPLATE_INFO (decl
) = info
;
6081 if (flag_implicit_templates
6083 && TREE_PUBLIC (decl
)
6084 && VAR_OR_FUNCTION_DECL_P (decl
))
6085 /* Set DECL_COMDAT on template instantiations; if we force
6086 them to be emitted by explicit instantiation,
6087 mark_needed will tell cgraph to do the right thing. */
6088 DECL_COMDAT (decl
) = true;
6090 return DECL_TEMPLATE_RESULT (tmpl
);
6094 push_template_decl (tree decl
)
6096 return push_template_decl_real (decl
, false);
6099 /* FN is an inheriting constructor that inherits from the constructor
6100 template INHERITED; turn FN into a constructor template with a matching
6104 add_inherited_template_parms (tree fn
, tree inherited
)
6107 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
6108 inner_parms
= copy_node (inner_parms
);
6110 = tree_cons (size_int (processing_template_decl
+ 1),
6111 inner_parms
, current_template_parms
);
6112 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
6113 tree args
= template_parms_to_args (parms
);
6114 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
6115 DECL_ARTIFICIAL (tmpl
) = true;
6116 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
6120 /* Called when a class template TYPE is redeclared with the indicated
6121 template PARMS, e.g.:
6123 template <class T> struct S;
6124 template <class T> struct S {}; */
6127 redeclare_class_template (tree type
, tree parms
, tree cons
)
6133 if (!TYPE_TEMPLATE_INFO (type
))
6135 error ("%qT is not a template type", type
);
6139 tmpl
= TYPE_TI_TEMPLATE (type
);
6140 if (!PRIMARY_TEMPLATE_P (tmpl
))
6141 /* The type is nested in some template class. Nothing to worry
6142 about here; there are no new template parameters for the nested
6148 error ("template specifiers not specified in declaration of %qD",
6153 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
6154 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
6156 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
6158 error_n (input_location
, TREE_VEC_LENGTH (parms
),
6159 "redeclared with %d template parameter",
6160 "redeclared with %d template parameters",
6161 TREE_VEC_LENGTH (parms
));
6162 inform_n (DECL_SOURCE_LOCATION (tmpl
), TREE_VEC_LENGTH (tmpl_parms
),
6163 "previous declaration %qD used %d template parameter",
6164 "previous declaration %qD used %d template parameters",
6165 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
6169 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
6176 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
6177 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
6180 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
6181 if (error_operand_p (tmpl_parm
))
6184 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
6185 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
6186 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
6188 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
6190 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
6191 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
6192 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
6193 || (TREE_CODE (tmpl_parm
) != PARM_DECL
6194 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
6195 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
6196 || (TREE_CODE (tmpl_parm
) == PARM_DECL
6197 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
6198 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
6200 auto_diagnostic_group d
;
6201 error ("template parameter %q+#D", tmpl_parm
);
6202 inform (input_location
, "redeclared here as %q#D", parm
);
6206 /* The parameters can be declared to introduce different
6208 tree p1
= TREE_VEC_ELT (tmpl_parms
, i
);
6209 tree p2
= TREE_VEC_ELT (parms
, i
);
6210 if (!template_parameter_constraints_equivalent_p (p1
, p2
))
6212 auto_diagnostic_group d
;
6213 error ("declaration of template parameter %q+#D with different "
6214 "constraints", parm
);
6215 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
6216 "original declaration appeared here");
6220 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
6222 /* We have in [temp.param]:
6224 A template-parameter may not be given default arguments
6225 by two different declarations in the same scope. */
6226 auto_diagnostic_group d
;
6227 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
6228 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
6229 "original definition appeared here");
6233 if (parm_default
!= NULL_TREE
)
6234 /* Update the previous template parameters (which are the ones
6235 that will really count) with the new default value. */
6236 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
6237 else if (tmpl_default
!= NULL_TREE
)
6238 /* Update the new parameters, too; they'll be used as the
6239 parameters for any members. */
6240 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
6242 /* Give each template template parm in this redeclaration a
6243 DECL_CONTEXT of the template for which they are a parameter. */
6244 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
6246 gcc_assert (DECL_CONTEXT (parm
) == NULL_TREE
);
6247 DECL_CONTEXT (parm
) = tmpl
;
6250 if (TREE_CODE (parm
) == TYPE_DECL
)
6251 TEMPLATE_TYPE_PARM_FOR_CLASS (TREE_TYPE (parm
)) = true;
6254 tree ci
= get_constraints (tmpl
);
6255 tree req1
= ci
? CI_TEMPLATE_REQS (ci
) : NULL_TREE
;
6256 tree req2
= cons
? CI_TEMPLATE_REQS (cons
) : NULL_TREE
;
6258 /* Two classes with different constraints declare different entities. */
6259 if (!cp_tree_equal (req1
, req2
))
6261 auto_diagnostic_group d
;
6262 error_at (input_location
, "redeclaration %q#D with different "
6263 "constraints", tmpl
);
6264 inform (DECL_SOURCE_LOCATION (tmpl
),
6265 "original declaration appeared here");
6272 /* The actual substitution part of instantiate_non_dependent_expr_sfinae,
6273 to be used when the caller has already checked
6274 (processing_template_decl
6275 && !instantiation_dependent_expression_p (expr)
6276 && potential_constant_expression (expr))
6277 and cleared processing_template_decl. */
6280 instantiate_non_dependent_expr_internal (tree expr
, tsubst_flags_t complain
)
6282 return tsubst_copy_and_build (expr
,
6285 /*in_decl=*/NULL_TREE
,
6286 /*function_p=*/false,
6287 /*integral_constant_expression_p=*/true);
6290 /* Simplify EXPR if it is a non-dependent expression. Returns the
6291 (possibly simplified) expression. */
6294 instantiate_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
6296 if (expr
== NULL_TREE
)
6299 /* If we're in a template, but EXPR isn't value dependent, simplify
6300 it. We're supposed to treat:
6302 template <typename T> void f(T[1 + 1]);
6303 template <typename T> void f(T[2]);
6305 as two declarations of the same function, for example. */
6306 if (processing_template_decl
6307 && is_nondependent_constant_expression (expr
))
6309 processing_template_decl_sentinel s
;
6310 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
6316 instantiate_non_dependent_expr (tree expr
)
6318 return instantiate_non_dependent_expr_sfinae (expr
, tf_error
);
6321 /* Like instantiate_non_dependent_expr, but return NULL_TREE rather than
6322 an uninstantiated expression. */
6325 instantiate_non_dependent_or_null (tree expr
)
6327 if (expr
== NULL_TREE
)
6329 if (processing_template_decl
)
6331 if (!is_nondependent_constant_expression (expr
))
6335 processing_template_decl_sentinel s
;
6336 expr
= instantiate_non_dependent_expr_internal (expr
, tf_error
);
6342 /* True iff T is a specialization of a variable template. */
6345 variable_template_specialization_p (tree t
)
6347 if (!VAR_P (t
) || !DECL_LANG_SPECIFIC (t
) || !DECL_TEMPLATE_INFO (t
))
6349 tree tmpl
= DECL_TI_TEMPLATE (t
);
6350 return variable_template_p (tmpl
);
6353 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
6354 template declaration, or a TYPE_DECL for an alias declaration. */
6357 alias_type_or_template_p (tree t
)
6361 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
6364 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
6365 || DECL_ALIAS_TEMPLATE_P (t
));
6368 /* If T is a specialization of an alias template, return it; otherwise return
6369 NULL_TREE. If TRANSPARENT_TYPEDEFS is true, look through other aliases. */
6372 alias_template_specialization_p (const_tree t
,
6373 bool transparent_typedefs
)
6378 /* It's an alias template specialization if it's an alias and its
6379 TYPE_NAME is a specialization of a primary template. */
6380 if (typedef_variant_p (t
))
6382 if (tree tinfo
= TYPE_ALIAS_TEMPLATE_INFO (t
))
6383 if (PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
)))
6384 return CONST_CAST_TREE (t
);
6385 if (transparent_typedefs
)
6386 return alias_template_specialization_p (DECL_ORIGINAL_TYPE
6388 transparent_typedefs
);
6394 /* An alias template is complex from a SFINAE perspective if a template-id
6395 using that alias can be ill-formed when the expansion is not, as with
6396 the void_t template. We determine this by checking whether the
6397 expansion for the alias template uses all its template parameters. */
6399 struct uses_all_template_parms_data
6406 uses_all_template_parms_r (tree t
, void *data_
)
6408 struct uses_all_template_parms_data
&data
6409 = *(struct uses_all_template_parms_data
*)data_
;
6410 tree idx
= get_template_parm_index (t
);
6412 if (TEMPLATE_PARM_LEVEL (idx
) == data
.level
)
6413 data
.seen
[TEMPLATE_PARM_IDX (idx
)] = true;
6417 /* for_each_template_parm any_fn callback for complex_alias_template_p. */
6420 complex_pack_expansion_r (tree t
, void *data_
)
6422 /* An alias template with a pack expansion that expands a pack from the
6423 enclosing class needs to be considered complex, to avoid confusion with
6424 the same pack being used as an argument to the alias's own template
6425 parameter (91966). */
6426 if (!PACK_EXPANSION_P (t
))
6428 struct uses_all_template_parms_data
&data
6429 = *(struct uses_all_template_parms_data
*)data_
;
6430 for (tree pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
6431 pack
= TREE_CHAIN (pack
))
6433 tree parm_pack
= TREE_VALUE (pack
);
6434 if (!TEMPLATE_PARM_P (parm_pack
))
6437 template_parm_level_and_index (parm_pack
, &level
, &idx
);
6438 if (level
< data
.level
)
6445 complex_alias_template_p (const_tree tmpl
)
6447 /* A renaming alias isn't complex. */
6448 if (get_underlying_template (CONST_CAST_TREE (tmpl
)) != tmpl
)
6451 /* Any other constrained alias is complex. */
6452 if (get_constraints (tmpl
))
6455 struct uses_all_template_parms_data data
;
6456 tree pat
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
6457 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
6458 data
.level
= TMPL_PARMS_DEPTH (parms
);
6459 int len
= TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS (parms
));
6460 data
.seen
= XALLOCAVEC (bool, len
);
6461 for (int i
= 0; i
< len
; ++i
)
6462 data
.seen
[i
] = false;
6464 if (for_each_template_parm (pat
, uses_all_template_parms_r
, &data
,
6465 NULL
, true, complex_pack_expansion_r
))
6467 for (int i
= 0; i
< len
; ++i
)
6473 /* If T is a specialization of a complex alias template with dependent
6474 template-arguments, return it; otherwise return NULL_TREE. If T is a
6475 typedef to such a specialization, return the specialization. */
6478 dependent_alias_template_spec_p (const_tree t
, bool transparent_typedefs
)
6480 if (!TYPE_P (t
) || !typedef_variant_p (t
))
6483 tree tinfo
= TYPE_ALIAS_TEMPLATE_INFO (t
);
6485 && TEMPLATE_DECL_COMPLEX_ALIAS_P (TI_TEMPLATE (tinfo
))
6486 && (any_dependent_template_arguments_p
6487 (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
)))))
6488 return CONST_CAST_TREE (t
);
6490 if (transparent_typedefs
)
6492 tree utype
= DECL_ORIGINAL_TYPE (TYPE_NAME (t
));
6493 return dependent_alias_template_spec_p (utype
, transparent_typedefs
);
6499 /* Return the number of innermost template parameters in TMPL. */
6502 num_innermost_template_parms (const_tree tmpl
)
6504 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
6505 return TREE_VEC_LENGTH (parms
);
6508 /* Return either TMPL or another template that it is equivalent to under DR
6509 1286: An alias that just changes the name of a template is equivalent to
6510 the other template. */
6513 get_underlying_template (tree tmpl
)
6515 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
6516 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
6518 /* Determine if the alias is equivalent to an underlying template. */
6519 tree orig_type
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
6520 /* The underlying type may have been ill-formed. Don't proceed. */
6523 tree tinfo
= TYPE_TEMPLATE_INFO_MAYBE_ALIAS (orig_type
);
6527 tree underlying
= TI_TEMPLATE (tinfo
);
6528 if (!PRIMARY_TEMPLATE_P (underlying
)
6529 || (num_innermost_template_parms (tmpl
)
6530 != num_innermost_template_parms (underlying
)))
6533 tree alias_args
= INNERMOST_TEMPLATE_ARGS (generic_targs_for (tmpl
));
6534 if (!comp_template_args (TI_ARGS (tinfo
), alias_args
))
6537 /* If TMPL adds or changes any constraints, it isn't equivalent. I think
6538 it's appropriate to treat a less-constrained alias as equivalent. */
6539 if (!at_least_as_constrained (underlying
, tmpl
))
6542 /* Alias is equivalent. Strip it and repeat. */
6549 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
6550 must be a reference-to-function or a pointer-to-function type, as specified
6551 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
6552 and check that the resulting function has external linkage. */
6555 convert_nontype_argument_function (tree type
, tree expr
,
6556 tsubst_flags_t complain
)
6560 linkage_kind linkage
;
6562 fn
= instantiate_type (type
, fns
, tf_none
);
6563 if (fn
== error_mark_node
)
6564 return error_mark_node
;
6566 if (value_dependent_expression_p (fn
))
6569 fn_no_ptr
= strip_fnptr_conv (fn
);
6570 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
6571 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
6572 if (BASELINK_P (fn_no_ptr
))
6573 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
6575 /* [temp.arg.nontype]/1
6577 A template-argument for a non-type, non-template template-parameter
6580 -- the address of an object or function with external [C++11: or
6581 internal] linkage. */
6583 STRIP_ANY_LOCATION_WRAPPER (fn_no_ptr
);
6584 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
6586 if (complain
& tf_error
)
6588 location_t loc
= cp_expr_loc_or_input_loc (expr
);
6589 error_at (loc
, "%qE is not a valid template argument for type %qT",
6591 if (TYPE_PTR_P (type
))
6592 inform (loc
, "it must be the address of a function "
6593 "with external linkage");
6595 inform (loc
, "it must be the name of a function with "
6596 "external linkage");
6601 linkage
= decl_linkage (fn_no_ptr
);
6602 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
6604 if (complain
& tf_error
)
6606 location_t loc
= cp_expr_loc_or_input_loc (expr
);
6607 if (cxx_dialect
>= cxx11
)
6608 error_at (loc
, "%qE is not a valid template argument for type "
6609 "%qT because %qD has no linkage",
6610 expr
, type
, fn_no_ptr
);
6612 error_at (loc
, "%qE is not a valid template argument for type "
6613 "%qT because %qD does not have external linkage",
6614 expr
, type
, fn_no_ptr
);
6620 if (TYPE_REF_P (type
))
6622 if (REFERENCE_REF_P (fn
))
6623 fn
= TREE_OPERAND (fn
, 0);
6625 fn
= build_address (fn
);
6627 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (fn
)))
6628 fn
= build_nop (type
, fn
);
6633 /* Subroutine of convert_nontype_argument.
6634 Check if EXPR of type TYPE is a valid pointer-to-member constant.
6635 Emit an error otherwise. */
6638 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
6639 tsubst_flags_t complain
)
6641 tree orig_expr
= expr
;
6643 if (null_ptr_cst_p (expr
))
6645 if (TREE_CODE (expr
) == PTRMEM_CST
6646 && same_type_p (TYPE_PTRMEM_CLASS_TYPE (type
),
6647 PTRMEM_CST_CLASS (expr
)))
6649 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
6651 if (processing_template_decl
6652 && TREE_CODE (expr
) == ADDR_EXPR
6653 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
6655 if (complain
& tf_error
)
6657 location_t loc
= cp_expr_loc_or_input_loc (orig_expr
);
6658 error_at (loc
, "%qE is not a valid template argument for type %qT",
6660 if (TREE_CODE (expr
) != PTRMEM_CST
)
6661 inform (loc
, "it must be a pointer-to-member of the form %<&X::Y%>");
6663 inform (loc
, "because it is a member of %qT", PTRMEM_CST_CLASS (expr
));
6668 /* Returns TRUE iff the address of OP is value-dependent.
6670 14.6.2.4 [temp.dep.temp]:
6671 A non-integral non-type template-argument is dependent if its type is
6672 dependent or it has either of the following forms
6675 and contains a nested-name-specifier which specifies a class-name that
6676 names a dependent type.
6678 We generalize this to just say that the address of a member of a
6679 dependent class is value-dependent; the above doesn't cover the
6680 address of a static data member named with an unqualified-id. */
6683 has_value_dependent_address (tree op
)
6685 STRIP_ANY_LOCATION_WRAPPER (op
);
6687 /* We could use get_inner_reference here, but there's no need;
6688 this is only relevant for template non-type arguments, which
6689 can only be expressed as &id-expression. */
6692 tree ctx
= CP_DECL_CONTEXT (op
);
6693 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
6700 /* The next set of functions are used for providing helpful explanatory
6701 diagnostics for failed overload resolution. Their messages should be
6702 indented by two spaces for consistency with the messages in
6706 unify_success (bool /*explain_p*/)
6711 /* Other failure functions should call this one, to provide a single function
6712 for setting a breakpoint on. */
6715 unify_invalid (bool /*explain_p*/)
6721 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
6724 inform (input_location
,
6725 " couldn%'t deduce template parameter %qD", parm
);
6726 return unify_invalid (explain_p
);
6730 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
6733 inform (input_location
,
6734 " types %qT and %qT have incompatible cv-qualifiers",
6736 return unify_invalid (explain_p
);
6740 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
6743 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
6744 return unify_invalid (explain_p
);
6748 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
6751 inform (input_location
,
6752 " template parameter %qD is not a parameter pack, but "
6755 return unify_invalid (explain_p
);
6759 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
6762 inform (input_location
,
6763 " template argument %qE does not match "
6764 "pointer-to-member constant %qE",
6766 return unify_invalid (explain_p
);
6770 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
6773 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
6774 return unify_invalid (explain_p
);
6778 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
6781 inform (input_location
,
6782 " inconsistent parameter pack deduction with %qT and %qT",
6784 return unify_invalid (explain_p
);
6788 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
6793 inform (input_location
,
6794 " deduced conflicting types for parameter %qT (%qT and %qT)",
6795 parm
, first
, second
);
6797 inform (input_location
,
6798 " deduced conflicting values for non-type parameter "
6799 "%qE (%qE and %qE)", parm
, first
, second
);
6801 return unify_invalid (explain_p
);
6805 unify_vla_arg (bool explain_p
, tree arg
)
6808 inform (input_location
,
6809 " variable-sized array type %qT is not "
6810 "a valid template argument",
6812 return unify_invalid (explain_p
);
6816 unify_method_type_error (bool explain_p
, tree arg
)
6819 inform (input_location
,
6820 " member function type %qT is not a valid template argument",
6822 return unify_invalid (explain_p
);
6826 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
6831 inform_n (input_location
, wanted
,
6832 " candidate expects at least %d argument, %d provided",
6833 " candidate expects at least %d arguments, %d provided",
6836 inform_n (input_location
, wanted
,
6837 " candidate expects %d argument, %d provided",
6838 " candidate expects %d arguments, %d provided",
6841 return unify_invalid (explain_p
);
6845 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
6847 return unify_arity (explain_p
, have
, wanted
);
6851 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
6852 bool least_p
= false)
6854 return unify_arity (explain_p
, have
, wanted
, least_p
);
6858 unify_arg_conversion (bool explain_p
, tree to_type
,
6859 tree from_type
, tree arg
)
6862 inform (cp_expr_loc_or_input_loc (arg
),
6863 " cannot convert %qE (type %qT) to type %qT",
6864 arg
, from_type
, to_type
);
6865 return unify_invalid (explain_p
);
6869 unify_no_common_base (bool explain_p
, enum template_base_result r
,
6870 tree parm
, tree arg
)
6875 case tbr_ambiguous_baseclass
:
6876 inform (input_location
, " %qT is an ambiguous base class of %qT",
6880 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
6883 return unify_invalid (explain_p
);
6887 unify_inconsistent_template_template_parameters (bool explain_p
)
6890 inform (input_location
,
6891 " template parameters of a template template argument are "
6892 "inconsistent with other deduced template arguments");
6893 return unify_invalid (explain_p
);
6897 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
6900 inform (input_location
,
6901 " cannot deduce a template for %qT from non-template type %qT",
6903 return unify_invalid (explain_p
);
6907 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
6910 inform (input_location
,
6911 " template argument %qE does not match %qE", arg
, parm
);
6912 return unify_invalid (explain_p
);
6915 /* True if T is a C++20 template parameter object to store the argument for a
6916 template parameter of class type. */
6919 template_parm_object_p (const_tree t
)
6921 return (TREE_CODE (t
) == VAR_DECL
&& DECL_ARTIFICIAL (t
) && DECL_NAME (t
)
6922 && !strncmp (IDENTIFIER_POINTER (DECL_NAME (t
)), "_ZTA", 4));
6925 /* Subroutine of convert_nontype_argument, to check whether EXPR, as an
6926 argument for TYPE, points to an unsuitable object.
6928 Also adjust the type of the index in C++20 array subobject references. */
6931 invalid_tparm_referent_p (tree type
, tree expr
, tsubst_flags_t complain
)
6933 switch (TREE_CODE (expr
))
6936 return invalid_tparm_referent_p (type
, TREE_OPERAND (expr
, 0),
6940 return invalid_tparm_referent_p (type
, TARGET_EXPR_INITIAL (expr
),
6945 unsigned i
; tree elt
;
6946 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), i
, elt
)
6947 if (invalid_tparm_referent_p (TREE_TYPE (elt
), elt
, complain
))
6954 tree decl
= TREE_OPERAND (expr
, 0);
6956 if (cxx_dialect
>= cxx20
)
6957 while (TREE_CODE (decl
) == COMPONENT_REF
6958 || TREE_CODE (decl
) == ARRAY_REF
)
6960 tree
&op
= TREE_OPERAND (decl
, 1);
6961 if (TREE_CODE (decl
) == ARRAY_REF
6962 && TREE_CODE (op
) == INTEGER_CST
)
6963 /* Canonicalize array offsets to ptrdiff_t; how they were
6964 written doesn't matter for subobject identity. */
6965 op
= fold_convert (ptrdiff_type_node
, op
);
6966 decl
= TREE_OPERAND (decl
, 0);
6971 if (complain
& tf_error
)
6972 error_at (cp_expr_loc_or_input_loc (expr
),
6973 "%qE is not a valid template argument of type %qT "
6974 "because %qE is not a variable", expr
, type
, decl
);
6977 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
6979 if (complain
& tf_error
)
6980 error_at (cp_expr_loc_or_input_loc (expr
),
6981 "%qE is not a valid template argument of type %qT "
6982 "in C++98 because %qD does not have external linkage",
6986 else if ((cxx_dialect
>= cxx11
&& cxx_dialect
< cxx17
)
6987 && decl_linkage (decl
) == lk_none
)
6989 if (complain
& tf_error
)
6990 error_at (cp_expr_loc_or_input_loc (expr
),
6991 "%qE is not a valid template argument of type %qT "
6992 "because %qD has no linkage", expr
, type
, decl
);
6995 /* C++17: For a non-type template-parameter of reference or pointer
6996 type, the value of the constant expression shall not refer to (or
6997 for a pointer type, shall not be the address of):
6998 * a subobject (4.5),
6999 * a temporary object (15.2),
7000 * a string literal (5.13.5),
7001 * the result of a typeid expression (8.2.8), or
7002 * a predefined __func__ variable (11.4.1). */
7003 else if (DECL_ARTIFICIAL (decl
))
7005 if (complain
& tf_error
)
7006 error ("the address of %qD is not a valid template argument",
7010 else if (cxx_dialect
< cxx20
7011 && !(same_type_ignoring_top_level_qualifiers_p
7012 (strip_array_types (TREE_TYPE (type
)),
7013 strip_array_types (TREE_TYPE (decl
)))))
7015 if (complain
& tf_error
)
7016 error ("the address of the %qT subobject of %qD is not a "
7017 "valid template argument", TREE_TYPE (type
), decl
);
7020 else if (!TREE_STATIC (decl
) && !DECL_EXTERNAL (decl
))
7022 if (complain
& tf_error
)
7023 error ("the address of %qD is not a valid template argument "
7024 "because it does not have static storage duration",
7032 if (!INDIRECT_TYPE_P (type
))
7033 /* We're only concerned about pointers and references here. */;
7034 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
7035 /* Null pointer values are OK in C++11. */;
7040 if (complain
& tf_error
)
7041 error ("%qD is not a valid template argument "
7042 "because %qD is a variable, not the address of "
7043 "a variable", expr
, expr
);
7048 if (complain
& tf_error
)
7049 error ("%qE is not a valid template argument for %qT "
7050 "because it is not the address of a variable",
7060 /* The template arguments corresponding to template parameter objects of types
7061 that contain pointers to members. */
7063 static GTY(()) hash_map
<tree
, tree
> *tparm_obj_values
;
7065 /* Return a VAR_DECL for the C++20 template parameter object corresponding to
7066 template argument EXPR. */
7069 get_template_parm_object (tree expr
, tsubst_flags_t complain
)
7071 if (TREE_CODE (expr
) == TARGET_EXPR
)
7072 expr
= TARGET_EXPR_INITIAL (expr
);
7074 if (!TREE_CONSTANT (expr
))
7076 if ((complain
& tf_error
)
7077 && require_rvalue_constant_expression (expr
))
7078 cxx_constant_value (expr
);
7079 return error_mark_node
;
7081 if (invalid_tparm_referent_p (TREE_TYPE (expr
), expr
, complain
))
7082 return error_mark_node
;
7084 tree name
= mangle_template_parm_object (expr
);
7085 tree decl
= get_global_binding (name
);
7089 tree type
= cp_build_qualified_type (TREE_TYPE (expr
), TYPE_QUAL_CONST
);
7090 decl
= create_temporary_var (type
);
7091 TREE_STATIC (decl
) = true;
7092 DECL_DECLARED_CONSTEXPR_P (decl
) = true;
7093 TREE_READONLY (decl
) = true;
7094 DECL_NAME (decl
) = name
;
7095 SET_DECL_ASSEMBLER_NAME (decl
, name
);
7096 DECL_CONTEXT (decl
) = global_namespace
;
7097 comdat_linkage (decl
);
7099 if (!zero_init_p (type
))
7101 /* If EXPR contains any PTRMEM_CST, they will get clobbered by
7102 lower_var_init before we're done mangling. So store the original
7104 tree copy
= unshare_constructor (expr
);
7105 hash_map_safe_put
<hm_ggc
> (tparm_obj_values
, decl
, copy
);
7108 pushdecl_top_level_and_finish (decl
, expr
);
7113 /* Return the actual template argument corresponding to template parameter
7117 tparm_object_argument (tree var
)
7119 if (zero_init_p (TREE_TYPE (var
)))
7120 return DECL_INITIAL (var
);
7121 return *(tparm_obj_values
->get (var
));
7124 /* Attempt to convert the non-type template parameter EXPR to the
7125 indicated TYPE. If the conversion is successful, return the
7126 converted value. If the conversion is unsuccessful, return
7127 NULL_TREE if we issued an error message, or error_mark_node if we
7128 did not. We issue error messages for out-and-out bad template
7129 parameters, but not simply because the conversion failed, since we
7130 might be just trying to do argument deduction. Both TYPE and EXPR
7131 must be non-dependent.
7133 The conversion follows the special rules described in
7134 [temp.arg.nontype], and it is much more strict than an implicit
7137 This function is called twice for each template argument (see
7138 lookup_template_class for a more accurate description of this
7139 problem). This means that we need to handle expressions which
7140 are not valid in a C++ source, but can be created from the
7141 first call (for instance, casts to perform conversions). These
7142 hacks can go away after we fix the double coercion problem. */
7145 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
7148 location_t loc
= cp_expr_loc_or_input_loc (expr
);
7150 /* Detect immediately string literals as invalid non-type argument.
7151 This special-case is not needed for correctness (we would easily
7152 catch this later), but only to provide better diagnostic for this
7153 common user mistake. As suggested by DR 100, we do not mention
7154 linkage issues in the diagnostic as this is not the point. */
7155 if (TREE_CODE (expr
) == STRING_CST
&& !CLASS_TYPE_P (type
))
7157 if (complain
& tf_error
)
7158 error ("%qE is not a valid template argument for type %qT "
7159 "because string literals can never be used in this context",
7164 /* Add the ADDR_EXPR now for the benefit of
7165 value_dependent_expression_p. */
7166 if (TYPE_PTROBV_P (type
)
7167 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
7169 expr
= decay_conversion (expr
, complain
);
7170 if (expr
== error_mark_node
)
7171 return error_mark_node
;
7174 /* If we are in a template, EXPR may be non-dependent, but still
7175 have a syntactic, rather than semantic, form. For example, EXPR
7176 might be a SCOPE_REF, rather than the VAR_DECL to which the
7177 SCOPE_REF refers. Preserving the qualifying scope is necessary
7178 so that access checking can be performed when the template is
7179 instantiated -- but here we need the resolved form so that we can
7180 convert the argument. */
7181 bool non_dep
= false;
7182 if (TYPE_REF_OBJ_P (type
)
7183 && has_value_dependent_address (expr
))
7184 /* If we want the address and it's value-dependent, don't fold. */;
7185 else if (processing_template_decl
7186 && is_nondependent_constant_expression (expr
))
7188 if (error_operand_p (expr
))
7189 return error_mark_node
;
7190 expr_type
= TREE_TYPE (expr
);
7192 /* If the argument is non-dependent, perform any conversions in
7193 non-dependent context as well. */
7194 processing_template_decl_sentinel
s (non_dep
);
7196 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
7198 const bool val_dep_p
= value_dependent_expression_p (expr
);
7200 expr
= canonicalize_expr_argument (expr
, complain
);
7202 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
7203 to a non-type argument of "nullptr". */
7204 if (NULLPTR_TYPE_P (expr_type
) && TYPE_PTR_OR_PTRMEM_P (type
))
7205 expr
= fold_simple (convert (type
, expr
));
7207 /* In C++11, integral or enumeration non-type template arguments can be
7208 arbitrary constant expressions. Pointer and pointer to
7209 member arguments can be general constant expressions that evaluate
7210 to a null value, but otherwise still need to be of a specific form. */
7211 if (cxx_dialect
>= cxx11
)
7213 if (TREE_CODE (expr
) == PTRMEM_CST
&& TYPE_PTRMEM_P (type
))
7214 /* A PTRMEM_CST is already constant, and a valid template
7215 argument for a parameter of pointer to member type, we just want
7216 to leave it in that form rather than lower it to a
7218 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
7219 || cxx_dialect
>= cxx17
)
7221 /* C++17: A template-argument for a non-type template-parameter shall
7222 be a converted constant expression (8.20) of the type of the
7223 template-parameter. */
7224 expr
= build_converted_constant_expr (type
, expr
, complain
);
7225 if (expr
== error_mark_node
)
7226 /* Make sure we return NULL_TREE only if we have really issued
7227 an error, as described above. */
7228 return (complain
& tf_error
) ? NULL_TREE
: error_mark_node
;
7229 else if (TREE_CODE (expr
) == IMPLICIT_CONV_EXPR
)
7231 IMPLICIT_CONV_EXPR_NONTYPE_ARG (expr
) = true;
7234 expr
= maybe_constant_value (expr
, NULL_TREE
,
7235 /*manifestly_const_eval=*/true);
7236 expr
= convert_from_reference (expr
);
7238 else if (TYPE_PTR_OR_PTRMEM_P (type
))
7240 tree folded
= maybe_constant_value (expr
, NULL_TREE
,
7241 /*manifestly_const_eval=*/true);
7242 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
7243 : null_member_pointer_value_p (folded
))
7248 if (TYPE_REF_P (type
))
7249 expr
= mark_lvalue_use (expr
);
7251 expr
= mark_rvalue_use (expr
);
7253 /* HACK: Due to double coercion, we can get a
7254 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
7255 which is the tree that we built on the first call (see
7256 below when coercing to reference to object or to reference to
7257 function). We just strip everything and get to the arg.
7258 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
7260 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
7262 tree probe_type
, probe
= expr
;
7263 if (REFERENCE_REF_P (probe
))
7264 probe
= TREE_OPERAND (probe
, 0);
7265 probe_type
= TREE_TYPE (probe
);
7266 if (TREE_CODE (probe
) == NOP_EXPR
)
7268 /* ??? Maybe we could use convert_from_reference here, but we
7269 would need to relax its constraints because the NOP_EXPR
7270 could actually change the type to something more cv-qualified,
7271 and this is not folded by convert_from_reference. */
7272 tree addr
= TREE_OPERAND (probe
, 0);
7273 if (TYPE_REF_P (probe_type
)
7274 && TREE_CODE (addr
) == ADDR_EXPR
7275 && TYPE_PTR_P (TREE_TYPE (addr
))
7276 && (same_type_ignoring_top_level_qualifiers_p
7277 (TREE_TYPE (probe_type
),
7278 TREE_TYPE (TREE_TYPE (addr
)))))
7280 expr
= TREE_OPERAND (addr
, 0);
7281 expr_type
= TREE_TYPE (probe_type
);
7286 /* [temp.arg.nontype]/5, bullet 1
7288 For a non-type template-parameter of integral or enumeration type,
7289 integral promotions (_conv.prom_) and integral conversions
7290 (_conv.integral_) are applied. */
7291 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
7292 || TREE_CODE (type
) == REAL_TYPE
)
7294 if (cxx_dialect
< cxx11
)
7296 tree t
= build_converted_constant_expr (type
, expr
, complain
);
7297 t
= maybe_constant_value (t
);
7298 if (t
!= error_mark_node
)
7302 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
7303 return error_mark_node
;
7305 /* Notice that there are constant expressions like '4 % 0' which
7306 do not fold into integer constants. */
7307 if (!CONSTANT_CLASS_P (expr
) && !val_dep_p
)
7309 if (complain
& tf_error
)
7311 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
7312 if (!require_potential_constant_expression (expr
))
7313 expr
= error_mark_node
;
7315 expr
= cxx_constant_value (expr
);
7316 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
7317 inform (loc
, "in template argument for type %qT", type
);
7318 if (expr
== error_mark_node
)
7320 /* else cxx_constant_value complained but gave us
7321 a real constant, so go ahead. */
7322 if (!CONSTANT_CLASS_P (expr
))
7324 /* Some assemble time constant expressions like
7325 (intptr_t)&&lab1 - (intptr_t)&&lab2 or
7326 4 + (intptr_t)&&var satisfy reduced_constant_expression_p
7327 as we can emit them into .rodata initializers of
7328 variables, yet they can't fold into an INTEGER_CST at
7329 compile time. Refuse them here. */
7330 gcc_checking_assert (reduced_constant_expression_p (expr
));
7331 error_at (loc
, "template argument %qE for type %qT not "
7332 "a compile-time constant", expr
, type
);
7340 /* Avoid typedef problems. */
7341 if (TREE_TYPE (expr
) != type
)
7342 expr
= fold_convert (type
, expr
);
7344 /* [temp.arg.nontype]/5, bullet 2
7346 For a non-type template-parameter of type pointer to object,
7347 qualification conversions (_conv.qual_) and the array-to-pointer
7348 conversion (_conv.array_) are applied. */
7349 else if (TYPE_PTROBV_P (type
))
7351 tree decayed
= expr
;
7353 /* Look through any NOP_EXPRs around an ADDR_EXPR, whether they come from
7354 decay_conversion or an explicit cast. If it's a problematic cast,
7355 we'll complain about it below. */
7356 if (TREE_CODE (expr
) == NOP_EXPR
)
7360 if (TREE_CODE (probe
) == ADDR_EXPR
7361 && TYPE_PTR_P (TREE_TYPE (probe
)))
7364 expr_type
= TREE_TYPE (expr
);
7368 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
7370 A template-argument for a non-type, non-template template-parameter
7371 shall be one of: [...]
7373 -- the name of a non-type template-parameter;
7374 -- the address of an object or function with external linkage, [...]
7375 expressed as "& id-expression" where the & is optional if the name
7376 refers to a function or array, or if the corresponding
7377 template-parameter is a reference.
7379 Here, we do not care about functions, as they are invalid anyway
7380 for a parameter of type pointer-to-object. */
7383 /* Non-type template parameters are OK. */
7385 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
7386 /* Null pointer values are OK in C++11. */;
7387 else if (TREE_CODE (expr
) != ADDR_EXPR
7388 && !INDIRECT_TYPE_P (expr_type
))
7389 /* Other values, like integer constants, might be valid
7390 non-type arguments of some other type. */
7391 return error_mark_node
;
7392 else if (invalid_tparm_referent_p (type
, expr
, complain
))
7397 expr
= perform_qualification_conversions (type
, expr
);
7398 if (expr
== error_mark_node
)
7399 return error_mark_node
;
7401 /* [temp.arg.nontype]/5, bullet 3
7403 For a non-type template-parameter of type reference to object, no
7404 conversions apply. The type referred to by the reference may be more
7405 cv-qualified than the (otherwise identical) type of the
7406 template-argument. The template-parameter is bound directly to the
7407 template-argument, which must be an lvalue. */
7408 else if (TYPE_REF_OBJ_P (type
))
7410 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
7412 return error_mark_node
;
7414 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
7416 if (complain
& tf_error
)
7417 error ("%qE is not a valid template argument for type %qT "
7418 "because of conflicts in cv-qualification", expr
, type
);
7422 if (!lvalue_p (expr
))
7424 if (complain
& tf_error
)
7425 error ("%qE is not a valid template argument for type %qT "
7426 "because it is not an lvalue", expr
, type
);
7430 /* [temp.arg.nontype]/1
7432 A template-argument for a non-type, non-template template-parameter
7433 shall be one of: [...]
7435 -- the address of an object or function with external linkage. */
7436 if (INDIRECT_REF_P (expr
)
7437 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
7439 expr
= TREE_OPERAND (expr
, 0);
7442 if (complain
& tf_error
)
7443 error ("%q#D is not a valid template argument for type %qT "
7444 "because a reference variable does not have a constant "
7445 "address", expr
, type
);
7450 if (TYPE_REF_OBJ_P (TREE_TYPE (expr
)) && val_dep_p
)
7451 /* OK, dependent reference. We don't want to ask whether a DECL is
7452 itself value-dependent, since what we want here is its address. */;
7455 expr
= build_address (expr
);
7457 if (invalid_tparm_referent_p (type
, expr
, complain
))
7461 if (!same_type_p (type
, TREE_TYPE (expr
)))
7462 expr
= build_nop (type
, expr
);
7464 /* [temp.arg.nontype]/5, bullet 4
7466 For a non-type template-parameter of type pointer to function, only
7467 the function-to-pointer conversion (_conv.func_) is applied. If the
7468 template-argument represents a set of overloaded functions (or a
7469 pointer to such), the matching function is selected from the set
7471 else if (TYPE_PTRFN_P (type
))
7473 /* If the argument is a template-id, we might not have enough
7474 context information to decay the pointer. */
7475 if (!type_unknown_p (expr_type
))
7477 expr
= decay_conversion (expr
, complain
);
7478 if (expr
== error_mark_node
)
7479 return error_mark_node
;
7482 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
7483 /* Null pointer values are OK in C++11. */
7484 return perform_qualification_conversions (type
, expr
);
7486 expr
= convert_nontype_argument_function (type
, expr
, complain
);
7487 if (!expr
|| expr
== error_mark_node
)
7490 /* [temp.arg.nontype]/5, bullet 5
7492 For a non-type template-parameter of type reference to function, no
7493 conversions apply. If the template-argument represents a set of
7494 overloaded functions, the matching function is selected from the set
7496 else if (TYPE_REFFN_P (type
))
7498 if (TREE_CODE (expr
) == ADDR_EXPR
)
7500 if (complain
& tf_error
)
7502 error ("%qE is not a valid template argument for type %qT "
7503 "because it is a pointer", expr
, type
);
7504 inform (input_location
, "try using %qE instead",
7505 TREE_OPERAND (expr
, 0));
7510 expr
= convert_nontype_argument_function (type
, expr
, complain
);
7511 if (!expr
|| expr
== error_mark_node
)
7514 /* [temp.arg.nontype]/5, bullet 6
7516 For a non-type template-parameter of type pointer to member function,
7517 no conversions apply. If the template-argument represents a set of
7518 overloaded member functions, the matching member function is selected
7519 from the set (_over.over_). */
7520 else if (TYPE_PTRMEMFUNC_P (type
))
7522 expr
= instantiate_type (type
, expr
, tf_none
);
7523 if (expr
== error_mark_node
)
7524 return error_mark_node
;
7526 /* [temp.arg.nontype] bullet 1 says the pointer to member
7527 expression must be a pointer-to-member constant. */
7529 && !check_valid_ptrmem_cst_expr (type
, expr
, complain
))
7532 /* Repeated conversion can't deal with a conversion that turns PTRMEM_CST
7533 into a CONSTRUCTOR, so build up a new PTRMEM_CST instead. */
7534 if (fnptr_conv_p (type
, TREE_TYPE (expr
)))
7535 expr
= make_ptrmem_cst (type
, PTRMEM_CST_MEMBER (expr
));
7537 /* [temp.arg.nontype]/5, bullet 7
7539 For a non-type template-parameter of type pointer to data member,
7540 qualification conversions (_conv.qual_) are applied. */
7541 else if (TYPE_PTRDATAMEM_P (type
))
7543 /* [temp.arg.nontype] bullet 1 says the pointer to member
7544 expression must be a pointer-to-member constant. */
7546 && !check_valid_ptrmem_cst_expr (type
, expr
, complain
))
7549 expr
= perform_qualification_conversions (type
, expr
);
7550 if (expr
== error_mark_node
)
7553 else if (NULLPTR_TYPE_P (type
))
7555 if (!NULLPTR_TYPE_P (TREE_TYPE (expr
)))
7557 if (complain
& tf_error
)
7558 error ("%qE is not a valid template argument for type %qT "
7559 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
7564 else if (CLASS_TYPE_P (type
))
7566 /* Replace the argument with a reference to the corresponding template
7567 parameter object. */
7569 expr
= get_template_parm_object (expr
, complain
);
7570 if (expr
== error_mark_node
)
7573 /* A template non-type parameter must be one of the above. */
7577 /* Sanity check: did we actually convert the argument to the
7579 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7580 (type
, TREE_TYPE (expr
)));
7581 return convert_from_reference (expr
);
7584 /* Subroutine of coerce_template_template_parms, which returns 1 if
7585 PARM_PARM and ARG_PARM match using the rule for the template
7586 parameters of template template parameters. Both PARM and ARG are
7587 template parameters; the rest of the arguments are the same as for
7588 coerce_template_template_parms.
7591 coerce_template_template_parm (tree parm
,
7593 tsubst_flags_t complain
,
7597 if (arg
== NULL_TREE
|| error_operand_p (arg
)
7598 || parm
== NULL_TREE
|| error_operand_p (parm
))
7601 if (TREE_CODE (arg
) != TREE_CODE (parm
))
7604 switch (TREE_CODE (parm
))
7607 /* We encounter instantiations of templates like
7608 template <template <template <class> class> class TT>
7611 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
7612 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
7614 if (!coerce_template_template_parms
7615 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
7621 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
7622 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
7623 /* Argument is a parameter pack but parameter is not. */
7628 /* The tsubst call is used to handle cases such as
7630 template <int> class C {};
7631 template <class T, template <T> class TT> class D {};
7634 i.e. the parameter list of TT depends on earlier parameters. */
7635 if (!uses_template_parms (TREE_TYPE (arg
)))
7637 tree t
= tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
);
7638 if (!uses_template_parms (t
)
7639 && !same_type_p (t
, TREE_TYPE (arg
)))
7643 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
7644 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
7645 /* Argument is a parameter pack but parameter is not. */
7657 /* Coerce template argument list ARGLIST for use with template
7658 template-parameter TEMPL. */
7661 coerce_template_args_for_ttp (tree templ
, tree arglist
,
7662 tsubst_flags_t complain
)
7664 /* Consider an example where a template template parameter declared as
7666 template <class T, class U = std::allocator<T> > class TT
7668 The template parameter level of T and U are one level larger than
7669 of TT. To proper process the default argument of U, say when an
7670 instantiation `TT<int>' is seen, we need to build the full
7671 arguments containing {int} as the innermost level. Outer levels,
7672 available when not appearing as default template argument, can be
7673 obtained from the arguments of the enclosing template.
7675 Suppose that TT is later substituted with std::vector. The above
7676 instantiation is `TT<int, std::allocator<T> >' with TT at
7677 level 1, and T at level 2, while the template arguments at level 1
7678 becomes {std::vector} and the inner level 2 is {int}. */
7680 tree outer
= DECL_CONTEXT (templ
);
7682 outer
= generic_targs_for (outer
);
7683 else if (current_template_parms
)
7685 /* This is an argument of the current template, so we haven't set
7686 DECL_CONTEXT yet. */
7687 tree relevant_template_parms
;
7689 /* Parameter levels that are greater than the level of the given
7690 template template parm are irrelevant. */
7691 relevant_template_parms
= current_template_parms
;
7692 while (TMPL_PARMS_DEPTH (relevant_template_parms
)
7693 != TEMPLATE_TYPE_LEVEL (TREE_TYPE (templ
)))
7694 relevant_template_parms
= TREE_CHAIN (relevant_template_parms
);
7696 outer
= template_parms_to_args (relevant_template_parms
);
7700 arglist
= add_to_template_args (outer
, arglist
);
7702 tree parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
7703 return coerce_template_parms (parmlist
, arglist
, templ
,
7705 /*require_all_args=*/true,
7706 /*use_default_args=*/true);
7709 /* A cache of template template parameters with match-all default
7711 static GTY((deletable
)) hash_map
<tree
,tree
> *defaulted_ttp_cache
;
7713 /* T is a bound template template-parameter. Copy its arguments into default
7714 arguments of the template template-parameter's template parameters. */
7717 add_defaults_to_ttp (tree otmpl
)
7719 if (tree
*c
= hash_map_safe_get (defaulted_ttp_cache
, otmpl
))
7722 tree ntmpl
= copy_node (otmpl
);
7724 tree ntype
= copy_node (TREE_TYPE (otmpl
));
7725 TYPE_STUB_DECL (ntype
) = TYPE_NAME (ntype
) = ntmpl
;
7726 TYPE_MAIN_VARIANT (ntype
) = ntype
;
7727 TYPE_POINTER_TO (ntype
) = TYPE_REFERENCE_TO (ntype
) = NULL_TREE
;
7728 TYPE_NAME (ntype
) = ntmpl
;
7729 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
7731 tree idx
= TEMPLATE_TYPE_PARM_INDEX (ntype
)
7732 = copy_node (TEMPLATE_TYPE_PARM_INDEX (ntype
));
7733 TEMPLATE_PARM_DECL (idx
) = ntmpl
;
7734 TREE_TYPE (ntmpl
) = TREE_TYPE (idx
) = ntype
;
7736 tree oparms
= DECL_TEMPLATE_PARMS (otmpl
);
7737 tree parms
= DECL_TEMPLATE_PARMS (ntmpl
) = copy_node (oparms
);
7738 TREE_CHAIN (parms
) = TREE_CHAIN (oparms
);
7739 tree vec
= TREE_VALUE (parms
) = copy_node (TREE_VALUE (parms
));
7740 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
7742 tree o
= TREE_VEC_ELT (vec
, i
);
7743 if (!template_parameter_pack_p (TREE_VALUE (o
)))
7745 tree n
= TREE_VEC_ELT (vec
, i
) = copy_node (o
);
7746 TREE_PURPOSE (n
) = any_targ_node
;
7750 hash_map_safe_put
<hm_ggc
> (defaulted_ttp_cache
, otmpl
, ntmpl
);
7754 /* ARG is a bound potential template template-argument, and PARGS is a list
7755 of arguments for the corresponding template template-parameter. Adjust
7756 PARGS as appropriate for application to ARG's template, and if ARG is a
7757 BOUND_TEMPLATE_TEMPLATE_PARM, possibly adjust it to add default template
7758 arguments to the template template parameter. */
7761 coerce_ttp_args_for_tta (tree
& arg
, tree pargs
, tsubst_flags_t complain
)
7763 ++processing_template_decl
;
7764 tree arg_tmpl
= TYPE_TI_TEMPLATE (arg
);
7765 if (DECL_TEMPLATE_TEMPLATE_PARM_P (arg_tmpl
))
7767 /* When comparing two template template-parameters in partial ordering,
7768 rewrite the one currently being used as an argument to have default
7769 arguments for all parameters. */
7770 arg_tmpl
= add_defaults_to_ttp (arg_tmpl
);
7771 pargs
= coerce_template_args_for_ttp (arg_tmpl
, pargs
, complain
);
7772 if (pargs
!= error_mark_node
)
7773 arg
= bind_template_template_parm (TREE_TYPE (arg_tmpl
),
7774 TYPE_TI_ARGS (arg
));
7779 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (arg_tmpl
));
7780 pargs
= coerce_template_parms (aparms
, pargs
, arg_tmpl
, complain
,
7781 /*require_all*/true,
7782 /*use_default*/true);
7784 --processing_template_decl
;
7788 /* Subroutine of unify for the case when PARM is a
7789 BOUND_TEMPLATE_TEMPLATE_PARM. */
7792 unify_bound_ttp_args (tree tparms
, tree targs
, tree parm
, tree
& arg
,
7795 tree parmvec
= TYPE_TI_ARGS (parm
);
7796 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
7798 /* The template template parm might be variadic and the argument
7799 not, so flatten both argument lists. */
7800 parmvec
= expand_template_argument_pack (parmvec
);
7801 argvec
= expand_template_argument_pack (argvec
);
7805 /* In keeping with P0522R0, adjust P's template arguments
7806 to apply to A's template; then flatten it again. */
7807 tree nparmvec
= coerce_ttp_args_for_tta (arg
, parmvec
, tf_none
);
7808 nparmvec
= expand_template_argument_pack (nparmvec
);
7810 if (unify (tparms
, targs
, nparmvec
, argvec
,
7811 UNIFY_ALLOW_NONE
, explain_p
))
7814 /* If the P0522 adjustment eliminated a pack expansion, deduce
7817 && TREE_VEC_LENGTH (nparmvec
) < TREE_VEC_LENGTH (parmvec
)
7818 && unify_pack_expansion (tparms
, targs
, parmvec
, argvec
,
7819 DEDUCE_EXACT
, /*sub*/true, explain_p
))
7824 /* Deduce arguments T, i from TT<T> or TT<i>.
7825 We check each element of PARMVEC and ARGVEC individually
7826 rather than the whole TREE_VEC since they can have
7827 different number of elements, which is allowed under N2555. */
7829 int len
= TREE_VEC_LENGTH (parmvec
);
7831 /* Check if the parameters end in a pack, making them
7833 int parm_variadic_p
= 0;
7835 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
7836 parm_variadic_p
= 1;
7838 for (int i
= 0; i
< len
- parm_variadic_p
; ++i
)
7839 /* If the template argument list of P contains a pack
7840 expansion that is not the last template argument, the
7841 entire template argument list is a non-deduced
7843 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
7844 return unify_success (explain_p
);
7846 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
7847 return unify_too_few_arguments (explain_p
,
7848 TREE_VEC_LENGTH (argvec
), len
);
7850 for (int i
= 0; i
< len
- parm_variadic_p
; ++i
)
7851 if (unify (tparms
, targs
,
7852 TREE_VEC_ELT (parmvec
, i
),
7853 TREE_VEC_ELT (argvec
, i
),
7854 UNIFY_ALLOW_NONE
, explain_p
))
7858 && unify_pack_expansion (tparms
, targs
,
7861 /*subr=*/true, explain_p
))
7868 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
7869 template template parameters. Both PARM_PARMS and ARG_PARMS are
7870 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
7873 Consider the example:
7874 template <class T> class A;
7875 template<template <class U> class TT> class B;
7877 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
7878 the parameters to A, and OUTER_ARGS contains A. */
7881 coerce_template_template_parms (tree parm_parms
,
7883 tsubst_flags_t complain
,
7887 int nparms
, nargs
, i
;
7891 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
7892 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
7894 nparms
= TREE_VEC_LENGTH (parm_parms
);
7895 nargs
= TREE_VEC_LENGTH (arg_parms
);
7899 /* P0522R0: A template template-parameter P is at least as specialized as
7900 a template template-argument A if, given the following rewrite to two
7901 function templates, the function template corresponding to P is at
7902 least as specialized as the function template corresponding to A
7903 according to the partial ordering rules for function templates
7904 ([temp.func.order]). Given an invented class template X with the
7905 template parameter list of A (including default arguments):
7907 * Each of the two function templates has the same template parameters,
7908 respectively, as P or A.
7910 * Each function template has a single function parameter whose type is
7911 a specialization of X with template arguments corresponding to the
7912 template parameters from the respective function template where, for
7913 each template parameter PP in the template parameter list of the
7914 function template, a corresponding template argument AA is formed. If
7915 PP declares a parameter pack, then AA is the pack expansion
7916 PP... ([temp.variadic]); otherwise, AA is the id-expression PP.
7918 If the rewrite produces an invalid type, then P is not at least as
7919 specialized as A. */
7921 /* So coerce P's args to apply to A's parms, and then deduce between A's
7922 args and the converted args. If that succeeds, A is at least as
7923 specialized as P, so they match.*/
7924 tree pargs
= template_parms_level_to_args (parm_parms
);
7925 pargs
= add_outermost_template_args (outer_args
, pargs
);
7926 ++processing_template_decl
;
7927 pargs
= coerce_template_parms (arg_parms
, pargs
, NULL_TREE
, tf_none
,
7928 /*require_all*/true, /*use_default*/true);
7929 --processing_template_decl
;
7930 if (pargs
!= error_mark_node
)
7932 tree targs
= make_tree_vec (nargs
);
7933 tree aargs
= template_parms_level_to_args (arg_parms
);
7934 if (!unify (arg_parms
, targs
, aargs
, pargs
, UNIFY_ALLOW_NONE
,
7940 /* Determine whether we have a parameter pack at the end of the
7941 template template parameter's template parameter list. */
7942 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
7944 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
7946 if (error_operand_p (parm
))
7949 switch (TREE_CODE (parm
))
7953 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
7958 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
7968 && !(variadic_p
&& nargs
>= nparms
- 1))
7971 /* Check all of the template parameters except the parameter pack at
7972 the end (if any). */
7973 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
7975 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
7976 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
7979 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
7980 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
7982 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
7990 /* Check each of the template parameters in the template
7991 argument against the template parameter pack at the end of
7992 the template template parameter. */
7993 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
7996 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
7998 for (; i
< nargs
; ++i
)
8000 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
8003 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
8005 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
8014 /* Verifies that the deduced template arguments (in TARGS) for the
8015 template template parameters (in TPARMS) represent valid bindings,
8016 by comparing the template parameter list of each template argument
8017 to the template parameter list of its corresponding template
8018 template parameter, in accordance with DR150. This
8019 routine can only be called after all template arguments have been
8020 deduced. It will return TRUE if all of the template template
8021 parameter bindings are okay, FALSE otherwise. */
8023 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
8025 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
8028 /* We're dealing with template parms in this process. */
8029 ++processing_template_decl
;
8031 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
8033 for (i
= 0; i
< ntparms
; ++i
)
8035 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
8036 tree targ
= TREE_VEC_ELT (targs
, i
);
8038 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
8040 tree packed_args
= NULL_TREE
;
8043 if (ARGUMENT_PACK_P (targ
))
8045 /* Look inside the argument pack. */
8046 packed_args
= ARGUMENT_PACK_ARGS (targ
);
8047 len
= TREE_VEC_LENGTH (packed_args
);
8050 for (idx
= 0; idx
< len
; ++idx
)
8052 tree targ_parms
= NULL_TREE
;
8055 /* Extract the next argument from the argument
8057 targ
= TREE_VEC_ELT (packed_args
, idx
);
8059 if (PACK_EXPANSION_P (targ
))
8060 /* Look at the pattern of the pack expansion. */
8061 targ
= PACK_EXPANSION_PATTERN (targ
);
8063 /* Extract the template parameters from the template
8065 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
8066 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
8067 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
8068 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
8070 /* Verify that we can coerce the template template
8071 parameters from the template argument to the template
8072 parameter. This requires an exact match. */
8074 && !coerce_template_template_parms
8075 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
8090 --processing_template_decl
;
8094 /* Since type attributes aren't mangled, we need to strip them from
8095 template type arguments. */
8098 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
8100 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
8102 bool removed_attributes
= false;
8103 tree canon
= strip_typedefs (arg
, &removed_attributes
);
8104 if (removed_attributes
8105 && (complain
& tf_warning
))
8106 warning (OPT_Wignored_attributes
,
8107 "ignoring attributes on template argument %qT", arg
);
8111 /* And from inside dependent non-type arguments like sizeof(Type). */
8114 canonicalize_expr_argument (tree arg
, tsubst_flags_t complain
)
8116 if (!arg
|| arg
== error_mark_node
)
8118 bool removed_attributes
= false;
8119 tree canon
= strip_typedefs_expr (arg
, &removed_attributes
);
8120 if (removed_attributes
8121 && (complain
& tf_warning
))
8122 warning (OPT_Wignored_attributes
,
8123 "ignoring attributes in template argument %qE", arg
);
8127 // A template declaration can be substituted for a constrained
8128 // template template parameter only when the argument is more
8129 // constrained than the parameter.
8131 is_compatible_template_arg (tree parm
, tree arg
)
8133 tree parm_cons
= get_constraints (parm
);
8135 /* For now, allow constrained template template arguments
8136 and unconstrained template template parameters. */
8137 if (parm_cons
== NULL_TREE
)
8140 /* If the template parameter is constrained, we need to rewrite its
8141 constraints in terms of the ARG's template parameters. This ensures
8142 that all of the template parameter types will have the same depth.
8144 Note that this is only valid when coerce_template_template_parm is
8145 true for the innermost template parameters of PARM and ARG. In other
8146 words, because coercion is successful, this conversion will be valid. */
8147 tree new_args
= NULL_TREE
;
8150 tree aparms
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
8151 new_args
= template_parms_level_to_args (aparms
);
8152 parm_cons
= tsubst_constraint_info (parm_cons
, new_args
,
8153 tf_none
, NULL_TREE
);
8154 if (parm_cons
== error_mark_node
)
8158 return weakly_subsumes (parm_cons
, new_args
, arg
);
8161 // Convert a placeholder argument into a binding to the original
8162 // parameter. The original parameter is saved as the TREE_TYPE of
8165 convert_wildcard_argument (tree parm
, tree arg
)
8167 TREE_TYPE (arg
) = parm
;
8171 /* We can't fully resolve ARG given as a non-type template argument to TYPE,
8172 because one of them is dependent. But we need to represent the
8173 conversion for the benefit of cp_tree_equal. */
8176 maybe_convert_nontype_argument (tree type
, tree arg
)
8178 /* Auto parms get no conversion. */
8179 if (type_uses_auto (type
))
8181 /* We don't need or want to add this conversion now if we're going to use the
8182 argument for deduction. */
8183 if (value_dependent_expression_p (arg
))
8186 type
= cv_unqualified (type
);
8187 tree argtype
= TREE_TYPE (arg
);
8188 if (same_type_p (type
, argtype
))
8191 arg
= build1 (IMPLICIT_CONV_EXPR
, type
, arg
);
8192 IMPLICIT_CONV_EXPR_NONTYPE_ARG (arg
) = true;
8196 /* Convert the indicated template ARG as necessary to match the
8197 indicated template PARM. Returns the converted ARG, or
8198 error_mark_node if the conversion was unsuccessful. Error and
8199 warning messages are issued under control of COMPLAIN. This
8200 conversion is for the Ith parameter in the parameter list. ARGS is
8201 the full set of template arguments deduced so far. */
8204 convert_template_argument (tree parm
,
8207 tsubst_flags_t complain
,
8213 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
8215 if (parm
== error_mark_node
|| error_operand_p (arg
))
8216 return error_mark_node
;
8218 /* Trivially convert placeholders. */
8219 if (TREE_CODE (arg
) == WILDCARD_DECL
)
8220 return convert_wildcard_argument (parm
, arg
);
8222 if (arg
== any_targ_node
)
8225 if (TREE_CODE (arg
) == TREE_LIST
8226 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
8228 /* The template argument was the name of some
8229 member function. That's usually
8230 invalid, but static members are OK. In any
8231 case, grab the underlying fields/functions
8232 and issue an error later if required. */
8233 TREE_TYPE (arg
) = unknown_type_node
;
8238 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
8239 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
8240 || requires_tmpl_type
);
8242 /* When determining whether an argument pack expansion is a template,
8243 look at the pattern. */
8244 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
8245 arg
= PACK_EXPANSION_PATTERN (arg
);
8247 /* Deal with an injected-class-name used as a template template arg. */
8248 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
8250 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
8251 if (TREE_CODE (t
) == TEMPLATE_DECL
)
8253 if (cxx_dialect
>= cxx11
)
8254 /* OK under DR 1004. */;
8255 else if (complain
& tf_warning_or_error
)
8256 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
8257 " used as template template argument", TYPE_NAME (arg
));
8258 else if (flag_pedantic_errors
)
8266 ((TREE_CODE (arg
) == TEMPLATE_DECL
8267 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
8268 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
8269 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
8270 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
8273 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
8274 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
8275 arg
= TYPE_STUB_DECL (arg
);
8277 is_type
= TYPE_P (arg
) || is_tmpl_type
;
8279 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
8280 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
8282 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
8284 if (complain
& tf_error
)
8285 error ("invalid use of destructor %qE as a type", orig_arg
);
8286 return error_mark_node
;
8289 permerror (input_location
,
8290 "to refer to a type member of a template parameter, "
8291 "use %<typename %E%>", orig_arg
);
8293 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
8294 TREE_OPERAND (arg
, 1),
8300 if (is_type
!= requires_type
)
8304 if (complain
& tf_error
)
8306 error ("type/value mismatch at argument %d in template "
8307 "parameter list for %qD",
8311 /* The template argument is a type, but we're expecting
8313 inform (input_location
,
8314 " expected a constant of type %qT, got %qT",
8316 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
8317 /* [temp.arg]/2: "In a template-argument, an ambiguity
8318 between a type-id and an expression is resolved to a
8319 type-id, regardless of the form of the corresponding
8320 template-parameter." So give the user a clue. */
8321 if (TREE_CODE (arg
) == FUNCTION_TYPE
)
8322 inform (input_location
, " ambiguous template argument "
8323 "for non-type template parameter is treated as "
8326 else if (requires_tmpl_type
)
8327 inform (input_location
,
8328 " expected a class template, got %qE", orig_arg
);
8330 inform (input_location
,
8331 " expected a type, got %qE", orig_arg
);
8334 return error_mark_node
;
8336 if (is_tmpl_type
^ requires_tmpl_type
)
8338 if (in_decl
&& (complain
& tf_error
))
8340 error ("type/value mismatch at argument %d in template "
8341 "parameter list for %qD",
8344 inform (input_location
,
8345 " expected a type, got %qT", DECL_NAME (arg
));
8347 inform (input_location
,
8348 " expected a class template, got %qT", orig_arg
);
8350 return error_mark_node
;
8353 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
8354 /* We already did the appropriate conversion when packing args. */
8358 if (requires_tmpl_type
)
8360 if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
8361 /* The number of argument required is not known yet.
8362 Just accept it for now. */
8366 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
8369 /* Strip alias templates that are equivalent to another
8371 arg
= get_underlying_template (arg
);
8372 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
8374 if (coerce_template_template_parms (parmparm
, argparm
,
8380 /* TEMPLATE_TEMPLATE_PARM node is preferred over
8382 if (val
!= error_mark_node
)
8384 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
8385 val
= TREE_TYPE (val
);
8386 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
8387 val
= make_pack_expansion (val
, complain
);
8392 if (in_decl
&& (complain
& tf_error
))
8394 error ("type/value mismatch at argument %d in "
8395 "template parameter list for %qD",
8397 inform (input_location
,
8398 " expected a template of type %qD, got %qT",
8402 val
= error_mark_node
;
8405 // Check that the constraints are compatible before allowing the
8407 if (val
!= error_mark_node
)
8408 if (!is_compatible_template_arg (parm
, arg
))
8410 if (in_decl
&& (complain
& tf_error
))
8412 error ("constraint mismatch at argument %d in "
8413 "template parameter list for %qD",
8415 inform (input_location
, " expected %qD but got %qD",
8418 val
= error_mark_node
;
8424 /* We only form one instance of each template specialization.
8425 Therefore, if we use a non-canonical variant (i.e., a
8426 typedef), any future messages referring to the type will use
8427 the typedef, which is confusing if those future uses do not
8428 themselves also use the typedef. */
8430 val
= canonicalize_type_argument (val
, complain
);
8434 tree t
= TREE_TYPE (parm
);
8436 if (TEMPLATE_PARM_LEVEL (get_template_parm_index (parm
))
8437 > TMPL_ARGS_DEPTH (args
))
8438 /* We don't have enough levels of args to do any substitution. This
8439 can happen in the context of -fnew-ttp-matching. */;
8440 else if (tree a
= type_uses_auto (t
))
8442 t
= do_auto_deduction (t
, arg
, a
, complain
, adc_unify
, args
);
8443 if (t
== error_mark_node
)
8444 return error_mark_node
;
8447 t
= tsubst (t
, args
, complain
, in_decl
);
8449 if (invalid_nontype_parm_type_p (t
, complain
))
8450 return error_mark_node
;
8452 if (t
!= TREE_TYPE (parm
))
8453 t
= canonicalize_type_argument (t
, complain
);
8455 if (!type_dependent_expression_p (orig_arg
)
8456 && !uses_template_parms (t
))
8457 /* We used to call digest_init here. However, digest_init
8458 will report errors, which we don't want when complain
8459 is zero. More importantly, digest_init will try too
8460 hard to convert things: for example, `0' should not be
8461 converted to pointer type at this point according to
8462 the standard. Accepting this is not merely an
8463 extension, since deciding whether or not these
8464 conversions can occur is part of determining which
8465 function template to call, or whether a given explicit
8466 argument specification is valid. */
8467 val
= convert_nontype_argument (t
, orig_arg
, complain
);
8470 val
= canonicalize_expr_argument (orig_arg
, complain
);
8471 val
= maybe_convert_nontype_argument (t
, val
);
8475 if (val
== NULL_TREE
)
8476 val
= error_mark_node
;
8477 else if (val
== error_mark_node
&& (complain
& tf_error
))
8478 error_at (cp_expr_loc_or_input_loc (orig_arg
),
8479 "could not convert template argument %qE from %qT to %qT",
8480 orig_arg
, TREE_TYPE (orig_arg
), t
);
8482 if (INDIRECT_REF_P (val
))
8484 /* Reject template arguments that are references to built-in
8485 functions with no library fallbacks. */
8486 const_tree inner
= TREE_OPERAND (val
, 0);
8487 const_tree innertype
= TREE_TYPE (inner
);
8489 && TYPE_REF_P (innertype
)
8490 && TREE_CODE (TREE_TYPE (innertype
)) == FUNCTION_TYPE
8491 && TREE_OPERAND_LENGTH (inner
) > 0
8492 && reject_gcc_builtin (TREE_OPERAND (inner
, 0)))
8493 return error_mark_node
;
8496 if (TREE_CODE (val
) == SCOPE_REF
)
8498 /* Strip typedefs from the SCOPE_REF. */
8499 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
8500 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
8502 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
8503 QUALIFIED_NAME_IS_TEMPLATE (val
));
8510 /* Coerces the remaining template arguments in INNER_ARGS (from
8511 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
8512 Returns the coerced argument pack. PARM_IDX is the position of this
8513 parameter in the template parameter list. ARGS is the original
8514 template argument list. */
8516 coerce_template_parameter_pack (tree parms
,
8524 tsubst_flags_t complain
)
8526 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
8527 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
8530 tree packed_parms
= NULL_TREE
;
8532 if (arg_idx
> nargs
)
8535 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
8537 /* When the template parameter is a non-type template parameter pack
8538 or template template parameter pack whose type or template
8539 parameters use parameter packs, we know exactly how many arguments
8540 we are looking for. Build a vector of the instantiated decls for
8541 these template parameters in PACKED_PARMS. */
8542 /* We can't use make_pack_expansion here because it would interpret a
8543 _DECL as a use rather than a declaration. */
8544 tree decl
= TREE_VALUE (parm
);
8545 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
8546 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
8547 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
8548 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
8550 TREE_VEC_LENGTH (args
)--;
8551 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
8552 TREE_VEC_LENGTH (args
)++;
8554 if (packed_parms
== error_mark_node
)
8555 return error_mark_node
;
8557 /* If we're doing a partial instantiation of a member template,
8558 verify that all of the types used for the non-type
8559 template parameter pack are, in fact, valid for non-type
8560 template parameters. */
8562 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
8564 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
8565 for (j
= 0; j
< len
; ++j
)
8567 tree t
= TREE_VEC_ELT (packed_parms
, j
);
8568 if (TREE_CODE (t
) == PARM_DECL
8569 && invalid_nontype_parm_type_p (TREE_TYPE (t
), complain
))
8570 return error_mark_node
;
8572 /* We don't know how many args we have yet, just
8573 use the unconverted ones for now. */
8577 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
8579 /* Check if we have a placeholder pack, which indicates we're
8580 in the context of a introduction list. In that case we want
8581 to match this pack to the single placeholder. */
8582 else if (arg_idx
< nargs
8583 && TREE_CODE (TREE_VEC_ELT (inner_args
, arg_idx
)) == WILDCARD_DECL
8584 && WILDCARD_PACK_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
8586 nargs
= arg_idx
+ 1;
8587 packed_args
= make_tree_vec (1);
8590 packed_args
= make_tree_vec (nargs
- arg_idx
);
8592 /* Convert the remaining arguments, which will be a part of the
8593 parameter pack "parm". */
8594 int first_pack_arg
= arg_idx
;
8595 for (; arg_idx
< nargs
; ++arg_idx
)
8597 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
8598 tree actual_parm
= TREE_VALUE (parm
);
8599 int pack_idx
= arg_idx
- first_pack_arg
;
8603 /* Once we've packed as many args as we have types, stop. */
8604 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
8606 else if (PACK_EXPANSION_P (arg
))
8607 /* We don't know how many args we have yet, just
8608 use the unconverted ones for now. */
8611 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
8614 if (arg
== error_mark_node
)
8616 if (complain
& tf_error
)
8617 error ("template argument %d is invalid", arg_idx
+ 1);
8620 arg
= convert_template_argument (actual_parm
,
8621 arg
, new_args
, complain
, parm_idx
,
8623 if (arg
== error_mark_node
)
8625 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
8628 if (arg_idx
- first_pack_arg
< TREE_VEC_LENGTH (packed_args
)
8629 && TREE_VEC_LENGTH (packed_args
) > 0)
8631 if (complain
& tf_error
)
8632 error ("wrong number of template arguments (%d, should be %d)",
8633 arg_idx
- first_pack_arg
, TREE_VEC_LENGTH (packed_args
));
8634 return error_mark_node
;
8637 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
8638 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
8639 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
8642 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
8643 TREE_CONSTANT (argument_pack
) = 1;
8646 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
8648 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
8649 TREE_VEC_LENGTH (packed_args
));
8650 return argument_pack
;
8653 /* Returns the number of pack expansions in the template argument vector
8657 pack_expansion_args_count (tree args
)
8662 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
8664 tree elt
= TREE_VEC_ELT (args
, i
);
8665 if (elt
&& PACK_EXPANSION_P (elt
))
8671 /* Convert all template arguments to their appropriate types, and
8672 return a vector containing the innermost resulting template
8673 arguments. If any error occurs, return error_mark_node. Error and
8674 warning messages are issued under control of COMPLAIN.
8676 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
8677 for arguments not specified in ARGS. Otherwise, if
8678 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
8679 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
8680 USE_DEFAULT_ARGS is false, then all arguments must be specified in
8684 coerce_template_parms (tree parms
,
8687 tsubst_flags_t complain
,
8688 bool require_all_args
,
8689 bool use_default_args
)
8691 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
8692 tree orig_inner_args
;
8695 tree new_inner_args
;
8697 /* When used as a boolean value, indicates whether this is a
8698 variadic template parameter list. Since it's an int, we can also
8699 subtract it from nparms to get the number of non-variadic
8702 int variadic_args_p
= 0;
8703 int post_variadic_parms
= 0;
8705 /* Adjustment to nparms for fixed parameter packs. */
8706 int fixed_pack_adjust
= 0;
8707 int fixed_packs
= 0;
8710 /* Likewise for parameters with default arguments. */
8713 if (args
== error_mark_node
)
8714 return error_mark_node
;
8716 nparms
= TREE_VEC_LENGTH (parms
);
8718 /* Determine if there are any parameter packs or default arguments. */
8719 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
8721 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
8723 ++post_variadic_parms
;
8724 if (template_parameter_pack_p (TREE_VALUE (parm
)))
8726 if (TREE_PURPOSE (parm
))
8730 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
8731 /* If there are no parameters that follow a parameter pack, we need to
8732 expand any argument packs so that we can deduce a parameter pack from
8733 some non-packed args followed by an argument pack, as in variadic85.C.
8734 If there are such parameters, we need to leave argument packs intact
8735 so the arguments are assigned properly. This can happen when dealing
8736 with a nested class inside a partial specialization of a class
8737 template, as in variadic92.C, or when deducing a template parameter pack
8738 from a sub-declarator, as in variadic114.C. */
8739 if (!post_variadic_parms
)
8740 inner_args
= expand_template_argument_pack (inner_args
);
8742 /* Count any pack expansion args. */
8743 variadic_args_p
= pack_expansion_args_count (inner_args
);
8745 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
8746 if ((nargs
- variadic_args_p
> nparms
&& !variadic_p
)
8747 || (nargs
< nparms
- variadic_p
8750 && (!use_default_args
8751 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
8752 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
8755 if (complain
& tf_error
)
8757 if (variadic_p
|| default_p
)
8759 nparms
-= variadic_p
+ default_p
;
8760 error ("wrong number of template arguments "
8761 "(%d, should be at least %d)", nargs
, nparms
);
8764 error ("wrong number of template arguments "
8765 "(%d, should be %d)", nargs
, nparms
);
8768 inform (DECL_SOURCE_LOCATION (in_decl
),
8769 "provided for %qD", in_decl
);
8772 return error_mark_node
;
8774 /* We can't pass a pack expansion to a non-pack parameter of an alias
8775 template (DR 1430). */
8777 && (DECL_ALIAS_TEMPLATE_P (in_decl
)
8778 || concept_definition_p (in_decl
))
8780 && nargs
- variadic_args_p
< nparms
- variadic_p
)
8782 if (complain
& tf_error
)
8784 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
8786 tree arg
= TREE_VEC_ELT (inner_args
, i
);
8787 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
8789 if (PACK_EXPANSION_P (arg
)
8790 && !template_parameter_pack_p (parm
))
8792 if (DECL_ALIAS_TEMPLATE_P (in_decl
))
8793 error_at (location_of (arg
),
8794 "pack expansion argument for non-pack parameter "
8795 "%qD of alias template %qD", parm
, in_decl
);
8797 error_at (location_of (arg
),
8798 "pack expansion argument for non-pack parameter "
8799 "%qD of concept %qD", parm
, in_decl
);
8800 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
8807 return error_mark_node
;
8810 /* We need to evaluate the template arguments, even though this
8811 template-id may be nested within a "sizeof". */
8814 new_inner_args
= make_tree_vec (nparms
);
8815 new_args
= add_outermost_template_args (args
, new_inner_args
);
8816 int pack_adjust
= 0;
8817 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
8822 /* Get the Ith template parameter. */
8823 parm
= TREE_VEC_ELT (parms
, parm_idx
);
8825 if (parm
== error_mark_node
)
8827 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
8831 /* Calculate the next argument. */
8832 if (arg_idx
< nargs
)
8833 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
8837 if (template_parameter_pack_p (TREE_VALUE (parm
))
8838 && (arg
|| require_all_args
|| !(complain
& tf_partial
))
8839 && !(arg
&& ARGUMENT_PACK_P (arg
)))
8841 /* Some arguments will be placed in the
8842 template parameter pack PARM. */
8843 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
8844 inner_args
, arg_idx
,
8848 if (arg
== NULL_TREE
)
8850 /* We don't know how many args we have yet, just use the
8851 unconverted (and still packed) ones for now. */
8852 new_inner_args
= orig_inner_args
;
8857 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
8859 /* Store this argument. */
8860 if (arg
== error_mark_node
)
8863 /* We are done with all of the arguments. */
8869 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
8870 arg_idx
+= pack_adjust
;
8871 if (fixed_parameter_pack_p (TREE_VALUE (parm
)))
8874 fixed_pack_adjust
+= pack_adjust
;
8882 if (PACK_EXPANSION_P (arg
))
8884 /* "If every valid specialization of a variadic template
8885 requires an empty template parameter pack, the template is
8886 ill-formed, no diagnostic required." So check that the
8887 pattern works with this parameter. */
8888 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
8889 tree conv
= convert_template_argument (TREE_VALUE (parm
),
8893 if (conv
== error_mark_node
)
8895 if (complain
& tf_error
)
8896 inform (input_location
, "so any instantiation with a "
8897 "non-empty parameter pack would be ill-formed");
8900 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
8901 /* Recover from missing typename. */
8902 TREE_VEC_ELT (inner_args
, arg_idx
)
8903 = make_pack_expansion (conv
, complain
);
8905 /* We don't know how many args we have yet, just
8906 use the unconverted ones for now. */
8907 new_inner_args
= inner_args
;
8912 else if (require_all_args
)
8914 /* There must be a default arg in this case. */
8915 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
8917 /* The position of the first default template argument,
8918 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
8920 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
8921 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
8922 arg_idx
- pack_adjust
);
8927 if (arg
== error_mark_node
)
8929 if (complain
& tf_error
)
8930 error ("template argument %d is invalid", arg_idx
+ 1);
8934 /* This can occur if there was an error in the template
8935 parameter list itself (which we would already have
8936 reported) that we are trying to recover from, e.g., a class
8937 template with a parameter list such as
8938 template<typename..., typename> (cpp0x/variadic150.C). */
8941 /* This can also happen with a fixed parameter pack (71834). */
8942 if (arg_idx
>= nargs
)
8946 arg
= convert_template_argument (TREE_VALUE (parm
),
8947 arg
, new_args
, complain
,
8950 if (arg
== error_mark_node
)
8953 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
8956 if (missing
|| arg_idx
< nargs
- variadic_args_p
)
8958 /* If we had fixed parameter packs, we didn't know how many arguments we
8959 actually needed earlier; now we do. */
8960 nparms
+= fixed_pack_adjust
;
8961 variadic_p
-= fixed_packs
;
8965 if (arg_idx
< nargs
)
8967 /* We had some pack expansion arguments that will only work if the packs
8968 are empty, but wait until instantiation time to complain.
8969 See variadic-ttp3.C. */
8971 /* Except that we can't provide empty packs to alias templates or
8972 concepts when there are no corresponding parameters. Basically,
8973 we can get here with this:
8975 template<typename T> concept C = true;
8977 template<typename... Args>
8981 When parsing C<Args...>, we try to form a concept check of
8982 C<?, Args...>. Without the extra check for substituting an empty
8983 pack past the last parameter, we can accept the check as valid.
8985 FIXME: This may be valid for alias templates (but I doubt it).
8987 FIXME: The error could be better also. */
8988 if (in_decl
&& concept_definition_p (in_decl
))
8990 if (complain
& tf_error
)
8991 error_at (location_of (TREE_VEC_ELT (args
, arg_idx
)),
8992 "too many arguments");
8993 return error_mark_node
;
8996 int len
= nparms
+ (nargs
- arg_idx
);
8997 tree args
= make_tree_vec (len
);
8999 for (; i
< nparms
; ++i
)
9000 TREE_VEC_ELT (args
, i
) = TREE_VEC_ELT (new_inner_args
, i
);
9001 for (; i
< len
; ++i
, ++arg_idx
)
9002 TREE_VEC_ELT (args
, i
) = TREE_VEC_ELT (inner_args
,
9003 arg_idx
- pack_adjust
);
9004 new_inner_args
= args
;
9009 gcc_assert (!(complain
& tf_error
) || seen_error ());
9010 return error_mark_node
;
9013 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
9014 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
9015 TREE_VEC_LENGTH (new_inner_args
));
9017 return new_inner_args
;
9020 /* Convert all template arguments to their appropriate types, and
9021 return a vector containing the innermost resulting template
9022 arguments. If any error occurs, return error_mark_node. Error and
9023 warning messages are not issued.
9025 Note that no function argument deduction is performed, and default
9026 arguments are used to fill in unspecified arguments. */
9028 coerce_template_parms (tree parms
, tree args
, tree in_decl
)
9030 return coerce_template_parms (parms
, args
, in_decl
, tf_none
, true, true);
9033 /* Convert all template arguments to their appropriate type, and
9034 instantiate default arguments as needed. This returns a vector
9035 containing the innermost resulting template arguments, or
9036 error_mark_node if unsuccessful. */
9038 coerce_template_parms (tree parms
, tree args
, tree in_decl
,
9039 tsubst_flags_t complain
)
9041 return coerce_template_parms (parms
, args
, in_decl
, complain
, true, true);
9044 /* Like coerce_template_parms. If PARMS represents all template
9045 parameters levels, this function returns a vector of vectors
9046 representing all the resulting argument levels. Note that in this
9047 case, only the innermost arguments are coerced because the
9048 outermost ones are supposed to have been coerced already.
9050 Otherwise, if PARMS represents only (the innermost) vector of
9051 parameters, this function returns a vector containing just the
9052 innermost resulting arguments. */
9055 coerce_innermost_template_parms (tree parms
,
9058 tsubst_flags_t complain
,
9059 bool require_all_args
,
9060 bool use_default_args
)
9062 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
9063 int args_depth
= TMPL_ARGS_DEPTH (args
);
9066 if (parms_depth
> 1)
9068 coerced_args
= make_tree_vec (parms_depth
);
9072 for (level
= parms
, cur_depth
= parms_depth
;
9073 parms_depth
> 0 && level
!= NULL_TREE
;
9074 level
= TREE_CHAIN (level
), --cur_depth
)
9077 if (cur_depth
== args_depth
)
9078 l
= coerce_template_parms (TREE_VALUE (level
),
9079 args
, in_decl
, complain
,
9083 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
9085 if (l
== error_mark_node
)
9086 return error_mark_node
;
9088 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
9092 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
9093 args
, in_decl
, complain
,
9096 return coerced_args
;
9099 /* Returns true if T is a wrapper to make a C++20 template parameter
9103 class_nttp_const_wrapper_p (tree t
)
9105 if (cxx_dialect
< cxx20
)
9107 return (TREE_CODE (t
) == VIEW_CONVERT_EXPR
9108 && CP_TYPE_CONST_P (TREE_TYPE (t
))
9109 && TREE_CODE (TREE_OPERAND (t
, 0)) == TEMPLATE_PARM_INDEX
);
9112 /* Returns 1 if template args OT and NT are equivalent. */
9115 template_args_equal (tree ot
, tree nt
, bool partial_order
/* = false */)
9119 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
9121 if (nt
== any_targ_node
|| ot
== any_targ_node
)
9124 if (class_nttp_const_wrapper_p (nt
))
9125 nt
= TREE_OPERAND (nt
, 0);
9126 if (class_nttp_const_wrapper_p (ot
))
9127 ot
= TREE_OPERAND (ot
, 0);
9129 if (TREE_CODE (nt
) == TREE_VEC
|| TREE_CODE (ot
) == TREE_VEC
)
9130 /* For member templates */
9131 return TREE_CODE (ot
) == TREE_CODE (nt
) && comp_template_args (ot
, nt
);
9132 else if (PACK_EXPANSION_P (ot
) || PACK_EXPANSION_P (nt
))
9133 return (PACK_EXPANSION_P (ot
) && PACK_EXPANSION_P (nt
)
9134 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
9135 PACK_EXPANSION_PATTERN (nt
))
9136 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
9137 PACK_EXPANSION_EXTRA_ARGS (nt
)));
9138 else if (ARGUMENT_PACK_P (ot
) || ARGUMENT_PACK_P (nt
))
9139 return cp_tree_equal (ot
, nt
);
9140 else if (TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
9142 else if (TYPE_P (nt
) || TYPE_P (ot
))
9144 if (!(TYPE_P (nt
) && TYPE_P (ot
)))
9146 /* Don't treat an alias template specialization with dependent
9147 arguments as equivalent to its underlying type when used as a
9148 template argument; we need them to be distinct so that we
9149 substitute into the specialization arguments at instantiation
9150 time. And aliases can't be equivalent without being ==, so
9151 we don't need to look any deeper.
9153 During partial ordering, however, we need to treat them normally so
9154 that we can order uses of the same alias with different
9155 cv-qualification (79960). */
9157 && (TYPE_ALIAS_P (nt
) || TYPE_ALIAS_P (ot
)))
9160 return same_type_p (ot
, nt
);
9164 /* Try to treat a template non-type argument that has been converted
9165 to the parameter type as equivalent to one that hasn't yet. */
9166 for (enum tree_code code1
= TREE_CODE (ot
);
9167 CONVERT_EXPR_CODE_P (code1
)
9168 || code1
== NON_LVALUE_EXPR
;
9169 code1
= TREE_CODE (ot
))
9170 ot
= TREE_OPERAND (ot
, 0);
9172 for (enum tree_code code2
= TREE_CODE (nt
);
9173 CONVERT_EXPR_CODE_P (code2
)
9174 || code2
== NON_LVALUE_EXPR
;
9175 code2
= TREE_CODE (nt
))
9176 nt
= TREE_OPERAND (nt
, 0);
9178 return cp_tree_equal (ot
, nt
);
9182 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
9183 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
9184 NEWARG_PTR with the offending arguments if they are non-NULL. */
9187 comp_template_args (tree oldargs
, tree newargs
,
9188 tree
*oldarg_ptr
, tree
*newarg_ptr
,
9193 if (oldargs
== newargs
)
9196 if (!oldargs
|| !newargs
)
9199 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
9202 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
9204 tree nt
= TREE_VEC_ELT (newargs
, i
);
9205 tree ot
= TREE_VEC_ELT (oldargs
, i
);
9207 if (! template_args_equal (ot
, nt
, partial_order
))
9209 if (oldarg_ptr
!= NULL
)
9211 if (newarg_ptr
!= NULL
)
9220 comp_template_args_porder (tree oargs
, tree nargs
)
9222 return comp_template_args (oargs
, nargs
, NULL
, NULL
, true);
9225 /* Implement a freelist interface for objects of type T.
9227 Head is a separate object, rather than a regular member, so that we
9228 can define it as a GTY deletable pointer, which is highly
9229 desirable. A data member could be declared that way, but then the
9230 containing object would implicitly get GTY((user)), which would
9231 prevent us from instantiating freelists as global objects.
9232 Although this way we can create freelist global objects, they're
9233 such thin wrappers that instantiating temporaries at every use
9234 loses nothing and saves permanent storage for the freelist object.
9236 Member functions next, anew, poison and reinit have default
9237 implementations that work for most of the types we're interested
9238 in, but if they don't work for some type, they should be explicitly
9239 specialized. See the comments before them for requirements, and
9240 the example specializations for the tree_list_freelist. */
9241 template <typename T
>
9244 /* Return the next object in a chain. We could just do type
9245 punning, but if we access the object with its underlying type, we
9246 avoid strict-aliasing trouble. This needs only work between
9247 poison and reinit. */
9248 static T
*&next (T
*obj
) { return obj
->next
; }
9250 /* Return a newly allocated, uninitialized or minimally-initialized
9251 object of type T. Any initialization performed by anew should
9252 either remain across the life of the object and the execution of
9253 poison, or be redone by reinit. */
9254 static T
*anew () { return ggc_alloc
<T
> (); }
9256 /* Optionally scribble all over the bits holding the object, so that
9257 they become (mostly?) uninitialized memory. This is called while
9258 preparing to make the object part of the free list. */
9259 static void poison (T
*obj
) {
9260 T
*p ATTRIBUTE_UNUSED
= obj
;
9261 T
**q ATTRIBUTE_UNUSED
= &next (obj
);
9263 #ifdef ENABLE_GC_CHECKING
9264 /* Poison the data, to indicate the data is garbage. */
9265 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (p
, sizeof (*p
)));
9266 memset (p
, 0xa5, sizeof (*p
));
9268 /* Let valgrind know the object is free. */
9269 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_NOACCESS (p
, sizeof (*p
)));
9271 /* Let valgrind know the next portion of the object is available,
9272 but uninitialized. */
9273 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (q
, sizeof (*q
)));
9276 /* Bring an object that underwent at least one lifecycle after anew
9277 and before the most recent free and poison, back to a usable
9278 state, reinitializing whatever is needed for it to be
9279 functionally equivalent to an object just allocated and returned
9280 by anew. This may poison or clear the next field, used by
9281 freelist housekeeping after poison was called. */
9282 static void reinit (T
*obj
) {
9283 T
**q ATTRIBUTE_UNUSED
= &next (obj
);
9285 #ifdef ENABLE_GC_CHECKING
9286 memset (q
, 0xa5, sizeof (*q
));
9288 /* Let valgrind know the entire object is available, but
9290 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (obj
, sizeof (*obj
)));
9293 /* Reference a GTY-deletable pointer that points to the first object
9294 in the free list proper. */
9297 /* Construct a freelist object chaining objects off of HEAD. */
9298 freelist (T
*&head
) : head(head
) {}
9300 /* Add OBJ to the free object list. The former head becomes OBJ's
9309 /* Take an object from the free list, if one is available, or
9310 allocate a new one. Objects taken from the free list should be
9311 regarded as filled with garbage, except for bits that are
9312 configured to be preserved across free and alloc. */
9327 /* Explicitly specialize the interfaces for freelist<tree_node>: we
9328 want to allocate a TREE_LIST using the usual interface, and ensure
9329 TREE_CHAIN remains functional. Alas, we have to duplicate a bit of
9330 build_tree_list logic in reinit, so this could go out of sync. */
9333 freelist
<tree_node
>::next (tree obj
)
9335 return TREE_CHAIN (obj
);
9339 freelist
<tree_node
>::anew ()
9341 return build_tree_list (NULL
, NULL
);
9345 freelist
<tree_node
>::poison (tree obj ATTRIBUTE_UNUSED
)
9347 int size ATTRIBUTE_UNUSED
= sizeof (tree_list
);
9348 tree p ATTRIBUTE_UNUSED
= obj
;
9349 tree_base
*b ATTRIBUTE_UNUSED
= &obj
->base
;
9350 tree
*q ATTRIBUTE_UNUSED
= &next (obj
);
9352 #ifdef ENABLE_GC_CHECKING
9353 gcc_checking_assert (TREE_CODE (obj
) == TREE_LIST
);
9355 /* Poison the data, to indicate the data is garbage. */
9356 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (p
, size
));
9357 memset (p
, 0xa5, size
);
9359 /* Let valgrind know the object is free. */
9360 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_NOACCESS (p
, size
));
9361 /* But we still want to use the TREE_CODE and TREE_CHAIN parts. */
9362 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_DEFINED (b
, sizeof (*b
)));
9363 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (q
, sizeof (*q
)));
9365 #ifdef ENABLE_GC_CHECKING
9366 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (b
, sizeof (*b
)));
9367 /* Keep TREE_CHAIN functional. */
9368 TREE_SET_CODE (obj
, TREE_LIST
);
9370 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_DEFINED (b
, sizeof (*b
)));
9375 freelist
<tree_node
>::reinit (tree obj ATTRIBUTE_UNUSED
)
9377 tree_base
*b ATTRIBUTE_UNUSED
= &obj
->base
;
9379 #ifdef ENABLE_GC_CHECKING
9380 gcc_checking_assert (TREE_CODE (obj
) == TREE_LIST
);
9381 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (obj
, sizeof (tree_list
)));
9382 memset (obj
, 0, sizeof (tree_list
));
9385 /* Let valgrind know the entire object is available, but
9387 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (obj
, sizeof (tree_list
)));
9389 #ifdef ENABLE_GC_CHECKING
9390 TREE_SET_CODE (obj
, TREE_LIST
);
9392 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_DEFINED (b
, sizeof (*b
)));
9396 /* Point to the first object in the TREE_LIST freelist. */
9397 static GTY((deletable
)) tree tree_list_freelist_head
;
9398 /* Return the/an actual TREE_LIST freelist. */
9399 static inline freelist
<tree_node
>
9400 tree_list_freelist ()
9402 return tree_list_freelist_head
;
9405 /* Point to the first object in the tinst_level freelist. */
9406 static GTY((deletable
)) tinst_level
*tinst_level_freelist_head
;
9407 /* Return the/an actual tinst_level freelist. */
9408 static inline freelist
<tinst_level
>
9409 tinst_level_freelist ()
9411 return tinst_level_freelist_head
;
9414 /* Point to the first object in the pending_template freelist. */
9415 static GTY((deletable
)) pending_template
*pending_template_freelist_head
;
9416 /* Return the/an actual pending_template freelist. */
9417 static inline freelist
<pending_template
>
9418 pending_template_freelist ()
9420 return pending_template_freelist_head
;
9423 /* Build the TREE_LIST object out of a split list, store it
9424 permanently, and return it. */
9426 tinst_level::to_list ()
9428 gcc_assert (split_list_p ());
9429 tree ret
= tree_list_freelist ().alloc ();
9430 TREE_PURPOSE (ret
) = tldcl
;
9431 TREE_VALUE (ret
) = targs
;
9434 gcc_assert (tree_list_p ());
9438 const unsigned short tinst_level::refcount_infinity
;
9440 /* Increment OBJ's refcount unless it is already infinite. */
9441 static tinst_level
*
9442 inc_refcount_use (tinst_level
*obj
)
9444 if (obj
&& obj
->refcount
!= tinst_level::refcount_infinity
)
9449 /* Release storage for OBJ and node, if it's a TREE_LIST. */
9451 tinst_level::free (tinst_level
*obj
)
9453 if (obj
->tree_list_p ())
9454 tree_list_freelist ().free (obj
->get_node ());
9455 tinst_level_freelist ().free (obj
);
9458 /* Decrement OBJ's refcount if not infinite. If it reaches zero, release
9459 OBJ's DECL and OBJ, and start over with the tinst_level object that
9460 used to be referenced by OBJ's NEXT. */
9462 dec_refcount_use (tinst_level
*obj
)
9465 && obj
->refcount
!= tinst_level::refcount_infinity
9466 && !--obj
->refcount
)
9468 tinst_level
*next
= obj
->next
;
9469 tinst_level::free (obj
);
9474 /* Modify PTR so that it points to OBJ, adjusting the refcounts of OBJ
9475 and of the former PTR. Omitting the second argument is equivalent
9476 to passing (T*)NULL; this is allowed because passing the
9477 zero-valued integral constant NULL confuses type deduction and/or
9478 overload resolution. */
9479 template <typename T
>
9481 set_refcount_ptr (T
*& ptr
, T
*obj
= NULL
)
9484 ptr
= inc_refcount_use (obj
);
9485 dec_refcount_use (save
);
9489 add_pending_template (tree d
)
9491 tree ti
= (TYPE_P (d
)
9492 ? CLASSTYPE_TEMPLATE_INFO (d
)
9493 : DECL_TEMPLATE_INFO (d
));
9494 struct pending_template
*pt
;
9497 if (TI_PENDING_TEMPLATE_FLAG (ti
))
9500 /* We are called both from instantiate_decl, where we've already had a
9501 tinst_level pushed, and instantiate_template, where we haven't.
9503 gcc_assert (TREE_CODE (d
) != TREE_LIST
);
9504 level
= !current_tinst_level
9505 || current_tinst_level
->maybe_get_node () != d
;
9508 push_tinst_level (d
);
9510 pt
= pending_template_freelist ().alloc ();
9513 set_refcount_ptr (pt
->tinst
, current_tinst_level
);
9514 if (last_pending_template
)
9515 last_pending_template
->next
= pt
;
9517 pending_templates
= pt
;
9519 last_pending_template
= pt
;
9521 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
9528 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
9529 ARGLIST. Valid choices for FNS are given in the cp-tree.def
9530 documentation for TEMPLATE_ID_EXPR. */
9533 lookup_template_function (tree fns
, tree arglist
)
9535 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
9536 return error_mark_node
;
9538 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
9540 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
9542 error ("%q#D is not a function template", fns
);
9543 return error_mark_node
;
9546 if (BASELINK_P (fns
))
9548 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
9550 BASELINK_FUNCTIONS (fns
),
9555 return build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fns
, arglist
);
9558 /* Within the scope of a template class S<T>, the name S gets bound
9559 (in build_self_reference) to a TYPE_DECL for the class, not a
9560 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
9561 or one of its enclosing classes, and that type is a template,
9562 return the associated TEMPLATE_DECL. Otherwise, the original
9565 Also handle the case when DECL is a TREE_LIST of ambiguous
9566 injected-class-names from different bases. */
9569 maybe_get_template_decl_from_type_decl (tree decl
)
9571 if (decl
== NULL_TREE
)
9574 /* DR 176: A lookup that finds an injected-class-name (10.2
9575 [class.member.lookup]) can result in an ambiguity in certain cases
9576 (for example, if it is found in more than one base class). If all of
9577 the injected-class-names that are found refer to specializations of
9578 the same class template, and if the name is followed by a
9579 template-argument-list, the reference refers to the class template
9580 itself and not a specialization thereof, and is not ambiguous. */
9581 if (TREE_CODE (decl
) == TREE_LIST
)
9583 tree t
, tmpl
= NULL_TREE
;
9584 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
9586 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
9589 else if (tmpl
!= elt
)
9592 if (tmpl
&& t
== NULL_TREE
)
9598 return (decl
!= NULL_TREE
9599 && DECL_SELF_REFERENCE_P (decl
)
9600 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
9601 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
9604 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
9605 parameters, find the desired type.
9607 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
9609 IN_DECL, if non-NULL, is the template declaration we are trying to
9612 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
9613 the class we are looking up.
9615 Issue error and warning messages under control of COMPLAIN.
9617 If the template class is really a local class in a template
9618 function, then the FUNCTION_CONTEXT is the function in which it is
9621 ??? Note that this function is currently called *twice* for each
9622 template-id: the first time from the parser, while creating the
9623 incomplete type (finish_template_type), and the second type during the
9624 real instantiation (instantiate_template_class). This is surely something
9625 that we want to avoid. It also causes some problems with argument
9626 coercion (see convert_nontype_argument for more information on this). */
9629 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
9630 int entering_scope
, tsubst_flags_t complain
)
9632 tree templ
= NULL_TREE
, parmlist
;
9639 if (identifier_p (d1
))
9641 tree value
= innermost_non_namespace_value (d1
);
9642 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
9647 push_decl_namespace (context
);
9648 templ
= lookup_name (d1
);
9649 templ
= maybe_get_template_decl_from_type_decl (templ
);
9651 pop_decl_namespace ();
9654 context
= DECL_CONTEXT (templ
);
9656 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
9658 tree type
= TREE_TYPE (d1
);
9660 /* If we are declaring a constructor, say A<T>::A<T>, we will get
9661 an implicit typename for the second A. Deal with it. */
9662 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
9663 type
= TREE_TYPE (type
);
9665 if (CLASSTYPE_TEMPLATE_INFO (type
))
9667 templ
= CLASSTYPE_TI_TEMPLATE (type
);
9668 d1
= DECL_NAME (templ
);
9671 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
9672 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
9674 templ
= TYPE_TI_TEMPLATE (d1
);
9675 d1
= DECL_NAME (templ
);
9677 else if (DECL_TYPE_TEMPLATE_P (d1
))
9680 d1
= DECL_NAME (templ
);
9681 context
= DECL_CONTEXT (templ
);
9683 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
9686 d1
= DECL_NAME (templ
);
9689 /* Issue an error message if we didn't find a template. */
9692 if (complain
& tf_error
)
9693 error ("%qT is not a template", d1
);
9694 return error_mark_node
;
9697 if (TREE_CODE (templ
) != TEMPLATE_DECL
9698 /* Make sure it's a user visible template, if it was named by
9700 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
9701 && !PRIMARY_TEMPLATE_P (templ
)))
9703 if (complain
& tf_error
)
9705 error ("non-template type %qT used as a template", d1
);
9707 error ("for template declaration %q+D", in_decl
);
9709 return error_mark_node
;
9712 complain
&= ~tf_user
;
9714 /* An alias that just changes the name of a template is equivalent to the
9715 other template, so if any of the arguments are pack expansions, strip
9716 the alias to avoid problems with a pack expansion passed to a non-pack
9717 alias template parameter (DR 1430). */
9718 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
9719 templ
= get_underlying_template (templ
);
9721 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
9724 tree arglist2
= coerce_template_args_for_ttp (templ
, arglist
, complain
);
9725 if (arglist2
== error_mark_node
9726 || (!uses_template_parms (arglist2
)
9727 && check_instantiated_args (templ
, arglist2
, complain
)))
9728 return error_mark_node
;
9730 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
9735 tree template_type
= TREE_TYPE (templ
);
9738 tree found
= NULL_TREE
;
9741 int is_dependent_type
;
9742 int use_partial_inst_tmpl
= false;
9744 if (template_type
== error_mark_node
)
9745 /* An error occurred while building the template TEMPL, and a
9746 diagnostic has most certainly been emitted for that
9747 already. Let's propagate that error. */
9748 return error_mark_node
;
9750 gen_tmpl
= most_general_template (templ
);
9751 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
9752 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
9753 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
9755 if (arg_depth
== 1 && parm_depth
> 1)
9757 /* We've been given an incomplete set of template arguments.
9760 template <class T> struct S1 {
9761 template <class U> struct S2 {};
9762 template <class U> struct S2<U*> {};
9765 we will be called with an ARGLIST of `U*', but the
9766 TEMPLATE will be `template <class T> template
9767 <class U> struct S1<T>::S2'. We must fill in the missing
9769 tree ti
= TYPE_TEMPLATE_INFO_MAYBE_ALIAS (TREE_TYPE (templ
));
9770 arglist
= add_outermost_template_args (TI_ARGS (ti
), arglist
);
9771 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
9774 /* Now we should have enough arguments. */
9775 gcc_assert (parm_depth
== arg_depth
);
9777 /* From here on, we're only interested in the most general
9780 /* Calculate the BOUND_ARGS. These will be the args that are
9781 actually tsubst'd into the definition to create the
9783 arglist
= coerce_innermost_template_parms (parmlist
, arglist
, gen_tmpl
,
9785 /*require_all_args=*/true,
9786 /*use_default_args=*/true);
9788 if (arglist
== error_mark_node
)
9789 /* We were unable to bind the arguments. */
9790 return error_mark_node
;
9792 /* In the scope of a template class, explicit references to the
9793 template class refer to the type of the template, not any
9794 instantiation of it. For example, in:
9796 template <class T> class C { void f(C<T>); }
9798 the `C<T>' is just the same as `C'. Outside of the
9799 class, however, such a reference is an instantiation. */
9801 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
9802 || currently_open_class (template_type
))
9804 tree tinfo
= TYPE_TEMPLATE_INFO (template_type
);
9806 if (tinfo
&& comp_template_args (TI_ARGS (tinfo
), arglist
))
9807 return template_type
;
9810 /* If we already have this specialization, return it. */
9811 elt
.tmpl
= gen_tmpl
;
9813 elt
.spec
= NULL_TREE
;
9814 hash
= spec_hasher::hash (&elt
);
9815 entry
= type_specializations
->find_with_hash (&elt
, hash
);
9820 /* If the template's constraints are not satisfied,
9821 then we cannot form a valid type.
9823 Note that the check is deferred until after the hash
9824 lookup. This prevents redundant checks on previously
9825 instantiated specializations. */
9827 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
)
9828 && !constraints_satisfied_p (gen_tmpl
, arglist
))
9830 if (complain
& tf_error
)
9832 auto_diagnostic_group d
;
9833 error ("template constraint failure for %qD", gen_tmpl
);
9834 diagnose_constraints (input_location
, gen_tmpl
, arglist
);
9836 return error_mark_node
;
9839 is_dependent_type
= uses_template_parms (arglist
);
9841 /* If the deduced arguments are invalid, then the binding
9843 if (!is_dependent_type
9844 && check_instantiated_args (gen_tmpl
,
9845 INNERMOST_TEMPLATE_ARGS (arglist
),
9847 return error_mark_node
;
9849 if (!is_dependent_type
9850 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
9851 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
9852 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
9854 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
9855 DECL_NAME (gen_tmpl
),
9856 /*tag_scope=*/ts_global
);
9860 context
= DECL_CONTEXT (gen_tmpl
);
9861 if (context
&& TYPE_P (context
))
9863 context
= tsubst_aggr_type (context
, arglist
, complain
, in_decl
, true);
9864 context
= complete_type (context
);
9867 context
= tsubst (context
, arglist
, complain
, in_decl
);
9869 if (context
== error_mark_node
)
9870 return error_mark_node
;
9873 context
= global_namespace
;
9875 /* Create the type. */
9876 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
9878 /* The user referred to a specialization of an alias
9879 template represented by GEN_TMPL.
9881 [temp.alias]/2 says:
9883 When a template-id refers to the specialization of an
9884 alias template, it is equivalent to the associated
9885 type obtained by substitution of its
9886 template-arguments for the template-parameters in the
9887 type-id of the alias template. */
9889 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
9890 /* Note that the call above (by indirectly calling
9891 register_specialization in tsubst_decl) registers the
9892 TYPE_DECL representing the specialization of the alias
9893 template. So next time someone substitutes ARGLIST for
9894 the template parms into the alias template (GEN_TMPL),
9895 she'll get that TYPE_DECL back. */
9897 if (t
== error_mark_node
)
9900 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
9902 if (!is_dependent_type
)
9904 set_current_access_from_decl (TYPE_NAME (template_type
));
9905 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
9906 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
9907 arglist
, complain
, in_decl
),
9908 tsubst_attributes (TYPE_ATTRIBUTES (template_type
),
9909 arglist
, complain
, in_decl
),
9910 SCOPED_ENUM_P (template_type
), NULL
);
9912 if (t
== error_mark_node
)
9917 /* We don't want to call start_enum for this type, since
9918 the values for the enumeration constants may involve
9919 template parameters. And, no one should be interested
9920 in the enumeration constants for such a type. */
9921 t
= cxx_make_type (ENUMERAL_TYPE
);
9922 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
9924 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
9925 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
9926 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
9928 else if (CLASS_TYPE_P (template_type
))
9930 /* Lambda closures are regenerated in tsubst_lambda_expr, not
9931 instantiated here. */
9932 gcc_assert (!LAMBDA_TYPE_P (template_type
));
9934 t
= make_class_type (TREE_CODE (template_type
));
9935 CLASSTYPE_DECLARED_CLASS (t
)
9936 = CLASSTYPE_DECLARED_CLASS (template_type
);
9937 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
9939 /* A local class. Make sure the decl gets registered properly. */
9940 if (context
== current_function_decl
)
9941 if (pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
)
9943 return error_mark_node
;
9945 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
9946 /* This instantiation is another name for the primary
9947 template type. Set the TYPE_CANONICAL field
9949 TYPE_CANONICAL (t
) = template_type
;
9950 else if (any_template_arguments_need_structural_equality_p (arglist
))
9951 /* Some of the template arguments require structural
9952 equality testing, so this template class requires
9953 structural equality testing. */
9954 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9959 /* If we called start_enum or pushtag above, this information
9960 will already be set up. */
9961 type_decl
= TYPE_NAME (t
);
9964 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
9966 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
9967 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
9968 DECL_SOURCE_LOCATION (type_decl
)
9969 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
9972 if (CLASS_TYPE_P (template_type
))
9974 TREE_PRIVATE (type_decl
)
9975 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
9976 TREE_PROTECTED (type_decl
)
9977 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
9978 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
9980 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
9981 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
9985 if (OVERLOAD_TYPE_P (t
)
9986 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
9988 static const char *tags
[] = {"abi_tag", "may_alias"};
9990 for (unsigned ix
= 0; ix
!= 2; ix
++)
9993 = lookup_attribute (tags
[ix
], TYPE_ATTRIBUTES (template_type
));
9997 = tree_cons (TREE_PURPOSE (attributes
),
9998 TREE_VALUE (attributes
),
9999 TYPE_ATTRIBUTES (t
));
10003 /* Let's consider the explicit specialization of a member
10004 of a class template specialization that is implicitly instantiated,
10009 template<class U> struct M {}; //#0
10014 struct S<int>::M<char> //#1
10018 [temp.expl.spec]/4 says this is valid.
10020 In this case, when we write:
10023 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
10026 When we encounter #1, we want to store the partial instantiation
10027 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
10029 For all cases other than this "explicit specialization of member of a
10030 class template", we just want to store the most general template into
10031 the CLASSTYPE_TI_TEMPLATE of M.
10033 This case of "explicit specialization of member of a class template"
10035 1/ the enclosing class is an instantiation of, and therefore not
10036 the same as, the context of the most general template, and
10037 2/ we aren't looking at the partial instantiation itself, i.e.
10038 the innermost arguments are not the same as the innermost parms of
10039 the most general template.
10041 So it's only when 1/ and 2/ happens that we want to use the partial
10042 instantiation of the member template in lieu of its most general
10045 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
10046 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
10047 /* the enclosing class must be an instantiation... */
10048 && CLASS_TYPE_P (context
)
10049 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
10051 TREE_VEC_LENGTH (arglist
)--;
10052 ++processing_template_decl
;
10053 tree tinfo
= TYPE_TEMPLATE_INFO_MAYBE_ALIAS (TREE_TYPE (gen_tmpl
));
10054 tree partial_inst_args
=
10055 tsubst (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
)),
10056 arglist
, complain
, NULL_TREE
);
10057 --processing_template_decl
;
10058 TREE_VEC_LENGTH (arglist
)++;
10059 if (partial_inst_args
== error_mark_node
)
10060 return error_mark_node
;
10061 use_partial_inst_tmpl
=
10062 /*...and we must not be looking at the partial instantiation
10064 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
10065 partial_inst_args
);
10068 if (!use_partial_inst_tmpl
)
10069 /* This case is easy; there are no member templates involved. */
10073 /* This is a full instantiation of a member template. Find
10074 the partial instantiation of which this is an instance. */
10076 /* Temporarily reduce by one the number of levels in the ARGLIST
10077 so as to avoid comparing the last set of arguments. */
10078 TREE_VEC_LENGTH (arglist
)--;
10079 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
10080 TREE_VEC_LENGTH (arglist
)++;
10081 /* FOUND is either a proper class type, or an alias
10082 template specialization. In the later case, it's a
10083 TYPE_DECL, resulting from the substituting of arguments
10084 for parameters in the TYPE_DECL of the alias template
10085 done earlier. So be careful while getting the template
10087 found
= (TREE_CODE (found
) == TEMPLATE_DECL
10089 : (TREE_CODE (found
) == TYPE_DECL
10090 ? DECL_TI_TEMPLATE (found
)
10091 : CLASSTYPE_TI_TEMPLATE (found
)));
10093 if (DECL_CLASS_TEMPLATE_P (found
)
10094 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (found
)))
10096 /* If this partial instantiation is specialized, we want to
10097 use it for hash table lookup. */
10099 elt
.args
= arglist
= INNERMOST_TEMPLATE_ARGS (arglist
);
10100 hash
= spec_hasher::hash (&elt
);
10104 /* Build template info for the new specialization. */
10105 if (TYPE_ALIAS_P (t
))
10107 /* This is constructed during instantiation of the alias
10108 decl. But for member templates of template classes, that
10109 is not correct as we need to refer to the partially
10110 instantiated template, not the most general template.
10111 The incorrect knowledge will not have escaped this
10112 instantiation process, so we're good just updating the
10113 template_info we made then. */
10114 tree ti
= DECL_TEMPLATE_INFO (TYPE_NAME (t
));
10115 gcc_checking_assert (template_args_equal (TI_ARGS (ti
), arglist
));
10116 if (TI_TEMPLATE (ti
) != found
)
10118 gcc_checking_assert (DECL_TI_TEMPLATE (found
) == TI_TEMPLATE (ti
));
10119 TI_TEMPLATE (ti
) = found
;
10123 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
10126 slot
= type_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
10127 gcc_checking_assert (*slot
== NULL
);
10128 entry
= ggc_alloc
<spec_entry
> ();
10132 /* Note this use of the partial instantiation so we can check it
10133 later in maybe_process_partial_specialization. */
10134 DECL_TEMPLATE_INSTANTIATIONS (found
)
10135 = tree_cons (arglist
, t
,
10136 DECL_TEMPLATE_INSTANTIATIONS (found
));
10138 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
10139 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
10140 /* Now that the type has been registered on the instantiations
10141 list, we set up the enumerators. Because the enumeration
10142 constants may involve the enumeration type itself, we make
10143 sure to register the type first, and then create the
10144 constants. That way, doing tsubst_expr for the enumeration
10145 constants won't result in recursive calls here; we'll find
10146 the instantiation and exit above. */
10147 tsubst_enum (template_type
, t
, arglist
);
10149 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
10150 /* If the type makes use of template parameters, the
10151 code that generates debugging information will crash. */
10152 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
10154 /* Possibly limit visibility based on template args. */
10155 TREE_PUBLIC (type_decl
) = 1;
10156 determine_visibility (type_decl
);
10158 inherit_targ_abi_tags (t
);
10164 /* Wrapper for lookup_template_class_1. */
10167 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
10168 int entering_scope
, tsubst_flags_t complain
)
10171 timevar_push (TV_TEMPLATE_INST
);
10172 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
10173 entering_scope
, complain
);
10174 timevar_pop (TV_TEMPLATE_INST
);
10178 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST. */
10181 lookup_template_variable (tree templ
, tree arglist
)
10183 if (flag_concepts
&& variable_concept_p (templ
))
10184 return build_concept_check (templ
, arglist
, tf_none
);
10186 /* The type of the expression is NULL_TREE since the template-id could refer
10187 to an explicit or partial specialization. */
10188 return build2 (TEMPLATE_ID_EXPR
, NULL_TREE
, templ
, arglist
);
10191 /* Instantiate a variable declaration from a TEMPLATE_ID_EXPR for use. */
10194 finish_template_variable (tree var
, tsubst_flags_t complain
)
10196 tree templ
= TREE_OPERAND (var
, 0);
10197 tree arglist
= TREE_OPERAND (var
, 1);
10199 tree tmpl_args
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (templ
));
10200 arglist
= add_outermost_template_args (tmpl_args
, arglist
);
10202 templ
= most_general_template (templ
);
10203 tree parms
= DECL_TEMPLATE_PARMS (templ
);
10204 arglist
= coerce_innermost_template_parms (parms
, arglist
, templ
, complain
,
10206 /*use_default*/true);
10207 if (arglist
== error_mark_node
)
10208 return error_mark_node
;
10210 if (flag_concepts
&& !constraints_satisfied_p (templ
, arglist
))
10212 if (complain
& tf_error
)
10214 auto_diagnostic_group d
;
10215 error ("use of invalid variable template %qE", var
);
10216 diagnose_constraints (location_of (var
), templ
, arglist
);
10218 return error_mark_node
;
10221 return instantiate_template (templ
, arglist
, complain
);
10224 /* Construct a TEMPLATE_ID_EXPR for the given variable template TEMPL having
10225 TARGS template args, and instantiate it if it's not dependent. */
10228 lookup_and_finish_template_variable (tree templ
, tree targs
,
10229 tsubst_flags_t complain
)
10231 templ
= lookup_template_variable (templ
, targs
);
10232 if (!any_dependent_template_arguments_p (targs
))
10234 templ
= finish_template_variable (templ
, complain
);
10238 return convert_from_reference (templ
);
10242 struct pair_fn_data
10247 /* True when we should also visit template parameters that occur in
10248 non-deduced contexts. */
10249 bool include_nondeduced_p
;
10250 hash_set
<tree
> *visited
;
10253 /* Called from for_each_template_parm via walk_tree. */
10256 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
10259 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
10260 tree_fn_t fn
= pfd
->fn
;
10261 void *data
= pfd
->data
;
10262 tree result
= NULL_TREE
;
10264 #define WALK_SUBTREE(NODE) \
10267 result = for_each_template_parm (NODE, fn, data, pfd->visited, \
10268 pfd->include_nondeduced_p, \
10270 if (result) goto out; \
10274 if (pfd
->any_fn
&& (*pfd
->any_fn
)(t
, data
))
10278 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
))
10279 WALK_SUBTREE (TYPE_CONTEXT (t
));
10281 switch (TREE_CODE (t
))
10284 if (TYPE_PTRMEMFUNC_P (t
))
10286 /* Fall through. */
10289 case ENUMERAL_TYPE
:
10290 if (!TYPE_TEMPLATE_INFO (t
))
10291 *walk_subtrees
= 0;
10293 WALK_SUBTREE (TYPE_TI_ARGS (t
));
10297 WALK_SUBTREE (TYPE_MIN_VALUE (t
));
10298 WALK_SUBTREE (TYPE_MAX_VALUE (t
));
10302 /* Since we're not going to walk subtrees, we have to do this
10303 explicitly here. */
10304 WALK_SUBTREE (TYPE_METHOD_BASETYPE (t
));
10305 /* Fall through. */
10307 case FUNCTION_TYPE
:
10308 /* Check the return type. */
10309 WALK_SUBTREE (TREE_TYPE (t
));
10311 /* Check the parameter types. Since default arguments are not
10312 instantiated until they are needed, the TYPE_ARG_TYPES may
10313 contain expressions that involve template parameters. But,
10314 no-one should be looking at them yet. And, once they're
10315 instantiated, they don't contain template parameters, so
10316 there's no point in looking at them then, either. */
10320 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
10321 WALK_SUBTREE (TREE_VALUE (parm
));
10323 /* Since we've already handled the TYPE_ARG_TYPES, we don't
10324 want walk_tree walking into them itself. */
10325 *walk_subtrees
= 0;
10328 if (flag_noexcept_type
)
10330 tree spec
= TYPE_RAISES_EXCEPTIONS (t
);
10332 WALK_SUBTREE (TREE_PURPOSE (spec
));
10337 case DECLTYPE_TYPE
:
10338 case UNDERLYING_TYPE
:
10339 if (pfd
->include_nondeduced_p
10340 && for_each_template_parm (TYPE_VALUES_RAW (t
), fn
, data
,
10342 pfd
->include_nondeduced_p
,
10344 return error_mark_node
;
10345 *walk_subtrees
= false;
10348 case FUNCTION_DECL
:
10350 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
10351 WALK_SUBTREE (DECL_TI_ARGS (t
));
10352 /* Fall through. */
10356 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
))
10357 WALK_SUBTREE (DECL_INITIAL (t
));
10358 if (DECL_CONTEXT (t
)
10359 && pfd
->include_nondeduced_p
)
10360 WALK_SUBTREE (DECL_CONTEXT (t
));
10363 case BOUND_TEMPLATE_TEMPLATE_PARM
:
10364 /* Record template parameters such as `T' inside `TT<T>'. */
10365 WALK_SUBTREE (TYPE_TI_ARGS (t
));
10366 /* Fall through. */
10368 case TEMPLATE_TEMPLATE_PARM
:
10369 case TEMPLATE_TYPE_PARM
:
10370 case TEMPLATE_PARM_INDEX
:
10371 if (fn
&& (*fn
)(t
, data
))
10377 case TEMPLATE_DECL
:
10378 /* A template template parameter is encountered. */
10379 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10380 WALK_SUBTREE (TREE_TYPE (t
));
10382 /* Already substituted template template parameter */
10383 *walk_subtrees
= 0;
10386 case TYPENAME_TYPE
:
10387 /* A template-id in a TYPENAME_TYPE might be a deduced context after
10388 partial instantiation. */
10389 WALK_SUBTREE (TYPENAME_TYPE_FULLNAME (t
));
10390 *walk_subtrees
= 0;
10394 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
10395 && pfd
->include_nondeduced_p
)
10396 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (t
)));
10400 case COMPONENT_REF
:
10401 /* If there's no type, then this thing must be some expression
10402 involving template parameters. */
10403 if (!fn
&& !TREE_TYPE (t
))
10404 return error_mark_node
;
10409 case IMPLICIT_CONV_EXPR
:
10410 case REINTERPRET_CAST_EXPR
:
10411 case CONST_CAST_EXPR
:
10412 case STATIC_CAST_EXPR
:
10413 case DYNAMIC_CAST_EXPR
:
10417 case PSEUDO_DTOR_EXPR
:
10419 return error_mark_node
;
10423 if (pfd
->include_nondeduced_p
)
10424 WALK_SUBTREE (TREE_OPERAND (t
, 0));
10427 case REQUIRES_EXPR
:
10430 return error_mark_node
;
10432 /* Recursively walk the type of each constraint variable. */
10433 tree p
= TREE_OPERAND (t
, 0);
10436 WALK_SUBTREE (TREE_TYPE (p
));
10437 p
= TREE_CHAIN (p
);
10446 #undef WALK_SUBTREE
10448 /* We didn't find any template parameters we liked. */
10453 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
10454 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
10455 call FN with the parameter and the DATA.
10456 If FN returns nonzero, the iteration is terminated, and
10457 for_each_template_parm returns 1. Otherwise, the iteration
10458 continues. If FN never returns a nonzero value, the value
10459 returned by for_each_template_parm is 0. If FN is NULL, it is
10460 considered to be the function which always returns 1.
10462 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
10463 parameters that occur in non-deduced contexts. When false, only
10464 visits those template parameters that can be deduced. */
10467 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
10468 hash_set
<tree
> *visited
,
10469 bool include_nondeduced_p
,
10472 struct pair_fn_data pfd
;
10477 pfd
.any_fn
= any_fn
;
10479 pfd
.include_nondeduced_p
= include_nondeduced_p
;
10481 /* Walk the tree. (Conceptually, we would like to walk without
10482 duplicates, but for_each_template_parm_r recursively calls
10483 for_each_template_parm, so we would need to reorganize a fair
10484 bit to use walk_tree_without_duplicates, so we keep our own
10487 pfd
.visited
= visited
;
10489 pfd
.visited
= new hash_set
<tree
>;
10490 result
= cp_walk_tree (&t
,
10491 for_each_template_parm_r
,
10498 delete pfd
.visited
;
10505 struct find_template_parameter_info
10507 explicit find_template_parameter_info (tree ctx_parms
)
10508 : parm_list (NULL_TREE
),
10509 ctx_parms (ctx_parms
),
10510 max_depth (TMPL_PARMS_DEPTH (ctx_parms
))
10513 hash_set
<tree
> visited
;
10514 hash_set
<tree
> parms
;
10520 /* Appends the declaration of T to the list in DATA. */
10523 keep_template_parm (tree t
, void* data
)
10525 find_template_parameter_info
*ftpi
= (find_template_parameter_info
*)data
;
10527 /* Template parameters declared within the expression are not part of
10528 the parameter mapping. For example, in this concept:
10530 template<typename T>
10531 concept C = requires { <expr> } -> same_as<int>;
10533 the return specifier same_as<int> declares a new decltype parameter
10534 that must not be part of the parameter mapping. The same is true
10535 for generic lambda parameters, lambda template parameters, etc. */
10538 template_parm_level_and_index (t
, &level
, &index
);
10539 if (level
> ftpi
->max_depth
)
10542 /* Arguments like const T yield parameters like const T. This means that
10543 a template-id like X<T, const T> would yield two distinct parameters:
10544 T and const T. Adjust types to their unqualified versions. */
10546 t
= TYPE_MAIN_VARIANT (t
);
10547 if (!ftpi
->parms
.add (t
))
10548 ftpi
->parm_list
= tree_cons (NULL_TREE
, t
, ftpi
->parm_list
);
10553 /* Ensure that we recursively examine certain terms that are not normally
10554 visited in for_each_template_parm_r. */
10557 any_template_parm_r (tree t
, void *data
)
10559 find_template_parameter_info
*ftpi
= (find_template_parameter_info
*)data
;
10561 #define WALK_SUBTREE(NODE) \
10564 for_each_template_parm (NODE, keep_template_parm, data, \
10565 &ftpi->visited, true, \
10566 any_template_parm_r); \
10570 /* A mention of a member alias/typedef is a use of all of its template
10571 arguments, including those from the enclosing class, so we don't use
10572 alias_template_specialization_p here. */
10573 if (TYPE_P (t
) && typedef_variant_p (t
))
10574 if (tree tinfo
= TYPE_ALIAS_TEMPLATE_INFO (t
))
10575 WALK_SUBTREE (TI_ARGS (tinfo
));
10577 switch (TREE_CODE (t
))
10579 case TEMPLATE_TYPE_PARM
:
10580 /* Type constraints of a placeholder type may contain parameters. */
10582 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
10583 WALK_SUBTREE (constr
);
10586 case TEMPLATE_ID_EXPR
:
10587 /* Search through references to variable templates. */
10588 WALK_SUBTREE (TREE_OPERAND (t
, 0));
10589 WALK_SUBTREE (TREE_OPERAND (t
, 1));
10592 case TEMPLATE_PARM_INDEX
:
10594 /* A parameter or constraint variable may also depend on a template
10595 parameter without explicitly naming it. */
10596 WALK_SUBTREE (TREE_TYPE (t
));
10599 case TEMPLATE_DECL
:
10601 /* If T is a member template that shares template parameters with
10602 ctx_parms, we need to mark all those parameters for mapping. */
10603 tree dparms
= DECL_TEMPLATE_PARMS (t
);
10604 tree cparms
= ftpi
->ctx_parms
;
10605 while (TMPL_PARMS_DEPTH (dparms
) > ftpi
->max_depth
)
10606 dparms
= TREE_CHAIN (dparms
);
10607 while (TMPL_PARMS_DEPTH (cparms
) > TMPL_PARMS_DEPTH (dparms
))
10608 cparms
= TREE_CHAIN (cparms
);
10610 && (TREE_TYPE (TREE_VALUE (dparms
))
10611 != TREE_TYPE (TREE_VALUE (cparms
))))
10612 dparms
= TREE_CHAIN (dparms
),
10613 cparms
= TREE_CHAIN (cparms
);
10616 int ddepth
= TMPL_PARMS_DEPTH (dparms
);
10617 tree dargs
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (t
)));
10618 for (int i
= 0; i
< ddepth
; ++i
)
10619 WALK_SUBTREE (TMPL_ARGS_LEVEL (dargs
, i
+1));
10626 /* Look in the parms and body. */
10627 tree fn
= lambda_function (t
);
10628 WALK_SUBTREE (TREE_TYPE (fn
));
10629 WALK_SUBTREE (DECL_SAVED_TREE (fn
));
10633 case IDENTIFIER_NODE
:
10634 if (IDENTIFIER_CONV_OP_P (t
))
10635 /* The conversion-type-id of a conversion operator may be dependent. */
10636 WALK_SUBTREE (TREE_TYPE (t
));
10643 /* Keep walking. */
10647 /* Returns a list of unique template parameters found within T, where CTX_PARMS
10648 are the template parameters in scope. */
10651 find_template_parameters (tree t
, tree ctx_parms
)
10656 find_template_parameter_info
ftpi (ctx_parms
);
10657 for_each_template_parm (t
, keep_template_parm
, &ftpi
, &ftpi
.visited
,
10658 /*include_nondeduced*/true, any_template_parm_r
);
10659 return ftpi
.parm_list
;
10662 /* Returns true if T depends on any template parameter. */
10665 uses_template_parms (tree t
)
10667 if (t
== NULL_TREE
)
10671 int saved_processing_template_decl
;
10673 saved_processing_template_decl
= processing_template_decl
;
10674 if (!saved_processing_template_decl
)
10675 processing_template_decl
= 1;
10677 dependent_p
= dependent_type_p (t
);
10678 else if (TREE_CODE (t
) == TREE_VEC
)
10679 dependent_p
= any_dependent_template_arguments_p (t
);
10680 else if (TREE_CODE (t
) == TREE_LIST
)
10681 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
10682 || uses_template_parms (TREE_CHAIN (t
)));
10683 else if (TREE_CODE (t
) == TYPE_DECL
)
10684 dependent_p
= dependent_type_p (TREE_TYPE (t
));
10685 else if (t
== error_mark_node
)
10686 dependent_p
= false;
10688 dependent_p
= value_dependent_expression_p (t
);
10690 processing_template_decl
= saved_processing_template_decl
;
10692 return dependent_p
;
10695 /* Returns true iff current_function_decl is an incompletely instantiated
10696 template. Useful instead of processing_template_decl because the latter
10697 is set to 0 during instantiate_non_dependent_expr. */
10700 in_template_function (void)
10702 tree fn
= current_function_decl
;
10704 ++processing_template_decl
;
10705 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
10706 && DECL_TEMPLATE_INFO (fn
)
10707 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
10708 --processing_template_decl
;
10712 /* Returns true if T depends on any template parameter with level LEVEL. */
10715 uses_template_parms_level (tree t
, int level
)
10717 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
10718 /*include_nondeduced_p=*/true);
10721 /* Returns true if the signature of DECL depends on any template parameter from
10722 its enclosing class. */
10725 uses_outer_template_parms (tree decl
)
10727 int depth
= template_class_depth (CP_DECL_CONTEXT (decl
));
10730 if (for_each_template_parm (TREE_TYPE (decl
), template_parm_outer_level
,
10731 &depth
, NULL
, /*include_nondeduced_p=*/true))
10733 if (PRIMARY_TEMPLATE_P (decl
)
10734 && for_each_template_parm (INNERMOST_TEMPLATE_PARMS
10735 (DECL_TEMPLATE_PARMS (decl
)),
10736 template_parm_outer_level
,
10737 &depth
, NULL
, /*include_nondeduced_p=*/true))
10739 tree ci
= get_constraints (decl
);
10741 ci
= CI_ASSOCIATED_CONSTRAINTS (ci
);
10742 if (ci
&& for_each_template_parm (ci
, template_parm_outer_level
,
10743 &depth
, NULL
, /*nondeduced*/true))
10748 /* Returns TRUE iff INST is an instantiation we don't need to do in an
10749 ill-formed translation unit, i.e. a variable or function that isn't
10750 usable in a constant expression. */
10753 neglectable_inst_p (tree d
)
10755 return (d
&& DECL_P (d
)
10756 && !undeduced_auto_decl (d
)
10757 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
10758 : decl_maybe_constant_var_p (d
)));
10761 /* Returns TRUE iff we should refuse to instantiate DECL because it's
10762 neglectable and instantiated from within an erroneous instantiation. */
10765 limit_bad_template_recursion (tree decl
)
10767 struct tinst_level
*lev
= current_tinst_level
;
10768 int errs
= errorcount
+ sorrycount
;
10769 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
10772 for (; lev
; lev
= lev
->next
)
10773 if (neglectable_inst_p (lev
->maybe_get_node ()))
10776 return (lev
&& errs
> lev
->errors
);
10779 static int tinst_depth
;
10780 extern int max_tinst_depth
;
10783 static GTY(()) struct tinst_level
*last_error_tinst_level
;
10785 /* We're starting to instantiate D; record the template instantiation context
10786 at LOC for diagnostics and to restore it later. */
10789 push_tinst_level_loc (tree tldcl
, tree targs
, location_t loc
)
10791 struct tinst_level
*new_level
;
10793 if (tinst_depth
>= max_tinst_depth
)
10795 /* Tell error.c not to try to instantiate any templates. */
10797 fatal_error (input_location
,
10798 "template instantiation depth exceeds maximum of %d"
10799 " (use %<-ftemplate-depth=%> to increase the maximum)",
10804 /* If the current instantiation caused problems, don't let it instantiate
10805 anything else. Do allow deduction substitution and decls usable in
10806 constant expressions. */
10807 if (!targs
&& limit_bad_template_recursion (tldcl
))
10809 /* Avoid no_linkage_errors and unused function warnings for this
10811 TREE_NO_WARNING (tldcl
) = 1;
10815 /* When not -quiet, dump template instantiations other than functions, since
10816 announce_function will take care of those. */
10817 if (!quiet_flag
&& !targs
10818 && TREE_CODE (tldcl
) != TREE_LIST
10819 && TREE_CODE (tldcl
) != FUNCTION_DECL
)
10820 fprintf (stderr
, " %s", decl_as_string (tldcl
, TFF_DECL_SPECIFIERS
));
10822 new_level
= tinst_level_freelist ().alloc ();
10823 new_level
->tldcl
= tldcl
;
10824 new_level
->targs
= targs
;
10825 new_level
->locus
= loc
;
10826 new_level
->errors
= errorcount
+ sorrycount
;
10827 new_level
->next
= NULL
;
10828 new_level
->refcount
= 0;
10829 set_refcount_ptr (new_level
->next
, current_tinst_level
);
10830 set_refcount_ptr (current_tinst_level
, new_level
);
10833 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
10834 depth_reached
= tinst_depth
;
10839 /* We're starting substitution of TMPL<ARGS>; record the template
10840 substitution context for diagnostics and to restore it later. */
10843 push_tinst_level (tree tmpl
, tree args
)
10845 return push_tinst_level_loc (tmpl
, args
, input_location
);
10848 /* We're starting to instantiate D; record INPUT_LOCATION and the
10849 template instantiation context for diagnostics and to restore it
10853 push_tinst_level (tree d
)
10855 return push_tinst_level_loc (d
, input_location
);
10858 /* Likewise, but record LOC as the program location. */
10861 push_tinst_level_loc (tree d
, location_t loc
)
10863 gcc_assert (TREE_CODE (d
) != TREE_LIST
);
10864 return push_tinst_level_loc (d
, NULL
, loc
);
10867 /* We're done instantiating this template; return to the instantiation
10871 pop_tinst_level (void)
10873 /* Restore the filename and line number stashed away when we started
10874 this instantiation. */
10875 input_location
= current_tinst_level
->locus
;
10876 set_refcount_ptr (current_tinst_level
, current_tinst_level
->next
);
10880 /* We're instantiating a deferred template; restore the template
10881 instantiation context in which the instantiation was requested, which
10882 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
10885 reopen_tinst_level (struct tinst_level
*level
)
10887 struct tinst_level
*t
;
10890 for (t
= level
; t
; t
= t
->next
)
10893 set_refcount_ptr (current_tinst_level
, level
);
10894 pop_tinst_level ();
10895 if (current_tinst_level
)
10896 current_tinst_level
->errors
= errorcount
+sorrycount
;
10897 return level
->maybe_get_node ();
10900 /* Returns the TINST_LEVEL which gives the original instantiation
10903 struct tinst_level
*
10904 outermost_tinst_level (void)
10906 struct tinst_level
*level
= current_tinst_level
;
10908 while (level
->next
)
10909 level
= level
->next
;
10913 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
10914 vector of template arguments, as for tsubst.
10916 Returns an appropriate tsubst'd friend declaration. */
10919 tsubst_friend_function (tree decl
, tree args
)
10923 if (TREE_CODE (decl
) == FUNCTION_DECL
10924 && DECL_TEMPLATE_INSTANTIATION (decl
)
10925 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
10926 /* This was a friend declared with an explicit template
10927 argument list, e.g.:
10929 friend void f<>(T);
10931 to indicate that f was a template instantiation, not a new
10932 function declaration. Now, we have to figure out what
10933 instantiation of what template. */
10935 tree template_id
, arglist
, fns
;
10938 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
10940 /* Friend functions are looked up in the containing namespace scope.
10941 We must enter that scope, to avoid finding member functions of the
10942 current class with same name. */
10943 push_nested_namespace (ns
);
10944 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
10945 tf_warning_or_error
, NULL_TREE
,
10946 /*integral_constant_expression_p=*/false);
10947 pop_nested_namespace (ns
);
10948 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
10949 tf_warning_or_error
, NULL_TREE
);
10950 template_id
= lookup_template_function (fns
, arglist
);
10952 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
10953 tmpl
= determine_specialization (template_id
, new_friend
,
10955 /*need_member_template=*/0,
10956 TREE_VEC_LENGTH (args
),
10958 return instantiate_template (tmpl
, new_args
, tf_error
);
10961 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
10962 if (new_friend
== error_mark_node
)
10963 return error_mark_node
;
10965 /* The NEW_FRIEND will look like an instantiation, to the
10966 compiler, but is not an instantiation from the point of view of
10967 the language. For example, we might have had:
10969 template <class T> struct S {
10970 template <class U> friend void f(T, U);
10973 Then, in S<int>, template <class U> void f(int, U) is not an
10974 instantiation of anything. */
10976 DECL_USE_TEMPLATE (new_friend
) = 0;
10977 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
10979 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
10980 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
10981 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
10983 /* Substitute TEMPLATE_PARMS_CONSTRAINTS so that parameter levels will
10984 match in decls_match. */
10985 tree parms
= DECL_TEMPLATE_PARMS (new_friend
);
10986 tree treqs
= TEMPLATE_PARMS_CONSTRAINTS (parms
);
10987 treqs
= maybe_substitute_reqs_for (treqs
, new_friend
);
10988 TEMPLATE_PARMS_CONSTRAINTS (parms
) = treqs
;
10991 /* The mangled name for the NEW_FRIEND is incorrect. The function
10992 is not a template instantiation and should not be mangled like
10993 one. Therefore, we forget the mangling here; we'll recompute it
10994 later if we need it. */
10995 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
10997 SET_DECL_RTL (new_friend
, NULL
);
10998 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
11001 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
11006 /* We must save some information from NEW_FRIEND before calling
11007 duplicate decls since that function will free NEW_FRIEND if
11009 tree new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
11010 tree new_friend_result_template_info
= NULL_TREE
;
11011 bool new_friend_is_defn
=
11012 (DECL_INITIAL (DECL_TEMPLATE_RESULT
11013 (template_for_substitution (new_friend
)))
11015 tree not_tmpl
= new_friend
;
11017 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
11019 /* This declaration is a `primary' template. */
11020 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
11022 not_tmpl
= DECL_TEMPLATE_RESULT (new_friend
);
11023 new_friend_result_template_info
= DECL_TEMPLATE_INFO (not_tmpl
);
11026 /* Inside pushdecl_namespace_level, we will push into the
11027 current namespace. However, the friend function should go
11028 into the namespace of the template. */
11029 ns
= decl_namespace_context (new_friend
);
11030 push_nested_namespace (ns
);
11031 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
11032 pop_nested_namespace (ns
);
11034 if (old_decl
== error_mark_node
)
11035 return error_mark_node
;
11037 if (old_decl
!= new_friend
)
11039 /* This new friend declaration matched an existing
11040 declaration. For example, given:
11042 template <class T> void f(T);
11043 template <class U> class C {
11044 template <class T> friend void f(T) {}
11047 the friend declaration actually provides the definition
11048 of `f', once C has been instantiated for some type. So,
11049 old_decl will be the out-of-class template declaration,
11050 while new_friend is the in-class definition.
11052 But, if `f' was called before this point, the
11053 instantiation of `f' will have DECL_TI_ARGS corresponding
11054 to `T' but not to `U', references to which might appear
11055 in the definition of `f'. Previously, the most general
11056 template for an instantiation of `f' was the out-of-class
11057 version; now it is the in-class version. Therefore, we
11058 run through all specialization of `f', adding to their
11059 DECL_TI_ARGS appropriately. In particular, they need a
11060 new set of outer arguments, corresponding to the
11061 arguments for this class instantiation.
11063 The same situation can arise with something like this:
11065 friend void f(int);
11066 template <class T> class C {
11067 friend void f(T) {}
11070 when `C<int>' is instantiated. Now, `f(int)' is defined
11073 if (!new_friend_is_defn
)
11074 /* On the other hand, if the in-class declaration does
11075 *not* provide a definition, then we don't want to alter
11076 existing definitions. We can just leave everything
11081 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
11082 tree new_args
= TI_ARGS (new_friend_template_info
);
11084 /* Overwrite whatever template info was there before, if
11085 any, with the new template information pertaining to
11086 the declaration. */
11087 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
11089 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
11091 /* We should have called reregister_specialization in
11092 duplicate_decls. */
11093 gcc_assert (retrieve_specialization (new_template
,
11097 /* Instantiate it if the global has already been used. */
11098 if (DECL_ODR_USED (old_decl
))
11099 instantiate_decl (old_decl
, /*defer_ok=*/true,
11100 /*expl_inst_class_mem_p=*/false);
11106 /* Indicate that the old function template is a partial
11108 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
11109 = new_friend_result_template_info
;
11111 gcc_assert (new_template
11112 == most_general_template (new_template
));
11113 gcc_assert (new_template
!= old_decl
);
11115 /* Reassign any specializations already in the hash table
11116 to the new more general template, and add the
11117 additional template args. */
11118 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
11120 t
= TREE_CHAIN (t
))
11122 tree spec
= TREE_VALUE (t
);
11125 elt
.tmpl
= old_decl
;
11126 elt
.args
= DECL_TI_ARGS (spec
);
11127 elt
.spec
= NULL_TREE
;
11129 decl_specializations
->remove_elt (&elt
);
11131 DECL_TI_ARGS (spec
)
11132 = add_outermost_template_args (new_args
,
11133 DECL_TI_ARGS (spec
));
11135 register_specialization
11136 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
11139 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
11143 /* The information from NEW_FRIEND has been merged into OLD_DECL
11144 by duplicate_decls. */
11145 new_friend
= old_decl
;
11150 tree context
= DECL_CONTEXT (new_friend
);
11154 template <class T> class C {
11155 template <class U> friend void C1<U>::f (); // case 1
11156 friend void C2<T>::f (); // case 2
11158 we only need to make sure CONTEXT is a complete type for
11159 case 2. To distinguish between the two cases, we note that
11160 CONTEXT of case 1 remains dependent type after tsubst while
11161 this isn't true for case 2. */
11162 ++processing_template_decl
;
11163 dependent_p
= dependent_type_p (context
);
11164 --processing_template_decl
;
11167 && !complete_type_or_else (context
, NULL_TREE
))
11168 return error_mark_node
;
11170 if (COMPLETE_TYPE_P (context
))
11172 tree fn
= new_friend
;
11173 /* do_friend adds the TEMPLATE_DECL for any member friend
11174 template even if it isn't a member template, i.e.
11175 template <class T> friend A<T>::f();
11176 Look through it in that case. */
11177 if (TREE_CODE (fn
) == TEMPLATE_DECL
11178 && !PRIMARY_TEMPLATE_P (fn
))
11179 fn
= DECL_TEMPLATE_RESULT (fn
);
11180 /* Check to see that the declaration is really present, and,
11181 possibly obtain an improved declaration. */
11182 fn
= check_classfn (context
, fn
, NULL_TREE
);
11192 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
11193 template arguments, as for tsubst.
11195 Returns an appropriate tsubst'd friend type or error_mark_node on
11199 tsubst_friend_class (tree friend_tmpl
, tree args
)
11203 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
11205 tmpl
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
11206 return TREE_TYPE (tmpl
);
11209 tree context
= CP_DECL_CONTEXT (friend_tmpl
);
11210 if (TREE_CODE (context
) == NAMESPACE_DECL
)
11211 push_nested_namespace (context
);
11214 context
= tsubst (context
, args
, tf_error
, NULL_TREE
);
11215 push_nested_class (context
);
11218 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), LOOK_where::CLASS_NAMESPACE
,
11219 LOOK_want::NORMAL
| LOOK_want::HIDDEN_FRIEND
);
11221 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
11223 /* The friend template has already been declared. Just
11224 check to see that the declarations match, and install any new
11225 default parameters. We must tsubst the default parameters,
11226 of course. We only need the innermost template parameters
11227 because that is all that redeclare_class_template will look
11229 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
11230 > TMPL_ARGS_DEPTH (args
))
11232 tree parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
11233 args
, tf_warning_or_error
);
11234 location_t saved_input_location
= input_location
;
11235 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
11236 tree cons
= get_constraints (tmpl
);
11237 redeclare_class_template (TREE_TYPE (tmpl
), parms
, cons
);
11238 input_location
= saved_input_location
;
11243 /* The friend template has not already been declared. In this
11244 case, the instantiation of the template class will cause the
11245 injection of this template into the namespace scope. */
11246 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
11248 if (tmpl
!= error_mark_node
)
11250 /* The new TMPL is not an instantiation of anything, so we
11251 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE
11252 for the new type because that is supposed to be the
11253 corresponding template decl, i.e., TMPL. */
11254 DECL_USE_TEMPLATE (tmpl
) = 0;
11255 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
11256 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
11257 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
11258 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
11260 /* It is hidden. */
11261 retrofit_lang_decl (DECL_TEMPLATE_RESULT (tmpl
));
11262 DECL_ANTICIPATED (tmpl
)
11263 = DECL_ANTICIPATED (DECL_TEMPLATE_RESULT (tmpl
)) = true;
11265 /* Substitute into and set the constraints on the new declaration. */
11266 if (tree ci
= get_constraints (friend_tmpl
))
11268 ++processing_template_decl
;
11269 ci
= tsubst_constraint_info (ci
, args
, tf_warning_or_error
,
11270 DECL_FRIEND_CONTEXT (friend_tmpl
));
11271 --processing_template_decl
;
11272 set_constraints (tmpl
, ci
);
11275 /* Inject this template into the enclosing namspace scope. */
11276 tmpl
= pushdecl_namespace_level (tmpl
, true);
11280 if (TREE_CODE (context
) == NAMESPACE_DECL
)
11281 pop_nested_namespace (context
);
11283 pop_nested_class ();
11285 return TREE_TYPE (tmpl
);
11288 /* Returns zero if TYPE cannot be completed later due to circularity.
11289 Otherwise returns one. */
11292 can_complete_type_without_circularity (tree type
)
11294 if (type
== NULL_TREE
|| type
== error_mark_node
)
11296 else if (COMPLETE_TYPE_P (type
))
11298 else if (TREE_CODE (type
) == ARRAY_TYPE
)
11299 return can_complete_type_without_circularity (TREE_TYPE (type
));
11300 else if (CLASS_TYPE_P (type
)
11301 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
11307 static tree
tsubst_omp_clauses (tree
, enum c_omp_region_type
, tree
,
11308 tsubst_flags_t
, tree
);
11310 /* Instantiate a single dependent attribute T (a TREE_LIST), and return either
11311 T or a new TREE_LIST, possibly a chain in the case of a pack expansion. */
11314 tsubst_attribute (tree t
, tree
*decl_p
, tree args
,
11315 tsubst_flags_t complain
, tree in_decl
)
11317 gcc_assert (ATTR_IS_DEPENDENT (t
));
11319 tree val
= TREE_VALUE (t
);
11320 if (val
== NULL_TREE
)
11321 /* Nothing to do. */;
11322 else if ((flag_openmp
|| flag_openmp_simd
)
11323 && is_attribute_p ("omp declare simd",
11324 get_attribute_name (t
)))
11326 tree clauses
= TREE_VALUE (val
);
11327 clauses
= tsubst_omp_clauses (clauses
, C_ORT_OMP_DECLARE_SIMD
, args
,
11328 complain
, in_decl
);
11329 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
11330 clauses
= finish_omp_clauses (clauses
, C_ORT_OMP_DECLARE_SIMD
);
11331 tree parms
= DECL_ARGUMENTS (*decl_p
);
11333 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
11335 val
= build_tree_list (NULL_TREE
, clauses
);
11339 else if (flag_openmp
11340 && is_attribute_p ("omp declare variant base",
11341 get_attribute_name (t
)))
11343 ++cp_unevaluated_operand
;
11345 = tsubst_expr (TREE_PURPOSE (val
), args
, complain
,
11346 in_decl
, /*integral_constant_expression_p=*/false);
11347 --cp_unevaluated_operand
;
11348 tree chain
= TREE_CHAIN (val
);
11349 location_t match_loc
= cp_expr_loc_or_input_loc (TREE_PURPOSE (chain
));
11350 tree ctx
= copy_list (TREE_VALUE (val
));
11351 tree simd
= get_identifier ("simd");
11352 tree score
= get_identifier (" score");
11353 tree condition
= get_identifier ("condition");
11354 for (tree t1
= ctx
; t1
; t1
= TREE_CHAIN (t1
))
11356 const char *set
= IDENTIFIER_POINTER (TREE_PURPOSE (t1
));
11357 TREE_VALUE (t1
) = copy_list (TREE_VALUE (t1
));
11358 for (tree t2
= TREE_VALUE (t1
); t2
; t2
= TREE_CHAIN (t2
))
11360 if (TREE_PURPOSE (t2
) == simd
&& set
[0] == 'c')
11362 tree clauses
= TREE_VALUE (t2
);
11363 clauses
= tsubst_omp_clauses (clauses
,
11364 C_ORT_OMP_DECLARE_SIMD
, args
,
11365 complain
, in_decl
);
11366 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
11367 clauses
= finish_omp_clauses (clauses
, C_ORT_OMP_DECLARE_SIMD
);
11368 TREE_VALUE (t2
) = clauses
;
11372 TREE_VALUE (t2
) = copy_list (TREE_VALUE (t2
));
11373 for (tree t3
= TREE_VALUE (t2
); t3
; t3
= TREE_CHAIN (t3
))
11374 if (TREE_VALUE (t3
))
11377 = ((TREE_PURPOSE (t2
) != condition
|| set
[0] != 'u')
11378 && TREE_PURPOSE (t3
) != score
);
11379 tree v
= TREE_VALUE (t3
);
11380 if (TREE_CODE (v
) == STRING_CST
&& allow_string
)
11382 v
= tsubst_expr (v
, args
, complain
, in_decl
, true);
11383 v
= fold_non_dependent_expr (v
);
11384 if (!INTEGRAL_TYPE_P (TREE_TYPE (v
))
11385 || (TREE_PURPOSE (t3
) == score
11386 ? TREE_CODE (v
) != INTEGER_CST
11387 : !tree_fits_shwi_p (v
)))
11390 = cp_expr_loc_or_loc (TREE_VALUE (t3
),
11392 if (TREE_PURPOSE (t3
) == score
)
11393 error_at (loc
, "score argument must be "
11394 "constant integer expression");
11395 else if (allow_string
)
11396 error_at (loc
, "property must be constant "
11397 "integer expression or string "
11400 error_at (loc
, "property must be constant "
11401 "integer expression");
11404 else if (TREE_PURPOSE (t3
) == score
11405 && tree_int_cst_sgn (v
) < 0)
11408 = cp_expr_loc_or_loc (TREE_VALUE (t3
),
11410 error_at (loc
, "score argument must be "
11414 TREE_VALUE (t3
) = v
;
11419 val
= tree_cons (varid
, ctx
, chain
);
11421 /* If the first attribute argument is an identifier, don't
11422 pass it through tsubst. Attributes like mode, format,
11423 cleanup and several target specific attributes expect it
11425 else if (attribute_takes_identifier_p (get_attribute_name (t
)))
11428 = tsubst_expr (TREE_CHAIN (val
), args
, complain
, in_decl
,
11429 /*integral_constant_expression_p=*/false);
11430 if (chain
!= TREE_CHAIN (val
))
11431 val
= tree_cons (NULL_TREE
, TREE_VALUE (val
), chain
);
11433 else if (PACK_EXPANSION_P (val
))
11435 /* An attribute pack expansion. */
11436 tree purp
= TREE_PURPOSE (t
);
11437 tree pack
= tsubst_pack_expansion (val
, args
, complain
, in_decl
);
11438 if (pack
== error_mark_node
)
11439 return error_mark_node
;
11440 int len
= TREE_VEC_LENGTH (pack
);
11441 tree list
= NULL_TREE
;
11443 for (int i
= 0; i
< len
; ++i
)
11445 tree elt
= TREE_VEC_ELT (pack
, i
);
11446 *q
= build_tree_list (purp
, elt
);
11447 q
= &TREE_CHAIN (*q
);
11452 val
= tsubst_expr (val
, args
, complain
, in_decl
,
11453 /*integral_constant_expression_p=*/false);
11455 if (val
!= TREE_VALUE (t
))
11456 return build_tree_list (TREE_PURPOSE (t
), val
);
11460 /* Instantiate any dependent attributes in ATTRIBUTES, returning either it
11461 unchanged or a new TREE_LIST chain. */
11464 tsubst_attributes (tree attributes
, tree args
,
11465 tsubst_flags_t complain
, tree in_decl
)
11467 tree last_dep
= NULL_TREE
;
11469 for (tree t
= attributes
; t
; t
= TREE_CHAIN (t
))
11470 if (ATTR_IS_DEPENDENT (t
))
11473 attributes
= copy_list (attributes
);
11478 for (tree
*p
= &attributes
; *p
; )
11481 if (ATTR_IS_DEPENDENT (t
))
11483 tree subst
= tsubst_attribute (t
, NULL
, args
, complain
, in_decl
);
11488 p
= &TREE_CHAIN (*p
);
11489 *p
= TREE_CHAIN (t
);
11493 p
= &TREE_CHAIN (*p
);
11499 /* Apply any attributes which had to be deferred until instantiation
11500 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
11501 ARGS, COMPLAIN, IN_DECL are as tsubst. */
11504 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
11505 tree args
, tsubst_flags_t complain
, tree in_decl
)
11507 tree last_dep
= NULL_TREE
;
11511 if (attributes
== NULL_TREE
)
11514 if (DECL_P (*decl_p
))
11516 if (TREE_TYPE (*decl_p
) == error_mark_node
)
11518 p
= &DECL_ATTRIBUTES (*decl_p
);
11519 /* DECL_ATTRIBUTES comes from copy_node in tsubst_decl, and is identical
11520 to our attributes parameter. */
11521 gcc_assert (*p
== attributes
);
11525 p
= &TYPE_ATTRIBUTES (*decl_p
);
11526 /* TYPE_ATTRIBUTES was set up (with abi_tag and may_alias) in
11527 lookup_template_class_1, and should be preserved. */
11528 gcc_assert (*p
!= attributes
);
11530 p
= &TREE_CHAIN (*p
);
11533 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
11534 if (ATTR_IS_DEPENDENT (t
))
11537 attributes
= copy_list (attributes
);
11544 tree late_attrs
= NULL_TREE
;
11545 tree
*q
= &late_attrs
;
11550 if (ATTR_IS_DEPENDENT (t
))
11552 *p
= TREE_CHAIN (t
);
11553 TREE_CHAIN (t
) = NULL_TREE
;
11554 *q
= tsubst_attribute (t
, decl_p
, args
, complain
, in_decl
);
11556 q
= &TREE_CHAIN (*q
);
11559 p
= &TREE_CHAIN (t
);
11562 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
11566 /* The template TMPL is being instantiated with the template arguments TARGS.
11567 Perform the access checks that we deferred when parsing the template. */
11570 perform_instantiation_time_access_checks (tree tmpl
, tree targs
)
11573 deferred_access_check
*chk
;
11575 if (!CLASS_TYPE_P (tmpl
) && TREE_CODE (tmpl
) != FUNCTION_DECL
)
11578 if (vec
<deferred_access_check
, va_gc
> *access_checks
11579 = TI_DEFERRED_ACCESS_CHECKS (get_template_info (tmpl
)))
11580 FOR_EACH_VEC_ELT (*access_checks
, i
, chk
)
11582 tree decl
= chk
->decl
;
11583 tree diag_decl
= chk
->diag_decl
;
11584 tree type_scope
= TREE_TYPE (chk
->binfo
);
11586 if (uses_template_parms (type_scope
))
11587 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
11589 /* Make access check error messages point to the location
11590 of the use of the typedef. */
11591 iloc_sentinel
ils (chk
->loc
);
11592 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
11593 decl
, diag_decl
, tf_warning_or_error
);
11598 instantiate_class_template_1 (tree type
)
11600 tree templ
, args
, pattern
, t
, member
;
11604 unsigned int saved_maximum_field_alignment
;
11607 if (type
== error_mark_node
)
11608 return error_mark_node
;
11610 if (COMPLETE_OR_OPEN_TYPE_P (type
)
11611 || uses_template_parms (type
))
11614 /* Figure out which template is being instantiated. */
11615 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
11616 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
11618 /* Mark the type as in the process of being defined. */
11619 TYPE_BEING_DEFINED (type
) = 1;
11621 /* We may be in the middle of deferred access check. Disable
11623 deferring_access_check_sentinel
acs (dk_no_deferred
);
11625 /* Determine what specialization of the original template to
11627 t
= most_specialized_partial_spec (type
, tf_warning_or_error
);
11628 if (t
== error_mark_node
)
11629 return error_mark_node
;
11632 /* This TYPE is actually an instantiation of a partial
11633 specialization. We replace the innermost set of ARGS with
11634 the arguments appropriate for substitution. For example,
11637 template <class T> struct S {};
11638 template <class T> struct S<T*> {};
11640 and supposing that we are instantiating S<int*>, ARGS will
11641 presently be {int*} -- but we need {int}. */
11642 pattern
= TREE_TYPE (t
);
11643 args
= TREE_PURPOSE (t
);
11647 pattern
= TREE_TYPE (templ
);
11648 args
= CLASSTYPE_TI_ARGS (type
);
11651 /* If the template we're instantiating is incomplete, then clearly
11652 there's nothing we can do. */
11653 if (!COMPLETE_TYPE_P (pattern
))
11655 /* We can try again later. */
11656 TYPE_BEING_DEFINED (type
) = 0;
11660 /* If we've recursively instantiated too many templates, stop. */
11661 if (! push_tinst_level (type
))
11664 int saved_unevaluated_operand
= cp_unevaluated_operand
;
11665 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
11667 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
11668 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
11669 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
11670 fn_context
= error_mark_node
;
11672 push_to_top_level ();
11675 cp_unevaluated_operand
= 0;
11676 c_inhibit_evaluation_warnings
= 0;
11678 /* Use #pragma pack from the template context. */
11679 saved_maximum_field_alignment
= maximum_field_alignment
;
11680 maximum_field_alignment
= TYPE_PRECISION (pattern
);
11682 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
11684 /* Set the input location to the most specialized template definition.
11685 This is needed if tsubsting causes an error. */
11686 typedecl
= TYPE_MAIN_DECL (pattern
);
11687 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
11688 DECL_SOURCE_LOCATION (typedecl
);
11690 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
11691 SET_TYPE_ALIGN (type
, TYPE_ALIGN (pattern
));
11692 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
11693 CLASSTYPE_NON_AGGREGATE (type
) = CLASSTYPE_NON_AGGREGATE (pattern
);
11694 if (ANON_AGGR_TYPE_P (pattern
))
11695 SET_ANON_AGGR_TYPE_P (type
);
11696 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
11698 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
11699 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
11700 /* Adjust visibility for template arguments. */
11701 determine_visibility (TYPE_MAIN_DECL (type
));
11703 if (CLASS_TYPE_P (type
))
11704 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
11706 pbinfo
= TYPE_BINFO (pattern
);
11708 /* We should never instantiate a nested class before its enclosing
11709 class; we need to look up the nested class by name before we can
11710 instantiate it, and that lookup should instantiate the enclosing
11712 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
11713 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
11715 base_list
= NULL_TREE
;
11716 if (BINFO_N_BASE_BINFOS (pbinfo
))
11722 /* We must enter the scope containing the type, as that is where
11723 the accessibility of types named in dependent bases are
11725 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
11727 /* Substitute into each of the bases to determine the actual
11729 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
11732 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
11733 tree expanded_bases
= NULL_TREE
;
11736 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
11739 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
11740 args
, tf_error
, NULL_TREE
);
11741 if (expanded_bases
== error_mark_node
)
11744 len
= TREE_VEC_LENGTH (expanded_bases
);
11747 for (idx
= 0; idx
< len
; idx
++)
11749 if (expanded_bases
)
11750 /* Extract the already-expanded base class. */
11751 base
= TREE_VEC_ELT (expanded_bases
, idx
);
11753 /* Substitute to figure out the base class. */
11754 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
11757 if (base
== error_mark_node
)
11760 base_list
= tree_cons (access
, base
, base_list
);
11761 if (BINFO_VIRTUAL_P (pbase_binfo
))
11762 TREE_TYPE (base_list
) = integer_type_node
;
11766 /* The list is now in reverse order; correct that. */
11767 base_list
= nreverse (base_list
);
11770 pop_scope (pushed_scope
);
11772 /* Now call xref_basetypes to set up all the base-class
11774 xref_basetypes (type
, base_list
);
11776 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
11777 (int) ATTR_FLAG_TYPE_IN_PLACE
,
11778 args
, tf_error
, NULL_TREE
);
11779 fixup_attribute_variants (type
);
11781 /* Now that our base classes are set up, enter the scope of the
11782 class, so that name lookups into base classes, etc. will work
11783 correctly. This is precisely analogous to what we do in
11784 begin_class_definition when defining an ordinary non-template
11785 class, except we also need to push the enclosing classes. */
11786 push_nested_class (type
);
11788 /* Now members are processed in the order of declaration. */
11789 for (member
= CLASSTYPE_DECL_LIST (pattern
);
11790 member
; member
= TREE_CHAIN (member
))
11792 tree t
= TREE_VALUE (member
);
11794 if (TREE_PURPOSE (member
))
11798 if (LAMBDA_TYPE_P (t
))
11799 /* A closure type for a lambda in an NSDMI or default argument.
11800 Ignore it; it will be regenerated when needed. */
11803 /* Build new CLASSTYPE_NESTED_UTDS. */
11804 bool class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
11805 && TYPE_LANG_SPECIFIC (t
)
11806 && CLASSTYPE_IS_TEMPLATE (t
));
11808 /* If the member is a class template, then -- even after
11809 substitution -- there may be dependent types in the
11810 template argument list for the class. We increment
11811 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
11812 that function will assume that no types are dependent
11813 when outside of a template. */
11814 if (class_template_p
)
11815 ++processing_template_decl
;
11816 tree newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
11817 if (class_template_p
)
11818 --processing_template_decl
;
11819 if (newtag
== error_mark_node
)
11822 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
11824 tree name
= TYPE_IDENTIFIER (t
);
11826 if (class_template_p
)
11827 /* Unfortunately, lookup_template_class sets
11828 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
11829 instantiation (i.e., for the type of a member
11830 template class nested within a template class.)
11831 This behavior is required for
11832 maybe_process_partial_specialization to work
11833 correctly, but is not accurate in this case;
11834 the TAG is not an instantiation of anything.
11835 (The corresponding TEMPLATE_DECL is an
11836 instantiation, but the TYPE is not.) */
11837 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
11839 /* Now, we call pushtag to put this NEWTAG into the scope of
11840 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
11841 pushtag calling push_template_decl. We don't have to do
11842 this for enums because it will already have been done in
11845 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
11846 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
11849 else if (DECL_DECLARES_FUNCTION_P (t
))
11853 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11854 ++processing_template_decl
;
11855 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
11856 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11857 --processing_template_decl
;
11858 set_current_access_from_decl (r
);
11859 finish_member_declaration (r
);
11860 /* Instantiate members marked with attribute used. */
11861 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
11863 if (TREE_CODE (r
) == FUNCTION_DECL
11864 && DECL_OMP_DECLARE_REDUCTION_P (r
))
11865 cp_check_omp_declare_reduction (r
);
11867 else if ((DECL_CLASS_TEMPLATE_P (t
) || DECL_IMPLICIT_TYPEDEF_P (t
))
11868 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
11869 /* A closure type for a lambda in an NSDMI or default argument.
11870 Ignore it; it will be regenerated when needed. */;
11873 /* Build new TYPE_FIELDS. */
11874 if (TREE_CODE (t
) == STATIC_ASSERT
)
11875 tsubst_expr (t
, args
, tf_warning_or_error
, NULL_TREE
,
11876 /*integral_constant_expression_p=*/true);
11877 else if (TREE_CODE (t
) != CONST_DECL
)
11880 tree vec
= NULL_TREE
;
11883 gcc_checking_assert (TREE_CODE (t
) != CONST_DECL
);
11884 /* The file and line for this declaration, to
11885 assist in error message reporting. Since we
11886 called push_tinst_level above, we don't need to
11888 input_location
= DECL_SOURCE_LOCATION (t
);
11890 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11891 ++processing_template_decl
;
11892 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
11893 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11894 --processing_template_decl
;
11896 if (TREE_CODE (r
) == TREE_VEC
)
11898 /* A capture pack became multiple fields. */
11900 len
= TREE_VEC_LENGTH (vec
);
11903 for (int i
= 0; i
< len
; ++i
)
11906 r
= TREE_VEC_ELT (vec
, i
);
11911 [t]he initialization (and any associated
11912 side-effects) of a static data member does
11913 not occur unless the static data member is
11914 itself used in a way that requires the
11915 definition of the static data member to
11918 Therefore, we do not substitute into the
11919 initialized for the static data member here. */
11920 finish_static_data_member_decl
11922 /*init=*/NULL_TREE
,
11923 /*init_const_expr_p=*/false,
11924 /*asmspec_tree=*/NULL_TREE
,
11926 /* Instantiate members marked with attribute used. */
11927 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
11930 else if (TREE_CODE (r
) == FIELD_DECL
)
11932 /* Determine whether R has a valid type and can be
11933 completed later. If R is invalid, then its type
11934 is replaced by error_mark_node. */
11935 tree rtype
= TREE_TYPE (r
);
11936 if (can_complete_type_without_circularity (rtype
))
11937 complete_type (rtype
);
11939 if (!complete_or_array_type_p (rtype
))
11941 /* If R's type couldn't be completed and
11942 it isn't a flexible array member (whose
11943 type is incomplete by definition) give
11945 cxx_incomplete_type_error (r
, rtype
);
11946 TREE_TYPE (r
) = error_mark_node
;
11948 else if (TREE_CODE (rtype
) == ARRAY_TYPE
11949 && TYPE_DOMAIN (rtype
) == NULL_TREE
11950 && (TREE_CODE (type
) == UNION_TYPE
11951 || TREE_CODE (type
) == QUAL_UNION_TYPE
))
11953 error ("flexible array member %qD in union", r
);
11954 TREE_TYPE (r
) = error_mark_node
;
11956 else if (!verify_type_context (input_location
,
11957 TCTX_FIELD
, rtype
))
11958 TREE_TYPE (r
) = error_mark_node
;
11961 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
11962 such a thing will already have been added to the field
11963 list by tsubst_enum in finish_member_declaration in the
11964 CLASSTYPE_NESTED_UTDS case above. */
11965 if (!(TREE_CODE (r
) == TYPE_DECL
11966 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
11967 && DECL_ARTIFICIAL (r
)))
11969 set_current_access_from_decl (r
);
11970 finish_member_declaration (r
);
11978 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
11979 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
11981 /* Build new CLASSTYPE_FRIEND_CLASSES. */
11983 tree friend_type
= t
;
11984 bool adjust_processing_template_decl
= false;
11986 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
11988 /* template <class T> friend class C; */
11989 friend_type
= tsubst_friend_class (friend_type
, args
);
11990 adjust_processing_template_decl
= true;
11992 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
11994 /* template <class T> friend class C::D; */
11995 friend_type
= tsubst (friend_type
, args
,
11996 tf_warning_or_error
, NULL_TREE
);
11997 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
11998 friend_type
= TREE_TYPE (friend_type
);
11999 adjust_processing_template_decl
= true;
12001 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
12002 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
12004 /* This could be either
12008 when dependent_type_p is false or
12010 template <class U> friend class T::C;
12013 /* Bump processing_template_decl in case this is something like
12014 template <class T> friend struct A<T>::B. */
12015 ++processing_template_decl
;
12016 friend_type
= tsubst (friend_type
, args
,
12017 tf_warning_or_error
, NULL_TREE
);
12018 if (dependent_type_p (friend_type
))
12019 adjust_processing_template_decl
= true;
12020 --processing_template_decl
;
12022 else if (TREE_CODE (friend_type
) != BOUND_TEMPLATE_TEMPLATE_PARM
12023 && !CLASSTYPE_USE_TEMPLATE (friend_type
)
12024 && TYPE_HIDDEN_P (friend_type
))
12028 where C hasn't been declared yet. Let's lookup name
12029 from namespace scope directly, bypassing any name that
12030 come from dependent base class. */
12031 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
12033 /* The call to xref_tag_from_type does injection for friend
12035 push_nested_namespace (ns
);
12037 xref_tag_from_type (friend_type
, NULL_TREE
,
12038 /*tag_scope=*/ts_current
);
12039 pop_nested_namespace (ns
);
12041 else if (uses_template_parms (friend_type
))
12042 /* friend class C<T>; */
12043 friend_type
= tsubst (friend_type
, args
,
12044 tf_warning_or_error
, NULL_TREE
);
12049 where C is already declared or
12051 friend class C<int>;
12053 We don't have to do anything in these cases. */
12055 if (adjust_processing_template_decl
)
12056 /* Trick make_friend_class into realizing that the friend
12057 we're adding is a template, not an ordinary class. It's
12058 important that we use make_friend_class since it will
12059 perform some error-checking and output cross-reference
12061 ++processing_template_decl
;
12063 if (friend_type
!= error_mark_node
)
12064 make_friend_class (type
, friend_type
, /*complain=*/false);
12066 if (adjust_processing_template_decl
)
12067 --processing_template_decl
;
12071 /* Build new DECL_FRIENDLIST. */
12074 /* The file and line for this declaration, to
12075 assist in error message reporting. Since we
12076 called push_tinst_level above, we don't need to
12078 input_location
= DECL_SOURCE_LOCATION (t
);
12080 if (TREE_CODE (t
) == TEMPLATE_DECL
)
12082 ++processing_template_decl
;
12083 push_deferring_access_checks (dk_no_check
);
12086 r
= tsubst_friend_function (t
, args
);
12087 add_friend (type
, r
, /*complain=*/false);
12088 if (TREE_CODE (t
) == TEMPLATE_DECL
)
12090 pop_deferring_access_checks ();
12091 --processing_template_decl
;
12099 /* Restore these before substituting into the lambda capture
12101 cp_unevaluated_operand
= saved_unevaluated_operand
;
12102 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
12105 /* Set the file and line number information to whatever is given for
12106 the class itself. This puts error messages involving generated
12107 implicit functions at a predictable point, and the same point
12108 that would be used for non-template classes. */
12109 input_location
= DECL_SOURCE_LOCATION (typedecl
);
12111 unreverse_member_declarations (type
);
12112 finish_struct_1 (type
);
12113 TYPE_BEING_DEFINED (type
) = 0;
12115 /* We don't instantiate default arguments for member functions. 14.7.1:
12117 The implicit instantiation of a class template specialization causes
12118 the implicit instantiation of the declarations, but not of the
12119 definitions or default arguments, of the class member functions,
12120 member classes, static data members and member templates.... */
12122 perform_instantiation_time_access_checks (pattern
, args
);
12123 perform_deferred_access_checks (tf_warning_or_error
);
12124 pop_nested_class ();
12125 maximum_field_alignment
= saved_maximum_field_alignment
;
12127 pop_from_top_level ();
12128 pop_tinst_level ();
12130 /* The vtable for a template class can be emitted in any translation
12131 unit in which the class is instantiated. When there is no key
12132 method, however, finish_struct_1 will already have added TYPE to
12133 the keyed_classes. */
12134 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
12135 vec_safe_push (keyed_classes
, type
);
12140 /* Wrapper for instantiate_class_template_1. */
12143 instantiate_class_template (tree type
)
12146 timevar_push (TV_TEMPLATE_INST
);
12147 ret
= instantiate_class_template_1 (type
);
12148 timevar_pop (TV_TEMPLATE_INST
);
12153 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12159 else if (TYPE_P (t
))
12160 r
= tsubst (t
, args
, complain
, in_decl
);
12163 if (!(complain
& tf_warning
))
12164 ++c_inhibit_evaluation_warnings
;
12165 r
= tsubst_expr (t
, args
, complain
, in_decl
,
12166 /*integral_constant_expression_p=*/true);
12167 if (!(complain
& tf_warning
))
12168 --c_inhibit_evaluation_warnings
;
12174 /* Given a function parameter pack TMPL_PARM and some function parameters
12175 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
12176 and set *SPEC_P to point at the next point in the list. */
12179 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
12181 /* Collect all of the extra "packed" parameters into an
12184 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
12185 tree spec_parm
= *spec_p
;
12188 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
12190 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
12193 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
12194 parmvec
= make_tree_vec (len
);
12195 spec_parm
= *spec_p
;
12196 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
12198 tree elt
= spec_parm
;
12199 if (DECL_PACK_P (elt
))
12200 elt
= make_pack_expansion (elt
);
12201 TREE_VEC_ELT (parmvec
, i
) = elt
;
12204 /* Build the argument packs. */
12205 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
12206 *spec_p
= spec_parm
;
12211 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
12212 NONTYPE_ARGUMENT_PACK. */
12215 make_fnparm_pack (tree spec_parm
)
12217 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
12220 /* Return 1 if the Ith element of the argument pack ARG_PACK is a
12221 pack expansion with no extra args, 2 if it has extra args, or 0
12222 if it is not a pack expansion. */
12225 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
12227 if (TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
12228 /* We're being called before this happens in tsubst_pack_expansion. */
12229 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
12230 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
12231 if (i
>= TREE_VEC_LENGTH (vec
))
12233 tree elt
= TREE_VEC_ELT (vec
, i
);
12235 /* A decl pack is itself an expansion. */
12236 elt
= TREE_TYPE (elt
);
12237 if (!PACK_EXPANSION_P (elt
))
12239 if (PACK_EXPANSION_EXTRA_ARGS (elt
))
12245 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
12248 make_argument_pack_select (tree arg_pack
, unsigned index
)
12250 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
12252 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
12253 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
12258 /* This is a subroutine of tsubst_pack_expansion.
12260 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
12261 mechanism to store the (non complete list of) arguments of the
12262 substitution and return a non substituted pack expansion, in order
12263 to wait for when we have enough arguments to really perform the
12267 use_pack_expansion_extra_args_p (tree parm_packs
,
12269 bool has_empty_arg
)
12271 /* If one pack has an expansion and another pack has a normal
12272 argument or if one pack has an empty argument and an another
12273 one hasn't then tsubst_pack_expansion cannot perform the
12274 substitution and need to fall back on the
12275 PACK_EXPANSION_EXTRA mechanism. */
12276 if (parm_packs
== NULL_TREE
)
12278 else if (has_empty_arg
)
12280 /* If all the actual packs are pack expansions, we can still
12281 subsitute directly. */
12282 for (tree p
= parm_packs
; p
; p
= TREE_CHAIN (p
))
12284 tree a
= TREE_VALUE (p
);
12285 if (TREE_CODE (a
) == ARGUMENT_PACK_SELECT
)
12286 a
= ARGUMENT_PACK_SELECT_FROM_PACK (a
);
12287 a
= ARGUMENT_PACK_ARGS (a
);
12288 if (TREE_VEC_LENGTH (a
) == 1)
12289 a
= TREE_VEC_ELT (a
, 0);
12290 if (PACK_EXPANSION_P (a
))
12297 bool has_expansion_arg
= false;
12298 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
12300 bool has_non_expansion_arg
= false;
12301 for (tree parm_pack
= parm_packs
;
12303 parm_pack
= TREE_CHAIN (parm_pack
))
12305 tree arg
= TREE_VALUE (parm_pack
);
12307 int exp
= argument_pack_element_is_expansion_p (arg
, i
);
12309 /* We can't substitute a pack expansion with extra args into
12313 has_expansion_arg
= true;
12315 has_non_expansion_arg
= true;
12318 if (has_expansion_arg
&& has_non_expansion_arg
)
12324 /* [temp.variadic]/6 says that:
12326 The instantiation of a pack expansion [...]
12327 produces a list E1,E2, ..., En, where N is the number of elements
12328 in the pack expansion parameters.
12330 This subroutine of tsubst_pack_expansion produces one of these Ei.
12332 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
12333 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
12334 PATTERN, and each TREE_VALUE is its corresponding argument pack.
12335 INDEX is the index 'i' of the element Ei to produce. ARGS,
12336 COMPLAIN, and IN_DECL are the same parameters as for the
12337 tsubst_pack_expansion function.
12339 The function returns the resulting Ei upon successful completion,
12340 or error_mark_node.
12342 Note that this function possibly modifies the ARGS parameter, so
12343 it's the responsibility of the caller to restore it. */
12346 gen_elem_of_pack_expansion_instantiation (tree pattern
,
12349 tree args
/* This parm gets
12351 tsubst_flags_t complain
,
12355 bool ith_elem_is_expansion
= false;
12357 /* For each parameter pack, change the substitution of the parameter
12358 pack to the ith argument in its argument pack, then expand the
12360 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
12362 tree parm
= TREE_PURPOSE (pack
);
12363 tree arg_pack
= TREE_VALUE (pack
);
12364 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
12366 ith_elem_is_expansion
|=
12367 argument_pack_element_is_expansion_p (arg_pack
, index
);
12369 /* Select the Ith argument from the pack. */
12370 if (TREE_CODE (parm
) == PARM_DECL
12372 || TREE_CODE (parm
) == FIELD_DECL
)
12376 aps
= make_argument_pack_select (arg_pack
, index
);
12377 if (!mark_used (parm
, complain
) && !(complain
& tf_error
))
12378 return error_mark_node
;
12379 register_local_specialization (aps
, parm
);
12382 aps
= retrieve_local_specialization (parm
);
12387 template_parm_level_and_index (parm
, &level
, &idx
);
12391 aps
= make_argument_pack_select (arg_pack
, index
);
12392 /* Update the corresponding argument. */
12393 TMPL_ARG (args
, level
, idx
) = aps
;
12396 /* Re-use the ARGUMENT_PACK_SELECT. */
12397 aps
= TMPL_ARG (args
, level
, idx
);
12399 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
12402 /* Substitute into the PATTERN with the (possibly altered)
12404 if (pattern
== in_decl
)
12405 /* Expanding a fixed parameter pack from
12406 coerce_template_parameter_pack. */
12407 t
= tsubst_decl (pattern
, args
, complain
);
12408 else if (pattern
== error_mark_node
)
12409 t
= error_mark_node
;
12410 else if (!TYPE_P (pattern
))
12411 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
12412 /*integral_constant_expression_p=*/false);
12414 t
= tsubst (pattern
, args
, complain
, in_decl
);
12416 /* If the Ith argument pack element is a pack expansion, then
12417 the Ith element resulting from the substituting is going to
12418 be a pack expansion as well. */
12419 if (ith_elem_is_expansion
)
12420 t
= make_pack_expansion (t
, complain
);
12425 /* When the unexpanded parameter pack in a fold expression expands to an empty
12426 sequence, the value of the expression is as follows; the program is
12427 ill-formed if the operator is not listed in this table.
12434 expand_empty_fold (tree t
, tsubst_flags_t complain
)
12436 tree_code code
= (tree_code
)TREE_INT_CST_LOW (TREE_OPERAND (t
, 0));
12437 if (!FOLD_EXPR_MODIFY_P (t
))
12440 case TRUTH_ANDIF_EXPR
:
12441 return boolean_true_node
;
12442 case TRUTH_ORIF_EXPR
:
12443 return boolean_false_node
;
12444 case COMPOUND_EXPR
:
12450 if (complain
& tf_error
)
12451 error_at (location_of (t
),
12452 "fold of empty expansion over %O", code
);
12453 return error_mark_node
;
12456 /* Given a fold-expression T and a current LEFT and RIGHT operand,
12457 form an expression that combines the two terms using the
12461 fold_expression (tree t
, tree left
, tree right
, tsubst_flags_t complain
)
12463 tree op
= FOLD_EXPR_OP (t
);
12464 tree_code code
= (tree_code
)TREE_INT_CST_LOW (op
);
12466 // Handle compound assignment operators.
12467 if (FOLD_EXPR_MODIFY_P (t
))
12468 return build_x_modify_expr (input_location
, left
, code
, right
, complain
);
12470 warning_sentinel
s(warn_parentheses
);
12473 case COMPOUND_EXPR
:
12474 return build_x_compound_expr (input_location
, left
, right
, complain
);
12476 return build_x_binary_op (input_location
, code
,
12477 left
, TREE_CODE (left
),
12478 right
, TREE_CODE (right
),
12484 /* Substitute ARGS into the pack of a fold expression T. */
12487 tsubst_fold_expr_pack (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12489 return tsubst_pack_expansion (FOLD_EXPR_PACK (t
), args
, complain
, in_decl
);
12492 /* Substitute ARGS into the pack of a fold expression T. */
12495 tsubst_fold_expr_init (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12497 return tsubst_expr (FOLD_EXPR_INIT (t
), args
, complain
, in_decl
, false);
12500 /* Expand a PACK of arguments into a grouped as left fold.
12501 Given a pack containing elements A0, A1, ..., An and an
12502 operator @, this builds the expression:
12504 ((A0 @ A1) @ A2) ... @ An
12506 Note that PACK must not be empty.
12508 The operator is defined by the original fold expression T. */
12511 expand_left_fold (tree t
, tree pack
, tsubst_flags_t complain
)
12513 tree left
= TREE_VEC_ELT (pack
, 0);
12514 for (int i
= 1; i
< TREE_VEC_LENGTH (pack
); ++i
)
12516 tree right
= TREE_VEC_ELT (pack
, i
);
12517 left
= fold_expression (t
, left
, right
, complain
);
12522 /* Substitute into a unary left fold expression. */
12525 tsubst_unary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
12528 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
12529 if (pack
== error_mark_node
)
12530 return error_mark_node
;
12531 if (PACK_EXPANSION_P (pack
))
12533 tree r
= copy_node (t
);
12534 FOLD_EXPR_PACK (r
) = pack
;
12537 if (TREE_VEC_LENGTH (pack
) == 0)
12538 return expand_empty_fold (t
, complain
);
12540 return expand_left_fold (t
, pack
, complain
);
12543 /* Substitute into a binary left fold expression.
12545 Do ths by building a single (non-empty) vector of argumnts and
12546 building the expression from those elements. */
12549 tsubst_binary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
12552 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
12553 if (pack
== error_mark_node
)
12554 return error_mark_node
;
12555 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
12556 if (init
== error_mark_node
)
12557 return error_mark_node
;
12559 if (PACK_EXPANSION_P (pack
))
12561 tree r
= copy_node (t
);
12562 FOLD_EXPR_PACK (r
) = pack
;
12563 FOLD_EXPR_INIT (r
) = init
;
12567 tree vec
= make_tree_vec (TREE_VEC_LENGTH (pack
) + 1);
12568 TREE_VEC_ELT (vec
, 0) = init
;
12569 for (int i
= 0; i
< TREE_VEC_LENGTH (pack
); ++i
)
12570 TREE_VEC_ELT (vec
, i
+ 1) = TREE_VEC_ELT (pack
, i
);
12572 return expand_left_fold (t
, vec
, complain
);
12575 /* Expand a PACK of arguments into a grouped as right fold.
12576 Given a pack containing elementns A0, A1, ..., and an
12577 operator @, this builds the expression:
12579 A0@ ... (An-2 @ (An-1 @ An))
12581 Note that PACK must not be empty.
12583 The operator is defined by the original fold expression T. */
12586 expand_right_fold (tree t
, tree pack
, tsubst_flags_t complain
)
12588 // Build the expression.
12589 int n
= TREE_VEC_LENGTH (pack
);
12590 tree right
= TREE_VEC_ELT (pack
, n
- 1);
12591 for (--n
; n
!= 0; --n
)
12593 tree left
= TREE_VEC_ELT (pack
, n
- 1);
12594 right
= fold_expression (t
, left
, right
, complain
);
12599 /* Substitute into a unary right fold expression. */
12602 tsubst_unary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
12605 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
12606 if (pack
== error_mark_node
)
12607 return error_mark_node
;
12608 if (PACK_EXPANSION_P (pack
))
12610 tree r
= copy_node (t
);
12611 FOLD_EXPR_PACK (r
) = pack
;
12614 if (TREE_VEC_LENGTH (pack
) == 0)
12615 return expand_empty_fold (t
, complain
);
12617 return expand_right_fold (t
, pack
, complain
);
12620 /* Substitute into a binary right fold expression.
12622 Do ths by building a single (non-empty) vector of arguments and
12623 building the expression from those elements. */
12626 tsubst_binary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
12629 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
12630 if (pack
== error_mark_node
)
12631 return error_mark_node
;
12632 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
12633 if (init
== error_mark_node
)
12634 return error_mark_node
;
12636 if (PACK_EXPANSION_P (pack
))
12638 tree r
= copy_node (t
);
12639 FOLD_EXPR_PACK (r
) = pack
;
12640 FOLD_EXPR_INIT (r
) = init
;
12644 int n
= TREE_VEC_LENGTH (pack
);
12645 tree vec
= make_tree_vec (n
+ 1);
12646 for (int i
= 0; i
< n
; ++i
)
12647 TREE_VEC_ELT (vec
, i
) = TREE_VEC_ELT (pack
, i
);
12648 TREE_VEC_ELT (vec
, n
) = init
;
12650 return expand_right_fold (t
, vec
, complain
);
12653 /* Walk through the pattern of a pack expansion, adding everything in
12654 local_specializations to a list. */
12659 hash_set
<tree
> internal
;
12661 tsubst_flags_t complain
;
12663 el_data (tsubst_flags_t c
)
12664 : extra (NULL_TREE
), complain (c
) {}
12667 extract_locals_r (tree
*tp
, int */
*walk_subtrees*/
, void *data_
)
12669 el_data
&data
= *reinterpret_cast<el_data
*>(data_
);
12670 tree
*extra
= &data
.extra
;
12671 tsubst_flags_t complain
= data
.complain
;
12673 if (TYPE_P (*tp
) && typedef_variant_p (*tp
))
12674 /* Remember local typedefs (85214). */
12675 tp
= &TYPE_NAME (*tp
);
12677 if (TREE_CODE (*tp
) == DECL_EXPR
)
12678 data
.internal
.add (DECL_EXPR_DECL (*tp
));
12679 else if (tree spec
= retrieve_local_specialization (*tp
))
12681 if (data
.internal
.contains (*tp
))
12682 /* Don't mess with variables declared within the pattern. */
12684 if (TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
)
12686 /* Maybe pull out the PARM_DECL for a partial instantiation. */
12687 tree args
= ARGUMENT_PACK_ARGS (spec
);
12688 if (TREE_VEC_LENGTH (args
) == 1)
12690 tree elt
= TREE_VEC_ELT (args
, 0);
12691 if (PACK_EXPANSION_P (elt
))
12692 elt
= PACK_EXPANSION_PATTERN (elt
);
12693 if (DECL_PACK_P (elt
))
12696 if (TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
)
12698 /* Handle lambda capture here, since we aren't doing any
12699 substitution now, and so tsubst_copy won't call
12700 process_outer_var_ref. */
12701 tree args
= ARGUMENT_PACK_ARGS (spec
);
12702 int len
= TREE_VEC_LENGTH (args
);
12703 for (int i
= 0; i
< len
; ++i
)
12705 tree arg
= TREE_VEC_ELT (args
, i
);
12707 if (outer_automatic_var_p (arg
))
12708 carg
= process_outer_var_ref (arg
, complain
);
12711 /* Make a new NONTYPE_ARGUMENT_PACK of the capture
12715 spec
= copy_node (spec
);
12716 args
= copy_node (args
);
12717 SET_ARGUMENT_PACK_ARGS (spec
, args
);
12718 register_local_specialization (spec
, *tp
);
12720 TREE_VEC_ELT (args
, i
) = carg
;
12725 if (outer_automatic_var_p (spec
))
12726 spec
= process_outer_var_ref (spec
, complain
);
12727 *extra
= tree_cons (*tp
, spec
, *extra
);
12732 extract_local_specs (tree pattern
, tsubst_flags_t complain
)
12734 el_data
data (complain
);
12735 cp_walk_tree_without_duplicates (&pattern
, extract_locals_r
, &data
);
12739 /* Extract any uses of local_specializations from PATTERN and add them to ARGS
12740 for use in PACK_EXPANSION_EXTRA_ARGS. */
12743 build_extra_args (tree pattern
, tree args
, tsubst_flags_t complain
)
12746 if (local_specializations
)
12747 if (tree locals
= extract_local_specs (pattern
, complain
))
12748 extra
= tree_cons (NULL_TREE
, extra
, locals
);
12752 /* Apply any local specializations from PACK_EXPANSION_EXTRA_ARGS and add the
12753 normal template args to ARGS. */
12756 add_extra_args (tree extra
, tree args
)
12758 if (extra
&& TREE_CODE (extra
) == TREE_LIST
)
12760 for (tree elt
= TREE_CHAIN (extra
); elt
; elt
= TREE_CHAIN (elt
))
12762 /* The partial instantiation involved local declarations collected in
12763 extract_local_specs; map from the general template to our local
12765 tree gen
= TREE_PURPOSE (elt
);
12766 tree inst
= TREE_VALUE (elt
);
12768 if (tree local
= retrieve_local_specialization (inst
))
12770 /* else inst is already a full instantiation of the pack. */
12771 register_local_specialization (inst
, gen
);
12773 gcc_assert (!TREE_PURPOSE (extra
));
12774 extra
= TREE_VALUE (extra
);
12777 /* I think we should always be able to substitute dependent args into the
12778 pattern. If that turns out to be incorrect in some cases, enable the
12779 alternate code (and add complain/in_decl parms to this function). */
12780 gcc_checking_assert (!uses_template_parms (extra
));
12782 if (!uses_template_parms (extra
))
12784 gcc_unreachable ();
12785 extra
= tsubst_template_args (extra
, args
, complain
, in_decl
);
12786 args
= add_outermost_template_args (args
, extra
);
12790 args
= add_to_template_args (extra
, args
);
12794 /* Substitute ARGS into T, which is an pack expansion
12795 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
12796 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
12797 (if only a partial substitution could be performed) or
12798 ERROR_MARK_NODE if there was an error. */
12800 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
12804 tree pack
, packs
= NULL_TREE
;
12805 bool unsubstituted_packs
= false;
12808 bool need_local_specializations
= false;
12811 gcc_assert (PACK_EXPANSION_P (t
));
12812 pattern
= PACK_EXPANSION_PATTERN (t
);
12814 /* Add in any args remembered from an earlier partial instantiation. */
12815 args
= add_extra_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
12817 levels
= TMPL_ARGS_DEPTH (args
);
12819 /* Determine the argument packs that will instantiate the parameter
12820 packs used in the expansion expression. While we're at it,
12821 compute the number of arguments to be expanded and make sure it
12823 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
12824 pack
= TREE_CHAIN (pack
))
12826 tree parm_pack
= TREE_VALUE (pack
);
12827 tree arg_pack
= NULL_TREE
;
12828 tree orig_arg
= NULL_TREE
;
12831 if (TREE_CODE (parm_pack
) == BASES
)
12833 gcc_assert (parm_pack
== pattern
);
12834 if (BASES_DIRECT (parm_pack
))
12835 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
12840 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
12841 args
, complain
, in_decl
,
12844 else if (builtin_pack_call_p (parm_pack
))
12846 if (parm_pack
!= pattern
)
12848 if (complain
& tf_error
)
12849 sorry ("%qE is not the entire pattern of the pack expansion",
12851 return error_mark_node
;
12853 return expand_builtin_pack_call (parm_pack
, args
,
12854 complain
, in_decl
);
12856 else if (TREE_CODE (parm_pack
) == PARM_DECL
)
12858 /* We know we have correct local_specializations if this
12859 expansion is at function scope, or if we're dealing with a
12860 local parameter in a requires expression; for the latter,
12861 tsubst_requires_expr set it up appropriately. */
12862 if (PACK_EXPANSION_LOCAL_P (t
) || CONSTRAINT_VAR_P (parm_pack
))
12863 arg_pack
= retrieve_local_specialization (parm_pack
);
12865 /* We can't rely on local_specializations for a parameter
12866 name used later in a function declaration (such as in a
12867 late-specified return type). Even if it exists, it might
12868 have the wrong value for a recursive call. */
12869 need_local_specializations
= true;
12873 /* This parameter pack was used in an unevaluated context. Just
12874 make a dummy decl, since it's only used for its type. */
12875 ++cp_unevaluated_operand
;
12876 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
12877 --cp_unevaluated_operand
;
12878 if (arg_pack
&& DECL_PACK_P (arg_pack
))
12879 /* Partial instantiation of the parm_pack, we can't build
12880 up an argument pack yet. */
12881 arg_pack
= NULL_TREE
;
12883 arg_pack
= make_fnparm_pack (arg_pack
);
12885 else if (DECL_PACK_P (arg_pack
))
12886 /* This argument pack isn't fully instantiated yet. */
12887 arg_pack
= NULL_TREE
;
12889 else if (is_capture_proxy (parm_pack
))
12891 arg_pack
= retrieve_local_specialization (parm_pack
);
12892 if (DECL_PACK_P (arg_pack
))
12893 arg_pack
= NULL_TREE
;
12898 template_parm_level_and_index (parm_pack
, &level
, &idx
);
12899 if (level
<= levels
)
12900 arg_pack
= TMPL_ARG (args
, level
, idx
);
12902 if (arg_pack
&& TREE_CODE (arg_pack
) == TEMPLATE_TYPE_PARM
12903 && TEMPLATE_TYPE_PARAMETER_PACK (arg_pack
))
12904 arg_pack
= NULL_TREE
;
12907 orig_arg
= arg_pack
;
12908 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
12909 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
12911 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
12912 /* This can only happen if we forget to expand an argument
12913 pack somewhere else. Just return an error, silently. */
12915 result
= make_tree_vec (1);
12916 TREE_VEC_ELT (result
, 0) = error_mark_node
;
12923 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
12925 /* Don't bother trying to do a partial substitution with
12926 incomplete packs; we'll try again after deduction. */
12927 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
12932 else if (len
!= my_len
)
12934 if (!(complain
& tf_error
))
12935 /* Fail quietly. */;
12936 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
12937 error ("mismatched argument pack lengths while expanding %qT",
12940 error ("mismatched argument pack lengths while expanding %qE",
12942 return error_mark_node
;
12945 /* Keep track of the parameter packs and their corresponding
12947 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
12948 TREE_TYPE (packs
) = orig_arg
;
12952 /* We can't substitute for this parameter pack. We use a flag as
12953 well as the missing_level counter because function parameter
12954 packs don't have a level. */
12955 gcc_assert (processing_template_decl
|| is_auto (parm_pack
));
12956 unsubstituted_packs
= true;
12960 /* If the expansion is just T..., return the matching argument pack, unless
12961 we need to call convert_from_reference on all the elements. This is an
12962 important optimization; see c++/68422. */
12963 if (!unsubstituted_packs
12964 && TREE_PURPOSE (packs
) == pattern
)
12966 tree args
= ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
12968 /* If the argument pack is a single pack expansion, pull it out. */
12969 if (TREE_VEC_LENGTH (args
) == 1
12970 && pack_expansion_args_count (args
))
12971 return TREE_VEC_ELT (args
, 0);
12973 /* Types need no adjustment, nor does sizeof..., and if we still have
12974 some pack expansion args we won't do anything yet. */
12975 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
12976 || PACK_EXPANSION_SIZEOF_P (t
)
12977 || pack_expansion_args_count (args
))
12979 /* Also optimize expression pack expansions if we can tell that the
12980 elements won't have reference type. */
12981 tree type
= TREE_TYPE (pattern
);
12982 if (type
&& !TYPE_REF_P (type
)
12983 && !PACK_EXPANSION_P (type
)
12984 && !WILDCARD_TYPE_P (type
))
12986 /* Otherwise use the normal path so we get convert_from_reference. */
12989 /* We cannot expand this expansion expression, because we don't have
12990 all of the argument packs we need. */
12991 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
12993 /* We got some full packs, but we can't substitute them in until we
12994 have values for all the packs. So remember these until then. */
12996 t
= make_pack_expansion (pattern
, complain
);
12997 PACK_EXPANSION_EXTRA_ARGS (t
)
12998 = build_extra_args (pattern
, args
, complain
);
13002 /* If NEED_LOCAL_SPECIALIZATIONS then we're in a late-specified return
13003 type, so create our own local specializations map; the current map is
13004 either NULL or (in the case of recursive unification) might have
13005 bindings that we don't want to use or alter. */
13006 local_specialization_stack
lss (need_local_specializations
13007 ? lss_blank
: lss_nop
);
13009 if (unsubstituted_packs
)
13011 /* There were no real arguments, we're just replacing a parameter
13012 pack with another version of itself. Substitute into the
13013 pattern and return a PACK_EXPANSION_*. The caller will need to
13015 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
13016 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
13017 /*integral_constant_expression_p=*/false);
13019 t
= tsubst (pattern
, args
, complain
, in_decl
);
13020 t
= make_pack_expansion (t
, complain
);
13024 gcc_assert (len
>= 0);
13026 /* For each argument in each argument pack, substitute into the
13028 result
= make_tree_vec (len
);
13029 tree elem_args
= copy_template_args (args
);
13030 for (i
= 0; i
< len
; ++i
)
13032 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
13034 elem_args
, complain
,
13036 TREE_VEC_ELT (result
, i
) = t
;
13037 if (t
== error_mark_node
)
13039 result
= error_mark_node
;
13044 /* Update ARGS to restore the substitution from parameter packs to
13045 their argument packs. */
13046 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
13048 tree parm
= TREE_PURPOSE (pack
);
13050 if (TREE_CODE (parm
) == PARM_DECL
13052 || TREE_CODE (parm
) == FIELD_DECL
)
13053 register_local_specialization (TREE_TYPE (pack
), parm
);
13058 if (TREE_VALUE (pack
) == NULL_TREE
)
13061 template_parm_level_and_index (parm
, &level
, &idx
);
13063 /* Update the corresponding argument. */
13064 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
13065 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
13068 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
13072 /* If the dependent pack arguments were such that we end up with only a
13073 single pack expansion again, there's no need to keep it in a TREE_VEC. */
13074 if (len
== 1 && TREE_CODE (result
) == TREE_VEC
13075 && PACK_EXPANSION_P (TREE_VEC_ELT (result
, 0)))
13076 return TREE_VEC_ELT (result
, 0);
13081 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
13082 TMPL. We do this using DECL_PARM_INDEX, which should work even with
13083 parameter packs; all parms generated from a function parameter pack will
13084 have the same DECL_PARM_INDEX. */
13087 get_pattern_parm (tree parm
, tree tmpl
)
13089 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
13092 if (DECL_ARTIFICIAL (parm
))
13094 for (patparm
= DECL_ARGUMENTS (pattern
);
13095 patparm
; patparm
= DECL_CHAIN (patparm
))
13096 if (DECL_ARTIFICIAL (patparm
)
13097 && DECL_NAME (parm
) == DECL_NAME (patparm
))
13102 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
13103 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
13104 gcc_assert (DECL_PARM_INDEX (patparm
)
13105 == DECL_PARM_INDEX (parm
));
13111 /* Make an argument pack out of the TREE_VEC VEC. */
13114 make_argument_pack (tree vec
)
13118 if (TYPE_P (TREE_VEC_ELT (vec
, 0)))
13119 pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
13122 pack
= make_node (NONTYPE_ARGUMENT_PACK
);
13123 TREE_CONSTANT (pack
) = 1;
13125 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
13129 /* Return an exact copy of template args T that can be modified
13133 copy_template_args (tree t
)
13135 if (t
== error_mark_node
)
13138 int len
= TREE_VEC_LENGTH (t
);
13139 tree new_vec
= make_tree_vec (len
);
13141 for (int i
= 0; i
< len
; ++i
)
13143 tree elt
= TREE_VEC_ELT (t
, i
);
13144 if (elt
&& TREE_CODE (elt
) == TREE_VEC
)
13145 elt
= copy_template_args (elt
);
13146 TREE_VEC_ELT (new_vec
, i
) = elt
;
13149 NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_vec
)
13150 = NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
);
13155 /* Substitute ARGS into the *_ARGUMENT_PACK orig_arg. */
13158 tsubst_argument_pack (tree orig_arg
, tree args
, tsubst_flags_t complain
,
13161 /* Substitute into each of the arguments. */
13162 tree new_arg
= TYPE_P (orig_arg
)
13163 ? cxx_make_type (TREE_CODE (orig_arg
))
13164 : make_node (TREE_CODE (orig_arg
));
13166 tree pack_args
= tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
13167 args
, complain
, in_decl
);
13168 if (pack_args
== error_mark_node
)
13169 new_arg
= error_mark_node
;
13171 SET_ARGUMENT_PACK_ARGS (new_arg
, pack_args
);
13173 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
)
13174 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
13179 /* Substitute ARGS into the vector or list of template arguments T. */
13182 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
13185 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
13188 if (t
== error_mark_node
)
13189 return error_mark_node
;
13191 len
= TREE_VEC_LENGTH (t
);
13192 elts
= XALLOCAVEC (tree
, len
);
13194 for (i
= 0; i
< len
; i
++)
13196 tree orig_arg
= TREE_VEC_ELT (t
, i
);
13199 if (TREE_CODE (orig_arg
) == TREE_VEC
)
13200 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
13201 else if (PACK_EXPANSION_P (orig_arg
))
13203 /* Substitute into an expansion expression. */
13204 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
13206 if (TREE_CODE (new_arg
) == TREE_VEC
)
13207 /* Add to the expanded length adjustment the number of
13208 expanded arguments. We subtract one from this
13209 measurement, because the argument pack expression
13210 itself is already counted as 1 in
13211 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
13212 the argument pack is empty. */
13213 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
13215 else if (ARGUMENT_PACK_P (orig_arg
))
13216 new_arg
= tsubst_argument_pack (orig_arg
, args
, complain
, in_decl
);
13218 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
13220 if (new_arg
== error_mark_node
)
13221 return error_mark_node
;
13224 if (new_arg
!= orig_arg
)
13231 /* Make space for the expanded arguments coming from template
13233 t
= make_tree_vec (len
+ expanded_len_adjust
);
13234 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
13235 arguments for a member template.
13236 In that case each TREE_VEC in ORIG_T represents a level of template
13237 arguments, and ORIG_T won't carry any non defaulted argument count.
13238 It will rather be the nested TREE_VECs that will carry one.
13239 In other words, ORIG_T carries a non defaulted argument count only
13240 if it doesn't contain any nested TREE_VEC. */
13241 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
13243 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
13244 count
+= expanded_len_adjust
;
13245 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
13247 for (i
= 0, out
= 0; i
< len
; i
++)
13249 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
13250 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
13251 && TREE_CODE (elts
[i
]) == TREE_VEC
)
13255 /* Now expand the template argument pack "in place". */
13256 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
13257 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
13261 TREE_VEC_ELT (t
, out
) = elts
[i
];
13269 /* Substitute ARGS into one level PARMS of template parameters. */
13272 tsubst_template_parms_level (tree parms
, tree args
, tsubst_flags_t complain
)
13274 if (parms
== error_mark_node
)
13275 return error_mark_node
;
13277 tree new_vec
= make_tree_vec (TREE_VEC_LENGTH (parms
));
13279 for (int i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
13281 tree tuple
= TREE_VEC_ELT (parms
, i
);
13283 if (tuple
== error_mark_node
)
13286 TREE_VEC_ELT (new_vec
, i
) =
13287 tsubst_template_parm (tuple
, args
, complain
);
13293 /* Return the result of substituting ARGS into the template parameters
13294 given by PARMS. If there are m levels of ARGS and m + n levels of
13295 PARMS, then the result will contain n levels of PARMS. For
13296 example, if PARMS is `template <class T> template <class U>
13297 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
13298 result will be `template <int*, double, class V>'. */
13301 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
13303 tree r
= NULL_TREE
;
13306 /* When substituting into a template, we must set
13307 PROCESSING_TEMPLATE_DECL as the template parameters may be
13308 dependent if they are based on one-another, and the dependency
13309 predicates are short-circuit outside of templates. */
13310 ++processing_template_decl
;
13312 for (new_parms
= &r
;
13313 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
13314 new_parms
= &(TREE_CHAIN (*new_parms
)),
13315 parms
= TREE_CHAIN (parms
))
13317 tree new_vec
= tsubst_template_parms_level (TREE_VALUE (parms
),
13320 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
13321 - TMPL_ARGS_DEPTH (args
)),
13322 new_vec
, NULL_TREE
);
13323 TEMPLATE_PARMS_CONSTRAINTS (*new_parms
)
13324 = TEMPLATE_PARMS_CONSTRAINTS (parms
);
13327 --processing_template_decl
;
13332 /* Return the result of substituting ARGS into one template parameter
13333 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
13334 parameter and which TREE_PURPOSE is the default argument of the
13335 template parameter. */
13338 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
13340 tree default_value
, parm_decl
;
13342 if (args
== NULL_TREE
13344 || t
== error_mark_node
)
13347 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
13349 default_value
= TREE_PURPOSE (t
);
13350 parm_decl
= TREE_VALUE (t
);
13351 tree constraint
= TEMPLATE_PARM_CONSTRAINTS (t
);
13353 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
13354 if (TREE_CODE (parm_decl
) == PARM_DECL
13355 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
13356 parm_decl
= error_mark_node
;
13357 default_value
= tsubst_template_arg (default_value
, args
,
13358 complain
, NULL_TREE
);
13359 constraint
= tsubst_constraint (constraint
, args
, complain
, NULL_TREE
);
13361 tree r
= build_tree_list (default_value
, parm_decl
);
13362 TEMPLATE_PARM_CONSTRAINTS (r
) = constraint
;
13366 /* Substitute the ARGS into the indicated aggregate (or enumeration)
13367 type T. If T is not an aggregate or enumeration type, it is
13368 handled as if by tsubst. IN_DECL is as for tsubst. If
13369 ENTERING_SCOPE is nonzero, T is the context for a template which
13370 we are presently tsubst'ing. Return the substituted value. */
13373 tsubst_aggr_type (tree t
,
13375 tsubst_flags_t complain
,
13377 int entering_scope
)
13379 if (t
== NULL_TREE
)
13382 switch (TREE_CODE (t
))
13385 if (TYPE_PTRMEMFUNC_P (t
))
13386 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
13388 /* Fall through. */
13389 case ENUMERAL_TYPE
:
13391 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
13397 /* In "sizeof(X<I>)" we need to evaluate "I". */
13400 /* First, determine the context for the type we are looking
13402 context
= TYPE_CONTEXT (t
);
13403 if (context
&& TYPE_P (context
))
13405 context
= tsubst_aggr_type (context
, args
, complain
,
13406 in_decl
, /*entering_scope=*/1);
13407 /* If context is a nested class inside a class template,
13408 it may still need to be instantiated (c++/33959). */
13409 context
= complete_type (context
);
13412 /* Then, figure out what arguments are appropriate for the
13413 type we are trying to find. For example, given:
13415 template <class T> struct S;
13416 template <class T, class U> void f(T, U) { S<U> su; }
13418 and supposing that we are instantiating f<int, double>,
13419 then our ARGS will be {int, double}, but, when looking up
13420 S we only want {double}. */
13421 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
13422 complain
, in_decl
);
13423 if (argvec
== error_mark_node
)
13424 r
= error_mark_node
;
13425 else if (cxx_dialect
>= cxx17
&& dependent_scope_p (context
))
13427 /* See maybe_dependent_member_ref. */
13428 tree name
= TYPE_IDENTIFIER (t
);
13429 tree fullname
= name
;
13430 if (instantiates_primary_template_p (t
))
13431 fullname
= build_nt (TEMPLATE_ID_EXPR
, name
,
13432 INNERMOST_TEMPLATE_ARGS (argvec
));
13433 return build_typename_type (context
, name
, fullname
,
13438 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
13439 entering_scope
, complain
);
13440 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
13446 /* This is not a template type, so there's nothing to do. */
13450 return tsubst (t
, args
, complain
, in_decl
);
13454 static GTY((cache
)) decl_tree_cache_map
*defarg_inst
;
13456 /* Substitute into the default argument ARG (a default argument for
13457 FN), which has the indicated TYPE. */
13460 tsubst_default_argument (tree fn
, int parmnum
, tree type
, tree arg
,
13461 tsubst_flags_t complain
)
13463 int errs
= errorcount
+ sorrycount
;
13465 /* This can happen in invalid code. */
13466 if (TREE_CODE (arg
) == DEFERRED_PARSE
)
13470 if (BRACE_ENCLOSED_INITIALIZER_P (arg
)
13471 && CONSTRUCTOR_NELTS (arg
) == 0)
13474 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
13475 parm
= chain_index (parmnum
, parm
);
13476 tree parmtype
= TREE_TYPE (parm
);
13477 if (DECL_BY_REFERENCE (parm
))
13478 parmtype
= TREE_TYPE (parmtype
);
13479 if (parmtype
== error_mark_node
)
13480 return error_mark_node
;
13482 gcc_assert (same_type_ignoring_top_level_qualifiers_p (type
, parmtype
));
13485 if (defarg_inst
&& (slot
= defarg_inst
->get (parm
)))
13488 /* This default argument came from a template. Instantiate the
13489 default argument here, not in tsubst. In the case of
13498 we must be careful to do name lookup in the scope of S<T>,
13499 rather than in the current class. */
13500 push_to_top_level ();
13501 push_access_scope (fn
);
13502 push_deferring_access_checks (dk_no_deferred
);
13503 start_lambda_scope (parm
);
13505 /* The default argument expression may cause implicitly defined
13506 member functions to be synthesized, which will result in garbage
13507 collection. We must treat this situation as if we were within
13508 the body of function so as to avoid collecting live data on the
13511 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
13512 complain
, NULL_TREE
,
13513 /*integral_constant_expression_p=*/false);
13516 finish_lambda_scope ();
13518 /* Make sure the default argument is reasonable. */
13519 arg
= check_default_argument (type
, arg
, complain
);
13521 if (errorcount
+sorrycount
> errs
13522 && (complain
& tf_warning_or_error
))
13523 inform (input_location
,
13524 " when instantiating default argument for call to %qD", fn
);
13526 pop_deferring_access_checks ();
13527 pop_access_scope (fn
);
13528 pop_from_top_level ();
13530 if (arg
!= error_mark_node
&& !cp_unevaluated_operand
)
13533 defarg_inst
= decl_tree_cache_map::create_ggc (37);
13534 defarg_inst
->put (parm
, arg
);
13540 /* Substitute into all the default arguments for FN. */
13543 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
13548 tmpl_args
= DECL_TI_ARGS (fn
);
13550 /* If this function is not yet instantiated, we certainly don't need
13551 its default arguments. */
13552 if (uses_template_parms (tmpl_args
))
13554 /* Don't do this again for clones. */
13555 if (DECL_CLONED_FUNCTION_P (fn
))
13559 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
13561 arg
= TREE_CHAIN (arg
), ++i
)
13562 if (TREE_PURPOSE (arg
))
13563 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
, i
,
13565 TREE_PURPOSE (arg
),
13569 /* Hash table mapping a FUNCTION_DECL to its dependent explicit-specifier. */
13570 static GTY((cache
)) decl_tree_cache_map
*explicit_specifier_map
;
13572 /* Store a pair to EXPLICIT_SPECIFIER_MAP. */
13575 store_explicit_specifier (tree v
, tree t
)
13577 if (!explicit_specifier_map
)
13578 explicit_specifier_map
= decl_tree_cache_map::create_ggc (37);
13579 DECL_HAS_DEPENDENT_EXPLICIT_SPEC_P (v
) = true;
13580 explicit_specifier_map
->put (v
, t
);
13583 /* Lookup an element in EXPLICIT_SPECIFIER_MAP. */
13586 lookup_explicit_specifier (tree v
)
13588 return *explicit_specifier_map
->get (v
);
13591 /* Given T, a FUNCTION_TYPE or METHOD_TYPE, construct and return a corresponding
13592 FUNCTION_TYPE or METHOD_TYPE whose return type is RETURN_TYPE, argument types
13593 are ARG_TYPES, and exception specification is RAISES, and otherwise is
13597 rebuild_function_or_method_type (tree t
, tree return_type
, tree arg_types
,
13598 tree raises
, tsubst_flags_t complain
)
13600 gcc_assert (FUNC_OR_METHOD_TYPE_P (t
));
13603 if (TREE_CODE (t
) == FUNCTION_TYPE
)
13605 new_type
= build_function_type (return_type
, arg_types
);
13606 new_type
= apply_memfn_quals (new_type
, type_memfn_quals (t
));
13610 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
13611 /* Don't pick up extra function qualifiers from the basetype. */
13612 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
13613 if (! MAYBE_CLASS_TYPE_P (r
))
13617 Type deduction may fail for any of the following
13620 -- Attempting to create "pointer to member of T" when T
13621 is not a class type. */
13622 if (complain
& tf_error
)
13623 error ("creating pointer to member function of non-class type %qT",
13625 return error_mark_node
;
13628 new_type
= build_method_type_directly (r
, return_type
,
13629 TREE_CHAIN (arg_types
));
13631 new_type
= cp_build_type_attribute_variant (new_type
, TYPE_ATTRIBUTES (t
));
13633 cp_ref_qualifier rqual
= type_memfn_rqual (t
);
13634 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
13635 return build_cp_fntype_variant (new_type
, rqual
, raises
, late_return_type_p
);
13638 /* Check if the function type of DECL, a FUNCTION_DECL, agrees with the type of
13639 each of its formal parameters. If there is a disagreement then rebuild
13640 DECL's function type according to its formal parameter types, as part of a
13641 resolution for Core issues 1001/1322. */
13644 maybe_rebuild_function_decl_type (tree decl
)
13646 bool function_type_needs_rebuilding
= false;
13647 if (tree parm_list
= FUNCTION_FIRST_USER_PARM (decl
))
13649 tree parm_type_list
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
13650 while (parm_type_list
&& parm_type_list
!= void_list_node
)
13652 tree parm_type
= TREE_VALUE (parm_type_list
);
13653 tree formal_parm_type_unqual
= strip_top_quals (TREE_TYPE (parm_list
));
13654 if (!same_type_p (parm_type
, formal_parm_type_unqual
))
13656 function_type_needs_rebuilding
= true;
13660 parm_list
= DECL_CHAIN (parm_list
);
13661 parm_type_list
= TREE_CHAIN (parm_type_list
);
13665 if (!function_type_needs_rebuilding
)
13668 const tree fntype
= TREE_TYPE (decl
);
13669 tree parm_list
= DECL_ARGUMENTS (decl
);
13670 tree old_parm_type_list
= TYPE_ARG_TYPES (fntype
);
13671 tree new_parm_type_list
= NULL_TREE
;
13672 tree
*q
= &new_parm_type_list
;
13673 for (int skip
= num_artificial_parms_for (decl
); skip
> 0; skip
--)
13675 *q
= copy_node (old_parm_type_list
);
13676 parm_list
= DECL_CHAIN (parm_list
);
13677 old_parm_type_list
= TREE_CHAIN (old_parm_type_list
);
13678 q
= &TREE_CHAIN (*q
);
13680 while (old_parm_type_list
&& old_parm_type_list
!= void_list_node
)
13682 *q
= copy_node (old_parm_type_list
);
13683 tree
*new_parm_type
= &TREE_VALUE (*q
);
13684 tree formal_parm_type_unqual
= strip_top_quals (TREE_TYPE (parm_list
));
13685 if (!same_type_p (*new_parm_type
, formal_parm_type_unqual
))
13686 *new_parm_type
= formal_parm_type_unqual
;
13688 parm_list
= DECL_CHAIN (parm_list
);
13689 old_parm_type_list
= TREE_CHAIN (old_parm_type_list
);
13690 q
= &TREE_CHAIN (*q
);
13692 if (old_parm_type_list
== void_list_node
)
13693 *q
= void_list_node
;
13696 = rebuild_function_or_method_type (fntype
,
13697 TREE_TYPE (fntype
), new_parm_type_list
,
13698 TYPE_RAISES_EXCEPTIONS (fntype
), tf_none
);
13701 /* Subroutine of tsubst_decl for the case when T is a FUNCTION_DECL. */
13704 tsubst_function_decl (tree t
, tree args
, tsubst_flags_t complain
,
13705 tree lambda_fntype
)
13707 tree gen_tmpl
= NULL_TREE
, argvec
= NULL_TREE
;
13708 hashval_t hash
= 0;
13711 /* Nobody should be tsubst'ing into non-template functions. */
13712 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
13713 || DECL_LOCAL_DECL_P (t
));
13715 if (DECL_LOCAL_DECL_P (t
))
13717 if (tree spec
= retrieve_local_specialization (t
))
13720 else if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
13722 /* If T is not dependent, just return it. */
13723 if (!uses_template_parms (DECL_TI_ARGS (t
))
13724 && !LAMBDA_FUNCTION_P (t
))
13727 /* Calculate the most general template of which R is a
13729 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
13731 /* We're substituting a lambda function under tsubst_lambda_expr but not
13732 directly from it; find the matching function we're already inside.
13733 But don't do this if T is a generic lambda with a single level of
13734 template parms, as in that case we're doing a normal instantiation. */
13735 if (LAMBDA_FUNCTION_P (t
) && !lambda_fntype
13736 && (!generic_lambda_fn_p (t
)
13737 || TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
)) > 1))
13738 return enclosing_instantiation_of (t
);
13740 /* Calculate the complete set of arguments used to
13742 argvec
= tsubst_template_args (DECL_TI_ARGS
13743 (DECL_TEMPLATE_RESULT
13744 (DECL_TI_TEMPLATE (t
))),
13745 args
, complain
, in_decl
);
13746 if (argvec
== error_mark_node
)
13747 return error_mark_node
;
13749 /* Check to see if we already have this specialization. */
13750 if (!lambda_fntype
)
13752 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
13753 if (tree spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
))
13757 /* We can see more levels of arguments than parameters if
13758 there was a specialization of a member template, like
13761 template <class T> struct S { template <class U> void f(); }
13762 template <> template <class U> void S<int>::f(U);
13764 Here, we'll be substituting into the specialization,
13765 because that's where we can find the code we actually
13766 want to generate, but we'll have enough arguments for
13767 the most general template.
13769 We also deal with the peculiar case:
13771 template <class T> struct S {
13772 template <class U> friend void f();
13774 template <class U> void f() {}
13776 template void f<double>();
13778 Here, the ARGS for the instantiation of will be {int,
13779 double}. But, we only need as many ARGS as there are
13780 levels of template parameters in CODE_PATTERN. We are
13781 careful not to get fooled into reducing the ARGS in
13784 template <class T> struct S { template <class U> void f(U); }
13785 template <class T> template <> void S<T>::f(int) {}
13787 which we can spot because the pattern will be a
13788 specialization in this case. */
13789 int args_depth
= TMPL_ARGS_DEPTH (args
);
13791 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
13793 if (args_depth
> parms_depth
&& !DECL_TEMPLATE_SPECIALIZATION (t
))
13794 args
= get_innermost_template_args (args
, parms_depth
);
13798 /* This special case arises when we have something like this:
13800 template <class T> struct S {
13801 friend void f<int>(int, double);
13804 Here, the DECL_TI_TEMPLATE for the friend declaration
13805 will be an IDENTIFIER_NODE. We are being called from
13806 tsubst_friend_function, and we want only to create a
13807 new decl (R) with appropriate types so that we can call
13808 determine_specialization. */
13809 gen_tmpl
= NULL_TREE
;
13810 argvec
= NULL_TREE
;
13813 tree closure
= (lambda_fntype
? TYPE_METHOD_BASETYPE (lambda_fntype
)
13815 tree ctx
= closure
? closure
: DECL_CONTEXT (t
);
13816 bool member
= ctx
&& TYPE_P (ctx
);
13818 if (member
&& !closure
)
13819 ctx
= tsubst_aggr_type (ctx
, args
,
13820 complain
, t
, /*entering_scope=*/1);
13822 tree type
= (lambda_fntype
? lambda_fntype
13823 : tsubst (TREE_TYPE (t
), args
,
13824 complain
| tf_fndecl_type
, in_decl
));
13825 if (type
== error_mark_node
)
13826 return error_mark_node
;
13828 /* If we hit excessive deduction depth, the type is bogus even if
13829 it isn't error_mark_node, so don't build a decl. */
13830 if (excessive_deduction_depth
)
13831 return error_mark_node
;
13833 /* We do NOT check for matching decls pushed separately at this
13834 point, as they may not represent instantiations of this
13835 template, and in any case are considered separate under the
13837 tree r
= copy_decl (t
);
13838 DECL_USE_TEMPLATE (r
) = 0;
13839 TREE_TYPE (r
) = type
;
13840 /* Clear out the mangled name and RTL for the instantiation. */
13841 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
13842 SET_DECL_RTL (r
, NULL
);
13843 /* Leave DECL_INITIAL set on deleted instantiations. */
13844 if (!DECL_DELETED_FN (r
))
13845 DECL_INITIAL (r
) = NULL_TREE
;
13846 DECL_CONTEXT (r
) = ctx
;
13848 /* Handle explicit(dependent-expr). */
13849 if (DECL_HAS_DEPENDENT_EXPLICIT_SPEC_P (t
))
13851 tree spec
= lookup_explicit_specifier (t
);
13852 spec
= tsubst_copy_and_build (spec
, args
, complain
, in_decl
,
13853 /*function_p=*/false,
13855 spec
= build_explicit_specifier (spec
, complain
);
13856 DECL_NONCONVERTING_P (r
) = (spec
== boolean_true_node
);
13859 /* OpenMP UDRs have the only argument a reference to the declared
13860 type. We want to diagnose if the declared type is a reference,
13861 which is invalid, but as references to references are usually
13862 quietly merged, diagnose it here. */
13863 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
13866 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
13867 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
13868 if (TYPE_REF_P (argtype
))
13869 error_at (DECL_SOURCE_LOCATION (t
),
13870 "reference type %qT in "
13871 "%<#pragma omp declare reduction%>", argtype
);
13872 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
13873 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
13877 if (member
&& DECL_CONV_FN_P (r
))
13878 /* Type-conversion operator. Reconstruct the name, in
13879 case it's the name of one of the template's parameters. */
13880 DECL_NAME (r
) = make_conv_op_name (TREE_TYPE (type
));
13882 tree parms
= DECL_ARGUMENTS (t
);
13884 parms
= DECL_CHAIN (parms
);
13885 parms
= tsubst (parms
, args
, complain
, t
);
13886 for (tree parm
= parms
; parm
; parm
= DECL_CHAIN (parm
))
13887 DECL_CONTEXT (parm
) = r
;
13890 tree tparm
= build_this_parm (r
, closure
, type_memfn_quals (type
));
13891 DECL_NAME (tparm
) = closure_identifier
;
13892 DECL_CHAIN (tparm
) = parms
;
13895 DECL_ARGUMENTS (r
) = parms
;
13896 DECL_RESULT (r
) = NULL_TREE
;
13898 maybe_rebuild_function_decl_type (r
);
13900 TREE_STATIC (r
) = 0;
13901 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
13902 DECL_EXTERNAL (r
) = 1;
13903 /* If this is an instantiation of a function with internal
13904 linkage, we already know what object file linkage will be
13905 assigned to the instantiation. */
13906 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
13907 DECL_DEFER_OUTPUT (r
) = 0;
13908 DECL_CHAIN (r
) = NULL_TREE
;
13909 DECL_PENDING_INLINE_INFO (r
) = 0;
13910 DECL_PENDING_INLINE_P (r
) = 0;
13911 DECL_SAVED_TREE (r
) = NULL_TREE
;
13912 DECL_STRUCT_FUNCTION (r
) = NULL
;
13914 /* We'll re-clone as appropriate in instantiate_template. */
13915 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
13917 /* If we aren't complaining now, return on error before we register
13918 the specialization so that we'll complain eventually. */
13919 if ((complain
& tf_error
) == 0
13920 && IDENTIFIER_ANY_OP_P (DECL_NAME (r
))
13921 && !grok_op_properties (r
, /*complain=*/false))
13922 return error_mark_node
;
13924 /* Associate the constraints directly with the instantiation. We
13925 don't substitute through the constraints; that's only done when
13926 they are checked. */
13927 if (tree ci
= get_constraints (t
))
13928 /* Unless we're regenerating a lambda, in which case we'll set the
13929 lambda's constraints in tsubst_lambda_expr. */
13930 if (!lambda_fntype
)
13931 set_constraints (r
, ci
);
13933 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
13934 SET_DECL_FRIEND_CONTEXT (r
,
13935 tsubst (DECL_FRIEND_CONTEXT (t
),
13936 args
, complain
, in_decl
));
13938 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
13939 this in the special friend case mentioned above where
13940 GEN_TMPL is NULL. */
13941 if (gen_tmpl
&& !closure
)
13943 DECL_TEMPLATE_INFO (r
)
13944 = build_template_info (gen_tmpl
, argvec
);
13945 SET_DECL_IMPLICIT_INSTANTIATION (r
);
13948 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
13950 /* We instantiated this while substituting into
13951 the type earlier (template/friend54.C). */
13954 /* We're not supposed to instantiate default arguments
13955 until they are called, for a template. But, for a
13958 template <class T> void f ()
13959 { extern void g(int i = T()); }
13961 we should do the substitution when the template is
13962 instantiated. We handle the member function case in
13963 instantiate_class_template since the default arguments
13964 might refer to other members of the class. */
13966 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
13967 && !uses_template_parms (argvec
))
13968 tsubst_default_arguments (r
, complain
);
13970 else if (DECL_LOCAL_DECL_P (r
))
13972 if (!cp_unevaluated_operand
)
13973 register_local_specialization (r
, t
);
13976 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
13978 /* Copy the list of befriending classes. */
13979 for (tree
*friends
= &DECL_BEFRIENDING_CLASSES (r
);
13981 friends
= &TREE_CHAIN (*friends
))
13983 *friends
= copy_node (*friends
);
13984 TREE_VALUE (*friends
)
13985 = tsubst (TREE_VALUE (*friends
), args
, complain
, in_decl
);
13988 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
13990 maybe_retrofit_in_chrg (r
);
13991 if (DECL_CONSTRUCTOR_P (r
) && !grok_ctor_properties (ctx
, r
))
13992 return error_mark_node
;
13993 /* If this is an instantiation of a member template, clone it.
13994 If it isn't, that'll be handled by
13995 clone_constructors_and_destructors. */
13996 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
13997 clone_cdtor (r
, /*update_methods=*/false);
13999 else if ((complain
& tf_error
) != 0
14000 && IDENTIFIER_ANY_OP_P (DECL_NAME (r
))
14001 && !grok_op_properties (r
, /*complain=*/true))
14002 return error_mark_node
;
14004 /* Possibly limit visibility based on template args. */
14005 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
14006 if (DECL_VISIBILITY_SPECIFIED (t
))
14008 DECL_VISIBILITY_SPECIFIED (r
) = 0;
14009 DECL_ATTRIBUTES (r
)
14010 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
14012 determine_visibility (r
);
14013 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
14014 && !processing_template_decl
)
14015 defaulted_late_check (r
);
14017 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
14018 args
, complain
, in_decl
);
14020 if (tree attr
= lookup_attribute ("omp declare variant base",
14021 DECL_ATTRIBUTES (r
)))
14022 omp_declare_variant_finalize (r
, attr
);
14027 /* Subroutine of tsubst_decl for the case when T is a TEMPLATE_DECL. */
14030 tsubst_template_decl (tree t
, tree args
, tsubst_flags_t complain
,
14031 tree lambda_fntype
)
14033 /* We can get here when processing a member function template,
14034 member class template, or template template parameter. */
14035 tree decl
= DECL_TEMPLATE_RESULT (t
);
14041 hashval_t hash
= 0;
14043 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
14045 /* Template template parameter is treated here. */
14046 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14047 if (new_type
== error_mark_node
)
14048 r
= error_mark_node
;
14049 /* If we get a real template back, return it. This can happen in
14050 the context of most_specialized_partial_spec. */
14051 else if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
14054 /* The new TEMPLATE_DECL was built in
14055 reduce_template_parm_level. */
14056 r
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (new_type
);
14060 if (!lambda_fntype
)
14062 /* We might already have an instance of this template.
14063 The ARGS are for the surrounding class type, so the
14064 full args contain the tsubst'd args for the context,
14065 plus the innermost args from the template decl. */
14066 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
14067 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
14068 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
14069 /* Because this is a template, the arguments will still be
14070 dependent, even after substitution. If
14071 PROCESSING_TEMPLATE_DECL is not set, the dependency
14072 predicates will short-circuit. */
14073 ++processing_template_decl
;
14074 full_args
= tsubst_template_args (tmpl_args
, args
,
14075 complain
, in_decl
);
14076 --processing_template_decl
;
14077 if (full_args
== error_mark_node
)
14078 return error_mark_node
;
14080 /* If this is a default template template argument,
14081 tsubst might not have changed anything. */
14082 if (full_args
== tmpl_args
)
14085 hash
= hash_tmpl_and_args (t
, full_args
);
14086 spec
= retrieve_specialization (t
, full_args
, hash
);
14087 if (spec
!= NULL_TREE
)
14090 /* Type partial instantiations are stored as the type by
14091 lookup_template_class_1, not here as the template. */
14092 spec
= CLASSTYPE_TI_TEMPLATE (spec
);
14097 /* Make a new template decl. It will be similar to the
14098 original, but will record the current template arguments.
14099 We also create a new function declaration, which is just
14100 like the old one, but points to this new template, rather
14101 than the old one. */
14103 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
14104 DECL_CHAIN (r
) = NULL_TREE
;
14106 // Build new template info linking to the original template decl.
14107 if (!lambda_fntype
)
14109 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
14110 SET_DECL_IMPLICIT_INSTANTIATION (r
);
14113 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
14115 /* The template parameters for this new template are all the
14116 template parameters for the old template, except the
14117 outermost level of parameters. */
14118 DECL_TEMPLATE_PARMS (r
)
14119 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
14122 bool class_p
= false;
14124 ++processing_template_decl
;
14125 if (TREE_CODE (inner
) == FUNCTION_DECL
)
14126 inner
= tsubst_function_decl (inner
, args
, complain
, lambda_fntype
);
14129 if (TREE_CODE (inner
) == TYPE_DECL
&& !TYPE_DECL_ALIAS_P (inner
))
14132 inner
= TREE_TYPE (inner
);
14134 inner
= tsubst (inner
, args
, complain
, in_decl
);
14136 --processing_template_decl
;
14137 if (inner
== error_mark_node
)
14138 return error_mark_node
;
14142 /* For a partial specialization, we need to keep pointing to
14143 the primary template. */
14144 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
14145 CLASSTYPE_TI_TEMPLATE (inner
) = r
;
14147 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (inner
);
14148 inner
= TYPE_MAIN_DECL (inner
);
14150 else if (lambda_fntype
)
14152 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (r
));
14153 DECL_TEMPLATE_INFO (inner
) = build_template_info (r
, args
);
14157 if (TREE_CODE (decl
) != TYPE_DECL
|| !TYPE_DECL_ALIAS_P (decl
))
14158 DECL_TI_TEMPLATE (inner
) = r
;
14159 DECL_TI_ARGS (r
) = DECL_TI_ARGS (inner
);
14162 DECL_TEMPLATE_RESULT (r
) = inner
;
14163 TREE_TYPE (r
) = TREE_TYPE (inner
);
14164 DECL_CONTEXT (r
) = DECL_CONTEXT (inner
);
14166 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
14167 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
14169 if (PRIMARY_TEMPLATE_P (t
))
14170 DECL_PRIMARY_TEMPLATE (r
) = r
;
14172 if (TREE_CODE (decl
) != TYPE_DECL
&& !VAR_P (decl
)
14174 /* Record this non-type partial instantiation. */
14175 register_specialization (r
, t
,
14176 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
14182 /* True if FN is the op() for a lambda in an uninstantiated template. */
14185 lambda_fn_in_template_p (tree fn
)
14187 if (!fn
|| !LAMBDA_FUNCTION_P (fn
))
14189 tree closure
= DECL_CONTEXT (fn
);
14190 return CLASSTYPE_TEMPLATE_INFO (closure
) != NULL_TREE
;
14193 /* True if FN is the substitution (via tsubst_lambda_expr) of a function for
14194 which the above is true. */
14197 instantiated_lambda_fn_p (tree fn
)
14199 if (!fn
|| !LAMBDA_FUNCTION_P (fn
))
14201 tree closure
= DECL_CONTEXT (fn
);
14202 tree lam
= CLASSTYPE_LAMBDA_EXPR (closure
);
14203 return LAMBDA_EXPR_INSTANTIATED (lam
);
14206 /* We're instantiating a variable from template function TCTX. Return the
14207 corresponding current enclosing scope. This gets complicated because lambda
14208 functions in templates are regenerated rather than instantiated, but generic
14209 lambda functions are subsequently instantiated. */
14212 enclosing_instantiation_of (tree otctx
)
14215 tree fn
= current_function_decl
;
14216 int lambda_count
= 0;
14218 for (; tctx
&& (lambda_fn_in_template_p (tctx
)
14219 || instantiated_lambda_fn_p (tctx
));
14220 tctx
= decl_function_context (tctx
))
14222 for (; fn
; fn
= decl_function_context (fn
))
14225 int flambda_count
= 0;
14226 for (; fn
&& instantiated_lambda_fn_p (fn
);
14227 fn
= decl_function_context (fn
))
14229 if ((fn
&& DECL_TEMPLATE_INFO (fn
))
14230 ? most_general_template (fn
) != most_general_template (tctx
)
14233 if (flambda_count
!= lambda_count
)
14235 gcc_assert (flambda_count
> lambda_count
);
14236 for (; flambda_count
> lambda_count
; --flambda_count
)
14237 ofn
= decl_function_context (ofn
);
14239 gcc_assert (DECL_NAME (ofn
) == DECL_NAME (otctx
)
14240 || DECL_CONV_FN_P (ofn
));
14243 gcc_unreachable ();
14246 /* Substitute the ARGS into the T, which is a _DECL. Return the
14247 result of the substitution. Issue error and warning messages under
14248 control of COMPLAIN. */
14251 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
14253 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
14254 location_t saved_loc
;
14255 tree r
= NULL_TREE
;
14257 hashval_t hash
= 0;
14259 /* Set the filename and linenumber to improve error-reporting. */
14260 saved_loc
= input_location
;
14261 input_location
= DECL_SOURCE_LOCATION (t
);
14263 switch (TREE_CODE (t
))
14265 case TEMPLATE_DECL
:
14266 r
= tsubst_template_decl (t
, args
, complain
, /*lambda*/NULL_TREE
);
14269 case FUNCTION_DECL
:
14270 r
= tsubst_function_decl (t
, args
, complain
, /*lambda*/NULL_TREE
);
14275 tree type
= NULL_TREE
;
14277 tree expanded_types
= NULL_TREE
;
14278 tree prev_r
= NULL_TREE
;
14279 tree first_r
= NULL_TREE
;
14281 if (DECL_PACK_P (t
))
14283 /* If there is a local specialization that isn't a
14284 parameter pack, it means that we're doing a "simple"
14285 substitution from inside tsubst_pack_expansion. Just
14286 return the local specialization (which will be a single
14288 tree spec
= retrieve_local_specialization (t
);
14290 && TREE_CODE (spec
) == PARM_DECL
14291 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
14294 /* Expand the TYPE_PACK_EXPANSION that provides the types for
14295 the parameters in this function parameter pack. */
14296 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
14297 complain
, in_decl
);
14298 if (TREE_CODE (expanded_types
) == TREE_VEC
)
14300 len
= TREE_VEC_LENGTH (expanded_types
);
14302 /* Zero-length parameter packs are boring. Just substitute
14304 if (len
== 0 && !cp_unevaluated_operand
)
14305 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
14310 /* All we did was update the type. Make a note of that. */
14311 type
= expanded_types
;
14312 expanded_types
= NULL_TREE
;
14316 /* Loop through all of the parameters we'll build. When T is
14317 a function parameter pack, LEN is the number of expanded
14318 types in EXPANDED_TYPES; otherwise, LEN is 1. */
14320 for (i
= 0; i
< len
; ++i
)
14324 if (DECL_TEMPLATE_PARM_P (t
))
14325 SET_DECL_TEMPLATE_PARM_P (r
);
14327 if (expanded_types
)
14328 /* We're on the Ith parameter of the function parameter
14331 /* Get the Ith type. */
14332 type
= TREE_VEC_ELT (expanded_types
, i
);
14334 /* Rename the parameter to include the index. */
14336 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
14339 /* We're dealing with a normal parameter. */
14340 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14342 type
= type_decays_to (type
);
14343 TREE_TYPE (r
) = type
;
14344 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
14346 if (DECL_INITIAL (r
))
14348 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
14349 DECL_INITIAL (r
) = TREE_TYPE (r
);
14351 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
14352 complain
, in_decl
);
14355 DECL_CONTEXT (r
) = NULL_TREE
;
14357 if (!DECL_TEMPLATE_PARM_P (r
))
14358 DECL_ARG_TYPE (r
) = type_passed_as (type
);
14360 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
14361 args
, complain
, in_decl
);
14363 /* Keep track of the first new parameter we
14364 generate. That's what will be returned to the
14369 /* Build a proper chain of parameters when substituting
14370 into a function parameter pack. */
14372 DECL_CHAIN (prev_r
) = r
;
14375 /* If cp_unevaluated_operand is set, we're just looking for a
14376 single dummy parameter, so don't keep going. */
14377 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
14378 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
14379 complain
, DECL_CHAIN (t
));
14381 /* FIRST_R contains the start of the chain we've built. */
14388 tree type
= NULL_TREE
;
14389 tree vec
= NULL_TREE
;
14390 tree expanded_types
= NULL_TREE
;
14393 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
14395 /* This field is a lambda capture pack. Return a TREE_VEC of
14396 the expanded fields to instantiate_class_template_1. */
14397 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
14398 complain
, in_decl
);
14399 if (TREE_CODE (expanded_types
) == TREE_VEC
)
14401 len
= TREE_VEC_LENGTH (expanded_types
);
14402 vec
= make_tree_vec (len
);
14406 /* All we did was update the type. Make a note of that. */
14407 type
= expanded_types
;
14408 expanded_types
= NULL_TREE
;
14412 for (int i
= 0; i
< len
; ++i
)
14415 if (expanded_types
)
14417 type
= TREE_VEC_ELT (expanded_types
, i
);
14419 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
14422 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14424 if (type
== error_mark_node
)
14425 RETURN (error_mark_node
);
14426 TREE_TYPE (r
) = type
;
14427 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
14429 if (DECL_C_BIT_FIELD (r
))
14430 /* For bit-fields, DECL_BIT_FIELD_REPRESENTATIVE gives the
14432 DECL_BIT_FIELD_REPRESENTATIVE (r
)
14433 = tsubst_expr (DECL_BIT_FIELD_REPRESENTATIVE (t
), args
,
14435 /*integral_constant_expression_p=*/true);
14436 if (DECL_INITIAL (t
))
14438 /* Set up DECL_TEMPLATE_INFO so that we can get at the
14439 NSDMI in perform_member_init. Still set DECL_INITIAL
14440 so that we know there is one. */
14441 DECL_INITIAL (r
) = void_node
;
14442 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
14443 retrofit_lang_decl (r
);
14444 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
14446 /* We don't have to set DECL_CONTEXT here; it is set by
14447 finish_member_declaration. */
14448 DECL_CHAIN (r
) = NULL_TREE
;
14450 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
14451 args
, complain
, in_decl
);
14454 TREE_VEC_ELT (vec
, i
) = r
;
14463 /* We reach here only for member using decls. We also need to check
14464 uses_template_parms because DECL_DEPENDENT_P is not set for a
14465 using-declaration that designates a member of the current
14466 instantiation (c++/53549). */
14467 if (DECL_DEPENDENT_P (t
)
14468 || uses_template_parms (USING_DECL_SCOPE (t
)))
14470 tree scope
= USING_DECL_SCOPE (t
);
14471 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
14472 if (PACK_EXPANSION_P (scope
))
14474 tree vec
= tsubst_pack_expansion (scope
, args
, complain
, in_decl
);
14475 int len
= TREE_VEC_LENGTH (vec
);
14476 r
= make_tree_vec (len
);
14477 for (int i
= 0; i
< len
; ++i
)
14479 tree escope
= TREE_VEC_ELT (vec
, i
);
14480 tree elt
= do_class_using_decl (escope
, name
);
14483 r
= error_mark_node
;
14488 TREE_PROTECTED (elt
) = TREE_PROTECTED (t
);
14489 TREE_PRIVATE (elt
) = TREE_PRIVATE (t
);
14491 TREE_VEC_ELT (r
, i
) = elt
;
14496 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
14497 complain
, in_decl
);
14498 r
= do_class_using_decl (inst_scope
, name
);
14500 r
= error_mark_node
;
14503 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
14504 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
14511 DECL_CHAIN (r
) = NULL_TREE
;
14518 tree argvec
= NULL_TREE
;
14519 tree gen_tmpl
= NULL_TREE
;
14520 tree tmpl
= NULL_TREE
;
14521 tree type
= NULL_TREE
;
14523 if (TREE_TYPE (t
) == error_mark_node
)
14524 RETURN (error_mark_node
);
14526 if (TREE_CODE (t
) == TYPE_DECL
14527 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
14529 /* If this is the canonical decl, we don't have to
14530 mess with instantiations, and often we can't (for
14531 typename, template type parms and such). Note that
14532 TYPE_NAME is not correct for the above test if
14533 we've copied the type for a typedef. */
14534 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14535 if (type
== error_mark_node
)
14536 RETURN (error_mark_node
);
14537 r
= TYPE_NAME (type
);
14541 /* Check to see if we already have the specialization we
14543 tree spec
= NULL_TREE
;
14544 bool local_p
= false;
14545 tree ctx
= DECL_CONTEXT (t
);
14546 if (!(VAR_P (t
) && DECL_LOCAL_DECL_P (t
))
14547 && (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
)))
14550 if (DECL_CLASS_SCOPE_P (t
))
14552 ctx
= tsubst_aggr_type (ctx
, args
,
14554 in_decl
, /*entering_scope=*/1);
14555 /* If CTX is unchanged, then T is in fact the
14556 specialization we want. That situation occurs when
14557 referencing a static data member within in its own
14558 class. We can use pointer equality, rather than
14559 same_type_p, because DECL_CONTEXT is always
14561 if (ctx
== DECL_CONTEXT (t
)
14562 /* ... unless T is a member template; in which
14563 case our caller can be willing to create a
14564 specialization of that template represented
14566 && !(DECL_TI_TEMPLATE (t
)
14567 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
14573 tmpl
= DECL_TI_TEMPLATE (t
);
14574 gen_tmpl
= most_general_template (tmpl
);
14575 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
14576 if (argvec
!= error_mark_node
)
14577 argvec
= (coerce_innermost_template_parms
14578 (DECL_TEMPLATE_PARMS (gen_tmpl
),
14579 argvec
, t
, complain
,
14580 /*all*/true, /*defarg*/true));
14581 if (argvec
== error_mark_node
)
14582 RETURN (error_mark_node
);
14583 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
14584 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
14589 if (!(VAR_P (t
) && DECL_LOCAL_DECL_P (t
)))
14590 /* Subsequent calls to pushdecl will fill this in. */
14592 /* A local variable. */
14594 /* Unless this is a reference to a static variable from an
14595 enclosing function, in which case we need to fill it in now. */
14596 if (TREE_STATIC (t
))
14598 tree fn
= enclosing_instantiation_of (DECL_CONTEXT (t
));
14599 if (fn
!= current_function_decl
)
14602 spec
= retrieve_local_specialization (t
);
14604 /* If we already have the specialization we need, there is
14605 nothing more to do. */
14612 /* Create a new node for the specialization we need. */
14613 if (type
== NULL_TREE
)
14615 if (is_typedef_decl (t
))
14616 type
= DECL_ORIGINAL_TYPE (t
);
14618 type
= TREE_TYPE (t
);
14620 && VAR_HAD_UNKNOWN_BOUND (t
)
14621 && type
!= error_mark_node
)
14622 type
= strip_array_domain (type
);
14623 tree sub_args
= args
;
14624 if (tree auto_node
= type_uses_auto (type
))
14626 /* Mask off any template args past the variable's context so we
14627 don't replace the auto with an unrelated argument. */
14628 int nouter
= TEMPLATE_TYPE_LEVEL (auto_node
) - 1;
14629 int extra
= TMPL_ARGS_DEPTH (args
) - nouter
;
14631 /* This should never happen with the new lambda instantiation
14632 model, but keep the handling just in case. */
14633 gcc_assert (!CHECKING_P
),
14634 sub_args
= strip_innermost_template_args (args
, extra
);
14636 type
= tsubst (type
, sub_args
, complain
, in_decl
);
14637 /* Substituting the type might have recursively instantiated this
14638 same alias (c++/86171). */
14639 if (gen_tmpl
&& DECL_ALIAS_TEMPLATE_P (gen_tmpl
)
14640 && (spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
)))
14649 DECL_INITIALIZED_P (r
) = 0;
14650 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
14651 if (type
== error_mark_node
)
14652 RETURN (error_mark_node
);
14653 if (TREE_CODE (type
) == FUNCTION_TYPE
)
14655 /* It may seem that this case cannot occur, since:
14660 declares a function, not a variable. However:
14663 template <typename T> void g() { T t; }
14664 template void g<f>();
14666 is an attempt to declare a variable with function
14668 error ("variable %qD has function type",
14669 /* R is not yet sufficiently initialized, so we
14670 just use its name. */
14672 RETURN (error_mark_node
);
14674 type
= complete_type (type
);
14675 /* Wait until cp_finish_decl to set this again, to handle
14676 circular dependency (template/instantiate6.C). */
14677 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
14678 type
= check_var_type (DECL_NAME (r
), type
,
14679 DECL_SOURCE_LOCATION (r
));
14680 if (DECL_HAS_VALUE_EXPR_P (t
))
14682 tree ve
= DECL_VALUE_EXPR (t
);
14683 /* If the DECL_VALUE_EXPR is converted to the declared type,
14684 preserve the identity so that gimplify_type_sizes works. */
14685 bool nop
= (TREE_CODE (ve
) == NOP_EXPR
);
14687 ve
= TREE_OPERAND (ve
, 0);
14688 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
14689 /*constant_expression_p=*/false);
14690 if (REFERENCE_REF_P (ve
))
14692 gcc_assert (TYPE_REF_P (type
));
14693 ve
= TREE_OPERAND (ve
, 0);
14696 ve
= build_nop (type
, ve
);
14697 else if (DECL_LANG_SPECIFIC (t
)
14698 && DECL_OMP_PRIVATIZED_MEMBER (t
)
14699 && TREE_CODE (ve
) == COMPONENT_REF
14700 && TREE_CODE (TREE_OPERAND (ve
, 1)) == FIELD_DECL
14701 && DECL_BIT_FIELD_TYPE (TREE_OPERAND (ve
, 1)) == type
)
14702 type
= TREE_TYPE (ve
);
14704 gcc_checking_assert (TYPE_MAIN_VARIANT (TREE_TYPE (ve
))
14705 == TYPE_MAIN_VARIANT (type
));
14706 SET_DECL_VALUE_EXPR (r
, ve
);
14708 if (CP_DECL_THREAD_LOCAL_P (r
)
14709 && !processing_template_decl
)
14710 set_decl_tls_model (r
, decl_default_tls_model (r
));
14712 else if (DECL_SELF_REFERENCE_P (t
))
14713 SET_DECL_SELF_REFERENCE_P (r
);
14714 TREE_TYPE (r
) = type
;
14715 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
14716 DECL_CONTEXT (r
) = ctx
;
14717 /* Clear out the mangled name and RTL for the instantiation. */
14718 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
14719 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
14720 SET_DECL_RTL (r
, NULL
);
14721 /* The initializer must not be expanded until it is required;
14722 see [temp.inst]. */
14723 DECL_INITIAL (r
) = NULL_TREE
;
14724 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
14727 if (DECL_LANG_SPECIFIC (r
))
14728 SET_DECL_DEPENDENT_INIT_P (r
, false);
14730 SET_DECL_MODE (r
, VOIDmode
);
14732 /* Possibly limit visibility based on template args. */
14733 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
14734 if (DECL_VISIBILITY_SPECIFIED (t
))
14736 DECL_VISIBILITY_SPECIFIED (r
) = 0;
14737 DECL_ATTRIBUTES (r
)
14738 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
14740 determine_visibility (r
);
14745 /* A static data member declaration is always marked
14746 external when it is declared in-class, even if an
14747 initializer is present. We mimic the non-template
14748 processing here. */
14749 DECL_EXTERNAL (r
) = 1;
14750 if (DECL_NAMESPACE_SCOPE_P (t
))
14751 DECL_NOT_REALLY_EXTERN (r
) = 1;
14753 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
14754 SET_DECL_IMPLICIT_INSTANTIATION (r
);
14755 if (!error_operand_p (r
) || (complain
& tf_error
))
14756 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
14760 if (DECL_LANG_SPECIFIC (r
))
14761 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
14762 if (!cp_unevaluated_operand
)
14763 register_local_specialization (r
, t
);
14766 DECL_CHAIN (r
) = NULL_TREE
;
14768 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
14770 args
, complain
, in_decl
);
14772 /* Preserve a typedef that names a type. */
14773 if (is_typedef_decl (r
) && type
!= error_mark_node
)
14775 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
14776 set_underlying_type (r
);
14777 if (TYPE_DECL_ALIAS_P (r
))
14778 /* An alias template specialization can be dependent
14779 even if its underlying type is not. */
14780 TYPE_DEPENDENT_P_VALID (TREE_TYPE (r
)) = false;
14783 layout_decl (r
, 0);
14788 gcc_unreachable ();
14793 /* Restore the file and line information. */
14794 input_location
= saved_loc
;
14799 /* Substitute into the complete parameter type list PARMS. */
14802 tsubst_function_parms (tree parms
,
14804 tsubst_flags_t complain
,
14807 return tsubst_arg_types (parms
, args
, NULL_TREE
, complain
, in_decl
);
14810 /* Substitute into the ARG_TYPES of a function type.
14811 If END is a TREE_CHAIN, leave it and any following types
14815 tsubst_arg_types (tree arg_types
,
14818 tsubst_flags_t complain
,
14821 tree remaining_arg_types
;
14822 tree type
= NULL_TREE
;
14824 tree expanded_args
= NULL_TREE
;
14827 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
14830 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
14831 args
, end
, complain
, in_decl
);
14832 if (remaining_arg_types
== error_mark_node
)
14833 return error_mark_node
;
14835 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
14837 /* For a pack expansion, perform substitution on the
14838 entire expression. Later on, we'll handle the arguments
14840 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
14841 args
, complain
, in_decl
);
14843 if (TREE_CODE (expanded_args
) == TREE_VEC
)
14844 /* So that we'll spin through the parameters, one by one. */
14845 i
= TREE_VEC_LENGTH (expanded_args
);
14848 /* We only partially substituted into the parameter
14849 pack. Our type is TYPE_PACK_EXPANSION. */
14850 type
= expanded_args
;
14851 expanded_args
= NULL_TREE
;
14859 type
= TREE_VEC_ELT (expanded_args
, i
);
14861 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
14863 if (type
== error_mark_node
)
14864 return error_mark_node
;
14865 if (VOID_TYPE_P (type
))
14867 if (complain
& tf_error
)
14869 error ("invalid parameter type %qT", type
);
14871 error ("in declaration %q+D", in_decl
);
14873 return error_mark_node
;
14876 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
14877 return error_mark_node
;
14879 /* Do array-to-pointer, function-to-pointer conversion, and ignore
14880 top-level qualifiers as required. */
14881 type
= cv_unqualified (type_decays_to (type
));
14883 /* We do not substitute into default arguments here. The standard
14884 mandates that they be instantiated only when needed, which is
14885 done in build_over_call. */
14886 default_arg
= TREE_PURPOSE (arg_types
);
14888 /* Except that we do substitute default arguments under tsubst_lambda_expr,
14889 since the new op() won't have any associated template arguments for us
14890 to refer to later. */
14891 if (lambda_fn_in_template_p (in_decl
))
14892 default_arg
= tsubst_copy_and_build (default_arg
, args
, complain
, in_decl
,
14893 false/*fn*/, false/*constexpr*/);
14895 if (default_arg
&& TREE_CODE (default_arg
) == DEFERRED_PARSE
)
14897 /* We've instantiated a template before its default arguments
14898 have been parsed. This can happen for a nested template
14899 class, and is not an error unless we require the default
14900 argument in a call of this function. */
14901 remaining_arg_types
=
14902 tree_cons (default_arg
, type
, remaining_arg_types
);
14903 vec_safe_push (DEFPARSE_INSTANTIATIONS (default_arg
),
14904 remaining_arg_types
);
14907 remaining_arg_types
=
14908 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
14911 return remaining_arg_types
;
14914 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
14915 *not* handle the exception-specification for FNTYPE, because the
14916 initial substitution of explicitly provided template parameters
14917 during argument deduction forbids substitution into the
14918 exception-specification:
14922 All references in the function type of the function template to the
14923 corresponding template parameters are replaced by the specified tem-
14924 plate argument values. If a substitution in a template parameter or
14925 in the function type of the function template results in an invalid
14926 type, type deduction fails. [Note: The equivalent substitution in
14927 exception specifications is done only when the function is instanti-
14928 ated, at which point a program is ill-formed if the substitution
14929 results in an invalid type.] */
14932 tsubst_function_type (tree t
,
14934 tsubst_flags_t complain
,
14938 tree arg_types
= NULL_TREE
;
14940 /* The TYPE_CONTEXT is not used for function/method types. */
14941 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
14943 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
14945 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
14947 if (late_return_type_p
)
14949 /* Substitute the argument types. */
14950 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
14951 complain
, in_decl
);
14952 if (arg_types
== error_mark_node
)
14953 return error_mark_node
;
14955 tree save_ccp
= current_class_ptr
;
14956 tree save_ccr
= current_class_ref
;
14957 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
14958 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
14959 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
14962 /* DR 1207: 'this' is in scope in the trailing return type. */
14963 inject_this_parameter (this_type
, cp_type_quals (this_type
));
14966 /* Substitute the return type. */
14967 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14971 current_class_ptr
= save_ccp
;
14972 current_class_ref
= save_ccr
;
14976 /* Substitute the return type. */
14977 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14979 if (return_type
== error_mark_node
)
14980 return error_mark_node
;
14981 /* DR 486 clarifies that creation of a function type with an
14982 invalid return type is a deduction failure. */
14983 if (TREE_CODE (return_type
) == ARRAY_TYPE
14984 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
14986 if (complain
& tf_error
)
14988 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
14989 error ("function returning an array");
14991 error ("function returning a function");
14993 return error_mark_node
;
14996 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
14997 return error_mark_node
;
14999 if (!late_return_type_p
)
15001 /* Substitute the argument types. */
15002 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
15003 complain
, in_decl
);
15004 if (arg_types
== error_mark_node
)
15005 return error_mark_node
;
15008 /* Construct a new type node and return it. */
15009 return rebuild_function_or_method_type (t
, return_type
, arg_types
,
15010 /*raises=*/NULL_TREE
, complain
);
15013 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
15014 ARGS into that specification, and return the substituted
15015 specification. If there is no specification, return NULL_TREE. */
15018 tsubst_exception_specification (tree fntype
,
15020 tsubst_flags_t complain
,
15027 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
15028 new_specs
= NULL_TREE
;
15029 if (specs
&& TREE_PURPOSE (specs
))
15031 /* A noexcept-specifier. */
15032 tree expr
= TREE_PURPOSE (specs
);
15033 if (TREE_CODE (expr
) == INTEGER_CST
)
15037 /* Defer instantiation of noexcept-specifiers to avoid
15038 excessive instantiations (c++/49107). */
15039 new_specs
= make_node (DEFERRED_NOEXCEPT
);
15040 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
15042 /* We already partially instantiated this member template,
15043 so combine the new args with the old. */
15044 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
15045 = DEFERRED_NOEXCEPT_PATTERN (expr
);
15046 DEFERRED_NOEXCEPT_ARGS (new_specs
)
15047 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
15051 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
15052 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
15057 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
15059 args
= add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
),
15061 expr
= DEFERRED_NOEXCEPT_PATTERN (expr
);
15063 new_specs
= tsubst_copy_and_build
15064 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
15065 /*integral_constant_expression_p=*/true);
15067 new_specs
= build_noexcept_spec (new_specs
, complain
);
15071 if (! TREE_VALUE (specs
))
15078 tree expanded_specs
= NULL_TREE
;
15080 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
15082 /* Expand the pack expansion type. */
15083 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
15087 if (expanded_specs
== error_mark_node
)
15088 return error_mark_node
;
15089 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
15090 len
= TREE_VEC_LENGTH (expanded_specs
);
15093 /* We're substituting into a member template, so
15094 we got a TYPE_PACK_EXPANSION back. Add that
15095 expansion and move on. */
15096 gcc_assert (TREE_CODE (expanded_specs
)
15097 == TYPE_PACK_EXPANSION
);
15098 new_specs
= add_exception_specifier (new_specs
,
15101 specs
= TREE_CHAIN (specs
);
15106 for (i
= 0; i
< len
; ++i
)
15108 if (expanded_specs
)
15109 spec
= TREE_VEC_ELT (expanded_specs
, i
);
15111 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
15112 if (spec
== error_mark_node
)
15114 new_specs
= add_exception_specifier (new_specs
, spec
,
15118 specs
= TREE_CHAIN (specs
);
15124 /* Substitute through a TREE_LIST of types or expressions, handling pack
15128 tsubst_tree_list (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
15130 if (t
== void_list_node
)
15133 tree purpose
= TREE_PURPOSE (t
);
15134 tree purposevec
= NULL_TREE
;
15137 else if (PACK_EXPANSION_P (purpose
))
15139 purpose
= tsubst_pack_expansion (purpose
, args
, complain
, in_decl
);
15140 if (TREE_CODE (purpose
) == TREE_VEC
)
15141 purposevec
= purpose
;
15143 else if (TYPE_P (purpose
))
15144 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
15146 purpose
= tsubst_copy_and_build (purpose
, args
, complain
, in_decl
);
15147 if (purpose
== error_mark_node
|| purposevec
== error_mark_node
)
15148 return error_mark_node
;
15150 tree value
= TREE_VALUE (t
);
15151 tree valuevec
= NULL_TREE
;
15154 else if (PACK_EXPANSION_P (value
))
15156 value
= tsubst_pack_expansion (value
, args
, complain
, in_decl
);
15157 if (TREE_CODE (value
) == TREE_VEC
)
15160 else if (TYPE_P (value
))
15161 value
= tsubst (value
, args
, complain
, in_decl
);
15163 value
= tsubst_copy_and_build (value
, args
, complain
, in_decl
);
15164 if (value
== error_mark_node
|| valuevec
== error_mark_node
)
15165 return error_mark_node
;
15167 tree chain
= TREE_CHAIN (t
);
15170 else if (TREE_CODE (chain
) == TREE_LIST
)
15171 chain
= tsubst_tree_list (chain
, args
, complain
, in_decl
);
15172 else if (TYPE_P (chain
))
15173 chain
= tsubst (chain
, args
, complain
, in_decl
);
15175 chain
= tsubst_copy_and_build (chain
, args
, complain
, in_decl
);
15176 if (chain
== error_mark_node
)
15177 return error_mark_node
;
15179 if (purpose
== TREE_PURPOSE (t
)
15180 && value
== TREE_VALUE (t
)
15181 && chain
== TREE_CHAIN (t
))
15185 /* Determine the number of arguments. */
15188 len
= TREE_VEC_LENGTH (purposevec
);
15189 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
15192 len
= TREE_VEC_LENGTH (valuevec
);
15196 for (int i
= len
; i
-- > 0; )
15199 purpose
= TREE_VEC_ELT (purposevec
, i
);
15201 value
= TREE_VEC_ELT (valuevec
, i
);
15203 if (value
&& TYPE_P (value
))
15204 chain
= hash_tree_cons (purpose
, value
, chain
);
15206 chain
= tree_cons (purpose
, value
, chain
);
15212 /* Take the tree structure T and replace template parameters used
15213 therein with the argument vector ARGS. IN_DECL is an associated
15214 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
15215 Issue error and warning messages under control of COMPLAIN. Note
15216 that we must be relatively non-tolerant of extensions here, in
15217 order to preserve conformance; if we allow substitutions that
15218 should not be allowed, we may allow argument deductions that should
15219 not succeed, and therefore report ambiguous overload situations
15220 where there are none. In theory, we could allow the substitution,
15221 but indicate that it should have failed, and allow our caller to
15222 make sure that the right thing happens, but we don't try to do this
15225 This function is used for dealing with types, decls and the like;
15226 for expressions, use tsubst_expr or tsubst_copy. */
15229 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
15231 enum tree_code code
;
15232 tree type
, r
= NULL_TREE
;
15234 if (t
== NULL_TREE
|| t
== error_mark_node
15235 || t
== integer_type_node
15236 || t
== void_type_node
15237 || t
== char_type_node
15238 || t
== unknown_type_node
15239 || TREE_CODE (t
) == NAMESPACE_DECL
15240 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
15244 return tsubst_decl (t
, args
, complain
);
15246 if (args
== NULL_TREE
)
15249 code
= TREE_CODE (t
);
15251 if (code
== IDENTIFIER_NODE
)
15252 type
= IDENTIFIER_TYPE_VALUE (t
);
15254 type
= TREE_TYPE (t
);
15256 gcc_assert (type
!= unknown_type_node
);
15258 /* Reuse typedefs. We need to do this to handle dependent attributes,
15259 such as attribute aligned. */
15261 && typedef_variant_p (t
))
15263 tree decl
= TYPE_NAME (t
);
15265 if (alias_template_specialization_p (t
, nt_opaque
))
15267 /* DECL represents an alias template and we want to
15269 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
15270 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
15271 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
15273 else if (DECL_CLASS_SCOPE_P (decl
)
15274 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
15275 && uses_template_parms (DECL_CONTEXT (decl
)))
15277 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
15278 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
15279 r
= retrieve_specialization (tmpl
, gen_args
, 0);
15281 else if (DECL_FUNCTION_SCOPE_P (decl
)
15282 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
15283 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
15284 r
= retrieve_local_specialization (decl
);
15286 /* The typedef is from a non-template context. */
15292 r
= cp_build_qualified_type_real
15293 (r
, cp_type_quals (t
) | cp_type_quals (r
),
15294 complain
| tf_ignore_bad_quals
);
15299 /* We don't have an instantiation yet, so drop the typedef. */
15300 int quals
= cp_type_quals (t
);
15301 t
= DECL_ORIGINAL_TYPE (decl
);
15302 t
= cp_build_qualified_type_real (t
, quals
,
15303 complain
| tf_ignore_bad_quals
);
15307 bool fndecl_type
= (complain
& tf_fndecl_type
);
15308 complain
&= ~tf_fndecl_type
;
15311 && code
!= TYPENAME_TYPE
15312 && code
!= TEMPLATE_TYPE_PARM
15313 && code
!= TEMPLATE_PARM_INDEX
15314 && code
!= IDENTIFIER_NODE
15315 && code
!= FUNCTION_TYPE
15316 && code
!= METHOD_TYPE
)
15317 type
= tsubst (type
, args
, complain
, in_decl
);
15318 if (type
== error_mark_node
)
15319 return error_mark_node
;
15325 case ENUMERAL_TYPE
:
15326 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
15327 /*entering_scope=*/0);
15330 case IDENTIFIER_NODE
:
15341 if (t
== integer_type_node
)
15344 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
15345 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
15349 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
15351 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
15352 /*integral_constant_expression_p=*/false);
15354 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
15356 if (TREE_CODE (max
) == NOP_EXPR
15357 && TREE_SIDE_EFFECTS (omax
)
15358 && !TREE_TYPE (max
))
15359 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
15361 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
15362 with TREE_SIDE_EFFECTS that indicates this is not an integral
15363 constant expression. */
15364 if (processing_template_decl
15365 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
15367 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
15368 TREE_SIDE_EFFECTS (max
) = 1;
15371 return compute_array_index_type (NULL_TREE
, max
, complain
);
15374 case TEMPLATE_TYPE_PARM
:
15375 case TEMPLATE_TEMPLATE_PARM
:
15376 case BOUND_TEMPLATE_TEMPLATE_PARM
:
15377 case TEMPLATE_PARM_INDEX
:
15382 tree arg
= NULL_TREE
;
15386 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
15387 template_parm_level_and_index (t
, &level
, &idx
);
15389 levels
= TMPL_ARGS_DEPTH (args
);
15390 if (level
<= levels
15391 && TREE_VEC_LENGTH (TMPL_ARGS_LEVEL (args
, level
)) > 0)
15393 arg
= TMPL_ARG (args
, level
, idx
);
15395 /* See through ARGUMENT_PACK_SELECT arguments. */
15396 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
15397 arg
= argument_pack_select_arg (arg
);
15400 if (arg
== error_mark_node
)
15401 return error_mark_node
;
15402 else if (arg
!= NULL_TREE
)
15404 if (ARGUMENT_PACK_P (arg
))
15405 /* If ARG is an argument pack, we don't actually want to
15406 perform a substitution here, because substitutions
15407 for argument packs are only done
15408 element-by-element. We can get to this point when
15409 substituting the type of a non-type template
15410 parameter pack, when that type actually contains
15411 template parameter packs from an outer template, e.g.,
15413 template<typename... Types> struct A {
15414 template<Types... Values> struct B { };
15418 if (code
== TEMPLATE_TYPE_PARM
)
15422 /* When building concept checks for the purpose of
15423 deducing placeholders, we can end up with wildcards
15424 where types are expected. Adjust this to the deduced
15426 if (TREE_CODE (arg
) == WILDCARD_DECL
)
15427 arg
= TREE_TYPE (TREE_TYPE (arg
));
15429 gcc_assert (TYPE_P (arg
));
15431 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
15433 return cp_build_qualified_type_real
15434 (arg
, quals
, complain
| tf_ignore_bad_quals
);
15436 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
15438 /* We are processing a type constructed from a
15439 template template parameter. */
15440 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
15441 args
, complain
, in_decl
);
15442 if (argvec
== error_mark_node
)
15443 return error_mark_node
;
15445 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
15446 || TREE_CODE (arg
) == TEMPLATE_DECL
15447 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
15449 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
15450 /* Consider this code:
15452 template <template <class> class Template>
15454 template <class Arg> using Bind = Template<Arg>;
15457 template <template <class> class Template, class Arg>
15458 using Instantiate = Template<Arg>; //#0
15460 template <template <class> class Template,
15463 Instantiate<Internal<Template>::template Bind,
15466 When #1 is parsed, the
15467 BOUND_TEMPLATE_TEMPLATE_PARM representing the
15468 parameter `Template' in #0 matches the
15469 UNBOUND_CLASS_TEMPLATE representing the argument
15470 `Internal<Template>::template Bind'; We then want
15471 to assemble the type `Bind<Argument>' that can't
15472 be fully created right now, because
15473 `Internal<Template>' not being complete, the Bind
15474 template cannot be looked up in that context. So
15475 we need to "store" `Bind<Argument>' for later
15476 when the context of Bind becomes complete. Let's
15477 store that in a TYPENAME_TYPE. */
15478 return make_typename_type (TYPE_CONTEXT (arg
),
15479 build_nt (TEMPLATE_ID_EXPR
,
15480 TYPE_IDENTIFIER (arg
),
15485 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
15486 are resolving nested-types in the signature of a
15487 member function templates. Otherwise ARG is a
15488 TEMPLATE_DECL and is the real template to be
15490 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
15491 arg
= TYPE_NAME (arg
);
15493 r
= lookup_template_class (arg
,
15495 DECL_CONTEXT (arg
),
15496 /*entering_scope=*/0,
15498 return cp_build_qualified_type_real
15499 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
15501 else if (code
== TEMPLATE_TEMPLATE_PARM
)
15504 /* TEMPLATE_PARM_INDEX. */
15505 return convert_from_reference (unshare_expr (arg
));
15509 /* This can happen during the attempted tsubst'ing in
15510 unify. This means that we don't yet have any information
15511 about the template parameter in question. */
15514 /* Early in template argument deduction substitution, we don't
15515 want to reduce the level of 'auto', or it will be confused
15516 with a normal template parm in subsequent deduction.
15517 Similarly, don't reduce the level of template parameters to
15518 avoid mismatches when deducing their types. */
15519 if (complain
& tf_partial
)
15522 /* If we get here, we must have been looking at a parm for a
15523 more deeply nested template. Make a new version of this
15524 template parameter, but with a lower level. */
15527 case TEMPLATE_TYPE_PARM
:
15528 case TEMPLATE_TEMPLATE_PARM
:
15529 case BOUND_TEMPLATE_TEMPLATE_PARM
:
15530 if (cp_type_quals (t
))
15532 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
15533 r
= cp_build_qualified_type_real
15534 (r
, cp_type_quals (t
),
15535 complain
| (code
== TEMPLATE_TYPE_PARM
15536 ? tf_ignore_bad_quals
: 0));
15538 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
15539 && PLACEHOLDER_TYPE_CONSTRAINTS (t
)
15540 && (r
= (TEMPLATE_PARM_DESCENDANTS
15541 (TEMPLATE_TYPE_PARM_INDEX (t
))))
15542 && (r
= TREE_TYPE (r
))
15543 && !PLACEHOLDER_TYPE_CONSTRAINTS (r
))
15544 /* Break infinite recursion when substituting the constraints
15545 of a constrained placeholder. */;
15546 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
15547 && !PLACEHOLDER_TYPE_CONSTRAINTS (t
)
15548 && !CLASS_PLACEHOLDER_TEMPLATE (t
)
15549 && (arg
= TEMPLATE_TYPE_PARM_INDEX (t
),
15550 r
= TEMPLATE_PARM_DESCENDANTS (arg
))
15551 && (TEMPLATE_PARM_LEVEL (r
)
15552 == TEMPLATE_PARM_LEVEL (arg
) - levels
))
15553 /* Cache the simple case of lowering a type parameter. */
15558 TEMPLATE_TYPE_PARM_INDEX (r
)
15559 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
15560 r
, levels
, args
, complain
);
15561 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
15562 TYPE_MAIN_VARIANT (r
) = r
;
15563 TYPE_POINTER_TO (r
) = NULL_TREE
;
15564 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
15566 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
15568 /* Propagate constraints on placeholders since they are
15569 only instantiated during satisfaction. */
15570 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
15571 PLACEHOLDER_TYPE_CONSTRAINTS (r
) = constr
;
15572 else if (tree pl
= CLASS_PLACEHOLDER_TEMPLATE (t
))
15574 pl
= tsubst_copy (pl
, args
, complain
, in_decl
);
15575 CLASS_PLACEHOLDER_TEMPLATE (r
) = pl
;
15579 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
15580 /* We have reduced the level of the template
15581 template parameter, but not the levels of its
15582 template parameters, so canonical_type_parameter
15583 will not be able to find the canonical template
15584 template parameter for this level. Thus, we
15585 require structural equality checking to compare
15586 TEMPLATE_TEMPLATE_PARMs. */
15587 SET_TYPE_STRUCTURAL_EQUALITY (r
);
15588 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
15589 SET_TYPE_STRUCTURAL_EQUALITY (r
);
15591 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
15593 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
15595 tree tinfo
= TYPE_TEMPLATE_INFO (t
);
15596 /* We might need to substitute into the types of non-type
15597 template parameters. */
15598 tree tmpl
= tsubst (TI_TEMPLATE (tinfo
), args
,
15599 complain
, in_decl
);
15600 if (tmpl
== error_mark_node
)
15601 return error_mark_node
;
15602 tree argvec
= tsubst (TI_ARGS (tinfo
), args
,
15603 complain
, in_decl
);
15604 if (argvec
== error_mark_node
)
15605 return error_mark_node
;
15607 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
15608 = build_template_info (tmpl
, argvec
);
15613 case TEMPLATE_PARM_INDEX
:
15614 /* OK, now substitute the type of the non-type parameter. We
15615 couldn't do it earlier because it might be an auto parameter,
15616 and we wouldn't need to if we had an argument. */
15617 type
= tsubst (type
, args
, complain
, in_decl
);
15618 if (type
== error_mark_node
)
15619 return error_mark_node
;
15620 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
15624 gcc_unreachable ();
15631 return tsubst_tree_list (t
, args
, complain
, in_decl
);
15634 /* We should never be tsubsting a binfo. */
15635 gcc_unreachable ();
15638 /* A vector of template arguments. */
15639 gcc_assert (!type
);
15640 return tsubst_template_args (t
, args
, complain
, in_decl
);
15643 case REFERENCE_TYPE
:
15645 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
15650 Type deduction may fail for any of the following
15653 -- Attempting to create a pointer to reference type.
15654 -- Attempting to create a reference to a reference type or
15655 a reference to void.
15657 Core issue 106 says that creating a reference to a reference
15658 during instantiation is no longer a cause for failure. We
15659 only enforce this check in strict C++98 mode. */
15660 if ((TYPE_REF_P (type
)
15661 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
15662 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
15664 static location_t last_loc
;
15666 /* We keep track of the last time we issued this error
15667 message to avoid spewing a ton of messages during a
15668 single bad template instantiation. */
15669 if (complain
& tf_error
15670 && last_loc
!= input_location
)
15672 if (VOID_TYPE_P (type
))
15673 error ("forming reference to void");
15674 else if (code
== POINTER_TYPE
)
15675 error ("forming pointer to reference type %qT", type
);
15677 error ("forming reference to reference type %qT", type
);
15678 last_loc
= input_location
;
15681 return error_mark_node
;
15683 else if (TREE_CODE (type
) == FUNCTION_TYPE
15684 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
15685 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
15687 if (complain
& tf_error
)
15689 if (code
== POINTER_TYPE
)
15690 error ("forming pointer to qualified function type %qT",
15693 error ("forming reference to qualified function type %qT",
15696 return error_mark_node
;
15698 else if (code
== POINTER_TYPE
)
15700 r
= build_pointer_type (type
);
15701 if (TREE_CODE (type
) == METHOD_TYPE
)
15702 r
= build_ptrmemfunc_type (r
);
15704 else if (TYPE_REF_P (type
))
15705 /* In C++0x, during template argument substitution, when there is an
15706 attempt to create a reference to a reference type, reference
15707 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
15709 "If a template-argument for a template-parameter T names a type
15710 that is a reference to a type A, an attempt to create the type
15711 'lvalue reference to cv T' creates the type 'lvalue reference to
15712 A,' while an attempt to create the type type rvalue reference to
15713 cv T' creates the type T"
15715 r
= cp_build_reference_type
15717 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
15719 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
15720 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
15722 if (r
!= error_mark_node
)
15723 /* Will this ever be needed for TYPE_..._TO values? */
15730 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
15731 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
15735 Type deduction may fail for any of the following
15738 -- Attempting to create "pointer to member of T" when T
15739 is not a class type. */
15740 if (complain
& tf_error
)
15741 error ("creating pointer to member of non-class type %qT", r
);
15742 return error_mark_node
;
15744 if (TYPE_REF_P (type
))
15746 if (complain
& tf_error
)
15747 error ("creating pointer to member reference type %qT", type
);
15748 return error_mark_node
;
15750 if (VOID_TYPE_P (type
))
15752 if (complain
& tf_error
)
15753 error ("creating pointer to member of type void");
15754 return error_mark_node
;
15756 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
15757 if (TREE_CODE (type
) == FUNCTION_TYPE
)
15759 /* The type of the implicit object parameter gets its
15760 cv-qualifiers from the FUNCTION_TYPE. */
15763 = build_memfn_type (type
, r
, type_memfn_quals (type
),
15764 type_memfn_rqual (type
));
15765 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
15766 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
15770 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
15774 case FUNCTION_TYPE
:
15779 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
15780 if (fntype
== error_mark_node
)
15781 return error_mark_node
;
15783 /* Substitute the exception specification. */
15784 specs
= tsubst_exception_specification (t
, args
, complain
, in_decl
,
15785 /*defer_ok*/fndecl_type
);
15786 if (specs
== error_mark_node
)
15787 return error_mark_node
;
15789 fntype
= build_exception_variant (fntype
, specs
);
15794 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
15795 if (domain
== error_mark_node
)
15796 return error_mark_node
;
15798 /* As an optimization, we avoid regenerating the array type if
15799 it will obviously be the same as T. */
15800 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
15803 /* These checks should match the ones in create_array_type_for_decl.
15807 The deduction may fail for any of the following reasons:
15809 -- Attempting to create an array with an element type that
15810 is void, a function type, or a reference type, or [DR337]
15811 an abstract class type. */
15812 if (VOID_TYPE_P (type
)
15813 || TREE_CODE (type
) == FUNCTION_TYPE
15814 || (TREE_CODE (type
) == ARRAY_TYPE
15815 && TYPE_DOMAIN (type
) == NULL_TREE
)
15816 || TYPE_REF_P (type
))
15818 if (complain
& tf_error
)
15819 error ("creating array of %qT", type
);
15820 return error_mark_node
;
15823 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
15824 return error_mark_node
;
15826 r
= build_cplus_array_type (type
, domain
);
15828 if (!valid_array_size_p (input_location
, r
, in_decl
,
15829 (complain
& tf_error
)))
15830 return error_mark_node
;
15832 if (TYPE_USER_ALIGN (t
))
15834 SET_TYPE_ALIGN (r
, TYPE_ALIGN (t
));
15835 TYPE_USER_ALIGN (r
) = 1;
15841 case TYPENAME_TYPE
:
15843 tree ctx
= TYPE_CONTEXT (t
);
15844 if (TREE_CODE (ctx
) == TYPE_PACK_EXPANSION
)
15846 ctx
= tsubst_pack_expansion (ctx
, args
, complain
, in_decl
);
15847 if (ctx
== error_mark_node
15848 || TREE_VEC_LENGTH (ctx
) > 1)
15849 return error_mark_node
;
15850 if (TREE_VEC_LENGTH (ctx
) == 0)
15852 if (complain
& tf_error
)
15853 error ("%qD is instantiated for an empty pack",
15854 TYPENAME_TYPE_FULLNAME (t
));
15855 return error_mark_node
;
15857 ctx
= TREE_VEC_ELT (ctx
, 0);
15860 ctx
= tsubst_aggr_type (ctx
, args
, complain
, in_decl
,
15861 /*entering_scope=*/1);
15862 if (ctx
== error_mark_node
)
15863 return error_mark_node
;
15865 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
15866 complain
, in_decl
);
15867 if (f
== error_mark_node
)
15868 return error_mark_node
;
15870 if (!MAYBE_CLASS_TYPE_P (ctx
))
15872 if (complain
& tf_error
)
15873 error ("%qT is not a class, struct, or union type", ctx
);
15874 return error_mark_node
;
15876 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
15878 /* Normally, make_typename_type does not require that the CTX
15879 have complete type in order to allow things like:
15881 template <class T> struct S { typename S<T>::X Y; };
15883 But, such constructs have already been resolved by this
15884 point, so here CTX really should have complete type, unless
15885 it's a partial instantiation. */
15886 ctx
= complete_type (ctx
);
15887 if (!COMPLETE_TYPE_P (ctx
))
15889 if (complain
& tf_error
)
15890 cxx_incomplete_type_error (NULL_TREE
, ctx
);
15891 return error_mark_node
;
15895 f
= make_typename_type (ctx
, f
, typename_type
,
15896 complain
| tf_keep_type_decl
);
15897 if (f
== error_mark_node
)
15899 if (TREE_CODE (f
) == TYPE_DECL
)
15901 complain
|= tf_ignore_bad_quals
;
15905 if (TREE_CODE (f
) != TYPENAME_TYPE
)
15907 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
15909 if (complain
& tf_error
)
15910 error ("%qT resolves to %qT, which is not an enumeration type",
15913 return error_mark_node
;
15915 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
15917 if (complain
& tf_error
)
15918 error ("%qT resolves to %qT, which is not a class type",
15921 return error_mark_node
;
15925 return cp_build_qualified_type_real
15926 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
15929 case UNBOUND_CLASS_TEMPLATE
:
15931 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
15932 in_decl
, /*entering_scope=*/1);
15933 tree name
= TYPE_IDENTIFIER (t
);
15934 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
15936 if (ctx
== error_mark_node
|| name
== error_mark_node
)
15937 return error_mark_node
;
15940 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
15941 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
15948 ++cp_unevaluated_operand
;
15949 ++c_inhibit_evaluation_warnings
;
15951 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
15953 /*integral_constant_expression_p=*/false);
15955 --cp_unevaluated_operand
;
15956 --c_inhibit_evaluation_warnings
;
15958 type
= finish_typeof (type
);
15959 return cp_build_qualified_type_real (type
,
15961 | cp_type_quals (type
),
15965 case DECLTYPE_TYPE
:
15969 ++cp_unevaluated_operand
;
15970 ++c_inhibit_evaluation_warnings
;
15972 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
15973 complain
|tf_decltype
, in_decl
,
15974 /*function_p*/false,
15975 /*integral_constant_expression*/false);
15977 --cp_unevaluated_operand
;
15978 --c_inhibit_evaluation_warnings
;
15980 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
15981 type
= lambda_capture_field_type (type
,
15982 false /*explicit_init*/,
15983 DECLTYPE_FOR_REF_CAPTURE (t
));
15984 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
15985 type
= lambda_proxy_type (type
);
15988 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
15989 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
15991 /* In a template ~id could be either a complement expression
15992 or an unqualified-id naming a destructor; if instantiating
15993 it produces an expression, it's not an id-expression or
15996 type
= finish_decltype_type (type
, id
, complain
);
15998 return cp_build_qualified_type_real (type
,
16000 | cp_type_quals (type
),
16001 complain
| tf_ignore_bad_quals
);
16004 case UNDERLYING_TYPE
:
16006 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
16007 complain
, in_decl
);
16008 return finish_underlying_type (type
);
16011 case TYPE_ARGUMENT_PACK
:
16012 case NONTYPE_ARGUMENT_PACK
:
16016 if (code
== NONTYPE_ARGUMENT_PACK
)
16017 r
= make_node (code
);
16019 r
= cxx_make_type (code
);
16021 tree pack_args
= ARGUMENT_PACK_ARGS (t
);
16022 pack_args
= tsubst_template_args (pack_args
, args
, complain
, in_decl
);
16023 SET_ARGUMENT_PACK_ARGS (r
, pack_args
);
16041 /* We should use one of the expression tsubsts for these codes. */
16042 gcc_unreachable ();
16045 sorry ("use of %qs in template", get_tree_code_name (code
));
16046 return error_mark_node
;
16050 /* tsubst a BASELINK. OBJECT_TYPE, if non-NULL, is the type of the
16051 expression on the left-hand side of the "." or "->" operator. We
16052 only do the lookup if we had a dependent BASELINK. Otherwise we
16053 adjust it onto the instantiated heirarchy. */
16056 tsubst_baselink (tree baselink
, tree object_type
,
16057 tree args
, tsubst_flags_t complain
, tree in_decl
)
16059 bool qualified_p
= BASELINK_QUALIFIED_P (baselink
);
16060 tree qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
16061 qualifying_scope
= tsubst (qualifying_scope
, args
, complain
, in_decl
);
16063 tree optype
= BASELINK_OPTYPE (baselink
);
16064 optype
= tsubst (optype
, args
, complain
, in_decl
);
16066 tree template_args
= NULL_TREE
;
16067 bool template_id_p
= false;
16068 tree fns
= BASELINK_FUNCTIONS (baselink
);
16069 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
16071 template_id_p
= true;
16072 template_args
= TREE_OPERAND (fns
, 1);
16073 fns
= TREE_OPERAND (fns
, 0);
16075 template_args
= tsubst_template_args (template_args
, args
,
16076 complain
, in_decl
);
16079 tree binfo_type
= BINFO_TYPE (BASELINK_BINFO (baselink
));
16080 binfo_type
= tsubst (binfo_type
, args
, complain
, in_decl
);
16081 bool dependent_p
= binfo_type
!= BINFO_TYPE (BASELINK_BINFO (baselink
));
16085 tree name
= OVL_NAME (fns
);
16086 if (IDENTIFIER_CONV_OP_P (name
))
16087 name
= make_conv_op_name (optype
);
16089 if (name
== complete_dtor_identifier
)
16090 /* Treat as-if non-dependent below. */
16091 dependent_p
= false;
16093 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1,
16097 if ((complain
& tf_error
)
16098 && constructor_name_p (name
, qualifying_scope
))
16099 error ("cannot call constructor %<%T::%D%> directly",
16100 qualifying_scope
, name
);
16101 return error_mark_node
;
16104 if (BASELINK_P (baselink
))
16105 fns
= BASELINK_FUNCTIONS (baselink
);
16108 /* We're going to overwrite pieces below, make a duplicate. */
16109 baselink
= copy_node (baselink
);
16111 /* If lookup found a single function, mark it as used at this point.
16112 (If lookup found multiple functions the one selected later by
16113 overload resolution will be marked as used at that point.) */
16114 if (!template_id_p
&& !really_overloaded_fn (fns
))
16116 tree fn
= OVL_FIRST (fns
);
16117 bool ok
= mark_used (fn
, complain
);
16118 if (!ok
&& !(complain
& tf_error
))
16119 return error_mark_node
;
16120 if (ok
&& BASELINK_P (baselink
))
16121 /* We might have instantiated an auto function. */
16122 TREE_TYPE (baselink
) = TREE_TYPE (fn
);
16125 if (BASELINK_P (baselink
))
16127 /* Add back the template arguments, if present. */
16129 BASELINK_FUNCTIONS (baselink
)
16130 = build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fns
, template_args
);
16132 /* Update the conversion operator type. */
16133 BASELINK_OPTYPE (baselink
) = optype
;
16137 object_type
= current_class_type
;
16139 if (qualified_p
|| !dependent_p
)
16141 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
16145 /* We need to call adjust_result_of_qualified_name_lookup in case the
16146 destructor names a base class, but we unset BASELINK_QUALIFIED_P
16147 so that we still get virtual function binding. */
16148 BASELINK_QUALIFIED_P (baselink
) = false;
16154 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
16155 true if the qualified-id will be a postfix-expression in-and-of
16156 itself; false if more of the postfix-expression follows the
16157 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
16161 tsubst_qualified_id (tree qualified_id
, tree args
,
16162 tsubst_flags_t complain
, tree in_decl
,
16163 bool done
, bool address_p
)
16169 tree template_args
;
16170 location_t loc
= UNKNOWN_LOCATION
;
16172 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
16174 /* Figure out what name to look up. */
16175 name
= TREE_OPERAND (qualified_id
, 1);
16176 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
16178 is_template
= true;
16179 loc
= EXPR_LOCATION (name
);
16180 template_args
= TREE_OPERAND (name
, 1);
16182 template_args
= tsubst_template_args (template_args
, args
,
16183 complain
, in_decl
);
16184 if (template_args
== error_mark_node
)
16185 return error_mark_node
;
16186 name
= TREE_OPERAND (name
, 0);
16190 is_template
= false;
16191 template_args
= NULL_TREE
;
16194 /* Substitute into the qualifying scope. When there are no ARGS, we
16195 are just trying to simplify a non-dependent expression. In that
16196 case the qualifying scope may be dependent, and, in any case,
16197 substituting will not help. */
16198 scope
= TREE_OPERAND (qualified_id
, 0);
16201 scope
= tsubst (scope
, args
, complain
, in_decl
);
16202 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
16207 if (dependent_scope_p (scope
))
16210 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
16211 tree r
= build_qualified_name (NULL_TREE
, scope
, expr
,
16212 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
16213 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (qualified_id
);
16217 if (!BASELINK_P (name
) && !DECL_P (expr
))
16219 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
16221 /* A BIT_NOT_EXPR is used to represent a destructor. */
16222 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
16224 error ("qualifying type %qT does not match destructor name ~%qT",
16225 scope
, TREE_OPERAND (expr
, 0));
16226 expr
= error_mark_node
;
16229 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
16230 LOOK_want::NORMAL
, false);
16233 expr
= lookup_qualified_name (scope
, expr
, LOOK_want::NORMAL
, false);
16234 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
16235 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
16237 if (complain
& tf_error
)
16239 error ("dependent-name %qE is parsed as a non-type, but "
16240 "instantiation yields a type", qualified_id
);
16241 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
16243 return error_mark_node
;
16249 if (!check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
16251 return error_mark_node
;
16252 /* Remember that there was a reference to this entity. */
16253 if (!mark_used (expr
, complain
) && !(complain
& tf_error
))
16254 return error_mark_node
;
16257 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
16259 if (complain
& tf_error
)
16260 qualified_name_lookup_error (scope
,
16261 TREE_OPERAND (qualified_id
, 1),
16262 expr
, input_location
);
16263 return error_mark_node
;
16268 /* We may be repeating a check already done during parsing, but
16269 if it was well-formed and passed then, it will pass again
16270 now, and if it didn't, we wouldn't have got here. The case
16271 we want to catch is when we couldn't tell then, and can now,
16272 namely when templ prior to substitution was an
16274 if (flag_concepts
&& check_auto_in_tmpl_args (expr
, template_args
))
16275 return error_mark_node
;
16277 if (variable_template_p (expr
))
16278 expr
= lookup_and_finish_template_variable (expr
, template_args
,
16281 expr
= lookup_template_function (expr
, template_args
);
16284 if (expr
== error_mark_node
&& complain
& tf_error
)
16285 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
16286 expr
, input_location
);
16287 else if (TYPE_P (scope
))
16289 expr
= (adjust_result_of_qualified_name_lookup
16290 (expr
, scope
, current_nonlambda_class_type ()));
16291 expr
= (finish_qualified_id_expr
16292 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
16293 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
16294 /*template_arg_p=*/false, complain
));
16297 /* Expressions do not generally have reference type. */
16298 if (TREE_CODE (expr
) != SCOPE_REF
16299 /* However, if we're about to form a pointer-to-member, we just
16300 want the referenced member referenced. */
16301 && TREE_CODE (expr
) != OFFSET_REF
)
16302 expr
= convert_from_reference (expr
);
16304 if (REF_PARENTHESIZED_P (qualified_id
))
16305 expr
= force_paren_expr (expr
);
16310 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
16311 initializer, DECL is the substituted VAR_DECL. Other arguments are as
16315 tsubst_init (tree init
, tree decl
, tree args
,
16316 tsubst_flags_t complain
, tree in_decl
)
16321 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
16323 tree type
= TREE_TYPE (decl
);
16325 if (!init
&& type
!= error_mark_node
)
16327 if (tree auto_node
= type_uses_auto (type
))
16329 if (!CLASS_PLACEHOLDER_TEMPLATE (auto_node
))
16331 if (complain
& tf_error
)
16332 error ("initializer for %q#D expands to an empty list "
16333 "of expressions", decl
);
16334 return error_mark_node
;
16337 else if (!dependent_type_p (type
))
16339 /* If we had an initializer but it
16340 instantiated to nothing,
16341 value-initialize the object. This will
16342 only occur when the initializer was a
16343 pack expansion where the parameter packs
16344 used in that expansion were of length
16346 init
= build_value_init (type
, complain
);
16347 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
16348 init
= get_target_expr_sfinae (init
, complain
);
16349 if (TREE_CODE (init
) == TARGET_EXPR
)
16350 TARGET_EXPR_DIRECT_INIT_P (init
) = true;
16357 /* If T is a reference to a dependent member of the current instantiation C and
16358 we are trying to refer to that member in a partial instantiation of C,
16359 return a SCOPE_REF; otherwise, return NULL_TREE.
16361 This can happen when forming a C++17 deduction guide, as in PR96199. */
16364 maybe_dependent_member_ref (tree t
, tree args
, tsubst_flags_t complain
,
16367 if (cxx_dialect
< cxx17
)
16370 tree ctx
= context_for_name_lookup (t
);
16371 if (!CLASS_TYPE_P (ctx
))
16374 ctx
= tsubst (ctx
, args
, complain
, in_decl
);
16375 if (dependent_scope_p (ctx
))
16376 return build_qualified_name (NULL_TREE
, ctx
, DECL_NAME (t
),
16377 /*template_p=*/false);
16382 /* Like tsubst, but deals with expressions. This function just replaces
16383 template parms; to finish processing the resultant expression, use
16384 tsubst_copy_and_build or tsubst_expr. */
16387 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
16389 enum tree_code code
;
16392 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
16395 code
= TREE_CODE (t
);
16400 r
= retrieve_local_specialization (t
);
16402 if (r
== NULL_TREE
)
16404 /* We get here for a use of 'this' in an NSDMI. */
16405 if (DECL_NAME (t
) == this_identifier
&& current_class_ptr
)
16406 return current_class_ptr
;
16408 /* This can happen for a parameter name used later in a function
16409 declaration (such as in a late-specified return type). Just
16410 make a dummy decl, since it's only used for its type. */
16411 gcc_assert (cp_unevaluated_operand
!= 0);
16412 r
= tsubst_decl (t
, args
, complain
);
16413 /* Give it the template pattern as its context; its true context
16414 hasn't been instantiated yet and this is good enough for
16416 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
16419 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
16420 r
= argument_pack_select_arg (r
);
16421 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
16422 return error_mark_node
;
16430 if (DECL_TEMPLATE_PARM_P (t
))
16431 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
16432 /* There is no need to substitute into namespace-scope
16434 if (DECL_NAMESPACE_SCOPE_P (t
))
16436 /* If ARGS is NULL, then T is known to be non-dependent. */
16437 if (args
== NULL_TREE
)
16438 return scalar_constant_value (t
);
16440 if (tree ref
= maybe_dependent_member_ref (t
, args
, complain
, in_decl
))
16443 /* Unfortunately, we cannot just call lookup_name here.
16446 template <int I> int f() {
16448 struct S { void g() { E e = a; } };
16451 When we instantiate f<7>::S::g(), say, lookup_name is not
16452 clever enough to find f<7>::a. */
16454 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
16455 /*entering_scope=*/0);
16457 for (v
= TYPE_VALUES (enum_type
);
16459 v
= TREE_CHAIN (v
))
16460 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
16461 return TREE_VALUE (v
);
16463 /* We didn't find the name. That should never happen; if
16464 name-lookup found it during preliminary parsing, we
16465 should find it again here during instantiation. */
16466 gcc_unreachable ();
16471 if (DECL_CONTEXT (t
))
16475 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
16476 /*entering_scope=*/1);
16477 if (ctx
!= DECL_CONTEXT (t
))
16479 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
16482 if (complain
& tf_error
)
16483 error ("using invalid field %qD", t
);
16484 return error_mark_node
;
16493 if (tree ref
= maybe_dependent_member_ref (t
, args
, complain
, in_decl
))
16496 case FUNCTION_DECL
:
16497 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
16498 r
= tsubst (t
, args
, complain
, in_decl
);
16499 else if (local_variable_p (t
)
16500 && uses_template_parms (DECL_CONTEXT (t
)))
16502 r
= retrieve_local_specialization (t
);
16503 if (r
== NULL_TREE
)
16505 /* First try name lookup to find the instantiation. */
16506 r
= lookup_name (DECL_NAME (t
));
16511 /* During error-recovery we may find a non-variable,
16512 even an OVERLOAD: just bail out and avoid ICEs and
16513 duplicate diagnostics (c++/62207). */
16514 gcc_assert (seen_error ());
16515 return error_mark_node
;
16517 if (!is_capture_proxy (r
))
16519 /* Make sure the one we found is the one we want. */
16520 tree ctx
= enclosing_instantiation_of (DECL_CONTEXT (t
));
16521 if (ctx
!= DECL_CONTEXT (r
))
16530 /* This can happen for a variable used in a
16531 late-specified return type of a local lambda, or for a
16532 local static or constant. Building a new VAR_DECL
16533 should be OK in all those cases. */
16534 r
= tsubst_decl (t
, args
, complain
);
16535 if (local_specializations
)
16536 /* Avoid infinite recursion (79640). */
16537 register_local_specialization (r
, t
);
16538 if (decl_maybe_constant_var_p (r
))
16540 /* We can't call cp_finish_decl, so handle the
16541 initializer by hand. */
16542 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
16543 complain
, in_decl
);
16544 if (!processing_template_decl
)
16545 init
= maybe_constant_init (init
);
16546 if (processing_template_decl
16547 ? potential_constant_expression (init
)
16548 : reduced_constant_expression_p (init
))
16549 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
16550 = TREE_CONSTANT (r
) = true;
16551 DECL_INITIAL (r
) = init
;
16552 if (tree auto_node
= type_uses_auto (TREE_TYPE (r
)))
16554 = do_auto_deduction (TREE_TYPE (r
), init
, auto_node
,
16555 complain
, adc_variable_type
);
16557 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
16558 || decl_constant_var_p (r
)
16560 if (!processing_template_decl
16561 && !TREE_STATIC (r
))
16562 r
= process_outer_var_ref (r
, complain
);
16564 /* Remember this for subsequent uses. */
16565 if (local_specializations
)
16566 register_local_specialization (r
, t
);
16568 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
16569 r
= argument_pack_select_arg (r
);
16573 if (!mark_used (r
, complain
))
16574 return error_mark_node
;
16577 case NAMESPACE_DECL
:
16584 return tsubst_baselink (t
, current_nonlambda_class_type (),
16585 args
, complain
, in_decl
);
16587 case TEMPLATE_DECL
:
16588 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
16589 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
16590 args
, complain
, in_decl
);
16591 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
16592 return tsubst (t
, args
, complain
, in_decl
);
16593 else if (DECL_CLASS_SCOPE_P (t
)
16594 && uses_template_parms (DECL_CONTEXT (t
)))
16596 /* Template template argument like the following example need
16599 template <template <class> class TT> struct C {};
16600 template <class T> struct D {
16601 template <class U> struct E {};
16606 We are processing the template argument `E' in #1 for
16607 the template instantiation #2. Originally, `E' is a
16608 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
16609 have to substitute this with one having context `D<int>'. */
16611 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
16612 if (dependent_scope_p (context
))
16614 /* When rewriting a constructor into a deduction guide, a
16615 non-dependent name can become dependent, so memtmpl<args>
16616 becomes context::template memtmpl<args>. */
16617 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16618 return build_qualified_name (type
, context
, DECL_NAME (t
),
16621 return lookup_field (context
, DECL_NAME(t
), 0, false);
16624 /* Ordinary template template argument. */
16627 case NON_LVALUE_EXPR
:
16628 case VIEW_CONVERT_EXPR
:
16630 /* Handle location wrappers by substituting the wrapped node
16631 first, *then* reusing the resulting type. Doing the type
16632 first ensures that we handle template parameters and
16633 parameter pack expansions. */
16634 if (location_wrapper_p (t
))
16636 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
,
16637 complain
, in_decl
);
16638 return maybe_wrap_with_location (op0
, EXPR_LOCATION (t
));
16640 tree op
= TREE_OPERAND (t
, 0);
16641 if (code
== VIEW_CONVERT_EXPR
16642 && TREE_CODE (op
) == TEMPLATE_PARM_INDEX
)
16644 /* Wrapper to make a C++20 template parameter object const. */
16645 op
= tsubst_copy (op
, args
, complain
, in_decl
);
16646 if (TREE_CODE (op
) == TEMPLATE_PARM_INDEX
)
16648 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16649 return build1 (code
, type
, op
);
16653 gcc_assert (CP_TYPE_CONST_P (TREE_TYPE (op
))
16654 || (TREE_CODE (op
) == IMPLICIT_CONV_EXPR
16655 && IMPLICIT_CONV_EXPR_NONTYPE_ARG (op
)));
16659 /* force_paren_expr can also create a VIEW_CONVERT_EXPR. */
16660 else if (code
== VIEW_CONVERT_EXPR
&& REF_PARENTHESIZED_P (t
))
16662 op
= tsubst_copy (op
, args
, complain
, in_decl
);
16663 op
= build1 (code
, TREE_TYPE (op
), op
);
16664 REF_PARENTHESIZED_P (op
) = true;
16667 /* We shouldn't see any other uses of these in templates. */
16668 gcc_unreachable ();
16672 case REINTERPRET_CAST_EXPR
:
16673 case CONST_CAST_EXPR
:
16674 case STATIC_CAST_EXPR
:
16675 case DYNAMIC_CAST_EXPR
:
16676 case IMPLICIT_CONV_EXPR
:
16680 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16681 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
16682 return build1 (code
, type
, op0
);
16686 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0))
16687 || ARGUMENT_PACK_P (TREE_OPERAND (t
, 0)))
16689 tree expanded
, op
= TREE_OPERAND (t
, 0);
16692 if (SIZEOF_EXPR_TYPE_P (t
))
16693 op
= TREE_TYPE (op
);
16695 ++cp_unevaluated_operand
;
16696 ++c_inhibit_evaluation_warnings
;
16697 /* We only want to compute the number of arguments. */
16698 if (PACK_EXPANSION_P (op
))
16699 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
16701 expanded
= tsubst_template_args (ARGUMENT_PACK_ARGS (op
),
16702 args
, complain
, in_decl
);
16703 --cp_unevaluated_operand
;
16704 --c_inhibit_evaluation_warnings
;
16706 if (TREE_CODE (expanded
) == TREE_VEC
)
16708 len
= TREE_VEC_LENGTH (expanded
);
16709 /* Set TREE_USED for the benefit of -Wunused. */
16710 for (int i
= 0; i
< len
; i
++)
16711 if (DECL_P (TREE_VEC_ELT (expanded
, i
)))
16712 TREE_USED (TREE_VEC_ELT (expanded
, i
)) = true;
16715 if (expanded
== error_mark_node
)
16716 return error_mark_node
;
16717 else if (PACK_EXPANSION_P (expanded
)
16718 || (TREE_CODE (expanded
) == TREE_VEC
16719 && pack_expansion_args_count (expanded
)))
16722 if (PACK_EXPANSION_P (expanded
))
16724 else if (TREE_VEC_LENGTH (expanded
) == 1)
16725 expanded
= TREE_VEC_ELT (expanded
, 0);
16727 expanded
= make_argument_pack (expanded
);
16729 if (TYPE_P (expanded
))
16730 return cxx_sizeof_or_alignof_type (input_location
,
16731 expanded
, SIZEOF_EXPR
,
16733 complain
& tf_error
);
16735 return cxx_sizeof_or_alignof_expr (input_location
,
16736 expanded
, SIZEOF_EXPR
,
16737 complain
& tf_error
);
16740 return build_int_cst (size_type_node
, len
);
16742 if (SIZEOF_EXPR_TYPE_P (t
))
16744 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
16745 args
, complain
, in_decl
);
16746 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
16747 r
= build1 (SIZEOF_EXPR
,
16748 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
16749 SIZEOF_EXPR_TYPE_P (r
) = 1;
16756 case TRUTH_NOT_EXPR
:
16759 case UNARY_PLUS_EXPR
: /* Unary + */
16761 case AT_ENCODE_EXPR
:
16765 case REALPART_EXPR
:
16766 case IMAGPART_EXPR
:
16769 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16770 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
16771 r
= build1 (code
, type
, op0
);
16772 if (code
== ALIGNOF_EXPR
)
16773 ALIGNOF_EXPR_STD_P (r
) = ALIGNOF_EXPR_STD_P (t
);
16777 case COMPONENT_REF
:
16782 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
16783 name
= TREE_OPERAND (t
, 1);
16784 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
16786 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
16787 complain
, in_decl
);
16788 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
16790 else if (TREE_CODE (name
) == SCOPE_REF
16791 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
16793 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
16794 complain
, in_decl
);
16795 name
= TREE_OPERAND (name
, 1);
16796 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
16797 complain
, in_decl
);
16798 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
16799 name
= build_qualified_name (/*type=*/NULL_TREE
,
16801 /*template_p=*/false);
16803 else if (BASELINK_P (name
))
16804 name
= tsubst_baselink (name
,
16805 non_reference (TREE_TYPE (object
)),
16809 name
= tsubst_copy (name
, args
, complain
, in_decl
);
16810 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
16816 case TRUNC_DIV_EXPR
:
16817 case CEIL_DIV_EXPR
:
16818 case FLOOR_DIV_EXPR
:
16819 case ROUND_DIV_EXPR
:
16820 case EXACT_DIV_EXPR
:
16824 case TRUNC_MOD_EXPR
:
16825 case FLOOR_MOD_EXPR
:
16826 case TRUTH_ANDIF_EXPR
:
16827 case TRUTH_ORIF_EXPR
:
16828 case TRUTH_AND_EXPR
:
16829 case TRUTH_OR_EXPR
:
16840 case COMPOUND_EXPR
:
16843 case PREDECREMENT_EXPR
:
16844 case PREINCREMENT_EXPR
:
16845 case POSTDECREMENT_EXPR
:
16846 case POSTINCREMENT_EXPR
:
16848 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
16849 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
16850 return build_nt (code
, op0
, op1
);
16855 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
16856 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
16857 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
16858 QUALIFIED_NAME_IS_TEMPLATE (t
));
16863 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
16864 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
16865 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
16870 int n
= VL_EXP_OPERAND_LENGTH (t
);
16871 tree result
= build_vl_exp (CALL_EXPR
, n
);
16873 for (i
= 0; i
< n
; i
++)
16874 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
16875 complain
, in_decl
);
16881 case PSEUDO_DTOR_EXPR
:
16882 case VEC_PERM_EXPR
:
16884 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
16885 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
16886 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
16887 r
= build_nt (code
, op0
, op1
, op2
);
16888 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
16894 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
16895 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
16896 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
16897 r
= build_nt (code
, op0
, op1
, op2
);
16898 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
16904 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
16905 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
16906 r
= build_nt (code
, op0
, op1
);
16907 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
16908 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
16912 case TEMPLATE_ID_EXPR
:
16914 /* Substituted template arguments */
16915 tree fn
= TREE_OPERAND (t
, 0);
16916 tree targs
= TREE_OPERAND (t
, 1);
16918 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
16920 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
16922 return lookup_template_function (fn
, targs
);
16927 tree purpose
, value
, chain
;
16929 if (t
== void_list_node
)
16932 purpose
= TREE_PURPOSE (t
);
16934 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
16935 value
= TREE_VALUE (t
);
16937 value
= tsubst_copy (value
, args
, complain
, in_decl
);
16938 chain
= TREE_CHAIN (t
);
16939 if (chain
&& chain
!= void_type_node
)
16940 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
16941 if (purpose
== TREE_PURPOSE (t
)
16942 && value
== TREE_VALUE (t
)
16943 && chain
== TREE_CHAIN (t
))
16945 return tree_cons (purpose
, value
, chain
);
16950 case ENUMERAL_TYPE
:
16952 case TEMPLATE_TYPE_PARM
:
16953 case TEMPLATE_TEMPLATE_PARM
:
16954 case BOUND_TEMPLATE_TEMPLATE_PARM
:
16955 case TEMPLATE_PARM_INDEX
:
16957 case REFERENCE_TYPE
:
16959 case FUNCTION_TYPE
:
16962 case TYPENAME_TYPE
:
16963 case UNBOUND_CLASS_TEMPLATE
:
16965 case DECLTYPE_TYPE
:
16967 return tsubst (t
, args
, complain
, in_decl
);
16971 /* Fall through. */
16972 case IDENTIFIER_NODE
:
16973 if (IDENTIFIER_CONV_OP_P (t
))
16975 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16976 return make_conv_op_name (new_type
);
16982 /* This is handled by tsubst_copy_and_build. */
16983 gcc_unreachable ();
16987 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
16988 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16989 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
16992 case CLEANUP_POINT_EXPR
:
16993 /* We shouldn't have built any of these during initial template
16994 generation. Instead, they should be built during instantiation
16995 in response to the saved STMT_IS_FULL_EXPR_P setting. */
16996 gcc_unreachable ();
17000 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17001 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
17002 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
17003 r
= build2 (code
, type
, op0
, op1
);
17004 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
17005 if (!mark_used (TREE_OPERAND (r
, 1), complain
)
17006 && !(complain
& tf_error
))
17007 return error_mark_node
;
17011 case EXPR_PACK_EXPANSION
:
17012 error ("invalid use of pack expansion expression");
17013 return error_mark_node
;
17015 case NONTYPE_ARGUMENT_PACK
:
17016 error ("use %<...%> to expand argument pack");
17017 return error_mark_node
;
17020 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
17027 /* Instantiate any typedefs in the type. */
17028 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17029 r
= fold_convert (type
, t
);
17030 gcc_assert (TREE_CODE (r
) == code
);
17036 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17038 if (type
!= TREE_TYPE (t
))
17041 TREE_TYPE (r
) = type
;
17047 /* These can sometimes show up in a partial instantiation, but never
17048 involve template parms. */
17049 gcc_assert (!uses_template_parms (t
));
17052 case UNARY_LEFT_FOLD_EXPR
:
17053 return tsubst_unary_left_fold (t
, args
, complain
, in_decl
);
17054 case UNARY_RIGHT_FOLD_EXPR
:
17055 return tsubst_unary_right_fold (t
, args
, complain
, in_decl
);
17056 case BINARY_LEFT_FOLD_EXPR
:
17057 return tsubst_binary_left_fold (t
, args
, complain
, in_decl
);
17058 case BINARY_RIGHT_FOLD_EXPR
:
17059 return tsubst_binary_right_fold (t
, args
, complain
, in_decl
);
17063 case DEBUG_BEGIN_STMT
:
17064 /* ??? There's no point in copying it for now, but maybe some
17065 day it will contain more information, such as a pointer back
17066 to the containing function, inlined copy or so. */
17069 case CO_AWAIT_EXPR
:
17070 return tsubst_expr (t
, args
, complain
, in_decl
,
17071 /*integral_constant_expression_p=*/false);
17075 /* We shouldn't get here, but keep going if !flag_checking. */
17077 gcc_unreachable ();
17082 /* Helper function for tsubst_omp_clauses, used for instantiation of
17083 OMP_CLAUSE_DECL of clauses. */
17086 tsubst_omp_clause_decl (tree decl
, tree args
, tsubst_flags_t complain
,
17087 tree in_decl
, tree
*iterator_cache
)
17089 if (decl
== NULL_TREE
)
17092 /* Handle OpenMP iterators. */
17093 if (TREE_CODE (decl
) == TREE_LIST
17094 && TREE_PURPOSE (decl
)
17095 && TREE_CODE (TREE_PURPOSE (decl
)) == TREE_VEC
)
17098 if (iterator_cache
[0] == TREE_PURPOSE (decl
))
17099 ret
= iterator_cache
[1];
17103 begin_scope (sk_omp
, NULL
);
17104 for (tree it
= TREE_PURPOSE (decl
); it
; it
= TREE_CHAIN (it
))
17106 *tp
= copy_node (it
);
17107 TREE_VEC_ELT (*tp
, 0)
17108 = tsubst_decl (TREE_VEC_ELT (it
, 0), args
, complain
);
17109 TREE_VEC_ELT (*tp
, 1)
17110 = tsubst_expr (TREE_VEC_ELT (it
, 1), args
, complain
, in_decl
,
17111 /*integral_constant_expression_p=*/false);
17112 TREE_VEC_ELT (*tp
, 2)
17113 = tsubst_expr (TREE_VEC_ELT (it
, 2), args
, complain
, in_decl
,
17114 /*integral_constant_expression_p=*/false);
17115 TREE_VEC_ELT (*tp
, 3)
17116 = tsubst_expr (TREE_VEC_ELT (it
, 3), args
, complain
, in_decl
,
17117 /*integral_constant_expression_p=*/false);
17118 TREE_CHAIN (*tp
) = NULL_TREE
;
17119 tp
= &TREE_CHAIN (*tp
);
17121 TREE_VEC_ELT (ret
, 5) = poplevel (1, 1, 0);
17122 iterator_cache
[0] = TREE_PURPOSE (decl
);
17123 iterator_cache
[1] = ret
;
17125 return build_tree_list (ret
, tsubst_omp_clause_decl (TREE_VALUE (decl
),
17130 /* Handle an OpenMP array section represented as a TREE_LIST (or
17131 OMP_CLAUSE_DEPEND_KIND). An OMP_CLAUSE_DEPEND (with a depend
17132 kind of OMP_CLAUSE_DEPEND_SINK) can also be represented as a
17133 TREE_LIST. We can handle it exactly the same as an array section
17134 (purpose, value, and a chain), even though the nomenclature
17135 (low_bound, length, etc) is different. */
17136 if (TREE_CODE (decl
) == TREE_LIST
)
17139 = tsubst_expr (TREE_PURPOSE (decl
), args
, complain
, in_decl
,
17140 /*integral_constant_expression_p=*/false);
17141 tree length
= tsubst_expr (TREE_VALUE (decl
), args
, complain
, in_decl
,
17142 /*integral_constant_expression_p=*/false);
17143 tree chain
= tsubst_omp_clause_decl (TREE_CHAIN (decl
), args
, complain
,
17145 if (TREE_PURPOSE (decl
) == low_bound
17146 && TREE_VALUE (decl
) == length
17147 && TREE_CHAIN (decl
) == chain
)
17149 tree ret
= tree_cons (low_bound
, length
, chain
);
17150 OMP_CLAUSE_DEPEND_SINK_NEGATIVE (ret
)
17151 = OMP_CLAUSE_DEPEND_SINK_NEGATIVE (decl
);
17154 tree ret
= tsubst_expr (decl
, args
, complain
, in_decl
,
17155 /*integral_constant_expression_p=*/false);
17156 /* Undo convert_from_reference tsubst_expr could have called. */
17158 && REFERENCE_REF_P (ret
)
17159 && !REFERENCE_REF_P (decl
))
17160 ret
= TREE_OPERAND (ret
, 0);
17164 /* Like tsubst_copy, but specifically for OpenMP clauses. */
17167 tsubst_omp_clauses (tree clauses
, enum c_omp_region_type ort
,
17168 tree args
, tsubst_flags_t complain
, tree in_decl
)
17170 tree new_clauses
= NULL_TREE
, nc
, oc
;
17171 tree linear_no_step
= NULL_TREE
;
17172 tree iterator_cache
[2] = { NULL_TREE
, NULL_TREE
};
17174 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
17176 nc
= copy_node (oc
);
17177 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
17180 switch (OMP_CLAUSE_CODE (nc
))
17182 case OMP_CLAUSE_LASTPRIVATE
:
17183 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
17185 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
17186 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
17187 in_decl
, /*integral_constant_expression_p=*/false);
17188 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
17189 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
17192 case OMP_CLAUSE_PRIVATE
:
17193 case OMP_CLAUSE_SHARED
:
17194 case OMP_CLAUSE_FIRSTPRIVATE
:
17195 case OMP_CLAUSE_COPYIN
:
17196 case OMP_CLAUSE_COPYPRIVATE
:
17197 case OMP_CLAUSE_UNIFORM
:
17198 case OMP_CLAUSE_DEPEND
:
17199 case OMP_CLAUSE_FROM
:
17200 case OMP_CLAUSE_TO
:
17201 case OMP_CLAUSE_MAP
:
17202 case OMP_CLAUSE_NONTEMPORAL
:
17203 case OMP_CLAUSE_USE_DEVICE_PTR
:
17204 case OMP_CLAUSE_USE_DEVICE_ADDR
:
17205 case OMP_CLAUSE_IS_DEVICE_PTR
:
17206 case OMP_CLAUSE_INCLUSIVE
:
17207 case OMP_CLAUSE_EXCLUSIVE
:
17208 OMP_CLAUSE_DECL (nc
)
17209 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
17210 in_decl
, iterator_cache
);
17212 case OMP_CLAUSE_TILE
:
17213 case OMP_CLAUSE_IF
:
17214 case OMP_CLAUSE_NUM_THREADS
:
17215 case OMP_CLAUSE_SCHEDULE
:
17216 case OMP_CLAUSE_COLLAPSE
:
17217 case OMP_CLAUSE_FINAL
:
17218 case OMP_CLAUSE_DEVICE
:
17219 case OMP_CLAUSE_DIST_SCHEDULE
:
17220 case OMP_CLAUSE_NUM_TEAMS
:
17221 case OMP_CLAUSE_THREAD_LIMIT
:
17222 case OMP_CLAUSE_SAFELEN
:
17223 case OMP_CLAUSE_SIMDLEN
:
17224 case OMP_CLAUSE_NUM_TASKS
:
17225 case OMP_CLAUSE_GRAINSIZE
:
17226 case OMP_CLAUSE_PRIORITY
:
17227 case OMP_CLAUSE_ORDERED
:
17228 case OMP_CLAUSE_HINT
:
17229 case OMP_CLAUSE_NUM_GANGS
:
17230 case OMP_CLAUSE_NUM_WORKERS
:
17231 case OMP_CLAUSE_VECTOR_LENGTH
:
17232 case OMP_CLAUSE_WORKER
:
17233 case OMP_CLAUSE_VECTOR
:
17234 case OMP_CLAUSE_ASYNC
:
17235 case OMP_CLAUSE_WAIT
:
17236 OMP_CLAUSE_OPERAND (nc
, 0)
17237 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
17238 in_decl
, /*integral_constant_expression_p=*/false);
17240 case OMP_CLAUSE_REDUCTION
:
17241 case OMP_CLAUSE_IN_REDUCTION
:
17242 case OMP_CLAUSE_TASK_REDUCTION
:
17243 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
17245 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
17246 if (TREE_CODE (placeholder
) == SCOPE_REF
)
17248 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
17249 complain
, in_decl
);
17250 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
17251 = build_qualified_name (NULL_TREE
, scope
,
17252 TREE_OPERAND (placeholder
, 1),
17256 gcc_assert (identifier_p (placeholder
));
17258 OMP_CLAUSE_DECL (nc
)
17259 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
17262 case OMP_CLAUSE_GANG
:
17263 case OMP_CLAUSE_ALIGNED
:
17264 OMP_CLAUSE_DECL (nc
)
17265 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
17267 OMP_CLAUSE_OPERAND (nc
, 1)
17268 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
17269 in_decl
, /*integral_constant_expression_p=*/false);
17271 case OMP_CLAUSE_LINEAR
:
17272 OMP_CLAUSE_DECL (nc
)
17273 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
17275 if (OMP_CLAUSE_LINEAR_STEP (oc
) == NULL_TREE
)
17277 gcc_assert (!linear_no_step
);
17278 linear_no_step
= nc
;
17280 else if (OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (oc
))
17281 OMP_CLAUSE_LINEAR_STEP (nc
)
17282 = tsubst_omp_clause_decl (OMP_CLAUSE_LINEAR_STEP (oc
), args
,
17283 complain
, in_decl
, NULL
);
17285 OMP_CLAUSE_LINEAR_STEP (nc
)
17286 = tsubst_expr (OMP_CLAUSE_LINEAR_STEP (oc
), args
, complain
,
17288 /*integral_constant_expression_p=*/false);
17290 case OMP_CLAUSE_NOWAIT
:
17291 case OMP_CLAUSE_DEFAULT
:
17292 case OMP_CLAUSE_UNTIED
:
17293 case OMP_CLAUSE_MERGEABLE
:
17294 case OMP_CLAUSE_INBRANCH
:
17295 case OMP_CLAUSE_NOTINBRANCH
:
17296 case OMP_CLAUSE_PROC_BIND
:
17297 case OMP_CLAUSE_FOR
:
17298 case OMP_CLAUSE_PARALLEL
:
17299 case OMP_CLAUSE_SECTIONS
:
17300 case OMP_CLAUSE_TASKGROUP
:
17301 case OMP_CLAUSE_NOGROUP
:
17302 case OMP_CLAUSE_THREADS
:
17303 case OMP_CLAUSE_SIMD
:
17304 case OMP_CLAUSE_DEFAULTMAP
:
17305 case OMP_CLAUSE_ORDER
:
17306 case OMP_CLAUSE_BIND
:
17307 case OMP_CLAUSE_INDEPENDENT
:
17308 case OMP_CLAUSE_AUTO
:
17309 case OMP_CLAUSE_SEQ
:
17310 case OMP_CLAUSE_IF_PRESENT
:
17311 case OMP_CLAUSE_FINALIZE
:
17314 gcc_unreachable ();
17316 if ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
)
17317 switch (OMP_CLAUSE_CODE (nc
))
17319 case OMP_CLAUSE_SHARED
:
17320 case OMP_CLAUSE_PRIVATE
:
17321 case OMP_CLAUSE_FIRSTPRIVATE
:
17322 case OMP_CLAUSE_LASTPRIVATE
:
17323 case OMP_CLAUSE_COPYPRIVATE
:
17324 case OMP_CLAUSE_LINEAR
:
17325 case OMP_CLAUSE_REDUCTION
:
17326 case OMP_CLAUSE_IN_REDUCTION
:
17327 case OMP_CLAUSE_TASK_REDUCTION
:
17328 case OMP_CLAUSE_USE_DEVICE_PTR
:
17329 case OMP_CLAUSE_USE_DEVICE_ADDR
:
17330 case OMP_CLAUSE_IS_DEVICE_PTR
:
17331 case OMP_CLAUSE_INCLUSIVE
:
17332 case OMP_CLAUSE_EXCLUSIVE
:
17333 /* tsubst_expr on SCOPE_REF results in returning
17334 finish_non_static_data_member result. Undo that here. */
17335 if (TREE_CODE (OMP_CLAUSE_DECL (oc
)) == SCOPE_REF
17336 && (TREE_CODE (TREE_OPERAND (OMP_CLAUSE_DECL (oc
), 1))
17337 == IDENTIFIER_NODE
))
17339 tree t
= OMP_CLAUSE_DECL (nc
);
17342 switch (TREE_CODE (v
))
17344 case COMPONENT_REF
:
17348 case POINTER_PLUS_EXPR
:
17349 v
= TREE_OPERAND (v
, 0);
17352 if (DECL_CONTEXT (v
) == current_function_decl
17353 && DECL_ARTIFICIAL (v
)
17354 && DECL_NAME (v
) == this_identifier
)
17355 OMP_CLAUSE_DECL (nc
) = TREE_OPERAND (t
, 1);
17362 else if (VAR_P (OMP_CLAUSE_DECL (oc
))
17363 && DECL_HAS_VALUE_EXPR_P (OMP_CLAUSE_DECL (oc
))
17364 && DECL_ARTIFICIAL (OMP_CLAUSE_DECL (oc
))
17365 && DECL_LANG_SPECIFIC (OMP_CLAUSE_DECL (oc
))
17366 && DECL_OMP_PRIVATIZED_MEMBER (OMP_CLAUSE_DECL (oc
)))
17368 tree decl
= OMP_CLAUSE_DECL (nc
);
17371 retrofit_lang_decl (decl
);
17372 DECL_OMP_PRIVATIZED_MEMBER (decl
) = 1;
17381 new_clauses
= nreverse (new_clauses
);
17382 if (ort
!= C_ORT_OMP_DECLARE_SIMD
)
17384 new_clauses
= finish_omp_clauses (new_clauses
, ort
);
17385 if (linear_no_step
)
17386 for (nc
= new_clauses
; nc
; nc
= OMP_CLAUSE_CHAIN (nc
))
17387 if (nc
== linear_no_step
)
17389 OMP_CLAUSE_LINEAR_STEP (nc
) = NULL_TREE
;
17393 return new_clauses
;
17396 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
17399 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
17402 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
17404 tree purpose
, value
, chain
;
17409 if (TREE_CODE (t
) != TREE_LIST
)
17410 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
17411 /*function_p=*/false,
17412 /*integral_constant_expression_p=*/false);
17414 if (t
== void_list_node
)
17417 purpose
= TREE_PURPOSE (t
);
17419 purpose
= RECUR (purpose
);
17420 value
= TREE_VALUE (t
);
17423 if (TREE_CODE (value
) != LABEL_DECL
)
17424 value
= RECUR (value
);
17427 value
= lookup_label (DECL_NAME (value
));
17428 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
17429 TREE_USED (value
) = 1;
17432 chain
= TREE_CHAIN (t
);
17433 if (chain
&& chain
!= void_type_node
)
17434 chain
= RECUR (chain
);
17435 return tree_cons (purpose
, value
, chain
);
17439 /* Used to temporarily communicate the list of #pragma omp parallel
17440 clauses to #pragma omp for instantiation if they are combined
17443 static tree
*omp_parallel_combined_clauses
;
17445 static tree
tsubst_decomp_names (tree
, tree
, tree
, tsubst_flags_t
, tree
,
17446 tree
*, unsigned int *);
17448 /* Substitute one OMP_FOR iterator. */
17451 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree
&orig_declv
,
17452 tree initv
, tree condv
, tree incrv
, tree
*clauses
,
17453 tree args
, tsubst_flags_t complain
, tree in_decl
,
17454 bool integral_constant_expression_p
)
17456 #define RECUR(NODE) \
17457 tsubst_expr ((NODE), args, complain, in_decl, \
17458 integral_constant_expression_p)
17459 tree decl
, init
, cond
= NULL_TREE
, incr
= NULL_TREE
;
17462 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
17463 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
17465 decl
= TREE_OPERAND (init
, 0);
17466 init
= TREE_OPERAND (init
, 1);
17467 tree decl_expr
= NULL_TREE
;
17468 bool range_for
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
) == global_namespace
;
17471 bool decomp
= false;
17472 if (decl
!= error_mark_node
&& DECL_HAS_VALUE_EXPR_P (decl
))
17474 tree v
= DECL_VALUE_EXPR (decl
);
17475 if (TREE_CODE (v
) == ARRAY_REF
17476 && VAR_P (TREE_OPERAND (v
, 0))
17477 && DECL_DECOMPOSITION_P (TREE_OPERAND (v
, 0)))
17479 tree decomp_first
= NULL_TREE
;
17480 unsigned decomp_cnt
= 0;
17481 tree d
= tsubst_decl (TREE_OPERAND (v
, 0), args
, complain
);
17482 maybe_push_decl (d
);
17483 d
= tsubst_decomp_names (d
, TREE_OPERAND (v
, 0), args
, complain
,
17484 in_decl
, &decomp_first
, &decomp_cnt
);
17486 if (d
== error_mark_node
)
17487 decl
= error_mark_node
;
17489 for (unsigned int i
= 0; i
< decomp_cnt
; i
++)
17491 if (!DECL_HAS_VALUE_EXPR_P (decomp_first
))
17493 tree v
= build_nt (ARRAY_REF
, d
,
17494 size_int (decomp_cnt
- i
- 1),
17495 NULL_TREE
, NULL_TREE
);
17496 SET_DECL_VALUE_EXPR (decomp_first
, v
);
17497 DECL_HAS_VALUE_EXPR_P (decomp_first
) = 1;
17499 fit_decomposition_lang_decl (decomp_first
, d
);
17500 decomp_first
= DECL_CHAIN (decomp_first
);
17504 decl
= tsubst_decl (decl
, args
, complain
);
17506 maybe_push_decl (decl
);
17508 else if (init
&& TREE_CODE (init
) == DECL_EXPR
)
17510 /* We need to jump through some hoops to handle declarations in the
17511 init-statement, since we might need to handle auto deduction,
17512 but we need to keep control of initialization. */
17514 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
17515 decl
= tsubst_decl (decl
, args
, complain
);
17519 if (TREE_CODE (decl
) == SCOPE_REF
)
17521 decl
= RECUR (decl
);
17522 if (TREE_CODE (decl
) == COMPONENT_REF
)
17526 switch (TREE_CODE (v
))
17528 case COMPONENT_REF
:
17532 case POINTER_PLUS_EXPR
:
17533 v
= TREE_OPERAND (v
, 0);
17536 if (DECL_CONTEXT (v
) == current_function_decl
17537 && DECL_ARTIFICIAL (v
)
17538 && DECL_NAME (v
) == this_identifier
)
17540 decl
= TREE_OPERAND (decl
, 1);
17541 decl
= omp_privatize_field (decl
, false);
17551 decl
= RECUR (decl
);
17553 if (init
&& TREE_CODE (init
) == TREE_VEC
)
17555 init
= copy_node (init
);
17556 TREE_VEC_ELT (init
, 0)
17557 = tsubst_decl (TREE_VEC_ELT (init
, 0), args
, complain
);
17558 TREE_VEC_ELT (init
, 1) = RECUR (TREE_VEC_ELT (init
, 1));
17559 TREE_VEC_ELT (init
, 2) = RECUR (TREE_VEC_ELT (init
, 2));
17562 init
= RECUR (init
);
17564 if (orig_declv
&& OMP_FOR_ORIG_DECLS (t
))
17566 tree o
= TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (t
), i
);
17567 if (TREE_CODE (o
) == TREE_LIST
)
17568 TREE_VEC_ELT (orig_declv
, i
)
17569 = tree_cons (RECUR (TREE_PURPOSE (o
)),
17570 RECUR (TREE_VALUE (o
)),
17573 TREE_VEC_ELT (orig_declv
, i
) = RECUR (o
);
17578 tree this_pre_body
= NULL_TREE
;
17579 tree orig_init
= NULL_TREE
;
17580 tree orig_decl
= NULL_TREE
;
17581 cp_convert_omp_range_for (this_pre_body
, NULL
, decl
, orig_decl
, init
,
17582 orig_init
, cond
, incr
);
17585 if (orig_declv
== NULL_TREE
)
17586 orig_declv
= copy_node (declv
);
17587 TREE_VEC_ELT (orig_declv
, i
) = orig_decl
;
17590 else if (orig_declv
)
17591 TREE_VEC_ELT (orig_declv
, i
) = decl
;
17594 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
17595 if (!range_for
&& auto_node
&& init
)
17597 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
, complain
);
17599 gcc_assert (!type_dependent_expression_p (decl
));
17601 if (!CLASS_TYPE_P (TREE_TYPE (decl
)) || range_for
)
17605 /* Declare the variable, but don't let that initialize it. */
17606 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
17607 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
17609 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
17614 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
17615 if (COMPARISON_CLASS_P (cond
)
17616 && TREE_CODE (TREE_OPERAND (cond
, 1)) == TREE_VEC
)
17618 tree lhs
= RECUR (TREE_OPERAND (cond
, 0));
17619 tree rhs
= copy_node (TREE_OPERAND (cond
, 1));
17620 TREE_VEC_ELT (rhs
, 0)
17621 = tsubst_decl (TREE_VEC_ELT (rhs
, 0), args
, complain
);
17622 TREE_VEC_ELT (rhs
, 1) = RECUR (TREE_VEC_ELT (rhs
, 1));
17623 TREE_VEC_ELT (rhs
, 2) = RECUR (TREE_VEC_ELT (rhs
, 2));
17624 cond
= build2 (TREE_CODE (cond
), TREE_TYPE (cond
),
17628 cond
= RECUR (cond
);
17629 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
17630 if (TREE_CODE (incr
) == MODIFY_EXPR
)
17632 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
17633 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
17634 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
17635 NOP_EXPR
, rhs
, complain
);
17638 incr
= RECUR (incr
);
17639 if (orig_declv
&& !OMP_FOR_ORIG_DECLS (t
))
17640 TREE_VEC_ELT (orig_declv
, i
) = decl
;
17642 TREE_VEC_ELT (declv
, i
) = decl
;
17643 TREE_VEC_ELT (initv
, i
) = init
;
17644 TREE_VEC_ELT (condv
, i
) = cond
;
17645 TREE_VEC_ELT (incrv
, i
) = incr
;
17651 /* Declare and initialize the variable. */
17659 for (j
= ((omp_parallel_combined_clauses
== NULL
17660 || TREE_CODE (t
) == OMP_LOOP
) ? 1 : 0); j
< 2; j
++)
17662 for (pc
= j
? clauses
: omp_parallel_combined_clauses
; *pc
; )
17664 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_PRIVATE
17665 && OMP_CLAUSE_DECL (*pc
) == decl
)
17667 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_LASTPRIVATE
17668 && OMP_CLAUSE_DECL (*pc
) == decl
)
17672 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
17674 *pc
= OMP_CLAUSE_CHAIN (c
);
17675 OMP_CLAUSE_CHAIN (c
) = *clauses
;
17678 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_FIRSTPRIVATE
17679 && OMP_CLAUSE_DECL (*pc
) == decl
)
17681 error ("iteration variable %qD should not be firstprivate",
17683 *pc
= OMP_CLAUSE_CHAIN (*pc
);
17685 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_REDUCTION
17686 && OMP_CLAUSE_DECL (*pc
) == decl
)
17688 error ("iteration variable %qD should not be reduction",
17690 *pc
= OMP_CLAUSE_CHAIN (*pc
);
17693 pc
= &OMP_CLAUSE_CHAIN (*pc
);
17698 if (*pc
== NULL_TREE
)
17700 tree c
= build_omp_clause (input_location
,
17701 TREE_CODE (t
) == OMP_LOOP
17702 ? OMP_CLAUSE_LASTPRIVATE
17703 : OMP_CLAUSE_PRIVATE
);
17704 OMP_CLAUSE_DECL (c
) = decl
;
17705 c
= finish_omp_clauses (c
, C_ORT_OMP
);
17708 OMP_CLAUSE_CHAIN (c
) = *clauses
;
17713 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
17714 if (COMPARISON_CLASS_P (cond
))
17716 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
17717 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
17718 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
17721 cond
= RECUR (cond
);
17722 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
17723 switch (TREE_CODE (incr
))
17725 case PREINCREMENT_EXPR
:
17726 case PREDECREMENT_EXPR
:
17727 case POSTINCREMENT_EXPR
:
17728 case POSTDECREMENT_EXPR
:
17729 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
17730 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
17733 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
17734 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
17736 tree rhs
= TREE_OPERAND (incr
, 1);
17737 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
17738 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
17739 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
17740 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
17741 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
17745 incr
= RECUR (incr
);
17748 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
17749 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
17751 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
17752 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
17753 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
17754 TREE_TYPE (decl
), lhs
,
17755 RECUR (TREE_OPERAND (incr
, 2))));
17757 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
17758 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
17759 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
17761 tree rhs
= TREE_OPERAND (incr
, 2);
17762 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
17763 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
17764 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
17765 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
17766 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
17770 incr
= RECUR (incr
);
17773 incr
= RECUR (incr
);
17777 if (orig_declv
&& !OMP_FOR_ORIG_DECLS (t
))
17778 TREE_VEC_ELT (orig_declv
, i
) = decl
;
17779 TREE_VEC_ELT (declv
, i
) = decl
;
17780 TREE_VEC_ELT (initv
, i
) = init
;
17781 TREE_VEC_ELT (condv
, i
) = cond
;
17782 TREE_VEC_ELT (incrv
, i
) = incr
;
17787 /* Helper function of tsubst_expr, find OMP_TEAMS inside
17788 of OMP_TARGET's body. */
17791 tsubst_find_omp_teams (tree
*tp
, int *walk_subtrees
, void *)
17793 *walk_subtrees
= 0;
17794 switch (TREE_CODE (*tp
))
17799 case STATEMENT_LIST
:
17800 *walk_subtrees
= 1;
17808 /* Helper function for tsubst_expr. For decomposition declaration
17809 artificial base DECL, which is tsubsted PATTERN_DECL, tsubst
17810 also the corresponding decls representing the identifiers
17811 of the decomposition declaration. Return DECL if successful
17812 or error_mark_node otherwise, set *FIRST to the first decl
17813 in the list chained through DECL_CHAIN and *CNT to the number
17817 tsubst_decomp_names (tree decl
, tree pattern_decl
, tree args
,
17818 tsubst_flags_t complain
, tree in_decl
, tree
*first
,
17821 tree decl2
, decl3
, prev
= decl
;
17823 gcc_assert (DECL_NAME (decl
) == NULL_TREE
);
17824 for (decl2
= DECL_CHAIN (pattern_decl
);
17827 && DECL_DECOMPOSITION_P (decl2
)
17828 && DECL_NAME (decl2
);
17829 decl2
= DECL_CHAIN (decl2
))
17831 if (TREE_TYPE (decl2
) == error_mark_node
&& *cnt
== 0)
17833 gcc_assert (errorcount
);
17834 return error_mark_node
;
17837 gcc_assert (DECL_DECOMP_BASE (decl2
) == pattern_decl
);
17838 gcc_assert (DECL_HAS_VALUE_EXPR_P (decl2
));
17839 tree v
= DECL_VALUE_EXPR (decl2
);
17840 DECL_HAS_VALUE_EXPR_P (decl2
) = 0;
17841 SET_DECL_VALUE_EXPR (decl2
, NULL_TREE
);
17842 decl3
= tsubst (decl2
, args
, complain
, in_decl
);
17843 SET_DECL_VALUE_EXPR (decl2
, v
);
17844 DECL_HAS_VALUE_EXPR_P (decl2
) = 1;
17846 DECL_TEMPLATE_INSTANTIATED (decl3
) = 1;
17849 gcc_assert (errorcount
);
17850 decl
= error_mark_node
;
17853 maybe_push_decl (decl3
);
17854 if (error_operand_p (decl3
))
17855 decl
= error_mark_node
;
17856 else if (decl
!= error_mark_node
17857 && DECL_CHAIN (decl3
) != prev
17860 gcc_assert (errorcount
);
17861 decl
= error_mark_node
;
17870 /* Return the proper local_specialization for init-capture pack DECL. */
17873 lookup_init_capture_pack (tree decl
)
17875 /* We handle normal pack captures by forwarding to the specialization of the
17876 captured parameter. We can't do that for pack init-captures; we need them
17877 to have their own local_specialization. We created the individual
17878 VAR_DECLs (if any) under build_capture_proxy, and we need to collect them
17879 when we process the DECL_EXPR for the pack init-capture in the template.
17880 So, how do we find them? We don't know the capture proxy pack when
17881 building the individual resulting proxies, and we don't know the
17882 individual proxies when instantiating the pack. What we have in common is
17885 So...when we instantiate the FIELD_DECL, we stick the result in
17886 local_specializations. Then at the DECL_EXPR we look up that result, see
17887 how many elements it has, synthesize the names, and look them up. */
17889 tree cname
= DECL_NAME (decl
);
17890 tree val
= DECL_VALUE_EXPR (decl
);
17891 tree field
= TREE_OPERAND (val
, 1);
17892 gcc_assert (TREE_CODE (field
) == FIELD_DECL
);
17893 tree fpack
= retrieve_local_specialization (field
);
17894 if (fpack
== error_mark_node
)
17895 return error_mark_node
;
17898 tree vec
= NULL_TREE
;
17899 tree r
= NULL_TREE
;
17900 if (TREE_CODE (fpack
) == TREE_VEC
)
17902 len
= TREE_VEC_LENGTH (fpack
);
17903 vec
= make_tree_vec (len
);
17904 r
= make_node (NONTYPE_ARGUMENT_PACK
);
17905 SET_ARGUMENT_PACK_ARGS (r
, vec
);
17907 for (int i
= 0; i
< len
; ++i
)
17909 tree ename
= vec
? make_ith_pack_parameter_name (cname
, i
) : cname
;
17910 tree elt
= lookup_name (ename
);
17912 TREE_VEC_ELT (vec
, i
) = elt
;
17919 /* Like tsubst_copy for expressions, etc. but also does semantic
17923 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
17924 bool integral_constant_expression_p
)
17926 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
17927 #define RECUR(NODE) \
17928 tsubst_expr ((NODE), args, complain, in_decl, \
17929 integral_constant_expression_p)
17935 if (t
== NULL_TREE
|| t
== error_mark_node
)
17938 loc
= input_location
;
17939 if (location_t eloc
= cp_expr_location (t
))
17940 input_location
= eloc
;
17941 if (STATEMENT_CODE_P (TREE_CODE (t
)))
17942 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
17944 switch (TREE_CODE (t
))
17946 case STATEMENT_LIST
:
17948 tree_stmt_iterator i
;
17949 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
17950 RECUR (tsi_stmt (i
));
17954 case CTOR_INITIALIZER
:
17955 finish_mem_initializers (tsubst_initializer_list
17956 (TREE_OPERAND (t
, 0), args
));
17960 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
17963 case CO_RETURN_EXPR
:
17964 finish_co_return_stmt (input_location
, RECUR (TREE_OPERAND (t
, 0)));
17967 case CO_YIELD_EXPR
:
17968 stmt
= finish_co_yield_expr (input_location
,
17969 RECUR (TREE_OPERAND (t
, 0)));
17973 case CO_AWAIT_EXPR
:
17974 stmt
= finish_co_await_expr (input_location
,
17975 RECUR (TREE_OPERAND (t
, 0)));
17980 tmp
= RECUR (EXPR_STMT_EXPR (t
));
17981 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
17982 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
17984 finish_expr_stmt (tmp
);
17988 finish_using_directive (USING_STMT_NAMESPACE (t
), /*attribs=*/NULL_TREE
);
17993 tree decl
, pattern_decl
;
17996 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
17997 if (TREE_CODE (decl
) == LABEL_DECL
)
17998 finish_label_decl (DECL_NAME (decl
));
17999 else if (TREE_CODE (decl
) == USING_DECL
)
18001 tree scope
= USING_DECL_SCOPE (decl
);
18002 tree name
= DECL_NAME (decl
);
18004 scope
= tsubst (scope
, args
, complain
, in_decl
);
18005 finish_nonmember_using_decl (scope
, name
);
18007 else if (is_capture_proxy (decl
)
18008 && !DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
18010 /* We're in tsubst_lambda_expr, we've already inserted a new
18011 capture proxy, so look it up and register it. */
18013 if (!DECL_PACK_P (decl
))
18015 inst
= lookup_name (DECL_NAME (decl
), LOOK_where::BLOCK
,
18016 LOOK_want::HIDDEN_LAMBDA
);
18017 gcc_assert (inst
!= decl
&& is_capture_proxy (inst
));
18019 else if (is_normal_capture_proxy (decl
))
18021 inst
= (retrieve_local_specialization
18022 (DECL_CAPTURED_VARIABLE (decl
)));
18023 gcc_assert (TREE_CODE (inst
) == NONTYPE_ARGUMENT_PACK
18024 || DECL_PACK_P (inst
));
18027 inst
= lookup_init_capture_pack (decl
);
18029 register_local_specialization (inst
, decl
);
18032 else if (DECL_PRETTY_FUNCTION_P (decl
))
18033 decl
= make_fname_decl (DECL_SOURCE_LOCATION (decl
),
18035 true/*DECL_PRETTY_FUNCTION_P (decl)*/);
18036 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
18037 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
18038 /* Don't copy the old closure; we'll create a new one in
18039 tsubst_lambda_expr. */
18043 init
= DECL_INITIAL (decl
);
18044 decl
= tsubst (decl
, args
, complain
, in_decl
);
18045 if (decl
!= error_mark_node
)
18047 /* By marking the declaration as instantiated, we avoid
18048 trying to instantiate it. Since instantiate_decl can't
18049 handle local variables, and since we've already done
18050 all that needs to be done, that's the right thing to
18053 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
18054 if (VAR_P (decl
) && !DECL_NAME (decl
)
18055 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
18056 /* Anonymous aggregates are a special case. */
18057 finish_anon_union (decl
);
18058 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
18060 DECL_CONTEXT (decl
) = current_function_decl
;
18061 if (DECL_NAME (decl
) == this_identifier
)
18063 tree lam
= DECL_CONTEXT (current_function_decl
);
18064 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
18065 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
18067 insert_capture_proxy (decl
);
18069 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
18070 /* We already did a pushtag. */;
18071 else if (TREE_CODE (decl
) == FUNCTION_DECL
18072 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
18073 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
18075 /* We pretend this is regular local extern decl of
18076 a namespace-scope fn. Then we make it really
18077 local, it is a nested function. */
18078 gcc_checking_assert (DECL_LOCAL_DECL_P (decl
));
18079 DECL_CONTEXT (decl
) = global_namespace
;
18081 DECL_CONTEXT (decl
) = current_function_decl
;
18082 if (cp_check_omp_declare_reduction (decl
))
18083 instantiate_body (pattern_decl
, args
, decl
, true);
18087 bool const_init
= false;
18088 unsigned int cnt
= 0;
18089 tree first
= NULL_TREE
, ndecl
= error_mark_node
;
18090 maybe_push_decl (decl
);
18093 && DECL_DECOMPOSITION_P (decl
)
18094 && TREE_TYPE (pattern_decl
) != error_mark_node
)
18095 ndecl
= tsubst_decomp_names (decl
, pattern_decl
, args
,
18096 complain
, in_decl
, &first
,
18099 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
18102 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
18105 if (ndecl
!= error_mark_node
)
18106 cp_maybe_mangle_decomp (ndecl
, first
, cnt
);
18108 /* In a non-template function, VLA type declarations are
18109 handled in grokdeclarator; for templates, handle them
18111 predeclare_vla (decl
);
18113 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
18115 if (ndecl
!= error_mark_node
)
18116 cp_finish_decomp (ndecl
, first
, cnt
);
18125 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
18126 RECUR (FOR_INIT_STMT (t
));
18127 finish_init_stmt (stmt
);
18128 tmp
= RECUR (FOR_COND (t
));
18129 finish_for_cond (tmp
, stmt
, false, 0);
18130 tmp
= RECUR (FOR_EXPR (t
));
18131 finish_for_expr (tmp
, stmt
);
18133 bool prev
= note_iteration_stmt_body_start ();
18134 RECUR (FOR_BODY (t
));
18135 note_iteration_stmt_body_end (prev
);
18137 finish_for_stmt (stmt
);
18140 case RANGE_FOR_STMT
:
18142 /* Construct another range_for, if this is not a final
18143 substitution (for inside a generic lambda of a
18144 template). Otherwise convert to a regular for. */
18146 stmt
= (processing_template_decl
18147 ? begin_range_for_stmt (NULL_TREE
, NULL_TREE
)
18148 : begin_for_stmt (NULL_TREE
, NULL_TREE
));
18149 RECUR (RANGE_FOR_INIT_STMT (t
));
18150 decl
= RANGE_FOR_DECL (t
);
18151 decl
= tsubst (decl
, args
, complain
, in_decl
);
18152 maybe_push_decl (decl
);
18153 expr
= RECUR (RANGE_FOR_EXPR (t
));
18155 tree decomp_first
= NULL_TREE
;
18156 unsigned decomp_cnt
= 0;
18157 if (VAR_P (decl
) && DECL_DECOMPOSITION_P (decl
))
18158 decl
= tsubst_decomp_names (decl
, RANGE_FOR_DECL (t
), args
,
18160 &decomp_first
, &decomp_cnt
);
18162 if (processing_template_decl
)
18164 RANGE_FOR_IVDEP (stmt
) = RANGE_FOR_IVDEP (t
);
18165 RANGE_FOR_UNROLL (stmt
) = RANGE_FOR_UNROLL (t
);
18166 finish_range_for_decl (stmt
, decl
, expr
);
18167 if (decomp_first
&& decl
!= error_mark_node
)
18168 cp_finish_decomp (decl
, decomp_first
, decomp_cnt
);
18172 unsigned short unroll
= (RANGE_FOR_UNROLL (t
)
18173 ? tree_to_uhwi (RANGE_FOR_UNROLL (t
)) : 0);
18174 stmt
= cp_convert_range_for (stmt
, decl
, expr
,
18175 decomp_first
, decomp_cnt
,
18176 RANGE_FOR_IVDEP (t
), unroll
);
18179 bool prev
= note_iteration_stmt_body_start ();
18180 RECUR (RANGE_FOR_BODY (t
));
18181 note_iteration_stmt_body_end (prev
);
18182 finish_for_stmt (stmt
);
18187 stmt
= begin_while_stmt ();
18188 tmp
= RECUR (WHILE_COND (t
));
18189 finish_while_stmt_cond (tmp
, stmt
, false, 0);
18191 bool prev
= note_iteration_stmt_body_start ();
18192 RECUR (WHILE_BODY (t
));
18193 note_iteration_stmt_body_end (prev
);
18195 finish_while_stmt (stmt
);
18199 stmt
= begin_do_stmt ();
18201 bool prev
= note_iteration_stmt_body_start ();
18202 RECUR (DO_BODY (t
));
18203 note_iteration_stmt_body_end (prev
);
18205 finish_do_body (stmt
);
18206 tmp
= RECUR (DO_COND (t
));
18207 finish_do_stmt (tmp
, stmt
, false, 0);
18211 stmt
= begin_if_stmt ();
18212 IF_STMT_CONSTEXPR_P (stmt
) = IF_STMT_CONSTEXPR_P (t
);
18213 if (IF_STMT_CONSTEXPR_P (t
))
18214 args
= add_extra_args (IF_STMT_EXTRA_ARGS (t
), args
);
18215 tmp
= RECUR (IF_COND (t
));
18216 tmp
= finish_if_stmt_cond (tmp
, stmt
);
18217 if (IF_STMT_CONSTEXPR_P (t
)
18218 && instantiation_dependent_expression_p (tmp
))
18220 /* We're partially instantiating a generic lambda, but the condition
18221 of the constexpr if is still dependent. Don't substitute into the
18222 branches now, just remember the template arguments. */
18223 do_poplevel (IF_SCOPE (stmt
));
18224 IF_COND (stmt
) = IF_COND (t
);
18225 THEN_CLAUSE (stmt
) = THEN_CLAUSE (t
);
18226 ELSE_CLAUSE (stmt
) = ELSE_CLAUSE (t
);
18227 IF_STMT_EXTRA_ARGS (stmt
) = build_extra_args (t
, args
, complain
);
18231 if (IF_STMT_CONSTEXPR_P (t
) && integer_zerop (tmp
))
18232 /* Don't instantiate the THEN_CLAUSE. */;
18235 tree folded
= fold_non_dependent_expr (tmp
, complain
);
18236 bool inhibit
= integer_zerop (folded
);
18238 ++c_inhibit_evaluation_warnings
;
18239 RECUR (THEN_CLAUSE (t
));
18241 --c_inhibit_evaluation_warnings
;
18243 finish_then_clause (stmt
);
18245 if (IF_STMT_CONSTEXPR_P (t
) && integer_nonzerop (tmp
))
18246 /* Don't instantiate the ELSE_CLAUSE. */;
18247 else if (ELSE_CLAUSE (t
))
18249 tree folded
= fold_non_dependent_expr (tmp
, complain
);
18250 bool inhibit
= integer_nonzerop (folded
);
18251 begin_else_clause (stmt
);
18253 ++c_inhibit_evaluation_warnings
;
18254 RECUR (ELSE_CLAUSE (t
));
18256 --c_inhibit_evaluation_warnings
;
18257 finish_else_clause (stmt
);
18260 finish_if_stmt (stmt
);
18264 if (BIND_EXPR_BODY_BLOCK (t
))
18265 stmt
= begin_function_body ();
18267 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
18268 ? BCS_TRY_BLOCK
: 0);
18270 RECUR (BIND_EXPR_BODY (t
));
18272 if (BIND_EXPR_BODY_BLOCK (t
))
18273 finish_function_body (stmt
);
18275 finish_compound_stmt (stmt
);
18279 finish_break_stmt ();
18282 case CONTINUE_STMT
:
18283 finish_continue_stmt ();
18287 stmt
= begin_switch_stmt ();
18288 tmp
= RECUR (SWITCH_STMT_COND (t
));
18289 finish_switch_cond (tmp
, stmt
);
18290 RECUR (SWITCH_STMT_BODY (t
));
18291 finish_switch_stmt (stmt
);
18294 case CASE_LABEL_EXPR
:
18296 tree decl
= CASE_LABEL (t
);
18297 tree low
= RECUR (CASE_LOW (t
));
18298 tree high
= RECUR (CASE_HIGH (t
));
18299 tree l
= finish_case_label (EXPR_LOCATION (t
), low
, high
);
18300 if (l
&& TREE_CODE (l
) == CASE_LABEL_EXPR
)
18302 tree label
= CASE_LABEL (l
);
18303 FALLTHROUGH_LABEL_P (label
) = FALLTHROUGH_LABEL_P (decl
);
18304 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
18305 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
18312 tree decl
= LABEL_EXPR_LABEL (t
);
18315 label
= finish_label_stmt (DECL_NAME (decl
));
18316 if (TREE_CODE (label
) == LABEL_DECL
)
18317 FALLTHROUGH_LABEL_P (label
) = FALLTHROUGH_LABEL_P (decl
);
18318 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
18319 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
18324 tmp
= GOTO_DESTINATION (t
);
18325 if (TREE_CODE (tmp
) != LABEL_DECL
)
18326 /* Computed goto's must be tsubst'd into. On the other hand,
18327 non-computed gotos must not be; the identifier in question
18328 will have no binding. */
18331 tmp
= DECL_NAME (tmp
);
18332 finish_goto_stmt (tmp
);
18337 tree string
= RECUR (ASM_STRING (t
));
18338 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
18339 complain
, in_decl
);
18340 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
18341 complain
, in_decl
);
18342 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
18343 complain
, in_decl
);
18344 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
18345 complain
, in_decl
);
18346 tmp
= finish_asm_stmt (EXPR_LOCATION (t
), ASM_VOLATILE_P (t
), string
,
18347 outputs
, inputs
, clobbers
, labels
,
18349 tree asm_expr
= tmp
;
18350 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
18351 asm_expr
= TREE_OPERAND (asm_expr
, 0);
18352 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
18359 stmt
= begin_try_block ();
18360 RECUR (TRY_STMTS (t
));
18361 finish_cleanup_try_block (stmt
);
18362 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
18366 tree compound_stmt
= NULL_TREE
;
18368 if (FN_TRY_BLOCK_P (t
))
18369 stmt
= begin_function_try_block (&compound_stmt
);
18371 stmt
= begin_try_block ();
18373 RECUR (TRY_STMTS (t
));
18375 if (FN_TRY_BLOCK_P (t
))
18376 finish_function_try_block (stmt
);
18378 finish_try_block (stmt
);
18380 RECUR (TRY_HANDLERS (t
));
18381 if (FN_TRY_BLOCK_P (t
))
18382 finish_function_handler_sequence (stmt
, compound_stmt
);
18384 finish_handler_sequence (stmt
);
18390 tree decl
= HANDLER_PARMS (t
);
18394 decl
= tsubst (decl
, args
, complain
, in_decl
);
18395 /* Prevent instantiate_decl from trying to instantiate
18396 this variable. We've already done all that needs to be
18398 if (decl
!= error_mark_node
)
18399 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
18401 stmt
= begin_handler ();
18402 finish_handler_parms (decl
, stmt
);
18403 RECUR (HANDLER_BODY (t
));
18404 finish_handler (stmt
);
18409 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
18410 if (CLASS_TYPE_P (tmp
))
18412 /* Local classes are not independent templates; they are
18413 instantiated along with their containing function. And this
18414 way we don't have to deal with pushing out of one local class
18415 to instantiate a member of another local class. */
18416 /* Closures are handled by the LAMBDA_EXPR. */
18417 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
18418 complete_type (tmp
);
18419 for (tree fld
= TYPE_FIELDS (tmp
); fld
; fld
= DECL_CHAIN (fld
))
18421 || (TREE_CODE (fld
) == FUNCTION_DECL
18422 && !DECL_ARTIFICIAL (fld
)))
18423 && DECL_TEMPLATE_INSTANTIATION (fld
))
18424 instantiate_decl (fld
, /*defer_ok=*/false,
18425 /*expl_inst_class=*/false);
18429 case STATIC_ASSERT
:
18433 ++c_inhibit_evaluation_warnings
;
18435 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
18438 /*integral_constant_expression_p=*/true);
18439 --c_inhibit_evaluation_warnings
;
18441 finish_static_assert (condition
,
18442 STATIC_ASSERT_MESSAGE (t
),
18443 STATIC_ASSERT_SOURCE_LOCATION (t
),
18444 /*member_p=*/false);
18449 case OACC_PARALLEL
:
18451 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), C_ORT_ACC
, args
, complain
,
18453 stmt
= begin_omp_parallel ();
18454 RECUR (OMP_BODY (t
));
18455 finish_omp_construct (TREE_CODE (t
), stmt
, tmp
);
18459 r
= push_omp_privatization_clauses (OMP_PARALLEL_COMBINED (t
));
18460 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), C_ORT_OMP
, args
,
18461 complain
, in_decl
);
18462 if (OMP_PARALLEL_COMBINED (t
))
18463 omp_parallel_combined_clauses
= &tmp
;
18464 stmt
= begin_omp_parallel ();
18465 RECUR (OMP_PARALLEL_BODY (t
));
18466 gcc_assert (omp_parallel_combined_clauses
== NULL
);
18467 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
18468 = OMP_PARALLEL_COMBINED (t
);
18469 pop_omp_privatization_clauses (r
);
18473 if (OMP_TASK_BODY (t
) == NULL_TREE
)
18475 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), C_ORT_OMP
, args
,
18476 complain
, in_decl
);
18478 OMP_TASK_CLAUSES (t
) = tmp
;
18482 r
= push_omp_privatization_clauses (false);
18483 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), C_ORT_OMP
, args
,
18484 complain
, in_decl
);
18485 stmt
= begin_omp_task ();
18486 RECUR (OMP_TASK_BODY (t
));
18487 finish_omp_task (tmp
, stmt
);
18488 pop_omp_privatization_clauses (r
);
18494 case OMP_DISTRIBUTE
:
18498 tree clauses
, body
, pre_body
;
18499 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
18500 tree orig_declv
= NULL_TREE
;
18501 tree incrv
= NULL_TREE
;
18502 enum c_omp_region_type ort
= C_ORT_OMP
;
18503 bool any_range_for
= false;
18506 if (TREE_CODE (t
) == OACC_LOOP
)
18509 r
= push_omp_privatization_clauses (OMP_FOR_INIT (t
) == NULL_TREE
);
18510 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), ort
, args
, complain
,
18512 if (OMP_FOR_INIT (t
) != NULL_TREE
)
18514 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
18515 if (OMP_FOR_ORIG_DECLS (t
))
18516 orig_declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
18517 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
18518 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
18519 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
18522 keep_next_level (true);
18523 stmt
= begin_omp_structured_block ();
18525 pre_body
= push_stmt_list ();
18526 RECUR (OMP_FOR_PRE_BODY (t
));
18527 pre_body
= pop_stmt_list (pre_body
);
18529 if (OMP_FOR_INIT (t
) != NULL_TREE
)
18530 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
18532 |= tsubst_omp_for_iterator (t
, i
, declv
, orig_declv
, initv
,
18533 condv
, incrv
, &clauses
, args
,
18535 integral_constant_expression_p
);
18536 omp_parallel_combined_clauses
= NULL
;
18540 gcc_assert (orig_declv
);
18541 body
= begin_omp_structured_block ();
18542 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
18543 if (TREE_VEC_ELT (orig_declv
, i
) != TREE_VEC_ELT (declv
, i
)
18544 && TREE_CODE (TREE_VEC_ELT (orig_declv
, i
)) == TREE_LIST
18545 && TREE_CHAIN (TREE_VEC_ELT (orig_declv
, i
)))
18546 cp_finish_omp_range_for (TREE_VEC_ELT (orig_declv
, i
),
18547 TREE_VEC_ELT (declv
, i
));
18550 body
= push_stmt_list ();
18551 RECUR (OMP_FOR_BODY (t
));
18553 body
= finish_omp_structured_block (body
);
18555 body
= pop_stmt_list (body
);
18557 if (OMP_FOR_INIT (t
) != NULL_TREE
)
18558 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
,
18559 orig_declv
, initv
, condv
, incrv
, body
, pre_body
,
18563 t
= make_node (TREE_CODE (t
));
18564 TREE_TYPE (t
) = void_type_node
;
18565 OMP_FOR_BODY (t
) = body
;
18566 OMP_FOR_PRE_BODY (t
) = pre_body
;
18567 OMP_FOR_CLAUSES (t
) = clauses
;
18568 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
18572 add_stmt (finish_omp_for_block (finish_omp_structured_block (stmt
),
18574 pop_omp_privatization_clauses (r
);
18579 omp_parallel_combined_clauses
= NULL
;
18584 case OMP_TASKGROUP
:
18586 r
= push_omp_privatization_clauses (TREE_CODE (t
) == OMP_TEAMS
18587 && OMP_TEAMS_COMBINED (t
));
18588 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), C_ORT_OMP
, args
, complain
,
18590 if (TREE_CODE (t
) == OMP_TEAMS
)
18592 keep_next_level (true);
18593 stmt
= begin_omp_structured_block ();
18594 RECUR (OMP_BODY (t
));
18595 stmt
= finish_omp_structured_block (stmt
);
18599 stmt
= push_stmt_list ();
18600 RECUR (OMP_BODY (t
));
18601 stmt
= pop_stmt_list (stmt
);
18604 if (TREE_CODE (t
) == OMP_CRITICAL
18605 && tmp
!= NULL_TREE
18606 && integer_nonzerop (OMP_CLAUSE_HINT_EXPR (tmp
)))
18608 error_at (OMP_CLAUSE_LOCATION (tmp
),
18609 "%<#pragma omp critical%> with %<hint%> clause requires "
18610 "a name, except when %<omp_sync_hint_none%> is used");
18611 RETURN (error_mark_node
);
18614 OMP_BODY (t
) = stmt
;
18615 OMP_CLAUSES (t
) = tmp
;
18617 pop_omp_privatization_clauses (r
);
18621 r
= RECUR (OMP_DEPOBJ_DEPOBJ (t
));
18622 if (OMP_DEPOBJ_CLAUSES (t
) && OMP_DEPOBJ_CLAUSES (t
) != error_mark_node
)
18624 enum omp_clause_depend_kind kind
= OMP_CLAUSE_DEPEND_SOURCE
;
18625 if (TREE_CODE (OMP_DEPOBJ_CLAUSES (t
)) == OMP_CLAUSE
)
18627 tmp
= tsubst_omp_clauses (OMP_DEPOBJ_CLAUSES (t
), C_ORT_OMP
,
18628 args
, complain
, in_decl
);
18629 if (tmp
== NULL_TREE
)
18630 tmp
= error_mark_node
;
18634 kind
= (enum omp_clause_depend_kind
)
18635 tree_to_uhwi (OMP_DEPOBJ_CLAUSES (t
));
18638 finish_omp_depobj (EXPR_LOCATION (t
), r
, kind
, tmp
);
18641 finish_omp_depobj (EXPR_LOCATION (t
), r
,
18642 OMP_CLAUSE_DEPEND_SOURCE
,
18643 OMP_DEPOBJ_CLAUSES (t
));
18647 case OMP_TARGET_DATA
:
18649 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), (TREE_CODE (t
) == OACC_DATA
)
18650 ? C_ORT_ACC
: C_ORT_OMP
, args
, complain
,
18652 keep_next_level (true);
18653 stmt
= begin_omp_structured_block ();
18655 RECUR (OMP_BODY (t
));
18656 stmt
= finish_omp_structured_block (stmt
);
18659 OMP_BODY (t
) = stmt
;
18660 OMP_CLAUSES (t
) = tmp
;
18661 if (TREE_CODE (t
) == OMP_TARGET
&& OMP_TARGET_COMBINED (t
))
18663 tree teams
= cp_walk_tree (&stmt
, tsubst_find_omp_teams
, NULL
, NULL
);
18666 /* For combined target teams, ensure the num_teams and
18667 thread_limit clause expressions are evaluated on the host,
18668 before entering the target construct. */
18670 for (c
= OMP_TEAMS_CLAUSES (teams
);
18671 c
; c
= OMP_CLAUSE_CHAIN (c
))
18672 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_NUM_TEAMS
18673 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_THREAD_LIMIT
)
18674 && TREE_CODE (OMP_CLAUSE_OPERAND (c
, 0)) != INTEGER_CST
)
18676 tree expr
= OMP_CLAUSE_OPERAND (c
, 0);
18677 expr
= force_target_expr (TREE_TYPE (expr
), expr
, tf_none
);
18678 if (expr
== error_mark_node
)
18680 tmp
= TARGET_EXPR_SLOT (expr
);
18682 OMP_CLAUSE_OPERAND (c
, 0) = expr
;
18683 tree tc
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
18684 OMP_CLAUSE_FIRSTPRIVATE
);
18685 OMP_CLAUSE_DECL (tc
) = tmp
;
18686 OMP_CLAUSE_CHAIN (tc
) = OMP_TARGET_CLAUSES (t
);
18687 OMP_TARGET_CLAUSES (t
) = tc
;
18696 tmp
= tsubst_omp_clauses (OACC_DECLARE_CLAUSES (t
), C_ORT_ACC
, args
,
18697 complain
, in_decl
);
18698 OACC_DECLARE_CLAUSES (t
) = tmp
;
18702 case OMP_TARGET_UPDATE
:
18703 case OMP_TARGET_ENTER_DATA
:
18704 case OMP_TARGET_EXIT_DATA
:
18705 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), C_ORT_OMP
, args
,
18706 complain
, in_decl
);
18708 OMP_STANDALONE_CLAUSES (t
) = tmp
;
18712 case OACC_ENTER_DATA
:
18713 case OACC_EXIT_DATA
:
18715 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), C_ORT_ACC
, args
,
18716 complain
, in_decl
);
18718 OMP_STANDALONE_CLAUSES (t
) = tmp
;
18723 tmp
= tsubst_omp_clauses (OMP_ORDERED_CLAUSES (t
), C_ORT_OMP
, args
,
18724 complain
, in_decl
);
18725 stmt
= push_stmt_list ();
18726 RECUR (OMP_BODY (t
));
18727 stmt
= pop_stmt_list (stmt
);
18730 OMP_BODY (t
) = stmt
;
18731 OMP_ORDERED_CLAUSES (t
) = tmp
;
18736 omp_parallel_combined_clauses
= NULL
;
18739 stmt
= push_stmt_list ();
18740 RECUR (OMP_BODY (t
));
18741 stmt
= pop_stmt_list (stmt
);
18744 OMP_BODY (t
) = stmt
;
18749 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
18751 if (TREE_CODE (TREE_OPERAND (t
, 0)) == OMP_CLAUSE
)
18752 tmp
= tsubst_omp_clauses (TREE_OPERAND (t
, 0), C_ORT_OMP
, args
,
18753 complain
, in_decl
);
18754 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
18756 tree op1
= TREE_OPERAND (t
, 1);
18757 tree rhs1
= NULL_TREE
;
18759 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
18761 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
18762 op1
= TREE_OPERAND (op1
, 1);
18764 lhs
= RECUR (TREE_OPERAND (op1
, 0));
18765 rhs
= RECUR (TREE_OPERAND (op1
, 1));
18766 finish_omp_atomic (EXPR_LOCATION (t
), OMP_ATOMIC
, TREE_CODE (op1
),
18767 lhs
, rhs
, NULL_TREE
, NULL_TREE
, rhs1
, tmp
,
18768 OMP_ATOMIC_MEMORY_ORDER (t
));
18772 tree op1
= TREE_OPERAND (t
, 1);
18773 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
18774 tree rhs1
= NULL_TREE
;
18775 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
18776 enum tree_code opcode
= NOP_EXPR
;
18777 if (code
== OMP_ATOMIC_READ
)
18779 v
= RECUR (TREE_OPERAND (op1
, 0));
18780 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
18782 else if (code
== OMP_ATOMIC_CAPTURE_OLD
18783 || code
== OMP_ATOMIC_CAPTURE_NEW
)
18785 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
18786 v
= RECUR (TREE_OPERAND (op1
, 0));
18787 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
18788 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
18790 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
18791 op11
= TREE_OPERAND (op11
, 1);
18793 lhs
= RECUR (TREE_OPERAND (op11
, 0));
18794 rhs
= RECUR (TREE_OPERAND (op11
, 1));
18795 opcode
= TREE_CODE (op11
);
18796 if (opcode
== MODIFY_EXPR
)
18802 lhs
= RECUR (TREE_OPERAND (op1
, 0));
18803 rhs
= RECUR (TREE_OPERAND (op1
, 1));
18805 finish_omp_atomic (EXPR_LOCATION (t
), code
, opcode
, lhs
, rhs
, v
,
18806 lhs1
, rhs1
, tmp
, OMP_ATOMIC_MEMORY_ORDER (t
));
18810 case TRANSACTION_EXPR
:
18813 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
18814 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
18816 if (TRANSACTION_EXPR_IS_STMT (t
))
18818 tree body
= TRANSACTION_EXPR_BODY (t
);
18819 tree noex
= NULL_TREE
;
18820 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
18822 noex
= MUST_NOT_THROW_COND (body
);
18823 if (noex
== NULL_TREE
)
18824 noex
= boolean_true_node
;
18825 body
= TREE_OPERAND (body
, 0);
18827 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
18829 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
18833 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
18834 RECUR (TRANSACTION_EXPR_BODY (t
)),
18841 case MUST_NOT_THROW_EXPR
:
18843 tree op0
= RECUR (TREE_OPERAND (t
, 0));
18844 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
18845 RETURN (build_must_not_throw_expr (op0
, cond
));
18848 case EXPR_PACK_EXPANSION
:
18849 error ("invalid use of pack expansion expression");
18850 RETURN (error_mark_node
);
18852 case NONTYPE_ARGUMENT_PACK
:
18853 error ("use %<...%> to expand argument pack");
18854 RETURN (error_mark_node
);
18856 case COMPOUND_EXPR
:
18857 tmp
= RECUR (TREE_OPERAND (t
, 0));
18858 if (tmp
== NULL_TREE
)
18859 /* If the first operand was a statement, we're done with it. */
18860 RETURN (RECUR (TREE_OPERAND (t
, 1)));
18861 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
18862 RECUR (TREE_OPERAND (t
, 1)),
18865 case ANNOTATE_EXPR
:
18866 tmp
= RECUR (TREE_OPERAND (t
, 0));
18867 RETURN (build3_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
18868 TREE_TYPE (tmp
), tmp
,
18869 RECUR (TREE_OPERAND (t
, 1)),
18870 RECUR (TREE_OPERAND (t
, 2))));
18873 RETURN (add_stmt (copy_node (t
)));
18876 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
18878 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
18879 /*function_p=*/false,
18880 integral_constant_expression_p
));
18883 RETURN (NULL_TREE
);
18885 input_location
= loc
;
18891 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
18892 function. For description of the body see comment above
18893 cp_parser_omp_declare_reduction_exprs. */
18896 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
18898 if (t
== NULL_TREE
|| t
== error_mark_node
)
18901 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
&& current_function_decl
);
18903 tree_stmt_iterator tsi
;
18906 memset (stmts
, 0, sizeof stmts
);
18907 for (i
= 0, tsi
= tsi_start (t
);
18908 i
< 7 && !tsi_end_p (tsi
);
18909 i
++, tsi_next (&tsi
))
18910 stmts
[i
] = tsi_stmt (tsi
);
18911 gcc_assert (tsi_end_p (tsi
));
18915 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
18916 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
18917 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
18918 args
, complain
, in_decl
);
18919 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
18920 args
, complain
, in_decl
);
18921 /* tsubsting a local var_decl leaves DECL_CONTEXT null, as we
18922 expect to be pushing it. */
18923 DECL_CONTEXT (omp_out
) = current_function_decl
;
18924 DECL_CONTEXT (omp_in
) = current_function_decl
;
18925 keep_next_level (true);
18926 tree block
= begin_omp_structured_block ();
18927 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
18928 block
= finish_omp_structured_block (block
);
18929 block
= maybe_cleanup_point_expr_void (block
);
18930 add_decl_expr (omp_out
);
18931 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
18932 TREE_NO_WARNING (omp_out
) = 1;
18933 add_decl_expr (omp_in
);
18934 finish_expr_stmt (block
);
18938 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
18939 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
18940 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
18941 args
, complain
, in_decl
);
18942 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
18943 args
, complain
, in_decl
);
18944 DECL_CONTEXT (omp_priv
) = current_function_decl
;
18945 DECL_CONTEXT (omp_orig
) = current_function_decl
;
18946 keep_next_level (true);
18947 tree block
= begin_omp_structured_block ();
18948 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
18949 block
= finish_omp_structured_block (block
);
18950 block
= maybe_cleanup_point_expr_void (block
);
18951 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
18952 add_decl_expr (omp_priv
);
18953 add_decl_expr (omp_orig
);
18954 finish_expr_stmt (block
);
18956 add_decl_expr (omp_orig
);
18960 /* T is a postfix-expression that is not being used in a function
18961 call. Return the substituted version of T. */
18964 tsubst_non_call_postfix_expression (tree t
, tree args
,
18965 tsubst_flags_t complain
,
18968 if (TREE_CODE (t
) == SCOPE_REF
)
18969 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
18970 /*done=*/false, /*address_p=*/false);
18972 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
18973 /*function_p=*/false,
18974 /*integral_constant_expression_p=*/false);
18979 /* Subroutine of tsubst_lambda_expr: add the FIELD/INIT capture pair to the
18980 LAMBDA_EXPR_CAPTURE_LIST passed in LIST. Do deduction for a previously
18981 dependent init-capture. */
18984 prepend_one_capture (tree field
, tree init
, tree
&list
,
18985 tsubst_flags_t complain
)
18987 if (tree auto_node
= type_uses_auto (TREE_TYPE (field
)))
18989 tree type
= NULL_TREE
;
18992 if (complain
& tf_error
)
18993 error ("empty initializer in lambda init-capture");
18994 init
= error_mark_node
;
18996 else if (TREE_CODE (init
) == TREE_LIST
)
18997 init
= build_x_compound_expr_from_list (init
, ELK_INIT
, complain
);
18999 type
= do_auto_deduction (TREE_TYPE (field
), init
, auto_node
, complain
);
19000 TREE_TYPE (field
) = type
;
19001 cp_apply_type_quals_to_decl (cp_type_quals (type
), field
);
19003 list
= tree_cons (field
, init
, list
);
19006 /* T is a LAMBDA_EXPR. Generate a new LAMBDA_EXPR for the current
19007 instantiation context. Instantiating a pack expansion containing a lambda
19008 might result in multiple lambdas all based on the same lambda in the
19012 tsubst_lambda_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
19014 tree oldfn
= lambda_function (t
);
19017 tree r
= build_lambda_expr ();
19019 LAMBDA_EXPR_LOCATION (r
)
19020 = LAMBDA_EXPR_LOCATION (t
);
19021 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
19022 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
19023 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
19024 LAMBDA_EXPR_INSTANTIATED (r
) = true;
19026 if (LAMBDA_EXPR_EXTRA_SCOPE (t
) == NULL_TREE
)
19027 /* A lambda in a default argument outside a class gets no
19028 LAMBDA_EXPR_EXTRA_SCOPE, as specified by the ABI. But
19029 tsubst_default_argument calls start_lambda_scope, so we need to
19030 specifically ignore it here, and use the global scope. */
19031 record_null_lambda_scope (r
);
19033 record_lambda_scope (r
);
19035 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
19036 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
19038 vec
<tree
,va_gc
>* field_packs
= NULL
;
19040 for (tree cap
= LAMBDA_EXPR_CAPTURE_LIST (t
); cap
;
19041 cap
= TREE_CHAIN (cap
))
19043 tree ofield
= TREE_PURPOSE (cap
);
19044 tree init
= TREE_VALUE (cap
);
19045 if (PACK_EXPANSION_P (init
))
19046 init
= tsubst_pack_expansion (init
, args
, complain
, in_decl
);
19048 init
= tsubst_copy_and_build (init
, args
, complain
, in_decl
,
19049 /*fn*/false, /*constexpr*/false);
19051 if (init
== error_mark_node
)
19052 return error_mark_node
;
19054 if (init
&& TREE_CODE (init
) == TREE_LIST
)
19055 init
= build_x_compound_expr_from_list (init
, ELK_INIT
, complain
);
19057 if (!processing_template_decl
19058 && init
&& TREE_CODE (init
) != TREE_VEC
19059 && variably_modified_type_p (TREE_TYPE (init
), NULL_TREE
))
19061 /* For a VLA, simply tsubsting the field type won't work, we need to
19062 go through add_capture again. XXX do we want to do this for all
19064 tree name
= (get_identifier
19065 (IDENTIFIER_POINTER (DECL_NAME (ofield
)) + 2));
19066 tree ftype
= TREE_TYPE (ofield
);
19067 bool by_ref
= (TYPE_REF_P (ftype
)
19068 || (TREE_CODE (ftype
) == DECLTYPE_TYPE
19069 && DECLTYPE_FOR_REF_CAPTURE (ftype
)));
19070 add_capture (r
, name
, init
, by_ref
, !DECL_NORMAL_CAPTURE_P (ofield
));
19074 if (PACK_EXPANSION_P (ofield
))
19075 ofield
= PACK_EXPANSION_PATTERN (ofield
);
19076 tree field
= tsubst_decl (ofield
, args
, complain
);
19078 if (DECL_PACK_P (ofield
) && !DECL_NORMAL_CAPTURE_P (ofield
))
19080 /* Remember these for when we've pushed local_specializations. */
19081 vec_safe_push (field_packs
, ofield
);
19082 vec_safe_push (field_packs
, field
);
19085 if (field
== error_mark_node
)
19086 return error_mark_node
;
19088 if (TREE_CODE (field
) == TREE_VEC
)
19090 int len
= TREE_VEC_LENGTH (field
);
19091 gcc_assert (TREE_CODE (init
) == TREE_VEC
19092 && TREE_VEC_LENGTH (init
) == len
);
19093 for (int i
= 0; i
< len
; ++i
)
19094 prepend_one_capture (TREE_VEC_ELT (field
, i
),
19095 TREE_VEC_ELT (init
, i
),
19096 LAMBDA_EXPR_CAPTURE_LIST (r
),
19101 prepend_one_capture (field
, init
, LAMBDA_EXPR_CAPTURE_LIST (r
),
19104 if (id_equal (DECL_NAME (field
), "__this"))
19105 LAMBDA_EXPR_THIS_CAPTURE (r
) = field
;
19109 tree type
= begin_lambda_type (r
);
19110 if (type
== error_mark_node
)
19111 return error_mark_node
;
19113 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
19114 determine_visibility (TYPE_NAME (type
));
19116 register_capture_members (LAMBDA_EXPR_CAPTURE_LIST (r
));
19118 tree oldtmpl
= (generic_lambda_fn_p (oldfn
)
19119 ? DECL_TI_TEMPLATE (oldfn
)
19122 tree fntype
= static_fn_type (oldfn
);
19124 ++processing_template_decl
;
19125 fntype
= tsubst (fntype
, args
, complain
, in_decl
);
19127 --processing_template_decl
;
19129 if (fntype
== error_mark_node
)
19130 r
= error_mark_node
;
19133 /* The body of a lambda-expression is not a subexpression of the
19134 enclosing expression. Parms are to have DECL_CHAIN tsubsted,
19135 which would be skipped if cp_unevaluated_operand. */
19138 /* Fix the type of 'this'. */
19139 fntype
= build_memfn_type (fntype
, type
,
19140 type_memfn_quals (fntype
),
19141 type_memfn_rqual (fntype
));
19145 tmpl
= tsubst_template_decl (oldtmpl
, args
, complain
, fntype
);
19146 if (tmpl
== error_mark_node
)
19148 r
= error_mark_node
;
19151 fn
= DECL_TEMPLATE_RESULT (tmpl
);
19152 finish_member_declaration (tmpl
);
19157 fn
= tsubst_function_decl (oldfn
, args
, complain
, fntype
);
19158 if (fn
== error_mark_node
)
19160 r
= error_mark_node
;
19163 finish_member_declaration (fn
);
19166 if (tree ci
= get_constraints (oldfn
))
19168 /* Substitute into the lambda's constraints. */
19170 ++processing_template_decl
;
19171 ci
= tsubst_constraint_info (ci
, args
, complain
, in_decl
);
19173 --processing_template_decl
;
19174 set_constraints (fn
, ci
);
19177 /* Let finish_function set this. */
19178 DECL_DECLARED_CONSTEXPR_P (fn
) = false;
19180 bool nested
= cfun
;
19182 push_function_context ();
19184 /* Still increment function_depth so that we don't GC in the
19185 middle of an expression. */
19188 local_specialization_stack
s (lss_copy
);
19190 tree body
= start_lambda_function (fn
, r
);
19192 /* Now record them for lookup_init_capture_pack. */
19193 int fplen
= vec_safe_length (field_packs
);
19194 for (int i
= 0; i
< fplen
; )
19196 tree pack
= (*field_packs
)[i
++];
19197 tree inst
= (*field_packs
)[i
++];
19198 register_local_specialization (inst
, pack
);
19200 release_tree_vector (field_packs
);
19202 register_parameter_specializations (oldfn
, fn
);
19206 /* We might not partially instantiate some parts of the function, so
19207 copy these flags from the original template. */
19208 language_function
*ol
= DECL_STRUCT_FUNCTION (oldfn
)->language
;
19209 current_function_returns_value
= ol
->returns_value
;
19210 current_function_returns_null
= ol
->returns_null
;
19211 current_function_returns_abnormally
= ol
->returns_abnormally
;
19212 current_function_infinite_loop
= ol
->infinite_loop
;
19215 /* [temp.deduct] A lambda-expression appearing in a function type or a
19216 template parameter is not considered part of the immediate context for
19217 the purposes of template argument deduction. */
19218 complain
= tf_warning_or_error
;
19220 tsubst_expr (DECL_SAVED_TREE (oldfn
), args
, complain
, r
,
19221 /*constexpr*/false);
19223 finish_lambda_function (body
);
19226 pop_function_context ();
19230 /* The capture list was built up in reverse order; fix that now. */
19231 LAMBDA_EXPR_CAPTURE_LIST (r
)
19232 = nreverse (LAMBDA_EXPR_CAPTURE_LIST (r
));
19234 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
19236 maybe_add_lambda_conv_op (type
);
19240 finish_struct (type
, /*attr*/NULL_TREE
);
19242 insert_pending_capture_proxies ();
19247 /* Like tsubst but deals with expressions and performs semantic
19248 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
19251 tsubst_copy_and_build (tree t
,
19253 tsubst_flags_t complain
,
19256 bool integral_constant_expression_p
)
19258 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
19259 #define RECUR(NODE) \
19260 tsubst_copy_and_build (NODE, args, complain, in_decl, \
19261 /*function_p=*/false, \
19262 integral_constant_expression_p)
19265 location_t save_loc
;
19267 if (t
== NULL_TREE
|| t
== error_mark_node
)
19270 save_loc
= input_location
;
19271 if (location_t eloc
= cp_expr_location (t
))
19272 input_location
= eloc
;
19274 /* N3276 decltype magic only applies to calls at the top level or on the
19275 right side of a comma. */
19276 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
19277 complain
&= ~tf_decltype
;
19279 switch (TREE_CODE (t
))
19283 /* Fall through. */
19284 case IDENTIFIER_NODE
:
19288 bool non_integral_constant_expression_p
;
19289 const char *error_msg
;
19291 if (IDENTIFIER_CONV_OP_P (t
))
19293 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
19294 t
= make_conv_op_name (new_type
);
19297 /* Look up the name. */
19298 decl
= lookup_name (t
);
19300 /* By convention, expressions use ERROR_MARK_NODE to indicate
19301 failure, not NULL_TREE. */
19302 if (decl
== NULL_TREE
)
19303 decl
= error_mark_node
;
19305 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
19307 integral_constant_expression_p
,
19308 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
19309 &non_integral_constant_expression_p
,
19310 /*template_p=*/false,
19312 /*address_p=*/false,
19313 /*template_arg_p=*/false,
19318 if (!function_p
&& identifier_p (decl
))
19320 if (complain
& tf_error
)
19321 unqualified_name_lookup_error (decl
);
19322 decl
= error_mark_node
;
19327 case TEMPLATE_ID_EXPR
:
19330 tree templ
= RECUR (TREE_OPERAND (t
, 0));
19331 tree targs
= TREE_OPERAND (t
, 1);
19334 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
19335 if (targs
== error_mark_node
)
19336 RETURN (error_mark_node
);
19338 if (TREE_CODE (templ
) == SCOPE_REF
)
19340 tree name
= TREE_OPERAND (templ
, 1);
19341 tree tid
= lookup_template_function (name
, targs
);
19342 TREE_OPERAND (templ
, 1) = tid
;
19346 if (concept_definition_p (templ
))
19348 tree check
= build_concept_check (templ
, targs
, complain
);
19349 if (check
== error_mark_node
)
19350 RETURN (error_mark_node
);
19352 tree id
= unpack_concept_check (check
);
19354 /* If we built a function concept check, return the underlying
19355 template-id. So we can evaluate it as a function call. */
19356 if (function_concept_p (TREE_OPERAND (id
, 0)))
19362 if (variable_template_p (templ
))
19364 tree r
= lookup_and_finish_template_variable (templ
, targs
,
19366 r
= maybe_wrap_with_location (r
, EXPR_LOCATION (t
));
19370 if (TREE_CODE (templ
) == COMPONENT_REF
)
19372 object
= TREE_OPERAND (templ
, 0);
19373 templ
= TREE_OPERAND (templ
, 1);
19376 object
= NULL_TREE
;
19377 templ
= lookup_template_function (templ
, targs
);
19380 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
19381 object
, templ
, NULL_TREE
));
19383 RETURN (baselink_for_fns (templ
));
19388 tree r
= RECUR (TREE_OPERAND (t
, 0));
19390 if (REFERENCE_REF_P (t
))
19392 /* A type conversion to reference type will be enclosed in
19393 such an indirect ref, but the substitution of the cast
19394 will have also added such an indirect ref. */
19395 r
= convert_from_reference (r
);
19398 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
19399 complain
|decltype_flag
);
19401 if (REF_PARENTHESIZED_P (t
))
19402 r
= force_paren_expr (r
);
19409 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
19410 tree op0
= RECUR (TREE_OPERAND (t
, 0));
19411 RETURN (build_nop (type
, op0
));
19414 case IMPLICIT_CONV_EXPR
:
19416 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
19417 tree expr
= RECUR (TREE_OPERAND (t
, 0));
19418 if (dependent_type_p (type
) || type_dependent_expression_p (expr
))
19420 retval
= copy_node (t
);
19421 TREE_TYPE (retval
) = type
;
19422 TREE_OPERAND (retval
, 0) = expr
;
19425 if (IMPLICIT_CONV_EXPR_NONTYPE_ARG (t
))
19426 /* We'll pass this to convert_nontype_argument again, we don't need
19427 to actually perform any conversion here. */
19429 int flags
= LOOKUP_IMPLICIT
;
19430 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
19431 flags
= LOOKUP_NORMAL
;
19432 if (IMPLICIT_CONV_EXPR_BRACED_INIT (t
))
19433 flags
|= LOOKUP_NO_NARROWING
;
19434 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
19440 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
19441 tree op0
= RECUR (TREE_OPERAND (t
, 0));
19442 if (op0
== error_mark_node
)
19443 RETURN (error_mark_node
);
19444 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
19448 case REINTERPRET_CAST_EXPR
:
19449 case CONST_CAST_EXPR
:
19450 case DYNAMIC_CAST_EXPR
:
19451 case STATIC_CAST_EXPR
:
19454 tree op
, r
= NULL_TREE
;
19456 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
19457 if (integral_constant_expression_p
19458 && !cast_valid_in_integral_constant_expression_p (type
))
19460 if (complain
& tf_error
)
19461 error ("a cast to a type other than an integral or "
19462 "enumeration type cannot appear in a constant-expression");
19463 RETURN (error_mark_node
);
19466 op
= RECUR (TREE_OPERAND (t
, 0));
19468 warning_sentinel
s(warn_useless_cast
);
19469 warning_sentinel
s2(warn_ignored_qualifiers
);
19470 switch (TREE_CODE (t
))
19473 r
= build_functional_cast (input_location
, type
, op
, complain
);
19475 case REINTERPRET_CAST_EXPR
:
19476 r
= build_reinterpret_cast (input_location
, type
, op
, complain
);
19478 case CONST_CAST_EXPR
:
19479 r
= build_const_cast (input_location
, type
, op
, complain
);
19481 case DYNAMIC_CAST_EXPR
:
19482 r
= build_dynamic_cast (input_location
, type
, op
, complain
);
19484 case STATIC_CAST_EXPR
:
19485 r
= build_static_cast (input_location
, type
, op
, complain
);
19486 if (IMPLICIT_RVALUE_P (t
))
19487 set_implicit_rvalue_p (r
);
19490 gcc_unreachable ();
19496 case POSTDECREMENT_EXPR
:
19497 case POSTINCREMENT_EXPR
:
19498 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
19499 args
, complain
, in_decl
);
19500 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
19501 complain
|decltype_flag
));
19503 case PREDECREMENT_EXPR
:
19504 case PREINCREMENT_EXPR
:
19508 case TRUTH_NOT_EXPR
:
19509 case UNARY_PLUS_EXPR
: /* Unary + */
19510 case REALPART_EXPR
:
19511 case IMAGPART_EXPR
:
19512 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
19513 RECUR (TREE_OPERAND (t
, 0)),
19514 complain
|decltype_flag
));
19516 case FIX_TRUNC_EXPR
:
19517 gcc_unreachable ();
19520 op1
= TREE_OPERAND (t
, 0);
19521 if (TREE_CODE (op1
) == LABEL_DECL
)
19522 RETURN (finish_label_address_expr (DECL_NAME (op1
),
19523 EXPR_LOCATION (op1
)));
19524 if (TREE_CODE (op1
) == SCOPE_REF
)
19525 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
19526 /*done=*/true, /*address_p=*/true);
19528 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
19530 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
19531 complain
|decltype_flag
));
19536 case TRUNC_DIV_EXPR
:
19537 case CEIL_DIV_EXPR
:
19538 case FLOOR_DIV_EXPR
:
19539 case ROUND_DIV_EXPR
:
19540 case EXACT_DIV_EXPR
:
19544 case TRUNC_MOD_EXPR
:
19545 case FLOOR_MOD_EXPR
:
19546 case TRUTH_ANDIF_EXPR
:
19547 case TRUTH_ORIF_EXPR
:
19548 case TRUTH_AND_EXPR
:
19549 case TRUTH_OR_EXPR
:
19560 case SPACESHIP_EXPR
:
19564 /* If T was type-dependent, suppress warnings that depend on the range
19565 of the types involved. */
19566 bool was_dep
= type_dependent_expression_p_push (t
);
19568 tree op0
= RECUR (TREE_OPERAND (t
, 0));
19569 tree op1
= RECUR (TREE_OPERAND (t
, 1));
19571 warning_sentinel
s1(warn_type_limits
, was_dep
);
19572 warning_sentinel
s2(warn_div_by_zero
, was_dep
);
19573 warning_sentinel
s3(warn_logical_op
, was_dep
);
19574 warning_sentinel
s4(warn_tautological_compare
, was_dep
);
19576 tree r
= build_x_binary_op
19577 (input_location
, TREE_CODE (t
),
19579 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
19581 : TREE_CODE (TREE_OPERAND (t
, 0))),
19583 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
19585 : TREE_CODE (TREE_OPERAND (t
, 1))),
19587 complain
|decltype_flag
);
19588 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
19589 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
19594 case POINTER_PLUS_EXPR
:
19596 tree op0
= RECUR (TREE_OPERAND (t
, 0));
19597 if (op0
== error_mark_node
)
19598 RETURN (error_mark_node
);
19599 tree op1
= RECUR (TREE_OPERAND (t
, 1));
19600 if (op1
== error_mark_node
)
19601 RETURN (error_mark_node
);
19602 RETURN (fold_build_pointer_plus (op0
, op1
));
19606 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
19607 /*address_p=*/false));
19609 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
19610 args
, complain
, in_decl
);
19611 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
19612 RECUR (TREE_OPERAND (t
, 1)),
19613 complain
|decltype_flag
));
19616 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0))
19617 || ARGUMENT_PACK_P (TREE_OPERAND (t
, 0)))
19618 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
19625 op1
= TREE_OPERAND (t
, 0);
19626 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
19627 op1
= TREE_TYPE (op1
);
19628 bool std_alignof
= (TREE_CODE (t
) == ALIGNOF_EXPR
19629 && ALIGNOF_EXPR_STD_P (t
));
19632 /* When there are no ARGS, we are trying to evaluate a
19633 non-dependent expression from the parser. Trying to do
19634 the substitutions may not work. */
19636 op1
= TREE_TYPE (op1
);
19640 ++cp_unevaluated_operand
;
19641 ++c_inhibit_evaluation_warnings
;
19643 op1
= tsubst (op1
, args
, complain
, in_decl
);
19645 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
19646 /*function_p=*/false,
19647 /*integral_constant_expression_p=*/
19649 --cp_unevaluated_operand
;
19650 --c_inhibit_evaluation_warnings
;
19653 r
= cxx_sizeof_or_alignof_type (input_location
,
19654 op1
, TREE_CODE (t
), std_alignof
,
19655 complain
& tf_error
);
19657 r
= cxx_sizeof_or_alignof_expr (input_location
,
19658 op1
, TREE_CODE (t
),
19659 complain
& tf_error
);
19660 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
19662 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
19664 if (!processing_template_decl
&& TYPE_P (op1
))
19666 r
= build_min (SIZEOF_EXPR
, size_type_node
,
19667 build1 (NOP_EXPR
, op1
, error_mark_node
));
19668 SIZEOF_EXPR_TYPE_P (r
) = 1;
19671 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
19672 TREE_SIDE_EFFECTS (r
) = 0;
19673 TREE_READONLY (r
) = 1;
19675 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
19680 case AT_ENCODE_EXPR
:
19682 op1
= TREE_OPERAND (t
, 0);
19683 ++cp_unevaluated_operand
;
19684 ++c_inhibit_evaluation_warnings
;
19685 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
19686 /*function_p=*/false,
19687 /*integral_constant_expression_p=*/false);
19688 --cp_unevaluated_operand
;
19689 --c_inhibit_evaluation_warnings
;
19690 RETURN (objc_build_encode_expr (op1
));
19693 case NOEXCEPT_EXPR
:
19694 op1
= TREE_OPERAND (t
, 0);
19695 ++cp_unevaluated_operand
;
19696 ++c_inhibit_evaluation_warnings
;
19697 ++cp_noexcept_operand
;
19698 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
19699 /*function_p=*/false,
19700 /*integral_constant_expression_p=*/false);
19701 --cp_unevaluated_operand
;
19702 --c_inhibit_evaluation_warnings
;
19703 --cp_noexcept_operand
;
19704 RETURN (finish_noexcept_expr (op1
, complain
));
19708 warning_sentinel
s(warn_div_by_zero
);
19709 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
19710 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
19711 tree r
= build_x_modify_expr
19712 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
19713 complain
|decltype_flag
);
19714 /* TREE_NO_WARNING must be set if either the expression was
19715 parenthesized or it uses an operator such as >>= rather
19716 than plain assignment. In the former case, it was already
19717 set and must be copied. In the latter case,
19718 build_x_modify_expr sets it and it must not be reset
19720 if (TREE_NO_WARNING (t
))
19721 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
19727 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
19728 args
, complain
, in_decl
);
19729 /* Remember that there was a reference to this entity. */
19731 && !mark_used (op1
, complain
) && !(complain
& tf_error
))
19732 RETURN (error_mark_node
);
19733 RETURN (build_x_arrow (input_location
, op1
, complain
));
19737 tree placement
= RECUR (TREE_OPERAND (t
, 0));
19738 tree init
= RECUR (TREE_OPERAND (t
, 3));
19739 vec
<tree
, va_gc
> *placement_vec
;
19740 vec
<tree
, va_gc
> *init_vec
;
19742 location_t loc
= EXPR_LOCATION (t
);
19744 if (placement
== NULL_TREE
)
19745 placement_vec
= NULL
;
19746 else if (placement
== error_mark_node
)
19747 RETURN (error_mark_node
);
19750 placement_vec
= make_tree_vector ();
19751 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
19752 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
19755 /* If there was an initializer in the original tree, but it
19756 instantiated to an empty list, then we should pass a
19757 non-NULL empty vector to tell build_new that it was an
19758 empty initializer() rather than no initializer. This can
19759 only happen when the initializer is a pack expansion whose
19760 parameter packs are of length zero. */
19761 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
19765 init_vec
= make_tree_vector ();
19766 if (init
== void_node
)
19767 gcc_assert (init_vec
!= NULL
);
19770 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
19771 vec_safe_push (init_vec
, TREE_VALUE (init
));
19775 /* Avoid passing an enclosing decl to valid_array_size_p. */
19776 in_decl
= NULL_TREE
;
19778 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
19779 tree op2
= RECUR (TREE_OPERAND (t
, 2));
19780 ret
= build_new (loc
, &placement_vec
, op1
, op2
,
19781 &init_vec
, NEW_EXPR_USE_GLOBAL (t
),
19784 if (placement_vec
!= NULL
)
19785 release_tree_vector (placement_vec
);
19786 if (init_vec
!= NULL
)
19787 release_tree_vector (init_vec
);
19794 tree op0
= RECUR (TREE_OPERAND (t
, 0));
19795 tree op1
= RECUR (TREE_OPERAND (t
, 1));
19796 RETURN (delete_sanity (input_location
, op0
, op1
,
19797 DELETE_EXPR_USE_VEC (t
),
19798 DELETE_EXPR_USE_GLOBAL (t
),
19802 case COMPOUND_EXPR
:
19804 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
19805 complain
& ~tf_decltype
, in_decl
,
19806 /*function_p=*/false,
19807 integral_constant_expression_p
);
19808 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
19810 RECUR (TREE_OPERAND (t
, 1)),
19811 complain
|decltype_flag
));
19817 unsigned int nargs
, i
;
19822 function
= CALL_EXPR_FN (t
);
19823 /* Internal function with no arguments. */
19824 if (function
== NULL_TREE
&& call_expr_nargs (t
) == 0)
19827 /* When we parsed the expression, we determined whether or
19828 not Koenig lookup should be performed. */
19829 koenig_p
= KOENIG_LOOKUP_P (t
);
19830 if (function
== NULL_TREE
)
19833 qualified_p
= false;
19835 else if (TREE_CODE (function
) == SCOPE_REF
)
19837 qualified_p
= true;
19838 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
19840 /*address_p=*/false);
19842 else if (koenig_p
&& identifier_p (function
))
19844 /* Do nothing; calling tsubst_copy_and_build on an identifier
19845 would incorrectly perform unqualified lookup again.
19847 Note that we can also have an IDENTIFIER_NODE if the earlier
19848 unqualified lookup found a member function; in that case
19849 koenig_p will be false and we do want to do the lookup
19850 again to find the instantiated member function.
19852 FIXME but doing that causes c++/15272, so we need to stop
19853 using IDENTIFIER_NODE in that situation. */
19854 qualified_p
= false;
19858 if (TREE_CODE (function
) == COMPONENT_REF
)
19860 tree op
= TREE_OPERAND (function
, 1);
19862 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
19863 || (BASELINK_P (op
)
19864 && BASELINK_QUALIFIED_P (op
)));
19867 qualified_p
= false;
19869 if (TREE_CODE (function
) == ADDR_EXPR
19870 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
19871 /* Avoid error about taking the address of a constructor. */
19872 function
= TREE_OPERAND (function
, 0);
19874 function
= tsubst_copy_and_build (function
, args
, complain
,
19877 integral_constant_expression_p
);
19879 if (BASELINK_P (function
))
19880 qualified_p
= true;
19883 nargs
= call_expr_nargs (t
);
19884 releasing_vec call_args
;
19885 for (i
= 0; i
< nargs
; ++i
)
19887 tree arg
= CALL_EXPR_ARG (t
, i
);
19889 if (!PACK_EXPANSION_P (arg
))
19890 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
19893 /* Expand the pack expansion and push each entry onto
19895 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
19896 if (TREE_CODE (arg
) == TREE_VEC
)
19898 unsigned int len
, j
;
19900 len
= TREE_VEC_LENGTH (arg
);
19901 for (j
= 0; j
< len
; ++j
)
19903 tree value
= TREE_VEC_ELT (arg
, j
);
19904 if (value
!= NULL_TREE
)
19905 value
= convert_from_reference (value
);
19906 vec_safe_push (call_args
, value
);
19911 /* A partial substitution. Add one entry. */
19912 vec_safe_push (call_args
, arg
);
19917 /* Stripped-down processing for a call in a thunk. Specifically, in
19918 the thunk template for a generic lambda. */
19919 if (CALL_FROM_THUNK_P (t
))
19921 /* Now that we've expanded any packs, the number of call args
19922 might be different. */
19923 unsigned int cargs
= call_args
->length ();
19924 tree thisarg
= NULL_TREE
;
19925 if (TREE_CODE (function
) == COMPONENT_REF
)
19927 thisarg
= TREE_OPERAND (function
, 0);
19928 if (TREE_CODE (thisarg
) == INDIRECT_REF
)
19929 thisarg
= TREE_OPERAND (thisarg
, 0);
19930 function
= TREE_OPERAND (function
, 1);
19931 if (TREE_CODE (function
) == BASELINK
)
19932 function
= BASELINK_FUNCTIONS (function
);
19934 /* We aren't going to do normal overload resolution, so force the
19935 template-id to resolve. */
19936 function
= resolve_nondeduced_context (function
, complain
);
19937 for (unsigned i
= 0; i
< cargs
; ++i
)
19939 /* In a thunk, pass through args directly, without any
19941 tree arg
= (*call_args
)[i
];
19942 while (TREE_CODE (arg
) != PARM_DECL
)
19943 arg
= TREE_OPERAND (arg
, 0);
19944 (*call_args
)[i
] = arg
;
19948 /* If there are no other args, just push 'this'. */
19950 vec_safe_push (call_args
, thisarg
);
19953 /* Otherwise, shift the other args over to make room. */
19954 tree last
= (*call_args
)[cargs
- 1];
19955 vec_safe_push (call_args
, last
);
19956 for (int i
= cargs
- 1; i
> 0; --i
)
19957 (*call_args
)[i
] = (*call_args
)[i
- 1];
19958 (*call_args
)[0] = thisarg
;
19961 ret
= build_call_a (function
, call_args
->length (),
19962 call_args
->address ());
19963 /* The thunk location is not interesting. */
19964 SET_EXPR_LOCATION (ret
, UNKNOWN_LOCATION
);
19965 CALL_FROM_THUNK_P (ret
) = true;
19966 if (CLASS_TYPE_P (TREE_TYPE (ret
)))
19967 CALL_EXPR_RETURN_SLOT_OPT (ret
) = true;
19972 /* We do not perform argument-dependent lookup if normal
19973 lookup finds a non-function, in accordance with the
19974 expected resolution of DR 218. */
19976 && ((is_overloaded_fn (function
)
19977 /* If lookup found a member function, the Koenig lookup is
19978 not appropriate, even if an unqualified-name was used
19979 to denote the function. */
19980 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
19981 || identifier_p (function
))
19982 /* Only do this when substitution turns a dependent call
19983 into a non-dependent call. */
19984 && type_dependent_expression_p_push (t
)
19985 && !any_type_dependent_arguments_p (call_args
))
19986 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
19988 if (function
!= NULL_TREE
19989 && identifier_p (function
)
19990 && !any_type_dependent_arguments_p (call_args
))
19992 if (koenig_p
&& (complain
& tf_warning_or_error
))
19994 /* For backwards compatibility and good diagnostics, try
19995 the unqualified lookup again if we aren't in SFINAE
19997 tree unq
= (tsubst_copy_and_build
19998 (function
, args
, complain
, in_decl
, true,
19999 integral_constant_expression_p
));
20000 if (unq
== error_mark_node
)
20001 RETURN (error_mark_node
);
20003 if (unq
!= function
)
20005 /* In a lambda fn, we have to be careful to not
20006 introduce new this captures. Legacy code can't
20007 be using lambdas anyway, so it's ok to be
20009 bool in_lambda
= (current_class_type
20010 && LAMBDA_TYPE_P (current_class_type
));
20011 char const *const msg
20012 = G_("%qD was not declared in this scope, "
20013 "and no declarations were found by "
20014 "argument-dependent lookup at the point "
20015 "of instantiation");
20019 error_at (cp_expr_loc_or_input_loc (t
),
20022 diag
= permerror (cp_expr_loc_or_input_loc (t
),
20028 if (INDIRECT_REF_P (fn
))
20029 fn
= TREE_OPERAND (fn
, 0);
20030 if (is_overloaded_fn (fn
))
20031 fn
= get_first_fn (fn
);
20034 /* Can't say anything more. */;
20035 else if (DECL_CLASS_SCOPE_P (fn
))
20037 location_t loc
= cp_expr_loc_or_input_loc (t
);
20039 "declarations in dependent base %qT are "
20040 "not found by unqualified lookup",
20041 DECL_CLASS_CONTEXT (fn
));
20042 if (current_class_ptr
)
20044 "use %<this->%D%> instead", function
);
20047 "use %<%T::%D%> instead",
20048 current_class_name
, function
);
20051 inform (DECL_SOURCE_LOCATION (fn
),
20052 "%qD declared here, later in the "
20053 "translation unit", fn
);
20055 RETURN (error_mark_node
);
20061 if (identifier_p (function
))
20063 if (complain
& tf_error
)
20064 unqualified_name_lookup_error (function
);
20065 RETURN (error_mark_node
);
20069 /* Remember that there was a reference to this entity. */
20070 if (function
!= NULL_TREE
20071 && DECL_P (function
)
20072 && !mark_used (function
, complain
) && !(complain
& tf_error
))
20073 RETURN (error_mark_node
);
20075 /* Put back tf_decltype for the actual call. */
20076 complain
|= decltype_flag
;
20078 if (function
== NULL_TREE
)
20079 switch (CALL_EXPR_IFN (t
))
20082 gcc_assert (nargs
== 1);
20083 if (vec_safe_length (call_args
) != 1)
20085 error_at (cp_expr_loc_or_input_loc (t
),
20086 "wrong number of arguments to "
20087 "%<__builtin_launder%>");
20088 ret
= error_mark_node
;
20091 ret
= finish_builtin_launder (cp_expr_loc_or_input_loc (t
),
20092 (*call_args
)[0], complain
);
20095 case IFN_VEC_CONVERT
:
20096 gcc_assert (nargs
== 1);
20097 if (vec_safe_length (call_args
) != 1)
20099 error_at (cp_expr_loc_or_input_loc (t
),
20100 "wrong number of arguments to "
20101 "%<__builtin_convertvector%>");
20102 ret
= error_mark_node
;
20105 ret
= cp_build_vec_convert ((*call_args
)[0], input_location
,
20106 tsubst (TREE_TYPE (t
), args
,
20107 complain
, in_decl
),
20109 if (TREE_CODE (ret
) == VIEW_CONVERT_EXPR
)
20114 /* Unsupported internal function with arguments. */
20115 gcc_unreachable ();
20117 else if (TREE_CODE (function
) == OFFSET_REF
20118 || TREE_CODE (function
) == DOTSTAR_EXPR
20119 || TREE_CODE (function
) == MEMBER_REF
)
20120 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
20122 else if (TREE_CODE (function
) == COMPONENT_REF
)
20124 tree instance
= TREE_OPERAND (function
, 0);
20125 tree fn
= TREE_OPERAND (function
, 1);
20127 if (processing_template_decl
20128 && (type_dependent_expression_p (instance
)
20129 || (!BASELINK_P (fn
)
20130 && TREE_CODE (fn
) != FIELD_DECL
)
20131 || type_dependent_expression_p (fn
)
20132 || any_type_dependent_arguments_p (call_args
)))
20133 ret
= build_min_nt_call_vec (function
, call_args
);
20134 else if (!BASELINK_P (fn
))
20135 ret
= finish_call_expr (function
, &call_args
,
20136 /*disallow_virtual=*/false,
20137 /*koenig_p=*/false,
20140 ret
= (build_new_method_call
20142 &call_args
, NULL_TREE
,
20143 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
20147 else if (concept_check_p (function
))
20149 /* FUNCTION is a template-id referring to a concept definition. */
20150 tree id
= unpack_concept_check (function
);
20151 tree tmpl
= TREE_OPERAND (id
, 0);
20152 tree args
= TREE_OPERAND (id
, 1);
20154 /* Calls to standard and variable concepts should have been
20155 previously diagnosed. */
20156 gcc_assert (function_concept_p (tmpl
));
20158 /* Ensure the result is wrapped as a call expression. */
20159 ret
= build_concept_check (tmpl
, args
, tf_warning_or_error
);
20162 ret
= finish_call_expr (function
, &call_args
,
20163 /*disallow_virtual=*/qualified_p
,
20167 if (ret
!= error_mark_node
)
20169 bool op
= CALL_EXPR_OPERATOR_SYNTAX (t
);
20170 bool ord
= CALL_EXPR_ORDERED_ARGS (t
);
20171 bool rev
= CALL_EXPR_REVERSE_ARGS (t
);
20172 if (op
|| ord
|| rev
)
20174 function
= extract_call_expr (ret
);
20175 CALL_EXPR_OPERATOR_SYNTAX (function
) = op
;
20176 CALL_EXPR_ORDERED_ARGS (function
) = ord
;
20177 CALL_EXPR_REVERSE_ARGS (function
) = rev
;
20186 tree cond
= RECUR (TREE_OPERAND (t
, 0));
20187 cond
= mark_rvalue_use (cond
);
20188 tree folded_cond
= fold_non_dependent_expr (cond
, complain
);
20191 if (TREE_CODE (folded_cond
) == INTEGER_CST
)
20193 if (integer_zerop (folded_cond
))
20195 ++c_inhibit_evaluation_warnings
;
20196 exp1
= RECUR (TREE_OPERAND (t
, 1));
20197 --c_inhibit_evaluation_warnings
;
20198 exp2
= RECUR (TREE_OPERAND (t
, 2));
20202 exp1
= RECUR (TREE_OPERAND (t
, 1));
20203 ++c_inhibit_evaluation_warnings
;
20204 exp2
= RECUR (TREE_OPERAND (t
, 2));
20205 --c_inhibit_evaluation_warnings
;
20207 cond
= folded_cond
;
20211 exp1
= RECUR (TREE_OPERAND (t
, 1));
20212 exp2
= RECUR (TREE_OPERAND (t
, 2));
20215 warning_sentinel
s(warn_duplicated_branches
);
20216 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
20217 cond
, exp1
, exp2
, complain
));
20220 case PSEUDO_DTOR_EXPR
:
20222 tree op0
= RECUR (TREE_OPERAND (t
, 0));
20223 tree op1
= RECUR (TREE_OPERAND (t
, 1));
20224 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
20225 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
20230 RETURN (tsubst_tree_list (t
, args
, complain
, in_decl
));
20232 case COMPONENT_REF
:
20239 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
20240 args
, complain
, in_decl
);
20241 /* Remember that there was a reference to this entity. */
20242 if (DECL_P (object
)
20243 && !mark_used (object
, complain
) && !(complain
& tf_error
))
20244 RETURN (error_mark_node
);
20245 object_type
= TREE_TYPE (object
);
20247 member
= TREE_OPERAND (t
, 1);
20248 if (BASELINK_P (member
))
20249 member
= tsubst_baselink (member
,
20250 non_reference (TREE_TYPE (object
)),
20251 args
, complain
, in_decl
);
20253 member
= tsubst_copy (member
, args
, complain
, in_decl
);
20254 if (member
== error_mark_node
)
20255 RETURN (error_mark_node
);
20257 if (TREE_CODE (member
) == FIELD_DECL
)
20259 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
20260 if (TREE_CODE (r
) == COMPONENT_REF
)
20261 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
20264 else if (type_dependent_expression_p (object
))
20265 /* We can't do much here. */;
20266 else if (!CLASS_TYPE_P (object_type
))
20268 if (scalarish_type_p (object_type
))
20270 tree s
= NULL_TREE
;
20271 tree dtor
= member
;
20273 if (TREE_CODE (dtor
) == SCOPE_REF
)
20275 s
= TREE_OPERAND (dtor
, 0);
20276 dtor
= TREE_OPERAND (dtor
, 1);
20278 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
20280 dtor
= TREE_OPERAND (dtor
, 0);
20282 RETURN (finish_pseudo_destructor_expr
20283 (object
, s
, dtor
, input_location
));
20287 else if (TREE_CODE (member
) == SCOPE_REF
20288 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
20290 /* Lookup the template functions now that we know what the
20292 tree scope
= TREE_OPERAND (member
, 0);
20293 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
20294 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
20295 member
= lookup_qualified_name (scope
, tmpl
, LOOK_want::NORMAL
,
20296 /*complain=*/false);
20297 if (BASELINK_P (member
))
20299 BASELINK_FUNCTIONS (member
)
20300 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
20302 member
= (adjust_result_of_qualified_name_lookup
20303 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
20308 qualified_name_lookup_error (scope
, tmpl
, member
,
20310 RETURN (error_mark_node
);
20313 else if (TREE_CODE (member
) == SCOPE_REF
20314 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
20315 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
20317 if (complain
& tf_error
)
20319 if (TYPE_P (TREE_OPERAND (member
, 0)))
20320 error ("%qT is not a class or namespace",
20321 TREE_OPERAND (member
, 0));
20323 error ("%qD is not a class or namespace",
20324 TREE_OPERAND (member
, 0));
20326 RETURN (error_mark_node
);
20329 r
= finish_class_member_access_expr (object
, member
,
20330 /*template_p=*/false,
20332 if (TREE_CODE (r
) == COMPONENT_REF
)
20333 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
20338 RETURN (build_throw
20339 (input_location
, RECUR (TREE_OPERAND (t
, 0))));
20343 vec
<constructor_elt
, va_gc
> *n
;
20344 constructor_elt
*ce
;
20345 unsigned HOST_WIDE_INT idx
;
20346 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
20347 bool process_index_p
;
20349 bool need_copy_p
= false;
20352 if (type
== error_mark_node
)
20353 RETURN (error_mark_node
);
20355 /* We do not want to process the index of aggregate
20356 initializers as they are identifier nodes which will be
20357 looked up by digest_init. */
20358 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
20360 if (null_member_pointer_value_p (t
))
20362 gcc_assert (same_type_p (type
, TREE_TYPE (t
)));
20366 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
20367 newlen
= vec_safe_length (n
);
20368 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
20370 if (ce
->index
&& process_index_p
20371 /* An identifier index is looked up in the type
20372 being initialized, not the current scope. */
20373 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
20374 ce
->index
= RECUR (ce
->index
);
20376 if (PACK_EXPANSION_P (ce
->value
))
20378 /* Substitute into the pack expansion. */
20379 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
20382 if (ce
->value
== error_mark_node
20383 || PACK_EXPANSION_P (ce
->value
))
20385 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
20386 /* Just move the argument into place. */
20387 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
20390 /* Update the length of the final CONSTRUCTOR
20391 arguments vector, and note that we will need to
20393 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
20394 need_copy_p
= true;
20398 ce
->value
= RECUR (ce
->value
);
20403 vec
<constructor_elt
, va_gc
> *old_n
= n
;
20405 vec_alloc (n
, newlen
);
20406 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
20408 if (TREE_CODE (ce
->value
) == TREE_VEC
)
20410 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
20411 for (i
= 0; i
< len
; ++i
)
20412 CONSTRUCTOR_APPEND_ELT (n
, 0,
20413 TREE_VEC_ELT (ce
->value
, i
));
20416 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
20420 r
= build_constructor (init_list_type_node
, n
);
20421 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
20422 CONSTRUCTOR_IS_DESIGNATED_INIT (r
)
20423 = CONSTRUCTOR_IS_DESIGNATED_INIT (t
);
20425 if (TREE_HAS_CONSTRUCTOR (t
))
20427 fcl_t cl
= fcl_functional
;
20428 if (CONSTRUCTOR_C99_COMPOUND_LITERAL (t
))
20430 RETURN (finish_compound_literal (type
, r
, complain
, cl
));
20433 TREE_TYPE (r
) = type
;
20439 tree operand_0
= TREE_OPERAND (t
, 0);
20440 if (TYPE_P (operand_0
))
20442 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
20443 RETURN (get_typeid (operand_0
, complain
));
20447 operand_0
= RECUR (operand_0
);
20448 RETURN (build_typeid (operand_0
, complain
));
20459 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
20460 /* ??? We're doing a subset of finish_id_expression here. */
20461 if (tree wrap
= maybe_get_tls_wrapper_call (r
))
20462 /* Replace an evaluated use of the thread_local variable with
20463 a call to its wrapper. */
20465 else if (outer_automatic_var_p (r
))
20466 r
= process_outer_var_ref (r
, complain
);
20468 if (!TYPE_REF_P (TREE_TYPE (t
)))
20469 /* If the original type was a reference, we'll be wrapped in
20470 the appropriate INDIRECT_REF. */
20471 r
= convert_from_reference (r
);
20477 tree op0
= RECUR (TREE_OPERAND (t
, 0));
20478 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
20479 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
20482 case OFFSETOF_EXPR
:
20485 = tsubst_copy_and_build (TREE_OPERAND (t
, 1), args
, complain
,
20486 in_decl
, /*function_p=*/false,
20487 /*integral_constant_expression_p=*/false);
20488 RETURN (finish_offsetof (object_ptr
,
20489 RECUR (TREE_OPERAND (t
, 0)),
20490 EXPR_LOCATION (t
)));
20493 case ADDRESSOF_EXPR
:
20494 RETURN (cp_build_addressof (EXPR_LOCATION (t
),
20495 RECUR (TREE_OPERAND (t
, 0)), complain
));
20499 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
20500 complain
, in_decl
);
20501 tree type2
= tsubst (TRAIT_EXPR_TYPE2 (t
), args
,
20502 complain
, in_decl
);
20503 RETURN (finish_trait_expr (TRAIT_EXPR_LOCATION (t
),
20504 TRAIT_EXPR_KIND (t
), type1
, type2
));
20509 tree old_stmt_expr
= cur_stmt_expr
;
20510 tree stmt_expr
= begin_stmt_expr ();
20512 cur_stmt_expr
= stmt_expr
;
20513 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
20514 integral_constant_expression_p
);
20515 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
20516 cur_stmt_expr
= old_stmt_expr
;
20518 /* If the resulting list of expression statement is empty,
20519 fold it further into void_node. */
20520 if (empty_expr_stmt_p (stmt_expr
))
20521 stmt_expr
= void_node
;
20523 RETURN (stmt_expr
);
20528 if (complain
& tf_partial
)
20530 /* We don't have a full set of template arguments yet; don't touch
20531 the lambda at all. */
20532 gcc_assert (processing_template_decl
);
20535 tree r
= tsubst_lambda_expr (t
, args
, complain
, in_decl
);
20537 RETURN (build_lambda_object (r
));
20541 /* We can get here for a constant initializer of non-dependent type.
20542 FIXME stop folding in cp_parser_initializer_clause. */
20544 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
20549 case TRANSACTION_EXPR
:
20550 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
20551 integral_constant_expression_p
));
20554 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
20556 case VEC_PERM_EXPR
:
20558 tree op0
= RECUR (TREE_OPERAND (t
, 0));
20559 tree op1
= RECUR (TREE_OPERAND (t
, 1));
20560 tree op2
= RECUR (TREE_OPERAND (t
, 2));
20561 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
20565 case REQUIRES_EXPR
:
20567 tree r
= tsubst_requires_expr (t
, args
, tf_none
, in_decl
);
20572 /* No need to substitute further, a RANGE_EXPR will always be built
20573 with constant operands. */
20576 case NON_LVALUE_EXPR
:
20577 case VIEW_CONVERT_EXPR
:
20578 if (location_wrapper_p (t
))
20579 /* We need to do this here as well as in tsubst_copy so we get the
20580 other tsubst_copy_and_build semantics for a PARM_DECL operand. */
20581 RETURN (maybe_wrap_with_location (RECUR (TREE_OPERAND (t
, 0)),
20582 EXPR_LOCATION (t
)));
20586 /* Handle Objective-C++ constructs, if appropriate. */
20589 = objcp_tsubst_copy_and_build (t
, args
, complain
,
20590 in_decl
, /*function_p=*/false);
20594 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
20600 input_location
= save_loc
;
20604 /* Verify that the instantiated ARGS are valid. For type arguments,
20605 make sure that the type's linkage is ok. For non-type arguments,
20606 make sure they are constants if they are integral or enumerations.
20607 Emit an error under control of COMPLAIN, and return TRUE on error. */
20610 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
20612 if (dependent_template_arg_p (t
))
20614 if (ARGUMENT_PACK_P (t
))
20616 tree vec
= ARGUMENT_PACK_ARGS (t
);
20617 int len
= TREE_VEC_LENGTH (vec
);
20618 bool result
= false;
20621 for (i
= 0; i
< len
; ++i
)
20622 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
20626 else if (TYPE_P (t
))
20628 /* [basic.link]: A name with no linkage (notably, the name
20629 of a class or enumeration declared in a local scope)
20630 shall not be used to declare an entity with linkage.
20631 This implies that names with no linkage cannot be used as
20634 DR 757 relaxes this restriction for C++0x. */
20635 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
20636 : no_linkage_check (t
, /*relaxed_p=*/false));
20640 /* DR 488 makes use of a type with no linkage cause
20641 type deduction to fail. */
20642 if (complain
& tf_error
)
20644 if (TYPE_UNNAMED_P (nt
))
20645 error ("%qT is/uses unnamed type", t
);
20647 error ("template argument for %qD uses local type %qT",
20652 /* In order to avoid all sorts of complications, we do not
20653 allow variably-modified types as template arguments. */
20654 else if (variably_modified_type_p (t
, NULL_TREE
))
20656 if (complain
& tf_error
)
20657 error ("%qT is a variably modified type", t
);
20661 /* Class template and alias template arguments should be OK. */
20662 else if (DECL_TYPE_TEMPLATE_P (t
))
20664 /* A non-type argument of integral or enumerated type must be a
20666 else if (TREE_TYPE (t
)
20667 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
20668 && !REFERENCE_REF_P (t
)
20669 && !TREE_CONSTANT (t
))
20671 if (complain
& tf_error
)
20672 error ("integral expression %qE is not constant", t
);
20679 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
20681 int ix
, len
= DECL_NTPARMS (tmpl
);
20682 bool result
= false;
20684 for (ix
= 0; ix
!= len
; ix
++)
20686 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
20689 if (result
&& (complain
& tf_error
))
20690 error (" trying to instantiate %qD", tmpl
);
20694 /* We're out of SFINAE context now, so generate diagnostics for the access
20695 errors we saw earlier when instantiating D from TMPL and ARGS. */
20698 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
20700 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
20701 tree type
= TREE_TYPE (pattern
);
20702 location_t loc
= input_location
;
20704 push_access_scope (d
);
20705 push_deferring_access_checks (dk_no_deferred
);
20706 input_location
= DECL_SOURCE_LOCATION (pattern
);
20707 tsubst (type
, args
, tf_warning_or_error
, d
);
20708 input_location
= loc
;
20709 pop_deferring_access_checks ();
20710 pop_access_scope (d
);
20713 /* Instantiate the indicated variable, function, or alias template TMPL with
20714 the template arguments in TARG_PTR. */
20717 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
20719 tree targ_ptr
= orig_args
;
20723 bool access_ok
= true;
20725 if (tmpl
== error_mark_node
)
20726 return error_mark_node
;
20728 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
20730 /* If this function is a clone, handle it specially. */
20731 if (DECL_CLONED_FUNCTION_P (tmpl
))
20736 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
20737 DECL_CLONED_FUNCTION. */
20738 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
20739 targ_ptr
, complain
);
20740 if (spec
== error_mark_node
)
20741 return error_mark_node
;
20743 /* Look for the clone. */
20744 FOR_EACH_CLONE (clone
, spec
)
20745 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
20747 /* We should always have found the clone by now. */
20748 gcc_unreachable ();
20752 if (targ_ptr
== error_mark_node
)
20753 return error_mark_node
;
20755 /* Check to see if we already have this specialization. */
20756 gen_tmpl
= most_general_template (tmpl
);
20757 if (TMPL_ARGS_DEPTH (targ_ptr
)
20758 < TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
)))
20759 /* targ_ptr only has the innermost template args, so add the outer ones
20760 from tmpl, which could be either a partial instantiation or gen_tmpl (in
20761 the case of a non-dependent call within a template definition). */
20762 targ_ptr
= (add_outermost_template_args
20763 (DECL_TI_ARGS (DECL_TEMPLATE_RESULT (tmpl
)),
20766 /* It would be nice to avoid hashing here and then again in tsubst_decl,
20767 but it doesn't seem to be on the hot path. */
20768 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
20770 gcc_checking_assert (tmpl
== gen_tmpl
20772 = retrieve_specialization (tmpl
, orig_args
, 0))
20774 || fndecl
== NULL_TREE
);
20776 if (spec
!= NULL_TREE
)
20778 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
20780 if (complain
& tf_error
)
20781 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
20782 return error_mark_node
;
20787 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
20789 return error_mark_node
;
20791 /* We are building a FUNCTION_DECL, during which the access of its
20792 parameters and return types have to be checked. However this
20793 FUNCTION_DECL which is the desired context for access checking
20794 is not built yet. We solve this chicken-and-egg problem by
20795 deferring all checks until we have the FUNCTION_DECL. */
20796 push_deferring_access_checks (dk_deferred
);
20798 /* Instantiation of the function happens in the context of the function
20799 template, not the context of the overload resolution we're doing. */
20800 push_to_top_level ();
20801 /* If there are dependent arguments, e.g. because we're doing partial
20802 ordering, make sure processing_template_decl stays set. */
20803 if (uses_template_parms (targ_ptr
))
20804 ++processing_template_decl
;
20805 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
20807 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
20808 complain
, gen_tmpl
, true);
20809 push_nested_class (ctx
);
20812 tree pattern
= DECL_TEMPLATE_RESULT (gen_tmpl
);
20814 fndecl
= NULL_TREE
;
20815 if (VAR_P (pattern
))
20817 /* We need to determine if we're using a partial or explicit
20818 specialization now, because the type of the variable could be
20820 tree tid
= lookup_template_variable (gen_tmpl
, targ_ptr
);
20821 tree elt
= most_specialized_partial_spec (tid
, complain
);
20822 if (elt
== error_mark_node
)
20823 pattern
= error_mark_node
;
20826 tree partial_tmpl
= TREE_VALUE (elt
);
20827 tree partial_args
= TREE_PURPOSE (elt
);
20828 tree partial_pat
= DECL_TEMPLATE_RESULT (partial_tmpl
);
20829 fndecl
= tsubst (partial_pat
, partial_args
, complain
, gen_tmpl
);
20833 /* Substitute template parameters to obtain the specialization. */
20834 if (fndecl
== NULL_TREE
)
20835 fndecl
= tsubst (pattern
, targ_ptr
, complain
, gen_tmpl
);
20836 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
20837 pop_nested_class ();
20838 pop_from_top_level ();
20840 if (fndecl
== error_mark_node
)
20842 pop_deferring_access_checks ();
20843 return error_mark_node
;
20846 /* The DECL_TI_TEMPLATE should always be the immediate parent
20847 template, not the most general template. */
20848 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
20849 DECL_TI_ARGS (fndecl
) = targ_ptr
;
20851 /* Now we know the specialization, compute access previously
20852 deferred. Do no access control for inheriting constructors,
20853 as we already checked access for the inherited constructor. */
20854 if (!(flag_new_inheriting_ctors
20855 && DECL_INHERITED_CTOR (fndecl
)))
20857 push_access_scope (fndecl
);
20858 if (!perform_deferred_access_checks (complain
))
20860 pop_access_scope (fndecl
);
20862 pop_deferring_access_checks ();
20864 /* If we've just instantiated the main entry point for a function,
20865 instantiate all the alternate entry points as well. We do this
20866 by cloning the instantiation of the main entry point, not by
20867 instantiating the template clones. */
20868 if (tree chain
= DECL_CHAIN (gen_tmpl
))
20869 if (DECL_P (chain
) && DECL_CLONED_FUNCTION_P (chain
))
20870 clone_cdtor (fndecl
, /*update_methods=*/false);
20874 if (!(complain
& tf_error
))
20876 /* Remember to reinstantiate when we're out of SFINAE so the user
20877 can see the errors. */
20878 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
20880 return error_mark_node
;
20885 /* Wrapper for instantiate_template_1. */
20888 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
20891 timevar_push (TV_TEMPLATE_INST
);
20892 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
20893 timevar_pop (TV_TEMPLATE_INST
);
20897 /* Instantiate the alias template TMPL with ARGS. Also push a template
20898 instantiation level, which instantiate_template doesn't do because
20899 functions and variables have sufficient context established by the
20903 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
20905 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
20906 return error_mark_node
;
20909 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
20910 args
, tmpl
, complain
,
20911 /*require_all_args=*/true,
20912 /*use_default_args=*/true);
20914 /* FIXME check for satisfaction in check_instantiated_args. */
20916 && !any_dependent_template_arguments_p (args
)
20917 && !constraints_satisfied_p (tmpl
, args
))
20919 if (complain
& tf_error
)
20921 auto_diagnostic_group d
;
20922 error ("template constraint failure for %qD", tmpl
);
20923 diagnose_constraints (input_location
, tmpl
, args
);
20925 return error_mark_node
;
20928 if (!push_tinst_level (tmpl
, args
))
20929 return error_mark_node
;
20930 tree r
= instantiate_template (tmpl
, args
, complain
);
20931 pop_tinst_level ();
20936 /* PARM is a template parameter pack for FN. Returns true iff
20937 PARM is used in a deducible way in the argument list of FN. */
20940 pack_deducible_p (tree parm
, tree fn
)
20942 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
20943 for (; t
; t
= TREE_CHAIN (t
))
20945 tree type
= TREE_VALUE (t
);
20947 if (!PACK_EXPANSION_P (type
))
20949 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
20950 packs
; packs
= TREE_CHAIN (packs
))
20951 if (template_args_equal (TREE_VALUE (packs
), parm
))
20953 /* The template parameter pack is used in a function parameter
20954 pack. If this is the end of the parameter list, the
20955 template parameter pack is deducible. */
20956 if (TREE_CHAIN (t
) == void_list_node
)
20959 /* Otherwise, not. Well, it could be deduced from
20960 a non-pack parameter, but doing so would end up with
20961 a deduction mismatch, so don't bother. */
20965 /* The template parameter pack isn't used in any function parameter
20966 packs, but it might be used deeper, e.g. tuple<Args...>. */
20970 /* Subroutine of fn_type_unification: check non-dependent parms for
20974 check_non_deducible_conversions (tree parms
, const tree
*args
, unsigned nargs
,
20975 tree fn
, unification_kind_t strict
, int flags
,
20976 struct conversion
**convs
, bool explain_p
)
20978 /* Non-constructor methods need to leave a conversion for 'this', which
20979 isn't included in nargs here. */
20980 unsigned offset
= (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
20981 && !DECL_CONSTRUCTOR_P (fn
));
20983 for (unsigned ia
= 0;
20984 parms
&& parms
!= void_list_node
&& ia
< nargs
; )
20986 tree parm
= TREE_VALUE (parms
);
20988 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
20989 && (!TREE_CHAIN (parms
)
20990 || TREE_CHAIN (parms
) == void_list_node
))
20991 /* For a function parameter pack that occurs at the end of the
20992 parameter-declaration-list, the type A of each remaining
20993 argument of the call is compared with the type P of the
20994 declarator-id of the function parameter pack. */
20997 parms
= TREE_CHAIN (parms
);
20999 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
21000 /* For a function parameter pack that does not occur at the
21001 end of the parameter-declaration-list, the type of the
21002 parameter pack is a non-deduced context. */
21005 if (!uses_template_parms (parm
))
21007 tree arg
= args
[ia
];
21008 conversion
**conv_p
= convs
? &convs
[ia
+offset
] : NULL
;
21009 int lflags
= conv_flags (ia
, nargs
, fn
, arg
, flags
);
21011 if (check_non_deducible_conversion (parm
, arg
, strict
, lflags
,
21012 conv_p
, explain_p
))
21022 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
21023 NARGS elements of the arguments that are being used when calling
21024 it. TARGS is a vector into which the deduced template arguments
21027 Returns either a FUNCTION_DECL for the matching specialization of FN or
21028 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
21029 true, diagnostics will be printed to explain why it failed.
21031 If FN is a conversion operator, or we are trying to produce a specific
21032 specialization, RETURN_TYPE is the return type desired.
21034 The EXPLICIT_TARGS are explicit template arguments provided via a
21037 The parameter STRICT is one of:
21040 We are deducing arguments for a function call, as in
21041 [temp.deduct.call]. If RETURN_TYPE is non-null, we are
21042 deducing arguments for a call to the result of a conversion
21043 function template, as in [over.call.object].
21046 We are deducing arguments for a conversion function, as in
21047 [temp.deduct.conv].
21050 We are deducing arguments when doing an explicit instantiation
21051 as in [temp.explicit], when determining an explicit specialization
21052 as in [temp.expl.spec], or when taking the address of a function
21053 template, as in [temp.deduct.funcaddr]. */
21056 fn_type_unification (tree fn
,
21057 tree explicit_targs
,
21060 unsigned int nargs
,
21062 unification_kind_t strict
,
21064 struct conversion
**convs
,
21070 tree decl
= NULL_TREE
;
21071 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
21073 static int deduction_depth
;
21074 /* type_unification_real will pass back any access checks from default
21075 template argument substitution. */
21076 vec
<deferred_access_check
, va_gc
> *checks
= NULL
;
21077 /* We don't have all the template args yet. */
21078 bool incomplete
= true;
21081 if (flag_new_inheriting_ctors
)
21082 fn
= strip_inheriting_ctors (fn
);
21084 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
21085 tree r
= error_mark_node
;
21087 tree full_targs
= targs
;
21088 if (TMPL_ARGS_DEPTH (targs
)
21089 < TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (fn
)))
21090 full_targs
= (add_outermost_template_args
21091 (DECL_TI_ARGS (DECL_TEMPLATE_RESULT (fn
)),
21095 complain
|= tf_decltype
;
21097 /* In C++0x, it's possible to have a function template whose type depends
21098 on itself recursively. This is most obvious with decltype, but can also
21099 occur with enumeration scope (c++/48969). So we need to catch infinite
21100 recursion and reject the substitution at deduction time; this function
21101 will return error_mark_node for any repeated substitution.
21103 This also catches excessive recursion such as when f<N> depends on
21104 f<N-1> across all integers, and returns error_mark_node for all the
21105 substitutions back up to the initial one.
21107 This is, of course, not reentrant. */
21108 if (excessive_deduction_depth
)
21109 return error_mark_node
;
21112 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
21114 fntype
= TREE_TYPE (fn
);
21115 if (explicit_targs
)
21119 The specified template arguments must match the template
21120 parameters in kind (i.e., type, nontype, template), and there
21121 must not be more arguments than there are parameters;
21122 otherwise type deduction fails.
21124 Nontype arguments must match the types of the corresponding
21125 nontype template parameters, or must be convertible to the
21126 types of the corresponding nontype parameters as specified in
21127 _temp.arg.nontype_, otherwise type deduction fails.
21129 All references in the function type of the function template
21130 to the corresponding template parameters are replaced by the
21131 specified template argument values. If a substitution in a
21132 template parameter or in the function type of the function
21133 template results in an invalid type, type deduction fails. */
21134 int i
, len
= TREE_VEC_LENGTH (tparms
);
21135 location_t loc
= input_location
;
21136 incomplete
= false;
21138 if (explicit_targs
== error_mark_node
)
21141 if (TMPL_ARGS_DEPTH (explicit_targs
)
21142 < TMPL_ARGS_DEPTH (full_targs
))
21143 explicit_targs
= add_outermost_template_args (full_targs
,
21146 /* Adjust any explicit template arguments before entering the
21147 substitution context. */
21149 = (coerce_template_parms (tparms
, explicit_targs
, fn
,
21150 complain
|tf_partial
,
21151 /*require_all_args=*/false,
21152 /*use_default_args=*/false));
21153 if (explicit_targs
== error_mark_node
)
21156 /* Substitute the explicit args into the function type. This is
21157 necessary so that, for instance, explicitly declared function
21158 arguments can match null pointed constants. If we were given
21159 an incomplete set of explicit args, we must not do semantic
21160 processing during substitution as we could create partial
21162 for (i
= 0; i
< len
; i
++)
21164 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
21165 bool parameter_pack
= false;
21166 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
21168 /* Dig out the actual parm. */
21169 if (TREE_CODE (parm
) == TYPE_DECL
21170 || TREE_CODE (parm
) == TEMPLATE_DECL
)
21172 parm
= TREE_TYPE (parm
);
21173 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
21175 else if (TREE_CODE (parm
) == PARM_DECL
)
21177 parm
= DECL_INITIAL (parm
);
21178 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
21181 if (targ
== NULL_TREE
)
21182 /* No explicit argument for this template parameter. */
21184 else if (parameter_pack
&& pack_deducible_p (parm
, fn
))
21186 /* Mark the argument pack as "incomplete". We could
21187 still deduce more arguments during unification.
21188 We remove this mark in type_unification_real. */
21189 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
21190 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
21191 = ARGUMENT_PACK_ARGS (targ
);
21193 /* We have some incomplete argument packs. */
21200 if (!push_tinst_level (fn
, explicit_targs
))
21202 excessive_deduction_depth
= true;
21205 ++processing_template_decl
;
21206 input_location
= DECL_SOURCE_LOCATION (fn
);
21207 /* Ignore any access checks; we'll see them again in
21208 instantiate_template and they might have the wrong
21209 access path at this point. */
21210 push_deferring_access_checks (dk_deferred
);
21211 tsubst_flags_t ecomplain
= complain
| tf_partial
| tf_fndecl_type
;
21212 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
, ecomplain
, NULL_TREE
);
21213 pop_deferring_access_checks ();
21214 input_location
= loc
;
21215 --processing_template_decl
;
21216 pop_tinst_level ();
21218 if (fntype
== error_mark_node
)
21222 /* Place the explicitly specified arguments in TARGS. */
21223 explicit_targs
= INNERMOST_TEMPLATE_ARGS (explicit_targs
);
21224 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
21225 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
21226 if (!incomplete
&& CHECKING_P
21227 && !NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
21228 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
21229 (targs
, NUM_TMPL_ARGS (explicit_targs
));
21232 if (return_type
&& strict
!= DEDUCE_CALL
)
21234 tree
*new_args
= XALLOCAVEC (tree
, nargs
+ 1);
21235 new_args
[0] = return_type
;
21236 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
21244 /* Never do unification on the 'this' parameter. */
21245 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
21247 if (return_type
&& strict
== DEDUCE_CALL
)
21249 /* We're deducing for a call to the result of a template conversion
21250 function. The parms we really want are in return_type. */
21251 if (INDIRECT_TYPE_P (return_type
))
21252 return_type
= TREE_TYPE (return_type
);
21253 parms
= TYPE_ARG_TYPES (return_type
);
21255 else if (return_type
)
21257 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
21260 /* We allow incomplete unification without an error message here
21261 because the standard doesn't seem to explicitly prohibit it. Our
21262 callers must be ready to deal with unification failures in any
21265 /* If we aren't explaining yet, push tinst context so we can see where
21266 any errors (e.g. from class instantiations triggered by instantiation
21267 of default template arguments) come from. If we are explaining, this
21268 context is redundant. */
21269 if (!explain_p
&& !push_tinst_level (fn
, targs
))
21271 excessive_deduction_depth
= true;
21275 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
21276 full_targs
, parms
, args
, nargs
, /*subr=*/0,
21277 strict
, &checks
, explain_p
);
21279 pop_tinst_level ();
21283 /* Now that we have bindings for all of the template arguments,
21284 ensure that the arguments deduced for the template template
21285 parameters have compatible template parameter lists. We cannot
21286 check this property before we have deduced all template
21287 arguments, because the template parameter types of a template
21288 template parameter might depend on prior template parameters
21289 deduced after the template template parameter. The following
21290 ill-formed example illustrates this issue:
21292 template<typename T, template<T> class C> void f(C<5>, T);
21294 template<int N> struct X {};
21297 f(X<5>(), 5l); // error: template argument deduction fails
21300 The template parameter list of 'C' depends on the template type
21301 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
21302 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
21303 time that we deduce 'C'. */
21304 if (!template_template_parm_bindings_ok_p
21305 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
21307 unify_inconsistent_template_template_parameters (explain_p
);
21313 /* CWG2369: Check satisfaction before non-deducible conversions. */
21314 if (!constraints_satisfied_p (fn
, targs
))
21317 diagnose_constraints (DECL_SOURCE_LOCATION (fn
), fn
, targs
);
21321 /* DR 1391: All parameters have args, now check non-dependent parms for
21322 convertibility. We don't do this if all args were explicitly specified,
21323 as the standard says that we substitute explicit args immediately. */
21325 && check_non_deducible_conversions (parms
, args
, nargs
, fn
, strict
, flags
,
21329 /* All is well so far. Now, check:
21333 When all template arguments have been deduced, all uses of
21334 template parameters in nondeduced contexts are replaced with
21335 the corresponding deduced argument values. If the
21336 substitution results in an invalid type, as described above,
21337 type deduction fails. */
21338 if (!push_tinst_level (fn
, targs
))
21340 excessive_deduction_depth
= true;
21344 /* Also collect access checks from the instantiation. */
21345 reopen_deferring_access_checks (checks
);
21347 decl
= instantiate_template (fn
, targs
, complain
);
21349 checks
= get_deferred_access_checks ();
21350 pop_deferring_access_checks ();
21352 pop_tinst_level ();
21354 if (decl
== error_mark_node
)
21357 /* Now perform any access checks encountered during substitution. */
21358 push_access_scope (decl
);
21359 ok
= perform_access_checks (checks
, complain
);
21360 pop_access_scope (decl
);
21364 /* If we're looking for an exact match, check that what we got
21365 is indeed an exact match. It might not be if some template
21366 parameters are used in non-deduced contexts. But don't check
21367 for an exact match if we have dependent template arguments;
21368 in that case we're doing partial ordering, and we already know
21369 that we have two candidates that will provide the actual type. */
21370 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
21372 tree substed
= TREE_TYPE (decl
);
21376 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
21378 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
21379 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
21380 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
21382 unify_type_mismatch (explain_p
, args
[i
],
21383 TREE_VALUE (sarg
));
21388 /* After doing deduction with the inherited constructor, actually return an
21389 instantiation of the inheriting constructor. */
21391 decl
= instantiate_template (orig_fn
, targs
, complain
);
21397 if (excessive_deduction_depth
)
21399 if (deduction_depth
== 0)
21400 /* Reset once we're all the way out. */
21401 excessive_deduction_depth
= false;
21407 /* Adjust types before performing type deduction, as described in
21408 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
21409 sections are symmetric. PARM is the type of a function parameter
21410 or the return type of the conversion function. ARG is the type of
21411 the argument passed to the call, or the type of the value
21412 initialized with the result of the conversion function.
21413 ARG_EXPR is the original argument expression, which may be null. */
21416 maybe_adjust_types_for_deduction (unification_kind_t strict
,
21429 /* Swap PARM and ARG throughout the remainder of this
21430 function; the handling is precisely symmetric since PARM
21431 will initialize ARG rather than vice versa. */
21432 std::swap (parm
, arg
);
21436 /* Core issue #873: Do the DR606 thing (see below) for these cases,
21437 too, but here handle it by stripping the reference from PARM
21438 rather than by adding it to ARG. */
21439 if (TYPE_REF_P (*parm
)
21440 && TYPE_REF_IS_RVALUE (*parm
)
21441 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
21442 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
21443 && TYPE_REF_P (*arg
)
21444 && !TYPE_REF_IS_RVALUE (*arg
))
21445 *parm
= TREE_TYPE (*parm
);
21446 /* Nothing else to do in this case. */
21450 gcc_unreachable ();
21453 if (!TYPE_REF_P (*parm
))
21455 /* [temp.deduct.call]
21457 If P is not a reference type:
21459 --If A is an array type, the pointer type produced by the
21460 array-to-pointer standard conversion (_conv.array_) is
21461 used in place of A for type deduction; otherwise,
21463 --If A is a function type, the pointer type produced by
21464 the function-to-pointer standard conversion
21465 (_conv.func_) is used in place of A for type deduction;
21468 --If A is a cv-qualified type, the top level
21469 cv-qualifiers of A's type are ignored for type
21471 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
21472 *arg
= build_pointer_type (TREE_TYPE (*arg
));
21473 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
21474 *arg
= build_pointer_type (*arg
);
21476 *arg
= TYPE_MAIN_VARIANT (*arg
);
21479 /* [14.8.2.1/3 temp.deduct.call], "A forwarding reference is an rvalue
21480 reference to a cv-unqualified template parameter that does not represent a
21481 template parameter of a class template (during class template argument
21482 deduction (13.3.1.8)). If P is a forwarding reference and the argument is
21483 an lvalue, the type "lvalue reference to A" is used in place of A for type
21485 if (TYPE_REF_P (*parm
)
21486 && TYPE_REF_IS_RVALUE (*parm
)
21487 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
21488 && !TEMPLATE_TYPE_PARM_FOR_CLASS (TREE_TYPE (*parm
))
21489 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
21490 && (arg_expr
? lvalue_p (arg_expr
)
21491 /* try_one_overload doesn't provide an arg_expr, but
21492 functions are always lvalues. */
21493 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
21494 *arg
= build_reference_type (*arg
);
21496 /* [temp.deduct.call]
21498 If P is a cv-qualified type, the top level cv-qualifiers
21499 of P's type are ignored for type deduction. If P is a
21500 reference type, the type referred to by P is used for
21502 *parm
= TYPE_MAIN_VARIANT (*parm
);
21503 if (TYPE_REF_P (*parm
))
21505 *parm
= TREE_TYPE (*parm
);
21506 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
21509 /* DR 322. For conversion deduction, remove a reference type on parm
21510 too (which has been swapped into ARG). */
21511 if (strict
== DEDUCE_CONV
&& TYPE_REF_P (*arg
))
21512 *arg
= TREE_TYPE (*arg
);
21517 /* Subroutine of fn_type_unification. PARM is a function parameter of a
21518 template which doesn't contain any deducible template parameters; check if
21519 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
21520 unify_one_argument. */
21523 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
21524 int flags
, struct conversion
**conv_p
,
21530 type
= TREE_TYPE (arg
);
21534 if (same_type_p (parm
, type
))
21535 return unify_success (explain_p
);
21537 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
21538 if (strict
== DEDUCE_CONV
)
21540 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
, complain
))
21541 return unify_success (explain_p
);
21543 else if (strict
!= DEDUCE_EXACT
)
21546 tree conv_arg
= TYPE_P (arg
) ? NULL_TREE
: arg
;
21548 /* Avoid recalculating this in add_function_candidate. */
21550 = good_conversion (parm
, type
, conv_arg
, flags
, complain
));
21552 ok
= can_convert_arg (parm
, type
, conv_arg
, flags
, complain
);
21554 return unify_success (explain_p
);
21557 if (strict
== DEDUCE_EXACT
)
21558 return unify_type_mismatch (explain_p
, parm
, arg
);
21560 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
21563 static bool uses_deducible_template_parms (tree type
);
21565 /* Returns true iff the expression EXPR is one from which a template
21566 argument can be deduced. In other words, if it's an undecorated
21567 use of a template non-type parameter. */
21570 deducible_expression (tree expr
)
21572 /* Strip implicit conversions. */
21573 while (CONVERT_EXPR_P (expr
) || TREE_CODE (expr
) == VIEW_CONVERT_EXPR
)
21574 expr
= TREE_OPERAND (expr
, 0);
21575 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
21578 /* Returns true iff the array domain DOMAIN uses a template parameter in a
21579 deducible way; that is, if it has a max value of <PARM> - 1. */
21582 deducible_array_bound (tree domain
)
21584 if (domain
== NULL_TREE
)
21587 tree max
= TYPE_MAX_VALUE (domain
);
21588 if (TREE_CODE (max
) != MINUS_EXPR
)
21591 return deducible_expression (TREE_OPERAND (max
, 0));
21594 /* Returns true iff the template arguments ARGS use a template parameter
21595 in a deducible way. */
21598 deducible_template_args (tree args
)
21600 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
21603 tree elt
= TREE_VEC_ELT (args
, i
);
21604 if (ARGUMENT_PACK_P (elt
))
21605 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
21608 if (PACK_EXPANSION_P (elt
))
21609 elt
= PACK_EXPANSION_PATTERN (elt
);
21610 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
21612 else if (TYPE_P (elt
))
21613 deducible
= uses_deducible_template_parms (elt
);
21615 deducible
= deducible_expression (elt
);
21623 /* Returns true iff TYPE contains any deducible references to template
21624 parameters, as per 14.8.2.5. */
21627 uses_deducible_template_parms (tree type
)
21629 if (PACK_EXPANSION_P (type
))
21630 type
= PACK_EXPANSION_PATTERN (type
);
21637 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
21638 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
21644 if (INDIRECT_TYPE_P (type
))
21645 return uses_deducible_template_parms (TREE_TYPE (type
));
21647 /* T[integer-constant ]
21649 if (TREE_CODE (type
) == ARRAY_TYPE
)
21650 return (uses_deducible_template_parms (TREE_TYPE (type
))
21651 || deducible_array_bound (TYPE_DOMAIN (type
)));
21663 if (TYPE_PTRMEM_P (type
))
21664 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
21665 || (uses_deducible_template_parms
21666 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
21668 /* template-name <T> (where template-name refers to a class template)
21669 template-name <i> (where template-name refers to a class template) */
21670 if (CLASS_TYPE_P (type
)
21671 && CLASSTYPE_TEMPLATE_INFO (type
)
21672 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
21673 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
21674 (CLASSTYPE_TI_ARGS (type
)));
21679 if (FUNC_OR_METHOD_TYPE_P (type
))
21681 if (uses_deducible_template_parms (TREE_TYPE (type
)))
21683 tree parm
= TYPE_ARG_TYPES (type
);
21684 if (TREE_CODE (type
) == METHOD_TYPE
)
21685 parm
= TREE_CHAIN (parm
);
21686 for (; parm
; parm
= TREE_CHAIN (parm
))
21687 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
21694 /* Subroutine of type_unification_real and unify_pack_expansion to
21695 handle unification of a single P/A pair. Parameters are as
21696 for those functions. */
21699 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
21700 int subr
, unification_kind_t strict
,
21703 tree arg_expr
= NULL_TREE
;
21706 if (arg
== error_mark_node
|| parm
== error_mark_node
)
21707 return unify_invalid (explain_p
);
21708 if (arg
== unknown_type_node
)
21709 /* We can't deduce anything from this, but we might get all the
21710 template args from other function args. */
21711 return unify_success (explain_p
);
21713 /* Implicit conversions (Clause 4) will be performed on a function
21714 argument to convert it to the type of the corresponding function
21715 parameter if the parameter type contains no template-parameters that
21716 participate in template argument deduction. */
21717 if (strict
!= DEDUCE_EXACT
21718 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
21719 /* For function parameters with no deducible template parameters,
21720 just return. We'll check non-dependent conversions later. */
21721 return unify_success (explain_p
);
21726 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
21727 | UNIFY_ALLOW_MORE_CV_QUAL
21728 | UNIFY_ALLOW_DERIVED
);
21732 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
21736 arg_strict
= UNIFY_ALLOW_NONE
;
21740 gcc_unreachable ();
21743 /* We only do these transformations if this is the top-level
21744 parameter_type_list in a call or declaration matching; in other
21745 situations (nested function declarators, template argument lists) we
21746 won't be comparing a type to an expression, and we don't do any type
21752 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
21753 if (type_unknown_p (arg
))
21755 /* [temp.deduct.type] A template-argument can be
21756 deduced from a pointer to function or pointer
21757 to member function argument if the set of
21758 overloaded functions does not contain function
21759 templates and at most one of a set of
21760 overloaded functions provides a unique
21762 resolve_overloaded_unification (tparms
, targs
, parm
,
21764 arg_strict
, explain_p
);
21765 /* If a unique match was not found, this is a
21766 non-deduced context, so we still succeed. */
21767 return unify_success (explain_p
);
21771 arg
= unlowered_expr_type (arg
);
21772 if (arg
== error_mark_node
)
21773 return unify_invalid (explain_p
);
21777 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
21780 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
21781 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
21782 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
21784 /* For deduction from an init-list we need the actual list. */
21785 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
21787 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
21790 /* for_each_template_parm callback that always returns 0. */
21793 zero_r (tree
, void *)
21798 /* for_each_template_parm any_fn callback to handle deduction of a template
21799 type argument from the type of an array bound. */
21802 array_deduction_r (tree t
, void *data
)
21804 tree_pair_p d
= (tree_pair_p
)data
;
21805 tree
&tparms
= d
->purpose
;
21806 tree
&targs
= d
->value
;
21808 if (TREE_CODE (t
) == ARRAY_TYPE
)
21809 if (tree dom
= TYPE_DOMAIN (t
))
21810 if (tree max
= TYPE_MAX_VALUE (dom
))
21812 if (TREE_CODE (max
) == MINUS_EXPR
)
21813 max
= TREE_OPERAND (max
, 0);
21814 if (TREE_CODE (max
) == TEMPLATE_PARM_INDEX
)
21815 unify (tparms
, targs
, TREE_TYPE (max
), size_type_node
,
21816 UNIFY_ALLOW_NONE
, /*explain*/false);
21819 /* Keep walking. */
21823 /* Try to deduce any not-yet-deduced template type arguments from the type of
21824 an array bound. This is handled separately from unify because 14.8.2.5 says
21825 "The type of a type parameter is only deduced from an array bound if it is
21826 not otherwise deduced." */
21829 try_array_deduction (tree tparms
, tree targs
, tree parm
)
21831 tree_pair_s data
= { tparms
, targs
};
21832 hash_set
<tree
> visited
;
21833 for_each_template_parm (parm
, zero_r
, &data
, &visited
,
21834 /*nondeduced*/false, array_deduction_r
);
21837 /* Most parms like fn_type_unification.
21839 If SUBR is 1, we're being called recursively (to unify the
21840 arguments of a function or method parameter of a function
21843 CHECKS is a pointer to a vector of access checks encountered while
21844 substituting default template arguments. */
21847 type_unification_real (tree tparms
,
21851 unsigned int xnargs
,
21853 unification_kind_t strict
,
21854 vec
<deferred_access_check
, va_gc
> **checks
,
21859 int ntparms
= TREE_VEC_LENGTH (tparms
);
21860 int saw_undeduced
= 0;
21863 unsigned int nargs
;
21866 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
21867 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
21868 gcc_assert (ntparms
> 0);
21870 tree targs
= INNERMOST_TEMPLATE_ARGS (full_targs
);
21872 /* Reset the number of non-defaulted template arguments contained
21874 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
21882 while (parms
&& parms
!= void_list_node
21885 parm
= TREE_VALUE (parms
);
21887 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
21888 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
21889 /* For a function parameter pack that occurs at the end of the
21890 parameter-declaration-list, the type A of each remaining
21891 argument of the call is compared with the type P of the
21892 declarator-id of the function parameter pack. */
21895 parms
= TREE_CHAIN (parms
);
21897 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
21898 /* For a function parameter pack that does not occur at the
21899 end of the parameter-declaration-list, the type of the
21900 parameter pack is a non-deduced context. */
21906 if (unify_one_argument (tparms
, full_targs
, parm
, arg
, subr
, strict
,
21912 && parms
!= void_list_node
21913 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
21915 /* Unify the remaining arguments with the pack expansion type. */
21917 tree parmvec
= make_tree_vec (1);
21919 /* Allocate a TREE_VEC and copy in all of the arguments */
21920 argvec
= make_tree_vec (nargs
- ia
);
21921 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
21922 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
21924 /* Copy the parameter into parmvec. */
21925 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
21926 if (unify_pack_expansion (tparms
, full_targs
, parmvec
, argvec
, strict
,
21927 /*subr=*/subr
, explain_p
))
21930 /* Advance to the end of the list of parameters. */
21931 parms
= TREE_CHAIN (parms
);
21934 /* Fail if we've reached the end of the parm list, and more args
21935 are present, and the parm list isn't variadic. */
21936 if (ia
< nargs
&& parms
== void_list_node
)
21937 return unify_too_many_arguments (explain_p
, nargs
, ia
);
21938 /* Fail if parms are left and they don't have default values and
21939 they aren't all deduced as empty packs (c++/57397). This is
21940 consistent with sufficient_parms_p. */
21941 if (parms
&& parms
!= void_list_node
21942 && TREE_PURPOSE (parms
) == NULL_TREE
)
21944 unsigned int count
= nargs
;
21949 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
21952 p
= TREE_CHAIN (p
);
21954 while (p
&& p
!= void_list_node
);
21955 if (count
!= nargs
)
21956 return unify_too_few_arguments (explain_p
, ia
, count
,
21962 tsubst_flags_t complain
= (explain_p
21963 ? tf_warning_or_error
21965 bool tried_array_deduction
= (cxx_dialect
< cxx17
);
21967 for (i
= 0; i
< ntparms
; i
++)
21969 tree targ
= TREE_VEC_ELT (targs
, i
);
21970 tree tparm
= TREE_VEC_ELT (tparms
, i
);
21972 /* Clear the "incomplete" flags on all argument packs now so that
21973 substituting them into later default arguments works. */
21974 if (targ
&& ARGUMENT_PACK_P (targ
))
21976 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
21977 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
21980 if (targ
|| tparm
== error_mark_node
)
21982 tparm
= TREE_VALUE (tparm
);
21984 if (TREE_CODE (tparm
) == TYPE_DECL
21985 && !tried_array_deduction
)
21987 try_array_deduction (tparms
, targs
, xparms
);
21988 tried_array_deduction
= true;
21989 if (TREE_VEC_ELT (targs
, i
))
21993 /* If this is an undeduced nontype parameter that depends on
21994 a type parameter, try another pass; its type may have been
21995 deduced from a later argument than the one from which
21996 this parameter can be deduced. */
21997 if (TREE_CODE (tparm
) == PARM_DECL
21998 && uses_template_parms (TREE_TYPE (tparm
))
21999 && saw_undeduced
< 2)
22005 /* Core issue #226 (C++0x) [temp.deduct]:
22007 If a template argument has not been deduced, its
22008 default template argument, if any, is used.
22010 When we are in C++98 mode, TREE_PURPOSE will either
22011 be NULL_TREE or ERROR_MARK_NODE, so we do not need
22012 to explicitly check cxx_dialect here. */
22013 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
22014 /* OK, there is a default argument. Wait until after the
22015 conversion check to do substitution. */
22018 /* If the type parameter is a parameter pack, then it will
22019 be deduced to an empty parameter pack. */
22020 if (template_parameter_pack_p (tparm
))
22024 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
22026 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
22027 TREE_CONSTANT (arg
) = 1;
22030 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
22032 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
22034 TREE_VEC_ELT (targs
, i
) = arg
;
22038 return unify_parameter_deduction_failure (explain_p
, tparm
);
22041 /* Now substitute into the default template arguments. */
22042 for (i
= 0; i
< ntparms
; i
++)
22044 tree targ
= TREE_VEC_ELT (targs
, i
);
22045 tree tparm
= TREE_VEC_ELT (tparms
, i
);
22047 if (targ
|| tparm
== error_mark_node
)
22049 tree parm
= TREE_VALUE (tparm
);
22050 tree arg
= TREE_PURPOSE (tparm
);
22051 reopen_deferring_access_checks (*checks
);
22052 location_t save_loc
= input_location
;
22054 input_location
= DECL_SOURCE_LOCATION (parm
);
22056 if (saw_undeduced
== 1
22057 && TREE_CODE (parm
) == PARM_DECL
22058 && uses_template_parms (TREE_TYPE (parm
)))
22060 /* The type of this non-type parameter depends on undeduced
22061 parameters. Don't try to use its default argument yet,
22062 since we might deduce an argument for it on the next pass,
22063 but do check whether the arguments we already have cause
22064 substitution failure, so that that happens before we try
22065 later default arguments (78489). */
22066 ++processing_template_decl
;
22067 tree type
= tsubst (TREE_TYPE (parm
), full_targs
, complain
,
22069 --processing_template_decl
;
22070 if (type
== error_mark_node
)
22071 arg
= error_mark_node
;
22077 /* Even if the call is happening in template context, getting
22078 here means it's non-dependent, and a default argument is
22079 considered a separate definition under [temp.decls], so we can
22080 do this substitution without processing_template_decl. This
22081 is important if the default argument contains something that
22082 might be instantiation-dependent like access (87480). */
22083 processing_template_decl_sentinel s
;
22084 tree substed
= NULL_TREE
;
22085 if (saw_undeduced
== 1)
22087 /* First instatiate in template context, in case we still
22088 depend on undeduced template parameters. */
22089 ++processing_template_decl
;
22090 substed
= tsubst_template_arg (arg
, full_targs
, complain
,
22092 --processing_template_decl
;
22093 if (substed
!= error_mark_node
22094 && !uses_template_parms (substed
))
22095 /* We replaced all the tparms, substitute again out of
22096 template context. */
22097 substed
= NULL_TREE
;
22100 substed
= tsubst_template_arg (arg
, full_targs
, complain
,
22103 if (!uses_template_parms (substed
))
22104 arg
= convert_template_argument (parm
, substed
, full_targs
,
22105 complain
, i
, NULL_TREE
);
22106 else if (saw_undeduced
== 1)
22109 arg
= error_mark_node
;
22112 input_location
= save_loc
;
22113 *checks
= get_deferred_access_checks ();
22114 pop_deferring_access_checks ();
22116 if (arg
== error_mark_node
)
22120 TREE_VEC_ELT (targs
, i
) = arg
;
22121 /* The position of the first default template argument,
22122 is also the number of non-defaulted arguments in TARGS.
22124 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
22125 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
22129 if (saw_undeduced
++ == 1)
22133 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
22134 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
22136 return unify_success (explain_p
);
22139 /* Subroutine of type_unification_real. Args are like the variables
22140 at the call site. ARG is an overloaded function (or template-id);
22141 we try deducing template args from each of the overloads, and if
22142 only one succeeds, we go with that. Modifies TARGS and returns
22143 true on success. */
22146 resolve_overloaded_unification (tree tparms
,
22150 unification_kind_t strict
,
22154 tree tempargs
= copy_node (targs
);
22156 tree goodfn
= NULL_TREE
;
22159 if (TREE_CODE (arg
) == ADDR_EXPR
)
22161 arg
= TREE_OPERAND (arg
, 0);
22167 if (TREE_CODE (arg
) == COMPONENT_REF
)
22168 /* Handle `&x' where `x' is some static or non-static member
22170 arg
= TREE_OPERAND (arg
, 1);
22172 if (TREE_CODE (arg
) == OFFSET_REF
)
22173 arg
= TREE_OPERAND (arg
, 1);
22175 /* Strip baselink information. */
22176 if (BASELINK_P (arg
))
22177 arg
= BASELINK_FUNCTIONS (arg
);
22179 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
22181 /* If we got some explicit template args, we need to plug them into
22182 the affected templates before we try to unify, in case the
22183 explicit args will completely resolve the templates in question. */
22186 tree expl_subargs
= TREE_OPERAND (arg
, 1);
22187 arg
= TREE_OPERAND (arg
, 0);
22189 for (lkp_iterator
iter (arg
); iter
; ++iter
)
22192 tree subargs
, elem
;
22194 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
22197 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
22198 expl_subargs
, NULL_TREE
, tf_none
,
22199 /*require_all_args=*/true,
22200 /*use_default_args=*/true);
22201 if (subargs
!= error_mark_node
22202 && !any_dependent_template_arguments_p (subargs
))
22204 fn
= instantiate_template (fn
, subargs
, tf_none
);
22205 if (!constraints_satisfied_p (fn
))
22207 if (undeduced_auto_decl (fn
))
22209 /* Instantiate the function to deduce its return type. */
22211 instantiate_decl (fn
, /*defer*/false, /*class*/false);
22215 elem
= TREE_TYPE (fn
);
22216 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
22217 elem
, strict
, sub_strict
, addr_p
, explain_p
)
22218 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
22227 /* If no templates (or more than one) are fully resolved by the
22228 explicit arguments, this template-id is a non-deduced context; it
22229 could still be OK if we deduce all template arguments for the
22230 enclosing call through other arguments. */
22234 else if (!OVL_P (arg
))
22235 /* If ARG is, for example, "(0, &f)" then its type will be unknown
22236 -- but the deduction does not succeed because the expression is
22237 not just the function on its own. */
22240 for (lkp_iterator
iter (arg
); iter
; ++iter
)
22243 if (try_one_overload (tparms
, targs
, tempargs
, parm
, TREE_TYPE (fn
),
22244 strict
, sub_strict
, addr_p
, explain_p
)
22245 && (!goodfn
|| !decls_match (goodfn
, fn
)))
22252 /* [temp.deduct.type] A template-argument can be deduced from a pointer
22253 to function or pointer to member function argument if the set of
22254 overloaded functions does not contain function templates and at most
22255 one of a set of overloaded functions provides a unique match.
22257 So if we found multiple possibilities, we return success but don't
22258 deduce anything. */
22262 int i
= TREE_VEC_LENGTH (targs
);
22264 if (TREE_VEC_ELT (tempargs
, i
))
22266 tree old
= TREE_VEC_ELT (targs
, i
);
22267 tree new_
= TREE_VEC_ELT (tempargs
, i
);
22268 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
22269 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
22270 /* Don't forget explicit template arguments in a pack. */
22271 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
22272 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
22273 TREE_VEC_ELT (targs
, i
) = new_
;
22282 /* Core DR 115: In contexts where deduction is done and fails, or in
22283 contexts where deduction is not done, if a template argument list is
22284 specified and it, along with any default template arguments, identifies
22285 a single function template specialization, then the template-id is an
22286 lvalue for the function template specialization. */
22289 resolve_nondeduced_context (tree orig_expr
, tsubst_flags_t complain
)
22291 tree expr
, offset
, baselink
;
22294 if (!type_unknown_p (orig_expr
))
22299 offset
= NULL_TREE
;
22300 baselink
= NULL_TREE
;
22302 if (TREE_CODE (expr
) == ADDR_EXPR
)
22304 expr
= TREE_OPERAND (expr
, 0);
22307 if (TREE_CODE (expr
) == OFFSET_REF
)
22310 expr
= TREE_OPERAND (expr
, 1);
22312 if (BASELINK_P (expr
))
22315 expr
= BASELINK_FUNCTIONS (expr
);
22318 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
22321 tree goodfn
= NULL_TREE
;
22323 /* If we got some explicit template args, we need to plug them into
22324 the affected templates before we try to unify, in case the
22325 explicit args will completely resolve the templates in question. */
22327 tree expl_subargs
= TREE_OPERAND (expr
, 1);
22328 tree arg
= TREE_OPERAND (expr
, 0);
22329 tree badfn
= NULL_TREE
;
22330 tree badargs
= NULL_TREE
;
22332 for (lkp_iterator
iter (arg
); iter
; ++iter
)
22335 tree subargs
, elem
;
22337 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
22340 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
22341 expl_subargs
, NULL_TREE
, tf_none
,
22342 /*require_all_args=*/true,
22343 /*use_default_args=*/true);
22344 if (subargs
!= error_mark_node
22345 && !any_dependent_template_arguments_p (subargs
))
22347 elem
= instantiate_template (fn
, subargs
, tf_none
);
22348 if (elem
== error_mark_node
)
22353 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
))
22354 && constraints_satisfied_p (elem
))
22363 mark_used (goodfn
);
22366 expr
= build_baselink (BASELINK_BINFO (baselink
),
22367 BASELINK_ACCESS_BINFO (baselink
),
22368 expr
, BASELINK_OPTYPE (baselink
));
22372 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
22373 expr
= build_offset_ref (base
, expr
, addr
, complain
);
22376 expr
= cp_build_addr_expr (expr
, complain
);
22379 else if (good
== 0 && badargs
&& (complain
& tf_error
))
22380 /* There were no good options and at least one bad one, so let the
22381 user know what the problem is. */
22382 instantiate_template (badfn
, badargs
, complain
);
22387 /* As above, but error out if the expression remains overloaded. */
22390 resolve_nondeduced_context_or_error (tree exp
, tsubst_flags_t complain
)
22392 exp
= resolve_nondeduced_context (exp
, complain
);
22393 if (type_unknown_p (exp
))
22395 if (complain
& tf_error
)
22396 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
22397 return error_mark_node
;
22402 /* Subroutine of resolve_overloaded_unification; does deduction for a single
22403 overload. Fills TARGS with any deduced arguments, or error_mark_node if
22404 different overloads deduce different arguments for a given parm.
22405 ADDR_P is true if the expression for which deduction is being
22406 performed was of the form "& fn" rather than simply "fn".
22408 Returns 1 on success. */
22411 try_one_overload (tree tparms
,
22416 unification_kind_t strict
,
22425 if (arg
== error_mark_node
)
22428 /* [temp.deduct.type] A template-argument can be deduced from a pointer
22429 to function or pointer to member function argument if the set of
22430 overloaded functions does not contain function templates and at most
22431 one of a set of overloaded functions provides a unique match.
22433 So if this is a template, just return success. */
22435 if (uses_template_parms (arg
))
22438 if (TREE_CODE (arg
) == METHOD_TYPE
)
22439 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
22441 arg
= build_pointer_type (arg
);
22443 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
22445 /* We don't copy orig_targs for this because if we have already deduced
22446 some template args from previous args, unify would complain when we
22447 try to deduce a template parameter for the same argument, even though
22448 there isn't really a conflict. */
22449 nargs
= TREE_VEC_LENGTH (targs
);
22450 tempargs
= make_tree_vec (nargs
);
22452 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
22455 /* First make sure we didn't deduce anything that conflicts with
22456 explicitly specified args. */
22457 for (i
= nargs
; i
--; )
22459 tree elt
= TREE_VEC_ELT (tempargs
, i
);
22460 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
22464 else if (uses_template_parms (elt
))
22465 /* Since we're unifying against ourselves, we will fill in
22466 template args used in the function parm list with our own
22467 template parms. Discard them. */
22468 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
22469 else if (oldelt
&& ARGUMENT_PACK_P (oldelt
))
22471 /* Check that the argument at each index of the deduced argument pack
22472 is equivalent to the corresponding explicitly specified argument.
22473 We may have deduced more arguments than were explicitly specified,
22476 /* We used to assert ARGUMENT_PACK_INCOMPLETE_P (oldelt) here, but
22477 that's wrong if we deduce the same argument pack from multiple
22478 function arguments: it's only incomplete the first time. */
22480 tree explicit_pack
= ARGUMENT_PACK_ARGS (oldelt
);
22481 tree deduced_pack
= ARGUMENT_PACK_ARGS (elt
);
22483 if (TREE_VEC_LENGTH (deduced_pack
)
22484 < TREE_VEC_LENGTH (explicit_pack
))
22487 for (int j
= 0; j
< TREE_VEC_LENGTH (explicit_pack
); j
++)
22488 if (!template_args_equal (TREE_VEC_ELT (explicit_pack
, j
),
22489 TREE_VEC_ELT (deduced_pack
, j
)))
22492 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
22496 for (i
= nargs
; i
--; )
22498 tree elt
= TREE_VEC_ELT (tempargs
, i
);
22501 TREE_VEC_ELT (targs
, i
) = elt
;
22507 /* PARM is a template class (perhaps with unbound template
22508 parameters). ARG is a fully instantiated type. If ARG can be
22509 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
22510 TARGS are as for unify. */
22513 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
22516 tree copy_of_targs
;
22518 if (!CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
22520 else if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22521 /* Matches anything. */;
22522 else if (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
22523 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
)))
22526 /* We need to make a new template argument vector for the call to
22527 unify. If we used TARGS, we'd clutter it up with the result of
22528 the attempted unification, even if this class didn't work out.
22529 We also don't want to commit ourselves to all the unifications
22530 we've already done, since unification is supposed to be done on
22531 an argument-by-argument basis. In other words, consider the
22532 following pathological case:
22534 template <int I, int J, int K>
22537 template <int I, int J>
22538 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
22540 template <int I, int J, int K>
22541 void f(S<I, J, K>, S<I, I, I>);
22550 Now, by the time we consider the unification involving `s2', we
22551 already know that we must have `f<0, 0, 0>'. But, even though
22552 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
22553 because there are two ways to unify base classes of S<0, 1, 2>
22554 with S<I, I, I>. If we kept the already deduced knowledge, we
22555 would reject the possibility I=1. */
22556 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
22558 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22560 if (unify_bound_ttp_args (tparms
, copy_of_targs
, parm
, arg
, explain_p
))
22565 /* If unification failed, we're done. */
22566 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
22567 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
22573 /* Given a template type PARM and a class type ARG, find the unique
22574 base type in ARG that is an instance of PARM. We do not examine
22575 ARG itself; only its base-classes. If there is not exactly one
22576 appropriate base class, return NULL_TREE. PARM may be the type of
22577 a partial specialization, as well as a plain template type. Used
22580 static enum template_base_result
22581 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
22582 bool explain_p
, tree
*result
)
22584 tree rval
= NULL_TREE
;
22587 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
22589 binfo
= TYPE_BINFO (complete_type (arg
));
22592 /* The type could not be completed. */
22593 *result
= NULL_TREE
;
22594 return tbr_incomplete_type
;
22597 /* Walk in inheritance graph order. The search order is not
22598 important, and this avoids multiple walks of virtual bases. */
22599 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
22601 tree r
= try_class_unification (tparms
, targs
, parm
,
22602 BINFO_TYPE (binfo
), explain_p
);
22606 /* If there is more than one satisfactory baseclass, then:
22610 If they yield more than one possible deduced A, the type
22614 if (rval
&& !same_type_p (r
, rval
))
22616 *result
= NULL_TREE
;
22617 return tbr_ambiguous_baseclass
;
22625 return tbr_success
;
22628 /* Returns the level of DECL, which declares a template parameter. */
22631 template_decl_level (tree decl
)
22633 switch (TREE_CODE (decl
))
22636 case TEMPLATE_DECL
:
22637 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
22640 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
22643 gcc_unreachable ();
22648 /* Decide whether ARG can be unified with PARM, considering only the
22649 cv-qualifiers of each type, given STRICT as documented for unify.
22650 Returns nonzero iff the unification is OK on that basis. */
22653 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
22655 int arg_quals
= cp_type_quals (arg
);
22656 int parm_quals
= cp_type_quals (parm
);
22658 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
22659 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
22661 /* Although a CVR qualifier is ignored when being applied to a
22662 substituted template parameter ([8.3.2]/1 for example), that
22663 does not allow us to unify "const T" with "int&" because both
22664 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
22665 It is ok when we're allowing additional CV qualifiers
22666 at the outer level [14.8.2.1]/3,1st bullet. */
22667 if ((TYPE_REF_P (arg
)
22668 || FUNC_OR_METHOD_TYPE_P (arg
))
22669 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
22672 if ((!INDIRECT_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
22673 && (parm_quals
& TYPE_QUAL_RESTRICT
))
22677 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
22678 && (arg_quals
& parm_quals
) != parm_quals
)
22681 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
22682 && (parm_quals
& arg_quals
) != arg_quals
)
22688 /* Determines the LEVEL and INDEX for the template parameter PARM. */
22690 template_parm_level_and_index (tree parm
, int* level
, int* index
)
22692 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
22693 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
22694 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22696 *index
= TEMPLATE_TYPE_IDX (parm
);
22697 *level
= TEMPLATE_TYPE_LEVEL (parm
);
22701 *index
= TEMPLATE_PARM_IDX (parm
);
22702 *level
= TEMPLATE_PARM_LEVEL (parm
);
22706 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
22708 if (unify (TP, TA, P, A, S, EP)) \
22712 /* Unifies the remaining arguments in PACKED_ARGS with the pack
22713 expansion at the end of PACKED_PARMS. Returns 0 if the type
22714 deduction succeeds, 1 otherwise. STRICT is the same as in
22715 fn_type_unification. CALL_ARGS_P is true iff PACKED_ARGS is actually a
22716 function call argument list. We'll need to adjust the arguments to make them
22717 types. SUBR tells us if this is from a recursive call to
22718 type_unification_real, or for comparing two template argument
22722 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
22723 tree packed_args
, unification_kind_t strict
,
22724 bool subr
, bool explain_p
)
22727 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
22728 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
22729 tree pack
, packs
= NULL_TREE
;
22730 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
22732 /* Add in any args remembered from an earlier partial instantiation. */
22733 targs
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (parm
), targs
);
22734 int levels
= TMPL_ARGS_DEPTH (targs
);
22736 packed_args
= expand_template_argument_pack (packed_args
);
22738 int len
= TREE_VEC_LENGTH (packed_args
);
22740 /* Determine the parameter packs we will be deducing from the
22741 pattern, and record their current deductions. */
22742 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
22743 pack
; pack
= TREE_CHAIN (pack
))
22745 tree parm_pack
= TREE_VALUE (pack
);
22748 /* Only template parameter packs can be deduced, not e.g. function
22749 parameter packs or __bases or __integer_pack. */
22750 if (!TEMPLATE_PARM_P (parm_pack
))
22753 /* Determine the index and level of this parameter pack. */
22754 template_parm_level_and_index (parm_pack
, &level
, &idx
);
22755 if (level
< levels
)
22758 /* Keep track of the parameter packs and their corresponding
22760 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
22761 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
22764 /* Loop through all of the arguments that have not yet been
22765 unified and unify each with the pattern. */
22766 for (i
= start
; i
< len
; i
++)
22769 bool any_explicit
= false;
22770 tree arg
= TREE_VEC_ELT (packed_args
, i
);
22772 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
22773 or the element of its argument pack at the current index if
22774 this argument was explicitly specified. */
22775 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
22779 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
22782 if (TREE_VALUE (pack
)
22783 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
22784 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
22786 any_explicit
= true;
22787 arg
= TREE_VEC_ELT (pargs
, i
- start
);
22789 TMPL_ARG (targs
, level
, idx
) = arg
;
22792 /* If we had explicit template arguments, substitute them into the
22793 pattern before deduction. */
22796 /* Some arguments might still be unspecified or dependent. */
22798 ++processing_template_decl
;
22799 dependent
= any_dependent_template_arguments_p (targs
);
22801 --processing_template_decl
;
22802 parm
= tsubst (pattern
, targs
,
22803 explain_p
? tf_warning_or_error
: tf_none
,
22806 --processing_template_decl
;
22807 if (parm
== error_mark_node
)
22813 /* Unify the pattern with the current argument. */
22814 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
22818 /* For each parameter pack, collect the deduced value. */
22819 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
22822 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
22824 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
22825 TMPL_ARG (targs
, level
, idx
);
22829 /* Verify that the results of unification with the parameter packs
22830 produce results consistent with what we've seen before, and make
22831 the deduced argument packs available. */
22832 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
22834 tree old_pack
= TREE_VALUE (pack
);
22835 tree new_args
= TREE_TYPE (pack
);
22836 int i
, len
= TREE_VEC_LENGTH (new_args
);
22838 bool nondeduced_p
= false;
22840 /* By default keep the original deduced argument pack.
22841 If necessary, more specific code is going to update the
22842 resulting deduced argument later down in this function. */
22843 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
22844 TMPL_ARG (targs
, level
, idx
) = old_pack
;
22846 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
22847 actually deduce anything. */
22848 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
22849 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
22850 nondeduced_p
= true;
22854 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
22856 /* If we had fewer function args than explicit template args,
22857 just use the explicits. */
22858 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
22859 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
22860 if (len
< explicit_len
)
22861 new_args
= explicit_args
;
22867 /* Build the deduced *_ARGUMENT_PACK. */
22868 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
22870 result
= make_node (NONTYPE_ARGUMENT_PACK
);
22871 TREE_CONSTANT (result
) = 1;
22874 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
22876 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
22878 /* Note the deduced argument packs for this parameter
22880 TMPL_ARG (targs
, level
, idx
) = result
;
22882 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
22883 && (ARGUMENT_PACK_ARGS (old_pack
)
22884 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
22886 /* We only had the explicitly-provided arguments before, but
22887 now we have a complete set of arguments. */
22888 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
22890 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
22891 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
22892 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
22896 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
22897 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
22898 temp_override
<int> ovl (TREE_VEC_LENGTH (old_args
));
22899 /* During template argument deduction for the aggregate deduction
22900 candidate, the number of elements in a trailing parameter pack
22901 is only deduced from the number of remaining function
22902 arguments if it is not otherwise deduced. */
22903 if (cxx_dialect
>= cxx20
22904 && TREE_VEC_LENGTH (new_args
) < TREE_VEC_LENGTH (old_args
)
22905 && builtin_guide_p (TPARMS_PRIMARY_TEMPLATE (tparms
)))
22906 TREE_VEC_LENGTH (old_args
) = TREE_VEC_LENGTH (new_args
);
22907 if (!comp_template_args (old_args
, new_args
,
22908 &bad_old_arg
, &bad_new_arg
))
22909 /* Inconsistent unification of this parameter pack. */
22910 return unify_parameter_pack_inconsistent (explain_p
,
22916 return unify_success (explain_p
);
22919 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
22920 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
22921 parameters and return value are as for unify. */
22924 unify_array_domain (tree tparms
, tree targs
,
22925 tree parm_dom
, tree arg_dom
,
22933 /* Our representation of array types uses "N - 1" as the
22934 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
22935 not an integer constant. We cannot unify arbitrarily
22936 complex expressions, so we eliminate the MINUS_EXPRs
22938 parm_max
= TYPE_MAX_VALUE (parm_dom
);
22939 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
22942 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
22943 parm_max
= TREE_OPERAND (parm_max
, 0);
22945 arg_max
= TYPE_MAX_VALUE (arg_dom
);
22946 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
22949 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
22950 trying to unify the type of a variable with the type
22951 of a template parameter. For example:
22953 template <unsigned int N>
22954 void f (char (&) [N]);
22961 Here, the type of the ARG will be "int [g(i)]", and
22962 may be a SAVE_EXPR, etc. */
22963 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
22964 return unify_vla_arg (explain_p
, arg_dom
);
22965 arg_max
= TREE_OPERAND (arg_max
, 0);
22968 /* If only one of the bounds used a MINUS_EXPR, compensate
22969 by adding one to the other bound. */
22970 if (parm_cst
&& !arg_cst
)
22971 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
22975 else if (arg_cst
&& !parm_cst
)
22976 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
22981 return unify (tparms
, targs
, parm_max
, arg_max
,
22982 UNIFY_ALLOW_INTEGER
, explain_p
);
22985 /* Returns whether T, a P or A in unify, is a type, template or expression. */
22987 enum pa_kind_t
{ pa_type
, pa_tmpl
, pa_expr
};
22992 if (PACK_EXPANSION_P (t
))
22993 t
= PACK_EXPANSION_PATTERN (t
);
22994 if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
22995 || TREE_CODE (t
) == UNBOUND_CLASS_TEMPLATE
22996 || DECL_TYPE_TEMPLATE_P (t
))
22998 else if (TYPE_P (t
))
23004 /* Deduce the value of template parameters. TPARMS is the (innermost)
23005 set of template parameters to a template. TARGS is the bindings
23006 for those template parameters, as determined thus far; TARGS may
23007 include template arguments for outer levels of template parameters
23008 as well. PARM is a parameter to a template function, or a
23009 subcomponent of that parameter; ARG is the corresponding argument.
23010 This function attempts to match PARM with ARG in a manner
23011 consistent with the existing assignments in TARGS. If more values
23012 are deduced, then TARGS is updated.
23014 Returns 0 if the type deduction succeeds, 1 otherwise. The
23015 parameter STRICT is a bitwise or of the following flags:
23018 Require an exact match between PARM and ARG.
23019 UNIFY_ALLOW_MORE_CV_QUAL:
23020 Allow the deduced ARG to be more cv-qualified (by qualification
23021 conversion) than ARG.
23022 UNIFY_ALLOW_LESS_CV_QUAL:
23023 Allow the deduced ARG to be less cv-qualified than ARG.
23024 UNIFY_ALLOW_DERIVED:
23025 Allow the deduced ARG to be a template base class of ARG,
23026 or a pointer to a template base class of the type pointed to by
23028 UNIFY_ALLOW_INTEGER:
23029 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
23030 case for more information.
23031 UNIFY_ALLOW_OUTER_LEVEL:
23032 This is the outermost level of a deduction. Used to determine validity
23033 of qualification conversions. A valid qualification conversion must
23034 have const qualified pointers leading up to the inner type which
23035 requires additional CV quals, except at the outer level, where const
23036 is not required [conv.qual]. It would be normal to set this flag in
23037 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
23038 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
23039 This is the outermost level of a deduction, and PARM can be more CV
23040 qualified at this point.
23041 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
23042 This is the outermost level of a deduction, and PARM can be less CV
23043 qualified at this point. */
23046 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
23052 int strict_in
= strict
;
23053 tsubst_flags_t complain
= (explain_p
23054 ? tf_warning_or_error
23057 /* I don't think this will do the right thing with respect to types.
23058 But the only case I've seen it in so far has been array bounds, where
23059 signedness is the only information lost, and I think that will be
23060 okay. VIEW_CONVERT_EXPR can appear with class NTTP, thanks to
23061 finish_id_expression_1, and are also OK. */
23062 while (CONVERT_EXPR_P (parm
) || TREE_CODE (parm
) == VIEW_CONVERT_EXPR
)
23063 parm
= TREE_OPERAND (parm
, 0);
23065 if (arg
== error_mark_node
)
23066 return unify_invalid (explain_p
);
23067 if (arg
== unknown_type_node
23068 || arg
== init_list_type_node
)
23069 /* We can't deduce anything from this, but we might get all the
23070 template args from other function args. */
23071 return unify_success (explain_p
);
23073 if (parm
== any_targ_node
|| arg
== any_targ_node
)
23074 return unify_success (explain_p
);
23076 /* If PARM uses template parameters, then we can't bail out here,
23077 even if ARG == PARM, since we won't record unifications for the
23078 template parameters. We might need them if we're trying to
23079 figure out which of two things is more specialized. */
23080 if (arg
== parm
&& !uses_template_parms (parm
))
23081 return unify_success (explain_p
);
23083 /* Handle init lists early, so the rest of the function can assume
23084 we're dealing with a type. */
23085 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
23089 tree orig_parm
= parm
;
23091 if (!is_std_init_list (parm
)
23092 && TREE_CODE (parm
) != ARRAY_TYPE
)
23093 /* We can only deduce from an initializer list argument if the
23094 parameter is std::initializer_list or an array; otherwise this
23095 is a non-deduced context. */
23096 return unify_success (explain_p
);
23098 if (TREE_CODE (parm
) == ARRAY_TYPE
)
23099 elttype
= TREE_TYPE (parm
);
23102 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
23103 /* Deduction is defined in terms of a single type, so just punt
23104 on the (bizarre) std::initializer_list<T...>. */
23105 if (PACK_EXPANSION_P (elttype
))
23106 return unify_success (explain_p
);
23109 if (strict
!= DEDUCE_EXACT
23110 && TYPE_P (elttype
)
23111 && !uses_deducible_template_parms (elttype
))
23112 /* If ELTTYPE has no deducible template parms, skip deduction from
23113 the list elements. */;
23115 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
23117 int elt_strict
= strict
;
23119 if (elt
== error_mark_node
)
23120 return unify_invalid (explain_p
);
23122 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
23124 tree type
= TREE_TYPE (elt
);
23125 if (type
== error_mark_node
)
23126 return unify_invalid (explain_p
);
23127 /* It should only be possible to get here for a call. */
23128 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
23129 elt_strict
|= maybe_adjust_types_for_deduction
23130 (DEDUCE_CALL
, &elttype
, &type
, elt
);
23134 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
23138 if (TREE_CODE (parm
) == ARRAY_TYPE
23139 && deducible_array_bound (TYPE_DOMAIN (parm
)))
23141 /* Also deduce from the length of the initializer list. */
23142 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
23143 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
23144 if (idx
== error_mark_node
)
23145 return unify_invalid (explain_p
);
23146 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
23150 /* If the std::initializer_list<T> deduction worked, replace the
23151 deduced A with std::initializer_list<A>. */
23152 if (orig_parm
!= parm
)
23154 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
23155 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
23156 targ
= listify (targ
);
23157 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
23159 return unify_success (explain_p
);
23162 /* If parm and arg aren't the same kind of thing (template, type, or
23163 expression), fail early. */
23164 if (pa_kind (parm
) != pa_kind (arg
))
23165 return unify_invalid (explain_p
);
23167 /* Immediately reject some pairs that won't unify because of
23168 cv-qualification mismatches. */
23169 if (TREE_CODE (arg
) == TREE_CODE (parm
)
23171 /* It is the elements of the array which hold the cv quals of an array
23172 type, and the elements might be template type parms. We'll check
23173 when we recurse. */
23174 && TREE_CODE (arg
) != ARRAY_TYPE
23175 /* We check the cv-qualifiers when unifying with template type
23176 parameters below. We want to allow ARG `const T' to unify with
23177 PARM `T' for example, when computing which of two templates
23178 is more specialized, for example. */
23179 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
23180 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
23181 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
23183 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
23184 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
23185 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
23186 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
23187 strict
&= ~UNIFY_ALLOW_DERIVED
;
23188 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
23189 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
23191 switch (TREE_CODE (parm
))
23193 case TYPENAME_TYPE
:
23195 case UNBOUND_CLASS_TEMPLATE
:
23196 /* In a type which contains a nested-name-specifier, template
23197 argument values cannot be deduced for template parameters used
23198 within the nested-name-specifier. */
23199 return unify_success (explain_p
);
23201 case TEMPLATE_TYPE_PARM
:
23202 case TEMPLATE_TEMPLATE_PARM
:
23203 case BOUND_TEMPLATE_TEMPLATE_PARM
:
23204 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
23205 if (error_operand_p (tparm
))
23206 return unify_invalid (explain_p
);
23208 if (TEMPLATE_TYPE_LEVEL (parm
)
23209 != template_decl_level (tparm
))
23210 /* The PARM is not one we're trying to unify. Just check
23211 to see if it matches ARG. */
23213 if (TREE_CODE (arg
) == TREE_CODE (parm
)
23214 && (is_auto (parm
) ? is_auto (arg
)
23215 : same_type_p (parm
, arg
)))
23216 return unify_success (explain_p
);
23218 return unify_type_mismatch (explain_p
, parm
, arg
);
23220 idx
= TEMPLATE_TYPE_IDX (parm
);
23221 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
23222 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
23223 if (error_operand_p (tparm
))
23224 return unify_invalid (explain_p
);
23226 /* Check for mixed types and values. */
23227 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
23228 && TREE_CODE (tparm
) != TYPE_DECL
)
23229 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
23230 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
23231 gcc_unreachable ();
23233 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
23235 if ((strict_in
& UNIFY_ALLOW_DERIVED
)
23236 && CLASS_TYPE_P (arg
))
23238 /* First try to match ARG directly. */
23239 tree t
= try_class_unification (tparms
, targs
, parm
, arg
,
23243 /* Otherwise, look for a suitable base of ARG, as below. */
23244 enum template_base_result r
;
23245 r
= get_template_base (tparms
, targs
, parm
, arg
,
23248 return unify_no_common_base (explain_p
, r
, parm
, arg
);
23252 /* ARG must be constructed from a template class or a template
23253 template parameter. */
23254 else if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
23255 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
23256 return unify_template_deduction_failure (explain_p
, parm
, arg
);
23258 /* Deduce arguments T, i from TT<T> or TT<i>. */
23259 if (unify_bound_ttp_args (tparms
, targs
, parm
, arg
, explain_p
))
23262 arg
= TYPE_TI_TEMPLATE (arg
);
23264 /* Fall through to deduce template name. */
23267 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
23268 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
23270 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
23272 /* Simple cases: Value already set, does match or doesn't. */
23273 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
23274 return unify_success (explain_p
);
23276 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
23280 /* If PARM is `const T' and ARG is only `int', we don't have
23281 a match unless we are allowing additional qualification.
23282 If ARG is `const int' and PARM is just `T' that's OK;
23283 that binds `const int' to `T'. */
23284 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
23286 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
23288 /* Consider the case where ARG is `const volatile int' and
23289 PARM is `const T'. Then, T should be `volatile int'. */
23290 arg
= cp_build_qualified_type_real
23291 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
23292 if (arg
== error_mark_node
)
23293 return unify_invalid (explain_p
);
23295 /* Simple cases: Value already set, does match or doesn't. */
23296 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
23297 return unify_success (explain_p
);
23299 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
23301 /* Make sure that ARG is not a variable-sized array. (Note
23302 that were talking about variable-sized arrays (like
23303 `int[n]'), rather than arrays of unknown size (like
23304 `int[]').) We'll get very confused by such a type since
23305 the bound of the array is not constant, and therefore
23306 not mangleable. Besides, such types are not allowed in
23307 ISO C++, so we can do as we please here. We do allow
23308 them for 'auto' deduction, since that isn't ABI-exposed. */
23309 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
23310 return unify_vla_arg (explain_p
, arg
);
23312 /* Strip typedefs as in convert_template_argument. */
23313 arg
= canonicalize_type_argument (arg
, tf_none
);
23316 /* If ARG is a parameter pack or an expansion, we cannot unify
23317 against it unless PARM is also a parameter pack. */
23318 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
23319 && !template_parameter_pack_p (parm
))
23320 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
23322 /* If the argument deduction results is a METHOD_TYPE,
23323 then there is a problem.
23324 METHOD_TYPE doesn't map to any real C++ type the result of
23325 the deduction cannot be of that type. */
23326 if (TREE_CODE (arg
) == METHOD_TYPE
)
23327 return unify_method_type_error (explain_p
, arg
);
23329 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
23330 return unify_success (explain_p
);
23332 case TEMPLATE_PARM_INDEX
:
23333 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
23334 if (error_operand_p (tparm
))
23335 return unify_invalid (explain_p
);
23337 if (TEMPLATE_PARM_LEVEL (parm
)
23338 != template_decl_level (tparm
))
23340 /* The PARM is not one we're trying to unify. Just check
23341 to see if it matches ARG. */
23342 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
23343 && cp_tree_equal (parm
, arg
));
23345 unify_expression_unequal (explain_p
, parm
, arg
);
23349 idx
= TEMPLATE_PARM_IDX (parm
);
23350 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
23354 if ((strict
& UNIFY_ALLOW_INTEGER
)
23355 && TREE_TYPE (targ
) && TREE_TYPE (arg
)
23356 && CP_INTEGRAL_TYPE_P (TREE_TYPE (targ
)))
23357 /* We're deducing from an array bound, the type doesn't matter. */
23358 arg
= fold_convert (TREE_TYPE (targ
), arg
);
23359 int x
= !cp_tree_equal (targ
, arg
);
23361 unify_inconsistency (explain_p
, parm
, targ
, arg
);
23365 /* [temp.deduct.type] If, in the declaration of a function template
23366 with a non-type template-parameter, the non-type
23367 template-parameter is used in an expression in the function
23368 parameter-list and, if the corresponding template-argument is
23369 deduced, the template-argument type shall match the type of the
23370 template-parameter exactly, except that a template-argument
23371 deduced from an array bound may be of any integral type.
23372 The non-type parameter might use already deduced type parameters. */
23373 tparm
= TREE_TYPE (parm
);
23374 if (TEMPLATE_PARM_LEVEL (parm
) > TMPL_ARGS_DEPTH (targs
))
23375 /* We don't have enough levels of args to do any substitution. This
23376 can happen in the context of -fnew-ttp-matching. */;
23379 ++processing_template_decl
;
23380 tparm
= tsubst (tparm
, targs
, tf_none
, NULL_TREE
);
23381 --processing_template_decl
;
23383 if (tree a
= type_uses_auto (tparm
))
23385 tparm
= do_auto_deduction (tparm
, arg
, a
, complain
, adc_unify
);
23386 if (tparm
== error_mark_node
)
23391 if (!TREE_TYPE (arg
))
23392 /* Template-parameter dependent expression. Just accept it for now.
23393 It will later be processed in convert_template_argument. */
23395 else if (same_type_ignoring_top_level_qualifiers_p
23396 (non_reference (TREE_TYPE (arg
)),
23397 non_reference (tparm
)))
23398 /* OK. Ignore top-level quals here because a class-type template
23399 parameter object is const. */;
23400 else if ((strict
& UNIFY_ALLOW_INTEGER
)
23401 && CP_INTEGRAL_TYPE_P (tparm
))
23402 /* Convert the ARG to the type of PARM; the deduced non-type
23403 template argument must exactly match the types of the
23404 corresponding parameter. */
23405 arg
= fold (build_nop (tparm
, arg
));
23406 else if (uses_template_parms (tparm
))
23408 /* We haven't deduced the type of this parameter yet. */
23409 if (cxx_dialect
>= cxx17
23410 /* We deduce from array bounds in try_array_deduction. */
23411 && !(strict
& UNIFY_ALLOW_INTEGER
))
23413 /* Deduce it from the non-type argument. */
23414 tree atype
= TREE_TYPE (arg
);
23415 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
23417 UNIFY_ALLOW_NONE
, explain_p
);
23420 /* Try again later. */
23421 return unify_success (explain_p
);
23424 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
23426 /* If ARG is a parameter pack or an expansion, we cannot unify
23427 against it unless PARM is also a parameter pack. */
23428 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
23429 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
23430 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
23433 bool removed_attr
= false;
23434 arg
= strip_typedefs_expr (arg
, &removed_attr
);
23436 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
23437 return unify_success (explain_p
);
23441 /* A pointer-to-member constant can be unified only with
23442 another constant. */
23443 if (TREE_CODE (arg
) != PTRMEM_CST
)
23444 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
23446 /* Just unify the class member. It would be useless (and possibly
23447 wrong, depending on the strict flags) to unify also
23448 PTRMEM_CST_CLASS, because we want to be sure that both parm and
23449 arg refer to the same variable, even if through different
23450 classes. For instance:
23452 struct A { int x; };
23455 Unification of &A::x and &B::x must succeed. */
23456 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
23457 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
23462 if (!TYPE_PTR_P (arg
))
23463 return unify_type_mismatch (explain_p
, parm
, arg
);
23465 /* [temp.deduct.call]
23467 A can be another pointer or pointer to member type that can
23468 be converted to the deduced A via a qualification
23469 conversion (_conv.qual_).
23471 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
23472 This will allow for additional cv-qualification of the
23473 pointed-to types if appropriate. */
23475 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
23476 /* The derived-to-base conversion only persists through one
23477 level of pointers. */
23478 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
23480 return unify (tparms
, targs
, TREE_TYPE (parm
),
23481 TREE_TYPE (arg
), strict
, explain_p
);
23484 case REFERENCE_TYPE
:
23485 if (!TYPE_REF_P (arg
))
23486 return unify_type_mismatch (explain_p
, parm
, arg
);
23487 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
23488 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
23491 if (TREE_CODE (arg
) != ARRAY_TYPE
)
23492 return unify_type_mismatch (explain_p
, parm
, arg
);
23493 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
23494 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
23495 return unify_type_mismatch (explain_p
, parm
, arg
);
23496 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
23497 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
23498 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
23499 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
23500 TYPE_DOMAIN (arg
), explain_p
);
23501 return unify_success (explain_p
);
23508 case ENUMERAL_TYPE
:
23511 if (TREE_CODE (arg
) != TREE_CODE (parm
))
23512 return unify_type_mismatch (explain_p
, parm
, arg
);
23514 /* We have already checked cv-qualification at the top of the
23516 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
23517 return unify_type_mismatch (explain_p
, parm
, arg
);
23519 /* As far as unification is concerned, this wins. Later checks
23520 will invalidate it if necessary. */
23521 return unify_success (explain_p
);
23523 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
23524 /* Type INTEGER_CST can come from ordinary constant template args. */
23526 while (CONVERT_EXPR_P (arg
))
23527 arg
= TREE_OPERAND (arg
, 0);
23529 if (TREE_CODE (arg
) != INTEGER_CST
)
23530 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
23531 return (tree_int_cst_equal (parm
, arg
)
23532 ? unify_success (explain_p
)
23533 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
23537 int i
, len
, argslen
;
23538 int parm_variadic_p
= 0;
23540 if (TREE_CODE (arg
) != TREE_VEC
)
23541 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
23543 len
= TREE_VEC_LENGTH (parm
);
23544 argslen
= TREE_VEC_LENGTH (arg
);
23546 /* Check for pack expansions in the parameters. */
23547 for (i
= 0; i
< len
; ++i
)
23549 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
23552 /* We can unify against something with a trailing
23554 parm_variadic_p
= 1;
23556 /* [temp.deduct.type]/9: If the template argument list of
23557 P contains a pack expansion that is not the last
23558 template argument, the entire template argument list
23559 is a non-deduced context. */
23560 return unify_success (explain_p
);
23564 /* If we don't have enough arguments to satisfy the parameters
23565 (not counting the pack expression at the end), or we have
23566 too many arguments for a parameter list that doesn't end in
23567 a pack expression, we can't unify. */
23568 if (parm_variadic_p
23569 ? argslen
< len
- parm_variadic_p
23571 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
23573 /* Unify all of the parameters that precede the (optional)
23574 pack expression. */
23575 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
23577 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
23578 TREE_VEC_ELT (parm
, i
),
23579 TREE_VEC_ELT (arg
, i
),
23580 UNIFY_ALLOW_NONE
, explain_p
);
23582 if (parm_variadic_p
)
23583 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
23585 /*subr=*/true, explain_p
);
23586 return unify_success (explain_p
);
23591 if (TREE_CODE (arg
) != TREE_CODE (parm
))
23592 return unify_type_mismatch (explain_p
, parm
, arg
);
23594 if (TYPE_PTRMEMFUNC_P (parm
))
23596 if (!TYPE_PTRMEMFUNC_P (arg
))
23597 return unify_type_mismatch (explain_p
, parm
, arg
);
23599 return unify (tparms
, targs
,
23600 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
23601 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
23602 strict
, explain_p
);
23604 else if (TYPE_PTRMEMFUNC_P (arg
))
23605 return unify_type_mismatch (explain_p
, parm
, arg
);
23607 if (CLASSTYPE_TEMPLATE_INFO (parm
))
23609 tree t
= NULL_TREE
;
23611 if (strict_in
& UNIFY_ALLOW_DERIVED
)
23613 /* First, we try to unify the PARM and ARG directly. */
23614 t
= try_class_unification (tparms
, targs
,
23615 parm
, arg
, explain_p
);
23619 /* Fallback to the special case allowed in
23620 [temp.deduct.call]:
23622 If P is a class, and P has the form
23623 template-id, then A can be a derived class of
23624 the deduced A. Likewise, if P is a pointer to
23625 a class of the form template-id, A can be a
23626 pointer to a derived class pointed to by the
23628 enum template_base_result r
;
23629 r
= get_template_base (tparms
, targs
, parm
, arg
,
23634 /* Don't give the derived diagnostic if we're
23635 already dealing with the same template. */
23637 = (CLASSTYPE_TEMPLATE_INFO (arg
)
23638 && (CLASSTYPE_TI_TEMPLATE (parm
)
23639 == CLASSTYPE_TI_TEMPLATE (arg
)));
23640 return unify_no_common_base (explain_p
&& !same_template
,
23645 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
23646 && (CLASSTYPE_TI_TEMPLATE (parm
)
23647 == CLASSTYPE_TI_TEMPLATE (arg
)))
23648 /* Perhaps PARM is something like S<U> and ARG is S<int>.
23649 Then, we should unify `int' and `U'. */
23652 /* There's no chance of unification succeeding. */
23653 return unify_type_mismatch (explain_p
, parm
, arg
);
23655 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
23656 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
23658 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
23659 return unify_type_mismatch (explain_p
, parm
, arg
);
23660 return unify_success (explain_p
);
23663 case FUNCTION_TYPE
:
23665 unsigned int nargs
;
23670 if (TREE_CODE (arg
) != TREE_CODE (parm
))
23671 return unify_type_mismatch (explain_p
, parm
, arg
);
23673 /* CV qualifications for methods can never be deduced, they must
23674 match exactly. We need to check them explicitly here,
23675 because type_unification_real treats them as any other
23676 cv-qualified parameter. */
23677 if (TREE_CODE (parm
) == METHOD_TYPE
23678 && (!check_cv_quals_for_unify
23680 class_of_this_parm (arg
),
23681 class_of_this_parm (parm
))))
23682 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
23683 if (TREE_CODE (arg
) == FUNCTION_TYPE
23684 && type_memfn_quals (parm
) != type_memfn_quals (arg
))
23685 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
23686 if (type_memfn_rqual (parm
) != type_memfn_rqual (arg
))
23687 return unify_type_mismatch (explain_p
, parm
, arg
);
23689 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
23690 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
23692 nargs
= list_length (TYPE_ARG_TYPES (arg
));
23693 args
= XALLOCAVEC (tree
, nargs
);
23694 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
23695 a
!= NULL_TREE
&& a
!= void_list_node
;
23696 a
= TREE_CHAIN (a
), ++i
)
23697 args
[i
] = TREE_VALUE (a
);
23700 if (type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
23701 args
, nargs
, 1, DEDUCE_EXACT
,
23705 if (flag_noexcept_type
)
23707 tree pspec
= TYPE_RAISES_EXCEPTIONS (parm
);
23708 tree aspec
= canonical_eh_spec (TYPE_RAISES_EXCEPTIONS (arg
));
23709 if (pspec
== NULL_TREE
) pspec
= noexcept_false_spec
;
23710 if (aspec
== NULL_TREE
) aspec
= noexcept_false_spec
;
23711 if (TREE_PURPOSE (pspec
) && TREE_PURPOSE (aspec
)
23712 && uses_template_parms (TREE_PURPOSE (pspec
)))
23713 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_PURPOSE (pspec
),
23714 TREE_PURPOSE (aspec
),
23715 UNIFY_ALLOW_NONE
, explain_p
);
23716 else if (nothrow_spec_p (pspec
) && !nothrow_spec_p (aspec
))
23717 return unify_type_mismatch (explain_p
, parm
, arg
);
23724 /* Unify a pointer to member with a pointer to member function, which
23725 deduces the type of the member as a function type. */
23726 if (TYPE_PTRMEMFUNC_P (arg
))
23728 /* Check top-level cv qualifiers */
23729 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
23730 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
23732 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
23733 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
23734 UNIFY_ALLOW_NONE
, explain_p
);
23736 /* Determine the type of the function we are unifying against. */
23737 tree fntype
= static_fn_type (arg
);
23739 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
23742 if (TREE_CODE (arg
) != OFFSET_TYPE
)
23743 return unify_type_mismatch (explain_p
, parm
, arg
);
23744 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
23745 TYPE_OFFSET_BASETYPE (arg
),
23746 UNIFY_ALLOW_NONE
, explain_p
);
23747 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
23748 strict
, explain_p
);
23751 if (DECL_TEMPLATE_PARM_P (parm
))
23752 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
23753 if (arg
!= scalar_constant_value (parm
))
23754 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
23755 return unify_success (explain_p
);
23758 case TEMPLATE_DECL
:
23759 /* Matched cases are handled by the ARG == PARM test above. */
23760 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
23763 /* We might get a variable as a non-type template argument in parm if the
23764 corresponding parameter is type-dependent. Make any necessary
23765 adjustments based on whether arg is a reference. */
23766 if (CONSTANT_CLASS_P (arg
))
23767 parm
= fold_non_dependent_expr (parm
, complain
);
23768 else if (REFERENCE_REF_P (arg
))
23770 tree sub
= TREE_OPERAND (arg
, 0);
23772 if (TREE_CODE (sub
) == ADDR_EXPR
)
23773 arg
= TREE_OPERAND (sub
, 0);
23775 /* Now use the normal expression code to check whether they match. */
23778 case TYPE_ARGUMENT_PACK
:
23779 case NONTYPE_ARGUMENT_PACK
:
23780 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
23781 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
23784 case DECLTYPE_TYPE
:
23785 case UNDERLYING_TYPE
:
23786 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
23787 or UNDERLYING_TYPE nodes. */
23788 return unify_success (explain_p
);
23791 /* Unification fails if we hit an error node. */
23792 return unify_invalid (explain_p
);
23795 if (REFERENCE_REF_P (parm
))
23797 bool pexp
= PACK_EXPANSION_P (arg
);
23799 arg
= PACK_EXPANSION_PATTERN (arg
);
23800 if (REFERENCE_REF_P (arg
))
23801 arg
= TREE_OPERAND (arg
, 0);
23803 arg
= make_pack_expansion (arg
, complain
);
23804 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
23805 strict
, explain_p
);
23810 /* An unresolved overload is a nondeduced context. */
23811 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
23812 return unify_success (explain_p
);
23813 gcc_assert (EXPR_P (parm
)
23814 || COMPOUND_LITERAL_P (parm
)
23815 || TREE_CODE (parm
) == TRAIT_EXPR
);
23817 /* We must be looking at an expression. This can happen with
23821 void foo(S<I>, S<I + 2>);
23825 template<typename T>
23826 void foo(A<T, T{}>);
23828 This is a "non-deduced context":
23832 The non-deduced contexts are:
23834 --A non-type template argument or an array bound in which
23835 a subexpression references a template parameter.
23837 In these cases, we assume deduction succeeded, but don't
23838 actually infer any unifications. */
23840 if (!uses_template_parms (parm
)
23841 && !template_args_equal (parm
, arg
))
23842 return unify_expression_unequal (explain_p
, parm
, arg
);
23844 return unify_success (explain_p
);
23847 #undef RECUR_AND_CHECK_FAILURE
23849 /* Note that DECL can be defined in this translation unit, if
23853 mark_definable (tree decl
)
23856 DECL_NOT_REALLY_EXTERN (decl
) = 1;
23857 FOR_EACH_CLONE (clone
, decl
)
23858 DECL_NOT_REALLY_EXTERN (clone
) = 1;
23861 /* Called if RESULT is explicitly instantiated, or is a member of an
23862 explicitly instantiated class. */
23865 mark_decl_instantiated (tree result
, int extern_p
)
23867 SET_DECL_EXPLICIT_INSTANTIATION (result
);
23869 /* If this entity has already been written out, it's too late to
23870 make any modifications. */
23871 if (TREE_ASM_WRITTEN (result
))
23874 /* For anonymous namespace we don't need to do anything. */
23875 if (decl_anon_ns_mem_p (result
))
23877 gcc_assert (!TREE_PUBLIC (result
));
23881 if (TREE_CODE (result
) != FUNCTION_DECL
)
23882 /* The TREE_PUBLIC flag for function declarations will have been
23883 set correctly by tsubst. */
23884 TREE_PUBLIC (result
) = 1;
23886 /* This might have been set by an earlier implicit instantiation. */
23887 DECL_COMDAT (result
) = 0;
23890 DECL_NOT_REALLY_EXTERN (result
) = 0;
23893 mark_definable (result
);
23894 mark_needed (result
);
23895 /* Always make artificials weak. */
23896 if (DECL_ARTIFICIAL (result
) && flag_weak
)
23897 comdat_linkage (result
);
23898 /* For WIN32 we also want to put explicit instantiations in
23899 linkonce sections. */
23900 else if (TREE_PUBLIC (result
))
23901 maybe_make_one_only (result
);
23902 if (TREE_CODE (result
) == FUNCTION_DECL
23903 && DECL_TEMPLATE_INSTANTIATED (result
))
23904 /* If the function has already been instantiated, clear DECL_EXTERNAL,
23905 since start_preparsed_function wouldn't have if we had an earlier
23906 extern explicit instantiation. */
23907 DECL_EXTERNAL (result
) = 0;
23910 /* If EXTERN_P, then this function will not be emitted -- unless
23911 followed by an explicit instantiation, at which point its linkage
23912 will be adjusted. If !EXTERN_P, then this function will be
23913 emitted here. In neither circumstance do we want
23914 import_export_decl to adjust the linkage. */
23915 DECL_INTERFACE_KNOWN (result
) = 1;
23918 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
23919 important template arguments. If any are missing, we check whether
23920 they're important by using error_mark_node for substituting into any
23921 args that were used for partial ordering (the ones between ARGS and END)
23922 and seeing if it bubbles up. */
23925 check_undeduced_parms (tree targs
, tree args
, tree end
)
23927 bool found
= false;
23929 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
23930 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
23933 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
23937 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
23938 if (substed
== error_mark_node
)
23944 /* Given two function templates PAT1 and PAT2, return:
23946 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
23947 -1 if PAT2 is more specialized than PAT1.
23948 0 if neither is more specialized.
23950 LEN indicates the number of parameters we should consider
23951 (defaulted parameters should not be considered).
23953 The 1998 std underspecified function template partial ordering, and
23954 DR214 addresses the issue. We take pairs of arguments, one from
23955 each of the templates, and deduce them against each other. One of
23956 the templates will be more specialized if all the *other*
23957 template's arguments deduce against its arguments and at least one
23958 of its arguments *does* *not* deduce against the other template's
23959 corresponding argument. Deduction is done as for class templates.
23960 The arguments used in deduction have reference and top level cv
23961 qualifiers removed. Iff both arguments were originally reference
23962 types *and* deduction succeeds in both directions, an lvalue reference
23963 wins against an rvalue reference and otherwise the template
23964 with the more cv-qualified argument wins for that pairing (if
23965 neither is more cv-qualified, they both are equal). Unlike regular
23966 deduction, after all the arguments have been deduced in this way,
23967 we do *not* verify the deduced template argument values can be
23968 substituted into non-deduced contexts.
23970 The logic can be a bit confusing here, because we look at deduce1 and
23971 targs1 to see if pat2 is at least as specialized, and vice versa; if we
23972 can find template arguments for pat1 to make arg1 look like arg2, that
23973 means that arg2 is at least as specialized as arg1. */
23976 more_specialized_fn (tree pat1
, tree pat2
, int len
)
23978 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
23979 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
23980 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
23981 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
23982 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
23983 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
23984 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
23985 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
23986 tree origs1
, origs2
;
23987 bool lose1
= false;
23988 bool lose2
= false;
23990 /* Remove the this parameter from non-static member functions. If
23991 one is a non-static member function and the other is not a static
23992 member function, remove the first parameter from that function
23993 also. This situation occurs for operator functions where we
23994 locate both a member function (with this pointer) and non-member
23995 operator (with explicit first operand). */
23996 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
23998 len
--; /* LEN is the number of significant arguments for DECL1 */
23999 args1
= TREE_CHAIN (args1
);
24000 if (!DECL_STATIC_FUNCTION_P (decl2
))
24001 args2
= TREE_CHAIN (args2
);
24003 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
24005 args2
= TREE_CHAIN (args2
);
24006 if (!DECL_STATIC_FUNCTION_P (decl1
))
24009 args1
= TREE_CHAIN (args1
);
24013 /* If only one is a conversion operator, they are unordered. */
24014 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
24017 /* Consider the return type for a conversion function */
24018 if (DECL_CONV_FN_P (decl1
))
24020 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
24021 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
24025 processing_template_decl
++;
24031 /* Stop when an ellipsis is seen. */
24032 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
24034 tree arg1
= TREE_VALUE (args1
);
24035 tree arg2
= TREE_VALUE (args2
);
24036 int deduce1
, deduce2
;
24042 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
24043 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
24045 /* When both arguments are pack expansions, we need only
24046 unify the patterns themselves. */
24047 arg1
= PACK_EXPANSION_PATTERN (arg1
);
24048 arg2
= PACK_EXPANSION_PATTERN (arg2
);
24050 /* This is the last comparison we need to do. */
24054 if (TYPE_REF_P (arg1
))
24056 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
24057 arg1
= TREE_TYPE (arg1
);
24058 quals1
= cp_type_quals (arg1
);
24061 if (TYPE_REF_P (arg2
))
24063 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
24064 arg2
= TREE_TYPE (arg2
);
24065 quals2
= cp_type_quals (arg2
);
24068 arg1
= TYPE_MAIN_VARIANT (arg1
);
24069 arg2
= TYPE_MAIN_VARIANT (arg2
);
24071 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
24073 int i
, len2
= remaining_arguments (args2
);
24074 tree parmvec
= make_tree_vec (1);
24075 tree argvec
= make_tree_vec (len2
);
24078 /* Setup the parameter vector, which contains only ARG1. */
24079 TREE_VEC_ELT (parmvec
, 0) = arg1
;
24081 /* Setup the argument vector, which contains the remaining
24083 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
24084 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
24086 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
24087 argvec
, DEDUCE_EXACT
,
24088 /*subr=*/true, /*explain_p=*/false)
24091 /* We cannot deduce in the other direction, because ARG1 is
24092 a pack expansion but ARG2 is not. */
24095 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
24097 int i
, len1
= remaining_arguments (args1
);
24098 tree parmvec
= make_tree_vec (1);
24099 tree argvec
= make_tree_vec (len1
);
24102 /* Setup the parameter vector, which contains only ARG1. */
24103 TREE_VEC_ELT (parmvec
, 0) = arg2
;
24105 /* Setup the argument vector, which contains the remaining
24107 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
24108 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
24110 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
24111 argvec
, DEDUCE_EXACT
,
24112 /*subr=*/true, /*explain_p=*/false)
24115 /* We cannot deduce in the other direction, because ARG2 is
24116 a pack expansion but ARG1 is not.*/
24122 /* The normal case, where neither argument is a pack
24124 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
24125 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
24127 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
24128 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
24132 /* If we couldn't deduce arguments for tparms1 to make arg1 match
24133 arg2, then arg2 is not as specialized as arg1. */
24139 /* "If, for a given type, deduction succeeds in both directions
24140 (i.e., the types are identical after the transformations above)
24141 and both P and A were reference types (before being replaced with
24142 the type referred to above):
24143 - if the type from the argument template was an lvalue reference and
24144 the type from the parameter template was not, the argument type is
24145 considered to be more specialized than the other; otherwise,
24146 - if the type from the argument template is more cv-qualified
24147 than the type from the parameter template (as described above),
24148 the argument type is considered to be more specialized than the other;
24150 - neither type is more specialized than the other." */
24152 if (deduce1
&& deduce2
)
24154 if (ref1
&& ref2
&& ref1
!= ref2
)
24161 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
24163 if ((quals1
& quals2
) == quals2
)
24165 if ((quals1
& quals2
) == quals1
)
24170 if (lose1
&& lose2
)
24171 /* We've failed to deduce something in either direction.
24172 These must be unordered. */
24175 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
24176 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
24177 /* We have already processed all of the arguments in our
24178 handing of the pack expansion type. */
24181 args1
= TREE_CHAIN (args1
);
24182 args2
= TREE_CHAIN (args2
);
24185 /* "In most cases, all template parameters must have values in order for
24186 deduction to succeed, but for partial ordering purposes a template
24187 parameter may remain without a value provided it is not used in the
24188 types being used for partial ordering."
24190 Thus, if we are missing any of the targs1 we need to substitute into
24191 origs1, then pat2 is not as specialized as pat1. This can happen when
24192 there is a nondeduced context. */
24193 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
24195 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
24198 processing_template_decl
--;
24200 /* If both deductions succeed, the partial ordering selects the more
24201 constrained template. */
24202 /* P2113: If the corresponding template-parameters of the
24203 template-parameter-lists are not equivalent ([temp.over.link]) or if
24204 the function parameters that positionally correspond between the two
24205 templates are not of the same type, neither template is more
24206 specialized than the other. */
24207 if (!lose1
&& !lose2
24208 && comp_template_parms (DECL_TEMPLATE_PARMS (pat1
),
24209 DECL_TEMPLATE_PARMS (pat2
))
24210 && compparms (origs1
, origs2
))
24212 int winner
= more_constrained (decl1
, decl2
);
24215 else if (winner
< 0)
24219 /* All things being equal, if the next argument is a pack expansion
24220 for one function but not for the other, prefer the
24221 non-variadic function. FIXME this is bogus; see c++/41958. */
24223 && args1
&& TREE_VALUE (args1
)
24224 && args2
&& TREE_VALUE (args2
))
24226 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
24227 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
24230 if (lose1
== lose2
)
24238 /* Determine which of two partial specializations of TMPL is more
24241 PAT1 is a TREE_LIST whose TREE_VALUE is the TEMPLATE_DECL corresponding
24242 to the first partial specialization. The TREE_PURPOSE is the
24243 innermost set of template parameters for the partial
24244 specialization. PAT2 is similar, but for the second template.
24246 Return 1 if the first partial specialization is more specialized;
24247 -1 if the second is more specialized; 0 if neither is more
24250 See [temp.class.order] for information about determining which of
24251 two templates is more specialized. */
24254 more_specialized_partial_spec (tree tmpl
, tree pat1
, tree pat2
)
24258 bool any_deductions
= false;
24260 tree tmpl1
= TREE_VALUE (pat1
);
24261 tree tmpl2
= TREE_VALUE (pat2
);
24262 tree specargs1
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl1
)));
24263 tree specargs2
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl2
)));
24265 /* Just like what happens for functions, if we are ordering between
24266 different template specializations, we may encounter dependent
24267 types in the arguments, and we need our dependency check functions
24268 to behave correctly. */
24269 ++processing_template_decl
;
24270 targs
= get_partial_spec_bindings (tmpl
, tmpl1
, specargs2
);
24274 any_deductions
= true;
24277 targs
= get_partial_spec_bindings (tmpl
, tmpl2
, specargs1
);
24281 any_deductions
= true;
24283 --processing_template_decl
;
24285 /* If both deductions succeed, the partial ordering selects the more
24286 constrained template. */
24287 if (!winner
&& any_deductions
)
24288 winner
= more_constrained (tmpl1
, tmpl2
);
24290 /* In the case of a tie where at least one of the templates
24291 has a parameter pack at the end, the template with the most
24292 non-packed parameters wins. */
24295 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
24296 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
24298 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
24299 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
24300 int len1
= TREE_VEC_LENGTH (args1
);
24301 int len2
= TREE_VEC_LENGTH (args2
);
24303 /* We don't count the pack expansion at the end. */
24304 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
24306 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
24311 else if (len1
< len2
)
24318 /* Return the template arguments that will produce the function signature
24319 DECL from the function template FN, with the explicit template
24320 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
24321 also match. Return NULL_TREE if no satisfactory arguments could be
24325 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
24327 int ntparms
= DECL_NTPARMS (fn
);
24328 tree targs
= make_tree_vec (ntparms
);
24329 tree decl_type
= TREE_TYPE (decl
);
24330 tree decl_arg_types
;
24332 unsigned int nargs
, ix
;
24335 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
24337 /* Never do unification on the 'this' parameter. */
24338 decl_arg_types
= skip_artificial_parms_for (decl
,
24339 TYPE_ARG_TYPES (decl_type
));
24341 nargs
= list_length (decl_arg_types
);
24342 args
= XALLOCAVEC (tree
, nargs
);
24343 for (arg
= decl_arg_types
, ix
= 0;
24344 arg
!= NULL_TREE
&& arg
!= void_list_node
;
24345 arg
= TREE_CHAIN (arg
), ++ix
)
24346 args
[ix
] = TREE_VALUE (arg
);
24348 if (fn_type_unification (fn
, explicit_args
, targs
,
24350 (check_rettype
|| DECL_CONV_FN_P (fn
)
24351 ? TREE_TYPE (decl_type
) : NULL_TREE
),
24352 DEDUCE_EXACT
, LOOKUP_NORMAL
, NULL
,
24353 /*explain_p=*/false,
24355 == error_mark_node
)
24361 /* Return the innermost template arguments that, when applied to a partial
24362 specialization SPEC_TMPL of TMPL, yield the ARGS.
24364 For example, suppose we have:
24366 template <class T, class U> struct S {};
24367 template <class T> struct S<T*, int> {};
24369 Then, suppose we want to get `S<double*, int>'. SPEC_TMPL will be the
24370 partial specialization and the ARGS will be {double*, int}. The resulting
24371 vector will be {double}, indicating that `T' is bound to `double'. */
24374 get_partial_spec_bindings (tree tmpl
, tree spec_tmpl
, tree args
)
24376 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
24378 = TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (spec_tmpl
)));
24379 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
24381 tree innermost_deduced_args
;
24383 innermost_deduced_args
= make_tree_vec (ntparms
);
24384 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
24386 deduced_args
= copy_node (args
);
24387 SET_TMPL_ARGS_LEVEL (deduced_args
,
24388 TMPL_ARGS_DEPTH (deduced_args
),
24389 innermost_deduced_args
);
24392 deduced_args
= innermost_deduced_args
;
24394 bool tried_array_deduction
= (cxx_dialect
< cxx17
);
24396 if (unify (tparms
, deduced_args
,
24397 INNERMOST_TEMPLATE_ARGS (spec_args
),
24398 INNERMOST_TEMPLATE_ARGS (args
),
24399 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
24402 for (i
= 0; i
< ntparms
; ++i
)
24403 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
24405 if (!tried_array_deduction
)
24407 try_array_deduction (tparms
, innermost_deduced_args
,
24408 INNERMOST_TEMPLATE_ARGS (spec_args
));
24409 tried_array_deduction
= true;
24410 if (TREE_VEC_ELT (innermost_deduced_args
, i
))
24416 if (!push_tinst_level (spec_tmpl
, deduced_args
))
24418 excessive_deduction_depth
= true;
24422 /* Verify that nondeduced template arguments agree with the type
24423 obtained from argument deduction.
24427 struct A { typedef int X; };
24428 template <class T, class U> struct C {};
24429 template <class T> struct C<T, typename T::X> {};
24431 Then with the instantiation `C<A, int>', we can deduce that
24432 `T' is `A' but unify () does not check whether `typename T::X'
24434 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
24436 if (spec_args
!= error_mark_node
)
24437 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
24438 INNERMOST_TEMPLATE_ARGS (spec_args
),
24439 tmpl
, tf_none
, false, false);
24441 pop_tinst_level ();
24443 if (spec_args
== error_mark_node
24444 /* We only need to check the innermost arguments; the other
24445 arguments will always agree. */
24446 || !comp_template_args_porder (INNERMOST_TEMPLATE_ARGS (spec_args
),
24447 INNERMOST_TEMPLATE_ARGS (args
)))
24450 /* Now that we have bindings for all of the template arguments,
24451 ensure that the arguments deduced for the template template
24452 parameters have compatible template parameter lists. See the use
24453 of template_template_parm_bindings_ok_p in fn_type_unification
24454 for more information. */
24455 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
24458 return deduced_args
;
24461 // Compare two function templates T1 and T2 by deducing bindings
24462 // from one against the other. If both deductions succeed, compare
24463 // constraints to see which is more constrained.
24465 more_specialized_inst (tree t1
, tree t2
)
24470 if (get_bindings (t1
, DECL_TEMPLATE_RESULT (t2
), NULL_TREE
, true))
24476 if (get_bindings (t2
, DECL_TEMPLATE_RESULT (t1
), NULL_TREE
, true))
24482 // If both deductions succeed, then one may be more constrained.
24483 if (count
== 2 && fate
== 0)
24484 fate
= more_constrained (t1
, t2
);
24489 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
24490 Return the TREE_LIST node with the most specialized template, if
24491 any. If there is no most specialized template, the error_mark_node
24494 Note that this function does not look at, or modify, the
24495 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
24496 returned is one of the elements of INSTANTIATIONS, callers may
24497 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
24498 and retrieve it from the value returned. */
24501 most_specialized_instantiation (tree templates
)
24505 ++processing_template_decl
;
24508 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
24510 gcc_assert (TREE_VALUE (champ
) != TREE_VALUE (fn
));
24511 int fate
= more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
));
24516 /* Equally specialized, move to next function. If there
24517 is no next function, nothing's most specialized. */
24518 fn
= TREE_CHAIN (fn
);
24526 /* Now verify that champ is better than everything earlier in the
24527 instantiation list. */
24528 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
)) {
24529 if (more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
)) != 1)
24536 processing_template_decl
--;
24539 return error_mark_node
;
24544 /* If DECL is a specialization of some template, return the most
24545 general such template. Otherwise, returns NULL_TREE.
24547 For example, given:
24549 template <class T> struct S { template <class U> void f(U); };
24551 if TMPL is `template <class U> void S<int>::f(U)' this will return
24552 the full template. This function will not trace past partial
24553 specializations, however. For example, given in addition:
24555 template <class T> struct S<T*> { template <class U> void f(U); };
24557 if TMPL is `template <class U> void S<int*>::f(U)' this will return
24558 `template <class T> template <class U> S<T*>::f(U)'. */
24561 most_general_template (tree decl
)
24563 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
24565 if (tree tinfo
= get_template_info (decl
))
24566 decl
= TI_TEMPLATE (tinfo
);
24567 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
24568 template friend, or a FIELD_DECL for a capture pack. */
24569 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
24573 /* Look for more and more general templates. */
24574 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
24576 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
24577 (See cp-tree.h for details.) */
24578 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
24581 if (CLASS_TYPE_P (TREE_TYPE (decl
))
24582 && !TYPE_DECL_ALIAS_P (TYPE_NAME (TREE_TYPE (decl
)))
24583 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
24586 /* Stop if we run into an explicitly specialized class template. */
24587 if (!DECL_NAMESPACE_SCOPE_P (decl
)
24588 && DECL_CONTEXT (decl
)
24589 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
24592 decl
= DECL_TI_TEMPLATE (decl
);
24598 /* Return the most specialized of the template partial specializations
24599 which can produce TARGET, a specialization of some class or variable
24600 template. The value returned is actually a TREE_LIST; the TREE_VALUE is
24601 a TEMPLATE_DECL node corresponding to the partial specialization, while
24602 the TREE_PURPOSE is the set of template arguments that must be
24603 substituted into the template pattern in order to generate TARGET.
24605 If the choice of partial specialization is ambiguous, a diagnostic
24606 is issued, and the error_mark_node is returned. If there are no
24607 partial specializations matching TARGET, then NULL_TREE is
24608 returned, indicating that the primary template should be used. */
24611 most_specialized_partial_spec (tree target
, tsubst_flags_t complain
)
24613 tree list
= NULL_TREE
;
24618 tree outer_args
= NULL_TREE
;
24621 if (TYPE_P (target
))
24623 tree tinfo
= CLASSTYPE_TEMPLATE_INFO (target
);
24624 tmpl
= TI_TEMPLATE (tinfo
);
24625 args
= TI_ARGS (tinfo
);
24627 else if (TREE_CODE (target
) == TEMPLATE_ID_EXPR
)
24629 tmpl
= TREE_OPERAND (target
, 0);
24630 args
= TREE_OPERAND (target
, 1);
24632 else if (VAR_P (target
))
24634 tree tinfo
= DECL_TEMPLATE_INFO (target
);
24635 tmpl
= TI_TEMPLATE (tinfo
);
24636 args
= TI_ARGS (tinfo
);
24639 gcc_unreachable ();
24641 tree main_tmpl
= most_general_template (tmpl
);
24643 /* For determining which partial specialization to use, only the
24644 innermost args are interesting. */
24645 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
24647 outer_args
= strip_innermost_template_args (args
, 1);
24648 args
= INNERMOST_TEMPLATE_ARGS (args
);
24651 /* The caller hasn't called push_to_top_level yet, but we need
24652 get_partial_spec_bindings to be done in non-template context so that we'll
24653 fully resolve everything. */
24654 processing_template_decl_sentinel ptds
;
24656 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
24658 const tree ospec_tmpl
= TREE_VALUE (t
);
24663 /* Substitute in the template args from the enclosing class. */
24664 ++processing_template_decl
;
24665 spec_tmpl
= tsubst (ospec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
24666 --processing_template_decl
;
24667 if (spec_tmpl
== error_mark_node
)
24668 return error_mark_node
;
24671 spec_tmpl
= ospec_tmpl
;
24673 tree spec_args
= get_partial_spec_bindings (tmpl
, spec_tmpl
, args
);
24677 spec_args
= add_to_template_args (outer_args
, spec_args
);
24679 /* Keep the candidate only if the constraints are satisfied,
24680 or if we're not compiling with concepts. */
24682 || constraints_satisfied_p (ospec_tmpl
, spec_args
))
24684 list
= tree_cons (spec_args
, ospec_tmpl
, list
);
24685 TREE_TYPE (list
) = TREE_TYPE (t
);
24693 ambiguous_p
= false;
24696 t
= TREE_CHAIN (t
);
24697 for (; t
; t
= TREE_CHAIN (t
))
24699 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
24706 t
= TREE_CHAIN (t
);
24709 ambiguous_p
= true;
24718 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
24720 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
24723 ambiguous_p
= true;
24731 char *spaces
= NULL
;
24732 if (!(complain
& tf_error
))
24733 return error_mark_node
;
24734 if (TYPE_P (target
))
24735 error ("ambiguous template instantiation for %q#T", target
);
24737 error ("ambiguous template instantiation for %q#D", target
);
24738 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
24739 for (t
= list
; t
; t
= TREE_CHAIN (t
))
24741 tree subst
= build_tree_list (TREE_VALUE (t
), TREE_PURPOSE (t
));
24742 inform (DECL_SOURCE_LOCATION (TREE_VALUE (t
)),
24743 "%s %#qS", spaces
? spaces
: str
, subst
);
24744 spaces
= spaces
? spaces
: get_spaces (str
);
24747 return error_mark_node
;
24753 /* Explicitly instantiate DECL. */
24756 do_decl_instantiation (tree decl
, tree storage
)
24758 tree result
= NULL_TREE
;
24761 if (!decl
|| decl
== error_mark_node
)
24762 /* An error occurred, for which grokdeclarator has already issued
24763 an appropriate message. */
24765 else if (! DECL_LANG_SPECIFIC (decl
))
24767 error ("explicit instantiation of non-template %q#D", decl
);
24770 else if (DECL_DECLARED_CONCEPT_P (decl
))
24773 error ("explicit instantiation of variable concept %q#D", decl
);
24775 error ("explicit instantiation of function concept %q#D", decl
);
24779 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
24780 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
24782 if (VAR_P (decl
) && !var_templ
)
24784 /* There is an asymmetry here in the way VAR_DECLs and
24785 FUNCTION_DECLs are handled by grokdeclarator. In the case of
24786 the latter, the DECL we get back will be marked as a
24787 template instantiation, and the appropriate
24788 DECL_TEMPLATE_INFO will be set up. This does not happen for
24789 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
24790 should handle VAR_DECLs as it currently handles
24792 if (!DECL_CLASS_SCOPE_P (decl
))
24794 error ("%qD is not a static data member of a class template", decl
);
24797 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
24798 if (!result
|| !VAR_P (result
))
24800 error ("no matching template for %qD found", decl
);
24803 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
24805 error ("type %qT for explicit instantiation %qD does not match "
24806 "declared type %qT", TREE_TYPE (result
), decl
,
24811 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
24813 error ("explicit instantiation of %q#D", decl
);
24819 /* Check for various error cases. Note that if the explicit
24820 instantiation is valid the RESULT will currently be marked as an
24821 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
24822 until we get here. */
24824 if (DECL_TEMPLATE_SPECIALIZATION (result
))
24826 /* DR 259 [temp.spec].
24828 Both an explicit instantiation and a declaration of an explicit
24829 specialization shall not appear in a program unless the explicit
24830 instantiation follows a declaration of the explicit specialization.
24832 For a given set of template parameters, if an explicit
24833 instantiation of a template appears after a declaration of an
24834 explicit specialization for that template, the explicit
24835 instantiation has no effect. */
24838 else if (DECL_EXPLICIT_INSTANTIATION (result
))
24842 No program shall explicitly instantiate any template more
24845 We check DECL_NOT_REALLY_EXTERN so as not to complain when
24846 the first instantiation was `extern' and the second is not,
24847 and EXTERN_P for the opposite case. */
24848 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
24849 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
24850 /* If an "extern" explicit instantiation follows an ordinary
24851 explicit instantiation, the template is instantiated. */
24855 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
24857 error ("no matching template for %qD found", result
);
24860 else if (!DECL_TEMPLATE_INFO (result
))
24862 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
24866 if (storage
== NULL_TREE
)
24868 else if (storage
== ridpointers
[(int) RID_EXTERN
])
24870 if (cxx_dialect
== cxx98
)
24871 pedwarn (input_location
, OPT_Wpedantic
,
24872 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
24877 error ("storage class %qD applied to template instantiation", storage
);
24879 check_explicit_instantiation_namespace (result
);
24880 mark_decl_instantiated (result
, extern_p
);
24882 instantiate_decl (result
, /*defer_ok=*/true,
24883 /*expl_inst_class_mem_p=*/false);
24887 mark_class_instantiated (tree t
, int extern_p
)
24889 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
24890 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
24891 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
24892 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
24895 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
24896 rest_of_type_compilation (t
, 1);
24900 /* Called from do_type_instantiation through binding_table_foreach to
24901 do recursive instantiation for the type bound in ENTRY. */
24903 bt_instantiate_type_proc (binding_entry entry
, void *data
)
24905 tree storage
= *(tree
*) data
;
24907 if (MAYBE_CLASS_TYPE_P (entry
->type
)
24908 && CLASSTYPE_TEMPLATE_INFO (entry
->type
)
24909 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
24910 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
24913 /* Perform an explicit instantiation of template class T. STORAGE, if
24914 non-null, is the RID for extern, inline or static. COMPLAIN is
24915 nonzero if this is called from the parser, zero if called recursively,
24916 since the standard is unclear (as detailed below). */
24919 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
24924 int previous_instantiation_extern_p
= 0;
24926 if (TREE_CODE (t
) == TYPE_DECL
)
24929 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
24932 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
24934 error ("explicit instantiation of non-class template %qD", tmpl
);
24936 error ("explicit instantiation of non-template type %qT", t
);
24942 if (!COMPLETE_TYPE_P (t
))
24944 if (complain
& tf_error
)
24945 error ("explicit instantiation of %q#T before definition of template",
24950 if (storage
!= NULL_TREE
)
24952 if (storage
== ridpointers
[(int) RID_EXTERN
])
24954 if (cxx_dialect
== cxx98
)
24955 pedwarn (input_location
, OPT_Wpedantic
,
24956 "ISO C++ 1998 forbids the use of %<extern%> on "
24957 "explicit instantiations");
24960 pedwarn (input_location
, OPT_Wpedantic
,
24961 "ISO C++ forbids the use of %qE"
24962 " on explicit instantiations", storage
);
24964 if (storage
== ridpointers
[(int) RID_INLINE
])
24966 else if (storage
== ridpointers
[(int) RID_EXTERN
])
24968 else if (storage
== ridpointers
[(int) RID_STATIC
])
24972 error ("storage class %qD applied to template instantiation",
24978 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
24980 /* DR 259 [temp.spec].
24982 Both an explicit instantiation and a declaration of an explicit
24983 specialization shall not appear in a program unless the explicit
24984 instantiation follows a declaration of the explicit specialization.
24986 For a given set of template parameters, if an explicit
24987 instantiation of a template appears after a declaration of an
24988 explicit specialization for that template, the explicit
24989 instantiation has no effect. */
24992 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
24996 No program shall explicitly instantiate any template more
24999 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
25000 instantiation was `extern'. If EXTERN_P then the second is.
25001 These cases are OK. */
25002 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
25004 if (!previous_instantiation_extern_p
&& !extern_p
25005 && (complain
& tf_error
))
25006 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
25008 /* If we've already instantiated the template, just return now. */
25009 if (!CLASSTYPE_INTERFACE_ONLY (t
))
25013 check_explicit_instantiation_namespace (TYPE_NAME (t
));
25014 mark_class_instantiated (t
, extern_p
);
25019 /* In contrast to implicit instantiation, where only the
25020 declarations, and not the definitions, of members are
25021 instantiated, we have here:
25025 An explicit instantiation that names a class template
25026 specialization is also an explicit instantiation of the same
25027 kind (declaration or definition) of each of its members (not
25028 including members inherited from base classes and members
25029 that are templates) that has not been previously explicitly
25030 specialized in the translation unit containing the explicit
25031 instantiation, provided that the associated constraints, if
25032 any, of that member are satisfied by the template arguments
25033 of the explicit instantiation. */
25034 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= DECL_CHAIN (fld
))
25036 || (TREE_CODE (fld
) == FUNCTION_DECL
25038 && user_provided_p (fld
)))
25039 && DECL_TEMPLATE_INSTANTIATION (fld
)
25040 && constraints_satisfied_p (fld
))
25042 mark_decl_instantiated (fld
, extern_p
);
25044 instantiate_decl (fld
, /*defer_ok=*/true,
25045 /*expl_inst_class_mem_p=*/true);
25048 if (CLASSTYPE_NESTED_UTDS (t
))
25049 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
25050 bt_instantiate_type_proc
, &storage
);
25053 /* Given a function DECL, which is a specialization of TMPL, modify
25054 DECL to be a re-instantiation of TMPL with the same template
25055 arguments. TMPL should be the template into which tsubst'ing
25056 should occur for DECL, not the most general template.
25058 One reason for doing this is a scenario like this:
25061 void f(const T&, int i);
25063 void g() { f(3, 7); }
25066 void f(const T& t, const int i) { }
25068 Note that when the template is first instantiated, with
25069 instantiate_template, the resulting DECL will have no name for the
25070 first parameter, and the wrong type for the second. So, when we go
25071 to instantiate the DECL, we regenerate it. */
25074 regenerate_decl_from_template (tree decl
, tree tmpl
, tree args
)
25076 /* The arguments used to instantiate DECL, from the most general
25080 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
25082 /* Make sure that we can see identifiers, and compute access
25084 push_access_scope (decl
);
25086 if (TREE_CODE (decl
) == FUNCTION_DECL
)
25094 args_depth
= TMPL_ARGS_DEPTH (args
);
25095 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
25096 if (args_depth
> parms_depth
)
25097 args
= get_innermost_template_args (args
, parms_depth
);
25099 /* Instantiate a dynamic exception-specification. noexcept will be
25101 if (tree raises
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (code_pattern
)))
25102 if (TREE_VALUE (raises
))
25104 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
25105 args
, tf_error
, NULL_TREE
,
25106 /*defer_ok*/false);
25107 if (specs
&& specs
!= error_mark_node
)
25108 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
25112 /* Merge parameter declarations. */
25113 decl_parm
= skip_artificial_parms_for (decl
,
25114 DECL_ARGUMENTS (decl
));
25116 = skip_artificial_parms_for (code_pattern
,
25117 DECL_ARGUMENTS (code_pattern
));
25118 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
25123 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
25124 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
25125 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
25127 parm_type
= type_decays_to (parm_type
);
25128 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
25129 TREE_TYPE (decl_parm
) = parm_type
;
25130 attributes
= DECL_ATTRIBUTES (pattern_parm
);
25131 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
25133 DECL_ATTRIBUTES (decl_parm
) = attributes
;
25134 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
25136 decl_parm
= DECL_CHAIN (decl_parm
);
25137 pattern_parm
= DECL_CHAIN (pattern_parm
);
25139 /* Merge any parameters that match with the function parameter
25141 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
25144 tree expanded_types
;
25145 /* Expand the TYPE_PACK_EXPANSION that provides the types for
25146 the parameters in this function parameter pack. */
25147 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
25148 args
, tf_error
, NULL_TREE
);
25149 len
= TREE_VEC_LENGTH (expanded_types
);
25150 for (i
= 0; i
< len
; i
++)
25155 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
25156 /* Rename the parameter to include the index. */
25157 DECL_NAME (decl_parm
) =
25158 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
25159 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
25160 parm_type
= type_decays_to (parm_type
);
25161 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
25162 TREE_TYPE (decl_parm
) = parm_type
;
25163 attributes
= DECL_ATTRIBUTES (pattern_parm
);
25164 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
25166 DECL_ATTRIBUTES (decl_parm
) = attributes
;
25167 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
25169 decl_parm
= DECL_CHAIN (decl_parm
);
25172 /* Merge additional specifiers from the CODE_PATTERN. */
25173 if (DECL_DECLARED_INLINE_P (code_pattern
)
25174 && !DECL_DECLARED_INLINE_P (decl
))
25175 DECL_DECLARED_INLINE_P (decl
) = 1;
25177 maybe_instantiate_noexcept (decl
, tf_error
);
25179 else if (VAR_P (decl
))
25181 start_lambda_scope (decl
);
25182 DECL_INITIAL (decl
) =
25183 tsubst_init (DECL_INITIAL (code_pattern
), decl
, args
,
25184 tf_error
, DECL_TI_TEMPLATE (decl
));
25185 finish_lambda_scope ();
25186 if (VAR_HAD_UNKNOWN_BOUND (decl
))
25187 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
25188 tf_error
, DECL_TI_TEMPLATE (decl
));
25191 gcc_unreachable ();
25193 pop_access_scope (decl
);
25196 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
25197 substituted to get DECL. */
25200 template_for_substitution (tree decl
)
25202 tree tmpl
= DECL_TI_TEMPLATE (decl
);
25204 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
25205 for the instantiation. This is not always the most general
25206 template. Consider, for example:
25209 struct S { template <class U> void f();
25210 template <> void f<int>(); };
25212 and an instantiation of S<double>::f<int>. We want TD to be the
25213 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
25214 while (/* An instantiation cannot have a definition, so we need a
25215 more general template. */
25216 DECL_TEMPLATE_INSTANTIATION (tmpl
)
25217 /* We must also deal with friend templates. Given:
25219 template <class T> struct S {
25220 template <class U> friend void f() {};
25223 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
25224 so far as the language is concerned, but that's still
25225 where we get the pattern for the instantiation from. On
25226 other hand, if the definition comes outside the class, say:
25228 template <class T> struct S {
25229 template <class U> friend void f();
25231 template <class U> friend void f() {}
25233 we don't need to look any further. That's what the check for
25234 DECL_INITIAL is for. */
25235 || (TREE_CODE (decl
) == FUNCTION_DECL
25236 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
25237 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
25239 /* The present template, TD, should not be a definition. If it
25240 were a definition, we should be using it! Note that we
25241 cannot restructure the loop to just keep going until we find
25242 a template with a definition, since that might go too far if
25243 a specialization was declared, but not defined. */
25245 /* Fetch the more general template. */
25246 tmpl
= DECL_TI_TEMPLATE (tmpl
);
25252 /* Returns true if we need to instantiate this template instance even if we
25253 know we aren't going to emit it. */
25256 always_instantiate_p (tree decl
)
25258 /* We always instantiate inline functions so that we can inline them. An
25259 explicit instantiation declaration prohibits implicit instantiation of
25260 non-inline functions. With high levels of optimization, we would
25261 normally inline non-inline functions -- but we're not allowed to do
25262 that for "extern template" functions. Therefore, we check
25263 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
25264 return ((TREE_CODE (decl
) == FUNCTION_DECL
25265 && (DECL_DECLARED_INLINE_P (decl
)
25266 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
25267 /* And we need to instantiate static data members so that
25268 their initializers are available in integral constant
25271 && decl_maybe_constant_var_p (decl
)));
25274 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
25275 instantiate it now, modifying TREE_TYPE (fn). Returns false on
25276 error, true otherwise. */
25279 maybe_instantiate_noexcept (tree fn
, tsubst_flags_t complain
)
25281 tree fntype
, spec
, noex
;
25283 /* Don't instantiate a noexcept-specification from template context. */
25284 if (processing_template_decl
25285 && (!flag_noexcept_type
|| type_dependent_expression_p (fn
)))
25288 if (DECL_MAYBE_DELETED (fn
))
25290 if (fn
== current_function_decl
)
25291 /* We're in start_preparsed_function, keep going. */
25295 synthesize_method (fn
);
25297 return !DECL_MAYBE_DELETED (fn
);
25300 fntype
= TREE_TYPE (fn
);
25301 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
25303 if (!spec
|| !TREE_PURPOSE (spec
))
25306 noex
= TREE_PURPOSE (spec
);
25307 if (TREE_CODE (noex
) != DEFERRED_NOEXCEPT
25308 && TREE_CODE (noex
) != DEFERRED_PARSE
)
25311 tree orig_fn
= NULL_TREE
;
25312 /* For a member friend template we can get a TEMPLATE_DECL. Let's use
25313 its FUNCTION_DECL for the rest of this function -- push_access_scope
25314 doesn't accept TEMPLATE_DECLs. */
25315 if (DECL_FUNCTION_TEMPLATE_P (fn
))
25318 fn
= DECL_TEMPLATE_RESULT (fn
);
25321 if (DECL_CLONED_FUNCTION_P (fn
))
25323 tree prime
= DECL_CLONED_FUNCTION (fn
);
25324 if (!maybe_instantiate_noexcept (prime
, complain
))
25326 spec
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (prime
));
25328 else if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
25330 static hash_set
<tree
>* fns
= new hash_set
<tree
>;
25331 bool added
= false;
25332 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
25334 spec
= get_defaulted_eh_spec (fn
, complain
);
25335 if (spec
== error_mark_node
)
25336 /* This might have failed because of an unparsed DMI, so
25337 let's try again later. */
25340 else if (!(added
= !fns
->add (fn
)))
25342 /* If hash_set::add returns true, the element was already there. */
25343 location_t loc
= cp_expr_loc_or_loc (DEFERRED_NOEXCEPT_PATTERN (noex
),
25344 DECL_SOURCE_LOCATION (fn
));
25346 "exception specification of %qD depends on itself",
25348 spec
= noexcept_false_spec
;
25350 else if (push_tinst_level (fn
))
25352 push_to_top_level ();
25353 push_access_scope (fn
);
25354 push_deferring_access_checks (dk_no_deferred
);
25355 input_location
= DECL_SOURCE_LOCATION (fn
);
25357 /* If needed, set current_class_ptr for the benefit of
25358 tsubst_copy/PARM_DECL. */
25359 tree tdecl
= DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (fn
));
25360 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tdecl
))
25362 tree this_parm
= DECL_ARGUMENTS (tdecl
);
25363 current_class_ptr
= NULL_TREE
;
25364 current_class_ref
= cp_build_fold_indirect_ref (this_parm
);
25365 current_class_ptr
= this_parm
;
25368 /* If this function is represented by a TEMPLATE_DECL, then
25369 the deferred noexcept-specification might still contain
25370 dependent types, even after substitution. And we need the
25371 dependency check functions to work in build_noexcept_spec. */
25373 ++processing_template_decl
;
25375 /* Do deferred instantiation of the noexcept-specifier. */
25376 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
25377 DEFERRED_NOEXCEPT_ARGS (noex
),
25378 tf_warning_or_error
, fn
,
25379 /*function_p=*/false,
25382 /* Build up the noexcept-specification. */
25383 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
25386 --processing_template_decl
;
25388 pop_deferring_access_checks ();
25389 pop_access_scope (fn
);
25390 pop_tinst_level ();
25391 pop_from_top_level ();
25394 spec
= noexcept_false_spec
;
25400 if (spec
== error_mark_node
)
25402 /* This failed with a hard error, so let's go with false. */
25403 gcc_assert (seen_error ());
25404 spec
= noexcept_false_spec
;
25407 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
25409 TREE_TYPE (orig_fn
) = TREE_TYPE (fn
);
25414 /* We're starting to process the function INST, an instantiation of PATTERN;
25415 add their parameters to local_specializations. */
25418 register_parameter_specializations (tree pattern
, tree inst
)
25420 tree tmpl_parm
= DECL_ARGUMENTS (pattern
);
25421 tree spec_parm
= DECL_ARGUMENTS (inst
);
25422 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (inst
))
25424 register_local_specialization (spec_parm
, tmpl_parm
);
25425 spec_parm
= skip_artificial_parms_for (inst
, spec_parm
);
25426 tmpl_parm
= skip_artificial_parms_for (pattern
, tmpl_parm
);
25428 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
25430 if (!DECL_PACK_P (tmpl_parm
)
25431 || (spec_parm
&& DECL_PACK_P (spec_parm
)))
25433 register_local_specialization (spec_parm
, tmpl_parm
);
25434 spec_parm
= DECL_CHAIN (spec_parm
);
25438 /* Register the (value) argument pack as a specialization of
25439 TMPL_PARM, then move on. */
25440 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
25441 register_local_specialization (argpack
, tmpl_parm
);
25444 gcc_assert (!spec_parm
);
25447 /* Instantiate the body of D using PATTERN with ARGS. We have
25448 already determined PATTERN is the correct template to use.
25449 NESTED_P is true if this is a nested function, in which case
25450 PATTERN will be a FUNCTION_DECL not a TEMPLATE_DECL. */
25453 instantiate_body (tree pattern
, tree args
, tree d
, bool nested_p
)
25455 tree td
= NULL_TREE
;
25456 tree code_pattern
= pattern
;
25461 code_pattern
= DECL_TEMPLATE_RESULT (td
);
25464 /* Only OMP reductions are nested. */
25465 gcc_checking_assert (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
));
25467 vec
<tree
> omp_privatization_save
;
25468 if (current_function_decl
)
25469 save_omp_privatization_clauses (omp_privatization_save
);
25472 = !(current_function_decl
25473 && !LAMBDA_FUNCTION_P (d
)
25474 && decl_function_context (d
) == current_function_decl
);
25477 push_to_top_level ();
25480 gcc_assert (!processing_template_decl
);
25481 push_function_context ();
25482 cp_unevaluated_operand
= 0;
25483 c_inhibit_evaluation_warnings
= 0;
25488 /* The variable might be a lambda's extra scope, and that
25489 lambda's visibility depends on D's. */
25490 maybe_commonize_var (d
);
25491 determine_visibility (d
);
25494 /* Mark D as instantiated so that recursive calls to
25495 instantiate_decl do not try to instantiate it again. */
25496 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
25499 /* Regenerate the declaration in case the template has been modified
25500 by a subsequent redeclaration. */
25501 regenerate_decl_from_template (d
, td
, args
);
25503 /* We already set the file and line above. Reset them now in case
25504 they changed as a result of calling regenerate_decl_from_template. */
25505 input_location
= DECL_SOURCE_LOCATION (d
);
25510 bool const_init
= false;
25512 /* Clear out DECL_RTL; whatever was there before may not be right
25513 since we've reset the type of the declaration. */
25514 SET_DECL_RTL (d
, NULL
);
25515 DECL_IN_AGGR_P (d
) = 0;
25517 /* The initializer is placed in DECL_INITIAL by
25518 regenerate_decl_from_template so we don't need to
25519 push/pop_access_scope again here. Pull it out so that
25520 cp_finish_decl can process it. */
25521 init
= DECL_INITIAL (d
);
25522 DECL_INITIAL (d
) = NULL_TREE
;
25523 DECL_INITIALIZED_P (d
) = 0;
25525 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
25526 initializer. That function will defer actual emission until
25527 we have a chance to determine linkage. */
25528 DECL_EXTERNAL (d
) = 0;
25530 /* Enter the scope of D so that access-checking works correctly. */
25531 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
25533 push_nested_class (DECL_CONTEXT (d
));
25535 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
25536 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
25539 pop_nested_class ();
25541 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
25542 synthesize_method (d
);
25543 else if (TREE_CODE (d
) == FUNCTION_DECL
)
25545 /* Set up the list of local specializations. */
25546 local_specialization_stack
lss (push_to_top
? lss_blank
: lss_copy
);
25547 tree block
= NULL_TREE
;
25549 /* Set up context. */
25551 block
= push_stmt_list ();
25553 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
25555 perform_instantiation_time_access_checks (code_pattern
, args
);
25557 /* Create substitution entries for the parameters. */
25558 register_parameter_specializations (code_pattern
, d
);
25560 /* Substitute into the body of the function. */
25561 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
25562 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
25563 tf_warning_or_error
, d
);
25566 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
25567 tf_warning_or_error
, DECL_TI_TEMPLATE (d
),
25568 /*integral_constant_expression_p=*/false);
25570 /* Set the current input_location to the end of the function
25571 so that finish_function knows where we are. */
25573 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
25575 /* Remember if we saw an infinite loop in the template. */
25576 current_function_infinite_loop
25577 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
25580 /* Finish the function. */
25582 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
25585 d
= finish_function (/*inline_p=*/false);
25586 expand_or_defer_fn (d
);
25589 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
25590 cp_check_omp_declare_reduction (d
);
25593 /* We're not deferring instantiation any more. */
25594 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
25597 pop_from_top_level ();
25599 pop_function_context ();
25601 if (current_function_decl
)
25602 restore_omp_privatization_clauses (omp_privatization_save
);
25605 /* Produce the definition of D, a _DECL generated from a template. If
25606 DEFER_OK is true, then we don't have to actually do the
25607 instantiation now; we just have to do it sometime. Normally it is
25608 an error if this is an explicit instantiation but D is undefined.
25609 EXPL_INST_CLASS_MEM_P is true iff D is a member of an explicitly
25610 instantiated class template. */
25613 instantiate_decl (tree d
, bool defer_ok
, bool expl_inst_class_mem_p
)
25615 tree tmpl
= DECL_TI_TEMPLATE (d
);
25622 bool pattern_defined
;
25623 location_t saved_loc
= input_location
;
25624 int saved_unevaluated_operand
= cp_unevaluated_operand
;
25625 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
25629 /* This function should only be used to instantiate templates for
25630 functions and static member variables. */
25631 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
25633 /* A concept is never instantiated. */
25634 gcc_assert (!DECL_DECLARED_CONCEPT_P (d
));
25636 gcc_checking_assert (!DECL_FUNCTION_SCOPE_P (d
));
25638 /* Variables are never deferred; if instantiation is required, they
25639 are instantiated right away. That allows for better code in the
25640 case that an expression refers to the value of the variable --
25641 if the variable has a constant value the referring expression can
25642 take advantage of that fact. */
25646 /* Don't instantiate cloned functions. Instead, instantiate the
25647 functions they cloned. */
25648 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
25649 d
= DECL_CLONED_FUNCTION (d
);
25651 if (DECL_TEMPLATE_INSTANTIATED (d
)
25652 || TREE_TYPE (d
) == error_mark_node
25653 || (TREE_CODE (d
) == FUNCTION_DECL
25654 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
25655 || DECL_TEMPLATE_SPECIALIZATION (d
))
25656 /* D has already been instantiated or explicitly specialized, so
25657 there's nothing for us to do here.
25659 It might seem reasonable to check whether or not D is an explicit
25660 instantiation, and, if so, stop here. But when an explicit
25661 instantiation is deferred until the end of the compilation,
25662 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
25663 the instantiation. */
25666 /* Check to see whether we know that this template will be
25667 instantiated in some other file, as with "extern template"
25669 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
25671 /* In general, we do not instantiate such templates. */
25672 if (external_p
&& !always_instantiate_p (d
))
25675 gen_tmpl
= most_general_template (tmpl
);
25676 gen_args
= DECL_TI_ARGS (d
);
25678 /* We should already have the extra args. */
25679 gcc_checking_assert (tmpl
== gen_tmpl
25680 || (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
25681 == TMPL_ARGS_DEPTH (gen_args
)));
25682 /* And what's in the hash table should match D. */
25683 gcc_checking_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0))
25685 || spec
== NULL_TREE
);
25687 /* This needs to happen before any tsubsting. */
25688 if (! push_tinst_level (d
))
25691 timevar_push (TV_TEMPLATE_INST
);
25693 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
25694 for the instantiation. */
25695 td
= template_for_substitution (d
);
25700 /* Look up an explicit specialization, if any. */
25701 tree tid
= lookup_template_variable (gen_tmpl
, gen_args
);
25702 tree elt
= most_specialized_partial_spec (tid
, tf_warning_or_error
);
25703 if (elt
&& elt
!= error_mark_node
)
25705 td
= TREE_VALUE (elt
);
25706 args
= TREE_PURPOSE (elt
);
25710 code_pattern
= DECL_TEMPLATE_RESULT (td
);
25712 /* We should never be trying to instantiate a member of a class
25713 template or partial specialization. */
25714 gcc_assert (d
!= code_pattern
);
25716 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
25717 || DECL_TEMPLATE_SPECIALIZATION (td
))
25718 /* In the case of a friend template whose definition is provided
25719 outside the class, we may have too many arguments. Drop the
25720 ones we don't need. The same is true for specializations. */
25721 args
= get_innermost_template_args
25722 (args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
25724 if (TREE_CODE (d
) == FUNCTION_DECL
)
25726 deleted_p
= DECL_DELETED_FN (code_pattern
);
25727 pattern_defined
= ((DECL_SAVED_TREE (code_pattern
) != NULL_TREE
25728 && DECL_INITIAL (code_pattern
) != error_mark_node
)
25729 || DECL_DEFAULTED_FN (code_pattern
)
25735 if (DECL_CLASS_SCOPE_P (code_pattern
))
25736 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
25738 pattern_defined
= ! DECL_EXTERNAL (code_pattern
);
25741 /* We may be in the middle of deferred access check. Disable it now. */
25742 push_deferring_access_checks (dk_no_deferred
);
25744 /* Unless an explicit instantiation directive has already determined
25745 the linkage of D, remember that a definition is available for
25747 if (pattern_defined
25748 && !DECL_INTERFACE_KNOWN (d
)
25749 && !DECL_NOT_REALLY_EXTERN (d
))
25750 mark_definable (d
);
25752 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
25753 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
25754 input_location
= DECL_SOURCE_LOCATION (d
);
25756 /* If D is a member of an explicitly instantiated class template,
25757 and no definition is available, treat it like an implicit
25759 if (!pattern_defined
&& expl_inst_class_mem_p
25760 && DECL_EXPLICIT_INSTANTIATION (d
))
25762 /* Leave linkage flags alone on instantiations with anonymous
25764 if (TREE_PUBLIC (d
))
25766 DECL_NOT_REALLY_EXTERN (d
) = 0;
25767 DECL_INTERFACE_KNOWN (d
) = 0;
25769 SET_DECL_IMPLICIT_INSTANTIATION (d
);
25772 /* Defer all other templates, unless we have been explicitly
25773 forbidden from doing so. */
25774 if (/* If there is no definition, we cannot instantiate the
25777 /* If it's OK to postpone instantiation, do so. */
25779 /* If this is a static data member that will be defined
25780 elsewhere, we don't want to instantiate the entire data
25781 member, but we do want to instantiate the initializer so that
25782 we can substitute that elsewhere. */
25783 || (external_p
&& VAR_P (d
))
25784 /* Handle here a deleted function too, avoid generating
25785 its body (c++/61080). */
25788 /* The definition of the static data member is now required so
25789 we must substitute the initializer. */
25791 && !DECL_INITIAL (d
)
25792 && DECL_INITIAL (code_pattern
))
25796 bool const_init
= false;
25797 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
25799 ns
= decl_namespace_context (d
);
25800 push_nested_namespace (ns
);
25802 push_nested_class (DECL_CONTEXT (d
));
25803 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
25805 tf_warning_or_error
, NULL_TREE
,
25806 /*integral_constant_expression_p=*/false);
25807 /* If instantiating the initializer involved instantiating this
25808 again, don't call cp_finish_decl twice. */
25809 if (!DECL_INITIAL (d
))
25811 /* Make sure the initializer is still constant, in case of
25812 circular dependency (template/instantiate6.C). */
25814 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
25815 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
25816 /*asmspec_tree=*/NULL_TREE
,
25817 LOOKUP_ONLYCONVERTING
);
25820 pop_nested_class ();
25821 pop_nested_namespace (ns
);
25824 /* We restore the source position here because it's used by
25825 add_pending_template. */
25826 input_location
= saved_loc
;
25828 if (at_eof
&& !pattern_defined
25829 && DECL_EXPLICIT_INSTANTIATION (d
)
25830 && DECL_NOT_REALLY_EXTERN (d
))
25833 The definition of a non-exported function template, a
25834 non-exported member function template, or a non-exported
25835 member function or static data member of a class template
25836 shall be present in every translation unit in which it is
25837 explicitly instantiated. */
25838 permerror (input_location
, "explicit instantiation of %qD "
25839 "but no definition available", d
);
25841 /* If we're in unevaluated context, we just wanted to get the
25842 constant value; this isn't an odr use, so don't queue
25843 a full instantiation. */
25844 if (!cp_unevaluated_operand
25845 /* ??? Historically, we have instantiated inline functions, even
25846 when marked as "extern template". */
25847 && !(external_p
&& VAR_P (d
)))
25848 add_pending_template (d
);
25852 if (variable_template_p (gen_tmpl
))
25853 note_variable_template_instantiation (d
);
25854 instantiate_body (td
, args
, d
, false);
25857 pop_deferring_access_checks ();
25858 timevar_pop (TV_TEMPLATE_INST
);
25859 pop_tinst_level ();
25860 input_location
= saved_loc
;
25861 cp_unevaluated_operand
= saved_unevaluated_operand
;
25862 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
25867 /* Run through the list of templates that we wish we could
25868 instantiate, and instantiate any we can. RETRIES is the
25869 number of times we retry pending template instantiation. */
25872 instantiate_pending_templates (int retries
)
25875 location_t saved_loc
= input_location
;
25877 /* Instantiating templates may trigger vtable generation. This in turn
25878 may require further template instantiations. We place a limit here
25879 to avoid infinite loop. */
25880 if (pending_templates
&& retries
>= max_tinst_depth
)
25882 tree decl
= pending_templates
->tinst
->maybe_get_node ();
25884 fatal_error (input_location
,
25885 "template instantiation depth exceeds maximum of %d"
25886 " instantiating %q+D, possibly from virtual table generation"
25887 " (use %<-ftemplate-depth=%> to increase the maximum)",
25888 max_tinst_depth
, decl
);
25889 if (TREE_CODE (decl
) == FUNCTION_DECL
)
25890 /* Pretend that we defined it. */
25891 DECL_INITIAL (decl
) = error_mark_node
;
25897 struct pending_template
**t
= &pending_templates
;
25898 struct pending_template
*last
= NULL
;
25902 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
25903 bool complete
= false;
25905 if (TYPE_P (instantiation
))
25907 if (!COMPLETE_TYPE_P (instantiation
))
25909 instantiate_class_template (instantiation
);
25910 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
25911 for (tree fld
= TYPE_FIELDS (instantiation
);
25912 fld
; fld
= TREE_CHAIN (fld
))
25914 || (TREE_CODE (fld
) == FUNCTION_DECL
25915 && !DECL_ARTIFICIAL (fld
)))
25916 && DECL_TEMPLATE_INSTANTIATION (fld
))
25917 instantiate_decl (fld
,
25918 /*defer_ok=*/false,
25919 /*expl_inst_class_mem_p=*/false);
25921 if (COMPLETE_TYPE_P (instantiation
))
25925 complete
= COMPLETE_TYPE_P (instantiation
);
25929 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
25930 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
25933 = instantiate_decl (instantiation
,
25934 /*defer_ok=*/false,
25935 /*expl_inst_class_mem_p=*/false);
25936 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
25940 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
25941 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
25946 /* If INSTANTIATION has been instantiated, then we don't
25947 need to consider it again in the future. */
25948 struct pending_template
*drop
= *t
;
25950 set_refcount_ptr (drop
->tinst
);
25951 pending_template_freelist ().free (drop
);
25959 set_refcount_ptr (current_tinst_level
);
25961 last_pending_template
= last
;
25963 while (reconsider
);
25965 input_location
= saved_loc
;
25968 /* Substitute ARGVEC into T, which is a list of initializers for
25969 either base class or a non-static data member. The TREE_PURPOSEs
25970 are DECLs, and the TREE_VALUEs are the initializer values. Used by
25971 instantiate_decl. */
25974 tsubst_initializer_list (tree t
, tree argvec
)
25976 tree inits
= NULL_TREE
;
25977 tree target_ctor
= error_mark_node
;
25979 for (; t
; t
= TREE_CHAIN (t
))
25983 tree expanded_bases
= NULL_TREE
;
25984 tree expanded_arguments
= NULL_TREE
;
25987 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
25992 /* Expand the base class expansion type into separate base
25994 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
25995 tf_warning_or_error
,
25997 if (expanded_bases
== error_mark_node
)
26000 /* We'll be building separate TREE_LISTs of arguments for
26002 len
= TREE_VEC_LENGTH (expanded_bases
);
26003 expanded_arguments
= make_tree_vec (len
);
26004 for (i
= 0; i
< len
; i
++)
26005 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
26007 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
26008 expand each argument in the TREE_VALUE of t. */
26009 expr
= make_node (EXPR_PACK_EXPANSION
);
26010 PACK_EXPANSION_LOCAL_P (expr
) = true;
26011 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
26012 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
26014 if (TREE_VALUE (t
) == void_type_node
)
26015 /* VOID_TYPE_NODE is used to indicate
26016 value-initialization. */
26018 for (i
= 0; i
< len
; i
++)
26019 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
26023 /* Substitute parameter packs into each argument in the
26025 in_base_initializer
= 1;
26026 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
26028 tree expanded_exprs
;
26030 /* Expand the argument. */
26031 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
26033 = tsubst_pack_expansion (expr
, argvec
,
26034 tf_warning_or_error
,
26036 if (expanded_exprs
== error_mark_node
)
26039 /* Prepend each of the expanded expressions to the
26040 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
26041 for (i
= 0; i
< len
; i
++)
26043 TREE_VEC_ELT (expanded_arguments
, i
) =
26044 tree_cons (NULL_TREE
,
26045 TREE_VEC_ELT (expanded_exprs
, i
),
26046 TREE_VEC_ELT (expanded_arguments
, i
));
26049 in_base_initializer
= 0;
26051 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
26052 since we built them backwards. */
26053 for (i
= 0; i
< len
; i
++)
26055 TREE_VEC_ELT (expanded_arguments
, i
) =
26056 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
26061 for (i
= 0; i
< len
; ++i
)
26063 if (expanded_bases
)
26065 decl
= TREE_VEC_ELT (expanded_bases
, i
);
26066 decl
= expand_member_init (decl
);
26067 init
= TREE_VEC_ELT (expanded_arguments
, i
);
26072 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
26073 tf_warning_or_error
, NULL_TREE
);
26075 decl
= expand_member_init (decl
);
26076 if (decl
&& !DECL_P (decl
))
26077 in_base_initializer
= 1;
26079 init
= TREE_VALUE (t
);
26081 if (init
!= void_type_node
)
26082 init
= tsubst_expr (init
, argvec
,
26083 tf_warning_or_error
, NULL_TREE
,
26084 /*integral_constant_expression_p=*/false);
26085 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
26086 /* If we had an initializer but it instantiated to nothing,
26087 value-initialize the object. This will only occur when
26088 the initializer was a pack expansion where the parameter
26089 packs used in that expansion were of length zero. */
26090 init
= void_type_node
;
26091 in_base_initializer
= 0;
26094 if (target_ctor
!= error_mark_node
26095 && init
!= error_mark_node
)
26097 error ("mem-initializer for %qD follows constructor delegation",
26101 /* Look for a target constructor. */
26102 if (init
!= error_mark_node
26103 && decl
&& CLASS_TYPE_P (decl
)
26104 && same_type_p (decl
, current_class_type
))
26106 maybe_warn_cpp0x (CPP0X_DELEGATING_CTORS
);
26109 error ("constructor delegation follows mem-initializer for %qD",
26110 TREE_PURPOSE (inits
));
26113 target_ctor
= init
;
26118 init
= build_tree_list (decl
, init
);
26119 /* Carry over the dummy TREE_TYPE node containing the source
26121 TREE_TYPE (init
) = TREE_TYPE (t
);
26122 TREE_CHAIN (init
) = inits
;
26130 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
26133 set_current_access_from_decl (tree decl
)
26135 if (TREE_PRIVATE (decl
))
26136 current_access_specifier
= access_private_node
;
26137 else if (TREE_PROTECTED (decl
))
26138 current_access_specifier
= access_protected_node
;
26140 current_access_specifier
= access_public_node
;
26143 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
26144 is the instantiation (which should have been created with
26145 start_enum) and ARGS are the template arguments to use. */
26148 tsubst_enum (tree tag
, tree newtag
, tree args
)
26152 if (SCOPED_ENUM_P (newtag
))
26153 begin_scope (sk_scoped_enum
, newtag
);
26155 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
26160 decl
= TREE_VALUE (e
);
26161 /* Note that in a template enum, the TREE_VALUE is the
26162 CONST_DECL, not the corresponding INTEGER_CST. */
26163 value
= tsubst_expr (DECL_INITIAL (decl
),
26164 args
, tf_warning_or_error
, NULL_TREE
,
26165 /*integral_constant_expression_p=*/true);
26167 /* Give this enumeration constant the correct access. */
26168 set_current_access_from_decl (decl
);
26170 /* Actually build the enumerator itself. Here we're assuming that
26171 enumerators can't have dependent attributes. */
26172 build_enumerator (DECL_NAME (decl
), value
, newtag
,
26173 DECL_ATTRIBUTES (decl
), DECL_SOURCE_LOCATION (decl
));
26176 if (SCOPED_ENUM_P (newtag
))
26179 finish_enum_value_list (newtag
);
26180 finish_enum (newtag
);
26182 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
26183 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
26186 /* DECL is a FUNCTION_DECL that is a template specialization. Return
26187 its type -- but without substituting the innermost set of template
26188 arguments. So, innermost set of template parameters will appear in
26192 get_mostly_instantiated_function_type (tree decl
)
26194 /* For a function, DECL_TI_TEMPLATE is partially instantiated. */
26195 return TREE_TYPE (DECL_TI_TEMPLATE (decl
));
26198 /* Return truthvalue if we're processing a template different from
26199 the last one involved in diagnostics. */
26201 problematic_instantiation_changed (void)
26203 return current_tinst_level
!= last_error_tinst_level
;
26206 /* Remember current template involved in diagnostics. */
26208 record_last_problematic_instantiation (void)
26210 set_refcount_ptr (last_error_tinst_level
, current_tinst_level
);
26213 struct tinst_level
*
26214 current_instantiation (void)
26216 return current_tinst_level
;
26219 /* Return TRUE if current_function_decl is being instantiated, false
26223 instantiating_current_function_p (void)
26225 return (current_instantiation ()
26226 && (current_instantiation ()->maybe_get_node ()
26227 == current_function_decl
));
26230 /* [temp.param] Check that template non-type parm TYPE is of an allowable
26231 type. Return false for ok, true for disallowed. Issue error and
26232 inform messages under control of COMPLAIN. */
26235 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
26237 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
26239 else if (TYPE_PTR_P (type
))
26241 else if (TYPE_REF_P (type
)
26242 && !TYPE_REF_IS_RVALUE (type
))
26244 else if (TYPE_PTRMEM_P (type
))
26246 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
26248 if (CLASS_PLACEHOLDER_TEMPLATE (type
) && cxx_dialect
< cxx20
)
26250 if (complain
& tf_error
)
26251 error ("non-type template parameters of deduced class type only "
26252 "available with %<-std=c++20%> or %<-std=gnu++20%>");
26257 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
26259 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
26261 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
26263 /* A bound template template parm could later be instantiated to have a valid
26264 nontype parm type via an alias template. */
26265 else if (cxx_dialect
>= cxx11
26266 && TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
26268 else if (VOID_TYPE_P (type
))
26269 /* Fall through. */;
26270 else if (cxx_dialect
>= cxx20
)
26272 if (dependent_type_p (type
))
26274 if (!complete_type_or_maybe_complain (type
, NULL_TREE
, complain
))
26276 if (structural_type_p (type
))
26278 if (complain
& tf_error
)
26280 auto_diagnostic_group d
;
26281 error ("%qT is not a valid type for a template non-type "
26282 "parameter because it is not structural", type
);
26283 structural_type_p (type
, true);
26287 else if (CLASS_TYPE_P (type
))
26289 if (complain
& tf_error
)
26290 error ("non-type template parameters of class type only available "
26291 "with %<-std=c++20%> or %<-std=gnu++20%>");
26295 if (complain
& tf_error
)
26297 if (type
== error_mark_node
)
26298 inform (input_location
, "invalid template non-type parameter");
26300 error ("%q#T is not a valid type for a template non-type parameter",
26306 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
26307 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
26310 dependent_type_p_r (tree type
)
26316 A type is dependent if it is:
26318 -- a template parameter. Template template parameters are types
26319 for us (since TYPE_P holds true for them) so we handle
26321 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
26322 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
26324 /* -- a qualified-id with a nested-name-specifier which contains a
26325 class-name that names a dependent type or whose unqualified-id
26326 names a dependent type. */
26327 if (TREE_CODE (type
) == TYPENAME_TYPE
)
26330 /* An alias template specialization can be dependent even if the
26331 resulting type is not. */
26332 if (dependent_alias_template_spec_p (type
, nt_transparent
))
26335 /* -- a cv-qualified type where the cv-unqualified type is
26337 No code is necessary for this bullet; the code below handles
26338 cv-qualified types, and we don't want to strip aliases with
26339 TYPE_MAIN_VARIANT because of DR 1558. */
26340 /* -- a compound type constructed from any dependent type. */
26341 if (TYPE_PTRMEM_P (type
))
26342 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
26343 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
26345 else if (INDIRECT_TYPE_P (type
))
26346 return dependent_type_p (TREE_TYPE (type
));
26347 else if (FUNC_OR_METHOD_TYPE_P (type
))
26351 if (dependent_type_p (TREE_TYPE (type
)))
26353 for (arg_type
= TYPE_ARG_TYPES (type
);
26355 arg_type
= TREE_CHAIN (arg_type
))
26356 if (dependent_type_p (TREE_VALUE (arg_type
)))
26358 if (cxx_dialect
>= cxx17
)
26359 /* A value-dependent noexcept-specifier makes the type dependent. */
26360 if (tree spec
= TYPE_RAISES_EXCEPTIONS (type
))
26361 if (tree noex
= TREE_PURPOSE (spec
))
26362 /* Treat DEFERRED_NOEXCEPT as non-dependent, since it doesn't
26363 affect overload resolution and treating it as dependent breaks
26364 things. Same for an unparsed noexcept expression. */
26365 if (TREE_CODE (noex
) != DEFERRED_NOEXCEPT
26366 && TREE_CODE (noex
) != DEFERRED_PARSE
26367 && value_dependent_expression_p (noex
))
26371 /* -- an array type constructed from any dependent type or whose
26372 size is specified by a constant expression that is
26375 We checked for type- and value-dependence of the bounds in
26376 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
26377 if (TREE_CODE (type
) == ARRAY_TYPE
)
26379 if (TYPE_DOMAIN (type
)
26380 && dependent_type_p (TYPE_DOMAIN (type
)))
26382 return dependent_type_p (TREE_TYPE (type
));
26385 /* -- a template-id in which either the template name is a template
26387 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
26389 /* ... or any of the template arguments is a dependent type or
26390 an expression that is type-dependent or value-dependent. */
26391 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
26392 && (any_dependent_template_arguments_p
26393 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
26396 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
26397 dependent; if the argument of the `typeof' expression is not
26398 type-dependent, then it should already been have resolved. */
26399 if (TREE_CODE (type
) == TYPEOF_TYPE
26400 || TREE_CODE (type
) == DECLTYPE_TYPE
26401 || TREE_CODE (type
) == UNDERLYING_TYPE
)
26404 /* A template argument pack is dependent if any of its packed
26406 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
26408 tree args
= ARGUMENT_PACK_ARGS (type
);
26409 int i
, len
= TREE_VEC_LENGTH (args
);
26410 for (i
= 0; i
< len
; ++i
)
26411 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
26415 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
26416 be template parameters. */
26417 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
26420 if (any_dependent_type_attributes_p (TYPE_ATTRIBUTES (type
)))
26423 /* The standard does not specifically mention types that are local
26424 to template functions or local classes, but they should be
26425 considered dependent too. For example:
26427 template <int I> void f() {
26432 The size of `E' cannot be known until the value of `I' has been
26433 determined. Therefore, `E' must be considered dependent. */
26434 scope
= TYPE_CONTEXT (type
);
26435 if (scope
&& TYPE_P (scope
))
26436 return dependent_type_p (scope
);
26437 /* Don't use type_dependent_expression_p here, as it can lead
26438 to infinite recursion trying to determine whether a lambda
26439 nested in a lambda is dependent (c++/47687). */
26440 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
26441 && DECL_LANG_SPECIFIC (scope
)
26442 && DECL_TEMPLATE_INFO (scope
)
26443 && (any_dependent_template_arguments_p
26444 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
26447 /* Other types are non-dependent. */
26451 /* Returns TRUE if TYPE is dependent, in the sense of
26452 [temp.dep.type]. Note that a NULL type is considered dependent. */
26455 dependent_type_p (tree type
)
26457 /* If there are no template parameters in scope, then there can't be
26458 any dependent types. */
26459 if (!processing_template_decl
)
26461 /* If we are not processing a template, then nobody should be
26462 providing us with a dependent type. */
26464 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
26468 /* If the type is NULL, we have not computed a type for the entity
26469 in question; in that case, the type is dependent. */
26473 /* Erroneous types can be considered non-dependent. */
26474 if (type
== error_mark_node
)
26477 /* Getting here with global_type_node means we improperly called this
26478 function on the TREE_TYPE of an IDENTIFIER_NODE. */
26479 gcc_checking_assert (type
!= global_type_node
);
26481 /* If we have not already computed the appropriate value for TYPE,
26483 if (!TYPE_DEPENDENT_P_VALID (type
))
26485 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
26486 TYPE_DEPENDENT_P_VALID (type
) = 1;
26489 return TYPE_DEPENDENT_P (type
);
26492 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
26493 lookup. In other words, a dependent type that is not the current
26497 dependent_scope_p (tree scope
)
26499 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
26500 && !currently_open_class (scope
));
26503 /* T is a SCOPE_REF. Return whether it represents a non-static member of
26504 an unknown base of 'this' (and is therefore instantiation-dependent). */
26507 unknown_base_ref_p (tree t
)
26509 if (!current_class_ptr
)
26512 tree mem
= TREE_OPERAND (t
, 1);
26513 if (shared_member_p (mem
))
26516 tree cur
= current_nonlambda_class_type ();
26517 if (!any_dependent_bases_p (cur
))
26520 tree ctx
= TREE_OPERAND (t
, 0);
26521 if (DERIVED_FROM_P (ctx
, cur
))
26527 /* T is a SCOPE_REF; return whether we need to consider it
26528 instantiation-dependent so that we can check access at instantiation
26529 time even though we know which member it resolves to. */
26532 instantiation_dependent_scope_ref_p (tree t
)
26534 if (DECL_P (TREE_OPERAND (t
, 1))
26535 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
26536 && !unknown_base_ref_p (t
)
26537 && accessible_in_template_p (TREE_OPERAND (t
, 0),
26538 TREE_OPERAND (t
, 1)))
26544 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
26545 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
26548 /* Note that this predicate is not appropriate for general expressions;
26549 only constant expressions (that satisfy potential_constant_expression)
26550 can be tested for value dependence. */
26553 value_dependent_expression_p (tree expression
)
26555 if (!processing_template_decl
|| expression
== NULL_TREE
)
26558 /* A type-dependent expression is also value-dependent. */
26559 if (type_dependent_expression_p (expression
))
26562 switch (TREE_CODE (expression
))
26565 /* A dependent member function of the current instantiation. */
26566 return dependent_type_p (BINFO_TYPE (BASELINK_BINFO (expression
)));
26568 case FUNCTION_DECL
:
26569 /* A dependent member function of the current instantiation. */
26570 if (DECL_CLASS_SCOPE_P (expression
)
26571 && dependent_type_p (DECL_CONTEXT (expression
)))
26575 case IDENTIFIER_NODE
:
26576 /* A name that has not been looked up -- must be dependent. */
26579 case TEMPLATE_PARM_INDEX
:
26580 /* A non-type template parm. */
26584 /* A non-type template parm. */
26585 if (DECL_TEMPLATE_PARM_P (expression
))
26587 return value_dependent_expression_p (DECL_INITIAL (expression
));
26590 /* A constant with literal type and is initialized
26591 with an expression that is value-dependent. */
26592 if (DECL_DEPENDENT_INIT_P (expression
)
26593 /* FIXME cp_finish_decl doesn't fold reference initializers. */
26594 || TYPE_REF_P (TREE_TYPE (expression
)))
26596 if (DECL_HAS_VALUE_EXPR_P (expression
))
26598 tree value_expr
= DECL_VALUE_EXPR (expression
);
26599 if (value_dependent_expression_p (value_expr
)
26600 /* __PRETTY_FUNCTION__ inside a template function is dependent
26601 on the name of the function. */
26602 || (DECL_PRETTY_FUNCTION_P (expression
)
26603 /* It might be used in a template, but not a template
26604 function, in which case its DECL_VALUE_EXPR will be
26606 && value_expr
== error_mark_node
))
26611 case DYNAMIC_CAST_EXPR
:
26612 case STATIC_CAST_EXPR
:
26613 case CONST_CAST_EXPR
:
26614 case REINTERPRET_CAST_EXPR
:
26616 case IMPLICIT_CONV_EXPR
:
26617 /* These expressions are value-dependent if the type to which
26618 the cast occurs is dependent or the expression being casted
26619 is value-dependent. */
26621 tree type
= TREE_TYPE (expression
);
26623 if (dependent_type_p (type
))
26626 /* A functional cast has a list of operands. */
26627 expression
= TREE_OPERAND (expression
, 0);
26630 /* If there are no operands, it must be an expression such
26631 as "int()". This should not happen for aggregate types
26632 because it would form non-constant expressions. */
26633 gcc_assert (cxx_dialect
>= cxx11
26634 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
26639 if (TREE_CODE (expression
) == TREE_LIST
)
26640 return any_value_dependent_elements_p (expression
);
26642 return value_dependent_expression_p (expression
);
26646 if (SIZEOF_EXPR_TYPE_P (expression
))
26647 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
26651 /* A `sizeof' expression is value-dependent if the operand is
26652 type-dependent or is a pack expansion. */
26653 expression
= TREE_OPERAND (expression
, 0);
26654 if (PACK_EXPANSION_P (expression
))
26656 else if (TYPE_P (expression
))
26657 return dependent_type_p (expression
);
26658 return instantiation_dependent_uneval_expression_p (expression
);
26660 case AT_ENCODE_EXPR
:
26661 /* An 'encode' expression is value-dependent if the operand is
26663 expression
= TREE_OPERAND (expression
, 0);
26664 return dependent_type_p (expression
);
26666 case NOEXCEPT_EXPR
:
26667 expression
= TREE_OPERAND (expression
, 0);
26668 return instantiation_dependent_uneval_expression_p (expression
);
26671 /* All instantiation-dependent expressions should also be considered
26672 value-dependent. */
26673 return instantiation_dependent_scope_ref_p (expression
);
26675 case COMPONENT_REF
:
26676 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
26677 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
26679 case NONTYPE_ARGUMENT_PACK
:
26680 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
26681 is value-dependent. */
26683 tree values
= ARGUMENT_PACK_ARGS (expression
);
26684 int i
, len
= TREE_VEC_LENGTH (values
);
26686 for (i
= 0; i
< len
; ++i
)
26687 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
26695 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
26697 if (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
)))
26703 if (TREE_CODE (type2
) != TREE_LIST
)
26704 return dependent_type_p (type2
);
26706 for (; type2
; type2
= TREE_CHAIN (type2
))
26707 if (dependent_type_p (TREE_VALUE (type2
)))
26714 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
26715 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
26718 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
26719 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
26723 tree op
= TREE_OPERAND (expression
, 0);
26724 return (value_dependent_expression_p (op
)
26725 || has_value_dependent_address (op
));
26728 case REQUIRES_EXPR
:
26729 /* Treat all requires-expressions as value-dependent so
26730 we don't try to fold them. */
26734 return dependent_type_p (TREE_OPERAND (expression
, 0));
26738 if (value_dependent_expression_p (CALL_EXPR_FN (expression
)))
26740 tree fn
= get_callee_fndecl (expression
);
26742 nargs
= call_expr_nargs (expression
);
26743 for (i
= 0; i
< nargs
; ++i
)
26745 tree op
= CALL_EXPR_ARG (expression
, i
);
26746 /* In a call to a constexpr member function, look through the
26747 implicit ADDR_EXPR on the object argument so that it doesn't
26748 cause the call to be considered value-dependent. We also
26749 look through it in potential_constant_expression. */
26750 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
26751 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
26752 && TREE_CODE (op
) == ADDR_EXPR
)
26753 op
= TREE_OPERAND (op
, 0);
26754 if (value_dependent_expression_p (op
))
26760 case TEMPLATE_ID_EXPR
:
26761 return concept_definition_p (TREE_OPERAND (expression
, 0));
26767 if (dependent_type_p (TREE_TYPE (expression
)))
26769 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
26770 if (value_dependent_expression_p (val
))
26776 /* Treat a GNU statement expression as dependent to avoid crashing
26777 under instantiate_non_dependent_expr; it can't be constant. */
26781 /* A constant expression is value-dependent if any subexpression is
26782 value-dependent. */
26783 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
26785 case tcc_reference
:
26787 case tcc_comparison
:
26789 case tcc_expression
:
26792 int i
, len
= cp_tree_operand_length (expression
);
26794 for (i
= 0; i
< len
; i
++)
26796 tree t
= TREE_OPERAND (expression
, i
);
26798 /* In some cases, some of the operands may be missing.
26799 (For example, in the case of PREDECREMENT_EXPR, the
26800 amount to increment by may be missing.) That doesn't
26801 make the expression dependent. */
26802 if (t
&& value_dependent_expression_p (t
))
26813 /* The expression is not value-dependent. */
26817 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
26818 [temp.dep.expr]. Note that an expression with no type is
26819 considered dependent. Other parts of the compiler arrange for an
26820 expression with type-dependent subexpressions to have no type, so
26821 this function doesn't have to be fully recursive. */
26824 type_dependent_expression_p (tree expression
)
26826 if (!processing_template_decl
)
26829 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
26832 STRIP_ANY_LOCATION_WRAPPER (expression
);
26834 /* An unresolved name is always dependent. */
26835 if (identifier_p (expression
)
26836 || TREE_CODE (expression
) == USING_DECL
26837 || TREE_CODE (expression
) == WILDCARD_DECL
)
26840 /* A lambda-expression in template context is dependent. dependent_type_p is
26841 true for a lambda in the scope of a class or function template, but that
26842 doesn't cover all template contexts, like a default template argument. */
26843 if (TREE_CODE (expression
) == LAMBDA_EXPR
)
26846 /* A fold expression is type-dependent. */
26847 if (TREE_CODE (expression
) == UNARY_LEFT_FOLD_EXPR
26848 || TREE_CODE (expression
) == UNARY_RIGHT_FOLD_EXPR
26849 || TREE_CODE (expression
) == BINARY_LEFT_FOLD_EXPR
26850 || TREE_CODE (expression
) == BINARY_RIGHT_FOLD_EXPR
)
26853 /* Some expression forms are never type-dependent. */
26854 if (TREE_CODE (expression
) == SIZEOF_EXPR
26855 || TREE_CODE (expression
) == ALIGNOF_EXPR
26856 || TREE_CODE (expression
) == AT_ENCODE_EXPR
26857 || TREE_CODE (expression
) == NOEXCEPT_EXPR
26858 || TREE_CODE (expression
) == TRAIT_EXPR
26859 || TREE_CODE (expression
) == TYPEID_EXPR
26860 || TREE_CODE (expression
) == DELETE_EXPR
26861 || TREE_CODE (expression
) == VEC_DELETE_EXPR
26862 || TREE_CODE (expression
) == THROW_EXPR
26863 || TREE_CODE (expression
) == REQUIRES_EXPR
)
26866 /* The types of these expressions depends only on the type to which
26867 the cast occurs. */
26868 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
26869 || TREE_CODE (expression
) == STATIC_CAST_EXPR
26870 || TREE_CODE (expression
) == CONST_CAST_EXPR
26871 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
26872 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
26873 || TREE_CODE (expression
) == CAST_EXPR
)
26874 return dependent_type_p (TREE_TYPE (expression
));
26876 /* The types of these expressions depends only on the type created
26877 by the expression. */
26878 if (TREE_CODE (expression
) == NEW_EXPR
26879 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
26881 /* For NEW_EXPR tree nodes created inside a template, either
26882 the object type itself or a TREE_LIST may appear as the
26884 tree type
= TREE_OPERAND (expression
, 1);
26885 if (TREE_CODE (type
) == TREE_LIST
)
26886 /* This is an array type. We need to check array dimensions
26888 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
26889 || value_dependent_expression_p
26890 (TREE_OPERAND (TREE_VALUE (type
), 1));
26891 /* Array type whose dimension has to be deduced. */
26892 else if (TREE_CODE (type
) == ARRAY_TYPE
26893 && TREE_OPERAND (expression
, 2) == NULL_TREE
)
26896 return dependent_type_p (type
);
26899 if (TREE_CODE (expression
) == SCOPE_REF
)
26901 tree scope
= TREE_OPERAND (expression
, 0);
26902 tree name
= TREE_OPERAND (expression
, 1);
26904 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
26905 contains an identifier associated by name lookup with one or more
26906 declarations declared with a dependent type, or...a
26907 nested-name-specifier or qualified-id that names a member of an
26908 unknown specialization. */
26909 return (type_dependent_expression_p (name
)
26910 || dependent_scope_p (scope
));
26913 if (TREE_CODE (expression
) == TEMPLATE_DECL
26914 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
26915 return uses_outer_template_parms (expression
);
26917 if (TREE_CODE (expression
) == STMT_EXPR
)
26918 expression
= stmt_expr_value_expr (expression
);
26920 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
26925 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
26927 if (type_dependent_expression_p (elt
))
26933 /* A static data member of the current instantiation with incomplete
26934 array type is type-dependent, as the definition and specializations
26935 can have different bounds. */
26936 if (VAR_P (expression
)
26937 && DECL_CLASS_SCOPE_P (expression
)
26938 && dependent_type_p (DECL_CONTEXT (expression
))
26939 && VAR_HAD_UNKNOWN_BOUND (expression
))
26942 /* An array of unknown bound depending on a variadic parameter, eg:
26944 template<typename... Args>
26945 void foo (Args... args)
26947 int arr[] = { args... };
26950 template<int... vals>
26953 int arr[] = { vals... };
26956 If the array has no length and has an initializer, it must be that
26957 we couldn't determine its length in cp_complete_array_type because
26958 it is dependent. */
26959 if (VAR_P (expression
)
26960 && TREE_TYPE (expression
) != NULL_TREE
26961 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
26962 && !TYPE_DOMAIN (TREE_TYPE (expression
))
26963 && DECL_INITIAL (expression
))
26966 /* A function or variable template-id is type-dependent if it has any
26967 dependent template arguments. */
26968 if (VAR_OR_FUNCTION_DECL_P (expression
)
26969 && DECL_LANG_SPECIFIC (expression
)
26970 && DECL_TEMPLATE_INFO (expression
))
26972 /* Consider the innermost template arguments, since those are the ones
26973 that come from the template-id; the template arguments for the
26974 enclosing class do not make it type-dependent unless they are used in
26975 the type of the decl. */
26976 if (instantiates_primary_template_p (expression
)
26977 && (any_dependent_template_arguments_p
26978 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
26982 /* Otherwise, if the function decl isn't from a dependent scope, it can't be
26983 type-dependent. Checking this is important for functions with auto return
26984 type, which looks like a dependent type. */
26985 if (TREE_CODE (expression
) == FUNCTION_DECL
26986 && !(DECL_CLASS_SCOPE_P (expression
)
26987 && dependent_type_p (DECL_CONTEXT (expression
)))
26988 && !(DECL_LANG_SPECIFIC (expression
)
26989 && DECL_FRIEND_P (expression
)
26990 && (!DECL_FRIEND_CONTEXT (expression
)
26991 || dependent_type_p (DECL_FRIEND_CONTEXT (expression
))))
26992 && !DECL_LOCAL_DECL_P (expression
))
26994 gcc_assert (!dependent_type_p (TREE_TYPE (expression
))
26995 || undeduced_auto_decl (expression
));
26999 /* Always dependent, on the number of arguments if nothing else. */
27000 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
27003 if (TREE_TYPE (expression
) == unknown_type_node
)
27005 if (TREE_CODE (expression
) == ADDR_EXPR
)
27006 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
27007 if (TREE_CODE (expression
) == COMPONENT_REF
27008 || TREE_CODE (expression
) == OFFSET_REF
)
27010 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
27012 expression
= TREE_OPERAND (expression
, 1);
27013 if (identifier_p (expression
))
27016 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
27017 if (TREE_CODE (expression
) == SCOPE_REF
)
27020 /* CO_AWAIT/YIELD_EXPR with unknown type is always dependent. */
27021 if (TREE_CODE (expression
) == CO_AWAIT_EXPR
27022 || TREE_CODE (expression
) == CO_YIELD_EXPR
)
27025 if (BASELINK_P (expression
))
27027 if (BASELINK_OPTYPE (expression
)
27028 && dependent_type_p (BASELINK_OPTYPE (expression
)))
27030 expression
= BASELINK_FUNCTIONS (expression
);
27033 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
27035 if (any_dependent_template_arguments_p
27036 (TREE_OPERAND (expression
, 1)))
27038 expression
= TREE_OPERAND (expression
, 0);
27039 if (identifier_p (expression
))
27043 gcc_assert (OVL_P (expression
));
27045 for (lkp_iterator
iter (expression
); iter
; ++iter
)
27046 if (type_dependent_expression_p (*iter
))
27052 /* The type of a non-type template parm declared with a placeholder type
27053 depends on the corresponding template argument, even though
27054 placeholders are not normally considered dependent. */
27055 if (TREE_CODE (expression
) == TEMPLATE_PARM_INDEX
27056 && is_auto (TREE_TYPE (expression
)))
27059 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
27061 /* Dependent type attributes might not have made it from the decl to
27063 if (DECL_P (expression
)
27064 && any_dependent_type_attributes_p (DECL_ATTRIBUTES (expression
)))
27067 return (dependent_type_p (TREE_TYPE (expression
)));
27070 /* [temp.dep.expr]/5: A class member access expression (5.2.5) is
27071 type-dependent if the expression refers to a member of the current
27072 instantiation and the type of the referenced member is dependent, or the
27073 class member access expression refers to a member of an unknown
27076 This function returns true if the OBJECT in such a class member access
27077 expression is of an unknown specialization. */
27080 type_dependent_object_expression_p (tree object
)
27082 /* An IDENTIFIER_NODE can sometimes have a TREE_TYPE, but it's still
27084 if (TREE_CODE (object
) == IDENTIFIER_NODE
)
27086 tree scope
= TREE_TYPE (object
);
27087 return (!scope
|| dependent_scope_p (scope
));
27090 /* walk_tree callback function for instantiation_dependent_expression_p,
27091 below. Returns non-zero if a dependent subexpression is found. */
27094 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
27099 /* We don't have to worry about decltype currently because decltype
27100 of an instantiation-dependent expr is a dependent type. This
27101 might change depending on the resolution of DR 1172. */
27102 *walk_subtrees
= false;
27105 enum tree_code code
= TREE_CODE (*tp
);
27108 /* Don't treat an argument list as dependent just because it has no
27112 case NONTYPE_ARGUMENT_PACK
:
27115 case TEMPLATE_PARM_INDEX
:
27116 if (dependent_type_p (TREE_TYPE (*tp
)))
27118 if (TEMPLATE_PARM_PARAMETER_PACK (*tp
))
27120 /* We'll check value-dependence separately. */
27123 /* Handle expressions with type operands. */
27127 case AT_ENCODE_EXPR
:
27129 tree op
= TREE_OPERAND (*tp
, 0);
27130 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
27131 op
= TREE_TYPE (op
);
27134 if (dependent_type_p (op
))
27138 *walk_subtrees
= false;
27145 case COMPONENT_REF
:
27146 if (identifier_p (TREE_OPERAND (*tp
, 1)))
27147 /* In a template, finish_class_member_access_expr creates a
27148 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
27149 type-dependent, so that we can check access control at
27150 instantiation time (PR 42277). See also Core issue 1273. */
27155 if (instantiation_dependent_scope_ref_p (*tp
))
27160 /* Treat statement-expressions as dependent. */
27164 /* Treat requires-expressions as dependent. */
27165 case REQUIRES_EXPR
:
27169 /* Treat concept checks as dependent. */
27170 if (concept_check_p (*tp
))
27174 case TEMPLATE_ID_EXPR
:
27175 /* Treat concept checks as dependent. */
27176 if (concept_check_p (*tp
))
27181 if (CONSTRUCTOR_IS_DEPENDENT (*tp
))
27189 if (type_dependent_expression_p (*tp
))
27195 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
27196 sense defined by the ABI:
27198 "An expression is instantiation-dependent if it is type-dependent
27199 or value-dependent, or it has a subexpression that is type-dependent
27200 or value-dependent."
27202 Except don't actually check value-dependence for unevaluated expressions,
27203 because in sizeof(i) we don't care about the value of i. Checking
27204 type-dependence will in turn check value-dependence of array bounds/template
27205 arguments as needed. */
27208 instantiation_dependent_uneval_expression_p (tree expression
)
27212 if (!processing_template_decl
)
27215 if (expression
== error_mark_node
)
27218 result
= cp_walk_tree_without_duplicates (&expression
,
27219 instantiation_dependent_r
, NULL
);
27220 return result
!= NULL_TREE
;
27223 /* As above, but also check value-dependence of the expression as a whole. */
27226 instantiation_dependent_expression_p (tree expression
)
27228 return (instantiation_dependent_uneval_expression_p (expression
)
27229 || value_dependent_expression_p (expression
));
27232 /* Like type_dependent_expression_p, but it also works while not processing
27233 a template definition, i.e. during substitution or mangling. */
27236 type_dependent_expression_p_push (tree expr
)
27239 ++processing_template_decl
;
27240 b
= type_dependent_expression_p (expr
);
27241 --processing_template_decl
;
27245 /* Returns TRUE if ARGS contains a type-dependent expression. */
27248 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
27253 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
27255 if (type_dependent_expression_p (arg
))
27261 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
27262 expressions) contains any type-dependent expressions. */
27265 any_type_dependent_elements_p (const_tree list
)
27267 for (; list
; list
= TREE_CHAIN (list
))
27268 if (type_dependent_expression_p (TREE_VALUE (list
)))
27274 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
27275 expressions) contains any value-dependent expressions. */
27278 any_value_dependent_elements_p (const_tree list
)
27280 for (; list
; list
= TREE_CHAIN (list
))
27281 if (value_dependent_expression_p (TREE_VALUE (list
)))
27287 /* Returns TRUE if the ARG (a template argument) is dependent. */
27290 dependent_template_arg_p (tree arg
)
27292 if (!processing_template_decl
)
27295 /* Assume a template argument that was wrongly written by the user
27296 is dependent. This is consistent with what
27297 any_dependent_template_arguments_p [that calls this function]
27299 if (!arg
|| arg
== error_mark_node
)
27302 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
27303 arg
= argument_pack_select_arg (arg
);
27305 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
27307 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
27309 if (DECL_TEMPLATE_PARM_P (arg
))
27311 /* A member template of a dependent class is not necessarily
27312 type-dependent, but it is a dependent template argument because it
27313 will be a member of an unknown specialization to that template. */
27314 tree scope
= CP_DECL_CONTEXT (arg
);
27315 return TYPE_P (scope
) && dependent_type_p (scope
);
27317 else if (ARGUMENT_PACK_P (arg
))
27319 tree args
= ARGUMENT_PACK_ARGS (arg
);
27320 int i
, len
= TREE_VEC_LENGTH (args
);
27321 for (i
= 0; i
< len
; ++i
)
27323 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
27329 else if (TYPE_P (arg
))
27330 return dependent_type_p (arg
);
27332 return value_dependent_expression_p (arg
);
27335 /* Returns true if ARGS (a collection of template arguments) contains
27336 any types that require structural equality testing. */
27339 any_template_arguments_need_structural_equality_p (tree args
)
27346 if (args
== error_mark_node
)
27349 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
27351 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
27352 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
27354 tree arg
= TREE_VEC_ELT (level
, j
);
27355 tree packed_args
= NULL_TREE
;
27358 if (ARGUMENT_PACK_P (arg
))
27360 /* Look inside the argument pack. */
27361 packed_args
= ARGUMENT_PACK_ARGS (arg
);
27362 len
= TREE_VEC_LENGTH (packed_args
);
27365 for (k
= 0; k
< len
; ++k
)
27368 arg
= TREE_VEC_ELT (packed_args
, k
);
27370 if (error_operand_p (arg
))
27372 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
27374 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
27376 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
27377 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
27386 /* Returns true if ARGS (a collection of template arguments) contains
27387 any dependent arguments. */
27390 any_dependent_template_arguments_p (const_tree args
)
27397 if (args
== error_mark_node
)
27400 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
27402 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
27403 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
27404 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
27411 /* Returns true if ARGS contains any errors. */
27414 any_erroneous_template_args_p (const_tree args
)
27419 if (args
== error_mark_node
)
27422 if (args
&& TREE_CODE (args
) != TREE_VEC
)
27424 if (tree ti
= get_template_info (args
))
27425 args
= TI_ARGS (ti
);
27433 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
27435 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
27436 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
27437 if (error_operand_p (TREE_VEC_ELT (level
, j
)))
27444 /* Returns TRUE if the template TMPL is type-dependent. */
27447 dependent_template_p (tree tmpl
)
27449 if (TREE_CODE (tmpl
) == OVERLOAD
)
27451 for (lkp_iterator
iter (tmpl
); iter
; ++iter
)
27452 if (dependent_template_p (*iter
))
27457 /* Template template parameters are dependent. */
27458 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
27459 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
27461 /* So are names that have not been looked up. */
27462 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
27467 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
27470 dependent_template_id_p (tree tmpl
, tree args
)
27472 return (dependent_template_p (tmpl
)
27473 || any_dependent_template_arguments_p (args
));
27476 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
27480 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
27484 if (!processing_template_decl
)
27487 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
27489 tree decl
= TREE_VEC_ELT (declv
, i
);
27490 tree init
= TREE_VEC_ELT (initv
, i
);
27491 tree cond
= TREE_VEC_ELT (condv
, i
);
27492 tree incr
= TREE_VEC_ELT (incrv
, i
);
27494 if (type_dependent_expression_p (decl
)
27495 || TREE_CODE (decl
) == SCOPE_REF
)
27498 if (init
&& type_dependent_expression_p (init
))
27501 if (cond
== global_namespace
)
27504 if (type_dependent_expression_p (cond
))
27507 if (COMPARISON_CLASS_P (cond
)
27508 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
27509 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
27512 if (TREE_CODE (incr
) == MODOP_EXPR
)
27514 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
27515 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
27518 else if (type_dependent_expression_p (incr
))
27520 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
27522 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
27524 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
27526 tree t
= TREE_OPERAND (incr
, 1);
27527 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
27528 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
27531 /* If this loop has a class iterator with != comparison
27532 with increment other than i++/++i/i--/--i, make sure the
27533 increment is constant. */
27534 if (CLASS_TYPE_P (TREE_TYPE (decl
))
27535 && TREE_CODE (cond
) == NE_EXPR
)
27537 if (TREE_OPERAND (t
, 0) == decl
)
27538 t
= TREE_OPERAND (t
, 1);
27540 t
= TREE_OPERAND (t
, 0);
27541 if (TREE_CODE (t
) != INTEGER_CST
)
27551 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
27552 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
27553 no such TYPE can be found. Note that this function peers inside
27554 uninstantiated templates and therefore should be used only in
27555 extremely limited situations. ONLY_CURRENT_P restricts this
27556 peering to the currently open classes hierarchy (which is required
27557 when comparing types). */
27560 resolve_typename_type (tree type
, bool only_current_p
)
27569 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
27571 scope
= TYPE_CONTEXT (type
);
27572 /* We shouldn't have built a TYPENAME_TYPE with a non-dependent scope. */
27573 gcc_checking_assert (uses_template_parms (scope
));
27575 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
27576 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of a
27577 TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL
27578 representing the typedef. In that case TYPE_IDENTIFIER (type) is
27579 not the non-qualified identifier of the TYPENAME_TYPE anymore.
27580 So by getting the TYPE_IDENTIFIER of the _main declaration_ of
27581 the TYPENAME_TYPE instead, we avoid messing up with a possible
27582 typedef variant case. */
27583 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
27585 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
27586 it first before we can figure out what NAME refers to. */
27587 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
27589 if (TYPENAME_IS_RESOLVING_P (scope
))
27590 /* Given a class template A with a dependent base with nested type C,
27591 typedef typename A::C::C C will land us here, as trying to resolve
27592 the initial A::C leads to the local C typedef, which leads back to
27593 A::C::C. So we break the recursion now. */
27596 scope
= resolve_typename_type (scope
, only_current_p
);
27598 /* If we don't know what SCOPE refers to, then we cannot resolve the
27600 if (!CLASS_TYPE_P (scope
))
27602 /* If this is a typedef, we don't want to look inside (c++/11987). */
27603 if (typedef_variant_p (type
))
27605 /* If SCOPE isn't the template itself, it will not have a valid
27606 TYPE_FIELDS list. */
27607 if (same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
27608 /* scope is either the template itself or a compatible instantiation
27609 like X<T>, so look up the name in the original template. */
27610 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
27611 /* If scope has no fields, it can't be a current instantiation. Check this
27612 before currently_open_class to avoid infinite recursion (71515). */
27613 if (!TYPE_FIELDS (scope
))
27615 /* If the SCOPE is not the current instantiation, there's no reason
27616 to look inside it. */
27617 if (only_current_p
&& !currently_open_class (scope
))
27619 /* Enter the SCOPE so that name lookup will be resolved as if we
27620 were in the class definition. In particular, SCOPE will no
27621 longer be considered a dependent type. */
27622 pushed_scope
= push_scope (scope
);
27623 /* Look up the declaration. */
27624 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
27625 tf_warning_or_error
);
27627 result
= NULL_TREE
;
27629 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
27630 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
27631 tree fullname
= TYPENAME_TYPE_FULLNAME (type
);
27634 else if (identifier_p (fullname
)
27635 && TREE_CODE (decl
) == TYPE_DECL
)
27637 result
= TREE_TYPE (decl
);
27638 if (result
== error_mark_node
)
27639 result
= NULL_TREE
;
27641 else if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
27642 && DECL_CLASS_TEMPLATE_P (decl
))
27644 /* Obtain the template and the arguments. */
27645 tree tmpl
= TREE_OPERAND (fullname
, 0);
27646 if (TREE_CODE (tmpl
) == IDENTIFIER_NODE
)
27648 /* We get here with a plain identifier because a previous tentative
27649 parse of the nested-name-specifier as part of a ptr-operator saw
27650 ::template X<A>. The use of ::template is necessary in a
27651 ptr-operator, but wrong in a declarator-id.
27653 [temp.names]: In a qualified-id of a declarator-id, the keyword
27654 template shall not appear at the top level. */
27655 pedwarn (cp_expr_loc_or_input_loc (fullname
), OPT_Wpedantic
,
27656 "keyword %<template%> not allowed in declarator-id");
27659 tree args
= TREE_OPERAND (fullname
, 1);
27660 /* Instantiate the template. */
27661 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
27662 /*entering_scope=*/true,
27663 tf_error
| tf_user
);
27664 if (result
== error_mark_node
)
27665 result
= NULL_TREE
;
27668 /* Leave the SCOPE. */
27670 pop_scope (pushed_scope
);
27672 /* If we failed to resolve it, return the original typename. */
27676 /* If lookup found a typename type, resolve that too. */
27677 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
27679 /* Ill-formed programs can cause infinite recursion here, so we
27680 must catch that. */
27681 TYPENAME_IS_RESOLVING_P (result
) = 1;
27682 result
= resolve_typename_type (result
, only_current_p
);
27683 TYPENAME_IS_RESOLVING_P (result
) = 0;
27686 /* Qualify the resulting type. */
27687 quals
= cp_type_quals (type
);
27689 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
27694 /* EXPR is an expression which is not type-dependent. Return a proxy
27695 for EXPR that can be used to compute the types of larger
27696 expressions containing EXPR. */
27699 build_non_dependent_expr (tree expr
)
27701 tree orig_expr
= expr
;
27704 /* When checking, try to get a constant value for all non-dependent
27705 expressions in order to expose bugs in *_dependent_expression_p
27706 and constexpr. This can affect code generation, see PR70704, so
27707 only do this for -fchecking=2. */
27708 if (flag_checking
> 1
27709 && cxx_dialect
>= cxx11
27710 /* Don't do this during nsdmi parsing as it can lead to
27711 unexpected recursive instantiations. */
27712 && !parsing_nsdmi ()
27713 /* Don't do this during concept processing either and for
27714 the same reason. */
27715 && !processing_constraint_expression_p ())
27716 fold_non_dependent_expr (expr
, tf_none
);
27718 STRIP_ANY_LOCATION_WRAPPER (expr
);
27720 /* Preserve OVERLOADs; the functions must be available to resolve
27723 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
27724 inner_expr
= stmt_expr_value_expr (inner_expr
);
27725 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
27726 inner_expr
= TREE_OPERAND (inner_expr
, 0);
27727 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
27728 inner_expr
= TREE_OPERAND (inner_expr
, 1);
27729 if (is_overloaded_fn (inner_expr
)
27730 || TREE_CODE (inner_expr
) == OFFSET_REF
)
27732 /* There is no need to return a proxy for a variable or enumerator. */
27733 if (VAR_P (expr
) || TREE_CODE (expr
) == CONST_DECL
)
27735 /* Preserve string constants; conversions from string constants to
27736 "char *" are allowed, even though normally a "const char *"
27737 cannot be used to initialize a "char *". */
27738 if (TREE_CODE (expr
) == STRING_CST
)
27740 /* Preserve void and arithmetic constants, as an optimization -- there is no
27741 reason to create a new node. */
27742 if (TREE_CODE (expr
) == VOID_CST
27743 || TREE_CODE (expr
) == INTEGER_CST
27744 || TREE_CODE (expr
) == REAL_CST
)
27746 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
27747 There is at least one place where we want to know that a
27748 particular expression is a throw-expression: when checking a ?:
27749 expression, there are special rules if the second or third
27750 argument is a throw-expression. */
27751 if (TREE_CODE (expr
) == THROW_EXPR
)
27754 /* Don't wrap an initializer list, we need to be able to look inside. */
27755 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
27758 /* Don't wrap a dummy object, we need to be able to test for it. */
27759 if (is_dummy_object (expr
))
27762 if (TREE_CODE (expr
) == COND_EXPR
)
27763 return build3 (COND_EXPR
,
27765 build_non_dependent_expr (TREE_OPERAND (expr
, 0)),
27766 (TREE_OPERAND (expr
, 1)
27767 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
27768 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
27769 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
27770 if (TREE_CODE (expr
) == COMPOUND_EXPR
27771 && !COMPOUND_EXPR_OVERLOADED (expr
))
27772 return build2 (COMPOUND_EXPR
,
27774 TREE_OPERAND (expr
, 0),
27775 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
27777 /* If the type is unknown, it can't really be non-dependent */
27778 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
27780 /* Otherwise, build a NON_DEPENDENT_EXPR. */
27781 return build1_loc (EXPR_LOCATION (orig_expr
), NON_DEPENDENT_EXPR
,
27782 TREE_TYPE (expr
), expr
);
27785 /* ARGS is a vector of expressions as arguments to a function call.
27786 Replace the arguments with equivalent non-dependent expressions.
27787 This modifies ARGS in place. */
27790 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
27795 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
27797 tree newarg
= build_non_dependent_expr (arg
);
27799 (*args
)[ix
] = newarg
;
27803 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
27804 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
27805 parms. If set_canonical is true, we set TYPE_CANONICAL on it. */
27808 make_auto_1 (tree name
, bool set_canonical
)
27810 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
27811 TYPE_NAME (au
) = build_decl (input_location
, TYPE_DECL
, name
, au
);
27812 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
27813 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
27814 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
27815 TYPE_NAME (au
), NULL_TREE
);
27817 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
27818 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
27819 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
27820 if (name
== decltype_auto_identifier
)
27821 AUTO_IS_DECLTYPE (au
) = true;
27827 make_decltype_auto (void)
27829 return make_auto_1 (decltype_auto_identifier
, true);
27835 return make_auto_1 (auto_identifier
, true);
27838 /* Return a C++17 deduction placeholder for class template TMPL. */
27841 make_template_placeholder (tree tmpl
)
27843 tree t
= make_auto_1 (auto_identifier
, false);
27844 CLASS_PLACEHOLDER_TEMPLATE (t
) = tmpl
;
27845 /* Our canonical type depends on the placeholder. */
27846 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
27850 /* True iff T is a C++17 class template deduction placeholder. */
27853 template_placeholder_p (tree t
)
27855 return is_auto (t
) && CLASS_PLACEHOLDER_TEMPLATE (t
);
27858 /* Make a "constrained auto" type-specifier. This is an auto or
27859 decltype(auto) type with constraints that must be associated after
27860 deduction. The constraint is formed from the given concept CON
27861 and its optional sequence of template arguments ARGS.
27863 TYPE must be the result of make_auto_type or make_decltype_auto_type. */
27866 make_constrained_placeholder_type (tree type
, tree con
, tree args
)
27868 /* Build the constraint. */
27869 tree tmpl
= DECL_TI_TEMPLATE (con
);
27871 if (TREE_CODE (con
) == FUNCTION_DECL
)
27872 expr
= ovl_make (tmpl
);
27873 expr
= build_concept_check (expr
, type
, args
, tf_warning_or_error
);
27875 PLACEHOLDER_TYPE_CONSTRAINTS (type
) = expr
;
27877 /* Our canonical type depends on the constraint. */
27878 TYPE_CANONICAL (type
) = canonical_type_parameter (type
);
27880 /* Attach the constraint to the type declaration. */
27881 return TYPE_NAME (type
);
27884 /* Make a "constrained auto" type-specifier. */
27887 make_constrained_auto (tree con
, tree args
)
27889 tree type
= make_auto_1 (auto_identifier
, false);
27890 return make_constrained_placeholder_type (type
, con
, args
);
27893 /* Make a "constrained decltype(auto)" type-specifier. */
27896 make_constrained_decltype_auto (tree con
, tree args
)
27898 tree type
= make_auto_1 (decltype_auto_identifier
, false);
27899 return make_constrained_placeholder_type (type
, con
, args
);
27902 /* Build and return a concept definition. Like other templates, the
27903 CONCEPT_DECL node is wrapped by a TEMPLATE_DECL. This returns the
27904 the TEMPLATE_DECL. */
27907 finish_concept_definition (cp_expr id
, tree init
)
27909 gcc_assert (identifier_p (id
));
27910 gcc_assert (processing_template_decl
);
27912 location_t loc
= id
.get_location();
27914 /* A concept-definition shall not have associated constraints. */
27915 if (TEMPLATE_PARMS_CONSTRAINTS (current_template_parms
))
27917 error_at (loc
, "a concept cannot be constrained");
27918 TEMPLATE_PARMS_CONSTRAINTS (current_template_parms
) = NULL_TREE
;
27921 /* A concept-definition shall appear in namespace scope. Templates
27922 aren't allowed in block scope, so we only need to check for class
27924 if (TYPE_P (current_scope()) || !DECL_NAMESPACE_SCOPE_P (current_scope ()))
27926 error_at (loc
, "concept %qE not in namespace scope", *id
);
27927 return error_mark_node
;
27930 /* Initially build the concept declaration; its type is bool. */
27931 tree decl
= build_lang_decl_loc (loc
, CONCEPT_DECL
, *id
, boolean_type_node
);
27932 DECL_CONTEXT (decl
) = current_scope ();
27933 DECL_INITIAL (decl
) = init
;
27935 /* Push the enclosing template. */
27936 return push_template_decl (decl
);
27939 /* Given type ARG, return std::initializer_list<ARG>. */
27944 tree std_init_list
= get_namespace_binding (std_node
, init_list_identifier
);
27946 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
27948 gcc_rich_location
richloc (input_location
);
27949 maybe_add_include_fixit (&richloc
, "<initializer_list>", false);
27950 error_at (&richloc
,
27951 "deducing from brace-enclosed initializer list"
27952 " requires %<#include <initializer_list>%>");
27954 return error_mark_node
;
27956 tree argvec
= make_tree_vec (1);
27957 TREE_VEC_ELT (argvec
, 0) = arg
;
27959 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
27960 NULL_TREE
, 0, tf_warning_or_error
);
27963 /* Replace auto in TYPE with std::initializer_list<auto>. */
27966 listify_autos (tree type
, tree auto_node
)
27968 tree init_auto
= listify (strip_top_quals (auto_node
));
27969 tree argvec
= make_tree_vec (1);
27970 TREE_VEC_ELT (argvec
, 0) = init_auto
;
27971 if (processing_template_decl
)
27972 argvec
= add_to_template_args (current_template_args (), argvec
);
27973 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
27976 /* Hash traits for hashing possibly constrained 'auto'
27977 TEMPLATE_TYPE_PARMs for use by do_auto_deduction. */
27979 struct auto_hash
: default_hash_traits
<tree
>
27981 static inline hashval_t
hash (tree
);
27982 static inline bool equal (tree
, tree
);
27985 /* Hash the 'auto' T. */
27988 auto_hash::hash (tree t
)
27990 if (tree c
= NON_ERROR (PLACEHOLDER_TYPE_CONSTRAINTS (t
)))
27991 /* Matching constrained-type-specifiers denote the same template
27992 parameter, so hash the constraint. */
27993 return hash_placeholder_constraint (c
);
27995 /* But unconstrained autos are all separate, so just hash the pointer. */
27996 return iterative_hash_object (t
, 0);
27999 /* Compare two 'auto's. */
28002 auto_hash::equal (tree t1
, tree t2
)
28007 tree c1
= PLACEHOLDER_TYPE_CONSTRAINTS (t1
);
28008 tree c2
= PLACEHOLDER_TYPE_CONSTRAINTS (t2
);
28010 /* Two unconstrained autos are distinct. */
28014 return equivalent_placeholder_constraints (c1
, c2
);
28017 /* for_each_template_parm callback for extract_autos: if t is a (possibly
28018 constrained) auto, add it to the vector. */
28021 extract_autos_r (tree t
, void *data
)
28023 hash_table
<auto_hash
> &hash
= *(hash_table
<auto_hash
>*)data
;
28026 /* All the autos were built with index 0; fix that up now. */
28027 tree
*p
= hash
.find_slot (t
, INSERT
);
28030 /* If this is a repeated constrained-type-specifier, use the index we
28032 idx
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (*p
));
28035 /* Otherwise this is new, so use the current count. */
28037 idx
= hash
.elements () - 1;
28039 TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (t
)) = idx
;
28042 /* Always keep walking. */
28046 /* Return a TREE_VEC of the 'auto's used in type under the Concepts TS, which
28047 says they can appear anywhere in the type. */
28050 extract_autos (tree type
)
28052 hash_set
<tree
> visited
;
28053 hash_table
<auto_hash
> hash (2);
28055 for_each_template_parm (type
, extract_autos_r
, &hash
, &visited
, true);
28057 tree tree_vec
= make_tree_vec (hash
.elements());
28058 for (hash_table
<auto_hash
>::iterator iter
= hash
.begin();
28059 iter
!= hash
.end(); ++iter
)
28062 unsigned i
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (elt
));
28063 TREE_VEC_ELT (tree_vec
, i
)
28064 = build_tree_list (NULL_TREE
, TYPE_NAME (elt
));
28070 /* The stem for deduction guide names. */
28071 const char *const dguide_base
= "__dguide_";
28073 /* Return the name for a deduction guide for class template TMPL. */
28076 dguide_name (tree tmpl
)
28078 tree type
= (TYPE_P (tmpl
) ? tmpl
: TREE_TYPE (tmpl
));
28079 tree tname
= TYPE_IDENTIFIER (type
);
28080 char *buf
= (char *) alloca (1 + strlen (dguide_base
)
28081 + IDENTIFIER_LENGTH (tname
));
28082 memcpy (buf
, dguide_base
, strlen (dguide_base
));
28083 memcpy (buf
+ strlen (dguide_base
), IDENTIFIER_POINTER (tname
),
28084 IDENTIFIER_LENGTH (tname
) + 1);
28085 tree dname
= get_identifier (buf
);
28086 TREE_TYPE (dname
) = type
;
28090 /* True if NAME is the name of a deduction guide. */
28093 dguide_name_p (tree name
)
28095 return (TREE_CODE (name
) == IDENTIFIER_NODE
28096 && TREE_TYPE (name
)
28097 && !strncmp (IDENTIFIER_POINTER (name
), dguide_base
,
28098 strlen (dguide_base
)));
28101 /* True if FN is a deduction guide. */
28104 deduction_guide_p (const_tree fn
)
28107 if (tree name
= DECL_NAME (fn
))
28108 return dguide_name_p (name
);
28112 /* True if FN is the copy deduction guide, i.e. A(A)->A. */
28115 copy_guide_p (const_tree fn
)
28117 gcc_assert (deduction_guide_p (fn
));
28118 if (!DECL_ARTIFICIAL (fn
))
28120 tree parms
= FUNCTION_FIRST_USER_PARMTYPE (DECL_TI_TEMPLATE (fn
));
28121 return (TREE_CHAIN (parms
) == void_list_node
28122 && same_type_p (TREE_VALUE (parms
), TREE_TYPE (DECL_NAME (fn
))));
28125 /* True if FN is a guide generated from a constructor template. */
28128 template_guide_p (const_tree fn
)
28130 gcc_assert (deduction_guide_p (fn
));
28131 if (!DECL_ARTIFICIAL (fn
))
28133 tree tmpl
= DECL_TI_TEMPLATE (fn
);
28134 if (tree org
= DECL_ABSTRACT_ORIGIN (tmpl
))
28135 return PRIMARY_TEMPLATE_P (org
);
28139 /* True if FN is an aggregate initialization guide or the copy deduction
28143 builtin_guide_p (const_tree fn
)
28145 if (!deduction_guide_p (fn
))
28147 if (!DECL_ARTIFICIAL (fn
))
28148 /* Explicitly declared. */
28150 if (DECL_ABSTRACT_ORIGIN (fn
))
28151 /* Derived from a constructor. */
28156 /* OLDDECL is a _DECL for a template parameter. Return a similar parameter at
28157 LEVEL:INDEX, using tsubst_args and complain for substitution into non-type
28158 template parameter types. Note that the handling of template template
28159 parameters relies on current_template_parms being set appropriately for the
28163 rewrite_template_parm (tree olddecl
, unsigned index
, unsigned level
,
28164 tree tsubst_args
, tsubst_flags_t complain
)
28166 if (olddecl
== error_mark_node
)
28167 return error_mark_node
;
28169 tree oldidx
= get_template_parm_index (olddecl
);
28172 if (TREE_CODE (olddecl
) == TYPE_DECL
28173 || TREE_CODE (olddecl
) == TEMPLATE_DECL
)
28175 tree oldtype
= TREE_TYPE (olddecl
);
28176 newtype
= cxx_make_type (TREE_CODE (oldtype
));
28177 TYPE_MAIN_VARIANT (newtype
) = newtype
;
28178 if (TREE_CODE (oldtype
) == TEMPLATE_TYPE_PARM
)
28179 TEMPLATE_TYPE_PARM_FOR_CLASS (newtype
)
28180 = TEMPLATE_TYPE_PARM_FOR_CLASS (oldtype
);
28184 newtype
= TREE_TYPE (olddecl
);
28185 if (type_uses_auto (newtype
))
28187 // Substitute once to fix references to other template parameters.
28188 newtype
= tsubst (newtype
, tsubst_args
,
28189 complain
|tf_partial
, NULL_TREE
);
28190 // Now substitute again to reduce the level of the auto.
28191 newtype
= tsubst (newtype
, current_template_args (),
28192 complain
, NULL_TREE
);
28195 newtype
= tsubst (newtype
, tsubst_args
,
28196 complain
, NULL_TREE
);
28200 = build_decl (DECL_SOURCE_LOCATION (olddecl
), TREE_CODE (olddecl
),
28201 DECL_NAME (olddecl
), newtype
);
28202 SET_DECL_TEMPLATE_PARM_P (newdecl
);
28205 if (TREE_CODE (olddecl
) == TYPE_DECL
28206 || TREE_CODE (olddecl
) == TEMPLATE_DECL
)
28208 newidx
= TEMPLATE_TYPE_PARM_INDEX (newtype
)
28209 = build_template_parm_index (index
, level
, level
,
28211 TEMPLATE_PARM_PARAMETER_PACK (newidx
)
28212 = TEMPLATE_PARM_PARAMETER_PACK (oldidx
);
28213 TYPE_STUB_DECL (newtype
) = TYPE_NAME (newtype
) = newdecl
;
28214 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (olddecl
)))
28215 SET_TYPE_STRUCTURAL_EQUALITY (newtype
);
28217 TYPE_CANONICAL (newtype
) = canonical_type_parameter (newtype
);
28219 if (TREE_CODE (olddecl
) == TEMPLATE_DECL
)
28221 DECL_TEMPLATE_RESULT (newdecl
)
28222 = build_decl (DECL_SOURCE_LOCATION (olddecl
), TYPE_DECL
,
28223 DECL_NAME (olddecl
), newtype
);
28224 DECL_ARTIFICIAL (DECL_TEMPLATE_RESULT (newdecl
)) = true;
28225 // First create a copy (ttargs) of tsubst_args with an
28226 // additional level for the template template parameter's own
28227 // template parameters (ttparms).
28228 tree ttparms
= (INNERMOST_TEMPLATE_PARMS
28229 (DECL_TEMPLATE_PARMS (olddecl
)));
28230 const int depth
= TMPL_ARGS_DEPTH (tsubst_args
);
28231 tree ttargs
= make_tree_vec (depth
+ 1);
28232 for (int i
= 0; i
< depth
; ++i
)
28233 TREE_VEC_ELT (ttargs
, i
) = TREE_VEC_ELT (tsubst_args
, i
);
28234 TREE_VEC_ELT (ttargs
, depth
)
28235 = template_parms_level_to_args (ttparms
);
28236 // Substitute ttargs into ttparms to fix references to
28237 // other template parameters.
28238 ttparms
= tsubst_template_parms_level (ttparms
, ttargs
,
28239 complain
|tf_partial
);
28240 // Now substitute again with args based on tparms, to reduce
28241 // the level of the ttparms.
28242 ttargs
= current_template_args ();
28243 ttparms
= tsubst_template_parms_level (ttparms
, ttargs
,
28245 // Finally, tack the adjusted parms onto tparms.
28246 ttparms
= tree_cons (size_int (depth
), ttparms
,
28247 current_template_parms
);
28248 DECL_TEMPLATE_PARMS (newdecl
) = ttparms
;
28253 tree oldconst
= TEMPLATE_PARM_DECL (oldidx
);
28255 = build_decl (DECL_SOURCE_LOCATION (oldconst
),
28256 TREE_CODE (oldconst
),
28257 DECL_NAME (oldconst
), newtype
);
28258 TREE_CONSTANT (newconst
) = TREE_CONSTANT (newdecl
)
28259 = TREE_READONLY (newconst
) = TREE_READONLY (newdecl
) = true;
28260 SET_DECL_TEMPLATE_PARM_P (newconst
);
28261 newidx
= build_template_parm_index (index
, level
, level
,
28262 newconst
, newtype
);
28263 TEMPLATE_PARM_PARAMETER_PACK (newidx
)
28264 = TEMPLATE_PARM_PARAMETER_PACK (oldidx
);
28265 DECL_INITIAL (newdecl
) = DECL_INITIAL (newconst
) = newidx
;
28271 /* As rewrite_template_parm, but for the whole TREE_LIST representing a
28272 template parameter. */
28275 rewrite_tparm_list (tree oldelt
, unsigned index
, unsigned level
,
28276 tree targs
, unsigned targs_index
, tsubst_flags_t complain
)
28278 tree olddecl
= TREE_VALUE (oldelt
);
28279 tree newdecl
= rewrite_template_parm (olddecl
, index
, level
,
28281 if (newdecl
== error_mark_node
)
28282 return error_mark_node
;
28283 tree newdef
= tsubst_template_arg (TREE_PURPOSE (oldelt
),
28284 targs
, complain
, NULL_TREE
);
28285 tree list
= build_tree_list (newdef
, newdecl
);
28286 TEMPLATE_PARM_CONSTRAINTS (list
)
28287 = tsubst_constraint_info (TEMPLATE_PARM_CONSTRAINTS (oldelt
),
28288 targs
, complain
, NULL_TREE
);
28289 int depth
= TMPL_ARGS_DEPTH (targs
);
28290 TMPL_ARG (targs
, depth
, targs_index
) = template_parm_to_arg (list
);
28294 /* Returns a C++17 class deduction guide template based on the constructor
28295 CTOR. As a special case, CTOR can be a RECORD_TYPE for an implicit default
28296 guide, REFERENCE_TYPE for an implicit copy/move guide, or TREE_LIST for an
28297 aggregate initialization guide. */
28300 build_deduction_guide (tree type
, tree ctor
, tree outer_args
, tsubst_flags_t complain
)
28302 tree tparms
, targs
, fparms
, fargs
, ci
;
28303 bool memtmpl
= false;
28306 tree fn_tmpl
= NULL_TREE
;
28310 ++processing_template_decl
;
28311 type
= tsubst (type
, outer_args
, complain
, CLASSTYPE_TI_TEMPLATE (type
));
28312 --processing_template_decl
;
28315 if (!DECL_DECLARES_FUNCTION_P (ctor
))
28319 bool copy_p
= TYPE_REF_P (ctor
);
28321 fparms
= tree_cons (NULL_TREE
, type
, void_list_node
);
28323 fparms
= void_list_node
;
28325 else if (TREE_CODE (ctor
) == TREE_LIST
)
28328 gcc_unreachable ();
28330 tree ctmpl
= CLASSTYPE_TI_TEMPLATE (type
);
28331 tparms
= DECL_TEMPLATE_PARMS (ctmpl
);
28332 targs
= CLASSTYPE_TI_ARGS (type
);
28335 loc
= DECL_SOURCE_LOCATION (ctmpl
);
28336 explicit_p
= false;
28340 ++processing_template_decl
;
28344 = (TREE_CODE (ctor
) == TEMPLATE_DECL
? ctor
28345 : DECL_TI_TEMPLATE (ctor
));
28347 fn_tmpl
= tsubst (fn_tmpl
, outer_args
, complain
, ctor
);
28348 ctor
= DECL_TEMPLATE_RESULT (fn_tmpl
);
28350 tparms
= DECL_TEMPLATE_PARMS (fn_tmpl
);
28351 /* If type is a member class template, DECL_TI_ARGS (ctor) will have
28352 fully specialized args for the enclosing class. Strip those off, as
28353 the deduction guide won't have those template parameters. */
28354 targs
= get_innermost_template_args (DECL_TI_ARGS (ctor
),
28355 TMPL_PARMS_DEPTH (tparms
));
28356 /* Discard the 'this' parameter. */
28357 fparms
= FUNCTION_ARG_CHAIN (ctor
);
28358 fargs
= TREE_CHAIN (DECL_ARGUMENTS (ctor
));
28359 ci
= get_constraints (ctor
);
28360 loc
= DECL_SOURCE_LOCATION (ctor
);
28361 explicit_p
= DECL_NONCONVERTING_P (ctor
);
28363 if (PRIMARY_TEMPLATE_P (fn_tmpl
))
28367 /* For a member template constructor, we need to flatten the two
28368 template parameter lists into one, and then adjust the function
28369 signature accordingly. This gets...complicated. */
28370 tree save_parms
= current_template_parms
;
28372 /* For a member template we should have two levels of parms/args, one
28373 for the class and one for the constructor. We stripped
28374 specialized args for further enclosing classes above. */
28375 const int depth
= 2;
28376 gcc_assert (TMPL_ARGS_DEPTH (targs
) == depth
);
28378 /* Template args for translating references to the two-level template
28379 parameters into references to the one-level template parameters we
28381 tree tsubst_args
= copy_node (targs
);
28382 TMPL_ARGS_LEVEL (tsubst_args
, depth
)
28383 = copy_node (TMPL_ARGS_LEVEL (tsubst_args
, depth
));
28385 /* Template parms for the constructor template. */
28386 tree ftparms
= TREE_VALUE (tparms
);
28387 unsigned flen
= TREE_VEC_LENGTH (ftparms
);
28388 /* Template parms for the class template. */
28389 tparms
= TREE_CHAIN (tparms
);
28390 tree ctparms
= TREE_VALUE (tparms
);
28391 unsigned clen
= TREE_VEC_LENGTH (ctparms
);
28392 /* Template parms for the deduction guide start as a copy of the
28393 template parms for the class. We set current_template_parms for
28394 lookup_template_class_1. */
28395 current_template_parms
= tparms
= copy_node (tparms
);
28396 tree new_vec
= TREE_VALUE (tparms
) = make_tree_vec (flen
+ clen
);
28397 for (unsigned i
= 0; i
< clen
; ++i
)
28398 TREE_VEC_ELT (new_vec
, i
) = TREE_VEC_ELT (ctparms
, i
);
28400 /* Now we need to rewrite the constructor parms to append them to the
28402 for (unsigned i
= 0; i
< flen
; ++i
)
28404 unsigned index
= i
+ clen
;
28405 unsigned level
= 1;
28406 tree oldelt
= TREE_VEC_ELT (ftparms
, i
);
28408 = rewrite_tparm_list (oldelt
, index
, level
,
28409 tsubst_args
, i
, complain
);
28410 if (newelt
== error_mark_node
)
28412 TREE_VEC_ELT (new_vec
, index
) = newelt
;
28415 /* Now we have a final set of template parms to substitute into the
28416 function signature. */
28417 targs
= template_parms_to_args (tparms
);
28418 fparms
= tsubst_arg_types (fparms
, tsubst_args
, NULL_TREE
,
28420 if (fparms
== error_mark_node
)
28423 ci
= tsubst_constraint_info (ci
, tsubst_args
, complain
, ctor
);
28425 /* Parms are to have DECL_CHAIN tsubsted, which would be skipped if
28426 cp_unevaluated_operand. */
28428 fargs
= tsubst (fargs
, tsubst_args
, complain
, ctor
);
28429 current_template_parms
= save_parms
;
28433 /* Substitute in the same arguments to rewrite class members into
28434 references to members of an unknown specialization. */
28436 fparms
= tsubst_arg_types (fparms
, targs
, NULL_TREE
, complain
, ctor
);
28437 fargs
= tsubst (fargs
, targs
, complain
, ctor
);
28439 ci
= tsubst_constraint_info (ci
, targs
, complain
, ctor
);
28442 --processing_template_decl
;
28444 return error_mark_node
;
28449 /* Copy the parms so we can set DECL_PRIMARY_TEMPLATE. */
28450 tparms
= copy_node (tparms
);
28451 INNERMOST_TEMPLATE_PARMS (tparms
)
28452 = copy_node (INNERMOST_TEMPLATE_PARMS (tparms
));
28455 tree fntype
= build_function_type (type
, fparms
);
28456 tree ded_fn
= build_lang_decl_loc (loc
,
28458 dguide_name (type
), fntype
);
28459 DECL_ARGUMENTS (ded_fn
) = fargs
;
28460 DECL_ARTIFICIAL (ded_fn
) = true;
28461 DECL_NONCONVERTING_P (ded_fn
) = explicit_p
;
28462 tree ded_tmpl
= build_template_decl (ded_fn
, tparms
, /*member*/false);
28463 DECL_ARTIFICIAL (ded_tmpl
) = true;
28464 DECL_TEMPLATE_INFO (ded_fn
) = build_template_info (ded_tmpl
, targs
);
28465 DECL_PRIMARY_TEMPLATE (ded_tmpl
) = ded_tmpl
;
28467 DECL_ABSTRACT_ORIGIN (ded_tmpl
) = fn_tmpl
;
28469 set_constraints (ded_tmpl
, ci
);
28474 /* Add to LIST the member types for the reshaped initializer CTOR. */
28477 collect_ctor_idx_types (tree ctor
, tree list
, tree elt
= NULL_TREE
)
28479 vec
<constructor_elt
, va_gc
> *v
= CONSTRUCTOR_ELTS (ctor
);
28480 tree idx
, val
; unsigned i
;
28481 FOR_EACH_CONSTRUCTOR_ELT (v
, i
, idx
, val
)
28483 tree ftype
= elt
? elt
: TREE_TYPE (idx
);
28484 if (BRACE_ENCLOSED_INITIALIZER_P (val
)
28485 && CONSTRUCTOR_NELTS (val
)
28486 /* As in reshape_init_r, a non-aggregate or array-of-dependent-bound
28487 type gets a single initializer. */
28488 && CP_AGGREGATE_TYPE_P (ftype
)
28489 && !(TREE_CODE (ftype
) == ARRAY_TYPE
28490 && uses_template_parms (TYPE_DOMAIN (ftype
))))
28492 tree subelt
= NULL_TREE
;
28493 if (TREE_CODE (ftype
) == ARRAY_TYPE
)
28494 subelt
= TREE_TYPE (ftype
);
28495 list
= collect_ctor_idx_types (val
, list
, subelt
);
28498 tree arg
= NULL_TREE
;
28499 if (i
== v
->length() - 1
28500 && PACK_EXPANSION_P (ftype
))
28501 /* Give the trailing pack expansion parameter a default argument to
28502 match aggregate initialization behavior, even if we deduce the
28503 length of the pack separately to more than we have initializers. */
28504 arg
= build_constructor (init_list_type_node
, NULL
);
28505 /* if ei is of array type and xi is a braced-init-list or string literal,
28506 Ti is an rvalue reference to the declared type of ei */
28507 STRIP_ANY_LOCATION_WRAPPER (val
);
28508 if (TREE_CODE (ftype
) == ARRAY_TYPE
28509 && (BRACE_ENCLOSED_INITIALIZER_P (val
)
28510 || TREE_CODE (val
) == STRING_CST
))
28512 if (TREE_CODE (val
) == STRING_CST
)
28513 ftype
= cp_build_qualified_type
28514 (ftype
, cp_type_quals (ftype
) | TYPE_QUAL_CONST
);
28515 ftype
= (cp_build_reference_type
28516 (ftype
, BRACE_ENCLOSED_INITIALIZER_P (val
)));
28518 list
= tree_cons (arg
, ftype
, list
);
28524 /* Return whether ETYPE is, or is derived from, a specialization of TMPL. */
28527 is_spec_or_derived (tree etype
, tree tmpl
)
28529 if (!etype
|| !CLASS_TYPE_P (etype
))
28532 tree type
= TREE_TYPE (tmpl
);
28533 tree tparms
= (INNERMOST_TEMPLATE_PARMS
28534 (DECL_TEMPLATE_PARMS (tmpl
)));
28535 tree targs
= make_tree_vec (TREE_VEC_LENGTH (tparms
));
28536 int err
= unify (tparms
, targs
, type
, etype
,
28537 UNIFY_ALLOW_DERIVED
, /*explain*/false);
28542 /* Return a C++20 aggregate deduction candidate for TYPE initialized from
28546 maybe_aggr_guide (tree tmpl
, tree init
, vec
<tree
,va_gc
> *args
)
28548 if (cxx_dialect
< cxx20
)
28551 if (init
== NULL_TREE
)
28554 tree type
= TREE_TYPE (tmpl
);
28555 if (!CP_AGGREGATE_TYPE_P (type
))
28558 /* No aggregate candidate for copy-initialization. */
28559 if (args
->length() == 1)
28561 tree val
= (*args
)[0];
28562 if (is_spec_or_derived (tmpl
, TREE_TYPE (val
)))
28566 /* If we encounter a problem, we just won't add the candidate. */
28567 tsubst_flags_t complain
= tf_none
;
28569 tree parms
= NULL_TREE
;
28570 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
28572 init
= reshape_init (type
, init
, complain
);
28573 if (init
== error_mark_node
)
28575 parms
= collect_ctor_idx_types (init
, parms
);
28577 else if (TREE_CODE (init
) == TREE_LIST
)
28579 int len
= list_length (init
);
28580 for (tree field
= TYPE_FIELDS (type
);
28582 --len
, field
= DECL_CHAIN (field
))
28584 field
= next_initializable_field (field
);
28587 tree ftype
= finish_decltype_type (field
, true, complain
);
28588 parms
= tree_cons (NULL_TREE
, ftype
, parms
);
28592 /* Aggregate initialization doesn't apply to an initializer expression. */
28598 parms
= nreverse (parms
);
28599 TREE_CHAIN (last
) = void_list_node
;
28600 tree guide
= build_deduction_guide (type
, parms
, NULL_TREE
, complain
);
28607 /* UGUIDES are the deduction guides for the underlying template of alias
28608 template TMPL; adjust them to be deduction guides for TMPL. */
28611 alias_ctad_tweaks (tree tmpl
, tree uguides
)
28613 /* [over.match.class.deduct]: When resolving a placeholder for a deduced
28614 class type (9.2.8.2) where the template-name names an alias template A,
28615 the defining-type-id of A must be of the form
28617 typename(opt) nested-name-specifier(opt) template(opt) simple-template-id
28619 as specified in 9.2.8.2. The guides of A are the set of functions or
28620 function templates formed as follows. For each function or function
28621 template f in the guides of the template named by the simple-template-id
28622 of the defining-type-id, the template arguments of the return type of f
28623 are deduced from the defining-type-id of A according to the process in
28624 13.10.2.5 with the exception that deduction does not fail if not all
28625 template arguments are deduced. Let g denote the result of substituting
28626 these deductions into f. If substitution succeeds, form a function or
28627 function template f' with the following properties and add it to the set
28630 * The function type of f' is the function type of g.
28632 * If f is a function template, f' is a function template whose template
28633 parameter list consists of all the template parameters of A (including
28634 their default template arguments) that appear in the above deductions or
28635 (recursively) in their default template arguments, followed by the
28636 template parameters of f that were not deduced (including their default
28637 template arguments), otherwise f' is not a function template.
28639 * The associated constraints (13.5.2) are the conjunction of the
28640 associated constraints of g and a constraint that is satisfied if and only
28641 if the arguments of A are deducible (see below) from the return type.
28643 * If f is a copy deduction candidate (12.4.1.8), then f' is considered to
28646 * If f was generated from a deduction-guide (12.4.1.8), then f' is
28647 considered to be so as well.
28649 * The explicit-specifier of f' is the explicit-specifier of g (if
28652 /* This implementation differs from the above in two significant ways:
28654 1) We include all template parameters of A, not just some.
28655 2) The added constraint is same_type instead of deducible.
28657 I believe that while it's probably possible to construct a testcase that
28658 behaves differently with this simplification, it should have the same
28659 effect for real uses. Including all template parameters means that we
28660 deduce all parameters of A when resolving the call, so when we're in the
28661 constraint we don't need to deduce them again, we can just check whether
28662 the deduction produced the desired result. */
28664 tsubst_flags_t complain
= tf_warning_or_error
;
28665 tree atype
= TREE_TYPE (tmpl
);
28666 tree aguides
= NULL_TREE
;
28667 tree atparms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
28668 unsigned natparms
= TREE_VEC_LENGTH (atparms
);
28669 tree utype
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
28670 for (ovl_iterator
iter (uguides
); iter
; ++iter
)
28674 location_t loc
= DECL_SOURCE_LOCATION (f
);
28675 tree ret
= TREE_TYPE (TREE_TYPE (f
));
28677 if (TREE_CODE (f
) == TEMPLATE_DECL
)
28679 processing_template_decl_sentinel
ptds (/*reset*/false);
28680 ++processing_template_decl
;
28682 /* Deduce template arguments for f from the type-id of A. */
28683 tree ftparms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (f
));
28684 unsigned len
= TREE_VEC_LENGTH (ftparms
);
28685 tree targs
= make_tree_vec (len
);
28686 int err
= unify (ftparms
, targs
, ret
, utype
, UNIFY_ALLOW_NONE
, false);
28689 /* The number of parms for f' is the number of parms for A plus
28690 non-deduced parms of f. */
28691 unsigned ndlen
= 0;
28693 for (unsigned i
= 0; i
< len
; ++i
)
28694 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
28696 tree gtparms
= make_tree_vec (natparms
+ ndlen
);
28698 /* First copy over the parms of A. */
28699 for (j
= 0; j
< natparms
; ++j
)
28700 TREE_VEC_ELT (gtparms
, j
) = TREE_VEC_ELT (atparms
, j
);
28701 /* Now rewrite the non-deduced parms of f. */
28702 for (unsigned i
= 0; ndlen
&& i
< len
; ++i
)
28703 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
28706 unsigned index
= j
++;
28707 unsigned level
= 1;
28708 tree oldlist
= TREE_VEC_ELT (ftparms
, i
);
28709 tree list
= rewrite_tparm_list (oldlist
, index
, level
,
28710 targs
, i
, complain
);
28711 TREE_VEC_ELT (gtparms
, index
) = list
;
28713 gtparms
= build_tree_list (size_one_node
, gtparms
);
28715 /* Substitute the deduced arguments plus the rewritten template
28716 parameters into f to get g. This covers the type, copyness,
28717 guideness, and explicit-specifier. */
28718 tree g
= tsubst_decl (DECL_TEMPLATE_RESULT (f
), targs
, complain
);
28719 if (g
== error_mark_node
)
28720 return error_mark_node
;
28721 DECL_USE_TEMPLATE (g
) = 0;
28722 fprime
= build_template_decl (g
, gtparms
, false);
28723 DECL_TEMPLATE_RESULT (fprime
) = g
;
28724 TREE_TYPE (fprime
) = TREE_TYPE (g
);
28725 tree gtargs
= template_parms_to_args (gtparms
);
28726 DECL_TEMPLATE_INFO (g
) = build_template_info (fprime
, gtargs
);
28727 DECL_PRIMARY_TEMPLATE (fprime
) = fprime
;
28729 /* Substitute the associated constraints. */
28730 tree ci
= get_constraints (f
);
28732 ci
= tsubst_constraint_info (ci
, targs
, complain
, in_decl
);
28733 if (ci
== error_mark_node
)
28734 return error_mark_node
;
28736 /* Add a constraint that the return type matches the instantiation of
28737 A with the same template arguments. */
28738 ret
= TREE_TYPE (TREE_TYPE (fprime
));
28739 if (!same_type_p (atype
, ret
)
28740 /* FIXME this should mean they don't compare as equivalent. */
28741 || dependent_alias_template_spec_p (atype
, nt_opaque
))
28743 tree same
= finish_trait_expr (loc
, CPTK_IS_SAME_AS
, atype
, ret
);
28744 ci
= append_constraint (ci
, same
);
28749 remove_constraints (fprime
);
28750 set_constraints (fprime
, ci
);
28755 /* For a non-template deduction guide, if the arguments of A aren't
28756 deducible from the return type, don't add the candidate. */
28757 tree targs
= make_tree_vec (natparms
);
28758 int err
= unify (atparms
, targs
, utype
, ret
, UNIFY_ALLOW_NONE
, false);
28759 for (unsigned i
= 0; !err
&& i
< natparms
; ++i
)
28760 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
28766 aguides
= lookup_add (fprime
, aguides
);
28772 /* Return artificial deduction guides built from the constructors of class
28776 ctor_deduction_guides_for (tree tmpl
, tsubst_flags_t complain
)
28778 tree type
= TREE_TYPE (tmpl
);
28779 tree outer_args
= NULL_TREE
;
28780 if (DECL_CLASS_SCOPE_P (tmpl
)
28781 && CLASSTYPE_TEMPLATE_INSTANTIATION (DECL_CONTEXT (tmpl
)))
28783 outer_args
= CLASSTYPE_TI_ARGS (DECL_CONTEXT (tmpl
));
28784 type
= TREE_TYPE (most_general_template (tmpl
));
28787 tree cands
= NULL_TREE
;
28789 for (ovl_iterator
iter (CLASSTYPE_CONSTRUCTORS (type
)); iter
; ++iter
)
28791 /* Skip inherited constructors. */
28792 if (iter
.using_p ())
28795 tree guide
= build_deduction_guide (type
, *iter
, outer_args
, complain
);
28796 cands
= lookup_add (guide
, cands
);
28799 /* Add implicit default constructor deduction guide. */
28800 if (!TYPE_HAS_USER_CONSTRUCTOR (type
))
28802 tree guide
= build_deduction_guide (type
, type
, outer_args
,
28804 cands
= lookup_add (guide
, cands
);
28807 /* Add copy guide. */
28809 tree gtype
= build_reference_type (type
);
28810 tree guide
= build_deduction_guide (type
, gtype
, outer_args
,
28812 cands
= lookup_add (guide
, cands
);
28818 static GTY((deletable
)) hash_map
<tree
, tree_pair_p
> *dguide_cache
;
28820 /* Return the non-aggregate deduction guides for deducible template TMPL. The
28821 aggregate candidate is added separately because it depends on the
28825 deduction_guides_for (tree tmpl
, tsubst_flags_t complain
)
28827 tree guides
= NULL_TREE
;
28828 if (DECL_ALIAS_TEMPLATE_P (tmpl
))
28830 tree under
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
28831 tree tinfo
= get_template_info (under
);
28832 guides
= deduction_guides_for (TI_TEMPLATE (tinfo
), complain
);
28836 guides
= lookup_qualified_name (CP_DECL_CONTEXT (tmpl
),
28837 dguide_name (tmpl
),
28838 LOOK_want::NORMAL
, /*complain*/false);
28839 if (guides
== error_mark_node
)
28840 guides
= NULL_TREE
;
28843 /* Cache the deduction guides for a template. We also remember the result of
28844 lookup, and rebuild everything if it changes; should be very rare. */
28845 tree_pair_p cache
= NULL
;
28847 = hash_map_safe_get_or_insert
<hm_ggc
> (dguide_cache
, tmpl
))
28850 if (cache
->purpose
== guides
)
28851 return cache
->value
;
28855 r
= cache
= ggc_cleared_alloc
<tree_pair_s
> ();
28856 cache
->purpose
= guides
;
28859 tree cands
= NULL_TREE
;
28860 if (DECL_ALIAS_TEMPLATE_P (tmpl
))
28861 cands
= alias_ctad_tweaks (tmpl
, guides
);
28864 cands
= ctor_deduction_guides_for (tmpl
, complain
);
28865 for (ovl_iterator
it (guides
); it
; ++it
)
28866 cands
= lookup_add (*it
, cands
);
28869 cache
->value
= cands
;
28873 /* Return whether TMPL is a (class template argument-) deducible template. */
28876 ctad_template_p (tree tmpl
)
28878 /* A deducible template is either a class template or is an alias template
28879 whose defining-type-id is of the form
28881 typename(opt) nested-name-specifier(opt) template(opt) simple-template-id
28883 where the nested-name-specifier (if any) is non-dependent and the
28884 template-name of the simple-template-id names a deducible template. */
28886 if (DECL_CLASS_TEMPLATE_P (tmpl
)
28887 || DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
))
28889 if (!DECL_ALIAS_TEMPLATE_P (tmpl
))
28891 tree orig
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
28892 if (tree tinfo
= get_template_info (orig
))
28893 return ctad_template_p (TI_TEMPLATE (tinfo
));
28897 /* Deduce template arguments for the class template placeholder PTYPE for
28898 template TMPL based on the initializer INIT, and return the resulting
28902 do_class_deduction (tree ptype
, tree tmpl
, tree init
,
28903 int flags
, tsubst_flags_t complain
)
28905 /* We should have handled this in the caller. */
28906 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
))
28909 /* Look through alias templates that just rename another template. */
28910 tmpl
= get_underlying_template (tmpl
);
28911 if (!ctad_template_p (tmpl
))
28913 if (complain
& tf_error
)
28914 error ("non-deducible template %qT used without template arguments", tmpl
);
28915 return error_mark_node
;
28917 else if (cxx_dialect
< cxx20
&& DECL_ALIAS_TEMPLATE_P (tmpl
))
28919 /* This doesn't affect conforming C++17 code, so just pedwarn. */
28920 if (complain
& tf_warning_or_error
)
28921 pedwarn (input_location
, 0, "alias template deduction only available "
28922 "with %<-std=c++20%> or %<-std=gnu++20%>");
28925 if (init
&& TREE_TYPE (init
) == ptype
)
28926 /* Using the template parm as its own argument. */
28929 tree type
= TREE_TYPE (tmpl
);
28931 bool try_list_ctor
= false;
28933 releasing_vec rv_args
= NULL
;
28934 vec
<tree
,va_gc
> *&args
= *&rv_args
;
28935 if (init
== NULL_TREE
)
28936 args
= make_tree_vector ();
28937 else if (BRACE_ENCLOSED_INITIALIZER_P (init
))
28939 try_list_ctor
= TYPE_HAS_LIST_CTOR (type
);
28940 if (try_list_ctor
&& CONSTRUCTOR_NELTS (init
) == 1)
28942 /* As an exception, the first phase in 16.3.1.7 (considering the
28943 initializer list as a single argument) is omitted if the
28944 initializer list consists of a single expression of type cv U,
28945 where U is a specialization of C or a class derived from a
28946 specialization of C. */
28947 tree elt
= CONSTRUCTOR_ELT (init
, 0)->value
;
28948 if (is_spec_or_derived (TREE_TYPE (elt
), tmpl
))
28949 try_list_ctor
= false;
28951 if (try_list_ctor
|| is_std_init_list (type
))
28952 args
= make_tree_vector_single (init
);
28954 args
= make_tree_vector_from_ctor (init
);
28956 else if (TREE_CODE (init
) == TREE_LIST
)
28957 args
= make_tree_vector_from_list (init
);
28959 args
= make_tree_vector_single (init
);
28961 /* Do this now to avoid problems with erroneous args later on. */
28962 args
= resolve_args (args
, complain
);
28964 return error_mark_node
;
28966 tree cands
= deduction_guides_for (tmpl
, complain
);
28967 if (cands
== error_mark_node
)
28968 return error_mark_node
;
28970 /* Prune explicit deduction guides in copy-initialization context. */
28971 bool elided
= false;
28972 if (flags
& LOOKUP_ONLYCONVERTING
)
28974 for (lkp_iterator
iter (cands
); !elided
&& iter
; ++iter
)
28975 if (DECL_NONCONVERTING_P (STRIP_TEMPLATE (*iter
)))
28980 /* Found a nonconverting guide, prune the candidates. */
28981 tree pruned
= NULL_TREE
;
28982 for (lkp_iterator
iter (cands
); iter
; ++iter
)
28983 if (!DECL_NONCONVERTING_P (STRIP_TEMPLATE (*iter
)))
28984 pruned
= lookup_add (*iter
, pruned
);
28990 if (tree guide
= maybe_aggr_guide (tmpl
, init
, args
))
28991 cands
= lookup_add (guide
, cands
);
28993 tree call
= error_mark_node
;
28995 /* If this is list-initialization and the class has a list constructor, first
28996 try deducing from the list as a single argument, as [over.match.list]. */
28997 tree list_cands
= NULL_TREE
;
28998 if (try_list_ctor
&& cands
)
28999 for (lkp_iterator
iter (cands
); iter
; ++iter
)
29002 if (is_list_ctor (dg
))
29003 list_cands
= lookup_add (dg
, list_cands
);
29007 ++cp_unevaluated_operand
;
29008 call
= build_new_function_call (list_cands
, &args
, tf_decltype
);
29009 --cp_unevaluated_operand
;
29011 if (call
== error_mark_node
)
29013 /* That didn't work, now try treating the list as a sequence of
29015 release_tree_vector (args
);
29016 args
= make_tree_vector_from_ctor (init
);
29020 if (elided
&& !cands
)
29022 error ("cannot deduce template arguments for copy-initialization"
29023 " of %qT, as it has no non-explicit deduction guides or "
29024 "user-declared constructors", type
);
29025 return error_mark_node
;
29027 else if (!cands
&& call
== error_mark_node
)
29029 error ("cannot deduce template arguments of %qT, as it has no viable "
29030 "deduction guides", type
);
29031 return error_mark_node
;
29034 if (call
== error_mark_node
)
29036 ++cp_unevaluated_operand
;
29037 call
= build_new_function_call (cands
, &args
, tf_decltype
);
29038 --cp_unevaluated_operand
;
29041 if (call
== error_mark_node
29042 && (complain
& tf_warning_or_error
))
29044 error ("class template argument deduction failed:");
29046 ++cp_unevaluated_operand
;
29047 call
= build_new_function_call (cands
, &args
, complain
| tf_decltype
);
29048 --cp_unevaluated_operand
;
29051 inform (input_location
, "explicit deduction guides not considered "
29052 "for copy-initialization");
29055 return cp_build_qualified_type (TREE_TYPE (call
), cp_type_quals (ptype
));
29058 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
29059 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE.
29060 The CONTEXT determines the context in which auto deduction is performed
29061 and is used to control error diagnostics. FLAGS are the LOOKUP_* flags.
29062 OUTER_TARGS are used during template argument deduction
29063 (context == adc_unify) to properly substitute the result, and is ignored
29066 For partial-concept-ids, extra args may be appended to the list of deduced
29067 template arguments prior to determining constraint satisfaction. */
29070 do_auto_deduction (tree type
, tree init
, tree auto_node
,
29071 tsubst_flags_t complain
, auto_deduction_context context
,
29072 tree outer_targs
, int flags
)
29076 if (init
== error_mark_node
)
29077 return error_mark_node
;
29079 if (init
&& type_dependent_expression_p (init
)
29080 && context
!= adc_unify
)
29081 /* Defining a subset of type-dependent expressions that we can deduce
29082 from ahead of time isn't worth the trouble. */
29085 /* Similarly, we can't deduce from another undeduced decl. */
29086 if (init
&& undeduced_auto_decl (init
))
29089 /* We may be doing a partial substitution, but we still want to replace
29091 complain
&= ~tf_partial
;
29093 if (tree tmpl
= CLASS_PLACEHOLDER_TEMPLATE (auto_node
))
29094 /* C++17 class template argument deduction. */
29095 return do_class_deduction (type
, tmpl
, init
, flags
, complain
);
29097 if (init
== NULL_TREE
|| TREE_TYPE (init
) == NULL_TREE
)
29098 /* Nothing we can do with this, even in deduction context. */
29101 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
29102 with either a new invented type template parameter U or, if the
29103 initializer is a braced-init-list (8.5.4), with
29104 std::initializer_list<U>. */
29105 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
29107 if (!DIRECT_LIST_INIT_P (init
))
29108 type
= listify_autos (type
, auto_node
);
29109 else if (CONSTRUCTOR_NELTS (init
) == 1)
29110 init
= CONSTRUCTOR_ELT (init
, 0)->value
;
29113 if (complain
& tf_warning_or_error
)
29115 if (permerror (input_location
, "direct-list-initialization of "
29116 "%<auto%> requires exactly one element"))
29117 inform (input_location
,
29118 "for deduction to %<std::initializer_list%>, use copy-"
29119 "list-initialization (i.e. add %<=%> before the %<{%>)");
29121 type
= listify_autos (type
, auto_node
);
29125 if (type
== error_mark_node
)
29126 return error_mark_node
;
29128 init
= resolve_nondeduced_context (init
, complain
);
29130 if (context
== adc_decomp_type
29131 && auto_node
== type
29132 && init
!= error_mark_node
29133 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
29134 /* [dcl.decomp]/1 - if decomposition declaration has no ref-qualifiers
29135 and initializer has array type, deduce cv-qualified array type. */
29136 return cp_build_qualified_type_real (TREE_TYPE (init
), TYPE_QUALS (type
),
29138 else if (AUTO_IS_DECLTYPE (auto_node
))
29140 tree stripped_init
= tree_strip_any_location_wrapper (init
);
29141 bool id
= (DECL_P (stripped_init
)
29142 || ((TREE_CODE (init
) == COMPONENT_REF
29143 || TREE_CODE (init
) == SCOPE_REF
)
29144 && !REF_PARENTHESIZED_P (init
)));
29145 targs
= make_tree_vec (1);
29146 TREE_VEC_ELT (targs
, 0)
29147 = finish_decltype_type (init
, id
, tf_warning_or_error
);
29148 if (type
!= auto_node
)
29150 if (complain
& tf_error
)
29151 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
29152 return error_mark_node
;
29154 else if (TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
29156 if (complain
& tf_error
)
29157 error ("%<decltype(auto)%> cannot be cv-qualified");
29158 return error_mark_node
;
29163 if (error_operand_p (init
))
29164 return error_mark_node
;
29166 tree parms
= build_tree_list (NULL_TREE
, type
);
29170 tparms
= extract_autos (type
);
29173 tparms
= make_tree_vec (1);
29174 TREE_VEC_ELT (tparms
, 0)
29175 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
29178 targs
= make_tree_vec (TREE_VEC_LENGTH (tparms
));
29179 int val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
29181 NULL
, /*explain_p=*/false);
29184 if (processing_template_decl
)
29185 /* Try again at instantiation time. */
29187 if (type
&& type
!= error_mark_node
29188 && (complain
& tf_error
))
29189 /* If type is error_mark_node a diagnostic must have been
29190 emitted by now. Also, having a mention to '<type error>'
29191 in the diagnostic is not really useful to the user. */
29194 && FNDECL_USED_AUTO (current_function_decl
)
29196 == DECL_SAVED_AUTO_RETURN_TYPE (current_function_decl
))
29197 && LAMBDA_FUNCTION_P (current_function_decl
))
29198 error ("unable to deduce lambda return type from %qE", init
);
29200 error ("unable to deduce %qT from %qE", type
, init
);
29201 type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
29203 NULL
, /*explain_p=*/true);
29205 return error_mark_node
;
29209 /* Check any placeholder constraints against the deduced type. */
29210 if (flag_concepts
&& !processing_template_decl
)
29211 if (tree check
= NON_ERROR (PLACEHOLDER_TYPE_CONSTRAINTS (auto_node
)))
29213 /* Use the deduced type to check the associated constraints. If we
29214 have a partial-concept-id, rebuild the argument list so that
29215 we check using the extra arguments. */
29216 check
= unpack_concept_check (check
);
29217 gcc_assert (TREE_CODE (check
) == TEMPLATE_ID_EXPR
);
29218 tree
cdecl = TREE_OPERAND (check
, 0);
29220 cdecl = OVL_FIRST (cdecl);
29221 tree cargs
= TREE_OPERAND (check
, 1);
29222 if (TREE_VEC_LENGTH (cargs
) > 1)
29224 cargs
= copy_node (cargs
);
29225 TREE_VEC_ELT (cargs
, 0) = TREE_VEC_ELT (targs
, 0);
29230 /* Rebuild the check using the deduced arguments. */
29231 check
= build_concept_check (cdecl, cargs
, tf_none
);
29233 if (!constraints_satisfied_p (check
))
29235 if (complain
& tf_warning_or_error
)
29237 auto_diagnostic_group d
;
29240 case adc_unspecified
:
29242 error("placeholder constraints not satisfied");
29244 case adc_variable_type
:
29245 case adc_decomp_type
:
29246 error ("deduced initializer does not satisfy "
29247 "placeholder constraints");
29249 case adc_return_type
:
29250 error ("deduced return type does not satisfy "
29251 "placeholder constraints");
29253 case adc_requirement
:
29254 error ("deduced expression type does not satisfy "
29255 "placeholder constraints");
29258 diagnose_constraints (input_location
, check
, targs
);
29260 return error_mark_node
;
29264 if (processing_template_decl
&& context
!= adc_unify
)
29265 outer_targs
= current_template_args ();
29266 targs
= add_to_template_args (outer_targs
, targs
);
29267 return tsubst (type
, targs
, complain
, NULL_TREE
);
29270 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
29274 splice_late_return_type (tree type
, tree late_return_type
)
29276 if (late_return_type
)
29278 gcc_assert (is_auto (type
) || seen_error ());
29279 return late_return_type
;
29282 if (tree
*auto_node
= find_type_usage (&type
, is_auto
))
29284 tree idx
= get_template_parm_index (*auto_node
);
29285 if (TEMPLATE_PARM_LEVEL (idx
) <= processing_template_decl
)
29287 /* In an abbreviated function template we didn't know we were dealing
29288 with a function template when we saw the auto return type, so update
29289 it to have the correct level. */
29290 tree new_auto
= make_auto_1 (TYPE_IDENTIFIER (*auto_node
), false);
29291 PLACEHOLDER_TYPE_CONSTRAINTS (new_auto
)
29292 = PLACEHOLDER_TYPE_CONSTRAINTS (*auto_node
);
29293 TYPE_CANONICAL (new_auto
) = canonical_type_parameter (new_auto
);
29294 new_auto
= cp_build_qualified_type (new_auto
, TYPE_QUALS (*auto_node
));
29295 *auto_node
= new_auto
;
29301 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
29302 'decltype(auto)' or a deduced class template. */
29305 is_auto (const_tree type
)
29307 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
29308 && (TYPE_IDENTIFIER (type
) == auto_identifier
29309 || TYPE_IDENTIFIER (type
) == decltype_auto_identifier
))
29315 /* for_each_template_parm callback for type_uses_auto. */
29318 is_auto_r (tree tp
, void */
*data*/
)
29320 return is_auto (tp
);
29323 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
29324 a use of `auto'. Returns NULL_TREE otherwise. */
29327 type_uses_auto (tree type
)
29329 if (type
== NULL_TREE
)
29331 else if (flag_concepts
)
29333 /* The Concepts TS allows multiple autos in one type-specifier; just
29334 return the first one we find, do_auto_deduction will collect all of
29336 if (uses_template_parms (type
))
29337 return for_each_template_parm (type
, is_auto_r
, /*data*/NULL
,
29338 /*visited*/NULL
, /*nondeduced*/false);
29342 else if (tree
*tp
= find_type_usage (&type
, is_auto
))
29348 /* Report ill-formed occurrences of auto types in ARGUMENTS. If
29349 concepts are enabled, auto is acceptable in template arguments, but
29350 only when TEMPL identifies a template class. Return TRUE if any
29351 such errors were reported. */
29354 check_auto_in_tmpl_args (tree tmpl
, tree args
)
29356 /* If there were previous errors, nevermind. */
29357 if (!args
|| TREE_CODE (args
) != TREE_VEC
)
29360 /* If TMPL is an identifier, we're parsing and we can't tell yet
29361 whether TMPL is supposed to be a type, a function or a variable.
29362 We'll only be able to tell during template substitution, so we
29363 expect to be called again then. If concepts are enabled and we
29364 know we have a type, we're ok. */
29366 && (identifier_p (tmpl
)
29368 && (DECL_TYPE_TEMPLATE_P (tmpl
)
29369 || DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)))))
29372 /* Quickly search for any occurrences of auto; usually there won't
29373 be any, and then we'll avoid allocating the vector. */
29374 if (!type_uses_auto (args
))
29377 bool errors
= false;
29379 tree vec
= extract_autos (args
);
29380 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); i
++)
29382 tree xauto
= TREE_VALUE (TREE_VEC_ELT (vec
, i
));
29383 error_at (DECL_SOURCE_LOCATION (xauto
),
29384 "invalid use of %qT in template argument", xauto
);
29391 /* Recursively walk over && expressions searching for EXPR. Return a reference
29392 to that expression. */
29394 static tree
*find_template_requirement (tree
*t
, tree key
)
29398 if (TREE_CODE (*t
) == TRUTH_ANDIF_EXPR
)
29400 if (tree
*p
= find_template_requirement (&TREE_OPERAND (*t
, 0), key
))
29402 if (tree
*p
= find_template_requirement (&TREE_OPERAND (*t
, 1), key
))
29408 /* Convert the generic type parameters in PARM that match the types given in the
29409 range [START_IDX, END_IDX) from the current_template_parms into generic type
29413 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
29415 tree current
= current_template_parms
;
29416 int depth
= TMPL_PARMS_DEPTH (current
);
29417 current
= INNERMOST_TEMPLATE_PARMS (current
);
29418 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
29420 for (int i
= 0; i
< start_idx
; ++i
)
29421 TREE_VEC_ELT (replacement
, i
)
29422 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
29424 for (int i
= start_idx
; i
< end_idx
; ++i
)
29426 /* Create a distinct parameter pack type from the current parm and add it
29427 to the replacement args to tsubst below into the generic function
29429 tree node
= TREE_VEC_ELT (current
, i
);
29430 tree o
= TREE_TYPE (TREE_VALUE (node
));
29431 tree t
= copy_type (o
);
29432 TEMPLATE_TYPE_PARM_INDEX (t
)
29433 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
29435 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
29436 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
29437 TYPE_MAIN_VARIANT (t
) = t
;
29438 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
29439 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
29440 TREE_VEC_ELT (replacement
, i
) = t
;
29442 /* Replace the current template parameter with new pack. */
29443 TREE_VALUE (node
) = TREE_CHAIN (t
);
29445 /* Surgically adjust the associated constraint of adjusted parameter
29446 and it's corresponding contribution to the current template
29448 if (tree constr
= TEMPLATE_PARM_CONSTRAINTS (node
))
29450 tree id
= unpack_concept_check (constr
);
29451 TREE_VEC_ELT (TREE_OPERAND (id
, 1), 0) = template_parm_to_arg (t
);
29452 tree fold
= finish_left_unary_fold_expr (constr
, TRUTH_ANDIF_EXPR
);
29453 TEMPLATE_PARM_CONSTRAINTS (node
) = fold
;
29455 /* If there was a constraint, we also need to replace that in
29456 the template requirements, which we've already built. */
29457 tree
*reqs
= &TEMPLATE_PARMS_CONSTRAINTS (current_template_parms
);
29458 reqs
= find_template_requirement (reqs
, constr
);
29463 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
29464 TREE_VEC_ELT (replacement
, i
)
29465 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
29467 /* If there are more levels then build up the replacement with the outer
29470 replacement
= add_to_template_args (template_parms_to_args
29471 (TREE_CHAIN (current_template_parms
)),
29474 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
29477 /* __integer_pack(N) in a pack expansion expands to a sequence of numbers from
29481 declare_integer_pack (void)
29483 tree ipfn
= push_library_fn (get_identifier ("__integer_pack"),
29484 build_function_type_list (integer_type_node
,
29487 NULL_TREE
, ECF_CONST
);
29488 DECL_DECLARED_CONSTEXPR_P (ipfn
) = true;
29489 set_decl_built_in_function (ipfn
, BUILT_IN_FRONTEND
,
29490 CP_BUILT_IN_INTEGER_PACK
);
29493 /* Set up the hash tables for template instantiations. */
29496 init_template_processing (void)
29498 decl_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
29499 type_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
29501 if (cxx_dialect
>= cxx11
)
29502 declare_integer_pack ();
29505 /* Print stats about the template hash tables for -fstats. */
29508 print_template_statistics (void)
29510 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
29511 "%f collisions\n", (long) decl_specializations
->size (),
29512 (long) decl_specializations
->elements (),
29513 decl_specializations
->collisions ());
29514 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
29515 "%f collisions\n", (long) type_specializations
->size (),
29516 (long) type_specializations
->elements (),
29517 type_specializations
->collisions ());
29522 namespace selftest
{
29524 /* Verify that build_non_dependent_expr () works, for various expressions,
29525 and that location wrappers don't affect the results. */
29528 test_build_non_dependent_expr ()
29530 location_t loc
= BUILTINS_LOCATION
;
29532 /* Verify constants, without and with location wrappers. */
29533 tree int_cst
= build_int_cst (integer_type_node
, 42);
29534 ASSERT_EQ (int_cst
, build_non_dependent_expr (int_cst
));
29536 tree wrapped_int_cst
= maybe_wrap_with_location (int_cst
, loc
);
29537 ASSERT_TRUE (location_wrapper_p (wrapped_int_cst
));
29538 ASSERT_EQ (wrapped_int_cst
, build_non_dependent_expr (wrapped_int_cst
));
29540 tree string_lit
= build_string (4, "foo");
29541 TREE_TYPE (string_lit
) = char_array_type_node
;
29542 string_lit
= fix_string_type (string_lit
);
29543 ASSERT_EQ (string_lit
, build_non_dependent_expr (string_lit
));
29545 tree wrapped_string_lit
= maybe_wrap_with_location (string_lit
, loc
);
29546 ASSERT_TRUE (location_wrapper_p (wrapped_string_lit
));
29547 ASSERT_EQ (wrapped_string_lit
,
29548 build_non_dependent_expr (wrapped_string_lit
));
29551 /* Verify that type_dependent_expression_p () works correctly, even
29552 in the presence of location wrapper nodes. */
29555 test_type_dependent_expression_p ()
29557 location_t loc
= BUILTINS_LOCATION
;
29559 tree name
= get_identifier ("foo");
29561 /* If no templates are involved, nothing is type-dependent. */
29562 gcc_assert (!processing_template_decl
);
29563 ASSERT_FALSE (type_dependent_expression_p (name
));
29565 ++processing_template_decl
;
29567 /* Within a template, an unresolved name is always type-dependent. */
29568 ASSERT_TRUE (type_dependent_expression_p (name
));
29570 /* Ensure it copes with NULL_TREE and errors. */
29571 ASSERT_FALSE (type_dependent_expression_p (NULL_TREE
));
29572 ASSERT_FALSE (type_dependent_expression_p (error_mark_node
));
29574 /* A USING_DECL in a template should be type-dependent, even if wrapped
29575 with a location wrapper (PR c++/83799). */
29576 tree using_decl
= build_lang_decl (USING_DECL
, name
, NULL_TREE
);
29577 TREE_TYPE (using_decl
) = integer_type_node
;
29578 ASSERT_TRUE (type_dependent_expression_p (using_decl
));
29579 tree wrapped_using_decl
= maybe_wrap_with_location (using_decl
, loc
);
29580 ASSERT_TRUE (location_wrapper_p (wrapped_using_decl
));
29581 ASSERT_TRUE (type_dependent_expression_p (wrapped_using_decl
));
29583 --processing_template_decl
;
29586 /* Run all of the selftests within this file. */
29591 test_build_non_dependent_expr ();
29592 test_type_dependent_expression_p ();
29595 } // namespace selftest
29597 #endif /* #if CHECKING_P */
29599 #include "gt-cp-pt.h"