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
= cxx_copy_lang_qualifiers (new_type
, old_type
);
2533 TREE_TYPE (decl
) = new_type
;
2536 /* Return the number of template headers we expect to see for a definition
2537 or specialization of CTYPE or one of its non-template members. */
2540 num_template_headers_for_class (tree ctype
)
2542 int num_templates
= 0;
2544 while (ctype
&& CLASS_TYPE_P (ctype
))
2546 /* You're supposed to have one `template <...>' for every
2547 template class, but you don't need one for a full
2548 specialization. For example:
2550 template <class T> struct S{};
2551 template <> struct S<int> { void f(); };
2552 void S<int>::f () {}
2554 is correct; there shouldn't be a `template <>' for the
2555 definition of `S<int>::f'. */
2556 if (!CLASSTYPE_TEMPLATE_INFO (ctype
))
2557 /* If CTYPE does not have template information of any
2558 kind, then it is not a template, nor is it nested
2559 within a template. */
2561 if (explicit_class_specialization_p (ctype
))
2563 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (ctype
)))
2566 ctype
= TYPE_CONTEXT (ctype
);
2569 return num_templates
;
2572 /* Do a simple sanity check on the template headers that precede the
2573 variable declaration DECL. */
2576 check_template_variable (tree decl
)
2578 tree ctx
= CP_DECL_CONTEXT (decl
);
2579 int wanted
= num_template_headers_for_class (ctx
);
2580 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
2581 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
2583 if (cxx_dialect
< cxx14
)
2584 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2585 "variable templates only available with "
2586 "-std=c++14 or -std=gnu++14");
2588 // Namespace-scope variable templates should have a template header.
2591 if (template_header_count
> wanted
)
2593 bool warned
= pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2594 "too many template headers for %qD "
2597 if (warned
&& CLASS_TYPE_P (ctx
)
2598 && CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2599 inform (DECL_SOURCE_LOCATION (decl
),
2600 "members of an explicitly specialized class are defined "
2601 "without a template header");
2605 /* An explicit specialization whose declarator-id or class-head-name is not
2606 qualified shall be declared in the nearest enclosing namespace of the
2607 template, or, if the namespace is inline (7.3.1), any namespace from its
2608 enclosing namespace set.
2610 If the name declared in the explicit instantiation is an unqualified name,
2611 the explicit instantiation shall appear in the namespace where its template
2612 is declared or, if that namespace is inline (7.3.1), any namespace from its
2613 enclosing namespace set. */
2616 check_unqualified_spec_or_inst (tree t
, location_t loc
)
2618 tree tmpl
= most_general_template (t
);
2619 if (DECL_NAMESPACE_SCOPE_P (tmpl
)
2620 && !is_nested_namespace (current_namespace
,
2621 CP_DECL_CONTEXT (tmpl
), true))
2623 if (processing_specialization
)
2624 permerror (loc
, "explicit specialization of %qD outside its "
2625 "namespace must use a nested-name-specifier", tmpl
);
2626 else if (processing_explicit_instantiation
2627 && cxx_dialect
>= cxx11
)
2628 /* This was allowed in C++98, so only pedwarn. */
2629 pedwarn (loc
, OPT_Wpedantic
, "explicit instantiation of %qD "
2630 "outside its namespace must use a nested-name-"
2635 /* Warn for a template specialization SPEC that is missing some of a set
2636 of function or type attributes that the template TEMPL is declared with.
2637 ATTRLIST is a list of additional attributes that SPEC should be taken
2638 to ultimately be declared with. */
2641 warn_spec_missing_attributes (tree tmpl
, tree spec
, tree attrlist
)
2643 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
2644 tmpl
= DECL_TEMPLATE_RESULT (tmpl
);
2646 if (TREE_CODE (tmpl
) != FUNCTION_DECL
)
2649 /* Avoid warning if either declaration or its type is deprecated. */
2650 if (TREE_DEPRECATED (tmpl
)
2651 || TREE_DEPRECATED (spec
))
2654 tree tmpl_type
= TREE_TYPE (tmpl
);
2655 tree spec_type
= TREE_TYPE (spec
);
2657 if (TREE_DEPRECATED (tmpl_type
)
2658 || TREE_DEPRECATED (spec_type
)
2659 || TREE_DEPRECATED (TREE_TYPE (tmpl_type
))
2660 || TREE_DEPRECATED (TREE_TYPE (spec_type
)))
2663 tree tmpl_attrs
[] = { DECL_ATTRIBUTES (tmpl
), TYPE_ATTRIBUTES (tmpl_type
) };
2664 tree spec_attrs
[] = { DECL_ATTRIBUTES (spec
), TYPE_ATTRIBUTES (spec_type
) };
2667 spec_attrs
[0] = attrlist
;
2668 else if (!spec_attrs
[1])
2669 spec_attrs
[1] = attrlist
;
2671 /* Avoid warning if the primary has no attributes. */
2672 if (!tmpl_attrs
[0] && !tmpl_attrs
[1])
2675 /* Avoid warning if either declaration contains an attribute on
2676 the white list below. */
2677 const char* const whitelist
[] = {
2681 for (unsigned i
= 0; i
!= 2; ++i
)
2682 for (unsigned j
= 0; j
!= sizeof whitelist
/ sizeof *whitelist
; ++j
)
2683 if (lookup_attribute (whitelist
[j
], tmpl_attrs
[i
])
2684 || lookup_attribute (whitelist
[j
], spec_attrs
[i
]))
2687 /* Avoid warning if the difference between the primary and
2688 the specialization is not in one of the attributes below. */
2689 const char* const blacklist
[] = {
2690 "alloc_align", "alloc_size", "assume_aligned", "format",
2691 "format_arg", "malloc", "nonnull"
2694 /* Put together a list of the black listed attributes that the primary
2695 template is declared with that the specialization is not, in case
2696 it's not apparent from the most recent declaration of the primary. */
2697 unsigned nattrs
= 0;
2700 for (unsigned i
= 0; i
!= sizeof blacklist
/ sizeof *blacklist
; ++i
)
2702 for (unsigned j
= 0; j
!= 2; ++j
)
2704 if (!lookup_attribute (blacklist
[i
], tmpl_attrs
[j
]))
2707 for (unsigned k
= 0; k
!= 1 + !!spec_attrs
[1]; ++k
)
2709 if (lookup_attribute (blacklist
[i
], spec_attrs
[k
]))
2713 pp_string (&str
, ", ");
2714 pp_begin_quote (&str
, pp_show_color (global_dc
->printer
));
2715 pp_string (&str
, blacklist
[i
]);
2716 pp_end_quote (&str
, pp_show_color (global_dc
->printer
));
2725 if (warning_at (DECL_SOURCE_LOCATION (spec
), OPT_Wmissing_attributes
,
2726 "explicit specialization %q#D may be missing attributes",
2728 inform (DECL_SOURCE_LOCATION (tmpl
),
2730 ? G_("missing primary template attributes %s")
2731 : G_("missing primary template attribute %s"),
2732 pp_formatted_text (&str
));
2735 /* Check to see if the function just declared, as indicated in
2736 DECLARATOR, and in DECL, is a specialization of a function
2737 template. We may also discover that the declaration is an explicit
2738 instantiation at this point.
2740 Returns DECL, or an equivalent declaration that should be used
2741 instead if all goes well. Issues an error message if something is
2742 amiss. Returns error_mark_node if the error is not easily
2745 FLAGS is a bitmask consisting of the following flags:
2747 2: The function has a definition.
2748 4: The function is a friend.
2750 The TEMPLATE_COUNT is the number of references to qualifying
2751 template classes that appeared in the name of the function. For
2754 template <class T> struct S { void f(); };
2757 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2758 classes are not counted in the TEMPLATE_COUNT, so that in
2760 template <class T> struct S {};
2761 template <> struct S<int> { void f(); }
2762 template <> void S<int>::f();
2764 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2765 invalid; there should be no template <>.)
2767 If the function is a specialization, it is marked as such via
2768 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2769 is set up correctly, and it is added to the list of specializations
2770 for that template. */
2773 check_explicit_specialization (tree declarator
,
2779 int have_def
= flags
& 2;
2780 int is_friend
= flags
& 4;
2781 bool is_concept
= flags
& 8;
2782 int specialization
= 0;
2783 int explicit_instantiation
= 0;
2784 int member_specialization
= 0;
2785 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2786 tree dname
= DECL_NAME (decl
);
2791 if (!processing_specialization
)
2794 tsk
= tsk_excessive_parms
;
2797 tsk
= current_tmpl_spec_kind (template_count
);
2802 if (processing_specialization
&& !VAR_P (decl
))
2805 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2807 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2810 /* This could be something like:
2812 template <class T> void f(T);
2813 class S { friend void f<>(int); } */
2817 /* This case handles bogus declarations like template <>
2818 template <class T> void f<int>(); */
2820 error ("template-id %qD in declaration of primary template",
2827 case tsk_invalid_member_spec
:
2828 /* The error has already been reported in
2829 check_specialization_scope. */
2830 return error_mark_node
;
2832 case tsk_invalid_expl_inst
:
2833 error ("template parameter list used in explicit instantiation");
2839 error ("definition provided for explicit instantiation");
2841 explicit_instantiation
= 1;
2844 case tsk_excessive_parms
:
2845 case tsk_insufficient_parms
:
2846 if (tsk
== tsk_excessive_parms
)
2847 error ("too many template parameter lists in declaration of %qD",
2849 else if (template_header_count
)
2850 error("too few template parameter lists in declaration of %qD", decl
);
2852 error("explicit specialization of %qD must be introduced by "
2853 "%<template <>%>", decl
);
2858 error ("explicit specialization declared %<concept%>");
2860 if (VAR_P (decl
) && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2861 /* In cases like template<> constexpr bool v = true;
2862 We'll give an error in check_template_variable. */
2865 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2867 member_specialization
= 1;
2873 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2875 /* This case handles bogus declarations like template <>
2876 template <class T> void f<int>(); */
2878 if (!uses_template_parms (declarator
))
2879 error ("template-id %qD in declaration of primary template",
2881 else if (variable_template_p (TREE_OPERAND (declarator
, 0)))
2883 /* Partial specialization of variable template. */
2884 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2888 else if (cxx_dialect
< cxx14
)
2889 error ("non-type partial specialization %qD "
2890 "is not allowed", declarator
);
2892 error ("non-class, non-variable partial specialization %qD "
2893 "is not allowed", declarator
);
2898 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2899 /* This is a specialization of a member template, without
2900 specialization the containing class. Something like:
2902 template <class T> struct S {
2903 template <class U> void f (U);
2905 template <> template <class U> void S<int>::f(U) {}
2907 That's a specialization -- but of the entire template. */
2915 if ((specialization
|| member_specialization
)
2916 /* This doesn't apply to variable templates. */
2917 && (TREE_CODE (TREE_TYPE (decl
)) == FUNCTION_TYPE
2918 || TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
))
2920 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2921 for (; t
; t
= TREE_CHAIN (t
))
2922 if (TREE_PURPOSE (t
))
2924 permerror (input_location
,
2925 "default argument specified in explicit specialization");
2930 if (specialization
|| member_specialization
|| explicit_instantiation
)
2932 tree tmpl
= NULL_TREE
;
2933 tree targs
= NULL_TREE
;
2934 bool was_template_id
= (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
);
2936 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2937 if (!was_template_id
)
2941 gcc_assert (identifier_p (declarator
));
2946 /* If there is no class context, the explicit instantiation
2947 must be at namespace scope. */
2948 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2950 /* Find the namespace binding, using the declaration
2952 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2954 if (fns
== error_mark_node
)
2955 /* If lookup fails, look for a friend declaration so we can
2956 give a better diagnostic. */
2957 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2958 /*type*/false, /*complain*/true,
2961 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2963 error ("%qD is not a template function", dname
);
2964 fns
= error_mark_node
;
2968 declarator
= lookup_template_function (fns
, NULL_TREE
);
2971 if (declarator
== error_mark_node
)
2972 return error_mark_node
;
2974 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2976 if (!explicit_instantiation
)
2977 /* A specialization in class scope. This is invalid,
2978 but the error will already have been flagged by
2979 check_specialization_scope. */
2980 return error_mark_node
;
2983 /* It's not valid to write an explicit instantiation in
2986 class C { template void f(); }
2988 This case is caught by the parser. However, on
2991 template class C { void f(); };
2993 (which is invalid) we can get here. The error will be
3000 else if (ctype
!= NULL_TREE
3001 && (identifier_p (TREE_OPERAND (declarator
, 0))))
3003 // We'll match variable templates in start_decl.
3007 /* Find the list of functions in ctype that have the same
3008 name as the declared function. */
3009 tree name
= TREE_OPERAND (declarator
, 0);
3011 if (constructor_name_p (name
, ctype
))
3013 if (DECL_CONSTRUCTOR_P (decl
)
3014 ? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
3015 : !CLASSTYPE_DESTRUCTOR (ctype
))
3017 /* From [temp.expl.spec]:
3019 If such an explicit specialization for the member
3020 of a class template names an implicitly-declared
3021 special member function (clause _special_), the
3022 program is ill-formed.
3024 Similar language is found in [temp.explicit]. */
3025 error ("specialization of implicitly-declared special member function");
3026 return error_mark_node
;
3029 name
= DECL_NAME (decl
);
3032 /* For a type-conversion operator, We might be looking for
3033 `operator int' which will be a specialization of
3034 `operator T'. Grab all the conversion operators, and
3035 then select from them. */
3036 tree fns
= get_class_binding (ctype
, IDENTIFIER_CONV_OP_P (name
)
3037 ? conv_op_identifier
: name
);
3039 if (fns
== NULL_TREE
)
3041 error ("no member function %qD declared in %qT", name
, ctype
);
3042 return error_mark_node
;
3045 TREE_OPERAND (declarator
, 0) = fns
;
3048 /* Figure out what exactly is being specialized at this point.
3049 Note that for an explicit instantiation, even one for a
3050 member function, we cannot tell a priori whether the
3051 instantiation is for a member template, or just a member
3052 function of a template class. Even if a member template is
3053 being instantiated, the member template arguments may be
3054 elided if they can be deduced from the rest of the
3056 tmpl
= determine_specialization (declarator
, decl
,
3058 member_specialization
,
3062 if (!tmpl
|| tmpl
== error_mark_node
)
3063 /* We couldn't figure out what this declaration was
3065 return error_mark_node
;
3068 if (TREE_CODE (decl
) == FUNCTION_DECL
3069 && DECL_HIDDEN_FRIEND_P (tmpl
))
3071 if (pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
3072 "friend declaration %qD is not visible to "
3073 "explicit specialization", tmpl
))
3074 inform (DECL_SOURCE_LOCATION (tmpl
),
3075 "friend declaration here");
3077 else if (!ctype
&& !is_friend
3078 && CP_DECL_CONTEXT (decl
) == current_namespace
)
3079 check_unqualified_spec_or_inst (tmpl
, DECL_SOURCE_LOCATION (decl
));
3081 tree gen_tmpl
= most_general_template (tmpl
);
3083 if (explicit_instantiation
)
3085 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
3086 is done by do_decl_instantiation later. */
3088 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
3089 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
3091 if (arg_depth
> parm_depth
)
3093 /* If TMPL is not the most general template (for
3094 example, if TMPL is a friend template that is
3095 injected into namespace scope), then there will
3096 be too many levels of TARGS. Remove some of them
3101 new_targs
= make_tree_vec (parm_depth
);
3102 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
3103 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
3104 = TREE_VEC_ELT (targs
, i
);
3108 return instantiate_template (tmpl
, targs
, tf_error
);
3111 /* If we thought that the DECL was a member function, but it
3112 turns out to be specializing a static member function,
3113 make DECL a static member function as well. */
3114 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
3115 && DECL_STATIC_FUNCTION_P (tmpl
)
3116 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
3117 revert_static_member_fn (decl
);
3119 /* If this is a specialization of a member template of a
3120 template class, we want to return the TEMPLATE_DECL, not
3121 the specialization of it. */
3122 if (tsk
== tsk_template
&& !was_template_id
)
3124 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
3125 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
3126 DECL_INITIAL (result
) = NULL_TREE
;
3130 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
3131 DECL_SOURCE_LOCATION (result
)
3132 = DECL_SOURCE_LOCATION (decl
);
3133 /* We want to use the argument list specified in the
3134 definition, not in the original declaration. */
3135 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
3136 for (parm
= DECL_ARGUMENTS (result
); parm
;
3137 parm
= DECL_CHAIN (parm
))
3138 DECL_CONTEXT (parm
) = result
;
3140 return register_specialization (tmpl
, gen_tmpl
, targs
,
3144 /* Set up the DECL_TEMPLATE_INFO for DECL. */
3145 DECL_TEMPLATE_INFO (decl
) = build_template_info (tmpl
, targs
);
3147 if (was_template_id
)
3148 TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
)) = true;
3150 /* Inherit default function arguments from the template
3151 DECL is specializing. */
3152 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
3153 copy_default_args_to_explicit_spec (decl
);
3155 /* This specialization has the same protection as the
3156 template it specializes. */
3157 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
3158 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
3160 /* 7.1.1-1 [dcl.stc]
3162 A storage-class-specifier shall not be specified in an
3163 explicit specialization...
3165 The parser rejects these, so unless action is taken here,
3166 explicit function specializations will always appear with
3169 The action recommended by the C++ CWG in response to C++
3170 defect report 605 is to make the storage class and linkage
3171 of the explicit specialization match the templated function:
3173 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
3175 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
3177 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
3178 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
3180 /* A concept cannot be specialized. */
3181 if (DECL_DECLARED_CONCEPT_P (tmpl_func
))
3183 error ("explicit specialization of function concept %qD",
3185 return error_mark_node
;
3188 /* This specialization has the same linkage and visibility as
3189 the function template it specializes. */
3190 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
3191 if (! TREE_PUBLIC (decl
))
3193 DECL_INTERFACE_KNOWN (decl
) = 1;
3194 DECL_NOT_REALLY_EXTERN (decl
) = 1;
3196 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
3197 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
3199 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
3200 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
3204 /* If DECL is a friend declaration, declared using an
3205 unqualified name, the namespace associated with DECL may
3206 have been set incorrectly. For example, in:
3208 template <typename T> void f(T);
3210 struct S { friend void f<int>(int); }
3213 we will have set the DECL_CONTEXT for the friend
3214 declaration to N, rather than to the global namespace. */
3215 if (DECL_NAMESPACE_SCOPE_P (decl
))
3216 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
3218 if (is_friend
&& !have_def
)
3219 /* This is not really a declaration of a specialization.
3220 It's just the name of an instantiation. But, it's not
3221 a request for an instantiation, either. */
3222 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
3223 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
3224 /* A specialization is not necessarily COMDAT. */
3225 DECL_COMDAT (decl
) = (TREE_PUBLIC (decl
)
3226 && DECL_DECLARED_INLINE_P (decl
));
3227 else if (VAR_P (decl
))
3228 DECL_COMDAT (decl
) = false;
3230 /* If this is a full specialization, register it so that we can find
3231 it again. Partial specializations will be registered in
3232 process_partial_specialization. */
3233 if (!processing_template_decl
)
3235 warn_spec_missing_attributes (gen_tmpl
, decl
, attrlist
);
3237 decl
= register_specialization (decl
, gen_tmpl
, targs
,
3242 /* A 'structor should already have clones. */
3243 gcc_assert (decl
== error_mark_node
3244 || variable_template_p (tmpl
)
3245 || !(DECL_CONSTRUCTOR_P (decl
)
3246 || DECL_DESTRUCTOR_P (decl
))
3247 || DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)));
3254 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
3255 parameters. These are represented in the same format used for
3256 DECL_TEMPLATE_PARMS. */
3259 comp_template_parms (const_tree parms1
, const_tree parms2
)
3264 if (parms1
== parms2
)
3267 for (p1
= parms1
, p2
= parms2
;
3268 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
3269 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
3271 tree t1
= TREE_VALUE (p1
);
3272 tree t2
= TREE_VALUE (p2
);
3275 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
3276 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
3278 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
3281 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
3283 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
3284 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
3286 /* If either of the template parameters are invalid, assume
3287 they match for the sake of error recovery. */
3288 if (error_operand_p (parm1
) || error_operand_p (parm2
))
3291 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
3294 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
3295 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
3296 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
3298 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
3303 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
3304 /* One set of parameters has more parameters lists than the
3311 /* Determine whether PARM is a parameter pack. */
3314 template_parameter_pack_p (const_tree parm
)
3316 /* Determine if we have a non-type template parameter pack. */
3317 if (TREE_CODE (parm
) == PARM_DECL
)
3318 return (DECL_TEMPLATE_PARM_P (parm
)
3319 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
3320 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
3321 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
3323 /* If this is a list of template parameters, we could get a
3324 TYPE_DECL or a TEMPLATE_DECL. */
3325 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
3326 parm
= TREE_TYPE (parm
);
3328 /* Otherwise it must be a type template parameter. */
3329 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
3330 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
3331 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
3334 /* Determine if T is a function parameter pack. */
3337 function_parameter_pack_p (const_tree t
)
3339 if (t
&& TREE_CODE (t
) == PARM_DECL
)
3340 return DECL_PACK_P (t
);
3344 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
3345 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
3348 get_function_template_decl (const_tree primary_func_tmpl_inst
)
3350 if (! primary_func_tmpl_inst
3351 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
3352 || ! primary_template_specialization_p (primary_func_tmpl_inst
))
3355 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
3358 /* Return true iff the function parameter PARAM_DECL was expanded
3359 from the function parameter pack PACK. */
3362 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
3364 if (DECL_ARTIFICIAL (param_decl
)
3365 || !function_parameter_pack_p (pack
))
3368 /* The parameter pack and its pack arguments have the same
3370 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
3373 /* Determine whether ARGS describes a variadic template args list,
3374 i.e., one that is terminated by a template argument pack. */
3377 template_args_variadic_p (tree args
)
3382 if (args
== NULL_TREE
)
3385 args
= INNERMOST_TEMPLATE_ARGS (args
);
3386 nargs
= TREE_VEC_LENGTH (args
);
3391 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
3393 return ARGUMENT_PACK_P (last_parm
);
3396 /* Generate a new name for the parameter pack name NAME (an
3397 IDENTIFIER_NODE) that incorporates its */
3400 make_ith_pack_parameter_name (tree name
, int i
)
3402 /* Munge the name to include the parameter index. */
3403 #define NUMBUF_LEN 128
3404 char numbuf
[NUMBUF_LEN
];
3408 if (name
== NULL_TREE
)
3410 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
3411 newname_len
= IDENTIFIER_LENGTH (name
)
3412 + strlen (numbuf
) + 2;
3413 newname
= (char*)alloca (newname_len
);
3414 snprintf (newname
, newname_len
,
3415 "%s#%i", IDENTIFIER_POINTER (name
), i
);
3416 return get_identifier (newname
);
3419 /* Return true if T is a primary function, class or alias template
3420 specialization, not including the template pattern. */
3423 primary_template_specialization_p (const_tree t
)
3428 if (TREE_CODE (t
) == FUNCTION_DECL
|| VAR_P (t
))
3429 return (DECL_LANG_SPECIFIC (t
)
3430 && DECL_USE_TEMPLATE (t
)
3431 && DECL_TEMPLATE_INFO (t
)
3432 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
)));
3433 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
3434 return (CLASSTYPE_TEMPLATE_INFO (t
)
3435 && CLASSTYPE_USE_TEMPLATE (t
)
3436 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
)));
3437 else if (alias_template_specialization_p (t
))
3442 /* Return true if PARM is a template template parameter. */
3445 template_template_parameter_p (const_tree parm
)
3447 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
3450 /* Return true iff PARM is a DECL representing a type template
3454 template_type_parameter_p (const_tree parm
)
3457 && (TREE_CODE (parm
) == TYPE_DECL
3458 || TREE_CODE (parm
) == TEMPLATE_DECL
)
3459 && DECL_TEMPLATE_PARM_P (parm
));
3462 /* Return the template parameters of T if T is a
3463 primary template instantiation, NULL otherwise. */
3466 get_primary_template_innermost_parameters (const_tree t
)
3468 tree parms
= NULL
, template_info
= NULL
;
3470 if ((template_info
= get_template_info (t
))
3471 && primary_template_specialization_p (t
))
3472 parms
= INNERMOST_TEMPLATE_PARMS
3473 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
3478 /* Return the template parameters of the LEVELth level from the full list
3479 of template parameters PARMS. */
3482 get_template_parms_at_level (tree parms
, int level
)
3486 || TREE_CODE (parms
) != TREE_LIST
3487 || level
> TMPL_PARMS_DEPTH (parms
))
3490 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
3491 if (TMPL_PARMS_DEPTH (p
) == level
)
3497 /* Returns the template arguments of T if T is a template instantiation,
3501 get_template_innermost_arguments (const_tree t
)
3503 tree args
= NULL
, template_info
= NULL
;
3505 if ((template_info
= get_template_info (t
))
3506 && TI_ARGS (template_info
))
3507 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
3512 /* Return the argument pack elements of T if T is a template argument pack,
3516 get_template_argument_pack_elems (const_tree t
)
3518 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
3519 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
3522 return ARGUMENT_PACK_ARGS (t
);
3525 /* In an ARGUMENT_PACK_SELECT, the actual underlying argument that the
3526 ARGUMENT_PACK_SELECT represents. */
3529 argument_pack_select_arg (tree t
)
3531 tree args
= ARGUMENT_PACK_ARGS (ARGUMENT_PACK_SELECT_FROM_PACK (t
));
3532 tree arg
= TREE_VEC_ELT (args
, ARGUMENT_PACK_SELECT_INDEX (t
));
3534 /* If the selected argument is an expansion E, that most likely means we were
3535 called from gen_elem_of_pack_expansion_instantiation during the
3536 substituting of an argument pack (of which the Ith element is a pack
3537 expansion, where I is ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
3538 In this case, the Ith element resulting from this substituting is going to
3539 be a pack expansion, which pattern is the pattern of E. Let's return the
3540 pattern of E, and gen_elem_of_pack_expansion_instantiation will build the
3541 resulting pack expansion from it. */
3542 if (PACK_EXPANSION_P (arg
))
3544 /* Make sure we aren't throwing away arg info. */
3545 gcc_assert (!PACK_EXPANSION_EXTRA_ARGS (arg
));
3546 arg
= PACK_EXPANSION_PATTERN (arg
);
3553 /* True iff FN is a function representing a built-in variadic parameter
3557 builtin_pack_fn_p (tree fn
)
3560 || TREE_CODE (fn
) != FUNCTION_DECL
3561 || !DECL_IS_BUILTIN (fn
))
3564 if (id_equal (DECL_NAME (fn
), "__integer_pack"))
3570 /* True iff CALL is a call to a function representing a built-in variadic
3574 builtin_pack_call_p (tree call
)
3576 if (TREE_CODE (call
) != CALL_EXPR
)
3578 return builtin_pack_fn_p (CALL_EXPR_FN (call
));
3581 /* Return a TREE_VEC for the expansion of __integer_pack(HI). */
3584 expand_integer_pack (tree call
, tree args
, tsubst_flags_t complain
,
3587 tree ohi
= CALL_EXPR_ARG (call
, 0);
3588 tree hi
= tsubst_copy_and_build (ohi
, args
, complain
, in_decl
,
3589 false/*fn*/, true/*int_cst*/);
3591 if (value_dependent_expression_p (hi
))
3595 call
= copy_node (call
);
3596 CALL_EXPR_ARG (call
, 0) = hi
;
3598 tree ex
= make_pack_expansion (call
, complain
);
3599 tree vec
= make_tree_vec (1);
3600 TREE_VEC_ELT (vec
, 0) = ex
;
3605 hi
= cxx_constant_value (hi
);
3606 int len
= valid_constant_size_p (hi
) ? tree_to_shwi (hi
) : -1;
3608 /* Calculate the largest value of len that won't make the size of the vec
3609 overflow an int. The compiler will exceed resource limits long before
3610 this, but it seems a decent place to diagnose. */
3611 int max
= ((INT_MAX
- sizeof (tree_vec
)) / sizeof (tree
)) + 1;
3613 if (len
< 0 || len
> max
)
3615 if ((complain
& tf_error
)
3616 && hi
!= error_mark_node
)
3617 error ("argument to __integer_pack must be between 0 and %d", max
);
3618 return error_mark_node
;
3621 tree vec
= make_tree_vec (len
);
3623 for (int i
= 0; i
< len
; ++i
)
3624 TREE_VEC_ELT (vec
, i
) = size_int (i
);
3630 /* Return a TREE_VEC for the expansion of built-in template parameter pack
3634 expand_builtin_pack_call (tree call
, tree args
, tsubst_flags_t complain
,
3637 if (!builtin_pack_call_p (call
))
3640 tree fn
= CALL_EXPR_FN (call
);
3642 if (id_equal (DECL_NAME (fn
), "__integer_pack"))
3643 return expand_integer_pack (call
, args
, complain
, in_decl
);
3648 /* Structure used to track the progress of find_parameter_packs_r. */
3649 struct find_parameter_pack_data
3651 /* TREE_LIST that will contain all of the parameter packs found by
3653 tree
* parameter_packs
;
3655 /* Set of AST nodes that have been visited by the traversal. */
3656 hash_set
<tree
> *visited
;
3658 /* True iff we're making a type pack expansion. */
3659 bool type_pack_expansion_p
;
3662 /* Identifies all of the argument packs that occur in a template
3663 argument and appends them to the TREE_LIST inside DATA, which is a
3664 find_parameter_pack_data structure. This is a subroutine of
3665 make_pack_expansion and uses_parameter_packs. */
3667 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3670 struct find_parameter_pack_data
* ppd
=
3671 (struct find_parameter_pack_data
*)data
;
3672 bool parameter_pack_p
= false;
3674 /* Handle type aliases/typedefs. */
3675 if (TYPE_ALIAS_P (t
))
3677 if (tree tinfo
= TYPE_ALIAS_TEMPLATE_INFO (t
))
3678 cp_walk_tree (&TI_ARGS (tinfo
),
3679 &find_parameter_packs_r
,
3685 /* Identify whether this is a parameter pack or not. */
3686 switch (TREE_CODE (t
))
3688 case TEMPLATE_PARM_INDEX
:
3689 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3690 parameter_pack_p
= true;
3693 case TEMPLATE_TYPE_PARM
:
3694 t
= TYPE_MAIN_VARIANT (t
);
3696 case TEMPLATE_TEMPLATE_PARM
:
3697 /* If the placeholder appears in the decl-specifier-seq of a function
3698 parameter pack (14.6.3), or the type-specifier-seq of a type-id that
3699 is a pack expansion, the invented template parameter is a template
3701 if (ppd
->type_pack_expansion_p
&& is_auto (t
))
3702 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
3703 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3704 parameter_pack_p
= true;
3709 if (DECL_PACK_P (t
))
3711 /* We don't want to walk into the type of a PARM_DECL,
3712 because we don't want to see the type parameter pack. */
3714 parameter_pack_p
= true;
3719 if (DECL_PACK_P (t
))
3721 /* We don't want to walk into the type of a variadic capture proxy,
3722 because we don't want to see the type parameter pack. */
3724 parameter_pack_p
= true;
3726 else if (variable_template_specialization_p (t
))
3728 cp_walk_tree (&DECL_TI_ARGS (t
),
3729 find_parameter_packs_r
,
3736 if (builtin_pack_call_p (t
))
3737 parameter_pack_p
= true;
3741 parameter_pack_p
= true;
3744 /* Not a parameter pack. */
3748 if (parameter_pack_p
)
3750 /* Add this parameter pack to the list. */
3751 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3755 cp_walk_tree (&TYPE_CONTEXT (t
),
3756 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3758 /* This switch statement will return immediately if we don't find a
3760 switch (TREE_CODE (t
))
3762 case TEMPLATE_PARM_INDEX
:
3765 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3766 /* Check the template itself. */
3767 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3768 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3769 /* Check the template arguments. */
3770 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3775 case TEMPLATE_TYPE_PARM
:
3776 case TEMPLATE_TEMPLATE_PARM
:
3783 /* Ignore the declaration of a capture proxy for a parameter pack. */
3784 if (is_capture_proxy (DECL_EXPR_DECL (t
)))
3789 if (TYPE_PTRMEMFUNC_P (t
))
3795 if (TYPE_TEMPLATE_INFO (t
))
3796 cp_walk_tree (&TYPE_TI_ARGS (t
),
3797 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3803 if (!DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
3808 cp_walk_tree (&TREE_TYPE (t
),
3809 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3813 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3818 case TYPE_PACK_EXPANSION
:
3819 case EXPR_PACK_EXPANSION
:
3824 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3829 case IDENTIFIER_NODE
:
3830 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3837 /* Look at explicit captures. */
3838 for (tree cap
= LAMBDA_EXPR_CAPTURE_LIST (t
);
3839 cap
; cap
= TREE_CHAIN (cap
))
3840 cp_walk_tree (&TREE_VALUE (cap
), &find_parameter_packs_r
, ppd
,
3842 /* Since we defer implicit capture, look in the body as well. */
3843 tree fn
= lambda_function (t
);
3844 cp_walk_tree (&DECL_SAVED_TREE (fn
), &find_parameter_packs_r
, ppd
,
3852 /* When traversing a DECLTYPE_TYPE_EXPR, we need to set
3853 type_pack_expansion_p to false so that any placeholders
3854 within the expression don't get marked as parameter packs. */
3855 bool type_pack_expansion_p
= ppd
->type_pack_expansion_p
;
3856 ppd
->type_pack_expansion_p
= false;
3857 cp_walk_tree (&DECLTYPE_TYPE_EXPR (t
), &find_parameter_packs_r
,
3859 ppd
->type_pack_expansion_p
= type_pack_expansion_p
;
3871 /* Determines if the expression or type T uses any parameter packs. */
3873 uses_parameter_packs (tree t
)
3875 tree parameter_packs
= NULL_TREE
;
3876 struct find_parameter_pack_data ppd
;
3877 ppd
.parameter_packs
= ¶meter_packs
;
3878 ppd
.visited
= new hash_set
<tree
>;
3879 ppd
.type_pack_expansion_p
= false;
3880 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3882 return parameter_packs
!= NULL_TREE
;
3885 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3886 representation a base-class initializer into a parameter pack
3887 expansion. If all goes well, the resulting node will be an
3888 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3891 make_pack_expansion (tree arg
, tsubst_flags_t complain
)
3894 tree parameter_packs
= NULL_TREE
;
3895 bool for_types
= false;
3896 struct find_parameter_pack_data ppd
;
3898 if (!arg
|| arg
== error_mark_node
)
3901 if (TREE_CODE (arg
) == TREE_LIST
&& TREE_PURPOSE (arg
))
3903 /* A TREE_LIST with a non-null TREE_PURPOSE is for a base
3904 class initializer. In this case, the TREE_PURPOSE will be a
3905 _TYPE node (representing the base class expansion we're
3906 initializing) and the TREE_VALUE will be a TREE_LIST
3907 containing the initialization arguments.
3909 The resulting expansion looks somewhat different from most
3910 expansions. Rather than returning just one _EXPANSION, we
3911 return a TREE_LIST whose TREE_PURPOSE is a
3912 TYPE_PACK_EXPANSION containing the bases that will be
3913 initialized. The TREE_VALUE will be identical to the
3914 original TREE_VALUE, which is a list of arguments that will
3915 be passed to each base. We do not introduce any new pack
3916 expansion nodes into the TREE_VALUE (although it is possible
3917 that some already exist), because the TREE_PURPOSE and
3918 TREE_VALUE all need to be expanded together with the same
3919 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3920 resulting TREE_PURPOSE will mention the parameter packs in
3921 both the bases and the arguments to the bases. */
3924 tree parameter_packs
= NULL_TREE
;
3926 /* Determine which parameter packs will be used by the base
3928 ppd
.visited
= new hash_set
<tree
>;
3929 ppd
.parameter_packs
= ¶meter_packs
;
3930 ppd
.type_pack_expansion_p
= true;
3931 gcc_assert (TYPE_P (TREE_PURPOSE (arg
)));
3932 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3935 if (parameter_packs
== NULL_TREE
)
3937 if (complain
& tf_error
)
3938 error ("base initializer expansion %qT contains no parameter packs",
3941 return error_mark_node
;
3944 if (TREE_VALUE (arg
) != void_type_node
)
3946 /* Collect the sets of parameter packs used in each of the
3947 initialization arguments. */
3948 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3950 /* Determine which parameter packs will be expanded in this
3952 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3959 /* Create the pack expansion type for the base type. */
3960 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3961 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3962 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3963 PACK_EXPANSION_LOCAL_P (purpose
) = at_function_scope_p ();
3965 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3966 they will rarely be compared to anything. */
3967 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3969 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3972 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3975 /* Build the PACK_EXPANSION_* node. */
3977 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3978 : make_node (EXPR_PACK_EXPANSION
);
3979 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3980 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3982 /* Propagate type and const-expression information. */
3983 TREE_TYPE (result
) = TREE_TYPE (arg
);
3984 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3985 /* Mark this read now, since the expansion might be length 0. */
3986 mark_exp_read (arg
);
3989 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3990 they will rarely be compared to anything. */
3991 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3993 /* Determine which parameter packs will be expanded. */
3994 ppd
.parameter_packs
= ¶meter_packs
;
3995 ppd
.visited
= new hash_set
<tree
>;
3996 ppd
.type_pack_expansion_p
= TYPE_P (arg
);
3997 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
4000 /* Make sure we found some parameter packs. */
4001 if (parameter_packs
== NULL_TREE
)
4003 if (complain
& tf_error
)
4006 error ("expansion pattern %qT contains no parameter packs", arg
);
4008 error ("expansion pattern %qE contains no parameter packs", arg
);
4010 return error_mark_node
;
4012 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
4014 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
4019 /* Checks T for any "bare" parameter packs, which have not yet been
4020 expanded, and issues an error if any are found. This operation can
4021 only be done on full expressions or types (e.g., an expression
4022 statement, "if" condition, etc.), because we could have expressions like:
4024 foo(f(g(h(args)))...)
4026 where "args" is a parameter pack. check_for_bare_parameter_packs
4027 should not be called for the subexpressions args, h(args),
4028 g(h(args)), or f(g(h(args))), because we would produce erroneous
4031 Returns TRUE and emits an error if there were bare parameter packs,
4032 returns FALSE otherwise. */
4034 check_for_bare_parameter_packs (tree t
)
4036 tree parameter_packs
= NULL_TREE
;
4037 struct find_parameter_pack_data ppd
;
4039 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
4042 /* A lambda might use a parameter pack from the containing context. */
4043 if (current_class_type
&& LAMBDA_TYPE_P (current_class_type
)
4044 && CLASSTYPE_TEMPLATE_INFO (current_class_type
))
4047 if (TREE_CODE (t
) == TYPE_DECL
)
4050 ppd
.parameter_packs
= ¶meter_packs
;
4051 ppd
.visited
= new hash_set
<tree
>;
4052 ppd
.type_pack_expansion_p
= false;
4053 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
4056 if (parameter_packs
)
4058 location_t loc
= EXPR_LOC_OR_LOC (t
, input_location
);
4059 error_at (loc
, "parameter packs not expanded with %<...%>:");
4060 while (parameter_packs
)
4062 tree pack
= TREE_VALUE (parameter_packs
);
4063 tree name
= NULL_TREE
;
4065 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
4066 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
4067 name
= TYPE_NAME (pack
);
4068 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
4069 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
4070 else if (TREE_CODE (pack
) == CALL_EXPR
)
4071 name
= DECL_NAME (CALL_EXPR_FN (pack
));
4073 name
= DECL_NAME (pack
);
4076 inform (loc
, " %qD", name
);
4078 inform (loc
, " <anonymous>");
4080 parameter_packs
= TREE_CHAIN (parameter_packs
);
4089 /* Expand any parameter packs that occur in the template arguments in
4092 expand_template_argument_pack (tree args
)
4094 if (args
== error_mark_node
)
4095 return error_mark_node
;
4097 tree result_args
= NULL_TREE
;
4098 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
4099 int num_result_args
= -1;
4100 int non_default_args_count
= -1;
4102 /* First, determine if we need to expand anything, and the number of
4103 slots we'll need. */
4104 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
4106 tree arg
= TREE_VEC_ELT (args
, in_arg
);
4107 if (arg
== NULL_TREE
)
4109 if (ARGUMENT_PACK_P (arg
))
4111 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
4112 if (num_result_args
< 0)
4113 num_result_args
= in_arg
+ num_packed
;
4115 num_result_args
+= num_packed
;
4119 if (num_result_args
>= 0)
4124 /* If no expansion is necessary, we're done. */
4125 if (num_result_args
< 0)
4128 /* Expand arguments. */
4129 result_args
= make_tree_vec (num_result_args
);
4130 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
4131 non_default_args_count
=
4132 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
4133 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
4135 tree arg
= TREE_VEC_ELT (args
, in_arg
);
4136 if (ARGUMENT_PACK_P (arg
))
4138 tree packed
= ARGUMENT_PACK_ARGS (arg
);
4139 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
4140 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
4141 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
4142 if (non_default_args_count
> 0)
4143 non_default_args_count
+= num_packed
- 1;
4147 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
4151 if (non_default_args_count
>= 0)
4152 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
4156 /* Checks if DECL shadows a template parameter.
4158 [temp.local]: A template-parameter shall not be redeclared within its
4159 scope (including nested scopes).
4161 Emits an error and returns TRUE if the DECL shadows a parameter,
4162 returns FALSE otherwise. */
4165 check_template_shadow (tree decl
)
4169 /* If we're not in a template, we can't possibly shadow a template
4171 if (!current_template_parms
)
4174 /* Figure out what we're shadowing. */
4175 decl
= OVL_FIRST (decl
);
4176 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
4178 /* If there's no previous binding for this name, we're not shadowing
4179 anything, let alone a template parameter. */
4183 /* If we're not shadowing a template parameter, we're done. Note
4184 that OLDDECL might be an OVERLOAD (or perhaps even an
4185 ERROR_MARK), so we can't just blithely assume it to be a _DECL
4187 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
4190 /* We check for decl != olddecl to avoid bogus errors for using a
4191 name inside a class. We check TPFI to avoid duplicate errors for
4192 inline member templates. */
4194 || (DECL_TEMPLATE_PARM_P (decl
)
4195 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
)))
4198 /* Don't complain about the injected class name, as we've already
4199 complained about the class itself. */
4200 if (DECL_SELF_REFERENCE_P (decl
))
4203 if (DECL_TEMPLATE_PARM_P (decl
))
4204 error ("declaration of template parameter %q+D shadows "
4205 "template parameter", decl
);
4207 error ("declaration of %q+#D shadows template parameter", decl
);
4208 inform (DECL_SOURCE_LOCATION (olddecl
),
4209 "template parameter %qD declared here", olddecl
);
4213 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
4214 ORIG_LEVEL, DECL, and TYPE. */
4217 build_template_parm_index (int index
,
4223 tree t
= make_node (TEMPLATE_PARM_INDEX
);
4224 TEMPLATE_PARM_IDX (t
) = index
;
4225 TEMPLATE_PARM_LEVEL (t
) = level
;
4226 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
4227 TEMPLATE_PARM_DECL (t
) = decl
;
4228 TREE_TYPE (t
) = type
;
4229 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
4230 TREE_READONLY (t
) = TREE_READONLY (decl
);
4235 /* Find the canonical type parameter for the given template type
4236 parameter. Returns the canonical type parameter, which may be TYPE
4237 if no such parameter existed. */
4240 canonical_type_parameter (tree type
)
4243 int idx
= TEMPLATE_TYPE_IDX (type
);
4244 if (!canonical_template_parms
)
4245 vec_alloc (canonical_template_parms
, idx
+ 1);
4247 if (canonical_template_parms
->length () <= (unsigned) idx
)
4248 vec_safe_grow_cleared (canonical_template_parms
, idx
+ 1);
4250 list
= (*canonical_template_parms
)[idx
];
4251 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
4252 list
= TREE_CHAIN (list
);
4255 return TREE_VALUE (list
);
4258 (*canonical_template_parms
)[idx
]
4259 = tree_cons (NULL_TREE
, type
, (*canonical_template_parms
)[idx
]);
4264 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
4265 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
4266 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
4267 new one is created. */
4270 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
4271 tsubst_flags_t complain
)
4273 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
4274 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
4275 != TEMPLATE_PARM_LEVEL (index
) - levels
)
4276 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
4278 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
4281 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
4282 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
4283 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
4284 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
4285 DECL_ARTIFICIAL (decl
) = 1;
4286 SET_DECL_TEMPLATE_PARM_P (decl
);
4288 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
4289 TEMPLATE_PARM_LEVEL (index
) - levels
,
4290 TEMPLATE_PARM_ORIG_LEVEL (index
),
4292 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
4293 TEMPLATE_PARM_PARAMETER_PACK (t
)
4294 = TEMPLATE_PARM_PARAMETER_PACK (index
);
4296 /* Template template parameters need this. */
4297 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4299 DECL_TEMPLATE_RESULT (decl
)
4300 = build_decl (DECL_SOURCE_LOCATION (decl
),
4301 TYPE_DECL
, DECL_NAME (decl
), type
);
4302 DECL_ARTIFICIAL (DECL_TEMPLATE_RESULT (decl
)) = true;
4303 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
4304 (DECL_TEMPLATE_PARMS (orig_decl
), args
, complain
);
4308 return TEMPLATE_PARM_DESCENDANTS (index
);
4311 /* Process information from new template parameter PARM and append it
4312 to the LIST being built. This new parameter is a non-type
4313 parameter iff IS_NON_TYPE is true. This new parameter is a
4314 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
4318 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
4319 bool is_non_type
, bool is_parameter_pack
)
4324 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
4325 tree defval
= TREE_PURPOSE (parm
);
4326 tree constr
= TREE_TYPE (parm
);
4330 tree p
= tree_last (list
);
4332 if (p
&& TREE_VALUE (p
) != error_mark_node
)
4335 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
4336 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
4338 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
4346 parm
= TREE_VALUE (parm
);
4348 SET_DECL_TEMPLATE_PARM_P (parm
);
4350 if (TREE_TYPE (parm
) != error_mark_node
)
4354 The top-level cv-qualifiers on the template-parameter are
4355 ignored when determining its type. */
4356 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
4357 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
4358 TREE_TYPE (parm
) = error_mark_node
;
4359 else if (uses_parameter_packs (TREE_TYPE (parm
))
4360 && !is_parameter_pack
4361 /* If we're in a nested template parameter list, the template
4362 template parameter could be a parameter pack. */
4363 && processing_template_parmlist
== 1)
4365 /* This template parameter is not a parameter pack, but it
4366 should be. Complain about "bare" parameter packs. */
4367 check_for_bare_parameter_packs (TREE_TYPE (parm
));
4369 /* Recover by calling this a parameter pack. */
4370 is_parameter_pack
= true;
4374 /* A template parameter is not modifiable. */
4375 TREE_CONSTANT (parm
) = 1;
4376 TREE_READONLY (parm
) = 1;
4377 decl
= build_decl (parm_loc
,
4378 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
4379 TREE_CONSTANT (decl
) = 1;
4380 TREE_READONLY (decl
) = 1;
4381 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
4382 = build_template_parm_index (idx
, processing_template_decl
,
4383 processing_template_decl
,
4384 decl
, TREE_TYPE (parm
));
4386 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
4387 = is_parameter_pack
;
4392 parm
= TREE_VALUE (TREE_VALUE (parm
));
4394 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
4396 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
4397 /* This is for distinguishing between real templates and template
4398 template parameters */
4399 TREE_TYPE (parm
) = t
;
4400 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
4405 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
4406 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
4407 decl
= build_decl (parm_loc
,
4408 TYPE_DECL
, parm
, t
);
4411 TYPE_NAME (t
) = decl
;
4412 TYPE_STUB_DECL (t
) = decl
;
4414 TEMPLATE_TYPE_PARM_INDEX (t
)
4415 = build_template_parm_index (idx
, processing_template_decl
,
4416 processing_template_decl
,
4417 decl
, TREE_TYPE (parm
));
4418 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
4419 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
4421 DECL_ARTIFICIAL (decl
) = 1;
4422 SET_DECL_TEMPLATE_PARM_P (decl
);
4424 /* Build requirements for the type/template parameter.
4425 This must be done after SET_DECL_TEMPLATE_PARM_P or
4426 process_template_parm could fail. */
4427 tree reqs
= finish_shorthand_constraint (parm
, constr
);
4431 if (defval
&& TREE_CODE (defval
) == OVERLOAD
)
4432 lookup_keep (defval
, true);
4434 /* Build the parameter node linking the parameter declaration,
4435 its default argument (if any), and its constraints (if any). */
4436 parm
= build_tree_list (defval
, parm
);
4437 TEMPLATE_PARM_CONSTRAINTS (parm
) = reqs
;
4439 return chainon (list
, parm
);
4442 /* The end of a template parameter list has been reached. Process the
4443 tree list into a parameter vector, converting each parameter into a more
4444 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
4448 end_template_parm_list (tree parms
)
4452 tree saved_parmlist
= make_tree_vec (list_length (parms
));
4454 /* Pop the dummy parameter level and add the real one. */
4455 current_template_parms
= TREE_CHAIN (current_template_parms
);
4457 current_template_parms
4458 = tree_cons (size_int (processing_template_decl
),
4459 saved_parmlist
, current_template_parms
);
4461 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
4463 next
= TREE_CHAIN (parm
);
4464 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
4465 TREE_CHAIN (parm
) = NULL_TREE
;
4468 --processing_template_parmlist
;
4470 return saved_parmlist
;
4473 // Explicitly indicate the end of the template parameter list. We assume
4474 // that the current template parameters have been constructed and/or
4475 // managed explicitly, as when creating new template template parameters
4476 // from a shorthand constraint.
4478 end_template_parm_list ()
4480 --processing_template_parmlist
;
4483 /* end_template_decl is called after a template declaration is seen. */
4486 end_template_decl (void)
4488 reset_specialization ();
4490 if (! processing_template_decl
)
4493 /* This matches the pushlevel in begin_template_parm_list. */
4496 --processing_template_decl
;
4497 current_template_parms
= TREE_CHAIN (current_template_parms
);
4500 /* Takes a TREE_LIST representing a template parameter and convert it
4501 into an argument suitable to be passed to the type substitution
4502 functions. Note that If the TREE_LIST contains an error_mark
4503 node, the returned argument is error_mark_node. */
4506 template_parm_to_arg (tree t
)
4510 || TREE_CODE (t
) != TREE_LIST
)
4513 if (error_operand_p (TREE_VALUE (t
)))
4514 return error_mark_node
;
4518 if (TREE_CODE (t
) == TYPE_DECL
4519 || TREE_CODE (t
) == TEMPLATE_DECL
)
4523 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
4525 /* Turn this argument into a TYPE_ARGUMENT_PACK
4526 with a single element, which expands T. */
4527 tree vec
= make_tree_vec (1);
4529 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
4531 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4533 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
4534 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4539 t
= DECL_INITIAL (t
);
4541 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
4543 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
4544 with a single element, which expands T. */
4545 tree vec
= make_tree_vec (1);
4547 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
4549 t
= convert_from_reference (t
);
4550 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4552 t
= make_node (NONTYPE_ARGUMENT_PACK
);
4553 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4556 t
= convert_from_reference (t
);
4561 /* Given a single level of template parameters (a TREE_VEC), return it
4562 as a set of template arguments. */
4565 template_parms_level_to_args (tree parms
)
4567 tree a
= copy_node (parms
);
4568 TREE_TYPE (a
) = NULL_TREE
;
4569 for (int i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
4570 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
4573 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
4578 /* Given a set of template parameters, return them as a set of template
4579 arguments. The template parameters are represented as a TREE_VEC, in
4580 the form documented in cp-tree.h for template arguments. */
4583 template_parms_to_args (tree parms
)
4586 tree args
= NULL_TREE
;
4587 int length
= TMPL_PARMS_DEPTH (parms
);
4590 /* If there is only one level of template parameters, we do not
4591 create a TREE_VEC of TREE_VECs. Instead, we return a single
4592 TREE_VEC containing the arguments. */
4594 args
= make_tree_vec (length
);
4596 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
4598 tree a
= template_parms_level_to_args (TREE_VALUE (header
));
4601 TREE_VEC_ELT (args
, --l
) = a
;
4609 /* Within the declaration of a template, return the currently active
4610 template parameters as an argument TREE_VEC. */
4613 current_template_args (void)
4615 return template_parms_to_args (current_template_parms
);
4618 /* Update the declared TYPE by doing any lookups which were thought to be
4619 dependent, but are not now that we know the SCOPE of the declarator. */
4622 maybe_update_decl_type (tree orig_type
, tree scope
)
4624 tree type
= orig_type
;
4626 if (type
== NULL_TREE
)
4629 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4630 type
= TREE_TYPE (type
);
4632 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
4633 && dependent_type_p (type
)
4634 /* Don't bother building up the args in this case. */
4635 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
4637 /* tsubst in the args corresponding to the template parameters,
4638 including auto if present. Most things will be unchanged, but
4639 make_typename_type and tsubst_qualified_id will resolve
4640 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
4641 tree args
= current_template_args ();
4642 tree auto_node
= type_uses_auto (type
);
4646 tree auto_vec
= make_tree_vec (1);
4647 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
4648 args
= add_to_template_args (args
, auto_vec
);
4650 pushed
= push_scope (scope
);
4651 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
4656 if (type
== error_mark_node
)
4659 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4661 if (same_type_p (type
, TREE_TYPE (orig_type
)))
4664 type
= TYPE_NAME (type
);
4669 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4670 template PARMS and constraints, CONSTR. If MEMBER_TEMPLATE_P is true,
4671 the new template is a member template. */
4674 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
4676 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
4677 SET_DECL_LANGUAGE (tmpl
, DECL_LANGUAGE (decl
));
4678 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
4679 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
4680 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
4681 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
4686 struct template_parm_data
4688 /* The level of the template parameters we are currently
4692 /* The index of the specialization argument we are currently
4696 /* An array whose size is the number of template parameters. The
4697 elements are nonzero if the parameter has been used in any one
4698 of the arguments processed so far. */
4701 /* An array whose size is the number of template arguments. The
4702 elements are nonzero if the argument makes use of template
4703 parameters of this level. */
4704 int* arg_uses_template_parms
;
4707 /* Subroutine of push_template_decl used to see if each template
4708 parameter in a partial specialization is used in the explicit
4709 argument list. If T is of the LEVEL given in DATA (which is
4710 treated as a template_parm_data*), then DATA->PARMS is marked
4714 mark_template_parm (tree t
, void* data
)
4718 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4720 template_parm_level_and_index (t
, &level
, &idx
);
4722 if (level
== tpd
->level
)
4724 tpd
->parms
[idx
] = 1;
4725 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4728 /* In C++17 the type of a non-type argument is a deduced context. */
4729 if (cxx_dialect
>= cxx17
4730 && TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
4731 for_each_template_parm (TREE_TYPE (t
),
4732 &mark_template_parm
,
4735 /*include_nondeduced_p=*/false);
4737 /* Return zero so that for_each_template_parm will continue the
4738 traversal of the tree; we want to mark *every* template parm. */
4742 /* Process the partial specialization DECL. */
4745 process_partial_specialization (tree decl
)
4747 tree type
= TREE_TYPE (decl
);
4748 tree tinfo
= get_template_info (decl
);
4749 tree maintmpl
= TI_TEMPLATE (tinfo
);
4750 tree specargs
= TI_ARGS (tinfo
);
4751 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4752 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4755 int nargs
= TREE_VEC_LENGTH (inner_args
);
4758 bool did_error_intro
= false;
4759 struct template_parm_data tpd
;
4760 struct template_parm_data tpd2
;
4762 gcc_assert (current_template_parms
);
4764 /* A concept cannot be specialized. */
4765 if (flag_concepts
&& variable_concept_p (maintmpl
))
4767 error ("specialization of variable concept %q#D", maintmpl
);
4768 return error_mark_node
;
4771 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4772 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4774 /* We check that each of the template parameters given in the
4775 partial specialization is used in the argument list to the
4776 specialization. For example:
4778 template <class T> struct S;
4779 template <class T> struct S<T*>;
4781 The second declaration is OK because `T*' uses the template
4782 parameter T, whereas
4784 template <class T> struct S<int>;
4786 is no good. Even trickier is:
4797 The S2<T> declaration is actually invalid; it is a
4798 full-specialization. Of course,
4801 struct S2<T (*)(U)>;
4803 or some such would have been OK. */
4804 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4805 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4806 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4808 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4809 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4810 for (i
= 0; i
< nargs
; ++i
)
4812 tpd
.current_arg
= i
;
4813 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4814 &mark_template_parm
,
4817 /*include_nondeduced_p=*/false);
4819 for (i
= 0; i
< ntparms
; ++i
)
4820 if (tpd
.parms
[i
] == 0)
4822 /* One of the template parms was not used in a deduced context in the
4824 if (!did_error_intro
)
4826 error ("template parameters not deducible in "
4827 "partial specialization:");
4828 did_error_intro
= true;
4831 inform (input_location
, " %qD",
4832 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4835 if (did_error_intro
)
4836 return error_mark_node
;
4838 /* [temp.class.spec]
4840 The argument list of the specialization shall not be identical to
4841 the implicit argument list of the primary template. */
4843 = TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (maintmpl
)));
4844 if (comp_template_args (inner_args
, INNERMOST_TEMPLATE_ARGS (main_args
))
4846 || !strictly_subsumes (current_template_constraints (),
4847 get_constraints (maintmpl
))))
4850 error ("partial specialization %q+D does not specialize "
4851 "any template arguments; to define the primary template, "
4852 "remove the template argument list", decl
);
4854 error ("partial specialization %q+D does not specialize any "
4855 "template arguments and is not more constrained than "
4856 "the primary template; to define the primary template, "
4857 "remove the template argument list", decl
);
4858 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4861 /* A partial specialization that replaces multiple parameters of the
4862 primary template with a pack expansion is less specialized for those
4864 if (nargs
< DECL_NTPARMS (maintmpl
))
4866 error ("partial specialization is not more specialized than the "
4867 "primary template because it replaces multiple parameters "
4868 "with a pack expansion");
4869 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4870 /* Avoid crash in process_partial_specialization. */
4874 /* If we aren't in a dependent class, we can actually try deduction. */
4875 else if (tpd
.level
== 1
4876 /* FIXME we should be able to handle a partial specialization of a
4877 partial instantiation, but currently we can't (c++/41727). */
4878 && TMPL_ARGS_DEPTH (specargs
) == 1
4879 && !get_partial_spec_bindings (maintmpl
, maintmpl
, specargs
))
4881 if (permerror (input_location
, "partial specialization %qD is not "
4882 "more specialized than", decl
))
4883 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template %qD",
4887 /* [temp.class.spec]
4889 A partially specialized non-type argument expression shall not
4890 involve template parameters of the partial specialization except
4891 when the argument expression is a simple identifier.
4893 The type of a template parameter corresponding to a specialized
4894 non-type argument shall not be dependent on a parameter of the
4897 Also, we verify that pack expansions only occur at the
4898 end of the argument list. */
4899 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4901 for (i
= 0; i
< nargs
; ++i
)
4903 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4904 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4905 tree packed_args
= NULL_TREE
;
4908 if (ARGUMENT_PACK_P (arg
))
4910 /* Extract the arguments from the argument pack. We'll be
4911 iterating over these in the following loop. */
4912 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4913 len
= TREE_VEC_LENGTH (packed_args
);
4916 for (j
= 0; j
< len
; j
++)
4919 /* Get the Jth argument in the parameter pack. */
4920 arg
= TREE_VEC_ELT (packed_args
, j
);
4922 if (PACK_EXPANSION_P (arg
))
4924 /* Pack expansions must come at the end of the
4926 if ((packed_args
&& j
< len
- 1)
4927 || (!packed_args
&& i
< nargs
- 1))
4929 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4930 error ("parameter pack argument %qE must be at the "
4931 "end of the template argument list", arg
);
4933 error ("parameter pack argument %qT must be at the "
4934 "end of the template argument list", arg
);
4938 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4939 /* We only care about the pattern. */
4940 arg
= PACK_EXPANSION_PATTERN (arg
);
4942 if (/* These first two lines are the `non-type' bit. */
4944 && TREE_CODE (arg
) != TEMPLATE_DECL
4945 /* This next two lines are the `argument expression is not just a
4946 simple identifier' condition and also the `specialized
4947 non-type argument' bit. */
4948 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
4949 && !(REFERENCE_REF_P (arg
)
4950 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_PARM_INDEX
))
4952 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4953 || (packed_args
&& uses_template_parms (arg
)))
4954 error ("template argument %qE involves template parameter(s)",
4958 /* Look at the corresponding template parameter,
4959 marking which template parameters its type depends
4961 tree type
= TREE_TYPE (parm
);
4965 /* We haven't yet initialized TPD2. Do so now. */
4966 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4967 /* The number of parameters here is the number in the
4968 main template, which, as checked in the assertion
4970 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4972 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4975 /* Mark the template parameters. But this time, we're
4976 looking for the template parameters of the main
4977 template, not in the specialization. */
4978 tpd2
.current_arg
= i
;
4979 tpd2
.arg_uses_template_parms
[i
] = 0;
4980 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4981 for_each_template_parm (type
,
4982 &mark_template_parm
,
4985 /*include_nondeduced_p=*/false);
4987 if (tpd2
.arg_uses_template_parms
[i
])
4989 /* The type depended on some template parameters.
4990 If they are fully specialized in the
4991 specialization, that's OK. */
4994 for (j
= 0; j
< nargs
; ++j
)
4995 if (tpd2
.parms
[j
] != 0
4996 && tpd
.arg_uses_template_parms
[j
])
4999 error_n (input_location
, count
,
5000 "type %qT of template argument %qE depends "
5001 "on a template parameter",
5002 "type %qT of template argument %qE depends "
5003 "on template parameters",
5012 /* We should only get here once. */
5013 if (TREE_CODE (decl
) == TYPE_DECL
)
5014 gcc_assert (!COMPLETE_TYPE_P (type
));
5016 // Build the template decl.
5017 tree tmpl
= build_template_decl (decl
, current_template_parms
,
5018 DECL_MEMBER_TEMPLATE_P (maintmpl
));
5019 TREE_TYPE (tmpl
) = type
;
5020 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
5021 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
5022 DECL_TEMPLATE_INFO (tmpl
) = build_template_info (maintmpl
, specargs
);
5023 DECL_PRIMARY_TEMPLATE (tmpl
) = maintmpl
;
5025 /* Give template template parms a DECL_CONTEXT of the template
5026 for which they are a parameter. */
5027 for (i
= 0; i
< ntparms
; ++i
)
5029 tree parm
= TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
));
5030 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5031 DECL_CONTEXT (parm
) = tmpl
;
5035 /* We didn't register this in check_explicit_specialization so we could
5036 wait until the constraints were set. */
5037 decl
= register_specialization (decl
, maintmpl
, specargs
, false, 0);
5039 associate_classtype_constraints (type
);
5041 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
5042 = tree_cons (specargs
, tmpl
,
5043 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
5044 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
5046 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
5047 inst
= TREE_CHAIN (inst
))
5049 tree instance
= TREE_VALUE (inst
);
5050 if (TYPE_P (instance
)
5051 ? (COMPLETE_TYPE_P (instance
)
5052 && CLASSTYPE_IMPLICIT_INSTANTIATION (instance
))
5053 : DECL_TEMPLATE_INSTANTIATION (instance
))
5055 tree spec
= most_specialized_partial_spec (instance
, tf_none
);
5056 tree inst_decl
= (DECL_P (instance
)
5057 ? instance
: TYPE_NAME (instance
));
5060 else if (spec
== error_mark_node
)
5061 permerror (input_location
,
5062 "declaration of %qD ambiguates earlier template "
5063 "instantiation for %qD", decl
, inst_decl
);
5064 else if (TREE_VALUE (spec
) == tmpl
)
5065 permerror (input_location
,
5066 "partial specialization of %qD after instantiation "
5067 "of %qD", decl
, inst_decl
);
5074 /* PARM is a template parameter of some form; return the corresponding
5075 TEMPLATE_PARM_INDEX. */
5078 get_template_parm_index (tree parm
)
5080 if (TREE_CODE (parm
) == PARM_DECL
5081 || TREE_CODE (parm
) == CONST_DECL
)
5082 parm
= DECL_INITIAL (parm
);
5083 else if (TREE_CODE (parm
) == TYPE_DECL
5084 || TREE_CODE (parm
) == TEMPLATE_DECL
)
5085 parm
= TREE_TYPE (parm
);
5086 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
5087 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
5088 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
5089 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
5090 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
5094 /* Subroutine of fixed_parameter_pack_p below. Look for any template
5095 parameter packs used by the template parameter PARM. */
5098 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
5100 /* A type parm can't refer to another parm. */
5101 if (TREE_CODE (parm
) == TYPE_DECL
|| parm
== error_mark_node
)
5103 else if (TREE_CODE (parm
) == PARM_DECL
)
5105 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
5110 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
5112 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
5113 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
5114 fixed_parameter_pack_p_1 (TREE_VALUE (TREE_VEC_ELT (vec
, i
)), ppd
);
5117 /* PARM is a template parameter pack. Return any parameter packs used in
5118 its type or the type of any of its template parameters. If there are
5119 any such packs, it will be instantiated into a fixed template parameter
5120 list by partial instantiation rather than be fully deduced. */
5123 fixed_parameter_pack_p (tree parm
)
5125 /* This can only be true in a member template. */
5126 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
5128 /* This can only be true for a parameter pack. */
5129 if (!template_parameter_pack_p (parm
))
5131 /* A type parm can't refer to another parm. */
5132 if (TREE_CODE (parm
) == TYPE_DECL
)
5135 tree parameter_packs
= NULL_TREE
;
5136 struct find_parameter_pack_data ppd
;
5137 ppd
.parameter_packs
= ¶meter_packs
;
5138 ppd
.visited
= new hash_set
<tree
>;
5139 ppd
.type_pack_expansion_p
= false;
5141 fixed_parameter_pack_p_1 (parm
, &ppd
);
5144 return parameter_packs
;
5147 /* Check that a template declaration's use of default arguments and
5148 parameter packs is not invalid. Here, PARMS are the template
5149 parameters. IS_PRIMARY is true if DECL is the thing declared by
5150 a primary template. IS_PARTIAL is true if DECL is a partial
5153 IS_FRIEND_DECL is nonzero if DECL is either a non-defining friend
5154 function template declaration or a friend class template
5155 declaration. In the function case, 1 indicates a declaration, 2
5156 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
5157 emitted for extraneous default arguments.
5159 Returns TRUE if there were no errors found, FALSE otherwise. */
5162 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
5163 bool is_partial
, int is_friend_decl
)
5166 int last_level_to_check
;
5168 bool no_errors
= true;
5172 A default template-argument shall not be specified in a
5173 function template declaration or a function template definition, nor
5174 in the template-parameter-list of the definition of a member of a
5177 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
5178 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (decl
)))
5179 /* You can't have a function template declaration in a local
5180 scope, nor you can you define a member of a class template in a
5184 if ((TREE_CODE (decl
) == TYPE_DECL
5186 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5187 || (TREE_CODE (decl
) == FUNCTION_DECL
5188 && LAMBDA_FUNCTION_P (decl
)))
5189 /* A lambda doesn't have an explicit declaration; don't complain
5190 about the parms of the enclosing class. */
5193 if (current_class_type
5194 && !TYPE_BEING_DEFINED (current_class_type
)
5195 && DECL_LANG_SPECIFIC (decl
)
5196 && DECL_DECLARES_FUNCTION_P (decl
)
5197 /* If this is either a friend defined in the scope of the class
5198 or a member function. */
5199 && (DECL_FUNCTION_MEMBER_P (decl
)
5200 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
5201 : DECL_FRIEND_CONTEXT (decl
)
5202 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
5204 /* And, if it was a member function, it really was defined in
5205 the scope of the class. */
5206 && (!DECL_FUNCTION_MEMBER_P (decl
)
5207 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
5208 /* We already checked these parameters when the template was
5209 declared, so there's no need to do it again now. This function
5210 was defined in class scope, but we're processing its body now
5211 that the class is complete. */
5214 /* Core issue 226 (C++0x only): the following only applies to class
5217 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
5221 If a template-parameter has a default template-argument, all
5222 subsequent template-parameters shall have a default
5223 template-argument supplied. */
5224 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
5226 tree inner_parms
= TREE_VALUE (parm_level
);
5227 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
5228 int seen_def_arg_p
= 0;
5231 for (i
= 0; i
< ntparms
; ++i
)
5233 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
5235 if (parm
== error_mark_node
)
5238 if (TREE_PURPOSE (parm
))
5240 else if (seen_def_arg_p
5241 && !template_parameter_pack_p (TREE_VALUE (parm
)))
5243 error ("no default argument for %qD", TREE_VALUE (parm
));
5244 /* For better subsequent error-recovery, we indicate that
5245 there should have been a default argument. */
5246 TREE_PURPOSE (parm
) = error_mark_node
;
5249 else if (!is_partial
5251 /* Don't complain about an enclosing partial
5253 && parm_level
== parms
5254 && TREE_CODE (decl
) == TYPE_DECL
5256 && template_parameter_pack_p (TREE_VALUE (parm
))
5257 /* A fixed parameter pack will be partially
5258 instantiated into a fixed length list. */
5259 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
5261 /* A primary class template can only have one
5262 parameter pack, at the end of the template
5265 error ("parameter pack %q+D must be at the end of the"
5266 " template parameter list", TREE_VALUE (parm
));
5268 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
5276 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
5280 /* For an ordinary class template, default template arguments are
5281 allowed at the innermost level, e.g.:
5282 template <class T = int>
5284 but, in a partial specialization, they're not allowed even
5285 there, as we have in [temp.class.spec]:
5287 The template parameter list of a specialization shall not
5288 contain default template argument values.
5290 So, for a partial specialization, or for a function template
5291 (in C++98/C++03), we look at all of them. */
5294 /* But, for a primary class template that is not a partial
5295 specialization we look at all template parameters except the
5297 parms
= TREE_CHAIN (parms
);
5299 /* Figure out what error message to issue. */
5300 if (is_friend_decl
== 2)
5301 msg
= G_("default template arguments may not be used in function template "
5302 "friend re-declaration");
5303 else if (is_friend_decl
)
5304 msg
= G_("default template arguments may not be used in template "
5305 "friend declarations");
5306 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
5307 msg
= G_("default template arguments may not be used in function templates "
5308 "without -std=c++11 or -std=gnu++11");
5309 else if (is_partial
)
5310 msg
= G_("default template arguments may not be used in "
5311 "partial specializations");
5312 else if (current_class_type
&& CLASSTYPE_IS_TEMPLATE (current_class_type
))
5313 msg
= G_("default argument for template parameter for class enclosing %qD");
5315 /* Per [temp.param]/9, "A default template-argument shall not be
5316 specified in the template-parameter-lists of the definition of
5317 a member of a class template that appears outside of the member's
5318 class.", thus if we aren't handling a member of a class template
5319 there is no need to examine the parameters. */
5322 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
5323 /* If we're inside a class definition, there's no need to
5324 examine the parameters to the class itself. On the one
5325 hand, they will be checked when the class is defined, and,
5326 on the other, default arguments are valid in things like:
5327 template <class T = double>
5328 struct S { template <class U> void f(U); };
5329 Here the default argument for `S' has no bearing on the
5330 declaration of `f'. */
5331 last_level_to_check
= template_class_depth (current_class_type
) + 1;
5333 /* Check everything. */
5334 last_level_to_check
= 0;
5336 for (parm_level
= parms
;
5337 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
5338 parm_level
= TREE_CHAIN (parm_level
))
5340 tree inner_parms
= TREE_VALUE (parm_level
);
5344 ntparms
= TREE_VEC_LENGTH (inner_parms
);
5345 for (i
= 0; i
< ntparms
; ++i
)
5347 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
5350 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
5355 if (is_friend_decl
== 2)
5362 /* Clear out the default argument so that we are not
5364 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
5368 /* At this point, if we're still interested in issuing messages,
5369 they must apply to classes surrounding the object declared. */
5371 msg
= G_("default argument for template parameter for class "
5378 /* Worker for push_template_decl_real, called via
5379 for_each_template_parm. DATA is really an int, indicating the
5380 level of the parameters we are interested in. If T is a template
5381 parameter of that level, return nonzero. */
5384 template_parm_this_level_p (tree t
, void* data
)
5386 int this_level
= *(int *)data
;
5389 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
5390 level
= TEMPLATE_PARM_LEVEL (t
);
5392 level
= TEMPLATE_TYPE_LEVEL (t
);
5393 return level
== this_level
;
5396 /* Worker for uses_outer_template_parms, called via for_each_template_parm.
5397 DATA is really an int, indicating the innermost outer level of parameters.
5398 If T is a template parameter of that level or further out, return
5402 template_parm_outer_level (tree t
, void *data
)
5404 int this_level
= *(int *)data
;
5407 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
5408 level
= TEMPLATE_PARM_LEVEL (t
);
5410 level
= TEMPLATE_TYPE_LEVEL (t
);
5411 return level
<= this_level
;
5414 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
5415 parameters given by current_template_args, or reuses a
5416 previously existing one, if appropriate. Returns the DECL, or an
5417 equivalent one, if it is replaced via a call to duplicate_decls.
5419 If IS_FRIEND is true, DECL is a friend declaration. */
5422 push_template_decl_real (tree decl
, bool is_friend
)
5430 int new_template_p
= 0;
5431 /* True if the template is a member template, in the sense of
5433 bool member_template_p
= false;
5435 if (decl
== error_mark_node
|| !current_template_parms
)
5436 return error_mark_node
;
5438 /* See if this is a partial specialization. */
5439 is_partial
= ((DECL_IMPLICIT_TYPEDEF_P (decl
)
5440 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
5441 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
5443 && DECL_LANG_SPECIFIC (decl
)
5444 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5445 && TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
))));
5447 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
5451 /* For a friend, we want the context of the friend, not
5452 the type of which it is a friend. */
5453 ctx
= CP_DECL_CONTEXT (decl
);
5454 else if (CP_DECL_CONTEXT (decl
)
5455 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
5456 /* In the case of a virtual function, we want the class in which
5458 ctx
= CP_DECL_CONTEXT (decl
);
5460 /* Otherwise, if we're currently defining some class, the DECL
5461 is assumed to be a member of the class. */
5462 ctx
= current_scope ();
5464 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
5467 if (!DECL_CONTEXT (decl
))
5468 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
5470 /* See if this is a primary template. */
5471 if (is_friend
&& ctx
5472 && uses_template_parms_level (ctx
, processing_template_decl
))
5473 /* A friend template that specifies a class context, i.e.
5474 template <typename T> friend void A<T>::f();
5477 else if (TREE_CODE (decl
) == TYPE_DECL
5478 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5481 is_primary
= template_parm_scope_p ();
5485 warning (OPT_Wtemplates
, "template %qD declared", decl
);
5487 if (DECL_CLASS_SCOPE_P (decl
))
5488 member_template_p
= true;
5489 if (TREE_CODE (decl
) == TYPE_DECL
5490 && anon_aggrname_p (DECL_NAME (decl
)))
5492 error ("template class without a name");
5493 return error_mark_node
;
5495 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
5497 if (member_template_p
)
5499 if (DECL_OVERRIDE_P (decl
) || DECL_FINAL_P (decl
))
5500 error ("member template %qD may not have virt-specifiers", decl
);
5502 if (DECL_DESTRUCTOR_P (decl
))
5506 A destructor shall not be a member template. */
5507 error ("destructor %qD declared as member template", decl
);
5508 return error_mark_node
;
5510 if (IDENTIFIER_NEWDEL_OP_P (DECL_NAME (decl
))
5511 && (!prototype_p (TREE_TYPE (decl
))
5512 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
5513 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
5514 || (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
5515 == void_list_node
)))
5517 /* [basic.stc.dynamic.allocation]
5519 An allocation function can be a function
5520 template. ... Template allocation functions shall
5521 have two or more parameters. */
5522 error ("invalid template declaration of %qD", decl
);
5523 return error_mark_node
;
5526 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5527 && CLASS_TYPE_P (TREE_TYPE (decl
)))
5529 /* Class template, set TEMPLATE_TYPE_PARM_FOR_CLASS. */
5530 tree parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
5531 for (int i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
5533 tree t
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5534 if (TREE_CODE (t
) == TYPE_DECL
)
5536 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
5537 TEMPLATE_TYPE_PARM_FOR_CLASS (t
) = true;
5540 else if (TREE_CODE (decl
) == TYPE_DECL
5541 && TYPE_DECL_ALIAS_P (decl
))
5542 /* alias-declaration */
5543 gcc_assert (!DECL_ARTIFICIAL (decl
));
5544 else if (VAR_P (decl
))
5545 /* C++14 variable template. */;
5548 error ("template declaration of %q#D", decl
);
5549 return error_mark_node
;
5553 /* Check to see that the rules regarding the use of default
5554 arguments are not being violated. We check args for a friend
5555 functions when we know whether it's a definition, introducing
5556 declaration or re-declaration. */
5557 if (!is_friend
|| TREE_CODE (decl
) != FUNCTION_DECL
)
5558 check_default_tmpl_args (decl
, current_template_parms
,
5559 is_primary
, is_partial
, is_friend
);
5561 /* Ensure that there are no parameter packs in the type of this
5562 declaration that have not been expanded. */
5563 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5565 /* Check each of the arguments individually to see if there are
5566 any bare parameter packs. */
5567 tree type
= TREE_TYPE (decl
);
5568 tree arg
= DECL_ARGUMENTS (decl
);
5569 tree argtype
= TYPE_ARG_TYPES (type
);
5571 while (arg
&& argtype
)
5573 if (!DECL_PACK_P (arg
)
5574 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
5576 /* This is a PARM_DECL that contains unexpanded parameter
5577 packs. We have already complained about this in the
5578 check_for_bare_parameter_packs call, so just replace
5579 these types with ERROR_MARK_NODE. */
5580 TREE_TYPE (arg
) = error_mark_node
;
5581 TREE_VALUE (argtype
) = error_mark_node
;
5584 arg
= DECL_CHAIN (arg
);
5585 argtype
= TREE_CHAIN (argtype
);
5588 /* Check for bare parameter packs in the return type and the
5589 exception specifiers. */
5590 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
5591 /* Errors were already issued, set return type to int
5592 as the frontend doesn't expect error_mark_node as
5594 TREE_TYPE (type
) = integer_type_node
;
5595 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
5596 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
5598 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
5599 && TYPE_DECL_ALIAS_P (decl
))
5600 ? DECL_ORIGINAL_TYPE (decl
)
5601 : TREE_TYPE (decl
)))
5603 TREE_TYPE (decl
) = error_mark_node
;
5604 return error_mark_node
;
5608 return process_partial_specialization (decl
);
5610 args
= current_template_args ();
5613 || TREE_CODE (ctx
) == FUNCTION_DECL
5614 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
5615 || (TREE_CODE (decl
) == TYPE_DECL
5616 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5617 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
5619 if (DECL_LANG_SPECIFIC (decl
)
5620 && DECL_TEMPLATE_INFO (decl
)
5621 && DECL_TI_TEMPLATE (decl
))
5622 tmpl
= DECL_TI_TEMPLATE (decl
);
5623 /* If DECL is a TYPE_DECL for a class-template, then there won't
5624 be DECL_LANG_SPECIFIC. The information equivalent to
5625 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
5626 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5627 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
5628 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
5630 /* Since a template declaration already existed for this
5631 class-type, we must be redeclaring it here. Make sure
5632 that the redeclaration is valid. */
5633 redeclare_class_template (TREE_TYPE (decl
),
5634 current_template_parms
,
5635 current_template_constraints ());
5636 /* We don't need to create a new TEMPLATE_DECL; just use the
5637 one we already had. */
5638 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
5642 tmpl
= build_template_decl (decl
, current_template_parms
,
5646 if (DECL_LANG_SPECIFIC (decl
)
5647 && DECL_TEMPLATE_SPECIALIZATION (decl
))
5649 /* A specialization of a member template of a template
5651 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
5652 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
5653 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
5659 tree a
, t
, current
, parms
;
5661 tree tinfo
= get_template_info (decl
);
5665 error ("template definition of non-template %q#D", decl
);
5666 return error_mark_node
;
5669 tmpl
= TI_TEMPLATE (tinfo
);
5671 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
5672 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
5673 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5674 && DECL_MEMBER_TEMPLATE_P (tmpl
))
5678 /* The declaration is a specialization of a member
5679 template, declared outside the class. Therefore, the
5680 innermost template arguments will be NULL, so we
5681 replace them with the arguments determined by the
5682 earlier call to check_explicit_specialization. */
5683 args
= DECL_TI_ARGS (decl
);
5686 = build_template_decl (decl
, current_template_parms
,
5688 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
5689 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
5690 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
5691 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
5692 DECL_TEMPLATE_INFO (new_tmpl
)
5693 = build_template_info (tmpl
, args
);
5695 register_specialization (new_tmpl
,
5696 most_general_template (tmpl
),
5702 /* Make sure the template headers we got make sense. */
5704 parms
= DECL_TEMPLATE_PARMS (tmpl
);
5705 i
= TMPL_PARMS_DEPTH (parms
);
5706 if (TMPL_ARGS_DEPTH (args
) != i
)
5708 error ("expected %d levels of template parms for %q#D, got %d",
5709 i
, decl
, TMPL_ARGS_DEPTH (args
));
5710 DECL_INTERFACE_KNOWN (decl
) = 1;
5711 return error_mark_node
;
5714 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
5716 a
= TMPL_ARGS_LEVEL (args
, i
);
5717 t
= INNERMOST_TEMPLATE_PARMS (parms
);
5719 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
5721 if (current
== decl
)
5722 error ("got %d template parameters for %q#D",
5723 TREE_VEC_LENGTH (a
), decl
);
5725 error ("got %d template parameters for %q#T",
5726 TREE_VEC_LENGTH (a
), current
);
5727 error (" but %d required", TREE_VEC_LENGTH (t
));
5728 /* Avoid crash in import_export_decl. */
5729 DECL_INTERFACE_KNOWN (decl
) = 1;
5730 return error_mark_node
;
5733 if (current
== decl
)
5735 else if (current
== NULL_TREE
)
5736 /* Can happen in erroneous input. */
5739 current
= get_containing_scope (current
);
5742 /* Check that the parms are used in the appropriate qualifying scopes
5743 in the declarator. */
5744 if (!comp_template_args
5746 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
5748 error ("template arguments to %qD do not match original "
5749 "template %qD", decl
, DECL_TEMPLATE_RESULT (tmpl
));
5750 if (!uses_template_parms (TI_ARGS (tinfo
)))
5751 inform (input_location
, "use %<template<>%> for"
5752 " an explicit specialization");
5753 /* Avoid crash in import_export_decl. */
5754 DECL_INTERFACE_KNOWN (decl
) = 1;
5755 return error_mark_node
;
5759 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
5760 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
5762 /* Push template declarations for global functions and types. Note
5763 that we do not try to push a global template friend declared in a
5764 template class; such a thing may well depend on the template
5765 parameters of the class. */
5766 if (new_template_p
&& !ctx
5767 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
5769 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
5770 if (tmpl
== error_mark_node
)
5771 return error_mark_node
;
5773 /* Hide template friend classes that haven't been declared yet. */
5774 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
5776 DECL_ANTICIPATED (tmpl
) = 1;
5777 DECL_FRIEND_P (tmpl
) = 1;
5783 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5785 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5787 /* Give template template parms a DECL_CONTEXT of the template
5788 for which they are a parameter. */
5789 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5790 for (int i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5792 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5793 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5794 DECL_CONTEXT (parm
) = tmpl
;
5797 if (TREE_CODE (decl
) == TYPE_DECL
5798 && TYPE_DECL_ALIAS_P (decl
)
5799 && complex_alias_template_p (tmpl
))
5800 TEMPLATE_DECL_COMPLEX_ALIAS_P (tmpl
) = true;
5803 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5804 back to its most general template. If TMPL is a specialization,
5805 ARGS may only have the innermost set of arguments. Add the missing
5806 argument levels if necessary. */
5807 if (DECL_TEMPLATE_INFO (tmpl
))
5808 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5810 info
= build_template_info (tmpl
, args
);
5812 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5813 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5817 retrofit_lang_decl (decl
);
5818 if (DECL_LANG_SPECIFIC (decl
))
5819 DECL_TEMPLATE_INFO (decl
) = info
;
5822 if (flag_implicit_templates
5824 && TREE_PUBLIC (decl
)
5825 && VAR_OR_FUNCTION_DECL_P (decl
))
5826 /* Set DECL_COMDAT on template instantiations; if we force
5827 them to be emitted by explicit instantiation or -frepo,
5828 mark_needed will tell cgraph to do the right thing. */
5829 DECL_COMDAT (decl
) = true;
5831 return DECL_TEMPLATE_RESULT (tmpl
);
5835 push_template_decl (tree decl
)
5837 return push_template_decl_real (decl
, false);
5840 /* FN is an inheriting constructor that inherits from the constructor
5841 template INHERITED; turn FN into a constructor template with a matching
5845 add_inherited_template_parms (tree fn
, tree inherited
)
5848 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5849 inner_parms
= copy_node (inner_parms
);
5851 = tree_cons (size_int (processing_template_decl
+ 1),
5852 inner_parms
, current_template_parms
);
5853 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5854 tree args
= template_parms_to_args (parms
);
5855 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5856 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5857 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5858 DECL_ARTIFICIAL (tmpl
) = true;
5859 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5863 /* Called when a class template TYPE is redeclared with the indicated
5864 template PARMS, e.g.:
5866 template <class T> struct S;
5867 template <class T> struct S {}; */
5870 redeclare_class_template (tree type
, tree parms
, tree cons
)
5876 if (!TYPE_TEMPLATE_INFO (type
))
5878 error ("%qT is not a template type", type
);
5882 tmpl
= TYPE_TI_TEMPLATE (type
);
5883 if (!PRIMARY_TEMPLATE_P (tmpl
))
5884 /* The type is nested in some template class. Nothing to worry
5885 about here; there are no new template parameters for the nested
5891 error ("template specifiers not specified in declaration of %qD",
5896 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5897 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5899 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5901 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5902 "redeclared with %d template parameter",
5903 "redeclared with %d template parameters",
5904 TREE_VEC_LENGTH (parms
));
5905 inform_n (DECL_SOURCE_LOCATION (tmpl
), TREE_VEC_LENGTH (tmpl_parms
),
5906 "previous declaration %qD used %d template parameter",
5907 "previous declaration %qD used %d template parameters",
5908 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5912 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5919 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5920 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5923 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5924 if (error_operand_p (tmpl_parm
))
5927 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5928 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5929 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5931 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5933 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5934 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5935 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5936 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5937 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5938 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5939 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5940 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5941 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5943 error ("template parameter %q+#D", tmpl_parm
);
5944 error ("redeclared here as %q#D", parm
);
5948 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5950 /* We have in [temp.param]:
5952 A template-parameter may not be given default arguments
5953 by two different declarations in the same scope. */
5954 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5955 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5956 "original definition appeared here");
5960 if (parm_default
!= NULL_TREE
)
5961 /* Update the previous template parameters (which are the ones
5962 that will really count) with the new default value. */
5963 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5964 else if (tmpl_default
!= NULL_TREE
)
5965 /* Update the new parameters, too; they'll be used as the
5966 parameters for any members. */
5967 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5969 /* Give each template template parm in this redeclaration a
5970 DECL_CONTEXT of the template for which they are a parameter. */
5971 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5973 gcc_assert (DECL_CONTEXT (parm
) == NULL_TREE
);
5974 DECL_CONTEXT (parm
) = tmpl
;
5977 if (TREE_CODE (parm
) == TYPE_DECL
)
5978 TEMPLATE_TYPE_PARM_FOR_CLASS (TREE_TYPE (parm
)) = true;
5981 // Cannot redeclare a class template with a different set of constraints.
5982 if (!equivalent_constraints (get_constraints (tmpl
), cons
))
5984 error_at (input_location
, "redeclaration %q#D with different "
5985 "constraints", tmpl
);
5986 inform (DECL_SOURCE_LOCATION (tmpl
),
5987 "original declaration appeared here");
5993 /* The actual substitution part of instantiate_non_dependent_expr_sfinae,
5994 to be used when the caller has already checked
5995 (processing_template_decl
5996 && !instantiation_dependent_expression_p (expr)
5997 && potential_constant_expression (expr))
5998 and cleared processing_template_decl. */
6001 instantiate_non_dependent_expr_internal (tree expr
, tsubst_flags_t complain
)
6003 return tsubst_copy_and_build (expr
,
6006 /*in_decl=*/NULL_TREE
,
6007 /*function_p=*/false,
6008 /*integral_constant_expression_p=*/true);
6011 /* Simplify EXPR if it is a non-dependent expression. Returns the
6012 (possibly simplified) expression. */
6015 instantiate_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
6017 if (expr
== NULL_TREE
)
6020 /* If we're in a template, but EXPR isn't value dependent, simplify
6021 it. We're supposed to treat:
6023 template <typename T> void f(T[1 + 1]);
6024 template <typename T> void f(T[2]);
6026 as two declarations of the same function, for example. */
6027 if (processing_template_decl
6028 && is_nondependent_constant_expression (expr
))
6030 processing_template_decl_sentinel s
;
6031 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
6037 instantiate_non_dependent_expr (tree expr
)
6039 return instantiate_non_dependent_expr_sfinae (expr
, tf_error
);
6042 /* Like instantiate_non_dependent_expr, but return NULL_TREE rather than
6043 an uninstantiated expression. */
6046 instantiate_non_dependent_or_null (tree expr
)
6048 if (expr
== NULL_TREE
)
6050 if (processing_template_decl
)
6052 if (!is_nondependent_constant_expression (expr
))
6056 processing_template_decl_sentinel s
;
6057 expr
= instantiate_non_dependent_expr_internal (expr
, tf_error
);
6063 /* True iff T is a specialization of a variable template. */
6066 variable_template_specialization_p (tree t
)
6068 if (!VAR_P (t
) || !DECL_LANG_SPECIFIC (t
) || !DECL_TEMPLATE_INFO (t
))
6070 tree tmpl
= DECL_TI_TEMPLATE (t
);
6071 return variable_template_p (tmpl
);
6074 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
6075 template declaration, or a TYPE_DECL for an alias declaration. */
6078 alias_type_or_template_p (tree t
)
6082 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
6085 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
6086 || DECL_ALIAS_TEMPLATE_P (t
));
6089 /* Return TRUE iff T is a specialization of an alias template. */
6092 alias_template_specialization_p (const_tree t
)
6094 /* It's an alias template specialization if it's an alias and its
6095 TYPE_NAME is a specialization of a primary template. */
6096 if (TYPE_ALIAS_P (t
))
6097 if (tree tinfo
= TYPE_ALIAS_TEMPLATE_INFO (t
))
6098 return PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
));
6103 /* An alias template is complex from a SFINAE perspective if a template-id
6104 using that alias can be ill-formed when the expansion is not, as with
6105 the void_t template. We determine this by checking whether the
6106 expansion for the alias template uses all its template parameters. */
6108 struct uses_all_template_parms_data
6115 uses_all_template_parms_r (tree t
, void *data_
)
6117 struct uses_all_template_parms_data
&data
6118 = *(struct uses_all_template_parms_data
*)data_
;
6119 tree idx
= get_template_parm_index (t
);
6121 if (TEMPLATE_PARM_LEVEL (idx
) == data
.level
)
6122 data
.seen
[TEMPLATE_PARM_IDX (idx
)] = true;
6127 complex_alias_template_p (const_tree tmpl
)
6129 struct uses_all_template_parms_data data
;
6130 tree pat
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
6131 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
6132 data
.level
= TMPL_PARMS_DEPTH (parms
);
6133 int len
= TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS (parms
));
6134 data
.seen
= XALLOCAVEC (bool, len
);
6135 for (int i
= 0; i
< len
; ++i
)
6136 data
.seen
[i
] = false;
6138 for_each_template_parm (pat
, uses_all_template_parms_r
, &data
, NULL
, true);
6139 for (int i
= 0; i
< len
; ++i
)
6145 /* Return TRUE iff T is a specialization of a complex alias template with
6146 dependent template-arguments. */
6149 dependent_alias_template_spec_p (const_tree t
)
6151 if (!alias_template_specialization_p (t
))
6154 tree tinfo
= TYPE_ALIAS_TEMPLATE_INFO (t
);
6155 if (!TEMPLATE_DECL_COMPLEX_ALIAS_P (TI_TEMPLATE (tinfo
)))
6158 tree args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
));
6159 if (!any_dependent_template_arguments_p (args
))
6165 /* Return the number of innermost template parameters in TMPL. */
6168 num_innermost_template_parms (tree tmpl
)
6170 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
6171 return TREE_VEC_LENGTH (parms
);
6174 /* Return either TMPL or another template that it is equivalent to under DR
6175 1286: An alias that just changes the name of a template is equivalent to
6176 the other template. */
6179 get_underlying_template (tree tmpl
)
6181 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
6182 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
6184 /* Determine if the alias is equivalent to an underlying template. */
6185 tree orig_type
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
6186 tree tinfo
= TYPE_TEMPLATE_INFO_MAYBE_ALIAS (orig_type
);
6190 tree underlying
= TI_TEMPLATE (tinfo
);
6191 if (!PRIMARY_TEMPLATE_P (underlying
)
6192 || (num_innermost_template_parms (tmpl
)
6193 != num_innermost_template_parms (underlying
)))
6196 tree alias_args
= INNERMOST_TEMPLATE_ARGS
6197 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
6198 if (!comp_template_args (TI_ARGS (tinfo
), alias_args
))
6201 /* Alias is equivalent. Strip it and repeat. */
6208 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
6209 must be a reference-to-function or a pointer-to-function type, as specified
6210 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
6211 and check that the resulting function has external linkage. */
6214 convert_nontype_argument_function (tree type
, tree expr
,
6215 tsubst_flags_t complain
)
6219 linkage_kind linkage
;
6221 fn
= instantiate_type (type
, fns
, tf_none
);
6222 if (fn
== error_mark_node
)
6223 return error_mark_node
;
6225 if (value_dependent_expression_p (fn
))
6228 fn_no_ptr
= strip_fnptr_conv (fn
);
6229 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
6230 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
6231 if (BASELINK_P (fn_no_ptr
))
6232 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
6234 /* [temp.arg.nontype]/1
6236 A template-argument for a non-type, non-template template-parameter
6239 -- the address of an object or function with external [C++11: or
6240 internal] linkage. */
6242 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
6244 if (complain
& tf_error
)
6246 error ("%qE is not a valid template argument for type %qT",
6248 if (TYPE_PTR_P (type
))
6249 inform (input_location
, "it must be the address of a function "
6250 "with external linkage");
6252 inform (input_location
, "it must be the name of a function with "
6253 "external linkage");
6258 linkage
= decl_linkage (fn_no_ptr
);
6259 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
6261 if (complain
& tf_error
)
6263 if (cxx_dialect
>= cxx11
)
6264 error ("%qE is not a valid template argument for type %qT "
6265 "because %qD has no linkage",
6266 expr
, type
, fn_no_ptr
);
6268 error ("%qE is not a valid template argument for type %qT "
6269 "because %qD does not have external linkage",
6270 expr
, type
, fn_no_ptr
);
6276 if (TYPE_REF_P (type
))
6278 if (REFERENCE_REF_P (fn
))
6279 fn
= TREE_OPERAND (fn
, 0);
6281 fn
= build_address (fn
);
6283 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (fn
)))
6284 fn
= build_nop (type
, fn
);
6289 /* Subroutine of convert_nontype_argument.
6290 Check if EXPR of type TYPE is a valid pointer-to-member constant.
6291 Emit an error otherwise. */
6294 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
6295 tsubst_flags_t complain
)
6297 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
6298 tree orig_expr
= expr
;
6300 if (null_ptr_cst_p (expr
))
6302 if (TREE_CODE (expr
) == PTRMEM_CST
6303 && same_type_p (TYPE_PTRMEM_CLASS_TYPE (type
),
6304 PTRMEM_CST_CLASS (expr
)))
6306 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
6308 if (processing_template_decl
6309 && TREE_CODE (expr
) == ADDR_EXPR
6310 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
6312 if (complain
& tf_error
)
6314 error_at (loc
, "%qE is not a valid template argument for type %qT",
6316 if (TREE_CODE (expr
) != PTRMEM_CST
)
6317 inform (loc
, "it must be a pointer-to-member of the form %<&X::Y%>");
6319 inform (loc
, "because it is a member of %qT", PTRMEM_CST_CLASS (expr
));
6324 /* Returns TRUE iff the address of OP is value-dependent.
6326 14.6.2.4 [temp.dep.temp]:
6327 A non-integral non-type template-argument is dependent if its type is
6328 dependent or it has either of the following forms
6331 and contains a nested-name-specifier which specifies a class-name that
6332 names a dependent type.
6334 We generalize this to just say that the address of a member of a
6335 dependent class is value-dependent; the above doesn't cover the
6336 address of a static data member named with an unqualified-id. */
6339 has_value_dependent_address (tree op
)
6341 /* We could use get_inner_reference here, but there's no need;
6342 this is only relevant for template non-type arguments, which
6343 can only be expressed as &id-expression. */
6346 tree ctx
= CP_DECL_CONTEXT (op
);
6347 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
6354 /* The next set of functions are used for providing helpful explanatory
6355 diagnostics for failed overload resolution. Their messages should be
6356 indented by two spaces for consistency with the messages in
6360 unify_success (bool /*explain_p*/)
6365 /* Other failure functions should call this one, to provide a single function
6366 for setting a breakpoint on. */
6369 unify_invalid (bool /*explain_p*/)
6375 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
6378 inform (input_location
,
6379 " couldn't deduce template parameter %qD", parm
);
6380 return unify_invalid (explain_p
);
6384 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
6387 inform (input_location
,
6388 " types %qT and %qT have incompatible cv-qualifiers",
6390 return unify_invalid (explain_p
);
6394 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
6397 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
6398 return unify_invalid (explain_p
);
6402 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
6405 inform (input_location
,
6406 " template parameter %qD is not a parameter pack, but "
6409 return unify_invalid (explain_p
);
6413 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
6416 inform (input_location
,
6417 " template argument %qE does not match "
6418 "pointer-to-member constant %qE",
6420 return unify_invalid (explain_p
);
6424 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
6427 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
6428 return unify_invalid (explain_p
);
6432 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
6435 inform (input_location
,
6436 " inconsistent parameter pack deduction with %qT and %qT",
6438 return unify_invalid (explain_p
);
6442 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
6447 inform (input_location
,
6448 " deduced conflicting types for parameter %qT (%qT and %qT)",
6449 parm
, first
, second
);
6451 inform (input_location
,
6452 " deduced conflicting values for non-type parameter "
6453 "%qE (%qE and %qE)", parm
, first
, second
);
6455 return unify_invalid (explain_p
);
6459 unify_vla_arg (bool explain_p
, tree arg
)
6462 inform (input_location
,
6463 " variable-sized array type %qT is not "
6464 "a valid template argument",
6466 return unify_invalid (explain_p
);
6470 unify_method_type_error (bool explain_p
, tree arg
)
6473 inform (input_location
,
6474 " member function type %qT is not a valid template argument",
6476 return unify_invalid (explain_p
);
6480 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
6485 inform_n (input_location
, wanted
,
6486 " candidate expects at least %d argument, %d provided",
6487 " candidate expects at least %d arguments, %d provided",
6490 inform_n (input_location
, wanted
,
6491 " candidate expects %d argument, %d provided",
6492 " candidate expects %d arguments, %d provided",
6495 return unify_invalid (explain_p
);
6499 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
6501 return unify_arity (explain_p
, have
, wanted
);
6505 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
6506 bool least_p
= false)
6508 return unify_arity (explain_p
, have
, wanted
, least_p
);
6512 unify_arg_conversion (bool explain_p
, tree to_type
,
6513 tree from_type
, tree arg
)
6516 inform (EXPR_LOC_OR_LOC (arg
, input_location
),
6517 " cannot convert %qE (type %qT) to type %qT",
6518 arg
, from_type
, to_type
);
6519 return unify_invalid (explain_p
);
6523 unify_no_common_base (bool explain_p
, enum template_base_result r
,
6524 tree parm
, tree arg
)
6529 case tbr_ambiguous_baseclass
:
6530 inform (input_location
, " %qT is an ambiguous base class of %qT",
6534 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
6537 return unify_invalid (explain_p
);
6541 unify_inconsistent_template_template_parameters (bool explain_p
)
6544 inform (input_location
,
6545 " template parameters of a template template argument are "
6546 "inconsistent with other deduced template arguments");
6547 return unify_invalid (explain_p
);
6551 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
6554 inform (input_location
,
6555 " can't deduce a template for %qT from non-template type %qT",
6557 return unify_invalid (explain_p
);
6561 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
6564 inform (input_location
,
6565 " template argument %qE does not match %qE", arg
, parm
);
6566 return unify_invalid (explain_p
);
6569 /* Attempt to convert the non-type template parameter EXPR to the
6570 indicated TYPE. If the conversion is successful, return the
6571 converted value. If the conversion is unsuccessful, return
6572 NULL_TREE if we issued an error message, or error_mark_node if we
6573 did not. We issue error messages for out-and-out bad template
6574 parameters, but not simply because the conversion failed, since we
6575 might be just trying to do argument deduction. Both TYPE and EXPR
6576 must be non-dependent.
6578 The conversion follows the special rules described in
6579 [temp.arg.nontype], and it is much more strict than an implicit
6582 This function is called twice for each template argument (see
6583 lookup_template_class for a more accurate description of this
6584 problem). This means that we need to handle expressions which
6585 are not valid in a C++ source, but can be created from the
6586 first call (for instance, casts to perform conversions). These
6587 hacks can go away after we fix the double coercion problem. */
6590 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
6593 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
6594 tree orig_expr
= expr
;
6596 /* Detect immediately string literals as invalid non-type argument.
6597 This special-case is not needed for correctness (we would easily
6598 catch this later), but only to provide better diagnostic for this
6599 common user mistake. As suggested by DR 100, we do not mention
6600 linkage issues in the diagnostic as this is not the point. */
6601 /* FIXME we're making this OK. */
6602 if (TREE_CODE (expr
) == STRING_CST
)
6604 if (complain
& tf_error
)
6605 error ("%qE is not a valid template argument for type %qT "
6606 "because string literals can never be used in this context",
6611 /* Add the ADDR_EXPR now for the benefit of
6612 value_dependent_expression_p. */
6613 if (TYPE_PTROBV_P (type
)
6614 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
6616 expr
= decay_conversion (expr
, complain
);
6617 if (expr
== error_mark_node
)
6618 return error_mark_node
;
6621 /* If we are in a template, EXPR may be non-dependent, but still
6622 have a syntactic, rather than semantic, form. For example, EXPR
6623 might be a SCOPE_REF, rather than the VAR_DECL to which the
6624 SCOPE_REF refers. Preserving the qualifying scope is necessary
6625 so that access checking can be performed when the template is
6626 instantiated -- but here we need the resolved form so that we can
6627 convert the argument. */
6628 bool non_dep
= false;
6629 if (TYPE_REF_OBJ_P (type
)
6630 && has_value_dependent_address (expr
))
6631 /* If we want the address and it's value-dependent, don't fold. */;
6632 else if (processing_template_decl
6633 && is_nondependent_constant_expression (expr
))
6635 if (error_operand_p (expr
))
6636 return error_mark_node
;
6637 expr_type
= TREE_TYPE (expr
);
6639 /* If the argument is non-dependent, perform any conversions in
6640 non-dependent context as well. */
6641 processing_template_decl_sentinel
s (non_dep
);
6643 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
6645 if (value_dependent_expression_p (expr
))
6646 expr
= canonicalize_expr_argument (expr
, complain
);
6648 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
6649 to a non-type argument of "nullptr". */
6650 if (NULLPTR_TYPE_P (expr_type
) && TYPE_PTR_OR_PTRMEM_P (type
))
6651 expr
= fold_simple (convert (type
, expr
));
6653 /* In C++11, integral or enumeration non-type template arguments can be
6654 arbitrary constant expressions. Pointer and pointer to
6655 member arguments can be general constant expressions that evaluate
6656 to a null value, but otherwise still need to be of a specific form. */
6657 if (cxx_dialect
>= cxx11
)
6659 if (TREE_CODE (expr
) == PTRMEM_CST
)
6660 /* A PTRMEM_CST is already constant, and a valid template
6661 argument for a parameter of pointer to member type, we just want
6662 to leave it in that form rather than lower it to a
6664 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
6665 || cxx_dialect
>= cxx17
)
6667 /* C++17: A template-argument for a non-type template-parameter shall
6668 be a converted constant expression (8.20) of the type of the
6669 template-parameter. */
6670 expr
= build_converted_constant_expr (type
, expr
, complain
);
6671 if (expr
== error_mark_node
)
6672 return error_mark_node
;
6673 expr
= maybe_constant_value (expr
);
6674 expr
= convert_from_reference (expr
);
6676 else if (TYPE_PTR_OR_PTRMEM_P (type
))
6678 tree folded
= maybe_constant_value (expr
);
6679 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
6680 : null_member_pointer_value_p (folded
))
6685 if (TYPE_REF_P (type
))
6686 expr
= mark_lvalue_use (expr
);
6688 expr
= mark_rvalue_use (expr
);
6690 /* HACK: Due to double coercion, we can get a
6691 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
6692 which is the tree that we built on the first call (see
6693 below when coercing to reference to object or to reference to
6694 function). We just strip everything and get to the arg.
6695 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
6697 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
6699 tree probe_type
, probe
= expr
;
6700 if (REFERENCE_REF_P (probe
))
6701 probe
= TREE_OPERAND (probe
, 0);
6702 probe_type
= TREE_TYPE (probe
);
6703 if (TREE_CODE (probe
) == NOP_EXPR
)
6705 /* ??? Maybe we could use convert_from_reference here, but we
6706 would need to relax its constraints because the NOP_EXPR
6707 could actually change the type to something more cv-qualified,
6708 and this is not folded by convert_from_reference. */
6709 tree addr
= TREE_OPERAND (probe
, 0);
6710 if (TYPE_REF_P (probe_type
)
6711 && TREE_CODE (addr
) == ADDR_EXPR
6712 && TYPE_PTR_P (TREE_TYPE (addr
))
6713 && (same_type_ignoring_top_level_qualifiers_p
6714 (TREE_TYPE (probe_type
),
6715 TREE_TYPE (TREE_TYPE (addr
)))))
6717 expr
= TREE_OPERAND (addr
, 0);
6718 expr_type
= TREE_TYPE (probe_type
);
6723 /* [temp.arg.nontype]/5, bullet 1
6725 For a non-type template-parameter of integral or enumeration type,
6726 integral promotions (_conv.prom_) and integral conversions
6727 (_conv.integral_) are applied. */
6728 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6730 if (cxx_dialect
< cxx11
)
6732 tree t
= build_converted_constant_expr (type
, expr
, complain
);
6733 t
= maybe_constant_value (t
);
6734 if (t
!= error_mark_node
)
6738 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
6739 return error_mark_node
;
6741 /* Notice that there are constant expressions like '4 % 0' which
6742 do not fold into integer constants. */
6743 if (TREE_CODE (expr
) != INTEGER_CST
6744 && !value_dependent_expression_p (expr
))
6746 if (complain
& tf_error
)
6748 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
6749 if (!require_potential_constant_expression (expr
))
6750 expr
= error_mark_node
;
6752 expr
= cxx_constant_value (expr
);
6753 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
6754 inform (loc
, "in template argument for type %qT", type
);
6755 if (expr
== error_mark_node
)
6757 /* else cxx_constant_value complained but gave us
6758 a real constant, so go ahead. */
6759 if (TREE_CODE (expr
) != INTEGER_CST
)
6761 /* Some assemble time constant expressions like
6762 (intptr_t)&&lab1 - (intptr_t)&&lab2 or
6763 4 + (intptr_t)&&var satisfy reduced_constant_expression_p
6764 as we can emit them into .rodata initializers of
6765 variables, yet they can't fold into an INTEGER_CST at
6766 compile time. Refuse them here. */
6767 gcc_checking_assert (reduced_constant_expression_p (expr
));
6768 error_at (loc
, "template argument %qE for type %qT not "
6769 "a constant integer", expr
, type
);
6777 /* Avoid typedef problems. */
6778 if (TREE_TYPE (expr
) != type
)
6779 expr
= fold_convert (type
, expr
);
6781 /* [temp.arg.nontype]/5, bullet 2
6783 For a non-type template-parameter of type pointer to object,
6784 qualification conversions (_conv.qual_) and the array-to-pointer
6785 conversion (_conv.array_) are applied. */
6786 else if (TYPE_PTROBV_P (type
))
6788 tree decayed
= expr
;
6790 /* Look through any NOP_EXPRs around an ADDR_EXPR, whether they come from
6791 decay_conversion or an explicit cast. If it's a problematic cast,
6792 we'll complain about it below. */
6793 if (TREE_CODE (expr
) == NOP_EXPR
)
6797 if (TREE_CODE (probe
) == ADDR_EXPR
6798 && TYPE_PTR_P (TREE_TYPE (probe
)))
6801 expr_type
= TREE_TYPE (expr
);
6805 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
6807 A template-argument for a non-type, non-template template-parameter
6808 shall be one of: [...]
6810 -- the name of a non-type template-parameter;
6811 -- the address of an object or function with external linkage, [...]
6812 expressed as "& id-expression" where the & is optional if the name
6813 refers to a function or array, or if the corresponding
6814 template-parameter is a reference.
6816 Here, we do not care about functions, as they are invalid anyway
6817 for a parameter of type pointer-to-object. */
6819 if (value_dependent_expression_p (expr
))
6820 /* Non-type template parameters are OK. */
6822 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6823 /* Null pointer values are OK in C++11. */;
6824 else if (TREE_CODE (expr
) != ADDR_EXPR
)
6828 if (complain
& tf_error
)
6829 error ("%qD is not a valid template argument "
6830 "because %qD is a variable, not the address of "
6831 "a variable", orig_expr
, expr
);
6834 if (POINTER_TYPE_P (expr_type
))
6836 if (complain
& tf_error
)
6837 error ("%qE is not a valid template argument for %qT "
6838 "because it is not the address of a variable",
6842 /* Other values, like integer constants, might be valid
6843 non-type arguments of some other type. */
6844 return error_mark_node
;
6848 tree decl
= TREE_OPERAND (expr
, 0);
6852 if (complain
& tf_error
)
6853 error ("%qE is not a valid template argument of type %qT "
6854 "because %qE is not a variable", orig_expr
, type
, decl
);
6857 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
6859 if (complain
& tf_error
)
6860 error ("%qE is not a valid template argument of type %qT "
6861 "because %qD does not have external linkage",
6862 orig_expr
, type
, decl
);
6865 else if ((cxx_dialect
>= cxx11
&& cxx_dialect
< cxx17
)
6866 && decl_linkage (decl
) == lk_none
)
6868 if (complain
& tf_error
)
6869 error ("%qE is not a valid template argument of type %qT "
6870 "because %qD has no linkage", orig_expr
, type
, decl
);
6873 /* C++17: For a non-type template-parameter of reference or pointer
6874 type, the value of the constant expression shall not refer to (or
6875 for a pointer type, shall not be the address of):
6876 * a subobject (4.5),
6877 * a temporary object (15.2),
6878 * a string literal (5.13.5),
6879 * the result of a typeid expression (8.2.8), or
6880 * a predefined __func__ variable (11.4.1). */
6881 else if (DECL_ARTIFICIAL (decl
))
6883 if (complain
& tf_error
)
6884 error ("the address of %qD is not a valid template argument",
6888 else if (!same_type_ignoring_top_level_qualifiers_p
6889 (strip_array_types (TREE_TYPE (type
)),
6890 strip_array_types (TREE_TYPE (decl
))))
6892 if (complain
& tf_error
)
6893 error ("the address of the %qT subobject of %qD is not a "
6894 "valid template argument", TREE_TYPE (type
), decl
);
6897 else if (!TREE_STATIC (decl
) && !DECL_EXTERNAL (decl
))
6899 if (complain
& tf_error
)
6900 error ("the address of %qD is not a valid template argument "
6901 "because it does not have static storage duration",
6909 expr
= perform_qualification_conversions (type
, expr
);
6910 if (expr
== error_mark_node
)
6911 return error_mark_node
;
6913 /* [temp.arg.nontype]/5, bullet 3
6915 For a non-type template-parameter of type reference to object, no
6916 conversions apply. The type referred to by the reference may be more
6917 cv-qualified than the (otherwise identical) type of the
6918 template-argument. The template-parameter is bound directly to the
6919 template-argument, which must be an lvalue. */
6920 else if (TYPE_REF_OBJ_P (type
))
6922 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
6924 return error_mark_node
;
6926 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
6928 if (complain
& tf_error
)
6929 error ("%qE is not a valid template argument for type %qT "
6930 "because of conflicts in cv-qualification", expr
, type
);
6934 if (!lvalue_p (expr
))
6936 if (complain
& tf_error
)
6937 error ("%qE is not a valid template argument for type %qT "
6938 "because it is not an lvalue", expr
, type
);
6942 /* [temp.arg.nontype]/1
6944 A template-argument for a non-type, non-template template-parameter
6945 shall be one of: [...]
6947 -- the address of an object or function with external linkage. */
6948 if (INDIRECT_REF_P (expr
)
6949 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
6951 expr
= TREE_OPERAND (expr
, 0);
6954 if (complain
& tf_error
)
6955 error ("%q#D is not a valid template argument for type %qT "
6956 "because a reference variable does not have a constant "
6957 "address", expr
, type
);
6962 if (TYPE_REF_OBJ_P (TREE_TYPE (expr
))
6963 && value_dependent_expression_p (expr
))
6964 /* OK, dependent reference. We don't want to ask whether a DECL is
6965 itself value-dependent, since what we want here is its address. */;
6970 if (complain
& tf_error
)
6971 error ("%qE is not a valid template argument for type %qT "
6972 "because it is not an object with linkage",
6977 /* DR 1155 allows internal linkage in C++11 and up. */
6978 linkage_kind linkage
= decl_linkage (expr
);
6979 if (linkage
< (cxx_dialect
>= cxx11
? lk_internal
: lk_external
))
6981 if (complain
& tf_error
)
6982 error ("%qE is not a valid template argument for type %qT "
6983 "because object %qD does not have linkage",
6988 expr
= build_address (expr
);
6991 if (!same_type_p (type
, TREE_TYPE (expr
)))
6992 expr
= build_nop (type
, expr
);
6994 /* [temp.arg.nontype]/5, bullet 4
6996 For a non-type template-parameter of type pointer to function, only
6997 the function-to-pointer conversion (_conv.func_) is applied. If the
6998 template-argument represents a set of overloaded functions (or a
6999 pointer to such), the matching function is selected from the set
7001 else if (TYPE_PTRFN_P (type
))
7003 /* If the argument is a template-id, we might not have enough
7004 context information to decay the pointer. */
7005 if (!type_unknown_p (expr_type
))
7007 expr
= decay_conversion (expr
, complain
);
7008 if (expr
== error_mark_node
)
7009 return error_mark_node
;
7012 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
7013 /* Null pointer values are OK in C++11. */
7014 return perform_qualification_conversions (type
, expr
);
7016 expr
= convert_nontype_argument_function (type
, expr
, complain
);
7017 if (!expr
|| expr
== error_mark_node
)
7020 /* [temp.arg.nontype]/5, bullet 5
7022 For a non-type template-parameter of type reference to function, no
7023 conversions apply. If the template-argument represents a set of
7024 overloaded functions, the matching function is selected from the set
7026 else if (TYPE_REFFN_P (type
))
7028 if (TREE_CODE (expr
) == ADDR_EXPR
)
7030 if (complain
& tf_error
)
7032 error ("%qE is not a valid template argument for type %qT "
7033 "because it is a pointer", expr
, type
);
7034 inform (input_location
, "try using %qE instead",
7035 TREE_OPERAND (expr
, 0));
7040 expr
= convert_nontype_argument_function (type
, expr
, complain
);
7041 if (!expr
|| expr
== error_mark_node
)
7044 /* [temp.arg.nontype]/5, bullet 6
7046 For a non-type template-parameter of type pointer to member function,
7047 no conversions apply. If the template-argument represents a set of
7048 overloaded member functions, the matching member function is selected
7049 from the set (_over.over_). */
7050 else if (TYPE_PTRMEMFUNC_P (type
))
7052 expr
= instantiate_type (type
, expr
, tf_none
);
7053 if (expr
== error_mark_node
)
7054 return error_mark_node
;
7056 /* [temp.arg.nontype] bullet 1 says the pointer to member
7057 expression must be a pointer-to-member constant. */
7058 if (!value_dependent_expression_p (expr
)
7059 && !check_valid_ptrmem_cst_expr (type
, expr
, complain
))
7062 /* Repeated conversion can't deal with a conversion that turns PTRMEM_CST
7063 into a CONSTRUCTOR, so build up a new PTRMEM_CST instead. */
7064 if (fnptr_conv_p (type
, TREE_TYPE (expr
)))
7065 expr
= make_ptrmem_cst (type
, PTRMEM_CST_MEMBER (expr
));
7067 /* [temp.arg.nontype]/5, bullet 7
7069 For a non-type template-parameter of type pointer to data member,
7070 qualification conversions (_conv.qual_) are applied. */
7071 else if (TYPE_PTRDATAMEM_P (type
))
7073 /* [temp.arg.nontype] bullet 1 says the pointer to member
7074 expression must be a pointer-to-member constant. */
7075 if (!value_dependent_expression_p (expr
)
7076 && !check_valid_ptrmem_cst_expr (type
, expr
, complain
))
7079 expr
= perform_qualification_conversions (type
, expr
);
7080 if (expr
== error_mark_node
)
7083 else if (NULLPTR_TYPE_P (type
))
7085 if (!NULLPTR_TYPE_P (TREE_TYPE (expr
)))
7087 if (complain
& tf_error
)
7088 error ("%qE is not a valid template argument for type %qT "
7089 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
7094 /* A template non-type parameter must be one of the above. */
7098 /* Sanity check: did we actually convert the argument to the
7100 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7101 (type
, TREE_TYPE (expr
)));
7102 return convert_from_reference (expr
);
7105 /* Subroutine of coerce_template_template_parms, which returns 1 if
7106 PARM_PARM and ARG_PARM match using the rule for the template
7107 parameters of template template parameters. Both PARM and ARG are
7108 template parameters; the rest of the arguments are the same as for
7109 coerce_template_template_parms.
7112 coerce_template_template_parm (tree parm
,
7114 tsubst_flags_t complain
,
7118 if (arg
== NULL_TREE
|| error_operand_p (arg
)
7119 || parm
== NULL_TREE
|| error_operand_p (parm
))
7122 if (TREE_CODE (arg
) != TREE_CODE (parm
))
7125 switch (TREE_CODE (parm
))
7128 /* We encounter instantiations of templates like
7129 template <template <template <class> class> class TT>
7132 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
7133 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
7135 if (!coerce_template_template_parms
7136 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
7142 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
7143 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
7144 /* Argument is a parameter pack but parameter is not. */
7149 /* The tsubst call is used to handle cases such as
7151 template <int> class C {};
7152 template <class T, template <T> class TT> class D {};
7155 i.e. the parameter list of TT depends on earlier parameters. */
7156 if (!uses_template_parms (TREE_TYPE (arg
)))
7158 tree t
= tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
);
7159 if (!uses_template_parms (t
)
7160 && !same_type_p (t
, TREE_TYPE (arg
)))
7164 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
7165 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
7166 /* Argument is a parameter pack but parameter is not. */
7178 /* Coerce template argument list ARGLIST for use with template
7179 template-parameter TEMPL. */
7182 coerce_template_args_for_ttp (tree templ
, tree arglist
,
7183 tsubst_flags_t complain
)
7185 /* Consider an example where a template template parameter declared as
7187 template <class T, class U = std::allocator<T> > class TT
7189 The template parameter level of T and U are one level larger than
7190 of TT. To proper process the default argument of U, say when an
7191 instantiation `TT<int>' is seen, we need to build the full
7192 arguments containing {int} as the innermost level. Outer levels,
7193 available when not appearing as default template argument, can be
7194 obtained from the arguments of the enclosing template.
7196 Suppose that TT is later substituted with std::vector. The above
7197 instantiation is `TT<int, std::allocator<T> >' with TT at
7198 level 1, and T at level 2, while the template arguments at level 1
7199 becomes {std::vector} and the inner level 2 is {int}. */
7201 tree outer
= DECL_CONTEXT (templ
);
7204 if (DECL_TEMPLATE_SPECIALIZATION (outer
))
7205 /* We want arguments for the partial specialization, not arguments for
7206 the primary template. */
7207 outer
= template_parms_to_args (DECL_TEMPLATE_PARMS (outer
));
7209 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
7211 else if (current_template_parms
)
7213 /* This is an argument of the current template, so we haven't set
7214 DECL_CONTEXT yet. */
7215 tree relevant_template_parms
;
7217 /* Parameter levels that are greater than the level of the given
7218 template template parm are irrelevant. */
7219 relevant_template_parms
= current_template_parms
;
7220 while (TMPL_PARMS_DEPTH (relevant_template_parms
)
7221 != TEMPLATE_TYPE_LEVEL (TREE_TYPE (templ
)))
7222 relevant_template_parms
= TREE_CHAIN (relevant_template_parms
);
7224 outer
= template_parms_to_args (relevant_template_parms
);
7228 arglist
= add_to_template_args (outer
, arglist
);
7230 tree parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
7231 return coerce_template_parms (parmlist
, arglist
, templ
,
7233 /*require_all_args=*/true,
7234 /*use_default_args=*/true);
7237 /* A cache of template template parameters with match-all default
7239 static GTY((deletable
)) hash_map
<tree
,tree
> *defaulted_ttp_cache
;
7241 store_defaulted_ttp (tree v
, tree t
)
7243 if (!defaulted_ttp_cache
)
7244 defaulted_ttp_cache
= hash_map
<tree
,tree
>::create_ggc (13);
7245 defaulted_ttp_cache
->put (v
, t
);
7248 lookup_defaulted_ttp (tree v
)
7250 if (defaulted_ttp_cache
)
7251 if (tree
*p
= defaulted_ttp_cache
->get (v
))
7256 /* T is a bound template template-parameter. Copy its arguments into default
7257 arguments of the template template-parameter's template parameters. */
7260 add_defaults_to_ttp (tree otmpl
)
7262 if (tree c
= lookup_defaulted_ttp (otmpl
))
7265 tree ntmpl
= copy_node (otmpl
);
7267 tree ntype
= copy_node (TREE_TYPE (otmpl
));
7268 TYPE_STUB_DECL (ntype
) = TYPE_NAME (ntype
) = ntmpl
;
7269 TYPE_MAIN_VARIANT (ntype
) = ntype
;
7270 TYPE_POINTER_TO (ntype
) = TYPE_REFERENCE_TO (ntype
) = NULL_TREE
;
7271 TYPE_NAME (ntype
) = ntmpl
;
7272 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
7274 tree idx
= TEMPLATE_TYPE_PARM_INDEX (ntype
)
7275 = copy_node (TEMPLATE_TYPE_PARM_INDEX (ntype
));
7276 TEMPLATE_PARM_DECL (idx
) = ntmpl
;
7277 TREE_TYPE (ntmpl
) = TREE_TYPE (idx
) = ntype
;
7279 tree oparms
= DECL_TEMPLATE_PARMS (otmpl
);
7280 tree parms
= DECL_TEMPLATE_PARMS (ntmpl
) = copy_node (oparms
);
7281 TREE_CHAIN (parms
) = TREE_CHAIN (oparms
);
7282 tree vec
= TREE_VALUE (parms
) = copy_node (TREE_VALUE (parms
));
7283 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
7285 tree o
= TREE_VEC_ELT (vec
, i
);
7286 if (!template_parameter_pack_p (TREE_VALUE (o
)))
7288 tree n
= TREE_VEC_ELT (vec
, i
) = copy_node (o
);
7289 TREE_PURPOSE (n
) = any_targ_node
;
7293 store_defaulted_ttp (otmpl
, ntmpl
);
7297 /* ARG is a bound potential template template-argument, and PARGS is a list
7298 of arguments for the corresponding template template-parameter. Adjust
7299 PARGS as appropriate for application to ARG's template, and if ARG is a
7300 BOUND_TEMPLATE_TEMPLATE_PARM, possibly adjust it to add default template
7301 arguments to the template template parameter. */
7304 coerce_ttp_args_for_tta (tree
& arg
, tree pargs
, tsubst_flags_t complain
)
7306 ++processing_template_decl
;
7307 tree arg_tmpl
= TYPE_TI_TEMPLATE (arg
);
7308 if (DECL_TEMPLATE_TEMPLATE_PARM_P (arg_tmpl
))
7310 /* When comparing two template template-parameters in partial ordering,
7311 rewrite the one currently being used as an argument to have default
7312 arguments for all parameters. */
7313 arg_tmpl
= add_defaults_to_ttp (arg_tmpl
);
7314 pargs
= coerce_template_args_for_ttp (arg_tmpl
, pargs
, complain
);
7315 if (pargs
!= error_mark_node
)
7316 arg
= bind_template_template_parm (TREE_TYPE (arg_tmpl
),
7317 TYPE_TI_ARGS (arg
));
7322 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (arg_tmpl
));
7323 pargs
= coerce_template_parms (aparms
, pargs
, arg_tmpl
, complain
,
7324 /*require_all*/true,
7325 /*use_default*/true);
7327 --processing_template_decl
;
7331 /* Subroutine of unify for the case when PARM is a
7332 BOUND_TEMPLATE_TEMPLATE_PARM. */
7335 unify_bound_ttp_args (tree tparms
, tree targs
, tree parm
, tree
& arg
,
7338 tree parmvec
= TYPE_TI_ARGS (parm
);
7339 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
7341 /* The template template parm might be variadic and the argument
7342 not, so flatten both argument lists. */
7343 parmvec
= expand_template_argument_pack (parmvec
);
7344 argvec
= expand_template_argument_pack (argvec
);
7348 /* In keeping with P0522R0, adjust P's template arguments
7349 to apply to A's template; then flatten it again. */
7350 tree nparmvec
= parmvec
;
7351 nparmvec
= coerce_ttp_args_for_tta (arg
, parmvec
, tf_none
);
7352 nparmvec
= expand_template_argument_pack (nparmvec
);
7354 if (unify (tparms
, targs
, nparmvec
, argvec
,
7355 UNIFY_ALLOW_NONE
, explain_p
))
7358 /* If the P0522 adjustment eliminated a pack expansion, deduce
7361 && TREE_VEC_LENGTH (nparmvec
) < TREE_VEC_LENGTH (parmvec
)
7362 && unify_pack_expansion (tparms
, targs
, parmvec
, argvec
,
7363 DEDUCE_EXACT
, /*sub*/true, explain_p
))
7368 /* Deduce arguments T, i from TT<T> or TT<i>.
7369 We check each element of PARMVEC and ARGVEC individually
7370 rather than the whole TREE_VEC since they can have
7371 different number of elements, which is allowed under N2555. */
7373 int len
= TREE_VEC_LENGTH (parmvec
);
7375 /* Check if the parameters end in a pack, making them
7377 int parm_variadic_p
= 0;
7379 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
7380 parm_variadic_p
= 1;
7382 for (int i
= 0; i
< len
- parm_variadic_p
; ++i
)
7383 /* If the template argument list of P contains a pack
7384 expansion that is not the last template argument, the
7385 entire template argument list is a non-deduced
7387 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
7388 return unify_success (explain_p
);
7390 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
7391 return unify_too_few_arguments (explain_p
,
7392 TREE_VEC_LENGTH (argvec
), len
);
7394 for (int i
= 0; i
< len
- parm_variadic_p
; ++i
)
7395 if (unify (tparms
, targs
,
7396 TREE_VEC_ELT (parmvec
, i
),
7397 TREE_VEC_ELT (argvec
, i
),
7398 UNIFY_ALLOW_NONE
, explain_p
))
7402 && unify_pack_expansion (tparms
, targs
,
7405 /*subr=*/true, explain_p
))
7412 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
7413 template template parameters. Both PARM_PARMS and ARG_PARMS are
7414 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
7417 Consider the example:
7418 template <class T> class A;
7419 template<template <class U> class TT> class B;
7421 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
7422 the parameters to A, and OUTER_ARGS contains A. */
7425 coerce_template_template_parms (tree parm_parms
,
7427 tsubst_flags_t complain
,
7431 int nparms
, nargs
, i
;
7435 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
7436 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
7438 nparms
= TREE_VEC_LENGTH (parm_parms
);
7439 nargs
= TREE_VEC_LENGTH (arg_parms
);
7443 /* P0522R0: A template template-parameter P is at least as specialized as
7444 a template template-argument A if, given the following rewrite to two
7445 function templates, the function template corresponding to P is at
7446 least as specialized as the function template corresponding to A
7447 according to the partial ordering rules for function templates
7448 ([temp.func.order]). Given an invented class template X with the
7449 template parameter list of A (including default arguments):
7451 * Each of the two function templates has the same template parameters,
7452 respectively, as P or A.
7454 * Each function template has a single function parameter whose type is
7455 a specialization of X with template arguments corresponding to the
7456 template parameters from the respective function template where, for
7457 each template parameter PP in the template parameter list of the
7458 function template, a corresponding template argument AA is formed. If
7459 PP declares a parameter pack, then AA is the pack expansion
7460 PP... ([temp.variadic]); otherwise, AA is the id-expression PP.
7462 If the rewrite produces an invalid type, then P is not at least as
7463 specialized as A. */
7465 /* So coerce P's args to apply to A's parms, and then deduce between A's
7466 args and the converted args. If that succeeds, A is at least as
7467 specialized as P, so they match.*/
7468 tree pargs
= template_parms_level_to_args (parm_parms
);
7469 ++processing_template_decl
;
7470 pargs
= coerce_template_parms (arg_parms
, pargs
, NULL_TREE
, tf_none
,
7471 /*require_all*/true, /*use_default*/true);
7472 --processing_template_decl
;
7473 if (pargs
!= error_mark_node
)
7475 tree targs
= make_tree_vec (nargs
);
7476 tree aargs
= template_parms_level_to_args (arg_parms
);
7477 if (!unify (arg_parms
, targs
, aargs
, pargs
, UNIFY_ALLOW_NONE
,
7483 /* Determine whether we have a parameter pack at the end of the
7484 template template parameter's template parameter list. */
7485 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
7487 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
7489 if (error_operand_p (parm
))
7492 switch (TREE_CODE (parm
))
7496 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
7501 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
7511 && !(variadic_p
&& nargs
>= nparms
- 1))
7514 /* Check all of the template parameters except the parameter pack at
7515 the end (if any). */
7516 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
7518 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
7519 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
7522 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
7523 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
7525 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
7533 /* Check each of the template parameters in the template
7534 argument against the template parameter pack at the end of
7535 the template template parameter. */
7536 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
7539 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
7541 for (; i
< nargs
; ++i
)
7543 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
7546 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
7548 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
7557 /* Verifies that the deduced template arguments (in TARGS) for the
7558 template template parameters (in TPARMS) represent valid bindings,
7559 by comparing the template parameter list of each template argument
7560 to the template parameter list of its corresponding template
7561 template parameter, in accordance with DR150. This
7562 routine can only be called after all template arguments have been
7563 deduced. It will return TRUE if all of the template template
7564 parameter bindings are okay, FALSE otherwise. */
7566 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
7568 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
7571 /* We're dealing with template parms in this process. */
7572 ++processing_template_decl
;
7574 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
7576 for (i
= 0; i
< ntparms
; ++i
)
7578 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
7579 tree targ
= TREE_VEC_ELT (targs
, i
);
7581 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
7583 tree packed_args
= NULL_TREE
;
7586 if (ARGUMENT_PACK_P (targ
))
7588 /* Look inside the argument pack. */
7589 packed_args
= ARGUMENT_PACK_ARGS (targ
);
7590 len
= TREE_VEC_LENGTH (packed_args
);
7593 for (idx
= 0; idx
< len
; ++idx
)
7595 tree targ_parms
= NULL_TREE
;
7598 /* Extract the next argument from the argument
7600 targ
= TREE_VEC_ELT (packed_args
, idx
);
7602 if (PACK_EXPANSION_P (targ
))
7603 /* Look at the pattern of the pack expansion. */
7604 targ
= PACK_EXPANSION_PATTERN (targ
);
7606 /* Extract the template parameters from the template
7608 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
7609 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
7610 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
7611 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
7613 /* Verify that we can coerce the template template
7614 parameters from the template argument to the template
7615 parameter. This requires an exact match. */
7617 && !coerce_template_template_parms
7618 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
7633 --processing_template_decl
;
7637 /* Since type attributes aren't mangled, we need to strip them from
7638 template type arguments. */
7641 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
7643 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
7645 bool removed_attributes
= false;
7646 tree canon
= strip_typedefs (arg
, &removed_attributes
);
7647 if (removed_attributes
7648 && (complain
& tf_warning
))
7649 warning (OPT_Wignored_attributes
,
7650 "ignoring attributes on template argument %qT", arg
);
7654 /* And from inside dependent non-type arguments like sizeof(Type). */
7657 canonicalize_expr_argument (tree arg
, tsubst_flags_t complain
)
7659 if (!arg
|| arg
== error_mark_node
)
7661 bool removed_attributes
= false;
7662 tree canon
= strip_typedefs_expr (arg
, &removed_attributes
);
7663 if (removed_attributes
7664 && (complain
& tf_warning
))
7665 warning (OPT_Wignored_attributes
,
7666 "ignoring attributes in template argument %qE", arg
);
7670 // A template declaration can be substituted for a constrained
7671 // template template parameter only when the argument is more
7672 // constrained than the parameter.
7674 is_compatible_template_arg (tree parm
, tree arg
)
7676 tree parm_cons
= get_constraints (parm
);
7678 /* For now, allow constrained template template arguments
7679 and unconstrained template template parameters. */
7680 if (parm_cons
== NULL_TREE
)
7683 tree arg_cons
= get_constraints (arg
);
7685 // If the template parameter is constrained, we need to rewrite its
7686 // constraints in terms of the ARG's template parameters. This ensures
7687 // that all of the template parameter types will have the same depth.
7689 // Note that this is only valid when coerce_template_template_parm is
7690 // true for the innermost template parameters of PARM and ARG. In other
7691 // words, because coercion is successful, this conversion will be valid.
7694 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (arg
));
7695 parm_cons
= tsubst_constraint_info (parm_cons
,
7696 INNERMOST_TEMPLATE_ARGS (args
),
7697 tf_none
, NULL_TREE
);
7698 if (parm_cons
== error_mark_node
)
7702 return subsumes (parm_cons
, arg_cons
);
7705 // Convert a placeholder argument into a binding to the original
7706 // parameter. The original parameter is saved as the TREE_TYPE of
7709 convert_wildcard_argument (tree parm
, tree arg
)
7711 TREE_TYPE (arg
) = parm
;
7715 /* We can't fully resolve ARG given as a non-type template argument to TYPE,
7716 because one of them is dependent. But we need to represent the
7717 conversion for the benefit of cp_tree_equal. */
7720 maybe_convert_nontype_argument (tree type
, tree arg
)
7722 /* Auto parms get no conversion. */
7723 if (type_uses_auto (type
))
7725 /* We don't need or want to add this conversion now if we're going to use the
7726 argument for deduction. */
7727 if (value_dependent_expression_p (arg
))
7730 type
= cv_unqualified (type
);
7731 tree argtype
= TREE_TYPE (arg
);
7732 if (same_type_p (type
, argtype
))
7735 arg
= build1 (IMPLICIT_CONV_EXPR
, type
, arg
);
7736 IMPLICIT_CONV_EXPR_NONTYPE_ARG (arg
) = true;
7740 /* Convert the indicated template ARG as necessary to match the
7741 indicated template PARM. Returns the converted ARG, or
7742 error_mark_node if the conversion was unsuccessful. Error and
7743 warning messages are issued under control of COMPLAIN. This
7744 conversion is for the Ith parameter in the parameter list. ARGS is
7745 the full set of template arguments deduced so far. */
7748 convert_template_argument (tree parm
,
7751 tsubst_flags_t complain
,
7757 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
7759 if (parm
== error_mark_node
)
7760 return error_mark_node
;
7762 /* Trivially convert placeholders. */
7763 if (TREE_CODE (arg
) == WILDCARD_DECL
)
7764 return convert_wildcard_argument (parm
, arg
);
7766 if (arg
== any_targ_node
)
7769 if (TREE_CODE (arg
) == TREE_LIST
7770 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
7772 /* The template argument was the name of some
7773 member function. That's usually
7774 invalid, but static members are OK. In any
7775 case, grab the underlying fields/functions
7776 and issue an error later if required. */
7777 orig_arg
= TREE_VALUE (arg
);
7778 TREE_TYPE (arg
) = unknown_type_node
;
7783 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
7784 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
7785 || requires_tmpl_type
);
7787 /* When determining whether an argument pack expansion is a template,
7788 look at the pattern. */
7789 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
7790 arg
= PACK_EXPANSION_PATTERN (arg
);
7792 /* Deal with an injected-class-name used as a template template arg. */
7793 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
7795 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
7796 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7798 if (cxx_dialect
>= cxx11
)
7799 /* OK under DR 1004. */;
7800 else if (complain
& tf_warning_or_error
)
7801 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
7802 " used as template template argument", TYPE_NAME (arg
));
7803 else if (flag_pedantic_errors
)
7811 ((TREE_CODE (arg
) == TEMPLATE_DECL
7812 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
7813 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
7814 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7815 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
7818 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7819 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
7820 arg
= TYPE_STUB_DECL (arg
);
7822 is_type
= TYPE_P (arg
) || is_tmpl_type
;
7824 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
7825 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
7827 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
7829 if (complain
& tf_error
)
7830 error ("invalid use of destructor %qE as a type", orig_arg
);
7831 return error_mark_node
;
7834 permerror (input_location
,
7835 "to refer to a type member of a template parameter, "
7836 "use %<typename %E%>", orig_arg
);
7838 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
7839 TREE_OPERAND (arg
, 1),
7845 if (is_type
!= requires_type
)
7849 if (complain
& tf_error
)
7851 error ("type/value mismatch at argument %d in template "
7852 "parameter list for %qD",
7855 inform (input_location
,
7856 " expected a constant of type %qT, got %qT",
7858 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
7859 else if (requires_tmpl_type
)
7860 inform (input_location
,
7861 " expected a class template, got %qE", orig_arg
);
7863 inform (input_location
,
7864 " expected a type, got %qE", orig_arg
);
7867 return error_mark_node
;
7869 if (is_tmpl_type
^ requires_tmpl_type
)
7871 if (in_decl
&& (complain
& tf_error
))
7873 error ("type/value mismatch at argument %d in template "
7874 "parameter list for %qD",
7877 inform (input_location
,
7878 " expected a type, got %qT", DECL_NAME (arg
));
7880 inform (input_location
,
7881 " expected a class template, got %qT", orig_arg
);
7883 return error_mark_node
;
7886 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7887 /* We already did the appropriate conversion when packing args. */
7891 if (requires_tmpl_type
)
7893 if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
7894 /* The number of argument required is not known yet.
7895 Just accept it for now. */
7899 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
7902 /* Strip alias templates that are equivalent to another
7904 arg
= get_underlying_template (arg
);
7905 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
7907 if (coerce_template_template_parms (parmparm
, argparm
,
7913 /* TEMPLATE_TEMPLATE_PARM node is preferred over
7915 if (val
!= error_mark_node
)
7917 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
7918 val
= TREE_TYPE (val
);
7919 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
7920 val
= make_pack_expansion (val
, complain
);
7925 if (in_decl
&& (complain
& tf_error
))
7927 error ("type/value mismatch at argument %d in "
7928 "template parameter list for %qD",
7930 inform (input_location
,
7931 " expected a template of type %qD, got %qT",
7935 val
= error_mark_node
;
7938 // Check that the constraints are compatible before allowing the
7940 if (val
!= error_mark_node
)
7941 if (!is_compatible_template_arg (parm
, arg
))
7943 if (in_decl
&& (complain
& tf_error
))
7945 error ("constraint mismatch at argument %d in "
7946 "template parameter list for %qD",
7948 inform (input_location
, " expected %qD but got %qD",
7951 val
= error_mark_node
;
7957 /* We only form one instance of each template specialization.
7958 Therefore, if we use a non-canonical variant (i.e., a
7959 typedef), any future messages referring to the type will use
7960 the typedef, which is confusing if those future uses do not
7961 themselves also use the typedef. */
7963 val
= canonicalize_type_argument (val
, complain
);
7967 tree t
= TREE_TYPE (parm
);
7969 if (TEMPLATE_PARM_LEVEL (get_template_parm_index (parm
))
7970 > TMPL_ARGS_DEPTH (args
))
7971 /* We don't have enough levels of args to do any substitution. This
7972 can happen in the context of -fnew-ttp-matching. */;
7973 else if (tree a
= type_uses_auto (t
))
7975 t
= do_auto_deduction (t
, arg
, a
, complain
, adc_unify
, args
);
7976 if (t
== error_mark_node
)
7977 return error_mark_node
;
7980 t
= tsubst (t
, args
, complain
, in_decl
);
7982 if (invalid_nontype_parm_type_p (t
, complain
))
7983 return error_mark_node
;
7985 if (!type_dependent_expression_p (orig_arg
)
7986 && !uses_template_parms (t
))
7987 /* We used to call digest_init here. However, digest_init
7988 will report errors, which we don't want when complain
7989 is zero. More importantly, digest_init will try too
7990 hard to convert things: for example, `0' should not be
7991 converted to pointer type at this point according to
7992 the standard. Accepting this is not merely an
7993 extension, since deciding whether or not these
7994 conversions can occur is part of determining which
7995 function template to call, or whether a given explicit
7996 argument specification is valid. */
7997 val
= convert_nontype_argument (t
, orig_arg
, complain
);
8000 val
= canonicalize_expr_argument (orig_arg
, complain
);
8001 val
= maybe_convert_nontype_argument (t
, val
);
8005 if (val
== NULL_TREE
)
8006 val
= error_mark_node
;
8007 else if (val
== error_mark_node
&& (complain
& tf_error
))
8008 error ("could not convert template argument %qE from %qT to %qT",
8009 orig_arg
, TREE_TYPE (orig_arg
), t
);
8011 if (INDIRECT_REF_P (val
))
8013 /* Reject template arguments that are references to built-in
8014 functions with no library fallbacks. */
8015 const_tree inner
= TREE_OPERAND (val
, 0);
8016 const_tree innertype
= TREE_TYPE (inner
);
8018 && TYPE_REF_P (innertype
)
8019 && TREE_CODE (TREE_TYPE (innertype
)) == FUNCTION_TYPE
8020 && TREE_OPERAND_LENGTH (inner
) > 0
8021 && reject_gcc_builtin (TREE_OPERAND (inner
, 0)))
8022 return error_mark_node
;
8025 if (TREE_CODE (val
) == SCOPE_REF
)
8027 /* Strip typedefs from the SCOPE_REF. */
8028 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
8029 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
8031 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
8032 QUALIFIED_NAME_IS_TEMPLATE (val
));
8039 /* Coerces the remaining template arguments in INNER_ARGS (from
8040 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
8041 Returns the coerced argument pack. PARM_IDX is the position of this
8042 parameter in the template parameter list. ARGS is the original
8043 template argument list. */
8045 coerce_template_parameter_pack (tree parms
,
8053 tsubst_flags_t complain
)
8055 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
8056 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
8059 tree packed_parms
= NULL_TREE
;
8061 if (arg_idx
> nargs
)
8064 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
8066 /* When the template parameter is a non-type template parameter pack
8067 or template template parameter pack whose type or template
8068 parameters use parameter packs, we know exactly how many arguments
8069 we are looking for. Build a vector of the instantiated decls for
8070 these template parameters in PACKED_PARMS. */
8071 /* We can't use make_pack_expansion here because it would interpret a
8072 _DECL as a use rather than a declaration. */
8073 tree decl
= TREE_VALUE (parm
);
8074 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
8075 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
8076 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
8077 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
8079 TREE_VEC_LENGTH (args
)--;
8080 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
8081 TREE_VEC_LENGTH (args
)++;
8083 if (packed_parms
== error_mark_node
)
8084 return error_mark_node
;
8086 /* If we're doing a partial instantiation of a member template,
8087 verify that all of the types used for the non-type
8088 template parameter pack are, in fact, valid for non-type
8089 template parameters. */
8091 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
8093 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
8094 for (j
= 0; j
< len
; ++j
)
8096 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
8097 if (invalid_nontype_parm_type_p (t
, complain
))
8098 return error_mark_node
;
8100 /* We don't know how many args we have yet, just
8101 use the unconverted ones for now. */
8105 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
8107 /* Check if we have a placeholder pack, which indicates we're
8108 in the context of a introduction list. In that case we want
8109 to match this pack to the single placeholder. */
8110 else if (arg_idx
< nargs
8111 && TREE_CODE (TREE_VEC_ELT (inner_args
, arg_idx
)) == WILDCARD_DECL
8112 && WILDCARD_PACK_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
8114 nargs
= arg_idx
+ 1;
8115 packed_args
= make_tree_vec (1);
8118 packed_args
= make_tree_vec (nargs
- arg_idx
);
8120 /* Convert the remaining arguments, which will be a part of the
8121 parameter pack "parm". */
8122 int first_pack_arg
= arg_idx
;
8123 for (; arg_idx
< nargs
; ++arg_idx
)
8125 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
8126 tree actual_parm
= TREE_VALUE (parm
);
8127 int pack_idx
= arg_idx
- first_pack_arg
;
8131 /* Once we've packed as many args as we have types, stop. */
8132 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
8134 else if (PACK_EXPANSION_P (arg
))
8135 /* We don't know how many args we have yet, just
8136 use the unconverted ones for now. */
8139 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
8142 if (arg
== error_mark_node
)
8144 if (complain
& tf_error
)
8145 error ("template argument %d is invalid", arg_idx
+ 1);
8148 arg
= convert_template_argument (actual_parm
,
8149 arg
, new_args
, complain
, parm_idx
,
8151 if (arg
== error_mark_node
)
8153 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
8156 if (arg_idx
- first_pack_arg
< TREE_VEC_LENGTH (packed_args
)
8157 && TREE_VEC_LENGTH (packed_args
) > 0)
8159 if (complain
& tf_error
)
8160 error ("wrong number of template arguments (%d, should be %d)",
8161 arg_idx
- first_pack_arg
, TREE_VEC_LENGTH (packed_args
));
8162 return error_mark_node
;
8165 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
8166 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
8167 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
8170 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
8171 TREE_CONSTANT (argument_pack
) = 1;
8174 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
8176 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
8177 TREE_VEC_LENGTH (packed_args
));
8178 return argument_pack
;
8181 /* Returns the number of pack expansions in the template argument vector
8185 pack_expansion_args_count (tree args
)
8190 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
8192 tree elt
= TREE_VEC_ELT (args
, i
);
8193 if (elt
&& PACK_EXPANSION_P (elt
))
8199 /* Convert all template arguments to their appropriate types, and
8200 return a vector containing the innermost resulting template
8201 arguments. If any error occurs, return error_mark_node. Error and
8202 warning messages are issued under control of COMPLAIN.
8204 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
8205 for arguments not specified in ARGS. Otherwise, if
8206 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
8207 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
8208 USE_DEFAULT_ARGS is false, then all arguments must be specified in
8212 coerce_template_parms (tree parms
,
8215 tsubst_flags_t complain
,
8216 bool require_all_args
,
8217 bool use_default_args
)
8219 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
8220 tree orig_inner_args
;
8223 tree new_inner_args
;
8224 int saved_unevaluated_operand
;
8225 int saved_inhibit_evaluation_warnings
;
8227 /* When used as a boolean value, indicates whether this is a
8228 variadic template parameter list. Since it's an int, we can also
8229 subtract it from nparms to get the number of non-variadic
8232 int variadic_args_p
= 0;
8233 int post_variadic_parms
= 0;
8235 /* Adjustment to nparms for fixed parameter packs. */
8236 int fixed_pack_adjust
= 0;
8237 int fixed_packs
= 0;
8240 /* Likewise for parameters with default arguments. */
8243 if (args
== error_mark_node
)
8244 return error_mark_node
;
8246 nparms
= TREE_VEC_LENGTH (parms
);
8248 /* Determine if there are any parameter packs or default arguments. */
8249 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
8251 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
8253 ++post_variadic_parms
;
8254 if (template_parameter_pack_p (TREE_VALUE (parm
)))
8256 if (TREE_PURPOSE (parm
))
8260 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
8261 /* If there are no parameters that follow a parameter pack, we need to
8262 expand any argument packs so that we can deduce a parameter pack from
8263 some non-packed args followed by an argument pack, as in variadic85.C.
8264 If there are such parameters, we need to leave argument packs intact
8265 so the arguments are assigned properly. This can happen when dealing
8266 with a nested class inside a partial specialization of a class
8267 template, as in variadic92.C, or when deducing a template parameter pack
8268 from a sub-declarator, as in variadic114.C. */
8269 if (!post_variadic_parms
)
8270 inner_args
= expand_template_argument_pack (inner_args
);
8272 /* Count any pack expansion args. */
8273 variadic_args_p
= pack_expansion_args_count (inner_args
);
8275 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
8276 if ((nargs
- variadic_args_p
> nparms
&& !variadic_p
)
8277 || (nargs
< nparms
- variadic_p
8280 && (!use_default_args
8281 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
8282 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
8285 if (complain
& tf_error
)
8287 if (variadic_p
|| default_p
)
8289 nparms
-= variadic_p
+ default_p
;
8290 error ("wrong number of template arguments "
8291 "(%d, should be at least %d)", nargs
, nparms
);
8294 error ("wrong number of template arguments "
8295 "(%d, should be %d)", nargs
, nparms
);
8298 inform (DECL_SOURCE_LOCATION (in_decl
),
8299 "provided for %qD", in_decl
);
8302 return error_mark_node
;
8304 /* We can't pass a pack expansion to a non-pack parameter of an alias
8305 template (DR 1430). */
8307 && (DECL_ALIAS_TEMPLATE_P (in_decl
)
8308 || concept_template_p (in_decl
))
8310 && nargs
- variadic_args_p
< nparms
- variadic_p
)
8312 if (complain
& tf_error
)
8314 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
8316 tree arg
= TREE_VEC_ELT (inner_args
, i
);
8317 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
8319 if (PACK_EXPANSION_P (arg
)
8320 && !template_parameter_pack_p (parm
))
8322 if (DECL_ALIAS_TEMPLATE_P (in_decl
))
8323 error_at (location_of (arg
),
8324 "pack expansion argument for non-pack parameter "
8325 "%qD of alias template %qD", parm
, in_decl
);
8327 error_at (location_of (arg
),
8328 "pack expansion argument for non-pack parameter "
8329 "%qD of concept %qD", parm
, in_decl
);
8330 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
8337 return error_mark_node
;
8340 /* We need to evaluate the template arguments, even though this
8341 template-id may be nested within a "sizeof". */
8342 saved_unevaluated_operand
= cp_unevaluated_operand
;
8343 cp_unevaluated_operand
= 0;
8344 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
8345 c_inhibit_evaluation_warnings
= 0;
8346 new_inner_args
= make_tree_vec (nparms
);
8347 new_args
= add_outermost_template_args (args
, new_inner_args
);
8348 int pack_adjust
= 0;
8349 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
8354 /* Get the Ith template parameter. */
8355 parm
= TREE_VEC_ELT (parms
, parm_idx
);
8357 if (parm
== error_mark_node
)
8359 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
8363 /* Calculate the next argument. */
8364 if (arg_idx
< nargs
)
8365 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
8369 if (template_parameter_pack_p (TREE_VALUE (parm
))
8370 && !(arg
&& ARGUMENT_PACK_P (arg
)))
8372 /* Some arguments will be placed in the
8373 template parameter pack PARM. */
8374 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
8375 inner_args
, arg_idx
,
8379 if (arg
== NULL_TREE
)
8381 /* We don't know how many args we have yet, just use the
8382 unconverted (and still packed) ones for now. */
8383 new_inner_args
= orig_inner_args
;
8388 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
8390 /* Store this argument. */
8391 if (arg
== error_mark_node
)
8394 /* We are done with all of the arguments. */
8400 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
8401 arg_idx
+= pack_adjust
;
8402 if (fixed_parameter_pack_p (TREE_VALUE (parm
)))
8405 fixed_pack_adjust
+= pack_adjust
;
8413 if (PACK_EXPANSION_P (arg
))
8415 /* "If every valid specialization of a variadic template
8416 requires an empty template parameter pack, the template is
8417 ill-formed, no diagnostic required." So check that the
8418 pattern works with this parameter. */
8419 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
8420 tree conv
= convert_template_argument (TREE_VALUE (parm
),
8424 if (conv
== error_mark_node
)
8426 if (complain
& tf_error
)
8427 inform (input_location
, "so any instantiation with a "
8428 "non-empty parameter pack would be ill-formed");
8431 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
8432 /* Recover from missing typename. */
8433 TREE_VEC_ELT (inner_args
, arg_idx
)
8434 = make_pack_expansion (conv
, complain
);
8436 /* We don't know how many args we have yet, just
8437 use the unconverted ones for now. */
8438 new_inner_args
= inner_args
;
8443 else if (require_all_args
)
8445 /* There must be a default arg in this case. */
8446 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
8448 /* The position of the first default template argument,
8449 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
8451 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
8452 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
8453 arg_idx
- pack_adjust
);
8458 if (arg
== error_mark_node
)
8460 if (complain
& tf_error
)
8461 error ("template argument %d is invalid", arg_idx
+ 1);
8465 /* This can occur if there was an error in the template
8466 parameter list itself (which we would already have
8467 reported) that we are trying to recover from, e.g., a class
8468 template with a parameter list such as
8469 template<typename..., typename> (cpp0x/variadic150.C). */
8472 /* This can also happen with a fixed parameter pack (71834). */
8473 if (arg_idx
>= nargs
)
8477 arg
= convert_template_argument (TREE_VALUE (parm
),
8478 arg
, new_args
, complain
,
8481 if (arg
== error_mark_node
)
8483 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
8485 cp_unevaluated_operand
= saved_unevaluated_operand
;
8486 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
8488 if (missing
|| arg_idx
< nargs
- variadic_args_p
)
8490 /* If we had fixed parameter packs, we didn't know how many arguments we
8491 actually needed earlier; now we do. */
8492 nparms
+= fixed_pack_adjust
;
8493 variadic_p
-= fixed_packs
;
8497 if (arg_idx
< nargs
)
8499 /* We had some pack expansion arguments that will only work if the packs
8500 are empty, but wait until instantiation time to complain.
8501 See variadic-ttp3.C. */
8502 int len
= nparms
+ (nargs
- arg_idx
);
8503 tree args
= make_tree_vec (len
);
8505 for (; i
< nparms
; ++i
)
8506 TREE_VEC_ELT (args
, i
) = TREE_VEC_ELT (new_inner_args
, i
);
8507 for (; i
< len
; ++i
, ++arg_idx
)
8508 TREE_VEC_ELT (args
, i
) = TREE_VEC_ELT (inner_args
,
8509 arg_idx
- pack_adjust
);
8510 new_inner_args
= args
;
8515 gcc_assert (!(complain
& tf_error
) || seen_error ());
8516 return error_mark_node
;
8519 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
8520 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
8521 TREE_VEC_LENGTH (new_inner_args
));
8523 return new_inner_args
;
8526 /* Convert all template arguments to their appropriate types, and
8527 return a vector containing the innermost resulting template
8528 arguments. If any error occurs, return error_mark_node. Error and
8529 warning messages are not issued.
8531 Note that no function argument deduction is performed, and default
8532 arguments are used to fill in unspecified arguments. */
8534 coerce_template_parms (tree parms
, tree args
, tree in_decl
)
8536 return coerce_template_parms (parms
, args
, in_decl
, tf_none
, true, true);
8539 /* Convert all template arguments to their appropriate type, and
8540 instantiate default arguments as needed. This returns a vector
8541 containing the innermost resulting template arguments, or
8542 error_mark_node if unsuccessful. */
8544 coerce_template_parms (tree parms
, tree args
, tree in_decl
,
8545 tsubst_flags_t complain
)
8547 return coerce_template_parms (parms
, args
, in_decl
, complain
, true, true);
8550 /* Like coerce_template_parms. If PARMS represents all template
8551 parameters levels, this function returns a vector of vectors
8552 representing all the resulting argument levels. Note that in this
8553 case, only the innermost arguments are coerced because the
8554 outermost ones are supposed to have been coerced already.
8556 Otherwise, if PARMS represents only (the innermost) vector of
8557 parameters, this function returns a vector containing just the
8558 innermost resulting arguments. */
8561 coerce_innermost_template_parms (tree parms
,
8564 tsubst_flags_t complain
,
8565 bool require_all_args
,
8566 bool use_default_args
)
8568 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
8569 int args_depth
= TMPL_ARGS_DEPTH (args
);
8572 if (parms_depth
> 1)
8574 coerced_args
= make_tree_vec (parms_depth
);
8578 for (level
= parms
, cur_depth
= parms_depth
;
8579 parms_depth
> 0 && level
!= NULL_TREE
;
8580 level
= TREE_CHAIN (level
), --cur_depth
)
8583 if (cur_depth
== args_depth
)
8584 l
= coerce_template_parms (TREE_VALUE (level
),
8585 args
, in_decl
, complain
,
8589 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
8591 if (l
== error_mark_node
)
8592 return error_mark_node
;
8594 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
8598 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
8599 args
, in_decl
, complain
,
8602 return coerced_args
;
8605 /* Returns 1 if template args OT and NT are equivalent. */
8608 template_args_equal (tree ot
, tree nt
, bool partial_order
/* = false */)
8612 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
8614 if (nt
== any_targ_node
|| ot
== any_targ_node
)
8617 if (TREE_CODE (nt
) == TREE_VEC
)
8618 /* For member templates */
8619 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
8620 else if (PACK_EXPANSION_P (ot
))
8621 return (PACK_EXPANSION_P (nt
)
8622 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
8623 PACK_EXPANSION_PATTERN (nt
))
8624 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
8625 PACK_EXPANSION_EXTRA_ARGS (nt
)));
8626 else if (ARGUMENT_PACK_P (ot
))
8631 if (!ARGUMENT_PACK_P (nt
))
8634 opack
= ARGUMENT_PACK_ARGS (ot
);
8635 npack
= ARGUMENT_PACK_ARGS (nt
);
8636 len
= TREE_VEC_LENGTH (opack
);
8637 if (TREE_VEC_LENGTH (npack
) != len
)
8639 for (i
= 0; i
< len
; ++i
)
8640 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
8641 TREE_VEC_ELT (npack
, i
)))
8645 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
8647 else if (TYPE_P (nt
))
8651 /* Don't treat an alias template specialization with dependent
8652 arguments as equivalent to its underlying type when used as a
8653 template argument; we need them to be distinct so that we
8654 substitute into the specialization arguments at instantiation
8655 time. And aliases can't be equivalent without being ==, so
8656 we don't need to look any deeper.
8658 During partial ordering, however, we need to treat them normally so
8659 that we can order uses of the same alias with different
8660 cv-qualification (79960). */
8662 && (TYPE_ALIAS_P (nt
) || TYPE_ALIAS_P (ot
)))
8665 return same_type_p (ot
, nt
);
8667 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
8671 /* Try to treat a template non-type argument that has been converted
8672 to the parameter type as equivalent to one that hasn't yet. */
8673 for (enum tree_code code1
= TREE_CODE (ot
);
8674 CONVERT_EXPR_CODE_P (code1
)
8675 || code1
== NON_LVALUE_EXPR
;
8676 code1
= TREE_CODE (ot
))
8677 ot
= TREE_OPERAND (ot
, 0);
8678 for (enum tree_code code2
= TREE_CODE (nt
);
8679 CONVERT_EXPR_CODE_P (code2
)
8680 || code2
== NON_LVALUE_EXPR
;
8681 code2
= TREE_CODE (nt
))
8682 nt
= TREE_OPERAND (nt
, 0);
8684 return cp_tree_equal (ot
, nt
);
8688 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
8689 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
8690 NEWARG_PTR with the offending arguments if they are non-NULL. */
8693 comp_template_args (tree oldargs
, tree newargs
,
8694 tree
*oldarg_ptr
, tree
*newarg_ptr
,
8699 if (oldargs
== newargs
)
8702 if (!oldargs
|| !newargs
)
8705 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
8708 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
8710 tree nt
= TREE_VEC_ELT (newargs
, i
);
8711 tree ot
= TREE_VEC_ELT (oldargs
, i
);
8713 if (! template_args_equal (ot
, nt
, partial_order
))
8715 if (oldarg_ptr
!= NULL
)
8717 if (newarg_ptr
!= NULL
)
8726 comp_template_args_porder (tree oargs
, tree nargs
)
8728 return comp_template_args (oargs
, nargs
, NULL
, NULL
, true);
8731 /* Implement a freelist interface for objects of type T.
8733 Head is a separate object, rather than a regular member, so that we
8734 can define it as a GTY deletable pointer, which is highly
8735 desirable. A data member could be declared that way, but then the
8736 containing object would implicitly get GTY((user)), which would
8737 prevent us from instantiating freelists as global objects.
8738 Although this way we can create freelist global objects, they're
8739 such thin wrappers that instantiating temporaries at every use
8740 loses nothing and saves permanent storage for the freelist object.
8742 Member functions next, anew, poison and reinit have default
8743 implementations that work for most of the types we're interested
8744 in, but if they don't work for some type, they should be explicitly
8745 specialized. See the comments before them for requirements, and
8746 the example specializations for the tree_list_freelist. */
8747 template <typename T
>
8750 /* Return the next object in a chain. We could just do type
8751 punning, but if we access the object with its underlying type, we
8752 avoid strict-aliasing trouble. This needs only work between
8753 poison and reinit. */
8754 static T
*&next (T
*obj
) { return obj
->next
; }
8756 /* Return a newly allocated, uninitialized or minimally-initialized
8757 object of type T. Any initialization performed by anew should
8758 either remain across the life of the object and the execution of
8759 poison, or be redone by reinit. */
8760 static T
*anew () { return ggc_alloc
<T
> (); }
8762 /* Optionally scribble all over the bits holding the object, so that
8763 they become (mostly?) uninitialized memory. This is called while
8764 preparing to make the object part of the free list. */
8765 static void poison (T
*obj
) {
8766 T
*p ATTRIBUTE_UNUSED
= obj
;
8767 T
**q ATTRIBUTE_UNUSED
= &next (obj
);
8769 #ifdef ENABLE_GC_CHECKING
8770 /* Poison the data, to indicate the data is garbage. */
8771 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (p
, sizeof (*p
)));
8772 memset (p
, 0xa5, sizeof (*p
));
8774 /* Let valgrind know the object is free. */
8775 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_NOACCESS (p
, sizeof (*p
)));
8777 /* Let valgrind know the next portion of the object is available,
8778 but uninitialized. */
8779 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (q
, sizeof (*q
)));
8782 /* Bring an object that underwent at least one lifecycle after anew
8783 and before the most recent free and poison, back to a usable
8784 state, reinitializing whatever is needed for it to be
8785 functionally equivalent to an object just allocated and returned
8786 by anew. This may poison or clear the next field, used by
8787 freelist housekeeping after poison was called. */
8788 static void reinit (T
*obj
) {
8789 T
**q ATTRIBUTE_UNUSED
= &next (obj
);
8791 #ifdef ENABLE_GC_CHECKING
8792 memset (q
, 0xa5, sizeof (*q
));
8794 /* Let valgrind know the entire object is available, but
8796 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (obj
, sizeof (*obj
)));
8799 /* Reference a GTY-deletable pointer that points to the first object
8800 in the free list proper. */
8803 /* Construct a freelist object chaining objects off of HEAD. */
8804 freelist (T
*&head
) : head(head
) {}
8806 /* Add OBJ to the free object list. The former head becomes OBJ's
8815 /* Take an object from the free list, if one is available, or
8816 allocate a new one. Objects taken from the free list should be
8817 regarded as filled with garbage, except for bits that are
8818 configured to be preserved across free and alloc. */
8833 /* Explicitly specialize the interfaces for freelist<tree_node>: we
8834 want to allocate a TREE_LIST using the usual interface, and ensure
8835 TREE_CHAIN remains functional. Alas, we have to duplicate a bit of
8836 build_tree_list logic in reinit, so this could go out of sync. */
8839 freelist
<tree_node
>::next (tree obj
)
8841 return TREE_CHAIN (obj
);
8845 freelist
<tree_node
>::anew ()
8847 return build_tree_list (NULL
, NULL
);
8851 freelist
<tree_node
>::poison (tree obj ATTRIBUTE_UNUSED
)
8853 int size ATTRIBUTE_UNUSED
= sizeof (tree_list
);
8854 tree p ATTRIBUTE_UNUSED
= obj
;
8855 tree_base
*b ATTRIBUTE_UNUSED
= &obj
->base
;
8856 tree
*q ATTRIBUTE_UNUSED
= &next (obj
);
8858 #ifdef ENABLE_GC_CHECKING
8859 gcc_checking_assert (TREE_CODE (obj
) == TREE_LIST
);
8861 /* Poison the data, to indicate the data is garbage. */
8862 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (p
, size
));
8863 memset (p
, 0xa5, size
);
8865 /* Let valgrind know the object is free. */
8866 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_NOACCESS (p
, size
));
8867 /* But we still want to use the TREE_CODE and TREE_CHAIN parts. */
8868 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_DEFINED (b
, sizeof (*b
)));
8869 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (q
, sizeof (*q
)));
8871 #ifdef ENABLE_GC_CHECKING
8872 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (b
, sizeof (*b
)));
8873 /* Keep TREE_CHAIN functional. */
8874 TREE_SET_CODE (obj
, TREE_LIST
);
8876 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_DEFINED (b
, sizeof (*b
)));
8881 freelist
<tree_node
>::reinit (tree obj ATTRIBUTE_UNUSED
)
8883 tree_base
*b ATTRIBUTE_UNUSED
= &obj
->base
;
8885 #ifdef ENABLE_GC_CHECKING
8886 gcc_checking_assert (TREE_CODE (obj
) == TREE_LIST
);
8887 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (obj
, sizeof (tree_list
)));
8888 memset (obj
, 0, sizeof (tree_list
));
8891 /* Let valgrind know the entire object is available, but
8893 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_UNDEFINED (obj
, sizeof (tree_list
)));
8895 #ifdef ENABLE_GC_CHECKING
8896 TREE_SET_CODE (obj
, TREE_LIST
);
8898 VALGRIND_DISCARD (VALGRIND_MAKE_MEM_DEFINED (b
, sizeof (*b
)));
8902 /* Point to the first object in the TREE_LIST freelist. */
8903 static GTY((deletable
)) tree tree_list_freelist_head
;
8904 /* Return the/an actual TREE_LIST freelist. */
8905 static inline freelist
<tree_node
>
8906 tree_list_freelist ()
8908 return tree_list_freelist_head
;
8911 /* Point to the first object in the tinst_level freelist. */
8912 static GTY((deletable
)) tinst_level
*tinst_level_freelist_head
;
8913 /* Return the/an actual tinst_level freelist. */
8914 static inline freelist
<tinst_level
>
8915 tinst_level_freelist ()
8917 return tinst_level_freelist_head
;
8920 /* Point to the first object in the pending_template freelist. */
8921 static GTY((deletable
)) pending_template
*pending_template_freelist_head
;
8922 /* Return the/an actual pending_template freelist. */
8923 static inline freelist
<pending_template
>
8924 pending_template_freelist ()
8926 return pending_template_freelist_head
;
8929 /* Build the TREE_LIST object out of a split list, store it
8930 permanently, and return it. */
8932 tinst_level::to_list ()
8934 gcc_assert (split_list_p ());
8935 tree ret
= tree_list_freelist ().alloc ();
8936 TREE_PURPOSE (ret
) = tldcl
;
8937 TREE_VALUE (ret
) = targs
;
8940 gcc_assert (tree_list_p ());
8944 const unsigned short tinst_level::refcount_infinity
;
8946 /* Increment OBJ's refcount unless it is already infinite. */
8947 static tinst_level
*
8948 inc_refcount_use (tinst_level
*obj
)
8950 if (obj
&& obj
->refcount
!= tinst_level::refcount_infinity
)
8955 /* Release storage for OBJ and node, if it's a TREE_LIST. */
8957 tinst_level::free (tinst_level
*obj
)
8959 if (obj
->tree_list_p ())
8960 tree_list_freelist ().free (obj
->get_node ());
8961 tinst_level_freelist ().free (obj
);
8964 /* Decrement OBJ's refcount if not infinite. If it reaches zero, release
8965 OBJ's DECL and OBJ, and start over with the tinst_level object that
8966 used to be referenced by OBJ's NEXT. */
8968 dec_refcount_use (tinst_level
*obj
)
8971 && obj
->refcount
!= tinst_level::refcount_infinity
8972 && !--obj
->refcount
)
8974 tinst_level
*next
= obj
->next
;
8975 tinst_level::free (obj
);
8980 /* Modify PTR so that it points to OBJ, adjusting the refcounts of OBJ
8981 and of the former PTR. Omitting the second argument is equivalent
8982 to passing (T*)NULL; this is allowed because passing the
8983 zero-valued integral constant NULL confuses type deduction and/or
8984 overload resolution. */
8985 template <typename T
>
8987 set_refcount_ptr (T
*& ptr
, T
*obj
= NULL
)
8990 ptr
= inc_refcount_use (obj
);
8991 dec_refcount_use (save
);
8995 add_pending_template (tree d
)
8997 tree ti
= (TYPE_P (d
)
8998 ? CLASSTYPE_TEMPLATE_INFO (d
)
8999 : DECL_TEMPLATE_INFO (d
));
9000 struct pending_template
*pt
;
9003 if (TI_PENDING_TEMPLATE_FLAG (ti
))
9006 /* We are called both from instantiate_decl, where we've already had a
9007 tinst_level pushed, and instantiate_template, where we haven't.
9009 gcc_assert (TREE_CODE (d
) != TREE_LIST
);
9010 level
= !current_tinst_level
9011 || current_tinst_level
->maybe_get_node () != d
;
9014 push_tinst_level (d
);
9016 pt
= pending_template_freelist ().alloc ();
9019 set_refcount_ptr (pt
->tinst
, current_tinst_level
);
9020 if (last_pending_template
)
9021 last_pending_template
->next
= pt
;
9023 pending_templates
= pt
;
9025 last_pending_template
= pt
;
9027 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
9034 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
9035 ARGLIST. Valid choices for FNS are given in the cp-tree.def
9036 documentation for TEMPLATE_ID_EXPR. */
9039 lookup_template_function (tree fns
, tree arglist
)
9043 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
9044 return error_mark_node
;
9046 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
9048 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
9050 error ("%q#D is not a function template", fns
);
9051 return error_mark_node
;
9054 if (BASELINK_P (fns
))
9056 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
9058 BASELINK_FUNCTIONS (fns
),
9063 type
= TREE_TYPE (fns
);
9064 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
9065 type
= unknown_type_node
;
9067 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
9070 /* Within the scope of a template class S<T>, the name S gets bound
9071 (in build_self_reference) to a TYPE_DECL for the class, not a
9072 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
9073 or one of its enclosing classes, and that type is a template,
9074 return the associated TEMPLATE_DECL. Otherwise, the original
9077 Also handle the case when DECL is a TREE_LIST of ambiguous
9078 injected-class-names from different bases. */
9081 maybe_get_template_decl_from_type_decl (tree decl
)
9083 if (decl
== NULL_TREE
)
9086 /* DR 176: A lookup that finds an injected-class-name (10.2
9087 [class.member.lookup]) can result in an ambiguity in certain cases
9088 (for example, if it is found in more than one base class). If all of
9089 the injected-class-names that are found refer to specializations of
9090 the same class template, and if the name is followed by a
9091 template-argument-list, the reference refers to the class template
9092 itself and not a specialization thereof, and is not ambiguous. */
9093 if (TREE_CODE (decl
) == TREE_LIST
)
9095 tree t
, tmpl
= NULL_TREE
;
9096 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
9098 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
9101 else if (tmpl
!= elt
)
9104 if (tmpl
&& t
== NULL_TREE
)
9110 return (decl
!= NULL_TREE
9111 && DECL_SELF_REFERENCE_P (decl
)
9112 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
9113 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
9116 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
9117 parameters, find the desired type.
9119 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
9121 IN_DECL, if non-NULL, is the template declaration we are trying to
9124 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
9125 the class we are looking up.
9127 Issue error and warning messages under control of COMPLAIN.
9129 If the template class is really a local class in a template
9130 function, then the FUNCTION_CONTEXT is the function in which it is
9133 ??? Note that this function is currently called *twice* for each
9134 template-id: the first time from the parser, while creating the
9135 incomplete type (finish_template_type), and the second type during the
9136 real instantiation (instantiate_template_class). This is surely something
9137 that we want to avoid. It also causes some problems with argument
9138 coercion (see convert_nontype_argument for more information on this). */
9141 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
9142 int entering_scope
, tsubst_flags_t complain
)
9144 tree templ
= NULL_TREE
, parmlist
;
9151 if (identifier_p (d1
))
9153 tree value
= innermost_non_namespace_value (d1
);
9154 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
9159 push_decl_namespace (context
);
9160 templ
= lookup_name (d1
);
9161 templ
= maybe_get_template_decl_from_type_decl (templ
);
9163 pop_decl_namespace ();
9166 context
= DECL_CONTEXT (templ
);
9168 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
9170 tree type
= TREE_TYPE (d1
);
9172 /* If we are declaring a constructor, say A<T>::A<T>, we will get
9173 an implicit typename for the second A. Deal with it. */
9174 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
9175 type
= TREE_TYPE (type
);
9177 if (CLASSTYPE_TEMPLATE_INFO (type
))
9179 templ
= CLASSTYPE_TI_TEMPLATE (type
);
9180 d1
= DECL_NAME (templ
);
9183 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
9184 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
9186 templ
= TYPE_TI_TEMPLATE (d1
);
9187 d1
= DECL_NAME (templ
);
9189 else if (DECL_TYPE_TEMPLATE_P (d1
))
9192 d1
= DECL_NAME (templ
);
9193 context
= DECL_CONTEXT (templ
);
9195 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
9198 d1
= DECL_NAME (templ
);
9201 /* Issue an error message if we didn't find a template. */
9204 if (complain
& tf_error
)
9205 error ("%qT is not a template", d1
);
9206 return error_mark_node
;
9209 if (TREE_CODE (templ
) != TEMPLATE_DECL
9210 /* Make sure it's a user visible template, if it was named by
9212 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
9213 && !PRIMARY_TEMPLATE_P (templ
)))
9215 if (complain
& tf_error
)
9217 error ("non-template type %qT used as a template", d1
);
9219 error ("for template declaration %q+D", in_decl
);
9221 return error_mark_node
;
9224 complain
&= ~tf_user
;
9226 /* An alias that just changes the name of a template is equivalent to the
9227 other template, so if any of the arguments are pack expansions, strip
9228 the alias to avoid problems with a pack expansion passed to a non-pack
9229 alias template parameter (DR 1430). */
9230 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
9231 templ
= get_underlying_template (templ
);
9233 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
9236 tree arglist2
= coerce_template_args_for_ttp (templ
, arglist
, complain
);
9237 if (arglist2
== error_mark_node
9238 || (!uses_template_parms (arglist2
)
9239 && check_instantiated_args (templ
, arglist2
, complain
)))
9240 return error_mark_node
;
9242 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
9247 tree template_type
= TREE_TYPE (templ
);
9250 tree found
= NULL_TREE
;
9253 int is_dependent_type
;
9254 int use_partial_inst_tmpl
= false;
9256 if (template_type
== error_mark_node
)
9257 /* An error occurred while building the template TEMPL, and a
9258 diagnostic has most certainly been emitted for that
9259 already. Let's propagate that error. */
9260 return error_mark_node
;
9262 gen_tmpl
= most_general_template (templ
);
9263 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
9264 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
9265 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
9267 if (arg_depth
== 1 && parm_depth
> 1)
9269 /* We've been given an incomplete set of template arguments.
9272 template <class T> struct S1 {
9273 template <class U> struct S2 {};
9274 template <class U> struct S2<U*> {};
9277 we will be called with an ARGLIST of `U*', but the
9278 TEMPLATE will be `template <class T> template
9279 <class U> struct S1<T>::S2'. We must fill in the missing
9281 tree ti
= TYPE_TEMPLATE_INFO_MAYBE_ALIAS (TREE_TYPE (templ
));
9282 arglist
= add_outermost_template_args (TI_ARGS (ti
), arglist
);
9283 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
9286 /* Now we should have enough arguments. */
9287 gcc_assert (parm_depth
== arg_depth
);
9289 /* From here on, we're only interested in the most general
9292 /* Calculate the BOUND_ARGS. These will be the args that are
9293 actually tsubst'd into the definition to create the
9295 arglist
= coerce_innermost_template_parms (parmlist
, arglist
, gen_tmpl
,
9297 /*require_all_args=*/true,
9298 /*use_default_args=*/true);
9300 if (arglist
== error_mark_node
)
9301 /* We were unable to bind the arguments. */
9302 return error_mark_node
;
9304 /* In the scope of a template class, explicit references to the
9305 template class refer to the type of the template, not any
9306 instantiation of it. For example, in:
9308 template <class T> class C { void f(C<T>); }
9310 the `C<T>' is just the same as `C'. Outside of the
9311 class, however, such a reference is an instantiation. */
9313 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
9314 || currently_open_class (template_type
))
9316 tree tinfo
= TYPE_TEMPLATE_INFO (template_type
);
9318 if (tinfo
&& comp_template_args (TI_ARGS (tinfo
), arglist
))
9319 return template_type
;
9322 /* If we already have this specialization, return it. */
9323 elt
.tmpl
= gen_tmpl
;
9325 elt
.spec
= NULL_TREE
;
9326 hash
= spec_hasher::hash (&elt
);
9327 entry
= type_specializations
->find_with_hash (&elt
, hash
);
9332 /* If the the template's constraints are not satisfied,
9333 then we cannot form a valid type.
9335 Note that the check is deferred until after the hash
9336 lookup. This prevents redundant checks on previously
9337 instantiated specializations. */
9338 if (flag_concepts
&& !constraints_satisfied_p (gen_tmpl
, arglist
))
9340 if (complain
& tf_error
)
9342 error ("template constraint failure");
9343 diagnose_constraints (input_location
, gen_tmpl
, arglist
);
9345 return error_mark_node
;
9348 is_dependent_type
= uses_template_parms (arglist
);
9350 /* If the deduced arguments are invalid, then the binding
9352 if (!is_dependent_type
9353 && check_instantiated_args (gen_tmpl
,
9354 INNERMOST_TEMPLATE_ARGS (arglist
),
9356 return error_mark_node
;
9358 if (!is_dependent_type
9359 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
9360 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
9361 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
9363 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
9364 DECL_NAME (gen_tmpl
),
9365 /*tag_scope=*/ts_global
);
9369 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
9371 if (context
== error_mark_node
)
9372 return error_mark_node
;
9375 context
= global_namespace
;
9377 /* Create the type. */
9378 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
9380 /* The user referred to a specialization of an alias
9381 template represented by GEN_TMPL.
9383 [temp.alias]/2 says:
9385 When a template-id refers to the specialization of an
9386 alias template, it is equivalent to the associated
9387 type obtained by substitution of its
9388 template-arguments for the template-parameters in the
9389 type-id of the alias template. */
9391 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
9392 /* Note that the call above (by indirectly calling
9393 register_specialization in tsubst_decl) registers the
9394 TYPE_DECL representing the specialization of the alias
9395 template. So next time someone substitutes ARGLIST for
9396 the template parms into the alias template (GEN_TMPL),
9397 she'll get that TYPE_DECL back. */
9399 if (t
== error_mark_node
)
9402 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
9404 if (!is_dependent_type
)
9406 set_current_access_from_decl (TYPE_NAME (template_type
));
9407 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
9408 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
9409 arglist
, complain
, in_decl
),
9410 tsubst_attributes (TYPE_ATTRIBUTES (template_type
),
9411 arglist
, complain
, in_decl
),
9412 SCOPED_ENUM_P (template_type
), NULL
);
9414 if (t
== error_mark_node
)
9419 /* We don't want to call start_enum for this type, since
9420 the values for the enumeration constants may involve
9421 template parameters. And, no one should be interested
9422 in the enumeration constants for such a type. */
9423 t
= cxx_make_type (ENUMERAL_TYPE
);
9424 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
9426 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
9427 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
9428 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
9430 else if (CLASS_TYPE_P (template_type
))
9432 /* Lambda closures are regenerated in tsubst_lambda_expr, not
9433 instantiated here. */
9434 gcc_assert (!LAMBDA_TYPE_P (template_type
));
9436 t
= make_class_type (TREE_CODE (template_type
));
9437 CLASSTYPE_DECLARED_CLASS (t
)
9438 = CLASSTYPE_DECLARED_CLASS (template_type
);
9439 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
9441 /* A local class. Make sure the decl gets registered properly. */
9442 if (context
== current_function_decl
)
9443 if (pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
)
9445 return error_mark_node
;
9447 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
9448 /* This instantiation is another name for the primary
9449 template type. Set the TYPE_CANONICAL field
9451 TYPE_CANONICAL (t
) = template_type
;
9452 else if (any_template_arguments_need_structural_equality_p (arglist
))
9453 /* Some of the template arguments require structural
9454 equality testing, so this template class requires
9455 structural equality testing. */
9456 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9461 /* If we called start_enum or pushtag above, this information
9462 will already be set up. */
9465 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
9467 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
9468 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
9469 DECL_SOURCE_LOCATION (type_decl
)
9470 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
9473 type_decl
= TYPE_NAME (t
);
9475 if (CLASS_TYPE_P (template_type
))
9477 TREE_PRIVATE (type_decl
)
9478 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
9479 TREE_PROTECTED (type_decl
)
9480 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
9481 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
9483 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
9484 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
9488 if (OVERLOAD_TYPE_P (t
)
9489 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
9491 static const char *tags
[] = {"abi_tag", "may_alias"};
9493 for (unsigned ix
= 0; ix
!= 2; ix
++)
9496 = lookup_attribute (tags
[ix
], TYPE_ATTRIBUTES (template_type
));
9500 = tree_cons (TREE_PURPOSE (attributes
),
9501 TREE_VALUE (attributes
),
9502 TYPE_ATTRIBUTES (t
));
9506 /* Let's consider the explicit specialization of a member
9507 of a class template specialization that is implicitly instantiated,
9512 template<class U> struct M {}; //#0
9517 struct S<int>::M<char> //#1
9521 [temp.expl.spec]/4 says this is valid.
9523 In this case, when we write:
9526 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
9529 When we encounter #1, we want to store the partial instantiation
9530 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
9532 For all cases other than this "explicit specialization of member of a
9533 class template", we just want to store the most general template into
9534 the CLASSTYPE_TI_TEMPLATE of M.
9536 This case of "explicit specialization of member of a class template"
9538 1/ the enclosing class is an instantiation of, and therefore not
9539 the same as, the context of the most general template, and
9540 2/ we aren't looking at the partial instantiation itself, i.e.
9541 the innermost arguments are not the same as the innermost parms of
9542 the most general template.
9544 So it's only when 1/ and 2/ happens that we want to use the partial
9545 instantiation of the member template in lieu of its most general
9548 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
9549 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
9550 /* the enclosing class must be an instantiation... */
9551 && CLASS_TYPE_P (context
)
9552 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
9554 TREE_VEC_LENGTH (arglist
)--;
9555 ++processing_template_decl
;
9556 tree tinfo
= TYPE_TEMPLATE_INFO_MAYBE_ALIAS (TREE_TYPE (gen_tmpl
));
9557 tree partial_inst_args
=
9558 tsubst (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
)),
9559 arglist
, complain
, NULL_TREE
);
9560 --processing_template_decl
;
9561 TREE_VEC_LENGTH (arglist
)++;
9562 if (partial_inst_args
== error_mark_node
)
9563 return error_mark_node
;
9564 use_partial_inst_tmpl
=
9565 /*...and we must not be looking at the partial instantiation
9567 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
9571 if (!use_partial_inst_tmpl
)
9572 /* This case is easy; there are no member templates involved. */
9576 /* This is a full instantiation of a member template. Find
9577 the partial instantiation of which this is an instance. */
9579 /* Temporarily reduce by one the number of levels in the ARGLIST
9580 so as to avoid comparing the last set of arguments. */
9581 TREE_VEC_LENGTH (arglist
)--;
9582 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
9583 TREE_VEC_LENGTH (arglist
)++;
9584 /* FOUND is either a proper class type, or an alias
9585 template specialization. In the later case, it's a
9586 TYPE_DECL, resulting from the substituting of arguments
9587 for parameters in the TYPE_DECL of the alias template
9588 done earlier. So be careful while getting the template
9590 found
= (TREE_CODE (found
) == TEMPLATE_DECL
9592 : (TREE_CODE (found
) == TYPE_DECL
9593 ? DECL_TI_TEMPLATE (found
)
9594 : CLASSTYPE_TI_TEMPLATE (found
)));
9597 // Build template info for the new specialization.
9598 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
9601 slot
= type_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
9602 entry
= ggc_alloc
<spec_entry
> ();
9606 /* Note this use of the partial instantiation so we can check it
9607 later in maybe_process_partial_specialization. */
9608 DECL_TEMPLATE_INSTANTIATIONS (found
)
9609 = tree_cons (arglist
, t
,
9610 DECL_TEMPLATE_INSTANTIATIONS (found
));
9612 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
9613 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
9614 /* Now that the type has been registered on the instantiations
9615 list, we set up the enumerators. Because the enumeration
9616 constants may involve the enumeration type itself, we make
9617 sure to register the type first, and then create the
9618 constants. That way, doing tsubst_expr for the enumeration
9619 constants won't result in recursive calls here; we'll find
9620 the instantiation and exit above. */
9621 tsubst_enum (template_type
, t
, arglist
);
9623 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
9624 /* If the type makes use of template parameters, the
9625 code that generates debugging information will crash. */
9626 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
9628 /* Possibly limit visibility based on template args. */
9629 TREE_PUBLIC (type_decl
) = 1;
9630 determine_visibility (type_decl
);
9632 inherit_targ_abi_tags (t
);
9638 /* Wrapper for lookup_template_class_1. */
9641 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
9642 int entering_scope
, tsubst_flags_t complain
)
9645 timevar_push (TV_TEMPLATE_INST
);
9646 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
9647 entering_scope
, complain
);
9648 timevar_pop (TV_TEMPLATE_INST
);
9652 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST. */
9655 lookup_template_variable (tree templ
, tree arglist
)
9657 /* The type of the expression is NULL_TREE since the template-id could refer
9658 to an explicit or partial specialization. */
9659 tree type
= NULL_TREE
;
9660 if (flag_concepts
&& variable_concept_p (templ
))
9661 /* Except that concepts are always bool. */
9662 type
= boolean_type_node
;
9663 return build2 (TEMPLATE_ID_EXPR
, type
, templ
, arglist
);
9666 /* Instantiate a variable declaration from a TEMPLATE_ID_EXPR for use. */
9669 finish_template_variable (tree var
, tsubst_flags_t complain
)
9671 tree templ
= TREE_OPERAND (var
, 0);
9672 tree arglist
= TREE_OPERAND (var
, 1);
9674 /* We never want to return a VAR_DECL for a variable concept, since they
9675 aren't instantiated. In a template, leave the TEMPLATE_ID_EXPR alone. */
9676 bool concept_p
= flag_concepts
&& variable_concept_p (templ
);
9677 if (concept_p
&& processing_template_decl
)
9680 tree tmpl_args
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (templ
));
9681 arglist
= add_outermost_template_args (tmpl_args
, arglist
);
9683 templ
= most_general_template (templ
);
9684 tree parms
= DECL_TEMPLATE_PARMS (templ
);
9685 arglist
= coerce_innermost_template_parms (parms
, arglist
, templ
, complain
,
9687 /*use_default*/true);
9689 if (flag_concepts
&& !constraints_satisfied_p (templ
, arglist
))
9691 if (complain
& tf_error
)
9693 error ("use of invalid variable template %qE", var
);
9694 diagnose_constraints (location_of (var
), templ
, arglist
);
9696 return error_mark_node
;
9699 /* If a template-id refers to a specialization of a variable
9700 concept, then the expression is true if and only if the
9701 concept's constraints are satisfied by the given template
9704 NOTE: This is an extension of Concepts Lite TS that
9705 allows constraints to be used in expressions. */
9708 tree decl
= DECL_TEMPLATE_RESULT (templ
);
9709 return evaluate_variable_concept (decl
, arglist
);
9712 return instantiate_template (templ
, arglist
, complain
);
9715 /* Construct a TEMPLATE_ID_EXPR for the given variable template TEMPL having
9716 TARGS template args, and instantiate it if it's not dependent. */
9719 lookup_and_finish_template_variable (tree templ
, tree targs
,
9720 tsubst_flags_t complain
)
9722 templ
= lookup_template_variable (templ
, targs
);
9723 if (!any_dependent_template_arguments_p (targs
))
9725 templ
= finish_template_variable (templ
, complain
);
9729 return convert_from_reference (templ
);
9738 /* True when we should also visit template parameters that occur in
9739 non-deduced contexts. */
9740 bool include_nondeduced_p
;
9741 hash_set
<tree
> *visited
;
9744 /* Called from for_each_template_parm via walk_tree. */
9747 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
9750 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
9751 tree_fn_t fn
= pfd
->fn
;
9752 void *data
= pfd
->data
;
9753 tree result
= NULL_TREE
;
9755 #define WALK_SUBTREE(NODE) \
9758 result = for_each_template_parm (NODE, fn, data, pfd->visited, \
9759 pfd->include_nondeduced_p, \
9761 if (result) goto out; \
9765 if (pfd
->any_fn
&& (*pfd
->any_fn
)(t
, data
))
9769 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
))
9770 WALK_SUBTREE (TYPE_CONTEXT (t
));
9772 switch (TREE_CODE (t
))
9775 if (TYPE_PTRMEMFUNC_P (t
))
9781 if (!TYPE_TEMPLATE_INFO (t
))
9784 WALK_SUBTREE (TYPE_TI_ARGS (t
));
9788 WALK_SUBTREE (TYPE_MIN_VALUE (t
));
9789 WALK_SUBTREE (TYPE_MAX_VALUE (t
));
9793 /* Since we're not going to walk subtrees, we have to do this
9795 WALK_SUBTREE (TYPE_METHOD_BASETYPE (t
));
9799 /* Check the return type. */
9800 WALK_SUBTREE (TREE_TYPE (t
));
9802 /* Check the parameter types. Since default arguments are not
9803 instantiated until they are needed, the TYPE_ARG_TYPES may
9804 contain expressions that involve template parameters. But,
9805 no-one should be looking at them yet. And, once they're
9806 instantiated, they don't contain template parameters, so
9807 there's no point in looking at them then, either. */
9811 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
9812 WALK_SUBTREE (TREE_VALUE (parm
));
9814 /* Since we've already handled the TYPE_ARG_TYPES, we don't
9815 want walk_tree walking into them itself. */
9819 if (flag_noexcept_type
)
9821 tree spec
= TYPE_RAISES_EXCEPTIONS (t
);
9823 WALK_SUBTREE (TREE_PURPOSE (spec
));
9829 case UNDERLYING_TYPE
:
9830 if (pfd
->include_nondeduced_p
9831 && for_each_template_parm (TYPE_VALUES_RAW (t
), fn
, data
,
9833 pfd
->include_nondeduced_p
,
9835 return error_mark_node
;
9836 *walk_subtrees
= false;
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
->next
= NULL
;
10148 new_level
->refcount
= 0;
10149 set_refcount_ptr (new_level
->next
, current_tinst_level
);
10150 set_refcount_ptr (current_tinst_level
, new_level
);
10153 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
10154 depth_reached
= tinst_depth
;
10159 /* We're starting substitution of TMPL<ARGS>; record the template
10160 substitution context for diagnostics and to restore it later. */
10163 push_tinst_level (tree tmpl
, tree args
)
10165 return push_tinst_level_loc (tmpl
, args
, input_location
);
10168 /* We're starting to instantiate D; record INPUT_LOCATION and the
10169 template instantiation context for diagnostics and to restore it
10173 push_tinst_level (tree d
)
10175 return push_tinst_level_loc (d
, input_location
);
10178 /* Likewise, but record LOC as the program location. */
10181 push_tinst_level_loc (tree d
, location_t loc
)
10183 gcc_assert (TREE_CODE (d
) != TREE_LIST
);
10184 return push_tinst_level_loc (d
, NULL
, loc
);
10187 /* We're done instantiating this template; return to the instantiation
10191 pop_tinst_level (void)
10193 /* Restore the filename and line number stashed away when we started
10194 this instantiation. */
10195 input_location
= current_tinst_level
->locus
;
10196 set_refcount_ptr (current_tinst_level
, current_tinst_level
->next
);
10200 /* We're instantiating a deferred template; restore the template
10201 instantiation context in which the instantiation was requested, which
10202 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
10205 reopen_tinst_level (struct tinst_level
*level
)
10207 struct tinst_level
*t
;
10210 for (t
= level
; t
; t
= t
->next
)
10213 set_refcount_ptr (current_tinst_level
, level
);
10214 pop_tinst_level ();
10215 if (current_tinst_level
)
10216 current_tinst_level
->errors
= errorcount
+sorrycount
;
10217 return level
->maybe_get_node ();
10220 /* Returns the TINST_LEVEL which gives the original instantiation
10223 struct tinst_level
*
10224 outermost_tinst_level (void)
10226 struct tinst_level
*level
= current_tinst_level
;
10228 while (level
->next
)
10229 level
= level
->next
;
10233 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
10234 vector of template arguments, as for tsubst.
10236 Returns an appropriate tsubst'd friend declaration. */
10239 tsubst_friend_function (tree decl
, tree args
)
10243 if (TREE_CODE (decl
) == FUNCTION_DECL
10244 && DECL_TEMPLATE_INSTANTIATION (decl
)
10245 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
10246 /* This was a friend declared with an explicit template
10247 argument list, e.g.:
10249 friend void f<>(T);
10251 to indicate that f was a template instantiation, not a new
10252 function declaration. Now, we have to figure out what
10253 instantiation of what template. */
10255 tree template_id
, arglist
, fns
;
10258 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
10260 /* Friend functions are looked up in the containing namespace scope.
10261 We must enter that scope, to avoid finding member functions of the
10262 current class with same name. */
10263 push_nested_namespace (ns
);
10264 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
10265 tf_warning_or_error
, NULL_TREE
,
10266 /*integral_constant_expression_p=*/false);
10267 pop_nested_namespace (ns
);
10268 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
10269 tf_warning_or_error
, NULL_TREE
);
10270 template_id
= lookup_template_function (fns
, arglist
);
10272 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
10273 tmpl
= determine_specialization (template_id
, new_friend
,
10275 /*need_member_template=*/0,
10276 TREE_VEC_LENGTH (args
),
10278 return instantiate_template (tmpl
, new_args
, tf_error
);
10281 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
10283 /* The NEW_FRIEND will look like an instantiation, to the
10284 compiler, but is not an instantiation from the point of view of
10285 the language. For example, we might have had:
10287 template <class T> struct S {
10288 template <class U> friend void f(T, U);
10291 Then, in S<int>, template <class U> void f(int, U) is not an
10292 instantiation of anything. */
10293 if (new_friend
== error_mark_node
)
10294 return error_mark_node
;
10296 DECL_USE_TEMPLATE (new_friend
) = 0;
10297 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
10299 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
10300 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
10301 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
10304 /* The mangled name for the NEW_FRIEND is incorrect. The function
10305 is not a template instantiation and should not be mangled like
10306 one. Therefore, we forget the mangling here; we'll recompute it
10307 later if we need it. */
10308 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
10310 SET_DECL_RTL (new_friend
, NULL
);
10311 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
10314 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
10317 tree new_friend_template_info
;
10318 tree new_friend_result_template_info
;
10320 int new_friend_is_defn
;
10322 /* We must save some information from NEW_FRIEND before calling
10323 duplicate decls since that function will free NEW_FRIEND if
10325 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
10326 new_friend_is_defn
=
10327 (DECL_INITIAL (DECL_TEMPLATE_RESULT
10328 (template_for_substitution (new_friend
)))
10330 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
10332 /* This declaration is a `primary' template. */
10333 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
10335 new_friend_result_template_info
10336 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
10339 new_friend_result_template_info
= NULL_TREE
;
10341 /* Inside pushdecl_namespace_level, we will push into the
10342 current namespace. However, the friend function should go
10343 into the namespace of the template. */
10344 ns
= decl_namespace_context (new_friend
);
10345 push_nested_namespace (ns
);
10346 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
10347 pop_nested_namespace (ns
);
10349 if (old_decl
== error_mark_node
)
10350 return error_mark_node
;
10352 if (old_decl
!= new_friend
)
10354 /* This new friend declaration matched an existing
10355 declaration. For example, given:
10357 template <class T> void f(T);
10358 template <class U> class C {
10359 template <class T> friend void f(T) {}
10362 the friend declaration actually provides the definition
10363 of `f', once C has been instantiated for some type. So,
10364 old_decl will be the out-of-class template declaration,
10365 while new_friend is the in-class definition.
10367 But, if `f' was called before this point, the
10368 instantiation of `f' will have DECL_TI_ARGS corresponding
10369 to `T' but not to `U', references to which might appear
10370 in the definition of `f'. Previously, the most general
10371 template for an instantiation of `f' was the out-of-class
10372 version; now it is the in-class version. Therefore, we
10373 run through all specialization of `f', adding to their
10374 DECL_TI_ARGS appropriately. In particular, they need a
10375 new set of outer arguments, corresponding to the
10376 arguments for this class instantiation.
10378 The same situation can arise with something like this:
10380 friend void f(int);
10381 template <class T> class C {
10382 friend void f(T) {}
10385 when `C<int>' is instantiated. Now, `f(int)' is defined
10388 if (!new_friend_is_defn
)
10389 /* On the other hand, if the in-class declaration does
10390 *not* provide a definition, then we don't want to alter
10391 existing definitions. We can just leave everything
10396 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
10397 tree new_args
= TI_ARGS (new_friend_template_info
);
10399 /* Overwrite whatever template info was there before, if
10400 any, with the new template information pertaining to
10401 the declaration. */
10402 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
10404 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
10406 /* We should have called reregister_specialization in
10407 duplicate_decls. */
10408 gcc_assert (retrieve_specialization (new_template
,
10412 /* Instantiate it if the global has already been used. */
10413 if (DECL_ODR_USED (old_decl
))
10414 instantiate_decl (old_decl
, /*defer_ok=*/true,
10415 /*expl_inst_class_mem_p=*/false);
10421 /* Indicate that the old function template is a partial
10423 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
10424 = new_friend_result_template_info
;
10426 gcc_assert (new_template
10427 == most_general_template (new_template
));
10428 gcc_assert (new_template
!= old_decl
);
10430 /* Reassign any specializations already in the hash table
10431 to the new more general template, and add the
10432 additional template args. */
10433 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
10435 t
= TREE_CHAIN (t
))
10437 tree spec
= TREE_VALUE (t
);
10440 elt
.tmpl
= old_decl
;
10441 elt
.args
= DECL_TI_ARGS (spec
);
10442 elt
.spec
= NULL_TREE
;
10444 decl_specializations
->remove_elt (&elt
);
10446 DECL_TI_ARGS (spec
)
10447 = add_outermost_template_args (new_args
,
10448 DECL_TI_ARGS (spec
));
10450 register_specialization
10451 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
10454 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
10458 /* The information from NEW_FRIEND has been merged into OLD_DECL
10459 by duplicate_decls. */
10460 new_friend
= old_decl
;
10465 tree context
= DECL_CONTEXT (new_friend
);
10469 template <class T> class C {
10470 template <class U> friend void C1<U>::f (); // case 1
10471 friend void C2<T>::f (); // case 2
10473 we only need to make sure CONTEXT is a complete type for
10474 case 2. To distinguish between the two cases, we note that
10475 CONTEXT of case 1 remains dependent type after tsubst while
10476 this isn't true for case 2. */
10477 ++processing_template_decl
;
10478 dependent_p
= dependent_type_p (context
);
10479 --processing_template_decl
;
10482 && !complete_type_or_else (context
, NULL_TREE
))
10483 return error_mark_node
;
10485 if (COMPLETE_TYPE_P (context
))
10487 tree fn
= new_friend
;
10488 /* do_friend adds the TEMPLATE_DECL for any member friend
10489 template even if it isn't a member template, i.e.
10490 template <class T> friend A<T>::f();
10491 Look through it in that case. */
10492 if (TREE_CODE (fn
) == TEMPLATE_DECL
10493 && !PRIMARY_TEMPLATE_P (fn
))
10494 fn
= DECL_TEMPLATE_RESULT (fn
);
10495 /* Check to see that the declaration is really present, and,
10496 possibly obtain an improved declaration. */
10497 fn
= check_classfn (context
, fn
, NULL_TREE
);
10507 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
10508 template arguments, as for tsubst.
10510 Returns an appropriate tsubst'd friend type or error_mark_node on
10514 tsubst_friend_class (tree friend_tmpl
, tree args
)
10518 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
10520 tmpl
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
10521 return TREE_TYPE (tmpl
);
10524 tree context
= CP_DECL_CONTEXT (friend_tmpl
);
10525 if (TREE_CODE (context
) == NAMESPACE_DECL
)
10526 push_nested_namespace (context
);
10528 push_nested_class (context
);
10530 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), /*prefer_type=*/false,
10531 /*non_class=*/false, /*block_p=*/false,
10532 /*namespaces_only=*/false, LOOKUP_HIDDEN
);
10534 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
10536 /* The friend template has already been declared. Just
10537 check to see that the declarations match, and install any new
10538 default parameters. We must tsubst the default parameters,
10539 of course. We only need the innermost template parameters
10540 because that is all that redeclare_class_template will look
10542 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
10543 > TMPL_ARGS_DEPTH (args
))
10545 tree parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
10546 args
, tf_warning_or_error
);
10547 location_t saved_input_location
= input_location
;
10548 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
10549 tree cons
= get_constraints (tmpl
);
10550 redeclare_class_template (TREE_TYPE (tmpl
), parms
, cons
);
10551 input_location
= saved_input_location
;
10556 /* The friend template has not already been declared. In this
10557 case, the instantiation of the template class will cause the
10558 injection of this template into the namespace scope. */
10559 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
10561 if (tmpl
!= error_mark_node
)
10563 /* The new TMPL is not an instantiation of anything, so we
10564 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE
10565 for the new type because that is supposed to be the
10566 corresponding template decl, i.e., TMPL. */
10567 DECL_USE_TEMPLATE (tmpl
) = 0;
10568 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
10569 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
10570 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
10571 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
10573 /* It is hidden. */
10574 retrofit_lang_decl (DECL_TEMPLATE_RESULT (tmpl
));
10575 DECL_ANTICIPATED (tmpl
)
10576 = DECL_ANTICIPATED (DECL_TEMPLATE_RESULT (tmpl
)) = true;
10578 /* Inject this template into the enclosing namspace scope. */
10579 tmpl
= pushdecl_namespace_level (tmpl
, true);
10583 if (TREE_CODE (context
) == NAMESPACE_DECL
)
10584 pop_nested_namespace (context
);
10586 pop_nested_class ();
10588 return TREE_TYPE (tmpl
);
10591 /* Returns zero if TYPE cannot be completed later due to circularity.
10592 Otherwise returns one. */
10595 can_complete_type_without_circularity (tree type
)
10597 if (type
== NULL_TREE
|| type
== error_mark_node
)
10599 else if (COMPLETE_TYPE_P (type
))
10601 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10602 return can_complete_type_without_circularity (TREE_TYPE (type
));
10603 else if (CLASS_TYPE_P (type
)
10604 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
10610 static tree
tsubst_omp_clauses (tree
, enum c_omp_region_type
, tree
,
10611 tsubst_flags_t
, tree
);
10613 /* Instantiate a single dependent attribute T (a TREE_LIST), and return either
10614 T or a new TREE_LIST, possibly a chain in the case of a pack expansion. */
10617 tsubst_attribute (tree t
, tree
*decl_p
, tree args
,
10618 tsubst_flags_t complain
, tree in_decl
)
10620 gcc_assert (ATTR_IS_DEPENDENT (t
));
10622 tree val
= TREE_VALUE (t
);
10623 if (val
== NULL_TREE
)
10624 /* Nothing to do. */;
10625 else if ((flag_openmp
|| flag_openmp_simd
)
10626 && is_attribute_p ("omp declare simd",
10627 get_attribute_name (t
)))
10629 tree clauses
= TREE_VALUE (val
);
10630 clauses
= tsubst_omp_clauses (clauses
, C_ORT_OMP_DECLARE_SIMD
, args
,
10631 complain
, in_decl
);
10632 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
10633 clauses
= finish_omp_clauses (clauses
, C_ORT_OMP_DECLARE_SIMD
);
10634 tree parms
= DECL_ARGUMENTS (*decl_p
);
10636 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
10638 val
= build_tree_list (NULL_TREE
, clauses
);
10642 /* If the first attribute argument is an identifier, don't
10643 pass it through tsubst. Attributes like mode, format,
10644 cleanup and several target specific attributes expect it
10646 else if (attribute_takes_identifier_p (get_attribute_name (t
)))
10649 = tsubst_expr (TREE_CHAIN (val
), args
, complain
, in_decl
,
10650 /*integral_constant_expression_p=*/false);
10651 if (chain
!= TREE_CHAIN (val
))
10652 val
= tree_cons (NULL_TREE
, TREE_VALUE (val
), chain
);
10654 else if (PACK_EXPANSION_P (val
))
10656 /* An attribute pack expansion. */
10657 tree purp
= TREE_PURPOSE (t
);
10658 tree pack
= tsubst_pack_expansion (val
, args
, complain
, in_decl
);
10659 if (pack
== error_mark_node
)
10660 return error_mark_node
;
10661 int len
= TREE_VEC_LENGTH (pack
);
10662 tree list
= NULL_TREE
;
10664 for (int i
= 0; i
< len
; ++i
)
10666 tree elt
= TREE_VEC_ELT (pack
, i
);
10667 *q
= build_tree_list (purp
, elt
);
10668 q
= &TREE_CHAIN (*q
);
10673 val
= tsubst_expr (val
, args
, complain
, in_decl
,
10674 /*integral_constant_expression_p=*/false);
10676 if (val
!= TREE_VALUE (t
))
10677 return build_tree_list (TREE_PURPOSE (t
), val
);
10681 /* Instantiate any dependent attributes in ATTRIBUTES, returning either it
10682 unchanged or a new TREE_LIST chain. */
10685 tsubst_attributes (tree attributes
, tree args
,
10686 tsubst_flags_t complain
, tree in_decl
)
10688 tree last_dep
= NULL_TREE
;
10690 for (tree t
= attributes
; t
; t
= TREE_CHAIN (t
))
10691 if (ATTR_IS_DEPENDENT (t
))
10694 attributes
= copy_list (attributes
);
10699 for (tree
*p
= &attributes
; *p
; )
10702 if (ATTR_IS_DEPENDENT (t
))
10704 tree subst
= tsubst_attribute (t
, NULL
, args
, complain
, in_decl
);
10709 p
= &TREE_CHAIN (*p
);
10710 *p
= TREE_CHAIN (t
);
10714 p
= &TREE_CHAIN (*p
);
10720 /* Apply any attributes which had to be deferred until instantiation
10721 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
10722 ARGS, COMPLAIN, IN_DECL are as tsubst. */
10725 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
10726 tree args
, tsubst_flags_t complain
, tree in_decl
)
10728 tree last_dep
= NULL_TREE
;
10732 if (attributes
== NULL_TREE
)
10735 if (DECL_P (*decl_p
))
10737 if (TREE_TYPE (*decl_p
) == error_mark_node
)
10739 p
= &DECL_ATTRIBUTES (*decl_p
);
10740 /* DECL_ATTRIBUTES comes from copy_node in tsubst_decl, and is identical
10741 to our attributes parameter. */
10742 gcc_assert (*p
== attributes
);
10746 p
= &TYPE_ATTRIBUTES (*decl_p
);
10747 /* TYPE_ATTRIBUTES was set up (with abi_tag and may_alias) in
10748 lookup_template_class_1, and should be preserved. */
10749 gcc_assert (*p
!= attributes
);
10751 p
= &TREE_CHAIN (*p
);
10754 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
10755 if (ATTR_IS_DEPENDENT (t
))
10758 attributes
= copy_list (attributes
);
10765 tree late_attrs
= NULL_TREE
;
10766 tree
*q
= &late_attrs
;
10771 if (ATTR_IS_DEPENDENT (t
))
10773 *p
= TREE_CHAIN (t
);
10774 TREE_CHAIN (t
) = NULL_TREE
;
10775 *q
= tsubst_attribute (t
, decl_p
, args
, complain
, in_decl
);
10777 q
= &TREE_CHAIN (*q
);
10780 p
= &TREE_CHAIN (t
);
10783 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
10787 /* Perform (or defer) access check for typedefs that were referenced
10788 from within the template TMPL code.
10789 This is a subroutine of instantiate_decl and instantiate_class_template.
10790 TMPL is the template to consider and TARGS is the list of arguments of
10794 perform_typedefs_access_check (tree tmpl
, tree targs
)
10796 location_t saved_location
;
10798 qualified_typedef_usage_t
*iter
;
10801 || (!CLASS_TYPE_P (tmpl
)
10802 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
10805 saved_location
= input_location
;
10806 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
10808 tree type_decl
= iter
->typedef_decl
;
10809 tree type_scope
= iter
->context
;
10811 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
10814 if (uses_template_parms (type_decl
))
10815 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
10816 if (uses_template_parms (type_scope
))
10817 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
10819 /* Make access check error messages point to the location
10820 of the use of the typedef. */
10821 input_location
= iter
->locus
;
10822 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
10823 type_decl
, type_decl
,
10824 tf_warning_or_error
);
10826 input_location
= saved_location
;
10830 instantiate_class_template_1 (tree type
)
10832 tree templ
, args
, pattern
, t
, member
;
10836 unsigned int saved_maximum_field_alignment
;
10839 if (type
== error_mark_node
)
10840 return error_mark_node
;
10842 if (COMPLETE_OR_OPEN_TYPE_P (type
)
10843 || uses_template_parms (type
))
10846 /* Figure out which template is being instantiated. */
10847 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
10848 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
10850 /* Mark the type as in the process of being defined. */
10851 TYPE_BEING_DEFINED (type
) = 1;
10853 /* Determine what specialization of the original template to
10855 t
= most_specialized_partial_spec (type
, tf_warning_or_error
);
10856 if (t
== error_mark_node
)
10857 return error_mark_node
;
10860 /* This TYPE is actually an instantiation of a partial
10861 specialization. We replace the innermost set of ARGS with
10862 the arguments appropriate for substitution. For example,
10865 template <class T> struct S {};
10866 template <class T> struct S<T*> {};
10868 and supposing that we are instantiating S<int*>, ARGS will
10869 presently be {int*} -- but we need {int}. */
10870 pattern
= TREE_TYPE (t
);
10871 args
= TREE_PURPOSE (t
);
10875 pattern
= TREE_TYPE (templ
);
10876 args
= CLASSTYPE_TI_ARGS (type
);
10879 /* If the template we're instantiating is incomplete, then clearly
10880 there's nothing we can do. */
10881 if (!COMPLETE_TYPE_P (pattern
))
10883 /* We can try again later. */
10884 TYPE_BEING_DEFINED (type
) = 0;
10888 /* If we've recursively instantiated too many templates, stop. */
10889 if (! push_tinst_level (type
))
10892 /* We may be in the middle of deferred access check. Disable
10894 push_deferring_access_checks (dk_no_deferred
);
10896 int saved_unevaluated_operand
= cp_unevaluated_operand
;
10897 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
10899 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
10900 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
10901 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
10902 fn_context
= error_mark_node
;
10904 push_to_top_level ();
10907 cp_unevaluated_operand
= 0;
10908 c_inhibit_evaluation_warnings
= 0;
10910 /* Use #pragma pack from the template context. */
10911 saved_maximum_field_alignment
= maximum_field_alignment
;
10912 maximum_field_alignment
= TYPE_PRECISION (pattern
);
10914 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
10916 /* Set the input location to the most specialized template definition.
10917 This is needed if tsubsting causes an error. */
10918 typedecl
= TYPE_MAIN_DECL (pattern
);
10919 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
10920 DECL_SOURCE_LOCATION (typedecl
);
10922 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
10923 SET_TYPE_ALIGN (type
, TYPE_ALIGN (pattern
));
10924 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
10925 CLASSTYPE_NON_AGGREGATE (type
) = CLASSTYPE_NON_AGGREGATE (pattern
);
10926 if (ANON_AGGR_TYPE_P (pattern
))
10927 SET_ANON_AGGR_TYPE_P (type
);
10928 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
10930 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
10931 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
10932 /* Adjust visibility for template arguments. */
10933 determine_visibility (TYPE_MAIN_DECL (type
));
10935 if (CLASS_TYPE_P (type
))
10936 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
10938 pbinfo
= TYPE_BINFO (pattern
);
10940 /* We should never instantiate a nested class before its enclosing
10941 class; we need to look up the nested class by name before we can
10942 instantiate it, and that lookup should instantiate the enclosing
10944 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
10945 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
10947 base_list
= NULL_TREE
;
10948 if (BINFO_N_BASE_BINFOS (pbinfo
))
10954 /* We must enter the scope containing the type, as that is where
10955 the accessibility of types named in dependent bases are
10957 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
10959 /* Substitute into each of the bases to determine the actual
10961 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
10964 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
10965 tree expanded_bases
= NULL_TREE
;
10968 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
10971 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
10972 args
, tf_error
, NULL_TREE
);
10973 if (expanded_bases
== error_mark_node
)
10976 len
= TREE_VEC_LENGTH (expanded_bases
);
10979 for (idx
= 0; idx
< len
; idx
++)
10981 if (expanded_bases
)
10982 /* Extract the already-expanded base class. */
10983 base
= TREE_VEC_ELT (expanded_bases
, idx
);
10985 /* Substitute to figure out the base class. */
10986 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
10989 if (base
== error_mark_node
)
10992 base_list
= tree_cons (access
, base
, base_list
);
10993 if (BINFO_VIRTUAL_P (pbase_binfo
))
10994 TREE_TYPE (base_list
) = integer_type_node
;
10998 /* The list is now in reverse order; correct that. */
10999 base_list
= nreverse (base_list
);
11002 pop_scope (pushed_scope
);
11004 /* Now call xref_basetypes to set up all the base-class
11006 xref_basetypes (type
, base_list
);
11008 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
11009 (int) ATTR_FLAG_TYPE_IN_PLACE
,
11010 args
, tf_error
, NULL_TREE
);
11011 fixup_attribute_variants (type
);
11013 /* Now that our base classes are set up, enter the scope of the
11014 class, so that name lookups into base classes, etc. will work
11015 correctly. This is precisely analogous to what we do in
11016 begin_class_definition when defining an ordinary non-template
11017 class, except we also need to push the enclosing classes. */
11018 push_nested_class (type
);
11020 /* Now members are processed in the order of declaration. */
11021 for (member
= CLASSTYPE_DECL_LIST (pattern
);
11022 member
; member
= TREE_CHAIN (member
))
11024 tree t
= TREE_VALUE (member
);
11026 if (TREE_PURPOSE (member
))
11030 if (LAMBDA_TYPE_P (t
))
11031 /* A closure type for a lambda in an NSDMI or default argument.
11032 Ignore it; it will be regenerated when needed. */
11035 /* Build new CLASSTYPE_NESTED_UTDS. */
11038 bool class_template_p
;
11040 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
11041 && TYPE_LANG_SPECIFIC (t
)
11042 && CLASSTYPE_IS_TEMPLATE (t
));
11043 /* If the member is a class template, then -- even after
11044 substitution -- there may be dependent types in the
11045 template argument list for the class. We increment
11046 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
11047 that function will assume that no types are dependent
11048 when outside of a template. */
11049 if (class_template_p
)
11050 ++processing_template_decl
;
11051 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
11052 if (class_template_p
)
11053 --processing_template_decl
;
11054 if (newtag
== error_mark_node
)
11057 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
11059 tree name
= TYPE_IDENTIFIER (t
);
11061 if (class_template_p
)
11062 /* Unfortunately, lookup_template_class sets
11063 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
11064 instantiation (i.e., for the type of a member
11065 template class nested within a template class.)
11066 This behavior is required for
11067 maybe_process_partial_specialization to work
11068 correctly, but is not accurate in this case;
11069 the TAG is not an instantiation of anything.
11070 (The corresponding TEMPLATE_DECL is an
11071 instantiation, but the TYPE is not.) */
11072 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
11074 /* Now, we call pushtag to put this NEWTAG into the scope of
11075 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
11076 pushtag calling push_template_decl. We don't have to do
11077 this for enums because it will already have been done in
11080 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
11081 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
11084 else if (DECL_DECLARES_FUNCTION_P (t
))
11088 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11089 ++processing_template_decl
;
11090 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
11091 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11092 --processing_template_decl
;
11093 set_current_access_from_decl (r
);
11094 finish_member_declaration (r
);
11095 /* Instantiate members marked with attribute used. */
11096 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
11098 if (TREE_CODE (r
) == FUNCTION_DECL
11099 && DECL_OMP_DECLARE_REDUCTION_P (r
))
11100 cp_check_omp_declare_reduction (r
);
11102 else if ((DECL_CLASS_TEMPLATE_P (t
) || DECL_IMPLICIT_TYPEDEF_P (t
))
11103 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
11104 /* A closure type for a lambda in an NSDMI or default argument.
11105 Ignore it; it will be regenerated when needed. */;
11108 /* Build new TYPE_FIELDS. */
11109 if (TREE_CODE (t
) == STATIC_ASSERT
)
11113 ++c_inhibit_evaluation_warnings
;
11115 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
11116 tf_warning_or_error
, NULL_TREE
,
11117 /*integral_constant_expression_p=*/true);
11118 --c_inhibit_evaluation_warnings
;
11120 finish_static_assert (condition
,
11121 STATIC_ASSERT_MESSAGE (t
),
11122 STATIC_ASSERT_SOURCE_LOCATION (t
),
11123 /*member_p=*/true);
11125 else if (TREE_CODE (t
) != CONST_DECL
)
11128 tree vec
= NULL_TREE
;
11131 /* The file and line for this declaration, to
11132 assist in error message reporting. Since we
11133 called push_tinst_level above, we don't need to
11135 input_location
= DECL_SOURCE_LOCATION (t
);
11137 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11138 ++processing_template_decl
;
11139 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
11140 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11141 --processing_template_decl
;
11143 if (TREE_CODE (r
) == TREE_VEC
)
11145 /* A capture pack became multiple fields. */
11147 len
= TREE_VEC_LENGTH (vec
);
11150 for (int i
= 0; i
< len
; ++i
)
11153 r
= TREE_VEC_ELT (vec
, i
);
11158 [t]he initialization (and any associated
11159 side-effects) of a static data member does
11160 not occur unless the static data member is
11161 itself used in a way that requires the
11162 definition of the static data member to
11165 Therefore, we do not substitute into the
11166 initialized for the static data member here. */
11167 finish_static_data_member_decl
11169 /*init=*/NULL_TREE
,
11170 /*init_const_expr_p=*/false,
11171 /*asmspec_tree=*/NULL_TREE
,
11173 /* Instantiate members marked with attribute used. */
11174 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
11177 else if (TREE_CODE (r
) == FIELD_DECL
)
11179 /* Determine whether R has a valid type and can be
11180 completed later. If R is invalid, then its type
11181 is replaced by error_mark_node. */
11182 tree rtype
= TREE_TYPE (r
);
11183 if (can_complete_type_without_circularity (rtype
))
11184 complete_type (rtype
);
11186 if (!complete_or_array_type_p (rtype
))
11188 /* If R's type couldn't be completed and
11189 it isn't a flexible array member (whose
11190 type is incomplete by definition) give
11192 cxx_incomplete_type_error (r
, rtype
);
11193 TREE_TYPE (r
) = error_mark_node
;
11195 else if (TREE_CODE (rtype
) == ARRAY_TYPE
11196 && TYPE_DOMAIN (rtype
) == NULL_TREE
11197 && (TREE_CODE (type
) == UNION_TYPE
11198 || TREE_CODE (type
) == QUAL_UNION_TYPE
))
11200 error ("flexible array member %qD in union", r
);
11201 TREE_TYPE (r
) = error_mark_node
;
11205 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
11206 such a thing will already have been added to the field
11207 list by tsubst_enum in finish_member_declaration in the
11208 CLASSTYPE_NESTED_UTDS case above. */
11209 if (!(TREE_CODE (r
) == TYPE_DECL
11210 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
11211 && DECL_ARTIFICIAL (r
)))
11213 set_current_access_from_decl (r
);
11214 finish_member_declaration (r
);
11222 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
11223 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
11225 /* Build new CLASSTYPE_FRIEND_CLASSES. */
11227 tree friend_type
= t
;
11228 bool adjust_processing_template_decl
= false;
11230 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
11232 /* template <class T> friend class C; */
11233 friend_type
= tsubst_friend_class (friend_type
, args
);
11234 adjust_processing_template_decl
= true;
11236 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
11238 /* template <class T> friend class C::D; */
11239 friend_type
= tsubst (friend_type
, args
,
11240 tf_warning_or_error
, NULL_TREE
);
11241 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
11242 friend_type
= TREE_TYPE (friend_type
);
11243 adjust_processing_template_decl
= true;
11245 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
11246 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
11248 /* This could be either
11252 when dependent_type_p is false or
11254 template <class U> friend class T::C;
11257 /* Bump processing_template_decl in case this is something like
11258 template <class T> friend struct A<T>::B. */
11259 ++processing_template_decl
;
11260 friend_type
= tsubst (friend_type
, args
,
11261 tf_warning_or_error
, NULL_TREE
);
11262 if (dependent_type_p (friend_type
))
11263 adjust_processing_template_decl
= true;
11264 --processing_template_decl
;
11266 else if (TREE_CODE (friend_type
) != BOUND_TEMPLATE_TEMPLATE_PARM
11267 && !CLASSTYPE_USE_TEMPLATE (friend_type
)
11268 && TYPE_HIDDEN_P (friend_type
))
11272 where C hasn't been declared yet. Let's lookup name
11273 from namespace scope directly, bypassing any name that
11274 come from dependent base class. */
11275 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
11277 /* The call to xref_tag_from_type does injection for friend
11279 push_nested_namespace (ns
);
11281 xref_tag_from_type (friend_type
, NULL_TREE
,
11282 /*tag_scope=*/ts_current
);
11283 pop_nested_namespace (ns
);
11285 else if (uses_template_parms (friend_type
))
11286 /* friend class C<T>; */
11287 friend_type
= tsubst (friend_type
, args
,
11288 tf_warning_or_error
, NULL_TREE
);
11293 where C is already declared or
11295 friend class C<int>;
11297 We don't have to do anything in these cases. */
11299 if (adjust_processing_template_decl
)
11300 /* Trick make_friend_class into realizing that the friend
11301 we're adding is a template, not an ordinary class. It's
11302 important that we use make_friend_class since it will
11303 perform some error-checking and output cross-reference
11305 ++processing_template_decl
;
11307 if (friend_type
!= error_mark_node
)
11308 make_friend_class (type
, friend_type
, /*complain=*/false);
11310 if (adjust_processing_template_decl
)
11311 --processing_template_decl
;
11315 /* Build new DECL_FRIENDLIST. */
11318 /* The file and line for this declaration, to
11319 assist in error message reporting. Since we
11320 called push_tinst_level above, we don't need to
11322 input_location
= DECL_SOURCE_LOCATION (t
);
11324 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11326 ++processing_template_decl
;
11327 push_deferring_access_checks (dk_no_check
);
11330 r
= tsubst_friend_function (t
, args
);
11331 add_friend (type
, r
, /*complain=*/false);
11332 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11334 pop_deferring_access_checks ();
11335 --processing_template_decl
;
11343 /* Restore these before substituting into the lambda capture
11345 cp_unevaluated_operand
= saved_unevaluated_operand
;
11346 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
11349 /* Set the file and line number information to whatever is given for
11350 the class itself. This puts error messages involving generated
11351 implicit functions at a predictable point, and the same point
11352 that would be used for non-template classes. */
11353 input_location
= DECL_SOURCE_LOCATION (typedecl
);
11355 unreverse_member_declarations (type
);
11356 finish_struct_1 (type
);
11357 TYPE_BEING_DEFINED (type
) = 0;
11359 /* We don't instantiate default arguments for member functions. 14.7.1:
11361 The implicit instantiation of a class template specialization causes
11362 the implicit instantiation of the declarations, but not of the
11363 definitions or default arguments, of the class member functions,
11364 member classes, static data members and member templates.... */
11366 /* Some typedefs referenced from within the template code need to be access
11367 checked at template instantiation time, i.e now. These types were
11368 added to the template at parsing time. Let's get those and perform
11369 the access checks then. */
11370 perform_typedefs_access_check (pattern
, args
);
11371 perform_deferred_access_checks (tf_warning_or_error
);
11372 pop_nested_class ();
11373 maximum_field_alignment
= saved_maximum_field_alignment
;
11375 pop_from_top_level ();
11376 pop_deferring_access_checks ();
11377 pop_tinst_level ();
11379 /* The vtable for a template class can be emitted in any translation
11380 unit in which the class is instantiated. When there is no key
11381 method, however, finish_struct_1 will already have added TYPE to
11382 the keyed_classes. */
11383 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
11384 vec_safe_push (keyed_classes
, type
);
11389 /* Wrapper for instantiate_class_template_1. */
11392 instantiate_class_template (tree type
)
11395 timevar_push (TV_TEMPLATE_INST
);
11396 ret
= instantiate_class_template_1 (type
);
11397 timevar_pop (TV_TEMPLATE_INST
);
11402 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11408 else if (TYPE_P (t
))
11409 r
= tsubst (t
, args
, complain
, in_decl
);
11412 if (!(complain
& tf_warning
))
11413 ++c_inhibit_evaluation_warnings
;
11414 r
= tsubst_expr (t
, args
, complain
, in_decl
,
11415 /*integral_constant_expression_p=*/true);
11416 if (!(complain
& tf_warning
))
11417 --c_inhibit_evaluation_warnings
;
11422 /* Given a function parameter pack TMPL_PARM and some function parameters
11423 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
11424 and set *SPEC_P to point at the next point in the list. */
11427 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
11429 /* Collect all of the extra "packed" parameters into an
11432 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
11433 tree spec_parm
= *spec_p
;
11436 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
11438 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
11441 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
11442 parmvec
= make_tree_vec (len
);
11443 spec_parm
= *spec_p
;
11444 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
11446 tree elt
= spec_parm
;
11447 if (DECL_PACK_P (elt
))
11448 elt
= make_pack_expansion (elt
);
11449 TREE_VEC_ELT (parmvec
, i
) = elt
;
11452 /* Build the argument packs. */
11453 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
11454 *spec_p
= spec_parm
;
11459 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
11460 NONTYPE_ARGUMENT_PACK. */
11463 make_fnparm_pack (tree spec_parm
)
11465 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
11468 /* Return 1 if the Ith element of the argument pack ARG_PACK is a
11469 pack expansion with no extra args, 2 if it has extra args, or 0
11470 if it is not a pack expansion. */
11473 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
11475 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
11476 if (i
>= TREE_VEC_LENGTH (vec
))
11478 tree elt
= TREE_VEC_ELT (vec
, i
);
11480 /* A decl pack is itself an expansion. */
11481 elt
= TREE_TYPE (elt
);
11482 if (!PACK_EXPANSION_P (elt
))
11484 if (PACK_EXPANSION_EXTRA_ARGS (elt
))
11490 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
11493 make_argument_pack_select (tree arg_pack
, unsigned index
)
11495 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
11497 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
11498 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
11503 /* This is a subroutine of tsubst_pack_expansion.
11505 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
11506 mechanism to store the (non complete list of) arguments of the
11507 substitution and return a non substituted pack expansion, in order
11508 to wait for when we have enough arguments to really perform the
11512 use_pack_expansion_extra_args_p (tree parm_packs
,
11514 bool has_empty_arg
)
11516 /* If one pack has an expansion and another pack has a normal
11517 argument or if one pack has an empty argument and an another
11518 one hasn't then tsubst_pack_expansion cannot perform the
11519 substitution and need to fall back on the
11520 PACK_EXPANSION_EXTRA mechanism. */
11521 if (parm_packs
== NULL_TREE
)
11523 else if (has_empty_arg
)
11526 bool has_expansion_arg
= false;
11527 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
11529 bool has_non_expansion_arg
= false;
11530 for (tree parm_pack
= parm_packs
;
11532 parm_pack
= TREE_CHAIN (parm_pack
))
11534 tree arg
= TREE_VALUE (parm_pack
);
11536 int exp
= argument_pack_element_is_expansion_p (arg
, i
);
11538 /* We can't substitute a pack expansion with extra args into
11542 has_expansion_arg
= true;
11544 has_non_expansion_arg
= true;
11547 if (has_expansion_arg
&& has_non_expansion_arg
)
11553 /* [temp.variadic]/6 says that:
11555 The instantiation of a pack expansion [...]
11556 produces a list E1,E2, ..., En, where N is the number of elements
11557 in the pack expansion parameters.
11559 This subroutine of tsubst_pack_expansion produces one of these Ei.
11561 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
11562 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
11563 PATTERN, and each TREE_VALUE is its corresponding argument pack.
11564 INDEX is the index 'i' of the element Ei to produce. ARGS,
11565 COMPLAIN, and IN_DECL are the same parameters as for the
11566 tsubst_pack_expansion function.
11568 The function returns the resulting Ei upon successful completion,
11569 or error_mark_node.
11571 Note that this function possibly modifies the ARGS parameter, so
11572 it's the responsibility of the caller to restore it. */
11575 gen_elem_of_pack_expansion_instantiation (tree pattern
,
11578 tree args
/* This parm gets
11580 tsubst_flags_t complain
,
11584 bool ith_elem_is_expansion
= false;
11586 /* For each parameter pack, change the substitution of the parameter
11587 pack to the ith argument in its argument pack, then expand the
11589 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
11591 tree parm
= TREE_PURPOSE (pack
);
11592 tree arg_pack
= TREE_VALUE (pack
);
11593 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
11595 ith_elem_is_expansion
|=
11596 argument_pack_element_is_expansion_p (arg_pack
, index
);
11598 /* Select the Ith argument from the pack. */
11599 if (TREE_CODE (parm
) == PARM_DECL
11601 || TREE_CODE (parm
) == FIELD_DECL
)
11605 aps
= make_argument_pack_select (arg_pack
, index
);
11606 if (!mark_used (parm
, complain
) && !(complain
& tf_error
))
11607 return error_mark_node
;
11608 register_local_specialization (aps
, parm
);
11611 aps
= retrieve_local_specialization (parm
);
11616 template_parm_level_and_index (parm
, &level
, &idx
);
11620 aps
= make_argument_pack_select (arg_pack
, index
);
11621 /* Update the corresponding argument. */
11622 TMPL_ARG (args
, level
, idx
) = aps
;
11625 /* Re-use the ARGUMENT_PACK_SELECT. */
11626 aps
= TMPL_ARG (args
, level
, idx
);
11628 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
11631 /* Substitute into the PATTERN with the (possibly altered)
11633 if (pattern
== in_decl
)
11634 /* Expanding a fixed parameter pack from
11635 coerce_template_parameter_pack. */
11636 t
= tsubst_decl (pattern
, args
, complain
);
11637 else if (pattern
== error_mark_node
)
11638 t
= error_mark_node
;
11639 else if (constraint_p (pattern
))
11641 if (processing_template_decl
)
11642 t
= tsubst_constraint (pattern
, args
, complain
, in_decl
);
11644 t
= (constraints_satisfied_p (pattern
, args
)
11645 ? boolean_true_node
: boolean_false_node
);
11647 else if (!TYPE_P (pattern
))
11648 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
11649 /*integral_constant_expression_p=*/false);
11651 t
= tsubst (pattern
, args
, complain
, in_decl
);
11653 /* If the Ith argument pack element is a pack expansion, then
11654 the Ith element resulting from the substituting is going to
11655 be a pack expansion as well. */
11656 if (ith_elem_is_expansion
)
11657 t
= make_pack_expansion (t
, complain
);
11662 /* When the unexpanded parameter pack in a fold expression expands to an empty
11663 sequence, the value of the expression is as follows; the program is
11664 ill-formed if the operator is not listed in this table.
11671 expand_empty_fold (tree t
, tsubst_flags_t complain
)
11673 tree_code code
= (tree_code
)TREE_INT_CST_LOW (TREE_OPERAND (t
, 0));
11674 if (!FOLD_EXPR_MODIFY_P (t
))
11677 case TRUTH_ANDIF_EXPR
:
11678 return boolean_true_node
;
11679 case TRUTH_ORIF_EXPR
:
11680 return boolean_false_node
;
11681 case COMPOUND_EXPR
:
11687 if (complain
& tf_error
)
11688 error_at (location_of (t
),
11689 "fold of empty expansion over %O", code
);
11690 return error_mark_node
;
11693 /* Given a fold-expression T and a current LEFT and RIGHT operand,
11694 form an expression that combines the two terms using the
11698 fold_expression (tree t
, tree left
, tree right
, tsubst_flags_t complain
)
11700 tree op
= FOLD_EXPR_OP (t
);
11701 tree_code code
= (tree_code
)TREE_INT_CST_LOW (op
);
11703 // Handle compound assignment operators.
11704 if (FOLD_EXPR_MODIFY_P (t
))
11705 return build_x_modify_expr (input_location
, left
, code
, right
, complain
);
11709 case COMPOUND_EXPR
:
11710 return build_x_compound_expr (input_location
, left
, right
, complain
);
11712 return build_m_component_ref (left
, right
, complain
);
11714 return build_x_binary_op (input_location
, code
,
11715 left
, TREE_CODE (left
),
11716 right
, TREE_CODE (right
),
11722 /* Substitute ARGS into the pack of a fold expression T. */
11725 tsubst_fold_expr_pack (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11727 return tsubst_pack_expansion (FOLD_EXPR_PACK (t
), args
, complain
, in_decl
);
11730 /* Substitute ARGS into the pack of a fold expression T. */
11733 tsubst_fold_expr_init (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11735 return tsubst_expr (FOLD_EXPR_INIT (t
), args
, complain
, in_decl
, false);
11738 /* Expand a PACK of arguments into a grouped as left fold.
11739 Given a pack containing elements A0, A1, ..., An and an
11740 operator @, this builds the expression:
11742 ((A0 @ A1) @ A2) ... @ An
11744 Note that PACK must not be empty.
11746 The operator is defined by the original fold expression T. */
11749 expand_left_fold (tree t
, tree pack
, tsubst_flags_t complain
)
11751 tree left
= TREE_VEC_ELT (pack
, 0);
11752 for (int i
= 1; i
< TREE_VEC_LENGTH (pack
); ++i
)
11754 tree right
= TREE_VEC_ELT (pack
, i
);
11755 left
= fold_expression (t
, left
, right
, complain
);
11760 /* Substitute into a unary left fold expression. */
11763 tsubst_unary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
11766 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
11767 if (pack
== error_mark_node
)
11768 return error_mark_node
;
11769 if (PACK_EXPANSION_P (pack
))
11771 tree r
= copy_node (t
);
11772 FOLD_EXPR_PACK (r
) = pack
;
11775 if (TREE_VEC_LENGTH (pack
) == 0)
11776 return expand_empty_fold (t
, complain
);
11778 return expand_left_fold (t
, pack
, complain
);
11781 /* Substitute into a binary left fold expression.
11783 Do ths by building a single (non-empty) vector of argumnts and
11784 building the expression from those elements. */
11787 tsubst_binary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
11790 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
11791 if (pack
== error_mark_node
)
11792 return error_mark_node
;
11793 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
11794 if (init
== error_mark_node
)
11795 return error_mark_node
;
11797 if (PACK_EXPANSION_P (pack
))
11799 tree r
= copy_node (t
);
11800 FOLD_EXPR_PACK (r
) = pack
;
11801 FOLD_EXPR_INIT (r
) = init
;
11805 tree vec
= make_tree_vec (TREE_VEC_LENGTH (pack
) + 1);
11806 TREE_VEC_ELT (vec
, 0) = init
;
11807 for (int i
= 0; i
< TREE_VEC_LENGTH (pack
); ++i
)
11808 TREE_VEC_ELT (vec
, i
+ 1) = TREE_VEC_ELT (pack
, i
);
11810 return expand_left_fold (t
, vec
, complain
);
11813 /* Expand a PACK of arguments into a grouped as right fold.
11814 Given a pack containing elementns A0, A1, ..., and an
11815 operator @, this builds the expression:
11817 A0@ ... (An-2 @ (An-1 @ An))
11819 Note that PACK must not be empty.
11821 The operator is defined by the original fold expression T. */
11824 expand_right_fold (tree t
, tree pack
, tsubst_flags_t complain
)
11826 // Build the expression.
11827 int n
= TREE_VEC_LENGTH (pack
);
11828 tree right
= TREE_VEC_ELT (pack
, n
- 1);
11829 for (--n
; n
!= 0; --n
)
11831 tree left
= TREE_VEC_ELT (pack
, n
- 1);
11832 right
= fold_expression (t
, left
, right
, complain
);
11837 /* Substitute into a unary right fold expression. */
11840 tsubst_unary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
11843 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
11844 if (pack
== error_mark_node
)
11845 return error_mark_node
;
11846 if (PACK_EXPANSION_P (pack
))
11848 tree r
= copy_node (t
);
11849 FOLD_EXPR_PACK (r
) = pack
;
11852 if (TREE_VEC_LENGTH (pack
) == 0)
11853 return expand_empty_fold (t
, complain
);
11855 return expand_right_fold (t
, pack
, complain
);
11858 /* Substitute into a binary right fold expression.
11860 Do ths by building a single (non-empty) vector of arguments and
11861 building the expression from those elements. */
11864 tsubst_binary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
11867 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
11868 if (pack
== error_mark_node
)
11869 return error_mark_node
;
11870 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
11871 if (init
== error_mark_node
)
11872 return error_mark_node
;
11874 if (PACK_EXPANSION_P (pack
))
11876 tree r
= copy_node (t
);
11877 FOLD_EXPR_PACK (r
) = pack
;
11878 FOLD_EXPR_INIT (r
) = init
;
11882 int n
= TREE_VEC_LENGTH (pack
);
11883 tree vec
= make_tree_vec (n
+ 1);
11884 for (int i
= 0; i
< n
; ++i
)
11885 TREE_VEC_ELT (vec
, i
) = TREE_VEC_ELT (pack
, i
);
11886 TREE_VEC_ELT (vec
, n
) = init
;
11888 return expand_right_fold (t
, vec
, complain
);
11891 /* Walk through the pattern of a pack expansion, adding everything in
11892 local_specializations to a list. */
11896 hash_set
<tree
> internal
;
11898 tsubst_flags_t complain
;
11900 el_data (tsubst_flags_t c
)
11901 : extra (NULL_TREE
), complain (c
) {}
11904 extract_locals_r (tree
*tp
, int */
*walk_subtrees*/
, void *data_
)
11906 el_data
&data
= *reinterpret_cast<el_data
*>(data_
);
11907 tree
*extra
= &data
.extra
;
11908 tsubst_flags_t complain
= data
.complain
;
11910 if (TYPE_P (*tp
) && typedef_variant_p (*tp
))
11911 /* Remember local typedefs (85214). */
11912 tp
= &TYPE_NAME (*tp
);
11914 if (TREE_CODE (*tp
) == DECL_EXPR
)
11915 data
.internal
.add (DECL_EXPR_DECL (*tp
));
11916 else if (tree spec
= retrieve_local_specialization (*tp
))
11918 if (data
.internal
.contains (*tp
))
11919 /* Don't mess with variables declared within the pattern. */
11921 if (TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
)
11923 /* Maybe pull out the PARM_DECL for a partial instantiation. */
11924 tree args
= ARGUMENT_PACK_ARGS (spec
);
11925 if (TREE_VEC_LENGTH (args
) == 1)
11927 tree elt
= TREE_VEC_ELT (args
, 0);
11928 if (PACK_EXPANSION_P (elt
))
11929 elt
= PACK_EXPANSION_PATTERN (elt
);
11930 if (DECL_PACK_P (elt
))
11933 if (TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
)
11935 /* Handle lambda capture here, since we aren't doing any
11936 substitution now, and so tsubst_copy won't call
11937 process_outer_var_ref. */
11938 tree args
= ARGUMENT_PACK_ARGS (spec
);
11939 int len
= TREE_VEC_LENGTH (args
);
11940 for (int i
= 0; i
< len
; ++i
)
11942 tree arg
= TREE_VEC_ELT (args
, i
);
11944 if (outer_automatic_var_p (arg
))
11945 carg
= process_outer_var_ref (arg
, complain
);
11948 /* Make a new NONTYPE_ARGUMENT_PACK of the capture
11952 spec
= copy_node (spec
);
11953 args
= copy_node (args
);
11954 SET_ARGUMENT_PACK_ARGS (spec
, args
);
11955 register_local_specialization (spec
, *tp
);
11957 TREE_VEC_ELT (args
, i
) = carg
;
11962 if (outer_automatic_var_p (spec
))
11963 spec
= process_outer_var_ref (spec
, complain
);
11964 *extra
= tree_cons (*tp
, spec
, *extra
);
11969 extract_local_specs (tree pattern
, tsubst_flags_t complain
)
11971 el_data
data (complain
);
11972 cp_walk_tree_without_duplicates (&pattern
, extract_locals_r
, &data
);
11976 /* Extract any uses of local_specializations from PATTERN and add them to ARGS
11977 for use in PACK_EXPANSION_EXTRA_ARGS. */
11980 build_extra_args (tree pattern
, tree args
, tsubst_flags_t complain
)
11983 if (local_specializations
)
11984 if (tree locals
= extract_local_specs (pattern
, complain
))
11985 extra
= tree_cons (NULL_TREE
, extra
, locals
);
11989 /* Apply any local specializations from PACK_EXPANSION_EXTRA_ARGS and add the
11990 normal template args to ARGS. */
11993 add_extra_args (tree extra
, tree args
)
11995 if (extra
&& TREE_CODE (extra
) == TREE_LIST
)
11997 for (tree elt
= TREE_CHAIN (extra
); elt
; elt
= TREE_CHAIN (elt
))
11999 /* The partial instantiation involved local declarations collected in
12000 extract_local_specs; map from the general template to our local
12002 tree gen
= TREE_PURPOSE (elt
);
12003 tree inst
= TREE_VALUE (elt
);
12005 if (tree local
= retrieve_local_specialization (inst
))
12007 /* else inst is already a full instantiation of the pack. */
12008 register_local_specialization (inst
, gen
);
12010 gcc_assert (!TREE_PURPOSE (extra
));
12011 extra
= TREE_VALUE (extra
);
12013 return add_to_template_args (extra
, args
);
12016 /* Substitute ARGS into T, which is an pack expansion
12017 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
12018 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
12019 (if only a partial substitution could be performed) or
12020 ERROR_MARK_NODE if there was an error. */
12022 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
12026 tree pack
, packs
= NULL_TREE
;
12027 bool unsubstituted_packs
= false;
12028 bool unsubstituted_fn_pack
= false;
12031 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
12032 bool need_local_specializations
= false;
12035 gcc_assert (PACK_EXPANSION_P (t
));
12036 pattern
= PACK_EXPANSION_PATTERN (t
);
12038 /* Add in any args remembered from an earlier partial instantiation. */
12039 args
= add_extra_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
12041 levels
= TMPL_ARGS_DEPTH (args
);
12043 /* Determine the argument packs that will instantiate the parameter
12044 packs used in the expansion expression. While we're at it,
12045 compute the number of arguments to be expanded and make sure it
12047 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
12048 pack
= TREE_CHAIN (pack
))
12050 tree parm_pack
= TREE_VALUE (pack
);
12051 tree arg_pack
= NULL_TREE
;
12052 tree orig_arg
= NULL_TREE
;
12055 if (TREE_CODE (parm_pack
) == BASES
)
12057 gcc_assert (parm_pack
== pattern
);
12058 if (BASES_DIRECT (parm_pack
))
12059 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
12064 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
12065 args
, complain
, in_decl
,
12068 else if (builtin_pack_call_p (parm_pack
))
12070 if (parm_pack
!= pattern
)
12072 if (complain
& tf_error
)
12073 sorry ("%qE is not the entire pattern of the pack expansion",
12075 return error_mark_node
;
12077 return expand_builtin_pack_call (parm_pack
, args
,
12078 complain
, in_decl
);
12080 else if (TREE_CODE (parm_pack
) == PARM_DECL
)
12082 /* We know we have correct local_specializations if this
12083 expansion is at function scope, or if we're dealing with a
12084 local parameter in a requires expression; for the latter,
12085 tsubst_requires_expr set it up appropriately. */
12086 if (PACK_EXPANSION_LOCAL_P (t
) || CONSTRAINT_VAR_P (parm_pack
))
12087 arg_pack
= retrieve_local_specialization (parm_pack
);
12089 /* We can't rely on local_specializations for a parameter
12090 name used later in a function declaration (such as in a
12091 late-specified return type). Even if it exists, it might
12092 have the wrong value for a recursive call. */
12093 need_local_specializations
= true;
12097 /* This parameter pack was used in an unevaluated context. Just
12098 make a dummy decl, since it's only used for its type. */
12099 ++cp_unevaluated_operand
;
12100 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
12101 --cp_unevaluated_operand
;
12102 if (arg_pack
&& DECL_PACK_P (arg_pack
))
12103 /* Partial instantiation of the parm_pack, we can't build
12104 up an argument pack yet. */
12105 arg_pack
= NULL_TREE
;
12107 arg_pack
= make_fnparm_pack (arg_pack
);
12109 else if (argument_pack_element_is_expansion_p (arg_pack
, 0))
12110 /* This argument pack isn't fully instantiated yet. We set this
12111 flag rather than clear arg_pack because we do want to do the
12112 optimization below, and we don't want to substitute directly
12113 into the pattern (as that would expose a NONTYPE_ARGUMENT_PACK
12114 where it isn't expected). */
12115 unsubstituted_fn_pack
= true;
12117 else if (is_normal_capture_proxy (parm_pack
))
12119 arg_pack
= retrieve_local_specialization (parm_pack
);
12120 if (argument_pack_element_is_expansion_p (arg_pack
, 0))
12121 unsubstituted_fn_pack
= true;
12126 template_parm_level_and_index (parm_pack
, &level
, &idx
);
12128 if (level
<= levels
)
12129 arg_pack
= TMPL_ARG (args
, level
, idx
);
12132 orig_arg
= arg_pack
;
12133 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
12134 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
12136 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
12137 /* This can only happen if we forget to expand an argument
12138 pack somewhere else. Just return an error, silently. */
12140 result
= make_tree_vec (1);
12141 TREE_VEC_ELT (result
, 0) = error_mark_node
;
12148 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
12150 /* Don't bother trying to do a partial substitution with
12151 incomplete packs; we'll try again after deduction. */
12152 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
12157 else if (len
!= my_len
12158 && !unsubstituted_fn_pack
)
12160 if (!(complain
& tf_error
))
12161 /* Fail quietly. */;
12162 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
12163 error ("mismatched argument pack lengths while expanding %qT",
12166 error ("mismatched argument pack lengths while expanding %qE",
12168 return error_mark_node
;
12171 /* Keep track of the parameter packs and their corresponding
12173 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
12174 TREE_TYPE (packs
) = orig_arg
;
12178 /* We can't substitute for this parameter pack. We use a flag as
12179 well as the missing_level counter because function parameter
12180 packs don't have a level. */
12181 gcc_assert (processing_template_decl
|| is_auto (parm_pack
));
12182 unsubstituted_packs
= true;
12186 /* If the expansion is just T..., return the matching argument pack, unless
12187 we need to call convert_from_reference on all the elements. This is an
12188 important optimization; see c++/68422. */
12189 if (!unsubstituted_packs
12190 && TREE_PURPOSE (packs
) == pattern
)
12192 tree args
= ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
12194 /* If the argument pack is a single pack expansion, pull it out. */
12195 if (TREE_VEC_LENGTH (args
) == 1
12196 && pack_expansion_args_count (args
))
12197 return TREE_VEC_ELT (args
, 0);
12199 /* Types need no adjustment, nor does sizeof..., and if we still have
12200 some pack expansion args we won't do anything yet. */
12201 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
12202 || PACK_EXPANSION_SIZEOF_P (t
)
12203 || pack_expansion_args_count (args
))
12205 /* Also optimize expression pack expansions if we can tell that the
12206 elements won't have reference type. */
12207 tree type
= TREE_TYPE (pattern
);
12208 if (type
&& !TYPE_REF_P (type
)
12209 && !PACK_EXPANSION_P (type
)
12210 && !WILDCARD_TYPE_P (type
))
12212 /* Otherwise use the normal path so we get convert_from_reference. */
12215 /* We cannot expand this expansion expression, because we don't have
12216 all of the argument packs we need. */
12217 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
12219 /* We got some full packs, but we can't substitute them in until we
12220 have values for all the packs. So remember these until then. */
12222 t
= make_pack_expansion (pattern
, complain
);
12223 PACK_EXPANSION_EXTRA_ARGS (t
)
12224 = build_extra_args (pattern
, args
, complain
);
12227 else if (unsubstituted_packs
)
12229 /* There were no real arguments, we're just replacing a parameter
12230 pack with another version of itself. Substitute into the
12231 pattern and return a PACK_EXPANSION_*. The caller will need to
12233 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
12234 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
12235 /*integral_constant_expression_p=*/false);
12237 t
= tsubst (pattern
, args
, complain
, in_decl
);
12238 t
= make_pack_expansion (t
, complain
);
12242 gcc_assert (len
>= 0);
12244 if (need_local_specializations
)
12246 /* We're in a late-specified return type, so create our own local
12247 specializations map; the current map is either NULL or (in the
12248 case of recursive unification) might have bindings that we don't
12249 want to use or alter. */
12250 saved_local_specializations
= local_specializations
;
12251 local_specializations
= new hash_map
<tree
, tree
>;
12254 /* For each argument in each argument pack, substitute into the
12256 result
= make_tree_vec (len
);
12257 tree elem_args
= copy_template_args (args
);
12258 for (i
= 0; i
< len
; ++i
)
12260 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
12262 elem_args
, complain
,
12264 TREE_VEC_ELT (result
, i
) = t
;
12265 if (t
== error_mark_node
)
12267 result
= error_mark_node
;
12272 /* Update ARGS to restore the substitution from parameter packs to
12273 their argument packs. */
12274 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
12276 tree parm
= TREE_PURPOSE (pack
);
12278 if (TREE_CODE (parm
) == PARM_DECL
12280 || TREE_CODE (parm
) == FIELD_DECL
)
12281 register_local_specialization (TREE_TYPE (pack
), parm
);
12286 if (TREE_VALUE (pack
) == NULL_TREE
)
12289 template_parm_level_and_index (parm
, &level
, &idx
);
12291 /* Update the corresponding argument. */
12292 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
12293 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
12296 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
12300 if (need_local_specializations
)
12302 delete local_specializations
;
12303 local_specializations
= saved_local_specializations
;
12306 /* If the dependent pack arguments were such that we end up with only a
12307 single pack expansion again, there's no need to keep it in a TREE_VEC. */
12308 if (len
== 1 && TREE_CODE (result
) == TREE_VEC
12309 && PACK_EXPANSION_P (TREE_VEC_ELT (result
, 0)))
12310 return TREE_VEC_ELT (result
, 0);
12315 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
12316 TMPL. We do this using DECL_PARM_INDEX, which should work even with
12317 parameter packs; all parms generated from a function parameter pack will
12318 have the same DECL_PARM_INDEX. */
12321 get_pattern_parm (tree parm
, tree tmpl
)
12323 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
12326 if (DECL_ARTIFICIAL (parm
))
12328 for (patparm
= DECL_ARGUMENTS (pattern
);
12329 patparm
; patparm
= DECL_CHAIN (patparm
))
12330 if (DECL_ARTIFICIAL (patparm
)
12331 && DECL_NAME (parm
) == DECL_NAME (patparm
))
12336 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
12337 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
12338 gcc_assert (DECL_PARM_INDEX (patparm
)
12339 == DECL_PARM_INDEX (parm
));
12345 /* Make an argument pack out of the TREE_VEC VEC. */
12348 make_argument_pack (tree vec
)
12351 tree elt
= TREE_VEC_ELT (vec
, 0);
12353 pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
12356 pack
= make_node (NONTYPE_ARGUMENT_PACK
);
12357 TREE_CONSTANT (pack
) = 1;
12359 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
12363 /* Return an exact copy of template args T that can be modified
12367 copy_template_args (tree t
)
12369 if (t
== error_mark_node
)
12372 int len
= TREE_VEC_LENGTH (t
);
12373 tree new_vec
= make_tree_vec (len
);
12375 for (int i
= 0; i
< len
; ++i
)
12377 tree elt
= TREE_VEC_ELT (t
, i
);
12378 if (elt
&& TREE_CODE (elt
) == TREE_VEC
)
12379 elt
= copy_template_args (elt
);
12380 TREE_VEC_ELT (new_vec
, i
) = elt
;
12383 NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_vec
)
12384 = NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
);
12389 /* Substitute ARGS into the vector or list of template arguments T. */
12392 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12395 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
12398 if (t
== error_mark_node
)
12399 return error_mark_node
;
12401 len
= TREE_VEC_LENGTH (t
);
12402 elts
= XALLOCAVEC (tree
, len
);
12404 for (i
= 0; i
< len
; i
++)
12406 tree orig_arg
= TREE_VEC_ELT (t
, i
);
12409 if (TREE_CODE (orig_arg
) == TREE_VEC
)
12410 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
12411 else if (PACK_EXPANSION_P (orig_arg
))
12413 /* Substitute into an expansion expression. */
12414 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
12416 if (TREE_CODE (new_arg
) == TREE_VEC
)
12417 /* Add to the expanded length adjustment the number of
12418 expanded arguments. We subtract one from this
12419 measurement, because the argument pack expression
12420 itself is already counted as 1 in
12421 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
12422 the argument pack is empty. */
12423 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
12425 else if (ARGUMENT_PACK_P (orig_arg
))
12427 /* Substitute into each of the arguments. */
12428 new_arg
= TYPE_P (orig_arg
)
12429 ? cxx_make_type (TREE_CODE (orig_arg
))
12430 : make_node (TREE_CODE (orig_arg
));
12432 tree pack_args
= tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
12433 args
, complain
, in_decl
);
12434 if (pack_args
== error_mark_node
)
12435 new_arg
= error_mark_node
;
12437 SET_ARGUMENT_PACK_ARGS (new_arg
, pack_args
);
12439 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
)
12440 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
12443 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
12445 if (new_arg
== error_mark_node
)
12446 return error_mark_node
;
12449 if (new_arg
!= orig_arg
)
12456 /* Make space for the expanded arguments coming from template
12458 t
= make_tree_vec (len
+ expanded_len_adjust
);
12459 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
12460 arguments for a member template.
12461 In that case each TREE_VEC in ORIG_T represents a level of template
12462 arguments, and ORIG_T won't carry any non defaulted argument count.
12463 It will rather be the nested TREE_VECs that will carry one.
12464 In other words, ORIG_T carries a non defaulted argument count only
12465 if it doesn't contain any nested TREE_VEC. */
12466 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
12468 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
12469 count
+= expanded_len_adjust
;
12470 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
12472 for (i
= 0, out
= 0; i
< len
; i
++)
12474 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
12475 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
12476 && TREE_CODE (elts
[i
]) == TREE_VEC
)
12480 /* Now expand the template argument pack "in place". */
12481 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
12482 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
12486 TREE_VEC_ELT (t
, out
) = elts
[i
];
12494 /* Substitute ARGS into one level PARMS of template parameters. */
12497 tsubst_template_parms_level (tree parms
, tree args
, tsubst_flags_t complain
)
12499 if (parms
== error_mark_node
)
12500 return error_mark_node
;
12502 tree new_vec
= make_tree_vec (TREE_VEC_LENGTH (parms
));
12504 for (int i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
12506 tree tuple
= TREE_VEC_ELT (parms
, i
);
12508 if (tuple
== error_mark_node
)
12511 TREE_VEC_ELT (new_vec
, i
) =
12512 tsubst_template_parm (tuple
, args
, complain
);
12518 /* Return the result of substituting ARGS into the template parameters
12519 given by PARMS. If there are m levels of ARGS and m + n levels of
12520 PARMS, then the result will contain n levels of PARMS. For
12521 example, if PARMS is `template <class T> template <class U>
12522 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
12523 result will be `template <int*, double, class V>'. */
12526 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
12528 tree r
= NULL_TREE
;
12531 /* When substituting into a template, we must set
12532 PROCESSING_TEMPLATE_DECL as the template parameters may be
12533 dependent if they are based on one-another, and the dependency
12534 predicates are short-circuit outside of templates. */
12535 ++processing_template_decl
;
12537 for (new_parms
= &r
;
12538 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
12539 new_parms
= &(TREE_CHAIN (*new_parms
)),
12540 parms
= TREE_CHAIN (parms
))
12542 tree new_vec
= tsubst_template_parms_level (TREE_VALUE (parms
),
12545 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
12546 - TMPL_ARGS_DEPTH (args
)),
12547 new_vec
, NULL_TREE
);
12550 --processing_template_decl
;
12555 /* Return the result of substituting ARGS into one template parameter
12556 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
12557 parameter and which TREE_PURPOSE is the default argument of the
12558 template parameter. */
12561 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
12563 tree default_value
, parm_decl
;
12565 if (args
== NULL_TREE
12567 || t
== error_mark_node
)
12570 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
12572 default_value
= TREE_PURPOSE (t
);
12573 parm_decl
= TREE_VALUE (t
);
12575 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
12576 if (TREE_CODE (parm_decl
) == PARM_DECL
12577 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
12578 parm_decl
= error_mark_node
;
12579 default_value
= tsubst_template_arg (default_value
, args
,
12580 complain
, NULL_TREE
);
12582 return build_tree_list (default_value
, parm_decl
);
12585 /* Substitute the ARGS into the indicated aggregate (or enumeration)
12586 type T. If T is not an aggregate or enumeration type, it is
12587 handled as if by tsubst. IN_DECL is as for tsubst. If
12588 ENTERING_SCOPE is nonzero, T is the context for a template which
12589 we are presently tsubst'ing. Return the substituted value. */
12592 tsubst_aggr_type (tree t
,
12594 tsubst_flags_t complain
,
12596 int entering_scope
)
12598 if (t
== NULL_TREE
)
12601 switch (TREE_CODE (t
))
12604 if (TYPE_PTRMEMFUNC_P (t
))
12605 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
12607 /* Fall through. */
12608 case ENUMERAL_TYPE
:
12610 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
12615 int saved_unevaluated_operand
;
12616 int saved_inhibit_evaluation_warnings
;
12618 /* In "sizeof(X<I>)" we need to evaluate "I". */
12619 saved_unevaluated_operand
= cp_unevaluated_operand
;
12620 cp_unevaluated_operand
= 0;
12621 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
12622 c_inhibit_evaluation_warnings
= 0;
12624 /* First, determine the context for the type we are looking
12626 context
= TYPE_CONTEXT (t
);
12627 if (context
&& TYPE_P (context
))
12629 context
= tsubst_aggr_type (context
, args
, complain
,
12630 in_decl
, /*entering_scope=*/1);
12631 /* If context is a nested class inside a class template,
12632 it may still need to be instantiated (c++/33959). */
12633 context
= complete_type (context
);
12636 /* Then, figure out what arguments are appropriate for the
12637 type we are trying to find. For example, given:
12639 template <class T> struct S;
12640 template <class T, class U> void f(T, U) { S<U> su; }
12642 and supposing that we are instantiating f<int, double>,
12643 then our ARGS will be {int, double}, but, when looking up
12644 S we only want {double}. */
12645 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
12646 complain
, in_decl
);
12647 if (argvec
== error_mark_node
)
12648 r
= error_mark_node
;
12651 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
12652 entering_scope
, complain
);
12653 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
12656 cp_unevaluated_operand
= saved_unevaluated_operand
;
12657 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
12662 /* This is not a template type, so there's nothing to do. */
12666 return tsubst (t
, args
, complain
, in_decl
);
12670 static GTY((cache
)) tree_cache_map
*defarg_inst
;
12672 /* Substitute into the default argument ARG (a default argument for
12673 FN), which has the indicated TYPE. */
12676 tsubst_default_argument (tree fn
, int parmnum
, tree type
, tree arg
,
12677 tsubst_flags_t complain
)
12679 tree saved_class_ptr
= NULL_TREE
;
12680 tree saved_class_ref
= NULL_TREE
;
12681 int errs
= errorcount
+ sorrycount
;
12683 /* This can happen in invalid code. */
12684 if (TREE_CODE (arg
) == DEFAULT_ARG
)
12687 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
12688 parm
= chain_index (parmnum
, parm
);
12689 tree parmtype
= TREE_TYPE (parm
);
12690 if (DECL_BY_REFERENCE (parm
))
12691 parmtype
= TREE_TYPE (parmtype
);
12692 if (parmtype
== error_mark_node
)
12693 return error_mark_node
;
12695 gcc_assert (same_type_ignoring_top_level_qualifiers_p (type
, parmtype
));
12698 if (defarg_inst
&& (slot
= defarg_inst
->get (parm
)))
12701 /* This default argument came from a template. Instantiate the
12702 default argument here, not in tsubst. In the case of
12711 we must be careful to do name lookup in the scope of S<T>,
12712 rather than in the current class. */
12713 push_access_scope (fn
);
12714 /* The "this" pointer is not valid in a default argument. */
12717 saved_class_ptr
= current_class_ptr
;
12718 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
12719 saved_class_ref
= current_class_ref
;
12720 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
12723 start_lambda_scope (parm
);
12725 push_deferring_access_checks(dk_no_deferred
);
12726 /* The default argument expression may cause implicitly defined
12727 member functions to be synthesized, which will result in garbage
12728 collection. We must treat this situation as if we were within
12729 the body of function so as to avoid collecting live data on the
12732 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
12733 complain
, NULL_TREE
,
12734 /*integral_constant_expression_p=*/false);
12736 pop_deferring_access_checks();
12738 finish_lambda_scope ();
12740 /* Restore the "this" pointer. */
12743 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
12744 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
12747 if (errorcount
+sorrycount
> errs
12748 && (complain
& tf_warning_or_error
))
12749 inform (input_location
,
12750 " when instantiating default argument for call to %qD", fn
);
12752 /* Make sure the default argument is reasonable. */
12753 arg
= check_default_argument (type
, arg
, complain
);
12755 pop_access_scope (fn
);
12757 if (arg
!= error_mark_node
&& !cp_unevaluated_operand
)
12760 defarg_inst
= tree_cache_map::create_ggc (37);
12761 defarg_inst
->put (parm
, arg
);
12767 /* Substitute into all the default arguments for FN. */
12770 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
12775 tmpl_args
= DECL_TI_ARGS (fn
);
12777 /* If this function is not yet instantiated, we certainly don't need
12778 its default arguments. */
12779 if (uses_template_parms (tmpl_args
))
12781 /* Don't do this again for clones. */
12782 if (DECL_CLONED_FUNCTION_P (fn
))
12786 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
12788 arg
= TREE_CHAIN (arg
), ++i
)
12789 if (TREE_PURPOSE (arg
))
12790 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
, i
,
12792 TREE_PURPOSE (arg
),
12796 /* Subroutine of tsubst_decl for the case when T is a FUNCTION_DECL. */
12799 tsubst_function_decl (tree t
, tree args
, tsubst_flags_t complain
,
12800 tree lambda_fntype
)
12802 tree gen_tmpl
, argvec
;
12803 hashval_t hash
= 0;
12806 /* Nobody should be tsubst'ing into non-template functions. */
12807 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
12809 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
12811 /* If T is not dependent, just return it. */
12812 if (!uses_template_parms (DECL_TI_ARGS (t
)))
12815 /* Calculate the most general template of which R is a
12817 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
12819 /* We're substituting a lambda function under tsubst_lambda_expr but not
12820 directly from it; find the matching function we're already inside.
12821 But don't do this if T is a generic lambda with a single level of
12822 template parms, as in that case we're doing a normal instantiation. */
12823 if (LAMBDA_FUNCTION_P (t
) && !lambda_fntype
12824 && (!generic_lambda_fn_p (t
)
12825 || TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
)) > 1))
12826 return enclosing_instantiation_of (t
);
12828 /* Calculate the complete set of arguments used to
12830 argvec
= tsubst_template_args (DECL_TI_ARGS
12831 (DECL_TEMPLATE_RESULT
12832 (DECL_TI_TEMPLATE (t
))),
12833 args
, complain
, in_decl
);
12834 if (argvec
== error_mark_node
)
12835 return error_mark_node
;
12837 /* Check to see if we already have this specialization. */
12838 if (!lambda_fntype
)
12840 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
12841 if (tree spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
))
12845 /* We can see more levels of arguments than parameters if
12846 there was a specialization of a member template, like
12849 template <class T> struct S { template <class U> void f(); }
12850 template <> template <class U> void S<int>::f(U);
12852 Here, we'll be substituting into the specialization,
12853 because that's where we can find the code we actually
12854 want to generate, but we'll have enough arguments for
12855 the most general template.
12857 We also deal with the peculiar case:
12859 template <class T> struct S {
12860 template <class U> friend void f();
12862 template <class U> void f() {}
12864 template void f<double>();
12866 Here, the ARGS for the instantiation of will be {int,
12867 double}. But, we only need as many ARGS as there are
12868 levels of template parameters in CODE_PATTERN. We are
12869 careful not to get fooled into reducing the ARGS in
12872 template <class T> struct S { template <class U> void f(U); }
12873 template <class T> template <> void S<T>::f(int) {}
12875 which we can spot because the pattern will be a
12876 specialization in this case. */
12877 int args_depth
= TMPL_ARGS_DEPTH (args
);
12879 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
12881 if (args_depth
> parms_depth
&& !DECL_TEMPLATE_SPECIALIZATION (t
))
12882 args
= get_innermost_template_args (args
, parms_depth
);
12886 /* This special case arises when we have something like this:
12888 template <class T> struct S {
12889 friend void f<int>(int, double);
12892 Here, the DECL_TI_TEMPLATE for the friend declaration
12893 will be an IDENTIFIER_NODE. We are being called from
12894 tsubst_friend_function, and we want only to create a
12895 new decl (R) with appropriate types so that we can call
12896 determine_specialization. */
12897 gen_tmpl
= NULL_TREE
;
12898 argvec
= NULL_TREE
;
12901 tree closure
= (lambda_fntype
? TYPE_METHOD_BASETYPE (lambda_fntype
)
12903 tree ctx
= closure
? closure
: DECL_CONTEXT (t
);
12904 bool member
= ctx
&& TYPE_P (ctx
);
12906 if (member
&& !closure
)
12907 ctx
= tsubst_aggr_type (ctx
, args
,
12908 complain
, t
, /*entering_scope=*/1);
12910 tree type
= (lambda_fntype
? lambda_fntype
12911 : tsubst (TREE_TYPE (t
), args
,
12912 complain
| tf_fndecl_type
, in_decl
));
12913 if (type
== error_mark_node
)
12914 return error_mark_node
;
12916 /* If we hit excessive deduction depth, the type is bogus even if
12917 it isn't error_mark_node, so don't build a decl. */
12918 if (excessive_deduction_depth
)
12919 return error_mark_node
;
12921 /* We do NOT check for matching decls pushed separately at this
12922 point, as they may not represent instantiations of this
12923 template, and in any case are considered separate under the
12925 tree r
= copy_decl (t
);
12926 DECL_USE_TEMPLATE (r
) = 0;
12927 TREE_TYPE (r
) = type
;
12928 /* Clear out the mangled name and RTL for the instantiation. */
12929 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
12930 SET_DECL_RTL (r
, NULL
);
12931 /* Leave DECL_INITIAL set on deleted instantiations. */
12932 if (!DECL_DELETED_FN (r
))
12933 DECL_INITIAL (r
) = NULL_TREE
;
12934 DECL_CONTEXT (r
) = ctx
;
12936 /* OpenMP UDRs have the only argument a reference to the declared
12937 type. We want to diagnose if the declared type is a reference,
12938 which is invalid, but as references to references are usually
12939 quietly merged, diagnose it here. */
12940 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
12943 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
12944 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
12945 if (TYPE_REF_P (argtype
))
12946 error_at (DECL_SOURCE_LOCATION (t
),
12947 "reference type %qT in "
12948 "%<#pragma omp declare reduction%>", argtype
);
12949 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
12950 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
12954 if (member
&& DECL_CONV_FN_P (r
))
12955 /* Type-conversion operator. Reconstruct the name, in
12956 case it's the name of one of the template's parameters. */
12957 DECL_NAME (r
) = make_conv_op_name (TREE_TYPE (type
));
12959 tree parms
= DECL_ARGUMENTS (t
);
12961 parms
= DECL_CHAIN (parms
);
12962 parms
= tsubst (parms
, args
, complain
, t
);
12963 for (tree parm
= parms
; parm
; parm
= DECL_CHAIN (parm
))
12964 DECL_CONTEXT (parm
) = r
;
12967 tree tparm
= build_this_parm (r
, closure
, type_memfn_quals (type
));
12968 DECL_CHAIN (tparm
) = parms
;
12971 DECL_ARGUMENTS (r
) = parms
;
12972 DECL_RESULT (r
) = NULL_TREE
;
12974 TREE_STATIC (r
) = 0;
12975 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
12976 DECL_EXTERNAL (r
) = 1;
12977 /* If this is an instantiation of a function with internal
12978 linkage, we already know what object file linkage will be
12979 assigned to the instantiation. */
12980 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
12981 DECL_DEFER_OUTPUT (r
) = 0;
12982 DECL_CHAIN (r
) = NULL_TREE
;
12983 DECL_PENDING_INLINE_INFO (r
) = 0;
12984 DECL_PENDING_INLINE_P (r
) = 0;
12985 DECL_SAVED_TREE (r
) = NULL_TREE
;
12986 DECL_STRUCT_FUNCTION (r
) = NULL
;
12988 /* We'll re-clone as appropriate in instantiate_template. */
12989 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
12991 /* If we aren't complaining now, return on error before we register
12992 the specialization so that we'll complain eventually. */
12993 if ((complain
& tf_error
) == 0
12994 && IDENTIFIER_ANY_OP_P (DECL_NAME (r
))
12995 && !grok_op_properties (r
, /*complain=*/false))
12996 return error_mark_node
;
12998 /* When instantiating a constrained member, substitute
12999 into the constraints to create a new constraint. */
13000 if (tree ci
= get_constraints (t
))
13003 ci
= tsubst_constraint_info (ci
, argvec
, complain
, NULL_TREE
);
13004 set_constraints (r
, ci
);
13007 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
13008 this in the special friend case mentioned above where
13009 GEN_TMPL is NULL. */
13010 if (gen_tmpl
&& !closure
)
13012 DECL_TEMPLATE_INFO (r
)
13013 = build_template_info (gen_tmpl
, argvec
);
13014 SET_DECL_IMPLICIT_INSTANTIATION (r
);
13017 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
13019 /* We instantiated this while substituting into
13020 the type earlier (template/friend54.C). */
13023 /* We're not supposed to instantiate default arguments
13024 until they are called, for a template. But, for a
13027 template <class T> void f ()
13028 { extern void g(int i = T()); }
13030 we should do the substitution when the template is
13031 instantiated. We handle the member function case in
13032 instantiate_class_template since the default arguments
13033 might refer to other members of the class. */
13035 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
13036 && !uses_template_parms (argvec
))
13037 tsubst_default_arguments (r
, complain
);
13040 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
13042 /* Copy the list of befriending classes. */
13043 for (tree
*friends
= &DECL_BEFRIENDING_CLASSES (r
);
13045 friends
= &TREE_CHAIN (*friends
))
13047 *friends
= copy_node (*friends
);
13048 TREE_VALUE (*friends
)
13049 = tsubst (TREE_VALUE (*friends
), args
, complain
, in_decl
);
13052 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
13054 maybe_retrofit_in_chrg (r
);
13055 if (DECL_CONSTRUCTOR_P (r
) && !grok_ctor_properties (ctx
, r
))
13056 return error_mark_node
;
13057 /* If this is an instantiation of a member template, clone it.
13058 If it isn't, that'll be handled by
13059 clone_constructors_and_destructors. */
13060 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
13061 clone_function_decl (r
, /*update_methods=*/false);
13063 else if ((complain
& tf_error
) != 0
13064 && IDENTIFIER_ANY_OP_P (DECL_NAME (r
))
13065 && !grok_op_properties (r
, /*complain=*/true))
13066 return error_mark_node
;
13068 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
13069 SET_DECL_FRIEND_CONTEXT (r
,
13070 tsubst (DECL_FRIEND_CONTEXT (t
),
13071 args
, complain
, in_decl
));
13073 /* Possibly limit visibility based on template args. */
13074 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
13075 if (DECL_VISIBILITY_SPECIFIED (t
))
13077 DECL_VISIBILITY_SPECIFIED (r
) = 0;
13078 DECL_ATTRIBUTES (r
)
13079 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
13081 determine_visibility (r
);
13082 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
13083 && !processing_template_decl
)
13084 defaulted_late_check (r
);
13086 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
13087 args
, complain
, in_decl
);
13091 /* Subroutine of tsubst_decl for the case when T is a TEMPLATE_DECL. */
13094 tsubst_template_decl (tree t
, tree args
, tsubst_flags_t complain
,
13095 tree lambda_fntype
)
13097 /* We can get here when processing a member function template,
13098 member class template, or template template parameter. */
13099 tree decl
= DECL_TEMPLATE_RESULT (t
);
13105 hashval_t hash
= 0;
13107 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
13109 /* Template template parameter is treated here. */
13110 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13111 if (new_type
== error_mark_node
)
13112 r
= error_mark_node
;
13113 /* If we get a real template back, return it. This can happen in
13114 the context of most_specialized_partial_spec. */
13115 else if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
13118 /* The new TEMPLATE_DECL was built in
13119 reduce_template_parm_level. */
13120 r
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (new_type
);
13124 if (!lambda_fntype
)
13126 /* We might already have an instance of this template.
13127 The ARGS are for the surrounding class type, so the
13128 full args contain the tsubst'd args for the context,
13129 plus the innermost args from the template decl. */
13130 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
13131 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
13132 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
13133 /* Because this is a template, the arguments will still be
13134 dependent, even after substitution. If
13135 PROCESSING_TEMPLATE_DECL is not set, the dependency
13136 predicates will short-circuit. */
13137 ++processing_template_decl
;
13138 full_args
= tsubst_template_args (tmpl_args
, args
,
13139 complain
, in_decl
);
13140 --processing_template_decl
;
13141 if (full_args
== error_mark_node
)
13142 return error_mark_node
;
13144 /* If this is a default template template argument,
13145 tsubst might not have changed anything. */
13146 if (full_args
== tmpl_args
)
13149 hash
= hash_tmpl_and_args (t
, full_args
);
13150 spec
= retrieve_specialization (t
, full_args
, hash
);
13151 if (spec
!= NULL_TREE
)
13155 /* Make a new template decl. It will be similar to the
13156 original, but will record the current template arguments.
13157 We also create a new function declaration, which is just
13158 like the old one, but points to this new template, rather
13159 than the old one. */
13161 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
13162 DECL_CHAIN (r
) = NULL_TREE
;
13164 // Build new template info linking to the original template decl.
13165 if (!lambda_fntype
)
13167 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
13168 SET_DECL_IMPLICIT_INSTANTIATION (r
);
13171 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
13173 /* The template parameters for this new template are all the
13174 template parameters for the old template, except the
13175 outermost level of parameters. */
13176 DECL_TEMPLATE_PARMS (r
)
13177 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
13180 if (TREE_CODE (decl
) == TYPE_DECL
13181 && !TYPE_DECL_ALIAS_P (decl
))
13184 ++processing_template_decl
;
13185 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13186 --processing_template_decl
;
13187 if (new_type
== error_mark_node
)
13188 return error_mark_node
;
13190 TREE_TYPE (r
) = new_type
;
13191 /* For a partial specialization, we need to keep pointing to
13192 the primary template. */
13193 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
13194 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
13195 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
13196 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
13197 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
13202 ++processing_template_decl
;
13203 if (TREE_CODE (decl
) == FUNCTION_DECL
)
13204 new_decl
= tsubst_function_decl (decl
, args
, complain
, lambda_fntype
);
13206 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
13207 --processing_template_decl
;
13208 if (new_decl
== error_mark_node
)
13209 return error_mark_node
;
13211 DECL_TEMPLATE_RESULT (r
) = new_decl
;
13212 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
13213 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
13216 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (r
));
13217 DECL_TEMPLATE_INFO (new_decl
) = build_template_info (r
, args
);
13221 DECL_TI_TEMPLATE (new_decl
) = r
;
13222 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
13226 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
13227 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
13229 if (PRIMARY_TEMPLATE_P (t
))
13230 DECL_PRIMARY_TEMPLATE (r
) = r
;
13232 if (TREE_CODE (decl
) != TYPE_DECL
&& !VAR_P (decl
)
13234 /* Record this non-type partial instantiation. */
13235 register_specialization (r
, t
,
13236 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
13242 /* True if FN is the op() for a lambda in an uninstantiated template. */
13245 lambda_fn_in_template_p (tree fn
)
13247 if (!fn
|| !LAMBDA_FUNCTION_P (fn
))
13249 tree closure
= DECL_CONTEXT (fn
);
13250 return CLASSTYPE_TEMPLATE_INFO (closure
) != NULL_TREE
;
13253 /* We're instantiating a variable from template function TCTX. Return the
13254 corresponding current enclosing scope. This gets complicated because lambda
13255 functions in templates are regenerated rather than instantiated, but generic
13256 lambda functions are subsequently instantiated. */
13259 enclosing_instantiation_of (tree otctx
)
13262 tree fn
= current_function_decl
;
13263 int lambda_count
= 0;
13265 for (; tctx
&& lambda_fn_in_template_p (tctx
);
13266 tctx
= decl_function_context (tctx
))
13268 for (; fn
; fn
= decl_function_context (fn
))
13271 int flambda_count
= 0;
13272 for (; flambda_count
< lambda_count
&& fn
&& LAMBDA_FUNCTION_P (fn
);
13273 fn
= decl_function_context (fn
))
13275 if ((fn
&& DECL_TEMPLATE_INFO (fn
))
13276 ? most_general_template (fn
) != most_general_template (tctx
)
13279 gcc_assert (DECL_NAME (ofn
) == DECL_NAME (otctx
)
13280 || DECL_CONV_FN_P (ofn
));
13283 gcc_unreachable ();
13286 /* Substitute the ARGS into the T, which is a _DECL. Return the
13287 result of the substitution. Issue error and warning messages under
13288 control of COMPLAIN. */
13291 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
13293 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
13294 location_t saved_loc
;
13295 tree r
= NULL_TREE
;
13297 hashval_t hash
= 0;
13299 /* Set the filename and linenumber to improve error-reporting. */
13300 saved_loc
= input_location
;
13301 input_location
= DECL_SOURCE_LOCATION (t
);
13303 switch (TREE_CODE (t
))
13305 case TEMPLATE_DECL
:
13306 r
= tsubst_template_decl (t
, args
, complain
, /*lambda*/NULL_TREE
);
13309 case FUNCTION_DECL
:
13310 r
= tsubst_function_decl (t
, args
, complain
, /*lambda*/NULL_TREE
);
13315 tree type
= NULL_TREE
;
13317 tree expanded_types
= NULL_TREE
;
13318 tree prev_r
= NULL_TREE
;
13319 tree first_r
= NULL_TREE
;
13321 if (DECL_PACK_P (t
))
13323 /* If there is a local specialization that isn't a
13324 parameter pack, it means that we're doing a "simple"
13325 substitution from inside tsubst_pack_expansion. Just
13326 return the local specialization (which will be a single
13328 tree spec
= retrieve_local_specialization (t
);
13330 && TREE_CODE (spec
) == PARM_DECL
13331 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
13334 /* Expand the TYPE_PACK_EXPANSION that provides the types for
13335 the parameters in this function parameter pack. */
13336 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
13337 complain
, in_decl
);
13338 if (TREE_CODE (expanded_types
) == TREE_VEC
)
13340 len
= TREE_VEC_LENGTH (expanded_types
);
13342 /* Zero-length parameter packs are boring. Just substitute
13345 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
13350 /* All we did was update the type. Make a note of that. */
13351 type
= expanded_types
;
13352 expanded_types
= NULL_TREE
;
13356 /* Loop through all of the parameters we'll build. When T is
13357 a function parameter pack, LEN is the number of expanded
13358 types in EXPANDED_TYPES; otherwise, LEN is 1. */
13360 for (i
= 0; i
< len
; ++i
)
13364 if (DECL_TEMPLATE_PARM_P (t
))
13365 SET_DECL_TEMPLATE_PARM_P (r
);
13367 if (expanded_types
)
13368 /* We're on the Ith parameter of the function parameter
13371 /* Get the Ith type. */
13372 type
= TREE_VEC_ELT (expanded_types
, i
);
13374 /* Rename the parameter to include the index. */
13376 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
13379 /* We're dealing with a normal parameter. */
13380 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13382 type
= type_decays_to (type
);
13383 TREE_TYPE (r
) = type
;
13384 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
13386 if (DECL_INITIAL (r
))
13388 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
13389 DECL_INITIAL (r
) = TREE_TYPE (r
);
13391 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
13392 complain
, in_decl
);
13395 DECL_CONTEXT (r
) = NULL_TREE
;
13397 if (!DECL_TEMPLATE_PARM_P (r
))
13398 DECL_ARG_TYPE (r
) = type_passed_as (type
);
13400 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
13401 args
, complain
, in_decl
);
13403 /* Keep track of the first new parameter we
13404 generate. That's what will be returned to the
13409 /* Build a proper chain of parameters when substituting
13410 into a function parameter pack. */
13412 DECL_CHAIN (prev_r
) = r
;
13415 /* If cp_unevaluated_operand is set, we're just looking for a
13416 single dummy parameter, so don't keep going. */
13417 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
13418 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
13419 complain
, DECL_CHAIN (t
));
13421 /* FIRST_R contains the start of the chain we've built. */
13428 tree type
= NULL_TREE
;
13429 tree vec
= NULL_TREE
;
13430 tree expanded_types
= NULL_TREE
;
13433 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
13435 /* This field is a lambda capture pack. Return a TREE_VEC of
13436 the expanded fields to instantiate_class_template_1. */
13437 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
13438 complain
, in_decl
);
13439 if (TREE_CODE (expanded_types
) == TREE_VEC
)
13441 len
= TREE_VEC_LENGTH (expanded_types
);
13442 vec
= make_tree_vec (len
);
13446 /* All we did was update the type. Make a note of that. */
13447 type
= expanded_types
;
13448 expanded_types
= NULL_TREE
;
13452 for (int i
= 0; i
< len
; ++i
)
13455 if (expanded_types
)
13457 type
= TREE_VEC_ELT (expanded_types
, i
);
13459 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
13462 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13464 if (type
== error_mark_node
)
13465 RETURN (error_mark_node
);
13466 TREE_TYPE (r
) = type
;
13467 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
13469 if (DECL_C_BIT_FIELD (r
))
13470 /* For bit-fields, DECL_BIT_FIELD_REPRESENTATIVE gives the
13472 DECL_BIT_FIELD_REPRESENTATIVE (r
)
13473 = tsubst_expr (DECL_BIT_FIELD_REPRESENTATIVE (t
), args
,
13475 /*integral_constant_expression_p=*/true);
13476 if (DECL_INITIAL (t
))
13478 /* Set up DECL_TEMPLATE_INFO so that we can get at the
13479 NSDMI in perform_member_init. Still set DECL_INITIAL
13480 so that we know there is one. */
13481 DECL_INITIAL (r
) = void_node
;
13482 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
13483 retrofit_lang_decl (r
);
13484 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
13486 /* We don't have to set DECL_CONTEXT here; it is set by
13487 finish_member_declaration. */
13488 DECL_CHAIN (r
) = NULL_TREE
;
13490 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
13491 args
, complain
, in_decl
);
13494 TREE_VEC_ELT (vec
, i
) = r
;
13503 /* We reach here only for member using decls. We also need to check
13504 uses_template_parms because DECL_DEPENDENT_P is not set for a
13505 using-declaration that designates a member of the current
13506 instantiation (c++/53549). */
13507 if (DECL_DEPENDENT_P (t
)
13508 || uses_template_parms (USING_DECL_SCOPE (t
)))
13510 tree scope
= USING_DECL_SCOPE (t
);
13511 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
13512 if (PACK_EXPANSION_P (scope
))
13514 tree vec
= tsubst_pack_expansion (scope
, args
, complain
, in_decl
);
13515 int len
= TREE_VEC_LENGTH (vec
);
13516 r
= make_tree_vec (len
);
13517 for (int i
= 0; i
< len
; ++i
)
13519 tree escope
= TREE_VEC_ELT (vec
, i
);
13520 tree elt
= do_class_using_decl (escope
, name
);
13523 r
= error_mark_node
;
13528 TREE_PROTECTED (elt
) = TREE_PROTECTED (t
);
13529 TREE_PRIVATE (elt
) = TREE_PRIVATE (t
);
13531 TREE_VEC_ELT (r
, i
) = elt
;
13536 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
13537 complain
, in_decl
);
13538 r
= do_class_using_decl (inst_scope
, name
);
13540 r
= error_mark_node
;
13543 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
13544 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
13551 DECL_CHAIN (r
) = NULL_TREE
;
13558 tree argvec
= NULL_TREE
;
13559 tree gen_tmpl
= NULL_TREE
;
13561 tree tmpl
= NULL_TREE
;
13563 tree type
= NULL_TREE
;
13566 if (TREE_TYPE (t
) == error_mark_node
)
13567 RETURN (error_mark_node
);
13569 if (TREE_CODE (t
) == TYPE_DECL
13570 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
13572 /* If this is the canonical decl, we don't have to
13573 mess with instantiations, and often we can't (for
13574 typename, template type parms and such). Note that
13575 TYPE_NAME is not correct for the above test if
13576 we've copied the type for a typedef. */
13577 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13578 if (type
== error_mark_node
)
13579 RETURN (error_mark_node
);
13580 r
= TYPE_NAME (type
);
13584 /* Check to see if we already have the specialization we
13587 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
13589 /* T is a static data member or namespace-scope entity.
13590 We have to substitute into namespace-scope variables
13591 (not just variable templates) because of cases like:
13593 template <class T> void f() { extern T t; }
13595 where the entity referenced is not known until
13596 instantiation time. */
13598 ctx
= DECL_CONTEXT (t
);
13599 if (DECL_CLASS_SCOPE_P (t
))
13601 ctx
= tsubst_aggr_type (ctx
, args
,
13603 in_decl
, /*entering_scope=*/1);
13604 /* If CTX is unchanged, then T is in fact the
13605 specialization we want. That situation occurs when
13606 referencing a static data member within in its own
13607 class. We can use pointer equality, rather than
13608 same_type_p, because DECL_CONTEXT is always
13610 if (ctx
== DECL_CONTEXT (t
)
13611 /* ... unless T is a member template; in which
13612 case our caller can be willing to create a
13613 specialization of that template represented
13615 && !(DECL_TI_TEMPLATE (t
)
13616 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
13622 tmpl
= DECL_TI_TEMPLATE (t
);
13623 gen_tmpl
= most_general_template (tmpl
);
13624 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
13625 if (argvec
!= error_mark_node
)
13626 argvec
= (coerce_innermost_template_parms
13627 (DECL_TEMPLATE_PARMS (gen_tmpl
),
13628 argvec
, t
, complain
,
13629 /*all*/true, /*defarg*/true));
13630 if (argvec
== error_mark_node
)
13631 RETURN (error_mark_node
);
13632 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
13633 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
13638 /* A local variable. */
13640 /* Subsequent calls to pushdecl will fill this in. */
13642 /* Unless this is a reference to a static variable from an
13643 enclosing function, in which case we need to fill it in now. */
13644 if (TREE_STATIC (t
))
13646 tree fn
= enclosing_instantiation_of (DECL_CONTEXT (t
));
13647 if (fn
!= current_function_decl
)
13650 spec
= retrieve_local_specialization (t
);
13652 /* If we already have the specialization we need, there is
13653 nothing more to do. */
13660 /* Create a new node for the specialization we need. */
13662 if (type
== NULL_TREE
)
13664 if (is_typedef_decl (t
))
13665 type
= DECL_ORIGINAL_TYPE (t
);
13667 type
= TREE_TYPE (t
);
13669 && VAR_HAD_UNKNOWN_BOUND (t
)
13670 && type
!= error_mark_node
)
13671 type
= strip_array_domain (type
);
13672 tree sub_args
= args
;
13673 if (tree auto_node
= type_uses_auto (type
))
13675 /* Mask off any template args past the variable's context so we
13676 don't replace the auto with an unrelated argument. */
13677 int nouter
= TEMPLATE_TYPE_LEVEL (auto_node
) - 1;
13678 int extra
= TMPL_ARGS_DEPTH (args
) - nouter
;
13680 /* This should never happen with the new lambda instantiation
13681 model, but keep the handling just in case. */
13682 gcc_assert (!CHECKING_P
),
13683 sub_args
= strip_innermost_template_args (args
, extra
);
13685 type
= tsubst (type
, sub_args
, complain
, in_decl
);
13689 DECL_INITIALIZED_P (r
) = 0;
13690 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
13691 if (type
== error_mark_node
)
13692 RETURN (error_mark_node
);
13693 if (TREE_CODE (type
) == FUNCTION_TYPE
)
13695 /* It may seem that this case cannot occur, since:
13700 declares a function, not a variable. However:
13703 template <typename T> void g() { T t; }
13704 template void g<f>();
13706 is an attempt to declare a variable with function
13708 error ("variable %qD has function type",
13709 /* R is not yet sufficiently initialized, so we
13710 just use its name. */
13712 RETURN (error_mark_node
);
13714 type
= complete_type (type
);
13715 /* Wait until cp_finish_decl to set this again, to handle
13716 circular dependency (template/instantiate6.C). */
13717 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
13718 type
= check_var_type (DECL_NAME (r
), type
);
13720 if (DECL_HAS_VALUE_EXPR_P (t
))
13722 tree ve
= DECL_VALUE_EXPR (t
);
13723 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
13724 /*constant_expression_p=*/false);
13725 if (REFERENCE_REF_P (ve
))
13727 gcc_assert (TYPE_REF_P (type
));
13728 ve
= TREE_OPERAND (ve
, 0);
13730 SET_DECL_VALUE_EXPR (r
, ve
);
13732 if (CP_DECL_THREAD_LOCAL_P (r
)
13733 && !processing_template_decl
)
13734 set_decl_tls_model (r
, decl_default_tls_model (r
));
13736 else if (DECL_SELF_REFERENCE_P (t
))
13737 SET_DECL_SELF_REFERENCE_P (r
);
13738 TREE_TYPE (r
) = type
;
13739 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
13740 DECL_CONTEXT (r
) = ctx
;
13741 /* Clear out the mangled name and RTL for the instantiation. */
13742 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
13743 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
13744 SET_DECL_RTL (r
, NULL
);
13745 /* The initializer must not be expanded until it is required;
13746 see [temp.inst]. */
13747 DECL_INITIAL (r
) = NULL_TREE
;
13748 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
13751 if (DECL_LANG_SPECIFIC (r
))
13752 SET_DECL_DEPENDENT_INIT_P (r
, false);
13754 SET_DECL_MODE (r
, VOIDmode
);
13756 /* Possibly limit visibility based on template args. */
13757 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
13758 if (DECL_VISIBILITY_SPECIFIED (t
))
13760 DECL_VISIBILITY_SPECIFIED (r
) = 0;
13761 DECL_ATTRIBUTES (r
)
13762 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
13764 determine_visibility (r
);
13769 /* A static data member declaration is always marked
13770 external when it is declared in-class, even if an
13771 initializer is present. We mimic the non-template
13772 processing here. */
13773 DECL_EXTERNAL (r
) = 1;
13774 if (DECL_NAMESPACE_SCOPE_P (t
))
13775 DECL_NOT_REALLY_EXTERN (r
) = 1;
13777 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
13778 SET_DECL_IMPLICIT_INSTANTIATION (r
);
13779 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
13783 if (DECL_LANG_SPECIFIC (r
))
13784 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
13785 if (!cp_unevaluated_operand
)
13786 register_local_specialization (r
, t
);
13789 DECL_CHAIN (r
) = NULL_TREE
;
13791 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
13793 args
, complain
, in_decl
);
13795 /* Preserve a typedef that names a type. */
13796 if (is_typedef_decl (r
) && type
!= error_mark_node
)
13798 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
13799 set_underlying_type (r
);
13800 if (TYPE_DECL_ALIAS_P (r
))
13801 /* An alias template specialization can be dependent
13802 even if its underlying type is not. */
13803 TYPE_DEPENDENT_P_VALID (TREE_TYPE (r
)) = false;
13806 layout_decl (r
, 0);
13811 gcc_unreachable ();
13816 /* Restore the file and line information. */
13817 input_location
= saved_loc
;
13822 /* Substitute into the ARG_TYPES of a function type.
13823 If END is a TREE_CHAIN, leave it and any following types
13827 tsubst_arg_types (tree arg_types
,
13830 tsubst_flags_t complain
,
13833 tree remaining_arg_types
;
13834 tree type
= NULL_TREE
;
13836 tree expanded_args
= NULL_TREE
;
13839 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
13842 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
13843 args
, end
, complain
, in_decl
);
13844 if (remaining_arg_types
== error_mark_node
)
13845 return error_mark_node
;
13847 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
13849 /* For a pack expansion, perform substitution on the
13850 entire expression. Later on, we'll handle the arguments
13852 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
13853 args
, complain
, in_decl
);
13855 if (TREE_CODE (expanded_args
) == TREE_VEC
)
13856 /* So that we'll spin through the parameters, one by one. */
13857 i
= TREE_VEC_LENGTH (expanded_args
);
13860 /* We only partially substituted into the parameter
13861 pack. Our type is TYPE_PACK_EXPANSION. */
13862 type
= expanded_args
;
13863 expanded_args
= NULL_TREE
;
13871 type
= TREE_VEC_ELT (expanded_args
, i
);
13873 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
13875 if (type
== error_mark_node
)
13876 return error_mark_node
;
13877 if (VOID_TYPE_P (type
))
13879 if (complain
& tf_error
)
13881 error ("invalid parameter type %qT", type
);
13883 error ("in declaration %q+D", in_decl
);
13885 return error_mark_node
;
13888 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
13889 return error_mark_node
;
13891 /* Do array-to-pointer, function-to-pointer conversion, and ignore
13892 top-level qualifiers as required. */
13893 type
= cv_unqualified (type_decays_to (type
));
13895 /* We do not substitute into default arguments here. The standard
13896 mandates that they be instantiated only when needed, which is
13897 done in build_over_call. */
13898 default_arg
= TREE_PURPOSE (arg_types
);
13900 /* Except that we do substitute default arguments under tsubst_lambda_expr,
13901 since the new op() won't have any associated template arguments for us
13902 to refer to later. */
13903 if (lambda_fn_in_template_p (in_decl
))
13904 default_arg
= tsubst_copy_and_build (default_arg
, args
, complain
, in_decl
,
13905 false/*fn*/, false/*constexpr*/);
13907 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
13909 /* We've instantiated a template before its default arguments
13910 have been parsed. This can happen for a nested template
13911 class, and is not an error unless we require the default
13912 argument in a call of this function. */
13913 remaining_arg_types
=
13914 tree_cons (default_arg
, type
, remaining_arg_types
);
13915 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
13918 remaining_arg_types
=
13919 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
13922 return remaining_arg_types
;
13925 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
13926 *not* handle the exception-specification for FNTYPE, because the
13927 initial substitution of explicitly provided template parameters
13928 during argument deduction forbids substitution into the
13929 exception-specification:
13933 All references in the function type of the function template to the
13934 corresponding template parameters are replaced by the specified tem-
13935 plate argument values. If a substitution in a template parameter or
13936 in the function type of the function template results in an invalid
13937 type, type deduction fails. [Note: The equivalent substitution in
13938 exception specifications is done only when the function is instanti-
13939 ated, at which point a program is ill-formed if the substitution
13940 results in an invalid type.] */
13943 tsubst_function_type (tree t
,
13945 tsubst_flags_t complain
,
13949 tree arg_types
= NULL_TREE
;
13952 /* The TYPE_CONTEXT is not used for function/method types. */
13953 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
13955 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
13957 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
13959 if (late_return_type_p
)
13961 /* Substitute the argument types. */
13962 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
13963 complain
, in_decl
);
13964 if (arg_types
== error_mark_node
)
13965 return error_mark_node
;
13967 tree save_ccp
= current_class_ptr
;
13968 tree save_ccr
= current_class_ref
;
13969 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
13970 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
13971 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
13974 /* DR 1207: 'this' is in scope in the trailing return type. */
13975 inject_this_parameter (this_type
, cp_type_quals (this_type
));
13978 /* Substitute the return type. */
13979 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13983 current_class_ptr
= save_ccp
;
13984 current_class_ref
= save_ccr
;
13988 /* Substitute the return type. */
13989 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13991 if (return_type
== error_mark_node
)
13992 return error_mark_node
;
13993 /* DR 486 clarifies that creation of a function type with an
13994 invalid return type is a deduction failure. */
13995 if (TREE_CODE (return_type
) == ARRAY_TYPE
13996 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
13998 if (complain
& tf_error
)
14000 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
14001 error ("function returning an array");
14003 error ("function returning a function");
14005 return error_mark_node
;
14008 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
14009 return error_mark_node
;
14011 if (!late_return_type_p
)
14013 /* Substitute the argument types. */
14014 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
14015 complain
, in_decl
);
14016 if (arg_types
== error_mark_node
)
14017 return error_mark_node
;
14020 /* Construct a new type node and return it. */
14021 if (TREE_CODE (t
) == FUNCTION_TYPE
)
14023 fntype
= build_function_type (return_type
, arg_types
);
14024 fntype
= apply_memfn_quals (fntype
, type_memfn_quals (t
));
14028 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
14029 /* Don't pick up extra function qualifiers from the basetype. */
14030 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
14031 if (! MAYBE_CLASS_TYPE_P (r
))
14035 Type deduction may fail for any of the following
14038 -- Attempting to create "pointer to member of T" when T
14039 is not a class type. */
14040 if (complain
& tf_error
)
14041 error ("creating pointer to member function of non-class type %qT",
14043 return error_mark_node
;
14046 fntype
= build_method_type_directly (r
, return_type
,
14047 TREE_CHAIN (arg_types
));
14049 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
14051 /* See comment above. */
14052 tree raises
= NULL_TREE
;
14053 cp_ref_qualifier rqual
= type_memfn_rqual (t
);
14054 fntype
= build_cp_fntype_variant (fntype
, rqual
, raises
, late_return_type_p
);
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 ((TYPE_REF_P (type
)
14624 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
14625 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
14627 static location_t last_loc
;
14629 /* We keep track of the last time we issued this error
14630 message to avoid spewing a ton of messages during a
14631 single bad template instantiation. */
14632 if (complain
& tf_error
14633 && last_loc
!= input_location
)
14635 if (VOID_TYPE_P (type
))
14636 error ("forming reference to void");
14637 else if (code
== POINTER_TYPE
)
14638 error ("forming pointer to reference type %qT", type
);
14640 error ("forming reference to reference type %qT", type
);
14641 last_loc
= input_location
;
14644 return error_mark_node
;
14646 else if (TREE_CODE (type
) == FUNCTION_TYPE
14647 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
14648 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
14650 if (complain
& tf_error
)
14652 if (code
== POINTER_TYPE
)
14653 error ("forming pointer to qualified function type %qT",
14656 error ("forming reference to qualified function type %qT",
14659 return error_mark_node
;
14661 else if (code
== POINTER_TYPE
)
14663 r
= build_pointer_type (type
);
14664 if (TREE_CODE (type
) == METHOD_TYPE
)
14665 r
= build_ptrmemfunc_type (r
);
14667 else if (TYPE_REF_P (type
))
14668 /* In C++0x, during template argument substitution, when there is an
14669 attempt to create a reference to a reference type, reference
14670 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
14672 "If a template-argument for a template-parameter T names a type
14673 that is a reference to a type A, an attempt to create the type
14674 'lvalue reference to cv T' creates the type 'lvalue reference to
14675 A,' while an attempt to create the type type rvalue reference to
14676 cv T' creates the type T"
14678 r
= cp_build_reference_type
14680 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
14682 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
14683 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
14685 if (r
!= error_mark_node
)
14686 /* Will this ever be needed for TYPE_..._TO values? */
14693 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
14694 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
14698 Type deduction may fail for any of the following
14701 -- Attempting to create "pointer to member of T" when T
14702 is not a class type. */
14703 if (complain
& tf_error
)
14704 error ("creating pointer to member of non-class type %qT", r
);
14705 return error_mark_node
;
14707 if (TYPE_REF_P (type
))
14709 if (complain
& tf_error
)
14710 error ("creating pointer to member reference type %qT", type
);
14711 return error_mark_node
;
14713 if (VOID_TYPE_P (type
))
14715 if (complain
& tf_error
)
14716 error ("creating pointer to member of type void");
14717 return error_mark_node
;
14719 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
14720 if (TREE_CODE (type
) == FUNCTION_TYPE
)
14722 /* The type of the implicit object parameter gets its
14723 cv-qualifiers from the FUNCTION_TYPE. */
14726 = build_memfn_type (type
, r
, type_memfn_quals (type
),
14727 type_memfn_rqual (type
));
14728 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
14729 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
14733 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
14737 case FUNCTION_TYPE
:
14742 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
14743 if (fntype
== error_mark_node
)
14744 return error_mark_node
;
14746 /* Substitute the exception specification. */
14747 specs
= tsubst_exception_specification (t
, args
, complain
, in_decl
,
14748 /*defer_ok*/fndecl_type
);
14749 if (specs
== error_mark_node
)
14750 return error_mark_node
;
14752 fntype
= build_exception_variant (fntype
, specs
);
14757 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
14758 if (domain
== error_mark_node
)
14759 return error_mark_node
;
14761 /* As an optimization, we avoid regenerating the array type if
14762 it will obviously be the same as T. */
14763 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
14766 /* These checks should match the ones in create_array_type_for_decl.
14770 The deduction may fail for any of the following reasons:
14772 -- Attempting to create an array with an element type that
14773 is void, a function type, or a reference type, or [DR337]
14774 an abstract class type. */
14775 if (VOID_TYPE_P (type
)
14776 || TREE_CODE (type
) == FUNCTION_TYPE
14777 || (TREE_CODE (type
) == ARRAY_TYPE
14778 && TYPE_DOMAIN (type
) == NULL_TREE
)
14779 || TYPE_REF_P (type
))
14781 if (complain
& tf_error
)
14782 error ("creating array of %qT", type
);
14783 return error_mark_node
;
14786 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
14787 return error_mark_node
;
14789 r
= build_cplus_array_type (type
, domain
);
14791 if (!valid_array_size_p (input_location
, r
, in_decl
,
14792 (complain
& tf_error
)))
14793 return error_mark_node
;
14795 if (TYPE_USER_ALIGN (t
))
14797 SET_TYPE_ALIGN (r
, TYPE_ALIGN (t
));
14798 TYPE_USER_ALIGN (r
) = 1;
14804 case TYPENAME_TYPE
:
14806 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
14807 in_decl
, /*entering_scope=*/1);
14808 if (ctx
== error_mark_node
)
14809 return error_mark_node
;
14811 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
14812 complain
, in_decl
);
14813 if (f
== error_mark_node
)
14814 return error_mark_node
;
14816 if (!MAYBE_CLASS_TYPE_P (ctx
))
14818 if (complain
& tf_error
)
14819 error ("%qT is not a class, struct, or union type", ctx
);
14820 return error_mark_node
;
14822 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
14824 /* Normally, make_typename_type does not require that the CTX
14825 have complete type in order to allow things like:
14827 template <class T> struct S { typename S<T>::X Y; };
14829 But, such constructs have already been resolved by this
14830 point, so here CTX really should have complete type, unless
14831 it's a partial instantiation. */
14832 ctx
= complete_type (ctx
);
14833 if (!COMPLETE_TYPE_P (ctx
))
14835 if (complain
& tf_error
)
14836 cxx_incomplete_type_error (NULL_TREE
, ctx
);
14837 return error_mark_node
;
14841 f
= make_typename_type (ctx
, f
, typename_type
,
14842 complain
| tf_keep_type_decl
);
14843 if (f
== error_mark_node
)
14845 if (TREE_CODE (f
) == TYPE_DECL
)
14847 complain
|= tf_ignore_bad_quals
;
14851 if (TREE_CODE (f
) != TYPENAME_TYPE
)
14853 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
14855 if (complain
& tf_error
)
14856 error ("%qT resolves to %qT, which is not an enumeration type",
14859 return error_mark_node
;
14861 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
14863 if (complain
& tf_error
)
14864 error ("%qT resolves to %qT, which is is not a class type",
14867 return error_mark_node
;
14871 return cp_build_qualified_type_real
14872 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
14875 case UNBOUND_CLASS_TEMPLATE
:
14877 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
14878 in_decl
, /*entering_scope=*/1);
14879 tree name
= TYPE_IDENTIFIER (t
);
14880 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
14882 if (ctx
== error_mark_node
|| name
== error_mark_node
)
14883 return error_mark_node
;
14886 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
14887 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
14894 ++cp_unevaluated_operand
;
14895 ++c_inhibit_evaluation_warnings
;
14897 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
14899 /*integral_constant_expression_p=*/false);
14901 --cp_unevaluated_operand
;
14902 --c_inhibit_evaluation_warnings
;
14904 type
= finish_typeof (type
);
14905 return cp_build_qualified_type_real (type
,
14907 | cp_type_quals (type
),
14911 case DECLTYPE_TYPE
:
14915 ++cp_unevaluated_operand
;
14916 ++c_inhibit_evaluation_warnings
;
14918 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
14919 complain
|tf_decltype
, in_decl
,
14920 /*function_p*/false,
14921 /*integral_constant_expression*/false);
14923 if (DECLTYPE_FOR_INIT_CAPTURE (t
))
14925 if (type
== NULL_TREE
)
14927 if (complain
& tf_error
)
14928 error ("empty initializer in lambda init-capture");
14929 type
= error_mark_node
;
14931 else if (TREE_CODE (type
) == TREE_LIST
)
14932 type
= build_x_compound_expr_from_list (type
, ELK_INIT
, complain
);
14935 --cp_unevaluated_operand
;
14936 --c_inhibit_evaluation_warnings
;
14938 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
14939 type
= lambda_capture_field_type (type
,
14940 DECLTYPE_FOR_INIT_CAPTURE (t
),
14941 DECLTYPE_FOR_REF_CAPTURE (t
));
14942 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
14943 type
= lambda_proxy_type (type
);
14946 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
14947 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
14949 /* In a template ~id could be either a complement expression
14950 or an unqualified-id naming a destructor; if instantiating
14951 it produces an expression, it's not an id-expression or
14954 type
= finish_decltype_type (type
, id
, complain
);
14956 return cp_build_qualified_type_real (type
,
14958 | cp_type_quals (type
),
14959 complain
| tf_ignore_bad_quals
);
14962 case UNDERLYING_TYPE
:
14964 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
14965 complain
, in_decl
);
14966 return finish_underlying_type (type
);
14969 case TYPE_ARGUMENT_PACK
:
14970 case NONTYPE_ARGUMENT_PACK
:
14974 if (code
== NONTYPE_ARGUMENT_PACK
)
14975 r
= make_node (code
);
14977 r
= cxx_make_type (code
);
14979 tree pack_args
= ARGUMENT_PACK_ARGS (t
);
14980 pack_args
= tsubst_template_args (pack_args
, args
, complain
, in_decl
);
14981 SET_ARGUMENT_PACK_ARGS (r
, pack_args
);
14999 /* We should use one of the expression tsubsts for these codes. */
15000 gcc_unreachable ();
15003 sorry ("use of %qs in template", get_tree_code_name (code
));
15004 return error_mark_node
;
15008 /* tsubst a BASELINK. OBJECT_TYPE, if non-NULL, is the type of the
15009 expression on the left-hand side of the "." or "->" operator. We
15010 only do the lookup if we had a dependent BASELINK. Otherwise we
15011 adjust it onto the instantiated heirarchy. */
15014 tsubst_baselink (tree baselink
, tree object_type
,
15015 tree args
, tsubst_flags_t complain
, tree in_decl
)
15017 bool qualified_p
= BASELINK_QUALIFIED_P (baselink
);
15018 tree qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
15019 qualifying_scope
= tsubst (qualifying_scope
, args
, complain
, in_decl
);
15021 tree optype
= BASELINK_OPTYPE (baselink
);
15022 optype
= tsubst (optype
, args
, complain
, in_decl
);
15024 tree template_args
= NULL_TREE
;
15025 bool template_id_p
= false;
15026 tree fns
= BASELINK_FUNCTIONS (baselink
);
15027 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
15029 template_id_p
= true;
15030 template_args
= TREE_OPERAND (fns
, 1);
15031 fns
= TREE_OPERAND (fns
, 0);
15033 template_args
= tsubst_template_args (template_args
, args
,
15034 complain
, in_decl
);
15037 tree binfo_type
= BINFO_TYPE (BASELINK_BINFO (baselink
));
15038 binfo_type
= tsubst (binfo_type
, args
, complain
, in_decl
);
15039 bool dependent_p
= binfo_type
!= BINFO_TYPE (BASELINK_BINFO (baselink
));
15043 tree name
= OVL_NAME (fns
);
15044 if (IDENTIFIER_CONV_OP_P (name
))
15045 name
= make_conv_op_name (optype
);
15047 if (name
== complete_dtor_identifier
)
15048 /* Treat as-if non-dependent below. */
15049 dependent_p
= false;
15051 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
15054 if ((complain
& tf_error
)
15055 && constructor_name_p (name
, qualifying_scope
))
15056 error ("cannot call constructor %<%T::%D%> directly",
15057 qualifying_scope
, name
);
15058 return error_mark_node
;
15061 if (BASELINK_P (baselink
))
15062 fns
= BASELINK_FUNCTIONS (baselink
);
15065 /* We're going to overwrite pieces below, make a duplicate. */
15066 baselink
= copy_node (baselink
);
15068 /* If lookup found a single function, mark it as used at this point.
15069 (If lookup found multiple functions the one selected later by
15070 overload resolution will be marked as used at that point.) */
15071 if (!template_id_p
&& !really_overloaded_fn (fns
))
15073 tree fn
= OVL_FIRST (fns
);
15074 bool ok
= mark_used (fn
, complain
);
15075 if (!ok
&& !(complain
& tf_error
))
15076 return error_mark_node
;
15077 if (ok
&& BASELINK_P (baselink
))
15078 /* We might have instantiated an auto function. */
15079 TREE_TYPE (baselink
) = TREE_TYPE (fn
);
15082 if (BASELINK_P (baselink
))
15084 /* Add back the template arguments, if present. */
15086 BASELINK_FUNCTIONS (baselink
)
15087 = build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fns
, template_args
);
15089 /* Update the conversion operator type. */
15090 BASELINK_OPTYPE (baselink
) = optype
;
15094 object_type
= current_class_type
;
15096 if (qualified_p
|| !dependent_p
)
15098 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
15102 /* We need to call adjust_result_of_qualified_name_lookup in case the
15103 destructor names a base class, but we unset BASELINK_QUALIFIED_P
15104 so that we still get virtual function binding. */
15105 BASELINK_QUALIFIED_P (baselink
) = false;
15111 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
15112 true if the qualified-id will be a postfix-expression in-and-of
15113 itself; false if more of the postfix-expression follows the
15114 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
15118 tsubst_qualified_id (tree qualified_id
, tree args
,
15119 tsubst_flags_t complain
, tree in_decl
,
15120 bool done
, bool address_p
)
15126 tree template_args
;
15127 location_t loc
= UNKNOWN_LOCATION
;
15129 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
15131 /* Figure out what name to look up. */
15132 name
= TREE_OPERAND (qualified_id
, 1);
15133 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
15135 is_template
= true;
15136 loc
= EXPR_LOCATION (name
);
15137 template_args
= TREE_OPERAND (name
, 1);
15139 template_args
= tsubst_template_args (template_args
, args
,
15140 complain
, in_decl
);
15141 if (template_args
== error_mark_node
)
15142 return error_mark_node
;
15143 name
= TREE_OPERAND (name
, 0);
15147 is_template
= false;
15148 template_args
= NULL_TREE
;
15151 /* Substitute into the qualifying scope. When there are no ARGS, we
15152 are just trying to simplify a non-dependent expression. In that
15153 case the qualifying scope may be dependent, and, in any case,
15154 substituting will not help. */
15155 scope
= TREE_OPERAND (qualified_id
, 0);
15158 scope
= tsubst (scope
, args
, complain
, in_decl
);
15159 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
15164 if (dependent_scope_p (scope
))
15167 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
15168 tree r
= build_qualified_name (NULL_TREE
, scope
, expr
,
15169 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
15170 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (qualified_id
);
15174 if (!BASELINK_P (name
) && !DECL_P (expr
))
15176 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
15178 /* A BIT_NOT_EXPR is used to represent a destructor. */
15179 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
15181 error ("qualifying type %qT does not match destructor name ~%qT",
15182 scope
, TREE_OPERAND (expr
, 0));
15183 expr
= error_mark_node
;
15186 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
15187 /*is_type_p=*/0, false);
15190 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
15191 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
15192 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
15194 if (complain
& tf_error
)
15196 error ("dependent-name %qE is parsed as a non-type, but "
15197 "instantiation yields a type", qualified_id
);
15198 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
15200 return error_mark_node
;
15206 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
15208 /* Remember that there was a reference to this entity. */
15209 if (!mark_used (expr
, complain
) && !(complain
& tf_error
))
15210 return error_mark_node
;
15213 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
15215 if (complain
& tf_error
)
15216 qualified_name_lookup_error (scope
,
15217 TREE_OPERAND (qualified_id
, 1),
15218 expr
, input_location
);
15219 return error_mark_node
;
15224 /* We may be repeating a check already done during parsing, but
15225 if it was well-formed and passed then, it will pass again
15226 now, and if it didn't, we wouldn't have got here. The case
15227 we want to catch is when we couldn't tell then, and can now,
15228 namely when templ prior to substitution was an
15230 if (flag_concepts
&& check_auto_in_tmpl_args (expr
, template_args
))
15231 return error_mark_node
;
15233 if (variable_template_p (expr
))
15234 expr
= lookup_and_finish_template_variable (expr
, template_args
,
15237 expr
= lookup_template_function (expr
, template_args
);
15240 if (expr
== error_mark_node
&& complain
& tf_error
)
15241 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
15242 expr
, input_location
);
15243 else if (TYPE_P (scope
))
15245 expr
= (adjust_result_of_qualified_name_lookup
15246 (expr
, scope
, current_nonlambda_class_type ()));
15247 expr
= (finish_qualified_id_expr
15248 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
15249 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
15250 /*template_arg_p=*/false, complain
));
15253 /* Expressions do not generally have reference type. */
15254 if (TREE_CODE (expr
) != SCOPE_REF
15255 /* However, if we're about to form a pointer-to-member, we just
15256 want the referenced member referenced. */
15257 && TREE_CODE (expr
) != OFFSET_REF
)
15258 expr
= convert_from_reference (expr
);
15260 if (REF_PARENTHESIZED_P (qualified_id
))
15261 expr
= force_paren_expr (expr
);
15266 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
15267 initializer, DECL is the substituted VAR_DECL. Other arguments are as
15271 tsubst_init (tree init
, tree decl
, tree args
,
15272 tsubst_flags_t complain
, tree in_decl
)
15277 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
15279 if (!init
&& TREE_TYPE (decl
) != error_mark_node
)
15281 /* If we had an initializer but it
15282 instantiated to nothing,
15283 value-initialize the object. This will
15284 only occur when the initializer was a
15285 pack expansion where the parameter packs
15286 used in that expansion were of length
15288 init
= build_value_init (TREE_TYPE (decl
),
15290 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
15291 init
= get_target_expr_sfinae (init
, complain
);
15292 if (TREE_CODE (init
) == TARGET_EXPR
)
15293 TARGET_EXPR_DIRECT_INIT_P (init
) = true;
15299 /* Like tsubst, but deals with expressions. This function just replaces
15300 template parms; to finish processing the resultant expression, use
15301 tsubst_copy_and_build or tsubst_expr. */
15304 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
15306 enum tree_code code
;
15309 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
15312 code
= TREE_CODE (t
);
15317 r
= retrieve_local_specialization (t
);
15319 if (r
== NULL_TREE
)
15321 /* We get here for a use of 'this' in an NSDMI. */
15322 if (DECL_NAME (t
) == this_identifier
&& current_class_ptr
)
15323 return current_class_ptr
;
15325 /* This can happen for a parameter name used later in a function
15326 declaration (such as in a late-specified return type). Just
15327 make a dummy decl, since it's only used for its type. */
15328 gcc_assert (cp_unevaluated_operand
!= 0);
15329 r
= tsubst_decl (t
, args
, complain
);
15330 /* Give it the template pattern as its context; its true context
15331 hasn't been instantiated yet and this is good enough for
15333 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
15336 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
15337 r
= argument_pack_select_arg (r
);
15338 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
15339 return error_mark_node
;
15347 if (DECL_TEMPLATE_PARM_P (t
))
15348 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
15349 /* There is no need to substitute into namespace-scope
15351 if (DECL_NAMESPACE_SCOPE_P (t
))
15353 /* If ARGS is NULL, then T is known to be non-dependent. */
15354 if (args
== NULL_TREE
)
15355 return scalar_constant_value (t
);
15357 /* Unfortunately, we cannot just call lookup_name here.
15360 template <int I> int f() {
15362 struct S { void g() { E e = a; } };
15365 When we instantiate f<7>::S::g(), say, lookup_name is not
15366 clever enough to find f<7>::a. */
15368 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
15369 /*entering_scope=*/0);
15371 for (v
= TYPE_VALUES (enum_type
);
15373 v
= TREE_CHAIN (v
))
15374 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
15375 return TREE_VALUE (v
);
15377 /* We didn't find the name. That should never happen; if
15378 name-lookup found it during preliminary parsing, we
15379 should find it again here during instantiation. */
15380 gcc_unreachable ();
15385 if (DECL_CONTEXT (t
))
15389 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
15390 /*entering_scope=*/1);
15391 if (ctx
!= DECL_CONTEXT (t
))
15393 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
15396 if (complain
& tf_error
)
15397 error ("using invalid field %qD", t
);
15398 return error_mark_node
;
15407 case FUNCTION_DECL
:
15408 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
15409 r
= tsubst (t
, args
, complain
, in_decl
);
15410 else if (local_variable_p (t
)
15411 && uses_template_parms (DECL_CONTEXT (t
)))
15413 r
= retrieve_local_specialization (t
);
15414 if (r
== NULL_TREE
)
15416 /* First try name lookup to find the instantiation. */
15417 r
= lookup_name (DECL_NAME (t
));
15418 if (r
&& !is_capture_proxy (r
))
15420 /* Make sure that the one we found is the one we want. */
15421 tree ctx
= enclosing_instantiation_of (DECL_CONTEXT (t
));
15422 if (ctx
!= DECL_CONTEXT (r
))
15430 /* This can happen for a variable used in a
15431 late-specified return type of a local lambda, or for a
15432 local static or constant. Building a new VAR_DECL
15433 should be OK in all those cases. */
15434 r
= tsubst_decl (t
, args
, complain
);
15435 if (local_specializations
)
15436 /* Avoid infinite recursion (79640). */
15437 register_local_specialization (r
, t
);
15438 if (decl_maybe_constant_var_p (r
))
15440 /* We can't call cp_finish_decl, so handle the
15441 initializer by hand. */
15442 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
15443 complain
, in_decl
);
15444 if (!processing_template_decl
)
15445 init
= maybe_constant_init (init
);
15446 if (processing_template_decl
15447 ? potential_constant_expression (init
)
15448 : reduced_constant_expression_p (init
))
15449 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
15450 = TREE_CONSTANT (r
) = true;
15451 DECL_INITIAL (r
) = init
;
15452 if (tree auto_node
= type_uses_auto (TREE_TYPE (r
)))
15454 = do_auto_deduction (TREE_TYPE (r
), init
, auto_node
,
15455 complain
, adc_variable_type
);
15457 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
15458 || decl_constant_var_p (r
)
15459 || errorcount
|| sorrycount
);
15460 if (!processing_template_decl
15461 && !TREE_STATIC (r
))
15462 r
= process_outer_var_ref (r
, complain
);
15464 /* Remember this for subsequent uses. */
15465 if (local_specializations
)
15466 register_local_specialization (r
, t
);
15468 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
15469 r
= argument_pack_select_arg (r
);
15473 if (!mark_used (r
, complain
))
15474 return error_mark_node
;
15477 case NAMESPACE_DECL
:
15481 /* An OVERLOAD will always be a non-dependent overload set; an
15482 overload set from function scope will just be represented with an
15483 IDENTIFIER_NODE, and from class scope with a BASELINK. */
15484 gcc_assert (!uses_template_parms (t
));
15485 /* We must have marked any lookups as persistent. */
15486 gcc_assert (!OVL_LOOKUP_P (t
) || OVL_USED_P (t
));
15490 return tsubst_baselink (t
, current_nonlambda_class_type (),
15491 args
, complain
, in_decl
);
15493 case TEMPLATE_DECL
:
15494 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
15495 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
15496 args
, complain
, in_decl
);
15497 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
15498 return tsubst (t
, args
, complain
, in_decl
);
15499 else if (DECL_CLASS_SCOPE_P (t
)
15500 && uses_template_parms (DECL_CONTEXT (t
)))
15502 /* Template template argument like the following example need
15505 template <template <class> class TT> struct C {};
15506 template <class T> struct D {
15507 template <class U> struct E {};
15512 We are processing the template argument `E' in #1 for
15513 the template instantiation #2. Originally, `E' is a
15514 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
15515 have to substitute this with one having context `D<int>'. */
15517 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
15518 if (dependent_scope_p (context
))
15520 /* When rewriting a constructor into a deduction guide, a
15521 non-dependent name can become dependent, so memtmpl<args>
15522 becomes context::template memtmpl<args>. */
15523 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15524 return build_qualified_name (type
, context
, DECL_NAME (t
),
15527 return lookup_field (context
, DECL_NAME(t
), 0, false);
15530 /* Ordinary template template argument. */
15533 case NON_LVALUE_EXPR
:
15534 case VIEW_CONVERT_EXPR
:
15536 /* Handle location wrappers by substituting the wrapped node
15537 first, *then* reusing the resulting type. Doing the type
15538 first ensures that we handle template parameters and
15539 parameter pack expansions. */
15540 gcc_assert (location_wrapper_p (t
));
15541 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15542 return maybe_wrap_with_location (op0
, EXPR_LOCATION (t
));
15546 case REINTERPRET_CAST_EXPR
:
15547 case CONST_CAST_EXPR
:
15548 case STATIC_CAST_EXPR
:
15549 case DYNAMIC_CAST_EXPR
:
15550 case IMPLICIT_CONV_EXPR
:
15554 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15555 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15556 return build1 (code
, type
, op0
);
15560 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0))
15561 || ARGUMENT_PACK_P (TREE_OPERAND (t
, 0)))
15563 tree expanded
, op
= TREE_OPERAND (t
, 0);
15566 if (SIZEOF_EXPR_TYPE_P (t
))
15567 op
= TREE_TYPE (op
);
15569 ++cp_unevaluated_operand
;
15570 ++c_inhibit_evaluation_warnings
;
15571 /* We only want to compute the number of arguments. */
15572 if (PACK_EXPANSION_P (op
))
15573 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
15575 expanded
= tsubst_template_args (ARGUMENT_PACK_ARGS (op
),
15576 args
, complain
, in_decl
);
15577 --cp_unevaluated_operand
;
15578 --c_inhibit_evaluation_warnings
;
15580 if (TREE_CODE (expanded
) == TREE_VEC
)
15582 len
= TREE_VEC_LENGTH (expanded
);
15583 /* Set TREE_USED for the benefit of -Wunused. */
15584 for (int i
= 0; i
< len
; i
++)
15585 if (DECL_P (TREE_VEC_ELT (expanded
, i
)))
15586 TREE_USED (TREE_VEC_ELT (expanded
, i
)) = true;
15589 if (expanded
== error_mark_node
)
15590 return error_mark_node
;
15591 else if (PACK_EXPANSION_P (expanded
)
15592 || (TREE_CODE (expanded
) == TREE_VEC
15593 && pack_expansion_args_count (expanded
)))
15596 if (PACK_EXPANSION_P (expanded
))
15598 else if (TREE_VEC_LENGTH (expanded
) == 1)
15599 expanded
= TREE_VEC_ELT (expanded
, 0);
15601 expanded
= make_argument_pack (expanded
);
15603 if (TYPE_P (expanded
))
15604 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
15606 complain
& tf_error
);
15608 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
15609 complain
& tf_error
);
15612 return build_int_cst (size_type_node
, len
);
15614 if (SIZEOF_EXPR_TYPE_P (t
))
15616 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
15617 args
, complain
, in_decl
);
15618 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
15619 r
= build1 (SIZEOF_EXPR
,
15620 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
15621 SIZEOF_EXPR_TYPE_P (r
) = 1;
15628 case TRUTH_NOT_EXPR
:
15631 case UNARY_PLUS_EXPR
: /* Unary + */
15633 case AT_ENCODE_EXPR
:
15637 case REALPART_EXPR
:
15638 case IMAGPART_EXPR
:
15641 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15642 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15643 r
= build1 (code
, type
, op0
);
15644 if (code
== ALIGNOF_EXPR
)
15645 ALIGNOF_EXPR_STD_P (r
) = ALIGNOF_EXPR_STD_P (t
);
15649 case COMPONENT_REF
:
15654 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15655 name
= TREE_OPERAND (t
, 1);
15656 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
15658 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
15659 complain
, in_decl
);
15660 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
15662 else if (TREE_CODE (name
) == SCOPE_REF
15663 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
15665 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
15666 complain
, in_decl
);
15667 name
= TREE_OPERAND (name
, 1);
15668 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
15669 complain
, in_decl
);
15670 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
15671 name
= build_qualified_name (/*type=*/NULL_TREE
,
15673 /*template_p=*/false);
15675 else if (BASELINK_P (name
))
15676 name
= tsubst_baselink (name
,
15677 non_reference (TREE_TYPE (object
)),
15681 name
= tsubst_copy (name
, args
, complain
, in_decl
);
15682 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
15688 case TRUNC_DIV_EXPR
:
15689 case CEIL_DIV_EXPR
:
15690 case FLOOR_DIV_EXPR
:
15691 case ROUND_DIV_EXPR
:
15692 case EXACT_DIV_EXPR
:
15696 case TRUNC_MOD_EXPR
:
15697 case FLOOR_MOD_EXPR
:
15698 case TRUTH_ANDIF_EXPR
:
15699 case TRUTH_ORIF_EXPR
:
15700 case TRUTH_AND_EXPR
:
15701 case TRUTH_OR_EXPR
:
15714 case COMPOUND_EXPR
:
15717 case PREDECREMENT_EXPR
:
15718 case PREINCREMENT_EXPR
:
15719 case POSTDECREMENT_EXPR
:
15720 case POSTINCREMENT_EXPR
:
15722 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15723 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15724 return build_nt (code
, op0
, op1
);
15729 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15730 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15731 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
15732 QUALIFIED_NAME_IS_TEMPLATE (t
));
15737 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15738 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15739 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
15744 int n
= VL_EXP_OPERAND_LENGTH (t
);
15745 tree result
= build_vl_exp (CALL_EXPR
, n
);
15747 for (i
= 0; i
< n
; i
++)
15748 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
15749 complain
, in_decl
);
15755 case PSEUDO_DTOR_EXPR
:
15756 case VEC_PERM_EXPR
:
15758 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15759 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15760 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
15761 r
= build_nt (code
, op0
, op1
, op2
);
15762 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
15768 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15769 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15770 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
15771 r
= build_nt (code
, op0
, op1
, op2
);
15772 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
15778 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15779 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15780 r
= build_nt (code
, op0
, op1
);
15781 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
15782 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
15786 case TEMPLATE_ID_EXPR
:
15788 /* Substituted template arguments */
15789 tree fn
= TREE_OPERAND (t
, 0);
15790 tree targs
= TREE_OPERAND (t
, 1);
15792 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
15794 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
15796 return lookup_template_function (fn
, targs
);
15801 tree purpose
, value
, chain
;
15803 if (t
== void_list_node
)
15806 purpose
= TREE_PURPOSE (t
);
15808 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
15809 value
= TREE_VALUE (t
);
15811 value
= tsubst_copy (value
, args
, complain
, in_decl
);
15812 chain
= TREE_CHAIN (t
);
15813 if (chain
&& chain
!= void_type_node
)
15814 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
15815 if (purpose
== TREE_PURPOSE (t
)
15816 && value
== TREE_VALUE (t
)
15817 && chain
== TREE_CHAIN (t
))
15819 return tree_cons (purpose
, value
, chain
);
15824 case ENUMERAL_TYPE
:
15826 case TEMPLATE_TYPE_PARM
:
15827 case TEMPLATE_TEMPLATE_PARM
:
15828 case BOUND_TEMPLATE_TEMPLATE_PARM
:
15829 case TEMPLATE_PARM_INDEX
:
15831 case REFERENCE_TYPE
:
15833 case FUNCTION_TYPE
:
15836 case TYPENAME_TYPE
:
15837 case UNBOUND_CLASS_TEMPLATE
:
15839 case DECLTYPE_TYPE
:
15841 return tsubst (t
, args
, complain
, in_decl
);
15845 /* Fall through. */
15846 case IDENTIFIER_NODE
:
15847 if (IDENTIFIER_CONV_OP_P (t
))
15849 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15850 return make_conv_op_name (new_type
);
15856 /* This is handled by tsubst_copy_and_build. */
15857 gcc_unreachable ();
15861 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15862 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15863 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
15866 case CLEANUP_POINT_EXPR
:
15867 /* We shouldn't have built any of these during initial template
15868 generation. Instead, they should be built during instantiation
15869 in response to the saved STMT_IS_FULL_EXPR_P setting. */
15870 gcc_unreachable ();
15874 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15875 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15876 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15877 r
= build2 (code
, type
, op0
, op1
);
15878 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
15879 if (!mark_used (TREE_OPERAND (r
, 1), complain
)
15880 && !(complain
& tf_error
))
15881 return error_mark_node
;
15885 case EXPR_PACK_EXPANSION
:
15886 error ("invalid use of pack expansion expression");
15887 return error_mark_node
;
15889 case NONTYPE_ARGUMENT_PACK
:
15890 error ("use %<...%> to expand argument pack");
15891 return error_mark_node
;
15894 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
15902 /* Instantiate any typedefs in the type. */
15903 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15904 r
= fold_convert (type
, t
);
15905 gcc_assert (TREE_CODE (r
) == code
);
15910 /* These can sometimes show up in a partial instantiation, but never
15911 involve template parms. */
15912 gcc_assert (!uses_template_parms (t
));
15915 case UNARY_LEFT_FOLD_EXPR
:
15916 return tsubst_unary_left_fold (t
, args
, complain
, in_decl
);
15917 case UNARY_RIGHT_FOLD_EXPR
:
15918 return tsubst_unary_right_fold (t
, args
, complain
, in_decl
);
15919 case BINARY_LEFT_FOLD_EXPR
:
15920 return tsubst_binary_left_fold (t
, args
, complain
, in_decl
);
15921 case BINARY_RIGHT_FOLD_EXPR
:
15922 return tsubst_binary_right_fold (t
, args
, complain
, in_decl
);
15926 case DEBUG_BEGIN_STMT
:
15927 /* ??? There's no point in copying it for now, but maybe some
15928 day it will contain more information, such as a pointer back
15929 to the containing function, inlined copy or so. */
15933 /* We shouldn't get here, but keep going if !flag_checking. */
15935 gcc_unreachable ();
15940 /* Helper function for tsubst_omp_clauses, used for instantiation of
15941 OMP_CLAUSE_DECL of clauses. */
15944 tsubst_omp_clause_decl (tree decl
, tree args
, tsubst_flags_t complain
,
15947 if (decl
== NULL_TREE
)
15950 /* Handle an OpenMP array section represented as a TREE_LIST (or
15951 OMP_CLAUSE_DEPEND_KIND). An OMP_CLAUSE_DEPEND (with a depend
15952 kind of OMP_CLAUSE_DEPEND_SINK) can also be represented as a
15953 TREE_LIST. We can handle it exactly the same as an array section
15954 (purpose, value, and a chain), even though the nomenclature
15955 (low_bound, length, etc) is different. */
15956 if (TREE_CODE (decl
) == TREE_LIST
)
15959 = tsubst_expr (TREE_PURPOSE (decl
), args
, complain
, in_decl
,
15960 /*integral_constant_expression_p=*/false);
15961 tree length
= tsubst_expr (TREE_VALUE (decl
), args
, complain
, in_decl
,
15962 /*integral_constant_expression_p=*/false);
15963 tree chain
= tsubst_omp_clause_decl (TREE_CHAIN (decl
), args
, complain
,
15965 if (TREE_PURPOSE (decl
) == low_bound
15966 && TREE_VALUE (decl
) == length
15967 && TREE_CHAIN (decl
) == chain
)
15969 tree ret
= tree_cons (low_bound
, length
, chain
);
15970 OMP_CLAUSE_DEPEND_SINK_NEGATIVE (ret
)
15971 = OMP_CLAUSE_DEPEND_SINK_NEGATIVE (decl
);
15974 tree ret
= tsubst_expr (decl
, args
, complain
, in_decl
,
15975 /*integral_constant_expression_p=*/false);
15976 /* Undo convert_from_reference tsubst_expr could have called. */
15978 && REFERENCE_REF_P (ret
)
15979 && !REFERENCE_REF_P (decl
))
15980 ret
= TREE_OPERAND (ret
, 0);
15984 /* Like tsubst_copy, but specifically for OpenMP clauses. */
15987 tsubst_omp_clauses (tree clauses
, enum c_omp_region_type ort
,
15988 tree args
, tsubst_flags_t complain
, tree in_decl
)
15990 tree new_clauses
= NULL_TREE
, nc
, oc
;
15991 tree linear_no_step
= NULL_TREE
;
15993 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
15995 nc
= copy_node (oc
);
15996 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
15999 switch (OMP_CLAUSE_CODE (nc
))
16001 case OMP_CLAUSE_LASTPRIVATE
:
16002 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
16004 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
16005 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
16006 in_decl
, /*integral_constant_expression_p=*/false);
16007 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
16008 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
16011 case OMP_CLAUSE_PRIVATE
:
16012 case OMP_CLAUSE_SHARED
:
16013 case OMP_CLAUSE_FIRSTPRIVATE
:
16014 case OMP_CLAUSE_COPYIN
:
16015 case OMP_CLAUSE_COPYPRIVATE
:
16016 case OMP_CLAUSE_UNIFORM
:
16017 case OMP_CLAUSE_DEPEND
:
16018 case OMP_CLAUSE_FROM
:
16019 case OMP_CLAUSE_TO
:
16020 case OMP_CLAUSE_MAP
:
16021 case OMP_CLAUSE_USE_DEVICE_PTR
:
16022 case OMP_CLAUSE_IS_DEVICE_PTR
:
16023 OMP_CLAUSE_DECL (nc
)
16024 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
16027 case OMP_CLAUSE_TILE
:
16028 case OMP_CLAUSE_IF
:
16029 case OMP_CLAUSE_NUM_THREADS
:
16030 case OMP_CLAUSE_SCHEDULE
:
16031 case OMP_CLAUSE_COLLAPSE
:
16032 case OMP_CLAUSE_FINAL
:
16033 case OMP_CLAUSE_DEVICE
:
16034 case OMP_CLAUSE_DIST_SCHEDULE
:
16035 case OMP_CLAUSE_NUM_TEAMS
:
16036 case OMP_CLAUSE_THREAD_LIMIT
:
16037 case OMP_CLAUSE_SAFELEN
:
16038 case OMP_CLAUSE_SIMDLEN
:
16039 case OMP_CLAUSE_NUM_TASKS
:
16040 case OMP_CLAUSE_GRAINSIZE
:
16041 case OMP_CLAUSE_PRIORITY
:
16042 case OMP_CLAUSE_ORDERED
:
16043 case OMP_CLAUSE_HINT
:
16044 case OMP_CLAUSE_NUM_GANGS
:
16045 case OMP_CLAUSE_NUM_WORKERS
:
16046 case OMP_CLAUSE_VECTOR_LENGTH
:
16047 case OMP_CLAUSE_WORKER
:
16048 case OMP_CLAUSE_VECTOR
:
16049 case OMP_CLAUSE_ASYNC
:
16050 case OMP_CLAUSE_WAIT
:
16051 OMP_CLAUSE_OPERAND (nc
, 0)
16052 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
16053 in_decl
, /*integral_constant_expression_p=*/false);
16055 case OMP_CLAUSE_REDUCTION
:
16056 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
16058 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
16059 if (TREE_CODE (placeholder
) == SCOPE_REF
)
16061 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
16062 complain
, in_decl
);
16063 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
16064 = build_qualified_name (NULL_TREE
, scope
,
16065 TREE_OPERAND (placeholder
, 1),
16069 gcc_assert (identifier_p (placeholder
));
16071 OMP_CLAUSE_DECL (nc
)
16072 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
16075 case OMP_CLAUSE_GANG
:
16076 case OMP_CLAUSE_ALIGNED
:
16077 OMP_CLAUSE_DECL (nc
)
16078 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
16080 OMP_CLAUSE_OPERAND (nc
, 1)
16081 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
16082 in_decl
, /*integral_constant_expression_p=*/false);
16084 case OMP_CLAUSE_LINEAR
:
16085 OMP_CLAUSE_DECL (nc
)
16086 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
16088 if (OMP_CLAUSE_LINEAR_STEP (oc
) == NULL_TREE
)
16090 gcc_assert (!linear_no_step
);
16091 linear_no_step
= nc
;
16093 else if (OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (oc
))
16094 OMP_CLAUSE_LINEAR_STEP (nc
)
16095 = tsubst_omp_clause_decl (OMP_CLAUSE_LINEAR_STEP (oc
), args
,
16096 complain
, in_decl
);
16098 OMP_CLAUSE_LINEAR_STEP (nc
)
16099 = tsubst_expr (OMP_CLAUSE_LINEAR_STEP (oc
), args
, complain
,
16101 /*integral_constant_expression_p=*/false);
16103 case OMP_CLAUSE_NOWAIT
:
16104 case OMP_CLAUSE_DEFAULT
:
16105 case OMP_CLAUSE_UNTIED
:
16106 case OMP_CLAUSE_MERGEABLE
:
16107 case OMP_CLAUSE_INBRANCH
:
16108 case OMP_CLAUSE_NOTINBRANCH
:
16109 case OMP_CLAUSE_PROC_BIND
:
16110 case OMP_CLAUSE_FOR
:
16111 case OMP_CLAUSE_PARALLEL
:
16112 case OMP_CLAUSE_SECTIONS
:
16113 case OMP_CLAUSE_TASKGROUP
:
16114 case OMP_CLAUSE_NOGROUP
:
16115 case OMP_CLAUSE_THREADS
:
16116 case OMP_CLAUSE_SIMD
:
16117 case OMP_CLAUSE_DEFAULTMAP
:
16118 case OMP_CLAUSE_INDEPENDENT
:
16119 case OMP_CLAUSE_AUTO
:
16120 case OMP_CLAUSE_SEQ
:
16123 gcc_unreachable ();
16125 if ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
)
16126 switch (OMP_CLAUSE_CODE (nc
))
16128 case OMP_CLAUSE_SHARED
:
16129 case OMP_CLAUSE_PRIVATE
:
16130 case OMP_CLAUSE_FIRSTPRIVATE
:
16131 case OMP_CLAUSE_LASTPRIVATE
:
16132 case OMP_CLAUSE_COPYPRIVATE
:
16133 case OMP_CLAUSE_LINEAR
:
16134 case OMP_CLAUSE_REDUCTION
:
16135 case OMP_CLAUSE_USE_DEVICE_PTR
:
16136 case OMP_CLAUSE_IS_DEVICE_PTR
:
16137 /* tsubst_expr on SCOPE_REF results in returning
16138 finish_non_static_data_member result. Undo that here. */
16139 if (TREE_CODE (OMP_CLAUSE_DECL (oc
)) == SCOPE_REF
16140 && (TREE_CODE (TREE_OPERAND (OMP_CLAUSE_DECL (oc
), 1))
16141 == IDENTIFIER_NODE
))
16143 tree t
= OMP_CLAUSE_DECL (nc
);
16146 switch (TREE_CODE (v
))
16148 case COMPONENT_REF
:
16152 case POINTER_PLUS_EXPR
:
16153 v
= TREE_OPERAND (v
, 0);
16156 if (DECL_CONTEXT (v
) == current_function_decl
16157 && DECL_ARTIFICIAL (v
)
16158 && DECL_NAME (v
) == this_identifier
)
16159 OMP_CLAUSE_DECL (nc
) = TREE_OPERAND (t
, 1);
16166 else if (VAR_P (OMP_CLAUSE_DECL (oc
))
16167 && DECL_HAS_VALUE_EXPR_P (OMP_CLAUSE_DECL (oc
))
16168 && DECL_ARTIFICIAL (OMP_CLAUSE_DECL (oc
))
16169 && DECL_LANG_SPECIFIC (OMP_CLAUSE_DECL (oc
))
16170 && DECL_OMP_PRIVATIZED_MEMBER (OMP_CLAUSE_DECL (oc
)))
16172 tree decl
= OMP_CLAUSE_DECL (nc
);
16175 retrofit_lang_decl (decl
);
16176 DECL_OMP_PRIVATIZED_MEMBER (decl
) = 1;
16185 new_clauses
= nreverse (new_clauses
);
16186 if (ort
!= C_ORT_OMP_DECLARE_SIMD
)
16188 new_clauses
= finish_omp_clauses (new_clauses
, ort
);
16189 if (linear_no_step
)
16190 for (nc
= new_clauses
; nc
; nc
= OMP_CLAUSE_CHAIN (nc
))
16191 if (nc
== linear_no_step
)
16193 OMP_CLAUSE_LINEAR_STEP (nc
) = NULL_TREE
;
16197 return new_clauses
;
16200 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
16203 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
16206 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
16208 tree purpose
, value
, chain
;
16213 if (TREE_CODE (t
) != TREE_LIST
)
16214 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
16215 /*function_p=*/false,
16216 /*integral_constant_expression_p=*/false);
16218 if (t
== void_list_node
)
16221 purpose
= TREE_PURPOSE (t
);
16223 purpose
= RECUR (purpose
);
16224 value
= TREE_VALUE (t
);
16227 if (TREE_CODE (value
) != LABEL_DECL
)
16228 value
= RECUR (value
);
16231 value
= lookup_label (DECL_NAME (value
));
16232 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
16233 TREE_USED (value
) = 1;
16236 chain
= TREE_CHAIN (t
);
16237 if (chain
&& chain
!= void_type_node
)
16238 chain
= RECUR (chain
);
16239 return tree_cons (purpose
, value
, chain
);
16243 /* Used to temporarily communicate the list of #pragma omp parallel
16244 clauses to #pragma omp for instantiation if they are combined
16247 static tree
*omp_parallel_combined_clauses
;
16249 /* Substitute one OMP_FOR iterator. */
16252 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree orig_declv
,
16253 tree initv
, tree condv
, tree incrv
, tree
*clauses
,
16254 tree args
, tsubst_flags_t complain
, tree in_decl
,
16255 bool integral_constant_expression_p
)
16257 #define RECUR(NODE) \
16258 tsubst_expr ((NODE), args, complain, in_decl, \
16259 integral_constant_expression_p)
16260 tree decl
, init
, cond
, incr
;
16262 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
16263 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
16265 if (orig_declv
&& OMP_FOR_ORIG_DECLS (t
))
16267 tree o
= TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (t
), i
);
16268 TREE_VEC_ELT (orig_declv
, i
) = RECUR (o
);
16271 decl
= TREE_OPERAND (init
, 0);
16272 init
= TREE_OPERAND (init
, 1);
16273 tree decl_expr
= NULL_TREE
;
16274 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
16276 /* We need to jump through some hoops to handle declarations in the
16277 init-statement, since we might need to handle auto deduction,
16278 but we need to keep control of initialization. */
16280 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
16281 decl
= tsubst_decl (decl
, args
, complain
);
16285 if (TREE_CODE (decl
) == SCOPE_REF
)
16287 decl
= RECUR (decl
);
16288 if (TREE_CODE (decl
) == COMPONENT_REF
)
16292 switch (TREE_CODE (v
))
16294 case COMPONENT_REF
:
16298 case POINTER_PLUS_EXPR
:
16299 v
= TREE_OPERAND (v
, 0);
16302 if (DECL_CONTEXT (v
) == current_function_decl
16303 && DECL_ARTIFICIAL (v
)
16304 && DECL_NAME (v
) == this_identifier
)
16306 decl
= TREE_OPERAND (decl
, 1);
16307 decl
= omp_privatize_field (decl
, false);
16317 decl
= RECUR (decl
);
16319 init
= RECUR (init
);
16321 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
16322 if (auto_node
&& init
)
16324 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
, complain
);
16326 gcc_assert (!type_dependent_expression_p (decl
));
16328 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
16332 /* Declare the variable, but don't let that initialize it. */
16333 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
16334 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
16336 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
16339 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
16340 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
16341 if (TREE_CODE (incr
) == MODIFY_EXPR
)
16343 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
16344 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
16345 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
16346 NOP_EXPR
, rhs
, complain
);
16349 incr
= RECUR (incr
);
16350 TREE_VEC_ELT (declv
, i
) = decl
;
16351 TREE_VEC_ELT (initv
, i
) = init
;
16352 TREE_VEC_ELT (condv
, i
) = cond
;
16353 TREE_VEC_ELT (incrv
, i
) = incr
;
16359 /* Declare and initialize the variable. */
16367 for (j
= (omp_parallel_combined_clauses
== NULL
? 1 : 0); j
< 2; j
++)
16369 for (pc
= j
? clauses
: omp_parallel_combined_clauses
; *pc
; )
16371 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_PRIVATE
16372 && OMP_CLAUSE_DECL (*pc
) == decl
)
16374 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_LASTPRIVATE
16375 && OMP_CLAUSE_DECL (*pc
) == decl
)
16379 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
16381 *pc
= OMP_CLAUSE_CHAIN (c
);
16382 OMP_CLAUSE_CHAIN (c
) = *clauses
;
16385 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_FIRSTPRIVATE
16386 && OMP_CLAUSE_DECL (*pc
) == decl
)
16388 error ("iteration variable %qD should not be firstprivate",
16390 *pc
= OMP_CLAUSE_CHAIN (*pc
);
16392 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_REDUCTION
16393 && OMP_CLAUSE_DECL (*pc
) == decl
)
16395 error ("iteration variable %qD should not be reduction",
16397 *pc
= OMP_CLAUSE_CHAIN (*pc
);
16400 pc
= &OMP_CLAUSE_CHAIN (*pc
);
16405 if (*pc
== NULL_TREE
)
16407 tree c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
16408 OMP_CLAUSE_DECL (c
) = decl
;
16409 c
= finish_omp_clauses (c
, C_ORT_OMP
);
16412 OMP_CLAUSE_CHAIN (c
) = *clauses
;
16417 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
16418 if (COMPARISON_CLASS_P (cond
))
16420 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
16421 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
16422 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
16425 cond
= RECUR (cond
);
16426 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
16427 switch (TREE_CODE (incr
))
16429 case PREINCREMENT_EXPR
:
16430 case PREDECREMENT_EXPR
:
16431 case POSTINCREMENT_EXPR
:
16432 case POSTDECREMENT_EXPR
:
16433 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
16434 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
16437 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
16438 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
16440 tree rhs
= TREE_OPERAND (incr
, 1);
16441 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
16442 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
16443 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
16444 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
16445 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
16449 incr
= RECUR (incr
);
16452 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
16453 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
16455 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
16456 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
16457 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
16458 TREE_TYPE (decl
), lhs
,
16459 RECUR (TREE_OPERAND (incr
, 2))));
16461 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
16462 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
16463 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
16465 tree rhs
= TREE_OPERAND (incr
, 2);
16466 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
16467 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
16468 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
16469 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
16470 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
16474 incr
= RECUR (incr
);
16477 incr
= RECUR (incr
);
16481 TREE_VEC_ELT (declv
, i
) = decl
;
16482 TREE_VEC_ELT (initv
, i
) = init
;
16483 TREE_VEC_ELT (condv
, i
) = cond
;
16484 TREE_VEC_ELT (incrv
, i
) = incr
;
16488 /* Helper function of tsubst_expr, find OMP_TEAMS inside
16489 of OMP_TARGET's body. */
16492 tsubst_find_omp_teams (tree
*tp
, int *walk_subtrees
, void *)
16494 *walk_subtrees
= 0;
16495 switch (TREE_CODE (*tp
))
16500 case STATEMENT_LIST
:
16501 *walk_subtrees
= 1;
16509 /* Helper function for tsubst_expr. For decomposition declaration
16510 artificial base DECL, which is tsubsted PATTERN_DECL, tsubst
16511 also the corresponding decls representing the identifiers
16512 of the decomposition declaration. Return DECL if successful
16513 or error_mark_node otherwise, set *FIRST to the first decl
16514 in the list chained through DECL_CHAIN and *CNT to the number
16518 tsubst_decomp_names (tree decl
, tree pattern_decl
, tree args
,
16519 tsubst_flags_t complain
, tree in_decl
, tree
*first
,
16522 tree decl2
, decl3
, prev
= decl
;
16524 gcc_assert (DECL_NAME (decl
) == NULL_TREE
);
16525 for (decl2
= DECL_CHAIN (pattern_decl
);
16528 && DECL_DECOMPOSITION_P (decl2
)
16529 && DECL_NAME (decl2
);
16530 decl2
= DECL_CHAIN (decl2
))
16532 if (TREE_TYPE (decl2
) == error_mark_node
&& *cnt
== 0)
16534 gcc_assert (errorcount
);
16535 return error_mark_node
;
16538 gcc_assert (DECL_DECOMP_BASE (decl2
) == pattern_decl
);
16539 gcc_assert (DECL_HAS_VALUE_EXPR_P (decl2
));
16540 tree v
= DECL_VALUE_EXPR (decl2
);
16541 DECL_HAS_VALUE_EXPR_P (decl2
) = 0;
16542 SET_DECL_VALUE_EXPR (decl2
, NULL_TREE
);
16543 decl3
= tsubst (decl2
, args
, complain
, in_decl
);
16544 SET_DECL_VALUE_EXPR (decl2
, v
);
16545 DECL_HAS_VALUE_EXPR_P (decl2
) = 1;
16547 DECL_TEMPLATE_INSTANTIATED (decl3
) = 1;
16550 gcc_assert (errorcount
);
16551 decl
= error_mark_node
;
16554 maybe_push_decl (decl3
);
16555 if (error_operand_p (decl3
))
16556 decl
= error_mark_node
;
16557 else if (decl
!= error_mark_node
16558 && DECL_CHAIN (decl3
) != prev
16561 gcc_assert (errorcount
);
16562 decl
= error_mark_node
;
16571 /* Like tsubst_copy for expressions, etc. but also does semantic
16575 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
16576 bool integral_constant_expression_p
)
16578 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
16579 #define RECUR(NODE) \
16580 tsubst_expr ((NODE), args, complain, in_decl, \
16581 integral_constant_expression_p)
16587 if (t
== NULL_TREE
|| t
== error_mark_node
)
16590 loc
= input_location
;
16591 if (EXPR_HAS_LOCATION (t
))
16592 input_location
= EXPR_LOCATION (t
);
16593 if (STATEMENT_CODE_P (TREE_CODE (t
)))
16594 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
16596 switch (TREE_CODE (t
))
16598 case STATEMENT_LIST
:
16600 tree_stmt_iterator i
;
16601 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
16602 RECUR (tsi_stmt (i
));
16606 case CTOR_INITIALIZER
:
16607 finish_mem_initializers (tsubst_initializer_list
16608 (TREE_OPERAND (t
, 0), args
));
16612 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
16616 tmp
= RECUR (EXPR_STMT_EXPR (t
));
16617 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
16618 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
16620 finish_expr_stmt (tmp
);
16624 finish_local_using_directive (USING_STMT_NAMESPACE (t
),
16625 /*attribs=*/NULL_TREE
);
16630 tree decl
, pattern_decl
;
16633 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
16634 if (TREE_CODE (decl
) == LABEL_DECL
)
16635 finish_label_decl (DECL_NAME (decl
));
16636 else if (TREE_CODE (decl
) == USING_DECL
)
16638 tree scope
= USING_DECL_SCOPE (decl
);
16639 tree name
= DECL_NAME (decl
);
16641 scope
= tsubst (scope
, args
, complain
, in_decl
);
16642 decl
= lookup_qualified_name (scope
, name
,
16643 /*is_type_p=*/false,
16644 /*complain=*/false);
16645 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
16646 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
16648 finish_local_using_decl (decl
, scope
, name
);
16650 else if (is_capture_proxy (decl
)
16651 && !DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
16653 /* We're in tsubst_lambda_expr, we've already inserted a new
16654 capture proxy, so look it up and register it. */
16656 if (DECL_PACK_P (decl
))
16658 inst
= (retrieve_local_specialization
16659 (DECL_CAPTURED_VARIABLE (decl
)));
16660 gcc_assert (TREE_CODE (inst
) == NONTYPE_ARGUMENT_PACK
);
16664 inst
= lookup_name_real (DECL_NAME (decl
), 0, 0,
16665 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
16666 gcc_assert (inst
!= decl
&& is_capture_proxy (inst
));
16668 register_local_specialization (inst
, decl
);
16671 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
16672 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
16673 /* Don't copy the old closure; we'll create a new one in
16674 tsubst_lambda_expr. */
16678 init
= DECL_INITIAL (decl
);
16679 decl
= tsubst (decl
, args
, complain
, in_decl
);
16680 if (decl
!= error_mark_node
)
16682 /* By marking the declaration as instantiated, we avoid
16683 trying to instantiate it. Since instantiate_decl can't
16684 handle local variables, and since we've already done
16685 all that needs to be done, that's the right thing to
16688 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
16690 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
16691 /* Anonymous aggregates are a special case. */
16692 finish_anon_union (decl
);
16693 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
16695 DECL_CONTEXT (decl
) = current_function_decl
;
16696 if (DECL_NAME (decl
) == this_identifier
)
16698 tree lam
= DECL_CONTEXT (current_function_decl
);
16699 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
16700 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
16702 insert_capture_proxy (decl
);
16704 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
16705 /* We already did a pushtag. */;
16706 else if (TREE_CODE (decl
) == FUNCTION_DECL
16707 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
16708 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
16710 DECL_CONTEXT (decl
) = NULL_TREE
;
16712 DECL_CONTEXT (decl
) = current_function_decl
;
16713 cp_check_omp_declare_reduction (decl
);
16717 int const_init
= false;
16718 maybe_push_decl (decl
);
16720 && DECL_PRETTY_FUNCTION_P (decl
))
16722 /* For __PRETTY_FUNCTION__ we have to adjust the
16724 const char *const name
16725 = cxx_printable_name (current_function_decl
, 2);
16726 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
16729 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
16732 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
16735 && DECL_DECOMPOSITION_P (decl
)
16736 && TREE_TYPE (pattern_decl
) != error_mark_node
)
16741 = tsubst_decomp_names (decl
, pattern_decl
, args
,
16742 complain
, in_decl
, &first
, &cnt
);
16743 if (ndecl
!= error_mark_node
)
16744 cp_maybe_mangle_decomp (ndecl
, first
, cnt
);
16745 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
16746 if (ndecl
!= error_mark_node
)
16747 cp_finish_decomp (ndecl
, first
, cnt
);
16750 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
16759 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
16760 RECUR (FOR_INIT_STMT (t
));
16761 finish_init_stmt (stmt
);
16762 tmp
= RECUR (FOR_COND (t
));
16763 finish_for_cond (tmp
, stmt
, false, 0);
16764 tmp
= RECUR (FOR_EXPR (t
));
16765 finish_for_expr (tmp
, stmt
);
16767 bool prev
= note_iteration_stmt_body_start ();
16768 RECUR (FOR_BODY (t
));
16769 note_iteration_stmt_body_end (prev
);
16771 finish_for_stmt (stmt
);
16774 case RANGE_FOR_STMT
:
16776 /* Construct another range_for, if this is not a final
16777 substitution (for inside inside a generic lambda of a
16778 template). Otherwise convert to a regular for. */
16780 stmt
= (processing_template_decl
16781 ? begin_range_for_stmt (NULL_TREE
, NULL_TREE
)
16782 : begin_for_stmt (NULL_TREE
, NULL_TREE
));
16783 decl
= RANGE_FOR_DECL (t
);
16784 decl
= tsubst (decl
, args
, complain
, in_decl
);
16785 maybe_push_decl (decl
);
16786 expr
= RECUR (RANGE_FOR_EXPR (t
));
16788 tree decomp_first
= NULL_TREE
;
16789 unsigned decomp_cnt
= 0;
16790 if (VAR_P (decl
) && DECL_DECOMPOSITION_P (decl
))
16791 decl
= tsubst_decomp_names (decl
, RANGE_FOR_DECL (t
), args
,
16793 &decomp_first
, &decomp_cnt
);
16795 if (processing_template_decl
)
16797 RANGE_FOR_IVDEP (stmt
) = RANGE_FOR_IVDEP (t
);
16798 RANGE_FOR_UNROLL (stmt
) = RANGE_FOR_UNROLL (t
);
16799 finish_range_for_decl (stmt
, decl
, expr
);
16803 unsigned short unroll
= (RANGE_FOR_UNROLL (t
)
16804 ? tree_to_uhwi (RANGE_FOR_UNROLL (t
)) : 0);
16805 stmt
= cp_convert_range_for (stmt
, decl
, expr
,
16806 decomp_first
, decomp_cnt
,
16807 RANGE_FOR_IVDEP (t
), unroll
);
16810 bool prev
= note_iteration_stmt_body_start ();
16811 RECUR (RANGE_FOR_BODY (t
));
16812 note_iteration_stmt_body_end (prev
);
16813 finish_for_stmt (stmt
);
16818 stmt
= begin_while_stmt ();
16819 tmp
= RECUR (WHILE_COND (t
));
16820 finish_while_stmt_cond (tmp
, stmt
, false, 0);
16822 bool prev
= note_iteration_stmt_body_start ();
16823 RECUR (WHILE_BODY (t
));
16824 note_iteration_stmt_body_end (prev
);
16826 finish_while_stmt (stmt
);
16830 stmt
= begin_do_stmt ();
16832 bool prev
= note_iteration_stmt_body_start ();
16833 RECUR (DO_BODY (t
));
16834 note_iteration_stmt_body_end (prev
);
16836 finish_do_body (stmt
);
16837 tmp
= RECUR (DO_COND (t
));
16838 finish_do_stmt (tmp
, stmt
, false, 0);
16842 stmt
= begin_if_stmt ();
16843 IF_STMT_CONSTEXPR_P (stmt
) = IF_STMT_CONSTEXPR_P (t
);
16844 if (IF_STMT_CONSTEXPR_P (t
))
16845 args
= add_extra_args (IF_STMT_EXTRA_ARGS (t
), args
);
16846 tmp
= RECUR (IF_COND (t
));
16847 tmp
= finish_if_stmt_cond (tmp
, stmt
);
16848 if (IF_STMT_CONSTEXPR_P (t
)
16849 && instantiation_dependent_expression_p (tmp
))
16851 /* We're partially instantiating a generic lambda, but the condition
16852 of the constexpr if is still dependent. Don't substitute into the
16853 branches now, just remember the template arguments. */
16854 do_poplevel (IF_SCOPE (stmt
));
16855 IF_COND (stmt
) = IF_COND (t
);
16856 THEN_CLAUSE (stmt
) = THEN_CLAUSE (t
);
16857 ELSE_CLAUSE (stmt
) = ELSE_CLAUSE (t
);
16858 IF_STMT_EXTRA_ARGS (stmt
) = build_extra_args (t
, args
, complain
);
16862 if (IF_STMT_CONSTEXPR_P (t
) && integer_zerop (tmp
))
16863 /* Don't instantiate the THEN_CLAUSE. */;
16866 bool inhibit
= integer_zerop (fold_non_dependent_expr (tmp
));
16868 ++c_inhibit_evaluation_warnings
;
16869 RECUR (THEN_CLAUSE (t
));
16871 --c_inhibit_evaluation_warnings
;
16873 finish_then_clause (stmt
);
16875 if (IF_STMT_CONSTEXPR_P (t
) && integer_nonzerop (tmp
))
16876 /* Don't instantiate the ELSE_CLAUSE. */;
16877 else if (ELSE_CLAUSE (t
))
16879 bool inhibit
= integer_nonzerop (fold_non_dependent_expr (tmp
));
16880 begin_else_clause (stmt
);
16882 ++c_inhibit_evaluation_warnings
;
16883 RECUR (ELSE_CLAUSE (t
));
16885 --c_inhibit_evaluation_warnings
;
16886 finish_else_clause (stmt
);
16889 finish_if_stmt (stmt
);
16893 if (BIND_EXPR_BODY_BLOCK (t
))
16894 stmt
= begin_function_body ();
16896 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
16897 ? BCS_TRY_BLOCK
: 0);
16899 RECUR (BIND_EXPR_BODY (t
));
16901 if (BIND_EXPR_BODY_BLOCK (t
))
16902 finish_function_body (stmt
);
16904 finish_compound_stmt (stmt
);
16908 finish_break_stmt ();
16911 case CONTINUE_STMT
:
16912 finish_continue_stmt ();
16916 stmt
= begin_switch_stmt ();
16917 tmp
= RECUR (SWITCH_STMT_COND (t
));
16918 finish_switch_cond (tmp
, stmt
);
16919 RECUR (SWITCH_STMT_BODY (t
));
16920 finish_switch_stmt (stmt
);
16923 case CASE_LABEL_EXPR
:
16925 tree low
= RECUR (CASE_LOW (t
));
16926 tree high
= RECUR (CASE_HIGH (t
));
16927 tree l
= finish_case_label (EXPR_LOCATION (t
), low
, high
);
16928 if (l
&& TREE_CODE (l
) == CASE_LABEL_EXPR
)
16929 FALLTHROUGH_LABEL_P (CASE_LABEL (l
))
16930 = FALLTHROUGH_LABEL_P (CASE_LABEL (t
));
16936 tree decl
= LABEL_EXPR_LABEL (t
);
16939 label
= finish_label_stmt (DECL_NAME (decl
));
16940 if (TREE_CODE (label
) == LABEL_DECL
)
16941 FALLTHROUGH_LABEL_P (label
) = FALLTHROUGH_LABEL_P (decl
);
16942 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
16943 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
16948 tmp
= GOTO_DESTINATION (t
);
16949 if (TREE_CODE (tmp
) != LABEL_DECL
)
16950 /* Computed goto's must be tsubst'd into. On the other hand,
16951 non-computed gotos must not be; the identifier in question
16952 will have no binding. */
16955 tmp
= DECL_NAME (tmp
);
16956 finish_goto_stmt (tmp
);
16961 tree string
= RECUR (ASM_STRING (t
));
16962 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
16963 complain
, in_decl
);
16964 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
16965 complain
, in_decl
);
16966 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
16967 complain
, in_decl
);
16968 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
16969 complain
, in_decl
);
16970 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
16972 tree asm_expr
= tmp
;
16973 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
16974 asm_expr
= TREE_OPERAND (asm_expr
, 0);
16975 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
16982 stmt
= begin_try_block ();
16983 RECUR (TRY_STMTS (t
));
16984 finish_cleanup_try_block (stmt
);
16985 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
16989 tree compound_stmt
= NULL_TREE
;
16991 if (FN_TRY_BLOCK_P (t
))
16992 stmt
= begin_function_try_block (&compound_stmt
);
16994 stmt
= begin_try_block ();
16996 RECUR (TRY_STMTS (t
));
16998 if (FN_TRY_BLOCK_P (t
))
16999 finish_function_try_block (stmt
);
17001 finish_try_block (stmt
);
17003 RECUR (TRY_HANDLERS (t
));
17004 if (FN_TRY_BLOCK_P (t
))
17005 finish_function_handler_sequence (stmt
, compound_stmt
);
17007 finish_handler_sequence (stmt
);
17013 tree decl
= HANDLER_PARMS (t
);
17017 decl
= tsubst (decl
, args
, complain
, in_decl
);
17018 /* Prevent instantiate_decl from trying to instantiate
17019 this variable. We've already done all that needs to be
17021 if (decl
!= error_mark_node
)
17022 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
17024 stmt
= begin_handler ();
17025 finish_handler_parms (decl
, stmt
);
17026 RECUR (HANDLER_BODY (t
));
17027 finish_handler (stmt
);
17032 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
17033 if (CLASS_TYPE_P (tmp
))
17035 /* Local classes are not independent templates; they are
17036 instantiated along with their containing function. And this
17037 way we don't have to deal with pushing out of one local class
17038 to instantiate a member of another local class. */
17039 /* Closures are handled by the LAMBDA_EXPR. */
17040 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
17041 complete_type (tmp
);
17042 for (tree fld
= TYPE_FIELDS (tmp
); fld
; fld
= DECL_CHAIN (fld
))
17044 || (TREE_CODE (fld
) == FUNCTION_DECL
17045 && !DECL_ARTIFICIAL (fld
)))
17046 && DECL_TEMPLATE_INSTANTIATION (fld
))
17047 instantiate_decl (fld
, /*defer_ok=*/false,
17048 /*expl_inst_class=*/false);
17052 case STATIC_ASSERT
:
17056 ++c_inhibit_evaluation_warnings
;
17058 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
17061 /*integral_constant_expression_p=*/true);
17062 --c_inhibit_evaluation_warnings
;
17064 finish_static_assert (condition
,
17065 STATIC_ASSERT_MESSAGE (t
),
17066 STATIC_ASSERT_SOURCE_LOCATION (t
),
17067 /*member_p=*/false);
17072 case OACC_PARALLEL
:
17073 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), C_ORT_ACC
, args
, complain
,
17075 stmt
= begin_omp_parallel ();
17076 RECUR (OMP_BODY (t
));
17077 finish_omp_construct (TREE_CODE (t
), stmt
, tmp
);
17081 r
= push_omp_privatization_clauses (OMP_PARALLEL_COMBINED (t
));
17082 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), C_ORT_OMP
, args
,
17083 complain
, in_decl
);
17084 if (OMP_PARALLEL_COMBINED (t
))
17085 omp_parallel_combined_clauses
= &tmp
;
17086 stmt
= begin_omp_parallel ();
17087 RECUR (OMP_PARALLEL_BODY (t
));
17088 gcc_assert (omp_parallel_combined_clauses
== NULL
);
17089 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
17090 = OMP_PARALLEL_COMBINED (t
);
17091 pop_omp_privatization_clauses (r
);
17095 r
= push_omp_privatization_clauses (false);
17096 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), C_ORT_OMP
, args
,
17097 complain
, in_decl
);
17098 stmt
= begin_omp_task ();
17099 RECUR (OMP_TASK_BODY (t
));
17100 finish_omp_task (tmp
, stmt
);
17101 pop_omp_privatization_clauses (r
);
17106 case OMP_DISTRIBUTE
:
17110 tree clauses
, body
, pre_body
;
17111 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
17112 tree orig_declv
= NULL_TREE
;
17113 tree incrv
= NULL_TREE
;
17114 enum c_omp_region_type ort
= C_ORT_OMP
;
17117 if (TREE_CODE (t
) == OACC_LOOP
)
17120 r
= push_omp_privatization_clauses (OMP_FOR_INIT (t
) == NULL_TREE
);
17121 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), ort
, args
, complain
,
17123 if (OMP_FOR_INIT (t
) != NULL_TREE
)
17125 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
17126 if (OMP_FOR_ORIG_DECLS (t
))
17127 orig_declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
17128 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
17129 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
17130 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
17133 stmt
= begin_omp_structured_block ();
17135 pre_body
= push_stmt_list ();
17136 RECUR (OMP_FOR_PRE_BODY (t
));
17137 pre_body
= pop_stmt_list (pre_body
);
17139 if (OMP_FOR_INIT (t
) != NULL_TREE
)
17140 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
17141 tsubst_omp_for_iterator (t
, i
, declv
, orig_declv
, initv
, condv
,
17142 incrv
, &clauses
, args
, complain
, in_decl
,
17143 integral_constant_expression_p
);
17144 omp_parallel_combined_clauses
= NULL
;
17146 body
= push_stmt_list ();
17147 RECUR (OMP_FOR_BODY (t
));
17148 body
= pop_stmt_list (body
);
17150 if (OMP_FOR_INIT (t
) != NULL_TREE
)
17151 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
,
17152 orig_declv
, initv
, condv
, incrv
, body
, pre_body
,
17156 t
= make_node (TREE_CODE (t
));
17157 TREE_TYPE (t
) = void_type_node
;
17158 OMP_FOR_BODY (t
) = body
;
17159 OMP_FOR_PRE_BODY (t
) = pre_body
;
17160 OMP_FOR_CLAUSES (t
) = clauses
;
17161 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
17165 add_stmt (finish_omp_structured_block (stmt
));
17166 pop_omp_privatization_clauses (r
);
17171 omp_parallel_combined_clauses
= NULL
;
17176 r
= push_omp_privatization_clauses (TREE_CODE (t
) == OMP_TEAMS
17177 && OMP_TEAMS_COMBINED (t
));
17178 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), C_ORT_OMP
, args
, complain
,
17180 stmt
= push_stmt_list ();
17181 RECUR (OMP_BODY (t
));
17182 stmt
= pop_stmt_list (stmt
);
17185 OMP_BODY (t
) = stmt
;
17186 OMP_CLAUSES (t
) = tmp
;
17188 pop_omp_privatization_clauses (r
);
17192 case OMP_TARGET_DATA
:
17194 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), (TREE_CODE (t
) == OACC_DATA
)
17195 ? C_ORT_ACC
: C_ORT_OMP
, args
, complain
,
17197 keep_next_level (true);
17198 stmt
= begin_omp_structured_block ();
17200 RECUR (OMP_BODY (t
));
17201 stmt
= finish_omp_structured_block (stmt
);
17204 OMP_BODY (t
) = stmt
;
17205 OMP_CLAUSES (t
) = tmp
;
17206 if (TREE_CODE (t
) == OMP_TARGET
&& OMP_TARGET_COMBINED (t
))
17208 tree teams
= cp_walk_tree (&stmt
, tsubst_find_omp_teams
, NULL
, NULL
);
17211 /* For combined target teams, ensure the num_teams and
17212 thread_limit clause expressions are evaluated on the host,
17213 before entering the target construct. */
17215 for (c
= OMP_TEAMS_CLAUSES (teams
);
17216 c
; c
= OMP_CLAUSE_CHAIN (c
))
17217 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_NUM_TEAMS
17218 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_THREAD_LIMIT
)
17219 && TREE_CODE (OMP_CLAUSE_OPERAND (c
, 0)) != INTEGER_CST
)
17221 tree expr
= OMP_CLAUSE_OPERAND (c
, 0);
17222 expr
= force_target_expr (TREE_TYPE (expr
), expr
, tf_none
);
17223 if (expr
== error_mark_node
)
17225 tmp
= TARGET_EXPR_SLOT (expr
);
17227 OMP_CLAUSE_OPERAND (c
, 0) = expr
;
17228 tree tc
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
17229 OMP_CLAUSE_FIRSTPRIVATE
);
17230 OMP_CLAUSE_DECL (tc
) = tmp
;
17231 OMP_CLAUSE_CHAIN (tc
) = OMP_TARGET_CLAUSES (t
);
17232 OMP_TARGET_CLAUSES (t
) = tc
;
17241 tmp
= tsubst_omp_clauses (OACC_DECLARE_CLAUSES (t
), C_ORT_ACC
, args
,
17242 complain
, in_decl
);
17243 OACC_DECLARE_CLAUSES (t
) = tmp
;
17247 case OMP_TARGET_UPDATE
:
17248 case OMP_TARGET_ENTER_DATA
:
17249 case OMP_TARGET_EXIT_DATA
:
17250 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), C_ORT_OMP
, args
,
17251 complain
, in_decl
);
17253 OMP_STANDALONE_CLAUSES (t
) = tmp
;
17257 case OACC_ENTER_DATA
:
17258 case OACC_EXIT_DATA
:
17260 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), C_ORT_ACC
, args
,
17261 complain
, in_decl
);
17263 OMP_STANDALONE_CLAUSES (t
) = tmp
;
17268 tmp
= tsubst_omp_clauses (OMP_ORDERED_CLAUSES (t
), C_ORT_OMP
, args
,
17269 complain
, in_decl
);
17270 stmt
= push_stmt_list ();
17271 RECUR (OMP_BODY (t
));
17272 stmt
= pop_stmt_list (stmt
);
17275 OMP_BODY (t
) = stmt
;
17276 OMP_ORDERED_CLAUSES (t
) = tmp
;
17282 case OMP_TASKGROUP
:
17283 stmt
= push_stmt_list ();
17284 RECUR (OMP_BODY (t
));
17285 stmt
= pop_stmt_list (stmt
);
17288 OMP_BODY (t
) = stmt
;
17293 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
17294 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
17296 tree op1
= TREE_OPERAND (t
, 1);
17297 tree rhs1
= NULL_TREE
;
17299 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
17301 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
17302 op1
= TREE_OPERAND (op1
, 1);
17304 lhs
= RECUR (TREE_OPERAND (op1
, 0));
17305 rhs
= RECUR (TREE_OPERAND (op1
, 1));
17306 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
17307 NULL_TREE
, NULL_TREE
, rhs1
,
17308 OMP_ATOMIC_SEQ_CST (t
));
17312 tree op1
= TREE_OPERAND (t
, 1);
17313 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
17314 tree rhs1
= NULL_TREE
;
17315 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
17316 enum tree_code opcode
= NOP_EXPR
;
17317 if (code
== OMP_ATOMIC_READ
)
17319 v
= RECUR (TREE_OPERAND (op1
, 0));
17320 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
17322 else if (code
== OMP_ATOMIC_CAPTURE_OLD
17323 || code
== OMP_ATOMIC_CAPTURE_NEW
)
17325 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
17326 v
= RECUR (TREE_OPERAND (op1
, 0));
17327 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
17328 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
17330 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
17331 op11
= TREE_OPERAND (op11
, 1);
17333 lhs
= RECUR (TREE_OPERAND (op11
, 0));
17334 rhs
= RECUR (TREE_OPERAND (op11
, 1));
17335 opcode
= TREE_CODE (op11
);
17336 if (opcode
== MODIFY_EXPR
)
17342 lhs
= RECUR (TREE_OPERAND (op1
, 0));
17343 rhs
= RECUR (TREE_OPERAND (op1
, 1));
17345 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
17346 OMP_ATOMIC_SEQ_CST (t
));
17350 case TRANSACTION_EXPR
:
17353 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
17354 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
17356 if (TRANSACTION_EXPR_IS_STMT (t
))
17358 tree body
= TRANSACTION_EXPR_BODY (t
);
17359 tree noex
= NULL_TREE
;
17360 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
17362 noex
= MUST_NOT_THROW_COND (body
);
17363 if (noex
== NULL_TREE
)
17364 noex
= boolean_true_node
;
17365 body
= TREE_OPERAND (body
, 0);
17367 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
17369 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
17373 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
17374 RECUR (TRANSACTION_EXPR_BODY (t
)),
17381 case MUST_NOT_THROW_EXPR
:
17383 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17384 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
17385 RETURN (build_must_not_throw_expr (op0
, cond
));
17388 case EXPR_PACK_EXPANSION
:
17389 error ("invalid use of pack expansion expression");
17390 RETURN (error_mark_node
);
17392 case NONTYPE_ARGUMENT_PACK
:
17393 error ("use %<...%> to expand argument pack");
17394 RETURN (error_mark_node
);
17396 case COMPOUND_EXPR
:
17397 tmp
= RECUR (TREE_OPERAND (t
, 0));
17398 if (tmp
== NULL_TREE
)
17399 /* If the first operand was a statement, we're done with it. */
17400 RETURN (RECUR (TREE_OPERAND (t
, 1)));
17401 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
17402 RECUR (TREE_OPERAND (t
, 1)),
17405 case ANNOTATE_EXPR
:
17406 tmp
= RECUR (TREE_OPERAND (t
, 0));
17407 RETURN (build3_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
17408 TREE_TYPE (tmp
), tmp
,
17409 RECUR (TREE_OPERAND (t
, 1)),
17410 RECUR (TREE_OPERAND (t
, 2))));
17413 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
17415 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
17416 /*function_p=*/false,
17417 integral_constant_expression_p
));
17420 RETURN (NULL_TREE
);
17422 input_location
= loc
;
17428 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
17429 function. For description of the body see comment above
17430 cp_parser_omp_declare_reduction_exprs. */
17433 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
17435 if (t
== NULL_TREE
|| t
== error_mark_node
)
17438 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
17440 tree_stmt_iterator tsi
;
17443 memset (stmts
, 0, sizeof stmts
);
17444 for (i
= 0, tsi
= tsi_start (t
);
17445 i
< 7 && !tsi_end_p (tsi
);
17446 i
++, tsi_next (&tsi
))
17447 stmts
[i
] = tsi_stmt (tsi
);
17448 gcc_assert (tsi_end_p (tsi
));
17452 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
17453 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
17454 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
17455 args
, complain
, in_decl
);
17456 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
17457 args
, complain
, in_decl
);
17458 DECL_CONTEXT (omp_out
) = current_function_decl
;
17459 DECL_CONTEXT (omp_in
) = current_function_decl
;
17460 keep_next_level (true);
17461 tree block
= begin_omp_structured_block ();
17462 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
17463 block
= finish_omp_structured_block (block
);
17464 block
= maybe_cleanup_point_expr_void (block
);
17465 add_decl_expr (omp_out
);
17466 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
17467 TREE_NO_WARNING (omp_out
) = 1;
17468 add_decl_expr (omp_in
);
17469 finish_expr_stmt (block
);
17473 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
17474 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
17475 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
17476 args
, complain
, in_decl
);
17477 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
17478 args
, complain
, in_decl
);
17479 DECL_CONTEXT (omp_priv
) = current_function_decl
;
17480 DECL_CONTEXT (omp_orig
) = current_function_decl
;
17481 keep_next_level (true);
17482 tree block
= begin_omp_structured_block ();
17483 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
17484 block
= finish_omp_structured_block (block
);
17485 block
= maybe_cleanup_point_expr_void (block
);
17486 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
17487 add_decl_expr (omp_priv
);
17488 add_decl_expr (omp_orig
);
17489 finish_expr_stmt (block
);
17491 add_decl_expr (omp_orig
);
17495 /* T is a postfix-expression that is not being used in a function
17496 call. Return the substituted version of T. */
17499 tsubst_non_call_postfix_expression (tree t
, tree args
,
17500 tsubst_flags_t complain
,
17503 if (TREE_CODE (t
) == SCOPE_REF
)
17504 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
17505 /*done=*/false, /*address_p=*/false);
17507 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
17508 /*function_p=*/false,
17509 /*integral_constant_expression_p=*/false);
17514 /* T is a LAMBDA_EXPR. Generate a new LAMBDA_EXPR for the current
17515 instantiation context. Instantiating a pack expansion containing a lambda
17516 might result in multiple lambdas all based on the same lambda in the
17520 tsubst_lambda_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
17522 tree oldfn
= lambda_function (t
);
17525 tree r
= build_lambda_expr ();
17527 LAMBDA_EXPR_LOCATION (r
)
17528 = LAMBDA_EXPR_LOCATION (t
);
17529 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
17530 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
17531 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
17533 if (LAMBDA_EXPR_EXTRA_SCOPE (t
) == NULL_TREE
)
17534 LAMBDA_EXPR_EXTRA_SCOPE (r
) = NULL_TREE
;
17536 record_lambda_scope (r
);
17538 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
17539 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
17541 for (tree cap
= LAMBDA_EXPR_CAPTURE_LIST (t
); cap
;
17542 cap
= TREE_CHAIN (cap
))
17544 tree field
= TREE_PURPOSE (cap
);
17545 if (PACK_EXPANSION_P (field
))
17546 field
= PACK_EXPANSION_PATTERN (field
);
17547 field
= tsubst_decl (field
, args
, complain
);
17549 if (field
== error_mark_node
)
17550 return error_mark_node
;
17552 tree init
= TREE_VALUE (cap
);
17553 if (PACK_EXPANSION_P (init
))
17554 init
= tsubst_pack_expansion (init
, args
, complain
, in_decl
);
17556 init
= tsubst_copy_and_build (init
, args
, complain
, in_decl
,
17557 /*fn*/false, /*constexpr*/false);
17559 if (TREE_CODE (field
) == TREE_VEC
)
17561 int len
= TREE_VEC_LENGTH (field
);
17562 gcc_assert (TREE_CODE (init
) == TREE_VEC
17563 && TREE_VEC_LENGTH (init
) == len
);
17564 for (int i
= 0; i
< len
; ++i
)
17565 LAMBDA_EXPR_CAPTURE_LIST (r
)
17566 = tree_cons (TREE_VEC_ELT (field
, i
),
17567 TREE_VEC_ELT (init
, i
),
17568 LAMBDA_EXPR_CAPTURE_LIST (r
));
17572 LAMBDA_EXPR_CAPTURE_LIST (r
)
17573 = tree_cons (field
, init
, LAMBDA_EXPR_CAPTURE_LIST (r
));
17575 if (id_equal (DECL_NAME (field
), "__this"))
17576 LAMBDA_EXPR_THIS_CAPTURE (r
) = field
;
17580 tree type
= begin_lambda_type (r
);
17581 if (type
== error_mark_node
)
17582 return error_mark_node
;
17584 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
17585 determine_visibility (TYPE_NAME (type
));
17587 register_capture_members (LAMBDA_EXPR_CAPTURE_LIST (r
));
17589 tree oldtmpl
= (generic_lambda_fn_p (oldfn
)
17590 ? DECL_TI_TEMPLATE (oldfn
)
17593 tree fntype
= static_fn_type (oldfn
);
17595 ++processing_template_decl
;
17596 fntype
= tsubst (fntype
, args
, complain
, in_decl
);
17598 --processing_template_decl
;
17600 if (fntype
== error_mark_node
)
17601 r
= error_mark_node
;
17604 /* Fix the type of 'this'. */
17605 fntype
= build_memfn_type (fntype
, type
,
17606 type_memfn_quals (fntype
),
17607 type_memfn_rqual (fntype
));
17611 tmpl
= tsubst_template_decl (oldtmpl
, args
, complain
, fntype
);
17612 fn
= DECL_TEMPLATE_RESULT (tmpl
);
17613 finish_member_declaration (tmpl
);
17618 fn
= tsubst_function_decl (oldfn
, args
, complain
, fntype
);
17619 finish_member_declaration (fn
);
17622 /* Let finish_function set this. */
17623 DECL_DECLARED_CONSTEXPR_P (fn
) = false;
17625 bool nested
= cfun
;
17627 push_function_context ();
17629 /* Still increment function_depth so that we don't GC in the
17630 middle of an expression. */
17633 local_specialization_stack
s (lss_copy
);
17635 tree body
= start_lambda_function (fn
, r
);
17637 register_parameter_specializations (oldfn
, fn
);
17639 tsubst_expr (DECL_SAVED_TREE (oldfn
), args
, complain
, r
,
17640 /*constexpr*/false);
17642 finish_lambda_function (body
);
17645 pop_function_context ();
17649 /* The capture list was built up in reverse order; fix that now. */
17650 LAMBDA_EXPR_CAPTURE_LIST (r
)
17651 = nreverse (LAMBDA_EXPR_CAPTURE_LIST (r
));
17653 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
17655 maybe_add_lambda_conv_op (type
);
17658 finish_struct (type
, /*attr*/NULL_TREE
);
17660 insert_pending_capture_proxies ();
17665 /* Like tsubst but deals with expressions and performs semantic
17666 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
17669 tsubst_copy_and_build (tree t
,
17671 tsubst_flags_t complain
,
17674 bool integral_constant_expression_p
)
17676 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
17677 #define RECUR(NODE) \
17678 tsubst_copy_and_build (NODE, args, complain, in_decl, \
17679 /*function_p=*/false, \
17680 integral_constant_expression_p)
17685 if (t
== NULL_TREE
|| t
== error_mark_node
)
17688 loc
= input_location
;
17689 if (EXPR_HAS_LOCATION (t
))
17690 input_location
= EXPR_LOCATION (t
);
17692 /* N3276 decltype magic only applies to calls at the top level or on the
17693 right side of a comma. */
17694 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
17695 complain
&= ~tf_decltype
;
17697 switch (TREE_CODE (t
))
17701 /* Fall through. */
17702 case IDENTIFIER_NODE
:
17706 bool non_integral_constant_expression_p
;
17707 const char *error_msg
;
17709 if (IDENTIFIER_CONV_OP_P (t
))
17711 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17712 t
= make_conv_op_name (new_type
);
17715 /* Look up the name. */
17716 decl
= lookup_name (t
);
17718 /* By convention, expressions use ERROR_MARK_NODE to indicate
17719 failure, not NULL_TREE. */
17720 if (decl
== NULL_TREE
)
17721 decl
= error_mark_node
;
17723 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
17725 integral_constant_expression_p
,
17726 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
17727 &non_integral_constant_expression_p
,
17728 /*template_p=*/false,
17730 /*address_p=*/false,
17731 /*template_arg_p=*/false,
17736 if (!function_p
&& identifier_p (decl
))
17738 if (complain
& tf_error
)
17739 unqualified_name_lookup_error (decl
);
17740 decl
= error_mark_node
;
17745 case TEMPLATE_ID_EXPR
:
17748 tree templ
= RECUR (TREE_OPERAND (t
, 0));
17749 tree targs
= TREE_OPERAND (t
, 1);
17752 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
17753 if (targs
== error_mark_node
)
17754 RETURN (error_mark_node
);
17756 if (TREE_CODE (templ
) == SCOPE_REF
)
17758 tree name
= TREE_OPERAND (templ
, 1);
17759 tree tid
= lookup_template_function (name
, targs
);
17760 TREE_OPERAND (templ
, 1) = tid
;
17764 if (variable_template_p (templ
))
17765 RETURN (lookup_and_finish_template_variable (templ
, targs
, complain
));
17767 if (TREE_CODE (templ
) == COMPONENT_REF
)
17769 object
= TREE_OPERAND (templ
, 0);
17770 templ
= TREE_OPERAND (templ
, 1);
17773 object
= NULL_TREE
;
17774 templ
= lookup_template_function (templ
, targs
);
17777 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
17778 object
, templ
, NULL_TREE
));
17780 RETURN (baselink_for_fns (templ
));
17785 tree r
= RECUR (TREE_OPERAND (t
, 0));
17787 if (REFERENCE_REF_P (t
))
17789 /* A type conversion to reference type will be enclosed in
17790 such an indirect ref, but the substitution of the cast
17791 will have also added such an indirect ref. */
17792 r
= convert_from_reference (r
);
17795 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
17796 complain
|decltype_flag
);
17798 if (REF_PARENTHESIZED_P (t
))
17799 r
= force_paren_expr (r
);
17806 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17807 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17808 RETURN (build_nop (type
, op0
));
17811 case IMPLICIT_CONV_EXPR
:
17813 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17814 tree expr
= RECUR (TREE_OPERAND (t
, 0));
17815 if (dependent_type_p (type
) || type_dependent_expression_p (expr
))
17817 retval
= copy_node (t
);
17818 TREE_TYPE (retval
) = type
;
17819 TREE_OPERAND (retval
, 0) = expr
;
17822 if (IMPLICIT_CONV_EXPR_NONTYPE_ARG (t
))
17823 /* We'll pass this to convert_nontype_argument again, we don't need
17824 to actually perform any conversion here. */
17826 int flags
= LOOKUP_IMPLICIT
;
17827 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
17828 flags
= LOOKUP_NORMAL
;
17829 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
17835 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17836 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17837 if (op0
== error_mark_node
)
17838 RETURN (error_mark_node
);
17839 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
17843 case REINTERPRET_CAST_EXPR
:
17844 case CONST_CAST_EXPR
:
17845 case DYNAMIC_CAST_EXPR
:
17846 case STATIC_CAST_EXPR
:
17849 tree op
, r
= NULL_TREE
;
17851 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17852 if (integral_constant_expression_p
17853 && !cast_valid_in_integral_constant_expression_p (type
))
17855 if (complain
& tf_error
)
17856 error ("a cast to a type other than an integral or "
17857 "enumeration type cannot appear in a constant-expression");
17858 RETURN (error_mark_node
);
17861 op
= RECUR (TREE_OPERAND (t
, 0));
17863 warning_sentinel
s(warn_useless_cast
);
17864 warning_sentinel
s2(warn_ignored_qualifiers
);
17865 switch (TREE_CODE (t
))
17868 r
= build_functional_cast (type
, op
, complain
);
17870 case REINTERPRET_CAST_EXPR
:
17871 r
= build_reinterpret_cast (type
, op
, complain
);
17873 case CONST_CAST_EXPR
:
17874 r
= build_const_cast (type
, op
, complain
);
17876 case DYNAMIC_CAST_EXPR
:
17877 r
= build_dynamic_cast (type
, op
, complain
);
17879 case STATIC_CAST_EXPR
:
17880 r
= build_static_cast (type
, op
, complain
);
17883 gcc_unreachable ();
17889 case POSTDECREMENT_EXPR
:
17890 case POSTINCREMENT_EXPR
:
17891 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
17892 args
, complain
, in_decl
);
17893 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
17894 complain
|decltype_flag
));
17896 case PREDECREMENT_EXPR
:
17897 case PREINCREMENT_EXPR
:
17901 case TRUTH_NOT_EXPR
:
17902 case UNARY_PLUS_EXPR
: /* Unary + */
17903 case REALPART_EXPR
:
17904 case IMAGPART_EXPR
:
17905 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
17906 RECUR (TREE_OPERAND (t
, 0)),
17907 complain
|decltype_flag
));
17909 case FIX_TRUNC_EXPR
:
17910 gcc_unreachable ();
17913 op1
= TREE_OPERAND (t
, 0);
17914 if (TREE_CODE (op1
) == LABEL_DECL
)
17915 RETURN (finish_label_address_expr (DECL_NAME (op1
),
17916 EXPR_LOCATION (op1
)));
17917 if (TREE_CODE (op1
) == SCOPE_REF
)
17918 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
17919 /*done=*/true, /*address_p=*/true);
17921 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
17923 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
17924 complain
|decltype_flag
));
17929 case TRUNC_DIV_EXPR
:
17930 case CEIL_DIV_EXPR
:
17931 case FLOOR_DIV_EXPR
:
17932 case ROUND_DIV_EXPR
:
17933 case EXACT_DIV_EXPR
:
17937 case TRUNC_MOD_EXPR
:
17938 case FLOOR_MOD_EXPR
:
17939 case TRUTH_ANDIF_EXPR
:
17940 case TRUTH_ORIF_EXPR
:
17941 case TRUTH_AND_EXPR
:
17942 case TRUTH_OR_EXPR
:
17958 warning_sentinel
s1(warn_type_limits
);
17959 warning_sentinel
s2(warn_div_by_zero
);
17960 warning_sentinel
s3(warn_logical_op
);
17961 warning_sentinel
s4(warn_tautological_compare
);
17962 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17963 tree op1
= RECUR (TREE_OPERAND (t
, 1));
17964 tree r
= build_x_binary_op
17965 (input_location
, TREE_CODE (t
),
17967 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
17969 : TREE_CODE (TREE_OPERAND (t
, 0))),
17971 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
17973 : TREE_CODE (TREE_OPERAND (t
, 1))),
17975 complain
|decltype_flag
);
17976 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
17977 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
17982 case POINTER_PLUS_EXPR
:
17984 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17985 tree op1
= RECUR (TREE_OPERAND (t
, 1));
17986 RETURN (fold_build_pointer_plus (op0
, op1
));
17990 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
17991 /*address_p=*/false));
17993 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
17994 args
, complain
, in_decl
);
17995 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
17996 RECUR (TREE_OPERAND (t
, 1)),
17997 complain
|decltype_flag
));
18000 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0))
18001 || ARGUMENT_PACK_P (TREE_OPERAND (t
, 0)))
18002 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
18009 op1
= TREE_OPERAND (t
, 0);
18010 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
18011 op1
= TREE_TYPE (op1
);
18012 bool std_alignof
= (TREE_CODE (t
) == ALIGNOF_EXPR
18013 && ALIGNOF_EXPR_STD_P (t
));
18016 /* When there are no ARGS, we are trying to evaluate a
18017 non-dependent expression from the parser. Trying to do
18018 the substitutions may not work. */
18020 op1
= TREE_TYPE (op1
);
18024 ++cp_unevaluated_operand
;
18025 ++c_inhibit_evaluation_warnings
;
18027 op1
= tsubst (op1
, args
, complain
, in_decl
);
18029 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
18030 /*function_p=*/false,
18031 /*integral_constant_expression_p=*/
18033 --cp_unevaluated_operand
;
18034 --c_inhibit_evaluation_warnings
;
18037 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
), std_alignof
,
18038 complain
& tf_error
);
18040 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
18041 complain
& tf_error
);
18042 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
18044 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
18046 if (!processing_template_decl
&& TYPE_P (op1
))
18048 r
= build_min (SIZEOF_EXPR
, size_type_node
,
18049 build1 (NOP_EXPR
, op1
, error_mark_node
));
18050 SIZEOF_EXPR_TYPE_P (r
) = 1;
18053 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
18054 TREE_SIDE_EFFECTS (r
) = 0;
18055 TREE_READONLY (r
) = 1;
18057 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
18062 case AT_ENCODE_EXPR
:
18064 op1
= TREE_OPERAND (t
, 0);
18065 ++cp_unevaluated_operand
;
18066 ++c_inhibit_evaluation_warnings
;
18067 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
18068 /*function_p=*/false,
18069 /*integral_constant_expression_p=*/false);
18070 --cp_unevaluated_operand
;
18071 --c_inhibit_evaluation_warnings
;
18072 RETURN (objc_build_encode_expr (op1
));
18075 case NOEXCEPT_EXPR
:
18076 op1
= TREE_OPERAND (t
, 0);
18077 ++cp_unevaluated_operand
;
18078 ++c_inhibit_evaluation_warnings
;
18079 ++cp_noexcept_operand
;
18080 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
18081 /*function_p=*/false,
18082 /*integral_constant_expression_p=*/false);
18083 --cp_unevaluated_operand
;
18084 --c_inhibit_evaluation_warnings
;
18085 --cp_noexcept_operand
;
18086 RETURN (finish_noexcept_expr (op1
, complain
));
18090 warning_sentinel
s(warn_div_by_zero
);
18091 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
18092 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
18093 tree r
= build_x_modify_expr
18094 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
18095 complain
|decltype_flag
);
18096 /* TREE_NO_WARNING must be set if either the expression was
18097 parenthesized or it uses an operator such as >>= rather
18098 than plain assignment. In the former case, it was already
18099 set and must be copied. In the latter case,
18100 build_x_modify_expr sets it and it must not be reset
18102 if (TREE_NO_WARNING (t
))
18103 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
18109 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
18110 args
, complain
, in_decl
);
18111 /* Remember that there was a reference to this entity. */
18113 && !mark_used (op1
, complain
) && !(complain
& tf_error
))
18114 RETURN (error_mark_node
);
18115 RETURN (build_x_arrow (input_location
, op1
, complain
));
18119 tree placement
= RECUR (TREE_OPERAND (t
, 0));
18120 tree init
= RECUR (TREE_OPERAND (t
, 3));
18121 vec
<tree
, va_gc
> *placement_vec
;
18122 vec
<tree
, va_gc
> *init_vec
;
18125 if (placement
== NULL_TREE
)
18126 placement_vec
= NULL
;
18129 placement_vec
= make_tree_vector ();
18130 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
18131 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
18134 /* If there was an initializer in the original tree, but it
18135 instantiated to an empty list, then we should pass a
18136 non-NULL empty vector to tell build_new that it was an
18137 empty initializer() rather than no initializer. This can
18138 only happen when the initializer is a pack expansion whose
18139 parameter packs are of length zero. */
18140 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
18144 init_vec
= make_tree_vector ();
18145 if (init
== void_node
)
18146 gcc_assert (init_vec
!= NULL
);
18149 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
18150 vec_safe_push (init_vec
, TREE_VALUE (init
));
18154 /* Avoid passing an enclosing decl to valid_array_size_p. */
18155 in_decl
= NULL_TREE
;
18157 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
18158 tree op2
= RECUR (TREE_OPERAND (t
, 2));
18159 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
18160 NEW_EXPR_USE_GLOBAL (t
),
18163 if (placement_vec
!= NULL
)
18164 release_tree_vector (placement_vec
);
18165 if (init_vec
!= NULL
)
18166 release_tree_vector (init_vec
);
18173 tree op0
= RECUR (TREE_OPERAND (t
, 0));
18174 tree op1
= RECUR (TREE_OPERAND (t
, 1));
18175 RETURN (delete_sanity (op0
, op1
,
18176 DELETE_EXPR_USE_VEC (t
),
18177 DELETE_EXPR_USE_GLOBAL (t
),
18181 case COMPOUND_EXPR
:
18183 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
18184 complain
& ~tf_decltype
, in_decl
,
18185 /*function_p=*/false,
18186 integral_constant_expression_p
);
18187 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
18189 RECUR (TREE_OPERAND (t
, 1)),
18190 complain
|decltype_flag
));
18196 vec
<tree
, va_gc
> *call_args
;
18197 unsigned int nargs
, i
;
18202 function
= CALL_EXPR_FN (t
);
18203 /* Internal function with no arguments. */
18204 if (function
== NULL_TREE
&& call_expr_nargs (t
) == 0)
18207 /* When we parsed the expression, we determined whether or
18208 not Koenig lookup should be performed. */
18209 koenig_p
= KOENIG_LOOKUP_P (t
);
18210 if (function
== NULL_TREE
)
18213 qualified_p
= false;
18215 else if (TREE_CODE (function
) == SCOPE_REF
)
18217 qualified_p
= true;
18218 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
18220 /*address_p=*/false);
18222 else if (koenig_p
&& identifier_p (function
))
18224 /* Do nothing; calling tsubst_copy_and_build on an identifier
18225 would incorrectly perform unqualified lookup again.
18227 Note that we can also have an IDENTIFIER_NODE if the earlier
18228 unqualified lookup found a member function; in that case
18229 koenig_p will be false and we do want to do the lookup
18230 again to find the instantiated member function.
18232 FIXME but doing that causes c++/15272, so we need to stop
18233 using IDENTIFIER_NODE in that situation. */
18234 qualified_p
= false;
18238 if (TREE_CODE (function
) == COMPONENT_REF
)
18240 tree op
= TREE_OPERAND (function
, 1);
18242 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
18243 || (BASELINK_P (op
)
18244 && BASELINK_QUALIFIED_P (op
)));
18247 qualified_p
= false;
18249 if (TREE_CODE (function
) == ADDR_EXPR
18250 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
18251 /* Avoid error about taking the address of a constructor. */
18252 function
= TREE_OPERAND (function
, 0);
18254 function
= tsubst_copy_and_build (function
, args
, complain
,
18257 integral_constant_expression_p
);
18259 if (BASELINK_P (function
))
18260 qualified_p
= true;
18263 nargs
= call_expr_nargs (t
);
18264 call_args
= make_tree_vector ();
18265 for (i
= 0; i
< nargs
; ++i
)
18267 tree arg
= CALL_EXPR_ARG (t
, i
);
18269 if (!PACK_EXPANSION_P (arg
))
18270 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
18273 /* Expand the pack expansion and push each entry onto
18275 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
18276 if (TREE_CODE (arg
) == TREE_VEC
)
18278 unsigned int len
, j
;
18280 len
= TREE_VEC_LENGTH (arg
);
18281 for (j
= 0; j
< len
; ++j
)
18283 tree value
= TREE_VEC_ELT (arg
, j
);
18284 if (value
!= NULL_TREE
)
18285 value
= convert_from_reference (value
);
18286 vec_safe_push (call_args
, value
);
18291 /* A partial substitution. Add one entry. */
18292 vec_safe_push (call_args
, arg
);
18297 /* We do not perform argument-dependent lookup if normal
18298 lookup finds a non-function, in accordance with the
18299 expected resolution of DR 218. */
18301 && ((is_overloaded_fn (function
)
18302 /* If lookup found a member function, the Koenig lookup is
18303 not appropriate, even if an unqualified-name was used
18304 to denote the function. */
18305 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
18306 || identifier_p (function
))
18307 /* Only do this when substitution turns a dependent call
18308 into a non-dependent call. */
18309 && type_dependent_expression_p_push (t
)
18310 && !any_type_dependent_arguments_p (call_args
))
18311 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
18313 if (function
!= NULL_TREE
18314 && identifier_p (function
)
18315 && !any_type_dependent_arguments_p (call_args
))
18317 if (koenig_p
&& (complain
& tf_warning_or_error
))
18319 /* For backwards compatibility and good diagnostics, try
18320 the unqualified lookup again if we aren't in SFINAE
18322 tree unq
= (tsubst_copy_and_build
18323 (function
, args
, complain
, in_decl
, true,
18324 integral_constant_expression_p
));
18325 if (unq
== error_mark_node
)
18327 release_tree_vector (call_args
);
18328 RETURN (error_mark_node
);
18331 if (unq
!= function
)
18333 /* In a lambda fn, we have to be careful to not
18334 introduce new this captures. Legacy code can't
18335 be using lambdas anyway, so it's ok to be
18337 bool in_lambda
= (current_class_type
18338 && LAMBDA_TYPE_P (current_class_type
));
18339 char const *const msg
18340 = G_("%qD was not declared in this scope, "
18341 "and no declarations were found by "
18342 "argument-dependent lookup at the point "
18343 "of instantiation");
18347 error_at (EXPR_LOC_OR_LOC (t
, input_location
),
18350 diag
= permerror (EXPR_LOC_OR_LOC (t
, input_location
),
18356 if (INDIRECT_REF_P (fn
))
18357 fn
= TREE_OPERAND (fn
, 0);
18358 if (is_overloaded_fn (fn
))
18359 fn
= get_first_fn (fn
);
18362 /* Can't say anything more. */;
18363 else if (DECL_CLASS_SCOPE_P (fn
))
18365 location_t loc
= EXPR_LOC_OR_LOC (t
,
18368 "declarations in dependent base %qT are "
18369 "not found by unqualified lookup",
18370 DECL_CLASS_CONTEXT (fn
));
18371 if (current_class_ptr
)
18373 "use %<this->%D%> instead", function
);
18376 "use %<%T::%D%> instead",
18377 current_class_name
, function
);
18380 inform (DECL_SOURCE_LOCATION (fn
),
18381 "%qD declared here, later in the "
18382 "translation unit", fn
);
18385 release_tree_vector (call_args
);
18386 RETURN (error_mark_node
);
18393 if (identifier_p (function
))
18395 if (complain
& tf_error
)
18396 unqualified_name_lookup_error (function
);
18397 release_tree_vector (call_args
);
18398 RETURN (error_mark_node
);
18402 /* Remember that there was a reference to this entity. */
18403 if (function
!= NULL_TREE
18404 && DECL_P (function
)
18405 && !mark_used (function
, complain
) && !(complain
& tf_error
))
18407 release_tree_vector (call_args
);
18408 RETURN (error_mark_node
);
18411 /* Put back tf_decltype for the actual call. */
18412 complain
|= decltype_flag
;
18414 if (function
== NULL_TREE
)
18415 switch (CALL_EXPR_IFN (t
))
18418 gcc_assert (nargs
== 1);
18419 if (vec_safe_length (call_args
) != 1)
18421 error_at (EXPR_LOC_OR_LOC (t
, input_location
),
18422 "wrong number of arguments to "
18423 "%<__builtin_launder%>");
18424 ret
= error_mark_node
;
18427 ret
= finish_builtin_launder (EXPR_LOC_OR_LOC (t
,
18429 (*call_args
)[0], complain
);
18433 /* Unsupported internal function with arguments. */
18434 gcc_unreachable ();
18436 else if (TREE_CODE (function
) == OFFSET_REF
18437 || TREE_CODE (function
) == DOTSTAR_EXPR
18438 || TREE_CODE (function
) == MEMBER_REF
)
18439 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
18441 else if (TREE_CODE (function
) == COMPONENT_REF
)
18443 tree instance
= TREE_OPERAND (function
, 0);
18444 tree fn
= TREE_OPERAND (function
, 1);
18446 if (processing_template_decl
18447 && (type_dependent_expression_p (instance
)
18448 || (!BASELINK_P (fn
)
18449 && TREE_CODE (fn
) != FIELD_DECL
)
18450 || type_dependent_expression_p (fn
)
18451 || any_type_dependent_arguments_p (call_args
)))
18452 ret
= build_min_nt_call_vec (function
, call_args
);
18453 else if (!BASELINK_P (fn
))
18454 ret
= finish_call_expr (function
, &call_args
,
18455 /*disallow_virtual=*/false,
18456 /*koenig_p=*/false,
18459 ret
= (build_new_method_call
18461 &call_args
, NULL_TREE
,
18462 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
18467 ret
= finish_call_expr (function
, &call_args
,
18468 /*disallow_virtual=*/qualified_p
,
18472 release_tree_vector (call_args
);
18474 if (ret
!= error_mark_node
)
18476 bool op
= CALL_EXPR_OPERATOR_SYNTAX (t
);
18477 bool ord
= CALL_EXPR_ORDERED_ARGS (t
);
18478 bool rev
= CALL_EXPR_REVERSE_ARGS (t
);
18479 bool thk
= CALL_FROM_THUNK_P (t
);
18480 if (op
|| ord
|| rev
|| thk
)
18482 function
= extract_call_expr (ret
);
18483 CALL_EXPR_OPERATOR_SYNTAX (function
) = op
;
18484 CALL_EXPR_ORDERED_ARGS (function
) = ord
;
18485 CALL_EXPR_REVERSE_ARGS (function
) = rev
;
18488 if (TREE_CODE (function
) == CALL_EXPR
)
18489 CALL_FROM_THUNK_P (function
) = true;
18491 AGGR_INIT_FROM_THUNK_P (function
) = true;
18492 /* The thunk location is not interesting. */
18493 SET_EXPR_LOCATION (function
, UNKNOWN_LOCATION
);
18503 tree cond
= RECUR (TREE_OPERAND (t
, 0));
18504 tree folded_cond
= fold_non_dependent_expr (cond
);
18507 if (TREE_CODE (folded_cond
) == INTEGER_CST
)
18509 if (integer_zerop (folded_cond
))
18511 ++c_inhibit_evaluation_warnings
;
18512 exp1
= RECUR (TREE_OPERAND (t
, 1));
18513 --c_inhibit_evaluation_warnings
;
18514 exp2
= RECUR (TREE_OPERAND (t
, 2));
18518 exp1
= RECUR (TREE_OPERAND (t
, 1));
18519 ++c_inhibit_evaluation_warnings
;
18520 exp2
= RECUR (TREE_OPERAND (t
, 2));
18521 --c_inhibit_evaluation_warnings
;
18523 cond
= folded_cond
;
18527 exp1
= RECUR (TREE_OPERAND (t
, 1));
18528 exp2
= RECUR (TREE_OPERAND (t
, 2));
18531 warning_sentinel
s(warn_duplicated_branches
);
18532 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
18533 cond
, exp1
, exp2
, complain
));
18536 case PSEUDO_DTOR_EXPR
:
18538 tree op0
= RECUR (TREE_OPERAND (t
, 0));
18539 tree op1
= RECUR (TREE_OPERAND (t
, 1));
18540 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
18541 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
18547 tree purpose
, value
, chain
;
18549 if (t
== void_list_node
)
18552 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
18553 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
18555 /* We have pack expansions, so expand those and
18556 create a new list out of it. */
18557 tree purposevec
= NULL_TREE
;
18558 tree valuevec
= NULL_TREE
;
18562 /* Expand the argument expressions. */
18563 if (TREE_PURPOSE (t
))
18564 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
18565 complain
, in_decl
);
18566 if (TREE_VALUE (t
))
18567 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
18568 complain
, in_decl
);
18570 /* Build the rest of the list. */
18571 chain
= TREE_CHAIN (t
);
18572 if (chain
&& chain
!= void_type_node
)
18573 chain
= RECUR (chain
);
18575 /* Determine the number of arguments. */
18576 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
18578 len
= TREE_VEC_LENGTH (purposevec
);
18579 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
18581 else if (TREE_CODE (valuevec
) == TREE_VEC
)
18582 len
= TREE_VEC_LENGTH (valuevec
);
18585 /* Since we only performed a partial substitution into
18586 the argument pack, we only RETURN (a single list
18588 if (purposevec
== TREE_PURPOSE (t
)
18589 && valuevec
== TREE_VALUE (t
)
18590 && chain
== TREE_CHAIN (t
))
18593 RETURN (tree_cons (purposevec
, valuevec
, chain
));
18596 /* Convert the argument vectors into a TREE_LIST */
18600 /* Grab the Ith values. */
18602 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
18605 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
18608 /* Build the list (backwards). */
18609 chain
= tree_cons (purpose
, value
, chain
);
18615 purpose
= TREE_PURPOSE (t
);
18617 purpose
= RECUR (purpose
);
18618 value
= TREE_VALUE (t
);
18620 value
= RECUR (value
);
18621 chain
= TREE_CHAIN (t
);
18622 if (chain
&& chain
!= void_type_node
)
18623 chain
= RECUR (chain
);
18624 if (purpose
== TREE_PURPOSE (t
)
18625 && value
== TREE_VALUE (t
)
18626 && chain
== TREE_CHAIN (t
))
18628 RETURN (tree_cons (purpose
, value
, chain
));
18631 case COMPONENT_REF
:
18638 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
18639 args
, complain
, in_decl
);
18640 /* Remember that there was a reference to this entity. */
18641 if (DECL_P (object
)
18642 && !mark_used (object
, complain
) && !(complain
& tf_error
))
18643 RETURN (error_mark_node
);
18644 object_type
= TREE_TYPE (object
);
18646 member
= TREE_OPERAND (t
, 1);
18647 if (BASELINK_P (member
))
18648 member
= tsubst_baselink (member
,
18649 non_reference (TREE_TYPE (object
)),
18650 args
, complain
, in_decl
);
18652 member
= tsubst_copy (member
, args
, complain
, in_decl
);
18653 if (member
== error_mark_node
)
18654 RETURN (error_mark_node
);
18656 if (TREE_CODE (member
) == FIELD_DECL
)
18658 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
18659 if (TREE_CODE (r
) == COMPONENT_REF
)
18660 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
18663 else if (type_dependent_expression_p (object
))
18664 /* We can't do much here. */;
18665 else if (!CLASS_TYPE_P (object_type
))
18667 if (scalarish_type_p (object_type
))
18669 tree s
= NULL_TREE
;
18670 tree dtor
= member
;
18672 if (TREE_CODE (dtor
) == SCOPE_REF
)
18674 s
= TREE_OPERAND (dtor
, 0);
18675 dtor
= TREE_OPERAND (dtor
, 1);
18677 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
18679 dtor
= TREE_OPERAND (dtor
, 0);
18681 RETURN (finish_pseudo_destructor_expr
18682 (object
, s
, dtor
, input_location
));
18686 else if (TREE_CODE (member
) == SCOPE_REF
18687 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
18689 /* Lookup the template functions now that we know what the
18691 tree scope
= TREE_OPERAND (member
, 0);
18692 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
18693 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
18694 member
= lookup_qualified_name (scope
, tmpl
,
18695 /*is_type_p=*/false,
18696 /*complain=*/false);
18697 if (BASELINK_P (member
))
18699 BASELINK_FUNCTIONS (member
)
18700 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
18702 member
= (adjust_result_of_qualified_name_lookup
18703 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
18708 qualified_name_lookup_error (scope
, tmpl
, member
,
18710 RETURN (error_mark_node
);
18713 else if (TREE_CODE (member
) == SCOPE_REF
18714 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
18715 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
18717 if (complain
& tf_error
)
18719 if (TYPE_P (TREE_OPERAND (member
, 0)))
18720 error ("%qT is not a class or namespace",
18721 TREE_OPERAND (member
, 0));
18723 error ("%qD is not a class or namespace",
18724 TREE_OPERAND (member
, 0));
18726 RETURN (error_mark_node
);
18729 r
= finish_class_member_access_expr (object
, member
,
18730 /*template_p=*/false,
18732 if (TREE_CODE (r
) == COMPONENT_REF
)
18733 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
18738 RETURN (build_throw
18739 (RECUR (TREE_OPERAND (t
, 0))));
18743 vec
<constructor_elt
, va_gc
> *n
;
18744 constructor_elt
*ce
;
18745 unsigned HOST_WIDE_INT idx
;
18746 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
18747 bool process_index_p
;
18749 bool need_copy_p
= false;
18752 if (type
== error_mark_node
)
18753 RETURN (error_mark_node
);
18755 /* We do not want to process the index of aggregate
18756 initializers as they are identifier nodes which will be
18757 looked up by digest_init. */
18758 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
18760 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
18761 newlen
= vec_safe_length (n
);
18762 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
18764 if (ce
->index
&& process_index_p
18765 /* An identifier index is looked up in the type
18766 being initialized, not the current scope. */
18767 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
18768 ce
->index
= RECUR (ce
->index
);
18770 if (PACK_EXPANSION_P (ce
->value
))
18772 /* Substitute into the pack expansion. */
18773 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
18776 if (ce
->value
== error_mark_node
18777 || PACK_EXPANSION_P (ce
->value
))
18779 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
18780 /* Just move the argument into place. */
18781 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
18784 /* Update the length of the final CONSTRUCTOR
18785 arguments vector, and note that we will need to
18787 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
18788 need_copy_p
= true;
18792 ce
->value
= RECUR (ce
->value
);
18797 vec
<constructor_elt
, va_gc
> *old_n
= n
;
18799 vec_alloc (n
, newlen
);
18800 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
18802 if (TREE_CODE (ce
->value
) == TREE_VEC
)
18804 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
18805 for (i
= 0; i
< len
; ++i
)
18806 CONSTRUCTOR_APPEND_ELT (n
, 0,
18807 TREE_VEC_ELT (ce
->value
, i
));
18810 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
18814 r
= build_constructor (init_list_type_node
, n
);
18815 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
18817 if (TREE_HAS_CONSTRUCTOR (t
))
18819 fcl_t cl
= fcl_functional
;
18820 if (CONSTRUCTOR_C99_COMPOUND_LITERAL (t
))
18822 RETURN (finish_compound_literal (type
, r
, complain
, cl
));
18825 TREE_TYPE (r
) = type
;
18831 tree operand_0
= TREE_OPERAND (t
, 0);
18832 if (TYPE_P (operand_0
))
18834 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
18835 RETURN (get_typeid (operand_0
, complain
));
18839 operand_0
= RECUR (operand_0
);
18840 RETURN (build_typeid (operand_0
, complain
));
18851 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
18852 /* ??? We're doing a subset of finish_id_expression here. */
18854 && !processing_template_decl
18855 && !cp_unevaluated_operand
18856 && (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
18857 && CP_DECL_THREAD_LOCAL_P (r
))
18859 if (tree wrap
= get_tls_wrapper_fn (r
))
18860 /* Replace an evaluated use of the thread_local variable with
18861 a call to its wrapper. */
18862 r
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
18864 else if (outer_automatic_var_p (r
))
18865 r
= process_outer_var_ref (r
, complain
);
18867 if (!TYPE_REF_P (TREE_TYPE (t
)))
18868 /* If the original type was a reference, we'll be wrapped in
18869 the appropriate INDIRECT_REF. */
18870 r
= convert_from_reference (r
);
18876 tree op0
= RECUR (TREE_OPERAND (t
, 0));
18877 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
18878 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
18881 case OFFSETOF_EXPR
:
18884 = tsubst_copy_and_build (TREE_OPERAND (t
, 1), args
, complain
,
18885 in_decl
, /*function_p=*/false,
18886 /*integral_constant_expression_p=*/false);
18887 RETURN (finish_offsetof (object_ptr
,
18888 RECUR (TREE_OPERAND (t
, 0)),
18889 EXPR_LOCATION (t
)));
18892 case ADDRESSOF_EXPR
:
18893 RETURN (cp_build_addressof (EXPR_LOCATION (t
),
18894 RECUR (TREE_OPERAND (t
, 0)), complain
));
18898 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
18899 complain
, in_decl
);
18901 tree type2
= TRAIT_EXPR_TYPE2 (t
);
18902 if (type2
&& TREE_CODE (type2
) == TREE_LIST
)
18903 type2
= RECUR (type2
);
18905 type2
= tsubst (type2
, args
, complain
, in_decl
);
18907 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
18912 tree old_stmt_expr
= cur_stmt_expr
;
18913 tree stmt_expr
= begin_stmt_expr ();
18915 cur_stmt_expr
= stmt_expr
;
18916 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
18917 integral_constant_expression_p
);
18918 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
18919 cur_stmt_expr
= old_stmt_expr
;
18921 /* If the resulting list of expression statement is empty,
18922 fold it further into void_node. */
18923 if (empty_expr_stmt_p (stmt_expr
))
18924 stmt_expr
= void_node
;
18926 RETURN (stmt_expr
);
18931 tree r
= tsubst_lambda_expr (t
, args
, complain
, in_decl
);
18933 RETURN (build_lambda_object (r
));
18937 /* We can get here for a constant initializer of non-dependent type.
18938 FIXME stop folding in cp_parser_initializer_clause. */
18940 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
18945 case TRANSACTION_EXPR
:
18946 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
18947 integral_constant_expression_p
));
18950 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
18952 case VEC_PERM_EXPR
:
18954 tree op0
= RECUR (TREE_OPERAND (t
, 0));
18955 tree op1
= RECUR (TREE_OPERAND (t
, 1));
18956 tree op2
= RECUR (TREE_OPERAND (t
, 2));
18957 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
18961 case REQUIRES_EXPR
:
18962 RETURN (tsubst_requires_expr (t
, args
, complain
, in_decl
));
18964 case NON_LVALUE_EXPR
:
18965 case VIEW_CONVERT_EXPR
:
18966 /* We should only see these for location wrapper nodes, or within
18967 instantiate_non_dependent_expr (when args is NULL_TREE). */
18968 gcc_assert (location_wrapper_p (t
) || args
== NULL_TREE
);
18969 if (location_wrapper_p (t
))
18970 RETURN (maybe_wrap_with_location (RECUR (TREE_OPERAND (t
, 0)),
18971 EXPR_LOCATION (t
)));
18975 /* Handle Objective-C++ constructs, if appropriate. */
18978 = objcp_tsubst_copy_and_build (t
, args
, complain
,
18979 in_decl
, /*function_p=*/false);
18983 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
18989 input_location
= loc
;
18993 /* Verify that the instantiated ARGS are valid. For type arguments,
18994 make sure that the type's linkage is ok. For non-type arguments,
18995 make sure they are constants if they are integral or enumerations.
18996 Emit an error under control of COMPLAIN, and return TRUE on error. */
18999 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
19001 if (dependent_template_arg_p (t
))
19003 if (ARGUMENT_PACK_P (t
))
19005 tree vec
= ARGUMENT_PACK_ARGS (t
);
19006 int len
= TREE_VEC_LENGTH (vec
);
19007 bool result
= false;
19010 for (i
= 0; i
< len
; ++i
)
19011 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
19015 else if (TYPE_P (t
))
19017 /* [basic.link]: A name with no linkage (notably, the name
19018 of a class or enumeration declared in a local scope)
19019 shall not be used to declare an entity with linkage.
19020 This implies that names with no linkage cannot be used as
19023 DR 757 relaxes this restriction for C++0x. */
19024 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
19025 : no_linkage_check (t
, /*relaxed_p=*/false));
19029 /* DR 488 makes use of a type with no linkage cause
19030 type deduction to fail. */
19031 if (complain
& tf_error
)
19033 if (TYPE_UNNAMED_P (nt
))
19034 error ("%qT is/uses unnamed type", t
);
19036 error ("template argument for %qD uses local type %qT",
19041 /* In order to avoid all sorts of complications, we do not
19042 allow variably-modified types as template arguments. */
19043 else if (variably_modified_type_p (t
, NULL_TREE
))
19045 if (complain
& tf_error
)
19046 error ("%qT is a variably modified type", t
);
19050 /* Class template and alias template arguments should be OK. */
19051 else if (DECL_TYPE_TEMPLATE_P (t
))
19053 /* A non-type argument of integral or enumerated type must be a
19055 else if (TREE_TYPE (t
)
19056 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
19057 && !REFERENCE_REF_P (t
)
19058 && !TREE_CONSTANT (t
))
19060 if (complain
& tf_error
)
19061 error ("integral expression %qE is not constant", t
);
19068 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
19070 int ix
, len
= DECL_NTPARMS (tmpl
);
19071 bool result
= false;
19073 for (ix
= 0; ix
!= len
; ix
++)
19075 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
19078 if (result
&& (complain
& tf_error
))
19079 error (" trying to instantiate %qD", tmpl
);
19083 /* We're out of SFINAE context now, so generate diagnostics for the access
19084 errors we saw earlier when instantiating D from TMPL and ARGS. */
19087 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
19089 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
19090 tree type
= TREE_TYPE (pattern
);
19091 location_t loc
= input_location
;
19093 push_access_scope (d
);
19094 push_deferring_access_checks (dk_no_deferred
);
19095 input_location
= DECL_SOURCE_LOCATION (pattern
);
19096 tsubst (type
, args
, tf_warning_or_error
, d
);
19097 input_location
= loc
;
19098 pop_deferring_access_checks ();
19099 pop_access_scope (d
);
19102 /* Instantiate the indicated variable, function, or alias template TMPL with
19103 the template arguments in TARG_PTR. */
19106 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
19108 tree targ_ptr
= orig_args
;
19112 bool access_ok
= true;
19114 if (tmpl
== error_mark_node
)
19115 return error_mark_node
;
19117 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
19119 /* If this function is a clone, handle it specially. */
19120 if (DECL_CLONED_FUNCTION_P (tmpl
))
19125 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
19126 DECL_CLONED_FUNCTION. */
19127 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
19128 targ_ptr
, complain
);
19129 if (spec
== error_mark_node
)
19130 return error_mark_node
;
19132 /* Look for the clone. */
19133 FOR_EACH_CLONE (clone
, spec
)
19134 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
19136 /* We should always have found the clone by now. */
19137 gcc_unreachable ();
19141 if (targ_ptr
== error_mark_node
)
19142 return error_mark_node
;
19144 /* Check to see if we already have this specialization. */
19145 gen_tmpl
= most_general_template (tmpl
);
19146 if (TMPL_ARGS_DEPTH (targ_ptr
)
19147 < TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
)))
19148 /* targ_ptr only has the innermost template args, so add the outer ones
19149 from tmpl, which could be either a partial instantiation or gen_tmpl (in
19150 the case of a non-dependent call within a template definition). */
19151 targ_ptr
= (add_outermost_template_args
19152 (DECL_TI_ARGS (DECL_TEMPLATE_RESULT (tmpl
)),
19155 /* It would be nice to avoid hashing here and then again in tsubst_decl,
19156 but it doesn't seem to be on the hot path. */
19157 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
19159 gcc_assert (tmpl
== gen_tmpl
19160 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
19162 || fndecl
== NULL_TREE
);
19164 if (spec
!= NULL_TREE
)
19166 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
19168 if (complain
& tf_error
)
19169 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
19170 return error_mark_node
;
19175 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
19177 return error_mark_node
;
19179 /* We are building a FUNCTION_DECL, during which the access of its
19180 parameters and return types have to be checked. However this
19181 FUNCTION_DECL which is the desired context for access checking
19182 is not built yet. We solve this chicken-and-egg problem by
19183 deferring all checks until we have the FUNCTION_DECL. */
19184 push_deferring_access_checks (dk_deferred
);
19186 /* Instantiation of the function happens in the context of the function
19187 template, not the context of the overload resolution we're doing. */
19188 push_to_top_level ();
19189 /* If there are dependent arguments, e.g. because we're doing partial
19190 ordering, make sure processing_template_decl stays set. */
19191 if (uses_template_parms (targ_ptr
))
19192 ++processing_template_decl
;
19193 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
19195 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
19196 complain
, gen_tmpl
, true);
19197 push_nested_class (ctx
);
19200 tree pattern
= DECL_TEMPLATE_RESULT (gen_tmpl
);
19202 fndecl
= NULL_TREE
;
19203 if (VAR_P (pattern
))
19205 /* We need to determine if we're using a partial or explicit
19206 specialization now, because the type of the variable could be
19208 tree tid
= lookup_template_variable (gen_tmpl
, targ_ptr
);
19209 tree elt
= most_specialized_partial_spec (tid
, complain
);
19210 if (elt
== error_mark_node
)
19211 pattern
= error_mark_node
;
19214 tree partial_tmpl
= TREE_VALUE (elt
);
19215 tree partial_args
= TREE_PURPOSE (elt
);
19216 tree partial_pat
= DECL_TEMPLATE_RESULT (partial_tmpl
);
19217 fndecl
= tsubst (partial_pat
, partial_args
, complain
, gen_tmpl
);
19221 /* Substitute template parameters to obtain the specialization. */
19222 if (fndecl
== NULL_TREE
)
19223 fndecl
= tsubst (pattern
, targ_ptr
, complain
, gen_tmpl
);
19224 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
19225 pop_nested_class ();
19226 pop_from_top_level ();
19228 if (fndecl
== error_mark_node
)
19230 pop_deferring_access_checks ();
19231 return error_mark_node
;
19234 /* The DECL_TI_TEMPLATE should always be the immediate parent
19235 template, not the most general template. */
19236 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
19237 DECL_TI_ARGS (fndecl
) = targ_ptr
;
19239 /* Now we know the specialization, compute access previously
19240 deferred. Do no access control for inheriting constructors,
19241 as we already checked access for the inherited constructor. */
19242 if (!(flag_new_inheriting_ctors
19243 && DECL_INHERITED_CTOR (fndecl
)))
19245 push_access_scope (fndecl
);
19246 if (!perform_deferred_access_checks (complain
))
19248 pop_access_scope (fndecl
);
19250 pop_deferring_access_checks ();
19252 /* If we've just instantiated the main entry point for a function,
19253 instantiate all the alternate entry points as well. We do this
19254 by cloning the instantiation of the main entry point, not by
19255 instantiating the template clones. */
19256 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
19257 clone_function_decl (fndecl
, /*update_methods=*/false);
19261 if (!(complain
& tf_error
))
19263 /* Remember to reinstantiate when we're out of SFINAE so the user
19264 can see the errors. */
19265 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
19267 return error_mark_node
;
19272 /* Wrapper for instantiate_template_1. */
19275 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
19278 timevar_push (TV_TEMPLATE_INST
);
19279 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
19280 timevar_pop (TV_TEMPLATE_INST
);
19284 /* Instantiate the alias template TMPL with ARGS. Also push a template
19285 instantiation level, which instantiate_template doesn't do because
19286 functions and variables have sufficient context established by the
19290 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
19292 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
19293 return error_mark_node
;
19294 if (!push_tinst_level (tmpl
, args
))
19295 return error_mark_node
;
19298 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
19299 args
, tmpl
, complain
,
19300 /*require_all_args=*/true,
19301 /*use_default_args=*/true);
19303 tree r
= instantiate_template (tmpl
, args
, complain
);
19304 pop_tinst_level ();
19309 /* PARM is a template parameter pack for FN. Returns true iff
19310 PARM is used in a deducible way in the argument list of FN. */
19313 pack_deducible_p (tree parm
, tree fn
)
19315 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
19316 for (; t
; t
= TREE_CHAIN (t
))
19318 tree type
= TREE_VALUE (t
);
19320 if (!PACK_EXPANSION_P (type
))
19322 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
19323 packs
; packs
= TREE_CHAIN (packs
))
19324 if (template_args_equal (TREE_VALUE (packs
), parm
))
19326 /* The template parameter pack is used in a function parameter
19327 pack. If this is the end of the parameter list, the
19328 template parameter pack is deducible. */
19329 if (TREE_CHAIN (t
) == void_list_node
)
19332 /* Otherwise, not. Well, it could be deduced from
19333 a non-pack parameter, but doing so would end up with
19334 a deduction mismatch, so don't bother. */
19338 /* The template parameter pack isn't used in any function parameter
19339 packs, but it might be used deeper, e.g. tuple<Args...>. */
19343 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
19344 NARGS elements of the arguments that are being used when calling
19345 it. TARGS is a vector into which the deduced template arguments
19348 Returns either a FUNCTION_DECL for the matching specialization of FN or
19349 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
19350 true, diagnostics will be printed to explain why it failed.
19352 If FN is a conversion operator, or we are trying to produce a specific
19353 specialization, RETURN_TYPE is the return type desired.
19355 The EXPLICIT_TARGS are explicit template arguments provided via a
19358 The parameter STRICT is one of:
19361 We are deducing arguments for a function call, as in
19362 [temp.deduct.call]. If RETURN_TYPE is non-null, we are
19363 deducing arguments for a call to the result of a conversion
19364 function template, as in [over.call.object].
19367 We are deducing arguments for a conversion function, as in
19368 [temp.deduct.conv].
19371 We are deducing arguments when doing an explicit instantiation
19372 as in [temp.explicit], when determining an explicit specialization
19373 as in [temp.expl.spec], or when taking the address of a function
19374 template, as in [temp.deduct.funcaddr]. */
19377 fn_type_unification (tree fn
,
19378 tree explicit_targs
,
19381 unsigned int nargs
,
19383 unification_kind_t strict
,
19390 tree decl
= NULL_TREE
;
19391 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
19393 static int deduction_depth
;
19396 if (flag_new_inheriting_ctors
)
19397 fn
= strip_inheriting_ctors (fn
);
19399 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
19400 tree r
= error_mark_node
;
19402 tree full_targs
= targs
;
19403 if (TMPL_ARGS_DEPTH (targs
)
19404 < TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (fn
)))
19405 full_targs
= (add_outermost_template_args
19406 (DECL_TI_ARGS (DECL_TEMPLATE_RESULT (fn
)),
19410 complain
|= tf_decltype
;
19412 /* In C++0x, it's possible to have a function template whose type depends
19413 on itself recursively. This is most obvious with decltype, but can also
19414 occur with enumeration scope (c++/48969). So we need to catch infinite
19415 recursion and reject the substitution at deduction time; this function
19416 will return error_mark_node for any repeated substitution.
19418 This also catches excessive recursion such as when f<N> depends on
19419 f<N-1> across all integers, and returns error_mark_node for all the
19420 substitutions back up to the initial one.
19422 This is, of course, not reentrant. */
19423 if (excessive_deduction_depth
)
19424 return error_mark_node
;
19427 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
19429 fntype
= TREE_TYPE (fn
);
19430 if (explicit_targs
)
19434 The specified template arguments must match the template
19435 parameters in kind (i.e., type, nontype, template), and there
19436 must not be more arguments than there are parameters;
19437 otherwise type deduction fails.
19439 Nontype arguments must match the types of the corresponding
19440 nontype template parameters, or must be convertible to the
19441 types of the corresponding nontype parameters as specified in
19442 _temp.arg.nontype_, otherwise type deduction fails.
19444 All references in the function type of the function template
19445 to the corresponding template parameters are replaced by the
19446 specified template argument values. If a substitution in a
19447 template parameter or in the function type of the function
19448 template results in an invalid type, type deduction fails. */
19449 int i
, len
= TREE_VEC_LENGTH (tparms
);
19450 location_t loc
= input_location
;
19451 bool incomplete
= false;
19453 if (explicit_targs
== error_mark_node
)
19456 if (TMPL_ARGS_DEPTH (explicit_targs
)
19457 < TMPL_ARGS_DEPTH (full_targs
))
19458 explicit_targs
= add_outermost_template_args (full_targs
,
19461 /* Adjust any explicit template arguments before entering the
19462 substitution context. */
19464 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
19466 /*require_all_args=*/false,
19467 /*use_default_args=*/false));
19468 if (explicit_targs
== error_mark_node
)
19471 /* Substitute the explicit args into the function type. This is
19472 necessary so that, for instance, explicitly declared function
19473 arguments can match null pointed constants. If we were given
19474 an incomplete set of explicit args, we must not do semantic
19475 processing during substitution as we could create partial
19477 for (i
= 0; i
< len
; i
++)
19479 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
19480 bool parameter_pack
= false;
19481 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
19483 /* Dig out the actual parm. */
19484 if (TREE_CODE (parm
) == TYPE_DECL
19485 || TREE_CODE (parm
) == TEMPLATE_DECL
)
19487 parm
= TREE_TYPE (parm
);
19488 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
19490 else if (TREE_CODE (parm
) == PARM_DECL
)
19492 parm
= DECL_INITIAL (parm
);
19493 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
19496 if (!parameter_pack
&& targ
== NULL_TREE
)
19497 /* No explicit argument for this template parameter. */
19500 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
19502 /* Mark the argument pack as "incomplete". We could
19503 still deduce more arguments during unification.
19504 We remove this mark in type_unification_real. */
19507 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
19508 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
19509 = ARGUMENT_PACK_ARGS (targ
);
19512 /* We have some incomplete argument packs. */
19517 if (!push_tinst_level (fn
, explicit_targs
))
19519 excessive_deduction_depth
= true;
19522 processing_template_decl
+= incomplete
;
19523 input_location
= DECL_SOURCE_LOCATION (fn
);
19524 /* Ignore any access checks; we'll see them again in
19525 instantiate_template and they might have the wrong
19526 access path at this point. */
19527 push_deferring_access_checks (dk_deferred
);
19528 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
19529 complain
| tf_partial
| tf_fndecl_type
, NULL_TREE
);
19530 pop_deferring_access_checks ();
19531 input_location
= loc
;
19532 processing_template_decl
-= incomplete
;
19533 pop_tinst_level ();
19535 if (fntype
== error_mark_node
)
19538 /* Place the explicitly specified arguments in TARGS. */
19539 explicit_targs
= INNERMOST_TEMPLATE_ARGS (explicit_targs
);
19540 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
19541 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
19544 /* Never do unification on the 'this' parameter. */
19545 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
19547 if (return_type
&& strict
== DEDUCE_CALL
)
19549 /* We're deducing for a call to the result of a template conversion
19550 function. The parms we really want are in return_type. */
19551 if (POINTER_TYPE_P (return_type
))
19552 return_type
= TREE_TYPE (return_type
);
19553 parms
= TYPE_ARG_TYPES (return_type
);
19555 else if (return_type
)
19559 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
19560 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
19561 new_args
[0] = return_type
;
19562 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
19567 /* We allow incomplete unification without an error message here
19568 because the standard doesn't seem to explicitly prohibit it. Our
19569 callers must be ready to deal with unification failures in any
19572 /* If we aren't explaining yet, push tinst context so we can see where
19573 any errors (e.g. from class instantiations triggered by instantiation
19574 of default template arguments) come from. If we are explaining, this
19575 context is redundant. */
19576 if (!explain_p
&& !push_tinst_level (fn
, targs
))
19578 excessive_deduction_depth
= true;
19582 /* type_unification_real will pass back any access checks from default
19583 template argument substitution. */
19584 vec
<deferred_access_check
, va_gc
> *checks
;
19587 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
19588 full_targs
, parms
, args
, nargs
, /*subr=*/0,
19589 strict
, flags
, &checks
, explain_p
);
19591 pop_tinst_level ();
19595 /* Now that we have bindings for all of the template arguments,
19596 ensure that the arguments deduced for the template template
19597 parameters have compatible template parameter lists. We cannot
19598 check this property before we have deduced all template
19599 arguments, because the template parameter types of a template
19600 template parameter might depend on prior template parameters
19601 deduced after the template template parameter. The following
19602 ill-formed example illustrates this issue:
19604 template<typename T, template<T> class C> void f(C<5>, T);
19606 template<int N> struct X {};
19609 f(X<5>(), 5l); // error: template argument deduction fails
19612 The template parameter list of 'C' depends on the template type
19613 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
19614 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
19615 time that we deduce 'C'. */
19616 if (!template_template_parm_bindings_ok_p
19617 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
19619 unify_inconsistent_template_template_parameters (explain_p
);
19623 /* All is well so far. Now, check:
19627 When all template arguments have been deduced, all uses of
19628 template parameters in nondeduced contexts are replaced with
19629 the corresponding deduced argument values. If the
19630 substitution results in an invalid type, as described above,
19631 type deduction fails. */
19632 if (!push_tinst_level (fn
, targs
))
19634 excessive_deduction_depth
= true;
19638 /* Also collect access checks from the instantiation. */
19639 reopen_deferring_access_checks (checks
);
19641 decl
= instantiate_template (fn
, targs
, complain
);
19643 checks
= get_deferred_access_checks ();
19644 pop_deferring_access_checks ();
19646 pop_tinst_level ();
19648 if (decl
== error_mark_node
)
19651 /* Now perform any access checks encountered during substitution. */
19652 push_access_scope (decl
);
19653 ok
= perform_access_checks (checks
, complain
);
19654 pop_access_scope (decl
);
19658 /* If we're looking for an exact match, check that what we got
19659 is indeed an exact match. It might not be if some template
19660 parameters are used in non-deduced contexts. But don't check
19661 for an exact match if we have dependent template arguments;
19662 in that case we're doing partial ordering, and we already know
19663 that we have two candidates that will provide the actual type. */
19664 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
19666 tree substed
= TREE_TYPE (decl
);
19670 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
19672 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
19673 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
19674 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
19676 unify_type_mismatch (explain_p
, args
[i
],
19677 TREE_VALUE (sarg
));
19682 /* After doing deduction with the inherited constructor, actually return an
19683 instantiation of the inheriting constructor. */
19685 decl
= instantiate_template (orig_fn
, targs
, complain
);
19691 if (excessive_deduction_depth
)
19693 if (deduction_depth
== 0)
19694 /* Reset once we're all the way out. */
19695 excessive_deduction_depth
= false;
19701 /* Adjust types before performing type deduction, as described in
19702 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
19703 sections are symmetric. PARM is the type of a function parameter
19704 or the return type of the conversion function. ARG is the type of
19705 the argument passed to the call, or the type of the value
19706 initialized with the result of the conversion function.
19707 ARG_EXPR is the original argument expression, which may be null. */
19710 maybe_adjust_types_for_deduction (unification_kind_t strict
,
19723 /* Swap PARM and ARG throughout the remainder of this
19724 function; the handling is precisely symmetric since PARM
19725 will initialize ARG rather than vice versa. */
19726 std::swap (parm
, arg
);
19730 /* Core issue #873: Do the DR606 thing (see below) for these cases,
19731 too, but here handle it by stripping the reference from PARM
19732 rather than by adding it to ARG. */
19733 if (TYPE_REF_P (*parm
)
19734 && TYPE_REF_IS_RVALUE (*parm
)
19735 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
19736 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
19737 && TYPE_REF_P (*arg
)
19738 && !TYPE_REF_IS_RVALUE (*arg
))
19739 *parm
= TREE_TYPE (*parm
);
19740 /* Nothing else to do in this case. */
19744 gcc_unreachable ();
19747 if (!TYPE_REF_P (*parm
))
19749 /* [temp.deduct.call]
19751 If P is not a reference type:
19753 --If A is an array type, the pointer type produced by the
19754 array-to-pointer standard conversion (_conv.array_) is
19755 used in place of A for type deduction; otherwise,
19757 --If A is a function type, the pointer type produced by
19758 the function-to-pointer standard conversion
19759 (_conv.func_) is used in place of A for type deduction;
19762 --If A is a cv-qualified type, the top level
19763 cv-qualifiers of A's type are ignored for type
19765 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
19766 *arg
= build_pointer_type (TREE_TYPE (*arg
));
19767 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
19768 *arg
= build_pointer_type (*arg
);
19770 *arg
= TYPE_MAIN_VARIANT (*arg
);
19773 /* [14.8.2.1/3 temp.deduct.call], "A forwarding reference is an rvalue
19774 reference to a cv-unqualified template parameter that does not represent a
19775 template parameter of a class template (during class template argument
19776 deduction (13.3.1.8)). If P is a forwarding reference and the argument is
19777 an lvalue, the type "lvalue reference to A" is used in place of A for type
19779 if (TYPE_REF_P (*parm
)
19780 && TYPE_REF_IS_RVALUE (*parm
)
19781 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
19782 && !TEMPLATE_TYPE_PARM_FOR_CLASS (TREE_TYPE (*parm
))
19783 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
19784 && (arg_expr
? lvalue_p (arg_expr
)
19785 /* try_one_overload doesn't provide an arg_expr, but
19786 functions are always lvalues. */
19787 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
19788 *arg
= build_reference_type (*arg
);
19790 /* [temp.deduct.call]
19792 If P is a cv-qualified type, the top level cv-qualifiers
19793 of P's type are ignored for type deduction. If P is a
19794 reference type, the type referred to by P is used for
19796 *parm
= TYPE_MAIN_VARIANT (*parm
);
19797 if (TYPE_REF_P (*parm
))
19799 *parm
= TREE_TYPE (*parm
);
19800 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
19803 /* DR 322. For conversion deduction, remove a reference type on parm
19804 too (which has been swapped into ARG). */
19805 if (strict
== DEDUCE_CONV
&& TYPE_REF_P (*arg
))
19806 *arg
= TREE_TYPE (*arg
);
19811 /* Subroutine of unify_one_argument. PARM is a function parameter of a
19812 template which does contain any deducible template parameters; check if
19813 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
19814 unify_one_argument. */
19817 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
19818 int flags
, bool explain_p
)
19823 type
= TREE_TYPE (arg
);
19827 if (same_type_p (parm
, type
))
19828 return unify_success (explain_p
);
19830 if (strict
== DEDUCE_CONV
)
19832 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
19833 explain_p
? tf_warning_or_error
: tf_none
))
19834 return unify_success (explain_p
);
19836 else if (strict
!= DEDUCE_EXACT
)
19838 if (can_convert_arg (parm
, type
,
19839 TYPE_P (arg
) ? NULL_TREE
: arg
,
19840 flags
, explain_p
? tf_warning_or_error
: tf_none
))
19841 return unify_success (explain_p
);
19844 if (strict
== DEDUCE_EXACT
)
19845 return unify_type_mismatch (explain_p
, parm
, arg
);
19847 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
19850 static bool uses_deducible_template_parms (tree type
);
19852 /* Returns true iff the expression EXPR is one from which a template
19853 argument can be deduced. In other words, if it's an undecorated
19854 use of a template non-type parameter. */
19857 deducible_expression (tree expr
)
19859 /* Strip implicit conversions. */
19860 while (CONVERT_EXPR_P (expr
))
19861 expr
= TREE_OPERAND (expr
, 0);
19862 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
19865 /* Returns true iff the array domain DOMAIN uses a template parameter in a
19866 deducible way; that is, if it has a max value of <PARM> - 1. */
19869 deducible_array_bound (tree domain
)
19871 if (domain
== NULL_TREE
)
19874 tree max
= TYPE_MAX_VALUE (domain
);
19875 if (TREE_CODE (max
) != MINUS_EXPR
)
19878 return deducible_expression (TREE_OPERAND (max
, 0));
19881 /* Returns true iff the template arguments ARGS use a template parameter
19882 in a deducible way. */
19885 deducible_template_args (tree args
)
19887 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
19890 tree elt
= TREE_VEC_ELT (args
, i
);
19891 if (ARGUMENT_PACK_P (elt
))
19892 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
19895 if (PACK_EXPANSION_P (elt
))
19896 elt
= PACK_EXPANSION_PATTERN (elt
);
19897 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
19899 else if (TYPE_P (elt
))
19900 deducible
= uses_deducible_template_parms (elt
);
19902 deducible
= deducible_expression (elt
);
19910 /* Returns true iff TYPE contains any deducible references to template
19911 parameters, as per 14.8.2.5. */
19914 uses_deducible_template_parms (tree type
)
19916 if (PACK_EXPANSION_P (type
))
19917 type
= PACK_EXPANSION_PATTERN (type
);
19924 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
19925 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19931 if (POINTER_TYPE_P (type
))
19932 return uses_deducible_template_parms (TREE_TYPE (type
));
19934 /* T[integer-constant ]
19936 if (TREE_CODE (type
) == ARRAY_TYPE
)
19937 return (uses_deducible_template_parms (TREE_TYPE (type
))
19938 || deducible_array_bound (TYPE_DOMAIN (type
)));
19950 if (TYPE_PTRMEM_P (type
))
19951 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
19952 || (uses_deducible_template_parms
19953 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
19955 /* template-name <T> (where template-name refers to a class template)
19956 template-name <i> (where template-name refers to a class template) */
19957 if (CLASS_TYPE_P (type
)
19958 && CLASSTYPE_TEMPLATE_INFO (type
)
19959 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
19960 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
19961 (CLASSTYPE_TI_ARGS (type
)));
19966 if (TREE_CODE (type
) == FUNCTION_TYPE
19967 || TREE_CODE (type
) == METHOD_TYPE
)
19969 if (uses_deducible_template_parms (TREE_TYPE (type
)))
19971 tree parm
= TYPE_ARG_TYPES (type
);
19972 if (TREE_CODE (type
) == METHOD_TYPE
)
19973 parm
= TREE_CHAIN (parm
);
19974 for (; parm
; parm
= TREE_CHAIN (parm
))
19975 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
19982 /* Subroutine of type_unification_real and unify_pack_expansion to
19983 handle unification of a single P/A pair. Parameters are as
19984 for those functions. */
19987 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
19988 int subr
, unification_kind_t strict
,
19991 tree arg_expr
= NULL_TREE
;
19994 if (arg
== error_mark_node
|| parm
== error_mark_node
)
19995 return unify_invalid (explain_p
);
19996 if (arg
== unknown_type_node
)
19997 /* We can't deduce anything from this, but we might get all the
19998 template args from other function args. */
19999 return unify_success (explain_p
);
20001 /* Implicit conversions (Clause 4) will be performed on a function
20002 argument to convert it to the type of the corresponding function
20003 parameter if the parameter type contains no template-parameters that
20004 participate in template argument deduction. */
20005 if (strict
!= DEDUCE_EXACT
20006 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
20007 /* For function parameters with no deducible template parameters,
20008 just return. We'll check non-dependent conversions later. */
20009 return unify_success (explain_p
);
20014 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
20015 | UNIFY_ALLOW_MORE_CV_QUAL
20016 | UNIFY_ALLOW_DERIVED
);
20020 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
20024 arg_strict
= UNIFY_ALLOW_NONE
;
20028 gcc_unreachable ();
20031 /* We only do these transformations if this is the top-level
20032 parameter_type_list in a call or declaration matching; in other
20033 situations (nested function declarators, template argument lists) we
20034 won't be comparing a type to an expression, and we don't do any type
20040 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
20041 if (type_unknown_p (arg
))
20043 /* [temp.deduct.type] A template-argument can be
20044 deduced from a pointer to function or pointer
20045 to member function argument if the set of
20046 overloaded functions does not contain function
20047 templates and at most one of a set of
20048 overloaded functions provides a unique
20050 resolve_overloaded_unification (tparms
, targs
, parm
,
20052 arg_strict
, explain_p
);
20053 /* If a unique match was not found, this is a
20054 non-deduced context, so we still succeed. */
20055 return unify_success (explain_p
);
20059 arg
= unlowered_expr_type (arg
);
20060 if (arg
== error_mark_node
)
20061 return unify_invalid (explain_p
);
20065 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
20068 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
20069 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
20070 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
20072 /* For deduction from an init-list we need the actual list. */
20073 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
20075 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
20078 /* for_each_template_parm callback that always returns 0. */
20081 zero_r (tree
, void *)
20086 /* for_each_template_parm any_fn callback to handle deduction of a template
20087 type argument from the type of an array bound. */
20090 array_deduction_r (tree t
, void *data
)
20092 tree_pair_p d
= (tree_pair_p
)data
;
20093 tree
&tparms
= d
->purpose
;
20094 tree
&targs
= d
->value
;
20096 if (TREE_CODE (t
) == ARRAY_TYPE
)
20097 if (tree dom
= TYPE_DOMAIN (t
))
20098 if (tree max
= TYPE_MAX_VALUE (dom
))
20100 if (TREE_CODE (max
) == MINUS_EXPR
)
20101 max
= TREE_OPERAND (max
, 0);
20102 if (TREE_CODE (max
) == TEMPLATE_PARM_INDEX
)
20103 unify (tparms
, targs
, TREE_TYPE (max
), size_type_node
,
20104 UNIFY_ALLOW_NONE
, /*explain*/false);
20107 /* Keep walking. */
20111 /* Try to deduce any not-yet-deduced template type arguments from the type of
20112 an array bound. This is handled separately from unify because 14.8.2.5 says
20113 "The type of a type parameter is only deduced from an array bound if it is
20114 not otherwise deduced." */
20117 try_array_deduction (tree tparms
, tree targs
, tree parm
)
20119 tree_pair_s data
= { tparms
, targs
};
20120 hash_set
<tree
> visited
;
20121 for_each_template_parm (parm
, zero_r
, &data
, &visited
,
20122 /*nondeduced*/false, array_deduction_r
);
20125 /* Most parms like fn_type_unification.
20127 If SUBR is 1, we're being called recursively (to unify the
20128 arguments of a function or method parameter of a function
20131 CHECKS is a pointer to a vector of access checks encountered while
20132 substituting default template arguments. */
20135 type_unification_real (tree tparms
,
20139 unsigned int xnargs
,
20141 unification_kind_t strict
,
20143 vec
<deferred_access_check
, va_gc
> **checks
,
20148 int ntparms
= TREE_VEC_LENGTH (tparms
);
20149 int saw_undeduced
= 0;
20152 unsigned int nargs
;
20155 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
20156 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
20157 gcc_assert (ntparms
> 0);
20159 tree targs
= INNERMOST_TEMPLATE_ARGS (full_targs
);
20161 /* Reset the number of non-defaulted template arguments contained
20163 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
20171 while (parms
&& parms
!= void_list_node
20174 parm
= TREE_VALUE (parms
);
20176 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
20177 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
20178 /* For a function parameter pack that occurs at the end of the
20179 parameter-declaration-list, the type A of each remaining
20180 argument of the call is compared with the type P of the
20181 declarator-id of the function parameter pack. */
20184 parms
= TREE_CHAIN (parms
);
20186 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
20187 /* For a function parameter pack that does not occur at the
20188 end of the parameter-declaration-list, the type of the
20189 parameter pack is a non-deduced context. */
20195 if (unify_one_argument (tparms
, full_targs
, parm
, arg
, subr
, strict
,
20201 && parms
!= void_list_node
20202 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
20204 /* Unify the remaining arguments with the pack expansion type. */
20206 tree parmvec
= make_tree_vec (1);
20208 /* Allocate a TREE_VEC and copy in all of the arguments */
20209 argvec
= make_tree_vec (nargs
- ia
);
20210 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
20211 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
20213 /* Copy the parameter into parmvec. */
20214 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
20215 if (unify_pack_expansion (tparms
, full_targs
, parmvec
, argvec
, strict
,
20216 /*subr=*/subr
, explain_p
))
20219 /* Advance to the end of the list of parameters. */
20220 parms
= TREE_CHAIN (parms
);
20223 /* Fail if we've reached the end of the parm list, and more args
20224 are present, and the parm list isn't variadic. */
20225 if (ia
< nargs
&& parms
== void_list_node
)
20226 return unify_too_many_arguments (explain_p
, nargs
, ia
);
20227 /* Fail if parms are left and they don't have default values and
20228 they aren't all deduced as empty packs (c++/57397). This is
20229 consistent with sufficient_parms_p. */
20230 if (parms
&& parms
!= void_list_node
20231 && TREE_PURPOSE (parms
) == NULL_TREE
)
20233 unsigned int count
= nargs
;
20238 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
20241 p
= TREE_CHAIN (p
);
20243 while (p
&& p
!= void_list_node
);
20244 if (count
!= nargs
)
20245 return unify_too_few_arguments (explain_p
, ia
, count
,
20251 tsubst_flags_t complain
= (explain_p
20252 ? tf_warning_or_error
20254 bool tried_array_deduction
= (cxx_dialect
< cxx17
);
20256 for (i
= 0; i
< ntparms
; i
++)
20258 tree targ
= TREE_VEC_ELT (targs
, i
);
20259 tree tparm
= TREE_VEC_ELT (tparms
, i
);
20261 /* Clear the "incomplete" flags on all argument packs now so that
20262 substituting them into later default arguments works. */
20263 if (targ
&& ARGUMENT_PACK_P (targ
))
20265 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
20266 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
20269 if (targ
|| tparm
== error_mark_node
)
20271 tparm
= TREE_VALUE (tparm
);
20273 if (TREE_CODE (tparm
) == TYPE_DECL
20274 && !tried_array_deduction
)
20276 try_array_deduction (tparms
, targs
, xparms
);
20277 tried_array_deduction
= true;
20278 if (TREE_VEC_ELT (targs
, i
))
20282 /* If this is an undeduced nontype parameter that depends on
20283 a type parameter, try another pass; its type may have been
20284 deduced from a later argument than the one from which
20285 this parameter can be deduced. */
20286 if (TREE_CODE (tparm
) == PARM_DECL
20287 && uses_template_parms (TREE_TYPE (tparm
))
20288 && saw_undeduced
< 2)
20294 /* Core issue #226 (C++0x) [temp.deduct]:
20296 If a template argument has not been deduced, its
20297 default template argument, if any, is used.
20299 When we are in C++98 mode, TREE_PURPOSE will either
20300 be NULL_TREE or ERROR_MARK_NODE, so we do not need
20301 to explicitly check cxx_dialect here. */
20302 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
20303 /* OK, there is a default argument. Wait until after the
20304 conversion check to do substitution. */
20307 /* If the type parameter is a parameter pack, then it will
20308 be deduced to an empty parameter pack. */
20309 if (template_parameter_pack_p (tparm
))
20313 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
20315 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
20316 TREE_CONSTANT (arg
) = 1;
20319 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
20321 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
20323 TREE_VEC_ELT (targs
, i
) = arg
;
20327 return unify_parameter_deduction_failure (explain_p
, tparm
);
20330 /* DR 1391: All parameters have args, now check non-dependent parms for
20332 if (saw_undeduced
< 2)
20333 for (ia
= 0, parms
= xparms
, args
= xargs
, nargs
= xnargs
;
20334 parms
&& parms
!= void_list_node
&& ia
< nargs
; )
20336 parm
= TREE_VALUE (parms
);
20338 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
20339 && (!TREE_CHAIN (parms
)
20340 || TREE_CHAIN (parms
) == void_list_node
))
20341 /* For a function parameter pack that occurs at the end of the
20342 parameter-declaration-list, the type A of each remaining
20343 argument of the call is compared with the type P of the
20344 declarator-id of the function parameter pack. */
20347 parms
= TREE_CHAIN (parms
);
20349 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
20350 /* For a function parameter pack that does not occur at the
20351 end of the parameter-declaration-list, the type of the
20352 parameter pack is a non-deduced context. */
20358 if (uses_template_parms (parm
))
20360 if (check_non_deducible_conversion (parm
, arg
, strict
, flags
,
20365 /* Now substitute into the default template arguments. */
20366 for (i
= 0; i
< ntparms
; i
++)
20368 tree targ
= TREE_VEC_ELT (targs
, i
);
20369 tree tparm
= TREE_VEC_ELT (tparms
, i
);
20371 if (targ
|| tparm
== error_mark_node
)
20373 tree parm
= TREE_VALUE (tparm
);
20374 tree arg
= TREE_PURPOSE (tparm
);
20375 reopen_deferring_access_checks (*checks
);
20376 location_t save_loc
= input_location
;
20378 input_location
= DECL_SOURCE_LOCATION (parm
);
20379 if (saw_undeduced
== 1)
20380 ++processing_template_decl
;
20382 if (saw_undeduced
== 1
20383 && TREE_CODE (parm
) == PARM_DECL
20384 && uses_template_parms (TREE_TYPE (parm
)))
20386 /* The type of this non-type parameter depends on undeduced
20387 parameters. Don't try to use its default argument yet,
20388 but do check whether the arguments we already have cause
20389 substitution failure, so that that happens before we try
20390 later default arguments (78489). */
20391 tree type
= tsubst (TREE_TYPE (parm
), full_targs
, complain
,
20393 if (type
== error_mark_node
)
20394 arg
= error_mark_node
;
20400 arg
= tsubst_template_arg (arg
, full_targs
, complain
, NULL_TREE
);
20402 if (!uses_template_parms (arg
))
20403 arg
= convert_template_argument (parm
, arg
, full_targs
,
20404 complain
, i
, NULL_TREE
);
20405 else if (saw_undeduced
== 1)
20408 arg
= error_mark_node
;
20411 if (saw_undeduced
== 1)
20412 --processing_template_decl
;
20413 input_location
= save_loc
;
20414 *checks
= get_deferred_access_checks ();
20415 pop_deferring_access_checks ();
20417 if (arg
== error_mark_node
)
20421 TREE_VEC_ELT (targs
, i
) = arg
;
20422 /* The position of the first default template argument,
20423 is also the number of non-defaulted arguments in TARGS.
20425 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
20426 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
20430 if (saw_undeduced
++ == 1)
20434 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
20435 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
20437 return unify_success (explain_p
);
20440 /* Subroutine of type_unification_real. Args are like the variables
20441 at the call site. ARG is an overloaded function (or template-id);
20442 we try deducing template args from each of the overloads, and if
20443 only one succeeds, we go with that. Modifies TARGS and returns
20444 true on success. */
20447 resolve_overloaded_unification (tree tparms
,
20451 unification_kind_t strict
,
20455 tree tempargs
= copy_node (targs
);
20457 tree goodfn
= NULL_TREE
;
20460 if (TREE_CODE (arg
) == ADDR_EXPR
)
20462 arg
= TREE_OPERAND (arg
, 0);
20468 if (TREE_CODE (arg
) == COMPONENT_REF
)
20469 /* Handle `&x' where `x' is some static or non-static member
20471 arg
= TREE_OPERAND (arg
, 1);
20473 if (TREE_CODE (arg
) == OFFSET_REF
)
20474 arg
= TREE_OPERAND (arg
, 1);
20476 /* Strip baselink information. */
20477 if (BASELINK_P (arg
))
20478 arg
= BASELINK_FUNCTIONS (arg
);
20480 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
20482 /* If we got some explicit template args, we need to plug them into
20483 the affected templates before we try to unify, in case the
20484 explicit args will completely resolve the templates in question. */
20487 tree expl_subargs
= TREE_OPERAND (arg
, 1);
20488 arg
= TREE_OPERAND (arg
, 0);
20490 for (lkp_iterator
iter (arg
); iter
; ++iter
)
20493 tree subargs
, elem
;
20495 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
20498 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
20499 expl_subargs
, NULL_TREE
, tf_none
,
20500 /*require_all_args=*/true,
20501 /*use_default_args=*/true);
20502 if (subargs
!= error_mark_node
20503 && !any_dependent_template_arguments_p (subargs
))
20505 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
20506 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
20507 elem
, strict
, sub_strict
, addr_p
, explain_p
)
20508 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
20517 /* If no templates (or more than one) are fully resolved by the
20518 explicit arguments, this template-id is a non-deduced context; it
20519 could still be OK if we deduce all template arguments for the
20520 enclosing call through other arguments. */
20524 else if (TREE_CODE (arg
) != OVERLOAD
20525 && TREE_CODE (arg
) != FUNCTION_DECL
)
20526 /* If ARG is, for example, "(0, &f)" then its type will be unknown
20527 -- but the deduction does not succeed because the expression is
20528 not just the function on its own. */
20531 for (lkp_iterator
iter (arg
); iter
; ++iter
)
20534 if (try_one_overload (tparms
, targs
, tempargs
, parm
, TREE_TYPE (fn
),
20535 strict
, sub_strict
, addr_p
, explain_p
)
20536 && (!goodfn
|| !decls_match (goodfn
, fn
)))
20543 /* [temp.deduct.type] A template-argument can be deduced from a pointer
20544 to function or pointer to member function argument if the set of
20545 overloaded functions does not contain function templates and at most
20546 one of a set of overloaded functions provides a unique match.
20548 So if we found multiple possibilities, we return success but don't
20549 deduce anything. */
20553 int i
= TREE_VEC_LENGTH (targs
);
20555 if (TREE_VEC_ELT (tempargs
, i
))
20557 tree old
= TREE_VEC_ELT (targs
, i
);
20558 tree new_
= TREE_VEC_ELT (tempargs
, i
);
20559 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
20560 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
20561 /* Don't forget explicit template arguments in a pack. */
20562 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
20563 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
20564 TREE_VEC_ELT (targs
, i
) = new_
;
20573 /* Core DR 115: In contexts where deduction is done and fails, or in
20574 contexts where deduction is not done, if a template argument list is
20575 specified and it, along with any default template arguments, identifies
20576 a single function template specialization, then the template-id is an
20577 lvalue for the function template specialization. */
20580 resolve_nondeduced_context (tree orig_expr
, tsubst_flags_t complain
)
20582 tree expr
, offset
, baselink
;
20585 if (!type_unknown_p (orig_expr
))
20590 offset
= NULL_TREE
;
20591 baselink
= NULL_TREE
;
20593 if (TREE_CODE (expr
) == ADDR_EXPR
)
20595 expr
= TREE_OPERAND (expr
, 0);
20598 if (TREE_CODE (expr
) == OFFSET_REF
)
20601 expr
= TREE_OPERAND (expr
, 1);
20603 if (BASELINK_P (expr
))
20606 expr
= BASELINK_FUNCTIONS (expr
);
20609 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
20612 tree goodfn
= NULL_TREE
;
20614 /* If we got some explicit template args, we need to plug them into
20615 the affected templates before we try to unify, in case the
20616 explicit args will completely resolve the templates in question. */
20618 tree expl_subargs
= TREE_OPERAND (expr
, 1);
20619 tree arg
= TREE_OPERAND (expr
, 0);
20620 tree badfn
= NULL_TREE
;
20621 tree badargs
= NULL_TREE
;
20623 for (lkp_iterator
iter (arg
); iter
; ++iter
)
20626 tree subargs
, elem
;
20628 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
20631 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
20632 expl_subargs
, NULL_TREE
, tf_none
,
20633 /*require_all_args=*/true,
20634 /*use_default_args=*/true);
20635 if (subargs
!= error_mark_node
20636 && !any_dependent_template_arguments_p (subargs
))
20638 elem
= instantiate_template (fn
, subargs
, tf_none
);
20639 if (elem
== error_mark_node
)
20644 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
20653 mark_used (goodfn
);
20656 expr
= build_baselink (BASELINK_BINFO (baselink
),
20657 BASELINK_ACCESS_BINFO (baselink
),
20658 expr
, BASELINK_OPTYPE (baselink
));
20662 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
20663 expr
= build_offset_ref (base
, expr
, addr
, complain
);
20666 expr
= cp_build_addr_expr (expr
, complain
);
20669 else if (good
== 0 && badargs
&& (complain
& tf_error
))
20670 /* There were no good options and at least one bad one, so let the
20671 user know what the problem is. */
20672 instantiate_template (badfn
, badargs
, complain
);
20677 /* Subroutine of resolve_overloaded_unification; does deduction for a single
20678 overload. Fills TARGS with any deduced arguments, or error_mark_node if
20679 different overloads deduce different arguments for a given parm.
20680 ADDR_P is true if the expression for which deduction is being
20681 performed was of the form "& fn" rather than simply "fn".
20683 Returns 1 on success. */
20686 try_one_overload (tree tparms
,
20691 unification_kind_t strict
,
20700 if (arg
== error_mark_node
)
20703 /* [temp.deduct.type] A template-argument can be deduced from a pointer
20704 to function or pointer to member function argument if the set of
20705 overloaded functions does not contain function templates and at most
20706 one of a set of overloaded functions provides a unique match.
20708 So if this is a template, just return success. */
20710 if (uses_template_parms (arg
))
20713 if (TREE_CODE (arg
) == METHOD_TYPE
)
20714 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
20716 arg
= build_pointer_type (arg
);
20718 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
20720 /* We don't copy orig_targs for this because if we have already deduced
20721 some template args from previous args, unify would complain when we
20722 try to deduce a template parameter for the same argument, even though
20723 there isn't really a conflict. */
20724 nargs
= TREE_VEC_LENGTH (targs
);
20725 tempargs
= make_tree_vec (nargs
);
20727 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
20730 /* First make sure we didn't deduce anything that conflicts with
20731 explicitly specified args. */
20732 for (i
= nargs
; i
--; )
20734 tree elt
= TREE_VEC_ELT (tempargs
, i
);
20735 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
20739 else if (uses_template_parms (elt
))
20740 /* Since we're unifying against ourselves, we will fill in
20741 template args used in the function parm list with our own
20742 template parms. Discard them. */
20743 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
20744 else if (oldelt
&& ARGUMENT_PACK_P (oldelt
))
20746 /* Check that the argument at each index of the deduced argument pack
20747 is equivalent to the corresponding explicitly specified argument.
20748 We may have deduced more arguments than were explicitly specified,
20751 /* We used to assert ARGUMENT_PACK_INCOMPLETE_P (oldelt) here, but
20752 that's wrong if we deduce the same argument pack from multiple
20753 function arguments: it's only incomplete the first time. */
20755 tree explicit_pack
= ARGUMENT_PACK_ARGS (oldelt
);
20756 tree deduced_pack
= ARGUMENT_PACK_ARGS (elt
);
20758 if (TREE_VEC_LENGTH (deduced_pack
)
20759 < TREE_VEC_LENGTH (explicit_pack
))
20762 for (int j
= 0; j
< TREE_VEC_LENGTH (explicit_pack
); j
++)
20763 if (!template_args_equal (TREE_VEC_ELT (explicit_pack
, j
),
20764 TREE_VEC_ELT (deduced_pack
, j
)))
20767 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
20771 for (i
= nargs
; i
--; )
20773 tree elt
= TREE_VEC_ELT (tempargs
, i
);
20776 TREE_VEC_ELT (targs
, i
) = elt
;
20782 /* PARM is a template class (perhaps with unbound template
20783 parameters). ARG is a fully instantiated type. If ARG can be
20784 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
20785 TARGS are as for unify. */
20788 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
20791 tree copy_of_targs
;
20793 if (!CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
20795 else if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
20796 /* Matches anything. */;
20797 else if (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
20798 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
)))
20801 /* We need to make a new template argument vector for the call to
20802 unify. If we used TARGS, we'd clutter it up with the result of
20803 the attempted unification, even if this class didn't work out.
20804 We also don't want to commit ourselves to all the unifications
20805 we've already done, since unification is supposed to be done on
20806 an argument-by-argument basis. In other words, consider the
20807 following pathological case:
20809 template <int I, int J, int K>
20812 template <int I, int J>
20813 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
20815 template <int I, int J, int K>
20816 void f(S<I, J, K>, S<I, I, I>);
20825 Now, by the time we consider the unification involving `s2', we
20826 already know that we must have `f<0, 0, 0>'. But, even though
20827 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
20828 because there are two ways to unify base classes of S<0, 1, 2>
20829 with S<I, I, I>. If we kept the already deduced knowledge, we
20830 would reject the possibility I=1. */
20831 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
20833 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
20835 if (unify_bound_ttp_args (tparms
, copy_of_targs
, parm
, arg
, explain_p
))
20840 /* If unification failed, we're done. */
20841 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
20842 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
20848 /* Given a template type PARM and a class type ARG, find the unique
20849 base type in ARG that is an instance of PARM. We do not examine
20850 ARG itself; only its base-classes. If there is not exactly one
20851 appropriate base class, return NULL_TREE. PARM may be the type of
20852 a partial specialization, as well as a plain template type. Used
20855 static enum template_base_result
20856 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
20857 bool explain_p
, tree
*result
)
20859 tree rval
= NULL_TREE
;
20862 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
20864 binfo
= TYPE_BINFO (complete_type (arg
));
20867 /* The type could not be completed. */
20868 *result
= NULL_TREE
;
20869 return tbr_incomplete_type
;
20872 /* Walk in inheritance graph order. The search order is not
20873 important, and this avoids multiple walks of virtual bases. */
20874 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
20876 tree r
= try_class_unification (tparms
, targs
, parm
,
20877 BINFO_TYPE (binfo
), explain_p
);
20881 /* If there is more than one satisfactory baseclass, then:
20885 If they yield more than one possible deduced A, the type
20889 if (rval
&& !same_type_p (r
, rval
))
20891 *result
= NULL_TREE
;
20892 return tbr_ambiguous_baseclass
;
20900 return tbr_success
;
20903 /* Returns the level of DECL, which declares a template parameter. */
20906 template_decl_level (tree decl
)
20908 switch (TREE_CODE (decl
))
20911 case TEMPLATE_DECL
:
20912 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
20915 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
20918 gcc_unreachable ();
20923 /* Decide whether ARG can be unified with PARM, considering only the
20924 cv-qualifiers of each type, given STRICT as documented for unify.
20925 Returns nonzero iff the unification is OK on that basis. */
20928 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
20930 int arg_quals
= cp_type_quals (arg
);
20931 int parm_quals
= cp_type_quals (parm
);
20933 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
20934 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
20936 /* Although a CVR qualifier is ignored when being applied to a
20937 substituted template parameter ([8.3.2]/1 for example), that
20938 does not allow us to unify "const T" with "int&" because both
20939 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
20940 It is ok when we're allowing additional CV qualifiers
20941 at the outer level [14.8.2.1]/3,1st bullet. */
20942 if ((TYPE_REF_P (arg
)
20943 || TREE_CODE (arg
) == FUNCTION_TYPE
20944 || TREE_CODE (arg
) == METHOD_TYPE
)
20945 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
20948 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
20949 && (parm_quals
& TYPE_QUAL_RESTRICT
))
20953 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
20954 && (arg_quals
& parm_quals
) != parm_quals
)
20957 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
20958 && (parm_quals
& arg_quals
) != arg_quals
)
20964 /* Determines the LEVEL and INDEX for the template parameter PARM. */
20966 template_parm_level_and_index (tree parm
, int* level
, int* index
)
20968 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
20969 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
20970 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
20972 *index
= TEMPLATE_TYPE_IDX (parm
);
20973 *level
= TEMPLATE_TYPE_LEVEL (parm
);
20977 *index
= TEMPLATE_PARM_IDX (parm
);
20978 *level
= TEMPLATE_PARM_LEVEL (parm
);
20982 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
20984 if (unify (TP, TA, P, A, S, EP)) \
20988 /* Unifies the remaining arguments in PACKED_ARGS with the pack
20989 expansion at the end of PACKED_PARMS. Returns 0 if the type
20990 deduction succeeds, 1 otherwise. STRICT is the same as in
20991 fn_type_unification. CALL_ARGS_P is true iff PACKED_ARGS is actually a
20992 function call argument list. We'll need to adjust the arguments to make them
20993 types. SUBR tells us if this is from a recursive call to
20994 type_unification_real, or for comparing two template argument
20998 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
20999 tree packed_args
, unification_kind_t strict
,
21000 bool subr
, bool explain_p
)
21003 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
21004 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
21005 tree pack
, packs
= NULL_TREE
;
21006 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
21008 /* Add in any args remembered from an earlier partial instantiation. */
21009 targs
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (parm
), targs
);
21010 int levels
= TMPL_ARGS_DEPTH (targs
);
21012 packed_args
= expand_template_argument_pack (packed_args
);
21014 int len
= TREE_VEC_LENGTH (packed_args
);
21016 /* Determine the parameter packs we will be deducing from the
21017 pattern, and record their current deductions. */
21018 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
21019 pack
; pack
= TREE_CHAIN (pack
))
21021 tree parm_pack
= TREE_VALUE (pack
);
21024 /* Only template parameter packs can be deduced, not e.g. function
21025 parameter packs or __bases or __integer_pack. */
21026 if (!TEMPLATE_PARM_P (parm_pack
))
21029 /* Determine the index and level of this parameter pack. */
21030 template_parm_level_and_index (parm_pack
, &level
, &idx
);
21031 if (level
< levels
)
21034 /* Keep track of the parameter packs and their corresponding
21036 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
21037 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
21040 /* Loop through all of the arguments that have not yet been
21041 unified and unify each with the pattern. */
21042 for (i
= start
; i
< len
; i
++)
21045 bool any_explicit
= false;
21046 tree arg
= TREE_VEC_ELT (packed_args
, i
);
21048 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
21049 or the element of its argument pack at the current index if
21050 this argument was explicitly specified. */
21051 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
21055 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
21058 if (TREE_VALUE (pack
)
21059 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
21060 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
21062 any_explicit
= true;
21063 arg
= TREE_VEC_ELT (pargs
, i
- start
);
21065 TMPL_ARG (targs
, level
, idx
) = arg
;
21068 /* If we had explicit template arguments, substitute them into the
21069 pattern before deduction. */
21072 /* Some arguments might still be unspecified or dependent. */
21074 ++processing_template_decl
;
21075 dependent
= any_dependent_template_arguments_p (targs
);
21077 --processing_template_decl
;
21078 parm
= tsubst (pattern
, targs
,
21079 explain_p
? tf_warning_or_error
: tf_none
,
21082 --processing_template_decl
;
21083 if (parm
== error_mark_node
)
21089 /* Unify the pattern with the current argument. */
21090 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
21094 /* For each parameter pack, collect the deduced value. */
21095 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
21098 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
21100 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
21101 TMPL_ARG (targs
, level
, idx
);
21105 /* Verify that the results of unification with the parameter packs
21106 produce results consistent with what we've seen before, and make
21107 the deduced argument packs available. */
21108 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
21110 tree old_pack
= TREE_VALUE (pack
);
21111 tree new_args
= TREE_TYPE (pack
);
21112 int i
, len
= TREE_VEC_LENGTH (new_args
);
21114 bool nondeduced_p
= false;
21116 /* By default keep the original deduced argument pack.
21117 If necessary, more specific code is going to update the
21118 resulting deduced argument later down in this function. */
21119 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
21120 TMPL_ARG (targs
, level
, idx
) = old_pack
;
21122 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
21123 actually deduce anything. */
21124 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
21125 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
21126 nondeduced_p
= true;
21130 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
21132 /* If we had fewer function args than explicit template args,
21133 just use the explicits. */
21134 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
21135 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
21136 if (len
< explicit_len
)
21137 new_args
= explicit_args
;
21143 /* Build the deduced *_ARGUMENT_PACK. */
21144 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
21146 result
= make_node (NONTYPE_ARGUMENT_PACK
);
21147 TREE_CONSTANT (result
) = 1;
21150 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
21152 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
21154 /* Note the deduced argument packs for this parameter
21156 TMPL_ARG (targs
, level
, idx
) = result
;
21158 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
21159 && (ARGUMENT_PACK_ARGS (old_pack
)
21160 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
21162 /* We only had the explicitly-provided arguments before, but
21163 now we have a complete set of arguments. */
21164 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
21166 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
21167 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
21168 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
21172 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
21173 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
21175 if (!comp_template_args (old_args
, new_args
,
21176 &bad_old_arg
, &bad_new_arg
))
21177 /* Inconsistent unification of this parameter pack. */
21178 return unify_parameter_pack_inconsistent (explain_p
,
21184 return unify_success (explain_p
);
21187 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
21188 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
21189 parameters and return value are as for unify. */
21192 unify_array_domain (tree tparms
, tree targs
,
21193 tree parm_dom
, tree arg_dom
,
21201 /* Our representation of array types uses "N - 1" as the
21202 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
21203 not an integer constant. We cannot unify arbitrarily
21204 complex expressions, so we eliminate the MINUS_EXPRs
21206 parm_max
= TYPE_MAX_VALUE (parm_dom
);
21207 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
21210 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
21211 parm_max
= TREE_OPERAND (parm_max
, 0);
21213 arg_max
= TYPE_MAX_VALUE (arg_dom
);
21214 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
21217 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
21218 trying to unify the type of a variable with the type
21219 of a template parameter. For example:
21221 template <unsigned int N>
21222 void f (char (&) [N]);
21229 Here, the type of the ARG will be "int [g(i)]", and
21230 may be a SAVE_EXPR, etc. */
21231 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
21232 return unify_vla_arg (explain_p
, arg_dom
);
21233 arg_max
= TREE_OPERAND (arg_max
, 0);
21236 /* If only one of the bounds used a MINUS_EXPR, compensate
21237 by adding one to the other bound. */
21238 if (parm_cst
&& !arg_cst
)
21239 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
21243 else if (arg_cst
&& !parm_cst
)
21244 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
21249 return unify (tparms
, targs
, parm_max
, arg_max
,
21250 UNIFY_ALLOW_INTEGER
, explain_p
);
21253 /* Returns whether T, a P or A in unify, is a type, template or expression. */
21255 enum pa_kind_t
{ pa_type
, pa_tmpl
, pa_expr
};
21260 if (PACK_EXPANSION_P (t
))
21261 t
= PACK_EXPANSION_PATTERN (t
);
21262 if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
21263 || TREE_CODE (t
) == UNBOUND_CLASS_TEMPLATE
21264 || DECL_TYPE_TEMPLATE_P (t
))
21266 else if (TYPE_P (t
))
21272 /* Deduce the value of template parameters. TPARMS is the (innermost)
21273 set of template parameters to a template. TARGS is the bindings
21274 for those template parameters, as determined thus far; TARGS may
21275 include template arguments for outer levels of template parameters
21276 as well. PARM is a parameter to a template function, or a
21277 subcomponent of that parameter; ARG is the corresponding argument.
21278 This function attempts to match PARM with ARG in a manner
21279 consistent with the existing assignments in TARGS. If more values
21280 are deduced, then TARGS is updated.
21282 Returns 0 if the type deduction succeeds, 1 otherwise. The
21283 parameter STRICT is a bitwise or of the following flags:
21286 Require an exact match between PARM and ARG.
21287 UNIFY_ALLOW_MORE_CV_QUAL:
21288 Allow the deduced ARG to be more cv-qualified (by qualification
21289 conversion) than ARG.
21290 UNIFY_ALLOW_LESS_CV_QUAL:
21291 Allow the deduced ARG to be less cv-qualified than ARG.
21292 UNIFY_ALLOW_DERIVED:
21293 Allow the deduced ARG to be a template base class of ARG,
21294 or a pointer to a template base class of the type pointed to by
21296 UNIFY_ALLOW_INTEGER:
21297 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
21298 case for more information.
21299 UNIFY_ALLOW_OUTER_LEVEL:
21300 This is the outermost level of a deduction. Used to determine validity
21301 of qualification conversions. A valid qualification conversion must
21302 have const qualified pointers leading up to the inner type which
21303 requires additional CV quals, except at the outer level, where const
21304 is not required [conv.qual]. It would be normal to set this flag in
21305 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
21306 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
21307 This is the outermost level of a deduction, and PARM can be more CV
21308 qualified at this point.
21309 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
21310 This is the outermost level of a deduction, and PARM can be less CV
21311 qualified at this point. */
21314 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
21320 int strict_in
= strict
;
21321 tsubst_flags_t complain
= (explain_p
21322 ? tf_warning_or_error
21325 /* I don't think this will do the right thing with respect to types.
21326 But the only case I've seen it in so far has been array bounds, where
21327 signedness is the only information lost, and I think that will be
21329 while (CONVERT_EXPR_P (parm
))
21330 parm
= TREE_OPERAND (parm
, 0);
21332 if (arg
== error_mark_node
)
21333 return unify_invalid (explain_p
);
21334 if (arg
== unknown_type_node
21335 || arg
== init_list_type_node
)
21336 /* We can't deduce anything from this, but we might get all the
21337 template args from other function args. */
21338 return unify_success (explain_p
);
21340 if (parm
== any_targ_node
|| arg
== any_targ_node
)
21341 return unify_success (explain_p
);
21343 /* If PARM uses template parameters, then we can't bail out here,
21344 even if ARG == PARM, since we won't record unifications for the
21345 template parameters. We might need them if we're trying to
21346 figure out which of two things is more specialized. */
21347 if (arg
== parm
&& !uses_template_parms (parm
))
21348 return unify_success (explain_p
);
21350 /* Handle init lists early, so the rest of the function can assume
21351 we're dealing with a type. */
21352 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
21356 tree orig_parm
= parm
;
21358 /* Replace T with std::initializer_list<T> for deduction. */
21359 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
21360 && flag_deduce_init_list
)
21361 parm
= listify (parm
);
21363 if (!is_std_init_list (parm
)
21364 && TREE_CODE (parm
) != ARRAY_TYPE
)
21365 /* We can only deduce from an initializer list argument if the
21366 parameter is std::initializer_list or an array; otherwise this
21367 is a non-deduced context. */
21368 return unify_success (explain_p
);
21370 if (TREE_CODE (parm
) == ARRAY_TYPE
)
21371 elttype
= TREE_TYPE (parm
);
21374 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
21375 /* Deduction is defined in terms of a single type, so just punt
21376 on the (bizarre) std::initializer_list<T...>. */
21377 if (PACK_EXPANSION_P (elttype
))
21378 return unify_success (explain_p
);
21381 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
21383 int elt_strict
= strict
;
21385 if (elt
== error_mark_node
)
21386 return unify_invalid (explain_p
);
21388 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
21390 tree type
= TREE_TYPE (elt
);
21391 if (type
== error_mark_node
)
21392 return unify_invalid (explain_p
);
21393 /* It should only be possible to get here for a call. */
21394 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
21395 elt_strict
|= maybe_adjust_types_for_deduction
21396 (DEDUCE_CALL
, &elttype
, &type
, elt
);
21400 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
21404 if (TREE_CODE (parm
) == ARRAY_TYPE
21405 && deducible_array_bound (TYPE_DOMAIN (parm
)))
21407 /* Also deduce from the length of the initializer list. */
21408 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
21409 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
21410 if (idx
== error_mark_node
)
21411 return unify_invalid (explain_p
);
21412 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
21416 /* If the std::initializer_list<T> deduction worked, replace the
21417 deduced A with std::initializer_list<A>. */
21418 if (orig_parm
!= parm
)
21420 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
21421 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
21422 targ
= listify (targ
);
21423 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
21425 return unify_success (explain_p
);
21428 /* If parm and arg aren't the same kind of thing (template, type, or
21429 expression), fail early. */
21430 if (pa_kind (parm
) != pa_kind (arg
))
21431 return unify_invalid (explain_p
);
21433 /* Immediately reject some pairs that won't unify because of
21434 cv-qualification mismatches. */
21435 if (TREE_CODE (arg
) == TREE_CODE (parm
)
21437 /* It is the elements of the array which hold the cv quals of an array
21438 type, and the elements might be template type parms. We'll check
21439 when we recurse. */
21440 && TREE_CODE (arg
) != ARRAY_TYPE
21441 /* We check the cv-qualifiers when unifying with template type
21442 parameters below. We want to allow ARG `const T' to unify with
21443 PARM `T' for example, when computing which of two templates
21444 is more specialized, for example. */
21445 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
21446 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
21447 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
21449 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
21450 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
21451 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
21452 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
21453 strict
&= ~UNIFY_ALLOW_DERIVED
;
21454 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
21455 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
21457 switch (TREE_CODE (parm
))
21459 case TYPENAME_TYPE
:
21461 case UNBOUND_CLASS_TEMPLATE
:
21462 /* In a type which contains a nested-name-specifier, template
21463 argument values cannot be deduced for template parameters used
21464 within the nested-name-specifier. */
21465 return unify_success (explain_p
);
21467 case TEMPLATE_TYPE_PARM
:
21468 case TEMPLATE_TEMPLATE_PARM
:
21469 case BOUND_TEMPLATE_TEMPLATE_PARM
:
21470 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
21471 if (error_operand_p (tparm
))
21472 return unify_invalid (explain_p
);
21474 if (TEMPLATE_TYPE_LEVEL (parm
)
21475 != template_decl_level (tparm
))
21476 /* The PARM is not one we're trying to unify. Just check
21477 to see if it matches ARG. */
21479 if (TREE_CODE (arg
) == TREE_CODE (parm
)
21480 && (is_auto (parm
) ? is_auto (arg
)
21481 : same_type_p (parm
, arg
)))
21482 return unify_success (explain_p
);
21484 return unify_type_mismatch (explain_p
, parm
, arg
);
21486 idx
= TEMPLATE_TYPE_IDX (parm
);
21487 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
21488 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
21489 if (error_operand_p (tparm
))
21490 return unify_invalid (explain_p
);
21492 /* Check for mixed types and values. */
21493 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
21494 && TREE_CODE (tparm
) != TYPE_DECL
)
21495 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
21496 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
21497 gcc_unreachable ();
21499 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
21501 if ((strict_in
& UNIFY_ALLOW_DERIVED
)
21502 && CLASS_TYPE_P (arg
))
21504 /* First try to match ARG directly. */
21505 tree t
= try_class_unification (tparms
, targs
, parm
, arg
,
21509 /* Otherwise, look for a suitable base of ARG, as below. */
21510 enum template_base_result r
;
21511 r
= get_template_base (tparms
, targs
, parm
, arg
,
21514 return unify_no_common_base (explain_p
, r
, parm
, arg
);
21518 /* ARG must be constructed from a template class or a template
21519 template parameter. */
21520 else if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
21521 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
21522 return unify_template_deduction_failure (explain_p
, parm
, arg
);
21524 /* Deduce arguments T, i from TT<T> or TT<i>. */
21525 if (unify_bound_ttp_args (tparms
, targs
, parm
, arg
, explain_p
))
21528 arg
= TYPE_TI_TEMPLATE (arg
);
21530 /* Fall through to deduce template name. */
21533 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
21534 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
21536 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
21538 /* Simple cases: Value already set, does match or doesn't. */
21539 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
21540 return unify_success (explain_p
);
21542 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
21546 /* If PARM is `const T' and ARG is only `int', we don't have
21547 a match unless we are allowing additional qualification.
21548 If ARG is `const int' and PARM is just `T' that's OK;
21549 that binds `const int' to `T'. */
21550 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
21552 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
21554 /* Consider the case where ARG is `const volatile int' and
21555 PARM is `const T'. Then, T should be `volatile int'. */
21556 arg
= cp_build_qualified_type_real
21557 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
21558 if (arg
== error_mark_node
)
21559 return unify_invalid (explain_p
);
21561 /* Simple cases: Value already set, does match or doesn't. */
21562 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
21563 return unify_success (explain_p
);
21565 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
21567 /* Make sure that ARG is not a variable-sized array. (Note
21568 that were talking about variable-sized arrays (like
21569 `int[n]'), rather than arrays of unknown size (like
21570 `int[]').) We'll get very confused by such a type since
21571 the bound of the array is not constant, and therefore
21572 not mangleable. Besides, such types are not allowed in
21573 ISO C++, so we can do as we please here. We do allow
21574 them for 'auto' deduction, since that isn't ABI-exposed. */
21575 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
21576 return unify_vla_arg (explain_p
, arg
);
21578 /* Strip typedefs as in convert_template_argument. */
21579 arg
= canonicalize_type_argument (arg
, tf_none
);
21582 /* If ARG is a parameter pack or an expansion, we cannot unify
21583 against it unless PARM is also a parameter pack. */
21584 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
21585 && !template_parameter_pack_p (parm
))
21586 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
21588 /* If the argument deduction results is a METHOD_TYPE,
21589 then there is a problem.
21590 METHOD_TYPE doesn't map to any real C++ type the result of
21591 the deduction can not be of that type. */
21592 if (TREE_CODE (arg
) == METHOD_TYPE
)
21593 return unify_method_type_error (explain_p
, arg
);
21595 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
21596 return unify_success (explain_p
);
21598 case TEMPLATE_PARM_INDEX
:
21599 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
21600 if (error_operand_p (tparm
))
21601 return unify_invalid (explain_p
);
21603 if (TEMPLATE_PARM_LEVEL (parm
)
21604 != template_decl_level (tparm
))
21606 /* The PARM is not one we're trying to unify. Just check
21607 to see if it matches ARG. */
21608 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
21609 && cp_tree_equal (parm
, arg
));
21611 unify_expression_unequal (explain_p
, parm
, arg
);
21615 idx
= TEMPLATE_PARM_IDX (parm
);
21616 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
21620 if ((strict
& UNIFY_ALLOW_INTEGER
)
21621 && TREE_TYPE (targ
) && TREE_TYPE (arg
)
21622 && CP_INTEGRAL_TYPE_P (TREE_TYPE (targ
)))
21623 /* We're deducing from an array bound, the type doesn't matter. */
21624 arg
= fold_convert (TREE_TYPE (targ
), arg
);
21625 int x
= !cp_tree_equal (targ
, arg
);
21627 unify_inconsistency (explain_p
, parm
, targ
, arg
);
21631 /* [temp.deduct.type] If, in the declaration of a function template
21632 with a non-type template-parameter, the non-type
21633 template-parameter is used in an expression in the function
21634 parameter-list and, if the corresponding template-argument is
21635 deduced, the template-argument type shall match the type of the
21636 template-parameter exactly, except that a template-argument
21637 deduced from an array bound may be of any integral type.
21638 The non-type parameter might use already deduced type parameters. */
21639 tparm
= TREE_TYPE (parm
);
21640 if (TEMPLATE_PARM_LEVEL (parm
) > TMPL_ARGS_DEPTH (targs
))
21641 /* We don't have enough levels of args to do any substitution. This
21642 can happen in the context of -fnew-ttp-matching. */;
21645 ++processing_template_decl
;
21646 tparm
= tsubst (tparm
, targs
, tf_none
, NULL_TREE
);
21647 --processing_template_decl
;
21649 if (tree a
= type_uses_auto (tparm
))
21651 tparm
= do_auto_deduction (tparm
, arg
, a
, complain
, adc_unify
);
21652 if (tparm
== error_mark_node
)
21657 if (!TREE_TYPE (arg
))
21658 /* Template-parameter dependent expression. Just accept it for now.
21659 It will later be processed in convert_template_argument. */
21661 else if (same_type_p (non_reference (TREE_TYPE (arg
)),
21662 non_reference (tparm
)))
21664 else if ((strict
& UNIFY_ALLOW_INTEGER
)
21665 && CP_INTEGRAL_TYPE_P (tparm
))
21666 /* Convert the ARG to the type of PARM; the deduced non-type
21667 template argument must exactly match the types of the
21668 corresponding parameter. */
21669 arg
= fold (build_nop (tparm
, arg
));
21670 else if (uses_template_parms (tparm
))
21672 /* We haven't deduced the type of this parameter yet. */
21673 if (cxx_dialect
>= cxx17
21674 /* We deduce from array bounds in try_array_deduction. */
21675 && !(strict
& UNIFY_ALLOW_INTEGER
))
21677 /* Deduce it from the non-type argument. */
21678 tree atype
= TREE_TYPE (arg
);
21679 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
21681 UNIFY_ALLOW_NONE
, explain_p
);
21684 /* Try again later. */
21685 return unify_success (explain_p
);
21688 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
21690 /* If ARG is a parameter pack or an expansion, we cannot unify
21691 against it unless PARM is also a parameter pack. */
21692 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
21693 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
21694 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
21697 bool removed_attr
= false;
21698 arg
= strip_typedefs_expr (arg
, &removed_attr
);
21700 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
21701 return unify_success (explain_p
);
21705 /* A pointer-to-member constant can be unified only with
21706 another constant. */
21707 if (TREE_CODE (arg
) != PTRMEM_CST
)
21708 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
21710 /* Just unify the class member. It would be useless (and possibly
21711 wrong, depending on the strict flags) to unify also
21712 PTRMEM_CST_CLASS, because we want to be sure that both parm and
21713 arg refer to the same variable, even if through different
21714 classes. For instance:
21716 struct A { int x; };
21719 Unification of &A::x and &B::x must succeed. */
21720 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
21721 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
21726 if (!TYPE_PTR_P (arg
))
21727 return unify_type_mismatch (explain_p
, parm
, arg
);
21729 /* [temp.deduct.call]
21731 A can be another pointer or pointer to member type that can
21732 be converted to the deduced A via a qualification
21733 conversion (_conv.qual_).
21735 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
21736 This will allow for additional cv-qualification of the
21737 pointed-to types if appropriate. */
21739 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
21740 /* The derived-to-base conversion only persists through one
21741 level of pointers. */
21742 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
21744 return unify (tparms
, targs
, TREE_TYPE (parm
),
21745 TREE_TYPE (arg
), strict
, explain_p
);
21748 case REFERENCE_TYPE
:
21749 if (!TYPE_REF_P (arg
))
21750 return unify_type_mismatch (explain_p
, parm
, arg
);
21751 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
21752 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
21755 if (TREE_CODE (arg
) != ARRAY_TYPE
)
21756 return unify_type_mismatch (explain_p
, parm
, arg
);
21757 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
21758 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
21759 return unify_type_mismatch (explain_p
, parm
, arg
);
21760 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
21761 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
21762 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
21763 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
21764 TYPE_DOMAIN (arg
), explain_p
);
21765 return unify_success (explain_p
);
21772 case ENUMERAL_TYPE
:
21775 if (TREE_CODE (arg
) != TREE_CODE (parm
))
21776 return unify_type_mismatch (explain_p
, parm
, arg
);
21778 /* We have already checked cv-qualification at the top of the
21780 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
21781 return unify_type_mismatch (explain_p
, parm
, arg
);
21783 /* As far as unification is concerned, this wins. Later checks
21784 will invalidate it if necessary. */
21785 return unify_success (explain_p
);
21787 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
21788 /* Type INTEGER_CST can come from ordinary constant template args. */
21790 while (CONVERT_EXPR_P (arg
))
21791 arg
= TREE_OPERAND (arg
, 0);
21793 if (TREE_CODE (arg
) != INTEGER_CST
)
21794 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
21795 return (tree_int_cst_equal (parm
, arg
)
21796 ? unify_success (explain_p
)
21797 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
21801 int i
, len
, argslen
;
21802 int parm_variadic_p
= 0;
21804 if (TREE_CODE (arg
) != TREE_VEC
)
21805 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
21807 len
= TREE_VEC_LENGTH (parm
);
21808 argslen
= TREE_VEC_LENGTH (arg
);
21810 /* Check for pack expansions in the parameters. */
21811 for (i
= 0; i
< len
; ++i
)
21813 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
21816 /* We can unify against something with a trailing
21818 parm_variadic_p
= 1;
21820 /* [temp.deduct.type]/9: If the template argument list of
21821 P contains a pack expansion that is not the last
21822 template argument, the entire template argument list
21823 is a non-deduced context. */
21824 return unify_success (explain_p
);
21828 /* If we don't have enough arguments to satisfy the parameters
21829 (not counting the pack expression at the end), or we have
21830 too many arguments for a parameter list that doesn't end in
21831 a pack expression, we can't unify. */
21832 if (parm_variadic_p
21833 ? argslen
< len
- parm_variadic_p
21835 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
21837 /* Unify all of the parameters that precede the (optional)
21838 pack expression. */
21839 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
21841 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
21842 TREE_VEC_ELT (parm
, i
),
21843 TREE_VEC_ELT (arg
, i
),
21844 UNIFY_ALLOW_NONE
, explain_p
);
21846 if (parm_variadic_p
)
21847 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
21849 /*subr=*/true, explain_p
);
21850 return unify_success (explain_p
);
21855 if (TREE_CODE (arg
) != TREE_CODE (parm
))
21856 return unify_type_mismatch (explain_p
, parm
, arg
);
21858 if (TYPE_PTRMEMFUNC_P (parm
))
21860 if (!TYPE_PTRMEMFUNC_P (arg
))
21861 return unify_type_mismatch (explain_p
, parm
, arg
);
21863 return unify (tparms
, targs
,
21864 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
21865 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
21866 strict
, explain_p
);
21868 else if (TYPE_PTRMEMFUNC_P (arg
))
21869 return unify_type_mismatch (explain_p
, parm
, arg
);
21871 if (CLASSTYPE_TEMPLATE_INFO (parm
))
21873 tree t
= NULL_TREE
;
21875 if (strict_in
& UNIFY_ALLOW_DERIVED
)
21877 /* First, we try to unify the PARM and ARG directly. */
21878 t
= try_class_unification (tparms
, targs
,
21879 parm
, arg
, explain_p
);
21883 /* Fallback to the special case allowed in
21884 [temp.deduct.call]:
21886 If P is a class, and P has the form
21887 template-id, then A can be a derived class of
21888 the deduced A. Likewise, if P is a pointer to
21889 a class of the form template-id, A can be a
21890 pointer to a derived class pointed to by the
21892 enum template_base_result r
;
21893 r
= get_template_base (tparms
, targs
, parm
, arg
,
21898 /* Don't give the derived diagnostic if we're
21899 already dealing with the same template. */
21901 = (CLASSTYPE_TEMPLATE_INFO (arg
)
21902 && (CLASSTYPE_TI_TEMPLATE (parm
)
21903 == CLASSTYPE_TI_TEMPLATE (arg
)));
21904 return unify_no_common_base (explain_p
&& !same_template
,
21909 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
21910 && (CLASSTYPE_TI_TEMPLATE (parm
)
21911 == CLASSTYPE_TI_TEMPLATE (arg
)))
21912 /* Perhaps PARM is something like S<U> and ARG is S<int>.
21913 Then, we should unify `int' and `U'. */
21916 /* There's no chance of unification succeeding. */
21917 return unify_type_mismatch (explain_p
, parm
, arg
);
21919 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
21920 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
21922 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
21923 return unify_type_mismatch (explain_p
, parm
, arg
);
21924 return unify_success (explain_p
);
21927 case FUNCTION_TYPE
:
21929 unsigned int nargs
;
21934 if (TREE_CODE (arg
) != TREE_CODE (parm
))
21935 return unify_type_mismatch (explain_p
, parm
, arg
);
21937 /* CV qualifications for methods can never be deduced, they must
21938 match exactly. We need to check them explicitly here,
21939 because type_unification_real treats them as any other
21940 cv-qualified parameter. */
21941 if (TREE_CODE (parm
) == METHOD_TYPE
21942 && (!check_cv_quals_for_unify
21944 class_of_this_parm (arg
),
21945 class_of_this_parm (parm
))))
21946 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
21947 if (TREE_CODE (arg
) == FUNCTION_TYPE
21948 && type_memfn_quals (parm
) != type_memfn_quals (arg
))
21949 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
21950 if (type_memfn_rqual (parm
) != type_memfn_rqual (arg
))
21951 return unify_type_mismatch (explain_p
, parm
, arg
);
21953 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
21954 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
21956 nargs
= list_length (TYPE_ARG_TYPES (arg
));
21957 args
= XALLOCAVEC (tree
, nargs
);
21958 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
21959 a
!= NULL_TREE
&& a
!= void_list_node
;
21960 a
= TREE_CHAIN (a
), ++i
)
21961 args
[i
] = TREE_VALUE (a
);
21964 if (type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
21965 args
, nargs
, 1, DEDUCE_EXACT
,
21966 LOOKUP_NORMAL
, NULL
, explain_p
))
21969 if (flag_noexcept_type
)
21971 tree pspec
= TYPE_RAISES_EXCEPTIONS (parm
);
21972 tree aspec
= canonical_eh_spec (TYPE_RAISES_EXCEPTIONS (arg
));
21973 if (pspec
== NULL_TREE
) pspec
= noexcept_false_spec
;
21974 if (aspec
== NULL_TREE
) aspec
= noexcept_false_spec
;
21975 if (TREE_PURPOSE (pspec
) && TREE_PURPOSE (aspec
)
21976 && uses_template_parms (TREE_PURPOSE (pspec
)))
21977 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_PURPOSE (pspec
),
21978 TREE_PURPOSE (aspec
),
21979 UNIFY_ALLOW_NONE
, explain_p
);
21980 else if (nothrow_spec_p (pspec
) && !nothrow_spec_p (aspec
))
21981 return unify_type_mismatch (explain_p
, parm
, arg
);
21988 /* Unify a pointer to member with a pointer to member function, which
21989 deduces the type of the member as a function type. */
21990 if (TYPE_PTRMEMFUNC_P (arg
))
21992 /* Check top-level cv qualifiers */
21993 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
21994 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
21996 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
21997 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
21998 UNIFY_ALLOW_NONE
, explain_p
);
22000 /* Determine the type of the function we are unifying against. */
22001 tree fntype
= static_fn_type (arg
);
22003 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
22006 if (TREE_CODE (arg
) != OFFSET_TYPE
)
22007 return unify_type_mismatch (explain_p
, parm
, arg
);
22008 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
22009 TYPE_OFFSET_BASETYPE (arg
),
22010 UNIFY_ALLOW_NONE
, explain_p
);
22011 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
22012 strict
, explain_p
);
22015 if (DECL_TEMPLATE_PARM_P (parm
))
22016 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
22017 if (arg
!= scalar_constant_value (parm
))
22018 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
22019 return unify_success (explain_p
);
22022 case TEMPLATE_DECL
:
22023 /* Matched cases are handled by the ARG == PARM test above. */
22024 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
22027 /* We might get a variable as a non-type template argument in parm if the
22028 corresponding parameter is type-dependent. Make any necessary
22029 adjustments based on whether arg is a reference. */
22030 if (CONSTANT_CLASS_P (arg
))
22031 parm
= fold_non_dependent_expr (parm
);
22032 else if (REFERENCE_REF_P (arg
))
22034 tree sub
= TREE_OPERAND (arg
, 0);
22036 if (TREE_CODE (sub
) == ADDR_EXPR
)
22037 arg
= TREE_OPERAND (sub
, 0);
22039 /* Now use the normal expression code to check whether they match. */
22042 case TYPE_ARGUMENT_PACK
:
22043 case NONTYPE_ARGUMENT_PACK
:
22044 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
22045 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
22048 case DECLTYPE_TYPE
:
22049 case UNDERLYING_TYPE
:
22050 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
22051 or UNDERLYING_TYPE nodes. */
22052 return unify_success (explain_p
);
22055 /* Unification fails if we hit an error node. */
22056 return unify_invalid (explain_p
);
22059 if (REFERENCE_REF_P (parm
))
22061 bool pexp
= PACK_EXPANSION_P (arg
);
22063 arg
= PACK_EXPANSION_PATTERN (arg
);
22064 if (REFERENCE_REF_P (arg
))
22065 arg
= TREE_OPERAND (arg
, 0);
22067 arg
= make_pack_expansion (arg
, complain
);
22068 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
22069 strict
, explain_p
);
22074 /* An unresolved overload is a nondeduced context. */
22075 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
22076 return unify_success (explain_p
);
22077 gcc_assert (EXPR_P (parm
) || TREE_CODE (parm
) == TRAIT_EXPR
);
22079 /* We must be looking at an expression. This can happen with
22083 void foo(S<I>, S<I + 2>);
22085 This is a "nondeduced context":
22089 The nondeduced contexts are:
22091 --A type that is a template-id in which one or more of
22092 the template-arguments is an expression that references
22093 a template-parameter.
22095 In these cases, we assume deduction succeeded, but don't
22096 actually infer any unifications. */
22098 if (!uses_template_parms (parm
)
22099 && !template_args_equal (parm
, arg
))
22100 return unify_expression_unequal (explain_p
, parm
, arg
);
22102 return unify_success (explain_p
);
22105 #undef RECUR_AND_CHECK_FAILURE
22107 /* Note that DECL can be defined in this translation unit, if
22111 mark_definable (tree decl
)
22114 DECL_NOT_REALLY_EXTERN (decl
) = 1;
22115 FOR_EACH_CLONE (clone
, decl
)
22116 DECL_NOT_REALLY_EXTERN (clone
) = 1;
22119 /* Called if RESULT is explicitly instantiated, or is a member of an
22120 explicitly instantiated class. */
22123 mark_decl_instantiated (tree result
, int extern_p
)
22125 SET_DECL_EXPLICIT_INSTANTIATION (result
);
22127 /* If this entity has already been written out, it's too late to
22128 make any modifications. */
22129 if (TREE_ASM_WRITTEN (result
))
22132 /* For anonymous namespace we don't need to do anything. */
22133 if (decl_anon_ns_mem_p (result
))
22135 gcc_assert (!TREE_PUBLIC (result
));
22139 if (TREE_CODE (result
) != FUNCTION_DECL
)
22140 /* The TREE_PUBLIC flag for function declarations will have been
22141 set correctly by tsubst. */
22142 TREE_PUBLIC (result
) = 1;
22144 /* This might have been set by an earlier implicit instantiation. */
22145 DECL_COMDAT (result
) = 0;
22148 DECL_NOT_REALLY_EXTERN (result
) = 0;
22151 mark_definable (result
);
22152 mark_needed (result
);
22153 /* Always make artificials weak. */
22154 if (DECL_ARTIFICIAL (result
) && flag_weak
)
22155 comdat_linkage (result
);
22156 /* For WIN32 we also want to put explicit instantiations in
22157 linkonce sections. */
22158 else if (TREE_PUBLIC (result
))
22159 maybe_make_one_only (result
);
22162 /* If EXTERN_P, then this function will not be emitted -- unless
22163 followed by an explicit instantiation, at which point its linkage
22164 will be adjusted. If !EXTERN_P, then this function will be
22165 emitted here. In neither circumstance do we want
22166 import_export_decl to adjust the linkage. */
22167 DECL_INTERFACE_KNOWN (result
) = 1;
22170 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
22171 important template arguments. If any are missing, we check whether
22172 they're important by using error_mark_node for substituting into any
22173 args that were used for partial ordering (the ones between ARGS and END)
22174 and seeing if it bubbles up. */
22177 check_undeduced_parms (tree targs
, tree args
, tree end
)
22179 bool found
= false;
22181 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
22182 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
22185 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
22189 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
22190 if (substed
== error_mark_node
)
22196 /* Given two function templates PAT1 and PAT2, return:
22198 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
22199 -1 if PAT2 is more specialized than PAT1.
22200 0 if neither is more specialized.
22202 LEN indicates the number of parameters we should consider
22203 (defaulted parameters should not be considered).
22205 The 1998 std underspecified function template partial ordering, and
22206 DR214 addresses the issue. We take pairs of arguments, one from
22207 each of the templates, and deduce them against each other. One of
22208 the templates will be more specialized if all the *other*
22209 template's arguments deduce against its arguments and at least one
22210 of its arguments *does* *not* deduce against the other template's
22211 corresponding argument. Deduction is done as for class templates.
22212 The arguments used in deduction have reference and top level cv
22213 qualifiers removed. Iff both arguments were originally reference
22214 types *and* deduction succeeds in both directions, an lvalue reference
22215 wins against an rvalue reference and otherwise the template
22216 with the more cv-qualified argument wins for that pairing (if
22217 neither is more cv-qualified, they both are equal). Unlike regular
22218 deduction, after all the arguments have been deduced in this way,
22219 we do *not* verify the deduced template argument values can be
22220 substituted into non-deduced contexts.
22222 The logic can be a bit confusing here, because we look at deduce1 and
22223 targs1 to see if pat2 is at least as specialized, and vice versa; if we
22224 can find template arguments for pat1 to make arg1 look like arg2, that
22225 means that arg2 is at least as specialized as arg1. */
22228 more_specialized_fn (tree pat1
, tree pat2
, int len
)
22230 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
22231 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
22232 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
22233 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
22234 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
22235 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
22236 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
22237 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
22238 tree origs1
, origs2
;
22239 bool lose1
= false;
22240 bool lose2
= false;
22242 /* Remove the this parameter from non-static member functions. If
22243 one is a non-static member function and the other is not a static
22244 member function, remove the first parameter from that function
22245 also. This situation occurs for operator functions where we
22246 locate both a member function (with this pointer) and non-member
22247 operator (with explicit first operand). */
22248 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
22250 len
--; /* LEN is the number of significant arguments for DECL1 */
22251 args1
= TREE_CHAIN (args1
);
22252 if (!DECL_STATIC_FUNCTION_P (decl2
))
22253 args2
= TREE_CHAIN (args2
);
22255 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
22257 args2
= TREE_CHAIN (args2
);
22258 if (!DECL_STATIC_FUNCTION_P (decl1
))
22261 args1
= TREE_CHAIN (args1
);
22265 /* If only one is a conversion operator, they are unordered. */
22266 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
22269 /* Consider the return type for a conversion function */
22270 if (DECL_CONV_FN_P (decl1
))
22272 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
22273 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
22277 processing_template_decl
++;
22283 /* Stop when an ellipsis is seen. */
22284 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
22286 tree arg1
= TREE_VALUE (args1
);
22287 tree arg2
= TREE_VALUE (args2
);
22288 int deduce1
, deduce2
;
22294 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
22295 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
22297 /* When both arguments are pack expansions, we need only
22298 unify the patterns themselves. */
22299 arg1
= PACK_EXPANSION_PATTERN (arg1
);
22300 arg2
= PACK_EXPANSION_PATTERN (arg2
);
22302 /* This is the last comparison we need to do. */
22306 /* DR 1847: If a particular P contains no template-parameters that
22307 participate in template argument deduction, that P is not used to
22308 determine the ordering. */
22309 if (!uses_deducible_template_parms (arg1
)
22310 && !uses_deducible_template_parms (arg2
))
22313 if (TYPE_REF_P (arg1
))
22315 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
22316 arg1
= TREE_TYPE (arg1
);
22317 quals1
= cp_type_quals (arg1
);
22320 if (TYPE_REF_P (arg2
))
22322 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
22323 arg2
= TREE_TYPE (arg2
);
22324 quals2
= cp_type_quals (arg2
);
22327 arg1
= TYPE_MAIN_VARIANT (arg1
);
22328 arg2
= TYPE_MAIN_VARIANT (arg2
);
22330 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
22332 int i
, len2
= remaining_arguments (args2
);
22333 tree parmvec
= make_tree_vec (1);
22334 tree argvec
= make_tree_vec (len2
);
22337 /* Setup the parameter vector, which contains only ARG1. */
22338 TREE_VEC_ELT (parmvec
, 0) = arg1
;
22340 /* Setup the argument vector, which contains the remaining
22342 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
22343 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
22345 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
22346 argvec
, DEDUCE_EXACT
,
22347 /*subr=*/true, /*explain_p=*/false)
22350 /* We cannot deduce in the other direction, because ARG1 is
22351 a pack expansion but ARG2 is not. */
22354 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
22356 int i
, len1
= remaining_arguments (args1
);
22357 tree parmvec
= make_tree_vec (1);
22358 tree argvec
= make_tree_vec (len1
);
22361 /* Setup the parameter vector, which contains only ARG1. */
22362 TREE_VEC_ELT (parmvec
, 0) = arg2
;
22364 /* Setup the argument vector, which contains the remaining
22366 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
22367 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
22369 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
22370 argvec
, DEDUCE_EXACT
,
22371 /*subr=*/true, /*explain_p=*/false)
22374 /* We cannot deduce in the other direction, because ARG2 is
22375 a pack expansion but ARG1 is not.*/
22381 /* The normal case, where neither argument is a pack
22383 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
22384 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
22386 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
22387 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
22391 /* If we couldn't deduce arguments for tparms1 to make arg1 match
22392 arg2, then arg2 is not as specialized as arg1. */
22398 /* "If, for a given type, deduction succeeds in both directions
22399 (i.e., the types are identical after the transformations above)
22400 and both P and A were reference types (before being replaced with
22401 the type referred to above):
22402 - if the type from the argument template was an lvalue reference and
22403 the type from the parameter template was not, the argument type is
22404 considered to be more specialized than the other; otherwise,
22405 - if the type from the argument template is more cv-qualified
22406 than the type from the parameter template (as described above),
22407 the argument type is considered to be more specialized than the other;
22409 - neither type is more specialized than the other." */
22411 if (deduce1
&& deduce2
)
22413 if (ref1
&& ref2
&& ref1
!= ref2
)
22420 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
22422 if ((quals1
& quals2
) == quals2
)
22424 if ((quals1
& quals2
) == quals1
)
22429 if (lose1
&& lose2
)
22430 /* We've failed to deduce something in either direction.
22431 These must be unordered. */
22436 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
22437 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
22438 /* We have already processed all of the arguments in our
22439 handing of the pack expansion type. */
22442 args1
= TREE_CHAIN (args1
);
22443 args2
= TREE_CHAIN (args2
);
22446 /* "In most cases, all template parameters must have values in order for
22447 deduction to succeed, but for partial ordering purposes a template
22448 parameter may remain without a value provided it is not used in the
22449 types being used for partial ordering."
22451 Thus, if we are missing any of the targs1 we need to substitute into
22452 origs1, then pat2 is not as specialized as pat1. This can happen when
22453 there is a nondeduced context. */
22454 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
22456 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
22459 processing_template_decl
--;
22461 /* If both deductions succeed, the partial ordering selects the more
22462 constrained template. */
22463 if (!lose1
&& !lose2
)
22465 tree c1
= get_constraints (DECL_TEMPLATE_RESULT (pat1
));
22466 tree c2
= get_constraints (DECL_TEMPLATE_RESULT (pat2
));
22467 lose1
= !subsumes_constraints (c1
, c2
);
22468 lose2
= !subsumes_constraints (c2
, c1
);
22471 /* All things being equal, if the next argument is a pack expansion
22472 for one function but not for the other, prefer the
22473 non-variadic function. FIXME this is bogus; see c++/41958. */
22475 && args1
&& TREE_VALUE (args1
)
22476 && args2
&& TREE_VALUE (args2
))
22478 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
22479 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
22482 if (lose1
== lose2
)
22490 /* Determine which of two partial specializations of TMPL is more
22493 PAT1 is a TREE_LIST whose TREE_VALUE is the TEMPLATE_DECL corresponding
22494 to the first partial specialization. The TREE_PURPOSE is the
22495 innermost set of template parameters for the partial
22496 specialization. PAT2 is similar, but for the second template.
22498 Return 1 if the first partial specialization is more specialized;
22499 -1 if the second is more specialized; 0 if neither is more
22502 See [temp.class.order] for information about determining which of
22503 two templates is more specialized. */
22506 more_specialized_partial_spec (tree tmpl
, tree pat1
, tree pat2
)
22510 bool any_deductions
= false;
22512 tree tmpl1
= TREE_VALUE (pat1
);
22513 tree tmpl2
= TREE_VALUE (pat2
);
22514 tree specargs1
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl1
)));
22515 tree specargs2
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl2
)));
22517 /* Just like what happens for functions, if we are ordering between
22518 different template specializations, we may encounter dependent
22519 types in the arguments, and we need our dependency check functions
22520 to behave correctly. */
22521 ++processing_template_decl
;
22522 targs
= get_partial_spec_bindings (tmpl
, tmpl1
, specargs2
);
22526 any_deductions
= true;
22529 targs
= get_partial_spec_bindings (tmpl
, tmpl2
, specargs1
);
22533 any_deductions
= true;
22535 --processing_template_decl
;
22537 /* If both deductions succeed, the partial ordering selects the more
22538 constrained template. */
22539 if (!winner
&& any_deductions
)
22540 return more_constrained (tmpl1
, tmpl2
);
22542 /* In the case of a tie where at least one of the templates
22543 has a parameter pack at the end, the template with the most
22544 non-packed parameters wins. */
22547 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
22548 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
22550 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
22551 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
22552 int len1
= TREE_VEC_LENGTH (args1
);
22553 int len2
= TREE_VEC_LENGTH (args2
);
22555 /* We don't count the pack expansion at the end. */
22556 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
22558 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
22563 else if (len1
< len2
)
22570 /* Return the template arguments that will produce the function signature
22571 DECL from the function template FN, with the explicit template
22572 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
22573 also match. Return NULL_TREE if no satisfactory arguments could be
22577 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
22579 int ntparms
= DECL_NTPARMS (fn
);
22580 tree targs
= make_tree_vec (ntparms
);
22581 tree decl_type
= TREE_TYPE (decl
);
22582 tree decl_arg_types
;
22584 unsigned int nargs
, ix
;
22587 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
22589 /* Never do unification on the 'this' parameter. */
22590 decl_arg_types
= skip_artificial_parms_for (decl
,
22591 TYPE_ARG_TYPES (decl_type
));
22593 nargs
= list_length (decl_arg_types
);
22594 args
= XALLOCAVEC (tree
, nargs
);
22595 for (arg
= decl_arg_types
, ix
= 0;
22596 arg
!= NULL_TREE
&& arg
!= void_list_node
;
22597 arg
= TREE_CHAIN (arg
), ++ix
)
22598 args
[ix
] = TREE_VALUE (arg
);
22600 if (fn_type_unification (fn
, explicit_args
, targs
,
22602 (check_rettype
|| DECL_CONV_FN_P (fn
)
22603 ? TREE_TYPE (decl_type
) : NULL_TREE
),
22604 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
22606 == error_mark_node
)
22612 /* Return the innermost template arguments that, when applied to a partial
22613 specialization SPEC_TMPL of TMPL, yield the ARGS.
22615 For example, suppose we have:
22617 template <class T, class U> struct S {};
22618 template <class T> struct S<T*, int> {};
22620 Then, suppose we want to get `S<double*, int>'. SPEC_TMPL will be the
22621 partial specialization and the ARGS will be {double*, int}. The resulting
22622 vector will be {double}, indicating that `T' is bound to `double'. */
22625 get_partial_spec_bindings (tree tmpl
, tree spec_tmpl
, tree args
)
22627 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
22629 = TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (spec_tmpl
)));
22630 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
22632 tree innermost_deduced_args
;
22634 innermost_deduced_args
= make_tree_vec (ntparms
);
22635 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
22637 deduced_args
= copy_node (args
);
22638 SET_TMPL_ARGS_LEVEL (deduced_args
,
22639 TMPL_ARGS_DEPTH (deduced_args
),
22640 innermost_deduced_args
);
22643 deduced_args
= innermost_deduced_args
;
22645 bool tried_array_deduction
= (cxx_dialect
< cxx17
);
22647 if (unify (tparms
, deduced_args
,
22648 INNERMOST_TEMPLATE_ARGS (spec_args
),
22649 INNERMOST_TEMPLATE_ARGS (args
),
22650 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
22653 for (i
= 0; i
< ntparms
; ++i
)
22654 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
22656 if (!tried_array_deduction
)
22658 try_array_deduction (tparms
, innermost_deduced_args
,
22659 INNERMOST_TEMPLATE_ARGS (spec_args
));
22660 tried_array_deduction
= true;
22661 if (TREE_VEC_ELT (innermost_deduced_args
, i
))
22667 if (!push_tinst_level (spec_tmpl
, deduced_args
))
22669 excessive_deduction_depth
= true;
22673 /* Verify that nondeduced template arguments agree with the type
22674 obtained from argument deduction.
22678 struct A { typedef int X; };
22679 template <class T, class U> struct C {};
22680 template <class T> struct C<T, typename T::X> {};
22682 Then with the instantiation `C<A, int>', we can deduce that
22683 `T' is `A' but unify () does not check whether `typename T::X'
22685 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
22687 if (spec_args
!= error_mark_node
)
22688 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
22689 INNERMOST_TEMPLATE_ARGS (spec_args
),
22690 tmpl
, tf_none
, false, false);
22692 pop_tinst_level ();
22694 if (spec_args
== error_mark_node
22695 /* We only need to check the innermost arguments; the other
22696 arguments will always agree. */
22697 || !comp_template_args_porder (INNERMOST_TEMPLATE_ARGS (spec_args
),
22698 INNERMOST_TEMPLATE_ARGS (args
)))
22701 /* Now that we have bindings for all of the template arguments,
22702 ensure that the arguments deduced for the template template
22703 parameters have compatible template parameter lists. See the use
22704 of template_template_parm_bindings_ok_p in fn_type_unification
22705 for more information. */
22706 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
22709 return deduced_args
;
22712 // Compare two function templates T1 and T2 by deducing bindings
22713 // from one against the other. If both deductions succeed, compare
22714 // constraints to see which is more constrained.
22716 more_specialized_inst (tree t1
, tree t2
)
22721 if (get_bindings (t1
, DECL_TEMPLATE_RESULT (t2
), NULL_TREE
, true))
22727 if (get_bindings (t2
, DECL_TEMPLATE_RESULT (t1
), NULL_TREE
, true))
22733 // If both deductions succeed, then one may be more constrained.
22734 if (count
== 2 && fate
== 0)
22735 fate
= more_constrained (t1
, t2
);
22740 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
22741 Return the TREE_LIST node with the most specialized template, if
22742 any. If there is no most specialized template, the error_mark_node
22745 Note that this function does not look at, or modify, the
22746 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
22747 returned is one of the elements of INSTANTIATIONS, callers may
22748 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
22749 and retrieve it from the value returned. */
22752 most_specialized_instantiation (tree templates
)
22756 ++processing_template_decl
;
22759 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
22761 gcc_assert (TREE_VALUE (champ
) != TREE_VALUE (fn
));
22762 int fate
= more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
));
22767 /* Equally specialized, move to next function. If there
22768 is no next function, nothing's most specialized. */
22769 fn
= TREE_CHAIN (fn
);
22777 /* Now verify that champ is better than everything earlier in the
22778 instantiation list. */
22779 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
)) {
22780 if (more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
)) != 1)
22787 processing_template_decl
--;
22790 return error_mark_node
;
22795 /* If DECL is a specialization of some template, return the most
22796 general such template. Otherwise, returns NULL_TREE.
22798 For example, given:
22800 template <class T> struct S { template <class U> void f(U); };
22802 if TMPL is `template <class U> void S<int>::f(U)' this will return
22803 the full template. This function will not trace past partial
22804 specializations, however. For example, given in addition:
22806 template <class T> struct S<T*> { template <class U> void f(U); };
22808 if TMPL is `template <class U> void S<int*>::f(U)' this will return
22809 `template <class T> template <class U> S<T*>::f(U)'. */
22812 most_general_template (tree decl
)
22814 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
22816 if (tree tinfo
= get_template_info (decl
))
22817 decl
= TI_TEMPLATE (tinfo
);
22818 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
22819 template friend, or a FIELD_DECL for a capture pack. */
22820 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
22824 /* Look for more and more general templates. */
22825 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
22827 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
22828 (See cp-tree.h for details.) */
22829 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
22832 if (CLASS_TYPE_P (TREE_TYPE (decl
))
22833 && !TYPE_DECL_ALIAS_P (TYPE_NAME (TREE_TYPE (decl
)))
22834 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
22837 /* Stop if we run into an explicitly specialized class template. */
22838 if (!DECL_NAMESPACE_SCOPE_P (decl
)
22839 && DECL_CONTEXT (decl
)
22840 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
22843 decl
= DECL_TI_TEMPLATE (decl
);
22849 /* Return the most specialized of the template partial specializations
22850 which can produce TARGET, a specialization of some class or variable
22851 template. The value returned is actually a TREE_LIST; the TREE_VALUE is
22852 a TEMPLATE_DECL node corresponding to the partial specialization, while
22853 the TREE_PURPOSE is the set of template arguments that must be
22854 substituted into the template pattern in order to generate TARGET.
22856 If the choice of partial specialization is ambiguous, a diagnostic
22857 is issued, and the error_mark_node is returned. If there are no
22858 partial specializations matching TARGET, then NULL_TREE is
22859 returned, indicating that the primary template should be used. */
22862 most_specialized_partial_spec (tree target
, tsubst_flags_t complain
)
22864 tree list
= NULL_TREE
;
22869 tree outer_args
= NULL_TREE
;
22872 if (TYPE_P (target
))
22874 tree tinfo
= CLASSTYPE_TEMPLATE_INFO (target
);
22875 tmpl
= TI_TEMPLATE (tinfo
);
22876 args
= TI_ARGS (tinfo
);
22878 else if (TREE_CODE (target
) == TEMPLATE_ID_EXPR
)
22880 tmpl
= TREE_OPERAND (target
, 0);
22881 args
= TREE_OPERAND (target
, 1);
22883 else if (VAR_P (target
))
22885 tree tinfo
= DECL_TEMPLATE_INFO (target
);
22886 tmpl
= TI_TEMPLATE (tinfo
);
22887 args
= TI_ARGS (tinfo
);
22890 gcc_unreachable ();
22892 tree main_tmpl
= most_general_template (tmpl
);
22894 /* For determining which partial specialization to use, only the
22895 innermost args are interesting. */
22896 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
22898 outer_args
= strip_innermost_template_args (args
, 1);
22899 args
= INNERMOST_TEMPLATE_ARGS (args
);
22902 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
22905 tree spec_tmpl
= TREE_VALUE (t
);
22909 /* Substitute in the template args from the enclosing class. */
22910 ++processing_template_decl
;
22911 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
22912 --processing_template_decl
;
22915 if (spec_tmpl
== error_mark_node
)
22916 return error_mark_node
;
22918 spec_args
= get_partial_spec_bindings (tmpl
, spec_tmpl
, args
);
22922 spec_args
= add_to_template_args (outer_args
, spec_args
);
22924 /* Keep the candidate only if the constraints are satisfied,
22925 or if we're not compiling with concepts. */
22927 || constraints_satisfied_p (spec_tmpl
, spec_args
))
22929 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
22930 TREE_TYPE (list
) = TREE_TYPE (t
);
22938 ambiguous_p
= false;
22941 t
= TREE_CHAIN (t
);
22942 for (; t
; t
= TREE_CHAIN (t
))
22944 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
22951 t
= TREE_CHAIN (t
);
22954 ambiguous_p
= true;
22963 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
22965 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
22968 ambiguous_p
= true;
22976 char *spaces
= NULL
;
22977 if (!(complain
& tf_error
))
22978 return error_mark_node
;
22979 if (TYPE_P (target
))
22980 error ("ambiguous template instantiation for %q#T", target
);
22982 error ("ambiguous template instantiation for %q#D", target
);
22983 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
22984 for (t
= list
; t
; t
= TREE_CHAIN (t
))
22986 tree subst
= build_tree_list (TREE_VALUE (t
), TREE_PURPOSE (t
));
22987 inform (DECL_SOURCE_LOCATION (TREE_VALUE (t
)),
22988 "%s %#qS", spaces
? spaces
: str
, subst
);
22989 spaces
= spaces
? spaces
: get_spaces (str
);
22992 return error_mark_node
;
22998 /* Explicitly instantiate DECL. */
23001 do_decl_instantiation (tree decl
, tree storage
)
23003 tree result
= NULL_TREE
;
23006 if (!decl
|| decl
== error_mark_node
)
23007 /* An error occurred, for which grokdeclarator has already issued
23008 an appropriate message. */
23010 else if (! DECL_LANG_SPECIFIC (decl
))
23012 error ("explicit instantiation of non-template %q#D", decl
);
23016 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
23017 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
23019 if (VAR_P (decl
) && !var_templ
)
23021 /* There is an asymmetry here in the way VAR_DECLs and
23022 FUNCTION_DECLs are handled by grokdeclarator. In the case of
23023 the latter, the DECL we get back will be marked as a
23024 template instantiation, and the appropriate
23025 DECL_TEMPLATE_INFO will be set up. This does not happen for
23026 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
23027 should handle VAR_DECLs as it currently handles
23029 if (!DECL_CLASS_SCOPE_P (decl
))
23031 error ("%qD is not a static data member of a class template", decl
);
23034 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
23035 if (!result
|| !VAR_P (result
))
23037 error ("no matching template for %qD found", decl
);
23040 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
23042 error ("type %qT for explicit instantiation %qD does not match "
23043 "declared type %qT", TREE_TYPE (result
), decl
,
23048 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
23050 error ("explicit instantiation of %q#D", decl
);
23056 /* Check for various error cases. Note that if the explicit
23057 instantiation is valid the RESULT will currently be marked as an
23058 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
23059 until we get here. */
23061 if (DECL_TEMPLATE_SPECIALIZATION (result
))
23063 /* DR 259 [temp.spec].
23065 Both an explicit instantiation and a declaration of an explicit
23066 specialization shall not appear in a program unless the explicit
23067 instantiation follows a declaration of the explicit specialization.
23069 For a given set of template parameters, if an explicit
23070 instantiation of a template appears after a declaration of an
23071 explicit specialization for that template, the explicit
23072 instantiation has no effect. */
23075 else if (DECL_EXPLICIT_INSTANTIATION (result
))
23079 No program shall explicitly instantiate any template more
23082 We check DECL_NOT_REALLY_EXTERN so as not to complain when
23083 the first instantiation was `extern' and the second is not,
23084 and EXTERN_P for the opposite case. */
23085 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
23086 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
23087 /* If an "extern" explicit instantiation follows an ordinary
23088 explicit instantiation, the template is instantiated. */
23092 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
23094 error ("no matching template for %qD found", result
);
23097 else if (!DECL_TEMPLATE_INFO (result
))
23099 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
23103 if (storage
== NULL_TREE
)
23105 else if (storage
== ridpointers
[(int) RID_EXTERN
])
23107 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
23108 pedwarn (input_location
, OPT_Wpedantic
,
23109 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
23114 error ("storage class %qD applied to template instantiation", storage
);
23116 check_explicit_instantiation_namespace (result
);
23117 mark_decl_instantiated (result
, extern_p
);
23119 instantiate_decl (result
, /*defer_ok=*/true,
23120 /*expl_inst_class_mem_p=*/false);
23124 mark_class_instantiated (tree t
, int extern_p
)
23126 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
23127 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
23128 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
23129 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
23132 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
23133 rest_of_type_compilation (t
, 1);
23137 /* Called from do_type_instantiation through binding_table_foreach to
23138 do recursive instantiation for the type bound in ENTRY. */
23140 bt_instantiate_type_proc (binding_entry entry
, void *data
)
23142 tree storage
= *(tree
*) data
;
23144 if (MAYBE_CLASS_TYPE_P (entry
->type
)
23145 && CLASSTYPE_TEMPLATE_INFO (entry
->type
)
23146 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
23147 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
23150 /* Perform an explicit instantiation of template class T. STORAGE, if
23151 non-null, is the RID for extern, inline or static. COMPLAIN is
23152 nonzero if this is called from the parser, zero if called recursively,
23153 since the standard is unclear (as detailed below). */
23156 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
23161 int previous_instantiation_extern_p
= 0;
23163 if (TREE_CODE (t
) == TYPE_DECL
)
23166 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
23169 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
23171 error ("explicit instantiation of non-class template %qD", tmpl
);
23173 error ("explicit instantiation of non-template type %qT", t
);
23179 if (!COMPLETE_TYPE_P (t
))
23181 if (complain
& tf_error
)
23182 error ("explicit instantiation of %q#T before definition of template",
23187 if (storage
!= NULL_TREE
)
23189 if (!in_system_header_at (input_location
))
23191 if (storage
== ridpointers
[(int) RID_EXTERN
])
23193 if (cxx_dialect
== cxx98
)
23194 pedwarn (input_location
, OPT_Wpedantic
,
23195 "ISO C++ 1998 forbids the use of %<extern%> on "
23196 "explicit instantiations");
23199 pedwarn (input_location
, OPT_Wpedantic
,
23200 "ISO C++ forbids the use of %qE"
23201 " on explicit instantiations", storage
);
23204 if (storage
== ridpointers
[(int) RID_INLINE
])
23206 else if (storage
== ridpointers
[(int) RID_EXTERN
])
23208 else if (storage
== ridpointers
[(int) RID_STATIC
])
23212 error ("storage class %qD applied to template instantiation",
23218 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
23220 /* DR 259 [temp.spec].
23222 Both an explicit instantiation and a declaration of an explicit
23223 specialization shall not appear in a program unless the explicit
23224 instantiation follows a declaration of the explicit specialization.
23226 For a given set of template parameters, if an explicit
23227 instantiation of a template appears after a declaration of an
23228 explicit specialization for that template, the explicit
23229 instantiation has no effect. */
23232 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
23236 No program shall explicitly instantiate any template more
23239 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
23240 instantiation was `extern'. If EXTERN_P then the second is.
23241 These cases are OK. */
23242 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
23244 if (!previous_instantiation_extern_p
&& !extern_p
23245 && (complain
& tf_error
))
23246 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
23248 /* If we've already instantiated the template, just return now. */
23249 if (!CLASSTYPE_INTERFACE_ONLY (t
))
23253 check_explicit_instantiation_namespace (TYPE_NAME (t
));
23254 mark_class_instantiated (t
, extern_p
);
23259 /* In contrast to implicit instantiation, where only the
23260 declarations, and not the definitions, of members are
23261 instantiated, we have here:
23265 The explicit instantiation of a class template specialization
23266 implies the instantiation of all of its members not
23267 previously explicitly specialized in the translation unit
23268 containing the explicit instantiation.
23270 Of course, we can't instantiate member template classes, since we
23271 don't have any arguments for them. Note that the standard is
23272 unclear on whether the instantiation of the members are
23273 *explicit* instantiations or not. However, the most natural
23274 interpretation is that it should be an explicit
23276 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= DECL_CHAIN (fld
))
23278 || (TREE_CODE (fld
) == FUNCTION_DECL
23280 && user_provided_p (fld
)))
23281 && DECL_TEMPLATE_INSTANTIATION (fld
))
23283 mark_decl_instantiated (fld
, extern_p
);
23285 instantiate_decl (fld
, /*defer_ok=*/true,
23286 /*expl_inst_class_mem_p=*/true);
23289 if (CLASSTYPE_NESTED_UTDS (t
))
23290 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
23291 bt_instantiate_type_proc
, &storage
);
23294 /* Given a function DECL, which is a specialization of TMPL, modify
23295 DECL to be a re-instantiation of TMPL with the same template
23296 arguments. TMPL should be the template into which tsubst'ing
23297 should occur for DECL, not the most general template.
23299 One reason for doing this is a scenario like this:
23302 void f(const T&, int i);
23304 void g() { f(3, 7); }
23307 void f(const T& t, const int i) { }
23309 Note that when the template is first instantiated, with
23310 instantiate_template, the resulting DECL will have no name for the
23311 first parameter, and the wrong type for the second. So, when we go
23312 to instantiate the DECL, we regenerate it. */
23315 regenerate_decl_from_template (tree decl
, tree tmpl
, tree args
)
23317 /* The arguments used to instantiate DECL, from the most general
23321 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
23323 /* Make sure that we can see identifiers, and compute access
23325 push_access_scope (decl
);
23327 if (TREE_CODE (decl
) == FUNCTION_DECL
)
23335 args_depth
= TMPL_ARGS_DEPTH (args
);
23336 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
23337 if (args_depth
> parms_depth
)
23338 args
= get_innermost_template_args (args
, parms_depth
);
23340 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
23341 args
, tf_error
, NULL_TREE
,
23342 /*defer_ok*/false);
23343 if (specs
&& specs
!= error_mark_node
)
23344 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
23347 /* Merge parameter declarations. */
23348 decl_parm
= skip_artificial_parms_for (decl
,
23349 DECL_ARGUMENTS (decl
));
23351 = skip_artificial_parms_for (code_pattern
,
23352 DECL_ARGUMENTS (code_pattern
));
23353 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
23358 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
23359 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
23360 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
23362 parm_type
= type_decays_to (parm_type
);
23363 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
23364 TREE_TYPE (decl_parm
) = parm_type
;
23365 attributes
= DECL_ATTRIBUTES (pattern_parm
);
23366 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
23368 DECL_ATTRIBUTES (decl_parm
) = attributes
;
23369 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
23371 decl_parm
= DECL_CHAIN (decl_parm
);
23372 pattern_parm
= DECL_CHAIN (pattern_parm
);
23374 /* Merge any parameters that match with the function parameter
23376 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
23379 tree expanded_types
;
23380 /* Expand the TYPE_PACK_EXPANSION that provides the types for
23381 the parameters in this function parameter pack. */
23382 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
23383 args
, tf_error
, NULL_TREE
);
23384 len
= TREE_VEC_LENGTH (expanded_types
);
23385 for (i
= 0; i
< len
; i
++)
23390 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
23391 /* Rename the parameter to include the index. */
23392 DECL_NAME (decl_parm
) =
23393 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
23394 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
23395 parm_type
= type_decays_to (parm_type
);
23396 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
23397 TREE_TYPE (decl_parm
) = parm_type
;
23398 attributes
= DECL_ATTRIBUTES (pattern_parm
);
23399 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
23401 DECL_ATTRIBUTES (decl_parm
) = attributes
;
23402 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
23404 decl_parm
= DECL_CHAIN (decl_parm
);
23407 /* Merge additional specifiers from the CODE_PATTERN. */
23408 if (DECL_DECLARED_INLINE_P (code_pattern
)
23409 && !DECL_DECLARED_INLINE_P (decl
))
23410 DECL_DECLARED_INLINE_P (decl
) = 1;
23412 else if (VAR_P (decl
))
23414 start_lambda_scope (decl
);
23415 DECL_INITIAL (decl
) =
23416 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
23417 tf_error
, DECL_TI_TEMPLATE (decl
),
23418 /*integral_constant_expression_p=*/false);
23419 finish_lambda_scope ();
23420 if (VAR_HAD_UNKNOWN_BOUND (decl
))
23421 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
23422 tf_error
, DECL_TI_TEMPLATE (decl
));
23425 gcc_unreachable ();
23427 pop_access_scope (decl
);
23430 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
23431 substituted to get DECL. */
23434 template_for_substitution (tree decl
)
23436 tree tmpl
= DECL_TI_TEMPLATE (decl
);
23438 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
23439 for the instantiation. This is not always the most general
23440 template. Consider, for example:
23443 struct S { template <class U> void f();
23444 template <> void f<int>(); };
23446 and an instantiation of S<double>::f<int>. We want TD to be the
23447 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
23448 while (/* An instantiation cannot have a definition, so we need a
23449 more general template. */
23450 DECL_TEMPLATE_INSTANTIATION (tmpl
)
23451 /* We must also deal with friend templates. Given:
23453 template <class T> struct S {
23454 template <class U> friend void f() {};
23457 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
23458 so far as the language is concerned, but that's still
23459 where we get the pattern for the instantiation from. On
23460 other hand, if the definition comes outside the class, say:
23462 template <class T> struct S {
23463 template <class U> friend void f();
23465 template <class U> friend void f() {}
23467 we don't need to look any further. That's what the check for
23468 DECL_INITIAL is for. */
23469 || (TREE_CODE (decl
) == FUNCTION_DECL
23470 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
23471 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
23473 /* The present template, TD, should not be a definition. If it
23474 were a definition, we should be using it! Note that we
23475 cannot restructure the loop to just keep going until we find
23476 a template with a definition, since that might go too far if
23477 a specialization was declared, but not defined. */
23479 /* Fetch the more general template. */
23480 tmpl
= DECL_TI_TEMPLATE (tmpl
);
23486 /* Returns true if we need to instantiate this template instance even if we
23487 know we aren't going to emit it. */
23490 always_instantiate_p (tree decl
)
23492 /* We always instantiate inline functions so that we can inline them. An
23493 explicit instantiation declaration prohibits implicit instantiation of
23494 non-inline functions. With high levels of optimization, we would
23495 normally inline non-inline functions -- but we're not allowed to do
23496 that for "extern template" functions. Therefore, we check
23497 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
23498 return ((TREE_CODE (decl
) == FUNCTION_DECL
23499 && (DECL_DECLARED_INLINE_P (decl
)
23500 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
23501 /* And we need to instantiate static data members so that
23502 their initializers are available in integral constant
23505 && decl_maybe_constant_var_p (decl
)));
23508 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
23509 instantiate it now, modifying TREE_TYPE (fn). Returns false on
23510 error, true otherwise. */
23513 maybe_instantiate_noexcept (tree fn
, tsubst_flags_t complain
)
23515 tree fntype
, spec
, noex
, clone
;
23517 /* Don't instantiate a noexcept-specification from template context. */
23518 if (processing_template_decl
23519 && (!flag_noexcept_type
|| type_dependent_expression_p (fn
)))
23522 if (DECL_CLONED_FUNCTION_P (fn
))
23523 fn
= DECL_CLONED_FUNCTION (fn
);
23524 fntype
= TREE_TYPE (fn
);
23525 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
23527 if (!spec
|| !TREE_PURPOSE (spec
))
23530 noex
= TREE_PURPOSE (spec
);
23532 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
23534 static hash_set
<tree
>* fns
= new hash_set
<tree
>;
23535 bool added
= false;
23536 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
23537 spec
= get_defaulted_eh_spec (fn
, complain
);
23538 else if (!(added
= !fns
->add (fn
)))
23540 /* If hash_set::add returns true, the element was already there. */
23541 location_t loc
= EXPR_LOC_OR_LOC (DEFERRED_NOEXCEPT_PATTERN (noex
),
23542 DECL_SOURCE_LOCATION (fn
));
23544 "exception specification of %qD depends on itself",
23546 spec
= noexcept_false_spec
;
23548 else if (push_tinst_level (fn
))
23550 push_access_scope (fn
);
23551 push_deferring_access_checks (dk_no_deferred
);
23552 input_location
= DECL_SOURCE_LOCATION (fn
);
23553 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
23554 DEFERRED_NOEXCEPT_ARGS (noex
),
23555 tf_warning_or_error
, fn
,
23556 /*function_p=*/false,
23557 /*integral_constant_expression_p=*/true);
23558 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
23559 pop_deferring_access_checks ();
23560 pop_access_scope (fn
);
23561 pop_tinst_level ();
23562 if (spec
== error_mark_node
)
23563 spec
= noexcept_false_spec
;
23566 spec
= noexcept_false_spec
;
23571 if (spec
== error_mark_node
)
23574 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
23577 FOR_EACH_CLONE (clone
, fn
)
23579 if (TREE_TYPE (clone
) == fntype
)
23580 TREE_TYPE (clone
) = TREE_TYPE (fn
);
23582 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
23588 /* We're starting to process the function INST, an instantiation of PATTERN;
23589 add their parameters to local_specializations. */
23592 register_parameter_specializations (tree pattern
, tree inst
)
23594 tree tmpl_parm
= DECL_ARGUMENTS (pattern
);
23595 tree spec_parm
= DECL_ARGUMENTS (inst
);
23596 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (inst
))
23598 register_local_specialization (spec_parm
, tmpl_parm
);
23599 spec_parm
= skip_artificial_parms_for (inst
, spec_parm
);
23600 tmpl_parm
= skip_artificial_parms_for (pattern
, tmpl_parm
);
23602 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
23604 if (!DECL_PACK_P (tmpl_parm
))
23606 register_local_specialization (spec_parm
, tmpl_parm
);
23607 spec_parm
= DECL_CHAIN (spec_parm
);
23611 /* Register the (value) argument pack as a specialization of
23612 TMPL_PARM, then move on. */
23613 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
23614 register_local_specialization (argpack
, tmpl_parm
);
23617 gcc_assert (!spec_parm
);
23620 /* Produce the definition of D, a _DECL generated from a template. If
23621 DEFER_OK is true, then we don't have to actually do the
23622 instantiation now; we just have to do it sometime. Normally it is
23623 an error if this is an explicit instantiation but D is undefined.
23624 EXPL_INST_CLASS_MEM_P is true iff D is a member of an explicitly
23625 instantiated class template. */
23628 instantiate_decl (tree d
, bool defer_ok
, bool expl_inst_class_mem_p
)
23630 tree tmpl
= DECL_TI_TEMPLATE (d
);
23637 bool pattern_defined
;
23638 location_t saved_loc
= input_location
;
23639 int saved_unevaluated_operand
= cp_unevaluated_operand
;
23640 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
23644 /* This function should only be used to instantiate templates for
23645 functions and static member variables. */
23646 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
23648 /* A concept is never instantiated. */
23649 gcc_assert (!DECL_DECLARED_CONCEPT_P (d
));
23651 /* Variables are never deferred; if instantiation is required, they
23652 are instantiated right away. That allows for better code in the
23653 case that an expression refers to the value of the variable --
23654 if the variable has a constant value the referring expression can
23655 take advantage of that fact. */
23659 /* Don't instantiate cloned functions. Instead, instantiate the
23660 functions they cloned. */
23661 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
23662 d
= DECL_CLONED_FUNCTION (d
);
23664 if (DECL_TEMPLATE_INSTANTIATED (d
)
23665 || (TREE_CODE (d
) == FUNCTION_DECL
23666 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
23667 || DECL_TEMPLATE_SPECIALIZATION (d
))
23668 /* D has already been instantiated or explicitly specialized, so
23669 there's nothing for us to do here.
23671 It might seem reasonable to check whether or not D is an explicit
23672 instantiation, and, if so, stop here. But when an explicit
23673 instantiation is deferred until the end of the compilation,
23674 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
23675 the instantiation. */
23678 /* Check to see whether we know that this template will be
23679 instantiated in some other file, as with "extern template"
23681 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
23683 /* In general, we do not instantiate such templates. */
23684 if (external_p
&& !always_instantiate_p (d
))
23687 gen_tmpl
= most_general_template (tmpl
);
23688 gen_args
= DECL_TI_ARGS (d
);
23690 if (tmpl
!= gen_tmpl
)
23691 /* We should already have the extra args. */
23692 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
23693 == TMPL_ARGS_DEPTH (gen_args
));
23694 /* And what's in the hash table should match D. */
23695 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
23696 || spec
== NULL_TREE
);
23698 /* This needs to happen before any tsubsting. */
23699 if (! push_tinst_level (d
))
23702 timevar_push (TV_TEMPLATE_INST
);
23704 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
23705 for the instantiation. */
23706 td
= template_for_substitution (d
);
23711 /* Look up an explicit specialization, if any. */
23712 tree tid
= lookup_template_variable (gen_tmpl
, gen_args
);
23713 tree elt
= most_specialized_partial_spec (tid
, tf_warning_or_error
);
23714 if (elt
&& elt
!= error_mark_node
)
23716 td
= TREE_VALUE (elt
);
23717 args
= TREE_PURPOSE (elt
);
23721 code_pattern
= DECL_TEMPLATE_RESULT (td
);
23723 /* We should never be trying to instantiate a member of a class
23724 template or partial specialization. */
23725 gcc_assert (d
!= code_pattern
);
23727 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
23728 || DECL_TEMPLATE_SPECIALIZATION (td
))
23729 /* In the case of a friend template whose definition is provided
23730 outside the class, we may have too many arguments. Drop the
23731 ones we don't need. The same is true for specializations. */
23732 args
= get_innermost_template_args
23733 (args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
23735 if (TREE_CODE (d
) == FUNCTION_DECL
)
23737 deleted_p
= DECL_DELETED_FN (code_pattern
);
23738 pattern_defined
= ((DECL_SAVED_TREE (code_pattern
) != NULL_TREE
23739 && DECL_INITIAL (code_pattern
) != error_mark_node
)
23740 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
23746 if (DECL_CLASS_SCOPE_P (code_pattern
))
23747 pattern_defined
= (! DECL_IN_AGGR_P (code_pattern
)
23748 || DECL_INLINE_VAR_P (code_pattern
));
23750 pattern_defined
= ! DECL_EXTERNAL (code_pattern
);
23753 /* We may be in the middle of deferred access check. Disable it now. */
23754 push_deferring_access_checks (dk_no_deferred
);
23756 /* Unless an explicit instantiation directive has already determined
23757 the linkage of D, remember that a definition is available for
23759 if (pattern_defined
23760 && !DECL_INTERFACE_KNOWN (d
)
23761 && !DECL_NOT_REALLY_EXTERN (d
))
23762 mark_definable (d
);
23764 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
23765 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
23766 input_location
= DECL_SOURCE_LOCATION (d
);
23768 /* If D is a member of an explicitly instantiated class template,
23769 and no definition is available, treat it like an implicit
23771 if (!pattern_defined
&& expl_inst_class_mem_p
23772 && DECL_EXPLICIT_INSTANTIATION (d
))
23774 /* Leave linkage flags alone on instantiations with anonymous
23776 if (TREE_PUBLIC (d
))
23778 DECL_NOT_REALLY_EXTERN (d
) = 0;
23779 DECL_INTERFACE_KNOWN (d
) = 0;
23781 SET_DECL_IMPLICIT_INSTANTIATION (d
);
23784 /* Defer all other templates, unless we have been explicitly
23785 forbidden from doing so. */
23786 if (/* If there is no definition, we cannot instantiate the
23789 /* If it's OK to postpone instantiation, do so. */
23791 /* If this is a static data member that will be defined
23792 elsewhere, we don't want to instantiate the entire data
23793 member, but we do want to instantiate the initializer so that
23794 we can substitute that elsewhere. */
23795 || (external_p
&& VAR_P (d
))
23796 /* Handle here a deleted function too, avoid generating
23797 its body (c++/61080). */
23800 /* The definition of the static data member is now required so
23801 we must substitute the initializer. */
23803 && !DECL_INITIAL (d
)
23804 && DECL_INITIAL (code_pattern
))
23808 bool const_init
= false;
23809 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
23811 ns
= decl_namespace_context (d
);
23812 push_nested_namespace (ns
);
23814 push_nested_class (DECL_CONTEXT (d
));
23815 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
23817 tf_warning_or_error
, NULL_TREE
,
23818 /*integral_constant_expression_p=*/false);
23819 /* If instantiating the initializer involved instantiating this
23820 again, don't call cp_finish_decl twice. */
23821 if (!DECL_INITIAL (d
))
23823 /* Make sure the initializer is still constant, in case of
23824 circular dependency (template/instantiate6.C). */
23826 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
23827 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
23828 /*asmspec_tree=*/NULL_TREE
,
23829 LOOKUP_ONLYCONVERTING
);
23832 pop_nested_class ();
23833 pop_nested_namespace (ns
);
23836 /* We restore the source position here because it's used by
23837 add_pending_template. */
23838 input_location
= saved_loc
;
23840 if (at_eof
&& !pattern_defined
23841 && DECL_EXPLICIT_INSTANTIATION (d
)
23842 && DECL_NOT_REALLY_EXTERN (d
))
23845 The definition of a non-exported function template, a
23846 non-exported member function template, or a non-exported
23847 member function or static data member of a class template
23848 shall be present in every translation unit in which it is
23849 explicitly instantiated. */
23850 permerror (input_location
, "explicit instantiation of %qD "
23851 "but no definition available", d
);
23853 /* If we're in unevaluated context, we just wanted to get the
23854 constant value; this isn't an odr use, so don't queue
23855 a full instantiation. */
23856 if (cp_unevaluated_operand
!= 0)
23858 /* ??? Historically, we have instantiated inline functions, even
23859 when marked as "extern template". */
23860 if (!(external_p
&& VAR_P (d
)))
23861 add_pending_template (d
);
23864 /* Tell the repository that D is available in this translation unit
23865 -- and see if it is supposed to be instantiated here. */
23866 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
23868 /* In a PCH file, despite the fact that the repository hasn't
23869 requested instantiation in the PCH it is still possible that
23870 an instantiation will be required in a file that includes the
23873 add_pending_template (d
);
23874 /* Instantiate inline functions so that the inliner can do its
23875 job, even though we'll not be emitting a copy of this
23877 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
23881 bool push_to_top
, nested
;
23883 fn_context
= decl_function_context (d
);
23884 if (LAMBDA_FUNCTION_P (d
))
23885 /* tsubst_lambda_expr resolved any references to enclosing functions. */
23886 fn_context
= NULL_TREE
;
23887 nested
= current_function_decl
!= NULL_TREE
;
23888 push_to_top
= !(nested
&& fn_context
== current_function_decl
);
23890 vec
<tree
> omp_privatization_save
;
23892 save_omp_privatization_clauses (omp_privatization_save
);
23895 push_to_top_level ();
23898 gcc_assert (!processing_template_decl
);
23899 push_function_context ();
23900 cp_unevaluated_operand
= 0;
23901 c_inhibit_evaluation_warnings
= 0;
23904 /* Mark D as instantiated so that recursive calls to
23905 instantiate_decl do not try to instantiate it again. */
23906 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
23908 /* Regenerate the declaration in case the template has been modified
23909 by a subsequent redeclaration. */
23910 regenerate_decl_from_template (d
, td
, args
);
23912 /* We already set the file and line above. Reset them now in case
23913 they changed as a result of calling regenerate_decl_from_template. */
23914 input_location
= DECL_SOURCE_LOCATION (d
);
23919 bool const_init
= false;
23921 /* Clear out DECL_RTL; whatever was there before may not be right
23922 since we've reset the type of the declaration. */
23923 SET_DECL_RTL (d
, NULL
);
23924 DECL_IN_AGGR_P (d
) = 0;
23926 /* The initializer is placed in DECL_INITIAL by
23927 regenerate_decl_from_template so we don't need to
23928 push/pop_access_scope again here. Pull it out so that
23929 cp_finish_decl can process it. */
23930 init
= DECL_INITIAL (d
);
23931 DECL_INITIAL (d
) = NULL_TREE
;
23932 DECL_INITIALIZED_P (d
) = 0;
23934 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
23935 initializer. That function will defer actual emission until
23936 we have a chance to determine linkage. */
23937 DECL_EXTERNAL (d
) = 0;
23939 /* Enter the scope of D so that access-checking works correctly. */
23940 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
23942 push_nested_class (DECL_CONTEXT (d
));
23944 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
23945 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
23948 pop_nested_class ();
23950 if (variable_template_p (gen_tmpl
))
23951 note_variable_template_instantiation (d
);
23953 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
23954 synthesize_method (d
);
23955 else if (TREE_CODE (d
) == FUNCTION_DECL
)
23957 /* Set up the list of local specializations. */
23958 local_specialization_stack
lss (push_to_top
? lss_blank
: lss_copy
);
23959 tree block
= NULL_TREE
;
23961 /* Set up context. */
23962 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
23963 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
23964 block
= push_stmt_list ();
23966 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
23968 /* Some typedefs referenced from within the template code need to be
23969 access checked at template instantiation time, i.e now. These
23970 types were added to the template at parsing time. Let's get those
23971 and perform the access checks then. */
23972 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (td
),
23975 /* Create substitution entries for the parameters. */
23976 register_parameter_specializations (code_pattern
, d
);
23978 /* Substitute into the body of the function. */
23979 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
23980 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
23981 tf_warning_or_error
, tmpl
);
23984 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
23985 tf_warning_or_error
, tmpl
,
23986 /*integral_constant_expression_p=*/false);
23988 /* Set the current input_location to the end of the function
23989 so that finish_function knows where we are. */
23991 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
23993 /* Remember if we saw an infinite loop in the template. */
23994 current_function_infinite_loop
23995 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
23998 /* Finish the function. */
23999 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
24000 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
24001 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
24004 d
= finish_function (/*inline_p=*/false);
24005 expand_or_defer_fn (d
);
24008 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
24009 cp_check_omp_declare_reduction (d
);
24012 /* We're not deferring instantiation any more. */
24013 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
24016 pop_from_top_level ();
24018 pop_function_context ();
24021 restore_omp_privatization_clauses (omp_privatization_save
);
24024 pop_deferring_access_checks ();
24025 timevar_pop (TV_TEMPLATE_INST
);
24026 pop_tinst_level ();
24027 input_location
= saved_loc
;
24028 cp_unevaluated_operand
= saved_unevaluated_operand
;
24029 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
24034 /* Run through the list of templates that we wish we could
24035 instantiate, and instantiate any we can. RETRIES is the
24036 number of times we retry pending template instantiation. */
24039 instantiate_pending_templates (int retries
)
24042 location_t saved_loc
= input_location
;
24044 /* Instantiating templates may trigger vtable generation. This in turn
24045 may require further template instantiations. We place a limit here
24046 to avoid infinite loop. */
24047 if (pending_templates
&& retries
>= max_tinst_depth
)
24049 tree decl
= pending_templates
->tinst
->maybe_get_node ();
24051 fatal_error (input_location
,
24052 "template instantiation depth exceeds maximum of %d"
24053 " instantiating %q+D, possibly from virtual table generation"
24054 " (use -ftemplate-depth= to increase the maximum)",
24055 max_tinst_depth
, decl
);
24056 if (TREE_CODE (decl
) == FUNCTION_DECL
)
24057 /* Pretend that we defined it. */
24058 DECL_INITIAL (decl
) = error_mark_node
;
24064 struct pending_template
**t
= &pending_templates
;
24065 struct pending_template
*last
= NULL
;
24069 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
24070 bool complete
= false;
24072 if (TYPE_P (instantiation
))
24074 if (!COMPLETE_TYPE_P (instantiation
))
24076 instantiate_class_template (instantiation
);
24077 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
24078 for (tree fld
= TYPE_FIELDS (instantiation
);
24079 fld
; fld
= TREE_CHAIN (fld
))
24081 || (TREE_CODE (fld
) == FUNCTION_DECL
24082 && !DECL_ARTIFICIAL (fld
)))
24083 && DECL_TEMPLATE_INSTANTIATION (fld
))
24084 instantiate_decl (fld
,
24085 /*defer_ok=*/false,
24086 /*expl_inst_class_mem_p=*/false);
24088 if (COMPLETE_TYPE_P (instantiation
))
24092 complete
= COMPLETE_TYPE_P (instantiation
);
24096 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
24097 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
24100 = instantiate_decl (instantiation
,
24101 /*defer_ok=*/false,
24102 /*expl_inst_class_mem_p=*/false);
24103 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
24107 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
24108 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
24113 /* If INSTANTIATION has been instantiated, then we don't
24114 need to consider it again in the future. */
24115 struct pending_template
*drop
= *t
;
24117 set_refcount_ptr (drop
->tinst
);
24118 pending_template_freelist ().free (drop
);
24126 set_refcount_ptr (current_tinst_level
);
24128 last_pending_template
= last
;
24130 while (reconsider
);
24132 input_location
= saved_loc
;
24135 /* Substitute ARGVEC into T, which is a list of initializers for
24136 either base class or a non-static data member. The TREE_PURPOSEs
24137 are DECLs, and the TREE_VALUEs are the initializer values. Used by
24138 instantiate_decl. */
24141 tsubst_initializer_list (tree t
, tree argvec
)
24143 tree inits
= NULL_TREE
;
24144 tree target_ctor
= error_mark_node
;
24146 for (; t
; t
= TREE_CHAIN (t
))
24150 tree expanded_bases
= NULL_TREE
;
24151 tree expanded_arguments
= NULL_TREE
;
24154 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
24159 /* Expand the base class expansion type into separate base
24161 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
24162 tf_warning_or_error
,
24164 if (expanded_bases
== error_mark_node
)
24167 /* We'll be building separate TREE_LISTs of arguments for
24169 len
= TREE_VEC_LENGTH (expanded_bases
);
24170 expanded_arguments
= make_tree_vec (len
);
24171 for (i
= 0; i
< len
; i
++)
24172 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
24174 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
24175 expand each argument in the TREE_VALUE of t. */
24176 expr
= make_node (EXPR_PACK_EXPANSION
);
24177 PACK_EXPANSION_LOCAL_P (expr
) = true;
24178 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
24179 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
24181 if (TREE_VALUE (t
) == void_type_node
)
24182 /* VOID_TYPE_NODE is used to indicate
24183 value-initialization. */
24185 for (i
= 0; i
< len
; i
++)
24186 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
24190 /* Substitute parameter packs into each argument in the
24192 in_base_initializer
= 1;
24193 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
24195 tree expanded_exprs
;
24197 /* Expand the argument. */
24198 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
24200 = tsubst_pack_expansion (expr
, argvec
,
24201 tf_warning_or_error
,
24203 if (expanded_exprs
== error_mark_node
)
24206 /* Prepend each of the expanded expressions to the
24207 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
24208 for (i
= 0; i
< len
; i
++)
24210 TREE_VEC_ELT (expanded_arguments
, i
) =
24211 tree_cons (NULL_TREE
,
24212 TREE_VEC_ELT (expanded_exprs
, i
),
24213 TREE_VEC_ELT (expanded_arguments
, i
));
24216 in_base_initializer
= 0;
24218 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
24219 since we built them backwards. */
24220 for (i
= 0; i
< len
; i
++)
24222 TREE_VEC_ELT (expanded_arguments
, i
) =
24223 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
24228 for (i
= 0; i
< len
; ++i
)
24230 if (expanded_bases
)
24232 decl
= TREE_VEC_ELT (expanded_bases
, i
);
24233 decl
= expand_member_init (decl
);
24234 init
= TREE_VEC_ELT (expanded_arguments
, i
);
24239 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
24240 tf_warning_or_error
, NULL_TREE
);
24242 decl
= expand_member_init (decl
);
24243 if (decl
&& !DECL_P (decl
))
24244 in_base_initializer
= 1;
24246 init
= TREE_VALUE (t
);
24248 if (init
!= void_type_node
)
24249 init
= tsubst_expr (init
, argvec
,
24250 tf_warning_or_error
, NULL_TREE
,
24251 /*integral_constant_expression_p=*/false);
24252 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
24253 /* If we had an initializer but it instantiated to nothing,
24254 value-initialize the object. This will only occur when
24255 the initializer was a pack expansion where the parameter
24256 packs used in that expansion were of length zero. */
24257 init
= void_type_node
;
24258 in_base_initializer
= 0;
24261 if (target_ctor
!= error_mark_node
24262 && init
!= error_mark_node
)
24264 error ("mem-initializer for %qD follows constructor delegation",
24268 /* Look for a target constructor. */
24269 if (init
!= error_mark_node
24270 && decl
&& CLASS_TYPE_P (decl
)
24271 && same_type_p (decl
, current_class_type
))
24273 maybe_warn_cpp0x (CPP0X_DELEGATING_CTORS
);
24276 error ("constructor delegation follows mem-initializer for %qD",
24277 TREE_PURPOSE (inits
));
24280 target_ctor
= init
;
24285 init
= build_tree_list (decl
, init
);
24286 TREE_CHAIN (init
) = inits
;
24294 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
24297 set_current_access_from_decl (tree decl
)
24299 if (TREE_PRIVATE (decl
))
24300 current_access_specifier
= access_private_node
;
24301 else if (TREE_PROTECTED (decl
))
24302 current_access_specifier
= access_protected_node
;
24304 current_access_specifier
= access_public_node
;
24307 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
24308 is the instantiation (which should have been created with
24309 start_enum) and ARGS are the template arguments to use. */
24312 tsubst_enum (tree tag
, tree newtag
, tree args
)
24316 if (SCOPED_ENUM_P (newtag
))
24317 begin_scope (sk_scoped_enum
, newtag
);
24319 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
24324 decl
= TREE_VALUE (e
);
24325 /* Note that in a template enum, the TREE_VALUE is the
24326 CONST_DECL, not the corresponding INTEGER_CST. */
24327 value
= tsubst_expr (DECL_INITIAL (decl
),
24328 args
, tf_warning_or_error
, NULL_TREE
,
24329 /*integral_constant_expression_p=*/true);
24331 /* Give this enumeration constant the correct access. */
24332 set_current_access_from_decl (decl
);
24334 /* Actually build the enumerator itself. Here we're assuming that
24335 enumerators can't have dependent attributes. */
24336 build_enumerator (DECL_NAME (decl
), value
, newtag
,
24337 DECL_ATTRIBUTES (decl
), DECL_SOURCE_LOCATION (decl
));
24340 if (SCOPED_ENUM_P (newtag
))
24343 finish_enum_value_list (newtag
);
24344 finish_enum (newtag
);
24346 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
24347 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
24350 /* DECL is a FUNCTION_DECL that is a template specialization. Return
24351 its type -- but without substituting the innermost set of template
24352 arguments. So, innermost set of template parameters will appear in
24356 get_mostly_instantiated_function_type (tree decl
)
24358 /* For a function, DECL_TI_TEMPLATE is partially instantiated. */
24359 return TREE_TYPE (DECL_TI_TEMPLATE (decl
));
24362 /* Return truthvalue if we're processing a template different from
24363 the last one involved in diagnostics. */
24365 problematic_instantiation_changed (void)
24367 return current_tinst_level
!= last_error_tinst_level
;
24370 /* Remember current template involved in diagnostics. */
24372 record_last_problematic_instantiation (void)
24374 set_refcount_ptr (last_error_tinst_level
, current_tinst_level
);
24377 struct tinst_level
*
24378 current_instantiation (void)
24380 return current_tinst_level
;
24383 /* Return TRUE if current_function_decl is being instantiated, false
24387 instantiating_current_function_p (void)
24389 return (current_instantiation ()
24390 && (current_instantiation ()->maybe_get_node ()
24391 == current_function_decl
));
24394 /* [temp.param] Check that template non-type parm TYPE is of an allowable
24395 type. Return false for ok, true for disallowed. Issue error and
24396 inform messages under control of COMPLAIN. */
24399 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
24401 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
24403 else if (TYPE_PTR_P (type
))
24405 else if (TYPE_REF_P (type
)
24406 && !TYPE_REF_IS_RVALUE (type
))
24408 else if (TYPE_PTRMEM_P (type
))
24410 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
24412 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
24414 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
24416 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
24418 /* A bound template template parm could later be instantiated to have a valid
24419 nontype parm type via an alias template. */
24420 else if (cxx_dialect
>= cxx11
24421 && TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
24424 if (complain
& tf_error
)
24426 if (type
== error_mark_node
)
24427 inform (input_location
, "invalid template non-type parameter");
24429 error ("%q#T is not a valid type for a template non-type parameter",
24435 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
24436 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
24439 dependent_type_p_r (tree type
)
24445 A type is dependent if it is:
24447 -- a template parameter. Template template parameters are types
24448 for us (since TYPE_P holds true for them) so we handle
24450 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
24451 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
24453 /* -- a qualified-id with a nested-name-specifier which contains a
24454 class-name that names a dependent type or whose unqualified-id
24455 names a dependent type. */
24456 if (TREE_CODE (type
) == TYPENAME_TYPE
)
24459 /* An alias template specialization can be dependent even if the
24460 resulting type is not. */
24461 if (dependent_alias_template_spec_p (type
))
24464 /* -- a cv-qualified type where the cv-unqualified type is
24466 No code is necessary for this bullet; the code below handles
24467 cv-qualified types, and we don't want to strip aliases with
24468 TYPE_MAIN_VARIANT because of DR 1558. */
24469 /* -- a compound type constructed from any dependent type. */
24470 if (TYPE_PTRMEM_P (type
))
24471 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
24472 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
24474 else if (TYPE_PTR_P (type
)
24475 || TYPE_REF_P (type
))
24476 return dependent_type_p (TREE_TYPE (type
));
24477 else if (TREE_CODE (type
) == FUNCTION_TYPE
24478 || TREE_CODE (type
) == METHOD_TYPE
)
24482 if (dependent_type_p (TREE_TYPE (type
)))
24484 for (arg_type
= TYPE_ARG_TYPES (type
);
24486 arg_type
= TREE_CHAIN (arg_type
))
24487 if (dependent_type_p (TREE_VALUE (arg_type
)))
24489 if (cxx_dialect
>= cxx17
)
24490 /* A value-dependent noexcept-specifier makes the type dependent. */
24491 if (tree spec
= TYPE_RAISES_EXCEPTIONS (type
))
24492 if (tree noex
= TREE_PURPOSE (spec
))
24493 /* Treat DEFERRED_NOEXCEPT as non-dependent, since it doesn't
24494 affect overload resolution and treating it as dependent breaks
24496 if (TREE_CODE (noex
) != DEFERRED_NOEXCEPT
24497 && value_dependent_expression_p (noex
))
24501 /* -- an array type constructed from any dependent type or whose
24502 size is specified by a constant expression that is
24505 We checked for type- and value-dependence of the bounds in
24506 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
24507 if (TREE_CODE (type
) == ARRAY_TYPE
)
24509 if (TYPE_DOMAIN (type
)
24510 && dependent_type_p (TYPE_DOMAIN (type
)))
24512 return dependent_type_p (TREE_TYPE (type
));
24515 /* -- a template-id in which either the template name is a template
24517 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
24519 /* ... or any of the template arguments is a dependent type or
24520 an expression that is type-dependent or value-dependent. */
24521 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
24522 && (any_dependent_template_arguments_p
24523 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
24526 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
24527 dependent; if the argument of the `typeof' expression is not
24528 type-dependent, then it should already been have resolved. */
24529 if (TREE_CODE (type
) == TYPEOF_TYPE
24530 || TREE_CODE (type
) == DECLTYPE_TYPE
24531 || TREE_CODE (type
) == UNDERLYING_TYPE
)
24534 /* A template argument pack is dependent if any of its packed
24536 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
24538 tree args
= ARGUMENT_PACK_ARGS (type
);
24539 int i
, len
= TREE_VEC_LENGTH (args
);
24540 for (i
= 0; i
< len
; ++i
)
24541 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
24545 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
24546 be template parameters. */
24547 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
24550 if (any_dependent_type_attributes_p (TYPE_ATTRIBUTES (type
)))
24553 /* The standard does not specifically mention types that are local
24554 to template functions or local classes, but they should be
24555 considered dependent too. For example:
24557 template <int I> void f() {
24562 The size of `E' cannot be known until the value of `I' has been
24563 determined. Therefore, `E' must be considered dependent. */
24564 scope
= TYPE_CONTEXT (type
);
24565 if (scope
&& TYPE_P (scope
))
24566 return dependent_type_p (scope
);
24567 /* Don't use type_dependent_expression_p here, as it can lead
24568 to infinite recursion trying to determine whether a lambda
24569 nested in a lambda is dependent (c++/47687). */
24570 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
24571 && DECL_LANG_SPECIFIC (scope
)
24572 && DECL_TEMPLATE_INFO (scope
)
24573 && (any_dependent_template_arguments_p
24574 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
24577 /* Other types are non-dependent. */
24581 /* Returns TRUE if TYPE is dependent, in the sense of
24582 [temp.dep.type]. Note that a NULL type is considered dependent. */
24585 dependent_type_p (tree type
)
24587 /* If there are no template parameters in scope, then there can't be
24588 any dependent types. */
24589 if (!processing_template_decl
)
24591 /* If we are not processing a template, then nobody should be
24592 providing us with a dependent type. */
24594 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
24598 /* If the type is NULL, we have not computed a type for the entity
24599 in question; in that case, the type is dependent. */
24603 /* Erroneous types can be considered non-dependent. */
24604 if (type
== error_mark_node
)
24607 /* Getting here with global_type_node means we improperly called this
24608 function on the TREE_TYPE of an IDENTIFIER_NODE. */
24609 gcc_checking_assert (type
!= global_type_node
);
24611 /* If we have not already computed the appropriate value for TYPE,
24613 if (!TYPE_DEPENDENT_P_VALID (type
))
24615 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
24616 TYPE_DEPENDENT_P_VALID (type
) = 1;
24619 return TYPE_DEPENDENT_P (type
);
24622 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
24623 lookup. In other words, a dependent type that is not the current
24627 dependent_scope_p (tree scope
)
24629 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
24630 && !currently_open_class (scope
));
24633 /* T is a SCOPE_REF. Return whether it represents a non-static member of
24634 an unknown base of 'this' (and is therefore instantiation-dependent). */
24637 unknown_base_ref_p (tree t
)
24639 if (!current_class_ptr
)
24642 tree mem
= TREE_OPERAND (t
, 1);
24643 if (shared_member_p (mem
))
24646 tree cur
= current_nonlambda_class_type ();
24647 if (!any_dependent_bases_p (cur
))
24650 tree ctx
= TREE_OPERAND (t
, 0);
24651 if (DERIVED_FROM_P (ctx
, cur
))
24657 /* T is a SCOPE_REF; return whether we need to consider it
24658 instantiation-dependent so that we can check access at instantiation
24659 time even though we know which member it resolves to. */
24662 instantiation_dependent_scope_ref_p (tree t
)
24664 if (DECL_P (TREE_OPERAND (t
, 1))
24665 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
24666 && !unknown_base_ref_p (t
)
24667 && accessible_in_template_p (TREE_OPERAND (t
, 0),
24668 TREE_OPERAND (t
, 1)))
24674 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
24675 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
24678 /* Note that this predicate is not appropriate for general expressions;
24679 only constant expressions (that satisfy potential_constant_expression)
24680 can be tested for value dependence. */
24683 value_dependent_expression_p (tree expression
)
24685 if (!processing_template_decl
|| expression
== NULL_TREE
)
24688 /* A type-dependent expression is also value-dependent. */
24689 if (type_dependent_expression_p (expression
))
24692 switch (TREE_CODE (expression
))
24695 /* A dependent member function of the current instantiation. */
24696 return dependent_type_p (BINFO_TYPE (BASELINK_BINFO (expression
)));
24698 case FUNCTION_DECL
:
24699 /* A dependent member function of the current instantiation. */
24700 if (DECL_CLASS_SCOPE_P (expression
)
24701 && dependent_type_p (DECL_CONTEXT (expression
)))
24705 case IDENTIFIER_NODE
:
24706 /* A name that has not been looked up -- must be dependent. */
24709 case TEMPLATE_PARM_INDEX
:
24710 /* A non-type template parm. */
24714 /* A non-type template parm. */
24715 if (DECL_TEMPLATE_PARM_P (expression
))
24717 return value_dependent_expression_p (DECL_INITIAL (expression
));
24720 /* A constant with literal type and is initialized
24721 with an expression that is value-dependent. */
24722 if (DECL_DEPENDENT_INIT_P (expression
)
24723 /* FIXME cp_finish_decl doesn't fold reference initializers. */
24724 || TYPE_REF_P (TREE_TYPE (expression
)))
24726 if (DECL_HAS_VALUE_EXPR_P (expression
))
24728 tree value_expr
= DECL_VALUE_EXPR (expression
);
24729 if (value_dependent_expression_p (value_expr
))
24734 case DYNAMIC_CAST_EXPR
:
24735 case STATIC_CAST_EXPR
:
24736 case CONST_CAST_EXPR
:
24737 case REINTERPRET_CAST_EXPR
:
24739 case IMPLICIT_CONV_EXPR
:
24740 /* These expressions are value-dependent if the type to which
24741 the cast occurs is dependent or the expression being casted
24742 is value-dependent. */
24744 tree type
= TREE_TYPE (expression
);
24746 if (dependent_type_p (type
))
24749 /* A functional cast has a list of operands. */
24750 expression
= TREE_OPERAND (expression
, 0);
24753 /* If there are no operands, it must be an expression such
24754 as "int()". This should not happen for aggregate types
24755 because it would form non-constant expressions. */
24756 gcc_assert (cxx_dialect
>= cxx11
24757 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
24762 if (TREE_CODE (expression
) == TREE_LIST
)
24763 return any_value_dependent_elements_p (expression
);
24765 return value_dependent_expression_p (expression
);
24769 if (SIZEOF_EXPR_TYPE_P (expression
))
24770 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
24774 /* A `sizeof' expression is value-dependent if the operand is
24775 type-dependent or is a pack expansion. */
24776 expression
= TREE_OPERAND (expression
, 0);
24777 if (PACK_EXPANSION_P (expression
))
24779 else if (TYPE_P (expression
))
24780 return dependent_type_p (expression
);
24781 return instantiation_dependent_uneval_expression_p (expression
);
24783 case AT_ENCODE_EXPR
:
24784 /* An 'encode' expression is value-dependent if the operand is
24786 expression
= TREE_OPERAND (expression
, 0);
24787 return dependent_type_p (expression
);
24789 case NOEXCEPT_EXPR
:
24790 expression
= TREE_OPERAND (expression
, 0);
24791 return instantiation_dependent_uneval_expression_p (expression
);
24794 /* All instantiation-dependent expressions should also be considered
24795 value-dependent. */
24796 return instantiation_dependent_scope_ref_p (expression
);
24798 case COMPONENT_REF
:
24799 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
24800 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
24802 case NONTYPE_ARGUMENT_PACK
:
24803 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
24804 is value-dependent. */
24806 tree values
= ARGUMENT_PACK_ARGS (expression
);
24807 int i
, len
= TREE_VEC_LENGTH (values
);
24809 for (i
= 0; i
< len
; ++i
)
24810 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
24818 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
24820 if (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
)))
24826 if (TREE_CODE (type2
) != TREE_LIST
)
24827 return dependent_type_p (type2
);
24829 for (; type2
; type2
= TREE_CHAIN (type2
))
24830 if (dependent_type_p (TREE_VALUE (type2
)))
24837 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
24838 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
24841 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
24842 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
24846 tree op
= TREE_OPERAND (expression
, 0);
24847 return (value_dependent_expression_p (op
)
24848 || has_value_dependent_address (op
));
24851 case REQUIRES_EXPR
:
24852 /* Treat all requires-expressions as value-dependent so
24853 we don't try to fold them. */
24857 return dependent_type_p (TREE_OPERAND (expression
, 0));
24861 if (value_dependent_expression_p (CALL_EXPR_FN (expression
)))
24863 tree fn
= get_callee_fndecl (expression
);
24865 nargs
= call_expr_nargs (expression
);
24866 for (i
= 0; i
< nargs
; ++i
)
24868 tree op
= CALL_EXPR_ARG (expression
, i
);
24869 /* In a call to a constexpr member function, look through the
24870 implicit ADDR_EXPR on the object argument so that it doesn't
24871 cause the call to be considered value-dependent. We also
24872 look through it in potential_constant_expression. */
24873 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
24874 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
24875 && TREE_CODE (op
) == ADDR_EXPR
)
24876 op
= TREE_OPERAND (op
, 0);
24877 if (value_dependent_expression_p (op
))
24883 case TEMPLATE_ID_EXPR
:
24884 return variable_concept_p (TREE_OPERAND (expression
, 0));
24890 if (dependent_type_p (TREE_TYPE (expression
)))
24892 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
24893 if (value_dependent_expression_p (val
))
24899 /* Treat a GNU statement expression as dependent to avoid crashing
24900 under instantiate_non_dependent_expr; it can't be constant. */
24904 /* A constant expression is value-dependent if any subexpression is
24905 value-dependent. */
24906 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
24908 case tcc_reference
:
24910 case tcc_comparison
:
24912 case tcc_expression
:
24915 int i
, len
= cp_tree_operand_length (expression
);
24917 for (i
= 0; i
< len
; i
++)
24919 tree t
= TREE_OPERAND (expression
, i
);
24921 /* In some cases, some of the operands may be missing.
24922 (For example, in the case of PREDECREMENT_EXPR, the
24923 amount to increment by may be missing.) That doesn't
24924 make the expression dependent. */
24925 if (t
&& value_dependent_expression_p (t
))
24936 /* The expression is not value-dependent. */
24940 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
24941 [temp.dep.expr]. Note that an expression with no type is
24942 considered dependent. Other parts of the compiler arrange for an
24943 expression with type-dependent subexpressions to have no type, so
24944 this function doesn't have to be fully recursive. */
24947 type_dependent_expression_p (tree expression
)
24949 if (!processing_template_decl
)
24952 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
24955 STRIP_ANY_LOCATION_WRAPPER (expression
);
24957 /* An unresolved name is always dependent. */
24958 if (identifier_p (expression
)
24959 || TREE_CODE (expression
) == USING_DECL
24960 || TREE_CODE (expression
) == WILDCARD_DECL
)
24963 /* A fold expression is type-dependent. */
24964 if (TREE_CODE (expression
) == UNARY_LEFT_FOLD_EXPR
24965 || TREE_CODE (expression
) == UNARY_RIGHT_FOLD_EXPR
24966 || TREE_CODE (expression
) == BINARY_LEFT_FOLD_EXPR
24967 || TREE_CODE (expression
) == BINARY_RIGHT_FOLD_EXPR
)
24970 /* Some expression forms are never type-dependent. */
24971 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
24972 || TREE_CODE (expression
) == SIZEOF_EXPR
24973 || TREE_CODE (expression
) == ALIGNOF_EXPR
24974 || TREE_CODE (expression
) == AT_ENCODE_EXPR
24975 || TREE_CODE (expression
) == NOEXCEPT_EXPR
24976 || TREE_CODE (expression
) == TRAIT_EXPR
24977 || TREE_CODE (expression
) == TYPEID_EXPR
24978 || TREE_CODE (expression
) == DELETE_EXPR
24979 || TREE_CODE (expression
) == VEC_DELETE_EXPR
24980 || TREE_CODE (expression
) == THROW_EXPR
24981 || TREE_CODE (expression
) == REQUIRES_EXPR
)
24984 /* The types of these expressions depends only on the type to which
24985 the cast occurs. */
24986 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
24987 || TREE_CODE (expression
) == STATIC_CAST_EXPR
24988 || TREE_CODE (expression
) == CONST_CAST_EXPR
24989 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
24990 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
24991 || TREE_CODE (expression
) == CAST_EXPR
)
24992 return dependent_type_p (TREE_TYPE (expression
));
24994 /* The types of these expressions depends only on the type created
24995 by the expression. */
24996 if (TREE_CODE (expression
) == NEW_EXPR
24997 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
24999 /* For NEW_EXPR tree nodes created inside a template, either
25000 the object type itself or a TREE_LIST may appear as the
25002 tree type
= TREE_OPERAND (expression
, 1);
25003 if (TREE_CODE (type
) == TREE_LIST
)
25004 /* This is an array type. We need to check array dimensions
25006 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
25007 || value_dependent_expression_p
25008 (TREE_OPERAND (TREE_VALUE (type
), 1));
25010 return dependent_type_p (type
);
25013 if (TREE_CODE (expression
) == SCOPE_REF
)
25015 tree scope
= TREE_OPERAND (expression
, 0);
25016 tree name
= TREE_OPERAND (expression
, 1);
25018 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
25019 contains an identifier associated by name lookup with one or more
25020 declarations declared with a dependent type, or...a
25021 nested-name-specifier or qualified-id that names a member of an
25022 unknown specialization. */
25023 return (type_dependent_expression_p (name
)
25024 || dependent_scope_p (scope
));
25027 if (TREE_CODE (expression
) == TEMPLATE_DECL
25028 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
25029 return uses_outer_template_parms (expression
);
25031 if (TREE_CODE (expression
) == STMT_EXPR
)
25032 expression
= stmt_expr_value_expr (expression
);
25034 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
25039 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
25041 if (type_dependent_expression_p (elt
))
25047 /* A static data member of the current instantiation with incomplete
25048 array type is type-dependent, as the definition and specializations
25049 can have different bounds. */
25050 if (VAR_P (expression
)
25051 && DECL_CLASS_SCOPE_P (expression
)
25052 && dependent_type_p (DECL_CONTEXT (expression
))
25053 && VAR_HAD_UNKNOWN_BOUND (expression
))
25056 /* An array of unknown bound depending on a variadic parameter, eg:
25058 template<typename... Args>
25059 void foo (Args... args)
25061 int arr[] = { args... };
25064 template<int... vals>
25067 int arr[] = { vals... };
25070 If the array has no length and has an initializer, it must be that
25071 we couldn't determine its length in cp_complete_array_type because
25072 it is dependent. */
25073 if (VAR_P (expression
)
25074 && TREE_TYPE (expression
) != NULL_TREE
25075 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
25076 && !TYPE_DOMAIN (TREE_TYPE (expression
))
25077 && DECL_INITIAL (expression
))
25080 /* A function or variable template-id is type-dependent if it has any
25081 dependent template arguments. */
25082 if (VAR_OR_FUNCTION_DECL_P (expression
)
25083 && DECL_LANG_SPECIFIC (expression
)
25084 && DECL_TEMPLATE_INFO (expression
))
25086 /* Consider the innermost template arguments, since those are the ones
25087 that come from the template-id; the template arguments for the
25088 enclosing class do not make it type-dependent unless they are used in
25089 the type of the decl. */
25090 if (PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (expression
))
25091 && (any_dependent_template_arguments_p
25092 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
25096 /* Otherwise, if the function decl isn't from a dependent scope, it can't be
25097 type-dependent. Checking this is important for functions with auto return
25098 type, which looks like a dependent type. */
25099 if (TREE_CODE (expression
) == FUNCTION_DECL
25100 && !(DECL_CLASS_SCOPE_P (expression
)
25101 && dependent_type_p (DECL_CONTEXT (expression
)))
25102 && !(DECL_LANG_SPECIFIC (expression
)
25103 && DECL_FRIEND_P (expression
)
25104 && (!DECL_FRIEND_CONTEXT (expression
)
25105 || dependent_type_p (DECL_FRIEND_CONTEXT (expression
))))
25106 && !DECL_LOCAL_FUNCTION_P (expression
))
25108 gcc_assert (!dependent_type_p (TREE_TYPE (expression
))
25109 || undeduced_auto_decl (expression
));
25113 /* Always dependent, on the number of arguments if nothing else. */
25114 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
25117 if (TREE_TYPE (expression
) == unknown_type_node
)
25119 if (TREE_CODE (expression
) == ADDR_EXPR
)
25120 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
25121 if (TREE_CODE (expression
) == COMPONENT_REF
25122 || TREE_CODE (expression
) == OFFSET_REF
)
25124 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
25126 expression
= TREE_OPERAND (expression
, 1);
25127 if (identifier_p (expression
))
25130 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
25131 if (TREE_CODE (expression
) == SCOPE_REF
)
25134 if (BASELINK_P (expression
))
25136 if (BASELINK_OPTYPE (expression
)
25137 && dependent_type_p (BASELINK_OPTYPE (expression
)))
25139 expression
= BASELINK_FUNCTIONS (expression
);
25142 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
25144 if (any_dependent_template_arguments_p
25145 (TREE_OPERAND (expression
, 1)))
25147 expression
= TREE_OPERAND (expression
, 0);
25148 if (identifier_p (expression
))
25152 gcc_assert (TREE_CODE (expression
) == OVERLOAD
25153 || TREE_CODE (expression
) == FUNCTION_DECL
);
25155 for (lkp_iterator
iter (expression
); iter
; ++iter
)
25156 if (type_dependent_expression_p (*iter
))
25162 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
25164 /* Dependent type attributes might not have made it from the decl to
25166 if (DECL_P (expression
)
25167 && any_dependent_type_attributes_p (DECL_ATTRIBUTES (expression
)))
25170 return (dependent_type_p (TREE_TYPE (expression
)));
25173 /* [temp.dep.expr]/5: A class member access expression (5.2.5) is
25174 type-dependent if the expression refers to a member of the current
25175 instantiation and the type of the referenced member is dependent, or the
25176 class member access expression refers to a member of an unknown
25179 This function returns true if the OBJECT in such a class member access
25180 expression is of an unknown specialization. */
25183 type_dependent_object_expression_p (tree object
)
25185 /* An IDENTIFIER_NODE can sometimes have a TREE_TYPE, but it's still
25187 if (TREE_CODE (object
) == IDENTIFIER_NODE
)
25189 tree scope
= TREE_TYPE (object
);
25190 return (!scope
|| dependent_scope_p (scope
));
25193 /* walk_tree callback function for instantiation_dependent_expression_p,
25194 below. Returns non-zero if a dependent subexpression is found. */
25197 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
25202 /* We don't have to worry about decltype currently because decltype
25203 of an instantiation-dependent expr is a dependent type. This
25204 might change depending on the resolution of DR 1172. */
25205 *walk_subtrees
= false;
25208 enum tree_code code
= TREE_CODE (*tp
);
25211 /* Don't treat an argument list as dependent just because it has no
25217 case TEMPLATE_PARM_INDEX
:
25220 /* Handle expressions with type operands. */
25224 case AT_ENCODE_EXPR
:
25226 tree op
= TREE_OPERAND (*tp
, 0);
25227 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
25228 op
= TREE_TYPE (op
);
25231 if (dependent_type_p (op
))
25235 *walk_subtrees
= false;
25242 case COMPONENT_REF
:
25243 if (identifier_p (TREE_OPERAND (*tp
, 1)))
25244 /* In a template, finish_class_member_access_expr creates a
25245 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
25246 type-dependent, so that we can check access control at
25247 instantiation time (PR 42277). See also Core issue 1273. */
25252 if (instantiation_dependent_scope_ref_p (*tp
))
25257 /* Treat statement-expressions as dependent. */
25261 /* Treat requires-expressions as dependent. */
25262 case REQUIRES_EXPR
:
25266 /* Treat calls to function concepts as dependent. */
25267 if (function_concept_check_p (*tp
))
25271 case TEMPLATE_ID_EXPR
:
25272 /* And variable concepts. */
25273 if (variable_concept_p (TREE_OPERAND (*tp
, 0)))
25281 if (type_dependent_expression_p (*tp
))
25287 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
25288 sense defined by the ABI:
25290 "An expression is instantiation-dependent if it is type-dependent
25291 or value-dependent, or it has a subexpression that is type-dependent
25292 or value-dependent."
25294 Except don't actually check value-dependence for unevaluated expressions,
25295 because in sizeof(i) we don't care about the value of i. Checking
25296 type-dependence will in turn check value-dependence of array bounds/template
25297 arguments as needed. */
25300 instantiation_dependent_uneval_expression_p (tree expression
)
25304 if (!processing_template_decl
)
25307 if (expression
== error_mark_node
)
25310 result
= cp_walk_tree_without_duplicates (&expression
,
25311 instantiation_dependent_r
, NULL
);
25312 return result
!= NULL_TREE
;
25315 /* As above, but also check value-dependence of the expression as a whole. */
25318 instantiation_dependent_expression_p (tree expression
)
25320 return (instantiation_dependent_uneval_expression_p (expression
)
25321 || value_dependent_expression_p (expression
));
25324 /* Like type_dependent_expression_p, but it also works while not processing
25325 a template definition, i.e. during substitution or mangling. */
25328 type_dependent_expression_p_push (tree expr
)
25331 ++processing_template_decl
;
25332 b
= type_dependent_expression_p (expr
);
25333 --processing_template_decl
;
25337 /* Returns TRUE if ARGS contains a type-dependent expression. */
25340 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
25345 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
25347 if (type_dependent_expression_p (arg
))
25353 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
25354 expressions) contains any type-dependent expressions. */
25357 any_type_dependent_elements_p (const_tree list
)
25359 for (; list
; list
= TREE_CHAIN (list
))
25360 if (type_dependent_expression_p (TREE_VALUE (list
)))
25366 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
25367 expressions) contains any value-dependent expressions. */
25370 any_value_dependent_elements_p (const_tree list
)
25372 for (; list
; list
= TREE_CHAIN (list
))
25373 if (value_dependent_expression_p (TREE_VALUE (list
)))
25379 /* Returns TRUE if the ARG (a template argument) is dependent. */
25382 dependent_template_arg_p (tree arg
)
25384 if (!processing_template_decl
)
25387 /* Assume a template argument that was wrongly written by the user
25388 is dependent. This is consistent with what
25389 any_dependent_template_arguments_p [that calls this function]
25391 if (!arg
|| arg
== error_mark_node
)
25394 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
25395 arg
= argument_pack_select_arg (arg
);
25397 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
25399 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
25401 if (DECL_TEMPLATE_PARM_P (arg
))
25403 /* A member template of a dependent class is not necessarily
25404 type-dependent, but it is a dependent template argument because it
25405 will be a member of an unknown specialization to that template. */
25406 tree scope
= CP_DECL_CONTEXT (arg
);
25407 return TYPE_P (scope
) && dependent_type_p (scope
);
25409 else if (ARGUMENT_PACK_P (arg
))
25411 tree args
= ARGUMENT_PACK_ARGS (arg
);
25412 int i
, len
= TREE_VEC_LENGTH (args
);
25413 for (i
= 0; i
< len
; ++i
)
25415 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
25421 else if (TYPE_P (arg
))
25422 return dependent_type_p (arg
);
25424 return (type_dependent_expression_p (arg
)
25425 || value_dependent_expression_p (arg
));
25428 /* Returns true if ARGS (a collection of template arguments) contains
25429 any types that require structural equality testing. */
25432 any_template_arguments_need_structural_equality_p (tree args
)
25439 if (args
== error_mark_node
)
25442 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
25444 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
25445 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
25447 tree arg
= TREE_VEC_ELT (level
, j
);
25448 tree packed_args
= NULL_TREE
;
25451 if (ARGUMENT_PACK_P (arg
))
25453 /* Look inside the argument pack. */
25454 packed_args
= ARGUMENT_PACK_ARGS (arg
);
25455 len
= TREE_VEC_LENGTH (packed_args
);
25458 for (k
= 0; k
< len
; ++k
)
25461 arg
= TREE_VEC_ELT (packed_args
, k
);
25463 if (error_operand_p (arg
))
25465 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
25467 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
25469 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
25470 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
25479 /* Returns true if ARGS (a collection of template arguments) contains
25480 any dependent arguments. */
25483 any_dependent_template_arguments_p (const_tree args
)
25490 if (args
== error_mark_node
)
25493 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
25495 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
25496 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
25497 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
25504 /* Returns true if ARGS contains any errors. */
25507 any_erroneous_template_args_p (const_tree args
)
25512 if (args
== error_mark_node
)
25515 if (args
&& TREE_CODE (args
) != TREE_VEC
)
25517 if (tree ti
= get_template_info (args
))
25518 args
= TI_ARGS (ti
);
25526 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
25528 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
25529 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
25530 if (error_operand_p (TREE_VEC_ELT (level
, j
)))
25537 /* Returns TRUE if the template TMPL is type-dependent. */
25540 dependent_template_p (tree tmpl
)
25542 if (TREE_CODE (tmpl
) == OVERLOAD
)
25544 for (lkp_iterator
iter (tmpl
); iter
; ++iter
)
25545 if (dependent_template_p (*iter
))
25550 /* Template template parameters are dependent. */
25551 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
25552 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
25554 /* So are names that have not been looked up. */
25555 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
25560 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
25563 dependent_template_id_p (tree tmpl
, tree args
)
25565 return (dependent_template_p (tmpl
)
25566 || any_dependent_template_arguments_p (args
));
25569 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
25573 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
25577 if (!processing_template_decl
)
25580 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
25582 tree decl
= TREE_VEC_ELT (declv
, i
);
25583 tree init
= TREE_VEC_ELT (initv
, i
);
25584 tree cond
= TREE_VEC_ELT (condv
, i
);
25585 tree incr
= TREE_VEC_ELT (incrv
, i
);
25587 if (type_dependent_expression_p (decl
)
25588 || TREE_CODE (decl
) == SCOPE_REF
)
25591 if (init
&& type_dependent_expression_p (init
))
25594 if (type_dependent_expression_p (cond
))
25597 if (COMPARISON_CLASS_P (cond
)
25598 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
25599 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
25602 if (TREE_CODE (incr
) == MODOP_EXPR
)
25604 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
25605 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
25608 else if (type_dependent_expression_p (incr
))
25610 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
25612 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
25614 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
25616 tree t
= TREE_OPERAND (incr
, 1);
25617 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
25618 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
25627 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
25628 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
25629 no such TYPE can be found. Note that this function peers inside
25630 uninstantiated templates and therefore should be used only in
25631 extremely limited situations. ONLY_CURRENT_P restricts this
25632 peering to the currently open classes hierarchy (which is required
25633 when comparing types). */
25636 resolve_typename_type (tree type
, bool only_current_p
)
25645 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
25647 scope
= TYPE_CONTEXT (type
);
25648 /* We shouldn't have built a TYPENAME_TYPE with a non-dependent scope. */
25649 gcc_checking_assert (uses_template_parms (scope
));
25651 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
25652 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
25653 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
25654 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
25655 identifier of the TYPENAME_TYPE anymore.
25656 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
25657 TYPENAME_TYPE instead, we avoid messing up with a possible
25658 typedef variant case. */
25659 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
25661 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
25662 it first before we can figure out what NAME refers to. */
25663 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
25665 if (TYPENAME_IS_RESOLVING_P (scope
))
25666 /* Given a class template A with a dependent base with nested type C,
25667 typedef typename A::C::C C will land us here, as trying to resolve
25668 the initial A::C leads to the local C typedef, which leads back to
25669 A::C::C. So we break the recursion now. */
25672 scope
= resolve_typename_type (scope
, only_current_p
);
25674 /* If we don't know what SCOPE refers to, then we cannot resolve the
25676 if (!CLASS_TYPE_P (scope
))
25678 /* If this is a typedef, we don't want to look inside (c++/11987). */
25679 if (typedef_variant_p (type
))
25681 /* If SCOPE isn't the template itself, it will not have a valid
25682 TYPE_FIELDS list. */
25683 if (same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
25684 /* scope is either the template itself or a compatible instantiation
25685 like X<T>, so look up the name in the original template. */
25686 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
25687 /* If scope has no fields, it can't be a current instantiation. Check this
25688 before currently_open_class to avoid infinite recursion (71515). */
25689 if (!TYPE_FIELDS (scope
))
25691 /* If the SCOPE is not the current instantiation, there's no reason
25692 to look inside it. */
25693 if (only_current_p
&& !currently_open_class (scope
))
25695 /* Enter the SCOPE so that name lookup will be resolved as if we
25696 were in the class definition. In particular, SCOPE will no
25697 longer be considered a dependent type. */
25698 pushed_scope
= push_scope (scope
);
25699 /* Look up the declaration. */
25700 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
25701 tf_warning_or_error
);
25703 result
= NULL_TREE
;
25705 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
25706 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
25707 tree fullname
= TYPENAME_TYPE_FULLNAME (type
);
25710 else if (identifier_p (fullname
)
25711 && TREE_CODE (decl
) == TYPE_DECL
)
25713 result
= TREE_TYPE (decl
);
25714 if (result
== error_mark_node
)
25715 result
= NULL_TREE
;
25717 else if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
25718 && DECL_CLASS_TEMPLATE_P (decl
))
25720 /* Obtain the template and the arguments. */
25721 tree tmpl
= TREE_OPERAND (fullname
, 0);
25722 if (TREE_CODE (tmpl
) == IDENTIFIER_NODE
)
25724 /* We get here with a plain identifier because a previous tentative
25725 parse of the nested-name-specifier as part of a ptr-operator saw
25726 ::template X<A>. The use of ::template is necessary in a
25727 ptr-operator, but wrong in a declarator-id.
25729 [temp.names]: In a qualified-id of a declarator-id, the keyword
25730 template shall not appear at the top level. */
25731 pedwarn (EXPR_LOC_OR_LOC (fullname
, input_location
), OPT_Wpedantic
,
25732 "keyword %<template%> not allowed in declarator-id");
25735 tree args
= TREE_OPERAND (fullname
, 1);
25736 /* Instantiate the template. */
25737 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
25738 /*entering_scope=*/true,
25739 tf_error
| tf_user
);
25740 if (result
== error_mark_node
)
25741 result
= NULL_TREE
;
25744 /* Leave the SCOPE. */
25746 pop_scope (pushed_scope
);
25748 /* If we failed to resolve it, return the original typename. */
25752 /* If lookup found a typename type, resolve that too. */
25753 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
25755 /* Ill-formed programs can cause infinite recursion here, so we
25756 must catch that. */
25757 TYPENAME_IS_RESOLVING_P (result
) = 1;
25758 result
= resolve_typename_type (result
, only_current_p
);
25759 TYPENAME_IS_RESOLVING_P (result
) = 0;
25762 /* Qualify the resulting type. */
25763 quals
= cp_type_quals (type
);
25765 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
25770 /* EXPR is an expression which is not type-dependent. Return a proxy
25771 for EXPR that can be used to compute the types of larger
25772 expressions containing EXPR. */
25775 build_non_dependent_expr (tree expr
)
25777 tree orig_expr
= expr
;
25780 /* When checking, try to get a constant value for all non-dependent
25781 expressions in order to expose bugs in *_dependent_expression_p
25782 and constexpr. This can affect code generation, see PR70704, so
25783 only do this for -fchecking=2. */
25784 if (flag_checking
> 1
25785 && cxx_dialect
>= cxx11
25786 /* Don't do this during nsdmi parsing as it can lead to
25787 unexpected recursive instantiations. */
25788 && !parsing_nsdmi ()
25789 /* Don't do this during concept expansion either and for
25790 the same reason. */
25791 && !expanding_concept ())
25792 fold_non_dependent_expr (expr
);
25794 STRIP_ANY_LOCATION_WRAPPER (expr
);
25796 /* Preserve OVERLOADs; the functions must be available to resolve
25799 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
25800 inner_expr
= stmt_expr_value_expr (inner_expr
);
25801 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
25802 inner_expr
= TREE_OPERAND (inner_expr
, 0);
25803 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
25804 inner_expr
= TREE_OPERAND (inner_expr
, 1);
25805 if (is_overloaded_fn (inner_expr
)
25806 || TREE_CODE (inner_expr
) == OFFSET_REF
)
25808 /* There is no need to return a proxy for a variable. */
25811 /* Preserve string constants; conversions from string constants to
25812 "char *" are allowed, even though normally a "const char *"
25813 cannot be used to initialize a "char *". */
25814 if (TREE_CODE (expr
) == STRING_CST
)
25816 /* Preserve void and arithmetic constants, as an optimization -- there is no
25817 reason to create a new node. */
25818 if (TREE_CODE (expr
) == VOID_CST
25819 || TREE_CODE (expr
) == INTEGER_CST
25820 || TREE_CODE (expr
) == REAL_CST
)
25822 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
25823 There is at least one place where we want to know that a
25824 particular expression is a throw-expression: when checking a ?:
25825 expression, there are special rules if the second or third
25826 argument is a throw-expression. */
25827 if (TREE_CODE (expr
) == THROW_EXPR
)
25830 /* Don't wrap an initializer list, we need to be able to look inside. */
25831 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
25834 /* Don't wrap a dummy object, we need to be able to test for it. */
25835 if (is_dummy_object (expr
))
25838 if (TREE_CODE (expr
) == COND_EXPR
)
25839 return build3 (COND_EXPR
,
25841 TREE_OPERAND (expr
, 0),
25842 (TREE_OPERAND (expr
, 1)
25843 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
25844 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
25845 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
25846 if (TREE_CODE (expr
) == COMPOUND_EXPR
25847 && !COMPOUND_EXPR_OVERLOADED (expr
))
25848 return build2 (COMPOUND_EXPR
,
25850 TREE_OPERAND (expr
, 0),
25851 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
25853 /* If the type is unknown, it can't really be non-dependent */
25854 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
25856 /* Otherwise, build a NON_DEPENDENT_EXPR. */
25857 return build1_loc (EXPR_LOCATION (orig_expr
), NON_DEPENDENT_EXPR
,
25858 TREE_TYPE (expr
), expr
);
25861 /* ARGS is a vector of expressions as arguments to a function call.
25862 Replace the arguments with equivalent non-dependent expressions.
25863 This modifies ARGS in place. */
25866 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
25871 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
25873 tree newarg
= build_non_dependent_expr (arg
);
25875 (*args
)[ix
] = newarg
;
25879 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
25880 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
25881 parms. If set_canonical is true, we set TYPE_CANONICAL on it. */
25884 make_auto_1 (tree name
, bool set_canonical
)
25886 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
25887 TYPE_NAME (au
) = build_decl (input_location
,
25888 TYPE_DECL
, name
, au
);
25889 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
25890 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
25891 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
25892 TYPE_NAME (au
), NULL_TREE
);
25894 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
25895 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
25896 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
25902 make_decltype_auto (void)
25904 return make_auto_1 (decltype_auto_identifier
, true);
25910 return make_auto_1 (auto_identifier
, true);
25913 /* Return a C++17 deduction placeholder for class template TMPL. */
25916 make_template_placeholder (tree tmpl
)
25918 tree t
= make_auto_1 (DECL_NAME (tmpl
), true);
25919 CLASS_PLACEHOLDER_TEMPLATE (t
) = tmpl
;
25923 /* True iff T is a C++17 class template deduction placeholder. */
25926 template_placeholder_p (tree t
)
25928 return is_auto (t
) && CLASS_PLACEHOLDER_TEMPLATE (t
);
25931 /* Make a "constrained auto" type-specifier. This is an
25932 auto type with constraints that must be associated after
25933 deduction. The constraint is formed from the given
25934 CONC and its optional sequence of arguments, which are
25935 non-null if written as partial-concept-id. */
25938 make_constrained_auto (tree con
, tree args
)
25940 tree type
= make_auto_1 (auto_identifier
, false);
25942 /* Build the constraint. */
25943 tree tmpl
= DECL_TI_TEMPLATE (con
);
25944 tree expr
= VAR_P (con
) ? tmpl
: ovl_make (tmpl
);
25945 expr
= build_concept_check (expr
, type
, args
);
25947 tree constr
= normalize_expression (expr
);
25948 PLACEHOLDER_TYPE_CONSTRAINTS (type
) = constr
;
25950 /* Our canonical type depends on the constraint. */
25951 TYPE_CANONICAL (type
) = canonical_type_parameter (type
);
25953 /* Attach the constraint to the type declaration. */
25954 tree decl
= TYPE_NAME (type
);
25958 /* Given type ARG, return std::initializer_list<ARG>. */
25963 tree std_init_list
= get_namespace_binding (std_node
, init_list_identifier
);
25965 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
25967 gcc_rich_location
richloc (input_location
);
25968 maybe_add_include_fixit (&richloc
, "<initializer_list>");
25969 error_at (&richloc
,
25970 "deducing from brace-enclosed initializer list"
25971 " requires %<#include <initializer_list>%>");
25973 return error_mark_node
;
25975 tree argvec
= make_tree_vec (1);
25976 TREE_VEC_ELT (argvec
, 0) = arg
;
25978 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
25979 NULL_TREE
, 0, tf_warning_or_error
);
25982 /* Replace auto in TYPE with std::initializer_list<auto>. */
25985 listify_autos (tree type
, tree auto_node
)
25987 tree init_auto
= listify (auto_node
);
25988 tree argvec
= make_tree_vec (1);
25989 TREE_VEC_ELT (argvec
, 0) = init_auto
;
25990 if (processing_template_decl
)
25991 argvec
= add_to_template_args (current_template_args (), argvec
);
25992 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
25995 /* Hash traits for hashing possibly constrained 'auto'
25996 TEMPLATE_TYPE_PARMs for use by do_auto_deduction. */
25998 struct auto_hash
: default_hash_traits
<tree
>
26000 static inline hashval_t
hash (tree
);
26001 static inline bool equal (tree
, tree
);
26004 /* Hash the 'auto' T. */
26007 auto_hash::hash (tree t
)
26009 if (tree c
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
26010 /* Matching constrained-type-specifiers denote the same template
26011 parameter, so hash the constraint. */
26012 return hash_placeholder_constraint (c
);
26014 /* But unconstrained autos are all separate, so just hash the pointer. */
26015 return iterative_hash_object (t
, 0);
26018 /* Compare two 'auto's. */
26021 auto_hash::equal (tree t1
, tree t2
)
26026 tree c1
= PLACEHOLDER_TYPE_CONSTRAINTS (t1
);
26027 tree c2
= PLACEHOLDER_TYPE_CONSTRAINTS (t2
);
26029 /* Two unconstrained autos are distinct. */
26033 return equivalent_placeholder_constraints (c1
, c2
);
26036 /* for_each_template_parm callback for extract_autos: if t is a (possibly
26037 constrained) auto, add it to the vector. */
26040 extract_autos_r (tree t
, void *data
)
26042 hash_table
<auto_hash
> &hash
= *(hash_table
<auto_hash
>*)data
;
26045 /* All the autos were built with index 0; fix that up now. */
26046 tree
*p
= hash
.find_slot (t
, INSERT
);
26049 /* If this is a repeated constrained-type-specifier, use the index we
26051 idx
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (*p
));
26054 /* Otherwise this is new, so use the current count. */
26056 idx
= hash
.elements () - 1;
26058 TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (t
)) = idx
;
26061 /* Always keep walking. */
26065 /* Return a TREE_VEC of the 'auto's used in type under the Concepts TS, which
26066 says they can appear anywhere in the type. */
26069 extract_autos (tree type
)
26071 hash_set
<tree
> visited
;
26072 hash_table
<auto_hash
> hash (2);
26074 for_each_template_parm (type
, extract_autos_r
, &hash
, &visited
, true);
26076 tree tree_vec
= make_tree_vec (hash
.elements());
26077 for (hash_table
<auto_hash
>::iterator iter
= hash
.begin();
26078 iter
!= hash
.end(); ++iter
)
26081 unsigned i
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (elt
));
26082 TREE_VEC_ELT (tree_vec
, i
)
26083 = build_tree_list (NULL_TREE
, TYPE_NAME (elt
));
26089 /* The stem for deduction guide names. */
26090 const char *const dguide_base
= "__dguide_";
26092 /* Return the name for a deduction guide for class template TMPL. */
26095 dguide_name (tree tmpl
)
26097 tree type
= (TYPE_P (tmpl
) ? tmpl
: TREE_TYPE (tmpl
));
26098 tree tname
= TYPE_IDENTIFIER (type
);
26099 char *buf
= (char *) alloca (1 + strlen (dguide_base
)
26100 + IDENTIFIER_LENGTH (tname
));
26101 memcpy (buf
, dguide_base
, strlen (dguide_base
));
26102 memcpy (buf
+ strlen (dguide_base
), IDENTIFIER_POINTER (tname
),
26103 IDENTIFIER_LENGTH (tname
) + 1);
26104 tree dname
= get_identifier (buf
);
26105 TREE_TYPE (dname
) = type
;
26109 /* True if NAME is the name of a deduction guide. */
26112 dguide_name_p (tree name
)
26114 return (TREE_CODE (name
) == IDENTIFIER_NODE
26115 && TREE_TYPE (name
)
26116 && !strncmp (IDENTIFIER_POINTER (name
), dguide_base
,
26117 strlen (dguide_base
)));
26120 /* True if FN is a deduction guide. */
26123 deduction_guide_p (const_tree fn
)
26126 if (tree name
= DECL_NAME (fn
))
26127 return dguide_name_p (name
);
26131 /* True if FN is the copy deduction guide, i.e. A(A)->A. */
26134 copy_guide_p (const_tree fn
)
26136 gcc_assert (deduction_guide_p (fn
));
26137 if (!DECL_ARTIFICIAL (fn
))
26139 tree parms
= FUNCTION_FIRST_USER_PARMTYPE (DECL_TI_TEMPLATE (fn
));
26140 return (TREE_CHAIN (parms
) == void_list_node
26141 && same_type_p (TREE_VALUE (parms
), TREE_TYPE (DECL_NAME (fn
))));
26144 /* True if FN is a guide generated from a constructor template. */
26147 template_guide_p (const_tree fn
)
26149 gcc_assert (deduction_guide_p (fn
));
26150 if (!DECL_ARTIFICIAL (fn
))
26152 tree tmpl
= DECL_TI_TEMPLATE (fn
);
26153 if (tree org
= DECL_ABSTRACT_ORIGIN (tmpl
))
26154 return PRIMARY_TEMPLATE_P (org
);
26158 /* OLDDECL is a _DECL for a template parameter. Return a similar parameter at
26159 LEVEL:INDEX, using tsubst_args and complain for substitution into non-type
26160 template parameter types. Note that the handling of template template
26161 parameters relies on current_template_parms being set appropriately for the
26165 rewrite_template_parm (tree olddecl
, unsigned index
, unsigned level
,
26166 tree tsubst_args
, tsubst_flags_t complain
)
26168 if (olddecl
== error_mark_node
)
26169 return error_mark_node
;
26171 tree oldidx
= get_template_parm_index (olddecl
);
26174 if (TREE_CODE (olddecl
) == TYPE_DECL
26175 || TREE_CODE (olddecl
) == TEMPLATE_DECL
)
26177 tree oldtype
= TREE_TYPE (olddecl
);
26178 newtype
= cxx_make_type (TREE_CODE (oldtype
));
26179 TYPE_MAIN_VARIANT (newtype
) = newtype
;
26180 if (TREE_CODE (oldtype
) == TEMPLATE_TYPE_PARM
)
26181 TEMPLATE_TYPE_PARM_FOR_CLASS (newtype
)
26182 = TEMPLATE_TYPE_PARM_FOR_CLASS (oldtype
);
26186 newtype
= TREE_TYPE (olddecl
);
26187 if (type_uses_auto (newtype
))
26189 // Substitute once to fix references to other template parameters.
26190 newtype
= tsubst (newtype
, tsubst_args
,
26191 complain
|tf_partial
, NULL_TREE
);
26192 // Now substitute again to reduce the level of the auto.
26193 newtype
= tsubst (newtype
, current_template_args (),
26194 complain
, NULL_TREE
);
26197 newtype
= tsubst (newtype
, tsubst_args
,
26198 complain
, NULL_TREE
);
26202 = build_decl (DECL_SOURCE_LOCATION (olddecl
), TREE_CODE (olddecl
),
26203 DECL_NAME (olddecl
), newtype
);
26204 SET_DECL_TEMPLATE_PARM_P (newdecl
);
26207 if (TREE_CODE (olddecl
) == TYPE_DECL
26208 || TREE_CODE (olddecl
) == TEMPLATE_DECL
)
26210 newidx
= TEMPLATE_TYPE_PARM_INDEX (newtype
)
26211 = build_template_parm_index (index
, level
, level
,
26213 TEMPLATE_PARM_PARAMETER_PACK (newidx
)
26214 = TEMPLATE_PARM_PARAMETER_PACK (oldidx
);
26215 TYPE_STUB_DECL (newtype
) = TYPE_NAME (newtype
) = newdecl
;
26216 TYPE_CANONICAL (newtype
) = canonical_type_parameter (newtype
);
26218 if (TREE_CODE (olddecl
) == TEMPLATE_DECL
)
26220 DECL_TEMPLATE_RESULT (newdecl
)
26221 = build_decl (DECL_SOURCE_LOCATION (olddecl
), TYPE_DECL
,
26222 DECL_NAME (olddecl
), newtype
);
26223 DECL_ARTIFICIAL (DECL_TEMPLATE_RESULT (newdecl
)) = true;
26224 // First create a copy (ttargs) of tsubst_args with an
26225 // additional level for the template template parameter's own
26226 // template parameters (ttparms).
26227 tree ttparms
= (INNERMOST_TEMPLATE_PARMS
26228 (DECL_TEMPLATE_PARMS (olddecl
)));
26229 const int depth
= TMPL_ARGS_DEPTH (tsubst_args
);
26230 tree ttargs
= make_tree_vec (depth
+ 1);
26231 for (int i
= 0; i
< depth
; ++i
)
26232 TREE_VEC_ELT (ttargs
, i
) = TREE_VEC_ELT (tsubst_args
, i
);
26233 TREE_VEC_ELT (ttargs
, depth
)
26234 = template_parms_level_to_args (ttparms
);
26235 // Substitute ttargs into ttparms to fix references to
26236 // other template parameters.
26237 ttparms
= tsubst_template_parms_level (ttparms
, ttargs
,
26238 complain
|tf_partial
);
26239 // Now substitute again with args based on tparms, to reduce
26240 // the level of the ttparms.
26241 ttargs
= current_template_args ();
26242 ttparms
= tsubst_template_parms_level (ttparms
, ttargs
,
26244 // Finally, tack the adjusted parms onto tparms.
26245 ttparms
= tree_cons (size_int (depth
), ttparms
,
26246 current_template_parms
);
26247 DECL_TEMPLATE_PARMS (newdecl
) = ttparms
;
26252 tree oldconst
= TEMPLATE_PARM_DECL (oldidx
);
26254 = build_decl (DECL_SOURCE_LOCATION (oldconst
),
26255 TREE_CODE (oldconst
),
26256 DECL_NAME (oldconst
), newtype
);
26257 TREE_CONSTANT (newconst
) = TREE_CONSTANT (newdecl
)
26258 = TREE_READONLY (newconst
) = TREE_READONLY (newdecl
) = true;
26259 SET_DECL_TEMPLATE_PARM_P (newconst
);
26260 newidx
= build_template_parm_index (index
, level
, level
,
26261 newconst
, newtype
);
26262 TEMPLATE_PARM_PARAMETER_PACK (newidx
)
26263 = TEMPLATE_PARM_PARAMETER_PACK (oldidx
);
26264 DECL_INITIAL (newdecl
) = DECL_INITIAL (newconst
) = newidx
;
26270 /* Returns a C++17 class deduction guide template based on the constructor
26271 CTOR. As a special case, CTOR can be a RECORD_TYPE for an implicit default
26272 guide, or REFERENCE_TYPE for an implicit copy/move guide. */
26275 build_deduction_guide (tree ctor
, tree outer_args
, tsubst_flags_t complain
)
26277 tree type
, tparms
, targs
, fparms
, fargs
, ci
;
26278 bool memtmpl
= false;
26281 tree fn_tmpl
= NULL_TREE
;
26286 bool copy_p
= TYPE_REF_P (type
);
26289 type
= TREE_TYPE (type
);
26290 fparms
= tree_cons (NULL_TREE
, type
, void_list_node
);
26293 fparms
= void_list_node
;
26295 tree ctmpl
= CLASSTYPE_TI_TEMPLATE (type
);
26296 tparms
= DECL_TEMPLATE_PARMS (ctmpl
);
26297 targs
= CLASSTYPE_TI_ARGS (type
);
26300 loc
= DECL_SOURCE_LOCATION (ctmpl
);
26301 explicit_p
= false;
26305 ++processing_template_decl
;
26309 = (TREE_CODE (ctor
) == TEMPLATE_DECL
? ctor
26310 : DECL_TI_TEMPLATE (ctor
));
26312 fn_tmpl
= tsubst (fn_tmpl
, outer_args
, complain
, ctor
);
26313 ctor
= DECL_TEMPLATE_RESULT (fn_tmpl
);
26315 type
= DECL_CONTEXT (ctor
);
26317 tparms
= DECL_TEMPLATE_PARMS (fn_tmpl
);
26318 /* If type is a member class template, DECL_TI_ARGS (ctor) will have
26319 fully specialized args for the enclosing class. Strip those off, as
26320 the deduction guide won't have those template parameters. */
26321 targs
= get_innermost_template_args (DECL_TI_ARGS (ctor
),
26322 TMPL_PARMS_DEPTH (tparms
));
26323 /* Discard the 'this' parameter. */
26324 fparms
= FUNCTION_ARG_CHAIN (ctor
);
26325 fargs
= TREE_CHAIN (DECL_ARGUMENTS (ctor
));
26326 ci
= get_constraints (ctor
);
26327 loc
= DECL_SOURCE_LOCATION (ctor
);
26328 explicit_p
= DECL_NONCONVERTING_P (ctor
);
26330 if (PRIMARY_TEMPLATE_P (fn_tmpl
))
26334 /* For a member template constructor, we need to flatten the two
26335 template parameter lists into one, and then adjust the function
26336 signature accordingly. This gets...complicated. */
26337 tree save_parms
= current_template_parms
;
26339 /* For a member template we should have two levels of parms/args, one
26340 for the class and one for the constructor. We stripped
26341 specialized args for further enclosing classes above. */
26342 const int depth
= 2;
26343 gcc_assert (TMPL_ARGS_DEPTH (targs
) == depth
);
26345 /* Template args for translating references to the two-level template
26346 parameters into references to the one-level template parameters we
26348 tree tsubst_args
= copy_node (targs
);
26349 TMPL_ARGS_LEVEL (tsubst_args
, depth
)
26350 = copy_node (TMPL_ARGS_LEVEL (tsubst_args
, depth
));
26352 /* Template parms for the constructor template. */
26353 tree ftparms
= TREE_VALUE (tparms
);
26354 unsigned flen
= TREE_VEC_LENGTH (ftparms
);
26355 /* Template parms for the class template. */
26356 tparms
= TREE_CHAIN (tparms
);
26357 tree ctparms
= TREE_VALUE (tparms
);
26358 unsigned clen
= TREE_VEC_LENGTH (ctparms
);
26359 /* Template parms for the deduction guide start as a copy of the
26360 template parms for the class. We set current_template_parms for
26361 lookup_template_class_1. */
26362 current_template_parms
= tparms
= copy_node (tparms
);
26363 tree new_vec
= TREE_VALUE (tparms
) = make_tree_vec (flen
+ clen
);
26364 for (unsigned i
= 0; i
< clen
; ++i
)
26365 TREE_VEC_ELT (new_vec
, i
) = TREE_VEC_ELT (ctparms
, i
);
26367 /* Now we need to rewrite the constructor parms to append them to the
26369 for (unsigned i
= 0; i
< flen
; ++i
)
26371 unsigned index
= i
+ clen
;
26372 unsigned level
= 1;
26373 tree oldelt
= TREE_VEC_ELT (ftparms
, i
);
26374 tree olddecl
= TREE_VALUE (oldelt
);
26375 tree newdecl
= rewrite_template_parm (olddecl
, index
, level
,
26376 tsubst_args
, complain
);
26377 if (newdecl
== error_mark_node
)
26379 tree newdef
= tsubst_template_arg (TREE_PURPOSE (oldelt
),
26380 tsubst_args
, complain
, ctor
);
26381 tree list
= build_tree_list (newdef
, newdecl
);
26382 TEMPLATE_PARM_CONSTRAINTS (list
)
26383 = tsubst_constraint_info (TEMPLATE_PARM_CONSTRAINTS (oldelt
),
26384 tsubst_args
, complain
, ctor
);
26385 TREE_VEC_ELT (new_vec
, index
) = list
;
26386 TMPL_ARG (tsubst_args
, depth
, i
) = template_parm_to_arg (list
);
26389 /* Now we have a final set of template parms to substitute into the
26390 function signature. */
26391 targs
= template_parms_to_args (tparms
);
26392 fparms
= tsubst_arg_types (fparms
, tsubst_args
, NULL_TREE
,
26394 fargs
= tsubst (fargs
, tsubst_args
, complain
, ctor
);
26396 ci
= tsubst_constraint_info (ci
, tsubst_args
, complain
, ctor
);
26398 current_template_parms
= save_parms
;
26401 --processing_template_decl
;
26403 return error_mark_node
;
26408 /* Copy the parms so we can set DECL_PRIMARY_TEMPLATE. */
26409 tparms
= copy_node (tparms
);
26410 INNERMOST_TEMPLATE_PARMS (tparms
)
26411 = copy_node (INNERMOST_TEMPLATE_PARMS (tparms
));
26414 tree fntype
= build_function_type (type
, fparms
);
26415 tree ded_fn
= build_lang_decl_loc (loc
,
26417 dguide_name (type
), fntype
);
26418 DECL_ARGUMENTS (ded_fn
) = fargs
;
26419 DECL_ARTIFICIAL (ded_fn
) = true;
26420 DECL_NONCONVERTING_P (ded_fn
) = explicit_p
;
26421 tree ded_tmpl
= build_template_decl (ded_fn
, tparms
, /*member*/false);
26422 DECL_ARTIFICIAL (ded_tmpl
) = true;
26423 DECL_TEMPLATE_RESULT (ded_tmpl
) = ded_fn
;
26424 TREE_TYPE (ded_tmpl
) = TREE_TYPE (ded_fn
);
26425 DECL_TEMPLATE_INFO (ded_fn
) = build_template_info (ded_tmpl
, targs
);
26426 DECL_PRIMARY_TEMPLATE (ded_tmpl
) = ded_tmpl
;
26428 DECL_ABSTRACT_ORIGIN (ded_tmpl
) = fn_tmpl
;
26430 set_constraints (ded_tmpl
, ci
);
26435 /* Deduce template arguments for the class template placeholder PTYPE for
26436 template TMPL based on the initializer INIT, and return the resulting
26440 do_class_deduction (tree ptype
, tree tmpl
, tree init
, int flags
,
26441 tsubst_flags_t complain
)
26443 if (!DECL_CLASS_TEMPLATE_P (tmpl
))
26445 /* We should have handled this in the caller. */
26446 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
))
26448 if (complain
& tf_error
)
26449 error ("non-class template %qT used without template arguments", tmpl
);
26450 return error_mark_node
;
26453 tree type
= TREE_TYPE (tmpl
);
26455 bool try_list_ctor
= false;
26457 vec
<tree
,va_gc
> *args
;
26458 if (init
== NULL_TREE
26459 || TREE_CODE (init
) == TREE_LIST
)
26460 args
= make_tree_vector_from_list (init
);
26461 else if (BRACE_ENCLOSED_INITIALIZER_P (init
))
26463 try_list_ctor
= TYPE_HAS_LIST_CTOR (type
);
26464 if (try_list_ctor
&& CONSTRUCTOR_NELTS (init
) == 1)
26466 /* As an exception, the first phase in 16.3.1.7 (considering the
26467 initializer list as a single argument) is omitted if the
26468 initializer list consists of a single expression of type cv U,
26469 where U is a specialization of C or a class derived from a
26470 specialization of C. */
26471 tree elt
= CONSTRUCTOR_ELT (init
, 0)->value
;
26472 tree etype
= TREE_TYPE (elt
);
26474 tree tparms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
26475 tree targs
= make_tree_vec (TREE_VEC_LENGTH (tparms
));
26476 int err
= unify (tparms
, targs
, type
, etype
,
26477 UNIFY_ALLOW_DERIVED
, /*explain*/false);
26479 try_list_ctor
= false;
26482 if (try_list_ctor
|| is_std_init_list (type
))
26483 args
= make_tree_vector_single (init
);
26485 args
= make_tree_vector_from_ctor (init
);
26488 args
= make_tree_vector_single (init
);
26490 tree dname
= dguide_name (tmpl
);
26491 tree cands
= lookup_qualified_name (CP_DECL_CONTEXT (tmpl
), dname
,
26492 /*type*/false, /*complain*/false,
26494 bool elided
= false;
26495 if (cands
== error_mark_node
)
26498 /* Prune explicit deduction guides in copy-initialization context. */
26499 if (flags
& LOOKUP_ONLYCONVERTING
)
26501 for (lkp_iterator
iter (cands
); !elided
&& iter
; ++iter
)
26502 if (DECL_NONCONVERTING_P (STRIP_TEMPLATE (*iter
)))
26507 /* Found a nonconverting guide, prune the candidates. */
26508 tree pruned
= NULL_TREE
;
26509 for (lkp_iterator
iter (cands
); iter
; ++iter
)
26510 if (!DECL_NONCONVERTING_P (STRIP_TEMPLATE (*iter
)))
26511 pruned
= lookup_add (*iter
, pruned
);
26517 tree outer_args
= NULL_TREE
;
26518 if (DECL_CLASS_SCOPE_P (tmpl
)
26519 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (tmpl
)))
26521 outer_args
= CLASSTYPE_TI_ARGS (DECL_CONTEXT (tmpl
));
26522 type
= TREE_TYPE (most_general_template (tmpl
));
26525 bool saw_ctor
= false;
26526 // FIXME cache artificial deduction guides
26527 for (ovl_iterator
iter (CLASSTYPE_CONSTRUCTORS (type
)); iter
; ++iter
)
26529 /* Skip inherited constructors. */
26530 if (iter
.using_p ())
26533 tree guide
= build_deduction_guide (*iter
, outer_args
, complain
);
26534 if (guide
== error_mark_node
)
26535 return error_mark_node
;
26536 if ((flags
& LOOKUP_ONLYCONVERTING
)
26537 && DECL_NONCONVERTING_P (STRIP_TEMPLATE (guide
)))
26540 cands
= lookup_add (guide
, cands
);
26545 tree call
= error_mark_node
;
26547 /* If this is list-initialization and the class has a list constructor, first
26548 try deducing from the list as a single argument, as [over.match.list]. */
26549 tree list_cands
= NULL_TREE
;
26550 if (try_list_ctor
&& cands
)
26551 for (lkp_iterator
iter (cands
); iter
; ++iter
)
26554 if (is_list_ctor (dg
))
26555 list_cands
= lookup_add (dg
, list_cands
);
26559 ++cp_unevaluated_operand
;
26560 call
= build_new_function_call (list_cands
, &args
, tf_decltype
);
26561 --cp_unevaluated_operand
;
26563 if (call
== error_mark_node
)
26565 /* That didn't work, now try treating the list as a sequence of
26567 release_tree_vector (args
);
26568 args
= make_tree_vector_from_ctor (init
);
26572 /* Maybe generate an implicit deduction guide. */
26573 if (call
== error_mark_node
&& args
->length () < 2)
26575 tree gtype
= NULL_TREE
;
26577 if (args
->length () == 1)
26578 /* Generate a copy guide. */
26579 gtype
= build_reference_type (type
);
26580 else if (!saw_ctor
)
26581 /* Generate a default guide. */
26586 tree guide
= build_deduction_guide (gtype
, outer_args
, complain
);
26587 if (guide
== error_mark_node
)
26588 return error_mark_node
;
26589 cands
= lookup_add (guide
, cands
);
26593 if (elided
&& !cands
)
26595 error ("cannot deduce template arguments for copy-initialization"
26596 " of %qT, as it has no non-explicit deduction guides or "
26597 "user-declared constructors", type
);
26598 return error_mark_node
;
26600 else if (!cands
&& call
== error_mark_node
)
26602 error ("cannot deduce template arguments of %qT, as it has no viable "
26603 "deduction guides", type
);
26604 return error_mark_node
;
26607 if (call
== error_mark_node
)
26609 ++cp_unevaluated_operand
;
26610 call
= build_new_function_call (cands
, &args
, tf_decltype
);
26611 --cp_unevaluated_operand
;
26614 if (call
== error_mark_node
&& (complain
& tf_warning_or_error
))
26616 error ("class template argument deduction failed:");
26618 ++cp_unevaluated_operand
;
26619 call
= build_new_function_call (cands
, &args
, complain
| tf_decltype
);
26620 --cp_unevaluated_operand
;
26623 inform (input_location
, "explicit deduction guides not considered "
26624 "for copy-initialization");
26627 release_tree_vector (args
);
26629 return cp_build_qualified_type (TREE_TYPE (call
), cp_type_quals (ptype
));
26632 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
26633 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE.
26634 The CONTEXT determines the context in which auto deduction is performed
26635 and is used to control error diagnostics. FLAGS are the LOOKUP_* flags.
26636 OUTER_TARGS are used during template argument deduction
26637 (context == adc_unify) to properly substitute the result, and is ignored
26640 For partial-concept-ids, extra args may be appended to the list of deduced
26641 template arguments prior to determining constraint satisfaction. */
26644 do_auto_deduction (tree type
, tree init
, tree auto_node
,
26645 tsubst_flags_t complain
, auto_deduction_context context
,
26646 tree outer_targs
, int flags
)
26650 if (init
== error_mark_node
)
26651 return error_mark_node
;
26653 if (init
&& type_dependent_expression_p (init
)
26654 && context
!= adc_unify
)
26655 /* Defining a subset of type-dependent expressions that we can deduce
26656 from ahead of time isn't worth the trouble. */
26659 /* Similarly, we can't deduce from another undeduced decl. */
26660 if (init
&& undeduced_auto_decl (init
))
26663 if (tree tmpl
= CLASS_PLACEHOLDER_TEMPLATE (auto_node
))
26664 /* C++17 class template argument deduction. */
26665 return do_class_deduction (type
, tmpl
, init
, flags
, complain
);
26667 if (init
== NULL_TREE
|| TREE_TYPE (init
) == NULL_TREE
)
26668 /* Nothing we can do with this, even in deduction context. */
26671 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
26672 with either a new invented type template parameter U or, if the
26673 initializer is a braced-init-list (8.5.4), with
26674 std::initializer_list<U>. */
26675 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
26677 if (!DIRECT_LIST_INIT_P (init
))
26678 type
= listify_autos (type
, auto_node
);
26679 else if (CONSTRUCTOR_NELTS (init
) == 1)
26680 init
= CONSTRUCTOR_ELT (init
, 0)->value
;
26683 if (complain
& tf_warning_or_error
)
26685 if (permerror (input_location
, "direct-list-initialization of "
26686 "%<auto%> requires exactly one element"))
26687 inform (input_location
,
26688 "for deduction to %<std::initializer_list%>, use copy-"
26689 "list-initialization (i.e. add %<=%> before the %<{%>)");
26691 type
= listify_autos (type
, auto_node
);
26695 if (type
== error_mark_node
)
26696 return error_mark_node
;
26698 init
= resolve_nondeduced_context (init
, complain
);
26700 if (context
== adc_decomp_type
26701 && auto_node
== type
26702 && init
!= error_mark_node
26703 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
26704 /* [dcl.decomp]/1 - if decomposition declaration has no ref-qualifiers
26705 and initializer has array type, deduce cv-qualified array type. */
26706 return cp_build_qualified_type_real (TREE_TYPE (init
), TYPE_QUALS (type
),
26708 else if (AUTO_IS_DECLTYPE (auto_node
))
26710 bool id
= (DECL_P (init
)
26711 || ((TREE_CODE (init
) == COMPONENT_REF
26712 || TREE_CODE (init
) == SCOPE_REF
)
26713 && !REF_PARENTHESIZED_P (init
)));
26714 targs
= make_tree_vec (1);
26715 TREE_VEC_ELT (targs
, 0)
26716 = finish_decltype_type (init
, id
, tf_warning_or_error
);
26717 if (type
!= auto_node
)
26719 if (complain
& tf_error
)
26720 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
26721 return error_mark_node
;
26726 tree parms
= build_tree_list (NULL_TREE
, type
);
26730 tparms
= extract_autos (type
);
26733 tparms
= make_tree_vec (1);
26734 TREE_VEC_ELT (tparms
, 0)
26735 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
26738 targs
= make_tree_vec (TREE_VEC_LENGTH (tparms
));
26739 int val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
26740 DEDUCE_CALL
, LOOKUP_NORMAL
,
26741 NULL
, /*explain_p=*/false);
26744 if (processing_template_decl
)
26745 /* Try again at instantiation time. */
26747 if (type
&& type
!= error_mark_node
26748 && (complain
& tf_error
))
26749 /* If type is error_mark_node a diagnostic must have been
26750 emitted by now. Also, having a mention to '<type error>'
26751 in the diagnostic is not really useful to the user. */
26753 if (cfun
&& auto_node
== current_function_auto_return_pattern
26754 && LAMBDA_FUNCTION_P (current_function_decl
))
26755 error ("unable to deduce lambda return type from %qE", init
);
26757 error ("unable to deduce %qT from %qE", type
, init
);
26758 type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
26759 DEDUCE_CALL
, LOOKUP_NORMAL
,
26760 NULL
, /*explain_p=*/true);
26762 return error_mark_node
;
26766 /* Check any placeholder constraints against the deduced type. */
26767 if (flag_concepts
&& !processing_template_decl
)
26768 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (auto_node
))
26770 /* Use the deduced type to check the associated constraints. If we
26771 have a partial-concept-id, rebuild the argument list so that
26772 we check using the extra arguments. */
26773 gcc_assert (TREE_CODE (constr
) == CHECK_CONSTR
);
26774 tree cargs
= CHECK_CONSTR_ARGS (constr
);
26775 if (TREE_VEC_LENGTH (cargs
) > 1)
26777 cargs
= copy_node (cargs
);
26778 TREE_VEC_ELT (cargs
, 0) = TREE_VEC_ELT (targs
, 0);
26782 if (!constraints_satisfied_p (constr
, cargs
))
26784 if (complain
& tf_warning_or_error
)
26788 case adc_unspecified
:
26790 error("placeholder constraints not satisfied");
26792 case adc_variable_type
:
26793 case adc_decomp_type
:
26794 error ("deduced initializer does not satisfy "
26795 "placeholder constraints");
26797 case adc_return_type
:
26798 error ("deduced return type does not satisfy "
26799 "placeholder constraints");
26801 case adc_requirement
:
26802 error ("deduced expression type does not satisfy "
26803 "placeholder constraints");
26806 diagnose_constraints (input_location
, constr
, targs
);
26808 return error_mark_node
;
26812 if (processing_template_decl
&& context
!= adc_unify
)
26813 outer_targs
= current_template_args ();
26814 targs
= add_to_template_args (outer_targs
, targs
);
26815 return tsubst (type
, targs
, complain
, NULL_TREE
);
26818 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
26822 splice_late_return_type (tree type
, tree late_return_type
)
26824 if (is_auto (type
))
26826 if (late_return_type
)
26827 return late_return_type
;
26829 tree idx
= get_template_parm_index (type
);
26830 if (TEMPLATE_PARM_LEVEL (idx
) <= processing_template_decl
)
26831 /* In an abbreviated function template we didn't know we were dealing
26832 with a function template when we saw the auto return type, so update
26833 it to have the correct level. */
26834 return make_auto_1 (TYPE_IDENTIFIER (type
), true);
26839 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
26840 'decltype(auto)' or a deduced class template. */
26843 is_auto (const_tree type
)
26845 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
26846 && (TYPE_IDENTIFIER (type
) == auto_identifier
26847 || TYPE_IDENTIFIER (type
) == decltype_auto_identifier
26848 || CLASS_PLACEHOLDER_TEMPLATE (type
)))
26854 /* for_each_template_parm callback for type_uses_auto. */
26857 is_auto_r (tree tp
, void */
*data*/
)
26859 return is_auto (tp
);
26862 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
26863 a use of `auto'. Returns NULL_TREE otherwise. */
26866 type_uses_auto (tree type
)
26868 if (type
== NULL_TREE
)
26870 else if (flag_concepts
)
26872 /* The Concepts TS allows multiple autos in one type-specifier; just
26873 return the first one we find, do_auto_deduction will collect all of
26875 if (uses_template_parms (type
))
26876 return for_each_template_parm (type
, is_auto_r
, /*data*/NULL
,
26877 /*visited*/NULL
, /*nondeduced*/false);
26882 return find_type_usage (type
, is_auto
);
26885 /* Report ill-formed occurrences of auto types in ARGUMENTS. If
26886 concepts are enabled, auto is acceptable in template arguments, but
26887 only when TEMPL identifies a template class. Return TRUE if any
26888 such errors were reported. */
26891 check_auto_in_tmpl_args (tree tmpl
, tree args
)
26893 /* If there were previous errors, nevermind. */
26894 if (!args
|| TREE_CODE (args
) != TREE_VEC
)
26897 /* If TMPL is an identifier, we're parsing and we can't tell yet
26898 whether TMPL is supposed to be a type, a function or a variable.
26899 We'll only be able to tell during template substitution, so we
26900 expect to be called again then. If concepts are enabled and we
26901 know we have a type, we're ok. */
26903 && (identifier_p (tmpl
)
26905 && (DECL_TYPE_TEMPLATE_P (tmpl
)
26906 || DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)))))
26909 /* Quickly search for any occurrences of auto; usually there won't
26910 be any, and then we'll avoid allocating the vector. */
26911 if (!type_uses_auto (args
))
26914 bool errors
= false;
26916 tree vec
= extract_autos (args
);
26917 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); i
++)
26919 tree xauto
= TREE_VALUE (TREE_VEC_ELT (vec
, i
));
26920 error_at (DECL_SOURCE_LOCATION (xauto
),
26921 "invalid use of %qT in template argument", xauto
);
26928 /* For a given template T, return the vector of typedefs referenced
26929 in T for which access check is needed at T instantiation time.
26930 T is either a FUNCTION_DECL or a RECORD_TYPE.
26931 Those typedefs were added to T by the function
26932 append_type_to_template_for_access_check. */
26934 vec
<qualified_typedef_usage_t
, va_gc
> *
26935 get_types_needing_access_check (tree t
)
26938 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
26940 if (!t
|| t
== error_mark_node
)
26943 if (!(ti
= get_template_info (t
)))
26946 if (CLASS_TYPE_P (t
)
26947 || TREE_CODE (t
) == FUNCTION_DECL
)
26949 if (!TI_TEMPLATE (ti
))
26952 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
26958 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
26959 tied to T. That list of typedefs will be access checked at
26960 T instantiation time.
26961 T is either a FUNCTION_DECL or a RECORD_TYPE.
26962 TYPE_DECL is a TYPE_DECL node representing a typedef.
26963 SCOPE is the scope through which TYPE_DECL is accessed.
26964 LOCATION is the location of the usage point of TYPE_DECL.
26966 This function is a subroutine of
26967 append_type_to_template_for_access_check. */
26970 append_type_to_template_for_access_check_1 (tree t
,
26973 location_t location
)
26975 qualified_typedef_usage_t typedef_usage
;
26978 if (!t
|| t
== error_mark_node
)
26981 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
26982 || CLASS_TYPE_P (t
))
26984 && TREE_CODE (type_decl
) == TYPE_DECL
26987 if (!(ti
= get_template_info (t
)))
26990 gcc_assert (TI_TEMPLATE (ti
));
26992 typedef_usage
.typedef_decl
= type_decl
;
26993 typedef_usage
.context
= scope
;
26994 typedef_usage
.locus
= location
;
26996 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
26999 /* Append TYPE_DECL to the template TEMPL.
27000 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
27001 At TEMPL instanciation time, TYPE_DECL will be checked to see
27002 if it can be accessed through SCOPE.
27003 LOCATION is the location of the usage point of TYPE_DECL.
27005 e.g. consider the following code snippet:
27012 template<class U> struct S
27014 C::myint mi; // <-- usage point of the typedef C::myint
27019 At S<char> instantiation time, we need to check the access of C::myint
27020 In other words, we need to check the access of the myint typedef through
27021 the C scope. For that purpose, this function will add the myint typedef
27022 and the scope C through which its being accessed to a list of typedefs
27023 tied to the template S. That list will be walked at template instantiation
27024 time and access check performed on each typedefs it contains.
27025 Note that this particular code snippet should yield an error because
27026 myint is private to C. */
27029 append_type_to_template_for_access_check (tree templ
,
27032 location_t location
)
27034 qualified_typedef_usage_t
*iter
;
27037 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
27039 /* Make sure we don't append the type to the template twice. */
27040 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
27041 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
27044 append_type_to_template_for_access_check_1 (templ
, type_decl
,
27048 /* Convert the generic type parameters in PARM that match the types given in the
27049 range [START_IDX, END_IDX) from the current_template_parms into generic type
27053 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
27055 tree current
= current_template_parms
;
27056 int depth
= TMPL_PARMS_DEPTH (current
);
27057 current
= INNERMOST_TEMPLATE_PARMS (current
);
27058 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
27060 for (int i
= 0; i
< start_idx
; ++i
)
27061 TREE_VEC_ELT (replacement
, i
)
27062 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
27064 for (int i
= start_idx
; i
< end_idx
; ++i
)
27066 /* Create a distinct parameter pack type from the current parm and add it
27067 to the replacement args to tsubst below into the generic function
27070 tree o
= TREE_TYPE (TREE_VALUE
27071 (TREE_VEC_ELT (current
, i
)));
27072 tree t
= copy_type (o
);
27073 TEMPLATE_TYPE_PARM_INDEX (t
)
27074 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
27076 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
27077 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
27078 TYPE_MAIN_VARIANT (t
) = t
;
27079 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
27080 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
27081 TREE_VEC_ELT (replacement
, i
) = t
;
27082 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
27085 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
27086 TREE_VEC_ELT (replacement
, i
)
27087 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
27089 /* If there are more levels then build up the replacement with the outer
27092 replacement
= add_to_template_args (template_parms_to_args
27093 (TREE_CHAIN (current_template_parms
)),
27096 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
27099 /* Entries in the decl_constraint hash table. */
27100 struct GTY((for_user
)) constr_entry
27106 /* Hashing function and equality for constraint entries. */
27107 struct constr_hasher
: ggc_ptr_hash
<constr_entry
>
27109 static hashval_t
hash (constr_entry
*e
)
27111 return (hashval_t
)DECL_UID (e
->decl
);
27114 static bool equal (constr_entry
*e1
, constr_entry
*e2
)
27116 return e1
->decl
== e2
->decl
;
27120 /* A mapping from declarations to constraint information. Note that
27121 both templates and their underlying declarations are mapped to the
27122 same constraint information.
27124 FIXME: This is defined in pt.c because garbage collection
27125 code is not being generated for constraint.cc. */
27127 static GTY (()) hash_table
<constr_hasher
> *decl_constraints
;
27129 /* Returns the template constraints of declaration T. If T is not
27130 constrained, return NULL_TREE. Note that T must be non-null. */
27133 get_constraints (tree t
)
27135 if (!flag_concepts
)
27138 gcc_assert (DECL_P (t
));
27139 if (TREE_CODE (t
) == TEMPLATE_DECL
)
27140 t
= DECL_TEMPLATE_RESULT (t
);
27141 constr_entry elt
= { t
, NULL_TREE
};
27142 constr_entry
* found
= decl_constraints
->find (&elt
);
27149 /* Associate the given constraint information CI with the declaration
27150 T. If T is a template, then the constraints are associated with
27151 its underlying declaration. Don't build associations if CI is
27155 set_constraints (tree t
, tree ci
)
27159 gcc_assert (t
&& flag_concepts
);
27160 if (TREE_CODE (t
) == TEMPLATE_DECL
)
27161 t
= DECL_TEMPLATE_RESULT (t
);
27162 gcc_assert (!get_constraints (t
));
27163 constr_entry elt
= {t
, ci
};
27164 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, INSERT
);
27165 constr_entry
* entry
= ggc_alloc
<constr_entry
> ();
27170 /* Remove the associated constraints of the declaration T. */
27173 remove_constraints (tree t
)
27175 gcc_assert (DECL_P (t
));
27176 if (TREE_CODE (t
) == TEMPLATE_DECL
)
27177 t
= DECL_TEMPLATE_RESULT (t
);
27179 constr_entry elt
= {t
, NULL_TREE
};
27180 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, NO_INSERT
);
27182 decl_constraints
->clear_slot (slot
);
27185 /* Memoized satisfaction results for declarations. This
27186 maps the pair (constraint_info, arguments) to the result computed
27187 by constraints_satisfied_p. */
27189 struct GTY((for_user
)) constraint_sat_entry
27196 /* Hashing function and equality for constraint entries. */
27198 struct constraint_sat_hasher
: ggc_ptr_hash
<constraint_sat_entry
>
27200 static hashval_t
hash (constraint_sat_entry
*e
)
27202 hashval_t val
= iterative_hash_object(e
->ci
, 0);
27203 return iterative_hash_template_arg (e
->args
, val
);
27206 static bool equal (constraint_sat_entry
*e1
, constraint_sat_entry
*e2
)
27208 return e1
->ci
== e2
->ci
&& comp_template_args (e1
->args
, e2
->args
);
27212 /* Memoized satisfaction results for concept checks. */
27214 struct GTY((for_user
)) concept_spec_entry
27221 /* Hashing function and equality for constraint entries. */
27223 struct concept_spec_hasher
: ggc_ptr_hash
<concept_spec_entry
>
27225 static hashval_t
hash (concept_spec_entry
*e
)
27227 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
27230 static bool equal (concept_spec_entry
*e1
, concept_spec_entry
*e2
)
27232 ++comparing_specializations
;
27233 bool eq
= e1
->tmpl
== e2
->tmpl
&& comp_template_args (e1
->args
, e2
->args
);
27234 --comparing_specializations
;
27239 static GTY (()) hash_table
<constraint_sat_hasher
> *constraint_memos
;
27240 static GTY (()) hash_table
<concept_spec_hasher
> *concept_memos
;
27242 /* Search for a memoized satisfaction result. Returns one of the
27243 truth value nodes if previously memoized, or NULL_TREE otherwise. */
27246 lookup_constraint_satisfaction (tree ci
, tree args
)
27248 constraint_sat_entry elt
= { ci
, args
, NULL_TREE
};
27249 constraint_sat_entry
* found
= constraint_memos
->find (&elt
);
27251 return found
->result
;
27256 /* Memoize the result of a satisfication test. Returns the saved result. */
27259 memoize_constraint_satisfaction (tree ci
, tree args
, tree result
)
27261 constraint_sat_entry elt
= {ci
, args
, result
};
27262 constraint_sat_entry
** slot
= constraint_memos
->find_slot (&elt
, INSERT
);
27263 constraint_sat_entry
* entry
= ggc_alloc
<constraint_sat_entry
> ();
27269 /* Search for a memoized satisfaction result for a concept. */
27272 lookup_concept_satisfaction (tree tmpl
, tree args
)
27274 concept_spec_entry elt
= { tmpl
, args
, NULL_TREE
};
27275 concept_spec_entry
* found
= concept_memos
->find (&elt
);
27277 return found
->result
;
27282 /* Memoize the result of a concept check. Returns the saved result. */
27285 memoize_concept_satisfaction (tree tmpl
, tree args
, tree result
)
27287 concept_spec_entry elt
= {tmpl
, args
, result
};
27288 concept_spec_entry
** slot
= concept_memos
->find_slot (&elt
, INSERT
);
27289 concept_spec_entry
* entry
= ggc_alloc
<concept_spec_entry
> ();
27295 static GTY (()) hash_table
<concept_spec_hasher
> *concept_expansions
;
27297 /* Returns a prior concept specialization. This returns the substituted
27298 and normalized constraints defined by the concept. */
27301 get_concept_expansion (tree tmpl
, tree args
)
27303 concept_spec_entry elt
= { tmpl
, args
, NULL_TREE
};
27304 concept_spec_entry
* found
= concept_expansions
->find (&elt
);
27306 return found
->result
;
27311 /* Save a concept expansion for later. */
27314 save_concept_expansion (tree tmpl
, tree args
, tree def
)
27316 concept_spec_entry elt
= {tmpl
, args
, def
};
27317 concept_spec_entry
** slot
= concept_expansions
->find_slot (&elt
, INSERT
);
27318 concept_spec_entry
* entry
= ggc_alloc
<concept_spec_entry
> ();
27325 hash_subsumption_args (tree t1
, tree t2
)
27327 gcc_assert (TREE_CODE (t1
) == CHECK_CONSTR
);
27328 gcc_assert (TREE_CODE (t2
) == CHECK_CONSTR
);
27330 val
= iterative_hash_object (CHECK_CONSTR_CONCEPT (t1
), val
);
27331 val
= iterative_hash_template_arg (CHECK_CONSTR_ARGS (t1
), val
);
27332 val
= iterative_hash_object (CHECK_CONSTR_CONCEPT (t2
), val
);
27333 val
= iterative_hash_template_arg (CHECK_CONSTR_ARGS (t2
), val
);
27337 /* Compare the constraints of two subsumption entries. The LEFT1 and
27338 LEFT2 arguments comprise the first subsumption pair and the RIGHT1
27339 and RIGHT2 arguments comprise the second. These are all CHECK_CONSTRs. */
27342 comp_subsumption_args (tree left1
, tree left2
, tree right1
, tree right2
)
27344 if (CHECK_CONSTR_CONCEPT (left1
) == CHECK_CONSTR_CONCEPT (right1
))
27345 if (CHECK_CONSTR_CONCEPT (left2
) == CHECK_CONSTR_CONCEPT (right2
))
27346 if (comp_template_args (CHECK_CONSTR_ARGS (left1
),
27347 CHECK_CONSTR_ARGS (right1
)))
27348 return comp_template_args (CHECK_CONSTR_ARGS (left2
),
27349 CHECK_CONSTR_ARGS (right2
));
27353 /* Key/value pair for learning and memoizing subsumption results. This
27354 associates a pair of check constraints (including arguments) with
27355 a boolean value indicating the result. */
27357 struct GTY((for_user
)) subsumption_entry
27364 /* Hashing function and equality for constraint entries. */
27366 struct subsumption_hasher
: ggc_ptr_hash
<subsumption_entry
>
27368 static hashval_t
hash (subsumption_entry
*e
)
27370 return hash_subsumption_args (e
->t1
, e
->t2
);
27373 static bool equal (subsumption_entry
*e1
, subsumption_entry
*e2
)
27375 ++comparing_specializations
;
27376 bool eq
= comp_subsumption_args(e1
->t1
, e1
->t2
, e2
->t1
, e2
->t2
);
27377 --comparing_specializations
;
27382 static GTY (()) hash_table
<subsumption_hasher
> *subsumption_table
;
27384 /* Search for a previously cached subsumption result. */
27387 lookup_subsumption_result (tree t1
, tree t2
)
27389 subsumption_entry elt
= { t1
, t2
, false };
27390 subsumption_entry
* found
= subsumption_table
->find (&elt
);
27392 return &found
->result
;
27397 /* Save a subsumption result. */
27400 save_subsumption_result (tree t1
, tree t2
, bool result
)
27402 subsumption_entry elt
= {t1
, t2
, result
};
27403 subsumption_entry
** slot
= subsumption_table
->find_slot (&elt
, INSERT
);
27404 subsumption_entry
* entry
= ggc_alloc
<subsumption_entry
> ();
27410 /* Set up the hash table for constraint association. */
27413 init_constraint_processing (void)
27415 if (!flag_concepts
)
27418 decl_constraints
= hash_table
<constr_hasher
>::create_ggc(37);
27419 constraint_memos
= hash_table
<constraint_sat_hasher
>::create_ggc(37);
27420 concept_memos
= hash_table
<concept_spec_hasher
>::create_ggc(37);
27421 concept_expansions
= hash_table
<concept_spec_hasher
>::create_ggc(37);
27422 subsumption_table
= hash_table
<subsumption_hasher
>::create_ggc(37);
27425 /* __integer_pack(N) in a pack expansion expands to a sequence of numbers from
27429 declare_integer_pack (void)
27431 tree ipfn
= push_library_fn (get_identifier ("__integer_pack"),
27432 build_function_type_list (integer_type_node
,
27435 NULL_TREE
, ECF_CONST
);
27436 DECL_DECLARED_CONSTEXPR_P (ipfn
) = true;
27437 DECL_BUILT_IN_CLASS (ipfn
) = BUILT_IN_FRONTEND
;
27440 /* Set up the hash tables for template instantiations. */
27443 init_template_processing (void)
27445 decl_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
27446 type_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
27448 if (cxx_dialect
>= cxx11
)
27449 declare_integer_pack ();
27452 /* Print stats about the template hash tables for -fstats. */
27455 print_template_statistics (void)
27457 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
27458 "%f collisions\n", (long) decl_specializations
->size (),
27459 (long) decl_specializations
->elements (),
27460 decl_specializations
->collisions ());
27461 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
27462 "%f collisions\n", (long) type_specializations
->size (),
27463 (long) type_specializations
->elements (),
27464 type_specializations
->collisions ());
27469 namespace selftest
{
27471 /* Verify that build_non_dependent_expr () works, for various expressions,
27472 and that location wrappers don't affect the results. */
27475 test_build_non_dependent_expr ()
27477 location_t loc
= BUILTINS_LOCATION
;
27479 /* Verify constants, without and with location wrappers. */
27480 tree int_cst
= build_int_cst (integer_type_node
, 42);
27481 ASSERT_EQ (int_cst
, build_non_dependent_expr (int_cst
));
27483 tree wrapped_int_cst
= maybe_wrap_with_location (int_cst
, loc
);
27484 ASSERT_TRUE (location_wrapper_p (wrapped_int_cst
));
27485 ASSERT_EQ (wrapped_int_cst
, build_non_dependent_expr (wrapped_int_cst
));
27487 tree string_lit
= build_string (4, "foo");
27488 TREE_TYPE (string_lit
) = char_array_type_node
;
27489 string_lit
= fix_string_type (string_lit
);
27490 ASSERT_EQ (string_lit
, build_non_dependent_expr (string_lit
));
27492 tree wrapped_string_lit
= maybe_wrap_with_location (string_lit
, loc
);
27493 ASSERT_TRUE (location_wrapper_p (wrapped_string_lit
));
27494 ASSERT_EQ (wrapped_string_lit
,
27495 build_non_dependent_expr (wrapped_string_lit
));
27498 /* Verify that type_dependent_expression_p () works correctly, even
27499 in the presence of location wrapper nodes. */
27502 test_type_dependent_expression_p ()
27504 location_t loc
= BUILTINS_LOCATION
;
27506 tree name
= get_identifier ("foo");
27508 /* If no templates are involved, nothing is type-dependent. */
27509 gcc_assert (!processing_template_decl
);
27510 ASSERT_FALSE (type_dependent_expression_p (name
));
27512 ++processing_template_decl
;
27514 /* Within a template, an unresolved name is always type-dependent. */
27515 ASSERT_TRUE (type_dependent_expression_p (name
));
27517 /* Ensure it copes with NULL_TREE and errors. */
27518 ASSERT_FALSE (type_dependent_expression_p (NULL_TREE
));
27519 ASSERT_FALSE (type_dependent_expression_p (error_mark_node
));
27521 /* A USING_DECL in a template should be type-dependent, even if wrapped
27522 with a location wrapper (PR c++/83799). */
27523 tree using_decl
= build_lang_decl (USING_DECL
, name
, NULL_TREE
);
27524 TREE_TYPE (using_decl
) = integer_type_node
;
27525 ASSERT_TRUE (type_dependent_expression_p (using_decl
));
27526 tree wrapped_using_decl
= maybe_wrap_with_location (using_decl
, loc
);
27527 ASSERT_TRUE (location_wrapper_p (wrapped_using_decl
));
27528 ASSERT_TRUE (type_dependent_expression_p (wrapped_using_decl
));
27530 --processing_template_decl
;
27533 /* Run all of the selftests within this file. */
27538 test_build_non_dependent_expr ();
27539 test_type_dependent_expression_p ();
27542 } // namespace selftest
27544 #endif /* #if CHECKING_P */
27546 #include "gt-cp-pt.h"