1 /* Handle parameterized types (templates) for GNU -*- C++ -*-.
2 Copyright (C) 1992-2018 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(()) tree 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 saved_access_scope
= tree_cons
251 (NULL_TREE
, current_function_decl
, saved_access_scope
);
252 current_function_decl
= t
;
256 /* Restore the scope set up by push_access_scope. T is the node we
260 pop_access_scope (tree t
)
262 if (TREE_CODE (t
) == FUNCTION_DECL
)
264 current_function_decl
= TREE_VALUE (saved_access_scope
);
265 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
268 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
271 pop_from_top_level ();
274 /* Do any processing required when DECL (a member template
275 declaration) is finished. Returns the TEMPLATE_DECL corresponding
276 to DECL, unless it is a specialization, in which case the DECL
277 itself is returned. */
280 finish_member_template_decl (tree decl
)
282 if (decl
== error_mark_node
)
283 return error_mark_node
;
285 gcc_assert (DECL_P (decl
));
287 if (TREE_CODE (decl
) == TYPE_DECL
)
291 type
= TREE_TYPE (decl
);
292 if (type
== error_mark_node
)
293 return error_mark_node
;
294 if (MAYBE_CLASS_TYPE_P (type
)
295 && CLASSTYPE_TEMPLATE_INFO (type
)
296 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
298 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
299 check_member_template (tmpl
);
304 else if (TREE_CODE (decl
) == FIELD_DECL
)
305 error ("data member %qD cannot be a member template", decl
);
306 else if (DECL_TEMPLATE_INFO (decl
))
308 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
310 check_member_template (DECL_TI_TEMPLATE (decl
));
311 return DECL_TI_TEMPLATE (decl
);
317 error ("invalid member template declaration %qD", decl
);
319 return error_mark_node
;
322 /* Create a template info node. */
325 build_template_info (tree template_decl
, tree template_args
)
327 tree result
= make_node (TEMPLATE_INFO
);
328 TI_TEMPLATE (result
) = template_decl
;
329 TI_ARGS (result
) = template_args
;
333 /* Return the template info node corresponding to T, whatever T is. */
336 get_template_info (const_tree t
)
338 tree tinfo
= NULL_TREE
;
340 if (!t
|| t
== error_mark_node
)
343 if (TREE_CODE (t
) == NAMESPACE_DECL
344 || TREE_CODE (t
) == PARM_DECL
)
347 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
348 tinfo
= DECL_TEMPLATE_INFO (t
);
350 if (!tinfo
&& DECL_IMPLICIT_TYPEDEF_P (t
))
353 if (OVERLOAD_TYPE_P (t
))
354 tinfo
= TYPE_TEMPLATE_INFO (t
);
355 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
356 tinfo
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
);
361 /* Returns the template nesting level of the indicated class TYPE.
371 A<T>::B<U> has depth two, while A<T> has depth one.
372 Both A<T>::B<int> and A<int>::B<U> have depth one, if
373 they are instantiations, not specializations.
375 This function is guaranteed to return 0 if passed NULL_TREE so
376 that, for example, `template_class_depth (current_class_type)' is
380 template_class_depth (tree type
)
384 for (depth
= 0; type
&& TREE_CODE (type
) != NAMESPACE_DECL
; )
386 tree tinfo
= get_template_info (type
);
388 if (tinfo
&& PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
389 && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
))))
393 type
= CP_DECL_CONTEXT (type
);
394 else if (LAMBDA_TYPE_P (type
))
395 type
= LAMBDA_TYPE_EXTRA_SCOPE (type
);
397 type
= CP_TYPE_CONTEXT (type
);
403 /* Subroutine of maybe_begin_member_template_processing.
404 Returns true if processing DECL needs us to push template parms. */
407 inline_needs_template_parms (tree decl
, bool nsdmi
)
409 if (!decl
|| (!nsdmi
&& ! DECL_TEMPLATE_INFO (decl
)))
412 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
413 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
416 /* Subroutine of maybe_begin_member_template_processing.
417 Push the template parms in PARMS, starting from LEVELS steps into the
418 chain, and ending at the beginning, since template parms are listed
422 push_inline_template_parms_recursive (tree parmlist
, int levels
)
424 tree parms
= TREE_VALUE (parmlist
);
428 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
430 ++processing_template_decl
;
431 current_template_parms
432 = tree_cons (size_int (processing_template_decl
),
433 parms
, current_template_parms
);
434 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
436 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
438 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
440 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
442 if (error_operand_p (parm
))
445 gcc_assert (DECL_P (parm
));
447 switch (TREE_CODE (parm
))
455 /* Push the CONST_DECL. */
456 pushdecl (TEMPLATE_PARM_DECL (DECL_INITIAL (parm
)));
465 /* Restore the template parameter context for a member template, a
466 friend template defined in a class definition, or a non-template
467 member of template class. */
470 maybe_begin_member_template_processing (tree decl
)
474 bool nsdmi
= TREE_CODE (decl
) == FIELD_DECL
;
478 tree ctx
= DECL_CONTEXT (decl
);
479 decl
= (CLASSTYPE_TEMPLATE_INFO (ctx
)
480 /* Disregard full specializations (c++/60999). */
481 && uses_template_parms (ctx
)
482 ? CLASSTYPE_TI_TEMPLATE (ctx
) : NULL_TREE
);
485 if (inline_needs_template_parms (decl
, nsdmi
))
487 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
488 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
490 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
493 parms
= TREE_CHAIN (parms
);
496 push_inline_template_parms_recursive (parms
, levels
);
499 /* Remember how many levels of template parameters we pushed so that
500 we can pop them later. */
501 inline_parm_levels
.safe_push (levels
);
504 /* Undo the effects of maybe_begin_member_template_processing. */
507 maybe_end_member_template_processing (void)
512 if (inline_parm_levels
.length () == 0)
515 last
= inline_parm_levels
.pop ();
516 for (i
= 0; i
< last
; ++i
)
518 --processing_template_decl
;
519 current_template_parms
= TREE_CHAIN (current_template_parms
);
524 /* Return a new template argument vector which contains all of ARGS,
525 but has as its innermost set of arguments the EXTRA_ARGS. */
528 add_to_template_args (tree args
, tree extra_args
)
535 if (args
== NULL_TREE
|| extra_args
== error_mark_node
)
538 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
539 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
541 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
542 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
544 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
545 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
550 /* Like add_to_template_args, but only the outermost ARGS are added to
551 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
552 (EXTRA_ARGS) levels are added. This function is used to combine
553 the template arguments from a partial instantiation with the
554 template arguments used to attain the full instantiation from the
555 partial instantiation. */
558 add_outermost_template_args (tree args
, tree extra_args
)
562 /* If there are more levels of EXTRA_ARGS than there are ARGS,
563 something very fishy is going on. */
564 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
566 /* If *all* the new arguments will be the EXTRA_ARGS, just return
568 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
571 /* For the moment, we make ARGS look like it contains fewer levels. */
572 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
574 new_args
= add_to_template_args (args
, extra_args
);
576 /* Now, we restore ARGS to its full dimensions. */
577 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
582 /* Return the N levels of innermost template arguments from the ARGS. */
585 get_innermost_template_args (tree args
, int n
)
593 /* If N is 1, just return the innermost set of template arguments. */
595 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
597 /* If we're not removing anything, just return the arguments we were
599 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
600 gcc_assert (extra_levels
>= 0);
601 if (extra_levels
== 0)
604 /* Make a new set of arguments, not containing the outer arguments. */
605 new_args
= make_tree_vec (n
);
606 for (i
= 1; i
<= n
; ++i
)
607 SET_TMPL_ARGS_LEVEL (new_args
, i
,
608 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
613 /* The inverse of get_innermost_template_args: Return all but the innermost
614 EXTRA_LEVELS levels of template arguments from the ARGS. */
617 strip_innermost_template_args (tree args
, int extra_levels
)
620 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
625 /* If N is 1, just return the outermost set of template arguments. */
627 return TMPL_ARGS_LEVEL (args
, 1);
629 /* If we're not removing anything, just return the arguments we were
631 gcc_assert (extra_levels
>= 0);
632 if (extra_levels
== 0)
635 /* Make a new set of arguments, not containing the inner arguments. */
636 new_args
= make_tree_vec (n
);
637 for (i
= 1; i
<= n
; ++i
)
638 SET_TMPL_ARGS_LEVEL (new_args
, i
,
639 TMPL_ARGS_LEVEL (args
, i
));
644 /* We've got a template header coming up; push to a new level for storing
648 begin_template_parm_list (void)
650 /* We use a non-tag-transparent scope here, which causes pushtag to
651 put tags in this scope, rather than in the enclosing class or
652 namespace scope. This is the right thing, since we want
653 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
654 global template class, push_template_decl handles putting the
655 TEMPLATE_DECL into top-level scope. For a nested template class,
658 template <class T> struct S1 {
659 template <class T> struct S2 {};
662 pushtag contains special code to insert the TEMPLATE_DECL for S2
663 at the right scope. */
664 begin_scope (sk_template_parms
, NULL
);
665 ++processing_template_decl
;
666 ++processing_template_parmlist
;
667 note_template_header (0);
669 /* Add a dummy parameter level while we process the parameter list. */
670 current_template_parms
671 = tree_cons (size_int (processing_template_decl
),
673 current_template_parms
);
676 /* This routine is called when a specialization is declared. If it is
677 invalid to declare a specialization here, an error is reported and
678 false is returned, otherwise this routine will return true. */
681 check_specialization_scope (void)
683 tree scope
= current_scope ();
687 An explicit specialization shall be declared in the namespace of
688 which the template is a member, or, for member templates, in the
689 namespace of which the enclosing class or enclosing class
690 template is a member. An explicit specialization of a member
691 function, member class or static data member of a class template
692 shall be declared in the namespace of which the class template
694 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
696 error ("explicit specialization in non-namespace scope %qD", scope
);
702 In an explicit specialization declaration for a member of a class
703 template or a member template that appears in namespace scope,
704 the member template and some of its enclosing class templates may
705 remain unspecialized, except that the declaration shall not
706 explicitly specialize a class member template if its enclosing
707 class templates are not explicitly specialized as well. */
708 if (current_template_parms
)
710 error ("enclosing class templates are not explicitly specialized");
717 /* We've just seen template <>. */
720 begin_specialization (void)
722 begin_scope (sk_template_spec
, NULL
);
723 note_template_header (1);
724 return check_specialization_scope ();
727 /* Called at then end of processing a declaration preceded by
731 end_specialization (void)
734 reset_specialization ();
737 /* Any template <>'s that we have seen thus far are not referring to a
738 function specialization. */
741 reset_specialization (void)
743 processing_specialization
= 0;
744 template_header_count
= 0;
747 /* We've just seen a template header. If SPECIALIZATION is nonzero,
748 it was of the form template <>. */
751 note_template_header (int specialization
)
753 processing_specialization
= specialization
;
754 template_header_count
++;
757 /* We're beginning an explicit instantiation. */
760 begin_explicit_instantiation (void)
762 gcc_assert (!processing_explicit_instantiation
);
763 processing_explicit_instantiation
= true;
768 end_explicit_instantiation (void)
770 gcc_assert (processing_explicit_instantiation
);
771 processing_explicit_instantiation
= false;
774 /* An explicit specialization or partial specialization of TMPL is being
775 declared. Check that the namespace in which the specialization is
776 occurring is permissible. Returns false iff it is invalid to
777 specialize TMPL in the current namespace. */
780 check_specialization_namespace (tree tmpl
)
782 tree tpl_ns
= decl_namespace_context (tmpl
);
786 An explicit specialization shall be declared in a namespace enclosing the
787 specialized template. An explicit specialization whose declarator-id is
788 not qualified shall be declared in the nearest enclosing namespace of the
789 template, or, if the namespace is inline (7.3.1), any namespace from its
790 enclosing namespace set. */
791 if (current_scope() != DECL_CONTEXT (tmpl
)
792 && !at_namespace_scope_p ())
794 error ("specialization of %qD must appear at namespace scope", tmpl
);
798 if (is_nested_namespace (current_namespace
, tpl_ns
, cxx_dialect
< cxx11
))
799 /* Same or enclosing namespace. */
803 permerror (input_location
,
804 "specialization of %qD in different namespace", tmpl
);
805 inform (DECL_SOURCE_LOCATION (tmpl
),
806 " from definition of %q#D", tmpl
);
811 /* SPEC is an explicit instantiation. Check that it is valid to
812 perform this explicit instantiation in the current namespace. */
815 check_explicit_instantiation_namespace (tree spec
)
819 /* DR 275: An explicit instantiation shall appear in an enclosing
820 namespace of its template. */
821 ns
= decl_namespace_context (spec
);
822 if (!is_nested_namespace (current_namespace
, ns
))
823 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
824 "(which does not enclose namespace %qD)",
825 spec
, current_namespace
, ns
);
828 // Returns the type of a template specialization only if that
829 // specialization needs to be defined. Otherwise (e.g., if the type has
830 // already been defined), the function returns NULL_TREE.
832 maybe_new_partial_specialization (tree type
)
834 // An implicit instantiation of an incomplete type implies
835 // the definition of a new class template.
837 // template<typename T>
840 // template<typename T>
843 // Here, S<T*> is an implicit instantiation of S whose type
845 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
) && !COMPLETE_TYPE_P (type
))
848 // It can also be the case that TYPE is a completed specialization.
849 // Continuing the previous example, suppose we also declare:
851 // template<typename T>
852 // requires Integral<T>
855 // Here, S<T*> refers to the specialization S<T*> defined
856 // above. However, we need to differentiate definitions because
857 // we intend to define a new partial specialization. In this case,
858 // we rely on the fact that the constraints are different for
859 // this declaration than that above.
861 // Note that we also get here for injected class names and
862 // late-parsed template definitions. We must ensure that we
863 // do not create new type declarations for those cases.
864 if (flag_concepts
&& CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
866 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
867 tree args
= CLASSTYPE_TI_ARGS (type
);
869 // If there are no template parameters, this cannot be a new
870 // partial template specializtion?
871 if (!current_template_parms
)
874 // The injected-class-name is not a new partial specialization.
875 if (DECL_SELF_REFERENCE_P (TYPE_NAME (type
)))
878 // If the constraints are not the same as those of the primary
879 // then, we can probably create a new specialization.
880 tree type_constr
= current_template_constraints ();
882 if (type
== TREE_TYPE (tmpl
))
884 tree main_constr
= get_constraints (tmpl
);
885 if (equivalent_constraints (type_constr
, main_constr
))
889 // Also, if there's a pre-existing specialization with matching
890 // constraints, then this also isn't new.
891 tree specs
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
894 tree spec_tmpl
= TREE_VALUE (specs
);
895 tree spec_args
= TREE_PURPOSE (specs
);
896 tree spec_constr
= get_constraints (spec_tmpl
);
897 if (comp_template_args (args
, spec_args
)
898 && equivalent_constraints (type_constr
, spec_constr
))
900 specs
= TREE_CHAIN (specs
);
903 // Create a new type node (and corresponding type decl)
904 // for the newly declared specialization.
905 tree t
= make_class_type (TREE_CODE (type
));
906 CLASSTYPE_DECLARED_CLASS (t
) = CLASSTYPE_DECLARED_CLASS (type
);
907 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (tmpl
, args
));
909 /* We only need a separate type node for storing the definition of this
910 partial specialization; uses of S<T*> are unconstrained, so all are
911 equivalent. So keep TYPE_CANONICAL the same. */
912 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
914 // Build the corresponding type decl.
915 tree d
= create_implicit_typedef (DECL_NAME (tmpl
), t
);
916 DECL_CONTEXT (d
) = TYPE_CONTEXT (t
);
917 DECL_SOURCE_LOCATION (d
) = input_location
;
925 /* The TYPE is being declared. If it is a template type, that means it
926 is a partial specialization. Do appropriate error-checking. */
929 maybe_process_partial_specialization (tree type
)
933 if (type
== error_mark_node
)
934 return error_mark_node
;
936 /* A lambda that appears in specialization context is not itself a
938 if (CLASS_TYPE_P (type
) && CLASSTYPE_LAMBDA_EXPR (type
))
941 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
943 error ("name of class shadows template template parameter %qD",
945 return error_mark_node
;
948 context
= TYPE_CONTEXT (type
);
950 if (TYPE_ALIAS_P (type
))
952 tree tinfo
= TYPE_ALIAS_TEMPLATE_INFO (type
);
954 if (tinfo
&& DECL_ALIAS_TEMPLATE_P (TI_TEMPLATE (tinfo
)))
955 error ("specialization of alias template %qD",
956 TI_TEMPLATE (tinfo
));
958 error ("explicit specialization of non-template %qT", type
);
959 return error_mark_node
;
961 else if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
963 /* This is for ordinary explicit specialization and partial
964 specialization of a template class such as:
966 template <> class C<int>;
970 template <class T> class C<T*>;
972 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
974 if (tree t
= maybe_new_partial_specialization (type
))
976 if (!check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (t
))
977 && !at_namespace_scope_p ())
978 return error_mark_node
;
979 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (t
);
980 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (t
)) = input_location
;
981 if (processing_template_decl
)
983 tree decl
= push_template_decl (TYPE_MAIN_DECL (t
));
984 if (decl
== error_mark_node
)
985 return error_mark_node
;
986 return TREE_TYPE (decl
);
989 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
990 error ("specialization of %qT after instantiation", type
);
991 else if (errorcount
&& !processing_specialization
992 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
)
993 && !uses_template_parms (CLASSTYPE_TI_ARGS (type
)))
994 /* Trying to define a specialization either without a template<> header
995 or in an inappropriate place. We've already given an error, so just
996 bail now so we don't actually define the specialization. */
997 return error_mark_node
;
999 else if (CLASS_TYPE_P (type
)
1000 && !CLASSTYPE_USE_TEMPLATE (type
)
1001 && CLASSTYPE_TEMPLATE_INFO (type
)
1002 && context
&& CLASS_TYPE_P (context
)
1003 && CLASSTYPE_TEMPLATE_INFO (context
))
1005 /* This is for an explicit specialization of member class
1006 template according to [temp.expl.spec/18]:
1008 template <> template <class U> class C<int>::D;
1010 The context `C<int>' must be an implicit instantiation.
1011 Otherwise this is just a member class template declared
1014 template <> class C<int> { template <class U> class D; };
1015 template <> template <class U> class C<int>::D;
1017 In the first case, `C<int>::D' is a specialization of `C<T>::D'
1018 while in the second case, `C<int>::D' is a primary template
1019 and `C<T>::D' may not exist. */
1021 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
1022 && !COMPLETE_TYPE_P (type
))
1025 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
1027 if (current_namespace
1028 != decl_namespace_context (tmpl
))
1030 permerror (input_location
,
1031 "specializing %q#T in different namespace", type
);
1032 permerror (DECL_SOURCE_LOCATION (tmpl
),
1033 " from definition of %q#D", tmpl
);
1036 /* Check for invalid specialization after instantiation:
1038 template <> template <> class C<int>::D<int>;
1039 template <> template <class U> class C<int>::D; */
1041 for (t
= DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
1042 t
; t
= TREE_CHAIN (t
))
1044 tree inst
= TREE_VALUE (t
);
1045 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (inst
)
1046 || !COMPLETE_OR_OPEN_TYPE_P (inst
))
1048 /* We already have a full specialization of this partial
1049 instantiation, or a full specialization has been
1050 looked up but not instantiated. Reassign it to the
1051 new member specialization template. */
1055 elt
.tmpl
= most_general_template (tmpl
);
1056 elt
.args
= CLASSTYPE_TI_ARGS (inst
);
1059 type_specializations
->remove_elt (&elt
);
1062 elt
.args
= INNERMOST_TEMPLATE_ARGS (elt
.args
);
1065 = type_specializations
->find_slot (&elt
, INSERT
);
1066 entry
= ggc_alloc
<spec_entry
> ();
1071 /* But if we've had an implicit instantiation, that's a
1072 problem ([temp.expl.spec]/6). */
1073 error ("specialization %qT after instantiation %qT",
1077 /* Mark TYPE as a specialization. And as a result, we only
1078 have one level of template argument for the innermost
1080 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
1081 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
1082 CLASSTYPE_TI_ARGS (type
)
1083 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
1086 else if (processing_specialization
)
1088 /* Someday C++0x may allow for enum template specialization. */
1089 if (cxx_dialect
> cxx98
&& TREE_CODE (type
) == ENUMERAL_TYPE
1090 && CLASS_TYPE_P (context
) && CLASSTYPE_USE_TEMPLATE (context
))
1091 pedwarn (input_location
, OPT_Wpedantic
, "template specialization "
1092 "of %qD not allowed by ISO C++", type
);
1095 error ("explicit specialization of non-template %qT", type
);
1096 return error_mark_node
;
1103 /* Returns nonzero if we can optimize the retrieval of specializations
1104 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
1105 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
1108 optimize_specialization_lookup_p (tree tmpl
)
1110 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
1111 && DECL_CLASS_SCOPE_P (tmpl
)
1112 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
1114 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
1115 /* The optimized lookup depends on the fact that the
1116 template arguments for the member function template apply
1117 purely to the containing class, which is not true if the
1118 containing class is an explicit or partial
1120 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
1121 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
1122 && !DECL_CONV_FN_P (tmpl
)
1123 /* It is possible to have a template that is not a member
1124 template and is not a member of a template class:
1126 template <typename T>
1127 struct S { friend A::f(); };
1129 Here, the friend function is a template, but the context does
1130 not have template information. The optimized lookup relies
1131 on having ARGS be the template arguments for both the class
1132 and the function template. */
1133 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
1136 /* Make sure ARGS doesn't use any inappropriate typedefs; we should have
1137 gone through coerce_template_parms by now. */
1140 verify_unstripped_args_1 (tree inner
)
1142 for (int i
= 0; i
< TREE_VEC_LENGTH (inner
); ++i
)
1144 tree arg
= TREE_VEC_ELT (inner
, i
);
1145 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
1147 else if (TYPE_P (arg
))
1148 gcc_assert (strip_typedefs (arg
, NULL
) == arg
);
1149 else if (ARGUMENT_PACK_P (arg
))
1150 verify_unstripped_args_1 (ARGUMENT_PACK_ARGS (arg
));
1151 else if (strip_typedefs (TREE_TYPE (arg
), NULL
) != TREE_TYPE (arg
))
1152 /* Allow typedefs on the type of a non-type argument, since a
1153 parameter can have them. */;
1155 gcc_assert (strip_typedefs_expr (arg
, NULL
) == arg
);
1160 verify_unstripped_args (tree args
)
1162 ++processing_template_decl
;
1163 if (!any_dependent_template_arguments_p (args
))
1164 verify_unstripped_args_1 (INNERMOST_TEMPLATE_ARGS (args
));
1165 --processing_template_decl
;
1168 /* Retrieve the specialization (in the sense of [temp.spec] - a
1169 specialization is either an instantiation or an explicit
1170 specialization) of TMPL for the given template ARGS. If there is
1171 no such specialization, return NULL_TREE. The ARGS are a vector of
1172 arguments, or a vector of vectors of arguments, in the case of
1173 templates with more than one level of parameters.
1175 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1176 then we search for a partial specialization matching ARGS. This
1177 parameter is ignored if TMPL is not a class template.
1179 We can also look up a FIELD_DECL, if it is a lambda capture pack; the
1180 result is a NONTYPE_ARGUMENT_PACK. */
1183 retrieve_specialization (tree tmpl
, tree args
, hashval_t hash
)
1185 if (tmpl
== NULL_TREE
)
1188 if (args
== error_mark_node
)
1191 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
1192 || TREE_CODE (tmpl
) == FIELD_DECL
);
1194 /* There should be as many levels of arguments as there are
1195 levels of parameters. */
1196 gcc_assert (TMPL_ARGS_DEPTH (args
)
1197 == (TREE_CODE (tmpl
) == TEMPLATE_DECL
1198 ? TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
))
1199 : template_class_depth (DECL_CONTEXT (tmpl
))));
1202 verify_unstripped_args (args
);
1204 /* Lambda functions in templates aren't instantiated normally, but through
1205 tsubst_lambda_expr. */
1206 if (lambda_fn_in_template_p (tmpl
))
1209 if (optimize_specialization_lookup_p (tmpl
))
1211 /* The template arguments actually apply to the containing
1212 class. Find the class specialization with those
1214 tree class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
1215 tree class_specialization
1216 = retrieve_specialization (class_template
, args
, 0);
1217 if (!class_specialization
)
1220 /* Find the instance of TMPL. */
1221 tree fns
= get_class_binding (class_specialization
, DECL_NAME (tmpl
));
1222 for (ovl_iterator
iter (fns
); iter
; ++iter
)
1225 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
1226 /* using-declarations can add base methods to the method vec,
1227 and we don't want those here. */
1228 && DECL_CONTEXT (fn
) == class_specialization
)
1237 hash_table
<spec_hasher
> *specializations
;
1241 elt
.spec
= NULL_TREE
;
1243 if (DECL_CLASS_TEMPLATE_P (tmpl
))
1244 specializations
= type_specializations
;
1246 specializations
= decl_specializations
;
1249 hash
= spec_hasher::hash (&elt
);
1250 found
= specializations
->find_with_hash (&elt
, hash
);
1258 /* Like retrieve_specialization, but for local declarations. */
1261 retrieve_local_specialization (tree tmpl
)
1263 if (local_specializations
== NULL
)
1266 tree
*slot
= local_specializations
->get (tmpl
);
1267 return slot
? *slot
: NULL_TREE
;
1270 /* Returns nonzero iff DECL is a specialization of TMPL. */
1273 is_specialization_of (tree decl
, tree tmpl
)
1277 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1281 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1287 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1289 for (t
= TREE_TYPE (decl
);
1291 t
= CLASSTYPE_USE_TEMPLATE (t
)
1292 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1293 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1300 /* Returns nonzero iff DECL is a specialization of friend declaration
1301 FRIEND_DECL according to [temp.friend]. */
1304 is_specialization_of_friend (tree decl
, tree friend_decl
)
1306 bool need_template
= true;
1309 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1310 || TREE_CODE (decl
) == TYPE_DECL
);
1312 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1313 of a template class, we want to check if DECL is a specialization
1315 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1316 && DECL_TEMPLATE_INFO (friend_decl
)
1317 && !DECL_USE_TEMPLATE (friend_decl
))
1319 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1320 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1321 need_template
= false;
1323 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1324 && !PRIMARY_TEMPLATE_P (friend_decl
))
1325 need_template
= false;
1327 /* There is nothing to do if this is not a template friend. */
1328 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1331 if (is_specialization_of (decl
, friend_decl
))
1335 A member of a class template may be declared to be a friend of a
1336 non-template class. In this case, the corresponding member of
1337 every specialization of the class template is a friend of the
1338 class granting friendship.
1340 For example, given a template friend declaration
1342 template <class T> friend void A<T>::f();
1344 the member function below is considered a friend
1346 template <> struct A<int> {
1350 For this type of template friend, TEMPLATE_DEPTH below will be
1351 nonzero. To determine if DECL is a friend of FRIEND, we first
1352 check if the enclosing class is a specialization of another. */
1354 template_depth
= template_class_depth (CP_DECL_CONTEXT (friend_decl
));
1356 && DECL_CLASS_SCOPE_P (decl
)
1357 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1358 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1360 /* Next, we check the members themselves. In order to handle
1361 a few tricky cases, such as when FRIEND_DECL's are
1363 template <class T> friend void A<T>::g(T t);
1364 template <class T> template <T t> friend void A<T>::h();
1368 void A<int>::g(int);
1369 template <int> void A<int>::h();
1371 we need to figure out ARGS, the template arguments from
1372 the context of DECL. This is required for template substitution
1373 of `T' in the function parameter of `g' and template parameter
1374 of `h' in the above examples. Here ARGS corresponds to `int'. */
1376 tree context
= DECL_CONTEXT (decl
);
1377 tree args
= NULL_TREE
;
1378 int current_depth
= 0;
1380 while (current_depth
< template_depth
)
1382 if (CLASSTYPE_TEMPLATE_INFO (context
))
1384 if (current_depth
== 0)
1385 args
= TYPE_TI_ARGS (context
);
1387 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1390 context
= TYPE_CONTEXT (context
);
1393 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1398 tree friend_args_type
;
1399 tree decl_args_type
;
1401 /* Make sure that both DECL and FRIEND_DECL are templates or
1403 is_template
= DECL_TEMPLATE_INFO (decl
)
1404 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1405 if (need_template
^ is_template
)
1407 else if (is_template
)
1409 /* If both are templates, check template parameter list. */
1411 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1413 if (!comp_template_parms
1414 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1418 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1421 decl_type
= TREE_TYPE (decl
);
1423 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1424 tf_none
, NULL_TREE
);
1425 if (friend_type
== error_mark_node
)
1428 /* Check if return types match. */
1429 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1432 /* Check if function parameter types match, ignoring the
1433 `this' parameter. */
1434 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1435 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1436 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1437 friend_args_type
= TREE_CHAIN (friend_args_type
);
1438 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1439 decl_args_type
= TREE_CHAIN (decl_args_type
);
1441 return compparms (decl_args_type
, friend_args_type
);
1445 /* DECL is a TYPE_DECL */
1447 tree decl_type
= TREE_TYPE (decl
);
1449 /* Make sure that both DECL and FRIEND_DECL are templates or
1452 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1453 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1455 if (need_template
^ is_template
)
1457 else if (is_template
)
1460 /* If both are templates, check the name of the two
1461 TEMPLATE_DECL's first because is_friend didn't. */
1462 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1463 != DECL_NAME (friend_decl
))
1466 /* Now check template parameter list. */
1468 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1470 return comp_template_parms
1471 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1475 return (DECL_NAME (decl
)
1476 == DECL_NAME (friend_decl
));
1482 /* Register the specialization SPEC as a specialization of TMPL with
1483 the indicated ARGS. IS_FRIEND indicates whether the specialization
1484 is actually just a friend declaration. ATTRLIST is the list of
1485 attributes that the specialization is declared with or NULL when
1486 it isn't. Returns SPEC, or an equivalent prior declaration, if
1489 We also store instantiations of field packs in the hash table, even
1490 though they are not themselves templates, to make lookup easier. */
1493 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
,
1497 spec_entry
**slot
= NULL
;
1500 gcc_assert ((TREE_CODE (tmpl
) == TEMPLATE_DECL
&& DECL_P (spec
))
1501 || (TREE_CODE (tmpl
) == FIELD_DECL
1502 && TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
));
1504 if (TREE_CODE (spec
) == FUNCTION_DECL
1505 && uses_template_parms (DECL_TI_ARGS (spec
)))
1506 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1507 register it; we want the corresponding TEMPLATE_DECL instead.
1508 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1509 the more obvious `uses_template_parms (spec)' to avoid problems
1510 with default function arguments. In particular, given
1511 something like this:
1513 template <class T> void f(T t1, T t = T())
1515 the default argument expression is not substituted for in an
1516 instantiation unless and until it is actually needed. */
1519 if (optimize_specialization_lookup_p (tmpl
))
1520 /* We don't put these specializations in the hash table, but we might
1521 want to give an error about a mismatch. */
1522 fn
= retrieve_specialization (tmpl
, args
, 0);
1530 hash
= spec_hasher::hash (&elt
);
1533 decl_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
1535 fn
= ((spec_entry
*) *slot
)->spec
;
1540 /* We can sometimes try to re-register a specialization that we've
1541 already got. In particular, regenerate_decl_from_template calls
1542 duplicate_decls which will update the specialization list. But,
1543 we'll still get called again here anyhow. It's more convenient
1544 to simply allow this than to try to prevent it. */
1547 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1549 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1551 if (DECL_ODR_USED (fn
)
1552 || DECL_EXPLICIT_INSTANTIATION (fn
))
1554 error ("specialization of %qD after instantiation",
1556 return error_mark_node
;
1561 /* This situation should occur only if the first
1562 specialization is an implicit instantiation, the
1563 second is an explicit specialization, and the
1564 implicit instantiation has not yet been used. That
1565 situation can occur if we have implicitly
1566 instantiated a member function and then specialized
1569 We can also wind up here if a friend declaration that
1570 looked like an instantiation turns out to be a
1573 template <class T> void foo(T);
1574 class S { friend void foo<>(int) };
1575 template <> void foo(int);
1577 We transform the existing DECL in place so that any
1578 pointers to it become pointers to the updated
1581 If there was a definition for the template, but not
1582 for the specialization, we want this to look as if
1583 there were no definition, and vice versa. */
1584 DECL_INITIAL (fn
) = NULL_TREE
;
1585 duplicate_decls (spec
, fn
, is_friend
);
1586 /* The call to duplicate_decls will have applied
1589 An explicit specialization of a function template
1590 is inline only if it is explicitly declared to be,
1591 and independently of whether its function template
1594 to the primary function; now copy the inline bits to
1595 the various clones. */
1596 FOR_EACH_CLONE (clone
, fn
)
1598 DECL_DECLARED_INLINE_P (clone
)
1599 = DECL_DECLARED_INLINE_P (fn
);
1600 DECL_SOURCE_LOCATION (clone
)
1601 = DECL_SOURCE_LOCATION (fn
);
1602 DECL_DELETED_FN (clone
)
1603 = DECL_DELETED_FN (fn
);
1605 check_specialization_namespace (tmpl
);
1610 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1612 tree dd
= duplicate_decls (spec
, fn
, is_friend
);
1613 if (dd
== error_mark_node
)
1614 /* We've already complained in duplicate_decls. */
1615 return error_mark_node
;
1617 if (dd
== NULL_TREE
&& DECL_INITIAL (spec
))
1618 /* Dup decl failed, but this is a new definition. Set the
1619 line number so any errors match this new
1621 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1627 return duplicate_decls (spec
, fn
, is_friend
);
1629 /* A specialization must be declared in the same namespace as the
1630 template it is specializing. */
1631 if (DECL_P (spec
) && DECL_TEMPLATE_SPECIALIZATION (spec
)
1632 && !check_specialization_namespace (tmpl
))
1633 DECL_CONTEXT (spec
) = DECL_CONTEXT (tmpl
);
1635 if (slot
!= NULL
/* !optimize_specialization_lookup_p (tmpl) */)
1637 spec_entry
*entry
= ggc_alloc
<spec_entry
> ();
1638 gcc_assert (tmpl
&& args
&& spec
);
1641 if ((TREE_CODE (spec
) == FUNCTION_DECL
&& DECL_NAMESPACE_SCOPE_P (spec
)
1642 && PRIMARY_TEMPLATE_P (tmpl
)
1643 && DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (tmpl
)) == NULL_TREE
)
1644 || variable_template_p (tmpl
))
1645 /* If TMPL is a forward declaration of a template function, keep a list
1646 of all specializations in case we need to reassign them to a friend
1647 template later in tsubst_friend_function.
1649 Also keep a list of all variable template instantiations so that
1650 process_partial_specialization can check whether a later partial
1651 specialization would have used it. */
1652 DECL_TEMPLATE_INSTANTIATIONS (tmpl
)
1653 = tree_cons (args
, spec
, DECL_TEMPLATE_INSTANTIATIONS (tmpl
));
1659 /* Returns true iff two spec_entry nodes are equivalent. */
1661 int comparing_specializations
;
1664 spec_hasher::equal (spec_entry
*e1
, spec_entry
*e2
)
1668 ++comparing_specializations
;
1669 equal
= (e1
->tmpl
== e2
->tmpl
1670 && comp_template_args (e1
->args
, e2
->args
));
1671 if (equal
&& flag_concepts
1672 /* tmpl could be a FIELD_DECL for a capture pack. */
1673 && TREE_CODE (e1
->tmpl
) == TEMPLATE_DECL
1674 && VAR_P (DECL_TEMPLATE_RESULT (e1
->tmpl
))
1675 && uses_template_parms (e1
->args
))
1677 /* Partial specializations of a variable template can be distinguished by
1679 tree c1
= e1
->spec
? get_constraints (e1
->spec
) : NULL_TREE
;
1680 tree c2
= e2
->spec
? get_constraints (e2
->spec
) : NULL_TREE
;
1681 equal
= equivalent_constraints (c1
, c2
);
1683 --comparing_specializations
;
1688 /* Returns a hash for a template TMPL and template arguments ARGS. */
1691 hash_tmpl_and_args (tree tmpl
, tree args
)
1693 hashval_t val
= iterative_hash_object (DECL_UID (tmpl
), 0);
1694 return iterative_hash_template_arg (args
, val
);
1697 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1701 spec_hasher::hash (spec_entry
*e
)
1703 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
1706 /* Recursively calculate a hash value for a template argument ARG, for use
1707 in the hash tables of template specializations. */
1710 iterative_hash_template_arg (tree arg
, hashval_t val
)
1712 unsigned HOST_WIDE_INT i
;
1713 enum tree_code code
;
1716 if (arg
== NULL_TREE
)
1717 return iterative_hash_object (arg
, val
);
1722 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
1725 code
= TREE_CODE (arg
);
1726 tclass
= TREE_CODE_CLASS (code
);
1728 val
= iterative_hash_object (code
, val
);
1735 case IDENTIFIER_NODE
:
1736 return iterative_hash_object (IDENTIFIER_HASH_VALUE (arg
), val
);
1740 int i
, len
= TREE_VEC_LENGTH (arg
);
1741 for (i
= 0; i
< len
; ++i
)
1742 val
= iterative_hash_template_arg (TREE_VEC_ELT (arg
, i
), val
);
1746 case TYPE_PACK_EXPANSION
:
1747 case EXPR_PACK_EXPANSION
:
1748 val
= iterative_hash_template_arg (PACK_EXPANSION_PATTERN (arg
), val
);
1749 return iterative_hash_template_arg (PACK_EXPANSION_EXTRA_ARGS (arg
), val
);
1751 case TYPE_ARGUMENT_PACK
:
1752 case NONTYPE_ARGUMENT_PACK
:
1753 return iterative_hash_template_arg (ARGUMENT_PACK_ARGS (arg
), val
);
1756 for (; arg
; arg
= TREE_CHAIN (arg
))
1757 val
= iterative_hash_template_arg (TREE_VALUE (arg
), val
);
1761 for (lkp_iterator
iter (arg
); iter
; ++iter
)
1762 val
= iterative_hash_template_arg (*iter
, val
);
1768 iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1769 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg
), i
, field
, value
)
1771 val
= iterative_hash_template_arg (field
, val
);
1772 val
= iterative_hash_template_arg (value
, val
);
1778 if (!DECL_ARTIFICIAL (arg
))
1780 val
= iterative_hash_object (DECL_PARM_INDEX (arg
), val
);
1781 val
= iterative_hash_object (DECL_PARM_LEVEL (arg
), val
);
1783 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1786 return iterative_hash_template_arg (TARGET_EXPR_INITIAL (arg
), val
);
1789 val
= iterative_hash_template_arg (PTRMEM_CST_CLASS (arg
), val
);
1790 return iterative_hash_template_arg (PTRMEM_CST_MEMBER (arg
), val
);
1792 case TEMPLATE_PARM_INDEX
:
1793 val
= iterative_hash_template_arg
1794 (TREE_TYPE (TEMPLATE_PARM_DECL (arg
)), val
);
1795 val
= iterative_hash_object (TEMPLATE_PARM_LEVEL (arg
), val
);
1796 return iterative_hash_object (TEMPLATE_PARM_IDX (arg
), val
);
1799 val
= iterative_hash_object (TRAIT_EXPR_KIND (arg
), val
);
1800 val
= iterative_hash_template_arg (TRAIT_EXPR_TYPE1 (arg
), val
);
1801 return iterative_hash_template_arg (TRAIT_EXPR_TYPE2 (arg
), val
);
1804 val
= iterative_hash_template_arg (BINFO_TYPE (BASELINK_BINFO (arg
)),
1806 return iterative_hash_template_arg (DECL_NAME (get_first_fn (arg
)),
1810 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, 0), val
);
1811 code
= TREE_CODE (TREE_OPERAND (arg
, 1));
1812 val
= iterative_hash_object (code
, val
);
1813 return iterative_hash_template_arg (TREE_OPERAND (arg
, 2), val
);
1816 /* A lambda can't appear in a template arg, but don't crash on
1818 gcc_assert (seen_error ());
1822 case IMPLICIT_CONV_EXPR
:
1823 case STATIC_CAST_EXPR
:
1824 case REINTERPRET_CAST_EXPR
:
1825 case CONST_CAST_EXPR
:
1826 case DYNAMIC_CAST_EXPR
:
1828 val
= iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1829 /* Now hash operands as usual. */
1839 if (alias_template_specialization_p (arg
))
1841 // We want an alias specialization that survived strip_typedefs
1842 // to hash differently from its TYPE_CANONICAL, to avoid hash
1843 // collisions that compare as different in template_args_equal.
1844 // These could be dependent specializations that strip_typedefs
1845 // left alone, or untouched specializations because
1846 // coerce_template_parms returns the unconverted template
1847 // arguments if it sees incomplete argument packs.
1848 tree ti
= TYPE_ALIAS_TEMPLATE_INFO (arg
);
1849 return hash_tmpl_and_args (TI_TEMPLATE (ti
), TI_ARGS (ti
));
1851 if (TYPE_CANONICAL (arg
))
1852 return iterative_hash_object (TYPE_HASH (TYPE_CANONICAL (arg
)),
1854 else if (TREE_CODE (arg
) == DECLTYPE_TYPE
)
1855 return iterative_hash_template_arg (DECLTYPE_TYPE_EXPR (arg
), val
);
1856 /* Otherwise just compare the types during lookup. */
1859 case tcc_declaration
:
1861 return iterative_hash_expr (arg
, val
);
1864 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
1866 unsigned n
= cp_tree_operand_length (arg
);
1867 for (i
= 0; i
< n
; ++i
)
1868 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, i
), val
);
1876 /* Unregister the specialization SPEC as a specialization of TMPL.
1877 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1878 if the SPEC was listed as a specialization of TMPL.
1880 Note that SPEC has been ggc_freed, so we can't look inside it. */
1883 reregister_specialization (tree spec
, tree tinfo
, tree new_spec
)
1888 elt
.tmpl
= most_general_template (TI_TEMPLATE (tinfo
));
1889 elt
.args
= TI_ARGS (tinfo
);
1890 elt
.spec
= NULL_TREE
;
1892 entry
= decl_specializations
->find (&elt
);
1895 gcc_assert (entry
->spec
== spec
|| entry
->spec
== new_spec
);
1896 gcc_assert (new_spec
!= NULL_TREE
);
1897 entry
->spec
= new_spec
;
1904 /* Like register_specialization, but for local declarations. We are
1905 registering SPEC, an instantiation of TMPL. */
1908 register_local_specialization (tree spec
, tree tmpl
)
1910 gcc_assert (tmpl
!= spec
);
1911 local_specializations
->put (tmpl
, spec
);
1914 /* TYPE is a class type. Returns true if TYPE is an explicitly
1915 specialized class. */
1918 explicit_class_specialization_p (tree type
)
1920 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1922 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1925 /* Print the list of functions at FNS, going through all the overloads
1926 for each element of the list. Alternatively, FNS can not be a
1927 TREE_LIST, in which case it will be printed together with all the
1930 MORE and *STR should respectively be FALSE and NULL when the function
1931 is called from the outside. They are used internally on recursive
1932 calls. print_candidates manages the two parameters and leaves NULL
1933 in *STR when it ends. */
1936 print_candidates_1 (tree fns
, char **str
, bool more
= false)
1938 if (TREE_CODE (fns
) == TREE_LIST
)
1939 for (; fns
; fns
= TREE_CHAIN (fns
))
1940 print_candidates_1 (TREE_VALUE (fns
), str
, more
|| TREE_CHAIN (fns
));
1942 for (lkp_iterator
iter (fns
); iter
;)
1947 const char *pfx
= *str
;
1951 pfx
= _("candidates are:");
1953 pfx
= _("candidate is:");
1954 *str
= get_spaces (pfx
);
1956 inform (DECL_SOURCE_LOCATION (cand
), "%s %#qD", pfx
, cand
);
1960 /* Print the list of candidate FNS in an error message. FNS can also
1961 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
1964 print_candidates (tree fns
)
1967 print_candidates_1 (fns
, &str
);
1971 /* Get a (possibly) constrained template declaration for the
1972 purpose of ordering candidates. */
1974 get_template_for_ordering (tree list
)
1976 gcc_assert (TREE_CODE (list
) == TREE_LIST
);
1977 tree f
= TREE_VALUE (list
);
1978 if (tree ti
= DECL_TEMPLATE_INFO (f
))
1979 return TI_TEMPLATE (ti
);
1983 /* Among candidates having the same signature, return the
1984 most constrained or NULL_TREE if there is no best candidate.
1985 If the signatures of candidates vary (e.g., template
1986 specialization vs. member function), then there can be no
1989 Note that we don't compare constraints on the functions
1990 themselves, but rather those of their templates. */
1992 most_constrained_function (tree candidates
)
1994 // Try to find the best candidate in a first pass.
1995 tree champ
= candidates
;
1996 for (tree c
= TREE_CHAIN (champ
); c
; c
= TREE_CHAIN (c
))
1998 int winner
= more_constrained (get_template_for_ordering (champ
),
1999 get_template_for_ordering (c
));
2001 champ
= c
; // The candidate is more constrained
2002 else if (winner
== 0)
2003 return NULL_TREE
; // Neither is more constrained
2006 // Verify that the champ is better than previous candidates.
2007 for (tree c
= candidates
; c
!= champ
; c
= TREE_CHAIN (c
)) {
2008 if (!more_constrained (get_template_for_ordering (champ
),
2009 get_template_for_ordering (c
)))
2017 /* Returns the template (one of the functions given by TEMPLATE_ID)
2018 which can be specialized to match the indicated DECL with the
2019 explicit template args given in TEMPLATE_ID. The DECL may be
2020 NULL_TREE if none is available. In that case, the functions in
2021 TEMPLATE_ID are non-members.
2023 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
2024 specialization of a member template.
2026 The TEMPLATE_COUNT is the number of references to qualifying
2027 template classes that appeared in the name of the function. See
2028 check_explicit_specialization for a more accurate description.
2030 TSK indicates what kind of template declaration (if any) is being
2031 declared. TSK_TEMPLATE indicates that the declaration given by
2032 DECL, though a FUNCTION_DECL, has template parameters, and is
2033 therefore a template function.
2035 The template args (those explicitly specified and those deduced)
2036 are output in a newly created vector *TARGS_OUT.
2038 If it is impossible to determine the result, an error message is
2039 issued. The error_mark_node is returned to indicate failure. */
2042 determine_specialization (tree template_id
,
2045 int need_member_template
,
2051 tree explicit_targs
;
2052 tree candidates
= NULL_TREE
;
2054 /* A TREE_LIST of templates of which DECL may be a specialization.
2055 The TREE_VALUE of each node is a TEMPLATE_DECL. The
2056 corresponding TREE_PURPOSE is the set of template arguments that,
2057 when used to instantiate the template, would produce a function
2058 with the signature of DECL. */
2059 tree templates
= NULL_TREE
;
2061 cp_binding_level
*b
;
2063 *targs_out
= NULL_TREE
;
2065 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
2066 return error_mark_node
;
2068 /* We shouldn't be specializing a member template of an
2069 unspecialized class template; we already gave an error in
2070 check_specialization_scope, now avoid crashing. */
2072 && template_count
&& DECL_CLASS_SCOPE_P (decl
)
2073 && template_class_depth (DECL_CONTEXT (decl
)) > 0)
2075 gcc_assert (errorcount
);
2076 return error_mark_node
;
2079 fns
= TREE_OPERAND (template_id
, 0);
2080 explicit_targs
= TREE_OPERAND (template_id
, 1);
2082 if (fns
== error_mark_node
)
2083 return error_mark_node
;
2085 /* Check for baselinks. */
2086 if (BASELINK_P (fns
))
2087 fns
= BASELINK_FUNCTIONS (fns
);
2089 if (TREE_CODE (decl
) == FUNCTION_DECL
&& !is_overloaded_fn (fns
))
2091 error ("%qD is not a function template", fns
);
2092 return error_mark_node
;
2094 else if (VAR_P (decl
) && !variable_template_p (fns
))
2096 error ("%qD is not a variable template", fns
);
2097 return error_mark_node
;
2100 /* Count the number of template headers specified for this
2103 for (b
= current_binding_level
;
2104 b
->kind
== sk_template_parms
;
2108 tree orig_fns
= fns
;
2110 if (variable_template_p (fns
))
2112 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (fns
));
2113 targs
= coerce_template_parms (parms
, explicit_targs
, fns
,
2114 tf_warning_or_error
,
2115 /*req_all*/true, /*use_defarg*/true);
2116 if (targs
!= error_mark_node
)
2117 templates
= tree_cons (targs
, fns
, templates
);
2119 else for (lkp_iterator
iter (fns
); iter
; ++iter
)
2123 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2125 tree decl_arg_types
;
2129 /* In case of explicit specialization, we need to check if
2130 the number of template headers appearing in the specialization
2131 is correct. This is usually done in check_explicit_specialization,
2132 but the check done there cannot be exhaustive when specializing
2133 member functions. Consider the following code:
2135 template <> void A<int>::f(int);
2136 template <> template <> void A<int>::f(int);
2138 Assuming that A<int> is not itself an explicit specialization
2139 already, the first line specializes "f" which is a non-template
2140 member function, whilst the second line specializes "f" which
2141 is a template member function. So both lines are syntactically
2142 correct, and check_explicit_specialization does not reject
2145 Here, we can do better, as we are matching the specialization
2146 against the declarations. We count the number of template
2147 headers, and we check if they match TEMPLATE_COUNT + 1
2148 (TEMPLATE_COUNT is the number of qualifying template classes,
2149 plus there must be another header for the member template
2152 Notice that if header_count is zero, this is not a
2153 specialization but rather a template instantiation, so there
2154 is no check we can perform here. */
2155 if (header_count
&& header_count
!= template_count
+ 1)
2158 /* Check that the number of template arguments at the
2159 innermost level for DECL is the same as for FN. */
2160 if (current_binding_level
->kind
== sk_template_parms
2161 && !current_binding_level
->explicit_spec_p
2162 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
2163 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
2164 (current_template_parms
))))
2167 /* DECL might be a specialization of FN. */
2168 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2169 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
2171 /* For a non-static member function, we need to make sure
2172 that the const qualification is the same. Since
2173 get_bindings does not try to merge the "this" parameter,
2174 we must do the comparison explicitly. */
2175 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
2177 if (!same_type_p (TREE_VALUE (fn_arg_types
),
2178 TREE_VALUE (decl_arg_types
)))
2181 /* And the ref-qualification. */
2182 if (type_memfn_rqual (TREE_TYPE (decl
))
2183 != type_memfn_rqual (TREE_TYPE (fn
)))
2187 /* Skip the "this" parameter and, for constructors of
2188 classes with virtual bases, the VTT parameter. A
2189 full specialization of a constructor will have a VTT
2190 parameter, but a template never will. */
2192 = skip_artificial_parms_for (decl
, decl_arg_types
);
2194 = skip_artificial_parms_for (fn
, fn_arg_types
);
2196 /* Function templates cannot be specializations; there are
2197 no partial specializations of functions. Therefore, if
2198 the type of DECL does not match FN, there is no
2201 Note that it should never be the case that we have both
2202 candidates added here, and for regular member functions
2204 if (tsk
== tsk_template
)
2206 if (compparms (fn_arg_types
, decl_arg_types
))
2207 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2211 /* See whether this function might be a specialization of this
2212 template. Suppress access control because we might be trying
2213 to make this specialization a friend, and we have already done
2214 access control for the declaration of the specialization. */
2215 push_deferring_access_checks (dk_no_check
);
2216 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
2217 pop_deferring_access_checks ();
2220 /* We cannot deduce template arguments that when used to
2221 specialize TMPL will produce DECL. */
2224 if (uses_template_parms (targs
))
2225 /* We deduced something involving 'auto', which isn't a valid
2226 template argument. */
2229 /* Remove, from the set of candidates, all those functions
2230 whose constraints are not satisfied. */
2231 if (flag_concepts
&& !constraints_satisfied_p (fn
, targs
))
2234 // Then, try to form the new function type.
2235 insttype
= tsubst (TREE_TYPE (fn
), targs
, tf_fndecl_type
, NULL_TREE
);
2236 if (insttype
== error_mark_node
)
2239 = skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (insttype
));
2240 if (!compparms (fn_arg_types
, decl_arg_types
))
2243 /* Save this template, and the arguments deduced. */
2244 templates
= tree_cons (targs
, fn
, templates
);
2246 else if (need_member_template
)
2247 /* FN is an ordinary member function, and we need a
2248 specialization of a member template. */
2250 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
2251 /* We can get IDENTIFIER_NODEs here in certain erroneous
2254 else if (!DECL_FUNCTION_MEMBER_P (fn
))
2255 /* This is just an ordinary non-member function. Nothing can
2256 be a specialization of that. */
2258 else if (DECL_ARTIFICIAL (fn
))
2259 /* Cannot specialize functions that are created implicitly. */
2263 tree decl_arg_types
;
2265 /* This is an ordinary member function. However, since
2266 we're here, we can assume its enclosing class is a
2267 template class. For example,
2269 template <typename T> struct S { void f(); };
2270 template <> void S<int>::f() {}
2272 Here, S<int>::f is a non-template, but S<int> is a
2273 template class. If FN has the same type as DECL, we
2274 might be in business. */
2276 if (!DECL_TEMPLATE_INFO (fn
))
2277 /* Its enclosing class is an explicit specialization
2278 of a template class. This is not a candidate. */
2281 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
2282 TREE_TYPE (TREE_TYPE (fn
))))
2283 /* The return types differ. */
2286 /* Adjust the type of DECL in case FN is a static member. */
2287 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2288 if (DECL_STATIC_FUNCTION_P (fn
)
2289 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2290 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
2292 if (!compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
2296 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2297 && (type_memfn_rqual (TREE_TYPE (decl
))
2298 != type_memfn_rqual (TREE_TYPE (fn
))))
2301 // If the deduced arguments do not satisfy the constraints,
2302 // this is not a candidate.
2303 if (flag_concepts
&& !constraints_satisfied_p (fn
))
2306 // Add the candidate.
2307 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2311 if (templates
&& TREE_CHAIN (templates
))
2317 It is possible for a specialization with a given function
2318 signature to be instantiated from more than one function
2319 template. In such cases, explicit specification of the
2320 template arguments must be used to uniquely identify the
2321 function template specialization being specialized.
2323 Note that here, there's no suggestion that we're supposed to
2324 determine which of the candidate templates is most
2325 specialized. However, we, also have:
2329 Partial ordering of overloaded function template
2330 declarations is used in the following contexts to select
2331 the function template to which a function template
2332 specialization refers:
2334 -- when an explicit specialization refers to a function
2337 So, we do use the partial ordering rules, at least for now.
2338 This extension can only serve to make invalid programs valid,
2339 so it's safe. And, there is strong anecdotal evidence that
2340 the committee intended the partial ordering rules to apply;
2341 the EDG front end has that behavior, and John Spicer claims
2342 that the committee simply forgot to delete the wording in
2343 [temp.expl.spec]. */
2344 tree tmpl
= most_specialized_instantiation (templates
);
2345 if (tmpl
!= error_mark_node
)
2348 TREE_CHAIN (templates
) = NULL_TREE
;
2352 // Concepts allows multiple declarations of member functions
2353 // with the same signature. Like above, we need to rely on
2354 // on the partial ordering of those candidates to determine which
2356 if (flag_concepts
&& candidates
&& TREE_CHAIN (candidates
))
2358 if (tree cand
= most_constrained_function (candidates
))
2361 TREE_CHAIN (cand
) = NULL_TREE
;
2365 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
2367 error ("template-id %qD for %q+D does not match any template "
2368 "declaration", template_id
, decl
);
2369 if (header_count
&& header_count
!= template_count
+ 1)
2370 inform (input_location
, "saw %d %<template<>%>, need %d for "
2371 "specializing a member function template",
2372 header_count
, template_count
+ 1);
2374 print_candidates (orig_fns
);
2375 return error_mark_node
;
2377 else if ((templates
&& TREE_CHAIN (templates
))
2378 || (candidates
&& TREE_CHAIN (candidates
))
2379 || (templates
&& candidates
))
2381 error ("ambiguous template specialization %qD for %q+D",
2383 candidates
= chainon (candidates
, templates
);
2384 print_candidates (candidates
);
2385 return error_mark_node
;
2388 /* We have one, and exactly one, match. */
2391 tree fn
= TREE_VALUE (candidates
);
2392 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
2394 // Propagate the candidate's constraints to the declaration.
2395 set_constraints (decl
, get_constraints (fn
));
2397 /* DECL is a re-declaration or partial instantiation of a template
2399 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2401 /* It was a specialization of an ordinary member function in a
2403 return DECL_TI_TEMPLATE (fn
);
2406 /* It was a specialization of a template. */
2407 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
2408 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
2410 *targs_out
= copy_node (targs
);
2411 SET_TMPL_ARGS_LEVEL (*targs_out
,
2412 TMPL_ARGS_DEPTH (*targs_out
),
2413 TREE_PURPOSE (templates
));
2416 *targs_out
= TREE_PURPOSE (templates
);
2417 return TREE_VALUE (templates
);
2420 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2421 but with the default argument values filled in from those in the
2425 copy_default_args_to_explicit_spec_1 (tree spec_types
,
2428 tree new_spec_types
;
2433 if (spec_types
== void_list_node
)
2434 return void_list_node
;
2436 /* Substitute into the rest of the list. */
2438 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
2439 TREE_CHAIN (tmpl_types
));
2441 /* Add the default argument for this parameter. */
2442 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
2443 TREE_VALUE (spec_types
),
2447 /* DECL is an explicit specialization. Replicate default arguments
2448 from the template it specializes. (That way, code like:
2450 template <class T> void f(T = 3);
2451 template <> void f(double);
2454 works, as required.) An alternative approach would be to look up
2455 the correct default arguments at the call-site, but this approach
2456 is consistent with how implicit instantiations are handled. */
2459 copy_default_args_to_explicit_spec (tree decl
)
2464 tree new_spec_types
;
2468 tree object_type
= NULL_TREE
;
2469 tree in_charge
= NULL_TREE
;
2470 tree vtt
= NULL_TREE
;
2472 /* See if there's anything we need to do. */
2473 tmpl
= DECL_TI_TEMPLATE (decl
);
2474 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
2475 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
2476 if (TREE_PURPOSE (t
))
2481 old_type
= TREE_TYPE (decl
);
2482 spec_types
= TYPE_ARG_TYPES (old_type
);
2484 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2486 /* Remove the this pointer, but remember the object's type for
2488 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
2489 spec_types
= TREE_CHAIN (spec_types
);
2490 tmpl_types
= TREE_CHAIN (tmpl_types
);
2492 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
2494 /* DECL may contain more parameters than TMPL due to the extra
2495 in-charge parameter in constructors and destructors. */
2496 in_charge
= spec_types
;
2497 spec_types
= TREE_CHAIN (spec_types
);
2499 if (DECL_HAS_VTT_PARM_P (decl
))
2502 spec_types
= TREE_CHAIN (spec_types
);
2506 /* Compute the merged default arguments. */
2508 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
2510 /* Compute the new FUNCTION_TYPE. */
2514 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
2519 /* Put the in-charge parameter back. */
2520 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
2521 TREE_VALUE (in_charge
),
2524 new_type
= build_method_type_directly (object_type
,
2525 TREE_TYPE (old_type
),
2529 new_type
= build_function_type (TREE_TYPE (old_type
),
2531 new_type
= cp_build_type_attribute_variant (new_type
,
2532 TYPE_ATTRIBUTES (old_type
));
2533 new_type
= cxx_copy_lang_qualifiers (new_type
, old_type
);
2535 TREE_TYPE (decl
) = new_type
;
2538 /* Return the number of template headers we expect to see for a definition
2539 or specialization of CTYPE or one of its non-template members. */
2542 num_template_headers_for_class (tree ctype
)
2544 int num_templates
= 0;
2546 while (ctype
&& CLASS_TYPE_P (ctype
))
2548 /* You're supposed to have one `template <...>' for every
2549 template class, but you don't need one for a full
2550 specialization. For example:
2552 template <class T> struct S{};
2553 template <> struct S<int> { void f(); };
2554 void S<int>::f () {}
2556 is correct; there shouldn't be a `template <>' for the
2557 definition of `S<int>::f'. */
2558 if (!CLASSTYPE_TEMPLATE_INFO (ctype
))
2559 /* If CTYPE does not have template information of any
2560 kind, then it is not a template, nor is it nested
2561 within a template. */
2563 if (explicit_class_specialization_p (ctype
))
2565 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (ctype
)))
2568 ctype
= TYPE_CONTEXT (ctype
);
2571 return num_templates
;
2574 /* Do a simple sanity check on the template headers that precede the
2575 variable declaration DECL. */
2578 check_template_variable (tree decl
)
2580 tree ctx
= CP_DECL_CONTEXT (decl
);
2581 int wanted
= num_template_headers_for_class (ctx
);
2582 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
2583 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
2585 if (cxx_dialect
< cxx14
)
2586 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2587 "variable templates only available with "
2588 "-std=c++14 or -std=gnu++14");
2590 // Namespace-scope variable templates should have a template header.
2593 if (template_header_count
> wanted
)
2595 bool warned
= pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2596 "too many template headers for %qD "
2599 if (warned
&& CLASS_TYPE_P (ctx
)
2600 && CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2601 inform (DECL_SOURCE_LOCATION (decl
),
2602 "members of an explicitly specialized class are defined "
2603 "without a template header");
2607 /* An explicit specialization whose declarator-id or class-head-name is not
2608 qualified shall be declared in the nearest enclosing namespace of the
2609 template, or, if the namespace is inline (7.3.1), any namespace from its
2610 enclosing namespace set.
2612 If the name declared in the explicit instantiation is an unqualified name,
2613 the explicit instantiation shall appear in the namespace where its template
2614 is declared or, if that namespace is inline (7.3.1), any namespace from its
2615 enclosing namespace set. */
2618 check_unqualified_spec_or_inst (tree t
, location_t loc
)
2620 tree tmpl
= most_general_template (t
);
2621 if (DECL_NAMESPACE_SCOPE_P (tmpl
)
2622 && !is_nested_namespace (current_namespace
,
2623 CP_DECL_CONTEXT (tmpl
), true))
2625 if (processing_specialization
)
2626 permerror (loc
, "explicit specialization of %qD outside its "
2627 "namespace must use a nested-name-specifier", tmpl
);
2628 else if (processing_explicit_instantiation
2629 && cxx_dialect
>= cxx11
)
2630 /* This was allowed in C++98, so only pedwarn. */
2631 pedwarn (loc
, OPT_Wpedantic
, "explicit instantiation of %qD "
2632 "outside its namespace must use a nested-name-"
2637 /* Warn for a template specialization SPEC that is missing some of a set
2638 of function or type attributes that the template TEMPL is declared with.
2639 ATTRLIST is a list of additional attributes that SPEC should be taken
2640 to ultimately be declared with. */
2643 warn_spec_missing_attributes (tree tmpl
, tree spec
, tree attrlist
)
2645 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
2646 tmpl
= DECL_TEMPLATE_RESULT (tmpl
);
2648 if (TREE_CODE (tmpl
) != FUNCTION_DECL
)
2651 /* Avoid warning if either declaration or its type is deprecated. */
2652 if (TREE_DEPRECATED (tmpl
)
2653 || TREE_DEPRECATED (spec
))
2656 tree tmpl_type
= TREE_TYPE (tmpl
);
2657 tree spec_type
= TREE_TYPE (spec
);
2659 if (TREE_DEPRECATED (tmpl_type
)
2660 || TREE_DEPRECATED (spec_type
)
2661 || TREE_DEPRECATED (TREE_TYPE (tmpl_type
))
2662 || TREE_DEPRECATED (TREE_TYPE (spec_type
)))
2665 tree tmpl_attrs
[] = { DECL_ATTRIBUTES (tmpl
), TYPE_ATTRIBUTES (tmpl_type
) };
2666 tree spec_attrs
[] = { DECL_ATTRIBUTES (spec
), TYPE_ATTRIBUTES (spec_type
) };
2669 spec_attrs
[0] = attrlist
;
2670 else if (!spec_attrs
[1])
2671 spec_attrs
[1] = attrlist
;
2673 /* Avoid warning if the primary has no attributes. */
2674 if (!tmpl_attrs
[0] && !tmpl_attrs
[1])
2677 /* Avoid warning if either declaration contains an attribute on
2678 the white list below. */
2679 const char* const whitelist
[] = {
2683 for (unsigned i
= 0; i
!= 2; ++i
)
2684 for (unsigned j
= 0; j
!= sizeof whitelist
/ sizeof *whitelist
; ++j
)
2685 if (lookup_attribute (whitelist
[j
], tmpl_attrs
[i
])
2686 || lookup_attribute (whitelist
[j
], spec_attrs
[i
]))
2689 /* Avoid warning if the difference between the primary and
2690 the specialization is not in one of the attributes below. */
2691 const char* const blacklist
[] = {
2692 "alloc_align", "alloc_size", "assume_aligned", "format",
2693 "format_arg", "malloc", "nonnull"
2696 /* Put together a list of the black listed attributes that the primary
2697 template is declared with that the specialization is not, in case
2698 it's not apparent from the most recent declaration of the primary. */
2699 unsigned nattrs
= 0;
2702 for (unsigned i
= 0; i
!= sizeof blacklist
/ sizeof *blacklist
; ++i
)
2704 for (unsigned j
= 0; j
!= 2; ++j
)
2706 if (!lookup_attribute (blacklist
[i
], tmpl_attrs
[j
]))
2709 for (unsigned k
= 0; k
!= 1 + !!spec_attrs
[1]; ++k
)
2711 if (lookup_attribute (blacklist
[i
], spec_attrs
[k
]))
2715 pp_string (&str
, ", ");
2716 pp_begin_quote (&str
, pp_show_color (global_dc
->printer
));
2717 pp_string (&str
, blacklist
[i
]);
2718 pp_end_quote (&str
, pp_show_color (global_dc
->printer
));
2727 if (warning_at (DECL_SOURCE_LOCATION (spec
), OPT_Wmissing_attributes
,
2728 "explicit specialization %q#D may be missing attributes",
2730 inform (DECL_SOURCE_LOCATION (tmpl
),
2732 ? G_("missing primary template attributes %s")
2733 : G_("missing primary template attribute %s"),
2734 pp_formatted_text (&str
));
2737 /* Check to see if the function just declared, as indicated in
2738 DECLARATOR, and in DECL, is a specialization of a function
2739 template. We may also discover that the declaration is an explicit
2740 instantiation at this point.
2742 Returns DECL, or an equivalent declaration that should be used
2743 instead if all goes well. Issues an error message if something is
2744 amiss. Returns error_mark_node if the error is not easily
2747 FLAGS is a bitmask consisting of the following flags:
2749 2: The function has a definition.
2750 4: The function is a friend.
2752 The TEMPLATE_COUNT is the number of references to qualifying
2753 template classes that appeared in the name of the function. For
2756 template <class T> struct S { void f(); };
2759 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2760 classes are not counted in the TEMPLATE_COUNT, so that in
2762 template <class T> struct S {};
2763 template <> struct S<int> { void f(); }
2764 template <> void S<int>::f();
2766 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2767 invalid; there should be no template <>.)
2769 If the function is a specialization, it is marked as such via
2770 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2771 is set up correctly, and it is added to the list of specializations
2772 for that template. */
2775 check_explicit_specialization (tree declarator
,
2781 int have_def
= flags
& 2;
2782 int is_friend
= flags
& 4;
2783 bool is_concept
= flags
& 8;
2784 int specialization
= 0;
2785 int explicit_instantiation
= 0;
2786 int member_specialization
= 0;
2787 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2788 tree dname
= DECL_NAME (decl
);
2793 if (!processing_specialization
)
2796 tsk
= tsk_excessive_parms
;
2799 tsk
= current_tmpl_spec_kind (template_count
);
2804 if (processing_specialization
&& !VAR_P (decl
))
2807 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2809 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2812 /* This could be something like:
2814 template <class T> void f(T);
2815 class S { friend void f<>(int); } */
2819 /* This case handles bogus declarations like template <>
2820 template <class T> void f<int>(); */
2822 error ("template-id %qD in declaration of primary template",
2829 case tsk_invalid_member_spec
:
2830 /* The error has already been reported in
2831 check_specialization_scope. */
2832 return error_mark_node
;
2834 case tsk_invalid_expl_inst
:
2835 error ("template parameter list used in explicit instantiation");
2841 error ("definition provided for explicit instantiation");
2843 explicit_instantiation
= 1;
2846 case tsk_excessive_parms
:
2847 case tsk_insufficient_parms
:
2848 if (tsk
== tsk_excessive_parms
)
2849 error ("too many template parameter lists in declaration of %qD",
2851 else if (template_header_count
)
2852 error("too few template parameter lists in declaration of %qD", decl
);
2854 error("explicit specialization of %qD must be introduced by "
2855 "%<template <>%>", decl
);
2860 error ("explicit specialization declared %<concept%>");
2862 if (VAR_P (decl
) && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2863 /* In cases like template<> constexpr bool v = true;
2864 We'll give an error in check_template_variable. */
2867 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2869 member_specialization
= 1;
2875 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2877 /* This case handles bogus declarations like template <>
2878 template <class T> void f<int>(); */
2880 if (!uses_template_parms (declarator
))
2881 error ("template-id %qD in declaration of primary template",
2883 else if (variable_template_p (TREE_OPERAND (declarator
, 0)))
2885 /* Partial specialization of variable template. */
2886 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2890 else if (cxx_dialect
< cxx14
)
2891 error ("non-type partial specialization %qD "
2892 "is not allowed", declarator
);
2894 error ("non-class, non-variable partial specialization %qD "
2895 "is not allowed", declarator
);
2900 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2901 /* This is a specialization of a member template, without
2902 specialization the containing class. Something like:
2904 template <class T> struct S {
2905 template <class U> void f (U);
2907 template <> template <class U> void S<int>::f(U) {}
2909 That's a specialization -- but of the entire template. */
2917 if ((specialization
|| member_specialization
)
2918 /* This doesn't apply to variable templates. */
2919 && (TREE_CODE (TREE_TYPE (decl
)) == FUNCTION_TYPE
2920 || TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
))
2922 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2923 for (; t
; t
= TREE_CHAIN (t
))
2924 if (TREE_PURPOSE (t
))
2926 permerror (input_location
,
2927 "default argument specified in explicit specialization");
2932 if (specialization
|| member_specialization
|| explicit_instantiation
)
2934 tree tmpl
= NULL_TREE
;
2935 tree targs
= NULL_TREE
;
2936 bool was_template_id
= (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
);
2938 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2939 if (!was_template_id
)
2943 gcc_assert (identifier_p (declarator
));
2948 /* If there is no class context, the explicit instantiation
2949 must be at namespace scope. */
2950 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2952 /* Find the namespace binding, using the declaration
2954 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2956 if (fns
== error_mark_node
)
2957 /* If lookup fails, look for a friend declaration so we can
2958 give a better diagnostic. */
2959 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2960 /*type*/false, /*complain*/true,
2963 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2965 error ("%qD is not a template function", dname
);
2966 fns
= error_mark_node
;
2970 declarator
= lookup_template_function (fns
, NULL_TREE
);
2973 if (declarator
== error_mark_node
)
2974 return error_mark_node
;
2976 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2978 if (!explicit_instantiation
)
2979 /* A specialization in class scope. This is invalid,
2980 but the error will already have been flagged by
2981 check_specialization_scope. */
2982 return error_mark_node
;
2985 /* It's not valid to write an explicit instantiation in
2988 class C { template void f(); }
2990 This case is caught by the parser. However, on
2993 template class C { void f(); };
2995 (which is invalid) we can get here. The error will be
3002 else if (ctype
!= NULL_TREE
3003 && (identifier_p (TREE_OPERAND (declarator
, 0))))
3005 // We'll match variable templates in start_decl.
3009 /* Find the list of functions in ctype that have the same
3010 name as the declared function. */
3011 tree name
= TREE_OPERAND (declarator
, 0);
3013 if (constructor_name_p (name
, ctype
))
3015 if (DECL_CONSTRUCTOR_P (decl
)
3016 ? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
3017 : !CLASSTYPE_DESTRUCTOR (ctype
))
3019 /* From [temp.expl.spec]:
3021 If such an explicit specialization for the member
3022 of a class template names an implicitly-declared
3023 special member function (clause _special_), the
3024 program is ill-formed.
3026 Similar language is found in [temp.explicit]. */
3027 error ("specialization of implicitly-declared special member function");
3028 return error_mark_node
;
3031 name
= DECL_NAME (decl
);
3034 /* For a type-conversion operator, We might be looking for
3035 `operator int' which will be a specialization of
3036 `operator T'. Grab all the conversion operators, and
3037 then select from them. */
3038 tree fns
= get_class_binding (ctype
, IDENTIFIER_CONV_OP_P (name
)
3039 ? conv_op_identifier
: name
);
3041 if (fns
== NULL_TREE
)
3043 error ("no member function %qD declared in %qT", name
, ctype
);
3044 return error_mark_node
;
3047 TREE_OPERAND (declarator
, 0) = fns
;
3050 /* Figure out what exactly is being specialized at this point.
3051 Note that for an explicit instantiation, even one for a
3052 member function, we cannot tell a priori whether the
3053 instantiation is for a member template, or just a member
3054 function of a template class. Even if a member template is
3055 being instantiated, the member template arguments may be
3056 elided if they can be deduced from the rest of the
3058 tmpl
= determine_specialization (declarator
, decl
,
3060 member_specialization
,
3064 if (!tmpl
|| tmpl
== error_mark_node
)
3065 /* We couldn't figure out what this declaration was
3067 return error_mark_node
;
3070 if (TREE_CODE (decl
) == FUNCTION_DECL
3071 && DECL_HIDDEN_FRIEND_P (tmpl
))
3073 if (pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
3074 "friend declaration %qD is not visible to "
3075 "explicit specialization", tmpl
))
3076 inform (DECL_SOURCE_LOCATION (tmpl
),
3077 "friend declaration here");
3079 else if (!ctype
&& !is_friend
3080 && CP_DECL_CONTEXT (decl
) == current_namespace
)
3081 check_unqualified_spec_or_inst (tmpl
, DECL_SOURCE_LOCATION (decl
));
3083 tree gen_tmpl
= most_general_template (tmpl
);
3085 if (explicit_instantiation
)
3087 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
3088 is done by do_decl_instantiation later. */
3090 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
3091 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
3093 if (arg_depth
> parm_depth
)
3095 /* If TMPL is not the most general template (for
3096 example, if TMPL is a friend template that is
3097 injected into namespace scope), then there will
3098 be too many levels of TARGS. Remove some of them
3103 new_targs
= make_tree_vec (parm_depth
);
3104 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
3105 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
3106 = TREE_VEC_ELT (targs
, i
);
3110 return instantiate_template (tmpl
, targs
, tf_error
);
3113 /* If we thought that the DECL was a member function, but it
3114 turns out to be specializing a static member function,
3115 make DECL a static member function as well. */
3116 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
3117 && DECL_STATIC_FUNCTION_P (tmpl
)
3118 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
3119 revert_static_member_fn (decl
);
3121 /* If this is a specialization of a member template of a
3122 template class, we want to return the TEMPLATE_DECL, not
3123 the specialization of it. */
3124 if (tsk
== tsk_template
&& !was_template_id
)
3126 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
3127 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
3128 DECL_INITIAL (result
) = NULL_TREE
;
3132 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
3133 DECL_SOURCE_LOCATION (result
)
3134 = DECL_SOURCE_LOCATION (decl
);
3135 /* We want to use the argument list specified in the
3136 definition, not in the original declaration. */
3137 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
3138 for (parm
= DECL_ARGUMENTS (result
); parm
;
3139 parm
= DECL_CHAIN (parm
))
3140 DECL_CONTEXT (parm
) = result
;
3142 return register_specialization (tmpl
, gen_tmpl
, targs
,
3146 /* Set up the DECL_TEMPLATE_INFO for DECL. */
3147 DECL_TEMPLATE_INFO (decl
) = build_template_info (tmpl
, targs
);
3149 if (was_template_id
)
3150 TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
)) = true;
3152 /* Inherit default function arguments from the template
3153 DECL is specializing. */
3154 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
3155 copy_default_args_to_explicit_spec (decl
);
3157 /* This specialization has the same protection as the
3158 template it specializes. */
3159 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
3160 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
3162 /* 7.1.1-1 [dcl.stc]
3164 A storage-class-specifier shall not be specified in an
3165 explicit specialization...
3167 The parser rejects these, so unless action is taken here,
3168 explicit function specializations will always appear with
3171 The action recommended by the C++ CWG in response to C++
3172 defect report 605 is to make the storage class and linkage
3173 of the explicit specialization match the templated function:
3175 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
3177 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
3179 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
3180 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
3182 /* A concept cannot be specialized. */
3183 if (DECL_DECLARED_CONCEPT_P (tmpl_func
))
3185 error ("explicit specialization of function concept %qD",
3187 return error_mark_node
;
3190 /* This specialization has the same linkage and visibility as
3191 the function template it specializes. */
3192 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
3193 if (! TREE_PUBLIC (decl
))
3195 DECL_INTERFACE_KNOWN (decl
) = 1;
3196 DECL_NOT_REALLY_EXTERN (decl
) = 1;
3198 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
3199 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
3201 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
3202 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
3206 /* If DECL is a friend declaration, declared using an
3207 unqualified name, the namespace associated with DECL may
3208 have been set incorrectly. For example, in:
3210 template <typename T> void f(T);
3212 struct S { friend void f<int>(int); }
3215 we will have set the DECL_CONTEXT for the friend
3216 declaration to N, rather than to the global namespace. */
3217 if (DECL_NAMESPACE_SCOPE_P (decl
))
3218 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
3220 if (is_friend
&& !have_def
)
3221 /* This is not really a declaration of a specialization.
3222 It's just the name of an instantiation. But, it's not
3223 a request for an instantiation, either. */
3224 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
3225 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
3226 /* A specialization is not necessarily COMDAT. */
3227 DECL_COMDAT (decl
) = (TREE_PUBLIC (decl
)
3228 && DECL_DECLARED_INLINE_P (decl
));
3229 else if (VAR_P (decl
))
3230 DECL_COMDAT (decl
) = false;
3232 /* If this is a full specialization, register it so that we can find
3233 it again. Partial specializations will be registered in
3234 process_partial_specialization. */
3235 if (!processing_template_decl
)
3237 warn_spec_missing_attributes (gen_tmpl
, decl
, attrlist
);
3239 decl
= register_specialization (decl
, gen_tmpl
, targs
,
3244 /* A 'structor should already have clones. */
3245 gcc_assert (decl
== error_mark_node
3246 || variable_template_p (tmpl
)
3247 || !(DECL_CONSTRUCTOR_P (decl
)
3248 || DECL_DESTRUCTOR_P (decl
))
3249 || DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)));
3256 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
3257 parameters. These are represented in the same format used for
3258 DECL_TEMPLATE_PARMS. */
3261 comp_template_parms (const_tree parms1
, const_tree parms2
)
3266 if (parms1
== parms2
)
3269 for (p1
= parms1
, p2
= parms2
;
3270 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
3271 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
3273 tree t1
= TREE_VALUE (p1
);
3274 tree t2
= TREE_VALUE (p2
);
3277 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
3278 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
3280 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
3283 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
3285 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
3286 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
3288 /* If either of the template parameters are invalid, assume
3289 they match for the sake of error recovery. */
3290 if (error_operand_p (parm1
) || error_operand_p (parm2
))
3293 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
3296 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
3297 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
3298 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
3300 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
3305 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
3306 /* One set of parameters has more parameters lists than the
3313 /* Determine whether PARM is a parameter pack. */
3316 template_parameter_pack_p (const_tree parm
)
3318 /* Determine if we have a non-type template parameter pack. */
3319 if (TREE_CODE (parm
) == PARM_DECL
)
3320 return (DECL_TEMPLATE_PARM_P (parm
)
3321 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
3322 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
3323 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
3325 /* If this is a list of template parameters, we could get a
3326 TYPE_DECL or a TEMPLATE_DECL. */
3327 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
3328 parm
= TREE_TYPE (parm
);
3330 /* Otherwise it must be a type template parameter. */
3331 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
3332 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
3333 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
3336 /* Determine if T is a function parameter pack. */
3339 function_parameter_pack_p (const_tree t
)
3341 if (t
&& TREE_CODE (t
) == PARM_DECL
)
3342 return DECL_PACK_P (t
);
3346 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
3347 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
3350 get_function_template_decl (const_tree primary_func_tmpl_inst
)
3352 if (! primary_func_tmpl_inst
3353 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
3354 || ! primary_template_specialization_p (primary_func_tmpl_inst
))
3357 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
3360 /* Return true iff the function parameter PARAM_DECL was expanded
3361 from the function parameter pack PACK. */
3364 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
3366 if (DECL_ARTIFICIAL (param_decl
)
3367 || !function_parameter_pack_p (pack
))
3370 /* The parameter pack and its pack arguments have the same
3372 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
3375 /* Determine whether ARGS describes a variadic template args list,
3376 i.e., one that is terminated by a template argument pack. */
3379 template_args_variadic_p (tree args
)
3384 if (args
== NULL_TREE
)
3387 args
= INNERMOST_TEMPLATE_ARGS (args
);
3388 nargs
= TREE_VEC_LENGTH (args
);
3393 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
3395 return ARGUMENT_PACK_P (last_parm
);
3398 /* Generate a new name for the parameter pack name NAME (an
3399 IDENTIFIER_NODE) that incorporates its */
3402 make_ith_pack_parameter_name (tree name
, int i
)
3404 /* Munge the name to include the parameter index. */
3405 #define NUMBUF_LEN 128
3406 char numbuf
[NUMBUF_LEN
];
3410 if (name
== NULL_TREE
)
3412 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
3413 newname_len
= IDENTIFIER_LENGTH (name
)
3414 + strlen (numbuf
) + 2;
3415 newname
= (char*)alloca (newname_len
);
3416 snprintf (newname
, newname_len
,
3417 "%s#%i", IDENTIFIER_POINTER (name
), i
);
3418 return get_identifier (newname
);
3421 /* Return true if T is a primary function, class or alias template
3422 specialization, not including the template pattern. */
3425 primary_template_specialization_p (const_tree t
)
3430 if (TREE_CODE (t
) == FUNCTION_DECL
|| VAR_P (t
))
3431 return (DECL_LANG_SPECIFIC (t
)
3432 && DECL_USE_TEMPLATE (t
)
3433 && DECL_TEMPLATE_INFO (t
)
3434 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
)));
3435 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
3436 return (CLASSTYPE_TEMPLATE_INFO (t
)
3437 && CLASSTYPE_USE_TEMPLATE (t
)
3438 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
)));
3439 else if (alias_template_specialization_p (t
))
3444 /* Return true if PARM is a template template parameter. */
3447 template_template_parameter_p (const_tree parm
)
3449 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
3452 /* Return true iff PARM is a DECL representing a type template
3456 template_type_parameter_p (const_tree parm
)
3459 && (TREE_CODE (parm
) == TYPE_DECL
3460 || TREE_CODE (parm
) == TEMPLATE_DECL
)
3461 && DECL_TEMPLATE_PARM_P (parm
));
3464 /* Return the template parameters of T if T is a
3465 primary template instantiation, NULL otherwise. */
3468 get_primary_template_innermost_parameters (const_tree t
)
3470 tree parms
= NULL
, template_info
= NULL
;
3472 if ((template_info
= get_template_info (t
))
3473 && primary_template_specialization_p (t
))
3474 parms
= INNERMOST_TEMPLATE_PARMS
3475 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
3480 /* Return the template parameters of the LEVELth level from the full list
3481 of template parameters PARMS. */
3484 get_template_parms_at_level (tree parms
, int level
)
3488 || TREE_CODE (parms
) != TREE_LIST
3489 || level
> TMPL_PARMS_DEPTH (parms
))
3492 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
3493 if (TMPL_PARMS_DEPTH (p
) == level
)
3499 /* Returns the template arguments of T if T is a template instantiation,
3503 get_template_innermost_arguments (const_tree t
)
3505 tree args
= NULL
, template_info
= NULL
;
3507 if ((template_info
= get_template_info (t
))
3508 && TI_ARGS (template_info
))
3509 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
3514 /* Return the argument pack elements of T if T is a template argument pack,
3518 get_template_argument_pack_elems (const_tree t
)
3520 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
3521 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
3524 return ARGUMENT_PACK_ARGS (t
);
3527 /* In an ARGUMENT_PACK_SELECT, the actual underlying argument that the
3528 ARGUMENT_PACK_SELECT represents. */
3531 argument_pack_select_arg (tree t
)
3533 tree args
= ARGUMENT_PACK_ARGS (ARGUMENT_PACK_SELECT_FROM_PACK (t
));
3534 tree arg
= TREE_VEC_ELT (args
, ARGUMENT_PACK_SELECT_INDEX (t
));
3536 /* If the selected argument is an expansion E, that most likely means we were
3537 called from gen_elem_of_pack_expansion_instantiation during the
3538 substituting of an argument pack (of which the Ith element is a pack
3539 expansion, where I is ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
3540 In this case, the Ith element resulting from this substituting is going to
3541 be a pack expansion, which pattern is the pattern of E. Let's return the
3542 pattern of E, and gen_elem_of_pack_expansion_instantiation will build the
3543 resulting pack expansion from it. */
3544 if (PACK_EXPANSION_P (arg
))
3546 /* Make sure we aren't throwing away arg info. */
3547 gcc_assert (!PACK_EXPANSION_EXTRA_ARGS (arg
));
3548 arg
= PACK_EXPANSION_PATTERN (arg
);
3555 /* True iff FN is a function representing a built-in variadic parameter
3559 builtin_pack_fn_p (tree fn
)
3562 || TREE_CODE (fn
) != FUNCTION_DECL
3563 || !DECL_IS_BUILTIN (fn
))
3566 if (id_equal (DECL_NAME (fn
), "__integer_pack"))
3572 /* True iff CALL is a call to a function representing a built-in variadic
3576 builtin_pack_call_p (tree call
)
3578 if (TREE_CODE (call
) != CALL_EXPR
)
3580 return builtin_pack_fn_p (CALL_EXPR_FN (call
));
3583 /* Return a TREE_VEC for the expansion of __integer_pack(HI). */
3586 expand_integer_pack (tree call
, tree args
, tsubst_flags_t complain
,
3589 tree ohi
= CALL_EXPR_ARG (call
, 0);
3590 tree hi
= tsubst_copy_and_build (ohi
, args
, complain
, in_decl
,
3591 false/*fn*/, true/*int_cst*/);
3593 if (value_dependent_expression_p (hi
))
3597 call
= copy_node (call
);
3598 CALL_EXPR_ARG (call
, 0) = hi
;
3600 tree ex
= make_pack_expansion (call
, complain
);
3601 tree vec
= make_tree_vec (1);
3602 TREE_VEC_ELT (vec
, 0) = ex
;
3607 hi
= cxx_constant_value (hi
);
3608 int len
= valid_constant_size_p (hi
) ? tree_to_shwi (hi
) : -1;
3610 /* Calculate the largest value of len that won't make the size of the vec
3611 overflow an int. The compiler will exceed resource limits long before
3612 this, but it seems a decent place to diagnose. */
3613 int max
= ((INT_MAX
- sizeof (tree_vec
)) / sizeof (tree
)) + 1;
3615 if (len
< 0 || len
> max
)
3617 if ((complain
& tf_error
)
3618 && hi
!= error_mark_node
)
3619 error ("argument to __integer_pack must be between 0 and %d", max
);
3620 return error_mark_node
;
3623 tree vec
= make_tree_vec (len
);
3625 for (int i
= 0; i
< len
; ++i
)
3626 TREE_VEC_ELT (vec
, i
) = size_int (i
);
3632 /* Return a TREE_VEC for the expansion of built-in template parameter pack
3636 expand_builtin_pack_call (tree call
, tree args
, tsubst_flags_t complain
,
3639 if (!builtin_pack_call_p (call
))
3642 tree fn
= CALL_EXPR_FN (call
);
3644 if (id_equal (DECL_NAME (fn
), "__integer_pack"))
3645 return expand_integer_pack (call
, args
, complain
, in_decl
);
3650 /* Structure used to track the progress of find_parameter_packs_r. */
3651 struct find_parameter_pack_data
3653 /* TREE_LIST that will contain all of the parameter packs found by
3655 tree
* parameter_packs
;
3657 /* Set of AST nodes that have been visited by the traversal. */
3658 hash_set
<tree
> *visited
;
3660 /* True iff we're making a type pack expansion. */
3661 bool type_pack_expansion_p
;
3664 /* Identifies all of the argument packs that occur in a template
3665 argument and appends them to the TREE_LIST inside DATA, which is a
3666 find_parameter_pack_data structure. This is a subroutine of
3667 make_pack_expansion and uses_parameter_packs. */
3669 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3672 struct find_parameter_pack_data
* ppd
=
3673 (struct find_parameter_pack_data
*)data
;
3674 bool parameter_pack_p
= false;
3676 /* Handle type aliases/typedefs. */
3677 if (TYPE_ALIAS_P (t
))
3679 if (tree tinfo
= TYPE_ALIAS_TEMPLATE_INFO (t
))
3680 cp_walk_tree (&TI_ARGS (tinfo
),
3681 &find_parameter_packs_r
,
3687 /* Identify whether this is a parameter pack or not. */
3688 switch (TREE_CODE (t
))
3690 case TEMPLATE_PARM_INDEX
:
3691 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3692 parameter_pack_p
= true;
3695 case TEMPLATE_TYPE_PARM
:
3696 t
= TYPE_MAIN_VARIANT (t
);
3698 case TEMPLATE_TEMPLATE_PARM
:
3699 /* If the placeholder appears in the decl-specifier-seq of a function
3700 parameter pack (14.6.3), or the type-specifier-seq of a type-id that
3701 is a pack expansion, the invented template parameter is a template
3703 if (ppd
->type_pack_expansion_p
&& is_auto (t
))
3704 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
3705 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3706 parameter_pack_p
= true;
3711 if (DECL_PACK_P (t
))
3713 /* We don't want to walk into the type of a PARM_DECL,
3714 because we don't want to see the type parameter pack. */
3716 parameter_pack_p
= true;
3721 if (DECL_PACK_P (t
))
3723 /* We don't want to walk into the type of a variadic capture proxy,
3724 because we don't want to see the type parameter pack. */
3726 parameter_pack_p
= true;
3728 else if (variable_template_specialization_p (t
))
3730 cp_walk_tree (&DECL_TI_ARGS (t
),
3731 find_parameter_packs_r
,
3738 if (builtin_pack_call_p (t
))
3739 parameter_pack_p
= true;
3743 parameter_pack_p
= true;
3746 /* Not a parameter pack. */
3750 if (parameter_pack_p
)
3752 /* Add this parameter pack to the list. */
3753 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3757 cp_walk_tree (&TYPE_CONTEXT (t
),
3758 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3760 /* This switch statement will return immediately if we don't find a
3762 switch (TREE_CODE (t
))
3764 case TEMPLATE_PARM_INDEX
:
3767 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3768 /* Check the template itself. */
3769 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3770 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3771 /* Check the template arguments. */
3772 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3777 case TEMPLATE_TYPE_PARM
:
3778 case TEMPLATE_TEMPLATE_PARM
:
3785 /* Ignore the declaration of a capture proxy for a parameter pack. */
3786 if (is_capture_proxy (DECL_EXPR_DECL (t
)))
3791 if (TYPE_PTRMEMFUNC_P (t
))
3797 if (TYPE_TEMPLATE_INFO (t
))
3798 cp_walk_tree (&TYPE_TI_ARGS (t
),
3799 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3805 if (!DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
3810 cp_walk_tree (&TREE_TYPE (t
),
3811 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3815 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3820 case TYPE_PACK_EXPANSION
:
3821 case EXPR_PACK_EXPANSION
:
3826 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3831 case IDENTIFIER_NODE
:
3832 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3839 /* Look at explicit captures. */
3840 for (tree cap
= LAMBDA_EXPR_CAPTURE_LIST (t
);
3841 cap
; cap
= TREE_CHAIN (cap
))
3842 cp_walk_tree (&TREE_VALUE (cap
), &find_parameter_packs_r
, ppd
,
3844 /* Since we defer implicit capture, look in the parms and body. */
3845 tree fn
= lambda_function (t
);
3846 cp_walk_tree (&TREE_TYPE (fn
), &find_parameter_packs_r
, ppd
,
3848 cp_walk_tree (&DECL_SAVED_TREE (fn
), &find_parameter_packs_r
, ppd
,
3856 /* When traversing a DECLTYPE_TYPE_EXPR, we need to set
3857 type_pack_expansion_p to false so that any placeholders
3858 within the expression don't get marked as parameter packs. */
3859 bool type_pack_expansion_p
= ppd
->type_pack_expansion_p
;
3860 ppd
->type_pack_expansion_p
= false;
3861 cp_walk_tree (&DECLTYPE_TYPE_EXPR (t
), &find_parameter_packs_r
,
3863 ppd
->type_pack_expansion_p
= type_pack_expansion_p
;
3875 /* Determines if the expression or type T uses any parameter packs. */
3877 uses_parameter_packs (tree t
)
3879 tree parameter_packs
= NULL_TREE
;
3880 struct find_parameter_pack_data ppd
;
3881 ppd
.parameter_packs
= ¶meter_packs
;
3882 ppd
.visited
= new hash_set
<tree
>;
3883 ppd
.type_pack_expansion_p
= false;
3884 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3886 return parameter_packs
!= NULL_TREE
;
3889 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3890 representation a base-class initializer into a parameter pack
3891 expansion. If all goes well, the resulting node will be an
3892 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3895 make_pack_expansion (tree arg
, tsubst_flags_t complain
)
3898 tree parameter_packs
= NULL_TREE
;
3899 bool for_types
= false;
3900 struct find_parameter_pack_data ppd
;
3902 if (!arg
|| arg
== error_mark_node
)
3905 if (TREE_CODE (arg
) == TREE_LIST
&& TREE_PURPOSE (arg
))
3907 /* A TREE_LIST with a non-null TREE_PURPOSE is for a base
3908 class initializer. In this case, the TREE_PURPOSE will be a
3909 _TYPE node (representing the base class expansion we're
3910 initializing) and the TREE_VALUE will be a TREE_LIST
3911 containing the initialization arguments.
3913 The resulting expansion looks somewhat different from most
3914 expansions. Rather than returning just one _EXPANSION, we
3915 return a TREE_LIST whose TREE_PURPOSE is a
3916 TYPE_PACK_EXPANSION containing the bases that will be
3917 initialized. The TREE_VALUE will be identical to the
3918 original TREE_VALUE, which is a list of arguments that will
3919 be passed to each base. We do not introduce any new pack
3920 expansion nodes into the TREE_VALUE (although it is possible
3921 that some already exist), because the TREE_PURPOSE and
3922 TREE_VALUE all need to be expanded together with the same
3923 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3924 resulting TREE_PURPOSE will mention the parameter packs in
3925 both the bases and the arguments to the bases. */
3928 tree parameter_packs
= NULL_TREE
;
3930 /* Determine which parameter packs will be used by the base
3932 ppd
.visited
= new hash_set
<tree
>;
3933 ppd
.parameter_packs
= ¶meter_packs
;
3934 ppd
.type_pack_expansion_p
= true;
3935 gcc_assert (TYPE_P (TREE_PURPOSE (arg
)));
3936 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3939 if (parameter_packs
== NULL_TREE
)
3941 if (complain
& tf_error
)
3942 error ("base initializer expansion %qT contains no parameter packs",
3945 return error_mark_node
;
3948 if (TREE_VALUE (arg
) != void_type_node
)
3950 /* Collect the sets of parameter packs used in each of the
3951 initialization arguments. */
3952 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3954 /* Determine which parameter packs will be expanded in this
3956 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3963 /* Create the pack expansion type for the base type. */
3964 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3965 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3966 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3967 PACK_EXPANSION_LOCAL_P (purpose
) = at_function_scope_p ();
3969 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3970 they will rarely be compared to anything. */
3971 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3973 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3976 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3979 /* Build the PACK_EXPANSION_* node. */
3981 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3982 : make_node (EXPR_PACK_EXPANSION
);
3983 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3984 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3986 /* Propagate type and const-expression information. */
3987 TREE_TYPE (result
) = TREE_TYPE (arg
);
3988 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3989 /* Mark this read now, since the expansion might be length 0. */
3990 mark_exp_read (arg
);
3993 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3994 they will rarely be compared to anything. */
3995 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3997 /* Determine which parameter packs will be expanded. */
3998 ppd
.parameter_packs
= ¶meter_packs
;
3999 ppd
.visited
= new hash_set
<tree
>;
4000 ppd
.type_pack_expansion_p
= TYPE_P (arg
);
4001 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
4004 /* Make sure we found some parameter packs. */
4005 if (parameter_packs
== NULL_TREE
)
4007 if (complain
& tf_error
)
4010 error ("expansion pattern %qT contains no parameter packs", arg
);
4012 error ("expansion pattern %qE contains no parameter packs", arg
);
4014 return error_mark_node
;
4016 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
4018 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
4023 /* Checks T for any "bare" parameter packs, which have not yet been
4024 expanded, and issues an error if any are found. This operation can
4025 only be done on full expressions or types (e.g., an expression
4026 statement, "if" condition, etc.), because we could have expressions like:
4028 foo(f(g(h(args)))...)
4030 where "args" is a parameter pack. check_for_bare_parameter_packs
4031 should not be called for the subexpressions args, h(args),
4032 g(h(args)), or f(g(h(args))), because we would produce erroneous
4035 Returns TRUE and emits an error if there were bare parameter packs,
4036 returns FALSE otherwise. */
4038 check_for_bare_parameter_packs (tree t
, location_t loc
/* = UNKNOWN_LOCATION */)
4040 tree parameter_packs
= NULL_TREE
;
4041 struct find_parameter_pack_data ppd
;
4043 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
4046 /* A lambda might use a parameter pack from the containing context. */
4047 if (current_class_type
&& LAMBDA_TYPE_P (current_class_type
)
4048 && CLASSTYPE_TEMPLATE_INFO (current_class_type
))
4051 if (TREE_CODE (t
) == TYPE_DECL
)
4054 ppd
.parameter_packs
= ¶meter_packs
;
4055 ppd
.visited
= new hash_set
<tree
>;
4056 ppd
.type_pack_expansion_p
= false;
4057 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
4060 if (parameter_packs
)
4062 if (loc
== UNKNOWN_LOCATION
)
4063 loc
= cp_expr_loc_or_loc (t
, input_location
);
4064 error_at (loc
, "parameter packs not expanded with %<...%>:");
4065 while (parameter_packs
)
4067 tree pack
= TREE_VALUE (parameter_packs
);
4068 tree name
= NULL_TREE
;
4070 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
4071 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
4072 name
= TYPE_NAME (pack
);
4073 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
4074 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
4075 else if (TREE_CODE (pack
) == CALL_EXPR
)
4076 name
= DECL_NAME (CALL_EXPR_FN (pack
));
4078 name
= DECL_NAME (pack
);
4081 inform (loc
, " %qD", name
);
4083 inform (loc
, " <anonymous>");
4085 parameter_packs
= TREE_CHAIN (parameter_packs
);
4094 /* Expand any parameter packs that occur in the template arguments in
4097 expand_template_argument_pack (tree args
)
4099 if (args
== error_mark_node
)
4100 return error_mark_node
;
4102 tree result_args
= NULL_TREE
;
4103 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
4104 int num_result_args
= -1;
4105 int non_default_args_count
= -1;
4107 /* First, determine if we need to expand anything, and the number of
4108 slots we'll need. */
4109 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
4111 tree arg
= TREE_VEC_ELT (args
, in_arg
);
4112 if (arg
== NULL_TREE
)
4114 if (ARGUMENT_PACK_P (arg
))
4116 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
4117 if (num_result_args
< 0)
4118 num_result_args
= in_arg
+ num_packed
;
4120 num_result_args
+= num_packed
;
4124 if (num_result_args
>= 0)
4129 /* If no expansion is necessary, we're done. */
4130 if (num_result_args
< 0)
4133 /* Expand arguments. */
4134 result_args
= make_tree_vec (num_result_args
);
4135 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
4136 non_default_args_count
=
4137 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
4138 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
4140 tree arg
= TREE_VEC_ELT (args
, in_arg
);
4141 if (ARGUMENT_PACK_P (arg
))
4143 tree packed
= ARGUMENT_PACK_ARGS (arg
);
4144 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
4145 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
4146 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
4147 if (non_default_args_count
> 0)
4148 non_default_args_count
+= num_packed
- 1;
4152 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
4156 if (non_default_args_count
>= 0)
4157 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
4161 /* Checks if DECL shadows a template parameter.
4163 [temp.local]: A template-parameter shall not be redeclared within its
4164 scope (including nested scopes).
4166 Emits an error and returns TRUE if the DECL shadows a parameter,
4167 returns FALSE otherwise. */
4170 check_template_shadow (tree decl
)
4174 /* If we're not in a template, we can't possibly shadow a template
4176 if (!current_template_parms
)
4179 /* Figure out what we're shadowing. */
4180 decl
= OVL_FIRST (decl
);
4181 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
4183 /* If there's no previous binding for this name, we're not shadowing
4184 anything, let alone a template parameter. */
4188 /* If we're not shadowing a template parameter, we're done. Note
4189 that OLDDECL might be an OVERLOAD (or perhaps even an
4190 ERROR_MARK), so we can't just blithely assume it to be a _DECL
4192 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
4195 /* We check for decl != olddecl to avoid bogus errors for using a
4196 name inside a class. We check TPFI to avoid duplicate errors for
4197 inline member templates. */
4199 || (DECL_TEMPLATE_PARM_P (decl
)
4200 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
)))
4203 /* Don't complain about the injected class name, as we've already
4204 complained about the class itself. */
4205 if (DECL_SELF_REFERENCE_P (decl
))
4208 if (DECL_TEMPLATE_PARM_P (decl
))
4209 error ("declaration of template parameter %q+D shadows "
4210 "template parameter", decl
);
4212 error ("declaration of %q+#D shadows template parameter", decl
);
4213 inform (DECL_SOURCE_LOCATION (olddecl
),
4214 "template parameter %qD declared here", olddecl
);
4218 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
4219 ORIG_LEVEL, DECL, and TYPE. */
4222 build_template_parm_index (int index
,
4228 tree t
= make_node (TEMPLATE_PARM_INDEX
);
4229 TEMPLATE_PARM_IDX (t
) = index
;
4230 TEMPLATE_PARM_LEVEL (t
) = level
;
4231 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
4232 TEMPLATE_PARM_DECL (t
) = decl
;
4233 TREE_TYPE (t
) = type
;
4234 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
4235 TREE_READONLY (t
) = TREE_READONLY (decl
);
4240 /* Find the canonical type parameter for the given template type
4241 parameter. Returns the canonical type parameter, which may be TYPE
4242 if no such parameter existed. */
4245 canonical_type_parameter (tree type
)
4248 int idx
= TEMPLATE_TYPE_IDX (type
);
4249 if (!canonical_template_parms
)
4250 vec_alloc (canonical_template_parms
, idx
+ 1);
4252 if (canonical_template_parms
->length () <= (unsigned) idx
)
4253 vec_safe_grow_cleared (canonical_template_parms
, idx
+ 1);
4255 list
= (*canonical_template_parms
)[idx
];
4256 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
4257 list
= TREE_CHAIN (list
);
4260 return TREE_VALUE (list
);
4263 (*canonical_template_parms
)[idx
]
4264 = tree_cons (NULL_TREE
, type
, (*canonical_template_parms
)[idx
]);
4269 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
4270 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
4271 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
4272 new one is created. */
4275 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
4276 tsubst_flags_t complain
)
4278 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
4279 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
4280 != TEMPLATE_PARM_LEVEL (index
) - levels
)
4281 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
4283 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
4286 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
4287 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
4288 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
4289 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
4290 DECL_ARTIFICIAL (decl
) = 1;
4291 SET_DECL_TEMPLATE_PARM_P (decl
);
4293 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
4294 TEMPLATE_PARM_LEVEL (index
) - levels
,
4295 TEMPLATE_PARM_ORIG_LEVEL (index
),
4297 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
4298 TEMPLATE_PARM_PARAMETER_PACK (t
)
4299 = TEMPLATE_PARM_PARAMETER_PACK (index
);
4301 /* Template template parameters need this. */
4302 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4304 DECL_TEMPLATE_RESULT (decl
)
4305 = build_decl (DECL_SOURCE_LOCATION (decl
),
4306 TYPE_DECL
, DECL_NAME (decl
), type
);
4307 DECL_ARTIFICIAL (DECL_TEMPLATE_RESULT (decl
)) = true;
4308 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
4309 (DECL_TEMPLATE_PARMS (orig_decl
), args
, complain
);
4313 return TEMPLATE_PARM_DESCENDANTS (index
);
4316 /* Process information from new template parameter PARM and append it
4317 to the LIST being built. This new parameter is a non-type
4318 parameter iff IS_NON_TYPE is true. This new parameter is a
4319 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
4323 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
4324 bool is_non_type
, bool is_parameter_pack
)
4329 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
4330 tree defval
= TREE_PURPOSE (parm
);
4331 tree constr
= TREE_TYPE (parm
);
4335 tree p
= tree_last (list
);
4337 if (p
&& TREE_VALUE (p
) != error_mark_node
)
4340 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
4341 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
4343 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
4351 parm
= TREE_VALUE (parm
);
4353 SET_DECL_TEMPLATE_PARM_P (parm
);
4355 if (TREE_TYPE (parm
) != error_mark_node
)
4359 The top-level cv-qualifiers on the template-parameter are
4360 ignored when determining its type. */
4361 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
4362 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
4363 TREE_TYPE (parm
) = error_mark_node
;
4364 else if (uses_parameter_packs (TREE_TYPE (parm
))
4365 && !is_parameter_pack
4366 /* If we're in a nested template parameter list, the template
4367 template parameter could be a parameter pack. */
4368 && processing_template_parmlist
== 1)
4370 /* This template parameter is not a parameter pack, but it
4371 should be. Complain about "bare" parameter packs. */
4372 check_for_bare_parameter_packs (TREE_TYPE (parm
));
4374 /* Recover by calling this a parameter pack. */
4375 is_parameter_pack
= true;
4379 /* A template parameter is not modifiable. */
4380 TREE_CONSTANT (parm
) = 1;
4381 TREE_READONLY (parm
) = 1;
4382 decl
= build_decl (parm_loc
,
4383 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
4384 TREE_CONSTANT (decl
) = 1;
4385 TREE_READONLY (decl
) = 1;
4386 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
4387 = build_template_parm_index (idx
, processing_template_decl
,
4388 processing_template_decl
,
4389 decl
, TREE_TYPE (parm
));
4391 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
4392 = is_parameter_pack
;
4397 parm
= TREE_VALUE (TREE_VALUE (parm
));
4399 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
4401 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
4402 /* This is for distinguishing between real templates and template
4403 template parameters */
4404 TREE_TYPE (parm
) = t
;
4405 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
4410 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
4411 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
4412 decl
= build_decl (parm_loc
,
4413 TYPE_DECL
, parm
, t
);
4416 TYPE_NAME (t
) = decl
;
4417 TYPE_STUB_DECL (t
) = decl
;
4419 TEMPLATE_TYPE_PARM_INDEX (t
)
4420 = build_template_parm_index (idx
, processing_template_decl
,
4421 processing_template_decl
,
4422 decl
, TREE_TYPE (parm
));
4423 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
4424 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
4426 DECL_ARTIFICIAL (decl
) = 1;
4427 SET_DECL_TEMPLATE_PARM_P (decl
);
4429 /* Build requirements for the type/template parameter.
4430 This must be done after SET_DECL_TEMPLATE_PARM_P or
4431 process_template_parm could fail. */
4432 tree reqs
= finish_shorthand_constraint (parm
, constr
);
4436 /* Build the parameter node linking the parameter declaration,
4437 its default argument (if any), and its constraints (if any). */
4438 parm
= build_tree_list (defval
, parm
);
4439 TEMPLATE_PARM_CONSTRAINTS (parm
) = reqs
;
4441 return chainon (list
, parm
);
4444 /* The end of a template parameter list has been reached. Process the
4445 tree list into a parameter vector, converting each parameter into a more
4446 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
4450 end_template_parm_list (tree parms
)
4454 tree saved_parmlist
= make_tree_vec (list_length (parms
));
4456 /* Pop the dummy parameter level and add the real one. */
4457 current_template_parms
= TREE_CHAIN (current_template_parms
);
4459 current_template_parms
4460 = tree_cons (size_int (processing_template_decl
),
4461 saved_parmlist
, current_template_parms
);
4463 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
4465 next
= TREE_CHAIN (parm
);
4466 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
4467 TREE_CHAIN (parm
) = NULL_TREE
;
4470 --processing_template_parmlist
;
4472 return saved_parmlist
;
4475 // Explicitly indicate the end of the template parameter list. We assume
4476 // that the current template parameters have been constructed and/or
4477 // managed explicitly, as when creating new template template parameters
4478 // from a shorthand constraint.
4480 end_template_parm_list ()
4482 --processing_template_parmlist
;
4485 /* end_template_decl is called after a template declaration is seen. */
4488 end_template_decl (void)
4490 reset_specialization ();
4492 if (! processing_template_decl
)
4495 /* This matches the pushlevel in begin_template_parm_list. */
4498 --processing_template_decl
;
4499 current_template_parms
= TREE_CHAIN (current_template_parms
);
4502 /* Takes a TREE_LIST representing a template parameter and convert it
4503 into an argument suitable to be passed to the type substitution
4504 functions. Note that If the TREE_LIST contains an error_mark
4505 node, the returned argument is error_mark_node. */
4508 template_parm_to_arg (tree t
)
4512 || TREE_CODE (t
) != TREE_LIST
)
4515 if (error_operand_p (TREE_VALUE (t
)))
4516 return error_mark_node
;
4520 if (TREE_CODE (t
) == TYPE_DECL
4521 || TREE_CODE (t
) == TEMPLATE_DECL
)
4525 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
4527 /* Turn this argument into a TYPE_ARGUMENT_PACK
4528 with a single element, which expands T. */
4529 tree vec
= make_tree_vec (1);
4531 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
4533 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4535 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
4536 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4541 t
= DECL_INITIAL (t
);
4543 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
4545 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
4546 with a single element, which expands T. */
4547 tree vec
= make_tree_vec (1);
4549 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
4551 t
= convert_from_reference (t
);
4552 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4554 t
= make_node (NONTYPE_ARGUMENT_PACK
);
4555 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4558 t
= convert_from_reference (t
);
4563 /* Given a single level of template parameters (a TREE_VEC), return it
4564 as a set of template arguments. */
4567 template_parms_level_to_args (tree parms
)
4569 tree a
= copy_node (parms
);
4570 TREE_TYPE (a
) = NULL_TREE
;
4571 for (int i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
4572 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
4575 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
4580 /* Given a set of template parameters, return them as a set of template
4581 arguments. The template parameters are represented as a TREE_VEC, in
4582 the form documented in cp-tree.h for template arguments. */
4585 template_parms_to_args (tree parms
)
4588 tree args
= NULL_TREE
;
4589 int length
= TMPL_PARMS_DEPTH (parms
);
4592 /* If there is only one level of template parameters, we do not
4593 create a TREE_VEC of TREE_VECs. Instead, we return a single
4594 TREE_VEC containing the arguments. */
4596 args
= make_tree_vec (length
);
4598 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
4600 tree a
= template_parms_level_to_args (TREE_VALUE (header
));
4603 TREE_VEC_ELT (args
, --l
) = a
;
4611 /* Within the declaration of a template, return the currently active
4612 template parameters as an argument TREE_VEC. */
4615 current_template_args (void)
4617 return template_parms_to_args (current_template_parms
);
4620 /* Update the declared TYPE by doing any lookups which were thought to be
4621 dependent, but are not now that we know the SCOPE of the declarator. */
4624 maybe_update_decl_type (tree orig_type
, tree scope
)
4626 tree type
= orig_type
;
4628 if (type
== NULL_TREE
)
4631 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4632 type
= TREE_TYPE (type
);
4634 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
4635 && dependent_type_p (type
)
4636 /* Don't bother building up the args in this case. */
4637 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
4639 /* tsubst in the args corresponding to the template parameters,
4640 including auto if present. Most things will be unchanged, but
4641 make_typename_type and tsubst_qualified_id will resolve
4642 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
4643 tree args
= current_template_args ();
4644 tree auto_node
= type_uses_auto (type
);
4648 tree auto_vec
= make_tree_vec (1);
4649 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
4650 args
= add_to_template_args (args
, auto_vec
);
4652 pushed
= push_scope (scope
);
4653 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
4658 if (type
== error_mark_node
)
4661 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4663 if (same_type_p (type
, TREE_TYPE (orig_type
)))
4666 type
= TYPE_NAME (type
);
4671 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4672 template PARMS and constraints, CONSTR. If MEMBER_TEMPLATE_P is true,
4673 the new template is a member template. */
4676 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
4678 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
4679 SET_DECL_LANGUAGE (tmpl
, DECL_LANGUAGE (decl
));
4680 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
4681 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
4682 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
4683 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
4688 struct template_parm_data
4690 /* The level of the template parameters we are currently
4694 /* The index of the specialization argument we are currently
4698 /* An array whose size is the number of template parameters. The
4699 elements are nonzero if the parameter has been used in any one
4700 of the arguments processed so far. */
4703 /* An array whose size is the number of template arguments. The
4704 elements are nonzero if the argument makes use of template
4705 parameters of this level. */
4706 int* arg_uses_template_parms
;
4709 /* Subroutine of push_template_decl used to see if each template
4710 parameter in a partial specialization is used in the explicit
4711 argument list. If T is of the LEVEL given in DATA (which is
4712 treated as a template_parm_data*), then DATA->PARMS is marked
4716 mark_template_parm (tree t
, void* data
)
4720 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4722 template_parm_level_and_index (t
, &level
, &idx
);
4724 if (level
== tpd
->level
)
4726 tpd
->parms
[idx
] = 1;
4727 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4730 /* In C++17 the type of a non-type argument is a deduced context. */
4731 if (cxx_dialect
>= cxx17
4732 && TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
4733 for_each_template_parm (TREE_TYPE (t
),
4734 &mark_template_parm
,
4737 /*include_nondeduced_p=*/false);
4739 /* Return zero so that for_each_template_parm will continue the
4740 traversal of the tree; we want to mark *every* template parm. */
4744 /* Process the partial specialization DECL. */
4747 process_partial_specialization (tree decl
)
4749 tree type
= TREE_TYPE (decl
);
4750 tree tinfo
= get_template_info (decl
);
4751 tree maintmpl
= TI_TEMPLATE (tinfo
);
4752 tree specargs
= TI_ARGS (tinfo
);
4753 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4754 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4757 int nargs
= TREE_VEC_LENGTH (inner_args
);
4760 bool did_error_intro
= false;
4761 struct template_parm_data tpd
;
4762 struct template_parm_data tpd2
;
4764 gcc_assert (current_template_parms
);
4766 /* A concept cannot be specialized. */
4767 if (flag_concepts
&& variable_concept_p (maintmpl
))
4769 error ("specialization of variable concept %q#D", maintmpl
);
4770 return error_mark_node
;
4773 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4774 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4776 /* We check that each of the template parameters given in the
4777 partial specialization is used in the argument list to the
4778 specialization. For example:
4780 template <class T> struct S;
4781 template <class T> struct S<T*>;
4783 The second declaration is OK because `T*' uses the template
4784 parameter T, whereas
4786 template <class T> struct S<int>;
4788 is no good. Even trickier is:
4799 The S2<T> declaration is actually invalid; it is a
4800 full-specialization. Of course,
4803 struct S2<T (*)(U)>;
4805 or some such would have been OK. */
4806 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4807 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4808 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4810 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4811 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4812 for (i
= 0; i
< nargs
; ++i
)
4814 tpd
.current_arg
= i
;
4815 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4816 &mark_template_parm
,
4819 /*include_nondeduced_p=*/false);
4821 for (i
= 0; i
< ntparms
; ++i
)
4822 if (tpd
.parms
[i
] == 0)
4824 /* One of the template parms was not used in a deduced context in the
4826 if (!did_error_intro
)
4828 error ("template parameters not deducible in "
4829 "partial specialization:");
4830 did_error_intro
= true;
4833 inform (input_location
, " %qD",
4834 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4837 if (did_error_intro
)
4838 return error_mark_node
;
4840 /* [temp.class.spec]
4842 The argument list of the specialization shall not be identical to
4843 the implicit argument list of the primary template. */
4845 = TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (maintmpl
)));
4846 if (comp_template_args (inner_args
, INNERMOST_TEMPLATE_ARGS (main_args
))
4848 || !strictly_subsumes (current_template_constraints (),
4849 get_constraints (maintmpl
))))
4852 error ("partial specialization %q+D does not specialize "
4853 "any template arguments; to define the primary template, "
4854 "remove the template argument list", decl
);
4856 error ("partial specialization %q+D does not specialize any "
4857 "template arguments and is not more constrained than "
4858 "the primary template; to define the primary template, "
4859 "remove the template argument list", decl
);
4860 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4863 /* A partial specialization that replaces multiple parameters of the
4864 primary template with a pack expansion is less specialized for those
4866 if (nargs
< DECL_NTPARMS (maintmpl
))
4868 error ("partial specialization is not more specialized than the "
4869 "primary template because it replaces multiple parameters "
4870 "with a pack expansion");
4871 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4872 /* Avoid crash in process_partial_specialization. */
4876 /* If we aren't in a dependent class, we can actually try deduction. */
4877 else if (tpd
.level
== 1
4878 /* FIXME we should be able to handle a partial specialization of a
4879 partial instantiation, but currently we can't (c++/41727). */
4880 && TMPL_ARGS_DEPTH (specargs
) == 1
4881 && !get_partial_spec_bindings (maintmpl
, maintmpl
, specargs
))
4883 if (permerror (input_location
, "partial specialization %qD is not "
4884 "more specialized than", decl
))
4885 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template %qD",
4889 /* [temp.class.spec]
4891 A partially specialized non-type argument expression shall not
4892 involve template parameters of the partial specialization except
4893 when the argument expression is a simple identifier.
4895 The type of a template parameter corresponding to a specialized
4896 non-type argument shall not be dependent on a parameter of the
4899 Also, we verify that pack expansions only occur at the
4900 end of the argument list. */
4901 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4903 for (i
= 0; i
< nargs
; ++i
)
4905 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4906 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4907 tree packed_args
= NULL_TREE
;
4910 if (ARGUMENT_PACK_P (arg
))
4912 /* Extract the arguments from the argument pack. We'll be
4913 iterating over these in the following loop. */
4914 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4915 len
= TREE_VEC_LENGTH (packed_args
);
4918 for (j
= 0; j
< len
; j
++)
4921 /* Get the Jth argument in the parameter pack. */
4922 arg
= TREE_VEC_ELT (packed_args
, j
);
4924 if (PACK_EXPANSION_P (arg
))
4926 /* Pack expansions must come at the end of the
4928 if ((packed_args
&& j
< len
- 1)
4929 || (!packed_args
&& i
< nargs
- 1))
4931 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4932 error ("parameter pack argument %qE must be at the "
4933 "end of the template argument list", arg
);
4935 error ("parameter pack argument %qT must be at the "
4936 "end of the template argument list", arg
);
4940 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4941 /* We only care about the pattern. */
4942 arg
= PACK_EXPANSION_PATTERN (arg
);
4944 if (/* These first two lines are the `non-type' bit. */
4946 && TREE_CODE (arg
) != TEMPLATE_DECL
4947 /* This next two lines are the `argument expression is not just a
4948 simple identifier' condition and also the `specialized
4949 non-type argument' bit. */
4950 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
4951 && !(REFERENCE_REF_P (arg
)
4952 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_PARM_INDEX
))
4954 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4955 || (packed_args
&& uses_template_parms (arg
)))
4956 error ("template argument %qE involves template parameter(s)",
4960 /* Look at the corresponding template parameter,
4961 marking which template parameters its type depends
4963 tree type
= TREE_TYPE (parm
);
4967 /* We haven't yet initialized TPD2. Do so now. */
4968 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4969 /* The number of parameters here is the number in the
4970 main template, which, as checked in the assertion
4972 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4974 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4977 /* Mark the template parameters. But this time, we're
4978 looking for the template parameters of the main
4979 template, not in the specialization. */
4980 tpd2
.current_arg
= i
;
4981 tpd2
.arg_uses_template_parms
[i
] = 0;
4982 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4983 for_each_template_parm (type
,
4984 &mark_template_parm
,
4987 /*include_nondeduced_p=*/false);
4989 if (tpd2
.arg_uses_template_parms
[i
])
4991 /* The type depended on some template parameters.
4992 If they are fully specialized in the
4993 specialization, that's OK. */
4996 for (j
= 0; j
< nargs
; ++j
)
4997 if (tpd2
.parms
[j
] != 0
4998 && tpd
.arg_uses_template_parms
[j
])
5001 error_n (input_location
, count
,
5002 "type %qT of template argument %qE depends "
5003 "on a template parameter",
5004 "type %qT of template argument %qE depends "
5005 "on template parameters",
5014 /* We should only get here once. */
5015 if (TREE_CODE (decl
) == TYPE_DECL
)
5016 gcc_assert (!COMPLETE_TYPE_P (type
));
5018 // Build the template decl.
5019 tree tmpl
= build_template_decl (decl
, current_template_parms
,
5020 DECL_MEMBER_TEMPLATE_P (maintmpl
));
5021 TREE_TYPE (tmpl
) = type
;
5022 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
5023 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
5024 DECL_TEMPLATE_INFO (tmpl
) = build_template_info (maintmpl
, specargs
);
5025 DECL_PRIMARY_TEMPLATE (tmpl
) = maintmpl
;
5027 /* Give template template parms a DECL_CONTEXT of the template
5028 for which they are a parameter. */
5029 for (i
= 0; i
< ntparms
; ++i
)
5031 tree parm
= TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
));
5032 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5033 DECL_CONTEXT (parm
) = tmpl
;
5037 /* We didn't register this in check_explicit_specialization so we could
5038 wait until the constraints were set. */
5039 decl
= register_specialization (decl
, maintmpl
, specargs
, false, 0);
5041 associate_classtype_constraints (type
);
5043 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
5044 = tree_cons (specargs
, tmpl
,
5045 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
5046 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
5048 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
5049 inst
= TREE_CHAIN (inst
))
5051 tree instance
= TREE_VALUE (inst
);
5052 if (TYPE_P (instance
)
5053 ? (COMPLETE_TYPE_P (instance
)
5054 && CLASSTYPE_IMPLICIT_INSTANTIATION (instance
))
5055 : DECL_TEMPLATE_INSTANTIATION (instance
))
5057 tree spec
= most_specialized_partial_spec (instance
, tf_none
);
5058 tree inst_decl
= (DECL_P (instance
)
5059 ? instance
: TYPE_NAME (instance
));
5062 else if (spec
== error_mark_node
)
5063 permerror (input_location
,
5064 "declaration of %qD ambiguates earlier template "
5065 "instantiation for %qD", decl
, inst_decl
);
5066 else if (TREE_VALUE (spec
) == tmpl
)
5067 permerror (input_location
,
5068 "partial specialization of %qD after instantiation "
5069 "of %qD", decl
, inst_decl
);
5076 /* PARM is a template parameter of some form; return the corresponding
5077 TEMPLATE_PARM_INDEX. */
5080 get_template_parm_index (tree parm
)
5082 if (TREE_CODE (parm
) == PARM_DECL
5083 || TREE_CODE (parm
) == CONST_DECL
)
5084 parm
= DECL_INITIAL (parm
);
5085 else if (TREE_CODE (parm
) == TYPE_DECL
5086 || TREE_CODE (parm
) == TEMPLATE_DECL
)
5087 parm
= TREE_TYPE (parm
);
5088 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
5089 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
5090 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
5091 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
5092 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
5096 /* Subroutine of fixed_parameter_pack_p below. Look for any template
5097 parameter packs used by the template parameter PARM. */
5100 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
5102 /* A type parm can't refer to another parm. */
5103 if (TREE_CODE (parm
) == TYPE_DECL
|| parm
== error_mark_node
)
5105 else if (TREE_CODE (parm
) == PARM_DECL
)
5107 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
5112 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
5114 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
5115 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
5116 fixed_parameter_pack_p_1 (TREE_VALUE (TREE_VEC_ELT (vec
, i
)), ppd
);
5119 /* PARM is a template parameter pack. Return any parameter packs used in
5120 its type or the type of any of its template parameters. If there are
5121 any such packs, it will be instantiated into a fixed template parameter
5122 list by partial instantiation rather than be fully deduced. */
5125 fixed_parameter_pack_p (tree parm
)
5127 /* This can only be true in a member template. */
5128 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
5130 /* This can only be true for a parameter pack. */
5131 if (!template_parameter_pack_p (parm
))
5133 /* A type parm can't refer to another parm. */
5134 if (TREE_CODE (parm
) == TYPE_DECL
)
5137 tree parameter_packs
= NULL_TREE
;
5138 struct find_parameter_pack_data ppd
;
5139 ppd
.parameter_packs
= ¶meter_packs
;
5140 ppd
.visited
= new hash_set
<tree
>;
5141 ppd
.type_pack_expansion_p
= false;
5143 fixed_parameter_pack_p_1 (parm
, &ppd
);
5146 return parameter_packs
;
5149 /* Check that a template declaration's use of default arguments and
5150 parameter packs is not invalid. Here, PARMS are the template
5151 parameters. IS_PRIMARY is true if DECL is the thing declared by
5152 a primary template. IS_PARTIAL is true if DECL is a partial
5155 IS_FRIEND_DECL is nonzero if DECL is either a non-defining friend
5156 function template declaration or a friend class template
5157 declaration. In the function case, 1 indicates a declaration, 2
5158 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
5159 emitted for extraneous default arguments.
5161 Returns TRUE if there were no errors found, FALSE otherwise. */
5164 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
5165 bool is_partial
, int is_friend_decl
)
5168 int last_level_to_check
;
5170 bool no_errors
= true;
5174 A default template-argument shall not be specified in a
5175 function template declaration or a function template definition, nor
5176 in the template-parameter-list of the definition of a member of a
5179 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
5180 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (decl
)))
5181 /* You can't have a function template declaration in a local
5182 scope, nor you can you define a member of a class template in a
5186 if ((TREE_CODE (decl
) == TYPE_DECL
5188 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5189 || (TREE_CODE (decl
) == FUNCTION_DECL
5190 && LAMBDA_FUNCTION_P (decl
)))
5191 /* A lambda doesn't have an explicit declaration; don't complain
5192 about the parms of the enclosing class. */
5195 if (current_class_type
5196 && !TYPE_BEING_DEFINED (current_class_type
)
5197 && DECL_LANG_SPECIFIC (decl
)
5198 && DECL_DECLARES_FUNCTION_P (decl
)
5199 /* If this is either a friend defined in the scope of the class
5200 or a member function. */
5201 && (DECL_FUNCTION_MEMBER_P (decl
)
5202 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
5203 : DECL_FRIEND_CONTEXT (decl
)
5204 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
5206 /* And, if it was a member function, it really was defined in
5207 the scope of the class. */
5208 && (!DECL_FUNCTION_MEMBER_P (decl
)
5209 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
5210 /* We already checked these parameters when the template was
5211 declared, so there's no need to do it again now. This function
5212 was defined in class scope, but we're processing its body now
5213 that the class is complete. */
5216 /* Core issue 226 (C++0x only): the following only applies to class
5219 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
5223 If a template-parameter has a default template-argument, all
5224 subsequent template-parameters shall have a default
5225 template-argument supplied. */
5226 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
5228 tree inner_parms
= TREE_VALUE (parm_level
);
5229 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
5230 int seen_def_arg_p
= 0;
5233 for (i
= 0; i
< ntparms
; ++i
)
5235 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
5237 if (parm
== error_mark_node
)
5240 if (TREE_PURPOSE (parm
))
5242 else if (seen_def_arg_p
5243 && !template_parameter_pack_p (TREE_VALUE (parm
)))
5245 error ("no default argument for %qD", TREE_VALUE (parm
));
5246 /* For better subsequent error-recovery, we indicate that
5247 there should have been a default argument. */
5248 TREE_PURPOSE (parm
) = error_mark_node
;
5251 else if (!is_partial
5253 /* Don't complain about an enclosing partial
5255 && parm_level
== parms
5256 && TREE_CODE (decl
) == TYPE_DECL
5258 && template_parameter_pack_p (TREE_VALUE (parm
))
5259 /* A fixed parameter pack will be partially
5260 instantiated into a fixed length list. */
5261 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
5263 /* A primary class template can only have one
5264 parameter pack, at the end of the template
5267 error ("parameter pack %q+D must be at the end of the"
5268 " template parameter list", TREE_VALUE (parm
));
5270 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
5278 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
5282 /* For an ordinary class template, default template arguments are
5283 allowed at the innermost level, e.g.:
5284 template <class T = int>
5286 but, in a partial specialization, they're not allowed even
5287 there, as we have in [temp.class.spec]:
5289 The template parameter list of a specialization shall not
5290 contain default template argument values.
5292 So, for a partial specialization, or for a function template
5293 (in C++98/C++03), we look at all of them. */
5296 /* But, for a primary class template that is not a partial
5297 specialization we look at all template parameters except the
5299 parms
= TREE_CHAIN (parms
);
5301 /* Figure out what error message to issue. */
5302 if (is_friend_decl
== 2)
5303 msg
= G_("default template arguments may not be used in function template "
5304 "friend re-declaration");
5305 else if (is_friend_decl
)
5306 msg
= G_("default template arguments may not be used in template "
5307 "friend declarations");
5308 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
5309 msg
= G_("default template arguments may not be used in function templates "
5310 "without -std=c++11 or -std=gnu++11");
5311 else if (is_partial
)
5312 msg
= G_("default template arguments may not be used in "
5313 "partial specializations");
5314 else if (current_class_type
&& CLASSTYPE_IS_TEMPLATE (current_class_type
))
5315 msg
= G_("default argument for template parameter for class enclosing %qD");
5317 /* Per [temp.param]/9, "A default template-argument shall not be
5318 specified in the template-parameter-lists of the definition of
5319 a member of a class template that appears outside of the member's
5320 class.", thus if we aren't handling a member of a class template
5321 there is no need to examine the parameters. */
5324 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
5325 /* If we're inside a class definition, there's no need to
5326 examine the parameters to the class itself. On the one
5327 hand, they will be checked when the class is defined, and,
5328 on the other, default arguments are valid in things like:
5329 template <class T = double>
5330 struct S { template <class U> void f(U); };
5331 Here the default argument for `S' has no bearing on the
5332 declaration of `f'. */
5333 last_level_to_check
= template_class_depth (current_class_type
) + 1;
5335 /* Check everything. */
5336 last_level_to_check
= 0;
5338 for (parm_level
= parms
;
5339 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
5340 parm_level
= TREE_CHAIN (parm_level
))
5342 tree inner_parms
= TREE_VALUE (parm_level
);
5346 ntparms
= TREE_VEC_LENGTH (inner_parms
);
5347 for (i
= 0; i
< ntparms
; ++i
)
5349 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
5352 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
5357 if (is_friend_decl
== 2)
5364 /* Clear out the default argument so that we are not
5366 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
5370 /* At this point, if we're still interested in issuing messages,
5371 they must apply to classes surrounding the object declared. */
5373 msg
= G_("default argument for template parameter for class "
5380 /* Worker for push_template_decl_real, called via
5381 for_each_template_parm. DATA is really an int, indicating the
5382 level of the parameters we are interested in. If T is a template
5383 parameter of that level, return nonzero. */
5386 template_parm_this_level_p (tree t
, void* data
)
5388 int this_level
= *(int *)data
;
5391 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
5392 level
= TEMPLATE_PARM_LEVEL (t
);
5394 level
= TEMPLATE_TYPE_LEVEL (t
);
5395 return level
== this_level
;
5398 /* Worker for uses_outer_template_parms, called via for_each_template_parm.
5399 DATA is really an int, indicating the innermost outer level of parameters.
5400 If T is a template parameter of that level or further out, return
5404 template_parm_outer_level (tree t
, void *data
)
5406 int this_level
= *(int *)data
;
5409 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
5410 level
= TEMPLATE_PARM_LEVEL (t
);
5412 level
= TEMPLATE_TYPE_LEVEL (t
);
5413 return level
<= this_level
;
5416 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
5417 parameters given by current_template_args, or reuses a
5418 previously existing one, if appropriate. Returns the DECL, or an
5419 equivalent one, if it is replaced via a call to duplicate_decls.
5421 If IS_FRIEND is true, DECL is a friend declaration. */
5424 push_template_decl_real (tree decl
, bool is_friend
)
5432 int new_template_p
= 0;
5433 /* True if the template is a member template, in the sense of
5435 bool member_template_p
= false;
5437 if (decl
== error_mark_node
|| !current_template_parms
)
5438 return error_mark_node
;
5440 /* See if this is a partial specialization. */
5441 is_partial
= ((DECL_IMPLICIT_TYPEDEF_P (decl
)
5442 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
5443 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
5445 && DECL_LANG_SPECIFIC (decl
)
5446 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5447 && TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
))));
5449 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
5453 /* For a friend, we want the context of the friend, not
5454 the type of which it is a friend. */
5455 ctx
= CP_DECL_CONTEXT (decl
);
5456 else if (CP_DECL_CONTEXT (decl
)
5457 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
5458 /* In the case of a virtual function, we want the class in which
5460 ctx
= CP_DECL_CONTEXT (decl
);
5462 /* Otherwise, if we're currently defining some class, the DECL
5463 is assumed to be a member of the class. */
5464 ctx
= current_scope ();
5466 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
5469 if (!DECL_CONTEXT (decl
))
5470 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
5472 /* See if this is a primary template. */
5473 if (is_friend
&& ctx
5474 && uses_template_parms_level (ctx
, processing_template_decl
))
5475 /* A friend template that specifies a class context, i.e.
5476 template <typename T> friend void A<T>::f();
5479 else if (TREE_CODE (decl
) == TYPE_DECL
5480 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5483 is_primary
= template_parm_scope_p ();
5487 warning (OPT_Wtemplates
, "template %qD declared", decl
);
5489 if (DECL_CLASS_SCOPE_P (decl
))
5490 member_template_p
= true;
5491 if (TREE_CODE (decl
) == TYPE_DECL
5492 && anon_aggrname_p (DECL_NAME (decl
)))
5494 error ("template class without a name");
5495 return error_mark_node
;
5497 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
5499 if (member_template_p
)
5501 if (DECL_OVERRIDE_P (decl
) || DECL_FINAL_P (decl
))
5502 error ("member template %qD may not have virt-specifiers", decl
);
5504 if (DECL_DESTRUCTOR_P (decl
))
5508 A destructor shall not be a member template. */
5509 error ("destructor %qD declared as member template", decl
);
5510 return error_mark_node
;
5512 if (IDENTIFIER_NEWDEL_OP_P (DECL_NAME (decl
))
5513 && (!prototype_p (TREE_TYPE (decl
))
5514 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
5515 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
5516 || (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
5517 == void_list_node
)))
5519 /* [basic.stc.dynamic.allocation]
5521 An allocation function can be a function
5522 template. ... Template allocation functions shall
5523 have two or more parameters. */
5524 error ("invalid template declaration of %qD", decl
);
5525 return error_mark_node
;
5528 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5529 && CLASS_TYPE_P (TREE_TYPE (decl
)))
5531 /* Class template, set TEMPLATE_TYPE_PARM_FOR_CLASS. */
5532 tree parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
5533 for (int i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
5535 tree t
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5536 if (TREE_CODE (t
) == TYPE_DECL
)
5538 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
5539 TEMPLATE_TYPE_PARM_FOR_CLASS (t
) = true;
5542 else if (TREE_CODE (decl
) == TYPE_DECL
5543 && TYPE_DECL_ALIAS_P (decl
))
5544 /* alias-declaration */
5545 gcc_assert (!DECL_ARTIFICIAL (decl
));
5546 else if (VAR_P (decl
))
5547 /* C++14 variable template. */;
5550 error ("template declaration of %q#D", decl
);
5551 return error_mark_node
;
5555 /* Check to see that the rules regarding the use of default
5556 arguments are not being violated. We check args for a friend
5557 functions when we know whether it's a definition, introducing
5558 declaration or re-declaration. */
5559 if (!is_friend
|| TREE_CODE (decl
) != FUNCTION_DECL
)
5560 check_default_tmpl_args (decl
, current_template_parms
,
5561 is_primary
, is_partial
, is_friend
);
5563 /* Ensure that there are no parameter packs in the type of this
5564 declaration that have not been expanded. */
5565 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5567 /* Check each of the arguments individually to see if there are
5568 any bare parameter packs. */
5569 tree type
= TREE_TYPE (decl
);
5570 tree arg
= DECL_ARGUMENTS (decl
);
5571 tree argtype
= TYPE_ARG_TYPES (type
);
5573 while (arg
&& argtype
)
5575 if (!DECL_PACK_P (arg
)
5576 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
5578 /* This is a PARM_DECL that contains unexpanded parameter
5579 packs. We have already complained about this in the
5580 check_for_bare_parameter_packs call, so just replace
5581 these types with ERROR_MARK_NODE. */
5582 TREE_TYPE (arg
) = error_mark_node
;
5583 TREE_VALUE (argtype
) = error_mark_node
;
5586 arg
= DECL_CHAIN (arg
);
5587 argtype
= TREE_CHAIN (argtype
);
5590 /* Check for bare parameter packs in the return type and the
5591 exception specifiers. */
5592 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
5593 /* Errors were already issued, set return type to int
5594 as the frontend doesn't expect error_mark_node as
5596 TREE_TYPE (type
) = integer_type_node
;
5597 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
5598 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
5600 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
5601 && TYPE_DECL_ALIAS_P (decl
))
5602 ? DECL_ORIGINAL_TYPE (decl
)
5603 : TREE_TYPE (decl
)))
5605 TREE_TYPE (decl
) = error_mark_node
;
5606 return error_mark_node
;
5610 return process_partial_specialization (decl
);
5612 args
= current_template_args ();
5615 || TREE_CODE (ctx
) == FUNCTION_DECL
5616 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
5617 || (TREE_CODE (decl
) == TYPE_DECL
5618 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5619 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
5621 if (DECL_LANG_SPECIFIC (decl
)
5622 && DECL_TEMPLATE_INFO (decl
)
5623 && DECL_TI_TEMPLATE (decl
))
5624 tmpl
= DECL_TI_TEMPLATE (decl
);
5625 /* If DECL is a TYPE_DECL for a class-template, then there won't
5626 be DECL_LANG_SPECIFIC. The information equivalent to
5627 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
5628 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5629 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
5630 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
5632 /* Since a template declaration already existed for this
5633 class-type, we must be redeclaring it here. Make sure
5634 that the redeclaration is valid. */
5635 redeclare_class_template (TREE_TYPE (decl
),
5636 current_template_parms
,
5637 current_template_constraints ());
5638 /* We don't need to create a new TEMPLATE_DECL; just use the
5639 one we already had. */
5640 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
5644 tmpl
= build_template_decl (decl
, current_template_parms
,
5648 if (DECL_LANG_SPECIFIC (decl
)
5649 && DECL_TEMPLATE_SPECIALIZATION (decl
))
5651 /* A specialization of a member template of a template
5653 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
5654 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
5655 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
5661 tree a
, t
, current
, parms
;
5663 tree tinfo
= get_template_info (decl
);
5667 error ("template definition of non-template %q#D", decl
);
5668 return error_mark_node
;
5671 tmpl
= TI_TEMPLATE (tinfo
);
5673 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
5674 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
5675 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5676 && DECL_MEMBER_TEMPLATE_P (tmpl
))
5680 /* The declaration is a specialization of a member
5681 template, declared outside the class. Therefore, the
5682 innermost template arguments will be NULL, so we
5683 replace them with the arguments determined by the
5684 earlier call to check_explicit_specialization. */
5685 args
= DECL_TI_ARGS (decl
);
5688 = build_template_decl (decl
, current_template_parms
,
5690 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
5691 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
5692 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
5693 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
5694 DECL_TEMPLATE_INFO (new_tmpl
)
5695 = build_template_info (tmpl
, args
);
5697 register_specialization (new_tmpl
,
5698 most_general_template (tmpl
),
5704 /* Make sure the template headers we got make sense. */
5706 parms
= DECL_TEMPLATE_PARMS (tmpl
);
5707 i
= TMPL_PARMS_DEPTH (parms
);
5708 if (TMPL_ARGS_DEPTH (args
) != i
)
5710 error ("expected %d levels of template parms for %q#D, got %d",
5711 i
, decl
, TMPL_ARGS_DEPTH (args
));
5712 DECL_INTERFACE_KNOWN (decl
) = 1;
5713 return error_mark_node
;
5716 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
5718 a
= TMPL_ARGS_LEVEL (args
, i
);
5719 t
= INNERMOST_TEMPLATE_PARMS (parms
);
5721 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
5723 if (current
== decl
)
5724 error ("got %d template parameters for %q#D",
5725 TREE_VEC_LENGTH (a
), decl
);
5727 error ("got %d template parameters for %q#T",
5728 TREE_VEC_LENGTH (a
), current
);
5729 error (" but %d required", TREE_VEC_LENGTH (t
));
5730 /* Avoid crash in import_export_decl. */
5731 DECL_INTERFACE_KNOWN (decl
) = 1;
5732 return error_mark_node
;
5735 if (current
== decl
)
5737 else if (current
== NULL_TREE
)
5738 /* Can happen in erroneous input. */
5741 current
= get_containing_scope (current
);
5744 /* Check that the parms are used in the appropriate qualifying scopes
5745 in the declarator. */
5746 if (!comp_template_args
5748 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
5750 error ("template arguments to %qD do not match original "
5751 "template %qD", decl
, DECL_TEMPLATE_RESULT (tmpl
));
5752 if (!uses_template_parms (TI_ARGS (tinfo
)))
5753 inform (input_location
, "use %<template<>%> for"
5754 " an explicit specialization");
5755 /* Avoid crash in import_export_decl. */
5756 DECL_INTERFACE_KNOWN (decl
) = 1;
5757 return error_mark_node
;
5761 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
5762 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
5764 /* Push template declarations for global functions and types. Note
5765 that we do not try to push a global template friend declared in a
5766 template class; such a thing may well depend on the template
5767 parameters of the class. */
5768 if (new_template_p
&& !ctx
5769 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
5771 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
5772 if (tmpl
== error_mark_node
)
5773 return error_mark_node
;
5775 /* Hide template friend classes that haven't been declared yet. */
5776 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
5778 DECL_ANTICIPATED (tmpl
) = 1;
5779 DECL_FRIEND_P (tmpl
) = 1;
5785 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5787 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5789 /* Give template template parms a DECL_CONTEXT of the template
5790 for which they are a parameter. */
5791 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5792 for (int i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5794 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5795 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5796 DECL_CONTEXT (parm
) = tmpl
;
5799 if (TREE_CODE (decl
) == TYPE_DECL
5800 && TYPE_DECL_ALIAS_P (decl
)
5801 && complex_alias_template_p (tmpl
))
5802 TEMPLATE_DECL_COMPLEX_ALIAS_P (tmpl
) = true;
5805 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5806 back to its most general template. If TMPL is a specialization,
5807 ARGS may only have the innermost set of arguments. Add the missing
5808 argument levels if necessary. */
5809 if (DECL_TEMPLATE_INFO (tmpl
))
5810 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5812 info
= build_template_info (tmpl
, args
);
5814 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5815 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5819 retrofit_lang_decl (decl
);
5820 if (DECL_LANG_SPECIFIC (decl
))
5821 DECL_TEMPLATE_INFO (decl
) = info
;
5824 if (flag_implicit_templates
5826 && TREE_PUBLIC (decl
)
5827 && VAR_OR_FUNCTION_DECL_P (decl
))
5828 /* Set DECL_COMDAT on template instantiations; if we force
5829 them to be emitted by explicit instantiation or -frepo,
5830 mark_needed will tell cgraph to do the right thing. */
5831 DECL_COMDAT (decl
) = true;
5833 return DECL_TEMPLATE_RESULT (tmpl
);
5837 push_template_decl (tree decl
)
5839 return push_template_decl_real (decl
, false);
5842 /* FN is an inheriting constructor that inherits from the constructor
5843 template INHERITED; turn FN into a constructor template with a matching
5847 add_inherited_template_parms (tree fn
, tree inherited
)
5850 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5851 inner_parms
= copy_node (inner_parms
);
5853 = tree_cons (size_int (processing_template_decl
+ 1),
5854 inner_parms
, current_template_parms
);
5855 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5856 tree args
= template_parms_to_args (parms
);
5857 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5858 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5859 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5860 DECL_ARTIFICIAL (tmpl
) = true;
5861 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5865 /* Called when a class template TYPE is redeclared with the indicated
5866 template PARMS, e.g.:
5868 template <class T> struct S;
5869 template <class T> struct S {}; */
5872 redeclare_class_template (tree type
, tree parms
, tree cons
)
5878 if (!TYPE_TEMPLATE_INFO (type
))
5880 error ("%qT is not a template type", type
);
5884 tmpl
= TYPE_TI_TEMPLATE (type
);
5885 if (!PRIMARY_TEMPLATE_P (tmpl
))
5886 /* The type is nested in some template class. Nothing to worry
5887 about here; there are no new template parameters for the nested
5893 error ("template specifiers not specified in declaration of %qD",
5898 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5899 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5901 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5903 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5904 "redeclared with %d template parameter",
5905 "redeclared with %d template parameters",
5906 TREE_VEC_LENGTH (parms
));
5907 inform_n (DECL_SOURCE_LOCATION (tmpl
), TREE_VEC_LENGTH (tmpl_parms
),
5908 "previous declaration %qD used %d template parameter",
5909 "previous declaration %qD used %d template parameters",
5910 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5914 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5921 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5922 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5925 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5926 if (error_operand_p (tmpl_parm
))
5929 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5930 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5931 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5933 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5935 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5936 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5937 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5938 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5939 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5940 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5941 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5942 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5943 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5945 error ("template parameter %q+#D", tmpl_parm
);
5946 error ("redeclared here as %q#D", parm
);
5950 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5952 /* We have in [temp.param]:
5954 A template-parameter may not be given default arguments
5955 by two different declarations in the same scope. */
5956 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5957 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5958 "original definition appeared here");
5962 if (parm_default
!= NULL_TREE
)
5963 /* Update the previous template parameters (which are the ones
5964 that will really count) with the new default value. */
5965 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5966 else if (tmpl_default
!= NULL_TREE
)
5967 /* Update the new parameters, too; they'll be used as the
5968 parameters for any members. */
5969 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5971 /* Give each template template parm in this redeclaration a
5972 DECL_CONTEXT of the template for which they are a parameter. */
5973 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5975 gcc_assert (DECL_CONTEXT (parm
) == NULL_TREE
);
5976 DECL_CONTEXT (parm
) = tmpl
;
5979 if (TREE_CODE (parm
) == TYPE_DECL
)
5980 TEMPLATE_TYPE_PARM_FOR_CLASS (TREE_TYPE (parm
)) = true;
5983 // Cannot redeclare a class template with a different set of constraints.
5984 if (!equivalent_constraints (get_constraints (tmpl
), cons
))
5986 error_at (input_location
, "redeclaration %q#D with different "
5987 "constraints", tmpl
);
5988 inform (DECL_SOURCE_LOCATION (tmpl
),
5989 "original declaration appeared here");
5995 /* The actual substitution part of instantiate_non_dependent_expr_sfinae,
5996 to be used when the caller has already checked
5997 (processing_template_decl
5998 && !instantiation_dependent_expression_p (expr)
5999 && potential_constant_expression (expr))
6000 and cleared processing_template_decl. */
6003 instantiate_non_dependent_expr_internal (tree expr
, tsubst_flags_t complain
)
6005 return tsubst_copy_and_build (expr
,
6008 /*in_decl=*/NULL_TREE
,
6009 /*function_p=*/false,
6010 /*integral_constant_expression_p=*/true);
6013 /* Simplify EXPR if it is a non-dependent expression. Returns the
6014 (possibly simplified) expression. */
6017 instantiate_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
6019 if (expr
== NULL_TREE
)
6022 /* If we're in a template, but EXPR isn't value dependent, simplify
6023 it. We're supposed to treat:
6025 template <typename T> void f(T[1 + 1]);
6026 template <typename T> void f(T[2]);
6028 as two declarations of the same function, for example. */
6029 if (processing_template_decl
6030 && is_nondependent_constant_expression (expr
))
6032 processing_template_decl_sentinel s
;
6033 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
6039 instantiate_non_dependent_expr (tree expr
)
6041 return instantiate_non_dependent_expr_sfinae (expr
, tf_error
);
6044 /* Like instantiate_non_dependent_expr, but return NULL_TREE rather than
6045 an uninstantiated expression. */
6048 instantiate_non_dependent_or_null (tree expr
)
6050 if (expr
== NULL_TREE
)
6052 if (processing_template_decl
)
6054 if (!is_nondependent_constant_expression (expr
))
6058 processing_template_decl_sentinel s
;
6059 expr
= instantiate_non_dependent_expr_internal (expr
, tf_error
);
6065 /* True iff T is a specialization of a variable template. */
6068 variable_template_specialization_p (tree t
)
6070 if (!VAR_P (t
) || !DECL_LANG_SPECIFIC (t
) || !DECL_TEMPLATE_INFO (t
))
6072 tree tmpl
= DECL_TI_TEMPLATE (t
);
6073 return variable_template_p (tmpl
);
6076 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
6077 template declaration, or a TYPE_DECL for an alias declaration. */
6080 alias_type_or_template_p (tree t
)
6084 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
6087 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
6088 || DECL_ALIAS_TEMPLATE_P (t
));
6091 /* Return TRUE iff T is a specialization of an alias template. */
6094 alias_template_specialization_p (const_tree t
)
6096 /* It's an alias template specialization if it's an alias and its
6097 TYPE_NAME is a specialization of a primary template. */
6098 if (TYPE_ALIAS_P (t
))
6099 if (tree tinfo
= TYPE_ALIAS_TEMPLATE_INFO (t
))
6100 return PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
));
6105 /* An alias template is complex from a SFINAE perspective if a template-id
6106 using that alias can be ill-formed when the expansion is not, as with
6107 the void_t template. We determine this by checking whether the
6108 expansion for the alias template uses all its template parameters. */
6110 struct uses_all_template_parms_data
6117 uses_all_template_parms_r (tree t
, void *data_
)
6119 struct uses_all_template_parms_data
&data
6120 = *(struct uses_all_template_parms_data
*)data_
;
6121 tree idx
= get_template_parm_index (t
);
6123 if (TEMPLATE_PARM_LEVEL (idx
) == data
.level
)
6124 data
.seen
[TEMPLATE_PARM_IDX (idx
)] = true;
6129 complex_alias_template_p (const_tree tmpl
)
6131 struct uses_all_template_parms_data data
;
6132 tree pat
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
6133 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
6134 data
.level
= TMPL_PARMS_DEPTH (parms
);
6135 int len
= TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS (parms
));
6136 data
.seen
= XALLOCAVEC (bool, len
);
6137 for (int i
= 0; i
< len
; ++i
)
6138 data
.seen
[i
] = false;
6140 for_each_template_parm (pat
, uses_all_template_parms_r
, &data
, NULL
, true);
6141 for (int i
= 0; i
< len
; ++i
)
6147 /* Return TRUE iff T is a specialization of a complex alias template with
6148 dependent template-arguments. */
6151 dependent_alias_template_spec_p (const_tree t
)
6153 if (!alias_template_specialization_p (t
))
6156 tree tinfo
= TYPE_ALIAS_TEMPLATE_INFO (t
);
6157 if (!TEMPLATE_DECL_COMPLEX_ALIAS_P (TI_TEMPLATE (tinfo
)))
6160 tree args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
));
6161 if (!any_dependent_template_arguments_p (args
))
6167 /* Return the number of innermost template parameters in TMPL. */
6170 num_innermost_template_parms (tree tmpl
)
6172 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
6173 return TREE_VEC_LENGTH (parms
);
6176 /* Return either TMPL or another template that it is equivalent to under DR
6177 1286: An alias that just changes the name of a template is equivalent to
6178 the other template. */
6181 get_underlying_template (tree tmpl
)
6183 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
6184 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
6186 /* Determine if the alias is equivalent to an underlying template. */
6187 tree orig_type
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
6188 tree tinfo
= TYPE_TEMPLATE_INFO_MAYBE_ALIAS (orig_type
);
6192 tree underlying
= TI_TEMPLATE (tinfo
);
6193 if (!PRIMARY_TEMPLATE_P (underlying
)
6194 || (num_innermost_template_parms (tmpl
)
6195 != num_innermost_template_parms (underlying
)))
6198 tree alias_args
= INNERMOST_TEMPLATE_ARGS
6199 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
6200 if (!comp_template_args (TI_ARGS (tinfo
), alias_args
))
6203 /* Alias is equivalent. Strip it and repeat. */
6210 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
6211 must be a reference-to-function or a pointer-to-function type, as specified
6212 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
6213 and check that the resulting function has external linkage. */
6216 convert_nontype_argument_function (tree type
, tree expr
,
6217 tsubst_flags_t complain
)
6221 linkage_kind linkage
;
6223 fn
= instantiate_type (type
, fns
, tf_none
);
6224 if (fn
== error_mark_node
)
6225 return error_mark_node
;
6227 if (value_dependent_expression_p (fn
))
6230 fn_no_ptr
= strip_fnptr_conv (fn
);
6231 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
6232 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
6233 if (BASELINK_P (fn_no_ptr
))
6234 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
6236 /* [temp.arg.nontype]/1
6238 A template-argument for a non-type, non-template template-parameter
6241 -- the address of an object or function with external [C++11: or
6242 internal] linkage. */
6244 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
6246 if (complain
& tf_error
)
6248 error ("%qE is not a valid template argument for type %qT",
6250 if (TYPE_PTR_P (type
))
6251 inform (input_location
, "it must be the address of a function "
6252 "with external linkage");
6254 inform (input_location
, "it must be the name of a function with "
6255 "external linkage");
6260 linkage
= decl_linkage (fn_no_ptr
);
6261 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
6263 if (complain
& tf_error
)
6265 if (cxx_dialect
>= cxx11
)
6266 error ("%qE is not a valid template argument for type %qT "
6267 "because %qD has no linkage",
6268 expr
, type
, fn_no_ptr
);
6270 error ("%qE is not a valid template argument for type %qT "
6271 "because %qD does not have external linkage",
6272 expr
, type
, fn_no_ptr
);
6278 if (TYPE_REF_P (type
))
6280 if (REFERENCE_REF_P (fn
))
6281 fn
= TREE_OPERAND (fn
, 0);
6283 fn
= build_address (fn
);
6285 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (fn
)))
6286 fn
= build_nop (type
, fn
);
6291 /* Subroutine of convert_nontype_argument.
6292 Check if EXPR of type TYPE is a valid pointer-to-member constant.
6293 Emit an error otherwise. */
6296 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
6297 tsubst_flags_t complain
)
6299 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
6300 tree orig_expr
= expr
;
6302 if (null_ptr_cst_p (expr
))
6304 if (TREE_CODE (expr
) == PTRMEM_CST
6305 && same_type_p (TYPE_PTRMEM_CLASS_TYPE (type
),
6306 PTRMEM_CST_CLASS (expr
)))
6308 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
6310 if (processing_template_decl
6311 && TREE_CODE (expr
) == ADDR_EXPR
6312 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
6314 if (complain
& tf_error
)
6316 error_at (loc
, "%qE is not a valid template argument for type %qT",
6318 if (TREE_CODE (expr
) != PTRMEM_CST
)
6319 inform (loc
, "it must be a pointer-to-member of the form %<&X::Y%>");
6321 inform (loc
, "because it is a member of %qT", PTRMEM_CST_CLASS (expr
));
6326 /* Returns TRUE iff the address of OP is value-dependent.
6328 14.6.2.4 [temp.dep.temp]:
6329 A non-integral non-type template-argument is dependent if its type is
6330 dependent or it has either of the following forms
6333 and contains a nested-name-specifier which specifies a class-name that
6334 names a dependent type.
6336 We generalize this to just say that the address of a member of a
6337 dependent class is value-dependent; the above doesn't cover the
6338 address of a static data member named with an unqualified-id. */
6341 has_value_dependent_address (tree op
)
6343 /* We could use get_inner_reference here, but there's no need;
6344 this is only relevant for template non-type arguments, which
6345 can only be expressed as &id-expression. */
6348 tree ctx
= CP_DECL_CONTEXT (op
);
6349 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
6356 /* The next set of functions are used for providing helpful explanatory
6357 diagnostics for failed overload resolution. Their messages should be
6358 indented by two spaces for consistency with the messages in
6362 unify_success (bool /*explain_p*/)
6367 /* Other failure functions should call this one, to provide a single function
6368 for setting a breakpoint on. */
6371 unify_invalid (bool /*explain_p*/)
6377 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
6380 inform (input_location
,
6381 " couldn't deduce template parameter %qD", parm
);
6382 return unify_invalid (explain_p
);
6386 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
6389 inform (input_location
,
6390 " types %qT and %qT have incompatible cv-qualifiers",
6392 return unify_invalid (explain_p
);
6396 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
6399 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
6400 return unify_invalid (explain_p
);
6404 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
6407 inform (input_location
,
6408 " template parameter %qD is not a parameter pack, but "
6411 return unify_invalid (explain_p
);
6415 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
6418 inform (input_location
,
6419 " template argument %qE does not match "
6420 "pointer-to-member constant %qE",
6422 return unify_invalid (explain_p
);
6426 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
6429 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
6430 return unify_invalid (explain_p
);
6434 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
6437 inform (input_location
,
6438 " inconsistent parameter pack deduction with %qT and %qT",
6440 return unify_invalid (explain_p
);
6444 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
6449 inform (input_location
,
6450 " deduced conflicting types for parameter %qT (%qT and %qT)",
6451 parm
, first
, second
);
6453 inform (input_location
,
6454 " deduced conflicting values for non-type parameter "
6455 "%qE (%qE and %qE)", parm
, first
, second
);
6457 return unify_invalid (explain_p
);
6461 unify_vla_arg (bool explain_p
, tree arg
)
6464 inform (input_location
,
6465 " variable-sized array type %qT is not "
6466 "a valid template argument",
6468 return unify_invalid (explain_p
);
6472 unify_method_type_error (bool explain_p
, tree arg
)
6475 inform (input_location
,
6476 " member function type %qT is not a valid template argument",
6478 return unify_invalid (explain_p
);
6482 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
6487 inform_n (input_location
, wanted
,
6488 " candidate expects at least %d argument, %d provided",
6489 " candidate expects at least %d arguments, %d provided",
6492 inform_n (input_location
, wanted
,
6493 " candidate expects %d argument, %d provided",
6494 " candidate expects %d arguments, %d provided",
6497 return unify_invalid (explain_p
);
6501 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
6503 return unify_arity (explain_p
, have
, wanted
);
6507 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
6508 bool least_p
= false)
6510 return unify_arity (explain_p
, have
, wanted
, least_p
);
6514 unify_arg_conversion (bool explain_p
, tree to_type
,
6515 tree from_type
, tree arg
)
6518 inform (cp_expr_loc_or_loc (arg
, input_location
),
6519 " cannot convert %qE (type %qT) to type %qT",
6520 arg
, from_type
, to_type
);
6521 return unify_invalid (explain_p
);
6525 unify_no_common_base (bool explain_p
, enum template_base_result r
,
6526 tree parm
, tree arg
)
6531 case tbr_ambiguous_baseclass
:
6532 inform (input_location
, " %qT is an ambiguous base class of %qT",
6536 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
6539 return unify_invalid (explain_p
);
6543 unify_inconsistent_template_template_parameters (bool explain_p
)
6546 inform (input_location
,
6547 " template parameters of a template template argument are "
6548 "inconsistent with other deduced template arguments");
6549 return unify_invalid (explain_p
);
6553 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
6556 inform (input_location
,
6557 " can't deduce a template for %qT from non-template type %qT",
6559 return unify_invalid (explain_p
);
6563 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
6566 inform (input_location
,
6567 " template argument %qE does not match %qE", arg
, parm
);
6568 return unify_invalid (explain_p
);
6571 /* Attempt to convert the non-type template parameter EXPR to the
6572 indicated TYPE. If the conversion is successful, return the
6573 converted value. If the conversion is unsuccessful, return
6574 NULL_TREE if we issued an error message, or error_mark_node if we
6575 did not. We issue error messages for out-and-out bad template
6576 parameters, but not simply because the conversion failed, since we
6577 might be just trying to do argument deduction. Both TYPE and EXPR
6578 must be non-dependent.
6580 The conversion follows the special rules described in
6581 [temp.arg.nontype], and it is much more strict than an implicit
6584 This function is called twice for each template argument (see
6585 lookup_template_class for a more accurate description of this
6586 problem). This means that we need to handle expressions which
6587 are not valid in a C++ source, but can be created from the
6588 first call (for instance, casts to perform conversions). These
6589 hacks can go away after we fix the double coercion problem. */
6592 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
6595 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
6596 tree orig_expr
= expr
;
6598 /* Detect immediately string literals as invalid non-type argument.
6599 This special-case is not needed for correctness (we would easily
6600 catch this later), but only to provide better diagnostic for this
6601 common user mistake. As suggested by DR 100, we do not mention
6602 linkage issues in the diagnostic as this is not the point. */
6603 /* FIXME we're making this OK. */
6604 if (TREE_CODE (expr
) == STRING_CST
)
6606 if (complain
& tf_error
)
6607 error ("%qE is not a valid template argument for type %qT "
6608 "because string literals can never be used in this context",
6613 /* Add the ADDR_EXPR now for the benefit of
6614 value_dependent_expression_p. */
6615 if (TYPE_PTROBV_P (type
)
6616 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
6618 expr
= decay_conversion (expr
, complain
);
6619 if (expr
== error_mark_node
)
6620 return error_mark_node
;
6623 /* If we are in a template, EXPR may be non-dependent, but still
6624 have a syntactic, rather than semantic, form. For example, EXPR
6625 might be a SCOPE_REF, rather than the VAR_DECL to which the
6626 SCOPE_REF refers. Preserving the qualifying scope is necessary
6627 so that access checking can be performed when the template is
6628 instantiated -- but here we need the resolved form so that we can
6629 convert the argument. */
6630 bool non_dep
= false;
6631 if (TYPE_REF_OBJ_P (type
)
6632 && has_value_dependent_address (expr
))
6633 /* If we want the address and it's value-dependent, don't fold. */;
6634 else if (processing_template_decl
6635 && is_nondependent_constant_expression (expr
))
6637 if (error_operand_p (expr
))
6638 return error_mark_node
;
6639 expr_type
= TREE_TYPE (expr
);
6641 /* If the argument is non-dependent, perform any conversions in
6642 non-dependent context as well. */
6643 processing_template_decl_sentinel
s (non_dep
);
6645 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
6647 if (value_dependent_expression_p (expr
))
6648 expr
= canonicalize_expr_argument (expr
, complain
);
6650 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
6651 to a non-type argument of "nullptr". */
6652 if (NULLPTR_TYPE_P (expr_type
) && TYPE_PTR_OR_PTRMEM_P (type
))
6653 expr
= fold_simple (convert (type
, expr
));
6655 /* In C++11, integral or enumeration non-type template arguments can be
6656 arbitrary constant expressions. Pointer and pointer to
6657 member arguments can be general constant expressions that evaluate
6658 to a null value, but otherwise still need to be of a specific form. */
6659 if (cxx_dialect
>= cxx11
)
6661 if (TREE_CODE (expr
) == PTRMEM_CST
)
6662 /* A PTRMEM_CST is already constant, and a valid template
6663 argument for a parameter of pointer to member type, we just want
6664 to leave it in that form rather than lower it to a
6666 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
6667 || cxx_dialect
>= cxx17
)
6669 /* C++17: A template-argument for a non-type template-parameter shall
6670 be a converted constant expression (8.20) of the type of the
6671 template-parameter. */
6672 expr
= build_converted_constant_expr (type
, expr
, complain
);
6673 if (expr
== error_mark_node
)
6674 return error_mark_node
;
6675 expr
= maybe_constant_value (expr
);
6676 expr
= convert_from_reference (expr
);
6678 else if (TYPE_PTR_OR_PTRMEM_P (type
))
6680 tree folded
= maybe_constant_value (expr
);
6681 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
6682 : null_member_pointer_value_p (folded
))
6687 if (TYPE_REF_P (type
))
6688 expr
= mark_lvalue_use (expr
);
6690 expr
= mark_rvalue_use (expr
);
6692 /* HACK: Due to double coercion, we can get a
6693 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
6694 which is the tree that we built on the first call (see
6695 below when coercing to reference to object or to reference to
6696 function). We just strip everything and get to the arg.
6697 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
6699 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
6701 tree probe_type
, probe
= expr
;
6702 if (REFERENCE_REF_P (probe
))
6703 probe
= TREE_OPERAND (probe
, 0);
6704 probe_type
= TREE_TYPE (probe
);
6705 if (TREE_CODE (probe
) == NOP_EXPR
)
6707 /* ??? Maybe we could use convert_from_reference here, but we
6708 would need to relax its constraints because the NOP_EXPR
6709 could actually change the type to something more cv-qualified,
6710 and this is not folded by convert_from_reference. */
6711 tree addr
= TREE_OPERAND (probe
, 0);
6712 if (TYPE_REF_P (probe_type
)
6713 && TREE_CODE (addr
) == ADDR_EXPR
6714 && TYPE_PTR_P (TREE_TYPE (addr
))
6715 && (same_type_ignoring_top_level_qualifiers_p
6716 (TREE_TYPE (probe_type
),
6717 TREE_TYPE (TREE_TYPE (addr
)))))
6719 expr
= TREE_OPERAND (addr
, 0);
6720 expr_type
= TREE_TYPE (probe_type
);
6725 /* [temp.arg.nontype]/5, bullet 1
6727 For a non-type template-parameter of integral or enumeration type,
6728 integral promotions (_conv.prom_) and integral conversions
6729 (_conv.integral_) are applied. */
6730 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6732 if (cxx_dialect
< cxx11
)
6734 tree t
= build_converted_constant_expr (type
, expr
, complain
);
6735 t
= maybe_constant_value (t
);
6736 if (t
!= error_mark_node
)
6740 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
6741 return error_mark_node
;
6743 /* Notice that there are constant expressions like '4 % 0' which
6744 do not fold into integer constants. */
6745 if (TREE_CODE (expr
) != INTEGER_CST
6746 && !value_dependent_expression_p (expr
))
6748 if (complain
& tf_error
)
6750 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
6751 if (!require_potential_constant_expression (expr
))
6752 expr
= error_mark_node
;
6754 expr
= cxx_constant_value (expr
);
6755 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
6756 inform (loc
, "in template argument for type %qT", type
);
6757 if (expr
== error_mark_node
)
6759 /* else cxx_constant_value complained but gave us
6760 a real constant, so go ahead. */
6761 if (TREE_CODE (expr
) != INTEGER_CST
)
6763 /* Some assemble time constant expressions like
6764 (intptr_t)&&lab1 - (intptr_t)&&lab2 or
6765 4 + (intptr_t)&&var satisfy reduced_constant_expression_p
6766 as we can emit them into .rodata initializers of
6767 variables, yet they can't fold into an INTEGER_CST at
6768 compile time. Refuse them here. */
6769 gcc_checking_assert (reduced_constant_expression_p (expr
));
6770 error_at (loc
, "template argument %qE for type %qT not "
6771 "a constant integer", expr
, type
);
6779 /* Avoid typedef problems. */
6780 if (TREE_TYPE (expr
) != type
)
6781 expr
= fold_convert (type
, expr
);
6783 /* [temp.arg.nontype]/5, bullet 2
6785 For a non-type template-parameter of type pointer to object,
6786 qualification conversions (_conv.qual_) and the array-to-pointer
6787 conversion (_conv.array_) are applied. */
6788 else if (TYPE_PTROBV_P (type
))
6790 tree decayed
= expr
;
6792 /* Look through any NOP_EXPRs around an ADDR_EXPR, whether they come from
6793 decay_conversion or an explicit cast. If it's a problematic cast,
6794 we'll complain about it below. */
6795 if (TREE_CODE (expr
) == NOP_EXPR
)
6799 if (TREE_CODE (probe
) == ADDR_EXPR
6800 && TYPE_PTR_P (TREE_TYPE (probe
)))
6803 expr_type
= TREE_TYPE (expr
);
6807 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
6809 A template-argument for a non-type, non-template template-parameter
6810 shall be one of: [...]
6812 -- the name of a non-type template-parameter;
6813 -- the address of an object or function with external linkage, [...]
6814 expressed as "& id-expression" where the & is optional if the name
6815 refers to a function or array, or if the corresponding
6816 template-parameter is a reference.
6818 Here, we do not care about functions, as they are invalid anyway
6819 for a parameter of type pointer-to-object. */
6821 if (value_dependent_expression_p (expr
))
6822 /* Non-type template parameters are OK. */
6824 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6825 /* Null pointer values are OK in C++11. */;
6826 else if (TREE_CODE (expr
) != ADDR_EXPR
)
6830 if (complain
& tf_error
)
6831 error ("%qD is not a valid template argument "
6832 "because %qD is a variable, not the address of "
6833 "a variable", orig_expr
, expr
);
6836 if (INDIRECT_TYPE_P (expr_type
))
6838 if (complain
& tf_error
)
6839 error ("%qE is not a valid template argument for %qT "
6840 "because it is not the address of a variable",
6844 /* Other values, like integer constants, might be valid
6845 non-type arguments of some other type. */
6846 return error_mark_node
;
6850 tree decl
= TREE_OPERAND (expr
, 0);
6854 if (complain
& tf_error
)
6855 error ("%qE is not a valid template argument of type %qT "
6856 "because %qE is not a variable", orig_expr
, type
, decl
);
6859 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
6861 if (complain
& tf_error
)
6862 error ("%qE is not a valid template argument of type %qT "
6863 "because %qD does not have external linkage",
6864 orig_expr
, type
, decl
);
6867 else if ((cxx_dialect
>= cxx11
&& cxx_dialect
< cxx17
)
6868 && decl_linkage (decl
) == lk_none
)
6870 if (complain
& tf_error
)
6871 error ("%qE is not a valid template argument of type %qT "
6872 "because %qD has no linkage", orig_expr
, type
, decl
);
6875 /* C++17: For a non-type template-parameter of reference or pointer
6876 type, the value of the constant expression shall not refer to (or
6877 for a pointer type, shall not be the address of):
6878 * a subobject (4.5),
6879 * a temporary object (15.2),
6880 * a string literal (5.13.5),
6881 * the result of a typeid expression (8.2.8), or
6882 * a predefined __func__ variable (11.4.1). */
6883 else if (DECL_ARTIFICIAL (decl
))
6885 if (complain
& tf_error
)
6886 error ("the address of %qD is not a valid template argument",
6890 else if (!same_type_ignoring_top_level_qualifiers_p
6891 (strip_array_types (TREE_TYPE (type
)),
6892 strip_array_types (TREE_TYPE (decl
))))
6894 if (complain
& tf_error
)
6895 error ("the address of the %qT subobject of %qD is not a "
6896 "valid template argument", TREE_TYPE (type
), decl
);
6899 else if (!TREE_STATIC (decl
) && !DECL_EXTERNAL (decl
))
6901 if (complain
& tf_error
)
6902 error ("the address of %qD is not a valid template argument "
6903 "because it does not have static storage duration",
6911 expr
= perform_qualification_conversions (type
, expr
);
6912 if (expr
== error_mark_node
)
6913 return error_mark_node
;
6915 /* [temp.arg.nontype]/5, bullet 3
6917 For a non-type template-parameter of type reference to object, no
6918 conversions apply. The type referred to by the reference may be more
6919 cv-qualified than the (otherwise identical) type of the
6920 template-argument. The template-parameter is bound directly to the
6921 template-argument, which must be an lvalue. */
6922 else if (TYPE_REF_OBJ_P (type
))
6924 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
6926 return error_mark_node
;
6928 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
6930 if (complain
& tf_error
)
6931 error ("%qE is not a valid template argument for type %qT "
6932 "because of conflicts in cv-qualification", expr
, type
);
6936 if (!lvalue_p (expr
))
6938 if (complain
& tf_error
)
6939 error ("%qE is not a valid template argument for type %qT "
6940 "because it is not an lvalue", expr
, type
);
6944 /* [temp.arg.nontype]/1
6946 A template-argument for a non-type, non-template template-parameter
6947 shall be one of: [...]
6949 -- the address of an object or function with external linkage. */
6950 if (INDIRECT_REF_P (expr
)
6951 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
6953 expr
= TREE_OPERAND (expr
, 0);
6956 if (complain
& tf_error
)
6957 error ("%q#D is not a valid template argument for type %qT "
6958 "because a reference variable does not have a constant "
6959 "address", expr
, type
);
6964 if (TYPE_REF_OBJ_P (TREE_TYPE (expr
))
6965 && value_dependent_expression_p (expr
))
6966 /* OK, dependent reference. We don't want to ask whether a DECL is
6967 itself value-dependent, since what we want here is its address. */;
6972 if (complain
& tf_error
)
6973 error ("%qE is not a valid template argument for type %qT "
6974 "because it is not an object with linkage",
6979 /* DR 1155 allows internal linkage in C++11 and up. */
6980 linkage_kind linkage
= decl_linkage (expr
);
6981 if (linkage
< (cxx_dialect
>= cxx11
? lk_internal
: lk_external
))
6983 if (complain
& tf_error
)
6984 error ("%qE is not a valid template argument for type %qT "
6985 "because object %qD does not have linkage",
6990 expr
= build_address (expr
);
6993 if (!same_type_p (type
, TREE_TYPE (expr
)))
6994 expr
= build_nop (type
, expr
);
6996 /* [temp.arg.nontype]/5, bullet 4
6998 For a non-type template-parameter of type pointer to function, only
6999 the function-to-pointer conversion (_conv.func_) is applied. If the
7000 template-argument represents a set of overloaded functions (or a
7001 pointer to such), the matching function is selected from the set
7003 else if (TYPE_PTRFN_P (type
))
7005 /* If the argument is a template-id, we might not have enough
7006 context information to decay the pointer. */
7007 if (!type_unknown_p (expr_type
))
7009 expr
= decay_conversion (expr
, complain
);
7010 if (expr
== error_mark_node
)
7011 return error_mark_node
;
7014 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
7015 /* Null pointer values are OK in C++11. */
7016 return perform_qualification_conversions (type
, expr
);
7018 expr
= convert_nontype_argument_function (type
, expr
, complain
);
7019 if (!expr
|| expr
== error_mark_node
)
7022 /* [temp.arg.nontype]/5, bullet 5
7024 For a non-type template-parameter of type reference to function, no
7025 conversions apply. If the template-argument represents a set of
7026 overloaded functions, the matching function is selected from the set
7028 else if (TYPE_REFFN_P (type
))
7030 if (TREE_CODE (expr
) == ADDR_EXPR
)
7032 if (complain
& tf_error
)
7034 error ("%qE is not a valid template argument for type %qT "
7035 "because it is a pointer", expr
, type
);
7036 inform (input_location
, "try using %qE instead",
7037 TREE_OPERAND (expr
, 0));
7042 expr
= convert_nontype_argument_function (type
, expr
, complain
);
7043 if (!expr
|| expr
== error_mark_node
)
7046 /* [temp.arg.nontype]/5, bullet 6
7048 For a non-type template-parameter of type pointer to member function,
7049 no conversions apply. If the template-argument represents a set of
7050 overloaded member functions, the matching member function is selected
7051 from the set (_over.over_). */
7052 else if (TYPE_PTRMEMFUNC_P (type
))
7054 expr
= instantiate_type (type
, expr
, tf_none
);
7055 if (expr
== error_mark_node
)
7056 return error_mark_node
;
7058 /* [temp.arg.nontype] bullet 1 says the pointer to member
7059 expression must be a pointer-to-member constant. */
7060 if (!value_dependent_expression_p (expr
)
7061 && !check_valid_ptrmem_cst_expr (type
, expr
, complain
))
7064 /* Repeated conversion can't deal with a conversion that turns PTRMEM_CST
7065 into a CONSTRUCTOR, so build up a new PTRMEM_CST instead. */
7066 if (fnptr_conv_p (type
, TREE_TYPE (expr
)))
7067 expr
= make_ptrmem_cst (type
, PTRMEM_CST_MEMBER (expr
));
7069 /* [temp.arg.nontype]/5, bullet 7
7071 For a non-type template-parameter of type pointer to data member,
7072 qualification conversions (_conv.qual_) are applied. */
7073 else if (TYPE_PTRDATAMEM_P (type
))
7075 /* [temp.arg.nontype] bullet 1 says the pointer to member
7076 expression must be a pointer-to-member constant. */
7077 if (!value_dependent_expression_p (expr
)
7078 && !check_valid_ptrmem_cst_expr (type
, expr
, complain
))
7081 expr
= perform_qualification_conversions (type
, expr
);
7082 if (expr
== error_mark_node
)
7085 else if (NULLPTR_TYPE_P (type
))
7087 if (!NULLPTR_TYPE_P (TREE_TYPE (expr
)))
7089 if (complain
& tf_error
)
7090 error ("%qE is not a valid template argument for type %qT "
7091 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
7096 /* A template non-type parameter must be one of the above. */
7100 /* Sanity check: did we actually convert the argument to the
7102 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7103 (type
, TREE_TYPE (expr
)));
7104 return convert_from_reference (expr
);
7107 /* Subroutine of coerce_template_template_parms, which returns 1 if
7108 PARM_PARM and ARG_PARM match using the rule for the template
7109 parameters of template template parameters. Both PARM and ARG are
7110 template parameters; the rest of the arguments are the same as for
7111 coerce_template_template_parms.
7114 coerce_template_template_parm (tree parm
,
7116 tsubst_flags_t complain
,
7120 if (arg
== NULL_TREE
|| error_operand_p (arg
)
7121 || parm
== NULL_TREE
|| error_operand_p (parm
))
7124 if (TREE_CODE (arg
) != TREE_CODE (parm
))
7127 switch (TREE_CODE (parm
))
7130 /* We encounter instantiations of templates like
7131 template <template <template <class> class> class TT>
7134 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
7135 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
7137 if (!coerce_template_template_parms
7138 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
7144 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
7145 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
7146 /* Argument is a parameter pack but parameter is not. */
7151 /* The tsubst call is used to handle cases such as
7153 template <int> class C {};
7154 template <class T, template <T> class TT> class D {};
7157 i.e. the parameter list of TT depends on earlier parameters. */
7158 if (!uses_template_parms (TREE_TYPE (arg
)))
7160 tree t
= tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
);
7161 if (!uses_template_parms (t
)
7162 && !same_type_p (t
, TREE_TYPE (arg
)))
7166 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
7167 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
7168 /* Argument is a parameter pack but parameter is not. */
7180 /* Coerce template argument list ARGLIST for use with template
7181 template-parameter TEMPL. */
7184 coerce_template_args_for_ttp (tree templ
, tree arglist
,
7185 tsubst_flags_t complain
)
7187 /* Consider an example where a template template parameter declared as
7189 template <class T, class U = std::allocator<T> > class TT
7191 The template parameter level of T and U are one level larger than
7192 of TT. To proper process the default argument of U, say when an
7193 instantiation `TT<int>' is seen, we need to build the full
7194 arguments containing {int} as the innermost level. Outer levels,
7195 available when not appearing as default template argument, can be
7196 obtained from the arguments of the enclosing template.
7198 Suppose that TT is later substituted with std::vector. The above
7199 instantiation is `TT<int, std::allocator<T> >' with TT at
7200 level 1, and T at level 2, while the template arguments at level 1
7201 becomes {std::vector} and the inner level 2 is {int}. */
7203 tree outer
= DECL_CONTEXT (templ
);
7206 if (DECL_TEMPLATE_SPECIALIZATION (outer
))
7207 /* We want arguments for the partial specialization, not arguments for
7208 the primary template. */
7209 outer
= template_parms_to_args (DECL_TEMPLATE_PARMS (outer
));
7211 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
7213 else if (current_template_parms
)
7215 /* This is an argument of the current template, so we haven't set
7216 DECL_CONTEXT yet. */
7217 tree relevant_template_parms
;
7219 /* Parameter levels that are greater than the level of the given
7220 template template parm are irrelevant. */
7221 relevant_template_parms
= current_template_parms
;
7222 while (TMPL_PARMS_DEPTH (relevant_template_parms
)
7223 != TEMPLATE_TYPE_LEVEL (TREE_TYPE (templ
)))
7224 relevant_template_parms
= TREE_CHAIN (relevant_template_parms
);
7226 outer
= template_parms_to_args (relevant_template_parms
);
7230 arglist
= add_to_template_args (outer
, arglist
);
7232 tree parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
7233 return coerce_template_parms (parmlist
, arglist
, templ
,
7235 /*require_all_args=*/true,
7236 /*use_default_args=*/true);
7239 /* A cache of template template parameters with match-all default
7241 static GTY((deletable
)) hash_map
<tree
,tree
> *defaulted_ttp_cache
;
7243 store_defaulted_ttp (tree v
, tree t
)
7245 if (!defaulted_ttp_cache
)
7246 defaulted_ttp_cache
= hash_map
<tree
,tree
>::create_ggc (13);
7247 defaulted_ttp_cache
->put (v
, t
);
7250 lookup_defaulted_ttp (tree v
)
7252 if (defaulted_ttp_cache
)
7253 if (tree
*p
= defaulted_ttp_cache
->get (v
))
7258 /* T is a bound template template-parameter. Copy its arguments into default
7259 arguments of the template template-parameter's template parameters. */
7262 add_defaults_to_ttp (tree otmpl
)
7264 if (tree c
= lookup_defaulted_ttp (otmpl
))
7267 tree ntmpl
= copy_node (otmpl
);
7269 tree ntype
= copy_node (TREE_TYPE (otmpl
));
7270 TYPE_STUB_DECL (ntype
) = TYPE_NAME (ntype
) = ntmpl
;
7271 TYPE_MAIN_VARIANT (ntype
) = ntype
;
7272 TYPE_POINTER_TO (ntype
) = TYPE_REFERENCE_TO (ntype
) = NULL_TREE
;
7273 TYPE_NAME (ntype
) = ntmpl
;
7274 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
7276 tree idx
= TEMPLATE_TYPE_PARM_INDEX (ntype
)
7277 = copy_node (TEMPLATE_TYPE_PARM_INDEX (ntype
));
7278 TEMPLATE_PARM_DECL (idx
) = ntmpl
;
7279 TREE_TYPE (ntmpl
) = TREE_TYPE (idx
) = ntype
;
7281 tree oparms
= DECL_TEMPLATE_PARMS (otmpl
);
7282 tree parms
= DECL_TEMPLATE_PARMS (ntmpl
) = copy_node (oparms
);
7283 TREE_CHAIN (parms
) = TREE_CHAIN (oparms
);
7284 tree vec
= TREE_VALUE (parms
) = copy_node (TREE_VALUE (parms
));
7285 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
7287 tree o
= TREE_VEC_ELT (vec
, i
);
7288 if (!template_parameter_pack_p (TREE_VALUE (o
)))
7290 tree n
= TREE_VEC_ELT (vec
, i
) = copy_node (o
);
7291 TREE_PURPOSE (n
) = any_targ_node
;
7295 store_defaulted_ttp (otmpl
, ntmpl
);
7299 /* ARG is a bound potential template template-argument, and PARGS is a list
7300 of arguments for the corresponding template template-parameter. Adjust
7301 PARGS as appropriate for application to ARG's template, and if ARG is a
7302 BOUND_TEMPLATE_TEMPLATE_PARM, possibly adjust it to add default template
7303 arguments to the template template parameter. */
7306 coerce_ttp_args_for_tta (tree
& arg
, tree pargs
, tsubst_flags_t complain
)
7308 ++processing_template_decl
;
7309 tree arg_tmpl
= TYPE_TI_TEMPLATE (arg
);
7310 if (DECL_TEMPLATE_TEMPLATE_PARM_P (arg_tmpl
))
7312 /* When comparing two template template-parameters in partial ordering,
7313 rewrite the one currently being used as an argument to have default
7314 arguments for all parameters. */
7315 arg_tmpl
= add_defaults_to_ttp (arg_tmpl
);
7316 pargs
= coerce_template_args_for_ttp (arg_tmpl
, pargs
, complain
);
7317 if (pargs
!= error_mark_node
)
7318 arg
= bind_template_template_parm (TREE_TYPE (arg_tmpl
),
7319 TYPE_TI_ARGS (arg
));
7324 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (arg_tmpl
));
7325 pargs
= coerce_template_parms (aparms
, pargs
, arg_tmpl
, complain
,
7326 /*require_all*/true,
7327 /*use_default*/true);
7329 --processing_template_decl
;
7333 /* Subroutine of unify for the case when PARM is a
7334 BOUND_TEMPLATE_TEMPLATE_PARM. */
7337 unify_bound_ttp_args (tree tparms
, tree targs
, tree parm
, tree
& arg
,
7340 tree parmvec
= TYPE_TI_ARGS (parm
);
7341 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
7343 /* The template template parm might be variadic and the argument
7344 not, so flatten both argument lists. */
7345 parmvec
= expand_template_argument_pack (parmvec
);
7346 argvec
= expand_template_argument_pack (argvec
);
7350 /* In keeping with P0522R0, adjust P's template arguments
7351 to apply to A's template; then flatten it again. */
7352 tree nparmvec
= parmvec
;
7353 nparmvec
= coerce_ttp_args_for_tta (arg
, parmvec
, tf_none
);
7354 nparmvec
= expand_template_argument_pack (nparmvec
);
7356 if (unify (tparms
, targs
, nparmvec
, argvec
,
7357 UNIFY_ALLOW_NONE
, explain_p
))
7360 /* If the P0522 adjustment eliminated a pack expansion, deduce
7363 && TREE_VEC_LENGTH (nparmvec
) < TREE_VEC_LENGTH (parmvec
)
7364 && unify_pack_expansion (tparms
, targs
, parmvec
, argvec
,
7365 DEDUCE_EXACT
, /*sub*/true, explain_p
))
7370 /* Deduce arguments T, i from TT<T> or TT<i>.
7371 We check each element of PARMVEC and ARGVEC individually
7372 rather than the whole TREE_VEC since they can have
7373 different number of elements, which is allowed under N2555. */
7375 int len
= TREE_VEC_LENGTH (parmvec
);
7377 /* Check if the parameters end in a pack, making them
7379 int parm_variadic_p
= 0;
7381 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
7382 parm_variadic_p
= 1;
7384 for (int i
= 0; i
< len
- parm_variadic_p
; ++i
)
7385 /* If the template argument list of P contains a pack
7386 expansion that is not the last template argument, the
7387 entire template argument list is a non-deduced
7389 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
7390 return unify_success (explain_p
);
7392 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
7393 return unify_too_few_arguments (explain_p
,
7394 TREE_VEC_LENGTH (argvec
), len
);
7396 for (int i
= 0; i
< len
- parm_variadic_p
; ++i
)
7397 if (unify (tparms
, targs
,
7398 TREE_VEC_ELT (parmvec
, i
),
7399 TREE_VEC_ELT (argvec
, i
),
7400 UNIFY_ALLOW_NONE
, explain_p
))
7404 && unify_pack_expansion (tparms
, targs
,
7407 /*subr=*/true, explain_p
))
7414 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
7415 template template parameters. Both PARM_PARMS and ARG_PARMS are
7416 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
7419 Consider the example:
7420 template <class T> class A;
7421 template<template <class U> class TT> class B;
7423 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
7424 the parameters to A, and OUTER_ARGS contains A. */
7427 coerce_template_template_parms (tree parm_parms
,
7429 tsubst_flags_t complain
,
7433 int nparms
, nargs
, i
;
7437 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
7438 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
7440 nparms
= TREE_VEC_LENGTH (parm_parms
);
7441 nargs
= TREE_VEC_LENGTH (arg_parms
);
7445 /* P0522R0: A template template-parameter P is at least as specialized as
7446 a template template-argument A if, given the following rewrite to two
7447 function templates, the function template corresponding to P is at
7448 least as specialized as the function template corresponding to A
7449 according to the partial ordering rules for function templates
7450 ([temp.func.order]). Given an invented class template X with the
7451 template parameter list of A (including default arguments):
7453 * Each of the two function templates has the same template parameters,
7454 respectively, as P or A.
7456 * Each function template has a single function parameter whose type is
7457 a specialization of X with template arguments corresponding to the
7458 template parameters from the respective function template where, for
7459 each template parameter PP in the template parameter list of the
7460 function template, a corresponding template argument AA is formed. If
7461 PP declares a parameter pack, then AA is the pack expansion
7462 PP... ([temp.variadic]); otherwise, AA is the id-expression PP.
7464 If the rewrite produces an invalid type, then P is not at least as
7465 specialized as A. */
7467 /* So coerce P's args to apply to A's parms, and then deduce between A's
7468 args and the converted args. If that succeeds, A is at least as
7469 specialized as P, so they match.*/
7470 tree pargs
= template_parms_level_to_args (parm_parms
);
7471 ++processing_template_decl
;
7472 pargs
= coerce_template_parms (arg_parms
, pargs
, NULL_TREE
, tf_none
,
7473 /*require_all*/true, /*use_default*/true);
7474 --processing_template_decl
;
7475 if (pargs
!= error_mark_node
)
7477 tree targs
= make_tree_vec (nargs
);
7478 tree aargs
= template_parms_level_to_args (arg_parms
);
7479 if (!unify (arg_parms
, targs
, aargs
, pargs
, UNIFY_ALLOW_NONE
,
7485 /* Determine whether we have a parameter pack at the end of the
7486 template template parameter's template parameter list. */
7487 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
7489 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
7491 if (error_operand_p (parm
))
7494 switch (TREE_CODE (parm
))
7498 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
7503 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
7513 && !(variadic_p
&& nargs
>= nparms
- 1))
7516 /* Check all of the template parameters except the parameter pack at
7517 the end (if any). */
7518 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
7520 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
7521 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
7524 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
7525 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
7527 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
7535 /* Check each of the template parameters in the template
7536 argument against the template parameter pack at the end of
7537 the template template parameter. */
7538 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
7541 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
7543 for (; i
< nargs
; ++i
)
7545 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
7548 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
7550 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
7559 /* Verifies that the deduced template arguments (in TARGS) for the
7560 template template parameters (in TPARMS) represent valid bindings,
7561 by comparing the template parameter list of each template argument
7562 to the template parameter list of its corresponding template
7563 template parameter, in accordance with DR150. This
7564 routine can only be called after all template arguments have been
7565 deduced. It will return TRUE if all of the template template
7566 parameter bindings are okay, FALSE otherwise. */
7568 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
7570 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
7573 /* We're dealing with template parms in this process. */
7574 ++processing_template_decl
;
7576 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
7578 for (i
= 0; i
< ntparms
; ++i
)
7580 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
7581 tree targ
= TREE_VEC_ELT (targs
, i
);
7583 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
7585 tree packed_args
= NULL_TREE
;
7588 if (ARGUMENT_PACK_P (targ
))
7590 /* Look inside the argument pack. */
7591 packed_args
= ARGUMENT_PACK_ARGS (targ
);
7592 len
= TREE_VEC_LENGTH (packed_args
);
7595 for (idx
= 0; idx
< len
; ++idx
)
7597 tree targ_parms
= NULL_TREE
;
7600 /* Extract the next argument from the argument
7602 targ
= TREE_VEC_ELT (packed_args
, idx
);
7604 if (PACK_EXPANSION_P (targ
))
7605 /* Look at the pattern of the pack expansion. */
7606 targ
= PACK_EXPANSION_PATTERN (targ
);
7608 /* Extract the template parameters from the template
7610 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
7611 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
7612 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
7613 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
7615 /* Verify that we can coerce the template template
7616 parameters from the template argument to the template
7617 parameter. This requires an exact match. */
7619 && !coerce_template_template_parms
7620 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
7635 --processing_template_decl
;
7639 /* Since type attributes aren't mangled, we need to strip them from
7640 template type arguments. */
7643 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
7645 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
7647 bool removed_attributes
= false;
7648 tree canon
= strip_typedefs (arg
, &removed_attributes
);
7649 if (removed_attributes
7650 && (complain
& tf_warning
))
7651 warning (OPT_Wignored_attributes
,
7652 "ignoring attributes on template argument %qT", arg
);
7656 /* And from inside dependent non-type arguments like sizeof(Type). */
7659 canonicalize_expr_argument (tree arg
, tsubst_flags_t complain
)
7661 if (!arg
|| arg
== error_mark_node
)
7663 bool removed_attributes
= false;
7664 tree canon
= strip_typedefs_expr (arg
, &removed_attributes
);
7665 if (removed_attributes
7666 && (complain
& tf_warning
))
7667 warning (OPT_Wignored_attributes
,
7668 "ignoring attributes in template argument %qE", arg
);
7672 // A template declaration can be substituted for a constrained
7673 // template template parameter only when the argument is more
7674 // constrained than the parameter.
7676 is_compatible_template_arg (tree parm
, tree arg
)
7678 tree parm_cons
= get_constraints (parm
);
7680 /* For now, allow constrained template template arguments
7681 and unconstrained template template parameters. */
7682 if (parm_cons
== NULL_TREE
)
7685 tree arg_cons
= get_constraints (arg
);
7687 // If the template parameter is constrained, we need to rewrite its
7688 // constraints in terms of the ARG's template parameters. This ensures
7689 // that all of the template parameter types will have the same depth.
7691 // Note that this is only valid when coerce_template_template_parm is
7692 // true for the innermost template parameters of PARM and ARG. In other
7693 // words, because coercion is successful, this conversion will be valid.
7696 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (arg
));
7697 parm_cons
= tsubst_constraint_info (parm_cons
,
7698 INNERMOST_TEMPLATE_ARGS (args
),
7699 tf_none
, NULL_TREE
);
7700 if (parm_cons
== error_mark_node
)
7704 return subsumes (parm_cons
, arg_cons
);
7707 // Convert a placeholder argument into a binding to the original
7708 // parameter. The original parameter is saved as the TREE_TYPE of
7711 convert_wildcard_argument (tree parm
, tree arg
)
7713 TREE_TYPE (arg
) = parm
;
7717 /* We can't fully resolve ARG given as a non-type template argument to TYPE,
7718 because one of them is dependent. But we need to represent the
7719 conversion for the benefit of cp_tree_equal. */
7722 maybe_convert_nontype_argument (tree type
, tree arg
)
7724 /* Auto parms get no conversion. */
7725 if (type_uses_auto (type
))
7727 /* We don't need or want to add this conversion now if we're going to use the
7728 argument for deduction. */
7729 if (value_dependent_expression_p (arg
))
7732 type
= cv_unqualified (type
);
7733 tree argtype
= TREE_TYPE (arg
);
7734 if (same_type_p (type
, argtype
))
7737 arg
= build1 (IMPLICIT_CONV_EXPR
, type
, arg
);
7738 IMPLICIT_CONV_EXPR_NONTYPE_ARG (arg
) = true;
7742 /* Convert the indicated template ARG as necessary to match the
7743 indicated template PARM. Returns the converted ARG, or
7744 error_mark_node if the conversion was unsuccessful. Error and
7745 warning messages are issued under control of COMPLAIN. This
7746 conversion is for the Ith parameter in the parameter list. ARGS is
7747 the full set of template arguments deduced so far. */
7750 convert_template_argument (tree parm
,
7753 tsubst_flags_t complain
,
7759 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
7761 if (parm
== error_mark_node
)
7762 return error_mark_node
;
7764 /* Trivially convert placeholders. */
7765 if (TREE_CODE (arg
) == WILDCARD_DECL
)
7766 return convert_wildcard_argument (parm
, arg
);
7768 if (arg
== any_targ_node
)
7771 if (TREE_CODE (arg
) == TREE_LIST
7772 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
7774 /* The template argument was the name of some
7775 member function. That's usually
7776 invalid, but static members are OK. In any
7777 case, grab the underlying fields/functions
7778 and issue an error later if required. */
7779 orig_arg
= TREE_VALUE (arg
);
7780 TREE_TYPE (arg
) = unknown_type_node
;
7785 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
7786 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
7787 || requires_tmpl_type
);
7789 /* When determining whether an argument pack expansion is a template,
7790 look at the pattern. */
7791 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
7792 arg
= PACK_EXPANSION_PATTERN (arg
);
7794 /* Deal with an injected-class-name used as a template template arg. */
7795 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
7797 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
7798 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7800 if (cxx_dialect
>= cxx11
)
7801 /* OK under DR 1004. */;
7802 else if (complain
& tf_warning_or_error
)
7803 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
7804 " used as template template argument", TYPE_NAME (arg
));
7805 else if (flag_pedantic_errors
)
7813 ((TREE_CODE (arg
) == TEMPLATE_DECL
7814 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
7815 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
7816 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7817 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
7820 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7821 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
7822 arg
= TYPE_STUB_DECL (arg
);
7824 is_type
= TYPE_P (arg
) || is_tmpl_type
;
7826 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
7827 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
7829 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
7831 if (complain
& tf_error
)
7832 error ("invalid use of destructor %qE as a type", orig_arg
);
7833 return error_mark_node
;
7836 permerror (input_location
,
7837 "to refer to a type member of a template parameter, "
7838 "use %<typename %E%>", orig_arg
);
7840 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
7841 TREE_OPERAND (arg
, 1),
7847 if (is_type
!= requires_type
)
7851 if (complain
& tf_error
)
7853 error ("type/value mismatch at argument %d in template "
7854 "parameter list for %qD",
7857 inform (input_location
,
7858 " expected a constant of type %qT, got %qT",
7860 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
7861 else if (requires_tmpl_type
)
7862 inform (input_location
,
7863 " expected a class template, got %qE", orig_arg
);
7865 inform (input_location
,
7866 " expected a type, got %qE", orig_arg
);
7869 return error_mark_node
;
7871 if (is_tmpl_type
^ requires_tmpl_type
)
7873 if (in_decl
&& (complain
& tf_error
))
7875 error ("type/value mismatch at argument %d in template "
7876 "parameter list for %qD",
7879 inform (input_location
,
7880 " expected a type, got %qT", DECL_NAME (arg
));
7882 inform (input_location
,
7883 " expected a class template, got %qT", orig_arg
);
7885 return error_mark_node
;
7888 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7889 /* We already did the appropriate conversion when packing args. */
7893 if (requires_tmpl_type
)
7895 if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
7896 /* The number of argument required is not known yet.
7897 Just accept it for now. */
7901 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
7904 /* Strip alias templates that are equivalent to another
7906 arg
= get_underlying_template (arg
);
7907 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
7909 if (coerce_template_template_parms (parmparm
, argparm
,
7915 /* TEMPLATE_TEMPLATE_PARM node is preferred over
7917 if (val
!= error_mark_node
)
7919 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
7920 val
= TREE_TYPE (val
);
7921 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
7922 val
= make_pack_expansion (val
, complain
);
7927 if (in_decl
&& (complain
& tf_error
))
7929 error ("type/value mismatch at argument %d in "
7930 "template parameter list for %qD",
7932 inform (input_location
,
7933 " expected a template of type %qD, got %qT",
7937 val
= error_mark_node
;
7940 // Check that the constraints are compatible before allowing the
7942 if (val
!= error_mark_node
)
7943 if (!is_compatible_template_arg (parm
, arg
))
7945 if (in_decl
&& (complain
& tf_error
))
7947 error ("constraint mismatch at argument %d in "
7948 "template parameter list for %qD",
7950 inform (input_location
, " expected %qD but got %qD",
7953 val
= error_mark_node
;
7959 /* We only form one instance of each template specialization.
7960 Therefore, if we use a non-canonical variant (i.e., a
7961 typedef), any future messages referring to the type will use
7962 the typedef, which is confusing if those future uses do not
7963 themselves also use the typedef. */
7965 val
= canonicalize_type_argument (val
, complain
);
7969 tree t
= TREE_TYPE (parm
);
7971 if (TEMPLATE_PARM_LEVEL (get_template_parm_index (parm
))
7972 > TMPL_ARGS_DEPTH (args
))
7973 /* We don't have enough levels of args to do any substitution. This
7974 can happen in the context of -fnew-ttp-matching. */;
7975 else if (tree a
= type_uses_auto (t
))
7977 t
= do_auto_deduction (t
, arg
, a
, complain
, adc_unify
, args
);
7978 if (t
== error_mark_node
)
7979 return error_mark_node
;
7982 t
= tsubst (t
, args
, complain
, in_decl
);
7984 if (invalid_nontype_parm_type_p (t
, complain
))
7985 return error_mark_node
;
7987 if (!type_dependent_expression_p (orig_arg
)
7988 && !uses_template_parms (t
))
7989 /* We used to call digest_init here. However, digest_init
7990 will report errors, which we don't want when complain
7991 is zero. More importantly, digest_init will try too
7992 hard to convert things: for example, `0' should not be
7993 converted to pointer type at this point according to
7994 the standard. Accepting this is not merely an
7995 extension, since deciding whether or not these
7996 conversions can occur is part of determining which
7997 function template to call, or whether a given explicit
7998 argument specification is valid. */
7999 val
= convert_nontype_argument (t
, orig_arg
, complain
);
8002 val
= canonicalize_expr_argument (orig_arg
, complain
);
8003 val
= maybe_convert_nontype_argument (t
, val
);
8007 if (val
== NULL_TREE
)
8008 val
= error_mark_node
;
8009 else if (val
== error_mark_node
&& (complain
& tf_error
))
8010 error ("could not convert template argument %qE from %qT to %qT",
8011 orig_arg
, TREE_TYPE (orig_arg
), t
);
8013 if (INDIRECT_REF_P (val
))
8015 /* Reject template arguments that are references to built-in
8016 functions with no library fallbacks. */
8017 const_tree inner
= TREE_OPERAND (val
, 0);
8018 const_tree innertype
= TREE_TYPE (inner
);
8020 && TYPE_REF_P (innertype
)
8021 && TREE_CODE (TREE_TYPE (innertype
)) == FUNCTION_TYPE
8022 && TREE_OPERAND_LENGTH (inner
) > 0
8023 && reject_gcc_builtin (TREE_OPERAND (inner
, 0)))
8024 return error_mark_node
;
8027 if (TREE_CODE (val
) == SCOPE_REF
)
8029 /* Strip typedefs from the SCOPE_REF. */
8030 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
8031 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
8033 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
8034 QUALIFIED_NAME_IS_TEMPLATE (val
));
8041 /* Coerces the remaining template arguments in INNER_ARGS (from
8042 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
8043 Returns the coerced argument pack. PARM_IDX is the position of this
8044 parameter in the template parameter list. ARGS is the original
8045 template argument list. */
8047 coerce_template_parameter_pack (tree parms
,
8055 tsubst_flags_t complain
)
8057 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
8058 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
8061 tree packed_parms
= NULL_TREE
;
8063 if (arg_idx
> nargs
)
8066 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
8068 /* When the template parameter is a non-type template parameter pack
8069 or template template parameter pack whose type or template
8070 parameters use parameter packs, we know exactly how many arguments
8071 we are looking for. Build a vector of the instantiated decls for
8072 these template parameters in PACKED_PARMS. */
8073 /* We can't use make_pack_expansion here because it would interpret a
8074 _DECL as a use rather than a declaration. */
8075 tree decl
= TREE_VALUE (parm
);
8076 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
8077 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
8078 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
8079 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
8081 TREE_VEC_LENGTH (args
)--;
8082 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
8083 TREE_VEC_LENGTH (args
)++;
8085 if (packed_parms
== error_mark_node
)
8086 return error_mark_node
;
8088 /* If we're doing a partial instantiation of a member template,
8089 verify that all of the types used for the non-type
8090 template parameter pack are, in fact, valid for non-type
8091 template parameters. */
8093 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
8095 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
8096 for (j
= 0; j
< len
; ++j
)
8098 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
8099 if (invalid_nontype_parm_type_p (t
, complain
))
8100 return error_mark_node
;
8102 /* We don't know how many args we have yet, just
8103 use the unconverted ones for now. */
8107 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
8109 /* Check if we have a placeholder pack, which indicates we're
8110 in the context of a introduction list. In that case we want
8111 to match this pack to the single placeholder. */
8112 else if (arg_idx
< nargs
8113 && TREE_CODE (TREE_VEC_ELT (inner_args
, arg_idx
)) == WILDCARD_DECL
8114 && WILDCARD_PACK_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
8116 nargs
= arg_idx
+ 1;
8117 packed_args
= make_tree_vec (1);
8120 packed_args
= make_tree_vec (nargs
- arg_idx
);
8122 /* Convert the remaining arguments, which will be a part of the
8123 parameter pack "parm". */
8124 int first_pack_arg
= arg_idx
;
8125 for (; arg_idx
< nargs
; ++arg_idx
)
8127 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
8128 tree actual_parm
= TREE_VALUE (parm
);
8129 int pack_idx
= arg_idx
- first_pack_arg
;
8133 /* Once we've packed as many args as we have types, stop. */
8134 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
8136 else if (PACK_EXPANSION_P (arg
))
8137 /* We don't know how many args we have yet, just
8138 use the unconverted ones for now. */
8141 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
8144 if (arg
== error_mark_node
)
8146 if (complain
& tf_error
)
8147 error ("template argument %d is invalid", arg_idx
+ 1);
8150 arg
= convert_template_argument (actual_parm
,
8151 arg
, new_args
, complain
, parm_idx
,
8153 if (arg
== error_mark_node
)
8155 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
8158 if (arg_idx
- first_pack_arg
< TREE_VEC_LENGTH (packed_args
)
8159 && TREE_VEC_LENGTH (packed_args
) > 0)
8161 if (complain
& tf_error
)
8162 error ("wrong number of template arguments (%d, should be %d)",
8163 arg_idx
- first_pack_arg
, TREE_VEC_LENGTH (packed_args
));
8164 return error_mark_node
;
8167 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
8168 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
8169 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
8172 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
8173 TREE_CONSTANT (argument_pack
) = 1;
8176 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
8178 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
8179 TREE_VEC_LENGTH (packed_args
));
8180 return argument_pack
;
8183 /* Returns the number of pack expansions in the template argument vector
8187 pack_expansion_args_count (tree args
)
8192 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
8194 tree elt
= TREE_VEC_ELT (args
, i
);
8195 if (elt
&& PACK_EXPANSION_P (elt
))
8201 /* Convert all template arguments to their appropriate types, and
8202 return a vector containing the innermost resulting template
8203 arguments. If any error occurs, return error_mark_node. Error and
8204 warning messages are issued under control of COMPLAIN.
8206 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
8207 for arguments not specified in ARGS. Otherwise, if
8208 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
8209 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
8210 USE_DEFAULT_ARGS is false, then all arguments must be specified in
8214 coerce_template_parms (tree parms
,
8217 tsubst_flags_t complain
,
8218 bool require_all_args
,
8219 bool use_default_args
)
8221 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
8222 tree orig_inner_args
;
8225 tree new_inner_args
;
8226 int saved_unevaluated_operand
;
8227 int saved_inhibit_evaluation_warnings
;
8229 /* When used as a boolean value, indicates whether this is a
8230 variadic template parameter list. Since it's an int, we can also
8231 subtract it from nparms to get the number of non-variadic
8234 int variadic_args_p
= 0;
8235 int post_variadic_parms
= 0;
8237 /* Adjustment to nparms for fixed parameter packs. */
8238 int fixed_pack_adjust
= 0;
8239 int fixed_packs
= 0;
8242 /* Likewise for parameters with default arguments. */
8245 if (args
== error_mark_node
)
8246 return error_mark_node
;
8248 nparms
= TREE_VEC_LENGTH (parms
);
8250 /* Determine if there are any parameter packs or default arguments. */
8251 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
8253 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
8255 ++post_variadic_parms
;
8256 if (template_parameter_pack_p (TREE_VALUE (parm
)))
8258 if (TREE_PURPOSE (parm
))
8262 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
8263 /* If there are no parameters that follow a parameter pack, we need to
8264 expand any argument packs so that we can deduce a parameter pack from
8265 some non-packed args followed by an argument pack, as in variadic85.C.
8266 If there are such parameters, we need to leave argument packs intact
8267 so the arguments are assigned properly. This can happen when dealing
8268 with a nested class inside a partial specialization of a class
8269 template, as in variadic92.C, or when deducing a template parameter pack
8270 from a sub-declarator, as in variadic114.C. */
8271 if (!post_variadic_parms
)
8272 inner_args
= expand_template_argument_pack (inner_args
);
8274 /* Count any pack expansion args. */
8275 variadic_args_p
= pack_expansion_args_count (inner_args
);
8277 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
8278 if ((nargs
- variadic_args_p
> nparms
&& !variadic_p
)
8279 || (nargs
< nparms
- variadic_p
8282 && (!use_default_args
8283 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
8284 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
8287 if (complain
& tf_error
)
8289 if (variadic_p
|| default_p
)
8291 nparms
-= variadic_p
+ default_p
;
8292 error ("wrong number of template arguments "
8293 "(%d, should be at least %d)", nargs
, nparms
);
8296 error ("wrong number of template arguments "
8297 "(%d, should be %d)", nargs
, nparms
);
8300 inform (DECL_SOURCE_LOCATION (in_decl
),
8301 "provided for %qD", in_decl
);
8304 return error_mark_node
;
8306 /* We can't pass a pack expansion to a non-pack parameter of an alias
8307 template (DR 1430). */
8309 && (DECL_ALIAS_TEMPLATE_P (in_decl
)
8310 || concept_template_p (in_decl
))
8312 && nargs
- variadic_args_p
< nparms
- variadic_p
)
8314 if (complain
& tf_error
)
8316 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
8318 tree arg
= TREE_VEC_ELT (inner_args
, i
);
8319 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
8321 if (PACK_EXPANSION_P (arg
)
8322 && !template_parameter_pack_p (parm
))
8324 if (DECL_ALIAS_TEMPLATE_P (in_decl
))
8325 error_at (location_of (arg
),
8326 "pack expansion argument for non-pack parameter "
8327 "%qD of alias template %qD", parm
, in_decl
);
8329 error_at (location_of (arg
),
8330 "pack expansion argument for non-pack parameter "
8331 "%qD of concept %qD", parm
, in_decl
);
8332 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
8339 return error_mark_node
;
8342 /* We need to evaluate the template arguments, even though this
8343 template-id may be nested within a "sizeof". */
8344 saved_unevaluated_operand
= cp_unevaluated_operand
;
8345 cp_unevaluated_operand
= 0;
8346 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
8347 c_inhibit_evaluation_warnings
= 0;
8348 new_inner_args
= make_tree_vec (nparms
);
8349 new_args
= add_outermost_template_args (args
, new_inner_args
);
8350 int pack_adjust
= 0;
8351 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
8356 /* Get the Ith template parameter. */
8357 parm
= TREE_VEC_ELT (parms
, parm_idx
);
8359 if (parm
== error_mark_node
)
8361 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
8365 /* Calculate the next argument. */
8366 if (arg_idx
< nargs
)
8367 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
8371 if (template_parameter_pack_p (TREE_VALUE (parm
))
8372 && !(arg
&& ARGUMENT_PACK_P (arg
)))
8374 /* Some arguments will be placed in the
8375 template parameter pack PARM. */
8376 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
8377 inner_args
, arg_idx
,
8381 if (arg
== NULL_TREE
)
8383 /* We don't know how many args we have yet, just use the
8384 unconverted (and still packed) ones for now. */
8385 new_inner_args
= orig_inner_args
;
8390 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
8392 /* Store this argument. */
8393 if (arg
== error_mark_node
)
8396 /* We are done with all of the arguments. */
8402 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
8403 arg_idx
+= pack_adjust
;
8404 if (fixed_parameter_pack_p (TREE_VALUE (parm
)))
8407 fixed_pack_adjust
+= pack_adjust
;
8415 if (PACK_EXPANSION_P (arg
))
8417 /* "If every valid specialization of a variadic template
8418 requires an empty template parameter pack, the template is
8419 ill-formed, no diagnostic required." So check that the
8420 pattern works with this parameter. */
8421 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
8422 tree conv
= convert_template_argument (TREE_VALUE (parm
),
8426 if (conv
== error_mark_node
)
8428 if (complain
& tf_error
)
8429 inform (input_location
, "so any instantiation with a "
8430 "non-empty parameter pack would be ill-formed");
8433 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
8434 /* Recover from missing typename. */
8435 TREE_VEC_ELT (inner_args
, arg_idx
)
8436 = make_pack_expansion (conv
, complain
);
8438 /* We don't know how many args we have yet, just
8439 use the unconverted ones for now. */
8440 new_inner_args
= inner_args
;
8445 else if (require_all_args
)
8447 /* There must be a default arg in this case. */
8448 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
8450 /* The position of the first default template argument,
8451 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
8453 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
8454 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
8455 arg_idx
- pack_adjust
);
8460 if (arg
== error_mark_node
)
8462 if (complain
& tf_error
)
8463 error ("template argument %d is invalid", arg_idx
+ 1);
8467 /* This can occur if there was an error in the template
8468 parameter list itself (which we would already have
8469 reported) that we are trying to recover from, e.g., a class
8470 template with a parameter list such as
8471 template<typename..., typename> (cpp0x/variadic150.C). */
8474 /* This can also happen with a fixed parameter pack (71834). */
8475 if (arg_idx
>= nargs
)
8479 arg
= convert_template_argument (TREE_VALUE (parm
),
8480 arg
, new_args
, complain
,
8483 if (arg
== error_mark_node
)
8485 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
8487 cp_unevaluated_operand
= saved_unevaluated_operand
;
8488 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
8490 if (missing
|| arg_idx
< nargs
- variadic_args_p
)
8492 /* If we had fixed parameter packs, we didn't know how many arguments we
8493 actually needed earlier; now we do. */
8494 nparms
+= fixed_pack_adjust
;
8495 variadic_p
-= fixed_packs
;
8499 if (arg_idx
< nargs
)
8501 /* We had some pack expansion arguments that will only work if the packs
8502 are empty, but wait until instantiation time to complain.
8503 See variadic-ttp3.C. */
8504 int len
= nparms
+ (nargs
- arg_idx
);
8505 tree args
= make_tree_vec (len
);
8507 for (; i
< nparms
; ++i
)
8508 TREE_VEC_ELT (args
, i
) = TREE_VEC_ELT (new_inner_args
, i
);
8509 for (; i
< len
; ++i
, ++arg_idx
)
8510 TREE_VEC_ELT (args
, i
) = TREE_VEC_ELT (inner_args
,
8511 arg_idx
- pack_adjust
);
8512 new_inner_args
= args
;
8517 gcc_assert (!(complain
& tf_error
) || seen_error ());
8518 return error_mark_node
;
8521 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
8522 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
8523 TREE_VEC_LENGTH (new_inner_args
));
8525 return new_inner_args
;
8528 /* Convert all template arguments to their appropriate types, and
8529 return a vector containing the innermost resulting template
8530 arguments. If any error occurs, return error_mark_node. Error and
8531 warning messages are not issued.
8533 Note that no function argument deduction is performed, and default
8534 arguments are used to fill in unspecified arguments. */
8536 coerce_template_parms (tree parms
, tree args
, tree in_decl
)
8538 return coerce_template_parms (parms
, args
, in_decl
, tf_none
, true, true);
8541 /* Convert all template arguments to their appropriate type, and
8542 instantiate default arguments as needed. This returns a vector
8543 containing the innermost resulting template arguments, or
8544 error_mark_node if unsuccessful. */
8546 coerce_template_parms (tree parms
, tree args
, tree in_decl
,
8547 tsubst_flags_t complain
)
8549 return coerce_template_parms (parms
, args
, in_decl
, complain
, true, true);
8552 /* Like coerce_template_parms. If PARMS represents all template
8553 parameters levels, this function returns a vector of vectors
8554 representing all the resulting argument levels. Note that in this
8555 case, only the innermost arguments are coerced because the
8556 outermost ones are supposed to have been coerced already.
8558 Otherwise, if PARMS represents only (the innermost) vector of
8559 parameters, this function returns a vector containing just the
8560 innermost resulting arguments. */
8563 coerce_innermost_template_parms (tree parms
,
8566 tsubst_flags_t complain
,
8567 bool require_all_args
,
8568 bool use_default_args
)
8570 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
8571 int args_depth
= TMPL_ARGS_DEPTH (args
);
8574 if (parms_depth
> 1)
8576 coerced_args
= make_tree_vec (parms_depth
);
8580 for (level
= parms
, cur_depth
= parms_depth
;
8581 parms_depth
> 0 && level
!= NULL_TREE
;
8582 level
= TREE_CHAIN (level
), --cur_depth
)
8585 if (cur_depth
== args_depth
)
8586 l
= coerce_template_parms (TREE_VALUE (level
),
8587 args
, in_decl
, complain
,
8591 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
8593 if (l
== error_mark_node
)
8594 return error_mark_node
;
8596 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
8600 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
8601 args
, in_decl
, complain
,
8604 return coerced_args
;
8607 /* Returns 1 if template args OT and NT are equivalent. */
8610 template_args_equal (tree ot
, tree nt
, bool partial_order
/* = false */)
8614 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
8616 if (nt
== any_targ_node
|| ot
== any_targ_node
)
8619 if (TREE_CODE (nt
) == TREE_VEC
)
8620 /* For member templates */
8621 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
8622 else if (PACK_EXPANSION_P (ot
))
8623 return (PACK_EXPANSION_P (nt
)
8624 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
8625 PACK_EXPANSION_PATTERN (nt
))
8626 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
8627 PACK_EXPANSION_EXTRA_ARGS (nt
)));
8628 else if (ARGUMENT_PACK_P (ot
))
8633 if (!ARGUMENT_PACK_P (nt
))
8636 opack
= ARGUMENT_PACK_ARGS (ot
);
8637 npack
= ARGUMENT_PACK_ARGS (nt
);
8638 len
= TREE_VEC_LENGTH (opack
);
8639 if (TREE_VEC_LENGTH (npack
) != len
)
8641 for (i
= 0; i
< len
; ++i
)
8642 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
8643 TREE_VEC_ELT (npack
, i
)))
8647 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
8649 else if (TYPE_P (nt
))
8653 /* Don't treat an alias template specialization with dependent
8654 arguments as equivalent to its underlying type when used as a
8655 template argument; we need them to be distinct so that we
8656 substitute into the specialization arguments at instantiation
8657 time. And aliases can't be equivalent without being ==, so
8658 we don't need to look any deeper.
8660 During partial ordering, however, we need to treat them normally so
8661 that we can order uses of the same alias with different
8662 cv-qualification (79960). */
8664 && (TYPE_ALIAS_P (nt
) || TYPE_ALIAS_P (ot
)))
8667 return same_type_p (ot
, nt
);
8669 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
8673 /* Try to treat a template non-type argument that has been converted
8674 to the parameter type as equivalent to one that hasn't yet. */
8675 for (enum tree_code code1
= TREE_CODE (ot
);
8676 CONVERT_EXPR_CODE_P (code1
)
8677 || code1
== NON_LVALUE_EXPR
;
8678 code1
= TREE_CODE (ot
))
8679 ot
= TREE_OPERAND (ot
, 0);
8680 for (enum tree_code code2
= TREE_CODE (nt
);
8681 CONVERT_EXPR_CODE_P (code2
)
8682 || code2
== NON_LVALUE_EXPR
;
8683 code2
= TREE_CODE (nt
))
8684 nt
= TREE_OPERAND (nt
, 0);
8686 return cp_tree_equal (ot
, nt
);
8690 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
8691 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
8692 NEWARG_PTR with the offending arguments if they are non-NULL. */
8695 comp_template_args (tree oldargs
, tree newargs
,
8696 tree
*oldarg_ptr
, tree
*newarg_ptr
,
8701 if (oldargs
== newargs
)
8704 if (!oldargs
|| !newargs
)
8707 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
8710 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
8712 tree nt
= TREE_VEC_ELT (newargs
, i
);
8713 tree ot
= TREE_VEC_ELT (oldargs
, i
);
8715 if (! template_args_equal (ot
, nt
, partial_order
))
8717 if (oldarg_ptr
!= NULL
)
8719 if (newarg_ptr
!= NULL
)
8728 comp_template_args_porder (tree oargs
, tree nargs
)
8730 return comp_template_args (oargs
, nargs
, NULL
, NULL
, true);
8733 /* Implement a freelist interface for objects of type T.
8735 Head is a separate object, rather than a regular member, so that we
8736 can define it as a GTY deletable pointer, which is highly
8737 desirable. A data member could be declared that way, but then the
8738 containing object would implicitly get GTY((user)), which would
8739 prevent us from instantiating freelists as global objects.
8740 Although this way we can create freelist global objects, they're
8741 such thin wrappers that instantiating temporaries at every use
8742 loses nothing and saves permanent storage for the freelist object.
8744 Member functions next, anew, poison and reinit have default
8745 implementations that work for most of the types we're interested
8746 in, but if they don't work for some type, they should be explicitly
8747 specialized. See the comments before them for requirements, and
8748 the example specializations for the tree_list_freelist. */
8749 template <typename T
>
8752 /* Return the next object in a chain. We could just do type
8753 punning, but if we access the object with its underlying type, we
8754 avoid strict-aliasing trouble. This needs only work between
8755 poison and reinit. */
8756 static T
*&next (T
*obj
) { return obj
->next
; }
8758 /* Return a newly allocated, uninitialized or minimally-initialized
8759 object of type T. Any initialization performed by anew should
8760 either remain across the life of the object and the execution of
8761 poison, or be redone by reinit. */
8762 static T
*anew () { return ggc_alloc
<T
> (); }
8764 /* Optionally scribble all over the bits holding the object, so that
8765 they become (mostly?) uninitialized memory. This is called while
8766 preparing to make the object part of the free list. */
8767 static void poison (T
*obj
) {
8768 T
*p ATTRIBUTE_UNUSED
= obj
;
8769 T
**q ATTRIBUTE_UNUSED
= &next (obj
);
8771 #ifdef ENABLE_GC_CHECKING
8772 /* Poison the data, to indicate the data is garbage. */
8773 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (p
, sizeof (*p
)));
8774 memset (p
, 0xa5, sizeof (*p
));
8776 /* Let valgrind know the object is free. */
8777 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_NOACCESS (p
, sizeof (*p
)));
8779 /* Let valgrind know the next portion of the object is available,
8780 but uninitialized. */
8781 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (q
, sizeof (*q
)));
8784 /* Bring an object that underwent at least one lifecycle after anew
8785 and before the most recent free and poison, back to a usable
8786 state, reinitializing whatever is needed for it to be
8787 functionally equivalent to an object just allocated and returned
8788 by anew. This may poison or clear the next field, used by
8789 freelist housekeeping after poison was called. */
8790 static void reinit (T
*obj
) {
8791 T
**q ATTRIBUTE_UNUSED
= &next (obj
);
8793 #ifdef ENABLE_GC_CHECKING
8794 memset (q
, 0xa5, sizeof (*q
));
8796 /* Let valgrind know the entire object is available, but
8798 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (obj
, sizeof (*obj
)));
8801 /* Reference a GTY-deletable pointer that points to the first object
8802 in the free list proper. */
8805 /* Construct a freelist object chaining objects off of HEAD. */
8806 freelist (T
*&head
) : head(head
) {}
8808 /* Add OBJ to the free object list. The former head becomes OBJ's
8817 /* Take an object from the free list, if one is available, or
8818 allocate a new one. Objects taken from the free list should be
8819 regarded as filled with garbage, except for bits that are
8820 configured to be preserved across free and alloc. */
8835 /* Explicitly specialize the interfaces for freelist<tree_node>: we
8836 want to allocate a TREE_LIST using the usual interface, and ensure
8837 TREE_CHAIN remains functional. Alas, we have to duplicate a bit of
8838 build_tree_list logic in reinit, so this could go out of sync. */
8841 freelist
<tree_node
>::next (tree obj
)
8843 return TREE_CHAIN (obj
);
8847 freelist
<tree_node
>::anew ()
8849 return build_tree_list (NULL
, NULL
);
8853 freelist
<tree_node
>::poison (tree obj ATTRIBUTE_UNUSED
)
8855 int size ATTRIBUTE_UNUSED
= sizeof (tree_list
);
8856 tree p ATTRIBUTE_UNUSED
= obj
;
8857 tree_base
*b ATTRIBUTE_UNUSED
= &obj
->base
;
8858 tree
*q ATTRIBUTE_UNUSED
= &next (obj
);
8860 #ifdef ENABLE_GC_CHECKING
8861 gcc_checking_assert (TREE_CODE (obj
) == TREE_LIST
);
8863 /* Poison the data, to indicate the data is garbage. */
8864 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (p
, size
));
8865 memset (p
, 0xa5, size
);
8867 /* Let valgrind know the object is free. */
8868 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_NOACCESS (p
, size
));
8869 /* But we still want to use the TREE_CODE and TREE_CHAIN parts. */
8870 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_DEFINED (b
, sizeof (*b
)));
8871 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (q
, sizeof (*q
)));
8873 #ifdef ENABLE_GC_CHECKING
8874 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (b
, sizeof (*b
)));
8875 /* Keep TREE_CHAIN functional. */
8876 TREE_SET_CODE (obj
, TREE_LIST
);
8878 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_DEFINED (b
, sizeof (*b
)));
8883 freelist
<tree_node
>::reinit (tree obj ATTRIBUTE_UNUSED
)
8885 tree_base
*b ATTRIBUTE_UNUSED
= &obj
->base
;
8887 #ifdef ENABLE_GC_CHECKING
8888 gcc_checking_assert (TREE_CODE (obj
) == TREE_LIST
);
8889 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (obj
, sizeof (tree_list
)));
8890 memset (obj
, 0, sizeof (tree_list
));
8893 /* Let valgrind know the entire object is available, but
8895 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (obj
, sizeof (tree_list
)));
8897 #ifdef ENABLE_GC_CHECKING
8898 TREE_SET_CODE (obj
, TREE_LIST
);
8900 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_DEFINED (b
, sizeof (*b
)));
8904 /* Point to the first object in the TREE_LIST freelist. */
8905 static GTY((deletable
)) tree tree_list_freelist_head
;
8906 /* Return the/an actual TREE_LIST freelist. */
8907 static inline freelist
<tree_node
>
8908 tree_list_freelist ()
8910 return tree_list_freelist_head
;
8913 /* Point to the first object in the tinst_level freelist. */
8914 static GTY((deletable
)) tinst_level
*tinst_level_freelist_head
;
8915 /* Return the/an actual tinst_level freelist. */
8916 static inline freelist
<tinst_level
>
8917 tinst_level_freelist ()
8919 return tinst_level_freelist_head
;
8922 /* Point to the first object in the pending_template freelist. */
8923 static GTY((deletable
)) pending_template
*pending_template_freelist_head
;
8924 /* Return the/an actual pending_template freelist. */
8925 static inline freelist
<pending_template
>
8926 pending_template_freelist ()
8928 return pending_template_freelist_head
;
8931 /* Build the TREE_LIST object out of a split list, store it
8932 permanently, and return it. */
8934 tinst_level::to_list ()
8936 gcc_assert (split_list_p ());
8937 tree ret
= tree_list_freelist ().alloc ();
8938 TREE_PURPOSE (ret
) = tldcl
;
8939 TREE_VALUE (ret
) = targs
;
8942 gcc_assert (tree_list_p ());
8946 const unsigned short tinst_level::refcount_infinity
;
8948 /* Increment OBJ's refcount unless it is already infinite. */
8949 static tinst_level
*
8950 inc_refcount_use (tinst_level
*obj
)
8952 if (obj
&& obj
->refcount
!= tinst_level::refcount_infinity
)
8957 /* Release storage for OBJ and node, if it's a TREE_LIST. */
8959 tinst_level::free (tinst_level
*obj
)
8961 if (obj
->tree_list_p ())
8962 tree_list_freelist ().free (obj
->get_node ());
8963 tinst_level_freelist ().free (obj
);
8966 /* Decrement OBJ's refcount if not infinite. If it reaches zero, release
8967 OBJ's DECL and OBJ, and start over with the tinst_level object that
8968 used to be referenced by OBJ's NEXT. */
8970 dec_refcount_use (tinst_level
*obj
)
8973 && obj
->refcount
!= tinst_level::refcount_infinity
8974 && !--obj
->refcount
)
8976 tinst_level
*next
= obj
->next
;
8977 tinst_level::free (obj
);
8982 /* Modify PTR so that it points to OBJ, adjusting the refcounts of OBJ
8983 and of the former PTR. Omitting the second argument is equivalent
8984 to passing (T*)NULL; this is allowed because passing the
8985 zero-valued integral constant NULL confuses type deduction and/or
8986 overload resolution. */
8987 template <typename T
>
8989 set_refcount_ptr (T
*& ptr
, T
*obj
= NULL
)
8992 ptr
= inc_refcount_use (obj
);
8993 dec_refcount_use (save
);
8997 add_pending_template (tree d
)
8999 tree ti
= (TYPE_P (d
)
9000 ? CLASSTYPE_TEMPLATE_INFO (d
)
9001 : DECL_TEMPLATE_INFO (d
));
9002 struct pending_template
*pt
;
9005 if (TI_PENDING_TEMPLATE_FLAG (ti
))
9008 /* We are called both from instantiate_decl, where we've already had a
9009 tinst_level pushed, and instantiate_template, where we haven't.
9011 gcc_assert (TREE_CODE (d
) != TREE_LIST
);
9012 level
= !current_tinst_level
9013 || current_tinst_level
->maybe_get_node () != d
;
9016 push_tinst_level (d
);
9018 pt
= pending_template_freelist ().alloc ();
9021 set_refcount_ptr (pt
->tinst
, current_tinst_level
);
9022 if (last_pending_template
)
9023 last_pending_template
->next
= pt
;
9025 pending_templates
= pt
;
9027 last_pending_template
= pt
;
9029 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
9036 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
9037 ARGLIST. Valid choices for FNS are given in the cp-tree.def
9038 documentation for TEMPLATE_ID_EXPR. */
9041 lookup_template_function (tree fns
, tree arglist
)
9045 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
9046 return error_mark_node
;
9048 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
9050 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
9052 error ("%q#D is not a function template", fns
);
9053 return error_mark_node
;
9056 if (BASELINK_P (fns
))
9058 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
9060 BASELINK_FUNCTIONS (fns
),
9065 type
= TREE_TYPE (fns
);
9066 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
9067 type
= unknown_type_node
;
9069 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
9072 /* Within the scope of a template class S<T>, the name S gets bound
9073 (in build_self_reference) to a TYPE_DECL for the class, not a
9074 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
9075 or one of its enclosing classes, and that type is a template,
9076 return the associated TEMPLATE_DECL. Otherwise, the original
9079 Also handle the case when DECL is a TREE_LIST of ambiguous
9080 injected-class-names from different bases. */
9083 maybe_get_template_decl_from_type_decl (tree decl
)
9085 if (decl
== NULL_TREE
)
9088 /* DR 176: A lookup that finds an injected-class-name (10.2
9089 [class.member.lookup]) can result in an ambiguity in certain cases
9090 (for example, if it is found in more than one base class). If all of
9091 the injected-class-names that are found refer to specializations of
9092 the same class template, and if the name is followed by a
9093 template-argument-list, the reference refers to the class template
9094 itself and not a specialization thereof, and is not ambiguous. */
9095 if (TREE_CODE (decl
) == TREE_LIST
)
9097 tree t
, tmpl
= NULL_TREE
;
9098 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
9100 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
9103 else if (tmpl
!= elt
)
9106 if (tmpl
&& t
== NULL_TREE
)
9112 return (decl
!= NULL_TREE
9113 && DECL_SELF_REFERENCE_P (decl
)
9114 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
9115 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
9118 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
9119 parameters, find the desired type.
9121 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
9123 IN_DECL, if non-NULL, is the template declaration we are trying to
9126 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
9127 the class we are looking up.
9129 Issue error and warning messages under control of COMPLAIN.
9131 If the template class is really a local class in a template
9132 function, then the FUNCTION_CONTEXT is the function in which it is
9135 ??? Note that this function is currently called *twice* for each
9136 template-id: the first time from the parser, while creating the
9137 incomplete type (finish_template_type), and the second type during the
9138 real instantiation (instantiate_template_class). This is surely something
9139 that we want to avoid. It also causes some problems with argument
9140 coercion (see convert_nontype_argument for more information on this). */
9143 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
9144 int entering_scope
, tsubst_flags_t complain
)
9146 tree templ
= NULL_TREE
, parmlist
;
9153 if (identifier_p (d1
))
9155 tree value
= innermost_non_namespace_value (d1
);
9156 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
9161 push_decl_namespace (context
);
9162 templ
= lookup_name (d1
);
9163 templ
= maybe_get_template_decl_from_type_decl (templ
);
9165 pop_decl_namespace ();
9168 context
= DECL_CONTEXT (templ
);
9170 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
9172 tree type
= TREE_TYPE (d1
);
9174 /* If we are declaring a constructor, say A<T>::A<T>, we will get
9175 an implicit typename for the second A. Deal with it. */
9176 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
9177 type
= TREE_TYPE (type
);
9179 if (CLASSTYPE_TEMPLATE_INFO (type
))
9181 templ
= CLASSTYPE_TI_TEMPLATE (type
);
9182 d1
= DECL_NAME (templ
);
9185 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
9186 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
9188 templ
= TYPE_TI_TEMPLATE (d1
);
9189 d1
= DECL_NAME (templ
);
9191 else if (DECL_TYPE_TEMPLATE_P (d1
))
9194 d1
= DECL_NAME (templ
);
9195 context
= DECL_CONTEXT (templ
);
9197 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
9200 d1
= DECL_NAME (templ
);
9203 /* Issue an error message if we didn't find a template. */
9206 if (complain
& tf_error
)
9207 error ("%qT is not a template", d1
);
9208 return error_mark_node
;
9211 if (TREE_CODE (templ
) != TEMPLATE_DECL
9212 /* Make sure it's a user visible template, if it was named by
9214 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
9215 && !PRIMARY_TEMPLATE_P (templ
)))
9217 if (complain
& tf_error
)
9219 error ("non-template type %qT used as a template", d1
);
9221 error ("for template declaration %q+D", in_decl
);
9223 return error_mark_node
;
9226 complain
&= ~tf_user
;
9228 /* An alias that just changes the name of a template is equivalent to the
9229 other template, so if any of the arguments are pack expansions, strip
9230 the alias to avoid problems with a pack expansion passed to a non-pack
9231 alias template parameter (DR 1430). */
9232 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
9233 templ
= get_underlying_template (templ
);
9235 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
9238 tree arglist2
= coerce_template_args_for_ttp (templ
, arglist
, complain
);
9239 if (arglist2
== error_mark_node
9240 || (!uses_template_parms (arglist2
)
9241 && check_instantiated_args (templ
, arglist2
, complain
)))
9242 return error_mark_node
;
9244 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
9249 tree template_type
= TREE_TYPE (templ
);
9252 tree found
= NULL_TREE
;
9255 int is_dependent_type
;
9256 int use_partial_inst_tmpl
= false;
9258 if (template_type
== error_mark_node
)
9259 /* An error occurred while building the template TEMPL, and a
9260 diagnostic has most certainly been emitted for that
9261 already. Let's propagate that error. */
9262 return error_mark_node
;
9264 gen_tmpl
= most_general_template (templ
);
9265 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
9266 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
9267 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
9269 if (arg_depth
== 1 && parm_depth
> 1)
9271 /* We've been given an incomplete set of template arguments.
9274 template <class T> struct S1 {
9275 template <class U> struct S2 {};
9276 template <class U> struct S2<U*> {};
9279 we will be called with an ARGLIST of `U*', but the
9280 TEMPLATE will be `template <class T> template
9281 <class U> struct S1<T>::S2'. We must fill in the missing
9283 tree ti
= TYPE_TEMPLATE_INFO_MAYBE_ALIAS (TREE_TYPE (templ
));
9284 arglist
= add_outermost_template_args (TI_ARGS (ti
), arglist
);
9285 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
9288 /* Now we should have enough arguments. */
9289 gcc_assert (parm_depth
== arg_depth
);
9291 /* From here on, we're only interested in the most general
9294 /* Calculate the BOUND_ARGS. These will be the args that are
9295 actually tsubst'd into the definition to create the
9297 arglist
= coerce_innermost_template_parms (parmlist
, arglist
, gen_tmpl
,
9299 /*require_all_args=*/true,
9300 /*use_default_args=*/true);
9302 if (arglist
== error_mark_node
)
9303 /* We were unable to bind the arguments. */
9304 return error_mark_node
;
9306 /* In the scope of a template class, explicit references to the
9307 template class refer to the type of the template, not any
9308 instantiation of it. For example, in:
9310 template <class T> class C { void f(C<T>); }
9312 the `C<T>' is just the same as `C'. Outside of the
9313 class, however, such a reference is an instantiation. */
9315 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
9316 || currently_open_class (template_type
))
9318 tree tinfo
= TYPE_TEMPLATE_INFO (template_type
);
9320 if (tinfo
&& comp_template_args (TI_ARGS (tinfo
), arglist
))
9321 return template_type
;
9324 /* If we already have this specialization, return it. */
9325 elt
.tmpl
= gen_tmpl
;
9327 elt
.spec
= NULL_TREE
;
9328 hash
= spec_hasher::hash (&elt
);
9329 entry
= type_specializations
->find_with_hash (&elt
, hash
);
9334 /* If the the template's constraints are not satisfied,
9335 then we cannot form a valid type.
9337 Note that the check is deferred until after the hash
9338 lookup. This prevents redundant checks on previously
9339 instantiated specializations. */
9340 if (flag_concepts
&& !constraints_satisfied_p (gen_tmpl
, arglist
))
9342 if (complain
& tf_error
)
9344 error ("template constraint failure");
9345 diagnose_constraints (input_location
, gen_tmpl
, arglist
);
9347 return error_mark_node
;
9350 is_dependent_type
= uses_template_parms (arglist
);
9352 /* If the deduced arguments are invalid, then the binding
9354 if (!is_dependent_type
9355 && check_instantiated_args (gen_tmpl
,
9356 INNERMOST_TEMPLATE_ARGS (arglist
),
9358 return error_mark_node
;
9360 if (!is_dependent_type
9361 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
9362 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
9363 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
9365 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
9366 DECL_NAME (gen_tmpl
),
9367 /*tag_scope=*/ts_global
);
9371 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
9373 if (context
== error_mark_node
)
9374 return error_mark_node
;
9377 context
= global_namespace
;
9379 /* Create the type. */
9380 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
9382 /* The user referred to a specialization of an alias
9383 template represented by GEN_TMPL.
9385 [temp.alias]/2 says:
9387 When a template-id refers to the specialization of an
9388 alias template, it is equivalent to the associated
9389 type obtained by substitution of its
9390 template-arguments for the template-parameters in the
9391 type-id of the alias template. */
9393 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
9394 /* Note that the call above (by indirectly calling
9395 register_specialization in tsubst_decl) registers the
9396 TYPE_DECL representing the specialization of the alias
9397 template. So next time someone substitutes ARGLIST for
9398 the template parms into the alias template (GEN_TMPL),
9399 she'll get that TYPE_DECL back. */
9401 if (t
== error_mark_node
)
9404 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
9406 if (!is_dependent_type
)
9408 set_current_access_from_decl (TYPE_NAME (template_type
));
9409 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
9410 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
9411 arglist
, complain
, in_decl
),
9412 tsubst_attributes (TYPE_ATTRIBUTES (template_type
),
9413 arglist
, complain
, in_decl
),
9414 SCOPED_ENUM_P (template_type
), NULL
);
9416 if (t
== error_mark_node
)
9421 /* We don't want to call start_enum for this type, since
9422 the values for the enumeration constants may involve
9423 template parameters. And, no one should be interested
9424 in the enumeration constants for such a type. */
9425 t
= cxx_make_type (ENUMERAL_TYPE
);
9426 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
9428 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
9429 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
9430 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
9432 else if (CLASS_TYPE_P (template_type
))
9434 /* Lambda closures are regenerated in tsubst_lambda_expr, not
9435 instantiated here. */
9436 gcc_assert (!LAMBDA_TYPE_P (template_type
));
9438 t
= make_class_type (TREE_CODE (template_type
));
9439 CLASSTYPE_DECLARED_CLASS (t
)
9440 = CLASSTYPE_DECLARED_CLASS (template_type
);
9441 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
9443 /* A local class. Make sure the decl gets registered properly. */
9444 if (context
== current_function_decl
)
9445 if (pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
)
9447 return error_mark_node
;
9449 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
9450 /* This instantiation is another name for the primary
9451 template type. Set the TYPE_CANONICAL field
9453 TYPE_CANONICAL (t
) = template_type
;
9454 else if (any_template_arguments_need_structural_equality_p (arglist
))
9455 /* Some of the template arguments require structural
9456 equality testing, so this template class requires
9457 structural equality testing. */
9458 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9463 /* If we called start_enum or pushtag above, this information
9464 will already be set up. */
9467 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
9469 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
9470 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
9471 DECL_SOURCE_LOCATION (type_decl
)
9472 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
9475 type_decl
= TYPE_NAME (t
);
9477 if (CLASS_TYPE_P (template_type
))
9479 TREE_PRIVATE (type_decl
)
9480 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
9481 TREE_PROTECTED (type_decl
)
9482 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
9483 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
9485 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
9486 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
9490 if (OVERLOAD_TYPE_P (t
)
9491 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
9493 static const char *tags
[] = {"abi_tag", "may_alias"};
9495 for (unsigned ix
= 0; ix
!= 2; ix
++)
9498 = lookup_attribute (tags
[ix
], TYPE_ATTRIBUTES (template_type
));
9502 = tree_cons (TREE_PURPOSE (attributes
),
9503 TREE_VALUE (attributes
),
9504 TYPE_ATTRIBUTES (t
));
9508 /* Let's consider the explicit specialization of a member
9509 of a class template specialization that is implicitly instantiated,
9514 template<class U> struct M {}; //#0
9519 struct S<int>::M<char> //#1
9523 [temp.expl.spec]/4 says this is valid.
9525 In this case, when we write:
9528 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
9531 When we encounter #1, we want to store the partial instantiation
9532 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
9534 For all cases other than this "explicit specialization of member of a
9535 class template", we just want to store the most general template into
9536 the CLASSTYPE_TI_TEMPLATE of M.
9538 This case of "explicit specialization of member of a class template"
9540 1/ the enclosing class is an instantiation of, and therefore not
9541 the same as, the context of the most general template, and
9542 2/ we aren't looking at the partial instantiation itself, i.e.
9543 the innermost arguments are not the same as the innermost parms of
9544 the most general template.
9546 So it's only when 1/ and 2/ happens that we want to use the partial
9547 instantiation of the member template in lieu of its most general
9550 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
9551 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
9552 /* the enclosing class must be an instantiation... */
9553 && CLASS_TYPE_P (context
)
9554 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
9556 TREE_VEC_LENGTH (arglist
)--;
9557 ++processing_template_decl
;
9558 tree tinfo
= TYPE_TEMPLATE_INFO_MAYBE_ALIAS (TREE_TYPE (gen_tmpl
));
9559 tree partial_inst_args
=
9560 tsubst (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
)),
9561 arglist
, complain
, NULL_TREE
);
9562 --processing_template_decl
;
9563 TREE_VEC_LENGTH (arglist
)++;
9564 if (partial_inst_args
== error_mark_node
)
9565 return error_mark_node
;
9566 use_partial_inst_tmpl
=
9567 /*...and we must not be looking at the partial instantiation
9569 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
9573 if (!use_partial_inst_tmpl
)
9574 /* This case is easy; there are no member templates involved. */
9578 /* This is a full instantiation of a member template. Find
9579 the partial instantiation of which this is an instance. */
9581 /* Temporarily reduce by one the number of levels in the ARGLIST
9582 so as to avoid comparing the last set of arguments. */
9583 TREE_VEC_LENGTH (arglist
)--;
9584 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
9585 TREE_VEC_LENGTH (arglist
)++;
9586 /* FOUND is either a proper class type, or an alias
9587 template specialization. In the later case, it's a
9588 TYPE_DECL, resulting from the substituting of arguments
9589 for parameters in the TYPE_DECL of the alias template
9590 done earlier. So be careful while getting the template
9592 found
= (TREE_CODE (found
) == TEMPLATE_DECL
9594 : (TREE_CODE (found
) == TYPE_DECL
9595 ? DECL_TI_TEMPLATE (found
)
9596 : CLASSTYPE_TI_TEMPLATE (found
)));
9599 // Build template info for the new specialization.
9600 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
9603 slot
= type_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
9604 entry
= ggc_alloc
<spec_entry
> ();
9608 /* Note this use of the partial instantiation so we can check it
9609 later in maybe_process_partial_specialization. */
9610 DECL_TEMPLATE_INSTANTIATIONS (found
)
9611 = tree_cons (arglist
, t
,
9612 DECL_TEMPLATE_INSTANTIATIONS (found
));
9614 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
9615 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
9616 /* Now that the type has been registered on the instantiations
9617 list, we set up the enumerators. Because the enumeration
9618 constants may involve the enumeration type itself, we make
9619 sure to register the type first, and then create the
9620 constants. That way, doing tsubst_expr for the enumeration
9621 constants won't result in recursive calls here; we'll find
9622 the instantiation and exit above. */
9623 tsubst_enum (template_type
, t
, arglist
);
9625 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
9626 /* If the type makes use of template parameters, the
9627 code that generates debugging information will crash. */
9628 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
9630 /* Possibly limit visibility based on template args. */
9631 TREE_PUBLIC (type_decl
) = 1;
9632 determine_visibility (type_decl
);
9634 inherit_targ_abi_tags (t
);
9640 /* Wrapper for lookup_template_class_1. */
9643 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
9644 int entering_scope
, tsubst_flags_t complain
)
9647 timevar_push (TV_TEMPLATE_INST
);
9648 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
9649 entering_scope
, complain
);
9650 timevar_pop (TV_TEMPLATE_INST
);
9654 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST. */
9657 lookup_template_variable (tree templ
, tree arglist
)
9659 /* The type of the expression is NULL_TREE since the template-id could refer
9660 to an explicit or partial specialization. */
9661 tree type
= NULL_TREE
;
9662 if (flag_concepts
&& variable_concept_p (templ
))
9663 /* Except that concepts are always bool. */
9664 type
= boolean_type_node
;
9665 return build2 (TEMPLATE_ID_EXPR
, type
, templ
, arglist
);
9668 /* Instantiate a variable declaration from a TEMPLATE_ID_EXPR for use. */
9671 finish_template_variable (tree var
, tsubst_flags_t complain
)
9673 tree templ
= TREE_OPERAND (var
, 0);
9674 tree arglist
= TREE_OPERAND (var
, 1);
9676 /* We never want to return a VAR_DECL for a variable concept, since they
9677 aren't instantiated. In a template, leave the TEMPLATE_ID_EXPR alone. */
9678 bool concept_p
= flag_concepts
&& variable_concept_p (templ
);
9679 if (concept_p
&& processing_template_decl
)
9682 tree tmpl_args
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (templ
));
9683 arglist
= add_outermost_template_args (tmpl_args
, arglist
);
9685 templ
= most_general_template (templ
);
9686 tree parms
= DECL_TEMPLATE_PARMS (templ
);
9687 arglist
= coerce_innermost_template_parms (parms
, arglist
, templ
, complain
,
9689 /*use_default*/true);
9691 if (flag_concepts
&& !constraints_satisfied_p (templ
, arglist
))
9693 if (complain
& tf_error
)
9695 error ("use of invalid variable template %qE", var
);
9696 diagnose_constraints (location_of (var
), templ
, arglist
);
9698 return error_mark_node
;
9701 /* If a template-id refers to a specialization of a variable
9702 concept, then the expression is true if and only if the
9703 concept's constraints are satisfied by the given template
9706 NOTE: This is an extension of Concepts Lite TS that
9707 allows constraints to be used in expressions. */
9710 tree decl
= DECL_TEMPLATE_RESULT (templ
);
9711 return evaluate_variable_concept (decl
, arglist
);
9714 return instantiate_template (templ
, arglist
, complain
);
9717 /* Construct a TEMPLATE_ID_EXPR for the given variable template TEMPL having
9718 TARGS template args, and instantiate it if it's not dependent. */
9721 lookup_and_finish_template_variable (tree templ
, tree targs
,
9722 tsubst_flags_t complain
)
9724 templ
= lookup_template_variable (templ
, targs
);
9725 if (!any_dependent_template_arguments_p (targs
))
9727 templ
= finish_template_variable (templ
, complain
);
9731 return convert_from_reference (templ
);
9740 /* True when we should also visit template parameters that occur in
9741 non-deduced contexts. */
9742 bool include_nondeduced_p
;
9743 hash_set
<tree
> *visited
;
9746 /* Called from for_each_template_parm via walk_tree. */
9749 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
9752 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
9753 tree_fn_t fn
= pfd
->fn
;
9754 void *data
= pfd
->data
;
9755 tree result
= NULL_TREE
;
9757 #define WALK_SUBTREE(NODE) \
9760 result = for_each_template_parm (NODE, fn, data, pfd->visited, \
9761 pfd->include_nondeduced_p, \
9763 if (result) goto out; \
9767 if (pfd
->any_fn
&& (*pfd
->any_fn
)(t
, data
))
9771 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
))
9772 WALK_SUBTREE (TYPE_CONTEXT (t
));
9774 switch (TREE_CODE (t
))
9777 if (TYPE_PTRMEMFUNC_P (t
))
9783 if (!TYPE_TEMPLATE_INFO (t
))
9786 WALK_SUBTREE (TYPE_TI_ARGS (t
));
9790 WALK_SUBTREE (TYPE_MIN_VALUE (t
));
9791 WALK_SUBTREE (TYPE_MAX_VALUE (t
));
9795 /* Since we're not going to walk subtrees, we have to do this
9797 WALK_SUBTREE (TYPE_METHOD_BASETYPE (t
));
9801 /* Check the return type. */
9802 WALK_SUBTREE (TREE_TYPE (t
));
9804 /* Check the parameter types. Since default arguments are not
9805 instantiated until they are needed, the TYPE_ARG_TYPES may
9806 contain expressions that involve template parameters. But,
9807 no-one should be looking at them yet. And, once they're
9808 instantiated, they don't contain template parameters, so
9809 there's no point in looking at them then, either. */
9813 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
9814 WALK_SUBTREE (TREE_VALUE (parm
));
9816 /* Since we've already handled the TYPE_ARG_TYPES, we don't
9817 want walk_tree walking into them itself. */
9821 if (flag_noexcept_type
)
9823 tree spec
= TYPE_RAISES_EXCEPTIONS (t
);
9825 WALK_SUBTREE (TREE_PURPOSE (spec
));
9831 case UNDERLYING_TYPE
:
9832 if (pfd
->include_nondeduced_p
9833 && for_each_template_parm (TYPE_VALUES_RAW (t
), fn
, data
,
9835 pfd
->include_nondeduced_p
,
9837 return error_mark_node
;
9838 *walk_subtrees
= false;
9843 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
9844 WALK_SUBTREE (DECL_TI_ARGS (t
));
9849 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
))
9850 WALK_SUBTREE (DECL_INITIAL (t
));
9851 if (DECL_CONTEXT (t
)
9852 && pfd
->include_nondeduced_p
)
9853 WALK_SUBTREE (DECL_CONTEXT (t
));
9856 case BOUND_TEMPLATE_TEMPLATE_PARM
:
9857 /* Record template parameters such as `T' inside `TT<T>'. */
9858 WALK_SUBTREE (TYPE_TI_ARGS (t
));
9861 case TEMPLATE_TEMPLATE_PARM
:
9862 case TEMPLATE_TYPE_PARM
:
9863 case TEMPLATE_PARM_INDEX
:
9864 if (fn
&& (*fn
)(t
, data
))
9871 /* A template template parameter is encountered. */
9872 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
9873 WALK_SUBTREE (TREE_TYPE (t
));
9875 /* Already substituted template template parameter */
9880 /* A template-id in a TYPENAME_TYPE might be a deduced context after
9881 partial instantiation. */
9882 WALK_SUBTREE (TYPENAME_TYPE_FULLNAME (t
));
9886 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
9887 && pfd
->include_nondeduced_p
)
9888 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (t
)));
9893 /* If there's no type, then this thing must be some expression
9894 involving template parameters. */
9895 if (!fn
&& !TREE_TYPE (t
))
9896 return error_mark_node
;
9901 case IMPLICIT_CONV_EXPR
:
9902 case REINTERPRET_CAST_EXPR
:
9903 case CONST_CAST_EXPR
:
9904 case STATIC_CAST_EXPR
:
9905 case DYNAMIC_CAST_EXPR
:
9909 case PSEUDO_DTOR_EXPR
:
9911 return error_mark_node
;
9920 /* We didn't find any template parameters we liked. */
9925 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
9926 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
9927 call FN with the parameter and the DATA.
9928 If FN returns nonzero, the iteration is terminated, and
9929 for_each_template_parm returns 1. Otherwise, the iteration
9930 continues. If FN never returns a nonzero value, the value
9931 returned by for_each_template_parm is 0. If FN is NULL, it is
9932 considered to be the function which always returns 1.
9934 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
9935 parameters that occur in non-deduced contexts. When false, only
9936 visits those template parameters that can be deduced. */
9939 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
9940 hash_set
<tree
> *visited
,
9941 bool include_nondeduced_p
,
9944 struct pair_fn_data pfd
;
9949 pfd
.any_fn
= any_fn
;
9951 pfd
.include_nondeduced_p
= include_nondeduced_p
;
9953 /* Walk the tree. (Conceptually, we would like to walk without
9954 duplicates, but for_each_template_parm_r recursively calls
9955 for_each_template_parm, so we would need to reorganize a fair
9956 bit to use walk_tree_without_duplicates, so we keep our own
9959 pfd
.visited
= visited
;
9961 pfd
.visited
= new hash_set
<tree
>;
9962 result
= cp_walk_tree (&t
,
9963 for_each_template_parm_r
,
9977 /* Returns true if T depends on any template parameter. */
9980 uses_template_parms (tree t
)
9986 int saved_processing_template_decl
;
9988 saved_processing_template_decl
= processing_template_decl
;
9989 if (!saved_processing_template_decl
)
9990 processing_template_decl
= 1;
9992 dependent_p
= dependent_type_p (t
);
9993 else if (TREE_CODE (t
) == TREE_VEC
)
9994 dependent_p
= any_dependent_template_arguments_p (t
);
9995 else if (TREE_CODE (t
) == TREE_LIST
)
9996 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
9997 || uses_template_parms (TREE_CHAIN (t
)));
9998 else if (TREE_CODE (t
) == TYPE_DECL
)
9999 dependent_p
= dependent_type_p (TREE_TYPE (t
));
10000 else if (DECL_P (t
)
10002 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
10003 || TREE_CODE (t
) == OVERLOAD
10005 || identifier_p (t
)
10006 || TREE_CODE (t
) == TRAIT_EXPR
10007 || TREE_CODE (t
) == CONSTRUCTOR
10008 || CONSTANT_CLASS_P (t
))
10009 dependent_p
= (type_dependent_expression_p (t
)
10010 || value_dependent_expression_p (t
));
10013 gcc_assert (t
== error_mark_node
);
10014 dependent_p
= false;
10017 processing_template_decl
= saved_processing_template_decl
;
10019 return dependent_p
;
10022 /* Returns true iff current_function_decl is an incompletely instantiated
10023 template. Useful instead of processing_template_decl because the latter
10024 is set to 0 during instantiate_non_dependent_expr. */
10027 in_template_function (void)
10029 tree fn
= current_function_decl
;
10031 ++processing_template_decl
;
10032 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
10033 && DECL_TEMPLATE_INFO (fn
)
10034 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
10035 --processing_template_decl
;
10039 /* Returns true if T depends on any template parameter with level LEVEL. */
10042 uses_template_parms_level (tree t
, int level
)
10044 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
10045 /*include_nondeduced_p=*/true);
10048 /* Returns true if the signature of DECL depends on any template parameter from
10049 its enclosing class. */
10052 uses_outer_template_parms (tree decl
)
10054 int depth
= template_class_depth (CP_DECL_CONTEXT (decl
));
10057 if (for_each_template_parm (TREE_TYPE (decl
), template_parm_outer_level
,
10058 &depth
, NULL
, /*include_nondeduced_p=*/true))
10060 if (PRIMARY_TEMPLATE_P (decl
)
10061 && for_each_template_parm (INNERMOST_TEMPLATE_PARMS
10062 (DECL_TEMPLATE_PARMS (decl
)),
10063 template_parm_outer_level
,
10064 &depth
, NULL
, /*include_nondeduced_p=*/true))
10066 tree ci
= get_constraints (decl
);
10068 ci
= CI_ASSOCIATED_CONSTRAINTS (ci
);
10069 if (ci
&& for_each_template_parm (ci
, template_parm_outer_level
,
10070 &depth
, NULL
, /*nondeduced*/true))
10075 /* Returns TRUE iff INST is an instantiation we don't need to do in an
10076 ill-formed translation unit, i.e. a variable or function that isn't
10077 usable in a constant expression. */
10080 neglectable_inst_p (tree d
)
10082 return (d
&& DECL_P (d
)
10083 && !undeduced_auto_decl (d
)
10084 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
10085 : decl_maybe_constant_var_p (d
)));
10088 /* Returns TRUE iff we should refuse to instantiate DECL because it's
10089 neglectable and instantiated from within an erroneous instantiation. */
10092 limit_bad_template_recursion (tree decl
)
10094 struct tinst_level
*lev
= current_tinst_level
;
10095 int errs
= errorcount
+ sorrycount
;
10096 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
10099 for (; lev
; lev
= lev
->next
)
10100 if (neglectable_inst_p (lev
->maybe_get_node ()))
10103 return (lev
&& errs
> lev
->errors
);
10106 static int tinst_depth
;
10107 extern int max_tinst_depth
;
10110 static GTY(()) struct tinst_level
*last_error_tinst_level
;
10112 /* We're starting to instantiate D; record the template instantiation context
10113 at LOC for diagnostics and to restore it later. */
10116 push_tinst_level_loc (tree tldcl
, tree targs
, location_t loc
)
10118 struct tinst_level
*new_level
;
10120 if (tinst_depth
>= max_tinst_depth
)
10122 /* Tell error.c not to try to instantiate any templates. */
10124 fatal_error (input_location
,
10125 "template instantiation depth exceeds maximum of %d"
10126 " (use -ftemplate-depth= to increase the maximum)",
10131 /* If the current instantiation caused problems, don't let it instantiate
10132 anything else. Do allow deduction substitution and decls usable in
10133 constant expressions. */
10134 if (!targs
&& limit_bad_template_recursion (tldcl
))
10137 /* When not -quiet, dump template instantiations other than functions, since
10138 announce_function will take care of those. */
10139 if (!quiet_flag
&& !targs
10140 && TREE_CODE (tldcl
) != TREE_LIST
10141 && TREE_CODE (tldcl
) != FUNCTION_DECL
)
10142 fprintf (stderr
, " %s", decl_as_string (tldcl
, TFF_DECL_SPECIFIERS
));
10144 new_level
= tinst_level_freelist ().alloc ();
10145 new_level
->tldcl
= tldcl
;
10146 new_level
->targs
= targs
;
10147 new_level
->locus
= loc
;
10148 new_level
->errors
= errorcount
+ sorrycount
;
10149 new_level
->next
= NULL
;
10150 new_level
->refcount
= 0;
10151 set_refcount_ptr (new_level
->next
, current_tinst_level
);
10152 set_refcount_ptr (current_tinst_level
, new_level
);
10155 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
10156 depth_reached
= tinst_depth
;
10161 /* We're starting substitution of TMPL<ARGS>; record the template
10162 substitution context for diagnostics and to restore it later. */
10165 push_tinst_level (tree tmpl
, tree args
)
10167 return push_tinst_level_loc (tmpl
, args
, input_location
);
10170 /* We're starting to instantiate D; record INPUT_LOCATION and the
10171 template instantiation context for diagnostics and to restore it
10175 push_tinst_level (tree d
)
10177 return push_tinst_level_loc (d
, input_location
);
10180 /* Likewise, but record LOC as the program location. */
10183 push_tinst_level_loc (tree d
, location_t loc
)
10185 gcc_assert (TREE_CODE (d
) != TREE_LIST
);
10186 return push_tinst_level_loc (d
, NULL
, loc
);
10189 /* We're done instantiating this template; return to the instantiation
10193 pop_tinst_level (void)
10195 /* Restore the filename and line number stashed away when we started
10196 this instantiation. */
10197 input_location
= current_tinst_level
->locus
;
10198 set_refcount_ptr (current_tinst_level
, current_tinst_level
->next
);
10202 /* We're instantiating a deferred template; restore the template
10203 instantiation context in which the instantiation was requested, which
10204 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
10207 reopen_tinst_level (struct tinst_level
*level
)
10209 struct tinst_level
*t
;
10212 for (t
= level
; t
; t
= t
->next
)
10215 set_refcount_ptr (current_tinst_level
, level
);
10216 pop_tinst_level ();
10217 if (current_tinst_level
)
10218 current_tinst_level
->errors
= errorcount
+sorrycount
;
10219 return level
->maybe_get_node ();
10222 /* Returns the TINST_LEVEL which gives the original instantiation
10225 struct tinst_level
*
10226 outermost_tinst_level (void)
10228 struct tinst_level
*level
= current_tinst_level
;
10230 while (level
->next
)
10231 level
= level
->next
;
10235 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
10236 vector of template arguments, as for tsubst.
10238 Returns an appropriate tsubst'd friend declaration. */
10241 tsubst_friend_function (tree decl
, tree args
)
10245 if (TREE_CODE (decl
) == FUNCTION_DECL
10246 && DECL_TEMPLATE_INSTANTIATION (decl
)
10247 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
10248 /* This was a friend declared with an explicit template
10249 argument list, e.g.:
10251 friend void f<>(T);
10253 to indicate that f was a template instantiation, not a new
10254 function declaration. Now, we have to figure out what
10255 instantiation of what template. */
10257 tree template_id
, arglist
, fns
;
10260 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
10262 /* Friend functions are looked up in the containing namespace scope.
10263 We must enter that scope, to avoid finding member functions of the
10264 current class with same name. */
10265 push_nested_namespace (ns
);
10266 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
10267 tf_warning_or_error
, NULL_TREE
,
10268 /*integral_constant_expression_p=*/false);
10269 pop_nested_namespace (ns
);
10270 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
10271 tf_warning_or_error
, NULL_TREE
);
10272 template_id
= lookup_template_function (fns
, arglist
);
10274 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
10275 tmpl
= determine_specialization (template_id
, new_friend
,
10277 /*need_member_template=*/0,
10278 TREE_VEC_LENGTH (args
),
10280 return instantiate_template (tmpl
, new_args
, tf_error
);
10283 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
10285 /* The NEW_FRIEND will look like an instantiation, to the
10286 compiler, but is not an instantiation from the point of view of
10287 the language. For example, we might have had:
10289 template <class T> struct S {
10290 template <class U> friend void f(T, U);
10293 Then, in S<int>, template <class U> void f(int, U) is not an
10294 instantiation of anything. */
10295 if (new_friend
== error_mark_node
)
10296 return error_mark_node
;
10298 DECL_USE_TEMPLATE (new_friend
) = 0;
10299 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
10301 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
10302 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
10303 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
10306 /* The mangled name for the NEW_FRIEND is incorrect. The function
10307 is not a template instantiation and should not be mangled like
10308 one. Therefore, we forget the mangling here; we'll recompute it
10309 later if we need it. */
10310 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
10312 SET_DECL_RTL (new_friend
, NULL
);
10313 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
10316 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
10319 tree new_friend_template_info
;
10320 tree new_friend_result_template_info
;
10322 int new_friend_is_defn
;
10324 /* We must save some information from NEW_FRIEND before calling
10325 duplicate decls since that function will free NEW_FRIEND if
10327 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
10328 new_friend_is_defn
=
10329 (DECL_INITIAL (DECL_TEMPLATE_RESULT
10330 (template_for_substitution (new_friend
)))
10332 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
10334 /* This declaration is a `primary' template. */
10335 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
10337 new_friend_result_template_info
10338 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
10341 new_friend_result_template_info
= NULL_TREE
;
10343 /* Inside pushdecl_namespace_level, we will push into the
10344 current namespace. However, the friend function should go
10345 into the namespace of the template. */
10346 ns
= decl_namespace_context (new_friend
);
10347 push_nested_namespace (ns
);
10348 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
10349 pop_nested_namespace (ns
);
10351 if (old_decl
== error_mark_node
)
10352 return error_mark_node
;
10354 if (old_decl
!= new_friend
)
10356 /* This new friend declaration matched an existing
10357 declaration. For example, given:
10359 template <class T> void f(T);
10360 template <class U> class C {
10361 template <class T> friend void f(T) {}
10364 the friend declaration actually provides the definition
10365 of `f', once C has been instantiated for some type. So,
10366 old_decl will be the out-of-class template declaration,
10367 while new_friend is the in-class definition.
10369 But, if `f' was called before this point, the
10370 instantiation of `f' will have DECL_TI_ARGS corresponding
10371 to `T' but not to `U', references to which might appear
10372 in the definition of `f'. Previously, the most general
10373 template for an instantiation of `f' was the out-of-class
10374 version; now it is the in-class version. Therefore, we
10375 run through all specialization of `f', adding to their
10376 DECL_TI_ARGS appropriately. In particular, they need a
10377 new set of outer arguments, corresponding to the
10378 arguments for this class instantiation.
10380 The same situation can arise with something like this:
10382 friend void f(int);
10383 template <class T> class C {
10384 friend void f(T) {}
10387 when `C<int>' is instantiated. Now, `f(int)' is defined
10390 if (!new_friend_is_defn
)
10391 /* On the other hand, if the in-class declaration does
10392 *not* provide a definition, then we don't want to alter
10393 existing definitions. We can just leave everything
10398 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
10399 tree new_args
= TI_ARGS (new_friend_template_info
);
10401 /* Overwrite whatever template info was there before, if
10402 any, with the new template information pertaining to
10403 the declaration. */
10404 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
10406 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
10408 /* We should have called reregister_specialization in
10409 duplicate_decls. */
10410 gcc_assert (retrieve_specialization (new_template
,
10414 /* Instantiate it if the global has already been used. */
10415 if (DECL_ODR_USED (old_decl
))
10416 instantiate_decl (old_decl
, /*defer_ok=*/true,
10417 /*expl_inst_class_mem_p=*/false);
10423 /* Indicate that the old function template is a partial
10425 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
10426 = new_friend_result_template_info
;
10428 gcc_assert (new_template
10429 == most_general_template (new_template
));
10430 gcc_assert (new_template
!= old_decl
);
10432 /* Reassign any specializations already in the hash table
10433 to the new more general template, and add the
10434 additional template args. */
10435 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
10437 t
= TREE_CHAIN (t
))
10439 tree spec
= TREE_VALUE (t
);
10442 elt
.tmpl
= old_decl
;
10443 elt
.args
= DECL_TI_ARGS (spec
);
10444 elt
.spec
= NULL_TREE
;
10446 decl_specializations
->remove_elt (&elt
);
10448 DECL_TI_ARGS (spec
)
10449 = add_outermost_template_args (new_args
,
10450 DECL_TI_ARGS (spec
));
10452 register_specialization
10453 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
10456 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
10460 /* The information from NEW_FRIEND has been merged into OLD_DECL
10461 by duplicate_decls. */
10462 new_friend
= old_decl
;
10467 tree context
= DECL_CONTEXT (new_friend
);
10471 template <class T> class C {
10472 template <class U> friend void C1<U>::f (); // case 1
10473 friend void C2<T>::f (); // case 2
10475 we only need to make sure CONTEXT is a complete type for
10476 case 2. To distinguish between the two cases, we note that
10477 CONTEXT of case 1 remains dependent type after tsubst while
10478 this isn't true for case 2. */
10479 ++processing_template_decl
;
10480 dependent_p
= dependent_type_p (context
);
10481 --processing_template_decl
;
10484 && !complete_type_or_else (context
, NULL_TREE
))
10485 return error_mark_node
;
10487 if (COMPLETE_TYPE_P (context
))
10489 tree fn
= new_friend
;
10490 /* do_friend adds the TEMPLATE_DECL for any member friend
10491 template even if it isn't a member template, i.e.
10492 template <class T> friend A<T>::f();
10493 Look through it in that case. */
10494 if (TREE_CODE (fn
) == TEMPLATE_DECL
10495 && !PRIMARY_TEMPLATE_P (fn
))
10496 fn
= DECL_TEMPLATE_RESULT (fn
);
10497 /* Check to see that the declaration is really present, and,
10498 possibly obtain an improved declaration. */
10499 fn
= check_classfn (context
, fn
, NULL_TREE
);
10509 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
10510 template arguments, as for tsubst.
10512 Returns an appropriate tsubst'd friend type or error_mark_node on
10516 tsubst_friend_class (tree friend_tmpl
, tree args
)
10520 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
10522 tmpl
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
10523 return TREE_TYPE (tmpl
);
10526 tree context
= CP_DECL_CONTEXT (friend_tmpl
);
10527 if (TREE_CODE (context
) == NAMESPACE_DECL
)
10528 push_nested_namespace (context
);
10530 push_nested_class (context
);
10532 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), /*prefer_type=*/false,
10533 /*non_class=*/false, /*block_p=*/false,
10534 /*namespaces_only=*/false, LOOKUP_HIDDEN
);
10536 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
10538 /* The friend template has already been declared. Just
10539 check to see that the declarations match, and install any new
10540 default parameters. We must tsubst the default parameters,
10541 of course. We only need the innermost template parameters
10542 because that is all that redeclare_class_template will look
10544 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
10545 > TMPL_ARGS_DEPTH (args
))
10547 tree parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
10548 args
, tf_warning_or_error
);
10549 location_t saved_input_location
= input_location
;
10550 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
10551 tree cons
= get_constraints (tmpl
);
10552 redeclare_class_template (TREE_TYPE (tmpl
), parms
, cons
);
10553 input_location
= saved_input_location
;
10558 /* The friend template has not already been declared. In this
10559 case, the instantiation of the template class will cause the
10560 injection of this template into the namespace scope. */
10561 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
10563 if (tmpl
!= error_mark_node
)
10565 /* The new TMPL is not an instantiation of anything, so we
10566 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE
10567 for the new type because that is supposed to be the
10568 corresponding template decl, i.e., TMPL. */
10569 DECL_USE_TEMPLATE (tmpl
) = 0;
10570 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
10571 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
10572 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
10573 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
10575 /* It is hidden. */
10576 retrofit_lang_decl (DECL_TEMPLATE_RESULT (tmpl
));
10577 DECL_ANTICIPATED (tmpl
)
10578 = DECL_ANTICIPATED (DECL_TEMPLATE_RESULT (tmpl
)) = true;
10580 /* Inject this template into the enclosing namspace scope. */
10581 tmpl
= pushdecl_namespace_level (tmpl
, true);
10585 if (TREE_CODE (context
) == NAMESPACE_DECL
)
10586 pop_nested_namespace (context
);
10588 pop_nested_class ();
10590 return TREE_TYPE (tmpl
);
10593 /* Returns zero if TYPE cannot be completed later due to circularity.
10594 Otherwise returns one. */
10597 can_complete_type_without_circularity (tree type
)
10599 if (type
== NULL_TREE
|| type
== error_mark_node
)
10601 else if (COMPLETE_TYPE_P (type
))
10603 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10604 return can_complete_type_without_circularity (TREE_TYPE (type
));
10605 else if (CLASS_TYPE_P (type
)
10606 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
10612 static tree
tsubst_omp_clauses (tree
, enum c_omp_region_type
, tree
,
10613 tsubst_flags_t
, tree
);
10615 /* Instantiate a single dependent attribute T (a TREE_LIST), and return either
10616 T or a new TREE_LIST, possibly a chain in the case of a pack expansion. */
10619 tsubst_attribute (tree t
, tree
*decl_p
, tree args
,
10620 tsubst_flags_t complain
, tree in_decl
)
10622 gcc_assert (ATTR_IS_DEPENDENT (t
));
10624 tree val
= TREE_VALUE (t
);
10625 if (val
== NULL_TREE
)
10626 /* Nothing to do. */;
10627 else if ((flag_openmp
|| flag_openmp_simd
)
10628 && is_attribute_p ("omp declare simd",
10629 get_attribute_name (t
)))
10631 tree clauses
= TREE_VALUE (val
);
10632 clauses
= tsubst_omp_clauses (clauses
, C_ORT_OMP_DECLARE_SIMD
, args
,
10633 complain
, in_decl
);
10634 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
10635 clauses
= finish_omp_clauses (clauses
, C_ORT_OMP_DECLARE_SIMD
);
10636 tree parms
= DECL_ARGUMENTS (*decl_p
);
10638 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
10640 val
= build_tree_list (NULL_TREE
, clauses
);
10644 /* If the first attribute argument is an identifier, don't
10645 pass it through tsubst. Attributes like mode, format,
10646 cleanup and several target specific attributes expect it
10648 else if (attribute_takes_identifier_p (get_attribute_name (t
)))
10651 = tsubst_expr (TREE_CHAIN (val
), args
, complain
, in_decl
,
10652 /*integral_constant_expression_p=*/false);
10653 if (chain
!= TREE_CHAIN (val
))
10654 val
= tree_cons (NULL_TREE
, TREE_VALUE (val
), chain
);
10656 else if (PACK_EXPANSION_P (val
))
10658 /* An attribute pack expansion. */
10659 tree purp
= TREE_PURPOSE (t
);
10660 tree pack
= tsubst_pack_expansion (val
, args
, complain
, in_decl
);
10661 if (pack
== error_mark_node
)
10662 return error_mark_node
;
10663 int len
= TREE_VEC_LENGTH (pack
);
10664 tree list
= NULL_TREE
;
10666 for (int i
= 0; i
< len
; ++i
)
10668 tree elt
= TREE_VEC_ELT (pack
, i
);
10669 *q
= build_tree_list (purp
, elt
);
10670 q
= &TREE_CHAIN (*q
);
10675 val
= tsubst_expr (val
, args
, complain
, in_decl
,
10676 /*integral_constant_expression_p=*/false);
10678 if (val
!= TREE_VALUE (t
))
10679 return build_tree_list (TREE_PURPOSE (t
), val
);
10683 /* Instantiate any dependent attributes in ATTRIBUTES, returning either it
10684 unchanged or a new TREE_LIST chain. */
10687 tsubst_attributes (tree attributes
, tree args
,
10688 tsubst_flags_t complain
, tree in_decl
)
10690 tree last_dep
= NULL_TREE
;
10692 for (tree t
= attributes
; t
; t
= TREE_CHAIN (t
))
10693 if (ATTR_IS_DEPENDENT (t
))
10696 attributes
= copy_list (attributes
);
10701 for (tree
*p
= &attributes
; *p
; )
10704 if (ATTR_IS_DEPENDENT (t
))
10706 tree subst
= tsubst_attribute (t
, NULL
, args
, complain
, in_decl
);
10711 p
= &TREE_CHAIN (*p
);
10712 *p
= TREE_CHAIN (t
);
10716 p
= &TREE_CHAIN (*p
);
10722 /* Apply any attributes which had to be deferred until instantiation
10723 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
10724 ARGS, COMPLAIN, IN_DECL are as tsubst. */
10727 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
10728 tree args
, tsubst_flags_t complain
, tree in_decl
)
10730 tree last_dep
= NULL_TREE
;
10734 if (attributes
== NULL_TREE
)
10737 if (DECL_P (*decl_p
))
10739 if (TREE_TYPE (*decl_p
) == error_mark_node
)
10741 p
= &DECL_ATTRIBUTES (*decl_p
);
10742 /* DECL_ATTRIBUTES comes from copy_node in tsubst_decl, and is identical
10743 to our attributes parameter. */
10744 gcc_assert (*p
== attributes
);
10748 p
= &TYPE_ATTRIBUTES (*decl_p
);
10749 /* TYPE_ATTRIBUTES was set up (with abi_tag and may_alias) in
10750 lookup_template_class_1, and should be preserved. */
10751 gcc_assert (*p
!= attributes
);
10753 p
= &TREE_CHAIN (*p
);
10756 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
10757 if (ATTR_IS_DEPENDENT (t
))
10760 attributes
= copy_list (attributes
);
10767 tree late_attrs
= NULL_TREE
;
10768 tree
*q
= &late_attrs
;
10773 if (ATTR_IS_DEPENDENT (t
))
10775 *p
= TREE_CHAIN (t
);
10776 TREE_CHAIN (t
) = NULL_TREE
;
10777 *q
= tsubst_attribute (t
, decl_p
, args
, complain
, in_decl
);
10779 q
= &TREE_CHAIN (*q
);
10782 p
= &TREE_CHAIN (t
);
10785 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
10789 /* Perform (or defer) access check for typedefs that were referenced
10790 from within the template TMPL code.
10791 This is a subroutine of instantiate_decl and instantiate_class_template.
10792 TMPL is the template to consider and TARGS is the list of arguments of
10796 perform_typedefs_access_check (tree tmpl
, tree targs
)
10798 location_t saved_location
;
10800 qualified_typedef_usage_t
*iter
;
10803 || (!CLASS_TYPE_P (tmpl
)
10804 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
10807 saved_location
= input_location
;
10808 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
10810 tree type_decl
= iter
->typedef_decl
;
10811 tree type_scope
= iter
->context
;
10813 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
10816 if (uses_template_parms (type_decl
))
10817 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
10818 if (uses_template_parms (type_scope
))
10819 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
10821 /* Make access check error messages point to the location
10822 of the use of the typedef. */
10823 input_location
= iter
->locus
;
10824 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
10825 type_decl
, type_decl
,
10826 tf_warning_or_error
);
10828 input_location
= saved_location
;
10832 instantiate_class_template_1 (tree type
)
10834 tree templ
, args
, pattern
, t
, member
;
10838 unsigned int saved_maximum_field_alignment
;
10841 if (type
== error_mark_node
)
10842 return error_mark_node
;
10844 if (COMPLETE_OR_OPEN_TYPE_P (type
)
10845 || uses_template_parms (type
))
10848 /* Figure out which template is being instantiated. */
10849 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
10850 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
10852 /* Mark the type as in the process of being defined. */
10853 TYPE_BEING_DEFINED (type
) = 1;
10855 /* We may be in the middle of deferred access check. Disable
10857 deferring_access_check_sentinel
acs (dk_no_deferred
);
10859 /* Determine what specialization of the original template to
10861 t
= most_specialized_partial_spec (type
, tf_warning_or_error
);
10862 if (t
== error_mark_node
)
10863 return error_mark_node
;
10866 /* This TYPE is actually an instantiation of a partial
10867 specialization. We replace the innermost set of ARGS with
10868 the arguments appropriate for substitution. For example,
10871 template <class T> struct S {};
10872 template <class T> struct S<T*> {};
10874 and supposing that we are instantiating S<int*>, ARGS will
10875 presently be {int*} -- but we need {int}. */
10876 pattern
= TREE_TYPE (t
);
10877 args
= TREE_PURPOSE (t
);
10881 pattern
= TREE_TYPE (templ
);
10882 args
= CLASSTYPE_TI_ARGS (type
);
10885 /* If the template we're instantiating is incomplete, then clearly
10886 there's nothing we can do. */
10887 if (!COMPLETE_TYPE_P (pattern
))
10889 /* We can try again later. */
10890 TYPE_BEING_DEFINED (type
) = 0;
10894 /* If we've recursively instantiated too many templates, stop. */
10895 if (! push_tinst_level (type
))
10898 int saved_unevaluated_operand
= cp_unevaluated_operand
;
10899 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
10901 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
10902 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
10903 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
10904 fn_context
= error_mark_node
;
10906 push_to_top_level ();
10909 cp_unevaluated_operand
= 0;
10910 c_inhibit_evaluation_warnings
= 0;
10912 /* Use #pragma pack from the template context. */
10913 saved_maximum_field_alignment
= maximum_field_alignment
;
10914 maximum_field_alignment
= TYPE_PRECISION (pattern
);
10916 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
10918 /* Set the input location to the most specialized template definition.
10919 This is needed if tsubsting causes an error. */
10920 typedecl
= TYPE_MAIN_DECL (pattern
);
10921 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
10922 DECL_SOURCE_LOCATION (typedecl
);
10924 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
10925 SET_TYPE_ALIGN (type
, TYPE_ALIGN (pattern
));
10926 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
10927 CLASSTYPE_NON_AGGREGATE (type
) = CLASSTYPE_NON_AGGREGATE (pattern
);
10928 if (ANON_AGGR_TYPE_P (pattern
))
10929 SET_ANON_AGGR_TYPE_P (type
);
10930 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
10932 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
10933 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
10934 /* Adjust visibility for template arguments. */
10935 determine_visibility (TYPE_MAIN_DECL (type
));
10937 if (CLASS_TYPE_P (type
))
10938 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
10940 pbinfo
= TYPE_BINFO (pattern
);
10942 /* We should never instantiate a nested class before its enclosing
10943 class; we need to look up the nested class by name before we can
10944 instantiate it, and that lookup should instantiate the enclosing
10946 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
10947 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
10949 base_list
= NULL_TREE
;
10950 if (BINFO_N_BASE_BINFOS (pbinfo
))
10956 /* We must enter the scope containing the type, as that is where
10957 the accessibility of types named in dependent bases are
10959 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
10961 /* Substitute into each of the bases to determine the actual
10963 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
10966 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
10967 tree expanded_bases
= NULL_TREE
;
10970 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
10973 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
10974 args
, tf_error
, NULL_TREE
);
10975 if (expanded_bases
== error_mark_node
)
10978 len
= TREE_VEC_LENGTH (expanded_bases
);
10981 for (idx
= 0; idx
< len
; idx
++)
10983 if (expanded_bases
)
10984 /* Extract the already-expanded base class. */
10985 base
= TREE_VEC_ELT (expanded_bases
, idx
);
10987 /* Substitute to figure out the base class. */
10988 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
10991 if (base
== error_mark_node
)
10994 base_list
= tree_cons (access
, base
, base_list
);
10995 if (BINFO_VIRTUAL_P (pbase_binfo
))
10996 TREE_TYPE (base_list
) = integer_type_node
;
11000 /* The list is now in reverse order; correct that. */
11001 base_list
= nreverse (base_list
);
11004 pop_scope (pushed_scope
);
11006 /* Now call xref_basetypes to set up all the base-class
11008 xref_basetypes (type
, base_list
);
11010 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
11011 (int) ATTR_FLAG_TYPE_IN_PLACE
,
11012 args
, tf_error
, NULL_TREE
);
11013 fixup_attribute_variants (type
);
11015 /* Now that our base classes are set up, enter the scope of the
11016 class, so that name lookups into base classes, etc. will work
11017 correctly. This is precisely analogous to what we do in
11018 begin_class_definition when defining an ordinary non-template
11019 class, except we also need to push the enclosing classes. */
11020 push_nested_class (type
);
11022 /* Now members are processed in the order of declaration. */
11023 for (member
= CLASSTYPE_DECL_LIST (pattern
);
11024 member
; member
= TREE_CHAIN (member
))
11026 tree t
= TREE_VALUE (member
);
11028 if (TREE_PURPOSE (member
))
11032 if (LAMBDA_TYPE_P (t
))
11033 /* A closure type for a lambda in an NSDMI or default argument.
11034 Ignore it; it will be regenerated when needed. */
11037 /* Build new CLASSTYPE_NESTED_UTDS. */
11040 bool class_template_p
;
11042 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
11043 && TYPE_LANG_SPECIFIC (t
)
11044 && CLASSTYPE_IS_TEMPLATE (t
));
11045 /* If the member is a class template, then -- even after
11046 substitution -- there may be dependent types in the
11047 template argument list for the class. We increment
11048 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
11049 that function will assume that no types are dependent
11050 when outside of a template. */
11051 if (class_template_p
)
11052 ++processing_template_decl
;
11053 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
11054 if (class_template_p
)
11055 --processing_template_decl
;
11056 if (newtag
== error_mark_node
)
11059 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
11061 tree name
= TYPE_IDENTIFIER (t
);
11063 if (class_template_p
)
11064 /* Unfortunately, lookup_template_class sets
11065 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
11066 instantiation (i.e., for the type of a member
11067 template class nested within a template class.)
11068 This behavior is required for
11069 maybe_process_partial_specialization to work
11070 correctly, but is not accurate in this case;
11071 the TAG is not an instantiation of anything.
11072 (The corresponding TEMPLATE_DECL is an
11073 instantiation, but the TYPE is not.) */
11074 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
11076 /* Now, we call pushtag to put this NEWTAG into the scope of
11077 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
11078 pushtag calling push_template_decl. We don't have to do
11079 this for enums because it will already have been done in
11082 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
11083 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
11086 else if (DECL_DECLARES_FUNCTION_P (t
))
11090 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11091 ++processing_template_decl
;
11092 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
11093 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11094 --processing_template_decl
;
11095 set_current_access_from_decl (r
);
11096 finish_member_declaration (r
);
11097 /* Instantiate members marked with attribute used. */
11098 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
11100 if (TREE_CODE (r
) == FUNCTION_DECL
11101 && DECL_OMP_DECLARE_REDUCTION_P (r
))
11102 cp_check_omp_declare_reduction (r
);
11104 else if ((DECL_CLASS_TEMPLATE_P (t
) || DECL_IMPLICIT_TYPEDEF_P (t
))
11105 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
11106 /* A closure type for a lambda in an NSDMI or default argument.
11107 Ignore it; it will be regenerated when needed. */;
11110 /* Build new TYPE_FIELDS. */
11111 if (TREE_CODE (t
) == STATIC_ASSERT
)
11115 ++c_inhibit_evaluation_warnings
;
11117 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
11118 tf_warning_or_error
, NULL_TREE
,
11119 /*integral_constant_expression_p=*/true);
11120 --c_inhibit_evaluation_warnings
;
11122 finish_static_assert (condition
,
11123 STATIC_ASSERT_MESSAGE (t
),
11124 STATIC_ASSERT_SOURCE_LOCATION (t
),
11125 /*member_p=*/true);
11127 else if (TREE_CODE (t
) != CONST_DECL
)
11130 tree vec
= NULL_TREE
;
11133 /* The file and line for this declaration, to
11134 assist in error message reporting. Since we
11135 called push_tinst_level above, we don't need to
11137 input_location
= DECL_SOURCE_LOCATION (t
);
11139 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11140 ++processing_template_decl
;
11141 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
11142 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11143 --processing_template_decl
;
11145 if (TREE_CODE (r
) == TREE_VEC
)
11147 /* A capture pack became multiple fields. */
11149 len
= TREE_VEC_LENGTH (vec
);
11152 for (int i
= 0; i
< len
; ++i
)
11155 r
= TREE_VEC_ELT (vec
, i
);
11160 [t]he initialization (and any associated
11161 side-effects) of a static data member does
11162 not occur unless the static data member is
11163 itself used in a way that requires the
11164 definition of the static data member to
11167 Therefore, we do not substitute into the
11168 initialized for the static data member here. */
11169 finish_static_data_member_decl
11171 /*init=*/NULL_TREE
,
11172 /*init_const_expr_p=*/false,
11173 /*asmspec_tree=*/NULL_TREE
,
11175 /* Instantiate members marked with attribute used. */
11176 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
11179 else if (TREE_CODE (r
) == FIELD_DECL
)
11181 /* Determine whether R has a valid type and can be
11182 completed later. If R is invalid, then its type
11183 is replaced by error_mark_node. */
11184 tree rtype
= TREE_TYPE (r
);
11185 if (can_complete_type_without_circularity (rtype
))
11186 complete_type (rtype
);
11188 if (!complete_or_array_type_p (rtype
))
11190 /* If R's type couldn't be completed and
11191 it isn't a flexible array member (whose
11192 type is incomplete by definition) give
11194 cxx_incomplete_type_error (r
, rtype
);
11195 TREE_TYPE (r
) = error_mark_node
;
11197 else if (TREE_CODE (rtype
) == ARRAY_TYPE
11198 && TYPE_DOMAIN (rtype
) == NULL_TREE
11199 && (TREE_CODE (type
) == UNION_TYPE
11200 || TREE_CODE (type
) == QUAL_UNION_TYPE
))
11202 error ("flexible array member %qD in union", r
);
11203 TREE_TYPE (r
) = error_mark_node
;
11207 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
11208 such a thing will already have been added to the field
11209 list by tsubst_enum in finish_member_declaration in the
11210 CLASSTYPE_NESTED_UTDS case above. */
11211 if (!(TREE_CODE (r
) == TYPE_DECL
11212 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
11213 && DECL_ARTIFICIAL (r
)))
11215 set_current_access_from_decl (r
);
11216 finish_member_declaration (r
);
11224 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
11225 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
11227 /* Build new CLASSTYPE_FRIEND_CLASSES. */
11229 tree friend_type
= t
;
11230 bool adjust_processing_template_decl
= false;
11232 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
11234 /* template <class T> friend class C; */
11235 friend_type
= tsubst_friend_class (friend_type
, args
);
11236 adjust_processing_template_decl
= true;
11238 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
11240 /* template <class T> friend class C::D; */
11241 friend_type
= tsubst (friend_type
, args
,
11242 tf_warning_or_error
, NULL_TREE
);
11243 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
11244 friend_type
= TREE_TYPE (friend_type
);
11245 adjust_processing_template_decl
= true;
11247 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
11248 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
11250 /* This could be either
11254 when dependent_type_p is false or
11256 template <class U> friend class T::C;
11259 /* Bump processing_template_decl in case this is something like
11260 template <class T> friend struct A<T>::B. */
11261 ++processing_template_decl
;
11262 friend_type
= tsubst (friend_type
, args
,
11263 tf_warning_or_error
, NULL_TREE
);
11264 if (dependent_type_p (friend_type
))
11265 adjust_processing_template_decl
= true;
11266 --processing_template_decl
;
11268 else if (TREE_CODE (friend_type
) != BOUND_TEMPLATE_TEMPLATE_PARM
11269 && !CLASSTYPE_USE_TEMPLATE (friend_type
)
11270 && TYPE_HIDDEN_P (friend_type
))
11274 where C hasn't been declared yet. Let's lookup name
11275 from namespace scope directly, bypassing any name that
11276 come from dependent base class. */
11277 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
11279 /* The call to xref_tag_from_type does injection for friend
11281 push_nested_namespace (ns
);
11283 xref_tag_from_type (friend_type
, NULL_TREE
,
11284 /*tag_scope=*/ts_current
);
11285 pop_nested_namespace (ns
);
11287 else if (uses_template_parms (friend_type
))
11288 /* friend class C<T>; */
11289 friend_type
= tsubst (friend_type
, args
,
11290 tf_warning_or_error
, NULL_TREE
);
11295 where C is already declared or
11297 friend class C<int>;
11299 We don't have to do anything in these cases. */
11301 if (adjust_processing_template_decl
)
11302 /* Trick make_friend_class into realizing that the friend
11303 we're adding is a template, not an ordinary class. It's
11304 important that we use make_friend_class since it will
11305 perform some error-checking and output cross-reference
11307 ++processing_template_decl
;
11309 if (friend_type
!= error_mark_node
)
11310 make_friend_class (type
, friend_type
, /*complain=*/false);
11312 if (adjust_processing_template_decl
)
11313 --processing_template_decl
;
11317 /* Build new DECL_FRIENDLIST. */
11320 /* The file and line for this declaration, to
11321 assist in error message reporting. Since we
11322 called push_tinst_level above, we don't need to
11324 input_location
= DECL_SOURCE_LOCATION (t
);
11326 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11328 ++processing_template_decl
;
11329 push_deferring_access_checks (dk_no_check
);
11332 r
= tsubst_friend_function (t
, args
);
11333 add_friend (type
, r
, /*complain=*/false);
11334 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11336 pop_deferring_access_checks ();
11337 --processing_template_decl
;
11345 /* Restore these before substituting into the lambda capture
11347 cp_unevaluated_operand
= saved_unevaluated_operand
;
11348 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
11351 /* Set the file and line number information to whatever is given for
11352 the class itself. This puts error messages involving generated
11353 implicit functions at a predictable point, and the same point
11354 that would be used for non-template classes. */
11355 input_location
= DECL_SOURCE_LOCATION (typedecl
);
11357 unreverse_member_declarations (type
);
11358 finish_struct_1 (type
);
11359 TYPE_BEING_DEFINED (type
) = 0;
11361 /* We don't instantiate default arguments for member functions. 14.7.1:
11363 The implicit instantiation of a class template specialization causes
11364 the implicit instantiation of the declarations, but not of the
11365 definitions or default arguments, of the class member functions,
11366 member classes, static data members and member templates.... */
11368 /* Some typedefs referenced from within the template code need to be access
11369 checked at template instantiation time, i.e now. These types were
11370 added to the template at parsing time. Let's get those and perform
11371 the access checks then. */
11372 perform_typedefs_access_check (pattern
, args
);
11373 perform_deferred_access_checks (tf_warning_or_error
);
11374 pop_nested_class ();
11375 maximum_field_alignment
= saved_maximum_field_alignment
;
11377 pop_from_top_level ();
11378 pop_tinst_level ();
11380 /* The vtable for a template class can be emitted in any translation
11381 unit in which the class is instantiated. When there is no key
11382 method, however, finish_struct_1 will already have added TYPE to
11383 the keyed_classes. */
11384 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
11385 vec_safe_push (keyed_classes
, type
);
11390 /* Wrapper for instantiate_class_template_1. */
11393 instantiate_class_template (tree type
)
11396 timevar_push (TV_TEMPLATE_INST
);
11397 ret
= instantiate_class_template_1 (type
);
11398 timevar_pop (TV_TEMPLATE_INST
);
11403 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11409 else if (TYPE_P (t
))
11410 r
= tsubst (t
, args
, complain
, in_decl
);
11413 if (!(complain
& tf_warning
))
11414 ++c_inhibit_evaluation_warnings
;
11415 r
= tsubst_expr (t
, args
, complain
, in_decl
,
11416 /*integral_constant_expression_p=*/true);
11417 if (!(complain
& tf_warning
))
11418 --c_inhibit_evaluation_warnings
;
11423 /* Given a function parameter pack TMPL_PARM and some function parameters
11424 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
11425 and set *SPEC_P to point at the next point in the list. */
11428 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
11430 /* Collect all of the extra "packed" parameters into an
11433 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
11434 tree spec_parm
= *spec_p
;
11437 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
11439 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
11442 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
11443 parmvec
= make_tree_vec (len
);
11444 spec_parm
= *spec_p
;
11445 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
11447 tree elt
= spec_parm
;
11448 if (DECL_PACK_P (elt
))
11449 elt
= make_pack_expansion (elt
);
11450 TREE_VEC_ELT (parmvec
, i
) = elt
;
11453 /* Build the argument packs. */
11454 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
11455 *spec_p
= spec_parm
;
11460 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
11461 NONTYPE_ARGUMENT_PACK. */
11464 make_fnparm_pack (tree spec_parm
)
11466 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
11469 /* Return 1 if the Ith element of the argument pack ARG_PACK is a
11470 pack expansion with no extra args, 2 if it has extra args, or 0
11471 if it is not a pack expansion. */
11474 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
11476 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
11477 if (i
>= TREE_VEC_LENGTH (vec
))
11479 tree elt
= TREE_VEC_ELT (vec
, i
);
11481 /* A decl pack is itself an expansion. */
11482 elt
= TREE_TYPE (elt
);
11483 if (!PACK_EXPANSION_P (elt
))
11485 if (PACK_EXPANSION_EXTRA_ARGS (elt
))
11491 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
11494 make_argument_pack_select (tree arg_pack
, unsigned index
)
11496 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
11498 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
11499 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
11504 /* This is a subroutine of tsubst_pack_expansion.
11506 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
11507 mechanism to store the (non complete list of) arguments of the
11508 substitution and return a non substituted pack expansion, in order
11509 to wait for when we have enough arguments to really perform the
11513 use_pack_expansion_extra_args_p (tree parm_packs
,
11515 bool has_empty_arg
)
11517 /* If one pack has an expansion and another pack has a normal
11518 argument or if one pack has an empty argument and an another
11519 one hasn't then tsubst_pack_expansion cannot perform the
11520 substitution and need to fall back on the
11521 PACK_EXPANSION_EXTRA mechanism. */
11522 if (parm_packs
== NULL_TREE
)
11524 else if (has_empty_arg
)
11527 bool has_expansion_arg
= false;
11528 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
11530 bool has_non_expansion_arg
= false;
11531 for (tree parm_pack
= parm_packs
;
11533 parm_pack
= TREE_CHAIN (parm_pack
))
11535 tree arg
= TREE_VALUE (parm_pack
);
11537 int exp
= argument_pack_element_is_expansion_p (arg
, i
);
11539 /* We can't substitute a pack expansion with extra args into
11543 has_expansion_arg
= true;
11545 has_non_expansion_arg
= true;
11548 if (has_expansion_arg
&& has_non_expansion_arg
)
11554 /* [temp.variadic]/6 says that:
11556 The instantiation of a pack expansion [...]
11557 produces a list E1,E2, ..., En, where N is the number of elements
11558 in the pack expansion parameters.
11560 This subroutine of tsubst_pack_expansion produces one of these Ei.
11562 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
11563 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
11564 PATTERN, and each TREE_VALUE is its corresponding argument pack.
11565 INDEX is the index 'i' of the element Ei to produce. ARGS,
11566 COMPLAIN, and IN_DECL are the same parameters as for the
11567 tsubst_pack_expansion function.
11569 The function returns the resulting Ei upon successful completion,
11570 or error_mark_node.
11572 Note that this function possibly modifies the ARGS parameter, so
11573 it's the responsibility of the caller to restore it. */
11576 gen_elem_of_pack_expansion_instantiation (tree pattern
,
11579 tree args
/* This parm gets
11581 tsubst_flags_t complain
,
11585 bool ith_elem_is_expansion
= false;
11587 /* For each parameter pack, change the substitution of the parameter
11588 pack to the ith argument in its argument pack, then expand the
11590 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
11592 tree parm
= TREE_PURPOSE (pack
);
11593 tree arg_pack
= TREE_VALUE (pack
);
11594 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
11596 ith_elem_is_expansion
|=
11597 argument_pack_element_is_expansion_p (arg_pack
, index
);
11599 /* Select the Ith argument from the pack. */
11600 if (TREE_CODE (parm
) == PARM_DECL
11602 || TREE_CODE (parm
) == FIELD_DECL
)
11606 aps
= make_argument_pack_select (arg_pack
, index
);
11607 if (!mark_used (parm
, complain
) && !(complain
& tf_error
))
11608 return error_mark_node
;
11609 register_local_specialization (aps
, parm
);
11612 aps
= retrieve_local_specialization (parm
);
11617 template_parm_level_and_index (parm
, &level
, &idx
);
11621 aps
= make_argument_pack_select (arg_pack
, index
);
11622 /* Update the corresponding argument. */
11623 TMPL_ARG (args
, level
, idx
) = aps
;
11626 /* Re-use the ARGUMENT_PACK_SELECT. */
11627 aps
= TMPL_ARG (args
, level
, idx
);
11629 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
11632 /* Substitute into the PATTERN with the (possibly altered)
11634 if (pattern
== in_decl
)
11635 /* Expanding a fixed parameter pack from
11636 coerce_template_parameter_pack. */
11637 t
= tsubst_decl (pattern
, args
, complain
);
11638 else if (pattern
== error_mark_node
)
11639 t
= error_mark_node
;
11640 else if (constraint_p (pattern
))
11642 if (processing_template_decl
)
11643 t
= tsubst_constraint (pattern
, args
, complain
, in_decl
);
11645 t
= (constraints_satisfied_p (pattern
, args
)
11646 ? boolean_true_node
: boolean_false_node
);
11648 else if (!TYPE_P (pattern
))
11649 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
11650 /*integral_constant_expression_p=*/false);
11652 t
= tsubst (pattern
, args
, complain
, in_decl
);
11654 /* If the Ith argument pack element is a pack expansion, then
11655 the Ith element resulting from the substituting is going to
11656 be a pack expansion as well. */
11657 if (ith_elem_is_expansion
)
11658 t
= make_pack_expansion (t
, complain
);
11663 /* When the unexpanded parameter pack in a fold expression expands to an empty
11664 sequence, the value of the expression is as follows; the program is
11665 ill-formed if the operator is not listed in this table.
11672 expand_empty_fold (tree t
, tsubst_flags_t complain
)
11674 tree_code code
= (tree_code
)TREE_INT_CST_LOW (TREE_OPERAND (t
, 0));
11675 if (!FOLD_EXPR_MODIFY_P (t
))
11678 case TRUTH_ANDIF_EXPR
:
11679 return boolean_true_node
;
11680 case TRUTH_ORIF_EXPR
:
11681 return boolean_false_node
;
11682 case COMPOUND_EXPR
:
11688 if (complain
& tf_error
)
11689 error_at (location_of (t
),
11690 "fold of empty expansion over %O", code
);
11691 return error_mark_node
;
11694 /* Given a fold-expression T and a current LEFT and RIGHT operand,
11695 form an expression that combines the two terms using the
11699 fold_expression (tree t
, tree left
, tree right
, tsubst_flags_t complain
)
11701 tree op
= FOLD_EXPR_OP (t
);
11702 tree_code code
= (tree_code
)TREE_INT_CST_LOW (op
);
11704 // Handle compound assignment operators.
11705 if (FOLD_EXPR_MODIFY_P (t
))
11706 return build_x_modify_expr (input_location
, left
, code
, right
, complain
);
11710 case COMPOUND_EXPR
:
11711 return build_x_compound_expr (input_location
, left
, right
, complain
);
11713 return build_m_component_ref (left
, right
, complain
);
11715 return build_x_binary_op (input_location
, code
,
11716 left
, TREE_CODE (left
),
11717 right
, TREE_CODE (right
),
11723 /* Substitute ARGS into the pack of a fold expression T. */
11726 tsubst_fold_expr_pack (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11728 return tsubst_pack_expansion (FOLD_EXPR_PACK (t
), args
, complain
, in_decl
);
11731 /* Substitute ARGS into the pack of a fold expression T. */
11734 tsubst_fold_expr_init (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11736 return tsubst_expr (FOLD_EXPR_INIT (t
), args
, complain
, in_decl
, false);
11739 /* Expand a PACK of arguments into a grouped as left fold.
11740 Given a pack containing elements A0, A1, ..., An and an
11741 operator @, this builds the expression:
11743 ((A0 @ A1) @ A2) ... @ An
11745 Note that PACK must not be empty.
11747 The operator is defined by the original fold expression T. */
11750 expand_left_fold (tree t
, tree pack
, tsubst_flags_t complain
)
11752 tree left
= TREE_VEC_ELT (pack
, 0);
11753 for (int i
= 1; i
< TREE_VEC_LENGTH (pack
); ++i
)
11755 tree right
= TREE_VEC_ELT (pack
, i
);
11756 left
= fold_expression (t
, left
, right
, complain
);
11761 /* Substitute into a unary left fold expression. */
11764 tsubst_unary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
11767 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
11768 if (pack
== error_mark_node
)
11769 return error_mark_node
;
11770 if (PACK_EXPANSION_P (pack
))
11772 tree r
= copy_node (t
);
11773 FOLD_EXPR_PACK (r
) = pack
;
11776 if (TREE_VEC_LENGTH (pack
) == 0)
11777 return expand_empty_fold (t
, complain
);
11779 return expand_left_fold (t
, pack
, complain
);
11782 /* Substitute into a binary left fold expression.
11784 Do ths by building a single (non-empty) vector of argumnts and
11785 building the expression from those elements. */
11788 tsubst_binary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
11791 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
11792 if (pack
== error_mark_node
)
11793 return error_mark_node
;
11794 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
11795 if (init
== error_mark_node
)
11796 return error_mark_node
;
11798 if (PACK_EXPANSION_P (pack
))
11800 tree r
= copy_node (t
);
11801 FOLD_EXPR_PACK (r
) = pack
;
11802 FOLD_EXPR_INIT (r
) = init
;
11806 tree vec
= make_tree_vec (TREE_VEC_LENGTH (pack
) + 1);
11807 TREE_VEC_ELT (vec
, 0) = init
;
11808 for (int i
= 0; i
< TREE_VEC_LENGTH (pack
); ++i
)
11809 TREE_VEC_ELT (vec
, i
+ 1) = TREE_VEC_ELT (pack
, i
);
11811 return expand_left_fold (t
, vec
, complain
);
11814 /* Expand a PACK of arguments into a grouped as right fold.
11815 Given a pack containing elementns A0, A1, ..., and an
11816 operator @, this builds the expression:
11818 A0@ ... (An-2 @ (An-1 @ An))
11820 Note that PACK must not be empty.
11822 The operator is defined by the original fold expression T. */
11825 expand_right_fold (tree t
, tree pack
, tsubst_flags_t complain
)
11827 // Build the expression.
11828 int n
= TREE_VEC_LENGTH (pack
);
11829 tree right
= TREE_VEC_ELT (pack
, n
- 1);
11830 for (--n
; n
!= 0; --n
)
11832 tree left
= TREE_VEC_ELT (pack
, n
- 1);
11833 right
= fold_expression (t
, left
, right
, complain
);
11838 /* Substitute into a unary right fold expression. */
11841 tsubst_unary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
11844 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
11845 if (pack
== error_mark_node
)
11846 return error_mark_node
;
11847 if (PACK_EXPANSION_P (pack
))
11849 tree r
= copy_node (t
);
11850 FOLD_EXPR_PACK (r
) = pack
;
11853 if (TREE_VEC_LENGTH (pack
) == 0)
11854 return expand_empty_fold (t
, complain
);
11856 return expand_right_fold (t
, pack
, complain
);
11859 /* Substitute into a binary right fold expression.
11861 Do ths by building a single (non-empty) vector of arguments and
11862 building the expression from those elements. */
11865 tsubst_binary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
11868 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
11869 if (pack
== error_mark_node
)
11870 return error_mark_node
;
11871 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
11872 if (init
== error_mark_node
)
11873 return error_mark_node
;
11875 if (PACK_EXPANSION_P (pack
))
11877 tree r
= copy_node (t
);
11878 FOLD_EXPR_PACK (r
) = pack
;
11879 FOLD_EXPR_INIT (r
) = init
;
11883 int n
= TREE_VEC_LENGTH (pack
);
11884 tree vec
= make_tree_vec (n
+ 1);
11885 for (int i
= 0; i
< n
; ++i
)
11886 TREE_VEC_ELT (vec
, i
) = TREE_VEC_ELT (pack
, i
);
11887 TREE_VEC_ELT (vec
, n
) = init
;
11889 return expand_right_fold (t
, vec
, complain
);
11892 /* Walk through the pattern of a pack expansion, adding everything in
11893 local_specializations to a list. */
11897 hash_set
<tree
> internal
;
11899 tsubst_flags_t complain
;
11901 el_data (tsubst_flags_t c
)
11902 : extra (NULL_TREE
), complain (c
) {}
11905 extract_locals_r (tree
*tp
, int */
*walk_subtrees*/
, void *data_
)
11907 el_data
&data
= *reinterpret_cast<el_data
*>(data_
);
11908 tree
*extra
= &data
.extra
;
11909 tsubst_flags_t complain
= data
.complain
;
11911 if (TYPE_P (*tp
) && typedef_variant_p (*tp
))
11912 /* Remember local typedefs (85214). */
11913 tp
= &TYPE_NAME (*tp
);
11915 if (TREE_CODE (*tp
) == DECL_EXPR
)
11916 data
.internal
.add (DECL_EXPR_DECL (*tp
));
11917 else if (tree spec
= retrieve_local_specialization (*tp
))
11919 if (data
.internal
.contains (*tp
))
11920 /* Don't mess with variables declared within the pattern. */
11922 if (TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
)
11924 /* Maybe pull out the PARM_DECL for a partial instantiation. */
11925 tree args
= ARGUMENT_PACK_ARGS (spec
);
11926 if (TREE_VEC_LENGTH (args
) == 1)
11928 tree elt
= TREE_VEC_ELT (args
, 0);
11929 if (PACK_EXPANSION_P (elt
))
11930 elt
= PACK_EXPANSION_PATTERN (elt
);
11931 if (DECL_PACK_P (elt
))
11934 if (TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
)
11936 /* Handle lambda capture here, since we aren't doing any
11937 substitution now, and so tsubst_copy won't call
11938 process_outer_var_ref. */
11939 tree args
= ARGUMENT_PACK_ARGS (spec
);
11940 int len
= TREE_VEC_LENGTH (args
);
11941 for (int i
= 0; i
< len
; ++i
)
11943 tree arg
= TREE_VEC_ELT (args
, i
);
11945 if (outer_automatic_var_p (arg
))
11946 carg
= process_outer_var_ref (arg
, complain
);
11949 /* Make a new NONTYPE_ARGUMENT_PACK of the capture
11953 spec
= copy_node (spec
);
11954 args
= copy_node (args
);
11955 SET_ARGUMENT_PACK_ARGS (spec
, args
);
11956 register_local_specialization (spec
, *tp
);
11958 TREE_VEC_ELT (args
, i
) = carg
;
11963 if (outer_automatic_var_p (spec
))
11964 spec
= process_outer_var_ref (spec
, complain
);
11965 *extra
= tree_cons (*tp
, spec
, *extra
);
11970 extract_local_specs (tree pattern
, tsubst_flags_t complain
)
11972 el_data
data (complain
);
11973 cp_walk_tree_without_duplicates (&pattern
, extract_locals_r
, &data
);
11977 /* Extract any uses of local_specializations from PATTERN and add them to ARGS
11978 for use in PACK_EXPANSION_EXTRA_ARGS. */
11981 build_extra_args (tree pattern
, tree args
, tsubst_flags_t complain
)
11984 if (local_specializations
)
11985 if (tree locals
= extract_local_specs (pattern
, complain
))
11986 extra
= tree_cons (NULL_TREE
, extra
, locals
);
11990 /* Apply any local specializations from PACK_EXPANSION_EXTRA_ARGS and add the
11991 normal template args to ARGS. */
11994 add_extra_args (tree extra
, tree args
)
11996 if (extra
&& TREE_CODE (extra
) == TREE_LIST
)
11998 for (tree elt
= TREE_CHAIN (extra
); elt
; elt
= TREE_CHAIN (elt
))
12000 /* The partial instantiation involved local declarations collected in
12001 extract_local_specs; map from the general template to our local
12003 tree gen
= TREE_PURPOSE (elt
);
12004 tree inst
= TREE_VALUE (elt
);
12006 if (tree local
= retrieve_local_specialization (inst
))
12008 /* else inst is already a full instantiation of the pack. */
12009 register_local_specialization (inst
, gen
);
12011 gcc_assert (!TREE_PURPOSE (extra
));
12012 extra
= TREE_VALUE (extra
);
12014 return add_to_template_args (extra
, args
);
12017 /* Substitute ARGS into T, which is an pack expansion
12018 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
12019 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
12020 (if only a partial substitution could be performed) or
12021 ERROR_MARK_NODE if there was an error. */
12023 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
12027 tree pack
, packs
= NULL_TREE
;
12028 bool unsubstituted_packs
= false;
12029 bool unsubstituted_fn_pack
= false;
12032 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
12033 bool need_local_specializations
= false;
12036 gcc_assert (PACK_EXPANSION_P (t
));
12037 pattern
= PACK_EXPANSION_PATTERN (t
);
12039 /* Add in any args remembered from an earlier partial instantiation. */
12040 args
= add_extra_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
12042 levels
= TMPL_ARGS_DEPTH (args
);
12044 /* Determine the argument packs that will instantiate the parameter
12045 packs used in the expansion expression. While we're at it,
12046 compute the number of arguments to be expanded and make sure it
12048 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
12049 pack
= TREE_CHAIN (pack
))
12051 tree parm_pack
= TREE_VALUE (pack
);
12052 tree arg_pack
= NULL_TREE
;
12053 tree orig_arg
= NULL_TREE
;
12056 if (TREE_CODE (parm_pack
) == BASES
)
12058 gcc_assert (parm_pack
== pattern
);
12059 if (BASES_DIRECT (parm_pack
))
12060 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
12065 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
12066 args
, complain
, in_decl
,
12069 else if (builtin_pack_call_p (parm_pack
))
12071 if (parm_pack
!= pattern
)
12073 if (complain
& tf_error
)
12074 sorry ("%qE is not the entire pattern of the pack expansion",
12076 return error_mark_node
;
12078 return expand_builtin_pack_call (parm_pack
, args
,
12079 complain
, in_decl
);
12081 else if (TREE_CODE (parm_pack
) == PARM_DECL
)
12083 /* We know we have correct local_specializations if this
12084 expansion is at function scope, or if we're dealing with a
12085 local parameter in a requires expression; for the latter,
12086 tsubst_requires_expr set it up appropriately. */
12087 if (PACK_EXPANSION_LOCAL_P (t
) || CONSTRAINT_VAR_P (parm_pack
))
12088 arg_pack
= retrieve_local_specialization (parm_pack
);
12090 /* We can't rely on local_specializations for a parameter
12091 name used later in a function declaration (such as in a
12092 late-specified return type). Even if it exists, it might
12093 have the wrong value for a recursive call. */
12094 need_local_specializations
= true;
12098 /* This parameter pack was used in an unevaluated context. Just
12099 make a dummy decl, since it's only used for its type. */
12100 ++cp_unevaluated_operand
;
12101 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
12102 --cp_unevaluated_operand
;
12103 if (arg_pack
&& DECL_PACK_P (arg_pack
))
12104 /* Partial instantiation of the parm_pack, we can't build
12105 up an argument pack yet. */
12106 arg_pack
= NULL_TREE
;
12108 arg_pack
= make_fnparm_pack (arg_pack
);
12110 else if (argument_pack_element_is_expansion_p (arg_pack
, 0))
12111 /* This argument pack isn't fully instantiated yet. We set this
12112 flag rather than clear arg_pack because we do want to do the
12113 optimization below, and we don't want to substitute directly
12114 into the pattern (as that would expose a NONTYPE_ARGUMENT_PACK
12115 where it isn't expected). */
12116 unsubstituted_fn_pack
= true;
12118 else if (is_normal_capture_proxy (parm_pack
))
12120 arg_pack
= retrieve_local_specialization (parm_pack
);
12121 if (argument_pack_element_is_expansion_p (arg_pack
, 0))
12122 unsubstituted_fn_pack
= true;
12127 template_parm_level_and_index (parm_pack
, &level
, &idx
);
12129 if (level
<= levels
)
12130 arg_pack
= TMPL_ARG (args
, level
, idx
);
12133 orig_arg
= arg_pack
;
12134 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
12135 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
12137 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
12138 /* This can only happen if we forget to expand an argument
12139 pack somewhere else. Just return an error, silently. */
12141 result
= make_tree_vec (1);
12142 TREE_VEC_ELT (result
, 0) = error_mark_node
;
12149 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
12151 /* Don't bother trying to do a partial substitution with
12152 incomplete packs; we'll try again after deduction. */
12153 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
12158 else if (len
!= my_len
12159 && !unsubstituted_fn_pack
)
12161 if (!(complain
& tf_error
))
12162 /* Fail quietly. */;
12163 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
12164 error ("mismatched argument pack lengths while expanding %qT",
12167 error ("mismatched argument pack lengths while expanding %qE",
12169 return error_mark_node
;
12172 /* Keep track of the parameter packs and their corresponding
12174 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
12175 TREE_TYPE (packs
) = orig_arg
;
12179 /* We can't substitute for this parameter pack. We use a flag as
12180 well as the missing_level counter because function parameter
12181 packs don't have a level. */
12182 gcc_assert (processing_template_decl
|| is_auto (parm_pack
));
12183 unsubstituted_packs
= true;
12187 /* If the expansion is just T..., return the matching argument pack, unless
12188 we need to call convert_from_reference on all the elements. This is an
12189 important optimization; see c++/68422. */
12190 if (!unsubstituted_packs
12191 && TREE_PURPOSE (packs
) == pattern
)
12193 tree args
= ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
12195 /* If the argument pack is a single pack expansion, pull it out. */
12196 if (TREE_VEC_LENGTH (args
) == 1
12197 && pack_expansion_args_count (args
))
12198 return TREE_VEC_ELT (args
, 0);
12200 /* Types need no adjustment, nor does sizeof..., and if we still have
12201 some pack expansion args we won't do anything yet. */
12202 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
12203 || PACK_EXPANSION_SIZEOF_P (t
)
12204 || pack_expansion_args_count (args
))
12206 /* Also optimize expression pack expansions if we can tell that the
12207 elements won't have reference type. */
12208 tree type
= TREE_TYPE (pattern
);
12209 if (type
&& !TYPE_REF_P (type
)
12210 && !PACK_EXPANSION_P (type
)
12211 && !WILDCARD_TYPE_P (type
))
12213 /* Otherwise use the normal path so we get convert_from_reference. */
12216 /* We cannot expand this expansion expression, because we don't have
12217 all of the argument packs we need. */
12218 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
12220 /* We got some full packs, but we can't substitute them in until we
12221 have values for all the packs. So remember these until then. */
12223 t
= make_pack_expansion (pattern
, complain
);
12224 PACK_EXPANSION_EXTRA_ARGS (t
)
12225 = build_extra_args (pattern
, args
, complain
);
12228 else if (unsubstituted_packs
)
12230 /* There were no real arguments, we're just replacing a parameter
12231 pack with another version of itself. Substitute into the
12232 pattern and return a PACK_EXPANSION_*. The caller will need to
12234 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
12235 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
12236 /*integral_constant_expression_p=*/false);
12238 t
= tsubst (pattern
, args
, complain
, in_decl
);
12239 t
= make_pack_expansion (t
, complain
);
12243 gcc_assert (len
>= 0);
12245 if (need_local_specializations
)
12247 /* We're in a late-specified return type, so create our own local
12248 specializations map; the current map is either NULL or (in the
12249 case of recursive unification) might have bindings that we don't
12250 want to use or alter. */
12251 saved_local_specializations
= local_specializations
;
12252 local_specializations
= new hash_map
<tree
, tree
>;
12255 /* For each argument in each argument pack, substitute into the
12257 result
= make_tree_vec (len
);
12258 tree elem_args
= copy_template_args (args
);
12259 for (i
= 0; i
< len
; ++i
)
12261 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
12263 elem_args
, complain
,
12265 TREE_VEC_ELT (result
, i
) = t
;
12266 if (t
== error_mark_node
)
12268 result
= error_mark_node
;
12273 /* Update ARGS to restore the substitution from parameter packs to
12274 their argument packs. */
12275 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
12277 tree parm
= TREE_PURPOSE (pack
);
12279 if (TREE_CODE (parm
) == PARM_DECL
12281 || TREE_CODE (parm
) == FIELD_DECL
)
12282 register_local_specialization (TREE_TYPE (pack
), parm
);
12287 if (TREE_VALUE (pack
) == NULL_TREE
)
12290 template_parm_level_and_index (parm
, &level
, &idx
);
12292 /* Update the corresponding argument. */
12293 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
12294 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
12297 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
12301 if (need_local_specializations
)
12303 delete local_specializations
;
12304 local_specializations
= saved_local_specializations
;
12307 /* If the dependent pack arguments were such that we end up with only a
12308 single pack expansion again, there's no need to keep it in a TREE_VEC. */
12309 if (len
== 1 && TREE_CODE (result
) == TREE_VEC
12310 && PACK_EXPANSION_P (TREE_VEC_ELT (result
, 0)))
12311 return TREE_VEC_ELT (result
, 0);
12316 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
12317 TMPL. We do this using DECL_PARM_INDEX, which should work even with
12318 parameter packs; all parms generated from a function parameter pack will
12319 have the same DECL_PARM_INDEX. */
12322 get_pattern_parm (tree parm
, tree tmpl
)
12324 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
12327 if (DECL_ARTIFICIAL (parm
))
12329 for (patparm
= DECL_ARGUMENTS (pattern
);
12330 patparm
; patparm
= DECL_CHAIN (patparm
))
12331 if (DECL_ARTIFICIAL (patparm
)
12332 && DECL_NAME (parm
) == DECL_NAME (patparm
))
12337 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
12338 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
12339 gcc_assert (DECL_PARM_INDEX (patparm
)
12340 == DECL_PARM_INDEX (parm
));
12346 /* Make an argument pack out of the TREE_VEC VEC. */
12349 make_argument_pack (tree vec
)
12352 tree elt
= TREE_VEC_ELT (vec
, 0);
12354 pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
12357 pack
= make_node (NONTYPE_ARGUMENT_PACK
);
12358 TREE_CONSTANT (pack
) = 1;
12360 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
12364 /* Return an exact copy of template args T that can be modified
12368 copy_template_args (tree t
)
12370 if (t
== error_mark_node
)
12373 int len
= TREE_VEC_LENGTH (t
);
12374 tree new_vec
= make_tree_vec (len
);
12376 for (int i
= 0; i
< len
; ++i
)
12378 tree elt
= TREE_VEC_ELT (t
, i
);
12379 if (elt
&& TREE_CODE (elt
) == TREE_VEC
)
12380 elt
= copy_template_args (elt
);
12381 TREE_VEC_ELT (new_vec
, i
) = elt
;
12384 NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_vec
)
12385 = NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
);
12390 /* Substitute ARGS into the vector or list of template arguments T. */
12393 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12396 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
12399 if (t
== error_mark_node
)
12400 return error_mark_node
;
12402 len
= TREE_VEC_LENGTH (t
);
12403 elts
= XALLOCAVEC (tree
, len
);
12405 for (i
= 0; i
< len
; i
++)
12407 tree orig_arg
= TREE_VEC_ELT (t
, i
);
12410 if (TREE_CODE (orig_arg
) == TREE_VEC
)
12411 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
12412 else if (PACK_EXPANSION_P (orig_arg
))
12414 /* Substitute into an expansion expression. */
12415 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
12417 if (TREE_CODE (new_arg
) == TREE_VEC
)
12418 /* Add to the expanded length adjustment the number of
12419 expanded arguments. We subtract one from this
12420 measurement, because the argument pack expression
12421 itself is already counted as 1 in
12422 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
12423 the argument pack is empty. */
12424 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
12426 else if (ARGUMENT_PACK_P (orig_arg
))
12428 /* Substitute into each of the arguments. */
12429 new_arg
= TYPE_P (orig_arg
)
12430 ? cxx_make_type (TREE_CODE (orig_arg
))
12431 : make_node (TREE_CODE (orig_arg
));
12433 tree pack_args
= tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
12434 args
, complain
, in_decl
);
12435 if (pack_args
== error_mark_node
)
12436 new_arg
= error_mark_node
;
12438 SET_ARGUMENT_PACK_ARGS (new_arg
, pack_args
);
12440 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
)
12441 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
12444 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
12446 if (new_arg
== error_mark_node
)
12447 return error_mark_node
;
12450 if (new_arg
!= orig_arg
)
12457 /* Make space for the expanded arguments coming from template
12459 t
= make_tree_vec (len
+ expanded_len_adjust
);
12460 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
12461 arguments for a member template.
12462 In that case each TREE_VEC in ORIG_T represents a level of template
12463 arguments, and ORIG_T won't carry any non defaulted argument count.
12464 It will rather be the nested TREE_VECs that will carry one.
12465 In other words, ORIG_T carries a non defaulted argument count only
12466 if it doesn't contain any nested TREE_VEC. */
12467 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
12469 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
12470 count
+= expanded_len_adjust
;
12471 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
12473 for (i
= 0, out
= 0; i
< len
; i
++)
12475 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
12476 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
12477 && TREE_CODE (elts
[i
]) == TREE_VEC
)
12481 /* Now expand the template argument pack "in place". */
12482 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
12483 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
12487 TREE_VEC_ELT (t
, out
) = elts
[i
];
12495 /* Substitute ARGS into one level PARMS of template parameters. */
12498 tsubst_template_parms_level (tree parms
, tree args
, tsubst_flags_t complain
)
12500 if (parms
== error_mark_node
)
12501 return error_mark_node
;
12503 tree new_vec
= make_tree_vec (TREE_VEC_LENGTH (parms
));
12505 for (int i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
12507 tree tuple
= TREE_VEC_ELT (parms
, i
);
12509 if (tuple
== error_mark_node
)
12512 TREE_VEC_ELT (new_vec
, i
) =
12513 tsubst_template_parm (tuple
, args
, complain
);
12519 /* Return the result of substituting ARGS into the template parameters
12520 given by PARMS. If there are m levels of ARGS and m + n levels of
12521 PARMS, then the result will contain n levels of PARMS. For
12522 example, if PARMS is `template <class T> template <class U>
12523 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
12524 result will be `template <int*, double, class V>'. */
12527 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
12529 tree r
= NULL_TREE
;
12532 /* When substituting into a template, we must set
12533 PROCESSING_TEMPLATE_DECL as the template parameters may be
12534 dependent if they are based on one-another, and the dependency
12535 predicates are short-circuit outside of templates. */
12536 ++processing_template_decl
;
12538 for (new_parms
= &r
;
12539 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
12540 new_parms
= &(TREE_CHAIN (*new_parms
)),
12541 parms
= TREE_CHAIN (parms
))
12543 tree new_vec
= tsubst_template_parms_level (TREE_VALUE (parms
),
12546 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
12547 - TMPL_ARGS_DEPTH (args
)),
12548 new_vec
, NULL_TREE
);
12551 --processing_template_decl
;
12556 /* Return the result of substituting ARGS into one template parameter
12557 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
12558 parameter and which TREE_PURPOSE is the default argument of the
12559 template parameter. */
12562 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
12564 tree default_value
, parm_decl
;
12566 if (args
== NULL_TREE
12568 || t
== error_mark_node
)
12571 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
12573 default_value
= TREE_PURPOSE (t
);
12574 parm_decl
= TREE_VALUE (t
);
12576 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
12577 if (TREE_CODE (parm_decl
) == PARM_DECL
12578 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
12579 parm_decl
= error_mark_node
;
12580 default_value
= tsubst_template_arg (default_value
, args
,
12581 complain
, NULL_TREE
);
12583 return build_tree_list (default_value
, parm_decl
);
12586 /* Substitute the ARGS into the indicated aggregate (or enumeration)
12587 type T. If T is not an aggregate or enumeration type, it is
12588 handled as if by tsubst. IN_DECL is as for tsubst. If
12589 ENTERING_SCOPE is nonzero, T is the context for a template which
12590 we are presently tsubst'ing. Return the substituted value. */
12593 tsubst_aggr_type (tree t
,
12595 tsubst_flags_t complain
,
12597 int entering_scope
)
12599 if (t
== NULL_TREE
)
12602 switch (TREE_CODE (t
))
12605 if (TYPE_PTRMEMFUNC_P (t
))
12606 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
12608 /* Fall through. */
12609 case ENUMERAL_TYPE
:
12611 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
12616 int saved_unevaluated_operand
;
12617 int saved_inhibit_evaluation_warnings
;
12619 /* In "sizeof(X<I>)" we need to evaluate "I". */
12620 saved_unevaluated_operand
= cp_unevaluated_operand
;
12621 cp_unevaluated_operand
= 0;
12622 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
12623 c_inhibit_evaluation_warnings
= 0;
12625 /* First, determine the context for the type we are looking
12627 context
= TYPE_CONTEXT (t
);
12628 if (context
&& TYPE_P (context
))
12630 context
= tsubst_aggr_type (context
, args
, complain
,
12631 in_decl
, /*entering_scope=*/1);
12632 /* If context is a nested class inside a class template,
12633 it may still need to be instantiated (c++/33959). */
12634 context
= complete_type (context
);
12637 /* Then, figure out what arguments are appropriate for the
12638 type we are trying to find. For example, given:
12640 template <class T> struct S;
12641 template <class T, class U> void f(T, U) { S<U> su; }
12643 and supposing that we are instantiating f<int, double>,
12644 then our ARGS will be {int, double}, but, when looking up
12645 S we only want {double}. */
12646 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
12647 complain
, in_decl
);
12648 if (argvec
== error_mark_node
)
12649 r
= error_mark_node
;
12652 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
12653 entering_scope
, complain
);
12654 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
12657 cp_unevaluated_operand
= saved_unevaluated_operand
;
12658 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
12663 /* This is not a template type, so there's nothing to do. */
12667 return tsubst (t
, args
, complain
, in_decl
);
12671 static GTY((cache
)) tree_cache_map
*defarg_inst
;
12673 /* Substitute into the default argument ARG (a default argument for
12674 FN), which has the indicated TYPE. */
12677 tsubst_default_argument (tree fn
, int parmnum
, tree type
, tree arg
,
12678 tsubst_flags_t complain
)
12680 int errs
= errorcount
+ sorrycount
;
12682 /* This can happen in invalid code. */
12683 if (TREE_CODE (arg
) == DEFAULT_ARG
)
12686 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
12687 parm
= chain_index (parmnum
, parm
);
12688 tree parmtype
= TREE_TYPE (parm
);
12689 if (DECL_BY_REFERENCE (parm
))
12690 parmtype
= TREE_TYPE (parmtype
);
12691 if (parmtype
== error_mark_node
)
12692 return error_mark_node
;
12694 gcc_assert (same_type_ignoring_top_level_qualifiers_p (type
, parmtype
));
12697 if (defarg_inst
&& (slot
= defarg_inst
->get (parm
)))
12700 /* This default argument came from a template. Instantiate the
12701 default argument here, not in tsubst. In the case of
12710 we must be careful to do name lookup in the scope of S<T>,
12711 rather than in the current class. */
12712 push_to_top_level ();
12713 push_access_scope (fn
);
12714 start_lambda_scope (parm
);
12716 /* The default argument expression may cause implicitly defined
12717 member functions to be synthesized, which will result in garbage
12718 collection. We must treat this situation as if we were within
12719 the body of function so as to avoid collecting live data on the
12722 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
12723 complain
, NULL_TREE
,
12724 /*integral_constant_expression_p=*/false);
12727 finish_lambda_scope ();
12729 if (errorcount
+sorrycount
> errs
12730 && (complain
& tf_warning_or_error
))
12731 inform (input_location
,
12732 " when instantiating default argument for call to %qD", fn
);
12734 /* Make sure the default argument is reasonable. */
12735 arg
= check_default_argument (type
, arg
, complain
);
12737 pop_access_scope (fn
);
12738 pop_from_top_level ();
12740 if (arg
!= error_mark_node
&& !cp_unevaluated_operand
)
12743 defarg_inst
= tree_cache_map::create_ggc (37);
12744 defarg_inst
->put (parm
, arg
);
12750 /* Substitute into all the default arguments for FN. */
12753 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
12758 tmpl_args
= DECL_TI_ARGS (fn
);
12760 /* If this function is not yet instantiated, we certainly don't need
12761 its default arguments. */
12762 if (uses_template_parms (tmpl_args
))
12764 /* Don't do this again for clones. */
12765 if (DECL_CLONED_FUNCTION_P (fn
))
12769 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
12771 arg
= TREE_CHAIN (arg
), ++i
)
12772 if (TREE_PURPOSE (arg
))
12773 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
, i
,
12775 TREE_PURPOSE (arg
),
12779 /* Subroutine of tsubst_decl for the case when T is a FUNCTION_DECL. */
12782 tsubst_function_decl (tree t
, tree args
, tsubst_flags_t complain
,
12783 tree lambda_fntype
)
12785 tree gen_tmpl
, argvec
;
12786 hashval_t hash
= 0;
12789 /* Nobody should be tsubst'ing into non-template functions. */
12790 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
12792 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
12794 /* If T is not dependent, just return it. */
12795 if (!uses_template_parms (DECL_TI_ARGS (t
)))
12798 /* Calculate the most general template of which R is a
12800 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
12802 /* We're substituting a lambda function under tsubst_lambda_expr but not
12803 directly from it; find the matching function we're already inside.
12804 But don't do this if T is a generic lambda with a single level of
12805 template parms, as in that case we're doing a normal instantiation. */
12806 if (LAMBDA_FUNCTION_P (t
) && !lambda_fntype
12807 && (!generic_lambda_fn_p (t
)
12808 || TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
)) > 1))
12809 return enclosing_instantiation_of (t
);
12811 /* Calculate the complete set of arguments used to
12813 argvec
= tsubst_template_args (DECL_TI_ARGS
12814 (DECL_TEMPLATE_RESULT
12815 (DECL_TI_TEMPLATE (t
))),
12816 args
, complain
, in_decl
);
12817 if (argvec
== error_mark_node
)
12818 return error_mark_node
;
12820 /* Check to see if we already have this specialization. */
12821 if (!lambda_fntype
)
12823 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
12824 if (tree spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
))
12828 /* We can see more levels of arguments than parameters if
12829 there was a specialization of a member template, like
12832 template <class T> struct S { template <class U> void f(); }
12833 template <> template <class U> void S<int>::f(U);
12835 Here, we'll be substituting into the specialization,
12836 because that's where we can find the code we actually
12837 want to generate, but we'll have enough arguments for
12838 the most general template.
12840 We also deal with the peculiar case:
12842 template <class T> struct S {
12843 template <class U> friend void f();
12845 template <class U> void f() {}
12847 template void f<double>();
12849 Here, the ARGS for the instantiation of will be {int,
12850 double}. But, we only need as many ARGS as there are
12851 levels of template parameters in CODE_PATTERN. We are
12852 careful not to get fooled into reducing the ARGS in
12855 template <class T> struct S { template <class U> void f(U); }
12856 template <class T> template <> void S<T>::f(int) {}
12858 which we can spot because the pattern will be a
12859 specialization in this case. */
12860 int args_depth
= TMPL_ARGS_DEPTH (args
);
12862 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
12864 if (args_depth
> parms_depth
&& !DECL_TEMPLATE_SPECIALIZATION (t
))
12865 args
= get_innermost_template_args (args
, parms_depth
);
12869 /* This special case arises when we have something like this:
12871 template <class T> struct S {
12872 friend void f<int>(int, double);
12875 Here, the DECL_TI_TEMPLATE for the friend declaration
12876 will be an IDENTIFIER_NODE. We are being called from
12877 tsubst_friend_function, and we want only to create a
12878 new decl (R) with appropriate types so that we can call
12879 determine_specialization. */
12880 gen_tmpl
= NULL_TREE
;
12881 argvec
= NULL_TREE
;
12884 tree closure
= (lambda_fntype
? TYPE_METHOD_BASETYPE (lambda_fntype
)
12886 tree ctx
= closure
? closure
: DECL_CONTEXT (t
);
12887 bool member
= ctx
&& TYPE_P (ctx
);
12889 if (member
&& !closure
)
12890 ctx
= tsubst_aggr_type (ctx
, args
,
12891 complain
, t
, /*entering_scope=*/1);
12893 tree type
= (lambda_fntype
? lambda_fntype
12894 : tsubst (TREE_TYPE (t
), args
,
12895 complain
| tf_fndecl_type
, in_decl
));
12896 if (type
== error_mark_node
)
12897 return error_mark_node
;
12899 /* If we hit excessive deduction depth, the type is bogus even if
12900 it isn't error_mark_node, so don't build a decl. */
12901 if (excessive_deduction_depth
)
12902 return error_mark_node
;
12904 /* We do NOT check for matching decls pushed separately at this
12905 point, as they may not represent instantiations of this
12906 template, and in any case are considered separate under the
12908 tree r
= copy_decl (t
);
12909 DECL_USE_TEMPLATE (r
) = 0;
12910 TREE_TYPE (r
) = type
;
12911 /* Clear out the mangled name and RTL for the instantiation. */
12912 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
12913 SET_DECL_RTL (r
, NULL
);
12914 /* Leave DECL_INITIAL set on deleted instantiations. */
12915 if (!DECL_DELETED_FN (r
))
12916 DECL_INITIAL (r
) = NULL_TREE
;
12917 DECL_CONTEXT (r
) = ctx
;
12919 /* OpenMP UDRs have the only argument a reference to the declared
12920 type. We want to diagnose if the declared type is a reference,
12921 which is invalid, but as references to references are usually
12922 quietly merged, diagnose it here. */
12923 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
12926 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
12927 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
12928 if (TYPE_REF_P (argtype
))
12929 error_at (DECL_SOURCE_LOCATION (t
),
12930 "reference type %qT in "
12931 "%<#pragma omp declare reduction%>", argtype
);
12932 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
12933 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
12937 if (member
&& DECL_CONV_FN_P (r
))
12938 /* Type-conversion operator. Reconstruct the name, in
12939 case it's the name of one of the template's parameters. */
12940 DECL_NAME (r
) = make_conv_op_name (TREE_TYPE (type
));
12942 tree parms
= DECL_ARGUMENTS (t
);
12944 parms
= DECL_CHAIN (parms
);
12945 parms
= tsubst (parms
, args
, complain
, t
);
12946 for (tree parm
= parms
; parm
; parm
= DECL_CHAIN (parm
))
12947 DECL_CONTEXT (parm
) = r
;
12950 tree tparm
= build_this_parm (r
, closure
, type_memfn_quals (type
));
12951 DECL_CHAIN (tparm
) = parms
;
12954 DECL_ARGUMENTS (r
) = parms
;
12955 DECL_RESULT (r
) = NULL_TREE
;
12957 TREE_STATIC (r
) = 0;
12958 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
12959 DECL_EXTERNAL (r
) = 1;
12960 /* If this is an instantiation of a function with internal
12961 linkage, we already know what object file linkage will be
12962 assigned to the instantiation. */
12963 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
12964 DECL_DEFER_OUTPUT (r
) = 0;
12965 DECL_CHAIN (r
) = NULL_TREE
;
12966 DECL_PENDING_INLINE_INFO (r
) = 0;
12967 DECL_PENDING_INLINE_P (r
) = 0;
12968 DECL_SAVED_TREE (r
) = NULL_TREE
;
12969 DECL_STRUCT_FUNCTION (r
) = NULL
;
12971 /* We'll re-clone as appropriate in instantiate_template. */
12972 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
12974 /* If we aren't complaining now, return on error before we register
12975 the specialization so that we'll complain eventually. */
12976 if ((complain
& tf_error
) == 0
12977 && IDENTIFIER_ANY_OP_P (DECL_NAME (r
))
12978 && !grok_op_properties (r
, /*complain=*/false))
12979 return error_mark_node
;
12981 /* When instantiating a constrained member, substitute
12982 into the constraints to create a new constraint. */
12983 if (tree ci
= get_constraints (t
))
12986 ci
= tsubst_constraint_info (ci
, argvec
, complain
, NULL_TREE
);
12987 set_constraints (r
, ci
);
12990 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
12991 this in the special friend case mentioned above where
12992 GEN_TMPL is NULL. */
12993 if (gen_tmpl
&& !closure
)
12995 DECL_TEMPLATE_INFO (r
)
12996 = build_template_info (gen_tmpl
, argvec
);
12997 SET_DECL_IMPLICIT_INSTANTIATION (r
);
13000 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
13002 /* We instantiated this while substituting into
13003 the type earlier (template/friend54.C). */
13006 /* We're not supposed to instantiate default arguments
13007 until they are called, for a template. But, for a
13010 template <class T> void f ()
13011 { extern void g(int i = T()); }
13013 we should do the substitution when the template is
13014 instantiated. We handle the member function case in
13015 instantiate_class_template since the default arguments
13016 might refer to other members of the class. */
13018 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
13019 && !uses_template_parms (argvec
))
13020 tsubst_default_arguments (r
, complain
);
13023 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
13025 /* Copy the list of befriending classes. */
13026 for (tree
*friends
= &DECL_BEFRIENDING_CLASSES (r
);
13028 friends
= &TREE_CHAIN (*friends
))
13030 *friends
= copy_node (*friends
);
13031 TREE_VALUE (*friends
)
13032 = tsubst (TREE_VALUE (*friends
), args
, complain
, in_decl
);
13035 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
13037 maybe_retrofit_in_chrg (r
);
13038 if (DECL_CONSTRUCTOR_P (r
) && !grok_ctor_properties (ctx
, r
))
13039 return error_mark_node
;
13040 /* If this is an instantiation of a member template, clone it.
13041 If it isn't, that'll be handled by
13042 clone_constructors_and_destructors. */
13043 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
13044 clone_function_decl (r
, /*update_methods=*/false);
13046 else if ((complain
& tf_error
) != 0
13047 && IDENTIFIER_ANY_OP_P (DECL_NAME (r
))
13048 && !grok_op_properties (r
, /*complain=*/true))
13049 return error_mark_node
;
13051 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
13052 SET_DECL_FRIEND_CONTEXT (r
,
13053 tsubst (DECL_FRIEND_CONTEXT (t
),
13054 args
, complain
, in_decl
));
13056 /* Possibly limit visibility based on template args. */
13057 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
13058 if (DECL_VISIBILITY_SPECIFIED (t
))
13060 DECL_VISIBILITY_SPECIFIED (r
) = 0;
13061 DECL_ATTRIBUTES (r
)
13062 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
13064 determine_visibility (r
);
13065 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
13066 && !processing_template_decl
)
13067 defaulted_late_check (r
);
13069 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
13070 args
, complain
, in_decl
);
13074 /* Subroutine of tsubst_decl for the case when T is a TEMPLATE_DECL. */
13077 tsubst_template_decl (tree t
, tree args
, tsubst_flags_t complain
,
13078 tree lambda_fntype
)
13080 /* We can get here when processing a member function template,
13081 member class template, or template template parameter. */
13082 tree decl
= DECL_TEMPLATE_RESULT (t
);
13088 hashval_t hash
= 0;
13090 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
13092 /* Template template parameter is treated here. */
13093 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13094 if (new_type
== error_mark_node
)
13095 r
= error_mark_node
;
13096 /* If we get a real template back, return it. This can happen in
13097 the context of most_specialized_partial_spec. */
13098 else if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
13101 /* The new TEMPLATE_DECL was built in
13102 reduce_template_parm_level. */
13103 r
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (new_type
);
13107 if (!lambda_fntype
)
13109 /* We might already have an instance of this template.
13110 The ARGS are for the surrounding class type, so the
13111 full args contain the tsubst'd args for the context,
13112 plus the innermost args from the template decl. */
13113 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
13114 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
13115 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
13116 /* Because this is a template, the arguments will still be
13117 dependent, even after substitution. If
13118 PROCESSING_TEMPLATE_DECL is not set, the dependency
13119 predicates will short-circuit. */
13120 ++processing_template_decl
;
13121 full_args
= tsubst_template_args (tmpl_args
, args
,
13122 complain
, in_decl
);
13123 --processing_template_decl
;
13124 if (full_args
== error_mark_node
)
13125 return error_mark_node
;
13127 /* If this is a default template template argument,
13128 tsubst might not have changed anything. */
13129 if (full_args
== tmpl_args
)
13132 hash
= hash_tmpl_and_args (t
, full_args
);
13133 spec
= retrieve_specialization (t
, full_args
, hash
);
13134 if (spec
!= NULL_TREE
)
13138 /* Make a new template decl. It will be similar to the
13139 original, but will record the current template arguments.
13140 We also create a new function declaration, which is just
13141 like the old one, but points to this new template, rather
13142 than the old one. */
13144 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
13145 DECL_CHAIN (r
) = NULL_TREE
;
13147 // Build new template info linking to the original template decl.
13148 if (!lambda_fntype
)
13150 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
13151 SET_DECL_IMPLICIT_INSTANTIATION (r
);
13154 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
13156 /* The template parameters for this new template are all the
13157 template parameters for the old template, except the
13158 outermost level of parameters. */
13159 DECL_TEMPLATE_PARMS (r
)
13160 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
13163 if (TREE_CODE (decl
) == TYPE_DECL
13164 && !TYPE_DECL_ALIAS_P (decl
))
13167 ++processing_template_decl
;
13168 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13169 --processing_template_decl
;
13170 if (new_type
== error_mark_node
)
13171 return error_mark_node
;
13173 TREE_TYPE (r
) = new_type
;
13174 /* For a partial specialization, we need to keep pointing to
13175 the primary template. */
13176 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
13177 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
13178 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
13179 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
13180 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
13185 ++processing_template_decl
;
13186 if (TREE_CODE (decl
) == FUNCTION_DECL
)
13187 new_decl
= tsubst_function_decl (decl
, args
, complain
, lambda_fntype
);
13189 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
13190 --processing_template_decl
;
13191 if (new_decl
== error_mark_node
)
13192 return error_mark_node
;
13194 DECL_TEMPLATE_RESULT (r
) = new_decl
;
13195 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
13196 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
13199 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (r
));
13200 DECL_TEMPLATE_INFO (new_decl
) = build_template_info (r
, args
);
13204 DECL_TI_TEMPLATE (new_decl
) = r
;
13205 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
13209 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
13210 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
13212 if (PRIMARY_TEMPLATE_P (t
))
13213 DECL_PRIMARY_TEMPLATE (r
) = r
;
13215 if (TREE_CODE (decl
) != TYPE_DECL
&& !VAR_P (decl
)
13217 /* Record this non-type partial instantiation. */
13218 register_specialization (r
, t
,
13219 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
13225 /* True if FN is the op() for a lambda in an uninstantiated template. */
13228 lambda_fn_in_template_p (tree fn
)
13230 if (!fn
|| !LAMBDA_FUNCTION_P (fn
))
13232 tree closure
= DECL_CONTEXT (fn
);
13233 return CLASSTYPE_TEMPLATE_INFO (closure
) != NULL_TREE
;
13236 /* We're instantiating a variable from template function TCTX. Return the
13237 corresponding current enclosing scope. This gets complicated because lambda
13238 functions in templates are regenerated rather than instantiated, but generic
13239 lambda functions are subsequently instantiated. */
13242 enclosing_instantiation_of (tree otctx
)
13245 tree fn
= current_function_decl
;
13246 int lambda_count
= 0;
13248 for (; tctx
&& lambda_fn_in_template_p (tctx
);
13249 tctx
= decl_function_context (tctx
))
13251 for (; fn
; fn
= decl_function_context (fn
))
13254 int flambda_count
= 0;
13255 for (; flambda_count
< lambda_count
&& fn
&& LAMBDA_FUNCTION_P (fn
);
13256 fn
= decl_function_context (fn
))
13258 if ((fn
&& DECL_TEMPLATE_INFO (fn
))
13259 ? most_general_template (fn
) != most_general_template (tctx
)
13262 gcc_assert (DECL_NAME (ofn
) == DECL_NAME (otctx
)
13263 || DECL_CONV_FN_P (ofn
));
13266 gcc_unreachable ();
13269 /* Substitute the ARGS into the T, which is a _DECL. Return the
13270 result of the substitution. Issue error and warning messages under
13271 control of COMPLAIN. */
13274 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
13276 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
13277 location_t saved_loc
;
13278 tree r
= NULL_TREE
;
13280 hashval_t hash
= 0;
13282 /* Set the filename and linenumber to improve error-reporting. */
13283 saved_loc
= input_location
;
13284 input_location
= DECL_SOURCE_LOCATION (t
);
13286 switch (TREE_CODE (t
))
13288 case TEMPLATE_DECL
:
13289 r
= tsubst_template_decl (t
, args
, complain
, /*lambda*/NULL_TREE
);
13292 case FUNCTION_DECL
:
13293 r
= tsubst_function_decl (t
, args
, complain
, /*lambda*/NULL_TREE
);
13298 tree type
= NULL_TREE
;
13300 tree expanded_types
= NULL_TREE
;
13301 tree prev_r
= NULL_TREE
;
13302 tree first_r
= NULL_TREE
;
13304 if (DECL_PACK_P (t
))
13306 /* If there is a local specialization that isn't a
13307 parameter pack, it means that we're doing a "simple"
13308 substitution from inside tsubst_pack_expansion. Just
13309 return the local specialization (which will be a single
13311 tree spec
= retrieve_local_specialization (t
);
13313 && TREE_CODE (spec
) == PARM_DECL
13314 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
13317 /* Expand the TYPE_PACK_EXPANSION that provides the types for
13318 the parameters in this function parameter pack. */
13319 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
13320 complain
, in_decl
);
13321 if (TREE_CODE (expanded_types
) == TREE_VEC
)
13323 len
= TREE_VEC_LENGTH (expanded_types
);
13325 /* Zero-length parameter packs are boring. Just substitute
13328 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
13333 /* All we did was update the type. Make a note of that. */
13334 type
= expanded_types
;
13335 expanded_types
= NULL_TREE
;
13339 /* Loop through all of the parameters we'll build. When T is
13340 a function parameter pack, LEN is the number of expanded
13341 types in EXPANDED_TYPES; otherwise, LEN is 1. */
13343 for (i
= 0; i
< len
; ++i
)
13347 if (DECL_TEMPLATE_PARM_P (t
))
13348 SET_DECL_TEMPLATE_PARM_P (r
);
13350 if (expanded_types
)
13351 /* We're on the Ith parameter of the function parameter
13354 /* Get the Ith type. */
13355 type
= TREE_VEC_ELT (expanded_types
, i
);
13357 /* Rename the parameter to include the index. */
13359 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
13362 /* We're dealing with a normal parameter. */
13363 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13365 type
= type_decays_to (type
);
13366 TREE_TYPE (r
) = type
;
13367 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
13369 if (DECL_INITIAL (r
))
13371 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
13372 DECL_INITIAL (r
) = TREE_TYPE (r
);
13374 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
13375 complain
, in_decl
);
13378 DECL_CONTEXT (r
) = NULL_TREE
;
13380 if (!DECL_TEMPLATE_PARM_P (r
))
13381 DECL_ARG_TYPE (r
) = type_passed_as (type
);
13383 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
13384 args
, complain
, in_decl
);
13386 /* Keep track of the first new parameter we
13387 generate. That's what will be returned to the
13392 /* Build a proper chain of parameters when substituting
13393 into a function parameter pack. */
13395 DECL_CHAIN (prev_r
) = r
;
13398 /* If cp_unevaluated_operand is set, we're just looking for a
13399 single dummy parameter, so don't keep going. */
13400 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
13401 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
13402 complain
, DECL_CHAIN (t
));
13404 /* FIRST_R contains the start of the chain we've built. */
13411 tree type
= NULL_TREE
;
13412 tree vec
= NULL_TREE
;
13413 tree expanded_types
= NULL_TREE
;
13416 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
13418 /* This field is a lambda capture pack. Return a TREE_VEC of
13419 the expanded fields to instantiate_class_template_1. */
13420 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
13421 complain
, in_decl
);
13422 if (TREE_CODE (expanded_types
) == TREE_VEC
)
13424 len
= TREE_VEC_LENGTH (expanded_types
);
13425 vec
= make_tree_vec (len
);
13429 /* All we did was update the type. Make a note of that. */
13430 type
= expanded_types
;
13431 expanded_types
= NULL_TREE
;
13435 for (int i
= 0; i
< len
; ++i
)
13438 if (expanded_types
)
13440 type
= TREE_VEC_ELT (expanded_types
, i
);
13442 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
13445 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13447 if (type
== error_mark_node
)
13448 RETURN (error_mark_node
);
13449 TREE_TYPE (r
) = type
;
13450 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
13452 if (DECL_C_BIT_FIELD (r
))
13453 /* For bit-fields, DECL_BIT_FIELD_REPRESENTATIVE gives the
13455 DECL_BIT_FIELD_REPRESENTATIVE (r
)
13456 = tsubst_expr (DECL_BIT_FIELD_REPRESENTATIVE (t
), args
,
13458 /*integral_constant_expression_p=*/true);
13459 if (DECL_INITIAL (t
))
13461 /* Set up DECL_TEMPLATE_INFO so that we can get at the
13462 NSDMI in perform_member_init. Still set DECL_INITIAL
13463 so that we know there is one. */
13464 DECL_INITIAL (r
) = void_node
;
13465 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
13466 retrofit_lang_decl (r
);
13467 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
13469 /* We don't have to set DECL_CONTEXT here; it is set by
13470 finish_member_declaration. */
13471 DECL_CHAIN (r
) = NULL_TREE
;
13473 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
13474 args
, complain
, in_decl
);
13477 TREE_VEC_ELT (vec
, i
) = r
;
13486 /* We reach here only for member using decls. We also need to check
13487 uses_template_parms because DECL_DEPENDENT_P is not set for a
13488 using-declaration that designates a member of the current
13489 instantiation (c++/53549). */
13490 if (DECL_DEPENDENT_P (t
)
13491 || uses_template_parms (USING_DECL_SCOPE (t
)))
13493 tree scope
= USING_DECL_SCOPE (t
);
13494 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
13495 if (PACK_EXPANSION_P (scope
))
13497 tree vec
= tsubst_pack_expansion (scope
, args
, complain
, in_decl
);
13498 int len
= TREE_VEC_LENGTH (vec
);
13499 r
= make_tree_vec (len
);
13500 for (int i
= 0; i
< len
; ++i
)
13502 tree escope
= TREE_VEC_ELT (vec
, i
);
13503 tree elt
= do_class_using_decl (escope
, name
);
13506 r
= error_mark_node
;
13511 TREE_PROTECTED (elt
) = TREE_PROTECTED (t
);
13512 TREE_PRIVATE (elt
) = TREE_PRIVATE (t
);
13514 TREE_VEC_ELT (r
, i
) = elt
;
13519 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
13520 complain
, in_decl
);
13521 r
= do_class_using_decl (inst_scope
, name
);
13523 r
= error_mark_node
;
13526 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
13527 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
13534 DECL_CHAIN (r
) = NULL_TREE
;
13541 tree argvec
= NULL_TREE
;
13542 tree gen_tmpl
= NULL_TREE
;
13544 tree tmpl
= NULL_TREE
;
13546 tree type
= NULL_TREE
;
13549 if (TREE_TYPE (t
) == error_mark_node
)
13550 RETURN (error_mark_node
);
13552 if (TREE_CODE (t
) == TYPE_DECL
13553 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
13555 /* If this is the canonical decl, we don't have to
13556 mess with instantiations, and often we can't (for
13557 typename, template type parms and such). Note that
13558 TYPE_NAME is not correct for the above test if
13559 we've copied the type for a typedef. */
13560 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13561 if (type
== error_mark_node
)
13562 RETURN (error_mark_node
);
13563 r
= TYPE_NAME (type
);
13567 /* Check to see if we already have the specialization we
13570 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
13572 /* T is a static data member or namespace-scope entity.
13573 We have to substitute into namespace-scope variables
13574 (not just variable templates) because of cases like:
13576 template <class T> void f() { extern T t; }
13578 where the entity referenced is not known until
13579 instantiation time. */
13581 ctx
= DECL_CONTEXT (t
);
13582 if (DECL_CLASS_SCOPE_P (t
))
13584 ctx
= tsubst_aggr_type (ctx
, args
,
13586 in_decl
, /*entering_scope=*/1);
13587 /* If CTX is unchanged, then T is in fact the
13588 specialization we want. That situation occurs when
13589 referencing a static data member within in its own
13590 class. We can use pointer equality, rather than
13591 same_type_p, because DECL_CONTEXT is always
13593 if (ctx
== DECL_CONTEXT (t
)
13594 /* ... unless T is a member template; in which
13595 case our caller can be willing to create a
13596 specialization of that template represented
13598 && !(DECL_TI_TEMPLATE (t
)
13599 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
13605 tmpl
= DECL_TI_TEMPLATE (t
);
13606 gen_tmpl
= most_general_template (tmpl
);
13607 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
13608 if (argvec
!= error_mark_node
)
13609 argvec
= (coerce_innermost_template_parms
13610 (DECL_TEMPLATE_PARMS (gen_tmpl
),
13611 argvec
, t
, complain
,
13612 /*all*/true, /*defarg*/true));
13613 if (argvec
== error_mark_node
)
13614 RETURN (error_mark_node
);
13615 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
13616 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
13621 /* A local variable. */
13623 /* Subsequent calls to pushdecl will fill this in. */
13625 /* Unless this is a reference to a static variable from an
13626 enclosing function, in which case we need to fill it in now. */
13627 if (TREE_STATIC (t
))
13629 tree fn
= enclosing_instantiation_of (DECL_CONTEXT (t
));
13630 if (fn
!= current_function_decl
)
13633 spec
= retrieve_local_specialization (t
);
13635 /* If we already have the specialization we need, there is
13636 nothing more to do. */
13643 /* Create a new node for the specialization we need. */
13644 if (type
== NULL_TREE
)
13646 if (is_typedef_decl (t
))
13647 type
= DECL_ORIGINAL_TYPE (t
);
13649 type
= TREE_TYPE (t
);
13651 && VAR_HAD_UNKNOWN_BOUND (t
)
13652 && type
!= error_mark_node
)
13653 type
= strip_array_domain (type
);
13654 tree sub_args
= args
;
13655 if (tree auto_node
= type_uses_auto (type
))
13657 /* Mask off any template args past the variable's context so we
13658 don't replace the auto with an unrelated argument. */
13659 int nouter
= TEMPLATE_TYPE_LEVEL (auto_node
) - 1;
13660 int extra
= TMPL_ARGS_DEPTH (args
) - nouter
;
13662 /* This should never happen with the new lambda instantiation
13663 model, but keep the handling just in case. */
13664 gcc_assert (!CHECKING_P
),
13665 sub_args
= strip_innermost_template_args (args
, extra
);
13667 type
= tsubst (type
, sub_args
, complain
, in_decl
);
13668 /* Substituting the type might have recursively instantiated this
13669 same alias (c++/86171). */
13670 if (gen_tmpl
&& DECL_ALIAS_TEMPLATE_P (gen_tmpl
)
13671 && (spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
)))
13680 DECL_INITIALIZED_P (r
) = 0;
13681 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
13682 if (type
== error_mark_node
)
13683 RETURN (error_mark_node
);
13684 if (TREE_CODE (type
) == FUNCTION_TYPE
)
13686 /* It may seem that this case cannot occur, since:
13691 declares a function, not a variable. However:
13694 template <typename T> void g() { T t; }
13695 template void g<f>();
13697 is an attempt to declare a variable with function
13699 error ("variable %qD has function type",
13700 /* R is not yet sufficiently initialized, so we
13701 just use its name. */
13703 RETURN (error_mark_node
);
13705 type
= complete_type (type
);
13706 /* Wait until cp_finish_decl to set this again, to handle
13707 circular dependency (template/instantiate6.C). */
13708 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
13709 type
= check_var_type (DECL_NAME (r
), type
);
13711 if (DECL_HAS_VALUE_EXPR_P (t
))
13713 tree ve
= DECL_VALUE_EXPR (t
);
13714 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
13715 /*constant_expression_p=*/false);
13716 if (REFERENCE_REF_P (ve
))
13718 gcc_assert (TYPE_REF_P (type
));
13719 ve
= TREE_OPERAND (ve
, 0);
13721 SET_DECL_VALUE_EXPR (r
, ve
);
13723 if (CP_DECL_THREAD_LOCAL_P (r
)
13724 && !processing_template_decl
)
13725 set_decl_tls_model (r
, decl_default_tls_model (r
));
13727 else if (DECL_SELF_REFERENCE_P (t
))
13728 SET_DECL_SELF_REFERENCE_P (r
);
13729 TREE_TYPE (r
) = type
;
13730 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
13731 DECL_CONTEXT (r
) = ctx
;
13732 /* Clear out the mangled name and RTL for the instantiation. */
13733 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
13734 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
13735 SET_DECL_RTL (r
, NULL
);
13736 /* The initializer must not be expanded until it is required;
13737 see [temp.inst]. */
13738 DECL_INITIAL (r
) = NULL_TREE
;
13739 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
13742 if (DECL_LANG_SPECIFIC (r
))
13743 SET_DECL_DEPENDENT_INIT_P (r
, false);
13745 SET_DECL_MODE (r
, VOIDmode
);
13747 /* Possibly limit visibility based on template args. */
13748 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
13749 if (DECL_VISIBILITY_SPECIFIED (t
))
13751 DECL_VISIBILITY_SPECIFIED (r
) = 0;
13752 DECL_ATTRIBUTES (r
)
13753 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
13755 determine_visibility (r
);
13760 /* A static data member declaration is always marked
13761 external when it is declared in-class, even if an
13762 initializer is present. We mimic the non-template
13763 processing here. */
13764 DECL_EXTERNAL (r
) = 1;
13765 if (DECL_NAMESPACE_SCOPE_P (t
))
13766 DECL_NOT_REALLY_EXTERN (r
) = 1;
13768 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
13769 SET_DECL_IMPLICIT_INSTANTIATION (r
);
13770 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
13774 if (DECL_LANG_SPECIFIC (r
))
13775 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
13776 if (!cp_unevaluated_operand
)
13777 register_local_specialization (r
, t
);
13780 DECL_CHAIN (r
) = NULL_TREE
;
13782 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
13784 args
, complain
, in_decl
);
13786 /* Preserve a typedef that names a type. */
13787 if (is_typedef_decl (r
) && type
!= error_mark_node
)
13789 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
13790 set_underlying_type (r
);
13791 if (TYPE_DECL_ALIAS_P (r
))
13792 /* An alias template specialization can be dependent
13793 even if its underlying type is not. */
13794 TYPE_DEPENDENT_P_VALID (TREE_TYPE (r
)) = false;
13797 layout_decl (r
, 0);
13802 gcc_unreachable ();
13807 /* Restore the file and line information. */
13808 input_location
= saved_loc
;
13813 /* Substitute into the ARG_TYPES of a function type.
13814 If END is a TREE_CHAIN, leave it and any following types
13818 tsubst_arg_types (tree arg_types
,
13821 tsubst_flags_t complain
,
13824 tree remaining_arg_types
;
13825 tree type
= NULL_TREE
;
13827 tree expanded_args
= NULL_TREE
;
13830 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
13833 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
13834 args
, end
, complain
, in_decl
);
13835 if (remaining_arg_types
== error_mark_node
)
13836 return error_mark_node
;
13838 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
13840 /* For a pack expansion, perform substitution on the
13841 entire expression. Later on, we'll handle the arguments
13843 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
13844 args
, complain
, in_decl
);
13846 if (TREE_CODE (expanded_args
) == TREE_VEC
)
13847 /* So that we'll spin through the parameters, one by one. */
13848 i
= TREE_VEC_LENGTH (expanded_args
);
13851 /* We only partially substituted into the parameter
13852 pack. Our type is TYPE_PACK_EXPANSION. */
13853 type
= expanded_args
;
13854 expanded_args
= NULL_TREE
;
13862 type
= TREE_VEC_ELT (expanded_args
, i
);
13864 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
13866 if (type
== error_mark_node
)
13867 return error_mark_node
;
13868 if (VOID_TYPE_P (type
))
13870 if (complain
& tf_error
)
13872 error ("invalid parameter type %qT", type
);
13874 error ("in declaration %q+D", in_decl
);
13876 return error_mark_node
;
13879 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
13880 return error_mark_node
;
13882 /* Do array-to-pointer, function-to-pointer conversion, and ignore
13883 top-level qualifiers as required. */
13884 type
= cv_unqualified (type_decays_to (type
));
13886 /* We do not substitute into default arguments here. The standard
13887 mandates that they be instantiated only when needed, which is
13888 done in build_over_call. */
13889 default_arg
= TREE_PURPOSE (arg_types
);
13891 /* Except that we do substitute default arguments under tsubst_lambda_expr,
13892 since the new op() won't have any associated template arguments for us
13893 to refer to later. */
13894 if (lambda_fn_in_template_p (in_decl
))
13895 default_arg
= tsubst_copy_and_build (default_arg
, args
, complain
, in_decl
,
13896 false/*fn*/, false/*constexpr*/);
13898 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
13900 /* We've instantiated a template before its default arguments
13901 have been parsed. This can happen for a nested template
13902 class, and is not an error unless we require the default
13903 argument in a call of this function. */
13904 remaining_arg_types
=
13905 tree_cons (default_arg
, type
, remaining_arg_types
);
13906 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
13909 remaining_arg_types
=
13910 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
13913 return remaining_arg_types
;
13916 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
13917 *not* handle the exception-specification for FNTYPE, because the
13918 initial substitution of explicitly provided template parameters
13919 during argument deduction forbids substitution into the
13920 exception-specification:
13924 All references in the function type of the function template to the
13925 corresponding template parameters are replaced by the specified tem-
13926 plate argument values. If a substitution in a template parameter or
13927 in the function type of the function template results in an invalid
13928 type, type deduction fails. [Note: The equivalent substitution in
13929 exception specifications is done only when the function is instanti-
13930 ated, at which point a program is ill-formed if the substitution
13931 results in an invalid type.] */
13934 tsubst_function_type (tree t
,
13936 tsubst_flags_t complain
,
13940 tree arg_types
= NULL_TREE
;
13943 /* The TYPE_CONTEXT is not used for function/method types. */
13944 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
13946 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
13948 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
13950 if (late_return_type_p
)
13952 /* Substitute the argument types. */
13953 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
13954 complain
, in_decl
);
13955 if (arg_types
== error_mark_node
)
13956 return error_mark_node
;
13958 tree save_ccp
= current_class_ptr
;
13959 tree save_ccr
= current_class_ref
;
13960 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
13961 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
13962 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
13965 /* DR 1207: 'this' is in scope in the trailing return type. */
13966 inject_this_parameter (this_type
, cp_type_quals (this_type
));
13969 /* Substitute the return type. */
13970 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13974 current_class_ptr
= save_ccp
;
13975 current_class_ref
= save_ccr
;
13979 /* Substitute the return type. */
13980 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13982 if (return_type
== error_mark_node
)
13983 return error_mark_node
;
13984 /* DR 486 clarifies that creation of a function type with an
13985 invalid return type is a deduction failure. */
13986 if (TREE_CODE (return_type
) == ARRAY_TYPE
13987 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
13989 if (complain
& tf_error
)
13991 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
13992 error ("function returning an array");
13994 error ("function returning a function");
13996 return error_mark_node
;
13999 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
14000 return error_mark_node
;
14002 if (!late_return_type_p
)
14004 /* Substitute the argument types. */
14005 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
14006 complain
, in_decl
);
14007 if (arg_types
== error_mark_node
)
14008 return error_mark_node
;
14011 /* Construct a new type node and return it. */
14012 if (TREE_CODE (t
) == FUNCTION_TYPE
)
14014 fntype
= build_function_type (return_type
, arg_types
);
14015 fntype
= apply_memfn_quals (fntype
, type_memfn_quals (t
));
14019 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
14020 /* Don't pick up extra function qualifiers from the basetype. */
14021 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
14022 if (! MAYBE_CLASS_TYPE_P (r
))
14026 Type deduction may fail for any of the following
14029 -- Attempting to create "pointer to member of T" when T
14030 is not a class type. */
14031 if (complain
& tf_error
)
14032 error ("creating pointer to member function of non-class type %qT",
14034 return error_mark_node
;
14037 fntype
= build_method_type_directly (r
, return_type
,
14038 TREE_CHAIN (arg_types
));
14040 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
14042 /* See comment above. */
14043 tree raises
= NULL_TREE
;
14044 cp_ref_qualifier rqual
= type_memfn_rqual (t
);
14045 fntype
= build_cp_fntype_variant (fntype
, rqual
, raises
, late_return_type_p
);
14050 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
14051 ARGS into that specification, and return the substituted
14052 specification. If there is no specification, return NULL_TREE. */
14055 tsubst_exception_specification (tree fntype
,
14057 tsubst_flags_t complain
,
14064 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
14065 new_specs
= NULL_TREE
;
14066 if (specs
&& TREE_PURPOSE (specs
))
14068 /* A noexcept-specifier. */
14069 tree expr
= TREE_PURPOSE (specs
);
14070 if (TREE_CODE (expr
) == INTEGER_CST
)
14074 /* Defer instantiation of noexcept-specifiers to avoid
14075 excessive instantiations (c++/49107). */
14076 new_specs
= make_node (DEFERRED_NOEXCEPT
);
14077 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
14079 /* We already partially instantiated this member template,
14080 so combine the new args with the old. */
14081 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
14082 = DEFERRED_NOEXCEPT_PATTERN (expr
);
14083 DEFERRED_NOEXCEPT_ARGS (new_specs
)
14084 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
14088 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
14089 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
14093 new_specs
= tsubst_copy_and_build
14094 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
14095 /*integral_constant_expression_p=*/true);
14096 new_specs
= build_noexcept_spec (new_specs
, complain
);
14100 if (! TREE_VALUE (specs
))
14107 tree expanded_specs
= NULL_TREE
;
14109 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
14111 /* Expand the pack expansion type. */
14112 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
14116 if (expanded_specs
== error_mark_node
)
14117 return error_mark_node
;
14118 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
14119 len
= TREE_VEC_LENGTH (expanded_specs
);
14122 /* We're substituting into a member template, so
14123 we got a TYPE_PACK_EXPANSION back. Add that
14124 expansion and move on. */
14125 gcc_assert (TREE_CODE (expanded_specs
)
14126 == TYPE_PACK_EXPANSION
);
14127 new_specs
= add_exception_specifier (new_specs
,
14130 specs
= TREE_CHAIN (specs
);
14135 for (i
= 0; i
< len
; ++i
)
14137 if (expanded_specs
)
14138 spec
= TREE_VEC_ELT (expanded_specs
, i
);
14140 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
14141 if (spec
== error_mark_node
)
14143 new_specs
= add_exception_specifier (new_specs
, spec
,
14147 specs
= TREE_CHAIN (specs
);
14153 /* Take the tree structure T and replace template parameters used
14154 therein with the argument vector ARGS. IN_DECL is an associated
14155 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
14156 Issue error and warning messages under control of COMPLAIN. Note
14157 that we must be relatively non-tolerant of extensions here, in
14158 order to preserve conformance; if we allow substitutions that
14159 should not be allowed, we may allow argument deductions that should
14160 not succeed, and therefore report ambiguous overload situations
14161 where there are none. In theory, we could allow the substitution,
14162 but indicate that it should have failed, and allow our caller to
14163 make sure that the right thing happens, but we don't try to do this
14166 This function is used for dealing with types, decls and the like;
14167 for expressions, use tsubst_expr or tsubst_copy. */
14170 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
14172 enum tree_code code
;
14173 tree type
, r
= NULL_TREE
;
14175 if (t
== NULL_TREE
|| t
== error_mark_node
14176 || t
== integer_type_node
14177 || t
== void_type_node
14178 || t
== char_type_node
14179 || t
== unknown_type_node
14180 || TREE_CODE (t
) == NAMESPACE_DECL
14181 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
14185 return tsubst_decl (t
, args
, complain
);
14187 if (args
== NULL_TREE
)
14190 code
= TREE_CODE (t
);
14192 if (code
== IDENTIFIER_NODE
)
14193 type
= IDENTIFIER_TYPE_VALUE (t
);
14195 type
= TREE_TYPE (t
);
14197 gcc_assert (type
!= unknown_type_node
);
14199 /* Reuse typedefs. We need to do this to handle dependent attributes,
14200 such as attribute aligned. */
14202 && typedef_variant_p (t
))
14204 tree decl
= TYPE_NAME (t
);
14206 if (alias_template_specialization_p (t
))
14208 /* DECL represents an alias template and we want to
14210 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
14211 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
14212 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
14214 else if (DECL_CLASS_SCOPE_P (decl
)
14215 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
14216 && uses_template_parms (DECL_CONTEXT (decl
)))
14218 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
14219 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
14220 r
= retrieve_specialization (tmpl
, gen_args
, 0);
14222 else if (DECL_FUNCTION_SCOPE_P (decl
)
14223 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
14224 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
14225 r
= retrieve_local_specialization (decl
);
14227 /* The typedef is from a non-template context. */
14233 r
= cp_build_qualified_type_real
14234 (r
, cp_type_quals (t
) | cp_type_quals (r
),
14235 complain
| tf_ignore_bad_quals
);
14240 /* We don't have an instantiation yet, so drop the typedef. */
14241 int quals
= cp_type_quals (t
);
14242 t
= DECL_ORIGINAL_TYPE (decl
);
14243 t
= cp_build_qualified_type_real (t
, quals
,
14244 complain
| tf_ignore_bad_quals
);
14248 bool fndecl_type
= (complain
& tf_fndecl_type
);
14249 complain
&= ~tf_fndecl_type
;
14252 && code
!= TYPENAME_TYPE
14253 && code
!= TEMPLATE_TYPE_PARM
14254 && code
!= TEMPLATE_PARM_INDEX
14255 && code
!= IDENTIFIER_NODE
14256 && code
!= FUNCTION_TYPE
14257 && code
!= METHOD_TYPE
)
14258 type
= tsubst (type
, args
, complain
, in_decl
);
14259 if (type
== error_mark_node
)
14260 return error_mark_node
;
14266 case ENUMERAL_TYPE
:
14267 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
14268 /*entering_scope=*/0);
14271 case IDENTIFIER_NODE
:
14282 if (t
== integer_type_node
)
14285 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
14286 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
14290 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
14292 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
14293 /*integral_constant_expression_p=*/false);
14295 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
14297 if (TREE_CODE (max
) == NOP_EXPR
14298 && TREE_SIDE_EFFECTS (omax
)
14299 && !TREE_TYPE (max
))
14300 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
14302 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
14303 with TREE_SIDE_EFFECTS that indicates this is not an integral
14304 constant expression. */
14305 if (processing_template_decl
14306 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
14308 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
14309 TREE_SIDE_EFFECTS (max
) = 1;
14312 return compute_array_index_type (NULL_TREE
, max
, complain
);
14315 case TEMPLATE_TYPE_PARM
:
14316 case TEMPLATE_TEMPLATE_PARM
:
14317 case BOUND_TEMPLATE_TEMPLATE_PARM
:
14318 case TEMPLATE_PARM_INDEX
:
14323 tree arg
= NULL_TREE
;
14325 /* Early in template argument deduction substitution, we don't
14326 want to reduce the level of 'auto', or it will be confused
14327 with a normal template parm in subsequent deduction. */
14328 if (is_auto (t
) && (complain
& tf_partial
))
14333 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
14334 template_parm_level_and_index (t
, &level
, &idx
);
14336 levels
= TMPL_ARGS_DEPTH (args
);
14337 if (level
<= levels
14338 && TREE_VEC_LENGTH (TMPL_ARGS_LEVEL (args
, level
)) > 0)
14340 arg
= TMPL_ARG (args
, level
, idx
);
14342 /* See through ARGUMENT_PACK_SELECT arguments. */
14343 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
14344 arg
= argument_pack_select_arg (arg
);
14347 if (arg
== error_mark_node
)
14348 return error_mark_node
;
14349 else if (arg
!= NULL_TREE
)
14351 if (ARGUMENT_PACK_P (arg
))
14352 /* If ARG is an argument pack, we don't actually want to
14353 perform a substitution here, because substitutions
14354 for argument packs are only done
14355 element-by-element. We can get to this point when
14356 substituting the type of a non-type template
14357 parameter pack, when that type actually contains
14358 template parameter packs from an outer template, e.g.,
14360 template<typename... Types> struct A {
14361 template<Types... Values> struct B { };
14365 if (code
== TEMPLATE_TYPE_PARM
)
14368 gcc_assert (TYPE_P (arg
));
14370 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
14372 return cp_build_qualified_type_real
14373 (arg
, quals
, complain
| tf_ignore_bad_quals
);
14375 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
14377 /* We are processing a type constructed from a
14378 template template parameter. */
14379 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
14380 args
, complain
, in_decl
);
14381 if (argvec
== error_mark_node
)
14382 return error_mark_node
;
14384 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
14385 || TREE_CODE (arg
) == TEMPLATE_DECL
14386 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
14388 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
14389 /* Consider this code:
14391 template <template <class> class Template>
14393 template <class Arg> using Bind = Template<Arg>;
14396 template <template <class> class Template, class Arg>
14397 using Instantiate = Template<Arg>; //#0
14399 template <template <class> class Template,
14402 Instantiate<Internal<Template>::template Bind,
14405 When #1 is parsed, the
14406 BOUND_TEMPLATE_TEMPLATE_PARM representing the
14407 parameter `Template' in #0 matches the
14408 UNBOUND_CLASS_TEMPLATE representing the argument
14409 `Internal<Template>::template Bind'; We then want
14410 to assemble the type `Bind<Argument>' that can't
14411 be fully created right now, because
14412 `Internal<Template>' not being complete, the Bind
14413 template cannot be looked up in that context. So
14414 we need to "store" `Bind<Argument>' for later
14415 when the context of Bind becomes complete. Let's
14416 store that in a TYPENAME_TYPE. */
14417 return make_typename_type (TYPE_CONTEXT (arg
),
14418 build_nt (TEMPLATE_ID_EXPR
,
14419 TYPE_IDENTIFIER (arg
),
14424 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
14425 are resolving nested-types in the signature of a
14426 member function templates. Otherwise ARG is a
14427 TEMPLATE_DECL and is the real template to be
14429 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
14430 arg
= TYPE_NAME (arg
);
14432 r
= lookup_template_class (arg
,
14434 DECL_CONTEXT (arg
),
14435 /*entering_scope=*/0,
14437 return cp_build_qualified_type_real
14438 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
14440 else if (code
== TEMPLATE_TEMPLATE_PARM
)
14443 /* TEMPLATE_PARM_INDEX. */
14444 return convert_from_reference (unshare_expr (arg
));
14448 /* This can happen during the attempted tsubst'ing in
14449 unify. This means that we don't yet have any information
14450 about the template parameter in question. */
14453 /* If we get here, we must have been looking at a parm for a
14454 more deeply nested template. Make a new version of this
14455 template parameter, but with a lower level. */
14458 case TEMPLATE_TYPE_PARM
:
14459 case TEMPLATE_TEMPLATE_PARM
:
14460 case BOUND_TEMPLATE_TEMPLATE_PARM
:
14461 if (cp_type_quals (t
))
14463 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
14464 r
= cp_build_qualified_type_real
14465 (r
, cp_type_quals (t
),
14466 complain
| (code
== TEMPLATE_TYPE_PARM
14467 ? tf_ignore_bad_quals
: 0));
14469 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
14470 && PLACEHOLDER_TYPE_CONSTRAINTS (t
)
14471 && (r
= (TEMPLATE_PARM_DESCENDANTS
14472 (TEMPLATE_TYPE_PARM_INDEX (t
))))
14473 && (r
= TREE_TYPE (r
))
14474 && !PLACEHOLDER_TYPE_CONSTRAINTS (r
))
14475 /* Break infinite recursion when substituting the constraints
14476 of a constrained placeholder. */;
14477 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
14478 && !PLACEHOLDER_TYPE_CONSTRAINTS (t
)
14479 && !CLASS_PLACEHOLDER_TEMPLATE (t
)
14480 && (arg
= TEMPLATE_TYPE_PARM_INDEX (t
),
14481 r
= TEMPLATE_PARM_DESCENDANTS (arg
))
14482 && (TEMPLATE_PARM_LEVEL (r
)
14483 == TEMPLATE_PARM_LEVEL (arg
) - levels
))
14484 /* Cache the simple case of lowering a type parameter. */
14489 TEMPLATE_TYPE_PARM_INDEX (r
)
14490 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
14491 r
, levels
, args
, complain
);
14492 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
14493 TYPE_MAIN_VARIANT (r
) = r
;
14494 TYPE_POINTER_TO (r
) = NULL_TREE
;
14495 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
14497 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
14499 /* Propagate constraints on placeholders. */
14500 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
14501 PLACEHOLDER_TYPE_CONSTRAINTS (r
)
14502 = tsubst_constraint (constr
, args
, complain
, in_decl
);
14503 else if (tree pl
= CLASS_PLACEHOLDER_TEMPLATE (t
))
14505 pl
= tsubst_copy (pl
, args
, complain
, in_decl
);
14506 CLASS_PLACEHOLDER_TEMPLATE (r
) = pl
;
14510 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
14511 /* We have reduced the level of the template
14512 template parameter, but not the levels of its
14513 template parameters, so canonical_type_parameter
14514 will not be able to find the canonical template
14515 template parameter for this level. Thus, we
14516 require structural equality checking to compare
14517 TEMPLATE_TEMPLATE_PARMs. */
14518 SET_TYPE_STRUCTURAL_EQUALITY (r
);
14519 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
14520 SET_TYPE_STRUCTURAL_EQUALITY (r
);
14522 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
14524 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
14526 tree tinfo
= TYPE_TEMPLATE_INFO (t
);
14527 /* We might need to substitute into the types of non-type
14528 template parameters. */
14529 tree tmpl
= tsubst (TI_TEMPLATE (tinfo
), args
,
14530 complain
, in_decl
);
14531 if (tmpl
== error_mark_node
)
14532 return error_mark_node
;
14533 tree argvec
= tsubst (TI_ARGS (tinfo
), args
,
14534 complain
, in_decl
);
14535 if (argvec
== error_mark_node
)
14536 return error_mark_node
;
14538 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
14539 = build_template_info (tmpl
, argvec
);
14544 case TEMPLATE_PARM_INDEX
:
14545 /* OK, now substitute the type of the non-type parameter. We
14546 couldn't do it earlier because it might be an auto parameter,
14547 and we wouldn't need to if we had an argument. */
14548 type
= tsubst (type
, args
, complain
, in_decl
);
14549 if (type
== error_mark_node
)
14550 return error_mark_node
;
14551 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
14555 gcc_unreachable ();
14563 tree purpose
, value
, chain
;
14565 if (t
== void_list_node
)
14568 purpose
= TREE_PURPOSE (t
);
14571 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
14572 if (purpose
== error_mark_node
)
14573 return error_mark_node
;
14575 value
= TREE_VALUE (t
);
14578 value
= tsubst (value
, args
, complain
, in_decl
);
14579 if (value
== error_mark_node
)
14580 return error_mark_node
;
14582 chain
= TREE_CHAIN (t
);
14583 if (chain
&& chain
!= void_type_node
)
14585 chain
= tsubst (chain
, args
, complain
, in_decl
);
14586 if (chain
== error_mark_node
)
14587 return error_mark_node
;
14589 if (purpose
== TREE_PURPOSE (t
)
14590 && value
== TREE_VALUE (t
)
14591 && chain
== TREE_CHAIN (t
))
14593 return hash_tree_cons (purpose
, value
, chain
);
14597 /* We should never be tsubsting a binfo. */
14598 gcc_unreachable ();
14601 /* A vector of template arguments. */
14602 gcc_assert (!type
);
14603 return tsubst_template_args (t
, args
, complain
, in_decl
);
14606 case REFERENCE_TYPE
:
14608 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
14613 Type deduction may fail for any of the following
14616 -- Attempting to create a pointer to reference type.
14617 -- Attempting to create a reference to a reference type or
14618 a reference to void.
14620 Core issue 106 says that creating a reference to a reference
14621 during instantiation is no longer a cause for failure. We
14622 only enforce this check in strict C++98 mode. */
14623 if ((TYPE_REF_P (type
)
14624 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
14625 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
14627 static location_t last_loc
;
14629 /* We keep track of the last time we issued this error
14630 message to avoid spewing a ton of messages during a
14631 single bad template instantiation. */
14632 if (complain
& tf_error
14633 && last_loc
!= input_location
)
14635 if (VOID_TYPE_P (type
))
14636 error ("forming reference to void");
14637 else if (code
== POINTER_TYPE
)
14638 error ("forming pointer to reference type %qT", type
);
14640 error ("forming reference to reference type %qT", type
);
14641 last_loc
= input_location
;
14644 return error_mark_node
;
14646 else if (TREE_CODE (type
) == FUNCTION_TYPE
14647 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
14648 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
14650 if (complain
& tf_error
)
14652 if (code
== POINTER_TYPE
)
14653 error ("forming pointer to qualified function type %qT",
14656 error ("forming reference to qualified function type %qT",
14659 return error_mark_node
;
14661 else if (code
== POINTER_TYPE
)
14663 r
= build_pointer_type (type
);
14664 if (TREE_CODE (type
) == METHOD_TYPE
)
14665 r
= build_ptrmemfunc_type (r
);
14667 else if (TYPE_REF_P (type
))
14668 /* In C++0x, during template argument substitution, when there is an
14669 attempt to create a reference to a reference type, reference
14670 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
14672 "If a template-argument for a template-parameter T names a type
14673 that is a reference to a type A, an attempt to create the type
14674 'lvalue reference to cv T' creates the type 'lvalue reference to
14675 A,' while an attempt to create the type type rvalue reference to
14676 cv T' creates the type T"
14678 r
= cp_build_reference_type
14680 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
14682 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
14683 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
14685 if (r
!= error_mark_node
)
14686 /* Will this ever be needed for TYPE_..._TO values? */
14693 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
14694 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
14698 Type deduction may fail for any of the following
14701 -- Attempting to create "pointer to member of T" when T
14702 is not a class type. */
14703 if (complain
& tf_error
)
14704 error ("creating pointer to member of non-class type %qT", r
);
14705 return error_mark_node
;
14707 if (TYPE_REF_P (type
))
14709 if (complain
& tf_error
)
14710 error ("creating pointer to member reference type %qT", type
);
14711 return error_mark_node
;
14713 if (VOID_TYPE_P (type
))
14715 if (complain
& tf_error
)
14716 error ("creating pointer to member of type void");
14717 return error_mark_node
;
14719 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
14720 if (TREE_CODE (type
) == FUNCTION_TYPE
)
14722 /* The type of the implicit object parameter gets its
14723 cv-qualifiers from the FUNCTION_TYPE. */
14726 = build_memfn_type (type
, r
, type_memfn_quals (type
),
14727 type_memfn_rqual (type
));
14728 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
14729 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
14733 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
14737 case FUNCTION_TYPE
:
14742 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
14743 if (fntype
== error_mark_node
)
14744 return error_mark_node
;
14746 /* Substitute the exception specification. */
14747 specs
= tsubst_exception_specification (t
, args
, complain
, in_decl
,
14748 /*defer_ok*/fndecl_type
);
14749 if (specs
== error_mark_node
)
14750 return error_mark_node
;
14752 fntype
= build_exception_variant (fntype
, specs
);
14757 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
14758 if (domain
== error_mark_node
)
14759 return error_mark_node
;
14761 /* As an optimization, we avoid regenerating the array type if
14762 it will obviously be the same as T. */
14763 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
14766 /* These checks should match the ones in create_array_type_for_decl.
14770 The deduction may fail for any of the following reasons:
14772 -- Attempting to create an array with an element type that
14773 is void, a function type, or a reference type, or [DR337]
14774 an abstract class type. */
14775 if (VOID_TYPE_P (type
)
14776 || TREE_CODE (type
) == FUNCTION_TYPE
14777 || (TREE_CODE (type
) == ARRAY_TYPE
14778 && TYPE_DOMAIN (type
) == NULL_TREE
)
14779 || TYPE_REF_P (type
))
14781 if (complain
& tf_error
)
14782 error ("creating array of %qT", type
);
14783 return error_mark_node
;
14786 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
14787 return error_mark_node
;
14789 r
= build_cplus_array_type (type
, domain
);
14791 if (!valid_array_size_p (input_location
, r
, in_decl
,
14792 (complain
& tf_error
)))
14793 return error_mark_node
;
14795 if (TYPE_USER_ALIGN (t
))
14797 SET_TYPE_ALIGN (r
, TYPE_ALIGN (t
));
14798 TYPE_USER_ALIGN (r
) = 1;
14804 case TYPENAME_TYPE
:
14806 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
14807 in_decl
, /*entering_scope=*/1);
14808 if (ctx
== error_mark_node
)
14809 return error_mark_node
;
14811 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
14812 complain
, in_decl
);
14813 if (f
== error_mark_node
)
14814 return error_mark_node
;
14816 if (!MAYBE_CLASS_TYPE_P (ctx
))
14818 if (complain
& tf_error
)
14819 error ("%qT is not a class, struct, or union type", ctx
);
14820 return error_mark_node
;
14822 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
14824 /* Normally, make_typename_type does not require that the CTX
14825 have complete type in order to allow things like:
14827 template <class T> struct S { typename S<T>::X Y; };
14829 But, such constructs have already been resolved by this
14830 point, so here CTX really should have complete type, unless
14831 it's a partial instantiation. */
14832 ctx
= complete_type (ctx
);
14833 if (!COMPLETE_TYPE_P (ctx
))
14835 if (complain
& tf_error
)
14836 cxx_incomplete_type_error (NULL_TREE
, ctx
);
14837 return error_mark_node
;
14841 f
= make_typename_type (ctx
, f
, typename_type
,
14842 complain
| tf_keep_type_decl
);
14843 if (f
== error_mark_node
)
14845 if (TREE_CODE (f
) == TYPE_DECL
)
14847 complain
|= tf_ignore_bad_quals
;
14851 if (TREE_CODE (f
) != TYPENAME_TYPE
)
14853 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
14855 if (complain
& tf_error
)
14856 error ("%qT resolves to %qT, which is not an enumeration type",
14859 return error_mark_node
;
14861 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
14863 if (complain
& tf_error
)
14864 error ("%qT resolves to %qT, which is is not a class type",
14867 return error_mark_node
;
14871 return cp_build_qualified_type_real
14872 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
14875 case UNBOUND_CLASS_TEMPLATE
:
14877 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
14878 in_decl
, /*entering_scope=*/1);
14879 tree name
= TYPE_IDENTIFIER (t
);
14880 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
14882 if (ctx
== error_mark_node
|| name
== error_mark_node
)
14883 return error_mark_node
;
14886 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
14887 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
14894 ++cp_unevaluated_operand
;
14895 ++c_inhibit_evaluation_warnings
;
14897 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
14899 /*integral_constant_expression_p=*/false);
14901 --cp_unevaluated_operand
;
14902 --c_inhibit_evaluation_warnings
;
14904 type
= finish_typeof (type
);
14905 return cp_build_qualified_type_real (type
,
14907 | cp_type_quals (type
),
14911 case DECLTYPE_TYPE
:
14915 ++cp_unevaluated_operand
;
14916 ++c_inhibit_evaluation_warnings
;
14918 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
14919 complain
|tf_decltype
, in_decl
,
14920 /*function_p*/false,
14921 /*integral_constant_expression*/false);
14923 if (DECLTYPE_FOR_INIT_CAPTURE (t
))
14925 if (type
== NULL_TREE
)
14927 if (complain
& tf_error
)
14928 error ("empty initializer in lambda init-capture");
14929 type
= error_mark_node
;
14931 else if (TREE_CODE (type
) == TREE_LIST
)
14932 type
= build_x_compound_expr_from_list (type
, ELK_INIT
, complain
);
14935 --cp_unevaluated_operand
;
14936 --c_inhibit_evaluation_warnings
;
14938 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
14939 type
= lambda_capture_field_type (type
,
14940 DECLTYPE_FOR_INIT_CAPTURE (t
),
14941 DECLTYPE_FOR_REF_CAPTURE (t
));
14942 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
14943 type
= lambda_proxy_type (type
);
14946 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
14947 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
14949 /* In a template ~id could be either a complement expression
14950 or an unqualified-id naming a destructor; if instantiating
14951 it produces an expression, it's not an id-expression or
14954 type
= finish_decltype_type (type
, id
, complain
);
14956 return cp_build_qualified_type_real (type
,
14958 | cp_type_quals (type
),
14959 complain
| tf_ignore_bad_quals
);
14962 case UNDERLYING_TYPE
:
14964 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
14965 complain
, in_decl
);
14966 return finish_underlying_type (type
);
14969 case TYPE_ARGUMENT_PACK
:
14970 case NONTYPE_ARGUMENT_PACK
:
14974 if (code
== NONTYPE_ARGUMENT_PACK
)
14975 r
= make_node (code
);
14977 r
= cxx_make_type (code
);
14979 tree pack_args
= ARGUMENT_PACK_ARGS (t
);
14980 pack_args
= tsubst_template_args (pack_args
, args
, complain
, in_decl
);
14981 SET_ARGUMENT_PACK_ARGS (r
, pack_args
);
14999 /* We should use one of the expression tsubsts for these codes. */
15000 gcc_unreachable ();
15003 sorry ("use of %qs in template", get_tree_code_name (code
));
15004 return error_mark_node
;
15008 /* tsubst a BASELINK. OBJECT_TYPE, if non-NULL, is the type of the
15009 expression on the left-hand side of the "." or "->" operator. We
15010 only do the lookup if we had a dependent BASELINK. Otherwise we
15011 adjust it onto the instantiated heirarchy. */
15014 tsubst_baselink (tree baselink
, tree object_type
,
15015 tree args
, tsubst_flags_t complain
, tree in_decl
)
15017 bool qualified_p
= BASELINK_QUALIFIED_P (baselink
);
15018 tree qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
15019 qualifying_scope
= tsubst (qualifying_scope
, args
, complain
, in_decl
);
15021 tree optype
= BASELINK_OPTYPE (baselink
);
15022 optype
= tsubst (optype
, args
, complain
, in_decl
);
15024 tree template_args
= NULL_TREE
;
15025 bool template_id_p
= false;
15026 tree fns
= BASELINK_FUNCTIONS (baselink
);
15027 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
15029 template_id_p
= true;
15030 template_args
= TREE_OPERAND (fns
, 1);
15031 fns
= TREE_OPERAND (fns
, 0);
15033 template_args
= tsubst_template_args (template_args
, args
,
15034 complain
, in_decl
);
15037 tree binfo_type
= BINFO_TYPE (BASELINK_BINFO (baselink
));
15038 binfo_type
= tsubst (binfo_type
, args
, complain
, in_decl
);
15039 bool dependent_p
= binfo_type
!= BINFO_TYPE (BASELINK_BINFO (baselink
));
15043 tree name
= OVL_NAME (fns
);
15044 if (IDENTIFIER_CONV_OP_P (name
))
15045 name
= make_conv_op_name (optype
);
15047 if (name
== complete_dtor_identifier
)
15048 /* Treat as-if non-dependent below. */
15049 dependent_p
= false;
15051 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
15054 if ((complain
& tf_error
)
15055 && constructor_name_p (name
, qualifying_scope
))
15056 error ("cannot call constructor %<%T::%D%> directly",
15057 qualifying_scope
, name
);
15058 return error_mark_node
;
15061 if (BASELINK_P (baselink
))
15062 fns
= BASELINK_FUNCTIONS (baselink
);
15065 /* We're going to overwrite pieces below, make a duplicate. */
15066 baselink
= copy_node (baselink
);
15068 /* If lookup found a single function, mark it as used at this point.
15069 (If lookup found multiple functions the one selected later by
15070 overload resolution will be marked as used at that point.) */
15071 if (!template_id_p
&& !really_overloaded_fn (fns
))
15073 tree fn
= OVL_FIRST (fns
);
15074 bool ok
= mark_used (fn
, complain
);
15075 if (!ok
&& !(complain
& tf_error
))
15076 return error_mark_node
;
15077 if (ok
&& BASELINK_P (baselink
))
15078 /* We might have instantiated an auto function. */
15079 TREE_TYPE (baselink
) = TREE_TYPE (fn
);
15082 if (BASELINK_P (baselink
))
15084 /* Add back the template arguments, if present. */
15086 BASELINK_FUNCTIONS (baselink
)
15087 = build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fns
, template_args
);
15089 /* Update the conversion operator type. */
15090 BASELINK_OPTYPE (baselink
) = optype
;
15094 object_type
= current_class_type
;
15096 if (qualified_p
|| !dependent_p
)
15098 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
15102 /* We need to call adjust_result_of_qualified_name_lookup in case the
15103 destructor names a base class, but we unset BASELINK_QUALIFIED_P
15104 so that we still get virtual function binding. */
15105 BASELINK_QUALIFIED_P (baselink
) = false;
15111 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
15112 true if the qualified-id will be a postfix-expression in-and-of
15113 itself; false if more of the postfix-expression follows the
15114 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
15118 tsubst_qualified_id (tree qualified_id
, tree args
,
15119 tsubst_flags_t complain
, tree in_decl
,
15120 bool done
, bool address_p
)
15126 tree template_args
;
15127 location_t loc
= UNKNOWN_LOCATION
;
15129 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
15131 /* Figure out what name to look up. */
15132 name
= TREE_OPERAND (qualified_id
, 1);
15133 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
15135 is_template
= true;
15136 loc
= EXPR_LOCATION (name
);
15137 template_args
= TREE_OPERAND (name
, 1);
15139 template_args
= tsubst_template_args (template_args
, args
,
15140 complain
, in_decl
);
15141 if (template_args
== error_mark_node
)
15142 return error_mark_node
;
15143 name
= TREE_OPERAND (name
, 0);
15147 is_template
= false;
15148 template_args
= NULL_TREE
;
15151 /* Substitute into the qualifying scope. When there are no ARGS, we
15152 are just trying to simplify a non-dependent expression. In that
15153 case the qualifying scope may be dependent, and, in any case,
15154 substituting will not help. */
15155 scope
= TREE_OPERAND (qualified_id
, 0);
15158 scope
= tsubst (scope
, args
, complain
, in_decl
);
15159 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
15164 if (dependent_scope_p (scope
))
15167 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
15168 tree r
= build_qualified_name (NULL_TREE
, scope
, expr
,
15169 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
15170 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (qualified_id
);
15174 if (!BASELINK_P (name
) && !DECL_P (expr
))
15176 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
15178 /* A BIT_NOT_EXPR is used to represent a destructor. */
15179 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
15181 error ("qualifying type %qT does not match destructor name ~%qT",
15182 scope
, TREE_OPERAND (expr
, 0));
15183 expr
= error_mark_node
;
15186 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
15187 /*is_type_p=*/0, false);
15190 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
15191 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
15192 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
15194 if (complain
& tf_error
)
15196 error ("dependent-name %qE is parsed as a non-type, but "
15197 "instantiation yields a type", qualified_id
);
15198 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
15200 return error_mark_node
;
15206 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
15208 /* Remember that there was a reference to this entity. */
15209 if (!mark_used (expr
, complain
) && !(complain
& tf_error
))
15210 return error_mark_node
;
15213 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
15215 if (complain
& tf_error
)
15216 qualified_name_lookup_error (scope
,
15217 TREE_OPERAND (qualified_id
, 1),
15218 expr
, input_location
);
15219 return error_mark_node
;
15224 /* We may be repeating a check already done during parsing, but
15225 if it was well-formed and passed then, it will pass again
15226 now, and if it didn't, we wouldn't have got here. The case
15227 we want to catch is when we couldn't tell then, and can now,
15228 namely when templ prior to substitution was an
15230 if (flag_concepts
&& check_auto_in_tmpl_args (expr
, template_args
))
15231 return error_mark_node
;
15233 if (variable_template_p (expr
))
15234 expr
= lookup_and_finish_template_variable (expr
, template_args
,
15237 expr
= lookup_template_function (expr
, template_args
);
15240 if (expr
== error_mark_node
&& complain
& tf_error
)
15241 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
15242 expr
, input_location
);
15243 else if (TYPE_P (scope
))
15245 expr
= (adjust_result_of_qualified_name_lookup
15246 (expr
, scope
, current_nonlambda_class_type ()));
15247 expr
= (finish_qualified_id_expr
15248 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
15249 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
15250 /*template_arg_p=*/false, complain
));
15253 /* Expressions do not generally have reference type. */
15254 if (TREE_CODE (expr
) != SCOPE_REF
15255 /* However, if we're about to form a pointer-to-member, we just
15256 want the referenced member referenced. */
15257 && TREE_CODE (expr
) != OFFSET_REF
)
15258 expr
= convert_from_reference (expr
);
15260 if (REF_PARENTHESIZED_P (qualified_id
))
15261 expr
= force_paren_expr (expr
);
15266 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
15267 initializer, DECL is the substituted VAR_DECL. Other arguments are as
15271 tsubst_init (tree init
, tree decl
, tree args
,
15272 tsubst_flags_t complain
, tree in_decl
)
15277 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
15279 if (!init
&& TREE_TYPE (decl
) != error_mark_node
)
15281 /* If we had an initializer but it
15282 instantiated to nothing,
15283 value-initialize the object. This will
15284 only occur when the initializer was a
15285 pack expansion where the parameter packs
15286 used in that expansion were of length
15288 init
= build_value_init (TREE_TYPE (decl
),
15290 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
15291 init
= get_target_expr_sfinae (init
, complain
);
15292 if (TREE_CODE (init
) == TARGET_EXPR
)
15293 TARGET_EXPR_DIRECT_INIT_P (init
) = true;
15299 /* Like tsubst, but deals with expressions. This function just replaces
15300 template parms; to finish processing the resultant expression, use
15301 tsubst_copy_and_build or tsubst_expr. */
15304 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
15306 enum tree_code code
;
15309 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
15312 code
= TREE_CODE (t
);
15317 r
= retrieve_local_specialization (t
);
15319 if (r
== NULL_TREE
)
15321 /* We get here for a use of 'this' in an NSDMI. */
15322 if (DECL_NAME (t
) == this_identifier
&& current_class_ptr
)
15323 return current_class_ptr
;
15325 /* This can happen for a parameter name used later in a function
15326 declaration (such as in a late-specified return type). Just
15327 make a dummy decl, since it's only used for its type. */
15328 gcc_assert (cp_unevaluated_operand
!= 0);
15329 r
= tsubst_decl (t
, args
, complain
);
15330 /* Give it the template pattern as its context; its true context
15331 hasn't been instantiated yet and this is good enough for
15333 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
15336 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
15337 r
= argument_pack_select_arg (r
);
15338 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
15339 return error_mark_node
;
15347 if (DECL_TEMPLATE_PARM_P (t
))
15348 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
15349 /* There is no need to substitute into namespace-scope
15351 if (DECL_NAMESPACE_SCOPE_P (t
))
15353 /* If ARGS is NULL, then T is known to be non-dependent. */
15354 if (args
== NULL_TREE
)
15355 return scalar_constant_value (t
);
15357 /* Unfortunately, we cannot just call lookup_name here.
15360 template <int I> int f() {
15362 struct S { void g() { E e = a; } };
15365 When we instantiate f<7>::S::g(), say, lookup_name is not
15366 clever enough to find f<7>::a. */
15368 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
15369 /*entering_scope=*/0);
15371 for (v
= TYPE_VALUES (enum_type
);
15373 v
= TREE_CHAIN (v
))
15374 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
15375 return TREE_VALUE (v
);
15377 /* We didn't find the name. That should never happen; if
15378 name-lookup found it during preliminary parsing, we
15379 should find it again here during instantiation. */
15380 gcc_unreachable ();
15385 if (DECL_CONTEXT (t
))
15389 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
15390 /*entering_scope=*/1);
15391 if (ctx
!= DECL_CONTEXT (t
))
15393 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
15396 if (complain
& tf_error
)
15397 error ("using invalid field %qD", t
);
15398 return error_mark_node
;
15407 case FUNCTION_DECL
:
15408 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
15409 r
= tsubst (t
, args
, complain
, in_decl
);
15410 else if (local_variable_p (t
)
15411 && uses_template_parms (DECL_CONTEXT (t
)))
15413 r
= retrieve_local_specialization (t
);
15414 if (r
== NULL_TREE
)
15416 /* First try name lookup to find the instantiation. */
15417 r
= lookup_name (DECL_NAME (t
));
15418 if (r
&& !is_capture_proxy (r
))
15420 /* Make sure that the one we found is the one we want. */
15421 tree ctx
= enclosing_instantiation_of (DECL_CONTEXT (t
));
15422 if (ctx
!= DECL_CONTEXT (r
))
15430 /* This can happen for a variable used in a
15431 late-specified return type of a local lambda, or for a
15432 local static or constant. Building a new VAR_DECL
15433 should be OK in all those cases. */
15434 r
= tsubst_decl (t
, args
, complain
);
15435 if (local_specializations
)
15436 /* Avoid infinite recursion (79640). */
15437 register_local_specialization (r
, t
);
15438 if (decl_maybe_constant_var_p (r
))
15440 /* We can't call cp_finish_decl, so handle the
15441 initializer by hand. */
15442 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
15443 complain
, in_decl
);
15444 if (!processing_template_decl
)
15445 init
= maybe_constant_init (init
);
15446 if (processing_template_decl
15447 ? potential_constant_expression (init
)
15448 : reduced_constant_expression_p (init
))
15449 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
15450 = TREE_CONSTANT (r
) = true;
15451 DECL_INITIAL (r
) = init
;
15452 if (tree auto_node
= type_uses_auto (TREE_TYPE (r
)))
15454 = do_auto_deduction (TREE_TYPE (r
), init
, auto_node
,
15455 complain
, adc_variable_type
);
15457 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
15458 || decl_constant_var_p (r
)
15459 || errorcount
|| sorrycount
);
15460 if (!processing_template_decl
15461 && !TREE_STATIC (r
))
15462 r
= process_outer_var_ref (r
, complain
);
15464 /* Remember this for subsequent uses. */
15465 if (local_specializations
)
15466 register_local_specialization (r
, t
);
15468 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
15469 r
= argument_pack_select_arg (r
);
15473 if (!mark_used (r
, complain
))
15474 return error_mark_node
;
15477 case NAMESPACE_DECL
:
15481 /* An OVERLOAD will always be a non-dependent overload set; an
15482 overload set from function scope will just be represented with an
15483 IDENTIFIER_NODE, and from class scope with a BASELINK. */
15484 gcc_assert (!uses_template_parms (t
));
15485 /* We must have marked any lookups as persistent. */
15486 gcc_assert (!OVL_LOOKUP_P (t
) || OVL_USED_P (t
));
15490 return tsubst_baselink (t
, current_nonlambda_class_type (),
15491 args
, complain
, in_decl
);
15493 case TEMPLATE_DECL
:
15494 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
15495 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
15496 args
, complain
, in_decl
);
15497 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
15498 return tsubst (t
, args
, complain
, in_decl
);
15499 else if (DECL_CLASS_SCOPE_P (t
)
15500 && uses_template_parms (DECL_CONTEXT (t
)))
15502 /* Template template argument like the following example need
15505 template <template <class> class TT> struct C {};
15506 template <class T> struct D {
15507 template <class U> struct E {};
15512 We are processing the template argument `E' in #1 for
15513 the template instantiation #2. Originally, `E' is a
15514 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
15515 have to substitute this with one having context `D<int>'. */
15517 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
15518 if (dependent_scope_p (context
))
15520 /* When rewriting a constructor into a deduction guide, a
15521 non-dependent name can become dependent, so memtmpl<args>
15522 becomes context::template memtmpl<args>. */
15523 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15524 return build_qualified_name (type
, context
, DECL_NAME (t
),
15527 return lookup_field (context
, DECL_NAME(t
), 0, false);
15530 /* Ordinary template template argument. */
15533 case NON_LVALUE_EXPR
:
15534 case VIEW_CONVERT_EXPR
:
15536 /* Handle location wrappers by substituting the wrapped node
15537 first, *then* reusing the resulting type. Doing the type
15538 first ensures that we handle template parameters and
15539 parameter pack expansions. */
15540 gcc_assert (location_wrapper_p (t
));
15541 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15542 return maybe_wrap_with_location (op0
, EXPR_LOCATION (t
));
15546 case REINTERPRET_CAST_EXPR
:
15547 case CONST_CAST_EXPR
:
15548 case STATIC_CAST_EXPR
:
15549 case DYNAMIC_CAST_EXPR
:
15550 case IMPLICIT_CONV_EXPR
:
15554 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15555 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15556 return build1 (code
, type
, op0
);
15560 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0))
15561 || ARGUMENT_PACK_P (TREE_OPERAND (t
, 0)))
15563 tree expanded
, op
= TREE_OPERAND (t
, 0);
15566 if (SIZEOF_EXPR_TYPE_P (t
))
15567 op
= TREE_TYPE (op
);
15569 ++cp_unevaluated_operand
;
15570 ++c_inhibit_evaluation_warnings
;
15571 /* We only want to compute the number of arguments. */
15572 if (PACK_EXPANSION_P (op
))
15573 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
15575 expanded
= tsubst_template_args (ARGUMENT_PACK_ARGS (op
),
15576 args
, complain
, in_decl
);
15577 --cp_unevaluated_operand
;
15578 --c_inhibit_evaluation_warnings
;
15580 if (TREE_CODE (expanded
) == TREE_VEC
)
15582 len
= TREE_VEC_LENGTH (expanded
);
15583 /* Set TREE_USED for the benefit of -Wunused. */
15584 for (int i
= 0; i
< len
; i
++)
15585 if (DECL_P (TREE_VEC_ELT (expanded
, i
)))
15586 TREE_USED (TREE_VEC_ELT (expanded
, i
)) = true;
15589 if (expanded
== error_mark_node
)
15590 return error_mark_node
;
15591 else if (PACK_EXPANSION_P (expanded
)
15592 || (TREE_CODE (expanded
) == TREE_VEC
15593 && pack_expansion_args_count (expanded
)))
15596 if (PACK_EXPANSION_P (expanded
))
15598 else if (TREE_VEC_LENGTH (expanded
) == 1)
15599 expanded
= TREE_VEC_ELT (expanded
, 0);
15601 expanded
= make_argument_pack (expanded
);
15603 if (TYPE_P (expanded
))
15604 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
15606 complain
& tf_error
);
15608 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
15609 complain
& tf_error
);
15612 return build_int_cst (size_type_node
, len
);
15614 if (SIZEOF_EXPR_TYPE_P (t
))
15616 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
15617 args
, complain
, in_decl
);
15618 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
15619 r
= build1 (SIZEOF_EXPR
,
15620 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
15621 SIZEOF_EXPR_TYPE_P (r
) = 1;
15628 case TRUTH_NOT_EXPR
:
15631 case UNARY_PLUS_EXPR
: /* Unary + */
15633 case AT_ENCODE_EXPR
:
15637 case REALPART_EXPR
:
15638 case IMAGPART_EXPR
:
15641 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15642 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15643 r
= build1 (code
, type
, op0
);
15644 if (code
== ALIGNOF_EXPR
)
15645 ALIGNOF_EXPR_STD_P (r
) = ALIGNOF_EXPR_STD_P (t
);
15649 case COMPONENT_REF
:
15654 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15655 name
= TREE_OPERAND (t
, 1);
15656 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
15658 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
15659 complain
, in_decl
);
15660 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
15662 else if (TREE_CODE (name
) == SCOPE_REF
15663 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
15665 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
15666 complain
, in_decl
);
15667 name
= TREE_OPERAND (name
, 1);
15668 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
15669 complain
, in_decl
);
15670 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
15671 name
= build_qualified_name (/*type=*/NULL_TREE
,
15673 /*template_p=*/false);
15675 else if (BASELINK_P (name
))
15676 name
= tsubst_baselink (name
,
15677 non_reference (TREE_TYPE (object
)),
15681 name
= tsubst_copy (name
, args
, complain
, in_decl
);
15682 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
15688 case TRUNC_DIV_EXPR
:
15689 case CEIL_DIV_EXPR
:
15690 case FLOOR_DIV_EXPR
:
15691 case ROUND_DIV_EXPR
:
15692 case EXACT_DIV_EXPR
:
15696 case TRUNC_MOD_EXPR
:
15697 case FLOOR_MOD_EXPR
:
15698 case TRUTH_ANDIF_EXPR
:
15699 case TRUTH_ORIF_EXPR
:
15700 case TRUTH_AND_EXPR
:
15701 case TRUTH_OR_EXPR
:
15714 case COMPOUND_EXPR
:
15717 case PREDECREMENT_EXPR
:
15718 case PREINCREMENT_EXPR
:
15719 case POSTDECREMENT_EXPR
:
15720 case POSTINCREMENT_EXPR
:
15722 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15723 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15724 return build_nt (code
, op0
, op1
);
15729 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15730 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15731 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
15732 QUALIFIED_NAME_IS_TEMPLATE (t
));
15737 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15738 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15739 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
15744 int n
= VL_EXP_OPERAND_LENGTH (t
);
15745 tree result
= build_vl_exp (CALL_EXPR
, n
);
15747 for (i
= 0; i
< n
; i
++)
15748 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
15749 complain
, in_decl
);
15755 case PSEUDO_DTOR_EXPR
:
15756 case VEC_PERM_EXPR
:
15758 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15759 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15760 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
15761 r
= build_nt (code
, op0
, op1
, op2
);
15762 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
15768 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15769 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15770 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
15771 r
= build_nt (code
, op0
, op1
, op2
);
15772 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
15778 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15779 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15780 r
= build_nt (code
, op0
, op1
);
15781 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
15782 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
15786 case TEMPLATE_ID_EXPR
:
15788 /* Substituted template arguments */
15789 tree fn
= TREE_OPERAND (t
, 0);
15790 tree targs
= TREE_OPERAND (t
, 1);
15792 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
15794 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
15796 return lookup_template_function (fn
, targs
);
15801 tree purpose
, value
, chain
;
15803 if (t
== void_list_node
)
15806 purpose
= TREE_PURPOSE (t
);
15808 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
15809 value
= TREE_VALUE (t
);
15811 value
= tsubst_copy (value
, args
, complain
, in_decl
);
15812 chain
= TREE_CHAIN (t
);
15813 if (chain
&& chain
!= void_type_node
)
15814 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
15815 if (purpose
== TREE_PURPOSE (t
)
15816 && value
== TREE_VALUE (t
)
15817 && chain
== TREE_CHAIN (t
))
15819 return tree_cons (purpose
, value
, chain
);
15824 case ENUMERAL_TYPE
:
15826 case TEMPLATE_TYPE_PARM
:
15827 case TEMPLATE_TEMPLATE_PARM
:
15828 case BOUND_TEMPLATE_TEMPLATE_PARM
:
15829 case TEMPLATE_PARM_INDEX
:
15831 case REFERENCE_TYPE
:
15833 case FUNCTION_TYPE
:
15836 case TYPENAME_TYPE
:
15837 case UNBOUND_CLASS_TEMPLATE
:
15839 case DECLTYPE_TYPE
:
15841 return tsubst (t
, args
, complain
, in_decl
);
15845 /* Fall through. */
15846 case IDENTIFIER_NODE
:
15847 if (IDENTIFIER_CONV_OP_P (t
))
15849 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15850 return make_conv_op_name (new_type
);
15856 /* This is handled by tsubst_copy_and_build. */
15857 gcc_unreachable ();
15861 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15862 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15863 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
15866 case CLEANUP_POINT_EXPR
:
15867 /* We shouldn't have built any of these during initial template
15868 generation. Instead, they should be built during instantiation
15869 in response to the saved STMT_IS_FULL_EXPR_P setting. */
15870 gcc_unreachable ();
15874 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15875 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15876 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15877 r
= build2 (code
, type
, op0
, op1
);
15878 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
15879 if (!mark_used (TREE_OPERAND (r
, 1), complain
)
15880 && !(complain
& tf_error
))
15881 return error_mark_node
;
15885 case EXPR_PACK_EXPANSION
:
15886 error ("invalid use of pack expansion expression");
15887 return error_mark_node
;
15889 case NONTYPE_ARGUMENT_PACK
:
15890 error ("use %<...%> to expand argument pack");
15891 return error_mark_node
;
15894 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
15902 /* Instantiate any typedefs in the type. */
15903 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15904 r
= fold_convert (type
, t
);
15905 gcc_assert (TREE_CODE (r
) == code
);
15910 /* These can sometimes show up in a partial instantiation, but never
15911 involve template parms. */
15912 gcc_assert (!uses_template_parms (t
));
15915 case UNARY_LEFT_FOLD_EXPR
:
15916 return tsubst_unary_left_fold (t
, args
, complain
, in_decl
);
15917 case UNARY_RIGHT_FOLD_EXPR
:
15918 return tsubst_unary_right_fold (t
, args
, complain
, in_decl
);
15919 case BINARY_LEFT_FOLD_EXPR
:
15920 return tsubst_binary_left_fold (t
, args
, complain
, in_decl
);
15921 case BINARY_RIGHT_FOLD_EXPR
:
15922 return tsubst_binary_right_fold (t
, args
, complain
, in_decl
);
15926 case DEBUG_BEGIN_STMT
:
15927 /* ??? There's no point in copying it for now, but maybe some
15928 day it will contain more information, such as a pointer back
15929 to the containing function, inlined copy or so. */
15933 /* We shouldn't get here, but keep going if !flag_checking. */
15935 gcc_unreachable ();
15940 /* Helper function for tsubst_omp_clauses, used for instantiation of
15941 OMP_CLAUSE_DECL of clauses. */
15944 tsubst_omp_clause_decl (tree decl
, tree args
, tsubst_flags_t complain
,
15947 if (decl
== NULL_TREE
)
15950 /* Handle an OpenMP array section represented as a TREE_LIST (or
15951 OMP_CLAUSE_DEPEND_KIND). An OMP_CLAUSE_DEPEND (with a depend
15952 kind of OMP_CLAUSE_DEPEND_SINK) can also be represented as a
15953 TREE_LIST. We can handle it exactly the same as an array section
15954 (purpose, value, and a chain), even though the nomenclature
15955 (low_bound, length, etc) is different. */
15956 if (TREE_CODE (decl
) == TREE_LIST
)
15959 = tsubst_expr (TREE_PURPOSE (decl
), args
, complain
, in_decl
,
15960 /*integral_constant_expression_p=*/false);
15961 tree length
= tsubst_expr (TREE_VALUE (decl
), args
, complain
, in_decl
,
15962 /*integral_constant_expression_p=*/false);
15963 tree chain
= tsubst_omp_clause_decl (TREE_CHAIN (decl
), args
, complain
,
15965 if (TREE_PURPOSE (decl
) == low_bound
15966 && TREE_VALUE (decl
) == length
15967 && TREE_CHAIN (decl
) == chain
)
15969 tree ret
= tree_cons (low_bound
, length
, chain
);
15970 OMP_CLAUSE_DEPEND_SINK_NEGATIVE (ret
)
15971 = OMP_CLAUSE_DEPEND_SINK_NEGATIVE (decl
);
15974 tree ret
= tsubst_expr (decl
, args
, complain
, in_decl
,
15975 /*integral_constant_expression_p=*/false);
15976 /* Undo convert_from_reference tsubst_expr could have called. */
15978 && REFERENCE_REF_P (ret
)
15979 && !REFERENCE_REF_P (decl
))
15980 ret
= TREE_OPERAND (ret
, 0);
15984 /* Like tsubst_copy, but specifically for OpenMP clauses. */
15987 tsubst_omp_clauses (tree clauses
, enum c_omp_region_type ort
,
15988 tree args
, tsubst_flags_t complain
, tree in_decl
)
15990 tree new_clauses
= NULL_TREE
, nc
, oc
;
15991 tree linear_no_step
= NULL_TREE
;
15993 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
15995 nc
= copy_node (oc
);
15996 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
15999 switch (OMP_CLAUSE_CODE (nc
))
16001 case OMP_CLAUSE_LASTPRIVATE
:
16002 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
16004 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
16005 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
16006 in_decl
, /*integral_constant_expression_p=*/false);
16007 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
16008 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
16011 case OMP_CLAUSE_PRIVATE
:
16012 case OMP_CLAUSE_SHARED
:
16013 case OMP_CLAUSE_FIRSTPRIVATE
:
16014 case OMP_CLAUSE_COPYIN
:
16015 case OMP_CLAUSE_COPYPRIVATE
:
16016 case OMP_CLAUSE_UNIFORM
:
16017 case OMP_CLAUSE_DEPEND
:
16018 case OMP_CLAUSE_FROM
:
16019 case OMP_CLAUSE_TO
:
16020 case OMP_CLAUSE_MAP
:
16021 case OMP_CLAUSE_USE_DEVICE_PTR
:
16022 case OMP_CLAUSE_IS_DEVICE_PTR
:
16023 OMP_CLAUSE_DECL (nc
)
16024 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
16027 case OMP_CLAUSE_TILE
:
16028 case OMP_CLAUSE_IF
:
16029 case OMP_CLAUSE_NUM_THREADS
:
16030 case OMP_CLAUSE_SCHEDULE
:
16031 case OMP_CLAUSE_COLLAPSE
:
16032 case OMP_CLAUSE_FINAL
:
16033 case OMP_CLAUSE_DEVICE
:
16034 case OMP_CLAUSE_DIST_SCHEDULE
:
16035 case OMP_CLAUSE_NUM_TEAMS
:
16036 case OMP_CLAUSE_THREAD_LIMIT
:
16037 case OMP_CLAUSE_SAFELEN
:
16038 case OMP_CLAUSE_SIMDLEN
:
16039 case OMP_CLAUSE_NUM_TASKS
:
16040 case OMP_CLAUSE_GRAINSIZE
:
16041 case OMP_CLAUSE_PRIORITY
:
16042 case OMP_CLAUSE_ORDERED
:
16043 case OMP_CLAUSE_HINT
:
16044 case OMP_CLAUSE_NUM_GANGS
:
16045 case OMP_CLAUSE_NUM_WORKERS
:
16046 case OMP_CLAUSE_VECTOR_LENGTH
:
16047 case OMP_CLAUSE_WORKER
:
16048 case OMP_CLAUSE_VECTOR
:
16049 case OMP_CLAUSE_ASYNC
:
16050 case OMP_CLAUSE_WAIT
:
16051 OMP_CLAUSE_OPERAND (nc
, 0)
16052 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
16053 in_decl
, /*integral_constant_expression_p=*/false);
16055 case OMP_CLAUSE_REDUCTION
:
16056 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
16058 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
16059 if (TREE_CODE (placeholder
) == SCOPE_REF
)
16061 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
16062 complain
, in_decl
);
16063 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
16064 = build_qualified_name (NULL_TREE
, scope
,
16065 TREE_OPERAND (placeholder
, 1),
16069 gcc_assert (identifier_p (placeholder
));
16071 OMP_CLAUSE_DECL (nc
)
16072 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
16075 case OMP_CLAUSE_GANG
:
16076 case OMP_CLAUSE_ALIGNED
:
16077 OMP_CLAUSE_DECL (nc
)
16078 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
16080 OMP_CLAUSE_OPERAND (nc
, 1)
16081 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
16082 in_decl
, /*integral_constant_expression_p=*/false);
16084 case OMP_CLAUSE_LINEAR
:
16085 OMP_CLAUSE_DECL (nc
)
16086 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
16088 if (OMP_CLAUSE_LINEAR_STEP (oc
) == NULL_TREE
)
16090 gcc_assert (!linear_no_step
);
16091 linear_no_step
= nc
;
16093 else if (OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (oc
))
16094 OMP_CLAUSE_LINEAR_STEP (nc
)
16095 = tsubst_omp_clause_decl (OMP_CLAUSE_LINEAR_STEP (oc
), args
,
16096 complain
, in_decl
);
16098 OMP_CLAUSE_LINEAR_STEP (nc
)
16099 = tsubst_expr (OMP_CLAUSE_LINEAR_STEP (oc
), args
, complain
,
16101 /*integral_constant_expression_p=*/false);
16103 case OMP_CLAUSE_NOWAIT
:
16104 case OMP_CLAUSE_DEFAULT
:
16105 case OMP_CLAUSE_UNTIED
:
16106 case OMP_CLAUSE_MERGEABLE
:
16107 case OMP_CLAUSE_INBRANCH
:
16108 case OMP_CLAUSE_NOTINBRANCH
:
16109 case OMP_CLAUSE_PROC_BIND
:
16110 case OMP_CLAUSE_FOR
:
16111 case OMP_CLAUSE_PARALLEL
:
16112 case OMP_CLAUSE_SECTIONS
:
16113 case OMP_CLAUSE_TASKGROUP
:
16114 case OMP_CLAUSE_NOGROUP
:
16115 case OMP_CLAUSE_THREADS
:
16116 case OMP_CLAUSE_SIMD
:
16117 case OMP_CLAUSE_DEFAULTMAP
:
16118 case OMP_CLAUSE_INDEPENDENT
:
16119 case OMP_CLAUSE_AUTO
:
16120 case OMP_CLAUSE_SEQ
:
16121 case OMP_CLAUSE_IF_PRESENT
:
16122 case OMP_CLAUSE_FINALIZE
:
16125 gcc_unreachable ();
16127 if ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
)
16128 switch (OMP_CLAUSE_CODE (nc
))
16130 case OMP_CLAUSE_SHARED
:
16131 case OMP_CLAUSE_PRIVATE
:
16132 case OMP_CLAUSE_FIRSTPRIVATE
:
16133 case OMP_CLAUSE_LASTPRIVATE
:
16134 case OMP_CLAUSE_COPYPRIVATE
:
16135 case OMP_CLAUSE_LINEAR
:
16136 case OMP_CLAUSE_REDUCTION
:
16137 case OMP_CLAUSE_USE_DEVICE_PTR
:
16138 case OMP_CLAUSE_IS_DEVICE_PTR
:
16139 /* tsubst_expr on SCOPE_REF results in returning
16140 finish_non_static_data_member result. Undo that here. */
16141 if (TREE_CODE (OMP_CLAUSE_DECL (oc
)) == SCOPE_REF
16142 && (TREE_CODE (TREE_OPERAND (OMP_CLAUSE_DECL (oc
), 1))
16143 == IDENTIFIER_NODE
))
16145 tree t
= OMP_CLAUSE_DECL (nc
);
16148 switch (TREE_CODE (v
))
16150 case COMPONENT_REF
:
16154 case POINTER_PLUS_EXPR
:
16155 v
= TREE_OPERAND (v
, 0);
16158 if (DECL_CONTEXT (v
) == current_function_decl
16159 && DECL_ARTIFICIAL (v
)
16160 && DECL_NAME (v
) == this_identifier
)
16161 OMP_CLAUSE_DECL (nc
) = TREE_OPERAND (t
, 1);
16168 else if (VAR_P (OMP_CLAUSE_DECL (oc
))
16169 && DECL_HAS_VALUE_EXPR_P (OMP_CLAUSE_DECL (oc
))
16170 && DECL_ARTIFICIAL (OMP_CLAUSE_DECL (oc
))
16171 && DECL_LANG_SPECIFIC (OMP_CLAUSE_DECL (oc
))
16172 && DECL_OMP_PRIVATIZED_MEMBER (OMP_CLAUSE_DECL (oc
)))
16174 tree decl
= OMP_CLAUSE_DECL (nc
);
16177 retrofit_lang_decl (decl
);
16178 DECL_OMP_PRIVATIZED_MEMBER (decl
) = 1;
16187 new_clauses
= nreverse (new_clauses
);
16188 if (ort
!= C_ORT_OMP_DECLARE_SIMD
)
16190 new_clauses
= finish_omp_clauses (new_clauses
, ort
);
16191 if (linear_no_step
)
16192 for (nc
= new_clauses
; nc
; nc
= OMP_CLAUSE_CHAIN (nc
))
16193 if (nc
== linear_no_step
)
16195 OMP_CLAUSE_LINEAR_STEP (nc
) = NULL_TREE
;
16199 return new_clauses
;
16202 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
16205 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
16208 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
16210 tree purpose
, value
, chain
;
16215 if (TREE_CODE (t
) != TREE_LIST
)
16216 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
16217 /*function_p=*/false,
16218 /*integral_constant_expression_p=*/false);
16220 if (t
== void_list_node
)
16223 purpose
= TREE_PURPOSE (t
);
16225 purpose
= RECUR (purpose
);
16226 value
= TREE_VALUE (t
);
16229 if (TREE_CODE (value
) != LABEL_DECL
)
16230 value
= RECUR (value
);
16233 value
= lookup_label (DECL_NAME (value
));
16234 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
16235 TREE_USED (value
) = 1;
16238 chain
= TREE_CHAIN (t
);
16239 if (chain
&& chain
!= void_type_node
)
16240 chain
= RECUR (chain
);
16241 return tree_cons (purpose
, value
, chain
);
16245 /* Used to temporarily communicate the list of #pragma omp parallel
16246 clauses to #pragma omp for instantiation if they are combined
16249 static tree
*omp_parallel_combined_clauses
;
16251 /* Substitute one OMP_FOR iterator. */
16254 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree orig_declv
,
16255 tree initv
, tree condv
, tree incrv
, tree
*clauses
,
16256 tree args
, tsubst_flags_t complain
, tree in_decl
,
16257 bool integral_constant_expression_p
)
16259 #define RECUR(NODE) \
16260 tsubst_expr ((NODE), args, complain, in_decl, \
16261 integral_constant_expression_p)
16262 tree decl
, init
, cond
, incr
;
16264 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
16265 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
16267 if (orig_declv
&& OMP_FOR_ORIG_DECLS (t
))
16269 tree o
= TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (t
), i
);
16270 TREE_VEC_ELT (orig_declv
, i
) = RECUR (o
);
16273 decl
= TREE_OPERAND (init
, 0);
16274 init
= TREE_OPERAND (init
, 1);
16275 tree decl_expr
= NULL_TREE
;
16276 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
16278 /* We need to jump through some hoops to handle declarations in the
16279 init-statement, since we might need to handle auto deduction,
16280 but we need to keep control of initialization. */
16282 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
16283 decl
= tsubst_decl (decl
, args
, complain
);
16287 if (TREE_CODE (decl
) == SCOPE_REF
)
16289 decl
= RECUR (decl
);
16290 if (TREE_CODE (decl
) == COMPONENT_REF
)
16294 switch (TREE_CODE (v
))
16296 case COMPONENT_REF
:
16300 case POINTER_PLUS_EXPR
:
16301 v
= TREE_OPERAND (v
, 0);
16304 if (DECL_CONTEXT (v
) == current_function_decl
16305 && DECL_ARTIFICIAL (v
)
16306 && DECL_NAME (v
) == this_identifier
)
16308 decl
= TREE_OPERAND (decl
, 1);
16309 decl
= omp_privatize_field (decl
, false);
16319 decl
= RECUR (decl
);
16321 init
= RECUR (init
);
16323 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
16324 if (auto_node
&& init
)
16326 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
, complain
);
16328 gcc_assert (!type_dependent_expression_p (decl
));
16330 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
16334 /* Declare the variable, but don't let that initialize it. */
16335 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
16336 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
16338 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
16341 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
16342 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
16343 if (TREE_CODE (incr
) == MODIFY_EXPR
)
16345 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
16346 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
16347 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
16348 NOP_EXPR
, rhs
, complain
);
16351 incr
= RECUR (incr
);
16352 TREE_VEC_ELT (declv
, i
) = decl
;
16353 TREE_VEC_ELT (initv
, i
) = init
;
16354 TREE_VEC_ELT (condv
, i
) = cond
;
16355 TREE_VEC_ELT (incrv
, i
) = incr
;
16361 /* Declare and initialize the variable. */
16369 for (j
= (omp_parallel_combined_clauses
== NULL
? 1 : 0); j
< 2; j
++)
16371 for (pc
= j
? clauses
: omp_parallel_combined_clauses
; *pc
; )
16373 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_PRIVATE
16374 && OMP_CLAUSE_DECL (*pc
) == decl
)
16376 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_LASTPRIVATE
16377 && OMP_CLAUSE_DECL (*pc
) == decl
)
16381 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
16383 *pc
= OMP_CLAUSE_CHAIN (c
);
16384 OMP_CLAUSE_CHAIN (c
) = *clauses
;
16387 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_FIRSTPRIVATE
16388 && OMP_CLAUSE_DECL (*pc
) == decl
)
16390 error ("iteration variable %qD should not be firstprivate",
16392 *pc
= OMP_CLAUSE_CHAIN (*pc
);
16394 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_REDUCTION
16395 && OMP_CLAUSE_DECL (*pc
) == decl
)
16397 error ("iteration variable %qD should not be reduction",
16399 *pc
= OMP_CLAUSE_CHAIN (*pc
);
16402 pc
= &OMP_CLAUSE_CHAIN (*pc
);
16407 if (*pc
== NULL_TREE
)
16409 tree c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
16410 OMP_CLAUSE_DECL (c
) = decl
;
16411 c
= finish_omp_clauses (c
, C_ORT_OMP
);
16414 OMP_CLAUSE_CHAIN (c
) = *clauses
;
16419 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
16420 if (COMPARISON_CLASS_P (cond
))
16422 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
16423 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
16424 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
16427 cond
= RECUR (cond
);
16428 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
16429 switch (TREE_CODE (incr
))
16431 case PREINCREMENT_EXPR
:
16432 case PREDECREMENT_EXPR
:
16433 case POSTINCREMENT_EXPR
:
16434 case POSTDECREMENT_EXPR
:
16435 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
16436 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
16439 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
16440 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
16442 tree rhs
= TREE_OPERAND (incr
, 1);
16443 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
16444 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
16445 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
16446 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
16447 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
16451 incr
= RECUR (incr
);
16454 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
16455 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
16457 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
16458 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
16459 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
16460 TREE_TYPE (decl
), lhs
,
16461 RECUR (TREE_OPERAND (incr
, 2))));
16463 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
16464 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
16465 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
16467 tree rhs
= TREE_OPERAND (incr
, 2);
16468 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
16469 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
16470 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
16471 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
16472 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
16476 incr
= RECUR (incr
);
16479 incr
= RECUR (incr
);
16483 TREE_VEC_ELT (declv
, i
) = decl
;
16484 TREE_VEC_ELT (initv
, i
) = init
;
16485 TREE_VEC_ELT (condv
, i
) = cond
;
16486 TREE_VEC_ELT (incrv
, i
) = incr
;
16490 /* Helper function of tsubst_expr, find OMP_TEAMS inside
16491 of OMP_TARGET's body. */
16494 tsubst_find_omp_teams (tree
*tp
, int *walk_subtrees
, void *)
16496 *walk_subtrees
= 0;
16497 switch (TREE_CODE (*tp
))
16502 case STATEMENT_LIST
:
16503 *walk_subtrees
= 1;
16511 /* Helper function for tsubst_expr. For decomposition declaration
16512 artificial base DECL, which is tsubsted PATTERN_DECL, tsubst
16513 also the corresponding decls representing the identifiers
16514 of the decomposition declaration. Return DECL if successful
16515 or error_mark_node otherwise, set *FIRST to the first decl
16516 in the list chained through DECL_CHAIN and *CNT to the number
16520 tsubst_decomp_names (tree decl
, tree pattern_decl
, tree args
,
16521 tsubst_flags_t complain
, tree in_decl
, tree
*first
,
16524 tree decl2
, decl3
, prev
= decl
;
16526 gcc_assert (DECL_NAME (decl
) == NULL_TREE
);
16527 for (decl2
= DECL_CHAIN (pattern_decl
);
16530 && DECL_DECOMPOSITION_P (decl2
)
16531 && DECL_NAME (decl2
);
16532 decl2
= DECL_CHAIN (decl2
))
16534 if (TREE_TYPE (decl2
) == error_mark_node
&& *cnt
== 0)
16536 gcc_assert (errorcount
);
16537 return error_mark_node
;
16540 gcc_assert (DECL_DECOMP_BASE (decl2
) == pattern_decl
);
16541 gcc_assert (DECL_HAS_VALUE_EXPR_P (decl2
));
16542 tree v
= DECL_VALUE_EXPR (decl2
);
16543 DECL_HAS_VALUE_EXPR_P (decl2
) = 0;
16544 SET_DECL_VALUE_EXPR (decl2
, NULL_TREE
);
16545 decl3
= tsubst (decl2
, args
, complain
, in_decl
);
16546 SET_DECL_VALUE_EXPR (decl2
, v
);
16547 DECL_HAS_VALUE_EXPR_P (decl2
) = 1;
16549 DECL_TEMPLATE_INSTANTIATED (decl3
) = 1;
16552 gcc_assert (errorcount
);
16553 decl
= error_mark_node
;
16556 maybe_push_decl (decl3
);
16557 if (error_operand_p (decl3
))
16558 decl
= error_mark_node
;
16559 else if (decl
!= error_mark_node
16560 && DECL_CHAIN (decl3
) != prev
16563 gcc_assert (errorcount
);
16564 decl
= error_mark_node
;
16573 /* Like tsubst_copy for expressions, etc. but also does semantic
16577 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
16578 bool integral_constant_expression_p
)
16580 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
16581 #define RECUR(NODE) \
16582 tsubst_expr ((NODE), args, complain, in_decl, \
16583 integral_constant_expression_p)
16589 if (t
== NULL_TREE
|| t
== error_mark_node
)
16592 loc
= input_location
;
16593 if (location_t eloc
= cp_expr_location (t
))
16594 input_location
= eloc
;
16595 if (STATEMENT_CODE_P (TREE_CODE (t
)))
16596 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
16598 switch (TREE_CODE (t
))
16600 case STATEMENT_LIST
:
16602 tree_stmt_iterator i
;
16603 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
16604 RECUR (tsi_stmt (i
));
16608 case CTOR_INITIALIZER
:
16609 finish_mem_initializers (tsubst_initializer_list
16610 (TREE_OPERAND (t
, 0), args
));
16614 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
16618 tmp
= RECUR (EXPR_STMT_EXPR (t
));
16619 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
16620 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
16622 finish_expr_stmt (tmp
);
16626 finish_local_using_directive (USING_STMT_NAMESPACE (t
),
16627 /*attribs=*/NULL_TREE
);
16632 tree decl
, pattern_decl
;
16635 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
16636 if (TREE_CODE (decl
) == LABEL_DECL
)
16637 finish_label_decl (DECL_NAME (decl
));
16638 else if (TREE_CODE (decl
) == USING_DECL
)
16640 tree scope
= USING_DECL_SCOPE (decl
);
16641 tree name
= DECL_NAME (decl
);
16643 scope
= tsubst (scope
, args
, complain
, in_decl
);
16644 decl
= lookup_qualified_name (scope
, name
,
16645 /*is_type_p=*/false,
16646 /*complain=*/false);
16647 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
16648 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
16650 finish_local_using_decl (decl
, scope
, name
);
16652 else if (is_capture_proxy (decl
)
16653 && !DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
16655 /* We're in tsubst_lambda_expr, we've already inserted a new
16656 capture proxy, so look it up and register it. */
16658 if (DECL_PACK_P (decl
))
16660 inst
= (retrieve_local_specialization
16661 (DECL_CAPTURED_VARIABLE (decl
)));
16662 gcc_assert (TREE_CODE (inst
) == NONTYPE_ARGUMENT_PACK
);
16666 inst
= lookup_name_real (DECL_NAME (decl
), 0, 0,
16667 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
16668 gcc_assert (inst
!= decl
&& is_capture_proxy (inst
));
16670 register_local_specialization (inst
, decl
);
16673 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
16674 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
16675 /* Don't copy the old closure; we'll create a new one in
16676 tsubst_lambda_expr. */
16680 init
= DECL_INITIAL (decl
);
16681 decl
= tsubst (decl
, args
, complain
, in_decl
);
16682 if (decl
!= error_mark_node
)
16684 /* By marking the declaration as instantiated, we avoid
16685 trying to instantiate it. Since instantiate_decl can't
16686 handle local variables, and since we've already done
16687 all that needs to be done, that's the right thing to
16690 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
16691 if (VAR_P (decl
) && !DECL_NAME (decl
)
16692 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
16693 /* Anonymous aggregates are a special case. */
16694 finish_anon_union (decl
);
16695 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
16697 DECL_CONTEXT (decl
) = current_function_decl
;
16698 if (DECL_NAME (decl
) == this_identifier
)
16700 tree lam
= DECL_CONTEXT (current_function_decl
);
16701 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
16702 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
16704 insert_capture_proxy (decl
);
16706 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
16707 /* We already did a pushtag. */;
16708 else if (TREE_CODE (decl
) == FUNCTION_DECL
16709 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
16710 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
16712 DECL_CONTEXT (decl
) = NULL_TREE
;
16714 DECL_CONTEXT (decl
) = current_function_decl
;
16715 cp_check_omp_declare_reduction (decl
);
16719 int const_init
= false;
16720 maybe_push_decl (decl
);
16722 && DECL_PRETTY_FUNCTION_P (decl
))
16724 /* For __PRETTY_FUNCTION__ we have to adjust the
16726 const char *const name
16727 = cxx_printable_name (current_function_decl
, 2);
16728 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
16731 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
16734 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
16737 && DECL_DECOMPOSITION_P (decl
)
16738 && TREE_TYPE (pattern_decl
) != error_mark_node
)
16743 = tsubst_decomp_names (decl
, pattern_decl
, args
,
16744 complain
, in_decl
, &first
, &cnt
);
16745 if (ndecl
!= error_mark_node
)
16746 cp_maybe_mangle_decomp (ndecl
, first
, cnt
);
16747 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
16748 if (ndecl
!= error_mark_node
)
16749 cp_finish_decomp (ndecl
, first
, cnt
);
16752 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
16761 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
16762 RECUR (FOR_INIT_STMT (t
));
16763 finish_init_stmt (stmt
);
16764 tmp
= RECUR (FOR_COND (t
));
16765 finish_for_cond (tmp
, stmt
, false, 0);
16766 tmp
= RECUR (FOR_EXPR (t
));
16767 finish_for_expr (tmp
, stmt
);
16769 bool prev
= note_iteration_stmt_body_start ();
16770 RECUR (FOR_BODY (t
));
16771 note_iteration_stmt_body_end (prev
);
16773 finish_for_stmt (stmt
);
16776 case RANGE_FOR_STMT
:
16778 /* Construct another range_for, if this is not a final
16779 substitution (for inside inside a generic lambda of a
16780 template). Otherwise convert to a regular for. */
16782 stmt
= (processing_template_decl
16783 ? begin_range_for_stmt (NULL_TREE
, NULL_TREE
)
16784 : begin_for_stmt (NULL_TREE
, NULL_TREE
));
16785 decl
= RANGE_FOR_DECL (t
);
16786 decl
= tsubst (decl
, args
, complain
, in_decl
);
16787 maybe_push_decl (decl
);
16788 expr
= RECUR (RANGE_FOR_EXPR (t
));
16790 tree decomp_first
= NULL_TREE
;
16791 unsigned decomp_cnt
= 0;
16792 if (VAR_P (decl
) && DECL_DECOMPOSITION_P (decl
))
16793 decl
= tsubst_decomp_names (decl
, RANGE_FOR_DECL (t
), args
,
16795 &decomp_first
, &decomp_cnt
);
16797 if (processing_template_decl
)
16799 RANGE_FOR_IVDEP (stmt
) = RANGE_FOR_IVDEP (t
);
16800 RANGE_FOR_UNROLL (stmt
) = RANGE_FOR_UNROLL (t
);
16801 finish_range_for_decl (stmt
, decl
, expr
);
16805 unsigned short unroll
= (RANGE_FOR_UNROLL (t
)
16806 ? tree_to_uhwi (RANGE_FOR_UNROLL (t
)) : 0);
16807 stmt
= cp_convert_range_for (stmt
, decl
, expr
,
16808 decomp_first
, decomp_cnt
,
16809 RANGE_FOR_IVDEP (t
), unroll
);
16812 bool prev
= note_iteration_stmt_body_start ();
16813 RECUR (RANGE_FOR_BODY (t
));
16814 note_iteration_stmt_body_end (prev
);
16815 finish_for_stmt (stmt
);
16820 stmt
= begin_while_stmt ();
16821 tmp
= RECUR (WHILE_COND (t
));
16822 finish_while_stmt_cond (tmp
, stmt
, false, 0);
16824 bool prev
= note_iteration_stmt_body_start ();
16825 RECUR (WHILE_BODY (t
));
16826 note_iteration_stmt_body_end (prev
);
16828 finish_while_stmt (stmt
);
16832 stmt
= begin_do_stmt ();
16834 bool prev
= note_iteration_stmt_body_start ();
16835 RECUR (DO_BODY (t
));
16836 note_iteration_stmt_body_end (prev
);
16838 finish_do_body (stmt
);
16839 tmp
= RECUR (DO_COND (t
));
16840 finish_do_stmt (tmp
, stmt
, false, 0);
16844 stmt
= begin_if_stmt ();
16845 IF_STMT_CONSTEXPR_P (stmt
) = IF_STMT_CONSTEXPR_P (t
);
16846 if (IF_STMT_CONSTEXPR_P (t
))
16847 args
= add_extra_args (IF_STMT_EXTRA_ARGS (t
), args
);
16848 tmp
= RECUR (IF_COND (t
));
16849 tmp
= finish_if_stmt_cond (tmp
, stmt
);
16850 if (IF_STMT_CONSTEXPR_P (t
)
16851 && instantiation_dependent_expression_p (tmp
))
16853 /* We're partially instantiating a generic lambda, but the condition
16854 of the constexpr if is still dependent. Don't substitute into the
16855 branches now, just remember the template arguments. */
16856 do_poplevel (IF_SCOPE (stmt
));
16857 IF_COND (stmt
) = IF_COND (t
);
16858 THEN_CLAUSE (stmt
) = THEN_CLAUSE (t
);
16859 ELSE_CLAUSE (stmt
) = ELSE_CLAUSE (t
);
16860 IF_STMT_EXTRA_ARGS (stmt
) = build_extra_args (t
, args
, complain
);
16864 if (IF_STMT_CONSTEXPR_P (t
) && integer_zerop (tmp
))
16865 /* Don't instantiate the THEN_CLAUSE. */;
16868 tree folded
= fold_non_dependent_expr (tmp
, complain
);
16869 bool inhibit
= integer_zerop (folded
);
16871 ++c_inhibit_evaluation_warnings
;
16872 RECUR (THEN_CLAUSE (t
));
16874 --c_inhibit_evaluation_warnings
;
16876 finish_then_clause (stmt
);
16878 if (IF_STMT_CONSTEXPR_P (t
) && integer_nonzerop (tmp
))
16879 /* Don't instantiate the ELSE_CLAUSE. */;
16880 else if (ELSE_CLAUSE (t
))
16882 tree folded
= fold_non_dependent_expr (tmp
, complain
);
16883 bool inhibit
= integer_nonzerop (folded
);
16884 begin_else_clause (stmt
);
16886 ++c_inhibit_evaluation_warnings
;
16887 RECUR (ELSE_CLAUSE (t
));
16889 --c_inhibit_evaluation_warnings
;
16890 finish_else_clause (stmt
);
16893 finish_if_stmt (stmt
);
16897 if (BIND_EXPR_BODY_BLOCK (t
))
16898 stmt
= begin_function_body ();
16900 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
16901 ? BCS_TRY_BLOCK
: 0);
16903 RECUR (BIND_EXPR_BODY (t
));
16905 if (BIND_EXPR_BODY_BLOCK (t
))
16906 finish_function_body (stmt
);
16908 finish_compound_stmt (stmt
);
16912 finish_break_stmt ();
16915 case CONTINUE_STMT
:
16916 finish_continue_stmt ();
16920 stmt
= begin_switch_stmt ();
16921 tmp
= RECUR (SWITCH_STMT_COND (t
));
16922 finish_switch_cond (tmp
, stmt
);
16923 RECUR (SWITCH_STMT_BODY (t
));
16924 finish_switch_stmt (stmt
);
16927 case CASE_LABEL_EXPR
:
16929 tree low
= RECUR (CASE_LOW (t
));
16930 tree high
= RECUR (CASE_HIGH (t
));
16931 tree l
= finish_case_label (EXPR_LOCATION (t
), low
, high
);
16932 if (l
&& TREE_CODE (l
) == CASE_LABEL_EXPR
)
16933 FALLTHROUGH_LABEL_P (CASE_LABEL (l
))
16934 = FALLTHROUGH_LABEL_P (CASE_LABEL (t
));
16940 tree decl
= LABEL_EXPR_LABEL (t
);
16943 label
= finish_label_stmt (DECL_NAME (decl
));
16944 if (TREE_CODE (label
) == LABEL_DECL
)
16945 FALLTHROUGH_LABEL_P (label
) = FALLTHROUGH_LABEL_P (decl
);
16946 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
16947 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
16952 tmp
= GOTO_DESTINATION (t
);
16953 if (TREE_CODE (tmp
) != LABEL_DECL
)
16954 /* Computed goto's must be tsubst'd into. On the other hand,
16955 non-computed gotos must not be; the identifier in question
16956 will have no binding. */
16959 tmp
= DECL_NAME (tmp
);
16960 finish_goto_stmt (tmp
);
16965 tree string
= RECUR (ASM_STRING (t
));
16966 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
16967 complain
, in_decl
);
16968 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
16969 complain
, in_decl
);
16970 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
16971 complain
, in_decl
);
16972 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
16973 complain
, in_decl
);
16974 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
16976 tree asm_expr
= tmp
;
16977 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
16978 asm_expr
= TREE_OPERAND (asm_expr
, 0);
16979 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
16986 stmt
= begin_try_block ();
16987 RECUR (TRY_STMTS (t
));
16988 finish_cleanup_try_block (stmt
);
16989 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
16993 tree compound_stmt
= NULL_TREE
;
16995 if (FN_TRY_BLOCK_P (t
))
16996 stmt
= begin_function_try_block (&compound_stmt
);
16998 stmt
= begin_try_block ();
17000 RECUR (TRY_STMTS (t
));
17002 if (FN_TRY_BLOCK_P (t
))
17003 finish_function_try_block (stmt
);
17005 finish_try_block (stmt
);
17007 RECUR (TRY_HANDLERS (t
));
17008 if (FN_TRY_BLOCK_P (t
))
17009 finish_function_handler_sequence (stmt
, compound_stmt
);
17011 finish_handler_sequence (stmt
);
17017 tree decl
= HANDLER_PARMS (t
);
17021 decl
= tsubst (decl
, args
, complain
, in_decl
);
17022 /* Prevent instantiate_decl from trying to instantiate
17023 this variable. We've already done all that needs to be
17025 if (decl
!= error_mark_node
)
17026 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
17028 stmt
= begin_handler ();
17029 finish_handler_parms (decl
, stmt
);
17030 RECUR (HANDLER_BODY (t
));
17031 finish_handler (stmt
);
17036 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
17037 if (CLASS_TYPE_P (tmp
))
17039 /* Local classes are not independent templates; they are
17040 instantiated along with their containing function. And this
17041 way we don't have to deal with pushing out of one local class
17042 to instantiate a member of another local class. */
17043 /* Closures are handled by the LAMBDA_EXPR. */
17044 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
17045 complete_type (tmp
);
17046 for (tree fld
= TYPE_FIELDS (tmp
); fld
; fld
= DECL_CHAIN (fld
))
17048 || (TREE_CODE (fld
) == FUNCTION_DECL
17049 && !DECL_ARTIFICIAL (fld
)))
17050 && DECL_TEMPLATE_INSTANTIATION (fld
))
17051 instantiate_decl (fld
, /*defer_ok=*/false,
17052 /*expl_inst_class=*/false);
17056 case STATIC_ASSERT
:
17060 ++c_inhibit_evaluation_warnings
;
17062 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
17065 /*integral_constant_expression_p=*/true);
17066 --c_inhibit_evaluation_warnings
;
17068 finish_static_assert (condition
,
17069 STATIC_ASSERT_MESSAGE (t
),
17070 STATIC_ASSERT_SOURCE_LOCATION (t
),
17071 /*member_p=*/false);
17076 case OACC_PARALLEL
:
17077 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), C_ORT_ACC
, args
, complain
,
17079 stmt
= begin_omp_parallel ();
17080 RECUR (OMP_BODY (t
));
17081 finish_omp_construct (TREE_CODE (t
), stmt
, tmp
);
17085 r
= push_omp_privatization_clauses (OMP_PARALLEL_COMBINED (t
));
17086 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), C_ORT_OMP
, args
,
17087 complain
, in_decl
);
17088 if (OMP_PARALLEL_COMBINED (t
))
17089 omp_parallel_combined_clauses
= &tmp
;
17090 stmt
= begin_omp_parallel ();
17091 RECUR (OMP_PARALLEL_BODY (t
));
17092 gcc_assert (omp_parallel_combined_clauses
== NULL
);
17093 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
17094 = OMP_PARALLEL_COMBINED (t
);
17095 pop_omp_privatization_clauses (r
);
17099 r
= push_omp_privatization_clauses (false);
17100 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), C_ORT_OMP
, args
,
17101 complain
, in_decl
);
17102 stmt
= begin_omp_task ();
17103 RECUR (OMP_TASK_BODY (t
));
17104 finish_omp_task (tmp
, stmt
);
17105 pop_omp_privatization_clauses (r
);
17110 case OMP_DISTRIBUTE
:
17114 tree clauses
, body
, pre_body
;
17115 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
17116 tree orig_declv
= NULL_TREE
;
17117 tree incrv
= NULL_TREE
;
17118 enum c_omp_region_type ort
= C_ORT_OMP
;
17121 if (TREE_CODE (t
) == OACC_LOOP
)
17124 r
= push_omp_privatization_clauses (OMP_FOR_INIT (t
) == NULL_TREE
);
17125 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), ort
, args
, complain
,
17127 if (OMP_FOR_INIT (t
) != NULL_TREE
)
17129 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
17130 if (OMP_FOR_ORIG_DECLS (t
))
17131 orig_declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
17132 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
17133 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
17134 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
17137 stmt
= begin_omp_structured_block ();
17139 pre_body
= push_stmt_list ();
17140 RECUR (OMP_FOR_PRE_BODY (t
));
17141 pre_body
= pop_stmt_list (pre_body
);
17143 if (OMP_FOR_INIT (t
) != NULL_TREE
)
17144 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
17145 tsubst_omp_for_iterator (t
, i
, declv
, orig_declv
, initv
, condv
,
17146 incrv
, &clauses
, args
, complain
, in_decl
,
17147 integral_constant_expression_p
);
17148 omp_parallel_combined_clauses
= NULL
;
17150 body
= push_stmt_list ();
17151 RECUR (OMP_FOR_BODY (t
));
17152 body
= pop_stmt_list (body
);
17154 if (OMP_FOR_INIT (t
) != NULL_TREE
)
17155 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
,
17156 orig_declv
, initv
, condv
, incrv
, body
, pre_body
,
17160 t
= make_node (TREE_CODE (t
));
17161 TREE_TYPE (t
) = void_type_node
;
17162 OMP_FOR_BODY (t
) = body
;
17163 OMP_FOR_PRE_BODY (t
) = pre_body
;
17164 OMP_FOR_CLAUSES (t
) = clauses
;
17165 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
17169 add_stmt (finish_omp_structured_block (stmt
));
17170 pop_omp_privatization_clauses (r
);
17175 omp_parallel_combined_clauses
= NULL
;
17180 r
= push_omp_privatization_clauses (TREE_CODE (t
) == OMP_TEAMS
17181 && OMP_TEAMS_COMBINED (t
));
17182 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), C_ORT_OMP
, args
, complain
,
17184 stmt
= push_stmt_list ();
17185 RECUR (OMP_BODY (t
));
17186 stmt
= pop_stmt_list (stmt
);
17189 OMP_BODY (t
) = stmt
;
17190 OMP_CLAUSES (t
) = tmp
;
17192 pop_omp_privatization_clauses (r
);
17196 case OMP_TARGET_DATA
:
17198 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), (TREE_CODE (t
) == OACC_DATA
)
17199 ? C_ORT_ACC
: C_ORT_OMP
, args
, complain
,
17201 keep_next_level (true);
17202 stmt
= begin_omp_structured_block ();
17204 RECUR (OMP_BODY (t
));
17205 stmt
= finish_omp_structured_block (stmt
);
17208 OMP_BODY (t
) = stmt
;
17209 OMP_CLAUSES (t
) = tmp
;
17210 if (TREE_CODE (t
) == OMP_TARGET
&& OMP_TARGET_COMBINED (t
))
17212 tree teams
= cp_walk_tree (&stmt
, tsubst_find_omp_teams
, NULL
, NULL
);
17215 /* For combined target teams, ensure the num_teams and
17216 thread_limit clause expressions are evaluated on the host,
17217 before entering the target construct. */
17219 for (c
= OMP_TEAMS_CLAUSES (teams
);
17220 c
; c
= OMP_CLAUSE_CHAIN (c
))
17221 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_NUM_TEAMS
17222 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_THREAD_LIMIT
)
17223 && TREE_CODE (OMP_CLAUSE_OPERAND (c
, 0)) != INTEGER_CST
)
17225 tree expr
= OMP_CLAUSE_OPERAND (c
, 0);
17226 expr
= force_target_expr (TREE_TYPE (expr
), expr
, tf_none
);
17227 if (expr
== error_mark_node
)
17229 tmp
= TARGET_EXPR_SLOT (expr
);
17231 OMP_CLAUSE_OPERAND (c
, 0) = expr
;
17232 tree tc
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
17233 OMP_CLAUSE_FIRSTPRIVATE
);
17234 OMP_CLAUSE_DECL (tc
) = tmp
;
17235 OMP_CLAUSE_CHAIN (tc
) = OMP_TARGET_CLAUSES (t
);
17236 OMP_TARGET_CLAUSES (t
) = tc
;
17245 tmp
= tsubst_omp_clauses (OACC_DECLARE_CLAUSES (t
), C_ORT_ACC
, args
,
17246 complain
, in_decl
);
17247 OACC_DECLARE_CLAUSES (t
) = tmp
;
17251 case OMP_TARGET_UPDATE
:
17252 case OMP_TARGET_ENTER_DATA
:
17253 case OMP_TARGET_EXIT_DATA
:
17254 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), C_ORT_OMP
, args
,
17255 complain
, in_decl
);
17257 OMP_STANDALONE_CLAUSES (t
) = tmp
;
17261 case OACC_ENTER_DATA
:
17262 case OACC_EXIT_DATA
:
17264 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), C_ORT_ACC
, args
,
17265 complain
, in_decl
);
17267 OMP_STANDALONE_CLAUSES (t
) = tmp
;
17272 tmp
= tsubst_omp_clauses (OMP_ORDERED_CLAUSES (t
), C_ORT_OMP
, args
,
17273 complain
, in_decl
);
17274 stmt
= push_stmt_list ();
17275 RECUR (OMP_BODY (t
));
17276 stmt
= pop_stmt_list (stmt
);
17279 OMP_BODY (t
) = stmt
;
17280 OMP_ORDERED_CLAUSES (t
) = tmp
;
17286 case OMP_TASKGROUP
:
17287 stmt
= push_stmt_list ();
17288 RECUR (OMP_BODY (t
));
17289 stmt
= pop_stmt_list (stmt
);
17292 OMP_BODY (t
) = stmt
;
17297 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
17298 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
17300 tree op1
= TREE_OPERAND (t
, 1);
17301 tree rhs1
= NULL_TREE
;
17303 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
17305 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
17306 op1
= TREE_OPERAND (op1
, 1);
17308 lhs
= RECUR (TREE_OPERAND (op1
, 0));
17309 rhs
= RECUR (TREE_OPERAND (op1
, 1));
17310 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
17311 NULL_TREE
, NULL_TREE
, rhs1
,
17312 OMP_ATOMIC_SEQ_CST (t
));
17316 tree op1
= TREE_OPERAND (t
, 1);
17317 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
17318 tree rhs1
= NULL_TREE
;
17319 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
17320 enum tree_code opcode
= NOP_EXPR
;
17321 if (code
== OMP_ATOMIC_READ
)
17323 v
= RECUR (TREE_OPERAND (op1
, 0));
17324 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
17326 else if (code
== OMP_ATOMIC_CAPTURE_OLD
17327 || code
== OMP_ATOMIC_CAPTURE_NEW
)
17329 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
17330 v
= RECUR (TREE_OPERAND (op1
, 0));
17331 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
17332 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
17334 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
17335 op11
= TREE_OPERAND (op11
, 1);
17337 lhs
= RECUR (TREE_OPERAND (op11
, 0));
17338 rhs
= RECUR (TREE_OPERAND (op11
, 1));
17339 opcode
= TREE_CODE (op11
);
17340 if (opcode
== MODIFY_EXPR
)
17346 lhs
= RECUR (TREE_OPERAND (op1
, 0));
17347 rhs
= RECUR (TREE_OPERAND (op1
, 1));
17349 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
17350 OMP_ATOMIC_SEQ_CST (t
));
17354 case TRANSACTION_EXPR
:
17357 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
17358 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
17360 if (TRANSACTION_EXPR_IS_STMT (t
))
17362 tree body
= TRANSACTION_EXPR_BODY (t
);
17363 tree noex
= NULL_TREE
;
17364 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
17366 noex
= MUST_NOT_THROW_COND (body
);
17367 if (noex
== NULL_TREE
)
17368 noex
= boolean_true_node
;
17369 body
= TREE_OPERAND (body
, 0);
17371 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
17373 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
17377 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
17378 RECUR (TRANSACTION_EXPR_BODY (t
)),
17385 case MUST_NOT_THROW_EXPR
:
17387 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17388 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
17389 RETURN (build_must_not_throw_expr (op0
, cond
));
17392 case EXPR_PACK_EXPANSION
:
17393 error ("invalid use of pack expansion expression");
17394 RETURN (error_mark_node
);
17396 case NONTYPE_ARGUMENT_PACK
:
17397 error ("use %<...%> to expand argument pack");
17398 RETURN (error_mark_node
);
17400 case COMPOUND_EXPR
:
17401 tmp
= RECUR (TREE_OPERAND (t
, 0));
17402 if (tmp
== NULL_TREE
)
17403 /* If the first operand was a statement, we're done with it. */
17404 RETURN (RECUR (TREE_OPERAND (t
, 1)));
17405 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
17406 RECUR (TREE_OPERAND (t
, 1)),
17409 case ANNOTATE_EXPR
:
17410 tmp
= RECUR (TREE_OPERAND (t
, 0));
17411 RETURN (build3_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
17412 TREE_TYPE (tmp
), tmp
,
17413 RECUR (TREE_OPERAND (t
, 1)),
17414 RECUR (TREE_OPERAND (t
, 2))));
17417 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
17419 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
17420 /*function_p=*/false,
17421 integral_constant_expression_p
));
17424 RETURN (NULL_TREE
);
17426 input_location
= loc
;
17432 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
17433 function. For description of the body see comment above
17434 cp_parser_omp_declare_reduction_exprs. */
17437 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
17439 if (t
== NULL_TREE
|| t
== error_mark_node
)
17442 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
17444 tree_stmt_iterator tsi
;
17447 memset (stmts
, 0, sizeof stmts
);
17448 for (i
= 0, tsi
= tsi_start (t
);
17449 i
< 7 && !tsi_end_p (tsi
);
17450 i
++, tsi_next (&tsi
))
17451 stmts
[i
] = tsi_stmt (tsi
);
17452 gcc_assert (tsi_end_p (tsi
));
17456 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
17457 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
17458 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
17459 args
, complain
, in_decl
);
17460 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
17461 args
, complain
, in_decl
);
17462 DECL_CONTEXT (omp_out
) = current_function_decl
;
17463 DECL_CONTEXT (omp_in
) = current_function_decl
;
17464 keep_next_level (true);
17465 tree block
= begin_omp_structured_block ();
17466 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
17467 block
= finish_omp_structured_block (block
);
17468 block
= maybe_cleanup_point_expr_void (block
);
17469 add_decl_expr (omp_out
);
17470 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
17471 TREE_NO_WARNING (omp_out
) = 1;
17472 add_decl_expr (omp_in
);
17473 finish_expr_stmt (block
);
17477 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
17478 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
17479 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
17480 args
, complain
, in_decl
);
17481 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
17482 args
, complain
, in_decl
);
17483 DECL_CONTEXT (omp_priv
) = current_function_decl
;
17484 DECL_CONTEXT (omp_orig
) = current_function_decl
;
17485 keep_next_level (true);
17486 tree block
= begin_omp_structured_block ();
17487 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
17488 block
= finish_omp_structured_block (block
);
17489 block
= maybe_cleanup_point_expr_void (block
);
17490 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
17491 add_decl_expr (omp_priv
);
17492 add_decl_expr (omp_orig
);
17493 finish_expr_stmt (block
);
17495 add_decl_expr (omp_orig
);
17499 /* T is a postfix-expression that is not being used in a function
17500 call. Return the substituted version of T. */
17503 tsubst_non_call_postfix_expression (tree t
, tree args
,
17504 tsubst_flags_t complain
,
17507 if (TREE_CODE (t
) == SCOPE_REF
)
17508 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
17509 /*done=*/false, /*address_p=*/false);
17511 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
17512 /*function_p=*/false,
17513 /*integral_constant_expression_p=*/false);
17518 /* T is a LAMBDA_EXPR. Generate a new LAMBDA_EXPR for the current
17519 instantiation context. Instantiating a pack expansion containing a lambda
17520 might result in multiple lambdas all based on the same lambda in the
17524 tsubst_lambda_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
17526 tree oldfn
= lambda_function (t
);
17529 tree r
= build_lambda_expr ();
17531 LAMBDA_EXPR_LOCATION (r
)
17532 = LAMBDA_EXPR_LOCATION (t
);
17533 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
17534 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
17535 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
17537 if (LAMBDA_EXPR_EXTRA_SCOPE (t
) == NULL_TREE
)
17538 /* A lambda in a default argument outside a class gets no
17539 LAMBDA_EXPR_EXTRA_SCOPE, as specified by the ABI. But
17540 tsubst_default_argument calls start_lambda_scope, so we need to
17541 specifically ignore it here, and use the global scope. */
17542 record_null_lambda_scope (r
);
17544 record_lambda_scope (r
);
17546 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
17547 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
17549 for (tree cap
= LAMBDA_EXPR_CAPTURE_LIST (t
); cap
;
17550 cap
= TREE_CHAIN (cap
))
17552 tree field
= TREE_PURPOSE (cap
);
17553 if (PACK_EXPANSION_P (field
))
17554 field
= PACK_EXPANSION_PATTERN (field
);
17555 field
= tsubst_decl (field
, args
, complain
);
17557 if (field
== error_mark_node
)
17558 return error_mark_node
;
17560 tree init
= TREE_VALUE (cap
);
17561 if (PACK_EXPANSION_P (init
))
17562 init
= tsubst_pack_expansion (init
, args
, complain
, in_decl
);
17564 init
= tsubst_copy_and_build (init
, args
, complain
, in_decl
,
17565 /*fn*/false, /*constexpr*/false);
17567 if (TREE_CODE (field
) == TREE_VEC
)
17569 int len
= TREE_VEC_LENGTH (field
);
17570 gcc_assert (TREE_CODE (init
) == TREE_VEC
17571 && TREE_VEC_LENGTH (init
) == len
);
17572 for (int i
= 0; i
< len
; ++i
)
17573 LAMBDA_EXPR_CAPTURE_LIST (r
)
17574 = tree_cons (TREE_VEC_ELT (field
, i
),
17575 TREE_VEC_ELT (init
, i
),
17576 LAMBDA_EXPR_CAPTURE_LIST (r
));
17580 LAMBDA_EXPR_CAPTURE_LIST (r
)
17581 = tree_cons (field
, init
, LAMBDA_EXPR_CAPTURE_LIST (r
));
17583 if (id_equal (DECL_NAME (field
), "__this"))
17584 LAMBDA_EXPR_THIS_CAPTURE (r
) = field
;
17588 tree type
= begin_lambda_type (r
);
17589 if (type
== error_mark_node
)
17590 return error_mark_node
;
17592 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
17593 determine_visibility (TYPE_NAME (type
));
17595 register_capture_members (LAMBDA_EXPR_CAPTURE_LIST (r
));
17597 tree oldtmpl
= (generic_lambda_fn_p (oldfn
)
17598 ? DECL_TI_TEMPLATE (oldfn
)
17601 tree fntype
= static_fn_type (oldfn
);
17603 ++processing_template_decl
;
17604 fntype
= tsubst (fntype
, args
, complain
, in_decl
);
17606 --processing_template_decl
;
17608 if (fntype
== error_mark_node
)
17609 r
= error_mark_node
;
17612 /* Fix the type of 'this'. */
17613 fntype
= build_memfn_type (fntype
, type
,
17614 type_memfn_quals (fntype
),
17615 type_memfn_rqual (fntype
));
17619 tmpl
= tsubst_template_decl (oldtmpl
, args
, complain
, fntype
);
17620 fn
= DECL_TEMPLATE_RESULT (tmpl
);
17621 finish_member_declaration (tmpl
);
17626 fn
= tsubst_function_decl (oldfn
, args
, complain
, fntype
);
17627 finish_member_declaration (fn
);
17630 /* Let finish_function set this. */
17631 DECL_DECLARED_CONSTEXPR_P (fn
) = false;
17633 bool nested
= cfun
;
17635 push_function_context ();
17637 /* Still increment function_depth so that we don't GC in the
17638 middle of an expression. */
17641 local_specialization_stack
s (lss_copy
);
17643 tree body
= start_lambda_function (fn
, r
);
17645 register_parameter_specializations (oldfn
, fn
);
17649 /* We might not partially instantiate some parts of the function, so
17650 copy these flags from the original template. */
17651 language_function
*ol
= DECL_STRUCT_FUNCTION (oldfn
)->language
;
17652 current_function_returns_value
= ol
->returns_value
;
17653 current_function_returns_null
= ol
->returns_null
;
17654 current_function_returns_abnormally
= ol
->returns_abnormally
;
17655 current_function_infinite_loop
= ol
->infinite_loop
;
17658 tsubst_expr (DECL_SAVED_TREE (oldfn
), args
, complain
, r
,
17659 /*constexpr*/false);
17661 finish_lambda_function (body
);
17664 pop_function_context ();
17668 /* The capture list was built up in reverse order; fix that now. */
17669 LAMBDA_EXPR_CAPTURE_LIST (r
)
17670 = nreverse (LAMBDA_EXPR_CAPTURE_LIST (r
));
17672 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
17674 maybe_add_lambda_conv_op (type
);
17677 finish_struct (type
, /*attr*/NULL_TREE
);
17679 insert_pending_capture_proxies ();
17684 /* Like tsubst but deals with expressions and performs semantic
17685 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
17688 tsubst_copy_and_build (tree t
,
17690 tsubst_flags_t complain
,
17693 bool integral_constant_expression_p
)
17695 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
17696 #define RECUR(NODE) \
17697 tsubst_copy_and_build (NODE, args, complain, in_decl, \
17698 /*function_p=*/false, \
17699 integral_constant_expression_p)
17704 if (t
== NULL_TREE
|| t
== error_mark_node
)
17707 loc
= input_location
;
17708 if (location_t eloc
= cp_expr_location (t
))
17709 input_location
= eloc
;
17711 /* N3276 decltype magic only applies to calls at the top level or on the
17712 right side of a comma. */
17713 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
17714 complain
&= ~tf_decltype
;
17716 switch (TREE_CODE (t
))
17720 /* Fall through. */
17721 case IDENTIFIER_NODE
:
17725 bool non_integral_constant_expression_p
;
17726 const char *error_msg
;
17728 if (IDENTIFIER_CONV_OP_P (t
))
17730 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17731 t
= make_conv_op_name (new_type
);
17734 /* Look up the name. */
17735 decl
= lookup_name (t
);
17737 /* By convention, expressions use ERROR_MARK_NODE to indicate
17738 failure, not NULL_TREE. */
17739 if (decl
== NULL_TREE
)
17740 decl
= error_mark_node
;
17742 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
17744 integral_constant_expression_p
,
17745 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
17746 &non_integral_constant_expression_p
,
17747 /*template_p=*/false,
17749 /*address_p=*/false,
17750 /*template_arg_p=*/false,
17755 if (!function_p
&& identifier_p (decl
))
17757 if (complain
& tf_error
)
17758 unqualified_name_lookup_error (decl
);
17759 decl
= error_mark_node
;
17764 case TEMPLATE_ID_EXPR
:
17767 tree templ
= RECUR (TREE_OPERAND (t
, 0));
17768 tree targs
= TREE_OPERAND (t
, 1);
17771 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
17772 if (targs
== error_mark_node
)
17773 RETURN (error_mark_node
);
17775 if (TREE_CODE (templ
) == SCOPE_REF
)
17777 tree name
= TREE_OPERAND (templ
, 1);
17778 tree tid
= lookup_template_function (name
, targs
);
17779 TREE_OPERAND (templ
, 1) = tid
;
17783 if (variable_template_p (templ
))
17784 RETURN (lookup_and_finish_template_variable (templ
, targs
, complain
));
17786 if (TREE_CODE (templ
) == COMPONENT_REF
)
17788 object
= TREE_OPERAND (templ
, 0);
17789 templ
= TREE_OPERAND (templ
, 1);
17792 object
= NULL_TREE
;
17793 templ
= lookup_template_function (templ
, targs
);
17796 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
17797 object
, templ
, NULL_TREE
));
17799 RETURN (baselink_for_fns (templ
));
17804 tree r
= RECUR (TREE_OPERAND (t
, 0));
17806 if (REFERENCE_REF_P (t
))
17808 /* A type conversion to reference type will be enclosed in
17809 such an indirect ref, but the substitution of the cast
17810 will have also added such an indirect ref. */
17811 r
= convert_from_reference (r
);
17814 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
17815 complain
|decltype_flag
);
17817 if (REF_PARENTHESIZED_P (t
))
17818 r
= force_paren_expr (r
);
17825 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17826 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17827 RETURN (build_nop (type
, op0
));
17830 case IMPLICIT_CONV_EXPR
:
17832 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17833 tree expr
= RECUR (TREE_OPERAND (t
, 0));
17834 if (dependent_type_p (type
) || type_dependent_expression_p (expr
))
17836 retval
= copy_node (t
);
17837 TREE_TYPE (retval
) = type
;
17838 TREE_OPERAND (retval
, 0) = expr
;
17841 if (IMPLICIT_CONV_EXPR_NONTYPE_ARG (t
))
17842 /* We'll pass this to convert_nontype_argument again, we don't need
17843 to actually perform any conversion here. */
17845 int flags
= LOOKUP_IMPLICIT
;
17846 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
17847 flags
= LOOKUP_NORMAL
;
17848 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
17854 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17855 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17856 if (op0
== error_mark_node
)
17857 RETURN (error_mark_node
);
17858 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
17862 case REINTERPRET_CAST_EXPR
:
17863 case CONST_CAST_EXPR
:
17864 case DYNAMIC_CAST_EXPR
:
17865 case STATIC_CAST_EXPR
:
17868 tree op
, r
= NULL_TREE
;
17870 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17871 if (integral_constant_expression_p
17872 && !cast_valid_in_integral_constant_expression_p (type
))
17874 if (complain
& tf_error
)
17875 error ("a cast to a type other than an integral or "
17876 "enumeration type cannot appear in a constant-expression");
17877 RETURN (error_mark_node
);
17880 op
= RECUR (TREE_OPERAND (t
, 0));
17882 warning_sentinel
s(warn_useless_cast
);
17883 warning_sentinel
s2(warn_ignored_qualifiers
);
17884 switch (TREE_CODE (t
))
17887 r
= build_functional_cast (type
, op
, complain
);
17889 case REINTERPRET_CAST_EXPR
:
17890 r
= build_reinterpret_cast (type
, op
, complain
);
17892 case CONST_CAST_EXPR
:
17893 r
= build_const_cast (type
, op
, complain
);
17895 case DYNAMIC_CAST_EXPR
:
17896 r
= build_dynamic_cast (type
, op
, complain
);
17898 case STATIC_CAST_EXPR
:
17899 r
= build_static_cast (type
, op
, complain
);
17902 gcc_unreachable ();
17908 case POSTDECREMENT_EXPR
:
17909 case POSTINCREMENT_EXPR
:
17910 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
17911 args
, complain
, in_decl
);
17912 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
17913 complain
|decltype_flag
));
17915 case PREDECREMENT_EXPR
:
17916 case PREINCREMENT_EXPR
:
17920 case TRUTH_NOT_EXPR
:
17921 case UNARY_PLUS_EXPR
: /* Unary + */
17922 case REALPART_EXPR
:
17923 case IMAGPART_EXPR
:
17924 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
17925 RECUR (TREE_OPERAND (t
, 0)),
17926 complain
|decltype_flag
));
17928 case FIX_TRUNC_EXPR
:
17929 gcc_unreachable ();
17932 op1
= TREE_OPERAND (t
, 0);
17933 if (TREE_CODE (op1
) == LABEL_DECL
)
17934 RETURN (finish_label_address_expr (DECL_NAME (op1
),
17935 EXPR_LOCATION (op1
)));
17936 if (TREE_CODE (op1
) == SCOPE_REF
)
17937 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
17938 /*done=*/true, /*address_p=*/true);
17940 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
17942 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
17943 complain
|decltype_flag
));
17948 case TRUNC_DIV_EXPR
:
17949 case CEIL_DIV_EXPR
:
17950 case FLOOR_DIV_EXPR
:
17951 case ROUND_DIV_EXPR
:
17952 case EXACT_DIV_EXPR
:
17956 case TRUNC_MOD_EXPR
:
17957 case FLOOR_MOD_EXPR
:
17958 case TRUTH_ANDIF_EXPR
:
17959 case TRUTH_ORIF_EXPR
:
17960 case TRUTH_AND_EXPR
:
17961 case TRUTH_OR_EXPR
:
17977 warning_sentinel
s1(warn_type_limits
);
17978 warning_sentinel
s2(warn_div_by_zero
);
17979 warning_sentinel
s3(warn_logical_op
);
17980 warning_sentinel
s4(warn_tautological_compare
);
17981 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17982 tree op1
= RECUR (TREE_OPERAND (t
, 1));
17983 tree r
= build_x_binary_op
17984 (input_location
, TREE_CODE (t
),
17986 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
17988 : TREE_CODE (TREE_OPERAND (t
, 0))),
17990 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
17992 : TREE_CODE (TREE_OPERAND (t
, 1))),
17994 complain
|decltype_flag
);
17995 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
17996 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
18001 case POINTER_PLUS_EXPR
:
18003 tree op0
= RECUR (TREE_OPERAND (t
, 0));
18004 tree op1
= RECUR (TREE_OPERAND (t
, 1));
18005 RETURN (fold_build_pointer_plus (op0
, op1
));
18009 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
18010 /*address_p=*/false));
18012 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
18013 args
, complain
, in_decl
);
18014 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
18015 RECUR (TREE_OPERAND (t
, 1)),
18016 complain
|decltype_flag
));
18019 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0))
18020 || ARGUMENT_PACK_P (TREE_OPERAND (t
, 0)))
18021 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
18028 op1
= TREE_OPERAND (t
, 0);
18029 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
18030 op1
= TREE_TYPE (op1
);
18031 bool std_alignof
= (TREE_CODE (t
) == ALIGNOF_EXPR
18032 && ALIGNOF_EXPR_STD_P (t
));
18035 /* When there are no ARGS, we are trying to evaluate a
18036 non-dependent expression from the parser. Trying to do
18037 the substitutions may not work. */
18039 op1
= TREE_TYPE (op1
);
18043 ++cp_unevaluated_operand
;
18044 ++c_inhibit_evaluation_warnings
;
18046 op1
= tsubst (op1
, args
, complain
, in_decl
);
18048 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
18049 /*function_p=*/false,
18050 /*integral_constant_expression_p=*/
18052 --cp_unevaluated_operand
;
18053 --c_inhibit_evaluation_warnings
;
18056 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
), std_alignof
,
18057 complain
& tf_error
);
18059 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
18060 complain
& tf_error
);
18061 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
18063 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
18065 if (!processing_template_decl
&& TYPE_P (op1
))
18067 r
= build_min (SIZEOF_EXPR
, size_type_node
,
18068 build1 (NOP_EXPR
, op1
, error_mark_node
));
18069 SIZEOF_EXPR_TYPE_P (r
) = 1;
18072 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
18073 TREE_SIDE_EFFECTS (r
) = 0;
18074 TREE_READONLY (r
) = 1;
18076 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
18081 case AT_ENCODE_EXPR
:
18083 op1
= TREE_OPERAND (t
, 0);
18084 ++cp_unevaluated_operand
;
18085 ++c_inhibit_evaluation_warnings
;
18086 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
18087 /*function_p=*/false,
18088 /*integral_constant_expression_p=*/false);
18089 --cp_unevaluated_operand
;
18090 --c_inhibit_evaluation_warnings
;
18091 RETURN (objc_build_encode_expr (op1
));
18094 case NOEXCEPT_EXPR
:
18095 op1
= TREE_OPERAND (t
, 0);
18096 ++cp_unevaluated_operand
;
18097 ++c_inhibit_evaluation_warnings
;
18098 ++cp_noexcept_operand
;
18099 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
18100 /*function_p=*/false,
18101 /*integral_constant_expression_p=*/false);
18102 --cp_unevaluated_operand
;
18103 --c_inhibit_evaluation_warnings
;
18104 --cp_noexcept_operand
;
18105 RETURN (finish_noexcept_expr (op1
, complain
));
18109 warning_sentinel
s(warn_div_by_zero
);
18110 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
18111 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
18112 tree r
= build_x_modify_expr
18113 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
18114 complain
|decltype_flag
);
18115 /* TREE_NO_WARNING must be set if either the expression was
18116 parenthesized or it uses an operator such as >>= rather
18117 than plain assignment. In the former case, it was already
18118 set and must be copied. In the latter case,
18119 build_x_modify_expr sets it and it must not be reset
18121 if (TREE_NO_WARNING (t
))
18122 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
18128 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
18129 args
, complain
, in_decl
);
18130 /* Remember that there was a reference to this entity. */
18132 && !mark_used (op1
, complain
) && !(complain
& tf_error
))
18133 RETURN (error_mark_node
);
18134 RETURN (build_x_arrow (input_location
, op1
, complain
));
18138 tree placement
= RECUR (TREE_OPERAND (t
, 0));
18139 tree init
= RECUR (TREE_OPERAND (t
, 3));
18140 vec
<tree
, va_gc
> *placement_vec
;
18141 vec
<tree
, va_gc
> *init_vec
;
18144 if (placement
== NULL_TREE
)
18145 placement_vec
= NULL
;
18148 placement_vec
= make_tree_vector ();
18149 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
18150 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
18153 /* If there was an initializer in the original tree, but it
18154 instantiated to an empty list, then we should pass a
18155 non-NULL empty vector to tell build_new that it was an
18156 empty initializer() rather than no initializer. This can
18157 only happen when the initializer is a pack expansion whose
18158 parameter packs are of length zero. */
18159 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
18163 init_vec
= make_tree_vector ();
18164 if (init
== void_node
)
18165 gcc_assert (init_vec
!= NULL
);
18168 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
18169 vec_safe_push (init_vec
, TREE_VALUE (init
));
18173 /* Avoid passing an enclosing decl to valid_array_size_p. */
18174 in_decl
= NULL_TREE
;
18176 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
18177 tree op2
= RECUR (TREE_OPERAND (t
, 2));
18178 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
18179 NEW_EXPR_USE_GLOBAL (t
),
18182 if (placement_vec
!= NULL
)
18183 release_tree_vector (placement_vec
);
18184 if (init_vec
!= NULL
)
18185 release_tree_vector (init_vec
);
18192 tree op0
= RECUR (TREE_OPERAND (t
, 0));
18193 tree op1
= RECUR (TREE_OPERAND (t
, 1));
18194 RETURN (delete_sanity (op0
, op1
,
18195 DELETE_EXPR_USE_VEC (t
),
18196 DELETE_EXPR_USE_GLOBAL (t
),
18200 case COMPOUND_EXPR
:
18202 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
18203 complain
& ~tf_decltype
, in_decl
,
18204 /*function_p=*/false,
18205 integral_constant_expression_p
);
18206 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
18208 RECUR (TREE_OPERAND (t
, 1)),
18209 complain
|decltype_flag
));
18215 vec
<tree
, va_gc
> *call_args
;
18216 unsigned int nargs
, i
;
18221 function
= CALL_EXPR_FN (t
);
18222 /* Internal function with no arguments. */
18223 if (function
== NULL_TREE
&& call_expr_nargs (t
) == 0)
18226 /* When we parsed the expression, we determined whether or
18227 not Koenig lookup should be performed. */
18228 koenig_p
= KOENIG_LOOKUP_P (t
);
18229 if (function
== NULL_TREE
)
18232 qualified_p
= false;
18234 else if (TREE_CODE (function
) == SCOPE_REF
)
18236 qualified_p
= true;
18237 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
18239 /*address_p=*/false);
18241 else if (koenig_p
&& identifier_p (function
))
18243 /* Do nothing; calling tsubst_copy_and_build on an identifier
18244 would incorrectly perform unqualified lookup again.
18246 Note that we can also have an IDENTIFIER_NODE if the earlier
18247 unqualified lookup found a member function; in that case
18248 koenig_p will be false and we do want to do the lookup
18249 again to find the instantiated member function.
18251 FIXME but doing that causes c++/15272, so we need to stop
18252 using IDENTIFIER_NODE in that situation. */
18253 qualified_p
= false;
18257 if (TREE_CODE (function
) == COMPONENT_REF
)
18259 tree op
= TREE_OPERAND (function
, 1);
18261 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
18262 || (BASELINK_P (op
)
18263 && BASELINK_QUALIFIED_P (op
)));
18266 qualified_p
= false;
18268 if (TREE_CODE (function
) == ADDR_EXPR
18269 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
18270 /* Avoid error about taking the address of a constructor. */
18271 function
= TREE_OPERAND (function
, 0);
18273 function
= tsubst_copy_and_build (function
, args
, complain
,
18276 integral_constant_expression_p
);
18278 if (BASELINK_P (function
))
18279 qualified_p
= true;
18282 nargs
= call_expr_nargs (t
);
18283 call_args
= make_tree_vector ();
18284 for (i
= 0; i
< nargs
; ++i
)
18286 tree arg
= CALL_EXPR_ARG (t
, i
);
18288 if (!PACK_EXPANSION_P (arg
))
18289 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
18292 /* Expand the pack expansion and push each entry onto
18294 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
18295 if (TREE_CODE (arg
) == TREE_VEC
)
18297 unsigned int len
, j
;
18299 len
= TREE_VEC_LENGTH (arg
);
18300 for (j
= 0; j
< len
; ++j
)
18302 tree value
= TREE_VEC_ELT (arg
, j
);
18303 if (value
!= NULL_TREE
)
18304 value
= convert_from_reference (value
);
18305 vec_safe_push (call_args
, value
);
18310 /* A partial substitution. Add one entry. */
18311 vec_safe_push (call_args
, arg
);
18316 /* We do not perform argument-dependent lookup if normal
18317 lookup finds a non-function, in accordance with the
18318 expected resolution of DR 218. */
18320 && ((is_overloaded_fn (function
)
18321 /* If lookup found a member function, the Koenig lookup is
18322 not appropriate, even if an unqualified-name was used
18323 to denote the function. */
18324 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
18325 || identifier_p (function
))
18326 /* Only do this when substitution turns a dependent call
18327 into a non-dependent call. */
18328 && type_dependent_expression_p_push (t
)
18329 && !any_type_dependent_arguments_p (call_args
))
18330 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
18332 if (function
!= NULL_TREE
18333 && identifier_p (function
)
18334 && !any_type_dependent_arguments_p (call_args
))
18336 if (koenig_p
&& (complain
& tf_warning_or_error
))
18338 /* For backwards compatibility and good diagnostics, try
18339 the unqualified lookup again if we aren't in SFINAE
18341 tree unq
= (tsubst_copy_and_build
18342 (function
, args
, complain
, in_decl
, true,
18343 integral_constant_expression_p
));
18344 if (unq
== error_mark_node
)
18346 release_tree_vector (call_args
);
18347 RETURN (error_mark_node
);
18350 if (unq
!= function
)
18352 /* In a lambda fn, we have to be careful to not
18353 introduce new this captures. Legacy code can't
18354 be using lambdas anyway, so it's ok to be
18356 bool in_lambda
= (current_class_type
18357 && LAMBDA_TYPE_P (current_class_type
));
18358 char const *const msg
18359 = G_("%qD was not declared in this scope, "
18360 "and no declarations were found by "
18361 "argument-dependent lookup at the point "
18362 "of instantiation");
18366 error_at (cp_expr_loc_or_loc (t
, input_location
),
18369 diag
= permerror (cp_expr_loc_or_loc (t
, input_location
),
18375 if (INDIRECT_REF_P (fn
))
18376 fn
= TREE_OPERAND (fn
, 0);
18377 if (is_overloaded_fn (fn
))
18378 fn
= get_first_fn (fn
);
18381 /* Can't say anything more. */;
18382 else if (DECL_CLASS_SCOPE_P (fn
))
18384 location_t loc
= cp_expr_loc_or_loc (t
,
18387 "declarations in dependent base %qT are "
18388 "not found by unqualified lookup",
18389 DECL_CLASS_CONTEXT (fn
));
18390 if (current_class_ptr
)
18392 "use %<this->%D%> instead", function
);
18395 "use %<%T::%D%> instead",
18396 current_class_name
, function
);
18399 inform (DECL_SOURCE_LOCATION (fn
),
18400 "%qD declared here, later in the "
18401 "translation unit", fn
);
18404 release_tree_vector (call_args
);
18405 RETURN (error_mark_node
);
18412 if (identifier_p (function
))
18414 if (complain
& tf_error
)
18415 unqualified_name_lookup_error (function
);
18416 release_tree_vector (call_args
);
18417 RETURN (error_mark_node
);
18421 /* Remember that there was a reference to this entity. */
18422 if (function
!= NULL_TREE
18423 && DECL_P (function
)
18424 && !mark_used (function
, complain
) && !(complain
& tf_error
))
18426 release_tree_vector (call_args
);
18427 RETURN (error_mark_node
);
18430 /* Put back tf_decltype for the actual call. */
18431 complain
|= decltype_flag
;
18433 if (function
== NULL_TREE
)
18434 switch (CALL_EXPR_IFN (t
))
18437 gcc_assert (nargs
== 1);
18438 if (vec_safe_length (call_args
) != 1)
18440 error_at (cp_expr_loc_or_loc (t
, input_location
),
18441 "wrong number of arguments to "
18442 "%<__builtin_launder%>");
18443 ret
= error_mark_node
;
18446 ret
= finish_builtin_launder (cp_expr_loc_or_loc (t
,
18448 (*call_args
)[0], complain
);
18452 /* Unsupported internal function with arguments. */
18453 gcc_unreachable ();
18455 else if (TREE_CODE (function
) == OFFSET_REF
18456 || TREE_CODE (function
) == DOTSTAR_EXPR
18457 || TREE_CODE (function
) == MEMBER_REF
)
18458 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
18460 else if (TREE_CODE (function
) == COMPONENT_REF
)
18462 tree instance
= TREE_OPERAND (function
, 0);
18463 tree fn
= TREE_OPERAND (function
, 1);
18465 if (processing_template_decl
18466 && (type_dependent_expression_p (instance
)
18467 || (!BASELINK_P (fn
)
18468 && TREE_CODE (fn
) != FIELD_DECL
)
18469 || type_dependent_expression_p (fn
)
18470 || any_type_dependent_arguments_p (call_args
)))
18471 ret
= build_min_nt_call_vec (function
, call_args
);
18472 else if (!BASELINK_P (fn
))
18473 ret
= finish_call_expr (function
, &call_args
,
18474 /*disallow_virtual=*/false,
18475 /*koenig_p=*/false,
18478 ret
= (build_new_method_call
18480 &call_args
, NULL_TREE
,
18481 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
18486 ret
= finish_call_expr (function
, &call_args
,
18487 /*disallow_virtual=*/qualified_p
,
18491 release_tree_vector (call_args
);
18493 if (ret
!= error_mark_node
)
18495 bool op
= CALL_EXPR_OPERATOR_SYNTAX (t
);
18496 bool ord
= CALL_EXPR_ORDERED_ARGS (t
);
18497 bool rev
= CALL_EXPR_REVERSE_ARGS (t
);
18498 bool thk
= CALL_FROM_THUNK_P (t
);
18499 if (op
|| ord
|| rev
|| thk
)
18501 function
= extract_call_expr (ret
);
18502 CALL_EXPR_OPERATOR_SYNTAX (function
) = op
;
18503 CALL_EXPR_ORDERED_ARGS (function
) = ord
;
18504 CALL_EXPR_REVERSE_ARGS (function
) = rev
;
18507 if (TREE_CODE (function
) == CALL_EXPR
)
18508 CALL_FROM_THUNK_P (function
) = true;
18510 AGGR_INIT_FROM_THUNK_P (function
) = true;
18511 /* The thunk location is not interesting. */
18512 SET_EXPR_LOCATION (function
, UNKNOWN_LOCATION
);
18522 tree cond
= RECUR (TREE_OPERAND (t
, 0));
18523 cond
= mark_rvalue_use (cond
);
18524 tree folded_cond
= fold_non_dependent_expr (cond
, complain
);
18527 if (TREE_CODE (folded_cond
) == INTEGER_CST
)
18529 if (integer_zerop (folded_cond
))
18531 ++c_inhibit_evaluation_warnings
;
18532 exp1
= RECUR (TREE_OPERAND (t
, 1));
18533 --c_inhibit_evaluation_warnings
;
18534 exp2
= RECUR (TREE_OPERAND (t
, 2));
18538 exp1
= RECUR (TREE_OPERAND (t
, 1));
18539 ++c_inhibit_evaluation_warnings
;
18540 exp2
= RECUR (TREE_OPERAND (t
, 2));
18541 --c_inhibit_evaluation_warnings
;
18543 cond
= folded_cond
;
18547 exp1
= RECUR (TREE_OPERAND (t
, 1));
18548 exp2
= RECUR (TREE_OPERAND (t
, 2));
18551 warning_sentinel
s(warn_duplicated_branches
);
18552 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
18553 cond
, exp1
, exp2
, complain
));
18556 case PSEUDO_DTOR_EXPR
:
18558 tree op0
= RECUR (TREE_OPERAND (t
, 0));
18559 tree op1
= RECUR (TREE_OPERAND (t
, 1));
18560 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
18561 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
18567 tree purpose
, value
, chain
;
18569 if (t
== void_list_node
)
18572 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
18573 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
18575 /* We have pack expansions, so expand those and
18576 create a new list out of it. */
18577 tree purposevec
= NULL_TREE
;
18578 tree valuevec
= NULL_TREE
;
18582 /* Expand the argument expressions. */
18583 if (TREE_PURPOSE (t
))
18584 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
18585 complain
, in_decl
);
18586 if (TREE_VALUE (t
))
18587 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
18588 complain
, in_decl
);
18590 /* Build the rest of the list. */
18591 chain
= TREE_CHAIN (t
);
18592 if (chain
&& chain
!= void_type_node
)
18593 chain
= RECUR (chain
);
18595 /* Determine the number of arguments. */
18596 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
18598 len
= TREE_VEC_LENGTH (purposevec
);
18599 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
18601 else if (TREE_CODE (valuevec
) == TREE_VEC
)
18602 len
= TREE_VEC_LENGTH (valuevec
);
18605 /* Since we only performed a partial substitution into
18606 the argument pack, we only RETURN (a single list
18608 if (purposevec
== TREE_PURPOSE (t
)
18609 && valuevec
== TREE_VALUE (t
)
18610 && chain
== TREE_CHAIN (t
))
18613 RETURN (tree_cons (purposevec
, valuevec
, chain
));
18616 /* Convert the argument vectors into a TREE_LIST */
18620 /* Grab the Ith values. */
18622 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
18625 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
18628 /* Build the list (backwards). */
18629 chain
= tree_cons (purpose
, value
, chain
);
18635 purpose
= TREE_PURPOSE (t
);
18637 purpose
= RECUR (purpose
);
18638 value
= TREE_VALUE (t
);
18640 value
= RECUR (value
);
18641 chain
= TREE_CHAIN (t
);
18642 if (chain
&& chain
!= void_type_node
)
18643 chain
= RECUR (chain
);
18644 if (purpose
== TREE_PURPOSE (t
)
18645 && value
== TREE_VALUE (t
)
18646 && chain
== TREE_CHAIN (t
))
18648 RETURN (tree_cons (purpose
, value
, chain
));
18651 case COMPONENT_REF
:
18658 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
18659 args
, complain
, in_decl
);
18660 /* Remember that there was a reference to this entity. */
18661 if (DECL_P (object
)
18662 && !mark_used (object
, complain
) && !(complain
& tf_error
))
18663 RETURN (error_mark_node
);
18664 object_type
= TREE_TYPE (object
);
18666 member
= TREE_OPERAND (t
, 1);
18667 if (BASELINK_P (member
))
18668 member
= tsubst_baselink (member
,
18669 non_reference (TREE_TYPE (object
)),
18670 args
, complain
, in_decl
);
18672 member
= tsubst_copy (member
, args
, complain
, in_decl
);
18673 if (member
== error_mark_node
)
18674 RETURN (error_mark_node
);
18676 if (TREE_CODE (member
) == FIELD_DECL
)
18678 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
18679 if (TREE_CODE (r
) == COMPONENT_REF
)
18680 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
18683 else if (type_dependent_expression_p (object
))
18684 /* We can't do much here. */;
18685 else if (!CLASS_TYPE_P (object_type
))
18687 if (scalarish_type_p (object_type
))
18689 tree s
= NULL_TREE
;
18690 tree dtor
= member
;
18692 if (TREE_CODE (dtor
) == SCOPE_REF
)
18694 s
= TREE_OPERAND (dtor
, 0);
18695 dtor
= TREE_OPERAND (dtor
, 1);
18697 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
18699 dtor
= TREE_OPERAND (dtor
, 0);
18701 RETURN (finish_pseudo_destructor_expr
18702 (object
, s
, dtor
, input_location
));
18706 else if (TREE_CODE (member
) == SCOPE_REF
18707 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
18709 /* Lookup the template functions now that we know what the
18711 tree scope
= TREE_OPERAND (member
, 0);
18712 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
18713 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
18714 member
= lookup_qualified_name (scope
, tmpl
,
18715 /*is_type_p=*/false,
18716 /*complain=*/false);
18717 if (BASELINK_P (member
))
18719 BASELINK_FUNCTIONS (member
)
18720 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
18722 member
= (adjust_result_of_qualified_name_lookup
18723 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
18728 qualified_name_lookup_error (scope
, tmpl
, member
,
18730 RETURN (error_mark_node
);
18733 else if (TREE_CODE (member
) == SCOPE_REF
18734 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
18735 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
18737 if (complain
& tf_error
)
18739 if (TYPE_P (TREE_OPERAND (member
, 0)))
18740 error ("%qT is not a class or namespace",
18741 TREE_OPERAND (member
, 0));
18743 error ("%qD is not a class or namespace",
18744 TREE_OPERAND (member
, 0));
18746 RETURN (error_mark_node
);
18749 r
= finish_class_member_access_expr (object
, member
,
18750 /*template_p=*/false,
18752 if (TREE_CODE (r
) == COMPONENT_REF
)
18753 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
18758 RETURN (build_throw
18759 (RECUR (TREE_OPERAND (t
, 0))));
18763 vec
<constructor_elt
, va_gc
> *n
;
18764 constructor_elt
*ce
;
18765 unsigned HOST_WIDE_INT idx
;
18766 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
18767 bool process_index_p
;
18769 bool need_copy_p
= false;
18772 if (type
== error_mark_node
)
18773 RETURN (error_mark_node
);
18775 /* We do not want to process the index of aggregate
18776 initializers as they are identifier nodes which will be
18777 looked up by digest_init. */
18778 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
18780 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
18781 newlen
= vec_safe_length (n
);
18782 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
18784 if (ce
->index
&& process_index_p
18785 /* An identifier index is looked up in the type
18786 being initialized, not the current scope. */
18787 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
18788 ce
->index
= RECUR (ce
->index
);
18790 if (PACK_EXPANSION_P (ce
->value
))
18792 /* Substitute into the pack expansion. */
18793 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
18796 if (ce
->value
== error_mark_node
18797 || PACK_EXPANSION_P (ce
->value
))
18799 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
18800 /* Just move the argument into place. */
18801 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
18804 /* Update the length of the final CONSTRUCTOR
18805 arguments vector, and note that we will need to
18807 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
18808 need_copy_p
= true;
18812 ce
->value
= RECUR (ce
->value
);
18817 vec
<constructor_elt
, va_gc
> *old_n
= n
;
18819 vec_alloc (n
, newlen
);
18820 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
18822 if (TREE_CODE (ce
->value
) == TREE_VEC
)
18824 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
18825 for (i
= 0; i
< len
; ++i
)
18826 CONSTRUCTOR_APPEND_ELT (n
, 0,
18827 TREE_VEC_ELT (ce
->value
, i
));
18830 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
18834 r
= build_constructor (init_list_type_node
, n
);
18835 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
18837 if (TREE_HAS_CONSTRUCTOR (t
))
18839 fcl_t cl
= fcl_functional
;
18840 if (CONSTRUCTOR_C99_COMPOUND_LITERAL (t
))
18842 RETURN (finish_compound_literal (type
, r
, complain
, cl
));
18845 TREE_TYPE (r
) = type
;
18851 tree operand_0
= TREE_OPERAND (t
, 0);
18852 if (TYPE_P (operand_0
))
18854 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
18855 RETURN (get_typeid (operand_0
, complain
));
18859 operand_0
= RECUR (operand_0
);
18860 RETURN (build_typeid (operand_0
, complain
));
18871 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
18872 /* ??? We're doing a subset of finish_id_expression here. */
18874 && !processing_template_decl
18875 && !cp_unevaluated_operand
18876 && (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
18877 && CP_DECL_THREAD_LOCAL_P (r
))
18879 if (tree wrap
= get_tls_wrapper_fn (r
))
18880 /* Replace an evaluated use of the thread_local variable with
18881 a call to its wrapper. */
18882 r
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
18884 else if (outer_automatic_var_p (r
))
18885 r
= process_outer_var_ref (r
, complain
);
18887 if (!TYPE_REF_P (TREE_TYPE (t
)))
18888 /* If the original type was a reference, we'll be wrapped in
18889 the appropriate INDIRECT_REF. */
18890 r
= convert_from_reference (r
);
18896 tree op0
= RECUR (TREE_OPERAND (t
, 0));
18897 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
18898 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
18901 case OFFSETOF_EXPR
:
18904 = tsubst_copy_and_build (TREE_OPERAND (t
, 1), args
, complain
,
18905 in_decl
, /*function_p=*/false,
18906 /*integral_constant_expression_p=*/false);
18907 RETURN (finish_offsetof (object_ptr
,
18908 RECUR (TREE_OPERAND (t
, 0)),
18909 EXPR_LOCATION (t
)));
18912 case ADDRESSOF_EXPR
:
18913 RETURN (cp_build_addressof (EXPR_LOCATION (t
),
18914 RECUR (TREE_OPERAND (t
, 0)), complain
));
18918 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
18919 complain
, in_decl
);
18921 tree type2
= TRAIT_EXPR_TYPE2 (t
);
18922 if (type2
&& TREE_CODE (type2
) == TREE_LIST
)
18923 type2
= RECUR (type2
);
18925 type2
= tsubst (type2
, args
, complain
, in_decl
);
18927 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
18932 tree old_stmt_expr
= cur_stmt_expr
;
18933 tree stmt_expr
= begin_stmt_expr ();
18935 cur_stmt_expr
= stmt_expr
;
18936 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
18937 integral_constant_expression_p
);
18938 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
18939 cur_stmt_expr
= old_stmt_expr
;
18941 /* If the resulting list of expression statement is empty,
18942 fold it further into void_node. */
18943 if (empty_expr_stmt_p (stmt_expr
))
18944 stmt_expr
= void_node
;
18946 RETURN (stmt_expr
);
18951 tree r
= tsubst_lambda_expr (t
, args
, complain
, in_decl
);
18953 RETURN (build_lambda_object (r
));
18957 /* We can get here for a constant initializer of non-dependent type.
18958 FIXME stop folding in cp_parser_initializer_clause. */
18960 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
18965 case TRANSACTION_EXPR
:
18966 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
18967 integral_constant_expression_p
));
18970 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
18972 case VEC_PERM_EXPR
:
18974 tree op0
= RECUR (TREE_OPERAND (t
, 0));
18975 tree op1
= RECUR (TREE_OPERAND (t
, 1));
18976 tree op2
= RECUR (TREE_OPERAND (t
, 2));
18977 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
18981 case REQUIRES_EXPR
:
18982 RETURN (tsubst_requires_expr (t
, args
, complain
, in_decl
));
18984 case NON_LVALUE_EXPR
:
18985 case VIEW_CONVERT_EXPR
:
18986 /* We should only see these for location wrapper nodes, or within
18987 instantiate_non_dependent_expr (when args is NULL_TREE). */
18988 gcc_assert (location_wrapper_p (t
) || args
== NULL_TREE
);
18989 if (location_wrapper_p (t
))
18990 RETURN (maybe_wrap_with_location (RECUR (TREE_OPERAND (t
, 0)),
18991 EXPR_LOCATION (t
)));
18995 /* Handle Objective-C++ constructs, if appropriate. */
18998 = objcp_tsubst_copy_and_build (t
, args
, complain
,
18999 in_decl
, /*function_p=*/false);
19003 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
19009 input_location
= loc
;
19013 /* Verify that the instantiated ARGS are valid. For type arguments,
19014 make sure that the type's linkage is ok. For non-type arguments,
19015 make sure they are constants if they are integral or enumerations.
19016 Emit an error under control of COMPLAIN, and return TRUE on error. */
19019 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
19021 if (dependent_template_arg_p (t
))
19023 if (ARGUMENT_PACK_P (t
))
19025 tree vec
= ARGUMENT_PACK_ARGS (t
);
19026 int len
= TREE_VEC_LENGTH (vec
);
19027 bool result
= false;
19030 for (i
= 0; i
< len
; ++i
)
19031 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
19035 else if (TYPE_P (t
))
19037 /* [basic.link]: A name with no linkage (notably, the name
19038 of a class or enumeration declared in a local scope)
19039 shall not be used to declare an entity with linkage.
19040 This implies that names with no linkage cannot be used as
19043 DR 757 relaxes this restriction for C++0x. */
19044 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
19045 : no_linkage_check (t
, /*relaxed_p=*/false));
19049 /* DR 488 makes use of a type with no linkage cause
19050 type deduction to fail. */
19051 if (complain
& tf_error
)
19053 if (TYPE_UNNAMED_P (nt
))
19054 error ("%qT is/uses unnamed type", t
);
19056 error ("template argument for %qD uses local type %qT",
19061 /* In order to avoid all sorts of complications, we do not
19062 allow variably-modified types as template arguments. */
19063 else if (variably_modified_type_p (t
, NULL_TREE
))
19065 if (complain
& tf_error
)
19066 error ("%qT is a variably modified type", t
);
19070 /* Class template and alias template arguments should be OK. */
19071 else if (DECL_TYPE_TEMPLATE_P (t
))
19073 /* A non-type argument of integral or enumerated type must be a
19075 else if (TREE_TYPE (t
)
19076 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
19077 && !REFERENCE_REF_P (t
)
19078 && !TREE_CONSTANT (t
))
19080 if (complain
& tf_error
)
19081 error ("integral expression %qE is not constant", t
);
19088 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
19090 int ix
, len
= DECL_NTPARMS (tmpl
);
19091 bool result
= false;
19093 for (ix
= 0; ix
!= len
; ix
++)
19095 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
19098 if (result
&& (complain
& tf_error
))
19099 error (" trying to instantiate %qD", tmpl
);
19103 /* We're out of SFINAE context now, so generate diagnostics for the access
19104 errors we saw earlier when instantiating D from TMPL and ARGS. */
19107 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
19109 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
19110 tree type
= TREE_TYPE (pattern
);
19111 location_t loc
= input_location
;
19113 push_access_scope (d
);
19114 push_deferring_access_checks (dk_no_deferred
);
19115 input_location
= DECL_SOURCE_LOCATION (pattern
);
19116 tsubst (type
, args
, tf_warning_or_error
, d
);
19117 input_location
= loc
;
19118 pop_deferring_access_checks ();
19119 pop_access_scope (d
);
19122 /* Instantiate the indicated variable, function, or alias template TMPL with
19123 the template arguments in TARG_PTR. */
19126 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
19128 tree targ_ptr
= orig_args
;
19132 bool access_ok
= true;
19134 if (tmpl
== error_mark_node
)
19135 return error_mark_node
;
19137 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
19139 /* If this function is a clone, handle it specially. */
19140 if (DECL_CLONED_FUNCTION_P (tmpl
))
19145 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
19146 DECL_CLONED_FUNCTION. */
19147 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
19148 targ_ptr
, complain
);
19149 if (spec
== error_mark_node
)
19150 return error_mark_node
;
19152 /* Look for the clone. */
19153 FOR_EACH_CLONE (clone
, spec
)
19154 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
19156 /* We should always have found the clone by now. */
19157 gcc_unreachable ();
19161 if (targ_ptr
== error_mark_node
)
19162 return error_mark_node
;
19164 /* Check to see if we already have this specialization. */
19165 gen_tmpl
= most_general_template (tmpl
);
19166 if (TMPL_ARGS_DEPTH (targ_ptr
)
19167 < TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
)))
19168 /* targ_ptr only has the innermost template args, so add the outer ones
19169 from tmpl, which could be either a partial instantiation or gen_tmpl (in
19170 the case of a non-dependent call within a template definition). */
19171 targ_ptr
= (add_outermost_template_args
19172 (DECL_TI_ARGS (DECL_TEMPLATE_RESULT (tmpl
)),
19175 /* It would be nice to avoid hashing here and then again in tsubst_decl,
19176 but it doesn't seem to be on the hot path. */
19177 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
19179 gcc_assert (tmpl
== gen_tmpl
19180 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
19182 || fndecl
== NULL_TREE
);
19184 if (spec
!= NULL_TREE
)
19186 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
19188 if (complain
& tf_error
)
19189 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
19190 return error_mark_node
;
19195 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
19197 return error_mark_node
;
19199 /* We are building a FUNCTION_DECL, during which the access of its
19200 parameters and return types have to be checked. However this
19201 FUNCTION_DECL which is the desired context for access checking
19202 is not built yet. We solve this chicken-and-egg problem by
19203 deferring all checks until we have the FUNCTION_DECL. */
19204 push_deferring_access_checks (dk_deferred
);
19206 /* Instantiation of the function happens in the context of the function
19207 template, not the context of the overload resolution we're doing. */
19208 push_to_top_level ();
19209 /* If there are dependent arguments, e.g. because we're doing partial
19210 ordering, make sure processing_template_decl stays set. */
19211 if (uses_template_parms (targ_ptr
))
19212 ++processing_template_decl
;
19213 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
19215 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
19216 complain
, gen_tmpl
, true);
19217 push_nested_class (ctx
);
19220 tree pattern
= DECL_TEMPLATE_RESULT (gen_tmpl
);
19222 fndecl
= NULL_TREE
;
19223 if (VAR_P (pattern
))
19225 /* We need to determine if we're using a partial or explicit
19226 specialization now, because the type of the variable could be
19228 tree tid
= lookup_template_variable (gen_tmpl
, targ_ptr
);
19229 tree elt
= most_specialized_partial_spec (tid
, complain
);
19230 if (elt
== error_mark_node
)
19231 pattern
= error_mark_node
;
19234 tree partial_tmpl
= TREE_VALUE (elt
);
19235 tree partial_args
= TREE_PURPOSE (elt
);
19236 tree partial_pat
= DECL_TEMPLATE_RESULT (partial_tmpl
);
19237 fndecl
= tsubst (partial_pat
, partial_args
, complain
, gen_tmpl
);
19241 /* Substitute template parameters to obtain the specialization. */
19242 if (fndecl
== NULL_TREE
)
19243 fndecl
= tsubst (pattern
, targ_ptr
, complain
, gen_tmpl
);
19244 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
19245 pop_nested_class ();
19246 pop_from_top_level ();
19248 if (fndecl
== error_mark_node
)
19250 pop_deferring_access_checks ();
19251 return error_mark_node
;
19254 /* The DECL_TI_TEMPLATE should always be the immediate parent
19255 template, not the most general template. */
19256 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
19257 DECL_TI_ARGS (fndecl
) = targ_ptr
;
19259 /* Now we know the specialization, compute access previously
19260 deferred. Do no access control for inheriting constructors,
19261 as we already checked access for the inherited constructor. */
19262 if (!(flag_new_inheriting_ctors
19263 && DECL_INHERITED_CTOR (fndecl
)))
19265 push_access_scope (fndecl
);
19266 if (!perform_deferred_access_checks (complain
))
19268 pop_access_scope (fndecl
);
19270 pop_deferring_access_checks ();
19272 /* If we've just instantiated the main entry point for a function,
19273 instantiate all the alternate entry points as well. We do this
19274 by cloning the instantiation of the main entry point, not by
19275 instantiating the template clones. */
19276 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
19277 clone_function_decl (fndecl
, /*update_methods=*/false);
19281 if (!(complain
& tf_error
))
19283 /* Remember to reinstantiate when we're out of SFINAE so the user
19284 can see the errors. */
19285 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
19287 return error_mark_node
;
19292 /* Wrapper for instantiate_template_1. */
19295 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
19298 timevar_push (TV_TEMPLATE_INST
);
19299 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
19300 timevar_pop (TV_TEMPLATE_INST
);
19304 /* Instantiate the alias template TMPL with ARGS. Also push a template
19305 instantiation level, which instantiate_template doesn't do because
19306 functions and variables have sufficient context established by the
19310 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
19312 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
19313 return error_mark_node
;
19314 if (!push_tinst_level (tmpl
, args
))
19315 return error_mark_node
;
19318 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
19319 args
, tmpl
, complain
,
19320 /*require_all_args=*/true,
19321 /*use_default_args=*/true);
19323 tree r
= instantiate_template (tmpl
, args
, complain
);
19324 pop_tinst_level ();
19329 /* PARM is a template parameter pack for FN. Returns true iff
19330 PARM is used in a deducible way in the argument list of FN. */
19333 pack_deducible_p (tree parm
, tree fn
)
19335 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
19336 for (; t
; t
= TREE_CHAIN (t
))
19338 tree type
= TREE_VALUE (t
);
19340 if (!PACK_EXPANSION_P (type
))
19342 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
19343 packs
; packs
= TREE_CHAIN (packs
))
19344 if (template_args_equal (TREE_VALUE (packs
), parm
))
19346 /* The template parameter pack is used in a function parameter
19347 pack. If this is the end of the parameter list, the
19348 template parameter pack is deducible. */
19349 if (TREE_CHAIN (t
) == void_list_node
)
19352 /* Otherwise, not. Well, it could be deduced from
19353 a non-pack parameter, but doing so would end up with
19354 a deduction mismatch, so don't bother. */
19358 /* The template parameter pack isn't used in any function parameter
19359 packs, but it might be used deeper, e.g. tuple<Args...>. */
19363 /* Subroutine of fn_type_unification: check non-dependent parms for
19367 check_non_deducible_conversions (tree parms
, const tree
*args
, unsigned nargs
,
19368 tree fn
, unification_kind_t strict
, int flags
,
19369 struct conversion
**convs
, bool explain_p
)
19371 /* Non-constructor methods need to leave a conversion for 'this', which
19372 isn't included in nargs here. */
19373 unsigned offset
= (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
19374 && !DECL_CONSTRUCTOR_P (fn
));
19376 for (unsigned ia
= 0;
19377 parms
&& parms
!= void_list_node
&& ia
< nargs
; )
19379 tree parm
= TREE_VALUE (parms
);
19381 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
19382 && (!TREE_CHAIN (parms
)
19383 || TREE_CHAIN (parms
) == void_list_node
))
19384 /* For a function parameter pack that occurs at the end of the
19385 parameter-declaration-list, the type A of each remaining
19386 argument of the call is compared with the type P of the
19387 declarator-id of the function parameter pack. */
19390 parms
= TREE_CHAIN (parms
);
19392 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
19393 /* For a function parameter pack that does not occur at the
19394 end of the parameter-declaration-list, the type of the
19395 parameter pack is a non-deduced context. */
19398 if (!uses_template_parms (parm
))
19400 tree arg
= args
[ia
];
19401 conversion
**conv_p
= convs
? &convs
[ia
+offset
] : NULL
;
19402 int lflags
= conv_flags (ia
, nargs
, fn
, arg
, flags
);
19404 if (check_non_deducible_conversion (parm
, arg
, strict
, lflags
,
19405 conv_p
, explain_p
))
19415 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
19416 NARGS elements of the arguments that are being used when calling
19417 it. TARGS is a vector into which the deduced template arguments
19420 Returns either a FUNCTION_DECL for the matching specialization of FN or
19421 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
19422 true, diagnostics will be printed to explain why it failed.
19424 If FN is a conversion operator, or we are trying to produce a specific
19425 specialization, RETURN_TYPE is the return type desired.
19427 The EXPLICIT_TARGS are explicit template arguments provided via a
19430 The parameter STRICT is one of:
19433 We are deducing arguments for a function call, as in
19434 [temp.deduct.call]. If RETURN_TYPE is non-null, we are
19435 deducing arguments for a call to the result of a conversion
19436 function template, as in [over.call.object].
19439 We are deducing arguments for a conversion function, as in
19440 [temp.deduct.conv].
19443 We are deducing arguments when doing an explicit instantiation
19444 as in [temp.explicit], when determining an explicit specialization
19445 as in [temp.expl.spec], or when taking the address of a function
19446 template, as in [temp.deduct.funcaddr]. */
19449 fn_type_unification (tree fn
,
19450 tree explicit_targs
,
19453 unsigned int nargs
,
19455 unification_kind_t strict
,
19457 struct conversion
**convs
,
19463 tree decl
= NULL_TREE
;
19464 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
19466 static int deduction_depth
;
19469 if (flag_new_inheriting_ctors
)
19470 fn
= strip_inheriting_ctors (fn
);
19472 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
19473 tree r
= error_mark_node
;
19475 tree full_targs
= targs
;
19476 if (TMPL_ARGS_DEPTH (targs
)
19477 < TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (fn
)))
19478 full_targs
= (add_outermost_template_args
19479 (DECL_TI_ARGS (DECL_TEMPLATE_RESULT (fn
)),
19483 complain
|= tf_decltype
;
19485 /* In C++0x, it's possible to have a function template whose type depends
19486 on itself recursively. This is most obvious with decltype, but can also
19487 occur with enumeration scope (c++/48969). So we need to catch infinite
19488 recursion and reject the substitution at deduction time; this function
19489 will return error_mark_node for any repeated substitution.
19491 This also catches excessive recursion such as when f<N> depends on
19492 f<N-1> across all integers, and returns error_mark_node for all the
19493 substitutions back up to the initial one.
19495 This is, of course, not reentrant. */
19496 if (excessive_deduction_depth
)
19497 return error_mark_node
;
19500 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
19502 fntype
= TREE_TYPE (fn
);
19503 if (explicit_targs
)
19507 The specified template arguments must match the template
19508 parameters in kind (i.e., type, nontype, template), and there
19509 must not be more arguments than there are parameters;
19510 otherwise type deduction fails.
19512 Nontype arguments must match the types of the corresponding
19513 nontype template parameters, or must be convertible to the
19514 types of the corresponding nontype parameters as specified in
19515 _temp.arg.nontype_, otherwise type deduction fails.
19517 All references in the function type of the function template
19518 to the corresponding template parameters are replaced by the
19519 specified template argument values. If a substitution in a
19520 template parameter or in the function type of the function
19521 template results in an invalid type, type deduction fails. */
19522 int i
, len
= TREE_VEC_LENGTH (tparms
);
19523 location_t loc
= input_location
;
19524 bool incomplete
= false;
19526 if (explicit_targs
== error_mark_node
)
19529 if (TMPL_ARGS_DEPTH (explicit_targs
)
19530 < TMPL_ARGS_DEPTH (full_targs
))
19531 explicit_targs
= add_outermost_template_args (full_targs
,
19534 /* Adjust any explicit template arguments before entering the
19535 substitution context. */
19537 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
19539 /*require_all_args=*/false,
19540 /*use_default_args=*/false));
19541 if (explicit_targs
== error_mark_node
)
19544 /* Substitute the explicit args into the function type. This is
19545 necessary so that, for instance, explicitly declared function
19546 arguments can match null pointed constants. If we were given
19547 an incomplete set of explicit args, we must not do semantic
19548 processing during substitution as we could create partial
19550 for (i
= 0; i
< len
; i
++)
19552 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
19553 bool parameter_pack
= false;
19554 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
19556 /* Dig out the actual parm. */
19557 if (TREE_CODE (parm
) == TYPE_DECL
19558 || TREE_CODE (parm
) == TEMPLATE_DECL
)
19560 parm
= TREE_TYPE (parm
);
19561 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
19563 else if (TREE_CODE (parm
) == PARM_DECL
)
19565 parm
= DECL_INITIAL (parm
);
19566 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
19569 if (!parameter_pack
&& targ
== NULL_TREE
)
19570 /* No explicit argument for this template parameter. */
19573 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
19575 /* Mark the argument pack as "incomplete". We could
19576 still deduce more arguments during unification.
19577 We remove this mark in type_unification_real. */
19580 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
19581 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
19582 = ARGUMENT_PACK_ARGS (targ
);
19585 /* We have some incomplete argument packs. */
19590 if (!push_tinst_level (fn
, explicit_targs
))
19592 excessive_deduction_depth
= true;
19595 processing_template_decl
+= incomplete
;
19596 input_location
= DECL_SOURCE_LOCATION (fn
);
19597 /* Ignore any access checks; we'll see them again in
19598 instantiate_template and they might have the wrong
19599 access path at this point. */
19600 push_deferring_access_checks (dk_deferred
);
19601 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
19602 complain
| tf_partial
| tf_fndecl_type
, NULL_TREE
);
19603 pop_deferring_access_checks ();
19604 input_location
= loc
;
19605 processing_template_decl
-= incomplete
;
19606 pop_tinst_level ();
19608 if (fntype
== error_mark_node
)
19611 /* Place the explicitly specified arguments in TARGS. */
19612 explicit_targs
= INNERMOST_TEMPLATE_ARGS (explicit_targs
);
19613 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
19614 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
19617 /* Never do unification on the 'this' parameter. */
19618 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
19620 if (return_type
&& strict
== DEDUCE_CALL
)
19622 /* We're deducing for a call to the result of a template conversion
19623 function. The parms we really want are in return_type. */
19624 if (INDIRECT_TYPE_P (return_type
))
19625 return_type
= TREE_TYPE (return_type
);
19626 parms
= TYPE_ARG_TYPES (return_type
);
19628 else if (return_type
)
19632 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
19633 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
19634 new_args
[0] = return_type
;
19635 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
19640 /* We allow incomplete unification without an error message here
19641 because the standard doesn't seem to explicitly prohibit it. Our
19642 callers must be ready to deal with unification failures in any
19645 /* If we aren't explaining yet, push tinst context so we can see where
19646 any errors (e.g. from class instantiations triggered by instantiation
19647 of default template arguments) come from. If we are explaining, this
19648 context is redundant. */
19649 if (!explain_p
&& !push_tinst_level (fn
, targs
))
19651 excessive_deduction_depth
= true;
19655 /* type_unification_real will pass back any access checks from default
19656 template argument substitution. */
19657 vec
<deferred_access_check
, va_gc
> *checks
;
19660 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
19661 full_targs
, parms
, args
, nargs
, /*subr=*/0,
19662 strict
, &checks
, explain_p
);
19664 pop_tinst_level ();
19668 /* Now that we have bindings for all of the template arguments,
19669 ensure that the arguments deduced for the template template
19670 parameters have compatible template parameter lists. We cannot
19671 check this property before we have deduced all template
19672 arguments, because the template parameter types of a template
19673 template parameter might depend on prior template parameters
19674 deduced after the template template parameter. The following
19675 ill-formed example illustrates this issue:
19677 template<typename T, template<T> class C> void f(C<5>, T);
19679 template<int N> struct X {};
19682 f(X<5>(), 5l); // error: template argument deduction fails
19685 The template parameter list of 'C' depends on the template type
19686 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
19687 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
19688 time that we deduce 'C'. */
19689 if (!template_template_parm_bindings_ok_p
19690 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
19692 unify_inconsistent_template_template_parameters (explain_p
);
19696 /* DR 1391: All parameters have args, now check non-dependent parms for
19698 if (check_non_deducible_conversions (parms
, args
, nargs
, fn
, strict
, flags
,
19702 /* All is well so far. Now, check:
19706 When all template arguments have been deduced, all uses of
19707 template parameters in nondeduced contexts are replaced with
19708 the corresponding deduced argument values. If the
19709 substitution results in an invalid type, as described above,
19710 type deduction fails. */
19711 if (!push_tinst_level (fn
, targs
))
19713 excessive_deduction_depth
= true;
19717 /* Also collect access checks from the instantiation. */
19718 reopen_deferring_access_checks (checks
);
19720 decl
= instantiate_template (fn
, targs
, complain
);
19722 checks
= get_deferred_access_checks ();
19723 pop_deferring_access_checks ();
19725 pop_tinst_level ();
19727 if (decl
== error_mark_node
)
19730 /* Now perform any access checks encountered during substitution. */
19731 push_access_scope (decl
);
19732 ok
= perform_access_checks (checks
, complain
);
19733 pop_access_scope (decl
);
19737 /* If we're looking for an exact match, check that what we got
19738 is indeed an exact match. It might not be if some template
19739 parameters are used in non-deduced contexts. But don't check
19740 for an exact match if we have dependent template arguments;
19741 in that case we're doing partial ordering, and we already know
19742 that we have two candidates that will provide the actual type. */
19743 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
19745 tree substed
= TREE_TYPE (decl
);
19749 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
19751 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
19752 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
19753 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
19755 unify_type_mismatch (explain_p
, args
[i
],
19756 TREE_VALUE (sarg
));
19761 /* After doing deduction with the inherited constructor, actually return an
19762 instantiation of the inheriting constructor. */
19764 decl
= instantiate_template (orig_fn
, targs
, complain
);
19770 if (excessive_deduction_depth
)
19772 if (deduction_depth
== 0)
19773 /* Reset once we're all the way out. */
19774 excessive_deduction_depth
= false;
19780 /* Adjust types before performing type deduction, as described in
19781 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
19782 sections are symmetric. PARM is the type of a function parameter
19783 or the return type of the conversion function. ARG is the type of
19784 the argument passed to the call, or the type of the value
19785 initialized with the result of the conversion function.
19786 ARG_EXPR is the original argument expression, which may be null. */
19789 maybe_adjust_types_for_deduction (unification_kind_t strict
,
19802 /* Swap PARM and ARG throughout the remainder of this
19803 function; the handling is precisely symmetric since PARM
19804 will initialize ARG rather than vice versa. */
19805 std::swap (parm
, arg
);
19809 /* Core issue #873: Do the DR606 thing (see below) for these cases,
19810 too, but here handle it by stripping the reference from PARM
19811 rather than by adding it to ARG. */
19812 if (TYPE_REF_P (*parm
)
19813 && TYPE_REF_IS_RVALUE (*parm
)
19814 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
19815 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
19816 && TYPE_REF_P (*arg
)
19817 && !TYPE_REF_IS_RVALUE (*arg
))
19818 *parm
= TREE_TYPE (*parm
);
19819 /* Nothing else to do in this case. */
19823 gcc_unreachable ();
19826 if (!TYPE_REF_P (*parm
))
19828 /* [temp.deduct.call]
19830 If P is not a reference type:
19832 --If A is an array type, the pointer type produced by the
19833 array-to-pointer standard conversion (_conv.array_) is
19834 used in place of A for type deduction; otherwise,
19836 --If A is a function type, the pointer type produced by
19837 the function-to-pointer standard conversion
19838 (_conv.func_) is used in place of A for type deduction;
19841 --If A is a cv-qualified type, the top level
19842 cv-qualifiers of A's type are ignored for type
19844 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
19845 *arg
= build_pointer_type (TREE_TYPE (*arg
));
19846 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
19847 *arg
= build_pointer_type (*arg
);
19849 *arg
= TYPE_MAIN_VARIANT (*arg
);
19852 /* [14.8.2.1/3 temp.deduct.call], "A forwarding reference is an rvalue
19853 reference to a cv-unqualified template parameter that does not represent a
19854 template parameter of a class template (during class template argument
19855 deduction (13.3.1.8)). If P is a forwarding reference and the argument is
19856 an lvalue, the type "lvalue reference to A" is used in place of A for type
19858 if (TYPE_REF_P (*parm
)
19859 && TYPE_REF_IS_RVALUE (*parm
)
19860 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
19861 && !TEMPLATE_TYPE_PARM_FOR_CLASS (TREE_TYPE (*parm
))
19862 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
19863 && (arg_expr
? lvalue_p (arg_expr
)
19864 /* try_one_overload doesn't provide an arg_expr, but
19865 functions are always lvalues. */
19866 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
19867 *arg
= build_reference_type (*arg
);
19869 /* [temp.deduct.call]
19871 If P is a cv-qualified type, the top level cv-qualifiers
19872 of P's type are ignored for type deduction. If P is a
19873 reference type, the type referred to by P is used for
19875 *parm
= TYPE_MAIN_VARIANT (*parm
);
19876 if (TYPE_REF_P (*parm
))
19878 *parm
= TREE_TYPE (*parm
);
19879 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
19882 /* DR 322. For conversion deduction, remove a reference type on parm
19883 too (which has been swapped into ARG). */
19884 if (strict
== DEDUCE_CONV
&& TYPE_REF_P (*arg
))
19885 *arg
= TREE_TYPE (*arg
);
19890 /* Subroutine of fn_type_unification. PARM is a function parameter of a
19891 template which doesn't contain any deducible template parameters; check if
19892 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
19893 unify_one_argument. */
19896 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
19897 int flags
, struct conversion
**conv_p
,
19903 type
= TREE_TYPE (arg
);
19907 if (same_type_p (parm
, type
))
19908 return unify_success (explain_p
);
19910 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
19911 if (strict
== DEDUCE_CONV
)
19913 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
, complain
))
19914 return unify_success (explain_p
);
19916 else if (strict
!= DEDUCE_EXACT
)
19919 tree conv_arg
= TYPE_P (arg
) ? NULL_TREE
: arg
;
19921 /* Avoid recalculating this in add_function_candidate. */
19923 = good_conversion (parm
, type
, conv_arg
, flags
, complain
));
19925 ok
= can_convert_arg (parm
, type
, conv_arg
, flags
, complain
);
19927 return unify_success (explain_p
);
19930 if (strict
== DEDUCE_EXACT
)
19931 return unify_type_mismatch (explain_p
, parm
, arg
);
19933 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
19936 static bool uses_deducible_template_parms (tree type
);
19938 /* Returns true iff the expression EXPR is one from which a template
19939 argument can be deduced. In other words, if it's an undecorated
19940 use of a template non-type parameter. */
19943 deducible_expression (tree expr
)
19945 /* Strip implicit conversions. */
19946 while (CONVERT_EXPR_P (expr
))
19947 expr
= TREE_OPERAND (expr
, 0);
19948 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
19951 /* Returns true iff the array domain DOMAIN uses a template parameter in a
19952 deducible way; that is, if it has a max value of <PARM> - 1. */
19955 deducible_array_bound (tree domain
)
19957 if (domain
== NULL_TREE
)
19960 tree max
= TYPE_MAX_VALUE (domain
);
19961 if (TREE_CODE (max
) != MINUS_EXPR
)
19964 return deducible_expression (TREE_OPERAND (max
, 0));
19967 /* Returns true iff the template arguments ARGS use a template parameter
19968 in a deducible way. */
19971 deducible_template_args (tree args
)
19973 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
19976 tree elt
= TREE_VEC_ELT (args
, i
);
19977 if (ARGUMENT_PACK_P (elt
))
19978 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
19981 if (PACK_EXPANSION_P (elt
))
19982 elt
= PACK_EXPANSION_PATTERN (elt
);
19983 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
19985 else if (TYPE_P (elt
))
19986 deducible
= uses_deducible_template_parms (elt
);
19988 deducible
= deducible_expression (elt
);
19996 /* Returns true iff TYPE contains any deducible references to template
19997 parameters, as per 14.8.2.5. */
20000 uses_deducible_template_parms (tree type
)
20002 if (PACK_EXPANSION_P (type
))
20003 type
= PACK_EXPANSION_PATTERN (type
);
20010 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
20011 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
20017 if (INDIRECT_TYPE_P (type
))
20018 return uses_deducible_template_parms (TREE_TYPE (type
));
20020 /* T[integer-constant ]
20022 if (TREE_CODE (type
) == ARRAY_TYPE
)
20023 return (uses_deducible_template_parms (TREE_TYPE (type
))
20024 || deducible_array_bound (TYPE_DOMAIN (type
)));
20036 if (TYPE_PTRMEM_P (type
))
20037 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
20038 || (uses_deducible_template_parms
20039 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
20041 /* template-name <T> (where template-name refers to a class template)
20042 template-name <i> (where template-name refers to a class template) */
20043 if (CLASS_TYPE_P (type
)
20044 && CLASSTYPE_TEMPLATE_INFO (type
)
20045 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
20046 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
20047 (CLASSTYPE_TI_ARGS (type
)));
20052 if (TREE_CODE (type
) == FUNCTION_TYPE
20053 || TREE_CODE (type
) == METHOD_TYPE
)
20055 if (uses_deducible_template_parms (TREE_TYPE (type
)))
20057 tree parm
= TYPE_ARG_TYPES (type
);
20058 if (TREE_CODE (type
) == METHOD_TYPE
)
20059 parm
= TREE_CHAIN (parm
);
20060 for (; parm
; parm
= TREE_CHAIN (parm
))
20061 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
20068 /* Subroutine of type_unification_real and unify_pack_expansion to
20069 handle unification of a single P/A pair. Parameters are as
20070 for those functions. */
20073 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
20074 int subr
, unification_kind_t strict
,
20077 tree arg_expr
= NULL_TREE
;
20080 if (arg
== error_mark_node
|| parm
== error_mark_node
)
20081 return unify_invalid (explain_p
);
20082 if (arg
== unknown_type_node
)
20083 /* We can't deduce anything from this, but we might get all the
20084 template args from other function args. */
20085 return unify_success (explain_p
);
20087 /* Implicit conversions (Clause 4) will be performed on a function
20088 argument to convert it to the type of the corresponding function
20089 parameter if the parameter type contains no template-parameters that
20090 participate in template argument deduction. */
20091 if (strict
!= DEDUCE_EXACT
20092 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
20093 /* For function parameters with no deducible template parameters,
20094 just return. We'll check non-dependent conversions later. */
20095 return unify_success (explain_p
);
20100 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
20101 | UNIFY_ALLOW_MORE_CV_QUAL
20102 | UNIFY_ALLOW_DERIVED
);
20106 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
20110 arg_strict
= UNIFY_ALLOW_NONE
;
20114 gcc_unreachable ();
20117 /* We only do these transformations if this is the top-level
20118 parameter_type_list in a call or declaration matching; in other
20119 situations (nested function declarators, template argument lists) we
20120 won't be comparing a type to an expression, and we don't do any type
20126 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
20127 if (type_unknown_p (arg
))
20129 /* [temp.deduct.type] A template-argument can be
20130 deduced from a pointer to function or pointer
20131 to member function argument if the set of
20132 overloaded functions does not contain function
20133 templates and at most one of a set of
20134 overloaded functions provides a unique
20136 resolve_overloaded_unification (tparms
, targs
, parm
,
20138 arg_strict
, explain_p
);
20139 /* If a unique match was not found, this is a
20140 non-deduced context, so we still succeed. */
20141 return unify_success (explain_p
);
20145 arg
= unlowered_expr_type (arg
);
20146 if (arg
== error_mark_node
)
20147 return unify_invalid (explain_p
);
20151 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
20154 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
20155 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
20156 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
20158 /* For deduction from an init-list we need the actual list. */
20159 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
20161 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
20164 /* for_each_template_parm callback that always returns 0. */
20167 zero_r (tree
, void *)
20172 /* for_each_template_parm any_fn callback to handle deduction of a template
20173 type argument from the type of an array bound. */
20176 array_deduction_r (tree t
, void *data
)
20178 tree_pair_p d
= (tree_pair_p
)data
;
20179 tree
&tparms
= d
->purpose
;
20180 tree
&targs
= d
->value
;
20182 if (TREE_CODE (t
) == ARRAY_TYPE
)
20183 if (tree dom
= TYPE_DOMAIN (t
))
20184 if (tree max
= TYPE_MAX_VALUE (dom
))
20186 if (TREE_CODE (max
) == MINUS_EXPR
)
20187 max
= TREE_OPERAND (max
, 0);
20188 if (TREE_CODE (max
) == TEMPLATE_PARM_INDEX
)
20189 unify (tparms
, targs
, TREE_TYPE (max
), size_type_node
,
20190 UNIFY_ALLOW_NONE
, /*explain*/false);
20193 /* Keep walking. */
20197 /* Try to deduce any not-yet-deduced template type arguments from the type of
20198 an array bound. This is handled separately from unify because 14.8.2.5 says
20199 "The type of a type parameter is only deduced from an array bound if it is
20200 not otherwise deduced." */
20203 try_array_deduction (tree tparms
, tree targs
, tree parm
)
20205 tree_pair_s data
= { tparms
, targs
};
20206 hash_set
<tree
> visited
;
20207 for_each_template_parm (parm
, zero_r
, &data
, &visited
,
20208 /*nondeduced*/false, array_deduction_r
);
20211 /* Most parms like fn_type_unification.
20213 If SUBR is 1, we're being called recursively (to unify the
20214 arguments of a function or method parameter of a function
20217 CHECKS is a pointer to a vector of access checks encountered while
20218 substituting default template arguments. */
20221 type_unification_real (tree tparms
,
20225 unsigned int xnargs
,
20227 unification_kind_t strict
,
20228 vec
<deferred_access_check
, va_gc
> **checks
,
20233 int ntparms
= TREE_VEC_LENGTH (tparms
);
20234 int saw_undeduced
= 0;
20237 unsigned int nargs
;
20240 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
20241 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
20242 gcc_assert (ntparms
> 0);
20244 tree targs
= INNERMOST_TEMPLATE_ARGS (full_targs
);
20246 /* Reset the number of non-defaulted template arguments contained
20248 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
20256 while (parms
&& parms
!= void_list_node
20259 parm
= TREE_VALUE (parms
);
20261 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
20262 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
20263 /* For a function parameter pack that occurs at the end of the
20264 parameter-declaration-list, the type A of each remaining
20265 argument of the call is compared with the type P of the
20266 declarator-id of the function parameter pack. */
20269 parms
= TREE_CHAIN (parms
);
20271 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
20272 /* For a function parameter pack that does not occur at the
20273 end of the parameter-declaration-list, the type of the
20274 parameter pack is a non-deduced context. */
20280 if (unify_one_argument (tparms
, full_targs
, parm
, arg
, subr
, strict
,
20286 && parms
!= void_list_node
20287 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
20289 /* Unify the remaining arguments with the pack expansion type. */
20291 tree parmvec
= make_tree_vec (1);
20293 /* Allocate a TREE_VEC and copy in all of the arguments */
20294 argvec
= make_tree_vec (nargs
- ia
);
20295 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
20296 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
20298 /* Copy the parameter into parmvec. */
20299 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
20300 if (unify_pack_expansion (tparms
, full_targs
, parmvec
, argvec
, strict
,
20301 /*subr=*/subr
, explain_p
))
20304 /* Advance to the end of the list of parameters. */
20305 parms
= TREE_CHAIN (parms
);
20308 /* Fail if we've reached the end of the parm list, and more args
20309 are present, and the parm list isn't variadic. */
20310 if (ia
< nargs
&& parms
== void_list_node
)
20311 return unify_too_many_arguments (explain_p
, nargs
, ia
);
20312 /* Fail if parms are left and they don't have default values and
20313 they aren't all deduced as empty packs (c++/57397). This is
20314 consistent with sufficient_parms_p. */
20315 if (parms
&& parms
!= void_list_node
20316 && TREE_PURPOSE (parms
) == NULL_TREE
)
20318 unsigned int count
= nargs
;
20323 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
20326 p
= TREE_CHAIN (p
);
20328 while (p
&& p
!= void_list_node
);
20329 if (count
!= nargs
)
20330 return unify_too_few_arguments (explain_p
, ia
, count
,
20336 tsubst_flags_t complain
= (explain_p
20337 ? tf_warning_or_error
20339 bool tried_array_deduction
= (cxx_dialect
< cxx17
);
20341 for (i
= 0; i
< ntparms
; i
++)
20343 tree targ
= TREE_VEC_ELT (targs
, i
);
20344 tree tparm
= TREE_VEC_ELT (tparms
, i
);
20346 /* Clear the "incomplete" flags on all argument packs now so that
20347 substituting them into later default arguments works. */
20348 if (targ
&& ARGUMENT_PACK_P (targ
))
20350 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
20351 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
20354 if (targ
|| tparm
== error_mark_node
)
20356 tparm
= TREE_VALUE (tparm
);
20358 if (TREE_CODE (tparm
) == TYPE_DECL
20359 && !tried_array_deduction
)
20361 try_array_deduction (tparms
, targs
, xparms
);
20362 tried_array_deduction
= true;
20363 if (TREE_VEC_ELT (targs
, i
))
20367 /* If this is an undeduced nontype parameter that depends on
20368 a type parameter, try another pass; its type may have been
20369 deduced from a later argument than the one from which
20370 this parameter can be deduced. */
20371 if (TREE_CODE (tparm
) == PARM_DECL
20372 && uses_template_parms (TREE_TYPE (tparm
))
20373 && saw_undeduced
< 2)
20379 /* Core issue #226 (C++0x) [temp.deduct]:
20381 If a template argument has not been deduced, its
20382 default template argument, if any, is used.
20384 When we are in C++98 mode, TREE_PURPOSE will either
20385 be NULL_TREE or ERROR_MARK_NODE, so we do not need
20386 to explicitly check cxx_dialect here. */
20387 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
20388 /* OK, there is a default argument. Wait until after the
20389 conversion check to do substitution. */
20392 /* If the type parameter is a parameter pack, then it will
20393 be deduced to an empty parameter pack. */
20394 if (template_parameter_pack_p (tparm
))
20398 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
20400 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
20401 TREE_CONSTANT (arg
) = 1;
20404 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
20406 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
20408 TREE_VEC_ELT (targs
, i
) = arg
;
20412 return unify_parameter_deduction_failure (explain_p
, tparm
);
20415 /* Now substitute into the default template arguments. */
20416 for (i
= 0; i
< ntparms
; i
++)
20418 tree targ
= TREE_VEC_ELT (targs
, i
);
20419 tree tparm
= TREE_VEC_ELT (tparms
, i
);
20421 if (targ
|| tparm
== error_mark_node
)
20423 tree parm
= TREE_VALUE (tparm
);
20424 tree arg
= TREE_PURPOSE (tparm
);
20425 reopen_deferring_access_checks (*checks
);
20426 location_t save_loc
= input_location
;
20428 input_location
= DECL_SOURCE_LOCATION (parm
);
20430 if (saw_undeduced
== 1
20431 && TREE_CODE (parm
) == PARM_DECL
20432 && uses_template_parms (TREE_TYPE (parm
)))
20434 /* The type of this non-type parameter depends on undeduced
20435 parameters. Don't try to use its default argument yet,
20436 since we might deduce an argument for it on the next pass,
20437 but do check whether the arguments we already have cause
20438 substitution failure, so that that happens before we try
20439 later default arguments (78489). */
20440 ++processing_template_decl
;
20441 tree type
= tsubst (TREE_TYPE (parm
), full_targs
, complain
,
20443 --processing_template_decl
;
20444 if (type
== error_mark_node
)
20445 arg
= error_mark_node
;
20451 tree substed
= NULL_TREE
;
20452 if (saw_undeduced
== 1 && processing_template_decl
== 0)
20454 /* First instatiate in template context, in case we still
20455 depend on undeduced template parameters. */
20456 ++processing_template_decl
;
20457 substed
= tsubst_template_arg (arg
, full_targs
, complain
,
20459 --processing_template_decl
;
20460 if (substed
!= error_mark_node
20461 && !uses_template_parms (substed
))
20462 /* We replaced all the tparms, substitute again out of
20463 template context. */
20464 substed
= NULL_TREE
;
20467 substed
= tsubst_template_arg (arg
, full_targs
, complain
,
20470 if (!uses_template_parms (substed
))
20471 arg
= convert_template_argument (parm
, substed
, full_targs
,
20472 complain
, i
, NULL_TREE
);
20473 else if (saw_undeduced
== 1)
20476 arg
= error_mark_node
;
20479 input_location
= save_loc
;
20480 *checks
= get_deferred_access_checks ();
20481 pop_deferring_access_checks ();
20483 if (arg
== error_mark_node
)
20487 TREE_VEC_ELT (targs
, i
) = arg
;
20488 /* The position of the first default template argument,
20489 is also the number of non-defaulted arguments in TARGS.
20491 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
20492 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
20496 if (saw_undeduced
++ == 1)
20500 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
20501 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
20503 return unify_success (explain_p
);
20506 /* Subroutine of type_unification_real. Args are like the variables
20507 at the call site. ARG is an overloaded function (or template-id);
20508 we try deducing template args from each of the overloads, and if
20509 only one succeeds, we go with that. Modifies TARGS and returns
20510 true on success. */
20513 resolve_overloaded_unification (tree tparms
,
20517 unification_kind_t strict
,
20521 tree tempargs
= copy_node (targs
);
20523 tree goodfn
= NULL_TREE
;
20526 if (TREE_CODE (arg
) == ADDR_EXPR
)
20528 arg
= TREE_OPERAND (arg
, 0);
20534 if (TREE_CODE (arg
) == COMPONENT_REF
)
20535 /* Handle `&x' where `x' is some static or non-static member
20537 arg
= TREE_OPERAND (arg
, 1);
20539 if (TREE_CODE (arg
) == OFFSET_REF
)
20540 arg
= TREE_OPERAND (arg
, 1);
20542 /* Strip baselink information. */
20543 if (BASELINK_P (arg
))
20544 arg
= BASELINK_FUNCTIONS (arg
);
20546 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
20548 /* If we got some explicit template args, we need to plug them into
20549 the affected templates before we try to unify, in case the
20550 explicit args will completely resolve the templates in question. */
20553 tree expl_subargs
= TREE_OPERAND (arg
, 1);
20554 arg
= TREE_OPERAND (arg
, 0);
20556 for (lkp_iterator
iter (arg
); iter
; ++iter
)
20559 tree subargs
, elem
;
20561 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
20564 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
20565 expl_subargs
, NULL_TREE
, tf_none
,
20566 /*require_all_args=*/true,
20567 /*use_default_args=*/true);
20568 if (subargs
!= error_mark_node
20569 && !any_dependent_template_arguments_p (subargs
))
20571 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
20572 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
20573 elem
, strict
, sub_strict
, addr_p
, explain_p
)
20574 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
20583 /* If no templates (or more than one) are fully resolved by the
20584 explicit arguments, this template-id is a non-deduced context; it
20585 could still be OK if we deduce all template arguments for the
20586 enclosing call through other arguments. */
20590 else if (TREE_CODE (arg
) != OVERLOAD
20591 && TREE_CODE (arg
) != FUNCTION_DECL
)
20592 /* If ARG is, for example, "(0, &f)" then its type will be unknown
20593 -- but the deduction does not succeed because the expression is
20594 not just the function on its own. */
20597 for (lkp_iterator
iter (arg
); iter
; ++iter
)
20600 if (try_one_overload (tparms
, targs
, tempargs
, parm
, TREE_TYPE (fn
),
20601 strict
, sub_strict
, addr_p
, explain_p
)
20602 && (!goodfn
|| !decls_match (goodfn
, fn
)))
20609 /* [temp.deduct.type] A template-argument can be deduced from a pointer
20610 to function or pointer to member function argument if the set of
20611 overloaded functions does not contain function templates and at most
20612 one of a set of overloaded functions provides a unique match.
20614 So if we found multiple possibilities, we return success but don't
20615 deduce anything. */
20619 int i
= TREE_VEC_LENGTH (targs
);
20621 if (TREE_VEC_ELT (tempargs
, i
))
20623 tree old
= TREE_VEC_ELT (targs
, i
);
20624 tree new_
= TREE_VEC_ELT (tempargs
, i
);
20625 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
20626 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
20627 /* Don't forget explicit template arguments in a pack. */
20628 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
20629 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
20630 TREE_VEC_ELT (targs
, i
) = new_
;
20639 /* Core DR 115: In contexts where deduction is done and fails, or in
20640 contexts where deduction is not done, if a template argument list is
20641 specified and it, along with any default template arguments, identifies
20642 a single function template specialization, then the template-id is an
20643 lvalue for the function template specialization. */
20646 resolve_nondeduced_context (tree orig_expr
, tsubst_flags_t complain
)
20648 tree expr
, offset
, baselink
;
20651 if (!type_unknown_p (orig_expr
))
20656 offset
= NULL_TREE
;
20657 baselink
= NULL_TREE
;
20659 if (TREE_CODE (expr
) == ADDR_EXPR
)
20661 expr
= TREE_OPERAND (expr
, 0);
20664 if (TREE_CODE (expr
) == OFFSET_REF
)
20667 expr
= TREE_OPERAND (expr
, 1);
20669 if (BASELINK_P (expr
))
20672 expr
= BASELINK_FUNCTIONS (expr
);
20675 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
20678 tree goodfn
= NULL_TREE
;
20680 /* If we got some explicit template args, we need to plug them into
20681 the affected templates before we try to unify, in case the
20682 explicit args will completely resolve the templates in question. */
20684 tree expl_subargs
= TREE_OPERAND (expr
, 1);
20685 tree arg
= TREE_OPERAND (expr
, 0);
20686 tree badfn
= NULL_TREE
;
20687 tree badargs
= NULL_TREE
;
20689 for (lkp_iterator
iter (arg
); iter
; ++iter
)
20692 tree subargs
, elem
;
20694 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
20697 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
20698 expl_subargs
, NULL_TREE
, tf_none
,
20699 /*require_all_args=*/true,
20700 /*use_default_args=*/true);
20701 if (subargs
!= error_mark_node
20702 && !any_dependent_template_arguments_p (subargs
))
20704 elem
= instantiate_template (fn
, subargs
, tf_none
);
20705 if (elem
== error_mark_node
)
20710 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
20719 mark_used (goodfn
);
20722 expr
= build_baselink (BASELINK_BINFO (baselink
),
20723 BASELINK_ACCESS_BINFO (baselink
),
20724 expr
, BASELINK_OPTYPE (baselink
));
20728 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
20729 expr
= build_offset_ref (base
, expr
, addr
, complain
);
20732 expr
= cp_build_addr_expr (expr
, complain
);
20735 else if (good
== 0 && badargs
&& (complain
& tf_error
))
20736 /* There were no good options and at least one bad one, so let the
20737 user know what the problem is. */
20738 instantiate_template (badfn
, badargs
, complain
);
20743 /* Subroutine of resolve_overloaded_unification; does deduction for a single
20744 overload. Fills TARGS with any deduced arguments, or error_mark_node if
20745 different overloads deduce different arguments for a given parm.
20746 ADDR_P is true if the expression for which deduction is being
20747 performed was of the form "& fn" rather than simply "fn".
20749 Returns 1 on success. */
20752 try_one_overload (tree tparms
,
20757 unification_kind_t strict
,
20766 if (arg
== error_mark_node
)
20769 /* [temp.deduct.type] A template-argument can be deduced from a pointer
20770 to function or pointer to member function argument if the set of
20771 overloaded functions does not contain function templates and at most
20772 one of a set of overloaded functions provides a unique match.
20774 So if this is a template, just return success. */
20776 if (uses_template_parms (arg
))
20779 if (TREE_CODE (arg
) == METHOD_TYPE
)
20780 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
20782 arg
= build_pointer_type (arg
);
20784 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
20786 /* We don't copy orig_targs for this because if we have already deduced
20787 some template args from previous args, unify would complain when we
20788 try to deduce a template parameter for the same argument, even though
20789 there isn't really a conflict. */
20790 nargs
= TREE_VEC_LENGTH (targs
);
20791 tempargs
= make_tree_vec (nargs
);
20793 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
20796 /* First make sure we didn't deduce anything that conflicts with
20797 explicitly specified args. */
20798 for (i
= nargs
; i
--; )
20800 tree elt
= TREE_VEC_ELT (tempargs
, i
);
20801 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
20805 else if (uses_template_parms (elt
))
20806 /* Since we're unifying against ourselves, we will fill in
20807 template args used in the function parm list with our own
20808 template parms. Discard them. */
20809 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
20810 else if (oldelt
&& ARGUMENT_PACK_P (oldelt
))
20812 /* Check that the argument at each index of the deduced argument pack
20813 is equivalent to the corresponding explicitly specified argument.
20814 We may have deduced more arguments than were explicitly specified,
20817 /* We used to assert ARGUMENT_PACK_INCOMPLETE_P (oldelt) here, but
20818 that's wrong if we deduce the same argument pack from multiple
20819 function arguments: it's only incomplete the first time. */
20821 tree explicit_pack
= ARGUMENT_PACK_ARGS (oldelt
);
20822 tree deduced_pack
= ARGUMENT_PACK_ARGS (elt
);
20824 if (TREE_VEC_LENGTH (deduced_pack
)
20825 < TREE_VEC_LENGTH (explicit_pack
))
20828 for (int j
= 0; j
< TREE_VEC_LENGTH (explicit_pack
); j
++)
20829 if (!template_args_equal (TREE_VEC_ELT (explicit_pack
, j
),
20830 TREE_VEC_ELT (deduced_pack
, j
)))
20833 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
20837 for (i
= nargs
; i
--; )
20839 tree elt
= TREE_VEC_ELT (tempargs
, i
);
20842 TREE_VEC_ELT (targs
, i
) = elt
;
20848 /* PARM is a template class (perhaps with unbound template
20849 parameters). ARG is a fully instantiated type. If ARG can be
20850 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
20851 TARGS are as for unify. */
20854 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
20857 tree copy_of_targs
;
20859 if (!CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
20861 else if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
20862 /* Matches anything. */;
20863 else if (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
20864 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
)))
20867 /* We need to make a new template argument vector for the call to
20868 unify. If we used TARGS, we'd clutter it up with the result of
20869 the attempted unification, even if this class didn't work out.
20870 We also don't want to commit ourselves to all the unifications
20871 we've already done, since unification is supposed to be done on
20872 an argument-by-argument basis. In other words, consider the
20873 following pathological case:
20875 template <int I, int J, int K>
20878 template <int I, int J>
20879 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
20881 template <int I, int J, int K>
20882 void f(S<I, J, K>, S<I, I, I>);
20891 Now, by the time we consider the unification involving `s2', we
20892 already know that we must have `f<0, 0, 0>'. But, even though
20893 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
20894 because there are two ways to unify base classes of S<0, 1, 2>
20895 with S<I, I, I>. If we kept the already deduced knowledge, we
20896 would reject the possibility I=1. */
20897 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
20899 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
20901 if (unify_bound_ttp_args (tparms
, copy_of_targs
, parm
, arg
, explain_p
))
20906 /* If unification failed, we're done. */
20907 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
20908 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
20914 /* Given a template type PARM and a class type ARG, find the unique
20915 base type in ARG that is an instance of PARM. We do not examine
20916 ARG itself; only its base-classes. If there is not exactly one
20917 appropriate base class, return NULL_TREE. PARM may be the type of
20918 a partial specialization, as well as a plain template type. Used
20921 static enum template_base_result
20922 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
20923 bool explain_p
, tree
*result
)
20925 tree rval
= NULL_TREE
;
20928 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
20930 binfo
= TYPE_BINFO (complete_type (arg
));
20933 /* The type could not be completed. */
20934 *result
= NULL_TREE
;
20935 return tbr_incomplete_type
;
20938 /* Walk in inheritance graph order. The search order is not
20939 important, and this avoids multiple walks of virtual bases. */
20940 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
20942 tree r
= try_class_unification (tparms
, targs
, parm
,
20943 BINFO_TYPE (binfo
), explain_p
);
20947 /* If there is more than one satisfactory baseclass, then:
20951 If they yield more than one possible deduced A, the type
20955 if (rval
&& !same_type_p (r
, rval
))
20957 *result
= NULL_TREE
;
20958 return tbr_ambiguous_baseclass
;
20966 return tbr_success
;
20969 /* Returns the level of DECL, which declares a template parameter. */
20972 template_decl_level (tree decl
)
20974 switch (TREE_CODE (decl
))
20977 case TEMPLATE_DECL
:
20978 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
20981 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
20984 gcc_unreachable ();
20989 /* Decide whether ARG can be unified with PARM, considering only the
20990 cv-qualifiers of each type, given STRICT as documented for unify.
20991 Returns nonzero iff the unification is OK on that basis. */
20994 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
20996 int arg_quals
= cp_type_quals (arg
);
20997 int parm_quals
= cp_type_quals (parm
);
20999 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
21000 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
21002 /* Although a CVR qualifier is ignored when being applied to a
21003 substituted template parameter ([8.3.2]/1 for example), that
21004 does not allow us to unify "const T" with "int&" because both
21005 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
21006 It is ok when we're allowing additional CV qualifiers
21007 at the outer level [14.8.2.1]/3,1st bullet. */
21008 if ((TYPE_REF_P (arg
)
21009 || TREE_CODE (arg
) == FUNCTION_TYPE
21010 || TREE_CODE (arg
) == METHOD_TYPE
)
21011 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
21014 if ((!INDIRECT_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
21015 && (parm_quals
& TYPE_QUAL_RESTRICT
))
21019 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
21020 && (arg_quals
& parm_quals
) != parm_quals
)
21023 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
21024 && (parm_quals
& arg_quals
) != arg_quals
)
21030 /* Determines the LEVEL and INDEX for the template parameter PARM. */
21032 template_parm_level_and_index (tree parm
, int* level
, int* index
)
21034 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
21035 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
21036 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
21038 *index
= TEMPLATE_TYPE_IDX (parm
);
21039 *level
= TEMPLATE_TYPE_LEVEL (parm
);
21043 *index
= TEMPLATE_PARM_IDX (parm
);
21044 *level
= TEMPLATE_PARM_LEVEL (parm
);
21048 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
21050 if (unify (TP, TA, P, A, S, EP)) \
21054 /* Unifies the remaining arguments in PACKED_ARGS with the pack
21055 expansion at the end of PACKED_PARMS. Returns 0 if the type
21056 deduction succeeds, 1 otherwise. STRICT is the same as in
21057 fn_type_unification. CALL_ARGS_P is true iff PACKED_ARGS is actually a
21058 function call argument list. We'll need to adjust the arguments to make them
21059 types. SUBR tells us if this is from a recursive call to
21060 type_unification_real, or for comparing two template argument
21064 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
21065 tree packed_args
, unification_kind_t strict
,
21066 bool subr
, bool explain_p
)
21069 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
21070 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
21071 tree pack
, packs
= NULL_TREE
;
21072 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
21074 /* Add in any args remembered from an earlier partial instantiation. */
21075 targs
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (parm
), targs
);
21076 int levels
= TMPL_ARGS_DEPTH (targs
);
21078 packed_args
= expand_template_argument_pack (packed_args
);
21080 int len
= TREE_VEC_LENGTH (packed_args
);
21082 /* Determine the parameter packs we will be deducing from the
21083 pattern, and record their current deductions. */
21084 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
21085 pack
; pack
= TREE_CHAIN (pack
))
21087 tree parm_pack
= TREE_VALUE (pack
);
21090 /* Only template parameter packs can be deduced, not e.g. function
21091 parameter packs or __bases or __integer_pack. */
21092 if (!TEMPLATE_PARM_P (parm_pack
))
21095 /* Determine the index and level of this parameter pack. */
21096 template_parm_level_and_index (parm_pack
, &level
, &idx
);
21097 if (level
< levels
)
21100 /* Keep track of the parameter packs and their corresponding
21102 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
21103 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
21106 /* Loop through all of the arguments that have not yet been
21107 unified and unify each with the pattern. */
21108 for (i
= start
; i
< len
; i
++)
21111 bool any_explicit
= false;
21112 tree arg
= TREE_VEC_ELT (packed_args
, i
);
21114 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
21115 or the element of its argument pack at the current index if
21116 this argument was explicitly specified. */
21117 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
21121 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
21124 if (TREE_VALUE (pack
)
21125 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
21126 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
21128 any_explicit
= true;
21129 arg
= TREE_VEC_ELT (pargs
, i
- start
);
21131 TMPL_ARG (targs
, level
, idx
) = arg
;
21134 /* If we had explicit template arguments, substitute them into the
21135 pattern before deduction. */
21138 /* Some arguments might still be unspecified or dependent. */
21140 ++processing_template_decl
;
21141 dependent
= any_dependent_template_arguments_p (targs
);
21143 --processing_template_decl
;
21144 parm
= tsubst (pattern
, targs
,
21145 explain_p
? tf_warning_or_error
: tf_none
,
21148 --processing_template_decl
;
21149 if (parm
== error_mark_node
)
21155 /* Unify the pattern with the current argument. */
21156 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
21160 /* For each parameter pack, collect the deduced value. */
21161 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
21164 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
21166 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
21167 TMPL_ARG (targs
, level
, idx
);
21171 /* Verify that the results of unification with the parameter packs
21172 produce results consistent with what we've seen before, and make
21173 the deduced argument packs available. */
21174 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
21176 tree old_pack
= TREE_VALUE (pack
);
21177 tree new_args
= TREE_TYPE (pack
);
21178 int i
, len
= TREE_VEC_LENGTH (new_args
);
21180 bool nondeduced_p
= false;
21182 /* By default keep the original deduced argument pack.
21183 If necessary, more specific code is going to update the
21184 resulting deduced argument later down in this function. */
21185 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
21186 TMPL_ARG (targs
, level
, idx
) = old_pack
;
21188 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
21189 actually deduce anything. */
21190 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
21191 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
21192 nondeduced_p
= true;
21196 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
21198 /* If we had fewer function args than explicit template args,
21199 just use the explicits. */
21200 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
21201 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
21202 if (len
< explicit_len
)
21203 new_args
= explicit_args
;
21209 /* Build the deduced *_ARGUMENT_PACK. */
21210 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
21212 result
= make_node (NONTYPE_ARGUMENT_PACK
);
21213 TREE_CONSTANT (result
) = 1;
21216 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
21218 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
21220 /* Note the deduced argument packs for this parameter
21222 TMPL_ARG (targs
, level
, idx
) = result
;
21224 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
21225 && (ARGUMENT_PACK_ARGS (old_pack
)
21226 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
21228 /* We only had the explicitly-provided arguments before, but
21229 now we have a complete set of arguments. */
21230 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
21232 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
21233 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
21234 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
21238 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
21239 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
21241 if (!comp_template_args (old_args
, new_args
,
21242 &bad_old_arg
, &bad_new_arg
))
21243 /* Inconsistent unification of this parameter pack. */
21244 return unify_parameter_pack_inconsistent (explain_p
,
21250 return unify_success (explain_p
);
21253 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
21254 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
21255 parameters and return value are as for unify. */
21258 unify_array_domain (tree tparms
, tree targs
,
21259 tree parm_dom
, tree arg_dom
,
21267 /* Our representation of array types uses "N - 1" as the
21268 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
21269 not an integer constant. We cannot unify arbitrarily
21270 complex expressions, so we eliminate the MINUS_EXPRs
21272 parm_max
= TYPE_MAX_VALUE (parm_dom
);
21273 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
21276 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
21277 parm_max
= TREE_OPERAND (parm_max
, 0);
21279 arg_max
= TYPE_MAX_VALUE (arg_dom
);
21280 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
21283 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
21284 trying to unify the type of a variable with the type
21285 of a template parameter. For example:
21287 template <unsigned int N>
21288 void f (char (&) [N]);
21295 Here, the type of the ARG will be "int [g(i)]", and
21296 may be a SAVE_EXPR, etc. */
21297 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
21298 return unify_vla_arg (explain_p
, arg_dom
);
21299 arg_max
= TREE_OPERAND (arg_max
, 0);
21302 /* If only one of the bounds used a MINUS_EXPR, compensate
21303 by adding one to the other bound. */
21304 if (parm_cst
&& !arg_cst
)
21305 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
21309 else if (arg_cst
&& !parm_cst
)
21310 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
21315 return unify (tparms
, targs
, parm_max
, arg_max
,
21316 UNIFY_ALLOW_INTEGER
, explain_p
);
21319 /* Returns whether T, a P or A in unify, is a type, template or expression. */
21321 enum pa_kind_t
{ pa_type
, pa_tmpl
, pa_expr
};
21326 if (PACK_EXPANSION_P (t
))
21327 t
= PACK_EXPANSION_PATTERN (t
);
21328 if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
21329 || TREE_CODE (t
) == UNBOUND_CLASS_TEMPLATE
21330 || DECL_TYPE_TEMPLATE_P (t
))
21332 else if (TYPE_P (t
))
21338 /* Deduce the value of template parameters. TPARMS is the (innermost)
21339 set of template parameters to a template. TARGS is the bindings
21340 for those template parameters, as determined thus far; TARGS may
21341 include template arguments for outer levels of template parameters
21342 as well. PARM is a parameter to a template function, or a
21343 subcomponent of that parameter; ARG is the corresponding argument.
21344 This function attempts to match PARM with ARG in a manner
21345 consistent with the existing assignments in TARGS. If more values
21346 are deduced, then TARGS is updated.
21348 Returns 0 if the type deduction succeeds, 1 otherwise. The
21349 parameter STRICT is a bitwise or of the following flags:
21352 Require an exact match between PARM and ARG.
21353 UNIFY_ALLOW_MORE_CV_QUAL:
21354 Allow the deduced ARG to be more cv-qualified (by qualification
21355 conversion) than ARG.
21356 UNIFY_ALLOW_LESS_CV_QUAL:
21357 Allow the deduced ARG to be less cv-qualified than ARG.
21358 UNIFY_ALLOW_DERIVED:
21359 Allow the deduced ARG to be a template base class of ARG,
21360 or a pointer to a template base class of the type pointed to by
21362 UNIFY_ALLOW_INTEGER:
21363 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
21364 case for more information.
21365 UNIFY_ALLOW_OUTER_LEVEL:
21366 This is the outermost level of a deduction. Used to determine validity
21367 of qualification conversions. A valid qualification conversion must
21368 have const qualified pointers leading up to the inner type which
21369 requires additional CV quals, except at the outer level, where const
21370 is not required [conv.qual]. It would be normal to set this flag in
21371 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
21372 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
21373 This is the outermost level of a deduction, and PARM can be more CV
21374 qualified at this point.
21375 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
21376 This is the outermost level of a deduction, and PARM can be less CV
21377 qualified at this point. */
21380 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
21386 int strict_in
= strict
;
21387 tsubst_flags_t complain
= (explain_p
21388 ? tf_warning_or_error
21391 /* I don't think this will do the right thing with respect to types.
21392 But the only case I've seen it in so far has been array bounds, where
21393 signedness is the only information lost, and I think that will be
21395 while (CONVERT_EXPR_P (parm
))
21396 parm
= TREE_OPERAND (parm
, 0);
21398 if (arg
== error_mark_node
)
21399 return unify_invalid (explain_p
);
21400 if (arg
== unknown_type_node
21401 || arg
== init_list_type_node
)
21402 /* We can't deduce anything from this, but we might get all the
21403 template args from other function args. */
21404 return unify_success (explain_p
);
21406 if (parm
== any_targ_node
|| arg
== any_targ_node
)
21407 return unify_success (explain_p
);
21409 /* If PARM uses template parameters, then we can't bail out here,
21410 even if ARG == PARM, since we won't record unifications for the
21411 template parameters. We might need them if we're trying to
21412 figure out which of two things is more specialized. */
21413 if (arg
== parm
&& !uses_template_parms (parm
))
21414 return unify_success (explain_p
);
21416 /* Handle init lists early, so the rest of the function can assume
21417 we're dealing with a type. */
21418 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
21422 tree orig_parm
= parm
;
21424 /* Replace T with std::initializer_list<T> for deduction. */
21425 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
21426 && flag_deduce_init_list
)
21427 parm
= listify (parm
);
21429 if (!is_std_init_list (parm
)
21430 && TREE_CODE (parm
) != ARRAY_TYPE
)
21431 /* We can only deduce from an initializer list argument if the
21432 parameter is std::initializer_list or an array; otherwise this
21433 is a non-deduced context. */
21434 return unify_success (explain_p
);
21436 if (TREE_CODE (parm
) == ARRAY_TYPE
)
21437 elttype
= TREE_TYPE (parm
);
21440 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
21441 /* Deduction is defined in terms of a single type, so just punt
21442 on the (bizarre) std::initializer_list<T...>. */
21443 if (PACK_EXPANSION_P (elttype
))
21444 return unify_success (explain_p
);
21447 if (strict
!= DEDUCE_EXACT
21448 && TYPE_P (elttype
)
21449 && !uses_deducible_template_parms (elttype
))
21450 /* If ELTTYPE has no deducible template parms, skip deduction from
21451 the list elements. */;
21453 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
21455 int elt_strict
= strict
;
21457 if (elt
== error_mark_node
)
21458 return unify_invalid (explain_p
);
21460 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
21462 tree type
= TREE_TYPE (elt
);
21463 if (type
== error_mark_node
)
21464 return unify_invalid (explain_p
);
21465 /* It should only be possible to get here for a call. */
21466 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
21467 elt_strict
|= maybe_adjust_types_for_deduction
21468 (DEDUCE_CALL
, &elttype
, &type
, elt
);
21472 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
21476 if (TREE_CODE (parm
) == ARRAY_TYPE
21477 && deducible_array_bound (TYPE_DOMAIN (parm
)))
21479 /* Also deduce from the length of the initializer list. */
21480 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
21481 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
21482 if (idx
== error_mark_node
)
21483 return unify_invalid (explain_p
);
21484 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
21488 /* If the std::initializer_list<T> deduction worked, replace the
21489 deduced A with std::initializer_list<A>. */
21490 if (orig_parm
!= parm
)
21492 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
21493 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
21494 targ
= listify (targ
);
21495 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
21497 return unify_success (explain_p
);
21500 /* If parm and arg aren't the same kind of thing (template, type, or
21501 expression), fail early. */
21502 if (pa_kind (parm
) != pa_kind (arg
))
21503 return unify_invalid (explain_p
);
21505 /* Immediately reject some pairs that won't unify because of
21506 cv-qualification mismatches. */
21507 if (TREE_CODE (arg
) == TREE_CODE (parm
)
21509 /* It is the elements of the array which hold the cv quals of an array
21510 type, and the elements might be template type parms. We'll check
21511 when we recurse. */
21512 && TREE_CODE (arg
) != ARRAY_TYPE
21513 /* We check the cv-qualifiers when unifying with template type
21514 parameters below. We want to allow ARG `const T' to unify with
21515 PARM `T' for example, when computing which of two templates
21516 is more specialized, for example. */
21517 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
21518 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
21519 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
21521 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
21522 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
21523 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
21524 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
21525 strict
&= ~UNIFY_ALLOW_DERIVED
;
21526 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
21527 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
21529 switch (TREE_CODE (parm
))
21531 case TYPENAME_TYPE
:
21533 case UNBOUND_CLASS_TEMPLATE
:
21534 /* In a type which contains a nested-name-specifier, template
21535 argument values cannot be deduced for template parameters used
21536 within the nested-name-specifier. */
21537 return unify_success (explain_p
);
21539 case TEMPLATE_TYPE_PARM
:
21540 case TEMPLATE_TEMPLATE_PARM
:
21541 case BOUND_TEMPLATE_TEMPLATE_PARM
:
21542 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
21543 if (error_operand_p (tparm
))
21544 return unify_invalid (explain_p
);
21546 if (TEMPLATE_TYPE_LEVEL (parm
)
21547 != template_decl_level (tparm
))
21548 /* The PARM is not one we're trying to unify. Just check
21549 to see if it matches ARG. */
21551 if (TREE_CODE (arg
) == TREE_CODE (parm
)
21552 && (is_auto (parm
) ? is_auto (arg
)
21553 : same_type_p (parm
, arg
)))
21554 return unify_success (explain_p
);
21556 return unify_type_mismatch (explain_p
, parm
, arg
);
21558 idx
= TEMPLATE_TYPE_IDX (parm
);
21559 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
21560 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
21561 if (error_operand_p (tparm
))
21562 return unify_invalid (explain_p
);
21564 /* Check for mixed types and values. */
21565 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
21566 && TREE_CODE (tparm
) != TYPE_DECL
)
21567 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
21568 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
21569 gcc_unreachable ();
21571 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
21573 if ((strict_in
& UNIFY_ALLOW_DERIVED
)
21574 && CLASS_TYPE_P (arg
))
21576 /* First try to match ARG directly. */
21577 tree t
= try_class_unification (tparms
, targs
, parm
, arg
,
21581 /* Otherwise, look for a suitable base of ARG, as below. */
21582 enum template_base_result r
;
21583 r
= get_template_base (tparms
, targs
, parm
, arg
,
21586 return unify_no_common_base (explain_p
, r
, parm
, arg
);
21590 /* ARG must be constructed from a template class or a template
21591 template parameter. */
21592 else if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
21593 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
21594 return unify_template_deduction_failure (explain_p
, parm
, arg
);
21596 /* Deduce arguments T, i from TT<T> or TT<i>. */
21597 if (unify_bound_ttp_args (tparms
, targs
, parm
, arg
, explain_p
))
21600 arg
= TYPE_TI_TEMPLATE (arg
);
21602 /* Fall through to deduce template name. */
21605 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
21606 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
21608 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
21610 /* Simple cases: Value already set, does match or doesn't. */
21611 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
21612 return unify_success (explain_p
);
21614 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
21618 /* If PARM is `const T' and ARG is only `int', we don't have
21619 a match unless we are allowing additional qualification.
21620 If ARG is `const int' and PARM is just `T' that's OK;
21621 that binds `const int' to `T'. */
21622 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
21624 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
21626 /* Consider the case where ARG is `const volatile int' and
21627 PARM is `const T'. Then, T should be `volatile int'. */
21628 arg
= cp_build_qualified_type_real
21629 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
21630 if (arg
== error_mark_node
)
21631 return unify_invalid (explain_p
);
21633 /* Simple cases: Value already set, does match or doesn't. */
21634 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
21635 return unify_success (explain_p
);
21637 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
21639 /* Make sure that ARG is not a variable-sized array. (Note
21640 that were talking about variable-sized arrays (like
21641 `int[n]'), rather than arrays of unknown size (like
21642 `int[]').) We'll get very confused by such a type since
21643 the bound of the array is not constant, and therefore
21644 not mangleable. Besides, such types are not allowed in
21645 ISO C++, so we can do as we please here. We do allow
21646 them for 'auto' deduction, since that isn't ABI-exposed. */
21647 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
21648 return unify_vla_arg (explain_p
, arg
);
21650 /* Strip typedefs as in convert_template_argument. */
21651 arg
= canonicalize_type_argument (arg
, tf_none
);
21654 /* If ARG is a parameter pack or an expansion, we cannot unify
21655 against it unless PARM is also a parameter pack. */
21656 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
21657 && !template_parameter_pack_p (parm
))
21658 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
21660 /* If the argument deduction results is a METHOD_TYPE,
21661 then there is a problem.
21662 METHOD_TYPE doesn't map to any real C++ type the result of
21663 the deduction can not be of that type. */
21664 if (TREE_CODE (arg
) == METHOD_TYPE
)
21665 return unify_method_type_error (explain_p
, arg
);
21667 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
21668 return unify_success (explain_p
);
21670 case TEMPLATE_PARM_INDEX
:
21671 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
21672 if (error_operand_p (tparm
))
21673 return unify_invalid (explain_p
);
21675 if (TEMPLATE_PARM_LEVEL (parm
)
21676 != template_decl_level (tparm
))
21678 /* The PARM is not one we're trying to unify. Just check
21679 to see if it matches ARG. */
21680 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
21681 && cp_tree_equal (parm
, arg
));
21683 unify_expression_unequal (explain_p
, parm
, arg
);
21687 idx
= TEMPLATE_PARM_IDX (parm
);
21688 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
21692 if ((strict
& UNIFY_ALLOW_INTEGER
)
21693 && TREE_TYPE (targ
) && TREE_TYPE (arg
)
21694 && CP_INTEGRAL_TYPE_P (TREE_TYPE (targ
)))
21695 /* We're deducing from an array bound, the type doesn't matter. */
21696 arg
= fold_convert (TREE_TYPE (targ
), arg
);
21697 int x
= !cp_tree_equal (targ
, arg
);
21699 unify_inconsistency (explain_p
, parm
, targ
, arg
);
21703 /* [temp.deduct.type] If, in the declaration of a function template
21704 with a non-type template-parameter, the non-type
21705 template-parameter is used in an expression in the function
21706 parameter-list and, if the corresponding template-argument is
21707 deduced, the template-argument type shall match the type of the
21708 template-parameter exactly, except that a template-argument
21709 deduced from an array bound may be of any integral type.
21710 The non-type parameter might use already deduced type parameters. */
21711 tparm
= TREE_TYPE (parm
);
21712 if (TEMPLATE_PARM_LEVEL (parm
) > TMPL_ARGS_DEPTH (targs
))
21713 /* We don't have enough levels of args to do any substitution. This
21714 can happen in the context of -fnew-ttp-matching. */;
21717 ++processing_template_decl
;
21718 tparm
= tsubst (tparm
, targs
, tf_none
, NULL_TREE
);
21719 --processing_template_decl
;
21721 if (tree a
= type_uses_auto (tparm
))
21723 tparm
= do_auto_deduction (tparm
, arg
, a
, complain
, adc_unify
);
21724 if (tparm
== error_mark_node
)
21729 if (!TREE_TYPE (arg
))
21730 /* Template-parameter dependent expression. Just accept it for now.
21731 It will later be processed in convert_template_argument. */
21733 else if (same_type_p (non_reference (TREE_TYPE (arg
)),
21734 non_reference (tparm
)))
21736 else if ((strict
& UNIFY_ALLOW_INTEGER
)
21737 && CP_INTEGRAL_TYPE_P (tparm
))
21738 /* Convert the ARG to the type of PARM; the deduced non-type
21739 template argument must exactly match the types of the
21740 corresponding parameter. */
21741 arg
= fold (build_nop (tparm
, arg
));
21742 else if (uses_template_parms (tparm
))
21744 /* We haven't deduced the type of this parameter yet. */
21745 if (cxx_dialect
>= cxx17
21746 /* We deduce from array bounds in try_array_deduction. */
21747 && !(strict
& UNIFY_ALLOW_INTEGER
))
21749 /* Deduce it from the non-type argument. */
21750 tree atype
= TREE_TYPE (arg
);
21751 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
21753 UNIFY_ALLOW_NONE
, explain_p
);
21756 /* Try again later. */
21757 return unify_success (explain_p
);
21760 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
21762 /* If ARG is a parameter pack or an expansion, we cannot unify
21763 against it unless PARM is also a parameter pack. */
21764 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
21765 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
21766 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
21769 bool removed_attr
= false;
21770 arg
= strip_typedefs_expr (arg
, &removed_attr
);
21772 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
21773 return unify_success (explain_p
);
21777 /* A pointer-to-member constant can be unified only with
21778 another constant. */
21779 if (TREE_CODE (arg
) != PTRMEM_CST
)
21780 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
21782 /* Just unify the class member. It would be useless (and possibly
21783 wrong, depending on the strict flags) to unify also
21784 PTRMEM_CST_CLASS, because we want to be sure that both parm and
21785 arg refer to the same variable, even if through different
21786 classes. For instance:
21788 struct A { int x; };
21791 Unification of &A::x and &B::x must succeed. */
21792 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
21793 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
21798 if (!TYPE_PTR_P (arg
))
21799 return unify_type_mismatch (explain_p
, parm
, arg
);
21801 /* [temp.deduct.call]
21803 A can be another pointer or pointer to member type that can
21804 be converted to the deduced A via a qualification
21805 conversion (_conv.qual_).
21807 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
21808 This will allow for additional cv-qualification of the
21809 pointed-to types if appropriate. */
21811 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
21812 /* The derived-to-base conversion only persists through one
21813 level of pointers. */
21814 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
21816 return unify (tparms
, targs
, TREE_TYPE (parm
),
21817 TREE_TYPE (arg
), strict
, explain_p
);
21820 case REFERENCE_TYPE
:
21821 if (!TYPE_REF_P (arg
))
21822 return unify_type_mismatch (explain_p
, parm
, arg
);
21823 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
21824 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
21827 if (TREE_CODE (arg
) != ARRAY_TYPE
)
21828 return unify_type_mismatch (explain_p
, parm
, arg
);
21829 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
21830 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
21831 return unify_type_mismatch (explain_p
, parm
, arg
);
21832 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
21833 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
21834 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
21835 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
21836 TYPE_DOMAIN (arg
), explain_p
);
21837 return unify_success (explain_p
);
21844 case ENUMERAL_TYPE
:
21847 if (TREE_CODE (arg
) != TREE_CODE (parm
))
21848 return unify_type_mismatch (explain_p
, parm
, arg
);
21850 /* We have already checked cv-qualification at the top of the
21852 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
21853 return unify_type_mismatch (explain_p
, parm
, arg
);
21855 /* As far as unification is concerned, this wins. Later checks
21856 will invalidate it if necessary. */
21857 return unify_success (explain_p
);
21859 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
21860 /* Type INTEGER_CST can come from ordinary constant template args. */
21862 while (CONVERT_EXPR_P (arg
))
21863 arg
= TREE_OPERAND (arg
, 0);
21865 if (TREE_CODE (arg
) != INTEGER_CST
)
21866 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
21867 return (tree_int_cst_equal (parm
, arg
)
21868 ? unify_success (explain_p
)
21869 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
21873 int i
, len
, argslen
;
21874 int parm_variadic_p
= 0;
21876 if (TREE_CODE (arg
) != TREE_VEC
)
21877 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
21879 len
= TREE_VEC_LENGTH (parm
);
21880 argslen
= TREE_VEC_LENGTH (arg
);
21882 /* Check for pack expansions in the parameters. */
21883 for (i
= 0; i
< len
; ++i
)
21885 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
21888 /* We can unify against something with a trailing
21890 parm_variadic_p
= 1;
21892 /* [temp.deduct.type]/9: If the template argument list of
21893 P contains a pack expansion that is not the last
21894 template argument, the entire template argument list
21895 is a non-deduced context. */
21896 return unify_success (explain_p
);
21900 /* If we don't have enough arguments to satisfy the parameters
21901 (not counting the pack expression at the end), or we have
21902 too many arguments for a parameter list that doesn't end in
21903 a pack expression, we can't unify. */
21904 if (parm_variadic_p
21905 ? argslen
< len
- parm_variadic_p
21907 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
21909 /* Unify all of the parameters that precede the (optional)
21910 pack expression. */
21911 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
21913 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
21914 TREE_VEC_ELT (parm
, i
),
21915 TREE_VEC_ELT (arg
, i
),
21916 UNIFY_ALLOW_NONE
, explain_p
);
21918 if (parm_variadic_p
)
21919 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
21921 /*subr=*/true, explain_p
);
21922 return unify_success (explain_p
);
21927 if (TREE_CODE (arg
) != TREE_CODE (parm
))
21928 return unify_type_mismatch (explain_p
, parm
, arg
);
21930 if (TYPE_PTRMEMFUNC_P (parm
))
21932 if (!TYPE_PTRMEMFUNC_P (arg
))
21933 return unify_type_mismatch (explain_p
, parm
, arg
);
21935 return unify (tparms
, targs
,
21936 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
21937 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
21938 strict
, explain_p
);
21940 else if (TYPE_PTRMEMFUNC_P (arg
))
21941 return unify_type_mismatch (explain_p
, parm
, arg
);
21943 if (CLASSTYPE_TEMPLATE_INFO (parm
))
21945 tree t
= NULL_TREE
;
21947 if (strict_in
& UNIFY_ALLOW_DERIVED
)
21949 /* First, we try to unify the PARM and ARG directly. */
21950 t
= try_class_unification (tparms
, targs
,
21951 parm
, arg
, explain_p
);
21955 /* Fallback to the special case allowed in
21956 [temp.deduct.call]:
21958 If P is a class, and P has the form
21959 template-id, then A can be a derived class of
21960 the deduced A. Likewise, if P is a pointer to
21961 a class of the form template-id, A can be a
21962 pointer to a derived class pointed to by the
21964 enum template_base_result r
;
21965 r
= get_template_base (tparms
, targs
, parm
, arg
,
21970 /* Don't give the derived diagnostic if we're
21971 already dealing with the same template. */
21973 = (CLASSTYPE_TEMPLATE_INFO (arg
)
21974 && (CLASSTYPE_TI_TEMPLATE (parm
)
21975 == CLASSTYPE_TI_TEMPLATE (arg
)));
21976 return unify_no_common_base (explain_p
&& !same_template
,
21981 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
21982 && (CLASSTYPE_TI_TEMPLATE (parm
)
21983 == CLASSTYPE_TI_TEMPLATE (arg
)))
21984 /* Perhaps PARM is something like S<U> and ARG is S<int>.
21985 Then, we should unify `int' and `U'. */
21988 /* There's no chance of unification succeeding. */
21989 return unify_type_mismatch (explain_p
, parm
, arg
);
21991 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
21992 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
21994 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
21995 return unify_type_mismatch (explain_p
, parm
, arg
);
21996 return unify_success (explain_p
);
21999 case FUNCTION_TYPE
:
22001 unsigned int nargs
;
22006 if (TREE_CODE (arg
) != TREE_CODE (parm
))
22007 return unify_type_mismatch (explain_p
, parm
, arg
);
22009 /* CV qualifications for methods can never be deduced, they must
22010 match exactly. We need to check them explicitly here,
22011 because type_unification_real treats them as any other
22012 cv-qualified parameter. */
22013 if (TREE_CODE (parm
) == METHOD_TYPE
22014 && (!check_cv_quals_for_unify
22016 class_of_this_parm (arg
),
22017 class_of_this_parm (parm
))))
22018 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
22019 if (TREE_CODE (arg
) == FUNCTION_TYPE
22020 && type_memfn_quals (parm
) != type_memfn_quals (arg
))
22021 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
22022 if (type_memfn_rqual (parm
) != type_memfn_rqual (arg
))
22023 return unify_type_mismatch (explain_p
, parm
, arg
);
22025 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
22026 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
22028 nargs
= list_length (TYPE_ARG_TYPES (arg
));
22029 args
= XALLOCAVEC (tree
, nargs
);
22030 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
22031 a
!= NULL_TREE
&& a
!= void_list_node
;
22032 a
= TREE_CHAIN (a
), ++i
)
22033 args
[i
] = TREE_VALUE (a
);
22036 if (type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
22037 args
, nargs
, 1, DEDUCE_EXACT
,
22041 if (flag_noexcept_type
)
22043 tree pspec
= TYPE_RAISES_EXCEPTIONS (parm
);
22044 tree aspec
= canonical_eh_spec (TYPE_RAISES_EXCEPTIONS (arg
));
22045 if (pspec
== NULL_TREE
) pspec
= noexcept_false_spec
;
22046 if (aspec
== NULL_TREE
) aspec
= noexcept_false_spec
;
22047 if (TREE_PURPOSE (pspec
) && TREE_PURPOSE (aspec
)
22048 && uses_template_parms (TREE_PURPOSE (pspec
)))
22049 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_PURPOSE (pspec
),
22050 TREE_PURPOSE (aspec
),
22051 UNIFY_ALLOW_NONE
, explain_p
);
22052 else if (nothrow_spec_p (pspec
) && !nothrow_spec_p (aspec
))
22053 return unify_type_mismatch (explain_p
, parm
, arg
);
22060 /* Unify a pointer to member with a pointer to member function, which
22061 deduces the type of the member as a function type. */
22062 if (TYPE_PTRMEMFUNC_P (arg
))
22064 /* Check top-level cv qualifiers */
22065 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
22066 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
22068 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
22069 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
22070 UNIFY_ALLOW_NONE
, explain_p
);
22072 /* Determine the type of the function we are unifying against. */
22073 tree fntype
= static_fn_type (arg
);
22075 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
22078 if (TREE_CODE (arg
) != OFFSET_TYPE
)
22079 return unify_type_mismatch (explain_p
, parm
, arg
);
22080 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
22081 TYPE_OFFSET_BASETYPE (arg
),
22082 UNIFY_ALLOW_NONE
, explain_p
);
22083 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
22084 strict
, explain_p
);
22087 if (DECL_TEMPLATE_PARM_P (parm
))
22088 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
22089 if (arg
!= scalar_constant_value (parm
))
22090 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
22091 return unify_success (explain_p
);
22094 case TEMPLATE_DECL
:
22095 /* Matched cases are handled by the ARG == PARM test above. */
22096 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
22099 /* We might get a variable as a non-type template argument in parm if the
22100 corresponding parameter is type-dependent. Make any necessary
22101 adjustments based on whether arg is a reference. */
22102 if (CONSTANT_CLASS_P (arg
))
22103 parm
= fold_non_dependent_expr (parm
, complain
);
22104 else if (REFERENCE_REF_P (arg
))
22106 tree sub
= TREE_OPERAND (arg
, 0);
22108 if (TREE_CODE (sub
) == ADDR_EXPR
)
22109 arg
= TREE_OPERAND (sub
, 0);
22111 /* Now use the normal expression code to check whether they match. */
22114 case TYPE_ARGUMENT_PACK
:
22115 case NONTYPE_ARGUMENT_PACK
:
22116 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
22117 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
22120 case DECLTYPE_TYPE
:
22121 case UNDERLYING_TYPE
:
22122 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
22123 or UNDERLYING_TYPE nodes. */
22124 return unify_success (explain_p
);
22127 /* Unification fails if we hit an error node. */
22128 return unify_invalid (explain_p
);
22131 if (REFERENCE_REF_P (parm
))
22133 bool pexp
= PACK_EXPANSION_P (arg
);
22135 arg
= PACK_EXPANSION_PATTERN (arg
);
22136 if (REFERENCE_REF_P (arg
))
22137 arg
= TREE_OPERAND (arg
, 0);
22139 arg
= make_pack_expansion (arg
, complain
);
22140 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
22141 strict
, explain_p
);
22146 /* An unresolved overload is a nondeduced context. */
22147 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
22148 return unify_success (explain_p
);
22149 gcc_assert (EXPR_P (parm
) || TREE_CODE (parm
) == TRAIT_EXPR
);
22151 /* We must be looking at an expression. This can happen with
22155 void foo(S<I>, S<I + 2>);
22157 This is a "nondeduced context":
22161 The nondeduced contexts are:
22163 --A type that is a template-id in which one or more of
22164 the template-arguments is an expression that references
22165 a template-parameter.
22167 In these cases, we assume deduction succeeded, but don't
22168 actually infer any unifications. */
22170 if (!uses_template_parms (parm
)
22171 && !template_args_equal (parm
, arg
))
22172 return unify_expression_unequal (explain_p
, parm
, arg
);
22174 return unify_success (explain_p
);
22177 #undef RECUR_AND_CHECK_FAILURE
22179 /* Note that DECL can be defined in this translation unit, if
22183 mark_definable (tree decl
)
22186 DECL_NOT_REALLY_EXTERN (decl
) = 1;
22187 FOR_EACH_CLONE (clone
, decl
)
22188 DECL_NOT_REALLY_EXTERN (clone
) = 1;
22191 /* Called if RESULT is explicitly instantiated, or is a member of an
22192 explicitly instantiated class. */
22195 mark_decl_instantiated (tree result
, int extern_p
)
22197 SET_DECL_EXPLICIT_INSTANTIATION (result
);
22199 /* If this entity has already been written out, it's too late to
22200 make any modifications. */
22201 if (TREE_ASM_WRITTEN (result
))
22204 /* For anonymous namespace we don't need to do anything. */
22205 if (decl_anon_ns_mem_p (result
))
22207 gcc_assert (!TREE_PUBLIC (result
));
22211 if (TREE_CODE (result
) != FUNCTION_DECL
)
22212 /* The TREE_PUBLIC flag for function declarations will have been
22213 set correctly by tsubst. */
22214 TREE_PUBLIC (result
) = 1;
22216 /* This might have been set by an earlier implicit instantiation. */
22217 DECL_COMDAT (result
) = 0;
22220 DECL_NOT_REALLY_EXTERN (result
) = 0;
22223 mark_definable (result
);
22224 mark_needed (result
);
22225 /* Always make artificials weak. */
22226 if (DECL_ARTIFICIAL (result
) && flag_weak
)
22227 comdat_linkage (result
);
22228 /* For WIN32 we also want to put explicit instantiations in
22229 linkonce sections. */
22230 else if (TREE_PUBLIC (result
))
22231 maybe_make_one_only (result
);
22232 if (TREE_CODE (result
) == FUNCTION_DECL
22233 && DECL_TEMPLATE_INSTANTIATED (result
))
22234 /* If the function has already been instantiated, clear DECL_EXTERNAL,
22235 since start_preparsed_function wouldn't have if we had an earlier
22236 extern explicit instantiation. */
22237 DECL_EXTERNAL (result
) = 0;
22240 /* If EXTERN_P, then this function will not be emitted -- unless
22241 followed by an explicit instantiation, at which point its linkage
22242 will be adjusted. If !EXTERN_P, then this function will be
22243 emitted here. In neither circumstance do we want
22244 import_export_decl to adjust the linkage. */
22245 DECL_INTERFACE_KNOWN (result
) = 1;
22248 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
22249 important template arguments. If any are missing, we check whether
22250 they're important by using error_mark_node for substituting into any
22251 args that were used for partial ordering (the ones between ARGS and END)
22252 and seeing if it bubbles up. */
22255 check_undeduced_parms (tree targs
, tree args
, tree end
)
22257 bool found
= false;
22259 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
22260 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
22263 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
22267 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
22268 if (substed
== error_mark_node
)
22274 /* Given two function templates PAT1 and PAT2, return:
22276 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
22277 -1 if PAT2 is more specialized than PAT1.
22278 0 if neither is more specialized.
22280 LEN indicates the number of parameters we should consider
22281 (defaulted parameters should not be considered).
22283 The 1998 std underspecified function template partial ordering, and
22284 DR214 addresses the issue. We take pairs of arguments, one from
22285 each of the templates, and deduce them against each other. One of
22286 the templates will be more specialized if all the *other*
22287 template's arguments deduce against its arguments and at least one
22288 of its arguments *does* *not* deduce against the other template's
22289 corresponding argument. Deduction is done as for class templates.
22290 The arguments used in deduction have reference and top level cv
22291 qualifiers removed. Iff both arguments were originally reference
22292 types *and* deduction succeeds in both directions, an lvalue reference
22293 wins against an rvalue reference and otherwise the template
22294 with the more cv-qualified argument wins for that pairing (if
22295 neither is more cv-qualified, they both are equal). Unlike regular
22296 deduction, after all the arguments have been deduced in this way,
22297 we do *not* verify the deduced template argument values can be
22298 substituted into non-deduced contexts.
22300 The logic can be a bit confusing here, because we look at deduce1 and
22301 targs1 to see if pat2 is at least as specialized, and vice versa; if we
22302 can find template arguments for pat1 to make arg1 look like arg2, that
22303 means that arg2 is at least as specialized as arg1. */
22306 more_specialized_fn (tree pat1
, tree pat2
, int len
)
22308 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
22309 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
22310 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
22311 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
22312 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
22313 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
22314 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
22315 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
22316 tree origs1
, origs2
;
22317 bool lose1
= false;
22318 bool lose2
= false;
22320 /* Remove the this parameter from non-static member functions. If
22321 one is a non-static member function and the other is not a static
22322 member function, remove the first parameter from that function
22323 also. This situation occurs for operator functions where we
22324 locate both a member function (with this pointer) and non-member
22325 operator (with explicit first operand). */
22326 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
22328 len
--; /* LEN is the number of significant arguments for DECL1 */
22329 args1
= TREE_CHAIN (args1
);
22330 if (!DECL_STATIC_FUNCTION_P (decl2
))
22331 args2
= TREE_CHAIN (args2
);
22333 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
22335 args2
= TREE_CHAIN (args2
);
22336 if (!DECL_STATIC_FUNCTION_P (decl1
))
22339 args1
= TREE_CHAIN (args1
);
22343 /* If only one is a conversion operator, they are unordered. */
22344 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
22347 /* Consider the return type for a conversion function */
22348 if (DECL_CONV_FN_P (decl1
))
22350 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
22351 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
22355 processing_template_decl
++;
22361 /* Stop when an ellipsis is seen. */
22362 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
22364 tree arg1
= TREE_VALUE (args1
);
22365 tree arg2
= TREE_VALUE (args2
);
22366 int deduce1
, deduce2
;
22372 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
22373 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
22375 /* When both arguments are pack expansions, we need only
22376 unify the patterns themselves. */
22377 arg1
= PACK_EXPANSION_PATTERN (arg1
);
22378 arg2
= PACK_EXPANSION_PATTERN (arg2
);
22380 /* This is the last comparison we need to do. */
22384 /* DR 1847: If a particular P contains no template-parameters that
22385 participate in template argument deduction, that P is not used to
22386 determine the ordering. */
22387 if (!uses_deducible_template_parms (arg1
)
22388 && !uses_deducible_template_parms (arg2
))
22391 if (TYPE_REF_P (arg1
))
22393 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
22394 arg1
= TREE_TYPE (arg1
);
22395 quals1
= cp_type_quals (arg1
);
22398 if (TYPE_REF_P (arg2
))
22400 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
22401 arg2
= TREE_TYPE (arg2
);
22402 quals2
= cp_type_quals (arg2
);
22405 arg1
= TYPE_MAIN_VARIANT (arg1
);
22406 arg2
= TYPE_MAIN_VARIANT (arg2
);
22408 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
22410 int i
, len2
= remaining_arguments (args2
);
22411 tree parmvec
= make_tree_vec (1);
22412 tree argvec
= make_tree_vec (len2
);
22415 /* Setup the parameter vector, which contains only ARG1. */
22416 TREE_VEC_ELT (parmvec
, 0) = arg1
;
22418 /* Setup the argument vector, which contains the remaining
22420 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
22421 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
22423 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
22424 argvec
, DEDUCE_EXACT
,
22425 /*subr=*/true, /*explain_p=*/false)
22428 /* We cannot deduce in the other direction, because ARG1 is
22429 a pack expansion but ARG2 is not. */
22432 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
22434 int i
, len1
= remaining_arguments (args1
);
22435 tree parmvec
= make_tree_vec (1);
22436 tree argvec
= make_tree_vec (len1
);
22439 /* Setup the parameter vector, which contains only ARG1. */
22440 TREE_VEC_ELT (parmvec
, 0) = arg2
;
22442 /* Setup the argument vector, which contains the remaining
22444 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
22445 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
22447 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
22448 argvec
, DEDUCE_EXACT
,
22449 /*subr=*/true, /*explain_p=*/false)
22452 /* We cannot deduce in the other direction, because ARG2 is
22453 a pack expansion but ARG1 is not.*/
22459 /* The normal case, where neither argument is a pack
22461 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
22462 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
22464 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
22465 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
22469 /* If we couldn't deduce arguments for tparms1 to make arg1 match
22470 arg2, then arg2 is not as specialized as arg1. */
22476 /* "If, for a given type, deduction succeeds in both directions
22477 (i.e., the types are identical after the transformations above)
22478 and both P and A were reference types (before being replaced with
22479 the type referred to above):
22480 - if the type from the argument template was an lvalue reference and
22481 the type from the parameter template was not, the argument type is
22482 considered to be more specialized than the other; otherwise,
22483 - if the type from the argument template is more cv-qualified
22484 than the type from the parameter template (as described above),
22485 the argument type is considered to be more specialized than the other;
22487 - neither type is more specialized than the other." */
22489 if (deduce1
&& deduce2
)
22491 if (ref1
&& ref2
&& ref1
!= ref2
)
22498 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
22500 if ((quals1
& quals2
) == quals2
)
22502 if ((quals1
& quals2
) == quals1
)
22507 if (lose1
&& lose2
)
22508 /* We've failed to deduce something in either direction.
22509 These must be unordered. */
22514 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
22515 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
22516 /* We have already processed all of the arguments in our
22517 handing of the pack expansion type. */
22520 args1
= TREE_CHAIN (args1
);
22521 args2
= TREE_CHAIN (args2
);
22524 /* "In most cases, all template parameters must have values in order for
22525 deduction to succeed, but for partial ordering purposes a template
22526 parameter may remain without a value provided it is not used in the
22527 types being used for partial ordering."
22529 Thus, if we are missing any of the targs1 we need to substitute into
22530 origs1, then pat2 is not as specialized as pat1. This can happen when
22531 there is a nondeduced context. */
22532 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
22534 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
22537 processing_template_decl
--;
22539 /* If both deductions succeed, the partial ordering selects the more
22540 constrained template. */
22541 if (!lose1
&& !lose2
)
22543 tree c1
= get_constraints (DECL_TEMPLATE_RESULT (pat1
));
22544 tree c2
= get_constraints (DECL_TEMPLATE_RESULT (pat2
));
22545 lose1
= !subsumes_constraints (c1
, c2
);
22546 lose2
= !subsumes_constraints (c2
, c1
);
22549 /* All things being equal, if the next argument is a pack expansion
22550 for one function but not for the other, prefer the
22551 non-variadic function. FIXME this is bogus; see c++/41958. */
22553 && args1
&& TREE_VALUE (args1
)
22554 && args2
&& TREE_VALUE (args2
))
22556 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
22557 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
22560 if (lose1
== lose2
)
22568 /* Determine which of two partial specializations of TMPL is more
22571 PAT1 is a TREE_LIST whose TREE_VALUE is the TEMPLATE_DECL corresponding
22572 to the first partial specialization. The TREE_PURPOSE is the
22573 innermost set of template parameters for the partial
22574 specialization. PAT2 is similar, but for the second template.
22576 Return 1 if the first partial specialization is more specialized;
22577 -1 if the second is more specialized; 0 if neither is more
22580 See [temp.class.order] for information about determining which of
22581 two templates is more specialized. */
22584 more_specialized_partial_spec (tree tmpl
, tree pat1
, tree pat2
)
22588 bool any_deductions
= false;
22590 tree tmpl1
= TREE_VALUE (pat1
);
22591 tree tmpl2
= TREE_VALUE (pat2
);
22592 tree specargs1
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl1
)));
22593 tree specargs2
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl2
)));
22595 /* Just like what happens for functions, if we are ordering between
22596 different template specializations, we may encounter dependent
22597 types in the arguments, and we need our dependency check functions
22598 to behave correctly. */
22599 ++processing_template_decl
;
22600 targs
= get_partial_spec_bindings (tmpl
, tmpl1
, specargs2
);
22604 any_deductions
= true;
22607 targs
= get_partial_spec_bindings (tmpl
, tmpl2
, specargs1
);
22611 any_deductions
= true;
22613 --processing_template_decl
;
22615 /* If both deductions succeed, the partial ordering selects the more
22616 constrained template. */
22617 if (!winner
&& any_deductions
)
22618 return more_constrained (tmpl1
, tmpl2
);
22620 /* In the case of a tie where at least one of the templates
22621 has a parameter pack at the end, the template with the most
22622 non-packed parameters wins. */
22625 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
22626 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
22628 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
22629 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
22630 int len1
= TREE_VEC_LENGTH (args1
);
22631 int len2
= TREE_VEC_LENGTH (args2
);
22633 /* We don't count the pack expansion at the end. */
22634 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
22636 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
22641 else if (len1
< len2
)
22648 /* Return the template arguments that will produce the function signature
22649 DECL from the function template FN, with the explicit template
22650 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
22651 also match. Return NULL_TREE if no satisfactory arguments could be
22655 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
22657 int ntparms
= DECL_NTPARMS (fn
);
22658 tree targs
= make_tree_vec (ntparms
);
22659 tree decl_type
= TREE_TYPE (decl
);
22660 tree decl_arg_types
;
22662 unsigned int nargs
, ix
;
22665 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
22667 /* Never do unification on the 'this' parameter. */
22668 decl_arg_types
= skip_artificial_parms_for (decl
,
22669 TYPE_ARG_TYPES (decl_type
));
22671 nargs
= list_length (decl_arg_types
);
22672 args
= XALLOCAVEC (tree
, nargs
);
22673 for (arg
= decl_arg_types
, ix
= 0;
22674 arg
!= NULL_TREE
&& arg
!= void_list_node
;
22675 arg
= TREE_CHAIN (arg
), ++ix
)
22676 args
[ix
] = TREE_VALUE (arg
);
22678 if (fn_type_unification (fn
, explicit_args
, targs
,
22680 (check_rettype
|| DECL_CONV_FN_P (fn
)
22681 ? TREE_TYPE (decl_type
) : NULL_TREE
),
22682 DEDUCE_EXACT
, LOOKUP_NORMAL
, NULL
,
22683 /*explain_p=*/false,
22685 == error_mark_node
)
22691 /* Return the innermost template arguments that, when applied to a partial
22692 specialization SPEC_TMPL of TMPL, yield the ARGS.
22694 For example, suppose we have:
22696 template <class T, class U> struct S {};
22697 template <class T> struct S<T*, int> {};
22699 Then, suppose we want to get `S<double*, int>'. SPEC_TMPL will be the
22700 partial specialization and the ARGS will be {double*, int}. The resulting
22701 vector will be {double}, indicating that `T' is bound to `double'. */
22704 get_partial_spec_bindings (tree tmpl
, tree spec_tmpl
, tree args
)
22706 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
22708 = TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (spec_tmpl
)));
22709 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
22711 tree innermost_deduced_args
;
22713 innermost_deduced_args
= make_tree_vec (ntparms
);
22714 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
22716 deduced_args
= copy_node (args
);
22717 SET_TMPL_ARGS_LEVEL (deduced_args
,
22718 TMPL_ARGS_DEPTH (deduced_args
),
22719 innermost_deduced_args
);
22722 deduced_args
= innermost_deduced_args
;
22724 bool tried_array_deduction
= (cxx_dialect
< cxx17
);
22726 if (unify (tparms
, deduced_args
,
22727 INNERMOST_TEMPLATE_ARGS (spec_args
),
22728 INNERMOST_TEMPLATE_ARGS (args
),
22729 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
22732 for (i
= 0; i
< ntparms
; ++i
)
22733 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
22735 if (!tried_array_deduction
)
22737 try_array_deduction (tparms
, innermost_deduced_args
,
22738 INNERMOST_TEMPLATE_ARGS (spec_args
));
22739 tried_array_deduction
= true;
22740 if (TREE_VEC_ELT (innermost_deduced_args
, i
))
22746 if (!push_tinst_level (spec_tmpl
, deduced_args
))
22748 excessive_deduction_depth
= true;
22752 /* Verify that nondeduced template arguments agree with the type
22753 obtained from argument deduction.
22757 struct A { typedef int X; };
22758 template <class T, class U> struct C {};
22759 template <class T> struct C<T, typename T::X> {};
22761 Then with the instantiation `C<A, int>', we can deduce that
22762 `T' is `A' but unify () does not check whether `typename T::X'
22764 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
22766 if (spec_args
!= error_mark_node
)
22767 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
22768 INNERMOST_TEMPLATE_ARGS (spec_args
),
22769 tmpl
, tf_none
, false, false);
22771 pop_tinst_level ();
22773 if (spec_args
== error_mark_node
22774 /* We only need to check the innermost arguments; the other
22775 arguments will always agree. */
22776 || !comp_template_args_porder (INNERMOST_TEMPLATE_ARGS (spec_args
),
22777 INNERMOST_TEMPLATE_ARGS (args
)))
22780 /* Now that we have bindings for all of the template arguments,
22781 ensure that the arguments deduced for the template template
22782 parameters have compatible template parameter lists. See the use
22783 of template_template_parm_bindings_ok_p in fn_type_unification
22784 for more information. */
22785 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
22788 return deduced_args
;
22791 // Compare two function templates T1 and T2 by deducing bindings
22792 // from one against the other. If both deductions succeed, compare
22793 // constraints to see which is more constrained.
22795 more_specialized_inst (tree t1
, tree t2
)
22800 if (get_bindings (t1
, DECL_TEMPLATE_RESULT (t2
), NULL_TREE
, true))
22806 if (get_bindings (t2
, DECL_TEMPLATE_RESULT (t1
), NULL_TREE
, true))
22812 // If both deductions succeed, then one may be more constrained.
22813 if (count
== 2 && fate
== 0)
22814 fate
= more_constrained (t1
, t2
);
22819 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
22820 Return the TREE_LIST node with the most specialized template, if
22821 any. If there is no most specialized template, the error_mark_node
22824 Note that this function does not look at, or modify, the
22825 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
22826 returned is one of the elements of INSTANTIATIONS, callers may
22827 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
22828 and retrieve it from the value returned. */
22831 most_specialized_instantiation (tree templates
)
22835 ++processing_template_decl
;
22838 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
22840 gcc_assert (TREE_VALUE (champ
) != TREE_VALUE (fn
));
22841 int fate
= more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
));
22846 /* Equally specialized, move to next function. If there
22847 is no next function, nothing's most specialized. */
22848 fn
= TREE_CHAIN (fn
);
22856 /* Now verify that champ is better than everything earlier in the
22857 instantiation list. */
22858 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
)) {
22859 if (more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
)) != 1)
22866 processing_template_decl
--;
22869 return error_mark_node
;
22874 /* If DECL is a specialization of some template, return the most
22875 general such template. Otherwise, returns NULL_TREE.
22877 For example, given:
22879 template <class T> struct S { template <class U> void f(U); };
22881 if TMPL is `template <class U> void S<int>::f(U)' this will return
22882 the full template. This function will not trace past partial
22883 specializations, however. For example, given in addition:
22885 template <class T> struct S<T*> { template <class U> void f(U); };
22887 if TMPL is `template <class U> void S<int*>::f(U)' this will return
22888 `template <class T> template <class U> S<T*>::f(U)'. */
22891 most_general_template (tree decl
)
22893 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
22895 if (tree tinfo
= get_template_info (decl
))
22896 decl
= TI_TEMPLATE (tinfo
);
22897 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
22898 template friend, or a FIELD_DECL for a capture pack. */
22899 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
22903 /* Look for more and more general templates. */
22904 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
22906 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
22907 (See cp-tree.h for details.) */
22908 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
22911 if (CLASS_TYPE_P (TREE_TYPE (decl
))
22912 && !TYPE_DECL_ALIAS_P (TYPE_NAME (TREE_TYPE (decl
)))
22913 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
22916 /* Stop if we run into an explicitly specialized class template. */
22917 if (!DECL_NAMESPACE_SCOPE_P (decl
)
22918 && DECL_CONTEXT (decl
)
22919 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
22922 decl
= DECL_TI_TEMPLATE (decl
);
22928 /* Return the most specialized of the template partial specializations
22929 which can produce TARGET, a specialization of some class or variable
22930 template. The value returned is actually a TREE_LIST; the TREE_VALUE is
22931 a TEMPLATE_DECL node corresponding to the partial specialization, while
22932 the TREE_PURPOSE is the set of template arguments that must be
22933 substituted into the template pattern in order to generate TARGET.
22935 If the choice of partial specialization is ambiguous, a diagnostic
22936 is issued, and the error_mark_node is returned. If there are no
22937 partial specializations matching TARGET, then NULL_TREE is
22938 returned, indicating that the primary template should be used. */
22941 most_specialized_partial_spec (tree target
, tsubst_flags_t complain
)
22943 tree list
= NULL_TREE
;
22948 tree outer_args
= NULL_TREE
;
22951 if (TYPE_P (target
))
22953 tree tinfo
= CLASSTYPE_TEMPLATE_INFO (target
);
22954 tmpl
= TI_TEMPLATE (tinfo
);
22955 args
= TI_ARGS (tinfo
);
22957 else if (TREE_CODE (target
) == TEMPLATE_ID_EXPR
)
22959 tmpl
= TREE_OPERAND (target
, 0);
22960 args
= TREE_OPERAND (target
, 1);
22962 else if (VAR_P (target
))
22964 tree tinfo
= DECL_TEMPLATE_INFO (target
);
22965 tmpl
= TI_TEMPLATE (tinfo
);
22966 args
= TI_ARGS (tinfo
);
22969 gcc_unreachable ();
22971 tree main_tmpl
= most_general_template (tmpl
);
22973 /* For determining which partial specialization to use, only the
22974 innermost args are interesting. */
22975 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
22977 outer_args
= strip_innermost_template_args (args
, 1);
22978 args
= INNERMOST_TEMPLATE_ARGS (args
);
22981 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
22984 tree spec_tmpl
= TREE_VALUE (t
);
22988 /* Substitute in the template args from the enclosing class. */
22989 ++processing_template_decl
;
22990 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
22991 --processing_template_decl
;
22994 if (spec_tmpl
== error_mark_node
)
22995 return error_mark_node
;
22997 spec_args
= get_partial_spec_bindings (tmpl
, spec_tmpl
, args
);
23001 spec_args
= add_to_template_args (outer_args
, spec_args
);
23003 /* Keep the candidate only if the constraints are satisfied,
23004 or if we're not compiling with concepts. */
23006 || constraints_satisfied_p (spec_tmpl
, spec_args
))
23008 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
23009 TREE_TYPE (list
) = TREE_TYPE (t
);
23017 ambiguous_p
= false;
23020 t
= TREE_CHAIN (t
);
23021 for (; t
; t
= TREE_CHAIN (t
))
23023 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
23030 t
= TREE_CHAIN (t
);
23033 ambiguous_p
= true;
23042 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
23044 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
23047 ambiguous_p
= true;
23055 char *spaces
= NULL
;
23056 if (!(complain
& tf_error
))
23057 return error_mark_node
;
23058 if (TYPE_P (target
))
23059 error ("ambiguous template instantiation for %q#T", target
);
23061 error ("ambiguous template instantiation for %q#D", target
);
23062 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
23063 for (t
= list
; t
; t
= TREE_CHAIN (t
))
23065 tree subst
= build_tree_list (TREE_VALUE (t
), TREE_PURPOSE (t
));
23066 inform (DECL_SOURCE_LOCATION (TREE_VALUE (t
)),
23067 "%s %#qS", spaces
? spaces
: str
, subst
);
23068 spaces
= spaces
? spaces
: get_spaces (str
);
23071 return error_mark_node
;
23077 /* Explicitly instantiate DECL. */
23080 do_decl_instantiation (tree decl
, tree storage
)
23082 tree result
= NULL_TREE
;
23085 if (!decl
|| decl
== error_mark_node
)
23086 /* An error occurred, for which grokdeclarator has already issued
23087 an appropriate message. */
23089 else if (! DECL_LANG_SPECIFIC (decl
))
23091 error ("explicit instantiation of non-template %q#D", decl
);
23095 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
23096 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
23098 if (VAR_P (decl
) && !var_templ
)
23100 /* There is an asymmetry here in the way VAR_DECLs and
23101 FUNCTION_DECLs are handled by grokdeclarator. In the case of
23102 the latter, the DECL we get back will be marked as a
23103 template instantiation, and the appropriate
23104 DECL_TEMPLATE_INFO will be set up. This does not happen for
23105 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
23106 should handle VAR_DECLs as it currently handles
23108 if (!DECL_CLASS_SCOPE_P (decl
))
23110 error ("%qD is not a static data member of a class template", decl
);
23113 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
23114 if (!result
|| !VAR_P (result
))
23116 error ("no matching template for %qD found", decl
);
23119 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
23121 error ("type %qT for explicit instantiation %qD does not match "
23122 "declared type %qT", TREE_TYPE (result
), decl
,
23127 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
23129 error ("explicit instantiation of %q#D", decl
);
23135 /* Check for various error cases. Note that if the explicit
23136 instantiation is valid the RESULT will currently be marked as an
23137 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
23138 until we get here. */
23140 if (DECL_TEMPLATE_SPECIALIZATION (result
))
23142 /* DR 259 [temp.spec].
23144 Both an explicit instantiation and a declaration of an explicit
23145 specialization shall not appear in a program unless the explicit
23146 instantiation follows a declaration of the explicit specialization.
23148 For a given set of template parameters, if an explicit
23149 instantiation of a template appears after a declaration of an
23150 explicit specialization for that template, the explicit
23151 instantiation has no effect. */
23154 else if (DECL_EXPLICIT_INSTANTIATION (result
))
23158 No program shall explicitly instantiate any template more
23161 We check DECL_NOT_REALLY_EXTERN so as not to complain when
23162 the first instantiation was `extern' and the second is not,
23163 and EXTERN_P for the opposite case. */
23164 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
23165 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
23166 /* If an "extern" explicit instantiation follows an ordinary
23167 explicit instantiation, the template is instantiated. */
23171 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
23173 error ("no matching template for %qD found", result
);
23176 else if (!DECL_TEMPLATE_INFO (result
))
23178 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
23182 if (storage
== NULL_TREE
)
23184 else if (storage
== ridpointers
[(int) RID_EXTERN
])
23186 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
23187 pedwarn (input_location
, OPT_Wpedantic
,
23188 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
23193 error ("storage class %qD applied to template instantiation", storage
);
23195 check_explicit_instantiation_namespace (result
);
23196 mark_decl_instantiated (result
, extern_p
);
23198 instantiate_decl (result
, /*defer_ok=*/true,
23199 /*expl_inst_class_mem_p=*/false);
23203 mark_class_instantiated (tree t
, int extern_p
)
23205 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
23206 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
23207 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
23208 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
23211 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
23212 rest_of_type_compilation (t
, 1);
23216 /* Called from do_type_instantiation through binding_table_foreach to
23217 do recursive instantiation for the type bound in ENTRY. */
23219 bt_instantiate_type_proc (binding_entry entry
, void *data
)
23221 tree storage
= *(tree
*) data
;
23223 if (MAYBE_CLASS_TYPE_P (entry
->type
)
23224 && CLASSTYPE_TEMPLATE_INFO (entry
->type
)
23225 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
23226 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
23229 /* Perform an explicit instantiation of template class T. STORAGE, if
23230 non-null, is the RID for extern, inline or static. COMPLAIN is
23231 nonzero if this is called from the parser, zero if called recursively,
23232 since the standard is unclear (as detailed below). */
23235 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
23240 int previous_instantiation_extern_p
= 0;
23242 if (TREE_CODE (t
) == TYPE_DECL
)
23245 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
23248 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
23250 error ("explicit instantiation of non-class template %qD", tmpl
);
23252 error ("explicit instantiation of non-template type %qT", t
);
23258 if (!COMPLETE_TYPE_P (t
))
23260 if (complain
& tf_error
)
23261 error ("explicit instantiation of %q#T before definition of template",
23266 if (storage
!= NULL_TREE
)
23268 if (!in_system_header_at (input_location
))
23270 if (storage
== ridpointers
[(int) RID_EXTERN
])
23272 if (cxx_dialect
== cxx98
)
23273 pedwarn (input_location
, OPT_Wpedantic
,
23274 "ISO C++ 1998 forbids the use of %<extern%> on "
23275 "explicit instantiations");
23278 pedwarn (input_location
, OPT_Wpedantic
,
23279 "ISO C++ forbids the use of %qE"
23280 " on explicit instantiations", storage
);
23283 if (storage
== ridpointers
[(int) RID_INLINE
])
23285 else if (storage
== ridpointers
[(int) RID_EXTERN
])
23287 else if (storage
== ridpointers
[(int) RID_STATIC
])
23291 error ("storage class %qD applied to template instantiation",
23297 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
23299 /* DR 259 [temp.spec].
23301 Both an explicit instantiation and a declaration of an explicit
23302 specialization shall not appear in a program unless the explicit
23303 instantiation follows a declaration of the explicit specialization.
23305 For a given set of template parameters, if an explicit
23306 instantiation of a template appears after a declaration of an
23307 explicit specialization for that template, the explicit
23308 instantiation has no effect. */
23311 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
23315 No program shall explicitly instantiate any template more
23318 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
23319 instantiation was `extern'. If EXTERN_P then the second is.
23320 These cases are OK. */
23321 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
23323 if (!previous_instantiation_extern_p
&& !extern_p
23324 && (complain
& tf_error
))
23325 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
23327 /* If we've already instantiated the template, just return now. */
23328 if (!CLASSTYPE_INTERFACE_ONLY (t
))
23332 check_explicit_instantiation_namespace (TYPE_NAME (t
));
23333 mark_class_instantiated (t
, extern_p
);
23338 /* In contrast to implicit instantiation, where only the
23339 declarations, and not the definitions, of members are
23340 instantiated, we have here:
23344 The explicit instantiation of a class template specialization
23345 implies the instantiation of all of its members not
23346 previously explicitly specialized in the translation unit
23347 containing the explicit instantiation.
23349 Of course, we can't instantiate member template classes, since we
23350 don't have any arguments for them. Note that the standard is
23351 unclear on whether the instantiation of the members are
23352 *explicit* instantiations or not. However, the most natural
23353 interpretation is that it should be an explicit
23355 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= DECL_CHAIN (fld
))
23357 || (TREE_CODE (fld
) == FUNCTION_DECL
23359 && user_provided_p (fld
)))
23360 && DECL_TEMPLATE_INSTANTIATION (fld
))
23362 mark_decl_instantiated (fld
, extern_p
);
23364 instantiate_decl (fld
, /*defer_ok=*/true,
23365 /*expl_inst_class_mem_p=*/true);
23368 if (CLASSTYPE_NESTED_UTDS (t
))
23369 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
23370 bt_instantiate_type_proc
, &storage
);
23373 /* Given a function DECL, which is a specialization of TMPL, modify
23374 DECL to be a re-instantiation of TMPL with the same template
23375 arguments. TMPL should be the template into which tsubst'ing
23376 should occur for DECL, not the most general template.
23378 One reason for doing this is a scenario like this:
23381 void f(const T&, int i);
23383 void g() { f(3, 7); }
23386 void f(const T& t, const int i) { }
23388 Note that when the template is first instantiated, with
23389 instantiate_template, the resulting DECL will have no name for the
23390 first parameter, and the wrong type for the second. So, when we go
23391 to instantiate the DECL, we regenerate it. */
23394 regenerate_decl_from_template (tree decl
, tree tmpl
, tree args
)
23396 /* The arguments used to instantiate DECL, from the most general
23400 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
23402 /* Make sure that we can see identifiers, and compute access
23404 push_access_scope (decl
);
23406 if (TREE_CODE (decl
) == FUNCTION_DECL
)
23414 args_depth
= TMPL_ARGS_DEPTH (args
);
23415 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
23416 if (args_depth
> parms_depth
)
23417 args
= get_innermost_template_args (args
, parms_depth
);
23419 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
23420 args
, tf_error
, NULL_TREE
,
23421 /*defer_ok*/false);
23422 if (specs
&& specs
!= error_mark_node
)
23423 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
23426 /* Merge parameter declarations. */
23427 decl_parm
= skip_artificial_parms_for (decl
,
23428 DECL_ARGUMENTS (decl
));
23430 = skip_artificial_parms_for (code_pattern
,
23431 DECL_ARGUMENTS (code_pattern
));
23432 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
23437 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
23438 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
23439 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
23441 parm_type
= type_decays_to (parm_type
);
23442 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
23443 TREE_TYPE (decl_parm
) = parm_type
;
23444 attributes
= DECL_ATTRIBUTES (pattern_parm
);
23445 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
23447 DECL_ATTRIBUTES (decl_parm
) = attributes
;
23448 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
23450 decl_parm
= DECL_CHAIN (decl_parm
);
23451 pattern_parm
= DECL_CHAIN (pattern_parm
);
23453 /* Merge any parameters that match with the function parameter
23455 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
23458 tree expanded_types
;
23459 /* Expand the TYPE_PACK_EXPANSION that provides the types for
23460 the parameters in this function parameter pack. */
23461 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
23462 args
, tf_error
, NULL_TREE
);
23463 len
= TREE_VEC_LENGTH (expanded_types
);
23464 for (i
= 0; i
< len
; i
++)
23469 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
23470 /* Rename the parameter to include the index. */
23471 DECL_NAME (decl_parm
) =
23472 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
23473 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
23474 parm_type
= type_decays_to (parm_type
);
23475 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
23476 TREE_TYPE (decl_parm
) = parm_type
;
23477 attributes
= DECL_ATTRIBUTES (pattern_parm
);
23478 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
23480 DECL_ATTRIBUTES (decl_parm
) = attributes
;
23481 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
23483 decl_parm
= DECL_CHAIN (decl_parm
);
23486 /* Merge additional specifiers from the CODE_PATTERN. */
23487 if (DECL_DECLARED_INLINE_P (code_pattern
)
23488 && !DECL_DECLARED_INLINE_P (decl
))
23489 DECL_DECLARED_INLINE_P (decl
) = 1;
23491 else if (VAR_P (decl
))
23493 start_lambda_scope (decl
);
23494 DECL_INITIAL (decl
) =
23495 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
23496 tf_error
, DECL_TI_TEMPLATE (decl
),
23497 /*integral_constant_expression_p=*/false);
23498 finish_lambda_scope ();
23499 if (VAR_HAD_UNKNOWN_BOUND (decl
))
23500 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
23501 tf_error
, DECL_TI_TEMPLATE (decl
));
23504 gcc_unreachable ();
23506 pop_access_scope (decl
);
23509 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
23510 substituted to get DECL. */
23513 template_for_substitution (tree decl
)
23515 tree tmpl
= DECL_TI_TEMPLATE (decl
);
23517 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
23518 for the instantiation. This is not always the most general
23519 template. Consider, for example:
23522 struct S { template <class U> void f();
23523 template <> void f<int>(); };
23525 and an instantiation of S<double>::f<int>. We want TD to be the
23526 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
23527 while (/* An instantiation cannot have a definition, so we need a
23528 more general template. */
23529 DECL_TEMPLATE_INSTANTIATION (tmpl
)
23530 /* We must also deal with friend templates. Given:
23532 template <class T> struct S {
23533 template <class U> friend void f() {};
23536 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
23537 so far as the language is concerned, but that's still
23538 where we get the pattern for the instantiation from. On
23539 other hand, if the definition comes outside the class, say:
23541 template <class T> struct S {
23542 template <class U> friend void f();
23544 template <class U> friend void f() {}
23546 we don't need to look any further. That's what the check for
23547 DECL_INITIAL is for. */
23548 || (TREE_CODE (decl
) == FUNCTION_DECL
23549 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
23550 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
23552 /* The present template, TD, should not be a definition. If it
23553 were a definition, we should be using it! Note that we
23554 cannot restructure the loop to just keep going until we find
23555 a template with a definition, since that might go too far if
23556 a specialization was declared, but not defined. */
23558 /* Fetch the more general template. */
23559 tmpl
= DECL_TI_TEMPLATE (tmpl
);
23565 /* Returns true if we need to instantiate this template instance even if we
23566 know we aren't going to emit it. */
23569 always_instantiate_p (tree decl
)
23571 /* We always instantiate inline functions so that we can inline them. An
23572 explicit instantiation declaration prohibits implicit instantiation of
23573 non-inline functions. With high levels of optimization, we would
23574 normally inline non-inline functions -- but we're not allowed to do
23575 that for "extern template" functions. Therefore, we check
23576 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
23577 return ((TREE_CODE (decl
) == FUNCTION_DECL
23578 && (DECL_DECLARED_INLINE_P (decl
)
23579 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
23580 /* And we need to instantiate static data members so that
23581 their initializers are available in integral constant
23584 && decl_maybe_constant_var_p (decl
)));
23587 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
23588 instantiate it now, modifying TREE_TYPE (fn). Returns false on
23589 error, true otherwise. */
23592 maybe_instantiate_noexcept (tree fn
, tsubst_flags_t complain
)
23594 tree fntype
, spec
, noex
, clone
;
23596 /* Don't instantiate a noexcept-specification from template context. */
23597 if (processing_template_decl
23598 && (!flag_noexcept_type
|| type_dependent_expression_p (fn
)))
23601 if (DECL_CLONED_FUNCTION_P (fn
))
23602 fn
= DECL_CLONED_FUNCTION (fn
);
23603 fntype
= TREE_TYPE (fn
);
23604 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
23606 if (!spec
|| !TREE_PURPOSE (spec
))
23609 noex
= TREE_PURPOSE (spec
);
23611 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
23613 static hash_set
<tree
>* fns
= new hash_set
<tree
>;
23614 bool added
= false;
23615 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
23616 spec
= get_defaulted_eh_spec (fn
, complain
);
23617 else if (!(added
= !fns
->add (fn
)))
23619 /* If hash_set::add returns true, the element was already there. */
23620 location_t loc
= cp_expr_loc_or_loc (DEFERRED_NOEXCEPT_PATTERN (noex
),
23621 DECL_SOURCE_LOCATION (fn
));
23623 "exception specification of %qD depends on itself",
23625 spec
= noexcept_false_spec
;
23627 else if (push_tinst_level (fn
))
23629 push_access_scope (fn
);
23630 push_deferring_access_checks (dk_no_deferred
);
23631 input_location
= DECL_SOURCE_LOCATION (fn
);
23632 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
23633 DEFERRED_NOEXCEPT_ARGS (noex
),
23634 tf_warning_or_error
, fn
,
23635 /*function_p=*/false,
23636 /*integral_constant_expression_p=*/true);
23637 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
23638 pop_deferring_access_checks ();
23639 pop_access_scope (fn
);
23640 pop_tinst_level ();
23641 if (spec
== error_mark_node
)
23642 spec
= noexcept_false_spec
;
23645 spec
= noexcept_false_spec
;
23650 if (spec
== error_mark_node
)
23653 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
23656 FOR_EACH_CLONE (clone
, fn
)
23658 if (TREE_TYPE (clone
) == fntype
)
23659 TREE_TYPE (clone
) = TREE_TYPE (fn
);
23661 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
23667 /* We're starting to process the function INST, an instantiation of PATTERN;
23668 add their parameters to local_specializations. */
23671 register_parameter_specializations (tree pattern
, tree inst
)
23673 tree tmpl_parm
= DECL_ARGUMENTS (pattern
);
23674 tree spec_parm
= DECL_ARGUMENTS (inst
);
23675 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (inst
))
23677 register_local_specialization (spec_parm
, tmpl_parm
);
23678 spec_parm
= skip_artificial_parms_for (inst
, spec_parm
);
23679 tmpl_parm
= skip_artificial_parms_for (pattern
, tmpl_parm
);
23681 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
23683 if (!DECL_PACK_P (tmpl_parm
))
23685 register_local_specialization (spec_parm
, tmpl_parm
);
23686 spec_parm
= DECL_CHAIN (spec_parm
);
23690 /* Register the (value) argument pack as a specialization of
23691 TMPL_PARM, then move on. */
23692 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
23693 register_local_specialization (argpack
, tmpl_parm
);
23696 gcc_assert (!spec_parm
);
23699 /* Produce the definition of D, a _DECL generated from a template. If
23700 DEFER_OK is true, then we don't have to actually do the
23701 instantiation now; we just have to do it sometime. Normally it is
23702 an error if this is an explicit instantiation but D is undefined.
23703 EXPL_INST_CLASS_MEM_P is true iff D is a member of an explicitly
23704 instantiated class template. */
23707 instantiate_decl (tree d
, bool defer_ok
, bool expl_inst_class_mem_p
)
23709 tree tmpl
= DECL_TI_TEMPLATE (d
);
23716 bool pattern_defined
;
23717 location_t saved_loc
= input_location
;
23718 int saved_unevaluated_operand
= cp_unevaluated_operand
;
23719 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
23723 /* This function should only be used to instantiate templates for
23724 functions and static member variables. */
23725 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
23727 /* A concept is never instantiated. */
23728 gcc_assert (!DECL_DECLARED_CONCEPT_P (d
));
23730 /* Variables are never deferred; if instantiation is required, they
23731 are instantiated right away. That allows for better code in the
23732 case that an expression refers to the value of the variable --
23733 if the variable has a constant value the referring expression can
23734 take advantage of that fact. */
23738 /* Don't instantiate cloned functions. Instead, instantiate the
23739 functions they cloned. */
23740 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
23741 d
= DECL_CLONED_FUNCTION (d
);
23743 if (DECL_TEMPLATE_INSTANTIATED (d
)
23744 || (TREE_CODE (d
) == FUNCTION_DECL
23745 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
23746 || DECL_TEMPLATE_SPECIALIZATION (d
))
23747 /* D has already been instantiated or explicitly specialized, so
23748 there's nothing for us to do here.
23750 It might seem reasonable to check whether or not D is an explicit
23751 instantiation, and, if so, stop here. But when an explicit
23752 instantiation is deferred until the end of the compilation,
23753 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
23754 the instantiation. */
23757 /* Check to see whether we know that this template will be
23758 instantiated in some other file, as with "extern template"
23760 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
23762 /* In general, we do not instantiate such templates. */
23763 if (external_p
&& !always_instantiate_p (d
))
23766 gen_tmpl
= most_general_template (tmpl
);
23767 gen_args
= DECL_TI_ARGS (d
);
23769 if (tmpl
!= gen_tmpl
)
23770 /* We should already have the extra args. */
23771 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
23772 == TMPL_ARGS_DEPTH (gen_args
));
23773 /* And what's in the hash table should match D. */
23774 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
23775 || spec
== NULL_TREE
);
23777 /* This needs to happen before any tsubsting. */
23778 if (! push_tinst_level (d
))
23781 timevar_push (TV_TEMPLATE_INST
);
23783 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
23784 for the instantiation. */
23785 td
= template_for_substitution (d
);
23790 /* Look up an explicit specialization, if any. */
23791 tree tid
= lookup_template_variable (gen_tmpl
, gen_args
);
23792 tree elt
= most_specialized_partial_spec (tid
, tf_warning_or_error
);
23793 if (elt
&& elt
!= error_mark_node
)
23795 td
= TREE_VALUE (elt
);
23796 args
= TREE_PURPOSE (elt
);
23800 code_pattern
= DECL_TEMPLATE_RESULT (td
);
23802 /* We should never be trying to instantiate a member of a class
23803 template or partial specialization. */
23804 gcc_assert (d
!= code_pattern
);
23806 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
23807 || DECL_TEMPLATE_SPECIALIZATION (td
))
23808 /* In the case of a friend template whose definition is provided
23809 outside the class, we may have too many arguments. Drop the
23810 ones we don't need. The same is true for specializations. */
23811 args
= get_innermost_template_args
23812 (args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
23814 if (TREE_CODE (d
) == FUNCTION_DECL
)
23816 deleted_p
= DECL_DELETED_FN (code_pattern
);
23817 pattern_defined
= ((DECL_SAVED_TREE (code_pattern
) != NULL_TREE
23818 && DECL_INITIAL (code_pattern
) != error_mark_node
)
23819 || DECL_DEFAULTED_FN (code_pattern
)
23825 if (DECL_CLASS_SCOPE_P (code_pattern
))
23826 pattern_defined
= (! DECL_IN_AGGR_P (code_pattern
)
23827 || DECL_INLINE_VAR_P (code_pattern
));
23829 pattern_defined
= ! DECL_EXTERNAL (code_pattern
);
23832 /* We may be in the middle of deferred access check. Disable it now. */
23833 push_deferring_access_checks (dk_no_deferred
);
23835 /* Unless an explicit instantiation directive has already determined
23836 the linkage of D, remember that a definition is available for
23838 if (pattern_defined
23839 && !DECL_INTERFACE_KNOWN (d
)
23840 && !DECL_NOT_REALLY_EXTERN (d
))
23841 mark_definable (d
);
23843 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
23844 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
23845 input_location
= DECL_SOURCE_LOCATION (d
);
23847 /* If D is a member of an explicitly instantiated class template,
23848 and no definition is available, treat it like an implicit
23850 if (!pattern_defined
&& expl_inst_class_mem_p
23851 && DECL_EXPLICIT_INSTANTIATION (d
))
23853 /* Leave linkage flags alone on instantiations with anonymous
23855 if (TREE_PUBLIC (d
))
23857 DECL_NOT_REALLY_EXTERN (d
) = 0;
23858 DECL_INTERFACE_KNOWN (d
) = 0;
23860 SET_DECL_IMPLICIT_INSTANTIATION (d
);
23863 /* Defer all other templates, unless we have been explicitly
23864 forbidden from doing so. */
23865 if (/* If there is no definition, we cannot instantiate the
23868 /* If it's OK to postpone instantiation, do so. */
23870 /* If this is a static data member that will be defined
23871 elsewhere, we don't want to instantiate the entire data
23872 member, but we do want to instantiate the initializer so that
23873 we can substitute that elsewhere. */
23874 || (external_p
&& VAR_P (d
))
23875 /* Handle here a deleted function too, avoid generating
23876 its body (c++/61080). */
23879 /* The definition of the static data member is now required so
23880 we must substitute the initializer. */
23882 && !DECL_INITIAL (d
)
23883 && DECL_INITIAL (code_pattern
))
23887 bool const_init
= false;
23888 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
23890 ns
= decl_namespace_context (d
);
23891 push_nested_namespace (ns
);
23893 push_nested_class (DECL_CONTEXT (d
));
23894 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
23896 tf_warning_or_error
, NULL_TREE
,
23897 /*integral_constant_expression_p=*/false);
23898 /* If instantiating the initializer involved instantiating this
23899 again, don't call cp_finish_decl twice. */
23900 if (!DECL_INITIAL (d
))
23902 /* Make sure the initializer is still constant, in case of
23903 circular dependency (template/instantiate6.C). */
23905 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
23906 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
23907 /*asmspec_tree=*/NULL_TREE
,
23908 LOOKUP_ONLYCONVERTING
);
23911 pop_nested_class ();
23912 pop_nested_namespace (ns
);
23915 /* We restore the source position here because it's used by
23916 add_pending_template. */
23917 input_location
= saved_loc
;
23919 if (at_eof
&& !pattern_defined
23920 && DECL_EXPLICIT_INSTANTIATION (d
)
23921 && DECL_NOT_REALLY_EXTERN (d
))
23924 The definition of a non-exported function template, a
23925 non-exported member function template, or a non-exported
23926 member function or static data member of a class template
23927 shall be present in every translation unit in which it is
23928 explicitly instantiated. */
23929 permerror (input_location
, "explicit instantiation of %qD "
23930 "but no definition available", d
);
23932 /* If we're in unevaluated context, we just wanted to get the
23933 constant value; this isn't an odr use, so don't queue
23934 a full instantiation. */
23935 if (cp_unevaluated_operand
!= 0)
23937 /* ??? Historically, we have instantiated inline functions, even
23938 when marked as "extern template". */
23939 if (!(external_p
&& VAR_P (d
)))
23940 add_pending_template (d
);
23943 /* Tell the repository that D is available in this translation unit
23944 -- and see if it is supposed to be instantiated here. */
23945 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
23947 /* In a PCH file, despite the fact that the repository hasn't
23948 requested instantiation in the PCH it is still possible that
23949 an instantiation will be required in a file that includes the
23952 add_pending_template (d
);
23953 /* Instantiate inline functions so that the inliner can do its
23954 job, even though we'll not be emitting a copy of this
23956 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
23960 bool push_to_top
, nested
;
23962 fn_context
= decl_function_context (d
);
23963 if (LAMBDA_FUNCTION_P (d
))
23964 /* tsubst_lambda_expr resolved any references to enclosing functions. */
23965 fn_context
= NULL_TREE
;
23966 nested
= current_function_decl
!= NULL_TREE
;
23967 push_to_top
= !(nested
&& fn_context
== current_function_decl
);
23969 vec
<tree
> omp_privatization_save
;
23971 save_omp_privatization_clauses (omp_privatization_save
);
23974 push_to_top_level ();
23977 gcc_assert (!processing_template_decl
);
23978 push_function_context ();
23979 cp_unevaluated_operand
= 0;
23980 c_inhibit_evaluation_warnings
= 0;
23983 /* Mark D as instantiated so that recursive calls to
23984 instantiate_decl do not try to instantiate it again. */
23985 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
23987 /* Regenerate the declaration in case the template has been modified
23988 by a subsequent redeclaration. */
23989 regenerate_decl_from_template (d
, td
, args
);
23991 /* We already set the file and line above. Reset them now in case
23992 they changed as a result of calling regenerate_decl_from_template. */
23993 input_location
= DECL_SOURCE_LOCATION (d
);
23998 bool const_init
= false;
24000 /* Clear out DECL_RTL; whatever was there before may not be right
24001 since we've reset the type of the declaration. */
24002 SET_DECL_RTL (d
, NULL
);
24003 DECL_IN_AGGR_P (d
) = 0;
24005 /* The initializer is placed in DECL_INITIAL by
24006 regenerate_decl_from_template so we don't need to
24007 push/pop_access_scope again here. Pull it out so that
24008 cp_finish_decl can process it. */
24009 init
= DECL_INITIAL (d
);
24010 DECL_INITIAL (d
) = NULL_TREE
;
24011 DECL_INITIALIZED_P (d
) = 0;
24013 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
24014 initializer. That function will defer actual emission until
24015 we have a chance to determine linkage. */
24016 DECL_EXTERNAL (d
) = 0;
24018 /* Enter the scope of D so that access-checking works correctly. */
24019 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
24021 push_nested_class (DECL_CONTEXT (d
));
24023 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
24024 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
24027 pop_nested_class ();
24029 if (variable_template_p (gen_tmpl
))
24030 note_variable_template_instantiation (d
);
24032 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
24033 synthesize_method (d
);
24034 else if (TREE_CODE (d
) == FUNCTION_DECL
)
24036 /* Set up the list of local specializations. */
24037 local_specialization_stack
lss (push_to_top
? lss_blank
: lss_copy
);
24038 tree block
= NULL_TREE
;
24040 /* Set up context. */
24041 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
24042 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
24043 block
= push_stmt_list ();
24045 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
24047 /* Some typedefs referenced from within the template code need to be
24048 access checked at template instantiation time, i.e now. These
24049 types were added to the template at parsing time. Let's get those
24050 and perform the access checks then. */
24051 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (td
),
24054 /* Create substitution entries for the parameters. */
24055 register_parameter_specializations (code_pattern
, d
);
24057 /* Substitute into the body of the function. */
24058 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
24059 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
24060 tf_warning_or_error
, tmpl
);
24063 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
24064 tf_warning_or_error
, tmpl
,
24065 /*integral_constant_expression_p=*/false);
24067 /* Set the current input_location to the end of the function
24068 so that finish_function knows where we are. */
24070 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
24072 /* Remember if we saw an infinite loop in the template. */
24073 current_function_infinite_loop
24074 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
24077 /* Finish the function. */
24078 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
24079 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
24080 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
24083 d
= finish_function (/*inline_p=*/false);
24084 expand_or_defer_fn (d
);
24087 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
24088 cp_check_omp_declare_reduction (d
);
24091 /* We're not deferring instantiation any more. */
24092 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
24095 pop_from_top_level ();
24097 pop_function_context ();
24100 restore_omp_privatization_clauses (omp_privatization_save
);
24103 pop_deferring_access_checks ();
24104 timevar_pop (TV_TEMPLATE_INST
);
24105 pop_tinst_level ();
24106 input_location
= saved_loc
;
24107 cp_unevaluated_operand
= saved_unevaluated_operand
;
24108 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
24113 /* Run through the list of templates that we wish we could
24114 instantiate, and instantiate any we can. RETRIES is the
24115 number of times we retry pending template instantiation. */
24118 instantiate_pending_templates (int retries
)
24121 location_t saved_loc
= input_location
;
24123 /* Instantiating templates may trigger vtable generation. This in turn
24124 may require further template instantiations. We place a limit here
24125 to avoid infinite loop. */
24126 if (pending_templates
&& retries
>= max_tinst_depth
)
24128 tree decl
= pending_templates
->tinst
->maybe_get_node ();
24130 fatal_error (input_location
,
24131 "template instantiation depth exceeds maximum of %d"
24132 " instantiating %q+D, possibly from virtual table generation"
24133 " (use -ftemplate-depth= to increase the maximum)",
24134 max_tinst_depth
, decl
);
24135 if (TREE_CODE (decl
) == FUNCTION_DECL
)
24136 /* Pretend that we defined it. */
24137 DECL_INITIAL (decl
) = error_mark_node
;
24143 struct pending_template
**t
= &pending_templates
;
24144 struct pending_template
*last
= NULL
;
24148 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
24149 bool complete
= false;
24151 if (TYPE_P (instantiation
))
24153 if (!COMPLETE_TYPE_P (instantiation
))
24155 instantiate_class_template (instantiation
);
24156 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
24157 for (tree fld
= TYPE_FIELDS (instantiation
);
24158 fld
; fld
= TREE_CHAIN (fld
))
24160 || (TREE_CODE (fld
) == FUNCTION_DECL
24161 && !DECL_ARTIFICIAL (fld
)))
24162 && DECL_TEMPLATE_INSTANTIATION (fld
))
24163 instantiate_decl (fld
,
24164 /*defer_ok=*/false,
24165 /*expl_inst_class_mem_p=*/false);
24167 if (COMPLETE_TYPE_P (instantiation
))
24171 complete
= COMPLETE_TYPE_P (instantiation
);
24175 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
24176 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
24179 = instantiate_decl (instantiation
,
24180 /*defer_ok=*/false,
24181 /*expl_inst_class_mem_p=*/false);
24182 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
24186 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
24187 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
24192 /* If INSTANTIATION has been instantiated, then we don't
24193 need to consider it again in the future. */
24194 struct pending_template
*drop
= *t
;
24196 set_refcount_ptr (drop
->tinst
);
24197 pending_template_freelist ().free (drop
);
24205 set_refcount_ptr (current_tinst_level
);
24207 last_pending_template
= last
;
24209 while (reconsider
);
24211 input_location
= saved_loc
;
24214 /* Substitute ARGVEC into T, which is a list of initializers for
24215 either base class or a non-static data member. The TREE_PURPOSEs
24216 are DECLs, and the TREE_VALUEs are the initializer values. Used by
24217 instantiate_decl. */
24220 tsubst_initializer_list (tree t
, tree argvec
)
24222 tree inits
= NULL_TREE
;
24223 tree target_ctor
= error_mark_node
;
24225 for (; t
; t
= TREE_CHAIN (t
))
24229 tree expanded_bases
= NULL_TREE
;
24230 tree expanded_arguments
= NULL_TREE
;
24233 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
24238 /* Expand the base class expansion type into separate base
24240 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
24241 tf_warning_or_error
,
24243 if (expanded_bases
== error_mark_node
)
24246 /* We'll be building separate TREE_LISTs of arguments for
24248 len
= TREE_VEC_LENGTH (expanded_bases
);
24249 expanded_arguments
= make_tree_vec (len
);
24250 for (i
= 0; i
< len
; i
++)
24251 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
24253 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
24254 expand each argument in the TREE_VALUE of t. */
24255 expr
= make_node (EXPR_PACK_EXPANSION
);
24256 PACK_EXPANSION_LOCAL_P (expr
) = true;
24257 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
24258 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
24260 if (TREE_VALUE (t
) == void_type_node
)
24261 /* VOID_TYPE_NODE is used to indicate
24262 value-initialization. */
24264 for (i
= 0; i
< len
; i
++)
24265 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
24269 /* Substitute parameter packs into each argument in the
24271 in_base_initializer
= 1;
24272 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
24274 tree expanded_exprs
;
24276 /* Expand the argument. */
24277 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
24279 = tsubst_pack_expansion (expr
, argvec
,
24280 tf_warning_or_error
,
24282 if (expanded_exprs
== error_mark_node
)
24285 /* Prepend each of the expanded expressions to the
24286 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
24287 for (i
= 0; i
< len
; i
++)
24289 TREE_VEC_ELT (expanded_arguments
, i
) =
24290 tree_cons (NULL_TREE
,
24291 TREE_VEC_ELT (expanded_exprs
, i
),
24292 TREE_VEC_ELT (expanded_arguments
, i
));
24295 in_base_initializer
= 0;
24297 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
24298 since we built them backwards. */
24299 for (i
= 0; i
< len
; i
++)
24301 TREE_VEC_ELT (expanded_arguments
, i
) =
24302 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
24307 for (i
= 0; i
< len
; ++i
)
24309 if (expanded_bases
)
24311 decl
= TREE_VEC_ELT (expanded_bases
, i
);
24312 decl
= expand_member_init (decl
);
24313 init
= TREE_VEC_ELT (expanded_arguments
, i
);
24318 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
24319 tf_warning_or_error
, NULL_TREE
);
24321 decl
= expand_member_init (decl
);
24322 if (decl
&& !DECL_P (decl
))
24323 in_base_initializer
= 1;
24325 init
= TREE_VALUE (t
);
24327 if (init
!= void_type_node
)
24328 init
= tsubst_expr (init
, argvec
,
24329 tf_warning_or_error
, NULL_TREE
,
24330 /*integral_constant_expression_p=*/false);
24331 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
24332 /* If we had an initializer but it instantiated to nothing,
24333 value-initialize the object. This will only occur when
24334 the initializer was a pack expansion where the parameter
24335 packs used in that expansion were of length zero. */
24336 init
= void_type_node
;
24337 in_base_initializer
= 0;
24340 if (target_ctor
!= error_mark_node
24341 && init
!= error_mark_node
)
24343 error ("mem-initializer for %qD follows constructor delegation",
24347 /* Look for a target constructor. */
24348 if (init
!= error_mark_node
24349 && decl
&& CLASS_TYPE_P (decl
)
24350 && same_type_p (decl
, current_class_type
))
24352 maybe_warn_cpp0x (CPP0X_DELEGATING_CTORS
);
24355 error ("constructor delegation follows mem-initializer for %qD",
24356 TREE_PURPOSE (inits
));
24359 target_ctor
= init
;
24364 init
= build_tree_list (decl
, init
);
24365 TREE_CHAIN (init
) = inits
;
24373 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
24376 set_current_access_from_decl (tree decl
)
24378 if (TREE_PRIVATE (decl
))
24379 current_access_specifier
= access_private_node
;
24380 else if (TREE_PROTECTED (decl
))
24381 current_access_specifier
= access_protected_node
;
24383 current_access_specifier
= access_public_node
;
24386 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
24387 is the instantiation (which should have been created with
24388 start_enum) and ARGS are the template arguments to use. */
24391 tsubst_enum (tree tag
, tree newtag
, tree args
)
24395 if (SCOPED_ENUM_P (newtag
))
24396 begin_scope (sk_scoped_enum
, newtag
);
24398 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
24403 decl
= TREE_VALUE (e
);
24404 /* Note that in a template enum, the TREE_VALUE is the
24405 CONST_DECL, not the corresponding INTEGER_CST. */
24406 value
= tsubst_expr (DECL_INITIAL (decl
),
24407 args
, tf_warning_or_error
, NULL_TREE
,
24408 /*integral_constant_expression_p=*/true);
24410 /* Give this enumeration constant the correct access. */
24411 set_current_access_from_decl (decl
);
24413 /* Actually build the enumerator itself. Here we're assuming that
24414 enumerators can't have dependent attributes. */
24415 build_enumerator (DECL_NAME (decl
), value
, newtag
,
24416 DECL_ATTRIBUTES (decl
), DECL_SOURCE_LOCATION (decl
));
24419 if (SCOPED_ENUM_P (newtag
))
24422 finish_enum_value_list (newtag
);
24423 finish_enum (newtag
);
24425 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
24426 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
24429 /* DECL is a FUNCTION_DECL that is a template specialization. Return
24430 its type -- but without substituting the innermost set of template
24431 arguments. So, innermost set of template parameters will appear in
24435 get_mostly_instantiated_function_type (tree decl
)
24437 /* For a function, DECL_TI_TEMPLATE is partially instantiated. */
24438 return TREE_TYPE (DECL_TI_TEMPLATE (decl
));
24441 /* Return truthvalue if we're processing a template different from
24442 the last one involved in diagnostics. */
24444 problematic_instantiation_changed (void)
24446 return current_tinst_level
!= last_error_tinst_level
;
24449 /* Remember current template involved in diagnostics. */
24451 record_last_problematic_instantiation (void)
24453 set_refcount_ptr (last_error_tinst_level
, current_tinst_level
);
24456 struct tinst_level
*
24457 current_instantiation (void)
24459 return current_tinst_level
;
24462 /* Return TRUE if current_function_decl is being instantiated, false
24466 instantiating_current_function_p (void)
24468 return (current_instantiation ()
24469 && (current_instantiation ()->maybe_get_node ()
24470 == current_function_decl
));
24473 /* [temp.param] Check that template non-type parm TYPE is of an allowable
24474 type. Return false for ok, true for disallowed. Issue error and
24475 inform messages under control of COMPLAIN. */
24478 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
24480 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
24482 else if (TYPE_PTR_P (type
))
24484 else if (TYPE_REF_P (type
)
24485 && !TYPE_REF_IS_RVALUE (type
))
24487 else if (TYPE_PTRMEM_P (type
))
24489 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
24491 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
24493 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
24495 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
24497 /* A bound template template parm could later be instantiated to have a valid
24498 nontype parm type via an alias template. */
24499 else if (cxx_dialect
>= cxx11
24500 && TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
24503 if (complain
& tf_error
)
24505 if (type
== error_mark_node
)
24506 inform (input_location
, "invalid template non-type parameter");
24508 error ("%q#T is not a valid type for a template non-type parameter",
24514 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
24515 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
24518 dependent_type_p_r (tree type
)
24524 A type is dependent if it is:
24526 -- a template parameter. Template template parameters are types
24527 for us (since TYPE_P holds true for them) so we handle
24529 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
24530 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
24532 /* -- a qualified-id with a nested-name-specifier which contains a
24533 class-name that names a dependent type or whose unqualified-id
24534 names a dependent type. */
24535 if (TREE_CODE (type
) == TYPENAME_TYPE
)
24538 /* An alias template specialization can be dependent even if the
24539 resulting type is not. */
24540 if (dependent_alias_template_spec_p (type
))
24543 /* -- a cv-qualified type where the cv-unqualified type is
24545 No code is necessary for this bullet; the code below handles
24546 cv-qualified types, and we don't want to strip aliases with
24547 TYPE_MAIN_VARIANT because of DR 1558. */
24548 /* -- a compound type constructed from any dependent type. */
24549 if (TYPE_PTRMEM_P (type
))
24550 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
24551 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
24553 else if (INDIRECT_TYPE_P (type
))
24554 return dependent_type_p (TREE_TYPE (type
));
24555 else if (TREE_CODE (type
) == FUNCTION_TYPE
24556 || TREE_CODE (type
) == METHOD_TYPE
)
24560 if (dependent_type_p (TREE_TYPE (type
)))
24562 for (arg_type
= TYPE_ARG_TYPES (type
);
24564 arg_type
= TREE_CHAIN (arg_type
))
24565 if (dependent_type_p (TREE_VALUE (arg_type
)))
24567 if (cxx_dialect
>= cxx17
)
24568 /* A value-dependent noexcept-specifier makes the type dependent. */
24569 if (tree spec
= TYPE_RAISES_EXCEPTIONS (type
))
24570 if (tree noex
= TREE_PURPOSE (spec
))
24571 /* Treat DEFERRED_NOEXCEPT as non-dependent, since it doesn't
24572 affect overload resolution and treating it as dependent breaks
24574 if (TREE_CODE (noex
) != DEFERRED_NOEXCEPT
24575 && value_dependent_expression_p (noex
))
24579 /* -- an array type constructed from any dependent type or whose
24580 size is specified by a constant expression that is
24583 We checked for type- and value-dependence of the bounds in
24584 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
24585 if (TREE_CODE (type
) == ARRAY_TYPE
)
24587 if (TYPE_DOMAIN (type
)
24588 && dependent_type_p (TYPE_DOMAIN (type
)))
24590 return dependent_type_p (TREE_TYPE (type
));
24593 /* -- a template-id in which either the template name is a template
24595 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
24597 /* ... or any of the template arguments is a dependent type or
24598 an expression that is type-dependent or value-dependent. */
24599 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
24600 && (any_dependent_template_arguments_p
24601 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
24604 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
24605 dependent; if the argument of the `typeof' expression is not
24606 type-dependent, then it should already been have resolved. */
24607 if (TREE_CODE (type
) == TYPEOF_TYPE
24608 || TREE_CODE (type
) == DECLTYPE_TYPE
24609 || TREE_CODE (type
) == UNDERLYING_TYPE
)
24612 /* A template argument pack is dependent if any of its packed
24614 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
24616 tree args
= ARGUMENT_PACK_ARGS (type
);
24617 int i
, len
= TREE_VEC_LENGTH (args
);
24618 for (i
= 0; i
< len
; ++i
)
24619 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
24623 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
24624 be template parameters. */
24625 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
24628 if (any_dependent_type_attributes_p (TYPE_ATTRIBUTES (type
)))
24631 /* The standard does not specifically mention types that are local
24632 to template functions or local classes, but they should be
24633 considered dependent too. For example:
24635 template <int I> void f() {
24640 The size of `E' cannot be known until the value of `I' has been
24641 determined. Therefore, `E' must be considered dependent. */
24642 scope
= TYPE_CONTEXT (type
);
24643 if (scope
&& TYPE_P (scope
))
24644 return dependent_type_p (scope
);
24645 /* Don't use type_dependent_expression_p here, as it can lead
24646 to infinite recursion trying to determine whether a lambda
24647 nested in a lambda is dependent (c++/47687). */
24648 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
24649 && DECL_LANG_SPECIFIC (scope
)
24650 && DECL_TEMPLATE_INFO (scope
)
24651 && (any_dependent_template_arguments_p
24652 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
24655 /* Other types are non-dependent. */
24659 /* Returns TRUE if TYPE is dependent, in the sense of
24660 [temp.dep.type]. Note that a NULL type is considered dependent. */
24663 dependent_type_p (tree type
)
24665 /* If there are no template parameters in scope, then there can't be
24666 any dependent types. */
24667 if (!processing_template_decl
)
24669 /* If we are not processing a template, then nobody should be
24670 providing us with a dependent type. */
24672 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
24676 /* If the type is NULL, we have not computed a type for the entity
24677 in question; in that case, the type is dependent. */
24681 /* Erroneous types can be considered non-dependent. */
24682 if (type
== error_mark_node
)
24685 /* Getting here with global_type_node means we improperly called this
24686 function on the TREE_TYPE of an IDENTIFIER_NODE. */
24687 gcc_checking_assert (type
!= global_type_node
);
24689 /* If we have not already computed the appropriate value for TYPE,
24691 if (!TYPE_DEPENDENT_P_VALID (type
))
24693 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
24694 TYPE_DEPENDENT_P_VALID (type
) = 1;
24697 return TYPE_DEPENDENT_P (type
);
24700 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
24701 lookup. In other words, a dependent type that is not the current
24705 dependent_scope_p (tree scope
)
24707 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
24708 && !currently_open_class (scope
));
24711 /* T is a SCOPE_REF. Return whether it represents a non-static member of
24712 an unknown base of 'this' (and is therefore instantiation-dependent). */
24715 unknown_base_ref_p (tree t
)
24717 if (!current_class_ptr
)
24720 tree mem
= TREE_OPERAND (t
, 1);
24721 if (shared_member_p (mem
))
24724 tree cur
= current_nonlambda_class_type ();
24725 if (!any_dependent_bases_p (cur
))
24728 tree ctx
= TREE_OPERAND (t
, 0);
24729 if (DERIVED_FROM_P (ctx
, cur
))
24735 /* T is a SCOPE_REF; return whether we need to consider it
24736 instantiation-dependent so that we can check access at instantiation
24737 time even though we know which member it resolves to. */
24740 instantiation_dependent_scope_ref_p (tree t
)
24742 if (DECL_P (TREE_OPERAND (t
, 1))
24743 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
24744 && !unknown_base_ref_p (t
)
24745 && accessible_in_template_p (TREE_OPERAND (t
, 0),
24746 TREE_OPERAND (t
, 1)))
24752 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
24753 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
24756 /* Note that this predicate is not appropriate for general expressions;
24757 only constant expressions (that satisfy potential_constant_expression)
24758 can be tested for value dependence. */
24761 value_dependent_expression_p (tree expression
)
24763 if (!processing_template_decl
|| expression
== NULL_TREE
)
24766 /* A type-dependent expression is also value-dependent. */
24767 if (type_dependent_expression_p (expression
))
24770 switch (TREE_CODE (expression
))
24773 /* A dependent member function of the current instantiation. */
24774 return dependent_type_p (BINFO_TYPE (BASELINK_BINFO (expression
)));
24776 case FUNCTION_DECL
:
24777 /* A dependent member function of the current instantiation. */
24778 if (DECL_CLASS_SCOPE_P (expression
)
24779 && dependent_type_p (DECL_CONTEXT (expression
)))
24783 case IDENTIFIER_NODE
:
24784 /* A name that has not been looked up -- must be dependent. */
24787 case TEMPLATE_PARM_INDEX
:
24788 /* A non-type template parm. */
24792 /* A non-type template parm. */
24793 if (DECL_TEMPLATE_PARM_P (expression
))
24795 return value_dependent_expression_p (DECL_INITIAL (expression
));
24798 /* A constant with literal type and is initialized
24799 with an expression that is value-dependent. */
24800 if (DECL_DEPENDENT_INIT_P (expression
)
24801 /* FIXME cp_finish_decl doesn't fold reference initializers. */
24802 || TYPE_REF_P (TREE_TYPE (expression
)))
24804 if (DECL_HAS_VALUE_EXPR_P (expression
))
24806 tree value_expr
= DECL_VALUE_EXPR (expression
);
24807 if (value_dependent_expression_p (value_expr
))
24812 case DYNAMIC_CAST_EXPR
:
24813 case STATIC_CAST_EXPR
:
24814 case CONST_CAST_EXPR
:
24815 case REINTERPRET_CAST_EXPR
:
24817 case IMPLICIT_CONV_EXPR
:
24818 /* These expressions are value-dependent if the type to which
24819 the cast occurs is dependent or the expression being casted
24820 is value-dependent. */
24822 tree type
= TREE_TYPE (expression
);
24824 if (dependent_type_p (type
))
24827 /* A functional cast has a list of operands. */
24828 expression
= TREE_OPERAND (expression
, 0);
24831 /* If there are no operands, it must be an expression such
24832 as "int()". This should not happen for aggregate types
24833 because it would form non-constant expressions. */
24834 gcc_assert (cxx_dialect
>= cxx11
24835 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
24840 if (TREE_CODE (expression
) == TREE_LIST
)
24841 return any_value_dependent_elements_p (expression
);
24843 return value_dependent_expression_p (expression
);
24847 if (SIZEOF_EXPR_TYPE_P (expression
))
24848 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
24852 /* A `sizeof' expression is value-dependent if the operand is
24853 type-dependent or is a pack expansion. */
24854 expression
= TREE_OPERAND (expression
, 0);
24855 if (PACK_EXPANSION_P (expression
))
24857 else if (TYPE_P (expression
))
24858 return dependent_type_p (expression
);
24859 return instantiation_dependent_uneval_expression_p (expression
);
24861 case AT_ENCODE_EXPR
:
24862 /* An 'encode' expression is value-dependent if the operand is
24864 expression
= TREE_OPERAND (expression
, 0);
24865 return dependent_type_p (expression
);
24867 case NOEXCEPT_EXPR
:
24868 expression
= TREE_OPERAND (expression
, 0);
24869 return instantiation_dependent_uneval_expression_p (expression
);
24872 /* All instantiation-dependent expressions should also be considered
24873 value-dependent. */
24874 return instantiation_dependent_scope_ref_p (expression
);
24876 case COMPONENT_REF
:
24877 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
24878 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
24880 case NONTYPE_ARGUMENT_PACK
:
24881 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
24882 is value-dependent. */
24884 tree values
= ARGUMENT_PACK_ARGS (expression
);
24885 int i
, len
= TREE_VEC_LENGTH (values
);
24887 for (i
= 0; i
< len
; ++i
)
24888 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
24896 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
24898 if (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
)))
24904 if (TREE_CODE (type2
) != TREE_LIST
)
24905 return dependent_type_p (type2
);
24907 for (; type2
; type2
= TREE_CHAIN (type2
))
24908 if (dependent_type_p (TREE_VALUE (type2
)))
24915 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
24916 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
24919 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
24920 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
24924 tree op
= TREE_OPERAND (expression
, 0);
24925 return (value_dependent_expression_p (op
)
24926 || has_value_dependent_address (op
));
24929 case REQUIRES_EXPR
:
24930 /* Treat all requires-expressions as value-dependent so
24931 we don't try to fold them. */
24935 return dependent_type_p (TREE_OPERAND (expression
, 0));
24939 if (value_dependent_expression_p (CALL_EXPR_FN (expression
)))
24941 tree fn
= get_callee_fndecl (expression
);
24943 nargs
= call_expr_nargs (expression
);
24944 for (i
= 0; i
< nargs
; ++i
)
24946 tree op
= CALL_EXPR_ARG (expression
, i
);
24947 /* In a call to a constexpr member function, look through the
24948 implicit ADDR_EXPR on the object argument so that it doesn't
24949 cause the call to be considered value-dependent. We also
24950 look through it in potential_constant_expression. */
24951 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
24952 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
24953 && TREE_CODE (op
) == ADDR_EXPR
)
24954 op
= TREE_OPERAND (op
, 0);
24955 if (value_dependent_expression_p (op
))
24961 case TEMPLATE_ID_EXPR
:
24962 return variable_concept_p (TREE_OPERAND (expression
, 0));
24968 if (dependent_type_p (TREE_TYPE (expression
)))
24970 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
24971 if (value_dependent_expression_p (val
))
24977 /* Treat a GNU statement expression as dependent to avoid crashing
24978 under instantiate_non_dependent_expr; it can't be constant. */
24982 /* A constant expression is value-dependent if any subexpression is
24983 value-dependent. */
24984 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
24986 case tcc_reference
:
24988 case tcc_comparison
:
24990 case tcc_expression
:
24993 int i
, len
= cp_tree_operand_length (expression
);
24995 for (i
= 0; i
< len
; i
++)
24997 tree t
= TREE_OPERAND (expression
, i
);
24999 /* In some cases, some of the operands may be missing.
25000 (For example, in the case of PREDECREMENT_EXPR, the
25001 amount to increment by may be missing.) That doesn't
25002 make the expression dependent. */
25003 if (t
&& value_dependent_expression_p (t
))
25014 /* The expression is not value-dependent. */
25018 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
25019 [temp.dep.expr]. Note that an expression with no type is
25020 considered dependent. Other parts of the compiler arrange for an
25021 expression with type-dependent subexpressions to have no type, so
25022 this function doesn't have to be fully recursive. */
25025 type_dependent_expression_p (tree expression
)
25027 if (!processing_template_decl
)
25030 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
25033 STRIP_ANY_LOCATION_WRAPPER (expression
);
25035 /* An unresolved name is always dependent. */
25036 if (identifier_p (expression
)
25037 || TREE_CODE (expression
) == USING_DECL
25038 || TREE_CODE (expression
) == WILDCARD_DECL
)
25041 /* A fold expression is type-dependent. */
25042 if (TREE_CODE (expression
) == UNARY_LEFT_FOLD_EXPR
25043 || TREE_CODE (expression
) == UNARY_RIGHT_FOLD_EXPR
25044 || TREE_CODE (expression
) == BINARY_LEFT_FOLD_EXPR
25045 || TREE_CODE (expression
) == BINARY_RIGHT_FOLD_EXPR
)
25048 /* Some expression forms are never type-dependent. */
25049 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
25050 || TREE_CODE (expression
) == SIZEOF_EXPR
25051 || TREE_CODE (expression
) == ALIGNOF_EXPR
25052 || TREE_CODE (expression
) == AT_ENCODE_EXPR
25053 || TREE_CODE (expression
) == NOEXCEPT_EXPR
25054 || TREE_CODE (expression
) == TRAIT_EXPR
25055 || TREE_CODE (expression
) == TYPEID_EXPR
25056 || TREE_CODE (expression
) == DELETE_EXPR
25057 || TREE_CODE (expression
) == VEC_DELETE_EXPR
25058 || TREE_CODE (expression
) == THROW_EXPR
25059 || TREE_CODE (expression
) == REQUIRES_EXPR
)
25062 /* The types of these expressions depends only on the type to which
25063 the cast occurs. */
25064 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
25065 || TREE_CODE (expression
) == STATIC_CAST_EXPR
25066 || TREE_CODE (expression
) == CONST_CAST_EXPR
25067 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
25068 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
25069 || TREE_CODE (expression
) == CAST_EXPR
)
25070 return dependent_type_p (TREE_TYPE (expression
));
25072 /* The types of these expressions depends only on the type created
25073 by the expression. */
25074 if (TREE_CODE (expression
) == NEW_EXPR
25075 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
25077 /* For NEW_EXPR tree nodes created inside a template, either
25078 the object type itself or a TREE_LIST may appear as the
25080 tree type
= TREE_OPERAND (expression
, 1);
25081 if (TREE_CODE (type
) == TREE_LIST
)
25082 /* This is an array type. We need to check array dimensions
25084 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
25085 || value_dependent_expression_p
25086 (TREE_OPERAND (TREE_VALUE (type
), 1));
25088 return dependent_type_p (type
);
25091 if (TREE_CODE (expression
) == SCOPE_REF
)
25093 tree scope
= TREE_OPERAND (expression
, 0);
25094 tree name
= TREE_OPERAND (expression
, 1);
25096 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
25097 contains an identifier associated by name lookup with one or more
25098 declarations declared with a dependent type, or...a
25099 nested-name-specifier or qualified-id that names a member of an
25100 unknown specialization. */
25101 return (type_dependent_expression_p (name
)
25102 || dependent_scope_p (scope
));
25105 if (TREE_CODE (expression
) == TEMPLATE_DECL
25106 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
25107 return uses_outer_template_parms (expression
);
25109 if (TREE_CODE (expression
) == STMT_EXPR
)
25110 expression
= stmt_expr_value_expr (expression
);
25112 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
25117 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
25119 if (type_dependent_expression_p (elt
))
25125 /* A static data member of the current instantiation with incomplete
25126 array type is type-dependent, as the definition and specializations
25127 can have different bounds. */
25128 if (VAR_P (expression
)
25129 && DECL_CLASS_SCOPE_P (expression
)
25130 && dependent_type_p (DECL_CONTEXT (expression
))
25131 && VAR_HAD_UNKNOWN_BOUND (expression
))
25134 /* An array of unknown bound depending on a variadic parameter, eg:
25136 template<typename... Args>
25137 void foo (Args... args)
25139 int arr[] = { args... };
25142 template<int... vals>
25145 int arr[] = { vals... };
25148 If the array has no length and has an initializer, it must be that
25149 we couldn't determine its length in cp_complete_array_type because
25150 it is dependent. */
25151 if (VAR_P (expression
)
25152 && TREE_TYPE (expression
) != NULL_TREE
25153 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
25154 && !TYPE_DOMAIN (TREE_TYPE (expression
))
25155 && DECL_INITIAL (expression
))
25158 /* A function or variable template-id is type-dependent if it has any
25159 dependent template arguments. */
25160 if (VAR_OR_FUNCTION_DECL_P (expression
)
25161 && DECL_LANG_SPECIFIC (expression
)
25162 && DECL_TEMPLATE_INFO (expression
))
25164 /* Consider the innermost template arguments, since those are the ones
25165 that come from the template-id; the template arguments for the
25166 enclosing class do not make it type-dependent unless they are used in
25167 the type of the decl. */
25168 if (PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (expression
))
25169 && (any_dependent_template_arguments_p
25170 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
25174 /* Otherwise, if the function decl isn't from a dependent scope, it can't be
25175 type-dependent. Checking this is important for functions with auto return
25176 type, which looks like a dependent type. */
25177 if (TREE_CODE (expression
) == FUNCTION_DECL
25178 && !(DECL_CLASS_SCOPE_P (expression
)
25179 && dependent_type_p (DECL_CONTEXT (expression
)))
25180 && !(DECL_LANG_SPECIFIC (expression
)
25181 && DECL_FRIEND_P (expression
)
25182 && (!DECL_FRIEND_CONTEXT (expression
)
25183 || dependent_type_p (DECL_FRIEND_CONTEXT (expression
))))
25184 && !DECL_LOCAL_FUNCTION_P (expression
))
25186 gcc_assert (!dependent_type_p (TREE_TYPE (expression
))
25187 || undeduced_auto_decl (expression
));
25191 /* Always dependent, on the number of arguments if nothing else. */
25192 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
25195 if (TREE_TYPE (expression
) == unknown_type_node
)
25197 if (TREE_CODE (expression
) == ADDR_EXPR
)
25198 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
25199 if (TREE_CODE (expression
) == COMPONENT_REF
25200 || TREE_CODE (expression
) == OFFSET_REF
)
25202 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
25204 expression
= TREE_OPERAND (expression
, 1);
25205 if (identifier_p (expression
))
25208 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
25209 if (TREE_CODE (expression
) == SCOPE_REF
)
25212 if (BASELINK_P (expression
))
25214 if (BASELINK_OPTYPE (expression
)
25215 && dependent_type_p (BASELINK_OPTYPE (expression
)))
25217 expression
= BASELINK_FUNCTIONS (expression
);
25220 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
25222 if (any_dependent_template_arguments_p
25223 (TREE_OPERAND (expression
, 1)))
25225 expression
= TREE_OPERAND (expression
, 0);
25226 if (identifier_p (expression
))
25230 gcc_assert (TREE_CODE (expression
) == OVERLOAD
25231 || TREE_CODE (expression
) == FUNCTION_DECL
);
25233 for (lkp_iterator
iter (expression
); iter
; ++iter
)
25234 if (type_dependent_expression_p (*iter
))
25240 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
25242 /* Dependent type attributes might not have made it from the decl to
25244 if (DECL_P (expression
)
25245 && any_dependent_type_attributes_p (DECL_ATTRIBUTES (expression
)))
25248 return (dependent_type_p (TREE_TYPE (expression
)));
25251 /* [temp.dep.expr]/5: A class member access expression (5.2.5) is
25252 type-dependent if the expression refers to a member of the current
25253 instantiation and the type of the referenced member is dependent, or the
25254 class member access expression refers to a member of an unknown
25257 This function returns true if the OBJECT in such a class member access
25258 expression is of an unknown specialization. */
25261 type_dependent_object_expression_p (tree object
)
25263 /* An IDENTIFIER_NODE can sometimes have a TREE_TYPE, but it's still
25265 if (TREE_CODE (object
) == IDENTIFIER_NODE
)
25267 tree scope
= TREE_TYPE (object
);
25268 return (!scope
|| dependent_scope_p (scope
));
25271 /* walk_tree callback function for instantiation_dependent_expression_p,
25272 below. Returns non-zero if a dependent subexpression is found. */
25275 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
25280 /* We don't have to worry about decltype currently because decltype
25281 of an instantiation-dependent expr is a dependent type. This
25282 might change depending on the resolution of DR 1172. */
25283 *walk_subtrees
= false;
25286 enum tree_code code
= TREE_CODE (*tp
);
25289 /* Don't treat an argument list as dependent just because it has no
25293 case NONTYPE_ARGUMENT_PACK
:
25296 case TEMPLATE_PARM_INDEX
:
25299 /* Handle expressions with type operands. */
25303 case AT_ENCODE_EXPR
:
25305 tree op
= TREE_OPERAND (*tp
, 0);
25306 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
25307 op
= TREE_TYPE (op
);
25310 if (dependent_type_p (op
))
25314 *walk_subtrees
= false;
25321 case COMPONENT_REF
:
25322 if (identifier_p (TREE_OPERAND (*tp
, 1)))
25323 /* In a template, finish_class_member_access_expr creates a
25324 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
25325 type-dependent, so that we can check access control at
25326 instantiation time (PR 42277). See also Core issue 1273. */
25331 if (instantiation_dependent_scope_ref_p (*tp
))
25336 /* Treat statement-expressions as dependent. */
25340 /* Treat requires-expressions as dependent. */
25341 case REQUIRES_EXPR
:
25345 /* Treat calls to function concepts as dependent. */
25346 if (function_concept_check_p (*tp
))
25350 case TEMPLATE_ID_EXPR
:
25351 /* And variable concepts. */
25352 if (variable_concept_p (TREE_OPERAND (*tp
, 0)))
25360 if (type_dependent_expression_p (*tp
))
25366 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
25367 sense defined by the ABI:
25369 "An expression is instantiation-dependent if it is type-dependent
25370 or value-dependent, or it has a subexpression that is type-dependent
25371 or value-dependent."
25373 Except don't actually check value-dependence for unevaluated expressions,
25374 because in sizeof(i) we don't care about the value of i. Checking
25375 type-dependence will in turn check value-dependence of array bounds/template
25376 arguments as needed. */
25379 instantiation_dependent_uneval_expression_p (tree expression
)
25383 if (!processing_template_decl
)
25386 if (expression
== error_mark_node
)
25389 result
= cp_walk_tree_without_duplicates (&expression
,
25390 instantiation_dependent_r
, NULL
);
25391 return result
!= NULL_TREE
;
25394 /* As above, but also check value-dependence of the expression as a whole. */
25397 instantiation_dependent_expression_p (tree expression
)
25399 return (instantiation_dependent_uneval_expression_p (expression
)
25400 || value_dependent_expression_p (expression
));
25403 /* Like type_dependent_expression_p, but it also works while not processing
25404 a template definition, i.e. during substitution or mangling. */
25407 type_dependent_expression_p_push (tree expr
)
25410 ++processing_template_decl
;
25411 b
= type_dependent_expression_p (expr
);
25412 --processing_template_decl
;
25416 /* Returns TRUE if ARGS contains a type-dependent expression. */
25419 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
25424 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
25426 if (type_dependent_expression_p (arg
))
25432 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
25433 expressions) contains any type-dependent expressions. */
25436 any_type_dependent_elements_p (const_tree list
)
25438 for (; list
; list
= TREE_CHAIN (list
))
25439 if (type_dependent_expression_p (TREE_VALUE (list
)))
25445 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
25446 expressions) contains any value-dependent expressions. */
25449 any_value_dependent_elements_p (const_tree list
)
25451 for (; list
; list
= TREE_CHAIN (list
))
25452 if (value_dependent_expression_p (TREE_VALUE (list
)))
25458 /* Returns TRUE if the ARG (a template argument) is dependent. */
25461 dependent_template_arg_p (tree arg
)
25463 if (!processing_template_decl
)
25466 /* Assume a template argument that was wrongly written by the user
25467 is dependent. This is consistent with what
25468 any_dependent_template_arguments_p [that calls this function]
25470 if (!arg
|| arg
== error_mark_node
)
25473 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
25474 arg
= argument_pack_select_arg (arg
);
25476 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
25478 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
25480 if (DECL_TEMPLATE_PARM_P (arg
))
25482 /* A member template of a dependent class is not necessarily
25483 type-dependent, but it is a dependent template argument because it
25484 will be a member of an unknown specialization to that template. */
25485 tree scope
= CP_DECL_CONTEXT (arg
);
25486 return TYPE_P (scope
) && dependent_type_p (scope
);
25488 else if (ARGUMENT_PACK_P (arg
))
25490 tree args
= ARGUMENT_PACK_ARGS (arg
);
25491 int i
, len
= TREE_VEC_LENGTH (args
);
25492 for (i
= 0; i
< len
; ++i
)
25494 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
25500 else if (TYPE_P (arg
))
25501 return dependent_type_p (arg
);
25503 return (type_dependent_expression_p (arg
)
25504 || value_dependent_expression_p (arg
));
25507 /* Returns true if ARGS (a collection of template arguments) contains
25508 any types that require structural equality testing. */
25511 any_template_arguments_need_structural_equality_p (tree args
)
25518 if (args
== error_mark_node
)
25521 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
25523 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
25524 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
25526 tree arg
= TREE_VEC_ELT (level
, j
);
25527 tree packed_args
= NULL_TREE
;
25530 if (ARGUMENT_PACK_P (arg
))
25532 /* Look inside the argument pack. */
25533 packed_args
= ARGUMENT_PACK_ARGS (arg
);
25534 len
= TREE_VEC_LENGTH (packed_args
);
25537 for (k
= 0; k
< len
; ++k
)
25540 arg
= TREE_VEC_ELT (packed_args
, k
);
25542 if (error_operand_p (arg
))
25544 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
25546 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
25548 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
25549 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
25558 /* Returns true if ARGS (a collection of template arguments) contains
25559 any dependent arguments. */
25562 any_dependent_template_arguments_p (const_tree args
)
25569 if (args
== error_mark_node
)
25572 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
25574 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
25575 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
25576 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
25583 /* Returns true if ARGS contains any errors. */
25586 any_erroneous_template_args_p (const_tree args
)
25591 if (args
== error_mark_node
)
25594 if (args
&& TREE_CODE (args
) != TREE_VEC
)
25596 if (tree ti
= get_template_info (args
))
25597 args
= TI_ARGS (ti
);
25605 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
25607 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
25608 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
25609 if (error_operand_p (TREE_VEC_ELT (level
, j
)))
25616 /* Returns TRUE if the template TMPL is type-dependent. */
25619 dependent_template_p (tree tmpl
)
25621 if (TREE_CODE (tmpl
) == OVERLOAD
)
25623 for (lkp_iterator
iter (tmpl
); iter
; ++iter
)
25624 if (dependent_template_p (*iter
))
25629 /* Template template parameters are dependent. */
25630 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
25631 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
25633 /* So are names that have not been looked up. */
25634 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
25639 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
25642 dependent_template_id_p (tree tmpl
, tree args
)
25644 return (dependent_template_p (tmpl
)
25645 || any_dependent_template_arguments_p (args
));
25648 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
25652 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
25656 if (!processing_template_decl
)
25659 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
25661 tree decl
= TREE_VEC_ELT (declv
, i
);
25662 tree init
= TREE_VEC_ELT (initv
, i
);
25663 tree cond
= TREE_VEC_ELT (condv
, i
);
25664 tree incr
= TREE_VEC_ELT (incrv
, i
);
25666 if (type_dependent_expression_p (decl
)
25667 || TREE_CODE (decl
) == SCOPE_REF
)
25670 if (init
&& type_dependent_expression_p (init
))
25673 if (type_dependent_expression_p (cond
))
25676 if (COMPARISON_CLASS_P (cond
)
25677 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
25678 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
25681 if (TREE_CODE (incr
) == MODOP_EXPR
)
25683 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
25684 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
25687 else if (type_dependent_expression_p (incr
))
25689 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
25691 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
25693 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
25695 tree t
= TREE_OPERAND (incr
, 1);
25696 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
25697 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
25706 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
25707 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
25708 no such TYPE can be found. Note that this function peers inside
25709 uninstantiated templates and therefore should be used only in
25710 extremely limited situations. ONLY_CURRENT_P restricts this
25711 peering to the currently open classes hierarchy (which is required
25712 when comparing types). */
25715 resolve_typename_type (tree type
, bool only_current_p
)
25724 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
25726 scope
= TYPE_CONTEXT (type
);
25727 /* We shouldn't have built a TYPENAME_TYPE with a non-dependent scope. */
25728 gcc_checking_assert (uses_template_parms (scope
));
25730 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
25731 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
25732 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
25733 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
25734 identifier of the TYPENAME_TYPE anymore.
25735 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
25736 TYPENAME_TYPE instead, we avoid messing up with a possible
25737 typedef variant case. */
25738 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
25740 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
25741 it first before we can figure out what NAME refers to. */
25742 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
25744 if (TYPENAME_IS_RESOLVING_P (scope
))
25745 /* Given a class template A with a dependent base with nested type C,
25746 typedef typename A::C::C C will land us here, as trying to resolve
25747 the initial A::C leads to the local C typedef, which leads back to
25748 A::C::C. So we break the recursion now. */
25751 scope
= resolve_typename_type (scope
, only_current_p
);
25753 /* If we don't know what SCOPE refers to, then we cannot resolve the
25755 if (!CLASS_TYPE_P (scope
))
25757 /* If this is a typedef, we don't want to look inside (c++/11987). */
25758 if (typedef_variant_p (type
))
25760 /* If SCOPE isn't the template itself, it will not have a valid
25761 TYPE_FIELDS list. */
25762 if (same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
25763 /* scope is either the template itself or a compatible instantiation
25764 like X<T>, so look up the name in the original template. */
25765 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
25766 /* If scope has no fields, it can't be a current instantiation. Check this
25767 before currently_open_class to avoid infinite recursion (71515). */
25768 if (!TYPE_FIELDS (scope
))
25770 /* If the SCOPE is not the current instantiation, there's no reason
25771 to look inside it. */
25772 if (only_current_p
&& !currently_open_class (scope
))
25774 /* Enter the SCOPE so that name lookup will be resolved as if we
25775 were in the class definition. In particular, SCOPE will no
25776 longer be considered a dependent type. */
25777 pushed_scope
= push_scope (scope
);
25778 /* Look up the declaration. */
25779 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
25780 tf_warning_or_error
);
25782 result
= NULL_TREE
;
25784 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
25785 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
25786 tree fullname
= TYPENAME_TYPE_FULLNAME (type
);
25789 else if (identifier_p (fullname
)
25790 && TREE_CODE (decl
) == TYPE_DECL
)
25792 result
= TREE_TYPE (decl
);
25793 if (result
== error_mark_node
)
25794 result
= NULL_TREE
;
25796 else if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
25797 && DECL_CLASS_TEMPLATE_P (decl
))
25799 /* Obtain the template and the arguments. */
25800 tree tmpl
= TREE_OPERAND (fullname
, 0);
25801 if (TREE_CODE (tmpl
) == IDENTIFIER_NODE
)
25803 /* We get here with a plain identifier because a previous tentative
25804 parse of the nested-name-specifier as part of a ptr-operator saw
25805 ::template X<A>. The use of ::template is necessary in a
25806 ptr-operator, but wrong in a declarator-id.
25808 [temp.names]: In a qualified-id of a declarator-id, the keyword
25809 template shall not appear at the top level. */
25810 pedwarn (cp_expr_loc_or_loc (fullname
, input_location
), OPT_Wpedantic
,
25811 "keyword %<template%> not allowed in declarator-id");
25814 tree args
= TREE_OPERAND (fullname
, 1);
25815 /* Instantiate the template. */
25816 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
25817 /*entering_scope=*/true,
25818 tf_error
| tf_user
);
25819 if (result
== error_mark_node
)
25820 result
= NULL_TREE
;
25823 /* Leave the SCOPE. */
25825 pop_scope (pushed_scope
);
25827 /* If we failed to resolve it, return the original typename. */
25831 /* If lookup found a typename type, resolve that too. */
25832 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
25834 /* Ill-formed programs can cause infinite recursion here, so we
25835 must catch that. */
25836 TYPENAME_IS_RESOLVING_P (result
) = 1;
25837 result
= resolve_typename_type (result
, only_current_p
);
25838 TYPENAME_IS_RESOLVING_P (result
) = 0;
25841 /* Qualify the resulting type. */
25842 quals
= cp_type_quals (type
);
25844 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
25849 /* EXPR is an expression which is not type-dependent. Return a proxy
25850 for EXPR that can be used to compute the types of larger
25851 expressions containing EXPR. */
25854 build_non_dependent_expr (tree expr
)
25856 tree orig_expr
= expr
;
25859 /* When checking, try to get a constant value for all non-dependent
25860 expressions in order to expose bugs in *_dependent_expression_p
25861 and constexpr. This can affect code generation, see PR70704, so
25862 only do this for -fchecking=2. */
25863 if (flag_checking
> 1
25864 && cxx_dialect
>= cxx11
25865 /* Don't do this during nsdmi parsing as it can lead to
25866 unexpected recursive instantiations. */
25867 && !parsing_nsdmi ()
25868 /* Don't do this during concept expansion either and for
25869 the same reason. */
25870 && !expanding_concept ())
25871 fold_non_dependent_expr (expr
, tf_none
);
25873 STRIP_ANY_LOCATION_WRAPPER (expr
);
25875 /* Preserve OVERLOADs; the functions must be available to resolve
25878 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
25879 inner_expr
= stmt_expr_value_expr (inner_expr
);
25880 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
25881 inner_expr
= TREE_OPERAND (inner_expr
, 0);
25882 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
25883 inner_expr
= TREE_OPERAND (inner_expr
, 1);
25884 if (is_overloaded_fn (inner_expr
)
25885 || TREE_CODE (inner_expr
) == OFFSET_REF
)
25887 /* There is no need to return a proxy for a variable or enumerator. */
25888 if (VAR_P (expr
) || TREE_CODE (expr
) == CONST_DECL
)
25890 /* Preserve string constants; conversions from string constants to
25891 "char *" are allowed, even though normally a "const char *"
25892 cannot be used to initialize a "char *". */
25893 if (TREE_CODE (expr
) == STRING_CST
)
25895 /* Preserve void and arithmetic constants, as an optimization -- there is no
25896 reason to create a new node. */
25897 if (TREE_CODE (expr
) == VOID_CST
25898 || TREE_CODE (expr
) == INTEGER_CST
25899 || TREE_CODE (expr
) == REAL_CST
)
25901 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
25902 There is at least one place where we want to know that a
25903 particular expression is a throw-expression: when checking a ?:
25904 expression, there are special rules if the second or third
25905 argument is a throw-expression. */
25906 if (TREE_CODE (expr
) == THROW_EXPR
)
25909 /* Don't wrap an initializer list, we need to be able to look inside. */
25910 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
25913 /* Don't wrap a dummy object, we need to be able to test for it. */
25914 if (is_dummy_object (expr
))
25917 if (TREE_CODE (expr
) == COND_EXPR
)
25918 return build3 (COND_EXPR
,
25920 TREE_OPERAND (expr
, 0),
25921 (TREE_OPERAND (expr
, 1)
25922 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
25923 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
25924 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
25925 if (TREE_CODE (expr
) == COMPOUND_EXPR
25926 && !COMPOUND_EXPR_OVERLOADED (expr
))
25927 return build2 (COMPOUND_EXPR
,
25929 TREE_OPERAND (expr
, 0),
25930 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
25932 /* If the type is unknown, it can't really be non-dependent */
25933 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
25935 /* Otherwise, build a NON_DEPENDENT_EXPR. */
25936 return build1_loc (EXPR_LOCATION (orig_expr
), NON_DEPENDENT_EXPR
,
25937 TREE_TYPE (expr
), expr
);
25940 /* ARGS is a vector of expressions as arguments to a function call.
25941 Replace the arguments with equivalent non-dependent expressions.
25942 This modifies ARGS in place. */
25945 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
25950 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
25952 tree newarg
= build_non_dependent_expr (arg
);
25954 (*args
)[ix
] = newarg
;
25958 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
25959 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
25960 parms. If set_canonical is true, we set TYPE_CANONICAL on it. */
25963 make_auto_1 (tree name
, bool set_canonical
)
25965 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
25966 TYPE_NAME (au
) = build_decl (input_location
,
25967 TYPE_DECL
, name
, au
);
25968 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
25969 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
25970 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
25971 TYPE_NAME (au
), NULL_TREE
);
25973 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
25974 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
25975 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
25981 make_decltype_auto (void)
25983 return make_auto_1 (decltype_auto_identifier
, true);
25989 return make_auto_1 (auto_identifier
, true);
25992 /* Return a C++17 deduction placeholder for class template TMPL. */
25995 make_template_placeholder (tree tmpl
)
25997 tree t
= make_auto_1 (DECL_NAME (tmpl
), true);
25998 CLASS_PLACEHOLDER_TEMPLATE (t
) = tmpl
;
26002 /* True iff T is a C++17 class template deduction placeholder. */
26005 template_placeholder_p (tree t
)
26007 return is_auto (t
) && CLASS_PLACEHOLDER_TEMPLATE (t
);
26010 /* Make a "constrained auto" type-specifier. This is an
26011 auto type with constraints that must be associated after
26012 deduction. The constraint is formed from the given
26013 CONC and its optional sequence of arguments, which are
26014 non-null if written as partial-concept-id. */
26017 make_constrained_auto (tree con
, tree args
)
26019 tree type
= make_auto_1 (auto_identifier
, false);
26021 /* Build the constraint. */
26022 tree tmpl
= DECL_TI_TEMPLATE (con
);
26023 tree expr
= VAR_P (con
) ? tmpl
: ovl_make (tmpl
);
26024 expr
= build_concept_check (expr
, type
, args
);
26026 tree constr
= normalize_expression (expr
);
26027 PLACEHOLDER_TYPE_CONSTRAINTS (type
) = constr
;
26029 /* Our canonical type depends on the constraint. */
26030 TYPE_CANONICAL (type
) = canonical_type_parameter (type
);
26032 /* Attach the constraint to the type declaration. */
26033 tree decl
= TYPE_NAME (type
);
26037 /* Given type ARG, return std::initializer_list<ARG>. */
26042 tree std_init_list
= get_namespace_binding (std_node
, init_list_identifier
);
26044 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
26046 gcc_rich_location
richloc (input_location
);
26047 maybe_add_include_fixit (&richloc
, "<initializer_list>");
26048 error_at (&richloc
,
26049 "deducing from brace-enclosed initializer list"
26050 " requires %<#include <initializer_list>%>");
26052 return error_mark_node
;
26054 tree argvec
= make_tree_vec (1);
26055 TREE_VEC_ELT (argvec
, 0) = arg
;
26057 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
26058 NULL_TREE
, 0, tf_warning_or_error
);
26061 /* Replace auto in TYPE with std::initializer_list<auto>. */
26064 listify_autos (tree type
, tree auto_node
)
26066 tree init_auto
= listify (auto_node
);
26067 tree argvec
= make_tree_vec (1);
26068 TREE_VEC_ELT (argvec
, 0) = init_auto
;
26069 if (processing_template_decl
)
26070 argvec
= add_to_template_args (current_template_args (), argvec
);
26071 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
26074 /* Hash traits for hashing possibly constrained 'auto'
26075 TEMPLATE_TYPE_PARMs for use by do_auto_deduction. */
26077 struct auto_hash
: default_hash_traits
<tree
>
26079 static inline hashval_t
hash (tree
);
26080 static inline bool equal (tree
, tree
);
26083 /* Hash the 'auto' T. */
26086 auto_hash::hash (tree t
)
26088 if (tree c
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
26089 /* Matching constrained-type-specifiers denote the same template
26090 parameter, so hash the constraint. */
26091 return hash_placeholder_constraint (c
);
26093 /* But unconstrained autos are all separate, so just hash the pointer. */
26094 return iterative_hash_object (t
, 0);
26097 /* Compare two 'auto's. */
26100 auto_hash::equal (tree t1
, tree t2
)
26105 tree c1
= PLACEHOLDER_TYPE_CONSTRAINTS (t1
);
26106 tree c2
= PLACEHOLDER_TYPE_CONSTRAINTS (t2
);
26108 /* Two unconstrained autos are distinct. */
26112 return equivalent_placeholder_constraints (c1
, c2
);
26115 /* for_each_template_parm callback for extract_autos: if t is a (possibly
26116 constrained) auto, add it to the vector. */
26119 extract_autos_r (tree t
, void *data
)
26121 hash_table
<auto_hash
> &hash
= *(hash_table
<auto_hash
>*)data
;
26124 /* All the autos were built with index 0; fix that up now. */
26125 tree
*p
= hash
.find_slot (t
, INSERT
);
26128 /* If this is a repeated constrained-type-specifier, use the index we
26130 idx
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (*p
));
26133 /* Otherwise this is new, so use the current count. */
26135 idx
= hash
.elements () - 1;
26137 TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (t
)) = idx
;
26140 /* Always keep walking. */
26144 /* Return a TREE_VEC of the 'auto's used in type under the Concepts TS, which
26145 says they can appear anywhere in the type. */
26148 extract_autos (tree type
)
26150 hash_set
<tree
> visited
;
26151 hash_table
<auto_hash
> hash (2);
26153 for_each_template_parm (type
, extract_autos_r
, &hash
, &visited
, true);
26155 tree tree_vec
= make_tree_vec (hash
.elements());
26156 for (hash_table
<auto_hash
>::iterator iter
= hash
.begin();
26157 iter
!= hash
.end(); ++iter
)
26160 unsigned i
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (elt
));
26161 TREE_VEC_ELT (tree_vec
, i
)
26162 = build_tree_list (NULL_TREE
, TYPE_NAME (elt
));
26168 /* The stem for deduction guide names. */
26169 const char *const dguide_base
= "__dguide_";
26171 /* Return the name for a deduction guide for class template TMPL. */
26174 dguide_name (tree tmpl
)
26176 tree type
= (TYPE_P (tmpl
) ? tmpl
: TREE_TYPE (tmpl
));
26177 tree tname
= TYPE_IDENTIFIER (type
);
26178 char *buf
= (char *) alloca (1 + strlen (dguide_base
)
26179 + IDENTIFIER_LENGTH (tname
));
26180 memcpy (buf
, dguide_base
, strlen (dguide_base
));
26181 memcpy (buf
+ strlen (dguide_base
), IDENTIFIER_POINTER (tname
),
26182 IDENTIFIER_LENGTH (tname
) + 1);
26183 tree dname
= get_identifier (buf
);
26184 TREE_TYPE (dname
) = type
;
26188 /* True if NAME is the name of a deduction guide. */
26191 dguide_name_p (tree name
)
26193 return (TREE_CODE (name
) == IDENTIFIER_NODE
26194 && TREE_TYPE (name
)
26195 && !strncmp (IDENTIFIER_POINTER (name
), dguide_base
,
26196 strlen (dguide_base
)));
26199 /* True if FN is a deduction guide. */
26202 deduction_guide_p (const_tree fn
)
26205 if (tree name
= DECL_NAME (fn
))
26206 return dguide_name_p (name
);
26210 /* True if FN is the copy deduction guide, i.e. A(A)->A. */
26213 copy_guide_p (const_tree fn
)
26215 gcc_assert (deduction_guide_p (fn
));
26216 if (!DECL_ARTIFICIAL (fn
))
26218 tree parms
= FUNCTION_FIRST_USER_PARMTYPE (DECL_TI_TEMPLATE (fn
));
26219 return (TREE_CHAIN (parms
) == void_list_node
26220 && same_type_p (TREE_VALUE (parms
), TREE_TYPE (DECL_NAME (fn
))));
26223 /* True if FN is a guide generated from a constructor template. */
26226 template_guide_p (const_tree fn
)
26228 gcc_assert (deduction_guide_p (fn
));
26229 if (!DECL_ARTIFICIAL (fn
))
26231 tree tmpl
= DECL_TI_TEMPLATE (fn
);
26232 if (tree org
= DECL_ABSTRACT_ORIGIN (tmpl
))
26233 return PRIMARY_TEMPLATE_P (org
);
26237 /* OLDDECL is a _DECL for a template parameter. Return a similar parameter at
26238 LEVEL:INDEX, using tsubst_args and complain for substitution into non-type
26239 template parameter types. Note that the handling of template template
26240 parameters relies on current_template_parms being set appropriately for the
26244 rewrite_template_parm (tree olddecl
, unsigned index
, unsigned level
,
26245 tree tsubst_args
, tsubst_flags_t complain
)
26247 if (olddecl
== error_mark_node
)
26248 return error_mark_node
;
26250 tree oldidx
= get_template_parm_index (olddecl
);
26253 if (TREE_CODE (olddecl
) == TYPE_DECL
26254 || TREE_CODE (olddecl
) == TEMPLATE_DECL
)
26256 tree oldtype
= TREE_TYPE (olddecl
);
26257 newtype
= cxx_make_type (TREE_CODE (oldtype
));
26258 TYPE_MAIN_VARIANT (newtype
) = newtype
;
26259 if (TREE_CODE (oldtype
) == TEMPLATE_TYPE_PARM
)
26260 TEMPLATE_TYPE_PARM_FOR_CLASS (newtype
)
26261 = TEMPLATE_TYPE_PARM_FOR_CLASS (oldtype
);
26265 newtype
= TREE_TYPE (olddecl
);
26266 if (type_uses_auto (newtype
))
26268 // Substitute once to fix references to other template parameters.
26269 newtype
= tsubst (newtype
, tsubst_args
,
26270 complain
|tf_partial
, NULL_TREE
);
26271 // Now substitute again to reduce the level of the auto.
26272 newtype
= tsubst (newtype
, current_template_args (),
26273 complain
, NULL_TREE
);
26276 newtype
= tsubst (newtype
, tsubst_args
,
26277 complain
, NULL_TREE
);
26281 = build_decl (DECL_SOURCE_LOCATION (olddecl
), TREE_CODE (olddecl
),
26282 DECL_NAME (olddecl
), newtype
);
26283 SET_DECL_TEMPLATE_PARM_P (newdecl
);
26286 if (TREE_CODE (olddecl
) == TYPE_DECL
26287 || TREE_CODE (olddecl
) == TEMPLATE_DECL
)
26289 newidx
= TEMPLATE_TYPE_PARM_INDEX (newtype
)
26290 = build_template_parm_index (index
, level
, level
,
26292 TEMPLATE_PARM_PARAMETER_PACK (newidx
)
26293 = TEMPLATE_PARM_PARAMETER_PACK (oldidx
);
26294 TYPE_STUB_DECL (newtype
) = TYPE_NAME (newtype
) = newdecl
;
26295 TYPE_CANONICAL (newtype
) = canonical_type_parameter (newtype
);
26297 if (TREE_CODE (olddecl
) == TEMPLATE_DECL
)
26299 DECL_TEMPLATE_RESULT (newdecl
)
26300 = build_decl (DECL_SOURCE_LOCATION (olddecl
), TYPE_DECL
,
26301 DECL_NAME (olddecl
), newtype
);
26302 DECL_ARTIFICIAL (DECL_TEMPLATE_RESULT (newdecl
)) = true;
26303 // First create a copy (ttargs) of tsubst_args with an
26304 // additional level for the template template parameter's own
26305 // template parameters (ttparms).
26306 tree ttparms
= (INNERMOST_TEMPLATE_PARMS
26307 (DECL_TEMPLATE_PARMS (olddecl
)));
26308 const int depth
= TMPL_ARGS_DEPTH (tsubst_args
);
26309 tree ttargs
= make_tree_vec (depth
+ 1);
26310 for (int i
= 0; i
< depth
; ++i
)
26311 TREE_VEC_ELT (ttargs
, i
) = TREE_VEC_ELT (tsubst_args
, i
);
26312 TREE_VEC_ELT (ttargs
, depth
)
26313 = template_parms_level_to_args (ttparms
);
26314 // Substitute ttargs into ttparms to fix references to
26315 // other template parameters.
26316 ttparms
= tsubst_template_parms_level (ttparms
, ttargs
,
26317 complain
|tf_partial
);
26318 // Now substitute again with args based on tparms, to reduce
26319 // the level of the ttparms.
26320 ttargs
= current_template_args ();
26321 ttparms
= tsubst_template_parms_level (ttparms
, ttargs
,
26323 // Finally, tack the adjusted parms onto tparms.
26324 ttparms
= tree_cons (size_int (depth
), ttparms
,
26325 current_template_parms
);
26326 DECL_TEMPLATE_PARMS (newdecl
) = ttparms
;
26331 tree oldconst
= TEMPLATE_PARM_DECL (oldidx
);
26333 = build_decl (DECL_SOURCE_LOCATION (oldconst
),
26334 TREE_CODE (oldconst
),
26335 DECL_NAME (oldconst
), newtype
);
26336 TREE_CONSTANT (newconst
) = TREE_CONSTANT (newdecl
)
26337 = TREE_READONLY (newconst
) = TREE_READONLY (newdecl
) = true;
26338 SET_DECL_TEMPLATE_PARM_P (newconst
);
26339 newidx
= build_template_parm_index (index
, level
, level
,
26340 newconst
, newtype
);
26341 TEMPLATE_PARM_PARAMETER_PACK (newidx
)
26342 = TEMPLATE_PARM_PARAMETER_PACK (oldidx
);
26343 DECL_INITIAL (newdecl
) = DECL_INITIAL (newconst
) = newidx
;
26349 /* Returns a C++17 class deduction guide template based on the constructor
26350 CTOR. As a special case, CTOR can be a RECORD_TYPE for an implicit default
26351 guide, or REFERENCE_TYPE for an implicit copy/move guide. */
26354 build_deduction_guide (tree ctor
, tree outer_args
, tsubst_flags_t complain
)
26356 tree type
, tparms
, targs
, fparms
, fargs
, ci
;
26357 bool memtmpl
= false;
26360 tree fn_tmpl
= NULL_TREE
;
26365 bool copy_p
= TYPE_REF_P (type
);
26368 type
= TREE_TYPE (type
);
26369 fparms
= tree_cons (NULL_TREE
, type
, void_list_node
);
26372 fparms
= void_list_node
;
26374 tree ctmpl
= CLASSTYPE_TI_TEMPLATE (type
);
26375 tparms
= DECL_TEMPLATE_PARMS (ctmpl
);
26376 targs
= CLASSTYPE_TI_ARGS (type
);
26379 loc
= DECL_SOURCE_LOCATION (ctmpl
);
26380 explicit_p
= false;
26384 ++processing_template_decl
;
26388 = (TREE_CODE (ctor
) == TEMPLATE_DECL
? ctor
26389 : DECL_TI_TEMPLATE (ctor
));
26391 fn_tmpl
= tsubst (fn_tmpl
, outer_args
, complain
, ctor
);
26392 ctor
= DECL_TEMPLATE_RESULT (fn_tmpl
);
26394 type
= DECL_CONTEXT (ctor
);
26396 tparms
= DECL_TEMPLATE_PARMS (fn_tmpl
);
26397 /* If type is a member class template, DECL_TI_ARGS (ctor) will have
26398 fully specialized args for the enclosing class. Strip those off, as
26399 the deduction guide won't have those template parameters. */
26400 targs
= get_innermost_template_args (DECL_TI_ARGS (ctor
),
26401 TMPL_PARMS_DEPTH (tparms
));
26402 /* Discard the 'this' parameter. */
26403 fparms
= FUNCTION_ARG_CHAIN (ctor
);
26404 fargs
= TREE_CHAIN (DECL_ARGUMENTS (ctor
));
26405 ci
= get_constraints (ctor
);
26406 loc
= DECL_SOURCE_LOCATION (ctor
);
26407 explicit_p
= DECL_NONCONVERTING_P (ctor
);
26409 if (PRIMARY_TEMPLATE_P (fn_tmpl
))
26413 /* For a member template constructor, we need to flatten the two
26414 template parameter lists into one, and then adjust the function
26415 signature accordingly. This gets...complicated. */
26416 tree save_parms
= current_template_parms
;
26418 /* For a member template we should have two levels of parms/args, one
26419 for the class and one for the constructor. We stripped
26420 specialized args for further enclosing classes above. */
26421 const int depth
= 2;
26422 gcc_assert (TMPL_ARGS_DEPTH (targs
) == depth
);
26424 /* Template args for translating references to the two-level template
26425 parameters into references to the one-level template parameters we
26427 tree tsubst_args
= copy_node (targs
);
26428 TMPL_ARGS_LEVEL (tsubst_args
, depth
)
26429 = copy_node (TMPL_ARGS_LEVEL (tsubst_args
, depth
));
26431 /* Template parms for the constructor template. */
26432 tree ftparms
= TREE_VALUE (tparms
);
26433 unsigned flen
= TREE_VEC_LENGTH (ftparms
);
26434 /* Template parms for the class template. */
26435 tparms
= TREE_CHAIN (tparms
);
26436 tree ctparms
= TREE_VALUE (tparms
);
26437 unsigned clen
= TREE_VEC_LENGTH (ctparms
);
26438 /* Template parms for the deduction guide start as a copy of the
26439 template parms for the class. We set current_template_parms for
26440 lookup_template_class_1. */
26441 current_template_parms
= tparms
= copy_node (tparms
);
26442 tree new_vec
= TREE_VALUE (tparms
) = make_tree_vec (flen
+ clen
);
26443 for (unsigned i
= 0; i
< clen
; ++i
)
26444 TREE_VEC_ELT (new_vec
, i
) = TREE_VEC_ELT (ctparms
, i
);
26446 /* Now we need to rewrite the constructor parms to append them to the
26448 for (unsigned i
= 0; i
< flen
; ++i
)
26450 unsigned index
= i
+ clen
;
26451 unsigned level
= 1;
26452 tree oldelt
= TREE_VEC_ELT (ftparms
, i
);
26453 tree olddecl
= TREE_VALUE (oldelt
);
26454 tree newdecl
= rewrite_template_parm (olddecl
, index
, level
,
26455 tsubst_args
, complain
);
26456 if (newdecl
== error_mark_node
)
26458 tree newdef
= tsubst_template_arg (TREE_PURPOSE (oldelt
),
26459 tsubst_args
, complain
, ctor
);
26460 tree list
= build_tree_list (newdef
, newdecl
);
26461 TEMPLATE_PARM_CONSTRAINTS (list
)
26462 = tsubst_constraint_info (TEMPLATE_PARM_CONSTRAINTS (oldelt
),
26463 tsubst_args
, complain
, ctor
);
26464 TREE_VEC_ELT (new_vec
, index
) = list
;
26465 TMPL_ARG (tsubst_args
, depth
, i
) = template_parm_to_arg (list
);
26468 /* Now we have a final set of template parms to substitute into the
26469 function signature. */
26470 targs
= template_parms_to_args (tparms
);
26471 fparms
= tsubst_arg_types (fparms
, tsubst_args
, NULL_TREE
,
26473 fargs
= tsubst (fargs
, tsubst_args
, complain
, ctor
);
26475 ci
= tsubst_constraint_info (ci
, tsubst_args
, complain
, ctor
);
26477 current_template_parms
= save_parms
;
26480 --processing_template_decl
;
26482 return error_mark_node
;
26487 /* Copy the parms so we can set DECL_PRIMARY_TEMPLATE. */
26488 tparms
= copy_node (tparms
);
26489 INNERMOST_TEMPLATE_PARMS (tparms
)
26490 = copy_node (INNERMOST_TEMPLATE_PARMS (tparms
));
26493 tree fntype
= build_function_type (type
, fparms
);
26494 tree ded_fn
= build_lang_decl_loc (loc
,
26496 dguide_name (type
), fntype
);
26497 DECL_ARGUMENTS (ded_fn
) = fargs
;
26498 DECL_ARTIFICIAL (ded_fn
) = true;
26499 DECL_NONCONVERTING_P (ded_fn
) = explicit_p
;
26500 tree ded_tmpl
= build_template_decl (ded_fn
, tparms
, /*member*/false);
26501 DECL_ARTIFICIAL (ded_tmpl
) = true;
26502 DECL_TEMPLATE_RESULT (ded_tmpl
) = ded_fn
;
26503 TREE_TYPE (ded_tmpl
) = TREE_TYPE (ded_fn
);
26504 DECL_TEMPLATE_INFO (ded_fn
) = build_template_info (ded_tmpl
, targs
);
26505 DECL_PRIMARY_TEMPLATE (ded_tmpl
) = ded_tmpl
;
26507 DECL_ABSTRACT_ORIGIN (ded_tmpl
) = fn_tmpl
;
26509 set_constraints (ded_tmpl
, ci
);
26514 /* Deduce template arguments for the class template placeholder PTYPE for
26515 template TMPL based on the initializer INIT, and return the resulting
26519 do_class_deduction (tree ptype
, tree tmpl
, tree init
, int flags
,
26520 tsubst_flags_t complain
)
26522 if (!DECL_CLASS_TEMPLATE_P (tmpl
))
26524 /* We should have handled this in the caller. */
26525 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
))
26527 if (complain
& tf_error
)
26528 error ("non-class template %qT used without template arguments", tmpl
);
26529 return error_mark_node
;
26532 tree type
= TREE_TYPE (tmpl
);
26534 bool try_list_ctor
= false;
26536 vec
<tree
,va_gc
> *args
;
26537 if (init
== NULL_TREE
26538 || TREE_CODE (init
) == TREE_LIST
)
26539 args
= make_tree_vector_from_list (init
);
26540 else if (BRACE_ENCLOSED_INITIALIZER_P (init
))
26542 try_list_ctor
= TYPE_HAS_LIST_CTOR (type
);
26543 if (try_list_ctor
&& CONSTRUCTOR_NELTS (init
) == 1)
26545 /* As an exception, the first phase in 16.3.1.7 (considering the
26546 initializer list as a single argument) is omitted if the
26547 initializer list consists of a single expression of type cv U,
26548 where U is a specialization of C or a class derived from a
26549 specialization of C. */
26550 tree elt
= CONSTRUCTOR_ELT (init
, 0)->value
;
26551 tree etype
= TREE_TYPE (elt
);
26553 tree tparms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
26554 tree targs
= make_tree_vec (TREE_VEC_LENGTH (tparms
));
26555 int err
= unify (tparms
, targs
, type
, etype
,
26556 UNIFY_ALLOW_DERIVED
, /*explain*/false);
26558 try_list_ctor
= false;
26561 if (try_list_ctor
|| is_std_init_list (type
))
26562 args
= make_tree_vector_single (init
);
26564 args
= make_tree_vector_from_ctor (init
);
26567 args
= make_tree_vector_single (init
);
26569 tree dname
= dguide_name (tmpl
);
26570 tree cands
= lookup_qualified_name (CP_DECL_CONTEXT (tmpl
), dname
,
26571 /*type*/false, /*complain*/false,
26573 bool elided
= false;
26574 if (cands
== error_mark_node
)
26577 /* Prune explicit deduction guides in copy-initialization context. */
26578 if (flags
& LOOKUP_ONLYCONVERTING
)
26580 for (lkp_iterator
iter (cands
); !elided
&& iter
; ++iter
)
26581 if (DECL_NONCONVERTING_P (STRIP_TEMPLATE (*iter
)))
26586 /* Found a nonconverting guide, prune the candidates. */
26587 tree pruned
= NULL_TREE
;
26588 for (lkp_iterator
iter (cands
); iter
; ++iter
)
26589 if (!DECL_NONCONVERTING_P (STRIP_TEMPLATE (*iter
)))
26590 pruned
= lookup_add (*iter
, pruned
);
26596 tree outer_args
= NULL_TREE
;
26597 if (DECL_CLASS_SCOPE_P (tmpl
)
26598 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (tmpl
)))
26600 outer_args
= CLASSTYPE_TI_ARGS (DECL_CONTEXT (tmpl
));
26601 type
= TREE_TYPE (most_general_template (tmpl
));
26604 bool saw_ctor
= false;
26605 // FIXME cache artificial deduction guides
26606 for (ovl_iterator
iter (CLASSTYPE_CONSTRUCTORS (type
)); iter
; ++iter
)
26608 /* Skip inherited constructors. */
26609 if (iter
.using_p ())
26612 tree guide
= build_deduction_guide (*iter
, outer_args
, complain
);
26613 if (guide
== error_mark_node
)
26614 return error_mark_node
;
26615 if ((flags
& LOOKUP_ONLYCONVERTING
)
26616 && DECL_NONCONVERTING_P (STRIP_TEMPLATE (guide
)))
26619 cands
= lookup_add (guide
, cands
);
26624 tree call
= error_mark_node
;
26626 /* If this is list-initialization and the class has a list constructor, first
26627 try deducing from the list as a single argument, as [over.match.list]. */
26628 tree list_cands
= NULL_TREE
;
26629 if (try_list_ctor
&& cands
)
26630 for (lkp_iterator
iter (cands
); iter
; ++iter
)
26633 if (is_list_ctor (dg
))
26634 list_cands
= lookup_add (dg
, list_cands
);
26638 ++cp_unevaluated_operand
;
26639 call
= build_new_function_call (list_cands
, &args
, tf_decltype
);
26640 --cp_unevaluated_operand
;
26642 if (call
== error_mark_node
)
26644 /* That didn't work, now try treating the list as a sequence of
26646 release_tree_vector (args
);
26647 args
= make_tree_vector_from_ctor (init
);
26651 /* Maybe generate an implicit deduction guide. */
26652 if (call
== error_mark_node
&& args
->length () < 2)
26654 tree gtype
= NULL_TREE
;
26656 if (args
->length () == 1)
26657 /* Generate a copy guide. */
26658 gtype
= build_reference_type (type
);
26659 else if (!saw_ctor
)
26660 /* Generate a default guide. */
26665 tree guide
= build_deduction_guide (gtype
, outer_args
, complain
);
26666 if (guide
== error_mark_node
)
26667 return error_mark_node
;
26668 cands
= lookup_add (guide
, cands
);
26672 if (elided
&& !cands
)
26674 error ("cannot deduce template arguments for copy-initialization"
26675 " of %qT, as it has no non-explicit deduction guides or "
26676 "user-declared constructors", type
);
26677 return error_mark_node
;
26679 else if (!cands
&& call
== error_mark_node
)
26681 error ("cannot deduce template arguments of %qT, as it has no viable "
26682 "deduction guides", type
);
26683 return error_mark_node
;
26686 if (call
== error_mark_node
)
26688 ++cp_unevaluated_operand
;
26689 call
= build_new_function_call (cands
, &args
, tf_decltype
);
26690 --cp_unevaluated_operand
;
26693 if (call
== error_mark_node
&& (complain
& tf_warning_or_error
))
26695 error ("class template argument deduction failed:");
26697 ++cp_unevaluated_operand
;
26698 call
= build_new_function_call (cands
, &args
, complain
| tf_decltype
);
26699 --cp_unevaluated_operand
;
26702 inform (input_location
, "explicit deduction guides not considered "
26703 "for copy-initialization");
26706 release_tree_vector (args
);
26708 return cp_build_qualified_type (TREE_TYPE (call
), cp_type_quals (ptype
));
26711 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
26712 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE.
26713 The CONTEXT determines the context in which auto deduction is performed
26714 and is used to control error diagnostics. FLAGS are the LOOKUP_* flags.
26715 OUTER_TARGS are used during template argument deduction
26716 (context == adc_unify) to properly substitute the result, and is ignored
26719 For partial-concept-ids, extra args may be appended to the list of deduced
26720 template arguments prior to determining constraint satisfaction. */
26723 do_auto_deduction (tree type
, tree init
, tree auto_node
,
26724 tsubst_flags_t complain
, auto_deduction_context context
,
26725 tree outer_targs
, int flags
)
26729 if (init
== error_mark_node
)
26730 return error_mark_node
;
26732 if (init
&& type_dependent_expression_p (init
)
26733 && context
!= adc_unify
)
26734 /* Defining a subset of type-dependent expressions that we can deduce
26735 from ahead of time isn't worth the trouble. */
26738 /* Similarly, we can't deduce from another undeduced decl. */
26739 if (init
&& undeduced_auto_decl (init
))
26742 if (tree tmpl
= CLASS_PLACEHOLDER_TEMPLATE (auto_node
))
26743 /* C++17 class template argument deduction. */
26744 return do_class_deduction (type
, tmpl
, init
, flags
, complain
);
26746 if (init
== NULL_TREE
|| TREE_TYPE (init
) == NULL_TREE
)
26747 /* Nothing we can do with this, even in deduction context. */
26750 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
26751 with either a new invented type template parameter U or, if the
26752 initializer is a braced-init-list (8.5.4), with
26753 std::initializer_list<U>. */
26754 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
26756 if (!DIRECT_LIST_INIT_P (init
))
26757 type
= listify_autos (type
, auto_node
);
26758 else if (CONSTRUCTOR_NELTS (init
) == 1)
26759 init
= CONSTRUCTOR_ELT (init
, 0)->value
;
26762 if (complain
& tf_warning_or_error
)
26764 if (permerror (input_location
, "direct-list-initialization of "
26765 "%<auto%> requires exactly one element"))
26766 inform (input_location
,
26767 "for deduction to %<std::initializer_list%>, use copy-"
26768 "list-initialization (i.e. add %<=%> before the %<{%>)");
26770 type
= listify_autos (type
, auto_node
);
26774 if (type
== error_mark_node
)
26775 return error_mark_node
;
26777 init
= resolve_nondeduced_context (init
, complain
);
26779 if (context
== adc_decomp_type
26780 && auto_node
== type
26781 && init
!= error_mark_node
26782 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
26783 /* [dcl.decomp]/1 - if decomposition declaration has no ref-qualifiers
26784 and initializer has array type, deduce cv-qualified array type. */
26785 return cp_build_qualified_type_real (TREE_TYPE (init
), TYPE_QUALS (type
),
26787 else if (AUTO_IS_DECLTYPE (auto_node
))
26789 bool id
= (DECL_P (init
)
26790 || ((TREE_CODE (init
) == COMPONENT_REF
26791 || TREE_CODE (init
) == SCOPE_REF
)
26792 && !REF_PARENTHESIZED_P (init
)));
26793 targs
= make_tree_vec (1);
26794 TREE_VEC_ELT (targs
, 0)
26795 = finish_decltype_type (init
, id
, tf_warning_or_error
);
26796 if (type
!= auto_node
)
26798 if (complain
& tf_error
)
26799 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
26800 return error_mark_node
;
26805 tree parms
= build_tree_list (NULL_TREE
, type
);
26809 tparms
= extract_autos (type
);
26812 tparms
= make_tree_vec (1);
26813 TREE_VEC_ELT (tparms
, 0)
26814 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
26817 targs
= make_tree_vec (TREE_VEC_LENGTH (tparms
));
26818 int val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
26820 NULL
, /*explain_p=*/false);
26823 if (processing_template_decl
)
26824 /* Try again at instantiation time. */
26826 if (type
&& type
!= error_mark_node
26827 && (complain
& tf_error
))
26828 /* If type is error_mark_node a diagnostic must have been
26829 emitted by now. Also, having a mention to '<type error>'
26830 in the diagnostic is not really useful to the user. */
26832 if (cfun
&& auto_node
== current_function_auto_return_pattern
26833 && LAMBDA_FUNCTION_P (current_function_decl
))
26834 error ("unable to deduce lambda return type from %qE", init
);
26836 error ("unable to deduce %qT from %qE", type
, init
);
26837 type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
26839 NULL
, /*explain_p=*/true);
26841 return error_mark_node
;
26845 /* Check any placeholder constraints against the deduced type. */
26846 if (flag_concepts
&& !processing_template_decl
)
26847 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (auto_node
))
26849 /* Use the deduced type to check the associated constraints. If we
26850 have a partial-concept-id, rebuild the argument list so that
26851 we check using the extra arguments. */
26852 gcc_assert (TREE_CODE (constr
) == CHECK_CONSTR
);
26853 tree cargs
= CHECK_CONSTR_ARGS (constr
);
26854 if (TREE_VEC_LENGTH (cargs
) > 1)
26856 cargs
= copy_node (cargs
);
26857 TREE_VEC_ELT (cargs
, 0) = TREE_VEC_ELT (targs
, 0);
26861 if (!constraints_satisfied_p (constr
, cargs
))
26863 if (complain
& tf_warning_or_error
)
26867 case adc_unspecified
:
26869 error("placeholder constraints not satisfied");
26871 case adc_variable_type
:
26872 case adc_decomp_type
:
26873 error ("deduced initializer does not satisfy "
26874 "placeholder constraints");
26876 case adc_return_type
:
26877 error ("deduced return type does not satisfy "
26878 "placeholder constraints");
26880 case adc_requirement
:
26881 error ("deduced expression type does not satisfy "
26882 "placeholder constraints");
26885 diagnose_constraints (input_location
, constr
, targs
);
26887 return error_mark_node
;
26891 if (processing_template_decl
&& context
!= adc_unify
)
26892 outer_targs
= current_template_args ();
26893 targs
= add_to_template_args (outer_targs
, targs
);
26894 return tsubst (type
, targs
, complain
, NULL_TREE
);
26897 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
26901 splice_late_return_type (tree type
, tree late_return_type
)
26903 if (is_auto (type
))
26905 if (late_return_type
)
26906 return late_return_type
;
26908 tree idx
= get_template_parm_index (type
);
26909 if (TEMPLATE_PARM_LEVEL (idx
) <= processing_template_decl
)
26910 /* In an abbreviated function template we didn't know we were dealing
26911 with a function template when we saw the auto return type, so update
26912 it to have the correct level. */
26913 return make_auto_1 (TYPE_IDENTIFIER (type
), true);
26918 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
26919 'decltype(auto)' or a deduced class template. */
26922 is_auto (const_tree type
)
26924 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
26925 && (TYPE_IDENTIFIER (type
) == auto_identifier
26926 || TYPE_IDENTIFIER (type
) == decltype_auto_identifier
26927 || CLASS_PLACEHOLDER_TEMPLATE (type
)))
26933 /* for_each_template_parm callback for type_uses_auto. */
26936 is_auto_r (tree tp
, void */
*data*/
)
26938 return is_auto (tp
);
26941 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
26942 a use of `auto'. Returns NULL_TREE otherwise. */
26945 type_uses_auto (tree type
)
26947 if (type
== NULL_TREE
)
26949 else if (flag_concepts
)
26951 /* The Concepts TS allows multiple autos in one type-specifier; just
26952 return the first one we find, do_auto_deduction will collect all of
26954 if (uses_template_parms (type
))
26955 return for_each_template_parm (type
, is_auto_r
, /*data*/NULL
,
26956 /*visited*/NULL
, /*nondeduced*/false);
26961 return find_type_usage (type
, is_auto
);
26964 /* Report ill-formed occurrences of auto types in ARGUMENTS. If
26965 concepts are enabled, auto is acceptable in template arguments, but
26966 only when TEMPL identifies a template class. Return TRUE if any
26967 such errors were reported. */
26970 check_auto_in_tmpl_args (tree tmpl
, tree args
)
26972 /* If there were previous errors, nevermind. */
26973 if (!args
|| TREE_CODE (args
) != TREE_VEC
)
26976 /* If TMPL is an identifier, we're parsing and we can't tell yet
26977 whether TMPL is supposed to be a type, a function or a variable.
26978 We'll only be able to tell during template substitution, so we
26979 expect to be called again then. If concepts are enabled and we
26980 know we have a type, we're ok. */
26982 && (identifier_p (tmpl
)
26984 && (DECL_TYPE_TEMPLATE_P (tmpl
)
26985 || DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)))))
26988 /* Quickly search for any occurrences of auto; usually there won't
26989 be any, and then we'll avoid allocating the vector. */
26990 if (!type_uses_auto (args
))
26993 bool errors
= false;
26995 tree vec
= extract_autos (args
);
26996 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); i
++)
26998 tree xauto
= TREE_VALUE (TREE_VEC_ELT (vec
, i
));
26999 error_at (DECL_SOURCE_LOCATION (xauto
),
27000 "invalid use of %qT in template argument", xauto
);
27007 /* For a given template T, return the vector of typedefs referenced
27008 in T for which access check is needed at T instantiation time.
27009 T is either a FUNCTION_DECL or a RECORD_TYPE.
27010 Those typedefs were added to T by the function
27011 append_type_to_template_for_access_check. */
27013 vec
<qualified_typedef_usage_t
, va_gc
> *
27014 get_types_needing_access_check (tree t
)
27017 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
27019 if (!t
|| t
== error_mark_node
)
27022 if (!(ti
= get_template_info (t
)))
27025 if (CLASS_TYPE_P (t
)
27026 || TREE_CODE (t
) == FUNCTION_DECL
)
27028 if (!TI_TEMPLATE (ti
))
27031 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
27037 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
27038 tied to T. That list of typedefs will be access checked at
27039 T instantiation time.
27040 T is either a FUNCTION_DECL or a RECORD_TYPE.
27041 TYPE_DECL is a TYPE_DECL node representing a typedef.
27042 SCOPE is the scope through which TYPE_DECL is accessed.
27043 LOCATION is the location of the usage point of TYPE_DECL.
27045 This function is a subroutine of
27046 append_type_to_template_for_access_check. */
27049 append_type_to_template_for_access_check_1 (tree t
,
27052 location_t location
)
27054 qualified_typedef_usage_t typedef_usage
;
27057 if (!t
|| t
== error_mark_node
)
27060 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
27061 || CLASS_TYPE_P (t
))
27063 && TREE_CODE (type_decl
) == TYPE_DECL
27066 if (!(ti
= get_template_info (t
)))
27069 gcc_assert (TI_TEMPLATE (ti
));
27071 typedef_usage
.typedef_decl
= type_decl
;
27072 typedef_usage
.context
= scope
;
27073 typedef_usage
.locus
= location
;
27075 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
27078 /* Append TYPE_DECL to the template TEMPL.
27079 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
27080 At TEMPL instanciation time, TYPE_DECL will be checked to see
27081 if it can be accessed through SCOPE.
27082 LOCATION is the location of the usage point of TYPE_DECL.
27084 e.g. consider the following code snippet:
27091 template<class U> struct S
27093 C::myint mi; // <-- usage point of the typedef C::myint
27098 At S<char> instantiation time, we need to check the access of C::myint
27099 In other words, we need to check the access of the myint typedef through
27100 the C scope. For that purpose, this function will add the myint typedef
27101 and the scope C through which its being accessed to a list of typedefs
27102 tied to the template S. That list will be walked at template instantiation
27103 time and access check performed on each typedefs it contains.
27104 Note that this particular code snippet should yield an error because
27105 myint is private to C. */
27108 append_type_to_template_for_access_check (tree templ
,
27111 location_t location
)
27113 qualified_typedef_usage_t
*iter
;
27116 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
27118 /* Make sure we don't append the type to the template twice. */
27119 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
27120 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
27123 append_type_to_template_for_access_check_1 (templ
, type_decl
,
27127 /* Convert the generic type parameters in PARM that match the types given in the
27128 range [START_IDX, END_IDX) from the current_template_parms into generic type
27132 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
27134 tree current
= current_template_parms
;
27135 int depth
= TMPL_PARMS_DEPTH (current
);
27136 current
= INNERMOST_TEMPLATE_PARMS (current
);
27137 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
27139 for (int i
= 0; i
< start_idx
; ++i
)
27140 TREE_VEC_ELT (replacement
, i
)
27141 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
27143 for (int i
= start_idx
; i
< end_idx
; ++i
)
27145 /* Create a distinct parameter pack type from the current parm and add it
27146 to the replacement args to tsubst below into the generic function
27149 tree o
= TREE_TYPE (TREE_VALUE
27150 (TREE_VEC_ELT (current
, i
)));
27151 tree t
= copy_type (o
);
27152 TEMPLATE_TYPE_PARM_INDEX (t
)
27153 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
27155 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
27156 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
27157 TYPE_MAIN_VARIANT (t
) = t
;
27158 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
27159 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
27160 TREE_VEC_ELT (replacement
, i
) = t
;
27161 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
27164 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
27165 TREE_VEC_ELT (replacement
, i
)
27166 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
27168 /* If there are more levels then build up the replacement with the outer
27171 replacement
= add_to_template_args (template_parms_to_args
27172 (TREE_CHAIN (current_template_parms
)),
27175 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
27178 /* Entries in the decl_constraint hash table. */
27179 struct GTY((for_user
)) constr_entry
27185 /* Hashing function and equality for constraint entries. */
27186 struct constr_hasher
: ggc_ptr_hash
<constr_entry
>
27188 static hashval_t
hash (constr_entry
*e
)
27190 return (hashval_t
)DECL_UID (e
->decl
);
27193 static bool equal (constr_entry
*e1
, constr_entry
*e2
)
27195 return e1
->decl
== e2
->decl
;
27199 /* A mapping from declarations to constraint information. Note that
27200 both templates and their underlying declarations are mapped to the
27201 same constraint information.
27203 FIXME: This is defined in pt.c because garbage collection
27204 code is not being generated for constraint.cc. */
27206 static GTY (()) hash_table
<constr_hasher
> *decl_constraints
;
27208 /* Returns the template constraints of declaration T. If T is not
27209 constrained, return NULL_TREE. Note that T must be non-null. */
27212 get_constraints (tree t
)
27214 if (!flag_concepts
)
27217 gcc_assert (DECL_P (t
));
27218 if (TREE_CODE (t
) == TEMPLATE_DECL
)
27219 t
= DECL_TEMPLATE_RESULT (t
);
27220 constr_entry elt
= { t
, NULL_TREE
};
27221 constr_entry
* found
= decl_constraints
->find (&elt
);
27228 /* Associate the given constraint information CI with the declaration
27229 T. If T is a template, then the constraints are associated with
27230 its underlying declaration. Don't build associations if CI is
27234 set_constraints (tree t
, tree ci
)
27238 gcc_assert (t
&& flag_concepts
);
27239 if (TREE_CODE (t
) == TEMPLATE_DECL
)
27240 t
= DECL_TEMPLATE_RESULT (t
);
27241 gcc_assert (!get_constraints (t
));
27242 constr_entry elt
= {t
, ci
};
27243 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, INSERT
);
27244 constr_entry
* entry
= ggc_alloc
<constr_entry
> ();
27249 /* Remove the associated constraints of the declaration T. */
27252 remove_constraints (tree t
)
27254 gcc_assert (DECL_P (t
));
27255 if (TREE_CODE (t
) == TEMPLATE_DECL
)
27256 t
= DECL_TEMPLATE_RESULT (t
);
27258 constr_entry elt
= {t
, NULL_TREE
};
27259 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, NO_INSERT
);
27261 decl_constraints
->clear_slot (slot
);
27264 /* Memoized satisfaction results for declarations. This
27265 maps the pair (constraint_info, arguments) to the result computed
27266 by constraints_satisfied_p. */
27268 struct GTY((for_user
)) constraint_sat_entry
27275 /* Hashing function and equality for constraint entries. */
27277 struct constraint_sat_hasher
: ggc_ptr_hash
<constraint_sat_entry
>
27279 static hashval_t
hash (constraint_sat_entry
*e
)
27281 hashval_t val
= iterative_hash_object(e
->ci
, 0);
27282 return iterative_hash_template_arg (e
->args
, val
);
27285 static bool equal (constraint_sat_entry
*e1
, constraint_sat_entry
*e2
)
27287 return e1
->ci
== e2
->ci
&& comp_template_args (e1
->args
, e2
->args
);
27291 /* Memoized satisfaction results for concept checks. */
27293 struct GTY((for_user
)) concept_spec_entry
27300 /* Hashing function and equality for constraint entries. */
27302 struct concept_spec_hasher
: ggc_ptr_hash
<concept_spec_entry
>
27304 static hashval_t
hash (concept_spec_entry
*e
)
27306 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
27309 static bool equal (concept_spec_entry
*e1
, concept_spec_entry
*e2
)
27311 ++comparing_specializations
;
27312 bool eq
= e1
->tmpl
== e2
->tmpl
&& comp_template_args (e1
->args
, e2
->args
);
27313 --comparing_specializations
;
27318 static GTY (()) hash_table
<constraint_sat_hasher
> *constraint_memos
;
27319 static GTY (()) hash_table
<concept_spec_hasher
> *concept_memos
;
27321 /* Search for a memoized satisfaction result. Returns one of the
27322 truth value nodes if previously memoized, or NULL_TREE otherwise. */
27325 lookup_constraint_satisfaction (tree ci
, tree args
)
27327 constraint_sat_entry elt
= { ci
, args
, NULL_TREE
};
27328 constraint_sat_entry
* found
= constraint_memos
->find (&elt
);
27330 return found
->result
;
27335 /* Memoize the result of a satisfication test. Returns the saved result. */
27338 memoize_constraint_satisfaction (tree ci
, tree args
, tree result
)
27340 constraint_sat_entry elt
= {ci
, args
, result
};
27341 constraint_sat_entry
** slot
= constraint_memos
->find_slot (&elt
, INSERT
);
27342 constraint_sat_entry
* entry
= ggc_alloc
<constraint_sat_entry
> ();
27348 /* Search for a memoized satisfaction result for a concept. */
27351 lookup_concept_satisfaction (tree tmpl
, tree args
)
27353 concept_spec_entry elt
= { tmpl
, args
, NULL_TREE
};
27354 concept_spec_entry
* found
= concept_memos
->find (&elt
);
27356 return found
->result
;
27361 /* Memoize the result of a concept check. Returns the saved result. */
27364 memoize_concept_satisfaction (tree tmpl
, tree args
, tree result
)
27366 concept_spec_entry elt
= {tmpl
, args
, result
};
27367 concept_spec_entry
** slot
= concept_memos
->find_slot (&elt
, INSERT
);
27368 concept_spec_entry
* entry
= ggc_alloc
<concept_spec_entry
> ();
27374 static GTY (()) hash_table
<concept_spec_hasher
> *concept_expansions
;
27376 /* Returns a prior concept specialization. This returns the substituted
27377 and normalized constraints defined by the concept. */
27380 get_concept_expansion (tree tmpl
, tree args
)
27382 concept_spec_entry elt
= { tmpl
, args
, NULL_TREE
};
27383 concept_spec_entry
* found
= concept_expansions
->find (&elt
);
27385 return found
->result
;
27390 /* Save a concept expansion for later. */
27393 save_concept_expansion (tree tmpl
, tree args
, tree def
)
27395 concept_spec_entry elt
= {tmpl
, args
, def
};
27396 concept_spec_entry
** slot
= concept_expansions
->find_slot (&elt
, INSERT
);
27397 concept_spec_entry
* entry
= ggc_alloc
<concept_spec_entry
> ();
27404 hash_subsumption_args (tree t1
, tree t2
)
27406 gcc_assert (TREE_CODE (t1
) == CHECK_CONSTR
);
27407 gcc_assert (TREE_CODE (t2
) == CHECK_CONSTR
);
27409 val
= iterative_hash_object (CHECK_CONSTR_CONCEPT (t1
), val
);
27410 val
= iterative_hash_template_arg (CHECK_CONSTR_ARGS (t1
), val
);
27411 val
= iterative_hash_object (CHECK_CONSTR_CONCEPT (t2
), val
);
27412 val
= iterative_hash_template_arg (CHECK_CONSTR_ARGS (t2
), val
);
27416 /* Compare the constraints of two subsumption entries. The LEFT1 and
27417 LEFT2 arguments comprise the first subsumption pair and the RIGHT1
27418 and RIGHT2 arguments comprise the second. These are all CHECK_CONSTRs. */
27421 comp_subsumption_args (tree left1
, tree left2
, tree right1
, tree right2
)
27423 if (CHECK_CONSTR_CONCEPT (left1
) == CHECK_CONSTR_CONCEPT (right1
))
27424 if (CHECK_CONSTR_CONCEPT (left2
) == CHECK_CONSTR_CONCEPT (right2
))
27425 if (comp_template_args (CHECK_CONSTR_ARGS (left1
),
27426 CHECK_CONSTR_ARGS (right1
)))
27427 return comp_template_args (CHECK_CONSTR_ARGS (left2
),
27428 CHECK_CONSTR_ARGS (right2
));
27432 /* Key/value pair for learning and memoizing subsumption results. This
27433 associates a pair of check constraints (including arguments) with
27434 a boolean value indicating the result. */
27436 struct GTY((for_user
)) subsumption_entry
27443 /* Hashing function and equality for constraint entries. */
27445 struct subsumption_hasher
: ggc_ptr_hash
<subsumption_entry
>
27447 static hashval_t
hash (subsumption_entry
*e
)
27449 return hash_subsumption_args (e
->t1
, e
->t2
);
27452 static bool equal (subsumption_entry
*e1
, subsumption_entry
*e2
)
27454 ++comparing_specializations
;
27455 bool eq
= comp_subsumption_args(e1
->t1
, e1
->t2
, e2
->t1
, e2
->t2
);
27456 --comparing_specializations
;
27461 static GTY (()) hash_table
<subsumption_hasher
> *subsumption_table
;
27463 /* Search for a previously cached subsumption result. */
27466 lookup_subsumption_result (tree t1
, tree t2
)
27468 subsumption_entry elt
= { t1
, t2
, false };
27469 subsumption_entry
* found
= subsumption_table
->find (&elt
);
27471 return &found
->result
;
27476 /* Save a subsumption result. */
27479 save_subsumption_result (tree t1
, tree t2
, bool result
)
27481 subsumption_entry elt
= {t1
, t2
, result
};
27482 subsumption_entry
** slot
= subsumption_table
->find_slot (&elt
, INSERT
);
27483 subsumption_entry
* entry
= ggc_alloc
<subsumption_entry
> ();
27489 /* Set up the hash table for constraint association. */
27492 init_constraint_processing (void)
27494 if (!flag_concepts
)
27497 decl_constraints
= hash_table
<constr_hasher
>::create_ggc(37);
27498 constraint_memos
= hash_table
<constraint_sat_hasher
>::create_ggc(37);
27499 concept_memos
= hash_table
<concept_spec_hasher
>::create_ggc(37);
27500 concept_expansions
= hash_table
<concept_spec_hasher
>::create_ggc(37);
27501 subsumption_table
= hash_table
<subsumption_hasher
>::create_ggc(37);
27504 /* __integer_pack(N) in a pack expansion expands to a sequence of numbers from
27508 declare_integer_pack (void)
27510 tree ipfn
= push_library_fn (get_identifier ("__integer_pack"),
27511 build_function_type_list (integer_type_node
,
27514 NULL_TREE
, ECF_CONST
);
27515 DECL_DECLARED_CONSTEXPR_P (ipfn
) = true;
27516 DECL_BUILT_IN_CLASS (ipfn
) = BUILT_IN_FRONTEND
;
27519 /* Set up the hash tables for template instantiations. */
27522 init_template_processing (void)
27524 decl_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
27525 type_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
27527 if (cxx_dialect
>= cxx11
)
27528 declare_integer_pack ();
27531 /* Print stats about the template hash tables for -fstats. */
27534 print_template_statistics (void)
27536 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
27537 "%f collisions\n", (long) decl_specializations
->size (),
27538 (long) decl_specializations
->elements (),
27539 decl_specializations
->collisions ());
27540 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
27541 "%f collisions\n", (long) type_specializations
->size (),
27542 (long) type_specializations
->elements (),
27543 type_specializations
->collisions ());
27548 namespace selftest
{
27550 /* Verify that build_non_dependent_expr () works, for various expressions,
27551 and that location wrappers don't affect the results. */
27554 test_build_non_dependent_expr ()
27556 location_t loc
= BUILTINS_LOCATION
;
27558 /* Verify constants, without and with location wrappers. */
27559 tree int_cst
= build_int_cst (integer_type_node
, 42);
27560 ASSERT_EQ (int_cst
, build_non_dependent_expr (int_cst
));
27562 tree wrapped_int_cst
= maybe_wrap_with_location (int_cst
, loc
);
27563 ASSERT_TRUE (location_wrapper_p (wrapped_int_cst
));
27564 ASSERT_EQ (wrapped_int_cst
, build_non_dependent_expr (wrapped_int_cst
));
27566 tree string_lit
= build_string (4, "foo");
27567 TREE_TYPE (string_lit
) = char_array_type_node
;
27568 string_lit
= fix_string_type (string_lit
);
27569 ASSERT_EQ (string_lit
, build_non_dependent_expr (string_lit
));
27571 tree wrapped_string_lit
= maybe_wrap_with_location (string_lit
, loc
);
27572 ASSERT_TRUE (location_wrapper_p (wrapped_string_lit
));
27573 ASSERT_EQ (wrapped_string_lit
,
27574 build_non_dependent_expr (wrapped_string_lit
));
27577 /* Verify that type_dependent_expression_p () works correctly, even
27578 in the presence of location wrapper nodes. */
27581 test_type_dependent_expression_p ()
27583 location_t loc
= BUILTINS_LOCATION
;
27585 tree name
= get_identifier ("foo");
27587 /* If no templates are involved, nothing is type-dependent. */
27588 gcc_assert (!processing_template_decl
);
27589 ASSERT_FALSE (type_dependent_expression_p (name
));
27591 ++processing_template_decl
;
27593 /* Within a template, an unresolved name is always type-dependent. */
27594 ASSERT_TRUE (type_dependent_expression_p (name
));
27596 /* Ensure it copes with NULL_TREE and errors. */
27597 ASSERT_FALSE (type_dependent_expression_p (NULL_TREE
));
27598 ASSERT_FALSE (type_dependent_expression_p (error_mark_node
));
27600 /* A USING_DECL in a template should be type-dependent, even if wrapped
27601 with a location wrapper (PR c++/83799). */
27602 tree using_decl
= build_lang_decl (USING_DECL
, name
, NULL_TREE
);
27603 TREE_TYPE (using_decl
) = integer_type_node
;
27604 ASSERT_TRUE (type_dependent_expression_p (using_decl
));
27605 tree wrapped_using_decl
= maybe_wrap_with_location (using_decl
, loc
);
27606 ASSERT_TRUE (location_wrapper_p (wrapped_using_decl
));
27607 ASSERT_TRUE (type_dependent_expression_p (wrapped_using_decl
));
27609 --processing_template_decl
;
27612 /* Run all of the selftests within this file. */
27617 test_build_non_dependent_expr ();
27618 test_type_dependent_expression_p ();
27621 } // namespace selftest
27623 #endif /* #if CHECKING_P */
27625 #include "gt-cp-pt.h"