1 /* Handle parameterized types (templates) for GNU -*- C++ -*-.
2 Copyright (C) 1992-2019 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"
46 /* The type of functions taking a tree, and some additional data, and
48 typedef int (*tree_fn_t
) (tree
, void*);
50 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
51 instantiations have been deferred, either because their definitions
52 were not yet available, or because we were putting off doing the work. */
53 struct GTY ((chain_next ("%h.next"))) pending_template
55 struct pending_template
*next
;
56 struct tinst_level
*tinst
;
59 static GTY(()) struct pending_template
*pending_templates
;
60 static GTY(()) struct pending_template
*last_pending_template
;
62 int processing_template_parmlist
;
63 static int template_header_count
;
65 static GTY(()) tree saved_trees
;
66 static vec
<int> inline_parm_levels
;
68 static GTY(()) struct tinst_level
*current_tinst_level
;
70 static GTY(()) vec
<tree
, va_gc
> *saved_access_scope
;
72 /* Live only within one (recursive) call to tsubst_expr. We use
73 this to pass the statement expression node from the STMT_EXPR
74 to the EXPR_STMT that is its result. */
75 static tree cur_stmt_expr
;
77 // -------------------------------------------------------------------------- //
78 // Local Specialization Stack
80 // Implementation of the RAII helper for creating new local
82 local_specialization_stack::local_specialization_stack (lss_policy policy
)
83 : saved (local_specializations
)
85 if (policy
== lss_blank
|| !saved
)
86 local_specializations
= new hash_map
<tree
, tree
>;
88 local_specializations
= new hash_map
<tree
, tree
>(*saved
);
91 local_specialization_stack::~local_specialization_stack ()
93 delete local_specializations
;
94 local_specializations
= saved
;
97 /* True if we've recursed into fn_type_unification too many times. */
98 static bool excessive_deduction_depth
;
100 struct GTY((for_user
)) spec_entry
107 struct spec_hasher
: ggc_ptr_hash
<spec_entry
>
109 static hashval_t
hash (spec_entry
*);
110 static bool equal (spec_entry
*, spec_entry
*);
113 static GTY (()) hash_table
<spec_hasher
> *decl_specializations
;
115 static GTY (()) hash_table
<spec_hasher
> *type_specializations
;
117 /* Contains canonical template parameter types. The vector is indexed by
118 the TEMPLATE_TYPE_IDX of the template parameter. Each element is a
119 TREE_LIST, whose TREE_VALUEs contain the canonical template
120 parameters of various types and levels. */
121 static GTY(()) vec
<tree
, va_gc
> *canonical_template_parms
;
123 #define UNIFY_ALLOW_NONE 0
124 #define UNIFY_ALLOW_MORE_CV_QUAL 1
125 #define UNIFY_ALLOW_LESS_CV_QUAL 2
126 #define UNIFY_ALLOW_DERIVED 4
127 #define UNIFY_ALLOW_INTEGER 8
128 #define UNIFY_ALLOW_OUTER_LEVEL 16
129 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
130 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
132 enum template_base_result
{
134 tbr_ambiguous_baseclass
,
138 static void push_access_scope (tree
);
139 static void pop_access_scope (tree
);
140 static bool resolve_overloaded_unification (tree
, tree
, tree
, tree
,
141 unification_kind_t
, int,
143 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
144 unification_kind_t
, int, bool, bool);
145 static int unify (tree
, tree
, tree
, tree
, int, bool);
146 static void add_pending_template (tree
);
147 static tree
reopen_tinst_level (struct tinst_level
*);
148 static tree
tsubst_initializer_list (tree
, tree
);
149 static tree
get_partial_spec_bindings (tree
, tree
, tree
);
150 static tree
coerce_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
152 static tree
coerce_innermost_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
154 static void tsubst_enum (tree
, tree
, tree
);
155 static tree
add_to_template_args (tree
, tree
);
156 static tree
add_outermost_template_args (tree
, tree
);
157 static bool check_instantiated_args (tree
, tree
, tsubst_flags_t
);
158 static int check_non_deducible_conversion (tree
, tree
, int, int,
159 struct conversion
**, bool);
160 static int maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*,
162 static int type_unification_real (tree
, tree
, tree
, const tree
*,
163 unsigned int, int, unification_kind_t
,
164 vec
<deferred_access_check
, va_gc
> **,
166 static void note_template_header (int);
167 static tree
convert_nontype_argument_function (tree
, tree
, tsubst_flags_t
);
168 static tree
convert_nontype_argument (tree
, tree
, tsubst_flags_t
);
169 static tree
convert_template_argument (tree
, tree
, tree
,
170 tsubst_flags_t
, int, tree
);
171 static tree
for_each_template_parm (tree
, tree_fn_t
, void*,
172 hash_set
<tree
> *, bool, tree_fn_t
= NULL
);
173 static tree
expand_template_argument_pack (tree
);
174 static tree
build_template_parm_index (int, int, int, tree
, tree
);
175 static bool inline_needs_template_parms (tree
, bool);
176 static void push_inline_template_parms_recursive (tree
, int);
177 static tree
reduce_template_parm_level (tree
, tree
, int, tree
, tsubst_flags_t
);
178 static int mark_template_parm (tree
, void *);
179 static int template_parm_this_level_p (tree
, void *);
180 static tree
tsubst_friend_function (tree
, tree
);
181 static tree
tsubst_friend_class (tree
, tree
);
182 static int can_complete_type_without_circularity (tree
);
183 static tree
get_bindings (tree
, tree
, tree
, bool);
184 static int template_decl_level (tree
);
185 static int check_cv_quals_for_unify (int, tree
, tree
);
186 static void template_parm_level_and_index (tree
, int*, int*);
187 static int unify_pack_expansion (tree
, tree
, tree
,
188 tree
, unification_kind_t
, bool, bool);
189 static tree
copy_template_args (tree
);
190 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
191 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
192 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
193 static tree
most_specialized_partial_spec (tree
, tsubst_flags_t
);
194 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
195 static tree
tsubst_arg_types (tree
, tree
, tree
, tsubst_flags_t
, tree
);
196 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
197 static bool check_specialization_scope (void);
198 static tree
process_partial_specialization (tree
);
199 static void set_current_access_from_decl (tree
);
200 static enum template_base_result
get_template_base (tree
, tree
, tree
, tree
,
202 static tree
try_class_unification (tree
, tree
, tree
, tree
, bool);
203 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
205 static bool template_template_parm_bindings_ok_p (tree
, tree
);
206 static void tsubst_default_arguments (tree
, tsubst_flags_t
);
207 static tree
for_each_template_parm_r (tree
*, int *, void *);
208 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
209 static void copy_default_args_to_explicit_spec (tree
);
210 static bool invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
211 static bool dependent_template_arg_p (tree
);
212 static bool any_template_arguments_need_structural_equality_p (tree
);
213 static bool dependent_type_p_r (tree
);
214 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
215 static tree
tsubst_decl (tree
, tree
, tsubst_flags_t
);
216 static void perform_typedefs_access_check (tree tmpl
, tree targs
);
217 static void append_type_to_template_for_access_check_1 (tree
, 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
tsubst_attributes (tree
, tree
, tsubst_flags_t
, tree
);
225 static tree
canonicalize_expr_argument (tree
, tsubst_flags_t
);
226 static tree
make_argument_pack (tree
);
227 static void register_parameter_specializations (tree
, tree
);
228 static tree
enclosing_instantiation_of (tree tctx
);
230 /* Make the current scope suitable for access checking when we are
231 processing T. T can be FUNCTION_DECL for instantiated function
232 template, VAR_DECL for static member variable, or TYPE_DECL for
233 alias template (needed by instantiate_decl). */
236 push_access_scope (tree t
)
238 gcc_assert (VAR_OR_FUNCTION_DECL_P (t
)
239 || TREE_CODE (t
) == TYPE_DECL
);
241 if (DECL_FRIEND_CONTEXT (t
))
242 push_nested_class (DECL_FRIEND_CONTEXT (t
));
243 else if (DECL_CLASS_SCOPE_P (t
))
244 push_nested_class (DECL_CONTEXT (t
));
246 push_to_top_level ();
248 if (TREE_CODE (t
) == FUNCTION_DECL
)
250 vec_safe_push (saved_access_scope
, current_function_decl
);
251 current_function_decl
= t
;
255 /* Restore the scope set up by push_access_scope. T is the node we
259 pop_access_scope (tree t
)
261 if (TREE_CODE (t
) == FUNCTION_DECL
)
262 current_function_decl
= saved_access_scope
->pop();
264 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
267 pop_from_top_level ();
270 /* Do any processing required when DECL (a member template
271 declaration) is finished. Returns the TEMPLATE_DECL corresponding
272 to DECL, unless it is a specialization, in which case the DECL
273 itself is returned. */
276 finish_member_template_decl (tree decl
)
278 if (decl
== error_mark_node
)
279 return error_mark_node
;
281 gcc_assert (DECL_P (decl
));
283 if (TREE_CODE (decl
) == TYPE_DECL
)
287 type
= TREE_TYPE (decl
);
288 if (type
== error_mark_node
)
289 return error_mark_node
;
290 if (MAYBE_CLASS_TYPE_P (type
)
291 && CLASSTYPE_TEMPLATE_INFO (type
)
292 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
294 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
295 check_member_template (tmpl
);
300 else if (TREE_CODE (decl
) == FIELD_DECL
)
301 error ("data member %qD cannot be a member template", decl
);
302 else if (DECL_TEMPLATE_INFO (decl
))
304 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
306 check_member_template (DECL_TI_TEMPLATE (decl
));
307 return DECL_TI_TEMPLATE (decl
);
313 error ("invalid member template declaration %qD", decl
);
315 return error_mark_node
;
318 /* Create a template info node. */
321 build_template_info (tree template_decl
, tree template_args
)
323 tree result
= make_node (TEMPLATE_INFO
);
324 TI_TEMPLATE (result
) = template_decl
;
325 TI_ARGS (result
) = template_args
;
329 /* Return the template info node corresponding to T, whatever T is. */
332 get_template_info (const_tree t
)
334 tree tinfo
= NULL_TREE
;
336 if (!t
|| t
== error_mark_node
)
339 if (TREE_CODE (t
) == NAMESPACE_DECL
340 || TREE_CODE (t
) == PARM_DECL
)
343 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
344 tinfo
= DECL_TEMPLATE_INFO (t
);
346 if (!tinfo
&& DECL_IMPLICIT_TYPEDEF_P (t
))
349 if (OVERLOAD_TYPE_P (t
))
350 tinfo
= TYPE_TEMPLATE_INFO (t
);
351 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
352 tinfo
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
);
357 /* Returns the template nesting level of the indicated class TYPE.
367 A<T>::B<U> has depth two, while A<T> has depth one.
368 Both A<T>::B<int> and A<int>::B<U> have depth one, if
369 they are instantiations, not specializations.
371 This function is guaranteed to return 0 if passed NULL_TREE so
372 that, for example, `template_class_depth (current_class_type)' is
376 template_class_depth (tree type
)
380 for (depth
= 0; type
&& TREE_CODE (type
) != NAMESPACE_DECL
; )
382 tree tinfo
= get_template_info (type
);
384 if (tinfo
&& PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
385 && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
))))
389 type
= CP_DECL_CONTEXT (type
);
390 else if (LAMBDA_TYPE_P (type
))
391 type
= LAMBDA_TYPE_EXTRA_SCOPE (type
);
393 type
= CP_TYPE_CONTEXT (type
);
399 /* Return TRUE if NODE instantiates a template that has arguments of
400 its own, be it directly a primary template or indirectly through a
401 partial specializations. */
403 instantiates_primary_template_p (tree node
)
405 tree tinfo
= get_template_info (node
);
409 tree tmpl
= TI_TEMPLATE (tinfo
);
410 if (PRIMARY_TEMPLATE_P (tmpl
))
413 if (!DECL_TEMPLATE_SPECIALIZATION (tmpl
))
416 /* So now we know we have a specialization, but it could be a full
417 or a partial specialization. To tell which, compare the depth of
418 its template arguments with those of its context. */
420 tree ctxt
= DECL_CONTEXT (tmpl
);
421 tree ctinfo
= get_template_info (ctxt
);
425 return (TMPL_ARGS_DEPTH (TI_ARGS (tinfo
))
426 > TMPL_ARGS_DEPTH (TI_ARGS (ctinfo
)));
429 /* Subroutine of maybe_begin_member_template_processing.
430 Returns true if processing DECL needs us to push template parms. */
433 inline_needs_template_parms (tree decl
, bool nsdmi
)
435 if (!decl
|| (!nsdmi
&& ! DECL_TEMPLATE_INFO (decl
)))
438 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
439 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
442 /* Subroutine of maybe_begin_member_template_processing.
443 Push the template parms in PARMS, starting from LEVELS steps into the
444 chain, and ending at the beginning, since template parms are listed
448 push_inline_template_parms_recursive (tree parmlist
, int levels
)
450 tree parms
= TREE_VALUE (parmlist
);
454 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
456 ++processing_template_decl
;
457 current_template_parms
458 = tree_cons (size_int (processing_template_decl
),
459 parms
, current_template_parms
);
460 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
462 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
464 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
466 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
468 if (error_operand_p (parm
))
471 gcc_assert (DECL_P (parm
));
473 switch (TREE_CODE (parm
))
481 /* Push the CONST_DECL. */
482 pushdecl (TEMPLATE_PARM_DECL (DECL_INITIAL (parm
)));
491 /* Restore the template parameter context for a member template, a
492 friend template defined in a class definition, or a non-template
493 member of template class. */
496 maybe_begin_member_template_processing (tree decl
)
500 bool nsdmi
= TREE_CODE (decl
) == FIELD_DECL
;
504 tree ctx
= DECL_CONTEXT (decl
);
505 decl
= (CLASSTYPE_TEMPLATE_INFO (ctx
)
506 /* Disregard full specializations (c++/60999). */
507 && uses_template_parms (ctx
)
508 ? CLASSTYPE_TI_TEMPLATE (ctx
) : NULL_TREE
);
511 if (inline_needs_template_parms (decl
, nsdmi
))
513 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
514 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
516 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
519 parms
= TREE_CHAIN (parms
);
522 push_inline_template_parms_recursive (parms
, levels
);
525 /* Remember how many levels of template parameters we pushed so that
526 we can pop them later. */
527 inline_parm_levels
.safe_push (levels
);
530 /* Undo the effects of maybe_begin_member_template_processing. */
533 maybe_end_member_template_processing (void)
538 if (inline_parm_levels
.length () == 0)
541 last
= inline_parm_levels
.pop ();
542 for (i
= 0; i
< last
; ++i
)
544 --processing_template_decl
;
545 current_template_parms
= TREE_CHAIN (current_template_parms
);
550 /* Return a new template argument vector which contains all of ARGS,
551 but has as its innermost set of arguments the EXTRA_ARGS. */
554 add_to_template_args (tree args
, tree extra_args
)
561 if (args
== NULL_TREE
|| extra_args
== error_mark_node
)
564 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
565 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
567 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
568 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
570 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
571 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
576 /* Like add_to_template_args, but only the outermost ARGS are added to
577 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
578 (EXTRA_ARGS) levels are added. This function is used to combine
579 the template arguments from a partial instantiation with the
580 template arguments used to attain the full instantiation from the
581 partial instantiation. */
584 add_outermost_template_args (tree args
, tree extra_args
)
588 /* If there are more levels of EXTRA_ARGS than there are ARGS,
589 something very fishy is going on. */
590 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
592 /* If *all* the new arguments will be the EXTRA_ARGS, just return
594 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
597 /* For the moment, we make ARGS look like it contains fewer levels. */
598 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
600 new_args
= add_to_template_args (args
, extra_args
);
602 /* Now, we restore ARGS to its full dimensions. */
603 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
608 /* Return the N levels of innermost template arguments from the ARGS. */
611 get_innermost_template_args (tree args
, int n
)
619 /* If N is 1, just return the innermost set of template arguments. */
621 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
623 /* If we're not removing anything, just return the arguments we were
625 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
626 gcc_assert (extra_levels
>= 0);
627 if (extra_levels
== 0)
630 /* Make a new set of arguments, not containing the outer arguments. */
631 new_args
= make_tree_vec (n
);
632 for (i
= 1; i
<= n
; ++i
)
633 SET_TMPL_ARGS_LEVEL (new_args
, i
,
634 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
639 /* The inverse of get_innermost_template_args: Return all but the innermost
640 EXTRA_LEVELS levels of template arguments from the ARGS. */
643 strip_innermost_template_args (tree args
, int extra_levels
)
646 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
651 /* If N is 1, just return the outermost set of template arguments. */
653 return TMPL_ARGS_LEVEL (args
, 1);
655 /* If we're not removing anything, just return the arguments we were
657 gcc_assert (extra_levels
>= 0);
658 if (extra_levels
== 0)
661 /* Make a new set of arguments, not containing the inner arguments. */
662 new_args
= make_tree_vec (n
);
663 for (i
= 1; i
<= n
; ++i
)
664 SET_TMPL_ARGS_LEVEL (new_args
, i
,
665 TMPL_ARGS_LEVEL (args
, i
));
670 /* We've got a template header coming up; push to a new level for storing
674 begin_template_parm_list (void)
676 /* We use a non-tag-transparent scope here, which causes pushtag to
677 put tags in this scope, rather than in the enclosing class or
678 namespace scope. This is the right thing, since we want
679 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
680 global template class, push_template_decl handles putting the
681 TEMPLATE_DECL into top-level scope. For a nested template class,
684 template <class T> struct S1 {
685 template <class T> struct S2 {};
688 pushtag contains special code to insert the TEMPLATE_DECL for S2
689 at the right scope. */
690 begin_scope (sk_template_parms
, NULL
);
691 ++processing_template_decl
;
692 ++processing_template_parmlist
;
693 note_template_header (0);
695 /* Add a dummy parameter level while we process the parameter list. */
696 current_template_parms
697 = tree_cons (size_int (processing_template_decl
),
699 current_template_parms
);
702 /* This routine is called when a specialization is declared. If it is
703 invalid to declare a specialization here, an error is reported and
704 false is returned, otherwise this routine will return true. */
707 check_specialization_scope (void)
709 tree scope
= current_scope ();
713 An explicit specialization shall be declared in the namespace of
714 which the template is a member, or, for member templates, in the
715 namespace of which the enclosing class or enclosing class
716 template is a member. An explicit specialization of a member
717 function, member class or static data member of a class template
718 shall be declared in the namespace of which the class template
720 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
722 error ("explicit specialization in non-namespace scope %qD", scope
);
728 In an explicit specialization declaration for a member of a class
729 template or a member template that appears in namespace scope,
730 the member template and some of its enclosing class templates may
731 remain unspecialized, except that the declaration shall not
732 explicitly specialize a class member template if its enclosing
733 class templates are not explicitly specialized as well. */
734 if (current_template_parms
)
736 error ("enclosing class templates are not explicitly specialized");
743 /* We've just seen template <>. */
746 begin_specialization (void)
748 begin_scope (sk_template_spec
, NULL
);
749 note_template_header (1);
750 return check_specialization_scope ();
753 /* Called at then end of processing a declaration preceded by
757 end_specialization (void)
760 reset_specialization ();
763 /* Any template <>'s that we have seen thus far are not referring to a
764 function specialization. */
767 reset_specialization (void)
769 processing_specialization
= 0;
770 template_header_count
= 0;
773 /* We've just seen a template header. If SPECIALIZATION is nonzero,
774 it was of the form template <>. */
777 note_template_header (int specialization
)
779 processing_specialization
= specialization
;
780 template_header_count
++;
783 /* We're beginning an explicit instantiation. */
786 begin_explicit_instantiation (void)
788 gcc_assert (!processing_explicit_instantiation
);
789 processing_explicit_instantiation
= true;
794 end_explicit_instantiation (void)
796 gcc_assert (processing_explicit_instantiation
);
797 processing_explicit_instantiation
= false;
800 /* An explicit specialization or partial specialization of TMPL is being
801 declared. Check that the namespace in which the specialization is
802 occurring is permissible. Returns false iff it is invalid to
803 specialize TMPL in the current namespace. */
806 check_specialization_namespace (tree tmpl
)
808 tree tpl_ns
= decl_namespace_context (tmpl
);
812 An explicit specialization shall be declared in a namespace enclosing the
813 specialized template. An explicit specialization whose declarator-id is
814 not qualified shall be declared in the nearest enclosing namespace of the
815 template, or, if the namespace is inline (7.3.1), any namespace from its
816 enclosing namespace set. */
817 if (current_scope() != DECL_CONTEXT (tmpl
)
818 && !at_namespace_scope_p ())
820 error ("specialization of %qD must appear at namespace scope", tmpl
);
824 if (is_nested_namespace (current_namespace
, tpl_ns
, cxx_dialect
< cxx11
))
825 /* Same or enclosing namespace. */
829 auto_diagnostic_group d
;
830 if (permerror (input_location
,
831 "specialization of %qD in different namespace", tmpl
))
832 inform (DECL_SOURCE_LOCATION (tmpl
),
833 " from definition of %q#D", tmpl
);
838 /* SPEC is an explicit instantiation. Check that it is valid to
839 perform this explicit instantiation in the current namespace. */
842 check_explicit_instantiation_namespace (tree spec
)
846 /* DR 275: An explicit instantiation shall appear in an enclosing
847 namespace of its template. */
848 ns
= decl_namespace_context (spec
);
849 if (!is_nested_namespace (current_namespace
, ns
))
850 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
851 "(which does not enclose namespace %qD)",
852 spec
, current_namespace
, ns
);
855 // Returns the type of a template specialization only if that
856 // specialization needs to be defined. Otherwise (e.g., if the type has
857 // already been defined), the function returns NULL_TREE.
859 maybe_new_partial_specialization (tree type
)
861 // An implicit instantiation of an incomplete type implies
862 // the definition of a new class template.
864 // template<typename T>
867 // template<typename T>
870 // Here, S<T*> is an implicit instantiation of S whose type
872 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
) && !COMPLETE_TYPE_P (type
))
875 // It can also be the case that TYPE is a completed specialization.
876 // Continuing the previous example, suppose we also declare:
878 // template<typename T>
879 // requires Integral<T>
882 // Here, S<T*> refers to the specialization S<T*> defined
883 // above. However, we need to differentiate definitions because
884 // we intend to define a new partial specialization. In this case,
885 // we rely on the fact that the constraints are different for
886 // this declaration than that above.
888 // Note that we also get here for injected class names and
889 // late-parsed template definitions. We must ensure that we
890 // do not create new type declarations for those cases.
891 if (flag_concepts
&& CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
893 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
894 tree args
= CLASSTYPE_TI_ARGS (type
);
896 // If there are no template parameters, this cannot be a new
897 // partial template specializtion?
898 if (!current_template_parms
)
901 // The injected-class-name is not a new partial specialization.
902 if (DECL_SELF_REFERENCE_P (TYPE_NAME (type
)))
905 // If the constraints are not the same as those of the primary
906 // then, we can probably create a new specialization.
907 tree type_constr
= current_template_constraints ();
909 if (type
== TREE_TYPE (tmpl
))
911 tree main_constr
= get_constraints (tmpl
);
912 if (equivalent_constraints (type_constr
, main_constr
))
916 // Also, if there's a pre-existing specialization with matching
917 // constraints, then this also isn't new.
918 tree specs
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
921 tree spec_tmpl
= TREE_VALUE (specs
);
922 tree spec_args
= TREE_PURPOSE (specs
);
923 tree spec_constr
= get_constraints (spec_tmpl
);
924 if (comp_template_args (args
, spec_args
)
925 && equivalent_constraints (type_constr
, spec_constr
))
927 specs
= TREE_CHAIN (specs
);
930 // Create a new type node (and corresponding type decl)
931 // for the newly declared specialization.
932 tree t
= make_class_type (TREE_CODE (type
));
933 CLASSTYPE_DECLARED_CLASS (t
) = CLASSTYPE_DECLARED_CLASS (type
);
934 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (tmpl
, args
));
936 /* We only need a separate type node for storing the definition of this
937 partial specialization; uses of S<T*> are unconstrained, so all are
938 equivalent. So keep TYPE_CANONICAL the same. */
939 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
941 // Build the corresponding type decl.
942 tree d
= create_implicit_typedef (DECL_NAME (tmpl
), t
);
943 DECL_CONTEXT (d
) = TYPE_CONTEXT (t
);
944 DECL_SOURCE_LOCATION (d
) = input_location
;
952 /* The TYPE is being declared. If it is a template type, that means it
953 is a partial specialization. Do appropriate error-checking. */
956 maybe_process_partial_specialization (tree type
)
960 if (type
== error_mark_node
)
961 return error_mark_node
;
963 /* A lambda that appears in specialization context is not itself a
965 if (CLASS_TYPE_P (type
) && CLASSTYPE_LAMBDA_EXPR (type
))
968 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
970 error ("name of class shadows template template parameter %qD",
972 return error_mark_node
;
975 context
= TYPE_CONTEXT (type
);
977 if (TYPE_ALIAS_P (type
))
979 tree tinfo
= TYPE_ALIAS_TEMPLATE_INFO (type
);
981 if (tinfo
&& DECL_ALIAS_TEMPLATE_P (TI_TEMPLATE (tinfo
)))
982 error ("specialization of alias template %qD",
983 TI_TEMPLATE (tinfo
));
985 error ("explicit specialization of non-template %qT", type
);
986 return error_mark_node
;
988 else if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
990 /* This is for ordinary explicit specialization and partial
991 specialization of a template class such as:
993 template <> class C<int>;
997 template <class T> class C<T*>;
999 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
1001 if (tree t
= maybe_new_partial_specialization (type
))
1003 if (!check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (t
))
1004 && !at_namespace_scope_p ())
1005 return error_mark_node
;
1006 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (t
);
1007 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (t
)) = input_location
;
1008 if (processing_template_decl
)
1010 tree decl
= push_template_decl (TYPE_MAIN_DECL (t
));
1011 if (decl
== error_mark_node
)
1012 return error_mark_node
;
1013 return TREE_TYPE (decl
);
1016 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
1017 error ("specialization of %qT after instantiation", type
);
1018 else if (errorcount
&& !processing_specialization
1019 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
)
1020 && !uses_template_parms (CLASSTYPE_TI_ARGS (type
)))
1021 /* Trying to define a specialization either without a template<> header
1022 or in an inappropriate place. We've already given an error, so just
1023 bail now so we don't actually define the specialization. */
1024 return error_mark_node
;
1026 else if (CLASS_TYPE_P (type
)
1027 && !CLASSTYPE_USE_TEMPLATE (type
)
1028 && CLASSTYPE_TEMPLATE_INFO (type
)
1029 && context
&& CLASS_TYPE_P (context
)
1030 && CLASSTYPE_TEMPLATE_INFO (context
))
1032 /* This is for an explicit specialization of member class
1033 template according to [temp.expl.spec/18]:
1035 template <> template <class U> class C<int>::D;
1037 The context `C<int>' must be an implicit instantiation.
1038 Otherwise this is just a member class template declared
1041 template <> class C<int> { template <class U> class D; };
1042 template <> template <class U> class C<int>::D;
1044 In the first case, `C<int>::D' is a specialization of `C<T>::D'
1045 while in the second case, `C<int>::D' is a primary template
1046 and `C<T>::D' may not exist. */
1048 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
1049 && !COMPLETE_TYPE_P (type
))
1052 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
1054 if (current_namespace
1055 != decl_namespace_context (tmpl
))
1057 if (permerror (input_location
,
1058 "specialization of %qD in different namespace",
1060 inform (DECL_SOURCE_LOCATION (tmpl
),
1061 "from definition of %q#D", tmpl
);
1064 /* Check for invalid specialization after instantiation:
1066 template <> template <> class C<int>::D<int>;
1067 template <> template <class U> class C<int>::D; */
1069 for (t
= DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
1070 t
; t
= TREE_CHAIN (t
))
1072 tree inst
= TREE_VALUE (t
);
1073 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (inst
)
1074 || !COMPLETE_OR_OPEN_TYPE_P (inst
))
1076 /* We already have a full specialization of this partial
1077 instantiation, or a full specialization has been
1078 looked up but not instantiated. Reassign it to the
1079 new member specialization template. */
1083 elt
.tmpl
= most_general_template (tmpl
);
1084 elt
.args
= CLASSTYPE_TI_ARGS (inst
);
1087 type_specializations
->remove_elt (&elt
);
1090 CLASSTYPE_TI_ARGS (inst
)
1091 = elt
.args
= INNERMOST_TEMPLATE_ARGS (elt
.args
);
1094 = type_specializations
->find_slot (&elt
, INSERT
);
1095 entry
= ggc_alloc
<spec_entry
> ();
1100 /* But if we've had an implicit instantiation, that's a
1101 problem ([temp.expl.spec]/6). */
1102 error ("specialization %qT after instantiation %qT",
1106 /* Mark TYPE as a specialization. And as a result, we only
1107 have one level of template argument for the innermost
1109 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
1110 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
1111 CLASSTYPE_TI_ARGS (type
)
1112 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
1115 else if (processing_specialization
)
1117 /* Someday C++0x may allow for enum template specialization. */
1118 if (cxx_dialect
> cxx98
&& TREE_CODE (type
) == ENUMERAL_TYPE
1119 && CLASS_TYPE_P (context
) && CLASSTYPE_USE_TEMPLATE (context
))
1120 pedwarn (input_location
, OPT_Wpedantic
, "template specialization "
1121 "of %qD not allowed by ISO C++", type
);
1124 error ("explicit specialization of non-template %qT", type
);
1125 return error_mark_node
;
1132 /* Returns nonzero if we can optimize the retrieval of specializations
1133 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
1134 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
1137 optimize_specialization_lookup_p (tree tmpl
)
1139 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
1140 && DECL_CLASS_SCOPE_P (tmpl
)
1141 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
1143 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
1144 /* The optimized lookup depends on the fact that the
1145 template arguments for the member function template apply
1146 purely to the containing class, which is not true if the
1147 containing class is an explicit or partial
1149 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
1150 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
1151 && !DECL_CONV_FN_P (tmpl
)
1152 /* It is possible to have a template that is not a member
1153 template and is not a member of a template class:
1155 template <typename T>
1156 struct S { friend A::f(); };
1158 Here, the friend function is a template, but the context does
1159 not have template information. The optimized lookup relies
1160 on having ARGS be the template arguments for both the class
1161 and the function template. */
1162 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
1165 /* Make sure ARGS doesn't use any inappropriate typedefs; we should have
1166 gone through coerce_template_parms by now. */
1169 verify_unstripped_args_1 (tree inner
)
1171 for (int i
= 0; i
< TREE_VEC_LENGTH (inner
); ++i
)
1173 tree arg
= TREE_VEC_ELT (inner
, i
);
1174 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
1176 else if (TYPE_P (arg
))
1177 gcc_assert (strip_typedefs (arg
, NULL
) == arg
);
1178 else if (ARGUMENT_PACK_P (arg
))
1179 verify_unstripped_args_1 (ARGUMENT_PACK_ARGS (arg
));
1180 else if (strip_typedefs (TREE_TYPE (arg
), NULL
) != TREE_TYPE (arg
))
1181 /* Allow typedefs on the type of a non-type argument, since a
1182 parameter can have them. */;
1184 gcc_assert (strip_typedefs_expr (arg
, NULL
) == arg
);
1189 verify_unstripped_args (tree args
)
1191 ++processing_template_decl
;
1192 if (!any_dependent_template_arguments_p (args
))
1193 verify_unstripped_args_1 (INNERMOST_TEMPLATE_ARGS (args
));
1194 --processing_template_decl
;
1197 /* Retrieve the specialization (in the sense of [temp.spec] - a
1198 specialization is either an instantiation or an explicit
1199 specialization) of TMPL for the given template ARGS. If there is
1200 no such specialization, return NULL_TREE. The ARGS are a vector of
1201 arguments, or a vector of vectors of arguments, in the case of
1202 templates with more than one level of parameters.
1204 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1205 then we search for a partial specialization matching ARGS. This
1206 parameter is ignored if TMPL is not a class template.
1208 We can also look up a FIELD_DECL, if it is a lambda capture pack; the
1209 result is a NONTYPE_ARGUMENT_PACK. */
1212 retrieve_specialization (tree tmpl
, tree args
, hashval_t hash
)
1214 if (tmpl
== NULL_TREE
)
1217 if (args
== error_mark_node
)
1220 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
1221 || TREE_CODE (tmpl
) == FIELD_DECL
);
1223 /* There should be as many levels of arguments as there are
1224 levels of parameters. */
1225 gcc_assert (TMPL_ARGS_DEPTH (args
)
1226 == (TREE_CODE (tmpl
) == TEMPLATE_DECL
1227 ? TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
))
1228 : template_class_depth (DECL_CONTEXT (tmpl
))));
1231 verify_unstripped_args (args
);
1233 /* Lambda functions in templates aren't instantiated normally, but through
1234 tsubst_lambda_expr. */
1235 if (lambda_fn_in_template_p (tmpl
))
1238 if (optimize_specialization_lookup_p (tmpl
))
1240 /* The template arguments actually apply to the containing
1241 class. Find the class specialization with those
1243 tree class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
1244 tree class_specialization
1245 = retrieve_specialization (class_template
, args
, 0);
1246 if (!class_specialization
)
1249 /* Find the instance of TMPL. */
1250 tree fns
= get_class_binding (class_specialization
, DECL_NAME (tmpl
));
1251 for (ovl_iterator
iter (fns
); iter
; ++iter
)
1254 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
1255 /* using-declarations can add base methods to the method vec,
1256 and we don't want those here. */
1257 && DECL_CONTEXT (fn
) == class_specialization
)
1266 hash_table
<spec_hasher
> *specializations
;
1270 elt
.spec
= NULL_TREE
;
1272 if (DECL_CLASS_TEMPLATE_P (tmpl
))
1273 specializations
= type_specializations
;
1275 specializations
= decl_specializations
;
1278 hash
= spec_hasher::hash (&elt
);
1279 found
= specializations
->find_with_hash (&elt
, hash
);
1287 /* Like retrieve_specialization, but for local declarations. */
1290 retrieve_local_specialization (tree tmpl
)
1292 if (local_specializations
== NULL
)
1295 tree
*slot
= local_specializations
->get (tmpl
);
1296 return slot
? *slot
: NULL_TREE
;
1299 /* Returns nonzero iff DECL is a specialization of TMPL. */
1302 is_specialization_of (tree decl
, tree tmpl
)
1306 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1310 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1316 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1318 for (t
= TREE_TYPE (decl
);
1320 t
= CLASSTYPE_USE_TEMPLATE (t
)
1321 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1322 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1329 /* Returns nonzero iff DECL is a specialization of friend declaration
1330 FRIEND_DECL according to [temp.friend]. */
1333 is_specialization_of_friend (tree decl
, tree friend_decl
)
1335 bool need_template
= true;
1338 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1339 || TREE_CODE (decl
) == TYPE_DECL
);
1341 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1342 of a template class, we want to check if DECL is a specialization
1344 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1345 && DECL_TEMPLATE_INFO (friend_decl
)
1346 && !DECL_USE_TEMPLATE (friend_decl
))
1348 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1349 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1350 need_template
= false;
1352 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1353 && !PRIMARY_TEMPLATE_P (friend_decl
))
1354 need_template
= false;
1356 /* There is nothing to do if this is not a template friend. */
1357 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1360 if (is_specialization_of (decl
, friend_decl
))
1364 A member of a class template may be declared to be a friend of a
1365 non-template class. In this case, the corresponding member of
1366 every specialization of the class template is a friend of the
1367 class granting friendship.
1369 For example, given a template friend declaration
1371 template <class T> friend void A<T>::f();
1373 the member function below is considered a friend
1375 template <> struct A<int> {
1379 For this type of template friend, TEMPLATE_DEPTH below will be
1380 nonzero. To determine if DECL is a friend of FRIEND, we first
1381 check if the enclosing class is a specialization of another. */
1383 template_depth
= template_class_depth (CP_DECL_CONTEXT (friend_decl
));
1385 && DECL_CLASS_SCOPE_P (decl
)
1386 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1387 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1389 /* Next, we check the members themselves. In order to handle
1390 a few tricky cases, such as when FRIEND_DECL's are
1392 template <class T> friend void A<T>::g(T t);
1393 template <class T> template <T t> friend void A<T>::h();
1397 void A<int>::g(int);
1398 template <int> void A<int>::h();
1400 we need to figure out ARGS, the template arguments from
1401 the context of DECL. This is required for template substitution
1402 of `T' in the function parameter of `g' and template parameter
1403 of `h' in the above examples. Here ARGS corresponds to `int'. */
1405 tree context
= DECL_CONTEXT (decl
);
1406 tree args
= NULL_TREE
;
1407 int current_depth
= 0;
1409 while (current_depth
< template_depth
)
1411 if (CLASSTYPE_TEMPLATE_INFO (context
))
1413 if (current_depth
== 0)
1414 args
= TYPE_TI_ARGS (context
);
1416 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1419 context
= TYPE_CONTEXT (context
);
1422 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1427 tree friend_args_type
;
1428 tree decl_args_type
;
1430 /* Make sure that both DECL and FRIEND_DECL are templates or
1432 is_template
= DECL_TEMPLATE_INFO (decl
)
1433 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1434 if (need_template
^ is_template
)
1436 else if (is_template
)
1438 /* If both are templates, check template parameter list. */
1440 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1442 if (!comp_template_parms
1443 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1447 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1450 decl_type
= TREE_TYPE (decl
);
1452 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1453 tf_none
, NULL_TREE
);
1454 if (friend_type
== error_mark_node
)
1457 /* Check if return types match. */
1458 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1461 /* Check if function parameter types match, ignoring the
1462 `this' parameter. */
1463 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1464 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1465 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1466 friend_args_type
= TREE_CHAIN (friend_args_type
);
1467 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1468 decl_args_type
= TREE_CHAIN (decl_args_type
);
1470 return compparms (decl_args_type
, friend_args_type
);
1474 /* DECL is a TYPE_DECL */
1476 tree decl_type
= TREE_TYPE (decl
);
1478 /* Make sure that both DECL and FRIEND_DECL are templates or
1481 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1482 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1484 if (need_template
^ is_template
)
1486 else if (is_template
)
1489 /* If both are templates, check the name of the two
1490 TEMPLATE_DECL's first because is_friend didn't. */
1491 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1492 != DECL_NAME (friend_decl
))
1495 /* Now check template parameter list. */
1497 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1499 return comp_template_parms
1500 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1504 return (DECL_NAME (decl
)
1505 == DECL_NAME (friend_decl
));
1511 /* Register the specialization SPEC as a specialization of TMPL with
1512 the indicated ARGS. IS_FRIEND indicates whether the specialization
1513 is actually just a friend declaration. ATTRLIST is the list of
1514 attributes that the specialization is declared with or NULL when
1515 it isn't. Returns SPEC, or an equivalent prior declaration, if
1518 We also store instantiations of field packs in the hash table, even
1519 though they are not themselves templates, to make lookup easier. */
1522 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
,
1526 spec_entry
**slot
= NULL
;
1529 gcc_assert ((TREE_CODE (tmpl
) == TEMPLATE_DECL
&& DECL_P (spec
))
1530 || (TREE_CODE (tmpl
) == FIELD_DECL
1531 && TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
));
1533 if (TREE_CODE (spec
) == FUNCTION_DECL
1534 && uses_template_parms (DECL_TI_ARGS (spec
)))
1535 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1536 register it; we want the corresponding TEMPLATE_DECL instead.
1537 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1538 the more obvious `uses_template_parms (spec)' to avoid problems
1539 with default function arguments. In particular, given
1540 something like this:
1542 template <class T> void f(T t1, T t = T())
1544 the default argument expression is not substituted for in an
1545 instantiation unless and until it is actually needed. */
1548 if (optimize_specialization_lookup_p (tmpl
))
1549 /* We don't put these specializations in the hash table, but we might
1550 want to give an error about a mismatch. */
1551 fn
= retrieve_specialization (tmpl
, args
, 0);
1559 hash
= spec_hasher::hash (&elt
);
1562 decl_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
1564 fn
= ((spec_entry
*) *slot
)->spec
;
1569 /* We can sometimes try to re-register a specialization that we've
1570 already got. In particular, regenerate_decl_from_template calls
1571 duplicate_decls which will update the specialization list. But,
1572 we'll still get called again here anyhow. It's more convenient
1573 to simply allow this than to try to prevent it. */
1576 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1578 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1580 if (DECL_ODR_USED (fn
)
1581 || DECL_EXPLICIT_INSTANTIATION (fn
))
1583 error ("specialization of %qD after instantiation",
1585 return error_mark_node
;
1590 /* This situation should occur only if the first
1591 specialization is an implicit instantiation, the
1592 second is an explicit specialization, and the
1593 implicit instantiation has not yet been used. That
1594 situation can occur if we have implicitly
1595 instantiated a member function and then specialized
1598 We can also wind up here if a friend declaration that
1599 looked like an instantiation turns out to be a
1602 template <class T> void foo(T);
1603 class S { friend void foo<>(int) };
1604 template <> void foo(int);
1606 We transform the existing DECL in place so that any
1607 pointers to it become pointers to the updated
1610 If there was a definition for the template, but not
1611 for the specialization, we want this to look as if
1612 there were no definition, and vice versa. */
1613 DECL_INITIAL (fn
) = NULL_TREE
;
1614 duplicate_decls (spec
, fn
, is_friend
);
1615 /* The call to duplicate_decls will have applied
1618 An explicit specialization of a function template
1619 is inline only if it is explicitly declared to be,
1620 and independently of whether its function template
1623 to the primary function; now copy the inline bits to
1624 the various clones. */
1625 FOR_EACH_CLONE (clone
, fn
)
1627 DECL_DECLARED_INLINE_P (clone
)
1628 = DECL_DECLARED_INLINE_P (fn
);
1629 DECL_SOURCE_LOCATION (clone
)
1630 = DECL_SOURCE_LOCATION (fn
);
1631 DECL_DELETED_FN (clone
)
1632 = DECL_DELETED_FN (fn
);
1634 check_specialization_namespace (tmpl
);
1639 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1641 tree dd
= duplicate_decls (spec
, fn
, is_friend
);
1642 if (dd
== error_mark_node
)
1643 /* We've already complained in duplicate_decls. */
1644 return error_mark_node
;
1646 if (dd
== NULL_TREE
&& DECL_INITIAL (spec
))
1647 /* Dup decl failed, but this is a new definition. Set the
1648 line number so any errors match this new
1650 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1656 return duplicate_decls (spec
, fn
, is_friend
);
1658 /* A specialization must be declared in the same namespace as the
1659 template it is specializing. */
1660 if (DECL_P (spec
) && DECL_TEMPLATE_SPECIALIZATION (spec
)
1661 && !check_specialization_namespace (tmpl
))
1662 DECL_CONTEXT (spec
) = DECL_CONTEXT (tmpl
);
1664 if (slot
!= NULL
/* !optimize_specialization_lookup_p (tmpl) */)
1666 spec_entry
*entry
= ggc_alloc
<spec_entry
> ();
1667 gcc_assert (tmpl
&& args
&& spec
);
1670 if ((TREE_CODE (spec
) == FUNCTION_DECL
&& DECL_NAMESPACE_SCOPE_P (spec
)
1671 && PRIMARY_TEMPLATE_P (tmpl
)
1672 && DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (tmpl
)) == NULL_TREE
)
1673 || variable_template_p (tmpl
))
1674 /* If TMPL is a forward declaration of a template function, keep a list
1675 of all specializations in case we need to reassign them to a friend
1676 template later in tsubst_friend_function.
1678 Also keep a list of all variable template instantiations so that
1679 process_partial_specialization can check whether a later partial
1680 specialization would have used it. */
1681 DECL_TEMPLATE_INSTANTIATIONS (tmpl
)
1682 = tree_cons (args
, spec
, DECL_TEMPLATE_INSTANTIATIONS (tmpl
));
1688 /* Returns true iff two spec_entry nodes are equivalent. */
1690 int comparing_specializations
;
1693 spec_hasher::equal (spec_entry
*e1
, spec_entry
*e2
)
1697 ++comparing_specializations
;
1698 equal
= (e1
->tmpl
== e2
->tmpl
1699 && comp_template_args (e1
->args
, e2
->args
));
1700 if (equal
&& flag_concepts
1701 /* tmpl could be a FIELD_DECL for a capture pack. */
1702 && TREE_CODE (e1
->tmpl
) == TEMPLATE_DECL
1703 && VAR_P (DECL_TEMPLATE_RESULT (e1
->tmpl
))
1704 && uses_template_parms (e1
->args
))
1706 /* Partial specializations of a variable template can be distinguished by
1708 tree c1
= e1
->spec
? get_constraints (e1
->spec
) : NULL_TREE
;
1709 tree c2
= e2
->spec
? get_constraints (e2
->spec
) : NULL_TREE
;
1710 equal
= equivalent_constraints (c1
, c2
);
1712 --comparing_specializations
;
1717 /* Returns a hash for a template TMPL and template arguments ARGS. */
1720 hash_tmpl_and_args (tree tmpl
, tree args
)
1722 hashval_t val
= iterative_hash_object (DECL_UID (tmpl
), 0);
1723 return iterative_hash_template_arg (args
, val
);
1726 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1730 spec_hasher::hash (spec_entry
*e
)
1732 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
1735 /* Recursively calculate a hash value for a template argument ARG, for use
1736 in the hash tables of template specializations. */
1739 iterative_hash_template_arg (tree arg
, hashval_t val
)
1741 unsigned HOST_WIDE_INT i
;
1742 enum tree_code code
;
1745 if (arg
== NULL_TREE
)
1746 return iterative_hash_object (arg
, val
);
1751 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
1754 code
= TREE_CODE (arg
);
1755 tclass
= TREE_CODE_CLASS (code
);
1757 val
= iterative_hash_object (code
, val
);
1764 case IDENTIFIER_NODE
:
1765 return iterative_hash_object (IDENTIFIER_HASH_VALUE (arg
), val
);
1769 int i
, len
= TREE_VEC_LENGTH (arg
);
1770 for (i
= 0; i
< len
; ++i
)
1771 val
= iterative_hash_template_arg (TREE_VEC_ELT (arg
, i
), val
);
1775 case TYPE_PACK_EXPANSION
:
1776 case EXPR_PACK_EXPANSION
:
1777 val
= iterative_hash_template_arg (PACK_EXPANSION_PATTERN (arg
), val
);
1778 return iterative_hash_template_arg (PACK_EXPANSION_EXTRA_ARGS (arg
), val
);
1780 case TYPE_ARGUMENT_PACK
:
1781 case NONTYPE_ARGUMENT_PACK
:
1782 return iterative_hash_template_arg (ARGUMENT_PACK_ARGS (arg
), val
);
1785 for (; arg
; arg
= TREE_CHAIN (arg
))
1786 val
= iterative_hash_template_arg (TREE_VALUE (arg
), val
);
1790 for (lkp_iterator
iter (arg
); iter
; ++iter
)
1791 val
= iterative_hash_template_arg (*iter
, val
);
1797 iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1798 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg
), i
, field
, value
)
1800 val
= iterative_hash_template_arg (field
, val
);
1801 val
= iterative_hash_template_arg (value
, val
);
1807 if (!DECL_ARTIFICIAL (arg
))
1809 val
= iterative_hash_object (DECL_PARM_INDEX (arg
), val
);
1810 val
= iterative_hash_object (DECL_PARM_LEVEL (arg
), val
);
1812 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1815 return iterative_hash_template_arg (TARGET_EXPR_INITIAL (arg
), val
);
1818 val
= iterative_hash_template_arg (PTRMEM_CST_CLASS (arg
), val
);
1819 return iterative_hash_template_arg (PTRMEM_CST_MEMBER (arg
), val
);
1821 case TEMPLATE_PARM_INDEX
:
1822 val
= iterative_hash_template_arg
1823 (TREE_TYPE (TEMPLATE_PARM_DECL (arg
)), val
);
1824 val
= iterative_hash_object (TEMPLATE_PARM_LEVEL (arg
), val
);
1825 return iterative_hash_object (TEMPLATE_PARM_IDX (arg
), val
);
1828 val
= iterative_hash_object (TRAIT_EXPR_KIND (arg
), val
);
1829 val
= iterative_hash_template_arg (TRAIT_EXPR_TYPE1 (arg
), val
);
1830 return iterative_hash_template_arg (TRAIT_EXPR_TYPE2 (arg
), val
);
1833 val
= iterative_hash_template_arg (BINFO_TYPE (BASELINK_BINFO (arg
)),
1835 return iterative_hash_template_arg (DECL_NAME (get_first_fn (arg
)),
1839 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, 0), val
);
1840 code
= TREE_CODE (TREE_OPERAND (arg
, 1));
1841 val
= iterative_hash_object (code
, val
);
1842 return iterative_hash_template_arg (TREE_OPERAND (arg
, 2), val
);
1845 /* [temp.over.link] Two lambda-expressions are never considered
1848 So just hash the closure type. */
1849 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1852 case IMPLICIT_CONV_EXPR
:
1853 case STATIC_CAST_EXPR
:
1854 case REINTERPRET_CAST_EXPR
:
1855 case CONST_CAST_EXPR
:
1856 case DYNAMIC_CAST_EXPR
:
1858 val
= iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1859 /* Now hash operands as usual. */
1864 tree fn
= CALL_EXPR_FN (arg
);
1865 if (tree name
= dependent_name (fn
))
1867 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
1868 val
= iterative_hash_template_arg (TREE_OPERAND (fn
, 1), val
);
1871 val
= iterative_hash_template_arg (fn
, val
);
1872 call_expr_arg_iterator ai
;
1873 for (tree x
= first_call_expr_arg (arg
, &ai
); x
;
1874 x
= next_call_expr_arg (&ai
))
1875 val
= iterative_hash_template_arg (x
, val
);
1886 if (alias_template_specialization_p (arg
))
1888 // We want an alias specialization that survived strip_typedefs
1889 // to hash differently from its TYPE_CANONICAL, to avoid hash
1890 // collisions that compare as different in template_args_equal.
1891 // These could be dependent specializations that strip_typedefs
1892 // left alone, or untouched specializations because
1893 // coerce_template_parms returns the unconverted template
1894 // arguments if it sees incomplete argument packs.
1895 tree ti
= TYPE_ALIAS_TEMPLATE_INFO (arg
);
1896 return hash_tmpl_and_args (TI_TEMPLATE (ti
), TI_ARGS (ti
));
1898 if (TYPE_CANONICAL (arg
))
1899 return iterative_hash_object (TYPE_HASH (TYPE_CANONICAL (arg
)),
1901 else if (TREE_CODE (arg
) == DECLTYPE_TYPE
)
1902 return iterative_hash_template_arg (DECLTYPE_TYPE_EXPR (arg
), val
);
1903 /* Otherwise just compare the types during lookup. */
1906 case tcc_declaration
:
1908 return iterative_hash_expr (arg
, val
);
1911 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
1913 unsigned n
= cp_tree_operand_length (arg
);
1914 for (i
= 0; i
< n
; ++i
)
1915 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, i
), val
);
1923 /* Unregister the specialization SPEC as a specialization of TMPL.
1924 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1925 if the SPEC was listed as a specialization of TMPL.
1927 Note that SPEC has been ggc_freed, so we can't look inside it. */
1930 reregister_specialization (tree spec
, tree tinfo
, tree new_spec
)
1935 elt
.tmpl
= most_general_template (TI_TEMPLATE (tinfo
));
1936 elt
.args
= TI_ARGS (tinfo
);
1937 elt
.spec
= NULL_TREE
;
1939 entry
= decl_specializations
->find (&elt
);
1942 gcc_assert (entry
->spec
== spec
|| entry
->spec
== new_spec
);
1943 gcc_assert (new_spec
!= NULL_TREE
);
1944 entry
->spec
= new_spec
;
1951 /* Like register_specialization, but for local declarations. We are
1952 registering SPEC, an instantiation of TMPL. */
1955 register_local_specialization (tree spec
, tree tmpl
)
1957 gcc_assert (tmpl
!= spec
);
1958 local_specializations
->put (tmpl
, spec
);
1961 /* TYPE is a class type. Returns true if TYPE is an explicitly
1962 specialized class. */
1965 explicit_class_specialization_p (tree type
)
1967 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1969 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1972 /* Print the list of functions at FNS, going through all the overloads
1973 for each element of the list. Alternatively, FNS cannot be a
1974 TREE_LIST, in which case it will be printed together with all the
1977 MORE and *STR should respectively be FALSE and NULL when the function
1978 is called from the outside. They are used internally on recursive
1979 calls. print_candidates manages the two parameters and leaves NULL
1980 in *STR when it ends. */
1983 print_candidates_1 (tree fns
, char **str
, bool more
= false)
1985 if (TREE_CODE (fns
) == TREE_LIST
)
1986 for (; fns
; fns
= TREE_CHAIN (fns
))
1987 print_candidates_1 (TREE_VALUE (fns
), str
, more
|| TREE_CHAIN (fns
));
1989 for (lkp_iterator
iter (fns
); iter
;)
1994 const char *pfx
= *str
;
1998 pfx
= _("candidates are:");
2000 pfx
= _("candidate is:");
2001 *str
= get_spaces (pfx
);
2003 inform (DECL_SOURCE_LOCATION (cand
), "%s %#qD", pfx
, cand
);
2007 /* Print the list of candidate FNS in an error message. FNS can also
2008 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
2011 print_candidates (tree fns
)
2014 print_candidates_1 (fns
, &str
);
2018 /* Get a (possibly) constrained template declaration for the
2019 purpose of ordering candidates. */
2021 get_template_for_ordering (tree list
)
2023 gcc_assert (TREE_CODE (list
) == TREE_LIST
);
2024 tree f
= TREE_VALUE (list
);
2025 if (tree ti
= DECL_TEMPLATE_INFO (f
))
2026 return TI_TEMPLATE (ti
);
2030 /* Among candidates having the same signature, return the
2031 most constrained or NULL_TREE if there is no best candidate.
2032 If the signatures of candidates vary (e.g., template
2033 specialization vs. member function), then there can be no
2036 Note that we don't compare constraints on the functions
2037 themselves, but rather those of their templates. */
2039 most_constrained_function (tree candidates
)
2041 // Try to find the best candidate in a first pass.
2042 tree champ
= candidates
;
2043 for (tree c
= TREE_CHAIN (champ
); c
; c
= TREE_CHAIN (c
))
2045 int winner
= more_constrained (get_template_for_ordering (champ
),
2046 get_template_for_ordering (c
));
2048 champ
= c
; // The candidate is more constrained
2049 else if (winner
== 0)
2050 return NULL_TREE
; // Neither is more constrained
2053 // Verify that the champ is better than previous candidates.
2054 for (tree c
= candidates
; c
!= champ
; c
= TREE_CHAIN (c
)) {
2055 if (!more_constrained (get_template_for_ordering (champ
),
2056 get_template_for_ordering (c
)))
2064 /* Returns the template (one of the functions given by TEMPLATE_ID)
2065 which can be specialized to match the indicated DECL with the
2066 explicit template args given in TEMPLATE_ID. The DECL may be
2067 NULL_TREE if none is available. In that case, the functions in
2068 TEMPLATE_ID are non-members.
2070 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
2071 specialization of a member template.
2073 The TEMPLATE_COUNT is the number of references to qualifying
2074 template classes that appeared in the name of the function. See
2075 check_explicit_specialization for a more accurate description.
2077 TSK indicates what kind of template declaration (if any) is being
2078 declared. TSK_TEMPLATE indicates that the declaration given by
2079 DECL, though a FUNCTION_DECL, has template parameters, and is
2080 therefore a template function.
2082 The template args (those explicitly specified and those deduced)
2083 are output in a newly created vector *TARGS_OUT.
2085 If it is impossible to determine the result, an error message is
2086 issued. The error_mark_node is returned to indicate failure. */
2089 determine_specialization (tree template_id
,
2092 int need_member_template
,
2098 tree explicit_targs
;
2099 tree candidates
= NULL_TREE
;
2101 /* A TREE_LIST of templates of which DECL may be a specialization.
2102 The TREE_VALUE of each node is a TEMPLATE_DECL. The
2103 corresponding TREE_PURPOSE is the set of template arguments that,
2104 when used to instantiate the template, would produce a function
2105 with the signature of DECL. */
2106 tree templates
= NULL_TREE
;
2108 cp_binding_level
*b
;
2110 *targs_out
= NULL_TREE
;
2112 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
2113 return error_mark_node
;
2115 /* We shouldn't be specializing a member template of an
2116 unspecialized class template; we already gave an error in
2117 check_specialization_scope, now avoid crashing. */
2119 && template_count
&& DECL_CLASS_SCOPE_P (decl
)
2120 && template_class_depth (DECL_CONTEXT (decl
)) > 0)
2122 gcc_assert (errorcount
);
2123 return error_mark_node
;
2126 fns
= TREE_OPERAND (template_id
, 0);
2127 explicit_targs
= TREE_OPERAND (template_id
, 1);
2129 if (fns
== error_mark_node
)
2130 return error_mark_node
;
2132 /* Check for baselinks. */
2133 if (BASELINK_P (fns
))
2134 fns
= BASELINK_FUNCTIONS (fns
);
2136 if (TREE_CODE (decl
) == FUNCTION_DECL
&& !is_overloaded_fn (fns
))
2138 error ("%qD is not a function template", fns
);
2139 return error_mark_node
;
2141 else if (VAR_P (decl
) && !variable_template_p (fns
))
2143 error ("%qD is not a variable template", fns
);
2144 return error_mark_node
;
2147 /* Count the number of template headers specified for this
2150 for (b
= current_binding_level
;
2151 b
->kind
== sk_template_parms
;
2155 tree orig_fns
= fns
;
2157 if (variable_template_p (fns
))
2159 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (fns
));
2160 targs
= coerce_template_parms (parms
, explicit_targs
, fns
,
2161 tf_warning_or_error
,
2162 /*req_all*/true, /*use_defarg*/true);
2163 if (targs
!= error_mark_node
)
2164 templates
= tree_cons (targs
, fns
, templates
);
2166 else for (lkp_iterator
iter (fns
); iter
; ++iter
)
2170 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2172 tree decl_arg_types
;
2176 /* In case of explicit specialization, we need to check if
2177 the number of template headers appearing in the specialization
2178 is correct. This is usually done in check_explicit_specialization,
2179 but the check done there cannot be exhaustive when specializing
2180 member functions. Consider the following code:
2182 template <> void A<int>::f(int);
2183 template <> template <> void A<int>::f(int);
2185 Assuming that A<int> is not itself an explicit specialization
2186 already, the first line specializes "f" which is a non-template
2187 member function, whilst the second line specializes "f" which
2188 is a template member function. So both lines are syntactically
2189 correct, and check_explicit_specialization does not reject
2192 Here, we can do better, as we are matching the specialization
2193 against the declarations. We count the number of template
2194 headers, and we check if they match TEMPLATE_COUNT + 1
2195 (TEMPLATE_COUNT is the number of qualifying template classes,
2196 plus there must be another header for the member template
2199 Notice that if header_count is zero, this is not a
2200 specialization but rather a template instantiation, so there
2201 is no check we can perform here. */
2202 if (header_count
&& header_count
!= template_count
+ 1)
2205 /* Check that the number of template arguments at the
2206 innermost level for DECL is the same as for FN. */
2207 if (current_binding_level
->kind
== sk_template_parms
2208 && !current_binding_level
->explicit_spec_p
2209 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
2210 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
2211 (current_template_parms
))))
2214 /* DECL might be a specialization of FN. */
2215 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2216 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
2218 /* For a non-static member function, we need to make sure
2219 that the const qualification is the same. Since
2220 get_bindings does not try to merge the "this" parameter,
2221 we must do the comparison explicitly. */
2222 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
2224 if (!same_type_p (TREE_VALUE (fn_arg_types
),
2225 TREE_VALUE (decl_arg_types
)))
2228 /* And the ref-qualification. */
2229 if (type_memfn_rqual (TREE_TYPE (decl
))
2230 != type_memfn_rqual (TREE_TYPE (fn
)))
2234 /* Skip the "this" parameter and, for constructors of
2235 classes with virtual bases, the VTT parameter. A
2236 full specialization of a constructor will have a VTT
2237 parameter, but a template never will. */
2239 = skip_artificial_parms_for (decl
, decl_arg_types
);
2241 = skip_artificial_parms_for (fn
, fn_arg_types
);
2243 /* Function templates cannot be specializations; there are
2244 no partial specializations of functions. Therefore, if
2245 the type of DECL does not match FN, there is no
2248 Note that it should never be the case that we have both
2249 candidates added here, and for regular member functions
2251 if (tsk
== tsk_template
)
2253 if (compparms (fn_arg_types
, decl_arg_types
))
2254 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2258 /* See whether this function might be a specialization of this
2259 template. Suppress access control because we might be trying
2260 to make this specialization a friend, and we have already done
2261 access control for the declaration of the specialization. */
2262 push_deferring_access_checks (dk_no_check
);
2263 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
2264 pop_deferring_access_checks ();
2267 /* We cannot deduce template arguments that when used to
2268 specialize TMPL will produce DECL. */
2271 if (uses_template_parms (targs
))
2272 /* We deduced something involving 'auto', which isn't a valid
2273 template argument. */
2276 /* Remove, from the set of candidates, all those functions
2277 whose constraints are not satisfied. */
2278 if (flag_concepts
&& !constraints_satisfied_p (fn
, targs
))
2281 // Then, try to form the new function type.
2282 insttype
= tsubst (TREE_TYPE (fn
), targs
, tf_fndecl_type
, NULL_TREE
);
2283 if (insttype
== error_mark_node
)
2286 = skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (insttype
));
2287 if (!compparms (fn_arg_types
, decl_arg_types
))
2290 /* Save this template, and the arguments deduced. */
2291 templates
= tree_cons (targs
, fn
, templates
);
2293 else if (need_member_template
)
2294 /* FN is an ordinary member function, and we need a
2295 specialization of a member template. */
2297 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
2298 /* We can get IDENTIFIER_NODEs here in certain erroneous
2301 else if (!DECL_FUNCTION_MEMBER_P (fn
))
2302 /* This is just an ordinary non-member function. Nothing can
2303 be a specialization of that. */
2305 else if (DECL_ARTIFICIAL (fn
))
2306 /* Cannot specialize functions that are created implicitly. */
2310 tree decl_arg_types
;
2312 /* This is an ordinary member function. However, since
2313 we're here, we can assume its enclosing class is a
2314 template class. For example,
2316 template <typename T> struct S { void f(); };
2317 template <> void S<int>::f() {}
2319 Here, S<int>::f is a non-template, but S<int> is a
2320 template class. If FN has the same type as DECL, we
2321 might be in business. */
2323 if (!DECL_TEMPLATE_INFO (fn
))
2324 /* Its enclosing class is an explicit specialization
2325 of a template class. This is not a candidate. */
2328 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
2329 TREE_TYPE (TREE_TYPE (fn
))))
2330 /* The return types differ. */
2333 /* Adjust the type of DECL in case FN is a static member. */
2334 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2335 if (DECL_STATIC_FUNCTION_P (fn
)
2336 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2337 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
2339 if (!compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
2343 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2344 && (type_memfn_rqual (TREE_TYPE (decl
))
2345 != type_memfn_rqual (TREE_TYPE (fn
))))
2348 // If the deduced arguments do not satisfy the constraints,
2349 // this is not a candidate.
2350 if (flag_concepts
&& !constraints_satisfied_p (fn
))
2353 // Add the candidate.
2354 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2358 if (templates
&& TREE_CHAIN (templates
))
2364 It is possible for a specialization with a given function
2365 signature to be instantiated from more than one function
2366 template. In such cases, explicit specification of the
2367 template arguments must be used to uniquely identify the
2368 function template specialization being specialized.
2370 Note that here, there's no suggestion that we're supposed to
2371 determine which of the candidate templates is most
2372 specialized. However, we, also have:
2376 Partial ordering of overloaded function template
2377 declarations is used in the following contexts to select
2378 the function template to which a function template
2379 specialization refers:
2381 -- when an explicit specialization refers to a function
2384 So, we do use the partial ordering rules, at least for now.
2385 This extension can only serve to make invalid programs valid,
2386 so it's safe. And, there is strong anecdotal evidence that
2387 the committee intended the partial ordering rules to apply;
2388 the EDG front end has that behavior, and John Spicer claims
2389 that the committee simply forgot to delete the wording in
2390 [temp.expl.spec]. */
2391 tree tmpl
= most_specialized_instantiation (templates
);
2392 if (tmpl
!= error_mark_node
)
2395 TREE_CHAIN (templates
) = NULL_TREE
;
2399 // Concepts allows multiple declarations of member functions
2400 // with the same signature. Like above, we need to rely on
2401 // on the partial ordering of those candidates to determine which
2403 if (flag_concepts
&& candidates
&& TREE_CHAIN (candidates
))
2405 if (tree cand
= most_constrained_function (candidates
))
2408 TREE_CHAIN (cand
) = NULL_TREE
;
2412 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
2414 error ("template-id %qD for %q+D does not match any template "
2415 "declaration", template_id
, decl
);
2416 if (header_count
&& header_count
!= template_count
+ 1)
2417 inform (input_location
, "saw %d %<template<>%>, need %d for "
2418 "specializing a member function template",
2419 header_count
, template_count
+ 1);
2421 print_candidates (orig_fns
);
2422 return error_mark_node
;
2424 else if ((templates
&& TREE_CHAIN (templates
))
2425 || (candidates
&& TREE_CHAIN (candidates
))
2426 || (templates
&& candidates
))
2428 error ("ambiguous template specialization %qD for %q+D",
2430 candidates
= chainon (candidates
, templates
);
2431 print_candidates (candidates
);
2432 return error_mark_node
;
2435 /* We have one, and exactly one, match. */
2438 tree fn
= TREE_VALUE (candidates
);
2439 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
2441 // Propagate the candidate's constraints to the declaration.
2442 set_constraints (decl
, get_constraints (fn
));
2444 /* DECL is a re-declaration or partial instantiation of a template
2446 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2448 /* It was a specialization of an ordinary member function in a
2450 return DECL_TI_TEMPLATE (fn
);
2453 /* It was a specialization of a template. */
2454 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
2455 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
2457 *targs_out
= copy_node (targs
);
2458 SET_TMPL_ARGS_LEVEL (*targs_out
,
2459 TMPL_ARGS_DEPTH (*targs_out
),
2460 TREE_PURPOSE (templates
));
2463 *targs_out
= TREE_PURPOSE (templates
);
2464 return TREE_VALUE (templates
);
2467 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2468 but with the default argument values filled in from those in the
2472 copy_default_args_to_explicit_spec_1 (tree spec_types
,
2475 tree new_spec_types
;
2480 if (spec_types
== void_list_node
)
2481 return void_list_node
;
2483 /* Substitute into the rest of the list. */
2485 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
2486 TREE_CHAIN (tmpl_types
));
2488 /* Add the default argument for this parameter. */
2489 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
2490 TREE_VALUE (spec_types
),
2494 /* DECL is an explicit specialization. Replicate default arguments
2495 from the template it specializes. (That way, code like:
2497 template <class T> void f(T = 3);
2498 template <> void f(double);
2501 works, as required.) An alternative approach would be to look up
2502 the correct default arguments at the call-site, but this approach
2503 is consistent with how implicit instantiations are handled. */
2506 copy_default_args_to_explicit_spec (tree decl
)
2511 tree new_spec_types
;
2515 tree object_type
= NULL_TREE
;
2516 tree in_charge
= NULL_TREE
;
2517 tree vtt
= NULL_TREE
;
2519 /* See if there's anything we need to do. */
2520 tmpl
= DECL_TI_TEMPLATE (decl
);
2521 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
2522 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
2523 if (TREE_PURPOSE (t
))
2528 old_type
= TREE_TYPE (decl
);
2529 spec_types
= TYPE_ARG_TYPES (old_type
);
2531 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2533 /* Remove the this pointer, but remember the object's type for
2535 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
2536 spec_types
= TREE_CHAIN (spec_types
);
2537 tmpl_types
= TREE_CHAIN (tmpl_types
);
2539 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
2541 /* DECL may contain more parameters than TMPL due to the extra
2542 in-charge parameter in constructors and destructors. */
2543 in_charge
= spec_types
;
2544 spec_types
= TREE_CHAIN (spec_types
);
2546 if (DECL_HAS_VTT_PARM_P (decl
))
2549 spec_types
= TREE_CHAIN (spec_types
);
2553 /* Compute the merged default arguments. */
2555 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
2557 /* Compute the new FUNCTION_TYPE. */
2561 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
2566 /* Put the in-charge parameter back. */
2567 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
2568 TREE_VALUE (in_charge
),
2571 new_type
= build_method_type_directly (object_type
,
2572 TREE_TYPE (old_type
),
2576 new_type
= build_function_type (TREE_TYPE (old_type
),
2578 new_type
= cp_build_type_attribute_variant (new_type
,
2579 TYPE_ATTRIBUTES (old_type
));
2580 new_type
= cxx_copy_lang_qualifiers (new_type
, old_type
);
2582 TREE_TYPE (decl
) = new_type
;
2585 /* Return the number of template headers we expect to see for a definition
2586 or specialization of CTYPE or one of its non-template members. */
2589 num_template_headers_for_class (tree ctype
)
2591 int num_templates
= 0;
2593 while (ctype
&& CLASS_TYPE_P (ctype
))
2595 /* You're supposed to have one `template <...>' for every
2596 template class, but you don't need one for a full
2597 specialization. For example:
2599 template <class T> struct S{};
2600 template <> struct S<int> { void f(); };
2601 void S<int>::f () {}
2603 is correct; there shouldn't be a `template <>' for the
2604 definition of `S<int>::f'. */
2605 if (!CLASSTYPE_TEMPLATE_INFO (ctype
))
2606 /* If CTYPE does not have template information of any
2607 kind, then it is not a template, nor is it nested
2608 within a template. */
2610 if (explicit_class_specialization_p (ctype
))
2612 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (ctype
)))
2615 ctype
= TYPE_CONTEXT (ctype
);
2618 return num_templates
;
2621 /* Do a simple sanity check on the template headers that precede the
2622 variable declaration DECL. */
2625 check_template_variable (tree decl
)
2627 tree ctx
= CP_DECL_CONTEXT (decl
);
2628 int wanted
= num_template_headers_for_class (ctx
);
2629 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
2630 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
2632 if (cxx_dialect
< cxx14
)
2633 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2634 "variable templates only available with "
2635 "%<-std=c++14%> or %<-std=gnu++14%>");
2637 // Namespace-scope variable templates should have a template header.
2640 if (template_header_count
> wanted
)
2642 auto_diagnostic_group d
;
2643 bool warned
= pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2644 "too many template headers for %qD "
2647 if (warned
&& CLASS_TYPE_P (ctx
)
2648 && CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2649 inform (DECL_SOURCE_LOCATION (decl
),
2650 "members of an explicitly specialized class are defined "
2651 "without a template header");
2655 /* An explicit specialization whose declarator-id or class-head-name is not
2656 qualified shall be declared in the nearest enclosing namespace of the
2657 template, or, if the namespace is inline (7.3.1), any namespace from its
2658 enclosing namespace set.
2660 If the name declared in the explicit instantiation is an unqualified name,
2661 the explicit instantiation shall appear in the namespace where its template
2662 is declared or, if that namespace is inline (7.3.1), any namespace from its
2663 enclosing namespace set. */
2666 check_unqualified_spec_or_inst (tree t
, location_t loc
)
2668 tree tmpl
= most_general_template (t
);
2669 if (DECL_NAMESPACE_SCOPE_P (tmpl
)
2670 && !is_nested_namespace (current_namespace
,
2671 CP_DECL_CONTEXT (tmpl
), true))
2673 if (processing_specialization
)
2674 permerror (loc
, "explicit specialization of %qD outside its "
2675 "namespace must use a nested-name-specifier", tmpl
);
2676 else if (processing_explicit_instantiation
2677 && cxx_dialect
>= cxx11
)
2678 /* This was allowed in C++98, so only pedwarn. */
2679 pedwarn (loc
, OPT_Wpedantic
, "explicit instantiation of %qD "
2680 "outside its namespace must use a nested-name-"
2685 /* Warn for a template specialization SPEC that is missing some of a set
2686 of function or type attributes that the template TEMPL is declared with.
2687 ATTRLIST is a list of additional attributes that SPEC should be taken
2688 to ultimately be declared with. */
2691 warn_spec_missing_attributes (tree tmpl
, tree spec
, tree attrlist
)
2693 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
2694 tmpl
= DECL_TEMPLATE_RESULT (tmpl
);
2696 /* Avoid warning if the difference between the primary and
2697 the specialization is not in one of the attributes below. */
2698 const char* const blacklist
[] = {
2699 "alloc_align", "alloc_size", "assume_aligned", "format",
2700 "format_arg", "malloc", "nonnull", NULL
2703 /* Put together a list of the black listed attributes that the primary
2704 template is declared with that the specialization is not, in case
2705 it's not apparent from the most recent declaration of the primary. */
2707 unsigned nattrs
= decls_mismatched_attributes (tmpl
, spec
, attrlist
,
2713 auto_diagnostic_group d
;
2714 if (warning_at (DECL_SOURCE_LOCATION (spec
), OPT_Wmissing_attributes
,
2715 "explicit specialization %q#D may be missing attributes",
2717 inform (DECL_SOURCE_LOCATION (tmpl
),
2719 ? G_("missing primary template attributes %s")
2720 : G_("missing primary template attribute %s"),
2721 pp_formatted_text (&str
));
2724 /* Check to see if the function just declared, as indicated in
2725 DECLARATOR, and in DECL, is a specialization of a function
2726 template. We may also discover that the declaration is an explicit
2727 instantiation at this point.
2729 Returns DECL, or an equivalent declaration that should be used
2730 instead if all goes well. Issues an error message if something is
2731 amiss. Returns error_mark_node if the error is not easily
2734 FLAGS is a bitmask consisting of the following flags:
2736 2: The function has a definition.
2737 4: The function is a friend.
2739 The TEMPLATE_COUNT is the number of references to qualifying
2740 template classes that appeared in the name of the function. For
2743 template <class T> struct S { void f(); };
2746 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2747 classes are not counted in the TEMPLATE_COUNT, so that in
2749 template <class T> struct S {};
2750 template <> struct S<int> { void f(); }
2751 template <> void S<int>::f();
2753 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2754 invalid; there should be no template <>.)
2756 If the function is a specialization, it is marked as such via
2757 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2758 is set up correctly, and it is added to the list of specializations
2759 for that template. */
2762 check_explicit_specialization (tree declarator
,
2768 int have_def
= flags
& 2;
2769 int is_friend
= flags
& 4;
2770 bool is_concept
= flags
& 8;
2771 int specialization
= 0;
2772 int explicit_instantiation
= 0;
2773 int member_specialization
= 0;
2774 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2775 tree dname
= DECL_NAME (decl
);
2780 if (!processing_specialization
)
2783 tsk
= tsk_excessive_parms
;
2786 tsk
= current_tmpl_spec_kind (template_count
);
2791 if (processing_specialization
&& !VAR_P (decl
))
2794 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2796 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2799 /* This could be something like:
2801 template <class T> void f(T);
2802 class S { friend void f<>(int); } */
2806 /* This case handles bogus declarations like template <>
2807 template <class T> void f<int>(); */
2809 error ("template-id %qD in declaration of primary template",
2816 case tsk_invalid_member_spec
:
2817 /* The error has already been reported in
2818 check_specialization_scope. */
2819 return error_mark_node
;
2821 case tsk_invalid_expl_inst
:
2822 error ("template parameter list used in explicit instantiation");
2828 error ("definition provided for explicit instantiation");
2830 explicit_instantiation
= 1;
2833 case tsk_excessive_parms
:
2834 case tsk_insufficient_parms
:
2835 if (tsk
== tsk_excessive_parms
)
2836 error ("too many template parameter lists in declaration of %qD",
2838 else if (template_header_count
)
2839 error("too few template parameter lists in declaration of %qD", decl
);
2841 error("explicit specialization of %qD must be introduced by "
2842 "%<template <>%>", decl
);
2847 error ("explicit specialization declared %<concept%>");
2849 if (VAR_P (decl
) && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2850 /* In cases like template<> constexpr bool v = true;
2851 We'll give an error in check_template_variable. */
2854 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2856 member_specialization
= 1;
2862 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2864 /* This case handles bogus declarations like template <>
2865 template <class T> void f<int>(); */
2867 if (!uses_template_parms (TREE_OPERAND (declarator
, 1)))
2868 error ("template-id %qD in declaration of primary template",
2870 else if (variable_template_p (TREE_OPERAND (declarator
, 0)))
2872 /* Partial specialization of variable template. */
2873 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2877 else if (cxx_dialect
< cxx14
)
2878 error ("non-type partial specialization %qD "
2879 "is not allowed", declarator
);
2881 error ("non-class, non-variable partial specialization %qD "
2882 "is not allowed", declarator
);
2887 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2888 /* This is a specialization of a member template, without
2889 specialization the containing class. Something like:
2891 template <class T> struct S {
2892 template <class U> void f (U);
2894 template <> template <class U> void S<int>::f(U) {}
2896 That's a specialization -- but of the entire template. */
2904 if ((specialization
|| member_specialization
)
2905 /* This doesn't apply to variable templates. */
2906 && FUNC_OR_METHOD_TYPE_P (TREE_TYPE (decl
)))
2908 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2909 for (; t
; t
= TREE_CHAIN (t
))
2910 if (TREE_PURPOSE (t
))
2912 permerror (input_location
,
2913 "default argument specified in explicit specialization");
2918 if (specialization
|| member_specialization
|| explicit_instantiation
)
2920 tree tmpl
= NULL_TREE
;
2921 tree targs
= NULL_TREE
;
2922 bool was_template_id
= (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
);
2924 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2925 if (!was_template_id
)
2929 gcc_assert (identifier_p (declarator
));
2934 /* If there is no class context, the explicit instantiation
2935 must be at namespace scope. */
2936 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2938 /* Find the namespace binding, using the declaration
2940 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2942 if (fns
== error_mark_node
)
2943 /* If lookup fails, look for a friend declaration so we can
2944 give a better diagnostic. */
2945 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2946 /*type*/false, /*complain*/true,
2949 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2951 error ("%qD is not a template function", dname
);
2952 fns
= error_mark_node
;
2956 declarator
= lookup_template_function (fns
, NULL_TREE
);
2959 if (declarator
== error_mark_node
)
2960 return error_mark_node
;
2962 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2964 if (!explicit_instantiation
)
2965 /* A specialization in class scope. This is invalid,
2966 but the error will already have been flagged by
2967 check_specialization_scope. */
2968 return error_mark_node
;
2971 /* It's not valid to write an explicit instantiation in
2974 class C { template void f(); }
2976 This case is caught by the parser. However, on
2979 template class C { void f(); };
2981 (which is invalid) we can get here. The error will be
2988 else if (ctype
!= NULL_TREE
2989 && (identifier_p (TREE_OPERAND (declarator
, 0))))
2991 // We'll match variable templates in start_decl.
2995 /* Find the list of functions in ctype that have the same
2996 name as the declared function. */
2997 tree name
= TREE_OPERAND (declarator
, 0);
2999 if (constructor_name_p (name
, ctype
))
3001 if (DECL_CONSTRUCTOR_P (decl
)
3002 ? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
3003 : !CLASSTYPE_DESTRUCTOR (ctype
))
3005 /* From [temp.expl.spec]:
3007 If such an explicit specialization for the member
3008 of a class template names an implicitly-declared
3009 special member function (clause _special_), the
3010 program is ill-formed.
3012 Similar language is found in [temp.explicit]. */
3013 error ("specialization of implicitly-declared special member function");
3014 return error_mark_node
;
3017 name
= DECL_NAME (decl
);
3020 /* For a type-conversion operator, We might be looking for
3021 `operator int' which will be a specialization of
3022 `operator T'. Grab all the conversion operators, and
3023 then select from them. */
3024 tree fns
= get_class_binding (ctype
, IDENTIFIER_CONV_OP_P (name
)
3025 ? conv_op_identifier
: name
);
3027 if (fns
== NULL_TREE
)
3029 error ("no member function %qD declared in %qT", name
, ctype
);
3030 return error_mark_node
;
3033 TREE_OPERAND (declarator
, 0) = fns
;
3036 /* Figure out what exactly is being specialized at this point.
3037 Note that for an explicit instantiation, even one for a
3038 member function, we cannot tell a priori whether the
3039 instantiation is for a member template, or just a member
3040 function of a template class. Even if a member template is
3041 being instantiated, the member template arguments may be
3042 elided if they can be deduced from the rest of the
3044 tmpl
= determine_specialization (declarator
, decl
,
3046 member_specialization
,
3050 if (!tmpl
|| tmpl
== error_mark_node
)
3051 /* We couldn't figure out what this declaration was
3053 return error_mark_node
;
3056 if (TREE_CODE (decl
) == FUNCTION_DECL
3057 && DECL_HIDDEN_FRIEND_P (tmpl
))
3059 auto_diagnostic_group d
;
3060 if (pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
3061 "friend declaration %qD is not visible to "
3062 "explicit specialization", tmpl
))
3063 inform (DECL_SOURCE_LOCATION (tmpl
),
3064 "friend declaration here");
3066 else if (!ctype
&& !is_friend
3067 && CP_DECL_CONTEXT (decl
) == current_namespace
)
3068 check_unqualified_spec_or_inst (tmpl
, DECL_SOURCE_LOCATION (decl
));
3070 tree gen_tmpl
= most_general_template (tmpl
);
3072 if (explicit_instantiation
)
3074 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
3075 is done by do_decl_instantiation later. */
3077 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
3078 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
3080 if (arg_depth
> parm_depth
)
3082 /* If TMPL is not the most general template (for
3083 example, if TMPL is a friend template that is
3084 injected into namespace scope), then there will
3085 be too many levels of TARGS. Remove some of them
3090 new_targs
= make_tree_vec (parm_depth
);
3091 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
3092 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
3093 = TREE_VEC_ELT (targs
, i
);
3097 return instantiate_template (tmpl
, targs
, tf_error
);
3100 /* If we thought that the DECL was a member function, but it
3101 turns out to be specializing a static member function,
3102 make DECL a static member function as well. */
3103 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
3104 && DECL_STATIC_FUNCTION_P (tmpl
)
3105 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
3106 revert_static_member_fn (decl
);
3108 /* If this is a specialization of a member template of a
3109 template class, we want to return the TEMPLATE_DECL, not
3110 the specialization of it. */
3111 if (tsk
== tsk_template
&& !was_template_id
)
3113 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
3114 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
3115 DECL_INITIAL (result
) = NULL_TREE
;
3119 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
3120 DECL_SOURCE_LOCATION (result
)
3121 = DECL_SOURCE_LOCATION (decl
);
3122 /* We want to use the argument list specified in the
3123 definition, not in the original declaration. */
3124 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
3125 for (parm
= DECL_ARGUMENTS (result
); parm
;
3126 parm
= DECL_CHAIN (parm
))
3127 DECL_CONTEXT (parm
) = result
;
3129 return register_specialization (tmpl
, gen_tmpl
, targs
,
3133 /* Set up the DECL_TEMPLATE_INFO for DECL. */
3134 DECL_TEMPLATE_INFO (decl
) = build_template_info (tmpl
, targs
);
3136 if (was_template_id
)
3137 TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
)) = true;
3139 /* Inherit default function arguments from the template
3140 DECL is specializing. */
3141 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
3142 copy_default_args_to_explicit_spec (decl
);
3144 /* This specialization has the same protection as the
3145 template it specializes. */
3146 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
3147 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
3149 /* 7.1.1-1 [dcl.stc]
3151 A storage-class-specifier shall not be specified in an
3152 explicit specialization...
3154 The parser rejects these, so unless action is taken here,
3155 explicit function specializations will always appear with
3158 The action recommended by the C++ CWG in response to C++
3159 defect report 605 is to make the storage class and linkage
3160 of the explicit specialization match the templated function:
3162 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
3164 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
3166 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
3167 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
3169 /* A concept cannot be specialized. */
3170 if (DECL_DECLARED_CONCEPT_P (tmpl_func
))
3172 error ("explicit specialization of function concept %qD",
3174 return error_mark_node
;
3177 /* This specialization has the same linkage and visibility as
3178 the function template it specializes. */
3179 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
3180 if (! TREE_PUBLIC (decl
))
3182 DECL_INTERFACE_KNOWN (decl
) = 1;
3183 DECL_NOT_REALLY_EXTERN (decl
) = 1;
3185 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
3186 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
3188 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
3189 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
3193 /* If DECL is a friend declaration, declared using an
3194 unqualified name, the namespace associated with DECL may
3195 have been set incorrectly. For example, in:
3197 template <typename T> void f(T);
3199 struct S { friend void f<int>(int); }
3202 we will have set the DECL_CONTEXT for the friend
3203 declaration to N, rather than to the global namespace. */
3204 if (DECL_NAMESPACE_SCOPE_P (decl
))
3205 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
3207 if (is_friend
&& !have_def
)
3208 /* This is not really a declaration of a specialization.
3209 It's just the name of an instantiation. But, it's not
3210 a request for an instantiation, either. */
3211 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
3212 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
3213 /* A specialization is not necessarily COMDAT. */
3214 DECL_COMDAT (decl
) = (TREE_PUBLIC (decl
)
3215 && DECL_DECLARED_INLINE_P (decl
));
3216 else if (VAR_P (decl
))
3217 DECL_COMDAT (decl
) = false;
3219 /* If this is a full specialization, register it so that we can find
3220 it again. Partial specializations will be registered in
3221 process_partial_specialization. */
3222 if (!processing_template_decl
)
3224 warn_spec_missing_attributes (gen_tmpl
, decl
, attrlist
);
3226 decl
= register_specialization (decl
, gen_tmpl
, targs
,
3231 /* A 'structor should already have clones. */
3232 gcc_assert (decl
== error_mark_node
3233 || variable_template_p (tmpl
)
3234 || !(DECL_CONSTRUCTOR_P (decl
)
3235 || DECL_DESTRUCTOR_P (decl
))
3236 || DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)));
3243 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
3244 parameters. These are represented in the same format used for
3245 DECL_TEMPLATE_PARMS. */
3248 comp_template_parms (const_tree parms1
, const_tree parms2
)
3253 if (parms1
== parms2
)
3256 for (p1
= parms1
, p2
= parms2
;
3257 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
3258 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
3260 tree t1
= TREE_VALUE (p1
);
3261 tree t2
= TREE_VALUE (p2
);
3264 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
3265 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
3267 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
3270 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
3272 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
3273 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
3275 /* If either of the template parameters are invalid, assume
3276 they match for the sake of error recovery. */
3277 if (error_operand_p (parm1
) || error_operand_p (parm2
))
3280 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
3283 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
3284 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
3285 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
3287 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
3292 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
3293 /* One set of parameters has more parameters lists than the
3300 /* Determine whether PARM is a parameter pack. */
3303 template_parameter_pack_p (const_tree parm
)
3305 /* Determine if we have a non-type template parameter pack. */
3306 if (TREE_CODE (parm
) == PARM_DECL
)
3307 return (DECL_TEMPLATE_PARM_P (parm
)
3308 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
3309 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
3310 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
3312 /* If this is a list of template parameters, we could get a
3313 TYPE_DECL or a TEMPLATE_DECL. */
3314 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
3315 parm
= TREE_TYPE (parm
);
3317 /* Otherwise it must be a type template parameter. */
3318 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
3319 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
3320 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
3323 /* Determine if T is a function parameter pack. */
3326 function_parameter_pack_p (const_tree t
)
3328 if (t
&& TREE_CODE (t
) == PARM_DECL
)
3329 return DECL_PACK_P (t
);
3333 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
3334 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
3337 get_function_template_decl (const_tree primary_func_tmpl_inst
)
3339 if (! primary_func_tmpl_inst
3340 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
3341 || ! primary_template_specialization_p (primary_func_tmpl_inst
))
3344 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
3347 /* Return true iff the function parameter PARAM_DECL was expanded
3348 from the function parameter pack PACK. */
3351 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
3353 if (DECL_ARTIFICIAL (param_decl
)
3354 || !function_parameter_pack_p (pack
))
3357 /* The parameter pack and its pack arguments have the same
3359 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
3362 /* Determine whether ARGS describes a variadic template args list,
3363 i.e., one that is terminated by a template argument pack. */
3366 template_args_variadic_p (tree args
)
3371 if (args
== NULL_TREE
)
3374 args
= INNERMOST_TEMPLATE_ARGS (args
);
3375 nargs
= TREE_VEC_LENGTH (args
);
3380 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
3382 return ARGUMENT_PACK_P (last_parm
);
3385 /* Generate a new name for the parameter pack name NAME (an
3386 IDENTIFIER_NODE) that incorporates its */
3389 make_ith_pack_parameter_name (tree name
, int i
)
3391 /* Munge the name to include the parameter index. */
3392 #define NUMBUF_LEN 128
3393 char numbuf
[NUMBUF_LEN
];
3397 if (name
== NULL_TREE
)
3399 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
3400 newname_len
= IDENTIFIER_LENGTH (name
)
3401 + strlen (numbuf
) + 2;
3402 newname
= (char*)alloca (newname_len
);
3403 snprintf (newname
, newname_len
,
3404 "%s#%i", IDENTIFIER_POINTER (name
), i
);
3405 return get_identifier (newname
);
3408 /* Return true if T is a primary function, class or alias template
3409 specialization, not including the template pattern. */
3412 primary_template_specialization_p (const_tree t
)
3417 if (TREE_CODE (t
) == FUNCTION_DECL
|| VAR_P (t
))
3418 return (DECL_LANG_SPECIFIC (t
)
3419 && DECL_USE_TEMPLATE (t
)
3420 && DECL_TEMPLATE_INFO (t
)
3421 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
)));
3422 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
3423 return (CLASSTYPE_TEMPLATE_INFO (t
)
3424 && CLASSTYPE_USE_TEMPLATE (t
)
3425 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
)));
3426 else if (alias_template_specialization_p (t
))
3431 /* Return true if PARM is a template template parameter. */
3434 template_template_parameter_p (const_tree parm
)
3436 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
3439 /* Return true iff PARM is a DECL representing a type template
3443 template_type_parameter_p (const_tree parm
)
3446 && (TREE_CODE (parm
) == TYPE_DECL
3447 || TREE_CODE (parm
) == TEMPLATE_DECL
)
3448 && DECL_TEMPLATE_PARM_P (parm
));
3451 /* Return the template parameters of T if T is a
3452 primary template instantiation, NULL otherwise. */
3455 get_primary_template_innermost_parameters (const_tree t
)
3457 tree parms
= NULL
, template_info
= NULL
;
3459 if ((template_info
= get_template_info (t
))
3460 && primary_template_specialization_p (t
))
3461 parms
= INNERMOST_TEMPLATE_PARMS
3462 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
3467 /* Return the template parameters of the LEVELth level from the full list
3468 of template parameters PARMS. */
3471 get_template_parms_at_level (tree parms
, int level
)
3475 || TREE_CODE (parms
) != TREE_LIST
3476 || level
> TMPL_PARMS_DEPTH (parms
))
3479 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
3480 if (TMPL_PARMS_DEPTH (p
) == level
)
3486 /* Returns the template arguments of T if T is a template instantiation,
3490 get_template_innermost_arguments (const_tree t
)
3492 tree args
= NULL
, template_info
= NULL
;
3494 if ((template_info
= get_template_info (t
))
3495 && TI_ARGS (template_info
))
3496 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
3501 /* Return the argument pack elements of T if T is a template argument pack,
3505 get_template_argument_pack_elems (const_tree t
)
3507 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
3508 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
3511 return ARGUMENT_PACK_ARGS (t
);
3514 /* In an ARGUMENT_PACK_SELECT, the actual underlying argument that the
3515 ARGUMENT_PACK_SELECT represents. */
3518 argument_pack_select_arg (tree t
)
3520 tree args
= ARGUMENT_PACK_ARGS (ARGUMENT_PACK_SELECT_FROM_PACK (t
));
3521 tree arg
= TREE_VEC_ELT (args
, ARGUMENT_PACK_SELECT_INDEX (t
));
3523 /* If the selected argument is an expansion E, that most likely means we were
3524 called from gen_elem_of_pack_expansion_instantiation during the
3525 substituting of an argument pack (of which the Ith element is a pack
3526 expansion, where I is ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
3527 In this case, the Ith element resulting from this substituting is going to
3528 be a pack expansion, which pattern is the pattern of E. Let's return the
3529 pattern of E, and gen_elem_of_pack_expansion_instantiation will build the
3530 resulting pack expansion from it. */
3531 if (PACK_EXPANSION_P (arg
))
3533 /* Make sure we aren't throwing away arg info. */
3534 gcc_assert (!PACK_EXPANSION_EXTRA_ARGS (arg
));
3535 arg
= PACK_EXPANSION_PATTERN (arg
);
3542 /* True iff FN is a function representing a built-in variadic parameter
3546 builtin_pack_fn_p (tree fn
)
3549 || TREE_CODE (fn
) != FUNCTION_DECL
3550 || !DECL_IS_BUILTIN (fn
))
3553 if (id_equal (DECL_NAME (fn
), "__integer_pack"))
3559 /* True iff CALL is a call to a function representing a built-in variadic
3563 builtin_pack_call_p (tree call
)
3565 if (TREE_CODE (call
) != CALL_EXPR
)
3567 return builtin_pack_fn_p (CALL_EXPR_FN (call
));
3570 /* Return a TREE_VEC for the expansion of __integer_pack(HI). */
3573 expand_integer_pack (tree call
, tree args
, tsubst_flags_t complain
,
3576 tree ohi
= CALL_EXPR_ARG (call
, 0);
3577 tree hi
= tsubst_copy_and_build (ohi
, args
, complain
, in_decl
,
3578 false/*fn*/, true/*int_cst*/);
3580 if (value_dependent_expression_p (hi
))
3584 call
= copy_node (call
);
3585 CALL_EXPR_ARG (call
, 0) = hi
;
3587 tree ex
= make_pack_expansion (call
, complain
);
3588 tree vec
= make_tree_vec (1);
3589 TREE_VEC_ELT (vec
, 0) = ex
;
3594 hi
= cxx_constant_value (hi
);
3595 int len
= valid_constant_size_p (hi
) ? tree_to_shwi (hi
) : -1;
3597 /* Calculate the largest value of len that won't make the size of the vec
3598 overflow an int. The compiler will exceed resource limits long before
3599 this, but it seems a decent place to diagnose. */
3600 int max
= ((INT_MAX
- sizeof (tree_vec
)) / sizeof (tree
)) + 1;
3602 if (len
< 0 || len
> max
)
3604 if ((complain
& tf_error
)
3605 && hi
!= error_mark_node
)
3606 error ("argument to %<__integer_pack%> must be between 0 and %d",
3608 return error_mark_node
;
3611 tree vec
= make_tree_vec (len
);
3613 for (int i
= 0; i
< len
; ++i
)
3614 TREE_VEC_ELT (vec
, i
) = size_int (i
);
3620 /* Return a TREE_VEC for the expansion of built-in template parameter pack
3624 expand_builtin_pack_call (tree call
, tree args
, tsubst_flags_t complain
,
3627 if (!builtin_pack_call_p (call
))
3630 tree fn
= CALL_EXPR_FN (call
);
3632 if (id_equal (DECL_NAME (fn
), "__integer_pack"))
3633 return expand_integer_pack (call
, args
, complain
, in_decl
);
3638 /* Structure used to track the progress of find_parameter_packs_r. */
3639 struct find_parameter_pack_data
3641 /* TREE_LIST that will contain all of the parameter packs found by
3643 tree
* parameter_packs
;
3645 /* Set of AST nodes that have been visited by the traversal. */
3646 hash_set
<tree
> *visited
;
3648 /* True iff we're making a type pack expansion. */
3649 bool type_pack_expansion_p
;
3652 /* Identifies all of the argument packs that occur in a template
3653 argument and appends them to the TREE_LIST inside DATA, which is a
3654 find_parameter_pack_data structure. This is a subroutine of
3655 make_pack_expansion and uses_parameter_packs. */
3657 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3660 struct find_parameter_pack_data
* ppd
=
3661 (struct find_parameter_pack_data
*)data
;
3662 bool parameter_pack_p
= false;
3664 /* Handle type aliases/typedefs. */
3665 if (TYPE_ALIAS_P (t
))
3667 if (tree tinfo
= TYPE_ALIAS_TEMPLATE_INFO (t
))
3668 cp_walk_tree (&TI_ARGS (tinfo
),
3669 &find_parameter_packs_r
,
3675 /* Identify whether this is a parameter pack or not. */
3676 switch (TREE_CODE (t
))
3678 case TEMPLATE_PARM_INDEX
:
3679 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3680 parameter_pack_p
= true;
3683 case TEMPLATE_TYPE_PARM
:
3684 t
= TYPE_MAIN_VARIANT (t
);
3686 case TEMPLATE_TEMPLATE_PARM
:
3687 /* If the placeholder appears in the decl-specifier-seq of a function
3688 parameter pack (14.6.3), or the type-specifier-seq of a type-id that
3689 is a pack expansion, the invented template parameter is a template
3691 if (ppd
->type_pack_expansion_p
&& is_auto (t
))
3692 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
3693 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3694 parameter_pack_p
= true;
3699 if (DECL_PACK_P (t
))
3701 /* We don't want to walk into the type of a PARM_DECL,
3702 because we don't want to see the type parameter pack. */
3704 parameter_pack_p
= true;
3709 if (DECL_PACK_P (t
))
3711 /* We don't want to walk into the type of a variadic capture proxy,
3712 because we don't want to see the type parameter pack. */
3714 parameter_pack_p
= true;
3716 else if (variable_template_specialization_p (t
))
3718 cp_walk_tree (&DECL_TI_ARGS (t
),
3719 find_parameter_packs_r
,
3726 if (builtin_pack_call_p (t
))
3727 parameter_pack_p
= true;
3731 parameter_pack_p
= true;
3734 /* Not a parameter pack. */
3738 if (parameter_pack_p
)
3740 /* Add this parameter pack to the list. */
3741 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3745 cp_walk_tree (&TYPE_CONTEXT (t
),
3746 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3748 /* This switch statement will return immediately if we don't find a
3750 switch (TREE_CODE (t
))
3752 case TEMPLATE_PARM_INDEX
:
3755 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3756 /* Check the template itself. */
3757 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3758 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3759 /* Check the template arguments. */
3760 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3765 case TEMPLATE_TYPE_PARM
:
3766 case TEMPLATE_TEMPLATE_PARM
:
3773 /* Ignore the declaration of a capture proxy for a parameter pack. */
3774 if (is_capture_proxy (DECL_EXPR_DECL (t
)))
3779 if (TYPE_PTRMEMFUNC_P (t
))
3785 if (TYPE_TEMPLATE_INFO (t
))
3786 cp_walk_tree (&TYPE_TI_ARGS (t
),
3787 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3793 if (!DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
3798 cp_walk_tree (&TREE_TYPE (t
),
3799 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3803 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3808 case TYPE_PACK_EXPANSION
:
3809 case EXPR_PACK_EXPANSION
:
3814 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3819 case IDENTIFIER_NODE
:
3820 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3827 /* Look at explicit captures. */
3828 for (tree cap
= LAMBDA_EXPR_CAPTURE_LIST (t
);
3829 cap
; cap
= TREE_CHAIN (cap
))
3830 cp_walk_tree (&TREE_VALUE (cap
), &find_parameter_packs_r
, ppd
,
3832 /* Since we defer implicit capture, look in the parms and body. */
3833 tree fn
= lambda_function (t
);
3834 cp_walk_tree (&TREE_TYPE (fn
), &find_parameter_packs_r
, ppd
,
3836 cp_walk_tree (&DECL_SAVED_TREE (fn
), &find_parameter_packs_r
, ppd
,
3844 /* When traversing a DECLTYPE_TYPE_EXPR, we need to set
3845 type_pack_expansion_p to false so that any placeholders
3846 within the expression don't get marked as parameter packs. */
3847 bool type_pack_expansion_p
= ppd
->type_pack_expansion_p
;
3848 ppd
->type_pack_expansion_p
= false;
3849 cp_walk_tree (&DECLTYPE_TYPE_EXPR (t
), &find_parameter_packs_r
,
3851 ppd
->type_pack_expansion_p
= type_pack_expansion_p
;
3857 cp_walk_tree (&IF_COND (t
), &find_parameter_packs_r
,
3859 cp_walk_tree (&THEN_CLAUSE (t
), &find_parameter_packs_r
,
3861 cp_walk_tree (&ELSE_CLAUSE (t
), &find_parameter_packs_r
,
3863 /* Don't walk into IF_STMT_EXTRA_ARGS. */
3874 /* Determines if the expression or type T uses any parameter packs. */
3876 uses_parameter_packs (tree t
)
3878 tree parameter_packs
= NULL_TREE
;
3879 struct find_parameter_pack_data ppd
;
3880 ppd
.parameter_packs
= ¶meter_packs
;
3881 ppd
.visited
= new hash_set
<tree
>;
3882 ppd
.type_pack_expansion_p
= false;
3883 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3885 return parameter_packs
;
3888 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3889 representation a base-class initializer into a parameter pack
3890 expansion. If all goes well, the resulting node will be an
3891 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3894 make_pack_expansion (tree arg
, tsubst_flags_t complain
)
3897 tree parameter_packs
= NULL_TREE
;
3898 bool for_types
= false;
3899 struct find_parameter_pack_data ppd
;
3901 if (!arg
|| arg
== error_mark_node
)
3904 if (TREE_CODE (arg
) == TREE_LIST
&& TREE_PURPOSE (arg
))
3906 /* A TREE_LIST with a non-null TREE_PURPOSE is for a base
3907 class initializer. In this case, the TREE_PURPOSE will be a
3908 _TYPE node (representing the base class expansion we're
3909 initializing) and the TREE_VALUE will be a TREE_LIST
3910 containing the initialization arguments.
3912 The resulting expansion looks somewhat different from most
3913 expansions. Rather than returning just one _EXPANSION, we
3914 return a TREE_LIST whose TREE_PURPOSE is a
3915 TYPE_PACK_EXPANSION containing the bases that will be
3916 initialized. The TREE_VALUE will be identical to the
3917 original TREE_VALUE, which is a list of arguments that will
3918 be passed to each base. We do not introduce any new pack
3919 expansion nodes into the TREE_VALUE (although it is possible
3920 that some already exist), because the TREE_PURPOSE and
3921 TREE_VALUE all need to be expanded together with the same
3922 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3923 resulting TREE_PURPOSE will mention the parameter packs in
3924 both the bases and the arguments to the bases. */
3927 tree parameter_packs
= NULL_TREE
;
3929 /* Determine which parameter packs will be used by the base
3931 ppd
.visited
= new hash_set
<tree
>;
3932 ppd
.parameter_packs
= ¶meter_packs
;
3933 ppd
.type_pack_expansion_p
= false;
3934 gcc_assert (TYPE_P (TREE_PURPOSE (arg
)));
3935 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3938 if (parameter_packs
== NULL_TREE
)
3940 if (complain
& tf_error
)
3941 error ("base initializer expansion %qT contains no parameter packs",
3944 return error_mark_node
;
3947 if (TREE_VALUE (arg
) != void_type_node
)
3949 /* Collect the sets of parameter packs used in each of the
3950 initialization arguments. */
3951 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3953 /* Determine which parameter packs will be expanded in this
3955 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3962 /* Create the pack expansion type for the base type. */
3963 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3964 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3965 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3966 PACK_EXPANSION_LOCAL_P (purpose
) = at_function_scope_p ();
3968 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3969 they will rarely be compared to anything. */
3970 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3972 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3975 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3978 /* Build the PACK_EXPANSION_* node. */
3980 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3981 : make_node (EXPR_PACK_EXPANSION
);
3982 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3983 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3985 /* Propagate type and const-expression information. */
3986 TREE_TYPE (result
) = TREE_TYPE (arg
);
3987 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3988 /* Mark this read now, since the expansion might be length 0. */
3989 mark_exp_read (arg
);
3992 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3993 they will rarely be compared to anything. */
3994 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3996 /* Determine which parameter packs will be expanded. */
3997 ppd
.parameter_packs
= ¶meter_packs
;
3998 ppd
.visited
= new hash_set
<tree
>;
3999 ppd
.type_pack_expansion_p
= TYPE_P (arg
);
4000 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
4003 /* Make sure we found some parameter packs. */
4004 if (parameter_packs
== NULL_TREE
)
4006 if (complain
& tf_error
)
4009 error ("expansion pattern %qT contains no parameter packs", arg
);
4011 error ("expansion pattern %qE contains no parameter packs", arg
);
4013 return error_mark_node
;
4015 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
4017 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
4022 /* Checks T for any "bare" parameter packs, which have not yet been
4023 expanded, and issues an error if any are found. This operation can
4024 only be done on full expressions or types (e.g., an expression
4025 statement, "if" condition, etc.), because we could have expressions like:
4027 foo(f(g(h(args)))...)
4029 where "args" is a parameter pack. check_for_bare_parameter_packs
4030 should not be called for the subexpressions args, h(args),
4031 g(h(args)), or f(g(h(args))), because we would produce erroneous
4034 Returns TRUE and emits an error if there were bare parameter packs,
4035 returns FALSE otherwise. */
4037 check_for_bare_parameter_packs (tree t
, location_t loc
/* = UNKNOWN_LOCATION */)
4039 tree parameter_packs
= NULL_TREE
;
4040 struct find_parameter_pack_data ppd
;
4042 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
4045 /* A lambda might use a parameter pack from the containing context. */
4046 if (current_class_type
&& LAMBDA_TYPE_P (current_class_type
)
4047 && CLASSTYPE_TEMPLATE_INFO (current_class_type
))
4050 if (TREE_CODE (t
) == TYPE_DECL
)
4053 ppd
.parameter_packs
= ¶meter_packs
;
4054 ppd
.visited
= new hash_set
<tree
>;
4055 ppd
.type_pack_expansion_p
= false;
4056 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
4059 if (parameter_packs
)
4061 if (loc
== UNKNOWN_LOCATION
)
4062 loc
= cp_expr_loc_or_input_loc (t
);
4063 error_at (loc
, "parameter packs not expanded with %<...%>:");
4064 while (parameter_packs
)
4066 tree pack
= TREE_VALUE (parameter_packs
);
4067 tree name
= NULL_TREE
;
4069 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
4070 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
4071 name
= TYPE_NAME (pack
);
4072 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
4073 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
4074 else if (TREE_CODE (pack
) == CALL_EXPR
)
4075 name
= DECL_NAME (CALL_EXPR_FN (pack
));
4077 name
= DECL_NAME (pack
);
4080 inform (loc
, " %qD", name
);
4082 inform (loc
, " %s", "<anonymous>");
4084 parameter_packs
= TREE_CHAIN (parameter_packs
);
4093 /* Expand any parameter packs that occur in the template arguments in
4096 expand_template_argument_pack (tree args
)
4098 if (args
== error_mark_node
)
4099 return error_mark_node
;
4101 tree result_args
= NULL_TREE
;
4102 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
4103 int num_result_args
= -1;
4104 int non_default_args_count
= -1;
4106 /* First, determine if we need to expand anything, and the number of
4107 slots we'll need. */
4108 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
4110 tree arg
= TREE_VEC_ELT (args
, in_arg
);
4111 if (arg
== NULL_TREE
)
4113 if (ARGUMENT_PACK_P (arg
))
4115 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
4116 if (num_result_args
< 0)
4117 num_result_args
= in_arg
+ num_packed
;
4119 num_result_args
+= num_packed
;
4123 if (num_result_args
>= 0)
4128 /* If no expansion is necessary, we're done. */
4129 if (num_result_args
< 0)
4132 /* Expand arguments. */
4133 result_args
= make_tree_vec (num_result_args
);
4134 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
4135 non_default_args_count
=
4136 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
4137 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
4139 tree arg
= TREE_VEC_ELT (args
, in_arg
);
4140 if (ARGUMENT_PACK_P (arg
))
4142 tree packed
= ARGUMENT_PACK_ARGS (arg
);
4143 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
4144 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
4145 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
4146 if (non_default_args_count
> 0)
4147 non_default_args_count
+= num_packed
- 1;
4151 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
4155 if (non_default_args_count
>= 0)
4156 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
4160 /* Checks if DECL shadows a template parameter.
4162 [temp.local]: A template-parameter shall not be redeclared within its
4163 scope (including nested scopes).
4165 Emits an error and returns TRUE if the DECL shadows a parameter,
4166 returns FALSE otherwise. */
4169 check_template_shadow (tree decl
)
4173 /* If we're not in a template, we can't possibly shadow a template
4175 if (!current_template_parms
)
4178 /* Figure out what we're shadowing. */
4179 decl
= OVL_FIRST (decl
);
4180 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
4182 /* If there's no previous binding for this name, we're not shadowing
4183 anything, let alone a template parameter. */
4187 /* If we're not shadowing a template parameter, we're done. Note
4188 that OLDDECL might be an OVERLOAD (or perhaps even an
4189 ERROR_MARK), so we can't just blithely assume it to be a _DECL
4191 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
4194 /* We check for decl != olddecl to avoid bogus errors for using a
4195 name inside a class. We check TPFI to avoid duplicate errors for
4196 inline member templates. */
4198 || (DECL_TEMPLATE_PARM_P (decl
)
4199 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
)))
4202 /* Don't complain about the injected class name, as we've already
4203 complained about the class itself. */
4204 if (DECL_SELF_REFERENCE_P (decl
))
4207 if (DECL_TEMPLATE_PARM_P (decl
))
4208 error ("declaration of template parameter %q+D shadows "
4209 "template parameter", decl
);
4211 error ("declaration of %q+#D shadows template parameter", decl
);
4212 inform (DECL_SOURCE_LOCATION (olddecl
),
4213 "template parameter %qD declared here", olddecl
);
4217 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
4218 ORIG_LEVEL, DECL, and TYPE. */
4221 build_template_parm_index (int index
,
4227 tree t
= make_node (TEMPLATE_PARM_INDEX
);
4228 TEMPLATE_PARM_IDX (t
) = index
;
4229 TEMPLATE_PARM_LEVEL (t
) = level
;
4230 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
4231 TEMPLATE_PARM_DECL (t
) = decl
;
4232 TREE_TYPE (t
) = type
;
4233 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
4234 TREE_READONLY (t
) = TREE_READONLY (decl
);
4239 /* Find the canonical type parameter for the given template type
4240 parameter. Returns the canonical type parameter, which may be TYPE
4241 if no such parameter existed. */
4244 canonical_type_parameter (tree type
)
4247 int idx
= TEMPLATE_TYPE_IDX (type
);
4248 if (!canonical_template_parms
)
4249 vec_alloc (canonical_template_parms
, idx
+ 1);
4251 if (canonical_template_parms
->length () <= (unsigned) idx
)
4252 vec_safe_grow_cleared (canonical_template_parms
, idx
+ 1);
4254 list
= (*canonical_template_parms
)[idx
];
4255 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
4256 list
= TREE_CHAIN (list
);
4259 return TREE_VALUE (list
);
4262 (*canonical_template_parms
)[idx
]
4263 = tree_cons (NULL_TREE
, type
, (*canonical_template_parms
)[idx
]);
4268 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
4269 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
4270 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
4271 new one is created. */
4274 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
4275 tsubst_flags_t complain
)
4277 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
4278 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
4279 != TEMPLATE_PARM_LEVEL (index
) - levels
)
4280 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
4282 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
4285 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
4286 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
4287 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
4288 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
4289 DECL_ARTIFICIAL (decl
) = 1;
4290 SET_DECL_TEMPLATE_PARM_P (decl
);
4292 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
4293 TEMPLATE_PARM_LEVEL (index
) - levels
,
4294 TEMPLATE_PARM_ORIG_LEVEL (index
),
4296 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
4297 TEMPLATE_PARM_PARAMETER_PACK (t
)
4298 = TEMPLATE_PARM_PARAMETER_PACK (index
);
4300 /* Template template parameters need this. */
4301 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4303 DECL_TEMPLATE_RESULT (decl
)
4304 = build_decl (DECL_SOURCE_LOCATION (decl
),
4305 TYPE_DECL
, DECL_NAME (decl
), type
);
4306 DECL_ARTIFICIAL (DECL_TEMPLATE_RESULT (decl
)) = true;
4307 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
4308 (DECL_TEMPLATE_PARMS (orig_decl
), args
, complain
);
4312 return TEMPLATE_PARM_DESCENDANTS (index
);
4315 /* Process information from new template parameter PARM and append it
4316 to the LIST being built. This new parameter is a non-type
4317 parameter iff IS_NON_TYPE is true. This new parameter is a
4318 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
4322 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
4323 bool is_non_type
, bool is_parameter_pack
)
4328 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
4329 tree defval
= TREE_PURPOSE (parm
);
4330 tree constr
= TREE_TYPE (parm
);
4334 tree p
= tree_last (list
);
4336 if (p
&& TREE_VALUE (p
) != error_mark_node
)
4339 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
4340 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
4342 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
4350 parm
= TREE_VALUE (parm
);
4352 SET_DECL_TEMPLATE_PARM_P (parm
);
4354 if (TREE_TYPE (parm
) != error_mark_node
)
4358 The top-level cv-qualifiers on the template-parameter are
4359 ignored when determining its type. */
4360 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
4361 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
4362 TREE_TYPE (parm
) = error_mark_node
;
4363 else if (uses_parameter_packs (TREE_TYPE (parm
))
4364 && !is_parameter_pack
4365 /* If we're in a nested template parameter list, the template
4366 template parameter could be a parameter pack. */
4367 && processing_template_parmlist
== 1)
4369 /* This template parameter is not a parameter pack, but it
4370 should be. Complain about "bare" parameter packs. */
4371 check_for_bare_parameter_packs (TREE_TYPE (parm
));
4373 /* Recover by calling this a parameter pack. */
4374 is_parameter_pack
= true;
4378 /* A template parameter is not modifiable. */
4379 TREE_CONSTANT (parm
) = 1;
4380 TREE_READONLY (parm
) = 1;
4381 decl
= build_decl (parm_loc
,
4382 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
4383 TREE_CONSTANT (decl
) = 1;
4384 TREE_READONLY (decl
) = 1;
4385 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
4386 = build_template_parm_index (idx
, processing_template_decl
,
4387 processing_template_decl
,
4388 decl
, TREE_TYPE (parm
));
4390 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
4391 = is_parameter_pack
;
4396 parm
= TREE_VALUE (TREE_VALUE (parm
));
4398 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
4400 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
4401 /* This is for distinguishing between real templates and template
4402 template parameters */
4403 TREE_TYPE (parm
) = t
;
4404 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
4409 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
4410 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
4411 decl
= build_decl (parm_loc
,
4412 TYPE_DECL
, parm
, t
);
4415 TYPE_NAME (t
) = decl
;
4416 TYPE_STUB_DECL (t
) = decl
;
4418 TEMPLATE_TYPE_PARM_INDEX (t
)
4419 = build_template_parm_index (idx
, processing_template_decl
,
4420 processing_template_decl
,
4421 decl
, TREE_TYPE (parm
));
4422 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
4423 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
4425 DECL_ARTIFICIAL (decl
) = 1;
4426 SET_DECL_TEMPLATE_PARM_P (decl
);
4428 /* Build requirements for the type/template parameter.
4429 This must be done after SET_DECL_TEMPLATE_PARM_P or
4430 process_template_parm could fail. */
4431 tree reqs
= finish_shorthand_constraint (parm
, constr
);
4433 decl
= pushdecl (decl
);
4437 /* Build the parameter node linking the parameter declaration,
4438 its default argument (if any), and its constraints (if any). */
4439 parm
= build_tree_list (defval
, parm
);
4440 TEMPLATE_PARM_CONSTRAINTS (parm
) = reqs
;
4442 return chainon (list
, parm
);
4445 /* The end of a template parameter list has been reached. Process the
4446 tree list into a parameter vector, converting each parameter into a more
4447 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
4451 end_template_parm_list (tree parms
)
4455 tree saved_parmlist
= make_tree_vec (list_length (parms
));
4457 /* Pop the dummy parameter level and add the real one. */
4458 current_template_parms
= TREE_CHAIN (current_template_parms
);
4460 current_template_parms
4461 = tree_cons (size_int (processing_template_decl
),
4462 saved_parmlist
, current_template_parms
);
4464 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
4466 next
= TREE_CHAIN (parm
);
4467 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
4468 TREE_CHAIN (parm
) = NULL_TREE
;
4471 --processing_template_parmlist
;
4473 return saved_parmlist
;
4476 // Explicitly indicate the end of the template parameter list. We assume
4477 // that the current template parameters have been constructed and/or
4478 // managed explicitly, as when creating new template template parameters
4479 // from a shorthand constraint.
4481 end_template_parm_list ()
4483 --processing_template_parmlist
;
4486 /* end_template_decl is called after a template declaration is seen. */
4489 end_template_decl (void)
4491 reset_specialization ();
4493 if (! processing_template_decl
)
4496 /* This matches the pushlevel in begin_template_parm_list. */
4499 --processing_template_decl
;
4500 current_template_parms
= TREE_CHAIN (current_template_parms
);
4503 /* Takes a TREE_LIST representing a template parameter and convert it
4504 into an argument suitable to be passed to the type substitution
4505 functions. Note that If the TREE_LIST contains an error_mark
4506 node, the returned argument is error_mark_node. */
4509 template_parm_to_arg (tree t
)
4513 || TREE_CODE (t
) != TREE_LIST
)
4516 if (error_operand_p (TREE_VALUE (t
)))
4517 return error_mark_node
;
4521 if (TREE_CODE (t
) == TYPE_DECL
4522 || TREE_CODE (t
) == TEMPLATE_DECL
)
4526 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
4528 /* Turn this argument into a TYPE_ARGUMENT_PACK
4529 with a single element, which expands T. */
4530 tree vec
= make_tree_vec (1);
4532 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
4534 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4536 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
4537 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4542 t
= DECL_INITIAL (t
);
4544 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
4546 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
4547 with a single element, which expands T. */
4548 tree vec
= make_tree_vec (1);
4550 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
4552 t
= convert_from_reference (t
);
4553 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4555 t
= make_node (NONTYPE_ARGUMENT_PACK
);
4556 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4559 t
= convert_from_reference (t
);
4564 /* Given a single level of template parameters (a TREE_VEC), return it
4565 as a set of template arguments. */
4568 template_parms_level_to_args (tree parms
)
4570 tree a
= copy_node (parms
);
4571 TREE_TYPE (a
) = NULL_TREE
;
4572 for (int i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
4573 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
4576 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
4581 /* Given a set of template parameters, return them as a set of template
4582 arguments. The template parameters are represented as a TREE_VEC, in
4583 the form documented in cp-tree.h for template arguments. */
4586 template_parms_to_args (tree parms
)
4589 tree args
= NULL_TREE
;
4590 int length
= TMPL_PARMS_DEPTH (parms
);
4593 /* If there is only one level of template parameters, we do not
4594 create a TREE_VEC of TREE_VECs. Instead, we return a single
4595 TREE_VEC containing the arguments. */
4597 args
= make_tree_vec (length
);
4599 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
4601 tree a
= template_parms_level_to_args (TREE_VALUE (header
));
4604 TREE_VEC_ELT (args
, --l
) = a
;
4612 /* Within the declaration of a template, return the currently active
4613 template parameters as an argument TREE_VEC. */
4616 current_template_args (void)
4618 return template_parms_to_args (current_template_parms
);
4621 /* Update the declared TYPE by doing any lookups which were thought to be
4622 dependent, but are not now that we know the SCOPE of the declarator. */
4625 maybe_update_decl_type (tree orig_type
, tree scope
)
4627 tree type
= orig_type
;
4629 if (type
== NULL_TREE
)
4632 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4633 type
= TREE_TYPE (type
);
4635 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
4636 && dependent_type_p (type
)
4637 /* Don't bother building up the args in this case. */
4638 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
4640 /* tsubst in the args corresponding to the template parameters,
4641 including auto if present. Most things will be unchanged, but
4642 make_typename_type and tsubst_qualified_id will resolve
4643 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
4644 tree args
= current_template_args ();
4645 tree auto_node
= type_uses_auto (type
);
4649 tree auto_vec
= make_tree_vec (1);
4650 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
4651 args
= add_to_template_args (args
, auto_vec
);
4653 pushed
= push_scope (scope
);
4654 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
4659 if (type
== error_mark_node
)
4662 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4664 if (same_type_p (type
, TREE_TYPE (orig_type
)))
4667 type
= TYPE_NAME (type
);
4672 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4673 template PARMS and constraints, CONSTR. If MEMBER_TEMPLATE_P is true,
4674 the new template is a member template. */
4677 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
4679 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
4680 SET_DECL_LANGUAGE (tmpl
, DECL_LANGUAGE (decl
));
4681 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
4682 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
4683 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
4684 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
4689 struct template_parm_data
4691 /* The level of the template parameters we are currently
4695 /* The index of the specialization argument we are currently
4699 /* An array whose size is the number of template parameters. The
4700 elements are nonzero if the parameter has been used in any one
4701 of the arguments processed so far. */
4704 /* An array whose size is the number of template arguments. The
4705 elements are nonzero if the argument makes use of template
4706 parameters of this level. */
4707 int* arg_uses_template_parms
;
4710 /* Subroutine of push_template_decl used to see if each template
4711 parameter in a partial specialization is used in the explicit
4712 argument list. If T is of the LEVEL given in DATA (which is
4713 treated as a template_parm_data*), then DATA->PARMS is marked
4717 mark_template_parm (tree t
, void* data
)
4721 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4723 template_parm_level_and_index (t
, &level
, &idx
);
4725 if (level
== tpd
->level
)
4727 tpd
->parms
[idx
] = 1;
4728 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4731 /* In C++17 the type of a non-type argument is a deduced context. */
4732 if (cxx_dialect
>= cxx17
4733 && TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
4734 for_each_template_parm (TREE_TYPE (t
),
4735 &mark_template_parm
,
4738 /*include_nondeduced_p=*/false);
4740 /* Return zero so that for_each_template_parm will continue the
4741 traversal of the tree; we want to mark *every* template parm. */
4745 /* Process the partial specialization DECL. */
4748 process_partial_specialization (tree decl
)
4750 tree type
= TREE_TYPE (decl
);
4751 tree tinfo
= get_template_info (decl
);
4752 tree maintmpl
= TI_TEMPLATE (tinfo
);
4753 tree specargs
= TI_ARGS (tinfo
);
4754 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4755 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4758 int nargs
= TREE_VEC_LENGTH (inner_args
);
4761 bool did_error_intro
= false;
4762 struct template_parm_data tpd
;
4763 struct template_parm_data tpd2
;
4765 gcc_assert (current_template_parms
);
4767 /* A concept cannot be specialized. */
4768 if (flag_concepts
&& variable_concept_p (maintmpl
))
4770 error ("specialization of variable concept %q#D", maintmpl
);
4771 return error_mark_node
;
4774 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4775 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4777 /* We check that each of the template parameters given in the
4778 partial specialization is used in the argument list to the
4779 specialization. For example:
4781 template <class T> struct S;
4782 template <class T> struct S<T*>;
4784 The second declaration is OK because `T*' uses the template
4785 parameter T, whereas
4787 template <class T> struct S<int>;
4789 is no good. Even trickier is:
4800 The S2<T> declaration is actually invalid; it is a
4801 full-specialization. Of course,
4804 struct S2<T (*)(U)>;
4806 or some such would have been OK. */
4807 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4808 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4809 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4811 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4812 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4813 for (i
= 0; i
< nargs
; ++i
)
4815 tpd
.current_arg
= i
;
4816 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4817 &mark_template_parm
,
4820 /*include_nondeduced_p=*/false);
4822 for (i
= 0; i
< ntparms
; ++i
)
4823 if (tpd
.parms
[i
] == 0)
4825 /* One of the template parms was not used in a deduced context in the
4827 if (!did_error_intro
)
4829 error ("template parameters not deducible in "
4830 "partial specialization:");
4831 did_error_intro
= true;
4834 inform (input_location
, " %qD",
4835 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4838 if (did_error_intro
)
4839 return error_mark_node
;
4841 /* [temp.class.spec]
4843 The argument list of the specialization shall not be identical to
4844 the implicit argument list of the primary template. */
4846 = TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (maintmpl
)));
4847 if (comp_template_args (inner_args
, INNERMOST_TEMPLATE_ARGS (main_args
))
4849 || !strictly_subsumes (current_template_constraints (),
4850 get_constraints (maintmpl
))))
4853 error ("partial specialization %q+D does not specialize "
4854 "any template arguments; to define the primary template, "
4855 "remove the template argument list", decl
);
4857 error ("partial specialization %q+D does not specialize any "
4858 "template arguments and is not more constrained than "
4859 "the primary template; to define the primary template, "
4860 "remove the template argument list", decl
);
4861 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4864 /* A partial specialization that replaces multiple parameters of the
4865 primary template with a pack expansion is less specialized for those
4867 if (nargs
< DECL_NTPARMS (maintmpl
))
4869 error ("partial specialization is not more specialized than the "
4870 "primary template because it replaces multiple parameters "
4871 "with a pack expansion");
4872 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4873 /* Avoid crash in process_partial_specialization. */
4877 /* If we aren't in a dependent class, we can actually try deduction. */
4878 else if (tpd
.level
== 1
4879 /* FIXME we should be able to handle a partial specialization of a
4880 partial instantiation, but currently we can't (c++/41727). */
4881 && TMPL_ARGS_DEPTH (specargs
) == 1
4882 && !get_partial_spec_bindings (maintmpl
, maintmpl
, specargs
))
4884 auto_diagnostic_group d
;
4885 if (permerror (input_location
, "partial specialization %qD is not "
4886 "more specialized than", decl
))
4887 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template %qD",
4891 /* [temp.class.spec]
4893 A partially specialized non-type argument expression shall not
4894 involve template parameters of the partial specialization except
4895 when the argument expression is a simple identifier.
4897 The type of a template parameter corresponding to a specialized
4898 non-type argument shall not be dependent on a parameter of the
4901 Also, we verify that pack expansions only occur at the
4902 end of the argument list. */
4903 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4905 for (i
= 0; i
< nargs
; ++i
)
4907 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4908 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4909 tree packed_args
= NULL_TREE
;
4912 if (ARGUMENT_PACK_P (arg
))
4914 /* Extract the arguments from the argument pack. We'll be
4915 iterating over these in the following loop. */
4916 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4917 len
= TREE_VEC_LENGTH (packed_args
);
4920 for (j
= 0; j
< len
; j
++)
4923 /* Get the Jth argument in the parameter pack. */
4924 arg
= TREE_VEC_ELT (packed_args
, j
);
4926 if (PACK_EXPANSION_P (arg
))
4928 /* Pack expansions must come at the end of the
4930 if ((packed_args
&& j
< len
- 1)
4931 || (!packed_args
&& i
< nargs
- 1))
4933 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4934 error ("parameter pack argument %qE must be at the "
4935 "end of the template argument list", arg
);
4937 error ("parameter pack argument %qT must be at the "
4938 "end of the template argument list", arg
);
4942 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4943 /* We only care about the pattern. */
4944 arg
= PACK_EXPANSION_PATTERN (arg
);
4946 if (/* These first two lines are the `non-type' bit. */
4948 && TREE_CODE (arg
) != TEMPLATE_DECL
4949 /* This next two lines are the `argument expression is not just a
4950 simple identifier' condition and also the `specialized
4951 non-type argument' bit. */
4952 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
4953 && !((REFERENCE_REF_P (arg
)
4954 || TREE_CODE (arg
) == VIEW_CONVERT_EXPR
)
4955 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_PARM_INDEX
))
4957 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4958 || (packed_args
&& uses_template_parms (arg
)))
4959 error ("template argument %qE involves template parameter(s)",
4963 /* Look at the corresponding template parameter,
4964 marking which template parameters its type depends
4966 tree type
= TREE_TYPE (parm
);
4970 /* We haven't yet initialized TPD2. Do so now. */
4971 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4972 /* The number of parameters here is the number in the
4973 main template, which, as checked in the assertion
4975 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4977 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4980 /* Mark the template parameters. But this time, we're
4981 looking for the template parameters of the main
4982 template, not in the specialization. */
4983 tpd2
.current_arg
= i
;
4984 tpd2
.arg_uses_template_parms
[i
] = 0;
4985 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4986 for_each_template_parm (type
,
4987 &mark_template_parm
,
4990 /*include_nondeduced_p=*/false);
4992 if (tpd2
.arg_uses_template_parms
[i
])
4994 /* The type depended on some template parameters.
4995 If they are fully specialized in the
4996 specialization, that's OK. */
4999 for (j
= 0; j
< nargs
; ++j
)
5000 if (tpd2
.parms
[j
] != 0
5001 && tpd
.arg_uses_template_parms
[j
])
5004 error_n (input_location
, count
,
5005 "type %qT of template argument %qE depends "
5006 "on a template parameter",
5007 "type %qT of template argument %qE depends "
5008 "on template parameters",
5017 /* We should only get here once. */
5018 if (TREE_CODE (decl
) == TYPE_DECL
)
5019 gcc_assert (!COMPLETE_TYPE_P (type
));
5021 // Build the template decl.
5022 tree tmpl
= build_template_decl (decl
, current_template_parms
,
5023 DECL_MEMBER_TEMPLATE_P (maintmpl
));
5024 TREE_TYPE (tmpl
) = type
;
5025 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
5026 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
5027 DECL_TEMPLATE_INFO (tmpl
) = build_template_info (maintmpl
, specargs
);
5028 DECL_PRIMARY_TEMPLATE (tmpl
) = maintmpl
;
5030 /* Give template template parms a DECL_CONTEXT of the template
5031 for which they are a parameter. */
5032 for (i
= 0; i
< ntparms
; ++i
)
5034 tree parm
= TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
));
5035 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5036 DECL_CONTEXT (parm
) = tmpl
;
5040 /* We didn't register this in check_explicit_specialization so we could
5041 wait until the constraints were set. */
5042 decl
= register_specialization (decl
, maintmpl
, specargs
, false, 0);
5044 associate_classtype_constraints (type
);
5046 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
5047 = tree_cons (specargs
, tmpl
,
5048 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
5049 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
5051 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
5052 inst
= TREE_CHAIN (inst
))
5054 tree instance
= TREE_VALUE (inst
);
5055 if (TYPE_P (instance
)
5056 ? (COMPLETE_TYPE_P (instance
)
5057 && CLASSTYPE_IMPLICIT_INSTANTIATION (instance
))
5058 : DECL_TEMPLATE_INSTANTIATION (instance
))
5060 tree spec
= most_specialized_partial_spec (instance
, tf_none
);
5061 tree inst_decl
= (DECL_P (instance
)
5062 ? instance
: TYPE_NAME (instance
));
5065 else if (spec
== error_mark_node
)
5066 permerror (input_location
,
5067 "declaration of %qD ambiguates earlier template "
5068 "instantiation for %qD", decl
, inst_decl
);
5069 else if (TREE_VALUE (spec
) == tmpl
)
5070 permerror (input_location
,
5071 "partial specialization of %qD after instantiation "
5072 "of %qD", decl
, inst_decl
);
5079 /* PARM is a template parameter of some form; return the corresponding
5080 TEMPLATE_PARM_INDEX. */
5083 get_template_parm_index (tree parm
)
5085 if (TREE_CODE (parm
) == PARM_DECL
5086 || TREE_CODE (parm
) == CONST_DECL
)
5087 parm
= DECL_INITIAL (parm
);
5088 else if (TREE_CODE (parm
) == TYPE_DECL
5089 || TREE_CODE (parm
) == TEMPLATE_DECL
)
5090 parm
= TREE_TYPE (parm
);
5091 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
5092 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
5093 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
5094 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
5095 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
5099 /* Subroutine of fixed_parameter_pack_p below. Look for any template
5100 parameter packs used by the template parameter PARM. */
5103 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
5105 /* A type parm can't refer to another parm. */
5106 if (TREE_CODE (parm
) == TYPE_DECL
|| parm
== error_mark_node
)
5108 else if (TREE_CODE (parm
) == PARM_DECL
)
5110 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
5115 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
5117 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
5118 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
5120 tree p
= TREE_VALUE (TREE_VEC_ELT (vec
, i
));
5121 if (template_parameter_pack_p (p
))
5122 /* Any packs in the type are expanded by this parameter. */;
5124 fixed_parameter_pack_p_1 (p
, ppd
);
5128 /* PARM is a template parameter pack. Return any parameter packs used in
5129 its type or the type of any of its template parameters. If there are
5130 any such packs, it will be instantiated into a fixed template parameter
5131 list by partial instantiation rather than be fully deduced. */
5134 fixed_parameter_pack_p (tree parm
)
5136 /* This can only be true in a member template. */
5137 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
5139 /* This can only be true for a parameter pack. */
5140 if (!template_parameter_pack_p (parm
))
5142 /* A type parm can't refer to another parm. */
5143 if (TREE_CODE (parm
) == TYPE_DECL
)
5146 tree parameter_packs
= NULL_TREE
;
5147 struct find_parameter_pack_data ppd
;
5148 ppd
.parameter_packs
= ¶meter_packs
;
5149 ppd
.visited
= new hash_set
<tree
>;
5150 ppd
.type_pack_expansion_p
= false;
5152 fixed_parameter_pack_p_1 (parm
, &ppd
);
5155 return parameter_packs
;
5158 /* Check that a template declaration's use of default arguments and
5159 parameter packs is not invalid. Here, PARMS are the template
5160 parameters. IS_PRIMARY is true if DECL is the thing declared by
5161 a primary template. IS_PARTIAL is true if DECL is a partial
5164 IS_FRIEND_DECL is nonzero if DECL is either a non-defining friend
5165 function template declaration or a friend class template
5166 declaration. In the function case, 1 indicates a declaration, 2
5167 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
5168 emitted for extraneous default arguments.
5170 Returns TRUE if there were no errors found, FALSE otherwise. */
5173 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
5174 bool is_partial
, int is_friend_decl
)
5177 int last_level_to_check
;
5179 bool no_errors
= true;
5183 A default template-argument shall not be specified in a
5184 function template declaration or a function template definition, nor
5185 in the template-parameter-list of the definition of a member of a
5188 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
5189 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (decl
)))
5190 /* You can't have a function template declaration in a local
5191 scope, nor you can you define a member of a class template in a
5195 if ((TREE_CODE (decl
) == TYPE_DECL
5197 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5198 || (TREE_CODE (decl
) == FUNCTION_DECL
5199 && LAMBDA_FUNCTION_P (decl
)))
5200 /* A lambda doesn't have an explicit declaration; don't complain
5201 about the parms of the enclosing class. */
5204 if (current_class_type
5205 && !TYPE_BEING_DEFINED (current_class_type
)
5206 && DECL_LANG_SPECIFIC (decl
)
5207 && DECL_DECLARES_FUNCTION_P (decl
)
5208 /* If this is either a friend defined in the scope of the class
5209 or a member function. */
5210 && (DECL_FUNCTION_MEMBER_P (decl
)
5211 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
5212 : DECL_FRIEND_CONTEXT (decl
)
5213 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
5215 /* And, if it was a member function, it really was defined in
5216 the scope of the class. */
5217 && (!DECL_FUNCTION_MEMBER_P (decl
)
5218 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
5219 /* We already checked these parameters when the template was
5220 declared, so there's no need to do it again now. This function
5221 was defined in class scope, but we're processing its body now
5222 that the class is complete. */
5225 /* Core issue 226 (C++0x only): the following only applies to class
5228 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
5232 If a template-parameter has a default template-argument, all
5233 subsequent template-parameters shall have a default
5234 template-argument supplied. */
5235 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
5237 tree inner_parms
= TREE_VALUE (parm_level
);
5238 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
5239 int seen_def_arg_p
= 0;
5242 for (i
= 0; i
< ntparms
; ++i
)
5244 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
5246 if (parm
== error_mark_node
)
5249 if (TREE_PURPOSE (parm
))
5251 else if (seen_def_arg_p
5252 && !template_parameter_pack_p (TREE_VALUE (parm
)))
5254 error ("no default argument for %qD", TREE_VALUE (parm
));
5255 /* For better subsequent error-recovery, we indicate that
5256 there should have been a default argument. */
5257 TREE_PURPOSE (parm
) = error_mark_node
;
5260 else if (!is_partial
5262 /* Don't complain about an enclosing partial
5264 && parm_level
== parms
5265 && TREE_CODE (decl
) == TYPE_DECL
5267 && template_parameter_pack_p (TREE_VALUE (parm
))
5268 /* A fixed parameter pack will be partially
5269 instantiated into a fixed length list. */
5270 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
5272 /* A primary class template can only have one
5273 parameter pack, at the end of the template
5276 error ("parameter pack %q+D must be at the end of the"
5277 " template parameter list", TREE_VALUE (parm
));
5279 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
5287 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
5291 /* For an ordinary class template, default template arguments are
5292 allowed at the innermost level, e.g.:
5293 template <class T = int>
5295 but, in a partial specialization, they're not allowed even
5296 there, as we have in [temp.class.spec]:
5298 The template parameter list of a specialization shall not
5299 contain default template argument values.
5301 So, for a partial specialization, or for a function template
5302 (in C++98/C++03), we look at all of them. */
5305 /* But, for a primary class template that is not a partial
5306 specialization we look at all template parameters except the
5308 parms
= TREE_CHAIN (parms
);
5310 /* Figure out what error message to issue. */
5311 if (is_friend_decl
== 2)
5312 msg
= G_("default template arguments may not be used in function template "
5313 "friend re-declaration");
5314 else if (is_friend_decl
)
5315 msg
= G_("default template arguments may not be used in template "
5316 "friend declarations");
5317 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
5318 msg
= G_("default template arguments may not be used in function templates "
5319 "without %<-std=c++11%> or %<-std=gnu++11%>");
5320 else if (is_partial
)
5321 msg
= G_("default template arguments may not be used in "
5322 "partial specializations");
5323 else if (current_class_type
&& CLASSTYPE_IS_TEMPLATE (current_class_type
))
5324 msg
= G_("default argument for template parameter for class enclosing %qD");
5326 /* Per [temp.param]/9, "A default template-argument shall not be
5327 specified in the template-parameter-lists of the definition of
5328 a member of a class template that appears outside of the member's
5329 class.", thus if we aren't handling a member of a class template
5330 there is no need to examine the parameters. */
5333 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
5334 /* If we're inside a class definition, there's no need to
5335 examine the parameters to the class itself. On the one
5336 hand, they will be checked when the class is defined, and,
5337 on the other, default arguments are valid in things like:
5338 template <class T = double>
5339 struct S { template <class U> void f(U); };
5340 Here the default argument for `S' has no bearing on the
5341 declaration of `f'. */
5342 last_level_to_check
= template_class_depth (current_class_type
) + 1;
5344 /* Check everything. */
5345 last_level_to_check
= 0;
5347 for (parm_level
= parms
;
5348 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
5349 parm_level
= TREE_CHAIN (parm_level
))
5351 tree inner_parms
= TREE_VALUE (parm_level
);
5355 ntparms
= TREE_VEC_LENGTH (inner_parms
);
5356 for (i
= 0; i
< ntparms
; ++i
)
5358 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
5361 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
5366 if (is_friend_decl
== 2)
5373 /* Clear out the default argument so that we are not
5375 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
5379 /* At this point, if we're still interested in issuing messages,
5380 they must apply to classes surrounding the object declared. */
5382 msg
= G_("default argument for template parameter for class "
5389 /* Worker for push_template_decl_real, called via
5390 for_each_template_parm. DATA is really an int, indicating the
5391 level of the parameters we are interested in. If T is a template
5392 parameter of that level, return nonzero. */
5395 template_parm_this_level_p (tree t
, void* data
)
5397 int this_level
= *(int *)data
;
5400 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
5401 level
= TEMPLATE_PARM_LEVEL (t
);
5403 level
= TEMPLATE_TYPE_LEVEL (t
);
5404 return level
== this_level
;
5407 /* Worker for uses_outer_template_parms, called via for_each_template_parm.
5408 DATA is really an int, indicating the innermost outer level of parameters.
5409 If T is a template parameter of that level or further out, return
5413 template_parm_outer_level (tree t
, void *data
)
5415 int this_level
= *(int *)data
;
5418 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
5419 level
= TEMPLATE_PARM_LEVEL (t
);
5421 level
= TEMPLATE_TYPE_LEVEL (t
);
5422 return level
<= this_level
;
5425 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
5426 parameters given by current_template_args, or reuses a
5427 previously existing one, if appropriate. Returns the DECL, or an
5428 equivalent one, if it is replaced via a call to duplicate_decls.
5430 If IS_FRIEND is true, DECL is a friend declaration. */
5433 push_template_decl_real (tree decl
, bool is_friend
)
5441 int new_template_p
= 0;
5442 /* True if the template is a member template, in the sense of
5444 bool member_template_p
= false;
5446 if (decl
== error_mark_node
|| !current_template_parms
)
5447 return error_mark_node
;
5449 /* See if this is a partial specialization. */
5450 is_partial
= ((DECL_IMPLICIT_TYPEDEF_P (decl
)
5451 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
5452 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
5454 && DECL_LANG_SPECIFIC (decl
)
5455 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5456 && TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
))));
5458 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
5462 /* For a friend, we want the context of the friend, not
5463 the type of which it is a friend. */
5464 ctx
= CP_DECL_CONTEXT (decl
);
5465 else if (CP_DECL_CONTEXT (decl
)
5466 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
5467 /* In the case of a virtual function, we want the class in which
5469 ctx
= CP_DECL_CONTEXT (decl
);
5471 /* Otherwise, if we're currently defining some class, the DECL
5472 is assumed to be a member of the class. */
5473 ctx
= current_scope ();
5475 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
5478 if (!DECL_CONTEXT (decl
))
5479 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
5481 /* See if this is a primary template. */
5482 if (is_friend
&& ctx
5483 && uses_template_parms_level (ctx
, processing_template_decl
))
5484 /* A friend template that specifies a class context, i.e.
5485 template <typename T> friend void A<T>::f();
5488 else if (TREE_CODE (decl
) == TYPE_DECL
5489 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5492 is_primary
= template_parm_scope_p ();
5496 warning (OPT_Wtemplates
, "template %qD declared", decl
);
5498 if (DECL_CLASS_SCOPE_P (decl
))
5499 member_template_p
= true;
5500 if (TREE_CODE (decl
) == TYPE_DECL
5501 && IDENTIFIER_ANON_P (DECL_NAME (decl
)))
5503 error ("template class without a name");
5504 return error_mark_node
;
5506 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
5508 if (member_template_p
)
5510 if (DECL_OVERRIDE_P (decl
) || DECL_FINAL_P (decl
))
5511 error ("member template %qD may not have virt-specifiers", decl
);
5513 if (DECL_DESTRUCTOR_P (decl
))
5517 A destructor shall not be a member template. */
5518 error ("destructor %qD declared as member template", decl
);
5519 return error_mark_node
;
5521 if (IDENTIFIER_NEWDEL_OP_P (DECL_NAME (decl
))
5522 && (!prototype_p (TREE_TYPE (decl
))
5523 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
5524 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
5525 || (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
5526 == void_list_node
)))
5528 /* [basic.stc.dynamic.allocation]
5530 An allocation function can be a function
5531 template. ... Template allocation functions shall
5532 have two or more parameters. */
5533 error ("invalid template declaration of %qD", decl
);
5534 return error_mark_node
;
5537 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5538 && CLASS_TYPE_P (TREE_TYPE (decl
)))
5540 /* Class template, set TEMPLATE_TYPE_PARM_FOR_CLASS. */
5541 tree parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
5542 for (int i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
5544 tree t
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5545 if (TREE_CODE (t
) == TYPE_DECL
)
5547 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
5548 TEMPLATE_TYPE_PARM_FOR_CLASS (t
) = true;
5551 else if (TREE_CODE (decl
) == TYPE_DECL
5552 && TYPE_DECL_ALIAS_P (decl
))
5553 /* alias-declaration */
5554 gcc_assert (!DECL_ARTIFICIAL (decl
));
5555 else if (VAR_P (decl
))
5556 /* C++14 variable template. */;
5559 error ("template declaration of %q#D", decl
);
5560 return error_mark_node
;
5564 /* Check to see that the rules regarding the use of default
5565 arguments are not being violated. We check args for a friend
5566 functions when we know whether it's a definition, introducing
5567 declaration or re-declaration. */
5568 if (!is_friend
|| TREE_CODE (decl
) != FUNCTION_DECL
)
5569 check_default_tmpl_args (decl
, current_template_parms
,
5570 is_primary
, is_partial
, is_friend
);
5572 /* Ensure that there are no parameter packs in the type of this
5573 declaration that have not been expanded. */
5574 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5576 /* Check each of the arguments individually to see if there are
5577 any bare parameter packs. */
5578 tree type
= TREE_TYPE (decl
);
5579 tree arg
= DECL_ARGUMENTS (decl
);
5580 tree argtype
= TYPE_ARG_TYPES (type
);
5582 while (arg
&& argtype
)
5584 if (!DECL_PACK_P (arg
)
5585 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
5587 /* This is a PARM_DECL that contains unexpanded parameter
5588 packs. We have already complained about this in the
5589 check_for_bare_parameter_packs call, so just replace
5590 these types with ERROR_MARK_NODE. */
5591 TREE_TYPE (arg
) = error_mark_node
;
5592 TREE_VALUE (argtype
) = error_mark_node
;
5595 arg
= DECL_CHAIN (arg
);
5596 argtype
= TREE_CHAIN (argtype
);
5599 /* Check for bare parameter packs in the return type and the
5600 exception specifiers. */
5601 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
5602 /* Errors were already issued, set return type to int
5603 as the frontend doesn't expect error_mark_node as
5605 TREE_TYPE (type
) = integer_type_node
;
5606 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
5607 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
5609 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
5610 && TYPE_DECL_ALIAS_P (decl
))
5611 ? DECL_ORIGINAL_TYPE (decl
)
5612 : TREE_TYPE (decl
)))
5614 TREE_TYPE (decl
) = error_mark_node
;
5615 return error_mark_node
;
5619 return process_partial_specialization (decl
);
5621 args
= current_template_args ();
5624 || TREE_CODE (ctx
) == FUNCTION_DECL
5625 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
5626 || (TREE_CODE (decl
) == TYPE_DECL
5627 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5628 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
5630 if (DECL_LANG_SPECIFIC (decl
)
5631 && DECL_TEMPLATE_INFO (decl
)
5632 && DECL_TI_TEMPLATE (decl
))
5633 tmpl
= DECL_TI_TEMPLATE (decl
);
5634 /* If DECL is a TYPE_DECL for a class-template, then there won't
5635 be DECL_LANG_SPECIFIC. The information equivalent to
5636 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
5637 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5638 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
5639 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
5641 /* Since a template declaration already existed for this
5642 class-type, we must be redeclaring it here. Make sure
5643 that the redeclaration is valid. */
5644 redeclare_class_template (TREE_TYPE (decl
),
5645 current_template_parms
,
5646 current_template_constraints ());
5647 /* We don't need to create a new TEMPLATE_DECL; just use the
5648 one we already had. */
5649 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
5653 tmpl
= build_template_decl (decl
, current_template_parms
,
5657 if (DECL_LANG_SPECIFIC (decl
)
5658 && DECL_TEMPLATE_SPECIALIZATION (decl
))
5660 /* A specialization of a member template of a template
5662 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
5663 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
5664 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
5670 tree a
, t
, current
, parms
;
5672 tree tinfo
= get_template_info (decl
);
5676 error ("template definition of non-template %q#D", decl
);
5677 return error_mark_node
;
5680 tmpl
= TI_TEMPLATE (tinfo
);
5682 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
5683 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
5684 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5685 && DECL_MEMBER_TEMPLATE_P (tmpl
))
5689 /* The declaration is a specialization of a member
5690 template, declared outside the class. Therefore, the
5691 innermost template arguments will be NULL, so we
5692 replace them with the arguments determined by the
5693 earlier call to check_explicit_specialization. */
5694 args
= DECL_TI_ARGS (decl
);
5697 = build_template_decl (decl
, current_template_parms
,
5699 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
5700 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
5701 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
5702 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
5703 DECL_TEMPLATE_INFO (new_tmpl
)
5704 = build_template_info (tmpl
, args
);
5706 register_specialization (new_tmpl
,
5707 most_general_template (tmpl
),
5713 /* Make sure the template headers we got make sense. */
5715 parms
= DECL_TEMPLATE_PARMS (tmpl
);
5716 i
= TMPL_PARMS_DEPTH (parms
);
5717 if (TMPL_ARGS_DEPTH (args
) != i
)
5719 error ("expected %d levels of template parms for %q#D, got %d",
5720 i
, decl
, TMPL_ARGS_DEPTH (args
));
5721 DECL_INTERFACE_KNOWN (decl
) = 1;
5722 return error_mark_node
;
5725 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
5727 a
= TMPL_ARGS_LEVEL (args
, i
);
5728 t
= INNERMOST_TEMPLATE_PARMS (parms
);
5730 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
5732 if (current
== decl
)
5733 error ("got %d template parameters for %q#D",
5734 TREE_VEC_LENGTH (a
), decl
);
5736 error ("got %d template parameters for %q#T",
5737 TREE_VEC_LENGTH (a
), current
);
5738 error (" but %d required", TREE_VEC_LENGTH (t
));
5739 /* Avoid crash in import_export_decl. */
5740 DECL_INTERFACE_KNOWN (decl
) = 1;
5741 return error_mark_node
;
5744 if (current
== decl
)
5746 else if (current
== NULL_TREE
)
5747 /* Can happen in erroneous input. */
5750 current
= get_containing_scope (current
);
5753 /* Check that the parms are used in the appropriate qualifying scopes
5754 in the declarator. */
5755 if (!comp_template_args
5757 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
5759 error ("template arguments to %qD do not match original "
5760 "template %qD", decl
, DECL_TEMPLATE_RESULT (tmpl
));
5761 if (!uses_template_parms (TI_ARGS (tinfo
)))
5762 inform (input_location
, "use %<template<>%> for"
5763 " an explicit specialization");
5764 /* Avoid crash in import_export_decl. */
5765 DECL_INTERFACE_KNOWN (decl
) = 1;
5766 return error_mark_node
;
5770 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
5771 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
5773 /* Push template declarations for global functions and types. Note
5774 that we do not try to push a global template friend declared in a
5775 template class; such a thing may well depend on the template
5776 parameters of the class. */
5777 if (new_template_p
&& !ctx
5778 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
5780 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
5781 if (tmpl
== error_mark_node
)
5782 return error_mark_node
;
5784 /* Hide template friend classes that haven't been declared yet. */
5785 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
5787 DECL_ANTICIPATED (tmpl
) = 1;
5788 DECL_FRIEND_P (tmpl
) = 1;
5794 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5796 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5798 /* Give template template parms a DECL_CONTEXT of the template
5799 for which they are a parameter. */
5800 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5801 for (int i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5803 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5804 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5805 DECL_CONTEXT (parm
) = tmpl
;
5808 if (TREE_CODE (decl
) == TYPE_DECL
5809 && TYPE_DECL_ALIAS_P (decl
)
5810 && complex_alias_template_p (tmpl
))
5811 TEMPLATE_DECL_COMPLEX_ALIAS_P (tmpl
) = true;
5814 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5815 back to its most general template. If TMPL is a specialization,
5816 ARGS may only have the innermost set of arguments. Add the missing
5817 argument levels if necessary. */
5818 if (DECL_TEMPLATE_INFO (tmpl
))
5819 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5821 info
= build_template_info (tmpl
, args
);
5823 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5824 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5828 retrofit_lang_decl (decl
);
5829 if (DECL_LANG_SPECIFIC (decl
))
5830 DECL_TEMPLATE_INFO (decl
) = info
;
5833 if (flag_implicit_templates
5835 && TREE_PUBLIC (decl
)
5836 && VAR_OR_FUNCTION_DECL_P (decl
))
5837 /* Set DECL_COMDAT on template instantiations; if we force
5838 them to be emitted by explicit instantiation or -frepo,
5839 mark_needed will tell cgraph to do the right thing. */
5840 DECL_COMDAT (decl
) = true;
5842 return DECL_TEMPLATE_RESULT (tmpl
);
5846 push_template_decl (tree decl
)
5848 return push_template_decl_real (decl
, false);
5851 /* FN is an inheriting constructor that inherits from the constructor
5852 template INHERITED; turn FN into a constructor template with a matching
5856 add_inherited_template_parms (tree fn
, tree inherited
)
5859 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5860 inner_parms
= copy_node (inner_parms
);
5862 = tree_cons (size_int (processing_template_decl
+ 1),
5863 inner_parms
, current_template_parms
);
5864 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5865 tree args
= template_parms_to_args (parms
);
5866 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5867 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5868 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5869 DECL_ARTIFICIAL (tmpl
) = true;
5870 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5874 /* Called when a class template TYPE is redeclared with the indicated
5875 template PARMS, e.g.:
5877 template <class T> struct S;
5878 template <class T> struct S {}; */
5881 redeclare_class_template (tree type
, tree parms
, tree cons
)
5887 if (!TYPE_TEMPLATE_INFO (type
))
5889 error ("%qT is not a template type", type
);
5893 tmpl
= TYPE_TI_TEMPLATE (type
);
5894 if (!PRIMARY_TEMPLATE_P (tmpl
))
5895 /* The type is nested in some template class. Nothing to worry
5896 about here; there are no new template parameters for the nested
5902 error ("template specifiers not specified in declaration of %qD",
5907 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5908 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5910 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5912 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5913 "redeclared with %d template parameter",
5914 "redeclared with %d template parameters",
5915 TREE_VEC_LENGTH (parms
));
5916 inform_n (DECL_SOURCE_LOCATION (tmpl
), TREE_VEC_LENGTH (tmpl_parms
),
5917 "previous declaration %qD used %d template parameter",
5918 "previous declaration %qD used %d template parameters",
5919 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5923 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5930 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5931 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5934 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5935 if (error_operand_p (tmpl_parm
))
5938 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5939 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5940 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5942 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5944 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5945 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5946 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5947 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5948 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5949 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5950 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5951 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5952 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5954 error ("template parameter %q+#D", tmpl_parm
);
5955 error ("redeclared here as %q#D", parm
);
5959 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5961 /* We have in [temp.param]:
5963 A template-parameter may not be given default arguments
5964 by two different declarations in the same scope. */
5965 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5966 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5967 "original definition appeared here");
5971 if (parm_default
!= NULL_TREE
)
5972 /* Update the previous template parameters (which are the ones
5973 that will really count) with the new default value. */
5974 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5975 else if (tmpl_default
!= NULL_TREE
)
5976 /* Update the new parameters, too; they'll be used as the
5977 parameters for any members. */
5978 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5980 /* Give each template template parm in this redeclaration a
5981 DECL_CONTEXT of the template for which they are a parameter. */
5982 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5984 gcc_assert (DECL_CONTEXT (parm
) == NULL_TREE
);
5985 DECL_CONTEXT (parm
) = tmpl
;
5988 if (TREE_CODE (parm
) == TYPE_DECL
)
5989 TEMPLATE_TYPE_PARM_FOR_CLASS (TREE_TYPE (parm
)) = true;
5992 // Cannot redeclare a class template with a different set of constraints.
5993 if (!equivalent_constraints (get_constraints (tmpl
), cons
))
5995 error_at (input_location
, "redeclaration %q#D with different "
5996 "constraints", tmpl
);
5997 inform (DECL_SOURCE_LOCATION (tmpl
),
5998 "original declaration appeared here");
6004 /* The actual substitution part of instantiate_non_dependent_expr_sfinae,
6005 to be used when the caller has already checked
6006 (processing_template_decl
6007 && !instantiation_dependent_expression_p (expr)
6008 && potential_constant_expression (expr))
6009 and cleared processing_template_decl. */
6012 instantiate_non_dependent_expr_internal (tree expr
, tsubst_flags_t complain
)
6014 return tsubst_copy_and_build (expr
,
6017 /*in_decl=*/NULL_TREE
,
6018 /*function_p=*/false,
6019 /*integral_constant_expression_p=*/true);
6022 /* Simplify EXPR if it is a non-dependent expression. Returns the
6023 (possibly simplified) expression. */
6026 instantiate_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
6028 if (expr
== NULL_TREE
)
6031 /* If we're in a template, but EXPR isn't value dependent, simplify
6032 it. We're supposed to treat:
6034 template <typename T> void f(T[1 + 1]);
6035 template <typename T> void f(T[2]);
6037 as two declarations of the same function, for example. */
6038 if (processing_template_decl
6039 && is_nondependent_constant_expression (expr
))
6041 processing_template_decl_sentinel s
;
6042 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
6048 instantiate_non_dependent_expr (tree expr
)
6050 return instantiate_non_dependent_expr_sfinae (expr
, tf_error
);
6053 /* Like instantiate_non_dependent_expr, but return NULL_TREE rather than
6054 an uninstantiated expression. */
6057 instantiate_non_dependent_or_null (tree expr
)
6059 if (expr
== NULL_TREE
)
6061 if (processing_template_decl
)
6063 if (!is_nondependent_constant_expression (expr
))
6067 processing_template_decl_sentinel s
;
6068 expr
= instantiate_non_dependent_expr_internal (expr
, tf_error
);
6074 /* True iff T is a specialization of a variable template. */
6077 variable_template_specialization_p (tree t
)
6079 if (!VAR_P (t
) || !DECL_LANG_SPECIFIC (t
) || !DECL_TEMPLATE_INFO (t
))
6081 tree tmpl
= DECL_TI_TEMPLATE (t
);
6082 return variable_template_p (tmpl
);
6085 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
6086 template declaration, or a TYPE_DECL for an alias declaration. */
6089 alias_type_or_template_p (tree t
)
6093 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
6096 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
6097 || DECL_ALIAS_TEMPLATE_P (t
));
6100 /* Return TRUE iff T is a specialization of an alias template. */
6103 alias_template_specialization_p (const_tree t
)
6105 /* It's an alias template specialization if it's an alias and its
6106 TYPE_NAME is a specialization of a primary template. */
6107 if (TYPE_ALIAS_P (t
))
6108 if (tree tinfo
= TYPE_ALIAS_TEMPLATE_INFO (t
))
6109 return PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
));
6114 /* An alias template is complex from a SFINAE perspective if a template-id
6115 using that alias can be ill-formed when the expansion is not, as with
6116 the void_t template. We determine this by checking whether the
6117 expansion for the alias template uses all its template parameters. */
6119 struct uses_all_template_parms_data
6126 uses_all_template_parms_r (tree t
, void *data_
)
6128 struct uses_all_template_parms_data
&data
6129 = *(struct uses_all_template_parms_data
*)data_
;
6130 tree idx
= get_template_parm_index (t
);
6132 if (TEMPLATE_PARM_LEVEL (idx
) == data
.level
)
6133 data
.seen
[TEMPLATE_PARM_IDX (idx
)] = true;
6138 complex_alias_template_p (const_tree tmpl
)
6140 struct uses_all_template_parms_data data
;
6141 tree pat
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
6142 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
6143 data
.level
= TMPL_PARMS_DEPTH (parms
);
6144 int len
= TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS (parms
));
6145 data
.seen
= XALLOCAVEC (bool, len
);
6146 for (int i
= 0; i
< len
; ++i
)
6147 data
.seen
[i
] = false;
6149 for_each_template_parm (pat
, uses_all_template_parms_r
, &data
, NULL
, true);
6150 for (int i
= 0; i
< len
; ++i
)
6156 /* Return TRUE iff T is a specialization of a complex alias template with
6157 dependent template-arguments. */
6160 dependent_alias_template_spec_p (const_tree t
)
6162 if (!alias_template_specialization_p (t
))
6165 tree tinfo
= TYPE_ALIAS_TEMPLATE_INFO (t
);
6166 if (!TEMPLATE_DECL_COMPLEX_ALIAS_P (TI_TEMPLATE (tinfo
)))
6169 tree args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
));
6170 if (!any_dependent_template_arguments_p (args
))
6176 /* Return the number of innermost template parameters in TMPL. */
6179 num_innermost_template_parms (tree tmpl
)
6181 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
6182 return TREE_VEC_LENGTH (parms
);
6185 /* Return either TMPL or another template that it is equivalent to under DR
6186 1286: An alias that just changes the name of a template is equivalent to
6187 the other template. */
6190 get_underlying_template (tree tmpl
)
6192 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
6193 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
6195 /* Determine if the alias is equivalent to an underlying template. */
6196 tree orig_type
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
6197 tree tinfo
= TYPE_TEMPLATE_INFO_MAYBE_ALIAS (orig_type
);
6201 tree underlying
= TI_TEMPLATE (tinfo
);
6202 if (!PRIMARY_TEMPLATE_P (underlying
)
6203 || (num_innermost_template_parms (tmpl
)
6204 != num_innermost_template_parms (underlying
)))
6207 tree alias_args
= INNERMOST_TEMPLATE_ARGS
6208 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
6209 if (!comp_template_args (TI_ARGS (tinfo
), alias_args
))
6212 /* Alias is equivalent. Strip it and repeat. */
6219 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
6220 must be a reference-to-function or a pointer-to-function type, as specified
6221 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
6222 and check that the resulting function has external linkage. */
6225 convert_nontype_argument_function (tree type
, tree expr
,
6226 tsubst_flags_t complain
)
6230 linkage_kind linkage
;
6232 fn
= instantiate_type (type
, fns
, tf_none
);
6233 if (fn
== error_mark_node
)
6234 return error_mark_node
;
6236 if (value_dependent_expression_p (fn
))
6239 fn_no_ptr
= strip_fnptr_conv (fn
);
6240 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
6241 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
6242 if (BASELINK_P (fn_no_ptr
))
6243 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
6245 /* [temp.arg.nontype]/1
6247 A template-argument for a non-type, non-template template-parameter
6250 -- the address of an object or function with external [C++11: or
6251 internal] linkage. */
6253 STRIP_ANY_LOCATION_WRAPPER (fn_no_ptr
);
6254 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
6256 if (complain
& tf_error
)
6258 error ("%qE is not a valid template argument for type %qT",
6260 if (TYPE_PTR_P (type
))
6261 inform (input_location
, "it must be the address of a function "
6262 "with external linkage");
6264 inform (input_location
, "it must be the name of a function with "
6265 "external linkage");
6270 linkage
= decl_linkage (fn_no_ptr
);
6271 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
6273 if (complain
& tf_error
)
6275 if (cxx_dialect
>= cxx11
)
6276 error ("%qE is not a valid template argument for type %qT "
6277 "because %qD has no linkage",
6278 expr
, type
, fn_no_ptr
);
6280 error ("%qE is not a valid template argument for type %qT "
6281 "because %qD does not have external linkage",
6282 expr
, type
, fn_no_ptr
);
6288 if (TYPE_REF_P (type
))
6290 if (REFERENCE_REF_P (fn
))
6291 fn
= TREE_OPERAND (fn
, 0);
6293 fn
= build_address (fn
);
6295 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (fn
)))
6296 fn
= build_nop (type
, fn
);
6301 /* Subroutine of convert_nontype_argument.
6302 Check if EXPR of type TYPE is a valid pointer-to-member constant.
6303 Emit an error otherwise. */
6306 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
6307 tsubst_flags_t complain
)
6309 location_t loc
= cp_expr_loc_or_input_loc (expr
);
6310 tree orig_expr
= expr
;
6312 if (null_ptr_cst_p (expr
))
6314 if (TREE_CODE (expr
) == PTRMEM_CST
6315 && same_type_p (TYPE_PTRMEM_CLASS_TYPE (type
),
6316 PTRMEM_CST_CLASS (expr
)))
6318 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
6320 if (processing_template_decl
6321 && TREE_CODE (expr
) == ADDR_EXPR
6322 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
6324 if (complain
& tf_error
)
6326 error_at (loc
, "%qE is not a valid template argument for type %qT",
6328 if (TREE_CODE (expr
) != PTRMEM_CST
)
6329 inform (loc
, "it must be a pointer-to-member of the form %<&X::Y%>");
6331 inform (loc
, "because it is a member of %qT", PTRMEM_CST_CLASS (expr
));
6336 /* Returns TRUE iff the address of OP is value-dependent.
6338 14.6.2.4 [temp.dep.temp]:
6339 A non-integral non-type template-argument is dependent if its type is
6340 dependent or it has either of the following forms
6343 and contains a nested-name-specifier which specifies a class-name that
6344 names a dependent type.
6346 We generalize this to just say that the address of a member of a
6347 dependent class is value-dependent; the above doesn't cover the
6348 address of a static data member named with an unqualified-id. */
6351 has_value_dependent_address (tree op
)
6353 /* We could use get_inner_reference here, but there's no need;
6354 this is only relevant for template non-type arguments, which
6355 can only be expressed as &id-expression. */
6358 tree ctx
= CP_DECL_CONTEXT (op
);
6359 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
6366 /* The next set of functions are used for providing helpful explanatory
6367 diagnostics for failed overload resolution. Their messages should be
6368 indented by two spaces for consistency with the messages in
6372 unify_success (bool /*explain_p*/)
6377 /* Other failure functions should call this one, to provide a single function
6378 for setting a breakpoint on. */
6381 unify_invalid (bool /*explain_p*/)
6387 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
6390 inform (input_location
,
6391 " couldn%'t deduce template parameter %qD", parm
);
6392 return unify_invalid (explain_p
);
6396 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
6399 inform (input_location
,
6400 " types %qT and %qT have incompatible cv-qualifiers",
6402 return unify_invalid (explain_p
);
6406 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
6409 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
6410 return unify_invalid (explain_p
);
6414 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
6417 inform (input_location
,
6418 " template parameter %qD is not a parameter pack, but "
6421 return unify_invalid (explain_p
);
6425 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
6428 inform (input_location
,
6429 " template argument %qE does not match "
6430 "pointer-to-member constant %qE",
6432 return unify_invalid (explain_p
);
6436 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
6439 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
6440 return unify_invalid (explain_p
);
6444 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
6447 inform (input_location
,
6448 " inconsistent parameter pack deduction with %qT and %qT",
6450 return unify_invalid (explain_p
);
6454 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
6459 inform (input_location
,
6460 " deduced conflicting types for parameter %qT (%qT and %qT)",
6461 parm
, first
, second
);
6463 inform (input_location
,
6464 " deduced conflicting values for non-type parameter "
6465 "%qE (%qE and %qE)", parm
, first
, second
);
6467 return unify_invalid (explain_p
);
6471 unify_vla_arg (bool explain_p
, tree arg
)
6474 inform (input_location
,
6475 " variable-sized array type %qT is not "
6476 "a valid template argument",
6478 return unify_invalid (explain_p
);
6482 unify_method_type_error (bool explain_p
, tree arg
)
6485 inform (input_location
,
6486 " member function type %qT is not a valid template argument",
6488 return unify_invalid (explain_p
);
6492 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
6497 inform_n (input_location
, wanted
,
6498 " candidate expects at least %d argument, %d provided",
6499 " candidate expects at least %d arguments, %d provided",
6502 inform_n (input_location
, wanted
,
6503 " candidate expects %d argument, %d provided",
6504 " candidate expects %d arguments, %d provided",
6507 return unify_invalid (explain_p
);
6511 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
6513 return unify_arity (explain_p
, have
, wanted
);
6517 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
6518 bool least_p
= false)
6520 return unify_arity (explain_p
, have
, wanted
, least_p
);
6524 unify_arg_conversion (bool explain_p
, tree to_type
,
6525 tree from_type
, tree arg
)
6528 inform (cp_expr_loc_or_input_loc (arg
),
6529 " cannot convert %qE (type %qT) to type %qT",
6530 arg
, from_type
, to_type
);
6531 return unify_invalid (explain_p
);
6535 unify_no_common_base (bool explain_p
, enum template_base_result r
,
6536 tree parm
, tree arg
)
6541 case tbr_ambiguous_baseclass
:
6542 inform (input_location
, " %qT is an ambiguous base class of %qT",
6546 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
6549 return unify_invalid (explain_p
);
6553 unify_inconsistent_template_template_parameters (bool explain_p
)
6556 inform (input_location
,
6557 " template parameters of a template template argument are "
6558 "inconsistent with other deduced template arguments");
6559 return unify_invalid (explain_p
);
6563 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
6566 inform (input_location
,
6567 " cannot deduce a template for %qT from non-template type %qT",
6569 return unify_invalid (explain_p
);
6573 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
6576 inform (input_location
,
6577 " template argument %qE does not match %qE", arg
, parm
);
6578 return unify_invalid (explain_p
);
6581 /* True if T is a C++20 template parameter object to store the argument for a
6582 template parameter of class type. */
6585 template_parm_object_p (const_tree t
)
6587 return (TREE_CODE (t
) == VAR_DECL
&& DECL_ARTIFICIAL (t
) && DECL_NAME (t
)
6588 && !strncmp (IDENTIFIER_POINTER (DECL_NAME (t
)), "_ZTA", 4));
6591 /* Subroutine of convert_nontype_argument, to check whether EXPR, as an
6592 argument for TYPE, points to an unsuitable object. */
6595 invalid_tparm_referent_p (tree type
, tree expr
, tsubst_flags_t complain
)
6597 switch (TREE_CODE (expr
))
6600 return invalid_tparm_referent_p (type
, TREE_OPERAND (expr
, 0),
6604 return invalid_tparm_referent_p (type
, TARGET_EXPR_INITIAL (expr
),
6609 unsigned i
; tree elt
;
6610 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), i
, elt
)
6611 if (invalid_tparm_referent_p (TREE_TYPE (elt
), elt
, complain
))
6618 tree decl
= TREE_OPERAND (expr
, 0);
6622 if (complain
& tf_error
)
6623 error ("%qE is not a valid template argument of type %qT "
6624 "because %qE is not a variable", expr
, type
, decl
);
6627 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
6629 if (complain
& tf_error
)
6630 error ("%qE is not a valid template argument of type %qT "
6631 "in C++98 because %qD does not have external linkage",
6635 else if ((cxx_dialect
>= cxx11
&& cxx_dialect
< cxx17
)
6636 && decl_linkage (decl
) == lk_none
)
6638 if (complain
& tf_error
)
6639 error ("%qE is not a valid template argument of type %qT "
6640 "because %qD has no linkage", expr
, type
, decl
);
6643 /* C++17: For a non-type template-parameter of reference or pointer
6644 type, the value of the constant expression shall not refer to (or
6645 for a pointer type, shall not be the address of):
6646 * a subobject (4.5),
6647 * a temporary object (15.2),
6648 * a string literal (5.13.5),
6649 * the result of a typeid expression (8.2.8), or
6650 * a predefined __func__ variable (11.4.1). */
6651 else if (DECL_ARTIFICIAL (decl
))
6653 if (complain
& tf_error
)
6654 error ("the address of %qD is not a valid template argument",
6658 else if (!same_type_ignoring_top_level_qualifiers_p
6659 (strip_array_types (TREE_TYPE (type
)),
6660 strip_array_types (TREE_TYPE (decl
))))
6662 if (complain
& tf_error
)
6663 error ("the address of the %qT subobject of %qD is not a "
6664 "valid template argument", TREE_TYPE (type
), decl
);
6667 else if (!TREE_STATIC (decl
) && !DECL_EXTERNAL (decl
))
6669 if (complain
& tf_error
)
6670 error ("the address of %qD is not a valid template argument "
6671 "because it does not have static storage duration",
6679 if (!INDIRECT_TYPE_P (type
))
6680 /* We're only concerned about pointers and references here. */;
6681 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6682 /* Null pointer values are OK in C++11. */;
6687 if (complain
& tf_error
)
6688 error ("%qD is not a valid template argument "
6689 "because %qD is a variable, not the address of "
6690 "a variable", expr
, expr
);
6695 if (complain
& tf_error
)
6696 error ("%qE is not a valid template argument for %qT "
6697 "because it is not the address of a variable",
6707 /* Return a VAR_DECL for the C++20 template parameter object corresponding to
6708 template argument EXPR. */
6711 get_template_parm_object (tree expr
, tsubst_flags_t complain
)
6713 if (TREE_CODE (expr
) == TARGET_EXPR
)
6714 expr
= TARGET_EXPR_INITIAL (expr
);
6716 if (!TREE_CONSTANT (expr
))
6718 if ((complain
& tf_error
)
6719 && require_rvalue_constant_expression (expr
))
6720 cxx_constant_value (expr
);
6721 return error_mark_node
;
6723 if (invalid_tparm_referent_p (TREE_TYPE (expr
), expr
, complain
))
6724 return error_mark_node
;
6726 tree name
= mangle_template_parm_object (expr
);
6727 tree decl
= get_global_binding (name
);
6731 tree type
= cp_build_qualified_type (TREE_TYPE (expr
), TYPE_QUAL_CONST
);
6732 decl
= create_temporary_var (type
);
6733 TREE_STATIC (decl
) = true;
6734 DECL_DECLARED_CONSTEXPR_P (decl
) = true;
6735 TREE_READONLY (decl
) = true;
6736 DECL_NAME (decl
) = name
;
6737 SET_DECL_ASSEMBLER_NAME (decl
, name
);
6738 DECL_CONTEXT (decl
) = global_namespace
;
6739 comdat_linkage (decl
);
6740 pushdecl_top_level_and_finish (decl
, expr
);
6744 /* Attempt to convert the non-type template parameter EXPR to the
6745 indicated TYPE. If the conversion is successful, return the
6746 converted value. If the conversion is unsuccessful, return
6747 NULL_TREE if we issued an error message, or error_mark_node if we
6748 did not. We issue error messages for out-and-out bad template
6749 parameters, but not simply because the conversion failed, since we
6750 might be just trying to do argument deduction. Both TYPE and EXPR
6751 must be non-dependent.
6753 The conversion follows the special rules described in
6754 [temp.arg.nontype], and it is much more strict than an implicit
6757 This function is called twice for each template argument (see
6758 lookup_template_class for a more accurate description of this
6759 problem). This means that we need to handle expressions which
6760 are not valid in a C++ source, but can be created from the
6761 first call (for instance, casts to perform conversions). These
6762 hacks can go away after we fix the double coercion problem. */
6765 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
6768 location_t loc
= cp_expr_loc_or_input_loc (expr
);
6770 /* Detect immediately string literals as invalid non-type argument.
6771 This special-case is not needed for correctness (we would easily
6772 catch this later), but only to provide better diagnostic for this
6773 common user mistake. As suggested by DR 100, we do not mention
6774 linkage issues in the diagnostic as this is not the point. */
6775 if (TREE_CODE (expr
) == STRING_CST
&& !CLASS_TYPE_P (type
))
6777 if (complain
& tf_error
)
6778 error ("%qE is not a valid template argument for type %qT "
6779 "because string literals can never be used in this context",
6784 /* Add the ADDR_EXPR now for the benefit of
6785 value_dependent_expression_p. */
6786 if (TYPE_PTROBV_P (type
)
6787 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
6789 expr
= decay_conversion (expr
, complain
);
6790 if (expr
== error_mark_node
)
6791 return error_mark_node
;
6794 /* If we are in a template, EXPR may be non-dependent, but still
6795 have a syntactic, rather than semantic, form. For example, EXPR
6796 might be a SCOPE_REF, rather than the VAR_DECL to which the
6797 SCOPE_REF refers. Preserving the qualifying scope is necessary
6798 so that access checking can be performed when the template is
6799 instantiated -- but here we need the resolved form so that we can
6800 convert the argument. */
6801 bool non_dep
= false;
6802 if (TYPE_REF_OBJ_P (type
)
6803 && has_value_dependent_address (expr
))
6804 /* If we want the address and it's value-dependent, don't fold. */;
6805 else if (processing_template_decl
6806 && is_nondependent_constant_expression (expr
))
6808 if (error_operand_p (expr
))
6809 return error_mark_node
;
6810 expr_type
= TREE_TYPE (expr
);
6812 /* If the argument is non-dependent, perform any conversions in
6813 non-dependent context as well. */
6814 processing_template_decl_sentinel
s (non_dep
);
6816 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
6818 if (value_dependent_expression_p (expr
))
6819 expr
= canonicalize_expr_argument (expr
, complain
);
6821 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
6822 to a non-type argument of "nullptr". */
6823 if (NULLPTR_TYPE_P (expr_type
) && TYPE_PTR_OR_PTRMEM_P (type
))
6824 expr
= fold_simple (convert (type
, expr
));
6826 /* In C++11, integral or enumeration non-type template arguments can be
6827 arbitrary constant expressions. Pointer and pointer to
6828 member arguments can be general constant expressions that evaluate
6829 to a null value, but otherwise still need to be of a specific form. */
6830 if (cxx_dialect
>= cxx11
)
6832 if (TREE_CODE (expr
) == PTRMEM_CST
&& TYPE_PTRMEM_P (type
))
6833 /* A PTRMEM_CST is already constant, and a valid template
6834 argument for a parameter of pointer to member type, we just want
6835 to leave it in that form rather than lower it to a
6837 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
6838 || cxx_dialect
>= cxx17
)
6840 /* Calling build_converted_constant_expr might create a call to
6841 a conversion function with a value-dependent argument, which
6842 could invoke taking the address of a temporary representing
6843 the result of the conversion. */
6844 if (COMPOUND_LITERAL_P (expr
)
6845 && CONSTRUCTOR_IS_DEPENDENT (expr
)
6846 && MAYBE_CLASS_TYPE_P (expr_type
)
6847 && TYPE_HAS_CONVERSION (expr_type
))
6849 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
6850 IMPLICIT_CONV_EXPR_NONTYPE_ARG (expr
) = true;
6853 /* C++17: A template-argument for a non-type template-parameter shall
6854 be a converted constant expression (8.20) of the type of the
6855 template-parameter. */
6856 expr
= build_converted_constant_expr (type
, expr
, complain
);
6857 if (expr
== error_mark_node
)
6858 /* Make sure we return NULL_TREE only if we have really issued
6859 an error, as described above. */
6860 return (complain
& tf_error
) ? NULL_TREE
: error_mark_node
;
6861 expr
= maybe_constant_value (expr
, NULL_TREE
,
6862 /*manifestly_const_eval=*/true);
6863 expr
= convert_from_reference (expr
);
6865 else if (TYPE_PTR_OR_PTRMEM_P (type
))
6867 tree folded
= maybe_constant_value (expr
, NULL_TREE
,
6868 /*manifestly_const_eval=*/true);
6869 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
6870 : null_member_pointer_value_p (folded
))
6875 if (TYPE_REF_P (type
))
6876 expr
= mark_lvalue_use (expr
);
6878 expr
= mark_rvalue_use (expr
);
6880 /* HACK: Due to double coercion, we can get a
6881 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
6882 which is the tree that we built on the first call (see
6883 below when coercing to reference to object or to reference to
6884 function). We just strip everything and get to the arg.
6885 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
6887 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
6889 tree probe_type
, probe
= expr
;
6890 if (REFERENCE_REF_P (probe
))
6891 probe
= TREE_OPERAND (probe
, 0);
6892 probe_type
= TREE_TYPE (probe
);
6893 if (TREE_CODE (probe
) == NOP_EXPR
)
6895 /* ??? Maybe we could use convert_from_reference here, but we
6896 would need to relax its constraints because the NOP_EXPR
6897 could actually change the type to something more cv-qualified,
6898 and this is not folded by convert_from_reference. */
6899 tree addr
= TREE_OPERAND (probe
, 0);
6900 if (TYPE_REF_P (probe_type
)
6901 && TREE_CODE (addr
) == ADDR_EXPR
6902 && TYPE_PTR_P (TREE_TYPE (addr
))
6903 && (same_type_ignoring_top_level_qualifiers_p
6904 (TREE_TYPE (probe_type
),
6905 TREE_TYPE (TREE_TYPE (addr
)))))
6907 expr
= TREE_OPERAND (addr
, 0);
6908 expr_type
= TREE_TYPE (probe_type
);
6913 /* [temp.arg.nontype]/5, bullet 1
6915 For a non-type template-parameter of integral or enumeration type,
6916 integral promotions (_conv.prom_) and integral conversions
6917 (_conv.integral_) are applied. */
6918 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6920 if (cxx_dialect
< cxx11
)
6922 tree t
= build_converted_constant_expr (type
, expr
, complain
);
6923 t
= maybe_constant_value (t
);
6924 if (t
!= error_mark_node
)
6928 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
6929 return error_mark_node
;
6931 /* Notice that there are constant expressions like '4 % 0' which
6932 do not fold into integer constants. */
6933 if (TREE_CODE (expr
) != INTEGER_CST
6934 && !value_dependent_expression_p (expr
))
6936 if (complain
& tf_error
)
6938 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
6939 if (!require_potential_constant_expression (expr
))
6940 expr
= error_mark_node
;
6942 expr
= cxx_constant_value (expr
);
6943 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
6944 inform (loc
, "in template argument for type %qT", type
);
6945 if (expr
== error_mark_node
)
6947 /* else cxx_constant_value complained but gave us
6948 a real constant, so go ahead. */
6949 if (TREE_CODE (expr
) != INTEGER_CST
)
6951 /* Some assemble time constant expressions like
6952 (intptr_t)&&lab1 - (intptr_t)&&lab2 or
6953 4 + (intptr_t)&&var satisfy reduced_constant_expression_p
6954 as we can emit them into .rodata initializers of
6955 variables, yet they can't fold into an INTEGER_CST at
6956 compile time. Refuse them here. */
6957 gcc_checking_assert (reduced_constant_expression_p (expr
));
6958 error_at (loc
, "template argument %qE for type %qT not "
6959 "a constant integer", expr
, type
);
6967 /* Avoid typedef problems. */
6968 if (TREE_TYPE (expr
) != type
)
6969 expr
= fold_convert (type
, expr
);
6971 /* [temp.arg.nontype]/5, bullet 2
6973 For a non-type template-parameter of type pointer to object,
6974 qualification conversions (_conv.qual_) and the array-to-pointer
6975 conversion (_conv.array_) are applied. */
6976 else if (TYPE_PTROBV_P (type
))
6978 tree decayed
= expr
;
6980 /* Look through any NOP_EXPRs around an ADDR_EXPR, whether they come from
6981 decay_conversion or an explicit cast. If it's a problematic cast,
6982 we'll complain about it below. */
6983 if (TREE_CODE (expr
) == NOP_EXPR
)
6987 if (TREE_CODE (probe
) == ADDR_EXPR
6988 && TYPE_PTR_P (TREE_TYPE (probe
)))
6991 expr_type
= TREE_TYPE (expr
);
6995 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
6997 A template-argument for a non-type, non-template template-parameter
6998 shall be one of: [...]
7000 -- the name of a non-type template-parameter;
7001 -- the address of an object or function with external linkage, [...]
7002 expressed as "& id-expression" where the & is optional if the name
7003 refers to a function or array, or if the corresponding
7004 template-parameter is a reference.
7006 Here, we do not care about functions, as they are invalid anyway
7007 for a parameter of type pointer-to-object. */
7009 if (value_dependent_expression_p (expr
))
7010 /* Non-type template parameters are OK. */
7012 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
7013 /* Null pointer values are OK in C++11. */;
7014 else if (TREE_CODE (expr
) != ADDR_EXPR
7015 && !INDIRECT_TYPE_P (expr_type
))
7016 /* Other values, like integer constants, might be valid
7017 non-type arguments of some other type. */
7018 return error_mark_node
;
7019 else if (invalid_tparm_referent_p (type
, expr
, complain
))
7024 expr
= perform_qualification_conversions (type
, expr
);
7025 if (expr
== error_mark_node
)
7026 return error_mark_node
;
7028 /* [temp.arg.nontype]/5, bullet 3
7030 For a non-type template-parameter of type reference to object, no
7031 conversions apply. The type referred to by the reference may be more
7032 cv-qualified than the (otherwise identical) type of the
7033 template-argument. The template-parameter is bound directly to the
7034 template-argument, which must be an lvalue. */
7035 else if (TYPE_REF_OBJ_P (type
))
7037 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
7039 return error_mark_node
;
7041 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
7043 if (complain
& tf_error
)
7044 error ("%qE is not a valid template argument for type %qT "
7045 "because of conflicts in cv-qualification", expr
, type
);
7049 if (!lvalue_p (expr
))
7051 if (complain
& tf_error
)
7052 error ("%qE is not a valid template argument for type %qT "
7053 "because it is not an lvalue", expr
, type
);
7057 /* [temp.arg.nontype]/1
7059 A template-argument for a non-type, non-template template-parameter
7060 shall be one of: [...]
7062 -- the address of an object or function with external linkage. */
7063 if (INDIRECT_REF_P (expr
)
7064 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
7066 expr
= TREE_OPERAND (expr
, 0);
7069 if (complain
& tf_error
)
7070 error ("%q#D is not a valid template argument for type %qT "
7071 "because a reference variable does not have a constant "
7072 "address", expr
, type
);
7077 if (TYPE_REF_OBJ_P (TREE_TYPE (expr
))
7078 && value_dependent_expression_p (expr
))
7079 /* OK, dependent reference. We don't want to ask whether a DECL is
7080 itself value-dependent, since what we want here is its address. */;
7083 expr
= build_address (expr
);
7085 if (invalid_tparm_referent_p (type
, expr
, complain
))
7089 if (!same_type_p (type
, TREE_TYPE (expr
)))
7090 expr
= build_nop (type
, expr
);
7092 /* [temp.arg.nontype]/5, bullet 4
7094 For a non-type template-parameter of type pointer to function, only
7095 the function-to-pointer conversion (_conv.func_) is applied. If the
7096 template-argument represents a set of overloaded functions (or a
7097 pointer to such), the matching function is selected from the set
7099 else if (TYPE_PTRFN_P (type
))
7101 /* If the argument is a template-id, we might not have enough
7102 context information to decay the pointer. */
7103 if (!type_unknown_p (expr_type
))
7105 expr
= decay_conversion (expr
, complain
);
7106 if (expr
== error_mark_node
)
7107 return error_mark_node
;
7110 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
7111 /* Null pointer values are OK in C++11. */
7112 return perform_qualification_conversions (type
, expr
);
7114 expr
= convert_nontype_argument_function (type
, expr
, complain
);
7115 if (!expr
|| expr
== error_mark_node
)
7118 /* [temp.arg.nontype]/5, bullet 5
7120 For a non-type template-parameter of type reference to function, no
7121 conversions apply. If the template-argument represents a set of
7122 overloaded functions, the matching function is selected from the set
7124 else if (TYPE_REFFN_P (type
))
7126 if (TREE_CODE (expr
) == ADDR_EXPR
)
7128 if (complain
& tf_error
)
7130 error ("%qE is not a valid template argument for type %qT "
7131 "because it is a pointer", expr
, type
);
7132 inform (input_location
, "try using %qE instead",
7133 TREE_OPERAND (expr
, 0));
7138 expr
= convert_nontype_argument_function (type
, expr
, complain
);
7139 if (!expr
|| expr
== error_mark_node
)
7142 /* [temp.arg.nontype]/5, bullet 6
7144 For a non-type template-parameter of type pointer to member function,
7145 no conversions apply. If the template-argument represents a set of
7146 overloaded member functions, the matching member function is selected
7147 from the set (_over.over_). */
7148 else if (TYPE_PTRMEMFUNC_P (type
))
7150 expr
= instantiate_type (type
, expr
, tf_none
);
7151 if (expr
== error_mark_node
)
7152 return error_mark_node
;
7154 /* [temp.arg.nontype] bullet 1 says the pointer to member
7155 expression must be a pointer-to-member constant. */
7156 if (!value_dependent_expression_p (expr
)
7157 && !check_valid_ptrmem_cst_expr (type
, expr
, complain
))
7160 /* Repeated conversion can't deal with a conversion that turns PTRMEM_CST
7161 into a CONSTRUCTOR, so build up a new PTRMEM_CST instead. */
7162 if (fnptr_conv_p (type
, TREE_TYPE (expr
)))
7163 expr
= make_ptrmem_cst (type
, PTRMEM_CST_MEMBER (expr
));
7165 /* [temp.arg.nontype]/5, bullet 7
7167 For a non-type template-parameter of type pointer to data member,
7168 qualification conversions (_conv.qual_) are applied. */
7169 else if (TYPE_PTRDATAMEM_P (type
))
7171 /* [temp.arg.nontype] bullet 1 says the pointer to member
7172 expression must be a pointer-to-member constant. */
7173 if (!value_dependent_expression_p (expr
)
7174 && !check_valid_ptrmem_cst_expr (type
, expr
, complain
))
7177 expr
= perform_qualification_conversions (type
, expr
);
7178 if (expr
== error_mark_node
)
7181 else if (NULLPTR_TYPE_P (type
))
7183 if (!NULLPTR_TYPE_P (TREE_TYPE (expr
)))
7185 if (complain
& tf_error
)
7186 error ("%qE is not a valid template argument for type %qT "
7187 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
7192 else if (CLASS_TYPE_P (type
))
7194 /* Replace the argument with a reference to the corresponding template
7195 parameter object. */
7196 if (!value_dependent_expression_p (expr
))
7197 expr
= get_template_parm_object (expr
, complain
);
7198 if (expr
== error_mark_node
)
7201 /* A template non-type parameter must be one of the above. */
7205 /* Sanity check: did we actually convert the argument to the
7207 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7208 (type
, TREE_TYPE (expr
)));
7209 return convert_from_reference (expr
);
7212 /* Subroutine of coerce_template_template_parms, which returns 1 if
7213 PARM_PARM and ARG_PARM match using the rule for the template
7214 parameters of template template parameters. Both PARM and ARG are
7215 template parameters; the rest of the arguments are the same as for
7216 coerce_template_template_parms.
7219 coerce_template_template_parm (tree parm
,
7221 tsubst_flags_t complain
,
7225 if (arg
== NULL_TREE
|| error_operand_p (arg
)
7226 || parm
== NULL_TREE
|| error_operand_p (parm
))
7229 if (TREE_CODE (arg
) != TREE_CODE (parm
))
7232 switch (TREE_CODE (parm
))
7235 /* We encounter instantiations of templates like
7236 template <template <template <class> class> class TT>
7239 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
7240 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
7242 if (!coerce_template_template_parms
7243 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
7249 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
7250 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
7251 /* Argument is a parameter pack but parameter is not. */
7256 /* The tsubst call is used to handle cases such as
7258 template <int> class C {};
7259 template <class T, template <T> class TT> class D {};
7262 i.e. the parameter list of TT depends on earlier parameters. */
7263 if (!uses_template_parms (TREE_TYPE (arg
)))
7265 tree t
= tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
);
7266 if (!uses_template_parms (t
)
7267 && !same_type_p (t
, TREE_TYPE (arg
)))
7271 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
7272 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
7273 /* Argument is a parameter pack but parameter is not. */
7285 /* Coerce template argument list ARGLIST for use with template
7286 template-parameter TEMPL. */
7289 coerce_template_args_for_ttp (tree templ
, tree arglist
,
7290 tsubst_flags_t complain
)
7292 /* Consider an example where a template template parameter declared as
7294 template <class T, class U = std::allocator<T> > class TT
7296 The template parameter level of T and U are one level larger than
7297 of TT. To proper process the default argument of U, say when an
7298 instantiation `TT<int>' is seen, we need to build the full
7299 arguments containing {int} as the innermost level. Outer levels,
7300 available when not appearing as default template argument, can be
7301 obtained from the arguments of the enclosing template.
7303 Suppose that TT is later substituted with std::vector. The above
7304 instantiation is `TT<int, std::allocator<T> >' with TT at
7305 level 1, and T at level 2, while the template arguments at level 1
7306 becomes {std::vector} and the inner level 2 is {int}. */
7308 tree outer
= DECL_CONTEXT (templ
);
7311 if (DECL_TEMPLATE_SPECIALIZATION (outer
))
7312 /* We want arguments for the partial specialization, not arguments for
7313 the primary template. */
7314 outer
= template_parms_to_args (DECL_TEMPLATE_PARMS (outer
));
7316 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
7318 else if (current_template_parms
)
7320 /* This is an argument of the current template, so we haven't set
7321 DECL_CONTEXT yet. */
7322 tree relevant_template_parms
;
7324 /* Parameter levels that are greater than the level of the given
7325 template template parm are irrelevant. */
7326 relevant_template_parms
= current_template_parms
;
7327 while (TMPL_PARMS_DEPTH (relevant_template_parms
)
7328 != TEMPLATE_TYPE_LEVEL (TREE_TYPE (templ
)))
7329 relevant_template_parms
= TREE_CHAIN (relevant_template_parms
);
7331 outer
= template_parms_to_args (relevant_template_parms
);
7335 arglist
= add_to_template_args (outer
, arglist
);
7337 tree parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
7338 return coerce_template_parms (parmlist
, arglist
, templ
,
7340 /*require_all_args=*/true,
7341 /*use_default_args=*/true);
7344 /* A cache of template template parameters with match-all default
7346 static GTY((deletable
)) hash_map
<tree
,tree
> *defaulted_ttp_cache
;
7348 store_defaulted_ttp (tree v
, tree t
)
7350 if (!defaulted_ttp_cache
)
7351 defaulted_ttp_cache
= hash_map
<tree
,tree
>::create_ggc (13);
7352 defaulted_ttp_cache
->put (v
, t
);
7355 lookup_defaulted_ttp (tree v
)
7357 if (defaulted_ttp_cache
)
7358 if (tree
*p
= defaulted_ttp_cache
->get (v
))
7363 /* T is a bound template template-parameter. Copy its arguments into default
7364 arguments of the template template-parameter's template parameters. */
7367 add_defaults_to_ttp (tree otmpl
)
7369 if (tree c
= lookup_defaulted_ttp (otmpl
))
7372 tree ntmpl
= copy_node (otmpl
);
7374 tree ntype
= copy_node (TREE_TYPE (otmpl
));
7375 TYPE_STUB_DECL (ntype
) = TYPE_NAME (ntype
) = ntmpl
;
7376 TYPE_MAIN_VARIANT (ntype
) = ntype
;
7377 TYPE_POINTER_TO (ntype
) = TYPE_REFERENCE_TO (ntype
) = NULL_TREE
;
7378 TYPE_NAME (ntype
) = ntmpl
;
7379 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
7381 tree idx
= TEMPLATE_TYPE_PARM_INDEX (ntype
)
7382 = copy_node (TEMPLATE_TYPE_PARM_INDEX (ntype
));
7383 TEMPLATE_PARM_DECL (idx
) = ntmpl
;
7384 TREE_TYPE (ntmpl
) = TREE_TYPE (idx
) = ntype
;
7386 tree oparms
= DECL_TEMPLATE_PARMS (otmpl
);
7387 tree parms
= DECL_TEMPLATE_PARMS (ntmpl
) = copy_node (oparms
);
7388 TREE_CHAIN (parms
) = TREE_CHAIN (oparms
);
7389 tree vec
= TREE_VALUE (parms
) = copy_node (TREE_VALUE (parms
));
7390 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
7392 tree o
= TREE_VEC_ELT (vec
, i
);
7393 if (!template_parameter_pack_p (TREE_VALUE (o
)))
7395 tree n
= TREE_VEC_ELT (vec
, i
) = copy_node (o
);
7396 TREE_PURPOSE (n
) = any_targ_node
;
7400 store_defaulted_ttp (otmpl
, ntmpl
);
7404 /* ARG is a bound potential template template-argument, and PARGS is a list
7405 of arguments for the corresponding template template-parameter. Adjust
7406 PARGS as appropriate for application to ARG's template, and if ARG is a
7407 BOUND_TEMPLATE_TEMPLATE_PARM, possibly adjust it to add default template
7408 arguments to the template template parameter. */
7411 coerce_ttp_args_for_tta (tree
& arg
, tree pargs
, tsubst_flags_t complain
)
7413 ++processing_template_decl
;
7414 tree arg_tmpl
= TYPE_TI_TEMPLATE (arg
);
7415 if (DECL_TEMPLATE_TEMPLATE_PARM_P (arg_tmpl
))
7417 /* When comparing two template template-parameters in partial ordering,
7418 rewrite the one currently being used as an argument to have default
7419 arguments for all parameters. */
7420 arg_tmpl
= add_defaults_to_ttp (arg_tmpl
);
7421 pargs
= coerce_template_args_for_ttp (arg_tmpl
, pargs
, complain
);
7422 if (pargs
!= error_mark_node
)
7423 arg
= bind_template_template_parm (TREE_TYPE (arg_tmpl
),
7424 TYPE_TI_ARGS (arg
));
7429 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (arg_tmpl
));
7430 pargs
= coerce_template_parms (aparms
, pargs
, arg_tmpl
, complain
,
7431 /*require_all*/true,
7432 /*use_default*/true);
7434 --processing_template_decl
;
7438 /* Subroutine of unify for the case when PARM is a
7439 BOUND_TEMPLATE_TEMPLATE_PARM. */
7442 unify_bound_ttp_args (tree tparms
, tree targs
, tree parm
, tree
& arg
,
7445 tree parmvec
= TYPE_TI_ARGS (parm
);
7446 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
7448 /* The template template parm might be variadic and the argument
7449 not, so flatten both argument lists. */
7450 parmvec
= expand_template_argument_pack (parmvec
);
7451 argvec
= expand_template_argument_pack (argvec
);
7455 /* In keeping with P0522R0, adjust P's template arguments
7456 to apply to A's template; then flatten it again. */
7457 tree nparmvec
= coerce_ttp_args_for_tta (arg
, parmvec
, tf_none
);
7458 nparmvec
= expand_template_argument_pack (nparmvec
);
7460 if (unify (tparms
, targs
, nparmvec
, argvec
,
7461 UNIFY_ALLOW_NONE
, explain_p
))
7464 /* If the P0522 adjustment eliminated a pack expansion, deduce
7467 && TREE_VEC_LENGTH (nparmvec
) < TREE_VEC_LENGTH (parmvec
)
7468 && unify_pack_expansion (tparms
, targs
, parmvec
, argvec
,
7469 DEDUCE_EXACT
, /*sub*/true, explain_p
))
7474 /* Deduce arguments T, i from TT<T> or TT<i>.
7475 We check each element of PARMVEC and ARGVEC individually
7476 rather than the whole TREE_VEC since they can have
7477 different number of elements, which is allowed under N2555. */
7479 int len
= TREE_VEC_LENGTH (parmvec
);
7481 /* Check if the parameters end in a pack, making them
7483 int parm_variadic_p
= 0;
7485 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
7486 parm_variadic_p
= 1;
7488 for (int i
= 0; i
< len
- parm_variadic_p
; ++i
)
7489 /* If the template argument list of P contains a pack
7490 expansion that is not the last template argument, the
7491 entire template argument list is a non-deduced
7493 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
7494 return unify_success (explain_p
);
7496 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
7497 return unify_too_few_arguments (explain_p
,
7498 TREE_VEC_LENGTH (argvec
), len
);
7500 for (int i
= 0; i
< len
- parm_variadic_p
; ++i
)
7501 if (unify (tparms
, targs
,
7502 TREE_VEC_ELT (parmvec
, i
),
7503 TREE_VEC_ELT (argvec
, i
),
7504 UNIFY_ALLOW_NONE
, explain_p
))
7508 && unify_pack_expansion (tparms
, targs
,
7511 /*subr=*/true, explain_p
))
7518 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
7519 template template parameters. Both PARM_PARMS and ARG_PARMS are
7520 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
7523 Consider the example:
7524 template <class T> class A;
7525 template<template <class U> class TT> class B;
7527 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
7528 the parameters to A, and OUTER_ARGS contains A. */
7531 coerce_template_template_parms (tree parm_parms
,
7533 tsubst_flags_t complain
,
7537 int nparms
, nargs
, i
;
7541 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
7542 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
7544 nparms
= TREE_VEC_LENGTH (parm_parms
);
7545 nargs
= TREE_VEC_LENGTH (arg_parms
);
7549 /* P0522R0: A template template-parameter P is at least as specialized as
7550 a template template-argument A if, given the following rewrite to two
7551 function templates, the function template corresponding to P is at
7552 least as specialized as the function template corresponding to A
7553 according to the partial ordering rules for function templates
7554 ([temp.func.order]). Given an invented class template X with the
7555 template parameter list of A (including default arguments):
7557 * Each of the two function templates has the same template parameters,
7558 respectively, as P or A.
7560 * Each function template has a single function parameter whose type is
7561 a specialization of X with template arguments corresponding to the
7562 template parameters from the respective function template where, for
7563 each template parameter PP in the template parameter list of the
7564 function template, a corresponding template argument AA is formed. If
7565 PP declares a parameter pack, then AA is the pack expansion
7566 PP... ([temp.variadic]); otherwise, AA is the id-expression PP.
7568 If the rewrite produces an invalid type, then P is not at least as
7569 specialized as A. */
7571 /* So coerce P's args to apply to A's parms, and then deduce between A's
7572 args and the converted args. If that succeeds, A is at least as
7573 specialized as P, so they match.*/
7574 tree pargs
= template_parms_level_to_args (parm_parms
);
7575 pargs
= add_outermost_template_args (outer_args
, pargs
);
7576 ++processing_template_decl
;
7577 pargs
= coerce_template_parms (arg_parms
, pargs
, NULL_TREE
, tf_none
,
7578 /*require_all*/true, /*use_default*/true);
7579 --processing_template_decl
;
7580 if (pargs
!= error_mark_node
)
7582 tree targs
= make_tree_vec (nargs
);
7583 tree aargs
= template_parms_level_to_args (arg_parms
);
7584 if (!unify (arg_parms
, targs
, aargs
, pargs
, UNIFY_ALLOW_NONE
,
7590 /* Determine whether we have a parameter pack at the end of the
7591 template template parameter's template parameter list. */
7592 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
7594 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
7596 if (error_operand_p (parm
))
7599 switch (TREE_CODE (parm
))
7603 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
7608 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
7618 && !(variadic_p
&& nargs
>= nparms
- 1))
7621 /* Check all of the template parameters except the parameter pack at
7622 the end (if any). */
7623 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
7625 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
7626 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
7629 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
7630 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
7632 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
7640 /* Check each of the template parameters in the template
7641 argument against the template parameter pack at the end of
7642 the template template parameter. */
7643 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
7646 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
7648 for (; i
< nargs
; ++i
)
7650 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
7653 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
7655 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
7664 /* Verifies that the deduced template arguments (in TARGS) for the
7665 template template parameters (in TPARMS) represent valid bindings,
7666 by comparing the template parameter list of each template argument
7667 to the template parameter list of its corresponding template
7668 template parameter, in accordance with DR150. This
7669 routine can only be called after all template arguments have been
7670 deduced. It will return TRUE if all of the template template
7671 parameter bindings are okay, FALSE otherwise. */
7673 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
7675 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
7678 /* We're dealing with template parms in this process. */
7679 ++processing_template_decl
;
7681 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
7683 for (i
= 0; i
< ntparms
; ++i
)
7685 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
7686 tree targ
= TREE_VEC_ELT (targs
, i
);
7688 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
7690 tree packed_args
= NULL_TREE
;
7693 if (ARGUMENT_PACK_P (targ
))
7695 /* Look inside the argument pack. */
7696 packed_args
= ARGUMENT_PACK_ARGS (targ
);
7697 len
= TREE_VEC_LENGTH (packed_args
);
7700 for (idx
= 0; idx
< len
; ++idx
)
7702 tree targ_parms
= NULL_TREE
;
7705 /* Extract the next argument from the argument
7707 targ
= TREE_VEC_ELT (packed_args
, idx
);
7709 if (PACK_EXPANSION_P (targ
))
7710 /* Look at the pattern of the pack expansion. */
7711 targ
= PACK_EXPANSION_PATTERN (targ
);
7713 /* Extract the template parameters from the template
7715 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
7716 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
7717 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
7718 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
7720 /* Verify that we can coerce the template template
7721 parameters from the template argument to the template
7722 parameter. This requires an exact match. */
7724 && !coerce_template_template_parms
7725 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
7740 --processing_template_decl
;
7744 /* Since type attributes aren't mangled, we need to strip them from
7745 template type arguments. */
7748 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
7750 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
7752 bool removed_attributes
= false;
7753 tree canon
= strip_typedefs (arg
, &removed_attributes
);
7754 if (removed_attributes
7755 && (complain
& tf_warning
))
7756 warning (OPT_Wignored_attributes
,
7757 "ignoring attributes on template argument %qT", arg
);
7761 /* And from inside dependent non-type arguments like sizeof(Type). */
7764 canonicalize_expr_argument (tree arg
, tsubst_flags_t complain
)
7766 if (!arg
|| arg
== error_mark_node
)
7768 bool removed_attributes
= false;
7769 tree canon
= strip_typedefs_expr (arg
, &removed_attributes
);
7770 if (removed_attributes
7771 && (complain
& tf_warning
))
7772 warning (OPT_Wignored_attributes
,
7773 "ignoring attributes in template argument %qE", arg
);
7777 // A template declaration can be substituted for a constrained
7778 // template template parameter only when the argument is more
7779 // constrained than the parameter.
7781 is_compatible_template_arg (tree parm
, tree arg
)
7783 tree parm_cons
= get_constraints (parm
);
7785 /* For now, allow constrained template template arguments
7786 and unconstrained template template parameters. */
7787 if (parm_cons
== NULL_TREE
)
7790 tree arg_cons
= get_constraints (arg
);
7792 // If the template parameter is constrained, we need to rewrite its
7793 // constraints in terms of the ARG's template parameters. This ensures
7794 // that all of the template parameter types will have the same depth.
7796 // Note that this is only valid when coerce_template_template_parm is
7797 // true for the innermost template parameters of PARM and ARG. In other
7798 // words, because coercion is successful, this conversion will be valid.
7801 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (arg
));
7802 parm_cons
= tsubst_constraint_info (parm_cons
,
7803 INNERMOST_TEMPLATE_ARGS (args
),
7804 tf_none
, NULL_TREE
);
7805 if (parm_cons
== error_mark_node
)
7809 return subsumes (parm_cons
, arg_cons
);
7812 // Convert a placeholder argument into a binding to the original
7813 // parameter. The original parameter is saved as the TREE_TYPE of
7816 convert_wildcard_argument (tree parm
, tree arg
)
7818 TREE_TYPE (arg
) = parm
;
7822 /* We can't fully resolve ARG given as a non-type template argument to TYPE,
7823 because one of them is dependent. But we need to represent the
7824 conversion for the benefit of cp_tree_equal. */
7827 maybe_convert_nontype_argument (tree type
, tree arg
)
7829 /* Auto parms get no conversion. */
7830 if (type_uses_auto (type
))
7832 /* We don't need or want to add this conversion now if we're going to use the
7833 argument for deduction. */
7834 if (value_dependent_expression_p (arg
))
7837 type
= cv_unqualified (type
);
7838 tree argtype
= TREE_TYPE (arg
);
7839 if (same_type_p (type
, argtype
))
7842 arg
= build1 (IMPLICIT_CONV_EXPR
, type
, arg
);
7843 IMPLICIT_CONV_EXPR_NONTYPE_ARG (arg
) = true;
7847 /* Convert the indicated template ARG as necessary to match the
7848 indicated template PARM. Returns the converted ARG, or
7849 error_mark_node if the conversion was unsuccessful. Error and
7850 warning messages are issued under control of COMPLAIN. This
7851 conversion is for the Ith parameter in the parameter list. ARGS is
7852 the full set of template arguments deduced so far. */
7855 convert_template_argument (tree parm
,
7858 tsubst_flags_t complain
,
7864 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
7866 if (parm
== error_mark_node
|| error_operand_p (arg
))
7867 return error_mark_node
;
7869 /* Trivially convert placeholders. */
7870 if (TREE_CODE (arg
) == WILDCARD_DECL
)
7871 return convert_wildcard_argument (parm
, arg
);
7873 if (arg
== any_targ_node
)
7876 if (TREE_CODE (arg
) == TREE_LIST
7877 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
7879 /* The template argument was the name of some
7880 member function. That's usually
7881 invalid, but static members are OK. In any
7882 case, grab the underlying fields/functions
7883 and issue an error later if required. */
7884 TREE_TYPE (arg
) = unknown_type_node
;
7889 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
7890 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
7891 || requires_tmpl_type
);
7893 /* When determining whether an argument pack expansion is a template,
7894 look at the pattern. */
7895 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
7896 arg
= PACK_EXPANSION_PATTERN (arg
);
7898 /* Deal with an injected-class-name used as a template template arg. */
7899 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
7901 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
7902 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7904 if (cxx_dialect
>= cxx11
)
7905 /* OK under DR 1004. */;
7906 else if (complain
& tf_warning_or_error
)
7907 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
7908 " used as template template argument", TYPE_NAME (arg
));
7909 else if (flag_pedantic_errors
)
7917 ((TREE_CODE (arg
) == TEMPLATE_DECL
7918 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
7919 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
7920 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7921 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
7924 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7925 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
7926 arg
= TYPE_STUB_DECL (arg
);
7928 is_type
= TYPE_P (arg
) || is_tmpl_type
;
7930 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
7931 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
7933 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
7935 if (complain
& tf_error
)
7936 error ("invalid use of destructor %qE as a type", orig_arg
);
7937 return error_mark_node
;
7940 permerror (input_location
,
7941 "to refer to a type member of a template parameter, "
7942 "use %<typename %E%>", orig_arg
);
7944 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
7945 TREE_OPERAND (arg
, 1),
7951 if (is_type
!= requires_type
)
7955 if (complain
& tf_error
)
7957 error ("type/value mismatch at argument %d in template "
7958 "parameter list for %qD",
7962 /* The template argument is a type, but we're expecting
7964 inform (input_location
,
7965 " expected a constant of type %qT, got %qT",
7967 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
7968 /* [temp.arg]/2: "In a template-argument, an ambiguity
7969 between a type-id and an expression is resolved to a
7970 type-id, regardless of the form of the corresponding
7971 template-parameter." So give the user a clue. */
7972 if (TREE_CODE (arg
) == FUNCTION_TYPE
)
7973 inform (input_location
, " ambiguous template argument "
7974 "for non-type template parameter is treated as "
7977 else if (requires_tmpl_type
)
7978 inform (input_location
,
7979 " expected a class template, got %qE", orig_arg
);
7981 inform (input_location
,
7982 " expected a type, got %qE", orig_arg
);
7985 return error_mark_node
;
7987 if (is_tmpl_type
^ requires_tmpl_type
)
7989 if (in_decl
&& (complain
& tf_error
))
7991 error ("type/value mismatch at argument %d in template "
7992 "parameter list for %qD",
7995 inform (input_location
,
7996 " expected a type, got %qT", DECL_NAME (arg
));
7998 inform (input_location
,
7999 " expected a class template, got %qT", orig_arg
);
8001 return error_mark_node
;
8004 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
8005 /* We already did the appropriate conversion when packing args. */
8009 if (requires_tmpl_type
)
8011 if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
8012 /* The number of argument required is not known yet.
8013 Just accept it for now. */
8017 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
8020 /* Strip alias templates that are equivalent to another
8022 arg
= get_underlying_template (arg
);
8023 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
8025 if (coerce_template_template_parms (parmparm
, argparm
,
8031 /* TEMPLATE_TEMPLATE_PARM node is preferred over
8033 if (val
!= error_mark_node
)
8035 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
8036 val
= TREE_TYPE (val
);
8037 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
8038 val
= make_pack_expansion (val
, complain
);
8043 if (in_decl
&& (complain
& tf_error
))
8045 error ("type/value mismatch at argument %d in "
8046 "template parameter list for %qD",
8048 inform (input_location
,
8049 " expected a template of type %qD, got %qT",
8053 val
= error_mark_node
;
8056 // Check that the constraints are compatible before allowing the
8058 if (val
!= error_mark_node
)
8059 if (!is_compatible_template_arg (parm
, arg
))
8061 if (in_decl
&& (complain
& tf_error
))
8063 error ("constraint mismatch at argument %d in "
8064 "template parameter list for %qD",
8066 inform (input_location
, " expected %qD but got %qD",
8069 val
= error_mark_node
;
8075 /* We only form one instance of each template specialization.
8076 Therefore, if we use a non-canonical variant (i.e., a
8077 typedef), any future messages referring to the type will use
8078 the typedef, which is confusing if those future uses do not
8079 themselves also use the typedef. */
8081 val
= canonicalize_type_argument (val
, complain
);
8085 tree t
= TREE_TYPE (parm
);
8087 if (TEMPLATE_PARM_LEVEL (get_template_parm_index (parm
))
8088 > TMPL_ARGS_DEPTH (args
))
8089 /* We don't have enough levels of args to do any substitution. This
8090 can happen in the context of -fnew-ttp-matching. */;
8091 else if (tree a
= type_uses_auto (t
))
8093 t
= do_auto_deduction (t
, arg
, a
, complain
, adc_unify
, args
);
8094 if (t
== error_mark_node
)
8095 return error_mark_node
;
8098 t
= tsubst (t
, args
, complain
, in_decl
);
8100 if (invalid_nontype_parm_type_p (t
, complain
))
8101 return error_mark_node
;
8103 if (t
!= TREE_TYPE (parm
))
8104 t
= canonicalize_type_argument (t
, complain
);
8106 if (!type_dependent_expression_p (orig_arg
)
8107 && !uses_template_parms (t
))
8108 /* We used to call digest_init here. However, digest_init
8109 will report errors, which we don't want when complain
8110 is zero. More importantly, digest_init will try too
8111 hard to convert things: for example, `0' should not be
8112 converted to pointer type at this point according to
8113 the standard. Accepting this is not merely an
8114 extension, since deciding whether or not these
8115 conversions can occur is part of determining which
8116 function template to call, or whether a given explicit
8117 argument specification is valid. */
8118 val
= convert_nontype_argument (t
, orig_arg
, complain
);
8121 val
= canonicalize_expr_argument (orig_arg
, complain
);
8122 val
= maybe_convert_nontype_argument (t
, val
);
8126 if (val
== NULL_TREE
)
8127 val
= error_mark_node
;
8128 else if (val
== error_mark_node
&& (complain
& tf_error
))
8129 error ("could not convert template argument %qE from %qT to %qT",
8130 orig_arg
, TREE_TYPE (orig_arg
), t
);
8132 if (INDIRECT_REF_P (val
))
8134 /* Reject template arguments that are references to built-in
8135 functions with no library fallbacks. */
8136 const_tree inner
= TREE_OPERAND (val
, 0);
8137 const_tree innertype
= TREE_TYPE (inner
);
8139 && TYPE_REF_P (innertype
)
8140 && TREE_CODE (TREE_TYPE (innertype
)) == FUNCTION_TYPE
8141 && TREE_OPERAND_LENGTH (inner
) > 0
8142 && reject_gcc_builtin (TREE_OPERAND (inner
, 0)))
8143 return error_mark_node
;
8146 if (TREE_CODE (val
) == SCOPE_REF
)
8148 /* Strip typedefs from the SCOPE_REF. */
8149 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
8150 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
8152 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
8153 QUALIFIED_NAME_IS_TEMPLATE (val
));
8160 /* Coerces the remaining template arguments in INNER_ARGS (from
8161 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
8162 Returns the coerced argument pack. PARM_IDX is the position of this
8163 parameter in the template parameter list. ARGS is the original
8164 template argument list. */
8166 coerce_template_parameter_pack (tree parms
,
8174 tsubst_flags_t complain
)
8176 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
8177 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
8180 tree packed_parms
= NULL_TREE
;
8182 if (arg_idx
> nargs
)
8185 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
8187 /* When the template parameter is a non-type template parameter pack
8188 or template template parameter pack whose type or template
8189 parameters use parameter packs, we know exactly how many arguments
8190 we are looking for. Build a vector of the instantiated decls for
8191 these template parameters in PACKED_PARMS. */
8192 /* We can't use make_pack_expansion here because it would interpret a
8193 _DECL as a use rather than a declaration. */
8194 tree decl
= TREE_VALUE (parm
);
8195 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
8196 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
8197 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
8198 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
8200 TREE_VEC_LENGTH (args
)--;
8201 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
8202 TREE_VEC_LENGTH (args
)++;
8204 if (packed_parms
== error_mark_node
)
8205 return error_mark_node
;
8207 /* If we're doing a partial instantiation of a member template,
8208 verify that all of the types used for the non-type
8209 template parameter pack are, in fact, valid for non-type
8210 template parameters. */
8212 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
8214 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
8215 for (j
= 0; j
< len
; ++j
)
8217 tree t
= TREE_VEC_ELT (packed_parms
, j
);
8218 if (TREE_CODE (t
) == PARM_DECL
8219 && invalid_nontype_parm_type_p (TREE_TYPE (t
), complain
))
8220 return error_mark_node
;
8222 /* We don't know how many args we have yet, just
8223 use the unconverted ones for now. */
8227 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
8229 /* Check if we have a placeholder pack, which indicates we're
8230 in the context of a introduction list. In that case we want
8231 to match this pack to the single placeholder. */
8232 else if (arg_idx
< nargs
8233 && TREE_CODE (TREE_VEC_ELT (inner_args
, arg_idx
)) == WILDCARD_DECL
8234 && WILDCARD_PACK_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
8236 nargs
= arg_idx
+ 1;
8237 packed_args
= make_tree_vec (1);
8240 packed_args
= make_tree_vec (nargs
- arg_idx
);
8242 /* Convert the remaining arguments, which will be a part of the
8243 parameter pack "parm". */
8244 int first_pack_arg
= arg_idx
;
8245 for (; arg_idx
< nargs
; ++arg_idx
)
8247 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
8248 tree actual_parm
= TREE_VALUE (parm
);
8249 int pack_idx
= arg_idx
- first_pack_arg
;
8253 /* Once we've packed as many args as we have types, stop. */
8254 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
8256 else if (PACK_EXPANSION_P (arg
))
8257 /* We don't know how many args we have yet, just
8258 use the unconverted ones for now. */
8261 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
8264 if (arg
== error_mark_node
)
8266 if (complain
& tf_error
)
8267 error ("template argument %d is invalid", arg_idx
+ 1);
8270 arg
= convert_template_argument (actual_parm
,
8271 arg
, new_args
, complain
, parm_idx
,
8273 if (arg
== error_mark_node
)
8275 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
8278 if (arg_idx
- first_pack_arg
< TREE_VEC_LENGTH (packed_args
)
8279 && TREE_VEC_LENGTH (packed_args
) > 0)
8281 if (complain
& tf_error
)
8282 error ("wrong number of template arguments (%d, should be %d)",
8283 arg_idx
- first_pack_arg
, TREE_VEC_LENGTH (packed_args
));
8284 return error_mark_node
;
8287 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
8288 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
8289 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
8292 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
8293 TREE_CONSTANT (argument_pack
) = 1;
8296 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
8298 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
8299 TREE_VEC_LENGTH (packed_args
));
8300 return argument_pack
;
8303 /* Returns the number of pack expansions in the template argument vector
8307 pack_expansion_args_count (tree args
)
8312 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
8314 tree elt
= TREE_VEC_ELT (args
, i
);
8315 if (elt
&& PACK_EXPANSION_P (elt
))
8321 /* Convert all template arguments to their appropriate types, and
8322 return a vector containing the innermost resulting template
8323 arguments. If any error occurs, return error_mark_node. Error and
8324 warning messages are issued under control of COMPLAIN.
8326 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
8327 for arguments not specified in ARGS. Otherwise, if
8328 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
8329 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
8330 USE_DEFAULT_ARGS is false, then all arguments must be specified in
8334 coerce_template_parms (tree parms
,
8337 tsubst_flags_t complain
,
8338 bool require_all_args
,
8339 bool use_default_args
)
8341 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
8342 tree orig_inner_args
;
8345 tree new_inner_args
;
8347 /* When used as a boolean value, indicates whether this is a
8348 variadic template parameter list. Since it's an int, we can also
8349 subtract it from nparms to get the number of non-variadic
8352 int variadic_args_p
= 0;
8353 int post_variadic_parms
= 0;
8355 /* Adjustment to nparms for fixed parameter packs. */
8356 int fixed_pack_adjust
= 0;
8357 int fixed_packs
= 0;
8360 /* Likewise for parameters with default arguments. */
8363 if (args
== error_mark_node
)
8364 return error_mark_node
;
8366 nparms
= TREE_VEC_LENGTH (parms
);
8368 /* Determine if there are any parameter packs or default arguments. */
8369 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
8371 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
8373 ++post_variadic_parms
;
8374 if (template_parameter_pack_p (TREE_VALUE (parm
)))
8376 if (TREE_PURPOSE (parm
))
8380 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
8381 /* If there are no parameters that follow a parameter pack, we need to
8382 expand any argument packs so that we can deduce a parameter pack from
8383 some non-packed args followed by an argument pack, as in variadic85.C.
8384 If there are such parameters, we need to leave argument packs intact
8385 so the arguments are assigned properly. This can happen when dealing
8386 with a nested class inside a partial specialization of a class
8387 template, as in variadic92.C, or when deducing a template parameter pack
8388 from a sub-declarator, as in variadic114.C. */
8389 if (!post_variadic_parms
)
8390 inner_args
= expand_template_argument_pack (inner_args
);
8392 /* Count any pack expansion args. */
8393 variadic_args_p
= pack_expansion_args_count (inner_args
);
8395 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
8396 if ((nargs
- variadic_args_p
> nparms
&& !variadic_p
)
8397 || (nargs
< nparms
- variadic_p
8400 && (!use_default_args
8401 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
8402 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
8405 if (complain
& tf_error
)
8407 if (variadic_p
|| default_p
)
8409 nparms
-= variadic_p
+ default_p
;
8410 error ("wrong number of template arguments "
8411 "(%d, should be at least %d)", nargs
, nparms
);
8414 error ("wrong number of template arguments "
8415 "(%d, should be %d)", nargs
, nparms
);
8418 inform (DECL_SOURCE_LOCATION (in_decl
),
8419 "provided for %qD", in_decl
);
8422 return error_mark_node
;
8424 /* We can't pass a pack expansion to a non-pack parameter of an alias
8425 template (DR 1430). */
8427 && (DECL_ALIAS_TEMPLATE_P (in_decl
)
8428 || concept_template_p (in_decl
))
8430 && nargs
- variadic_args_p
< nparms
- variadic_p
)
8432 if (complain
& tf_error
)
8434 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
8436 tree arg
= TREE_VEC_ELT (inner_args
, i
);
8437 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
8439 if (PACK_EXPANSION_P (arg
)
8440 && !template_parameter_pack_p (parm
))
8442 if (DECL_ALIAS_TEMPLATE_P (in_decl
))
8443 error_at (location_of (arg
),
8444 "pack expansion argument for non-pack parameter "
8445 "%qD of alias template %qD", parm
, in_decl
);
8447 error_at (location_of (arg
),
8448 "pack expansion argument for non-pack parameter "
8449 "%qD of concept %qD", parm
, in_decl
);
8450 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
8457 return error_mark_node
;
8460 /* We need to evaluate the template arguments, even though this
8461 template-id may be nested within a "sizeof". */
8464 new_inner_args
= make_tree_vec (nparms
);
8465 new_args
= add_outermost_template_args (args
, new_inner_args
);
8466 int pack_adjust
= 0;
8467 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
8472 /* Get the Ith template parameter. */
8473 parm
= TREE_VEC_ELT (parms
, parm_idx
);
8475 if (parm
== error_mark_node
)
8477 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
8481 /* Calculate the next argument. */
8482 if (arg_idx
< nargs
)
8483 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
8487 if (template_parameter_pack_p (TREE_VALUE (parm
))
8488 && (arg
|| require_all_args
|| !(complain
& tf_partial
))
8489 && !(arg
&& ARGUMENT_PACK_P (arg
)))
8491 /* Some arguments will be placed in the
8492 template parameter pack PARM. */
8493 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
8494 inner_args
, arg_idx
,
8498 if (arg
== NULL_TREE
)
8500 /* We don't know how many args we have yet, just use the
8501 unconverted (and still packed) ones for now. */
8502 new_inner_args
= orig_inner_args
;
8507 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
8509 /* Store this argument. */
8510 if (arg
== error_mark_node
)
8513 /* We are done with all of the arguments. */
8519 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
8520 arg_idx
+= pack_adjust
;
8521 if (fixed_parameter_pack_p (TREE_VALUE (parm
)))
8524 fixed_pack_adjust
+= pack_adjust
;
8532 if (PACK_EXPANSION_P (arg
))
8534 /* "If every valid specialization of a variadic template
8535 requires an empty template parameter pack, the template is
8536 ill-formed, no diagnostic required." So check that the
8537 pattern works with this parameter. */
8538 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
8539 tree conv
= convert_template_argument (TREE_VALUE (parm
),
8543 if (conv
== error_mark_node
)
8545 if (complain
& tf_error
)
8546 inform (input_location
, "so any instantiation with a "
8547 "non-empty parameter pack would be ill-formed");
8550 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
8551 /* Recover from missing typename. */
8552 TREE_VEC_ELT (inner_args
, arg_idx
)
8553 = make_pack_expansion (conv
, complain
);
8555 /* We don't know how many args we have yet, just
8556 use the unconverted ones for now. */
8557 new_inner_args
= inner_args
;
8562 else if (require_all_args
)
8564 /* There must be a default arg in this case. */
8565 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
8567 /* The position of the first default template argument,
8568 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
8570 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
8571 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
8572 arg_idx
- pack_adjust
);
8577 if (arg
== error_mark_node
)
8579 if (complain
& tf_error
)
8580 error ("template argument %d is invalid", arg_idx
+ 1);
8584 /* This can occur if there was an error in the template
8585 parameter list itself (which we would already have
8586 reported) that we are trying to recover from, e.g., a class
8587 template with a parameter list such as
8588 template<typename..., typename> (cpp0x/variadic150.C). */
8591 /* This can also happen with a fixed parameter pack (71834). */
8592 if (arg_idx
>= nargs
)
8596 arg
= convert_template_argument (TREE_VALUE (parm
),
8597 arg
, new_args
, complain
,
8600 if (arg
== error_mark_node
)
8602 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
8605 if (missing
|| arg_idx
< nargs
- variadic_args_p
)
8607 /* If we had fixed parameter packs, we didn't know how many arguments we
8608 actually needed earlier; now we do. */
8609 nparms
+= fixed_pack_adjust
;
8610 variadic_p
-= fixed_packs
;
8614 if (arg_idx
< nargs
)
8616 /* We had some pack expansion arguments that will only work if the packs
8617 are empty, but wait until instantiation time to complain.
8618 See variadic-ttp3.C. */
8619 int len
= nparms
+ (nargs
- arg_idx
);
8620 tree args
= make_tree_vec (len
);
8622 for (; i
< nparms
; ++i
)
8623 TREE_VEC_ELT (args
, i
) = TREE_VEC_ELT (new_inner_args
, i
);
8624 for (; i
< len
; ++i
, ++arg_idx
)
8625 TREE_VEC_ELT (args
, i
) = TREE_VEC_ELT (inner_args
,
8626 arg_idx
- pack_adjust
);
8627 new_inner_args
= args
;
8632 gcc_assert (!(complain
& tf_error
) || seen_error ());
8633 return error_mark_node
;
8636 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
8637 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
8638 TREE_VEC_LENGTH (new_inner_args
));
8640 return new_inner_args
;
8643 /* Convert all template arguments to their appropriate types, and
8644 return a vector containing the innermost resulting template
8645 arguments. If any error occurs, return error_mark_node. Error and
8646 warning messages are not issued.
8648 Note that no function argument deduction is performed, and default
8649 arguments are used to fill in unspecified arguments. */
8651 coerce_template_parms (tree parms
, tree args
, tree in_decl
)
8653 return coerce_template_parms (parms
, args
, in_decl
, tf_none
, true, true);
8656 /* Convert all template arguments to their appropriate type, and
8657 instantiate default arguments as needed. This returns a vector
8658 containing the innermost resulting template arguments, or
8659 error_mark_node if unsuccessful. */
8661 coerce_template_parms (tree parms
, tree args
, tree in_decl
,
8662 tsubst_flags_t complain
)
8664 return coerce_template_parms (parms
, args
, in_decl
, complain
, true, true);
8667 /* Like coerce_template_parms. If PARMS represents all template
8668 parameters levels, this function returns a vector of vectors
8669 representing all the resulting argument levels. Note that in this
8670 case, only the innermost arguments are coerced because the
8671 outermost ones are supposed to have been coerced already.
8673 Otherwise, if PARMS represents only (the innermost) vector of
8674 parameters, this function returns a vector containing just the
8675 innermost resulting arguments. */
8678 coerce_innermost_template_parms (tree parms
,
8681 tsubst_flags_t complain
,
8682 bool require_all_args
,
8683 bool use_default_args
)
8685 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
8686 int args_depth
= TMPL_ARGS_DEPTH (args
);
8689 if (parms_depth
> 1)
8691 coerced_args
= make_tree_vec (parms_depth
);
8695 for (level
= parms
, cur_depth
= parms_depth
;
8696 parms_depth
> 0 && level
!= NULL_TREE
;
8697 level
= TREE_CHAIN (level
), --cur_depth
)
8700 if (cur_depth
== args_depth
)
8701 l
= coerce_template_parms (TREE_VALUE (level
),
8702 args
, in_decl
, complain
,
8706 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
8708 if (l
== error_mark_node
)
8709 return error_mark_node
;
8711 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
8715 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
8716 args
, in_decl
, complain
,
8719 return coerced_args
;
8722 /* Returns 1 if template args OT and NT are equivalent. */
8725 template_args_equal (tree ot
, tree nt
, bool partial_order
/* = false */)
8729 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
8731 if (nt
== any_targ_node
|| ot
== any_targ_node
)
8734 if (TREE_CODE (nt
) == TREE_VEC
)
8735 /* For member templates */
8736 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
8737 else if (PACK_EXPANSION_P (ot
))
8738 return (PACK_EXPANSION_P (nt
)
8739 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
8740 PACK_EXPANSION_PATTERN (nt
))
8741 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
8742 PACK_EXPANSION_EXTRA_ARGS (nt
)));
8743 else if (ARGUMENT_PACK_P (ot
))
8748 if (!ARGUMENT_PACK_P (nt
))
8751 opack
= ARGUMENT_PACK_ARGS (ot
);
8752 npack
= ARGUMENT_PACK_ARGS (nt
);
8753 len
= TREE_VEC_LENGTH (opack
);
8754 if (TREE_VEC_LENGTH (npack
) != len
)
8756 for (i
= 0; i
< len
; ++i
)
8757 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
8758 TREE_VEC_ELT (npack
, i
)))
8762 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
8764 else if (TYPE_P (nt
))
8768 /* Don't treat an alias template specialization with dependent
8769 arguments as equivalent to its underlying type when used as a
8770 template argument; we need them to be distinct so that we
8771 substitute into the specialization arguments at instantiation
8772 time. And aliases can't be equivalent without being ==, so
8773 we don't need to look any deeper.
8775 During partial ordering, however, we need to treat them normally so
8776 that we can order uses of the same alias with different
8777 cv-qualification (79960). */
8779 && (TYPE_ALIAS_P (nt
) || TYPE_ALIAS_P (ot
)))
8782 return same_type_p (ot
, nt
);
8784 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
8788 /* Try to treat a template non-type argument that has been converted
8789 to the parameter type as equivalent to one that hasn't yet. */
8790 for (enum tree_code code1
= TREE_CODE (ot
);
8791 CONVERT_EXPR_CODE_P (code1
)
8792 || code1
== NON_LVALUE_EXPR
;
8793 code1
= TREE_CODE (ot
))
8794 ot
= TREE_OPERAND (ot
, 0);
8795 for (enum tree_code code2
= TREE_CODE (nt
);
8796 CONVERT_EXPR_CODE_P (code2
)
8797 || code2
== NON_LVALUE_EXPR
;
8798 code2
= TREE_CODE (nt
))
8799 nt
= TREE_OPERAND (nt
, 0);
8801 return cp_tree_equal (ot
, nt
);
8805 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
8806 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
8807 NEWARG_PTR with the offending arguments if they are non-NULL. */
8810 comp_template_args (tree oldargs
, tree newargs
,
8811 tree
*oldarg_ptr
, tree
*newarg_ptr
,
8816 if (oldargs
== newargs
)
8819 if (!oldargs
|| !newargs
)
8822 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
8825 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
8827 tree nt
= TREE_VEC_ELT (newargs
, i
);
8828 tree ot
= TREE_VEC_ELT (oldargs
, i
);
8830 if (! template_args_equal (ot
, nt
, partial_order
))
8832 if (oldarg_ptr
!= NULL
)
8834 if (newarg_ptr
!= NULL
)
8843 comp_template_args_porder (tree oargs
, tree nargs
)
8845 return comp_template_args (oargs
, nargs
, NULL
, NULL
, true);
8848 /* Implement a freelist interface for objects of type T.
8850 Head is a separate object, rather than a regular member, so that we
8851 can define it as a GTY deletable pointer, which is highly
8852 desirable. A data member could be declared that way, but then the
8853 containing object would implicitly get GTY((user)), which would
8854 prevent us from instantiating freelists as global objects.
8855 Although this way we can create freelist global objects, they're
8856 such thin wrappers that instantiating temporaries at every use
8857 loses nothing and saves permanent storage for the freelist object.
8859 Member functions next, anew, poison and reinit have default
8860 implementations that work for most of the types we're interested
8861 in, but if they don't work for some type, they should be explicitly
8862 specialized. See the comments before them for requirements, and
8863 the example specializations for the tree_list_freelist. */
8864 template <typename T
>
8867 /* Return the next object in a chain. We could just do type
8868 punning, but if we access the object with its underlying type, we
8869 avoid strict-aliasing trouble. This needs only work between
8870 poison and reinit. */
8871 static T
*&next (T
*obj
) { return obj
->next
; }
8873 /* Return a newly allocated, uninitialized or minimally-initialized
8874 object of type T. Any initialization performed by anew should
8875 either remain across the life of the object and the execution of
8876 poison, or be redone by reinit. */
8877 static T
*anew () { return ggc_alloc
<T
> (); }
8879 /* Optionally scribble all over the bits holding the object, so that
8880 they become (mostly?) uninitialized memory. This is called while
8881 preparing to make the object part of the free list. */
8882 static void poison (T
*obj
) {
8883 T
*p ATTRIBUTE_UNUSED
= obj
;
8884 T
**q ATTRIBUTE_UNUSED
= &next (obj
);
8886 #ifdef ENABLE_GC_CHECKING
8887 /* Poison the data, to indicate the data is garbage. */
8888 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (p
, sizeof (*p
)));
8889 memset (p
, 0xa5, sizeof (*p
));
8891 /* Let valgrind know the object is free. */
8892 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_NOACCESS (p
, sizeof (*p
)));
8894 /* Let valgrind know the next portion of the object is available,
8895 but uninitialized. */
8896 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (q
, sizeof (*q
)));
8899 /* Bring an object that underwent at least one lifecycle after anew
8900 and before the most recent free and poison, back to a usable
8901 state, reinitializing whatever is needed for it to be
8902 functionally equivalent to an object just allocated and returned
8903 by anew. This may poison or clear the next field, used by
8904 freelist housekeeping after poison was called. */
8905 static void reinit (T
*obj
) {
8906 T
**q ATTRIBUTE_UNUSED
= &next (obj
);
8908 #ifdef ENABLE_GC_CHECKING
8909 memset (q
, 0xa5, sizeof (*q
));
8911 /* Let valgrind know the entire object is available, but
8913 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (obj
, sizeof (*obj
)));
8916 /* Reference a GTY-deletable pointer that points to the first object
8917 in the free list proper. */
8920 /* Construct a freelist object chaining objects off of HEAD. */
8921 freelist (T
*&head
) : head(head
) {}
8923 /* Add OBJ to the free object list. The former head becomes OBJ's
8932 /* Take an object from the free list, if one is available, or
8933 allocate a new one. Objects taken from the free list should be
8934 regarded as filled with garbage, except for bits that are
8935 configured to be preserved across free and alloc. */
8950 /* Explicitly specialize the interfaces for freelist<tree_node>: we
8951 want to allocate a TREE_LIST using the usual interface, and ensure
8952 TREE_CHAIN remains functional. Alas, we have to duplicate a bit of
8953 build_tree_list logic in reinit, so this could go out of sync. */
8956 freelist
<tree_node
>::next (tree obj
)
8958 return TREE_CHAIN (obj
);
8962 freelist
<tree_node
>::anew ()
8964 return build_tree_list (NULL
, NULL
);
8968 freelist
<tree_node
>::poison (tree obj ATTRIBUTE_UNUSED
)
8970 int size ATTRIBUTE_UNUSED
= sizeof (tree_list
);
8971 tree p ATTRIBUTE_UNUSED
= obj
;
8972 tree_base
*b ATTRIBUTE_UNUSED
= &obj
->base
;
8973 tree
*q ATTRIBUTE_UNUSED
= &next (obj
);
8975 #ifdef ENABLE_GC_CHECKING
8976 gcc_checking_assert (TREE_CODE (obj
) == TREE_LIST
);
8978 /* Poison the data, to indicate the data is garbage. */
8979 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (p
, size
));
8980 memset (p
, 0xa5, size
);
8982 /* Let valgrind know the object is free. */
8983 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_NOACCESS (p
, size
));
8984 /* But we still want to use the TREE_CODE and TREE_CHAIN parts. */
8985 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_DEFINED (b
, sizeof (*b
)));
8986 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (q
, sizeof (*q
)));
8988 #ifdef ENABLE_GC_CHECKING
8989 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (b
, sizeof (*b
)));
8990 /* Keep TREE_CHAIN functional. */
8991 TREE_SET_CODE (obj
, TREE_LIST
);
8993 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_DEFINED (b
, sizeof (*b
)));
8998 freelist
<tree_node
>::reinit (tree obj ATTRIBUTE_UNUSED
)
9000 tree_base
*b ATTRIBUTE_UNUSED
= &obj
->base
;
9002 #ifdef ENABLE_GC_CHECKING
9003 gcc_checking_assert (TREE_CODE (obj
) == TREE_LIST
);
9004 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (obj
, sizeof (tree_list
)));
9005 memset (obj
, 0, sizeof (tree_list
));
9008 /* Let valgrind know the entire object is available, but
9010 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (obj
, sizeof (tree_list
)));
9012 #ifdef ENABLE_GC_CHECKING
9013 TREE_SET_CODE (obj
, TREE_LIST
);
9015 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_DEFINED (b
, sizeof (*b
)));
9019 /* Point to the first object in the TREE_LIST freelist. */
9020 static GTY((deletable
)) tree tree_list_freelist_head
;
9021 /* Return the/an actual TREE_LIST freelist. */
9022 static inline freelist
<tree_node
>
9023 tree_list_freelist ()
9025 return tree_list_freelist_head
;
9028 /* Point to the first object in the tinst_level freelist. */
9029 static GTY((deletable
)) tinst_level
*tinst_level_freelist_head
;
9030 /* Return the/an actual tinst_level freelist. */
9031 static inline freelist
<tinst_level
>
9032 tinst_level_freelist ()
9034 return tinst_level_freelist_head
;
9037 /* Point to the first object in the pending_template freelist. */
9038 static GTY((deletable
)) pending_template
*pending_template_freelist_head
;
9039 /* Return the/an actual pending_template freelist. */
9040 static inline freelist
<pending_template
>
9041 pending_template_freelist ()
9043 return pending_template_freelist_head
;
9046 /* Build the TREE_LIST object out of a split list, store it
9047 permanently, and return it. */
9049 tinst_level::to_list ()
9051 gcc_assert (split_list_p ());
9052 tree ret
= tree_list_freelist ().alloc ();
9053 TREE_PURPOSE (ret
) = tldcl
;
9054 TREE_VALUE (ret
) = targs
;
9057 gcc_assert (tree_list_p ());
9061 const unsigned short tinst_level::refcount_infinity
;
9063 /* Increment OBJ's refcount unless it is already infinite. */
9064 static tinst_level
*
9065 inc_refcount_use (tinst_level
*obj
)
9067 if (obj
&& obj
->refcount
!= tinst_level::refcount_infinity
)
9072 /* Release storage for OBJ and node, if it's a TREE_LIST. */
9074 tinst_level::free (tinst_level
*obj
)
9076 if (obj
->tree_list_p ())
9077 tree_list_freelist ().free (obj
->get_node ());
9078 tinst_level_freelist ().free (obj
);
9081 /* Decrement OBJ's refcount if not infinite. If it reaches zero, release
9082 OBJ's DECL and OBJ, and start over with the tinst_level object that
9083 used to be referenced by OBJ's NEXT. */
9085 dec_refcount_use (tinst_level
*obj
)
9088 && obj
->refcount
!= tinst_level::refcount_infinity
9089 && !--obj
->refcount
)
9091 tinst_level
*next
= obj
->next
;
9092 tinst_level::free (obj
);
9097 /* Modify PTR so that it points to OBJ, adjusting the refcounts of OBJ
9098 and of the former PTR. Omitting the second argument is equivalent
9099 to passing (T*)NULL; this is allowed because passing the
9100 zero-valued integral constant NULL confuses type deduction and/or
9101 overload resolution. */
9102 template <typename T
>
9104 set_refcount_ptr (T
*& ptr
, T
*obj
= NULL
)
9107 ptr
= inc_refcount_use (obj
);
9108 dec_refcount_use (save
);
9112 add_pending_template (tree d
)
9114 tree ti
= (TYPE_P (d
)
9115 ? CLASSTYPE_TEMPLATE_INFO (d
)
9116 : DECL_TEMPLATE_INFO (d
));
9117 struct pending_template
*pt
;
9120 if (TI_PENDING_TEMPLATE_FLAG (ti
))
9123 /* We are called both from instantiate_decl, where we've already had a
9124 tinst_level pushed, and instantiate_template, where we haven't.
9126 gcc_assert (TREE_CODE (d
) != TREE_LIST
);
9127 level
= !current_tinst_level
9128 || current_tinst_level
->maybe_get_node () != d
;
9131 push_tinst_level (d
);
9133 pt
= pending_template_freelist ().alloc ();
9136 set_refcount_ptr (pt
->tinst
, current_tinst_level
);
9137 if (last_pending_template
)
9138 last_pending_template
->next
= pt
;
9140 pending_templates
= pt
;
9142 last_pending_template
= pt
;
9144 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
9151 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
9152 ARGLIST. Valid choices for FNS are given in the cp-tree.def
9153 documentation for TEMPLATE_ID_EXPR. */
9156 lookup_template_function (tree fns
, tree arglist
)
9158 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
9159 return error_mark_node
;
9161 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
9163 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
9165 error ("%q#D is not a function template", fns
);
9166 return error_mark_node
;
9169 if (BASELINK_P (fns
))
9171 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
9173 BASELINK_FUNCTIONS (fns
),
9178 return build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fns
, arglist
);
9181 /* Within the scope of a template class S<T>, the name S gets bound
9182 (in build_self_reference) to a TYPE_DECL for the class, not a
9183 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
9184 or one of its enclosing classes, and that type is a template,
9185 return the associated TEMPLATE_DECL. Otherwise, the original
9188 Also handle the case when DECL is a TREE_LIST of ambiguous
9189 injected-class-names from different bases. */
9192 maybe_get_template_decl_from_type_decl (tree decl
)
9194 if (decl
== NULL_TREE
)
9197 /* DR 176: A lookup that finds an injected-class-name (10.2
9198 [class.member.lookup]) can result in an ambiguity in certain cases
9199 (for example, if it is found in more than one base class). If all of
9200 the injected-class-names that are found refer to specializations of
9201 the same class template, and if the name is followed by a
9202 template-argument-list, the reference refers to the class template
9203 itself and not a specialization thereof, and is not ambiguous. */
9204 if (TREE_CODE (decl
) == TREE_LIST
)
9206 tree t
, tmpl
= NULL_TREE
;
9207 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
9209 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
9212 else if (tmpl
!= elt
)
9215 if (tmpl
&& t
== NULL_TREE
)
9221 return (decl
!= NULL_TREE
9222 && DECL_SELF_REFERENCE_P (decl
)
9223 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
9224 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
9227 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
9228 parameters, find the desired type.
9230 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
9232 IN_DECL, if non-NULL, is the template declaration we are trying to
9235 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
9236 the class we are looking up.
9238 Issue error and warning messages under control of COMPLAIN.
9240 If the template class is really a local class in a template
9241 function, then the FUNCTION_CONTEXT is the function in which it is
9244 ??? Note that this function is currently called *twice* for each
9245 template-id: the first time from the parser, while creating the
9246 incomplete type (finish_template_type), and the second type during the
9247 real instantiation (instantiate_template_class). This is surely something
9248 that we want to avoid. It also causes some problems with argument
9249 coercion (see convert_nontype_argument for more information on this). */
9252 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
9253 int entering_scope
, tsubst_flags_t complain
)
9255 tree templ
= NULL_TREE
, parmlist
;
9262 if (identifier_p (d1
))
9264 tree value
= innermost_non_namespace_value (d1
);
9265 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
9270 push_decl_namespace (context
);
9271 templ
= lookup_name (d1
);
9272 templ
= maybe_get_template_decl_from_type_decl (templ
);
9274 pop_decl_namespace ();
9277 context
= DECL_CONTEXT (templ
);
9279 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
9281 tree type
= TREE_TYPE (d1
);
9283 /* If we are declaring a constructor, say A<T>::A<T>, we will get
9284 an implicit typename for the second A. Deal with it. */
9285 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
9286 type
= TREE_TYPE (type
);
9288 if (CLASSTYPE_TEMPLATE_INFO (type
))
9290 templ
= CLASSTYPE_TI_TEMPLATE (type
);
9291 d1
= DECL_NAME (templ
);
9294 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
9295 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
9297 templ
= TYPE_TI_TEMPLATE (d1
);
9298 d1
= DECL_NAME (templ
);
9300 else if (DECL_TYPE_TEMPLATE_P (d1
))
9303 d1
= DECL_NAME (templ
);
9304 context
= DECL_CONTEXT (templ
);
9306 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
9309 d1
= DECL_NAME (templ
);
9312 /* Issue an error message if we didn't find a template. */
9315 if (complain
& tf_error
)
9316 error ("%qT is not a template", d1
);
9317 return error_mark_node
;
9320 if (TREE_CODE (templ
) != TEMPLATE_DECL
9321 /* Make sure it's a user visible template, if it was named by
9323 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
9324 && !PRIMARY_TEMPLATE_P (templ
)))
9326 if (complain
& tf_error
)
9328 error ("non-template type %qT used as a template", d1
);
9330 error ("for template declaration %q+D", in_decl
);
9332 return error_mark_node
;
9335 complain
&= ~tf_user
;
9337 /* An alias that just changes the name of a template is equivalent to the
9338 other template, so if any of the arguments are pack expansions, strip
9339 the alias to avoid problems with a pack expansion passed to a non-pack
9340 alias template parameter (DR 1430). */
9341 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
9342 templ
= get_underlying_template (templ
);
9344 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
9347 tree arglist2
= coerce_template_args_for_ttp (templ
, arglist
, complain
);
9348 if (arglist2
== error_mark_node
9349 || (!uses_template_parms (arglist2
)
9350 && check_instantiated_args (templ
, arglist2
, complain
)))
9351 return error_mark_node
;
9353 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
9358 tree template_type
= TREE_TYPE (templ
);
9361 tree found
= NULL_TREE
;
9364 int is_dependent_type
;
9365 int use_partial_inst_tmpl
= false;
9367 if (template_type
== error_mark_node
)
9368 /* An error occurred while building the template TEMPL, and a
9369 diagnostic has most certainly been emitted for that
9370 already. Let's propagate that error. */
9371 return error_mark_node
;
9373 gen_tmpl
= most_general_template (templ
);
9374 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
9375 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
9376 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
9378 if (arg_depth
== 1 && parm_depth
> 1)
9380 /* We've been given an incomplete set of template arguments.
9383 template <class T> struct S1 {
9384 template <class U> struct S2 {};
9385 template <class U> struct S2<U*> {};
9388 we will be called with an ARGLIST of `U*', but the
9389 TEMPLATE will be `template <class T> template
9390 <class U> struct S1<T>::S2'. We must fill in the missing
9392 tree ti
= TYPE_TEMPLATE_INFO_MAYBE_ALIAS (TREE_TYPE (templ
));
9393 arglist
= add_outermost_template_args (TI_ARGS (ti
), arglist
);
9394 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
9397 /* Now we should have enough arguments. */
9398 gcc_assert (parm_depth
== arg_depth
);
9400 /* From here on, we're only interested in the most general
9403 /* Calculate the BOUND_ARGS. These will be the args that are
9404 actually tsubst'd into the definition to create the
9406 arglist
= coerce_innermost_template_parms (parmlist
, arglist
, gen_tmpl
,
9408 /*require_all_args=*/true,
9409 /*use_default_args=*/true);
9411 if (arglist
== error_mark_node
)
9412 /* We were unable to bind the arguments. */
9413 return error_mark_node
;
9415 /* In the scope of a template class, explicit references to the
9416 template class refer to the type of the template, not any
9417 instantiation of it. For example, in:
9419 template <class T> class C { void f(C<T>); }
9421 the `C<T>' is just the same as `C'. Outside of the
9422 class, however, such a reference is an instantiation. */
9424 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
9425 || currently_open_class (template_type
))
9427 tree tinfo
= TYPE_TEMPLATE_INFO (template_type
);
9429 if (tinfo
&& comp_template_args (TI_ARGS (tinfo
), arglist
))
9430 return template_type
;
9433 /* If we already have this specialization, return it. */
9434 elt
.tmpl
= gen_tmpl
;
9436 elt
.spec
= NULL_TREE
;
9437 hash
= spec_hasher::hash (&elt
);
9438 entry
= type_specializations
->find_with_hash (&elt
, hash
);
9443 /* If the the template's constraints are not satisfied,
9444 then we cannot form a valid type.
9446 Note that the check is deferred until after the hash
9447 lookup. This prevents redundant checks on previously
9448 instantiated specializations. */
9449 if (flag_concepts
&& !constraints_satisfied_p (gen_tmpl
, arglist
))
9451 if (complain
& tf_error
)
9453 auto_diagnostic_group d
;
9454 error ("template constraint failure");
9455 diagnose_constraints (input_location
, gen_tmpl
, arglist
);
9457 return error_mark_node
;
9460 is_dependent_type
= uses_template_parms (arglist
);
9462 /* If the deduced arguments are invalid, then the binding
9464 if (!is_dependent_type
9465 && check_instantiated_args (gen_tmpl
,
9466 INNERMOST_TEMPLATE_ARGS (arglist
),
9468 return error_mark_node
;
9470 if (!is_dependent_type
9471 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
9472 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
9473 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
9475 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
9476 DECL_NAME (gen_tmpl
),
9477 /*tag_scope=*/ts_global
);
9481 context
= DECL_CONTEXT (gen_tmpl
);
9482 if (context
&& TYPE_P (context
))
9484 context
= tsubst_aggr_type (context
, arglist
, complain
, in_decl
, true);
9485 context
= complete_type (context
);
9488 context
= tsubst (context
, arglist
, complain
, in_decl
);
9490 if (context
== error_mark_node
)
9491 return error_mark_node
;
9494 context
= global_namespace
;
9496 /* Create the type. */
9497 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
9499 /* The user referred to a specialization of an alias
9500 template represented by GEN_TMPL.
9502 [temp.alias]/2 says:
9504 When a template-id refers to the specialization of an
9505 alias template, it is equivalent to the associated
9506 type obtained by substitution of its
9507 template-arguments for the template-parameters in the
9508 type-id of the alias template. */
9510 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
9511 /* Note that the call above (by indirectly calling
9512 register_specialization in tsubst_decl) registers the
9513 TYPE_DECL representing the specialization of the alias
9514 template. So next time someone substitutes ARGLIST for
9515 the template parms into the alias template (GEN_TMPL),
9516 she'll get that TYPE_DECL back. */
9518 if (t
== error_mark_node
)
9521 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
9523 if (!is_dependent_type
)
9525 set_current_access_from_decl (TYPE_NAME (template_type
));
9526 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
9527 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
9528 arglist
, complain
, in_decl
),
9529 tsubst_attributes (TYPE_ATTRIBUTES (template_type
),
9530 arglist
, complain
, in_decl
),
9531 SCOPED_ENUM_P (template_type
), NULL
);
9533 if (t
== error_mark_node
)
9538 /* We don't want to call start_enum for this type, since
9539 the values for the enumeration constants may involve
9540 template parameters. And, no one should be interested
9541 in the enumeration constants for such a type. */
9542 t
= cxx_make_type (ENUMERAL_TYPE
);
9543 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
9545 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
9546 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
9547 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
9549 else if (CLASS_TYPE_P (template_type
))
9551 /* Lambda closures are regenerated in tsubst_lambda_expr, not
9552 instantiated here. */
9553 gcc_assert (!LAMBDA_TYPE_P (template_type
));
9555 t
= make_class_type (TREE_CODE (template_type
));
9556 CLASSTYPE_DECLARED_CLASS (t
)
9557 = CLASSTYPE_DECLARED_CLASS (template_type
);
9558 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
9560 /* A local class. Make sure the decl gets registered properly. */
9561 if (context
== current_function_decl
)
9562 if (pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
)
9564 return error_mark_node
;
9566 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
9567 /* This instantiation is another name for the primary
9568 template type. Set the TYPE_CANONICAL field
9570 TYPE_CANONICAL (t
) = template_type
;
9571 else if (any_template_arguments_need_structural_equality_p (arglist
))
9572 /* Some of the template arguments require structural
9573 equality testing, so this template class requires
9574 structural equality testing. */
9575 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9580 /* If we called start_enum or pushtag above, this information
9581 will already be set up. */
9584 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
9586 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
9587 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
9588 DECL_SOURCE_LOCATION (type_decl
)
9589 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
9592 type_decl
= TYPE_NAME (t
);
9594 if (CLASS_TYPE_P (template_type
))
9596 TREE_PRIVATE (type_decl
)
9597 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
9598 TREE_PROTECTED (type_decl
)
9599 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
9600 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
9602 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
9603 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
9607 if (OVERLOAD_TYPE_P (t
)
9608 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
9610 static const char *tags
[] = {"abi_tag", "may_alias"};
9612 for (unsigned ix
= 0; ix
!= 2; ix
++)
9615 = lookup_attribute (tags
[ix
], TYPE_ATTRIBUTES (template_type
));
9619 = tree_cons (TREE_PURPOSE (attributes
),
9620 TREE_VALUE (attributes
),
9621 TYPE_ATTRIBUTES (t
));
9625 /* Let's consider the explicit specialization of a member
9626 of a class template specialization that is implicitly instantiated,
9631 template<class U> struct M {}; //#0
9636 struct S<int>::M<char> //#1
9640 [temp.expl.spec]/4 says this is valid.
9642 In this case, when we write:
9645 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
9648 When we encounter #1, we want to store the partial instantiation
9649 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
9651 For all cases other than this "explicit specialization of member of a
9652 class template", we just want to store the most general template into
9653 the CLASSTYPE_TI_TEMPLATE of M.
9655 This case of "explicit specialization of member of a class template"
9657 1/ the enclosing class is an instantiation of, and therefore not
9658 the same as, the context of the most general template, and
9659 2/ we aren't looking at the partial instantiation itself, i.e.
9660 the innermost arguments are not the same as the innermost parms of
9661 the most general template.
9663 So it's only when 1/ and 2/ happens that we want to use the partial
9664 instantiation of the member template in lieu of its most general
9667 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
9668 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
9669 /* the enclosing class must be an instantiation... */
9670 && CLASS_TYPE_P (context
)
9671 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
9673 TREE_VEC_LENGTH (arglist
)--;
9674 ++processing_template_decl
;
9675 tree tinfo
= TYPE_TEMPLATE_INFO_MAYBE_ALIAS (TREE_TYPE (gen_tmpl
));
9676 tree partial_inst_args
=
9677 tsubst (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
)),
9678 arglist
, complain
, NULL_TREE
);
9679 --processing_template_decl
;
9680 TREE_VEC_LENGTH (arglist
)++;
9681 if (partial_inst_args
== error_mark_node
)
9682 return error_mark_node
;
9683 use_partial_inst_tmpl
=
9684 /*...and we must not be looking at the partial instantiation
9686 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
9690 if (!use_partial_inst_tmpl
)
9691 /* This case is easy; there are no member templates involved. */
9695 /* This is a full instantiation of a member template. Find
9696 the partial instantiation of which this is an instance. */
9698 /* Temporarily reduce by one the number of levels in the ARGLIST
9699 so as to avoid comparing the last set of arguments. */
9700 TREE_VEC_LENGTH (arglist
)--;
9701 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
9702 TREE_VEC_LENGTH (arglist
)++;
9703 /* FOUND is either a proper class type, or an alias
9704 template specialization. In the later case, it's a
9705 TYPE_DECL, resulting from the substituting of arguments
9706 for parameters in the TYPE_DECL of the alias template
9707 done earlier. So be careful while getting the template
9709 found
= (TREE_CODE (found
) == TEMPLATE_DECL
9711 : (TREE_CODE (found
) == TYPE_DECL
9712 ? DECL_TI_TEMPLATE (found
)
9713 : CLASSTYPE_TI_TEMPLATE (found
)));
9715 if (DECL_CLASS_TEMPLATE_P (found
)
9716 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (found
)))
9718 /* If this partial instantiation is specialized, we want to
9719 use it for hash table lookup. */
9721 elt
.args
= arglist
= INNERMOST_TEMPLATE_ARGS (arglist
);
9722 hash
= spec_hasher::hash (&elt
);
9726 // Build template info for the new specialization.
9727 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
9730 slot
= type_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
9731 gcc_checking_assert (*slot
== NULL
);
9732 entry
= ggc_alloc
<spec_entry
> ();
9736 /* Note this use of the partial instantiation so we can check it
9737 later in maybe_process_partial_specialization. */
9738 DECL_TEMPLATE_INSTANTIATIONS (found
)
9739 = tree_cons (arglist
, t
,
9740 DECL_TEMPLATE_INSTANTIATIONS (found
));
9742 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
9743 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
9744 /* Now that the type has been registered on the instantiations
9745 list, we set up the enumerators. Because the enumeration
9746 constants may involve the enumeration type itself, we make
9747 sure to register the type first, and then create the
9748 constants. That way, doing tsubst_expr for the enumeration
9749 constants won't result in recursive calls here; we'll find
9750 the instantiation and exit above. */
9751 tsubst_enum (template_type
, t
, arglist
);
9753 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
9754 /* If the type makes use of template parameters, the
9755 code that generates debugging information will crash. */
9756 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
9758 /* Possibly limit visibility based on template args. */
9759 TREE_PUBLIC (type_decl
) = 1;
9760 determine_visibility (type_decl
);
9762 inherit_targ_abi_tags (t
);
9768 /* Wrapper for lookup_template_class_1. */
9771 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
9772 int entering_scope
, tsubst_flags_t complain
)
9775 timevar_push (TV_TEMPLATE_INST
);
9776 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
9777 entering_scope
, complain
);
9778 timevar_pop (TV_TEMPLATE_INST
);
9782 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST. */
9785 lookup_template_variable (tree templ
, tree arglist
)
9787 /* The type of the expression is NULL_TREE since the template-id could refer
9788 to an explicit or partial specialization. */
9789 tree type
= NULL_TREE
;
9790 if (flag_concepts
&& variable_concept_p (templ
))
9791 /* Except that concepts are always bool. */
9792 type
= boolean_type_node
;
9793 return build2 (TEMPLATE_ID_EXPR
, type
, templ
, arglist
);
9796 /* Instantiate a variable declaration from a TEMPLATE_ID_EXPR for use. */
9799 finish_template_variable (tree var
, tsubst_flags_t complain
)
9801 tree templ
= TREE_OPERAND (var
, 0);
9802 tree arglist
= TREE_OPERAND (var
, 1);
9804 /* We never want to return a VAR_DECL for a variable concept, since they
9805 aren't instantiated. In a template, leave the TEMPLATE_ID_EXPR alone. */
9806 bool concept_p
= flag_concepts
&& variable_concept_p (templ
);
9807 if (concept_p
&& processing_template_decl
)
9810 tree tmpl_args
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (templ
));
9811 arglist
= add_outermost_template_args (tmpl_args
, arglist
);
9813 templ
= most_general_template (templ
);
9814 tree parms
= DECL_TEMPLATE_PARMS (templ
);
9815 arglist
= coerce_innermost_template_parms (parms
, arglist
, templ
, complain
,
9817 /*use_default*/true);
9819 if (flag_concepts
&& !constraints_satisfied_p (templ
, arglist
))
9821 if (complain
& tf_error
)
9823 auto_diagnostic_group d
;
9824 error ("use of invalid variable template %qE", var
);
9825 diagnose_constraints (location_of (var
), templ
, arglist
);
9827 return error_mark_node
;
9830 /* If a template-id refers to a specialization of a variable
9831 concept, then the expression is true if and only if the
9832 concept's constraints are satisfied by the given template
9835 NOTE: This is an extension of Concepts Lite TS that
9836 allows constraints to be used in expressions. */
9839 tree decl
= DECL_TEMPLATE_RESULT (templ
);
9840 return evaluate_variable_concept (decl
, arglist
);
9843 return instantiate_template (templ
, arglist
, complain
);
9846 /* Construct a TEMPLATE_ID_EXPR for the given variable template TEMPL having
9847 TARGS template args, and instantiate it if it's not dependent. */
9850 lookup_and_finish_template_variable (tree templ
, tree targs
,
9851 tsubst_flags_t complain
)
9853 templ
= lookup_template_variable (templ
, targs
);
9854 if (!any_dependent_template_arguments_p (targs
))
9856 templ
= finish_template_variable (templ
, complain
);
9860 return convert_from_reference (templ
);
9869 /* True when we should also visit template parameters that occur in
9870 non-deduced contexts. */
9871 bool include_nondeduced_p
;
9872 hash_set
<tree
> *visited
;
9875 /* Called from for_each_template_parm via walk_tree. */
9878 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
9881 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
9882 tree_fn_t fn
= pfd
->fn
;
9883 void *data
= pfd
->data
;
9884 tree result
= NULL_TREE
;
9886 #define WALK_SUBTREE(NODE) \
9889 result = for_each_template_parm (NODE, fn, data, pfd->visited, \
9890 pfd->include_nondeduced_p, \
9892 if (result) goto out; \
9896 if (pfd
->any_fn
&& (*pfd
->any_fn
)(t
, data
))
9900 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
))
9901 WALK_SUBTREE (TYPE_CONTEXT (t
));
9903 switch (TREE_CODE (t
))
9906 if (TYPE_PTRMEMFUNC_P (t
))
9912 if (!TYPE_TEMPLATE_INFO (t
))
9915 WALK_SUBTREE (TYPE_TI_ARGS (t
));
9919 WALK_SUBTREE (TYPE_MIN_VALUE (t
));
9920 WALK_SUBTREE (TYPE_MAX_VALUE (t
));
9924 /* Since we're not going to walk subtrees, we have to do this
9926 WALK_SUBTREE (TYPE_METHOD_BASETYPE (t
));
9930 /* Check the return type. */
9931 WALK_SUBTREE (TREE_TYPE (t
));
9933 /* Check the parameter types. Since default arguments are not
9934 instantiated until they are needed, the TYPE_ARG_TYPES may
9935 contain expressions that involve template parameters. But,
9936 no-one should be looking at them yet. And, once they're
9937 instantiated, they don't contain template parameters, so
9938 there's no point in looking at them then, either. */
9942 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
9943 WALK_SUBTREE (TREE_VALUE (parm
));
9945 /* Since we've already handled the TYPE_ARG_TYPES, we don't
9946 want walk_tree walking into them itself. */
9950 if (flag_noexcept_type
)
9952 tree spec
= TYPE_RAISES_EXCEPTIONS (t
);
9954 WALK_SUBTREE (TREE_PURPOSE (spec
));
9960 case UNDERLYING_TYPE
:
9961 if (pfd
->include_nondeduced_p
9962 && for_each_template_parm (TYPE_VALUES_RAW (t
), fn
, data
,
9964 pfd
->include_nondeduced_p
,
9966 return error_mark_node
;
9967 *walk_subtrees
= false;
9972 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
9973 WALK_SUBTREE (DECL_TI_ARGS (t
));
9978 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
))
9979 WALK_SUBTREE (DECL_INITIAL (t
));
9980 if (DECL_CONTEXT (t
)
9981 && pfd
->include_nondeduced_p
)
9982 WALK_SUBTREE (DECL_CONTEXT (t
));
9985 case BOUND_TEMPLATE_TEMPLATE_PARM
:
9986 /* Record template parameters such as `T' inside `TT<T>'. */
9987 WALK_SUBTREE (TYPE_TI_ARGS (t
));
9990 case TEMPLATE_TEMPLATE_PARM
:
9991 case TEMPLATE_TYPE_PARM
:
9992 case TEMPLATE_PARM_INDEX
:
9993 if (fn
&& (*fn
)(t
, data
))
10000 /* A template template parameter is encountered. */
10001 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10002 WALK_SUBTREE (TREE_TYPE (t
));
10004 /* Already substituted template template parameter */
10005 *walk_subtrees
= 0;
10008 case TYPENAME_TYPE
:
10009 /* A template-id in a TYPENAME_TYPE might be a deduced context after
10010 partial instantiation. */
10011 WALK_SUBTREE (TYPENAME_TYPE_FULLNAME (t
));
10015 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
10016 && pfd
->include_nondeduced_p
)
10017 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (t
)));
10021 case COMPONENT_REF
:
10022 /* If there's no type, then this thing must be some expression
10023 involving template parameters. */
10024 if (!fn
&& !TREE_TYPE (t
))
10025 return error_mark_node
;
10030 case IMPLICIT_CONV_EXPR
:
10031 case REINTERPRET_CAST_EXPR
:
10032 case CONST_CAST_EXPR
:
10033 case STATIC_CAST_EXPR
:
10034 case DYNAMIC_CAST_EXPR
:
10038 case PSEUDO_DTOR_EXPR
:
10040 return error_mark_node
;
10047 #undef WALK_SUBTREE
10049 /* We didn't find any template parameters we liked. */
10054 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
10055 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
10056 call FN with the parameter and the DATA.
10057 If FN returns nonzero, the iteration is terminated, and
10058 for_each_template_parm returns 1. Otherwise, the iteration
10059 continues. If FN never returns a nonzero value, the value
10060 returned by for_each_template_parm is 0. If FN is NULL, it is
10061 considered to be the function which always returns 1.
10063 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
10064 parameters that occur in non-deduced contexts. When false, only
10065 visits those template parameters that can be deduced. */
10068 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
10069 hash_set
<tree
> *visited
,
10070 bool include_nondeduced_p
,
10073 struct pair_fn_data pfd
;
10078 pfd
.any_fn
= any_fn
;
10080 pfd
.include_nondeduced_p
= include_nondeduced_p
;
10082 /* Walk the tree. (Conceptually, we would like to walk without
10083 duplicates, but for_each_template_parm_r recursively calls
10084 for_each_template_parm, so we would need to reorganize a fair
10085 bit to use walk_tree_without_duplicates, so we keep our own
10088 pfd
.visited
= visited
;
10090 pfd
.visited
= new hash_set
<tree
>;
10091 result
= cp_walk_tree (&t
,
10092 for_each_template_parm_r
,
10099 delete pfd
.visited
;
10106 /* Returns true if T depends on any template parameter. */
10109 uses_template_parms (tree t
)
10111 if (t
== NULL_TREE
)
10115 int saved_processing_template_decl
;
10117 saved_processing_template_decl
= processing_template_decl
;
10118 if (!saved_processing_template_decl
)
10119 processing_template_decl
= 1;
10121 dependent_p
= dependent_type_p (t
);
10122 else if (TREE_CODE (t
) == TREE_VEC
)
10123 dependent_p
= any_dependent_template_arguments_p (t
);
10124 else if (TREE_CODE (t
) == TREE_LIST
)
10125 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
10126 || uses_template_parms (TREE_CHAIN (t
)));
10127 else if (TREE_CODE (t
) == TYPE_DECL
)
10128 dependent_p
= dependent_type_p (TREE_TYPE (t
));
10129 else if (DECL_P (t
)
10131 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
10132 || TREE_CODE (t
) == OVERLOAD
10134 || identifier_p (t
)
10135 || TREE_CODE (t
) == TRAIT_EXPR
10136 || TREE_CODE (t
) == CONSTRUCTOR
10137 || CONSTANT_CLASS_P (t
))
10138 dependent_p
= (type_dependent_expression_p (t
)
10139 || value_dependent_expression_p (t
));
10142 gcc_assert (t
== error_mark_node
);
10143 dependent_p
= false;
10146 processing_template_decl
= saved_processing_template_decl
;
10148 return dependent_p
;
10151 /* Returns true iff current_function_decl is an incompletely instantiated
10152 template. Useful instead of processing_template_decl because the latter
10153 is set to 0 during instantiate_non_dependent_expr. */
10156 in_template_function (void)
10158 tree fn
= current_function_decl
;
10160 ++processing_template_decl
;
10161 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
10162 && DECL_TEMPLATE_INFO (fn
)
10163 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
10164 --processing_template_decl
;
10168 /* Returns true if T depends on any template parameter with level LEVEL. */
10171 uses_template_parms_level (tree t
, int level
)
10173 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
10174 /*include_nondeduced_p=*/true);
10177 /* Returns true if the signature of DECL depends on any template parameter from
10178 its enclosing class. */
10181 uses_outer_template_parms (tree decl
)
10183 int depth
= template_class_depth (CP_DECL_CONTEXT (decl
));
10186 if (for_each_template_parm (TREE_TYPE (decl
), template_parm_outer_level
,
10187 &depth
, NULL
, /*include_nondeduced_p=*/true))
10189 if (PRIMARY_TEMPLATE_P (decl
)
10190 && for_each_template_parm (INNERMOST_TEMPLATE_PARMS
10191 (DECL_TEMPLATE_PARMS (decl
)),
10192 template_parm_outer_level
,
10193 &depth
, NULL
, /*include_nondeduced_p=*/true))
10195 tree ci
= get_constraints (decl
);
10197 ci
= CI_ASSOCIATED_CONSTRAINTS (ci
);
10198 if (ci
&& for_each_template_parm (ci
, template_parm_outer_level
,
10199 &depth
, NULL
, /*nondeduced*/true))
10204 /* Returns TRUE iff INST is an instantiation we don't need to do in an
10205 ill-formed translation unit, i.e. a variable or function that isn't
10206 usable in a constant expression. */
10209 neglectable_inst_p (tree d
)
10211 return (d
&& DECL_P (d
)
10212 && !undeduced_auto_decl (d
)
10213 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
10214 : decl_maybe_constant_var_p (d
)));
10217 /* Returns TRUE iff we should refuse to instantiate DECL because it's
10218 neglectable and instantiated from within an erroneous instantiation. */
10221 limit_bad_template_recursion (tree decl
)
10223 struct tinst_level
*lev
= current_tinst_level
;
10224 int errs
= errorcount
+ sorrycount
;
10225 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
10228 for (; lev
; lev
= lev
->next
)
10229 if (neglectable_inst_p (lev
->maybe_get_node ()))
10232 return (lev
&& errs
> lev
->errors
);
10235 static int tinst_depth
;
10236 extern int max_tinst_depth
;
10239 static GTY(()) struct tinst_level
*last_error_tinst_level
;
10241 /* We're starting to instantiate D; record the template instantiation context
10242 at LOC for diagnostics and to restore it later. */
10245 push_tinst_level_loc (tree tldcl
, tree targs
, location_t loc
)
10247 struct tinst_level
*new_level
;
10249 if (tinst_depth
>= max_tinst_depth
)
10251 /* Tell error.c not to try to instantiate any templates. */
10253 fatal_error (input_location
,
10254 "template instantiation depth exceeds maximum of %d"
10255 " (use %<-ftemplate-depth=%> to increase the maximum)",
10260 /* If the current instantiation caused problems, don't let it instantiate
10261 anything else. Do allow deduction substitution and decls usable in
10262 constant expressions. */
10263 if (!targs
&& limit_bad_template_recursion (tldcl
))
10266 /* When not -quiet, dump template instantiations other than functions, since
10267 announce_function will take care of those. */
10268 if (!quiet_flag
&& !targs
10269 && TREE_CODE (tldcl
) != TREE_LIST
10270 && TREE_CODE (tldcl
) != FUNCTION_DECL
)
10271 fprintf (stderr
, " %s", decl_as_string (tldcl
, TFF_DECL_SPECIFIERS
));
10273 new_level
= tinst_level_freelist ().alloc ();
10274 new_level
->tldcl
= tldcl
;
10275 new_level
->targs
= targs
;
10276 new_level
->locus
= loc
;
10277 new_level
->errors
= errorcount
+ sorrycount
;
10278 new_level
->next
= NULL
;
10279 new_level
->refcount
= 0;
10280 set_refcount_ptr (new_level
->next
, current_tinst_level
);
10281 set_refcount_ptr (current_tinst_level
, new_level
);
10284 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
10285 depth_reached
= tinst_depth
;
10290 /* We're starting substitution of TMPL<ARGS>; record the template
10291 substitution context for diagnostics and to restore it later. */
10294 push_tinst_level (tree tmpl
, tree args
)
10296 return push_tinst_level_loc (tmpl
, args
, input_location
);
10299 /* We're starting to instantiate D; record INPUT_LOCATION and the
10300 template instantiation context for diagnostics and to restore it
10304 push_tinst_level (tree d
)
10306 return push_tinst_level_loc (d
, input_location
);
10309 /* Likewise, but record LOC as the program location. */
10312 push_tinst_level_loc (tree d
, location_t loc
)
10314 gcc_assert (TREE_CODE (d
) != TREE_LIST
);
10315 return push_tinst_level_loc (d
, NULL
, loc
);
10318 /* We're done instantiating this template; return to the instantiation
10322 pop_tinst_level (void)
10324 /* Restore the filename and line number stashed away when we started
10325 this instantiation. */
10326 input_location
= current_tinst_level
->locus
;
10327 set_refcount_ptr (current_tinst_level
, current_tinst_level
->next
);
10331 /* We're instantiating a deferred template; restore the template
10332 instantiation context in which the instantiation was requested, which
10333 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
10336 reopen_tinst_level (struct tinst_level
*level
)
10338 struct tinst_level
*t
;
10341 for (t
= level
; t
; t
= t
->next
)
10344 set_refcount_ptr (current_tinst_level
, level
);
10345 pop_tinst_level ();
10346 if (current_tinst_level
)
10347 current_tinst_level
->errors
= errorcount
+sorrycount
;
10348 return level
->maybe_get_node ();
10351 /* Returns the TINST_LEVEL which gives the original instantiation
10354 struct tinst_level
*
10355 outermost_tinst_level (void)
10357 struct tinst_level
*level
= current_tinst_level
;
10359 while (level
->next
)
10360 level
= level
->next
;
10364 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
10365 vector of template arguments, as for tsubst.
10367 Returns an appropriate tsubst'd friend declaration. */
10370 tsubst_friend_function (tree decl
, tree args
)
10374 if (TREE_CODE (decl
) == FUNCTION_DECL
10375 && DECL_TEMPLATE_INSTANTIATION (decl
)
10376 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
10377 /* This was a friend declared with an explicit template
10378 argument list, e.g.:
10380 friend void f<>(T);
10382 to indicate that f was a template instantiation, not a new
10383 function declaration. Now, we have to figure out what
10384 instantiation of what template. */
10386 tree template_id
, arglist
, fns
;
10389 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
10391 /* Friend functions are looked up in the containing namespace scope.
10392 We must enter that scope, to avoid finding member functions of the
10393 current class with same name. */
10394 push_nested_namespace (ns
);
10395 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
10396 tf_warning_or_error
, NULL_TREE
,
10397 /*integral_constant_expression_p=*/false);
10398 pop_nested_namespace (ns
);
10399 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
10400 tf_warning_or_error
, NULL_TREE
);
10401 template_id
= lookup_template_function (fns
, arglist
);
10403 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
10404 tmpl
= determine_specialization (template_id
, new_friend
,
10406 /*need_member_template=*/0,
10407 TREE_VEC_LENGTH (args
),
10409 return instantiate_template (tmpl
, new_args
, tf_error
);
10412 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
10414 /* The NEW_FRIEND will look like an instantiation, to the
10415 compiler, but is not an instantiation from the point of view of
10416 the language. For example, we might have had:
10418 template <class T> struct S {
10419 template <class U> friend void f(T, U);
10422 Then, in S<int>, template <class U> void f(int, U) is not an
10423 instantiation of anything. */
10424 if (new_friend
== error_mark_node
)
10425 return error_mark_node
;
10427 DECL_USE_TEMPLATE (new_friend
) = 0;
10428 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
10430 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
10431 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
10432 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
10435 /* The mangled name for the NEW_FRIEND is incorrect. The function
10436 is not a template instantiation and should not be mangled like
10437 one. Therefore, we forget the mangling here; we'll recompute it
10438 later if we need it. */
10439 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
10441 SET_DECL_RTL (new_friend
, NULL
);
10442 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
10445 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
10448 tree new_friend_template_info
;
10449 tree new_friend_result_template_info
;
10451 int new_friend_is_defn
;
10453 /* We must save some information from NEW_FRIEND before calling
10454 duplicate decls since that function will free NEW_FRIEND if
10456 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
10457 new_friend_is_defn
=
10458 (DECL_INITIAL (DECL_TEMPLATE_RESULT
10459 (template_for_substitution (new_friend
)))
10461 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
10463 /* This declaration is a `primary' template. */
10464 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
10466 new_friend_result_template_info
10467 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
10470 new_friend_result_template_info
= NULL_TREE
;
10472 /* Inside pushdecl_namespace_level, we will push into the
10473 current namespace. However, the friend function should go
10474 into the namespace of the template. */
10475 ns
= decl_namespace_context (new_friend
);
10476 push_nested_namespace (ns
);
10477 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
10478 pop_nested_namespace (ns
);
10480 if (old_decl
== error_mark_node
)
10481 return error_mark_node
;
10483 if (old_decl
!= new_friend
)
10485 /* This new friend declaration matched an existing
10486 declaration. For example, given:
10488 template <class T> void f(T);
10489 template <class U> class C {
10490 template <class T> friend void f(T) {}
10493 the friend declaration actually provides the definition
10494 of `f', once C has been instantiated for some type. So,
10495 old_decl will be the out-of-class template declaration,
10496 while new_friend is the in-class definition.
10498 But, if `f' was called before this point, the
10499 instantiation of `f' will have DECL_TI_ARGS corresponding
10500 to `T' but not to `U', references to which might appear
10501 in the definition of `f'. Previously, the most general
10502 template for an instantiation of `f' was the out-of-class
10503 version; now it is the in-class version. Therefore, we
10504 run through all specialization of `f', adding to their
10505 DECL_TI_ARGS appropriately. In particular, they need a
10506 new set of outer arguments, corresponding to the
10507 arguments for this class instantiation.
10509 The same situation can arise with something like this:
10511 friend void f(int);
10512 template <class T> class C {
10513 friend void f(T) {}
10516 when `C<int>' is instantiated. Now, `f(int)' is defined
10519 if (!new_friend_is_defn
)
10520 /* On the other hand, if the in-class declaration does
10521 *not* provide a definition, then we don't want to alter
10522 existing definitions. We can just leave everything
10527 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
10528 tree new_args
= TI_ARGS (new_friend_template_info
);
10530 /* Overwrite whatever template info was there before, if
10531 any, with the new template information pertaining to
10532 the declaration. */
10533 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
10535 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
10537 /* We should have called reregister_specialization in
10538 duplicate_decls. */
10539 gcc_assert (retrieve_specialization (new_template
,
10543 /* Instantiate it if the global has already been used. */
10544 if (DECL_ODR_USED (old_decl
))
10545 instantiate_decl (old_decl
, /*defer_ok=*/true,
10546 /*expl_inst_class_mem_p=*/false);
10552 /* Indicate that the old function template is a partial
10554 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
10555 = new_friend_result_template_info
;
10557 gcc_assert (new_template
10558 == most_general_template (new_template
));
10559 gcc_assert (new_template
!= old_decl
);
10561 /* Reassign any specializations already in the hash table
10562 to the new more general template, and add the
10563 additional template args. */
10564 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
10566 t
= TREE_CHAIN (t
))
10568 tree spec
= TREE_VALUE (t
);
10571 elt
.tmpl
= old_decl
;
10572 elt
.args
= DECL_TI_ARGS (spec
);
10573 elt
.spec
= NULL_TREE
;
10575 decl_specializations
->remove_elt (&elt
);
10577 DECL_TI_ARGS (spec
)
10578 = add_outermost_template_args (new_args
,
10579 DECL_TI_ARGS (spec
));
10581 register_specialization
10582 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
10585 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
10589 /* The information from NEW_FRIEND has been merged into OLD_DECL
10590 by duplicate_decls. */
10591 new_friend
= old_decl
;
10596 tree context
= DECL_CONTEXT (new_friend
);
10600 template <class T> class C {
10601 template <class U> friend void C1<U>::f (); // case 1
10602 friend void C2<T>::f (); // case 2
10604 we only need to make sure CONTEXT is a complete type for
10605 case 2. To distinguish between the two cases, we note that
10606 CONTEXT of case 1 remains dependent type after tsubst while
10607 this isn't true for case 2. */
10608 ++processing_template_decl
;
10609 dependent_p
= dependent_type_p (context
);
10610 --processing_template_decl
;
10613 && !complete_type_or_else (context
, NULL_TREE
))
10614 return error_mark_node
;
10616 if (COMPLETE_TYPE_P (context
))
10618 tree fn
= new_friend
;
10619 /* do_friend adds the TEMPLATE_DECL for any member friend
10620 template even if it isn't a member template, i.e.
10621 template <class T> friend A<T>::f();
10622 Look through it in that case. */
10623 if (TREE_CODE (fn
) == TEMPLATE_DECL
10624 && !PRIMARY_TEMPLATE_P (fn
))
10625 fn
= DECL_TEMPLATE_RESULT (fn
);
10626 /* Check to see that the declaration is really present, and,
10627 possibly obtain an improved declaration. */
10628 fn
= check_classfn (context
, fn
, NULL_TREE
);
10638 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
10639 template arguments, as for tsubst.
10641 Returns an appropriate tsubst'd friend type or error_mark_node on
10645 tsubst_friend_class (tree friend_tmpl
, tree args
)
10649 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
10651 tmpl
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
10652 return TREE_TYPE (tmpl
);
10655 tree context
= CP_DECL_CONTEXT (friend_tmpl
);
10656 if (TREE_CODE (context
) == NAMESPACE_DECL
)
10657 push_nested_namespace (context
);
10660 context
= tsubst (context
, args
, tf_error
, NULL_TREE
);
10661 push_nested_class (context
);
10664 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), /*prefer_type=*/false,
10665 /*non_class=*/false, /*block_p=*/false,
10666 /*namespaces_only=*/false, LOOKUP_HIDDEN
);
10668 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
10670 /* The friend template has already been declared. Just
10671 check to see that the declarations match, and install any new
10672 default parameters. We must tsubst the default parameters,
10673 of course. We only need the innermost template parameters
10674 because that is all that redeclare_class_template will look
10676 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
10677 > TMPL_ARGS_DEPTH (args
))
10679 tree parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
10680 args
, tf_warning_or_error
);
10681 location_t saved_input_location
= input_location
;
10682 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
10683 tree cons
= get_constraints (tmpl
);
10684 redeclare_class_template (TREE_TYPE (tmpl
), parms
, cons
);
10685 input_location
= saved_input_location
;
10690 /* The friend template has not already been declared. In this
10691 case, the instantiation of the template class will cause the
10692 injection of this template into the namespace scope. */
10693 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
10695 if (tmpl
!= error_mark_node
)
10697 /* The new TMPL is not an instantiation of anything, so we
10698 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE
10699 for the new type because that is supposed to be the
10700 corresponding template decl, i.e., TMPL. */
10701 DECL_USE_TEMPLATE (tmpl
) = 0;
10702 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
10703 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
10704 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
10705 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
10707 /* It is hidden. */
10708 retrofit_lang_decl (DECL_TEMPLATE_RESULT (tmpl
));
10709 DECL_ANTICIPATED (tmpl
)
10710 = DECL_ANTICIPATED (DECL_TEMPLATE_RESULT (tmpl
)) = true;
10712 /* Inject this template into the enclosing namspace scope. */
10713 tmpl
= pushdecl_namespace_level (tmpl
, true);
10717 if (TREE_CODE (context
) == NAMESPACE_DECL
)
10718 pop_nested_namespace (context
);
10720 pop_nested_class ();
10722 return TREE_TYPE (tmpl
);
10725 /* Returns zero if TYPE cannot be completed later due to circularity.
10726 Otherwise returns one. */
10729 can_complete_type_without_circularity (tree type
)
10731 if (type
== NULL_TREE
|| type
== error_mark_node
)
10733 else if (COMPLETE_TYPE_P (type
))
10735 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10736 return can_complete_type_without_circularity (TREE_TYPE (type
));
10737 else if (CLASS_TYPE_P (type
)
10738 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
10744 static tree
tsubst_omp_clauses (tree
, enum c_omp_region_type
, tree
,
10745 tsubst_flags_t
, tree
);
10747 /* Instantiate a single dependent attribute T (a TREE_LIST), and return either
10748 T or a new TREE_LIST, possibly a chain in the case of a pack expansion. */
10751 tsubst_attribute (tree t
, tree
*decl_p
, tree args
,
10752 tsubst_flags_t complain
, tree in_decl
)
10754 gcc_assert (ATTR_IS_DEPENDENT (t
));
10756 tree val
= TREE_VALUE (t
);
10757 if (val
== NULL_TREE
)
10758 /* Nothing to do. */;
10759 else if ((flag_openmp
|| flag_openmp_simd
)
10760 && is_attribute_p ("omp declare simd",
10761 get_attribute_name (t
)))
10763 tree clauses
= TREE_VALUE (val
);
10764 clauses
= tsubst_omp_clauses (clauses
, C_ORT_OMP_DECLARE_SIMD
, args
,
10765 complain
, in_decl
);
10766 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
10767 clauses
= finish_omp_clauses (clauses
, C_ORT_OMP_DECLARE_SIMD
);
10768 tree parms
= DECL_ARGUMENTS (*decl_p
);
10770 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
10772 val
= build_tree_list (NULL_TREE
, clauses
);
10776 /* If the first attribute argument is an identifier, don't
10777 pass it through tsubst. Attributes like mode, format,
10778 cleanup and several target specific attributes expect it
10780 else if (attribute_takes_identifier_p (get_attribute_name (t
)))
10783 = tsubst_expr (TREE_CHAIN (val
), args
, complain
, in_decl
,
10784 /*integral_constant_expression_p=*/false);
10785 if (chain
!= TREE_CHAIN (val
))
10786 val
= tree_cons (NULL_TREE
, TREE_VALUE (val
), chain
);
10788 else if (PACK_EXPANSION_P (val
))
10790 /* An attribute pack expansion. */
10791 tree purp
= TREE_PURPOSE (t
);
10792 tree pack
= tsubst_pack_expansion (val
, args
, complain
, in_decl
);
10793 if (pack
== error_mark_node
)
10794 return error_mark_node
;
10795 int len
= TREE_VEC_LENGTH (pack
);
10796 tree list
= NULL_TREE
;
10798 for (int i
= 0; i
< len
; ++i
)
10800 tree elt
= TREE_VEC_ELT (pack
, i
);
10801 *q
= build_tree_list (purp
, elt
);
10802 q
= &TREE_CHAIN (*q
);
10807 val
= tsubst_expr (val
, args
, complain
, in_decl
,
10808 /*integral_constant_expression_p=*/false);
10810 if (val
!= TREE_VALUE (t
))
10811 return build_tree_list (TREE_PURPOSE (t
), val
);
10815 /* Instantiate any dependent attributes in ATTRIBUTES, returning either it
10816 unchanged or a new TREE_LIST chain. */
10819 tsubst_attributes (tree attributes
, tree args
,
10820 tsubst_flags_t complain
, tree in_decl
)
10822 tree last_dep
= NULL_TREE
;
10824 for (tree t
= attributes
; t
; t
= TREE_CHAIN (t
))
10825 if (ATTR_IS_DEPENDENT (t
))
10828 attributes
= copy_list (attributes
);
10833 for (tree
*p
= &attributes
; *p
; )
10836 if (ATTR_IS_DEPENDENT (t
))
10838 tree subst
= tsubst_attribute (t
, NULL
, args
, complain
, in_decl
);
10843 p
= &TREE_CHAIN (*p
);
10844 *p
= TREE_CHAIN (t
);
10848 p
= &TREE_CHAIN (*p
);
10854 /* Apply any attributes which had to be deferred until instantiation
10855 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
10856 ARGS, COMPLAIN, IN_DECL are as tsubst. */
10859 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
10860 tree args
, tsubst_flags_t complain
, tree in_decl
)
10862 tree last_dep
= NULL_TREE
;
10866 if (attributes
== NULL_TREE
)
10869 if (DECL_P (*decl_p
))
10871 if (TREE_TYPE (*decl_p
) == error_mark_node
)
10873 p
= &DECL_ATTRIBUTES (*decl_p
);
10874 /* DECL_ATTRIBUTES comes from copy_node in tsubst_decl, and is identical
10875 to our attributes parameter. */
10876 gcc_assert (*p
== attributes
);
10880 p
= &TYPE_ATTRIBUTES (*decl_p
);
10881 /* TYPE_ATTRIBUTES was set up (with abi_tag and may_alias) in
10882 lookup_template_class_1, and should be preserved. */
10883 gcc_assert (*p
!= attributes
);
10885 p
= &TREE_CHAIN (*p
);
10888 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
10889 if (ATTR_IS_DEPENDENT (t
))
10892 attributes
= copy_list (attributes
);
10899 tree late_attrs
= NULL_TREE
;
10900 tree
*q
= &late_attrs
;
10905 if (ATTR_IS_DEPENDENT (t
))
10907 *p
= TREE_CHAIN (t
);
10908 TREE_CHAIN (t
) = NULL_TREE
;
10909 *q
= tsubst_attribute (t
, decl_p
, args
, complain
, in_decl
);
10911 q
= &TREE_CHAIN (*q
);
10914 p
= &TREE_CHAIN (t
);
10917 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
10921 /* Perform (or defer) access check for typedefs that were referenced
10922 from within the template TMPL code.
10923 This is a subroutine of instantiate_decl and instantiate_class_template.
10924 TMPL is the template to consider and TARGS is the list of arguments of
10928 perform_typedefs_access_check (tree tmpl
, tree targs
)
10930 location_t saved_location
;
10932 qualified_typedef_usage_t
*iter
;
10935 || (!CLASS_TYPE_P (tmpl
)
10936 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
10939 saved_location
= input_location
;
10940 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
10942 tree type_decl
= iter
->typedef_decl
;
10943 tree type_scope
= iter
->context
;
10945 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
10948 if (uses_template_parms (type_decl
))
10949 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
10950 if (uses_template_parms (type_scope
))
10951 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
10953 /* Make access check error messages point to the location
10954 of the use of the typedef. */
10955 input_location
= iter
->locus
;
10956 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
10957 type_decl
, type_decl
,
10958 tf_warning_or_error
);
10960 input_location
= saved_location
;
10964 instantiate_class_template_1 (tree type
)
10966 tree templ
, args
, pattern
, t
, member
;
10970 unsigned int saved_maximum_field_alignment
;
10973 if (type
== error_mark_node
)
10974 return error_mark_node
;
10976 if (COMPLETE_OR_OPEN_TYPE_P (type
)
10977 || uses_template_parms (type
))
10980 /* Figure out which template is being instantiated. */
10981 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
10982 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
10984 /* Mark the type as in the process of being defined. */
10985 TYPE_BEING_DEFINED (type
) = 1;
10987 /* We may be in the middle of deferred access check. Disable
10989 deferring_access_check_sentinel
acs (dk_no_deferred
);
10991 /* Determine what specialization of the original template to
10993 t
= most_specialized_partial_spec (type
, tf_warning_or_error
);
10994 if (t
== error_mark_node
)
10995 return error_mark_node
;
10998 /* This TYPE is actually an instantiation of a partial
10999 specialization. We replace the innermost set of ARGS with
11000 the arguments appropriate for substitution. For example,
11003 template <class T> struct S {};
11004 template <class T> struct S<T*> {};
11006 and supposing that we are instantiating S<int*>, ARGS will
11007 presently be {int*} -- but we need {int}. */
11008 pattern
= TREE_TYPE (t
);
11009 args
= TREE_PURPOSE (t
);
11013 pattern
= TREE_TYPE (templ
);
11014 args
= CLASSTYPE_TI_ARGS (type
);
11017 /* If the template we're instantiating is incomplete, then clearly
11018 there's nothing we can do. */
11019 if (!COMPLETE_TYPE_P (pattern
))
11021 /* We can try again later. */
11022 TYPE_BEING_DEFINED (type
) = 0;
11026 /* If we've recursively instantiated too many templates, stop. */
11027 if (! push_tinst_level (type
))
11030 int saved_unevaluated_operand
= cp_unevaluated_operand
;
11031 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
11033 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
11034 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
11035 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
11036 fn_context
= error_mark_node
;
11038 push_to_top_level ();
11041 cp_unevaluated_operand
= 0;
11042 c_inhibit_evaluation_warnings
= 0;
11044 /* Use #pragma pack from the template context. */
11045 saved_maximum_field_alignment
= maximum_field_alignment
;
11046 maximum_field_alignment
= TYPE_PRECISION (pattern
);
11048 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
11050 /* Set the input location to the most specialized template definition.
11051 This is needed if tsubsting causes an error. */
11052 typedecl
= TYPE_MAIN_DECL (pattern
);
11053 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
11054 DECL_SOURCE_LOCATION (typedecl
);
11056 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
11057 SET_TYPE_ALIGN (type
, TYPE_ALIGN (pattern
));
11058 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
11059 CLASSTYPE_NON_AGGREGATE (type
) = CLASSTYPE_NON_AGGREGATE (pattern
);
11060 if (ANON_AGGR_TYPE_P (pattern
))
11061 SET_ANON_AGGR_TYPE_P (type
);
11062 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
11064 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
11065 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
11066 /* Adjust visibility for template arguments. */
11067 determine_visibility (TYPE_MAIN_DECL (type
));
11069 if (CLASS_TYPE_P (type
))
11070 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
11072 pbinfo
= TYPE_BINFO (pattern
);
11074 /* We should never instantiate a nested class before its enclosing
11075 class; we need to look up the nested class by name before we can
11076 instantiate it, and that lookup should instantiate the enclosing
11078 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
11079 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
11081 base_list
= NULL_TREE
;
11082 if (BINFO_N_BASE_BINFOS (pbinfo
))
11088 /* We must enter the scope containing the type, as that is where
11089 the accessibility of types named in dependent bases are
11091 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
11093 /* Substitute into each of the bases to determine the actual
11095 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
11098 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
11099 tree expanded_bases
= NULL_TREE
;
11102 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
11105 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
11106 args
, tf_error
, NULL_TREE
);
11107 if (expanded_bases
== error_mark_node
)
11110 len
= TREE_VEC_LENGTH (expanded_bases
);
11113 for (idx
= 0; idx
< len
; idx
++)
11115 if (expanded_bases
)
11116 /* Extract the already-expanded base class. */
11117 base
= TREE_VEC_ELT (expanded_bases
, idx
);
11119 /* Substitute to figure out the base class. */
11120 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
11123 if (base
== error_mark_node
)
11126 base_list
= tree_cons (access
, base
, base_list
);
11127 if (BINFO_VIRTUAL_P (pbase_binfo
))
11128 TREE_TYPE (base_list
) = integer_type_node
;
11132 /* The list is now in reverse order; correct that. */
11133 base_list
= nreverse (base_list
);
11136 pop_scope (pushed_scope
);
11138 /* Now call xref_basetypes to set up all the base-class
11140 xref_basetypes (type
, base_list
);
11142 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
11143 (int) ATTR_FLAG_TYPE_IN_PLACE
,
11144 args
, tf_error
, NULL_TREE
);
11145 fixup_attribute_variants (type
);
11147 /* Now that our base classes are set up, enter the scope of the
11148 class, so that name lookups into base classes, etc. will work
11149 correctly. This is precisely analogous to what we do in
11150 begin_class_definition when defining an ordinary non-template
11151 class, except we also need to push the enclosing classes. */
11152 push_nested_class (type
);
11154 /* Now members are processed in the order of declaration. */
11155 for (member
= CLASSTYPE_DECL_LIST (pattern
);
11156 member
; member
= TREE_CHAIN (member
))
11158 tree t
= TREE_VALUE (member
);
11160 if (TREE_PURPOSE (member
))
11164 if (LAMBDA_TYPE_P (t
))
11165 /* A closure type for a lambda in an NSDMI or default argument.
11166 Ignore it; it will be regenerated when needed. */
11169 /* Build new CLASSTYPE_NESTED_UTDS. */
11172 bool class_template_p
;
11174 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
11175 && TYPE_LANG_SPECIFIC (t
)
11176 && CLASSTYPE_IS_TEMPLATE (t
));
11177 /* If the member is a class template, then -- even after
11178 substitution -- there may be dependent types in the
11179 template argument list for the class. We increment
11180 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
11181 that function will assume that no types are dependent
11182 when outside of a template. */
11183 if (class_template_p
)
11184 ++processing_template_decl
;
11185 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
11186 if (class_template_p
)
11187 --processing_template_decl
;
11188 if (newtag
== error_mark_node
)
11191 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
11193 tree name
= TYPE_IDENTIFIER (t
);
11195 if (class_template_p
)
11196 /* Unfortunately, lookup_template_class sets
11197 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
11198 instantiation (i.e., for the type of a member
11199 template class nested within a template class.)
11200 This behavior is required for
11201 maybe_process_partial_specialization to work
11202 correctly, but is not accurate in this case;
11203 the TAG is not an instantiation of anything.
11204 (The corresponding TEMPLATE_DECL is an
11205 instantiation, but the TYPE is not.) */
11206 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
11208 /* Now, we call pushtag to put this NEWTAG into the scope of
11209 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
11210 pushtag calling push_template_decl. We don't have to do
11211 this for enums because it will already have been done in
11214 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
11215 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
11218 else if (DECL_DECLARES_FUNCTION_P (t
))
11222 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11223 ++processing_template_decl
;
11224 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
11225 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11226 --processing_template_decl
;
11227 set_current_access_from_decl (r
);
11228 finish_member_declaration (r
);
11229 /* Instantiate members marked with attribute used. */
11230 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
11232 if (TREE_CODE (r
) == FUNCTION_DECL
11233 && DECL_OMP_DECLARE_REDUCTION_P (r
))
11234 cp_check_omp_declare_reduction (r
);
11236 else if ((DECL_CLASS_TEMPLATE_P (t
) || DECL_IMPLICIT_TYPEDEF_P (t
))
11237 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
11238 /* A closure type for a lambda in an NSDMI or default argument.
11239 Ignore it; it will be regenerated when needed. */;
11242 /* Build new TYPE_FIELDS. */
11243 if (TREE_CODE (t
) == STATIC_ASSERT
)
11247 ++c_inhibit_evaluation_warnings
;
11249 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
11250 tf_warning_or_error
, NULL_TREE
,
11251 /*integral_constant_expression_p=*/true);
11252 --c_inhibit_evaluation_warnings
;
11254 finish_static_assert (condition
,
11255 STATIC_ASSERT_MESSAGE (t
),
11256 STATIC_ASSERT_SOURCE_LOCATION (t
),
11257 /*member_p=*/true);
11259 else if (TREE_CODE (t
) != CONST_DECL
)
11262 tree vec
= NULL_TREE
;
11265 /* The file and line for this declaration, to
11266 assist in error message reporting. Since we
11267 called push_tinst_level above, we don't need to
11269 input_location
= DECL_SOURCE_LOCATION (t
);
11271 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11272 ++processing_template_decl
;
11273 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
11274 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11275 --processing_template_decl
;
11277 if (TREE_CODE (r
) == TREE_VEC
)
11279 /* A capture pack became multiple fields. */
11281 len
= TREE_VEC_LENGTH (vec
);
11284 for (int i
= 0; i
< len
; ++i
)
11287 r
= TREE_VEC_ELT (vec
, i
);
11292 [t]he initialization (and any associated
11293 side-effects) of a static data member does
11294 not occur unless the static data member is
11295 itself used in a way that requires the
11296 definition of the static data member to
11299 Therefore, we do not substitute into the
11300 initialized for the static data member here. */
11301 finish_static_data_member_decl
11303 /*init=*/NULL_TREE
,
11304 /*init_const_expr_p=*/false,
11305 /*asmspec_tree=*/NULL_TREE
,
11307 /* Instantiate members marked with attribute used. */
11308 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
11311 else if (TREE_CODE (r
) == FIELD_DECL
)
11313 /* Determine whether R has a valid type and can be
11314 completed later. If R is invalid, then its type
11315 is replaced by error_mark_node. */
11316 tree rtype
= TREE_TYPE (r
);
11317 if (can_complete_type_without_circularity (rtype
))
11318 complete_type (rtype
);
11320 if (!complete_or_array_type_p (rtype
))
11322 /* If R's type couldn't be completed and
11323 it isn't a flexible array member (whose
11324 type is incomplete by definition) give
11326 cxx_incomplete_type_error (r
, rtype
);
11327 TREE_TYPE (r
) = error_mark_node
;
11329 else if (TREE_CODE (rtype
) == ARRAY_TYPE
11330 && TYPE_DOMAIN (rtype
) == NULL_TREE
11331 && (TREE_CODE (type
) == UNION_TYPE
11332 || TREE_CODE (type
) == QUAL_UNION_TYPE
))
11334 error ("flexible array member %qD in union", r
);
11335 TREE_TYPE (r
) = error_mark_node
;
11339 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
11340 such a thing will already have been added to the field
11341 list by tsubst_enum in finish_member_declaration in the
11342 CLASSTYPE_NESTED_UTDS case above. */
11343 if (!(TREE_CODE (r
) == TYPE_DECL
11344 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
11345 && DECL_ARTIFICIAL (r
)))
11347 set_current_access_from_decl (r
);
11348 finish_member_declaration (r
);
11356 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
11357 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
11359 /* Build new CLASSTYPE_FRIEND_CLASSES. */
11361 tree friend_type
= t
;
11362 bool adjust_processing_template_decl
= false;
11364 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
11366 /* template <class T> friend class C; */
11367 friend_type
= tsubst_friend_class (friend_type
, args
);
11368 adjust_processing_template_decl
= true;
11370 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
11372 /* template <class T> friend class C::D; */
11373 friend_type
= tsubst (friend_type
, args
,
11374 tf_warning_or_error
, NULL_TREE
);
11375 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
11376 friend_type
= TREE_TYPE (friend_type
);
11377 adjust_processing_template_decl
= true;
11379 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
11380 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
11382 /* This could be either
11386 when dependent_type_p is false or
11388 template <class U> friend class T::C;
11391 /* Bump processing_template_decl in case this is something like
11392 template <class T> friend struct A<T>::B. */
11393 ++processing_template_decl
;
11394 friend_type
= tsubst (friend_type
, args
,
11395 tf_warning_or_error
, NULL_TREE
);
11396 if (dependent_type_p (friend_type
))
11397 adjust_processing_template_decl
= true;
11398 --processing_template_decl
;
11400 else if (TREE_CODE (friend_type
) != BOUND_TEMPLATE_TEMPLATE_PARM
11401 && !CLASSTYPE_USE_TEMPLATE (friend_type
)
11402 && TYPE_HIDDEN_P (friend_type
))
11406 where C hasn't been declared yet. Let's lookup name
11407 from namespace scope directly, bypassing any name that
11408 come from dependent base class. */
11409 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
11411 /* The call to xref_tag_from_type does injection for friend
11413 push_nested_namespace (ns
);
11415 xref_tag_from_type (friend_type
, NULL_TREE
,
11416 /*tag_scope=*/ts_current
);
11417 pop_nested_namespace (ns
);
11419 else if (uses_template_parms (friend_type
))
11420 /* friend class C<T>; */
11421 friend_type
= tsubst (friend_type
, args
,
11422 tf_warning_or_error
, NULL_TREE
);
11427 where C is already declared or
11429 friend class C<int>;
11431 We don't have to do anything in these cases. */
11433 if (adjust_processing_template_decl
)
11434 /* Trick make_friend_class into realizing that the friend
11435 we're adding is a template, not an ordinary class. It's
11436 important that we use make_friend_class since it will
11437 perform some error-checking and output cross-reference
11439 ++processing_template_decl
;
11441 if (friend_type
!= error_mark_node
)
11442 make_friend_class (type
, friend_type
, /*complain=*/false);
11444 if (adjust_processing_template_decl
)
11445 --processing_template_decl
;
11449 /* Build new DECL_FRIENDLIST. */
11452 /* The file and line for this declaration, to
11453 assist in error message reporting. Since we
11454 called push_tinst_level above, we don't need to
11456 input_location
= DECL_SOURCE_LOCATION (t
);
11458 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11460 ++processing_template_decl
;
11461 push_deferring_access_checks (dk_no_check
);
11464 r
= tsubst_friend_function (t
, args
);
11465 add_friend (type
, r
, /*complain=*/false);
11466 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11468 pop_deferring_access_checks ();
11469 --processing_template_decl
;
11477 /* Restore these before substituting into the lambda capture
11479 cp_unevaluated_operand
= saved_unevaluated_operand
;
11480 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
11483 /* Set the file and line number information to whatever is given for
11484 the class itself. This puts error messages involving generated
11485 implicit functions at a predictable point, and the same point
11486 that would be used for non-template classes. */
11487 input_location
= DECL_SOURCE_LOCATION (typedecl
);
11489 unreverse_member_declarations (type
);
11490 finish_struct_1 (type
);
11491 TYPE_BEING_DEFINED (type
) = 0;
11493 /* We don't instantiate default arguments for member functions. 14.7.1:
11495 The implicit instantiation of a class template specialization causes
11496 the implicit instantiation of the declarations, but not of the
11497 definitions or default arguments, of the class member functions,
11498 member classes, static data members and member templates.... */
11500 /* Some typedefs referenced from within the template code need to be access
11501 checked at template instantiation time, i.e now. These types were
11502 added to the template at parsing time. Let's get those and perform
11503 the access checks then. */
11504 perform_typedefs_access_check (pattern
, args
);
11505 perform_deferred_access_checks (tf_warning_or_error
);
11506 pop_nested_class ();
11507 maximum_field_alignment
= saved_maximum_field_alignment
;
11509 pop_from_top_level ();
11510 pop_tinst_level ();
11512 /* The vtable for a template class can be emitted in any translation
11513 unit in which the class is instantiated. When there is no key
11514 method, however, finish_struct_1 will already have added TYPE to
11515 the keyed_classes. */
11516 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
11517 vec_safe_push (keyed_classes
, type
);
11522 /* Wrapper for instantiate_class_template_1. */
11525 instantiate_class_template (tree type
)
11528 timevar_push (TV_TEMPLATE_INST
);
11529 ret
= instantiate_class_template_1 (type
);
11530 timevar_pop (TV_TEMPLATE_INST
);
11535 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11541 else if (TYPE_P (t
))
11542 r
= tsubst (t
, args
, complain
, in_decl
);
11545 if (!(complain
& tf_warning
))
11546 ++c_inhibit_evaluation_warnings
;
11547 r
= tsubst_expr (t
, args
, complain
, in_decl
,
11548 /*integral_constant_expression_p=*/true);
11549 if (!(complain
& tf_warning
))
11550 --c_inhibit_evaluation_warnings
;
11555 /* Given a function parameter pack TMPL_PARM and some function parameters
11556 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
11557 and set *SPEC_P to point at the next point in the list. */
11560 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
11562 /* Collect all of the extra "packed" parameters into an
11565 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
11566 tree spec_parm
= *spec_p
;
11569 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
11571 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
11574 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
11575 parmvec
= make_tree_vec (len
);
11576 spec_parm
= *spec_p
;
11577 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
11579 tree elt
= spec_parm
;
11580 if (DECL_PACK_P (elt
))
11581 elt
= make_pack_expansion (elt
);
11582 TREE_VEC_ELT (parmvec
, i
) = elt
;
11585 /* Build the argument packs. */
11586 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
11587 *spec_p
= spec_parm
;
11592 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
11593 NONTYPE_ARGUMENT_PACK. */
11596 make_fnparm_pack (tree spec_parm
)
11598 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
11601 /* Return 1 if the Ith element of the argument pack ARG_PACK is a
11602 pack expansion with no extra args, 2 if it has extra args, or 0
11603 if it is not a pack expansion. */
11606 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
11608 if (TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
11609 /* We're being called before this happens in tsubst_pack_expansion. */
11610 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
11611 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
11612 if (i
>= TREE_VEC_LENGTH (vec
))
11614 tree elt
= TREE_VEC_ELT (vec
, i
);
11616 /* A decl pack is itself an expansion. */
11617 elt
= TREE_TYPE (elt
);
11618 if (!PACK_EXPANSION_P (elt
))
11620 if (PACK_EXPANSION_EXTRA_ARGS (elt
))
11626 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
11629 make_argument_pack_select (tree arg_pack
, unsigned index
)
11631 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
11633 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
11634 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
11639 /* This is a subroutine of tsubst_pack_expansion.
11641 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
11642 mechanism to store the (non complete list of) arguments of the
11643 substitution and return a non substituted pack expansion, in order
11644 to wait for when we have enough arguments to really perform the
11648 use_pack_expansion_extra_args_p (tree parm_packs
,
11650 bool has_empty_arg
)
11652 /* If one pack has an expansion and another pack has a normal
11653 argument or if one pack has an empty argument and an another
11654 one hasn't then tsubst_pack_expansion cannot perform the
11655 substitution and need to fall back on the
11656 PACK_EXPANSION_EXTRA mechanism. */
11657 if (parm_packs
== NULL_TREE
)
11659 else if (has_empty_arg
)
11662 bool has_expansion_arg
= false;
11663 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
11665 bool has_non_expansion_arg
= false;
11666 for (tree parm_pack
= parm_packs
;
11668 parm_pack
= TREE_CHAIN (parm_pack
))
11670 tree arg
= TREE_VALUE (parm_pack
);
11672 int exp
= argument_pack_element_is_expansion_p (arg
, i
);
11674 /* We can't substitute a pack expansion with extra args into
11678 has_expansion_arg
= true;
11680 has_non_expansion_arg
= true;
11683 if (has_expansion_arg
&& has_non_expansion_arg
)
11689 /* [temp.variadic]/6 says that:
11691 The instantiation of a pack expansion [...]
11692 produces a list E1,E2, ..., En, where N is the number of elements
11693 in the pack expansion parameters.
11695 This subroutine of tsubst_pack_expansion produces one of these Ei.
11697 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
11698 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
11699 PATTERN, and each TREE_VALUE is its corresponding argument pack.
11700 INDEX is the index 'i' of the element Ei to produce. ARGS,
11701 COMPLAIN, and IN_DECL are the same parameters as for the
11702 tsubst_pack_expansion function.
11704 The function returns the resulting Ei upon successful completion,
11705 or error_mark_node.
11707 Note that this function possibly modifies the ARGS parameter, so
11708 it's the responsibility of the caller to restore it. */
11711 gen_elem_of_pack_expansion_instantiation (tree pattern
,
11714 tree args
/* This parm gets
11716 tsubst_flags_t complain
,
11720 bool ith_elem_is_expansion
= false;
11722 /* For each parameter pack, change the substitution of the parameter
11723 pack to the ith argument in its argument pack, then expand the
11725 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
11727 tree parm
= TREE_PURPOSE (pack
);
11728 tree arg_pack
= TREE_VALUE (pack
);
11729 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
11731 ith_elem_is_expansion
|=
11732 argument_pack_element_is_expansion_p (arg_pack
, index
);
11734 /* Select the Ith argument from the pack. */
11735 if (TREE_CODE (parm
) == PARM_DECL
11737 || TREE_CODE (parm
) == FIELD_DECL
)
11741 aps
= make_argument_pack_select (arg_pack
, index
);
11742 if (!mark_used (parm
, complain
) && !(complain
& tf_error
))
11743 return error_mark_node
;
11744 register_local_specialization (aps
, parm
);
11747 aps
= retrieve_local_specialization (parm
);
11752 template_parm_level_and_index (parm
, &level
, &idx
);
11756 aps
= make_argument_pack_select (arg_pack
, index
);
11757 /* Update the corresponding argument. */
11758 TMPL_ARG (args
, level
, idx
) = aps
;
11761 /* Re-use the ARGUMENT_PACK_SELECT. */
11762 aps
= TMPL_ARG (args
, level
, idx
);
11764 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
11767 /* Substitute into the PATTERN with the (possibly altered)
11769 if (pattern
== in_decl
)
11770 /* Expanding a fixed parameter pack from
11771 coerce_template_parameter_pack. */
11772 t
= tsubst_decl (pattern
, args
, complain
);
11773 else if (pattern
== error_mark_node
)
11774 t
= error_mark_node
;
11775 else if (constraint_p (pattern
))
11777 if (processing_template_decl
)
11778 t
= tsubst_constraint (pattern
, args
, complain
, in_decl
);
11780 t
= (constraints_satisfied_p (pattern
, args
)
11781 ? boolean_true_node
: boolean_false_node
);
11783 else if (!TYPE_P (pattern
))
11784 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
11785 /*integral_constant_expression_p=*/false);
11787 t
= tsubst (pattern
, args
, complain
, in_decl
);
11789 /* If the Ith argument pack element is a pack expansion, then
11790 the Ith element resulting from the substituting is going to
11791 be a pack expansion as well. */
11792 if (ith_elem_is_expansion
)
11793 t
= make_pack_expansion (t
, complain
);
11798 /* When the unexpanded parameter pack in a fold expression expands to an empty
11799 sequence, the value of the expression is as follows; the program is
11800 ill-formed if the operator is not listed in this table.
11807 expand_empty_fold (tree t
, tsubst_flags_t complain
)
11809 tree_code code
= (tree_code
)TREE_INT_CST_LOW (TREE_OPERAND (t
, 0));
11810 if (!FOLD_EXPR_MODIFY_P (t
))
11813 case TRUTH_ANDIF_EXPR
:
11814 return boolean_true_node
;
11815 case TRUTH_ORIF_EXPR
:
11816 return boolean_false_node
;
11817 case COMPOUND_EXPR
:
11823 if (complain
& tf_error
)
11824 error_at (location_of (t
),
11825 "fold of empty expansion over %O", code
);
11826 return error_mark_node
;
11829 /* Given a fold-expression T and a current LEFT and RIGHT operand,
11830 form an expression that combines the two terms using the
11834 fold_expression (tree t
, tree left
, tree right
, tsubst_flags_t complain
)
11836 tree op
= FOLD_EXPR_OP (t
);
11837 tree_code code
= (tree_code
)TREE_INT_CST_LOW (op
);
11839 // Handle compound assignment operators.
11840 if (FOLD_EXPR_MODIFY_P (t
))
11841 return build_x_modify_expr (input_location
, left
, code
, right
, complain
);
11845 case COMPOUND_EXPR
:
11846 return build_x_compound_expr (input_location
, left
, right
, complain
);
11848 return build_x_binary_op (input_location
, code
,
11849 left
, TREE_CODE (left
),
11850 right
, TREE_CODE (right
),
11856 /* Substitute ARGS into the pack of a fold expression T. */
11859 tsubst_fold_expr_pack (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11861 return tsubst_pack_expansion (FOLD_EXPR_PACK (t
), args
, complain
, in_decl
);
11864 /* Substitute ARGS into the pack of a fold expression T. */
11867 tsubst_fold_expr_init (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11869 return tsubst_expr (FOLD_EXPR_INIT (t
), args
, complain
, in_decl
, false);
11872 /* Expand a PACK of arguments into a grouped as left fold.
11873 Given a pack containing elements A0, A1, ..., An and an
11874 operator @, this builds the expression:
11876 ((A0 @ A1) @ A2) ... @ An
11878 Note that PACK must not be empty.
11880 The operator is defined by the original fold expression T. */
11883 expand_left_fold (tree t
, tree pack
, tsubst_flags_t complain
)
11885 tree left
= TREE_VEC_ELT (pack
, 0);
11886 for (int i
= 1; i
< TREE_VEC_LENGTH (pack
); ++i
)
11888 tree right
= TREE_VEC_ELT (pack
, i
);
11889 left
= fold_expression (t
, left
, right
, complain
);
11894 /* Substitute into a unary left fold expression. */
11897 tsubst_unary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
11900 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
11901 if (pack
== error_mark_node
)
11902 return error_mark_node
;
11903 if (PACK_EXPANSION_P (pack
))
11905 tree r
= copy_node (t
);
11906 FOLD_EXPR_PACK (r
) = pack
;
11909 if (TREE_VEC_LENGTH (pack
) == 0)
11910 return expand_empty_fold (t
, complain
);
11912 return expand_left_fold (t
, pack
, complain
);
11915 /* Substitute into a binary left fold expression.
11917 Do ths by building a single (non-empty) vector of argumnts and
11918 building the expression from those elements. */
11921 tsubst_binary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
11924 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
11925 if (pack
== error_mark_node
)
11926 return error_mark_node
;
11927 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
11928 if (init
== error_mark_node
)
11929 return error_mark_node
;
11931 if (PACK_EXPANSION_P (pack
))
11933 tree r
= copy_node (t
);
11934 FOLD_EXPR_PACK (r
) = pack
;
11935 FOLD_EXPR_INIT (r
) = init
;
11939 tree vec
= make_tree_vec (TREE_VEC_LENGTH (pack
) + 1);
11940 TREE_VEC_ELT (vec
, 0) = init
;
11941 for (int i
= 0; i
< TREE_VEC_LENGTH (pack
); ++i
)
11942 TREE_VEC_ELT (vec
, i
+ 1) = TREE_VEC_ELT (pack
, i
);
11944 return expand_left_fold (t
, vec
, complain
);
11947 /* Expand a PACK of arguments into a grouped as right fold.
11948 Given a pack containing elementns A0, A1, ..., and an
11949 operator @, this builds the expression:
11951 A0@ ... (An-2 @ (An-1 @ An))
11953 Note that PACK must not be empty.
11955 The operator is defined by the original fold expression T. */
11958 expand_right_fold (tree t
, tree pack
, tsubst_flags_t complain
)
11960 // Build the expression.
11961 int n
= TREE_VEC_LENGTH (pack
);
11962 tree right
= TREE_VEC_ELT (pack
, n
- 1);
11963 for (--n
; n
!= 0; --n
)
11965 tree left
= TREE_VEC_ELT (pack
, n
- 1);
11966 right
= fold_expression (t
, left
, right
, complain
);
11971 /* Substitute into a unary right fold expression. */
11974 tsubst_unary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
11977 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
11978 if (pack
== error_mark_node
)
11979 return error_mark_node
;
11980 if (PACK_EXPANSION_P (pack
))
11982 tree r
= copy_node (t
);
11983 FOLD_EXPR_PACK (r
) = pack
;
11986 if (TREE_VEC_LENGTH (pack
) == 0)
11987 return expand_empty_fold (t
, complain
);
11989 return expand_right_fold (t
, pack
, complain
);
11992 /* Substitute into a binary right fold expression.
11994 Do ths by building a single (non-empty) vector of arguments and
11995 building the expression from those elements. */
11998 tsubst_binary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
12001 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
12002 if (pack
== error_mark_node
)
12003 return error_mark_node
;
12004 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
12005 if (init
== error_mark_node
)
12006 return error_mark_node
;
12008 if (PACK_EXPANSION_P (pack
))
12010 tree r
= copy_node (t
);
12011 FOLD_EXPR_PACK (r
) = pack
;
12012 FOLD_EXPR_INIT (r
) = init
;
12016 int n
= TREE_VEC_LENGTH (pack
);
12017 tree vec
= make_tree_vec (n
+ 1);
12018 for (int i
= 0; i
< n
; ++i
)
12019 TREE_VEC_ELT (vec
, i
) = TREE_VEC_ELT (pack
, i
);
12020 TREE_VEC_ELT (vec
, n
) = init
;
12022 return expand_right_fold (t
, vec
, complain
);
12025 /* Walk through the pattern of a pack expansion, adding everything in
12026 local_specializations to a list. */
12031 hash_set
<tree
> internal
;
12033 tsubst_flags_t complain
;
12035 el_data (tsubst_flags_t c
)
12036 : extra (NULL_TREE
), complain (c
) {}
12039 extract_locals_r (tree
*tp
, int */
*walk_subtrees*/
, void *data_
)
12041 el_data
&data
= *reinterpret_cast<el_data
*>(data_
);
12042 tree
*extra
= &data
.extra
;
12043 tsubst_flags_t complain
= data
.complain
;
12045 if (TYPE_P (*tp
) && typedef_variant_p (*tp
))
12046 /* Remember local typedefs (85214). */
12047 tp
= &TYPE_NAME (*tp
);
12049 if (TREE_CODE (*tp
) == DECL_EXPR
)
12050 data
.internal
.add (DECL_EXPR_DECL (*tp
));
12051 else if (tree spec
= retrieve_local_specialization (*tp
))
12053 if (data
.internal
.contains (*tp
))
12054 /* Don't mess with variables declared within the pattern. */
12056 if (TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
)
12058 /* Maybe pull out the PARM_DECL for a partial instantiation. */
12059 tree args
= ARGUMENT_PACK_ARGS (spec
);
12060 if (TREE_VEC_LENGTH (args
) == 1)
12062 tree elt
= TREE_VEC_ELT (args
, 0);
12063 if (PACK_EXPANSION_P (elt
))
12064 elt
= PACK_EXPANSION_PATTERN (elt
);
12065 if (DECL_PACK_P (elt
))
12068 if (TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
)
12070 /* Handle lambda capture here, since we aren't doing any
12071 substitution now, and so tsubst_copy won't call
12072 process_outer_var_ref. */
12073 tree args
= ARGUMENT_PACK_ARGS (spec
);
12074 int len
= TREE_VEC_LENGTH (args
);
12075 for (int i
= 0; i
< len
; ++i
)
12077 tree arg
= TREE_VEC_ELT (args
, i
);
12079 if (outer_automatic_var_p (arg
))
12080 carg
= process_outer_var_ref (arg
, complain
);
12083 /* Make a new NONTYPE_ARGUMENT_PACK of the capture
12087 spec
= copy_node (spec
);
12088 args
= copy_node (args
);
12089 SET_ARGUMENT_PACK_ARGS (spec
, args
);
12090 register_local_specialization (spec
, *tp
);
12092 TREE_VEC_ELT (args
, i
) = carg
;
12097 if (outer_automatic_var_p (spec
))
12098 spec
= process_outer_var_ref (spec
, complain
);
12099 *extra
= tree_cons (*tp
, spec
, *extra
);
12104 extract_local_specs (tree pattern
, tsubst_flags_t complain
)
12106 el_data
data (complain
);
12107 cp_walk_tree_without_duplicates (&pattern
, extract_locals_r
, &data
);
12111 /* Extract any uses of local_specializations from PATTERN and add them to ARGS
12112 for use in PACK_EXPANSION_EXTRA_ARGS. */
12115 build_extra_args (tree pattern
, tree args
, tsubst_flags_t complain
)
12118 if (local_specializations
)
12119 if (tree locals
= extract_local_specs (pattern
, complain
))
12120 extra
= tree_cons (NULL_TREE
, extra
, locals
);
12124 /* Apply any local specializations from PACK_EXPANSION_EXTRA_ARGS and add the
12125 normal template args to ARGS. */
12128 add_extra_args (tree extra
, tree args
)
12130 if (extra
&& TREE_CODE (extra
) == TREE_LIST
)
12132 for (tree elt
= TREE_CHAIN (extra
); elt
; elt
= TREE_CHAIN (elt
))
12134 /* The partial instantiation involved local declarations collected in
12135 extract_local_specs; map from the general template to our local
12137 tree gen
= TREE_PURPOSE (elt
);
12138 tree inst
= TREE_VALUE (elt
);
12140 if (tree local
= retrieve_local_specialization (inst
))
12142 /* else inst is already a full instantiation of the pack. */
12143 register_local_specialization (inst
, gen
);
12145 gcc_assert (!TREE_PURPOSE (extra
));
12146 extra
= TREE_VALUE (extra
);
12148 return add_to_template_args (extra
, args
);
12151 /* Substitute ARGS into T, which is an pack expansion
12152 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
12153 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
12154 (if only a partial substitution could be performed) or
12155 ERROR_MARK_NODE if there was an error. */
12157 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
12161 tree pack
, packs
= NULL_TREE
;
12162 bool unsubstituted_packs
= false;
12163 bool unsubstituted_fn_pack
= false;
12166 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
12167 bool need_local_specializations
= false;
12170 gcc_assert (PACK_EXPANSION_P (t
));
12171 pattern
= PACK_EXPANSION_PATTERN (t
);
12173 /* Add in any args remembered from an earlier partial instantiation. */
12174 args
= add_extra_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
12176 levels
= TMPL_ARGS_DEPTH (args
);
12178 /* Determine the argument packs that will instantiate the parameter
12179 packs used in the expansion expression. While we're at it,
12180 compute the number of arguments to be expanded and make sure it
12182 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
12183 pack
= TREE_CHAIN (pack
))
12185 tree parm_pack
= TREE_VALUE (pack
);
12186 tree arg_pack
= NULL_TREE
;
12187 tree orig_arg
= NULL_TREE
;
12190 if (TREE_CODE (parm_pack
) == BASES
)
12192 gcc_assert (parm_pack
== pattern
);
12193 if (BASES_DIRECT (parm_pack
))
12194 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
12199 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
12200 args
, complain
, in_decl
,
12203 else if (builtin_pack_call_p (parm_pack
))
12205 if (parm_pack
!= pattern
)
12207 if (complain
& tf_error
)
12208 sorry ("%qE is not the entire pattern of the pack expansion",
12210 return error_mark_node
;
12212 return expand_builtin_pack_call (parm_pack
, args
,
12213 complain
, in_decl
);
12215 else if (TREE_CODE (parm_pack
) == PARM_DECL
)
12217 /* We know we have correct local_specializations if this
12218 expansion is at function scope, or if we're dealing with a
12219 local parameter in a requires expression; for the latter,
12220 tsubst_requires_expr set it up appropriately. */
12221 if (PACK_EXPANSION_LOCAL_P (t
) || CONSTRAINT_VAR_P (parm_pack
))
12222 arg_pack
= retrieve_local_specialization (parm_pack
);
12224 /* We can't rely on local_specializations for a parameter
12225 name used later in a function declaration (such as in a
12226 late-specified return type). Even if it exists, it might
12227 have the wrong value for a recursive call. */
12228 need_local_specializations
= true;
12232 /* This parameter pack was used in an unevaluated context. Just
12233 make a dummy decl, since it's only used for its type. */
12234 ++cp_unevaluated_operand
;
12235 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
12236 --cp_unevaluated_operand
;
12237 if (arg_pack
&& DECL_PACK_P (arg_pack
))
12238 /* Partial instantiation of the parm_pack, we can't build
12239 up an argument pack yet. */
12240 arg_pack
= NULL_TREE
;
12242 arg_pack
= make_fnparm_pack (arg_pack
);
12244 else if (argument_pack_element_is_expansion_p (arg_pack
, 0))
12245 /* This argument pack isn't fully instantiated yet. We set this
12246 flag rather than clear arg_pack because we do want to do the
12247 optimization below, and we don't want to substitute directly
12248 into the pattern (as that would expose a NONTYPE_ARGUMENT_PACK
12249 where it isn't expected). */
12250 unsubstituted_fn_pack
= true;
12252 else if (is_capture_proxy (parm_pack
))
12254 arg_pack
= retrieve_local_specialization (parm_pack
);
12255 if (argument_pack_element_is_expansion_p (arg_pack
, 0))
12256 unsubstituted_fn_pack
= true;
12261 template_parm_level_and_index (parm_pack
, &level
, &idx
);
12263 if (level
<= levels
)
12264 arg_pack
= TMPL_ARG (args
, level
, idx
);
12267 orig_arg
= arg_pack
;
12268 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
12269 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
12271 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
12272 /* This can only happen if we forget to expand an argument
12273 pack somewhere else. Just return an error, silently. */
12275 result
= make_tree_vec (1);
12276 TREE_VEC_ELT (result
, 0) = error_mark_node
;
12283 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
12285 /* Don't bother trying to do a partial substitution with
12286 incomplete packs; we'll try again after deduction. */
12287 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
12292 else if (len
!= my_len
12293 && !unsubstituted_fn_pack
)
12295 if (!(complain
& tf_error
))
12296 /* Fail quietly. */;
12297 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
12298 error ("mismatched argument pack lengths while expanding %qT",
12301 error ("mismatched argument pack lengths while expanding %qE",
12303 return error_mark_node
;
12306 /* Keep track of the parameter packs and their corresponding
12308 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
12309 TREE_TYPE (packs
) = orig_arg
;
12313 /* We can't substitute for this parameter pack. We use a flag as
12314 well as the missing_level counter because function parameter
12315 packs don't have a level. */
12316 gcc_assert (processing_template_decl
|| is_auto (parm_pack
));
12317 unsubstituted_packs
= true;
12321 /* If the expansion is just T..., return the matching argument pack, unless
12322 we need to call convert_from_reference on all the elements. This is an
12323 important optimization; see c++/68422. */
12324 if (!unsubstituted_packs
12325 && TREE_PURPOSE (packs
) == pattern
)
12327 tree args
= ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
12329 /* If the argument pack is a single pack expansion, pull it out. */
12330 if (TREE_VEC_LENGTH (args
) == 1
12331 && pack_expansion_args_count (args
))
12332 return TREE_VEC_ELT (args
, 0);
12334 /* Types need no adjustment, nor does sizeof..., and if we still have
12335 some pack expansion args we won't do anything yet. */
12336 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
12337 || PACK_EXPANSION_SIZEOF_P (t
)
12338 || pack_expansion_args_count (args
))
12340 /* Also optimize expression pack expansions if we can tell that the
12341 elements won't have reference type. */
12342 tree type
= TREE_TYPE (pattern
);
12343 if (type
&& !TYPE_REF_P (type
)
12344 && !PACK_EXPANSION_P (type
)
12345 && !WILDCARD_TYPE_P (type
))
12347 /* Otherwise use the normal path so we get convert_from_reference. */
12350 /* We cannot expand this expansion expression, because we don't have
12351 all of the argument packs we need. */
12352 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
12354 /* We got some full packs, but we can't substitute them in until we
12355 have values for all the packs. So remember these until then. */
12357 t
= make_pack_expansion (pattern
, complain
);
12358 PACK_EXPANSION_EXTRA_ARGS (t
)
12359 = build_extra_args (pattern
, args
, complain
);
12362 else if (unsubstituted_packs
)
12364 /* There were no real arguments, we're just replacing a parameter
12365 pack with another version of itself. Substitute into the
12366 pattern and return a PACK_EXPANSION_*. The caller will need to
12368 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
12369 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
12370 /*integral_constant_expression_p=*/false);
12372 t
= tsubst (pattern
, args
, complain
, in_decl
);
12373 t
= make_pack_expansion (t
, complain
);
12377 gcc_assert (len
>= 0);
12379 if (need_local_specializations
)
12381 /* We're in a late-specified return type, so create our own local
12382 specializations map; the current map is either NULL or (in the
12383 case of recursive unification) might have bindings that we don't
12384 want to use or alter. */
12385 saved_local_specializations
= local_specializations
;
12386 local_specializations
= new hash_map
<tree
, tree
>;
12389 /* For each argument in each argument pack, substitute into the
12391 result
= make_tree_vec (len
);
12392 tree elem_args
= copy_template_args (args
);
12393 for (i
= 0; i
< len
; ++i
)
12395 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
12397 elem_args
, complain
,
12399 TREE_VEC_ELT (result
, i
) = t
;
12400 if (t
== error_mark_node
)
12402 result
= error_mark_node
;
12407 /* Update ARGS to restore the substitution from parameter packs to
12408 their argument packs. */
12409 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
12411 tree parm
= TREE_PURPOSE (pack
);
12413 if (TREE_CODE (parm
) == PARM_DECL
12415 || TREE_CODE (parm
) == FIELD_DECL
)
12416 register_local_specialization (TREE_TYPE (pack
), parm
);
12421 if (TREE_VALUE (pack
) == NULL_TREE
)
12424 template_parm_level_and_index (parm
, &level
, &idx
);
12426 /* Update the corresponding argument. */
12427 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
12428 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
12431 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
12435 if (need_local_specializations
)
12437 delete local_specializations
;
12438 local_specializations
= saved_local_specializations
;
12441 /* If the dependent pack arguments were such that we end up with only a
12442 single pack expansion again, there's no need to keep it in a TREE_VEC. */
12443 if (len
== 1 && TREE_CODE (result
) == TREE_VEC
12444 && PACK_EXPANSION_P (TREE_VEC_ELT (result
, 0)))
12445 return TREE_VEC_ELT (result
, 0);
12450 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
12451 TMPL. We do this using DECL_PARM_INDEX, which should work even with
12452 parameter packs; all parms generated from a function parameter pack will
12453 have the same DECL_PARM_INDEX. */
12456 get_pattern_parm (tree parm
, tree tmpl
)
12458 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
12461 if (DECL_ARTIFICIAL (parm
))
12463 for (patparm
= DECL_ARGUMENTS (pattern
);
12464 patparm
; patparm
= DECL_CHAIN (patparm
))
12465 if (DECL_ARTIFICIAL (patparm
)
12466 && DECL_NAME (parm
) == DECL_NAME (patparm
))
12471 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
12472 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
12473 gcc_assert (DECL_PARM_INDEX (patparm
)
12474 == DECL_PARM_INDEX (parm
));
12480 /* Make an argument pack out of the TREE_VEC VEC. */
12483 make_argument_pack (tree vec
)
12486 tree elt
= TREE_VEC_ELT (vec
, 0);
12488 pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
12491 pack
= make_node (NONTYPE_ARGUMENT_PACK
);
12492 TREE_CONSTANT (pack
) = 1;
12494 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
12498 /* Return an exact copy of template args T that can be modified
12502 copy_template_args (tree t
)
12504 if (t
== error_mark_node
)
12507 int len
= TREE_VEC_LENGTH (t
);
12508 tree new_vec
= make_tree_vec (len
);
12510 for (int i
= 0; i
< len
; ++i
)
12512 tree elt
= TREE_VEC_ELT (t
, i
);
12513 if (elt
&& TREE_CODE (elt
) == TREE_VEC
)
12514 elt
= copy_template_args (elt
);
12515 TREE_VEC_ELT (new_vec
, i
) = elt
;
12518 NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_vec
)
12519 = NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
);
12524 /* Substitute ARGS into the vector or list of template arguments T. */
12527 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12530 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
12533 if (t
== error_mark_node
)
12534 return error_mark_node
;
12536 len
= TREE_VEC_LENGTH (t
);
12537 elts
= XALLOCAVEC (tree
, len
);
12539 for (i
= 0; i
< len
; i
++)
12541 tree orig_arg
= TREE_VEC_ELT (t
, i
);
12544 if (TREE_CODE (orig_arg
) == TREE_VEC
)
12545 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
12546 else if (PACK_EXPANSION_P (orig_arg
))
12548 /* Substitute into an expansion expression. */
12549 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
12551 if (TREE_CODE (new_arg
) == TREE_VEC
)
12552 /* Add to the expanded length adjustment the number of
12553 expanded arguments. We subtract one from this
12554 measurement, because the argument pack expression
12555 itself is already counted as 1 in
12556 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
12557 the argument pack is empty. */
12558 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
12560 else if (ARGUMENT_PACK_P (orig_arg
))
12562 /* Substitute into each of the arguments. */
12563 new_arg
= TYPE_P (orig_arg
)
12564 ? cxx_make_type (TREE_CODE (orig_arg
))
12565 : make_node (TREE_CODE (orig_arg
));
12567 tree pack_args
= tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
12568 args
, complain
, in_decl
);
12569 if (pack_args
== error_mark_node
)
12570 new_arg
= error_mark_node
;
12572 SET_ARGUMENT_PACK_ARGS (new_arg
, pack_args
);
12574 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
)
12575 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
12578 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
12580 if (new_arg
== error_mark_node
)
12581 return error_mark_node
;
12584 if (new_arg
!= orig_arg
)
12591 /* Make space for the expanded arguments coming from template
12593 t
= make_tree_vec (len
+ expanded_len_adjust
);
12594 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
12595 arguments for a member template.
12596 In that case each TREE_VEC in ORIG_T represents a level of template
12597 arguments, and ORIG_T won't carry any non defaulted argument count.
12598 It will rather be the nested TREE_VECs that will carry one.
12599 In other words, ORIG_T carries a non defaulted argument count only
12600 if it doesn't contain any nested TREE_VEC. */
12601 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
12603 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
12604 count
+= expanded_len_adjust
;
12605 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
12607 for (i
= 0, out
= 0; i
< len
; i
++)
12609 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
12610 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
12611 && TREE_CODE (elts
[i
]) == TREE_VEC
)
12615 /* Now expand the template argument pack "in place". */
12616 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
12617 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
12621 TREE_VEC_ELT (t
, out
) = elts
[i
];
12629 /* Substitute ARGS into one level PARMS of template parameters. */
12632 tsubst_template_parms_level (tree parms
, tree args
, tsubst_flags_t complain
)
12634 if (parms
== error_mark_node
)
12635 return error_mark_node
;
12637 tree new_vec
= make_tree_vec (TREE_VEC_LENGTH (parms
));
12639 for (int i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
12641 tree tuple
= TREE_VEC_ELT (parms
, i
);
12643 if (tuple
== error_mark_node
)
12646 TREE_VEC_ELT (new_vec
, i
) =
12647 tsubst_template_parm (tuple
, args
, complain
);
12653 /* Return the result of substituting ARGS into the template parameters
12654 given by PARMS. If there are m levels of ARGS and m + n levels of
12655 PARMS, then the result will contain n levels of PARMS. For
12656 example, if PARMS is `template <class T> template <class U>
12657 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
12658 result will be `template <int*, double, class V>'. */
12661 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
12663 tree r
= NULL_TREE
;
12666 /* When substituting into a template, we must set
12667 PROCESSING_TEMPLATE_DECL as the template parameters may be
12668 dependent if they are based on one-another, and the dependency
12669 predicates are short-circuit outside of templates. */
12670 ++processing_template_decl
;
12672 for (new_parms
= &r
;
12673 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
12674 new_parms
= &(TREE_CHAIN (*new_parms
)),
12675 parms
= TREE_CHAIN (parms
))
12677 tree new_vec
= tsubst_template_parms_level (TREE_VALUE (parms
),
12680 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
12681 - TMPL_ARGS_DEPTH (args
)),
12682 new_vec
, NULL_TREE
);
12685 --processing_template_decl
;
12690 /* Return the result of substituting ARGS into one template parameter
12691 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
12692 parameter and which TREE_PURPOSE is the default argument of the
12693 template parameter. */
12696 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
12698 tree default_value
, parm_decl
;
12700 if (args
== NULL_TREE
12702 || t
== error_mark_node
)
12705 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
12707 default_value
= TREE_PURPOSE (t
);
12708 parm_decl
= TREE_VALUE (t
);
12710 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
12711 if (TREE_CODE (parm_decl
) == PARM_DECL
12712 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
12713 parm_decl
= error_mark_node
;
12714 default_value
= tsubst_template_arg (default_value
, args
,
12715 complain
, NULL_TREE
);
12717 return build_tree_list (default_value
, parm_decl
);
12720 /* Substitute the ARGS into the indicated aggregate (or enumeration)
12721 type T. If T is not an aggregate or enumeration type, it is
12722 handled as if by tsubst. IN_DECL is as for tsubst. If
12723 ENTERING_SCOPE is nonzero, T is the context for a template which
12724 we are presently tsubst'ing. Return the substituted value. */
12727 tsubst_aggr_type (tree t
,
12729 tsubst_flags_t complain
,
12731 int entering_scope
)
12733 if (t
== NULL_TREE
)
12736 switch (TREE_CODE (t
))
12739 if (TYPE_PTRMEMFUNC_P (t
))
12740 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
12742 /* Fall through. */
12743 case ENUMERAL_TYPE
:
12745 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
12751 /* In "sizeof(X<I>)" we need to evaluate "I". */
12754 /* First, determine the context for the type we are looking
12756 context
= TYPE_CONTEXT (t
);
12757 if (context
&& TYPE_P (context
))
12759 context
= tsubst_aggr_type (context
, args
, complain
,
12760 in_decl
, /*entering_scope=*/1);
12761 /* If context is a nested class inside a class template,
12762 it may still need to be instantiated (c++/33959). */
12763 context
= complete_type (context
);
12766 /* Then, figure out what arguments are appropriate for the
12767 type we are trying to find. For example, given:
12769 template <class T> struct S;
12770 template <class T, class U> void f(T, U) { S<U> su; }
12772 and supposing that we are instantiating f<int, double>,
12773 then our ARGS will be {int, double}, but, when looking up
12774 S we only want {double}. */
12775 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
12776 complain
, in_decl
);
12777 if (argvec
== error_mark_node
)
12778 r
= error_mark_node
;
12781 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
12782 entering_scope
, complain
);
12783 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
12789 /* This is not a template type, so there's nothing to do. */
12793 return tsubst (t
, args
, complain
, in_decl
);
12797 static GTY((cache
)) tree_cache_map
*defarg_inst
;
12799 /* Substitute into the default argument ARG (a default argument for
12800 FN), which has the indicated TYPE. */
12803 tsubst_default_argument (tree fn
, int parmnum
, tree type
, tree arg
,
12804 tsubst_flags_t complain
)
12806 int errs
= errorcount
+ sorrycount
;
12808 /* This can happen in invalid code. */
12809 if (TREE_CODE (arg
) == DEFERRED_PARSE
)
12812 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
12813 parm
= chain_index (parmnum
, parm
);
12814 tree parmtype
= TREE_TYPE (parm
);
12815 if (DECL_BY_REFERENCE (parm
))
12816 parmtype
= TREE_TYPE (parmtype
);
12817 if (parmtype
== error_mark_node
)
12818 return error_mark_node
;
12820 gcc_assert (same_type_ignoring_top_level_qualifiers_p (type
, parmtype
));
12823 if (defarg_inst
&& (slot
= defarg_inst
->get (parm
)))
12826 /* This default argument came from a template. Instantiate the
12827 default argument here, not in tsubst. In the case of
12836 we must be careful to do name lookup in the scope of S<T>,
12837 rather than in the current class. */
12838 push_to_top_level ();
12839 push_access_scope (fn
);
12840 push_deferring_access_checks (dk_no_deferred
);
12841 start_lambda_scope (parm
);
12843 /* The default argument expression may cause implicitly defined
12844 member functions to be synthesized, which will result in garbage
12845 collection. We must treat this situation as if we were within
12846 the body of function so as to avoid collecting live data on the
12849 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
12850 complain
, NULL_TREE
,
12851 /*integral_constant_expression_p=*/false);
12854 finish_lambda_scope ();
12856 /* Make sure the default argument is reasonable. */
12857 arg
= check_default_argument (type
, arg
, complain
);
12859 if (errorcount
+sorrycount
> errs
12860 && (complain
& tf_warning_or_error
))
12861 inform (input_location
,
12862 " when instantiating default argument for call to %qD", fn
);
12864 pop_deferring_access_checks ();
12865 pop_access_scope (fn
);
12866 pop_from_top_level ();
12868 if (arg
!= error_mark_node
&& !cp_unevaluated_operand
)
12871 defarg_inst
= tree_cache_map::create_ggc (37);
12872 defarg_inst
->put (parm
, arg
);
12878 /* Substitute into all the default arguments for FN. */
12881 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
12886 tmpl_args
= DECL_TI_ARGS (fn
);
12888 /* If this function is not yet instantiated, we certainly don't need
12889 its default arguments. */
12890 if (uses_template_parms (tmpl_args
))
12892 /* Don't do this again for clones. */
12893 if (DECL_CLONED_FUNCTION_P (fn
))
12897 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
12899 arg
= TREE_CHAIN (arg
), ++i
)
12900 if (TREE_PURPOSE (arg
))
12901 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
, i
,
12903 TREE_PURPOSE (arg
),
12907 /* Hash table mapping a FUNCTION_DECL to its dependent explicit-specifier. */
12908 static GTY((cache
)) tree_cache_map
*explicit_specifier_map
;
12910 /* Store a pair to EXPLICIT_SPECIFIER_MAP. */
12913 store_explicit_specifier (tree v
, tree t
)
12915 if (!explicit_specifier_map
)
12916 explicit_specifier_map
= tree_cache_map::create_ggc (37);
12917 DECL_HAS_DEPENDENT_EXPLICIT_SPEC_P (v
) = true;
12918 explicit_specifier_map
->put (v
, t
);
12921 /* Lookup an element in EXPLICIT_SPECIFIER_MAP. */
12924 lookup_explicit_specifier (tree v
)
12926 return *explicit_specifier_map
->get (v
);
12929 /* Subroutine of tsubst_decl for the case when T is a FUNCTION_DECL. */
12932 tsubst_function_decl (tree t
, tree args
, tsubst_flags_t complain
,
12933 tree lambda_fntype
)
12935 tree gen_tmpl
, argvec
;
12936 hashval_t hash
= 0;
12939 /* Nobody should be tsubst'ing into non-template functions. */
12940 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
12942 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
12944 /* If T is not dependent, just return it. */
12945 if (!uses_template_parms (DECL_TI_ARGS (t
))
12946 && !LAMBDA_FUNCTION_P (t
))
12949 /* Calculate the most general template of which R is a
12951 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
12953 /* We're substituting a lambda function under tsubst_lambda_expr but not
12954 directly from it; find the matching function we're already inside.
12955 But don't do this if T is a generic lambda with a single level of
12956 template parms, as in that case we're doing a normal instantiation. */
12957 if (LAMBDA_FUNCTION_P (t
) && !lambda_fntype
12958 && (!generic_lambda_fn_p (t
)
12959 || TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
)) > 1))
12960 return enclosing_instantiation_of (t
);
12962 /* Calculate the complete set of arguments used to
12964 argvec
= tsubst_template_args (DECL_TI_ARGS
12965 (DECL_TEMPLATE_RESULT
12966 (DECL_TI_TEMPLATE (t
))),
12967 args
, complain
, in_decl
);
12968 if (argvec
== error_mark_node
)
12969 return error_mark_node
;
12971 /* Check to see if we already have this specialization. */
12972 if (!lambda_fntype
)
12974 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
12975 if (tree spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
))
12979 /* We can see more levels of arguments than parameters if
12980 there was a specialization of a member template, like
12983 template <class T> struct S { template <class U> void f(); }
12984 template <> template <class U> void S<int>::f(U);
12986 Here, we'll be substituting into the specialization,
12987 because that's where we can find the code we actually
12988 want to generate, but we'll have enough arguments for
12989 the most general template.
12991 We also deal with the peculiar case:
12993 template <class T> struct S {
12994 template <class U> friend void f();
12996 template <class U> void f() {}
12998 template void f<double>();
13000 Here, the ARGS for the instantiation of will be {int,
13001 double}. But, we only need as many ARGS as there are
13002 levels of template parameters in CODE_PATTERN. We are
13003 careful not to get fooled into reducing the ARGS in
13006 template <class T> struct S { template <class U> void f(U); }
13007 template <class T> template <> void S<T>::f(int) {}
13009 which we can spot because the pattern will be a
13010 specialization in this case. */
13011 int args_depth
= TMPL_ARGS_DEPTH (args
);
13013 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
13015 if (args_depth
> parms_depth
&& !DECL_TEMPLATE_SPECIALIZATION (t
))
13016 args
= get_innermost_template_args (args
, parms_depth
);
13020 /* This special case arises when we have something like this:
13022 template <class T> struct S {
13023 friend void f<int>(int, double);
13026 Here, the DECL_TI_TEMPLATE for the friend declaration
13027 will be an IDENTIFIER_NODE. We are being called from
13028 tsubst_friend_function, and we want only to create a
13029 new decl (R) with appropriate types so that we can call
13030 determine_specialization. */
13031 gen_tmpl
= NULL_TREE
;
13032 argvec
= NULL_TREE
;
13035 tree closure
= (lambda_fntype
? TYPE_METHOD_BASETYPE (lambda_fntype
)
13037 tree ctx
= closure
? closure
: DECL_CONTEXT (t
);
13038 bool member
= ctx
&& TYPE_P (ctx
);
13040 if (member
&& !closure
)
13041 ctx
= tsubst_aggr_type (ctx
, args
,
13042 complain
, t
, /*entering_scope=*/1);
13044 tree type
= (lambda_fntype
? lambda_fntype
13045 : tsubst (TREE_TYPE (t
), args
,
13046 complain
| tf_fndecl_type
, in_decl
));
13047 if (type
== error_mark_node
)
13048 return error_mark_node
;
13050 /* If we hit excessive deduction depth, the type is bogus even if
13051 it isn't error_mark_node, so don't build a decl. */
13052 if (excessive_deduction_depth
)
13053 return error_mark_node
;
13055 /* We do NOT check for matching decls pushed separately at this
13056 point, as they may not represent instantiations of this
13057 template, and in any case are considered separate under the
13059 tree r
= copy_decl (t
);
13060 DECL_USE_TEMPLATE (r
) = 0;
13061 TREE_TYPE (r
) = type
;
13062 /* Clear out the mangled name and RTL for the instantiation. */
13063 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
13064 SET_DECL_RTL (r
, NULL
);
13065 /* Leave DECL_INITIAL set on deleted instantiations. */
13066 if (!DECL_DELETED_FN (r
))
13067 DECL_INITIAL (r
) = NULL_TREE
;
13068 DECL_CONTEXT (r
) = ctx
;
13070 /* Handle explicit(dependent-expr). */
13071 if (DECL_HAS_DEPENDENT_EXPLICIT_SPEC_P (t
))
13073 tree spec
= lookup_explicit_specifier (t
);
13074 spec
= tsubst_copy_and_build (spec
, args
, complain
, in_decl
,
13075 /*function_p=*/false,
13077 spec
= build_explicit_specifier (spec
, complain
);
13078 DECL_NONCONVERTING_P (r
) = (spec
== boolean_true_node
);
13081 /* OpenMP UDRs have the only argument a reference to the declared
13082 type. We want to diagnose if the declared type is a reference,
13083 which is invalid, but as references to references are usually
13084 quietly merged, diagnose it here. */
13085 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
13088 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
13089 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
13090 if (TYPE_REF_P (argtype
))
13091 error_at (DECL_SOURCE_LOCATION (t
),
13092 "reference type %qT in "
13093 "%<#pragma omp declare reduction%>", argtype
);
13094 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
13095 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
13099 if (member
&& DECL_CONV_FN_P (r
))
13100 /* Type-conversion operator. Reconstruct the name, in
13101 case it's the name of one of the template's parameters. */
13102 DECL_NAME (r
) = make_conv_op_name (TREE_TYPE (type
));
13104 tree parms
= DECL_ARGUMENTS (t
);
13106 parms
= DECL_CHAIN (parms
);
13107 parms
= tsubst (parms
, args
, complain
, t
);
13108 for (tree parm
= parms
; parm
; parm
= DECL_CHAIN (parm
))
13109 DECL_CONTEXT (parm
) = r
;
13112 tree tparm
= build_this_parm (r
, closure
, type_memfn_quals (type
));
13113 DECL_CHAIN (tparm
) = parms
;
13116 DECL_ARGUMENTS (r
) = parms
;
13117 DECL_RESULT (r
) = NULL_TREE
;
13119 TREE_STATIC (r
) = 0;
13120 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
13121 DECL_EXTERNAL (r
) = 1;
13122 /* If this is an instantiation of a function with internal
13123 linkage, we already know what object file linkage will be
13124 assigned to the instantiation. */
13125 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
13126 DECL_DEFER_OUTPUT (r
) = 0;
13127 DECL_CHAIN (r
) = NULL_TREE
;
13128 DECL_PENDING_INLINE_INFO (r
) = 0;
13129 DECL_PENDING_INLINE_P (r
) = 0;
13130 DECL_SAVED_TREE (r
) = NULL_TREE
;
13131 DECL_STRUCT_FUNCTION (r
) = NULL
;
13133 /* We'll re-clone as appropriate in instantiate_template. */
13134 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
13136 /* If we aren't complaining now, return on error before we register
13137 the specialization so that we'll complain eventually. */
13138 if ((complain
& tf_error
) == 0
13139 && IDENTIFIER_ANY_OP_P (DECL_NAME (r
))
13140 && !grok_op_properties (r
, /*complain=*/false))
13141 return error_mark_node
;
13143 /* When instantiating a constrained member, substitute
13144 into the constraints to create a new constraint. */
13145 if (tree ci
= get_constraints (t
))
13148 ci
= tsubst_constraint_info (ci
, argvec
, complain
, NULL_TREE
);
13149 set_constraints (r
, ci
);
13152 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
13153 SET_DECL_FRIEND_CONTEXT (r
,
13154 tsubst (DECL_FRIEND_CONTEXT (t
),
13155 args
, complain
, in_decl
));
13157 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
13158 this in the special friend case mentioned above where
13159 GEN_TMPL is NULL. */
13160 if (gen_tmpl
&& !closure
)
13162 DECL_TEMPLATE_INFO (r
)
13163 = build_template_info (gen_tmpl
, argvec
);
13164 SET_DECL_IMPLICIT_INSTANTIATION (r
);
13167 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
13169 /* We instantiated this while substituting into
13170 the type earlier (template/friend54.C). */
13173 /* We're not supposed to instantiate default arguments
13174 until they are called, for a template. But, for a
13177 template <class T> void f ()
13178 { extern void g(int i = T()); }
13180 we should do the substitution when the template is
13181 instantiated. We handle the member function case in
13182 instantiate_class_template since the default arguments
13183 might refer to other members of the class. */
13185 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
13186 && !uses_template_parms (argvec
))
13187 tsubst_default_arguments (r
, complain
);
13190 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
13192 /* Copy the list of befriending classes. */
13193 for (tree
*friends
= &DECL_BEFRIENDING_CLASSES (r
);
13195 friends
= &TREE_CHAIN (*friends
))
13197 *friends
= copy_node (*friends
);
13198 TREE_VALUE (*friends
)
13199 = tsubst (TREE_VALUE (*friends
), args
, complain
, in_decl
);
13202 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
13204 maybe_retrofit_in_chrg (r
);
13205 if (DECL_CONSTRUCTOR_P (r
) && !grok_ctor_properties (ctx
, r
))
13206 return error_mark_node
;
13207 /* If this is an instantiation of a member template, clone it.
13208 If it isn't, that'll be handled by
13209 clone_constructors_and_destructors. */
13210 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
13211 clone_function_decl (r
, /*update_methods=*/false);
13213 else if ((complain
& tf_error
) != 0
13214 && IDENTIFIER_ANY_OP_P (DECL_NAME (r
))
13215 && !grok_op_properties (r
, /*complain=*/true))
13216 return error_mark_node
;
13218 /* Possibly limit visibility based on template args. */
13219 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
13220 if (DECL_VISIBILITY_SPECIFIED (t
))
13222 DECL_VISIBILITY_SPECIFIED (r
) = 0;
13223 DECL_ATTRIBUTES (r
)
13224 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
13226 determine_visibility (r
);
13227 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
13228 && !processing_template_decl
)
13229 defaulted_late_check (r
);
13231 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
13232 args
, complain
, in_decl
);
13236 /* Subroutine of tsubst_decl for the case when T is a TEMPLATE_DECL. */
13239 tsubst_template_decl (tree t
, tree args
, tsubst_flags_t complain
,
13240 tree lambda_fntype
)
13242 /* We can get here when processing a member function template,
13243 member class template, or template template parameter. */
13244 tree decl
= DECL_TEMPLATE_RESULT (t
);
13250 hashval_t hash
= 0;
13252 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
13254 /* Template template parameter is treated here. */
13255 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13256 if (new_type
== error_mark_node
)
13257 r
= error_mark_node
;
13258 /* If we get a real template back, return it. This can happen in
13259 the context of most_specialized_partial_spec. */
13260 else if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
13263 /* The new TEMPLATE_DECL was built in
13264 reduce_template_parm_level. */
13265 r
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (new_type
);
13269 if (!lambda_fntype
)
13271 /* We might already have an instance of this template.
13272 The ARGS are for the surrounding class type, so the
13273 full args contain the tsubst'd args for the context,
13274 plus the innermost args from the template decl. */
13275 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
13276 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
13277 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
13278 /* Because this is a template, the arguments will still be
13279 dependent, even after substitution. If
13280 PROCESSING_TEMPLATE_DECL is not set, the dependency
13281 predicates will short-circuit. */
13282 ++processing_template_decl
;
13283 full_args
= tsubst_template_args (tmpl_args
, args
,
13284 complain
, in_decl
);
13285 --processing_template_decl
;
13286 if (full_args
== error_mark_node
)
13287 return error_mark_node
;
13289 /* If this is a default template template argument,
13290 tsubst might not have changed anything. */
13291 if (full_args
== tmpl_args
)
13294 hash
= hash_tmpl_and_args (t
, full_args
);
13295 spec
= retrieve_specialization (t
, full_args
, hash
);
13296 if (spec
!= NULL_TREE
)
13299 /* Type partial instantiations are stored as the type by
13300 lookup_template_class_1, not here as the template. */
13301 spec
= CLASSTYPE_TI_TEMPLATE (spec
);
13306 /* Make a new template decl. It will be similar to the
13307 original, but will record the current template arguments.
13308 We also create a new function declaration, which is just
13309 like the old one, but points to this new template, rather
13310 than the old one. */
13312 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
13313 DECL_CHAIN (r
) = NULL_TREE
;
13315 // Build new template info linking to the original template decl.
13316 if (!lambda_fntype
)
13318 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
13319 SET_DECL_IMPLICIT_INSTANTIATION (r
);
13322 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
13324 /* The template parameters for this new template are all the
13325 template parameters for the old template, except the
13326 outermost level of parameters. */
13327 DECL_TEMPLATE_PARMS (r
)
13328 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
13331 if (TREE_CODE (decl
) == TYPE_DECL
13332 && !TYPE_DECL_ALIAS_P (decl
))
13335 ++processing_template_decl
;
13336 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13337 --processing_template_decl
;
13338 if (new_type
== error_mark_node
)
13339 return error_mark_node
;
13341 TREE_TYPE (r
) = new_type
;
13342 /* For a partial specialization, we need to keep pointing to
13343 the primary template. */
13344 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
13345 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
13346 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
13347 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
13348 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
13353 ++processing_template_decl
;
13354 if (TREE_CODE (decl
) == FUNCTION_DECL
)
13355 new_decl
= tsubst_function_decl (decl
, args
, complain
, lambda_fntype
);
13357 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
13358 --processing_template_decl
;
13359 if (new_decl
== error_mark_node
)
13360 return error_mark_node
;
13362 DECL_TEMPLATE_RESULT (r
) = new_decl
;
13363 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
13364 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
13367 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (r
));
13368 DECL_TEMPLATE_INFO (new_decl
) = build_template_info (r
, args
);
13372 DECL_TI_TEMPLATE (new_decl
) = r
;
13373 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
13377 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
13378 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
13380 if (PRIMARY_TEMPLATE_P (t
))
13381 DECL_PRIMARY_TEMPLATE (r
) = r
;
13383 if (TREE_CODE (decl
) != TYPE_DECL
&& !VAR_P (decl
)
13385 /* Record this non-type partial instantiation. */
13386 register_specialization (r
, t
,
13387 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
13393 /* True if FN is the op() for a lambda in an uninstantiated template. */
13396 lambda_fn_in_template_p (tree fn
)
13398 if (!fn
|| !LAMBDA_FUNCTION_P (fn
))
13400 tree closure
= DECL_CONTEXT (fn
);
13401 return CLASSTYPE_TEMPLATE_INFO (closure
) != NULL_TREE
;
13404 /* True if FN is the substitution (via tsubst_lambda_expr) of a function for
13405 which the above is true. */
13408 instantiated_lambda_fn_p (tree fn
)
13410 if (!fn
|| !LAMBDA_FUNCTION_P (fn
))
13412 tree closure
= DECL_CONTEXT (fn
);
13413 tree lam
= CLASSTYPE_LAMBDA_EXPR (closure
);
13414 return LAMBDA_EXPR_INSTANTIATED (lam
);
13417 /* We're instantiating a variable from template function TCTX. Return the
13418 corresponding current enclosing scope. This gets complicated because lambda
13419 functions in templates are regenerated rather than instantiated, but generic
13420 lambda functions are subsequently instantiated. */
13423 enclosing_instantiation_of (tree otctx
)
13426 tree fn
= current_function_decl
;
13427 int lambda_count
= 0;
13429 for (; tctx
&& (lambda_fn_in_template_p (tctx
)
13430 || instantiated_lambda_fn_p (tctx
));
13431 tctx
= decl_function_context (tctx
))
13433 for (; fn
; fn
= decl_function_context (fn
))
13436 int flambda_count
= 0;
13437 for (; fn
&& instantiated_lambda_fn_p (fn
);
13438 fn
= decl_function_context (fn
))
13440 if ((fn
&& DECL_TEMPLATE_INFO (fn
))
13441 ? most_general_template (fn
) != most_general_template (tctx
)
13444 if (flambda_count
!= lambda_count
)
13446 gcc_assert (flambda_count
> lambda_count
);
13447 for (; flambda_count
> lambda_count
; --flambda_count
)
13448 ofn
= decl_function_context (ofn
);
13450 gcc_assert (DECL_NAME (ofn
) == DECL_NAME (otctx
)
13451 || DECL_CONV_FN_P (ofn
));
13454 gcc_unreachable ();
13457 /* Substitute the ARGS into the T, which is a _DECL. Return the
13458 result of the substitution. Issue error and warning messages under
13459 control of COMPLAIN. */
13462 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
13464 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
13465 location_t saved_loc
;
13466 tree r
= NULL_TREE
;
13468 hashval_t hash
= 0;
13470 /* Set the filename and linenumber to improve error-reporting. */
13471 saved_loc
= input_location
;
13472 input_location
= DECL_SOURCE_LOCATION (t
);
13474 switch (TREE_CODE (t
))
13476 case TEMPLATE_DECL
:
13477 r
= tsubst_template_decl (t
, args
, complain
, /*lambda*/NULL_TREE
);
13480 case FUNCTION_DECL
:
13481 r
= tsubst_function_decl (t
, args
, complain
, /*lambda*/NULL_TREE
);
13486 tree type
= NULL_TREE
;
13488 tree expanded_types
= NULL_TREE
;
13489 tree prev_r
= NULL_TREE
;
13490 tree first_r
= NULL_TREE
;
13492 if (DECL_PACK_P (t
))
13494 /* If there is a local specialization that isn't a
13495 parameter pack, it means that we're doing a "simple"
13496 substitution from inside tsubst_pack_expansion. Just
13497 return the local specialization (which will be a single
13499 tree spec
= retrieve_local_specialization (t
);
13501 && TREE_CODE (spec
) == PARM_DECL
13502 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
13505 /* Expand the TYPE_PACK_EXPANSION that provides the types for
13506 the parameters in this function parameter pack. */
13507 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
13508 complain
, in_decl
);
13509 if (TREE_CODE (expanded_types
) == TREE_VEC
)
13511 len
= TREE_VEC_LENGTH (expanded_types
);
13513 /* Zero-length parameter packs are boring. Just substitute
13516 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
13521 /* All we did was update the type. Make a note of that. */
13522 type
= expanded_types
;
13523 expanded_types
= NULL_TREE
;
13527 /* Loop through all of the parameters we'll build. When T is
13528 a function parameter pack, LEN is the number of expanded
13529 types in EXPANDED_TYPES; otherwise, LEN is 1. */
13531 for (i
= 0; i
< len
; ++i
)
13535 if (DECL_TEMPLATE_PARM_P (t
))
13536 SET_DECL_TEMPLATE_PARM_P (r
);
13538 if (expanded_types
)
13539 /* We're on the Ith parameter of the function parameter
13542 /* Get the Ith type. */
13543 type
= TREE_VEC_ELT (expanded_types
, i
);
13545 /* Rename the parameter to include the index. */
13547 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
13550 /* We're dealing with a normal parameter. */
13551 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13553 type
= type_decays_to (type
);
13554 TREE_TYPE (r
) = type
;
13555 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
13557 if (DECL_INITIAL (r
))
13559 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
13560 DECL_INITIAL (r
) = TREE_TYPE (r
);
13562 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
13563 complain
, in_decl
);
13566 DECL_CONTEXT (r
) = NULL_TREE
;
13568 if (!DECL_TEMPLATE_PARM_P (r
))
13569 DECL_ARG_TYPE (r
) = type_passed_as (type
);
13571 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
13572 args
, complain
, in_decl
);
13574 /* Keep track of the first new parameter we
13575 generate. That's what will be returned to the
13580 /* Build a proper chain of parameters when substituting
13581 into a function parameter pack. */
13583 DECL_CHAIN (prev_r
) = r
;
13586 /* If cp_unevaluated_operand is set, we're just looking for a
13587 single dummy parameter, so don't keep going. */
13588 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
13589 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
13590 complain
, DECL_CHAIN (t
));
13592 /* FIRST_R contains the start of the chain we've built. */
13599 tree type
= NULL_TREE
;
13600 tree vec
= NULL_TREE
;
13601 tree expanded_types
= NULL_TREE
;
13604 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
13606 /* This field is a lambda capture pack. Return a TREE_VEC of
13607 the expanded fields to instantiate_class_template_1. */
13608 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
13609 complain
, in_decl
);
13610 if (TREE_CODE (expanded_types
) == TREE_VEC
)
13612 len
= TREE_VEC_LENGTH (expanded_types
);
13613 vec
= make_tree_vec (len
);
13617 /* All we did was update the type. Make a note of that. */
13618 type
= expanded_types
;
13619 expanded_types
= NULL_TREE
;
13623 for (int i
= 0; i
< len
; ++i
)
13626 if (expanded_types
)
13628 type
= TREE_VEC_ELT (expanded_types
, i
);
13630 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
13633 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13635 if (type
== error_mark_node
)
13636 RETURN (error_mark_node
);
13637 TREE_TYPE (r
) = type
;
13638 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
13640 if (DECL_C_BIT_FIELD (r
))
13641 /* For bit-fields, DECL_BIT_FIELD_REPRESENTATIVE gives the
13643 DECL_BIT_FIELD_REPRESENTATIVE (r
)
13644 = tsubst_expr (DECL_BIT_FIELD_REPRESENTATIVE (t
), args
,
13646 /*integral_constant_expression_p=*/true);
13647 if (DECL_INITIAL (t
))
13649 /* Set up DECL_TEMPLATE_INFO so that we can get at the
13650 NSDMI in perform_member_init. Still set DECL_INITIAL
13651 so that we know there is one. */
13652 DECL_INITIAL (r
) = void_node
;
13653 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
13654 retrofit_lang_decl (r
);
13655 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
13657 /* We don't have to set DECL_CONTEXT here; it is set by
13658 finish_member_declaration. */
13659 DECL_CHAIN (r
) = NULL_TREE
;
13661 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
13662 args
, complain
, in_decl
);
13665 TREE_VEC_ELT (vec
, i
) = r
;
13674 /* We reach here only for member using decls. We also need to check
13675 uses_template_parms because DECL_DEPENDENT_P is not set for a
13676 using-declaration that designates a member of the current
13677 instantiation (c++/53549). */
13678 if (DECL_DEPENDENT_P (t
)
13679 || uses_template_parms (USING_DECL_SCOPE (t
)))
13681 tree scope
= USING_DECL_SCOPE (t
);
13682 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
13683 if (PACK_EXPANSION_P (scope
))
13685 tree vec
= tsubst_pack_expansion (scope
, args
, complain
, in_decl
);
13686 int len
= TREE_VEC_LENGTH (vec
);
13687 r
= make_tree_vec (len
);
13688 for (int i
= 0; i
< len
; ++i
)
13690 tree escope
= TREE_VEC_ELT (vec
, i
);
13691 tree elt
= do_class_using_decl (escope
, name
);
13694 r
= error_mark_node
;
13699 TREE_PROTECTED (elt
) = TREE_PROTECTED (t
);
13700 TREE_PRIVATE (elt
) = TREE_PRIVATE (t
);
13702 TREE_VEC_ELT (r
, i
) = elt
;
13707 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
13708 complain
, in_decl
);
13709 r
= do_class_using_decl (inst_scope
, name
);
13711 r
= error_mark_node
;
13714 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
13715 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
13722 DECL_CHAIN (r
) = NULL_TREE
;
13729 tree argvec
= NULL_TREE
;
13730 tree gen_tmpl
= NULL_TREE
;
13732 tree tmpl
= NULL_TREE
;
13734 tree type
= NULL_TREE
;
13737 if (TREE_TYPE (t
) == error_mark_node
)
13738 RETURN (error_mark_node
);
13740 if (TREE_CODE (t
) == TYPE_DECL
13741 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
13743 /* If this is the canonical decl, we don't have to
13744 mess with instantiations, and often we can't (for
13745 typename, template type parms and such). Note that
13746 TYPE_NAME is not correct for the above test if
13747 we've copied the type for a typedef. */
13748 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13749 if (type
== error_mark_node
)
13750 RETURN (error_mark_node
);
13751 r
= TYPE_NAME (type
);
13755 /* Check to see if we already have the specialization we
13758 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
13760 /* T is a static data member or namespace-scope entity.
13761 We have to substitute into namespace-scope variables
13762 (not just variable templates) because of cases like:
13764 template <class T> void f() { extern T t; }
13766 where the entity referenced is not known until
13767 instantiation time. */
13769 ctx
= DECL_CONTEXT (t
);
13770 if (DECL_CLASS_SCOPE_P (t
))
13772 ctx
= tsubst_aggr_type (ctx
, args
,
13774 in_decl
, /*entering_scope=*/1);
13775 /* If CTX is unchanged, then T is in fact the
13776 specialization we want. That situation occurs when
13777 referencing a static data member within in its own
13778 class. We can use pointer equality, rather than
13779 same_type_p, because DECL_CONTEXT is always
13781 if (ctx
== DECL_CONTEXT (t
)
13782 /* ... unless T is a member template; in which
13783 case our caller can be willing to create a
13784 specialization of that template represented
13786 && !(DECL_TI_TEMPLATE (t
)
13787 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
13793 tmpl
= DECL_TI_TEMPLATE (t
);
13794 gen_tmpl
= most_general_template (tmpl
);
13795 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
13796 if (argvec
!= error_mark_node
)
13797 argvec
= (coerce_innermost_template_parms
13798 (DECL_TEMPLATE_PARMS (gen_tmpl
),
13799 argvec
, t
, complain
,
13800 /*all*/true, /*defarg*/true));
13801 if (argvec
== error_mark_node
)
13802 RETURN (error_mark_node
);
13803 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
13804 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
13809 /* A local variable. */
13811 /* Subsequent calls to pushdecl will fill this in. */
13813 /* Unless this is a reference to a static variable from an
13814 enclosing function, in which case we need to fill it in now. */
13815 if (TREE_STATIC (t
))
13817 tree fn
= enclosing_instantiation_of (DECL_CONTEXT (t
));
13818 if (fn
!= current_function_decl
)
13821 spec
= retrieve_local_specialization (t
);
13823 /* If we already have the specialization we need, there is
13824 nothing more to do. */
13831 /* Create a new node for the specialization we need. */
13832 if (type
== NULL_TREE
)
13834 if (is_typedef_decl (t
))
13835 type
= DECL_ORIGINAL_TYPE (t
);
13837 type
= TREE_TYPE (t
);
13839 && VAR_HAD_UNKNOWN_BOUND (t
)
13840 && type
!= error_mark_node
)
13841 type
= strip_array_domain (type
);
13842 tree sub_args
= args
;
13843 if (tree auto_node
= type_uses_auto (type
))
13845 /* Mask off any template args past the variable's context so we
13846 don't replace the auto with an unrelated argument. */
13847 int nouter
= TEMPLATE_TYPE_LEVEL (auto_node
) - 1;
13848 int extra
= TMPL_ARGS_DEPTH (args
) - nouter
;
13850 /* This should never happen with the new lambda instantiation
13851 model, but keep the handling just in case. */
13852 gcc_assert (!CHECKING_P
),
13853 sub_args
= strip_innermost_template_args (args
, extra
);
13855 type
= tsubst (type
, sub_args
, complain
, in_decl
);
13856 /* Substituting the type might have recursively instantiated this
13857 same alias (c++/86171). */
13858 if (gen_tmpl
&& DECL_ALIAS_TEMPLATE_P (gen_tmpl
)
13859 && (spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
)))
13868 DECL_INITIALIZED_P (r
) = 0;
13869 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
13870 if (type
== error_mark_node
)
13871 RETURN (error_mark_node
);
13872 if (TREE_CODE (type
) == FUNCTION_TYPE
)
13874 /* It may seem that this case cannot occur, since:
13879 declares a function, not a variable. However:
13882 template <typename T> void g() { T t; }
13883 template void g<f>();
13885 is an attempt to declare a variable with function
13887 error ("variable %qD has function type",
13888 /* R is not yet sufficiently initialized, so we
13889 just use its name. */
13891 RETURN (error_mark_node
);
13893 type
= complete_type (type
);
13894 /* Wait until cp_finish_decl to set this again, to handle
13895 circular dependency (template/instantiate6.C). */
13896 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
13897 type
= check_var_type (DECL_NAME (r
), type
);
13899 if (DECL_HAS_VALUE_EXPR_P (t
))
13901 tree ve
= DECL_VALUE_EXPR (t
);
13902 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
13903 /*constant_expression_p=*/false);
13904 if (REFERENCE_REF_P (ve
))
13906 gcc_assert (TYPE_REF_P (type
));
13907 ve
= TREE_OPERAND (ve
, 0);
13909 SET_DECL_VALUE_EXPR (r
, ve
);
13911 if (CP_DECL_THREAD_LOCAL_P (r
)
13912 && !processing_template_decl
)
13913 set_decl_tls_model (r
, decl_default_tls_model (r
));
13915 else if (DECL_SELF_REFERENCE_P (t
))
13916 SET_DECL_SELF_REFERENCE_P (r
);
13917 TREE_TYPE (r
) = type
;
13918 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
13919 DECL_CONTEXT (r
) = ctx
;
13920 /* Clear out the mangled name and RTL for the instantiation. */
13921 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
13922 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
13923 SET_DECL_RTL (r
, NULL
);
13924 /* The initializer must not be expanded until it is required;
13925 see [temp.inst]. */
13926 DECL_INITIAL (r
) = NULL_TREE
;
13927 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
13930 if (DECL_LANG_SPECIFIC (r
))
13931 SET_DECL_DEPENDENT_INIT_P (r
, false);
13933 SET_DECL_MODE (r
, VOIDmode
);
13935 /* Possibly limit visibility based on template args. */
13936 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
13937 if (DECL_VISIBILITY_SPECIFIED (t
))
13939 DECL_VISIBILITY_SPECIFIED (r
) = 0;
13940 DECL_ATTRIBUTES (r
)
13941 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
13943 determine_visibility (r
);
13948 /* A static data member declaration is always marked
13949 external when it is declared in-class, even if an
13950 initializer is present. We mimic the non-template
13951 processing here. */
13952 DECL_EXTERNAL (r
) = 1;
13953 if (DECL_NAMESPACE_SCOPE_P (t
))
13954 DECL_NOT_REALLY_EXTERN (r
) = 1;
13956 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
13957 SET_DECL_IMPLICIT_INSTANTIATION (r
);
13958 if (!error_operand_p (r
) || (complain
& tf_error
))
13959 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
13963 if (DECL_LANG_SPECIFIC (r
))
13964 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
13965 if (!cp_unevaluated_operand
)
13966 register_local_specialization (r
, t
);
13969 DECL_CHAIN (r
) = NULL_TREE
;
13971 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
13973 args
, complain
, in_decl
);
13975 /* Preserve a typedef that names a type. */
13976 if (is_typedef_decl (r
) && type
!= error_mark_node
)
13978 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
13979 set_underlying_type (r
);
13980 if (TYPE_DECL_ALIAS_P (r
))
13981 /* An alias template specialization can be dependent
13982 even if its underlying type is not. */
13983 TYPE_DEPENDENT_P_VALID (TREE_TYPE (r
)) = false;
13986 layout_decl (r
, 0);
13991 gcc_unreachable ();
13996 /* Restore the file and line information. */
13997 input_location
= saved_loc
;
14002 /* Substitute into the ARG_TYPES of a function type.
14003 If END is a TREE_CHAIN, leave it and any following types
14007 tsubst_arg_types (tree arg_types
,
14010 tsubst_flags_t complain
,
14013 tree remaining_arg_types
;
14014 tree type
= NULL_TREE
;
14016 tree expanded_args
= NULL_TREE
;
14019 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
14022 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
14023 args
, end
, complain
, in_decl
);
14024 if (remaining_arg_types
== error_mark_node
)
14025 return error_mark_node
;
14027 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
14029 /* For a pack expansion, perform substitution on the
14030 entire expression. Later on, we'll handle the arguments
14032 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
14033 args
, complain
, in_decl
);
14035 if (TREE_CODE (expanded_args
) == TREE_VEC
)
14036 /* So that we'll spin through the parameters, one by one. */
14037 i
= TREE_VEC_LENGTH (expanded_args
);
14040 /* We only partially substituted into the parameter
14041 pack. Our type is TYPE_PACK_EXPANSION. */
14042 type
= expanded_args
;
14043 expanded_args
= NULL_TREE
;
14051 type
= TREE_VEC_ELT (expanded_args
, i
);
14053 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
14055 if (type
== error_mark_node
)
14056 return error_mark_node
;
14057 if (VOID_TYPE_P (type
))
14059 if (complain
& tf_error
)
14061 error ("invalid parameter type %qT", type
);
14063 error ("in declaration %q+D", in_decl
);
14065 return error_mark_node
;
14068 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
14069 return error_mark_node
;
14071 /* Do array-to-pointer, function-to-pointer conversion, and ignore
14072 top-level qualifiers as required. */
14073 type
= cv_unqualified (type_decays_to (type
));
14075 /* We do not substitute into default arguments here. The standard
14076 mandates that they be instantiated only when needed, which is
14077 done in build_over_call. */
14078 default_arg
= TREE_PURPOSE (arg_types
);
14080 /* Except that we do substitute default arguments under tsubst_lambda_expr,
14081 since the new op() won't have any associated template arguments for us
14082 to refer to later. */
14083 if (lambda_fn_in_template_p (in_decl
))
14084 default_arg
= tsubst_copy_and_build (default_arg
, args
, complain
, in_decl
,
14085 false/*fn*/, false/*constexpr*/);
14087 if (default_arg
&& TREE_CODE (default_arg
) == DEFERRED_PARSE
)
14089 /* We've instantiated a template before its default arguments
14090 have been parsed. This can happen for a nested template
14091 class, and is not an error unless we require the default
14092 argument in a call of this function. */
14093 remaining_arg_types
=
14094 tree_cons (default_arg
, type
, remaining_arg_types
);
14095 vec_safe_push (DEFPARSE_INSTANTIATIONS (default_arg
),
14096 remaining_arg_types
);
14099 remaining_arg_types
=
14100 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
14103 return remaining_arg_types
;
14106 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
14107 *not* handle the exception-specification for FNTYPE, because the
14108 initial substitution of explicitly provided template parameters
14109 during argument deduction forbids substitution into the
14110 exception-specification:
14114 All references in the function type of the function template to the
14115 corresponding template parameters are replaced by the specified tem-
14116 plate argument values. If a substitution in a template parameter or
14117 in the function type of the function template results in an invalid
14118 type, type deduction fails. [Note: The equivalent substitution in
14119 exception specifications is done only when the function is instanti-
14120 ated, at which point a program is ill-formed if the substitution
14121 results in an invalid type.] */
14124 tsubst_function_type (tree t
,
14126 tsubst_flags_t complain
,
14130 tree arg_types
= NULL_TREE
;
14133 /* The TYPE_CONTEXT is not used for function/method types. */
14134 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
14136 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
14138 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
14140 if (late_return_type_p
)
14142 /* Substitute the argument types. */
14143 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
14144 complain
, in_decl
);
14145 if (arg_types
== error_mark_node
)
14146 return error_mark_node
;
14148 tree save_ccp
= current_class_ptr
;
14149 tree save_ccr
= current_class_ref
;
14150 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
14151 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
14152 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
14155 /* DR 1207: 'this' is in scope in the trailing return type. */
14156 inject_this_parameter (this_type
, cp_type_quals (this_type
));
14159 /* Substitute the return type. */
14160 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14164 current_class_ptr
= save_ccp
;
14165 current_class_ref
= save_ccr
;
14169 /* Substitute the return type. */
14170 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14172 if (return_type
== error_mark_node
)
14173 return error_mark_node
;
14174 /* DR 486 clarifies that creation of a function type with an
14175 invalid return type is a deduction failure. */
14176 if (TREE_CODE (return_type
) == ARRAY_TYPE
14177 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
14179 if (complain
& tf_error
)
14181 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
14182 error ("function returning an array");
14184 error ("function returning a function");
14186 return error_mark_node
;
14189 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
14190 return error_mark_node
;
14192 if (!late_return_type_p
)
14194 /* Substitute the argument types. */
14195 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
14196 complain
, in_decl
);
14197 if (arg_types
== error_mark_node
)
14198 return error_mark_node
;
14201 /* Construct a new type node and return it. */
14202 if (TREE_CODE (t
) == FUNCTION_TYPE
)
14204 fntype
= build_function_type (return_type
, arg_types
);
14205 fntype
= apply_memfn_quals (fntype
, type_memfn_quals (t
));
14209 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
14210 /* Don't pick up extra function qualifiers from the basetype. */
14211 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
14212 if (! MAYBE_CLASS_TYPE_P (r
))
14216 Type deduction may fail for any of the following
14219 -- Attempting to create "pointer to member of T" when T
14220 is not a class type. */
14221 if (complain
& tf_error
)
14222 error ("creating pointer to member function of non-class type %qT",
14224 return error_mark_node
;
14227 fntype
= build_method_type_directly (r
, return_type
,
14228 TREE_CHAIN (arg_types
));
14230 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
14232 /* See comment above. */
14233 tree raises
= NULL_TREE
;
14234 cp_ref_qualifier rqual
= type_memfn_rqual (t
);
14235 fntype
= build_cp_fntype_variant (fntype
, rqual
, raises
, late_return_type_p
);
14240 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
14241 ARGS into that specification, and return the substituted
14242 specification. If there is no specification, return NULL_TREE. */
14245 tsubst_exception_specification (tree fntype
,
14247 tsubst_flags_t complain
,
14254 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
14255 new_specs
= NULL_TREE
;
14256 if (specs
&& TREE_PURPOSE (specs
))
14258 /* A noexcept-specifier. */
14259 tree expr
= TREE_PURPOSE (specs
);
14260 if (TREE_CODE (expr
) == INTEGER_CST
)
14264 /* Defer instantiation of noexcept-specifiers to avoid
14265 excessive instantiations (c++/49107). */
14266 new_specs
= make_node (DEFERRED_NOEXCEPT
);
14267 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
14269 /* We already partially instantiated this member template,
14270 so combine the new args with the old. */
14271 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
14272 = DEFERRED_NOEXCEPT_PATTERN (expr
);
14273 DEFERRED_NOEXCEPT_ARGS (new_specs
)
14274 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
14278 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
14279 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
14284 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
14286 args
= add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
),
14288 expr
= DEFERRED_NOEXCEPT_PATTERN (expr
);
14290 new_specs
= tsubst_copy_and_build
14291 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
14292 /*integral_constant_expression_p=*/true);
14294 new_specs
= build_noexcept_spec (new_specs
, complain
);
14298 if (! TREE_VALUE (specs
))
14305 tree expanded_specs
= NULL_TREE
;
14307 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
14309 /* Expand the pack expansion type. */
14310 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
14314 if (expanded_specs
== error_mark_node
)
14315 return error_mark_node
;
14316 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
14317 len
= TREE_VEC_LENGTH (expanded_specs
);
14320 /* We're substituting into a member template, so
14321 we got a TYPE_PACK_EXPANSION back. Add that
14322 expansion and move on. */
14323 gcc_assert (TREE_CODE (expanded_specs
)
14324 == TYPE_PACK_EXPANSION
);
14325 new_specs
= add_exception_specifier (new_specs
,
14328 specs
= TREE_CHAIN (specs
);
14333 for (i
= 0; i
< len
; ++i
)
14335 if (expanded_specs
)
14336 spec
= TREE_VEC_ELT (expanded_specs
, i
);
14338 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
14339 if (spec
== error_mark_node
)
14341 new_specs
= add_exception_specifier (new_specs
, spec
,
14345 specs
= TREE_CHAIN (specs
);
14351 /* Take the tree structure T and replace template parameters used
14352 therein with the argument vector ARGS. IN_DECL is an associated
14353 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
14354 Issue error and warning messages under control of COMPLAIN. Note
14355 that we must be relatively non-tolerant of extensions here, in
14356 order to preserve conformance; if we allow substitutions that
14357 should not be allowed, we may allow argument deductions that should
14358 not succeed, and therefore report ambiguous overload situations
14359 where there are none. In theory, we could allow the substitution,
14360 but indicate that it should have failed, and allow our caller to
14361 make sure that the right thing happens, but we don't try to do this
14364 This function is used for dealing with types, decls and the like;
14365 for expressions, use tsubst_expr or tsubst_copy. */
14368 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
14370 enum tree_code code
;
14371 tree type
, r
= NULL_TREE
;
14373 if (t
== NULL_TREE
|| t
== error_mark_node
14374 || t
== integer_type_node
14375 || t
== void_type_node
14376 || t
== char_type_node
14377 || t
== unknown_type_node
14378 || TREE_CODE (t
) == NAMESPACE_DECL
14379 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
14383 return tsubst_decl (t
, args
, complain
);
14385 if (args
== NULL_TREE
)
14388 code
= TREE_CODE (t
);
14390 if (code
== IDENTIFIER_NODE
)
14391 type
= IDENTIFIER_TYPE_VALUE (t
);
14393 type
= TREE_TYPE (t
);
14395 gcc_assert (type
!= unknown_type_node
);
14397 /* Reuse typedefs. We need to do this to handle dependent attributes,
14398 such as attribute aligned. */
14400 && typedef_variant_p (t
))
14402 tree decl
= TYPE_NAME (t
);
14404 if (alias_template_specialization_p (t
))
14406 /* DECL represents an alias template and we want to
14408 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
14409 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
14410 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
14412 else if (DECL_CLASS_SCOPE_P (decl
)
14413 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
14414 && uses_template_parms (DECL_CONTEXT (decl
)))
14416 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
14417 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
14418 r
= retrieve_specialization (tmpl
, gen_args
, 0);
14420 else if (DECL_FUNCTION_SCOPE_P (decl
)
14421 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
14422 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
14423 r
= retrieve_local_specialization (decl
);
14425 /* The typedef is from a non-template context. */
14431 r
= cp_build_qualified_type_real
14432 (r
, cp_type_quals (t
) | cp_type_quals (r
),
14433 complain
| tf_ignore_bad_quals
);
14438 /* We don't have an instantiation yet, so drop the typedef. */
14439 int quals
= cp_type_quals (t
);
14440 t
= DECL_ORIGINAL_TYPE (decl
);
14441 t
= cp_build_qualified_type_real (t
, quals
,
14442 complain
| tf_ignore_bad_quals
);
14446 bool fndecl_type
= (complain
& tf_fndecl_type
);
14447 complain
&= ~tf_fndecl_type
;
14450 && code
!= TYPENAME_TYPE
14451 && code
!= TEMPLATE_TYPE_PARM
14452 && code
!= TEMPLATE_PARM_INDEX
14453 && code
!= IDENTIFIER_NODE
14454 && code
!= FUNCTION_TYPE
14455 && code
!= METHOD_TYPE
)
14456 type
= tsubst (type
, args
, complain
, in_decl
);
14457 if (type
== error_mark_node
)
14458 return error_mark_node
;
14464 case ENUMERAL_TYPE
:
14465 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
14466 /*entering_scope=*/0);
14469 case IDENTIFIER_NODE
:
14480 if (t
== integer_type_node
)
14483 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
14484 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
14488 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
14490 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
14491 /*integral_constant_expression_p=*/false);
14493 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
14495 if (TREE_CODE (max
) == NOP_EXPR
14496 && TREE_SIDE_EFFECTS (omax
)
14497 && !TREE_TYPE (max
))
14498 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
14500 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
14501 with TREE_SIDE_EFFECTS that indicates this is not an integral
14502 constant expression. */
14503 if (processing_template_decl
14504 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
14506 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
14507 TREE_SIDE_EFFECTS (max
) = 1;
14510 return compute_array_index_type (NULL_TREE
, max
, complain
);
14513 case TEMPLATE_TYPE_PARM
:
14514 case TEMPLATE_TEMPLATE_PARM
:
14515 case BOUND_TEMPLATE_TEMPLATE_PARM
:
14516 case TEMPLATE_PARM_INDEX
:
14521 tree arg
= NULL_TREE
;
14523 /* Early in template argument deduction substitution, we don't
14524 want to reduce the level of 'auto', or it will be confused
14525 with a normal template parm in subsequent deduction. */
14526 if (is_auto (t
) && (complain
& tf_partial
))
14531 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
14532 template_parm_level_and_index (t
, &level
, &idx
);
14534 levels
= TMPL_ARGS_DEPTH (args
);
14535 if (level
<= levels
14536 && TREE_VEC_LENGTH (TMPL_ARGS_LEVEL (args
, level
)) > 0)
14538 arg
= TMPL_ARG (args
, level
, idx
);
14540 /* See through ARGUMENT_PACK_SELECT arguments. */
14541 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
14542 arg
= argument_pack_select_arg (arg
);
14545 if (arg
== error_mark_node
)
14546 return error_mark_node
;
14547 else if (arg
!= NULL_TREE
)
14549 if (ARGUMENT_PACK_P (arg
))
14550 /* If ARG is an argument pack, we don't actually want to
14551 perform a substitution here, because substitutions
14552 for argument packs are only done
14553 element-by-element. We can get to this point when
14554 substituting the type of a non-type template
14555 parameter pack, when that type actually contains
14556 template parameter packs from an outer template, e.g.,
14558 template<typename... Types> struct A {
14559 template<Types... Values> struct B { };
14563 if (code
== TEMPLATE_TYPE_PARM
)
14566 gcc_assert (TYPE_P (arg
));
14568 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
14570 return cp_build_qualified_type_real
14571 (arg
, quals
, complain
| tf_ignore_bad_quals
);
14573 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
14575 /* We are processing a type constructed from a
14576 template template parameter. */
14577 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
14578 args
, complain
, in_decl
);
14579 if (argvec
== error_mark_node
)
14580 return error_mark_node
;
14582 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
14583 || TREE_CODE (arg
) == TEMPLATE_DECL
14584 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
14586 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
14587 /* Consider this code:
14589 template <template <class> class Template>
14591 template <class Arg> using Bind = Template<Arg>;
14594 template <template <class> class Template, class Arg>
14595 using Instantiate = Template<Arg>; //#0
14597 template <template <class> class Template,
14600 Instantiate<Internal<Template>::template Bind,
14603 When #1 is parsed, the
14604 BOUND_TEMPLATE_TEMPLATE_PARM representing the
14605 parameter `Template' in #0 matches the
14606 UNBOUND_CLASS_TEMPLATE representing the argument
14607 `Internal<Template>::template Bind'; We then want
14608 to assemble the type `Bind<Argument>' that can't
14609 be fully created right now, because
14610 `Internal<Template>' not being complete, the Bind
14611 template cannot be looked up in that context. So
14612 we need to "store" `Bind<Argument>' for later
14613 when the context of Bind becomes complete. Let's
14614 store that in a TYPENAME_TYPE. */
14615 return make_typename_type (TYPE_CONTEXT (arg
),
14616 build_nt (TEMPLATE_ID_EXPR
,
14617 TYPE_IDENTIFIER (arg
),
14622 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
14623 are resolving nested-types in the signature of a
14624 member function templates. Otherwise ARG is a
14625 TEMPLATE_DECL and is the real template to be
14627 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
14628 arg
= TYPE_NAME (arg
);
14630 r
= lookup_template_class (arg
,
14632 DECL_CONTEXT (arg
),
14633 /*entering_scope=*/0,
14635 return cp_build_qualified_type_real
14636 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
14638 else if (code
== TEMPLATE_TEMPLATE_PARM
)
14641 /* TEMPLATE_PARM_INDEX. */
14642 return convert_from_reference (unshare_expr (arg
));
14646 /* This can happen during the attempted tsubst'ing in
14647 unify. This means that we don't yet have any information
14648 about the template parameter in question. */
14651 /* If we get here, we must have been looking at a parm for a
14652 more deeply nested template. Make a new version of this
14653 template parameter, but with a lower level. */
14656 case TEMPLATE_TYPE_PARM
:
14657 case TEMPLATE_TEMPLATE_PARM
:
14658 case BOUND_TEMPLATE_TEMPLATE_PARM
:
14659 if (cp_type_quals (t
))
14661 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
14662 r
= cp_build_qualified_type_real
14663 (r
, cp_type_quals (t
),
14664 complain
| (code
== TEMPLATE_TYPE_PARM
14665 ? tf_ignore_bad_quals
: 0));
14667 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
14668 && PLACEHOLDER_TYPE_CONSTRAINTS (t
)
14669 && (r
= (TEMPLATE_PARM_DESCENDANTS
14670 (TEMPLATE_TYPE_PARM_INDEX (t
))))
14671 && (r
= TREE_TYPE (r
))
14672 && !PLACEHOLDER_TYPE_CONSTRAINTS (r
))
14673 /* Break infinite recursion when substituting the constraints
14674 of a constrained placeholder. */;
14675 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
14676 && !PLACEHOLDER_TYPE_CONSTRAINTS (t
)
14677 && !CLASS_PLACEHOLDER_TEMPLATE (t
)
14678 && (arg
= TEMPLATE_TYPE_PARM_INDEX (t
),
14679 r
= TEMPLATE_PARM_DESCENDANTS (arg
))
14680 && (TEMPLATE_PARM_LEVEL (r
)
14681 == TEMPLATE_PARM_LEVEL (arg
) - levels
))
14682 /* Cache the simple case of lowering a type parameter. */
14687 TEMPLATE_TYPE_PARM_INDEX (r
)
14688 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
14689 r
, levels
, args
, complain
);
14690 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
14691 TYPE_MAIN_VARIANT (r
) = r
;
14692 TYPE_POINTER_TO (r
) = NULL_TREE
;
14693 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
14695 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
14697 /* Propagate constraints on placeholders. */
14698 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
14699 PLACEHOLDER_TYPE_CONSTRAINTS (r
)
14700 = tsubst_constraint (constr
, args
, complain
, in_decl
);
14701 else if (tree pl
= CLASS_PLACEHOLDER_TEMPLATE (t
))
14703 pl
= tsubst_copy (pl
, args
, complain
, in_decl
);
14704 CLASS_PLACEHOLDER_TEMPLATE (r
) = pl
;
14708 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
14709 /* We have reduced the level of the template
14710 template parameter, but not the levels of its
14711 template parameters, so canonical_type_parameter
14712 will not be able to find the canonical template
14713 template parameter for this level. Thus, we
14714 require structural equality checking to compare
14715 TEMPLATE_TEMPLATE_PARMs. */
14716 SET_TYPE_STRUCTURAL_EQUALITY (r
);
14717 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
14718 SET_TYPE_STRUCTURAL_EQUALITY (r
);
14720 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
14722 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
14724 tree tinfo
= TYPE_TEMPLATE_INFO (t
);
14725 /* We might need to substitute into the types of non-type
14726 template parameters. */
14727 tree tmpl
= tsubst (TI_TEMPLATE (tinfo
), args
,
14728 complain
, in_decl
);
14729 if (tmpl
== error_mark_node
)
14730 return error_mark_node
;
14731 tree argvec
= tsubst (TI_ARGS (tinfo
), args
,
14732 complain
, in_decl
);
14733 if (argvec
== error_mark_node
)
14734 return error_mark_node
;
14736 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
14737 = build_template_info (tmpl
, argvec
);
14742 case TEMPLATE_PARM_INDEX
:
14743 /* OK, now substitute the type of the non-type parameter. We
14744 couldn't do it earlier because it might be an auto parameter,
14745 and we wouldn't need to if we had an argument. */
14746 type
= tsubst (type
, args
, complain
, in_decl
);
14747 if (type
== error_mark_node
)
14748 return error_mark_node
;
14749 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
14753 gcc_unreachable ();
14761 tree purpose
, value
, chain
;
14763 if (t
== void_list_node
)
14766 purpose
= TREE_PURPOSE (t
);
14769 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
14770 if (purpose
== error_mark_node
)
14771 return error_mark_node
;
14773 value
= TREE_VALUE (t
);
14776 value
= tsubst (value
, args
, complain
, in_decl
);
14777 if (value
== error_mark_node
)
14778 return error_mark_node
;
14780 chain
= TREE_CHAIN (t
);
14781 if (chain
&& chain
!= void_type_node
)
14783 chain
= tsubst (chain
, args
, complain
, in_decl
);
14784 if (chain
== error_mark_node
)
14785 return error_mark_node
;
14787 if (purpose
== TREE_PURPOSE (t
)
14788 && value
== TREE_VALUE (t
)
14789 && chain
== TREE_CHAIN (t
))
14791 return hash_tree_cons (purpose
, value
, chain
);
14795 /* We should never be tsubsting a binfo. */
14796 gcc_unreachable ();
14799 /* A vector of template arguments. */
14800 gcc_assert (!type
);
14801 return tsubst_template_args (t
, args
, complain
, in_decl
);
14804 case REFERENCE_TYPE
:
14806 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
14811 Type deduction may fail for any of the following
14814 -- Attempting to create a pointer to reference type.
14815 -- Attempting to create a reference to a reference type or
14816 a reference to void.
14818 Core issue 106 says that creating a reference to a reference
14819 during instantiation is no longer a cause for failure. We
14820 only enforce this check in strict C++98 mode. */
14821 if ((TYPE_REF_P (type
)
14822 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
14823 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
14825 static location_t last_loc
;
14827 /* We keep track of the last time we issued this error
14828 message to avoid spewing a ton of messages during a
14829 single bad template instantiation. */
14830 if (complain
& tf_error
14831 && last_loc
!= input_location
)
14833 if (VOID_TYPE_P (type
))
14834 error ("forming reference to void");
14835 else if (code
== POINTER_TYPE
)
14836 error ("forming pointer to reference type %qT", type
);
14838 error ("forming reference to reference type %qT", type
);
14839 last_loc
= input_location
;
14842 return error_mark_node
;
14844 else if (TREE_CODE (type
) == FUNCTION_TYPE
14845 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
14846 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
14848 if (complain
& tf_error
)
14850 if (code
== POINTER_TYPE
)
14851 error ("forming pointer to qualified function type %qT",
14854 error ("forming reference to qualified function type %qT",
14857 return error_mark_node
;
14859 else if (code
== POINTER_TYPE
)
14861 r
= build_pointer_type (type
);
14862 if (TREE_CODE (type
) == METHOD_TYPE
)
14863 r
= build_ptrmemfunc_type (r
);
14865 else if (TYPE_REF_P (type
))
14866 /* In C++0x, during template argument substitution, when there is an
14867 attempt to create a reference to a reference type, reference
14868 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
14870 "If a template-argument for a template-parameter T names a type
14871 that is a reference to a type A, an attempt to create the type
14872 'lvalue reference to cv T' creates the type 'lvalue reference to
14873 A,' while an attempt to create the type type rvalue reference to
14874 cv T' creates the type T"
14876 r
= cp_build_reference_type
14878 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
14880 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
14881 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
14883 if (r
!= error_mark_node
)
14884 /* Will this ever be needed for TYPE_..._TO values? */
14891 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
14892 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
14896 Type deduction may fail for any of the following
14899 -- Attempting to create "pointer to member of T" when T
14900 is not a class type. */
14901 if (complain
& tf_error
)
14902 error ("creating pointer to member of non-class type %qT", r
);
14903 return error_mark_node
;
14905 if (TYPE_REF_P (type
))
14907 if (complain
& tf_error
)
14908 error ("creating pointer to member reference type %qT", type
);
14909 return error_mark_node
;
14911 if (VOID_TYPE_P (type
))
14913 if (complain
& tf_error
)
14914 error ("creating pointer to member of type void");
14915 return error_mark_node
;
14917 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
14918 if (TREE_CODE (type
) == FUNCTION_TYPE
)
14920 /* The type of the implicit object parameter gets its
14921 cv-qualifiers from the FUNCTION_TYPE. */
14924 = build_memfn_type (type
, r
, type_memfn_quals (type
),
14925 type_memfn_rqual (type
));
14926 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
14927 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
14931 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
14935 case FUNCTION_TYPE
:
14940 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
14941 if (fntype
== error_mark_node
)
14942 return error_mark_node
;
14944 /* Substitute the exception specification. */
14945 specs
= tsubst_exception_specification (t
, args
, complain
, in_decl
,
14946 /*defer_ok*/fndecl_type
);
14947 if (specs
== error_mark_node
)
14948 return error_mark_node
;
14950 fntype
= build_exception_variant (fntype
, specs
);
14955 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
14956 if (domain
== error_mark_node
)
14957 return error_mark_node
;
14959 /* As an optimization, we avoid regenerating the array type if
14960 it will obviously be the same as T. */
14961 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
14964 /* These checks should match the ones in create_array_type_for_decl.
14968 The deduction may fail for any of the following reasons:
14970 -- Attempting to create an array with an element type that
14971 is void, a function type, or a reference type, or [DR337]
14972 an abstract class type. */
14973 if (VOID_TYPE_P (type
)
14974 || TREE_CODE (type
) == FUNCTION_TYPE
14975 || (TREE_CODE (type
) == ARRAY_TYPE
14976 && TYPE_DOMAIN (type
) == NULL_TREE
)
14977 || TYPE_REF_P (type
))
14979 if (complain
& tf_error
)
14980 error ("creating array of %qT", type
);
14981 return error_mark_node
;
14984 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
14985 return error_mark_node
;
14987 r
= build_cplus_array_type (type
, domain
);
14989 if (!valid_array_size_p (input_location
, r
, in_decl
,
14990 (complain
& tf_error
)))
14991 return error_mark_node
;
14993 if (TYPE_USER_ALIGN (t
))
14995 SET_TYPE_ALIGN (r
, TYPE_ALIGN (t
));
14996 TYPE_USER_ALIGN (r
) = 1;
15002 case TYPENAME_TYPE
:
15004 tree ctx
= TYPE_CONTEXT (t
);
15005 if (TREE_CODE (ctx
) == TYPE_PACK_EXPANSION
)
15007 ctx
= tsubst_pack_expansion (ctx
, args
, complain
, in_decl
);
15008 if (ctx
== error_mark_node
15009 || TREE_VEC_LENGTH (ctx
) > 1)
15010 return error_mark_node
;
15011 if (TREE_VEC_LENGTH (ctx
) == 0)
15013 if (complain
& tf_error
)
15014 error ("%qD is instantiated for an empty pack",
15015 TYPENAME_TYPE_FULLNAME (t
));
15016 return error_mark_node
;
15018 ctx
= TREE_VEC_ELT (ctx
, 0);
15021 ctx
= tsubst_aggr_type (ctx
, args
, complain
, in_decl
,
15022 /*entering_scope=*/1);
15023 if (ctx
== error_mark_node
)
15024 return error_mark_node
;
15026 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
15027 complain
, in_decl
);
15028 if (f
== error_mark_node
)
15029 return error_mark_node
;
15031 if (!MAYBE_CLASS_TYPE_P (ctx
))
15033 if (complain
& tf_error
)
15034 error ("%qT is not a class, struct, or union type", ctx
);
15035 return error_mark_node
;
15037 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
15039 /* Normally, make_typename_type does not require that the CTX
15040 have complete type in order to allow things like:
15042 template <class T> struct S { typename S<T>::X Y; };
15044 But, such constructs have already been resolved by this
15045 point, so here CTX really should have complete type, unless
15046 it's a partial instantiation. */
15047 ctx
= complete_type (ctx
);
15048 if (!COMPLETE_TYPE_P (ctx
))
15050 if (complain
& tf_error
)
15051 cxx_incomplete_type_error (NULL_TREE
, ctx
);
15052 return error_mark_node
;
15056 f
= make_typename_type (ctx
, f
, typename_type
,
15057 complain
| tf_keep_type_decl
);
15058 if (f
== error_mark_node
)
15060 if (TREE_CODE (f
) == TYPE_DECL
)
15062 complain
|= tf_ignore_bad_quals
;
15066 if (TREE_CODE (f
) != TYPENAME_TYPE
)
15068 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
15070 if (complain
& tf_error
)
15071 error ("%qT resolves to %qT, which is not an enumeration type",
15074 return error_mark_node
;
15076 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
15078 if (complain
& tf_error
)
15079 error ("%qT resolves to %qT, which is is not a class type",
15082 return error_mark_node
;
15086 return cp_build_qualified_type_real
15087 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
15090 case UNBOUND_CLASS_TEMPLATE
:
15092 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
15093 in_decl
, /*entering_scope=*/1);
15094 tree name
= TYPE_IDENTIFIER (t
);
15095 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
15097 if (ctx
== error_mark_node
|| name
== error_mark_node
)
15098 return error_mark_node
;
15101 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
15102 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
15109 ++cp_unevaluated_operand
;
15110 ++c_inhibit_evaluation_warnings
;
15112 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
15114 /*integral_constant_expression_p=*/false);
15116 --cp_unevaluated_operand
;
15117 --c_inhibit_evaluation_warnings
;
15119 type
= finish_typeof (type
);
15120 return cp_build_qualified_type_real (type
,
15122 | cp_type_quals (type
),
15126 case DECLTYPE_TYPE
:
15130 ++cp_unevaluated_operand
;
15131 ++c_inhibit_evaluation_warnings
;
15133 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
15134 complain
|tf_decltype
, in_decl
,
15135 /*function_p*/false,
15136 /*integral_constant_expression*/false);
15138 --cp_unevaluated_operand
;
15139 --c_inhibit_evaluation_warnings
;
15141 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
15142 type
= lambda_capture_field_type (type
,
15143 false /*explicit_init*/,
15144 DECLTYPE_FOR_REF_CAPTURE (t
));
15145 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
15146 type
= lambda_proxy_type (type
);
15149 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
15150 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
15152 /* In a template ~id could be either a complement expression
15153 or an unqualified-id naming a destructor; if instantiating
15154 it produces an expression, it's not an id-expression or
15157 type
= finish_decltype_type (type
, id
, complain
);
15159 return cp_build_qualified_type_real (type
,
15161 | cp_type_quals (type
),
15162 complain
| tf_ignore_bad_quals
);
15165 case UNDERLYING_TYPE
:
15167 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
15168 complain
, in_decl
);
15169 return finish_underlying_type (type
);
15172 case TYPE_ARGUMENT_PACK
:
15173 case NONTYPE_ARGUMENT_PACK
:
15177 if (code
== NONTYPE_ARGUMENT_PACK
)
15178 r
= make_node (code
);
15180 r
= cxx_make_type (code
);
15182 tree pack_args
= ARGUMENT_PACK_ARGS (t
);
15183 pack_args
= tsubst_template_args (pack_args
, args
, complain
, in_decl
);
15184 SET_ARGUMENT_PACK_ARGS (r
, pack_args
);
15202 /* We should use one of the expression tsubsts for these codes. */
15203 gcc_unreachable ();
15206 sorry ("use of %qs in template", get_tree_code_name (code
));
15207 return error_mark_node
;
15211 /* tsubst a BASELINK. OBJECT_TYPE, if non-NULL, is the type of the
15212 expression on the left-hand side of the "." or "->" operator. We
15213 only do the lookup if we had a dependent BASELINK. Otherwise we
15214 adjust it onto the instantiated heirarchy. */
15217 tsubst_baselink (tree baselink
, tree object_type
,
15218 tree args
, tsubst_flags_t complain
, tree in_decl
)
15220 bool qualified_p
= BASELINK_QUALIFIED_P (baselink
);
15221 tree qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
15222 qualifying_scope
= tsubst (qualifying_scope
, args
, complain
, in_decl
);
15224 tree optype
= BASELINK_OPTYPE (baselink
);
15225 optype
= tsubst (optype
, args
, complain
, in_decl
);
15227 tree template_args
= NULL_TREE
;
15228 bool template_id_p
= false;
15229 tree fns
= BASELINK_FUNCTIONS (baselink
);
15230 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
15232 template_id_p
= true;
15233 template_args
= TREE_OPERAND (fns
, 1);
15234 fns
= TREE_OPERAND (fns
, 0);
15236 template_args
= tsubst_template_args (template_args
, args
,
15237 complain
, in_decl
);
15240 tree binfo_type
= BINFO_TYPE (BASELINK_BINFO (baselink
));
15241 binfo_type
= tsubst (binfo_type
, args
, complain
, in_decl
);
15242 bool dependent_p
= binfo_type
!= BINFO_TYPE (BASELINK_BINFO (baselink
));
15246 tree name
= OVL_NAME (fns
);
15247 if (IDENTIFIER_CONV_OP_P (name
))
15248 name
= make_conv_op_name (optype
);
15250 if (name
== complete_dtor_identifier
)
15251 /* Treat as-if non-dependent below. */
15252 dependent_p
= false;
15254 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
15257 if ((complain
& tf_error
)
15258 && constructor_name_p (name
, qualifying_scope
))
15259 error ("cannot call constructor %<%T::%D%> directly",
15260 qualifying_scope
, name
);
15261 return error_mark_node
;
15264 if (BASELINK_P (baselink
))
15265 fns
= BASELINK_FUNCTIONS (baselink
);
15268 /* We're going to overwrite pieces below, make a duplicate. */
15269 baselink
= copy_node (baselink
);
15271 /* If lookup found a single function, mark it as used at this point.
15272 (If lookup found multiple functions the one selected later by
15273 overload resolution will be marked as used at that point.) */
15274 if (!template_id_p
&& !really_overloaded_fn (fns
))
15276 tree fn
= OVL_FIRST (fns
);
15277 bool ok
= mark_used (fn
, complain
);
15278 if (!ok
&& !(complain
& tf_error
))
15279 return error_mark_node
;
15280 if (ok
&& BASELINK_P (baselink
))
15281 /* We might have instantiated an auto function. */
15282 TREE_TYPE (baselink
) = TREE_TYPE (fn
);
15285 if (BASELINK_P (baselink
))
15287 /* Add back the template arguments, if present. */
15289 BASELINK_FUNCTIONS (baselink
)
15290 = build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fns
, template_args
);
15292 /* Update the conversion operator type. */
15293 BASELINK_OPTYPE (baselink
) = optype
;
15297 object_type
= current_class_type
;
15299 if (qualified_p
|| !dependent_p
)
15301 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
15305 /* We need to call adjust_result_of_qualified_name_lookup in case the
15306 destructor names a base class, but we unset BASELINK_QUALIFIED_P
15307 so that we still get virtual function binding. */
15308 BASELINK_QUALIFIED_P (baselink
) = false;
15314 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
15315 true if the qualified-id will be a postfix-expression in-and-of
15316 itself; false if more of the postfix-expression follows the
15317 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
15321 tsubst_qualified_id (tree qualified_id
, tree args
,
15322 tsubst_flags_t complain
, tree in_decl
,
15323 bool done
, bool address_p
)
15329 tree template_args
;
15330 location_t loc
= UNKNOWN_LOCATION
;
15332 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
15334 /* Figure out what name to look up. */
15335 name
= TREE_OPERAND (qualified_id
, 1);
15336 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
15338 is_template
= true;
15339 loc
= EXPR_LOCATION (name
);
15340 template_args
= TREE_OPERAND (name
, 1);
15342 template_args
= tsubst_template_args (template_args
, args
,
15343 complain
, in_decl
);
15344 if (template_args
== error_mark_node
)
15345 return error_mark_node
;
15346 name
= TREE_OPERAND (name
, 0);
15350 is_template
= false;
15351 template_args
= NULL_TREE
;
15354 /* Substitute into the qualifying scope. When there are no ARGS, we
15355 are just trying to simplify a non-dependent expression. In that
15356 case the qualifying scope may be dependent, and, in any case,
15357 substituting will not help. */
15358 scope
= TREE_OPERAND (qualified_id
, 0);
15361 scope
= tsubst (scope
, args
, complain
, in_decl
);
15362 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
15367 if (dependent_scope_p (scope
))
15370 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
15371 tree r
= build_qualified_name (NULL_TREE
, scope
, expr
,
15372 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
15373 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (qualified_id
);
15377 if (!BASELINK_P (name
) && !DECL_P (expr
))
15379 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
15381 /* A BIT_NOT_EXPR is used to represent a destructor. */
15382 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
15384 error ("qualifying type %qT does not match destructor name ~%qT",
15385 scope
, TREE_OPERAND (expr
, 0));
15386 expr
= error_mark_node
;
15389 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
15390 /*is_type_p=*/0, false);
15393 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
15394 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
15395 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
15397 if (complain
& tf_error
)
15399 error ("dependent-name %qE is parsed as a non-type, but "
15400 "instantiation yields a type", qualified_id
);
15401 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
15403 return error_mark_node
;
15409 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
15411 /* Remember that there was a reference to this entity. */
15412 if (!mark_used (expr
, complain
) && !(complain
& tf_error
))
15413 return error_mark_node
;
15416 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
15418 if (complain
& tf_error
)
15419 qualified_name_lookup_error (scope
,
15420 TREE_OPERAND (qualified_id
, 1),
15421 expr
, input_location
);
15422 return error_mark_node
;
15427 /* We may be repeating a check already done during parsing, but
15428 if it was well-formed and passed then, it will pass again
15429 now, and if it didn't, we wouldn't have got here. The case
15430 we want to catch is when we couldn't tell then, and can now,
15431 namely when templ prior to substitution was an
15433 if (flag_concepts
&& check_auto_in_tmpl_args (expr
, template_args
))
15434 return error_mark_node
;
15436 if (variable_template_p (expr
))
15437 expr
= lookup_and_finish_template_variable (expr
, template_args
,
15440 expr
= lookup_template_function (expr
, template_args
);
15443 if (expr
== error_mark_node
&& complain
& tf_error
)
15444 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
15445 expr
, input_location
);
15446 else if (TYPE_P (scope
))
15448 expr
= (adjust_result_of_qualified_name_lookup
15449 (expr
, scope
, current_nonlambda_class_type ()));
15450 expr
= (finish_qualified_id_expr
15451 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
15452 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
15453 /*template_arg_p=*/false, complain
));
15456 /* Expressions do not generally have reference type. */
15457 if (TREE_CODE (expr
) != SCOPE_REF
15458 /* However, if we're about to form a pointer-to-member, we just
15459 want the referenced member referenced. */
15460 && TREE_CODE (expr
) != OFFSET_REF
)
15461 expr
= convert_from_reference (expr
);
15463 if (REF_PARENTHESIZED_P (qualified_id
))
15464 expr
= force_paren_expr (expr
);
15469 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
15470 initializer, DECL is the substituted VAR_DECL. Other arguments are as
15474 tsubst_init (tree init
, tree decl
, tree args
,
15475 tsubst_flags_t complain
, tree in_decl
)
15480 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
15482 tree type
= TREE_TYPE (decl
);
15484 if (!init
&& type
!= error_mark_node
)
15486 if (tree auto_node
= type_uses_auto (type
))
15488 if (!CLASS_PLACEHOLDER_TEMPLATE (auto_node
))
15490 if (complain
& tf_error
)
15491 error ("initializer for %q#D expands to an empty list "
15492 "of expressions", decl
);
15493 return error_mark_node
;
15496 else if (!dependent_type_p (type
))
15498 /* If we had an initializer but it
15499 instantiated to nothing,
15500 value-initialize the object. This will
15501 only occur when the initializer was a
15502 pack expansion where the parameter packs
15503 used in that expansion were of length
15505 init
= build_value_init (type
, complain
);
15506 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
15507 init
= get_target_expr_sfinae (init
, complain
);
15508 if (TREE_CODE (init
) == TARGET_EXPR
)
15509 TARGET_EXPR_DIRECT_INIT_P (init
) = true;
15516 /* Like tsubst, but deals with expressions. This function just replaces
15517 template parms; to finish processing the resultant expression, use
15518 tsubst_copy_and_build or tsubst_expr. */
15521 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
15523 enum tree_code code
;
15526 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
15529 code
= TREE_CODE (t
);
15534 r
= retrieve_local_specialization (t
);
15536 if (r
== NULL_TREE
)
15538 /* We get here for a use of 'this' in an NSDMI. */
15539 if (DECL_NAME (t
) == this_identifier
&& current_class_ptr
)
15540 return current_class_ptr
;
15542 /* This can happen for a parameter name used later in a function
15543 declaration (such as in a late-specified return type). Just
15544 make a dummy decl, since it's only used for its type. */
15545 gcc_assert (cp_unevaluated_operand
!= 0);
15546 r
= tsubst_decl (t
, args
, complain
);
15547 /* Give it the template pattern as its context; its true context
15548 hasn't been instantiated yet and this is good enough for
15550 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
15553 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
15554 r
= argument_pack_select_arg (r
);
15555 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
15556 return error_mark_node
;
15564 if (DECL_TEMPLATE_PARM_P (t
))
15565 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
15566 /* There is no need to substitute into namespace-scope
15568 if (DECL_NAMESPACE_SCOPE_P (t
))
15570 /* If ARGS is NULL, then T is known to be non-dependent. */
15571 if (args
== NULL_TREE
)
15572 return scalar_constant_value (t
);
15574 /* Unfortunately, we cannot just call lookup_name here.
15577 template <int I> int f() {
15579 struct S { void g() { E e = a; } };
15582 When we instantiate f<7>::S::g(), say, lookup_name is not
15583 clever enough to find f<7>::a. */
15585 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
15586 /*entering_scope=*/0);
15588 for (v
= TYPE_VALUES (enum_type
);
15590 v
= TREE_CHAIN (v
))
15591 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
15592 return TREE_VALUE (v
);
15594 /* We didn't find the name. That should never happen; if
15595 name-lookup found it during preliminary parsing, we
15596 should find it again here during instantiation. */
15597 gcc_unreachable ();
15602 if (DECL_CONTEXT (t
))
15606 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
15607 /*entering_scope=*/1);
15608 if (ctx
!= DECL_CONTEXT (t
))
15610 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
15613 if (complain
& tf_error
)
15614 error ("using invalid field %qD", t
);
15615 return error_mark_node
;
15624 case FUNCTION_DECL
:
15625 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
15626 r
= tsubst (t
, args
, complain
, in_decl
);
15627 else if (local_variable_p (t
)
15628 && uses_template_parms (DECL_CONTEXT (t
)))
15630 r
= retrieve_local_specialization (t
);
15631 if (r
== NULL_TREE
)
15633 /* First try name lookup to find the instantiation. */
15634 r
= lookup_name (DECL_NAME (t
));
15639 /* During error-recovery we may find a non-variable,
15640 even an OVERLOAD: just bail out and avoid ICEs and
15641 duplicate diagnostics (c++/62207). */
15642 gcc_assert (seen_error ());
15643 return error_mark_node
;
15645 if (!is_capture_proxy (r
))
15647 /* Make sure the one we found is the one we want. */
15648 tree ctx
= enclosing_instantiation_of (DECL_CONTEXT (t
));
15649 if (ctx
!= DECL_CONTEXT (r
))
15658 /* This can happen for a variable used in a
15659 late-specified return type of a local lambda, or for a
15660 local static or constant. Building a new VAR_DECL
15661 should be OK in all those cases. */
15662 r
= tsubst_decl (t
, args
, complain
);
15663 if (local_specializations
)
15664 /* Avoid infinite recursion (79640). */
15665 register_local_specialization (r
, t
);
15666 if (decl_maybe_constant_var_p (r
))
15668 /* We can't call cp_finish_decl, so handle the
15669 initializer by hand. */
15670 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
15671 complain
, in_decl
);
15672 if (!processing_template_decl
)
15673 init
= maybe_constant_init (init
);
15674 if (processing_template_decl
15675 ? potential_constant_expression (init
)
15676 : reduced_constant_expression_p (init
))
15677 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
15678 = TREE_CONSTANT (r
) = true;
15679 DECL_INITIAL (r
) = init
;
15680 if (tree auto_node
= type_uses_auto (TREE_TYPE (r
)))
15682 = do_auto_deduction (TREE_TYPE (r
), init
, auto_node
,
15683 complain
, adc_variable_type
);
15685 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
15686 || decl_constant_var_p (r
)
15688 if (!processing_template_decl
15689 && !TREE_STATIC (r
))
15690 r
= process_outer_var_ref (r
, complain
);
15692 /* Remember this for subsequent uses. */
15693 if (local_specializations
)
15694 register_local_specialization (r
, t
);
15696 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
15697 r
= argument_pack_select_arg (r
);
15701 if (!mark_used (r
, complain
))
15702 return error_mark_node
;
15705 case NAMESPACE_DECL
:
15712 return tsubst_baselink (t
, current_nonlambda_class_type (),
15713 args
, complain
, in_decl
);
15715 case TEMPLATE_DECL
:
15716 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
15717 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
15718 args
, complain
, in_decl
);
15719 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
15720 return tsubst (t
, args
, complain
, in_decl
);
15721 else if (DECL_CLASS_SCOPE_P (t
)
15722 && uses_template_parms (DECL_CONTEXT (t
)))
15724 /* Template template argument like the following example need
15727 template <template <class> class TT> struct C {};
15728 template <class T> struct D {
15729 template <class U> struct E {};
15734 We are processing the template argument `E' in #1 for
15735 the template instantiation #2. Originally, `E' is a
15736 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
15737 have to substitute this with one having context `D<int>'. */
15739 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
15740 if (dependent_scope_p (context
))
15742 /* When rewriting a constructor into a deduction guide, a
15743 non-dependent name can become dependent, so memtmpl<args>
15744 becomes context::template memtmpl<args>. */
15745 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15746 return build_qualified_name (type
, context
, DECL_NAME (t
),
15749 return lookup_field (context
, DECL_NAME(t
), 0, false);
15752 /* Ordinary template template argument. */
15755 case NON_LVALUE_EXPR
:
15756 case VIEW_CONVERT_EXPR
:
15758 /* Handle location wrappers by substituting the wrapped node
15759 first, *then* reusing the resulting type. Doing the type
15760 first ensures that we handle template parameters and
15761 parameter pack expansions. */
15762 if (location_wrapper_p (t
))
15764 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
,
15765 complain
, in_decl
);
15766 return maybe_wrap_with_location (op0
, EXPR_LOCATION (t
));
15768 tree op
= TREE_OPERAND (t
, 0);
15769 if (code
== VIEW_CONVERT_EXPR
15770 && TREE_CODE (op
) == TEMPLATE_PARM_INDEX
)
15772 /* Wrapper to make a C++20 template parameter object const. */
15773 op
= tsubst_copy (op
, args
, complain
, in_decl
);
15774 if (TREE_CODE (op
) == TEMPLATE_PARM_INDEX
)
15776 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15777 return build1 (code
, type
, op
);
15781 gcc_assert (CP_TYPE_CONST_P (TREE_TYPE (op
)));
15785 /* We shouldn't see any other uses of these in templates. */
15786 gcc_unreachable ();
15790 case REINTERPRET_CAST_EXPR
:
15791 case CONST_CAST_EXPR
:
15792 case STATIC_CAST_EXPR
:
15793 case DYNAMIC_CAST_EXPR
:
15794 case IMPLICIT_CONV_EXPR
:
15798 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15799 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15800 return build1 (code
, type
, op0
);
15804 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0))
15805 || ARGUMENT_PACK_P (TREE_OPERAND (t
, 0)))
15807 tree expanded
, op
= TREE_OPERAND (t
, 0);
15810 if (SIZEOF_EXPR_TYPE_P (t
))
15811 op
= TREE_TYPE (op
);
15813 ++cp_unevaluated_operand
;
15814 ++c_inhibit_evaluation_warnings
;
15815 /* We only want to compute the number of arguments. */
15816 if (PACK_EXPANSION_P (op
))
15817 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
15819 expanded
= tsubst_template_args (ARGUMENT_PACK_ARGS (op
),
15820 args
, complain
, in_decl
);
15821 --cp_unevaluated_operand
;
15822 --c_inhibit_evaluation_warnings
;
15824 if (TREE_CODE (expanded
) == TREE_VEC
)
15826 len
= TREE_VEC_LENGTH (expanded
);
15827 /* Set TREE_USED for the benefit of -Wunused. */
15828 for (int i
= 0; i
< len
; i
++)
15829 if (DECL_P (TREE_VEC_ELT (expanded
, i
)))
15830 TREE_USED (TREE_VEC_ELT (expanded
, i
)) = true;
15833 if (expanded
== error_mark_node
)
15834 return error_mark_node
;
15835 else if (PACK_EXPANSION_P (expanded
)
15836 || (TREE_CODE (expanded
) == TREE_VEC
15837 && pack_expansion_args_count (expanded
)))
15840 if (PACK_EXPANSION_P (expanded
))
15842 else if (TREE_VEC_LENGTH (expanded
) == 1)
15843 expanded
= TREE_VEC_ELT (expanded
, 0);
15845 expanded
= make_argument_pack (expanded
);
15847 if (TYPE_P (expanded
))
15848 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
15850 complain
& tf_error
);
15852 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
15853 complain
& tf_error
);
15856 return build_int_cst (size_type_node
, len
);
15858 if (SIZEOF_EXPR_TYPE_P (t
))
15860 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
15861 args
, complain
, in_decl
);
15862 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
15863 r
= build1 (SIZEOF_EXPR
,
15864 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
15865 SIZEOF_EXPR_TYPE_P (r
) = 1;
15872 case TRUTH_NOT_EXPR
:
15875 case UNARY_PLUS_EXPR
: /* Unary + */
15877 case AT_ENCODE_EXPR
:
15881 case REALPART_EXPR
:
15882 case IMAGPART_EXPR
:
15885 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15886 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15887 r
= build1 (code
, type
, op0
);
15888 if (code
== ALIGNOF_EXPR
)
15889 ALIGNOF_EXPR_STD_P (r
) = ALIGNOF_EXPR_STD_P (t
);
15893 case COMPONENT_REF
:
15898 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15899 name
= TREE_OPERAND (t
, 1);
15900 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
15902 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
15903 complain
, in_decl
);
15904 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
15906 else if (TREE_CODE (name
) == SCOPE_REF
15907 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
15909 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
15910 complain
, in_decl
);
15911 name
= TREE_OPERAND (name
, 1);
15912 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
15913 complain
, in_decl
);
15914 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
15915 name
= build_qualified_name (/*type=*/NULL_TREE
,
15917 /*template_p=*/false);
15919 else if (BASELINK_P (name
))
15920 name
= tsubst_baselink (name
,
15921 non_reference (TREE_TYPE (object
)),
15925 name
= tsubst_copy (name
, args
, complain
, in_decl
);
15926 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
15932 case TRUNC_DIV_EXPR
:
15933 case CEIL_DIV_EXPR
:
15934 case FLOOR_DIV_EXPR
:
15935 case ROUND_DIV_EXPR
:
15936 case EXACT_DIV_EXPR
:
15940 case TRUNC_MOD_EXPR
:
15941 case FLOOR_MOD_EXPR
:
15942 case TRUTH_ANDIF_EXPR
:
15943 case TRUTH_ORIF_EXPR
:
15944 case TRUTH_AND_EXPR
:
15945 case TRUTH_OR_EXPR
:
15958 case COMPOUND_EXPR
:
15961 case PREDECREMENT_EXPR
:
15962 case PREINCREMENT_EXPR
:
15963 case POSTDECREMENT_EXPR
:
15964 case POSTINCREMENT_EXPR
:
15966 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15967 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15968 return build_nt (code
, op0
, op1
);
15973 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15974 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15975 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
15976 QUALIFIED_NAME_IS_TEMPLATE (t
));
15981 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15982 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15983 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
15988 int n
= VL_EXP_OPERAND_LENGTH (t
);
15989 tree result
= build_vl_exp (CALL_EXPR
, n
);
15991 for (i
= 0; i
< n
; i
++)
15992 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
15993 complain
, in_decl
);
15999 case PSEUDO_DTOR_EXPR
:
16000 case VEC_PERM_EXPR
:
16002 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
16003 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
16004 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
16005 r
= build_nt (code
, op0
, op1
, op2
);
16006 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
16012 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
16013 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
16014 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
16015 r
= build_nt (code
, op0
, op1
, op2
);
16016 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
16022 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
16023 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
16024 r
= build_nt (code
, op0
, op1
);
16025 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
16026 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
16030 case TEMPLATE_ID_EXPR
:
16032 /* Substituted template arguments */
16033 tree fn
= TREE_OPERAND (t
, 0);
16034 tree targs
= TREE_OPERAND (t
, 1);
16036 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
16038 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
16040 return lookup_template_function (fn
, targs
);
16045 tree purpose
, value
, chain
;
16047 if (t
== void_list_node
)
16050 purpose
= TREE_PURPOSE (t
);
16052 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
16053 value
= TREE_VALUE (t
);
16055 value
= tsubst_copy (value
, args
, complain
, in_decl
);
16056 chain
= TREE_CHAIN (t
);
16057 if (chain
&& chain
!= void_type_node
)
16058 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
16059 if (purpose
== TREE_PURPOSE (t
)
16060 && value
== TREE_VALUE (t
)
16061 && chain
== TREE_CHAIN (t
))
16063 return tree_cons (purpose
, value
, chain
);
16068 case ENUMERAL_TYPE
:
16070 case TEMPLATE_TYPE_PARM
:
16071 case TEMPLATE_TEMPLATE_PARM
:
16072 case BOUND_TEMPLATE_TEMPLATE_PARM
:
16073 case TEMPLATE_PARM_INDEX
:
16075 case REFERENCE_TYPE
:
16077 case FUNCTION_TYPE
:
16080 case TYPENAME_TYPE
:
16081 case UNBOUND_CLASS_TEMPLATE
:
16083 case DECLTYPE_TYPE
:
16085 return tsubst (t
, args
, complain
, in_decl
);
16089 /* Fall through. */
16090 case IDENTIFIER_NODE
:
16091 if (IDENTIFIER_CONV_OP_P (t
))
16093 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16094 return make_conv_op_name (new_type
);
16100 /* This is handled by tsubst_copy_and_build. */
16101 gcc_unreachable ();
16105 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
16106 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16107 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
16110 case CLEANUP_POINT_EXPR
:
16111 /* We shouldn't have built any of these during initial template
16112 generation. Instead, they should be built during instantiation
16113 in response to the saved STMT_IS_FULL_EXPR_P setting. */
16114 gcc_unreachable ();
16118 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16119 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
16120 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
16121 r
= build2 (code
, type
, op0
, op1
);
16122 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
16123 if (!mark_used (TREE_OPERAND (r
, 1), complain
)
16124 && !(complain
& tf_error
))
16125 return error_mark_node
;
16129 case EXPR_PACK_EXPANSION
:
16130 error ("invalid use of pack expansion expression");
16131 return error_mark_node
;
16133 case NONTYPE_ARGUMENT_PACK
:
16134 error ("use %<...%> to expand argument pack");
16135 return error_mark_node
;
16138 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
16146 /* Instantiate any typedefs in the type. */
16147 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16148 r
= fold_convert (type
, t
);
16149 gcc_assert (TREE_CODE (r
) == code
);
16154 /* These can sometimes show up in a partial instantiation, but never
16155 involve template parms. */
16156 gcc_assert (!uses_template_parms (t
));
16159 case UNARY_LEFT_FOLD_EXPR
:
16160 return tsubst_unary_left_fold (t
, args
, complain
, in_decl
);
16161 case UNARY_RIGHT_FOLD_EXPR
:
16162 return tsubst_unary_right_fold (t
, args
, complain
, in_decl
);
16163 case BINARY_LEFT_FOLD_EXPR
:
16164 return tsubst_binary_left_fold (t
, args
, complain
, in_decl
);
16165 case BINARY_RIGHT_FOLD_EXPR
:
16166 return tsubst_binary_right_fold (t
, args
, complain
, in_decl
);
16170 case DEBUG_BEGIN_STMT
:
16171 /* ??? There's no point in copying it for now, but maybe some
16172 day it will contain more information, such as a pointer back
16173 to the containing function, inlined copy or so. */
16177 /* We shouldn't get here, but keep going if !flag_checking. */
16179 gcc_unreachable ();
16184 /* Helper function for tsubst_omp_clauses, used for instantiation of
16185 OMP_CLAUSE_DECL of clauses. */
16188 tsubst_omp_clause_decl (tree decl
, tree args
, tsubst_flags_t complain
,
16189 tree in_decl
, tree
*iterator_cache
)
16191 if (decl
== NULL_TREE
)
16194 /* Handle OpenMP iterators. */
16195 if (TREE_CODE (decl
) == TREE_LIST
16196 && TREE_PURPOSE (decl
)
16197 && TREE_CODE (TREE_PURPOSE (decl
)) == TREE_VEC
)
16200 if (iterator_cache
[0] == TREE_PURPOSE (decl
))
16201 ret
= iterator_cache
[1];
16205 begin_scope (sk_omp
, NULL
);
16206 for (tree it
= TREE_PURPOSE (decl
); it
; it
= TREE_CHAIN (it
))
16208 *tp
= copy_node (it
);
16209 TREE_VEC_ELT (*tp
, 0)
16210 = tsubst_decl (TREE_VEC_ELT (it
, 0), args
, complain
);
16211 TREE_VEC_ELT (*tp
, 1)
16212 = tsubst_expr (TREE_VEC_ELT (it
, 1), args
, complain
, in_decl
,
16213 /*integral_constant_expression_p=*/false);
16214 TREE_VEC_ELT (*tp
, 2)
16215 = tsubst_expr (TREE_VEC_ELT (it
, 2), args
, complain
, in_decl
,
16216 /*integral_constant_expression_p=*/false);
16217 TREE_VEC_ELT (*tp
, 3)
16218 = tsubst_expr (TREE_VEC_ELT (it
, 3), args
, complain
, in_decl
,
16219 /*integral_constant_expression_p=*/false);
16220 TREE_CHAIN (*tp
) = NULL_TREE
;
16221 tp
= &TREE_CHAIN (*tp
);
16223 TREE_VEC_ELT (ret
, 5) = poplevel (1, 1, 0);
16224 iterator_cache
[0] = TREE_PURPOSE (decl
);
16225 iterator_cache
[1] = ret
;
16227 return build_tree_list (ret
, tsubst_omp_clause_decl (TREE_VALUE (decl
),
16232 /* Handle an OpenMP array section represented as a TREE_LIST (or
16233 OMP_CLAUSE_DEPEND_KIND). An OMP_CLAUSE_DEPEND (with a depend
16234 kind of OMP_CLAUSE_DEPEND_SINK) can also be represented as a
16235 TREE_LIST. We can handle it exactly the same as an array section
16236 (purpose, value, and a chain), even though the nomenclature
16237 (low_bound, length, etc) is different. */
16238 if (TREE_CODE (decl
) == TREE_LIST
)
16241 = tsubst_expr (TREE_PURPOSE (decl
), args
, complain
, in_decl
,
16242 /*integral_constant_expression_p=*/false);
16243 tree length
= tsubst_expr (TREE_VALUE (decl
), args
, complain
, in_decl
,
16244 /*integral_constant_expression_p=*/false);
16245 tree chain
= tsubst_omp_clause_decl (TREE_CHAIN (decl
), args
, complain
,
16247 if (TREE_PURPOSE (decl
) == low_bound
16248 && TREE_VALUE (decl
) == length
16249 && TREE_CHAIN (decl
) == chain
)
16251 tree ret
= tree_cons (low_bound
, length
, chain
);
16252 OMP_CLAUSE_DEPEND_SINK_NEGATIVE (ret
)
16253 = OMP_CLAUSE_DEPEND_SINK_NEGATIVE (decl
);
16256 tree ret
= tsubst_expr (decl
, args
, complain
, in_decl
,
16257 /*integral_constant_expression_p=*/false);
16258 /* Undo convert_from_reference tsubst_expr could have called. */
16260 && REFERENCE_REF_P (ret
)
16261 && !REFERENCE_REF_P (decl
))
16262 ret
= TREE_OPERAND (ret
, 0);
16266 /* Like tsubst_copy, but specifically for OpenMP clauses. */
16269 tsubst_omp_clauses (tree clauses
, enum c_omp_region_type ort
,
16270 tree args
, tsubst_flags_t complain
, tree in_decl
)
16272 tree new_clauses
= NULL_TREE
, nc
, oc
;
16273 tree linear_no_step
= NULL_TREE
;
16274 tree iterator_cache
[2] = { NULL_TREE
, NULL_TREE
};
16276 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
16278 nc
= copy_node (oc
);
16279 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
16282 switch (OMP_CLAUSE_CODE (nc
))
16284 case OMP_CLAUSE_LASTPRIVATE
:
16285 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
16287 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
16288 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
16289 in_decl
, /*integral_constant_expression_p=*/false);
16290 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
16291 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
16294 case OMP_CLAUSE_PRIVATE
:
16295 case OMP_CLAUSE_SHARED
:
16296 case OMP_CLAUSE_FIRSTPRIVATE
:
16297 case OMP_CLAUSE_COPYIN
:
16298 case OMP_CLAUSE_COPYPRIVATE
:
16299 case OMP_CLAUSE_UNIFORM
:
16300 case OMP_CLAUSE_DEPEND
:
16301 case OMP_CLAUSE_FROM
:
16302 case OMP_CLAUSE_TO
:
16303 case OMP_CLAUSE_MAP
:
16304 case OMP_CLAUSE_NONTEMPORAL
:
16305 case OMP_CLAUSE_USE_DEVICE_PTR
:
16306 case OMP_CLAUSE_IS_DEVICE_PTR
:
16307 case OMP_CLAUSE_INCLUSIVE
:
16308 case OMP_CLAUSE_EXCLUSIVE
:
16309 OMP_CLAUSE_DECL (nc
)
16310 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
16311 in_decl
, iterator_cache
);
16313 case OMP_CLAUSE_TILE
:
16314 case OMP_CLAUSE_IF
:
16315 case OMP_CLAUSE_NUM_THREADS
:
16316 case OMP_CLAUSE_SCHEDULE
:
16317 case OMP_CLAUSE_COLLAPSE
:
16318 case OMP_CLAUSE_FINAL
:
16319 case OMP_CLAUSE_DEVICE
:
16320 case OMP_CLAUSE_DIST_SCHEDULE
:
16321 case OMP_CLAUSE_NUM_TEAMS
:
16322 case OMP_CLAUSE_THREAD_LIMIT
:
16323 case OMP_CLAUSE_SAFELEN
:
16324 case OMP_CLAUSE_SIMDLEN
:
16325 case OMP_CLAUSE_NUM_TASKS
:
16326 case OMP_CLAUSE_GRAINSIZE
:
16327 case OMP_CLAUSE_PRIORITY
:
16328 case OMP_CLAUSE_ORDERED
:
16329 case OMP_CLAUSE_HINT
:
16330 case OMP_CLAUSE_NUM_GANGS
:
16331 case OMP_CLAUSE_NUM_WORKERS
:
16332 case OMP_CLAUSE_VECTOR_LENGTH
:
16333 case OMP_CLAUSE_WORKER
:
16334 case OMP_CLAUSE_VECTOR
:
16335 case OMP_CLAUSE_ASYNC
:
16336 case OMP_CLAUSE_WAIT
:
16337 OMP_CLAUSE_OPERAND (nc
, 0)
16338 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
16339 in_decl
, /*integral_constant_expression_p=*/false);
16341 case OMP_CLAUSE_REDUCTION
:
16342 case OMP_CLAUSE_IN_REDUCTION
:
16343 case OMP_CLAUSE_TASK_REDUCTION
:
16344 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
16346 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
16347 if (TREE_CODE (placeholder
) == SCOPE_REF
)
16349 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
16350 complain
, in_decl
);
16351 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
16352 = build_qualified_name (NULL_TREE
, scope
,
16353 TREE_OPERAND (placeholder
, 1),
16357 gcc_assert (identifier_p (placeholder
));
16359 OMP_CLAUSE_DECL (nc
)
16360 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
16363 case OMP_CLAUSE_GANG
:
16364 case OMP_CLAUSE_ALIGNED
:
16365 OMP_CLAUSE_DECL (nc
)
16366 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
16368 OMP_CLAUSE_OPERAND (nc
, 1)
16369 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
16370 in_decl
, /*integral_constant_expression_p=*/false);
16372 case OMP_CLAUSE_LINEAR
:
16373 OMP_CLAUSE_DECL (nc
)
16374 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
16376 if (OMP_CLAUSE_LINEAR_STEP (oc
) == NULL_TREE
)
16378 gcc_assert (!linear_no_step
);
16379 linear_no_step
= nc
;
16381 else if (OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (oc
))
16382 OMP_CLAUSE_LINEAR_STEP (nc
)
16383 = tsubst_omp_clause_decl (OMP_CLAUSE_LINEAR_STEP (oc
), args
,
16384 complain
, in_decl
, NULL
);
16386 OMP_CLAUSE_LINEAR_STEP (nc
)
16387 = tsubst_expr (OMP_CLAUSE_LINEAR_STEP (oc
), args
, complain
,
16389 /*integral_constant_expression_p=*/false);
16391 case OMP_CLAUSE_NOWAIT
:
16392 case OMP_CLAUSE_DEFAULT
:
16393 case OMP_CLAUSE_UNTIED
:
16394 case OMP_CLAUSE_MERGEABLE
:
16395 case OMP_CLAUSE_INBRANCH
:
16396 case OMP_CLAUSE_NOTINBRANCH
:
16397 case OMP_CLAUSE_PROC_BIND
:
16398 case OMP_CLAUSE_FOR
:
16399 case OMP_CLAUSE_PARALLEL
:
16400 case OMP_CLAUSE_SECTIONS
:
16401 case OMP_CLAUSE_TASKGROUP
:
16402 case OMP_CLAUSE_NOGROUP
:
16403 case OMP_CLAUSE_THREADS
:
16404 case OMP_CLAUSE_SIMD
:
16405 case OMP_CLAUSE_DEFAULTMAP
:
16406 case OMP_CLAUSE_ORDER
:
16407 case OMP_CLAUSE_BIND
:
16408 case OMP_CLAUSE_INDEPENDENT
:
16409 case OMP_CLAUSE_AUTO
:
16410 case OMP_CLAUSE_SEQ
:
16411 case OMP_CLAUSE_IF_PRESENT
:
16412 case OMP_CLAUSE_FINALIZE
:
16415 gcc_unreachable ();
16417 if ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
)
16418 switch (OMP_CLAUSE_CODE (nc
))
16420 case OMP_CLAUSE_SHARED
:
16421 case OMP_CLAUSE_PRIVATE
:
16422 case OMP_CLAUSE_FIRSTPRIVATE
:
16423 case OMP_CLAUSE_LASTPRIVATE
:
16424 case OMP_CLAUSE_COPYPRIVATE
:
16425 case OMP_CLAUSE_LINEAR
:
16426 case OMP_CLAUSE_REDUCTION
:
16427 case OMP_CLAUSE_IN_REDUCTION
:
16428 case OMP_CLAUSE_TASK_REDUCTION
:
16429 case OMP_CLAUSE_USE_DEVICE_PTR
:
16430 case OMP_CLAUSE_IS_DEVICE_PTR
:
16431 case OMP_CLAUSE_INCLUSIVE
:
16432 case OMP_CLAUSE_EXCLUSIVE
:
16433 /* tsubst_expr on SCOPE_REF results in returning
16434 finish_non_static_data_member result. Undo that here. */
16435 if (TREE_CODE (OMP_CLAUSE_DECL (oc
)) == SCOPE_REF
16436 && (TREE_CODE (TREE_OPERAND (OMP_CLAUSE_DECL (oc
), 1))
16437 == IDENTIFIER_NODE
))
16439 tree t
= OMP_CLAUSE_DECL (nc
);
16442 switch (TREE_CODE (v
))
16444 case COMPONENT_REF
:
16448 case POINTER_PLUS_EXPR
:
16449 v
= TREE_OPERAND (v
, 0);
16452 if (DECL_CONTEXT (v
) == current_function_decl
16453 && DECL_ARTIFICIAL (v
)
16454 && DECL_NAME (v
) == this_identifier
)
16455 OMP_CLAUSE_DECL (nc
) = TREE_OPERAND (t
, 1);
16462 else if (VAR_P (OMP_CLAUSE_DECL (oc
))
16463 && DECL_HAS_VALUE_EXPR_P (OMP_CLAUSE_DECL (oc
))
16464 && DECL_ARTIFICIAL (OMP_CLAUSE_DECL (oc
))
16465 && DECL_LANG_SPECIFIC (OMP_CLAUSE_DECL (oc
))
16466 && DECL_OMP_PRIVATIZED_MEMBER (OMP_CLAUSE_DECL (oc
)))
16468 tree decl
= OMP_CLAUSE_DECL (nc
);
16471 retrofit_lang_decl (decl
);
16472 DECL_OMP_PRIVATIZED_MEMBER (decl
) = 1;
16481 new_clauses
= nreverse (new_clauses
);
16482 if (ort
!= C_ORT_OMP_DECLARE_SIMD
)
16484 new_clauses
= finish_omp_clauses (new_clauses
, ort
);
16485 if (linear_no_step
)
16486 for (nc
= new_clauses
; nc
; nc
= OMP_CLAUSE_CHAIN (nc
))
16487 if (nc
== linear_no_step
)
16489 OMP_CLAUSE_LINEAR_STEP (nc
) = NULL_TREE
;
16493 return new_clauses
;
16496 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
16499 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
16502 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
16504 tree purpose
, value
, chain
;
16509 if (TREE_CODE (t
) != TREE_LIST
)
16510 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
16511 /*function_p=*/false,
16512 /*integral_constant_expression_p=*/false);
16514 if (t
== void_list_node
)
16517 purpose
= TREE_PURPOSE (t
);
16519 purpose
= RECUR (purpose
);
16520 value
= TREE_VALUE (t
);
16523 if (TREE_CODE (value
) != LABEL_DECL
)
16524 value
= RECUR (value
);
16527 value
= lookup_label (DECL_NAME (value
));
16528 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
16529 TREE_USED (value
) = 1;
16532 chain
= TREE_CHAIN (t
);
16533 if (chain
&& chain
!= void_type_node
)
16534 chain
= RECUR (chain
);
16535 return tree_cons (purpose
, value
, chain
);
16539 /* Used to temporarily communicate the list of #pragma omp parallel
16540 clauses to #pragma omp for instantiation if they are combined
16543 static tree
*omp_parallel_combined_clauses
;
16545 static tree
tsubst_decomp_names (tree
, tree
, tree
, tsubst_flags_t
, tree
,
16546 tree
*, unsigned int *);
16548 /* Substitute one OMP_FOR iterator. */
16551 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree
&orig_declv
,
16552 tree initv
, tree condv
, tree incrv
, tree
*clauses
,
16553 tree args
, tsubst_flags_t complain
, tree in_decl
,
16554 bool integral_constant_expression_p
)
16556 #define RECUR(NODE) \
16557 tsubst_expr ((NODE), args, complain, in_decl, \
16558 integral_constant_expression_p)
16559 tree decl
, init
, cond
= NULL_TREE
, incr
= NULL_TREE
;
16562 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
16563 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
16565 decl
= TREE_OPERAND (init
, 0);
16566 init
= TREE_OPERAND (init
, 1);
16567 tree decl_expr
= NULL_TREE
;
16568 bool range_for
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
) == global_namespace
;
16571 bool decomp
= false;
16572 if (decl
!= error_mark_node
&& DECL_HAS_VALUE_EXPR_P (decl
))
16574 tree v
= DECL_VALUE_EXPR (decl
);
16575 if (TREE_CODE (v
) == ARRAY_REF
16576 && VAR_P (TREE_OPERAND (v
, 0))
16577 && DECL_DECOMPOSITION_P (TREE_OPERAND (v
, 0)))
16579 tree decomp_first
= NULL_TREE
;
16580 unsigned decomp_cnt
= 0;
16581 tree d
= tsubst_decl (TREE_OPERAND (v
, 0), args
, complain
);
16582 maybe_push_decl (d
);
16583 d
= tsubst_decomp_names (d
, TREE_OPERAND (v
, 0), args
, complain
,
16584 in_decl
, &decomp_first
, &decomp_cnt
);
16586 if (d
== error_mark_node
)
16587 decl
= error_mark_node
;
16589 for (unsigned int i
= 0; i
< decomp_cnt
; i
++)
16591 if (!DECL_HAS_VALUE_EXPR_P (decomp_first
))
16593 tree v
= build_nt (ARRAY_REF
, d
,
16594 size_int (decomp_cnt
- i
- 1),
16595 NULL_TREE
, NULL_TREE
);
16596 SET_DECL_VALUE_EXPR (decomp_first
, v
);
16597 DECL_HAS_VALUE_EXPR_P (decomp_first
) = 1;
16599 fit_decomposition_lang_decl (decomp_first
, d
);
16600 decomp_first
= DECL_CHAIN (decomp_first
);
16604 decl
= tsubst_decl (decl
, args
, complain
);
16606 maybe_push_decl (decl
);
16608 else if (init
&& TREE_CODE (init
) == DECL_EXPR
)
16610 /* We need to jump through some hoops to handle declarations in the
16611 init-statement, since we might need to handle auto deduction,
16612 but we need to keep control of initialization. */
16614 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
16615 decl
= tsubst_decl (decl
, args
, complain
);
16619 if (TREE_CODE (decl
) == SCOPE_REF
)
16621 decl
= RECUR (decl
);
16622 if (TREE_CODE (decl
) == COMPONENT_REF
)
16626 switch (TREE_CODE (v
))
16628 case COMPONENT_REF
:
16632 case POINTER_PLUS_EXPR
:
16633 v
= TREE_OPERAND (v
, 0);
16636 if (DECL_CONTEXT (v
) == current_function_decl
16637 && DECL_ARTIFICIAL (v
)
16638 && DECL_NAME (v
) == this_identifier
)
16640 decl
= TREE_OPERAND (decl
, 1);
16641 decl
= omp_privatize_field (decl
, false);
16651 decl
= RECUR (decl
);
16653 init
= RECUR (init
);
16655 if (orig_declv
&& OMP_FOR_ORIG_DECLS (t
))
16657 tree o
= TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (t
), i
);
16658 if (TREE_CODE (o
) == TREE_LIST
)
16659 TREE_VEC_ELT (orig_declv
, i
)
16660 = tree_cons (RECUR (TREE_PURPOSE (o
)),
16661 RECUR (TREE_VALUE (o
)),
16664 TREE_VEC_ELT (orig_declv
, i
) = RECUR (o
);
16669 tree this_pre_body
= NULL_TREE
;
16670 tree orig_init
= NULL_TREE
;
16671 tree orig_decl
= NULL_TREE
;
16672 cp_convert_omp_range_for (this_pre_body
, NULL
, decl
, orig_decl
, init
,
16673 orig_init
, cond
, incr
);
16676 if (orig_declv
== NULL_TREE
)
16677 orig_declv
= copy_node (declv
);
16678 TREE_VEC_ELT (orig_declv
, i
) = orig_decl
;
16681 else if (orig_declv
)
16682 TREE_VEC_ELT (orig_declv
, i
) = decl
;
16685 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
16686 if (!range_for
&& auto_node
&& init
)
16688 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
, complain
);
16690 gcc_assert (!type_dependent_expression_p (decl
));
16692 if (!CLASS_TYPE_P (TREE_TYPE (decl
)) || range_for
)
16696 /* Declare the variable, but don't let that initialize it. */
16697 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
16698 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
16700 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
16705 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
16706 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
16707 if (TREE_CODE (incr
) == MODIFY_EXPR
)
16709 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
16710 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
16711 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
16712 NOP_EXPR
, rhs
, complain
);
16715 incr
= RECUR (incr
);
16716 if (orig_declv
&& !OMP_FOR_ORIG_DECLS (t
))
16717 TREE_VEC_ELT (orig_declv
, i
) = decl
;
16719 TREE_VEC_ELT (declv
, i
) = decl
;
16720 TREE_VEC_ELT (initv
, i
) = init
;
16721 TREE_VEC_ELT (condv
, i
) = cond
;
16722 TREE_VEC_ELT (incrv
, i
) = incr
;
16728 /* Declare and initialize the variable. */
16736 for (j
= ((omp_parallel_combined_clauses
== NULL
16737 || TREE_CODE (t
) == OMP_LOOP
) ? 1 : 0); j
< 2; j
++)
16739 for (pc
= j
? clauses
: omp_parallel_combined_clauses
; *pc
; )
16741 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_PRIVATE
16742 && OMP_CLAUSE_DECL (*pc
) == decl
)
16744 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_LASTPRIVATE
16745 && OMP_CLAUSE_DECL (*pc
) == decl
)
16749 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
16751 *pc
= OMP_CLAUSE_CHAIN (c
);
16752 OMP_CLAUSE_CHAIN (c
) = *clauses
;
16755 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_FIRSTPRIVATE
16756 && OMP_CLAUSE_DECL (*pc
) == decl
)
16758 error ("iteration variable %qD should not be firstprivate",
16760 *pc
= OMP_CLAUSE_CHAIN (*pc
);
16762 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_REDUCTION
16763 && OMP_CLAUSE_DECL (*pc
) == decl
)
16765 error ("iteration variable %qD should not be reduction",
16767 *pc
= OMP_CLAUSE_CHAIN (*pc
);
16770 pc
= &OMP_CLAUSE_CHAIN (*pc
);
16775 if (*pc
== NULL_TREE
)
16777 tree c
= build_omp_clause (input_location
,
16778 TREE_CODE (t
) == OMP_LOOP
16779 ? OMP_CLAUSE_LASTPRIVATE
16780 : OMP_CLAUSE_PRIVATE
);
16781 OMP_CLAUSE_DECL (c
) = decl
;
16782 c
= finish_omp_clauses (c
, C_ORT_OMP
);
16785 OMP_CLAUSE_CHAIN (c
) = *clauses
;
16790 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
16791 if (COMPARISON_CLASS_P (cond
))
16793 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
16794 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
16795 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
16798 cond
= RECUR (cond
);
16799 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
16800 switch (TREE_CODE (incr
))
16802 case PREINCREMENT_EXPR
:
16803 case PREDECREMENT_EXPR
:
16804 case POSTINCREMENT_EXPR
:
16805 case POSTDECREMENT_EXPR
:
16806 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
16807 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
16810 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
16811 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
16813 tree rhs
= TREE_OPERAND (incr
, 1);
16814 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
16815 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
16816 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
16817 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
16818 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
16822 incr
= RECUR (incr
);
16825 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
16826 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
16828 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
16829 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
16830 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
16831 TREE_TYPE (decl
), lhs
,
16832 RECUR (TREE_OPERAND (incr
, 2))));
16834 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
16835 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
16836 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
16838 tree rhs
= TREE_OPERAND (incr
, 2);
16839 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
16840 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
16841 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
16842 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
16843 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
16847 incr
= RECUR (incr
);
16850 incr
= RECUR (incr
);
16854 if (orig_declv
&& !OMP_FOR_ORIG_DECLS (t
))
16855 TREE_VEC_ELT (orig_declv
, i
) = decl
;
16856 TREE_VEC_ELT (declv
, i
) = decl
;
16857 TREE_VEC_ELT (initv
, i
) = init
;
16858 TREE_VEC_ELT (condv
, i
) = cond
;
16859 TREE_VEC_ELT (incrv
, i
) = incr
;
16864 /* Helper function of tsubst_expr, find OMP_TEAMS inside
16865 of OMP_TARGET's body. */
16868 tsubst_find_omp_teams (tree
*tp
, int *walk_subtrees
, void *)
16870 *walk_subtrees
= 0;
16871 switch (TREE_CODE (*tp
))
16876 case STATEMENT_LIST
:
16877 *walk_subtrees
= 1;
16885 /* Helper function for tsubst_expr. For decomposition declaration
16886 artificial base DECL, which is tsubsted PATTERN_DECL, tsubst
16887 also the corresponding decls representing the identifiers
16888 of the decomposition declaration. Return DECL if successful
16889 or error_mark_node otherwise, set *FIRST to the first decl
16890 in the list chained through DECL_CHAIN and *CNT to the number
16894 tsubst_decomp_names (tree decl
, tree pattern_decl
, tree args
,
16895 tsubst_flags_t complain
, tree in_decl
, tree
*first
,
16898 tree decl2
, decl3
, prev
= decl
;
16900 gcc_assert (DECL_NAME (decl
) == NULL_TREE
);
16901 for (decl2
= DECL_CHAIN (pattern_decl
);
16904 && DECL_DECOMPOSITION_P (decl2
)
16905 && DECL_NAME (decl2
);
16906 decl2
= DECL_CHAIN (decl2
))
16908 if (TREE_TYPE (decl2
) == error_mark_node
&& *cnt
== 0)
16910 gcc_assert (errorcount
);
16911 return error_mark_node
;
16914 gcc_assert (DECL_DECOMP_BASE (decl2
) == pattern_decl
);
16915 gcc_assert (DECL_HAS_VALUE_EXPR_P (decl2
));
16916 tree v
= DECL_VALUE_EXPR (decl2
);
16917 DECL_HAS_VALUE_EXPR_P (decl2
) = 0;
16918 SET_DECL_VALUE_EXPR (decl2
, NULL_TREE
);
16919 decl3
= tsubst (decl2
, args
, complain
, in_decl
);
16920 SET_DECL_VALUE_EXPR (decl2
, v
);
16921 DECL_HAS_VALUE_EXPR_P (decl2
) = 1;
16923 DECL_TEMPLATE_INSTANTIATED (decl3
) = 1;
16926 gcc_assert (errorcount
);
16927 decl
= error_mark_node
;
16930 maybe_push_decl (decl3
);
16931 if (error_operand_p (decl3
))
16932 decl
= error_mark_node
;
16933 else if (decl
!= error_mark_node
16934 && DECL_CHAIN (decl3
) != prev
16937 gcc_assert (errorcount
);
16938 decl
= error_mark_node
;
16947 /* Return the proper local_specialization for init-capture pack DECL. */
16950 lookup_init_capture_pack (tree decl
)
16952 /* We handle normal pack captures by forwarding to the specialization of the
16953 captured parameter. We can't do that for pack init-captures; we need them
16954 to have their own local_specialization. We created the individual
16955 VAR_DECLs (if any) under build_capture_proxy, and we need to collect them
16956 when we process the DECL_EXPR for the pack init-capture in the template.
16957 So, how do we find them? We don't know the capture proxy pack when
16958 building the individual resulting proxies, and we don't know the
16959 individual proxies when instantiating the pack. What we have in common is
16962 So...when we instantiate the FIELD_DECL, we stick the result in
16963 local_specializations. Then at the DECL_EXPR we look up that result, see
16964 how many elements it has, synthesize the names, and look them up. */
16966 tree cname
= DECL_NAME (decl
);
16967 tree val
= DECL_VALUE_EXPR (decl
);
16968 tree field
= TREE_OPERAND (val
, 1);
16969 gcc_assert (TREE_CODE (field
) == FIELD_DECL
);
16970 tree fpack
= retrieve_local_specialization (field
);
16971 if (fpack
== error_mark_node
)
16972 return error_mark_node
;
16975 tree vec
= NULL_TREE
;
16976 tree r
= NULL_TREE
;
16977 if (TREE_CODE (fpack
) == TREE_VEC
)
16979 len
= TREE_VEC_LENGTH (fpack
);
16980 vec
= make_tree_vec (len
);
16981 r
= make_node (NONTYPE_ARGUMENT_PACK
);
16982 SET_ARGUMENT_PACK_ARGS (r
, vec
);
16984 for (int i
= 0; i
< len
; ++i
)
16986 tree ename
= vec
? make_ith_pack_parameter_name (cname
, i
) : cname
;
16987 tree elt
= lookup_name_real (ename
, 0, 0, true, 0, LOOKUP_NORMAL
);
16989 TREE_VEC_ELT (vec
, i
) = elt
;
16996 /* Like tsubst_copy for expressions, etc. but also does semantic
17000 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
17001 bool integral_constant_expression_p
)
17003 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
17004 #define RECUR(NODE) \
17005 tsubst_expr ((NODE), args, complain, in_decl, \
17006 integral_constant_expression_p)
17012 if (t
== NULL_TREE
|| t
== error_mark_node
)
17015 loc
= input_location
;
17016 if (location_t eloc
= cp_expr_location (t
))
17017 input_location
= eloc
;
17018 if (STATEMENT_CODE_P (TREE_CODE (t
)))
17019 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
17021 switch (TREE_CODE (t
))
17023 case STATEMENT_LIST
:
17025 tree_stmt_iterator i
;
17026 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
17027 RECUR (tsi_stmt (i
));
17031 case CTOR_INITIALIZER
:
17032 finish_mem_initializers (tsubst_initializer_list
17033 (TREE_OPERAND (t
, 0), args
));
17037 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
17041 tmp
= RECUR (EXPR_STMT_EXPR (t
));
17042 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
17043 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
17045 finish_expr_stmt (tmp
);
17049 finish_using_directive (USING_STMT_NAMESPACE (t
), /*attribs=*/NULL_TREE
);
17054 tree decl
, pattern_decl
;
17057 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
17058 if (TREE_CODE (decl
) == LABEL_DECL
)
17059 finish_label_decl (DECL_NAME (decl
));
17060 else if (TREE_CODE (decl
) == USING_DECL
)
17062 tree scope
= USING_DECL_SCOPE (decl
);
17063 tree name
= DECL_NAME (decl
);
17065 scope
= tsubst (scope
, args
, complain
, in_decl
);
17066 finish_nonmember_using_decl (scope
, name
);
17068 else if (is_capture_proxy (decl
)
17069 && !DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
17071 /* We're in tsubst_lambda_expr, we've already inserted a new
17072 capture proxy, so look it up and register it. */
17074 if (!DECL_PACK_P (decl
))
17076 inst
= lookup_name_real (DECL_NAME (decl
), /*prefer_type*/0,
17077 /*nonclass*/1, /*block_p=*/true,
17078 /*ns_only*/0, LOOKUP_HIDDEN
);
17079 gcc_assert (inst
!= decl
&& is_capture_proxy (inst
));
17081 else if (is_normal_capture_proxy (decl
))
17083 inst
= (retrieve_local_specialization
17084 (DECL_CAPTURED_VARIABLE (decl
)));
17085 gcc_assert (TREE_CODE (inst
) == NONTYPE_ARGUMENT_PACK
);
17088 inst
= lookup_init_capture_pack (decl
);
17090 register_local_specialization (inst
, decl
);
17093 else if (DECL_PRETTY_FUNCTION_P (decl
))
17094 decl
= make_fname_decl (DECL_SOURCE_LOCATION (decl
),
17096 true/*DECL_PRETTY_FUNCTION_P (decl)*/);
17097 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
17098 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
17099 /* Don't copy the old closure; we'll create a new one in
17100 tsubst_lambda_expr. */
17104 init
= DECL_INITIAL (decl
);
17105 decl
= tsubst (decl
, args
, complain
, in_decl
);
17106 if (decl
!= error_mark_node
)
17108 /* By marking the declaration as instantiated, we avoid
17109 trying to instantiate it. Since instantiate_decl can't
17110 handle local variables, and since we've already done
17111 all that needs to be done, that's the right thing to
17114 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
17115 if (VAR_P (decl
) && !DECL_NAME (decl
)
17116 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
17117 /* Anonymous aggregates are a special case. */
17118 finish_anon_union (decl
);
17119 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
17121 DECL_CONTEXT (decl
) = current_function_decl
;
17122 if (DECL_NAME (decl
) == this_identifier
)
17124 tree lam
= DECL_CONTEXT (current_function_decl
);
17125 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
17126 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
17128 insert_capture_proxy (decl
);
17130 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
17131 /* We already did a pushtag. */;
17132 else if (TREE_CODE (decl
) == FUNCTION_DECL
17133 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
17134 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
17136 DECL_CONTEXT (decl
) = NULL_TREE
;
17138 DECL_CONTEXT (decl
) = current_function_decl
;
17139 cp_check_omp_declare_reduction (decl
);
17143 int const_init
= false;
17144 unsigned int cnt
= 0;
17145 tree first
= NULL_TREE
, ndecl
= error_mark_node
;
17146 maybe_push_decl (decl
);
17149 && DECL_DECOMPOSITION_P (decl
)
17150 && TREE_TYPE (pattern_decl
) != error_mark_node
)
17151 ndecl
= tsubst_decomp_names (decl
, pattern_decl
, args
,
17152 complain
, in_decl
, &first
,
17155 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
17158 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
17161 if (ndecl
!= error_mark_node
)
17162 cp_maybe_mangle_decomp (ndecl
, first
, cnt
);
17164 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
17166 if (ndecl
!= error_mark_node
)
17167 cp_finish_decomp (ndecl
, first
, cnt
);
17176 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
17177 RECUR (FOR_INIT_STMT (t
));
17178 finish_init_stmt (stmt
);
17179 tmp
= RECUR (FOR_COND (t
));
17180 finish_for_cond (tmp
, stmt
, false, 0);
17181 tmp
= RECUR (FOR_EXPR (t
));
17182 finish_for_expr (tmp
, stmt
);
17184 bool prev
= note_iteration_stmt_body_start ();
17185 RECUR (FOR_BODY (t
));
17186 note_iteration_stmt_body_end (prev
);
17188 finish_for_stmt (stmt
);
17191 case RANGE_FOR_STMT
:
17193 /* Construct another range_for, if this is not a final
17194 substitution (for inside inside a generic lambda of a
17195 template). Otherwise convert to a regular for. */
17197 stmt
= (processing_template_decl
17198 ? begin_range_for_stmt (NULL_TREE
, NULL_TREE
)
17199 : begin_for_stmt (NULL_TREE
, NULL_TREE
));
17200 RECUR (RANGE_FOR_INIT_STMT (t
));
17201 decl
= RANGE_FOR_DECL (t
);
17202 decl
= tsubst (decl
, args
, complain
, in_decl
);
17203 maybe_push_decl (decl
);
17204 expr
= RECUR (RANGE_FOR_EXPR (t
));
17206 tree decomp_first
= NULL_TREE
;
17207 unsigned decomp_cnt
= 0;
17208 if (VAR_P (decl
) && DECL_DECOMPOSITION_P (decl
))
17209 decl
= tsubst_decomp_names (decl
, RANGE_FOR_DECL (t
), args
,
17211 &decomp_first
, &decomp_cnt
);
17213 if (processing_template_decl
)
17215 RANGE_FOR_IVDEP (stmt
) = RANGE_FOR_IVDEP (t
);
17216 RANGE_FOR_UNROLL (stmt
) = RANGE_FOR_UNROLL (t
);
17217 finish_range_for_decl (stmt
, decl
, expr
);
17218 if (decomp_first
&& decl
!= error_mark_node
)
17219 cp_finish_decomp (decl
, decomp_first
, decomp_cnt
);
17223 unsigned short unroll
= (RANGE_FOR_UNROLL (t
)
17224 ? tree_to_uhwi (RANGE_FOR_UNROLL (t
)) : 0);
17225 stmt
= cp_convert_range_for (stmt
, decl
, expr
,
17226 decomp_first
, decomp_cnt
,
17227 RANGE_FOR_IVDEP (t
), unroll
);
17230 bool prev
= note_iteration_stmt_body_start ();
17231 RECUR (RANGE_FOR_BODY (t
));
17232 note_iteration_stmt_body_end (prev
);
17233 finish_for_stmt (stmt
);
17238 stmt
= begin_while_stmt ();
17239 tmp
= RECUR (WHILE_COND (t
));
17240 finish_while_stmt_cond (tmp
, stmt
, false, 0);
17242 bool prev
= note_iteration_stmt_body_start ();
17243 RECUR (WHILE_BODY (t
));
17244 note_iteration_stmt_body_end (prev
);
17246 finish_while_stmt (stmt
);
17250 stmt
= begin_do_stmt ();
17252 bool prev
= note_iteration_stmt_body_start ();
17253 RECUR (DO_BODY (t
));
17254 note_iteration_stmt_body_end (prev
);
17256 finish_do_body (stmt
);
17257 tmp
= RECUR (DO_COND (t
));
17258 finish_do_stmt (tmp
, stmt
, false, 0);
17262 stmt
= begin_if_stmt ();
17263 IF_STMT_CONSTEXPR_P (stmt
) = IF_STMT_CONSTEXPR_P (t
);
17264 if (IF_STMT_CONSTEXPR_P (t
))
17265 args
= add_extra_args (IF_STMT_EXTRA_ARGS (t
), args
);
17266 tmp
= RECUR (IF_COND (t
));
17267 tmp
= finish_if_stmt_cond (tmp
, stmt
);
17268 if (IF_STMT_CONSTEXPR_P (t
)
17269 && instantiation_dependent_expression_p (tmp
))
17271 /* We're partially instantiating a generic lambda, but the condition
17272 of the constexpr if is still dependent. Don't substitute into the
17273 branches now, just remember the template arguments. */
17274 do_poplevel (IF_SCOPE (stmt
));
17275 IF_COND (stmt
) = IF_COND (t
);
17276 THEN_CLAUSE (stmt
) = THEN_CLAUSE (t
);
17277 ELSE_CLAUSE (stmt
) = ELSE_CLAUSE (t
);
17278 IF_STMT_EXTRA_ARGS (stmt
) = build_extra_args (t
, args
, complain
);
17282 if (IF_STMT_CONSTEXPR_P (t
) && integer_zerop (tmp
))
17283 /* Don't instantiate the THEN_CLAUSE. */;
17286 tree folded
= fold_non_dependent_expr (tmp
, complain
);
17287 bool inhibit
= integer_zerop (folded
);
17289 ++c_inhibit_evaluation_warnings
;
17290 RECUR (THEN_CLAUSE (t
));
17292 --c_inhibit_evaluation_warnings
;
17294 finish_then_clause (stmt
);
17296 if (IF_STMT_CONSTEXPR_P (t
) && integer_nonzerop (tmp
))
17297 /* Don't instantiate the ELSE_CLAUSE. */;
17298 else if (ELSE_CLAUSE (t
))
17300 tree folded
= fold_non_dependent_expr (tmp
, complain
);
17301 bool inhibit
= integer_nonzerop (folded
);
17302 begin_else_clause (stmt
);
17304 ++c_inhibit_evaluation_warnings
;
17305 RECUR (ELSE_CLAUSE (t
));
17307 --c_inhibit_evaluation_warnings
;
17308 finish_else_clause (stmt
);
17311 finish_if_stmt (stmt
);
17315 if (BIND_EXPR_BODY_BLOCK (t
))
17316 stmt
= begin_function_body ();
17318 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
17319 ? BCS_TRY_BLOCK
: 0);
17321 RECUR (BIND_EXPR_BODY (t
));
17323 if (BIND_EXPR_BODY_BLOCK (t
))
17324 finish_function_body (stmt
);
17326 finish_compound_stmt (stmt
);
17330 finish_break_stmt ();
17333 case CONTINUE_STMT
:
17334 finish_continue_stmt ();
17338 stmt
= begin_switch_stmt ();
17339 tmp
= RECUR (SWITCH_STMT_COND (t
));
17340 finish_switch_cond (tmp
, stmt
);
17341 RECUR (SWITCH_STMT_BODY (t
));
17342 finish_switch_stmt (stmt
);
17345 case CASE_LABEL_EXPR
:
17347 tree decl
= CASE_LABEL (t
);
17348 tree low
= RECUR (CASE_LOW (t
));
17349 tree high
= RECUR (CASE_HIGH (t
));
17350 tree l
= finish_case_label (EXPR_LOCATION (t
), low
, high
);
17351 if (l
&& TREE_CODE (l
) == CASE_LABEL_EXPR
)
17353 tree label
= CASE_LABEL (l
);
17354 FALLTHROUGH_LABEL_P (label
) = FALLTHROUGH_LABEL_P (decl
);
17355 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
17356 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
17363 tree decl
= LABEL_EXPR_LABEL (t
);
17366 label
= finish_label_stmt (DECL_NAME (decl
));
17367 if (TREE_CODE (label
) == LABEL_DECL
)
17368 FALLTHROUGH_LABEL_P (label
) = FALLTHROUGH_LABEL_P (decl
);
17369 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
17370 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
17375 tmp
= GOTO_DESTINATION (t
);
17376 if (TREE_CODE (tmp
) != LABEL_DECL
)
17377 /* Computed goto's must be tsubst'd into. On the other hand,
17378 non-computed gotos must not be; the identifier in question
17379 will have no binding. */
17382 tmp
= DECL_NAME (tmp
);
17383 finish_goto_stmt (tmp
);
17388 tree string
= RECUR (ASM_STRING (t
));
17389 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
17390 complain
, in_decl
);
17391 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
17392 complain
, in_decl
);
17393 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
17394 complain
, in_decl
);
17395 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
17396 complain
, in_decl
);
17397 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
17398 clobbers
, labels
, ASM_INLINE_P (t
));
17399 tree asm_expr
= tmp
;
17400 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
17401 asm_expr
= TREE_OPERAND (asm_expr
, 0);
17402 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
17409 stmt
= begin_try_block ();
17410 RECUR (TRY_STMTS (t
));
17411 finish_cleanup_try_block (stmt
);
17412 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
17416 tree compound_stmt
= NULL_TREE
;
17418 if (FN_TRY_BLOCK_P (t
))
17419 stmt
= begin_function_try_block (&compound_stmt
);
17421 stmt
= begin_try_block ();
17423 RECUR (TRY_STMTS (t
));
17425 if (FN_TRY_BLOCK_P (t
))
17426 finish_function_try_block (stmt
);
17428 finish_try_block (stmt
);
17430 RECUR (TRY_HANDLERS (t
));
17431 if (FN_TRY_BLOCK_P (t
))
17432 finish_function_handler_sequence (stmt
, compound_stmt
);
17434 finish_handler_sequence (stmt
);
17440 tree decl
= HANDLER_PARMS (t
);
17444 decl
= tsubst (decl
, args
, complain
, in_decl
);
17445 /* Prevent instantiate_decl from trying to instantiate
17446 this variable. We've already done all that needs to be
17448 if (decl
!= error_mark_node
)
17449 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
17451 stmt
= begin_handler ();
17452 finish_handler_parms (decl
, stmt
);
17453 RECUR (HANDLER_BODY (t
));
17454 finish_handler (stmt
);
17459 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
17460 if (CLASS_TYPE_P (tmp
))
17462 /* Local classes are not independent templates; they are
17463 instantiated along with their containing function. And this
17464 way we don't have to deal with pushing out of one local class
17465 to instantiate a member of another local class. */
17466 /* Closures are handled by the LAMBDA_EXPR. */
17467 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
17468 complete_type (tmp
);
17469 for (tree fld
= TYPE_FIELDS (tmp
); fld
; fld
= DECL_CHAIN (fld
))
17471 || (TREE_CODE (fld
) == FUNCTION_DECL
17472 && !DECL_ARTIFICIAL (fld
)))
17473 && DECL_TEMPLATE_INSTANTIATION (fld
))
17474 instantiate_decl (fld
, /*defer_ok=*/false,
17475 /*expl_inst_class=*/false);
17479 case STATIC_ASSERT
:
17483 ++c_inhibit_evaluation_warnings
;
17485 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
17488 /*integral_constant_expression_p=*/true);
17489 --c_inhibit_evaluation_warnings
;
17491 finish_static_assert (condition
,
17492 STATIC_ASSERT_MESSAGE (t
),
17493 STATIC_ASSERT_SOURCE_LOCATION (t
),
17494 /*member_p=*/false);
17499 case OACC_PARALLEL
:
17500 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), C_ORT_ACC
, args
, complain
,
17502 stmt
= begin_omp_parallel ();
17503 RECUR (OMP_BODY (t
));
17504 finish_omp_construct (TREE_CODE (t
), stmt
, tmp
);
17508 r
= push_omp_privatization_clauses (OMP_PARALLEL_COMBINED (t
));
17509 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), C_ORT_OMP
, args
,
17510 complain
, in_decl
);
17511 if (OMP_PARALLEL_COMBINED (t
))
17512 omp_parallel_combined_clauses
= &tmp
;
17513 stmt
= begin_omp_parallel ();
17514 RECUR (OMP_PARALLEL_BODY (t
));
17515 gcc_assert (omp_parallel_combined_clauses
== NULL
);
17516 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
17517 = OMP_PARALLEL_COMBINED (t
);
17518 pop_omp_privatization_clauses (r
);
17522 if (OMP_TASK_BODY (t
) == NULL_TREE
)
17524 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), C_ORT_OMP
, args
,
17525 complain
, in_decl
);
17527 OMP_TASK_CLAUSES (t
) = tmp
;
17531 r
= push_omp_privatization_clauses (false);
17532 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), C_ORT_OMP
, args
,
17533 complain
, in_decl
);
17534 stmt
= begin_omp_task ();
17535 RECUR (OMP_TASK_BODY (t
));
17536 finish_omp_task (tmp
, stmt
);
17537 pop_omp_privatization_clauses (r
);
17543 case OMP_DISTRIBUTE
:
17547 tree clauses
, body
, pre_body
;
17548 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
17549 tree orig_declv
= NULL_TREE
;
17550 tree incrv
= NULL_TREE
;
17551 enum c_omp_region_type ort
= C_ORT_OMP
;
17552 bool any_range_for
= false;
17555 if (TREE_CODE (t
) == OACC_LOOP
)
17558 r
= push_omp_privatization_clauses (OMP_FOR_INIT (t
) == NULL_TREE
);
17559 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), ort
, args
, complain
,
17561 if (OMP_FOR_INIT (t
) != NULL_TREE
)
17563 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
17564 if (OMP_FOR_ORIG_DECLS (t
))
17565 orig_declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
17566 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
17567 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
17568 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
17571 keep_next_level (true);
17572 stmt
= begin_omp_structured_block ();
17574 pre_body
= push_stmt_list ();
17575 RECUR (OMP_FOR_PRE_BODY (t
));
17576 pre_body
= pop_stmt_list (pre_body
);
17578 if (OMP_FOR_INIT (t
) != NULL_TREE
)
17579 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
17581 |= tsubst_omp_for_iterator (t
, i
, declv
, orig_declv
, initv
,
17582 condv
, incrv
, &clauses
, args
,
17584 integral_constant_expression_p
);
17585 omp_parallel_combined_clauses
= NULL
;
17589 gcc_assert (orig_declv
);
17590 body
= begin_omp_structured_block ();
17591 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
17592 if (TREE_VEC_ELT (orig_declv
, i
) != TREE_VEC_ELT (declv
, i
)
17593 && TREE_CODE (TREE_VEC_ELT (orig_declv
, i
)) == TREE_LIST
17594 && TREE_CHAIN (TREE_VEC_ELT (orig_declv
, i
)))
17595 cp_finish_omp_range_for (TREE_VEC_ELT (orig_declv
, i
),
17596 TREE_VEC_ELT (declv
, i
));
17599 body
= push_stmt_list ();
17600 RECUR (OMP_FOR_BODY (t
));
17602 body
= finish_omp_structured_block (body
);
17604 body
= pop_stmt_list (body
);
17606 if (OMP_FOR_INIT (t
) != NULL_TREE
)
17607 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
,
17608 orig_declv
, initv
, condv
, incrv
, body
, pre_body
,
17612 t
= make_node (TREE_CODE (t
));
17613 TREE_TYPE (t
) = void_type_node
;
17614 OMP_FOR_BODY (t
) = body
;
17615 OMP_FOR_PRE_BODY (t
) = pre_body
;
17616 OMP_FOR_CLAUSES (t
) = clauses
;
17617 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
17621 add_stmt (finish_omp_for_block (finish_omp_structured_block (stmt
),
17623 pop_omp_privatization_clauses (r
);
17628 omp_parallel_combined_clauses
= NULL
;
17633 case OMP_TASKGROUP
:
17635 r
= push_omp_privatization_clauses (TREE_CODE (t
) == OMP_TEAMS
17636 && OMP_TEAMS_COMBINED (t
));
17637 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), C_ORT_OMP
, args
, complain
,
17639 if (TREE_CODE (t
) == OMP_TEAMS
)
17641 keep_next_level (true);
17642 stmt
= begin_omp_structured_block ();
17643 RECUR (OMP_BODY (t
));
17644 stmt
= finish_omp_structured_block (stmt
);
17648 stmt
= push_stmt_list ();
17649 RECUR (OMP_BODY (t
));
17650 stmt
= pop_stmt_list (stmt
);
17654 OMP_BODY (t
) = stmt
;
17655 OMP_CLAUSES (t
) = tmp
;
17657 pop_omp_privatization_clauses (r
);
17661 r
= RECUR (OMP_DEPOBJ_DEPOBJ (t
));
17662 if (OMP_DEPOBJ_CLAUSES (t
) && OMP_DEPOBJ_CLAUSES (t
) != error_mark_node
)
17664 enum omp_clause_depend_kind kind
= OMP_CLAUSE_DEPEND_SOURCE
;
17665 if (TREE_CODE (OMP_DEPOBJ_CLAUSES (t
)) == OMP_CLAUSE
)
17667 tmp
= tsubst_omp_clauses (OMP_DEPOBJ_CLAUSES (t
), C_ORT_OMP
,
17668 args
, complain
, in_decl
);
17669 if (tmp
== NULL_TREE
)
17670 tmp
= error_mark_node
;
17674 kind
= (enum omp_clause_depend_kind
)
17675 tree_to_uhwi (OMP_DEPOBJ_CLAUSES (t
));
17678 finish_omp_depobj (EXPR_LOCATION (t
), r
, kind
, tmp
);
17681 finish_omp_depobj (EXPR_LOCATION (t
), r
,
17682 OMP_CLAUSE_DEPEND_SOURCE
,
17683 OMP_DEPOBJ_CLAUSES (t
));
17687 case OMP_TARGET_DATA
:
17689 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), (TREE_CODE (t
) == OACC_DATA
)
17690 ? C_ORT_ACC
: C_ORT_OMP
, args
, complain
,
17692 keep_next_level (true);
17693 stmt
= begin_omp_structured_block ();
17695 RECUR (OMP_BODY (t
));
17696 stmt
= finish_omp_structured_block (stmt
);
17699 OMP_BODY (t
) = stmt
;
17700 OMP_CLAUSES (t
) = tmp
;
17701 if (TREE_CODE (t
) == OMP_TARGET
&& OMP_TARGET_COMBINED (t
))
17703 tree teams
= cp_walk_tree (&stmt
, tsubst_find_omp_teams
, NULL
, NULL
);
17706 /* For combined target teams, ensure the num_teams and
17707 thread_limit clause expressions are evaluated on the host,
17708 before entering the target construct. */
17710 for (c
= OMP_TEAMS_CLAUSES (teams
);
17711 c
; c
= OMP_CLAUSE_CHAIN (c
))
17712 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_NUM_TEAMS
17713 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_THREAD_LIMIT
)
17714 && TREE_CODE (OMP_CLAUSE_OPERAND (c
, 0)) != INTEGER_CST
)
17716 tree expr
= OMP_CLAUSE_OPERAND (c
, 0);
17717 expr
= force_target_expr (TREE_TYPE (expr
), expr
, tf_none
);
17718 if (expr
== error_mark_node
)
17720 tmp
= TARGET_EXPR_SLOT (expr
);
17722 OMP_CLAUSE_OPERAND (c
, 0) = expr
;
17723 tree tc
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
17724 OMP_CLAUSE_FIRSTPRIVATE
);
17725 OMP_CLAUSE_DECL (tc
) = tmp
;
17726 OMP_CLAUSE_CHAIN (tc
) = OMP_TARGET_CLAUSES (t
);
17727 OMP_TARGET_CLAUSES (t
) = tc
;
17736 tmp
= tsubst_omp_clauses (OACC_DECLARE_CLAUSES (t
), C_ORT_ACC
, args
,
17737 complain
, in_decl
);
17738 OACC_DECLARE_CLAUSES (t
) = tmp
;
17742 case OMP_TARGET_UPDATE
:
17743 case OMP_TARGET_ENTER_DATA
:
17744 case OMP_TARGET_EXIT_DATA
:
17745 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), C_ORT_OMP
, args
,
17746 complain
, in_decl
);
17748 OMP_STANDALONE_CLAUSES (t
) = tmp
;
17752 case OACC_ENTER_DATA
:
17753 case OACC_EXIT_DATA
:
17755 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), C_ORT_ACC
, args
,
17756 complain
, in_decl
);
17758 OMP_STANDALONE_CLAUSES (t
) = tmp
;
17763 tmp
= tsubst_omp_clauses (OMP_ORDERED_CLAUSES (t
), C_ORT_OMP
, args
,
17764 complain
, in_decl
);
17765 stmt
= push_stmt_list ();
17766 RECUR (OMP_BODY (t
));
17767 stmt
= pop_stmt_list (stmt
);
17770 OMP_BODY (t
) = stmt
;
17771 OMP_ORDERED_CLAUSES (t
) = tmp
;
17777 stmt
= push_stmt_list ();
17778 RECUR (OMP_BODY (t
));
17779 stmt
= pop_stmt_list (stmt
);
17782 OMP_BODY (t
) = stmt
;
17787 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
17789 if (TREE_CODE (TREE_OPERAND (t
, 0)) == OMP_CLAUSE
)
17790 tmp
= tsubst_omp_clauses (TREE_OPERAND (t
, 0), C_ORT_OMP
, args
,
17791 complain
, in_decl
);
17792 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
17794 tree op1
= TREE_OPERAND (t
, 1);
17795 tree rhs1
= NULL_TREE
;
17797 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
17799 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
17800 op1
= TREE_OPERAND (op1
, 1);
17802 lhs
= RECUR (TREE_OPERAND (op1
, 0));
17803 rhs
= RECUR (TREE_OPERAND (op1
, 1));
17804 finish_omp_atomic (EXPR_LOCATION (t
), OMP_ATOMIC
, TREE_CODE (op1
),
17805 lhs
, rhs
, NULL_TREE
, NULL_TREE
, rhs1
, tmp
,
17806 OMP_ATOMIC_MEMORY_ORDER (t
));
17810 tree op1
= TREE_OPERAND (t
, 1);
17811 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
17812 tree rhs1
= NULL_TREE
;
17813 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
17814 enum tree_code opcode
= NOP_EXPR
;
17815 if (code
== OMP_ATOMIC_READ
)
17817 v
= RECUR (TREE_OPERAND (op1
, 0));
17818 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
17820 else if (code
== OMP_ATOMIC_CAPTURE_OLD
17821 || code
== OMP_ATOMIC_CAPTURE_NEW
)
17823 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
17824 v
= RECUR (TREE_OPERAND (op1
, 0));
17825 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
17826 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
17828 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
17829 op11
= TREE_OPERAND (op11
, 1);
17831 lhs
= RECUR (TREE_OPERAND (op11
, 0));
17832 rhs
= RECUR (TREE_OPERAND (op11
, 1));
17833 opcode
= TREE_CODE (op11
);
17834 if (opcode
== MODIFY_EXPR
)
17840 lhs
= RECUR (TREE_OPERAND (op1
, 0));
17841 rhs
= RECUR (TREE_OPERAND (op1
, 1));
17843 finish_omp_atomic (EXPR_LOCATION (t
), code
, opcode
, lhs
, rhs
, v
,
17844 lhs1
, rhs1
, tmp
, OMP_ATOMIC_MEMORY_ORDER (t
));
17848 case TRANSACTION_EXPR
:
17851 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
17852 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
17854 if (TRANSACTION_EXPR_IS_STMT (t
))
17856 tree body
= TRANSACTION_EXPR_BODY (t
);
17857 tree noex
= NULL_TREE
;
17858 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
17860 noex
= MUST_NOT_THROW_COND (body
);
17861 if (noex
== NULL_TREE
)
17862 noex
= boolean_true_node
;
17863 body
= TREE_OPERAND (body
, 0);
17865 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
17867 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
17871 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
17872 RECUR (TRANSACTION_EXPR_BODY (t
)),
17879 case MUST_NOT_THROW_EXPR
:
17881 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17882 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
17883 RETURN (build_must_not_throw_expr (op0
, cond
));
17886 case EXPR_PACK_EXPANSION
:
17887 error ("invalid use of pack expansion expression");
17888 RETURN (error_mark_node
);
17890 case NONTYPE_ARGUMENT_PACK
:
17891 error ("use %<...%> to expand argument pack");
17892 RETURN (error_mark_node
);
17894 case COMPOUND_EXPR
:
17895 tmp
= RECUR (TREE_OPERAND (t
, 0));
17896 if (tmp
== NULL_TREE
)
17897 /* If the first operand was a statement, we're done with it. */
17898 RETURN (RECUR (TREE_OPERAND (t
, 1)));
17899 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
17900 RECUR (TREE_OPERAND (t
, 1)),
17903 case ANNOTATE_EXPR
:
17904 tmp
= RECUR (TREE_OPERAND (t
, 0));
17905 RETURN (build3_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
17906 TREE_TYPE (tmp
), tmp
,
17907 RECUR (TREE_OPERAND (t
, 1)),
17908 RECUR (TREE_OPERAND (t
, 2))));
17911 RETURN (add_stmt (copy_node (t
)));
17914 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
17916 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
17917 /*function_p=*/false,
17918 integral_constant_expression_p
));
17921 RETURN (NULL_TREE
);
17923 input_location
= loc
;
17929 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
17930 function. For description of the body see comment above
17931 cp_parser_omp_declare_reduction_exprs. */
17934 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
17936 if (t
== NULL_TREE
|| t
== error_mark_node
)
17939 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
17941 tree_stmt_iterator tsi
;
17944 memset (stmts
, 0, sizeof stmts
);
17945 for (i
= 0, tsi
= tsi_start (t
);
17946 i
< 7 && !tsi_end_p (tsi
);
17947 i
++, tsi_next (&tsi
))
17948 stmts
[i
] = tsi_stmt (tsi
);
17949 gcc_assert (tsi_end_p (tsi
));
17953 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
17954 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
17955 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
17956 args
, complain
, in_decl
);
17957 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
17958 args
, complain
, in_decl
);
17959 DECL_CONTEXT (omp_out
) = current_function_decl
;
17960 DECL_CONTEXT (omp_in
) = current_function_decl
;
17961 keep_next_level (true);
17962 tree block
= begin_omp_structured_block ();
17963 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
17964 block
= finish_omp_structured_block (block
);
17965 block
= maybe_cleanup_point_expr_void (block
);
17966 add_decl_expr (omp_out
);
17967 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
17968 TREE_NO_WARNING (omp_out
) = 1;
17969 add_decl_expr (omp_in
);
17970 finish_expr_stmt (block
);
17974 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
17975 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
17976 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
17977 args
, complain
, in_decl
);
17978 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
17979 args
, complain
, in_decl
);
17980 DECL_CONTEXT (omp_priv
) = current_function_decl
;
17981 DECL_CONTEXT (omp_orig
) = current_function_decl
;
17982 keep_next_level (true);
17983 tree block
= begin_omp_structured_block ();
17984 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
17985 block
= finish_omp_structured_block (block
);
17986 block
= maybe_cleanup_point_expr_void (block
);
17987 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
17988 add_decl_expr (omp_priv
);
17989 add_decl_expr (omp_orig
);
17990 finish_expr_stmt (block
);
17992 add_decl_expr (omp_orig
);
17996 /* T is a postfix-expression that is not being used in a function
17997 call. Return the substituted version of T. */
18000 tsubst_non_call_postfix_expression (tree t
, tree args
,
18001 tsubst_flags_t complain
,
18004 if (TREE_CODE (t
) == SCOPE_REF
)
18005 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
18006 /*done=*/false, /*address_p=*/false);
18008 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
18009 /*function_p=*/false,
18010 /*integral_constant_expression_p=*/false);
18015 /* Subroutine of tsubst_lambda_expr: add the FIELD/INIT capture pair to the
18016 LAMBDA_EXPR_CAPTURE_LIST passed in LIST. Do deduction for a previously
18017 dependent init-capture. */
18020 prepend_one_capture (tree field
, tree init
, tree
&list
,
18021 tsubst_flags_t complain
)
18023 if (tree auto_node
= type_uses_auto (TREE_TYPE (field
)))
18025 tree type
= NULL_TREE
;
18028 if (complain
& tf_error
)
18029 error ("empty initializer in lambda init-capture");
18030 init
= error_mark_node
;
18032 else if (TREE_CODE (init
) == TREE_LIST
)
18033 init
= build_x_compound_expr_from_list (init
, ELK_INIT
, complain
);
18035 type
= do_auto_deduction (TREE_TYPE (field
), init
, auto_node
, complain
);
18036 TREE_TYPE (field
) = type
;
18037 cp_apply_type_quals_to_decl (cp_type_quals (type
), field
);
18039 list
= tree_cons (field
, init
, list
);
18042 /* T is a LAMBDA_EXPR. Generate a new LAMBDA_EXPR for the current
18043 instantiation context. Instantiating a pack expansion containing a lambda
18044 might result in multiple lambdas all based on the same lambda in the
18048 tsubst_lambda_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
18050 tree oldfn
= lambda_function (t
);
18053 tree r
= build_lambda_expr ();
18055 LAMBDA_EXPR_LOCATION (r
)
18056 = LAMBDA_EXPR_LOCATION (t
);
18057 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
18058 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
18059 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
18060 LAMBDA_EXPR_INSTANTIATED (r
) = true;
18062 if (LAMBDA_EXPR_EXTRA_SCOPE (t
) == NULL_TREE
)
18063 /* A lambda in a default argument outside a class gets no
18064 LAMBDA_EXPR_EXTRA_SCOPE, as specified by the ABI. But
18065 tsubst_default_argument calls start_lambda_scope, so we need to
18066 specifically ignore it here, and use the global scope. */
18067 record_null_lambda_scope (r
);
18069 record_lambda_scope (r
);
18071 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
18072 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
18074 vec
<tree
,va_gc
>* field_packs
= NULL
;
18076 for (tree cap
= LAMBDA_EXPR_CAPTURE_LIST (t
); cap
;
18077 cap
= TREE_CHAIN (cap
))
18079 tree ofield
= TREE_PURPOSE (cap
);
18080 if (PACK_EXPANSION_P (ofield
))
18081 ofield
= PACK_EXPANSION_PATTERN (ofield
);
18082 tree field
= tsubst_decl (ofield
, args
, complain
);
18084 if (DECL_PACK_P (ofield
) && !DECL_NORMAL_CAPTURE_P (ofield
))
18086 /* Remember these for when we've pushed local_specializations. */
18087 vec_safe_push (field_packs
, ofield
);
18088 vec_safe_push (field_packs
, field
);
18091 if (field
== error_mark_node
)
18092 return error_mark_node
;
18094 tree init
= TREE_VALUE (cap
);
18095 if (PACK_EXPANSION_P (init
))
18096 init
= tsubst_pack_expansion (init
, args
, complain
, in_decl
);
18098 init
= tsubst_copy_and_build (init
, args
, complain
, in_decl
,
18099 /*fn*/false, /*constexpr*/false);
18101 if (TREE_CODE (field
) == TREE_VEC
)
18103 int len
= TREE_VEC_LENGTH (field
);
18104 gcc_assert (TREE_CODE (init
) == TREE_VEC
18105 && TREE_VEC_LENGTH (init
) == len
);
18106 for (int i
= 0; i
< len
; ++i
)
18107 prepend_one_capture (TREE_VEC_ELT (field
, i
),
18108 TREE_VEC_ELT (init
, i
),
18109 LAMBDA_EXPR_CAPTURE_LIST (r
),
18114 prepend_one_capture (field
, init
, LAMBDA_EXPR_CAPTURE_LIST (r
),
18117 if (id_equal (DECL_NAME (field
), "__this"))
18118 LAMBDA_EXPR_THIS_CAPTURE (r
) = field
;
18122 tree type
= begin_lambda_type (r
);
18123 if (type
== error_mark_node
)
18124 return error_mark_node
;
18126 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
18127 determine_visibility (TYPE_NAME (type
));
18129 register_capture_members (LAMBDA_EXPR_CAPTURE_LIST (r
));
18131 tree oldtmpl
= (generic_lambda_fn_p (oldfn
)
18132 ? DECL_TI_TEMPLATE (oldfn
)
18135 tree fntype
= static_fn_type (oldfn
);
18137 ++processing_template_decl
;
18138 fntype
= tsubst (fntype
, args
, complain
, in_decl
);
18140 --processing_template_decl
;
18142 if (fntype
== error_mark_node
)
18143 r
= error_mark_node
;
18146 /* The body of a lambda-expression is not a subexpression of the
18147 enclosing expression. Parms are to have DECL_CHAIN tsubsted,
18148 which would be skipped if cp_unevaluated_operand. */
18151 /* Fix the type of 'this'. */
18152 fntype
= build_memfn_type (fntype
, type
,
18153 type_memfn_quals (fntype
),
18154 type_memfn_rqual (fntype
));
18158 tmpl
= tsubst_template_decl (oldtmpl
, args
, complain
, fntype
);
18159 fn
= DECL_TEMPLATE_RESULT (tmpl
);
18160 finish_member_declaration (tmpl
);
18165 fn
= tsubst_function_decl (oldfn
, args
, complain
, fntype
);
18166 finish_member_declaration (fn
);
18169 /* Let finish_function set this. */
18170 DECL_DECLARED_CONSTEXPR_P (fn
) = false;
18172 bool nested
= cfun
;
18174 push_function_context ();
18176 /* Still increment function_depth so that we don't GC in the
18177 middle of an expression. */
18180 local_specialization_stack
s (lss_copy
);
18182 tree body
= start_lambda_function (fn
, r
);
18184 /* Now record them for lookup_init_capture_pack. */
18185 int fplen
= vec_safe_length (field_packs
);
18186 for (int i
= 0; i
< fplen
; )
18188 tree pack
= (*field_packs
)[i
++];
18189 tree inst
= (*field_packs
)[i
++];
18190 register_local_specialization (inst
, pack
);
18192 release_tree_vector (field_packs
);
18194 register_parameter_specializations (oldfn
, fn
);
18198 /* We might not partially instantiate some parts of the function, so
18199 copy these flags from the original template. */
18200 language_function
*ol
= DECL_STRUCT_FUNCTION (oldfn
)->language
;
18201 current_function_returns_value
= ol
->returns_value
;
18202 current_function_returns_null
= ol
->returns_null
;
18203 current_function_returns_abnormally
= ol
->returns_abnormally
;
18204 current_function_infinite_loop
= ol
->infinite_loop
;
18207 /* [temp.deduct] A lambda-expression appearing in a function type or a
18208 template parameter is not considered part of the immediate context for
18209 the purposes of template argument deduction. */
18210 complain
= tf_warning_or_error
;
18212 tsubst_expr (DECL_SAVED_TREE (oldfn
), args
, complain
, r
,
18213 /*constexpr*/false);
18215 finish_lambda_function (body
);
18218 pop_function_context ();
18222 /* The capture list was built up in reverse order; fix that now. */
18223 LAMBDA_EXPR_CAPTURE_LIST (r
)
18224 = nreverse (LAMBDA_EXPR_CAPTURE_LIST (r
));
18226 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
18228 maybe_add_lambda_conv_op (type
);
18231 finish_struct (type
, /*attr*/NULL_TREE
);
18233 insert_pending_capture_proxies ();
18238 /* Like tsubst but deals with expressions and performs semantic
18239 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
18242 tsubst_copy_and_build (tree t
,
18244 tsubst_flags_t complain
,
18247 bool integral_constant_expression_p
)
18249 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
18250 #define RECUR(NODE) \
18251 tsubst_copy_and_build (NODE, args, complain, in_decl, \
18252 /*function_p=*/false, \
18253 integral_constant_expression_p)
18258 if (t
== NULL_TREE
|| t
== error_mark_node
)
18261 loc
= input_location
;
18262 if (location_t eloc
= cp_expr_location (t
))
18263 input_location
= eloc
;
18265 /* N3276 decltype magic only applies to calls at the top level or on the
18266 right side of a comma. */
18267 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
18268 complain
&= ~tf_decltype
;
18270 switch (TREE_CODE (t
))
18274 /* Fall through. */
18275 case IDENTIFIER_NODE
:
18279 bool non_integral_constant_expression_p
;
18280 const char *error_msg
;
18282 if (IDENTIFIER_CONV_OP_P (t
))
18284 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
18285 t
= make_conv_op_name (new_type
);
18288 /* Look up the name. */
18289 decl
= lookup_name (t
);
18291 /* By convention, expressions use ERROR_MARK_NODE to indicate
18292 failure, not NULL_TREE. */
18293 if (decl
== NULL_TREE
)
18294 decl
= error_mark_node
;
18296 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
18298 integral_constant_expression_p
,
18299 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
18300 &non_integral_constant_expression_p
,
18301 /*template_p=*/false,
18303 /*address_p=*/false,
18304 /*template_arg_p=*/false,
18309 if (!function_p
&& identifier_p (decl
))
18311 if (complain
& tf_error
)
18312 unqualified_name_lookup_error (decl
);
18313 decl
= error_mark_node
;
18318 case TEMPLATE_ID_EXPR
:
18321 tree templ
= RECUR (TREE_OPERAND (t
, 0));
18322 tree targs
= TREE_OPERAND (t
, 1);
18325 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
18326 if (targs
== error_mark_node
)
18327 RETURN (error_mark_node
);
18329 if (TREE_CODE (templ
) == SCOPE_REF
)
18331 tree name
= TREE_OPERAND (templ
, 1);
18332 tree tid
= lookup_template_function (name
, targs
);
18333 TREE_OPERAND (templ
, 1) = tid
;
18337 if (variable_template_p (templ
))
18338 RETURN (lookup_and_finish_template_variable (templ
, targs
, complain
));
18340 if (TREE_CODE (templ
) == COMPONENT_REF
)
18342 object
= TREE_OPERAND (templ
, 0);
18343 templ
= TREE_OPERAND (templ
, 1);
18346 object
= NULL_TREE
;
18347 templ
= lookup_template_function (templ
, targs
);
18350 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
18351 object
, templ
, NULL_TREE
));
18353 RETURN (baselink_for_fns (templ
));
18358 tree r
= RECUR (TREE_OPERAND (t
, 0));
18360 if (REFERENCE_REF_P (t
))
18362 /* A type conversion to reference type will be enclosed in
18363 such an indirect ref, but the substitution of the cast
18364 will have also added such an indirect ref. */
18365 r
= convert_from_reference (r
);
18368 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
18369 complain
|decltype_flag
);
18371 if (REF_PARENTHESIZED_P (t
))
18372 r
= force_paren_expr (r
);
18379 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
18380 tree op0
= RECUR (TREE_OPERAND (t
, 0));
18381 RETURN (build_nop (type
, op0
));
18384 case IMPLICIT_CONV_EXPR
:
18386 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
18387 tree expr
= RECUR (TREE_OPERAND (t
, 0));
18388 if (dependent_type_p (type
) || type_dependent_expression_p (expr
))
18390 retval
= copy_node (t
);
18391 TREE_TYPE (retval
) = type
;
18392 TREE_OPERAND (retval
, 0) = expr
;
18395 if (IMPLICIT_CONV_EXPR_NONTYPE_ARG (t
))
18396 /* We'll pass this to convert_nontype_argument again, we don't need
18397 to actually perform any conversion here. */
18399 int flags
= LOOKUP_IMPLICIT
;
18400 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
18401 flags
= LOOKUP_NORMAL
;
18402 if (IMPLICIT_CONV_EXPR_BRACED_INIT (t
))
18403 flags
|= LOOKUP_NO_NARROWING
;
18404 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
18410 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
18411 tree op0
= RECUR (TREE_OPERAND (t
, 0));
18412 if (op0
== error_mark_node
)
18413 RETURN (error_mark_node
);
18414 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
18418 case REINTERPRET_CAST_EXPR
:
18419 case CONST_CAST_EXPR
:
18420 case DYNAMIC_CAST_EXPR
:
18421 case STATIC_CAST_EXPR
:
18424 tree op
, r
= NULL_TREE
;
18426 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
18427 if (integral_constant_expression_p
18428 && !cast_valid_in_integral_constant_expression_p (type
))
18430 if (complain
& tf_error
)
18431 error ("a cast to a type other than an integral or "
18432 "enumeration type cannot appear in a constant-expression");
18433 RETURN (error_mark_node
);
18436 op
= RECUR (TREE_OPERAND (t
, 0));
18438 warning_sentinel
s(warn_useless_cast
);
18439 warning_sentinel
s2(warn_ignored_qualifiers
);
18440 switch (TREE_CODE (t
))
18443 r
= build_functional_cast (type
, op
, complain
);
18445 case REINTERPRET_CAST_EXPR
:
18446 r
= build_reinterpret_cast (type
, op
, complain
);
18448 case CONST_CAST_EXPR
:
18449 r
= build_const_cast (type
, op
, complain
);
18451 case DYNAMIC_CAST_EXPR
:
18452 r
= build_dynamic_cast (type
, op
, complain
);
18454 case STATIC_CAST_EXPR
:
18455 r
= build_static_cast (type
, op
, complain
);
18458 gcc_unreachable ();
18464 case POSTDECREMENT_EXPR
:
18465 case POSTINCREMENT_EXPR
:
18466 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
18467 args
, complain
, in_decl
);
18468 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
18469 complain
|decltype_flag
));
18471 case PREDECREMENT_EXPR
:
18472 case PREINCREMENT_EXPR
:
18476 case TRUTH_NOT_EXPR
:
18477 case UNARY_PLUS_EXPR
: /* Unary + */
18478 case REALPART_EXPR
:
18479 case IMAGPART_EXPR
:
18480 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
18481 RECUR (TREE_OPERAND (t
, 0)),
18482 complain
|decltype_flag
));
18484 case FIX_TRUNC_EXPR
:
18485 gcc_unreachable ();
18488 op1
= TREE_OPERAND (t
, 0);
18489 if (TREE_CODE (op1
) == LABEL_DECL
)
18490 RETURN (finish_label_address_expr (DECL_NAME (op1
),
18491 EXPR_LOCATION (op1
)));
18492 if (TREE_CODE (op1
) == SCOPE_REF
)
18493 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
18494 /*done=*/true, /*address_p=*/true);
18496 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
18498 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
18499 complain
|decltype_flag
));
18504 case TRUNC_DIV_EXPR
:
18505 case CEIL_DIV_EXPR
:
18506 case FLOOR_DIV_EXPR
:
18507 case ROUND_DIV_EXPR
:
18508 case EXACT_DIV_EXPR
:
18512 case TRUNC_MOD_EXPR
:
18513 case FLOOR_MOD_EXPR
:
18514 case TRUTH_ANDIF_EXPR
:
18515 case TRUTH_ORIF_EXPR
:
18516 case TRUTH_AND_EXPR
:
18517 case TRUTH_OR_EXPR
:
18533 warning_sentinel
s1(warn_type_limits
);
18534 warning_sentinel
s2(warn_div_by_zero
);
18535 warning_sentinel
s3(warn_logical_op
);
18536 warning_sentinel
s4(warn_tautological_compare
);
18537 tree op0
= RECUR (TREE_OPERAND (t
, 0));
18538 tree op1
= RECUR (TREE_OPERAND (t
, 1));
18539 tree r
= build_x_binary_op
18540 (input_location
, TREE_CODE (t
),
18542 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
18544 : TREE_CODE (TREE_OPERAND (t
, 0))),
18546 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
18548 : TREE_CODE (TREE_OPERAND (t
, 1))),
18550 complain
|decltype_flag
);
18551 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
18552 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
18557 case POINTER_PLUS_EXPR
:
18559 tree op0
= RECUR (TREE_OPERAND (t
, 0));
18560 tree op1
= RECUR (TREE_OPERAND (t
, 1));
18561 RETURN (fold_build_pointer_plus (op0
, op1
));
18565 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
18566 /*address_p=*/false));
18568 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
18569 args
, complain
, in_decl
);
18570 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
18571 RECUR (TREE_OPERAND (t
, 1)),
18572 complain
|decltype_flag
));
18575 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0))
18576 || ARGUMENT_PACK_P (TREE_OPERAND (t
, 0)))
18577 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
18584 op1
= TREE_OPERAND (t
, 0);
18585 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
18586 op1
= TREE_TYPE (op1
);
18587 bool std_alignof
= (TREE_CODE (t
) == ALIGNOF_EXPR
18588 && ALIGNOF_EXPR_STD_P (t
));
18591 /* When there are no ARGS, we are trying to evaluate a
18592 non-dependent expression from the parser. Trying to do
18593 the substitutions may not work. */
18595 op1
= TREE_TYPE (op1
);
18599 ++cp_unevaluated_operand
;
18600 ++c_inhibit_evaluation_warnings
;
18602 op1
= tsubst (op1
, args
, complain
, in_decl
);
18604 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
18605 /*function_p=*/false,
18606 /*integral_constant_expression_p=*/
18608 --cp_unevaluated_operand
;
18609 --c_inhibit_evaluation_warnings
;
18612 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
), std_alignof
,
18613 complain
& tf_error
);
18615 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
18616 complain
& tf_error
);
18617 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
18619 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
18621 if (!processing_template_decl
&& TYPE_P (op1
))
18623 r
= build_min (SIZEOF_EXPR
, size_type_node
,
18624 build1 (NOP_EXPR
, op1
, error_mark_node
));
18625 SIZEOF_EXPR_TYPE_P (r
) = 1;
18628 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
18629 TREE_SIDE_EFFECTS (r
) = 0;
18630 TREE_READONLY (r
) = 1;
18632 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
18637 case AT_ENCODE_EXPR
:
18639 op1
= TREE_OPERAND (t
, 0);
18640 ++cp_unevaluated_operand
;
18641 ++c_inhibit_evaluation_warnings
;
18642 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
18643 /*function_p=*/false,
18644 /*integral_constant_expression_p=*/false);
18645 --cp_unevaluated_operand
;
18646 --c_inhibit_evaluation_warnings
;
18647 RETURN (objc_build_encode_expr (op1
));
18650 case NOEXCEPT_EXPR
:
18651 op1
= TREE_OPERAND (t
, 0);
18652 ++cp_unevaluated_operand
;
18653 ++c_inhibit_evaluation_warnings
;
18654 ++cp_noexcept_operand
;
18655 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
18656 /*function_p=*/false,
18657 /*integral_constant_expression_p=*/false);
18658 --cp_unevaluated_operand
;
18659 --c_inhibit_evaluation_warnings
;
18660 --cp_noexcept_operand
;
18661 RETURN (finish_noexcept_expr (op1
, complain
));
18665 warning_sentinel
s(warn_div_by_zero
);
18666 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
18667 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
18668 tree r
= build_x_modify_expr
18669 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
18670 complain
|decltype_flag
);
18671 /* TREE_NO_WARNING must be set if either the expression was
18672 parenthesized or it uses an operator such as >>= rather
18673 than plain assignment. In the former case, it was already
18674 set and must be copied. In the latter case,
18675 build_x_modify_expr sets it and it must not be reset
18677 if (TREE_NO_WARNING (t
))
18678 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
18684 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
18685 args
, complain
, in_decl
);
18686 /* Remember that there was a reference to this entity. */
18688 && !mark_used (op1
, complain
) && !(complain
& tf_error
))
18689 RETURN (error_mark_node
);
18690 RETURN (build_x_arrow (input_location
, op1
, complain
));
18694 tree placement
= RECUR (TREE_OPERAND (t
, 0));
18695 tree init
= RECUR (TREE_OPERAND (t
, 3));
18696 vec
<tree
, va_gc
> *placement_vec
;
18697 vec
<tree
, va_gc
> *init_vec
;
18700 if (placement
== NULL_TREE
)
18701 placement_vec
= NULL
;
18704 placement_vec
= make_tree_vector ();
18705 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
18706 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
18709 /* If there was an initializer in the original tree, but it
18710 instantiated to an empty list, then we should pass a
18711 non-NULL empty vector to tell build_new that it was an
18712 empty initializer() rather than no initializer. This can
18713 only happen when the initializer is a pack expansion whose
18714 parameter packs are of length zero. */
18715 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
18719 init_vec
= make_tree_vector ();
18720 if (init
== void_node
)
18721 gcc_assert (init_vec
!= NULL
);
18724 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
18725 vec_safe_push (init_vec
, TREE_VALUE (init
));
18729 /* Avoid passing an enclosing decl to valid_array_size_p. */
18730 in_decl
= NULL_TREE
;
18732 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
18733 tree op2
= RECUR (TREE_OPERAND (t
, 2));
18734 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
18735 NEW_EXPR_USE_GLOBAL (t
),
18738 if (placement_vec
!= NULL
)
18739 release_tree_vector (placement_vec
);
18740 if (init_vec
!= NULL
)
18741 release_tree_vector (init_vec
);
18748 tree op0
= RECUR (TREE_OPERAND (t
, 0));
18749 tree op1
= RECUR (TREE_OPERAND (t
, 1));
18750 RETURN (delete_sanity (op0
, op1
,
18751 DELETE_EXPR_USE_VEC (t
),
18752 DELETE_EXPR_USE_GLOBAL (t
),
18756 case COMPOUND_EXPR
:
18758 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
18759 complain
& ~tf_decltype
, in_decl
,
18760 /*function_p=*/false,
18761 integral_constant_expression_p
);
18762 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
18764 RECUR (TREE_OPERAND (t
, 1)),
18765 complain
|decltype_flag
));
18771 unsigned int nargs
, i
;
18776 function
= CALL_EXPR_FN (t
);
18777 /* Internal function with no arguments. */
18778 if (function
== NULL_TREE
&& call_expr_nargs (t
) == 0)
18781 /* When we parsed the expression, we determined whether or
18782 not Koenig lookup should be performed. */
18783 koenig_p
= KOENIG_LOOKUP_P (t
);
18784 if (function
== NULL_TREE
)
18787 qualified_p
= false;
18789 else if (TREE_CODE (function
) == SCOPE_REF
)
18791 qualified_p
= true;
18792 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
18794 /*address_p=*/false);
18796 else if (koenig_p
&& identifier_p (function
))
18798 /* Do nothing; calling tsubst_copy_and_build on an identifier
18799 would incorrectly perform unqualified lookup again.
18801 Note that we can also have an IDENTIFIER_NODE if the earlier
18802 unqualified lookup found a member function; in that case
18803 koenig_p will be false and we do want to do the lookup
18804 again to find the instantiated member function.
18806 FIXME but doing that causes c++/15272, so we need to stop
18807 using IDENTIFIER_NODE in that situation. */
18808 qualified_p
= false;
18812 if (TREE_CODE (function
) == COMPONENT_REF
)
18814 tree op
= TREE_OPERAND (function
, 1);
18816 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
18817 || (BASELINK_P (op
)
18818 && BASELINK_QUALIFIED_P (op
)));
18821 qualified_p
= false;
18823 if (TREE_CODE (function
) == ADDR_EXPR
18824 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
18825 /* Avoid error about taking the address of a constructor. */
18826 function
= TREE_OPERAND (function
, 0);
18828 function
= tsubst_copy_and_build (function
, args
, complain
,
18831 integral_constant_expression_p
);
18833 if (BASELINK_P (function
))
18834 qualified_p
= true;
18837 nargs
= call_expr_nargs (t
);
18838 releasing_vec call_args
;
18839 for (i
= 0; i
< nargs
; ++i
)
18841 tree arg
= CALL_EXPR_ARG (t
, i
);
18843 if (!PACK_EXPANSION_P (arg
))
18844 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
18847 /* Expand the pack expansion and push each entry onto
18849 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
18850 if (TREE_CODE (arg
) == TREE_VEC
)
18852 unsigned int len
, j
;
18854 len
= TREE_VEC_LENGTH (arg
);
18855 for (j
= 0; j
< len
; ++j
)
18857 tree value
= TREE_VEC_ELT (arg
, j
);
18858 if (value
!= NULL_TREE
)
18859 value
= convert_from_reference (value
);
18860 vec_safe_push (call_args
, value
);
18865 /* A partial substitution. Add one entry. */
18866 vec_safe_push (call_args
, arg
);
18871 /* Stripped-down processing for a call in a thunk. Specifically, in
18872 the thunk template for a generic lambda. */
18873 if (CALL_FROM_THUNK_P (t
))
18875 /* Now that we've expanded any packs, the number of call args
18876 might be different. */
18877 unsigned int cargs
= call_args
->length ();
18878 tree thisarg
= NULL_TREE
;
18879 if (TREE_CODE (function
) == COMPONENT_REF
)
18881 thisarg
= TREE_OPERAND (function
, 0);
18882 if (TREE_CODE (thisarg
) == INDIRECT_REF
)
18883 thisarg
= TREE_OPERAND (thisarg
, 0);
18884 function
= TREE_OPERAND (function
, 1);
18885 if (TREE_CODE (function
) == BASELINK
)
18886 function
= BASELINK_FUNCTIONS (function
);
18888 /* We aren't going to do normal overload resolution, so force the
18889 template-id to resolve. */
18890 function
= resolve_nondeduced_context (function
, complain
);
18891 for (unsigned i
= 0; i
< cargs
; ++i
)
18893 /* In a thunk, pass through args directly, without any
18895 tree arg
= (*call_args
)[i
];
18896 while (TREE_CODE (arg
) != PARM_DECL
)
18897 arg
= TREE_OPERAND (arg
, 0);
18898 (*call_args
)[i
] = arg
;
18902 /* If there are no other args, just push 'this'. */
18904 vec_safe_push (call_args
, thisarg
);
18907 /* Otherwise, shift the other args over to make room. */
18908 tree last
= (*call_args
)[cargs
- 1];
18909 vec_safe_push (call_args
, last
);
18910 for (int i
= cargs
- 1; i
> 0; --i
)
18911 (*call_args
)[i
] = (*call_args
)[i
- 1];
18912 (*call_args
)[0] = thisarg
;
18915 ret
= build_call_a (function
, call_args
->length (),
18916 call_args
->address ());
18917 /* The thunk location is not interesting. */
18918 SET_EXPR_LOCATION (ret
, UNKNOWN_LOCATION
);
18919 CALL_FROM_THUNK_P (ret
) = true;
18920 if (CLASS_TYPE_P (TREE_TYPE (ret
)))
18921 CALL_EXPR_RETURN_SLOT_OPT (ret
) = true;
18926 /* We do not perform argument-dependent lookup if normal
18927 lookup finds a non-function, in accordance with the
18928 expected resolution of DR 218. */
18930 && ((is_overloaded_fn (function
)
18931 /* If lookup found a member function, the Koenig lookup is
18932 not appropriate, even if an unqualified-name was used
18933 to denote the function. */
18934 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
18935 || identifier_p (function
))
18936 /* Only do this when substitution turns a dependent call
18937 into a non-dependent call. */
18938 && type_dependent_expression_p_push (t
)
18939 && !any_type_dependent_arguments_p (call_args
))
18940 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
18942 if (function
!= NULL_TREE
18943 && identifier_p (function
)
18944 && !any_type_dependent_arguments_p (call_args
))
18946 if (koenig_p
&& (complain
& tf_warning_or_error
))
18948 /* For backwards compatibility and good diagnostics, try
18949 the unqualified lookup again if we aren't in SFINAE
18951 tree unq
= (tsubst_copy_and_build
18952 (function
, args
, complain
, in_decl
, true,
18953 integral_constant_expression_p
));
18954 if (unq
== error_mark_node
)
18955 RETURN (error_mark_node
);
18957 if (unq
!= function
)
18959 /* In a lambda fn, we have to be careful to not
18960 introduce new this captures. Legacy code can't
18961 be using lambdas anyway, so it's ok to be
18963 bool in_lambda
= (current_class_type
18964 && LAMBDA_TYPE_P (current_class_type
));
18965 char const *const msg
18966 = G_("%qD was not declared in this scope, "
18967 "and no declarations were found by "
18968 "argument-dependent lookup at the point "
18969 "of instantiation");
18973 error_at (cp_expr_loc_or_input_loc (t
),
18976 diag
= permerror (cp_expr_loc_or_input_loc (t
),
18982 if (INDIRECT_REF_P (fn
))
18983 fn
= TREE_OPERAND (fn
, 0);
18984 if (is_overloaded_fn (fn
))
18985 fn
= get_first_fn (fn
);
18988 /* Can't say anything more. */;
18989 else if (DECL_CLASS_SCOPE_P (fn
))
18991 location_t loc
= cp_expr_loc_or_input_loc (t
);
18993 "declarations in dependent base %qT are "
18994 "not found by unqualified lookup",
18995 DECL_CLASS_CONTEXT (fn
));
18996 if (current_class_ptr
)
18998 "use %<this->%D%> instead", function
);
19001 "use %<%T::%D%> instead",
19002 current_class_name
, function
);
19005 inform (DECL_SOURCE_LOCATION (fn
),
19006 "%qD declared here, later in the "
19007 "translation unit", fn
);
19009 RETURN (error_mark_node
);
19015 if (identifier_p (function
))
19017 if (complain
& tf_error
)
19018 unqualified_name_lookup_error (function
);
19019 RETURN (error_mark_node
);
19023 /* Remember that there was a reference to this entity. */
19024 if (function
!= NULL_TREE
19025 && DECL_P (function
)
19026 && !mark_used (function
, complain
) && !(complain
& tf_error
))
19027 RETURN (error_mark_node
);
19029 /* Put back tf_decltype for the actual call. */
19030 complain
|= decltype_flag
;
19032 if (function
== NULL_TREE
)
19033 switch (CALL_EXPR_IFN (t
))
19036 gcc_assert (nargs
== 1);
19037 if (vec_safe_length (call_args
) != 1)
19039 error_at (cp_expr_loc_or_input_loc (t
),
19040 "wrong number of arguments to "
19041 "%<__builtin_launder%>");
19042 ret
= error_mark_node
;
19045 ret
= finish_builtin_launder (cp_expr_loc_or_input_loc (t
),
19046 (*call_args
)[0], complain
);
19049 case IFN_VEC_CONVERT
:
19050 gcc_assert (nargs
== 1);
19051 if (vec_safe_length (call_args
) != 1)
19053 error_at (cp_expr_loc_or_input_loc (t
),
19054 "wrong number of arguments to "
19055 "%<__builtin_convertvector%>");
19056 ret
= error_mark_node
;
19059 ret
= cp_build_vec_convert ((*call_args
)[0], input_location
,
19060 tsubst (TREE_TYPE (t
), args
,
19061 complain
, in_decl
),
19063 if (TREE_CODE (ret
) == VIEW_CONVERT_EXPR
)
19068 /* Unsupported internal function with arguments. */
19069 gcc_unreachable ();
19071 else if (TREE_CODE (function
) == OFFSET_REF
19072 || TREE_CODE (function
) == DOTSTAR_EXPR
19073 || TREE_CODE (function
) == MEMBER_REF
)
19074 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
19076 else if (TREE_CODE (function
) == COMPONENT_REF
)
19078 tree instance
= TREE_OPERAND (function
, 0);
19079 tree fn
= TREE_OPERAND (function
, 1);
19081 if (processing_template_decl
19082 && (type_dependent_expression_p (instance
)
19083 || (!BASELINK_P (fn
)
19084 && TREE_CODE (fn
) != FIELD_DECL
)
19085 || type_dependent_expression_p (fn
)
19086 || any_type_dependent_arguments_p (call_args
)))
19087 ret
= build_min_nt_call_vec (function
, call_args
);
19088 else if (!BASELINK_P (fn
))
19089 ret
= finish_call_expr (function
, &call_args
,
19090 /*disallow_virtual=*/false,
19091 /*koenig_p=*/false,
19094 ret
= (build_new_method_call
19096 &call_args
, NULL_TREE
,
19097 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
19102 ret
= finish_call_expr (function
, &call_args
,
19103 /*disallow_virtual=*/qualified_p
,
19107 if (ret
!= error_mark_node
)
19109 bool op
= CALL_EXPR_OPERATOR_SYNTAX (t
);
19110 bool ord
= CALL_EXPR_ORDERED_ARGS (t
);
19111 bool rev
= CALL_EXPR_REVERSE_ARGS (t
);
19112 if (op
|| ord
|| rev
)
19114 function
= extract_call_expr (ret
);
19115 CALL_EXPR_OPERATOR_SYNTAX (function
) = op
;
19116 CALL_EXPR_ORDERED_ARGS (function
) = ord
;
19117 CALL_EXPR_REVERSE_ARGS (function
) = rev
;
19126 tree cond
= RECUR (TREE_OPERAND (t
, 0));
19127 cond
= mark_rvalue_use (cond
);
19128 tree folded_cond
= fold_non_dependent_expr (cond
, complain
);
19131 if (TREE_CODE (folded_cond
) == INTEGER_CST
)
19133 if (integer_zerop (folded_cond
))
19135 ++c_inhibit_evaluation_warnings
;
19136 exp1
= RECUR (TREE_OPERAND (t
, 1));
19137 --c_inhibit_evaluation_warnings
;
19138 exp2
= RECUR (TREE_OPERAND (t
, 2));
19142 exp1
= RECUR (TREE_OPERAND (t
, 1));
19143 ++c_inhibit_evaluation_warnings
;
19144 exp2
= RECUR (TREE_OPERAND (t
, 2));
19145 --c_inhibit_evaluation_warnings
;
19147 cond
= folded_cond
;
19151 exp1
= RECUR (TREE_OPERAND (t
, 1));
19152 exp2
= RECUR (TREE_OPERAND (t
, 2));
19155 warning_sentinel
s(warn_duplicated_branches
);
19156 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
19157 cond
, exp1
, exp2
, complain
));
19160 case PSEUDO_DTOR_EXPR
:
19162 tree op0
= RECUR (TREE_OPERAND (t
, 0));
19163 tree op1
= RECUR (TREE_OPERAND (t
, 1));
19164 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
19165 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
19171 tree purpose
, value
, chain
;
19173 if (t
== void_list_node
)
19176 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
19177 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
19179 /* We have pack expansions, so expand those and
19180 create a new list out of it. */
19181 tree purposevec
= NULL_TREE
;
19182 tree valuevec
= NULL_TREE
;
19186 /* Expand the argument expressions. */
19187 if (TREE_PURPOSE (t
))
19188 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
19189 complain
, in_decl
);
19190 if (TREE_VALUE (t
))
19191 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
19192 complain
, in_decl
);
19194 /* Build the rest of the list. */
19195 chain
= TREE_CHAIN (t
);
19196 if (chain
&& chain
!= void_type_node
)
19197 chain
= RECUR (chain
);
19199 /* Determine the number of arguments. */
19200 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
19202 len
= TREE_VEC_LENGTH (purposevec
);
19203 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
19205 else if (TREE_CODE (valuevec
) == TREE_VEC
)
19206 len
= TREE_VEC_LENGTH (valuevec
);
19209 /* Since we only performed a partial substitution into
19210 the argument pack, we only RETURN (a single list
19212 if (purposevec
== TREE_PURPOSE (t
)
19213 && valuevec
== TREE_VALUE (t
)
19214 && chain
== TREE_CHAIN (t
))
19217 RETURN (tree_cons (purposevec
, valuevec
, chain
));
19220 /* Convert the argument vectors into a TREE_LIST */
19224 /* Grab the Ith values. */
19226 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
19229 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
19232 /* Build the list (backwards). */
19233 chain
= tree_cons (purpose
, value
, chain
);
19239 purpose
= TREE_PURPOSE (t
);
19241 purpose
= RECUR (purpose
);
19242 value
= TREE_VALUE (t
);
19244 value
= RECUR (value
);
19245 chain
= TREE_CHAIN (t
);
19246 if (chain
&& chain
!= void_type_node
)
19247 chain
= RECUR (chain
);
19248 if (purpose
== TREE_PURPOSE (t
)
19249 && value
== TREE_VALUE (t
)
19250 && chain
== TREE_CHAIN (t
))
19252 RETURN (tree_cons (purpose
, value
, chain
));
19255 case COMPONENT_REF
:
19262 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
19263 args
, complain
, in_decl
);
19264 /* Remember that there was a reference to this entity. */
19265 if (DECL_P (object
)
19266 && !mark_used (object
, complain
) && !(complain
& tf_error
))
19267 RETURN (error_mark_node
);
19268 object_type
= TREE_TYPE (object
);
19270 member
= TREE_OPERAND (t
, 1);
19271 if (BASELINK_P (member
))
19272 member
= tsubst_baselink (member
,
19273 non_reference (TREE_TYPE (object
)),
19274 args
, complain
, in_decl
);
19276 member
= tsubst_copy (member
, args
, complain
, in_decl
);
19277 if (member
== error_mark_node
)
19278 RETURN (error_mark_node
);
19280 if (TREE_CODE (member
) == FIELD_DECL
)
19282 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
19283 if (TREE_CODE (r
) == COMPONENT_REF
)
19284 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
19287 else if (type_dependent_expression_p (object
))
19288 /* We can't do much here. */;
19289 else if (!CLASS_TYPE_P (object_type
))
19291 if (scalarish_type_p (object_type
))
19293 tree s
= NULL_TREE
;
19294 tree dtor
= member
;
19296 if (TREE_CODE (dtor
) == SCOPE_REF
)
19298 s
= TREE_OPERAND (dtor
, 0);
19299 dtor
= TREE_OPERAND (dtor
, 1);
19301 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
19303 dtor
= TREE_OPERAND (dtor
, 0);
19305 RETURN (finish_pseudo_destructor_expr
19306 (object
, s
, dtor
, input_location
));
19310 else if (TREE_CODE (member
) == SCOPE_REF
19311 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
19313 /* Lookup the template functions now that we know what the
19315 tree scope
= TREE_OPERAND (member
, 0);
19316 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
19317 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
19318 member
= lookup_qualified_name (scope
, tmpl
,
19319 /*is_type_p=*/false,
19320 /*complain=*/false);
19321 if (BASELINK_P (member
))
19323 BASELINK_FUNCTIONS (member
)
19324 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
19326 member
= (adjust_result_of_qualified_name_lookup
19327 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
19332 qualified_name_lookup_error (scope
, tmpl
, member
,
19334 RETURN (error_mark_node
);
19337 else if (TREE_CODE (member
) == SCOPE_REF
19338 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
19339 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
19341 if (complain
& tf_error
)
19343 if (TYPE_P (TREE_OPERAND (member
, 0)))
19344 error ("%qT is not a class or namespace",
19345 TREE_OPERAND (member
, 0));
19347 error ("%qD is not a class or namespace",
19348 TREE_OPERAND (member
, 0));
19350 RETURN (error_mark_node
);
19353 r
= finish_class_member_access_expr (object
, member
,
19354 /*template_p=*/false,
19356 if (TREE_CODE (r
) == COMPONENT_REF
)
19357 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
19362 RETURN (build_throw
19363 (RECUR (TREE_OPERAND (t
, 0))));
19367 vec
<constructor_elt
, va_gc
> *n
;
19368 constructor_elt
*ce
;
19369 unsigned HOST_WIDE_INT idx
;
19370 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
19371 bool process_index_p
;
19373 bool need_copy_p
= false;
19376 if (type
== error_mark_node
)
19377 RETURN (error_mark_node
);
19379 /* We do not want to process the index of aggregate
19380 initializers as they are identifier nodes which will be
19381 looked up by digest_init. */
19382 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
19384 if (null_member_pointer_value_p (t
))
19386 gcc_assert (same_type_p (type
, TREE_TYPE (t
)));
19390 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
19391 newlen
= vec_safe_length (n
);
19392 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
19394 if (ce
->index
&& process_index_p
19395 /* An identifier index is looked up in the type
19396 being initialized, not the current scope. */
19397 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
19398 ce
->index
= RECUR (ce
->index
);
19400 if (PACK_EXPANSION_P (ce
->value
))
19402 /* Substitute into the pack expansion. */
19403 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
19406 if (ce
->value
== error_mark_node
19407 || PACK_EXPANSION_P (ce
->value
))
19409 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
19410 /* Just move the argument into place. */
19411 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
19414 /* Update the length of the final CONSTRUCTOR
19415 arguments vector, and note that we will need to
19417 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
19418 need_copy_p
= true;
19422 ce
->value
= RECUR (ce
->value
);
19427 vec
<constructor_elt
, va_gc
> *old_n
= n
;
19429 vec_alloc (n
, newlen
);
19430 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
19432 if (TREE_CODE (ce
->value
) == TREE_VEC
)
19434 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
19435 for (i
= 0; i
< len
; ++i
)
19436 CONSTRUCTOR_APPEND_ELT (n
, 0,
19437 TREE_VEC_ELT (ce
->value
, i
));
19440 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
19444 r
= build_constructor (init_list_type_node
, n
);
19445 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
19446 CONSTRUCTOR_IS_DESIGNATED_INIT (r
)
19447 = CONSTRUCTOR_IS_DESIGNATED_INIT (t
);
19449 if (TREE_HAS_CONSTRUCTOR (t
))
19451 fcl_t cl
= fcl_functional
;
19452 if (CONSTRUCTOR_C99_COMPOUND_LITERAL (t
))
19454 RETURN (finish_compound_literal (type
, r
, complain
, cl
));
19457 TREE_TYPE (r
) = type
;
19463 tree operand_0
= TREE_OPERAND (t
, 0);
19464 if (TYPE_P (operand_0
))
19466 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
19467 RETURN (get_typeid (operand_0
, complain
));
19471 operand_0
= RECUR (operand_0
);
19472 RETURN (build_typeid (operand_0
, complain
));
19483 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
19484 /* ??? We're doing a subset of finish_id_expression here. */
19485 if (tree wrap
= maybe_get_tls_wrapper_call (r
))
19486 /* Replace an evaluated use of the thread_local variable with
19487 a call to its wrapper. */
19489 else if (outer_automatic_var_p (r
))
19490 r
= process_outer_var_ref (r
, complain
);
19492 if (!TYPE_REF_P (TREE_TYPE (t
)))
19493 /* If the original type was a reference, we'll be wrapped in
19494 the appropriate INDIRECT_REF. */
19495 r
= convert_from_reference (r
);
19501 tree op0
= RECUR (TREE_OPERAND (t
, 0));
19502 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
19503 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
19506 case OFFSETOF_EXPR
:
19509 = tsubst_copy_and_build (TREE_OPERAND (t
, 1), args
, complain
,
19510 in_decl
, /*function_p=*/false,
19511 /*integral_constant_expression_p=*/false);
19512 RETURN (finish_offsetof (object_ptr
,
19513 RECUR (TREE_OPERAND (t
, 0)),
19514 EXPR_LOCATION (t
)));
19517 case ADDRESSOF_EXPR
:
19518 RETURN (cp_build_addressof (EXPR_LOCATION (t
),
19519 RECUR (TREE_OPERAND (t
, 0)), complain
));
19523 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
19524 complain
, in_decl
);
19526 tree type2
= TRAIT_EXPR_TYPE2 (t
);
19527 if (type2
&& TREE_CODE (type2
) == TREE_LIST
)
19528 type2
= RECUR (type2
);
19530 type2
= tsubst (type2
, args
, complain
, in_decl
);
19532 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
19537 tree old_stmt_expr
= cur_stmt_expr
;
19538 tree stmt_expr
= begin_stmt_expr ();
19540 cur_stmt_expr
= stmt_expr
;
19541 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
19542 integral_constant_expression_p
);
19543 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
19544 cur_stmt_expr
= old_stmt_expr
;
19546 /* If the resulting list of expression statement is empty,
19547 fold it further into void_node. */
19548 if (empty_expr_stmt_p (stmt_expr
))
19549 stmt_expr
= void_node
;
19551 RETURN (stmt_expr
);
19556 if (complain
& tf_partial
)
19558 /* We don't have a full set of template arguments yet; don't touch
19559 the lambda at all. */
19560 gcc_assert (processing_template_decl
);
19563 tree r
= tsubst_lambda_expr (t
, args
, complain
, in_decl
);
19565 RETURN (build_lambda_object (r
));
19569 /* We can get here for a constant initializer of non-dependent type.
19570 FIXME stop folding in cp_parser_initializer_clause. */
19572 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
19577 case TRANSACTION_EXPR
:
19578 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
19579 integral_constant_expression_p
));
19582 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
19584 case VEC_PERM_EXPR
:
19586 tree op0
= RECUR (TREE_OPERAND (t
, 0));
19587 tree op1
= RECUR (TREE_OPERAND (t
, 1));
19588 tree op2
= RECUR (TREE_OPERAND (t
, 2));
19589 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
19593 case REQUIRES_EXPR
:
19594 RETURN (tsubst_requires_expr (t
, args
, complain
, in_decl
));
19597 /* No need to substitute further, a RANGE_EXPR will always be built
19598 with constant operands. */
19601 case NON_LVALUE_EXPR
:
19602 case VIEW_CONVERT_EXPR
:
19603 if (location_wrapper_p (t
))
19604 /* We need to do this here as well as in tsubst_copy so we get the
19605 other tsubst_copy_and_build semantics for a PARM_DECL operand. */
19606 RETURN (maybe_wrap_with_location (RECUR (TREE_OPERAND (t
, 0)),
19607 EXPR_LOCATION (t
)));
19611 /* Handle Objective-C++ constructs, if appropriate. */
19614 = objcp_tsubst_copy_and_build (t
, args
, complain
,
19615 in_decl
, /*function_p=*/false);
19619 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
19625 input_location
= loc
;
19629 /* Verify that the instantiated ARGS are valid. For type arguments,
19630 make sure that the type's linkage is ok. For non-type arguments,
19631 make sure they are constants if they are integral or enumerations.
19632 Emit an error under control of COMPLAIN, and return TRUE on error. */
19635 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
19637 if (dependent_template_arg_p (t
))
19639 if (ARGUMENT_PACK_P (t
))
19641 tree vec
= ARGUMENT_PACK_ARGS (t
);
19642 int len
= TREE_VEC_LENGTH (vec
);
19643 bool result
= false;
19646 for (i
= 0; i
< len
; ++i
)
19647 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
19651 else if (TYPE_P (t
))
19653 /* [basic.link]: A name with no linkage (notably, the name
19654 of a class or enumeration declared in a local scope)
19655 shall not be used to declare an entity with linkage.
19656 This implies that names with no linkage cannot be used as
19659 DR 757 relaxes this restriction for C++0x. */
19660 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
19661 : no_linkage_check (t
, /*relaxed_p=*/false));
19665 /* DR 488 makes use of a type with no linkage cause
19666 type deduction to fail. */
19667 if (complain
& tf_error
)
19669 if (TYPE_UNNAMED_P (nt
))
19670 error ("%qT is/uses unnamed type", t
);
19672 error ("template argument for %qD uses local type %qT",
19677 /* In order to avoid all sorts of complications, we do not
19678 allow variably-modified types as template arguments. */
19679 else if (variably_modified_type_p (t
, NULL_TREE
))
19681 if (complain
& tf_error
)
19682 error ("%qT is a variably modified type", t
);
19686 /* Class template and alias template arguments should be OK. */
19687 else if (DECL_TYPE_TEMPLATE_P (t
))
19689 /* A non-type argument of integral or enumerated type must be a
19691 else if (TREE_TYPE (t
)
19692 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
19693 && !REFERENCE_REF_P (t
)
19694 && !TREE_CONSTANT (t
))
19696 if (complain
& tf_error
)
19697 error ("integral expression %qE is not constant", t
);
19704 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
19706 int ix
, len
= DECL_NTPARMS (tmpl
);
19707 bool result
= false;
19709 for (ix
= 0; ix
!= len
; ix
++)
19711 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
19714 if (result
&& (complain
& tf_error
))
19715 error (" trying to instantiate %qD", tmpl
);
19719 /* We're out of SFINAE context now, so generate diagnostics for the access
19720 errors we saw earlier when instantiating D from TMPL and ARGS. */
19723 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
19725 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
19726 tree type
= TREE_TYPE (pattern
);
19727 location_t loc
= input_location
;
19729 push_access_scope (d
);
19730 push_deferring_access_checks (dk_no_deferred
);
19731 input_location
= DECL_SOURCE_LOCATION (pattern
);
19732 tsubst (type
, args
, tf_warning_or_error
, d
);
19733 input_location
= loc
;
19734 pop_deferring_access_checks ();
19735 pop_access_scope (d
);
19738 /* Instantiate the indicated variable, function, or alias template TMPL with
19739 the template arguments in TARG_PTR. */
19742 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
19744 tree targ_ptr
= orig_args
;
19748 bool access_ok
= true;
19750 if (tmpl
== error_mark_node
)
19751 return error_mark_node
;
19753 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
19755 /* If this function is a clone, handle it specially. */
19756 if (DECL_CLONED_FUNCTION_P (tmpl
))
19761 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
19762 DECL_CLONED_FUNCTION. */
19763 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
19764 targ_ptr
, complain
);
19765 if (spec
== error_mark_node
)
19766 return error_mark_node
;
19768 /* Look for the clone. */
19769 FOR_EACH_CLONE (clone
, spec
)
19770 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
19772 /* We should always have found the clone by now. */
19773 gcc_unreachable ();
19777 if (targ_ptr
== error_mark_node
)
19778 return error_mark_node
;
19780 /* Check to see if we already have this specialization. */
19781 gen_tmpl
= most_general_template (tmpl
);
19782 if (TMPL_ARGS_DEPTH (targ_ptr
)
19783 < TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
)))
19784 /* targ_ptr only has the innermost template args, so add the outer ones
19785 from tmpl, which could be either a partial instantiation or gen_tmpl (in
19786 the case of a non-dependent call within a template definition). */
19787 targ_ptr
= (add_outermost_template_args
19788 (DECL_TI_ARGS (DECL_TEMPLATE_RESULT (tmpl
)),
19791 /* It would be nice to avoid hashing here and then again in tsubst_decl,
19792 but it doesn't seem to be on the hot path. */
19793 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
19795 gcc_assert (tmpl
== gen_tmpl
19796 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
19798 || fndecl
== NULL_TREE
);
19800 if (spec
!= NULL_TREE
)
19802 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
19804 if (complain
& tf_error
)
19805 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
19806 return error_mark_node
;
19811 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
19813 return error_mark_node
;
19815 /* We are building a FUNCTION_DECL, during which the access of its
19816 parameters and return types have to be checked. However this
19817 FUNCTION_DECL which is the desired context for access checking
19818 is not built yet. We solve this chicken-and-egg problem by
19819 deferring all checks until we have the FUNCTION_DECL. */
19820 push_deferring_access_checks (dk_deferred
);
19822 /* Instantiation of the function happens in the context of the function
19823 template, not the context of the overload resolution we're doing. */
19824 push_to_top_level ();
19825 /* If there are dependent arguments, e.g. because we're doing partial
19826 ordering, make sure processing_template_decl stays set. */
19827 if (uses_template_parms (targ_ptr
))
19828 ++processing_template_decl
;
19829 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
19831 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
19832 complain
, gen_tmpl
, true);
19833 push_nested_class (ctx
);
19836 tree pattern
= DECL_TEMPLATE_RESULT (gen_tmpl
);
19838 fndecl
= NULL_TREE
;
19839 if (VAR_P (pattern
))
19841 /* We need to determine if we're using a partial or explicit
19842 specialization now, because the type of the variable could be
19844 tree tid
= lookup_template_variable (gen_tmpl
, targ_ptr
);
19845 tree elt
= most_specialized_partial_spec (tid
, complain
);
19846 if (elt
== error_mark_node
)
19847 pattern
= error_mark_node
;
19850 tree partial_tmpl
= TREE_VALUE (elt
);
19851 tree partial_args
= TREE_PURPOSE (elt
);
19852 tree partial_pat
= DECL_TEMPLATE_RESULT (partial_tmpl
);
19853 fndecl
= tsubst (partial_pat
, partial_args
, complain
, gen_tmpl
);
19857 /* Substitute template parameters to obtain the specialization. */
19858 if (fndecl
== NULL_TREE
)
19859 fndecl
= tsubst (pattern
, targ_ptr
, complain
, gen_tmpl
);
19860 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
19861 pop_nested_class ();
19862 pop_from_top_level ();
19864 if (fndecl
== error_mark_node
)
19866 pop_deferring_access_checks ();
19867 return error_mark_node
;
19870 /* The DECL_TI_TEMPLATE should always be the immediate parent
19871 template, not the most general template. */
19872 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
19873 DECL_TI_ARGS (fndecl
) = targ_ptr
;
19875 /* Now we know the specialization, compute access previously
19876 deferred. Do no access control for inheriting constructors,
19877 as we already checked access for the inherited constructor. */
19878 if (!(flag_new_inheriting_ctors
19879 && DECL_INHERITED_CTOR (fndecl
)))
19881 push_access_scope (fndecl
);
19882 if (!perform_deferred_access_checks (complain
))
19884 pop_access_scope (fndecl
);
19886 pop_deferring_access_checks ();
19888 /* If we've just instantiated the main entry point for a function,
19889 instantiate all the alternate entry points as well. We do this
19890 by cloning the instantiation of the main entry point, not by
19891 instantiating the template clones. */
19892 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
19893 clone_function_decl (fndecl
, /*update_methods=*/false);
19897 if (!(complain
& tf_error
))
19899 /* Remember to reinstantiate when we're out of SFINAE so the user
19900 can see the errors. */
19901 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
19903 return error_mark_node
;
19908 /* Wrapper for instantiate_template_1. */
19911 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
19914 timevar_push (TV_TEMPLATE_INST
);
19915 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
19916 timevar_pop (TV_TEMPLATE_INST
);
19920 /* Instantiate the alias template TMPL with ARGS. Also push a template
19921 instantiation level, which instantiate_template doesn't do because
19922 functions and variables have sufficient context established by the
19926 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
19928 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
19929 return error_mark_node
;
19930 if (!push_tinst_level (tmpl
, args
))
19931 return error_mark_node
;
19934 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
19935 args
, tmpl
, complain
,
19936 /*require_all_args=*/true,
19937 /*use_default_args=*/true);
19939 tree r
= instantiate_template (tmpl
, args
, complain
);
19940 pop_tinst_level ();
19945 /* PARM is a template parameter pack for FN. Returns true iff
19946 PARM is used in a deducible way in the argument list of FN. */
19949 pack_deducible_p (tree parm
, tree fn
)
19951 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
19952 for (; t
; t
= TREE_CHAIN (t
))
19954 tree type
= TREE_VALUE (t
);
19956 if (!PACK_EXPANSION_P (type
))
19958 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
19959 packs
; packs
= TREE_CHAIN (packs
))
19960 if (template_args_equal (TREE_VALUE (packs
), parm
))
19962 /* The template parameter pack is used in a function parameter
19963 pack. If this is the end of the parameter list, the
19964 template parameter pack is deducible. */
19965 if (TREE_CHAIN (t
) == void_list_node
)
19968 /* Otherwise, not. Well, it could be deduced from
19969 a non-pack parameter, but doing so would end up with
19970 a deduction mismatch, so don't bother. */
19974 /* The template parameter pack isn't used in any function parameter
19975 packs, but it might be used deeper, e.g. tuple<Args...>. */
19979 /* Subroutine of fn_type_unification: check non-dependent parms for
19983 check_non_deducible_conversions (tree parms
, const tree
*args
, unsigned nargs
,
19984 tree fn
, unification_kind_t strict
, int flags
,
19985 struct conversion
**convs
, bool explain_p
)
19987 /* Non-constructor methods need to leave a conversion for 'this', which
19988 isn't included in nargs here. */
19989 unsigned offset
= (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
19990 && !DECL_CONSTRUCTOR_P (fn
));
19992 for (unsigned ia
= 0;
19993 parms
&& parms
!= void_list_node
&& ia
< nargs
; )
19995 tree parm
= TREE_VALUE (parms
);
19997 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
19998 && (!TREE_CHAIN (parms
)
19999 || TREE_CHAIN (parms
) == void_list_node
))
20000 /* For a function parameter pack that occurs at the end of the
20001 parameter-declaration-list, the type A of each remaining
20002 argument of the call is compared with the type P of the
20003 declarator-id of the function parameter pack. */
20006 parms
= TREE_CHAIN (parms
);
20008 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
20009 /* For a function parameter pack that does not occur at the
20010 end of the parameter-declaration-list, the type of the
20011 parameter pack is a non-deduced context. */
20014 if (!uses_template_parms (parm
))
20016 tree arg
= args
[ia
];
20017 conversion
**conv_p
= convs
? &convs
[ia
+offset
] : NULL
;
20018 int lflags
= conv_flags (ia
, nargs
, fn
, arg
, flags
);
20020 if (check_non_deducible_conversion (parm
, arg
, strict
, lflags
,
20021 conv_p
, explain_p
))
20031 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
20032 NARGS elements of the arguments that are being used when calling
20033 it. TARGS is a vector into which the deduced template arguments
20036 Returns either a FUNCTION_DECL for the matching specialization of FN or
20037 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
20038 true, diagnostics will be printed to explain why it failed.
20040 If FN is a conversion operator, or we are trying to produce a specific
20041 specialization, RETURN_TYPE is the return type desired.
20043 The EXPLICIT_TARGS are explicit template arguments provided via a
20046 The parameter STRICT is one of:
20049 We are deducing arguments for a function call, as in
20050 [temp.deduct.call]. If RETURN_TYPE is non-null, we are
20051 deducing arguments for a call to the result of a conversion
20052 function template, as in [over.call.object].
20055 We are deducing arguments for a conversion function, as in
20056 [temp.deduct.conv].
20059 We are deducing arguments when doing an explicit instantiation
20060 as in [temp.explicit], when determining an explicit specialization
20061 as in [temp.expl.spec], or when taking the address of a function
20062 template, as in [temp.deduct.funcaddr]. */
20065 fn_type_unification (tree fn
,
20066 tree explicit_targs
,
20069 unsigned int nargs
,
20071 unification_kind_t strict
,
20073 struct conversion
**convs
,
20079 tree decl
= NULL_TREE
;
20080 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
20082 static int deduction_depth
;
20083 /* type_unification_real will pass back any access checks from default
20084 template argument substitution. */
20085 vec
<deferred_access_check
, va_gc
> *checks
= NULL
;
20086 /* We don't have all the template args yet. */
20087 bool incomplete
= true;
20090 if (flag_new_inheriting_ctors
)
20091 fn
= strip_inheriting_ctors (fn
);
20093 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
20094 tree r
= error_mark_node
;
20096 tree full_targs
= targs
;
20097 if (TMPL_ARGS_DEPTH (targs
)
20098 < TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (fn
)))
20099 full_targs
= (add_outermost_template_args
20100 (DECL_TI_ARGS (DECL_TEMPLATE_RESULT (fn
)),
20104 complain
|= tf_decltype
;
20106 /* In C++0x, it's possible to have a function template whose type depends
20107 on itself recursively. This is most obvious with decltype, but can also
20108 occur with enumeration scope (c++/48969). So we need to catch infinite
20109 recursion and reject the substitution at deduction time; this function
20110 will return error_mark_node for any repeated substitution.
20112 This also catches excessive recursion such as when f<N> depends on
20113 f<N-1> across all integers, and returns error_mark_node for all the
20114 substitutions back up to the initial one.
20116 This is, of course, not reentrant. */
20117 if (excessive_deduction_depth
)
20118 return error_mark_node
;
20121 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
20123 fntype
= TREE_TYPE (fn
);
20124 if (explicit_targs
)
20128 The specified template arguments must match the template
20129 parameters in kind (i.e., type, nontype, template), and there
20130 must not be more arguments than there are parameters;
20131 otherwise type deduction fails.
20133 Nontype arguments must match the types of the corresponding
20134 nontype template parameters, or must be convertible to the
20135 types of the corresponding nontype parameters as specified in
20136 _temp.arg.nontype_, otherwise type deduction fails.
20138 All references in the function type of the function template
20139 to the corresponding template parameters are replaced by the
20140 specified template argument values. If a substitution in a
20141 template parameter or in the function type of the function
20142 template results in an invalid type, type deduction fails. */
20143 int i
, len
= TREE_VEC_LENGTH (tparms
);
20144 location_t loc
= input_location
;
20145 incomplete
= false;
20147 if (explicit_targs
== error_mark_node
)
20150 if (TMPL_ARGS_DEPTH (explicit_targs
)
20151 < TMPL_ARGS_DEPTH (full_targs
))
20152 explicit_targs
= add_outermost_template_args (full_targs
,
20155 /* Adjust any explicit template arguments before entering the
20156 substitution context. */
20158 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
20159 complain
|tf_partial
,
20160 /*require_all_args=*/false,
20161 /*use_default_args=*/false));
20162 if (explicit_targs
== error_mark_node
)
20165 /* Substitute the explicit args into the function type. This is
20166 necessary so that, for instance, explicitly declared function
20167 arguments can match null pointed constants. If we were given
20168 an incomplete set of explicit args, we must not do semantic
20169 processing during substitution as we could create partial
20171 for (i
= 0; i
< len
; i
++)
20173 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
20174 bool parameter_pack
= false;
20175 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
20177 /* Dig out the actual parm. */
20178 if (TREE_CODE (parm
) == TYPE_DECL
20179 || TREE_CODE (parm
) == TEMPLATE_DECL
)
20181 parm
= TREE_TYPE (parm
);
20182 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
20184 else if (TREE_CODE (parm
) == PARM_DECL
)
20186 parm
= DECL_INITIAL (parm
);
20187 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
20190 if (targ
== NULL_TREE
)
20191 /* No explicit argument for this template parameter. */
20193 else if (parameter_pack
&& pack_deducible_p (parm
, fn
))
20195 /* Mark the argument pack as "incomplete". We could
20196 still deduce more arguments during unification.
20197 We remove this mark in type_unification_real. */
20198 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
20199 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
20200 = ARGUMENT_PACK_ARGS (targ
);
20202 /* We have some incomplete argument packs. */
20209 if (!push_tinst_level (fn
, explicit_targs
))
20211 excessive_deduction_depth
= true;
20214 ++processing_template_decl
;
20215 input_location
= DECL_SOURCE_LOCATION (fn
);
20216 /* Ignore any access checks; we'll see them again in
20217 instantiate_template and they might have the wrong
20218 access path at this point. */
20219 push_deferring_access_checks (dk_deferred
);
20220 tsubst_flags_t ecomplain
= complain
| tf_partial
| tf_fndecl_type
;
20221 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
, ecomplain
, NULL_TREE
);
20222 pop_deferring_access_checks ();
20223 input_location
= loc
;
20224 --processing_template_decl
;
20225 pop_tinst_level ();
20227 if (fntype
== error_mark_node
)
20231 /* Place the explicitly specified arguments in TARGS. */
20232 explicit_targs
= INNERMOST_TEMPLATE_ARGS (explicit_targs
);
20233 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
20234 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
20235 if (!incomplete
&& CHECKING_P
20236 && !NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
20237 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
20238 (targs
, NUM_TMPL_ARGS (explicit_targs
));
20241 if (return_type
&& strict
!= DEDUCE_CALL
)
20243 tree
*new_args
= XALLOCAVEC (tree
, nargs
+ 1);
20244 new_args
[0] = return_type
;
20245 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
20253 /* Never do unification on the 'this' parameter. */
20254 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
20256 if (return_type
&& strict
== DEDUCE_CALL
)
20258 /* We're deducing for a call to the result of a template conversion
20259 function. The parms we really want are in return_type. */
20260 if (INDIRECT_TYPE_P (return_type
))
20261 return_type
= TREE_TYPE (return_type
);
20262 parms
= TYPE_ARG_TYPES (return_type
);
20264 else if (return_type
)
20266 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
20269 /* We allow incomplete unification without an error message here
20270 because the standard doesn't seem to explicitly prohibit it. Our
20271 callers must be ready to deal with unification failures in any
20274 /* If we aren't explaining yet, push tinst context so we can see where
20275 any errors (e.g. from class instantiations triggered by instantiation
20276 of default template arguments) come from. If we are explaining, this
20277 context is redundant. */
20278 if (!explain_p
&& !push_tinst_level (fn
, targs
))
20280 excessive_deduction_depth
= true;
20284 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
20285 full_targs
, parms
, args
, nargs
, /*subr=*/0,
20286 strict
, &checks
, explain_p
);
20288 pop_tinst_level ();
20292 /* Now that we have bindings for all of the template arguments,
20293 ensure that the arguments deduced for the template template
20294 parameters have compatible template parameter lists. We cannot
20295 check this property before we have deduced all template
20296 arguments, because the template parameter types of a template
20297 template parameter might depend on prior template parameters
20298 deduced after the template template parameter. The following
20299 ill-formed example illustrates this issue:
20301 template<typename T, template<T> class C> void f(C<5>, T);
20303 template<int N> struct X {};
20306 f(X<5>(), 5l); // error: template argument deduction fails
20309 The template parameter list of 'C' depends on the template type
20310 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
20311 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
20312 time that we deduce 'C'. */
20313 if (!template_template_parm_bindings_ok_p
20314 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
20316 unify_inconsistent_template_template_parameters (explain_p
);
20320 /* DR 1391: All parameters have args, now check non-dependent parms for
20322 if (check_non_deducible_conversions (parms
, args
, nargs
, fn
, strict
, flags
,
20327 /* All is well so far. Now, check:
20331 When all template arguments have been deduced, all uses of
20332 template parameters in nondeduced contexts are replaced with
20333 the corresponding deduced argument values. If the
20334 substitution results in an invalid type, as described above,
20335 type deduction fails. */
20336 if (!push_tinst_level (fn
, targs
))
20338 excessive_deduction_depth
= true;
20342 /* Also collect access checks from the instantiation. */
20343 reopen_deferring_access_checks (checks
);
20345 decl
= instantiate_template (fn
, targs
, complain
);
20347 checks
= get_deferred_access_checks ();
20348 pop_deferring_access_checks ();
20350 pop_tinst_level ();
20352 if (decl
== error_mark_node
)
20355 /* Now perform any access checks encountered during substitution. */
20356 push_access_scope (decl
);
20357 ok
= perform_access_checks (checks
, complain
);
20358 pop_access_scope (decl
);
20362 /* If we're looking for an exact match, check that what we got
20363 is indeed an exact match. It might not be if some template
20364 parameters are used in non-deduced contexts. But don't check
20365 for an exact match if we have dependent template arguments;
20366 in that case we're doing partial ordering, and we already know
20367 that we have two candidates that will provide the actual type. */
20368 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
20370 tree substed
= TREE_TYPE (decl
);
20374 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
20376 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
20377 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
20378 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
20380 unify_type_mismatch (explain_p
, args
[i
],
20381 TREE_VALUE (sarg
));
20386 /* After doing deduction with the inherited constructor, actually return an
20387 instantiation of the inheriting constructor. */
20389 decl
= instantiate_template (orig_fn
, targs
, complain
);
20395 if (excessive_deduction_depth
)
20397 if (deduction_depth
== 0)
20398 /* Reset once we're all the way out. */
20399 excessive_deduction_depth
= false;
20405 /* Adjust types before performing type deduction, as described in
20406 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
20407 sections are symmetric. PARM is the type of a function parameter
20408 or the return type of the conversion function. ARG is the type of
20409 the argument passed to the call, or the type of the value
20410 initialized with the result of the conversion function.
20411 ARG_EXPR is the original argument expression, which may be null. */
20414 maybe_adjust_types_for_deduction (unification_kind_t strict
,
20427 /* Swap PARM and ARG throughout the remainder of this
20428 function; the handling is precisely symmetric since PARM
20429 will initialize ARG rather than vice versa. */
20430 std::swap (parm
, arg
);
20434 /* Core issue #873: Do the DR606 thing (see below) for these cases,
20435 too, but here handle it by stripping the reference from PARM
20436 rather than by adding it to ARG. */
20437 if (TYPE_REF_P (*parm
)
20438 && TYPE_REF_IS_RVALUE (*parm
)
20439 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
20440 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
20441 && TYPE_REF_P (*arg
)
20442 && !TYPE_REF_IS_RVALUE (*arg
))
20443 *parm
= TREE_TYPE (*parm
);
20444 /* Nothing else to do in this case. */
20448 gcc_unreachable ();
20451 if (!TYPE_REF_P (*parm
))
20453 /* [temp.deduct.call]
20455 If P is not a reference type:
20457 --If A is an array type, the pointer type produced by the
20458 array-to-pointer standard conversion (_conv.array_) is
20459 used in place of A for type deduction; otherwise,
20461 --If A is a function type, the pointer type produced by
20462 the function-to-pointer standard conversion
20463 (_conv.func_) is used in place of A for type deduction;
20466 --If A is a cv-qualified type, the top level
20467 cv-qualifiers of A's type are ignored for type
20469 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
20470 *arg
= build_pointer_type (TREE_TYPE (*arg
));
20471 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
20472 *arg
= build_pointer_type (*arg
);
20474 *arg
= TYPE_MAIN_VARIANT (*arg
);
20477 /* [14.8.2.1/3 temp.deduct.call], "A forwarding reference is an rvalue
20478 reference to a cv-unqualified template parameter that does not represent a
20479 template parameter of a class template (during class template argument
20480 deduction (13.3.1.8)). If P is a forwarding reference and the argument is
20481 an lvalue, the type "lvalue reference to A" is used in place of A for type
20483 if (TYPE_REF_P (*parm
)
20484 && TYPE_REF_IS_RVALUE (*parm
)
20485 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
20486 && !TEMPLATE_TYPE_PARM_FOR_CLASS (TREE_TYPE (*parm
))
20487 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
20488 && (arg_expr
? lvalue_p (arg_expr
)
20489 /* try_one_overload doesn't provide an arg_expr, but
20490 functions are always lvalues. */
20491 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
20492 *arg
= build_reference_type (*arg
);
20494 /* [temp.deduct.call]
20496 If P is a cv-qualified type, the top level cv-qualifiers
20497 of P's type are ignored for type deduction. If P is a
20498 reference type, the type referred to by P is used for
20500 *parm
= TYPE_MAIN_VARIANT (*parm
);
20501 if (TYPE_REF_P (*parm
))
20503 *parm
= TREE_TYPE (*parm
);
20504 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
20507 /* DR 322. For conversion deduction, remove a reference type on parm
20508 too (which has been swapped into ARG). */
20509 if (strict
== DEDUCE_CONV
&& TYPE_REF_P (*arg
))
20510 *arg
= TREE_TYPE (*arg
);
20515 /* Subroutine of fn_type_unification. PARM is a function parameter of a
20516 template which doesn't contain any deducible template parameters; check if
20517 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
20518 unify_one_argument. */
20521 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
20522 int flags
, struct conversion
**conv_p
,
20528 type
= TREE_TYPE (arg
);
20532 if (same_type_p (parm
, type
))
20533 return unify_success (explain_p
);
20535 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
20536 if (strict
== DEDUCE_CONV
)
20538 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
, complain
))
20539 return unify_success (explain_p
);
20541 else if (strict
!= DEDUCE_EXACT
)
20544 tree conv_arg
= TYPE_P (arg
) ? NULL_TREE
: arg
;
20546 /* Avoid recalculating this in add_function_candidate. */
20548 = good_conversion (parm
, type
, conv_arg
, flags
, complain
));
20550 ok
= can_convert_arg (parm
, type
, conv_arg
, flags
, complain
);
20552 return unify_success (explain_p
);
20555 if (strict
== DEDUCE_EXACT
)
20556 return unify_type_mismatch (explain_p
, parm
, arg
);
20558 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
20561 static bool uses_deducible_template_parms (tree type
);
20563 /* Returns true iff the expression EXPR is one from which a template
20564 argument can be deduced. In other words, if it's an undecorated
20565 use of a template non-type parameter. */
20568 deducible_expression (tree expr
)
20570 /* Strip implicit conversions. */
20571 while (CONVERT_EXPR_P (expr
))
20572 expr
= TREE_OPERAND (expr
, 0);
20573 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
20576 /* Returns true iff the array domain DOMAIN uses a template parameter in a
20577 deducible way; that is, if it has a max value of <PARM> - 1. */
20580 deducible_array_bound (tree domain
)
20582 if (domain
== NULL_TREE
)
20585 tree max
= TYPE_MAX_VALUE (domain
);
20586 if (TREE_CODE (max
) != MINUS_EXPR
)
20589 return deducible_expression (TREE_OPERAND (max
, 0));
20592 /* Returns true iff the template arguments ARGS use a template parameter
20593 in a deducible way. */
20596 deducible_template_args (tree args
)
20598 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
20601 tree elt
= TREE_VEC_ELT (args
, i
);
20602 if (ARGUMENT_PACK_P (elt
))
20603 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
20606 if (PACK_EXPANSION_P (elt
))
20607 elt
= PACK_EXPANSION_PATTERN (elt
);
20608 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
20610 else if (TYPE_P (elt
))
20611 deducible
= uses_deducible_template_parms (elt
);
20613 deducible
= deducible_expression (elt
);
20621 /* Returns true iff TYPE contains any deducible references to template
20622 parameters, as per 14.8.2.5. */
20625 uses_deducible_template_parms (tree type
)
20627 if (PACK_EXPANSION_P (type
))
20628 type
= PACK_EXPANSION_PATTERN (type
);
20635 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
20636 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
20642 if (INDIRECT_TYPE_P (type
))
20643 return uses_deducible_template_parms (TREE_TYPE (type
));
20645 /* T[integer-constant ]
20647 if (TREE_CODE (type
) == ARRAY_TYPE
)
20648 return (uses_deducible_template_parms (TREE_TYPE (type
))
20649 || deducible_array_bound (TYPE_DOMAIN (type
)));
20661 if (TYPE_PTRMEM_P (type
))
20662 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
20663 || (uses_deducible_template_parms
20664 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
20666 /* template-name <T> (where template-name refers to a class template)
20667 template-name <i> (where template-name refers to a class template) */
20668 if (CLASS_TYPE_P (type
)
20669 && CLASSTYPE_TEMPLATE_INFO (type
)
20670 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
20671 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
20672 (CLASSTYPE_TI_ARGS (type
)));
20677 if (FUNC_OR_METHOD_TYPE_P (type
))
20679 if (uses_deducible_template_parms (TREE_TYPE (type
)))
20681 tree parm
= TYPE_ARG_TYPES (type
);
20682 if (TREE_CODE (type
) == METHOD_TYPE
)
20683 parm
= TREE_CHAIN (parm
);
20684 for (; parm
; parm
= TREE_CHAIN (parm
))
20685 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
20692 /* Subroutine of type_unification_real and unify_pack_expansion to
20693 handle unification of a single P/A pair. Parameters are as
20694 for those functions. */
20697 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
20698 int subr
, unification_kind_t strict
,
20701 tree arg_expr
= NULL_TREE
;
20704 if (arg
== error_mark_node
|| parm
== error_mark_node
)
20705 return unify_invalid (explain_p
);
20706 if (arg
== unknown_type_node
)
20707 /* We can't deduce anything from this, but we might get all the
20708 template args from other function args. */
20709 return unify_success (explain_p
);
20711 /* Implicit conversions (Clause 4) will be performed on a function
20712 argument to convert it to the type of the corresponding function
20713 parameter if the parameter type contains no template-parameters that
20714 participate in template argument deduction. */
20715 if (strict
!= DEDUCE_EXACT
20716 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
20717 /* For function parameters with no deducible template parameters,
20718 just return. We'll check non-dependent conversions later. */
20719 return unify_success (explain_p
);
20724 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
20725 | UNIFY_ALLOW_MORE_CV_QUAL
20726 | UNIFY_ALLOW_DERIVED
);
20730 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
20734 arg_strict
= UNIFY_ALLOW_NONE
;
20738 gcc_unreachable ();
20741 /* We only do these transformations if this is the top-level
20742 parameter_type_list in a call or declaration matching; in other
20743 situations (nested function declarators, template argument lists) we
20744 won't be comparing a type to an expression, and we don't do any type
20750 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
20751 if (type_unknown_p (arg
))
20753 /* [temp.deduct.type] A template-argument can be
20754 deduced from a pointer to function or pointer
20755 to member function argument if the set of
20756 overloaded functions does not contain function
20757 templates and at most one of a set of
20758 overloaded functions provides a unique
20760 resolve_overloaded_unification (tparms
, targs
, parm
,
20762 arg_strict
, explain_p
);
20763 /* If a unique match was not found, this is a
20764 non-deduced context, so we still succeed. */
20765 return unify_success (explain_p
);
20769 arg
= unlowered_expr_type (arg
);
20770 if (arg
== error_mark_node
)
20771 return unify_invalid (explain_p
);
20775 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
20778 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
20779 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
20780 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
20782 /* For deduction from an init-list we need the actual list. */
20783 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
20785 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
20788 /* for_each_template_parm callback that always returns 0. */
20791 zero_r (tree
, void *)
20796 /* for_each_template_parm any_fn callback to handle deduction of a template
20797 type argument from the type of an array bound. */
20800 array_deduction_r (tree t
, void *data
)
20802 tree_pair_p d
= (tree_pair_p
)data
;
20803 tree
&tparms
= d
->purpose
;
20804 tree
&targs
= d
->value
;
20806 if (TREE_CODE (t
) == ARRAY_TYPE
)
20807 if (tree dom
= TYPE_DOMAIN (t
))
20808 if (tree max
= TYPE_MAX_VALUE (dom
))
20810 if (TREE_CODE (max
) == MINUS_EXPR
)
20811 max
= TREE_OPERAND (max
, 0);
20812 if (TREE_CODE (max
) == TEMPLATE_PARM_INDEX
)
20813 unify (tparms
, targs
, TREE_TYPE (max
), size_type_node
,
20814 UNIFY_ALLOW_NONE
, /*explain*/false);
20817 /* Keep walking. */
20821 /* Try to deduce any not-yet-deduced template type arguments from the type of
20822 an array bound. This is handled separately from unify because 14.8.2.5 says
20823 "The type of a type parameter is only deduced from an array bound if it is
20824 not otherwise deduced." */
20827 try_array_deduction (tree tparms
, tree targs
, tree parm
)
20829 tree_pair_s data
= { tparms
, targs
};
20830 hash_set
<tree
> visited
;
20831 for_each_template_parm (parm
, zero_r
, &data
, &visited
,
20832 /*nondeduced*/false, array_deduction_r
);
20835 /* Most parms like fn_type_unification.
20837 If SUBR is 1, we're being called recursively (to unify the
20838 arguments of a function or method parameter of a function
20841 CHECKS is a pointer to a vector of access checks encountered while
20842 substituting default template arguments. */
20845 type_unification_real (tree tparms
,
20849 unsigned int xnargs
,
20851 unification_kind_t strict
,
20852 vec
<deferred_access_check
, va_gc
> **checks
,
20857 int ntparms
= TREE_VEC_LENGTH (tparms
);
20858 int saw_undeduced
= 0;
20861 unsigned int nargs
;
20864 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
20865 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
20866 gcc_assert (ntparms
> 0);
20868 tree targs
= INNERMOST_TEMPLATE_ARGS (full_targs
);
20870 /* Reset the number of non-defaulted template arguments contained
20872 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
20880 while (parms
&& parms
!= void_list_node
20883 parm
= TREE_VALUE (parms
);
20885 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
20886 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
20887 /* For a function parameter pack that occurs at the end of the
20888 parameter-declaration-list, the type A of each remaining
20889 argument of the call is compared with the type P of the
20890 declarator-id of the function parameter pack. */
20893 parms
= TREE_CHAIN (parms
);
20895 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
20896 /* For a function parameter pack that does not occur at the
20897 end of the parameter-declaration-list, the type of the
20898 parameter pack is a non-deduced context. */
20904 if (unify_one_argument (tparms
, full_targs
, parm
, arg
, subr
, strict
,
20910 && parms
!= void_list_node
20911 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
20913 /* Unify the remaining arguments with the pack expansion type. */
20915 tree parmvec
= make_tree_vec (1);
20917 /* Allocate a TREE_VEC and copy in all of the arguments */
20918 argvec
= make_tree_vec (nargs
- ia
);
20919 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
20920 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
20922 /* Copy the parameter into parmvec. */
20923 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
20924 if (unify_pack_expansion (tparms
, full_targs
, parmvec
, argvec
, strict
,
20925 /*subr=*/subr
, explain_p
))
20928 /* Advance to the end of the list of parameters. */
20929 parms
= TREE_CHAIN (parms
);
20932 /* Fail if we've reached the end of the parm list, and more args
20933 are present, and the parm list isn't variadic. */
20934 if (ia
< nargs
&& parms
== void_list_node
)
20935 return unify_too_many_arguments (explain_p
, nargs
, ia
);
20936 /* Fail if parms are left and they don't have default values and
20937 they aren't all deduced as empty packs (c++/57397). This is
20938 consistent with sufficient_parms_p. */
20939 if (parms
&& parms
!= void_list_node
20940 && TREE_PURPOSE (parms
) == NULL_TREE
)
20942 unsigned int count
= nargs
;
20947 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
20950 p
= TREE_CHAIN (p
);
20952 while (p
&& p
!= void_list_node
);
20953 if (count
!= nargs
)
20954 return unify_too_few_arguments (explain_p
, ia
, count
,
20960 tsubst_flags_t complain
= (explain_p
20961 ? tf_warning_or_error
20963 bool tried_array_deduction
= (cxx_dialect
< cxx17
);
20965 for (i
= 0; i
< ntparms
; i
++)
20967 tree targ
= TREE_VEC_ELT (targs
, i
);
20968 tree tparm
= TREE_VEC_ELT (tparms
, i
);
20970 /* Clear the "incomplete" flags on all argument packs now so that
20971 substituting them into later default arguments works. */
20972 if (targ
&& ARGUMENT_PACK_P (targ
))
20974 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
20975 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
20978 if (targ
|| tparm
== error_mark_node
)
20980 tparm
= TREE_VALUE (tparm
);
20982 if (TREE_CODE (tparm
) == TYPE_DECL
20983 && !tried_array_deduction
)
20985 try_array_deduction (tparms
, targs
, xparms
);
20986 tried_array_deduction
= true;
20987 if (TREE_VEC_ELT (targs
, i
))
20991 /* If this is an undeduced nontype parameter that depends on
20992 a type parameter, try another pass; its type may have been
20993 deduced from a later argument than the one from which
20994 this parameter can be deduced. */
20995 if (TREE_CODE (tparm
) == PARM_DECL
20996 && uses_template_parms (TREE_TYPE (tparm
))
20997 && saw_undeduced
< 2)
21003 /* Core issue #226 (C++0x) [temp.deduct]:
21005 If a template argument has not been deduced, its
21006 default template argument, if any, is used.
21008 When we are in C++98 mode, TREE_PURPOSE will either
21009 be NULL_TREE or ERROR_MARK_NODE, so we do not need
21010 to explicitly check cxx_dialect here. */
21011 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
21012 /* OK, there is a default argument. Wait until after the
21013 conversion check to do substitution. */
21016 /* If the type parameter is a parameter pack, then it will
21017 be deduced to an empty parameter pack. */
21018 if (template_parameter_pack_p (tparm
))
21022 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
21024 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
21025 TREE_CONSTANT (arg
) = 1;
21028 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
21030 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
21032 TREE_VEC_ELT (targs
, i
) = arg
;
21036 return unify_parameter_deduction_failure (explain_p
, tparm
);
21039 /* Now substitute into the default template arguments. */
21040 for (i
= 0; i
< ntparms
; i
++)
21042 tree targ
= TREE_VEC_ELT (targs
, i
);
21043 tree tparm
= TREE_VEC_ELT (tparms
, i
);
21045 if (targ
|| tparm
== error_mark_node
)
21047 tree parm
= TREE_VALUE (tparm
);
21048 tree arg
= TREE_PURPOSE (tparm
);
21049 reopen_deferring_access_checks (*checks
);
21050 location_t save_loc
= input_location
;
21052 input_location
= DECL_SOURCE_LOCATION (parm
);
21054 if (saw_undeduced
== 1
21055 && TREE_CODE (parm
) == PARM_DECL
21056 && uses_template_parms (TREE_TYPE (parm
)))
21058 /* The type of this non-type parameter depends on undeduced
21059 parameters. Don't try to use its default argument yet,
21060 since we might deduce an argument for it on the next pass,
21061 but do check whether the arguments we already have cause
21062 substitution failure, so that that happens before we try
21063 later default arguments (78489). */
21064 ++processing_template_decl
;
21065 tree type
= tsubst (TREE_TYPE (parm
), full_targs
, complain
,
21067 --processing_template_decl
;
21068 if (type
== error_mark_node
)
21069 arg
= error_mark_node
;
21075 /* Even if the call is happening in template context, getting
21076 here means it's non-dependent, and a default argument is
21077 considered a separate definition under [temp.decls], so we can
21078 do this substitution without processing_template_decl. This
21079 is important if the default argument contains something that
21080 might be instantiation-dependent like access (87480). */
21081 processing_template_decl_sentinel s
;
21082 tree substed
= NULL_TREE
;
21083 if (saw_undeduced
== 1)
21085 /* First instatiate in template context, in case we still
21086 depend on undeduced template parameters. */
21087 ++processing_template_decl
;
21088 substed
= tsubst_template_arg (arg
, full_targs
, complain
,
21090 --processing_template_decl
;
21091 if (substed
!= error_mark_node
21092 && !uses_template_parms (substed
))
21093 /* We replaced all the tparms, substitute again out of
21094 template context. */
21095 substed
= NULL_TREE
;
21098 substed
= tsubst_template_arg (arg
, full_targs
, complain
,
21101 if (!uses_template_parms (substed
))
21102 arg
= convert_template_argument (parm
, substed
, full_targs
,
21103 complain
, i
, NULL_TREE
);
21104 else if (saw_undeduced
== 1)
21107 arg
= error_mark_node
;
21110 input_location
= save_loc
;
21111 *checks
= get_deferred_access_checks ();
21112 pop_deferring_access_checks ();
21114 if (arg
== error_mark_node
)
21118 TREE_VEC_ELT (targs
, i
) = arg
;
21119 /* The position of the first default template argument,
21120 is also the number of non-defaulted arguments in TARGS.
21122 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
21123 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
21127 if (saw_undeduced
++ == 1)
21131 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
21132 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
21134 return unify_success (explain_p
);
21137 /* Subroutine of type_unification_real. Args are like the variables
21138 at the call site. ARG is an overloaded function (or template-id);
21139 we try deducing template args from each of the overloads, and if
21140 only one succeeds, we go with that. Modifies TARGS and returns
21141 true on success. */
21144 resolve_overloaded_unification (tree tparms
,
21148 unification_kind_t strict
,
21152 tree tempargs
= copy_node (targs
);
21154 tree goodfn
= NULL_TREE
;
21157 if (TREE_CODE (arg
) == ADDR_EXPR
)
21159 arg
= TREE_OPERAND (arg
, 0);
21165 if (TREE_CODE (arg
) == COMPONENT_REF
)
21166 /* Handle `&x' where `x' is some static or non-static member
21168 arg
= TREE_OPERAND (arg
, 1);
21170 if (TREE_CODE (arg
) == OFFSET_REF
)
21171 arg
= TREE_OPERAND (arg
, 1);
21173 /* Strip baselink information. */
21174 if (BASELINK_P (arg
))
21175 arg
= BASELINK_FUNCTIONS (arg
);
21177 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
21179 /* If we got some explicit template args, we need to plug them into
21180 the affected templates before we try to unify, in case the
21181 explicit args will completely resolve the templates in question. */
21184 tree expl_subargs
= TREE_OPERAND (arg
, 1);
21185 arg
= TREE_OPERAND (arg
, 0);
21187 for (lkp_iterator
iter (arg
); iter
; ++iter
)
21190 tree subargs
, elem
;
21192 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
21195 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
21196 expl_subargs
, NULL_TREE
, tf_none
,
21197 /*require_all_args=*/true,
21198 /*use_default_args=*/true);
21199 if (subargs
!= error_mark_node
21200 && !any_dependent_template_arguments_p (subargs
))
21202 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
21203 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
21204 elem
, strict
, sub_strict
, addr_p
, explain_p
)
21205 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
21214 /* If no templates (or more than one) are fully resolved by the
21215 explicit arguments, this template-id is a non-deduced context; it
21216 could still be OK if we deduce all template arguments for the
21217 enclosing call through other arguments. */
21221 else if (!OVL_P (arg
))
21222 /* If ARG is, for example, "(0, &f)" then its type will be unknown
21223 -- but the deduction does not succeed because the expression is
21224 not just the function on its own. */
21227 for (lkp_iterator
iter (arg
); iter
; ++iter
)
21230 if (try_one_overload (tparms
, targs
, tempargs
, parm
, TREE_TYPE (fn
),
21231 strict
, sub_strict
, addr_p
, explain_p
)
21232 && (!goodfn
|| !decls_match (goodfn
, fn
)))
21239 /* [temp.deduct.type] A template-argument can be deduced from a pointer
21240 to function or pointer to member function argument if the set of
21241 overloaded functions does not contain function templates and at most
21242 one of a set of overloaded functions provides a unique match.
21244 So if we found multiple possibilities, we return success but don't
21245 deduce anything. */
21249 int i
= TREE_VEC_LENGTH (targs
);
21251 if (TREE_VEC_ELT (tempargs
, i
))
21253 tree old
= TREE_VEC_ELT (targs
, i
);
21254 tree new_
= TREE_VEC_ELT (tempargs
, i
);
21255 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
21256 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
21257 /* Don't forget explicit template arguments in a pack. */
21258 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
21259 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
21260 TREE_VEC_ELT (targs
, i
) = new_
;
21269 /* Core DR 115: In contexts where deduction is done and fails, or in
21270 contexts where deduction is not done, if a template argument list is
21271 specified and it, along with any default template arguments, identifies
21272 a single function template specialization, then the template-id is an
21273 lvalue for the function template specialization. */
21276 resolve_nondeduced_context (tree orig_expr
, tsubst_flags_t complain
)
21278 tree expr
, offset
, baselink
;
21281 if (!type_unknown_p (orig_expr
))
21286 offset
= NULL_TREE
;
21287 baselink
= NULL_TREE
;
21289 if (TREE_CODE (expr
) == ADDR_EXPR
)
21291 expr
= TREE_OPERAND (expr
, 0);
21294 if (TREE_CODE (expr
) == OFFSET_REF
)
21297 expr
= TREE_OPERAND (expr
, 1);
21299 if (BASELINK_P (expr
))
21302 expr
= BASELINK_FUNCTIONS (expr
);
21305 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
21308 tree goodfn
= NULL_TREE
;
21310 /* If we got some explicit template args, we need to plug them into
21311 the affected templates before we try to unify, in case the
21312 explicit args will completely resolve the templates in question. */
21314 tree expl_subargs
= TREE_OPERAND (expr
, 1);
21315 tree arg
= TREE_OPERAND (expr
, 0);
21316 tree badfn
= NULL_TREE
;
21317 tree badargs
= NULL_TREE
;
21319 for (lkp_iterator
iter (arg
); iter
; ++iter
)
21322 tree subargs
, elem
;
21324 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
21327 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
21328 expl_subargs
, NULL_TREE
, tf_none
,
21329 /*require_all_args=*/true,
21330 /*use_default_args=*/true);
21331 if (subargs
!= error_mark_node
21332 && !any_dependent_template_arguments_p (subargs
))
21334 elem
= instantiate_template (fn
, subargs
, tf_none
);
21335 if (elem
== error_mark_node
)
21340 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
21349 mark_used (goodfn
);
21352 expr
= build_baselink (BASELINK_BINFO (baselink
),
21353 BASELINK_ACCESS_BINFO (baselink
),
21354 expr
, BASELINK_OPTYPE (baselink
));
21358 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
21359 expr
= build_offset_ref (base
, expr
, addr
, complain
);
21362 expr
= cp_build_addr_expr (expr
, complain
);
21365 else if (good
== 0 && badargs
&& (complain
& tf_error
))
21366 /* There were no good options and at least one bad one, so let the
21367 user know what the problem is. */
21368 instantiate_template (badfn
, badargs
, complain
);
21373 /* As above, but error out if the expression remains overloaded. */
21376 resolve_nondeduced_context_or_error (tree exp
, tsubst_flags_t complain
)
21378 exp
= resolve_nondeduced_context (exp
, complain
);
21379 if (type_unknown_p (exp
))
21381 if (complain
& tf_error
)
21382 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
21383 return error_mark_node
;
21388 /* Subroutine of resolve_overloaded_unification; does deduction for a single
21389 overload. Fills TARGS with any deduced arguments, or error_mark_node if
21390 different overloads deduce different arguments for a given parm.
21391 ADDR_P is true if the expression for which deduction is being
21392 performed was of the form "& fn" rather than simply "fn".
21394 Returns 1 on success. */
21397 try_one_overload (tree tparms
,
21402 unification_kind_t strict
,
21411 if (arg
== error_mark_node
)
21414 /* [temp.deduct.type] A template-argument can be deduced from a pointer
21415 to function or pointer to member function argument if the set of
21416 overloaded functions does not contain function templates and at most
21417 one of a set of overloaded functions provides a unique match.
21419 So if this is a template, just return success. */
21421 if (uses_template_parms (arg
))
21424 if (TREE_CODE (arg
) == METHOD_TYPE
)
21425 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
21427 arg
= build_pointer_type (arg
);
21429 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
21431 /* We don't copy orig_targs for this because if we have already deduced
21432 some template args from previous args, unify would complain when we
21433 try to deduce a template parameter for the same argument, even though
21434 there isn't really a conflict. */
21435 nargs
= TREE_VEC_LENGTH (targs
);
21436 tempargs
= make_tree_vec (nargs
);
21438 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
21441 /* First make sure we didn't deduce anything that conflicts with
21442 explicitly specified args. */
21443 for (i
= nargs
; i
--; )
21445 tree elt
= TREE_VEC_ELT (tempargs
, i
);
21446 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
21450 else if (uses_template_parms (elt
))
21451 /* Since we're unifying against ourselves, we will fill in
21452 template args used in the function parm list with our own
21453 template parms. Discard them. */
21454 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
21455 else if (oldelt
&& ARGUMENT_PACK_P (oldelt
))
21457 /* Check that the argument at each index of the deduced argument pack
21458 is equivalent to the corresponding explicitly specified argument.
21459 We may have deduced more arguments than were explicitly specified,
21462 /* We used to assert ARGUMENT_PACK_INCOMPLETE_P (oldelt) here, but
21463 that's wrong if we deduce the same argument pack from multiple
21464 function arguments: it's only incomplete the first time. */
21466 tree explicit_pack
= ARGUMENT_PACK_ARGS (oldelt
);
21467 tree deduced_pack
= ARGUMENT_PACK_ARGS (elt
);
21469 if (TREE_VEC_LENGTH (deduced_pack
)
21470 < TREE_VEC_LENGTH (explicit_pack
))
21473 for (int j
= 0; j
< TREE_VEC_LENGTH (explicit_pack
); j
++)
21474 if (!template_args_equal (TREE_VEC_ELT (explicit_pack
, j
),
21475 TREE_VEC_ELT (deduced_pack
, j
)))
21478 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
21482 for (i
= nargs
; i
--; )
21484 tree elt
= TREE_VEC_ELT (tempargs
, i
);
21487 TREE_VEC_ELT (targs
, i
) = elt
;
21493 /* PARM is a template class (perhaps with unbound template
21494 parameters). ARG is a fully instantiated type. If ARG can be
21495 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
21496 TARGS are as for unify. */
21499 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
21502 tree copy_of_targs
;
21504 if (!CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
21506 else if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
21507 /* Matches anything. */;
21508 else if (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
21509 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
)))
21512 /* We need to make a new template argument vector for the call to
21513 unify. If we used TARGS, we'd clutter it up with the result of
21514 the attempted unification, even if this class didn't work out.
21515 We also don't want to commit ourselves to all the unifications
21516 we've already done, since unification is supposed to be done on
21517 an argument-by-argument basis. In other words, consider the
21518 following pathological case:
21520 template <int I, int J, int K>
21523 template <int I, int J>
21524 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
21526 template <int I, int J, int K>
21527 void f(S<I, J, K>, S<I, I, I>);
21536 Now, by the time we consider the unification involving `s2', we
21537 already know that we must have `f<0, 0, 0>'. But, even though
21538 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
21539 because there are two ways to unify base classes of S<0, 1, 2>
21540 with S<I, I, I>. If we kept the already deduced knowledge, we
21541 would reject the possibility I=1. */
21542 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
21544 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
21546 if (unify_bound_ttp_args (tparms
, copy_of_targs
, parm
, arg
, explain_p
))
21551 /* If unification failed, we're done. */
21552 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
21553 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
21559 /* Given a template type PARM and a class type ARG, find the unique
21560 base type in ARG that is an instance of PARM. We do not examine
21561 ARG itself; only its base-classes. If there is not exactly one
21562 appropriate base class, return NULL_TREE. PARM may be the type of
21563 a partial specialization, as well as a plain template type. Used
21566 static enum template_base_result
21567 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
21568 bool explain_p
, tree
*result
)
21570 tree rval
= NULL_TREE
;
21573 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
21575 binfo
= TYPE_BINFO (complete_type (arg
));
21578 /* The type could not be completed. */
21579 *result
= NULL_TREE
;
21580 return tbr_incomplete_type
;
21583 /* Walk in inheritance graph order. The search order is not
21584 important, and this avoids multiple walks of virtual bases. */
21585 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
21587 tree r
= try_class_unification (tparms
, targs
, parm
,
21588 BINFO_TYPE (binfo
), explain_p
);
21592 /* If there is more than one satisfactory baseclass, then:
21596 If they yield more than one possible deduced A, the type
21600 if (rval
&& !same_type_p (r
, rval
))
21602 *result
= NULL_TREE
;
21603 return tbr_ambiguous_baseclass
;
21611 return tbr_success
;
21614 /* Returns the level of DECL, which declares a template parameter. */
21617 template_decl_level (tree decl
)
21619 switch (TREE_CODE (decl
))
21622 case TEMPLATE_DECL
:
21623 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
21626 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
21629 gcc_unreachable ();
21634 /* Decide whether ARG can be unified with PARM, considering only the
21635 cv-qualifiers of each type, given STRICT as documented for unify.
21636 Returns nonzero iff the unification is OK on that basis. */
21639 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
21641 int arg_quals
= cp_type_quals (arg
);
21642 int parm_quals
= cp_type_quals (parm
);
21644 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
21645 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
21647 /* Although a CVR qualifier is ignored when being applied to a
21648 substituted template parameter ([8.3.2]/1 for example), that
21649 does not allow us to unify "const T" with "int&" because both
21650 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
21651 It is ok when we're allowing additional CV qualifiers
21652 at the outer level [14.8.2.1]/3,1st bullet. */
21653 if ((TYPE_REF_P (arg
)
21654 || FUNC_OR_METHOD_TYPE_P (arg
))
21655 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
21658 if ((!INDIRECT_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
21659 && (parm_quals
& TYPE_QUAL_RESTRICT
))
21663 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
21664 && (arg_quals
& parm_quals
) != parm_quals
)
21667 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
21668 && (parm_quals
& arg_quals
) != arg_quals
)
21674 /* Determines the LEVEL and INDEX for the template parameter PARM. */
21676 template_parm_level_and_index (tree parm
, int* level
, int* index
)
21678 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
21679 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
21680 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
21682 *index
= TEMPLATE_TYPE_IDX (parm
);
21683 *level
= TEMPLATE_TYPE_LEVEL (parm
);
21687 *index
= TEMPLATE_PARM_IDX (parm
);
21688 *level
= TEMPLATE_PARM_LEVEL (parm
);
21692 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
21694 if (unify (TP, TA, P, A, S, EP)) \
21698 /* Unifies the remaining arguments in PACKED_ARGS with the pack
21699 expansion at the end of PACKED_PARMS. Returns 0 if the type
21700 deduction succeeds, 1 otherwise. STRICT is the same as in
21701 fn_type_unification. CALL_ARGS_P is true iff PACKED_ARGS is actually a
21702 function call argument list. We'll need to adjust the arguments to make them
21703 types. SUBR tells us if this is from a recursive call to
21704 type_unification_real, or for comparing two template argument
21708 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
21709 tree packed_args
, unification_kind_t strict
,
21710 bool subr
, bool explain_p
)
21713 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
21714 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
21715 tree pack
, packs
= NULL_TREE
;
21716 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
21718 /* Add in any args remembered from an earlier partial instantiation. */
21719 targs
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (parm
), targs
);
21720 int levels
= TMPL_ARGS_DEPTH (targs
);
21722 packed_args
= expand_template_argument_pack (packed_args
);
21724 int len
= TREE_VEC_LENGTH (packed_args
);
21726 /* Determine the parameter packs we will be deducing from the
21727 pattern, and record their current deductions. */
21728 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
21729 pack
; pack
= TREE_CHAIN (pack
))
21731 tree parm_pack
= TREE_VALUE (pack
);
21734 /* Only template parameter packs can be deduced, not e.g. function
21735 parameter packs or __bases or __integer_pack. */
21736 if (!TEMPLATE_PARM_P (parm_pack
))
21739 /* Determine the index and level of this parameter pack. */
21740 template_parm_level_and_index (parm_pack
, &level
, &idx
);
21741 if (level
< levels
)
21744 /* Keep track of the parameter packs and their corresponding
21746 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
21747 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
21750 /* Loop through all of the arguments that have not yet been
21751 unified and unify each with the pattern. */
21752 for (i
= start
; i
< len
; i
++)
21755 bool any_explicit
= false;
21756 tree arg
= TREE_VEC_ELT (packed_args
, i
);
21758 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
21759 or the element of its argument pack at the current index if
21760 this argument was explicitly specified. */
21761 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
21765 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
21768 if (TREE_VALUE (pack
)
21769 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
21770 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
21772 any_explicit
= true;
21773 arg
= TREE_VEC_ELT (pargs
, i
- start
);
21775 TMPL_ARG (targs
, level
, idx
) = arg
;
21778 /* If we had explicit template arguments, substitute them into the
21779 pattern before deduction. */
21782 /* Some arguments might still be unspecified or dependent. */
21784 ++processing_template_decl
;
21785 dependent
= any_dependent_template_arguments_p (targs
);
21787 --processing_template_decl
;
21788 parm
= tsubst (pattern
, targs
,
21789 explain_p
? tf_warning_or_error
: tf_none
,
21792 --processing_template_decl
;
21793 if (parm
== error_mark_node
)
21799 /* Unify the pattern with the current argument. */
21800 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
21804 /* For each parameter pack, collect the deduced value. */
21805 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
21808 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
21810 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
21811 TMPL_ARG (targs
, level
, idx
);
21815 /* Verify that the results of unification with the parameter packs
21816 produce results consistent with what we've seen before, and make
21817 the deduced argument packs available. */
21818 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
21820 tree old_pack
= TREE_VALUE (pack
);
21821 tree new_args
= TREE_TYPE (pack
);
21822 int i
, len
= TREE_VEC_LENGTH (new_args
);
21824 bool nondeduced_p
= false;
21826 /* By default keep the original deduced argument pack.
21827 If necessary, more specific code is going to update the
21828 resulting deduced argument later down in this function. */
21829 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
21830 TMPL_ARG (targs
, level
, idx
) = old_pack
;
21832 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
21833 actually deduce anything. */
21834 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
21835 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
21836 nondeduced_p
= true;
21840 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
21842 /* If we had fewer function args than explicit template args,
21843 just use the explicits. */
21844 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
21845 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
21846 if (len
< explicit_len
)
21847 new_args
= explicit_args
;
21853 /* Build the deduced *_ARGUMENT_PACK. */
21854 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
21856 result
= make_node (NONTYPE_ARGUMENT_PACK
);
21857 TREE_CONSTANT (result
) = 1;
21860 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
21862 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
21864 /* Note the deduced argument packs for this parameter
21866 TMPL_ARG (targs
, level
, idx
) = result
;
21868 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
21869 && (ARGUMENT_PACK_ARGS (old_pack
)
21870 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
21872 /* We only had the explicitly-provided arguments before, but
21873 now we have a complete set of arguments. */
21874 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
21876 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
21877 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
21878 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
21882 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
21883 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
21885 if (!comp_template_args (old_args
, new_args
,
21886 &bad_old_arg
, &bad_new_arg
))
21887 /* Inconsistent unification of this parameter pack. */
21888 return unify_parameter_pack_inconsistent (explain_p
,
21894 return unify_success (explain_p
);
21897 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
21898 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
21899 parameters and return value are as for unify. */
21902 unify_array_domain (tree tparms
, tree targs
,
21903 tree parm_dom
, tree arg_dom
,
21911 /* Our representation of array types uses "N - 1" as the
21912 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
21913 not an integer constant. We cannot unify arbitrarily
21914 complex expressions, so we eliminate the MINUS_EXPRs
21916 parm_max
= TYPE_MAX_VALUE (parm_dom
);
21917 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
21920 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
21921 parm_max
= TREE_OPERAND (parm_max
, 0);
21923 arg_max
= TYPE_MAX_VALUE (arg_dom
);
21924 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
21927 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
21928 trying to unify the type of a variable with the type
21929 of a template parameter. For example:
21931 template <unsigned int N>
21932 void f (char (&) [N]);
21939 Here, the type of the ARG will be "int [g(i)]", and
21940 may be a SAVE_EXPR, etc. */
21941 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
21942 return unify_vla_arg (explain_p
, arg_dom
);
21943 arg_max
= TREE_OPERAND (arg_max
, 0);
21946 /* If only one of the bounds used a MINUS_EXPR, compensate
21947 by adding one to the other bound. */
21948 if (parm_cst
&& !arg_cst
)
21949 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
21953 else if (arg_cst
&& !parm_cst
)
21954 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
21959 return unify (tparms
, targs
, parm_max
, arg_max
,
21960 UNIFY_ALLOW_INTEGER
, explain_p
);
21963 /* Returns whether T, a P or A in unify, is a type, template or expression. */
21965 enum pa_kind_t
{ pa_type
, pa_tmpl
, pa_expr
};
21970 if (PACK_EXPANSION_P (t
))
21971 t
= PACK_EXPANSION_PATTERN (t
);
21972 if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
21973 || TREE_CODE (t
) == UNBOUND_CLASS_TEMPLATE
21974 || DECL_TYPE_TEMPLATE_P (t
))
21976 else if (TYPE_P (t
))
21982 /* Deduce the value of template parameters. TPARMS is the (innermost)
21983 set of template parameters to a template. TARGS is the bindings
21984 for those template parameters, as determined thus far; TARGS may
21985 include template arguments for outer levels of template parameters
21986 as well. PARM is a parameter to a template function, or a
21987 subcomponent of that parameter; ARG is the corresponding argument.
21988 This function attempts to match PARM with ARG in a manner
21989 consistent with the existing assignments in TARGS. If more values
21990 are deduced, then TARGS is updated.
21992 Returns 0 if the type deduction succeeds, 1 otherwise. The
21993 parameter STRICT is a bitwise or of the following flags:
21996 Require an exact match between PARM and ARG.
21997 UNIFY_ALLOW_MORE_CV_QUAL:
21998 Allow the deduced ARG to be more cv-qualified (by qualification
21999 conversion) than ARG.
22000 UNIFY_ALLOW_LESS_CV_QUAL:
22001 Allow the deduced ARG to be less cv-qualified than ARG.
22002 UNIFY_ALLOW_DERIVED:
22003 Allow the deduced ARG to be a template base class of ARG,
22004 or a pointer to a template base class of the type pointed to by
22006 UNIFY_ALLOW_INTEGER:
22007 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
22008 case for more information.
22009 UNIFY_ALLOW_OUTER_LEVEL:
22010 This is the outermost level of a deduction. Used to determine validity
22011 of qualification conversions. A valid qualification conversion must
22012 have const qualified pointers leading up to the inner type which
22013 requires additional CV quals, except at the outer level, where const
22014 is not required [conv.qual]. It would be normal to set this flag in
22015 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
22016 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
22017 This is the outermost level of a deduction, and PARM can be more CV
22018 qualified at this point.
22019 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
22020 This is the outermost level of a deduction, and PARM can be less CV
22021 qualified at this point. */
22024 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
22030 int strict_in
= strict
;
22031 tsubst_flags_t complain
= (explain_p
22032 ? tf_warning_or_error
22035 /* I don't think this will do the right thing with respect to types.
22036 But the only case I've seen it in so far has been array bounds, where
22037 signedness is the only information lost, and I think that will be
22039 while (CONVERT_EXPR_P (parm
))
22040 parm
= TREE_OPERAND (parm
, 0);
22042 if (arg
== error_mark_node
)
22043 return unify_invalid (explain_p
);
22044 if (arg
== unknown_type_node
22045 || arg
== init_list_type_node
)
22046 /* We can't deduce anything from this, but we might get all the
22047 template args from other function args. */
22048 return unify_success (explain_p
);
22050 if (parm
== any_targ_node
|| arg
== any_targ_node
)
22051 return unify_success (explain_p
);
22053 /* If PARM uses template parameters, then we can't bail out here,
22054 even if ARG == PARM, since we won't record unifications for the
22055 template parameters. We might need them if we're trying to
22056 figure out which of two things is more specialized. */
22057 if (arg
== parm
&& !uses_template_parms (parm
))
22058 return unify_success (explain_p
);
22060 /* Handle init lists early, so the rest of the function can assume
22061 we're dealing with a type. */
22062 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
22066 tree orig_parm
= parm
;
22068 /* Replace T with std::initializer_list<T> for deduction. */
22069 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
22070 && flag_deduce_init_list
)
22071 parm
= listify (parm
);
22073 if (!is_std_init_list (parm
)
22074 && TREE_CODE (parm
) != ARRAY_TYPE
)
22075 /* We can only deduce from an initializer list argument if the
22076 parameter is std::initializer_list or an array; otherwise this
22077 is a non-deduced context. */
22078 return unify_success (explain_p
);
22080 if (TREE_CODE (parm
) == ARRAY_TYPE
)
22081 elttype
= TREE_TYPE (parm
);
22084 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
22085 /* Deduction is defined in terms of a single type, so just punt
22086 on the (bizarre) std::initializer_list<T...>. */
22087 if (PACK_EXPANSION_P (elttype
))
22088 return unify_success (explain_p
);
22091 if (strict
!= DEDUCE_EXACT
22092 && TYPE_P (elttype
)
22093 && !uses_deducible_template_parms (elttype
))
22094 /* If ELTTYPE has no deducible template parms, skip deduction from
22095 the list elements. */;
22097 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
22099 int elt_strict
= strict
;
22101 if (elt
== error_mark_node
)
22102 return unify_invalid (explain_p
);
22104 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
22106 tree type
= TREE_TYPE (elt
);
22107 if (type
== error_mark_node
)
22108 return unify_invalid (explain_p
);
22109 /* It should only be possible to get here for a call. */
22110 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
22111 elt_strict
|= maybe_adjust_types_for_deduction
22112 (DEDUCE_CALL
, &elttype
, &type
, elt
);
22116 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
22120 if (TREE_CODE (parm
) == ARRAY_TYPE
22121 && deducible_array_bound (TYPE_DOMAIN (parm
)))
22123 /* Also deduce from the length of the initializer list. */
22124 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
22125 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
22126 if (idx
== error_mark_node
)
22127 return unify_invalid (explain_p
);
22128 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
22132 /* If the std::initializer_list<T> deduction worked, replace the
22133 deduced A with std::initializer_list<A>. */
22134 if (orig_parm
!= parm
)
22136 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
22137 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
22138 targ
= listify (targ
);
22139 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
22141 return unify_success (explain_p
);
22144 /* If parm and arg aren't the same kind of thing (template, type, or
22145 expression), fail early. */
22146 if (pa_kind (parm
) != pa_kind (arg
))
22147 return unify_invalid (explain_p
);
22149 /* Immediately reject some pairs that won't unify because of
22150 cv-qualification mismatches. */
22151 if (TREE_CODE (arg
) == TREE_CODE (parm
)
22153 /* It is the elements of the array which hold the cv quals of an array
22154 type, and the elements might be template type parms. We'll check
22155 when we recurse. */
22156 && TREE_CODE (arg
) != ARRAY_TYPE
22157 /* We check the cv-qualifiers when unifying with template type
22158 parameters below. We want to allow ARG `const T' to unify with
22159 PARM `T' for example, when computing which of two templates
22160 is more specialized, for example. */
22161 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
22162 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
22163 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
22165 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
22166 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
22167 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
22168 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
22169 strict
&= ~UNIFY_ALLOW_DERIVED
;
22170 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
22171 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
22173 switch (TREE_CODE (parm
))
22175 case TYPENAME_TYPE
:
22177 case UNBOUND_CLASS_TEMPLATE
:
22178 /* In a type which contains a nested-name-specifier, template
22179 argument values cannot be deduced for template parameters used
22180 within the nested-name-specifier. */
22181 return unify_success (explain_p
);
22183 case TEMPLATE_TYPE_PARM
:
22184 case TEMPLATE_TEMPLATE_PARM
:
22185 case BOUND_TEMPLATE_TEMPLATE_PARM
:
22186 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
22187 if (error_operand_p (tparm
))
22188 return unify_invalid (explain_p
);
22190 if (TEMPLATE_TYPE_LEVEL (parm
)
22191 != template_decl_level (tparm
))
22192 /* The PARM is not one we're trying to unify. Just check
22193 to see if it matches ARG. */
22195 if (TREE_CODE (arg
) == TREE_CODE (parm
)
22196 && (is_auto (parm
) ? is_auto (arg
)
22197 : same_type_p (parm
, arg
)))
22198 return unify_success (explain_p
);
22200 return unify_type_mismatch (explain_p
, parm
, arg
);
22202 idx
= TEMPLATE_TYPE_IDX (parm
);
22203 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
22204 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
22205 if (error_operand_p (tparm
))
22206 return unify_invalid (explain_p
);
22208 /* Check for mixed types and values. */
22209 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
22210 && TREE_CODE (tparm
) != TYPE_DECL
)
22211 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
22212 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
22213 gcc_unreachable ();
22215 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22217 if ((strict_in
& UNIFY_ALLOW_DERIVED
)
22218 && CLASS_TYPE_P (arg
))
22220 /* First try to match ARG directly. */
22221 tree t
= try_class_unification (tparms
, targs
, parm
, arg
,
22225 /* Otherwise, look for a suitable base of ARG, as below. */
22226 enum template_base_result r
;
22227 r
= get_template_base (tparms
, targs
, parm
, arg
,
22230 return unify_no_common_base (explain_p
, r
, parm
, arg
);
22234 /* ARG must be constructed from a template class or a template
22235 template parameter. */
22236 else if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
22237 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
22238 return unify_template_deduction_failure (explain_p
, parm
, arg
);
22240 /* Deduce arguments T, i from TT<T> or TT<i>. */
22241 if (unify_bound_ttp_args (tparms
, targs
, parm
, arg
, explain_p
))
22244 arg
= TYPE_TI_TEMPLATE (arg
);
22246 /* Fall through to deduce template name. */
22249 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
22250 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22252 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
22254 /* Simple cases: Value already set, does match or doesn't. */
22255 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
22256 return unify_success (explain_p
);
22258 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
22262 /* If PARM is `const T' and ARG is only `int', we don't have
22263 a match unless we are allowing additional qualification.
22264 If ARG is `const int' and PARM is just `T' that's OK;
22265 that binds `const int' to `T'. */
22266 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
22268 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
22270 /* Consider the case where ARG is `const volatile int' and
22271 PARM is `const T'. Then, T should be `volatile int'. */
22272 arg
= cp_build_qualified_type_real
22273 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
22274 if (arg
== error_mark_node
)
22275 return unify_invalid (explain_p
);
22277 /* Simple cases: Value already set, does match or doesn't. */
22278 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
22279 return unify_success (explain_p
);
22281 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
22283 /* Make sure that ARG is not a variable-sized array. (Note
22284 that were talking about variable-sized arrays (like
22285 `int[n]'), rather than arrays of unknown size (like
22286 `int[]').) We'll get very confused by such a type since
22287 the bound of the array is not constant, and therefore
22288 not mangleable. Besides, such types are not allowed in
22289 ISO C++, so we can do as we please here. We do allow
22290 them for 'auto' deduction, since that isn't ABI-exposed. */
22291 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
22292 return unify_vla_arg (explain_p
, arg
);
22294 /* Strip typedefs as in convert_template_argument. */
22295 arg
= canonicalize_type_argument (arg
, tf_none
);
22298 /* If ARG is a parameter pack or an expansion, we cannot unify
22299 against it unless PARM is also a parameter pack. */
22300 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
22301 && !template_parameter_pack_p (parm
))
22302 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
22304 /* If the argument deduction results is a METHOD_TYPE,
22305 then there is a problem.
22306 METHOD_TYPE doesn't map to any real C++ type the result of
22307 the deduction cannot be of that type. */
22308 if (TREE_CODE (arg
) == METHOD_TYPE
)
22309 return unify_method_type_error (explain_p
, arg
);
22311 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
22312 return unify_success (explain_p
);
22314 case TEMPLATE_PARM_INDEX
:
22315 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
22316 if (error_operand_p (tparm
))
22317 return unify_invalid (explain_p
);
22319 if (TEMPLATE_PARM_LEVEL (parm
)
22320 != template_decl_level (tparm
))
22322 /* The PARM is not one we're trying to unify. Just check
22323 to see if it matches ARG. */
22324 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
22325 && cp_tree_equal (parm
, arg
));
22327 unify_expression_unequal (explain_p
, parm
, arg
);
22331 idx
= TEMPLATE_PARM_IDX (parm
);
22332 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
22336 if ((strict
& UNIFY_ALLOW_INTEGER
)
22337 && TREE_TYPE (targ
) && TREE_TYPE (arg
)
22338 && CP_INTEGRAL_TYPE_P (TREE_TYPE (targ
)))
22339 /* We're deducing from an array bound, the type doesn't matter. */
22340 arg
= fold_convert (TREE_TYPE (targ
), arg
);
22341 int x
= !cp_tree_equal (targ
, arg
);
22343 unify_inconsistency (explain_p
, parm
, targ
, arg
);
22347 /* [temp.deduct.type] If, in the declaration of a function template
22348 with a non-type template-parameter, the non-type
22349 template-parameter is used in an expression in the function
22350 parameter-list and, if the corresponding template-argument is
22351 deduced, the template-argument type shall match the type of the
22352 template-parameter exactly, except that a template-argument
22353 deduced from an array bound may be of any integral type.
22354 The non-type parameter might use already deduced type parameters. */
22355 tparm
= TREE_TYPE (parm
);
22356 if (TEMPLATE_PARM_LEVEL (parm
) > TMPL_ARGS_DEPTH (targs
))
22357 /* We don't have enough levels of args to do any substitution. This
22358 can happen in the context of -fnew-ttp-matching. */;
22361 ++processing_template_decl
;
22362 tparm
= tsubst (tparm
, targs
, tf_none
, NULL_TREE
);
22363 --processing_template_decl
;
22365 if (tree a
= type_uses_auto (tparm
))
22367 tparm
= do_auto_deduction (tparm
, arg
, a
, complain
, adc_unify
);
22368 if (tparm
== error_mark_node
)
22373 if (!TREE_TYPE (arg
))
22374 /* Template-parameter dependent expression. Just accept it for now.
22375 It will later be processed in convert_template_argument. */
22377 else if (same_type_ignoring_top_level_qualifiers_p
22378 (non_reference (TREE_TYPE (arg
)),
22379 non_reference (tparm
)))
22380 /* OK. Ignore top-level quals here because a class-type template
22381 parameter object is const. */;
22382 else if ((strict
& UNIFY_ALLOW_INTEGER
)
22383 && CP_INTEGRAL_TYPE_P (tparm
))
22384 /* Convert the ARG to the type of PARM; the deduced non-type
22385 template argument must exactly match the types of the
22386 corresponding parameter. */
22387 arg
= fold (build_nop (tparm
, arg
));
22388 else if (uses_template_parms (tparm
))
22390 /* We haven't deduced the type of this parameter yet. */
22391 if (cxx_dialect
>= cxx17
22392 /* We deduce from array bounds in try_array_deduction. */
22393 && !(strict
& UNIFY_ALLOW_INTEGER
))
22395 /* Deduce it from the non-type argument. */
22396 tree atype
= TREE_TYPE (arg
);
22397 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
22399 UNIFY_ALLOW_NONE
, explain_p
);
22402 /* Try again later. */
22403 return unify_success (explain_p
);
22406 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
22408 /* If ARG is a parameter pack or an expansion, we cannot unify
22409 against it unless PARM is also a parameter pack. */
22410 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
22411 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
22412 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
22415 bool removed_attr
= false;
22416 arg
= strip_typedefs_expr (arg
, &removed_attr
);
22418 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
22419 return unify_success (explain_p
);
22423 /* A pointer-to-member constant can be unified only with
22424 another constant. */
22425 if (TREE_CODE (arg
) != PTRMEM_CST
)
22426 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
22428 /* Just unify the class member. It would be useless (and possibly
22429 wrong, depending on the strict flags) to unify also
22430 PTRMEM_CST_CLASS, because we want to be sure that both parm and
22431 arg refer to the same variable, even if through different
22432 classes. For instance:
22434 struct A { int x; };
22437 Unification of &A::x and &B::x must succeed. */
22438 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
22439 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
22444 if (!TYPE_PTR_P (arg
))
22445 return unify_type_mismatch (explain_p
, parm
, arg
);
22447 /* [temp.deduct.call]
22449 A can be another pointer or pointer to member type that can
22450 be converted to the deduced A via a qualification
22451 conversion (_conv.qual_).
22453 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
22454 This will allow for additional cv-qualification of the
22455 pointed-to types if appropriate. */
22457 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
22458 /* The derived-to-base conversion only persists through one
22459 level of pointers. */
22460 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
22462 return unify (tparms
, targs
, TREE_TYPE (parm
),
22463 TREE_TYPE (arg
), strict
, explain_p
);
22466 case REFERENCE_TYPE
:
22467 if (!TYPE_REF_P (arg
))
22468 return unify_type_mismatch (explain_p
, parm
, arg
);
22469 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
22470 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
22473 if (TREE_CODE (arg
) != ARRAY_TYPE
)
22474 return unify_type_mismatch (explain_p
, parm
, arg
);
22475 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
22476 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
22477 return unify_type_mismatch (explain_p
, parm
, arg
);
22478 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
22479 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
22480 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
22481 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
22482 TYPE_DOMAIN (arg
), explain_p
);
22483 return unify_success (explain_p
);
22490 case ENUMERAL_TYPE
:
22493 if (TREE_CODE (arg
) != TREE_CODE (parm
))
22494 return unify_type_mismatch (explain_p
, parm
, arg
);
22496 /* We have already checked cv-qualification at the top of the
22498 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
22499 return unify_type_mismatch (explain_p
, parm
, arg
);
22501 /* As far as unification is concerned, this wins. Later checks
22502 will invalidate it if necessary. */
22503 return unify_success (explain_p
);
22505 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
22506 /* Type INTEGER_CST can come from ordinary constant template args. */
22508 while (CONVERT_EXPR_P (arg
))
22509 arg
= TREE_OPERAND (arg
, 0);
22511 if (TREE_CODE (arg
) != INTEGER_CST
)
22512 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
22513 return (tree_int_cst_equal (parm
, arg
)
22514 ? unify_success (explain_p
)
22515 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
22519 int i
, len
, argslen
;
22520 int parm_variadic_p
= 0;
22522 if (TREE_CODE (arg
) != TREE_VEC
)
22523 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
22525 len
= TREE_VEC_LENGTH (parm
);
22526 argslen
= TREE_VEC_LENGTH (arg
);
22528 /* Check for pack expansions in the parameters. */
22529 for (i
= 0; i
< len
; ++i
)
22531 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
22534 /* We can unify against something with a trailing
22536 parm_variadic_p
= 1;
22538 /* [temp.deduct.type]/9: If the template argument list of
22539 P contains a pack expansion that is not the last
22540 template argument, the entire template argument list
22541 is a non-deduced context. */
22542 return unify_success (explain_p
);
22546 /* If we don't have enough arguments to satisfy the parameters
22547 (not counting the pack expression at the end), or we have
22548 too many arguments for a parameter list that doesn't end in
22549 a pack expression, we can't unify. */
22550 if (parm_variadic_p
22551 ? argslen
< len
- parm_variadic_p
22553 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
22555 /* Unify all of the parameters that precede the (optional)
22556 pack expression. */
22557 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
22559 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
22560 TREE_VEC_ELT (parm
, i
),
22561 TREE_VEC_ELT (arg
, i
),
22562 UNIFY_ALLOW_NONE
, explain_p
);
22564 if (parm_variadic_p
)
22565 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
22567 /*subr=*/true, explain_p
);
22568 return unify_success (explain_p
);
22573 if (TREE_CODE (arg
) != TREE_CODE (parm
))
22574 return unify_type_mismatch (explain_p
, parm
, arg
);
22576 if (TYPE_PTRMEMFUNC_P (parm
))
22578 if (!TYPE_PTRMEMFUNC_P (arg
))
22579 return unify_type_mismatch (explain_p
, parm
, arg
);
22581 return unify (tparms
, targs
,
22582 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
22583 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
22584 strict
, explain_p
);
22586 else if (TYPE_PTRMEMFUNC_P (arg
))
22587 return unify_type_mismatch (explain_p
, parm
, arg
);
22589 if (CLASSTYPE_TEMPLATE_INFO (parm
))
22591 tree t
= NULL_TREE
;
22593 if (strict_in
& UNIFY_ALLOW_DERIVED
)
22595 /* First, we try to unify the PARM and ARG directly. */
22596 t
= try_class_unification (tparms
, targs
,
22597 parm
, arg
, explain_p
);
22601 /* Fallback to the special case allowed in
22602 [temp.deduct.call]:
22604 If P is a class, and P has the form
22605 template-id, then A can be a derived class of
22606 the deduced A. Likewise, if P is a pointer to
22607 a class of the form template-id, A can be a
22608 pointer to a derived class pointed to by the
22610 enum template_base_result r
;
22611 r
= get_template_base (tparms
, targs
, parm
, arg
,
22616 /* Don't give the derived diagnostic if we're
22617 already dealing with the same template. */
22619 = (CLASSTYPE_TEMPLATE_INFO (arg
)
22620 && (CLASSTYPE_TI_TEMPLATE (parm
)
22621 == CLASSTYPE_TI_TEMPLATE (arg
)));
22622 return unify_no_common_base (explain_p
&& !same_template
,
22627 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
22628 && (CLASSTYPE_TI_TEMPLATE (parm
)
22629 == CLASSTYPE_TI_TEMPLATE (arg
)))
22630 /* Perhaps PARM is something like S<U> and ARG is S<int>.
22631 Then, we should unify `int' and `U'. */
22634 /* There's no chance of unification succeeding. */
22635 return unify_type_mismatch (explain_p
, parm
, arg
);
22637 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
22638 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
22640 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
22641 return unify_type_mismatch (explain_p
, parm
, arg
);
22642 return unify_success (explain_p
);
22645 case FUNCTION_TYPE
:
22647 unsigned int nargs
;
22652 if (TREE_CODE (arg
) != TREE_CODE (parm
))
22653 return unify_type_mismatch (explain_p
, parm
, arg
);
22655 /* CV qualifications for methods can never be deduced, they must
22656 match exactly. We need to check them explicitly here,
22657 because type_unification_real treats them as any other
22658 cv-qualified parameter. */
22659 if (TREE_CODE (parm
) == METHOD_TYPE
22660 && (!check_cv_quals_for_unify
22662 class_of_this_parm (arg
),
22663 class_of_this_parm (parm
))))
22664 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
22665 if (TREE_CODE (arg
) == FUNCTION_TYPE
22666 && type_memfn_quals (parm
) != type_memfn_quals (arg
))
22667 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
22668 if (type_memfn_rqual (parm
) != type_memfn_rqual (arg
))
22669 return unify_type_mismatch (explain_p
, parm
, arg
);
22671 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
22672 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
22674 nargs
= list_length (TYPE_ARG_TYPES (arg
));
22675 args
= XALLOCAVEC (tree
, nargs
);
22676 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
22677 a
!= NULL_TREE
&& a
!= void_list_node
;
22678 a
= TREE_CHAIN (a
), ++i
)
22679 args
[i
] = TREE_VALUE (a
);
22682 if (type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
22683 args
, nargs
, 1, DEDUCE_EXACT
,
22687 if (flag_noexcept_type
)
22689 tree pspec
= TYPE_RAISES_EXCEPTIONS (parm
);
22690 tree aspec
= canonical_eh_spec (TYPE_RAISES_EXCEPTIONS (arg
));
22691 if (pspec
== NULL_TREE
) pspec
= noexcept_false_spec
;
22692 if (aspec
== NULL_TREE
) aspec
= noexcept_false_spec
;
22693 if (TREE_PURPOSE (pspec
) && TREE_PURPOSE (aspec
)
22694 && uses_template_parms (TREE_PURPOSE (pspec
)))
22695 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_PURPOSE (pspec
),
22696 TREE_PURPOSE (aspec
),
22697 UNIFY_ALLOW_NONE
, explain_p
);
22698 else if (nothrow_spec_p (pspec
) && !nothrow_spec_p (aspec
))
22699 return unify_type_mismatch (explain_p
, parm
, arg
);
22706 /* Unify a pointer to member with a pointer to member function, which
22707 deduces the type of the member as a function type. */
22708 if (TYPE_PTRMEMFUNC_P (arg
))
22710 /* Check top-level cv qualifiers */
22711 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
22712 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
22714 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
22715 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
22716 UNIFY_ALLOW_NONE
, explain_p
);
22718 /* Determine the type of the function we are unifying against. */
22719 tree fntype
= static_fn_type (arg
);
22721 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
22724 if (TREE_CODE (arg
) != OFFSET_TYPE
)
22725 return unify_type_mismatch (explain_p
, parm
, arg
);
22726 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
22727 TYPE_OFFSET_BASETYPE (arg
),
22728 UNIFY_ALLOW_NONE
, explain_p
);
22729 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
22730 strict
, explain_p
);
22733 if (DECL_TEMPLATE_PARM_P (parm
))
22734 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
22735 if (arg
!= scalar_constant_value (parm
))
22736 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
22737 return unify_success (explain_p
);
22740 case TEMPLATE_DECL
:
22741 /* Matched cases are handled by the ARG == PARM test above. */
22742 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
22745 /* We might get a variable as a non-type template argument in parm if the
22746 corresponding parameter is type-dependent. Make any necessary
22747 adjustments based on whether arg is a reference. */
22748 if (CONSTANT_CLASS_P (arg
))
22749 parm
= fold_non_dependent_expr (parm
, complain
);
22750 else if (REFERENCE_REF_P (arg
))
22752 tree sub
= TREE_OPERAND (arg
, 0);
22754 if (TREE_CODE (sub
) == ADDR_EXPR
)
22755 arg
= TREE_OPERAND (sub
, 0);
22757 /* Now use the normal expression code to check whether they match. */
22760 case TYPE_ARGUMENT_PACK
:
22761 case NONTYPE_ARGUMENT_PACK
:
22762 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
22763 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
22766 case DECLTYPE_TYPE
:
22767 case UNDERLYING_TYPE
:
22768 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
22769 or UNDERLYING_TYPE nodes. */
22770 return unify_success (explain_p
);
22773 /* Unification fails if we hit an error node. */
22774 return unify_invalid (explain_p
);
22777 if (REFERENCE_REF_P (parm
))
22779 bool pexp
= PACK_EXPANSION_P (arg
);
22781 arg
= PACK_EXPANSION_PATTERN (arg
);
22782 if (REFERENCE_REF_P (arg
))
22783 arg
= TREE_OPERAND (arg
, 0);
22785 arg
= make_pack_expansion (arg
, complain
);
22786 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
22787 strict
, explain_p
);
22792 /* An unresolved overload is a nondeduced context. */
22793 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
22794 return unify_success (explain_p
);
22795 gcc_assert (EXPR_P (parm
)
22796 || COMPOUND_LITERAL_P (parm
)
22797 || TREE_CODE (parm
) == TRAIT_EXPR
);
22799 /* We must be looking at an expression. This can happen with
22803 void foo(S<I>, S<I + 2>);
22807 template<typename T>
22808 void foo(A<T, T{}>);
22810 This is a "non-deduced context":
22814 The non-deduced contexts are:
22816 --A non-type template argument or an array bound in which
22817 a subexpression references a template parameter.
22819 In these cases, we assume deduction succeeded, but don't
22820 actually infer any unifications. */
22822 if (!uses_template_parms (parm
)
22823 && !template_args_equal (parm
, arg
))
22824 return unify_expression_unequal (explain_p
, parm
, arg
);
22826 return unify_success (explain_p
);
22829 #undef RECUR_AND_CHECK_FAILURE
22831 /* Note that DECL can be defined in this translation unit, if
22835 mark_definable (tree decl
)
22838 DECL_NOT_REALLY_EXTERN (decl
) = 1;
22839 FOR_EACH_CLONE (clone
, decl
)
22840 DECL_NOT_REALLY_EXTERN (clone
) = 1;
22843 /* Called if RESULT is explicitly instantiated, or is a member of an
22844 explicitly instantiated class. */
22847 mark_decl_instantiated (tree result
, int extern_p
)
22849 SET_DECL_EXPLICIT_INSTANTIATION (result
);
22851 /* If this entity has already been written out, it's too late to
22852 make any modifications. */
22853 if (TREE_ASM_WRITTEN (result
))
22856 /* For anonymous namespace we don't need to do anything. */
22857 if (decl_anon_ns_mem_p (result
))
22859 gcc_assert (!TREE_PUBLIC (result
));
22863 if (TREE_CODE (result
) != FUNCTION_DECL
)
22864 /* The TREE_PUBLIC flag for function declarations will have been
22865 set correctly by tsubst. */
22866 TREE_PUBLIC (result
) = 1;
22868 /* This might have been set by an earlier implicit instantiation. */
22869 DECL_COMDAT (result
) = 0;
22872 DECL_NOT_REALLY_EXTERN (result
) = 0;
22875 mark_definable (result
);
22876 mark_needed (result
);
22877 /* Always make artificials weak. */
22878 if (DECL_ARTIFICIAL (result
) && flag_weak
)
22879 comdat_linkage (result
);
22880 /* For WIN32 we also want to put explicit instantiations in
22881 linkonce sections. */
22882 else if (TREE_PUBLIC (result
))
22883 maybe_make_one_only (result
);
22884 if (TREE_CODE (result
) == FUNCTION_DECL
22885 && DECL_TEMPLATE_INSTANTIATED (result
))
22886 /* If the function has already been instantiated, clear DECL_EXTERNAL,
22887 since start_preparsed_function wouldn't have if we had an earlier
22888 extern explicit instantiation. */
22889 DECL_EXTERNAL (result
) = 0;
22892 /* If EXTERN_P, then this function will not be emitted -- unless
22893 followed by an explicit instantiation, at which point its linkage
22894 will be adjusted. If !EXTERN_P, then this function will be
22895 emitted here. In neither circumstance do we want
22896 import_export_decl to adjust the linkage. */
22897 DECL_INTERFACE_KNOWN (result
) = 1;
22900 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
22901 important template arguments. If any are missing, we check whether
22902 they're important by using error_mark_node for substituting into any
22903 args that were used for partial ordering (the ones between ARGS and END)
22904 and seeing if it bubbles up. */
22907 check_undeduced_parms (tree targs
, tree args
, tree end
)
22909 bool found
= false;
22911 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
22912 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
22915 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
22919 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
22920 if (substed
== error_mark_node
)
22926 /* Given two function templates PAT1 and PAT2, return:
22928 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
22929 -1 if PAT2 is more specialized than PAT1.
22930 0 if neither is more specialized.
22932 LEN indicates the number of parameters we should consider
22933 (defaulted parameters should not be considered).
22935 The 1998 std underspecified function template partial ordering, and
22936 DR214 addresses the issue. We take pairs of arguments, one from
22937 each of the templates, and deduce them against each other. One of
22938 the templates will be more specialized if all the *other*
22939 template's arguments deduce against its arguments and at least one
22940 of its arguments *does* *not* deduce against the other template's
22941 corresponding argument. Deduction is done as for class templates.
22942 The arguments used in deduction have reference and top level cv
22943 qualifiers removed. Iff both arguments were originally reference
22944 types *and* deduction succeeds in both directions, an lvalue reference
22945 wins against an rvalue reference and otherwise the template
22946 with the more cv-qualified argument wins for that pairing (if
22947 neither is more cv-qualified, they both are equal). Unlike regular
22948 deduction, after all the arguments have been deduced in this way,
22949 we do *not* verify the deduced template argument values can be
22950 substituted into non-deduced contexts.
22952 The logic can be a bit confusing here, because we look at deduce1 and
22953 targs1 to see if pat2 is at least as specialized, and vice versa; if we
22954 can find template arguments for pat1 to make arg1 look like arg2, that
22955 means that arg2 is at least as specialized as arg1. */
22958 more_specialized_fn (tree pat1
, tree pat2
, int len
)
22960 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
22961 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
22962 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
22963 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
22964 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
22965 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
22966 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
22967 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
22968 tree origs1
, origs2
;
22969 bool lose1
= false;
22970 bool lose2
= false;
22972 /* Remove the this parameter from non-static member functions. If
22973 one is a non-static member function and the other is not a static
22974 member function, remove the first parameter from that function
22975 also. This situation occurs for operator functions where we
22976 locate both a member function (with this pointer) and non-member
22977 operator (with explicit first operand). */
22978 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
22980 len
--; /* LEN is the number of significant arguments for DECL1 */
22981 args1
= TREE_CHAIN (args1
);
22982 if (!DECL_STATIC_FUNCTION_P (decl2
))
22983 args2
= TREE_CHAIN (args2
);
22985 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
22987 args2
= TREE_CHAIN (args2
);
22988 if (!DECL_STATIC_FUNCTION_P (decl1
))
22991 args1
= TREE_CHAIN (args1
);
22995 /* If only one is a conversion operator, they are unordered. */
22996 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
22999 /* Consider the return type for a conversion function */
23000 if (DECL_CONV_FN_P (decl1
))
23002 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
23003 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
23007 processing_template_decl
++;
23013 /* Stop when an ellipsis is seen. */
23014 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
23016 tree arg1
= TREE_VALUE (args1
);
23017 tree arg2
= TREE_VALUE (args2
);
23018 int deduce1
, deduce2
;
23024 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
23025 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
23027 /* When both arguments are pack expansions, we need only
23028 unify the patterns themselves. */
23029 arg1
= PACK_EXPANSION_PATTERN (arg1
);
23030 arg2
= PACK_EXPANSION_PATTERN (arg2
);
23032 /* This is the last comparison we need to do. */
23036 /* DR 1847: If a particular P contains no template-parameters that
23037 participate in template argument deduction, that P is not used to
23038 determine the ordering. */
23039 if (!uses_deducible_template_parms (arg1
)
23040 && !uses_deducible_template_parms (arg2
))
23043 if (TYPE_REF_P (arg1
))
23045 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
23046 arg1
= TREE_TYPE (arg1
);
23047 quals1
= cp_type_quals (arg1
);
23050 if (TYPE_REF_P (arg2
))
23052 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
23053 arg2
= TREE_TYPE (arg2
);
23054 quals2
= cp_type_quals (arg2
);
23057 arg1
= TYPE_MAIN_VARIANT (arg1
);
23058 arg2
= TYPE_MAIN_VARIANT (arg2
);
23060 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
23062 int i
, len2
= remaining_arguments (args2
);
23063 tree parmvec
= make_tree_vec (1);
23064 tree argvec
= make_tree_vec (len2
);
23067 /* Setup the parameter vector, which contains only ARG1. */
23068 TREE_VEC_ELT (parmvec
, 0) = arg1
;
23070 /* Setup the argument vector, which contains the remaining
23072 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
23073 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
23075 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
23076 argvec
, DEDUCE_EXACT
,
23077 /*subr=*/true, /*explain_p=*/false)
23080 /* We cannot deduce in the other direction, because ARG1 is
23081 a pack expansion but ARG2 is not. */
23084 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
23086 int i
, len1
= remaining_arguments (args1
);
23087 tree parmvec
= make_tree_vec (1);
23088 tree argvec
= make_tree_vec (len1
);
23091 /* Setup the parameter vector, which contains only ARG1. */
23092 TREE_VEC_ELT (parmvec
, 0) = arg2
;
23094 /* Setup the argument vector, which contains the remaining
23096 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
23097 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
23099 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
23100 argvec
, DEDUCE_EXACT
,
23101 /*subr=*/true, /*explain_p=*/false)
23104 /* We cannot deduce in the other direction, because ARG2 is
23105 a pack expansion but ARG1 is not.*/
23111 /* The normal case, where neither argument is a pack
23113 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
23114 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
23116 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
23117 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
23121 /* If we couldn't deduce arguments for tparms1 to make arg1 match
23122 arg2, then arg2 is not as specialized as arg1. */
23128 /* "If, for a given type, deduction succeeds in both directions
23129 (i.e., the types are identical after the transformations above)
23130 and both P and A were reference types (before being replaced with
23131 the type referred to above):
23132 - if the type from the argument template was an lvalue reference and
23133 the type from the parameter template was not, the argument type is
23134 considered to be more specialized than the other; otherwise,
23135 - if the type from the argument template is more cv-qualified
23136 than the type from the parameter template (as described above),
23137 the argument type is considered to be more specialized than the other;
23139 - neither type is more specialized than the other." */
23141 if (deduce1
&& deduce2
)
23143 if (ref1
&& ref2
&& ref1
!= ref2
)
23150 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
23152 if ((quals1
& quals2
) == quals2
)
23154 if ((quals1
& quals2
) == quals1
)
23159 if (lose1
&& lose2
)
23160 /* We've failed to deduce something in either direction.
23161 These must be unordered. */
23166 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
23167 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
23168 /* We have already processed all of the arguments in our
23169 handing of the pack expansion type. */
23172 args1
= TREE_CHAIN (args1
);
23173 args2
= TREE_CHAIN (args2
);
23176 /* "In most cases, all template parameters must have values in order for
23177 deduction to succeed, but for partial ordering purposes a template
23178 parameter may remain without a value provided it is not used in the
23179 types being used for partial ordering."
23181 Thus, if we are missing any of the targs1 we need to substitute into
23182 origs1, then pat2 is not as specialized as pat1. This can happen when
23183 there is a nondeduced context. */
23184 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
23186 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
23189 processing_template_decl
--;
23191 /* If both deductions succeed, the partial ordering selects the more
23192 constrained template. */
23193 if (!lose1
&& !lose2
)
23195 tree c1
= get_constraints (DECL_TEMPLATE_RESULT (pat1
));
23196 tree c2
= get_constraints (DECL_TEMPLATE_RESULT (pat2
));
23197 lose1
= !subsumes_constraints (c1
, c2
);
23198 lose2
= !subsumes_constraints (c2
, c1
);
23201 /* All things being equal, if the next argument is a pack expansion
23202 for one function but not for the other, prefer the
23203 non-variadic function. FIXME this is bogus; see c++/41958. */
23205 && args1
&& TREE_VALUE (args1
)
23206 && args2
&& TREE_VALUE (args2
))
23208 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
23209 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
23212 if (lose1
== lose2
)
23220 /* Determine which of two partial specializations of TMPL is more
23223 PAT1 is a TREE_LIST whose TREE_VALUE is the TEMPLATE_DECL corresponding
23224 to the first partial specialization. The TREE_PURPOSE is the
23225 innermost set of template parameters for the partial
23226 specialization. PAT2 is similar, but for the second template.
23228 Return 1 if the first partial specialization is more specialized;
23229 -1 if the second is more specialized; 0 if neither is more
23232 See [temp.class.order] for information about determining which of
23233 two templates is more specialized. */
23236 more_specialized_partial_spec (tree tmpl
, tree pat1
, tree pat2
)
23240 bool any_deductions
= false;
23242 tree tmpl1
= TREE_VALUE (pat1
);
23243 tree tmpl2
= TREE_VALUE (pat2
);
23244 tree specargs1
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl1
)));
23245 tree specargs2
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl2
)));
23247 /* Just like what happens for functions, if we are ordering between
23248 different template specializations, we may encounter dependent
23249 types in the arguments, and we need our dependency check functions
23250 to behave correctly. */
23251 ++processing_template_decl
;
23252 targs
= get_partial_spec_bindings (tmpl
, tmpl1
, specargs2
);
23256 any_deductions
= true;
23259 targs
= get_partial_spec_bindings (tmpl
, tmpl2
, specargs1
);
23263 any_deductions
= true;
23265 --processing_template_decl
;
23267 /* If both deductions succeed, the partial ordering selects the more
23268 constrained template. */
23269 if (!winner
&& any_deductions
)
23270 return more_constrained (tmpl1
, tmpl2
);
23272 /* In the case of a tie where at least one of the templates
23273 has a parameter pack at the end, the template with the most
23274 non-packed parameters wins. */
23277 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
23278 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
23280 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
23281 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
23282 int len1
= TREE_VEC_LENGTH (args1
);
23283 int len2
= TREE_VEC_LENGTH (args2
);
23285 /* We don't count the pack expansion at the end. */
23286 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
23288 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
23293 else if (len1
< len2
)
23300 /* Return the template arguments that will produce the function signature
23301 DECL from the function template FN, with the explicit template
23302 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
23303 also match. Return NULL_TREE if no satisfactory arguments could be
23307 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
23309 int ntparms
= DECL_NTPARMS (fn
);
23310 tree targs
= make_tree_vec (ntparms
);
23311 tree decl_type
= TREE_TYPE (decl
);
23312 tree decl_arg_types
;
23314 unsigned int nargs
, ix
;
23317 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
23319 /* Never do unification on the 'this' parameter. */
23320 decl_arg_types
= skip_artificial_parms_for (decl
,
23321 TYPE_ARG_TYPES (decl_type
));
23323 nargs
= list_length (decl_arg_types
);
23324 args
= XALLOCAVEC (tree
, nargs
);
23325 for (arg
= decl_arg_types
, ix
= 0;
23326 arg
!= NULL_TREE
&& arg
!= void_list_node
;
23327 arg
= TREE_CHAIN (arg
), ++ix
)
23328 args
[ix
] = TREE_VALUE (arg
);
23330 if (fn_type_unification (fn
, explicit_args
, targs
,
23332 (check_rettype
|| DECL_CONV_FN_P (fn
)
23333 ? TREE_TYPE (decl_type
) : NULL_TREE
),
23334 DEDUCE_EXACT
, LOOKUP_NORMAL
, NULL
,
23335 /*explain_p=*/false,
23337 == error_mark_node
)
23343 /* Return the innermost template arguments that, when applied to a partial
23344 specialization SPEC_TMPL of TMPL, yield the ARGS.
23346 For example, suppose we have:
23348 template <class T, class U> struct S {};
23349 template <class T> struct S<T*, int> {};
23351 Then, suppose we want to get `S<double*, int>'. SPEC_TMPL will be the
23352 partial specialization and the ARGS will be {double*, int}. The resulting
23353 vector will be {double}, indicating that `T' is bound to `double'. */
23356 get_partial_spec_bindings (tree tmpl
, tree spec_tmpl
, tree args
)
23358 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
23360 = TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (spec_tmpl
)));
23361 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
23363 tree innermost_deduced_args
;
23365 innermost_deduced_args
= make_tree_vec (ntparms
);
23366 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
23368 deduced_args
= copy_node (args
);
23369 SET_TMPL_ARGS_LEVEL (deduced_args
,
23370 TMPL_ARGS_DEPTH (deduced_args
),
23371 innermost_deduced_args
);
23374 deduced_args
= innermost_deduced_args
;
23376 bool tried_array_deduction
= (cxx_dialect
< cxx17
);
23378 if (unify (tparms
, deduced_args
,
23379 INNERMOST_TEMPLATE_ARGS (spec_args
),
23380 INNERMOST_TEMPLATE_ARGS (args
),
23381 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
23384 for (i
= 0; i
< ntparms
; ++i
)
23385 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
23387 if (!tried_array_deduction
)
23389 try_array_deduction (tparms
, innermost_deduced_args
,
23390 INNERMOST_TEMPLATE_ARGS (spec_args
));
23391 tried_array_deduction
= true;
23392 if (TREE_VEC_ELT (innermost_deduced_args
, i
))
23398 if (!push_tinst_level (spec_tmpl
, deduced_args
))
23400 excessive_deduction_depth
= true;
23404 /* Verify that nondeduced template arguments agree with the type
23405 obtained from argument deduction.
23409 struct A { typedef int X; };
23410 template <class T, class U> struct C {};
23411 template <class T> struct C<T, typename T::X> {};
23413 Then with the instantiation `C<A, int>', we can deduce that
23414 `T' is `A' but unify () does not check whether `typename T::X'
23416 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
23418 if (spec_args
!= error_mark_node
)
23419 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
23420 INNERMOST_TEMPLATE_ARGS (spec_args
),
23421 tmpl
, tf_none
, false, false);
23423 pop_tinst_level ();
23425 if (spec_args
== error_mark_node
23426 /* We only need to check the innermost arguments; the other
23427 arguments will always agree. */
23428 || !comp_template_args_porder (INNERMOST_TEMPLATE_ARGS (spec_args
),
23429 INNERMOST_TEMPLATE_ARGS (args
)))
23432 /* Now that we have bindings for all of the template arguments,
23433 ensure that the arguments deduced for the template template
23434 parameters have compatible template parameter lists. See the use
23435 of template_template_parm_bindings_ok_p in fn_type_unification
23436 for more information. */
23437 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
23440 return deduced_args
;
23443 // Compare two function templates T1 and T2 by deducing bindings
23444 // from one against the other. If both deductions succeed, compare
23445 // constraints to see which is more constrained.
23447 more_specialized_inst (tree t1
, tree t2
)
23452 if (get_bindings (t1
, DECL_TEMPLATE_RESULT (t2
), NULL_TREE
, true))
23458 if (get_bindings (t2
, DECL_TEMPLATE_RESULT (t1
), NULL_TREE
, true))
23464 // If both deductions succeed, then one may be more constrained.
23465 if (count
== 2 && fate
== 0)
23466 fate
= more_constrained (t1
, t2
);
23471 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
23472 Return the TREE_LIST node with the most specialized template, if
23473 any. If there is no most specialized template, the error_mark_node
23476 Note that this function does not look at, or modify, the
23477 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
23478 returned is one of the elements of INSTANTIATIONS, callers may
23479 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
23480 and retrieve it from the value returned. */
23483 most_specialized_instantiation (tree templates
)
23487 ++processing_template_decl
;
23490 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
23492 gcc_assert (TREE_VALUE (champ
) != TREE_VALUE (fn
));
23493 int fate
= more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
));
23498 /* Equally specialized, move to next function. If there
23499 is no next function, nothing's most specialized. */
23500 fn
= TREE_CHAIN (fn
);
23508 /* Now verify that champ is better than everything earlier in the
23509 instantiation list. */
23510 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
)) {
23511 if (more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
)) != 1)
23518 processing_template_decl
--;
23521 return error_mark_node
;
23526 /* If DECL is a specialization of some template, return the most
23527 general such template. Otherwise, returns NULL_TREE.
23529 For example, given:
23531 template <class T> struct S { template <class U> void f(U); };
23533 if TMPL is `template <class U> void S<int>::f(U)' this will return
23534 the full template. This function will not trace past partial
23535 specializations, however. For example, given in addition:
23537 template <class T> struct S<T*> { template <class U> void f(U); };
23539 if TMPL is `template <class U> void S<int*>::f(U)' this will return
23540 `template <class T> template <class U> S<T*>::f(U)'. */
23543 most_general_template (tree decl
)
23545 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
23547 if (tree tinfo
= get_template_info (decl
))
23548 decl
= TI_TEMPLATE (tinfo
);
23549 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
23550 template friend, or a FIELD_DECL for a capture pack. */
23551 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
23555 /* Look for more and more general templates. */
23556 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
23558 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
23559 (See cp-tree.h for details.) */
23560 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
23563 if (CLASS_TYPE_P (TREE_TYPE (decl
))
23564 && !TYPE_DECL_ALIAS_P (TYPE_NAME (TREE_TYPE (decl
)))
23565 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
23568 /* Stop if we run into an explicitly specialized class template. */
23569 if (!DECL_NAMESPACE_SCOPE_P (decl
)
23570 && DECL_CONTEXT (decl
)
23571 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
23574 decl
= DECL_TI_TEMPLATE (decl
);
23580 /* Return the most specialized of the template partial specializations
23581 which can produce TARGET, a specialization of some class or variable
23582 template. The value returned is actually a TREE_LIST; the TREE_VALUE is
23583 a TEMPLATE_DECL node corresponding to the partial specialization, while
23584 the TREE_PURPOSE is the set of template arguments that must be
23585 substituted into the template pattern in order to generate TARGET.
23587 If the choice of partial specialization is ambiguous, a diagnostic
23588 is issued, and the error_mark_node is returned. If there are no
23589 partial specializations matching TARGET, then NULL_TREE is
23590 returned, indicating that the primary template should be used. */
23593 most_specialized_partial_spec (tree target
, tsubst_flags_t complain
)
23595 tree list
= NULL_TREE
;
23600 tree outer_args
= NULL_TREE
;
23603 if (TYPE_P (target
))
23605 tree tinfo
= CLASSTYPE_TEMPLATE_INFO (target
);
23606 tmpl
= TI_TEMPLATE (tinfo
);
23607 args
= TI_ARGS (tinfo
);
23609 else if (TREE_CODE (target
) == TEMPLATE_ID_EXPR
)
23611 tmpl
= TREE_OPERAND (target
, 0);
23612 args
= TREE_OPERAND (target
, 1);
23614 else if (VAR_P (target
))
23616 tree tinfo
= DECL_TEMPLATE_INFO (target
);
23617 tmpl
= TI_TEMPLATE (tinfo
);
23618 args
= TI_ARGS (tinfo
);
23621 gcc_unreachable ();
23623 tree main_tmpl
= most_general_template (tmpl
);
23625 /* For determining which partial specialization to use, only the
23626 innermost args are interesting. */
23627 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
23629 outer_args
= strip_innermost_template_args (args
, 1);
23630 args
= INNERMOST_TEMPLATE_ARGS (args
);
23633 /* The caller hasn't called push_to_top_level yet, but we need
23634 get_partial_spec_bindings to be done in non-template context so that we'll
23635 fully resolve everything. */
23636 processing_template_decl_sentinel ptds
;
23638 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
23641 tree spec_tmpl
= TREE_VALUE (t
);
23645 /* Substitute in the template args from the enclosing class. */
23646 ++processing_template_decl
;
23647 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
23648 --processing_template_decl
;
23651 if (spec_tmpl
== error_mark_node
)
23652 return error_mark_node
;
23654 spec_args
= get_partial_spec_bindings (tmpl
, spec_tmpl
, args
);
23658 spec_args
= add_to_template_args (outer_args
, spec_args
);
23660 /* Keep the candidate only if the constraints are satisfied,
23661 or if we're not compiling with concepts. */
23663 || constraints_satisfied_p (spec_tmpl
, spec_args
))
23665 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
23666 TREE_TYPE (list
) = TREE_TYPE (t
);
23674 ambiguous_p
= false;
23677 t
= TREE_CHAIN (t
);
23678 for (; t
; t
= TREE_CHAIN (t
))
23680 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
23687 t
= TREE_CHAIN (t
);
23690 ambiguous_p
= true;
23699 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
23701 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
23704 ambiguous_p
= true;
23712 char *spaces
= NULL
;
23713 if (!(complain
& tf_error
))
23714 return error_mark_node
;
23715 if (TYPE_P (target
))
23716 error ("ambiguous template instantiation for %q#T", target
);
23718 error ("ambiguous template instantiation for %q#D", target
);
23719 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
23720 for (t
= list
; t
; t
= TREE_CHAIN (t
))
23722 tree subst
= build_tree_list (TREE_VALUE (t
), TREE_PURPOSE (t
));
23723 inform (DECL_SOURCE_LOCATION (TREE_VALUE (t
)),
23724 "%s %#qS", spaces
? spaces
: str
, subst
);
23725 spaces
= spaces
? spaces
: get_spaces (str
);
23728 return error_mark_node
;
23734 /* Explicitly instantiate DECL. */
23737 do_decl_instantiation (tree decl
, tree storage
)
23739 tree result
= NULL_TREE
;
23742 if (!decl
|| decl
== error_mark_node
)
23743 /* An error occurred, for which grokdeclarator has already issued
23744 an appropriate message. */
23746 else if (! DECL_LANG_SPECIFIC (decl
))
23748 error ("explicit instantiation of non-template %q#D", decl
);
23751 else if (DECL_DECLARED_CONCEPT_P (decl
))
23754 error ("explicit instantiation of variable concept %q#D", decl
);
23756 error ("explicit instantiation of function concept %q#D", decl
);
23760 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
23761 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
23763 if (VAR_P (decl
) && !var_templ
)
23765 /* There is an asymmetry here in the way VAR_DECLs and
23766 FUNCTION_DECLs are handled by grokdeclarator. In the case of
23767 the latter, the DECL we get back will be marked as a
23768 template instantiation, and the appropriate
23769 DECL_TEMPLATE_INFO will be set up. This does not happen for
23770 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
23771 should handle VAR_DECLs as it currently handles
23773 if (!DECL_CLASS_SCOPE_P (decl
))
23775 error ("%qD is not a static data member of a class template", decl
);
23778 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
23779 if (!result
|| !VAR_P (result
))
23781 error ("no matching template for %qD found", decl
);
23784 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
23786 error ("type %qT for explicit instantiation %qD does not match "
23787 "declared type %qT", TREE_TYPE (result
), decl
,
23792 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
23794 error ("explicit instantiation of %q#D", decl
);
23800 /* Check for various error cases. Note that if the explicit
23801 instantiation is valid the RESULT will currently be marked as an
23802 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
23803 until we get here. */
23805 if (DECL_TEMPLATE_SPECIALIZATION (result
))
23807 /* DR 259 [temp.spec].
23809 Both an explicit instantiation and a declaration of an explicit
23810 specialization shall not appear in a program unless the explicit
23811 instantiation follows a declaration of the explicit specialization.
23813 For a given set of template parameters, if an explicit
23814 instantiation of a template appears after a declaration of an
23815 explicit specialization for that template, the explicit
23816 instantiation has no effect. */
23819 else if (DECL_EXPLICIT_INSTANTIATION (result
))
23823 No program shall explicitly instantiate any template more
23826 We check DECL_NOT_REALLY_EXTERN so as not to complain when
23827 the first instantiation was `extern' and the second is not,
23828 and EXTERN_P for the opposite case. */
23829 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
23830 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
23831 /* If an "extern" explicit instantiation follows an ordinary
23832 explicit instantiation, the template is instantiated. */
23836 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
23838 error ("no matching template for %qD found", result
);
23841 else if (!DECL_TEMPLATE_INFO (result
))
23843 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
23847 if (storage
== NULL_TREE
)
23849 else if (storage
== ridpointers
[(int) RID_EXTERN
])
23851 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
23852 pedwarn (input_location
, OPT_Wpedantic
,
23853 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
23858 error ("storage class %qD applied to template instantiation", storage
);
23860 check_explicit_instantiation_namespace (result
);
23861 mark_decl_instantiated (result
, extern_p
);
23863 instantiate_decl (result
, /*defer_ok=*/true,
23864 /*expl_inst_class_mem_p=*/false);
23868 mark_class_instantiated (tree t
, int extern_p
)
23870 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
23871 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
23872 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
23873 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
23876 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
23877 rest_of_type_compilation (t
, 1);
23881 /* Called from do_type_instantiation through binding_table_foreach to
23882 do recursive instantiation for the type bound in ENTRY. */
23884 bt_instantiate_type_proc (binding_entry entry
, void *data
)
23886 tree storage
= *(tree
*) data
;
23888 if (MAYBE_CLASS_TYPE_P (entry
->type
)
23889 && CLASSTYPE_TEMPLATE_INFO (entry
->type
)
23890 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
23891 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
23894 /* Perform an explicit instantiation of template class T. STORAGE, if
23895 non-null, is the RID for extern, inline or static. COMPLAIN is
23896 nonzero if this is called from the parser, zero if called recursively,
23897 since the standard is unclear (as detailed below). */
23900 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
23905 int previous_instantiation_extern_p
= 0;
23907 if (TREE_CODE (t
) == TYPE_DECL
)
23910 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
23913 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
23915 error ("explicit instantiation of non-class template %qD", tmpl
);
23917 error ("explicit instantiation of non-template type %qT", t
);
23923 if (!COMPLETE_TYPE_P (t
))
23925 if (complain
& tf_error
)
23926 error ("explicit instantiation of %q#T before definition of template",
23931 if (storage
!= NULL_TREE
)
23933 if (!in_system_header_at (input_location
))
23935 if (storage
== ridpointers
[(int) RID_EXTERN
])
23937 if (cxx_dialect
== cxx98
)
23938 pedwarn (input_location
, OPT_Wpedantic
,
23939 "ISO C++ 1998 forbids the use of %<extern%> on "
23940 "explicit instantiations");
23943 pedwarn (input_location
, OPT_Wpedantic
,
23944 "ISO C++ forbids the use of %qE"
23945 " on explicit instantiations", storage
);
23948 if (storage
== ridpointers
[(int) RID_INLINE
])
23950 else if (storage
== ridpointers
[(int) RID_EXTERN
])
23952 else if (storage
== ridpointers
[(int) RID_STATIC
])
23956 error ("storage class %qD applied to template instantiation",
23962 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
23964 /* DR 259 [temp.spec].
23966 Both an explicit instantiation and a declaration of an explicit
23967 specialization shall not appear in a program unless the explicit
23968 instantiation follows a declaration of the explicit specialization.
23970 For a given set of template parameters, if an explicit
23971 instantiation of a template appears after a declaration of an
23972 explicit specialization for that template, the explicit
23973 instantiation has no effect. */
23976 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
23980 No program shall explicitly instantiate any template more
23983 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
23984 instantiation was `extern'. If EXTERN_P then the second is.
23985 These cases are OK. */
23986 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
23988 if (!previous_instantiation_extern_p
&& !extern_p
23989 && (complain
& tf_error
))
23990 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
23992 /* If we've already instantiated the template, just return now. */
23993 if (!CLASSTYPE_INTERFACE_ONLY (t
))
23997 check_explicit_instantiation_namespace (TYPE_NAME (t
));
23998 mark_class_instantiated (t
, extern_p
);
24003 /* In contrast to implicit instantiation, where only the
24004 declarations, and not the definitions, of members are
24005 instantiated, we have here:
24009 The explicit instantiation of a class template specialization
24010 implies the instantiation of all of its members not
24011 previously explicitly specialized in the translation unit
24012 containing the explicit instantiation.
24014 Of course, we can't instantiate member template classes, since we
24015 don't have any arguments for them. Note that the standard is
24016 unclear on whether the instantiation of the members are
24017 *explicit* instantiations or not. However, the most natural
24018 interpretation is that it should be an explicit
24020 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= DECL_CHAIN (fld
))
24022 || (TREE_CODE (fld
) == FUNCTION_DECL
24024 && user_provided_p (fld
)))
24025 && DECL_TEMPLATE_INSTANTIATION (fld
))
24027 mark_decl_instantiated (fld
, extern_p
);
24029 instantiate_decl (fld
, /*defer_ok=*/true,
24030 /*expl_inst_class_mem_p=*/true);
24033 if (CLASSTYPE_NESTED_UTDS (t
))
24034 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
24035 bt_instantiate_type_proc
, &storage
);
24038 /* Given a function DECL, which is a specialization of TMPL, modify
24039 DECL to be a re-instantiation of TMPL with the same template
24040 arguments. TMPL should be the template into which tsubst'ing
24041 should occur for DECL, not the most general template.
24043 One reason for doing this is a scenario like this:
24046 void f(const T&, int i);
24048 void g() { f(3, 7); }
24051 void f(const T& t, const int i) { }
24053 Note that when the template is first instantiated, with
24054 instantiate_template, the resulting DECL will have no name for the
24055 first parameter, and the wrong type for the second. So, when we go
24056 to instantiate the DECL, we regenerate it. */
24059 regenerate_decl_from_template (tree decl
, tree tmpl
, tree args
)
24061 /* The arguments used to instantiate DECL, from the most general
24065 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
24067 /* Make sure that we can see identifiers, and compute access
24069 push_access_scope (decl
);
24071 if (TREE_CODE (decl
) == FUNCTION_DECL
)
24079 args_depth
= TMPL_ARGS_DEPTH (args
);
24080 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
24081 if (args_depth
> parms_depth
)
24082 args
= get_innermost_template_args (args
, parms_depth
);
24084 /* Instantiate a dynamic exception-specification. noexcept will be
24086 if (tree raises
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (code_pattern
)))
24087 if (TREE_VALUE (raises
))
24089 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
24090 args
, tf_error
, NULL_TREE
,
24091 /*defer_ok*/false);
24092 if (specs
&& specs
!= error_mark_node
)
24093 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
24097 /* Merge parameter declarations. */
24098 decl_parm
= skip_artificial_parms_for (decl
,
24099 DECL_ARGUMENTS (decl
));
24101 = skip_artificial_parms_for (code_pattern
,
24102 DECL_ARGUMENTS (code_pattern
));
24103 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
24108 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
24109 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
24110 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
24112 parm_type
= type_decays_to (parm_type
);
24113 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
24114 TREE_TYPE (decl_parm
) = parm_type
;
24115 attributes
= DECL_ATTRIBUTES (pattern_parm
);
24116 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
24118 DECL_ATTRIBUTES (decl_parm
) = attributes
;
24119 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
24121 decl_parm
= DECL_CHAIN (decl_parm
);
24122 pattern_parm
= DECL_CHAIN (pattern_parm
);
24124 /* Merge any parameters that match with the function parameter
24126 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
24129 tree expanded_types
;
24130 /* Expand the TYPE_PACK_EXPANSION that provides the types for
24131 the parameters in this function parameter pack. */
24132 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
24133 args
, tf_error
, NULL_TREE
);
24134 len
= TREE_VEC_LENGTH (expanded_types
);
24135 for (i
= 0; i
< len
; i
++)
24140 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
24141 /* Rename the parameter to include the index. */
24142 DECL_NAME (decl_parm
) =
24143 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
24144 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
24145 parm_type
= type_decays_to (parm_type
);
24146 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
24147 TREE_TYPE (decl_parm
) = parm_type
;
24148 attributes
= DECL_ATTRIBUTES (pattern_parm
);
24149 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
24151 DECL_ATTRIBUTES (decl_parm
) = attributes
;
24152 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
24154 decl_parm
= DECL_CHAIN (decl_parm
);
24157 /* Merge additional specifiers from the CODE_PATTERN. */
24158 if (DECL_DECLARED_INLINE_P (code_pattern
)
24159 && !DECL_DECLARED_INLINE_P (decl
))
24160 DECL_DECLARED_INLINE_P (decl
) = 1;
24162 maybe_instantiate_noexcept (decl
, tf_error
);
24164 else if (VAR_P (decl
))
24166 start_lambda_scope (decl
);
24167 DECL_INITIAL (decl
) =
24168 tsubst_init (DECL_INITIAL (code_pattern
), decl
, args
,
24169 tf_error
, DECL_TI_TEMPLATE (decl
));
24170 finish_lambda_scope ();
24171 if (VAR_HAD_UNKNOWN_BOUND (decl
))
24172 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
24173 tf_error
, DECL_TI_TEMPLATE (decl
));
24176 gcc_unreachable ();
24178 pop_access_scope (decl
);
24181 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
24182 substituted to get DECL. */
24185 template_for_substitution (tree decl
)
24187 tree tmpl
= DECL_TI_TEMPLATE (decl
);
24189 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
24190 for the instantiation. This is not always the most general
24191 template. Consider, for example:
24194 struct S { template <class U> void f();
24195 template <> void f<int>(); };
24197 and an instantiation of S<double>::f<int>. We want TD to be the
24198 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
24199 while (/* An instantiation cannot have a definition, so we need a
24200 more general template. */
24201 DECL_TEMPLATE_INSTANTIATION (tmpl
)
24202 /* We must also deal with friend templates. Given:
24204 template <class T> struct S {
24205 template <class U> friend void f() {};
24208 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
24209 so far as the language is concerned, but that's still
24210 where we get the pattern for the instantiation from. On
24211 other hand, if the definition comes outside the class, say:
24213 template <class T> struct S {
24214 template <class U> friend void f();
24216 template <class U> friend void f() {}
24218 we don't need to look any further. That's what the check for
24219 DECL_INITIAL is for. */
24220 || (TREE_CODE (decl
) == FUNCTION_DECL
24221 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
24222 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
24224 /* The present template, TD, should not be a definition. If it
24225 were a definition, we should be using it! Note that we
24226 cannot restructure the loop to just keep going until we find
24227 a template with a definition, since that might go too far if
24228 a specialization was declared, but not defined. */
24230 /* Fetch the more general template. */
24231 tmpl
= DECL_TI_TEMPLATE (tmpl
);
24237 /* Returns true if we need to instantiate this template instance even if we
24238 know we aren't going to emit it. */
24241 always_instantiate_p (tree decl
)
24243 /* We always instantiate inline functions so that we can inline them. An
24244 explicit instantiation declaration prohibits implicit instantiation of
24245 non-inline functions. With high levels of optimization, we would
24246 normally inline non-inline functions -- but we're not allowed to do
24247 that for "extern template" functions. Therefore, we check
24248 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
24249 return ((TREE_CODE (decl
) == FUNCTION_DECL
24250 && (DECL_DECLARED_INLINE_P (decl
)
24251 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
24252 /* And we need to instantiate static data members so that
24253 their initializers are available in integral constant
24256 && decl_maybe_constant_var_p (decl
)));
24259 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
24260 instantiate it now, modifying TREE_TYPE (fn). Returns false on
24261 error, true otherwise. */
24264 maybe_instantiate_noexcept (tree fn
, tsubst_flags_t complain
)
24266 tree fntype
, spec
, noex
, clone
;
24268 /* Don't instantiate a noexcept-specification from template context. */
24269 if (processing_template_decl
24270 && (!flag_noexcept_type
|| type_dependent_expression_p (fn
)))
24273 if (DECL_CLONED_FUNCTION_P (fn
))
24274 fn
= DECL_CLONED_FUNCTION (fn
);
24276 tree orig_fn
= NULL_TREE
;
24277 /* For a member friend template we can get a TEMPLATE_DECL. Let's use
24278 its FUNCTION_DECL for the rest of this function -- push_access_scope
24279 doesn't accept TEMPLATE_DECLs. */
24280 if (DECL_FUNCTION_TEMPLATE_P (fn
))
24283 fn
= DECL_TEMPLATE_RESULT (fn
);
24286 fntype
= TREE_TYPE (fn
);
24287 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
24289 if (!spec
|| !TREE_PURPOSE (spec
))
24292 noex
= TREE_PURPOSE (spec
);
24294 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
24296 static hash_set
<tree
>* fns
= new hash_set
<tree
>;
24297 bool added
= false;
24298 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
24300 spec
= get_defaulted_eh_spec (fn
, complain
);
24301 if (spec
== error_mark_node
)
24302 /* This might have failed because of an unparsed DMI, so
24303 let's try again later. */
24306 else if (!(added
= !fns
->add (fn
)))
24308 /* If hash_set::add returns true, the element was already there. */
24309 location_t loc
= cp_expr_loc_or_loc (DEFERRED_NOEXCEPT_PATTERN (noex
),
24310 DECL_SOURCE_LOCATION (fn
));
24312 "exception specification of %qD depends on itself",
24314 spec
= noexcept_false_spec
;
24316 else if (push_tinst_level (fn
))
24318 push_to_top_level ();
24319 push_access_scope (fn
);
24320 push_deferring_access_checks (dk_no_deferred
);
24321 input_location
= DECL_SOURCE_LOCATION (fn
);
24323 /* If needed, set current_class_ptr for the benefit of
24324 tsubst_copy/PARM_DECL. */
24325 tree tdecl
= DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (fn
));
24326 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tdecl
))
24328 tree this_parm
= DECL_ARGUMENTS (tdecl
);
24329 current_class_ptr
= NULL_TREE
;
24330 current_class_ref
= cp_build_fold_indirect_ref (this_parm
);
24331 current_class_ptr
= this_parm
;
24334 /* If this function is represented by a TEMPLATE_DECL, then
24335 the deferred noexcept-specification might still contain
24336 dependent types, even after substitution. And we need the
24337 dependency check functions to work in build_noexcept_spec. */
24339 ++processing_template_decl
;
24341 /* Do deferred instantiation of the noexcept-specifier. */
24342 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
24343 DEFERRED_NOEXCEPT_ARGS (noex
),
24344 tf_warning_or_error
, fn
,
24345 /*function_p=*/false,
24348 /* Build up the noexcept-specification. */
24349 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
24352 --processing_template_decl
;
24354 pop_deferring_access_checks ();
24355 pop_access_scope (fn
);
24356 pop_tinst_level ();
24357 pop_from_top_level ();
24360 spec
= noexcept_false_spec
;
24365 if (spec
== error_mark_node
)
24367 /* This failed with a hard error, so let's go with false. */
24368 gcc_assert (seen_error ());
24369 spec
= noexcept_false_spec
;
24372 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
24374 TREE_TYPE (orig_fn
) = TREE_TYPE (fn
);
24377 FOR_EACH_CLONE (clone
, fn
)
24379 if (TREE_TYPE (clone
) == fntype
)
24380 TREE_TYPE (clone
) = TREE_TYPE (fn
);
24382 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
24388 /* We're starting to process the function INST, an instantiation of PATTERN;
24389 add their parameters to local_specializations. */
24392 register_parameter_specializations (tree pattern
, tree inst
)
24394 tree tmpl_parm
= DECL_ARGUMENTS (pattern
);
24395 tree spec_parm
= DECL_ARGUMENTS (inst
);
24396 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (inst
))
24398 register_local_specialization (spec_parm
, tmpl_parm
);
24399 spec_parm
= skip_artificial_parms_for (inst
, spec_parm
);
24400 tmpl_parm
= skip_artificial_parms_for (pattern
, tmpl_parm
);
24402 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
24404 if (!DECL_PACK_P (tmpl_parm
))
24406 register_local_specialization (spec_parm
, tmpl_parm
);
24407 spec_parm
= DECL_CHAIN (spec_parm
);
24411 /* Register the (value) argument pack as a specialization of
24412 TMPL_PARM, then move on. */
24413 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
24414 register_local_specialization (argpack
, tmpl_parm
);
24417 gcc_assert (!spec_parm
);
24420 /* Produce the definition of D, a _DECL generated from a template. If
24421 DEFER_OK is true, then we don't have to actually do the
24422 instantiation now; we just have to do it sometime. Normally it is
24423 an error if this is an explicit instantiation but D is undefined.
24424 EXPL_INST_CLASS_MEM_P is true iff D is a member of an explicitly
24425 instantiated class template. */
24428 instantiate_decl (tree d
, bool defer_ok
, bool expl_inst_class_mem_p
)
24430 tree tmpl
= DECL_TI_TEMPLATE (d
);
24437 bool pattern_defined
;
24438 location_t saved_loc
= input_location
;
24439 int saved_unevaluated_operand
= cp_unevaluated_operand
;
24440 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
24444 /* This function should only be used to instantiate templates for
24445 functions and static member variables. */
24446 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
24448 /* A concept is never instantiated. */
24449 gcc_assert (!DECL_DECLARED_CONCEPT_P (d
));
24451 /* Variables are never deferred; if instantiation is required, they
24452 are instantiated right away. That allows for better code in the
24453 case that an expression refers to the value of the variable --
24454 if the variable has a constant value the referring expression can
24455 take advantage of that fact. */
24459 /* Don't instantiate cloned functions. Instead, instantiate the
24460 functions they cloned. */
24461 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
24462 d
= DECL_CLONED_FUNCTION (d
);
24464 if (DECL_TEMPLATE_INSTANTIATED (d
)
24465 || (TREE_CODE (d
) == FUNCTION_DECL
24466 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
24467 || DECL_TEMPLATE_SPECIALIZATION (d
))
24468 /* D has already been instantiated or explicitly specialized, so
24469 there's nothing for us to do here.
24471 It might seem reasonable to check whether or not D is an explicit
24472 instantiation, and, if so, stop here. But when an explicit
24473 instantiation is deferred until the end of the compilation,
24474 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
24475 the instantiation. */
24478 /* Check to see whether we know that this template will be
24479 instantiated in some other file, as with "extern template"
24481 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
24483 /* In general, we do not instantiate such templates. */
24484 if (external_p
&& !always_instantiate_p (d
))
24487 gen_tmpl
= most_general_template (tmpl
);
24488 gen_args
= DECL_TI_ARGS (d
);
24490 if (tmpl
!= gen_tmpl
)
24491 /* We should already have the extra args. */
24492 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
24493 == TMPL_ARGS_DEPTH (gen_args
));
24494 /* And what's in the hash table should match D. */
24495 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
24496 || spec
== NULL_TREE
);
24498 /* This needs to happen before any tsubsting. */
24499 if (! push_tinst_level (d
))
24502 timevar_push (TV_TEMPLATE_INST
);
24504 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
24505 for the instantiation. */
24506 td
= template_for_substitution (d
);
24511 /* Look up an explicit specialization, if any. */
24512 tree tid
= lookup_template_variable (gen_tmpl
, gen_args
);
24513 tree elt
= most_specialized_partial_spec (tid
, tf_warning_or_error
);
24514 if (elt
&& elt
!= error_mark_node
)
24516 td
= TREE_VALUE (elt
);
24517 args
= TREE_PURPOSE (elt
);
24521 code_pattern
= DECL_TEMPLATE_RESULT (td
);
24523 /* We should never be trying to instantiate a member of a class
24524 template or partial specialization. */
24525 gcc_assert (d
!= code_pattern
);
24527 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
24528 || DECL_TEMPLATE_SPECIALIZATION (td
))
24529 /* In the case of a friend template whose definition is provided
24530 outside the class, we may have too many arguments. Drop the
24531 ones we don't need. The same is true for specializations. */
24532 args
= get_innermost_template_args
24533 (args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
24535 if (TREE_CODE (d
) == FUNCTION_DECL
)
24537 deleted_p
= DECL_DELETED_FN (code_pattern
);
24538 pattern_defined
= ((DECL_SAVED_TREE (code_pattern
) != NULL_TREE
24539 && DECL_INITIAL (code_pattern
) != error_mark_node
)
24540 || DECL_DEFAULTED_FN (code_pattern
)
24546 if (DECL_CLASS_SCOPE_P (code_pattern
))
24547 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
24549 pattern_defined
= ! DECL_EXTERNAL (code_pattern
);
24552 /* We may be in the middle of deferred access check. Disable it now. */
24553 push_deferring_access_checks (dk_no_deferred
);
24555 /* Unless an explicit instantiation directive has already determined
24556 the linkage of D, remember that a definition is available for
24558 if (pattern_defined
24559 && !DECL_INTERFACE_KNOWN (d
)
24560 && !DECL_NOT_REALLY_EXTERN (d
))
24561 mark_definable (d
);
24563 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
24564 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
24565 input_location
= DECL_SOURCE_LOCATION (d
);
24567 /* If D is a member of an explicitly instantiated class template,
24568 and no definition is available, treat it like an implicit
24570 if (!pattern_defined
&& expl_inst_class_mem_p
24571 && DECL_EXPLICIT_INSTANTIATION (d
))
24573 /* Leave linkage flags alone on instantiations with anonymous
24575 if (TREE_PUBLIC (d
))
24577 DECL_NOT_REALLY_EXTERN (d
) = 0;
24578 DECL_INTERFACE_KNOWN (d
) = 0;
24580 SET_DECL_IMPLICIT_INSTANTIATION (d
);
24583 /* Defer all other templates, unless we have been explicitly
24584 forbidden from doing so. */
24585 if (/* If there is no definition, we cannot instantiate the
24588 /* If it's OK to postpone instantiation, do so. */
24590 /* If this is a static data member that will be defined
24591 elsewhere, we don't want to instantiate the entire data
24592 member, but we do want to instantiate the initializer so that
24593 we can substitute that elsewhere. */
24594 || (external_p
&& VAR_P (d
))
24595 /* Handle here a deleted function too, avoid generating
24596 its body (c++/61080). */
24599 /* The definition of the static data member is now required so
24600 we must substitute the initializer. */
24602 && !DECL_INITIAL (d
)
24603 && DECL_INITIAL (code_pattern
))
24607 bool const_init
= false;
24608 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
24610 ns
= decl_namespace_context (d
);
24611 push_nested_namespace (ns
);
24613 push_nested_class (DECL_CONTEXT (d
));
24614 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
24616 tf_warning_or_error
, NULL_TREE
,
24617 /*integral_constant_expression_p=*/false);
24618 /* If instantiating the initializer involved instantiating this
24619 again, don't call cp_finish_decl twice. */
24620 if (!DECL_INITIAL (d
))
24622 /* Make sure the initializer is still constant, in case of
24623 circular dependency (template/instantiate6.C). */
24625 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
24626 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
24627 /*asmspec_tree=*/NULL_TREE
,
24628 LOOKUP_ONLYCONVERTING
);
24631 pop_nested_class ();
24632 pop_nested_namespace (ns
);
24635 /* We restore the source position here because it's used by
24636 add_pending_template. */
24637 input_location
= saved_loc
;
24639 if (at_eof
&& !pattern_defined
24640 && DECL_EXPLICIT_INSTANTIATION (d
)
24641 && DECL_NOT_REALLY_EXTERN (d
))
24644 The definition of a non-exported function template, a
24645 non-exported member function template, or a non-exported
24646 member function or static data member of a class template
24647 shall be present in every translation unit in which it is
24648 explicitly instantiated. */
24649 permerror (input_location
, "explicit instantiation of %qD "
24650 "but no definition available", d
);
24652 /* If we're in unevaluated context, we just wanted to get the
24653 constant value; this isn't an odr use, so don't queue
24654 a full instantiation. */
24655 if (cp_unevaluated_operand
!= 0)
24657 /* ??? Historically, we have instantiated inline functions, even
24658 when marked as "extern template". */
24659 if (!(external_p
&& VAR_P (d
)))
24660 add_pending_template (d
);
24663 /* Tell the repository that D is available in this translation unit
24664 -- and see if it is supposed to be instantiated here. */
24665 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
24667 /* In a PCH file, despite the fact that the repository hasn't
24668 requested instantiation in the PCH it is still possible that
24669 an instantiation will be required in a file that includes the
24672 add_pending_template (d
);
24673 /* Instantiate inline functions so that the inliner can do its
24674 job, even though we'll not be emitting a copy of this
24676 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
24680 bool push_to_top
, nested
;
24682 fn_context
= decl_function_context (d
);
24683 if (LAMBDA_FUNCTION_P (d
))
24684 /* tsubst_lambda_expr resolved any references to enclosing functions. */
24685 fn_context
= NULL_TREE
;
24686 nested
= current_function_decl
!= NULL_TREE
;
24687 push_to_top
= !(nested
&& fn_context
== current_function_decl
);
24689 vec
<tree
> omp_privatization_save
;
24691 save_omp_privatization_clauses (omp_privatization_save
);
24694 push_to_top_level ();
24697 gcc_assert (!processing_template_decl
);
24698 push_function_context ();
24699 cp_unevaluated_operand
= 0;
24700 c_inhibit_evaluation_warnings
= 0;
24703 /* Mark D as instantiated so that recursive calls to
24704 instantiate_decl do not try to instantiate it again. */
24705 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
24707 /* Regenerate the declaration in case the template has been modified
24708 by a subsequent redeclaration. */
24709 regenerate_decl_from_template (d
, td
, args
);
24711 /* We already set the file and line above. Reset them now in case
24712 they changed as a result of calling regenerate_decl_from_template. */
24713 input_location
= DECL_SOURCE_LOCATION (d
);
24718 bool const_init
= false;
24720 /* Clear out DECL_RTL; whatever was there before may not be right
24721 since we've reset the type of the declaration. */
24722 SET_DECL_RTL (d
, NULL
);
24723 DECL_IN_AGGR_P (d
) = 0;
24725 /* The initializer is placed in DECL_INITIAL by
24726 regenerate_decl_from_template so we don't need to
24727 push/pop_access_scope again here. Pull it out so that
24728 cp_finish_decl can process it. */
24729 init
= DECL_INITIAL (d
);
24730 DECL_INITIAL (d
) = NULL_TREE
;
24731 DECL_INITIALIZED_P (d
) = 0;
24733 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
24734 initializer. That function will defer actual emission until
24735 we have a chance to determine linkage. */
24736 DECL_EXTERNAL (d
) = 0;
24738 /* Enter the scope of D so that access-checking works correctly. */
24739 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
24741 push_nested_class (DECL_CONTEXT (d
));
24743 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
24744 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
24747 pop_nested_class ();
24749 if (variable_template_p (gen_tmpl
))
24750 note_variable_template_instantiation (d
);
24752 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
24753 synthesize_method (d
);
24754 else if (TREE_CODE (d
) == FUNCTION_DECL
)
24756 /* Set up the list of local specializations. */
24757 local_specialization_stack
lss (push_to_top
? lss_blank
: lss_copy
);
24758 tree block
= NULL_TREE
;
24760 /* Set up context. */
24761 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
24762 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
24763 block
= push_stmt_list ();
24765 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
24767 /* Some typedefs referenced from within the template code need to be
24768 access checked at template instantiation time, i.e now. These
24769 types were added to the template at parsing time. Let's get those
24770 and perform the access checks then. */
24771 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (td
),
24774 /* Create substitution entries for the parameters. */
24775 register_parameter_specializations (code_pattern
, d
);
24777 /* Substitute into the body of the function. */
24778 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
24779 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
24780 tf_warning_or_error
, tmpl
);
24783 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
24784 tf_warning_or_error
, tmpl
,
24785 /*integral_constant_expression_p=*/false);
24787 /* Set the current input_location to the end of the function
24788 so that finish_function knows where we are. */
24790 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
24792 /* Remember if we saw an infinite loop in the template. */
24793 current_function_infinite_loop
24794 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
24797 /* Finish the function. */
24798 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
24799 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
24800 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
24803 d
= finish_function (/*inline_p=*/false);
24804 expand_or_defer_fn (d
);
24807 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
24808 cp_check_omp_declare_reduction (d
);
24811 /* We're not deferring instantiation any more. */
24812 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
24815 pop_from_top_level ();
24817 pop_function_context ();
24820 restore_omp_privatization_clauses (omp_privatization_save
);
24823 pop_deferring_access_checks ();
24824 timevar_pop (TV_TEMPLATE_INST
);
24825 pop_tinst_level ();
24826 input_location
= saved_loc
;
24827 cp_unevaluated_operand
= saved_unevaluated_operand
;
24828 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
24833 /* Run through the list of templates that we wish we could
24834 instantiate, and instantiate any we can. RETRIES is the
24835 number of times we retry pending template instantiation. */
24838 instantiate_pending_templates (int retries
)
24841 location_t saved_loc
= input_location
;
24843 /* Instantiating templates may trigger vtable generation. This in turn
24844 may require further template instantiations. We place a limit here
24845 to avoid infinite loop. */
24846 if (pending_templates
&& retries
>= max_tinst_depth
)
24848 tree decl
= pending_templates
->tinst
->maybe_get_node ();
24850 fatal_error (input_location
,
24851 "template instantiation depth exceeds maximum of %d"
24852 " instantiating %q+D, possibly from virtual table generation"
24853 " (use %<-ftemplate-depth=%> to increase the maximum)",
24854 max_tinst_depth
, decl
);
24855 if (TREE_CODE (decl
) == FUNCTION_DECL
)
24856 /* Pretend that we defined it. */
24857 DECL_INITIAL (decl
) = error_mark_node
;
24863 struct pending_template
**t
= &pending_templates
;
24864 struct pending_template
*last
= NULL
;
24868 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
24869 bool complete
= false;
24871 if (TYPE_P (instantiation
))
24873 if (!COMPLETE_TYPE_P (instantiation
))
24875 instantiate_class_template (instantiation
);
24876 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
24877 for (tree fld
= TYPE_FIELDS (instantiation
);
24878 fld
; fld
= TREE_CHAIN (fld
))
24880 || (TREE_CODE (fld
) == FUNCTION_DECL
24881 && !DECL_ARTIFICIAL (fld
)))
24882 && DECL_TEMPLATE_INSTANTIATION (fld
))
24883 instantiate_decl (fld
,
24884 /*defer_ok=*/false,
24885 /*expl_inst_class_mem_p=*/false);
24887 if (COMPLETE_TYPE_P (instantiation
))
24891 complete
= COMPLETE_TYPE_P (instantiation
);
24895 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
24896 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
24899 = instantiate_decl (instantiation
,
24900 /*defer_ok=*/false,
24901 /*expl_inst_class_mem_p=*/false);
24902 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
24906 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
24907 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
24912 /* If INSTANTIATION has been instantiated, then we don't
24913 need to consider it again in the future. */
24914 struct pending_template
*drop
= *t
;
24916 set_refcount_ptr (drop
->tinst
);
24917 pending_template_freelist ().free (drop
);
24925 set_refcount_ptr (current_tinst_level
);
24927 last_pending_template
= last
;
24929 while (reconsider
);
24931 input_location
= saved_loc
;
24934 /* Substitute ARGVEC into T, which is a list of initializers for
24935 either base class or a non-static data member. The TREE_PURPOSEs
24936 are DECLs, and the TREE_VALUEs are the initializer values. Used by
24937 instantiate_decl. */
24940 tsubst_initializer_list (tree t
, tree argvec
)
24942 tree inits
= NULL_TREE
;
24943 tree target_ctor
= error_mark_node
;
24945 for (; t
; t
= TREE_CHAIN (t
))
24949 tree expanded_bases
= NULL_TREE
;
24950 tree expanded_arguments
= NULL_TREE
;
24953 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
24958 /* Expand the base class expansion type into separate base
24960 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
24961 tf_warning_or_error
,
24963 if (expanded_bases
== error_mark_node
)
24966 /* We'll be building separate TREE_LISTs of arguments for
24968 len
= TREE_VEC_LENGTH (expanded_bases
);
24969 expanded_arguments
= make_tree_vec (len
);
24970 for (i
= 0; i
< len
; i
++)
24971 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
24973 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
24974 expand each argument in the TREE_VALUE of t. */
24975 expr
= make_node (EXPR_PACK_EXPANSION
);
24976 PACK_EXPANSION_LOCAL_P (expr
) = true;
24977 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
24978 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
24980 if (TREE_VALUE (t
) == void_type_node
)
24981 /* VOID_TYPE_NODE is used to indicate
24982 value-initialization. */
24984 for (i
= 0; i
< len
; i
++)
24985 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
24989 /* Substitute parameter packs into each argument in the
24991 in_base_initializer
= 1;
24992 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
24994 tree expanded_exprs
;
24996 /* Expand the argument. */
24997 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
24999 = tsubst_pack_expansion (expr
, argvec
,
25000 tf_warning_or_error
,
25002 if (expanded_exprs
== error_mark_node
)
25005 /* Prepend each of the expanded expressions to the
25006 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
25007 for (i
= 0; i
< len
; i
++)
25009 TREE_VEC_ELT (expanded_arguments
, i
) =
25010 tree_cons (NULL_TREE
,
25011 TREE_VEC_ELT (expanded_exprs
, i
),
25012 TREE_VEC_ELT (expanded_arguments
, i
));
25015 in_base_initializer
= 0;
25017 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
25018 since we built them backwards. */
25019 for (i
= 0; i
< len
; i
++)
25021 TREE_VEC_ELT (expanded_arguments
, i
) =
25022 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
25027 for (i
= 0; i
< len
; ++i
)
25029 if (expanded_bases
)
25031 decl
= TREE_VEC_ELT (expanded_bases
, i
);
25032 decl
= expand_member_init (decl
);
25033 init
= TREE_VEC_ELT (expanded_arguments
, i
);
25038 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
25039 tf_warning_or_error
, NULL_TREE
);
25041 decl
= expand_member_init (decl
);
25042 if (decl
&& !DECL_P (decl
))
25043 in_base_initializer
= 1;
25045 init
= TREE_VALUE (t
);
25047 if (init
!= void_type_node
)
25048 init
= tsubst_expr (init
, argvec
,
25049 tf_warning_or_error
, NULL_TREE
,
25050 /*integral_constant_expression_p=*/false);
25051 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
25052 /* If we had an initializer but it instantiated to nothing,
25053 value-initialize the object. This will only occur when
25054 the initializer was a pack expansion where the parameter
25055 packs used in that expansion were of length zero. */
25056 init
= void_type_node
;
25057 in_base_initializer
= 0;
25060 if (target_ctor
!= error_mark_node
25061 && init
!= error_mark_node
)
25063 error ("mem-initializer for %qD follows constructor delegation",
25067 /* Look for a target constructor. */
25068 if (init
!= error_mark_node
25069 && decl
&& CLASS_TYPE_P (decl
)
25070 && same_type_p (decl
, current_class_type
))
25072 maybe_warn_cpp0x (CPP0X_DELEGATING_CTORS
);
25075 error ("constructor delegation follows mem-initializer for %qD",
25076 TREE_PURPOSE (inits
));
25079 target_ctor
= init
;
25084 init
= build_tree_list (decl
, init
);
25085 TREE_CHAIN (init
) = inits
;
25093 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
25096 set_current_access_from_decl (tree decl
)
25098 if (TREE_PRIVATE (decl
))
25099 current_access_specifier
= access_private_node
;
25100 else if (TREE_PROTECTED (decl
))
25101 current_access_specifier
= access_protected_node
;
25103 current_access_specifier
= access_public_node
;
25106 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
25107 is the instantiation (which should have been created with
25108 start_enum) and ARGS are the template arguments to use. */
25111 tsubst_enum (tree tag
, tree newtag
, tree args
)
25115 if (SCOPED_ENUM_P (newtag
))
25116 begin_scope (sk_scoped_enum
, newtag
);
25118 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
25123 decl
= TREE_VALUE (e
);
25124 /* Note that in a template enum, the TREE_VALUE is the
25125 CONST_DECL, not the corresponding INTEGER_CST. */
25126 value
= tsubst_expr (DECL_INITIAL (decl
),
25127 args
, tf_warning_or_error
, NULL_TREE
,
25128 /*integral_constant_expression_p=*/true);
25130 /* Give this enumeration constant the correct access. */
25131 set_current_access_from_decl (decl
);
25133 /* Actually build the enumerator itself. Here we're assuming that
25134 enumerators can't have dependent attributes. */
25135 build_enumerator (DECL_NAME (decl
), value
, newtag
,
25136 DECL_ATTRIBUTES (decl
), DECL_SOURCE_LOCATION (decl
));
25139 if (SCOPED_ENUM_P (newtag
))
25142 finish_enum_value_list (newtag
);
25143 finish_enum (newtag
);
25145 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
25146 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
25149 /* DECL is a FUNCTION_DECL that is a template specialization. Return
25150 its type -- but without substituting the innermost set of template
25151 arguments. So, innermost set of template parameters will appear in
25155 get_mostly_instantiated_function_type (tree decl
)
25157 /* For a function, DECL_TI_TEMPLATE is partially instantiated. */
25158 return TREE_TYPE (DECL_TI_TEMPLATE (decl
));
25161 /* Return truthvalue if we're processing a template different from
25162 the last one involved in diagnostics. */
25164 problematic_instantiation_changed (void)
25166 return current_tinst_level
!= last_error_tinst_level
;
25169 /* Remember current template involved in diagnostics. */
25171 record_last_problematic_instantiation (void)
25173 set_refcount_ptr (last_error_tinst_level
, current_tinst_level
);
25176 struct tinst_level
*
25177 current_instantiation (void)
25179 return current_tinst_level
;
25182 /* Return TRUE if current_function_decl is being instantiated, false
25186 instantiating_current_function_p (void)
25188 return (current_instantiation ()
25189 && (current_instantiation ()->maybe_get_node ()
25190 == current_function_decl
));
25193 /* [temp.param] Check that template non-type parm TYPE is of an allowable
25194 type. Return false for ok, true for disallowed. Issue error and
25195 inform messages under control of COMPLAIN. */
25198 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
25200 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
25202 else if (TYPE_PTR_P (type
))
25204 else if (TYPE_REF_P (type
)
25205 && !TYPE_REF_IS_RVALUE (type
))
25207 else if (TYPE_PTRMEM_P (type
))
25209 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
25211 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
25213 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
25215 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
25217 /* A bound template template parm could later be instantiated to have a valid
25218 nontype parm type via an alias template. */
25219 else if (cxx_dialect
>= cxx11
25220 && TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
25222 else if (CLASS_TYPE_P (type
))
25224 if (cxx_dialect
< cxx2a
)
25226 error ("non-type template parameters of class type only available "
25227 "with %<-std=c++2a%> or %<-std=gnu++2a%>");
25230 if (dependent_type_p (type
))
25232 if (!complete_type_or_else (type
, NULL_TREE
))
25234 if (!literal_type_p (type
))
25236 error ("%qT is not a valid type for a template non-type parameter "
25237 "because it is not literal", type
);
25238 explain_non_literal_class (type
);
25241 if (cp_has_mutable_p (type
))
25243 error ("%qT is not a valid type for a template non-type parameter "
25244 "because it has a mutable member", type
);
25247 /* FIXME check op<=> and strong structural equality once spaceship is
25252 if (complain
& tf_error
)
25254 if (type
== error_mark_node
)
25255 inform (input_location
, "invalid template non-type parameter");
25257 error ("%q#T is not a valid type for a template non-type parameter",
25263 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
25264 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
25267 dependent_type_p_r (tree type
)
25273 A type is dependent if it is:
25275 -- a template parameter. Template template parameters are types
25276 for us (since TYPE_P holds true for them) so we handle
25278 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
25279 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
25281 /* -- a qualified-id with a nested-name-specifier which contains a
25282 class-name that names a dependent type or whose unqualified-id
25283 names a dependent type. */
25284 if (TREE_CODE (type
) == TYPENAME_TYPE
)
25287 /* An alias template specialization can be dependent even if the
25288 resulting type is not. */
25289 if (dependent_alias_template_spec_p (type
))
25292 /* -- a cv-qualified type where the cv-unqualified type is
25294 No code is necessary for this bullet; the code below handles
25295 cv-qualified types, and we don't want to strip aliases with
25296 TYPE_MAIN_VARIANT because of DR 1558. */
25297 /* -- a compound type constructed from any dependent type. */
25298 if (TYPE_PTRMEM_P (type
))
25299 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
25300 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
25302 else if (INDIRECT_TYPE_P (type
))
25303 return dependent_type_p (TREE_TYPE (type
));
25304 else if (FUNC_OR_METHOD_TYPE_P (type
))
25308 if (dependent_type_p (TREE_TYPE (type
)))
25310 for (arg_type
= TYPE_ARG_TYPES (type
);
25312 arg_type
= TREE_CHAIN (arg_type
))
25313 if (dependent_type_p (TREE_VALUE (arg_type
)))
25315 if (cxx_dialect
>= cxx17
)
25316 /* A value-dependent noexcept-specifier makes the type dependent. */
25317 if (tree spec
= TYPE_RAISES_EXCEPTIONS (type
))
25318 if (tree noex
= TREE_PURPOSE (spec
))
25319 /* Treat DEFERRED_NOEXCEPT as non-dependent, since it doesn't
25320 affect overload resolution and treating it as dependent breaks
25321 things. Same for an unparsed noexcept expression. */
25322 if (TREE_CODE (noex
) != DEFERRED_NOEXCEPT
25323 && TREE_CODE (noex
) != DEFERRED_PARSE
25324 && value_dependent_expression_p (noex
))
25328 /* -- an array type constructed from any dependent type or whose
25329 size is specified by a constant expression that is
25332 We checked for type- and value-dependence of the bounds in
25333 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
25334 if (TREE_CODE (type
) == ARRAY_TYPE
)
25336 if (TYPE_DOMAIN (type
)
25337 && dependent_type_p (TYPE_DOMAIN (type
)))
25339 return dependent_type_p (TREE_TYPE (type
));
25342 /* -- a template-id in which either the template name is a template
25344 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
25346 /* ... or any of the template arguments is a dependent type or
25347 an expression that is type-dependent or value-dependent. */
25348 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
25349 && (any_dependent_template_arguments_p
25350 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
25353 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
25354 dependent; if the argument of the `typeof' expression is not
25355 type-dependent, then it should already been have resolved. */
25356 if (TREE_CODE (type
) == TYPEOF_TYPE
25357 || TREE_CODE (type
) == DECLTYPE_TYPE
25358 || TREE_CODE (type
) == UNDERLYING_TYPE
)
25361 /* A template argument pack is dependent if any of its packed
25363 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
25365 tree args
= ARGUMENT_PACK_ARGS (type
);
25366 int i
, len
= TREE_VEC_LENGTH (args
);
25367 for (i
= 0; i
< len
; ++i
)
25368 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
25372 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
25373 be template parameters. */
25374 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
25377 if (any_dependent_type_attributes_p (TYPE_ATTRIBUTES (type
)))
25380 /* The standard does not specifically mention types that are local
25381 to template functions or local classes, but they should be
25382 considered dependent too. For example:
25384 template <int I> void f() {
25389 The size of `E' cannot be known until the value of `I' has been
25390 determined. Therefore, `E' must be considered dependent. */
25391 scope
= TYPE_CONTEXT (type
);
25392 if (scope
&& TYPE_P (scope
))
25393 return dependent_type_p (scope
);
25394 /* Don't use type_dependent_expression_p here, as it can lead
25395 to infinite recursion trying to determine whether a lambda
25396 nested in a lambda is dependent (c++/47687). */
25397 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
25398 && DECL_LANG_SPECIFIC (scope
)
25399 && DECL_TEMPLATE_INFO (scope
)
25400 && (any_dependent_template_arguments_p
25401 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
25404 /* Other types are non-dependent. */
25408 /* Returns TRUE if TYPE is dependent, in the sense of
25409 [temp.dep.type]. Note that a NULL type is considered dependent. */
25412 dependent_type_p (tree type
)
25414 /* If there are no template parameters in scope, then there can't be
25415 any dependent types. */
25416 if (!processing_template_decl
)
25418 /* If we are not processing a template, then nobody should be
25419 providing us with a dependent type. */
25421 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
25425 /* If the type is NULL, we have not computed a type for the entity
25426 in question; in that case, the type is dependent. */
25430 /* Erroneous types can be considered non-dependent. */
25431 if (type
== error_mark_node
)
25434 /* Getting here with global_type_node means we improperly called this
25435 function on the TREE_TYPE of an IDENTIFIER_NODE. */
25436 gcc_checking_assert (type
!= global_type_node
);
25438 /* If we have not already computed the appropriate value for TYPE,
25440 if (!TYPE_DEPENDENT_P_VALID (type
))
25442 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
25443 TYPE_DEPENDENT_P_VALID (type
) = 1;
25446 return TYPE_DEPENDENT_P (type
);
25449 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
25450 lookup. In other words, a dependent type that is not the current
25454 dependent_scope_p (tree scope
)
25456 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
25457 && !currently_open_class (scope
));
25460 /* T is a SCOPE_REF. Return whether it represents a non-static member of
25461 an unknown base of 'this' (and is therefore instantiation-dependent). */
25464 unknown_base_ref_p (tree t
)
25466 if (!current_class_ptr
)
25469 tree mem
= TREE_OPERAND (t
, 1);
25470 if (shared_member_p (mem
))
25473 tree cur
= current_nonlambda_class_type ();
25474 if (!any_dependent_bases_p (cur
))
25477 tree ctx
= TREE_OPERAND (t
, 0);
25478 if (DERIVED_FROM_P (ctx
, cur
))
25484 /* T is a SCOPE_REF; return whether we need to consider it
25485 instantiation-dependent so that we can check access at instantiation
25486 time even though we know which member it resolves to. */
25489 instantiation_dependent_scope_ref_p (tree t
)
25491 if (DECL_P (TREE_OPERAND (t
, 1))
25492 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
25493 && !unknown_base_ref_p (t
)
25494 && accessible_in_template_p (TREE_OPERAND (t
, 0),
25495 TREE_OPERAND (t
, 1)))
25501 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
25502 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
25505 /* Note that this predicate is not appropriate for general expressions;
25506 only constant expressions (that satisfy potential_constant_expression)
25507 can be tested for value dependence. */
25510 value_dependent_expression_p (tree expression
)
25512 if (!processing_template_decl
|| expression
== NULL_TREE
)
25515 /* A type-dependent expression is also value-dependent. */
25516 if (type_dependent_expression_p (expression
))
25519 switch (TREE_CODE (expression
))
25522 /* A dependent member function of the current instantiation. */
25523 return dependent_type_p (BINFO_TYPE (BASELINK_BINFO (expression
)));
25525 case FUNCTION_DECL
:
25526 /* A dependent member function of the current instantiation. */
25527 if (DECL_CLASS_SCOPE_P (expression
)
25528 && dependent_type_p (DECL_CONTEXT (expression
)))
25532 case IDENTIFIER_NODE
:
25533 /* A name that has not been looked up -- must be dependent. */
25536 case TEMPLATE_PARM_INDEX
:
25537 /* A non-type template parm. */
25541 /* A non-type template parm. */
25542 if (DECL_TEMPLATE_PARM_P (expression
))
25544 return value_dependent_expression_p (DECL_INITIAL (expression
));
25547 /* A constant with literal type and is initialized
25548 with an expression that is value-dependent. */
25549 if (DECL_DEPENDENT_INIT_P (expression
)
25550 /* FIXME cp_finish_decl doesn't fold reference initializers. */
25551 || TYPE_REF_P (TREE_TYPE (expression
)))
25553 if (DECL_HAS_VALUE_EXPR_P (expression
))
25555 tree value_expr
= DECL_VALUE_EXPR (expression
);
25556 if (value_dependent_expression_p (value_expr
)
25557 /* __PRETTY_FUNCTION__ inside a template function is dependent
25558 on the name of the function. */
25559 || (DECL_PRETTY_FUNCTION_P (expression
)
25560 /* It might be used in a template, but not a template
25561 function, in which case its DECL_VALUE_EXPR will be
25563 && value_expr
== error_mark_node
))
25568 case DYNAMIC_CAST_EXPR
:
25569 case STATIC_CAST_EXPR
:
25570 case CONST_CAST_EXPR
:
25571 case REINTERPRET_CAST_EXPR
:
25573 case IMPLICIT_CONV_EXPR
:
25574 /* These expressions are value-dependent if the type to which
25575 the cast occurs is dependent or the expression being casted
25576 is value-dependent. */
25578 tree type
= TREE_TYPE (expression
);
25580 if (dependent_type_p (type
))
25583 /* A functional cast has a list of operands. */
25584 expression
= TREE_OPERAND (expression
, 0);
25587 /* If there are no operands, it must be an expression such
25588 as "int()". This should not happen for aggregate types
25589 because it would form non-constant expressions. */
25590 gcc_assert (cxx_dialect
>= cxx11
25591 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
25596 if (TREE_CODE (expression
) == TREE_LIST
)
25597 return any_value_dependent_elements_p (expression
);
25599 return value_dependent_expression_p (expression
);
25603 if (SIZEOF_EXPR_TYPE_P (expression
))
25604 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
25608 /* A `sizeof' expression is value-dependent if the operand is
25609 type-dependent or is a pack expansion. */
25610 expression
= TREE_OPERAND (expression
, 0);
25611 if (PACK_EXPANSION_P (expression
))
25613 else if (TYPE_P (expression
))
25614 return dependent_type_p (expression
);
25615 return instantiation_dependent_uneval_expression_p (expression
);
25617 case AT_ENCODE_EXPR
:
25618 /* An 'encode' expression is value-dependent if the operand is
25620 expression
= TREE_OPERAND (expression
, 0);
25621 return dependent_type_p (expression
);
25623 case NOEXCEPT_EXPR
:
25624 expression
= TREE_OPERAND (expression
, 0);
25625 return instantiation_dependent_uneval_expression_p (expression
);
25628 /* All instantiation-dependent expressions should also be considered
25629 value-dependent. */
25630 return instantiation_dependent_scope_ref_p (expression
);
25632 case COMPONENT_REF
:
25633 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
25634 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
25636 case NONTYPE_ARGUMENT_PACK
:
25637 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
25638 is value-dependent. */
25640 tree values
= ARGUMENT_PACK_ARGS (expression
);
25641 int i
, len
= TREE_VEC_LENGTH (values
);
25643 for (i
= 0; i
< len
; ++i
)
25644 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
25652 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
25654 if (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
)))
25660 if (TREE_CODE (type2
) != TREE_LIST
)
25661 return dependent_type_p (type2
);
25663 for (; type2
; type2
= TREE_CHAIN (type2
))
25664 if (dependent_type_p (TREE_VALUE (type2
)))
25671 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
25672 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
25675 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
25676 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
25680 tree op
= TREE_OPERAND (expression
, 0);
25681 return (value_dependent_expression_p (op
)
25682 || has_value_dependent_address (op
));
25685 case REQUIRES_EXPR
:
25686 /* Treat all requires-expressions as value-dependent so
25687 we don't try to fold them. */
25691 return dependent_type_p (TREE_OPERAND (expression
, 0));
25695 if (value_dependent_expression_p (CALL_EXPR_FN (expression
)))
25697 tree fn
= get_callee_fndecl (expression
);
25699 nargs
= call_expr_nargs (expression
);
25700 for (i
= 0; i
< nargs
; ++i
)
25702 tree op
= CALL_EXPR_ARG (expression
, i
);
25703 /* In a call to a constexpr member function, look through the
25704 implicit ADDR_EXPR on the object argument so that it doesn't
25705 cause the call to be considered value-dependent. We also
25706 look through it in potential_constant_expression. */
25707 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
25708 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
25709 && TREE_CODE (op
) == ADDR_EXPR
)
25710 op
= TREE_OPERAND (op
, 0);
25711 if (value_dependent_expression_p (op
))
25717 case TEMPLATE_ID_EXPR
:
25718 return variable_concept_p (TREE_OPERAND (expression
, 0));
25724 if (dependent_type_p (TREE_TYPE (expression
)))
25726 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
25727 if (value_dependent_expression_p (val
))
25733 /* Treat a GNU statement expression as dependent to avoid crashing
25734 under instantiate_non_dependent_expr; it can't be constant. */
25738 /* A constant expression is value-dependent if any subexpression is
25739 value-dependent. */
25740 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
25742 case tcc_reference
:
25744 case tcc_comparison
:
25746 case tcc_expression
:
25749 int i
, len
= cp_tree_operand_length (expression
);
25751 for (i
= 0; i
< len
; i
++)
25753 tree t
= TREE_OPERAND (expression
, i
);
25755 /* In some cases, some of the operands may be missing.
25756 (For example, in the case of PREDECREMENT_EXPR, the
25757 amount to increment by may be missing.) That doesn't
25758 make the expression dependent. */
25759 if (t
&& value_dependent_expression_p (t
))
25770 /* The expression is not value-dependent. */
25774 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
25775 [temp.dep.expr]. Note that an expression with no type is
25776 considered dependent. Other parts of the compiler arrange for an
25777 expression with type-dependent subexpressions to have no type, so
25778 this function doesn't have to be fully recursive. */
25781 type_dependent_expression_p (tree expression
)
25783 if (!processing_template_decl
)
25786 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
25789 STRIP_ANY_LOCATION_WRAPPER (expression
);
25791 /* An unresolved name is always dependent. */
25792 if (identifier_p (expression
)
25793 || TREE_CODE (expression
) == USING_DECL
25794 || TREE_CODE (expression
) == WILDCARD_DECL
)
25797 /* A lambda-expression in template context is dependent. dependent_type_p is
25798 true for a lambda in the scope of a class or function template, but that
25799 doesn't cover all template contexts, like a default template argument. */
25800 if (TREE_CODE (expression
) == LAMBDA_EXPR
)
25803 /* A fold expression is type-dependent. */
25804 if (TREE_CODE (expression
) == UNARY_LEFT_FOLD_EXPR
25805 || TREE_CODE (expression
) == UNARY_RIGHT_FOLD_EXPR
25806 || TREE_CODE (expression
) == BINARY_LEFT_FOLD_EXPR
25807 || TREE_CODE (expression
) == BINARY_RIGHT_FOLD_EXPR
)
25810 /* Some expression forms are never type-dependent. */
25811 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
25812 || TREE_CODE (expression
) == SIZEOF_EXPR
25813 || TREE_CODE (expression
) == ALIGNOF_EXPR
25814 || TREE_CODE (expression
) == AT_ENCODE_EXPR
25815 || TREE_CODE (expression
) == NOEXCEPT_EXPR
25816 || TREE_CODE (expression
) == TRAIT_EXPR
25817 || TREE_CODE (expression
) == TYPEID_EXPR
25818 || TREE_CODE (expression
) == DELETE_EXPR
25819 || TREE_CODE (expression
) == VEC_DELETE_EXPR
25820 || TREE_CODE (expression
) == THROW_EXPR
25821 || TREE_CODE (expression
) == REQUIRES_EXPR
)
25824 /* The types of these expressions depends only on the type to which
25825 the cast occurs. */
25826 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
25827 || TREE_CODE (expression
) == STATIC_CAST_EXPR
25828 || TREE_CODE (expression
) == CONST_CAST_EXPR
25829 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
25830 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
25831 || TREE_CODE (expression
) == CAST_EXPR
)
25832 return dependent_type_p (TREE_TYPE (expression
));
25834 /* The types of these expressions depends only on the type created
25835 by the expression. */
25836 if (TREE_CODE (expression
) == NEW_EXPR
25837 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
25839 /* For NEW_EXPR tree nodes created inside a template, either
25840 the object type itself or a TREE_LIST may appear as the
25842 tree type
= TREE_OPERAND (expression
, 1);
25843 if (TREE_CODE (type
) == TREE_LIST
)
25844 /* This is an array type. We need to check array dimensions
25846 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
25847 || value_dependent_expression_p
25848 (TREE_OPERAND (TREE_VALUE (type
), 1));
25850 return dependent_type_p (type
);
25853 if (TREE_CODE (expression
) == SCOPE_REF
)
25855 tree scope
= TREE_OPERAND (expression
, 0);
25856 tree name
= TREE_OPERAND (expression
, 1);
25858 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
25859 contains an identifier associated by name lookup with one or more
25860 declarations declared with a dependent type, or...a
25861 nested-name-specifier or qualified-id that names a member of an
25862 unknown specialization. */
25863 return (type_dependent_expression_p (name
)
25864 || dependent_scope_p (scope
));
25867 if (TREE_CODE (expression
) == TEMPLATE_DECL
25868 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
25869 return uses_outer_template_parms (expression
);
25871 if (TREE_CODE (expression
) == STMT_EXPR
)
25872 expression
= stmt_expr_value_expr (expression
);
25874 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
25879 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
25881 if (type_dependent_expression_p (elt
))
25887 /* A static data member of the current instantiation with incomplete
25888 array type is type-dependent, as the definition and specializations
25889 can have different bounds. */
25890 if (VAR_P (expression
)
25891 && DECL_CLASS_SCOPE_P (expression
)
25892 && dependent_type_p (DECL_CONTEXT (expression
))
25893 && VAR_HAD_UNKNOWN_BOUND (expression
))
25896 /* An array of unknown bound depending on a variadic parameter, eg:
25898 template<typename... Args>
25899 void foo (Args... args)
25901 int arr[] = { args... };
25904 template<int... vals>
25907 int arr[] = { vals... };
25910 If the array has no length and has an initializer, it must be that
25911 we couldn't determine its length in cp_complete_array_type because
25912 it is dependent. */
25913 if (VAR_P (expression
)
25914 && TREE_TYPE (expression
) != NULL_TREE
25915 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
25916 && !TYPE_DOMAIN (TREE_TYPE (expression
))
25917 && DECL_INITIAL (expression
))
25920 /* A function or variable template-id is type-dependent if it has any
25921 dependent template arguments. */
25922 if (VAR_OR_FUNCTION_DECL_P (expression
)
25923 && DECL_LANG_SPECIFIC (expression
)
25924 && DECL_TEMPLATE_INFO (expression
))
25926 /* Consider the innermost template arguments, since those are the ones
25927 that come from the template-id; the template arguments for the
25928 enclosing class do not make it type-dependent unless they are used in
25929 the type of the decl. */
25930 if (instantiates_primary_template_p (expression
)
25931 && (any_dependent_template_arguments_p
25932 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
25936 /* Otherwise, if the function decl isn't from a dependent scope, it can't be
25937 type-dependent. Checking this is important for functions with auto return
25938 type, which looks like a dependent type. */
25939 if (TREE_CODE (expression
) == FUNCTION_DECL
25940 && !(DECL_CLASS_SCOPE_P (expression
)
25941 && dependent_type_p (DECL_CONTEXT (expression
)))
25942 && !(DECL_LANG_SPECIFIC (expression
)
25943 && DECL_FRIEND_P (expression
)
25944 && (!DECL_FRIEND_CONTEXT (expression
)
25945 || dependent_type_p (DECL_FRIEND_CONTEXT (expression
))))
25946 && !DECL_LOCAL_FUNCTION_P (expression
))
25948 gcc_assert (!dependent_type_p (TREE_TYPE (expression
))
25949 || undeduced_auto_decl (expression
));
25953 /* Always dependent, on the number of arguments if nothing else. */
25954 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
25957 if (TREE_TYPE (expression
) == unknown_type_node
)
25959 if (TREE_CODE (expression
) == ADDR_EXPR
)
25960 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
25961 if (TREE_CODE (expression
) == COMPONENT_REF
25962 || TREE_CODE (expression
) == OFFSET_REF
)
25964 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
25966 expression
= TREE_OPERAND (expression
, 1);
25967 if (identifier_p (expression
))
25970 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
25971 if (TREE_CODE (expression
) == SCOPE_REF
)
25974 if (BASELINK_P (expression
))
25976 if (BASELINK_OPTYPE (expression
)
25977 && dependent_type_p (BASELINK_OPTYPE (expression
)))
25979 expression
= BASELINK_FUNCTIONS (expression
);
25982 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
25984 if (any_dependent_template_arguments_p
25985 (TREE_OPERAND (expression
, 1)))
25987 expression
= TREE_OPERAND (expression
, 0);
25988 if (identifier_p (expression
))
25992 gcc_assert (OVL_P (expression
));
25994 for (lkp_iterator
iter (expression
); iter
; ++iter
)
25995 if (type_dependent_expression_p (*iter
))
26001 /* The type of a non-type template parm declared with a placeholder type
26002 depends on the corresponding template argument, even though
26003 placeholders are not normally considered dependent. */
26004 if (TREE_CODE (expression
) == TEMPLATE_PARM_INDEX
26005 && is_auto (TREE_TYPE (expression
)))
26008 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
26010 /* Dependent type attributes might not have made it from the decl to
26012 if (DECL_P (expression
)
26013 && any_dependent_type_attributes_p (DECL_ATTRIBUTES (expression
)))
26016 return (dependent_type_p (TREE_TYPE (expression
)));
26019 /* [temp.dep.expr]/5: A class member access expression (5.2.5) is
26020 type-dependent if the expression refers to a member of the current
26021 instantiation and the type of the referenced member is dependent, or the
26022 class member access expression refers to a member of an unknown
26025 This function returns true if the OBJECT in such a class member access
26026 expression is of an unknown specialization. */
26029 type_dependent_object_expression_p (tree object
)
26031 /* An IDENTIFIER_NODE can sometimes have a TREE_TYPE, but it's still
26033 if (TREE_CODE (object
) == IDENTIFIER_NODE
)
26035 tree scope
= TREE_TYPE (object
);
26036 return (!scope
|| dependent_scope_p (scope
));
26039 /* walk_tree callback function for instantiation_dependent_expression_p,
26040 below. Returns non-zero if a dependent subexpression is found. */
26043 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
26048 /* We don't have to worry about decltype currently because decltype
26049 of an instantiation-dependent expr is a dependent type. This
26050 might change depending on the resolution of DR 1172. */
26051 *walk_subtrees
= false;
26054 enum tree_code code
= TREE_CODE (*tp
);
26057 /* Don't treat an argument list as dependent just because it has no
26061 case NONTYPE_ARGUMENT_PACK
:
26064 case TEMPLATE_PARM_INDEX
:
26065 if (dependent_type_p (TREE_TYPE (*tp
)))
26067 if (TEMPLATE_PARM_PARAMETER_PACK (*tp
))
26069 /* We'll check value-dependence separately. */
26072 /* Handle expressions with type operands. */
26076 case AT_ENCODE_EXPR
:
26078 tree op
= TREE_OPERAND (*tp
, 0);
26079 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
26080 op
= TREE_TYPE (op
);
26083 if (dependent_type_p (op
))
26087 *walk_subtrees
= false;
26094 case COMPONENT_REF
:
26095 if (identifier_p (TREE_OPERAND (*tp
, 1)))
26096 /* In a template, finish_class_member_access_expr creates a
26097 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
26098 type-dependent, so that we can check access control at
26099 instantiation time (PR 42277). See also Core issue 1273. */
26104 if (instantiation_dependent_scope_ref_p (*tp
))
26109 /* Treat statement-expressions as dependent. */
26113 /* Treat requires-expressions as dependent. */
26114 case REQUIRES_EXPR
:
26118 /* Treat calls to function concepts as dependent. */
26119 if (function_concept_check_p (*tp
))
26123 case TEMPLATE_ID_EXPR
:
26124 /* And variable concepts. */
26125 if (variable_concept_p (TREE_OPERAND (*tp
, 0)))
26130 if (CONSTRUCTOR_IS_DEPENDENT (*tp
))
26138 if (type_dependent_expression_p (*tp
))
26144 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
26145 sense defined by the ABI:
26147 "An expression is instantiation-dependent if it is type-dependent
26148 or value-dependent, or it has a subexpression that is type-dependent
26149 or value-dependent."
26151 Except don't actually check value-dependence for unevaluated expressions,
26152 because in sizeof(i) we don't care about the value of i. Checking
26153 type-dependence will in turn check value-dependence of array bounds/template
26154 arguments as needed. */
26157 instantiation_dependent_uneval_expression_p (tree expression
)
26161 if (!processing_template_decl
)
26164 if (expression
== error_mark_node
)
26167 result
= cp_walk_tree_without_duplicates (&expression
,
26168 instantiation_dependent_r
, NULL
);
26169 return result
!= NULL_TREE
;
26172 /* As above, but also check value-dependence of the expression as a whole. */
26175 instantiation_dependent_expression_p (tree expression
)
26177 return (instantiation_dependent_uneval_expression_p (expression
)
26178 || value_dependent_expression_p (expression
));
26181 /* Like type_dependent_expression_p, but it also works while not processing
26182 a template definition, i.e. during substitution or mangling. */
26185 type_dependent_expression_p_push (tree expr
)
26188 ++processing_template_decl
;
26189 b
= type_dependent_expression_p (expr
);
26190 --processing_template_decl
;
26194 /* Returns TRUE if ARGS contains a type-dependent expression. */
26197 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
26202 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
26204 if (type_dependent_expression_p (arg
))
26210 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
26211 expressions) contains any type-dependent expressions. */
26214 any_type_dependent_elements_p (const_tree list
)
26216 for (; list
; list
= TREE_CHAIN (list
))
26217 if (type_dependent_expression_p (TREE_VALUE (list
)))
26223 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
26224 expressions) contains any value-dependent expressions. */
26227 any_value_dependent_elements_p (const_tree list
)
26229 for (; list
; list
= TREE_CHAIN (list
))
26230 if (value_dependent_expression_p (TREE_VALUE (list
)))
26236 /* Returns TRUE if the ARG (a template argument) is dependent. */
26239 dependent_template_arg_p (tree arg
)
26241 if (!processing_template_decl
)
26244 /* Assume a template argument that was wrongly written by the user
26245 is dependent. This is consistent with what
26246 any_dependent_template_arguments_p [that calls this function]
26248 if (!arg
|| arg
== error_mark_node
)
26251 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
26252 arg
= argument_pack_select_arg (arg
);
26254 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
26256 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
26258 if (DECL_TEMPLATE_PARM_P (arg
))
26260 /* A member template of a dependent class is not necessarily
26261 type-dependent, but it is a dependent template argument because it
26262 will be a member of an unknown specialization to that template. */
26263 tree scope
= CP_DECL_CONTEXT (arg
);
26264 return TYPE_P (scope
) && dependent_type_p (scope
);
26266 else if (ARGUMENT_PACK_P (arg
))
26268 tree args
= ARGUMENT_PACK_ARGS (arg
);
26269 int i
, len
= TREE_VEC_LENGTH (args
);
26270 for (i
= 0; i
< len
; ++i
)
26272 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
26278 else if (TYPE_P (arg
))
26279 return dependent_type_p (arg
);
26281 return (type_dependent_expression_p (arg
)
26282 || value_dependent_expression_p (arg
));
26285 /* Returns true if ARGS (a collection of template arguments) contains
26286 any types that require structural equality testing. */
26289 any_template_arguments_need_structural_equality_p (tree args
)
26296 if (args
== error_mark_node
)
26299 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
26301 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
26302 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
26304 tree arg
= TREE_VEC_ELT (level
, j
);
26305 tree packed_args
= NULL_TREE
;
26308 if (ARGUMENT_PACK_P (arg
))
26310 /* Look inside the argument pack. */
26311 packed_args
= ARGUMENT_PACK_ARGS (arg
);
26312 len
= TREE_VEC_LENGTH (packed_args
);
26315 for (k
= 0; k
< len
; ++k
)
26318 arg
= TREE_VEC_ELT (packed_args
, k
);
26320 if (error_operand_p (arg
))
26322 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
26324 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
26326 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
26327 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
26336 /* Returns true if ARGS (a collection of template arguments) contains
26337 any dependent arguments. */
26340 any_dependent_template_arguments_p (const_tree args
)
26347 if (args
== error_mark_node
)
26350 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
26352 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
26353 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
26354 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
26361 /* Returns true if ARGS contains any errors. */
26364 any_erroneous_template_args_p (const_tree args
)
26369 if (args
== error_mark_node
)
26372 if (args
&& TREE_CODE (args
) != TREE_VEC
)
26374 if (tree ti
= get_template_info (args
))
26375 args
= TI_ARGS (ti
);
26383 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
26385 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
26386 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
26387 if (error_operand_p (TREE_VEC_ELT (level
, j
)))
26394 /* Returns TRUE if the template TMPL is type-dependent. */
26397 dependent_template_p (tree tmpl
)
26399 if (TREE_CODE (tmpl
) == OVERLOAD
)
26401 for (lkp_iterator
iter (tmpl
); iter
; ++iter
)
26402 if (dependent_template_p (*iter
))
26407 /* Template template parameters are dependent. */
26408 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
26409 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
26411 /* So are names that have not been looked up. */
26412 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
26417 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
26420 dependent_template_id_p (tree tmpl
, tree args
)
26422 return (dependent_template_p (tmpl
)
26423 || any_dependent_template_arguments_p (args
));
26426 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
26430 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
26434 if (!processing_template_decl
)
26437 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
26439 tree decl
= TREE_VEC_ELT (declv
, i
);
26440 tree init
= TREE_VEC_ELT (initv
, i
);
26441 tree cond
= TREE_VEC_ELT (condv
, i
);
26442 tree incr
= TREE_VEC_ELT (incrv
, i
);
26444 if (type_dependent_expression_p (decl
)
26445 || TREE_CODE (decl
) == SCOPE_REF
)
26448 if (init
&& type_dependent_expression_p (init
))
26451 if (cond
== global_namespace
)
26454 if (type_dependent_expression_p (cond
))
26457 if (COMPARISON_CLASS_P (cond
)
26458 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
26459 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
26462 if (TREE_CODE (incr
) == MODOP_EXPR
)
26464 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
26465 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
26468 else if (type_dependent_expression_p (incr
))
26470 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
26472 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
26474 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
26476 tree t
= TREE_OPERAND (incr
, 1);
26477 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
26478 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
26481 /* If this loop has a class iterator with != comparison
26482 with increment other than i++/++i/i--/--i, make sure the
26483 increment is constant. */
26484 if (CLASS_TYPE_P (TREE_TYPE (decl
))
26485 && TREE_CODE (cond
) == NE_EXPR
)
26487 if (TREE_OPERAND (t
, 0) == decl
)
26488 t
= TREE_OPERAND (t
, 1);
26490 t
= TREE_OPERAND (t
, 0);
26491 if (TREE_CODE (t
) != INTEGER_CST
)
26501 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
26502 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
26503 no such TYPE can be found. Note that this function peers inside
26504 uninstantiated templates and therefore should be used only in
26505 extremely limited situations. ONLY_CURRENT_P restricts this
26506 peering to the currently open classes hierarchy (which is required
26507 when comparing types). */
26510 resolve_typename_type (tree type
, bool only_current_p
)
26519 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
26521 scope
= TYPE_CONTEXT (type
);
26522 /* We shouldn't have built a TYPENAME_TYPE with a non-dependent scope. */
26523 gcc_checking_assert (uses_template_parms (scope
));
26525 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
26526 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
26527 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
26528 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
26529 identifier of the TYPENAME_TYPE anymore.
26530 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
26531 TYPENAME_TYPE instead, we avoid messing up with a possible
26532 typedef variant case. */
26533 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
26535 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
26536 it first before we can figure out what NAME refers to. */
26537 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
26539 if (TYPENAME_IS_RESOLVING_P (scope
))
26540 /* Given a class template A with a dependent base with nested type C,
26541 typedef typename A::C::C C will land us here, as trying to resolve
26542 the initial A::C leads to the local C typedef, which leads back to
26543 A::C::C. So we break the recursion now. */
26546 scope
= resolve_typename_type (scope
, only_current_p
);
26548 /* If we don't know what SCOPE refers to, then we cannot resolve the
26550 if (!CLASS_TYPE_P (scope
))
26552 /* If this is a typedef, we don't want to look inside (c++/11987). */
26553 if (typedef_variant_p (type
))
26555 /* If SCOPE isn't the template itself, it will not have a valid
26556 TYPE_FIELDS list. */
26557 if (same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
26558 /* scope is either the template itself or a compatible instantiation
26559 like X<T>, so look up the name in the original template. */
26560 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
26561 /* If scope has no fields, it can't be a current instantiation. Check this
26562 before currently_open_class to avoid infinite recursion (71515). */
26563 if (!TYPE_FIELDS (scope
))
26565 /* If the SCOPE is not the current instantiation, there's no reason
26566 to look inside it. */
26567 if (only_current_p
&& !currently_open_class (scope
))
26569 /* Enter the SCOPE so that name lookup will be resolved as if we
26570 were in the class definition. In particular, SCOPE will no
26571 longer be considered a dependent type. */
26572 pushed_scope
= push_scope (scope
);
26573 /* Look up the declaration. */
26574 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
26575 tf_warning_or_error
);
26577 result
= NULL_TREE
;
26579 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
26580 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
26581 tree fullname
= TYPENAME_TYPE_FULLNAME (type
);
26584 else if (identifier_p (fullname
)
26585 && TREE_CODE (decl
) == TYPE_DECL
)
26587 result
= TREE_TYPE (decl
);
26588 if (result
== error_mark_node
)
26589 result
= NULL_TREE
;
26591 else if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
26592 && DECL_CLASS_TEMPLATE_P (decl
))
26594 /* Obtain the template and the arguments. */
26595 tree tmpl
= TREE_OPERAND (fullname
, 0);
26596 if (TREE_CODE (tmpl
) == IDENTIFIER_NODE
)
26598 /* We get here with a plain identifier because a previous tentative
26599 parse of the nested-name-specifier as part of a ptr-operator saw
26600 ::template X<A>. The use of ::template is necessary in a
26601 ptr-operator, but wrong in a declarator-id.
26603 [temp.names]: In a qualified-id of a declarator-id, the keyword
26604 template shall not appear at the top level. */
26605 pedwarn (cp_expr_loc_or_input_loc (fullname
), OPT_Wpedantic
,
26606 "keyword %<template%> not allowed in declarator-id");
26609 tree args
= TREE_OPERAND (fullname
, 1);
26610 /* Instantiate the template. */
26611 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
26612 /*entering_scope=*/true,
26613 tf_error
| tf_user
);
26614 if (result
== error_mark_node
)
26615 result
= NULL_TREE
;
26618 /* Leave the SCOPE. */
26620 pop_scope (pushed_scope
);
26622 /* If we failed to resolve it, return the original typename. */
26626 /* If lookup found a typename type, resolve that too. */
26627 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
26629 /* Ill-formed programs can cause infinite recursion here, so we
26630 must catch that. */
26631 TYPENAME_IS_RESOLVING_P (result
) = 1;
26632 result
= resolve_typename_type (result
, only_current_p
);
26633 TYPENAME_IS_RESOLVING_P (result
) = 0;
26636 /* Qualify the resulting type. */
26637 quals
= cp_type_quals (type
);
26639 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
26644 /* EXPR is an expression which is not type-dependent. Return a proxy
26645 for EXPR that can be used to compute the types of larger
26646 expressions containing EXPR. */
26649 build_non_dependent_expr (tree expr
)
26651 tree orig_expr
= expr
;
26654 /* When checking, try to get a constant value for all non-dependent
26655 expressions in order to expose bugs in *_dependent_expression_p
26656 and constexpr. This can affect code generation, see PR70704, so
26657 only do this for -fchecking=2. */
26658 if (flag_checking
> 1
26659 && cxx_dialect
>= cxx11
26660 /* Don't do this during nsdmi parsing as it can lead to
26661 unexpected recursive instantiations. */
26662 && !parsing_nsdmi ()
26663 /* Don't do this during concept expansion either and for
26664 the same reason. */
26665 && !expanding_concept ())
26666 fold_non_dependent_expr (expr
, tf_none
);
26668 STRIP_ANY_LOCATION_WRAPPER (expr
);
26670 /* Preserve OVERLOADs; the functions must be available to resolve
26673 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
26674 inner_expr
= stmt_expr_value_expr (inner_expr
);
26675 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
26676 inner_expr
= TREE_OPERAND (inner_expr
, 0);
26677 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
26678 inner_expr
= TREE_OPERAND (inner_expr
, 1);
26679 if (is_overloaded_fn (inner_expr
)
26680 || TREE_CODE (inner_expr
) == OFFSET_REF
)
26682 /* There is no need to return a proxy for a variable or enumerator. */
26683 if (VAR_P (expr
) || TREE_CODE (expr
) == CONST_DECL
)
26685 /* Preserve string constants; conversions from string constants to
26686 "char *" are allowed, even though normally a "const char *"
26687 cannot be used to initialize a "char *". */
26688 if (TREE_CODE (expr
) == STRING_CST
)
26690 /* Preserve void and arithmetic constants, as an optimization -- there is no
26691 reason to create a new node. */
26692 if (TREE_CODE (expr
) == VOID_CST
26693 || TREE_CODE (expr
) == INTEGER_CST
26694 || TREE_CODE (expr
) == REAL_CST
)
26696 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
26697 There is at least one place where we want to know that a
26698 particular expression is a throw-expression: when checking a ?:
26699 expression, there are special rules if the second or third
26700 argument is a throw-expression. */
26701 if (TREE_CODE (expr
) == THROW_EXPR
)
26704 /* Don't wrap an initializer list, we need to be able to look inside. */
26705 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
26708 /* Don't wrap a dummy object, we need to be able to test for it. */
26709 if (is_dummy_object (expr
))
26712 if (TREE_CODE (expr
) == COND_EXPR
)
26713 return build3 (COND_EXPR
,
26715 TREE_OPERAND (expr
, 0),
26716 (TREE_OPERAND (expr
, 1)
26717 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
26718 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
26719 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
26720 if (TREE_CODE (expr
) == COMPOUND_EXPR
26721 && !COMPOUND_EXPR_OVERLOADED (expr
))
26722 return build2 (COMPOUND_EXPR
,
26724 TREE_OPERAND (expr
, 0),
26725 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
26727 /* If the type is unknown, it can't really be non-dependent */
26728 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
26730 /* Otherwise, build a NON_DEPENDENT_EXPR. */
26731 return build1_loc (EXPR_LOCATION (orig_expr
), NON_DEPENDENT_EXPR
,
26732 TREE_TYPE (expr
), expr
);
26735 /* ARGS is a vector of expressions as arguments to a function call.
26736 Replace the arguments with equivalent non-dependent expressions.
26737 This modifies ARGS in place. */
26740 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
26745 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
26747 tree newarg
= build_non_dependent_expr (arg
);
26749 (*args
)[ix
] = newarg
;
26753 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
26754 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
26755 parms. If set_canonical is true, we set TYPE_CANONICAL on it. */
26758 make_auto_1 (tree name
, bool set_canonical
)
26760 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
26761 TYPE_NAME (au
) = build_decl (input_location
,
26762 TYPE_DECL
, name
, au
);
26763 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
26764 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
26765 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
26766 TYPE_NAME (au
), NULL_TREE
);
26768 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
26769 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
26770 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
26776 make_decltype_auto (void)
26778 return make_auto_1 (decltype_auto_identifier
, true);
26784 return make_auto_1 (auto_identifier
, true);
26787 /* Return a C++17 deduction placeholder for class template TMPL. */
26790 make_template_placeholder (tree tmpl
)
26792 tree t
= make_auto_1 (auto_identifier
, false);
26793 CLASS_PLACEHOLDER_TEMPLATE (t
) = tmpl
;
26794 /* Our canonical type depends on the placeholder. */
26795 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
26799 /* True iff T is a C++17 class template deduction placeholder. */
26802 template_placeholder_p (tree t
)
26804 return is_auto (t
) && CLASS_PLACEHOLDER_TEMPLATE (t
);
26807 /* Make a "constrained auto" type-specifier. This is an
26808 auto type with constraints that must be associated after
26809 deduction. The constraint is formed from the given
26810 CONC and its optional sequence of arguments, which are
26811 non-null if written as partial-concept-id. */
26814 make_constrained_auto (tree con
, tree args
)
26816 tree type
= make_auto_1 (auto_identifier
, false);
26818 /* Build the constraint. */
26819 tree tmpl
= DECL_TI_TEMPLATE (con
);
26820 tree expr
= VAR_P (con
) ? tmpl
: ovl_make (tmpl
);
26821 expr
= build_concept_check (expr
, type
, args
);
26823 tree constr
= normalize_expression (expr
);
26824 PLACEHOLDER_TYPE_CONSTRAINTS (type
) = constr
;
26826 /* Our canonical type depends on the constraint. */
26827 TYPE_CANONICAL (type
) = canonical_type_parameter (type
);
26829 /* Attach the constraint to the type declaration. */
26830 tree decl
= TYPE_NAME (type
);
26834 /* Given type ARG, return std::initializer_list<ARG>. */
26839 tree std_init_list
= get_namespace_binding (std_node
, init_list_identifier
);
26841 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
26843 gcc_rich_location
richloc (input_location
);
26844 maybe_add_include_fixit (&richloc
, "<initializer_list>", false);
26845 error_at (&richloc
,
26846 "deducing from brace-enclosed initializer list"
26847 " requires %<#include <initializer_list>%>");
26849 return error_mark_node
;
26851 tree argvec
= make_tree_vec (1);
26852 TREE_VEC_ELT (argvec
, 0) = arg
;
26854 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
26855 NULL_TREE
, 0, tf_warning_or_error
);
26858 /* Replace auto in TYPE with std::initializer_list<auto>. */
26861 listify_autos (tree type
, tree auto_node
)
26863 tree init_auto
= listify (strip_top_quals (auto_node
));
26864 tree argvec
= make_tree_vec (1);
26865 TREE_VEC_ELT (argvec
, 0) = init_auto
;
26866 if (processing_template_decl
)
26867 argvec
= add_to_template_args (current_template_args (), argvec
);
26868 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
26871 /* Hash traits for hashing possibly constrained 'auto'
26872 TEMPLATE_TYPE_PARMs for use by do_auto_deduction. */
26874 struct auto_hash
: default_hash_traits
<tree
>
26876 static inline hashval_t
hash (tree
);
26877 static inline bool equal (tree
, tree
);
26880 /* Hash the 'auto' T. */
26883 auto_hash::hash (tree t
)
26885 if (tree c
= NON_ERROR (PLACEHOLDER_TYPE_CONSTRAINTS (t
)))
26886 /* Matching constrained-type-specifiers denote the same template
26887 parameter, so hash the constraint. */
26888 return hash_placeholder_constraint (c
);
26890 /* But unconstrained autos are all separate, so just hash the pointer. */
26891 return iterative_hash_object (t
, 0);
26894 /* Compare two 'auto's. */
26897 auto_hash::equal (tree t1
, tree t2
)
26902 tree c1
= PLACEHOLDER_TYPE_CONSTRAINTS (t1
);
26903 tree c2
= PLACEHOLDER_TYPE_CONSTRAINTS (t2
);
26905 /* Two unconstrained autos are distinct. */
26909 return equivalent_placeholder_constraints (c1
, c2
);
26912 /* for_each_template_parm callback for extract_autos: if t is a (possibly
26913 constrained) auto, add it to the vector. */
26916 extract_autos_r (tree t
, void *data
)
26918 hash_table
<auto_hash
> &hash
= *(hash_table
<auto_hash
>*)data
;
26921 /* All the autos were built with index 0; fix that up now. */
26922 tree
*p
= hash
.find_slot (t
, INSERT
);
26925 /* If this is a repeated constrained-type-specifier, use the index we
26927 idx
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (*p
));
26930 /* Otherwise this is new, so use the current count. */
26932 idx
= hash
.elements () - 1;
26934 TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (t
)) = idx
;
26937 /* Always keep walking. */
26941 /* Return a TREE_VEC of the 'auto's used in type under the Concepts TS, which
26942 says they can appear anywhere in the type. */
26945 extract_autos (tree type
)
26947 hash_set
<tree
> visited
;
26948 hash_table
<auto_hash
> hash (2);
26950 for_each_template_parm (type
, extract_autos_r
, &hash
, &visited
, true);
26952 tree tree_vec
= make_tree_vec (hash
.elements());
26953 for (hash_table
<auto_hash
>::iterator iter
= hash
.begin();
26954 iter
!= hash
.end(); ++iter
)
26957 unsigned i
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (elt
));
26958 TREE_VEC_ELT (tree_vec
, i
)
26959 = build_tree_list (NULL_TREE
, TYPE_NAME (elt
));
26965 /* The stem for deduction guide names. */
26966 const char *const dguide_base
= "__dguide_";
26968 /* Return the name for a deduction guide for class template TMPL. */
26971 dguide_name (tree tmpl
)
26973 tree type
= (TYPE_P (tmpl
) ? tmpl
: TREE_TYPE (tmpl
));
26974 tree tname
= TYPE_IDENTIFIER (type
);
26975 char *buf
= (char *) alloca (1 + strlen (dguide_base
)
26976 + IDENTIFIER_LENGTH (tname
));
26977 memcpy (buf
, dguide_base
, strlen (dguide_base
));
26978 memcpy (buf
+ strlen (dguide_base
), IDENTIFIER_POINTER (tname
),
26979 IDENTIFIER_LENGTH (tname
) + 1);
26980 tree dname
= get_identifier (buf
);
26981 TREE_TYPE (dname
) = type
;
26985 /* True if NAME is the name of a deduction guide. */
26988 dguide_name_p (tree name
)
26990 return (TREE_CODE (name
) == IDENTIFIER_NODE
26991 && TREE_TYPE (name
)
26992 && !strncmp (IDENTIFIER_POINTER (name
), dguide_base
,
26993 strlen (dguide_base
)));
26996 /* True if FN is a deduction guide. */
26999 deduction_guide_p (const_tree fn
)
27002 if (tree name
= DECL_NAME (fn
))
27003 return dguide_name_p (name
);
27007 /* True if FN is the copy deduction guide, i.e. A(A)->A. */
27010 copy_guide_p (const_tree fn
)
27012 gcc_assert (deduction_guide_p (fn
));
27013 if (!DECL_ARTIFICIAL (fn
))
27015 tree parms
= FUNCTION_FIRST_USER_PARMTYPE (DECL_TI_TEMPLATE (fn
));
27016 return (TREE_CHAIN (parms
) == void_list_node
27017 && same_type_p (TREE_VALUE (parms
), TREE_TYPE (DECL_NAME (fn
))));
27020 /* True if FN is a guide generated from a constructor template. */
27023 template_guide_p (const_tree fn
)
27025 gcc_assert (deduction_guide_p (fn
));
27026 if (!DECL_ARTIFICIAL (fn
))
27028 tree tmpl
= DECL_TI_TEMPLATE (fn
);
27029 if (tree org
= DECL_ABSTRACT_ORIGIN (tmpl
))
27030 return PRIMARY_TEMPLATE_P (org
);
27034 /* OLDDECL is a _DECL for a template parameter. Return a similar parameter at
27035 LEVEL:INDEX, using tsubst_args and complain for substitution into non-type
27036 template parameter types. Note that the handling of template template
27037 parameters relies on current_template_parms being set appropriately for the
27041 rewrite_template_parm (tree olddecl
, unsigned index
, unsigned level
,
27042 tree tsubst_args
, tsubst_flags_t complain
)
27044 if (olddecl
== error_mark_node
)
27045 return error_mark_node
;
27047 tree oldidx
= get_template_parm_index (olddecl
);
27050 if (TREE_CODE (olddecl
) == TYPE_DECL
27051 || TREE_CODE (olddecl
) == TEMPLATE_DECL
)
27053 tree oldtype
= TREE_TYPE (olddecl
);
27054 newtype
= cxx_make_type (TREE_CODE (oldtype
));
27055 TYPE_MAIN_VARIANT (newtype
) = newtype
;
27056 if (TREE_CODE (oldtype
) == TEMPLATE_TYPE_PARM
)
27057 TEMPLATE_TYPE_PARM_FOR_CLASS (newtype
)
27058 = TEMPLATE_TYPE_PARM_FOR_CLASS (oldtype
);
27062 newtype
= TREE_TYPE (olddecl
);
27063 if (type_uses_auto (newtype
))
27065 // Substitute once to fix references to other template parameters.
27066 newtype
= tsubst (newtype
, tsubst_args
,
27067 complain
|tf_partial
, NULL_TREE
);
27068 // Now substitute again to reduce the level of the auto.
27069 newtype
= tsubst (newtype
, current_template_args (),
27070 complain
, NULL_TREE
);
27073 newtype
= tsubst (newtype
, tsubst_args
,
27074 complain
, NULL_TREE
);
27078 = build_decl (DECL_SOURCE_LOCATION (olddecl
), TREE_CODE (olddecl
),
27079 DECL_NAME (olddecl
), newtype
);
27080 SET_DECL_TEMPLATE_PARM_P (newdecl
);
27083 if (TREE_CODE (olddecl
) == TYPE_DECL
27084 || TREE_CODE (olddecl
) == TEMPLATE_DECL
)
27086 newidx
= TEMPLATE_TYPE_PARM_INDEX (newtype
)
27087 = build_template_parm_index (index
, level
, level
,
27089 TEMPLATE_PARM_PARAMETER_PACK (newidx
)
27090 = TEMPLATE_PARM_PARAMETER_PACK (oldidx
);
27091 TYPE_STUB_DECL (newtype
) = TYPE_NAME (newtype
) = newdecl
;
27092 TYPE_CANONICAL (newtype
) = canonical_type_parameter (newtype
);
27094 if (TREE_CODE (olddecl
) == TEMPLATE_DECL
)
27096 DECL_TEMPLATE_RESULT (newdecl
)
27097 = build_decl (DECL_SOURCE_LOCATION (olddecl
), TYPE_DECL
,
27098 DECL_NAME (olddecl
), newtype
);
27099 DECL_ARTIFICIAL (DECL_TEMPLATE_RESULT (newdecl
)) = true;
27100 // First create a copy (ttargs) of tsubst_args with an
27101 // additional level for the template template parameter's own
27102 // template parameters (ttparms).
27103 tree ttparms
= (INNERMOST_TEMPLATE_PARMS
27104 (DECL_TEMPLATE_PARMS (olddecl
)));
27105 const int depth
= TMPL_ARGS_DEPTH (tsubst_args
);
27106 tree ttargs
= make_tree_vec (depth
+ 1);
27107 for (int i
= 0; i
< depth
; ++i
)
27108 TREE_VEC_ELT (ttargs
, i
) = TREE_VEC_ELT (tsubst_args
, i
);
27109 TREE_VEC_ELT (ttargs
, depth
)
27110 = template_parms_level_to_args (ttparms
);
27111 // Substitute ttargs into ttparms to fix references to
27112 // other template parameters.
27113 ttparms
= tsubst_template_parms_level (ttparms
, ttargs
,
27114 complain
|tf_partial
);
27115 // Now substitute again with args based on tparms, to reduce
27116 // the level of the ttparms.
27117 ttargs
= current_template_args ();
27118 ttparms
= tsubst_template_parms_level (ttparms
, ttargs
,
27120 // Finally, tack the adjusted parms onto tparms.
27121 ttparms
= tree_cons (size_int (depth
), ttparms
,
27122 current_template_parms
);
27123 DECL_TEMPLATE_PARMS (newdecl
) = ttparms
;
27128 tree oldconst
= TEMPLATE_PARM_DECL (oldidx
);
27130 = build_decl (DECL_SOURCE_LOCATION (oldconst
),
27131 TREE_CODE (oldconst
),
27132 DECL_NAME (oldconst
), newtype
);
27133 TREE_CONSTANT (newconst
) = TREE_CONSTANT (newdecl
)
27134 = TREE_READONLY (newconst
) = TREE_READONLY (newdecl
) = true;
27135 SET_DECL_TEMPLATE_PARM_P (newconst
);
27136 newidx
= build_template_parm_index (index
, level
, level
,
27137 newconst
, newtype
);
27138 TEMPLATE_PARM_PARAMETER_PACK (newidx
)
27139 = TEMPLATE_PARM_PARAMETER_PACK (oldidx
);
27140 DECL_INITIAL (newdecl
) = DECL_INITIAL (newconst
) = newidx
;
27146 /* Returns a C++17 class deduction guide template based on the constructor
27147 CTOR. As a special case, CTOR can be a RECORD_TYPE for an implicit default
27148 guide, or REFERENCE_TYPE for an implicit copy/move guide. */
27151 build_deduction_guide (tree ctor
, tree outer_args
, tsubst_flags_t complain
)
27153 tree type
, tparms
, targs
, fparms
, fargs
, ci
;
27154 bool memtmpl
= false;
27157 tree fn_tmpl
= NULL_TREE
;
27162 bool copy_p
= TYPE_REF_P (type
);
27165 type
= TREE_TYPE (type
);
27166 fparms
= tree_cons (NULL_TREE
, type
, void_list_node
);
27169 fparms
= void_list_node
;
27171 tree ctmpl
= CLASSTYPE_TI_TEMPLATE (type
);
27172 tparms
= DECL_TEMPLATE_PARMS (ctmpl
);
27173 targs
= CLASSTYPE_TI_ARGS (type
);
27176 loc
= DECL_SOURCE_LOCATION (ctmpl
);
27177 explicit_p
= false;
27181 ++processing_template_decl
;
27185 = (TREE_CODE (ctor
) == TEMPLATE_DECL
? ctor
27186 : DECL_TI_TEMPLATE (ctor
));
27188 fn_tmpl
= tsubst (fn_tmpl
, outer_args
, complain
, ctor
);
27189 ctor
= DECL_TEMPLATE_RESULT (fn_tmpl
);
27191 type
= DECL_CONTEXT (ctor
);
27193 tparms
= DECL_TEMPLATE_PARMS (fn_tmpl
);
27194 /* If type is a member class template, DECL_TI_ARGS (ctor) will have
27195 fully specialized args for the enclosing class. Strip those off, as
27196 the deduction guide won't have those template parameters. */
27197 targs
= get_innermost_template_args (DECL_TI_ARGS (ctor
),
27198 TMPL_PARMS_DEPTH (tparms
));
27199 /* Discard the 'this' parameter. */
27200 fparms
= FUNCTION_ARG_CHAIN (ctor
);
27201 fargs
= TREE_CHAIN (DECL_ARGUMENTS (ctor
));
27202 ci
= get_constraints (ctor
);
27203 loc
= DECL_SOURCE_LOCATION (ctor
);
27204 explicit_p
= DECL_NONCONVERTING_P (ctor
);
27206 if (PRIMARY_TEMPLATE_P (fn_tmpl
))
27210 /* For a member template constructor, we need to flatten the two
27211 template parameter lists into one, and then adjust the function
27212 signature accordingly. This gets...complicated. */
27213 tree save_parms
= current_template_parms
;
27215 /* For a member template we should have two levels of parms/args, one
27216 for the class and one for the constructor. We stripped
27217 specialized args for further enclosing classes above. */
27218 const int depth
= 2;
27219 gcc_assert (TMPL_ARGS_DEPTH (targs
) == depth
);
27221 /* Template args for translating references to the two-level template
27222 parameters into references to the one-level template parameters we
27224 tree tsubst_args
= copy_node (targs
);
27225 TMPL_ARGS_LEVEL (tsubst_args
, depth
)
27226 = copy_node (TMPL_ARGS_LEVEL (tsubst_args
, depth
));
27228 /* Template parms for the constructor template. */
27229 tree ftparms
= TREE_VALUE (tparms
);
27230 unsigned flen
= TREE_VEC_LENGTH (ftparms
);
27231 /* Template parms for the class template. */
27232 tparms
= TREE_CHAIN (tparms
);
27233 tree ctparms
= TREE_VALUE (tparms
);
27234 unsigned clen
= TREE_VEC_LENGTH (ctparms
);
27235 /* Template parms for the deduction guide start as a copy of the
27236 template parms for the class. We set current_template_parms for
27237 lookup_template_class_1. */
27238 current_template_parms
= tparms
= copy_node (tparms
);
27239 tree new_vec
= TREE_VALUE (tparms
) = make_tree_vec (flen
+ clen
);
27240 for (unsigned i
= 0; i
< clen
; ++i
)
27241 TREE_VEC_ELT (new_vec
, i
) = TREE_VEC_ELT (ctparms
, i
);
27243 /* Now we need to rewrite the constructor parms to append them to the
27245 for (unsigned i
= 0; i
< flen
; ++i
)
27247 unsigned index
= i
+ clen
;
27248 unsigned level
= 1;
27249 tree oldelt
= TREE_VEC_ELT (ftparms
, i
);
27250 tree olddecl
= TREE_VALUE (oldelt
);
27251 tree newdecl
= rewrite_template_parm (olddecl
, index
, level
,
27252 tsubst_args
, complain
);
27253 if (newdecl
== error_mark_node
)
27255 tree newdef
= tsubst_template_arg (TREE_PURPOSE (oldelt
),
27256 tsubst_args
, complain
, ctor
);
27257 tree list
= build_tree_list (newdef
, newdecl
);
27258 TEMPLATE_PARM_CONSTRAINTS (list
)
27259 = tsubst_constraint_info (TEMPLATE_PARM_CONSTRAINTS (oldelt
),
27260 tsubst_args
, complain
, ctor
);
27261 TREE_VEC_ELT (new_vec
, index
) = list
;
27262 TMPL_ARG (tsubst_args
, depth
, i
) = template_parm_to_arg (list
);
27265 /* Now we have a final set of template parms to substitute into the
27266 function signature. */
27267 targs
= template_parms_to_args (tparms
);
27268 fparms
= tsubst_arg_types (fparms
, tsubst_args
, NULL_TREE
,
27270 if (fparms
== error_mark_node
)
27272 fargs
= tsubst (fargs
, tsubst_args
, complain
, ctor
);
27274 ci
= tsubst_constraint_info (ci
, tsubst_args
, complain
, ctor
);
27276 current_template_parms
= save_parms
;
27279 --processing_template_decl
;
27281 return error_mark_node
;
27286 /* Copy the parms so we can set DECL_PRIMARY_TEMPLATE. */
27287 tparms
= copy_node (tparms
);
27288 INNERMOST_TEMPLATE_PARMS (tparms
)
27289 = copy_node (INNERMOST_TEMPLATE_PARMS (tparms
));
27292 tree fntype
= build_function_type (type
, fparms
);
27293 tree ded_fn
= build_lang_decl_loc (loc
,
27295 dguide_name (type
), fntype
);
27296 DECL_ARGUMENTS (ded_fn
) = fargs
;
27297 DECL_ARTIFICIAL (ded_fn
) = true;
27298 DECL_NONCONVERTING_P (ded_fn
) = explicit_p
;
27299 tree ded_tmpl
= build_template_decl (ded_fn
, tparms
, /*member*/false);
27300 DECL_ARTIFICIAL (ded_tmpl
) = true;
27301 DECL_TEMPLATE_RESULT (ded_tmpl
) = ded_fn
;
27302 TREE_TYPE (ded_tmpl
) = TREE_TYPE (ded_fn
);
27303 DECL_TEMPLATE_INFO (ded_fn
) = build_template_info (ded_tmpl
, targs
);
27304 DECL_PRIMARY_TEMPLATE (ded_tmpl
) = ded_tmpl
;
27306 DECL_ABSTRACT_ORIGIN (ded_tmpl
) = fn_tmpl
;
27308 set_constraints (ded_tmpl
, ci
);
27313 /* Deduce template arguments for the class template placeholder PTYPE for
27314 template TMPL based on the initializer INIT, and return the resulting
27318 do_class_deduction (tree ptype
, tree tmpl
, tree init
, int flags
,
27319 tsubst_flags_t complain
)
27321 if (!DECL_CLASS_TEMPLATE_P (tmpl
))
27323 /* We should have handled this in the caller. */
27324 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
))
27326 if (complain
& tf_error
)
27327 error ("non-class template %qT used without template arguments", tmpl
);
27328 return error_mark_node
;
27330 if (init
&& TREE_TYPE (init
) == ptype
)
27331 /* Using the template parm as its own argument. */
27334 tree type
= TREE_TYPE (tmpl
);
27336 bool try_list_ctor
= false;
27338 releasing_vec rv_args
= NULL
;
27339 vec
<tree
,va_gc
> *&args
= *&rv_args
;
27340 if (init
== NULL_TREE
27341 || TREE_CODE (init
) == TREE_LIST
)
27342 args
= make_tree_vector_from_list (init
);
27343 else if (BRACE_ENCLOSED_INITIALIZER_P (init
))
27345 try_list_ctor
= TYPE_HAS_LIST_CTOR (type
);
27346 if (try_list_ctor
&& CONSTRUCTOR_NELTS (init
) == 1)
27348 /* As an exception, the first phase in 16.3.1.7 (considering the
27349 initializer list as a single argument) is omitted if the
27350 initializer list consists of a single expression of type cv U,
27351 where U is a specialization of C or a class derived from a
27352 specialization of C. */
27353 tree elt
= CONSTRUCTOR_ELT (init
, 0)->value
;
27354 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
27356 tree etype
= TREE_TYPE (elt
);
27357 tree tparms
= (INNERMOST_TEMPLATE_PARMS
27358 (DECL_TEMPLATE_PARMS (tmpl
)));
27359 tree targs
= make_tree_vec (TREE_VEC_LENGTH (tparms
));
27360 int err
= unify (tparms
, targs
, type
, etype
,
27361 UNIFY_ALLOW_DERIVED
, /*explain*/false);
27363 try_list_ctor
= false;
27367 if (try_list_ctor
|| is_std_init_list (type
))
27368 args
= make_tree_vector_single (init
);
27370 args
= make_tree_vector_from_ctor (init
);
27373 args
= make_tree_vector_single (init
);
27375 tree dname
= dguide_name (tmpl
);
27376 tree cands
= lookup_qualified_name (CP_DECL_CONTEXT (tmpl
), dname
,
27377 /*type*/false, /*complain*/false,
27379 bool elided
= false;
27380 if (cands
== error_mark_node
)
27383 /* Prune explicit deduction guides in copy-initialization context. */
27384 if (flags
& LOOKUP_ONLYCONVERTING
)
27386 for (lkp_iterator
iter (cands
); !elided
&& iter
; ++iter
)
27387 if (DECL_NONCONVERTING_P (STRIP_TEMPLATE (*iter
)))
27392 /* Found a nonconverting guide, prune the candidates. */
27393 tree pruned
= NULL_TREE
;
27394 for (lkp_iterator
iter (cands
); iter
; ++iter
)
27395 if (!DECL_NONCONVERTING_P (STRIP_TEMPLATE (*iter
)))
27396 pruned
= lookup_add (*iter
, pruned
);
27402 tree outer_args
= NULL_TREE
;
27403 if (DECL_CLASS_SCOPE_P (tmpl
)
27404 && CLASSTYPE_TEMPLATE_INSTANTIATION (DECL_CONTEXT (tmpl
)))
27406 outer_args
= CLASSTYPE_TI_ARGS (DECL_CONTEXT (tmpl
));
27407 type
= TREE_TYPE (most_general_template (tmpl
));
27410 bool saw_ctor
= false;
27411 // FIXME cache artificial deduction guides
27412 for (ovl_iterator
iter (CLASSTYPE_CONSTRUCTORS (type
)); iter
; ++iter
)
27414 /* Skip inherited constructors. */
27415 if (iter
.using_p ())
27418 tree guide
= build_deduction_guide (*iter
, outer_args
, complain
);
27419 if (guide
== error_mark_node
)
27420 return error_mark_node
;
27421 if ((flags
& LOOKUP_ONLYCONVERTING
)
27422 && DECL_NONCONVERTING_P (STRIP_TEMPLATE (guide
)))
27425 cands
= lookup_add (guide
, cands
);
27430 tree call
= error_mark_node
;
27432 /* If this is list-initialization and the class has a list constructor, first
27433 try deducing from the list as a single argument, as [over.match.list]. */
27434 tree list_cands
= NULL_TREE
;
27435 if (try_list_ctor
&& cands
)
27436 for (lkp_iterator
iter (cands
); iter
; ++iter
)
27439 if (is_list_ctor (dg
))
27440 list_cands
= lookup_add (dg
, list_cands
);
27444 ++cp_unevaluated_operand
;
27445 call
= build_new_function_call (list_cands
, &args
, tf_decltype
);
27446 --cp_unevaluated_operand
;
27448 if (call
== error_mark_node
)
27450 /* That didn't work, now try treating the list as a sequence of
27452 release_tree_vector (args
);
27453 args
= make_tree_vector_from_ctor (init
);
27457 /* Maybe generate an implicit deduction guide. */
27458 if (call
== error_mark_node
&& args
->length () < 2)
27460 tree gtype
= NULL_TREE
;
27462 if (args
->length () == 1)
27463 /* Generate a copy guide. */
27464 gtype
= build_reference_type (type
);
27465 else if (!saw_ctor
)
27466 /* Generate a default guide. */
27471 tree guide
= build_deduction_guide (gtype
, outer_args
, complain
);
27472 if (guide
== error_mark_node
)
27473 return error_mark_node
;
27474 cands
= lookup_add (guide
, cands
);
27478 if (elided
&& !cands
)
27480 error ("cannot deduce template arguments for copy-initialization"
27481 " of %qT, as it has no non-explicit deduction guides or "
27482 "user-declared constructors", type
);
27483 return error_mark_node
;
27485 else if (!cands
&& call
== error_mark_node
)
27487 error ("cannot deduce template arguments of %qT, as it has no viable "
27488 "deduction guides", type
);
27489 return error_mark_node
;
27492 if (call
== error_mark_node
)
27494 ++cp_unevaluated_operand
;
27495 call
= build_new_function_call (cands
, &args
, tf_decltype
);
27496 --cp_unevaluated_operand
;
27499 if (call
== error_mark_node
&& (complain
& tf_warning_or_error
))
27501 error ("class template argument deduction failed:");
27503 ++cp_unevaluated_operand
;
27504 call
= build_new_function_call (cands
, &args
, complain
| tf_decltype
);
27505 --cp_unevaluated_operand
;
27508 inform (input_location
, "explicit deduction guides not considered "
27509 "for copy-initialization");
27512 return cp_build_qualified_type (TREE_TYPE (call
), cp_type_quals (ptype
));
27515 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
27516 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE.
27517 The CONTEXT determines the context in which auto deduction is performed
27518 and is used to control error diagnostics. FLAGS are the LOOKUP_* flags.
27519 OUTER_TARGS are used during template argument deduction
27520 (context == adc_unify) to properly substitute the result, and is ignored
27523 For partial-concept-ids, extra args may be appended to the list of deduced
27524 template arguments prior to determining constraint satisfaction. */
27527 do_auto_deduction (tree type
, tree init
, tree auto_node
,
27528 tsubst_flags_t complain
, auto_deduction_context context
,
27529 tree outer_targs
, int flags
)
27533 if (init
== error_mark_node
)
27534 return error_mark_node
;
27536 if (init
&& type_dependent_expression_p (init
)
27537 && context
!= adc_unify
)
27538 /* Defining a subset of type-dependent expressions that we can deduce
27539 from ahead of time isn't worth the trouble. */
27542 /* Similarly, we can't deduce from another undeduced decl. */
27543 if (init
&& undeduced_auto_decl (init
))
27546 /* We may be doing a partial substitution, but we still want to replace
27548 complain
&= ~tf_partial
;
27550 if (tree tmpl
= CLASS_PLACEHOLDER_TEMPLATE (auto_node
))
27551 /* C++17 class template argument deduction. */
27552 return do_class_deduction (type
, tmpl
, init
, flags
, complain
);
27554 if (init
== NULL_TREE
|| TREE_TYPE (init
) == NULL_TREE
)
27555 /* Nothing we can do with this, even in deduction context. */
27558 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
27559 with either a new invented type template parameter U or, if the
27560 initializer is a braced-init-list (8.5.4), with
27561 std::initializer_list<U>. */
27562 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
27564 if (!DIRECT_LIST_INIT_P (init
))
27565 type
= listify_autos (type
, auto_node
);
27566 else if (CONSTRUCTOR_NELTS (init
) == 1)
27567 init
= CONSTRUCTOR_ELT (init
, 0)->value
;
27570 if (complain
& tf_warning_or_error
)
27572 if (permerror (input_location
, "direct-list-initialization of "
27573 "%<auto%> requires exactly one element"))
27574 inform (input_location
,
27575 "for deduction to %<std::initializer_list%>, use copy-"
27576 "list-initialization (i.e. add %<=%> before the %<{%>)");
27578 type
= listify_autos (type
, auto_node
);
27582 if (type
== error_mark_node
)
27583 return error_mark_node
;
27585 init
= resolve_nondeduced_context (init
, complain
);
27587 if (context
== adc_decomp_type
27588 && auto_node
== type
27589 && init
!= error_mark_node
27590 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
27591 /* [dcl.decomp]/1 - if decomposition declaration has no ref-qualifiers
27592 and initializer has array type, deduce cv-qualified array type. */
27593 return cp_build_qualified_type_real (TREE_TYPE (init
), TYPE_QUALS (type
),
27595 else if (AUTO_IS_DECLTYPE (auto_node
))
27597 tree stripped_init
= tree_strip_any_location_wrapper (init
);
27598 bool id
= (DECL_P (stripped_init
)
27599 || ((TREE_CODE (init
) == COMPONENT_REF
27600 || TREE_CODE (init
) == SCOPE_REF
)
27601 && !REF_PARENTHESIZED_P (init
)));
27602 targs
= make_tree_vec (1);
27603 TREE_VEC_ELT (targs
, 0)
27604 = finish_decltype_type (init
, id
, tf_warning_or_error
);
27605 if (type
!= auto_node
)
27607 if (complain
& tf_error
)
27608 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
27609 return error_mark_node
;
27614 if (error_operand_p (init
))
27615 return error_mark_node
;
27617 tree parms
= build_tree_list (NULL_TREE
, type
);
27621 tparms
= extract_autos (type
);
27624 tparms
= make_tree_vec (1);
27625 TREE_VEC_ELT (tparms
, 0)
27626 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
27629 targs
= make_tree_vec (TREE_VEC_LENGTH (tparms
));
27630 int val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
27632 NULL
, /*explain_p=*/false);
27635 if (processing_template_decl
)
27636 /* Try again at instantiation time. */
27638 if (type
&& type
!= error_mark_node
27639 && (complain
& tf_error
))
27640 /* If type is error_mark_node a diagnostic must have been
27641 emitted by now. Also, having a mention to '<type error>'
27642 in the diagnostic is not really useful to the user. */
27645 && FNDECL_USED_AUTO (current_function_decl
)
27647 == DECL_SAVED_AUTO_RETURN_TYPE (current_function_decl
))
27648 && LAMBDA_FUNCTION_P (current_function_decl
))
27649 error ("unable to deduce lambda return type from %qE", init
);
27651 error ("unable to deduce %qT from %qE", type
, init
);
27652 type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
27654 NULL
, /*explain_p=*/true);
27656 return error_mark_node
;
27660 /* Check any placeholder constraints against the deduced type. */
27661 if (flag_concepts
&& !processing_template_decl
)
27662 if (tree constr
= NON_ERROR (PLACEHOLDER_TYPE_CONSTRAINTS (auto_node
)))
27664 /* Use the deduced type to check the associated constraints. If we
27665 have a partial-concept-id, rebuild the argument list so that
27666 we check using the extra arguments. */
27667 gcc_assert (TREE_CODE (constr
) == CHECK_CONSTR
);
27668 tree cargs
= CHECK_CONSTR_ARGS (constr
);
27669 if (TREE_VEC_LENGTH (cargs
) > 1)
27671 cargs
= copy_node (cargs
);
27672 TREE_VEC_ELT (cargs
, 0) = TREE_VEC_ELT (targs
, 0);
27676 if (!constraints_satisfied_p (constr
, cargs
))
27678 if (complain
& tf_warning_or_error
)
27680 auto_diagnostic_group d
;
27683 case adc_unspecified
:
27685 error("placeholder constraints not satisfied");
27687 case adc_variable_type
:
27688 case adc_decomp_type
:
27689 error ("deduced initializer does not satisfy "
27690 "placeholder constraints");
27692 case adc_return_type
:
27693 error ("deduced return type does not satisfy "
27694 "placeholder constraints");
27696 case adc_requirement
:
27697 error ("deduced expression type does not satisfy "
27698 "placeholder constraints");
27701 diagnose_constraints (input_location
, constr
, targs
);
27703 return error_mark_node
;
27707 if (processing_template_decl
&& context
!= adc_unify
)
27708 outer_targs
= current_template_args ();
27709 targs
= add_to_template_args (outer_targs
, targs
);
27710 return tsubst (type
, targs
, complain
, NULL_TREE
);
27713 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
27717 splice_late_return_type (tree type
, tree late_return_type
)
27719 if (is_auto (type
))
27721 if (late_return_type
)
27722 return late_return_type
;
27724 tree idx
= get_template_parm_index (type
);
27725 if (TEMPLATE_PARM_LEVEL (idx
) <= processing_template_decl
)
27726 /* In an abbreviated function template we didn't know we were dealing
27727 with a function template when we saw the auto return type, so update
27728 it to have the correct level. */
27729 return make_auto_1 (TYPE_IDENTIFIER (type
), true);
27734 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
27735 'decltype(auto)' or a deduced class template. */
27738 is_auto (const_tree type
)
27740 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
27741 && (TYPE_IDENTIFIER (type
) == auto_identifier
27742 || TYPE_IDENTIFIER (type
) == decltype_auto_identifier
))
27748 /* for_each_template_parm callback for type_uses_auto. */
27751 is_auto_r (tree tp
, void */
*data*/
)
27753 return is_auto (tp
);
27756 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
27757 a use of `auto'. Returns NULL_TREE otherwise. */
27760 type_uses_auto (tree type
)
27762 if (type
== NULL_TREE
)
27764 else if (flag_concepts
)
27766 /* The Concepts TS allows multiple autos in one type-specifier; just
27767 return the first one we find, do_auto_deduction will collect all of
27769 if (uses_template_parms (type
))
27770 return for_each_template_parm (type
, is_auto_r
, /*data*/NULL
,
27771 /*visited*/NULL
, /*nondeduced*/false);
27776 return find_type_usage (type
, is_auto
);
27779 /* Report ill-formed occurrences of auto types in ARGUMENTS. If
27780 concepts are enabled, auto is acceptable in template arguments, but
27781 only when TEMPL identifies a template class. Return TRUE if any
27782 such errors were reported. */
27785 check_auto_in_tmpl_args (tree tmpl
, tree args
)
27787 /* If there were previous errors, nevermind. */
27788 if (!args
|| TREE_CODE (args
) != TREE_VEC
)
27791 /* If TMPL is an identifier, we're parsing and we can't tell yet
27792 whether TMPL is supposed to be a type, a function or a variable.
27793 We'll only be able to tell during template substitution, so we
27794 expect to be called again then. If concepts are enabled and we
27795 know we have a type, we're ok. */
27797 && (identifier_p (tmpl
)
27799 && (DECL_TYPE_TEMPLATE_P (tmpl
)
27800 || DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)))))
27803 /* Quickly search for any occurrences of auto; usually there won't
27804 be any, and then we'll avoid allocating the vector. */
27805 if (!type_uses_auto (args
))
27808 bool errors
= false;
27810 tree vec
= extract_autos (args
);
27811 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); i
++)
27813 tree xauto
= TREE_VALUE (TREE_VEC_ELT (vec
, i
));
27814 error_at (DECL_SOURCE_LOCATION (xauto
),
27815 "invalid use of %qT in template argument", xauto
);
27822 /* For a given template T, return the vector of typedefs referenced
27823 in T for which access check is needed at T instantiation time.
27824 T is either a FUNCTION_DECL or a RECORD_TYPE.
27825 Those typedefs were added to T by the function
27826 append_type_to_template_for_access_check. */
27828 vec
<qualified_typedef_usage_t
, va_gc
> *
27829 get_types_needing_access_check (tree t
)
27832 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
27834 if (!t
|| t
== error_mark_node
)
27837 if (!(ti
= get_template_info (t
)))
27840 if (CLASS_TYPE_P (t
)
27841 || TREE_CODE (t
) == FUNCTION_DECL
)
27843 if (!TI_TEMPLATE (ti
))
27846 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
27852 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
27853 tied to T. That list of typedefs will be access checked at
27854 T instantiation time.
27855 T is either a FUNCTION_DECL or a RECORD_TYPE.
27856 TYPE_DECL is a TYPE_DECL node representing a typedef.
27857 SCOPE is the scope through which TYPE_DECL is accessed.
27858 LOCATION is the location of the usage point of TYPE_DECL.
27860 This function is a subroutine of
27861 append_type_to_template_for_access_check. */
27864 append_type_to_template_for_access_check_1 (tree t
,
27867 location_t location
)
27869 qualified_typedef_usage_t typedef_usage
;
27872 if (!t
|| t
== error_mark_node
)
27875 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
27876 || CLASS_TYPE_P (t
))
27878 && TREE_CODE (type_decl
) == TYPE_DECL
27881 if (!(ti
= get_template_info (t
)))
27884 gcc_assert (TI_TEMPLATE (ti
));
27886 typedef_usage
.typedef_decl
= type_decl
;
27887 typedef_usage
.context
= scope
;
27888 typedef_usage
.locus
= location
;
27890 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
27893 /* Append TYPE_DECL to the template TEMPL.
27894 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
27895 At TEMPL instanciation time, TYPE_DECL will be checked to see
27896 if it can be accessed through SCOPE.
27897 LOCATION is the location of the usage point of TYPE_DECL.
27899 e.g. consider the following code snippet:
27906 template<class U> struct S
27908 C::myint mi; // <-- usage point of the typedef C::myint
27913 At S<char> instantiation time, we need to check the access of C::myint
27914 In other words, we need to check the access of the myint typedef through
27915 the C scope. For that purpose, this function will add the myint typedef
27916 and the scope C through which its being accessed to a list of typedefs
27917 tied to the template S. That list will be walked at template instantiation
27918 time and access check performed on each typedefs it contains.
27919 Note that this particular code snippet should yield an error because
27920 myint is private to C. */
27923 append_type_to_template_for_access_check (tree templ
,
27926 location_t location
)
27928 qualified_typedef_usage_t
*iter
;
27931 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
27933 /* Make sure we don't append the type to the template twice. */
27934 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
27935 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
27938 append_type_to_template_for_access_check_1 (templ
, type_decl
,
27942 /* Convert the generic type parameters in PARM that match the types given in the
27943 range [START_IDX, END_IDX) from the current_template_parms into generic type
27947 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
27949 tree current
= current_template_parms
;
27950 int depth
= TMPL_PARMS_DEPTH (current
);
27951 current
= INNERMOST_TEMPLATE_PARMS (current
);
27952 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
27954 for (int i
= 0; i
< start_idx
; ++i
)
27955 TREE_VEC_ELT (replacement
, i
)
27956 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
27958 for (int i
= start_idx
; i
< end_idx
; ++i
)
27960 /* Create a distinct parameter pack type from the current parm and add it
27961 to the replacement args to tsubst below into the generic function
27964 tree o
= TREE_TYPE (TREE_VALUE
27965 (TREE_VEC_ELT (current
, i
)));
27966 tree t
= copy_type (o
);
27967 TEMPLATE_TYPE_PARM_INDEX (t
)
27968 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
27970 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
27971 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
27972 TYPE_MAIN_VARIANT (t
) = t
;
27973 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
27974 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
27975 TREE_VEC_ELT (replacement
, i
) = t
;
27976 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
27979 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
27980 TREE_VEC_ELT (replacement
, i
)
27981 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
27983 /* If there are more levels then build up the replacement with the outer
27986 replacement
= add_to_template_args (template_parms_to_args
27987 (TREE_CHAIN (current_template_parms
)),
27990 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
27993 /* Entries in the decl_constraint hash table. */
27994 struct GTY((for_user
)) constr_entry
28000 /* Hashing function and equality for constraint entries. */
28001 struct constr_hasher
: ggc_ptr_hash
<constr_entry
>
28003 static hashval_t
hash (constr_entry
*e
)
28005 return (hashval_t
)DECL_UID (e
->decl
);
28008 static bool equal (constr_entry
*e1
, constr_entry
*e2
)
28010 return e1
->decl
== e2
->decl
;
28014 /* A mapping from declarations to constraint information. Note that
28015 both templates and their underlying declarations are mapped to the
28016 same constraint information.
28018 FIXME: This is defined in pt.c because garbage collection
28019 code is not being generated for constraint.cc. */
28021 static GTY (()) hash_table
<constr_hasher
> *decl_constraints
;
28023 /* Returns the template constraints of declaration T. If T is not
28024 constrained, return NULL_TREE. Note that T must be non-null. */
28027 get_constraints (tree t
)
28029 if (!flag_concepts
)
28032 gcc_assert (DECL_P (t
));
28033 if (TREE_CODE (t
) == TEMPLATE_DECL
)
28034 t
= DECL_TEMPLATE_RESULT (t
);
28035 constr_entry elt
= { t
, NULL_TREE
};
28036 constr_entry
* found
= decl_constraints
->find (&elt
);
28043 /* Associate the given constraint information CI with the declaration
28044 T. If T is a template, then the constraints are associated with
28045 its underlying declaration. Don't build associations if CI is
28049 set_constraints (tree t
, tree ci
)
28053 gcc_assert (t
&& flag_concepts
);
28054 if (TREE_CODE (t
) == TEMPLATE_DECL
)
28055 t
= DECL_TEMPLATE_RESULT (t
);
28056 gcc_assert (!get_constraints (t
));
28057 constr_entry elt
= {t
, ci
};
28058 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, INSERT
);
28059 constr_entry
* entry
= ggc_alloc
<constr_entry
> ();
28064 /* Remove the associated constraints of the declaration T. */
28067 remove_constraints (tree t
)
28069 gcc_assert (DECL_P (t
));
28070 if (TREE_CODE (t
) == TEMPLATE_DECL
)
28071 t
= DECL_TEMPLATE_RESULT (t
);
28073 constr_entry elt
= {t
, NULL_TREE
};
28074 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, NO_INSERT
);
28076 decl_constraints
->clear_slot (slot
);
28079 /* Memoized satisfaction results for declarations. This
28080 maps the pair (constraint_info, arguments) to the result computed
28081 by constraints_satisfied_p. */
28083 struct GTY((for_user
)) constraint_sat_entry
28090 /* Hashing function and equality for constraint entries. */
28092 struct constraint_sat_hasher
: ggc_ptr_hash
<constraint_sat_entry
>
28094 static hashval_t
hash (constraint_sat_entry
*e
)
28096 hashval_t val
= iterative_hash_object(e
->ci
, 0);
28097 return iterative_hash_template_arg (e
->args
, val
);
28100 static bool equal (constraint_sat_entry
*e1
, constraint_sat_entry
*e2
)
28102 return e1
->ci
== e2
->ci
&& comp_template_args (e1
->args
, e2
->args
);
28106 /* Memoized satisfaction results for concept checks. */
28108 struct GTY((for_user
)) concept_spec_entry
28115 /* Hashing function and equality for constraint entries. */
28117 struct concept_spec_hasher
: ggc_ptr_hash
<concept_spec_entry
>
28119 static hashval_t
hash (concept_spec_entry
*e
)
28121 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
28124 static bool equal (concept_spec_entry
*e1
, concept_spec_entry
*e2
)
28126 ++comparing_specializations
;
28127 bool eq
= e1
->tmpl
== e2
->tmpl
&& comp_template_args (e1
->args
, e2
->args
);
28128 --comparing_specializations
;
28133 static GTY (()) hash_table
<constraint_sat_hasher
> *constraint_memos
;
28134 static GTY (()) hash_table
<concept_spec_hasher
> *concept_memos
;
28136 /* Search for a memoized satisfaction result. Returns one of the
28137 truth value nodes if previously memoized, or NULL_TREE otherwise. */
28140 lookup_constraint_satisfaction (tree ci
, tree args
)
28142 constraint_sat_entry elt
= { ci
, args
, NULL_TREE
};
28143 constraint_sat_entry
* found
= constraint_memos
->find (&elt
);
28145 return found
->result
;
28150 /* Memoize the result of a satisfication test. Returns the saved result. */
28153 memoize_constraint_satisfaction (tree ci
, tree args
, tree result
)
28155 constraint_sat_entry elt
= {ci
, args
, result
};
28156 constraint_sat_entry
** slot
= constraint_memos
->find_slot (&elt
, INSERT
);
28157 constraint_sat_entry
* entry
= ggc_alloc
<constraint_sat_entry
> ();
28163 /* Search for a memoized satisfaction result for a concept. */
28166 lookup_concept_satisfaction (tree tmpl
, tree args
)
28168 concept_spec_entry elt
= { tmpl
, args
, NULL_TREE
};
28169 concept_spec_entry
* found
= concept_memos
->find (&elt
);
28171 return found
->result
;
28176 /* Memoize the result of a concept check. Returns the saved result. */
28179 memoize_concept_satisfaction (tree tmpl
, tree args
, tree result
)
28181 concept_spec_entry elt
= {tmpl
, args
, result
};
28182 concept_spec_entry
** slot
= concept_memos
->find_slot (&elt
, INSERT
);
28183 concept_spec_entry
* entry
= ggc_alloc
<concept_spec_entry
> ();
28189 static GTY (()) hash_table
<concept_spec_hasher
> *concept_expansions
;
28191 /* Returns a prior concept specialization. This returns the substituted
28192 and normalized constraints defined by the concept. */
28195 get_concept_expansion (tree tmpl
, tree args
)
28197 concept_spec_entry elt
= { tmpl
, args
, NULL_TREE
};
28198 concept_spec_entry
* found
= concept_expansions
->find (&elt
);
28200 return found
->result
;
28205 /* Save a concept expansion for later. */
28208 save_concept_expansion (tree tmpl
, tree args
, tree def
)
28210 concept_spec_entry elt
= {tmpl
, args
, def
};
28211 concept_spec_entry
** slot
= concept_expansions
->find_slot (&elt
, INSERT
);
28212 concept_spec_entry
* entry
= ggc_alloc
<concept_spec_entry
> ();
28219 hash_subsumption_args (tree t1
, tree t2
)
28221 gcc_assert (TREE_CODE (t1
) == CHECK_CONSTR
);
28222 gcc_assert (TREE_CODE (t2
) == CHECK_CONSTR
);
28224 val
= iterative_hash_object (CHECK_CONSTR_CONCEPT (t1
), val
);
28225 val
= iterative_hash_template_arg (CHECK_CONSTR_ARGS (t1
), val
);
28226 val
= iterative_hash_object (CHECK_CONSTR_CONCEPT (t2
), val
);
28227 val
= iterative_hash_template_arg (CHECK_CONSTR_ARGS (t2
), val
);
28231 /* Compare the constraints of two subsumption entries. The LEFT1 and
28232 LEFT2 arguments comprise the first subsumption pair and the RIGHT1
28233 and RIGHT2 arguments comprise the second. These are all CHECK_CONSTRs. */
28236 comp_subsumption_args (tree left1
, tree left2
, tree right1
, tree right2
)
28238 if (CHECK_CONSTR_CONCEPT (left1
) == CHECK_CONSTR_CONCEPT (right1
))
28239 if (CHECK_CONSTR_CONCEPT (left2
) == CHECK_CONSTR_CONCEPT (right2
))
28240 if (comp_template_args (CHECK_CONSTR_ARGS (left1
),
28241 CHECK_CONSTR_ARGS (right1
)))
28242 return comp_template_args (CHECK_CONSTR_ARGS (left2
),
28243 CHECK_CONSTR_ARGS (right2
));
28247 /* Key/value pair for learning and memoizing subsumption results. This
28248 associates a pair of check constraints (including arguments) with
28249 a boolean value indicating the result. */
28251 struct GTY((for_user
)) subsumption_entry
28258 /* Hashing function and equality for constraint entries. */
28260 struct subsumption_hasher
: ggc_ptr_hash
<subsumption_entry
>
28262 static hashval_t
hash (subsumption_entry
*e
)
28264 return hash_subsumption_args (e
->t1
, e
->t2
);
28267 static bool equal (subsumption_entry
*e1
, subsumption_entry
*e2
)
28269 ++comparing_specializations
;
28270 bool eq
= comp_subsumption_args(e1
->t1
, e1
->t2
, e2
->t1
, e2
->t2
);
28271 --comparing_specializations
;
28276 static GTY (()) hash_table
<subsumption_hasher
> *subsumption_table
;
28278 /* Search for a previously cached subsumption result. */
28281 lookup_subsumption_result (tree t1
, tree t2
)
28283 subsumption_entry elt
= { t1
, t2
, false };
28284 subsumption_entry
* found
= subsumption_table
->find (&elt
);
28286 return &found
->result
;
28291 /* Save a subsumption result. */
28294 save_subsumption_result (tree t1
, tree t2
, bool result
)
28296 subsumption_entry elt
= {t1
, t2
, result
};
28297 subsumption_entry
** slot
= subsumption_table
->find_slot (&elt
, INSERT
);
28298 subsumption_entry
* entry
= ggc_alloc
<subsumption_entry
> ();
28304 /* Set up the hash table for constraint association. */
28307 init_constraint_processing (void)
28309 if (!flag_concepts
)
28312 decl_constraints
= hash_table
<constr_hasher
>::create_ggc(37);
28313 constraint_memos
= hash_table
<constraint_sat_hasher
>::create_ggc(37);
28314 concept_memos
= hash_table
<concept_spec_hasher
>::create_ggc(37);
28315 concept_expansions
= hash_table
<concept_spec_hasher
>::create_ggc(37);
28316 subsumption_table
= hash_table
<subsumption_hasher
>::create_ggc(37);
28319 /* __integer_pack(N) in a pack expansion expands to a sequence of numbers from
28323 declare_integer_pack (void)
28325 tree ipfn
= push_library_fn (get_identifier ("__integer_pack"),
28326 build_function_type_list (integer_type_node
,
28329 NULL_TREE
, ECF_CONST
);
28330 DECL_DECLARED_CONSTEXPR_P (ipfn
) = true;
28331 DECL_BUILT_IN_CLASS (ipfn
) = BUILT_IN_FRONTEND
;
28332 DECL_FUNCTION_CODE (ipfn
)
28333 = (enum built_in_function
) (int) CP_BUILT_IN_INTEGER_PACK
;
28336 /* Set up the hash tables for template instantiations. */
28339 init_template_processing (void)
28341 /* FIXME: enable sanitization (PR87847) */
28342 decl_specializations
= hash_table
<spec_hasher
>::create_ggc (37, false);
28343 type_specializations
= hash_table
<spec_hasher
>::create_ggc (37, false);
28345 if (cxx_dialect
>= cxx11
)
28346 declare_integer_pack ();
28349 /* Print stats about the template hash tables for -fstats. */
28352 print_template_statistics (void)
28354 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
28355 "%f collisions\n", (long) decl_specializations
->size (),
28356 (long) decl_specializations
->elements (),
28357 decl_specializations
->collisions ());
28358 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
28359 "%f collisions\n", (long) type_specializations
->size (),
28360 (long) type_specializations
->elements (),
28361 type_specializations
->collisions ());
28366 namespace selftest
{
28368 /* Verify that build_non_dependent_expr () works, for various expressions,
28369 and that location wrappers don't affect the results. */
28372 test_build_non_dependent_expr ()
28374 location_t loc
= BUILTINS_LOCATION
;
28376 /* Verify constants, without and with location wrappers. */
28377 tree int_cst
= build_int_cst (integer_type_node
, 42);
28378 ASSERT_EQ (int_cst
, build_non_dependent_expr (int_cst
));
28380 tree wrapped_int_cst
= maybe_wrap_with_location (int_cst
, loc
);
28381 ASSERT_TRUE (location_wrapper_p (wrapped_int_cst
));
28382 ASSERT_EQ (wrapped_int_cst
, build_non_dependent_expr (wrapped_int_cst
));
28384 tree string_lit
= build_string (4, "foo");
28385 TREE_TYPE (string_lit
) = char_array_type_node
;
28386 string_lit
= fix_string_type (string_lit
);
28387 ASSERT_EQ (string_lit
, build_non_dependent_expr (string_lit
));
28389 tree wrapped_string_lit
= maybe_wrap_with_location (string_lit
, loc
);
28390 ASSERT_TRUE (location_wrapper_p (wrapped_string_lit
));
28391 ASSERT_EQ (wrapped_string_lit
,
28392 build_non_dependent_expr (wrapped_string_lit
));
28395 /* Verify that type_dependent_expression_p () works correctly, even
28396 in the presence of location wrapper nodes. */
28399 test_type_dependent_expression_p ()
28401 location_t loc
= BUILTINS_LOCATION
;
28403 tree name
= get_identifier ("foo");
28405 /* If no templates are involved, nothing is type-dependent. */
28406 gcc_assert (!processing_template_decl
);
28407 ASSERT_FALSE (type_dependent_expression_p (name
));
28409 ++processing_template_decl
;
28411 /* Within a template, an unresolved name is always type-dependent. */
28412 ASSERT_TRUE (type_dependent_expression_p (name
));
28414 /* Ensure it copes with NULL_TREE and errors. */
28415 ASSERT_FALSE (type_dependent_expression_p (NULL_TREE
));
28416 ASSERT_FALSE (type_dependent_expression_p (error_mark_node
));
28418 /* A USING_DECL in a template should be type-dependent, even if wrapped
28419 with a location wrapper (PR c++/83799). */
28420 tree using_decl
= build_lang_decl (USING_DECL
, name
, NULL_TREE
);
28421 TREE_TYPE (using_decl
) = integer_type_node
;
28422 ASSERT_TRUE (type_dependent_expression_p (using_decl
));
28423 tree wrapped_using_decl
= maybe_wrap_with_location (using_decl
, loc
);
28424 ASSERT_TRUE (location_wrapper_p (wrapped_using_decl
));
28425 ASSERT_TRUE (type_dependent_expression_p (wrapped_using_decl
));
28427 --processing_template_decl
;
28430 /* Run all of the selftests within this file. */
28435 test_build_non_dependent_expr ();
28436 test_type_dependent_expression_p ();
28439 } // namespace selftest
28441 #endif /* #if CHECKING_P */
28443 #include "gt-cp-pt.h"