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 maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*,
160 static int type_unification_real (tree
, tree
, tree
, const tree
*,
161 unsigned int, int, unification_kind_t
, int,
162 vec
<deferred_access_check
, va_gc
> **,
164 static void note_template_header (int);
165 static tree
convert_nontype_argument_function (tree
, tree
, tsubst_flags_t
);
166 static tree
convert_nontype_argument (tree
, tree
, tsubst_flags_t
);
167 static tree
convert_template_argument (tree
, tree
, tree
,
168 tsubst_flags_t
, int, tree
);
169 static tree
for_each_template_parm (tree
, tree_fn_t
, void*,
170 hash_set
<tree
> *, bool, tree_fn_t
= NULL
);
171 static tree
expand_template_argument_pack (tree
);
172 static tree
build_template_parm_index (int, int, int, tree
, tree
);
173 static bool inline_needs_template_parms (tree
, bool);
174 static void push_inline_template_parms_recursive (tree
, int);
175 static tree
reduce_template_parm_level (tree
, tree
, int, tree
, tsubst_flags_t
);
176 static int mark_template_parm (tree
, void *);
177 static int template_parm_this_level_p (tree
, void *);
178 static tree
tsubst_friend_function (tree
, tree
);
179 static tree
tsubst_friend_class (tree
, tree
);
180 static int can_complete_type_without_circularity (tree
);
181 static tree
get_bindings (tree
, tree
, tree
, bool);
182 static int template_decl_level (tree
);
183 static int check_cv_quals_for_unify (int, tree
, tree
);
184 static void template_parm_level_and_index (tree
, int*, int*);
185 static int unify_pack_expansion (tree
, tree
, tree
,
186 tree
, unification_kind_t
, bool, bool);
187 static tree
copy_template_args (tree
);
188 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
189 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
190 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
191 static tree
most_specialized_partial_spec (tree
, tsubst_flags_t
);
192 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
193 static tree
tsubst_arg_types (tree
, tree
, tree
, tsubst_flags_t
, tree
);
194 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
195 static bool check_specialization_scope (void);
196 static tree
process_partial_specialization (tree
);
197 static void set_current_access_from_decl (tree
);
198 static enum template_base_result
get_template_base (tree
, tree
, tree
, tree
,
200 static tree
try_class_unification (tree
, tree
, tree
, tree
, bool);
201 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
203 static bool template_template_parm_bindings_ok_p (tree
, tree
);
204 static void tsubst_default_arguments (tree
, tsubst_flags_t
);
205 static tree
for_each_template_parm_r (tree
*, int *, void *);
206 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
207 static void copy_default_args_to_explicit_spec (tree
);
208 static bool invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
209 static bool dependent_template_arg_p (tree
);
210 static bool any_template_arguments_need_structural_equality_p (tree
);
211 static bool dependent_type_p_r (tree
);
212 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
213 static tree
tsubst_decl (tree
, tree
, tsubst_flags_t
);
214 static void perform_typedefs_access_check (tree tmpl
, tree targs
);
215 static void append_type_to_template_for_access_check_1 (tree
, tree
, tree
,
217 static tree
listify (tree
);
218 static tree
listify_autos (tree
, tree
);
219 static tree
tsubst_template_parm (tree
, tree
, tsubst_flags_t
);
220 static tree
instantiate_alias_template (tree
, tree
, tsubst_flags_t
);
221 static bool complex_alias_template_p (const_tree tmpl
);
222 static tree
tsubst_attributes (tree
, tree
, tsubst_flags_t
, tree
);
223 static tree
canonicalize_expr_argument (tree
, tsubst_flags_t
);
224 static tree
make_argument_pack (tree
);
225 static void register_parameter_specializations (tree
, tree
);
226 static tree
enclosing_instantiation_of (tree tctx
);
228 /* Make the current scope suitable for access checking when we are
229 processing T. T can be FUNCTION_DECL for instantiated function
230 template, VAR_DECL for static member variable, or TYPE_DECL for
231 alias template (needed by instantiate_decl). */
234 push_access_scope (tree t
)
236 gcc_assert (VAR_OR_FUNCTION_DECL_P (t
)
237 || TREE_CODE (t
) == TYPE_DECL
);
239 if (DECL_FRIEND_CONTEXT (t
))
240 push_nested_class (DECL_FRIEND_CONTEXT (t
));
241 else if (DECL_CLASS_SCOPE_P (t
))
242 push_nested_class (DECL_CONTEXT (t
));
244 push_to_top_level ();
246 if (TREE_CODE (t
) == FUNCTION_DECL
)
248 saved_access_scope
= tree_cons
249 (NULL_TREE
, current_function_decl
, saved_access_scope
);
250 current_function_decl
= t
;
254 /* Restore the scope set up by push_access_scope. T is the node we
258 pop_access_scope (tree t
)
260 if (TREE_CODE (t
) == FUNCTION_DECL
)
262 current_function_decl
= TREE_VALUE (saved_access_scope
);
263 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
266 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
269 pop_from_top_level ();
272 /* Do any processing required when DECL (a member template
273 declaration) is finished. Returns the TEMPLATE_DECL corresponding
274 to DECL, unless it is a specialization, in which case the DECL
275 itself is returned. */
278 finish_member_template_decl (tree decl
)
280 if (decl
== error_mark_node
)
281 return error_mark_node
;
283 gcc_assert (DECL_P (decl
));
285 if (TREE_CODE (decl
) == TYPE_DECL
)
289 type
= TREE_TYPE (decl
);
290 if (type
== error_mark_node
)
291 return error_mark_node
;
292 if (MAYBE_CLASS_TYPE_P (type
)
293 && CLASSTYPE_TEMPLATE_INFO (type
)
294 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
296 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
297 check_member_template (tmpl
);
302 else if (TREE_CODE (decl
) == FIELD_DECL
)
303 error ("data member %qD cannot be a member template", decl
);
304 else if (DECL_TEMPLATE_INFO (decl
))
306 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
308 check_member_template (DECL_TI_TEMPLATE (decl
));
309 return DECL_TI_TEMPLATE (decl
);
315 error ("invalid member template declaration %qD", decl
);
317 return error_mark_node
;
320 /* Create a template info node. */
323 build_template_info (tree template_decl
, tree template_args
)
325 tree result
= make_node (TEMPLATE_INFO
);
326 TI_TEMPLATE (result
) = template_decl
;
327 TI_ARGS (result
) = template_args
;
331 /* Return the template info node corresponding to T, whatever T is. */
334 get_template_info (const_tree t
)
336 tree tinfo
= NULL_TREE
;
338 if (!t
|| t
== error_mark_node
)
341 if (TREE_CODE (t
) == NAMESPACE_DECL
342 || TREE_CODE (t
) == PARM_DECL
)
345 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
346 tinfo
= DECL_TEMPLATE_INFO (t
);
348 if (!tinfo
&& DECL_IMPLICIT_TYPEDEF_P (t
))
351 if (OVERLOAD_TYPE_P (t
))
352 tinfo
= TYPE_TEMPLATE_INFO (t
);
353 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
354 tinfo
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
);
359 /* Returns the template nesting level of the indicated class TYPE.
369 A<T>::B<U> has depth two, while A<T> has depth one.
370 Both A<T>::B<int> and A<int>::B<U> have depth one, if
371 they are instantiations, not specializations.
373 This function is guaranteed to return 0 if passed NULL_TREE so
374 that, for example, `template_class_depth (current_class_type)' is
378 template_class_depth (tree type
)
382 for (depth
= 0; type
&& TREE_CODE (type
) != NAMESPACE_DECL
; )
384 tree tinfo
= get_template_info (type
);
386 if (tinfo
&& PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
387 && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
))))
391 type
= CP_DECL_CONTEXT (type
);
392 else if (LAMBDA_TYPE_P (type
))
393 type
= LAMBDA_TYPE_EXTRA_SCOPE (type
);
395 type
= CP_TYPE_CONTEXT (type
);
401 /* Subroutine of maybe_begin_member_template_processing.
402 Returns true if processing DECL needs us to push template parms. */
405 inline_needs_template_parms (tree decl
, bool nsdmi
)
407 if (!decl
|| (!nsdmi
&& ! DECL_TEMPLATE_INFO (decl
)))
410 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
411 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
414 /* Subroutine of maybe_begin_member_template_processing.
415 Push the template parms in PARMS, starting from LEVELS steps into the
416 chain, and ending at the beginning, since template parms are listed
420 push_inline_template_parms_recursive (tree parmlist
, int levels
)
422 tree parms
= TREE_VALUE (parmlist
);
426 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
428 ++processing_template_decl
;
429 current_template_parms
430 = tree_cons (size_int (processing_template_decl
),
431 parms
, current_template_parms
);
432 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
434 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
436 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
438 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
440 if (error_operand_p (parm
))
443 gcc_assert (DECL_P (parm
));
445 switch (TREE_CODE (parm
))
453 /* Push the CONST_DECL. */
454 pushdecl (TEMPLATE_PARM_DECL (DECL_INITIAL (parm
)));
463 /* Restore the template parameter context for a member template, a
464 friend template defined in a class definition, or a non-template
465 member of template class. */
468 maybe_begin_member_template_processing (tree decl
)
472 bool nsdmi
= TREE_CODE (decl
) == FIELD_DECL
;
476 tree ctx
= DECL_CONTEXT (decl
);
477 decl
= (CLASSTYPE_TEMPLATE_INFO (ctx
)
478 /* Disregard full specializations (c++/60999). */
479 && uses_template_parms (ctx
)
480 ? CLASSTYPE_TI_TEMPLATE (ctx
) : NULL_TREE
);
483 if (inline_needs_template_parms (decl
, nsdmi
))
485 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
486 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
488 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
491 parms
= TREE_CHAIN (parms
);
494 push_inline_template_parms_recursive (parms
, levels
);
497 /* Remember how many levels of template parameters we pushed so that
498 we can pop them later. */
499 inline_parm_levels
.safe_push (levels
);
502 /* Undo the effects of maybe_begin_member_template_processing. */
505 maybe_end_member_template_processing (void)
510 if (inline_parm_levels
.length () == 0)
513 last
= inline_parm_levels
.pop ();
514 for (i
= 0; i
< last
; ++i
)
516 --processing_template_decl
;
517 current_template_parms
= TREE_CHAIN (current_template_parms
);
522 /* Return a new template argument vector which contains all of ARGS,
523 but has as its innermost set of arguments the EXTRA_ARGS. */
526 add_to_template_args (tree args
, tree extra_args
)
533 if (args
== NULL_TREE
|| extra_args
== error_mark_node
)
536 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
537 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
539 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
540 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
542 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
543 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
548 /* Like add_to_template_args, but only the outermost ARGS are added to
549 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
550 (EXTRA_ARGS) levels are added. This function is used to combine
551 the template arguments from a partial instantiation with the
552 template arguments used to attain the full instantiation from the
553 partial instantiation. */
556 add_outermost_template_args (tree args
, tree extra_args
)
560 /* If there are more levels of EXTRA_ARGS than there are ARGS,
561 something very fishy is going on. */
562 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
564 /* If *all* the new arguments will be the EXTRA_ARGS, just return
566 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
569 /* For the moment, we make ARGS look like it contains fewer levels. */
570 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
572 new_args
= add_to_template_args (args
, extra_args
);
574 /* Now, we restore ARGS to its full dimensions. */
575 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
580 /* Return the N levels of innermost template arguments from the ARGS. */
583 get_innermost_template_args (tree args
, int n
)
591 /* If N is 1, just return the innermost set of template arguments. */
593 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
595 /* If we're not removing anything, just return the arguments we were
597 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
598 gcc_assert (extra_levels
>= 0);
599 if (extra_levels
== 0)
602 /* Make a new set of arguments, not containing the outer arguments. */
603 new_args
= make_tree_vec (n
);
604 for (i
= 1; i
<= n
; ++i
)
605 SET_TMPL_ARGS_LEVEL (new_args
, i
,
606 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
611 /* The inverse of get_innermost_template_args: Return all but the innermost
612 EXTRA_LEVELS levels of template arguments from the ARGS. */
615 strip_innermost_template_args (tree args
, int extra_levels
)
618 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
623 /* If N is 1, just return the outermost set of template arguments. */
625 return TMPL_ARGS_LEVEL (args
, 1);
627 /* If we're not removing anything, just return the arguments we were
629 gcc_assert (extra_levels
>= 0);
630 if (extra_levels
== 0)
633 /* Make a new set of arguments, not containing the inner arguments. */
634 new_args
= make_tree_vec (n
);
635 for (i
= 1; i
<= n
; ++i
)
636 SET_TMPL_ARGS_LEVEL (new_args
, i
,
637 TMPL_ARGS_LEVEL (args
, i
));
642 /* We've got a template header coming up; push to a new level for storing
646 begin_template_parm_list (void)
648 /* We use a non-tag-transparent scope here, which causes pushtag to
649 put tags in this scope, rather than in the enclosing class or
650 namespace scope. This is the right thing, since we want
651 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
652 global template class, push_template_decl handles putting the
653 TEMPLATE_DECL into top-level scope. For a nested template class,
656 template <class T> struct S1 {
657 template <class T> struct S2 {};
660 pushtag contains special code to insert the TEMPLATE_DECL for S2
661 at the right scope. */
662 begin_scope (sk_template_parms
, NULL
);
663 ++processing_template_decl
;
664 ++processing_template_parmlist
;
665 note_template_header (0);
667 /* Add a dummy parameter level while we process the parameter list. */
668 current_template_parms
669 = tree_cons (size_int (processing_template_decl
),
671 current_template_parms
);
674 /* This routine is called when a specialization is declared. If it is
675 invalid to declare a specialization here, an error is reported and
676 false is returned, otherwise this routine will return true. */
679 check_specialization_scope (void)
681 tree scope
= current_scope ();
685 An explicit specialization shall be declared in the namespace of
686 which the template is a member, or, for member templates, in the
687 namespace of which the enclosing class or enclosing class
688 template is a member. An explicit specialization of a member
689 function, member class or static data member of a class template
690 shall be declared in the namespace of which the class template
692 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
694 error ("explicit specialization in non-namespace scope %qD", scope
);
700 In an explicit specialization declaration for a member of a class
701 template or a member template that appears in namespace scope,
702 the member template and some of its enclosing class templates may
703 remain unspecialized, except that the declaration shall not
704 explicitly specialize a class member template if its enclosing
705 class templates are not explicitly specialized as well. */
706 if (current_template_parms
)
708 error ("enclosing class templates are not explicitly specialized");
715 /* We've just seen template <>. */
718 begin_specialization (void)
720 begin_scope (sk_template_spec
, NULL
);
721 note_template_header (1);
722 return check_specialization_scope ();
725 /* Called at then end of processing a declaration preceded by
729 end_specialization (void)
732 reset_specialization ();
735 /* Any template <>'s that we have seen thus far are not referring to a
736 function specialization. */
739 reset_specialization (void)
741 processing_specialization
= 0;
742 template_header_count
= 0;
745 /* We've just seen a template header. If SPECIALIZATION is nonzero,
746 it was of the form template <>. */
749 note_template_header (int specialization
)
751 processing_specialization
= specialization
;
752 template_header_count
++;
755 /* We're beginning an explicit instantiation. */
758 begin_explicit_instantiation (void)
760 gcc_assert (!processing_explicit_instantiation
);
761 processing_explicit_instantiation
= true;
766 end_explicit_instantiation (void)
768 gcc_assert (processing_explicit_instantiation
);
769 processing_explicit_instantiation
= false;
772 /* An explicit specialization or partial specialization of TMPL is being
773 declared. Check that the namespace in which the specialization is
774 occurring is permissible. Returns false iff it is invalid to
775 specialize TMPL in the current namespace. */
778 check_specialization_namespace (tree tmpl
)
780 tree tpl_ns
= decl_namespace_context (tmpl
);
784 An explicit specialization shall be declared in a namespace enclosing the
785 specialized template. An explicit specialization whose declarator-id is
786 not qualified shall be declared in the nearest enclosing namespace of the
787 template, or, if the namespace is inline (7.3.1), any namespace from its
788 enclosing namespace set. */
789 if (current_scope() != DECL_CONTEXT (tmpl
)
790 && !at_namespace_scope_p ())
792 error ("specialization of %qD must appear at namespace scope", tmpl
);
796 if (is_nested_namespace (current_namespace
, tpl_ns
, cxx_dialect
< cxx11
))
797 /* Same or enclosing namespace. */
801 permerror (input_location
,
802 "specialization of %qD in different namespace", tmpl
);
803 inform (DECL_SOURCE_LOCATION (tmpl
),
804 " from definition of %q#D", tmpl
);
809 /* SPEC is an explicit instantiation. Check that it is valid to
810 perform this explicit instantiation in the current namespace. */
813 check_explicit_instantiation_namespace (tree spec
)
817 /* DR 275: An explicit instantiation shall appear in an enclosing
818 namespace of its template. */
819 ns
= decl_namespace_context (spec
);
820 if (!is_nested_namespace (current_namespace
, ns
))
821 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
822 "(which does not enclose namespace %qD)",
823 spec
, current_namespace
, ns
);
826 // Returns the type of a template specialization only if that
827 // specialization needs to be defined. Otherwise (e.g., if the type has
828 // already been defined), the function returns NULL_TREE.
830 maybe_new_partial_specialization (tree type
)
832 // An implicit instantiation of an incomplete type implies
833 // the definition of a new class template.
835 // template<typename T>
838 // template<typename T>
841 // Here, S<T*> is an implicit instantiation of S whose type
843 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
) && !COMPLETE_TYPE_P (type
))
846 // It can also be the case that TYPE is a completed specialization.
847 // Continuing the previous example, suppose we also declare:
849 // template<typename T>
850 // requires Integral<T>
853 // Here, S<T*> refers to the specialization S<T*> defined
854 // above. However, we need to differentiate definitions because
855 // we intend to define a new partial specialization. In this case,
856 // we rely on the fact that the constraints are different for
857 // this declaration than that above.
859 // Note that we also get here for injected class names and
860 // late-parsed template definitions. We must ensure that we
861 // do not create new type declarations for those cases.
862 if (flag_concepts
&& CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
864 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
865 tree args
= CLASSTYPE_TI_ARGS (type
);
867 // If there are no template parameters, this cannot be a new
868 // partial template specializtion?
869 if (!current_template_parms
)
872 // The injected-class-name is not a new partial specialization.
873 if (DECL_SELF_REFERENCE_P (TYPE_NAME (type
)))
876 // If the constraints are not the same as those of the primary
877 // then, we can probably create a new specialization.
878 tree type_constr
= current_template_constraints ();
880 if (type
== TREE_TYPE (tmpl
))
882 tree main_constr
= get_constraints (tmpl
);
883 if (equivalent_constraints (type_constr
, main_constr
))
887 // Also, if there's a pre-existing specialization with matching
888 // constraints, then this also isn't new.
889 tree specs
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
892 tree spec_tmpl
= TREE_VALUE (specs
);
893 tree spec_args
= TREE_PURPOSE (specs
);
894 tree spec_constr
= get_constraints (spec_tmpl
);
895 if (comp_template_args (args
, spec_args
)
896 && equivalent_constraints (type_constr
, spec_constr
))
898 specs
= TREE_CHAIN (specs
);
901 // Create a new type node (and corresponding type decl)
902 // for the newly declared specialization.
903 tree t
= make_class_type (TREE_CODE (type
));
904 CLASSTYPE_DECLARED_CLASS (t
) = CLASSTYPE_DECLARED_CLASS (type
);
905 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (tmpl
, args
));
907 /* We only need a separate type node for storing the definition of this
908 partial specialization; uses of S<T*> are unconstrained, so all are
909 equivalent. So keep TYPE_CANONICAL the same. */
910 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
912 // Build the corresponding type decl.
913 tree d
= create_implicit_typedef (DECL_NAME (tmpl
), t
);
914 DECL_CONTEXT (d
) = TYPE_CONTEXT (t
);
915 DECL_SOURCE_LOCATION (d
) = input_location
;
923 /* The TYPE is being declared. If it is a template type, that means it
924 is a partial specialization. Do appropriate error-checking. */
927 maybe_process_partial_specialization (tree type
)
931 if (type
== error_mark_node
)
932 return error_mark_node
;
934 /* A lambda that appears in specialization context is not itself a
936 if (CLASS_TYPE_P (type
) && CLASSTYPE_LAMBDA_EXPR (type
))
939 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
941 error ("name of class shadows template template parameter %qD",
943 return error_mark_node
;
946 context
= TYPE_CONTEXT (type
);
948 if (TYPE_ALIAS_P (type
))
950 tree tinfo
= TYPE_ALIAS_TEMPLATE_INFO (type
);
952 if (tinfo
&& DECL_ALIAS_TEMPLATE_P (TI_TEMPLATE (tinfo
)))
953 error ("specialization of alias template %qD",
954 TI_TEMPLATE (tinfo
));
956 error ("explicit specialization of non-template %qT", type
);
957 return error_mark_node
;
959 else if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
961 /* This is for ordinary explicit specialization and partial
962 specialization of a template class such as:
964 template <> class C<int>;
968 template <class T> class C<T*>;
970 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
972 if (tree t
= maybe_new_partial_specialization (type
))
974 if (!check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (t
))
975 && !at_namespace_scope_p ())
976 return error_mark_node
;
977 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (t
);
978 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (t
)) = input_location
;
979 if (processing_template_decl
)
981 tree decl
= push_template_decl (TYPE_MAIN_DECL (t
));
982 if (decl
== error_mark_node
)
983 return error_mark_node
;
984 return TREE_TYPE (decl
);
987 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
988 error ("specialization of %qT after instantiation", type
);
989 else if (errorcount
&& !processing_specialization
990 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
)
991 && !uses_template_parms (CLASSTYPE_TI_ARGS (type
)))
992 /* Trying to define a specialization either without a template<> header
993 or in an inappropriate place. We've already given an error, so just
994 bail now so we don't actually define the specialization. */
995 return error_mark_node
;
997 else if (CLASS_TYPE_P (type
)
998 && !CLASSTYPE_USE_TEMPLATE (type
)
999 && CLASSTYPE_TEMPLATE_INFO (type
)
1000 && context
&& CLASS_TYPE_P (context
)
1001 && CLASSTYPE_TEMPLATE_INFO (context
))
1003 /* This is for an explicit specialization of member class
1004 template according to [temp.expl.spec/18]:
1006 template <> template <class U> class C<int>::D;
1008 The context `C<int>' must be an implicit instantiation.
1009 Otherwise this is just a member class template declared
1012 template <> class C<int> { template <class U> class D; };
1013 template <> template <class U> class C<int>::D;
1015 In the first case, `C<int>::D' is a specialization of `C<T>::D'
1016 while in the second case, `C<int>::D' is a primary template
1017 and `C<T>::D' may not exist. */
1019 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
1020 && !COMPLETE_TYPE_P (type
))
1023 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
1025 if (current_namespace
1026 != decl_namespace_context (tmpl
))
1028 permerror (input_location
,
1029 "specializing %q#T in different namespace", type
);
1030 permerror (DECL_SOURCE_LOCATION (tmpl
),
1031 " from definition of %q#D", tmpl
);
1034 /* Check for invalid specialization after instantiation:
1036 template <> template <> class C<int>::D<int>;
1037 template <> template <class U> class C<int>::D; */
1039 for (t
= DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
1040 t
; t
= TREE_CHAIN (t
))
1042 tree inst
= TREE_VALUE (t
);
1043 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (inst
)
1044 || !COMPLETE_OR_OPEN_TYPE_P (inst
))
1046 /* We already have a full specialization of this partial
1047 instantiation, or a full specialization has been
1048 looked up but not instantiated. Reassign it to the
1049 new member specialization template. */
1053 elt
.tmpl
= most_general_template (tmpl
);
1054 elt
.args
= CLASSTYPE_TI_ARGS (inst
);
1057 type_specializations
->remove_elt (&elt
);
1060 elt
.args
= INNERMOST_TEMPLATE_ARGS (elt
.args
);
1063 = type_specializations
->find_slot (&elt
, INSERT
);
1064 entry
= ggc_alloc
<spec_entry
> ();
1069 /* But if we've had an implicit instantiation, that's a
1070 problem ([temp.expl.spec]/6). */
1071 error ("specialization %qT after instantiation %qT",
1075 /* Mark TYPE as a specialization. And as a result, we only
1076 have one level of template argument for the innermost
1078 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
1079 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
1080 CLASSTYPE_TI_ARGS (type
)
1081 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
1084 else if (processing_specialization
)
1086 /* Someday C++0x may allow for enum template specialization. */
1087 if (cxx_dialect
> cxx98
&& TREE_CODE (type
) == ENUMERAL_TYPE
1088 && CLASS_TYPE_P (context
) && CLASSTYPE_USE_TEMPLATE (context
))
1089 pedwarn (input_location
, OPT_Wpedantic
, "template specialization "
1090 "of %qD not allowed by ISO C++", type
);
1093 error ("explicit specialization of non-template %qT", type
);
1094 return error_mark_node
;
1101 /* Returns nonzero if we can optimize the retrieval of specializations
1102 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
1103 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
1106 optimize_specialization_lookup_p (tree tmpl
)
1108 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
1109 && DECL_CLASS_SCOPE_P (tmpl
)
1110 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
1112 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
1113 /* The optimized lookup depends on the fact that the
1114 template arguments for the member function template apply
1115 purely to the containing class, which is not true if the
1116 containing class is an explicit or partial
1118 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
1119 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
1120 && !DECL_CONV_FN_P (tmpl
)
1121 /* It is possible to have a template that is not a member
1122 template and is not a member of a template class:
1124 template <typename T>
1125 struct S { friend A::f(); };
1127 Here, the friend function is a template, but the context does
1128 not have template information. The optimized lookup relies
1129 on having ARGS be the template arguments for both the class
1130 and the function template. */
1131 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
1134 /* Make sure ARGS doesn't use any inappropriate typedefs; we should have
1135 gone through coerce_template_parms by now. */
1138 verify_unstripped_args_1 (tree inner
)
1140 for (int i
= 0; i
< TREE_VEC_LENGTH (inner
); ++i
)
1142 tree arg
= TREE_VEC_ELT (inner
, i
);
1143 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
1145 else if (TYPE_P (arg
))
1146 gcc_assert (strip_typedefs (arg
, NULL
) == arg
);
1147 else if (ARGUMENT_PACK_P (arg
))
1148 verify_unstripped_args_1 (ARGUMENT_PACK_ARGS (arg
));
1149 else if (strip_typedefs (TREE_TYPE (arg
), NULL
) != TREE_TYPE (arg
))
1150 /* Allow typedefs on the type of a non-type argument, since a
1151 parameter can have them. */;
1153 gcc_assert (strip_typedefs_expr (arg
, NULL
) == arg
);
1158 verify_unstripped_args (tree args
)
1160 ++processing_template_decl
;
1161 if (!any_dependent_template_arguments_p (args
))
1162 verify_unstripped_args_1 (INNERMOST_TEMPLATE_ARGS (args
));
1163 --processing_template_decl
;
1166 /* Retrieve the specialization (in the sense of [temp.spec] - a
1167 specialization is either an instantiation or an explicit
1168 specialization) of TMPL for the given template ARGS. If there is
1169 no such specialization, return NULL_TREE. The ARGS are a vector of
1170 arguments, or a vector of vectors of arguments, in the case of
1171 templates with more than one level of parameters.
1173 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1174 then we search for a partial specialization matching ARGS. This
1175 parameter is ignored if TMPL is not a class template.
1177 We can also look up a FIELD_DECL, if it is a lambda capture pack; the
1178 result is a NONTYPE_ARGUMENT_PACK. */
1181 retrieve_specialization (tree tmpl
, tree args
, hashval_t hash
)
1183 if (tmpl
== NULL_TREE
)
1186 if (args
== error_mark_node
)
1189 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
1190 || TREE_CODE (tmpl
) == FIELD_DECL
);
1192 /* There should be as many levels of arguments as there are
1193 levels of parameters. */
1194 gcc_assert (TMPL_ARGS_DEPTH (args
)
1195 == (TREE_CODE (tmpl
) == TEMPLATE_DECL
1196 ? TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
))
1197 : template_class_depth (DECL_CONTEXT (tmpl
))));
1200 verify_unstripped_args (args
);
1202 /* Lambda functions in templates aren't instantiated normally, but through
1203 tsubst_lambda_expr. */
1204 if (lambda_fn_in_template_p (tmpl
))
1207 if (optimize_specialization_lookup_p (tmpl
))
1209 /* The template arguments actually apply to the containing
1210 class. Find the class specialization with those
1212 tree class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
1213 tree class_specialization
1214 = retrieve_specialization (class_template
, args
, 0);
1215 if (!class_specialization
)
1218 /* Find the instance of TMPL. */
1219 tree fns
= get_class_binding (class_specialization
, DECL_NAME (tmpl
));
1220 for (ovl_iterator
iter (fns
); iter
; ++iter
)
1223 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
1224 /* using-declarations can add base methods to the method vec,
1225 and we don't want those here. */
1226 && DECL_CONTEXT (fn
) == class_specialization
)
1235 hash_table
<spec_hasher
> *specializations
;
1239 elt
.spec
= NULL_TREE
;
1241 if (DECL_CLASS_TEMPLATE_P (tmpl
))
1242 specializations
= type_specializations
;
1244 specializations
= decl_specializations
;
1247 hash
= spec_hasher::hash (&elt
);
1248 found
= specializations
->find_with_hash (&elt
, hash
);
1256 /* Like retrieve_specialization, but for local declarations. */
1259 retrieve_local_specialization (tree tmpl
)
1261 if (local_specializations
== NULL
)
1264 tree
*slot
= local_specializations
->get (tmpl
);
1265 return slot
? *slot
: NULL_TREE
;
1268 /* Returns nonzero iff DECL is a specialization of TMPL. */
1271 is_specialization_of (tree decl
, tree tmpl
)
1275 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1279 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1285 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1287 for (t
= TREE_TYPE (decl
);
1289 t
= CLASSTYPE_USE_TEMPLATE (t
)
1290 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1291 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1298 /* Returns nonzero iff DECL is a specialization of friend declaration
1299 FRIEND_DECL according to [temp.friend]. */
1302 is_specialization_of_friend (tree decl
, tree friend_decl
)
1304 bool need_template
= true;
1307 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1308 || TREE_CODE (decl
) == TYPE_DECL
);
1310 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1311 of a template class, we want to check if DECL is a specialization
1313 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1314 && DECL_TEMPLATE_INFO (friend_decl
)
1315 && !DECL_USE_TEMPLATE (friend_decl
))
1317 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1318 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1319 need_template
= false;
1321 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1322 && !PRIMARY_TEMPLATE_P (friend_decl
))
1323 need_template
= false;
1325 /* There is nothing to do if this is not a template friend. */
1326 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1329 if (is_specialization_of (decl
, friend_decl
))
1333 A member of a class template may be declared to be a friend of a
1334 non-template class. In this case, the corresponding member of
1335 every specialization of the class template is a friend of the
1336 class granting friendship.
1338 For example, given a template friend declaration
1340 template <class T> friend void A<T>::f();
1342 the member function below is considered a friend
1344 template <> struct A<int> {
1348 For this type of template friend, TEMPLATE_DEPTH below will be
1349 nonzero. To determine if DECL is a friend of FRIEND, we first
1350 check if the enclosing class is a specialization of another. */
1352 template_depth
= template_class_depth (CP_DECL_CONTEXT (friend_decl
));
1354 && DECL_CLASS_SCOPE_P (decl
)
1355 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1356 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1358 /* Next, we check the members themselves. In order to handle
1359 a few tricky cases, such as when FRIEND_DECL's are
1361 template <class T> friend void A<T>::g(T t);
1362 template <class T> template <T t> friend void A<T>::h();
1366 void A<int>::g(int);
1367 template <int> void A<int>::h();
1369 we need to figure out ARGS, the template arguments from
1370 the context of DECL. This is required for template substitution
1371 of `T' in the function parameter of `g' and template parameter
1372 of `h' in the above examples. Here ARGS corresponds to `int'. */
1374 tree context
= DECL_CONTEXT (decl
);
1375 tree args
= NULL_TREE
;
1376 int current_depth
= 0;
1378 while (current_depth
< template_depth
)
1380 if (CLASSTYPE_TEMPLATE_INFO (context
))
1382 if (current_depth
== 0)
1383 args
= TYPE_TI_ARGS (context
);
1385 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1388 context
= TYPE_CONTEXT (context
);
1391 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1396 tree friend_args_type
;
1397 tree decl_args_type
;
1399 /* Make sure that both DECL and FRIEND_DECL are templates or
1401 is_template
= DECL_TEMPLATE_INFO (decl
)
1402 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1403 if (need_template
^ is_template
)
1405 else if (is_template
)
1407 /* If both are templates, check template parameter list. */
1409 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1411 if (!comp_template_parms
1412 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1416 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1419 decl_type
= TREE_TYPE (decl
);
1421 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1422 tf_none
, NULL_TREE
);
1423 if (friend_type
== error_mark_node
)
1426 /* Check if return types match. */
1427 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1430 /* Check if function parameter types match, ignoring the
1431 `this' parameter. */
1432 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1433 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1434 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1435 friend_args_type
= TREE_CHAIN (friend_args_type
);
1436 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1437 decl_args_type
= TREE_CHAIN (decl_args_type
);
1439 return compparms (decl_args_type
, friend_args_type
);
1443 /* DECL is a TYPE_DECL */
1445 tree decl_type
= TREE_TYPE (decl
);
1447 /* Make sure that both DECL and FRIEND_DECL are templates or
1450 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1451 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1453 if (need_template
^ is_template
)
1455 else if (is_template
)
1458 /* If both are templates, check the name of the two
1459 TEMPLATE_DECL's first because is_friend didn't. */
1460 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1461 != DECL_NAME (friend_decl
))
1464 /* Now check template parameter list. */
1466 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1468 return comp_template_parms
1469 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1473 return (DECL_NAME (decl
)
1474 == DECL_NAME (friend_decl
));
1480 /* Register the specialization SPEC as a specialization of TMPL with
1481 the indicated ARGS. IS_FRIEND indicates whether the specialization
1482 is actually just a friend declaration. ATTRLIST is the list of
1483 attributes that the specialization is declared with or NULL when
1484 it isn't. Returns SPEC, or an equivalent prior declaration, if
1487 We also store instantiations of field packs in the hash table, even
1488 though they are not themselves templates, to make lookup easier. */
1491 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
,
1495 spec_entry
**slot
= NULL
;
1498 gcc_assert ((TREE_CODE (tmpl
) == TEMPLATE_DECL
&& DECL_P (spec
))
1499 || (TREE_CODE (tmpl
) == FIELD_DECL
1500 && TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
));
1502 if (TREE_CODE (spec
) == FUNCTION_DECL
1503 && uses_template_parms (DECL_TI_ARGS (spec
)))
1504 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1505 register it; we want the corresponding TEMPLATE_DECL instead.
1506 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1507 the more obvious `uses_template_parms (spec)' to avoid problems
1508 with default function arguments. In particular, given
1509 something like this:
1511 template <class T> void f(T t1, T t = T())
1513 the default argument expression is not substituted for in an
1514 instantiation unless and until it is actually needed. */
1517 if (optimize_specialization_lookup_p (tmpl
))
1518 /* We don't put these specializations in the hash table, but we might
1519 want to give an error about a mismatch. */
1520 fn
= retrieve_specialization (tmpl
, args
, 0);
1528 hash
= spec_hasher::hash (&elt
);
1531 decl_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
1533 fn
= ((spec_entry
*) *slot
)->spec
;
1538 /* We can sometimes try to re-register a specialization that we've
1539 already got. In particular, regenerate_decl_from_template calls
1540 duplicate_decls which will update the specialization list. But,
1541 we'll still get called again here anyhow. It's more convenient
1542 to simply allow this than to try to prevent it. */
1545 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1547 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1549 if (DECL_ODR_USED (fn
)
1550 || DECL_EXPLICIT_INSTANTIATION (fn
))
1552 error ("specialization of %qD after instantiation",
1554 return error_mark_node
;
1559 /* This situation should occur only if the first
1560 specialization is an implicit instantiation, the
1561 second is an explicit specialization, and the
1562 implicit instantiation has not yet been used. That
1563 situation can occur if we have implicitly
1564 instantiated a member function and then specialized
1567 We can also wind up here if a friend declaration that
1568 looked like an instantiation turns out to be a
1571 template <class T> void foo(T);
1572 class S { friend void foo<>(int) };
1573 template <> void foo(int);
1575 We transform the existing DECL in place so that any
1576 pointers to it become pointers to the updated
1579 If there was a definition for the template, but not
1580 for the specialization, we want this to look as if
1581 there were no definition, and vice versa. */
1582 DECL_INITIAL (fn
) = NULL_TREE
;
1583 duplicate_decls (spec
, fn
, is_friend
);
1584 /* The call to duplicate_decls will have applied
1587 An explicit specialization of a function template
1588 is inline only if it is explicitly declared to be,
1589 and independently of whether its function template
1592 to the primary function; now copy the inline bits to
1593 the various clones. */
1594 FOR_EACH_CLONE (clone
, fn
)
1596 DECL_DECLARED_INLINE_P (clone
)
1597 = DECL_DECLARED_INLINE_P (fn
);
1598 DECL_SOURCE_LOCATION (clone
)
1599 = DECL_SOURCE_LOCATION (fn
);
1600 DECL_DELETED_FN (clone
)
1601 = DECL_DELETED_FN (fn
);
1603 check_specialization_namespace (tmpl
);
1608 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1610 tree dd
= duplicate_decls (spec
, fn
, is_friend
);
1611 if (dd
== error_mark_node
)
1612 /* We've already complained in duplicate_decls. */
1613 return error_mark_node
;
1615 if (dd
== NULL_TREE
&& DECL_INITIAL (spec
))
1616 /* Dup decl failed, but this is a new definition. Set the
1617 line number so any errors match this new
1619 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1625 return duplicate_decls (spec
, fn
, is_friend
);
1627 /* A specialization must be declared in the same namespace as the
1628 template it is specializing. */
1629 if (DECL_P (spec
) && DECL_TEMPLATE_SPECIALIZATION (spec
)
1630 && !check_specialization_namespace (tmpl
))
1631 DECL_CONTEXT (spec
) = DECL_CONTEXT (tmpl
);
1633 if (slot
!= NULL
/* !optimize_specialization_lookup_p (tmpl) */)
1635 spec_entry
*entry
= ggc_alloc
<spec_entry
> ();
1636 gcc_assert (tmpl
&& args
&& spec
);
1639 if ((TREE_CODE (spec
) == FUNCTION_DECL
&& DECL_NAMESPACE_SCOPE_P (spec
)
1640 && PRIMARY_TEMPLATE_P (tmpl
)
1641 && DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (tmpl
)) == NULL_TREE
)
1642 || variable_template_p (tmpl
))
1643 /* If TMPL is a forward declaration of a template function, keep a list
1644 of all specializations in case we need to reassign them to a friend
1645 template later in tsubst_friend_function.
1647 Also keep a list of all variable template instantiations so that
1648 process_partial_specialization can check whether a later partial
1649 specialization would have used it. */
1650 DECL_TEMPLATE_INSTANTIATIONS (tmpl
)
1651 = tree_cons (args
, spec
, DECL_TEMPLATE_INSTANTIATIONS (tmpl
));
1657 /* Returns true iff two spec_entry nodes are equivalent. */
1659 int comparing_specializations
;
1662 spec_hasher::equal (spec_entry
*e1
, spec_entry
*e2
)
1666 ++comparing_specializations
;
1667 equal
= (e1
->tmpl
== e2
->tmpl
1668 && comp_template_args (e1
->args
, e2
->args
));
1669 if (equal
&& flag_concepts
1670 /* tmpl could be a FIELD_DECL for a capture pack. */
1671 && TREE_CODE (e1
->tmpl
) == TEMPLATE_DECL
1672 && VAR_P (DECL_TEMPLATE_RESULT (e1
->tmpl
))
1673 && uses_template_parms (e1
->args
))
1675 /* Partial specializations of a variable template can be distinguished by
1677 tree c1
= e1
->spec
? get_constraints (e1
->spec
) : NULL_TREE
;
1678 tree c2
= e2
->spec
? get_constraints (e2
->spec
) : NULL_TREE
;
1679 equal
= equivalent_constraints (c1
, c2
);
1681 --comparing_specializations
;
1686 /* Returns a hash for a template TMPL and template arguments ARGS. */
1689 hash_tmpl_and_args (tree tmpl
, tree args
)
1691 hashval_t val
= iterative_hash_object (DECL_UID (tmpl
), 0);
1692 return iterative_hash_template_arg (args
, val
);
1695 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1699 spec_hasher::hash (spec_entry
*e
)
1701 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
1704 /* Recursively calculate a hash value for a template argument ARG, for use
1705 in the hash tables of template specializations. */
1708 iterative_hash_template_arg (tree arg
, hashval_t val
)
1710 unsigned HOST_WIDE_INT i
;
1711 enum tree_code code
;
1714 if (arg
== NULL_TREE
)
1715 return iterative_hash_object (arg
, val
);
1720 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
1723 code
= TREE_CODE (arg
);
1724 tclass
= TREE_CODE_CLASS (code
);
1726 val
= iterative_hash_object (code
, val
);
1733 case IDENTIFIER_NODE
:
1734 return iterative_hash_object (IDENTIFIER_HASH_VALUE (arg
), val
);
1738 int i
, len
= TREE_VEC_LENGTH (arg
);
1739 for (i
= 0; i
< len
; ++i
)
1740 val
= iterative_hash_template_arg (TREE_VEC_ELT (arg
, i
), val
);
1744 case TYPE_PACK_EXPANSION
:
1745 case EXPR_PACK_EXPANSION
:
1746 val
= iterative_hash_template_arg (PACK_EXPANSION_PATTERN (arg
), val
);
1747 return iterative_hash_template_arg (PACK_EXPANSION_EXTRA_ARGS (arg
), val
);
1749 case TYPE_ARGUMENT_PACK
:
1750 case NONTYPE_ARGUMENT_PACK
:
1751 return iterative_hash_template_arg (ARGUMENT_PACK_ARGS (arg
), val
);
1754 for (; arg
; arg
= TREE_CHAIN (arg
))
1755 val
= iterative_hash_template_arg (TREE_VALUE (arg
), val
);
1759 for (lkp_iterator
iter (arg
); iter
; ++iter
)
1760 val
= iterative_hash_template_arg (*iter
, val
);
1766 iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1767 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg
), i
, field
, value
)
1769 val
= iterative_hash_template_arg (field
, val
);
1770 val
= iterative_hash_template_arg (value
, val
);
1776 if (!DECL_ARTIFICIAL (arg
))
1778 val
= iterative_hash_object (DECL_PARM_INDEX (arg
), val
);
1779 val
= iterative_hash_object (DECL_PARM_LEVEL (arg
), val
);
1781 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1784 return iterative_hash_template_arg (TARGET_EXPR_INITIAL (arg
), val
);
1787 val
= iterative_hash_template_arg (PTRMEM_CST_CLASS (arg
), val
);
1788 return iterative_hash_template_arg (PTRMEM_CST_MEMBER (arg
), val
);
1790 case TEMPLATE_PARM_INDEX
:
1791 val
= iterative_hash_template_arg
1792 (TREE_TYPE (TEMPLATE_PARM_DECL (arg
)), val
);
1793 val
= iterative_hash_object (TEMPLATE_PARM_LEVEL (arg
), val
);
1794 return iterative_hash_object (TEMPLATE_PARM_IDX (arg
), val
);
1797 val
= iterative_hash_object (TRAIT_EXPR_KIND (arg
), val
);
1798 val
= iterative_hash_template_arg (TRAIT_EXPR_TYPE1 (arg
), val
);
1799 return iterative_hash_template_arg (TRAIT_EXPR_TYPE2 (arg
), val
);
1802 val
= iterative_hash_template_arg (BINFO_TYPE (BASELINK_BINFO (arg
)),
1804 return iterative_hash_template_arg (DECL_NAME (get_first_fn (arg
)),
1808 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, 0), val
);
1809 code
= TREE_CODE (TREE_OPERAND (arg
, 1));
1810 val
= iterative_hash_object (code
, val
);
1811 return iterative_hash_template_arg (TREE_OPERAND (arg
, 2), val
);
1814 /* A lambda can't appear in a template arg, but don't crash on
1816 gcc_assert (seen_error ());
1820 case IMPLICIT_CONV_EXPR
:
1821 case STATIC_CAST_EXPR
:
1822 case REINTERPRET_CAST_EXPR
:
1823 case CONST_CAST_EXPR
:
1824 case DYNAMIC_CAST_EXPR
:
1826 val
= iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1827 /* Now hash operands as usual. */
1837 if (alias_template_specialization_p (arg
))
1839 // We want an alias specialization that survived strip_typedefs
1840 // to hash differently from its TYPE_CANONICAL, to avoid hash
1841 // collisions that compare as different in template_args_equal.
1842 // These could be dependent specializations that strip_typedefs
1843 // left alone, or untouched specializations because
1844 // coerce_template_parms returns the unconverted template
1845 // arguments if it sees incomplete argument packs.
1846 tree ti
= TYPE_ALIAS_TEMPLATE_INFO (arg
);
1847 return hash_tmpl_and_args (TI_TEMPLATE (ti
), TI_ARGS (ti
));
1849 if (TYPE_CANONICAL (arg
))
1850 return iterative_hash_object (TYPE_HASH (TYPE_CANONICAL (arg
)),
1852 else if (TREE_CODE (arg
) == DECLTYPE_TYPE
)
1853 return iterative_hash_template_arg (DECLTYPE_TYPE_EXPR (arg
), val
);
1854 /* Otherwise just compare the types during lookup. */
1857 case tcc_declaration
:
1859 return iterative_hash_expr (arg
, val
);
1862 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
1864 unsigned n
= cp_tree_operand_length (arg
);
1865 for (i
= 0; i
< n
; ++i
)
1866 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, i
), val
);
1874 /* Unregister the specialization SPEC as a specialization of TMPL.
1875 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1876 if the SPEC was listed as a specialization of TMPL.
1878 Note that SPEC has been ggc_freed, so we can't look inside it. */
1881 reregister_specialization (tree spec
, tree tinfo
, tree new_spec
)
1886 elt
.tmpl
= most_general_template (TI_TEMPLATE (tinfo
));
1887 elt
.args
= TI_ARGS (tinfo
);
1888 elt
.spec
= NULL_TREE
;
1890 entry
= decl_specializations
->find (&elt
);
1893 gcc_assert (entry
->spec
== spec
|| entry
->spec
== new_spec
);
1894 gcc_assert (new_spec
!= NULL_TREE
);
1895 entry
->spec
= new_spec
;
1902 /* Like register_specialization, but for local declarations. We are
1903 registering SPEC, an instantiation of TMPL. */
1906 register_local_specialization (tree spec
, tree tmpl
)
1908 gcc_assert (tmpl
!= spec
);
1909 local_specializations
->put (tmpl
, spec
);
1912 /* TYPE is a class type. Returns true if TYPE is an explicitly
1913 specialized class. */
1916 explicit_class_specialization_p (tree type
)
1918 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1920 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1923 /* Print the list of functions at FNS, going through all the overloads
1924 for each element of the list. Alternatively, FNS can not be a
1925 TREE_LIST, in which case it will be printed together with all the
1928 MORE and *STR should respectively be FALSE and NULL when the function
1929 is called from the outside. They are used internally on recursive
1930 calls. print_candidates manages the two parameters and leaves NULL
1931 in *STR when it ends. */
1934 print_candidates_1 (tree fns
, char **str
, bool more
= false)
1936 if (TREE_CODE (fns
) == TREE_LIST
)
1937 for (; fns
; fns
= TREE_CHAIN (fns
))
1938 print_candidates_1 (TREE_VALUE (fns
), str
, more
|| TREE_CHAIN (fns
));
1940 for (lkp_iterator
iter (fns
); iter
;)
1945 const char *pfx
= *str
;
1949 pfx
= _("candidates are:");
1951 pfx
= _("candidate is:");
1952 *str
= get_spaces (pfx
);
1954 inform (DECL_SOURCE_LOCATION (cand
), "%s %#qD", pfx
, cand
);
1958 /* Print the list of candidate FNS in an error message. FNS can also
1959 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
1962 print_candidates (tree fns
)
1965 print_candidates_1 (fns
, &str
);
1969 /* Get a (possibly) constrained template declaration for the
1970 purpose of ordering candidates. */
1972 get_template_for_ordering (tree list
)
1974 gcc_assert (TREE_CODE (list
) == TREE_LIST
);
1975 tree f
= TREE_VALUE (list
);
1976 if (tree ti
= DECL_TEMPLATE_INFO (f
))
1977 return TI_TEMPLATE (ti
);
1981 /* Among candidates having the same signature, return the
1982 most constrained or NULL_TREE if there is no best candidate.
1983 If the signatures of candidates vary (e.g., template
1984 specialization vs. member function), then there can be no
1987 Note that we don't compare constraints on the functions
1988 themselves, but rather those of their templates. */
1990 most_constrained_function (tree candidates
)
1992 // Try to find the best candidate in a first pass.
1993 tree champ
= candidates
;
1994 for (tree c
= TREE_CHAIN (champ
); c
; c
= TREE_CHAIN (c
))
1996 int winner
= more_constrained (get_template_for_ordering (champ
),
1997 get_template_for_ordering (c
));
1999 champ
= c
; // The candidate is more constrained
2000 else if (winner
== 0)
2001 return NULL_TREE
; // Neither is more constrained
2004 // Verify that the champ is better than previous candidates.
2005 for (tree c
= candidates
; c
!= champ
; c
= TREE_CHAIN (c
)) {
2006 if (!more_constrained (get_template_for_ordering (champ
),
2007 get_template_for_ordering (c
)))
2015 /* Returns the template (one of the functions given by TEMPLATE_ID)
2016 which can be specialized to match the indicated DECL with the
2017 explicit template args given in TEMPLATE_ID. The DECL may be
2018 NULL_TREE if none is available. In that case, the functions in
2019 TEMPLATE_ID are non-members.
2021 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
2022 specialization of a member template.
2024 The TEMPLATE_COUNT is the number of references to qualifying
2025 template classes that appeared in the name of the function. See
2026 check_explicit_specialization for a more accurate description.
2028 TSK indicates what kind of template declaration (if any) is being
2029 declared. TSK_TEMPLATE indicates that the declaration given by
2030 DECL, though a FUNCTION_DECL, has template parameters, and is
2031 therefore a template function.
2033 The template args (those explicitly specified and those deduced)
2034 are output in a newly created vector *TARGS_OUT.
2036 If it is impossible to determine the result, an error message is
2037 issued. The error_mark_node is returned to indicate failure. */
2040 determine_specialization (tree template_id
,
2043 int need_member_template
,
2049 tree explicit_targs
;
2050 tree candidates
= NULL_TREE
;
2052 /* A TREE_LIST of templates of which DECL may be a specialization.
2053 The TREE_VALUE of each node is a TEMPLATE_DECL. The
2054 corresponding TREE_PURPOSE is the set of template arguments that,
2055 when used to instantiate the template, would produce a function
2056 with the signature of DECL. */
2057 tree templates
= NULL_TREE
;
2059 cp_binding_level
*b
;
2061 *targs_out
= NULL_TREE
;
2063 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
2064 return error_mark_node
;
2066 /* We shouldn't be specializing a member template of an
2067 unspecialized class template; we already gave an error in
2068 check_specialization_scope, now avoid crashing. */
2070 && template_count
&& DECL_CLASS_SCOPE_P (decl
)
2071 && template_class_depth (DECL_CONTEXT (decl
)) > 0)
2073 gcc_assert (errorcount
);
2074 return error_mark_node
;
2077 fns
= TREE_OPERAND (template_id
, 0);
2078 explicit_targs
= TREE_OPERAND (template_id
, 1);
2080 if (fns
== error_mark_node
)
2081 return error_mark_node
;
2083 /* Check for baselinks. */
2084 if (BASELINK_P (fns
))
2085 fns
= BASELINK_FUNCTIONS (fns
);
2087 if (TREE_CODE (decl
) == FUNCTION_DECL
&& !is_overloaded_fn (fns
))
2089 error ("%qD is not a function template", fns
);
2090 return error_mark_node
;
2092 else if (VAR_P (decl
) && !variable_template_p (fns
))
2094 error ("%qD is not a variable template", fns
);
2095 return error_mark_node
;
2098 /* Count the number of template headers specified for this
2101 for (b
= current_binding_level
;
2102 b
->kind
== sk_template_parms
;
2106 tree orig_fns
= fns
;
2108 if (variable_template_p (fns
))
2110 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (fns
));
2111 targs
= coerce_template_parms (parms
, explicit_targs
, fns
,
2112 tf_warning_or_error
,
2113 /*req_all*/true, /*use_defarg*/true);
2114 if (targs
!= error_mark_node
)
2115 templates
= tree_cons (targs
, fns
, templates
);
2117 else for (lkp_iterator
iter (fns
); iter
; ++iter
)
2121 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2123 tree decl_arg_types
;
2127 /* In case of explicit specialization, we need to check if
2128 the number of template headers appearing in the specialization
2129 is correct. This is usually done in check_explicit_specialization,
2130 but the check done there cannot be exhaustive when specializing
2131 member functions. Consider the following code:
2133 template <> void A<int>::f(int);
2134 template <> template <> void A<int>::f(int);
2136 Assuming that A<int> is not itself an explicit specialization
2137 already, the first line specializes "f" which is a non-template
2138 member function, whilst the second line specializes "f" which
2139 is a template member function. So both lines are syntactically
2140 correct, and check_explicit_specialization does not reject
2143 Here, we can do better, as we are matching the specialization
2144 against the declarations. We count the number of template
2145 headers, and we check if they match TEMPLATE_COUNT + 1
2146 (TEMPLATE_COUNT is the number of qualifying template classes,
2147 plus there must be another header for the member template
2150 Notice that if header_count is zero, this is not a
2151 specialization but rather a template instantiation, so there
2152 is no check we can perform here. */
2153 if (header_count
&& header_count
!= template_count
+ 1)
2156 /* Check that the number of template arguments at the
2157 innermost level for DECL is the same as for FN. */
2158 if (current_binding_level
->kind
== sk_template_parms
2159 && !current_binding_level
->explicit_spec_p
2160 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
2161 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
2162 (current_template_parms
))))
2165 /* DECL might be a specialization of FN. */
2166 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2167 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
2169 /* For a non-static member function, we need to make sure
2170 that the const qualification is the same. Since
2171 get_bindings does not try to merge the "this" parameter,
2172 we must do the comparison explicitly. */
2173 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
2175 if (!same_type_p (TREE_VALUE (fn_arg_types
),
2176 TREE_VALUE (decl_arg_types
)))
2179 /* And the ref-qualification. */
2180 if (type_memfn_rqual (TREE_TYPE (decl
))
2181 != type_memfn_rqual (TREE_TYPE (fn
)))
2185 /* Skip the "this" parameter and, for constructors of
2186 classes with virtual bases, the VTT parameter. A
2187 full specialization of a constructor will have a VTT
2188 parameter, but a template never will. */
2190 = skip_artificial_parms_for (decl
, decl_arg_types
);
2192 = skip_artificial_parms_for (fn
, fn_arg_types
);
2194 /* Function templates cannot be specializations; there are
2195 no partial specializations of functions. Therefore, if
2196 the type of DECL does not match FN, there is no
2199 Note that it should never be the case that we have both
2200 candidates added here, and for regular member functions
2202 if (tsk
== tsk_template
)
2204 if (compparms (fn_arg_types
, decl_arg_types
))
2205 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2209 /* See whether this function might be a specialization of this
2210 template. Suppress access control because we might be trying
2211 to make this specialization a friend, and we have already done
2212 access control for the declaration of the specialization. */
2213 push_deferring_access_checks (dk_no_check
);
2214 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
2215 pop_deferring_access_checks ();
2218 /* We cannot deduce template arguments that when used to
2219 specialize TMPL will produce DECL. */
2222 if (uses_template_parms (targs
))
2223 /* We deduced something involving 'auto', which isn't a valid
2224 template argument. */
2227 /* Remove, from the set of candidates, all those functions
2228 whose constraints are not satisfied. */
2229 if (flag_concepts
&& !constraints_satisfied_p (fn
, targs
))
2232 // Then, try to form the new function type.
2233 insttype
= tsubst (TREE_TYPE (fn
), targs
, tf_fndecl_type
, NULL_TREE
);
2234 if (insttype
== error_mark_node
)
2237 = skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (insttype
));
2238 if (!compparms (fn_arg_types
, decl_arg_types
))
2241 /* Save this template, and the arguments deduced. */
2242 templates
= tree_cons (targs
, fn
, templates
);
2244 else if (need_member_template
)
2245 /* FN is an ordinary member function, and we need a
2246 specialization of a member template. */
2248 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
2249 /* We can get IDENTIFIER_NODEs here in certain erroneous
2252 else if (!DECL_FUNCTION_MEMBER_P (fn
))
2253 /* This is just an ordinary non-member function. Nothing can
2254 be a specialization of that. */
2256 else if (DECL_ARTIFICIAL (fn
))
2257 /* Cannot specialize functions that are created implicitly. */
2261 tree decl_arg_types
;
2263 /* This is an ordinary member function. However, since
2264 we're here, we can assume its enclosing class is a
2265 template class. For example,
2267 template <typename T> struct S { void f(); };
2268 template <> void S<int>::f() {}
2270 Here, S<int>::f is a non-template, but S<int> is a
2271 template class. If FN has the same type as DECL, we
2272 might be in business. */
2274 if (!DECL_TEMPLATE_INFO (fn
))
2275 /* Its enclosing class is an explicit specialization
2276 of a template class. This is not a candidate. */
2279 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
2280 TREE_TYPE (TREE_TYPE (fn
))))
2281 /* The return types differ. */
2284 /* Adjust the type of DECL in case FN is a static member. */
2285 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2286 if (DECL_STATIC_FUNCTION_P (fn
)
2287 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2288 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
2290 if (!compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
2294 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2295 && (type_memfn_rqual (TREE_TYPE (decl
))
2296 != type_memfn_rqual (TREE_TYPE (fn
))))
2299 // If the deduced arguments do not satisfy the constraints,
2300 // this is not a candidate.
2301 if (flag_concepts
&& !constraints_satisfied_p (fn
))
2304 // Add the candidate.
2305 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2309 if (templates
&& TREE_CHAIN (templates
))
2315 It is possible for a specialization with a given function
2316 signature to be instantiated from more than one function
2317 template. In such cases, explicit specification of the
2318 template arguments must be used to uniquely identify the
2319 function template specialization being specialized.
2321 Note that here, there's no suggestion that we're supposed to
2322 determine which of the candidate templates is most
2323 specialized. However, we, also have:
2327 Partial ordering of overloaded function template
2328 declarations is used in the following contexts to select
2329 the function template to which a function template
2330 specialization refers:
2332 -- when an explicit specialization refers to a function
2335 So, we do use the partial ordering rules, at least for now.
2336 This extension can only serve to make invalid programs valid,
2337 so it's safe. And, there is strong anecdotal evidence that
2338 the committee intended the partial ordering rules to apply;
2339 the EDG front end has that behavior, and John Spicer claims
2340 that the committee simply forgot to delete the wording in
2341 [temp.expl.spec]. */
2342 tree tmpl
= most_specialized_instantiation (templates
);
2343 if (tmpl
!= error_mark_node
)
2346 TREE_CHAIN (templates
) = NULL_TREE
;
2350 // Concepts allows multiple declarations of member functions
2351 // with the same signature. Like above, we need to rely on
2352 // on the partial ordering of those candidates to determine which
2354 if (flag_concepts
&& candidates
&& TREE_CHAIN (candidates
))
2356 if (tree cand
= most_constrained_function (candidates
))
2359 TREE_CHAIN (cand
) = NULL_TREE
;
2363 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
2365 error ("template-id %qD for %q+D does not match any template "
2366 "declaration", template_id
, decl
);
2367 if (header_count
&& header_count
!= template_count
+ 1)
2368 inform (input_location
, "saw %d %<template<>%>, need %d for "
2369 "specializing a member function template",
2370 header_count
, template_count
+ 1);
2372 print_candidates (orig_fns
);
2373 return error_mark_node
;
2375 else if ((templates
&& TREE_CHAIN (templates
))
2376 || (candidates
&& TREE_CHAIN (candidates
))
2377 || (templates
&& candidates
))
2379 error ("ambiguous template specialization %qD for %q+D",
2381 candidates
= chainon (candidates
, templates
);
2382 print_candidates (candidates
);
2383 return error_mark_node
;
2386 /* We have one, and exactly one, match. */
2389 tree fn
= TREE_VALUE (candidates
);
2390 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
2392 // Propagate the candidate's constraints to the declaration.
2393 set_constraints (decl
, get_constraints (fn
));
2395 /* DECL is a re-declaration or partial instantiation of a template
2397 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2399 /* It was a specialization of an ordinary member function in a
2401 return DECL_TI_TEMPLATE (fn
);
2404 /* It was a specialization of a template. */
2405 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
2406 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
2408 *targs_out
= copy_node (targs
);
2409 SET_TMPL_ARGS_LEVEL (*targs_out
,
2410 TMPL_ARGS_DEPTH (*targs_out
),
2411 TREE_PURPOSE (templates
));
2414 *targs_out
= TREE_PURPOSE (templates
);
2415 return TREE_VALUE (templates
);
2418 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2419 but with the default argument values filled in from those in the
2423 copy_default_args_to_explicit_spec_1 (tree spec_types
,
2426 tree new_spec_types
;
2431 if (spec_types
== void_list_node
)
2432 return void_list_node
;
2434 /* Substitute into the rest of the list. */
2436 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
2437 TREE_CHAIN (tmpl_types
));
2439 /* Add the default argument for this parameter. */
2440 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
2441 TREE_VALUE (spec_types
),
2445 /* DECL is an explicit specialization. Replicate default arguments
2446 from the template it specializes. (That way, code like:
2448 template <class T> void f(T = 3);
2449 template <> void f(double);
2452 works, as required.) An alternative approach would be to look up
2453 the correct default arguments at the call-site, but this approach
2454 is consistent with how implicit instantiations are handled. */
2457 copy_default_args_to_explicit_spec (tree decl
)
2462 tree new_spec_types
;
2466 tree object_type
= NULL_TREE
;
2467 tree in_charge
= NULL_TREE
;
2468 tree vtt
= NULL_TREE
;
2470 /* See if there's anything we need to do. */
2471 tmpl
= DECL_TI_TEMPLATE (decl
);
2472 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
2473 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
2474 if (TREE_PURPOSE (t
))
2479 old_type
= TREE_TYPE (decl
);
2480 spec_types
= TYPE_ARG_TYPES (old_type
);
2482 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2484 /* Remove the this pointer, but remember the object's type for
2486 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
2487 spec_types
= TREE_CHAIN (spec_types
);
2488 tmpl_types
= TREE_CHAIN (tmpl_types
);
2490 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
2492 /* DECL may contain more parameters than TMPL due to the extra
2493 in-charge parameter in constructors and destructors. */
2494 in_charge
= spec_types
;
2495 spec_types
= TREE_CHAIN (spec_types
);
2497 if (DECL_HAS_VTT_PARM_P (decl
))
2500 spec_types
= TREE_CHAIN (spec_types
);
2504 /* Compute the merged default arguments. */
2506 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
2508 /* Compute the new FUNCTION_TYPE. */
2512 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
2517 /* Put the in-charge parameter back. */
2518 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
2519 TREE_VALUE (in_charge
),
2522 new_type
= build_method_type_directly (object_type
,
2523 TREE_TYPE (old_type
),
2527 new_type
= build_function_type (TREE_TYPE (old_type
),
2529 new_type
= cp_build_type_attribute_variant (new_type
,
2530 TYPE_ATTRIBUTES (old_type
));
2531 new_type
= build_exception_variant (new_type
,
2532 TYPE_RAISES_EXCEPTIONS (old_type
));
2534 if (TYPE_HAS_LATE_RETURN_TYPE (old_type
))
2535 TYPE_HAS_LATE_RETURN_TYPE (new_type
) = 1;
2537 TREE_TYPE (decl
) = new_type
;
2540 /* Return the number of template headers we expect to see for a definition
2541 or specialization of CTYPE or one of its non-template members. */
2544 num_template_headers_for_class (tree ctype
)
2546 int num_templates
= 0;
2548 while (ctype
&& CLASS_TYPE_P (ctype
))
2550 /* You're supposed to have one `template <...>' for every
2551 template class, but you don't need one for a full
2552 specialization. For example:
2554 template <class T> struct S{};
2555 template <> struct S<int> { void f(); };
2556 void S<int>::f () {}
2558 is correct; there shouldn't be a `template <>' for the
2559 definition of `S<int>::f'. */
2560 if (!CLASSTYPE_TEMPLATE_INFO (ctype
))
2561 /* If CTYPE does not have template information of any
2562 kind, then it is not a template, nor is it nested
2563 within a template. */
2565 if (explicit_class_specialization_p (ctype
))
2567 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (ctype
)))
2570 ctype
= TYPE_CONTEXT (ctype
);
2573 return num_templates
;
2576 /* Do a simple sanity check on the template headers that precede the
2577 variable declaration DECL. */
2580 check_template_variable (tree decl
)
2582 tree ctx
= CP_DECL_CONTEXT (decl
);
2583 int wanted
= num_template_headers_for_class (ctx
);
2584 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
2585 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
2587 if (cxx_dialect
< cxx14
)
2588 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2589 "variable templates only available with "
2590 "-std=c++14 or -std=gnu++14");
2592 // Namespace-scope variable templates should have a template header.
2595 if (template_header_count
> wanted
)
2597 bool warned
= pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2598 "too many template headers for %qD "
2601 if (warned
&& CLASS_TYPE_P (ctx
)
2602 && CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2603 inform (DECL_SOURCE_LOCATION (decl
),
2604 "members of an explicitly specialized class are defined "
2605 "without a template header");
2609 /* An explicit specialization whose declarator-id or class-head-name is not
2610 qualified shall be declared in the nearest enclosing namespace of the
2611 template, or, if the namespace is inline (7.3.1), any namespace from its
2612 enclosing namespace set.
2614 If the name declared in the explicit instantiation is an unqualified name,
2615 the explicit instantiation shall appear in the namespace where its template
2616 is declared or, if that namespace is inline (7.3.1), any namespace from its
2617 enclosing namespace set. */
2620 check_unqualified_spec_or_inst (tree t
, location_t loc
)
2622 tree tmpl
= most_general_template (t
);
2623 if (DECL_NAMESPACE_SCOPE_P (tmpl
)
2624 && !is_nested_namespace (current_namespace
,
2625 CP_DECL_CONTEXT (tmpl
), true))
2627 if (processing_specialization
)
2628 permerror (loc
, "explicit specialization of %qD outside its "
2629 "namespace must use a nested-name-specifier", tmpl
);
2630 else if (processing_explicit_instantiation
2631 && cxx_dialect
>= cxx11
)
2632 /* This was allowed in C++98, so only pedwarn. */
2633 pedwarn (loc
, OPT_Wpedantic
, "explicit instantiation of %qD "
2634 "outside its namespace must use a nested-name-"
2639 /* Warn for a template specialization SPEC that is missing some of a set
2640 of function or type attributes that the template TEMPL is declared with.
2641 ATTRLIST is a list of additional attributes that SPEC should be taken
2642 to ultimately be declared with. */
2645 warn_spec_missing_attributes (tree tmpl
, tree spec
, tree attrlist
)
2647 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
2648 tmpl
= DECL_TEMPLATE_RESULT (tmpl
);
2650 if (TREE_CODE (tmpl
) != FUNCTION_DECL
)
2653 /* Avoid warning if either declaration or its type is deprecated. */
2654 if (TREE_DEPRECATED (tmpl
)
2655 || TREE_DEPRECATED (spec
))
2658 tree tmpl_type
= TREE_TYPE (tmpl
);
2659 tree spec_type
= TREE_TYPE (spec
);
2661 if (TREE_DEPRECATED (tmpl_type
)
2662 || TREE_DEPRECATED (spec_type
)
2663 || TREE_DEPRECATED (TREE_TYPE (tmpl_type
))
2664 || TREE_DEPRECATED (TREE_TYPE (spec_type
)))
2667 tree tmpl_attrs
[] = { DECL_ATTRIBUTES (tmpl
), TYPE_ATTRIBUTES (tmpl_type
) };
2668 tree spec_attrs
[] = { DECL_ATTRIBUTES (spec
), TYPE_ATTRIBUTES (spec_type
) };
2671 spec_attrs
[0] = attrlist
;
2672 else if (!spec_attrs
[1])
2673 spec_attrs
[1] = attrlist
;
2675 /* Avoid warning if the primary has no attributes. */
2676 if (!tmpl_attrs
[0] && !tmpl_attrs
[1])
2679 /* Avoid warning if either declaration contains an attribute on
2680 the white list below. */
2681 const char* const whitelist
[] = {
2685 for (unsigned i
= 0; i
!= 2; ++i
)
2686 for (unsigned j
= 0; j
!= sizeof whitelist
/ sizeof *whitelist
; ++j
)
2687 if (lookup_attribute (whitelist
[j
], tmpl_attrs
[i
])
2688 || lookup_attribute (whitelist
[j
], spec_attrs
[i
]))
2691 /* Avoid warning if the difference between the primary and
2692 the specialization is not in one of the attributes below. */
2693 const char* const blacklist
[] = {
2694 "alloc_align", "alloc_size", "assume_aligned", "format",
2695 "format_arg", "malloc", "nonnull"
2698 /* Put together a list of the black listed attributes that the primary
2699 template is declared with that the specialization is not, in case
2700 it's not apparent from the most recent declaration of the primary. */
2701 unsigned nattrs
= 0;
2704 for (unsigned i
= 0; i
!= sizeof blacklist
/ sizeof *blacklist
; ++i
)
2706 for (unsigned j
= 0; j
!= 2; ++j
)
2708 if (!lookup_attribute (blacklist
[i
], tmpl_attrs
[j
]))
2711 for (unsigned k
= 0; k
!= 1 + !!spec_attrs
[1]; ++k
)
2713 if (lookup_attribute (blacklist
[i
], spec_attrs
[k
]))
2717 pp_string (&str
, ", ");
2718 pp_begin_quote (&str
, pp_show_color (global_dc
->printer
));
2719 pp_string (&str
, blacklist
[i
]);
2720 pp_end_quote (&str
, pp_show_color (global_dc
->printer
));
2729 if (warning_at (DECL_SOURCE_LOCATION (spec
), OPT_Wmissing_attributes
,
2730 "explicit specialization %q#D may be missing attributes",
2732 inform (DECL_SOURCE_LOCATION (tmpl
),
2734 ? G_("missing primary template attributes %s")
2735 : G_("missing primary template attribute %s"),
2736 pp_formatted_text (&str
));
2739 /* Check to see if the function just declared, as indicated in
2740 DECLARATOR, and in DECL, is a specialization of a function
2741 template. We may also discover that the declaration is an explicit
2742 instantiation at this point.
2744 Returns DECL, or an equivalent declaration that should be used
2745 instead if all goes well. Issues an error message if something is
2746 amiss. Returns error_mark_node if the error is not easily
2749 FLAGS is a bitmask consisting of the following flags:
2751 2: The function has a definition.
2752 4: The function is a friend.
2754 The TEMPLATE_COUNT is the number of references to qualifying
2755 template classes that appeared in the name of the function. For
2758 template <class T> struct S { void f(); };
2761 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2762 classes are not counted in the TEMPLATE_COUNT, so that in
2764 template <class T> struct S {};
2765 template <> struct S<int> { void f(); }
2766 template <> void S<int>::f();
2768 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2769 invalid; there should be no template <>.)
2771 If the function is a specialization, it is marked as such via
2772 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2773 is set up correctly, and it is added to the list of specializations
2774 for that template. */
2777 check_explicit_specialization (tree declarator
,
2783 int have_def
= flags
& 2;
2784 int is_friend
= flags
& 4;
2785 bool is_concept
= flags
& 8;
2786 int specialization
= 0;
2787 int explicit_instantiation
= 0;
2788 int member_specialization
= 0;
2789 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2790 tree dname
= DECL_NAME (decl
);
2795 if (!processing_specialization
)
2798 tsk
= tsk_excessive_parms
;
2801 tsk
= current_tmpl_spec_kind (template_count
);
2806 if (processing_specialization
&& !VAR_P (decl
))
2809 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2811 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2814 /* This could be something like:
2816 template <class T> void f(T);
2817 class S { friend void f<>(int); } */
2821 /* This case handles bogus declarations like template <>
2822 template <class T> void f<int>(); */
2824 error ("template-id %qD in declaration of primary template",
2831 case tsk_invalid_member_spec
:
2832 /* The error has already been reported in
2833 check_specialization_scope. */
2834 return error_mark_node
;
2836 case tsk_invalid_expl_inst
:
2837 error ("template parameter list used in explicit instantiation");
2843 error ("definition provided for explicit instantiation");
2845 explicit_instantiation
= 1;
2848 case tsk_excessive_parms
:
2849 case tsk_insufficient_parms
:
2850 if (tsk
== tsk_excessive_parms
)
2851 error ("too many template parameter lists in declaration of %qD",
2853 else if (template_header_count
)
2854 error("too few template parameter lists in declaration of %qD", decl
);
2856 error("explicit specialization of %qD must be introduced by "
2857 "%<template <>%>", decl
);
2862 error ("explicit specialization declared %<concept%>");
2864 if (VAR_P (decl
) && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2865 /* In cases like template<> constexpr bool v = true;
2866 We'll give an error in check_template_variable. */
2869 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2871 member_specialization
= 1;
2877 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2879 /* This case handles bogus declarations like template <>
2880 template <class T> void f<int>(); */
2882 if (!uses_template_parms (declarator
))
2883 error ("template-id %qD in declaration of primary template",
2885 else if (variable_template_p (TREE_OPERAND (declarator
, 0)))
2887 /* Partial specialization of variable template. */
2888 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2892 else if (cxx_dialect
< cxx14
)
2893 error ("non-type partial specialization %qD "
2894 "is not allowed", declarator
);
2896 error ("non-class, non-variable partial specialization %qD "
2897 "is not allowed", declarator
);
2902 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2903 /* This is a specialization of a member template, without
2904 specialization the containing class. Something like:
2906 template <class T> struct S {
2907 template <class U> void f (U);
2909 template <> template <class U> void S<int>::f(U) {}
2911 That's a specialization -- but of the entire template. */
2919 if ((specialization
|| member_specialization
)
2920 /* This doesn't apply to variable templates. */
2921 && (TREE_CODE (TREE_TYPE (decl
)) == FUNCTION_TYPE
2922 || TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
))
2924 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2925 for (; t
; t
= TREE_CHAIN (t
))
2926 if (TREE_PURPOSE (t
))
2928 permerror (input_location
,
2929 "default argument specified in explicit specialization");
2934 if (specialization
|| member_specialization
|| explicit_instantiation
)
2936 tree tmpl
= NULL_TREE
;
2937 tree targs
= NULL_TREE
;
2938 bool was_template_id
= (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
);
2940 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2941 if (!was_template_id
)
2945 gcc_assert (identifier_p (declarator
));
2950 /* If there is no class context, the explicit instantiation
2951 must be at namespace scope. */
2952 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2954 /* Find the namespace binding, using the declaration
2956 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2958 if (fns
== error_mark_node
)
2959 /* If lookup fails, look for a friend declaration so we can
2960 give a better diagnostic. */
2961 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2962 /*type*/false, /*complain*/true,
2965 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2967 error ("%qD is not a template function", dname
);
2968 fns
= error_mark_node
;
2972 declarator
= lookup_template_function (fns
, NULL_TREE
);
2975 if (declarator
== error_mark_node
)
2976 return error_mark_node
;
2978 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2980 if (!explicit_instantiation
)
2981 /* A specialization in class scope. This is invalid,
2982 but the error will already have been flagged by
2983 check_specialization_scope. */
2984 return error_mark_node
;
2987 /* It's not valid to write an explicit instantiation in
2990 class C { template void f(); }
2992 This case is caught by the parser. However, on
2995 template class C { void f(); };
2997 (which is invalid) we can get here. The error will be
3004 else if (ctype
!= NULL_TREE
3005 && (identifier_p (TREE_OPERAND (declarator
, 0))))
3007 // We'll match variable templates in start_decl.
3011 /* Find the list of functions in ctype that have the same
3012 name as the declared function. */
3013 tree name
= TREE_OPERAND (declarator
, 0);
3015 if (constructor_name_p (name
, ctype
))
3017 if (DECL_CONSTRUCTOR_P (decl
)
3018 ? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
3019 : !CLASSTYPE_DESTRUCTOR (ctype
))
3021 /* From [temp.expl.spec]:
3023 If such an explicit specialization for the member
3024 of a class template names an implicitly-declared
3025 special member function (clause _special_), the
3026 program is ill-formed.
3028 Similar language is found in [temp.explicit]. */
3029 error ("specialization of implicitly-declared special member function");
3030 return error_mark_node
;
3033 name
= DECL_NAME (decl
);
3036 /* For a type-conversion operator, We might be looking for
3037 `operator int' which will be a specialization of
3038 `operator T'. Grab all the conversion operators, and
3039 then select from them. */
3040 tree fns
= get_class_binding (ctype
, IDENTIFIER_CONV_OP_P (name
)
3041 ? conv_op_identifier
: name
);
3043 if (fns
== NULL_TREE
)
3045 error ("no member function %qD declared in %qT", name
, ctype
);
3046 return error_mark_node
;
3049 TREE_OPERAND (declarator
, 0) = fns
;
3052 /* Figure out what exactly is being specialized at this point.
3053 Note that for an explicit instantiation, even one for a
3054 member function, we cannot tell a priori whether the
3055 instantiation is for a member template, or just a member
3056 function of a template class. Even if a member template is
3057 being instantiated, the member template arguments may be
3058 elided if they can be deduced from the rest of the
3060 tmpl
= determine_specialization (declarator
, decl
,
3062 member_specialization
,
3066 if (!tmpl
|| tmpl
== error_mark_node
)
3067 /* We couldn't figure out what this declaration was
3069 return error_mark_node
;
3072 if (TREE_CODE (decl
) == FUNCTION_DECL
3073 && DECL_HIDDEN_FRIEND_P (tmpl
))
3075 if (pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
3076 "friend declaration %qD is not visible to "
3077 "explicit specialization", tmpl
))
3078 inform (DECL_SOURCE_LOCATION (tmpl
),
3079 "friend declaration here");
3081 else if (!ctype
&& !is_friend
3082 && CP_DECL_CONTEXT (decl
) == current_namespace
)
3083 check_unqualified_spec_or_inst (tmpl
, DECL_SOURCE_LOCATION (decl
));
3085 tree gen_tmpl
= most_general_template (tmpl
);
3087 if (explicit_instantiation
)
3089 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
3090 is done by do_decl_instantiation later. */
3092 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
3093 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
3095 if (arg_depth
> parm_depth
)
3097 /* If TMPL is not the most general template (for
3098 example, if TMPL is a friend template that is
3099 injected into namespace scope), then there will
3100 be too many levels of TARGS. Remove some of them
3105 new_targs
= make_tree_vec (parm_depth
);
3106 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
3107 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
3108 = TREE_VEC_ELT (targs
, i
);
3112 return instantiate_template (tmpl
, targs
, tf_error
);
3115 /* If we thought that the DECL was a member function, but it
3116 turns out to be specializing a static member function,
3117 make DECL a static member function as well. */
3118 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
3119 && DECL_STATIC_FUNCTION_P (tmpl
)
3120 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
3121 revert_static_member_fn (decl
);
3123 /* If this is a specialization of a member template of a
3124 template class, we want to return the TEMPLATE_DECL, not
3125 the specialization of it. */
3126 if (tsk
== tsk_template
&& !was_template_id
)
3128 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
3129 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
3130 DECL_INITIAL (result
) = NULL_TREE
;
3134 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
3135 DECL_SOURCE_LOCATION (result
)
3136 = DECL_SOURCE_LOCATION (decl
);
3137 /* We want to use the argument list specified in the
3138 definition, not in the original declaration. */
3139 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
3140 for (parm
= DECL_ARGUMENTS (result
); parm
;
3141 parm
= DECL_CHAIN (parm
))
3142 DECL_CONTEXT (parm
) = result
;
3144 return register_specialization (tmpl
, gen_tmpl
, targs
,
3148 /* Set up the DECL_TEMPLATE_INFO for DECL. */
3149 DECL_TEMPLATE_INFO (decl
) = build_template_info (tmpl
, targs
);
3151 if (was_template_id
)
3152 TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
)) = true;
3154 /* Inherit default function arguments from the template
3155 DECL is specializing. */
3156 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
3157 copy_default_args_to_explicit_spec (decl
);
3159 /* This specialization has the same protection as the
3160 template it specializes. */
3161 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
3162 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
3164 /* 7.1.1-1 [dcl.stc]
3166 A storage-class-specifier shall not be specified in an
3167 explicit specialization...
3169 The parser rejects these, so unless action is taken here,
3170 explicit function specializations will always appear with
3173 The action recommended by the C++ CWG in response to C++
3174 defect report 605 is to make the storage class and linkage
3175 of the explicit specialization match the templated function:
3177 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
3179 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
3181 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
3182 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
3184 /* A concept cannot be specialized. */
3185 if (DECL_DECLARED_CONCEPT_P (tmpl_func
))
3187 error ("explicit specialization of function concept %qD",
3189 return error_mark_node
;
3192 /* This specialization has the same linkage and visibility as
3193 the function template it specializes. */
3194 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
3195 if (! TREE_PUBLIC (decl
))
3197 DECL_INTERFACE_KNOWN (decl
) = 1;
3198 DECL_NOT_REALLY_EXTERN (decl
) = 1;
3200 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
3201 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
3203 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
3204 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
3208 /* If DECL is a friend declaration, declared using an
3209 unqualified name, the namespace associated with DECL may
3210 have been set incorrectly. For example, in:
3212 template <typename T> void f(T);
3214 struct S { friend void f<int>(int); }
3217 we will have set the DECL_CONTEXT for the friend
3218 declaration to N, rather than to the global namespace. */
3219 if (DECL_NAMESPACE_SCOPE_P (decl
))
3220 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
3222 if (is_friend
&& !have_def
)
3223 /* This is not really a declaration of a specialization.
3224 It's just the name of an instantiation. But, it's not
3225 a request for an instantiation, either. */
3226 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
3227 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
3228 /* A specialization is not necessarily COMDAT. */
3229 DECL_COMDAT (decl
) = (TREE_PUBLIC (decl
)
3230 && DECL_DECLARED_INLINE_P (decl
));
3231 else if (VAR_P (decl
))
3232 DECL_COMDAT (decl
) = false;
3234 /* If this is a full specialization, register it so that we can find
3235 it again. Partial specializations will be registered in
3236 process_partial_specialization. */
3237 if (!processing_template_decl
)
3239 warn_spec_missing_attributes (gen_tmpl
, decl
, attrlist
);
3241 decl
= register_specialization (decl
, gen_tmpl
, targs
,
3246 /* A 'structor should already have clones. */
3247 gcc_assert (decl
== error_mark_node
3248 || variable_template_p (tmpl
)
3249 || !(DECL_CONSTRUCTOR_P (decl
)
3250 || DECL_DESTRUCTOR_P (decl
))
3251 || DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)));
3258 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
3259 parameters. These are represented in the same format used for
3260 DECL_TEMPLATE_PARMS. */
3263 comp_template_parms (const_tree parms1
, const_tree parms2
)
3268 if (parms1
== parms2
)
3271 for (p1
= parms1
, p2
= parms2
;
3272 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
3273 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
3275 tree t1
= TREE_VALUE (p1
);
3276 tree t2
= TREE_VALUE (p2
);
3279 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
3280 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
3282 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
3285 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
3287 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
3288 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
3290 /* If either of the template parameters are invalid, assume
3291 they match for the sake of error recovery. */
3292 if (error_operand_p (parm1
) || error_operand_p (parm2
))
3295 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
3298 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
3299 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
3300 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
3302 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
3307 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
3308 /* One set of parameters has more parameters lists than the
3315 /* Determine whether PARM is a parameter pack. */
3318 template_parameter_pack_p (const_tree parm
)
3320 /* Determine if we have a non-type template parameter pack. */
3321 if (TREE_CODE (parm
) == PARM_DECL
)
3322 return (DECL_TEMPLATE_PARM_P (parm
)
3323 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
3324 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
3325 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
3327 /* If this is a list of template parameters, we could get a
3328 TYPE_DECL or a TEMPLATE_DECL. */
3329 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
3330 parm
= TREE_TYPE (parm
);
3332 /* Otherwise it must be a type template parameter. */
3333 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
3334 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
3335 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
3338 /* Determine if T is a function parameter pack. */
3341 function_parameter_pack_p (const_tree t
)
3343 if (t
&& TREE_CODE (t
) == PARM_DECL
)
3344 return DECL_PACK_P (t
);
3348 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
3349 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
3352 get_function_template_decl (const_tree primary_func_tmpl_inst
)
3354 if (! primary_func_tmpl_inst
3355 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
3356 || ! primary_template_specialization_p (primary_func_tmpl_inst
))
3359 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
3362 /* Return true iff the function parameter PARAM_DECL was expanded
3363 from the function parameter pack PACK. */
3366 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
3368 if (DECL_ARTIFICIAL (param_decl
)
3369 || !function_parameter_pack_p (pack
))
3372 /* The parameter pack and its pack arguments have the same
3374 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
3377 /* Determine whether ARGS describes a variadic template args list,
3378 i.e., one that is terminated by a template argument pack. */
3381 template_args_variadic_p (tree args
)
3386 if (args
== NULL_TREE
)
3389 args
= INNERMOST_TEMPLATE_ARGS (args
);
3390 nargs
= TREE_VEC_LENGTH (args
);
3395 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
3397 return ARGUMENT_PACK_P (last_parm
);
3400 /* Generate a new name for the parameter pack name NAME (an
3401 IDENTIFIER_NODE) that incorporates its */
3404 make_ith_pack_parameter_name (tree name
, int i
)
3406 /* Munge the name to include the parameter index. */
3407 #define NUMBUF_LEN 128
3408 char numbuf
[NUMBUF_LEN
];
3412 if (name
== NULL_TREE
)
3414 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
3415 newname_len
= IDENTIFIER_LENGTH (name
)
3416 + strlen (numbuf
) + 2;
3417 newname
= (char*)alloca (newname_len
);
3418 snprintf (newname
, newname_len
,
3419 "%s#%i", IDENTIFIER_POINTER (name
), i
);
3420 return get_identifier (newname
);
3423 /* Return true if T is a primary function, class or alias template
3424 specialization, not including the template pattern. */
3427 primary_template_specialization_p (const_tree t
)
3432 if (TREE_CODE (t
) == FUNCTION_DECL
|| VAR_P (t
))
3433 return (DECL_LANG_SPECIFIC (t
)
3434 && DECL_USE_TEMPLATE (t
)
3435 && DECL_TEMPLATE_INFO (t
)
3436 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
)));
3437 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
3438 return (CLASSTYPE_TEMPLATE_INFO (t
)
3439 && CLASSTYPE_USE_TEMPLATE (t
)
3440 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
)));
3441 else if (alias_template_specialization_p (t
))
3446 /* Return true if PARM is a template template parameter. */
3449 template_template_parameter_p (const_tree parm
)
3451 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
3454 /* Return true iff PARM is a DECL representing a type template
3458 template_type_parameter_p (const_tree parm
)
3461 && (TREE_CODE (parm
) == TYPE_DECL
3462 || TREE_CODE (parm
) == TEMPLATE_DECL
)
3463 && DECL_TEMPLATE_PARM_P (parm
));
3466 /* Return the template parameters of T if T is a
3467 primary template instantiation, NULL otherwise. */
3470 get_primary_template_innermost_parameters (const_tree t
)
3472 tree parms
= NULL
, template_info
= NULL
;
3474 if ((template_info
= get_template_info (t
))
3475 && primary_template_specialization_p (t
))
3476 parms
= INNERMOST_TEMPLATE_PARMS
3477 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
3482 /* Return the template parameters of the LEVELth level from the full list
3483 of template parameters PARMS. */
3486 get_template_parms_at_level (tree parms
, int level
)
3490 || TREE_CODE (parms
) != TREE_LIST
3491 || level
> TMPL_PARMS_DEPTH (parms
))
3494 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
3495 if (TMPL_PARMS_DEPTH (p
) == level
)
3501 /* Returns the template arguments of T if T is a template instantiation,
3505 get_template_innermost_arguments (const_tree t
)
3507 tree args
= NULL
, template_info
= NULL
;
3509 if ((template_info
= get_template_info (t
))
3510 && TI_ARGS (template_info
))
3511 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
3516 /* Return the argument pack elements of T if T is a template argument pack,
3520 get_template_argument_pack_elems (const_tree t
)
3522 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
3523 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
3526 return ARGUMENT_PACK_ARGS (t
);
3529 /* In an ARGUMENT_PACK_SELECT, the actual underlying argument that the
3530 ARGUMENT_PACK_SELECT represents. */
3533 argument_pack_select_arg (tree t
)
3535 tree args
= ARGUMENT_PACK_ARGS (ARGUMENT_PACK_SELECT_FROM_PACK (t
));
3536 tree arg
= TREE_VEC_ELT (args
, ARGUMENT_PACK_SELECT_INDEX (t
));
3538 /* If the selected argument is an expansion E, that most likely means we were
3539 called from gen_elem_of_pack_expansion_instantiation during the
3540 substituting of an argument pack (of which the Ith element is a pack
3541 expansion, where I is ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
3542 In this case, the Ith element resulting from this substituting is going to
3543 be a pack expansion, which pattern is the pattern of E. Let's return the
3544 pattern of E, and gen_elem_of_pack_expansion_instantiation will build the
3545 resulting pack expansion from it. */
3546 if (PACK_EXPANSION_P (arg
))
3548 /* Make sure we aren't throwing away arg info. */
3549 gcc_assert (!PACK_EXPANSION_EXTRA_ARGS (arg
));
3550 arg
= PACK_EXPANSION_PATTERN (arg
);
3557 /* True iff FN is a function representing a built-in variadic parameter
3561 builtin_pack_fn_p (tree fn
)
3564 || TREE_CODE (fn
) != FUNCTION_DECL
3565 || !DECL_IS_BUILTIN (fn
))
3568 if (id_equal (DECL_NAME (fn
), "__integer_pack"))
3574 /* True iff CALL is a call to a function representing a built-in variadic
3578 builtin_pack_call_p (tree call
)
3580 if (TREE_CODE (call
) != CALL_EXPR
)
3582 return builtin_pack_fn_p (CALL_EXPR_FN (call
));
3585 /* Return a TREE_VEC for the expansion of __integer_pack(HI). */
3588 expand_integer_pack (tree call
, tree args
, tsubst_flags_t complain
,
3591 tree ohi
= CALL_EXPR_ARG (call
, 0);
3592 tree hi
= tsubst_copy_and_build (ohi
, args
, complain
, in_decl
,
3593 false/*fn*/, true/*int_cst*/);
3595 if (value_dependent_expression_p (hi
))
3599 call
= copy_node (call
);
3600 CALL_EXPR_ARG (call
, 0) = hi
;
3602 tree ex
= make_pack_expansion (call
, complain
);
3603 tree vec
= make_tree_vec (1);
3604 TREE_VEC_ELT (vec
, 0) = ex
;
3609 hi
= cxx_constant_value (hi
);
3610 int len
= valid_constant_size_p (hi
) ? tree_to_shwi (hi
) : -1;
3612 /* Calculate the largest value of len that won't make the size of the vec
3613 overflow an int. The compiler will exceed resource limits long before
3614 this, but it seems a decent place to diagnose. */
3615 int max
= ((INT_MAX
- sizeof (tree_vec
)) / sizeof (tree
)) + 1;
3617 if (len
< 0 || len
> max
)
3619 if ((complain
& tf_error
)
3620 && hi
!= error_mark_node
)
3621 error ("argument to __integer_pack must be between 0 and %d", max
);
3622 return error_mark_node
;
3625 tree vec
= make_tree_vec (len
);
3627 for (int i
= 0; i
< len
; ++i
)
3628 TREE_VEC_ELT (vec
, i
) = size_int (i
);
3634 /* Return a TREE_VEC for the expansion of built-in template parameter pack
3638 expand_builtin_pack_call (tree call
, tree args
, tsubst_flags_t complain
,
3641 if (!builtin_pack_call_p (call
))
3644 tree fn
= CALL_EXPR_FN (call
);
3646 if (id_equal (DECL_NAME (fn
), "__integer_pack"))
3647 return expand_integer_pack (call
, args
, complain
, in_decl
);
3652 /* Structure used to track the progress of find_parameter_packs_r. */
3653 struct find_parameter_pack_data
3655 /* TREE_LIST that will contain all of the parameter packs found by
3657 tree
* parameter_packs
;
3659 /* Set of AST nodes that have been visited by the traversal. */
3660 hash_set
<tree
> *visited
;
3662 /* True iff we're making a type pack expansion. */
3663 bool type_pack_expansion_p
;
3666 /* Identifies all of the argument packs that occur in a template
3667 argument and appends them to the TREE_LIST inside DATA, which is a
3668 find_parameter_pack_data structure. This is a subroutine of
3669 make_pack_expansion and uses_parameter_packs. */
3671 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3674 struct find_parameter_pack_data
* ppd
=
3675 (struct find_parameter_pack_data
*)data
;
3676 bool parameter_pack_p
= false;
3678 /* Handle type aliases/typedefs. */
3679 if (TYPE_ALIAS_P (t
))
3681 if (tree tinfo
= TYPE_ALIAS_TEMPLATE_INFO (t
))
3682 cp_walk_tree (&TI_ARGS (tinfo
),
3683 &find_parameter_packs_r
,
3689 /* Identify whether this is a parameter pack or not. */
3690 switch (TREE_CODE (t
))
3692 case TEMPLATE_PARM_INDEX
:
3693 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3694 parameter_pack_p
= true;
3697 case TEMPLATE_TYPE_PARM
:
3698 t
= TYPE_MAIN_VARIANT (t
);
3700 case TEMPLATE_TEMPLATE_PARM
:
3701 /* If the placeholder appears in the decl-specifier-seq of a function
3702 parameter pack (14.6.3), or the type-specifier-seq of a type-id that
3703 is a pack expansion, the invented template parameter is a template
3705 if (ppd
->type_pack_expansion_p
&& is_auto (t
))
3706 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
3707 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3708 parameter_pack_p
= true;
3713 if (DECL_PACK_P (t
))
3715 /* We don't want to walk into the type of a PARM_DECL,
3716 because we don't want to see the type parameter pack. */
3718 parameter_pack_p
= true;
3723 if (DECL_PACK_P (t
))
3725 /* We don't want to walk into the type of a variadic capture proxy,
3726 because we don't want to see the type parameter pack. */
3728 parameter_pack_p
= true;
3730 else if (variable_template_specialization_p (t
))
3732 cp_walk_tree (&DECL_TI_ARGS (t
),
3733 find_parameter_packs_r
,
3740 if (builtin_pack_call_p (t
))
3741 parameter_pack_p
= true;
3745 parameter_pack_p
= true;
3748 /* Not a parameter pack. */
3752 if (parameter_pack_p
)
3754 /* Add this parameter pack to the list. */
3755 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3759 cp_walk_tree (&TYPE_CONTEXT (t
),
3760 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3762 /* This switch statement will return immediately if we don't find a
3764 switch (TREE_CODE (t
))
3766 case TEMPLATE_PARM_INDEX
:
3769 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3770 /* Check the template itself. */
3771 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3772 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3773 /* Check the template arguments. */
3774 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3779 case TEMPLATE_TYPE_PARM
:
3780 case TEMPLATE_TEMPLATE_PARM
:
3787 /* Ignore the declaration of a capture proxy for a parameter pack. */
3788 if (is_capture_proxy (DECL_EXPR_DECL (t
)))
3793 if (TYPE_PTRMEMFUNC_P (t
))
3799 if (TYPE_TEMPLATE_INFO (t
))
3800 cp_walk_tree (&TYPE_TI_ARGS (t
),
3801 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3807 if (!DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
3812 cp_walk_tree (&TREE_TYPE (t
),
3813 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3817 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3822 case TYPE_PACK_EXPANSION
:
3823 case EXPR_PACK_EXPANSION
:
3828 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3833 case IDENTIFIER_NODE
:
3834 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3841 /* Look at explicit captures. */
3842 for (tree cap
= LAMBDA_EXPR_CAPTURE_LIST (t
);
3843 cap
; cap
= TREE_CHAIN (cap
))
3844 cp_walk_tree (&TREE_VALUE (cap
), &find_parameter_packs_r
, ppd
,
3846 /* Since we defer implicit capture, look in the body as well. */
3847 tree fn
= lambda_function (t
);
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 argument packs", arg
);
4012 error ("expansion pattern %qE contains no argument 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
)
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 location_t loc
= EXPR_LOC_OR_LOC (t
, input_location
);
4063 error_at (loc
, "parameter packs not expanded with %<...%>:");
4064 while (parameter_packs
)
4066 tree pack
= TREE_VALUE (parameter_packs
);
4067 tree name
= NULL_TREE
;
4069 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
4070 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
4071 name
= TYPE_NAME (pack
);
4072 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
4073 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
4074 else if (TREE_CODE (pack
) == CALL_EXPR
)
4075 name
= DECL_NAME (CALL_EXPR_FN (pack
));
4077 name
= DECL_NAME (pack
);
4080 inform (loc
, " %qD", name
);
4082 inform (loc
, " <anonymous>");
4084 parameter_packs
= TREE_CHAIN (parameter_packs
);
4093 /* Expand any parameter packs that occur in the template arguments in
4096 expand_template_argument_pack (tree args
)
4098 if (args
== error_mark_node
)
4099 return error_mark_node
;
4101 tree result_args
= NULL_TREE
;
4102 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
4103 int num_result_args
= -1;
4104 int non_default_args_count
= -1;
4106 /* First, determine if we need to expand anything, and the number of
4107 slots we'll need. */
4108 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
4110 tree arg
= TREE_VEC_ELT (args
, in_arg
);
4111 if (arg
== NULL_TREE
)
4113 if (ARGUMENT_PACK_P (arg
))
4115 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
4116 if (num_result_args
< 0)
4117 num_result_args
= in_arg
+ num_packed
;
4119 num_result_args
+= num_packed
;
4123 if (num_result_args
>= 0)
4128 /* If no expansion is necessary, we're done. */
4129 if (num_result_args
< 0)
4132 /* Expand arguments. */
4133 result_args
= make_tree_vec (num_result_args
);
4134 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
4135 non_default_args_count
=
4136 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
4137 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
4139 tree arg
= TREE_VEC_ELT (args
, in_arg
);
4140 if (ARGUMENT_PACK_P (arg
))
4142 tree packed
= ARGUMENT_PACK_ARGS (arg
);
4143 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
4144 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
4145 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
4146 if (non_default_args_count
> 0)
4147 non_default_args_count
+= num_packed
- 1;
4151 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
4155 if (non_default_args_count
>= 0)
4156 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
4160 /* Checks if DECL shadows a template parameter.
4162 [temp.local]: A template-parameter shall not be redeclared within its
4163 scope (including nested scopes).
4165 Emits an error and returns TRUE if the DECL shadows a parameter,
4166 returns FALSE otherwise. */
4169 check_template_shadow (tree decl
)
4173 /* If we're not in a template, we can't possibly shadow a template
4175 if (!current_template_parms
)
4178 /* Figure out what we're shadowing. */
4179 decl
= OVL_FIRST (decl
);
4180 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
4182 /* If there's no previous binding for this name, we're not shadowing
4183 anything, let alone a template parameter. */
4187 /* If we're not shadowing a template parameter, we're done. Note
4188 that OLDDECL might be an OVERLOAD (or perhaps even an
4189 ERROR_MARK), so we can't just blithely assume it to be a _DECL
4191 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
4194 /* We check for decl != olddecl to avoid bogus errors for using a
4195 name inside a class. We check TPFI to avoid duplicate errors for
4196 inline member templates. */
4198 || (DECL_TEMPLATE_PARM_P (decl
)
4199 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
)))
4202 /* Don't complain about the injected class name, as we've already
4203 complained about the class itself. */
4204 if (DECL_SELF_REFERENCE_P (decl
))
4207 if (DECL_TEMPLATE_PARM_P (decl
))
4208 error ("declaration of template parameter %q+D shadows "
4209 "template parameter", decl
);
4211 error ("declaration of %q+#D shadows template parameter", decl
);
4212 inform (DECL_SOURCE_LOCATION (olddecl
),
4213 "template parameter %qD declared here", olddecl
);
4217 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
4218 ORIG_LEVEL, DECL, and TYPE. */
4221 build_template_parm_index (int index
,
4227 tree t
= make_node (TEMPLATE_PARM_INDEX
);
4228 TEMPLATE_PARM_IDX (t
) = index
;
4229 TEMPLATE_PARM_LEVEL (t
) = level
;
4230 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
4231 TEMPLATE_PARM_DECL (t
) = decl
;
4232 TREE_TYPE (t
) = type
;
4233 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
4234 TREE_READONLY (t
) = TREE_READONLY (decl
);
4239 /* Find the canonical type parameter for the given template type
4240 parameter. Returns the canonical type parameter, which may be TYPE
4241 if no such parameter existed. */
4244 canonical_type_parameter (tree type
)
4247 int idx
= TEMPLATE_TYPE_IDX (type
);
4248 if (!canonical_template_parms
)
4249 vec_alloc (canonical_template_parms
, idx
+ 1);
4251 if (canonical_template_parms
->length () <= (unsigned) idx
)
4252 vec_safe_grow_cleared (canonical_template_parms
, idx
+ 1);
4254 list
= (*canonical_template_parms
)[idx
];
4255 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
4256 list
= TREE_CHAIN (list
);
4259 return TREE_VALUE (list
);
4262 (*canonical_template_parms
)[idx
]
4263 = tree_cons (NULL_TREE
, type
, (*canonical_template_parms
)[idx
]);
4268 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
4269 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
4270 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
4271 new one is created. */
4274 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
4275 tsubst_flags_t complain
)
4277 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
4278 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
4279 != TEMPLATE_PARM_LEVEL (index
) - levels
)
4280 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
4282 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
4285 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
4286 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
4287 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
4288 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
4289 DECL_ARTIFICIAL (decl
) = 1;
4290 SET_DECL_TEMPLATE_PARM_P (decl
);
4292 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
4293 TEMPLATE_PARM_LEVEL (index
) - levels
,
4294 TEMPLATE_PARM_ORIG_LEVEL (index
),
4296 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
4297 TEMPLATE_PARM_PARAMETER_PACK (t
)
4298 = TEMPLATE_PARM_PARAMETER_PACK (index
);
4300 /* Template template parameters need this. */
4301 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4303 DECL_TEMPLATE_RESULT (decl
)
4304 = build_decl (DECL_SOURCE_LOCATION (decl
),
4305 TYPE_DECL
, DECL_NAME (decl
), type
);
4306 DECL_ARTIFICIAL (DECL_TEMPLATE_RESULT (decl
)) = true;
4307 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
4308 (DECL_TEMPLATE_PARMS (orig_decl
), args
, complain
);
4312 return TEMPLATE_PARM_DESCENDANTS (index
);
4315 /* Process information from new template parameter PARM and append it
4316 to the LIST being built. This new parameter is a non-type
4317 parameter iff IS_NON_TYPE is true. This new parameter is a
4318 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
4322 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
4323 bool is_non_type
, bool is_parameter_pack
)
4328 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
4329 tree defval
= TREE_PURPOSE (parm
);
4330 tree constr
= TREE_TYPE (parm
);
4334 tree p
= tree_last (list
);
4336 if (p
&& TREE_VALUE (p
) != error_mark_node
)
4339 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
4340 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
4342 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
4350 parm
= TREE_VALUE (parm
);
4352 SET_DECL_TEMPLATE_PARM_P (parm
);
4354 if (TREE_TYPE (parm
) != error_mark_node
)
4358 The top-level cv-qualifiers on the template-parameter are
4359 ignored when determining its type. */
4360 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
4361 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
4362 TREE_TYPE (parm
) = error_mark_node
;
4363 else if (uses_parameter_packs (TREE_TYPE (parm
))
4364 && !is_parameter_pack
4365 /* If we're in a nested template parameter list, the template
4366 template parameter could be a parameter pack. */
4367 && processing_template_parmlist
== 1)
4369 /* This template parameter is not a parameter pack, but it
4370 should be. Complain about "bare" parameter packs. */
4371 check_for_bare_parameter_packs (TREE_TYPE (parm
));
4373 /* Recover by calling this a parameter pack. */
4374 is_parameter_pack
= true;
4378 /* A template parameter is not modifiable. */
4379 TREE_CONSTANT (parm
) = 1;
4380 TREE_READONLY (parm
) = 1;
4381 decl
= build_decl (parm_loc
,
4382 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
4383 TREE_CONSTANT (decl
) = 1;
4384 TREE_READONLY (decl
) = 1;
4385 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
4386 = build_template_parm_index (idx
, processing_template_decl
,
4387 processing_template_decl
,
4388 decl
, TREE_TYPE (parm
));
4390 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
4391 = is_parameter_pack
;
4396 parm
= TREE_VALUE (TREE_VALUE (parm
));
4398 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
4400 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
4401 /* This is for distinguishing between real templates and template
4402 template parameters */
4403 TREE_TYPE (parm
) = t
;
4404 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
4409 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
4410 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
4411 decl
= build_decl (parm_loc
,
4412 TYPE_DECL
, parm
, t
);
4415 TYPE_NAME (t
) = decl
;
4416 TYPE_STUB_DECL (t
) = decl
;
4418 TEMPLATE_TYPE_PARM_INDEX (t
)
4419 = build_template_parm_index (idx
, processing_template_decl
,
4420 processing_template_decl
,
4421 decl
, TREE_TYPE (parm
));
4422 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
4423 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
4425 DECL_ARTIFICIAL (decl
) = 1;
4426 SET_DECL_TEMPLATE_PARM_P (decl
);
4428 /* Build requirements for the type/template parameter.
4429 This must be done after SET_DECL_TEMPLATE_PARM_P or
4430 process_template_parm could fail. */
4431 tree reqs
= finish_shorthand_constraint (parm
, constr
);
4435 if (defval
&& TREE_CODE (defval
) == OVERLOAD
)
4436 lookup_keep (defval
, true);
4438 /* Build the parameter node linking the parameter declaration,
4439 its default argument (if any), and its constraints (if any). */
4440 parm
= build_tree_list (defval
, parm
);
4441 TEMPLATE_PARM_CONSTRAINTS (parm
) = reqs
;
4443 return chainon (list
, parm
);
4446 /* The end of a template parameter list has been reached. Process the
4447 tree list into a parameter vector, converting each parameter into a more
4448 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
4452 end_template_parm_list (tree parms
)
4456 tree saved_parmlist
= make_tree_vec (list_length (parms
));
4458 /* Pop the dummy parameter level and add the real one. */
4459 current_template_parms
= TREE_CHAIN (current_template_parms
);
4461 current_template_parms
4462 = tree_cons (size_int (processing_template_decl
),
4463 saved_parmlist
, current_template_parms
);
4465 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
4467 next
= TREE_CHAIN (parm
);
4468 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
4469 TREE_CHAIN (parm
) = NULL_TREE
;
4472 --processing_template_parmlist
;
4474 return saved_parmlist
;
4477 // Explicitly indicate the end of the template parameter list. We assume
4478 // that the current template parameters have been constructed and/or
4479 // managed explicitly, as when creating new template template parameters
4480 // from a shorthand constraint.
4482 end_template_parm_list ()
4484 --processing_template_parmlist
;
4487 /* end_template_decl is called after a template declaration is seen. */
4490 end_template_decl (void)
4492 reset_specialization ();
4494 if (! processing_template_decl
)
4497 /* This matches the pushlevel in begin_template_parm_list. */
4500 --processing_template_decl
;
4501 current_template_parms
= TREE_CHAIN (current_template_parms
);
4504 /* Takes a TREE_LIST representing a template parameter and convert it
4505 into an argument suitable to be passed to the type substitution
4506 functions. Note that If the TREE_LIST contains an error_mark
4507 node, the returned argument is error_mark_node. */
4510 template_parm_to_arg (tree t
)
4514 || TREE_CODE (t
) != TREE_LIST
)
4517 if (error_operand_p (TREE_VALUE (t
)))
4518 return error_mark_node
;
4522 if (TREE_CODE (t
) == TYPE_DECL
4523 || TREE_CODE (t
) == TEMPLATE_DECL
)
4527 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
4529 /* Turn this argument into a TYPE_ARGUMENT_PACK
4530 with a single element, which expands T. */
4531 tree vec
= make_tree_vec (1);
4533 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
4535 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4537 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
4538 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4543 t
= DECL_INITIAL (t
);
4545 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
4547 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
4548 with a single element, which expands T. */
4549 tree vec
= make_tree_vec (1);
4551 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
4553 t
= convert_from_reference (t
);
4554 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4556 t
= make_node (NONTYPE_ARGUMENT_PACK
);
4557 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4560 t
= convert_from_reference (t
);
4565 /* Given a single level of template parameters (a TREE_VEC), return it
4566 as a set of template arguments. */
4569 template_parms_level_to_args (tree parms
)
4571 tree a
= copy_node (parms
);
4572 TREE_TYPE (a
) = NULL_TREE
;
4573 for (int i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
4574 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
4577 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
4582 /* Given a set of template parameters, return them as a set of template
4583 arguments. The template parameters are represented as a TREE_VEC, in
4584 the form documented in cp-tree.h for template arguments. */
4587 template_parms_to_args (tree parms
)
4590 tree args
= NULL_TREE
;
4591 int length
= TMPL_PARMS_DEPTH (parms
);
4594 /* If there is only one level of template parameters, we do not
4595 create a TREE_VEC of TREE_VECs. Instead, we return a single
4596 TREE_VEC containing the arguments. */
4598 args
= make_tree_vec (length
);
4600 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
4602 tree a
= template_parms_level_to_args (TREE_VALUE (header
));
4605 TREE_VEC_ELT (args
, --l
) = a
;
4613 /* Within the declaration of a template, return the currently active
4614 template parameters as an argument TREE_VEC. */
4617 current_template_args (void)
4619 return template_parms_to_args (current_template_parms
);
4622 /* Update the declared TYPE by doing any lookups which were thought to be
4623 dependent, but are not now that we know the SCOPE of the declarator. */
4626 maybe_update_decl_type (tree orig_type
, tree scope
)
4628 tree type
= orig_type
;
4630 if (type
== NULL_TREE
)
4633 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4634 type
= TREE_TYPE (type
);
4636 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
4637 && dependent_type_p (type
)
4638 /* Don't bother building up the args in this case. */
4639 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
4641 /* tsubst in the args corresponding to the template parameters,
4642 including auto if present. Most things will be unchanged, but
4643 make_typename_type and tsubst_qualified_id will resolve
4644 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
4645 tree args
= current_template_args ();
4646 tree auto_node
= type_uses_auto (type
);
4650 tree auto_vec
= make_tree_vec (1);
4651 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
4652 args
= add_to_template_args (args
, auto_vec
);
4654 pushed
= push_scope (scope
);
4655 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
4660 if (type
== error_mark_node
)
4663 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4665 if (same_type_p (type
, TREE_TYPE (orig_type
)))
4668 type
= TYPE_NAME (type
);
4673 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4674 template PARMS and constraints, CONSTR. If MEMBER_TEMPLATE_P is true,
4675 the new template is a member template. */
4678 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
4680 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
4681 SET_DECL_LANGUAGE (tmpl
, DECL_LANGUAGE (decl
));
4682 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
4683 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
4684 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
4685 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
4690 struct template_parm_data
4692 /* The level of the template parameters we are currently
4696 /* The index of the specialization argument we are currently
4700 /* An array whose size is the number of template parameters. The
4701 elements are nonzero if the parameter has been used in any one
4702 of the arguments processed so far. */
4705 /* An array whose size is the number of template arguments. The
4706 elements are nonzero if the argument makes use of template
4707 parameters of this level. */
4708 int* arg_uses_template_parms
;
4711 /* Subroutine of push_template_decl used to see if each template
4712 parameter in a partial specialization is used in the explicit
4713 argument list. If T is of the LEVEL given in DATA (which is
4714 treated as a template_parm_data*), then DATA->PARMS is marked
4718 mark_template_parm (tree t
, void* data
)
4722 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4724 template_parm_level_and_index (t
, &level
, &idx
);
4726 if (level
== tpd
->level
)
4728 tpd
->parms
[idx
] = 1;
4729 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4732 /* In C++17 the type of a non-type argument is a deduced context. */
4733 if (cxx_dialect
>= cxx17
4734 && TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
4735 for_each_template_parm (TREE_TYPE (t
),
4736 &mark_template_parm
,
4739 /*include_nondeduced_p=*/false);
4741 /* Return zero so that for_each_template_parm will continue the
4742 traversal of the tree; we want to mark *every* template parm. */
4746 /* Process the partial specialization DECL. */
4749 process_partial_specialization (tree decl
)
4751 tree type
= TREE_TYPE (decl
);
4752 tree tinfo
= get_template_info (decl
);
4753 tree maintmpl
= TI_TEMPLATE (tinfo
);
4754 tree specargs
= TI_ARGS (tinfo
);
4755 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4756 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4759 int nargs
= TREE_VEC_LENGTH (inner_args
);
4762 bool did_error_intro
= false;
4763 struct template_parm_data tpd
;
4764 struct template_parm_data tpd2
;
4766 gcc_assert (current_template_parms
);
4768 /* A concept cannot be specialized. */
4769 if (flag_concepts
&& variable_concept_p (maintmpl
))
4771 error ("specialization of variable concept %q#D", maintmpl
);
4772 return error_mark_node
;
4775 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4776 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4778 /* We check that each of the template parameters given in the
4779 partial specialization is used in the argument list to the
4780 specialization. For example:
4782 template <class T> struct S;
4783 template <class T> struct S<T*>;
4785 The second declaration is OK because `T*' uses the template
4786 parameter T, whereas
4788 template <class T> struct S<int>;
4790 is no good. Even trickier is:
4801 The S2<T> declaration is actually invalid; it is a
4802 full-specialization. Of course,
4805 struct S2<T (*)(U)>;
4807 or some such would have been OK. */
4808 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4809 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4810 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4812 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4813 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4814 for (i
= 0; i
< nargs
; ++i
)
4816 tpd
.current_arg
= i
;
4817 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4818 &mark_template_parm
,
4821 /*include_nondeduced_p=*/false);
4823 for (i
= 0; i
< ntparms
; ++i
)
4824 if (tpd
.parms
[i
] == 0)
4826 /* One of the template parms was not used in a deduced context in the
4828 if (!did_error_intro
)
4830 error ("template parameters not deducible in "
4831 "partial specialization:");
4832 did_error_intro
= true;
4835 inform (input_location
, " %qD",
4836 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4839 if (did_error_intro
)
4840 return error_mark_node
;
4842 /* [temp.class.spec]
4844 The argument list of the specialization shall not be identical to
4845 the implicit argument list of the primary template. */
4847 = TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (maintmpl
)));
4848 if (comp_template_args (inner_args
, INNERMOST_TEMPLATE_ARGS (main_args
))
4850 || !strictly_subsumes (current_template_constraints (),
4851 get_constraints (maintmpl
))))
4854 error ("partial specialization %q+D does not specialize "
4855 "any template arguments; to define the primary template, "
4856 "remove the template argument list", decl
);
4858 error ("partial specialization %q+D does not specialize any "
4859 "template arguments and is not more constrained than "
4860 "the primary template; to define the primary template, "
4861 "remove the template argument list", decl
);
4862 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4865 /* A partial specialization that replaces multiple parameters of the
4866 primary template with a pack expansion is less specialized for those
4868 if (nargs
< DECL_NTPARMS (maintmpl
))
4870 error ("partial specialization is not more specialized than the "
4871 "primary template because it replaces multiple parameters "
4872 "with a pack expansion");
4873 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4874 /* Avoid crash in process_partial_specialization. */
4878 /* If we aren't in a dependent class, we can actually try deduction. */
4879 else if (tpd
.level
== 1
4880 /* FIXME we should be able to handle a partial specialization of a
4881 partial instantiation, but currently we can't (c++/41727). */
4882 && TMPL_ARGS_DEPTH (specargs
) == 1
4883 && !get_partial_spec_bindings (maintmpl
, maintmpl
, specargs
))
4885 if (permerror (input_location
, "partial specialization %qD is not "
4886 "more specialized than", decl
))
4887 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template %qD",
4891 /* [temp.class.spec]
4893 A partially specialized non-type argument expression shall not
4894 involve template parameters of the partial specialization except
4895 when the argument expression is a simple identifier.
4897 The type of a template parameter corresponding to a specialized
4898 non-type argument shall not be dependent on a parameter of the
4901 Also, we verify that pack expansions only occur at the
4902 end of the argument list. */
4903 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4905 for (i
= 0; i
< nargs
; ++i
)
4907 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4908 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4909 tree packed_args
= NULL_TREE
;
4912 if (ARGUMENT_PACK_P (arg
))
4914 /* Extract the arguments from the argument pack. We'll be
4915 iterating over these in the following loop. */
4916 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4917 len
= TREE_VEC_LENGTH (packed_args
);
4920 for (j
= 0; j
< len
; j
++)
4923 /* Get the Jth argument in the parameter pack. */
4924 arg
= TREE_VEC_ELT (packed_args
, j
);
4926 if (PACK_EXPANSION_P (arg
))
4928 /* Pack expansions must come at the end of the
4930 if ((packed_args
&& j
< len
- 1)
4931 || (!packed_args
&& i
< nargs
- 1))
4933 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4934 error ("parameter pack argument %qE must be at the "
4935 "end of the template argument list", arg
);
4937 error ("parameter pack argument %qT must be at the "
4938 "end of the template argument list", arg
);
4942 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4943 /* We only care about the pattern. */
4944 arg
= PACK_EXPANSION_PATTERN (arg
);
4946 if (/* These first two lines are the `non-type' bit. */
4948 && TREE_CODE (arg
) != TEMPLATE_DECL
4949 /* This next two lines are the `argument expression is not just a
4950 simple identifier' condition and also the `specialized
4951 non-type argument' bit. */
4952 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
4953 && !(REFERENCE_REF_P (arg
)
4954 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_PARM_INDEX
))
4956 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4957 || (packed_args
&& uses_template_parms (arg
)))
4958 error ("template argument %qE involves template parameter(s)",
4962 /* Look at the corresponding template parameter,
4963 marking which template parameters its type depends
4965 tree type
= TREE_TYPE (parm
);
4969 /* We haven't yet initialized TPD2. Do so now. */
4970 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4971 /* The number of parameters here is the number in the
4972 main template, which, as checked in the assertion
4974 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4976 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4979 /* Mark the template parameters. But this time, we're
4980 looking for the template parameters of the main
4981 template, not in the specialization. */
4982 tpd2
.current_arg
= i
;
4983 tpd2
.arg_uses_template_parms
[i
] = 0;
4984 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4985 for_each_template_parm (type
,
4986 &mark_template_parm
,
4989 /*include_nondeduced_p=*/false);
4991 if (tpd2
.arg_uses_template_parms
[i
])
4993 /* The type depended on some template parameters.
4994 If they are fully specialized in the
4995 specialization, that's OK. */
4998 for (j
= 0; j
< nargs
; ++j
)
4999 if (tpd2
.parms
[j
] != 0
5000 && tpd
.arg_uses_template_parms
[j
])
5003 error_n (input_location
, count
,
5004 "type %qT of template argument %qE depends "
5005 "on a template parameter",
5006 "type %qT of template argument %qE depends "
5007 "on template parameters",
5016 /* We should only get here once. */
5017 if (TREE_CODE (decl
) == TYPE_DECL
)
5018 gcc_assert (!COMPLETE_TYPE_P (type
));
5020 // Build the template decl.
5021 tree tmpl
= build_template_decl (decl
, current_template_parms
,
5022 DECL_MEMBER_TEMPLATE_P (maintmpl
));
5023 TREE_TYPE (tmpl
) = type
;
5024 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
5025 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
5026 DECL_TEMPLATE_INFO (tmpl
) = build_template_info (maintmpl
, specargs
);
5027 DECL_PRIMARY_TEMPLATE (tmpl
) = maintmpl
;
5029 /* Give template template parms a DECL_CONTEXT of the template
5030 for which they are a parameter. */
5031 for (i
= 0; i
< ntparms
; ++i
)
5033 tree parm
= TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
));
5034 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5035 DECL_CONTEXT (parm
) = tmpl
;
5039 /* We didn't register this in check_explicit_specialization so we could
5040 wait until the constraints were set. */
5041 decl
= register_specialization (decl
, maintmpl
, specargs
, false, 0);
5043 associate_classtype_constraints (type
);
5045 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
5046 = tree_cons (specargs
, tmpl
,
5047 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
5048 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
5050 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
5051 inst
= TREE_CHAIN (inst
))
5053 tree instance
= TREE_VALUE (inst
);
5054 if (TYPE_P (instance
)
5055 ? (COMPLETE_TYPE_P (instance
)
5056 && CLASSTYPE_IMPLICIT_INSTANTIATION (instance
))
5057 : DECL_TEMPLATE_INSTANTIATION (instance
))
5059 tree spec
= most_specialized_partial_spec (instance
, tf_none
);
5060 tree inst_decl
= (DECL_P (instance
)
5061 ? instance
: TYPE_NAME (instance
));
5064 else if (spec
== error_mark_node
)
5065 permerror (input_location
,
5066 "declaration of %qD ambiguates earlier template "
5067 "instantiation for %qD", decl
, inst_decl
);
5068 else if (TREE_VALUE (spec
) == tmpl
)
5069 permerror (input_location
,
5070 "partial specialization of %qD after instantiation "
5071 "of %qD", decl
, inst_decl
);
5078 /* PARM is a template parameter of some form; return the corresponding
5079 TEMPLATE_PARM_INDEX. */
5082 get_template_parm_index (tree parm
)
5084 if (TREE_CODE (parm
) == PARM_DECL
5085 || TREE_CODE (parm
) == CONST_DECL
)
5086 parm
= DECL_INITIAL (parm
);
5087 else if (TREE_CODE (parm
) == TYPE_DECL
5088 || TREE_CODE (parm
) == TEMPLATE_DECL
)
5089 parm
= TREE_TYPE (parm
);
5090 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
5091 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
5092 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
5093 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
5094 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
5098 /* Subroutine of fixed_parameter_pack_p below. Look for any template
5099 parameter packs used by the template parameter PARM. */
5102 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
5104 /* A type parm can't refer to another parm. */
5105 if (TREE_CODE (parm
) == TYPE_DECL
|| parm
== error_mark_node
)
5107 else if (TREE_CODE (parm
) == PARM_DECL
)
5109 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
5114 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
5116 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
5117 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
5118 fixed_parameter_pack_p_1 (TREE_VALUE (TREE_VEC_ELT (vec
, i
)), ppd
);
5121 /* PARM is a template parameter pack. Return any parameter packs used in
5122 its type or the type of any of its template parameters. If there are
5123 any such packs, it will be instantiated into a fixed template parameter
5124 list by partial instantiation rather than be fully deduced. */
5127 fixed_parameter_pack_p (tree parm
)
5129 /* This can only be true in a member template. */
5130 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
5132 /* This can only be true for a parameter pack. */
5133 if (!template_parameter_pack_p (parm
))
5135 /* A type parm can't refer to another parm. */
5136 if (TREE_CODE (parm
) == TYPE_DECL
)
5139 tree parameter_packs
= NULL_TREE
;
5140 struct find_parameter_pack_data ppd
;
5141 ppd
.parameter_packs
= ¶meter_packs
;
5142 ppd
.visited
= new hash_set
<tree
>;
5143 ppd
.type_pack_expansion_p
= false;
5145 fixed_parameter_pack_p_1 (parm
, &ppd
);
5148 return parameter_packs
;
5151 /* Check that a template declaration's use of default arguments and
5152 parameter packs is not invalid. Here, PARMS are the template
5153 parameters. IS_PRIMARY is true if DECL is the thing declared by
5154 a primary template. IS_PARTIAL is true if DECL is a partial
5157 IS_FRIEND_DECL is nonzero if DECL is either a non-defining friend
5158 function template declaration or a friend class template
5159 declaration. In the function case, 1 indicates a declaration, 2
5160 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
5161 emitted for extraneous default arguments.
5163 Returns TRUE if there were no errors found, FALSE otherwise. */
5166 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
5167 bool is_partial
, int is_friend_decl
)
5170 int last_level_to_check
;
5172 bool no_errors
= true;
5176 A default template-argument shall not be specified in a
5177 function template declaration or a function template definition, nor
5178 in the template-parameter-list of the definition of a member of a
5181 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
5182 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (decl
)))
5183 /* You can't have a function template declaration in a local
5184 scope, nor you can you define a member of a class template in a
5188 if ((TREE_CODE (decl
) == TYPE_DECL
5190 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5191 || (TREE_CODE (decl
) == FUNCTION_DECL
5192 && LAMBDA_FUNCTION_P (decl
)))
5193 /* A lambda doesn't have an explicit declaration; don't complain
5194 about the parms of the enclosing class. */
5197 if (current_class_type
5198 && !TYPE_BEING_DEFINED (current_class_type
)
5199 && DECL_LANG_SPECIFIC (decl
)
5200 && DECL_DECLARES_FUNCTION_P (decl
)
5201 /* If this is either a friend defined in the scope of the class
5202 or a member function. */
5203 && (DECL_FUNCTION_MEMBER_P (decl
)
5204 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
5205 : DECL_FRIEND_CONTEXT (decl
)
5206 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
5208 /* And, if it was a member function, it really was defined in
5209 the scope of the class. */
5210 && (!DECL_FUNCTION_MEMBER_P (decl
)
5211 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
5212 /* We already checked these parameters when the template was
5213 declared, so there's no need to do it again now. This function
5214 was defined in class scope, but we're processing its body now
5215 that the class is complete. */
5218 /* Core issue 226 (C++0x only): the following only applies to class
5221 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
5225 If a template-parameter has a default template-argument, all
5226 subsequent template-parameters shall have a default
5227 template-argument supplied. */
5228 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
5230 tree inner_parms
= TREE_VALUE (parm_level
);
5231 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
5232 int seen_def_arg_p
= 0;
5235 for (i
= 0; i
< ntparms
; ++i
)
5237 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
5239 if (parm
== error_mark_node
)
5242 if (TREE_PURPOSE (parm
))
5244 else if (seen_def_arg_p
5245 && !template_parameter_pack_p (TREE_VALUE (parm
)))
5247 error ("no default argument for %qD", TREE_VALUE (parm
));
5248 /* For better subsequent error-recovery, we indicate that
5249 there should have been a default argument. */
5250 TREE_PURPOSE (parm
) = error_mark_node
;
5253 else if (!is_partial
5255 /* Don't complain about an enclosing partial
5257 && parm_level
== parms
5258 && TREE_CODE (decl
) == TYPE_DECL
5260 && template_parameter_pack_p (TREE_VALUE (parm
))
5261 /* A fixed parameter pack will be partially
5262 instantiated into a fixed length list. */
5263 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
5265 /* A primary class template can only have one
5266 parameter pack, at the end of the template
5269 error ("parameter pack %q+D must be at the end of the"
5270 " template parameter list", TREE_VALUE (parm
));
5272 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
5280 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
5284 /* For an ordinary class template, default template arguments are
5285 allowed at the innermost level, e.g.:
5286 template <class T = int>
5288 but, in a partial specialization, they're not allowed even
5289 there, as we have in [temp.class.spec]:
5291 The template parameter list of a specialization shall not
5292 contain default template argument values.
5294 So, for a partial specialization, or for a function template
5295 (in C++98/C++03), we look at all of them. */
5298 /* But, for a primary class template that is not a partial
5299 specialization we look at all template parameters except the
5301 parms
= TREE_CHAIN (parms
);
5303 /* Figure out what error message to issue. */
5304 if (is_friend_decl
== 2)
5305 msg
= G_("default template arguments may not be used in function template "
5306 "friend re-declaration");
5307 else if (is_friend_decl
)
5308 msg
= G_("default template arguments may not be used in template "
5309 "friend declarations");
5310 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
5311 msg
= G_("default template arguments may not be used in function templates "
5312 "without -std=c++11 or -std=gnu++11");
5313 else if (is_partial
)
5314 msg
= G_("default template arguments may not be used in "
5315 "partial specializations");
5316 else if (current_class_type
&& CLASSTYPE_IS_TEMPLATE (current_class_type
))
5317 msg
= G_("default argument for template parameter for class enclosing %qD");
5319 /* Per [temp.param]/9, "A default template-argument shall not be
5320 specified in the template-parameter-lists of the definition of
5321 a member of a class template that appears outside of the member's
5322 class.", thus if we aren't handling a member of a class template
5323 there is no need to examine the parameters. */
5326 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
5327 /* If we're inside a class definition, there's no need to
5328 examine the parameters to the class itself. On the one
5329 hand, they will be checked when the class is defined, and,
5330 on the other, default arguments are valid in things like:
5331 template <class T = double>
5332 struct S { template <class U> void f(U); };
5333 Here the default argument for `S' has no bearing on the
5334 declaration of `f'. */
5335 last_level_to_check
= template_class_depth (current_class_type
) + 1;
5337 /* Check everything. */
5338 last_level_to_check
= 0;
5340 for (parm_level
= parms
;
5341 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
5342 parm_level
= TREE_CHAIN (parm_level
))
5344 tree inner_parms
= TREE_VALUE (parm_level
);
5348 ntparms
= TREE_VEC_LENGTH (inner_parms
);
5349 for (i
= 0; i
< ntparms
; ++i
)
5351 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
5354 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
5359 if (is_friend_decl
== 2)
5366 /* Clear out the default argument so that we are not
5368 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
5372 /* At this point, if we're still interested in issuing messages,
5373 they must apply to classes surrounding the object declared. */
5375 msg
= G_("default argument for template parameter for class "
5382 /* Worker for push_template_decl_real, called via
5383 for_each_template_parm. DATA is really an int, indicating the
5384 level of the parameters we are interested in. If T is a template
5385 parameter of that level, return nonzero. */
5388 template_parm_this_level_p (tree t
, void* data
)
5390 int this_level
= *(int *)data
;
5393 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
5394 level
= TEMPLATE_PARM_LEVEL (t
);
5396 level
= TEMPLATE_TYPE_LEVEL (t
);
5397 return level
== this_level
;
5400 /* Worker for uses_outer_template_parms, called via for_each_template_parm.
5401 DATA is really an int, indicating the innermost outer level of parameters.
5402 If T is a template parameter of that level or further out, return
5406 template_parm_outer_level (tree t
, void *data
)
5408 int this_level
= *(int *)data
;
5411 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
5412 level
= TEMPLATE_PARM_LEVEL (t
);
5414 level
= TEMPLATE_TYPE_LEVEL (t
);
5415 return level
<= this_level
;
5418 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
5419 parameters given by current_template_args, or reuses a
5420 previously existing one, if appropriate. Returns the DECL, or an
5421 equivalent one, if it is replaced via a call to duplicate_decls.
5423 If IS_FRIEND is true, DECL is a friend declaration. */
5426 push_template_decl_real (tree decl
, bool is_friend
)
5434 int new_template_p
= 0;
5435 /* True if the template is a member template, in the sense of
5437 bool member_template_p
= false;
5439 if (decl
== error_mark_node
|| !current_template_parms
)
5440 return error_mark_node
;
5442 /* See if this is a partial specialization. */
5443 is_partial
= ((DECL_IMPLICIT_TYPEDEF_P (decl
)
5444 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
5445 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
5447 && DECL_LANG_SPECIFIC (decl
)
5448 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5449 && TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
))));
5451 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
5455 /* For a friend, we want the context of the friend, not
5456 the type of which it is a friend. */
5457 ctx
= CP_DECL_CONTEXT (decl
);
5458 else if (CP_DECL_CONTEXT (decl
)
5459 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
5460 /* In the case of a virtual function, we want the class in which
5462 ctx
= CP_DECL_CONTEXT (decl
);
5464 /* Otherwise, if we're currently defining some class, the DECL
5465 is assumed to be a member of the class. */
5466 ctx
= current_scope ();
5468 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
5471 if (!DECL_CONTEXT (decl
))
5472 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
5474 /* See if this is a primary template. */
5475 if (is_friend
&& ctx
5476 && uses_template_parms_level (ctx
, processing_template_decl
))
5477 /* A friend template that specifies a class context, i.e.
5478 template <typename T> friend void A<T>::f();
5481 else if (TREE_CODE (decl
) == TYPE_DECL
5482 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5485 is_primary
= template_parm_scope_p ();
5489 warning (OPT_Wtemplates
, "template %qD declared", decl
);
5491 if (DECL_CLASS_SCOPE_P (decl
))
5492 member_template_p
= true;
5493 if (TREE_CODE (decl
) == TYPE_DECL
5494 && anon_aggrname_p (DECL_NAME (decl
)))
5496 error ("template class without a name");
5497 return error_mark_node
;
5499 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
5501 if (member_template_p
)
5503 if (DECL_OVERRIDE_P (decl
) || DECL_FINAL_P (decl
))
5504 error ("member template %qD may not have virt-specifiers", decl
);
5506 if (DECL_DESTRUCTOR_P (decl
))
5510 A destructor shall not be a member template. */
5511 error ("destructor %qD declared as member template", decl
);
5512 return error_mark_node
;
5514 if (IDENTIFIER_NEWDEL_OP_P (DECL_NAME (decl
))
5515 && (!prototype_p (TREE_TYPE (decl
))
5516 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
5517 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
5518 || (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
5519 == void_list_node
)))
5521 /* [basic.stc.dynamic.allocation]
5523 An allocation function can be a function
5524 template. ... Template allocation functions shall
5525 have two or more parameters. */
5526 error ("invalid template declaration of %qD", decl
);
5527 return error_mark_node
;
5530 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5531 && CLASS_TYPE_P (TREE_TYPE (decl
)))
5533 /* Class template, set TEMPLATE_TYPE_PARM_FOR_CLASS. */
5534 tree parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
5535 for (int i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
5537 tree t
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5538 if (TREE_CODE (t
) == TYPE_DECL
)
5540 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
5541 TEMPLATE_TYPE_PARM_FOR_CLASS (t
) = true;
5544 else if (TREE_CODE (decl
) == TYPE_DECL
5545 && TYPE_DECL_ALIAS_P (decl
))
5546 /* alias-declaration */
5547 gcc_assert (!DECL_ARTIFICIAL (decl
));
5548 else if (VAR_P (decl
))
5549 /* C++14 variable template. */;
5552 error ("template declaration of %q#D", decl
);
5553 return error_mark_node
;
5557 /* Check to see that the rules regarding the use of default
5558 arguments are not being violated. We check args for a friend
5559 functions when we know whether it's a definition, introducing
5560 declaration or re-declaration. */
5561 if (!is_friend
|| TREE_CODE (decl
) != FUNCTION_DECL
)
5562 check_default_tmpl_args (decl
, current_template_parms
,
5563 is_primary
, is_partial
, is_friend
);
5565 /* Ensure that there are no parameter packs in the type of this
5566 declaration that have not been expanded. */
5567 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5569 /* Check each of the arguments individually to see if there are
5570 any bare parameter packs. */
5571 tree type
= TREE_TYPE (decl
);
5572 tree arg
= DECL_ARGUMENTS (decl
);
5573 tree argtype
= TYPE_ARG_TYPES (type
);
5575 while (arg
&& argtype
)
5577 if (!DECL_PACK_P (arg
)
5578 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
5580 /* This is a PARM_DECL that contains unexpanded parameter
5581 packs. We have already complained about this in the
5582 check_for_bare_parameter_packs call, so just replace
5583 these types with ERROR_MARK_NODE. */
5584 TREE_TYPE (arg
) = error_mark_node
;
5585 TREE_VALUE (argtype
) = error_mark_node
;
5588 arg
= DECL_CHAIN (arg
);
5589 argtype
= TREE_CHAIN (argtype
);
5592 /* Check for bare parameter packs in the return type and the
5593 exception specifiers. */
5594 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
5595 /* Errors were already issued, set return type to int
5596 as the frontend doesn't expect error_mark_node as
5598 TREE_TYPE (type
) = integer_type_node
;
5599 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
5600 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
5602 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
5603 && TYPE_DECL_ALIAS_P (decl
))
5604 ? DECL_ORIGINAL_TYPE (decl
)
5605 : TREE_TYPE (decl
)))
5607 TREE_TYPE (decl
) = error_mark_node
;
5608 return error_mark_node
;
5612 return process_partial_specialization (decl
);
5614 args
= current_template_args ();
5617 || TREE_CODE (ctx
) == FUNCTION_DECL
5618 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
5619 || (TREE_CODE (decl
) == TYPE_DECL
5620 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5621 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
5623 if (DECL_LANG_SPECIFIC (decl
)
5624 && DECL_TEMPLATE_INFO (decl
)
5625 && DECL_TI_TEMPLATE (decl
))
5626 tmpl
= DECL_TI_TEMPLATE (decl
);
5627 /* If DECL is a TYPE_DECL for a class-template, then there won't
5628 be DECL_LANG_SPECIFIC. The information equivalent to
5629 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
5630 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5631 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
5632 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
5634 /* Since a template declaration already existed for this
5635 class-type, we must be redeclaring it here. Make sure
5636 that the redeclaration is valid. */
5637 redeclare_class_template (TREE_TYPE (decl
),
5638 current_template_parms
,
5639 current_template_constraints ());
5640 /* We don't need to create a new TEMPLATE_DECL; just use the
5641 one we already had. */
5642 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
5646 tmpl
= build_template_decl (decl
, current_template_parms
,
5650 if (DECL_LANG_SPECIFIC (decl
)
5651 && DECL_TEMPLATE_SPECIALIZATION (decl
))
5653 /* A specialization of a member template of a template
5655 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
5656 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
5657 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
5663 tree a
, t
, current
, parms
;
5665 tree tinfo
= get_template_info (decl
);
5669 error ("template definition of non-template %q#D", decl
);
5670 return error_mark_node
;
5673 tmpl
= TI_TEMPLATE (tinfo
);
5675 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
5676 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
5677 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5678 && DECL_MEMBER_TEMPLATE_P (tmpl
))
5682 /* The declaration is a specialization of a member
5683 template, declared outside the class. Therefore, the
5684 innermost template arguments will be NULL, so we
5685 replace them with the arguments determined by the
5686 earlier call to check_explicit_specialization. */
5687 args
= DECL_TI_ARGS (decl
);
5690 = build_template_decl (decl
, current_template_parms
,
5692 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
5693 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
5694 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
5695 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
5696 DECL_TEMPLATE_INFO (new_tmpl
)
5697 = build_template_info (tmpl
, args
);
5699 register_specialization (new_tmpl
,
5700 most_general_template (tmpl
),
5706 /* Make sure the template headers we got make sense. */
5708 parms
= DECL_TEMPLATE_PARMS (tmpl
);
5709 i
= TMPL_PARMS_DEPTH (parms
);
5710 if (TMPL_ARGS_DEPTH (args
) != i
)
5712 error ("expected %d levels of template parms for %q#D, got %d",
5713 i
, decl
, TMPL_ARGS_DEPTH (args
));
5714 DECL_INTERFACE_KNOWN (decl
) = 1;
5715 return error_mark_node
;
5718 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
5720 a
= TMPL_ARGS_LEVEL (args
, i
);
5721 t
= INNERMOST_TEMPLATE_PARMS (parms
);
5723 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
5725 if (current
== decl
)
5726 error ("got %d template parameters for %q#D",
5727 TREE_VEC_LENGTH (a
), decl
);
5729 error ("got %d template parameters for %q#T",
5730 TREE_VEC_LENGTH (a
), current
);
5731 error (" but %d required", TREE_VEC_LENGTH (t
));
5732 /* Avoid crash in import_export_decl. */
5733 DECL_INTERFACE_KNOWN (decl
) = 1;
5734 return error_mark_node
;
5737 if (current
== decl
)
5739 else if (current
== NULL_TREE
)
5740 /* Can happen in erroneous input. */
5743 current
= get_containing_scope (current
);
5746 /* Check that the parms are used in the appropriate qualifying scopes
5747 in the declarator. */
5748 if (!comp_template_args
5750 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
5752 error ("template arguments to %qD do not match original "
5753 "template %qD", decl
, DECL_TEMPLATE_RESULT (tmpl
));
5754 if (!uses_template_parms (TI_ARGS (tinfo
)))
5755 inform (input_location
, "use %<template<>%> for"
5756 " an explicit specialization");
5757 /* Avoid crash in import_export_decl. */
5758 DECL_INTERFACE_KNOWN (decl
) = 1;
5759 return error_mark_node
;
5763 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
5764 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
5766 /* Push template declarations for global functions and types. Note
5767 that we do not try to push a global template friend declared in a
5768 template class; such a thing may well depend on the template
5769 parameters of the class. */
5770 if (new_template_p
&& !ctx
5771 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
5773 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
5774 if (tmpl
== error_mark_node
)
5775 return error_mark_node
;
5777 /* Hide template friend classes that haven't been declared yet. */
5778 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
5780 DECL_ANTICIPATED (tmpl
) = 1;
5781 DECL_FRIEND_P (tmpl
) = 1;
5787 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5789 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5791 /* Give template template parms a DECL_CONTEXT of the template
5792 for which they are a parameter. */
5793 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5794 for (int i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5796 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5797 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5798 DECL_CONTEXT (parm
) = tmpl
;
5801 if (TREE_CODE (decl
) == TYPE_DECL
5802 && TYPE_DECL_ALIAS_P (decl
)
5803 && complex_alias_template_p (tmpl
))
5804 TEMPLATE_DECL_COMPLEX_ALIAS_P (tmpl
) = true;
5807 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5808 back to its most general template. If TMPL is a specialization,
5809 ARGS may only have the innermost set of arguments. Add the missing
5810 argument levels if necessary. */
5811 if (DECL_TEMPLATE_INFO (tmpl
))
5812 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5814 info
= build_template_info (tmpl
, args
);
5816 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5817 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5821 retrofit_lang_decl (decl
);
5822 if (DECL_LANG_SPECIFIC (decl
))
5823 DECL_TEMPLATE_INFO (decl
) = info
;
5826 if (flag_implicit_templates
5828 && TREE_PUBLIC (decl
)
5829 && VAR_OR_FUNCTION_DECL_P (decl
))
5830 /* Set DECL_COMDAT on template instantiations; if we force
5831 them to be emitted by explicit instantiation or -frepo,
5832 mark_needed will tell cgraph to do the right thing. */
5833 DECL_COMDAT (decl
) = true;
5835 return DECL_TEMPLATE_RESULT (tmpl
);
5839 push_template_decl (tree decl
)
5841 return push_template_decl_real (decl
, false);
5844 /* FN is an inheriting constructor that inherits from the constructor
5845 template INHERITED; turn FN into a constructor template with a matching
5849 add_inherited_template_parms (tree fn
, tree inherited
)
5852 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5853 inner_parms
= copy_node (inner_parms
);
5855 = tree_cons (size_int (processing_template_decl
+ 1),
5856 inner_parms
, current_template_parms
);
5857 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5858 tree args
= template_parms_to_args (parms
);
5859 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5860 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5861 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5862 DECL_ARTIFICIAL (tmpl
) = true;
5863 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5867 /* Called when a class template TYPE is redeclared with the indicated
5868 template PARMS, e.g.:
5870 template <class T> struct S;
5871 template <class T> struct S {}; */
5874 redeclare_class_template (tree type
, tree parms
, tree cons
)
5880 if (!TYPE_TEMPLATE_INFO (type
))
5882 error ("%qT is not a template type", type
);
5886 tmpl
= TYPE_TI_TEMPLATE (type
);
5887 if (!PRIMARY_TEMPLATE_P (tmpl
))
5888 /* The type is nested in some template class. Nothing to worry
5889 about here; there are no new template parameters for the nested
5895 error ("template specifiers not specified in declaration of %qD",
5900 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5901 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5903 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5905 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5906 "redeclared with %d template parameter",
5907 "redeclared with %d template parameters",
5908 TREE_VEC_LENGTH (parms
));
5909 inform_n (DECL_SOURCE_LOCATION (tmpl
), TREE_VEC_LENGTH (tmpl_parms
),
5910 "previous declaration %qD used %d template parameter",
5911 "previous declaration %qD used %d template parameters",
5912 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5916 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5923 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5924 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5927 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5928 if (error_operand_p (tmpl_parm
))
5931 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5932 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5933 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5935 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5937 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5938 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5939 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5940 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5941 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5942 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5943 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5944 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5945 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5947 error ("template parameter %q+#D", tmpl_parm
);
5948 error ("redeclared here as %q#D", parm
);
5952 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5954 /* We have in [temp.param]:
5956 A template-parameter may not be given default arguments
5957 by two different declarations in the same scope. */
5958 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5959 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5960 "original definition appeared here");
5964 if (parm_default
!= NULL_TREE
)
5965 /* Update the previous template parameters (which are the ones
5966 that will really count) with the new default value. */
5967 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5968 else if (tmpl_default
!= NULL_TREE
)
5969 /* Update the new parameters, too; they'll be used as the
5970 parameters for any members. */
5971 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5973 /* Give each template template parm in this redeclaration a
5974 DECL_CONTEXT of the template for which they are a parameter. */
5975 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5977 gcc_assert (DECL_CONTEXT (parm
) == NULL_TREE
);
5978 DECL_CONTEXT (parm
) = tmpl
;
5981 if (TREE_CODE (parm
) == TYPE_DECL
)
5982 TEMPLATE_TYPE_PARM_FOR_CLASS (TREE_TYPE (parm
)) = true;
5985 // Cannot redeclare a class template with a different set of constraints.
5986 if (!equivalent_constraints (get_constraints (tmpl
), cons
))
5988 error_at (input_location
, "redeclaration %q#D with different "
5989 "constraints", tmpl
);
5990 inform (DECL_SOURCE_LOCATION (tmpl
),
5991 "original declaration appeared here");
5997 /* The actual substitution part of instantiate_non_dependent_expr_sfinae,
5998 to be used when the caller has already checked
5999 (processing_template_decl
6000 && !instantiation_dependent_expression_p (expr)
6001 && potential_constant_expression (expr))
6002 and cleared processing_template_decl. */
6005 instantiate_non_dependent_expr_internal (tree expr
, tsubst_flags_t complain
)
6007 return tsubst_copy_and_build (expr
,
6010 /*in_decl=*/NULL_TREE
,
6011 /*function_p=*/false,
6012 /*integral_constant_expression_p=*/true);
6015 /* Simplify EXPR if it is a non-dependent expression. Returns the
6016 (possibly simplified) expression. */
6019 instantiate_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
6021 if (expr
== NULL_TREE
)
6024 /* If we're in a template, but EXPR isn't value dependent, simplify
6025 it. We're supposed to treat:
6027 template <typename T> void f(T[1 + 1]);
6028 template <typename T> void f(T[2]);
6030 as two declarations of the same function, for example. */
6031 if (processing_template_decl
6032 && is_nondependent_constant_expression (expr
))
6034 processing_template_decl_sentinel s
;
6035 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
6041 instantiate_non_dependent_expr (tree expr
)
6043 return instantiate_non_dependent_expr_sfinae (expr
, tf_error
);
6046 /* Like instantiate_non_dependent_expr, but return NULL_TREE rather than
6047 an uninstantiated expression. */
6050 instantiate_non_dependent_or_null (tree expr
)
6052 if (expr
== NULL_TREE
)
6054 if (processing_template_decl
)
6056 if (!is_nondependent_constant_expression (expr
))
6060 processing_template_decl_sentinel s
;
6061 expr
= instantiate_non_dependent_expr_internal (expr
, tf_error
);
6067 /* True iff T is a specialization of a variable template. */
6070 variable_template_specialization_p (tree t
)
6072 if (!VAR_P (t
) || !DECL_LANG_SPECIFIC (t
) || !DECL_TEMPLATE_INFO (t
))
6074 tree tmpl
= DECL_TI_TEMPLATE (t
);
6075 return variable_template_p (tmpl
);
6078 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
6079 template declaration, or a TYPE_DECL for an alias declaration. */
6082 alias_type_or_template_p (tree t
)
6086 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
6089 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
6090 || DECL_ALIAS_TEMPLATE_P (t
));
6093 /* Return TRUE iff T is a specialization of an alias template. */
6096 alias_template_specialization_p (const_tree t
)
6098 /* It's an alias template specialization if it's an alias and its
6099 TYPE_NAME is a specialization of a primary template. */
6100 if (TYPE_ALIAS_P (t
))
6101 if (tree tinfo
= TYPE_ALIAS_TEMPLATE_INFO (t
))
6102 return PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
));
6107 /* An alias template is complex from a SFINAE perspective if a template-id
6108 using that alias can be ill-formed when the expansion is not, as with
6109 the void_t template. We determine this by checking whether the
6110 expansion for the alias template uses all its template parameters. */
6112 struct uses_all_template_parms_data
6119 uses_all_template_parms_r (tree t
, void *data_
)
6121 struct uses_all_template_parms_data
&data
6122 = *(struct uses_all_template_parms_data
*)data_
;
6123 tree idx
= get_template_parm_index (t
);
6125 if (TEMPLATE_PARM_LEVEL (idx
) == data
.level
)
6126 data
.seen
[TEMPLATE_PARM_IDX (idx
)] = true;
6131 complex_alias_template_p (const_tree tmpl
)
6133 struct uses_all_template_parms_data data
;
6134 tree pat
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
6135 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
6136 data
.level
= TMPL_PARMS_DEPTH (parms
);
6137 int len
= TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS (parms
));
6138 data
.seen
= XALLOCAVEC (bool, len
);
6139 for (int i
= 0; i
< len
; ++i
)
6140 data
.seen
[i
] = false;
6142 for_each_template_parm (pat
, uses_all_template_parms_r
, &data
, NULL
, true);
6143 for (int i
= 0; i
< len
; ++i
)
6149 /* Return TRUE iff T is a specialization of a complex alias template with
6150 dependent template-arguments. */
6153 dependent_alias_template_spec_p (const_tree t
)
6155 if (!alias_template_specialization_p (t
))
6158 tree tinfo
= TYPE_ALIAS_TEMPLATE_INFO (t
);
6159 if (!TEMPLATE_DECL_COMPLEX_ALIAS_P (TI_TEMPLATE (tinfo
)))
6162 tree args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
));
6163 if (!any_dependent_template_arguments_p (args
))
6169 /* Return the number of innermost template parameters in TMPL. */
6172 num_innermost_template_parms (tree tmpl
)
6174 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
6175 return TREE_VEC_LENGTH (parms
);
6178 /* Return either TMPL or another template that it is equivalent to under DR
6179 1286: An alias that just changes the name of a template is equivalent to
6180 the other template. */
6183 get_underlying_template (tree tmpl
)
6185 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
6186 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
6188 /* Determine if the alias is equivalent to an underlying template. */
6189 tree orig_type
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
6190 tree tinfo
= TYPE_TEMPLATE_INFO_MAYBE_ALIAS (orig_type
);
6194 tree underlying
= TI_TEMPLATE (tinfo
);
6195 if (!PRIMARY_TEMPLATE_P (underlying
)
6196 || (num_innermost_template_parms (tmpl
)
6197 != num_innermost_template_parms (underlying
)))
6200 tree alias_args
= INNERMOST_TEMPLATE_ARGS
6201 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
6202 if (!comp_template_args (TI_ARGS (tinfo
), alias_args
))
6205 /* Alias is equivalent. Strip it and repeat. */
6212 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
6213 must be a reference-to-function or a pointer-to-function type, as specified
6214 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
6215 and check that the resulting function has external linkage. */
6218 convert_nontype_argument_function (tree type
, tree expr
,
6219 tsubst_flags_t complain
)
6223 linkage_kind linkage
;
6225 fn
= instantiate_type (type
, fns
, tf_none
);
6226 if (fn
== error_mark_node
)
6227 return error_mark_node
;
6229 if (value_dependent_expression_p (fn
))
6232 fn_no_ptr
= strip_fnptr_conv (fn
);
6233 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
6234 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
6235 if (BASELINK_P (fn_no_ptr
))
6236 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
6238 /* [temp.arg.nontype]/1
6240 A template-argument for a non-type, non-template template-parameter
6243 -- the address of an object or function with external [C++11: or
6244 internal] linkage. */
6246 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
6248 if (complain
& tf_error
)
6250 error ("%qE is not a valid template argument for type %qT",
6252 if (TYPE_PTR_P (type
))
6253 inform (input_location
, "it must be the address of a function "
6254 "with external linkage");
6256 inform (input_location
, "it must be the name of a function with "
6257 "external linkage");
6262 linkage
= decl_linkage (fn_no_ptr
);
6263 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
6265 if (complain
& tf_error
)
6267 if (cxx_dialect
>= cxx11
)
6268 error ("%qE is not a valid template argument for type %qT "
6269 "because %qD has no linkage",
6270 expr
, type
, fn_no_ptr
);
6272 error ("%qE is not a valid template argument for type %qT "
6273 "because %qD does not have external linkage",
6274 expr
, type
, fn_no_ptr
);
6280 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6282 if (REFERENCE_REF_P (fn
))
6283 fn
= TREE_OPERAND (fn
, 0);
6285 fn
= build_address (fn
);
6287 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (fn
)))
6288 fn
= build_nop (type
, fn
);
6293 /* Subroutine of convert_nontype_argument.
6294 Check if EXPR of type TYPE is a valid pointer-to-member constant.
6295 Emit an error otherwise. */
6298 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
6299 tsubst_flags_t complain
)
6301 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
6302 tree orig_expr
= expr
;
6304 if (null_ptr_cst_p (expr
))
6306 if (TREE_CODE (expr
) == PTRMEM_CST
6307 && same_type_p (TYPE_PTRMEM_CLASS_TYPE (type
),
6308 PTRMEM_CST_CLASS (expr
)))
6310 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
6312 if (processing_template_decl
6313 && TREE_CODE (expr
) == ADDR_EXPR
6314 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
6316 if (complain
& tf_error
)
6318 error_at (loc
, "%qE is not a valid template argument for type %qT",
6320 if (TREE_CODE (expr
) != PTRMEM_CST
)
6321 inform (loc
, "it must be a pointer-to-member of the form %<&X::Y%>");
6323 inform (loc
, "because it is a member of %qT", PTRMEM_CST_CLASS (expr
));
6328 /* Returns TRUE iff the address of OP is value-dependent.
6330 14.6.2.4 [temp.dep.temp]:
6331 A non-integral non-type template-argument is dependent if its type is
6332 dependent or it has either of the following forms
6335 and contains a nested-name-specifier which specifies a class-name that
6336 names a dependent type.
6338 We generalize this to just say that the address of a member of a
6339 dependent class is value-dependent; the above doesn't cover the
6340 address of a static data member named with an unqualified-id. */
6343 has_value_dependent_address (tree op
)
6345 /* We could use get_inner_reference here, but there's no need;
6346 this is only relevant for template non-type arguments, which
6347 can only be expressed as &id-expression. */
6350 tree ctx
= CP_DECL_CONTEXT (op
);
6351 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
6358 /* The next set of functions are used for providing helpful explanatory
6359 diagnostics for failed overload resolution. Their messages should be
6360 indented by two spaces for consistency with the messages in
6364 unify_success (bool /*explain_p*/)
6369 /* Other failure functions should call this one, to provide a single function
6370 for setting a breakpoint on. */
6373 unify_invalid (bool /*explain_p*/)
6379 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
6382 inform (input_location
,
6383 " couldn't deduce template parameter %qD", parm
);
6384 return unify_invalid (explain_p
);
6388 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
6391 inform (input_location
,
6392 " types %qT and %qT have incompatible cv-qualifiers",
6394 return unify_invalid (explain_p
);
6398 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
6401 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
6402 return unify_invalid (explain_p
);
6406 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
6409 inform (input_location
,
6410 " template parameter %qD is not a parameter pack, but "
6413 return unify_invalid (explain_p
);
6417 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
6420 inform (input_location
,
6421 " template argument %qE does not match "
6422 "pointer-to-member constant %qE",
6424 return unify_invalid (explain_p
);
6428 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
6431 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
6432 return unify_invalid (explain_p
);
6436 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
6439 inform (input_location
,
6440 " inconsistent parameter pack deduction with %qT and %qT",
6442 return unify_invalid (explain_p
);
6446 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
6451 inform (input_location
,
6452 " deduced conflicting types for parameter %qT (%qT and %qT)",
6453 parm
, first
, second
);
6455 inform (input_location
,
6456 " deduced conflicting values for non-type parameter "
6457 "%qE (%qE and %qE)", parm
, first
, second
);
6459 return unify_invalid (explain_p
);
6463 unify_vla_arg (bool explain_p
, tree arg
)
6466 inform (input_location
,
6467 " variable-sized array type %qT is not "
6468 "a valid template argument",
6470 return unify_invalid (explain_p
);
6474 unify_method_type_error (bool explain_p
, tree arg
)
6477 inform (input_location
,
6478 " member function type %qT is not a valid template argument",
6480 return unify_invalid (explain_p
);
6484 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
6489 inform_n (input_location
, wanted
,
6490 " candidate expects at least %d argument, %d provided",
6491 " candidate expects at least %d arguments, %d provided",
6494 inform_n (input_location
, wanted
,
6495 " candidate expects %d argument, %d provided",
6496 " candidate expects %d arguments, %d provided",
6499 return unify_invalid (explain_p
);
6503 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
6505 return unify_arity (explain_p
, have
, wanted
);
6509 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
6510 bool least_p
= false)
6512 return unify_arity (explain_p
, have
, wanted
, least_p
);
6516 unify_arg_conversion (bool explain_p
, tree to_type
,
6517 tree from_type
, tree arg
)
6520 inform (EXPR_LOC_OR_LOC (arg
, input_location
),
6521 " cannot convert %qE (type %qT) to type %qT",
6522 arg
, from_type
, to_type
);
6523 return unify_invalid (explain_p
);
6527 unify_no_common_base (bool explain_p
, enum template_base_result r
,
6528 tree parm
, tree arg
)
6533 case tbr_ambiguous_baseclass
:
6534 inform (input_location
, " %qT is an ambiguous base class of %qT",
6538 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
6541 return unify_invalid (explain_p
);
6545 unify_inconsistent_template_template_parameters (bool explain_p
)
6548 inform (input_location
,
6549 " template parameters of a template template argument are "
6550 "inconsistent with other deduced template arguments");
6551 return unify_invalid (explain_p
);
6555 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
6558 inform (input_location
,
6559 " can't deduce a template for %qT from non-template type %qT",
6561 return unify_invalid (explain_p
);
6565 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
6568 inform (input_location
,
6569 " template argument %qE does not match %qE", arg
, parm
);
6570 return unify_invalid (explain_p
);
6573 /* Attempt to convert the non-type template parameter EXPR to the
6574 indicated TYPE. If the conversion is successful, return the
6575 converted value. If the conversion is unsuccessful, return
6576 NULL_TREE if we issued an error message, or error_mark_node if we
6577 did not. We issue error messages for out-and-out bad template
6578 parameters, but not simply because the conversion failed, since we
6579 might be just trying to do argument deduction. Both TYPE and EXPR
6580 must be non-dependent.
6582 The conversion follows the special rules described in
6583 [temp.arg.nontype], and it is much more strict than an implicit
6586 This function is called twice for each template argument (see
6587 lookup_template_class for a more accurate description of this
6588 problem). This means that we need to handle expressions which
6589 are not valid in a C++ source, but can be created from the
6590 first call (for instance, casts to perform conversions). These
6591 hacks can go away after we fix the double coercion problem. */
6594 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
6597 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
6598 tree orig_expr
= expr
;
6600 /* Detect immediately string literals as invalid non-type argument.
6601 This special-case is not needed for correctness (we would easily
6602 catch this later), but only to provide better diagnostic for this
6603 common user mistake. As suggested by DR 100, we do not mention
6604 linkage issues in the diagnostic as this is not the point. */
6605 /* FIXME we're making this OK. */
6606 if (TREE_CODE (expr
) == STRING_CST
)
6608 if (complain
& tf_error
)
6609 error ("%qE is not a valid template argument for type %qT "
6610 "because string literals can never be used in this context",
6615 /* Add the ADDR_EXPR now for the benefit of
6616 value_dependent_expression_p. */
6617 if (TYPE_PTROBV_P (type
)
6618 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
6620 expr
= decay_conversion (expr
, complain
);
6621 if (expr
== error_mark_node
)
6622 return error_mark_node
;
6625 /* If we are in a template, EXPR may be non-dependent, but still
6626 have a syntactic, rather than semantic, form. For example, EXPR
6627 might be a SCOPE_REF, rather than the VAR_DECL to which the
6628 SCOPE_REF refers. Preserving the qualifying scope is necessary
6629 so that access checking can be performed when the template is
6630 instantiated -- but here we need the resolved form so that we can
6631 convert the argument. */
6632 bool non_dep
= false;
6633 if (TYPE_REF_OBJ_P (type
)
6634 && has_value_dependent_address (expr
))
6635 /* If we want the address and it's value-dependent, don't fold. */;
6636 else if (processing_template_decl
6637 && is_nondependent_constant_expression (expr
))
6639 if (error_operand_p (expr
))
6640 return error_mark_node
;
6641 expr_type
= TREE_TYPE (expr
);
6643 /* If the argument is non-dependent, perform any conversions in
6644 non-dependent context as well. */
6645 processing_template_decl_sentinel
s (non_dep
);
6647 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
6649 if (value_dependent_expression_p (expr
))
6650 expr
= canonicalize_expr_argument (expr
, complain
);
6652 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
6653 to a non-type argument of "nullptr". */
6654 if (NULLPTR_TYPE_P (expr_type
) && TYPE_PTR_OR_PTRMEM_P (type
))
6655 expr
= fold_simple (convert (type
, expr
));
6657 /* In C++11, integral or enumeration non-type template arguments can be
6658 arbitrary constant expressions. Pointer and pointer to
6659 member arguments can be general constant expressions that evaluate
6660 to a null value, but otherwise still need to be of a specific form. */
6661 if (cxx_dialect
>= cxx11
)
6663 if (TREE_CODE (expr
) == PTRMEM_CST
)
6664 /* A PTRMEM_CST is already constant, and a valid template
6665 argument for a parameter of pointer to member type, we just want
6666 to leave it in that form rather than lower it to a
6668 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
6669 || cxx_dialect
>= cxx17
)
6671 /* C++17: A template-argument for a non-type template-parameter shall
6672 be a converted constant expression (8.20) of the type of the
6673 template-parameter. */
6674 expr
= build_converted_constant_expr (type
, expr
, complain
);
6675 if (expr
== error_mark_node
)
6676 return error_mark_node
;
6677 expr
= maybe_constant_value (expr
);
6678 expr
= convert_from_reference (expr
);
6680 else if (TYPE_PTR_OR_PTRMEM_P (type
))
6682 tree folded
= maybe_constant_value (expr
);
6683 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
6684 : null_member_pointer_value_p (folded
))
6689 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6690 expr
= mark_lvalue_use (expr
);
6692 expr
= mark_rvalue_use (expr
);
6694 /* HACK: Due to double coercion, we can get a
6695 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
6696 which is the tree that we built on the first call (see
6697 below when coercing to reference to object or to reference to
6698 function). We just strip everything and get to the arg.
6699 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
6701 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
6703 tree probe_type
, probe
= expr
;
6704 if (REFERENCE_REF_P (probe
))
6705 probe
= TREE_OPERAND (probe
, 0);
6706 probe_type
= TREE_TYPE (probe
);
6707 if (TREE_CODE (probe
) == NOP_EXPR
)
6709 /* ??? Maybe we could use convert_from_reference here, but we
6710 would need to relax its constraints because the NOP_EXPR
6711 could actually change the type to something more cv-qualified,
6712 and this is not folded by convert_from_reference. */
6713 tree addr
= TREE_OPERAND (probe
, 0);
6714 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
6715 && TREE_CODE (addr
) == ADDR_EXPR
6716 && TYPE_PTR_P (TREE_TYPE (addr
))
6717 && (same_type_ignoring_top_level_qualifiers_p
6718 (TREE_TYPE (probe_type
),
6719 TREE_TYPE (TREE_TYPE (addr
)))))
6721 expr
= TREE_OPERAND (addr
, 0);
6722 expr_type
= TREE_TYPE (probe_type
);
6727 /* [temp.arg.nontype]/5, bullet 1
6729 For a non-type template-parameter of integral or enumeration type,
6730 integral promotions (_conv.prom_) and integral conversions
6731 (_conv.integral_) are applied. */
6732 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6734 if (cxx_dialect
< cxx11
)
6736 tree t
= build_converted_constant_expr (type
, expr
, complain
);
6737 t
= maybe_constant_value (t
);
6738 if (t
!= error_mark_node
)
6742 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
6743 return error_mark_node
;
6745 /* Notice that there are constant expressions like '4 % 0' which
6746 do not fold into integer constants. */
6747 if (TREE_CODE (expr
) != INTEGER_CST
6748 && !value_dependent_expression_p (expr
))
6750 if (complain
& tf_error
)
6752 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
6753 if (!require_potential_constant_expression (expr
))
6754 expr
= error_mark_node
;
6756 expr
= cxx_constant_value (expr
);
6757 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
6758 inform (loc
, "in template argument for type %qT", type
);
6759 if (expr
== error_mark_node
)
6761 /* else cxx_constant_value complained but gave us
6762 a real constant, so go ahead. */
6763 if (TREE_CODE (expr
) != INTEGER_CST
)
6765 /* Some assemble time constant expressions like
6766 (intptr_t)&&lab1 - (intptr_t)&&lab2 or
6767 4 + (intptr_t)&&var satisfy reduced_constant_expression_p
6768 as we can emit them into .rodata initializers of
6769 variables, yet they can't fold into an INTEGER_CST at
6770 compile time. Refuse them here. */
6771 gcc_checking_assert (reduced_constant_expression_p (expr
));
6772 error_at (loc
, "template argument %qE for type %qT not "
6773 "a constant integer", expr
, type
);
6781 /* Avoid typedef problems. */
6782 if (TREE_TYPE (expr
) != type
)
6783 expr
= fold_convert (type
, expr
);
6785 /* [temp.arg.nontype]/5, bullet 2
6787 For a non-type template-parameter of type pointer to object,
6788 qualification conversions (_conv.qual_) and the array-to-pointer
6789 conversion (_conv.array_) are applied. */
6790 else if (TYPE_PTROBV_P (type
))
6792 tree decayed
= expr
;
6794 /* Look through any NOP_EXPRs around an ADDR_EXPR, whether they come from
6795 decay_conversion or an explicit cast. If it's a problematic cast,
6796 we'll complain about it below. */
6797 if (TREE_CODE (expr
) == NOP_EXPR
)
6801 if (TREE_CODE (probe
) == ADDR_EXPR
6802 && TYPE_PTR_P (TREE_TYPE (probe
)))
6805 expr_type
= TREE_TYPE (expr
);
6809 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
6811 A template-argument for a non-type, non-template template-parameter
6812 shall be one of: [...]
6814 -- the name of a non-type template-parameter;
6815 -- the address of an object or function with external linkage, [...]
6816 expressed as "& id-expression" where the & is optional if the name
6817 refers to a function or array, or if the corresponding
6818 template-parameter is a reference.
6820 Here, we do not care about functions, as they are invalid anyway
6821 for a parameter of type pointer-to-object. */
6823 if (value_dependent_expression_p (expr
))
6824 /* Non-type template parameters are OK. */
6826 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6827 /* Null pointer values are OK in C++11. */;
6828 else if (TREE_CODE (expr
) != ADDR_EXPR
)
6832 if (complain
& tf_error
)
6833 error ("%qD is not a valid template argument "
6834 "because %qD is a variable, not the address of "
6835 "a variable", orig_expr
, expr
);
6838 if (POINTER_TYPE_P (expr_type
))
6840 if (complain
& tf_error
)
6841 error ("%qE is not a valid template argument for %qT "
6842 "because it is not the address of a variable",
6846 /* Other values, like integer constants, might be valid
6847 non-type arguments of some other type. */
6848 return error_mark_node
;
6852 tree decl
= TREE_OPERAND (expr
, 0);
6856 if (complain
& tf_error
)
6857 error ("%qE is not a valid template argument of type %qT "
6858 "because %qE is not a variable", orig_expr
, type
, decl
);
6861 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
6863 if (complain
& tf_error
)
6864 error ("%qE is not a valid template argument of type %qT "
6865 "because %qD does not have external linkage",
6866 orig_expr
, type
, decl
);
6869 else if ((cxx_dialect
>= cxx11
&& cxx_dialect
< cxx17
)
6870 && decl_linkage (decl
) == lk_none
)
6872 if (complain
& tf_error
)
6873 error ("%qE is not a valid template argument of type %qT "
6874 "because %qD has no linkage", orig_expr
, type
, decl
);
6877 /* C++17: For a non-type template-parameter of reference or pointer
6878 type, the value of the constant expression shall not refer to (or
6879 for a pointer type, shall not be the address of):
6880 * a subobject (4.5),
6881 * a temporary object (15.2),
6882 * a string literal (5.13.5),
6883 * the result of a typeid expression (8.2.8), or
6884 * a predefined __func__ variable (11.4.1). */
6885 else if (DECL_ARTIFICIAL (decl
))
6887 if (complain
& tf_error
)
6888 error ("the address of %qD is not a valid template argument",
6892 else if (!same_type_ignoring_top_level_qualifiers_p
6893 (strip_array_types (TREE_TYPE (type
)),
6894 strip_array_types (TREE_TYPE (decl
))))
6896 if (complain
& tf_error
)
6897 error ("the address of the %qT subobject of %qD is not a "
6898 "valid template argument", TREE_TYPE (type
), decl
);
6901 else if (!TREE_STATIC (decl
) && !DECL_EXTERNAL (decl
))
6903 if (complain
& tf_error
)
6904 error ("the address of %qD is not a valid template argument "
6905 "because it does not have static storage duration",
6913 expr
= perform_qualification_conversions (type
, expr
);
6914 if (expr
== error_mark_node
)
6915 return error_mark_node
;
6917 /* [temp.arg.nontype]/5, bullet 3
6919 For a non-type template-parameter of type reference to object, no
6920 conversions apply. The type referred to by the reference may be more
6921 cv-qualified than the (otherwise identical) type of the
6922 template-argument. The template-parameter is bound directly to the
6923 template-argument, which must be an lvalue. */
6924 else if (TYPE_REF_OBJ_P (type
))
6926 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
6928 return error_mark_node
;
6930 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
6932 if (complain
& tf_error
)
6933 error ("%qE is not a valid template argument for type %qT "
6934 "because of conflicts in cv-qualification", expr
, type
);
6938 if (!lvalue_p (expr
))
6940 if (complain
& tf_error
)
6941 error ("%qE is not a valid template argument for type %qT "
6942 "because it is not an lvalue", expr
, type
);
6946 /* [temp.arg.nontype]/1
6948 A template-argument for a non-type, non-template template-parameter
6949 shall be one of: [...]
6951 -- the address of an object or function with external linkage. */
6952 if (INDIRECT_REF_P (expr
)
6953 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
6955 expr
= TREE_OPERAND (expr
, 0);
6958 if (complain
& tf_error
)
6959 error ("%q#D is not a valid template argument for type %qT "
6960 "because a reference variable does not have a constant "
6961 "address", expr
, type
);
6966 if (TYPE_REF_OBJ_P (TREE_TYPE (expr
))
6967 && value_dependent_expression_p (expr
))
6968 /* OK, dependent reference. We don't want to ask whether a DECL is
6969 itself value-dependent, since what we want here is its address. */;
6974 if (complain
& tf_error
)
6975 error ("%qE is not a valid template argument for type %qT "
6976 "because it is not an object with linkage",
6981 /* DR 1155 allows internal linkage in C++11 and up. */
6982 linkage_kind linkage
= decl_linkage (expr
);
6983 if (linkage
< (cxx_dialect
>= cxx11
? lk_internal
: lk_external
))
6985 if (complain
& tf_error
)
6986 error ("%qE is not a valid template argument for type %qT "
6987 "because object %qD does not have linkage",
6992 expr
= build_address (expr
);
6995 if (!same_type_p (type
, TREE_TYPE (expr
)))
6996 expr
= build_nop (type
, expr
);
6998 /* [temp.arg.nontype]/5, bullet 4
7000 For a non-type template-parameter of type pointer to function, only
7001 the function-to-pointer conversion (_conv.func_) is applied. If the
7002 template-argument represents a set of overloaded functions (or a
7003 pointer to such), the matching function is selected from the set
7005 else if (TYPE_PTRFN_P (type
))
7007 /* If the argument is a template-id, we might not have enough
7008 context information to decay the pointer. */
7009 if (!type_unknown_p (expr_type
))
7011 expr
= decay_conversion (expr
, complain
);
7012 if (expr
== error_mark_node
)
7013 return error_mark_node
;
7016 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
7017 /* Null pointer values are OK in C++11. */
7018 return perform_qualification_conversions (type
, expr
);
7020 expr
= convert_nontype_argument_function (type
, expr
, complain
);
7021 if (!expr
|| expr
== error_mark_node
)
7024 /* [temp.arg.nontype]/5, bullet 5
7026 For a non-type template-parameter of type reference to function, no
7027 conversions apply. If the template-argument represents a set of
7028 overloaded functions, the matching function is selected from the set
7030 else if (TYPE_REFFN_P (type
))
7032 if (TREE_CODE (expr
) == ADDR_EXPR
)
7034 if (complain
& tf_error
)
7036 error ("%qE is not a valid template argument for type %qT "
7037 "because it is a pointer", expr
, type
);
7038 inform (input_location
, "try using %qE instead",
7039 TREE_OPERAND (expr
, 0));
7044 expr
= convert_nontype_argument_function (type
, expr
, complain
);
7045 if (!expr
|| expr
== error_mark_node
)
7048 /* [temp.arg.nontype]/5, bullet 6
7050 For a non-type template-parameter of type pointer to member function,
7051 no conversions apply. If the template-argument represents a set of
7052 overloaded member functions, the matching member function is selected
7053 from the set (_over.over_). */
7054 else if (TYPE_PTRMEMFUNC_P (type
))
7056 expr
= instantiate_type (type
, expr
, tf_none
);
7057 if (expr
== error_mark_node
)
7058 return error_mark_node
;
7060 /* [temp.arg.nontype] bullet 1 says the pointer to member
7061 expression must be a pointer-to-member constant. */
7062 if (!value_dependent_expression_p (expr
)
7063 && !check_valid_ptrmem_cst_expr (type
, expr
, complain
))
7066 /* Repeated conversion can't deal with a conversion that turns PTRMEM_CST
7067 into a CONSTRUCTOR, so build up a new PTRMEM_CST instead. */
7068 if (fnptr_conv_p (type
, TREE_TYPE (expr
)))
7069 expr
= make_ptrmem_cst (type
, PTRMEM_CST_MEMBER (expr
));
7071 /* [temp.arg.nontype]/5, bullet 7
7073 For a non-type template-parameter of type pointer to data member,
7074 qualification conversions (_conv.qual_) are applied. */
7075 else if (TYPE_PTRDATAMEM_P (type
))
7077 /* [temp.arg.nontype] bullet 1 says the pointer to member
7078 expression must be a pointer-to-member constant. */
7079 if (!value_dependent_expression_p (expr
)
7080 && !check_valid_ptrmem_cst_expr (type
, expr
, complain
))
7083 expr
= perform_qualification_conversions (type
, expr
);
7084 if (expr
== error_mark_node
)
7087 else if (NULLPTR_TYPE_P (type
))
7089 if (!NULLPTR_TYPE_P (TREE_TYPE (expr
)))
7091 if (complain
& tf_error
)
7092 error ("%qE is not a valid template argument for type %qT "
7093 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
7098 /* A template non-type parameter must be one of the above. */
7102 /* Sanity check: did we actually convert the argument to the
7104 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7105 (type
, TREE_TYPE (expr
)));
7106 return convert_from_reference (expr
);
7109 /* Subroutine of coerce_template_template_parms, which returns 1 if
7110 PARM_PARM and ARG_PARM match using the rule for the template
7111 parameters of template template parameters. Both PARM and ARG are
7112 template parameters; the rest of the arguments are the same as for
7113 coerce_template_template_parms.
7116 coerce_template_template_parm (tree parm
,
7118 tsubst_flags_t complain
,
7122 if (arg
== NULL_TREE
|| error_operand_p (arg
)
7123 || parm
== NULL_TREE
|| error_operand_p (parm
))
7126 if (TREE_CODE (arg
) != TREE_CODE (parm
))
7129 switch (TREE_CODE (parm
))
7132 /* We encounter instantiations of templates like
7133 template <template <template <class> class> class TT>
7136 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
7137 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
7139 if (!coerce_template_template_parms
7140 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
7146 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
7147 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
7148 /* Argument is a parameter pack but parameter is not. */
7153 /* The tsubst call is used to handle cases such as
7155 template <int> class C {};
7156 template <class T, template <T> class TT> class D {};
7159 i.e. the parameter list of TT depends on earlier parameters. */
7160 if (!uses_template_parms (TREE_TYPE (arg
)))
7162 tree t
= tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
);
7163 if (!uses_template_parms (t
)
7164 && !same_type_p (t
, TREE_TYPE (arg
)))
7168 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
7169 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
7170 /* Argument is a parameter pack but parameter is not. */
7182 /* Coerce template argument list ARGLIST for use with template
7183 template-parameter TEMPL. */
7186 coerce_template_args_for_ttp (tree templ
, tree arglist
,
7187 tsubst_flags_t complain
)
7189 /* Consider an example where a template template parameter declared as
7191 template <class T, class U = std::allocator<T> > class TT
7193 The template parameter level of T and U are one level larger than
7194 of TT. To proper process the default argument of U, say when an
7195 instantiation `TT<int>' is seen, we need to build the full
7196 arguments containing {int} as the innermost level. Outer levels,
7197 available when not appearing as default template argument, can be
7198 obtained from the arguments of the enclosing template.
7200 Suppose that TT is later substituted with std::vector. The above
7201 instantiation is `TT<int, std::allocator<T> >' with TT at
7202 level 1, and T at level 2, while the template arguments at level 1
7203 becomes {std::vector} and the inner level 2 is {int}. */
7205 tree outer
= DECL_CONTEXT (templ
);
7208 if (DECL_TEMPLATE_SPECIALIZATION (outer
))
7209 /* We want arguments for the partial specialization, not arguments for
7210 the primary template. */
7211 outer
= template_parms_to_args (DECL_TEMPLATE_PARMS (outer
));
7213 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
7215 else if (current_template_parms
)
7217 /* This is an argument of the current template, so we haven't set
7218 DECL_CONTEXT yet. */
7219 tree relevant_template_parms
;
7221 /* Parameter levels that are greater than the level of the given
7222 template template parm are irrelevant. */
7223 relevant_template_parms
= current_template_parms
;
7224 while (TMPL_PARMS_DEPTH (relevant_template_parms
)
7225 != TEMPLATE_TYPE_LEVEL (TREE_TYPE (templ
)))
7226 relevant_template_parms
= TREE_CHAIN (relevant_template_parms
);
7228 outer
= template_parms_to_args (relevant_template_parms
);
7232 arglist
= add_to_template_args (outer
, arglist
);
7234 tree parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
7235 return coerce_template_parms (parmlist
, arglist
, templ
,
7237 /*require_all_args=*/true,
7238 /*use_default_args=*/true);
7241 /* A cache of template template parameters with match-all default
7243 static GTY((deletable
)) hash_map
<tree
,tree
> *defaulted_ttp_cache
;
7245 store_defaulted_ttp (tree v
, tree t
)
7247 if (!defaulted_ttp_cache
)
7248 defaulted_ttp_cache
= hash_map
<tree
,tree
>::create_ggc (13);
7249 defaulted_ttp_cache
->put (v
, t
);
7252 lookup_defaulted_ttp (tree v
)
7254 if (defaulted_ttp_cache
)
7255 if (tree
*p
= defaulted_ttp_cache
->get (v
))
7260 /* T is a bound template template-parameter. Copy its arguments into default
7261 arguments of the template template-parameter's template parameters. */
7264 add_defaults_to_ttp (tree otmpl
)
7266 if (tree c
= lookup_defaulted_ttp (otmpl
))
7269 tree ntmpl
= copy_node (otmpl
);
7271 tree ntype
= copy_node (TREE_TYPE (otmpl
));
7272 TYPE_STUB_DECL (ntype
) = TYPE_NAME (ntype
) = ntmpl
;
7273 TYPE_MAIN_VARIANT (ntype
) = ntype
;
7274 TYPE_POINTER_TO (ntype
) = TYPE_REFERENCE_TO (ntype
) = NULL_TREE
;
7275 TYPE_NAME (ntype
) = ntmpl
;
7276 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
7278 tree idx
= TEMPLATE_TYPE_PARM_INDEX (ntype
)
7279 = copy_node (TEMPLATE_TYPE_PARM_INDEX (ntype
));
7280 TEMPLATE_PARM_DECL (idx
) = ntmpl
;
7281 TREE_TYPE (ntmpl
) = TREE_TYPE (idx
) = ntype
;
7283 tree oparms
= DECL_TEMPLATE_PARMS (otmpl
);
7284 tree parms
= DECL_TEMPLATE_PARMS (ntmpl
) = copy_node (oparms
);
7285 TREE_CHAIN (parms
) = TREE_CHAIN (oparms
);
7286 tree vec
= TREE_VALUE (parms
) = copy_node (TREE_VALUE (parms
));
7287 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
7289 tree o
= TREE_VEC_ELT (vec
, i
);
7290 if (!template_parameter_pack_p (TREE_VALUE (o
)))
7292 tree n
= TREE_VEC_ELT (vec
, i
) = copy_node (o
);
7293 TREE_PURPOSE (n
) = any_targ_node
;
7297 store_defaulted_ttp (otmpl
, ntmpl
);
7301 /* ARG is a bound potential template template-argument, and PARGS is a list
7302 of arguments for the corresponding template template-parameter. Adjust
7303 PARGS as appropriate for application to ARG's template, and if ARG is a
7304 BOUND_TEMPLATE_TEMPLATE_PARM, possibly adjust it to add default template
7305 arguments to the template template parameter. */
7308 coerce_ttp_args_for_tta (tree
& arg
, tree pargs
, tsubst_flags_t complain
)
7310 ++processing_template_decl
;
7311 tree arg_tmpl
= TYPE_TI_TEMPLATE (arg
);
7312 if (DECL_TEMPLATE_TEMPLATE_PARM_P (arg_tmpl
))
7314 /* When comparing two template template-parameters in partial ordering,
7315 rewrite the one currently being used as an argument to have default
7316 arguments for all parameters. */
7317 arg_tmpl
= add_defaults_to_ttp (arg_tmpl
);
7318 pargs
= coerce_template_args_for_ttp (arg_tmpl
, pargs
, complain
);
7319 if (pargs
!= error_mark_node
)
7320 arg
= bind_template_template_parm (TREE_TYPE (arg_tmpl
),
7321 TYPE_TI_ARGS (arg
));
7326 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (arg_tmpl
));
7327 pargs
= coerce_template_parms (aparms
, pargs
, arg_tmpl
, complain
,
7328 /*require_all*/true,
7329 /*use_default*/true);
7331 --processing_template_decl
;
7335 /* Subroutine of unify for the case when PARM is a
7336 BOUND_TEMPLATE_TEMPLATE_PARM. */
7339 unify_bound_ttp_args (tree tparms
, tree targs
, tree parm
, tree
& arg
,
7342 tree parmvec
= TYPE_TI_ARGS (parm
);
7343 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
7345 /* The template template parm might be variadic and the argument
7346 not, so flatten both argument lists. */
7347 parmvec
= expand_template_argument_pack (parmvec
);
7348 argvec
= expand_template_argument_pack (argvec
);
7352 /* In keeping with P0522R0, adjust P's template arguments
7353 to apply to A's template; then flatten it again. */
7354 tree nparmvec
= parmvec
;
7355 nparmvec
= coerce_ttp_args_for_tta (arg
, parmvec
, tf_none
);
7356 nparmvec
= expand_template_argument_pack (nparmvec
);
7358 if (unify (tparms
, targs
, nparmvec
, argvec
,
7359 UNIFY_ALLOW_NONE
, explain_p
))
7362 /* If the P0522 adjustment eliminated a pack expansion, deduce
7365 && TREE_VEC_LENGTH (nparmvec
) < TREE_VEC_LENGTH (parmvec
)
7366 && unify_pack_expansion (tparms
, targs
, parmvec
, argvec
,
7367 DEDUCE_EXACT
, /*sub*/true, explain_p
))
7372 /* Deduce arguments T, i from TT<T> or TT<i>.
7373 We check each element of PARMVEC and ARGVEC individually
7374 rather than the whole TREE_VEC since they can have
7375 different number of elements, which is allowed under N2555. */
7377 int len
= TREE_VEC_LENGTH (parmvec
);
7379 /* Check if the parameters end in a pack, making them
7381 int parm_variadic_p
= 0;
7383 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
7384 parm_variadic_p
= 1;
7386 for (int i
= 0; i
< len
- parm_variadic_p
; ++i
)
7387 /* If the template argument list of P contains a pack
7388 expansion that is not the last template argument, the
7389 entire template argument list is a non-deduced
7391 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
7392 return unify_success (explain_p
);
7394 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
7395 return unify_too_few_arguments (explain_p
,
7396 TREE_VEC_LENGTH (argvec
), len
);
7398 for (int i
= 0; i
< len
- parm_variadic_p
; ++i
)
7399 if (unify (tparms
, targs
,
7400 TREE_VEC_ELT (parmvec
, i
),
7401 TREE_VEC_ELT (argvec
, i
),
7402 UNIFY_ALLOW_NONE
, explain_p
))
7406 && unify_pack_expansion (tparms
, targs
,
7409 /*subr=*/true, explain_p
))
7416 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
7417 template template parameters. Both PARM_PARMS and ARG_PARMS are
7418 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
7421 Consider the example:
7422 template <class T> class A;
7423 template<template <class U> class TT> class B;
7425 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
7426 the parameters to A, and OUTER_ARGS contains A. */
7429 coerce_template_template_parms (tree parm_parms
,
7431 tsubst_flags_t complain
,
7435 int nparms
, nargs
, i
;
7439 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
7440 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
7442 nparms
= TREE_VEC_LENGTH (parm_parms
);
7443 nargs
= TREE_VEC_LENGTH (arg_parms
);
7447 /* P0522R0: A template template-parameter P is at least as specialized as
7448 a template template-argument A if, given the following rewrite to two
7449 function templates, the function template corresponding to P is at
7450 least as specialized as the function template corresponding to A
7451 according to the partial ordering rules for function templates
7452 ([temp.func.order]). Given an invented class template X with the
7453 template parameter list of A (including default arguments):
7455 * Each of the two function templates has the same template parameters,
7456 respectively, as P or A.
7458 * Each function template has a single function parameter whose type is
7459 a specialization of X with template arguments corresponding to the
7460 template parameters from the respective function template where, for
7461 each template parameter PP in the template parameter list of the
7462 function template, a corresponding template argument AA is formed. If
7463 PP declares a parameter pack, then AA is the pack expansion
7464 PP... ([temp.variadic]); otherwise, AA is the id-expression PP.
7466 If the rewrite produces an invalid type, then P is not at least as
7467 specialized as A. */
7469 /* So coerce P's args to apply to A's parms, and then deduce between A's
7470 args and the converted args. If that succeeds, A is at least as
7471 specialized as P, so they match.*/
7472 tree pargs
= template_parms_level_to_args (parm_parms
);
7473 ++processing_template_decl
;
7474 pargs
= coerce_template_parms (arg_parms
, pargs
, NULL_TREE
, tf_none
,
7475 /*require_all*/true, /*use_default*/true);
7476 --processing_template_decl
;
7477 if (pargs
!= error_mark_node
)
7479 tree targs
= make_tree_vec (nargs
);
7480 tree aargs
= template_parms_level_to_args (arg_parms
);
7481 if (!unify (arg_parms
, targs
, aargs
, pargs
, UNIFY_ALLOW_NONE
,
7487 /* Determine whether we have a parameter pack at the end of the
7488 template template parameter's template parameter list. */
7489 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
7491 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
7493 if (error_operand_p (parm
))
7496 switch (TREE_CODE (parm
))
7500 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
7505 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
7515 && !(variadic_p
&& nargs
>= nparms
- 1))
7518 /* Check all of the template parameters except the parameter pack at
7519 the end (if any). */
7520 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
7522 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
7523 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
7526 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
7527 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
7529 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
7537 /* Check each of the template parameters in the template
7538 argument against the template parameter pack at the end of
7539 the template template parameter. */
7540 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
7543 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
7545 for (; i
< nargs
; ++i
)
7547 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
7550 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
7552 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
7561 /* Verifies that the deduced template arguments (in TARGS) for the
7562 template template parameters (in TPARMS) represent valid bindings,
7563 by comparing the template parameter list of each template argument
7564 to the template parameter list of its corresponding template
7565 template parameter, in accordance with DR150. This
7566 routine can only be called after all template arguments have been
7567 deduced. It will return TRUE if all of the template template
7568 parameter bindings are okay, FALSE otherwise. */
7570 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
7572 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
7575 /* We're dealing with template parms in this process. */
7576 ++processing_template_decl
;
7578 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
7580 for (i
= 0; i
< ntparms
; ++i
)
7582 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
7583 tree targ
= TREE_VEC_ELT (targs
, i
);
7585 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
7587 tree packed_args
= NULL_TREE
;
7590 if (ARGUMENT_PACK_P (targ
))
7592 /* Look inside the argument pack. */
7593 packed_args
= ARGUMENT_PACK_ARGS (targ
);
7594 len
= TREE_VEC_LENGTH (packed_args
);
7597 for (idx
= 0; idx
< len
; ++idx
)
7599 tree targ_parms
= NULL_TREE
;
7602 /* Extract the next argument from the argument
7604 targ
= TREE_VEC_ELT (packed_args
, idx
);
7606 if (PACK_EXPANSION_P (targ
))
7607 /* Look at the pattern of the pack expansion. */
7608 targ
= PACK_EXPANSION_PATTERN (targ
);
7610 /* Extract the template parameters from the template
7612 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
7613 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
7614 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
7615 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
7617 /* Verify that we can coerce the template template
7618 parameters from the template argument to the template
7619 parameter. This requires an exact match. */
7621 && !coerce_template_template_parms
7622 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
7637 --processing_template_decl
;
7641 /* Since type attributes aren't mangled, we need to strip them from
7642 template type arguments. */
7645 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
7647 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
7649 bool removed_attributes
= false;
7650 tree canon
= strip_typedefs (arg
, &removed_attributes
);
7651 if (removed_attributes
7652 && (complain
& tf_warning
))
7653 warning (OPT_Wignored_attributes
,
7654 "ignoring attributes on template argument %qT", arg
);
7658 /* And from inside dependent non-type arguments like sizeof(Type). */
7661 canonicalize_expr_argument (tree arg
, tsubst_flags_t complain
)
7663 if (!arg
|| arg
== error_mark_node
)
7665 bool removed_attributes
= false;
7666 tree canon
= strip_typedefs_expr (arg
, &removed_attributes
);
7667 if (removed_attributes
7668 && (complain
& tf_warning
))
7669 warning (OPT_Wignored_attributes
,
7670 "ignoring attributes in template argument %qE", arg
);
7674 // A template declaration can be substituted for a constrained
7675 // template template parameter only when the argument is more
7676 // constrained than the parameter.
7678 is_compatible_template_arg (tree parm
, tree arg
)
7680 tree parm_cons
= get_constraints (parm
);
7682 /* For now, allow constrained template template arguments
7683 and unconstrained template template parameters. */
7684 if (parm_cons
== NULL_TREE
)
7687 tree arg_cons
= get_constraints (arg
);
7689 // If the template parameter is constrained, we need to rewrite its
7690 // constraints in terms of the ARG's template parameters. This ensures
7691 // that all of the template parameter types will have the same depth.
7693 // Note that this is only valid when coerce_template_template_parm is
7694 // true for the innermost template parameters of PARM and ARG. In other
7695 // words, because coercion is successful, this conversion will be valid.
7698 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (arg
));
7699 parm_cons
= tsubst_constraint_info (parm_cons
,
7700 INNERMOST_TEMPLATE_ARGS (args
),
7701 tf_none
, NULL_TREE
);
7702 if (parm_cons
== error_mark_node
)
7706 return subsumes (parm_cons
, arg_cons
);
7709 // Convert a placeholder argument into a binding to the original
7710 // parameter. The original parameter is saved as the TREE_TYPE of
7713 convert_wildcard_argument (tree parm
, tree arg
)
7715 TREE_TYPE (arg
) = parm
;
7719 /* We can't fully resolve ARG given as a non-type template argument to TYPE,
7720 because one of them is dependent. But we need to represent the
7721 conversion for the benefit of cp_tree_equal. */
7724 maybe_convert_nontype_argument (tree type
, tree arg
)
7726 /* Auto parms get no conversion. */
7727 if (type_uses_auto (type
))
7729 /* We don't need or want to add this conversion now if we're going to use the
7730 argument for deduction. */
7731 if (value_dependent_expression_p (arg
))
7734 type
= cv_unqualified (type
);
7735 tree argtype
= TREE_TYPE (arg
);
7736 if (same_type_p (type
, argtype
))
7739 arg
= build1 (IMPLICIT_CONV_EXPR
, type
, arg
);
7740 IMPLICIT_CONV_EXPR_NONTYPE_ARG (arg
) = true;
7744 /* Convert the indicated template ARG as necessary to match the
7745 indicated template PARM. Returns the converted ARG, or
7746 error_mark_node if the conversion was unsuccessful. Error and
7747 warning messages are issued under control of COMPLAIN. This
7748 conversion is for the Ith parameter in the parameter list. ARGS is
7749 the full set of template arguments deduced so far. */
7752 convert_template_argument (tree parm
,
7755 tsubst_flags_t complain
,
7761 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
7763 if (parm
== error_mark_node
)
7764 return error_mark_node
;
7766 /* Trivially convert placeholders. */
7767 if (TREE_CODE (arg
) == WILDCARD_DECL
)
7768 return convert_wildcard_argument (parm
, arg
);
7770 if (arg
== any_targ_node
)
7773 if (TREE_CODE (arg
) == TREE_LIST
7774 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
7776 /* The template argument was the name of some
7777 member function. That's usually
7778 invalid, but static members are OK. In any
7779 case, grab the underlying fields/functions
7780 and issue an error later if required. */
7781 orig_arg
= TREE_VALUE (arg
);
7782 TREE_TYPE (arg
) = unknown_type_node
;
7787 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
7788 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
7789 || requires_tmpl_type
);
7791 /* When determining whether an argument pack expansion is a template,
7792 look at the pattern. */
7793 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
7794 arg
= PACK_EXPANSION_PATTERN (arg
);
7796 /* Deal with an injected-class-name used as a template template arg. */
7797 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
7799 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
7800 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7802 if (cxx_dialect
>= cxx11
)
7803 /* OK under DR 1004. */;
7804 else if (complain
& tf_warning_or_error
)
7805 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
7806 " used as template template argument", TYPE_NAME (arg
));
7807 else if (flag_pedantic_errors
)
7815 ((TREE_CODE (arg
) == TEMPLATE_DECL
7816 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
7817 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
7818 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7819 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
7822 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7823 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
7824 arg
= TYPE_STUB_DECL (arg
);
7826 is_type
= TYPE_P (arg
) || is_tmpl_type
;
7828 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
7829 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
7831 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
7833 if (complain
& tf_error
)
7834 error ("invalid use of destructor %qE as a type", orig_arg
);
7835 return error_mark_node
;
7838 permerror (input_location
,
7839 "to refer to a type member of a template parameter, "
7840 "use %<typename %E%>", orig_arg
);
7842 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
7843 TREE_OPERAND (arg
, 1),
7849 if (is_type
!= requires_type
)
7853 if (complain
& tf_error
)
7855 error ("type/value mismatch at argument %d in template "
7856 "parameter list for %qD",
7859 inform (input_location
,
7860 " expected a constant of type %qT, got %qT",
7862 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
7863 else if (requires_tmpl_type
)
7864 inform (input_location
,
7865 " expected a class template, got %qE", orig_arg
);
7867 inform (input_location
,
7868 " expected a type, got %qE", orig_arg
);
7871 return error_mark_node
;
7873 if (is_tmpl_type
^ requires_tmpl_type
)
7875 if (in_decl
&& (complain
& tf_error
))
7877 error ("type/value mismatch at argument %d in template "
7878 "parameter list for %qD",
7881 inform (input_location
,
7882 " expected a type, got %qT", DECL_NAME (arg
));
7884 inform (input_location
,
7885 " expected a class template, got %qT", orig_arg
);
7887 return error_mark_node
;
7890 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7891 /* We already did the appropriate conversion when packing args. */
7895 if (requires_tmpl_type
)
7897 if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
7898 /* The number of argument required is not known yet.
7899 Just accept it for now. */
7903 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
7906 /* Strip alias templates that are equivalent to another
7908 arg
= get_underlying_template (arg
);
7909 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
7911 if (coerce_template_template_parms (parmparm
, argparm
,
7917 /* TEMPLATE_TEMPLATE_PARM node is preferred over
7919 if (val
!= error_mark_node
)
7921 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
7922 val
= TREE_TYPE (val
);
7923 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
7924 val
= make_pack_expansion (val
, complain
);
7929 if (in_decl
&& (complain
& tf_error
))
7931 error ("type/value mismatch at argument %d in "
7932 "template parameter list for %qD",
7934 inform (input_location
,
7935 " expected a template of type %qD, got %qT",
7939 val
= error_mark_node
;
7942 // Check that the constraints are compatible before allowing the
7944 if (val
!= error_mark_node
)
7945 if (!is_compatible_template_arg (parm
, arg
))
7947 if (in_decl
&& (complain
& tf_error
))
7949 error ("constraint mismatch at argument %d in "
7950 "template parameter list for %qD",
7952 inform (input_location
, " expected %qD but got %qD",
7955 val
= error_mark_node
;
7961 /* We only form one instance of each template specialization.
7962 Therefore, if we use a non-canonical variant (i.e., a
7963 typedef), any future messages referring to the type will use
7964 the typedef, which is confusing if those future uses do not
7965 themselves also use the typedef. */
7967 val
= canonicalize_type_argument (val
, complain
);
7971 tree t
= TREE_TYPE (parm
);
7973 if (TEMPLATE_PARM_LEVEL (get_template_parm_index (parm
))
7974 > TMPL_ARGS_DEPTH (args
))
7975 /* We don't have enough levels of args to do any substitution. This
7976 can happen in the context of -fnew-ttp-matching. */;
7977 else if (tree a
= type_uses_auto (t
))
7979 t
= do_auto_deduction (t
, arg
, a
, complain
, adc_unify
, args
);
7980 if (t
== error_mark_node
)
7981 return error_mark_node
;
7984 t
= tsubst (t
, args
, complain
, in_decl
);
7986 if (invalid_nontype_parm_type_p (t
, complain
))
7987 return error_mark_node
;
7989 if (!type_dependent_expression_p (orig_arg
)
7990 && !uses_template_parms (t
))
7991 /* We used to call digest_init here. However, digest_init
7992 will report errors, which we don't want when complain
7993 is zero. More importantly, digest_init will try too
7994 hard to convert things: for example, `0' should not be
7995 converted to pointer type at this point according to
7996 the standard. Accepting this is not merely an
7997 extension, since deciding whether or not these
7998 conversions can occur is part of determining which
7999 function template to call, or whether a given explicit
8000 argument specification is valid. */
8001 val
= convert_nontype_argument (t
, orig_arg
, complain
);
8004 val
= canonicalize_expr_argument (orig_arg
, complain
);
8005 val
= maybe_convert_nontype_argument (t
, val
);
8009 if (val
== NULL_TREE
)
8010 val
= error_mark_node
;
8011 else if (val
== error_mark_node
&& (complain
& tf_error
))
8012 error ("could not convert template argument %qE from %qT to %qT",
8013 orig_arg
, TREE_TYPE (orig_arg
), t
);
8015 if (INDIRECT_REF_P (val
))
8017 /* Reject template arguments that are references to built-in
8018 functions with no library fallbacks. */
8019 const_tree inner
= TREE_OPERAND (val
, 0);
8020 const_tree innertype
= TREE_TYPE (inner
);
8022 && TREE_CODE (innertype
) == REFERENCE_TYPE
8023 && TREE_CODE (TREE_TYPE (innertype
)) == FUNCTION_TYPE
8024 && TREE_OPERAND_LENGTH (inner
) > 0
8025 && reject_gcc_builtin (TREE_OPERAND (inner
, 0)))
8026 return error_mark_node
;
8029 if (TREE_CODE (val
) == SCOPE_REF
)
8031 /* Strip typedefs from the SCOPE_REF. */
8032 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
8033 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
8035 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
8036 QUALIFIED_NAME_IS_TEMPLATE (val
));
8043 /* Coerces the remaining template arguments in INNER_ARGS (from
8044 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
8045 Returns the coerced argument pack. PARM_IDX is the position of this
8046 parameter in the template parameter list. ARGS is the original
8047 template argument list. */
8049 coerce_template_parameter_pack (tree parms
,
8057 tsubst_flags_t complain
)
8059 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
8060 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
8063 tree packed_parms
= NULL_TREE
;
8065 if (arg_idx
> nargs
)
8068 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
8070 /* When the template parameter is a non-type template parameter pack
8071 or template template parameter pack whose type or template
8072 parameters use parameter packs, we know exactly how many arguments
8073 we are looking for. Build a vector of the instantiated decls for
8074 these template parameters in PACKED_PARMS. */
8075 /* We can't use make_pack_expansion here because it would interpret a
8076 _DECL as a use rather than a declaration. */
8077 tree decl
= TREE_VALUE (parm
);
8078 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
8079 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
8080 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
8081 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
8083 TREE_VEC_LENGTH (args
)--;
8084 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
8085 TREE_VEC_LENGTH (args
)++;
8087 if (packed_parms
== error_mark_node
)
8088 return error_mark_node
;
8090 /* If we're doing a partial instantiation of a member template,
8091 verify that all of the types used for the non-type
8092 template parameter pack are, in fact, valid for non-type
8093 template parameters. */
8095 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
8097 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
8098 for (j
= 0; j
< len
; ++j
)
8100 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
8101 if (invalid_nontype_parm_type_p (t
, complain
))
8102 return error_mark_node
;
8104 /* We don't know how many args we have yet, just
8105 use the unconverted ones for now. */
8109 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
8111 /* Check if we have a placeholder pack, which indicates we're
8112 in the context of a introduction list. In that case we want
8113 to match this pack to the single placeholder. */
8114 else if (arg_idx
< nargs
8115 && TREE_CODE (TREE_VEC_ELT (inner_args
, arg_idx
)) == WILDCARD_DECL
8116 && WILDCARD_PACK_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
8118 nargs
= arg_idx
+ 1;
8119 packed_args
= make_tree_vec (1);
8122 packed_args
= make_tree_vec (nargs
- arg_idx
);
8124 /* Convert the remaining arguments, which will be a part of the
8125 parameter pack "parm". */
8126 int first_pack_arg
= arg_idx
;
8127 for (; arg_idx
< nargs
; ++arg_idx
)
8129 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
8130 tree actual_parm
= TREE_VALUE (parm
);
8131 int pack_idx
= arg_idx
- first_pack_arg
;
8135 /* Once we've packed as many args as we have types, stop. */
8136 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
8138 else if (PACK_EXPANSION_P (arg
))
8139 /* We don't know how many args we have yet, just
8140 use the unconverted ones for now. */
8143 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
8146 if (arg
== error_mark_node
)
8148 if (complain
& tf_error
)
8149 error ("template argument %d is invalid", arg_idx
+ 1);
8152 arg
= convert_template_argument (actual_parm
,
8153 arg
, new_args
, complain
, parm_idx
,
8155 if (arg
== error_mark_node
)
8157 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
8160 if (arg_idx
- first_pack_arg
< TREE_VEC_LENGTH (packed_args
)
8161 && TREE_VEC_LENGTH (packed_args
) > 0)
8163 if (complain
& tf_error
)
8164 error ("wrong number of template arguments (%d, should be %d)",
8165 arg_idx
- first_pack_arg
, TREE_VEC_LENGTH (packed_args
));
8166 return error_mark_node
;
8169 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
8170 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
8171 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
8174 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
8175 TREE_CONSTANT (argument_pack
) = 1;
8178 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
8180 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
8181 TREE_VEC_LENGTH (packed_args
));
8182 return argument_pack
;
8185 /* Returns the number of pack expansions in the template argument vector
8189 pack_expansion_args_count (tree args
)
8194 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
8196 tree elt
= TREE_VEC_ELT (args
, i
);
8197 if (elt
&& PACK_EXPANSION_P (elt
))
8203 /* Convert all template arguments to their appropriate types, and
8204 return a vector containing the innermost resulting template
8205 arguments. If any error occurs, return error_mark_node. Error and
8206 warning messages are issued under control of COMPLAIN.
8208 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
8209 for arguments not specified in ARGS. Otherwise, if
8210 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
8211 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
8212 USE_DEFAULT_ARGS is false, then all arguments must be specified in
8216 coerce_template_parms (tree parms
,
8219 tsubst_flags_t complain
,
8220 bool require_all_args
,
8221 bool use_default_args
)
8223 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
8224 tree orig_inner_args
;
8227 tree new_inner_args
;
8228 int saved_unevaluated_operand
;
8229 int saved_inhibit_evaluation_warnings
;
8231 /* When used as a boolean value, indicates whether this is a
8232 variadic template parameter list. Since it's an int, we can also
8233 subtract it from nparms to get the number of non-variadic
8236 int variadic_args_p
= 0;
8237 int post_variadic_parms
= 0;
8239 /* Adjustment to nparms for fixed parameter packs. */
8240 int fixed_pack_adjust
= 0;
8241 int fixed_packs
= 0;
8244 /* Likewise for parameters with default arguments. */
8247 if (args
== error_mark_node
)
8248 return error_mark_node
;
8250 nparms
= TREE_VEC_LENGTH (parms
);
8252 /* Determine if there are any parameter packs or default arguments. */
8253 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
8255 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
8257 ++post_variadic_parms
;
8258 if (template_parameter_pack_p (TREE_VALUE (parm
)))
8260 if (TREE_PURPOSE (parm
))
8264 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
8265 /* If there are no parameters that follow a parameter pack, we need to
8266 expand any argument packs so that we can deduce a parameter pack from
8267 some non-packed args followed by an argument pack, as in variadic85.C.
8268 If there are such parameters, we need to leave argument packs intact
8269 so the arguments are assigned properly. This can happen when dealing
8270 with a nested class inside a partial specialization of a class
8271 template, as in variadic92.C, or when deducing a template parameter pack
8272 from a sub-declarator, as in variadic114.C. */
8273 if (!post_variadic_parms
)
8274 inner_args
= expand_template_argument_pack (inner_args
);
8276 /* Count any pack expansion args. */
8277 variadic_args_p
= pack_expansion_args_count (inner_args
);
8279 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
8280 if ((nargs
- variadic_args_p
> nparms
&& !variadic_p
)
8281 || (nargs
< nparms
- variadic_p
8284 && (!use_default_args
8285 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
8286 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
8289 if (complain
& tf_error
)
8291 if (variadic_p
|| default_p
)
8293 nparms
-= variadic_p
+ default_p
;
8294 error ("wrong number of template arguments "
8295 "(%d, should be at least %d)", nargs
, nparms
);
8298 error ("wrong number of template arguments "
8299 "(%d, should be %d)", nargs
, nparms
);
8302 inform (DECL_SOURCE_LOCATION (in_decl
),
8303 "provided for %qD", in_decl
);
8306 return error_mark_node
;
8308 /* We can't pass a pack expansion to a non-pack parameter of an alias
8309 template (DR 1430). */
8311 && (DECL_ALIAS_TEMPLATE_P (in_decl
)
8312 || concept_template_p (in_decl
))
8314 && nargs
- variadic_args_p
< nparms
- variadic_p
)
8316 if (complain
& tf_error
)
8318 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
8320 tree arg
= TREE_VEC_ELT (inner_args
, i
);
8321 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
8323 if (PACK_EXPANSION_P (arg
)
8324 && !template_parameter_pack_p (parm
))
8326 if (DECL_ALIAS_TEMPLATE_P (in_decl
))
8327 error_at (location_of (arg
),
8328 "pack expansion argument for non-pack parameter "
8329 "%qD of alias template %qD", parm
, in_decl
);
8331 error_at (location_of (arg
),
8332 "pack expansion argument for non-pack parameter "
8333 "%qD of concept %qD", parm
, in_decl
);
8334 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
8341 return error_mark_node
;
8344 /* We need to evaluate the template arguments, even though this
8345 template-id may be nested within a "sizeof". */
8346 saved_unevaluated_operand
= cp_unevaluated_operand
;
8347 cp_unevaluated_operand
= 0;
8348 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
8349 c_inhibit_evaluation_warnings
= 0;
8350 new_inner_args
= make_tree_vec (nparms
);
8351 new_args
= add_outermost_template_args (args
, new_inner_args
);
8352 int pack_adjust
= 0;
8353 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
8358 /* Get the Ith template parameter. */
8359 parm
= TREE_VEC_ELT (parms
, parm_idx
);
8361 if (parm
== error_mark_node
)
8363 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
8367 /* Calculate the next argument. */
8368 if (arg_idx
< nargs
)
8369 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
8373 if (template_parameter_pack_p (TREE_VALUE (parm
))
8374 && !(arg
&& ARGUMENT_PACK_P (arg
)))
8376 /* Some arguments will be placed in the
8377 template parameter pack PARM. */
8378 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
8379 inner_args
, arg_idx
,
8383 if (arg
== NULL_TREE
)
8385 /* We don't know how many args we have yet, just use the
8386 unconverted (and still packed) ones for now. */
8387 new_inner_args
= orig_inner_args
;
8392 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
8394 /* Store this argument. */
8395 if (arg
== error_mark_node
)
8398 /* We are done with all of the arguments. */
8404 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
8405 arg_idx
+= pack_adjust
;
8406 if (fixed_parameter_pack_p (TREE_VALUE (parm
)))
8409 fixed_pack_adjust
+= pack_adjust
;
8417 if (PACK_EXPANSION_P (arg
))
8419 /* "If every valid specialization of a variadic template
8420 requires an empty template parameter pack, the template is
8421 ill-formed, no diagnostic required." So check that the
8422 pattern works with this parameter. */
8423 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
8424 tree conv
= convert_template_argument (TREE_VALUE (parm
),
8428 if (conv
== error_mark_node
)
8430 if (complain
& tf_error
)
8431 inform (input_location
, "so any instantiation with a "
8432 "non-empty parameter pack would be ill-formed");
8435 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
8436 /* Recover from missing typename. */
8437 TREE_VEC_ELT (inner_args
, arg_idx
)
8438 = make_pack_expansion (conv
, complain
);
8440 /* We don't know how many args we have yet, just
8441 use the unconverted ones for now. */
8442 new_inner_args
= inner_args
;
8447 else if (require_all_args
)
8449 /* There must be a default arg in this case. */
8450 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
8452 /* The position of the first default template argument,
8453 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
8455 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
8456 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
8457 arg_idx
- pack_adjust
);
8462 if (arg
== error_mark_node
)
8464 if (complain
& tf_error
)
8465 error ("template argument %d is invalid", arg_idx
+ 1);
8469 /* This can occur if there was an error in the template
8470 parameter list itself (which we would already have
8471 reported) that we are trying to recover from, e.g., a class
8472 template with a parameter list such as
8473 template<typename..., typename> (cpp0x/variadic150.C). */
8476 /* This can also happen with a fixed parameter pack (71834). */
8477 if (arg_idx
>= nargs
)
8481 arg
= convert_template_argument (TREE_VALUE (parm
),
8482 arg
, new_args
, complain
,
8485 if (arg
== error_mark_node
)
8487 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
8489 cp_unevaluated_operand
= saved_unevaluated_operand
;
8490 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
8492 if (missing
|| arg_idx
< nargs
- variadic_args_p
)
8494 /* If we had fixed parameter packs, we didn't know how many arguments we
8495 actually needed earlier; now we do. */
8496 nparms
+= fixed_pack_adjust
;
8497 variadic_p
-= fixed_packs
;
8501 if (arg_idx
< nargs
)
8503 /* We had some pack expansion arguments that will only work if the packs
8504 are empty, but wait until instantiation time to complain.
8505 See variadic-ttp3.C. */
8506 int len
= nparms
+ (nargs
- arg_idx
);
8507 tree args
= make_tree_vec (len
);
8509 for (; i
< nparms
; ++i
)
8510 TREE_VEC_ELT (args
, i
) = TREE_VEC_ELT (new_inner_args
, i
);
8511 for (; i
< len
; ++i
, ++arg_idx
)
8512 TREE_VEC_ELT (args
, i
) = TREE_VEC_ELT (inner_args
,
8513 arg_idx
- pack_adjust
);
8514 new_inner_args
= args
;
8519 gcc_assert (!(complain
& tf_error
) || seen_error ());
8520 return error_mark_node
;
8523 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
8524 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
8525 TREE_VEC_LENGTH (new_inner_args
));
8527 return new_inner_args
;
8530 /* Convert all template arguments to their appropriate types, and
8531 return a vector containing the innermost resulting template
8532 arguments. If any error occurs, return error_mark_node. Error and
8533 warning messages are not issued.
8535 Note that no function argument deduction is performed, and default
8536 arguments are used to fill in unspecified arguments. */
8538 coerce_template_parms (tree parms
, tree args
, tree in_decl
)
8540 return coerce_template_parms (parms
, args
, in_decl
, tf_none
, true, true);
8543 /* Convert all template arguments to their appropriate type, and
8544 instantiate default arguments as needed. This returns a vector
8545 containing the innermost resulting template arguments, or
8546 error_mark_node if unsuccessful. */
8548 coerce_template_parms (tree parms
, tree args
, tree in_decl
,
8549 tsubst_flags_t complain
)
8551 return coerce_template_parms (parms
, args
, in_decl
, complain
, true, true);
8554 /* Like coerce_template_parms. If PARMS represents all template
8555 parameters levels, this function returns a vector of vectors
8556 representing all the resulting argument levels. Note that in this
8557 case, only the innermost arguments are coerced because the
8558 outermost ones are supposed to have been coerced already.
8560 Otherwise, if PARMS represents only (the innermost) vector of
8561 parameters, this function returns a vector containing just the
8562 innermost resulting arguments. */
8565 coerce_innermost_template_parms (tree parms
,
8568 tsubst_flags_t complain
,
8569 bool require_all_args
,
8570 bool use_default_args
)
8572 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
8573 int args_depth
= TMPL_ARGS_DEPTH (args
);
8576 if (parms_depth
> 1)
8578 coerced_args
= make_tree_vec (parms_depth
);
8582 for (level
= parms
, cur_depth
= parms_depth
;
8583 parms_depth
> 0 && level
!= NULL_TREE
;
8584 level
= TREE_CHAIN (level
), --cur_depth
)
8587 if (cur_depth
== args_depth
)
8588 l
= coerce_template_parms (TREE_VALUE (level
),
8589 args
, in_decl
, complain
,
8593 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
8595 if (l
== error_mark_node
)
8596 return error_mark_node
;
8598 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
8602 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
8603 args
, in_decl
, complain
,
8606 return coerced_args
;
8609 /* Returns 1 if template args OT and NT are equivalent. */
8612 template_args_equal (tree ot
, tree nt
, bool partial_order
/* = false */)
8616 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
8618 if (nt
== any_targ_node
|| ot
== any_targ_node
)
8621 if (TREE_CODE (nt
) == TREE_VEC
)
8622 /* For member templates */
8623 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
8624 else if (PACK_EXPANSION_P (ot
))
8625 return (PACK_EXPANSION_P (nt
)
8626 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
8627 PACK_EXPANSION_PATTERN (nt
))
8628 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
8629 PACK_EXPANSION_EXTRA_ARGS (nt
)));
8630 else if (ARGUMENT_PACK_P (ot
))
8635 if (!ARGUMENT_PACK_P (nt
))
8638 opack
= ARGUMENT_PACK_ARGS (ot
);
8639 npack
= ARGUMENT_PACK_ARGS (nt
);
8640 len
= TREE_VEC_LENGTH (opack
);
8641 if (TREE_VEC_LENGTH (npack
) != len
)
8643 for (i
= 0; i
< len
; ++i
)
8644 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
8645 TREE_VEC_ELT (npack
, i
)))
8649 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
8651 else if (TYPE_P (nt
))
8655 /* Don't treat an alias template specialization with dependent
8656 arguments as equivalent to its underlying type when used as a
8657 template argument; we need them to be distinct so that we
8658 substitute into the specialization arguments at instantiation
8659 time. And aliases can't be equivalent without being ==, so
8660 we don't need to look any deeper.
8662 During partial ordering, however, we need to treat them normally so
8663 that we can order uses of the same alias with different
8664 cv-qualification (79960). */
8666 && (TYPE_ALIAS_P (nt
) || TYPE_ALIAS_P (ot
)))
8669 return same_type_p (ot
, nt
);
8671 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
8675 /* Try to treat a template non-type argument that has been converted
8676 to the parameter type as equivalent to one that hasn't yet. */
8677 for (enum tree_code code1
= TREE_CODE (ot
);
8678 CONVERT_EXPR_CODE_P (code1
)
8679 || code1
== NON_LVALUE_EXPR
;
8680 code1
= TREE_CODE (ot
))
8681 ot
= TREE_OPERAND (ot
, 0);
8682 for (enum tree_code code2
= TREE_CODE (nt
);
8683 CONVERT_EXPR_CODE_P (code2
)
8684 || code2
== NON_LVALUE_EXPR
;
8685 code2
= TREE_CODE (nt
))
8686 nt
= TREE_OPERAND (nt
, 0);
8688 return cp_tree_equal (ot
, nt
);
8692 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
8693 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
8694 NEWARG_PTR with the offending arguments if they are non-NULL. */
8697 comp_template_args (tree oldargs
, tree newargs
,
8698 tree
*oldarg_ptr
, tree
*newarg_ptr
,
8703 if (oldargs
== newargs
)
8706 if (!oldargs
|| !newargs
)
8709 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
8712 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
8714 tree nt
= TREE_VEC_ELT (newargs
, i
);
8715 tree ot
= TREE_VEC_ELT (oldargs
, i
);
8717 if (! template_args_equal (ot
, nt
, partial_order
))
8719 if (oldarg_ptr
!= NULL
)
8721 if (newarg_ptr
!= NULL
)
8730 comp_template_args_porder (tree oargs
, tree nargs
)
8732 return comp_template_args (oargs
, nargs
, NULL
, NULL
, true);
8735 /* Implement a freelist interface for objects of type T.
8737 Head is a separate object, rather than a regular member, so that we
8738 can define it as a GTY deletable pointer, which is highly
8739 desirable. A data member could be declared that way, but then the
8740 containing object would implicitly get GTY((user)), which would
8741 prevent us from instantiating freelists as global objects.
8742 Although this way we can create freelist global objects, they're
8743 such thin wrappers that instantiating temporaries at every use
8744 loses nothing and saves permanent storage for the freelist object.
8746 Member functions next, anew, poison and reinit have default
8747 implementations that work for most of the types we're interested
8748 in, but if they don't work for some type, they should be explicitly
8749 specialized. See the comments before them for requirements, and
8750 the example specializations for the tree_list_freelist. */
8751 template <typename T
>
8754 /* Return the next object in a chain. We could just do type
8755 punning, but if we access the object with its underlying type, we
8756 avoid strict-aliasing trouble. This needs only work between
8757 poison and reinit. */
8758 static T
*&next (T
*obj
) { return obj
->next
; }
8760 /* Return a newly allocated, uninitialized or minimally-initialized
8761 object of type T. Any initialization performed by anew should
8762 either remain across the life of the object and the execution of
8763 poison, or be redone by reinit. */
8764 static T
*anew () { return ggc_alloc
<T
> (); }
8766 /* Optionally scribble all over the bits holding the object, so that
8767 they become (mostly?) uninitialized memory. This is called while
8768 preparing to make the object part of the free list. */
8769 static void poison (T
*obj
) {
8770 T
*p ATTRIBUTE_UNUSED
= obj
;
8771 T
**q ATTRIBUTE_UNUSED
= &next (obj
);
8773 #ifdef ENABLE_GC_CHECKING
8774 /* Poison the data, to indicate the data is garbage. */
8775 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (p
, sizeof (*p
)));
8776 memset (p
, 0xa5, sizeof (*p
));
8778 /* Let valgrind know the object is free. */
8779 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_NOACCESS (p
, sizeof (*p
)));
8781 /* Let valgrind know the next portion of the object is available,
8782 but uninitialized. */
8783 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (q
, sizeof (*q
)));
8786 /* Bring an object that underwent at least one lifecycle after anew
8787 and before the most recent free and poison, back to a usable
8788 state, reinitializing whatever is needed for it to be
8789 functionally equivalent to an object just allocated and returned
8790 by anew. This may poison or clear the next field, used by
8791 freelist housekeeping after poison was called. */
8792 static void reinit (T
*obj
) {
8793 T
**q ATTRIBUTE_UNUSED
= &next (obj
);
8795 #ifdef ENABLE_GC_CHECKING
8796 memset (q
, 0xa5, sizeof (*q
));
8798 /* Let valgrind know the entire object is available, but
8800 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (obj
, sizeof (*obj
)));
8803 /* Reference a GTY-deletable pointer that points to the first object
8804 in the free list proper. */
8807 /* Construct a freelist object chaining objects off of HEAD. */
8808 freelist (T
*&head
) : head(head
) {}
8810 /* Add OBJ to the free object list. The former head becomes OBJ's
8819 /* Take an object from the free list, if one is available, or
8820 allocate a new one. Objects taken from the free list should be
8821 regarded as filled with garbage, except for bits that are
8822 configured to be preserved across free and alloc. */
8837 /* Explicitly specialize the interfaces for freelist<tree_node>: we
8838 want to allocate a TREE_LIST using the usual interface, and ensure
8839 TREE_CHAIN remains functional. Alas, we have to duplicate a bit of
8840 build_tree_list logic in reinit, so this could go out of sync. */
8843 freelist
<tree_node
>::next (tree obj
)
8845 return TREE_CHAIN (obj
);
8849 freelist
<tree_node
>::anew ()
8851 return build_tree_list (NULL
, NULL
);
8855 freelist
<tree_node
>::poison (tree obj ATTRIBUTE_UNUSED
)
8857 int size ATTRIBUTE_UNUSED
= sizeof (tree_list
);
8858 tree p ATTRIBUTE_UNUSED
= obj
;
8859 tree_base
*b ATTRIBUTE_UNUSED
= &obj
->base
;
8860 tree
*q ATTRIBUTE_UNUSED
= &next (obj
);
8862 #ifdef ENABLE_GC_CHECKING
8863 gcc_checking_assert (TREE_CODE (obj
) == TREE_LIST
);
8865 /* Poison the data, to indicate the data is garbage. */
8866 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (p
, size
));
8867 memset (p
, 0xa5, size
);
8869 /* Let valgrind know the object is free. */
8870 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_NOACCESS (p
, size
));
8871 /* But we still want to use the TREE_CODE and TREE_CHAIN parts. */
8872 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_DEFINED (b
, sizeof (*b
)));
8873 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (q
, sizeof (*q
)));
8875 #ifdef ENABLE_GC_CHECKING
8876 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (b
, sizeof (*b
)));
8877 /* Keep TREE_CHAIN functional. */
8878 TREE_SET_CODE (obj
, TREE_LIST
);
8880 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_DEFINED (b
, sizeof (*b
)));
8885 freelist
<tree_node
>::reinit (tree obj ATTRIBUTE_UNUSED
)
8887 tree_base
*b ATTRIBUTE_UNUSED
= &obj
->base
;
8889 #ifdef ENABLE_GC_CHECKING
8890 gcc_checking_assert (TREE_CODE (obj
) == TREE_LIST
);
8891 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (obj
, sizeof (tree_list
)));
8892 memset (obj
, 0, sizeof (tree_list
));
8895 /* Let valgrind know the entire object is available, but
8897 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (obj
, sizeof (tree_list
)));
8899 #ifdef ENABLE_GC_CHECKING
8900 TREE_SET_CODE (obj
, TREE_LIST
);
8902 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_DEFINED (b
, sizeof (*b
)));
8906 /* Point to the first object in the TREE_LIST freelist. */
8907 static GTY((deletable
)) tree tree_list_freelist_head
;
8908 /* Return the/an actual TREE_LIST freelist. */
8909 static inline freelist
<tree_node
>
8910 tree_list_freelist ()
8912 return tree_list_freelist_head
;
8915 /* Point to the first object in the tinst_level freelist. */
8916 static GTY((deletable
)) tinst_level
*tinst_level_freelist_head
;
8917 /* Return the/an actual tinst_level freelist. */
8918 static inline freelist
<tinst_level
>
8919 tinst_level_freelist ()
8921 return tinst_level_freelist_head
;
8924 /* Point to the first object in the pending_template freelist. */
8925 static GTY((deletable
)) pending_template
*pending_template_freelist_head
;
8926 /* Return the/an actual pending_template freelist. */
8927 static inline freelist
<pending_template
>
8928 pending_template_freelist ()
8930 return pending_template_freelist_head
;
8933 /* Build the TREE_LIST object out of a split list, store it
8934 permanently, and return it. */
8936 tinst_level::to_list ()
8938 gcc_assert (split_list_p ());
8939 tree ret
= tree_list_freelist ().alloc ();
8940 TREE_PURPOSE (ret
) = tldcl
;
8941 TREE_VALUE (ret
) = targs
;
8944 gcc_assert (tree_list_p ());
8948 /* Increment OBJ's refcount. */
8949 static tinst_level
*
8950 inc_refcount_use (tinst_level
*obj
)
8955 gcc_assert (obj
->refcount
!= 0);
8960 /* Release storage for OBJ and node, if it's a TREE_LIST. */
8962 tinst_level::free (tinst_level
*obj
)
8964 if (obj
->tree_list_p ())
8965 tree_list_freelist ().free (obj
->get_node ());
8966 tinst_level_freelist ().free (obj
);
8969 /* Decrement OBJ's refcount. If it reaches zero, release OBJ's DECL
8970 and OBJ, and start over with the tinst_level object that used to be
8971 referenced by OBJ's NEXT. */
8973 dec_refcount_use (tinst_level
*obj
)
8975 while (obj
&& !--obj
->refcount
)
8977 gcc_assert (obj
->refcount
+1 != 0);
8978 tinst_level
*next
= obj
->next
;
8979 tinst_level::free (obj
);
8984 /* Modify PTR so that it points to OBJ, adjusting the refcounts of OBJ
8985 and of the former PTR. Omitting the second argument is equivalent
8986 to passing (T*)NULL; this is allowed because passing the
8987 zero-valued integral constant NULL confuses type deduction and/or
8988 overload resolution. */
8989 template <typename T
>
8991 set_refcount_ptr (T
*& ptr
, T
*obj
= NULL
)
8994 ptr
= inc_refcount_use (obj
);
8995 dec_refcount_use (save
);
8999 add_pending_template (tree d
)
9001 tree ti
= (TYPE_P (d
)
9002 ? CLASSTYPE_TEMPLATE_INFO (d
)
9003 : DECL_TEMPLATE_INFO (d
));
9004 struct pending_template
*pt
;
9007 if (TI_PENDING_TEMPLATE_FLAG (ti
))
9010 /* We are called both from instantiate_decl, where we've already had a
9011 tinst_level pushed, and instantiate_template, where we haven't.
9013 gcc_assert (TREE_CODE (d
) != TREE_LIST
);
9014 level
= !current_tinst_level
9015 || current_tinst_level
->maybe_get_node () != d
;
9018 push_tinst_level (d
);
9020 pt
= pending_template_freelist ().alloc ();
9023 set_refcount_ptr (pt
->tinst
, current_tinst_level
);
9024 if (last_pending_template
)
9025 last_pending_template
->next
= pt
;
9027 pending_templates
= pt
;
9029 last_pending_template
= pt
;
9031 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
9038 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
9039 ARGLIST. Valid choices for FNS are given in the cp-tree.def
9040 documentation for TEMPLATE_ID_EXPR. */
9043 lookup_template_function (tree fns
, tree arglist
)
9047 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
9048 return error_mark_node
;
9050 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
9052 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
9054 error ("%q#D is not a function template", fns
);
9055 return error_mark_node
;
9058 if (BASELINK_P (fns
))
9060 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
9062 BASELINK_FUNCTIONS (fns
),
9067 type
= TREE_TYPE (fns
);
9068 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
9069 type
= unknown_type_node
;
9071 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
9074 /* Within the scope of a template class S<T>, the name S gets bound
9075 (in build_self_reference) to a TYPE_DECL for the class, not a
9076 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
9077 or one of its enclosing classes, and that type is a template,
9078 return the associated TEMPLATE_DECL. Otherwise, the original
9081 Also handle the case when DECL is a TREE_LIST of ambiguous
9082 injected-class-names from different bases. */
9085 maybe_get_template_decl_from_type_decl (tree decl
)
9087 if (decl
== NULL_TREE
)
9090 /* DR 176: A lookup that finds an injected-class-name (10.2
9091 [class.member.lookup]) can result in an ambiguity in certain cases
9092 (for example, if it is found in more than one base class). If all of
9093 the injected-class-names that are found refer to specializations of
9094 the same class template, and if the name is followed by a
9095 template-argument-list, the reference refers to the class template
9096 itself and not a specialization thereof, and is not ambiguous. */
9097 if (TREE_CODE (decl
) == TREE_LIST
)
9099 tree t
, tmpl
= NULL_TREE
;
9100 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
9102 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
9105 else if (tmpl
!= elt
)
9108 if (tmpl
&& t
== NULL_TREE
)
9114 return (decl
!= NULL_TREE
9115 && DECL_SELF_REFERENCE_P (decl
)
9116 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
9117 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
9120 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
9121 parameters, find the desired type.
9123 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
9125 IN_DECL, if non-NULL, is the template declaration we are trying to
9128 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
9129 the class we are looking up.
9131 Issue error and warning messages under control of COMPLAIN.
9133 If the template class is really a local class in a template
9134 function, then the FUNCTION_CONTEXT is the function in which it is
9137 ??? Note that this function is currently called *twice* for each
9138 template-id: the first time from the parser, while creating the
9139 incomplete type (finish_template_type), and the second type during the
9140 real instantiation (instantiate_template_class). This is surely something
9141 that we want to avoid. It also causes some problems with argument
9142 coercion (see convert_nontype_argument for more information on this). */
9145 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
9146 int entering_scope
, tsubst_flags_t complain
)
9148 tree templ
= NULL_TREE
, parmlist
;
9155 if (identifier_p (d1
))
9157 tree value
= innermost_non_namespace_value (d1
);
9158 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
9163 push_decl_namespace (context
);
9164 templ
= lookup_name (d1
);
9165 templ
= maybe_get_template_decl_from_type_decl (templ
);
9167 pop_decl_namespace ();
9170 context
= DECL_CONTEXT (templ
);
9172 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
9174 tree type
= TREE_TYPE (d1
);
9176 /* If we are declaring a constructor, say A<T>::A<T>, we will get
9177 an implicit typename for the second A. Deal with it. */
9178 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
9179 type
= TREE_TYPE (type
);
9181 if (CLASSTYPE_TEMPLATE_INFO (type
))
9183 templ
= CLASSTYPE_TI_TEMPLATE (type
);
9184 d1
= DECL_NAME (templ
);
9187 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
9188 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
9190 templ
= TYPE_TI_TEMPLATE (d1
);
9191 d1
= DECL_NAME (templ
);
9193 else if (DECL_TYPE_TEMPLATE_P (d1
))
9196 d1
= DECL_NAME (templ
);
9197 context
= DECL_CONTEXT (templ
);
9199 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
9202 d1
= DECL_NAME (templ
);
9205 /* Issue an error message if we didn't find a template. */
9208 if (complain
& tf_error
)
9209 error ("%qT is not a template", d1
);
9210 return error_mark_node
;
9213 if (TREE_CODE (templ
) != TEMPLATE_DECL
9214 /* Make sure it's a user visible template, if it was named by
9216 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
9217 && !PRIMARY_TEMPLATE_P (templ
)))
9219 if (complain
& tf_error
)
9221 error ("non-template type %qT used as a template", d1
);
9223 error ("for template declaration %q+D", in_decl
);
9225 return error_mark_node
;
9228 complain
&= ~tf_user
;
9230 /* An alias that just changes the name of a template is equivalent to the
9231 other template, so if any of the arguments are pack expansions, strip
9232 the alias to avoid problems with a pack expansion passed to a non-pack
9233 alias template parameter (DR 1430). */
9234 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
9235 templ
= get_underlying_template (templ
);
9237 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
9240 tree arglist2
= coerce_template_args_for_ttp (templ
, arglist
, complain
);
9241 if (arglist2
== error_mark_node
9242 || (!uses_template_parms (arglist2
)
9243 && check_instantiated_args (templ
, arglist2
, complain
)))
9244 return error_mark_node
;
9246 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
9251 tree template_type
= TREE_TYPE (templ
);
9254 tree found
= NULL_TREE
;
9257 int is_dependent_type
;
9258 int use_partial_inst_tmpl
= false;
9260 if (template_type
== error_mark_node
)
9261 /* An error occurred while building the template TEMPL, and a
9262 diagnostic has most certainly been emitted for that
9263 already. Let's propagate that error. */
9264 return error_mark_node
;
9266 gen_tmpl
= most_general_template (templ
);
9267 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
9268 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
9269 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
9271 if (arg_depth
== 1 && parm_depth
> 1)
9273 /* We've been given an incomplete set of template arguments.
9276 template <class T> struct S1 {
9277 template <class U> struct S2 {};
9278 template <class U> struct S2<U*> {};
9281 we will be called with an ARGLIST of `U*', but the
9282 TEMPLATE will be `template <class T> template
9283 <class U> struct S1<T>::S2'. We must fill in the missing
9285 tree ti
= TYPE_TEMPLATE_INFO_MAYBE_ALIAS (TREE_TYPE (templ
));
9286 arglist
= add_outermost_template_args (TI_ARGS (ti
), arglist
);
9287 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
9290 /* Now we should have enough arguments. */
9291 gcc_assert (parm_depth
== arg_depth
);
9293 /* From here on, we're only interested in the most general
9296 /* Calculate the BOUND_ARGS. These will be the args that are
9297 actually tsubst'd into the definition to create the
9299 arglist
= coerce_innermost_template_parms (parmlist
, arglist
, gen_tmpl
,
9301 /*require_all_args=*/true,
9302 /*use_default_args=*/true);
9304 if (arglist
== error_mark_node
)
9305 /* We were unable to bind the arguments. */
9306 return error_mark_node
;
9308 /* In the scope of a template class, explicit references to the
9309 template class refer to the type of the template, not any
9310 instantiation of it. For example, in:
9312 template <class T> class C { void f(C<T>); }
9314 the `C<T>' is just the same as `C'. Outside of the
9315 class, however, such a reference is an instantiation. */
9317 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
9318 || currently_open_class (template_type
))
9320 tree tinfo
= TYPE_TEMPLATE_INFO (template_type
);
9322 if (tinfo
&& comp_template_args (TI_ARGS (tinfo
), arglist
))
9323 return template_type
;
9326 /* If we already have this specialization, return it. */
9327 elt
.tmpl
= gen_tmpl
;
9329 elt
.spec
= NULL_TREE
;
9330 hash
= spec_hasher::hash (&elt
);
9331 entry
= type_specializations
->find_with_hash (&elt
, hash
);
9336 /* If the the template's constraints are not satisfied,
9337 then we cannot form a valid type.
9339 Note that the check is deferred until after the hash
9340 lookup. This prevents redundant checks on previously
9341 instantiated specializations. */
9342 if (flag_concepts
&& !constraints_satisfied_p (gen_tmpl
, arglist
))
9344 if (complain
& tf_error
)
9346 error ("template constraint failure");
9347 diagnose_constraints (input_location
, gen_tmpl
, arglist
);
9349 return error_mark_node
;
9352 is_dependent_type
= uses_template_parms (arglist
);
9354 /* If the deduced arguments are invalid, then the binding
9356 if (!is_dependent_type
9357 && check_instantiated_args (gen_tmpl
,
9358 INNERMOST_TEMPLATE_ARGS (arglist
),
9360 return error_mark_node
;
9362 if (!is_dependent_type
9363 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
9364 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
9365 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
9367 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
9368 DECL_NAME (gen_tmpl
),
9369 /*tag_scope=*/ts_global
);
9373 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
9375 if (context
== error_mark_node
)
9376 return error_mark_node
;
9379 context
= global_namespace
;
9381 /* Create the type. */
9382 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
9384 /* The user referred to a specialization of an alias
9385 template represented by GEN_TMPL.
9387 [temp.alias]/2 says:
9389 When a template-id refers to the specialization of an
9390 alias template, it is equivalent to the associated
9391 type obtained by substitution of its
9392 template-arguments for the template-parameters in the
9393 type-id of the alias template. */
9395 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
9396 /* Note that the call above (by indirectly calling
9397 register_specialization in tsubst_decl) registers the
9398 TYPE_DECL representing the specialization of the alias
9399 template. So next time someone substitutes ARGLIST for
9400 the template parms into the alias template (GEN_TMPL),
9401 she'll get that TYPE_DECL back. */
9403 if (t
== error_mark_node
)
9406 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
9408 if (!is_dependent_type
)
9410 set_current_access_from_decl (TYPE_NAME (template_type
));
9411 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
9412 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
9413 arglist
, complain
, in_decl
),
9414 tsubst_attributes (TYPE_ATTRIBUTES (template_type
),
9415 arglist
, complain
, in_decl
),
9416 SCOPED_ENUM_P (template_type
), NULL
);
9418 if (t
== error_mark_node
)
9423 /* We don't want to call start_enum for this type, since
9424 the values for the enumeration constants may involve
9425 template parameters. And, no one should be interested
9426 in the enumeration constants for such a type. */
9427 t
= cxx_make_type (ENUMERAL_TYPE
);
9428 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
9430 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
9431 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
9432 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
9434 else if (CLASS_TYPE_P (template_type
))
9436 /* Lambda closures are regenerated in tsubst_lambda_expr, not
9437 instantiated here. */
9438 gcc_assert (!LAMBDA_TYPE_P (template_type
));
9440 t
= make_class_type (TREE_CODE (template_type
));
9441 CLASSTYPE_DECLARED_CLASS (t
)
9442 = CLASSTYPE_DECLARED_CLASS (template_type
);
9443 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
9445 /* A local class. Make sure the decl gets registered properly. */
9446 if (context
== current_function_decl
)
9447 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
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
));
9830 case UNDERLYING_TYPE
:
9831 if (pfd
->include_nondeduced_p
9832 && for_each_template_parm (TYPE_VALUES_RAW (t
), fn
, data
,
9834 pfd
->include_nondeduced_p
,
9836 return error_mark_node
;
9841 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
9842 WALK_SUBTREE (DECL_TI_ARGS (t
));
9847 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
))
9848 WALK_SUBTREE (DECL_INITIAL (t
));
9849 if (DECL_CONTEXT (t
)
9850 && pfd
->include_nondeduced_p
)
9851 WALK_SUBTREE (DECL_CONTEXT (t
));
9854 case BOUND_TEMPLATE_TEMPLATE_PARM
:
9855 /* Record template parameters such as `T' inside `TT<T>'. */
9856 WALK_SUBTREE (TYPE_TI_ARGS (t
));
9859 case TEMPLATE_TEMPLATE_PARM
:
9860 case TEMPLATE_TYPE_PARM
:
9861 case TEMPLATE_PARM_INDEX
:
9862 if (fn
&& (*fn
)(t
, data
))
9869 /* A template template parameter is encountered. */
9870 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
9871 WALK_SUBTREE (TREE_TYPE (t
));
9873 /* Already substituted template template parameter */
9878 /* A template-id in a TYPENAME_TYPE might be a deduced context after
9879 partial instantiation. */
9880 WALK_SUBTREE (TYPENAME_TYPE_FULLNAME (t
));
9884 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
9885 && pfd
->include_nondeduced_p
)
9886 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (t
)));
9891 /* If there's no type, then this thing must be some expression
9892 involving template parameters. */
9893 if (!fn
&& !TREE_TYPE (t
))
9894 return error_mark_node
;
9899 case IMPLICIT_CONV_EXPR
:
9900 case REINTERPRET_CAST_EXPR
:
9901 case CONST_CAST_EXPR
:
9902 case STATIC_CAST_EXPR
:
9903 case DYNAMIC_CAST_EXPR
:
9907 case PSEUDO_DTOR_EXPR
:
9909 return error_mark_node
;
9918 /* We didn't find any template parameters we liked. */
9923 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
9924 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
9925 call FN with the parameter and the DATA.
9926 If FN returns nonzero, the iteration is terminated, and
9927 for_each_template_parm returns 1. Otherwise, the iteration
9928 continues. If FN never returns a nonzero value, the value
9929 returned by for_each_template_parm is 0. If FN is NULL, it is
9930 considered to be the function which always returns 1.
9932 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
9933 parameters that occur in non-deduced contexts. When false, only
9934 visits those template parameters that can be deduced. */
9937 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
9938 hash_set
<tree
> *visited
,
9939 bool include_nondeduced_p
,
9942 struct pair_fn_data pfd
;
9947 pfd
.any_fn
= any_fn
;
9949 pfd
.include_nondeduced_p
= include_nondeduced_p
;
9951 /* Walk the tree. (Conceptually, we would like to walk without
9952 duplicates, but for_each_template_parm_r recursively calls
9953 for_each_template_parm, so we would need to reorganize a fair
9954 bit to use walk_tree_without_duplicates, so we keep our own
9957 pfd
.visited
= visited
;
9959 pfd
.visited
= new hash_set
<tree
>;
9960 result
= cp_walk_tree (&t
,
9961 for_each_template_parm_r
,
9975 /* Returns true if T depends on any template parameter. */
9978 uses_template_parms (tree t
)
9984 int saved_processing_template_decl
;
9986 saved_processing_template_decl
= processing_template_decl
;
9987 if (!saved_processing_template_decl
)
9988 processing_template_decl
= 1;
9990 dependent_p
= dependent_type_p (t
);
9991 else if (TREE_CODE (t
) == TREE_VEC
)
9992 dependent_p
= any_dependent_template_arguments_p (t
);
9993 else if (TREE_CODE (t
) == TREE_LIST
)
9994 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
9995 || uses_template_parms (TREE_CHAIN (t
)));
9996 else if (TREE_CODE (t
) == TYPE_DECL
)
9997 dependent_p
= dependent_type_p (TREE_TYPE (t
));
10000 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
10001 || TREE_CODE (t
) == OVERLOAD
10003 || identifier_p (t
)
10004 || TREE_CODE (t
) == TRAIT_EXPR
10005 || TREE_CODE (t
) == CONSTRUCTOR
10006 || CONSTANT_CLASS_P (t
))
10007 dependent_p
= (type_dependent_expression_p (t
)
10008 || value_dependent_expression_p (t
));
10011 gcc_assert (t
== error_mark_node
);
10012 dependent_p
= false;
10015 processing_template_decl
= saved_processing_template_decl
;
10017 return dependent_p
;
10020 /* Returns true iff current_function_decl is an incompletely instantiated
10021 template. Useful instead of processing_template_decl because the latter
10022 is set to 0 during instantiate_non_dependent_expr. */
10025 in_template_function (void)
10027 tree fn
= current_function_decl
;
10029 ++processing_template_decl
;
10030 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
10031 && DECL_TEMPLATE_INFO (fn
)
10032 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
10033 --processing_template_decl
;
10037 /* Returns true if T depends on any template parameter with level LEVEL. */
10040 uses_template_parms_level (tree t
, int level
)
10042 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
10043 /*include_nondeduced_p=*/true);
10046 /* Returns true if the signature of DECL depends on any template parameter from
10047 its enclosing class. */
10050 uses_outer_template_parms (tree decl
)
10052 int depth
= template_class_depth (CP_DECL_CONTEXT (decl
));
10055 if (for_each_template_parm (TREE_TYPE (decl
), template_parm_outer_level
,
10056 &depth
, NULL
, /*include_nondeduced_p=*/true))
10058 if (PRIMARY_TEMPLATE_P (decl
)
10059 && for_each_template_parm (INNERMOST_TEMPLATE_PARMS
10060 (DECL_TEMPLATE_PARMS (decl
)),
10061 template_parm_outer_level
,
10062 &depth
, NULL
, /*include_nondeduced_p=*/true))
10064 tree ci
= get_constraints (decl
);
10066 ci
= CI_ASSOCIATED_CONSTRAINTS (ci
);
10067 if (ci
&& for_each_template_parm (ci
, template_parm_outer_level
,
10068 &depth
, NULL
, /*nondeduced*/true))
10073 /* Returns TRUE iff INST is an instantiation we don't need to do in an
10074 ill-formed translation unit, i.e. a variable or function that isn't
10075 usable in a constant expression. */
10078 neglectable_inst_p (tree d
)
10080 return (d
&& DECL_P (d
)
10081 && !undeduced_auto_decl (d
)
10082 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
10083 : decl_maybe_constant_var_p (d
)));
10086 /* Returns TRUE iff we should refuse to instantiate DECL because it's
10087 neglectable and instantiated from within an erroneous instantiation. */
10090 limit_bad_template_recursion (tree decl
)
10092 struct tinst_level
*lev
= current_tinst_level
;
10093 int errs
= errorcount
+ sorrycount
;
10094 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
10097 for (; lev
; lev
= lev
->next
)
10098 if (neglectable_inst_p (lev
->maybe_get_node ()))
10101 return (lev
&& errs
> lev
->errors
);
10104 static int tinst_depth
;
10105 extern int max_tinst_depth
;
10108 static GTY(()) struct tinst_level
*last_error_tinst_level
;
10110 /* We're starting to instantiate D; record the template instantiation context
10111 at LOC for diagnostics and to restore it later. */
10114 push_tinst_level_loc (tree tldcl
, tree targs
, location_t loc
)
10116 struct tinst_level
*new_level
;
10118 if (tinst_depth
>= max_tinst_depth
)
10120 /* Tell error.c not to try to instantiate any templates. */
10122 fatal_error (input_location
,
10123 "template instantiation depth exceeds maximum of %d"
10124 " (use -ftemplate-depth= to increase the maximum)",
10129 /* If the current instantiation caused problems, don't let it instantiate
10130 anything else. Do allow deduction substitution and decls usable in
10131 constant expressions. */
10132 if (!targs
&& limit_bad_template_recursion (tldcl
))
10135 /* When not -quiet, dump template instantiations other than functions, since
10136 announce_function will take care of those. */
10137 if (!quiet_flag
&& !targs
10138 && TREE_CODE (tldcl
) != TREE_LIST
10139 && TREE_CODE (tldcl
) != FUNCTION_DECL
)
10140 fprintf (stderr
, " %s", decl_as_string (tldcl
, TFF_DECL_SPECIFIERS
));
10142 new_level
= tinst_level_freelist ().alloc ();
10143 new_level
->tldcl
= tldcl
;
10144 new_level
->targs
= targs
;
10145 new_level
->locus
= loc
;
10146 new_level
->errors
= errorcount
+sorrycount
;
10147 new_level
->in_system_header_p
= in_system_header_at (input_location
);
10148 new_level
->next
= NULL
;
10149 new_level
->refcount
= 0;
10150 set_refcount_ptr (new_level
->next
, current_tinst_level
);
10151 set_refcount_ptr (current_tinst_level
, new_level
);
10154 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
10155 depth_reached
= tinst_depth
;
10160 /* We're starting substitution of TMPL<ARGS>; record the template
10161 substitution context for diagnostics and to restore it later. */
10164 push_tinst_level (tree tmpl
, tree args
)
10166 return push_tinst_level_loc (tmpl
, args
, input_location
);
10169 /* We're starting to instantiate D; record INPUT_LOCATION and the
10170 template instantiation context for diagnostics and to restore it
10174 push_tinst_level (tree d
)
10176 return push_tinst_level_loc (d
, input_location
);
10179 /* Likewise, but record LOC as the program location. */
10182 push_tinst_level_loc (tree d
, location_t loc
)
10184 gcc_assert (TREE_CODE (d
) != TREE_LIST
);
10185 return push_tinst_level_loc (d
, NULL
, loc
);
10188 /* We're done instantiating this template; return to the instantiation
10192 pop_tinst_level (void)
10194 /* Restore the filename and line number stashed away when we started
10195 this instantiation. */
10196 input_location
= current_tinst_level
->locus
;
10197 set_refcount_ptr (current_tinst_level
, current_tinst_level
->next
);
10201 /* We're instantiating a deferred template; restore the template
10202 instantiation context in which the instantiation was requested, which
10203 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
10206 reopen_tinst_level (struct tinst_level
*level
)
10208 struct tinst_level
*t
;
10211 for (t
= level
; t
; t
= t
->next
)
10214 set_refcount_ptr (current_tinst_level
, level
);
10215 pop_tinst_level ();
10216 if (current_tinst_level
)
10217 current_tinst_level
->errors
= errorcount
+sorrycount
;
10218 return level
->maybe_get_node ();
10221 /* Returns the TINST_LEVEL which gives the original instantiation
10224 struct tinst_level
*
10225 outermost_tinst_level (void)
10227 struct tinst_level
*level
= current_tinst_level
;
10229 while (level
->next
)
10230 level
= level
->next
;
10234 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
10235 vector of template arguments, as for tsubst.
10237 Returns an appropriate tsubst'd friend declaration. */
10240 tsubst_friend_function (tree decl
, tree args
)
10244 if (TREE_CODE (decl
) == FUNCTION_DECL
10245 && DECL_TEMPLATE_INSTANTIATION (decl
)
10246 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
10247 /* This was a friend declared with an explicit template
10248 argument list, e.g.:
10250 friend void f<>(T);
10252 to indicate that f was a template instantiation, not a new
10253 function declaration. Now, we have to figure out what
10254 instantiation of what template. */
10256 tree template_id
, arglist
, fns
;
10259 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
10261 /* Friend functions are looked up in the containing namespace scope.
10262 We must enter that scope, to avoid finding member functions of the
10263 current class with same name. */
10264 push_nested_namespace (ns
);
10265 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
10266 tf_warning_or_error
, NULL_TREE
,
10267 /*integral_constant_expression_p=*/false);
10268 pop_nested_namespace (ns
);
10269 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
10270 tf_warning_or_error
, NULL_TREE
);
10271 template_id
= lookup_template_function (fns
, arglist
);
10273 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
10274 tmpl
= determine_specialization (template_id
, new_friend
,
10276 /*need_member_template=*/0,
10277 TREE_VEC_LENGTH (args
),
10279 return instantiate_template (tmpl
, new_args
, tf_error
);
10282 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
10284 /* The NEW_FRIEND will look like an instantiation, to the
10285 compiler, but is not an instantiation from the point of view of
10286 the language. For example, we might have had:
10288 template <class T> struct S {
10289 template <class U> friend void f(T, U);
10292 Then, in S<int>, template <class U> void f(int, U) is not an
10293 instantiation of anything. */
10294 if (new_friend
== error_mark_node
)
10295 return error_mark_node
;
10297 DECL_USE_TEMPLATE (new_friend
) = 0;
10298 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
10300 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
10301 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
10302 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
10305 /* The mangled name for the NEW_FRIEND is incorrect. The function
10306 is not a template instantiation and should not be mangled like
10307 one. Therefore, we forget the mangling here; we'll recompute it
10308 later if we need it. */
10309 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
10311 SET_DECL_RTL (new_friend
, NULL
);
10312 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
10315 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
10318 tree new_friend_template_info
;
10319 tree new_friend_result_template_info
;
10321 int new_friend_is_defn
;
10323 /* We must save some information from NEW_FRIEND before calling
10324 duplicate decls since that function will free NEW_FRIEND if
10326 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
10327 new_friend_is_defn
=
10328 (DECL_INITIAL (DECL_TEMPLATE_RESULT
10329 (template_for_substitution (new_friend
)))
10331 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
10333 /* This declaration is a `primary' template. */
10334 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
10336 new_friend_result_template_info
10337 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
10340 new_friend_result_template_info
= NULL_TREE
;
10342 /* Inside pushdecl_namespace_level, we will push into the
10343 current namespace. However, the friend function should go
10344 into the namespace of the template. */
10345 ns
= decl_namespace_context (new_friend
);
10346 push_nested_namespace (ns
);
10347 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
10348 pop_nested_namespace (ns
);
10350 if (old_decl
== error_mark_node
)
10351 return error_mark_node
;
10353 if (old_decl
!= new_friend
)
10355 /* This new friend declaration matched an existing
10356 declaration. For example, given:
10358 template <class T> void f(T);
10359 template <class U> class C {
10360 template <class T> friend void f(T) {}
10363 the friend declaration actually provides the definition
10364 of `f', once C has been instantiated for some type. So,
10365 old_decl will be the out-of-class template declaration,
10366 while new_friend is the in-class definition.
10368 But, if `f' was called before this point, the
10369 instantiation of `f' will have DECL_TI_ARGS corresponding
10370 to `T' but not to `U', references to which might appear
10371 in the definition of `f'. Previously, the most general
10372 template for an instantiation of `f' was the out-of-class
10373 version; now it is the in-class version. Therefore, we
10374 run through all specialization of `f', adding to their
10375 DECL_TI_ARGS appropriately. In particular, they need a
10376 new set of outer arguments, corresponding to the
10377 arguments for this class instantiation.
10379 The same situation can arise with something like this:
10381 friend void f(int);
10382 template <class T> class C {
10383 friend void f(T) {}
10386 when `C<int>' is instantiated. Now, `f(int)' is defined
10389 if (!new_friend_is_defn
)
10390 /* On the other hand, if the in-class declaration does
10391 *not* provide a definition, then we don't want to alter
10392 existing definitions. We can just leave everything
10397 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
10398 tree new_args
= TI_ARGS (new_friend_template_info
);
10400 /* Overwrite whatever template info was there before, if
10401 any, with the new template information pertaining to
10402 the declaration. */
10403 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
10405 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
10407 /* We should have called reregister_specialization in
10408 duplicate_decls. */
10409 gcc_assert (retrieve_specialization (new_template
,
10413 /* Instantiate it if the global has already been used. */
10414 if (DECL_ODR_USED (old_decl
))
10415 instantiate_decl (old_decl
, /*defer_ok=*/true,
10416 /*expl_inst_class_mem_p=*/false);
10422 /* Indicate that the old function template is a partial
10424 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
10425 = new_friend_result_template_info
;
10427 gcc_assert (new_template
10428 == most_general_template (new_template
));
10429 gcc_assert (new_template
!= old_decl
);
10431 /* Reassign any specializations already in the hash table
10432 to the new more general template, and add the
10433 additional template args. */
10434 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
10436 t
= TREE_CHAIN (t
))
10438 tree spec
= TREE_VALUE (t
);
10441 elt
.tmpl
= old_decl
;
10442 elt
.args
= DECL_TI_ARGS (spec
);
10443 elt
.spec
= NULL_TREE
;
10445 decl_specializations
->remove_elt (&elt
);
10447 DECL_TI_ARGS (spec
)
10448 = add_outermost_template_args (new_args
,
10449 DECL_TI_ARGS (spec
));
10451 register_specialization
10452 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
10455 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
10459 /* The information from NEW_FRIEND has been merged into OLD_DECL
10460 by duplicate_decls. */
10461 new_friend
= old_decl
;
10466 tree context
= DECL_CONTEXT (new_friend
);
10470 template <class T> class C {
10471 template <class U> friend void C1<U>::f (); // case 1
10472 friend void C2<T>::f (); // case 2
10474 we only need to make sure CONTEXT is a complete type for
10475 case 2. To distinguish between the two cases, we note that
10476 CONTEXT of case 1 remains dependent type after tsubst while
10477 this isn't true for case 2. */
10478 ++processing_template_decl
;
10479 dependent_p
= dependent_type_p (context
);
10480 --processing_template_decl
;
10483 && !complete_type_or_else (context
, NULL_TREE
))
10484 return error_mark_node
;
10486 if (COMPLETE_TYPE_P (context
))
10488 tree fn
= new_friend
;
10489 /* do_friend adds the TEMPLATE_DECL for any member friend
10490 template even if it isn't a member template, i.e.
10491 template <class T> friend A<T>::f();
10492 Look through it in that case. */
10493 if (TREE_CODE (fn
) == TEMPLATE_DECL
10494 && !PRIMARY_TEMPLATE_P (fn
))
10495 fn
= DECL_TEMPLATE_RESULT (fn
);
10496 /* Check to see that the declaration is really present, and,
10497 possibly obtain an improved declaration. */
10498 fn
= check_classfn (context
, fn
, NULL_TREE
);
10508 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
10509 template arguments, as for tsubst.
10511 Returns an appropriate tsubst'd friend type or error_mark_node on
10515 tsubst_friend_class (tree friend_tmpl
, tree args
)
10519 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
10521 tmpl
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
10522 return TREE_TYPE (tmpl
);
10525 tree context
= CP_DECL_CONTEXT (friend_tmpl
);
10526 if (TREE_CODE (context
) == NAMESPACE_DECL
)
10527 push_nested_namespace (context
);
10529 push_nested_class (context
);
10531 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), /*prefer_type=*/false,
10532 /*non_class=*/false, /*block_p=*/false,
10533 /*namespaces_only=*/false, LOOKUP_HIDDEN
);
10535 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
10537 /* The friend template has already been declared. Just
10538 check to see that the declarations match, and install any new
10539 default parameters. We must tsubst the default parameters,
10540 of course. We only need the innermost template parameters
10541 because that is all that redeclare_class_template will look
10543 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
10544 > TMPL_ARGS_DEPTH (args
))
10546 tree parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
10547 args
, tf_warning_or_error
);
10548 location_t saved_input_location
= input_location
;
10549 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
10550 tree cons
= get_constraints (tmpl
);
10551 redeclare_class_template (TREE_TYPE (tmpl
), parms
, cons
);
10552 input_location
= saved_input_location
;
10557 /* The friend template has not already been declared. In this
10558 case, the instantiation of the template class will cause the
10559 injection of this template into the namespace scope. */
10560 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
10562 if (tmpl
!= error_mark_node
)
10564 /* The new TMPL is not an instantiation of anything, so we
10565 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE
10566 for the new type because that is supposed to be the
10567 corresponding template decl, i.e., TMPL. */
10568 DECL_USE_TEMPLATE (tmpl
) = 0;
10569 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
10570 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
10571 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
10572 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
10574 /* It is hidden. */
10575 retrofit_lang_decl (DECL_TEMPLATE_RESULT (tmpl
));
10576 DECL_ANTICIPATED (tmpl
)
10577 = DECL_ANTICIPATED (DECL_TEMPLATE_RESULT (tmpl
)) = true;
10579 /* Inject this template into the enclosing namspace scope. */
10580 tmpl
= pushdecl_namespace_level (tmpl
, true);
10584 if (TREE_CODE (context
) == NAMESPACE_DECL
)
10585 pop_nested_namespace (context
);
10587 pop_nested_class ();
10589 return TREE_TYPE (tmpl
);
10592 /* Returns zero if TYPE cannot be completed later due to circularity.
10593 Otherwise returns one. */
10596 can_complete_type_without_circularity (tree type
)
10598 if (type
== NULL_TREE
|| type
== error_mark_node
)
10600 else if (COMPLETE_TYPE_P (type
))
10602 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10603 return can_complete_type_without_circularity (TREE_TYPE (type
));
10604 else if (CLASS_TYPE_P (type
)
10605 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
10611 static tree
tsubst_omp_clauses (tree
, enum c_omp_region_type
, tree
,
10612 tsubst_flags_t
, tree
);
10614 /* Instantiate a single dependent attribute T (a TREE_LIST), and return either
10615 T or a new TREE_LIST, possibly a chain in the case of a pack expansion. */
10618 tsubst_attribute (tree t
, tree
*decl_p
, tree args
,
10619 tsubst_flags_t complain
, tree in_decl
)
10621 gcc_assert (ATTR_IS_DEPENDENT (t
));
10623 tree val
= TREE_VALUE (t
);
10624 if (val
== NULL_TREE
)
10625 /* Nothing to do. */;
10626 else if ((flag_openmp
|| flag_openmp_simd
)
10627 && is_attribute_p ("omp declare simd",
10628 get_attribute_name (t
)))
10630 tree clauses
= TREE_VALUE (val
);
10631 clauses
= tsubst_omp_clauses (clauses
, C_ORT_OMP_DECLARE_SIMD
, args
,
10632 complain
, in_decl
);
10633 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
10634 clauses
= finish_omp_clauses (clauses
, C_ORT_OMP_DECLARE_SIMD
);
10635 tree parms
= DECL_ARGUMENTS (*decl_p
);
10637 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
10639 val
= build_tree_list (NULL_TREE
, clauses
);
10643 /* If the first attribute argument is an identifier, don't
10644 pass it through tsubst. Attributes like mode, format,
10645 cleanup and several target specific attributes expect it
10647 else if (attribute_takes_identifier_p (get_attribute_name (t
)))
10650 = tsubst_expr (TREE_CHAIN (val
), args
, complain
, in_decl
,
10651 /*integral_constant_expression_p=*/false);
10652 if (chain
!= TREE_CHAIN (val
))
10653 val
= tree_cons (NULL_TREE
, TREE_VALUE (val
), chain
);
10655 else if (PACK_EXPANSION_P (val
))
10657 /* An attribute pack expansion. */
10658 tree purp
= TREE_PURPOSE (t
);
10659 tree pack
= tsubst_pack_expansion (val
, args
, complain
, in_decl
);
10660 if (pack
== error_mark_node
)
10661 return error_mark_node
;
10662 int len
= TREE_VEC_LENGTH (pack
);
10663 tree list
= NULL_TREE
;
10665 for (int i
= 0; i
< len
; ++i
)
10667 tree elt
= TREE_VEC_ELT (pack
, i
);
10668 *q
= build_tree_list (purp
, elt
);
10669 q
= &TREE_CHAIN (*q
);
10674 val
= tsubst_expr (val
, args
, complain
, in_decl
,
10675 /*integral_constant_expression_p=*/false);
10677 if (val
!= TREE_VALUE (t
))
10678 return build_tree_list (TREE_PURPOSE (t
), val
);
10682 /* Instantiate any dependent attributes in ATTRIBUTES, returning either it
10683 unchanged or a new TREE_LIST chain. */
10686 tsubst_attributes (tree attributes
, tree args
,
10687 tsubst_flags_t complain
, tree in_decl
)
10689 tree last_dep
= NULL_TREE
;
10691 for (tree t
= attributes
; t
; t
= TREE_CHAIN (t
))
10692 if (ATTR_IS_DEPENDENT (t
))
10695 attributes
= copy_list (attributes
);
10700 for (tree
*p
= &attributes
; *p
; )
10703 if (ATTR_IS_DEPENDENT (t
))
10705 tree subst
= tsubst_attribute (t
, NULL
, args
, complain
, in_decl
);
10710 p
= &TREE_CHAIN (*p
);
10711 *p
= TREE_CHAIN (t
);
10715 p
= &TREE_CHAIN (*p
);
10721 /* Apply any attributes which had to be deferred until instantiation
10722 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
10723 ARGS, COMPLAIN, IN_DECL are as tsubst. */
10726 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
10727 tree args
, tsubst_flags_t complain
, tree in_decl
)
10729 tree last_dep
= NULL_TREE
;
10733 if (attributes
== NULL_TREE
)
10736 if (DECL_P (*decl_p
))
10738 if (TREE_TYPE (*decl_p
) == error_mark_node
)
10740 p
= &DECL_ATTRIBUTES (*decl_p
);
10741 /* DECL_ATTRIBUTES comes from copy_node in tsubst_decl, and is identical
10742 to our attributes parameter. */
10743 gcc_assert (*p
== attributes
);
10747 p
= &TYPE_ATTRIBUTES (*decl_p
);
10748 /* TYPE_ATTRIBUTES was set up (with abi_tag and may_alias) in
10749 lookup_template_class_1, and should be preserved. */
10750 gcc_assert (*p
!= attributes
);
10752 p
= &TREE_CHAIN (*p
);
10755 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
10756 if (ATTR_IS_DEPENDENT (t
))
10759 attributes
= copy_list (attributes
);
10766 tree late_attrs
= NULL_TREE
;
10767 tree
*q
= &late_attrs
;
10772 if (ATTR_IS_DEPENDENT (t
))
10774 *p
= TREE_CHAIN (t
);
10775 TREE_CHAIN (t
) = NULL_TREE
;
10776 *q
= tsubst_attribute (t
, decl_p
, args
, complain
, in_decl
);
10778 q
= &TREE_CHAIN (*q
);
10781 p
= &TREE_CHAIN (t
);
10784 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
10788 /* Perform (or defer) access check for typedefs that were referenced
10789 from within the template TMPL code.
10790 This is a subroutine of instantiate_decl and instantiate_class_template.
10791 TMPL is the template to consider and TARGS is the list of arguments of
10795 perform_typedefs_access_check (tree tmpl
, tree targs
)
10797 location_t saved_location
;
10799 qualified_typedef_usage_t
*iter
;
10802 || (!CLASS_TYPE_P (tmpl
)
10803 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
10806 saved_location
= input_location
;
10807 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
10809 tree type_decl
= iter
->typedef_decl
;
10810 tree type_scope
= iter
->context
;
10812 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
10815 if (uses_template_parms (type_decl
))
10816 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
10817 if (uses_template_parms (type_scope
))
10818 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
10820 /* Make access check error messages point to the location
10821 of the use of the typedef. */
10822 input_location
= iter
->locus
;
10823 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
10824 type_decl
, type_decl
,
10825 tf_warning_or_error
);
10827 input_location
= saved_location
;
10831 instantiate_class_template_1 (tree type
)
10833 tree templ
, args
, pattern
, t
, member
;
10837 unsigned int saved_maximum_field_alignment
;
10840 if (type
== error_mark_node
)
10841 return error_mark_node
;
10843 if (COMPLETE_OR_OPEN_TYPE_P (type
)
10844 || uses_template_parms (type
))
10847 /* Figure out which template is being instantiated. */
10848 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
10849 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
10851 /* Mark the type as in the process of being defined. */
10852 TYPE_BEING_DEFINED (type
) = 1;
10854 /* Determine what specialization of the original template to
10856 t
= most_specialized_partial_spec (type
, tf_warning_or_error
);
10857 if (t
== error_mark_node
)
10858 return error_mark_node
;
10861 /* This TYPE is actually an instantiation of a partial
10862 specialization. We replace the innermost set of ARGS with
10863 the arguments appropriate for substitution. For example,
10866 template <class T> struct S {};
10867 template <class T> struct S<T*> {};
10869 and supposing that we are instantiating S<int*>, ARGS will
10870 presently be {int*} -- but we need {int}. */
10871 pattern
= TREE_TYPE (t
);
10872 args
= TREE_PURPOSE (t
);
10876 pattern
= TREE_TYPE (templ
);
10877 args
= CLASSTYPE_TI_ARGS (type
);
10880 /* If the template we're instantiating is incomplete, then clearly
10881 there's nothing we can do. */
10882 if (!COMPLETE_TYPE_P (pattern
))
10884 /* We can try again later. */
10885 TYPE_BEING_DEFINED (type
) = 0;
10889 /* If we've recursively instantiated too many templates, stop. */
10890 if (! push_tinst_level (type
))
10893 /* We may be in the middle of deferred access check. Disable
10895 push_deferring_access_checks (dk_no_deferred
);
10897 int saved_unevaluated_operand
= cp_unevaluated_operand
;
10898 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
10900 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
10901 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
10902 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
10903 fn_context
= error_mark_node
;
10905 push_to_top_level ();
10908 cp_unevaluated_operand
= 0;
10909 c_inhibit_evaluation_warnings
= 0;
10911 /* Use #pragma pack from the template context. */
10912 saved_maximum_field_alignment
= maximum_field_alignment
;
10913 maximum_field_alignment
= TYPE_PRECISION (pattern
);
10915 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
10917 /* Set the input location to the most specialized template definition.
10918 This is needed if tsubsting causes an error. */
10919 typedecl
= TYPE_MAIN_DECL (pattern
);
10920 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
10921 DECL_SOURCE_LOCATION (typedecl
);
10923 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
10924 SET_TYPE_ALIGN (type
, TYPE_ALIGN (pattern
));
10925 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
10926 CLASSTYPE_NON_AGGREGATE (type
) = CLASSTYPE_NON_AGGREGATE (pattern
);
10927 if (ANON_AGGR_TYPE_P (pattern
))
10928 SET_ANON_AGGR_TYPE_P (type
);
10929 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
10931 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
10932 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
10933 /* Adjust visibility for template arguments. */
10934 determine_visibility (TYPE_MAIN_DECL (type
));
10936 if (CLASS_TYPE_P (type
))
10937 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
10939 pbinfo
= TYPE_BINFO (pattern
);
10941 /* We should never instantiate a nested class before its enclosing
10942 class; we need to look up the nested class by name before we can
10943 instantiate it, and that lookup should instantiate the enclosing
10945 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
10946 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
10948 base_list
= NULL_TREE
;
10949 if (BINFO_N_BASE_BINFOS (pbinfo
))
10955 /* We must enter the scope containing the type, as that is where
10956 the accessibility of types named in dependent bases are
10958 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
10960 /* Substitute into each of the bases to determine the actual
10962 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
10965 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
10966 tree expanded_bases
= NULL_TREE
;
10969 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
10972 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
10973 args
, tf_error
, NULL_TREE
);
10974 if (expanded_bases
== error_mark_node
)
10977 len
= TREE_VEC_LENGTH (expanded_bases
);
10980 for (idx
= 0; idx
< len
; idx
++)
10982 if (expanded_bases
)
10983 /* Extract the already-expanded base class. */
10984 base
= TREE_VEC_ELT (expanded_bases
, idx
);
10986 /* Substitute to figure out the base class. */
10987 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
10990 if (base
== error_mark_node
)
10993 base_list
= tree_cons (access
, base
, base_list
);
10994 if (BINFO_VIRTUAL_P (pbase_binfo
))
10995 TREE_TYPE (base_list
) = integer_type_node
;
10999 /* The list is now in reverse order; correct that. */
11000 base_list
= nreverse (base_list
);
11003 pop_scope (pushed_scope
);
11005 /* Now call xref_basetypes to set up all the base-class
11007 xref_basetypes (type
, base_list
);
11009 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
11010 (int) ATTR_FLAG_TYPE_IN_PLACE
,
11011 args
, tf_error
, NULL_TREE
);
11012 fixup_attribute_variants (type
);
11014 /* Now that our base classes are set up, enter the scope of the
11015 class, so that name lookups into base classes, etc. will work
11016 correctly. This is precisely analogous to what we do in
11017 begin_class_definition when defining an ordinary non-template
11018 class, except we also need to push the enclosing classes. */
11019 push_nested_class (type
);
11021 /* Now members are processed in the order of declaration. */
11022 for (member
= CLASSTYPE_DECL_LIST (pattern
);
11023 member
; member
= TREE_CHAIN (member
))
11025 tree t
= TREE_VALUE (member
);
11027 if (TREE_PURPOSE (member
))
11031 if (LAMBDA_TYPE_P (t
))
11032 /* A closure type for a lambda in an NSDMI or default argument.
11033 Ignore it; it will be regenerated when needed. */
11036 /* Build new CLASSTYPE_NESTED_UTDS. */
11039 bool class_template_p
;
11041 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
11042 && TYPE_LANG_SPECIFIC (t
)
11043 && CLASSTYPE_IS_TEMPLATE (t
));
11044 /* If the member is a class template, then -- even after
11045 substitution -- there may be dependent types in the
11046 template argument list for the class. We increment
11047 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
11048 that function will assume that no types are dependent
11049 when outside of a template. */
11050 if (class_template_p
)
11051 ++processing_template_decl
;
11052 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
11053 if (class_template_p
)
11054 --processing_template_decl
;
11055 if (newtag
== error_mark_node
)
11058 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
11060 tree name
= TYPE_IDENTIFIER (t
);
11062 if (class_template_p
)
11063 /* Unfortunately, lookup_template_class sets
11064 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
11065 instantiation (i.e., for the type of a member
11066 template class nested within a template class.)
11067 This behavior is required for
11068 maybe_process_partial_specialization to work
11069 correctly, but is not accurate in this case;
11070 the TAG is not an instantiation of anything.
11071 (The corresponding TEMPLATE_DECL is an
11072 instantiation, but the TYPE is not.) */
11073 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
11075 /* Now, we call pushtag to put this NEWTAG into the scope of
11076 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
11077 pushtag calling push_template_decl. We don't have to do
11078 this for enums because it will already have been done in
11081 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
11082 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
11085 else if (DECL_DECLARES_FUNCTION_P (t
))
11089 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11090 ++processing_template_decl
;
11091 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
11092 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11093 --processing_template_decl
;
11094 set_current_access_from_decl (r
);
11095 finish_member_declaration (r
);
11096 /* Instantiate members marked with attribute used. */
11097 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
11099 if (TREE_CODE (r
) == FUNCTION_DECL
11100 && DECL_OMP_DECLARE_REDUCTION_P (r
))
11101 cp_check_omp_declare_reduction (r
);
11103 else if ((DECL_CLASS_TEMPLATE_P (t
) || DECL_IMPLICIT_TYPEDEF_P (t
))
11104 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
11105 /* A closure type for a lambda in an NSDMI or default argument.
11106 Ignore it; it will be regenerated when needed. */;
11109 /* Build new TYPE_FIELDS. */
11110 if (TREE_CODE (t
) == STATIC_ASSERT
)
11114 ++c_inhibit_evaluation_warnings
;
11116 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
11117 tf_warning_or_error
, NULL_TREE
,
11118 /*integral_constant_expression_p=*/true);
11119 --c_inhibit_evaluation_warnings
;
11121 finish_static_assert (condition
,
11122 STATIC_ASSERT_MESSAGE (t
),
11123 STATIC_ASSERT_SOURCE_LOCATION (t
),
11124 /*member_p=*/true);
11126 else if (TREE_CODE (t
) != CONST_DECL
)
11129 tree vec
= NULL_TREE
;
11132 /* The file and line for this declaration, to
11133 assist in error message reporting. Since we
11134 called push_tinst_level above, we don't need to
11136 input_location
= DECL_SOURCE_LOCATION (t
);
11138 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11139 ++processing_template_decl
;
11140 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
11141 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11142 --processing_template_decl
;
11144 if (TREE_CODE (r
) == TREE_VEC
)
11146 /* A capture pack became multiple fields. */
11148 len
= TREE_VEC_LENGTH (vec
);
11151 for (int i
= 0; i
< len
; ++i
)
11154 r
= TREE_VEC_ELT (vec
, i
);
11159 [t]he initialization (and any associated
11160 side-effects) of a static data member does
11161 not occur unless the static data member is
11162 itself used in a way that requires the
11163 definition of the static data member to
11166 Therefore, we do not substitute into the
11167 initialized for the static data member here. */
11168 finish_static_data_member_decl
11170 /*init=*/NULL_TREE
,
11171 /*init_const_expr_p=*/false,
11172 /*asmspec_tree=*/NULL_TREE
,
11174 /* Instantiate members marked with attribute used. */
11175 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
11178 else if (TREE_CODE (r
) == FIELD_DECL
)
11180 /* Determine whether R has a valid type and can be
11181 completed later. If R is invalid, then its type
11182 is replaced by error_mark_node. */
11183 tree rtype
= TREE_TYPE (r
);
11184 if (can_complete_type_without_circularity (rtype
))
11185 complete_type (rtype
);
11187 if (!complete_or_array_type_p (rtype
))
11189 /* If R's type couldn't be completed and
11190 it isn't a flexible array member (whose
11191 type is incomplete by definition) give
11193 cxx_incomplete_type_error (r
, rtype
);
11194 TREE_TYPE (r
) = error_mark_node
;
11196 else if (TREE_CODE (rtype
) == ARRAY_TYPE
11197 && TYPE_DOMAIN (rtype
) == NULL_TREE
11198 && (TREE_CODE (type
) == UNION_TYPE
11199 || TREE_CODE (type
) == QUAL_UNION_TYPE
))
11201 error ("flexible array member %qD in union", r
);
11202 TREE_TYPE (r
) = error_mark_node
;
11206 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
11207 such a thing will already have been added to the field
11208 list by tsubst_enum in finish_member_declaration in the
11209 CLASSTYPE_NESTED_UTDS case above. */
11210 if (!(TREE_CODE (r
) == TYPE_DECL
11211 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
11212 && DECL_ARTIFICIAL (r
)))
11214 set_current_access_from_decl (r
);
11215 finish_member_declaration (r
);
11223 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
11224 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
11226 /* Build new CLASSTYPE_FRIEND_CLASSES. */
11228 tree friend_type
= t
;
11229 bool adjust_processing_template_decl
= false;
11231 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
11233 /* template <class T> friend class C; */
11234 friend_type
= tsubst_friend_class (friend_type
, args
);
11235 adjust_processing_template_decl
= true;
11237 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
11239 /* template <class T> friend class C::D; */
11240 friend_type
= tsubst (friend_type
, args
,
11241 tf_warning_or_error
, NULL_TREE
);
11242 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
11243 friend_type
= TREE_TYPE (friend_type
);
11244 adjust_processing_template_decl
= true;
11246 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
11247 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
11249 /* This could be either
11253 when dependent_type_p is false or
11255 template <class U> friend class T::C;
11258 /* Bump processing_template_decl in case this is something like
11259 template <class T> friend struct A<T>::B. */
11260 ++processing_template_decl
;
11261 friend_type
= tsubst (friend_type
, args
,
11262 tf_warning_or_error
, NULL_TREE
);
11263 if (dependent_type_p (friend_type
))
11264 adjust_processing_template_decl
= true;
11265 --processing_template_decl
;
11267 else if (TREE_CODE (friend_type
) != BOUND_TEMPLATE_TEMPLATE_PARM
11268 && !CLASSTYPE_USE_TEMPLATE (friend_type
)
11269 && TYPE_HIDDEN_P (friend_type
))
11273 where C hasn't been declared yet. Let's lookup name
11274 from namespace scope directly, bypassing any name that
11275 come from dependent base class. */
11276 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
11278 /* The call to xref_tag_from_type does injection for friend
11280 push_nested_namespace (ns
);
11282 xref_tag_from_type (friend_type
, NULL_TREE
,
11283 /*tag_scope=*/ts_current
);
11284 pop_nested_namespace (ns
);
11286 else if (uses_template_parms (friend_type
))
11287 /* friend class C<T>; */
11288 friend_type
= tsubst (friend_type
, args
,
11289 tf_warning_or_error
, NULL_TREE
);
11294 where C is already declared or
11296 friend class C<int>;
11298 We don't have to do anything in these cases. */
11300 if (adjust_processing_template_decl
)
11301 /* Trick make_friend_class into realizing that the friend
11302 we're adding is a template, not an ordinary class. It's
11303 important that we use make_friend_class since it will
11304 perform some error-checking and output cross-reference
11306 ++processing_template_decl
;
11308 if (friend_type
!= error_mark_node
)
11309 make_friend_class (type
, friend_type
, /*complain=*/false);
11311 if (adjust_processing_template_decl
)
11312 --processing_template_decl
;
11316 /* Build new DECL_FRIENDLIST. */
11319 /* The file and line for this declaration, to
11320 assist in error message reporting. Since we
11321 called push_tinst_level above, we don't need to
11323 input_location
= DECL_SOURCE_LOCATION (t
);
11325 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11327 ++processing_template_decl
;
11328 push_deferring_access_checks (dk_no_check
);
11331 r
= tsubst_friend_function (t
, args
);
11332 add_friend (type
, r
, /*complain=*/false);
11333 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11335 pop_deferring_access_checks ();
11336 --processing_template_decl
;
11344 /* Restore these before substituting into the lambda capture
11346 cp_unevaluated_operand
= saved_unevaluated_operand
;
11347 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
11350 /* Set the file and line number information to whatever is given for
11351 the class itself. This puts error messages involving generated
11352 implicit functions at a predictable point, and the same point
11353 that would be used for non-template classes. */
11354 input_location
= DECL_SOURCE_LOCATION (typedecl
);
11356 unreverse_member_declarations (type
);
11357 finish_struct_1 (type
);
11358 TYPE_BEING_DEFINED (type
) = 0;
11360 /* We don't instantiate default arguments for member functions. 14.7.1:
11362 The implicit instantiation of a class template specialization causes
11363 the implicit instantiation of the declarations, but not of the
11364 definitions or default arguments, of the class member functions,
11365 member classes, static data members and member templates.... */
11367 /* Some typedefs referenced from within the template code need to be access
11368 checked at template instantiation time, i.e now. These types were
11369 added to the template at parsing time. Let's get those and perform
11370 the access checks then. */
11371 perform_typedefs_access_check (pattern
, args
);
11372 perform_deferred_access_checks (tf_warning_or_error
);
11373 pop_nested_class ();
11374 maximum_field_alignment
= saved_maximum_field_alignment
;
11376 pop_from_top_level ();
11377 pop_deferring_access_checks ();
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 /* ??? Support use in other patterns. */
12072 gcc_assert (parm_pack
== pattern
);
12073 return expand_builtin_pack_call (parm_pack
, args
,
12074 complain
, in_decl
);
12076 else if (TREE_CODE (parm_pack
) == PARM_DECL
)
12078 /* We know we have correct local_specializations if this
12079 expansion is at function scope, or if we're dealing with a
12080 local parameter in a requires expression; for the latter,
12081 tsubst_requires_expr set it up appropriately. */
12082 if (PACK_EXPANSION_LOCAL_P (t
) || CONSTRAINT_VAR_P (parm_pack
))
12083 arg_pack
= retrieve_local_specialization (parm_pack
);
12085 /* We can't rely on local_specializations for a parameter
12086 name used later in a function declaration (such as in a
12087 late-specified return type). Even if it exists, it might
12088 have the wrong value for a recursive call. */
12089 need_local_specializations
= true;
12093 /* This parameter pack was used in an unevaluated context. Just
12094 make a dummy decl, since it's only used for its type. */
12095 ++cp_unevaluated_operand
;
12096 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
12097 --cp_unevaluated_operand
;
12098 if (arg_pack
&& DECL_PACK_P (arg_pack
))
12099 /* Partial instantiation of the parm_pack, we can't build
12100 up an argument pack yet. */
12101 arg_pack
= NULL_TREE
;
12103 arg_pack
= make_fnparm_pack (arg_pack
);
12105 else if (argument_pack_element_is_expansion_p (arg_pack
, 0))
12106 /* This argument pack isn't fully instantiated yet. We set this
12107 flag rather than clear arg_pack because we do want to do the
12108 optimization below, and we don't want to substitute directly
12109 into the pattern (as that would expose a NONTYPE_ARGUMENT_PACK
12110 where it isn't expected). */
12111 unsubstituted_fn_pack
= true;
12113 else if (is_normal_capture_proxy (parm_pack
))
12115 arg_pack
= retrieve_local_specialization (parm_pack
);
12116 if (argument_pack_element_is_expansion_p (arg_pack
, 0))
12117 unsubstituted_fn_pack
= true;
12122 template_parm_level_and_index (parm_pack
, &level
, &idx
);
12124 if (level
<= levels
)
12125 arg_pack
= TMPL_ARG (args
, level
, idx
);
12128 orig_arg
= arg_pack
;
12129 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
12130 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
12132 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
12133 /* This can only happen if we forget to expand an argument
12134 pack somewhere else. Just return an error, silently. */
12136 result
= make_tree_vec (1);
12137 TREE_VEC_ELT (result
, 0) = error_mark_node
;
12144 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
12146 /* Don't bother trying to do a partial substitution with
12147 incomplete packs; we'll try again after deduction. */
12148 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
12153 else if (len
!= my_len
12154 && !unsubstituted_fn_pack
)
12156 if (!(complain
& tf_error
))
12157 /* Fail quietly. */;
12158 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
12159 error ("mismatched argument pack lengths while expanding %qT",
12162 error ("mismatched argument pack lengths while expanding %qE",
12164 return error_mark_node
;
12167 /* Keep track of the parameter packs and their corresponding
12169 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
12170 TREE_TYPE (packs
) = orig_arg
;
12174 /* We can't substitute for this parameter pack. We use a flag as
12175 well as the missing_level counter because function parameter
12176 packs don't have a level. */
12177 gcc_assert (processing_template_decl
|| is_auto (parm_pack
));
12178 unsubstituted_packs
= true;
12182 /* If the expansion is just T..., return the matching argument pack, unless
12183 we need to call convert_from_reference on all the elements. This is an
12184 important optimization; see c++/68422. */
12185 if (!unsubstituted_packs
12186 && TREE_PURPOSE (packs
) == pattern
)
12188 tree args
= ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
12190 /* If the argument pack is a single pack expansion, pull it out. */
12191 if (TREE_VEC_LENGTH (args
) == 1
12192 && pack_expansion_args_count (args
))
12193 return TREE_VEC_ELT (args
, 0);
12195 /* Types need no adjustment, nor does sizeof..., and if we still have
12196 some pack expansion args we won't do anything yet. */
12197 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
12198 || PACK_EXPANSION_SIZEOF_P (t
)
12199 || pack_expansion_args_count (args
))
12201 /* Also optimize expression pack expansions if we can tell that the
12202 elements won't have reference type. */
12203 tree type
= TREE_TYPE (pattern
);
12204 if (type
&& TREE_CODE (type
) != REFERENCE_TYPE
12205 && !PACK_EXPANSION_P (type
)
12206 && !WILDCARD_TYPE_P (type
))
12208 /* Otherwise use the normal path so we get convert_from_reference. */
12211 /* We cannot expand this expansion expression, because we don't have
12212 all of the argument packs we need. */
12213 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
12215 /* We got some full packs, but we can't substitute them in until we
12216 have values for all the packs. So remember these until then. */
12218 t
= make_pack_expansion (pattern
, complain
);
12219 PACK_EXPANSION_EXTRA_ARGS (t
)
12220 = build_extra_args (pattern
, args
, complain
);
12223 else if (unsubstituted_packs
)
12225 /* There were no real arguments, we're just replacing a parameter
12226 pack with another version of itself. Substitute into the
12227 pattern and return a PACK_EXPANSION_*. The caller will need to
12229 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
12230 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
12231 /*integral_constant_expression_p=*/false);
12233 t
= tsubst (pattern
, args
, complain
, in_decl
);
12234 t
= make_pack_expansion (t
, complain
);
12238 gcc_assert (len
>= 0);
12240 if (need_local_specializations
)
12242 /* We're in a late-specified return type, so create our own local
12243 specializations map; the current map is either NULL or (in the
12244 case of recursive unification) might have bindings that we don't
12245 want to use or alter. */
12246 saved_local_specializations
= local_specializations
;
12247 local_specializations
= new hash_map
<tree
, tree
>;
12250 /* For each argument in each argument pack, substitute into the
12252 result
= make_tree_vec (len
);
12253 tree elem_args
= copy_template_args (args
);
12254 for (i
= 0; i
< len
; ++i
)
12256 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
12258 elem_args
, complain
,
12260 TREE_VEC_ELT (result
, i
) = t
;
12261 if (t
== error_mark_node
)
12263 result
= error_mark_node
;
12268 /* Update ARGS to restore the substitution from parameter packs to
12269 their argument packs. */
12270 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
12272 tree parm
= TREE_PURPOSE (pack
);
12274 if (TREE_CODE (parm
) == PARM_DECL
12276 || TREE_CODE (parm
) == FIELD_DECL
)
12277 register_local_specialization (TREE_TYPE (pack
), parm
);
12282 if (TREE_VALUE (pack
) == NULL_TREE
)
12285 template_parm_level_and_index (parm
, &level
, &idx
);
12287 /* Update the corresponding argument. */
12288 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
12289 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
12292 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
12296 if (need_local_specializations
)
12298 delete local_specializations
;
12299 local_specializations
= saved_local_specializations
;
12302 /* If the dependent pack arguments were such that we end up with only a
12303 single pack expansion again, there's no need to keep it in a TREE_VEC. */
12304 if (len
== 1 && TREE_CODE (result
) == TREE_VEC
12305 && PACK_EXPANSION_P (TREE_VEC_ELT (result
, 0)))
12306 return TREE_VEC_ELT (result
, 0);
12311 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
12312 TMPL. We do this using DECL_PARM_INDEX, which should work even with
12313 parameter packs; all parms generated from a function parameter pack will
12314 have the same DECL_PARM_INDEX. */
12317 get_pattern_parm (tree parm
, tree tmpl
)
12319 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
12322 if (DECL_ARTIFICIAL (parm
))
12324 for (patparm
= DECL_ARGUMENTS (pattern
);
12325 patparm
; patparm
= DECL_CHAIN (patparm
))
12326 if (DECL_ARTIFICIAL (patparm
)
12327 && DECL_NAME (parm
) == DECL_NAME (patparm
))
12332 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
12333 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
12334 gcc_assert (DECL_PARM_INDEX (patparm
)
12335 == DECL_PARM_INDEX (parm
));
12341 /* Make an argument pack out of the TREE_VEC VEC. */
12344 make_argument_pack (tree vec
)
12347 tree elt
= TREE_VEC_ELT (vec
, 0);
12349 pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
12352 pack
= make_node (NONTYPE_ARGUMENT_PACK
);
12353 TREE_CONSTANT (pack
) = 1;
12355 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
12359 /* Return an exact copy of template args T that can be modified
12363 copy_template_args (tree t
)
12365 if (t
== error_mark_node
)
12368 int len
= TREE_VEC_LENGTH (t
);
12369 tree new_vec
= make_tree_vec (len
);
12371 for (int i
= 0; i
< len
; ++i
)
12373 tree elt
= TREE_VEC_ELT (t
, i
);
12374 if (elt
&& TREE_CODE (elt
) == TREE_VEC
)
12375 elt
= copy_template_args (elt
);
12376 TREE_VEC_ELT (new_vec
, i
) = elt
;
12379 NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_vec
)
12380 = NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
);
12385 /* Substitute ARGS into the vector or list of template arguments T. */
12388 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12391 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
12394 if (t
== error_mark_node
)
12395 return error_mark_node
;
12397 len
= TREE_VEC_LENGTH (t
);
12398 elts
= XALLOCAVEC (tree
, len
);
12400 for (i
= 0; i
< len
; i
++)
12402 tree orig_arg
= TREE_VEC_ELT (t
, i
);
12405 if (TREE_CODE (orig_arg
) == TREE_VEC
)
12406 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
12407 else if (PACK_EXPANSION_P (orig_arg
))
12409 /* Substitute into an expansion expression. */
12410 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
12412 if (TREE_CODE (new_arg
) == TREE_VEC
)
12413 /* Add to the expanded length adjustment the number of
12414 expanded arguments. We subtract one from this
12415 measurement, because the argument pack expression
12416 itself is already counted as 1 in
12417 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
12418 the argument pack is empty. */
12419 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
12421 else if (ARGUMENT_PACK_P (orig_arg
))
12423 /* Substitute into each of the arguments. */
12424 new_arg
= TYPE_P (orig_arg
)
12425 ? cxx_make_type (TREE_CODE (orig_arg
))
12426 : make_node (TREE_CODE (orig_arg
));
12428 tree pack_args
= tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
12429 args
, complain
, in_decl
);
12430 if (pack_args
== error_mark_node
)
12431 new_arg
= error_mark_node
;
12433 SET_ARGUMENT_PACK_ARGS (new_arg
, pack_args
);
12435 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
)
12436 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
12439 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
12441 if (new_arg
== error_mark_node
)
12442 return error_mark_node
;
12445 if (new_arg
!= orig_arg
)
12452 /* Make space for the expanded arguments coming from template
12454 t
= make_tree_vec (len
+ expanded_len_adjust
);
12455 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
12456 arguments for a member template.
12457 In that case each TREE_VEC in ORIG_T represents a level of template
12458 arguments, and ORIG_T won't carry any non defaulted argument count.
12459 It will rather be the nested TREE_VECs that will carry one.
12460 In other words, ORIG_T carries a non defaulted argument count only
12461 if it doesn't contain any nested TREE_VEC. */
12462 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
12464 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
12465 count
+= expanded_len_adjust
;
12466 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
12468 for (i
= 0, out
= 0; i
< len
; i
++)
12470 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
12471 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
12472 && TREE_CODE (elts
[i
]) == TREE_VEC
)
12476 /* Now expand the template argument pack "in place". */
12477 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
12478 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
12482 TREE_VEC_ELT (t
, out
) = elts
[i
];
12490 /* Substitute ARGS into one level PARMS of template parameters. */
12493 tsubst_template_parms_level (tree parms
, tree args
, tsubst_flags_t complain
)
12495 if (parms
== error_mark_node
)
12496 return error_mark_node
;
12498 tree new_vec
= make_tree_vec (TREE_VEC_LENGTH (parms
));
12500 for (int i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
12502 tree tuple
= TREE_VEC_ELT (parms
, i
);
12504 if (tuple
== error_mark_node
)
12507 TREE_VEC_ELT (new_vec
, i
) =
12508 tsubst_template_parm (tuple
, args
, complain
);
12514 /* Return the result of substituting ARGS into the template parameters
12515 given by PARMS. If there are m levels of ARGS and m + n levels of
12516 PARMS, then the result will contain n levels of PARMS. For
12517 example, if PARMS is `template <class T> template <class U>
12518 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
12519 result will be `template <int*, double, class V>'. */
12522 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
12524 tree r
= NULL_TREE
;
12527 /* When substituting into a template, we must set
12528 PROCESSING_TEMPLATE_DECL as the template parameters may be
12529 dependent if they are based on one-another, and the dependency
12530 predicates are short-circuit outside of templates. */
12531 ++processing_template_decl
;
12533 for (new_parms
= &r
;
12534 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
12535 new_parms
= &(TREE_CHAIN (*new_parms
)),
12536 parms
= TREE_CHAIN (parms
))
12538 tree new_vec
= tsubst_template_parms_level (TREE_VALUE (parms
),
12541 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
12542 - TMPL_ARGS_DEPTH (args
)),
12543 new_vec
, NULL_TREE
);
12546 --processing_template_decl
;
12551 /* Return the result of substituting ARGS into one template parameter
12552 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
12553 parameter and which TREE_PURPOSE is the default argument of the
12554 template parameter. */
12557 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
12559 tree default_value
, parm_decl
;
12561 if (args
== NULL_TREE
12563 || t
== error_mark_node
)
12566 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
12568 default_value
= TREE_PURPOSE (t
);
12569 parm_decl
= TREE_VALUE (t
);
12571 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
12572 if (TREE_CODE (parm_decl
) == PARM_DECL
12573 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
12574 parm_decl
= error_mark_node
;
12575 default_value
= tsubst_template_arg (default_value
, args
,
12576 complain
, NULL_TREE
);
12578 return build_tree_list (default_value
, parm_decl
);
12581 /* Substitute the ARGS into the indicated aggregate (or enumeration)
12582 type T. If T is not an aggregate or enumeration type, it is
12583 handled as if by tsubst. IN_DECL is as for tsubst. If
12584 ENTERING_SCOPE is nonzero, T is the context for a template which
12585 we are presently tsubst'ing. Return the substituted value. */
12588 tsubst_aggr_type (tree t
,
12590 tsubst_flags_t complain
,
12592 int entering_scope
)
12594 if (t
== NULL_TREE
)
12597 switch (TREE_CODE (t
))
12600 if (TYPE_PTRMEMFUNC_P (t
))
12601 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
12603 /* Fall through. */
12604 case ENUMERAL_TYPE
:
12606 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
12611 int saved_unevaluated_operand
;
12612 int saved_inhibit_evaluation_warnings
;
12614 /* In "sizeof(X<I>)" we need to evaluate "I". */
12615 saved_unevaluated_operand
= cp_unevaluated_operand
;
12616 cp_unevaluated_operand
= 0;
12617 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
12618 c_inhibit_evaluation_warnings
= 0;
12620 /* First, determine the context for the type we are looking
12622 context
= TYPE_CONTEXT (t
);
12623 if (context
&& TYPE_P (context
))
12625 context
= tsubst_aggr_type (context
, args
, complain
,
12626 in_decl
, /*entering_scope=*/1);
12627 /* If context is a nested class inside a class template,
12628 it may still need to be instantiated (c++/33959). */
12629 context
= complete_type (context
);
12632 /* Then, figure out what arguments are appropriate for the
12633 type we are trying to find. For example, given:
12635 template <class T> struct S;
12636 template <class T, class U> void f(T, U) { S<U> su; }
12638 and supposing that we are instantiating f<int, double>,
12639 then our ARGS will be {int, double}, but, when looking up
12640 S we only want {double}. */
12641 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
12642 complain
, in_decl
);
12643 if (argvec
== error_mark_node
)
12644 r
= error_mark_node
;
12647 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
12648 entering_scope
, complain
);
12649 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
12652 cp_unevaluated_operand
= saved_unevaluated_operand
;
12653 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
12658 /* This is not a template type, so there's nothing to do. */
12662 return tsubst (t
, args
, complain
, in_decl
);
12666 static GTY((cache
)) tree_cache_map
*defarg_inst
;
12668 /* Substitute into the default argument ARG (a default argument for
12669 FN), which has the indicated TYPE. */
12672 tsubst_default_argument (tree fn
, int parmnum
, tree type
, tree arg
,
12673 tsubst_flags_t complain
)
12675 tree saved_class_ptr
= NULL_TREE
;
12676 tree saved_class_ref
= NULL_TREE
;
12677 int errs
= errorcount
+ sorrycount
;
12679 /* This can happen in invalid code. */
12680 if (TREE_CODE (arg
) == DEFAULT_ARG
)
12683 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
12684 parm
= chain_index (parmnum
, parm
);
12685 tree parmtype
= TREE_TYPE (parm
);
12686 if (DECL_BY_REFERENCE (parm
))
12687 parmtype
= TREE_TYPE (parmtype
);
12688 if (parmtype
== error_mark_node
)
12689 return error_mark_node
;
12691 gcc_assert (same_type_ignoring_top_level_qualifiers_p (type
, parmtype
));
12694 if (defarg_inst
&& (slot
= defarg_inst
->get (parm
)))
12697 /* This default argument came from a template. Instantiate the
12698 default argument here, not in tsubst. In the case of
12707 we must be careful to do name lookup in the scope of S<T>,
12708 rather than in the current class. */
12709 push_access_scope (fn
);
12710 /* The "this" pointer is not valid in a default argument. */
12713 saved_class_ptr
= current_class_ptr
;
12714 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
12715 saved_class_ref
= current_class_ref
;
12716 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
12719 start_lambda_scope (parm
);
12721 push_deferring_access_checks(dk_no_deferred
);
12722 /* The default argument expression may cause implicitly defined
12723 member functions to be synthesized, which will result in garbage
12724 collection. We must treat this situation as if we were within
12725 the body of function so as to avoid collecting live data on the
12728 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
12729 complain
, NULL_TREE
,
12730 /*integral_constant_expression_p=*/false);
12732 pop_deferring_access_checks();
12734 finish_lambda_scope ();
12736 /* Restore the "this" pointer. */
12739 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
12740 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
12743 if (errorcount
+sorrycount
> errs
12744 && (complain
& tf_warning_or_error
))
12745 inform (input_location
,
12746 " when instantiating default argument for call to %qD", fn
);
12748 /* Make sure the default argument is reasonable. */
12749 arg
= check_default_argument (type
, arg
, complain
);
12751 pop_access_scope (fn
);
12753 if (arg
!= error_mark_node
&& !cp_unevaluated_operand
)
12756 defarg_inst
= tree_cache_map::create_ggc (37);
12757 defarg_inst
->put (parm
, arg
);
12763 /* Substitute into all the default arguments for FN. */
12766 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
12771 tmpl_args
= DECL_TI_ARGS (fn
);
12773 /* If this function is not yet instantiated, we certainly don't need
12774 its default arguments. */
12775 if (uses_template_parms (tmpl_args
))
12777 /* Don't do this again for clones. */
12778 if (DECL_CLONED_FUNCTION_P (fn
))
12782 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
12784 arg
= TREE_CHAIN (arg
), ++i
)
12785 if (TREE_PURPOSE (arg
))
12786 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
, i
,
12788 TREE_PURPOSE (arg
),
12792 /* Subroutine of tsubst_decl for the case when T is a FUNCTION_DECL. */
12795 tsubst_function_decl (tree t
, tree args
, tsubst_flags_t complain
,
12796 tree lambda_fntype
)
12798 tree gen_tmpl
, argvec
;
12799 hashval_t hash
= 0;
12802 /* Nobody should be tsubst'ing into non-template functions. */
12803 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
12805 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
12807 /* If T is not dependent, just return it. */
12808 if (!uses_template_parms (DECL_TI_ARGS (t
)))
12811 /* Calculate the most general template of which R is a
12813 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
12815 /* We're substituting a lambda function under tsubst_lambda_expr but not
12816 directly from it; find the matching function we're already inside.
12817 But don't do this if T is a generic lambda with a single level of
12818 template parms, as in that case we're doing a normal instantiation. */
12819 if (LAMBDA_FUNCTION_P (t
) && !lambda_fntype
12820 && (!generic_lambda_fn_p (t
)
12821 || TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
)) > 1))
12822 return enclosing_instantiation_of (t
);
12824 /* Calculate the complete set of arguments used to
12826 argvec
= tsubst_template_args (DECL_TI_ARGS
12827 (DECL_TEMPLATE_RESULT
12828 (DECL_TI_TEMPLATE (t
))),
12829 args
, complain
, in_decl
);
12830 if (argvec
== error_mark_node
)
12831 return error_mark_node
;
12833 /* Check to see if we already have this specialization. */
12834 if (!lambda_fntype
)
12836 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
12837 if (tree spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
))
12841 /* We can see more levels of arguments than parameters if
12842 there was a specialization of a member template, like
12845 template <class T> struct S { template <class U> void f(); }
12846 template <> template <class U> void S<int>::f(U);
12848 Here, we'll be substituting into the specialization,
12849 because that's where we can find the code we actually
12850 want to generate, but we'll have enough arguments for
12851 the most general template.
12853 We also deal with the peculiar case:
12855 template <class T> struct S {
12856 template <class U> friend void f();
12858 template <class U> void f() {}
12860 template void f<double>();
12862 Here, the ARGS for the instantiation of will be {int,
12863 double}. But, we only need as many ARGS as there are
12864 levels of template parameters in CODE_PATTERN. We are
12865 careful not to get fooled into reducing the ARGS in
12868 template <class T> struct S { template <class U> void f(U); }
12869 template <class T> template <> void S<T>::f(int) {}
12871 which we can spot because the pattern will be a
12872 specialization in this case. */
12873 int args_depth
= TMPL_ARGS_DEPTH (args
);
12875 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
12877 if (args_depth
> parms_depth
&& !DECL_TEMPLATE_SPECIALIZATION (t
))
12878 args
= get_innermost_template_args (args
, parms_depth
);
12882 /* This special case arises when we have something like this:
12884 template <class T> struct S {
12885 friend void f<int>(int, double);
12888 Here, the DECL_TI_TEMPLATE for the friend declaration
12889 will be an IDENTIFIER_NODE. We are being called from
12890 tsubst_friend_function, and we want only to create a
12891 new decl (R) with appropriate types so that we can call
12892 determine_specialization. */
12893 gen_tmpl
= NULL_TREE
;
12894 argvec
= NULL_TREE
;
12897 tree closure
= (lambda_fntype
? TYPE_METHOD_BASETYPE (lambda_fntype
)
12899 tree ctx
= closure
? closure
: DECL_CONTEXT (t
);
12900 bool member
= ctx
&& TYPE_P (ctx
);
12902 if (member
&& !closure
)
12903 ctx
= tsubst_aggr_type (ctx
, args
,
12904 complain
, t
, /*entering_scope=*/1);
12906 tree type
= (lambda_fntype
? lambda_fntype
12907 : tsubst (TREE_TYPE (t
), args
,
12908 complain
| tf_fndecl_type
, in_decl
));
12909 if (type
== error_mark_node
)
12910 return error_mark_node
;
12912 /* If we hit excessive deduction depth, the type is bogus even if
12913 it isn't error_mark_node, so don't build a decl. */
12914 if (excessive_deduction_depth
)
12915 return error_mark_node
;
12917 /* We do NOT check for matching decls pushed separately at this
12918 point, as they may not represent instantiations of this
12919 template, and in any case are considered separate under the
12921 tree r
= copy_decl (t
);
12922 DECL_USE_TEMPLATE (r
) = 0;
12923 TREE_TYPE (r
) = type
;
12924 /* Clear out the mangled name and RTL for the instantiation. */
12925 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
12926 SET_DECL_RTL (r
, NULL
);
12927 /* Leave DECL_INITIAL set on deleted instantiations. */
12928 if (!DECL_DELETED_FN (r
))
12929 DECL_INITIAL (r
) = NULL_TREE
;
12930 DECL_CONTEXT (r
) = ctx
;
12932 /* OpenMP UDRs have the only argument a reference to the declared
12933 type. We want to diagnose if the declared type is a reference,
12934 which is invalid, but as references to references are usually
12935 quietly merged, diagnose it here. */
12936 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
12939 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
12940 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
12941 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
12942 error_at (DECL_SOURCE_LOCATION (t
),
12943 "reference type %qT in "
12944 "%<#pragma omp declare reduction%>", argtype
);
12945 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
12946 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
12950 if (member
&& DECL_CONV_FN_P (r
))
12951 /* Type-conversion operator. Reconstruct the name, in
12952 case it's the name of one of the template's parameters. */
12953 DECL_NAME (r
) = make_conv_op_name (TREE_TYPE (type
));
12955 tree parms
= DECL_ARGUMENTS (t
);
12957 parms
= DECL_CHAIN (parms
);
12958 parms
= tsubst (parms
, args
, complain
, t
);
12959 for (tree parm
= parms
; parm
; parm
= DECL_CHAIN (parm
))
12960 DECL_CONTEXT (parm
) = r
;
12963 tree tparm
= build_this_parm (r
, closure
, type_memfn_quals (type
));
12964 DECL_CHAIN (tparm
) = parms
;
12967 DECL_ARGUMENTS (r
) = parms
;
12968 DECL_RESULT (r
) = NULL_TREE
;
12970 TREE_STATIC (r
) = 0;
12971 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
12972 DECL_EXTERNAL (r
) = 1;
12973 /* If this is an instantiation of a function with internal
12974 linkage, we already know what object file linkage will be
12975 assigned to the instantiation. */
12976 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
12977 DECL_DEFER_OUTPUT (r
) = 0;
12978 DECL_CHAIN (r
) = NULL_TREE
;
12979 DECL_PENDING_INLINE_INFO (r
) = 0;
12980 DECL_PENDING_INLINE_P (r
) = 0;
12981 DECL_SAVED_TREE (r
) = NULL_TREE
;
12982 DECL_STRUCT_FUNCTION (r
) = NULL
;
12984 /* We'll re-clone as appropriate in instantiate_template. */
12985 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
12987 /* If we aren't complaining now, return on error before we register
12988 the specialization so that we'll complain eventually. */
12989 if ((complain
& tf_error
) == 0
12990 && IDENTIFIER_ANY_OP_P (DECL_NAME (r
))
12991 && !grok_op_properties (r
, /*complain=*/false))
12992 return error_mark_node
;
12994 /* When instantiating a constrained member, substitute
12995 into the constraints to create a new constraint. */
12996 if (tree ci
= get_constraints (t
))
12999 ci
= tsubst_constraint_info (ci
, argvec
, complain
, NULL_TREE
);
13000 set_constraints (r
, ci
);
13003 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
13004 this in the special friend case mentioned above where
13005 GEN_TMPL is NULL. */
13006 if (gen_tmpl
&& !closure
)
13008 DECL_TEMPLATE_INFO (r
)
13009 = build_template_info (gen_tmpl
, argvec
);
13010 SET_DECL_IMPLICIT_INSTANTIATION (r
);
13013 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
13015 /* We instantiated this while substituting into
13016 the type earlier (template/friend54.C). */
13019 /* We're not supposed to instantiate default arguments
13020 until they are called, for a template. But, for a
13023 template <class T> void f ()
13024 { extern void g(int i = T()); }
13026 we should do the substitution when the template is
13027 instantiated. We handle the member function case in
13028 instantiate_class_template since the default arguments
13029 might refer to other members of the class. */
13031 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
13032 && !uses_template_parms (argvec
))
13033 tsubst_default_arguments (r
, complain
);
13036 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
13038 /* Copy the list of befriending classes. */
13039 for (tree
*friends
= &DECL_BEFRIENDING_CLASSES (r
);
13041 friends
= &TREE_CHAIN (*friends
))
13043 *friends
= copy_node (*friends
);
13044 TREE_VALUE (*friends
)
13045 = tsubst (TREE_VALUE (*friends
), args
, complain
, in_decl
);
13048 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
13050 maybe_retrofit_in_chrg (r
);
13051 if (DECL_CONSTRUCTOR_P (r
) && !grok_ctor_properties (ctx
, r
))
13052 return error_mark_node
;
13053 /* If this is an instantiation of a member template, clone it.
13054 If it isn't, that'll be handled by
13055 clone_constructors_and_destructors. */
13056 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
13057 clone_function_decl (r
, /*update_methods=*/false);
13059 else if ((complain
& tf_error
) != 0
13060 && IDENTIFIER_ANY_OP_P (DECL_NAME (r
))
13061 && !grok_op_properties (r
, /*complain=*/true))
13062 return error_mark_node
;
13064 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
13065 SET_DECL_FRIEND_CONTEXT (r
,
13066 tsubst (DECL_FRIEND_CONTEXT (t
),
13067 args
, complain
, in_decl
));
13069 /* Possibly limit visibility based on template args. */
13070 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
13071 if (DECL_VISIBILITY_SPECIFIED (t
))
13073 DECL_VISIBILITY_SPECIFIED (r
) = 0;
13074 DECL_ATTRIBUTES (r
)
13075 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
13077 determine_visibility (r
);
13078 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
13079 && !processing_template_decl
)
13080 defaulted_late_check (r
);
13082 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
13083 args
, complain
, in_decl
);
13087 /* Subroutine of tsubst_decl for the case when T is a TEMPLATE_DECL. */
13090 tsubst_template_decl (tree t
, tree args
, tsubst_flags_t complain
,
13091 tree lambda_fntype
)
13093 /* We can get here when processing a member function template,
13094 member class template, or template template parameter. */
13095 tree decl
= DECL_TEMPLATE_RESULT (t
);
13101 hashval_t hash
= 0;
13103 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
13105 /* Template template parameter is treated here. */
13106 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13107 if (new_type
== error_mark_node
)
13108 r
= error_mark_node
;
13109 /* If we get a real template back, return it. This can happen in
13110 the context of most_specialized_partial_spec. */
13111 else if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
13114 /* The new TEMPLATE_DECL was built in
13115 reduce_template_parm_level. */
13116 r
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (new_type
);
13120 if (!lambda_fntype
)
13122 /* We might already have an instance of this template.
13123 The ARGS are for the surrounding class type, so the
13124 full args contain the tsubst'd args for the context,
13125 plus the innermost args from the template decl. */
13126 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
13127 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
13128 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
13129 /* Because this is a template, the arguments will still be
13130 dependent, even after substitution. If
13131 PROCESSING_TEMPLATE_DECL is not set, the dependency
13132 predicates will short-circuit. */
13133 ++processing_template_decl
;
13134 full_args
= tsubst_template_args (tmpl_args
, args
,
13135 complain
, in_decl
);
13136 --processing_template_decl
;
13137 if (full_args
== error_mark_node
)
13138 return error_mark_node
;
13140 /* If this is a default template template argument,
13141 tsubst might not have changed anything. */
13142 if (full_args
== tmpl_args
)
13145 hash
= hash_tmpl_and_args (t
, full_args
);
13146 spec
= retrieve_specialization (t
, full_args
, hash
);
13147 if (spec
!= NULL_TREE
)
13151 /* Make a new template decl. It will be similar to the
13152 original, but will record the current template arguments.
13153 We also create a new function declaration, which is just
13154 like the old one, but points to this new template, rather
13155 than the old one. */
13157 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
13158 DECL_CHAIN (r
) = NULL_TREE
;
13160 // Build new template info linking to the original template decl.
13161 if (!lambda_fntype
)
13163 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
13164 SET_DECL_IMPLICIT_INSTANTIATION (r
);
13167 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
13169 /* The template parameters for this new template are all the
13170 template parameters for the old template, except the
13171 outermost level of parameters. */
13172 DECL_TEMPLATE_PARMS (r
)
13173 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
13176 if (TREE_CODE (decl
) == TYPE_DECL
13177 && !TYPE_DECL_ALIAS_P (decl
))
13180 ++processing_template_decl
;
13181 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13182 --processing_template_decl
;
13183 if (new_type
== error_mark_node
)
13184 return error_mark_node
;
13186 TREE_TYPE (r
) = new_type
;
13187 /* For a partial specialization, we need to keep pointing to
13188 the primary template. */
13189 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
13190 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
13191 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
13192 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
13193 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
13198 ++processing_template_decl
;
13199 if (TREE_CODE (decl
) == FUNCTION_DECL
)
13200 new_decl
= tsubst_function_decl (decl
, args
, complain
, lambda_fntype
);
13202 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
13203 --processing_template_decl
;
13204 if (new_decl
== error_mark_node
)
13205 return error_mark_node
;
13207 DECL_TEMPLATE_RESULT (r
) = new_decl
;
13208 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
13209 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
13212 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (r
));
13213 DECL_TEMPLATE_INFO (new_decl
) = build_template_info (r
, args
);
13217 DECL_TI_TEMPLATE (new_decl
) = r
;
13218 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
13222 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
13223 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
13225 if (PRIMARY_TEMPLATE_P (t
))
13226 DECL_PRIMARY_TEMPLATE (r
) = r
;
13228 if (TREE_CODE (decl
) != TYPE_DECL
&& !VAR_P (decl
)
13230 /* Record this non-type partial instantiation. */
13231 register_specialization (r
, t
,
13232 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
13238 /* True if FN is the op() for a lambda in an uninstantiated template. */
13241 lambda_fn_in_template_p (tree fn
)
13243 if (!fn
|| !LAMBDA_FUNCTION_P (fn
))
13245 tree closure
= DECL_CONTEXT (fn
);
13246 return CLASSTYPE_TEMPLATE_INFO (closure
) != NULL_TREE
;
13249 /* We're instantiating a variable from template function TCTX. Return the
13250 corresponding current enclosing scope. This gets complicated because lambda
13251 functions in templates are regenerated rather than instantiated, but generic
13252 lambda functions are subsequently instantiated. */
13255 enclosing_instantiation_of (tree otctx
)
13258 tree fn
= current_function_decl
;
13259 int lambda_count
= 0;
13261 for (; tctx
&& lambda_fn_in_template_p (tctx
);
13262 tctx
= decl_function_context (tctx
))
13264 for (; fn
; fn
= decl_function_context (fn
))
13267 int flambda_count
= 0;
13268 for (; flambda_count
< lambda_count
&& fn
&& LAMBDA_FUNCTION_P (fn
);
13269 fn
= decl_function_context (fn
))
13271 if ((fn
&& DECL_TEMPLATE_INFO (fn
))
13272 ? most_general_template (fn
) != most_general_template (tctx
)
13275 gcc_assert (DECL_NAME (ofn
) == DECL_NAME (otctx
)
13276 || DECL_CONV_FN_P (ofn
));
13279 gcc_unreachable ();
13282 /* Substitute the ARGS into the T, which is a _DECL. Return the
13283 result of the substitution. Issue error and warning messages under
13284 control of COMPLAIN. */
13287 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
13289 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
13290 location_t saved_loc
;
13291 tree r
= NULL_TREE
;
13293 hashval_t hash
= 0;
13295 /* Set the filename and linenumber to improve error-reporting. */
13296 saved_loc
= input_location
;
13297 input_location
= DECL_SOURCE_LOCATION (t
);
13299 switch (TREE_CODE (t
))
13301 case TEMPLATE_DECL
:
13302 r
= tsubst_template_decl (t
, args
, complain
, /*lambda*/NULL_TREE
);
13305 case FUNCTION_DECL
:
13306 r
= tsubst_function_decl (t
, args
, complain
, /*lambda*/NULL_TREE
);
13311 tree type
= NULL_TREE
;
13313 tree expanded_types
= NULL_TREE
;
13314 tree prev_r
= NULL_TREE
;
13315 tree first_r
= NULL_TREE
;
13317 if (DECL_PACK_P (t
))
13319 /* If there is a local specialization that isn't a
13320 parameter pack, it means that we're doing a "simple"
13321 substitution from inside tsubst_pack_expansion. Just
13322 return the local specialization (which will be a single
13324 tree spec
= retrieve_local_specialization (t
);
13326 && TREE_CODE (spec
) == PARM_DECL
13327 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
13330 /* Expand the TYPE_PACK_EXPANSION that provides the types for
13331 the parameters in this function parameter pack. */
13332 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
13333 complain
, in_decl
);
13334 if (TREE_CODE (expanded_types
) == TREE_VEC
)
13336 len
= TREE_VEC_LENGTH (expanded_types
);
13338 /* Zero-length parameter packs are boring. Just substitute
13341 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
13346 /* All we did was update the type. Make a note of that. */
13347 type
= expanded_types
;
13348 expanded_types
= NULL_TREE
;
13352 /* Loop through all of the parameters we'll build. When T is
13353 a function parameter pack, LEN is the number of expanded
13354 types in EXPANDED_TYPES; otherwise, LEN is 1. */
13356 for (i
= 0; i
< len
; ++i
)
13360 if (DECL_TEMPLATE_PARM_P (t
))
13361 SET_DECL_TEMPLATE_PARM_P (r
);
13363 if (expanded_types
)
13364 /* We're on the Ith parameter of the function parameter
13367 /* Get the Ith type. */
13368 type
= TREE_VEC_ELT (expanded_types
, i
);
13370 /* Rename the parameter to include the index. */
13372 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
13375 /* We're dealing with a normal parameter. */
13376 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13378 type
= type_decays_to (type
);
13379 TREE_TYPE (r
) = type
;
13380 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
13382 if (DECL_INITIAL (r
))
13384 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
13385 DECL_INITIAL (r
) = TREE_TYPE (r
);
13387 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
13388 complain
, in_decl
);
13391 DECL_CONTEXT (r
) = NULL_TREE
;
13393 if (!DECL_TEMPLATE_PARM_P (r
))
13394 DECL_ARG_TYPE (r
) = type_passed_as (type
);
13396 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
13397 args
, complain
, in_decl
);
13399 /* Keep track of the first new parameter we
13400 generate. That's what will be returned to the
13405 /* Build a proper chain of parameters when substituting
13406 into a function parameter pack. */
13408 DECL_CHAIN (prev_r
) = r
;
13411 /* If cp_unevaluated_operand is set, we're just looking for a
13412 single dummy parameter, so don't keep going. */
13413 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
13414 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
13415 complain
, DECL_CHAIN (t
));
13417 /* FIRST_R contains the start of the chain we've built. */
13424 tree type
= NULL_TREE
;
13425 tree vec
= NULL_TREE
;
13426 tree expanded_types
= NULL_TREE
;
13429 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
13431 /* This field is a lambda capture pack. Return a TREE_VEC of
13432 the expanded fields to instantiate_class_template_1. */
13433 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
13434 complain
, in_decl
);
13435 if (TREE_CODE (expanded_types
) == TREE_VEC
)
13437 len
= TREE_VEC_LENGTH (expanded_types
);
13438 vec
= make_tree_vec (len
);
13442 /* All we did was update the type. Make a note of that. */
13443 type
= expanded_types
;
13444 expanded_types
= NULL_TREE
;
13448 for (int i
= 0; i
< len
; ++i
)
13451 if (expanded_types
)
13453 type
= TREE_VEC_ELT (expanded_types
, i
);
13455 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
13458 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13460 if (type
== error_mark_node
)
13461 RETURN (error_mark_node
);
13462 TREE_TYPE (r
) = type
;
13463 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
13465 if (DECL_C_BIT_FIELD (r
))
13466 /* For bit-fields, DECL_BIT_FIELD_REPRESENTATIVE gives the
13468 DECL_BIT_FIELD_REPRESENTATIVE (r
)
13469 = tsubst_expr (DECL_BIT_FIELD_REPRESENTATIVE (t
), args
,
13471 /*integral_constant_expression_p=*/true);
13472 if (DECL_INITIAL (t
))
13474 /* Set up DECL_TEMPLATE_INFO so that we can get at the
13475 NSDMI in perform_member_init. Still set DECL_INITIAL
13476 so that we know there is one. */
13477 DECL_INITIAL (r
) = void_node
;
13478 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
13479 retrofit_lang_decl (r
);
13480 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
13482 /* We don't have to set DECL_CONTEXT here; it is set by
13483 finish_member_declaration. */
13484 DECL_CHAIN (r
) = NULL_TREE
;
13486 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
13487 args
, complain
, in_decl
);
13490 TREE_VEC_ELT (vec
, i
) = r
;
13499 /* We reach here only for member using decls. We also need to check
13500 uses_template_parms because DECL_DEPENDENT_P is not set for a
13501 using-declaration that designates a member of the current
13502 instantiation (c++/53549). */
13503 if (DECL_DEPENDENT_P (t
)
13504 || uses_template_parms (USING_DECL_SCOPE (t
)))
13506 tree scope
= USING_DECL_SCOPE (t
);
13507 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
13508 if (PACK_EXPANSION_P (scope
))
13510 tree vec
= tsubst_pack_expansion (scope
, args
, complain
, in_decl
);
13511 int len
= TREE_VEC_LENGTH (vec
);
13512 r
= make_tree_vec (len
);
13513 for (int i
= 0; i
< len
; ++i
)
13515 tree escope
= TREE_VEC_ELT (vec
, i
);
13516 tree elt
= do_class_using_decl (escope
, name
);
13519 r
= error_mark_node
;
13524 TREE_PROTECTED (elt
) = TREE_PROTECTED (t
);
13525 TREE_PRIVATE (elt
) = TREE_PRIVATE (t
);
13527 TREE_VEC_ELT (r
, i
) = elt
;
13532 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
13533 complain
, in_decl
);
13534 r
= do_class_using_decl (inst_scope
, name
);
13536 r
= error_mark_node
;
13539 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
13540 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
13547 DECL_CHAIN (r
) = NULL_TREE
;
13554 tree argvec
= NULL_TREE
;
13555 tree gen_tmpl
= NULL_TREE
;
13557 tree tmpl
= NULL_TREE
;
13559 tree type
= NULL_TREE
;
13562 if (TREE_TYPE (t
) == error_mark_node
)
13563 RETURN (error_mark_node
);
13565 if (TREE_CODE (t
) == TYPE_DECL
13566 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
13568 /* If this is the canonical decl, we don't have to
13569 mess with instantiations, and often we can't (for
13570 typename, template type parms and such). Note that
13571 TYPE_NAME is not correct for the above test if
13572 we've copied the type for a typedef. */
13573 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13574 if (type
== error_mark_node
)
13575 RETURN (error_mark_node
);
13576 r
= TYPE_NAME (type
);
13580 /* Check to see if we already have the specialization we
13583 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
13585 /* T is a static data member or namespace-scope entity.
13586 We have to substitute into namespace-scope variables
13587 (not just variable templates) because of cases like:
13589 template <class T> void f() { extern T t; }
13591 where the entity referenced is not known until
13592 instantiation time. */
13594 ctx
= DECL_CONTEXT (t
);
13595 if (DECL_CLASS_SCOPE_P (t
))
13597 ctx
= tsubst_aggr_type (ctx
, args
,
13599 in_decl
, /*entering_scope=*/1);
13600 /* If CTX is unchanged, then T is in fact the
13601 specialization we want. That situation occurs when
13602 referencing a static data member within in its own
13603 class. We can use pointer equality, rather than
13604 same_type_p, because DECL_CONTEXT is always
13606 if (ctx
== DECL_CONTEXT (t
)
13607 /* ... unless T is a member template; in which
13608 case our caller can be willing to create a
13609 specialization of that template represented
13611 && !(DECL_TI_TEMPLATE (t
)
13612 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
13618 tmpl
= DECL_TI_TEMPLATE (t
);
13619 gen_tmpl
= most_general_template (tmpl
);
13620 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
13621 if (argvec
!= error_mark_node
)
13622 argvec
= (coerce_innermost_template_parms
13623 (DECL_TEMPLATE_PARMS (gen_tmpl
),
13624 argvec
, t
, complain
,
13625 /*all*/true, /*defarg*/true));
13626 if (argvec
== error_mark_node
)
13627 RETURN (error_mark_node
);
13628 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
13629 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
13634 /* A local variable. */
13636 /* Subsequent calls to pushdecl will fill this in. */
13638 /* Unless this is a reference to a static variable from an
13639 enclosing function, in which case we need to fill it in now. */
13640 if (TREE_STATIC (t
))
13642 tree fn
= enclosing_instantiation_of (DECL_CONTEXT (t
));
13643 if (fn
!= current_function_decl
)
13646 spec
= retrieve_local_specialization (t
);
13648 /* If we already have the specialization we need, there is
13649 nothing more to do. */
13656 /* Create a new node for the specialization we need. */
13658 if (type
== NULL_TREE
)
13660 if (is_typedef_decl (t
))
13661 type
= DECL_ORIGINAL_TYPE (t
);
13663 type
= TREE_TYPE (t
);
13665 && VAR_HAD_UNKNOWN_BOUND (t
)
13666 && type
!= error_mark_node
)
13667 type
= strip_array_domain (type
);
13668 tree sub_args
= args
;
13669 if (tree auto_node
= type_uses_auto (type
))
13671 /* Mask off any template args past the variable's context so we
13672 don't replace the auto with an unrelated argument. */
13673 int nouter
= TEMPLATE_TYPE_LEVEL (auto_node
) - 1;
13674 int extra
= TMPL_ARGS_DEPTH (args
) - nouter
;
13676 /* This should never happen with the new lambda instantiation
13677 model, but keep the handling just in case. */
13678 gcc_assert (!CHECKING_P
),
13679 sub_args
= strip_innermost_template_args (args
, extra
);
13681 type
= tsubst (type
, sub_args
, complain
, in_decl
);
13685 /* Even if the original location is out of scope, the
13686 newly substituted one is not. */
13687 DECL_DEAD_FOR_LOCAL (r
) = 0;
13688 DECL_INITIALIZED_P (r
) = 0;
13689 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
13690 if (type
== error_mark_node
)
13691 RETURN (error_mark_node
);
13692 if (TREE_CODE (type
) == FUNCTION_TYPE
)
13694 /* It may seem that this case cannot occur, since:
13699 declares a function, not a variable. However:
13702 template <typename T> void g() { T t; }
13703 template void g<f>();
13705 is an attempt to declare a variable with function
13707 error ("variable %qD has function type",
13708 /* R is not yet sufficiently initialized, so we
13709 just use its name. */
13711 RETURN (error_mark_node
);
13713 type
= complete_type (type
);
13714 /* Wait until cp_finish_decl to set this again, to handle
13715 circular dependency (template/instantiate6.C). */
13716 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
13717 type
= check_var_type (DECL_NAME (r
), type
);
13719 if (DECL_HAS_VALUE_EXPR_P (t
))
13721 tree ve
= DECL_VALUE_EXPR (t
);
13722 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
13723 /*constant_expression_p=*/false);
13724 if (REFERENCE_REF_P (ve
))
13726 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
13727 ve
= TREE_OPERAND (ve
, 0);
13729 SET_DECL_VALUE_EXPR (r
, ve
);
13731 if (CP_DECL_THREAD_LOCAL_P (r
)
13732 && !processing_template_decl
)
13733 set_decl_tls_model (r
, decl_default_tls_model (r
));
13735 else if (DECL_SELF_REFERENCE_P (t
))
13736 SET_DECL_SELF_REFERENCE_P (r
);
13737 TREE_TYPE (r
) = type
;
13738 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
13739 DECL_CONTEXT (r
) = ctx
;
13740 /* Clear out the mangled name and RTL for the instantiation. */
13741 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
13742 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
13743 SET_DECL_RTL (r
, NULL
);
13744 /* The initializer must not be expanded until it is required;
13745 see [temp.inst]. */
13746 DECL_INITIAL (r
) = NULL_TREE
;
13747 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
13750 if (DECL_LANG_SPECIFIC (r
))
13751 SET_DECL_DEPENDENT_INIT_P (r
, false);
13753 SET_DECL_MODE (r
, VOIDmode
);
13755 /* Possibly limit visibility based on template args. */
13756 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
13757 if (DECL_VISIBILITY_SPECIFIED (t
))
13759 DECL_VISIBILITY_SPECIFIED (r
) = 0;
13760 DECL_ATTRIBUTES (r
)
13761 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
13763 determine_visibility (r
);
13768 /* A static data member declaration is always marked
13769 external when it is declared in-class, even if an
13770 initializer is present. We mimic the non-template
13771 processing here. */
13772 DECL_EXTERNAL (r
) = 1;
13773 if (DECL_NAMESPACE_SCOPE_P (t
))
13774 DECL_NOT_REALLY_EXTERN (r
) = 1;
13776 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
13777 SET_DECL_IMPLICIT_INSTANTIATION (r
);
13778 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
13782 if (DECL_LANG_SPECIFIC (r
))
13783 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
13784 if (!cp_unevaluated_operand
)
13785 register_local_specialization (r
, t
);
13788 DECL_CHAIN (r
) = NULL_TREE
;
13790 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
13792 args
, complain
, in_decl
);
13794 /* Preserve a typedef that names a type. */
13795 if (is_typedef_decl (r
) && type
!= error_mark_node
)
13797 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
13798 set_underlying_type (r
);
13799 if (TYPE_DECL_ALIAS_P (r
))
13800 /* An alias template specialization can be dependent
13801 even if its underlying type is not. */
13802 TYPE_DEPENDENT_P_VALID (TREE_TYPE (r
)) = false;
13805 layout_decl (r
, 0);
13810 gcc_unreachable ();
13815 /* Restore the file and line information. */
13816 input_location
= saved_loc
;
13821 /* Substitute into the ARG_TYPES of a function type.
13822 If END is a TREE_CHAIN, leave it and any following types
13826 tsubst_arg_types (tree arg_types
,
13829 tsubst_flags_t complain
,
13832 tree remaining_arg_types
;
13833 tree type
= NULL_TREE
;
13835 tree expanded_args
= NULL_TREE
;
13838 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
13841 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
13842 args
, end
, complain
, in_decl
);
13843 if (remaining_arg_types
== error_mark_node
)
13844 return error_mark_node
;
13846 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
13848 /* For a pack expansion, perform substitution on the
13849 entire expression. Later on, we'll handle the arguments
13851 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
13852 args
, complain
, in_decl
);
13854 if (TREE_CODE (expanded_args
) == TREE_VEC
)
13855 /* So that we'll spin through the parameters, one by one. */
13856 i
= TREE_VEC_LENGTH (expanded_args
);
13859 /* We only partially substituted into the parameter
13860 pack. Our type is TYPE_PACK_EXPANSION. */
13861 type
= expanded_args
;
13862 expanded_args
= NULL_TREE
;
13870 type
= TREE_VEC_ELT (expanded_args
, i
);
13872 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
13874 if (type
== error_mark_node
)
13875 return error_mark_node
;
13876 if (VOID_TYPE_P (type
))
13878 if (complain
& tf_error
)
13880 error ("invalid parameter type %qT", type
);
13882 error ("in declaration %q+D", in_decl
);
13884 return error_mark_node
;
13887 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
13888 return error_mark_node
;
13890 /* Do array-to-pointer, function-to-pointer conversion, and ignore
13891 top-level qualifiers as required. */
13892 type
= cv_unqualified (type_decays_to (type
));
13894 /* We do not substitute into default arguments here. The standard
13895 mandates that they be instantiated only when needed, which is
13896 done in build_over_call. */
13897 default_arg
= TREE_PURPOSE (arg_types
);
13899 /* Except that we do substitute default arguments under tsubst_lambda_expr,
13900 since the new op() won't have any associated template arguments for us
13901 to refer to later. */
13902 if (lambda_fn_in_template_p (in_decl
))
13903 default_arg
= tsubst_copy_and_build (default_arg
, args
, complain
, in_decl
,
13904 false/*fn*/, false/*constexpr*/);
13906 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
13908 /* We've instantiated a template before its default arguments
13909 have been parsed. This can happen for a nested template
13910 class, and is not an error unless we require the default
13911 argument in a call of this function. */
13912 remaining_arg_types
=
13913 tree_cons (default_arg
, type
, remaining_arg_types
);
13914 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
13917 remaining_arg_types
=
13918 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
13921 return remaining_arg_types
;
13924 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
13925 *not* handle the exception-specification for FNTYPE, because the
13926 initial substitution of explicitly provided template parameters
13927 during argument deduction forbids substitution into the
13928 exception-specification:
13932 All references in the function type of the function template to the
13933 corresponding template parameters are replaced by the specified tem-
13934 plate argument values. If a substitution in a template parameter or
13935 in the function type of the function template results in an invalid
13936 type, type deduction fails. [Note: The equivalent substitution in
13937 exception specifications is done only when the function is instanti-
13938 ated, at which point a program is ill-formed if the substitution
13939 results in an invalid type.] */
13942 tsubst_function_type (tree t
,
13944 tsubst_flags_t complain
,
13948 tree arg_types
= NULL_TREE
;
13951 /* The TYPE_CONTEXT is not used for function/method types. */
13952 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
13954 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
13956 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
13958 if (late_return_type_p
)
13960 /* Substitute the argument types. */
13961 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
13962 complain
, in_decl
);
13963 if (arg_types
== error_mark_node
)
13964 return error_mark_node
;
13966 tree save_ccp
= current_class_ptr
;
13967 tree save_ccr
= current_class_ref
;
13968 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
13969 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
13970 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
13973 /* DR 1207: 'this' is in scope in the trailing return type. */
13974 inject_this_parameter (this_type
, cp_type_quals (this_type
));
13977 /* Substitute the return type. */
13978 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13982 current_class_ptr
= save_ccp
;
13983 current_class_ref
= save_ccr
;
13987 /* Substitute the return type. */
13988 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13990 if (return_type
== error_mark_node
)
13991 return error_mark_node
;
13992 /* DR 486 clarifies that creation of a function type with an
13993 invalid return type is a deduction failure. */
13994 if (TREE_CODE (return_type
) == ARRAY_TYPE
13995 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
13997 if (complain
& tf_error
)
13999 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
14000 error ("function returning an array");
14002 error ("function returning a function");
14004 return error_mark_node
;
14007 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
14008 return error_mark_node
;
14010 if (!late_return_type_p
)
14012 /* Substitute the argument types. */
14013 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
14014 complain
, in_decl
);
14015 if (arg_types
== error_mark_node
)
14016 return error_mark_node
;
14019 /* Construct a new type node and return it. */
14020 if (TREE_CODE (t
) == FUNCTION_TYPE
)
14022 fntype
= build_function_type (return_type
, arg_types
);
14023 fntype
= apply_memfn_quals (fntype
,
14024 type_memfn_quals (t
),
14025 type_memfn_rqual (t
));
14029 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
14030 /* Don't pick up extra function qualifiers from the basetype. */
14031 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
14032 if (! MAYBE_CLASS_TYPE_P (r
))
14036 Type deduction may fail for any of the following
14039 -- Attempting to create "pointer to member of T" when T
14040 is not a class type. */
14041 if (complain
& tf_error
)
14042 error ("creating pointer to member function of non-class type %qT",
14044 return error_mark_node
;
14047 fntype
= build_method_type_directly (r
, return_type
,
14048 TREE_CHAIN (arg_types
));
14049 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
14051 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
14053 if (late_return_type_p
)
14054 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
14059 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
14060 ARGS into that specification, and return the substituted
14061 specification. If there is no specification, return NULL_TREE. */
14064 tsubst_exception_specification (tree fntype
,
14066 tsubst_flags_t complain
,
14073 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
14074 new_specs
= NULL_TREE
;
14075 if (specs
&& TREE_PURPOSE (specs
))
14077 /* A noexcept-specifier. */
14078 tree expr
= TREE_PURPOSE (specs
);
14079 if (TREE_CODE (expr
) == INTEGER_CST
)
14083 /* Defer instantiation of noexcept-specifiers to avoid
14084 excessive instantiations (c++/49107). */
14085 new_specs
= make_node (DEFERRED_NOEXCEPT
);
14086 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
14088 /* We already partially instantiated this member template,
14089 so combine the new args with the old. */
14090 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
14091 = DEFERRED_NOEXCEPT_PATTERN (expr
);
14092 DEFERRED_NOEXCEPT_ARGS (new_specs
)
14093 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
14097 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
14098 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
14102 new_specs
= tsubst_copy_and_build
14103 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
14104 /*integral_constant_expression_p=*/true);
14105 new_specs
= build_noexcept_spec (new_specs
, complain
);
14109 if (! TREE_VALUE (specs
))
14116 tree expanded_specs
= NULL_TREE
;
14118 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
14120 /* Expand the pack expansion type. */
14121 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
14125 if (expanded_specs
== error_mark_node
)
14126 return error_mark_node
;
14127 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
14128 len
= TREE_VEC_LENGTH (expanded_specs
);
14131 /* We're substituting into a member template, so
14132 we got a TYPE_PACK_EXPANSION back. Add that
14133 expansion and move on. */
14134 gcc_assert (TREE_CODE (expanded_specs
)
14135 == TYPE_PACK_EXPANSION
);
14136 new_specs
= add_exception_specifier (new_specs
,
14139 specs
= TREE_CHAIN (specs
);
14144 for (i
= 0; i
< len
; ++i
)
14146 if (expanded_specs
)
14147 spec
= TREE_VEC_ELT (expanded_specs
, i
);
14149 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
14150 if (spec
== error_mark_node
)
14152 new_specs
= add_exception_specifier (new_specs
, spec
,
14156 specs
= TREE_CHAIN (specs
);
14162 /* Take the tree structure T and replace template parameters used
14163 therein with the argument vector ARGS. IN_DECL is an associated
14164 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
14165 Issue error and warning messages under control of COMPLAIN. Note
14166 that we must be relatively non-tolerant of extensions here, in
14167 order to preserve conformance; if we allow substitutions that
14168 should not be allowed, we may allow argument deductions that should
14169 not succeed, and therefore report ambiguous overload situations
14170 where there are none. In theory, we could allow the substitution,
14171 but indicate that it should have failed, and allow our caller to
14172 make sure that the right thing happens, but we don't try to do this
14175 This function is used for dealing with types, decls and the like;
14176 for expressions, use tsubst_expr or tsubst_copy. */
14179 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
14181 enum tree_code code
;
14182 tree type
, r
= NULL_TREE
;
14184 if (t
== NULL_TREE
|| t
== error_mark_node
14185 || t
== integer_type_node
14186 || t
== void_type_node
14187 || t
== char_type_node
14188 || t
== unknown_type_node
14189 || TREE_CODE (t
) == NAMESPACE_DECL
14190 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
14194 return tsubst_decl (t
, args
, complain
);
14196 if (args
== NULL_TREE
)
14199 code
= TREE_CODE (t
);
14201 if (code
== IDENTIFIER_NODE
)
14202 type
= IDENTIFIER_TYPE_VALUE (t
);
14204 type
= TREE_TYPE (t
);
14206 gcc_assert (type
!= unknown_type_node
);
14208 /* Reuse typedefs. We need to do this to handle dependent attributes,
14209 such as attribute aligned. */
14211 && typedef_variant_p (t
))
14213 tree decl
= TYPE_NAME (t
);
14215 if (alias_template_specialization_p (t
))
14217 /* DECL represents an alias template and we want to
14219 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
14220 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
14221 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
14223 else if (DECL_CLASS_SCOPE_P (decl
)
14224 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
14225 && uses_template_parms (DECL_CONTEXT (decl
)))
14227 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
14228 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
14229 r
= retrieve_specialization (tmpl
, gen_args
, 0);
14231 else if (DECL_FUNCTION_SCOPE_P (decl
)
14232 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
14233 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
14234 r
= retrieve_local_specialization (decl
);
14236 /* The typedef is from a non-template context. */
14242 r
= cp_build_qualified_type_real
14243 (r
, cp_type_quals (t
) | cp_type_quals (r
),
14244 complain
| tf_ignore_bad_quals
);
14249 /* We don't have an instantiation yet, so drop the typedef. */
14250 int quals
= cp_type_quals (t
);
14251 t
= DECL_ORIGINAL_TYPE (decl
);
14252 t
= cp_build_qualified_type_real (t
, quals
,
14253 complain
| tf_ignore_bad_quals
);
14257 bool fndecl_type
= (complain
& tf_fndecl_type
);
14258 complain
&= ~tf_fndecl_type
;
14261 && code
!= TYPENAME_TYPE
14262 && code
!= TEMPLATE_TYPE_PARM
14263 && code
!= TEMPLATE_PARM_INDEX
14264 && code
!= IDENTIFIER_NODE
14265 && code
!= FUNCTION_TYPE
14266 && code
!= METHOD_TYPE
)
14267 type
= tsubst (type
, args
, complain
, in_decl
);
14268 if (type
== error_mark_node
)
14269 return error_mark_node
;
14275 case ENUMERAL_TYPE
:
14276 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
14277 /*entering_scope=*/0);
14280 case IDENTIFIER_NODE
:
14291 if (t
== integer_type_node
)
14294 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
14295 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
14299 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
14301 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
14302 /*integral_constant_expression_p=*/false);
14304 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
14306 if (TREE_CODE (max
) == NOP_EXPR
14307 && TREE_SIDE_EFFECTS (omax
)
14308 && !TREE_TYPE (max
))
14309 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
14311 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
14312 with TREE_SIDE_EFFECTS that indicates this is not an integral
14313 constant expression. */
14314 if (processing_template_decl
14315 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
14317 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
14318 TREE_SIDE_EFFECTS (max
) = 1;
14321 return compute_array_index_type (NULL_TREE
, max
, complain
);
14324 case TEMPLATE_TYPE_PARM
:
14325 case TEMPLATE_TEMPLATE_PARM
:
14326 case BOUND_TEMPLATE_TEMPLATE_PARM
:
14327 case TEMPLATE_PARM_INDEX
:
14332 tree arg
= NULL_TREE
;
14334 /* Early in template argument deduction substitution, we don't
14335 want to reduce the level of 'auto', or it will be confused
14336 with a normal template parm in subsequent deduction. */
14337 if (is_auto (t
) && (complain
& tf_partial
))
14342 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
14343 template_parm_level_and_index (t
, &level
, &idx
);
14345 levels
= TMPL_ARGS_DEPTH (args
);
14346 if (level
<= levels
14347 && TREE_VEC_LENGTH (TMPL_ARGS_LEVEL (args
, level
)) > 0)
14349 arg
= TMPL_ARG (args
, level
, idx
);
14351 /* See through ARGUMENT_PACK_SELECT arguments. */
14352 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
14353 arg
= argument_pack_select_arg (arg
);
14356 if (arg
== error_mark_node
)
14357 return error_mark_node
;
14358 else if (arg
!= NULL_TREE
)
14360 if (ARGUMENT_PACK_P (arg
))
14361 /* If ARG is an argument pack, we don't actually want to
14362 perform a substitution here, because substitutions
14363 for argument packs are only done
14364 element-by-element. We can get to this point when
14365 substituting the type of a non-type template
14366 parameter pack, when that type actually contains
14367 template parameter packs from an outer template, e.g.,
14369 template<typename... Types> struct A {
14370 template<Types... Values> struct B { };
14374 if (code
== TEMPLATE_TYPE_PARM
)
14377 gcc_assert (TYPE_P (arg
));
14379 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
14381 return cp_build_qualified_type_real
14382 (arg
, quals
, complain
| tf_ignore_bad_quals
);
14384 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
14386 /* We are processing a type constructed from a
14387 template template parameter. */
14388 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
14389 args
, complain
, in_decl
);
14390 if (argvec
== error_mark_node
)
14391 return error_mark_node
;
14393 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
14394 || TREE_CODE (arg
) == TEMPLATE_DECL
14395 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
14397 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
14398 /* Consider this code:
14400 template <template <class> class Template>
14402 template <class Arg> using Bind = Template<Arg>;
14405 template <template <class> class Template, class Arg>
14406 using Instantiate = Template<Arg>; //#0
14408 template <template <class> class Template,
14411 Instantiate<Internal<Template>::template Bind,
14414 When #1 is parsed, the
14415 BOUND_TEMPLATE_TEMPLATE_PARM representing the
14416 parameter `Template' in #0 matches the
14417 UNBOUND_CLASS_TEMPLATE representing the argument
14418 `Internal<Template>::template Bind'; We then want
14419 to assemble the type `Bind<Argument>' that can't
14420 be fully created right now, because
14421 `Internal<Template>' not being complete, the Bind
14422 template cannot be looked up in that context. So
14423 we need to "store" `Bind<Argument>' for later
14424 when the context of Bind becomes complete. Let's
14425 store that in a TYPENAME_TYPE. */
14426 return make_typename_type (TYPE_CONTEXT (arg
),
14427 build_nt (TEMPLATE_ID_EXPR
,
14428 TYPE_IDENTIFIER (arg
),
14433 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
14434 are resolving nested-types in the signature of a
14435 member function templates. Otherwise ARG is a
14436 TEMPLATE_DECL and is the real template to be
14438 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
14439 arg
= TYPE_NAME (arg
);
14441 r
= lookup_template_class (arg
,
14443 DECL_CONTEXT (arg
),
14444 /*entering_scope=*/0,
14446 return cp_build_qualified_type_real
14447 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
14449 else if (code
== TEMPLATE_TEMPLATE_PARM
)
14452 /* TEMPLATE_PARM_INDEX. */
14453 return convert_from_reference (unshare_expr (arg
));
14457 /* This can happen during the attempted tsubst'ing in
14458 unify. This means that we don't yet have any information
14459 about the template parameter in question. */
14462 /* If we get here, we must have been looking at a parm for a
14463 more deeply nested template. Make a new version of this
14464 template parameter, but with a lower level. */
14467 case TEMPLATE_TYPE_PARM
:
14468 case TEMPLATE_TEMPLATE_PARM
:
14469 case BOUND_TEMPLATE_TEMPLATE_PARM
:
14470 if (cp_type_quals (t
))
14472 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
14473 r
= cp_build_qualified_type_real
14474 (r
, cp_type_quals (t
),
14475 complain
| (code
== TEMPLATE_TYPE_PARM
14476 ? tf_ignore_bad_quals
: 0));
14478 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
14479 && PLACEHOLDER_TYPE_CONSTRAINTS (t
)
14480 && (r
= (TEMPLATE_PARM_DESCENDANTS
14481 (TEMPLATE_TYPE_PARM_INDEX (t
))))
14482 && (r
= TREE_TYPE (r
))
14483 && !PLACEHOLDER_TYPE_CONSTRAINTS (r
))
14484 /* Break infinite recursion when substituting the constraints
14485 of a constrained placeholder. */;
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 ((TREE_CODE (type
) == REFERENCE_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 (TREE_CODE (type
) == REFERENCE_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 (TREE_CODE (type
) == REFERENCE_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 || TREE_CODE (type
) == REFERENCE_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 (TYPE_USER_ALIGN (t
))
14793 SET_TYPE_ALIGN (r
, TYPE_ALIGN (t
));
14794 TYPE_USER_ALIGN (r
) = 1;
14800 case TYPENAME_TYPE
:
14802 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
14803 in_decl
, /*entering_scope=*/1);
14804 if (ctx
== error_mark_node
)
14805 return error_mark_node
;
14807 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
14808 complain
, in_decl
);
14809 if (f
== error_mark_node
)
14810 return error_mark_node
;
14812 if (!MAYBE_CLASS_TYPE_P (ctx
))
14814 if (complain
& tf_error
)
14815 error ("%qT is not a class, struct, or union type", ctx
);
14816 return error_mark_node
;
14818 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
14820 /* Normally, make_typename_type does not require that the CTX
14821 have complete type in order to allow things like:
14823 template <class T> struct S { typename S<T>::X Y; };
14825 But, such constructs have already been resolved by this
14826 point, so here CTX really should have complete type, unless
14827 it's a partial instantiation. */
14828 ctx
= complete_type (ctx
);
14829 if (!COMPLETE_TYPE_P (ctx
))
14831 if (complain
& tf_error
)
14832 cxx_incomplete_type_error (NULL_TREE
, ctx
);
14833 return error_mark_node
;
14837 f
= make_typename_type (ctx
, f
, typename_type
,
14838 complain
| tf_keep_type_decl
);
14839 if (f
== error_mark_node
)
14841 if (TREE_CODE (f
) == TYPE_DECL
)
14843 complain
|= tf_ignore_bad_quals
;
14847 if (TREE_CODE (f
) != TYPENAME_TYPE
)
14849 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
14851 if (complain
& tf_error
)
14852 error ("%qT resolves to %qT, which is not an enumeration type",
14855 return error_mark_node
;
14857 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
14859 if (complain
& tf_error
)
14860 error ("%qT resolves to %qT, which is is not a class type",
14863 return error_mark_node
;
14867 return cp_build_qualified_type_real
14868 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
14871 case UNBOUND_CLASS_TEMPLATE
:
14873 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
14874 in_decl
, /*entering_scope=*/1);
14875 tree name
= TYPE_IDENTIFIER (t
);
14876 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
14878 if (ctx
== error_mark_node
|| name
== error_mark_node
)
14879 return error_mark_node
;
14882 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
14883 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
14890 ++cp_unevaluated_operand
;
14891 ++c_inhibit_evaluation_warnings
;
14893 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
14895 /*integral_constant_expression_p=*/false);
14897 --cp_unevaluated_operand
;
14898 --c_inhibit_evaluation_warnings
;
14900 type
= finish_typeof (type
);
14901 return cp_build_qualified_type_real (type
,
14903 | cp_type_quals (type
),
14907 case DECLTYPE_TYPE
:
14911 ++cp_unevaluated_operand
;
14912 ++c_inhibit_evaluation_warnings
;
14914 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
14915 complain
|tf_decltype
, in_decl
,
14916 /*function_p*/false,
14917 /*integral_constant_expression*/false);
14919 if (DECLTYPE_FOR_INIT_CAPTURE (t
))
14921 if (type
== NULL_TREE
)
14923 if (complain
& tf_error
)
14924 error ("empty initializer in lambda init-capture");
14925 type
= error_mark_node
;
14927 else if (TREE_CODE (type
) == TREE_LIST
)
14928 type
= build_x_compound_expr_from_list (type
, ELK_INIT
, complain
);
14931 --cp_unevaluated_operand
;
14932 --c_inhibit_evaluation_warnings
;
14934 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
14935 type
= lambda_capture_field_type (type
,
14936 DECLTYPE_FOR_INIT_CAPTURE (t
),
14937 DECLTYPE_FOR_REF_CAPTURE (t
));
14938 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
14939 type
= lambda_proxy_type (type
);
14942 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
14943 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
14945 /* In a template ~id could be either a complement expression
14946 or an unqualified-id naming a destructor; if instantiating
14947 it produces an expression, it's not an id-expression or
14950 type
= finish_decltype_type (type
, id
, complain
);
14952 return cp_build_qualified_type_real (type
,
14954 | cp_type_quals (type
),
14955 complain
| tf_ignore_bad_quals
);
14958 case UNDERLYING_TYPE
:
14960 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
14961 complain
, in_decl
);
14962 return finish_underlying_type (type
);
14965 case TYPE_ARGUMENT_PACK
:
14966 case NONTYPE_ARGUMENT_PACK
:
14970 if (code
== NONTYPE_ARGUMENT_PACK
)
14971 r
= make_node (code
);
14973 r
= cxx_make_type (code
);
14975 tree pack_args
= ARGUMENT_PACK_ARGS (t
);
14976 pack_args
= tsubst_template_args (pack_args
, args
, complain
, in_decl
);
14977 SET_ARGUMENT_PACK_ARGS (r
, pack_args
);
14995 /* We should use one of the expression tsubsts for these codes. */
14996 gcc_unreachable ();
14999 sorry ("use of %qs in template", get_tree_code_name (code
));
15000 return error_mark_node
;
15004 /* tsubst a BASELINK. OBJECT_TYPE, if non-NULL, is the type of the
15005 expression on the left-hand side of the "." or "->" operator. We
15006 only do the lookup if we had a dependent BASELINK. Otherwise we
15007 adjust it onto the instantiated heirarchy. */
15010 tsubst_baselink (tree baselink
, tree object_type
,
15011 tree args
, tsubst_flags_t complain
, tree in_decl
)
15013 bool qualified_p
= BASELINK_QUALIFIED_P (baselink
);
15014 tree qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
15015 qualifying_scope
= tsubst (qualifying_scope
, args
, complain
, in_decl
);
15017 tree optype
= BASELINK_OPTYPE (baselink
);
15018 optype
= tsubst (optype
, args
, complain
, in_decl
);
15020 tree template_args
= NULL_TREE
;
15021 bool template_id_p
= false;
15022 tree fns
= BASELINK_FUNCTIONS (baselink
);
15023 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
15025 template_id_p
= true;
15026 template_args
= TREE_OPERAND (fns
, 1);
15027 fns
= TREE_OPERAND (fns
, 0);
15029 template_args
= tsubst_template_args (template_args
, args
,
15030 complain
, in_decl
);
15033 tree binfo_type
= BINFO_TYPE (BASELINK_BINFO (baselink
));
15034 binfo_type
= tsubst (binfo_type
, args
, complain
, in_decl
);
15035 bool dependent_p
= binfo_type
!= BINFO_TYPE (BASELINK_BINFO (baselink
));
15039 tree name
= OVL_NAME (fns
);
15040 if (IDENTIFIER_CONV_OP_P (name
))
15041 name
= make_conv_op_name (optype
);
15043 if (name
== complete_dtor_identifier
)
15044 /* Treat as-if non-dependent below. */
15045 dependent_p
= false;
15047 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
15050 if ((complain
& tf_error
)
15051 && constructor_name_p (name
, qualifying_scope
))
15052 error ("cannot call constructor %<%T::%D%> directly",
15053 qualifying_scope
, name
);
15054 return error_mark_node
;
15057 if (BASELINK_P (baselink
))
15058 fns
= BASELINK_FUNCTIONS (baselink
);
15061 /* We're going to overwrite pieces below, make a duplicate. */
15062 baselink
= copy_node (baselink
);
15064 /* If lookup found a single function, mark it as used at this point.
15065 (If lookup found multiple functions the one selected later by
15066 overload resolution will be marked as used at that point.) */
15067 if (!template_id_p
&& !really_overloaded_fn (fns
))
15069 tree fn
= OVL_FIRST (fns
);
15070 bool ok
= mark_used (fn
, complain
);
15071 if (!ok
&& !(complain
& tf_error
))
15072 return error_mark_node
;
15073 if (ok
&& BASELINK_P (baselink
))
15074 /* We might have instantiated an auto function. */
15075 TREE_TYPE (baselink
) = TREE_TYPE (fn
);
15078 if (BASELINK_P (baselink
))
15080 /* Add back the template arguments, if present. */
15082 BASELINK_FUNCTIONS (baselink
)
15083 = build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fns
, template_args
);
15085 /* Update the conversion operator type. */
15086 BASELINK_OPTYPE (baselink
) = optype
;
15090 object_type
= current_class_type
;
15092 if (qualified_p
|| !dependent_p
)
15094 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
15098 /* We need to call adjust_result_of_qualified_name_lookup in case the
15099 destructor names a base class, but we unset BASELINK_QUALIFIED_P
15100 so that we still get virtual function binding. */
15101 BASELINK_QUALIFIED_P (baselink
) = false;
15107 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
15108 true if the qualified-id will be a postfix-expression in-and-of
15109 itself; false if more of the postfix-expression follows the
15110 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
15114 tsubst_qualified_id (tree qualified_id
, tree args
,
15115 tsubst_flags_t complain
, tree in_decl
,
15116 bool done
, bool address_p
)
15122 tree template_args
;
15123 location_t loc
= UNKNOWN_LOCATION
;
15125 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
15127 /* Figure out what name to look up. */
15128 name
= TREE_OPERAND (qualified_id
, 1);
15129 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
15131 is_template
= true;
15132 loc
= EXPR_LOCATION (name
);
15133 template_args
= TREE_OPERAND (name
, 1);
15135 template_args
= tsubst_template_args (template_args
, args
,
15136 complain
, in_decl
);
15137 if (template_args
== error_mark_node
)
15138 return error_mark_node
;
15139 name
= TREE_OPERAND (name
, 0);
15143 is_template
= false;
15144 template_args
= NULL_TREE
;
15147 /* Substitute into the qualifying scope. When there are no ARGS, we
15148 are just trying to simplify a non-dependent expression. In that
15149 case the qualifying scope may be dependent, and, in any case,
15150 substituting will not help. */
15151 scope
= TREE_OPERAND (qualified_id
, 0);
15154 scope
= tsubst (scope
, args
, complain
, in_decl
);
15155 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
15160 if (dependent_scope_p (scope
))
15163 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
15164 tree r
= build_qualified_name (NULL_TREE
, scope
, expr
,
15165 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
15166 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (qualified_id
);
15170 if (!BASELINK_P (name
) && !DECL_P (expr
))
15172 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
15174 /* A BIT_NOT_EXPR is used to represent a destructor. */
15175 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
15177 error ("qualifying type %qT does not match destructor name ~%qT",
15178 scope
, TREE_OPERAND (expr
, 0));
15179 expr
= error_mark_node
;
15182 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
15183 /*is_type_p=*/0, false);
15186 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
15187 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
15188 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
15190 if (complain
& tf_error
)
15192 error ("dependent-name %qE is parsed as a non-type, but "
15193 "instantiation yields a type", qualified_id
);
15194 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
15196 return error_mark_node
;
15202 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
15204 /* Remember that there was a reference to this entity. */
15205 if (!mark_used (expr
, complain
) && !(complain
& tf_error
))
15206 return error_mark_node
;
15209 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
15211 if (complain
& tf_error
)
15212 qualified_name_lookup_error (scope
,
15213 TREE_OPERAND (qualified_id
, 1),
15214 expr
, input_location
);
15215 return error_mark_node
;
15220 /* We may be repeating a check already done during parsing, but
15221 if it was well-formed and passed then, it will pass again
15222 now, and if it didn't, we wouldn't have got here. The case
15223 we want to catch is when we couldn't tell then, and can now,
15224 namely when templ prior to substitution was an
15226 if (flag_concepts
&& check_auto_in_tmpl_args (expr
, template_args
))
15227 return error_mark_node
;
15229 if (variable_template_p (expr
))
15230 expr
= lookup_and_finish_template_variable (expr
, template_args
,
15233 expr
= lookup_template_function (expr
, template_args
);
15236 if (expr
== error_mark_node
&& complain
& tf_error
)
15237 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
15238 expr
, input_location
);
15239 else if (TYPE_P (scope
))
15241 expr
= (adjust_result_of_qualified_name_lookup
15242 (expr
, scope
, current_nonlambda_class_type ()));
15243 expr
= (finish_qualified_id_expr
15244 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
15245 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
15246 /*template_arg_p=*/false, complain
));
15249 /* Expressions do not generally have reference type. */
15250 if (TREE_CODE (expr
) != SCOPE_REF
15251 /* However, if we're about to form a pointer-to-member, we just
15252 want the referenced member referenced. */
15253 && TREE_CODE (expr
) != OFFSET_REF
)
15254 expr
= convert_from_reference (expr
);
15256 if (REF_PARENTHESIZED_P (qualified_id
))
15257 expr
= force_paren_expr (expr
);
15262 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
15263 initializer, DECL is the substituted VAR_DECL. Other arguments are as
15267 tsubst_init (tree init
, tree decl
, tree args
,
15268 tsubst_flags_t complain
, tree in_decl
)
15273 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
15275 if (!init
&& TREE_TYPE (decl
) != error_mark_node
)
15277 /* If we had an initializer but it
15278 instantiated to nothing,
15279 value-initialize the object. This will
15280 only occur when the initializer was a
15281 pack expansion where the parameter packs
15282 used in that expansion were of length
15284 init
= build_value_init (TREE_TYPE (decl
),
15286 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
15287 init
= get_target_expr_sfinae (init
, complain
);
15288 if (TREE_CODE (init
) == TARGET_EXPR
)
15289 TARGET_EXPR_DIRECT_INIT_P (init
) = true;
15295 /* Like tsubst, but deals with expressions. This function just replaces
15296 template parms; to finish processing the resultant expression, use
15297 tsubst_copy_and_build or tsubst_expr. */
15300 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
15302 enum tree_code code
;
15305 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
15308 code
= TREE_CODE (t
);
15313 r
= retrieve_local_specialization (t
);
15315 if (r
== NULL_TREE
)
15317 /* We get here for a use of 'this' in an NSDMI. */
15318 if (DECL_NAME (t
) == this_identifier
&& current_class_ptr
)
15319 return current_class_ptr
;
15321 /* This can happen for a parameter name used later in a function
15322 declaration (such as in a late-specified return type). Just
15323 make a dummy decl, since it's only used for its type. */
15324 gcc_assert (cp_unevaluated_operand
!= 0);
15325 r
= tsubst_decl (t
, args
, complain
);
15326 /* Give it the template pattern as its context; its true context
15327 hasn't been instantiated yet and this is good enough for
15329 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
15332 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
15333 r
= argument_pack_select_arg (r
);
15334 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
15335 return error_mark_node
;
15343 if (DECL_TEMPLATE_PARM_P (t
))
15344 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
15345 /* There is no need to substitute into namespace-scope
15347 if (DECL_NAMESPACE_SCOPE_P (t
))
15349 /* If ARGS is NULL, then T is known to be non-dependent. */
15350 if (args
== NULL_TREE
)
15351 return scalar_constant_value (t
);
15353 /* Unfortunately, we cannot just call lookup_name here.
15356 template <int I> int f() {
15358 struct S { void g() { E e = a; } };
15361 When we instantiate f<7>::S::g(), say, lookup_name is not
15362 clever enough to find f<7>::a. */
15364 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
15365 /*entering_scope=*/0);
15367 for (v
= TYPE_VALUES (enum_type
);
15369 v
= TREE_CHAIN (v
))
15370 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
15371 return TREE_VALUE (v
);
15373 /* We didn't find the name. That should never happen; if
15374 name-lookup found it during preliminary parsing, we
15375 should find it again here during instantiation. */
15376 gcc_unreachable ();
15381 if (DECL_CONTEXT (t
))
15385 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
15386 /*entering_scope=*/1);
15387 if (ctx
!= DECL_CONTEXT (t
))
15389 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
15392 if (complain
& tf_error
)
15393 error ("using invalid field %qD", t
);
15394 return error_mark_node
;
15403 case FUNCTION_DECL
:
15404 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
15405 r
= tsubst (t
, args
, complain
, in_decl
);
15406 else if (local_variable_p (t
)
15407 && uses_template_parms (DECL_CONTEXT (t
)))
15409 r
= retrieve_local_specialization (t
);
15410 if (r
== NULL_TREE
)
15412 /* First try name lookup to find the instantiation. */
15413 r
= lookup_name (DECL_NAME (t
));
15414 if (r
&& !is_capture_proxy (r
))
15416 /* Make sure that the one we found is the one we want. */
15417 tree ctx
= enclosing_instantiation_of (DECL_CONTEXT (t
));
15418 if (ctx
!= DECL_CONTEXT (r
))
15426 /* This can happen for a variable used in a
15427 late-specified return type of a local lambda, or for a
15428 local static or constant. Building a new VAR_DECL
15429 should be OK in all those cases. */
15430 r
= tsubst_decl (t
, args
, complain
);
15431 if (local_specializations
)
15432 /* Avoid infinite recursion (79640). */
15433 register_local_specialization (r
, t
);
15434 if (decl_maybe_constant_var_p (r
))
15436 /* We can't call cp_finish_decl, so handle the
15437 initializer by hand. */
15438 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
15439 complain
, in_decl
);
15440 if (!processing_template_decl
)
15441 init
= maybe_constant_init (init
);
15442 if (processing_template_decl
15443 ? potential_constant_expression (init
)
15444 : reduced_constant_expression_p (init
))
15445 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
15446 = TREE_CONSTANT (r
) = true;
15447 DECL_INITIAL (r
) = init
;
15448 if (tree auto_node
= type_uses_auto (TREE_TYPE (r
)))
15450 = do_auto_deduction (TREE_TYPE (r
), init
, auto_node
,
15451 complain
, adc_variable_type
);
15453 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
15454 || decl_constant_var_p (r
)
15455 || errorcount
|| sorrycount
);
15456 if (!processing_template_decl
15457 && !TREE_STATIC (r
))
15458 r
= process_outer_var_ref (r
, complain
);
15460 /* Remember this for subsequent uses. */
15461 if (local_specializations
)
15462 register_local_specialization (r
, t
);
15464 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
15465 r
= argument_pack_select_arg (r
);
15469 if (!mark_used (r
, complain
))
15470 return error_mark_node
;
15473 case NAMESPACE_DECL
:
15477 /* An OVERLOAD will always be a non-dependent overload set; an
15478 overload set from function scope will just be represented with an
15479 IDENTIFIER_NODE, and from class scope with a BASELINK. */
15480 gcc_assert (!uses_template_parms (t
));
15481 /* We must have marked any lookups as persistent. */
15482 gcc_assert (!OVL_LOOKUP_P (t
) || OVL_USED_P (t
));
15486 return tsubst_baselink (t
, current_nonlambda_class_type (),
15487 args
, complain
, in_decl
);
15489 case TEMPLATE_DECL
:
15490 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
15491 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
15492 args
, complain
, in_decl
);
15493 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
15494 return tsubst (t
, args
, complain
, in_decl
);
15495 else if (DECL_CLASS_SCOPE_P (t
)
15496 && uses_template_parms (DECL_CONTEXT (t
)))
15498 /* Template template argument like the following example need
15501 template <template <class> class TT> struct C {};
15502 template <class T> struct D {
15503 template <class U> struct E {};
15508 We are processing the template argument `E' in #1 for
15509 the template instantiation #2. Originally, `E' is a
15510 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
15511 have to substitute this with one having context `D<int>'. */
15513 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
15514 if (dependent_scope_p (context
))
15516 /* When rewriting a constructor into a deduction guide, a
15517 non-dependent name can become dependent, so memtmpl<args>
15518 becomes context::template memtmpl<args>. */
15519 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15520 return build_qualified_name (type
, context
, DECL_NAME (t
),
15523 return lookup_field (context
, DECL_NAME(t
), 0, false);
15526 /* Ordinary template template argument. */
15529 case NON_LVALUE_EXPR
:
15530 case VIEW_CONVERT_EXPR
:
15532 /* Handle location wrappers by substituting the wrapped node
15533 first, *then* reusing the resulting type. Doing the type
15534 first ensures that we handle template parameters and
15535 parameter pack expansions. */
15536 gcc_assert (location_wrapper_p (t
));
15537 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15538 return maybe_wrap_with_location (op0
, EXPR_LOCATION (t
));
15542 case REINTERPRET_CAST_EXPR
:
15543 case CONST_CAST_EXPR
:
15544 case STATIC_CAST_EXPR
:
15545 case DYNAMIC_CAST_EXPR
:
15546 case IMPLICIT_CONV_EXPR
:
15550 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15551 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15552 return build1 (code
, type
, op0
);
15556 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0))
15557 || ARGUMENT_PACK_P (TREE_OPERAND (t
, 0)))
15559 tree expanded
, op
= TREE_OPERAND (t
, 0);
15562 if (SIZEOF_EXPR_TYPE_P (t
))
15563 op
= TREE_TYPE (op
);
15565 ++cp_unevaluated_operand
;
15566 ++c_inhibit_evaluation_warnings
;
15567 /* We only want to compute the number of arguments. */
15568 if (PACK_EXPANSION_P (op
))
15569 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
15571 expanded
= tsubst_template_args (ARGUMENT_PACK_ARGS (op
),
15572 args
, complain
, in_decl
);
15573 --cp_unevaluated_operand
;
15574 --c_inhibit_evaluation_warnings
;
15576 if (TREE_CODE (expanded
) == TREE_VEC
)
15578 len
= TREE_VEC_LENGTH (expanded
);
15579 /* Set TREE_USED for the benefit of -Wunused. */
15580 for (int i
= 0; i
< len
; i
++)
15581 if (DECL_P (TREE_VEC_ELT (expanded
, i
)))
15582 TREE_USED (TREE_VEC_ELT (expanded
, i
)) = true;
15585 if (expanded
== error_mark_node
)
15586 return error_mark_node
;
15587 else if (PACK_EXPANSION_P (expanded
)
15588 || (TREE_CODE (expanded
) == TREE_VEC
15589 && pack_expansion_args_count (expanded
)))
15592 if (PACK_EXPANSION_P (expanded
))
15594 else if (TREE_VEC_LENGTH (expanded
) == 1)
15595 expanded
= TREE_VEC_ELT (expanded
, 0);
15597 expanded
= make_argument_pack (expanded
);
15599 if (TYPE_P (expanded
))
15600 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
15601 complain
& tf_error
);
15603 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
15604 complain
& tf_error
);
15607 return build_int_cst (size_type_node
, len
);
15609 if (SIZEOF_EXPR_TYPE_P (t
))
15611 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
15612 args
, complain
, in_decl
);
15613 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
15614 r
= build1 (SIZEOF_EXPR
,
15615 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
15616 SIZEOF_EXPR_TYPE_P (r
) = 1;
15623 case TRUTH_NOT_EXPR
:
15626 case UNARY_PLUS_EXPR
: /* Unary + */
15628 case AT_ENCODE_EXPR
:
15632 case REALPART_EXPR
:
15633 case IMAGPART_EXPR
:
15636 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15637 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15638 return build1 (code
, type
, op0
);
15641 case COMPONENT_REF
:
15646 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15647 name
= TREE_OPERAND (t
, 1);
15648 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
15650 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
15651 complain
, in_decl
);
15652 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
15654 else if (TREE_CODE (name
) == SCOPE_REF
15655 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
15657 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
15658 complain
, in_decl
);
15659 name
= TREE_OPERAND (name
, 1);
15660 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
15661 complain
, in_decl
);
15662 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
15663 name
= build_qualified_name (/*type=*/NULL_TREE
,
15665 /*template_p=*/false);
15667 else if (BASELINK_P (name
))
15668 name
= tsubst_baselink (name
,
15669 non_reference (TREE_TYPE (object
)),
15673 name
= tsubst_copy (name
, args
, complain
, in_decl
);
15674 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
15680 case TRUNC_DIV_EXPR
:
15681 case CEIL_DIV_EXPR
:
15682 case FLOOR_DIV_EXPR
:
15683 case ROUND_DIV_EXPR
:
15684 case EXACT_DIV_EXPR
:
15688 case TRUNC_MOD_EXPR
:
15689 case FLOOR_MOD_EXPR
:
15690 case TRUTH_ANDIF_EXPR
:
15691 case TRUTH_ORIF_EXPR
:
15692 case TRUTH_AND_EXPR
:
15693 case TRUTH_OR_EXPR
:
15706 case COMPOUND_EXPR
:
15709 case PREDECREMENT_EXPR
:
15710 case PREINCREMENT_EXPR
:
15711 case POSTDECREMENT_EXPR
:
15712 case POSTINCREMENT_EXPR
:
15714 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15715 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15716 return build_nt (code
, op0
, op1
);
15721 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15722 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15723 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
15724 QUALIFIED_NAME_IS_TEMPLATE (t
));
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_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
15736 int n
= VL_EXP_OPERAND_LENGTH (t
);
15737 tree result
= build_vl_exp (CALL_EXPR
, n
);
15739 for (i
= 0; i
< n
; i
++)
15740 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
15741 complain
, in_decl
);
15747 case PSEUDO_DTOR_EXPR
:
15748 case VEC_PERM_EXPR
:
15750 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15751 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15752 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
15753 r
= build_nt (code
, op0
, op1
, op2
);
15754 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
15760 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15761 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15762 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
15763 r
= build_nt (code
, op0
, op1
, op2
);
15764 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
15770 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15771 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15772 r
= build_nt (code
, op0
, op1
);
15773 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
15774 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
15778 case TEMPLATE_ID_EXPR
:
15780 /* Substituted template arguments */
15781 tree fn
= TREE_OPERAND (t
, 0);
15782 tree targs
= TREE_OPERAND (t
, 1);
15784 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
15786 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
15788 return lookup_template_function (fn
, targs
);
15793 tree purpose
, value
, chain
;
15795 if (t
== void_list_node
)
15798 purpose
= TREE_PURPOSE (t
);
15800 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
15801 value
= TREE_VALUE (t
);
15803 value
= tsubst_copy (value
, args
, complain
, in_decl
);
15804 chain
= TREE_CHAIN (t
);
15805 if (chain
&& chain
!= void_type_node
)
15806 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
15807 if (purpose
== TREE_PURPOSE (t
)
15808 && value
== TREE_VALUE (t
)
15809 && chain
== TREE_CHAIN (t
))
15811 return tree_cons (purpose
, value
, chain
);
15816 case ENUMERAL_TYPE
:
15818 case TEMPLATE_TYPE_PARM
:
15819 case TEMPLATE_TEMPLATE_PARM
:
15820 case BOUND_TEMPLATE_TEMPLATE_PARM
:
15821 case TEMPLATE_PARM_INDEX
:
15823 case REFERENCE_TYPE
:
15825 case FUNCTION_TYPE
:
15828 case TYPENAME_TYPE
:
15829 case UNBOUND_CLASS_TEMPLATE
:
15831 case DECLTYPE_TYPE
:
15833 return tsubst (t
, args
, complain
, in_decl
);
15837 /* Fall through. */
15838 case IDENTIFIER_NODE
:
15839 if (IDENTIFIER_CONV_OP_P (t
))
15841 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15842 return make_conv_op_name (new_type
);
15848 /* This is handled by tsubst_copy_and_build. */
15849 gcc_unreachable ();
15853 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15854 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15855 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
15858 case CLEANUP_POINT_EXPR
:
15859 /* We shouldn't have built any of these during initial template
15860 generation. Instead, they should be built during instantiation
15861 in response to the saved STMT_IS_FULL_EXPR_P setting. */
15862 gcc_unreachable ();
15866 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15867 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15868 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15869 r
= build2 (code
, type
, op0
, op1
);
15870 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
15871 if (!mark_used (TREE_OPERAND (r
, 1), complain
)
15872 && !(complain
& tf_error
))
15873 return error_mark_node
;
15877 case EXPR_PACK_EXPANSION
:
15878 error ("invalid use of pack expansion expression");
15879 return error_mark_node
;
15881 case NONTYPE_ARGUMENT_PACK
:
15882 error ("use %<...%> to expand argument pack");
15883 return error_mark_node
;
15886 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
15894 /* Instantiate any typedefs in the type. */
15895 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15896 r
= fold_convert (type
, t
);
15897 gcc_assert (TREE_CODE (r
) == code
);
15902 /* These can sometimes show up in a partial instantiation, but never
15903 involve template parms. */
15904 gcc_assert (!uses_template_parms (t
));
15907 case UNARY_LEFT_FOLD_EXPR
:
15908 return tsubst_unary_left_fold (t
, args
, complain
, in_decl
);
15909 case UNARY_RIGHT_FOLD_EXPR
:
15910 return tsubst_unary_right_fold (t
, args
, complain
, in_decl
);
15911 case BINARY_LEFT_FOLD_EXPR
:
15912 return tsubst_binary_left_fold (t
, args
, complain
, in_decl
);
15913 case BINARY_RIGHT_FOLD_EXPR
:
15914 return tsubst_binary_right_fold (t
, args
, complain
, in_decl
);
15918 case DEBUG_BEGIN_STMT
:
15919 /* ??? There's no point in copying it for now, but maybe some
15920 day it will contain more information, such as a pointer back
15921 to the containing function, inlined copy or so. */
15925 /* We shouldn't get here, but keep going if !flag_checking. */
15927 gcc_unreachable ();
15932 /* Helper function for tsubst_omp_clauses, used for instantiation of
15933 OMP_CLAUSE_DECL of clauses. */
15936 tsubst_omp_clause_decl (tree decl
, tree args
, tsubst_flags_t complain
,
15939 if (decl
== NULL_TREE
)
15942 /* Handle an OpenMP array section represented as a TREE_LIST (or
15943 OMP_CLAUSE_DEPEND_KIND). An OMP_CLAUSE_DEPEND (with a depend
15944 kind of OMP_CLAUSE_DEPEND_SINK) can also be represented as a
15945 TREE_LIST. We can handle it exactly the same as an array section
15946 (purpose, value, and a chain), even though the nomenclature
15947 (low_bound, length, etc) is different. */
15948 if (TREE_CODE (decl
) == TREE_LIST
)
15951 = tsubst_expr (TREE_PURPOSE (decl
), args
, complain
, in_decl
,
15952 /*integral_constant_expression_p=*/false);
15953 tree length
= tsubst_expr (TREE_VALUE (decl
), args
, complain
, in_decl
,
15954 /*integral_constant_expression_p=*/false);
15955 tree chain
= tsubst_omp_clause_decl (TREE_CHAIN (decl
), args
, complain
,
15957 if (TREE_PURPOSE (decl
) == low_bound
15958 && TREE_VALUE (decl
) == length
15959 && TREE_CHAIN (decl
) == chain
)
15961 tree ret
= tree_cons (low_bound
, length
, chain
);
15962 OMP_CLAUSE_DEPEND_SINK_NEGATIVE (ret
)
15963 = OMP_CLAUSE_DEPEND_SINK_NEGATIVE (decl
);
15966 tree ret
= tsubst_expr (decl
, args
, complain
, in_decl
,
15967 /*integral_constant_expression_p=*/false);
15968 /* Undo convert_from_reference tsubst_expr could have called. */
15970 && REFERENCE_REF_P (ret
)
15971 && !REFERENCE_REF_P (decl
))
15972 ret
= TREE_OPERAND (ret
, 0);
15976 /* Like tsubst_copy, but specifically for OpenMP clauses. */
15979 tsubst_omp_clauses (tree clauses
, enum c_omp_region_type ort
,
15980 tree args
, tsubst_flags_t complain
, tree in_decl
)
15982 tree new_clauses
= NULL_TREE
, nc
, oc
;
15983 tree linear_no_step
= NULL_TREE
;
15985 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
15987 nc
= copy_node (oc
);
15988 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
15991 switch (OMP_CLAUSE_CODE (nc
))
15993 case OMP_CLAUSE_LASTPRIVATE
:
15994 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
15996 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
15997 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
15998 in_decl
, /*integral_constant_expression_p=*/false);
15999 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
16000 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
16003 case OMP_CLAUSE_PRIVATE
:
16004 case OMP_CLAUSE_SHARED
:
16005 case OMP_CLAUSE_FIRSTPRIVATE
:
16006 case OMP_CLAUSE_COPYIN
:
16007 case OMP_CLAUSE_COPYPRIVATE
:
16008 case OMP_CLAUSE_UNIFORM
:
16009 case OMP_CLAUSE_DEPEND
:
16010 case OMP_CLAUSE_FROM
:
16011 case OMP_CLAUSE_TO
:
16012 case OMP_CLAUSE_MAP
:
16013 case OMP_CLAUSE_USE_DEVICE_PTR
:
16014 case OMP_CLAUSE_IS_DEVICE_PTR
:
16015 OMP_CLAUSE_DECL (nc
)
16016 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
16019 case OMP_CLAUSE_TILE
:
16020 case OMP_CLAUSE_IF
:
16021 case OMP_CLAUSE_NUM_THREADS
:
16022 case OMP_CLAUSE_SCHEDULE
:
16023 case OMP_CLAUSE_COLLAPSE
:
16024 case OMP_CLAUSE_FINAL
:
16025 case OMP_CLAUSE_DEVICE
:
16026 case OMP_CLAUSE_DIST_SCHEDULE
:
16027 case OMP_CLAUSE_NUM_TEAMS
:
16028 case OMP_CLAUSE_THREAD_LIMIT
:
16029 case OMP_CLAUSE_SAFELEN
:
16030 case OMP_CLAUSE_SIMDLEN
:
16031 case OMP_CLAUSE_NUM_TASKS
:
16032 case OMP_CLAUSE_GRAINSIZE
:
16033 case OMP_CLAUSE_PRIORITY
:
16034 case OMP_CLAUSE_ORDERED
:
16035 case OMP_CLAUSE_HINT
:
16036 case OMP_CLAUSE_NUM_GANGS
:
16037 case OMP_CLAUSE_NUM_WORKERS
:
16038 case OMP_CLAUSE_VECTOR_LENGTH
:
16039 case OMP_CLAUSE_WORKER
:
16040 case OMP_CLAUSE_VECTOR
:
16041 case OMP_CLAUSE_ASYNC
:
16042 case OMP_CLAUSE_WAIT
:
16043 OMP_CLAUSE_OPERAND (nc
, 0)
16044 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
16045 in_decl
, /*integral_constant_expression_p=*/false);
16047 case OMP_CLAUSE_REDUCTION
:
16048 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
16050 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
16051 if (TREE_CODE (placeholder
) == SCOPE_REF
)
16053 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
16054 complain
, in_decl
);
16055 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
16056 = build_qualified_name (NULL_TREE
, scope
,
16057 TREE_OPERAND (placeholder
, 1),
16061 gcc_assert (identifier_p (placeholder
));
16063 OMP_CLAUSE_DECL (nc
)
16064 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
16067 case OMP_CLAUSE_GANG
:
16068 case OMP_CLAUSE_ALIGNED
:
16069 OMP_CLAUSE_DECL (nc
)
16070 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
16072 OMP_CLAUSE_OPERAND (nc
, 1)
16073 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
16074 in_decl
, /*integral_constant_expression_p=*/false);
16076 case OMP_CLAUSE_LINEAR
:
16077 OMP_CLAUSE_DECL (nc
)
16078 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
16080 if (OMP_CLAUSE_LINEAR_STEP (oc
) == NULL_TREE
)
16082 gcc_assert (!linear_no_step
);
16083 linear_no_step
= nc
;
16085 else if (OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (oc
))
16086 OMP_CLAUSE_LINEAR_STEP (nc
)
16087 = tsubst_omp_clause_decl (OMP_CLAUSE_LINEAR_STEP (oc
), args
,
16088 complain
, in_decl
);
16090 OMP_CLAUSE_LINEAR_STEP (nc
)
16091 = tsubst_expr (OMP_CLAUSE_LINEAR_STEP (oc
), args
, complain
,
16093 /*integral_constant_expression_p=*/false);
16095 case OMP_CLAUSE_NOWAIT
:
16096 case OMP_CLAUSE_DEFAULT
:
16097 case OMP_CLAUSE_UNTIED
:
16098 case OMP_CLAUSE_MERGEABLE
:
16099 case OMP_CLAUSE_INBRANCH
:
16100 case OMP_CLAUSE_NOTINBRANCH
:
16101 case OMP_CLAUSE_PROC_BIND
:
16102 case OMP_CLAUSE_FOR
:
16103 case OMP_CLAUSE_PARALLEL
:
16104 case OMP_CLAUSE_SECTIONS
:
16105 case OMP_CLAUSE_TASKGROUP
:
16106 case OMP_CLAUSE_NOGROUP
:
16107 case OMP_CLAUSE_THREADS
:
16108 case OMP_CLAUSE_SIMD
:
16109 case OMP_CLAUSE_DEFAULTMAP
:
16110 case OMP_CLAUSE_INDEPENDENT
:
16111 case OMP_CLAUSE_AUTO
:
16112 case OMP_CLAUSE_SEQ
:
16115 gcc_unreachable ();
16117 if ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
)
16118 switch (OMP_CLAUSE_CODE (nc
))
16120 case OMP_CLAUSE_SHARED
:
16121 case OMP_CLAUSE_PRIVATE
:
16122 case OMP_CLAUSE_FIRSTPRIVATE
:
16123 case OMP_CLAUSE_LASTPRIVATE
:
16124 case OMP_CLAUSE_COPYPRIVATE
:
16125 case OMP_CLAUSE_LINEAR
:
16126 case OMP_CLAUSE_REDUCTION
:
16127 case OMP_CLAUSE_USE_DEVICE_PTR
:
16128 case OMP_CLAUSE_IS_DEVICE_PTR
:
16129 /* tsubst_expr on SCOPE_REF results in returning
16130 finish_non_static_data_member result. Undo that here. */
16131 if (TREE_CODE (OMP_CLAUSE_DECL (oc
)) == SCOPE_REF
16132 && (TREE_CODE (TREE_OPERAND (OMP_CLAUSE_DECL (oc
), 1))
16133 == IDENTIFIER_NODE
))
16135 tree t
= OMP_CLAUSE_DECL (nc
);
16138 switch (TREE_CODE (v
))
16140 case COMPONENT_REF
:
16144 case POINTER_PLUS_EXPR
:
16145 v
= TREE_OPERAND (v
, 0);
16148 if (DECL_CONTEXT (v
) == current_function_decl
16149 && DECL_ARTIFICIAL (v
)
16150 && DECL_NAME (v
) == this_identifier
)
16151 OMP_CLAUSE_DECL (nc
) = TREE_OPERAND (t
, 1);
16158 else if (VAR_P (OMP_CLAUSE_DECL (oc
))
16159 && DECL_HAS_VALUE_EXPR_P (OMP_CLAUSE_DECL (oc
))
16160 && DECL_ARTIFICIAL (OMP_CLAUSE_DECL (oc
))
16161 && DECL_LANG_SPECIFIC (OMP_CLAUSE_DECL (oc
))
16162 && DECL_OMP_PRIVATIZED_MEMBER (OMP_CLAUSE_DECL (oc
)))
16164 tree decl
= OMP_CLAUSE_DECL (nc
);
16167 retrofit_lang_decl (decl
);
16168 DECL_OMP_PRIVATIZED_MEMBER (decl
) = 1;
16177 new_clauses
= nreverse (new_clauses
);
16178 if (ort
!= C_ORT_OMP_DECLARE_SIMD
)
16180 new_clauses
= finish_omp_clauses (new_clauses
, ort
);
16181 if (linear_no_step
)
16182 for (nc
= new_clauses
; nc
; nc
= OMP_CLAUSE_CHAIN (nc
))
16183 if (nc
== linear_no_step
)
16185 OMP_CLAUSE_LINEAR_STEP (nc
) = NULL_TREE
;
16189 return new_clauses
;
16192 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
16195 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
16198 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
16200 tree purpose
, value
, chain
;
16205 if (TREE_CODE (t
) != TREE_LIST
)
16206 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
16207 /*function_p=*/false,
16208 /*integral_constant_expression_p=*/false);
16210 if (t
== void_list_node
)
16213 purpose
= TREE_PURPOSE (t
);
16215 purpose
= RECUR (purpose
);
16216 value
= TREE_VALUE (t
);
16219 if (TREE_CODE (value
) != LABEL_DECL
)
16220 value
= RECUR (value
);
16223 value
= lookup_label (DECL_NAME (value
));
16224 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
16225 TREE_USED (value
) = 1;
16228 chain
= TREE_CHAIN (t
);
16229 if (chain
&& chain
!= void_type_node
)
16230 chain
= RECUR (chain
);
16231 return tree_cons (purpose
, value
, chain
);
16235 /* Used to temporarily communicate the list of #pragma omp parallel
16236 clauses to #pragma omp for instantiation if they are combined
16239 static tree
*omp_parallel_combined_clauses
;
16241 /* Substitute one OMP_FOR iterator. */
16244 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree orig_declv
,
16245 tree initv
, tree condv
, tree incrv
, tree
*clauses
,
16246 tree args
, tsubst_flags_t complain
, tree in_decl
,
16247 bool integral_constant_expression_p
)
16249 #define RECUR(NODE) \
16250 tsubst_expr ((NODE), args, complain, in_decl, \
16251 integral_constant_expression_p)
16252 tree decl
, init
, cond
, incr
;
16254 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
16255 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
16257 if (orig_declv
&& OMP_FOR_ORIG_DECLS (t
))
16259 tree o
= TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (t
), i
);
16260 TREE_VEC_ELT (orig_declv
, i
) = RECUR (o
);
16263 decl
= TREE_OPERAND (init
, 0);
16264 init
= TREE_OPERAND (init
, 1);
16265 tree decl_expr
= NULL_TREE
;
16266 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
16268 /* We need to jump through some hoops to handle declarations in the
16269 init-statement, since we might need to handle auto deduction,
16270 but we need to keep control of initialization. */
16272 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
16273 decl
= tsubst_decl (decl
, args
, complain
);
16277 if (TREE_CODE (decl
) == SCOPE_REF
)
16279 decl
= RECUR (decl
);
16280 if (TREE_CODE (decl
) == COMPONENT_REF
)
16284 switch (TREE_CODE (v
))
16286 case COMPONENT_REF
:
16290 case POINTER_PLUS_EXPR
:
16291 v
= TREE_OPERAND (v
, 0);
16294 if (DECL_CONTEXT (v
) == current_function_decl
16295 && DECL_ARTIFICIAL (v
)
16296 && DECL_NAME (v
) == this_identifier
)
16298 decl
= TREE_OPERAND (decl
, 1);
16299 decl
= omp_privatize_field (decl
, false);
16309 decl
= RECUR (decl
);
16311 init
= RECUR (init
);
16313 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
16314 if (auto_node
&& init
)
16316 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
, complain
);
16318 gcc_assert (!type_dependent_expression_p (decl
));
16320 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
16324 /* Declare the variable, but don't let that initialize it. */
16325 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
16326 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
16328 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
16331 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
16332 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
16333 if (TREE_CODE (incr
) == MODIFY_EXPR
)
16335 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
16336 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
16337 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
16338 NOP_EXPR
, rhs
, complain
);
16341 incr
= RECUR (incr
);
16342 TREE_VEC_ELT (declv
, i
) = decl
;
16343 TREE_VEC_ELT (initv
, i
) = init
;
16344 TREE_VEC_ELT (condv
, i
) = cond
;
16345 TREE_VEC_ELT (incrv
, i
) = incr
;
16351 /* Declare and initialize the variable. */
16359 for (j
= (omp_parallel_combined_clauses
== NULL
? 1 : 0); j
< 2; j
++)
16361 for (pc
= j
? clauses
: omp_parallel_combined_clauses
; *pc
; )
16363 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_PRIVATE
16364 && OMP_CLAUSE_DECL (*pc
) == decl
)
16366 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_LASTPRIVATE
16367 && OMP_CLAUSE_DECL (*pc
) == decl
)
16371 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
16373 *pc
= OMP_CLAUSE_CHAIN (c
);
16374 OMP_CLAUSE_CHAIN (c
) = *clauses
;
16377 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_FIRSTPRIVATE
16378 && OMP_CLAUSE_DECL (*pc
) == decl
)
16380 error ("iteration variable %qD should not be firstprivate",
16382 *pc
= OMP_CLAUSE_CHAIN (*pc
);
16384 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_REDUCTION
16385 && OMP_CLAUSE_DECL (*pc
) == decl
)
16387 error ("iteration variable %qD should not be reduction",
16389 *pc
= OMP_CLAUSE_CHAIN (*pc
);
16392 pc
= &OMP_CLAUSE_CHAIN (*pc
);
16397 if (*pc
== NULL_TREE
)
16399 tree c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
16400 OMP_CLAUSE_DECL (c
) = decl
;
16401 c
= finish_omp_clauses (c
, C_ORT_OMP
);
16404 OMP_CLAUSE_CHAIN (c
) = *clauses
;
16409 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
16410 if (COMPARISON_CLASS_P (cond
))
16412 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
16413 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
16414 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
16417 cond
= RECUR (cond
);
16418 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
16419 switch (TREE_CODE (incr
))
16421 case PREINCREMENT_EXPR
:
16422 case PREDECREMENT_EXPR
:
16423 case POSTINCREMENT_EXPR
:
16424 case POSTDECREMENT_EXPR
:
16425 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
16426 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
16429 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
16430 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
16432 tree rhs
= TREE_OPERAND (incr
, 1);
16433 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
16434 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
16435 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
16436 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
16437 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
16441 incr
= RECUR (incr
);
16444 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
16445 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
16447 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
16448 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
16449 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
16450 TREE_TYPE (decl
), lhs
,
16451 RECUR (TREE_OPERAND (incr
, 2))));
16453 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
16454 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
16455 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
16457 tree rhs
= TREE_OPERAND (incr
, 2);
16458 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
16459 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
16460 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
16461 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
16462 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
16466 incr
= RECUR (incr
);
16469 incr
= RECUR (incr
);
16473 TREE_VEC_ELT (declv
, i
) = decl
;
16474 TREE_VEC_ELT (initv
, i
) = init
;
16475 TREE_VEC_ELT (condv
, i
) = cond
;
16476 TREE_VEC_ELT (incrv
, i
) = incr
;
16480 /* Helper function of tsubst_expr, find OMP_TEAMS inside
16481 of OMP_TARGET's body. */
16484 tsubst_find_omp_teams (tree
*tp
, int *walk_subtrees
, void *)
16486 *walk_subtrees
= 0;
16487 switch (TREE_CODE (*tp
))
16492 case STATEMENT_LIST
:
16493 *walk_subtrees
= 1;
16501 /* Helper function for tsubst_expr. For decomposition declaration
16502 artificial base DECL, which is tsubsted PATTERN_DECL, tsubst
16503 also the corresponding decls representing the identifiers
16504 of the decomposition declaration. Return DECL if successful
16505 or error_mark_node otherwise, set *FIRST to the first decl
16506 in the list chained through DECL_CHAIN and *CNT to the number
16510 tsubst_decomp_names (tree decl
, tree pattern_decl
, tree args
,
16511 tsubst_flags_t complain
, tree in_decl
, tree
*first
,
16514 tree decl2
, decl3
, prev
= decl
;
16516 gcc_assert (DECL_NAME (decl
) == NULL_TREE
);
16517 for (decl2
= DECL_CHAIN (pattern_decl
);
16520 && DECL_DECOMPOSITION_P (decl2
)
16521 && DECL_NAME (decl2
);
16522 decl2
= DECL_CHAIN (decl2
))
16524 if (TREE_TYPE (decl2
) == error_mark_node
&& *cnt
== 0)
16526 gcc_assert (errorcount
);
16527 return error_mark_node
;
16530 gcc_assert (DECL_DECOMP_BASE (decl2
) == pattern_decl
);
16531 gcc_assert (DECL_HAS_VALUE_EXPR_P (decl2
));
16532 tree v
= DECL_VALUE_EXPR (decl2
);
16533 DECL_HAS_VALUE_EXPR_P (decl2
) = 0;
16534 SET_DECL_VALUE_EXPR (decl2
, NULL_TREE
);
16535 decl3
= tsubst (decl2
, args
, complain
, in_decl
);
16536 SET_DECL_VALUE_EXPR (decl2
, v
);
16537 DECL_HAS_VALUE_EXPR_P (decl2
) = 1;
16539 DECL_TEMPLATE_INSTANTIATED (decl3
) = 1;
16542 gcc_assert (errorcount
);
16543 decl
= error_mark_node
;
16546 maybe_push_decl (decl3
);
16547 if (error_operand_p (decl3
))
16548 decl
= error_mark_node
;
16549 else if (decl
!= error_mark_node
16550 && DECL_CHAIN (decl3
) != prev
16553 gcc_assert (errorcount
);
16554 decl
= error_mark_node
;
16563 /* Like tsubst_copy for expressions, etc. but also does semantic
16567 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
16568 bool integral_constant_expression_p
)
16570 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
16571 #define RECUR(NODE) \
16572 tsubst_expr ((NODE), args, complain, in_decl, \
16573 integral_constant_expression_p)
16579 if (t
== NULL_TREE
|| t
== error_mark_node
)
16582 loc
= input_location
;
16583 if (EXPR_HAS_LOCATION (t
))
16584 input_location
= EXPR_LOCATION (t
);
16585 if (STATEMENT_CODE_P (TREE_CODE (t
)))
16586 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
16588 switch (TREE_CODE (t
))
16590 case STATEMENT_LIST
:
16592 tree_stmt_iterator i
;
16593 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
16594 RECUR (tsi_stmt (i
));
16598 case CTOR_INITIALIZER
:
16599 finish_mem_initializers (tsubst_initializer_list
16600 (TREE_OPERAND (t
, 0), args
));
16604 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
16608 tmp
= RECUR (EXPR_STMT_EXPR (t
));
16609 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
16610 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
16612 finish_expr_stmt (tmp
);
16616 finish_local_using_directive (USING_STMT_NAMESPACE (t
),
16617 /*attribs=*/NULL_TREE
);
16622 tree decl
, pattern_decl
;
16625 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
16626 if (TREE_CODE (decl
) == LABEL_DECL
)
16627 finish_label_decl (DECL_NAME (decl
));
16628 else if (TREE_CODE (decl
) == USING_DECL
)
16630 tree scope
= USING_DECL_SCOPE (decl
);
16631 tree name
= DECL_NAME (decl
);
16633 scope
= tsubst (scope
, args
, complain
, in_decl
);
16634 decl
= lookup_qualified_name (scope
, name
,
16635 /*is_type_p=*/false,
16636 /*complain=*/false);
16637 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
16638 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
16640 finish_local_using_decl (decl
, scope
, name
);
16642 else if (is_capture_proxy (decl
)
16643 && !DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
16645 /* We're in tsubst_lambda_expr, we've already inserted a new
16646 capture proxy, so look it up and register it. */
16648 if (DECL_PACK_P (decl
))
16650 inst
= (retrieve_local_specialization
16651 (DECL_CAPTURED_VARIABLE (decl
)));
16652 gcc_assert (TREE_CODE (inst
) == NONTYPE_ARGUMENT_PACK
);
16656 inst
= lookup_name_real (DECL_NAME (decl
), 0, 0,
16657 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
16658 gcc_assert (inst
!= decl
&& is_capture_proxy (inst
));
16660 register_local_specialization (inst
, decl
);
16663 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
16664 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
16665 /* Don't copy the old closure; we'll create a new one in
16666 tsubst_lambda_expr. */
16670 init
= DECL_INITIAL (decl
);
16671 decl
= tsubst (decl
, args
, complain
, in_decl
);
16672 if (decl
!= error_mark_node
)
16674 /* By marking the declaration as instantiated, we avoid
16675 trying to instantiate it. Since instantiate_decl can't
16676 handle local variables, and since we've already done
16677 all that needs to be done, that's the right thing to
16680 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
16682 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
16683 /* Anonymous aggregates are a special case. */
16684 finish_anon_union (decl
);
16685 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
16687 DECL_CONTEXT (decl
) = current_function_decl
;
16688 if (DECL_NAME (decl
) == this_identifier
)
16690 tree lam
= DECL_CONTEXT (current_function_decl
);
16691 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
16692 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
16694 insert_capture_proxy (decl
);
16696 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
16697 /* We already did a pushtag. */;
16698 else if (TREE_CODE (decl
) == FUNCTION_DECL
16699 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
16700 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
16702 DECL_CONTEXT (decl
) = NULL_TREE
;
16704 DECL_CONTEXT (decl
) = current_function_decl
;
16705 cp_check_omp_declare_reduction (decl
);
16709 int const_init
= false;
16710 maybe_push_decl (decl
);
16712 && DECL_PRETTY_FUNCTION_P (decl
))
16714 /* For __PRETTY_FUNCTION__ we have to adjust the
16716 const char *const name
16717 = cxx_printable_name (current_function_decl
, 2);
16718 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
16721 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
16724 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
16727 && DECL_DECOMPOSITION_P (decl
)
16728 && TREE_TYPE (pattern_decl
) != error_mark_node
)
16733 = tsubst_decomp_names (decl
, pattern_decl
, args
,
16734 complain
, in_decl
, &first
, &cnt
);
16735 if (ndecl
!= error_mark_node
)
16736 cp_maybe_mangle_decomp (ndecl
, first
, cnt
);
16737 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
16738 if (ndecl
!= error_mark_node
)
16739 cp_finish_decomp (ndecl
, first
, cnt
);
16742 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
16751 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
16752 RECUR (FOR_INIT_STMT (t
));
16753 finish_init_stmt (stmt
);
16754 tmp
= RECUR (FOR_COND (t
));
16755 finish_for_cond (tmp
, stmt
, false, 0);
16756 tmp
= RECUR (FOR_EXPR (t
));
16757 finish_for_expr (tmp
, stmt
);
16759 bool prev
= note_iteration_stmt_body_start ();
16760 RECUR (FOR_BODY (t
));
16761 note_iteration_stmt_body_end (prev
);
16763 finish_for_stmt (stmt
);
16766 case RANGE_FOR_STMT
:
16768 /* Construct another range_for, if this is not a final
16769 substitution (for inside inside a generic lambda of a
16770 template). Otherwise convert to a regular for. */
16772 stmt
= (processing_template_decl
16773 ? begin_range_for_stmt (NULL_TREE
, NULL_TREE
)
16774 : begin_for_stmt (NULL_TREE
, NULL_TREE
));
16775 decl
= RANGE_FOR_DECL (t
);
16776 decl
= tsubst (decl
, args
, complain
, in_decl
);
16777 maybe_push_decl (decl
);
16778 expr
= RECUR (RANGE_FOR_EXPR (t
));
16780 tree decomp_first
= NULL_TREE
;
16781 unsigned decomp_cnt
= 0;
16782 if (VAR_P (decl
) && DECL_DECOMPOSITION_P (decl
))
16783 decl
= tsubst_decomp_names (decl
, RANGE_FOR_DECL (t
), args
,
16785 &decomp_first
, &decomp_cnt
);
16787 if (processing_template_decl
)
16789 RANGE_FOR_IVDEP (stmt
) = RANGE_FOR_IVDEP (t
);
16790 RANGE_FOR_UNROLL (stmt
) = RANGE_FOR_UNROLL (t
);
16791 finish_range_for_decl (stmt
, decl
, expr
);
16795 unsigned short unroll
= (RANGE_FOR_UNROLL (t
)
16796 ? tree_to_uhwi (RANGE_FOR_UNROLL (t
)) : 0);
16797 stmt
= cp_convert_range_for (stmt
, decl
, expr
,
16798 decomp_first
, decomp_cnt
,
16799 RANGE_FOR_IVDEP (t
), unroll
);
16802 bool prev
= note_iteration_stmt_body_start ();
16803 RECUR (RANGE_FOR_BODY (t
));
16804 note_iteration_stmt_body_end (prev
);
16805 finish_for_stmt (stmt
);
16810 stmt
= begin_while_stmt ();
16811 tmp
= RECUR (WHILE_COND (t
));
16812 finish_while_stmt_cond (tmp
, stmt
, false, 0);
16814 bool prev
= note_iteration_stmt_body_start ();
16815 RECUR (WHILE_BODY (t
));
16816 note_iteration_stmt_body_end (prev
);
16818 finish_while_stmt (stmt
);
16822 stmt
= begin_do_stmt ();
16824 bool prev
= note_iteration_stmt_body_start ();
16825 RECUR (DO_BODY (t
));
16826 note_iteration_stmt_body_end (prev
);
16828 finish_do_body (stmt
);
16829 tmp
= RECUR (DO_COND (t
));
16830 finish_do_stmt (tmp
, stmt
, false, 0);
16834 stmt
= begin_if_stmt ();
16835 IF_STMT_CONSTEXPR_P (stmt
) = IF_STMT_CONSTEXPR_P (t
);
16836 if (IF_STMT_CONSTEXPR_P (t
))
16837 args
= add_extra_args (IF_STMT_EXTRA_ARGS (t
), args
);
16838 tmp
= RECUR (IF_COND (t
));
16839 tmp
= finish_if_stmt_cond (tmp
, stmt
);
16840 if (IF_STMT_CONSTEXPR_P (t
)
16841 && instantiation_dependent_expression_p (tmp
))
16843 /* We're partially instantiating a generic lambda, but the condition
16844 of the constexpr if is still dependent. Don't substitute into the
16845 branches now, just remember the template arguments. */
16846 do_poplevel (IF_SCOPE (stmt
));
16847 IF_COND (stmt
) = IF_COND (t
);
16848 THEN_CLAUSE (stmt
) = THEN_CLAUSE (t
);
16849 ELSE_CLAUSE (stmt
) = ELSE_CLAUSE (t
);
16850 IF_STMT_EXTRA_ARGS (stmt
) = build_extra_args (t
, args
, complain
);
16854 if (IF_STMT_CONSTEXPR_P (t
) && integer_zerop (tmp
))
16855 /* Don't instantiate the THEN_CLAUSE. */;
16858 bool inhibit
= integer_zerop (fold_non_dependent_expr (tmp
));
16860 ++c_inhibit_evaluation_warnings
;
16861 RECUR (THEN_CLAUSE (t
));
16863 --c_inhibit_evaluation_warnings
;
16865 finish_then_clause (stmt
);
16867 if (IF_STMT_CONSTEXPR_P (t
) && integer_nonzerop (tmp
))
16868 /* Don't instantiate the ELSE_CLAUSE. */;
16869 else if (ELSE_CLAUSE (t
))
16871 bool inhibit
= integer_nonzerop (fold_non_dependent_expr (tmp
));
16872 begin_else_clause (stmt
);
16874 ++c_inhibit_evaluation_warnings
;
16875 RECUR (ELSE_CLAUSE (t
));
16877 --c_inhibit_evaluation_warnings
;
16878 finish_else_clause (stmt
);
16881 finish_if_stmt (stmt
);
16885 if (BIND_EXPR_BODY_BLOCK (t
))
16886 stmt
= begin_function_body ();
16888 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
16889 ? BCS_TRY_BLOCK
: 0);
16891 RECUR (BIND_EXPR_BODY (t
));
16893 if (BIND_EXPR_BODY_BLOCK (t
))
16894 finish_function_body (stmt
);
16896 finish_compound_stmt (stmt
);
16900 finish_break_stmt ();
16903 case CONTINUE_STMT
:
16904 finish_continue_stmt ();
16908 stmt
= begin_switch_stmt ();
16909 tmp
= RECUR (SWITCH_STMT_COND (t
));
16910 finish_switch_cond (tmp
, stmt
);
16911 RECUR (SWITCH_STMT_BODY (t
));
16912 finish_switch_stmt (stmt
);
16915 case CASE_LABEL_EXPR
:
16917 tree low
= RECUR (CASE_LOW (t
));
16918 tree high
= RECUR (CASE_HIGH (t
));
16919 tree l
= finish_case_label (EXPR_LOCATION (t
), low
, high
);
16920 if (l
&& TREE_CODE (l
) == CASE_LABEL_EXPR
)
16921 FALLTHROUGH_LABEL_P (CASE_LABEL (l
))
16922 = FALLTHROUGH_LABEL_P (CASE_LABEL (t
));
16928 tree decl
= LABEL_EXPR_LABEL (t
);
16931 label
= finish_label_stmt (DECL_NAME (decl
));
16932 if (TREE_CODE (label
) == LABEL_DECL
)
16933 FALLTHROUGH_LABEL_P (label
) = FALLTHROUGH_LABEL_P (decl
);
16934 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
16935 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
16940 tmp
= GOTO_DESTINATION (t
);
16941 if (TREE_CODE (tmp
) != LABEL_DECL
)
16942 /* Computed goto's must be tsubst'd into. On the other hand,
16943 non-computed gotos must not be; the identifier in question
16944 will have no binding. */
16947 tmp
= DECL_NAME (tmp
);
16948 finish_goto_stmt (tmp
);
16953 tree string
= RECUR (ASM_STRING (t
));
16954 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
16955 complain
, in_decl
);
16956 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
16957 complain
, in_decl
);
16958 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
16959 complain
, in_decl
);
16960 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
16961 complain
, in_decl
);
16962 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
16964 tree asm_expr
= tmp
;
16965 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
16966 asm_expr
= TREE_OPERAND (asm_expr
, 0);
16967 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
16974 stmt
= begin_try_block ();
16975 RECUR (TRY_STMTS (t
));
16976 finish_cleanup_try_block (stmt
);
16977 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
16981 tree compound_stmt
= NULL_TREE
;
16983 if (FN_TRY_BLOCK_P (t
))
16984 stmt
= begin_function_try_block (&compound_stmt
);
16986 stmt
= begin_try_block ();
16988 RECUR (TRY_STMTS (t
));
16990 if (FN_TRY_BLOCK_P (t
))
16991 finish_function_try_block (stmt
);
16993 finish_try_block (stmt
);
16995 RECUR (TRY_HANDLERS (t
));
16996 if (FN_TRY_BLOCK_P (t
))
16997 finish_function_handler_sequence (stmt
, compound_stmt
);
16999 finish_handler_sequence (stmt
);
17005 tree decl
= HANDLER_PARMS (t
);
17009 decl
= tsubst (decl
, args
, complain
, in_decl
);
17010 /* Prevent instantiate_decl from trying to instantiate
17011 this variable. We've already done all that needs to be
17013 if (decl
!= error_mark_node
)
17014 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
17016 stmt
= begin_handler ();
17017 finish_handler_parms (decl
, stmt
);
17018 RECUR (HANDLER_BODY (t
));
17019 finish_handler (stmt
);
17024 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
17025 if (CLASS_TYPE_P (tmp
))
17027 /* Local classes are not independent templates; they are
17028 instantiated along with their containing function. And this
17029 way we don't have to deal with pushing out of one local class
17030 to instantiate a member of another local class. */
17031 /* Closures are handled by the LAMBDA_EXPR. */
17032 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
17033 complete_type (tmp
);
17034 for (tree fld
= TYPE_FIELDS (tmp
); fld
; fld
= DECL_CHAIN (fld
))
17036 || (TREE_CODE (fld
) == FUNCTION_DECL
17037 && !DECL_ARTIFICIAL (fld
)))
17038 && DECL_TEMPLATE_INSTANTIATION (fld
))
17039 instantiate_decl (fld
, /*defer_ok=*/false,
17040 /*expl_inst_class=*/false);
17044 case STATIC_ASSERT
:
17048 ++c_inhibit_evaluation_warnings
;
17050 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
17053 /*integral_constant_expression_p=*/true);
17054 --c_inhibit_evaluation_warnings
;
17056 finish_static_assert (condition
,
17057 STATIC_ASSERT_MESSAGE (t
),
17058 STATIC_ASSERT_SOURCE_LOCATION (t
),
17059 /*member_p=*/false);
17064 case OACC_PARALLEL
:
17065 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), C_ORT_ACC
, args
, complain
,
17067 stmt
= begin_omp_parallel ();
17068 RECUR (OMP_BODY (t
));
17069 finish_omp_construct (TREE_CODE (t
), stmt
, tmp
);
17073 r
= push_omp_privatization_clauses (OMP_PARALLEL_COMBINED (t
));
17074 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), C_ORT_OMP
, args
,
17075 complain
, in_decl
);
17076 if (OMP_PARALLEL_COMBINED (t
))
17077 omp_parallel_combined_clauses
= &tmp
;
17078 stmt
= begin_omp_parallel ();
17079 RECUR (OMP_PARALLEL_BODY (t
));
17080 gcc_assert (omp_parallel_combined_clauses
== NULL
);
17081 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
17082 = OMP_PARALLEL_COMBINED (t
);
17083 pop_omp_privatization_clauses (r
);
17087 r
= push_omp_privatization_clauses (false);
17088 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), C_ORT_OMP
, args
,
17089 complain
, in_decl
);
17090 stmt
= begin_omp_task ();
17091 RECUR (OMP_TASK_BODY (t
));
17092 finish_omp_task (tmp
, stmt
);
17093 pop_omp_privatization_clauses (r
);
17098 case OMP_DISTRIBUTE
:
17102 tree clauses
, body
, pre_body
;
17103 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
17104 tree orig_declv
= NULL_TREE
;
17105 tree incrv
= NULL_TREE
;
17106 enum c_omp_region_type ort
= C_ORT_OMP
;
17109 if (TREE_CODE (t
) == OACC_LOOP
)
17112 r
= push_omp_privatization_clauses (OMP_FOR_INIT (t
) == NULL_TREE
);
17113 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), ort
, args
, complain
,
17115 if (OMP_FOR_INIT (t
) != NULL_TREE
)
17117 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
17118 if (OMP_FOR_ORIG_DECLS (t
))
17119 orig_declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
17120 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
17121 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
17122 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
17125 stmt
= begin_omp_structured_block ();
17127 pre_body
= push_stmt_list ();
17128 RECUR (OMP_FOR_PRE_BODY (t
));
17129 pre_body
= pop_stmt_list (pre_body
);
17131 if (OMP_FOR_INIT (t
) != NULL_TREE
)
17132 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
17133 tsubst_omp_for_iterator (t
, i
, declv
, orig_declv
, initv
, condv
,
17134 incrv
, &clauses
, args
, complain
, in_decl
,
17135 integral_constant_expression_p
);
17136 omp_parallel_combined_clauses
= NULL
;
17138 body
= push_stmt_list ();
17139 RECUR (OMP_FOR_BODY (t
));
17140 body
= pop_stmt_list (body
);
17142 if (OMP_FOR_INIT (t
) != NULL_TREE
)
17143 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
,
17144 orig_declv
, initv
, condv
, incrv
, body
, pre_body
,
17148 t
= make_node (TREE_CODE (t
));
17149 TREE_TYPE (t
) = void_type_node
;
17150 OMP_FOR_BODY (t
) = body
;
17151 OMP_FOR_PRE_BODY (t
) = pre_body
;
17152 OMP_FOR_CLAUSES (t
) = clauses
;
17153 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
17157 add_stmt (finish_omp_structured_block (stmt
));
17158 pop_omp_privatization_clauses (r
);
17163 omp_parallel_combined_clauses
= NULL
;
17168 r
= push_omp_privatization_clauses (TREE_CODE (t
) == OMP_TEAMS
17169 && OMP_TEAMS_COMBINED (t
));
17170 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), C_ORT_OMP
, args
, complain
,
17172 stmt
= push_stmt_list ();
17173 RECUR (OMP_BODY (t
));
17174 stmt
= pop_stmt_list (stmt
);
17177 OMP_BODY (t
) = stmt
;
17178 OMP_CLAUSES (t
) = tmp
;
17180 pop_omp_privatization_clauses (r
);
17184 case OMP_TARGET_DATA
:
17186 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), (TREE_CODE (t
) == OACC_DATA
)
17187 ? C_ORT_ACC
: C_ORT_OMP
, args
, complain
,
17189 keep_next_level (true);
17190 stmt
= begin_omp_structured_block ();
17192 RECUR (OMP_BODY (t
));
17193 stmt
= finish_omp_structured_block (stmt
);
17196 OMP_BODY (t
) = stmt
;
17197 OMP_CLAUSES (t
) = tmp
;
17198 if (TREE_CODE (t
) == OMP_TARGET
&& OMP_TARGET_COMBINED (t
))
17200 tree teams
= cp_walk_tree (&stmt
, tsubst_find_omp_teams
, NULL
, NULL
);
17203 /* For combined target teams, ensure the num_teams and
17204 thread_limit clause expressions are evaluated on the host,
17205 before entering the target construct. */
17207 for (c
= OMP_TEAMS_CLAUSES (teams
);
17208 c
; c
= OMP_CLAUSE_CHAIN (c
))
17209 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_NUM_TEAMS
17210 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_THREAD_LIMIT
)
17211 && TREE_CODE (OMP_CLAUSE_OPERAND (c
, 0)) != INTEGER_CST
)
17213 tree expr
= OMP_CLAUSE_OPERAND (c
, 0);
17214 expr
= force_target_expr (TREE_TYPE (expr
), expr
, tf_none
);
17215 if (expr
== error_mark_node
)
17217 tmp
= TARGET_EXPR_SLOT (expr
);
17219 OMP_CLAUSE_OPERAND (c
, 0) = expr
;
17220 tree tc
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
17221 OMP_CLAUSE_FIRSTPRIVATE
);
17222 OMP_CLAUSE_DECL (tc
) = tmp
;
17223 OMP_CLAUSE_CHAIN (tc
) = OMP_TARGET_CLAUSES (t
);
17224 OMP_TARGET_CLAUSES (t
) = tc
;
17233 tmp
= tsubst_omp_clauses (OACC_DECLARE_CLAUSES (t
), C_ORT_ACC
, args
,
17234 complain
, in_decl
);
17235 OACC_DECLARE_CLAUSES (t
) = tmp
;
17239 case OMP_TARGET_UPDATE
:
17240 case OMP_TARGET_ENTER_DATA
:
17241 case OMP_TARGET_EXIT_DATA
:
17242 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), C_ORT_OMP
, args
,
17243 complain
, in_decl
);
17245 OMP_STANDALONE_CLAUSES (t
) = tmp
;
17249 case OACC_ENTER_DATA
:
17250 case OACC_EXIT_DATA
:
17252 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), C_ORT_ACC
, args
,
17253 complain
, in_decl
);
17255 OMP_STANDALONE_CLAUSES (t
) = tmp
;
17260 tmp
= tsubst_omp_clauses (OMP_ORDERED_CLAUSES (t
), C_ORT_OMP
, args
,
17261 complain
, in_decl
);
17262 stmt
= push_stmt_list ();
17263 RECUR (OMP_BODY (t
));
17264 stmt
= pop_stmt_list (stmt
);
17267 OMP_BODY (t
) = stmt
;
17268 OMP_ORDERED_CLAUSES (t
) = tmp
;
17274 case OMP_TASKGROUP
:
17275 stmt
= push_stmt_list ();
17276 RECUR (OMP_BODY (t
));
17277 stmt
= pop_stmt_list (stmt
);
17280 OMP_BODY (t
) = stmt
;
17285 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
17286 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
17288 tree op1
= TREE_OPERAND (t
, 1);
17289 tree rhs1
= NULL_TREE
;
17291 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
17293 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
17294 op1
= TREE_OPERAND (op1
, 1);
17296 lhs
= RECUR (TREE_OPERAND (op1
, 0));
17297 rhs
= RECUR (TREE_OPERAND (op1
, 1));
17298 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
17299 NULL_TREE
, NULL_TREE
, rhs1
,
17300 OMP_ATOMIC_SEQ_CST (t
));
17304 tree op1
= TREE_OPERAND (t
, 1);
17305 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
17306 tree rhs1
= NULL_TREE
;
17307 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
17308 enum tree_code opcode
= NOP_EXPR
;
17309 if (code
== OMP_ATOMIC_READ
)
17311 v
= RECUR (TREE_OPERAND (op1
, 0));
17312 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
17314 else if (code
== OMP_ATOMIC_CAPTURE_OLD
17315 || code
== OMP_ATOMIC_CAPTURE_NEW
)
17317 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
17318 v
= RECUR (TREE_OPERAND (op1
, 0));
17319 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
17320 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
17322 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
17323 op11
= TREE_OPERAND (op11
, 1);
17325 lhs
= RECUR (TREE_OPERAND (op11
, 0));
17326 rhs
= RECUR (TREE_OPERAND (op11
, 1));
17327 opcode
= TREE_CODE (op11
);
17328 if (opcode
== MODIFY_EXPR
)
17334 lhs
= RECUR (TREE_OPERAND (op1
, 0));
17335 rhs
= RECUR (TREE_OPERAND (op1
, 1));
17337 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
17338 OMP_ATOMIC_SEQ_CST (t
));
17342 case TRANSACTION_EXPR
:
17345 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
17346 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
17348 if (TRANSACTION_EXPR_IS_STMT (t
))
17350 tree body
= TRANSACTION_EXPR_BODY (t
);
17351 tree noex
= NULL_TREE
;
17352 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
17354 noex
= MUST_NOT_THROW_COND (body
);
17355 if (noex
== NULL_TREE
)
17356 noex
= boolean_true_node
;
17357 body
= TREE_OPERAND (body
, 0);
17359 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
17361 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
17365 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
17366 RECUR (TRANSACTION_EXPR_BODY (t
)),
17373 case MUST_NOT_THROW_EXPR
:
17375 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17376 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
17377 RETURN (build_must_not_throw_expr (op0
, cond
));
17380 case EXPR_PACK_EXPANSION
:
17381 error ("invalid use of pack expansion expression");
17382 RETURN (error_mark_node
);
17384 case NONTYPE_ARGUMENT_PACK
:
17385 error ("use %<...%> to expand argument pack");
17386 RETURN (error_mark_node
);
17388 case COMPOUND_EXPR
:
17389 tmp
= RECUR (TREE_OPERAND (t
, 0));
17390 if (tmp
== NULL_TREE
)
17391 /* If the first operand was a statement, we're done with it. */
17392 RETURN (RECUR (TREE_OPERAND (t
, 1)));
17393 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
17394 RECUR (TREE_OPERAND (t
, 1)),
17397 case ANNOTATE_EXPR
:
17398 tmp
= RECUR (TREE_OPERAND (t
, 0));
17399 RETURN (build3_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
17400 TREE_TYPE (tmp
), tmp
,
17401 RECUR (TREE_OPERAND (t
, 1)),
17402 RECUR (TREE_OPERAND (t
, 2))));
17405 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
17407 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
17408 /*function_p=*/false,
17409 integral_constant_expression_p
));
17412 RETURN (NULL_TREE
);
17414 input_location
= loc
;
17420 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
17421 function. For description of the body see comment above
17422 cp_parser_omp_declare_reduction_exprs. */
17425 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
17427 if (t
== NULL_TREE
|| t
== error_mark_node
)
17430 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
17432 tree_stmt_iterator tsi
;
17435 memset (stmts
, 0, sizeof stmts
);
17436 for (i
= 0, tsi
= tsi_start (t
);
17437 i
< 7 && !tsi_end_p (tsi
);
17438 i
++, tsi_next (&tsi
))
17439 stmts
[i
] = tsi_stmt (tsi
);
17440 gcc_assert (tsi_end_p (tsi
));
17444 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
17445 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
17446 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
17447 args
, complain
, in_decl
);
17448 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
17449 args
, complain
, in_decl
);
17450 DECL_CONTEXT (omp_out
) = current_function_decl
;
17451 DECL_CONTEXT (omp_in
) = current_function_decl
;
17452 keep_next_level (true);
17453 tree block
= begin_omp_structured_block ();
17454 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
17455 block
= finish_omp_structured_block (block
);
17456 block
= maybe_cleanup_point_expr_void (block
);
17457 add_decl_expr (omp_out
);
17458 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
17459 TREE_NO_WARNING (omp_out
) = 1;
17460 add_decl_expr (omp_in
);
17461 finish_expr_stmt (block
);
17465 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
17466 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
17467 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
17468 args
, complain
, in_decl
);
17469 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
17470 args
, complain
, in_decl
);
17471 DECL_CONTEXT (omp_priv
) = current_function_decl
;
17472 DECL_CONTEXT (omp_orig
) = current_function_decl
;
17473 keep_next_level (true);
17474 tree block
= begin_omp_structured_block ();
17475 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
17476 block
= finish_omp_structured_block (block
);
17477 block
= maybe_cleanup_point_expr_void (block
);
17478 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
17479 add_decl_expr (omp_priv
);
17480 add_decl_expr (omp_orig
);
17481 finish_expr_stmt (block
);
17483 add_decl_expr (omp_orig
);
17487 /* T is a postfix-expression that is not being used in a function
17488 call. Return the substituted version of T. */
17491 tsubst_non_call_postfix_expression (tree t
, tree args
,
17492 tsubst_flags_t complain
,
17495 if (TREE_CODE (t
) == SCOPE_REF
)
17496 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
17497 /*done=*/false, /*address_p=*/false);
17499 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
17500 /*function_p=*/false,
17501 /*integral_constant_expression_p=*/false);
17506 /* T is a LAMBDA_EXPR. Generate a new LAMBDA_EXPR for the current
17507 instantiation context. Instantiating a pack expansion containing a lambda
17508 might result in multiple lambdas all based on the same lambda in the
17512 tsubst_lambda_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
17514 tree oldfn
= lambda_function (t
);
17517 tree r
= build_lambda_expr ();
17519 LAMBDA_EXPR_LOCATION (r
)
17520 = LAMBDA_EXPR_LOCATION (t
);
17521 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
17522 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
17523 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
17525 if (LAMBDA_EXPR_EXTRA_SCOPE (t
) == NULL_TREE
)
17526 LAMBDA_EXPR_EXTRA_SCOPE (r
) = NULL_TREE
;
17528 record_lambda_scope (r
);
17530 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
17531 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
17533 for (tree cap
= LAMBDA_EXPR_CAPTURE_LIST (t
); cap
;
17534 cap
= TREE_CHAIN (cap
))
17536 tree field
= TREE_PURPOSE (cap
);
17537 if (PACK_EXPANSION_P (field
))
17538 field
= PACK_EXPANSION_PATTERN (field
);
17539 field
= tsubst_decl (field
, args
, complain
);
17541 if (field
== error_mark_node
)
17542 return error_mark_node
;
17544 tree init
= TREE_VALUE (cap
);
17545 if (PACK_EXPANSION_P (init
))
17546 init
= tsubst_pack_expansion (init
, args
, complain
, in_decl
);
17548 init
= tsubst_copy_and_build (init
, args
, complain
, in_decl
,
17549 /*fn*/false, /*constexpr*/false);
17551 if (TREE_CODE (field
) == TREE_VEC
)
17553 int len
= TREE_VEC_LENGTH (field
);
17554 gcc_assert (TREE_CODE (init
) == TREE_VEC
17555 && TREE_VEC_LENGTH (init
) == len
);
17556 for (int i
= 0; i
< len
; ++i
)
17557 LAMBDA_EXPR_CAPTURE_LIST (r
)
17558 = tree_cons (TREE_VEC_ELT (field
, i
),
17559 TREE_VEC_ELT (init
, i
),
17560 LAMBDA_EXPR_CAPTURE_LIST (r
));
17564 LAMBDA_EXPR_CAPTURE_LIST (r
)
17565 = tree_cons (field
, init
, LAMBDA_EXPR_CAPTURE_LIST (r
));
17567 if (id_equal (DECL_NAME (field
), "__this"))
17568 LAMBDA_EXPR_THIS_CAPTURE (r
) = field
;
17572 tree type
= begin_lambda_type (r
);
17573 if (type
== error_mark_node
)
17574 return error_mark_node
;
17576 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
17577 determine_visibility (TYPE_NAME (type
));
17579 register_capture_members (LAMBDA_EXPR_CAPTURE_LIST (r
));
17581 tree oldtmpl
= (generic_lambda_fn_p (oldfn
)
17582 ? DECL_TI_TEMPLATE (oldfn
)
17585 tree fntype
= static_fn_type (oldfn
);
17587 ++processing_template_decl
;
17588 fntype
= tsubst (fntype
, args
, complain
, in_decl
);
17590 --processing_template_decl
;
17592 if (fntype
== error_mark_node
)
17593 r
= error_mark_node
;
17596 /* Fix the type of 'this'. */
17597 fntype
= build_memfn_type (fntype
, type
,
17598 type_memfn_quals (fntype
),
17599 type_memfn_rqual (fntype
));
17603 tmpl
= tsubst_template_decl (oldtmpl
, args
, complain
, fntype
);
17604 fn
= DECL_TEMPLATE_RESULT (tmpl
);
17605 finish_member_declaration (tmpl
);
17610 fn
= tsubst_function_decl (oldfn
, args
, complain
, fntype
);
17611 finish_member_declaration (fn
);
17614 /* Let finish_function set this. */
17615 DECL_DECLARED_CONSTEXPR_P (fn
) = false;
17617 bool nested
= cfun
;
17619 push_function_context ();
17621 /* Still increment function_depth so that we don't GC in the
17622 middle of an expression. */
17625 local_specialization_stack
s (lss_copy
);
17627 tree body
= start_lambda_function (fn
, r
);
17629 register_parameter_specializations (oldfn
, fn
);
17631 tsubst_expr (DECL_SAVED_TREE (oldfn
), args
, complain
, r
,
17632 /*constexpr*/false);
17634 finish_lambda_function (body
);
17637 pop_function_context ();
17641 /* The capture list was built up in reverse order; fix that now. */
17642 LAMBDA_EXPR_CAPTURE_LIST (r
)
17643 = nreverse (LAMBDA_EXPR_CAPTURE_LIST (r
));
17645 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
17647 maybe_add_lambda_conv_op (type
);
17650 finish_struct (type
, /*attr*/NULL_TREE
);
17652 insert_pending_capture_proxies ();
17657 /* Like tsubst but deals with expressions and performs semantic
17658 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
17661 tsubst_copy_and_build (tree t
,
17663 tsubst_flags_t complain
,
17666 bool integral_constant_expression_p
)
17668 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
17669 #define RECUR(NODE) \
17670 tsubst_copy_and_build (NODE, args, complain, in_decl, \
17671 /*function_p=*/false, \
17672 integral_constant_expression_p)
17677 if (t
== NULL_TREE
|| t
== error_mark_node
)
17680 loc
= input_location
;
17681 if (EXPR_HAS_LOCATION (t
))
17682 input_location
= EXPR_LOCATION (t
);
17684 /* N3276 decltype magic only applies to calls at the top level or on the
17685 right side of a comma. */
17686 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
17687 complain
&= ~tf_decltype
;
17689 switch (TREE_CODE (t
))
17693 /* Fall through. */
17694 case IDENTIFIER_NODE
:
17698 bool non_integral_constant_expression_p
;
17699 const char *error_msg
;
17701 if (IDENTIFIER_CONV_OP_P (t
))
17703 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17704 t
= make_conv_op_name (new_type
);
17707 /* Look up the name. */
17708 decl
= lookup_name (t
);
17710 /* By convention, expressions use ERROR_MARK_NODE to indicate
17711 failure, not NULL_TREE. */
17712 if (decl
== NULL_TREE
)
17713 decl
= error_mark_node
;
17715 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
17717 integral_constant_expression_p
,
17718 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
17719 &non_integral_constant_expression_p
,
17720 /*template_p=*/false,
17722 /*address_p=*/false,
17723 /*template_arg_p=*/false,
17728 if (!function_p
&& identifier_p (decl
))
17730 if (complain
& tf_error
)
17731 unqualified_name_lookup_error (decl
);
17732 decl
= error_mark_node
;
17737 case TEMPLATE_ID_EXPR
:
17740 tree templ
= RECUR (TREE_OPERAND (t
, 0));
17741 tree targs
= TREE_OPERAND (t
, 1);
17744 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
17745 if (targs
== error_mark_node
)
17746 RETURN (error_mark_node
);
17748 if (TREE_CODE (templ
) == SCOPE_REF
)
17750 tree name
= TREE_OPERAND (templ
, 1);
17751 tree tid
= lookup_template_function (name
, targs
);
17752 TREE_OPERAND (templ
, 1) = tid
;
17756 if (variable_template_p (templ
))
17757 RETURN (lookup_and_finish_template_variable (templ
, targs
, complain
));
17759 if (TREE_CODE (templ
) == COMPONENT_REF
)
17761 object
= TREE_OPERAND (templ
, 0);
17762 templ
= TREE_OPERAND (templ
, 1);
17765 object
= NULL_TREE
;
17766 templ
= lookup_template_function (templ
, targs
);
17769 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
17770 object
, templ
, NULL_TREE
));
17772 RETURN (baselink_for_fns (templ
));
17777 tree r
= RECUR (TREE_OPERAND (t
, 0));
17779 if (REFERENCE_REF_P (t
))
17781 /* A type conversion to reference type will be enclosed in
17782 such an indirect ref, but the substitution of the cast
17783 will have also added such an indirect ref. */
17784 r
= convert_from_reference (r
);
17787 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
17788 complain
|decltype_flag
);
17790 if (REF_PARENTHESIZED_P (t
))
17791 r
= force_paren_expr (r
);
17798 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17799 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17800 RETURN (build_nop (type
, op0
));
17803 case IMPLICIT_CONV_EXPR
:
17805 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17806 tree expr
= RECUR (TREE_OPERAND (t
, 0));
17807 if (dependent_type_p (type
) || type_dependent_expression_p (expr
))
17809 retval
= copy_node (t
);
17810 TREE_TYPE (retval
) = type
;
17811 TREE_OPERAND (retval
, 0) = expr
;
17814 if (IMPLICIT_CONV_EXPR_NONTYPE_ARG (t
))
17815 /* We'll pass this to convert_nontype_argument again, we don't need
17816 to actually perform any conversion here. */
17818 int flags
= LOOKUP_IMPLICIT
;
17819 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
17820 flags
= LOOKUP_NORMAL
;
17821 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
17827 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17828 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17829 if (op0
== error_mark_node
)
17830 RETURN (error_mark_node
);
17831 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
17835 case REINTERPRET_CAST_EXPR
:
17836 case CONST_CAST_EXPR
:
17837 case DYNAMIC_CAST_EXPR
:
17838 case STATIC_CAST_EXPR
:
17841 tree op
, r
= NULL_TREE
;
17843 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17844 if (integral_constant_expression_p
17845 && !cast_valid_in_integral_constant_expression_p (type
))
17847 if (complain
& tf_error
)
17848 error ("a cast to a type other than an integral or "
17849 "enumeration type cannot appear in a constant-expression");
17850 RETURN (error_mark_node
);
17853 op
= RECUR (TREE_OPERAND (t
, 0));
17855 warning_sentinel
s(warn_useless_cast
);
17856 warning_sentinel
s2(warn_ignored_qualifiers
);
17857 switch (TREE_CODE (t
))
17860 r
= build_functional_cast (type
, op
, complain
);
17862 case REINTERPRET_CAST_EXPR
:
17863 r
= build_reinterpret_cast (type
, op
, complain
);
17865 case CONST_CAST_EXPR
:
17866 r
= build_const_cast (type
, op
, complain
);
17868 case DYNAMIC_CAST_EXPR
:
17869 r
= build_dynamic_cast (type
, op
, complain
);
17871 case STATIC_CAST_EXPR
:
17872 r
= build_static_cast (type
, op
, complain
);
17875 gcc_unreachable ();
17881 case POSTDECREMENT_EXPR
:
17882 case POSTINCREMENT_EXPR
:
17883 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
17884 args
, complain
, in_decl
);
17885 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
17886 complain
|decltype_flag
));
17888 case PREDECREMENT_EXPR
:
17889 case PREINCREMENT_EXPR
:
17893 case TRUTH_NOT_EXPR
:
17894 case UNARY_PLUS_EXPR
: /* Unary + */
17895 case REALPART_EXPR
:
17896 case IMAGPART_EXPR
:
17897 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
17898 RECUR (TREE_OPERAND (t
, 0)),
17899 complain
|decltype_flag
));
17901 case FIX_TRUNC_EXPR
:
17902 gcc_unreachable ();
17905 op1
= TREE_OPERAND (t
, 0);
17906 if (TREE_CODE (op1
) == LABEL_DECL
)
17907 RETURN (finish_label_address_expr (DECL_NAME (op1
),
17908 EXPR_LOCATION (op1
)));
17909 if (TREE_CODE (op1
) == SCOPE_REF
)
17910 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
17911 /*done=*/true, /*address_p=*/true);
17913 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
17915 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
17916 complain
|decltype_flag
));
17921 case TRUNC_DIV_EXPR
:
17922 case CEIL_DIV_EXPR
:
17923 case FLOOR_DIV_EXPR
:
17924 case ROUND_DIV_EXPR
:
17925 case EXACT_DIV_EXPR
:
17929 case TRUNC_MOD_EXPR
:
17930 case FLOOR_MOD_EXPR
:
17931 case TRUTH_ANDIF_EXPR
:
17932 case TRUTH_ORIF_EXPR
:
17933 case TRUTH_AND_EXPR
:
17934 case TRUTH_OR_EXPR
:
17950 warning_sentinel
s1(warn_type_limits
);
17951 warning_sentinel
s2(warn_div_by_zero
);
17952 warning_sentinel
s3(warn_logical_op
);
17953 warning_sentinel
s4(warn_tautological_compare
);
17954 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17955 tree op1
= RECUR (TREE_OPERAND (t
, 1));
17956 tree r
= build_x_binary_op
17957 (input_location
, TREE_CODE (t
),
17959 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
17961 : TREE_CODE (TREE_OPERAND (t
, 0))),
17963 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
17965 : TREE_CODE (TREE_OPERAND (t
, 1))),
17967 complain
|decltype_flag
);
17968 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
17969 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
17974 case POINTER_PLUS_EXPR
:
17976 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17977 tree op1
= RECUR (TREE_OPERAND (t
, 1));
17978 RETURN (fold_build_pointer_plus (op0
, op1
));
17982 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
17983 /*address_p=*/false));
17985 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
17986 args
, complain
, in_decl
);
17987 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
17988 RECUR (TREE_OPERAND (t
, 1)),
17989 complain
|decltype_flag
));
17992 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0))
17993 || ARGUMENT_PACK_P (TREE_OPERAND (t
, 0)))
17994 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
18001 op1
= TREE_OPERAND (t
, 0);
18002 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
18003 op1
= TREE_TYPE (op1
);
18006 /* When there are no ARGS, we are trying to evaluate a
18007 non-dependent expression from the parser. Trying to do
18008 the substitutions may not work. */
18010 op1
= TREE_TYPE (op1
);
18014 ++cp_unevaluated_operand
;
18015 ++c_inhibit_evaluation_warnings
;
18017 op1
= tsubst (op1
, args
, complain
, in_decl
);
18019 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
18020 /*function_p=*/false,
18021 /*integral_constant_expression_p=*/
18023 --cp_unevaluated_operand
;
18024 --c_inhibit_evaluation_warnings
;
18027 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
18028 complain
& tf_error
);
18030 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
18031 complain
& tf_error
);
18032 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
18034 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
18036 if (!processing_template_decl
&& TYPE_P (op1
))
18038 r
= build_min (SIZEOF_EXPR
, size_type_node
,
18039 build1 (NOP_EXPR
, op1
, error_mark_node
));
18040 SIZEOF_EXPR_TYPE_P (r
) = 1;
18043 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
18044 TREE_SIDE_EFFECTS (r
) = 0;
18045 TREE_READONLY (r
) = 1;
18047 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
18052 case AT_ENCODE_EXPR
:
18054 op1
= TREE_OPERAND (t
, 0);
18055 ++cp_unevaluated_operand
;
18056 ++c_inhibit_evaluation_warnings
;
18057 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
18058 /*function_p=*/false,
18059 /*integral_constant_expression_p=*/false);
18060 --cp_unevaluated_operand
;
18061 --c_inhibit_evaluation_warnings
;
18062 RETURN (objc_build_encode_expr (op1
));
18065 case NOEXCEPT_EXPR
:
18066 op1
= TREE_OPERAND (t
, 0);
18067 ++cp_unevaluated_operand
;
18068 ++c_inhibit_evaluation_warnings
;
18069 ++cp_noexcept_operand
;
18070 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
18071 /*function_p=*/false,
18072 /*integral_constant_expression_p=*/false);
18073 --cp_unevaluated_operand
;
18074 --c_inhibit_evaluation_warnings
;
18075 --cp_noexcept_operand
;
18076 RETURN (finish_noexcept_expr (op1
, complain
));
18080 warning_sentinel
s(warn_div_by_zero
);
18081 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
18082 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
18083 tree r
= build_x_modify_expr
18084 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
18085 complain
|decltype_flag
);
18086 /* TREE_NO_WARNING must be set if either the expression was
18087 parenthesized or it uses an operator such as >>= rather
18088 than plain assignment. In the former case, it was already
18089 set and must be copied. In the latter case,
18090 build_x_modify_expr sets it and it must not be reset
18092 if (TREE_NO_WARNING (t
))
18093 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
18099 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
18100 args
, complain
, in_decl
);
18101 /* Remember that there was a reference to this entity. */
18103 && !mark_used (op1
, complain
) && !(complain
& tf_error
))
18104 RETURN (error_mark_node
);
18105 RETURN (build_x_arrow (input_location
, op1
, complain
));
18109 tree placement
= RECUR (TREE_OPERAND (t
, 0));
18110 tree init
= RECUR (TREE_OPERAND (t
, 3));
18111 vec
<tree
, va_gc
> *placement_vec
;
18112 vec
<tree
, va_gc
> *init_vec
;
18115 if (placement
== NULL_TREE
)
18116 placement_vec
= NULL
;
18119 placement_vec
= make_tree_vector ();
18120 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
18121 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
18124 /* If there was an initializer in the original tree, but it
18125 instantiated to an empty list, then we should pass a
18126 non-NULL empty vector to tell build_new that it was an
18127 empty initializer() rather than no initializer. This can
18128 only happen when the initializer is a pack expansion whose
18129 parameter packs are of length zero. */
18130 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
18134 init_vec
= make_tree_vector ();
18135 if (init
== void_node
)
18136 gcc_assert (init_vec
!= NULL
);
18139 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
18140 vec_safe_push (init_vec
, TREE_VALUE (init
));
18144 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
18145 tree op2
= RECUR (TREE_OPERAND (t
, 2));
18146 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
18147 NEW_EXPR_USE_GLOBAL (t
),
18150 if (placement_vec
!= NULL
)
18151 release_tree_vector (placement_vec
);
18152 if (init_vec
!= NULL
)
18153 release_tree_vector (init_vec
);
18160 tree op0
= RECUR (TREE_OPERAND (t
, 0));
18161 tree op1
= RECUR (TREE_OPERAND (t
, 1));
18162 RETURN (delete_sanity (op0
, op1
,
18163 DELETE_EXPR_USE_VEC (t
),
18164 DELETE_EXPR_USE_GLOBAL (t
),
18168 case COMPOUND_EXPR
:
18170 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
18171 complain
& ~tf_decltype
, in_decl
,
18172 /*function_p=*/false,
18173 integral_constant_expression_p
);
18174 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
18176 RECUR (TREE_OPERAND (t
, 1)),
18177 complain
|decltype_flag
));
18183 vec
<tree
, va_gc
> *call_args
;
18184 unsigned int nargs
, i
;
18189 function
= CALL_EXPR_FN (t
);
18190 /* Internal function with no arguments. */
18191 if (function
== NULL_TREE
&& call_expr_nargs (t
) == 0)
18194 /* When we parsed the expression, we determined whether or
18195 not Koenig lookup should be performed. */
18196 koenig_p
= KOENIG_LOOKUP_P (t
);
18197 if (function
== NULL_TREE
)
18200 qualified_p
= false;
18202 else if (TREE_CODE (function
) == SCOPE_REF
)
18204 qualified_p
= true;
18205 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
18207 /*address_p=*/false);
18209 else if (koenig_p
&& identifier_p (function
))
18211 /* Do nothing; calling tsubst_copy_and_build on an identifier
18212 would incorrectly perform unqualified lookup again.
18214 Note that we can also have an IDENTIFIER_NODE if the earlier
18215 unqualified lookup found a member function; in that case
18216 koenig_p will be false and we do want to do the lookup
18217 again to find the instantiated member function.
18219 FIXME but doing that causes c++/15272, so we need to stop
18220 using IDENTIFIER_NODE in that situation. */
18221 qualified_p
= false;
18225 if (TREE_CODE (function
) == COMPONENT_REF
)
18227 tree op
= TREE_OPERAND (function
, 1);
18229 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
18230 || (BASELINK_P (op
)
18231 && BASELINK_QUALIFIED_P (op
)));
18234 qualified_p
= false;
18236 if (TREE_CODE (function
) == ADDR_EXPR
18237 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
18238 /* Avoid error about taking the address of a constructor. */
18239 function
= TREE_OPERAND (function
, 0);
18241 function
= tsubst_copy_and_build (function
, args
, complain
,
18244 integral_constant_expression_p
);
18246 if (BASELINK_P (function
))
18247 qualified_p
= true;
18250 nargs
= call_expr_nargs (t
);
18251 call_args
= make_tree_vector ();
18252 for (i
= 0; i
< nargs
; ++i
)
18254 tree arg
= CALL_EXPR_ARG (t
, i
);
18256 if (!PACK_EXPANSION_P (arg
))
18257 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
18260 /* Expand the pack expansion and push each entry onto
18262 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
18263 if (TREE_CODE (arg
) == TREE_VEC
)
18265 unsigned int len
, j
;
18267 len
= TREE_VEC_LENGTH (arg
);
18268 for (j
= 0; j
< len
; ++j
)
18270 tree value
= TREE_VEC_ELT (arg
, j
);
18271 if (value
!= NULL_TREE
)
18272 value
= convert_from_reference (value
);
18273 vec_safe_push (call_args
, value
);
18278 /* A partial substitution. Add one entry. */
18279 vec_safe_push (call_args
, arg
);
18284 /* We do not perform argument-dependent lookup if normal
18285 lookup finds a non-function, in accordance with the
18286 expected resolution of DR 218. */
18288 && ((is_overloaded_fn (function
)
18289 /* If lookup found a member function, the Koenig lookup is
18290 not appropriate, even if an unqualified-name was used
18291 to denote the function. */
18292 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
18293 || identifier_p (function
))
18294 /* Only do this when substitution turns a dependent call
18295 into a non-dependent call. */
18296 && type_dependent_expression_p_push (t
)
18297 && !any_type_dependent_arguments_p (call_args
))
18298 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
18300 if (function
!= NULL_TREE
18301 && identifier_p (function
)
18302 && !any_type_dependent_arguments_p (call_args
))
18304 if (koenig_p
&& (complain
& tf_warning_or_error
))
18306 /* For backwards compatibility and good diagnostics, try
18307 the unqualified lookup again if we aren't in SFINAE
18309 tree unq
= (tsubst_copy_and_build
18310 (function
, args
, complain
, in_decl
, true,
18311 integral_constant_expression_p
));
18312 if (unq
== error_mark_node
)
18314 release_tree_vector (call_args
);
18315 RETURN (error_mark_node
);
18318 if (unq
!= function
)
18320 /* In a lambda fn, we have to be careful to not
18321 introduce new this captures. Legacy code can't
18322 be using lambdas anyway, so it's ok to be
18324 bool in_lambda
= (current_class_type
18325 && LAMBDA_TYPE_P (current_class_type
));
18326 char const *const msg
18327 = G_("%qD was not declared in this scope, "
18328 "and no declarations were found by "
18329 "argument-dependent lookup at the point "
18330 "of instantiation");
18334 error_at (EXPR_LOC_OR_LOC (t
, input_location
),
18337 diag
= permerror (EXPR_LOC_OR_LOC (t
, input_location
),
18343 if (INDIRECT_REF_P (fn
))
18344 fn
= TREE_OPERAND (fn
, 0);
18345 if (is_overloaded_fn (fn
))
18346 fn
= get_first_fn (fn
);
18349 /* Can't say anything more. */;
18350 else if (DECL_CLASS_SCOPE_P (fn
))
18352 location_t loc
= EXPR_LOC_OR_LOC (t
,
18355 "declarations in dependent base %qT are "
18356 "not found by unqualified lookup",
18357 DECL_CLASS_CONTEXT (fn
));
18358 if (current_class_ptr
)
18360 "use %<this->%D%> instead", function
);
18363 "use %<%T::%D%> instead",
18364 current_class_name
, function
);
18367 inform (DECL_SOURCE_LOCATION (fn
),
18368 "%qD declared here, later in the "
18369 "translation unit", fn
);
18372 release_tree_vector (call_args
);
18373 RETURN (error_mark_node
);
18380 if (identifier_p (function
))
18382 if (complain
& tf_error
)
18383 unqualified_name_lookup_error (function
);
18384 release_tree_vector (call_args
);
18385 RETURN (error_mark_node
);
18389 /* Remember that there was a reference to this entity. */
18390 if (function
!= NULL_TREE
18391 && DECL_P (function
)
18392 && !mark_used (function
, complain
) && !(complain
& tf_error
))
18394 release_tree_vector (call_args
);
18395 RETURN (error_mark_node
);
18398 /* Put back tf_decltype for the actual call. */
18399 complain
|= decltype_flag
;
18401 if (function
== NULL_TREE
)
18402 switch (CALL_EXPR_IFN (t
))
18405 gcc_assert (nargs
== 1);
18406 if (vec_safe_length (call_args
) != 1)
18408 error_at (EXPR_LOC_OR_LOC (t
, input_location
),
18409 "wrong number of arguments to "
18410 "%<__builtin_launder%>");
18411 ret
= error_mark_node
;
18414 ret
= finish_builtin_launder (EXPR_LOC_OR_LOC (t
,
18416 (*call_args
)[0], complain
);
18420 /* Unsupported internal function with arguments. */
18421 gcc_unreachable ();
18423 else if (TREE_CODE (function
) == OFFSET_REF
)
18424 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
18426 else if (TREE_CODE (function
) == COMPONENT_REF
)
18428 tree instance
= TREE_OPERAND (function
, 0);
18429 tree fn
= TREE_OPERAND (function
, 1);
18431 if (processing_template_decl
18432 && (type_dependent_expression_p (instance
)
18433 || (!BASELINK_P (fn
)
18434 && TREE_CODE (fn
) != FIELD_DECL
)
18435 || type_dependent_expression_p (fn
)
18436 || any_type_dependent_arguments_p (call_args
)))
18437 ret
= build_min_nt_call_vec (function
, call_args
);
18438 else if (!BASELINK_P (fn
))
18439 ret
= finish_call_expr (function
, &call_args
,
18440 /*disallow_virtual=*/false,
18441 /*koenig_p=*/false,
18444 ret
= (build_new_method_call
18446 &call_args
, NULL_TREE
,
18447 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
18452 ret
= finish_call_expr (function
, &call_args
,
18453 /*disallow_virtual=*/qualified_p
,
18457 release_tree_vector (call_args
);
18459 if (ret
!= error_mark_node
)
18461 bool op
= CALL_EXPR_OPERATOR_SYNTAX (t
);
18462 bool ord
= CALL_EXPR_ORDERED_ARGS (t
);
18463 bool rev
= CALL_EXPR_REVERSE_ARGS (t
);
18464 bool thk
= CALL_FROM_THUNK_P (t
);
18465 if (op
|| ord
|| rev
|| thk
)
18467 function
= extract_call_expr (ret
);
18468 CALL_EXPR_OPERATOR_SYNTAX (function
) = op
;
18469 CALL_EXPR_ORDERED_ARGS (function
) = ord
;
18470 CALL_EXPR_REVERSE_ARGS (function
) = rev
;
18473 if (TREE_CODE (function
) == CALL_EXPR
)
18474 CALL_FROM_THUNK_P (function
) = true;
18476 AGGR_INIT_FROM_THUNK_P (function
) = true;
18477 /* The thunk location is not interesting. */
18478 SET_EXPR_LOCATION (function
, UNKNOWN_LOCATION
);
18488 tree cond
= RECUR (TREE_OPERAND (t
, 0));
18489 tree folded_cond
= fold_non_dependent_expr (cond
);
18492 if (TREE_CODE (folded_cond
) == INTEGER_CST
)
18494 if (integer_zerop (folded_cond
))
18496 ++c_inhibit_evaluation_warnings
;
18497 exp1
= RECUR (TREE_OPERAND (t
, 1));
18498 --c_inhibit_evaluation_warnings
;
18499 exp2
= RECUR (TREE_OPERAND (t
, 2));
18503 exp1
= RECUR (TREE_OPERAND (t
, 1));
18504 ++c_inhibit_evaluation_warnings
;
18505 exp2
= RECUR (TREE_OPERAND (t
, 2));
18506 --c_inhibit_evaluation_warnings
;
18508 cond
= folded_cond
;
18512 exp1
= RECUR (TREE_OPERAND (t
, 1));
18513 exp2
= RECUR (TREE_OPERAND (t
, 2));
18516 warning_sentinel
s(warn_duplicated_branches
);
18517 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
18518 cond
, exp1
, exp2
, complain
));
18521 case PSEUDO_DTOR_EXPR
:
18523 tree op0
= RECUR (TREE_OPERAND (t
, 0));
18524 tree op1
= RECUR (TREE_OPERAND (t
, 1));
18525 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
18526 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
18532 tree purpose
, value
, chain
;
18534 if (t
== void_list_node
)
18537 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
18538 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
18540 /* We have pack expansions, so expand those and
18541 create a new list out of it. */
18542 tree purposevec
= NULL_TREE
;
18543 tree valuevec
= NULL_TREE
;
18547 /* Expand the argument expressions. */
18548 if (TREE_PURPOSE (t
))
18549 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
18550 complain
, in_decl
);
18551 if (TREE_VALUE (t
))
18552 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
18553 complain
, in_decl
);
18555 /* Build the rest of the list. */
18556 chain
= TREE_CHAIN (t
);
18557 if (chain
&& chain
!= void_type_node
)
18558 chain
= RECUR (chain
);
18560 /* Determine the number of arguments. */
18561 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
18563 len
= TREE_VEC_LENGTH (purposevec
);
18564 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
18566 else if (TREE_CODE (valuevec
) == TREE_VEC
)
18567 len
= TREE_VEC_LENGTH (valuevec
);
18570 /* Since we only performed a partial substitution into
18571 the argument pack, we only RETURN (a single list
18573 if (purposevec
== TREE_PURPOSE (t
)
18574 && valuevec
== TREE_VALUE (t
)
18575 && chain
== TREE_CHAIN (t
))
18578 RETURN (tree_cons (purposevec
, valuevec
, chain
));
18581 /* Convert the argument vectors into a TREE_LIST */
18585 /* Grab the Ith values. */
18587 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
18590 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
18593 /* Build the list (backwards). */
18594 chain
= tree_cons (purpose
, value
, chain
);
18600 purpose
= TREE_PURPOSE (t
);
18602 purpose
= RECUR (purpose
);
18603 value
= TREE_VALUE (t
);
18605 value
= RECUR (value
);
18606 chain
= TREE_CHAIN (t
);
18607 if (chain
&& chain
!= void_type_node
)
18608 chain
= RECUR (chain
);
18609 if (purpose
== TREE_PURPOSE (t
)
18610 && value
== TREE_VALUE (t
)
18611 && chain
== TREE_CHAIN (t
))
18613 RETURN (tree_cons (purpose
, value
, chain
));
18616 case COMPONENT_REF
:
18623 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
18624 args
, complain
, in_decl
);
18625 /* Remember that there was a reference to this entity. */
18626 if (DECL_P (object
)
18627 && !mark_used (object
, complain
) && !(complain
& tf_error
))
18628 RETURN (error_mark_node
);
18629 object_type
= TREE_TYPE (object
);
18631 member
= TREE_OPERAND (t
, 1);
18632 if (BASELINK_P (member
))
18633 member
= tsubst_baselink (member
,
18634 non_reference (TREE_TYPE (object
)),
18635 args
, complain
, in_decl
);
18637 member
= tsubst_copy (member
, args
, complain
, in_decl
);
18638 if (member
== error_mark_node
)
18639 RETURN (error_mark_node
);
18641 if (TREE_CODE (member
) == FIELD_DECL
)
18643 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
18644 if (TREE_CODE (r
) == COMPONENT_REF
)
18645 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
18648 else if (type_dependent_expression_p (object
))
18649 /* We can't do much here. */;
18650 else if (!CLASS_TYPE_P (object_type
))
18652 if (scalarish_type_p (object_type
))
18654 tree s
= NULL_TREE
;
18655 tree dtor
= member
;
18657 if (TREE_CODE (dtor
) == SCOPE_REF
)
18659 s
= TREE_OPERAND (dtor
, 0);
18660 dtor
= TREE_OPERAND (dtor
, 1);
18662 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
18664 dtor
= TREE_OPERAND (dtor
, 0);
18666 RETURN (finish_pseudo_destructor_expr
18667 (object
, s
, dtor
, input_location
));
18671 else if (TREE_CODE (member
) == SCOPE_REF
18672 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
18674 /* Lookup the template functions now that we know what the
18676 tree scope
= TREE_OPERAND (member
, 0);
18677 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
18678 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
18679 member
= lookup_qualified_name (scope
, tmpl
,
18680 /*is_type_p=*/false,
18681 /*complain=*/false);
18682 if (BASELINK_P (member
))
18684 BASELINK_FUNCTIONS (member
)
18685 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
18687 member
= (adjust_result_of_qualified_name_lookup
18688 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
18693 qualified_name_lookup_error (scope
, tmpl
, member
,
18695 RETURN (error_mark_node
);
18698 else if (TREE_CODE (member
) == SCOPE_REF
18699 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
18700 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
18702 if (complain
& tf_error
)
18704 if (TYPE_P (TREE_OPERAND (member
, 0)))
18705 error ("%qT is not a class or namespace",
18706 TREE_OPERAND (member
, 0));
18708 error ("%qD is not a class or namespace",
18709 TREE_OPERAND (member
, 0));
18711 RETURN (error_mark_node
);
18714 r
= finish_class_member_access_expr (object
, member
,
18715 /*template_p=*/false,
18717 if (TREE_CODE (r
) == COMPONENT_REF
)
18718 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
18723 RETURN (build_throw
18724 (RECUR (TREE_OPERAND (t
, 0))));
18728 vec
<constructor_elt
, va_gc
> *n
;
18729 constructor_elt
*ce
;
18730 unsigned HOST_WIDE_INT idx
;
18731 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
18732 bool process_index_p
;
18734 bool need_copy_p
= false;
18737 if (type
== error_mark_node
)
18738 RETURN (error_mark_node
);
18740 /* We do not want to process the index of aggregate
18741 initializers as they are identifier nodes which will be
18742 looked up by digest_init. */
18743 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
18745 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
18746 newlen
= vec_safe_length (n
);
18747 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
18749 if (ce
->index
&& process_index_p
18750 /* An identifier index is looked up in the type
18751 being initialized, not the current scope. */
18752 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
18753 ce
->index
= RECUR (ce
->index
);
18755 if (PACK_EXPANSION_P (ce
->value
))
18757 /* Substitute into the pack expansion. */
18758 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
18761 if (ce
->value
== error_mark_node
18762 || PACK_EXPANSION_P (ce
->value
))
18764 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
18765 /* Just move the argument into place. */
18766 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
18769 /* Update the length of the final CONSTRUCTOR
18770 arguments vector, and note that we will need to
18772 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
18773 need_copy_p
= true;
18777 ce
->value
= RECUR (ce
->value
);
18782 vec
<constructor_elt
, va_gc
> *old_n
= n
;
18784 vec_alloc (n
, newlen
);
18785 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
18787 if (TREE_CODE (ce
->value
) == TREE_VEC
)
18789 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
18790 for (i
= 0; i
< len
; ++i
)
18791 CONSTRUCTOR_APPEND_ELT (n
, 0,
18792 TREE_VEC_ELT (ce
->value
, i
));
18795 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
18799 r
= build_constructor (init_list_type_node
, n
);
18800 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
18802 if (TREE_HAS_CONSTRUCTOR (t
))
18804 fcl_t cl
= fcl_functional
;
18805 if (CONSTRUCTOR_C99_COMPOUND_LITERAL (t
))
18807 RETURN (finish_compound_literal (type
, r
, complain
, cl
));
18810 TREE_TYPE (r
) = type
;
18816 tree operand_0
= TREE_OPERAND (t
, 0);
18817 if (TYPE_P (operand_0
))
18819 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
18820 RETURN (get_typeid (operand_0
, complain
));
18824 operand_0
= RECUR (operand_0
);
18825 RETURN (build_typeid (operand_0
, complain
));
18836 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
18837 /* ??? We're doing a subset of finish_id_expression here. */
18839 && !processing_template_decl
18840 && !cp_unevaluated_operand
18841 && (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
18842 && CP_DECL_THREAD_LOCAL_P (r
))
18844 if (tree wrap
= get_tls_wrapper_fn (r
))
18845 /* Replace an evaluated use of the thread_local variable with
18846 a call to its wrapper. */
18847 r
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
18849 else if (outer_automatic_var_p (r
))
18850 r
= process_outer_var_ref (r
, complain
);
18852 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
18853 /* If the original type was a reference, we'll be wrapped in
18854 the appropriate INDIRECT_REF. */
18855 r
= convert_from_reference (r
);
18861 tree op0
= RECUR (TREE_OPERAND (t
, 0));
18862 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
18863 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
18866 case OFFSETOF_EXPR
:
18869 = tsubst_copy_and_build (TREE_OPERAND (t
, 1), args
, complain
,
18870 in_decl
, /*function_p=*/false,
18871 /*integral_constant_expression_p=*/false);
18872 RETURN (finish_offsetof (object_ptr
,
18873 RECUR (TREE_OPERAND (t
, 0)),
18874 EXPR_LOCATION (t
)));
18877 case ADDRESSOF_EXPR
:
18878 RETURN (cp_build_addressof (EXPR_LOCATION (t
),
18879 RECUR (TREE_OPERAND (t
, 0)), complain
));
18883 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
18884 complain
, in_decl
);
18886 tree type2
= TRAIT_EXPR_TYPE2 (t
);
18887 if (type2
&& TREE_CODE (type2
) == TREE_LIST
)
18888 type2
= RECUR (type2
);
18890 type2
= tsubst (type2
, args
, complain
, in_decl
);
18892 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
18897 tree old_stmt_expr
= cur_stmt_expr
;
18898 tree stmt_expr
= begin_stmt_expr ();
18900 cur_stmt_expr
= stmt_expr
;
18901 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
18902 integral_constant_expression_p
);
18903 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
18904 cur_stmt_expr
= old_stmt_expr
;
18906 /* If the resulting list of expression statement is empty,
18907 fold it further into void_node. */
18908 if (empty_expr_stmt_p (stmt_expr
))
18909 stmt_expr
= void_node
;
18911 RETURN (stmt_expr
);
18916 tree r
= tsubst_lambda_expr (t
, args
, complain
, in_decl
);
18918 RETURN (build_lambda_object (r
));
18922 /* We can get here for a constant initializer of non-dependent type.
18923 FIXME stop folding in cp_parser_initializer_clause. */
18925 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
18930 case TRANSACTION_EXPR
:
18931 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
18932 integral_constant_expression_p
));
18935 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
18937 case VEC_PERM_EXPR
:
18939 tree op0
= RECUR (TREE_OPERAND (t
, 0));
18940 tree op1
= RECUR (TREE_OPERAND (t
, 1));
18941 tree op2
= RECUR (TREE_OPERAND (t
, 2));
18942 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
18946 case REQUIRES_EXPR
:
18947 RETURN (tsubst_requires_expr (t
, args
, complain
, in_decl
));
18949 case NON_LVALUE_EXPR
:
18950 case VIEW_CONVERT_EXPR
:
18951 /* We should only see these for location wrapper nodes, or within
18952 instantiate_non_dependent_expr (when args is NULL_TREE). */
18953 gcc_assert (location_wrapper_p (t
) || args
== NULL_TREE
);
18954 if (location_wrapper_p (t
))
18955 RETURN (maybe_wrap_with_location (RECUR (TREE_OPERAND (t
, 0)),
18956 EXPR_LOCATION (t
)));
18960 /* Handle Objective-C++ constructs, if appropriate. */
18963 = objcp_tsubst_copy_and_build (t
, args
, complain
,
18964 in_decl
, /*function_p=*/false);
18968 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
18974 input_location
= loc
;
18978 /* Verify that the instantiated ARGS are valid. For type arguments,
18979 make sure that the type's linkage is ok. For non-type arguments,
18980 make sure they are constants if they are integral or enumerations.
18981 Emit an error under control of COMPLAIN, and return TRUE on error. */
18984 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
18986 if (dependent_template_arg_p (t
))
18988 if (ARGUMENT_PACK_P (t
))
18990 tree vec
= ARGUMENT_PACK_ARGS (t
);
18991 int len
= TREE_VEC_LENGTH (vec
);
18992 bool result
= false;
18995 for (i
= 0; i
< len
; ++i
)
18996 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
19000 else if (TYPE_P (t
))
19002 /* [basic.link]: A name with no linkage (notably, the name
19003 of a class or enumeration declared in a local scope)
19004 shall not be used to declare an entity with linkage.
19005 This implies that names with no linkage cannot be used as
19008 DR 757 relaxes this restriction for C++0x. */
19009 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
19010 : no_linkage_check (t
, /*relaxed_p=*/false));
19014 /* DR 488 makes use of a type with no linkage cause
19015 type deduction to fail. */
19016 if (complain
& tf_error
)
19018 if (TYPE_UNNAMED_P (nt
))
19019 error ("%qT is/uses unnamed type", t
);
19021 error ("template argument for %qD uses local type %qT",
19026 /* In order to avoid all sorts of complications, we do not
19027 allow variably-modified types as template arguments. */
19028 else if (variably_modified_type_p (t
, NULL_TREE
))
19030 if (complain
& tf_error
)
19031 error ("%qT is a variably modified type", t
);
19035 /* Class template and alias template arguments should be OK. */
19036 else if (DECL_TYPE_TEMPLATE_P (t
))
19038 /* A non-type argument of integral or enumerated type must be a
19040 else if (TREE_TYPE (t
)
19041 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
19042 && !REFERENCE_REF_P (t
)
19043 && !TREE_CONSTANT (t
))
19045 if (complain
& tf_error
)
19046 error ("integral expression %qE is not constant", t
);
19053 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
19055 int ix
, len
= DECL_NTPARMS (tmpl
);
19056 bool result
= false;
19058 for (ix
= 0; ix
!= len
; ix
++)
19060 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
19063 if (result
&& (complain
& tf_error
))
19064 error (" trying to instantiate %qD", tmpl
);
19068 /* We're out of SFINAE context now, so generate diagnostics for the access
19069 errors we saw earlier when instantiating D from TMPL and ARGS. */
19072 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
19074 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
19075 tree type
= TREE_TYPE (pattern
);
19076 location_t loc
= input_location
;
19078 push_access_scope (d
);
19079 push_deferring_access_checks (dk_no_deferred
);
19080 input_location
= DECL_SOURCE_LOCATION (pattern
);
19081 tsubst (type
, args
, tf_warning_or_error
, d
);
19082 input_location
= loc
;
19083 pop_deferring_access_checks ();
19084 pop_access_scope (d
);
19087 /* Instantiate the indicated variable, function, or alias template TMPL with
19088 the template arguments in TARG_PTR. */
19091 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
19093 tree targ_ptr
= orig_args
;
19097 bool access_ok
= true;
19099 if (tmpl
== error_mark_node
)
19100 return error_mark_node
;
19102 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
19104 /* If this function is a clone, handle it specially. */
19105 if (DECL_CLONED_FUNCTION_P (tmpl
))
19110 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
19111 DECL_CLONED_FUNCTION. */
19112 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
19113 targ_ptr
, complain
);
19114 if (spec
== error_mark_node
)
19115 return error_mark_node
;
19117 /* Look for the clone. */
19118 FOR_EACH_CLONE (clone
, spec
)
19119 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
19121 /* We should always have found the clone by now. */
19122 gcc_unreachable ();
19126 if (targ_ptr
== error_mark_node
)
19127 return error_mark_node
;
19129 /* Check to see if we already have this specialization. */
19130 gen_tmpl
= most_general_template (tmpl
);
19131 if (TMPL_ARGS_DEPTH (targ_ptr
)
19132 < TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
)))
19133 /* targ_ptr only has the innermost template args, so add the outer ones
19134 from tmpl, which could be either a partial instantiation or gen_tmpl (in
19135 the case of a non-dependent call within a template definition). */
19136 targ_ptr
= (add_outermost_template_args
19137 (DECL_TI_ARGS (DECL_TEMPLATE_RESULT (tmpl
)),
19140 /* It would be nice to avoid hashing here and then again in tsubst_decl,
19141 but it doesn't seem to be on the hot path. */
19142 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
19144 gcc_assert (tmpl
== gen_tmpl
19145 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
19147 || fndecl
== NULL_TREE
);
19149 if (spec
!= NULL_TREE
)
19151 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
19153 if (complain
& tf_error
)
19154 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
19155 return error_mark_node
;
19160 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
19162 return error_mark_node
;
19164 /* We are building a FUNCTION_DECL, during which the access of its
19165 parameters and return types have to be checked. However this
19166 FUNCTION_DECL which is the desired context for access checking
19167 is not built yet. We solve this chicken-and-egg problem by
19168 deferring all checks until we have the FUNCTION_DECL. */
19169 push_deferring_access_checks (dk_deferred
);
19171 /* Instantiation of the function happens in the context of the function
19172 template, not the context of the overload resolution we're doing. */
19173 push_to_top_level ();
19174 /* If there are dependent arguments, e.g. because we're doing partial
19175 ordering, make sure processing_template_decl stays set. */
19176 if (uses_template_parms (targ_ptr
))
19177 ++processing_template_decl
;
19178 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
19180 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
19181 complain
, gen_tmpl
, true);
19182 push_nested_class (ctx
);
19185 tree pattern
= DECL_TEMPLATE_RESULT (gen_tmpl
);
19187 fndecl
= NULL_TREE
;
19188 if (VAR_P (pattern
))
19190 /* We need to determine if we're using a partial or explicit
19191 specialization now, because the type of the variable could be
19193 tree tid
= lookup_template_variable (gen_tmpl
, targ_ptr
);
19194 tree elt
= most_specialized_partial_spec (tid
, complain
);
19195 if (elt
== error_mark_node
)
19196 pattern
= error_mark_node
;
19199 tree partial_tmpl
= TREE_VALUE (elt
);
19200 tree partial_args
= TREE_PURPOSE (elt
);
19201 tree partial_pat
= DECL_TEMPLATE_RESULT (partial_tmpl
);
19202 fndecl
= tsubst (partial_pat
, partial_args
, complain
, gen_tmpl
);
19206 /* Substitute template parameters to obtain the specialization. */
19207 if (fndecl
== NULL_TREE
)
19208 fndecl
= tsubst (pattern
, targ_ptr
, complain
, gen_tmpl
);
19209 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
19210 pop_nested_class ();
19211 pop_from_top_level ();
19213 if (fndecl
== error_mark_node
)
19215 pop_deferring_access_checks ();
19216 return error_mark_node
;
19219 /* The DECL_TI_TEMPLATE should always be the immediate parent
19220 template, not the most general template. */
19221 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
19222 DECL_TI_ARGS (fndecl
) = targ_ptr
;
19224 /* Now we know the specialization, compute access previously
19225 deferred. Do no access control for inheriting constructors,
19226 as we already checked access for the inherited constructor. */
19227 if (!(flag_new_inheriting_ctors
19228 && DECL_INHERITED_CTOR (fndecl
)))
19230 push_access_scope (fndecl
);
19231 if (!perform_deferred_access_checks (complain
))
19233 pop_access_scope (fndecl
);
19235 pop_deferring_access_checks ();
19237 /* If we've just instantiated the main entry point for a function,
19238 instantiate all the alternate entry points as well. We do this
19239 by cloning the instantiation of the main entry point, not by
19240 instantiating the template clones. */
19241 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
19242 clone_function_decl (fndecl
, /*update_methods=*/false);
19246 if (!(complain
& tf_error
))
19248 /* Remember to reinstantiate when we're out of SFINAE so the user
19249 can see the errors. */
19250 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
19252 return error_mark_node
;
19257 /* Wrapper for instantiate_template_1. */
19260 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
19263 timevar_push (TV_TEMPLATE_INST
);
19264 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
19265 timevar_pop (TV_TEMPLATE_INST
);
19269 /* Instantiate the alias template TMPL with ARGS. Also push a template
19270 instantiation level, which instantiate_template doesn't do because
19271 functions and variables have sufficient context established by the
19275 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
19277 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
19278 return error_mark_node
;
19279 if (!push_tinst_level (tmpl
, args
))
19280 return error_mark_node
;
19283 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
19284 args
, tmpl
, complain
,
19285 /*require_all_args=*/true,
19286 /*use_default_args=*/true);
19288 tree r
= instantiate_template (tmpl
, args
, complain
);
19289 pop_tinst_level ();
19294 /* PARM is a template parameter pack for FN. Returns true iff
19295 PARM is used in a deducible way in the argument list of FN. */
19298 pack_deducible_p (tree parm
, tree fn
)
19300 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
19301 for (; t
; t
= TREE_CHAIN (t
))
19303 tree type
= TREE_VALUE (t
);
19305 if (!PACK_EXPANSION_P (type
))
19307 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
19308 packs
; packs
= TREE_CHAIN (packs
))
19309 if (template_args_equal (TREE_VALUE (packs
), parm
))
19311 /* The template parameter pack is used in a function parameter
19312 pack. If this is the end of the parameter list, the
19313 template parameter pack is deducible. */
19314 if (TREE_CHAIN (t
) == void_list_node
)
19317 /* Otherwise, not. Well, it could be deduced from
19318 a non-pack parameter, but doing so would end up with
19319 a deduction mismatch, so don't bother. */
19323 /* The template parameter pack isn't used in any function parameter
19324 packs, but it might be used deeper, e.g. tuple<Args...>. */
19328 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
19329 NARGS elements of the arguments that are being used when calling
19330 it. TARGS is a vector into which the deduced template arguments
19333 Returns either a FUNCTION_DECL for the matching specialization of FN or
19334 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
19335 true, diagnostics will be printed to explain why it failed.
19337 If FN is a conversion operator, or we are trying to produce a specific
19338 specialization, RETURN_TYPE is the return type desired.
19340 The EXPLICIT_TARGS are explicit template arguments provided via a
19343 The parameter STRICT is one of:
19346 We are deducing arguments for a function call, as in
19347 [temp.deduct.call]. If RETURN_TYPE is non-null, we are
19348 deducing arguments for a call to the result of a conversion
19349 function template, as in [over.call.object].
19352 We are deducing arguments for a conversion function, as in
19353 [temp.deduct.conv].
19356 We are deducing arguments when doing an explicit instantiation
19357 as in [temp.explicit], when determining an explicit specialization
19358 as in [temp.expl.spec], or when taking the address of a function
19359 template, as in [temp.deduct.funcaddr]. */
19362 fn_type_unification (tree fn
,
19363 tree explicit_targs
,
19366 unsigned int nargs
,
19368 unification_kind_t strict
,
19375 tree decl
= NULL_TREE
;
19376 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
19378 static int deduction_depth
;
19381 if (flag_new_inheriting_ctors
)
19382 fn
= strip_inheriting_ctors (fn
);
19384 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
19385 tree r
= error_mark_node
;
19387 tree full_targs
= targs
;
19388 if (TMPL_ARGS_DEPTH (targs
)
19389 < TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (fn
)))
19390 full_targs
= (add_outermost_template_args
19391 (DECL_TI_ARGS (DECL_TEMPLATE_RESULT (fn
)),
19395 complain
|= tf_decltype
;
19397 /* In C++0x, it's possible to have a function template whose type depends
19398 on itself recursively. This is most obvious with decltype, but can also
19399 occur with enumeration scope (c++/48969). So we need to catch infinite
19400 recursion and reject the substitution at deduction time; this function
19401 will return error_mark_node for any repeated substitution.
19403 This also catches excessive recursion such as when f<N> depends on
19404 f<N-1> across all integers, and returns error_mark_node for all the
19405 substitutions back up to the initial one.
19407 This is, of course, not reentrant. */
19408 if (excessive_deduction_depth
)
19409 return error_mark_node
;
19412 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
19414 fntype
= TREE_TYPE (fn
);
19415 if (explicit_targs
)
19419 The specified template arguments must match the template
19420 parameters in kind (i.e., type, nontype, template), and there
19421 must not be more arguments than there are parameters;
19422 otherwise type deduction fails.
19424 Nontype arguments must match the types of the corresponding
19425 nontype template parameters, or must be convertible to the
19426 types of the corresponding nontype parameters as specified in
19427 _temp.arg.nontype_, otherwise type deduction fails.
19429 All references in the function type of the function template
19430 to the corresponding template parameters are replaced by the
19431 specified template argument values. If a substitution in a
19432 template parameter or in the function type of the function
19433 template results in an invalid type, type deduction fails. */
19434 int i
, len
= TREE_VEC_LENGTH (tparms
);
19435 location_t loc
= input_location
;
19436 bool incomplete
= false;
19438 if (explicit_targs
== error_mark_node
)
19441 if (TMPL_ARGS_DEPTH (explicit_targs
)
19442 < TMPL_ARGS_DEPTH (full_targs
))
19443 explicit_targs
= add_outermost_template_args (full_targs
,
19446 /* Adjust any explicit template arguments before entering the
19447 substitution context. */
19449 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
19451 /*require_all_args=*/false,
19452 /*use_default_args=*/false));
19453 if (explicit_targs
== error_mark_node
)
19456 /* Substitute the explicit args into the function type. This is
19457 necessary so that, for instance, explicitly declared function
19458 arguments can match null pointed constants. If we were given
19459 an incomplete set of explicit args, we must not do semantic
19460 processing during substitution as we could create partial
19462 for (i
= 0; i
< len
; i
++)
19464 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
19465 bool parameter_pack
= false;
19466 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
19468 /* Dig out the actual parm. */
19469 if (TREE_CODE (parm
) == TYPE_DECL
19470 || TREE_CODE (parm
) == TEMPLATE_DECL
)
19472 parm
= TREE_TYPE (parm
);
19473 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
19475 else if (TREE_CODE (parm
) == PARM_DECL
)
19477 parm
= DECL_INITIAL (parm
);
19478 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
19481 if (!parameter_pack
&& targ
== NULL_TREE
)
19482 /* No explicit argument for this template parameter. */
19485 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
19487 /* Mark the argument pack as "incomplete". We could
19488 still deduce more arguments during unification.
19489 We remove this mark in type_unification_real. */
19492 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
19493 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
19494 = ARGUMENT_PACK_ARGS (targ
);
19497 /* We have some incomplete argument packs. */
19502 if (!push_tinst_level (fn
, explicit_targs
))
19504 excessive_deduction_depth
= true;
19507 processing_template_decl
+= incomplete
;
19508 input_location
= DECL_SOURCE_LOCATION (fn
);
19509 /* Ignore any access checks; we'll see them again in
19510 instantiate_template and they might have the wrong
19511 access path at this point. */
19512 push_deferring_access_checks (dk_deferred
);
19513 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
19514 complain
| tf_partial
| tf_fndecl_type
, NULL_TREE
);
19515 pop_deferring_access_checks ();
19516 input_location
= loc
;
19517 processing_template_decl
-= incomplete
;
19518 pop_tinst_level ();
19520 if (fntype
== error_mark_node
)
19523 /* Place the explicitly specified arguments in TARGS. */
19524 explicit_targs
= INNERMOST_TEMPLATE_ARGS (explicit_targs
);
19525 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
19526 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
19529 /* Never do unification on the 'this' parameter. */
19530 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
19532 if (return_type
&& strict
== DEDUCE_CALL
)
19534 /* We're deducing for a call to the result of a template conversion
19535 function. The parms we really want are in return_type. */
19536 if (POINTER_TYPE_P (return_type
))
19537 return_type
= TREE_TYPE (return_type
);
19538 parms
= TYPE_ARG_TYPES (return_type
);
19540 else if (return_type
)
19544 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
19545 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
19546 new_args
[0] = return_type
;
19547 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
19552 /* We allow incomplete unification without an error message here
19553 because the standard doesn't seem to explicitly prohibit it. Our
19554 callers must be ready to deal with unification failures in any
19557 /* If we aren't explaining yet, push tinst context so we can see where
19558 any errors (e.g. from class instantiations triggered by instantiation
19559 of default template arguments) come from. If we are explaining, this
19560 context is redundant. */
19561 if (!explain_p
&& !push_tinst_level (fn
, targs
))
19563 excessive_deduction_depth
= true;
19567 /* type_unification_real will pass back any access checks from default
19568 template argument substitution. */
19569 vec
<deferred_access_check
, va_gc
> *checks
;
19572 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
19573 full_targs
, parms
, args
, nargs
, /*subr=*/0,
19574 strict
, flags
, &checks
, explain_p
);
19576 pop_tinst_level ();
19580 /* Now that we have bindings for all of the template arguments,
19581 ensure that the arguments deduced for the template template
19582 parameters have compatible template parameter lists. We cannot
19583 check this property before we have deduced all template
19584 arguments, because the template parameter types of a template
19585 template parameter might depend on prior template parameters
19586 deduced after the template template parameter. The following
19587 ill-formed example illustrates this issue:
19589 template<typename T, template<T> class C> void f(C<5>, T);
19591 template<int N> struct X {};
19594 f(X<5>(), 5l); // error: template argument deduction fails
19597 The template parameter list of 'C' depends on the template type
19598 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
19599 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
19600 time that we deduce 'C'. */
19601 if (!template_template_parm_bindings_ok_p
19602 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
19604 unify_inconsistent_template_template_parameters (explain_p
);
19608 /* All is well so far. Now, check:
19612 When all template arguments have been deduced, all uses of
19613 template parameters in nondeduced contexts are replaced with
19614 the corresponding deduced argument values. If the
19615 substitution results in an invalid type, as described above,
19616 type deduction fails. */
19617 if (!push_tinst_level (fn
, targs
))
19619 excessive_deduction_depth
= true;
19623 /* Also collect access checks from the instantiation. */
19624 reopen_deferring_access_checks (checks
);
19626 decl
= instantiate_template (fn
, targs
, complain
);
19628 checks
= get_deferred_access_checks ();
19629 pop_deferring_access_checks ();
19631 pop_tinst_level ();
19633 if (decl
== error_mark_node
)
19636 /* Now perform any access checks encountered during substitution. */
19637 push_access_scope (decl
);
19638 ok
= perform_access_checks (checks
, complain
);
19639 pop_access_scope (decl
);
19643 /* If we're looking for an exact match, check that what we got
19644 is indeed an exact match. It might not be if some template
19645 parameters are used in non-deduced contexts. But don't check
19646 for an exact match if we have dependent template arguments;
19647 in that case we're doing partial ordering, and we already know
19648 that we have two candidates that will provide the actual type. */
19649 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
19651 tree substed
= TREE_TYPE (decl
);
19655 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
19657 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
19658 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
19659 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
19661 unify_type_mismatch (explain_p
, args
[i
],
19662 TREE_VALUE (sarg
));
19667 /* After doing deduction with the inherited constructor, actually return an
19668 instantiation of the inheriting constructor. */
19670 decl
= instantiate_template (orig_fn
, targs
, complain
);
19676 if (excessive_deduction_depth
)
19678 if (deduction_depth
== 0)
19679 /* Reset once we're all the way out. */
19680 excessive_deduction_depth
= false;
19686 /* Adjust types before performing type deduction, as described in
19687 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
19688 sections are symmetric. PARM is the type of a function parameter
19689 or the return type of the conversion function. ARG is the type of
19690 the argument passed to the call, or the type of the value
19691 initialized with the result of the conversion function.
19692 ARG_EXPR is the original argument expression, which may be null. */
19695 maybe_adjust_types_for_deduction (unification_kind_t strict
,
19708 /* Swap PARM and ARG throughout the remainder of this
19709 function; the handling is precisely symmetric since PARM
19710 will initialize ARG rather than vice versa. */
19711 std::swap (parm
, arg
);
19715 /* Core issue #873: Do the DR606 thing (see below) for these cases,
19716 too, but here handle it by stripping the reference from PARM
19717 rather than by adding it to ARG. */
19718 if (TREE_CODE (*parm
) == REFERENCE_TYPE
19719 && TYPE_REF_IS_RVALUE (*parm
)
19720 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
19721 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
19722 && TREE_CODE (*arg
) == REFERENCE_TYPE
19723 && !TYPE_REF_IS_RVALUE (*arg
))
19724 *parm
= TREE_TYPE (*parm
);
19725 /* Nothing else to do in this case. */
19729 gcc_unreachable ();
19732 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
19734 /* [temp.deduct.call]
19736 If P is not a reference type:
19738 --If A is an array type, the pointer type produced by the
19739 array-to-pointer standard conversion (_conv.array_) is
19740 used in place of A for type deduction; otherwise,
19742 --If A is a function type, the pointer type produced by
19743 the function-to-pointer standard conversion
19744 (_conv.func_) is used in place of A for type deduction;
19747 --If A is a cv-qualified type, the top level
19748 cv-qualifiers of A's type are ignored for type
19750 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
19751 *arg
= build_pointer_type (TREE_TYPE (*arg
));
19752 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
19753 *arg
= build_pointer_type (*arg
);
19755 *arg
= TYPE_MAIN_VARIANT (*arg
);
19758 /* [14.8.2.1/3 temp.deduct.call], "A forwarding reference is an rvalue
19759 reference to a cv-unqualified template parameter that does not represent a
19760 template parameter of a class template (during class template argument
19761 deduction (13.3.1.8)). If P is a forwarding reference and the argument is
19762 an lvalue, the type "lvalue reference to A" is used in place of A for type
19764 if (TREE_CODE (*parm
) == REFERENCE_TYPE
19765 && TYPE_REF_IS_RVALUE (*parm
)
19766 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
19767 && !TEMPLATE_TYPE_PARM_FOR_CLASS (TREE_TYPE (*parm
))
19768 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
19769 && (arg_expr
? lvalue_p (arg_expr
)
19770 /* try_one_overload doesn't provide an arg_expr, but
19771 functions are always lvalues. */
19772 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
19773 *arg
= build_reference_type (*arg
);
19775 /* [temp.deduct.call]
19777 If P is a cv-qualified type, the top level cv-qualifiers
19778 of P's type are ignored for type deduction. If P is a
19779 reference type, the type referred to by P is used for
19781 *parm
= TYPE_MAIN_VARIANT (*parm
);
19782 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
19784 *parm
= TREE_TYPE (*parm
);
19785 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
19788 /* DR 322. For conversion deduction, remove a reference type on parm
19789 too (which has been swapped into ARG). */
19790 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
19791 *arg
= TREE_TYPE (*arg
);
19796 /* Subroutine of unify_one_argument. PARM is a function parameter of a
19797 template which does contain any deducible template parameters; check if
19798 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
19799 unify_one_argument. */
19802 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
19803 int flags
, bool explain_p
)
19808 type
= TREE_TYPE (arg
);
19812 if (same_type_p (parm
, type
))
19813 return unify_success (explain_p
);
19815 if (strict
== DEDUCE_CONV
)
19817 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
19818 explain_p
? tf_warning_or_error
: tf_none
))
19819 return unify_success (explain_p
);
19821 else if (strict
!= DEDUCE_EXACT
)
19823 if (can_convert_arg (parm
, type
,
19824 TYPE_P (arg
) ? NULL_TREE
: arg
,
19825 flags
, explain_p
? tf_warning_or_error
: tf_none
))
19826 return unify_success (explain_p
);
19829 if (strict
== DEDUCE_EXACT
)
19830 return unify_type_mismatch (explain_p
, parm
, arg
);
19832 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
19835 static bool uses_deducible_template_parms (tree type
);
19837 /* Returns true iff the expression EXPR is one from which a template
19838 argument can be deduced. In other words, if it's an undecorated
19839 use of a template non-type parameter. */
19842 deducible_expression (tree expr
)
19844 /* Strip implicit conversions. */
19845 while (CONVERT_EXPR_P (expr
))
19846 expr
= TREE_OPERAND (expr
, 0);
19847 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
19850 /* Returns true iff the array domain DOMAIN uses a template parameter in a
19851 deducible way; that is, if it has a max value of <PARM> - 1. */
19854 deducible_array_bound (tree domain
)
19856 if (domain
== NULL_TREE
)
19859 tree max
= TYPE_MAX_VALUE (domain
);
19860 if (TREE_CODE (max
) != MINUS_EXPR
)
19863 return deducible_expression (TREE_OPERAND (max
, 0));
19866 /* Returns true iff the template arguments ARGS use a template parameter
19867 in a deducible way. */
19870 deducible_template_args (tree args
)
19872 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
19875 tree elt
= TREE_VEC_ELT (args
, i
);
19876 if (ARGUMENT_PACK_P (elt
))
19877 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
19880 if (PACK_EXPANSION_P (elt
))
19881 elt
= PACK_EXPANSION_PATTERN (elt
);
19882 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
19884 else if (TYPE_P (elt
))
19885 deducible
= uses_deducible_template_parms (elt
);
19887 deducible
= deducible_expression (elt
);
19895 /* Returns true iff TYPE contains any deducible references to template
19896 parameters, as per 14.8.2.5. */
19899 uses_deducible_template_parms (tree type
)
19901 if (PACK_EXPANSION_P (type
))
19902 type
= PACK_EXPANSION_PATTERN (type
);
19909 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
19910 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19916 if (POINTER_TYPE_P (type
))
19917 return uses_deducible_template_parms (TREE_TYPE (type
));
19919 /* T[integer-constant ]
19921 if (TREE_CODE (type
) == ARRAY_TYPE
)
19922 return (uses_deducible_template_parms (TREE_TYPE (type
))
19923 || deducible_array_bound (TYPE_DOMAIN (type
)));
19935 if (TYPE_PTRMEM_P (type
))
19936 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
19937 || (uses_deducible_template_parms
19938 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
19940 /* template-name <T> (where template-name refers to a class template)
19941 template-name <i> (where template-name refers to a class template) */
19942 if (CLASS_TYPE_P (type
)
19943 && CLASSTYPE_TEMPLATE_INFO (type
)
19944 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
19945 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
19946 (CLASSTYPE_TI_ARGS (type
)));
19951 if (TREE_CODE (type
) == FUNCTION_TYPE
19952 || TREE_CODE (type
) == METHOD_TYPE
)
19954 if (uses_deducible_template_parms (TREE_TYPE (type
)))
19956 tree parm
= TYPE_ARG_TYPES (type
);
19957 if (TREE_CODE (type
) == METHOD_TYPE
)
19958 parm
= TREE_CHAIN (parm
);
19959 for (; parm
; parm
= TREE_CHAIN (parm
))
19960 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
19967 /* Subroutine of type_unification_real and unify_pack_expansion to
19968 handle unification of a single P/A pair. Parameters are as
19969 for those functions. */
19972 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
19973 int subr
, unification_kind_t strict
,
19976 tree arg_expr
= NULL_TREE
;
19979 if (arg
== error_mark_node
|| parm
== error_mark_node
)
19980 return unify_invalid (explain_p
);
19981 if (arg
== unknown_type_node
)
19982 /* We can't deduce anything from this, but we might get all the
19983 template args from other function args. */
19984 return unify_success (explain_p
);
19986 /* Implicit conversions (Clause 4) will be performed on a function
19987 argument to convert it to the type of the corresponding function
19988 parameter if the parameter type contains no template-parameters that
19989 participate in template argument deduction. */
19990 if (strict
!= DEDUCE_EXACT
19991 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
19992 /* For function parameters with no deducible template parameters,
19993 just return. We'll check non-dependent conversions later. */
19994 return unify_success (explain_p
);
19999 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
20000 | UNIFY_ALLOW_MORE_CV_QUAL
20001 | UNIFY_ALLOW_DERIVED
);
20005 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
20009 arg_strict
= UNIFY_ALLOW_NONE
;
20013 gcc_unreachable ();
20016 /* We only do these transformations if this is the top-level
20017 parameter_type_list in a call or declaration matching; in other
20018 situations (nested function declarators, template argument lists) we
20019 won't be comparing a type to an expression, and we don't do any type
20025 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
20026 if (type_unknown_p (arg
))
20028 /* [temp.deduct.type] A template-argument can be
20029 deduced from a pointer to function or pointer
20030 to member function argument if the set of
20031 overloaded functions does not contain function
20032 templates and at most one of a set of
20033 overloaded functions provides a unique
20035 resolve_overloaded_unification (tparms
, targs
, parm
,
20037 arg_strict
, explain_p
);
20038 /* If a unique match was not found, this is a
20039 non-deduced context, so we still succeed. */
20040 return unify_success (explain_p
);
20044 arg
= unlowered_expr_type (arg
);
20045 if (arg
== error_mark_node
)
20046 return unify_invalid (explain_p
);
20050 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
20053 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
20054 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
20055 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
20057 /* For deduction from an init-list we need the actual list. */
20058 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
20060 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
20063 /* for_each_template_parm callback that always returns 0. */
20066 zero_r (tree
, void *)
20071 /* for_each_template_parm any_fn callback to handle deduction of a template
20072 type argument from the type of an array bound. */
20075 array_deduction_r (tree t
, void *data
)
20077 tree_pair_p d
= (tree_pair_p
)data
;
20078 tree
&tparms
= d
->purpose
;
20079 tree
&targs
= d
->value
;
20081 if (TREE_CODE (t
) == ARRAY_TYPE
)
20082 if (tree dom
= TYPE_DOMAIN (t
))
20083 if (tree max
= TYPE_MAX_VALUE (dom
))
20085 if (TREE_CODE (max
) == MINUS_EXPR
)
20086 max
= TREE_OPERAND (max
, 0);
20087 if (TREE_CODE (max
) == TEMPLATE_PARM_INDEX
)
20088 unify (tparms
, targs
, TREE_TYPE (max
), size_type_node
,
20089 UNIFY_ALLOW_NONE
, /*explain*/false);
20092 /* Keep walking. */
20096 /* Try to deduce any not-yet-deduced template type arguments from the type of
20097 an array bound. This is handled separately from unify because 14.8.2.5 says
20098 "The type of a type parameter is only deduced from an array bound if it is
20099 not otherwise deduced." */
20102 try_array_deduction (tree tparms
, tree targs
, tree parm
)
20104 tree_pair_s data
= { tparms
, targs
};
20105 hash_set
<tree
> visited
;
20106 for_each_template_parm (parm
, zero_r
, &data
, &visited
,
20107 /*nondeduced*/false, array_deduction_r
);
20110 /* Most parms like fn_type_unification.
20112 If SUBR is 1, we're being called recursively (to unify the
20113 arguments of a function or method parameter of a function
20116 CHECKS is a pointer to a vector of access checks encountered while
20117 substituting default template arguments. */
20120 type_unification_real (tree tparms
,
20124 unsigned int xnargs
,
20126 unification_kind_t strict
,
20128 vec
<deferred_access_check
, va_gc
> **checks
,
20133 int ntparms
= TREE_VEC_LENGTH (tparms
);
20134 int saw_undeduced
= 0;
20137 unsigned int nargs
;
20140 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
20141 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
20142 gcc_assert (ntparms
> 0);
20144 tree targs
= INNERMOST_TEMPLATE_ARGS (full_targs
);
20146 /* Reset the number of non-defaulted template arguments contained
20148 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
20156 while (parms
&& parms
!= void_list_node
20159 parm
= TREE_VALUE (parms
);
20161 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
20162 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
20163 /* For a function parameter pack that occurs at the end of the
20164 parameter-declaration-list, the type A of each remaining
20165 argument of the call is compared with the type P of the
20166 declarator-id of the function parameter pack. */
20169 parms
= TREE_CHAIN (parms
);
20171 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
20172 /* For a function parameter pack that does not occur at the
20173 end of the parameter-declaration-list, the type of the
20174 parameter pack is a non-deduced context. */
20180 if (unify_one_argument (tparms
, full_targs
, parm
, arg
, subr
, strict
,
20186 && parms
!= void_list_node
20187 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
20189 /* Unify the remaining arguments with the pack expansion type. */
20191 tree parmvec
= make_tree_vec (1);
20193 /* Allocate a TREE_VEC and copy in all of the arguments */
20194 argvec
= make_tree_vec (nargs
- ia
);
20195 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
20196 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
20198 /* Copy the parameter into parmvec. */
20199 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
20200 if (unify_pack_expansion (tparms
, full_targs
, parmvec
, argvec
, strict
,
20201 /*subr=*/subr
, explain_p
))
20204 /* Advance to the end of the list of parameters. */
20205 parms
= TREE_CHAIN (parms
);
20208 /* Fail if we've reached the end of the parm list, and more args
20209 are present, and the parm list isn't variadic. */
20210 if (ia
< nargs
&& parms
== void_list_node
)
20211 return unify_too_many_arguments (explain_p
, nargs
, ia
);
20212 /* Fail if parms are left and they don't have default values and
20213 they aren't all deduced as empty packs (c++/57397). This is
20214 consistent with sufficient_parms_p. */
20215 if (parms
&& parms
!= void_list_node
20216 && TREE_PURPOSE (parms
) == NULL_TREE
)
20218 unsigned int count
= nargs
;
20223 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
20226 p
= TREE_CHAIN (p
);
20228 while (p
&& p
!= void_list_node
);
20229 if (count
!= nargs
)
20230 return unify_too_few_arguments (explain_p
, ia
, count
,
20236 tsubst_flags_t complain
= (explain_p
20237 ? tf_warning_or_error
20239 bool tried_array_deduction
= (cxx_dialect
< cxx17
);
20241 for (i
= 0; i
< ntparms
; i
++)
20243 tree targ
= TREE_VEC_ELT (targs
, i
);
20244 tree tparm
= TREE_VEC_ELT (tparms
, i
);
20246 /* Clear the "incomplete" flags on all argument packs now so that
20247 substituting them into later default arguments works. */
20248 if (targ
&& ARGUMENT_PACK_P (targ
))
20250 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
20251 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
20254 if (targ
|| tparm
== error_mark_node
)
20256 tparm
= TREE_VALUE (tparm
);
20258 if (TREE_CODE (tparm
) == TYPE_DECL
20259 && !tried_array_deduction
)
20261 try_array_deduction (tparms
, targs
, xparms
);
20262 tried_array_deduction
= true;
20263 if (TREE_VEC_ELT (targs
, i
))
20267 /* If this is an undeduced nontype parameter that depends on
20268 a type parameter, try another pass; its type may have been
20269 deduced from a later argument than the one from which
20270 this parameter can be deduced. */
20271 if (TREE_CODE (tparm
) == PARM_DECL
20272 && uses_template_parms (TREE_TYPE (tparm
))
20273 && saw_undeduced
< 2)
20279 /* Core issue #226 (C++0x) [temp.deduct]:
20281 If a template argument has not been deduced, its
20282 default template argument, if any, is used.
20284 When we are in C++98 mode, TREE_PURPOSE will either
20285 be NULL_TREE or ERROR_MARK_NODE, so we do not need
20286 to explicitly check cxx_dialect here. */
20287 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
20288 /* OK, there is a default argument. Wait until after the
20289 conversion check to do substitution. */
20292 /* If the type parameter is a parameter pack, then it will
20293 be deduced to an empty parameter pack. */
20294 if (template_parameter_pack_p (tparm
))
20298 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
20300 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
20301 TREE_CONSTANT (arg
) = 1;
20304 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
20306 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
20308 TREE_VEC_ELT (targs
, i
) = arg
;
20312 return unify_parameter_deduction_failure (explain_p
, tparm
);
20315 /* DR 1391: All parameters have args, now check non-dependent parms for
20317 if (saw_undeduced
< 2)
20318 for (ia
= 0, parms
= xparms
, args
= xargs
, nargs
= xnargs
;
20319 parms
&& parms
!= void_list_node
&& ia
< nargs
; )
20321 parm
= TREE_VALUE (parms
);
20323 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
20324 && (!TREE_CHAIN (parms
)
20325 || TREE_CHAIN (parms
) == void_list_node
))
20326 /* For a function parameter pack that occurs at the end of the
20327 parameter-declaration-list, the type A of each remaining
20328 argument of the call is compared with the type P of the
20329 declarator-id of the function parameter pack. */
20332 parms
= TREE_CHAIN (parms
);
20334 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
20335 /* For a function parameter pack that does not occur at the
20336 end of the parameter-declaration-list, the type of the
20337 parameter pack is a non-deduced context. */
20343 if (uses_template_parms (parm
))
20345 if (check_non_deducible_conversion (parm
, arg
, strict
, flags
,
20350 /* Now substitute into the default template arguments. */
20351 for (i
= 0; i
< ntparms
; i
++)
20353 tree targ
= TREE_VEC_ELT (targs
, i
);
20354 tree tparm
= TREE_VEC_ELT (tparms
, i
);
20356 if (targ
|| tparm
== error_mark_node
)
20358 tree parm
= TREE_VALUE (tparm
);
20359 tree arg
= TREE_PURPOSE (tparm
);
20360 reopen_deferring_access_checks (*checks
);
20361 location_t save_loc
= input_location
;
20363 input_location
= DECL_SOURCE_LOCATION (parm
);
20364 if (saw_undeduced
== 1)
20365 ++processing_template_decl
;
20367 if (saw_undeduced
== 1
20368 && TREE_CODE (parm
) == PARM_DECL
20369 && uses_template_parms (TREE_TYPE (parm
)))
20371 /* The type of this non-type parameter depends on undeduced
20372 parameters. Don't try to use its default argument yet,
20373 but do check whether the arguments we already have cause
20374 substitution failure, so that that happens before we try
20375 later default arguments (78489). */
20376 tree type
= tsubst (TREE_TYPE (parm
), full_targs
, complain
,
20378 if (type
== error_mark_node
)
20379 arg
= error_mark_node
;
20385 arg
= tsubst_template_arg (arg
, full_targs
, complain
, NULL_TREE
);
20387 if (!uses_template_parms (arg
))
20388 arg
= convert_template_argument (parm
, arg
, full_targs
,
20389 complain
, i
, NULL_TREE
);
20390 else if (saw_undeduced
== 1)
20393 arg
= error_mark_node
;
20396 if (saw_undeduced
== 1)
20397 --processing_template_decl
;
20398 input_location
= save_loc
;
20399 *checks
= get_deferred_access_checks ();
20400 pop_deferring_access_checks ();
20402 if (arg
== error_mark_node
)
20406 TREE_VEC_ELT (targs
, i
) = arg
;
20407 /* The position of the first default template argument,
20408 is also the number of non-defaulted arguments in TARGS.
20410 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
20411 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
20415 if (saw_undeduced
++ == 1)
20419 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
20420 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
20422 return unify_success (explain_p
);
20425 /* Subroutine of type_unification_real. Args are like the variables
20426 at the call site. ARG is an overloaded function (or template-id);
20427 we try deducing template args from each of the overloads, and if
20428 only one succeeds, we go with that. Modifies TARGS and returns
20429 true on success. */
20432 resolve_overloaded_unification (tree tparms
,
20436 unification_kind_t strict
,
20440 tree tempargs
= copy_node (targs
);
20442 tree goodfn
= NULL_TREE
;
20445 if (TREE_CODE (arg
) == ADDR_EXPR
)
20447 arg
= TREE_OPERAND (arg
, 0);
20453 if (TREE_CODE (arg
) == COMPONENT_REF
)
20454 /* Handle `&x' where `x' is some static or non-static member
20456 arg
= TREE_OPERAND (arg
, 1);
20458 if (TREE_CODE (arg
) == OFFSET_REF
)
20459 arg
= TREE_OPERAND (arg
, 1);
20461 /* Strip baselink information. */
20462 if (BASELINK_P (arg
))
20463 arg
= BASELINK_FUNCTIONS (arg
);
20465 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
20467 /* If we got some explicit template args, we need to plug them into
20468 the affected templates before we try to unify, in case the
20469 explicit args will completely resolve the templates in question. */
20472 tree expl_subargs
= TREE_OPERAND (arg
, 1);
20473 arg
= TREE_OPERAND (arg
, 0);
20475 for (lkp_iterator
iter (arg
); iter
; ++iter
)
20478 tree subargs
, elem
;
20480 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
20483 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
20484 expl_subargs
, NULL_TREE
, tf_none
,
20485 /*require_all_args=*/true,
20486 /*use_default_args=*/true);
20487 if (subargs
!= error_mark_node
20488 && !any_dependent_template_arguments_p (subargs
))
20490 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
20491 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
20492 elem
, strict
, sub_strict
, addr_p
, explain_p
)
20493 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
20502 /* If no templates (or more than one) are fully resolved by the
20503 explicit arguments, this template-id is a non-deduced context; it
20504 could still be OK if we deduce all template arguments for the
20505 enclosing call through other arguments. */
20509 else if (TREE_CODE (arg
) != OVERLOAD
20510 && TREE_CODE (arg
) != FUNCTION_DECL
)
20511 /* If ARG is, for example, "(0, &f)" then its type will be unknown
20512 -- but the deduction does not succeed because the expression is
20513 not just the function on its own. */
20516 for (lkp_iterator
iter (arg
); iter
; ++iter
)
20519 if (try_one_overload (tparms
, targs
, tempargs
, parm
, TREE_TYPE (fn
),
20520 strict
, sub_strict
, addr_p
, explain_p
)
20521 && (!goodfn
|| !decls_match (goodfn
, fn
)))
20528 /* [temp.deduct.type] A template-argument can be deduced from a pointer
20529 to function or pointer to member function argument if the set of
20530 overloaded functions does not contain function templates and at most
20531 one of a set of overloaded functions provides a unique match.
20533 So if we found multiple possibilities, we return success but don't
20534 deduce anything. */
20538 int i
= TREE_VEC_LENGTH (targs
);
20540 if (TREE_VEC_ELT (tempargs
, i
))
20542 tree old
= TREE_VEC_ELT (targs
, i
);
20543 tree new_
= TREE_VEC_ELT (tempargs
, i
);
20544 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
20545 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
20546 /* Don't forget explicit template arguments in a pack. */
20547 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
20548 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
20549 TREE_VEC_ELT (targs
, i
) = new_
;
20558 /* Core DR 115: In contexts where deduction is done and fails, or in
20559 contexts where deduction is not done, if a template argument list is
20560 specified and it, along with any default template arguments, identifies
20561 a single function template specialization, then the template-id is an
20562 lvalue for the function template specialization. */
20565 resolve_nondeduced_context (tree orig_expr
, tsubst_flags_t complain
)
20567 tree expr
, offset
, baselink
;
20570 if (!type_unknown_p (orig_expr
))
20575 offset
= NULL_TREE
;
20576 baselink
= NULL_TREE
;
20578 if (TREE_CODE (expr
) == ADDR_EXPR
)
20580 expr
= TREE_OPERAND (expr
, 0);
20583 if (TREE_CODE (expr
) == OFFSET_REF
)
20586 expr
= TREE_OPERAND (expr
, 1);
20588 if (BASELINK_P (expr
))
20591 expr
= BASELINK_FUNCTIONS (expr
);
20594 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
20597 tree goodfn
= NULL_TREE
;
20599 /* If we got some explicit template args, we need to plug them into
20600 the affected templates before we try to unify, in case the
20601 explicit args will completely resolve the templates in question. */
20603 tree expl_subargs
= TREE_OPERAND (expr
, 1);
20604 tree arg
= TREE_OPERAND (expr
, 0);
20605 tree badfn
= NULL_TREE
;
20606 tree badargs
= NULL_TREE
;
20608 for (lkp_iterator
iter (arg
); iter
; ++iter
)
20611 tree subargs
, elem
;
20613 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
20616 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
20617 expl_subargs
, NULL_TREE
, tf_none
,
20618 /*require_all_args=*/true,
20619 /*use_default_args=*/true);
20620 if (subargs
!= error_mark_node
20621 && !any_dependent_template_arguments_p (subargs
))
20623 elem
= instantiate_template (fn
, subargs
, tf_none
);
20624 if (elem
== error_mark_node
)
20629 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
20638 mark_used (goodfn
);
20641 expr
= build_baselink (BASELINK_BINFO (baselink
),
20642 BASELINK_ACCESS_BINFO (baselink
),
20643 expr
, BASELINK_OPTYPE (baselink
));
20647 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
20648 expr
= build_offset_ref (base
, expr
, addr
, complain
);
20651 expr
= cp_build_addr_expr (expr
, complain
);
20654 else if (good
== 0 && badargs
&& (complain
& tf_error
))
20655 /* There were no good options and at least one bad one, so let the
20656 user know what the problem is. */
20657 instantiate_template (badfn
, badargs
, complain
);
20662 /* Subroutine of resolve_overloaded_unification; does deduction for a single
20663 overload. Fills TARGS with any deduced arguments, or error_mark_node if
20664 different overloads deduce different arguments for a given parm.
20665 ADDR_P is true if the expression for which deduction is being
20666 performed was of the form "& fn" rather than simply "fn".
20668 Returns 1 on success. */
20671 try_one_overload (tree tparms
,
20676 unification_kind_t strict
,
20685 if (arg
== error_mark_node
)
20688 /* [temp.deduct.type] A template-argument can be deduced from a pointer
20689 to function or pointer to member function argument if the set of
20690 overloaded functions does not contain function templates and at most
20691 one of a set of overloaded functions provides a unique match.
20693 So if this is a template, just return success. */
20695 if (uses_template_parms (arg
))
20698 if (TREE_CODE (arg
) == METHOD_TYPE
)
20699 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
20701 arg
= build_pointer_type (arg
);
20703 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
20705 /* We don't copy orig_targs for this because if we have already deduced
20706 some template args from previous args, unify would complain when we
20707 try to deduce a template parameter for the same argument, even though
20708 there isn't really a conflict. */
20709 nargs
= TREE_VEC_LENGTH (targs
);
20710 tempargs
= make_tree_vec (nargs
);
20712 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
20715 /* First make sure we didn't deduce anything that conflicts with
20716 explicitly specified args. */
20717 for (i
= nargs
; i
--; )
20719 tree elt
= TREE_VEC_ELT (tempargs
, i
);
20720 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
20724 else if (uses_template_parms (elt
))
20725 /* Since we're unifying against ourselves, we will fill in
20726 template args used in the function parm list with our own
20727 template parms. Discard them. */
20728 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
20729 else if (oldelt
&& ARGUMENT_PACK_P (oldelt
))
20731 /* Check that the argument at each index of the deduced argument pack
20732 is equivalent to the corresponding explicitly specified argument.
20733 We may have deduced more arguments than were explicitly specified,
20736 /* We used to assert ARGUMENT_PACK_INCOMPLETE_P (oldelt) here, but
20737 that's wrong if we deduce the same argument pack from multiple
20738 function arguments: it's only incomplete the first time. */
20740 tree explicit_pack
= ARGUMENT_PACK_ARGS (oldelt
);
20741 tree deduced_pack
= ARGUMENT_PACK_ARGS (elt
);
20743 if (TREE_VEC_LENGTH (deduced_pack
)
20744 < TREE_VEC_LENGTH (explicit_pack
))
20747 for (int j
= 0; j
< TREE_VEC_LENGTH (explicit_pack
); j
++)
20748 if (!template_args_equal (TREE_VEC_ELT (explicit_pack
, j
),
20749 TREE_VEC_ELT (deduced_pack
, j
)))
20752 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
20756 for (i
= nargs
; i
--; )
20758 tree elt
= TREE_VEC_ELT (tempargs
, i
);
20761 TREE_VEC_ELT (targs
, i
) = elt
;
20767 /* PARM is a template class (perhaps with unbound template
20768 parameters). ARG is a fully instantiated type. If ARG can be
20769 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
20770 TARGS are as for unify. */
20773 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
20776 tree copy_of_targs
;
20778 if (!CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
20780 else if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
20781 /* Matches anything. */;
20782 else if (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
20783 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
)))
20786 /* We need to make a new template argument vector for the call to
20787 unify. If we used TARGS, we'd clutter it up with the result of
20788 the attempted unification, even if this class didn't work out.
20789 We also don't want to commit ourselves to all the unifications
20790 we've already done, since unification is supposed to be done on
20791 an argument-by-argument basis. In other words, consider the
20792 following pathological case:
20794 template <int I, int J, int K>
20797 template <int I, int J>
20798 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
20800 template <int I, int J, int K>
20801 void f(S<I, J, K>, S<I, I, I>);
20810 Now, by the time we consider the unification involving `s2', we
20811 already know that we must have `f<0, 0, 0>'. But, even though
20812 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
20813 because there are two ways to unify base classes of S<0, 1, 2>
20814 with S<I, I, I>. If we kept the already deduced knowledge, we
20815 would reject the possibility I=1. */
20816 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
20818 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
20820 if (unify_bound_ttp_args (tparms
, copy_of_targs
, parm
, arg
, explain_p
))
20825 /* If unification failed, we're done. */
20826 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
20827 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
20833 /* Given a template type PARM and a class type ARG, find the unique
20834 base type in ARG that is an instance of PARM. We do not examine
20835 ARG itself; only its base-classes. If there is not exactly one
20836 appropriate base class, return NULL_TREE. PARM may be the type of
20837 a partial specialization, as well as a plain template type. Used
20840 static enum template_base_result
20841 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
20842 bool explain_p
, tree
*result
)
20844 tree rval
= NULL_TREE
;
20847 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
20849 binfo
= TYPE_BINFO (complete_type (arg
));
20852 /* The type could not be completed. */
20853 *result
= NULL_TREE
;
20854 return tbr_incomplete_type
;
20857 /* Walk in inheritance graph order. The search order is not
20858 important, and this avoids multiple walks of virtual bases. */
20859 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
20861 tree r
= try_class_unification (tparms
, targs
, parm
,
20862 BINFO_TYPE (binfo
), explain_p
);
20866 /* If there is more than one satisfactory baseclass, then:
20870 If they yield more than one possible deduced A, the type
20874 if (rval
&& !same_type_p (r
, rval
))
20876 *result
= NULL_TREE
;
20877 return tbr_ambiguous_baseclass
;
20885 return tbr_success
;
20888 /* Returns the level of DECL, which declares a template parameter. */
20891 template_decl_level (tree decl
)
20893 switch (TREE_CODE (decl
))
20896 case TEMPLATE_DECL
:
20897 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
20900 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
20903 gcc_unreachable ();
20908 /* Decide whether ARG can be unified with PARM, considering only the
20909 cv-qualifiers of each type, given STRICT as documented for unify.
20910 Returns nonzero iff the unification is OK on that basis. */
20913 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
20915 int arg_quals
= cp_type_quals (arg
);
20916 int parm_quals
= cp_type_quals (parm
);
20918 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
20919 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
20921 /* Although a CVR qualifier is ignored when being applied to a
20922 substituted template parameter ([8.3.2]/1 for example), that
20923 does not allow us to unify "const T" with "int&" because both
20924 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
20925 It is ok when we're allowing additional CV qualifiers
20926 at the outer level [14.8.2.1]/3,1st bullet. */
20927 if ((TREE_CODE (arg
) == REFERENCE_TYPE
20928 || TREE_CODE (arg
) == FUNCTION_TYPE
20929 || TREE_CODE (arg
) == METHOD_TYPE
)
20930 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
20933 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
20934 && (parm_quals
& TYPE_QUAL_RESTRICT
))
20938 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
20939 && (arg_quals
& parm_quals
) != parm_quals
)
20942 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
20943 && (parm_quals
& arg_quals
) != arg_quals
)
20949 /* Determines the LEVEL and INDEX for the template parameter PARM. */
20951 template_parm_level_and_index (tree parm
, int* level
, int* index
)
20953 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
20954 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
20955 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
20957 *index
= TEMPLATE_TYPE_IDX (parm
);
20958 *level
= TEMPLATE_TYPE_LEVEL (parm
);
20962 *index
= TEMPLATE_PARM_IDX (parm
);
20963 *level
= TEMPLATE_PARM_LEVEL (parm
);
20967 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
20969 if (unify (TP, TA, P, A, S, EP)) \
20973 /* Unifies the remaining arguments in PACKED_ARGS with the pack
20974 expansion at the end of PACKED_PARMS. Returns 0 if the type
20975 deduction succeeds, 1 otherwise. STRICT is the same as in
20976 fn_type_unification. CALL_ARGS_P is true iff PACKED_ARGS is actually a
20977 function call argument list. We'll need to adjust the arguments to make them
20978 types. SUBR tells us if this is from a recursive call to
20979 type_unification_real, or for comparing two template argument
20983 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
20984 tree packed_args
, unification_kind_t strict
,
20985 bool subr
, bool explain_p
)
20988 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
20989 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
20990 tree pack
, packs
= NULL_TREE
;
20991 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
20993 /* Add in any args remembered from an earlier partial instantiation. */
20994 targs
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (parm
), targs
);
20995 int levels
= TMPL_ARGS_DEPTH (targs
);
20997 packed_args
= expand_template_argument_pack (packed_args
);
20999 int len
= TREE_VEC_LENGTH (packed_args
);
21001 /* Determine the parameter packs we will be deducing from the
21002 pattern, and record their current deductions. */
21003 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
21004 pack
; pack
= TREE_CHAIN (pack
))
21006 tree parm_pack
= TREE_VALUE (pack
);
21009 /* Only template parameter packs can be deduced, not e.g. function
21010 parameter packs or __bases or __integer_pack. */
21011 if (!TEMPLATE_PARM_P (parm_pack
))
21014 /* Determine the index and level of this parameter pack. */
21015 template_parm_level_and_index (parm_pack
, &level
, &idx
);
21016 if (level
< levels
)
21019 /* Keep track of the parameter packs and their corresponding
21021 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
21022 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
21025 /* Loop through all of the arguments that have not yet been
21026 unified and unify each with the pattern. */
21027 for (i
= start
; i
< len
; i
++)
21030 bool any_explicit
= false;
21031 tree arg
= TREE_VEC_ELT (packed_args
, i
);
21033 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
21034 or the element of its argument pack at the current index if
21035 this argument was explicitly specified. */
21036 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
21040 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
21043 if (TREE_VALUE (pack
)
21044 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
21045 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
21047 any_explicit
= true;
21048 arg
= TREE_VEC_ELT (pargs
, i
- start
);
21050 TMPL_ARG (targs
, level
, idx
) = arg
;
21053 /* If we had explicit template arguments, substitute them into the
21054 pattern before deduction. */
21057 /* Some arguments might still be unspecified or dependent. */
21059 ++processing_template_decl
;
21060 dependent
= any_dependent_template_arguments_p (targs
);
21062 --processing_template_decl
;
21063 parm
= tsubst (pattern
, targs
,
21064 explain_p
? tf_warning_or_error
: tf_none
,
21067 --processing_template_decl
;
21068 if (parm
== error_mark_node
)
21074 /* Unify the pattern with the current argument. */
21075 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
21079 /* For each parameter pack, collect the deduced value. */
21080 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
21083 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
21085 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
21086 TMPL_ARG (targs
, level
, idx
);
21090 /* Verify that the results of unification with the parameter packs
21091 produce results consistent with what we've seen before, and make
21092 the deduced argument packs available. */
21093 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
21095 tree old_pack
= TREE_VALUE (pack
);
21096 tree new_args
= TREE_TYPE (pack
);
21097 int i
, len
= TREE_VEC_LENGTH (new_args
);
21099 bool nondeduced_p
= false;
21101 /* By default keep the original deduced argument pack.
21102 If necessary, more specific code is going to update the
21103 resulting deduced argument later down in this function. */
21104 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
21105 TMPL_ARG (targs
, level
, idx
) = old_pack
;
21107 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
21108 actually deduce anything. */
21109 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
21110 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
21111 nondeduced_p
= true;
21115 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
21117 /* If we had fewer function args than explicit template args,
21118 just use the explicits. */
21119 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
21120 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
21121 if (len
< explicit_len
)
21122 new_args
= explicit_args
;
21128 /* Build the deduced *_ARGUMENT_PACK. */
21129 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
21131 result
= make_node (NONTYPE_ARGUMENT_PACK
);
21132 TREE_CONSTANT (result
) = 1;
21135 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
21137 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
21139 /* Note the deduced argument packs for this parameter
21141 TMPL_ARG (targs
, level
, idx
) = result
;
21143 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
21144 && (ARGUMENT_PACK_ARGS (old_pack
)
21145 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
21147 /* We only had the explicitly-provided arguments before, but
21148 now we have a complete set of arguments. */
21149 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
21151 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
21152 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
21153 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
21157 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
21158 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
21160 if (!comp_template_args (old_args
, new_args
,
21161 &bad_old_arg
, &bad_new_arg
))
21162 /* Inconsistent unification of this parameter pack. */
21163 return unify_parameter_pack_inconsistent (explain_p
,
21169 return unify_success (explain_p
);
21172 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
21173 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
21174 parameters and return value are as for unify. */
21177 unify_array_domain (tree tparms
, tree targs
,
21178 tree parm_dom
, tree arg_dom
,
21186 /* Our representation of array types uses "N - 1" as the
21187 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
21188 not an integer constant. We cannot unify arbitrarily
21189 complex expressions, so we eliminate the MINUS_EXPRs
21191 parm_max
= TYPE_MAX_VALUE (parm_dom
);
21192 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
21195 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
21196 parm_max
= TREE_OPERAND (parm_max
, 0);
21198 arg_max
= TYPE_MAX_VALUE (arg_dom
);
21199 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
21202 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
21203 trying to unify the type of a variable with the type
21204 of a template parameter. For example:
21206 template <unsigned int N>
21207 void f (char (&) [N]);
21214 Here, the type of the ARG will be "int [g(i)]", and
21215 may be a SAVE_EXPR, etc. */
21216 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
21217 return unify_vla_arg (explain_p
, arg_dom
);
21218 arg_max
= TREE_OPERAND (arg_max
, 0);
21221 /* If only one of the bounds used a MINUS_EXPR, compensate
21222 by adding one to the other bound. */
21223 if (parm_cst
&& !arg_cst
)
21224 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
21228 else if (arg_cst
&& !parm_cst
)
21229 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
21234 return unify (tparms
, targs
, parm_max
, arg_max
,
21235 UNIFY_ALLOW_INTEGER
, explain_p
);
21238 /* Returns whether T, a P or A in unify, is a type, template or expression. */
21240 enum pa_kind_t
{ pa_type
, pa_tmpl
, pa_expr
};
21245 if (PACK_EXPANSION_P (t
))
21246 t
= PACK_EXPANSION_PATTERN (t
);
21247 if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
21248 || TREE_CODE (t
) == UNBOUND_CLASS_TEMPLATE
21249 || DECL_TYPE_TEMPLATE_P (t
))
21251 else if (TYPE_P (t
))
21257 /* Deduce the value of template parameters. TPARMS is the (innermost)
21258 set of template parameters to a template. TARGS is the bindings
21259 for those template parameters, as determined thus far; TARGS may
21260 include template arguments for outer levels of template parameters
21261 as well. PARM is a parameter to a template function, or a
21262 subcomponent of that parameter; ARG is the corresponding argument.
21263 This function attempts to match PARM with ARG in a manner
21264 consistent with the existing assignments in TARGS. If more values
21265 are deduced, then TARGS is updated.
21267 Returns 0 if the type deduction succeeds, 1 otherwise. The
21268 parameter STRICT is a bitwise or of the following flags:
21271 Require an exact match between PARM and ARG.
21272 UNIFY_ALLOW_MORE_CV_QUAL:
21273 Allow the deduced ARG to be more cv-qualified (by qualification
21274 conversion) than ARG.
21275 UNIFY_ALLOW_LESS_CV_QUAL:
21276 Allow the deduced ARG to be less cv-qualified than ARG.
21277 UNIFY_ALLOW_DERIVED:
21278 Allow the deduced ARG to be a template base class of ARG,
21279 or a pointer to a template base class of the type pointed to by
21281 UNIFY_ALLOW_INTEGER:
21282 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
21283 case for more information.
21284 UNIFY_ALLOW_OUTER_LEVEL:
21285 This is the outermost level of a deduction. Used to determine validity
21286 of qualification conversions. A valid qualification conversion must
21287 have const qualified pointers leading up to the inner type which
21288 requires additional CV quals, except at the outer level, where const
21289 is not required [conv.qual]. It would be normal to set this flag in
21290 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
21291 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
21292 This is the outermost level of a deduction, and PARM can be more CV
21293 qualified at this point.
21294 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
21295 This is the outermost level of a deduction, and PARM can be less CV
21296 qualified at this point. */
21299 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
21305 int strict_in
= strict
;
21306 tsubst_flags_t complain
= (explain_p
21307 ? tf_warning_or_error
21310 /* I don't think this will do the right thing with respect to types.
21311 But the only case I've seen it in so far has been array bounds, where
21312 signedness is the only information lost, and I think that will be
21314 while (CONVERT_EXPR_P (parm
))
21315 parm
= TREE_OPERAND (parm
, 0);
21317 if (arg
== error_mark_node
)
21318 return unify_invalid (explain_p
);
21319 if (arg
== unknown_type_node
21320 || arg
== init_list_type_node
)
21321 /* We can't deduce anything from this, but we might get all the
21322 template args from other function args. */
21323 return unify_success (explain_p
);
21325 if (parm
== any_targ_node
|| arg
== any_targ_node
)
21326 return unify_success (explain_p
);
21328 /* If PARM uses template parameters, then we can't bail out here,
21329 even if ARG == PARM, since we won't record unifications for the
21330 template parameters. We might need them if we're trying to
21331 figure out which of two things is more specialized. */
21332 if (arg
== parm
&& !uses_template_parms (parm
))
21333 return unify_success (explain_p
);
21335 /* Handle init lists early, so the rest of the function can assume
21336 we're dealing with a type. */
21337 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
21341 tree orig_parm
= parm
;
21343 /* Replace T with std::initializer_list<T> for deduction. */
21344 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
21345 && flag_deduce_init_list
)
21346 parm
= listify (parm
);
21348 if (!is_std_init_list (parm
)
21349 && TREE_CODE (parm
) != ARRAY_TYPE
)
21350 /* We can only deduce from an initializer list argument if the
21351 parameter is std::initializer_list or an array; otherwise this
21352 is a non-deduced context. */
21353 return unify_success (explain_p
);
21355 if (TREE_CODE (parm
) == ARRAY_TYPE
)
21356 elttype
= TREE_TYPE (parm
);
21359 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
21360 /* Deduction is defined in terms of a single type, so just punt
21361 on the (bizarre) std::initializer_list<T...>. */
21362 if (PACK_EXPANSION_P (elttype
))
21363 return unify_success (explain_p
);
21366 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
21368 int elt_strict
= strict
;
21370 if (elt
== error_mark_node
)
21371 return unify_invalid (explain_p
);
21373 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
21375 tree type
= TREE_TYPE (elt
);
21376 if (type
== error_mark_node
)
21377 return unify_invalid (explain_p
);
21378 /* It should only be possible to get here for a call. */
21379 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
21380 elt_strict
|= maybe_adjust_types_for_deduction
21381 (DEDUCE_CALL
, &elttype
, &type
, elt
);
21385 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
21389 if (TREE_CODE (parm
) == ARRAY_TYPE
21390 && deducible_array_bound (TYPE_DOMAIN (parm
)))
21392 /* Also deduce from the length of the initializer list. */
21393 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
21394 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
21395 if (idx
== error_mark_node
)
21396 return unify_invalid (explain_p
);
21397 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
21401 /* If the std::initializer_list<T> deduction worked, replace the
21402 deduced A with std::initializer_list<A>. */
21403 if (orig_parm
!= parm
)
21405 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
21406 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
21407 targ
= listify (targ
);
21408 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
21410 return unify_success (explain_p
);
21413 /* If parm and arg aren't the same kind of thing (template, type, or
21414 expression), fail early. */
21415 if (pa_kind (parm
) != pa_kind (arg
))
21416 return unify_invalid (explain_p
);
21418 /* Immediately reject some pairs that won't unify because of
21419 cv-qualification mismatches. */
21420 if (TREE_CODE (arg
) == TREE_CODE (parm
)
21422 /* It is the elements of the array which hold the cv quals of an array
21423 type, and the elements might be template type parms. We'll check
21424 when we recurse. */
21425 && TREE_CODE (arg
) != ARRAY_TYPE
21426 /* We check the cv-qualifiers when unifying with template type
21427 parameters below. We want to allow ARG `const T' to unify with
21428 PARM `T' for example, when computing which of two templates
21429 is more specialized, for example. */
21430 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
21431 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
21432 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
21434 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
21435 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
21436 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
21437 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
21438 strict
&= ~UNIFY_ALLOW_DERIVED
;
21439 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
21440 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
21442 switch (TREE_CODE (parm
))
21444 case TYPENAME_TYPE
:
21446 case UNBOUND_CLASS_TEMPLATE
:
21447 /* In a type which contains a nested-name-specifier, template
21448 argument values cannot be deduced for template parameters used
21449 within the nested-name-specifier. */
21450 return unify_success (explain_p
);
21452 case TEMPLATE_TYPE_PARM
:
21453 case TEMPLATE_TEMPLATE_PARM
:
21454 case BOUND_TEMPLATE_TEMPLATE_PARM
:
21455 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
21456 if (error_operand_p (tparm
))
21457 return unify_invalid (explain_p
);
21459 if (TEMPLATE_TYPE_LEVEL (parm
)
21460 != template_decl_level (tparm
))
21461 /* The PARM is not one we're trying to unify. Just check
21462 to see if it matches ARG. */
21464 if (TREE_CODE (arg
) == TREE_CODE (parm
)
21465 && (is_auto (parm
) ? is_auto (arg
)
21466 : same_type_p (parm
, arg
)))
21467 return unify_success (explain_p
);
21469 return unify_type_mismatch (explain_p
, parm
, arg
);
21471 idx
= TEMPLATE_TYPE_IDX (parm
);
21472 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
21473 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
21474 if (error_operand_p (tparm
))
21475 return unify_invalid (explain_p
);
21477 /* Check for mixed types and values. */
21478 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
21479 && TREE_CODE (tparm
) != TYPE_DECL
)
21480 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
21481 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
21482 gcc_unreachable ();
21484 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
21486 if ((strict_in
& UNIFY_ALLOW_DERIVED
)
21487 && CLASS_TYPE_P (arg
))
21489 /* First try to match ARG directly. */
21490 tree t
= try_class_unification (tparms
, targs
, parm
, arg
,
21494 /* Otherwise, look for a suitable base of ARG, as below. */
21495 enum template_base_result r
;
21496 r
= get_template_base (tparms
, targs
, parm
, arg
,
21499 return unify_no_common_base (explain_p
, r
, parm
, arg
);
21503 /* ARG must be constructed from a template class or a template
21504 template parameter. */
21505 else if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
21506 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
21507 return unify_template_deduction_failure (explain_p
, parm
, arg
);
21509 /* Deduce arguments T, i from TT<T> or TT<i>. */
21510 if (unify_bound_ttp_args (tparms
, targs
, parm
, arg
, explain_p
))
21513 arg
= TYPE_TI_TEMPLATE (arg
);
21515 /* Fall through to deduce template name. */
21518 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
21519 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
21521 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
21523 /* Simple cases: Value already set, does match or doesn't. */
21524 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
21525 return unify_success (explain_p
);
21527 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
21531 /* If PARM is `const T' and ARG is only `int', we don't have
21532 a match unless we are allowing additional qualification.
21533 If ARG is `const int' and PARM is just `T' that's OK;
21534 that binds `const int' to `T'. */
21535 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
21537 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
21539 /* Consider the case where ARG is `const volatile int' and
21540 PARM is `const T'. Then, T should be `volatile int'. */
21541 arg
= cp_build_qualified_type_real
21542 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
21543 if (arg
== error_mark_node
)
21544 return unify_invalid (explain_p
);
21546 /* Simple cases: Value already set, does match or doesn't. */
21547 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
21548 return unify_success (explain_p
);
21550 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
21552 /* Make sure that ARG is not a variable-sized array. (Note
21553 that were talking about variable-sized arrays (like
21554 `int[n]'), rather than arrays of unknown size (like
21555 `int[]').) We'll get very confused by such a type since
21556 the bound of the array is not constant, and therefore
21557 not mangleable. Besides, such types are not allowed in
21558 ISO C++, so we can do as we please here. We do allow
21559 them for 'auto' deduction, since that isn't ABI-exposed. */
21560 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
21561 return unify_vla_arg (explain_p
, arg
);
21563 /* Strip typedefs as in convert_template_argument. */
21564 arg
= canonicalize_type_argument (arg
, tf_none
);
21567 /* If ARG is a parameter pack or an expansion, we cannot unify
21568 against it unless PARM is also a parameter pack. */
21569 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
21570 && !template_parameter_pack_p (parm
))
21571 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
21573 /* If the argument deduction results is a METHOD_TYPE,
21574 then there is a problem.
21575 METHOD_TYPE doesn't map to any real C++ type the result of
21576 the deduction can not be of that type. */
21577 if (TREE_CODE (arg
) == METHOD_TYPE
)
21578 return unify_method_type_error (explain_p
, arg
);
21580 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
21581 return unify_success (explain_p
);
21583 case TEMPLATE_PARM_INDEX
:
21584 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
21585 if (error_operand_p (tparm
))
21586 return unify_invalid (explain_p
);
21588 if (TEMPLATE_PARM_LEVEL (parm
)
21589 != template_decl_level (tparm
))
21591 /* The PARM is not one we're trying to unify. Just check
21592 to see if it matches ARG. */
21593 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
21594 && cp_tree_equal (parm
, arg
));
21596 unify_expression_unequal (explain_p
, parm
, arg
);
21600 idx
= TEMPLATE_PARM_IDX (parm
);
21601 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
21605 if ((strict
& UNIFY_ALLOW_INTEGER
)
21606 && TREE_TYPE (targ
) && TREE_TYPE (arg
)
21607 && CP_INTEGRAL_TYPE_P (TREE_TYPE (targ
)))
21608 /* We're deducing from an array bound, the type doesn't matter. */
21609 arg
= fold_convert (TREE_TYPE (targ
), arg
);
21610 int x
= !cp_tree_equal (targ
, arg
);
21612 unify_inconsistency (explain_p
, parm
, targ
, arg
);
21616 /* [temp.deduct.type] If, in the declaration of a function template
21617 with a non-type template-parameter, the non-type
21618 template-parameter is used in an expression in the function
21619 parameter-list and, if the corresponding template-argument is
21620 deduced, the template-argument type shall match the type of the
21621 template-parameter exactly, except that a template-argument
21622 deduced from an array bound may be of any integral type.
21623 The non-type parameter might use already deduced type parameters. */
21624 tparm
= TREE_TYPE (parm
);
21625 if (TEMPLATE_PARM_LEVEL (parm
) > TMPL_ARGS_DEPTH (targs
))
21626 /* We don't have enough levels of args to do any substitution. This
21627 can happen in the context of -fnew-ttp-matching. */;
21630 ++processing_template_decl
;
21631 tparm
= tsubst (tparm
, targs
, tf_none
, NULL_TREE
);
21632 --processing_template_decl
;
21634 if (tree a
= type_uses_auto (tparm
))
21636 tparm
= do_auto_deduction (tparm
, arg
, a
, complain
, adc_unify
);
21637 if (tparm
== error_mark_node
)
21642 if (!TREE_TYPE (arg
))
21643 /* Template-parameter dependent expression. Just accept it for now.
21644 It will later be processed in convert_template_argument. */
21646 else if (same_type_p (non_reference (TREE_TYPE (arg
)),
21647 non_reference (tparm
)))
21649 else if ((strict
& UNIFY_ALLOW_INTEGER
)
21650 && CP_INTEGRAL_TYPE_P (tparm
))
21651 /* Convert the ARG to the type of PARM; the deduced non-type
21652 template argument must exactly match the types of the
21653 corresponding parameter. */
21654 arg
= fold (build_nop (tparm
, arg
));
21655 else if (uses_template_parms (tparm
))
21657 /* We haven't deduced the type of this parameter yet. */
21658 if (cxx_dialect
>= cxx17
21659 /* We deduce from array bounds in try_array_deduction. */
21660 && !(strict
& UNIFY_ALLOW_INTEGER
))
21662 /* Deduce it from the non-type argument. */
21663 tree atype
= TREE_TYPE (arg
);
21664 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
21666 UNIFY_ALLOW_NONE
, explain_p
);
21669 /* Try again later. */
21670 return unify_success (explain_p
);
21673 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
21675 /* If ARG is a parameter pack or an expansion, we cannot unify
21676 against it unless PARM is also a parameter pack. */
21677 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
21678 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
21679 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
21682 bool removed_attr
= false;
21683 arg
= strip_typedefs_expr (arg
, &removed_attr
);
21685 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
21686 return unify_success (explain_p
);
21690 /* A pointer-to-member constant can be unified only with
21691 another constant. */
21692 if (TREE_CODE (arg
) != PTRMEM_CST
)
21693 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
21695 /* Just unify the class member. It would be useless (and possibly
21696 wrong, depending on the strict flags) to unify also
21697 PTRMEM_CST_CLASS, because we want to be sure that both parm and
21698 arg refer to the same variable, even if through different
21699 classes. For instance:
21701 struct A { int x; };
21704 Unification of &A::x and &B::x must succeed. */
21705 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
21706 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
21711 if (!TYPE_PTR_P (arg
))
21712 return unify_type_mismatch (explain_p
, parm
, arg
);
21714 /* [temp.deduct.call]
21716 A can be another pointer or pointer to member type that can
21717 be converted to the deduced A via a qualification
21718 conversion (_conv.qual_).
21720 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
21721 This will allow for additional cv-qualification of the
21722 pointed-to types if appropriate. */
21724 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
21725 /* The derived-to-base conversion only persists through one
21726 level of pointers. */
21727 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
21729 return unify (tparms
, targs
, TREE_TYPE (parm
),
21730 TREE_TYPE (arg
), strict
, explain_p
);
21733 case REFERENCE_TYPE
:
21734 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
21735 return unify_type_mismatch (explain_p
, parm
, arg
);
21736 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
21737 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
21740 if (TREE_CODE (arg
) != ARRAY_TYPE
)
21741 return unify_type_mismatch (explain_p
, parm
, arg
);
21742 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
21743 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
21744 return unify_type_mismatch (explain_p
, parm
, arg
);
21745 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
21746 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
21747 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
21748 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
21749 TYPE_DOMAIN (arg
), explain_p
);
21750 return unify_success (explain_p
);
21757 case ENUMERAL_TYPE
:
21760 if (TREE_CODE (arg
) != TREE_CODE (parm
))
21761 return unify_type_mismatch (explain_p
, parm
, arg
);
21763 /* We have already checked cv-qualification at the top of the
21765 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
21766 return unify_type_mismatch (explain_p
, parm
, arg
);
21768 /* As far as unification is concerned, this wins. Later checks
21769 will invalidate it if necessary. */
21770 return unify_success (explain_p
);
21772 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
21773 /* Type INTEGER_CST can come from ordinary constant template args. */
21775 while (CONVERT_EXPR_P (arg
))
21776 arg
= TREE_OPERAND (arg
, 0);
21778 if (TREE_CODE (arg
) != INTEGER_CST
)
21779 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
21780 return (tree_int_cst_equal (parm
, arg
)
21781 ? unify_success (explain_p
)
21782 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
21786 int i
, len
, argslen
;
21787 int parm_variadic_p
= 0;
21789 if (TREE_CODE (arg
) != TREE_VEC
)
21790 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
21792 len
= TREE_VEC_LENGTH (parm
);
21793 argslen
= TREE_VEC_LENGTH (arg
);
21795 /* Check for pack expansions in the parameters. */
21796 for (i
= 0; i
< len
; ++i
)
21798 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
21801 /* We can unify against something with a trailing
21803 parm_variadic_p
= 1;
21805 /* [temp.deduct.type]/9: If the template argument list of
21806 P contains a pack expansion that is not the last
21807 template argument, the entire template argument list
21808 is a non-deduced context. */
21809 return unify_success (explain_p
);
21813 /* If we don't have enough arguments to satisfy the parameters
21814 (not counting the pack expression at the end), or we have
21815 too many arguments for a parameter list that doesn't end in
21816 a pack expression, we can't unify. */
21817 if (parm_variadic_p
21818 ? argslen
< len
- parm_variadic_p
21820 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
21822 /* Unify all of the parameters that precede the (optional)
21823 pack expression. */
21824 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
21826 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
21827 TREE_VEC_ELT (parm
, i
),
21828 TREE_VEC_ELT (arg
, i
),
21829 UNIFY_ALLOW_NONE
, explain_p
);
21831 if (parm_variadic_p
)
21832 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
21834 /*subr=*/true, explain_p
);
21835 return unify_success (explain_p
);
21840 if (TREE_CODE (arg
) != TREE_CODE (parm
))
21841 return unify_type_mismatch (explain_p
, parm
, arg
);
21843 if (TYPE_PTRMEMFUNC_P (parm
))
21845 if (!TYPE_PTRMEMFUNC_P (arg
))
21846 return unify_type_mismatch (explain_p
, parm
, arg
);
21848 return unify (tparms
, targs
,
21849 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
21850 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
21851 strict
, explain_p
);
21853 else if (TYPE_PTRMEMFUNC_P (arg
))
21854 return unify_type_mismatch (explain_p
, parm
, arg
);
21856 if (CLASSTYPE_TEMPLATE_INFO (parm
))
21858 tree t
= NULL_TREE
;
21860 if (strict_in
& UNIFY_ALLOW_DERIVED
)
21862 /* First, we try to unify the PARM and ARG directly. */
21863 t
= try_class_unification (tparms
, targs
,
21864 parm
, arg
, explain_p
);
21868 /* Fallback to the special case allowed in
21869 [temp.deduct.call]:
21871 If P is a class, and P has the form
21872 template-id, then A can be a derived class of
21873 the deduced A. Likewise, if P is a pointer to
21874 a class of the form template-id, A can be a
21875 pointer to a derived class pointed to by the
21877 enum template_base_result r
;
21878 r
= get_template_base (tparms
, targs
, parm
, arg
,
21883 /* Don't give the derived diagnostic if we're
21884 already dealing with the same template. */
21886 = (CLASSTYPE_TEMPLATE_INFO (arg
)
21887 && (CLASSTYPE_TI_TEMPLATE (parm
)
21888 == CLASSTYPE_TI_TEMPLATE (arg
)));
21889 return unify_no_common_base (explain_p
&& !same_template
,
21894 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
21895 && (CLASSTYPE_TI_TEMPLATE (parm
)
21896 == CLASSTYPE_TI_TEMPLATE (arg
)))
21897 /* Perhaps PARM is something like S<U> and ARG is S<int>.
21898 Then, we should unify `int' and `U'. */
21901 /* There's no chance of unification succeeding. */
21902 return unify_type_mismatch (explain_p
, parm
, arg
);
21904 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
21905 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
21907 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
21908 return unify_type_mismatch (explain_p
, parm
, arg
);
21909 return unify_success (explain_p
);
21912 case FUNCTION_TYPE
:
21914 unsigned int nargs
;
21919 if (TREE_CODE (arg
) != TREE_CODE (parm
))
21920 return unify_type_mismatch (explain_p
, parm
, arg
);
21922 /* CV qualifications for methods can never be deduced, they must
21923 match exactly. We need to check them explicitly here,
21924 because type_unification_real treats them as any other
21925 cv-qualified parameter. */
21926 if (TREE_CODE (parm
) == METHOD_TYPE
21927 && (!check_cv_quals_for_unify
21929 class_of_this_parm (arg
),
21930 class_of_this_parm (parm
))))
21931 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
21932 if (TREE_CODE (arg
) == FUNCTION_TYPE
21933 && type_memfn_quals (parm
) != type_memfn_quals (arg
))
21934 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
21935 if (type_memfn_rqual (parm
) != type_memfn_rqual (arg
))
21936 return unify_type_mismatch (explain_p
, parm
, arg
);
21938 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
21939 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
21941 nargs
= list_length (TYPE_ARG_TYPES (arg
));
21942 args
= XALLOCAVEC (tree
, nargs
);
21943 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
21944 a
!= NULL_TREE
&& a
!= void_list_node
;
21945 a
= TREE_CHAIN (a
), ++i
)
21946 args
[i
] = TREE_VALUE (a
);
21949 if (type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
21950 args
, nargs
, 1, DEDUCE_EXACT
,
21951 LOOKUP_NORMAL
, NULL
, explain_p
))
21954 if (flag_noexcept_type
)
21956 tree pspec
= TYPE_RAISES_EXCEPTIONS (parm
);
21957 tree aspec
= canonical_eh_spec (TYPE_RAISES_EXCEPTIONS (arg
));
21958 if (pspec
== NULL_TREE
) pspec
= noexcept_false_spec
;
21959 if (aspec
== NULL_TREE
) aspec
= noexcept_false_spec
;
21960 if (TREE_PURPOSE (pspec
) && TREE_PURPOSE (aspec
)
21961 && uses_template_parms (TREE_PURPOSE (pspec
)))
21962 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_PURPOSE (pspec
),
21963 TREE_PURPOSE (aspec
),
21964 UNIFY_ALLOW_NONE
, explain_p
);
21965 else if (nothrow_spec_p (pspec
) && !nothrow_spec_p (aspec
))
21966 return unify_type_mismatch (explain_p
, parm
, arg
);
21973 /* Unify a pointer to member with a pointer to member function, which
21974 deduces the type of the member as a function type. */
21975 if (TYPE_PTRMEMFUNC_P (arg
))
21977 /* Check top-level cv qualifiers */
21978 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
21979 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
21981 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
21982 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
21983 UNIFY_ALLOW_NONE
, explain_p
);
21985 /* Determine the type of the function we are unifying against. */
21986 tree fntype
= static_fn_type (arg
);
21988 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
21991 if (TREE_CODE (arg
) != OFFSET_TYPE
)
21992 return unify_type_mismatch (explain_p
, parm
, arg
);
21993 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
21994 TYPE_OFFSET_BASETYPE (arg
),
21995 UNIFY_ALLOW_NONE
, explain_p
);
21996 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
21997 strict
, explain_p
);
22000 if (DECL_TEMPLATE_PARM_P (parm
))
22001 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
22002 if (arg
!= scalar_constant_value (parm
))
22003 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
22004 return unify_success (explain_p
);
22007 case TEMPLATE_DECL
:
22008 /* Matched cases are handled by the ARG == PARM test above. */
22009 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
22012 /* We might get a variable as a non-type template argument in parm if the
22013 corresponding parameter is type-dependent. Make any necessary
22014 adjustments based on whether arg is a reference. */
22015 if (CONSTANT_CLASS_P (arg
))
22016 parm
= fold_non_dependent_expr (parm
);
22017 else if (REFERENCE_REF_P (arg
))
22019 tree sub
= TREE_OPERAND (arg
, 0);
22021 if (TREE_CODE (sub
) == ADDR_EXPR
)
22022 arg
= TREE_OPERAND (sub
, 0);
22024 /* Now use the normal expression code to check whether they match. */
22027 case TYPE_ARGUMENT_PACK
:
22028 case NONTYPE_ARGUMENT_PACK
:
22029 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
22030 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
22033 case DECLTYPE_TYPE
:
22034 case UNDERLYING_TYPE
:
22035 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
22036 or UNDERLYING_TYPE nodes. */
22037 return unify_success (explain_p
);
22040 /* Unification fails if we hit an error node. */
22041 return unify_invalid (explain_p
);
22044 if (REFERENCE_REF_P (parm
))
22046 bool pexp
= PACK_EXPANSION_P (arg
);
22048 arg
= PACK_EXPANSION_PATTERN (arg
);
22049 if (REFERENCE_REF_P (arg
))
22050 arg
= TREE_OPERAND (arg
, 0);
22052 arg
= make_pack_expansion (arg
, complain
);
22053 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
22054 strict
, explain_p
);
22059 /* An unresolved overload is a nondeduced context. */
22060 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
22061 return unify_success (explain_p
);
22062 gcc_assert (EXPR_P (parm
) || TREE_CODE (parm
) == TRAIT_EXPR
);
22064 /* We must be looking at an expression. This can happen with
22068 void foo(S<I>, S<I + 2>);
22070 This is a "nondeduced context":
22074 The nondeduced contexts are:
22076 --A type that is a template-id in which one or more of
22077 the template-arguments is an expression that references
22078 a template-parameter.
22080 In these cases, we assume deduction succeeded, but don't
22081 actually infer any unifications. */
22083 if (!uses_template_parms (parm
)
22084 && !template_args_equal (parm
, arg
))
22085 return unify_expression_unequal (explain_p
, parm
, arg
);
22087 return unify_success (explain_p
);
22090 #undef RECUR_AND_CHECK_FAILURE
22092 /* Note that DECL can be defined in this translation unit, if
22096 mark_definable (tree decl
)
22099 DECL_NOT_REALLY_EXTERN (decl
) = 1;
22100 FOR_EACH_CLONE (clone
, decl
)
22101 DECL_NOT_REALLY_EXTERN (clone
) = 1;
22104 /* Called if RESULT is explicitly instantiated, or is a member of an
22105 explicitly instantiated class. */
22108 mark_decl_instantiated (tree result
, int extern_p
)
22110 SET_DECL_EXPLICIT_INSTANTIATION (result
);
22112 /* If this entity has already been written out, it's too late to
22113 make any modifications. */
22114 if (TREE_ASM_WRITTEN (result
))
22117 /* For anonymous namespace we don't need to do anything. */
22118 if (decl_anon_ns_mem_p (result
))
22120 gcc_assert (!TREE_PUBLIC (result
));
22124 if (TREE_CODE (result
) != FUNCTION_DECL
)
22125 /* The TREE_PUBLIC flag for function declarations will have been
22126 set correctly by tsubst. */
22127 TREE_PUBLIC (result
) = 1;
22129 /* This might have been set by an earlier implicit instantiation. */
22130 DECL_COMDAT (result
) = 0;
22133 DECL_NOT_REALLY_EXTERN (result
) = 0;
22136 mark_definable (result
);
22137 mark_needed (result
);
22138 /* Always make artificials weak. */
22139 if (DECL_ARTIFICIAL (result
) && flag_weak
)
22140 comdat_linkage (result
);
22141 /* For WIN32 we also want to put explicit instantiations in
22142 linkonce sections. */
22143 else if (TREE_PUBLIC (result
))
22144 maybe_make_one_only (result
);
22147 /* If EXTERN_P, then this function will not be emitted -- unless
22148 followed by an explicit instantiation, at which point its linkage
22149 will be adjusted. If !EXTERN_P, then this function will be
22150 emitted here. In neither circumstance do we want
22151 import_export_decl to adjust the linkage. */
22152 DECL_INTERFACE_KNOWN (result
) = 1;
22155 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
22156 important template arguments. If any are missing, we check whether
22157 they're important by using error_mark_node for substituting into any
22158 args that were used for partial ordering (the ones between ARGS and END)
22159 and seeing if it bubbles up. */
22162 check_undeduced_parms (tree targs
, tree args
, tree end
)
22164 bool found
= false;
22166 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
22167 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
22170 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
22174 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
22175 if (substed
== error_mark_node
)
22181 /* Given two function templates PAT1 and PAT2, return:
22183 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
22184 -1 if PAT2 is more specialized than PAT1.
22185 0 if neither is more specialized.
22187 LEN indicates the number of parameters we should consider
22188 (defaulted parameters should not be considered).
22190 The 1998 std underspecified function template partial ordering, and
22191 DR214 addresses the issue. We take pairs of arguments, one from
22192 each of the templates, and deduce them against each other. One of
22193 the templates will be more specialized if all the *other*
22194 template's arguments deduce against its arguments and at least one
22195 of its arguments *does* *not* deduce against the other template's
22196 corresponding argument. Deduction is done as for class templates.
22197 The arguments used in deduction have reference and top level cv
22198 qualifiers removed. Iff both arguments were originally reference
22199 types *and* deduction succeeds in both directions, an lvalue reference
22200 wins against an rvalue reference and otherwise the template
22201 with the more cv-qualified argument wins for that pairing (if
22202 neither is more cv-qualified, they both are equal). Unlike regular
22203 deduction, after all the arguments have been deduced in this way,
22204 we do *not* verify the deduced template argument values can be
22205 substituted into non-deduced contexts.
22207 The logic can be a bit confusing here, because we look at deduce1 and
22208 targs1 to see if pat2 is at least as specialized, and vice versa; if we
22209 can find template arguments for pat1 to make arg1 look like arg2, that
22210 means that arg2 is at least as specialized as arg1. */
22213 more_specialized_fn (tree pat1
, tree pat2
, int len
)
22215 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
22216 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
22217 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
22218 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
22219 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
22220 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
22221 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
22222 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
22223 tree origs1
, origs2
;
22224 bool lose1
= false;
22225 bool lose2
= false;
22227 /* Remove the this parameter from non-static member functions. If
22228 one is a non-static member function and the other is not a static
22229 member function, remove the first parameter from that function
22230 also. This situation occurs for operator functions where we
22231 locate both a member function (with this pointer) and non-member
22232 operator (with explicit first operand). */
22233 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
22235 len
--; /* LEN is the number of significant arguments for DECL1 */
22236 args1
= TREE_CHAIN (args1
);
22237 if (!DECL_STATIC_FUNCTION_P (decl2
))
22238 args2
= TREE_CHAIN (args2
);
22240 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
22242 args2
= TREE_CHAIN (args2
);
22243 if (!DECL_STATIC_FUNCTION_P (decl1
))
22246 args1
= TREE_CHAIN (args1
);
22250 /* If only one is a conversion operator, they are unordered. */
22251 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
22254 /* Consider the return type for a conversion function */
22255 if (DECL_CONV_FN_P (decl1
))
22257 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
22258 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
22262 processing_template_decl
++;
22268 /* Stop when an ellipsis is seen. */
22269 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
22271 tree arg1
= TREE_VALUE (args1
);
22272 tree arg2
= TREE_VALUE (args2
);
22273 int deduce1
, deduce2
;
22279 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
22280 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
22282 /* When both arguments are pack expansions, we need only
22283 unify the patterns themselves. */
22284 arg1
= PACK_EXPANSION_PATTERN (arg1
);
22285 arg2
= PACK_EXPANSION_PATTERN (arg2
);
22287 /* This is the last comparison we need to do. */
22291 /* DR 1847: If a particular P contains no template-parameters that
22292 participate in template argument deduction, that P is not used to
22293 determine the ordering. */
22294 if (!uses_deducible_template_parms (arg1
)
22295 && !uses_deducible_template_parms (arg2
))
22298 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
22300 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
22301 arg1
= TREE_TYPE (arg1
);
22302 quals1
= cp_type_quals (arg1
);
22305 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
22307 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
22308 arg2
= TREE_TYPE (arg2
);
22309 quals2
= cp_type_quals (arg2
);
22312 arg1
= TYPE_MAIN_VARIANT (arg1
);
22313 arg2
= TYPE_MAIN_VARIANT (arg2
);
22315 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
22317 int i
, len2
= remaining_arguments (args2
);
22318 tree parmvec
= make_tree_vec (1);
22319 tree argvec
= make_tree_vec (len2
);
22322 /* Setup the parameter vector, which contains only ARG1. */
22323 TREE_VEC_ELT (parmvec
, 0) = arg1
;
22325 /* Setup the argument vector, which contains the remaining
22327 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
22328 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
22330 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
22331 argvec
, DEDUCE_EXACT
,
22332 /*subr=*/true, /*explain_p=*/false)
22335 /* We cannot deduce in the other direction, because ARG1 is
22336 a pack expansion but ARG2 is not. */
22339 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
22341 int i
, len1
= remaining_arguments (args1
);
22342 tree parmvec
= make_tree_vec (1);
22343 tree argvec
= make_tree_vec (len1
);
22346 /* Setup the parameter vector, which contains only ARG1. */
22347 TREE_VEC_ELT (parmvec
, 0) = arg2
;
22349 /* Setup the argument vector, which contains the remaining
22351 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
22352 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
22354 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
22355 argvec
, DEDUCE_EXACT
,
22356 /*subr=*/true, /*explain_p=*/false)
22359 /* We cannot deduce in the other direction, because ARG2 is
22360 a pack expansion but ARG1 is not.*/
22366 /* The normal case, where neither argument is a pack
22368 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
22369 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
22371 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
22372 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
22376 /* If we couldn't deduce arguments for tparms1 to make arg1 match
22377 arg2, then arg2 is not as specialized as arg1. */
22383 /* "If, for a given type, deduction succeeds in both directions
22384 (i.e., the types are identical after the transformations above)
22385 and both P and A were reference types (before being replaced with
22386 the type referred to above):
22387 - if the type from the argument template was an lvalue reference and
22388 the type from the parameter template was not, the argument type is
22389 considered to be more specialized than the other; otherwise,
22390 - if the type from the argument template is more cv-qualified
22391 than the type from the parameter template (as described above),
22392 the argument type is considered to be more specialized than the other;
22394 - neither type is more specialized than the other." */
22396 if (deduce1
&& deduce2
)
22398 if (ref1
&& ref2
&& ref1
!= ref2
)
22405 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
22407 if ((quals1
& quals2
) == quals2
)
22409 if ((quals1
& quals2
) == quals1
)
22414 if (lose1
&& lose2
)
22415 /* We've failed to deduce something in either direction.
22416 These must be unordered. */
22421 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
22422 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
22423 /* We have already processed all of the arguments in our
22424 handing of the pack expansion type. */
22427 args1
= TREE_CHAIN (args1
);
22428 args2
= TREE_CHAIN (args2
);
22431 /* "In most cases, all template parameters must have values in order for
22432 deduction to succeed, but for partial ordering purposes a template
22433 parameter may remain without a value provided it is not used in the
22434 types being used for partial ordering."
22436 Thus, if we are missing any of the targs1 we need to substitute into
22437 origs1, then pat2 is not as specialized as pat1. This can happen when
22438 there is a nondeduced context. */
22439 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
22441 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
22444 processing_template_decl
--;
22446 /* If both deductions succeed, the partial ordering selects the more
22447 constrained template. */
22448 if (!lose1
&& !lose2
)
22450 tree c1
= get_constraints (DECL_TEMPLATE_RESULT (pat1
));
22451 tree c2
= get_constraints (DECL_TEMPLATE_RESULT (pat2
));
22452 lose1
= !subsumes_constraints (c1
, c2
);
22453 lose2
= !subsumes_constraints (c2
, c1
);
22456 /* All things being equal, if the next argument is a pack expansion
22457 for one function but not for the other, prefer the
22458 non-variadic function. FIXME this is bogus; see c++/41958. */
22460 && args1
&& TREE_VALUE (args1
)
22461 && args2
&& TREE_VALUE (args2
))
22463 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
22464 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
22467 if (lose1
== lose2
)
22475 /* Determine which of two partial specializations of TMPL is more
22478 PAT1 is a TREE_LIST whose TREE_VALUE is the TEMPLATE_DECL corresponding
22479 to the first partial specialization. The TREE_PURPOSE is the
22480 innermost set of template parameters for the partial
22481 specialization. PAT2 is similar, but for the second template.
22483 Return 1 if the first partial specialization is more specialized;
22484 -1 if the second is more specialized; 0 if neither is more
22487 See [temp.class.order] for information about determining which of
22488 two templates is more specialized. */
22491 more_specialized_partial_spec (tree tmpl
, tree pat1
, tree pat2
)
22495 bool any_deductions
= false;
22497 tree tmpl1
= TREE_VALUE (pat1
);
22498 tree tmpl2
= TREE_VALUE (pat2
);
22499 tree specargs1
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl1
)));
22500 tree specargs2
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl2
)));
22502 /* Just like what happens for functions, if we are ordering between
22503 different template specializations, we may encounter dependent
22504 types in the arguments, and we need our dependency check functions
22505 to behave correctly. */
22506 ++processing_template_decl
;
22507 targs
= get_partial_spec_bindings (tmpl
, tmpl1
, specargs2
);
22511 any_deductions
= true;
22514 targs
= get_partial_spec_bindings (tmpl
, tmpl2
, specargs1
);
22518 any_deductions
= true;
22520 --processing_template_decl
;
22522 /* If both deductions succeed, the partial ordering selects the more
22523 constrained template. */
22524 if (!winner
&& any_deductions
)
22525 return more_constrained (tmpl1
, tmpl2
);
22527 /* In the case of a tie where at least one of the templates
22528 has a parameter pack at the end, the template with the most
22529 non-packed parameters wins. */
22532 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
22533 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
22535 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
22536 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
22537 int len1
= TREE_VEC_LENGTH (args1
);
22538 int len2
= TREE_VEC_LENGTH (args2
);
22540 /* We don't count the pack expansion at the end. */
22541 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
22543 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
22548 else if (len1
< len2
)
22555 /* Return the template arguments that will produce the function signature
22556 DECL from the function template FN, with the explicit template
22557 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
22558 also match. Return NULL_TREE if no satisfactory arguments could be
22562 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
22564 int ntparms
= DECL_NTPARMS (fn
);
22565 tree targs
= make_tree_vec (ntparms
);
22566 tree decl_type
= TREE_TYPE (decl
);
22567 tree decl_arg_types
;
22569 unsigned int nargs
, ix
;
22572 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
22574 /* Never do unification on the 'this' parameter. */
22575 decl_arg_types
= skip_artificial_parms_for (decl
,
22576 TYPE_ARG_TYPES (decl_type
));
22578 nargs
= list_length (decl_arg_types
);
22579 args
= XALLOCAVEC (tree
, nargs
);
22580 for (arg
= decl_arg_types
, ix
= 0;
22581 arg
!= NULL_TREE
&& arg
!= void_list_node
;
22582 arg
= TREE_CHAIN (arg
), ++ix
)
22583 args
[ix
] = TREE_VALUE (arg
);
22585 if (fn_type_unification (fn
, explicit_args
, targs
,
22587 (check_rettype
|| DECL_CONV_FN_P (fn
)
22588 ? TREE_TYPE (decl_type
) : NULL_TREE
),
22589 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
22591 == error_mark_node
)
22597 /* Return the innermost template arguments that, when applied to a partial
22598 specialization SPEC_TMPL of TMPL, yield the ARGS.
22600 For example, suppose we have:
22602 template <class T, class U> struct S {};
22603 template <class T> struct S<T*, int> {};
22605 Then, suppose we want to get `S<double*, int>'. SPEC_TMPL will be the
22606 partial specialization and the ARGS will be {double*, int}. The resulting
22607 vector will be {double}, indicating that `T' is bound to `double'. */
22610 get_partial_spec_bindings (tree tmpl
, tree spec_tmpl
, tree args
)
22612 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
22614 = TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (spec_tmpl
)));
22615 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
22617 tree innermost_deduced_args
;
22619 innermost_deduced_args
= make_tree_vec (ntparms
);
22620 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
22622 deduced_args
= copy_node (args
);
22623 SET_TMPL_ARGS_LEVEL (deduced_args
,
22624 TMPL_ARGS_DEPTH (deduced_args
),
22625 innermost_deduced_args
);
22628 deduced_args
= innermost_deduced_args
;
22630 bool tried_array_deduction
= (cxx_dialect
< cxx17
);
22632 if (unify (tparms
, deduced_args
,
22633 INNERMOST_TEMPLATE_ARGS (spec_args
),
22634 INNERMOST_TEMPLATE_ARGS (args
),
22635 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
22638 for (i
= 0; i
< ntparms
; ++i
)
22639 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
22641 if (!tried_array_deduction
)
22643 try_array_deduction (tparms
, innermost_deduced_args
,
22644 INNERMOST_TEMPLATE_ARGS (spec_args
));
22645 tried_array_deduction
= true;
22646 if (TREE_VEC_ELT (innermost_deduced_args
, i
))
22652 if (!push_tinst_level (spec_tmpl
, deduced_args
))
22654 excessive_deduction_depth
= true;
22658 /* Verify that nondeduced template arguments agree with the type
22659 obtained from argument deduction.
22663 struct A { typedef int X; };
22664 template <class T, class U> struct C {};
22665 template <class T> struct C<T, typename T::X> {};
22667 Then with the instantiation `C<A, int>', we can deduce that
22668 `T' is `A' but unify () does not check whether `typename T::X'
22670 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
22672 if (spec_args
!= error_mark_node
)
22673 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
22674 INNERMOST_TEMPLATE_ARGS (spec_args
),
22675 tmpl
, tf_none
, false, false);
22677 pop_tinst_level ();
22679 if (spec_args
== error_mark_node
22680 /* We only need to check the innermost arguments; the other
22681 arguments will always agree. */
22682 || !comp_template_args_porder (INNERMOST_TEMPLATE_ARGS (spec_args
),
22683 INNERMOST_TEMPLATE_ARGS (args
)))
22686 /* Now that we have bindings for all of the template arguments,
22687 ensure that the arguments deduced for the template template
22688 parameters have compatible template parameter lists. See the use
22689 of template_template_parm_bindings_ok_p in fn_type_unification
22690 for more information. */
22691 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
22694 return deduced_args
;
22697 // Compare two function templates T1 and T2 by deducing bindings
22698 // from one against the other. If both deductions succeed, compare
22699 // constraints to see which is more constrained.
22701 more_specialized_inst (tree t1
, tree t2
)
22706 if (get_bindings (t1
, DECL_TEMPLATE_RESULT (t2
), NULL_TREE
, true))
22712 if (get_bindings (t2
, DECL_TEMPLATE_RESULT (t1
), NULL_TREE
, true))
22718 // If both deductions succeed, then one may be more constrained.
22719 if (count
== 2 && fate
== 0)
22720 fate
= more_constrained (t1
, t2
);
22725 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
22726 Return the TREE_LIST node with the most specialized template, if
22727 any. If there is no most specialized template, the error_mark_node
22730 Note that this function does not look at, or modify, the
22731 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
22732 returned is one of the elements of INSTANTIATIONS, callers may
22733 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
22734 and retrieve it from the value returned. */
22737 most_specialized_instantiation (tree templates
)
22741 ++processing_template_decl
;
22744 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
22746 gcc_assert (TREE_VALUE (champ
) != TREE_VALUE (fn
));
22747 int fate
= more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
));
22752 /* Equally specialized, move to next function. If there
22753 is no next function, nothing's most specialized. */
22754 fn
= TREE_CHAIN (fn
);
22762 /* Now verify that champ is better than everything earlier in the
22763 instantiation list. */
22764 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
)) {
22765 if (more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
)) != 1)
22772 processing_template_decl
--;
22775 return error_mark_node
;
22780 /* If DECL is a specialization of some template, return the most
22781 general such template. Otherwise, returns NULL_TREE.
22783 For example, given:
22785 template <class T> struct S { template <class U> void f(U); };
22787 if TMPL is `template <class U> void S<int>::f(U)' this will return
22788 the full template. This function will not trace past partial
22789 specializations, however. For example, given in addition:
22791 template <class T> struct S<T*> { template <class U> void f(U); };
22793 if TMPL is `template <class U> void S<int*>::f(U)' this will return
22794 `template <class T> template <class U> S<T*>::f(U)'. */
22797 most_general_template (tree decl
)
22799 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
22801 if (tree tinfo
= get_template_info (decl
))
22802 decl
= TI_TEMPLATE (tinfo
);
22803 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
22804 template friend, or a FIELD_DECL for a capture pack. */
22805 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
22809 /* Look for more and more general templates. */
22810 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
22812 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
22813 (See cp-tree.h for details.) */
22814 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
22817 if (CLASS_TYPE_P (TREE_TYPE (decl
))
22818 && !TYPE_DECL_ALIAS_P (TYPE_NAME (TREE_TYPE (decl
)))
22819 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
22822 /* Stop if we run into an explicitly specialized class template. */
22823 if (!DECL_NAMESPACE_SCOPE_P (decl
)
22824 && DECL_CONTEXT (decl
)
22825 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
22828 decl
= DECL_TI_TEMPLATE (decl
);
22834 /* Return the most specialized of the template partial specializations
22835 which can produce TARGET, a specialization of some class or variable
22836 template. The value returned is actually a TREE_LIST; the TREE_VALUE is
22837 a TEMPLATE_DECL node corresponding to the partial specialization, while
22838 the TREE_PURPOSE is the set of template arguments that must be
22839 substituted into the template pattern in order to generate TARGET.
22841 If the choice of partial specialization is ambiguous, a diagnostic
22842 is issued, and the error_mark_node is returned. If there are no
22843 partial specializations matching TARGET, then NULL_TREE is
22844 returned, indicating that the primary template should be used. */
22847 most_specialized_partial_spec (tree target
, tsubst_flags_t complain
)
22849 tree list
= NULL_TREE
;
22854 tree outer_args
= NULL_TREE
;
22857 if (TYPE_P (target
))
22859 tree tinfo
= CLASSTYPE_TEMPLATE_INFO (target
);
22860 tmpl
= TI_TEMPLATE (tinfo
);
22861 args
= TI_ARGS (tinfo
);
22863 else if (TREE_CODE (target
) == TEMPLATE_ID_EXPR
)
22865 tmpl
= TREE_OPERAND (target
, 0);
22866 args
= TREE_OPERAND (target
, 1);
22868 else if (VAR_P (target
))
22870 tree tinfo
= DECL_TEMPLATE_INFO (target
);
22871 tmpl
= TI_TEMPLATE (tinfo
);
22872 args
= TI_ARGS (tinfo
);
22875 gcc_unreachable ();
22877 tree main_tmpl
= most_general_template (tmpl
);
22879 /* For determining which partial specialization to use, only the
22880 innermost args are interesting. */
22881 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
22883 outer_args
= strip_innermost_template_args (args
, 1);
22884 args
= INNERMOST_TEMPLATE_ARGS (args
);
22887 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
22890 tree spec_tmpl
= TREE_VALUE (t
);
22894 /* Substitute in the template args from the enclosing class. */
22895 ++processing_template_decl
;
22896 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
22897 --processing_template_decl
;
22900 if (spec_tmpl
== error_mark_node
)
22901 return error_mark_node
;
22903 spec_args
= get_partial_spec_bindings (tmpl
, spec_tmpl
, args
);
22907 spec_args
= add_to_template_args (outer_args
, spec_args
);
22909 /* Keep the candidate only if the constraints are satisfied,
22910 or if we're not compiling with concepts. */
22912 || constraints_satisfied_p (spec_tmpl
, spec_args
))
22914 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
22915 TREE_TYPE (list
) = TREE_TYPE (t
);
22923 ambiguous_p
= false;
22926 t
= TREE_CHAIN (t
);
22927 for (; t
; t
= TREE_CHAIN (t
))
22929 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
22936 t
= TREE_CHAIN (t
);
22939 ambiguous_p
= true;
22948 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
22950 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
22953 ambiguous_p
= true;
22961 char *spaces
= NULL
;
22962 if (!(complain
& tf_error
))
22963 return error_mark_node
;
22964 if (TYPE_P (target
))
22965 error ("ambiguous template instantiation for %q#T", target
);
22967 error ("ambiguous template instantiation for %q#D", target
);
22968 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
22969 for (t
= list
; t
; t
= TREE_CHAIN (t
))
22971 tree subst
= build_tree_list (TREE_VALUE (t
), TREE_PURPOSE (t
));
22972 inform (DECL_SOURCE_LOCATION (TREE_VALUE (t
)),
22973 "%s %#qS", spaces
? spaces
: str
, subst
);
22974 spaces
= spaces
? spaces
: get_spaces (str
);
22977 return error_mark_node
;
22983 /* Explicitly instantiate DECL. */
22986 do_decl_instantiation (tree decl
, tree storage
)
22988 tree result
= NULL_TREE
;
22991 if (!decl
|| decl
== error_mark_node
)
22992 /* An error occurred, for which grokdeclarator has already issued
22993 an appropriate message. */
22995 else if (! DECL_LANG_SPECIFIC (decl
))
22997 error ("explicit instantiation of non-template %q#D", decl
);
23001 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
23002 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
23004 if (VAR_P (decl
) && !var_templ
)
23006 /* There is an asymmetry here in the way VAR_DECLs and
23007 FUNCTION_DECLs are handled by grokdeclarator. In the case of
23008 the latter, the DECL we get back will be marked as a
23009 template instantiation, and the appropriate
23010 DECL_TEMPLATE_INFO will be set up. This does not happen for
23011 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
23012 should handle VAR_DECLs as it currently handles
23014 if (!DECL_CLASS_SCOPE_P (decl
))
23016 error ("%qD is not a static data member of a class template", decl
);
23019 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
23020 if (!result
|| !VAR_P (result
))
23022 error ("no matching template for %qD found", decl
);
23025 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
23027 error ("type %qT for explicit instantiation %qD does not match "
23028 "declared type %qT", TREE_TYPE (result
), decl
,
23033 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
23035 error ("explicit instantiation of %q#D", decl
);
23041 /* Check for various error cases. Note that if the explicit
23042 instantiation is valid the RESULT will currently be marked as an
23043 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
23044 until we get here. */
23046 if (DECL_TEMPLATE_SPECIALIZATION (result
))
23048 /* DR 259 [temp.spec].
23050 Both an explicit instantiation and a declaration of an explicit
23051 specialization shall not appear in a program unless the explicit
23052 instantiation follows a declaration of the explicit specialization.
23054 For a given set of template parameters, if an explicit
23055 instantiation of a template appears after a declaration of an
23056 explicit specialization for that template, the explicit
23057 instantiation has no effect. */
23060 else if (DECL_EXPLICIT_INSTANTIATION (result
))
23064 No program shall explicitly instantiate any template more
23067 We check DECL_NOT_REALLY_EXTERN so as not to complain when
23068 the first instantiation was `extern' and the second is not,
23069 and EXTERN_P for the opposite case. */
23070 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
23071 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
23072 /* If an "extern" explicit instantiation follows an ordinary
23073 explicit instantiation, the template is instantiated. */
23077 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
23079 error ("no matching template for %qD found", result
);
23082 else if (!DECL_TEMPLATE_INFO (result
))
23084 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
23088 if (storage
== NULL_TREE
)
23090 else if (storage
== ridpointers
[(int) RID_EXTERN
])
23092 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
23093 pedwarn (input_location
, OPT_Wpedantic
,
23094 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
23099 error ("storage class %qD applied to template instantiation", storage
);
23101 check_explicit_instantiation_namespace (result
);
23102 mark_decl_instantiated (result
, extern_p
);
23104 instantiate_decl (result
, /*defer_ok=*/true,
23105 /*expl_inst_class_mem_p=*/false);
23109 mark_class_instantiated (tree t
, int extern_p
)
23111 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
23112 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
23113 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
23114 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
23117 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
23118 rest_of_type_compilation (t
, 1);
23122 /* Called from do_type_instantiation through binding_table_foreach to
23123 do recursive instantiation for the type bound in ENTRY. */
23125 bt_instantiate_type_proc (binding_entry entry
, void *data
)
23127 tree storage
= *(tree
*) data
;
23129 if (MAYBE_CLASS_TYPE_P (entry
->type
)
23130 && CLASSTYPE_TEMPLATE_INFO (entry
->type
)
23131 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
23132 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
23135 /* Perform an explicit instantiation of template class T. STORAGE, if
23136 non-null, is the RID for extern, inline or static. COMPLAIN is
23137 nonzero if this is called from the parser, zero if called recursively,
23138 since the standard is unclear (as detailed below). */
23141 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
23146 int previous_instantiation_extern_p
= 0;
23148 if (TREE_CODE (t
) == TYPE_DECL
)
23151 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
23154 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
23156 error ("explicit instantiation of non-class template %qD", tmpl
);
23158 error ("explicit instantiation of non-template type %qT", t
);
23164 if (!COMPLETE_TYPE_P (t
))
23166 if (complain
& tf_error
)
23167 error ("explicit instantiation of %q#T before definition of template",
23172 if (storage
!= NULL_TREE
)
23174 if (!in_system_header_at (input_location
))
23176 if (storage
== ridpointers
[(int) RID_EXTERN
])
23178 if (cxx_dialect
== cxx98
)
23179 pedwarn (input_location
, OPT_Wpedantic
,
23180 "ISO C++ 1998 forbids the use of %<extern%> on "
23181 "explicit instantiations");
23184 pedwarn (input_location
, OPT_Wpedantic
,
23185 "ISO C++ forbids the use of %qE"
23186 " on explicit instantiations", storage
);
23189 if (storage
== ridpointers
[(int) RID_INLINE
])
23191 else if (storage
== ridpointers
[(int) RID_EXTERN
])
23193 else if (storage
== ridpointers
[(int) RID_STATIC
])
23197 error ("storage class %qD applied to template instantiation",
23203 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
23205 /* DR 259 [temp.spec].
23207 Both an explicit instantiation and a declaration of an explicit
23208 specialization shall not appear in a program unless the explicit
23209 instantiation follows a declaration of the explicit specialization.
23211 For a given set of template parameters, if an explicit
23212 instantiation of a template appears after a declaration of an
23213 explicit specialization for that template, the explicit
23214 instantiation has no effect. */
23217 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
23221 No program shall explicitly instantiate any template more
23224 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
23225 instantiation was `extern'. If EXTERN_P then the second is.
23226 These cases are OK. */
23227 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
23229 if (!previous_instantiation_extern_p
&& !extern_p
23230 && (complain
& tf_error
))
23231 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
23233 /* If we've already instantiated the template, just return now. */
23234 if (!CLASSTYPE_INTERFACE_ONLY (t
))
23238 check_explicit_instantiation_namespace (TYPE_NAME (t
));
23239 mark_class_instantiated (t
, extern_p
);
23244 /* In contrast to implicit instantiation, where only the
23245 declarations, and not the definitions, of members are
23246 instantiated, we have here:
23250 The explicit instantiation of a class template specialization
23251 implies the instantiation of all of its members not
23252 previously explicitly specialized in the translation unit
23253 containing the explicit instantiation.
23255 Of course, we can't instantiate member template classes, since we
23256 don't have any arguments for them. Note that the standard is
23257 unclear on whether the instantiation of the members are
23258 *explicit* instantiations or not. However, the most natural
23259 interpretation is that it should be an explicit
23261 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= DECL_CHAIN (fld
))
23263 || (TREE_CODE (fld
) == FUNCTION_DECL
23265 && user_provided_p (fld
)))
23266 && DECL_TEMPLATE_INSTANTIATION (fld
))
23268 mark_decl_instantiated (fld
, extern_p
);
23270 instantiate_decl (fld
, /*defer_ok=*/true,
23271 /*expl_inst_class_mem_p=*/true);
23274 if (CLASSTYPE_NESTED_UTDS (t
))
23275 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
23276 bt_instantiate_type_proc
, &storage
);
23279 /* Given a function DECL, which is a specialization of TMPL, modify
23280 DECL to be a re-instantiation of TMPL with the same template
23281 arguments. TMPL should be the template into which tsubst'ing
23282 should occur for DECL, not the most general template.
23284 One reason for doing this is a scenario like this:
23287 void f(const T&, int i);
23289 void g() { f(3, 7); }
23292 void f(const T& t, const int i) { }
23294 Note that when the template is first instantiated, with
23295 instantiate_template, the resulting DECL will have no name for the
23296 first parameter, and the wrong type for the second. So, when we go
23297 to instantiate the DECL, we regenerate it. */
23300 regenerate_decl_from_template (tree decl
, tree tmpl
, tree args
)
23302 /* The arguments used to instantiate DECL, from the most general
23306 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
23308 /* Make sure that we can see identifiers, and compute access
23310 push_access_scope (decl
);
23312 if (TREE_CODE (decl
) == FUNCTION_DECL
)
23320 args_depth
= TMPL_ARGS_DEPTH (args
);
23321 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
23322 if (args_depth
> parms_depth
)
23323 args
= get_innermost_template_args (args
, parms_depth
);
23325 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
23326 args
, tf_error
, NULL_TREE
,
23327 /*defer_ok*/false);
23328 if (specs
&& specs
!= error_mark_node
)
23329 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
23332 /* Merge parameter declarations. */
23333 decl_parm
= skip_artificial_parms_for (decl
,
23334 DECL_ARGUMENTS (decl
));
23336 = skip_artificial_parms_for (code_pattern
,
23337 DECL_ARGUMENTS (code_pattern
));
23338 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
23343 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
23344 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
23345 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
23347 parm_type
= type_decays_to (parm_type
);
23348 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
23349 TREE_TYPE (decl_parm
) = parm_type
;
23350 attributes
= DECL_ATTRIBUTES (pattern_parm
);
23351 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
23353 DECL_ATTRIBUTES (decl_parm
) = attributes
;
23354 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
23356 decl_parm
= DECL_CHAIN (decl_parm
);
23357 pattern_parm
= DECL_CHAIN (pattern_parm
);
23359 /* Merge any parameters that match with the function parameter
23361 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
23364 tree expanded_types
;
23365 /* Expand the TYPE_PACK_EXPANSION that provides the types for
23366 the parameters in this function parameter pack. */
23367 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
23368 args
, tf_error
, NULL_TREE
);
23369 len
= TREE_VEC_LENGTH (expanded_types
);
23370 for (i
= 0; i
< len
; i
++)
23375 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
23376 /* Rename the parameter to include the index. */
23377 DECL_NAME (decl_parm
) =
23378 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
23379 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
23380 parm_type
= type_decays_to (parm_type
);
23381 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
23382 TREE_TYPE (decl_parm
) = parm_type
;
23383 attributes
= DECL_ATTRIBUTES (pattern_parm
);
23384 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
23386 DECL_ATTRIBUTES (decl_parm
) = attributes
;
23387 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
23389 decl_parm
= DECL_CHAIN (decl_parm
);
23392 /* Merge additional specifiers from the CODE_PATTERN. */
23393 if (DECL_DECLARED_INLINE_P (code_pattern
)
23394 && !DECL_DECLARED_INLINE_P (decl
))
23395 DECL_DECLARED_INLINE_P (decl
) = 1;
23397 else if (VAR_P (decl
))
23399 start_lambda_scope (decl
);
23400 DECL_INITIAL (decl
) =
23401 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
23402 tf_error
, DECL_TI_TEMPLATE (decl
),
23403 /*integral_constant_expression_p=*/false);
23404 finish_lambda_scope ();
23405 if (VAR_HAD_UNKNOWN_BOUND (decl
))
23406 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
23407 tf_error
, DECL_TI_TEMPLATE (decl
));
23410 gcc_unreachable ();
23412 pop_access_scope (decl
);
23415 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
23416 substituted to get DECL. */
23419 template_for_substitution (tree decl
)
23421 tree tmpl
= DECL_TI_TEMPLATE (decl
);
23423 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
23424 for the instantiation. This is not always the most general
23425 template. Consider, for example:
23428 struct S { template <class U> void f();
23429 template <> void f<int>(); };
23431 and an instantiation of S<double>::f<int>. We want TD to be the
23432 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
23433 while (/* An instantiation cannot have a definition, so we need a
23434 more general template. */
23435 DECL_TEMPLATE_INSTANTIATION (tmpl
)
23436 /* We must also deal with friend templates. Given:
23438 template <class T> struct S {
23439 template <class U> friend void f() {};
23442 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
23443 so far as the language is concerned, but that's still
23444 where we get the pattern for the instantiation from. On
23445 other hand, if the definition comes outside the class, say:
23447 template <class T> struct S {
23448 template <class U> friend void f();
23450 template <class U> friend void f() {}
23452 we don't need to look any further. That's what the check for
23453 DECL_INITIAL is for. */
23454 || (TREE_CODE (decl
) == FUNCTION_DECL
23455 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
23456 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
23458 /* The present template, TD, should not be a definition. If it
23459 were a definition, we should be using it! Note that we
23460 cannot restructure the loop to just keep going until we find
23461 a template with a definition, since that might go too far if
23462 a specialization was declared, but not defined. */
23464 /* Fetch the more general template. */
23465 tmpl
= DECL_TI_TEMPLATE (tmpl
);
23471 /* Returns true if we need to instantiate this template instance even if we
23472 know we aren't going to emit it. */
23475 always_instantiate_p (tree decl
)
23477 /* We always instantiate inline functions so that we can inline them. An
23478 explicit instantiation declaration prohibits implicit instantiation of
23479 non-inline functions. With high levels of optimization, we would
23480 normally inline non-inline functions -- but we're not allowed to do
23481 that for "extern template" functions. Therefore, we check
23482 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
23483 return ((TREE_CODE (decl
) == FUNCTION_DECL
23484 && (DECL_DECLARED_INLINE_P (decl
)
23485 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
23486 /* And we need to instantiate static data members so that
23487 their initializers are available in integral constant
23490 && decl_maybe_constant_var_p (decl
)));
23493 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
23494 instantiate it now, modifying TREE_TYPE (fn). Returns false on
23495 error, true otherwise. */
23498 maybe_instantiate_noexcept (tree fn
, tsubst_flags_t complain
)
23500 tree fntype
, spec
, noex
, clone
;
23502 /* Don't instantiate a noexcept-specification from template context. */
23503 if (processing_template_decl
23504 && (!flag_noexcept_type
|| type_dependent_expression_p (fn
)))
23507 if (DECL_CLONED_FUNCTION_P (fn
))
23508 fn
= DECL_CLONED_FUNCTION (fn
);
23509 fntype
= TREE_TYPE (fn
);
23510 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
23512 if (!spec
|| !TREE_PURPOSE (spec
))
23515 noex
= TREE_PURPOSE (spec
);
23517 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
23519 static hash_set
<tree
>* fns
= new hash_set
<tree
>;
23520 bool added
= false;
23521 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
23522 spec
= get_defaulted_eh_spec (fn
, complain
);
23523 else if (!(added
= !fns
->add (fn
)))
23525 /* If hash_set::add returns true, the element was already there. */
23526 location_t loc
= EXPR_LOC_OR_LOC (DEFERRED_NOEXCEPT_PATTERN (noex
),
23527 DECL_SOURCE_LOCATION (fn
));
23529 "exception specification of %qD depends on itself",
23531 spec
= noexcept_false_spec
;
23533 else if (push_tinst_level (fn
))
23535 push_access_scope (fn
);
23536 push_deferring_access_checks (dk_no_deferred
);
23537 input_location
= DECL_SOURCE_LOCATION (fn
);
23538 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
23539 DEFERRED_NOEXCEPT_ARGS (noex
),
23540 tf_warning_or_error
, fn
,
23541 /*function_p=*/false,
23542 /*integral_constant_expression_p=*/true);
23543 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
23544 pop_deferring_access_checks ();
23545 pop_access_scope (fn
);
23546 pop_tinst_level ();
23547 if (spec
== error_mark_node
)
23548 spec
= noexcept_false_spec
;
23551 spec
= noexcept_false_spec
;
23556 if (spec
== error_mark_node
)
23559 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
23562 FOR_EACH_CLONE (clone
, fn
)
23564 if (TREE_TYPE (clone
) == fntype
)
23565 TREE_TYPE (clone
) = TREE_TYPE (fn
);
23567 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
23573 /* We're starting to process the function INST, an instantiation of PATTERN;
23574 add their parameters to local_specializations. */
23577 register_parameter_specializations (tree pattern
, tree inst
)
23579 tree tmpl_parm
= DECL_ARGUMENTS (pattern
);
23580 tree spec_parm
= DECL_ARGUMENTS (inst
);
23581 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (inst
))
23583 register_local_specialization (spec_parm
, tmpl_parm
);
23584 spec_parm
= skip_artificial_parms_for (inst
, spec_parm
);
23585 tmpl_parm
= skip_artificial_parms_for (pattern
, tmpl_parm
);
23587 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
23589 if (!DECL_PACK_P (tmpl_parm
))
23591 register_local_specialization (spec_parm
, tmpl_parm
);
23592 spec_parm
= DECL_CHAIN (spec_parm
);
23596 /* Register the (value) argument pack as a specialization of
23597 TMPL_PARM, then move on. */
23598 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
23599 register_local_specialization (argpack
, tmpl_parm
);
23602 gcc_assert (!spec_parm
);
23605 /* Produce the definition of D, a _DECL generated from a template. If
23606 DEFER_OK is true, then we don't have to actually do the
23607 instantiation now; we just have to do it sometime. Normally it is
23608 an error if this is an explicit instantiation but D is undefined.
23609 EXPL_INST_CLASS_MEM_P is true iff D is a member of an explicitly
23610 instantiated class template. */
23613 instantiate_decl (tree d
, bool defer_ok
, bool expl_inst_class_mem_p
)
23615 tree tmpl
= DECL_TI_TEMPLATE (d
);
23622 bool pattern_defined
;
23623 location_t saved_loc
= input_location
;
23624 int saved_unevaluated_operand
= cp_unevaluated_operand
;
23625 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
23629 /* This function should only be used to instantiate templates for
23630 functions and static member variables. */
23631 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
23633 /* A concept is never instantiated. */
23634 gcc_assert (!DECL_DECLARED_CONCEPT_P (d
));
23636 /* Variables are never deferred; if instantiation is required, they
23637 are instantiated right away. That allows for better code in the
23638 case that an expression refers to the value of the variable --
23639 if the variable has a constant value the referring expression can
23640 take advantage of that fact. */
23644 /* Don't instantiate cloned functions. Instead, instantiate the
23645 functions they cloned. */
23646 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
23647 d
= DECL_CLONED_FUNCTION (d
);
23649 if (DECL_TEMPLATE_INSTANTIATED (d
)
23650 || (TREE_CODE (d
) == FUNCTION_DECL
23651 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
23652 || DECL_TEMPLATE_SPECIALIZATION (d
))
23653 /* D has already been instantiated or explicitly specialized, so
23654 there's nothing for us to do here.
23656 It might seem reasonable to check whether or not D is an explicit
23657 instantiation, and, if so, stop here. But when an explicit
23658 instantiation is deferred until the end of the compilation,
23659 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
23660 the instantiation. */
23663 /* Check to see whether we know that this template will be
23664 instantiated in some other file, as with "extern template"
23666 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
23668 /* In general, we do not instantiate such templates. */
23669 if (external_p
&& !always_instantiate_p (d
))
23672 gen_tmpl
= most_general_template (tmpl
);
23673 gen_args
= DECL_TI_ARGS (d
);
23675 if (tmpl
!= gen_tmpl
)
23676 /* We should already have the extra args. */
23677 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
23678 == TMPL_ARGS_DEPTH (gen_args
));
23679 /* And what's in the hash table should match D. */
23680 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
23681 || spec
== NULL_TREE
);
23683 /* This needs to happen before any tsubsting. */
23684 if (! push_tinst_level (d
))
23687 timevar_push (TV_TEMPLATE_INST
);
23689 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
23690 for the instantiation. */
23691 td
= template_for_substitution (d
);
23696 /* Look up an explicit specialization, if any. */
23697 tree tid
= lookup_template_variable (gen_tmpl
, gen_args
);
23698 tree elt
= most_specialized_partial_spec (tid
, tf_warning_or_error
);
23699 if (elt
&& elt
!= error_mark_node
)
23701 td
= TREE_VALUE (elt
);
23702 args
= TREE_PURPOSE (elt
);
23706 code_pattern
= DECL_TEMPLATE_RESULT (td
);
23708 /* We should never be trying to instantiate a member of a class
23709 template or partial specialization. */
23710 gcc_assert (d
!= code_pattern
);
23712 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
23713 || DECL_TEMPLATE_SPECIALIZATION (td
))
23714 /* In the case of a friend template whose definition is provided
23715 outside the class, we may have too many arguments. Drop the
23716 ones we don't need. The same is true for specializations. */
23717 args
= get_innermost_template_args
23718 (args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
23720 if (TREE_CODE (d
) == FUNCTION_DECL
)
23722 deleted_p
= DECL_DELETED_FN (code_pattern
);
23723 pattern_defined
= ((DECL_SAVED_TREE (code_pattern
) != NULL_TREE
23724 && DECL_INITIAL (code_pattern
) != error_mark_node
)
23725 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
23731 if (DECL_CLASS_SCOPE_P (code_pattern
))
23732 pattern_defined
= (! DECL_IN_AGGR_P (code_pattern
)
23733 || DECL_INLINE_VAR_P (code_pattern
));
23735 pattern_defined
= ! DECL_EXTERNAL (code_pattern
);
23738 /* We may be in the middle of deferred access check. Disable it now. */
23739 push_deferring_access_checks (dk_no_deferred
);
23741 /* Unless an explicit instantiation directive has already determined
23742 the linkage of D, remember that a definition is available for
23744 if (pattern_defined
23745 && !DECL_INTERFACE_KNOWN (d
)
23746 && !DECL_NOT_REALLY_EXTERN (d
))
23747 mark_definable (d
);
23749 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
23750 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
23751 input_location
= DECL_SOURCE_LOCATION (d
);
23753 /* If D is a member of an explicitly instantiated class template,
23754 and no definition is available, treat it like an implicit
23756 if (!pattern_defined
&& expl_inst_class_mem_p
23757 && DECL_EXPLICIT_INSTANTIATION (d
))
23759 /* Leave linkage flags alone on instantiations with anonymous
23761 if (TREE_PUBLIC (d
))
23763 DECL_NOT_REALLY_EXTERN (d
) = 0;
23764 DECL_INTERFACE_KNOWN (d
) = 0;
23766 SET_DECL_IMPLICIT_INSTANTIATION (d
);
23769 /* Defer all other templates, unless we have been explicitly
23770 forbidden from doing so. */
23771 if (/* If there is no definition, we cannot instantiate the
23774 /* If it's OK to postpone instantiation, do so. */
23776 /* If this is a static data member that will be defined
23777 elsewhere, we don't want to instantiate the entire data
23778 member, but we do want to instantiate the initializer so that
23779 we can substitute that elsewhere. */
23780 || (external_p
&& VAR_P (d
))
23781 /* Handle here a deleted function too, avoid generating
23782 its body (c++/61080). */
23785 /* The definition of the static data member is now required so
23786 we must substitute the initializer. */
23788 && !DECL_INITIAL (d
)
23789 && DECL_INITIAL (code_pattern
))
23793 bool const_init
= false;
23794 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
23796 ns
= decl_namespace_context (d
);
23797 push_nested_namespace (ns
);
23799 push_nested_class (DECL_CONTEXT (d
));
23800 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
23802 tf_warning_or_error
, NULL_TREE
,
23803 /*integral_constant_expression_p=*/false);
23804 /* If instantiating the initializer involved instantiating this
23805 again, don't call cp_finish_decl twice. */
23806 if (!DECL_INITIAL (d
))
23808 /* Make sure the initializer is still constant, in case of
23809 circular dependency (template/instantiate6.C). */
23811 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
23812 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
23813 /*asmspec_tree=*/NULL_TREE
,
23814 LOOKUP_ONLYCONVERTING
);
23817 pop_nested_class ();
23818 pop_nested_namespace (ns
);
23821 /* We restore the source position here because it's used by
23822 add_pending_template. */
23823 input_location
= saved_loc
;
23825 if (at_eof
&& !pattern_defined
23826 && DECL_EXPLICIT_INSTANTIATION (d
)
23827 && DECL_NOT_REALLY_EXTERN (d
))
23830 The definition of a non-exported function template, a
23831 non-exported member function template, or a non-exported
23832 member function or static data member of a class template
23833 shall be present in every translation unit in which it is
23834 explicitly instantiated. */
23835 permerror (input_location
, "explicit instantiation of %qD "
23836 "but no definition available", d
);
23838 /* If we're in unevaluated context, we just wanted to get the
23839 constant value; this isn't an odr use, so don't queue
23840 a full instantiation. */
23841 if (cp_unevaluated_operand
!= 0)
23843 /* ??? Historically, we have instantiated inline functions, even
23844 when marked as "extern template". */
23845 if (!(external_p
&& VAR_P (d
)))
23846 add_pending_template (d
);
23849 /* Tell the repository that D is available in this translation unit
23850 -- and see if it is supposed to be instantiated here. */
23851 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
23853 /* In a PCH file, despite the fact that the repository hasn't
23854 requested instantiation in the PCH it is still possible that
23855 an instantiation will be required in a file that includes the
23858 add_pending_template (d
);
23859 /* Instantiate inline functions so that the inliner can do its
23860 job, even though we'll not be emitting a copy of this
23862 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
23866 bool push_to_top
, nested
;
23868 fn_context
= decl_function_context (d
);
23869 if (LAMBDA_FUNCTION_P (d
))
23870 /* tsubst_lambda_expr resolved any references to enclosing functions. */
23871 fn_context
= NULL_TREE
;
23872 nested
= current_function_decl
!= NULL_TREE
;
23873 push_to_top
= !(nested
&& fn_context
== current_function_decl
);
23875 vec
<tree
> omp_privatization_save
;
23877 save_omp_privatization_clauses (omp_privatization_save
);
23880 push_to_top_level ();
23883 push_function_context ();
23884 cp_unevaluated_operand
= 0;
23885 c_inhibit_evaluation_warnings
= 0;
23888 /* Mark D as instantiated so that recursive calls to
23889 instantiate_decl do not try to instantiate it again. */
23890 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
23892 /* Regenerate the declaration in case the template has been modified
23893 by a subsequent redeclaration. */
23894 regenerate_decl_from_template (d
, td
, args
);
23896 /* We already set the file and line above. Reset them now in case
23897 they changed as a result of calling regenerate_decl_from_template. */
23898 input_location
= DECL_SOURCE_LOCATION (d
);
23903 bool const_init
= false;
23905 /* Clear out DECL_RTL; whatever was there before may not be right
23906 since we've reset the type of the declaration. */
23907 SET_DECL_RTL (d
, NULL
);
23908 DECL_IN_AGGR_P (d
) = 0;
23910 /* The initializer is placed in DECL_INITIAL by
23911 regenerate_decl_from_template so we don't need to
23912 push/pop_access_scope again here. Pull it out so that
23913 cp_finish_decl can process it. */
23914 init
= DECL_INITIAL (d
);
23915 DECL_INITIAL (d
) = NULL_TREE
;
23916 DECL_INITIALIZED_P (d
) = 0;
23918 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
23919 initializer. That function will defer actual emission until
23920 we have a chance to determine linkage. */
23921 DECL_EXTERNAL (d
) = 0;
23923 /* Enter the scope of D so that access-checking works correctly. */
23924 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
23926 push_nested_class (DECL_CONTEXT (d
));
23928 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
23929 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
23932 pop_nested_class ();
23934 if (variable_template_p (gen_tmpl
))
23935 note_variable_template_instantiation (d
);
23937 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
23938 synthesize_method (d
);
23939 else if (TREE_CODE (d
) == FUNCTION_DECL
)
23941 /* Set up the list of local specializations. */
23942 local_specialization_stack
lss (push_to_top
? lss_blank
: lss_copy
);
23943 tree block
= NULL_TREE
;
23945 /* Set up context. */
23946 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
23947 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
23948 block
= push_stmt_list ();
23950 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
23952 /* Some typedefs referenced from within the template code need to be
23953 access checked at template instantiation time, i.e now. These
23954 types were added to the template at parsing time. Let's get those
23955 and perform the access checks then. */
23956 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (td
),
23959 /* Create substitution entries for the parameters. */
23960 register_parameter_specializations (code_pattern
, d
);
23962 /* Substitute into the body of the function. */
23963 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
23964 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
23965 tf_warning_or_error
, tmpl
);
23968 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
23969 tf_warning_or_error
, tmpl
,
23970 /*integral_constant_expression_p=*/false);
23972 /* Set the current input_location to the end of the function
23973 so that finish_function knows where we are. */
23975 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
23977 /* Remember if we saw an infinite loop in the template. */
23978 current_function_infinite_loop
23979 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
23982 /* Finish the function. */
23983 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
23984 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
23985 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
23988 d
= finish_function (/*inline_p=*/false);
23989 expand_or_defer_fn (d
);
23992 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
23993 cp_check_omp_declare_reduction (d
);
23996 /* We're not deferring instantiation any more. */
23997 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
24000 pop_from_top_level ();
24002 pop_function_context ();
24005 restore_omp_privatization_clauses (omp_privatization_save
);
24008 pop_deferring_access_checks ();
24009 timevar_pop (TV_TEMPLATE_INST
);
24010 pop_tinst_level ();
24011 input_location
= saved_loc
;
24012 cp_unevaluated_operand
= saved_unevaluated_operand
;
24013 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
24018 /* Run through the list of templates that we wish we could
24019 instantiate, and instantiate any we can. RETRIES is the
24020 number of times we retry pending template instantiation. */
24023 instantiate_pending_templates (int retries
)
24026 location_t saved_loc
= input_location
;
24028 /* Instantiating templates may trigger vtable generation. This in turn
24029 may require further template instantiations. We place a limit here
24030 to avoid infinite loop. */
24031 if (pending_templates
&& retries
>= max_tinst_depth
)
24033 tree decl
= pending_templates
->tinst
->maybe_get_node ();
24035 fatal_error (input_location
,
24036 "template instantiation depth exceeds maximum of %d"
24037 " instantiating %q+D, possibly from virtual table generation"
24038 " (use -ftemplate-depth= to increase the maximum)",
24039 max_tinst_depth
, decl
);
24040 if (TREE_CODE (decl
) == FUNCTION_DECL
)
24041 /* Pretend that we defined it. */
24042 DECL_INITIAL (decl
) = error_mark_node
;
24048 struct pending_template
**t
= &pending_templates
;
24049 struct pending_template
*last
= NULL
;
24053 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
24054 bool complete
= false;
24056 if (TYPE_P (instantiation
))
24058 if (!COMPLETE_TYPE_P (instantiation
))
24060 instantiate_class_template (instantiation
);
24061 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
24062 for (tree fld
= TYPE_FIELDS (instantiation
);
24063 fld
; fld
= TREE_CHAIN (fld
))
24065 || (TREE_CODE (fld
) == FUNCTION_DECL
24066 && !DECL_ARTIFICIAL (fld
)))
24067 && DECL_TEMPLATE_INSTANTIATION (fld
))
24068 instantiate_decl (fld
,
24069 /*defer_ok=*/false,
24070 /*expl_inst_class_mem_p=*/false);
24072 if (COMPLETE_TYPE_P (instantiation
))
24076 complete
= COMPLETE_TYPE_P (instantiation
);
24080 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
24081 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
24084 = instantiate_decl (instantiation
,
24085 /*defer_ok=*/false,
24086 /*expl_inst_class_mem_p=*/false);
24087 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
24091 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
24092 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
24097 /* If INSTANTIATION has been instantiated, then we don't
24098 need to consider it again in the future. */
24099 struct pending_template
*drop
= *t
;
24101 set_refcount_ptr (drop
->tinst
);
24102 pending_template_freelist ().free (drop
);
24110 set_refcount_ptr (current_tinst_level
);
24112 last_pending_template
= last
;
24114 while (reconsider
);
24116 input_location
= saved_loc
;
24119 /* Substitute ARGVEC into T, which is a list of initializers for
24120 either base class or a non-static data member. The TREE_PURPOSEs
24121 are DECLs, and the TREE_VALUEs are the initializer values. Used by
24122 instantiate_decl. */
24125 tsubst_initializer_list (tree t
, tree argvec
)
24127 tree inits
= NULL_TREE
;
24128 tree target_ctor
= error_mark_node
;
24130 for (; t
; t
= TREE_CHAIN (t
))
24134 tree expanded_bases
= NULL_TREE
;
24135 tree expanded_arguments
= NULL_TREE
;
24138 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
24143 /* Expand the base class expansion type into separate base
24145 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
24146 tf_warning_or_error
,
24148 if (expanded_bases
== error_mark_node
)
24151 /* We'll be building separate TREE_LISTs of arguments for
24153 len
= TREE_VEC_LENGTH (expanded_bases
);
24154 expanded_arguments
= make_tree_vec (len
);
24155 for (i
= 0; i
< len
; i
++)
24156 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
24158 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
24159 expand each argument in the TREE_VALUE of t. */
24160 expr
= make_node (EXPR_PACK_EXPANSION
);
24161 PACK_EXPANSION_LOCAL_P (expr
) = true;
24162 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
24163 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
24165 if (TREE_VALUE (t
) == void_type_node
)
24166 /* VOID_TYPE_NODE is used to indicate
24167 value-initialization. */
24169 for (i
= 0; i
< len
; i
++)
24170 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
24174 /* Substitute parameter packs into each argument in the
24176 in_base_initializer
= 1;
24177 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
24179 tree expanded_exprs
;
24181 /* Expand the argument. */
24182 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
24184 = tsubst_pack_expansion (expr
, argvec
,
24185 tf_warning_or_error
,
24187 if (expanded_exprs
== error_mark_node
)
24190 /* Prepend each of the expanded expressions to the
24191 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
24192 for (i
= 0; i
< len
; i
++)
24194 TREE_VEC_ELT (expanded_arguments
, i
) =
24195 tree_cons (NULL_TREE
,
24196 TREE_VEC_ELT (expanded_exprs
, i
),
24197 TREE_VEC_ELT (expanded_arguments
, i
));
24200 in_base_initializer
= 0;
24202 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
24203 since we built them backwards. */
24204 for (i
= 0; i
< len
; i
++)
24206 TREE_VEC_ELT (expanded_arguments
, i
) =
24207 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
24212 for (i
= 0; i
< len
; ++i
)
24214 if (expanded_bases
)
24216 decl
= TREE_VEC_ELT (expanded_bases
, i
);
24217 decl
= expand_member_init (decl
);
24218 init
= TREE_VEC_ELT (expanded_arguments
, i
);
24223 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
24224 tf_warning_or_error
, NULL_TREE
);
24226 decl
= expand_member_init (decl
);
24227 if (decl
&& !DECL_P (decl
))
24228 in_base_initializer
= 1;
24230 init
= TREE_VALUE (t
);
24232 if (init
!= void_type_node
)
24233 init
= tsubst_expr (init
, argvec
,
24234 tf_warning_or_error
, NULL_TREE
,
24235 /*integral_constant_expression_p=*/false);
24236 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
24237 /* If we had an initializer but it instantiated to nothing,
24238 value-initialize the object. This will only occur when
24239 the initializer was a pack expansion where the parameter
24240 packs used in that expansion were of length zero. */
24241 init
= void_type_node
;
24242 in_base_initializer
= 0;
24245 if (target_ctor
!= error_mark_node
24246 && init
!= error_mark_node
)
24248 error ("mem-initializer for %qD follows constructor delegation",
24252 /* Look for a target constructor. */
24253 if (init
!= error_mark_node
24254 && decl
&& CLASS_TYPE_P (decl
)
24255 && same_type_p (decl
, current_class_type
))
24257 maybe_warn_cpp0x (CPP0X_DELEGATING_CTORS
);
24260 error ("constructor delegation follows mem-initializer for %qD",
24261 TREE_PURPOSE (inits
));
24264 target_ctor
= init
;
24269 init
= build_tree_list (decl
, init
);
24270 TREE_CHAIN (init
) = inits
;
24278 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
24281 set_current_access_from_decl (tree decl
)
24283 if (TREE_PRIVATE (decl
))
24284 current_access_specifier
= access_private_node
;
24285 else if (TREE_PROTECTED (decl
))
24286 current_access_specifier
= access_protected_node
;
24288 current_access_specifier
= access_public_node
;
24291 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
24292 is the instantiation (which should have been created with
24293 start_enum) and ARGS are the template arguments to use. */
24296 tsubst_enum (tree tag
, tree newtag
, tree args
)
24300 if (SCOPED_ENUM_P (newtag
))
24301 begin_scope (sk_scoped_enum
, newtag
);
24303 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
24308 decl
= TREE_VALUE (e
);
24309 /* Note that in a template enum, the TREE_VALUE is the
24310 CONST_DECL, not the corresponding INTEGER_CST. */
24311 value
= tsubst_expr (DECL_INITIAL (decl
),
24312 args
, tf_warning_or_error
, NULL_TREE
,
24313 /*integral_constant_expression_p=*/true);
24315 /* Give this enumeration constant the correct access. */
24316 set_current_access_from_decl (decl
);
24318 /* Actually build the enumerator itself. Here we're assuming that
24319 enumerators can't have dependent attributes. */
24320 build_enumerator (DECL_NAME (decl
), value
, newtag
,
24321 DECL_ATTRIBUTES (decl
), DECL_SOURCE_LOCATION (decl
));
24324 if (SCOPED_ENUM_P (newtag
))
24327 finish_enum_value_list (newtag
);
24328 finish_enum (newtag
);
24330 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
24331 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
24334 /* DECL is a FUNCTION_DECL that is a template specialization. Return
24335 its type -- but without substituting the innermost set of template
24336 arguments. So, innermost set of template parameters will appear in
24340 get_mostly_instantiated_function_type (tree decl
)
24342 /* For a function, DECL_TI_TEMPLATE is partially instantiated. */
24343 return TREE_TYPE (DECL_TI_TEMPLATE (decl
));
24346 /* Return truthvalue if we're processing a template different from
24347 the last one involved in diagnostics. */
24349 problematic_instantiation_changed (void)
24351 return current_tinst_level
!= last_error_tinst_level
;
24354 /* Remember current template involved in diagnostics. */
24356 record_last_problematic_instantiation (void)
24358 set_refcount_ptr (last_error_tinst_level
, current_tinst_level
);
24361 struct tinst_level
*
24362 current_instantiation (void)
24364 return current_tinst_level
;
24367 /* Return TRUE if current_function_decl is being instantiated, false
24371 instantiating_current_function_p (void)
24373 return (current_instantiation ()
24374 && (current_instantiation ()->maybe_get_node ()
24375 == current_function_decl
));
24378 /* [temp.param] Check that template non-type parm TYPE is of an allowable
24379 type. Return false for ok, true for disallowed. Issue error and
24380 inform messages under control of COMPLAIN. */
24383 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
24385 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
24387 else if (TYPE_PTR_P (type
))
24389 else if (TREE_CODE (type
) == REFERENCE_TYPE
24390 && !TYPE_REF_IS_RVALUE (type
))
24392 else if (TYPE_PTRMEM_P (type
))
24394 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
24396 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
24398 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
24400 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
24402 /* A bound template template parm could later be instantiated to have a valid
24403 nontype parm type via an alias template. */
24404 else if (cxx_dialect
>= cxx11
24405 && TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
24408 if (complain
& tf_error
)
24410 if (type
== error_mark_node
)
24411 inform (input_location
, "invalid template non-type parameter");
24413 error ("%q#T is not a valid type for a template non-type parameter",
24419 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
24420 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
24423 dependent_type_p_r (tree type
)
24429 A type is dependent if it is:
24431 -- a template parameter. Template template parameters are types
24432 for us (since TYPE_P holds true for them) so we handle
24434 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
24435 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
24437 /* -- a qualified-id with a nested-name-specifier which contains a
24438 class-name that names a dependent type or whose unqualified-id
24439 names a dependent type. */
24440 if (TREE_CODE (type
) == TYPENAME_TYPE
)
24443 /* An alias template specialization can be dependent even if the
24444 resulting type is not. */
24445 if (dependent_alias_template_spec_p (type
))
24448 /* -- a cv-qualified type where the cv-unqualified type is
24450 No code is necessary for this bullet; the code below handles
24451 cv-qualified types, and we don't want to strip aliases with
24452 TYPE_MAIN_VARIANT because of DR 1558. */
24453 /* -- a compound type constructed from any dependent type. */
24454 if (TYPE_PTRMEM_P (type
))
24455 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
24456 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
24458 else if (TYPE_PTR_P (type
)
24459 || TREE_CODE (type
) == REFERENCE_TYPE
)
24460 return dependent_type_p (TREE_TYPE (type
));
24461 else if (TREE_CODE (type
) == FUNCTION_TYPE
24462 || TREE_CODE (type
) == METHOD_TYPE
)
24466 if (dependent_type_p (TREE_TYPE (type
)))
24468 for (arg_type
= TYPE_ARG_TYPES (type
);
24470 arg_type
= TREE_CHAIN (arg_type
))
24471 if (dependent_type_p (TREE_VALUE (arg_type
)))
24473 if (cxx_dialect
>= cxx17
)
24474 /* A value-dependent noexcept-specifier makes the type dependent. */
24475 if (tree spec
= TYPE_RAISES_EXCEPTIONS (type
))
24476 if (tree noex
= TREE_PURPOSE (spec
))
24477 /* Treat DEFERRED_NOEXCEPT as non-dependent, since it doesn't
24478 affect overload resolution and treating it as dependent breaks
24480 if (TREE_CODE (noex
) != DEFERRED_NOEXCEPT
24481 && value_dependent_expression_p (noex
))
24485 /* -- an array type constructed from any dependent type or whose
24486 size is specified by a constant expression that is
24489 We checked for type- and value-dependence of the bounds in
24490 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
24491 if (TREE_CODE (type
) == ARRAY_TYPE
)
24493 if (TYPE_DOMAIN (type
)
24494 && dependent_type_p (TYPE_DOMAIN (type
)))
24496 return dependent_type_p (TREE_TYPE (type
));
24499 /* -- a template-id in which either the template name is a template
24501 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
24503 /* ... or any of the template arguments is a dependent type or
24504 an expression that is type-dependent or value-dependent. */
24505 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
24506 && (any_dependent_template_arguments_p
24507 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
24510 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
24511 dependent; if the argument of the `typeof' expression is not
24512 type-dependent, then it should already been have resolved. */
24513 if (TREE_CODE (type
) == TYPEOF_TYPE
24514 || TREE_CODE (type
) == DECLTYPE_TYPE
24515 || TREE_CODE (type
) == UNDERLYING_TYPE
)
24518 /* A template argument pack is dependent if any of its packed
24520 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
24522 tree args
= ARGUMENT_PACK_ARGS (type
);
24523 int i
, len
= TREE_VEC_LENGTH (args
);
24524 for (i
= 0; i
< len
; ++i
)
24525 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
24529 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
24530 be template parameters. */
24531 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
24534 if (any_dependent_type_attributes_p (TYPE_ATTRIBUTES (type
)))
24537 /* The standard does not specifically mention types that are local
24538 to template functions or local classes, but they should be
24539 considered dependent too. For example:
24541 template <int I> void f() {
24546 The size of `E' cannot be known until the value of `I' has been
24547 determined. Therefore, `E' must be considered dependent. */
24548 scope
= TYPE_CONTEXT (type
);
24549 if (scope
&& TYPE_P (scope
))
24550 return dependent_type_p (scope
);
24551 /* Don't use type_dependent_expression_p here, as it can lead
24552 to infinite recursion trying to determine whether a lambda
24553 nested in a lambda is dependent (c++/47687). */
24554 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
24555 && DECL_LANG_SPECIFIC (scope
)
24556 && DECL_TEMPLATE_INFO (scope
)
24557 && (any_dependent_template_arguments_p
24558 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
24561 /* Other types are non-dependent. */
24565 /* Returns TRUE if TYPE is dependent, in the sense of
24566 [temp.dep.type]. Note that a NULL type is considered dependent. */
24569 dependent_type_p (tree type
)
24571 /* If there are no template parameters in scope, then there can't be
24572 any dependent types. */
24573 if (!processing_template_decl
)
24575 /* If we are not processing a template, then nobody should be
24576 providing us with a dependent type. */
24578 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
24582 /* If the type is NULL, we have not computed a type for the entity
24583 in question; in that case, the type is dependent. */
24587 /* Erroneous types can be considered non-dependent. */
24588 if (type
== error_mark_node
)
24591 /* Getting here with global_type_node means we improperly called this
24592 function on the TREE_TYPE of an IDENTIFIER_NODE. */
24593 gcc_checking_assert (type
!= global_type_node
);
24595 /* If we have not already computed the appropriate value for TYPE,
24597 if (!TYPE_DEPENDENT_P_VALID (type
))
24599 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
24600 TYPE_DEPENDENT_P_VALID (type
) = 1;
24603 return TYPE_DEPENDENT_P (type
);
24606 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
24607 lookup. In other words, a dependent type that is not the current
24611 dependent_scope_p (tree scope
)
24613 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
24614 && !currently_open_class (scope
));
24617 /* T is a SCOPE_REF. Return whether it represents a non-static member of
24618 an unknown base of 'this' (and is therefore instantiation-dependent). */
24621 unknown_base_ref_p (tree t
)
24623 if (!current_class_ptr
)
24626 tree mem
= TREE_OPERAND (t
, 1);
24627 if (shared_member_p (mem
))
24630 tree cur
= current_nonlambda_class_type ();
24631 if (!any_dependent_bases_p (cur
))
24634 tree ctx
= TREE_OPERAND (t
, 0);
24635 if (DERIVED_FROM_P (ctx
, cur
))
24641 /* T is a SCOPE_REF; return whether we need to consider it
24642 instantiation-dependent so that we can check access at instantiation
24643 time even though we know which member it resolves to. */
24646 instantiation_dependent_scope_ref_p (tree t
)
24648 if (DECL_P (TREE_OPERAND (t
, 1))
24649 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
24650 && !unknown_base_ref_p (t
)
24651 && accessible_in_template_p (TREE_OPERAND (t
, 0),
24652 TREE_OPERAND (t
, 1)))
24658 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
24659 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
24662 /* Note that this predicate is not appropriate for general expressions;
24663 only constant expressions (that satisfy potential_constant_expression)
24664 can be tested for value dependence. */
24667 value_dependent_expression_p (tree expression
)
24669 if (!processing_template_decl
|| expression
== NULL_TREE
)
24672 /* A type-dependent expression is also value-dependent. */
24673 if (type_dependent_expression_p (expression
))
24676 switch (TREE_CODE (expression
))
24679 /* A dependent member function of the current instantiation. */
24680 return dependent_type_p (BINFO_TYPE (BASELINK_BINFO (expression
)));
24682 case FUNCTION_DECL
:
24683 /* A dependent member function of the current instantiation. */
24684 if (DECL_CLASS_SCOPE_P (expression
)
24685 && dependent_type_p (DECL_CONTEXT (expression
)))
24689 case IDENTIFIER_NODE
:
24690 /* A name that has not been looked up -- must be dependent. */
24693 case TEMPLATE_PARM_INDEX
:
24694 /* A non-type template parm. */
24698 /* A non-type template parm. */
24699 if (DECL_TEMPLATE_PARM_P (expression
))
24701 return value_dependent_expression_p (DECL_INITIAL (expression
));
24704 /* A constant with literal type and is initialized
24705 with an expression that is value-dependent. */
24706 if (DECL_DEPENDENT_INIT_P (expression
)
24707 /* FIXME cp_finish_decl doesn't fold reference initializers. */
24708 || TREE_CODE (TREE_TYPE (expression
)) == REFERENCE_TYPE
)
24710 if (DECL_HAS_VALUE_EXPR_P (expression
))
24712 tree value_expr
= DECL_VALUE_EXPR (expression
);
24713 if (value_dependent_expression_p (value_expr
))
24718 case DYNAMIC_CAST_EXPR
:
24719 case STATIC_CAST_EXPR
:
24720 case CONST_CAST_EXPR
:
24721 case REINTERPRET_CAST_EXPR
:
24723 case IMPLICIT_CONV_EXPR
:
24724 /* These expressions are value-dependent if the type to which
24725 the cast occurs is dependent or the expression being casted
24726 is value-dependent. */
24728 tree type
= TREE_TYPE (expression
);
24730 if (dependent_type_p (type
))
24733 /* A functional cast has a list of operands. */
24734 expression
= TREE_OPERAND (expression
, 0);
24737 /* If there are no operands, it must be an expression such
24738 as "int()". This should not happen for aggregate types
24739 because it would form non-constant expressions. */
24740 gcc_assert (cxx_dialect
>= cxx11
24741 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
24746 if (TREE_CODE (expression
) == TREE_LIST
)
24747 return any_value_dependent_elements_p (expression
);
24749 return value_dependent_expression_p (expression
);
24753 if (SIZEOF_EXPR_TYPE_P (expression
))
24754 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
24758 /* A `sizeof' expression is value-dependent if the operand is
24759 type-dependent or is a pack expansion. */
24760 expression
= TREE_OPERAND (expression
, 0);
24761 if (PACK_EXPANSION_P (expression
))
24763 else if (TYPE_P (expression
))
24764 return dependent_type_p (expression
);
24765 return instantiation_dependent_uneval_expression_p (expression
);
24767 case AT_ENCODE_EXPR
:
24768 /* An 'encode' expression is value-dependent if the operand is
24770 expression
= TREE_OPERAND (expression
, 0);
24771 return dependent_type_p (expression
);
24773 case NOEXCEPT_EXPR
:
24774 expression
= TREE_OPERAND (expression
, 0);
24775 return instantiation_dependent_uneval_expression_p (expression
);
24778 /* All instantiation-dependent expressions should also be considered
24779 value-dependent. */
24780 return instantiation_dependent_scope_ref_p (expression
);
24782 case COMPONENT_REF
:
24783 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
24784 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
24786 case NONTYPE_ARGUMENT_PACK
:
24787 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
24788 is value-dependent. */
24790 tree values
= ARGUMENT_PACK_ARGS (expression
);
24791 int i
, len
= TREE_VEC_LENGTH (values
);
24793 for (i
= 0; i
< len
; ++i
)
24794 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
24802 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
24804 if (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
)))
24810 if (TREE_CODE (type2
) != TREE_LIST
)
24811 return dependent_type_p (type2
);
24813 for (; type2
; type2
= TREE_CHAIN (type2
))
24814 if (dependent_type_p (TREE_VALUE (type2
)))
24821 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
24822 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
24825 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
24826 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
24830 tree op
= TREE_OPERAND (expression
, 0);
24831 return (value_dependent_expression_p (op
)
24832 || has_value_dependent_address (op
));
24835 case REQUIRES_EXPR
:
24836 /* Treat all requires-expressions as value-dependent so
24837 we don't try to fold them. */
24841 return dependent_type_p (TREE_OPERAND (expression
, 0));
24845 if (value_dependent_expression_p (CALL_EXPR_FN (expression
)))
24847 tree fn
= get_callee_fndecl (expression
);
24849 nargs
= call_expr_nargs (expression
);
24850 for (i
= 0; i
< nargs
; ++i
)
24852 tree op
= CALL_EXPR_ARG (expression
, i
);
24853 /* In a call to a constexpr member function, look through the
24854 implicit ADDR_EXPR on the object argument so that it doesn't
24855 cause the call to be considered value-dependent. We also
24856 look through it in potential_constant_expression. */
24857 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
24858 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
24859 && TREE_CODE (op
) == ADDR_EXPR
)
24860 op
= TREE_OPERAND (op
, 0);
24861 if (value_dependent_expression_p (op
))
24867 case TEMPLATE_ID_EXPR
:
24868 return variable_concept_p (TREE_OPERAND (expression
, 0));
24874 if (dependent_type_p (TREE_TYPE (expression
)))
24876 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
24877 if (value_dependent_expression_p (val
))
24883 /* Treat a GNU statement expression as dependent to avoid crashing
24884 under instantiate_non_dependent_expr; it can't be constant. */
24888 /* A constant expression is value-dependent if any subexpression is
24889 value-dependent. */
24890 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
24892 case tcc_reference
:
24894 case tcc_comparison
:
24896 case tcc_expression
:
24899 int i
, len
= cp_tree_operand_length (expression
);
24901 for (i
= 0; i
< len
; i
++)
24903 tree t
= TREE_OPERAND (expression
, i
);
24905 /* In some cases, some of the operands may be missing.
24906 (For example, in the case of PREDECREMENT_EXPR, the
24907 amount to increment by may be missing.) That doesn't
24908 make the expression dependent. */
24909 if (t
&& value_dependent_expression_p (t
))
24920 /* The expression is not value-dependent. */
24924 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
24925 [temp.dep.expr]. Note that an expression with no type is
24926 considered dependent. Other parts of the compiler arrange for an
24927 expression with type-dependent subexpressions to have no type, so
24928 this function doesn't have to be fully recursive. */
24931 type_dependent_expression_p (tree expression
)
24933 if (!processing_template_decl
)
24936 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
24939 STRIP_ANY_LOCATION_WRAPPER (expression
);
24941 /* An unresolved name is always dependent. */
24942 if (identifier_p (expression
)
24943 || TREE_CODE (expression
) == USING_DECL
24944 || TREE_CODE (expression
) == WILDCARD_DECL
)
24947 /* A fold expression is type-dependent. */
24948 if (TREE_CODE (expression
) == UNARY_LEFT_FOLD_EXPR
24949 || TREE_CODE (expression
) == UNARY_RIGHT_FOLD_EXPR
24950 || TREE_CODE (expression
) == BINARY_LEFT_FOLD_EXPR
24951 || TREE_CODE (expression
) == BINARY_RIGHT_FOLD_EXPR
)
24954 /* Some expression forms are never type-dependent. */
24955 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
24956 || TREE_CODE (expression
) == SIZEOF_EXPR
24957 || TREE_CODE (expression
) == ALIGNOF_EXPR
24958 || TREE_CODE (expression
) == AT_ENCODE_EXPR
24959 || TREE_CODE (expression
) == NOEXCEPT_EXPR
24960 || TREE_CODE (expression
) == TRAIT_EXPR
24961 || TREE_CODE (expression
) == TYPEID_EXPR
24962 || TREE_CODE (expression
) == DELETE_EXPR
24963 || TREE_CODE (expression
) == VEC_DELETE_EXPR
24964 || TREE_CODE (expression
) == THROW_EXPR
24965 || TREE_CODE (expression
) == REQUIRES_EXPR
)
24968 /* The types of these expressions depends only on the type to which
24969 the cast occurs. */
24970 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
24971 || TREE_CODE (expression
) == STATIC_CAST_EXPR
24972 || TREE_CODE (expression
) == CONST_CAST_EXPR
24973 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
24974 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
24975 || TREE_CODE (expression
) == CAST_EXPR
)
24976 return dependent_type_p (TREE_TYPE (expression
));
24978 /* The types of these expressions depends only on the type created
24979 by the expression. */
24980 if (TREE_CODE (expression
) == NEW_EXPR
24981 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
24983 /* For NEW_EXPR tree nodes created inside a template, either
24984 the object type itself or a TREE_LIST may appear as the
24986 tree type
= TREE_OPERAND (expression
, 1);
24987 if (TREE_CODE (type
) == TREE_LIST
)
24988 /* This is an array type. We need to check array dimensions
24990 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
24991 || value_dependent_expression_p
24992 (TREE_OPERAND (TREE_VALUE (type
), 1));
24994 return dependent_type_p (type
);
24997 if (TREE_CODE (expression
) == SCOPE_REF
)
24999 tree scope
= TREE_OPERAND (expression
, 0);
25000 tree name
= TREE_OPERAND (expression
, 1);
25002 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
25003 contains an identifier associated by name lookup with one or more
25004 declarations declared with a dependent type, or...a
25005 nested-name-specifier or qualified-id that names a member of an
25006 unknown specialization. */
25007 return (type_dependent_expression_p (name
)
25008 || dependent_scope_p (scope
));
25011 if (TREE_CODE (expression
) == TEMPLATE_DECL
25012 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
25013 return uses_outer_template_parms (expression
);
25015 if (TREE_CODE (expression
) == STMT_EXPR
)
25016 expression
= stmt_expr_value_expr (expression
);
25018 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
25023 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
25025 if (type_dependent_expression_p (elt
))
25031 /* A static data member of the current instantiation with incomplete
25032 array type is type-dependent, as the definition and specializations
25033 can have different bounds. */
25034 if (VAR_P (expression
)
25035 && DECL_CLASS_SCOPE_P (expression
)
25036 && dependent_type_p (DECL_CONTEXT (expression
))
25037 && VAR_HAD_UNKNOWN_BOUND (expression
))
25040 /* An array of unknown bound depending on a variadic parameter, eg:
25042 template<typename... Args>
25043 void foo (Args... args)
25045 int arr[] = { args... };
25048 template<int... vals>
25051 int arr[] = { vals... };
25054 If the array has no length and has an initializer, it must be that
25055 we couldn't determine its length in cp_complete_array_type because
25056 it is dependent. */
25057 if (VAR_P (expression
)
25058 && TREE_TYPE (expression
) != NULL_TREE
25059 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
25060 && !TYPE_DOMAIN (TREE_TYPE (expression
))
25061 && DECL_INITIAL (expression
))
25064 /* A function or variable template-id is type-dependent if it has any
25065 dependent template arguments. */
25066 if (VAR_OR_FUNCTION_DECL_P (expression
)
25067 && DECL_LANG_SPECIFIC (expression
)
25068 && DECL_TEMPLATE_INFO (expression
))
25070 /* Consider the innermost template arguments, since those are the ones
25071 that come from the template-id; the template arguments for the
25072 enclosing class do not make it type-dependent unless they are used in
25073 the type of the decl. */
25074 if (PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (expression
))
25075 && (any_dependent_template_arguments_p
25076 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
25080 /* Otherwise, if the function decl isn't from a dependent scope, it can't be
25081 type-dependent. Checking this is important for functions with auto return
25082 type, which looks like a dependent type. */
25083 if (TREE_CODE (expression
) == FUNCTION_DECL
25084 && !(DECL_CLASS_SCOPE_P (expression
)
25085 && dependent_type_p (DECL_CONTEXT (expression
)))
25086 && !(DECL_LANG_SPECIFIC (expression
)
25087 && DECL_FRIEND_P (expression
)
25088 && (!DECL_FRIEND_CONTEXT (expression
)
25089 || dependent_type_p (DECL_FRIEND_CONTEXT (expression
))))
25090 && !DECL_LOCAL_FUNCTION_P (expression
))
25092 gcc_assert (!dependent_type_p (TREE_TYPE (expression
))
25093 || undeduced_auto_decl (expression
));
25097 /* Always dependent, on the number of arguments if nothing else. */
25098 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
25101 if (TREE_TYPE (expression
) == unknown_type_node
)
25103 if (TREE_CODE (expression
) == ADDR_EXPR
)
25104 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
25105 if (TREE_CODE (expression
) == COMPONENT_REF
25106 || TREE_CODE (expression
) == OFFSET_REF
)
25108 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
25110 expression
= TREE_OPERAND (expression
, 1);
25111 if (identifier_p (expression
))
25114 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
25115 if (TREE_CODE (expression
) == SCOPE_REF
)
25118 if (BASELINK_P (expression
))
25120 if (BASELINK_OPTYPE (expression
)
25121 && dependent_type_p (BASELINK_OPTYPE (expression
)))
25123 expression
= BASELINK_FUNCTIONS (expression
);
25126 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
25128 if (any_dependent_template_arguments_p
25129 (TREE_OPERAND (expression
, 1)))
25131 expression
= TREE_OPERAND (expression
, 0);
25132 if (identifier_p (expression
))
25136 gcc_assert (TREE_CODE (expression
) == OVERLOAD
25137 || TREE_CODE (expression
) == FUNCTION_DECL
);
25139 for (lkp_iterator
iter (expression
); iter
; ++iter
)
25140 if (type_dependent_expression_p (*iter
))
25146 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
25148 /* Dependent type attributes might not have made it from the decl to
25150 if (DECL_P (expression
)
25151 && any_dependent_type_attributes_p (DECL_ATTRIBUTES (expression
)))
25154 return (dependent_type_p (TREE_TYPE (expression
)));
25157 /* [temp.dep.expr]/5: A class member access expression (5.2.5) is
25158 type-dependent if the expression refers to a member of the current
25159 instantiation and the type of the referenced member is dependent, or the
25160 class member access expression refers to a member of an unknown
25163 This function returns true if the OBJECT in such a class member access
25164 expression is of an unknown specialization. */
25167 type_dependent_object_expression_p (tree object
)
25169 /* An IDENTIFIER_NODE can sometimes have a TREE_TYPE, but it's still
25171 if (TREE_CODE (object
) == IDENTIFIER_NODE
)
25173 tree scope
= TREE_TYPE (object
);
25174 return (!scope
|| dependent_scope_p (scope
));
25177 /* walk_tree callback function for instantiation_dependent_expression_p,
25178 below. Returns non-zero if a dependent subexpression is found. */
25181 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
25186 /* We don't have to worry about decltype currently because decltype
25187 of an instantiation-dependent expr is a dependent type. This
25188 might change depending on the resolution of DR 1172. */
25189 *walk_subtrees
= false;
25192 enum tree_code code
= TREE_CODE (*tp
);
25195 /* Don't treat an argument list as dependent just because it has no
25201 case TEMPLATE_PARM_INDEX
:
25204 /* Handle expressions with type operands. */
25208 case AT_ENCODE_EXPR
:
25210 tree op
= TREE_OPERAND (*tp
, 0);
25211 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
25212 op
= TREE_TYPE (op
);
25215 if (dependent_type_p (op
))
25219 *walk_subtrees
= false;
25226 case COMPONENT_REF
:
25227 if (identifier_p (TREE_OPERAND (*tp
, 1)))
25228 /* In a template, finish_class_member_access_expr creates a
25229 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
25230 type-dependent, so that we can check access control at
25231 instantiation time (PR 42277). See also Core issue 1273. */
25236 if (instantiation_dependent_scope_ref_p (*tp
))
25241 /* Treat statement-expressions as dependent. */
25245 /* Treat requires-expressions as dependent. */
25246 case REQUIRES_EXPR
:
25250 /* Treat calls to function concepts as dependent. */
25251 if (function_concept_check_p (*tp
))
25255 case TEMPLATE_ID_EXPR
:
25256 /* And variable concepts. */
25257 if (variable_concept_p (TREE_OPERAND (*tp
, 0)))
25265 if (type_dependent_expression_p (*tp
))
25271 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
25272 sense defined by the ABI:
25274 "An expression is instantiation-dependent if it is type-dependent
25275 or value-dependent, or it has a subexpression that is type-dependent
25276 or value-dependent."
25278 Except don't actually check value-dependence for unevaluated expressions,
25279 because in sizeof(i) we don't care about the value of i. Checking
25280 type-dependence will in turn check value-dependence of array bounds/template
25281 arguments as needed. */
25284 instantiation_dependent_uneval_expression_p (tree expression
)
25288 if (!processing_template_decl
)
25291 if (expression
== error_mark_node
)
25294 result
= cp_walk_tree_without_duplicates (&expression
,
25295 instantiation_dependent_r
, NULL
);
25296 return result
!= NULL_TREE
;
25299 /* As above, but also check value-dependence of the expression as a whole. */
25302 instantiation_dependent_expression_p (tree expression
)
25304 return (instantiation_dependent_uneval_expression_p (expression
)
25305 || value_dependent_expression_p (expression
));
25308 /* Like type_dependent_expression_p, but it also works while not processing
25309 a template definition, i.e. during substitution or mangling. */
25312 type_dependent_expression_p_push (tree expr
)
25315 ++processing_template_decl
;
25316 b
= type_dependent_expression_p (expr
);
25317 --processing_template_decl
;
25321 /* Returns TRUE if ARGS contains a type-dependent expression. */
25324 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
25329 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
25331 if (type_dependent_expression_p (arg
))
25337 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
25338 expressions) contains any type-dependent expressions. */
25341 any_type_dependent_elements_p (const_tree list
)
25343 for (; list
; list
= TREE_CHAIN (list
))
25344 if (type_dependent_expression_p (TREE_VALUE (list
)))
25350 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
25351 expressions) contains any value-dependent expressions. */
25354 any_value_dependent_elements_p (const_tree list
)
25356 for (; list
; list
= TREE_CHAIN (list
))
25357 if (value_dependent_expression_p (TREE_VALUE (list
)))
25363 /* Returns TRUE if the ARG (a template argument) is dependent. */
25366 dependent_template_arg_p (tree arg
)
25368 if (!processing_template_decl
)
25371 /* Assume a template argument that was wrongly written by the user
25372 is dependent. This is consistent with what
25373 any_dependent_template_arguments_p [that calls this function]
25375 if (!arg
|| arg
== error_mark_node
)
25378 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
25379 arg
= argument_pack_select_arg (arg
);
25381 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
25383 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
25385 if (DECL_TEMPLATE_PARM_P (arg
))
25387 /* A member template of a dependent class is not necessarily
25388 type-dependent, but it is a dependent template argument because it
25389 will be a member of an unknown specialization to that template. */
25390 tree scope
= CP_DECL_CONTEXT (arg
);
25391 return TYPE_P (scope
) && dependent_type_p (scope
);
25393 else if (ARGUMENT_PACK_P (arg
))
25395 tree args
= ARGUMENT_PACK_ARGS (arg
);
25396 int i
, len
= TREE_VEC_LENGTH (args
);
25397 for (i
= 0; i
< len
; ++i
)
25399 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
25405 else if (TYPE_P (arg
))
25406 return dependent_type_p (arg
);
25408 return (type_dependent_expression_p (arg
)
25409 || value_dependent_expression_p (arg
));
25412 /* Returns true if ARGS (a collection of template arguments) contains
25413 any types that require structural equality testing. */
25416 any_template_arguments_need_structural_equality_p (tree args
)
25423 if (args
== error_mark_node
)
25426 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
25428 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
25429 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
25431 tree arg
= TREE_VEC_ELT (level
, j
);
25432 tree packed_args
= NULL_TREE
;
25435 if (ARGUMENT_PACK_P (arg
))
25437 /* Look inside the argument pack. */
25438 packed_args
= ARGUMENT_PACK_ARGS (arg
);
25439 len
= TREE_VEC_LENGTH (packed_args
);
25442 for (k
= 0; k
< len
; ++k
)
25445 arg
= TREE_VEC_ELT (packed_args
, k
);
25447 if (error_operand_p (arg
))
25449 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
25451 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
25453 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
25454 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
25463 /* Returns true if ARGS (a collection of template arguments) contains
25464 any dependent arguments. */
25467 any_dependent_template_arguments_p (const_tree args
)
25474 if (args
== error_mark_node
)
25477 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
25479 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
25480 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
25481 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
25488 /* Returns true if ARGS contains any errors. */
25491 any_erroneous_template_args_p (const_tree args
)
25496 if (args
== error_mark_node
)
25499 if (args
&& TREE_CODE (args
) != TREE_VEC
)
25501 if (tree ti
= get_template_info (args
))
25502 args
= TI_ARGS (ti
);
25510 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
25512 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
25513 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
25514 if (error_operand_p (TREE_VEC_ELT (level
, j
)))
25521 /* Returns TRUE if the template TMPL is type-dependent. */
25524 dependent_template_p (tree tmpl
)
25526 if (TREE_CODE (tmpl
) == OVERLOAD
)
25528 for (lkp_iterator
iter (tmpl
); iter
; ++iter
)
25529 if (dependent_template_p (*iter
))
25534 /* Template template parameters are dependent. */
25535 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
25536 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
25538 /* So are names that have not been looked up. */
25539 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
25544 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
25547 dependent_template_id_p (tree tmpl
, tree args
)
25549 return (dependent_template_p (tmpl
)
25550 || any_dependent_template_arguments_p (args
));
25553 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
25557 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
25561 if (!processing_template_decl
)
25564 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
25566 tree decl
= TREE_VEC_ELT (declv
, i
);
25567 tree init
= TREE_VEC_ELT (initv
, i
);
25568 tree cond
= TREE_VEC_ELT (condv
, i
);
25569 tree incr
= TREE_VEC_ELT (incrv
, i
);
25571 if (type_dependent_expression_p (decl
)
25572 || TREE_CODE (decl
) == SCOPE_REF
)
25575 if (init
&& type_dependent_expression_p (init
))
25578 if (type_dependent_expression_p (cond
))
25581 if (COMPARISON_CLASS_P (cond
)
25582 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
25583 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
25586 if (TREE_CODE (incr
) == MODOP_EXPR
)
25588 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
25589 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
25592 else if (type_dependent_expression_p (incr
))
25594 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
25596 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
25598 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
25600 tree t
= TREE_OPERAND (incr
, 1);
25601 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
25602 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
25611 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
25612 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
25613 no such TYPE can be found. Note that this function peers inside
25614 uninstantiated templates and therefore should be used only in
25615 extremely limited situations. ONLY_CURRENT_P restricts this
25616 peering to the currently open classes hierarchy (which is required
25617 when comparing types). */
25620 resolve_typename_type (tree type
, bool only_current_p
)
25629 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
25631 scope
= TYPE_CONTEXT (type
);
25632 /* We shouldn't have built a TYPENAME_TYPE with a non-dependent scope. */
25633 gcc_checking_assert (uses_template_parms (scope
));
25635 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
25636 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
25637 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
25638 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
25639 identifier of the TYPENAME_TYPE anymore.
25640 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
25641 TYPENAME_TYPE instead, we avoid messing up with a possible
25642 typedef variant case. */
25643 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
25645 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
25646 it first before we can figure out what NAME refers to. */
25647 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
25649 if (TYPENAME_IS_RESOLVING_P (scope
))
25650 /* Given a class template A with a dependent base with nested type C,
25651 typedef typename A::C::C C will land us here, as trying to resolve
25652 the initial A::C leads to the local C typedef, which leads back to
25653 A::C::C. So we break the recursion now. */
25656 scope
= resolve_typename_type (scope
, only_current_p
);
25658 /* If we don't know what SCOPE refers to, then we cannot resolve the
25660 if (!CLASS_TYPE_P (scope
))
25662 /* If this is a typedef, we don't want to look inside (c++/11987). */
25663 if (typedef_variant_p (type
))
25665 /* If SCOPE isn't the template itself, it will not have a valid
25666 TYPE_FIELDS list. */
25667 if (same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
25668 /* scope is either the template itself or a compatible instantiation
25669 like X<T>, so look up the name in the original template. */
25670 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
25671 /* If scope has no fields, it can't be a current instantiation. Check this
25672 before currently_open_class to avoid infinite recursion (71515). */
25673 if (!TYPE_FIELDS (scope
))
25675 /* If the SCOPE is not the current instantiation, there's no reason
25676 to look inside it. */
25677 if (only_current_p
&& !currently_open_class (scope
))
25679 /* Enter the SCOPE so that name lookup will be resolved as if we
25680 were in the class definition. In particular, SCOPE will no
25681 longer be considered a dependent type. */
25682 pushed_scope
= push_scope (scope
);
25683 /* Look up the declaration. */
25684 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
25685 tf_warning_or_error
);
25687 result
= NULL_TREE
;
25689 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
25690 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
25691 tree fullname
= TYPENAME_TYPE_FULLNAME (type
);
25694 else if (identifier_p (fullname
)
25695 && TREE_CODE (decl
) == TYPE_DECL
)
25697 result
= TREE_TYPE (decl
);
25698 if (result
== error_mark_node
)
25699 result
= NULL_TREE
;
25701 else if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
25702 && DECL_CLASS_TEMPLATE_P (decl
))
25704 /* Obtain the template and the arguments. */
25705 tree tmpl
= TREE_OPERAND (fullname
, 0);
25706 if (TREE_CODE (tmpl
) == IDENTIFIER_NODE
)
25708 /* We get here with a plain identifier because a previous tentative
25709 parse of the nested-name-specifier as part of a ptr-operator saw
25710 ::template X<A>. The use of ::template is necessary in a
25711 ptr-operator, but wrong in a declarator-id.
25713 [temp.names]: In a qualified-id of a declarator-id, the keyword
25714 template shall not appear at the top level. */
25715 pedwarn (EXPR_LOC_OR_LOC (fullname
, input_location
), OPT_Wpedantic
,
25716 "keyword %<template%> not allowed in declarator-id");
25719 tree args
= TREE_OPERAND (fullname
, 1);
25720 /* Instantiate the template. */
25721 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
25722 /*entering_scope=*/true,
25723 tf_error
| tf_user
);
25724 if (result
== error_mark_node
)
25725 result
= NULL_TREE
;
25728 /* Leave the SCOPE. */
25730 pop_scope (pushed_scope
);
25732 /* If we failed to resolve it, return the original typename. */
25736 /* If lookup found a typename type, resolve that too. */
25737 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
25739 /* Ill-formed programs can cause infinite recursion here, so we
25740 must catch that. */
25741 TYPENAME_IS_RESOLVING_P (result
) = 1;
25742 result
= resolve_typename_type (result
, only_current_p
);
25743 TYPENAME_IS_RESOLVING_P (result
) = 0;
25746 /* Qualify the resulting type. */
25747 quals
= cp_type_quals (type
);
25749 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
25754 /* EXPR is an expression which is not type-dependent. Return a proxy
25755 for EXPR that can be used to compute the types of larger
25756 expressions containing EXPR. */
25759 build_non_dependent_expr (tree expr
)
25761 tree orig_expr
= expr
;
25764 /* When checking, try to get a constant value for all non-dependent
25765 expressions in order to expose bugs in *_dependent_expression_p
25766 and constexpr. This can affect code generation, see PR70704, so
25767 only do this for -fchecking=2. */
25768 if (flag_checking
> 1
25769 && cxx_dialect
>= cxx11
25770 /* Don't do this during nsdmi parsing as it can lead to
25771 unexpected recursive instantiations. */
25772 && !parsing_nsdmi ()
25773 /* Don't do this during concept expansion either and for
25774 the same reason. */
25775 && !expanding_concept ())
25776 fold_non_dependent_expr (expr
);
25778 STRIP_ANY_LOCATION_WRAPPER (expr
);
25780 /* Preserve OVERLOADs; the functions must be available to resolve
25783 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
25784 inner_expr
= stmt_expr_value_expr (inner_expr
);
25785 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
25786 inner_expr
= TREE_OPERAND (inner_expr
, 0);
25787 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
25788 inner_expr
= TREE_OPERAND (inner_expr
, 1);
25789 if (is_overloaded_fn (inner_expr
)
25790 || TREE_CODE (inner_expr
) == OFFSET_REF
)
25792 /* There is no need to return a proxy for a variable. */
25795 /* Preserve string constants; conversions from string constants to
25796 "char *" are allowed, even though normally a "const char *"
25797 cannot be used to initialize a "char *". */
25798 if (TREE_CODE (expr
) == STRING_CST
)
25800 /* Preserve void and arithmetic constants, as an optimization -- there is no
25801 reason to create a new node. */
25802 if (TREE_CODE (expr
) == VOID_CST
25803 || TREE_CODE (expr
) == INTEGER_CST
25804 || TREE_CODE (expr
) == REAL_CST
)
25806 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
25807 There is at least one place where we want to know that a
25808 particular expression is a throw-expression: when checking a ?:
25809 expression, there are special rules if the second or third
25810 argument is a throw-expression. */
25811 if (TREE_CODE (expr
) == THROW_EXPR
)
25814 /* Don't wrap an initializer list, we need to be able to look inside. */
25815 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
25818 /* Don't wrap a dummy object, we need to be able to test for it. */
25819 if (is_dummy_object (expr
))
25822 if (TREE_CODE (expr
) == COND_EXPR
)
25823 return build3 (COND_EXPR
,
25825 TREE_OPERAND (expr
, 0),
25826 (TREE_OPERAND (expr
, 1)
25827 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
25828 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
25829 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
25830 if (TREE_CODE (expr
) == COMPOUND_EXPR
25831 && !COMPOUND_EXPR_OVERLOADED (expr
))
25832 return build2 (COMPOUND_EXPR
,
25834 TREE_OPERAND (expr
, 0),
25835 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
25837 /* If the type is unknown, it can't really be non-dependent */
25838 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
25840 /* Otherwise, build a NON_DEPENDENT_EXPR. */
25841 return build1_loc (EXPR_LOCATION (orig_expr
), NON_DEPENDENT_EXPR
,
25842 TREE_TYPE (expr
), expr
);
25845 /* ARGS is a vector of expressions as arguments to a function call.
25846 Replace the arguments with equivalent non-dependent expressions.
25847 This modifies ARGS in place. */
25850 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
25855 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
25857 tree newarg
= build_non_dependent_expr (arg
);
25859 (*args
)[ix
] = newarg
;
25863 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
25864 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
25865 parms. If set_canonical is true, we set TYPE_CANONICAL on it. */
25868 make_auto_1 (tree name
, bool set_canonical
)
25870 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
25871 TYPE_NAME (au
) = build_decl (input_location
,
25872 TYPE_DECL
, name
, au
);
25873 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
25874 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
25875 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
25876 TYPE_NAME (au
), NULL_TREE
);
25878 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
25879 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
25880 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
25886 make_decltype_auto (void)
25888 return make_auto_1 (decltype_auto_identifier
, true);
25894 return make_auto_1 (auto_identifier
, true);
25897 /* Return a C++17 deduction placeholder for class template TMPL. */
25900 make_template_placeholder (tree tmpl
)
25902 tree t
= make_auto_1 (DECL_NAME (tmpl
), true);
25903 CLASS_PLACEHOLDER_TEMPLATE (t
) = tmpl
;
25907 /* True iff T is a C++17 class template deduction placeholder. */
25910 template_placeholder_p (tree t
)
25912 return is_auto (t
) && CLASS_PLACEHOLDER_TEMPLATE (t
);
25915 /* Make a "constrained auto" type-specifier. This is an
25916 auto type with constraints that must be associated after
25917 deduction. The constraint is formed from the given
25918 CONC and its optional sequence of arguments, which are
25919 non-null if written as partial-concept-id. */
25922 make_constrained_auto (tree con
, tree args
)
25924 tree type
= make_auto_1 (auto_identifier
, false);
25926 /* Build the constraint. */
25927 tree tmpl
= DECL_TI_TEMPLATE (con
);
25928 tree expr
= VAR_P (con
) ? tmpl
: ovl_make (tmpl
);
25929 expr
= build_concept_check (expr
, type
, args
);
25931 tree constr
= normalize_expression (expr
);
25932 PLACEHOLDER_TYPE_CONSTRAINTS (type
) = constr
;
25934 /* Our canonical type depends on the constraint. */
25935 TYPE_CANONICAL (type
) = canonical_type_parameter (type
);
25937 /* Attach the constraint to the type declaration. */
25938 tree decl
= TYPE_NAME (type
);
25942 /* Given type ARG, return std::initializer_list<ARG>. */
25947 tree std_init_list
= get_namespace_binding (std_node
, init_list_identifier
);
25949 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
25951 gcc_rich_location
richloc (input_location
);
25952 maybe_add_include_fixit (&richloc
, "<initializer_list>");
25953 error_at (&richloc
,
25954 "deducing from brace-enclosed initializer list"
25955 " requires %<#include <initializer_list>%>");
25957 return error_mark_node
;
25959 tree argvec
= make_tree_vec (1);
25960 TREE_VEC_ELT (argvec
, 0) = arg
;
25962 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
25963 NULL_TREE
, 0, tf_warning_or_error
);
25966 /* Replace auto in TYPE with std::initializer_list<auto>. */
25969 listify_autos (tree type
, tree auto_node
)
25971 tree init_auto
= listify (auto_node
);
25972 tree argvec
= make_tree_vec (1);
25973 TREE_VEC_ELT (argvec
, 0) = init_auto
;
25974 if (processing_template_decl
)
25975 argvec
= add_to_template_args (current_template_args (), argvec
);
25976 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
25979 /* Hash traits for hashing possibly constrained 'auto'
25980 TEMPLATE_TYPE_PARMs for use by do_auto_deduction. */
25982 struct auto_hash
: default_hash_traits
<tree
>
25984 static inline hashval_t
hash (tree
);
25985 static inline bool equal (tree
, tree
);
25988 /* Hash the 'auto' T. */
25991 auto_hash::hash (tree t
)
25993 if (tree c
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
25994 /* Matching constrained-type-specifiers denote the same template
25995 parameter, so hash the constraint. */
25996 return hash_placeholder_constraint (c
);
25998 /* But unconstrained autos are all separate, so just hash the pointer. */
25999 return iterative_hash_object (t
, 0);
26002 /* Compare two 'auto's. */
26005 auto_hash::equal (tree t1
, tree t2
)
26010 tree c1
= PLACEHOLDER_TYPE_CONSTRAINTS (t1
);
26011 tree c2
= PLACEHOLDER_TYPE_CONSTRAINTS (t2
);
26013 /* Two unconstrained autos are distinct. */
26017 return equivalent_placeholder_constraints (c1
, c2
);
26020 /* for_each_template_parm callback for extract_autos: if t is a (possibly
26021 constrained) auto, add it to the vector. */
26024 extract_autos_r (tree t
, void *data
)
26026 hash_table
<auto_hash
> &hash
= *(hash_table
<auto_hash
>*)data
;
26029 /* All the autos were built with index 0; fix that up now. */
26030 tree
*p
= hash
.find_slot (t
, INSERT
);
26033 /* If this is a repeated constrained-type-specifier, use the index we
26035 idx
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (*p
));
26038 /* Otherwise this is new, so use the current count. */
26040 idx
= hash
.elements () - 1;
26042 TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (t
)) = idx
;
26045 /* Always keep walking. */
26049 /* Return a TREE_VEC of the 'auto's used in type under the Concepts TS, which
26050 says they can appear anywhere in the type. */
26053 extract_autos (tree type
)
26055 hash_set
<tree
> visited
;
26056 hash_table
<auto_hash
> hash (2);
26058 for_each_template_parm (type
, extract_autos_r
, &hash
, &visited
, true);
26060 tree tree_vec
= make_tree_vec (hash
.elements());
26061 for (hash_table
<auto_hash
>::iterator iter
= hash
.begin();
26062 iter
!= hash
.end(); ++iter
)
26065 unsigned i
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (elt
));
26066 TREE_VEC_ELT (tree_vec
, i
)
26067 = build_tree_list (NULL_TREE
, TYPE_NAME (elt
));
26073 /* The stem for deduction guide names. */
26074 const char *const dguide_base
= "__dguide_";
26076 /* Return the name for a deduction guide for class template TMPL. */
26079 dguide_name (tree tmpl
)
26081 tree type
= (TYPE_P (tmpl
) ? tmpl
: TREE_TYPE (tmpl
));
26082 tree tname
= TYPE_IDENTIFIER (type
);
26083 char *buf
= (char *) alloca (1 + strlen (dguide_base
)
26084 + IDENTIFIER_LENGTH (tname
));
26085 memcpy (buf
, dguide_base
, strlen (dguide_base
));
26086 memcpy (buf
+ strlen (dguide_base
), IDENTIFIER_POINTER (tname
),
26087 IDENTIFIER_LENGTH (tname
) + 1);
26088 tree dname
= get_identifier (buf
);
26089 TREE_TYPE (dname
) = type
;
26093 /* True if NAME is the name of a deduction guide. */
26096 dguide_name_p (tree name
)
26098 return (TREE_CODE (name
) == IDENTIFIER_NODE
26099 && TREE_TYPE (name
)
26100 && !strncmp (IDENTIFIER_POINTER (name
), dguide_base
,
26101 strlen (dguide_base
)));
26104 /* True if FN is a deduction guide. */
26107 deduction_guide_p (const_tree fn
)
26110 if (tree name
= DECL_NAME (fn
))
26111 return dguide_name_p (name
);
26115 /* True if FN is the copy deduction guide, i.e. A(A)->A. */
26118 copy_guide_p (const_tree fn
)
26120 gcc_assert (deduction_guide_p (fn
));
26121 if (!DECL_ARTIFICIAL (fn
))
26123 tree parms
= FUNCTION_FIRST_USER_PARMTYPE (DECL_TI_TEMPLATE (fn
));
26124 return (TREE_CHAIN (parms
) == void_list_node
26125 && same_type_p (TREE_VALUE (parms
), TREE_TYPE (DECL_NAME (fn
))));
26128 /* True if FN is a guide generated from a constructor template. */
26131 template_guide_p (const_tree fn
)
26133 gcc_assert (deduction_guide_p (fn
));
26134 if (!DECL_ARTIFICIAL (fn
))
26136 tree tmpl
= DECL_TI_TEMPLATE (fn
);
26137 if (tree org
= DECL_ABSTRACT_ORIGIN (tmpl
))
26138 return PRIMARY_TEMPLATE_P (org
);
26142 /* OLDDECL is a _DECL for a template parameter. Return a similar parameter at
26143 LEVEL:INDEX, using tsubst_args and complain for substitution into non-type
26144 template parameter types. Note that the handling of template template
26145 parameters relies on current_template_parms being set appropriately for the
26149 rewrite_template_parm (tree olddecl
, unsigned index
, unsigned level
,
26150 tree tsubst_args
, tsubst_flags_t complain
)
26152 if (olddecl
== error_mark_node
)
26153 return error_mark_node
;
26155 tree oldidx
= get_template_parm_index (olddecl
);
26158 if (TREE_CODE (olddecl
) == TYPE_DECL
26159 || TREE_CODE (olddecl
) == TEMPLATE_DECL
)
26161 tree oldtype
= TREE_TYPE (olddecl
);
26162 newtype
= cxx_make_type (TREE_CODE (oldtype
));
26163 TYPE_MAIN_VARIANT (newtype
) = newtype
;
26164 if (TREE_CODE (oldtype
) == TEMPLATE_TYPE_PARM
)
26165 TEMPLATE_TYPE_PARM_FOR_CLASS (newtype
)
26166 = TEMPLATE_TYPE_PARM_FOR_CLASS (oldtype
);
26170 newtype
= TREE_TYPE (olddecl
);
26171 if (type_uses_auto (newtype
))
26173 // Substitute once to fix references to other template parameters.
26174 newtype
= tsubst (newtype
, tsubst_args
,
26175 complain
|tf_partial
, NULL_TREE
);
26176 // Now substitute again to reduce the level of the auto.
26177 newtype
= tsubst (newtype
, current_template_args (),
26178 complain
, NULL_TREE
);
26181 newtype
= tsubst (newtype
, tsubst_args
,
26182 complain
, NULL_TREE
);
26186 = build_decl (DECL_SOURCE_LOCATION (olddecl
), TREE_CODE (olddecl
),
26187 DECL_NAME (olddecl
), newtype
);
26188 SET_DECL_TEMPLATE_PARM_P (newdecl
);
26191 if (TREE_CODE (olddecl
) == TYPE_DECL
26192 || TREE_CODE (olddecl
) == TEMPLATE_DECL
)
26194 newidx
= TEMPLATE_TYPE_PARM_INDEX (newtype
)
26195 = build_template_parm_index (index
, level
, level
,
26197 TEMPLATE_PARM_PARAMETER_PACK (newidx
)
26198 = TEMPLATE_PARM_PARAMETER_PACK (oldidx
);
26199 TYPE_STUB_DECL (newtype
) = TYPE_NAME (newtype
) = newdecl
;
26200 TYPE_CANONICAL (newtype
) = canonical_type_parameter (newtype
);
26202 if (TREE_CODE (olddecl
) == TEMPLATE_DECL
)
26204 DECL_TEMPLATE_RESULT (newdecl
)
26205 = build_decl (DECL_SOURCE_LOCATION (olddecl
), TYPE_DECL
,
26206 DECL_NAME (olddecl
), newtype
);
26207 DECL_ARTIFICIAL (DECL_TEMPLATE_RESULT (newdecl
)) = true;
26208 // First create a copy (ttargs) of tsubst_args with an
26209 // additional level for the template template parameter's own
26210 // template parameters (ttparms).
26211 tree ttparms
= (INNERMOST_TEMPLATE_PARMS
26212 (DECL_TEMPLATE_PARMS (olddecl
)));
26213 const int depth
= TMPL_ARGS_DEPTH (tsubst_args
);
26214 tree ttargs
= make_tree_vec (depth
+ 1);
26215 for (int i
= 0; i
< depth
; ++i
)
26216 TREE_VEC_ELT (ttargs
, i
) = TREE_VEC_ELT (tsubst_args
, i
);
26217 TREE_VEC_ELT (ttargs
, depth
)
26218 = template_parms_level_to_args (ttparms
);
26219 // Substitute ttargs into ttparms to fix references to
26220 // other template parameters.
26221 ttparms
= tsubst_template_parms_level (ttparms
, ttargs
,
26222 complain
|tf_partial
);
26223 // Now substitute again with args based on tparms, to reduce
26224 // the level of the ttparms.
26225 ttargs
= current_template_args ();
26226 ttparms
= tsubst_template_parms_level (ttparms
, ttargs
,
26228 // Finally, tack the adjusted parms onto tparms.
26229 ttparms
= tree_cons (size_int (depth
), ttparms
,
26230 current_template_parms
);
26231 DECL_TEMPLATE_PARMS (newdecl
) = ttparms
;
26236 tree oldconst
= TEMPLATE_PARM_DECL (oldidx
);
26238 = build_decl (DECL_SOURCE_LOCATION (oldconst
),
26239 TREE_CODE (oldconst
),
26240 DECL_NAME (oldconst
), newtype
);
26241 TREE_CONSTANT (newconst
) = TREE_CONSTANT (newdecl
)
26242 = TREE_READONLY (newconst
) = TREE_READONLY (newdecl
) = true;
26243 SET_DECL_TEMPLATE_PARM_P (newconst
);
26244 newidx
= build_template_parm_index (index
, level
, level
,
26245 newconst
, newtype
);
26246 TEMPLATE_PARM_PARAMETER_PACK (newidx
)
26247 = TEMPLATE_PARM_PARAMETER_PACK (oldidx
);
26248 DECL_INITIAL (newdecl
) = DECL_INITIAL (newconst
) = newidx
;
26254 /* Returns a C++17 class deduction guide template based on the constructor
26255 CTOR. As a special case, CTOR can be a RECORD_TYPE for an implicit default
26256 guide, or REFERENCE_TYPE for an implicit copy/move guide. */
26259 build_deduction_guide (tree ctor
, tree outer_args
, tsubst_flags_t complain
)
26261 tree type
, tparms
, targs
, fparms
, fargs
, ci
;
26262 bool memtmpl
= false;
26265 tree fn_tmpl
= NULL_TREE
;
26270 bool copy_p
= TREE_CODE (type
) == REFERENCE_TYPE
;
26273 type
= TREE_TYPE (type
);
26274 fparms
= tree_cons (NULL_TREE
, type
, void_list_node
);
26277 fparms
= void_list_node
;
26279 tree ctmpl
= CLASSTYPE_TI_TEMPLATE (type
);
26280 tparms
= DECL_TEMPLATE_PARMS (ctmpl
);
26281 targs
= CLASSTYPE_TI_ARGS (type
);
26284 loc
= DECL_SOURCE_LOCATION (ctmpl
);
26285 explicit_p
= false;
26289 ++processing_template_decl
;
26293 = (TREE_CODE (ctor
) == TEMPLATE_DECL
? ctor
26294 : DECL_TI_TEMPLATE (ctor
));
26296 fn_tmpl
= tsubst (fn_tmpl
, outer_args
, complain
, ctor
);
26297 ctor
= DECL_TEMPLATE_RESULT (fn_tmpl
);
26299 type
= DECL_CONTEXT (ctor
);
26301 tparms
= DECL_TEMPLATE_PARMS (fn_tmpl
);
26302 /* If type is a member class template, DECL_TI_ARGS (ctor) will have
26303 fully specialized args for the enclosing class. Strip those off, as
26304 the deduction guide won't have those template parameters. */
26305 targs
= get_innermost_template_args (DECL_TI_ARGS (ctor
),
26306 TMPL_PARMS_DEPTH (tparms
));
26307 /* Discard the 'this' parameter. */
26308 fparms
= FUNCTION_ARG_CHAIN (ctor
);
26309 fargs
= TREE_CHAIN (DECL_ARGUMENTS (ctor
));
26310 ci
= get_constraints (ctor
);
26311 loc
= DECL_SOURCE_LOCATION (ctor
);
26312 explicit_p
= DECL_NONCONVERTING_P (ctor
);
26314 if (PRIMARY_TEMPLATE_P (fn_tmpl
))
26318 /* For a member template constructor, we need to flatten the two
26319 template parameter lists into one, and then adjust the function
26320 signature accordingly. This gets...complicated. */
26321 tree save_parms
= current_template_parms
;
26323 /* For a member template we should have two levels of parms/args, one
26324 for the class and one for the constructor. We stripped
26325 specialized args for further enclosing classes above. */
26326 const int depth
= 2;
26327 gcc_assert (TMPL_ARGS_DEPTH (targs
) == depth
);
26329 /* Template args for translating references to the two-level template
26330 parameters into references to the one-level template parameters we
26332 tree tsubst_args
= copy_node (targs
);
26333 TMPL_ARGS_LEVEL (tsubst_args
, depth
)
26334 = copy_node (TMPL_ARGS_LEVEL (tsubst_args
, depth
));
26336 /* Template parms for the constructor template. */
26337 tree ftparms
= TREE_VALUE (tparms
);
26338 unsigned flen
= TREE_VEC_LENGTH (ftparms
);
26339 /* Template parms for the class template. */
26340 tparms
= TREE_CHAIN (tparms
);
26341 tree ctparms
= TREE_VALUE (tparms
);
26342 unsigned clen
= TREE_VEC_LENGTH (ctparms
);
26343 /* Template parms for the deduction guide start as a copy of the
26344 template parms for the class. We set current_template_parms for
26345 lookup_template_class_1. */
26346 current_template_parms
= tparms
= copy_node (tparms
);
26347 tree new_vec
= TREE_VALUE (tparms
) = make_tree_vec (flen
+ clen
);
26348 for (unsigned i
= 0; i
< clen
; ++i
)
26349 TREE_VEC_ELT (new_vec
, i
) = TREE_VEC_ELT (ctparms
, i
);
26351 /* Now we need to rewrite the constructor parms to append them to the
26353 for (unsigned i
= 0; i
< flen
; ++i
)
26355 unsigned index
= i
+ clen
;
26356 unsigned level
= 1;
26357 tree oldelt
= TREE_VEC_ELT (ftparms
, i
);
26358 tree olddecl
= TREE_VALUE (oldelt
);
26359 tree newdecl
= rewrite_template_parm (olddecl
, index
, level
,
26360 tsubst_args
, complain
);
26361 if (newdecl
== error_mark_node
)
26363 tree newdef
= tsubst_template_arg (TREE_PURPOSE (oldelt
),
26364 tsubst_args
, complain
, ctor
);
26365 tree list
= build_tree_list (newdef
, newdecl
);
26366 TEMPLATE_PARM_CONSTRAINTS (list
)
26367 = tsubst_constraint_info (TEMPLATE_PARM_CONSTRAINTS (oldelt
),
26368 tsubst_args
, complain
, ctor
);
26369 TREE_VEC_ELT (new_vec
, index
) = list
;
26370 TMPL_ARG (tsubst_args
, depth
, i
) = template_parm_to_arg (list
);
26373 /* Now we have a final set of template parms to substitute into the
26374 function signature. */
26375 targs
= template_parms_to_args (tparms
);
26376 fparms
= tsubst_arg_types (fparms
, tsubst_args
, NULL_TREE
,
26378 fargs
= tsubst (fargs
, tsubst_args
, complain
, ctor
);
26380 ci
= tsubst_constraint_info (ci
, tsubst_args
, complain
, ctor
);
26382 current_template_parms
= save_parms
;
26385 --processing_template_decl
;
26387 return error_mark_node
;
26392 /* Copy the parms so we can set DECL_PRIMARY_TEMPLATE. */
26393 tparms
= copy_node (tparms
);
26394 INNERMOST_TEMPLATE_PARMS (tparms
)
26395 = copy_node (INNERMOST_TEMPLATE_PARMS (tparms
));
26398 tree fntype
= build_function_type (type
, fparms
);
26399 tree ded_fn
= build_lang_decl_loc (loc
,
26401 dguide_name (type
), fntype
);
26402 DECL_ARGUMENTS (ded_fn
) = fargs
;
26403 DECL_ARTIFICIAL (ded_fn
) = true;
26404 DECL_NONCONVERTING_P (ded_fn
) = explicit_p
;
26405 tree ded_tmpl
= build_template_decl (ded_fn
, tparms
, /*member*/false);
26406 DECL_ARTIFICIAL (ded_tmpl
) = true;
26407 DECL_TEMPLATE_RESULT (ded_tmpl
) = ded_fn
;
26408 TREE_TYPE (ded_tmpl
) = TREE_TYPE (ded_fn
);
26409 DECL_TEMPLATE_INFO (ded_fn
) = build_template_info (ded_tmpl
, targs
);
26410 DECL_PRIMARY_TEMPLATE (ded_tmpl
) = ded_tmpl
;
26412 DECL_ABSTRACT_ORIGIN (ded_tmpl
) = fn_tmpl
;
26414 set_constraints (ded_tmpl
, ci
);
26419 /* Deduce template arguments for the class template placeholder PTYPE for
26420 template TMPL based on the initializer INIT, and return the resulting
26424 do_class_deduction (tree ptype
, tree tmpl
, tree init
, int flags
,
26425 tsubst_flags_t complain
)
26427 if (!DECL_CLASS_TEMPLATE_P (tmpl
))
26429 /* We should have handled this in the caller. */
26430 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
))
26432 if (complain
& tf_error
)
26433 error ("non-class template %qT used without template arguments", tmpl
);
26434 return error_mark_node
;
26437 tree type
= TREE_TYPE (tmpl
);
26439 bool try_list_ctor
= false;
26441 vec
<tree
,va_gc
> *args
;
26442 if (init
== NULL_TREE
26443 || TREE_CODE (init
) == TREE_LIST
)
26444 args
= make_tree_vector_from_list (init
);
26445 else if (BRACE_ENCLOSED_INITIALIZER_P (init
))
26447 try_list_ctor
= TYPE_HAS_LIST_CTOR (type
);
26448 if (try_list_ctor
&& CONSTRUCTOR_NELTS (init
) == 1)
26450 /* As an exception, the first phase in 16.3.1.7 (considering the
26451 initializer list as a single argument) is omitted if the
26452 initializer list consists of a single expression of type cv U,
26453 where U is a specialization of C or a class derived from a
26454 specialization of C. */
26455 tree elt
= CONSTRUCTOR_ELT (init
, 0)->value
;
26456 tree etype
= TREE_TYPE (elt
);
26458 tree tparms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
26459 tree targs
= make_tree_vec (TREE_VEC_LENGTH (tparms
));
26460 int err
= unify (tparms
, targs
, type
, etype
,
26461 UNIFY_ALLOW_DERIVED
, /*explain*/false);
26463 try_list_ctor
= false;
26466 if (try_list_ctor
|| is_std_init_list (type
))
26467 args
= make_tree_vector_single (init
);
26469 args
= make_tree_vector_from_ctor (init
);
26472 args
= make_tree_vector_single (init
);
26474 tree dname
= dguide_name (tmpl
);
26475 tree cands
= lookup_qualified_name (CP_DECL_CONTEXT (tmpl
), dname
,
26476 /*type*/false, /*complain*/false,
26478 bool elided
= false;
26479 if (cands
== error_mark_node
)
26482 /* Prune explicit deduction guides in copy-initialization context. */
26483 if (flags
& LOOKUP_ONLYCONVERTING
)
26485 for (lkp_iterator
iter (cands
); !elided
&& iter
; ++iter
)
26486 if (DECL_NONCONVERTING_P (STRIP_TEMPLATE (*iter
)))
26491 /* Found a nonconverting guide, prune the candidates. */
26492 tree pruned
= NULL_TREE
;
26493 for (lkp_iterator
iter (cands
); iter
; ++iter
)
26494 if (!DECL_NONCONVERTING_P (STRIP_TEMPLATE (*iter
)))
26495 pruned
= lookup_add (*iter
, pruned
);
26501 tree outer_args
= NULL_TREE
;
26502 if (DECL_CLASS_SCOPE_P (tmpl
)
26503 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (tmpl
)))
26505 outer_args
= CLASSTYPE_TI_ARGS (DECL_CONTEXT (tmpl
));
26506 type
= TREE_TYPE (most_general_template (tmpl
));
26509 bool saw_ctor
= false;
26510 // FIXME cache artificial deduction guides
26511 for (ovl_iterator
iter (CLASSTYPE_CONSTRUCTORS (type
)); iter
; ++iter
)
26513 /* Skip inherited constructors. */
26514 if (iter
.using_p ())
26517 tree guide
= build_deduction_guide (*iter
, outer_args
, complain
);
26518 if (guide
== error_mark_node
)
26519 return error_mark_node
;
26520 if ((flags
& LOOKUP_ONLYCONVERTING
)
26521 && DECL_NONCONVERTING_P (STRIP_TEMPLATE (guide
)))
26524 cands
= lookup_add (guide
, cands
);
26529 tree call
= error_mark_node
;
26531 /* If this is list-initialization and the class has a list constructor, first
26532 try deducing from the list as a single argument, as [over.match.list]. */
26533 tree list_cands
= NULL_TREE
;
26534 if (try_list_ctor
&& cands
)
26535 for (lkp_iterator
iter (cands
); iter
; ++iter
)
26538 if (is_list_ctor (dg
))
26539 list_cands
= lookup_add (dg
, list_cands
);
26543 ++cp_unevaluated_operand
;
26544 call
= build_new_function_call (list_cands
, &args
, tf_decltype
);
26545 --cp_unevaluated_operand
;
26547 if (call
== error_mark_node
)
26549 /* That didn't work, now try treating the list as a sequence of
26551 release_tree_vector (args
);
26552 args
= make_tree_vector_from_ctor (init
);
26556 /* Maybe generate an implicit deduction guide. */
26557 if (call
== error_mark_node
&& args
->length () < 2)
26559 tree gtype
= NULL_TREE
;
26561 if (args
->length () == 1)
26562 /* Generate a copy guide. */
26563 gtype
= build_reference_type (type
);
26564 else if (!saw_ctor
)
26565 /* Generate a default guide. */
26570 tree guide
= build_deduction_guide (gtype
, outer_args
, complain
);
26571 if (guide
== error_mark_node
)
26572 return error_mark_node
;
26573 cands
= lookup_add (guide
, cands
);
26577 if (elided
&& !cands
)
26579 error ("cannot deduce template arguments for copy-initialization"
26580 " of %qT, as it has no non-explicit deduction guides or "
26581 "user-declared constructors", type
);
26582 return error_mark_node
;
26584 else if (!cands
&& call
== error_mark_node
)
26586 error ("cannot deduce template arguments of %qT, as it has no viable "
26587 "deduction guides", type
);
26588 return error_mark_node
;
26591 if (call
== error_mark_node
)
26593 ++cp_unevaluated_operand
;
26594 call
= build_new_function_call (cands
, &args
, tf_decltype
);
26595 --cp_unevaluated_operand
;
26598 if (call
== error_mark_node
&& (complain
& tf_warning_or_error
))
26600 error ("class template argument deduction failed:");
26602 ++cp_unevaluated_operand
;
26603 call
= build_new_function_call (cands
, &args
, complain
| tf_decltype
);
26604 --cp_unevaluated_operand
;
26607 inform (input_location
, "explicit deduction guides not considered "
26608 "for copy-initialization");
26611 release_tree_vector (args
);
26613 return cp_build_qualified_type (TREE_TYPE (call
), cp_type_quals (ptype
));
26616 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
26617 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE.
26618 The CONTEXT determines the context in which auto deduction is performed
26619 and is used to control error diagnostics. FLAGS are the LOOKUP_* flags.
26620 OUTER_TARGS are used during template argument deduction
26621 (context == adc_unify) to properly substitute the result, and is ignored
26624 For partial-concept-ids, extra args may be appended to the list of deduced
26625 template arguments prior to determining constraint satisfaction. */
26628 do_auto_deduction (tree type
, tree init
, tree auto_node
,
26629 tsubst_flags_t complain
, auto_deduction_context context
,
26630 tree outer_targs
, int flags
)
26634 if (init
== error_mark_node
)
26635 return error_mark_node
;
26637 if (init
&& type_dependent_expression_p (init
)
26638 && context
!= adc_unify
)
26639 /* Defining a subset of type-dependent expressions that we can deduce
26640 from ahead of time isn't worth the trouble. */
26643 /* Similarly, we can't deduce from another undeduced decl. */
26644 if (init
&& undeduced_auto_decl (init
))
26647 if (tree tmpl
= CLASS_PLACEHOLDER_TEMPLATE (auto_node
))
26648 /* C++17 class template argument deduction. */
26649 return do_class_deduction (type
, tmpl
, init
, flags
, complain
);
26651 if (init
== NULL_TREE
|| TREE_TYPE (init
) == NULL_TREE
)
26652 /* Nothing we can do with this, even in deduction context. */
26655 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
26656 with either a new invented type template parameter U or, if the
26657 initializer is a braced-init-list (8.5.4), with
26658 std::initializer_list<U>. */
26659 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
26661 if (!DIRECT_LIST_INIT_P (init
))
26662 type
= listify_autos (type
, auto_node
);
26663 else if (CONSTRUCTOR_NELTS (init
) == 1)
26664 init
= CONSTRUCTOR_ELT (init
, 0)->value
;
26667 if (complain
& tf_warning_or_error
)
26669 if (permerror (input_location
, "direct-list-initialization of "
26670 "%<auto%> requires exactly one element"))
26671 inform (input_location
,
26672 "for deduction to %<std::initializer_list%>, use copy-"
26673 "list-initialization (i.e. add %<=%> before the %<{%>)");
26675 type
= listify_autos (type
, auto_node
);
26679 if (type
== error_mark_node
)
26680 return error_mark_node
;
26682 init
= resolve_nondeduced_context (init
, complain
);
26684 if (context
== adc_decomp_type
26685 && auto_node
== type
26686 && init
!= error_mark_node
26687 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
26688 /* [dcl.decomp]/1 - if decomposition declaration has no ref-qualifiers
26689 and initializer has array type, deduce cv-qualified array type. */
26690 return cp_build_qualified_type_real (TREE_TYPE (init
), TYPE_QUALS (type
),
26692 else if (AUTO_IS_DECLTYPE (auto_node
))
26694 bool id
= (DECL_P (init
)
26695 || ((TREE_CODE (init
) == COMPONENT_REF
26696 || TREE_CODE (init
) == SCOPE_REF
)
26697 && !REF_PARENTHESIZED_P (init
)));
26698 targs
= make_tree_vec (1);
26699 TREE_VEC_ELT (targs
, 0)
26700 = finish_decltype_type (init
, id
, tf_warning_or_error
);
26701 if (type
!= auto_node
)
26703 if (complain
& tf_error
)
26704 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
26705 return error_mark_node
;
26710 tree parms
= build_tree_list (NULL_TREE
, type
);
26714 tparms
= extract_autos (type
);
26717 tparms
= make_tree_vec (1);
26718 TREE_VEC_ELT (tparms
, 0)
26719 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
26722 targs
= make_tree_vec (TREE_VEC_LENGTH (tparms
));
26723 int val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
26724 DEDUCE_CALL
, LOOKUP_NORMAL
,
26725 NULL
, /*explain_p=*/false);
26728 if (processing_template_decl
)
26729 /* Try again at instantiation time. */
26731 if (type
&& type
!= error_mark_node
26732 && (complain
& tf_error
))
26733 /* If type is error_mark_node a diagnostic must have been
26734 emitted by now. Also, having a mention to '<type error>'
26735 in the diagnostic is not really useful to the user. */
26737 if (cfun
&& auto_node
== current_function_auto_return_pattern
26738 && LAMBDA_FUNCTION_P (current_function_decl
))
26739 error ("unable to deduce lambda return type from %qE", init
);
26741 error ("unable to deduce %qT from %qE", type
, init
);
26742 type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
26743 DEDUCE_CALL
, LOOKUP_NORMAL
,
26744 NULL
, /*explain_p=*/true);
26746 return error_mark_node
;
26750 /* Check any placeholder constraints against the deduced type. */
26751 if (flag_concepts
&& !processing_template_decl
)
26752 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (auto_node
))
26754 /* Use the deduced type to check the associated constraints. If we
26755 have a partial-concept-id, rebuild the argument list so that
26756 we check using the extra arguments. */
26757 gcc_assert (TREE_CODE (constr
) == CHECK_CONSTR
);
26758 tree cargs
= CHECK_CONSTR_ARGS (constr
);
26759 if (TREE_VEC_LENGTH (cargs
) > 1)
26761 cargs
= copy_node (cargs
);
26762 TREE_VEC_ELT (cargs
, 0) = TREE_VEC_ELT (targs
, 0);
26766 if (!constraints_satisfied_p (constr
, cargs
))
26768 if (complain
& tf_warning_or_error
)
26772 case adc_unspecified
:
26774 error("placeholder constraints not satisfied");
26776 case adc_variable_type
:
26777 case adc_decomp_type
:
26778 error ("deduced initializer does not satisfy "
26779 "placeholder constraints");
26781 case adc_return_type
:
26782 error ("deduced return type does not satisfy "
26783 "placeholder constraints");
26785 case adc_requirement
:
26786 error ("deduced expression type does not satisfy "
26787 "placeholder constraints");
26790 diagnose_constraints (input_location
, constr
, targs
);
26792 return error_mark_node
;
26796 if (processing_template_decl
&& context
!= adc_unify
)
26797 outer_targs
= current_template_args ();
26798 targs
= add_to_template_args (outer_targs
, targs
);
26799 return tsubst (type
, targs
, complain
, NULL_TREE
);
26802 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
26806 splice_late_return_type (tree type
, tree late_return_type
)
26808 if (is_auto (type
))
26810 if (late_return_type
)
26811 return late_return_type
;
26813 tree idx
= get_template_parm_index (type
);
26814 if (TEMPLATE_PARM_LEVEL (idx
) <= processing_template_decl
)
26815 /* In an abbreviated function template we didn't know we were dealing
26816 with a function template when we saw the auto return type, so update
26817 it to have the correct level. */
26818 return make_auto_1 (TYPE_IDENTIFIER (type
), true);
26823 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
26824 'decltype(auto)' or a deduced class template. */
26827 is_auto (const_tree type
)
26829 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
26830 && (TYPE_IDENTIFIER (type
) == auto_identifier
26831 || TYPE_IDENTIFIER (type
) == decltype_auto_identifier
26832 || CLASS_PLACEHOLDER_TEMPLATE (type
)))
26838 /* for_each_template_parm callback for type_uses_auto. */
26841 is_auto_r (tree tp
, void */
*data*/
)
26843 return is_auto (tp
);
26846 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
26847 a use of `auto'. Returns NULL_TREE otherwise. */
26850 type_uses_auto (tree type
)
26852 if (type
== NULL_TREE
)
26854 else if (flag_concepts
)
26856 /* The Concepts TS allows multiple autos in one type-specifier; just
26857 return the first one we find, do_auto_deduction will collect all of
26859 if (uses_template_parms (type
))
26860 return for_each_template_parm (type
, is_auto_r
, /*data*/NULL
,
26861 /*visited*/NULL
, /*nondeduced*/true);
26866 return find_type_usage (type
, is_auto
);
26869 /* Report ill-formed occurrences of auto types in ARGUMENTS. If
26870 concepts are enabled, auto is acceptable in template arguments, but
26871 only when TEMPL identifies a template class. Return TRUE if any
26872 such errors were reported. */
26875 check_auto_in_tmpl_args (tree tmpl
, tree args
)
26877 /* If there were previous errors, nevermind. */
26878 if (!args
|| TREE_CODE (args
) != TREE_VEC
)
26881 /* If TMPL is an identifier, we're parsing and we can't tell yet
26882 whether TMPL is supposed to be a type, a function or a variable.
26883 We'll only be able to tell during template substitution, so we
26884 expect to be called again then. If concepts are enabled and we
26885 know we have a type, we're ok. */
26887 && (identifier_p (tmpl
)
26889 && (DECL_TYPE_TEMPLATE_P (tmpl
)
26890 || DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)))))
26893 /* Quickly search for any occurrences of auto; usually there won't
26894 be any, and then we'll avoid allocating the vector. */
26895 if (!type_uses_auto (args
))
26898 bool errors
= false;
26900 tree vec
= extract_autos (args
);
26901 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); i
++)
26903 tree xauto
= TREE_VALUE (TREE_VEC_ELT (vec
, i
));
26904 error_at (DECL_SOURCE_LOCATION (xauto
),
26905 "invalid use of %qT in template argument", xauto
);
26912 /* For a given template T, return the vector of typedefs referenced
26913 in T for which access check is needed at T instantiation time.
26914 T is either a FUNCTION_DECL or a RECORD_TYPE.
26915 Those typedefs were added to T by the function
26916 append_type_to_template_for_access_check. */
26918 vec
<qualified_typedef_usage_t
, va_gc
> *
26919 get_types_needing_access_check (tree t
)
26922 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
26924 if (!t
|| t
== error_mark_node
)
26927 if (!(ti
= get_template_info (t
)))
26930 if (CLASS_TYPE_P (t
)
26931 || TREE_CODE (t
) == FUNCTION_DECL
)
26933 if (!TI_TEMPLATE (ti
))
26936 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
26942 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
26943 tied to T. That list of typedefs will be access checked at
26944 T instantiation time.
26945 T is either a FUNCTION_DECL or a RECORD_TYPE.
26946 TYPE_DECL is a TYPE_DECL node representing a typedef.
26947 SCOPE is the scope through which TYPE_DECL is accessed.
26948 LOCATION is the location of the usage point of TYPE_DECL.
26950 This function is a subroutine of
26951 append_type_to_template_for_access_check. */
26954 append_type_to_template_for_access_check_1 (tree t
,
26957 location_t location
)
26959 qualified_typedef_usage_t typedef_usage
;
26962 if (!t
|| t
== error_mark_node
)
26965 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
26966 || CLASS_TYPE_P (t
))
26968 && TREE_CODE (type_decl
) == TYPE_DECL
26971 if (!(ti
= get_template_info (t
)))
26974 gcc_assert (TI_TEMPLATE (ti
));
26976 typedef_usage
.typedef_decl
= type_decl
;
26977 typedef_usage
.context
= scope
;
26978 typedef_usage
.locus
= location
;
26980 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
26983 /* Append TYPE_DECL to the template TEMPL.
26984 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
26985 At TEMPL instanciation time, TYPE_DECL will be checked to see
26986 if it can be accessed through SCOPE.
26987 LOCATION is the location of the usage point of TYPE_DECL.
26989 e.g. consider the following code snippet:
26996 template<class U> struct S
26998 C::myint mi; // <-- usage point of the typedef C::myint
27003 At S<char> instantiation time, we need to check the access of C::myint
27004 In other words, we need to check the access of the myint typedef through
27005 the C scope. For that purpose, this function will add the myint typedef
27006 and the scope C through which its being accessed to a list of typedefs
27007 tied to the template S. That list will be walked at template instantiation
27008 time and access check performed on each typedefs it contains.
27009 Note that this particular code snippet should yield an error because
27010 myint is private to C. */
27013 append_type_to_template_for_access_check (tree templ
,
27016 location_t location
)
27018 qualified_typedef_usage_t
*iter
;
27021 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
27023 /* Make sure we don't append the type to the template twice. */
27024 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
27025 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
27028 append_type_to_template_for_access_check_1 (templ
, type_decl
,
27032 /* Convert the generic type parameters in PARM that match the types given in the
27033 range [START_IDX, END_IDX) from the current_template_parms into generic type
27037 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
27039 tree current
= current_template_parms
;
27040 int depth
= TMPL_PARMS_DEPTH (current
);
27041 current
= INNERMOST_TEMPLATE_PARMS (current
);
27042 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
27044 for (int i
= 0; i
< start_idx
; ++i
)
27045 TREE_VEC_ELT (replacement
, i
)
27046 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
27048 for (int i
= start_idx
; i
< end_idx
; ++i
)
27050 /* Create a distinct parameter pack type from the current parm and add it
27051 to the replacement args to tsubst below into the generic function
27054 tree o
= TREE_TYPE (TREE_VALUE
27055 (TREE_VEC_ELT (current
, i
)));
27056 tree t
= copy_type (o
);
27057 TEMPLATE_TYPE_PARM_INDEX (t
)
27058 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
27060 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
27061 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
27062 TYPE_MAIN_VARIANT (t
) = t
;
27063 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
27064 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
27065 TREE_VEC_ELT (replacement
, i
) = t
;
27066 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
27069 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
27070 TREE_VEC_ELT (replacement
, i
)
27071 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
27073 /* If there are more levels then build up the replacement with the outer
27076 replacement
= add_to_template_args (template_parms_to_args
27077 (TREE_CHAIN (current_template_parms
)),
27080 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
27083 /* Entries in the decl_constraint hash table. */
27084 struct GTY((for_user
)) constr_entry
27090 /* Hashing function and equality for constraint entries. */
27091 struct constr_hasher
: ggc_ptr_hash
<constr_entry
>
27093 static hashval_t
hash (constr_entry
*e
)
27095 return (hashval_t
)DECL_UID (e
->decl
);
27098 static bool equal (constr_entry
*e1
, constr_entry
*e2
)
27100 return e1
->decl
== e2
->decl
;
27104 /* A mapping from declarations to constraint information. Note that
27105 both templates and their underlying declarations are mapped to the
27106 same constraint information.
27108 FIXME: This is defined in pt.c because garbage collection
27109 code is not being generated for constraint.cc. */
27111 static GTY (()) hash_table
<constr_hasher
> *decl_constraints
;
27113 /* Returns the template constraints of declaration T. If T is not
27114 constrained, return NULL_TREE. Note that T must be non-null. */
27117 get_constraints (tree t
)
27119 if (!flag_concepts
)
27122 gcc_assert (DECL_P (t
));
27123 if (TREE_CODE (t
) == TEMPLATE_DECL
)
27124 t
= DECL_TEMPLATE_RESULT (t
);
27125 constr_entry elt
= { t
, NULL_TREE
};
27126 constr_entry
* found
= decl_constraints
->find (&elt
);
27133 /* Associate the given constraint information CI with the declaration
27134 T. If T is a template, then the constraints are associated with
27135 its underlying declaration. Don't build associations if CI is
27139 set_constraints (tree t
, tree ci
)
27143 gcc_assert (t
&& flag_concepts
);
27144 if (TREE_CODE (t
) == TEMPLATE_DECL
)
27145 t
= DECL_TEMPLATE_RESULT (t
);
27146 gcc_assert (!get_constraints (t
));
27147 constr_entry elt
= {t
, ci
};
27148 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, INSERT
);
27149 constr_entry
* entry
= ggc_alloc
<constr_entry
> ();
27154 /* Remove the associated constraints of the declaration T. */
27157 remove_constraints (tree t
)
27159 gcc_assert (DECL_P (t
));
27160 if (TREE_CODE (t
) == TEMPLATE_DECL
)
27161 t
= DECL_TEMPLATE_RESULT (t
);
27163 constr_entry elt
= {t
, NULL_TREE
};
27164 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, NO_INSERT
);
27166 decl_constraints
->clear_slot (slot
);
27169 /* Memoized satisfaction results for declarations. This
27170 maps the pair (constraint_info, arguments) to the result computed
27171 by constraints_satisfied_p. */
27173 struct GTY((for_user
)) constraint_sat_entry
27180 /* Hashing function and equality for constraint entries. */
27182 struct constraint_sat_hasher
: ggc_ptr_hash
<constraint_sat_entry
>
27184 static hashval_t
hash (constraint_sat_entry
*e
)
27186 hashval_t val
= iterative_hash_object(e
->ci
, 0);
27187 return iterative_hash_template_arg (e
->args
, val
);
27190 static bool equal (constraint_sat_entry
*e1
, constraint_sat_entry
*e2
)
27192 return e1
->ci
== e2
->ci
&& comp_template_args (e1
->args
, e2
->args
);
27196 /* Memoized satisfaction results for concept checks. */
27198 struct GTY((for_user
)) concept_spec_entry
27205 /* Hashing function and equality for constraint entries. */
27207 struct concept_spec_hasher
: ggc_ptr_hash
<concept_spec_entry
>
27209 static hashval_t
hash (concept_spec_entry
*e
)
27211 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
27214 static bool equal (concept_spec_entry
*e1
, concept_spec_entry
*e2
)
27216 ++comparing_specializations
;
27217 bool eq
= e1
->tmpl
== e2
->tmpl
&& comp_template_args (e1
->args
, e2
->args
);
27218 --comparing_specializations
;
27223 static GTY (()) hash_table
<constraint_sat_hasher
> *constraint_memos
;
27224 static GTY (()) hash_table
<concept_spec_hasher
> *concept_memos
;
27226 /* Search for a memoized satisfaction result. Returns one of the
27227 truth value nodes if previously memoized, or NULL_TREE otherwise. */
27230 lookup_constraint_satisfaction (tree ci
, tree args
)
27232 constraint_sat_entry elt
= { ci
, args
, NULL_TREE
};
27233 constraint_sat_entry
* found
= constraint_memos
->find (&elt
);
27235 return found
->result
;
27240 /* Memoize the result of a satisfication test. Returns the saved result. */
27243 memoize_constraint_satisfaction (tree ci
, tree args
, tree result
)
27245 constraint_sat_entry elt
= {ci
, args
, result
};
27246 constraint_sat_entry
** slot
= constraint_memos
->find_slot (&elt
, INSERT
);
27247 constraint_sat_entry
* entry
= ggc_alloc
<constraint_sat_entry
> ();
27253 /* Search for a memoized satisfaction result for a concept. */
27256 lookup_concept_satisfaction (tree tmpl
, tree args
)
27258 concept_spec_entry elt
= { tmpl
, args
, NULL_TREE
};
27259 concept_spec_entry
* found
= concept_memos
->find (&elt
);
27261 return found
->result
;
27266 /* Memoize the result of a concept check. Returns the saved result. */
27269 memoize_concept_satisfaction (tree tmpl
, tree args
, tree result
)
27271 concept_spec_entry elt
= {tmpl
, args
, result
};
27272 concept_spec_entry
** slot
= concept_memos
->find_slot (&elt
, INSERT
);
27273 concept_spec_entry
* entry
= ggc_alloc
<concept_spec_entry
> ();
27279 static GTY (()) hash_table
<concept_spec_hasher
> *concept_expansions
;
27281 /* Returns a prior concept specialization. This returns the substituted
27282 and normalized constraints defined by the concept. */
27285 get_concept_expansion (tree tmpl
, tree args
)
27287 concept_spec_entry elt
= { tmpl
, args
, NULL_TREE
};
27288 concept_spec_entry
* found
= concept_expansions
->find (&elt
);
27290 return found
->result
;
27295 /* Save a concept expansion for later. */
27298 save_concept_expansion (tree tmpl
, tree args
, tree def
)
27300 concept_spec_entry elt
= {tmpl
, args
, def
};
27301 concept_spec_entry
** slot
= concept_expansions
->find_slot (&elt
, INSERT
);
27302 concept_spec_entry
* entry
= ggc_alloc
<concept_spec_entry
> ();
27309 hash_subsumption_args (tree t1
, tree t2
)
27311 gcc_assert (TREE_CODE (t1
) == CHECK_CONSTR
);
27312 gcc_assert (TREE_CODE (t2
) == CHECK_CONSTR
);
27314 val
= iterative_hash_object (CHECK_CONSTR_CONCEPT (t1
), val
);
27315 val
= iterative_hash_template_arg (CHECK_CONSTR_ARGS (t1
), val
);
27316 val
= iterative_hash_object (CHECK_CONSTR_CONCEPT (t2
), val
);
27317 val
= iterative_hash_template_arg (CHECK_CONSTR_ARGS (t2
), val
);
27321 /* Compare the constraints of two subsumption entries. The LEFT1 and
27322 LEFT2 arguments comprise the first subsumption pair and the RIGHT1
27323 and RIGHT2 arguments comprise the second. These are all CHECK_CONSTRs. */
27326 comp_subsumption_args (tree left1
, tree left2
, tree right1
, tree right2
)
27328 if (CHECK_CONSTR_CONCEPT (left1
) == CHECK_CONSTR_CONCEPT (right1
))
27329 if (CHECK_CONSTR_CONCEPT (left2
) == CHECK_CONSTR_CONCEPT (right2
))
27330 if (comp_template_args (CHECK_CONSTR_ARGS (left1
),
27331 CHECK_CONSTR_ARGS (right1
)))
27332 return comp_template_args (CHECK_CONSTR_ARGS (left2
),
27333 CHECK_CONSTR_ARGS (right2
));
27337 /* Key/value pair for learning and memoizing subsumption results. This
27338 associates a pair of check constraints (including arguments) with
27339 a boolean value indicating the result. */
27341 struct GTY((for_user
)) subsumption_entry
27348 /* Hashing function and equality for constraint entries. */
27350 struct subsumption_hasher
: ggc_ptr_hash
<subsumption_entry
>
27352 static hashval_t
hash (subsumption_entry
*e
)
27354 return hash_subsumption_args (e
->t1
, e
->t2
);
27357 static bool equal (subsumption_entry
*e1
, subsumption_entry
*e2
)
27359 ++comparing_specializations
;
27360 bool eq
= comp_subsumption_args(e1
->t1
, e1
->t2
, e2
->t1
, e2
->t2
);
27361 --comparing_specializations
;
27366 static GTY (()) hash_table
<subsumption_hasher
> *subsumption_table
;
27368 /* Search for a previously cached subsumption result. */
27371 lookup_subsumption_result (tree t1
, tree t2
)
27373 subsumption_entry elt
= { t1
, t2
, false };
27374 subsumption_entry
* found
= subsumption_table
->find (&elt
);
27376 return &found
->result
;
27381 /* Save a subsumption result. */
27384 save_subsumption_result (tree t1
, tree t2
, bool result
)
27386 subsumption_entry elt
= {t1
, t2
, result
};
27387 subsumption_entry
** slot
= subsumption_table
->find_slot (&elt
, INSERT
);
27388 subsumption_entry
* entry
= ggc_alloc
<subsumption_entry
> ();
27394 /* Set up the hash table for constraint association. */
27397 init_constraint_processing (void)
27399 if (!flag_concepts
)
27402 decl_constraints
= hash_table
<constr_hasher
>::create_ggc(37);
27403 constraint_memos
= hash_table
<constraint_sat_hasher
>::create_ggc(37);
27404 concept_memos
= hash_table
<concept_spec_hasher
>::create_ggc(37);
27405 concept_expansions
= hash_table
<concept_spec_hasher
>::create_ggc(37);
27406 subsumption_table
= hash_table
<subsumption_hasher
>::create_ggc(37);
27409 /* __integer_pack(N) in a pack expansion expands to a sequence of numbers from
27413 declare_integer_pack (void)
27415 tree ipfn
= push_library_fn (get_identifier ("__integer_pack"),
27416 build_function_type_list (integer_type_node
,
27419 NULL_TREE
, ECF_CONST
);
27420 DECL_DECLARED_CONSTEXPR_P (ipfn
) = true;
27421 DECL_BUILT_IN_CLASS (ipfn
) = BUILT_IN_FRONTEND
;
27424 /* Set up the hash tables for template instantiations. */
27427 init_template_processing (void)
27429 decl_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
27430 type_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
27432 if (cxx_dialect
>= cxx11
)
27433 declare_integer_pack ();
27436 /* Print stats about the template hash tables for -fstats. */
27439 print_template_statistics (void)
27441 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
27442 "%f collisions\n", (long) decl_specializations
->size (),
27443 (long) decl_specializations
->elements (),
27444 decl_specializations
->collisions ());
27445 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
27446 "%f collisions\n", (long) type_specializations
->size (),
27447 (long) type_specializations
->elements (),
27448 type_specializations
->collisions ());
27453 namespace selftest
{
27455 /* Verify that build_non_dependent_expr () works, for various expressions,
27456 and that location wrappers don't affect the results. */
27459 test_build_non_dependent_expr ()
27461 location_t loc
= BUILTINS_LOCATION
;
27463 /* Verify constants, without and with location wrappers. */
27464 tree int_cst
= build_int_cst (integer_type_node
, 42);
27465 ASSERT_EQ (int_cst
, build_non_dependent_expr (int_cst
));
27467 tree wrapped_int_cst
= maybe_wrap_with_location (int_cst
, loc
);
27468 ASSERT_TRUE (location_wrapper_p (wrapped_int_cst
));
27469 ASSERT_EQ (wrapped_int_cst
, build_non_dependent_expr (wrapped_int_cst
));
27471 tree string_lit
= build_string (4, "foo");
27472 TREE_TYPE (string_lit
) = char_array_type_node
;
27473 string_lit
= fix_string_type (string_lit
);
27474 ASSERT_EQ (string_lit
, build_non_dependent_expr (string_lit
));
27476 tree wrapped_string_lit
= maybe_wrap_with_location (string_lit
, loc
);
27477 ASSERT_TRUE (location_wrapper_p (wrapped_string_lit
));
27478 ASSERT_EQ (wrapped_string_lit
,
27479 build_non_dependent_expr (wrapped_string_lit
));
27482 /* Verify that type_dependent_expression_p () works correctly, even
27483 in the presence of location wrapper nodes. */
27486 test_type_dependent_expression_p ()
27488 location_t loc
= BUILTINS_LOCATION
;
27490 tree name
= get_identifier ("foo");
27492 /* If no templates are involved, nothing is type-dependent. */
27493 gcc_assert (!processing_template_decl
);
27494 ASSERT_FALSE (type_dependent_expression_p (name
));
27496 ++processing_template_decl
;
27498 /* Within a template, an unresolved name is always type-dependent. */
27499 ASSERT_TRUE (type_dependent_expression_p (name
));
27501 /* Ensure it copes with NULL_TREE and errors. */
27502 ASSERT_FALSE (type_dependent_expression_p (NULL_TREE
));
27503 ASSERT_FALSE (type_dependent_expression_p (error_mark_node
));
27505 /* A USING_DECL in a template should be type-dependent, even if wrapped
27506 with a location wrapper (PR c++/83799). */
27507 tree using_decl
= build_lang_decl (USING_DECL
, name
, NULL_TREE
);
27508 TREE_TYPE (using_decl
) = integer_type_node
;
27509 ASSERT_TRUE (type_dependent_expression_p (using_decl
));
27510 tree wrapped_using_decl
= maybe_wrap_with_location (using_decl
, loc
);
27511 ASSERT_TRUE (location_wrapper_p (wrapped_using_decl
));
27512 ASSERT_TRUE (type_dependent_expression_p (wrapped_using_decl
));
27514 --processing_template_decl
;
27517 /* Run all of the selftests within this file. */
27522 test_build_non_dependent_expr ();
27523 test_type_dependent_expression_p ();
27526 } // namespace selftest
27528 #endif /* #if CHECKING_P */
27530 #include "gt-cp-pt.h"